Algorithm.cxx

Go to the documentation of this file.

//____________________________________________________________________________
/*
 Copyright (c) 2003-2020, The GENIE Collaboration
 For the full text of the license visit http://copyright.genie-mc.org

 Costas Andreopoulos <constantinos.andreopoulos \at cern.ch>
 University of Liverpool & STFC Rutherford Appleton Laboratory
*/
//____________________________________________________________________________

#include <vector>
#include <string>
#include <sstream>

#include "Framework/Algorithm/AlgFactory.h"
#include "Framework/Algorithm/Algorithm.h"
#include "Framework/Algorithm/AlgConfigPool.h"
#include "Framework/Messenger/Messenger.h"
#include "Framework/Utils/StringUtils.h"

using std::vector;
using std::string;
using std::endl;

using namespace genie;
using namespace genie::utils;

//____________________________________________________________________________
namespace genie
{
  ostream & operator << (ostream & stream, const Algorithm & alg)
  {
    alg.Print(stream);
    return stream;
  }
}
//____________________________________________________________________________
Algorithm::Algorithm()
{
  this->Initialize();
}
//____________________________________________________________________________
Algorithm::Algorithm(string name)
{
  this->Initialize();
  fID.SetId(name);
}
//____________________________________________________________________________
Algorithm::Algorithm(string name, string config)
{
  this->Initialize();
  fID.SetId(name,config);
  this->FindConfig();
}
//____________________________________________________________________________
Algorithm::~Algorithm()
{
  this->DeleteConfig();
  this->DeleteSubstructure();
}
//____________________________________________________________________________
void Algorithm::Configure(const Registry & config)
{
// Configure the Algorithm using the input configuration Registry

  LOG("Algorithm", pNOTICE) << "Input configuration: " << config;

  if ( config.NEntries() <= 0 ) {

    LOG("Algorithm", pNOTICE) "Registry " << config.Name() << " is empty. Not added to " << fID.Name();
    return;
  }

  Registry* rp = ExtractLocalConfig( config ) ;
  if ( rp ) {

    MergeTopRegistry( *rp ) ;
    LOG("Algorithm", pNOTICE) << fID.Name() << " merged with external configuration: " << *rp;

    // The memory handled by this pointer has been copied and needs to be cleared
    delete rp ;
  }

  if(!fOwnsSubstruc) return;              // doesn't own substructure
  if(fOwnedSubAlgMp->size()==0) return;   // no sub-algorithms

  LOG("Algorithm", pNOTICE) << "Configuring algorithms stored at local pool";

  // loop over local pool algorithms

  for( AlgMapIter alg_iter = fOwnedSubAlgMp->begin();
       alg_iter != fOwnedSubAlgMp->end(); ++alg_iter) {

    string      alg_key = alg_iter->first;
    Algorithm * alg     = alg_iter->second;

    if(!alg) {
      LOG("Algorithm", pERROR)
        << "Key: " << alg_key << " points to a null algorithm at local pool";
      continue;
    }

    LOG("Algorithm", pNOTICE) << "Configuring sub-alg: " << alg->Id().Key();

    rp = ExtractLowerConfig( config, alg_key ) ;
    if ( rp ) {

      alg -> Configure( *rp ) ;

      delete rp ;

    }

  }

}
//____________________________________________________________________________
void Algorithm::Configure(string config)
{
// Configure the Algorithm looking up at the ConfigPool singleton for a
// configuration Registry corresponding to the input named parameter set.

  fID.SetConfig(config);
  this->FindConfig();
}
//____________________________________________________________________________
void Algorithm::FindConfig(void)
{
// Finds its configration Registry from the ConfigPool and gets a pointer to
// it. If the Registry comes from the ConfigPool then the Algorithm does not
// own its configuration (the ConfigPool singleton keeps the ownership and the
// responsibility to -eventually- delete all the Registries it instantiates
// by parsing the XML config files).

  DeleteConfig() ;

  AlgConfigPool * pool = AlgConfigPool::Instance();

  Registry * config = 0 ;

  // load the Default config if config is not the default
  if ( fID.Config() != "Default" ) {
    config = pool -> FindRegistry( fID.Name(), "Default" );
    if ( config ) {
      if ( config -> NEntries() > 0 ) {
        AddTopRegistry( config, false ) ;
        LOG("Algorithm", pDEBUG) << "\n" << *config;
      }
    }
  }

  // Load the right config
  config = pool->FindRegistry(this);

  if(!config)
    // notify & keep whatever config Registry was used before.
    LOG("Algorithm", pWARN)
       << "No Configuration available for "
       << this->Id().Key() << " at the ConfigPool";
  else {
    if ( config -> NEntries() > 0 ) {
      AddTopRegistry( config, false ) ;
      LOG("Algorithm", pDEBUG) << "\n" << config;
    }
  }

  const string common_key_root = "Common" ;
  std::map<string, string> common_lists;

  // Load Common Parameters if key that start with "Common" is found
  for ( unsigned int i = 0 ; i < fConfVect.size() ; ++i ) {
    const Registry & temp = * fConfVect[i] ;
    for ( RgIMapConstIter it = temp.GetItemMap().begin() ; it !=  temp.GetItemMap().end() ; ++it ) {

      // check if it is a "Common" entry
      if ( it -> first.find( common_key_root ) == 0 ) {
        // retrieve the type of the common entry
        std::string type = it -> first.substr(common_key_root.size() ) ;

        if ( temp.ItemIsLocal( it -> first ) ) {

          string temp_list = temp.GetString( it -> first ) ;
          if ( temp_list.length() > 0 ) {
            common_lists[type] = temp_list ;
          }
        }
      }

    }

  } // loop over the local registries


  for ( std::map<string, string>::const_iterator it = common_lists.begin() ;
        it != common_lists.end() ; ++it ) {

    vector<string> list = str::Split( it -> second , "," ) ;

    for ( unsigned int i = 0; i < list.size(); ++i ) {

      config = pool -> CommonList( it -> first, list[i] ) ;

      if ( ! config ) {
        LOG("Algorithm", pFATAL)
          << "No Common parameters available for " << it -> first << " list "
          << list[i] << " at the ConfigPool";

            exit( 78 ) ;
      }
      else  {
            AddLowRegistry( config, false ) ;
            LOG("Algorithm", pDEBUG) << "Loading "
                                     << it -> first << " registry "
                                     << list[i] << " \n" << config;
      }

    }

  }


  // Load Tunable from CommonParameters
  // only if the option is specified in RunOpt
  config = pool -> CommonList( "Param", "Tunable" ) ;
  if ( config ) {
    if ( config -> NEntries() > 0 ) {
      AddTopRegistry( config, false ) ;
      LOG("Algorithm", pDEBUG) << "Loading Tunable registry \n" << config;
    }
  }
  else {
    // notify & keep whatever config Registry was used before.
    LOG("Algorithm", pWARN)
      << "No Tunable parameter set available at the ConfigPool";
  }

  if ( fConfig ) {
    delete fConfig ;
    fConfig = 0 ;
  }

}

