In This Package:

DrawHistoryAlg Class Reference

#include <DrawHistoryAlg.h>

Inheritance diagram for DrawHistoryAlg:

[legend]Collaboration diagram for DrawHistoryAlg:[legend]List of all members.

Public Member Functions
	DrawHistoryAlg (const std::string &name, ISvcLocator *pSvcLocator)
virtual	~DrawHistoryAlg ()
virtual StatusCode	initialize ()
virtual StatusCode	execute ()
virtual StatusCode	finalize ()
virtual StatusCode	sysExecute ()
void	put (IDataProviderSvc *svc, DataObject *object, const std::string &address, const bool useRootInTES=true) const
void	put (DataObject *object, const std::string &address, const bool useRootInTES=true) const
Gaudi::Utils::GetData< TYPE >::return_type	get (IDataProviderSvc *svc, const std::string &location, const bool useRootInTES=true) const
Gaudi::Utils::GetData< TYPE >::return_type	get (const std::string &location, const bool useRootInTES=true) const
TYPE *	getDet (IDataProviderSvc *svc, const std::string &location) const
TYPE *	getDet (const std::string &location) const
bool	exist (IDataProviderSvc *svc, const std::string &location, const bool useRootInTES=true) const
bool	exist (const std::string &location, const bool useRootInTES=true) const
bool	existDet (IDataProviderSvc *svc, const std::string &location) const
bool	existDet (const std::string &location) const
TYPE *	getOrCreate (IDataProviderSvc *svc, const std::string &location, const bool useRootInTES=true) const
TYPE *	getOrCreate (const std::string &location, const bool useRootInTES=true) const
bool	registerContext () const
INTupleSvc *	evtColSvc () const
IAlgContextSvc *	contextSvc () const
TOOL *	tool (const std::string &type, const std::string &name, const IInterface *parent=0, bool create=true) const
TOOL *	tool (const std::string &type, const IInterface *parent=0, bool create=true) const
SERVICE *	svc (const std::string &name, const bool create=true) const
IUpdateManagerSvc *	updMgrSvc () const
IDataProviderSvc *	fastContainersSvc () const
StatusCode	Error (const std::string &msg, const StatusCode st=StatusCode::FAILURE, const size_t mx=10) const
StatusCode	Warning (const std::string &msg, const StatusCode st=StatusCode::FAILURE, const size_t mx=10) const
StatusCode	Print (const std::string &msg, const StatusCode st=StatusCode::SUCCESS, const MSG::Level lev=MSG::INFO) const
StatusCode	Assert (const bool ok, const std::string &message="", const StatusCode sc=StatusCode(StatusCode::FAILURE, true)) const
StatusCode	Assert (const bool ok, const char *message, const StatusCode sc=StatusCode(StatusCode::FAILURE, true)) const
StatusCode	Exception (const std::string &msg, const GaudiException &exc, const StatusCode sc=StatusCode(StatusCode::FAILURE, true)) const
StatusCode	Exception (const std::string &msg, const std::exception &exc, const StatusCode sc=StatusCode(StatusCode::FAILURE, true)) const
StatusCode	Exception (const std::string &msg="no message", const StatusCode sc=StatusCode(StatusCode::FAILURE, true)) const
MsgStream &	msgStream (const MSG::Level level) const
MsgStream &	always () const
MsgStream &	fatal () const
MsgStream &	err () const
MsgStream &	error () const
MsgStream &	warning () const
MsgStream &	info () const
MsgStream &	debug () const
MsgStream &	verbose () const
MsgStream &	msg () const
const Statistics &	counters () const
StatEntity &	counter (const std::string &tag) const
MSG::Level	msgLevel () const
bool	msgLevel (const MSG::Level level) const
void	resetMsgStream () const
bool	typePrint () const
bool	propsPrint () const
bool	statPrint () const
bool	errorsPrint () const
long	printStat (const MSG::Level level=MSG::ALWAYS) const
long	printErrors (const MSG::Level level=MSG::ALWAYS) const
long	printProps (const MSG::Level level=MSG::ALWAYS) const
void	registerCondition (const std::string &condition, StatusCode(CallerClass::*mf)()=NULL)
void	registerCondition (const std::string &condition, CondType *&condPtrDest, StatusCode(CallerClass::*mf)()=NULL)
void	registerCondition (char *condition, StatusCode(CallerClass::*mf)()=NULL)
void	registerCondition (TargetClass *condition, StatusCode(CallerClass::*mf)()=NULL)
StatusCode	runUpdate ()
TransientFastContainer< T > *	getFastContainer (const std::string &location, typename TransientFastContainer< T >::size_type initial=0)
StatusCode	release (const IInterface *interface) const
unsigned long	release ()
const std::string &	context () const
const std::string &	rootInTES () const
double	globalTimeOffset () const
virtual StatusCode	sysStart ()
virtual StatusCode	sysInitialize ()
virtual StatusCode	sysReinitialize ()
virtual StatusCode	sysRestart ()
virtual StatusCode	sysStop ()
virtual StatusCode	sysFinalize ()
virtual StatusCode	sysBeginRun ()
virtual StatusCode	sysEndRun ()
virtual const std::string &	name () const
virtual const std::string &	version () const
virtual StatusCode	configure ()
virtual StatusCode	terminate ()
virtual StatusCode	start ()
virtual StatusCode	stop ()
virtual StatusCode	reinitialize ()
virtual StatusCode	restart ()
virtual bool	isExecuted () const
virtual void	setExecuted (bool state)
virtual void	resetExecuted ()
virtual StatusCode	beginRun ()
virtual StatusCode	endRun ()
virtual Gaudi::StateMachine::State	FSMState () const
virtual Gaudi::StateMachine::State	targetFSMState () const
virtual bool	isEnabled () const
virtual bool	filterPassed () const
virtual void	setFilterPassed (bool state)
StatusCode	service (const std::string &name, T *&psvc, bool createIf=true) const
StatusCode	service (const std::string &svcType, const std::string &svcName, T *&psvc) const
void	setOutputLevel (int level)
IAuditorSvc *	auditorSvc () const
IChronoStatSvc *	chronoSvc () const
IChronoStatSvc *	chronoStatService () const
IDataProviderSvc *	detSvc () const
IDataProviderSvc *	detDataService () const
IConversionSvc *	detCnvSvc () const
IConversionSvc *	detDataCnvService () const
IDataProviderSvc *	eventSvc () const
IDataProviderSvc *	evtSvc () const
IDataProviderSvc *	eventDataService () const
IConversionSvc *	eventCnvSvc () const
IConversionSvc *	eventDataCnvService () const
IHistogramSvc *	histoSvc () const
IHistogramSvc *	histogramDataService () const
IMessageSvc *	msgSvc () const
IMessageSvc *	messageService () const
INTupleSvc *	ntupleSvc () const
INTupleSvc *	ntupleService () const
IRndmGenSvc *	randSvc () const
IToolSvc *	toolSvc () const
IExceptionSvc *	exceptionSvc () const
ISvcLocator *	serviceLocator () const
ISvcLocator *	svcLoc () const
StatusCode	createSubAlgorithm (const std::string &type, const std::string &name, Algorithm *&pSubAlg)
std::vector< Algorithm * > *	subAlgorithms () const
virtual StatusCode	setProperty (const Property &p)
virtual StatusCode	setProperty (const std::string &s)
virtual StatusCode	setProperty (const std::string &n, const std::string &v)
StatusCode	setProperty (const std::string &name, const TYPE &value)
virtual StatusCode	getProperty (Property *p) const
virtual const Property &	getProperty (const std::string &name) const
virtual StatusCode	getProperty (const std::string &n, std::string &v) const
virtual const std::vector< Property * > &	getProperties () const
StatusCode	setProperties ()
Property *	declareProperty (const std::string &name, T &property, const std::string &doc="none") const
Property *	declareRemoteProperty (const std::string &name, IProperty *rsvc, const std::string &rname="") const
IMonitorSvc *	monitorSvc () const
void	declareInfo (const std::string &name, const T &var, const std::string &desc) const
void	declareInfo (const std::string &name, const std::string &format, const void *var, int size, const std::string &desc) const
unsigned long	addRef ()
StatusCode	queryInterface (const InterfaceID &riid, void **)
Static Public Member Functions
static const InterfaceID &	interfaceID ()
static const InterfaceID &	interfaceID ()
static const InterfaceID &	interfaceID ()
Public Attributes
	SUCCESS
	NO_INTERFACE
	VERSMISMATCH
	LAST_ERROR
