VolumeTreeNavigator.cxx

Go to the documentation of this file.

/*
  Copyright (C) 2002-2022 CERN for the benefit of the ATLAS collaboration
*/
 
//                              //
//          VolumeTreeNavigator.cxx         //
//  Class containing functions to allow a general       //
//  navigation of uniquely specified GEANT4 volumes     //
//  and collection of their tree patterns and locations.    //
//                              //
//  Written by  Kevin Sapp              //
//          University of Pittsburgh        //
//          kcs34@pitt.edu              //
//  Last update 02.03.10                //
//                              //
 
#include "VolumeTreeNavigator.h"
 
#include <string>
#include <vector>
#include <utility>
 
#include "G4Track.hh"
#include "G4StepPoint.hh"
#include "G4VProcess.hh"
#include "G4TouchableHistory.hh"
#include "G4VPhysicalVolume.hh"
#include "G4LogicalVolume.hh"
 
using std::string;  using std::vector;
using std::pair;    using std::make_pair;
 
VolumeTreeNavigator::VolumeTreeNavigator(const G4Step* aStep) :
  AthMessaging("VolumeTreeNavigator"),
  m_track(0), m_preHistory(0), m_preDepth(0), m_stepNo(0)
 
{
  // collect full set of volume tree data
  m_track = aStep->GetTrack();
  m_preStepPoint = aStep->GetPreStepPoint();
  m_postStepPoint = aStep->GetPostStepPoint();
  m_preHistory = dynamic_cast<const G4TouchableHistory*>(m_preStepPoint->GetTouchable());
  m_preDepth = m_preHistory->GetHistoryDepth();
  m_stepNo = m_track->GetCurrentStepNumber();
 
  if (!m_history.empty()) m_history.clear();
 
  // consolidate volume data into a vector
  for (G4int c = m_preDepth; c + 1 != 0; c--) {
      G4VPhysicalVolume* thPV = m_preHistory->GetVolume(c);
      int thPVRep = (int)(thPV->GetCopyNo());
      pair<G4VPhysicalVolume*, int> thPVID = make_pair(thPV, thPVRep);
      m_history.push_back(thPVID);
  }
  ATH_MSG_DEBUG("history size: "<< m_history.size());
 
  // Set h_end to specify full history unless otherwise chosen by DepthCut functions, and
  // set h_nav to start at the lowest accessible level, h_end - 1.
  m_h_end = m_history.end();
  m_h_nav = m_h_end-1;
}
 
void VolumeTreeNavigator::SetDepthCutSimple(const int CALO, const int BeamPipe, const int IDET, const int MUONQ02)
{
  unsigned int cut = m_history.size();
  if ( m_history.size() > 1 ) {
      const string name = stringify(m_history[1].first->GetName());
      if (name == "CALO::CALO")         cut = CALO+1;
      else if (name == "BeamPipe::BeamPipe")    cut = BeamPipe+1;
      else if (name == "IDET::IDET" || name == "ITK::ITK")      cut = IDET+1;
      else if (name == "MUONQ02::MUONQ02")  cut = MUONQ02+1;
      else { ATH_MSG_INFO("Level 1 volume not found, output default depth"); }
  }
  else if ( m_history.empty() ) {
      ATH_MSG_FATAL("No volumes in history, run will terminate!");
  }
 
  if ( cut > m_history.size() )  cut = m_history.size();
  m_h_end = m_history.begin();
  advance(m_h_end, cut);
  m_h_nav = m_h_end-1;
  ATH_MSG_DEBUG("VolumeTreeNavigator::SetDepthCutSimple at "<< m_h_nav->first->GetName());
  return;
}
 
void VolumeTreeNavigator::SetDepthCutDetail(const char* cpath)
{
  static const vector<string> volumes = [&]() {
      vector<string> v;
      msg() << MSG::INFO <<"SetDepthCutDetail path parsed as ";
      string path = stringify(cpath);
      string::size_type slash = 0;
      string::size_type start = path.find_first_not_of( '/' );
      while ( slash != string::npos ) {
          start = slash+1;
          slash = path.find_first_of( '/', start );
          v.push_back( path.substr(start, slash-start) );
          msg() << MSG::INFO <<"/"<<volumes.back();
      }
      msg() << endmsg;
      return v;
  }();
 
  m_h_nav = m_h_end;
  vector<string>::const_iterator v_nav = volumes.begin();
  advance( v_nav, distance( m_history.begin(), m_h_nav ) );
  while ( v_nav != volumes.end() && m_h_nav != m_history.end() ) {
      if ( *v_nav == stringify( m_h_nav->first->GetName() ) ) {
          ++m_h_nav;
          ++v_nav; }
      else {
          break; }
  }
  m_h_end = m_h_nav;
  m_h_nav = m_h_end-1;
  ATH_MSG_INFO("VolumeTreeNavigator::SetDepthCutDetail at "<< m_h_nav->first->GetName());
  return;
}
 
VolTree VolumeTreeNavigator::Extract()
{
  // Derive a permanent VolTree object from the current volume and its history
  VolTree ret;
  for (VolNav t = m_history.begin(); t != m_h_nav+1; ++t) {
      ret.push_back(*t);
  }
  ATH_MSG_DEBUG("VolumeTreeNavigator::Extract succeeded for "<< m_h_nav->first->GetName() <<".");
  return ret;
}
 
bool VolumeTreeNavigator::Ascend(int levels) {
  // Move up # of levels given in the navigable history, stop at Atlas::Atlas
  if ( !m_history.empty() )
  {
      if ( distance( m_history.begin(), m_h_nav ) == 0 || levels == 0 )  return 0;
      else if ( abs(levels) > abs(distance( m_history.begin(), m_h_nav )) )
          levels = abs(distance( m_history.begin(), m_h_nav ));
      advance(m_h_nav, -abs(levels));
      return 1;
  }
  else return 0;
}
 
bool VolumeTreeNavigator::Descend(int levels)
{
  // Move down # of levels given in the navigable history
  if ( !m_history.empty() )
  {
      if ( distance(m_h_nav, m_h_end) == 1 || levels == 0 )  return 0;
      else if ( abs(levels) > abs(distance( m_h_nav, m_h_end-1 )) )
          levels = abs(distance( m_h_nav, m_h_end-1 ));
      advance(m_h_nav, abs(levels));
      return 1;
  } 
  else return 0;
}
 
bool VolumeTreeNavigator::KillProcesses(const int numProc, const char* pr1, ...)
{
  // Checks for disallowed processes, and if found returns true; accepts arbitrary number
  // of process names.
  const G4VProcess* pds = m_postStepPoint->GetProcessDefinedStep();
  va_list procs;
 
  if ( pds ) {
      std::string name_string = stringify( pds->GetProcessName() );
      const char* name = name_string.c_str();
      va_start(procs, pr1);
      for ( int i = 0; i != numProc; i++ ) {
          if ( name == va_arg(procs, const char*) ) {
              ATH_MSG_DEBUG(name <<" process triggered - return");
              va_end(procs);
              return 1;
          }
      }
      va_end(procs);
  }
  return 0;
}