//____________________________________________________________________________

const Registry & Algorithm::GetConfig(void) const {

  if ( fConfig ) return * fConfig ;

  const_cast<Algorithm*>( this ) -> fConfig = new Registry( fID.Key() + "_summary", false ) ;

  // loop and append
  // understand the append mechanism
  for ( unsigned int i = 0 ; i < fConfVect.size(); ++i ) {
    fConfig -> Append( * fConfVect[i] ) ;
  }

  if ( fOwnsSubstruc ) {

    for ( AlgMapConstIter iter = fOwnedSubAlgMp -> begin() ;
          iter != fOwnedSubAlgMp -> end() ; ++iter ) {

      Algorithm * subalg = iter -> second ;

      LOG("Algorithm", pDEBUG) << "Appending config from " << iter -> first << " -> " << subalg -> Id() ;
      const Registry & r = subalg->GetConfig();
      RgKey prefix = iter -> first + "/";
      fConfig -> Append(r,prefix);

    }

  } //if owned substructure

  return * fConfig ;
}


//____________________________________________________________________________
Registry * Algorithm::GetOwnedConfig(void)
{

  GetConfig() ;
  return fConfig;
}
//____________________________________________________________________________
AlgCmp_t Algorithm::Compare(const Algorithm * algo) const
{
// Compares itself with the input algorithm

  string alg1    = this->Id().Name();
  string config1 = this->Id().Config();
  string alg2    = algo->Id().Name();
  string config2 = algo->Id().Config();

  if(alg1 == alg2)
  {
    if(config1 == config2) return kAlgCmpIdentical;
    else                   return kAlgCmpDiffConfig;
  }
  else return kAlgCmpDiffAlg;

  return kAlgCmpUnknown;
}
//____________________________________________________________________________
void Algorithm::SetId(const AlgId & id)
{
  fID.Copy(id);
}
//____________________________________________________________________________
void Algorithm::SetId(string name, string config)
{
  fID.SetId(name, config);
}
//____________________________________________________________________________
void Algorithm::Print(ostream & stream) const
{
  // print algorithm name & parameter-set
  stream << "\nAlgorithm Key: "  << this->fID.Key();
  stream << " - Owns Substruc: " << ((fOwnsSubstruc) ? "[true]" : "[false]");

  // print algorithm configuration
  const Registry & r = this->GetConfig();
  stream << r;

  if(fOwnsSubstruc) {
    AlgMapConstIter iter = fOwnedSubAlgMp->begin();
    for(; iter!=fOwnedSubAlgMp->end(); ++iter) {
      Algorithm * alg = iter->second;
      stream << "<Next algorithm is owned by : " << this->fID.Key() << ">";
      stream << *alg;
    }
  }
}
//____________________________________________________________________________
void Algorithm::Initialize(void)
{
// Algorithm initialization
//
  fAllowReconfig  = true;
  fOwnsSubstruc   = false;
  fConfig         = 0;
  fOwnedSubAlgMp  = 0;
}
//____________________________________________________________________________
const Algorithm * Algorithm::SubAlg(const RgKey & registry_key) const
{
// Returns the sub-algorithm pointed to this algorithm's XML config file using
// the the values of the key.
// This method asserts the existence of these keys in the XML config.
// Note: Since only 1 parameter is used, the key value should contain both the
// algorithm name and its configuration set according to the usual scheme:
// namespace::algorithm_name/configuration_set
//
  LOG("Algorithm", pINFO)
    << "Fetching sub-alg within alg: " << this->Id().Key()
                                   << " pointed to by key: " << registry_key;

  //-- if the algorithm owns its substructure:
  //      return the sub-algorithm from the local pool
  //
  if(fOwnsSubstruc) {
    AlgMapConstIter iter = fOwnedSubAlgMp->find(registry_key);
    if(iter!=fOwnedSubAlgMp->end()) return iter->second;
    LOG("Algorithm", pERROR)
      << "Owned sub-alg pointed to by key: " << registry_key
      << " was not found within alg: " << this->Id().Key();
     return 0;
  }

  //-- if the algorithm does not own its substructure:
  //      return the sub-algorithm from the AlgFactory's pool
  RgAlg alg ;
  GetParam( registry_key, alg ) ;

  LOG("Algorithm", pINFO)
    << "Registry key: " << registry_key << " points to algorithm: " << alg;

  // retrieve the Algorithm object from the the Algorithm factory
  AlgFactory * algf = AlgFactory::Instance();
  const Algorithm * algbase = algf->GetAlgorithm(alg.name, alg.config);
  assert(algbase);

  return algbase;
}
//____________________________________________________________________________
void Algorithm::AdoptConfig(void) {

  LOG("Algorithm", pNOTICE)
    << this->Id().Key() << " is taking ownership of its configuration";

  // if(fOwnsConfig) {
  //   LOG("Algorithm", pWARN)
  //     << this->Id().Key() << " already owns its configuration!";
  //   return;
  // }

  this->Configure( GetConfig() );
}
//____________________________________________________________________________
void Algorithm::AdoptSubstructure(void)
{
// Take ownership of the algorithms subtructure (sub-algorithms,..) by copying
// them from the AlgFactory pool to the local pool. Also bring all the
// configuration variables to the top level. See the header for more details.
// A secial naming convention is required for configuration parameter keys
// for parameters belonging to sub-algorithms (or sub-algorithms of these
// sub-algorithms and so on...).
// The convention is: "sub-alg-key/sub-sub-alg-key/.../original name"
// This is a recursive method: The AdoptSubtructure()of all sub-algorithms is
// invoked.
//
  LOG("Algorithm", pNOTICE)
     << "Algorithm: " << this->Id().Key() << " is adopting its substructure";

//  Registry deep_config;
//  deep_config.UnLock();
//  deep_config.SetName(this->Id().Key());

  //  deep_config.SetName(this->Id().Config() + ";D");
  //  fID.SetConfig(this->Id().Config() + ";D");

  if(fOwnsSubstruc) this->DeleteSubstructure();

  fOwnedSubAlgMp = new AlgMap;
  fOwnsSubstruc  = true;

  AlgFactory * algf = AlgFactory::Instance();

  const RgIMap & rgmap = GetConfig().GetItemMap();

  RgIMapConstIter iter = rgmap.begin();
  for( ; iter != rgmap.end(); ++iter) {

    RgKey reg_key = iter->first;
    RegistryItemI * ri = iter->second;

    if(ri->TypeInfo() == kRgAlg) {
        LOG("Algorithm", pDEBUG)
                 << "Found sub-algorithm pointed to by " << reg_key;
        RgAlg reg_alg = fConfig->GetAlg(reg_key);
        AlgId id(reg_alg);

        LOG("Algorithm", pDEBUG) << "Adopting sub-algorithm = " << id.Key();
        Algorithm * subalg = algf->AdoptAlgorithm(id.Name(),id.Config());
        subalg->AdoptSubstructure();

        LOG("Algorithm", pDEBUG) << "Adding sub-algorithm to local pool";
        AlgMapPair key_alg_pair(reg_key, subalg);
        fOwnedSubAlgMp->insert(key_alg_pair);

    }

  }


  if ( fConfig ) {
    delete fConfig ;
    fConfig = 0 ;
  }

}
//____________________________________________________________________________
void Algorithm::DeleteConfig(void)
{
  // there is nothing to delete if the configuration is not owned but is
  // rather looked up from the configuration pool
  //

  for ( unsigned int i = 0 ; i < fConfVect.size() ; ++i ) {
    if ( fOwnerships[i] ) {
      delete fConfVect[i] ;
    }
  }

  fConfVect.clear() ;
  fOwnerships.clear() ;

  // delete owned configuration registry

  if(fConfig) {
    delete fConfig;
    fConfig=0;
  }

}