Protected Types
typedef std::map< std::string, StatEntity >	Statistics
typedef std::map< std::string, unsigned int >	Counter
typedef std::vector< IAlgTool * >	AlgTools
typedef std::pair< IInterface *, std::string >	ServiceEntry
typedef std::vector< ServiceEntry >	Services
Protected Member Functions
StatusCode	releaseTool (const IAlgTool *tool) const
StatusCode	releaseSvc (const IInterface *svc) const
bool	isInitialized () const
bool	isFinalized () const
int	outputLevel () const
IntegerProperty &	outputLevelProperty ()
void	initOutputLevel (Property &prop)
Static Protected Attributes
static const bool	IgnoreRootInTES
static const bool	UseRootInTES
Private Member Functions
std::string	particleName (int pdg)
bool	volumeInfo (DayaBay::SimVertex &v, std::string &name, std::string &material)
Private Attributes
std::string	m_location
std::string	m_track_filename
std::string	m_trackandvertex_filename
int	m_do_hits
std::string	m_topGeoPath
IParticlePropertySvc *	m_ppSvc

---

Detailed Description

Definition at line 11 of file DrawHistoryAlg.h.

---

Constructor & Destructor Documentation

DrawHistoryAlg::DrawHistoryAlg	(	const std::string &	name,
		ISvcLocator *	pSvcLocator
	)

Definition at line 32 of file DrawHistoryAlg.cc.

    : GaudiAlgorithm(name,pSvcLocator)
{
    declareProperty("Location",m_location= DayaBay::SimHeaderLocation::Default,
                     "Location in the TES to get Event data");
    declareProperty("track_filename",m_track_filename = "tracks_%d.dot",
                    "Filename to write track structure. Use '\%d' to indicate event number.");
    declareProperty("trackandvertex_filename",m_trackandvertex_filename = "tracks_and_vertices_%d.dot",
                    "Filename to write track structure. Use '\%d' to indicate event number.");
    declareProperty("do_hits",m_do_hits = true,
                    "1 to make hits in track plot, 0 to ignore them.");
    declareProperty("Geometry",m_topGeoPath = "/dd/Structure/DayaBay",
                    "Top level geometry structure element.");
}

DrawHistoryAlg::~DrawHistoryAlg

(

)

[virtual]

Definition at line 47 of file DrawHistoryAlg.cc.

{
}

---

Member Function Documentation

StatusCode DrawHistoryAlg::initialize

(

)

[virtual]

Reimplemented from GaudiAlgorithm.

Definition at line 51 of file DrawHistoryAlg.cc.

{
 // service retrieval
  m_ppSvc =0;
  StatusCode sc = service("ParticlePropertySvc",m_ppSvc,true);
  if(sc.isFailure()){
    err() << "Cant' get a ParticlePropertySvc pointer." << endreq;
    return StatusCode::FAILURE;
  }  

  return StatusCode::SUCCESS;
}

StatusCode DrawHistoryAlg::execute

(

)

[virtual]

Reimplemented from GaudiAlgorithm.

Definition at line 104 of file DrawHistoryAlg.cc.