//____________________________________________________________________________
void Algorithm::DeleteSubstructure(void)
{
  // there is nothing to delete if the sub-algorithms are not owned but rather
  // taken from the AlgFactory's pool
  //
  if(!fOwnsSubstruc) return;

  // delete local algorithm pool
  //
  AlgMapIter iter = fOwnedSubAlgMp->begin();
  for( ; iter != fOwnedSubAlgMp->end(); ++iter) {
    Algorithm * alg = iter->second;
    if(alg) {
      delete alg;
      alg=0;
    }
  }
  delete fOwnedSubAlgMp;
  fOwnedSubAlgMp = 0;
}
//____________________________________________________________________________

string  Algorithm::BuildParamVectKey( const std::string & comm_name, unsigned int i ) {

  std::stringstream name;
  name << comm_name << '-' << i ;
  return name.str() ;

}

//____________________________________________________________________________

string  Algorithm::BuildParamVectSizeKey( const std::string & comm_name ) {

  return 'N' + comm_name + 's' ;

}

//____________________________________________________________________________

int  Algorithm::GetParamVectKeys( const std::string & comm_name, std::vector<RgKey> & k,
                                  bool is_top_call ) const {

  k.clear() ;

  int n ;
  std::string n_name = Algorithm::BuildParamVectSizeKey( comm_name ) ;

  bool found = GetParam( n_name, n, is_top_call ) ;

  if ( ! found ) {
    return 0 ;
  }

  for ( int i = 0; i < n; ++i ) {

    RgKey temp_key = Algorithm::BuildParamVectKey( comm_name, i ) ;

    // potentially, if it is a top call,
    // we might want to check if the key actually exist in the global Registry
    // Not a priority irght now

    k.push_back( temp_key ) ;
  }

  return k.size() ;
}