{
  using std::endl;
  
  DayaBay::SimHeader* header = 0;
  if (exist<DayaBay::SimHeader>(evtSvc(),m_location)) {
     header = get<DayaBay::SimHeader>(m_location);
  }
  if(!header) {
    warning() << "No SimHeader found." <<endreq;
    return StatusCode::SUCCESS;
  }

  const SimParticleHistory* h = header->particleHistory();
  if(!h) {
    warning() << "No SimParticleHistory found!" << endreq;
    return StatusCode::SUCCESS;
  }

  
  // Dot file of vertex and tracks.

  // sort filename
  std::string filename = m_trackandvertex_filename;
  {
    std::string::size_type dpos = filename.find("%d");
    if(dpos!=std::string::npos) {
      std::ostringstream oss; 
      oss << header->execNumber();
      filename.replace(dpos,2,oss.str());
    }
  }
  
  std::ofstream dot(filename.c_str());
  dot << "digraph G {" << endl;
  const std::list<SimTrack*>& tracks = h->tracks();
  std::list<SimTrack*>::const_iterator tit;
  for(tit = tracks.begin();tit!= tracks.end(); ++tit) {
    const SimTrack* t= *tit;
    const std::vector<SimVertex*>& vertices = t->vertices();
    dot << "// SimTrack id " << t->trackId() << endl;
    // Name the first vertex.
    dot << "v" << (long)(vertices[0]) 
               << " [label=\""
               << "SimTrack Start " << t->trackId()
               <<"\"]" << endl;

    // point back to parent vertex.
    // SimVertex* parent = t->parentVertex().vertex();
    // if(parent)  {
    //   dot << "v" << (int)(parent) <<" -> v" << (int)(vertices[0]);
    //   if(t->parentVertex().isDirect()) dot << " [ style = bold] ";
    //   else                             dot << " [ style = dotted ]";
    //   dot << ";" << endl;
    // }
    
    // Now the track chain.
    dot << "subgraph cluster" << t->trackId() <<" {" << endl;
    dot << "  label = \"SimTrack " << t->trackId()
        << "\\n" << particleName(t->particle())
        << "\\nparent=" << t->parentParticle()
        << "\\n" << "KE=" << t->vertices()[0]->kineticEnergy()/CLHEP::MeV << " MeV";
      for(SimTrack::descendants_map::const_iterator udit = t->unrecordedDescendants().begin();
          udit != t->unrecordedDescendants().end();
          ++udit) {
          dot << "\\n" << udit->second << " skipped of type " << particleName(udit->first);
      }
      dot << "\";" << endl;
    
    assert(vertices.size()>0);
         
    // The chain of vertices along the track.
    for(unsigned int iv = 1; iv<vertices.size(); iv++) {
      dot << "  v" << long(vertices[iv-1]) << "  -> v" << long(vertices[iv]);
      // Compute distance, dE,dx.
      double dx = (vertices[iv]->position()-vertices[iv-1]->position()).R();
      double dE = (vertices[iv]->totalEnergy()-vertices[iv-1]->totalEnergy());
      dot << "[label=\""
          << "dx=" << dx/CLHEP::cm << " cm"
          << "\\ndE=" << dE/CLHEP::MeV << " MeV"
          << "\"]";
      dot << ";" << endl;
    }

    dot << "}" << endl;
    // Do secondaries.
    for(unsigned int iv = 0; iv<vertices.size(); iv++) {
      const SimVertex* v = vertices[iv];
      const std::vector<SimTrackReference>& secs = v->secondaries();
      for(unsigned int isec = 0; isec < secs.size(); ++ isec){
        const SimTrack*  trk = secs[isec].track();
        if(trk) {
          dot << "v" << (long)v << " -> v" << (long)(trk->vertices()[0]);
          if(secs[isec].isIndirect())
            dot << "[ style = dotted ]";
          dot << ";" << endl;
        }
      }
    }    
  }
  
  // Just declare each vertex, see if there are wierd ones around.
  const std::list<SimVertex*>& verts = h->vertices();
  dot << endl << "// Dump of all " << verts.size() << " vertices" << endl;
  std::list<SimVertex*>::const_iterator vit;
  for(vit = verts.begin(); vit!= verts.end(); ++vit) {
    SimVertex* v = *vit;
    dot << "v" << (long)(v);  
    dot << " [label=\""; 
    dot << v->kineticEnergy()/CLHEP::MeV << " MeV";

    std::string name, material;
    if (volumeInfo(*v,name,material)) {
        dot << "\\n" << name;
        dot << "\\n" << material;
    }
    dot << "\"]" << endl;
    dot << ";" << endl;
  }
  dot << "}" << endl;
  dot.close();
  
  // Dot file of tracks, hits, and primaries.
  
  // sort filename
  filename = m_track_filename;
  {
    std::string::size_type dpos = filename.find("%d");
    if(dpos!=std::string::npos) {
      std::ostringstream oss;
      oss << header->execNumber();
      filename.replace(dpos,2,oss.str());
    }
  }
  
  dot.open(filename.c_str());
  dot << "digraph G {" << endl;

  // Create hooks from primary particles to first tracks.
  std::set<const HepMC::GenEvent*> primaryEvents;
  const std::list<const SimTrack*>& primaries = h->primaryTracks();
  std::list<const SimTrack*>::const_iterator it;
  for(it = primaries.begin();it!= primaries.end(); ++it) {
    // Get the primary.
    const HepMC::GenParticle* primaryParticle =  (*it)->primaryParticle();
    const HepMC::GenEvent* gev = primaryParticle->parent_event();
    primaryEvents.insert(gev);
    dot << "  primaryEvent" << (long)(gev) << ":genpar" << (long)(primaryParticle);
    dot << " -> track" << (long)(*it) << endl; 
  }
  
  // create record-like nodes for the primary events.
  std::set<const HepMC::GenEvent*>::iterator gevit;
  for(gevit = primaryEvents.begin() ; gevit != primaryEvents.end(); gevit++){
    const HepMC::GenEvent* gev = *gevit;
    dot << "  primaryEvent" << (long)(gev) << " [shape=record,rank=source,label=\"{";
    dot << "event " << gev->event_number() <<"\\nprocess_id=" << gev->signal_process_id() << "| {";
    
    HepMC::GenEvent::particle_const_iterator parit = gev->particles_begin();
    while(parit != gev->particles_end()) {
      const HepMC::GenParticle* gpar = *parit;
      HepMC::FourVector momentum(gpar->momentum());
      double pmag = HepMC::ThreeVector(momentum).mag();
      double ke = momentum.e() - sqrt(momentum.e()*momentum.e() - pmag*pmag);
      dot << "<" << "genpar" << (long)(gpar) << "> ";
      dot << particleName(gpar->pdg_id())
          << "\\n KE=" << ke/CLHEP::MeV << " MeV";
      parit++;
      if(parit != gev->particles_end()) dot << " | ";
    }
    
    dot << "} }\"];" << endl;    
  }
   

  // Now the actual tracks.
  dot << "subgraph cluster_of_the_tracks {" << endl;
  for(tit = tracks.begin();tit!= tracks.end(); ++tit) {
    const SimTrack* t= *tit;
    dot << "track" << (long)(t)
        << "[label=\""
        << "SimTrack " << t->trackId()
        << "\\n" << particleName(t->particle())
        //<< "\\nparent=" << t->parentParticle()
        << "\\n" << t->vertices()[0]->process().type() << " " <<  t->vertices()[0]->process().name()
        << "\\n" << "KE=" << t->vertices()[0]->kineticEnergy()/CLHEP::MeV << " MeV"
        << "\\n" << "with " << t->vertices().size() << " vertices";
      for(SimTrack::descendants_map::const_iterator udit = t->unrecordedDescendants().begin();
          udit != t->unrecordedDescendants().end();
          ++udit) {
          dot << "\\n" << udit->second << " skipped of type " << particleName(udit->first);
       }        
    dot << "\"];" << endl;

    if(t->ancestorTrack().track()) {
      dot << "track" << (long)(t->ancestorTrack().track()) << " -> track" <<  (long)(t);
      if(! t->ancestorTrack().isDirect())
        dot << " [ style = dotted label=\"" << t->ancestorTrack().indirection() << "\"]";
      dot << ";" << endl;
    }
  }
  dot << "}" << endl; // end subgraph
  
  
  // Now the hits that resulted from the tracks.
  if(m_do_hits) {
    SimHitHeader::hc_map::const_iterator hcit = header->hits()->hitCollection().begin();
    for( ; hcit != header->hits()->hitCollection().end(); hcit ++){
      const SimHitCollection* hc = hcit->second;
      for(unsigned int ihit = 0; ihit<hc->collection().size(); ihit++) {
        const SimHit* simhit = hc->collection()[ihit];
        // the simhit description.
      
        dot << "simhit" << (long)(simhit) << "[shape=triangle,rank=sink,label=\"";
        if(dynamic_cast<const SimPmtHit*>(simhit))       dot << "Pmt";
        else if(dynamic_cast<const SimRpcHit*>(simhit))  dot << "Rpc";
        else                                             dot << "Hit";      
        dot << "\\nID=" 
            << ((simhit->sensDetId()&(0xFF000000))>>24) << "."
            << ((simhit->sensDetId()&(0xFF0000))>>16) <<  "."
            << ((simhit->sensDetId()&(0xFF00))>>8) << "."
            << ((simhit->sensDetId()&(0xFF)))
            <<"\"];" << endl;
      
        // connect track to hit.
        dot << " track" << (long)(simhit->ancestor().track()) << " -> simhit" << (long)(simhit);
        if(! simhit->ancestor().isDirect())
           dot << " [ headport = n, style = dotted, label=\"" << simhit->ancestor().indirection() << "\"]";
        dot << ";" << endl;
      }
    }
  }

  dot << "}" << endl;
  dot.close();
  
  return StatusCode::SUCCESS;
}