//____________________________________________________________________________
Registry * Algorithm::ExtractLocalConfig( const Registry & in ) const {

  const RgIMap & rgmap = in.GetItemMap();
  Registry * out = new Registry( in.Name(), false );

  for( RgIMapConstIter reg_iter = rgmap.begin();
       reg_iter != rgmap.end(); ++reg_iter ) {

    RgKey reg_key = reg_iter->first;
    if( reg_key.find( '/' ) != string::npos) continue;

    // at this point
    // this key is referred to the local algorithm
    // it has to be copied in out;

    RegistryItemI * ri = reg_iter->second;
    RgIMapPair key_item_pair( reg_key, ri->Clone() );
    out -> Set(key_item_pair);

  }

  if ( out -> NEntries() <= 0 ) {
    delete out ;
    out = 0 ;
  }

  return out ;
}

//____________________________________________________________________________

Registry * Algorithm::ExtractLowerConfig( const Registry & in, const string & alg_key ) const {

  const RgIMap & rgmap = in.GetItemMap();
  Registry * out = new Registry( in.Name(), false );

  for( RgIMapConstIter reg_iter = rgmap.begin();
       reg_iter != rgmap.end(); ++reg_iter ) {

    RgKey reg_key = reg_iter->first;
    if( reg_key.find(alg_key+"/") == string::npos) continue;

    // at this point
    // this key is referred to the sub-algorithm
    // indicated by alg_key: it has to be copied in out;

    int new_key_start = reg_key.find_first_of('/')+1;
    RgKey new_reg_key = reg_key.substr( new_key_start, reg_key.length() );

    RegistryItemI * ri = reg_iter->second;
    RgIMapPair key_item_pair(new_reg_key, ri->Clone());
    out -> Set(key_item_pair);

  }

  if ( out -> NEntries() <= 0 ) {
    delete out ;
    out = 0 ;
  }

  return out ;

}


//____________________________________________________________________________

int Algorithm::AddTopRegistry( Registry * rp, bool own ) {

  fConfVect.insert( fConfVect.begin(), rp ) ;
  fOwnerships.insert( fOwnerships.begin(), own ) ;

  if ( fConfig ) {
    delete fConfig ;
    fConfig = 0 ;
  }

  return fConfVect.size() ;

}

//____________________________________________________________________________

int Algorithm::AddLowRegistry( Registry * rp, bool own ) {

  fConfVect.push_back( rp ) ;
  fOwnerships.push_back( own ) ;

  if ( fConfig ) {
    delete fConfig ;
    fConfig = 0 ;
  }

  return fConfVect.size() ;

}

//____________________________________________________________________________


int  Algorithm::MergeTopRegistry( const Registry & r )  {

  if ( fOwnerships.empty() ) {

        // this algorithm is not configured right now, the incoming registry is the only configuration
    Registry * p = new Registry( r ) ;
        AddTopRegistry( p ) ;

        return 1 ;
  }

  if ( fOwnerships[0] ) {
        //the top registry is owned: it can be changed with no consequences for other algorithms
    fConfVect[0] -> Merge( r ) ;
  }
  else {
        // The top registry is not owned so it cannot be changed
        // The registry will be added with top priority

        Registry * p = new Registry( r ) ;
        AddTopRegistry( p ) ;
  }

  // The configuration has changed so the summary is not updated anymore and must be deleted
  if ( fConfig ) {
     delete fConfig ;
     fConfig = 0 ;
  }

  return fConfVect.size() ;
}

//____________________________________________________________________________


int Algorithm::AddTopRegisties( const vector<Registry*> & rs, bool own ) {

  fConfVect.insert( fConfVect.begin(), rs.begin(), rs.end() ) ;

  fOwnerships.insert( fOwnerships.begin(), rs.size(), own ) ;

  if ( fConfig ) {
    delete fConfig ;
    fConfig = 0 ;
  }

  return fConfVect.size() ;

}