StatusCode DrawHistoryAlg::finalize

(

)

[virtual]

Reimplemented from GaudiAlgorithm.

Definition at line 64 of file DrawHistoryAlg.cc.

{
  return StatusCode::SUCCESS;
}

std::string DrawHistoryAlg::particleName

(

int

pdg

)

[private]

Definition at line 69 of file DrawHistoryAlg.cc.

{
  ParticleProperty* p = m_ppSvc->findByStdHepID(pdg);
  if(p) return p->particle();
  std::ostringstream oss;
  oss << "[" << pdg << "]";
  return oss.str();
}

bool DrawHistoryAlg::volumeInfo	(	DayaBay::SimVertex &	v,
		std::string &	name,
		std::string &	material
	)			[private]

Definition at line 78 of file DrawHistoryAlg.cc.

{
    static IDetectorElement* topDet = getDet<IDetectorElement>(m_topGeoPath);
    static IDetectorElement* lastDet = 0;

    // Perfer lastDet to topDet
    IDetectorElement* start = lastDet ? lastDet : topDet;
    std::string child_de_path = start->geometry()->belongsToPath(v.position(),-1);
    // If failed with lastDet, try again with topDet
    if ("" == child_de_path && lastDet) {
        child_de_path = topDet->geometry()->belongsToPath(v.position(),-1);
    }
    IDetectorElement* child = getDet<IDetectorElement>(child_de_path);


    // If still failed then game over
    if (!child) return false;

    // Optimizing cache, next vertex likely in this same DE
    lastDet = child;

    name = child->name();
    material = child->geometry()->lvolume()->materialName();
    return true;
}

---

Member Data Documentation

std::string DrawHistoryAlg::m_location [private]

Definition at line 24 of file DrawHistoryAlg.h.

std::string DrawHistoryAlg::m_track_filename [private]

Definition at line 25 of file DrawHistoryAlg.h.

std::string DrawHistoryAlg::m_trackandvertex_filename [private]

Definition at line 26 of file DrawHistoryAlg.h.

int DrawHistoryAlg::m_do_hits [private]

Definition at line 27 of file DrawHistoryAlg.h.

std::string DrawHistoryAlg::m_topGeoPath [private]

Definition at line 28 of file DrawHistoryAlg.h.

IParticlePropertySvc* DrawHistoryAlg::m_ppSvc [private]

Definition at line 30 of file DrawHistoryAlg.h.

---

The documentation for this class was generated from the following files:

• /home/dayabay/installs/trunk_2011_04_11_opt/NuWa-trunk/dybgaudi/Simulation/Historian/src/DrawHistoryAlg.h
• /home/dayabay/installs/trunk_2011_04_11_opt/NuWa-trunk/dybgaudi/Simulation/Historian/src/DrawHistoryAlg.cc

---