#include <FPGATrackSimMatrixGenAlgo.h>

Inheritance diagram for FPGATrackSimMatrixGenAlgo:

Collaboration diagram for FPGATrackSimMatrixGenAlgo:

Public Member Functions
	FPGATrackSimMatrixGenAlgo (const std::string &name, ISvcLocator *pSvcLocator)

virtual	~FPGATrackSimMatrixGenAlgo ()=default

StatusCode	initialize () override

StatusCode	execute () override

StatusCode	finalize () override

virtual StatusCode	sysInitialize () override
	Override sysInitialize. More...

virtual const DataObjIDColl &	extraOutputDeps () const override
	Return the list of extra output dependencies. More...

ServiceHandle< StoreGateSvc > &	evtStore ()
	The standard `StoreGateSvc` (event store) Returns (kind of) a pointer to the `StoreGateSvc`. More...

const ServiceHandle< StoreGateSvc > &	evtStore () const
	The standard `StoreGateSvc` (event store) Returns (kind of) a pointer to the `StoreGateSvc`. More...

const ServiceHandle< StoreGateSvc > &	detStore () const
	The standard `StoreGateSvc/DetectorStore` Returns (kind of) a pointer to the `StoreGateSvc`. More...

virtual StatusCode	sysStart () override
	Handle START transition. More...

virtual std::vector< Gaudi::DataHandle * >	inputHandles () const override
	Return this algorithm's input handles. More...

virtual std::vector< Gaudi::DataHandle * >	outputHandles () const override
	Return this algorithm's output handles. More...

Gaudi::Details::PropertyBase &	declareProperty (Gaudi::Property< T, V, H > &t)

Gaudi::Details::PropertyBase *	declareProperty (const std::string &name, SG::VarHandleKey &hndl, const std::string &doc, const SG::VarHandleKeyType &)
	Declare a new Gaudi property. More...

Gaudi::Details::PropertyBase *	declareProperty (const std::string &name, SG::VarHandleBase &hndl, const std::string &doc, const SG::VarHandleType &)
	Declare a new Gaudi property. More...

Gaudi::Details::PropertyBase *	declareProperty (const std::string &name, SG::VarHandleKeyArray &hndArr, const std::string &doc, const SG::VarHandleKeyArrayType &)

Gaudi::Details::PropertyBase *	declareProperty (const std::string &name, T &property, const std::string &doc, const SG::NotHandleType &)
	Declare a new Gaudi property. More...

Gaudi::Details::PropertyBase *	declareProperty (const std::string &name, T &property, const std::string &doc="none")
	Declare a new Gaudi property. More...

void	updateVHKA (Gaudi::Details::PropertyBase &)

MsgStream &	msg () const

MsgStream &	msg (const MSG::Level lvl) const

bool	msgLvl (const MSG::Level lvl) const

Protected Member Functions
void	renounceArray (SG::VarHandleKeyArray &handlesArray)
	remove all handles from I/O resolution More...

std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void >	renounce (T &h)

void	extraDeps_update_handler (Gaudi::Details::PropertyBase &ExtraDeps)
	Add StoreName to extra input/output deps as needed. More...

Private Types
enum	selectHit_returnCode { selectHit_returnCode::SH_FAILURE, selectHit_returnCode::SH_KEEP_OLD, selectHit_returnCode::SH_KEEP_NEW }

typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

Private Member Functions
StatusCode	bookHistograms ()

std::vector< FPGATrackSimHit >	getLogicalHits ()

std::vector< FPGATrackSimTruthTrack >	filterTrainingTracks (std::vector< FPGATrackSimTruthTrack > const &truth_tracks) const

std::map< int, std::vector< FPGATrackSimHit > >	makeBarcodeMap (std::vector< FPGATrackSimHit > const &hits, std::vector< FPGATrackSimTruthTrack > const &tracks) const

selectHit_returnCode	selectHit (FPGATrackSimHit const &old_hit, FPGATrackSimHit const &new_hit, bool is1ststage, int subregion) const

bool	filterSectorHits (std::vector< FPGATrackSimHit > const &all_hits, std::vector< FPGATrackSimHit > &sector_hits, FPGATrackSimTruthTrack const &t, bool is1ststage, int subregion) const

int	getRegion (std::vector< FPGATrackSimHit > const &hits, bool is1ststage) const

StatusCode	makeAccumulator (std::vector< FPGATrackSimHit > const &sector_hits, FPGATrackSimTruthTrack const &track, std::pair< std::vector< module_t >, FPGATrackSimMatrixAccumulator > &accumulator) const

StatusCode	fillAccumulatorByDropping (std::vector< FPGATrackSimHit > &sector_hits, bool is1ststage, double x, double y, std::vector< module_t > &modules, AccumulateMap &map, FPGATrackSimTruthTrack const &track, int subregion) const

std::vector< TTree * >	createMatrixTrees ()

void	fillMatrixTrees (std::vector< TTree * > const &matrixTrees)

void	writeSliceTree ()

Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey> More...

Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyArrayType &)
	specialization for handling Gaudi::Property<SG::VarHandleKeyArray> More...

Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleType &)
	specialization for handling Gaudi::Property<SG::VarHandleBase> More...

Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &t, const SG::NotHandleType &)
	specialization for handling everything that's not a Gaudi::Property<SG::VarHandleKey> or a <SG::VarHandleKeyArray> More...

Private Attributes
std::vector< AccumulateMap >	m_sector_cum

ServiceHandle< IFPGATrackSimMappingSvc >	m_FPGATrackSimMapping {this,"FPGATrackSimMappingSvc","FPGATrackSimMappingSvc"}

ServiceHandle< IFPGATrackSimEventSelectionSvc >	m_EvtSel {this,"FPGATrackSimEventSelectionSvc",""}

ServiceHandle< ITHistSvc >	m_tHistSvc {this,"THistSvc","THistSvc"}

ToolHandle< IFPGATrackSimInputTool >	m_hitInputTool {this, "FPGATrackSimSGToRawHitsTool", "FPGATrackSimSGToRawHitsTool/FPGATrackSimSGToRawHits", "input handler"}

ToolHandle< FPGATrackSimRawToLogicalHitsTool >	m_hitMapTool {this, "FPGATrackSimRawToLogicalHitsTool", "FPGATrackSimRawToLogicalHitsTool/FPGATrackSim_RawToLogicalHitsTool", "FPGATrackSim_RawToLogicalHitsTool"}

ToolHandle< FPGATrackSimClusteringToolI >	m_clusteringTool { this, "FPGATrackSimClusteringFTKTool", "FPGATrackSimClusteringFTKTool/FPGATrackSimClusteringFTKTool", "FPGATrackSimClusteringFTKTool" }

ToolHandle< FPGATrackSimSpacePointsToolI >	m_spacePointsTool { this, "SpacePointTool", "FPGATrackSimSpacePointsTool/FPGATrackSimSpacePointsTool", "FPGATrackSimSpacePointsTool" }

const FPGATrackSimPlaneMap *	m_pmap = nullptr

ToolHandle< FPGATrackSimRoadUnionTool >	m_roadFinderTool {this, "RoadFinder", "RoadFinder"}

ToolHandle< FPGATrackSimTrackFitterTool >	m_trackFitterTool_1st {this, "TrackFitter_1st", "FPGATrackSimTrackFitterTool/FPGATrackSimTrackFitterTool_1st", "1st stage track fit tool"}

ToolHandle< IFPGATrackSimTrackExtensionTool >	m_trackExtensionTool {this, "TrackExtensionTool", "FPGATrackSimTrackExtensionTool", "Track extensoin tool"}

ToolHandle< FPGATrackSimOverlapRemovalTool >	m_overlapRemovalTool {this, "OverlapRemoval_1st", "FPGATrackSimOverlapRemovalTool/FPGATrackSimOverlapRemovalTool_1st", "1st stage overlap removal tool"}

const FPGATrackSimPlaneMap *	m_pmap_1st = nullptr

const FPGATrackSimPlaneMap *	m_pmap_2nd = nullptr

Gaudi::Property< int >	m_nRegions {this, "NBanks", 0, "Number of banks to make"}

Gaudi::Property< bool >	m_doClustering {this, "Clustering", true, "Do cluster?"}

Gaudi::Property< bool >	m_doSecondStage {this, "SecondStage", false, "Run second stage?"}

Gaudi::Property< bool >	m_doSpacePoints {this, "SpacePoints", true, "Do spacepoints?"}

Gaudi::Property< int >	m_ideal_geom {this, "IdealiseGeometry", 0, "Ideal geo flag, 0 is non, 1 is 1st order, 2 is 2nd order"}

Gaudi::Property< bool >	m_single {this, "SingleSector", false, "Run single sector"}

Gaudi::Property< bool >	m_doHoughConstants {this, "HoughConstants", true, "If true will run Hough Transform to set q/pt and phi0"}

Gaudi::Property< bool >	m_doDeltaPhiConsts {this, "DeltaPhiConstants", false, "If true will generate delta phi constants"}

Gaudi::Property< int >	m_MaxWC {this, "WCmax", 0, "Max number of WCs"}

Gaudi::Property< int >	m_minSpacePlusPixel {this, "minSpacePlusPixel", 4, "Require that tracks in training have a certain number of pixel hits + spacepoints" }

Gaudi::Property< float >	m_PT_THRESHOLD {this, "PT_THRESHOLD", 0., "Min pt"}

Gaudi::Property< float >	m_D0_THRESHOLD {this, "D0_THRESHOLD", 1., "Max d0"}

Gaudi::Property< int >	m_TRAIN_PDG {this, "TRAIN_PDG", 0, "PDG of particles to train on"}

Gaudi::Property< float >	m_temp_c_min {this, "par_c_min", -1, "Min curvature"}

Gaudi::Property< float >	m_temp_c_max {this, "par_c_max", 1, "Max curvature"}

Gaudi::Property< float >	m_temp_phi_min {this, "par_phi_min", -TMath::Pi(), "Min phi"}

Gaudi::Property< float >	m_temp_phi_max {this, "par_phi_max", TMath::Pi(), "Max phi"}

Gaudi::Property< float >	m_temp_d0_min {this, "par_d0_min", -2, "Min d0"}

Gaudi::Property< float >	m_temp_d0_max {this, "par_d0_max", 2, "Max d0"}

Gaudi::Property< float >	m_temp_z0_min {this, "par_z0_min", -200, "Min z0"}

Gaudi::Property< float >	m_temp_z0_max {this, "par_z0_max", 200, "Max z0"}

Gaudi::Property< float >	m_temp_eta_min {this, "par_eta_min", -5, "Min eta"}

Gaudi::Property< float >	m_temp_eta_max {this, "par_eta_max", 5, "Max eta"}

Gaudi::Property< int >	m_temp_c_slices {this, "par_c_slices", 100, "Number of c slides"}

Gaudi::Property< int >	m_temp_phi_slices {this, "par_phi_slices", 100, "Number of phi slices"}

Gaudi::Property< int >	m_temp_d0_slices {this, "par_d0_slices", 100, "Number of d0 slices"}

Gaudi::Property< int >	m_temp_z0_slices {this, "par_z0_slices", 100, "Number of z0 slices"}

Gaudi::Property< int >	m_temp_eta_slices {this, "par_eta_slices", 100, "Number of eta slices"}

Gaudi::Property< bool >	m_absQOverPtBinning {this, "qptAbsBinning", false, "This property controls whether or not to interpret the bins as q/pt or \|q/pt\|"}

Gaudi::Property< std::vector< double > >	m_qOverPtBins {this, "sectorQPtBins", {}, "q/pt bins for sector definition"}

Gaudi::Property< bool >	m_dropHitsAndFill {this, "dropHitsAndFill", false, "If true, we can drop hits to fill the accumulator"}

int	m_nLayers_1st = 0

int	m_nDim_1st = 0

int	m_nLayers_2nd = 0

int	m_nDim_2nd = 0

FPGATrackSimTrackPars	m_sliceMin = 0

FPGATrackSimTrackPars	m_sliceMax = 0

FPGATrackSimTrackParsI	m_nBins

FPGATrackSimEventInputHeader *	m_eventHeader = nullptr

size_t	m_nTracks = 0

size_t	m_nTracksUsed = 0

TH1I *	m_h_trainingTrack [FPGATrackSimTrackPars::NPARS] {}

TH1I *	m_h_sectorPars [FPGATrackSimTrackPars::NPARS] {}

TH1I *	m_h_SHfailure [FPGATrackSimTrackPars::NPARS] {}

TH1I *	m_h_3hitsInLayer [FPGATrackSimTrackPars::NPARS] {}

TH1I *	m_h_notEnoughHits [FPGATrackSimTrackPars::NPARS] {}

TH1I *	m_h_trackQoP_okHits = nullptr

TH1I *	m_h_trackQoP_okRegion = nullptr

TH1I *	m_h_nHit = nullptr

DataObjIDColl	m_extendedExtraObjects

StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default) More...

StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default) More...

std::vector< SG::VarHandleKeyArray * >	m_vhka

bool	m_varHandleArraysDeclared

Detailed Description

Definition at line 54 of file FPGATrackSimMatrixGenAlgo.h.

Member Typedef Documentation

◆ StoreGateSvc_t

typedef ServiceHandle<StoreGateSvc> AthCommonDataStore< AthCommonMsg< Algorithm > >::StoreGateSvc_t

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Member Enumeration Documentation

◆ selectHit_returnCode

enum FPGATrackSimMatrixGenAlgo::selectHit_returnCode

strongprivate

Enumerator
SH_FAILURE
SH_KEEP_OLD
SH_KEEP_NEW

Definition at line 151 of file FPGATrackSimMatrixGenAlgo.h.

151 { SH_FAILURE, SH_KEEP_OLD, SH_KEEP_NEW };

Constructor & Destructor Documentation

◆ FPGATrackSimMatrixGenAlgo()

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

Definition at line 37 of file FPGATrackSimMatrixGenAlgo.cxx.

                                                                                                     :
   AthAlgorithm(name, pSvcLocator)
 {
 }

◆ ~FPGATrackSimMatrixGenAlgo()

virtual FPGATrackSimMatrixGenAlgo::~FPGATrackSimMatrixGenAlgo ( )

virtualdefault

Member Function Documentation

◆ bookHistograms()

StatusCode FPGATrackSimMatrixGenAlgo::bookHistograms ( )

private

Definition at line 129 of file FPGATrackSimMatrixGenAlgo.cxx.

 {
   // Training tracks
   for (unsigned i = 0; i < FPGATrackSimTrackPars::NPARS; i++) {
     std::string name = "h_trainingTrack_" + FPGATrackSimTrackPars::parName(i);
     std::string title = FPGATrackSimTrackPars::parName(i) + " of tracks passing pt/barcode check";
     
     m_h_trainingTrack[i] = new TH1I(name.c_str(), title.c_str(), 100, m_sliceMin[i], m_sliceMax[i]);
     ATH_CHECK(m_tHistSvc->regHist("/TRIGFPGATrackSimMATRIXOUT/" + name, m_h_trainingTrack[i]));
   }
  
   // Sector pars
   for (unsigned i = 0; i < FPGATrackSimTrackPars::NPARS; i++) {
     
     std::string name = "h_sectorPars_" + FPGATrackSimTrackPars::parName(i);
     std::string title = "Average " + FPGATrackSimTrackPars::parName(i) + " in sector";
     
     m_h_sectorPars[i] = new TH1I(name.c_str(), title.c_str(), 100, m_sliceMin[i], m_sliceMax[i]);
     ATH_CHECK(m_tHistSvc->regHist("/TRIGFPGATrackSimMATRIXOUT/" + name, m_h_sectorPars[i]));
   }
  
   // Select hit failure
   for (unsigned i = 0; i < FPGATrackSimTrackPars::NPARS; i++) {
     
     std::string name = "h_SHfailure_" + FPGATrackSimTrackPars::parName(i);
     std::string title = FPGATrackSimTrackPars::parName(i) + " of tracks failing in selectHit()";
     
     m_h_SHfailure[i] = new TH1I(name.c_str(), title.c_str(), 100, m_sliceMin[i], m_sliceMax[i]);
     ATH_CHECK(m_tHistSvc->regHist("/TRIGFPGATrackSimMATRIXOUT/" + name, m_h_SHfailure[i]));
   }
  
   // 3 hits in layer
   for (unsigned i = 0; i < FPGATrackSimTrackPars::NPARS; i++) {
  
     std::string name = "h_3hitsInLayer_" + FPGATrackSimTrackPars::parName(i);
     std::string title = FPGATrackSimTrackPars::parName(i) + " of tracks containing 3+ hits in a single layer";
     
     m_h_3hitsInLayer[i] = new TH1I(name.c_str(), title.c_str(), 100, m_sliceMin[i], m_sliceMax[i]);
     ATH_CHECK(m_tHistSvc->regHist("/TRIGFPGATrackSimMATRIXOUT/" + name, m_h_3hitsInLayer[i]));
   }
  
   // Not enough hits
   for (unsigned i = 0; i < FPGATrackSimTrackPars::NPARS; i++) {
     std::string name = "h_notEnoughHits_" + FPGATrackSimTrackPars::parName(i);
     std::string title = FPGATrackSimTrackPars::parName(i) + " of tracks failing because it didn't have enough hits";
     
     m_h_notEnoughHits[i] = new TH1I(name.c_str(), title.c_str(), 100, m_sliceMin[i], m_sliceMax[i]);
     ATH_CHECK(m_tHistSvc->regHist("/TRIGFPGATrackSimMATRIXOUT/" + name, m_h_notEnoughHits[i]));
   }
   
   m_h_trackQoP_okHits = new TH1I("h_trackQoP_okHits", "half inverse pt of tracks passing hit check",
                    m_nBins.qOverPt, m_sliceMin.qOverPt, m_sliceMax.qOverPt);
   m_h_trackQoP_okRegion = new TH1I("h_trackQoP_okRegion", "half inverse pt of tracks passing region check",
                  m_nBins.qOverPt, m_sliceMin.qOverPt, m_sliceMax.qOverPt);
   m_h_nHit = new TH1I("h_nHit", "number of hits in sector", 100, 0, 100);
  
   ATH_CHECK(m_tHistSvc->regHist("/TRIGFPGATrackSimMATRIXOUT/h_trackQoP_okHits", m_h_trackQoP_okHits));
   ATH_CHECK(m_tHistSvc->regHist("/TRIGFPGATrackSimMATRIXOUT/h_trackQoP_okRegion", m_h_trackQoP_okRegion));
   ATH_CHECK(m_tHistSvc->regHist("/TRIGFPGATrackSimMATRIXOUT/h_nHit",m_h_nHit));
  
   return StatusCode::SUCCESS;
 }

◆ createMatrixTrees()

std::vector<TTree*> FPGATrackSimMatrixGenAlgo::createMatrixTrees ( )

private

◆ declareGaudiProperty() [1/4]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< Algorithm > >::declareGaudiProperty	(	Gaudi::Property< T, V, H > &	hndl,
		const SG::VarHandleKeyArrayType &
	)

inlineprivateinherited

specialization for handling Gaudi::Property<SG::VarHandleKeyArray>

Definition at line 170 of file AthCommonDataStore.h.

   {
     return *AthCommonDataStore<PBASE>::declareProperty(hndl.name(),
                                                        hndl.value(), 
                                                        hndl.documentation());
  
   }

◆ declareGaudiProperty() [2/4]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< Algorithm > >::declareGaudiProperty	(	Gaudi::Property< T, V, H > &	hndl,
		const SG::VarHandleKeyType &
	)

inlineprivateinherited

specialization for handling Gaudi::Property<SG::VarHandleKey>

Definition at line 156 of file AthCommonDataStore.h.

   {
     return *AthCommonDataStore<PBASE>::declareProperty(hndl.name(),
                                                        hndl.value(), 
                                                        hndl.documentation());
  
   }

◆ declareGaudiProperty() [3/4]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< Algorithm > >::declareGaudiProperty	(	Gaudi::Property< T, V, H > &	hndl,
		const SG::VarHandleType &
	)

inlineprivateinherited

specialization for handling Gaudi::Property<SG::VarHandleBase>

Definition at line 184 of file AthCommonDataStore.h.

   {
     return *AthCommonDataStore<PBASE>::declareProperty(hndl.name(),
                                                        hndl.value(), 
                                                        hndl.documentation());
   }

◆ declareGaudiProperty() [4/4]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< Algorithm > >::declareGaudiProperty	(	Gaudi::Property< T, V, H > &	t,
		const SG::NotHandleType &
	)

inlineprivateinherited

specialization for handling everything that's not a Gaudi::Property<SG::VarHandleKey> or a <SG::VarHandleKeyArray>

Definition at line 199 of file AthCommonDataStore.h.

   {
     return PBASE::declareProperty(t);
   }

◆ declareProperty() [1/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< Algorithm > >::declareProperty	(	const std::string &	name,
		SG::VarHandleBase &	hndl,
		const std::string &	doc,
		const SG::VarHandleType &
	)

inlineinherited

Declare a new Gaudi property.

Parameters

name	Name of the property.
hndl	Object holding the property value.
doc	Documentation string for the property.

This is the version for types that derive from SG::VarHandleBase. The property value object is put on the input and output lists as appropriate; then we forward to the base class.

Definition at line 245 of file AthCommonDataStore.h.

   {
     this->declare(hndl.vhKey());
     hndl.vhKey().setOwner(this);
  
     return PBASE::declareProperty(name,hndl,doc);
   }

◆ declareProperty() [2/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< Algorithm > >::declareProperty	(	const std::string &	name,
		SG::VarHandleKey &	hndl,
		const std::string &	doc,
		const SG::VarHandleKeyType &
	)

inlineinherited

Declare a new Gaudi property.

Parameters

name	Name of the property.
hndl	Object holding the property value.
doc	Documentation string for the property.

This is the version for types that derive from SG::VarHandleKey. The property value object is put on the input and output lists as appropriate; then we forward to the base class.

Definition at line 221 of file AthCommonDataStore.h.

   {
     this->declare(hndl);
     hndl.setOwner(this);
  
     return PBASE::declareProperty(name,hndl,doc);
   }

◆ declareProperty() [3/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< Algorithm > >::declareProperty	(	const std::string &	name,
		SG::VarHandleKeyArray &	hndArr,
		const std::string &	doc,
		const SG::VarHandleKeyArrayType &
	)

inlineinherited

Definition at line 259 of file AthCommonDataStore.h.

   {
  
     // std::ostringstream ost;
     // ost << Algorithm::name() << " VHKA declareProp: " << name 
     //     << " size: " << hndArr.keys().size() 
     //     << " mode: " << hndArr.mode() 
     //     << "  vhka size: " << m_vhka.size()
     //     << "\n";
     // debug() << ost.str() << endmsg;
  
     hndArr.setOwner(this);
     m_vhka.push_back(&hndArr);
  
     Gaudi::Details::PropertyBase* p =  PBASE::declareProperty(name, hndArr, doc);
     if (p != 0) {
       p->declareUpdateHandler(&AthCommonDataStore<PBASE>::updateVHKA, this);
     } else {
       ATH_MSG_ERROR("unable to call declareProperty on VarHandleKeyArray " 
                     << name);
     }
  
     return p;
  
   }

◆ declareProperty() [4/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< Algorithm > >::declareProperty	(	const std::string &	name,
		T &	property,
		const std::string &	doc,
		const SG::NotHandleType &
	)

inlineinherited

Declare a new Gaudi property.

Parameters

name	Name of the property.
property	Object holding the property value.
doc	Documentation string for the property.

This is the generic version, for types that do not derive from SG::VarHandleKey. It just forwards to the base class version of declareProperty.

Definition at line 333 of file AthCommonDataStore.h.

   {
     return PBASE::declareProperty(name, property, doc);
   }

◆ declareProperty() [5/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< Algorithm > >::declareProperty	(	const std::string &	name,
		T &	property,
		const std::string &	doc = `"none"`
	)

inlineinherited

Declare a new Gaudi property.

Parameters

name	Name of the property.
property	Object holding the property value.
doc	Documentation string for the property.

This dispatches to either the generic declareProperty or the one for VarHandle/Key/KeyArray.

Definition at line 352 of file AthCommonDataStore.h.

   {
     typedef typename SG::HandleClassifier<T>::type htype;
     return declareProperty (name, property, doc, htype());
   }

◆ declareProperty() [6/6]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< Algorithm > >::declareProperty ( Gaudi::Property< T, V, H > & t )

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

                                                                      {
     typedef typename SG::HandleClassifier<T>::type htype;
     return AthCommonDataStore<PBASE>::declareGaudiProperty(t, htype());
   }

◆ detStore()

const ServiceHandle<StoreGateSvc>& AthCommonDataStore< AthCommonMsg< Algorithm > >::detStore ( ) const

inlineinherited

The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 95 of file AthCommonDataStore.h.

95 { return m_detStore; }

◆ evtStore() [1/2]

ServiceHandle<StoreGateSvc>& AthCommonDataStore< AthCommonMsg< Algorithm > >::evtStore ( )

inlineinherited

The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 85 of file AthCommonDataStore.h.

85 { return m_evtStore; }

◆ evtStore() [2/2]

const ServiceHandle<StoreGateSvc>& AthCommonDataStore< AthCommonMsg< Algorithm > >::evtStore ( ) const

inlineinherited

The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 90 of file AthCommonDataStore.h.

90 { return m_evtStore; }

◆ execute()

StatusCode FPGATrackSimMatrixGenAlgo::execute ( )

override

Definition at line 204 of file FPGATrackSimMatrixGenAlgo.cxx.

 {
   ATH_MSG_DEBUG("execute()");
   m_eventHeader->clearHits();
   m_eventHeader->reset();
   // Get hits and training tracks from this event
   ATH_CHECK(m_hitInputTool->readData(m_eventHeader, Gaudi::Hive::currentContext()));
  
   std::vector<FPGATrackSimHit> hits = getLogicalHits();
  
   std::vector<FPGATrackSimTruthTrack> truth_tracks = m_eventHeader->optional().getTruthTracks();
   std::vector<FPGATrackSimTruthTrack> tracks = filterTrainingTracks(truth_tracks);
   m_nTracks += truth_tracks.size();
   if (tracks.empty()) {  
     ATH_MSG_DEBUG("Empty training tracks");
     return StatusCode::SUCCESS;
   }
   // Prepare a map of the hits according the barcode
   std::map<int, std::vector<FPGATrackSimHit>> barcode_hits = makeBarcodeMap(hits, tracks);
   // For each training track, find the sector it belongs to and accumulate the
   // hit coordinates and track parameters.
   for (FPGATrackSimTruthTrack const & track : tracks) {
     
     int nSlices = m_FPGATrackSimMapping->SubRegionMap()->getNRegions();
  
     // Get list of hits associated to the current truth track
     std::vector<FPGATrackSimHit> & sector_hits = barcode_hits[track.getBarcode()];
  
     const FPGATrackSimPlaneMap *t_pmap = nullptr;
  
     // Get the hits that will form the actual sector
  
     for (int iSlice = 0; iSlice<nSlices; iSlice++){
       t_pmap = m_FPGATrackSimMapping->PlaneMap_2nd(iSlice);
       
       for (auto & iHit : sector_hits) {
         t_pmap->map(iHit);
       }
       
       /* For now, don't do this. If we need regionalized/binned fit constants it needs to come from the road.
       std::vector<FPGATrackSimHit> sector_hits;
       bool success = filterSectorHits(track_hits, sector_hits, track, true, iSlice);
       if (!success) continue; // Skip this track if it has bad hits (not complete, etc.)
       */
  
       m_h_trackQoP_okHits->Fill(track.getQOverPt());
       
       // Get the region of this sector
       // TODO: do we need this the pattern recognition should deal with it.
       int region = 0; //sgetRegion(sector_hits, false);
       //if (region < 0 || region >= m_nRegions) continue;
       m_h_trackQoP_okRegion->Fill(track.getQOverPt());
  
       //For the Hough constants, find the Hough roads
       std::vector<std::shared_ptr<const FPGATrackSimRoad>> houghRoads;
       if (m_doHoughConstants){
  
         std::vector<std::shared_ptr<const FPGATrackSimHit>> phits;
  
         ATH_MSG_DEBUG("Starting from some number of sector hits = " << sector_hits.size());
         for (const FPGATrackSimHit& hit : sector_hits) if (hit.isMapped() && hit.isReal()) phits.emplace_back(std::make_shared<const FPGATrackSimHit>(hit));
         ATH_MSG_DEBUG("Passing nhits = " << phits.size() << " to road finder");
         StatusCode sc = m_roadFinderTool->getRoads(phits, houghRoads, truth_tracks);
         if (sc.isFailure()) ATH_MSG_WARNING("Hough Transform -> getRoads() failed");
  
         ATH_MSG_DEBUG("We found " << houghRoads.size() << " roads");
  
         // We now want to just form the accumulator for any valid combination of hits
         // In first stage mode we'll make the track fitter just generate combinations
         std::vector<FPGATrackSimTrack> tracks_1st;
         if (m_doSecondStage) {
       ATH_CHECK(m_trackFitterTool_1st->getTracks(houghRoads, tracks_1st, m_EvtSel->getMin(), m_EvtSel->getMax()));
           ATH_CHECK(m_overlapRemovalTool->runOverlapRemoval(tracks_1st));
         } else {
           roadsToTrack(houghRoads, tracks_1st, m_pmap_1st);
           ATH_MSG_DEBUG("We found " << tracks_1st.size() << " combinations");
         }
         for (const auto& track_comb : tracks_1st) {
           std::vector<FPGATrackSimHit> track_hits = track_comb.getFPGATrackSimHits();
  
           if (m_doSecondStage) { // if doing 2nd stage, we want to get tracks from the road and then do tracking and overlap removal
  
             // Prepare the accumulator struct
             std::vector<module_t> modules(m_nLayers_2nd);
             FPGATrackSimMatrixAccumulator acc(m_nLayers_2nd, m_nDim_2nd);
             std::vector<std::shared_ptr<const FPGATrackSimHit>> phits_2nd;
  
             // Pass all hits-- it's not possible to only select second stage hits here...
             for (const auto& hit : sector_hits) {
               phits_2nd.push_back(std::make_shared<const FPGATrackSimHit>(hit));
             }
  
             // Use the track extension tool to actually produce a new set of roads.
             std::vector<std::shared_ptr<const FPGATrackSimRoad>> roads_2nd;
             std::vector<std::shared_ptr<const FPGATrackSimTrack>> ptracks_1st;
             ptracks_1st.reserve(tracks_1st.size());
             for (const auto& track : tracks_1st) {
               ptracks_1st.push_back(std::make_shared<const FPGATrackSimTrack>(track));
             }
             ATH_CHECK(m_trackExtensionTool->extendTracks(phits_2nd, ptracks_1st, roads_2nd));
  
             // Now produce "track" candidates and loop over them.
             std::vector<FPGATrackSimTrack> tracks_2nd;
             roadsToTrack(roads_2nd, tracks_2nd, m_pmap_2nd);
             for (const FPGATrackSimTrack& track_2nd : tracks_2nd) {
               std::vector<FPGATrackSimHit> track_hits_2nd = track_2nd.getFPGATrackSimHits();
               std::vector<module_t> modules(m_nLayers_2nd);
               FPGATrackSimMatrixAccumulator acc(m_nLayers_2nd, m_nDim_2nd);
               acc.pars.qOverPt = track_2nd.getHoughY();
               acc.pars.phi = track_2nd.getHoughX();
  
               std::pair<std::vector<module_t>, FPGATrackSimMatrixAccumulator> modules_acc = {modules, acc};
               std::vector<std::shared_ptr<const FPGATrackSimHit>> phits;
               ATH_CHECK(makeAccumulator(track_hits_2nd, track, modules_acc));
  
               // Add the track to the accumulate map
               accumulate(m_sector_cum[region], modules_acc.first, modules_acc.second);
  
               if (m_dropHitsAndFill)
                 ATH_CHECK(fillAccumulatorByDropping(track_hits_2nd, false, acc.pars.phi, acc.pars.qOverPt, modules, m_sector_cum[region], track, iSlice));
  
               m_nTracksUsed++;
             }
           }
           else {
             // For each track combination (from a Hough road)
             double y = track_comb.getHoughY();
             double x = track_comb.getHoughX();
             // Prepare the accumulator struct
             std::vector<module_t> modules(m_nLayers_1st);
             FPGATrackSimMatrixAccumulator acc(m_nLayers_1st, m_nDim_1st);
             acc.pars.qOverPt = y;
             acc.pars.phi = x;
             std::pair<std::vector<module_t>, FPGATrackSimMatrixAccumulator> modules_acc = {modules, acc};
             ATH_CHECK(makeAccumulator(track_hits, track, modules_acc));
  
             // Add the track to the accumulate map
             accumulate(m_sector_cum[region], modules_acc.first, modules_acc.second);
  
             if (m_dropHitsAndFill)
               ATH_CHECK(fillAccumulatorByDropping(track_hits, true, acc.pars.phi, acc.pars.qOverPt, modules, m_sector_cum[region], track, iSlice));
  
             m_nTracksUsed++;
           }
         }
       }
       else{
         // Prepare the accumulator struct
         std::vector<module_t> modules(m_nLayers_1st);
         FPGATrackSimMatrixAccumulator acc(m_nLayers_1st, m_nDim_1st);
         std::pair<std::vector<module_t>, FPGATrackSimMatrixAccumulator> modules_acc = {modules, acc};
         ATH_CHECK(makeAccumulator(sector_hits, track, modules_acc));
  
         // Add the track to the accumulate map
         accumulate(m_sector_cum[region], modules_acc.first, modules_acc.second);
  
         if (m_dropHitsAndFill)
           ATH_CHECK(fillAccumulatorByDropping(sector_hits, true, acc.pars.phi, acc.pars.qOverPt, modules, m_sector_cum[region], track, iSlice));
  
         m_nTracksUsed++;
       }
     }
   }
  
   return StatusCode::SUCCESS;
 }

◆ extraDeps_update_handler()

void AthCommonDataStore< AthCommonMsg< Algorithm > >::extraDeps_update_handler ( Gaudi::Details::PropertyBase & ExtraDeps )

protectedinherited

Add StoreName to extra input/output deps as needed.

use the logic of the VarHandleKey to parse the DataObjID keys supplied via the ExtraInputs and ExtraOuputs Properties to add the StoreName if it's not explicitly given

◆ extraOutputDeps()

const DataObjIDColl & AthAlgorithm::extraOutputDeps ( ) const

overridevirtualinherited

Return the list of extra output dependencies.

This list is extended to include symlinks implied by inheritance relations.

Definition at line 50 of file AthAlgorithm.cxx.

 {
   // If we didn't find any symlinks to add, just return the collection
   // from the base class.  Otherwise, return the extended collection.
   if (!m_extendedExtraObjects.empty()) {
     return m_extendedExtraObjects;
   }
   return Algorithm::extraOutputDeps();
 }

◆ fillAccumulatorByDropping()

StatusCode FPGATrackSimMatrixGenAlgo::fillAccumulatorByDropping	(	std::vector< FPGATrackSimHit > &	sector_hits,
		bool	is1ststage,
		double	x,
		double	y,
		std::vector< module_t > &	modules,
		AccumulateMap &	map,
		FPGATrackSimTruthTrack const &	track,
		int	subregion
	)		const

private

Definition at line 694 of file FPGATrackSimMatrixGenAlgo.cxx.

 {
  
   int nLayers = (is1ststage ? m_nLayers_1st : m_nLayers_2nd);
   int nDim = (is1ststage ? m_nDim_1st : m_nDim_2nd);
  
   int nwc = 0;
   for (auto module : modules) {
     if (module == -1) nwc++;
   }
   // Don't do this unless we miss at most one hit!
   if (nwc < m_MaxWC) {
     for (int layer = 0; layer < nLayers; layer++) {
       // Back up the current hit in this layer.
       FPGATrackSimHit backup_hit = sector_hits[layer];
       
       // Create a new wildcard hit, and put it here.
       ATH_MSG_DEBUG("Attempting to make wildcard in layer " << layer << ", is1ststage = " << is1ststage);
       FPGATrackSimHit *wcHit = new FPGATrackSimHit();
       wcHit->setHitType(HitType::wildcard);
       wcHit->setLayer(layer);
       if (is1ststage) wcHit->setDetType(m_FPGATrackSimMapping->PlaneMap_1st(subregion)->getDetType(layer));
       else wcHit->setDetType(m_FPGATrackSimMapping->PlaneMap_2nd(subregion)->getDetType(layer));
  
       sector_hits[layer] = *wcHit;
       
       // If this is a spacepoint, we must also convert the other hit.
       FPGATrackSimHit other_backup = backup_hit;
       unsigned other_layer = 0;
       if (backup_hit.getHitType() == HitType::spacepoint) {
          other_layer = (backup_hit.getPhysLayer() % 2 == 0) ? layer + 1 : layer - 1;
          other_backup = sector_hits[other_layer];
          sector_hits[other_layer] = other_backup.getOriginalHit();
       }
       
       FPGATrackSimMatrixAccumulator new_acc(nLayers, nDim);
       new_acc.pars.qOverPt = y;
       new_acc.pars.phi = x;
       std::pair<std::vector<module_t>, FPGATrackSimMatrixAccumulator> new_modules_acc = {modules, new_acc};
       
       auto sc = makeAccumulator(sector_hits, track, new_modules_acc);
       if (sc != StatusCode::SUCCESS){
         delete wcHit;
         ATH_MSG_ERROR("FPGATrackSimMatrixGenAlgo::fillAccumulatorByDropping; makeAccumulator failed");
         return StatusCode::FAILURE;
       }
       accumulate(map, new_modules_acc.first, new_modules_acc.second);
       
       // Restore the hit. May not be necessary to clean up wcHit here.
       sector_hits[layer] = backup_hit;
       delete wcHit;
       
       // Restore the other layer, if this is a spacepoint.
       if (backup_hit.getHitType() == HitType::spacepoint) {
          sector_hits[other_layer] = other_backup;
       }
     }
   }
   return StatusCode::SUCCESS;
 }

◆ fillMatrixTrees()

void FPGATrackSimMatrixGenAlgo::fillMatrixTrees ( std::vector< TTree * > const & matrixTrees )

private

◆ filterSectorHits()

bool FPGATrackSimMatrixGenAlgo::filterSectorHits	(	std::vector< FPGATrackSimHit > const &	all_hits,
		std::vector< FPGATrackSimHit > &	sector_hits,
		FPGATrackSimTruthTrack const &	t,
		bool	is1ststage,
		int	subregion
	)		const

private

Definition at line 577 of file FPGATrackSimMatrixGenAlgo.cxx.

 {
   FPGATrackSimHit nohit;
   nohit.setHitType(HitType::wildcard);
   int nLayers = (is1ststage ? m_nLayers_1st : m_nLayers_2nd);
   const FPGATrackSimRegionMap *rmap = (is1ststage ? m_FPGATrackSimMapping->SubRegionMap() : m_FPGATrackSimMapping->SubRegionMap_2nd());
   sector_hits.resize(nLayers, nohit);
   std::vector<int> layer_count(nLayers); // count number of hits seen in each layer
  
   for (FPGATrackSimHit const & hit : all_hits) {
      if (!hit.isReal() || !hit.isMapped()) continue;
  
     // Sanity check. make sure the hit is actually in the first stage?
     // If the hit falls within the boundaries of ANY subregion in the first stage, it's 1st stage.
     if (rmap->getRegions(hit).size() == 0) {
       continue;
     }
     int layer = hit.getLayer();
     if (layer_count[layer] == 0){
       layer_count[layer]++;
       sector_hits[layer] = hit;
     }
     else if (layer_count[layer] == 1) {
       layer_count[layer]++;
       // Already found a hit in this layer, so pick which hit to use
       selectHit_returnCode selected_hit = selectHit(sector_hits[layer], hit, is1ststage, subregion);
       
       if (selected_hit == selectHit_returnCode::SH_FAILURE) {
          fillTrackPars(m_h_SHfailure, t);
          return false;
       }
       else if (selected_hit == selectHit_returnCode::SH_KEEP_NEW) sector_hits[layer] = hit;
     }
     else {
        ATH_MSG_DEBUG("Too many hits on a plane, exiting filterHitsSec");
        fillTrackPars(m_h_3hitsInLayer, t);
        return false;
     }
   }
   // Count number of wildcards, spacepoints, and pixel hits.
   int nwc = 0;
   int num_sp = 0;
   int num_pixel = 0;
  
   // Check we have the right number of hits.
   for (int i = 0; i < nLayers; ++i)
   {
     if (layer_count[i] == 0)
     {
        ATH_MSG_DEBUG("Layer " << i << " has no hits");
        nwc++;
     }
  
     // Now that we've decided which hit to use-- check their type.
     if (sector_hits[i].getHitType() == HitType::spacepoint) {
        num_sp += 1;
     }
     if (sector_hits[i].isPixel()) {
        num_pixel += 1;
     }
   }
   ATH_MSG_DEBUG("Found " << nwc << " wildcards compared to maximum: " << m_MaxWC);
   // Divide by 2 due to spacepoint duplication.
   num_sp /= 2;
   ATH_MSG_DEBUG("Found " << num_sp << " spacepoints after removing duplicates.");
   // Require we don't have too many wildcards.
   if (nwc > m_MaxWC)
   {
      fillTrackPars(m_h_notEnoughHits, t);
      return false;
   }
   // Require that we have a certain number of "2D" hits (i.e. pixels and spacepoints)
   // The effect of this is that we can ensure we have 4/5 2D hits but 7/9 hits total.
   // NOTE Again, uncomment logic below for second stage running.
   num_sp += num_pixel;
   int minSpacePlusPixel = /*m_isSecondStage ? m_minSpacePlusPixel2 :*/ m_minSpacePlusPixel;
   if (num_sp < minSpacePlusPixel) {
      ATH_MSG_DEBUG("Not enough pixel hits + spacepoints (" << num_sp << " < " << minSpacePlusPixel << ")");
      fillTrackPars(m_h_notEnoughHits, t);
      return false;
   }
   return true;
 }

◆ filterTrainingTracks()

std::vector< FPGATrackSimTruthTrack > FPGATrackSimMatrixGenAlgo::filterTrainingTracks ( std::vector< FPGATrackSimTruthTrack > const & truth_tracks ) const

private

Definition at line 413 of file FPGATrackSimMatrixGenAlgo.cxx.

 {
   std::vector<FPGATrackSimTruthTrack> training_tracks;
  
   for (FPGATrackSimTruthTrack const & track : truth_tracks) {
     if (HepMC::generations(&track) >= 1 || std::abs(track.getPDGCode()) != m_TRAIN_PDG) continue;
     if (std::abs(track.getD0()) > m_D0_THRESHOLD) continue;
  
     // Actually use the event selection service here to kill anything outside the region.
     if (!(m_EvtSel->passMatching(track))) continue;
  
     double pt = TMath::Sqrt(track.getPX()*track.getPX() + track.getPY()*track.getPY());
     double pt_GeV = pt / 1000;
     
     // Add the track to the list of good tracks
     if (pt_GeV > m_PT_THRESHOLD) training_tracks.push_back(track);
     
     // Debug
     if (msgLvl(MSG::DEBUG)) {
       double c = track.getQ() /(2 * pt);
       double eta = TMath::ASinH(track.getPZ() / pt);
       double phi = TMath::ATan2(track.getPY(), track.getPX());
       ATH_MSG_DEBUG("pt_GeV = "<< pt_GeV
             << " c = " << c
             << " eta = " << eta
             << " phi = " << phi
             << " pdgcode = " << track.getPDGCode());
     }
     fillTrackPars(m_h_trainingTrack, track);
   }
   
   return training_tracks;
 }

◆ finalize()

StatusCode FPGATrackSimMatrixGenAlgo::finalize ( )

override

Definition at line 925 of file FPGATrackSimMatrixGenAlgo.cxx.

 {
   ATH_MSG_DEBUG("finalize()");
   ATH_MSG_INFO("Tracks used: " << m_nTracksUsed << "/" << m_nTracks);
   int nLayers = (m_doSecondStage ? m_nLayers_2nd : m_nLayers_1st);
   int nDim = (m_doSecondStage ? m_nDim_2nd : m_nDim_1st);
  
   for (int region = 0; region < m_nRegions; region++) {
       // Create the tree
       std::stringstream name;
       std::stringstream title;
       name << "am" << region;
       title << "Ambank " << region << " parameters";
       TTree* tree = new TTree(name.str().c_str(), title.str().c_str());
       ATH_CHECK(m_tHistSvc->regTree(Form("/TRIGFPGATrackSimMATRIXOUT/%s",tree->GetName()), tree));
  
       // Fill the tree
       ::fillTree(m_sector_cum[region], tree, nLayers, nDim);
       // Monitoring
       ATH_MSG_INFO("Sectors found in region " << region << ": " << m_sector_cum[region].size());
       for (auto & sector_info : m_sector_cum[region]) {
     double coverage = sector_info.second.track_bins.size();
     m_h_nHit->Fill(coverage);
     for (unsigned i = 0; i < FPGATrackSimTrackPars::NPARS; i++)
       m_h_sectorPars[i]->Fill(sector_info.second.pars[i] / coverage);
       }
   }
   
   writeSliceTree();
   ATH_CHECK(m_tHistSvc->finalize());
   return StatusCode::SUCCESS;
 }

◆ getLogicalHits()

std::vector< FPGATrackSimHit > FPGATrackSimMatrixGenAlgo::getLogicalHits ( )

private

Definition at line 374 of file FPGATrackSimMatrixGenAlgo.cxx.

 {
   std::vector<FPGATrackSimHit> hits;
   //Setup the logical header...
   FPGATrackSimLogicalEventInputHeader logicalHeader;
   //Map the hits to the logical header...
   unsigned stage = 0;
   if (m_doHoughConstants) stage = 1; // For now Hough constants only works on 1st stage
   else stage = 2;
   StatusCode sc = m_hitMapTool->convert(stage, *m_eventHeader, logicalHeader);
   if (sc.isFailure()) ATH_MSG_ERROR("Hit mapping failed");
  
   // Since the clustering tool modifies the logical towers-- refactored this
   // to only access the output hits from the towers.
   if (m_doClustering) {
     std::vector<FPGATrackSimCluster> clustered_hits;
     sc = m_clusteringTool->DoClustering(logicalHeader, clustered_hits);
     if (sc.isFailure()) ATH_MSG_ERROR("Clustering failed");
   }
   // Optionally do spacepoints (as well).
   if (m_doSpacePoints) {
     std::vector<FPGATrackSimCluster> spacepoints;
     sc = m_spacePointsTool->DoSpacePoints(logicalHeader, spacepoints);
     if (sc.isFailure()) ATH_MSG_ERROR("Spacepoints failed");
   }
  
   // It should now be safe to pull the towers, regardless.
   std::vector<FPGATrackSimTowerInputHeader> towers = logicalHeader.towers();
   for (auto &tower : towers) {
     std::vector<FPGATrackSimHit> const & towerHits = tower.hits();
     for (FPGATrackSimHit const & hit : towerHits) {
       hits.push_back(hit);
     }
   }
   return hits;
 }

◆ getRegion()

int FPGATrackSimMatrixGenAlgo::getRegion	(	std::vector< FPGATrackSimHit > const &	hits,
		bool	is1ststage
	)		const

private

Definition at line 664 of file FPGATrackSimMatrixGenAlgo.cxx.

 {
   // Start with a bitmask, all true, and set a region to false if any mismatch is found
   std::vector<bool> region_mask(m_nRegions, true);
  
   for (FPGATrackSimHit const & hit : hits) {
     if (hit.isReal()) { // don't worry about hits that are WCs
       for (int region = 0; region < m_nRegions; region++) {
     if (m_doHoughConstants && is1ststage) {
       if (!m_FPGATrackSimMapping->RegionMap_1st()->isInRegion(region, hit))
         region_mask[region] = false;
     }
     else {
       if (!m_FPGATrackSimMapping->RegionMap_2nd()->isInRegion(region, hit))
         region_mask[region] = false;
     }
       }
     }
   }
  
   // For now just give preference to lowest region index for simplicity
   for (int region = 0; region < m_nRegions; region++) {
     if (region_mask[region])
       return region;
   }
  
   return -1;
 }

◆ initialize()

StatusCode FPGATrackSimMatrixGenAlgo::initialize ( )

override

Definition at line 48 of file FPGATrackSimMatrixGenAlgo.cxx.

 {
   ATH_MSG_DEBUG("initialize()");
  
   // set the slicing variables from inputs
   m_sliceMax.qOverPt = m_temp_c_max;
   m_sliceMax.phi = m_temp_phi_max;
   m_sliceMax.eta = m_temp_eta_max;
   m_sliceMax.d0 = m_temp_d0_max;
   m_sliceMax.z0 = m_temp_z0_max;
  
   m_sliceMin.qOverPt = m_temp_c_min;
   m_sliceMin.phi = m_temp_phi_min;
   m_sliceMin.eta = m_temp_eta_min;
   m_sliceMin.d0 = m_temp_d0_min;
   m_sliceMin.z0 = m_temp_z0_min;
  
   m_nBins.qOverPt = m_temp_c_slices;
   m_nBins.phi = m_temp_phi_slices;
   m_nBins.eta = m_temp_eta_slices;
   m_nBins.d0 = m_temp_d0_slices;
   m_nBins.z0 = m_temp_z0_slices;
  
   // Retrieve handles
   ATH_CHECK(m_tHistSvc.retrieve());
   ATH_CHECK(m_FPGATrackSimMapping.retrieve());
   ATH_CHECK(m_hitInputTool.retrieve());
   ATH_CHECK(m_hitMapTool.retrieve());
   ATH_CHECK(m_EvtSel.retrieve());
   ATH_CHECK(m_roadFinderTool.retrieve());
   if (m_doClustering) ATH_CHECK(m_clusteringTool.retrieve());
   if (m_doSpacePoints) ATH_CHECK(m_spacePointsTool.retrieve());
   ATH_CHECK(m_trackExtensionTool.retrieve(EnableTool{m_doHoughConstants && m_doSecondStage}));
   ATH_CHECK(m_trackFitterTool_1st.retrieve(EnableTool{m_doHoughConstants && m_doSecondStage}));
   ATH_CHECK(m_overlapRemovalTool.retrieve(EnableTool{m_doHoughConstants && m_doSecondStage}));
  
  
   
   if (m_doHoughConstants) {
     if (m_ideal_geom == 0) {
       ATH_MSG_INFO("Hough constants method needs idealized geometry > 0, aborting.");
       return StatusCode::FAILURE;
     }
     m_nRegions = m_FPGATrackSimMapping->RegionMap_1st()->getNRegions();
     m_pmap_2nd = m_FPGATrackSimMapping->PlaneMap_2nd(0);
     m_pmap_1st = m_FPGATrackSimMapping->PlaneMap_1st(0);
     // Get detector configurations
     m_nLayers_1st = m_FPGATrackSimMapping->PlaneMap_1st(0)->getNLogiLayers();
     m_nDim_1st = m_FPGATrackSimMapping->PlaneMap_1st(0)->getNCoords();
     m_nLayers_2nd = m_FPGATrackSimMapping->PlaneMap_2nd(0)->getNLogiLayers();
     m_nDim_2nd = m_FPGATrackSimMapping->PlaneMap_2nd(0)->getNCoords();
   }
   else {
     // Get detector configurations
     m_nLayers_1st = m_FPGATrackSimMapping->PlaneMap_2nd(0)->getNLogiLayers();
     m_nRegions = m_FPGATrackSimMapping->RegionMap_2nd()->getNRegions();
     m_nDim_1st = m_FPGATrackSimMapping->PlaneMap_2nd(0)->getNCoords();
   }
  
   m_sector_cum.resize(m_nRegions);
  
   // Retrieve slice information
   m_sliceMin = m_EvtSel->getMin();
   m_sliceMax = m_EvtSel->getMax();
  
   // Check q/pt binning information
   if (m_qOverPtBins.size() == 0) {
     ATH_MSG_ERROR("q/pt bin information not set in matrix element job options!");
     return StatusCode::FAILURE;
   }
  
  
   // Histograms
   ATH_CHECK(bookHistograms());
  
   m_eventHeader            = new FPGATrackSimEventInputHeader();
  
   return StatusCode::SUCCESS;
 }

◆ inputHandles()

virtual std::vector<Gaudi::DataHandle*> AthCommonDataStore< AthCommonMsg< Algorithm > >::inputHandles ( ) const

overridevirtualinherited

Return this algorithm's input handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

◆ makeAccumulator()

StatusCode FPGATrackSimMatrixGenAlgo::makeAccumulator	(	std::vector< FPGATrackSimHit > const &	sector_hits,
		FPGATrackSimTruthTrack const &	track,
		std::pair< std::vector< module_t >, FPGATrackSimMatrixAccumulator > &	accumulator
	)		const

private

Definition at line 757 of file FPGATrackSimMatrixGenAlgo.cxx.

 {
  
  
   const FPGATrackSimPlaneMap *pmap = (m_doSecondStage ? m_pmap_2nd : m_pmap_1st);
   int nLayers = (m_doSecondStage ? m_nLayers_2nd : m_nLayers_1st);
   int nDim = (m_doSecondStage ? m_nDim_2nd : m_nDim_1st);
   std::vector<module_t> modules(nLayers);
   FPGATrackSimMatrixAccumulator acc(nLayers, nDim);
  
   //find the bin!
   // NOTE: this only implements q/pt binning, not the subregion / eta pattern-based constants for now.
   int sectorbin = 0;
   double qoverpt = track.getQ() / track.getPt();
  
   // for 2nd stage we only use one q/pt bin
   if (m_absQOverPtBinning || m_doSecondStage) qoverpt = abs(qoverpt);
   if (!m_doSecondStage) {
     for (unsigned bin = 0; bin < m_qOverPtBins.size()-1; bin++) {
       sectorbin = fpgatracksim::QPT_SECTOR_OFFSET * bin;
       if (qoverpt < m_qOverPtBins[bin+1]) break;
     }
   }
   
   // Create sector definitions (list of modules)
   std::string module_printout = "";
   for (int i = 0; i < nLayers; i++)
     {
       if (sector_hits[i].isReal()) {
         if (m_single) modules[i] = sector_hits[i].getIdentifierHash();
         else {
           modules[i] = sectorbin;
           // Modify sectorbin by a "type" field, which for now means: 0 = not spacepoint, 1 = spacepoint.
           // This will fail if we have more than 99 q/pt bins!
           if (sector_hits[i].getHitType() == HitType::spacepoint) {
               modules[i] += fpgatracksim::SPACEPOINT_SECTOR_OFFSET;
           }
           module_printout += std::to_string(modules[i]) + ", ";
         }
       }
       else {
         modules[i] = -1; // WC
       }
     }
  
   ATH_MSG_DEBUG("Generating track in sectorbin = " << sectorbin << " with modules: " << module_printout);
  
   
   if (m_single) {
     const int ToKeep[13] = {2200,2564,2861,3831,5368,14169,14173,20442,20446,29625,29629,42176,42180};
     bool keepThis = true;
     for (int i = 0; i < 13; i++) {
       if (modules[i] != ToKeep[i] && modules[i] != -1) {
     keepThis = false;
       }
     }
  
     if (!keepThis) {
       for (int i = 0; i < 13; i++) modules[i] = -1;
     }
     else {
       for (int i = 0; i < 13; i++) {
       }
     }
   }
  
  
   // Hough Constants parameters
   double y = accumulator.second.pars.qOverPt;
   double x = accumulator.second.pars.phi;
  
   // Vectorize (flatten) coordinates
   std::vector<float> coords;
  
   for (int i = 0; i < nLayers; ++i) {
  
     if (sector_hits[i].isReal()) {
       double target_r = (m_doSecondStage ? m_FPGATrackSimMapping->RegionMap_2nd()->getAvgRadius(0, i) : m_FPGATrackSimMapping->RegionMap_1st()->getAvgRadius(0, i));
       // If this is a spacepoint the target R should be the average of the two layers.
       // TODO, get this to be loaded in from a mean radii file into the mapping infrastructure.
       if (sector_hits[i].getHitType() == HitType::spacepoint) {
         int other_layer = (sector_hits[i].getSide() == 0) ? i + 1 : i - 1;
     target_r = (m_doSecondStage ?
             (target_r +  m_FPGATrackSimMapping->RegionMap_2nd()->getAvgRadius(0, other_layer))/2. :
             (target_r +  m_FPGATrackSimMapping->RegionMap_1st()->getAvgRadius(0, other_layer))/2.);
       }
  
       std::vector<float> coords_tmp;
       if ( m_ideal_geom > 1 ) {
         coords_tmp = computeIdealCoords(sector_hits[i], x, y, target_r, m_doDeltaPhiConsts, TrackCorrType::Second);
       }
       else {
         coords_tmp = computeIdealCoords(sector_hits[i], x, y, target_r, m_doDeltaPhiConsts, TrackCorrType::None);
       }
  
       // Create phi for any hits that are not spacepoints, as well as "inner" spacepoints.
       // but not outer spacepoints. this avoids duplicate coordinates.
       if (sector_hits[i].getHitType() != HitType::spacepoint || sector_hits[i].getSide() == 0) {
         // get idealized gPhi
         coords.push_back(coords_tmp[1]);
       }
  
        // Create a z coordinate for the "outer" layer of the spacepoint and for 2D pixel hits.
       // This means that a spacepoint will write out (phi, eta) pairs, but (0, phi) or (phi, 0) if it's missing.
       if (sector_hits[i].getDim() == 2 || (sector_hits[i].getHitType() == HitType::spacepoint && (sector_hits[i].getPhysLayer() % 2) == 1)) {
         // get idealized z
         coords.push_back(coords_tmp[0]);
       }
     }
     else {
       if (pmap->getDim(i) == 2) {
         coords.push_back(0);
       }
       coords.push_back(0);
     }
   }
  
   assert(coords.size() == (size_t)nDim);
   acc.hit_coords = coords;
   acc.hit_coordsG = coords;
   
   // Get the track parameters
   acc.pars = track.getPars();
   if (m_doHoughConstants && m_doDeltaPhiConsts) {
     acc.pars.qOverPt = (y / 1000.0) - track.getQOverPt(); // fit for delta q/pT
     acc.pars.phi = x - track.getPhi(); // fit for delta phi_0
   }
   
   FPGATrackSimTrackParsI bins;
   for (unsigned i = 0; i < FPGATrackSimTrackPars::NPARS; i++)
     bins[i] = (acc.pars[i] - m_sliceMin[i]) * m_nBins[i] / (m_sliceMax[i] - m_sliceMin[i]);
   acc.track_bins.push_back(bins);
  
   // Force phi to be in [0, 2pi] (post binning)
   if (!m_doDeltaPhiConsts) {
     while (acc.pars.phi < 0) acc.pars.phi += 2*M_PI;
     while (acc.pars.phi > 2*M_PI) acc.pars.phi -= 2*M_PI;
   }
  
   // Calculate the pre-multiplied elements
   for (int i = 0; i < nDim; i++)
     {
       acc.hit_x_QoP[i] = coords[i] * acc.pars.qOverPt;
       acc.hit_xG_HIP[i] = coords[i] * acc.pars.qOverPt;
       acc.hit_x_d0[i]  = coords[i] * acc.pars.d0;
       acc.hit_x_z0[i]  = coords[i] * acc.pars.z0;
       acc.hit_x_eta[i] = coords[i] * acc.pars.eta;
       acc.hit_xG_eta[i] = coords[i] * acc.pars.eta;
       acc.hit_x_phi[i] = coords[i] * acc.pars.phi;
  
       for (int j = i; j < nDim; j++)
     acc.covariance[i * nDim + j] = coords[i] * coords[j];
  
       for (int j = i; j < nDim; j++)
     acc.covarianceG[i * nDim + j] = coords[i] * coords[j];
     }
  
   accumulator = {modules, acc};
   return StatusCode::SUCCESS;
 }

◆ makeBarcodeMap()

std::map< int, std::vector< FPGATrackSimHit > > FPGATrackSimMatrixGenAlgo::makeBarcodeMap	(	std::vector< FPGATrackSimHit > const &	hits,
		std::vector< FPGATrackSimTruthTrack > const &	tracks
	)		const

private

Definition at line 449 of file FPGATrackSimMatrixGenAlgo.cxx.

 {
   std::map<int, std::vector<FPGATrackSimHit>> map;
  
   // Ready the barcodes
   for (const FPGATrackSimTruthTrack & track : tracks)
     map[track.getBarcode()] = std::vector<FPGATrackSimHit>();
  
   // Add the hits
   for (const FPGATrackSimHit & hit : hits) {
     // Get the predominant barcode for the current hit
     int barcode = hit.getTruth().best_barcode();
     
     // Add hit to the list; skip the hits if not associated to a good truth tracks
     auto it = map.find(barcode);
     if (it != map.end()) (*it).second.push_back(hit);
   }
   
   return map;
 }

◆ msg() [1/2]

MsgStream& AthCommonMsg< Algorithm >::msg ( ) const

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                 {
     return this->msgStream();
   }

◆ msg() [2/2]

MsgStream& AthCommonMsg< Algorithm >::msg ( const MSG::Level lvl ) const

inlineinherited

Definition at line 27 of file AthCommonMsg.h.

                                                   {
     return this->msgStream(lvl);
   }

◆ msgLvl()

bool AthCommonMsg< Algorithm >::msgLvl ( const MSG::Level lvl ) const

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                                {
     return this->msgLevel(lvl);
   }

◆ outputHandles()

virtual std::vector<Gaudi::DataHandle*> AthCommonDataStore< AthCommonMsg< Algorithm > >::outputHandles ( ) const

overridevirtualinherited

Return this algorithm's output handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

◆ renounce()

std::enable_if_t<std::is_void_v<std::result_of_t<decltype(&T::renounce)(T)> > && !std::is_base_of_v<SG::VarHandleKeyArray, T> && std::is_base_of_v<Gaudi::DataHandle, T>, void> AthCommonDataStore< AthCommonMsg< Algorithm > >::renounce ( T & h )

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

   {
     h.renounce();
     PBASE::renounce (h);
   }

◆ renounceArray()

void AthCommonDataStore< AthCommonMsg< Algorithm > >::renounceArray ( SG::VarHandleKeyArray & handlesArray )

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                           {
     handlesArray.renounce();
   }

◆ selectHit()

FPGATrackSimMatrixGenAlgo::selectHit_returnCode FPGATrackSimMatrixGenAlgo::selectHit	(	FPGATrackSimHit const &	old_hit,
		FPGATrackSimHit const &	new_hit,
		bool	is1ststage,
		int	subregion
	)		const

private

Definition at line 483 of file FPGATrackSimMatrixGenAlgo.cxx.

 {
    if (old_hit.isReal() && !new_hit.isReal()) return selectHit_returnCode::SH_KEEP_OLD;
    if (!old_hit.isReal() && new_hit.isReal()) return selectHit_returnCode::SH_KEEP_NEW;  
    if (!old_hit.isReal() && !new_hit.isReal()) return selectHit_returnCode::SH_FAILURE;
    if ((new_hit.getSection() == old_hit.getSection()) && (new_hit.getLayer() == old_hit.getLayer())
        && (new_hit.getEtaModule() == old_hit.getEtaModule()) && (new_hit.getPhiModule() == old_hit.getPhiModule())) {
       ATH_MSG_DEBUG("Two hits on same module");
       return selectHit_returnCode::SH_FAILURE;
    }
    // Always prefer spacepoints, regardless of all other considerations.
    // This is necessary in part due to spacepoint duplication.
    if (old_hit.getHitType() == HitType::spacepoint && new_hit.getHitType() != HitType::spacepoint) {
       return selectHit_returnCode::SH_KEEP_OLD;
    } else if (old_hit.getHitType() != HitType::spacepoint && new_hit.getHitType() == HitType::spacepoint) {
       return selectHit_returnCode::SH_KEEP_NEW;
    }
    int new_section = new_hit.getSection();
    int old_section = old_hit.getSection();
    
    if (old_section == new_section) {
       if (old_hit.getEtaModule() == new_hit.getEtaModule()) {
       int rmax = 0;
       if (m_doHoughConstants && is1ststage) {
          int phi_max = m_FPGATrackSimMapping->SubRegionMap()->getRegionBoundaries(subregion, new_hit.getLayer(), new_section).phi_max;
          int phi_min = m_FPGATrackSimMapping->SubRegionMap()->getRegionBoundaries(subregion, new_hit.getLayer(), new_section).phi_min;
          rmax = phi_max - phi_min;
  
       }
       else {
          int phi_max = m_FPGATrackSimMapping->SubRegionMap_2nd()->getRegionBoundaries(subregion, new_hit.getLayer(), new_section).phi_max;
          int phi_min = m_FPGATrackSimMapping->SubRegionMap_2nd()->getRegionBoundaries(subregion, new_hit.getLayer(), new_section).phi_min;
          rmax = phi_max - phi_min;
       }
       
       int phi_diff = old_hit.getPhiModule() - new_hit.getPhiModule();
       
       if (phi_diff == 1 || phi_diff == -rmax) return selectHit_returnCode::SH_KEEP_OLD;
       else if (phi_diff == -1 || phi_diff == rmax) return selectHit_returnCode::SH_KEEP_NEW;
       else {
          ATH_MSG_DEBUG("Hits are too far away in phi");
          return selectHit_returnCode::SH_FAILURE;
       }
       }
       else { // Different eta is no good
          ATH_MSG_DEBUG("Hits are in different eta");
          return selectHit_returnCode::SH_FAILURE;
       }
    }
    else { // sections are different
       int  layer = old_hit.getLayer();
       bool old_isEC = 0;
       bool new_isEC = 0;
       int  old_disk = 0;
       int  new_disk = 0;
       if (m_doHoughConstants && is1ststage) {
          old_isEC = m_FPGATrackSimMapping->PlaneMap_1st(subregion)->isEC(layer, old_section);
          new_isEC = m_FPGATrackSimMapping->PlaneMap_1st(subregion)->isEC(layer, new_section);
          old_disk = m_FPGATrackSimMapping->PlaneMap_1st(subregion)->getLayerInfo(layer, old_section).physDisk;
          new_disk = m_FPGATrackSimMapping->PlaneMap_1st(subregion)->getLayerInfo(layer, new_section).physDisk;
       }
       else {
          old_isEC = m_FPGATrackSimMapping->PlaneMap_2nd(subregion)->isEC(layer, old_section);
          new_isEC = m_FPGATrackSimMapping->PlaneMap_2nd(subregion)->isEC(layer, new_section);
          old_disk = m_FPGATrackSimMapping->PlaneMap_2nd(subregion)->getLayerInfo(layer, old_section).physDisk;
          new_disk = m_FPGATrackSimMapping->PlaneMap_2nd(subregion)->getLayerInfo(layer, new_section).physDisk;
       }
       // If one is barrel and one endcap, it's definitely OK, take the barrel hit
       if (old_isEC != new_isEC) {
          
          if (old_isEC) return selectHit_returnCode::SH_KEEP_NEW;
          else return selectHit_returnCode::SH_KEEP_OLD;
       }
       // Two endcap hits : same disk: discard
       else if (old_disk == new_disk) {
          
          ATH_MSG_DEBUG("Two modules hit in same physical disk " << old_disk);
          return selectHit_returnCode::SH_FAILURE;
       }
       // Two endcap hits on same side: different disks: take the lower-z
       else {
          ATH_MSG_DEBUG("Keeping the lower-z of the two disks (" << old_disk << ", " << new_disk << ") hit");
          if (old_disk > new_disk) return selectHit_returnCode::SH_KEEP_NEW;
          else return selectHit_returnCode::SH_KEEP_OLD;
       }
    }
 }

◆ sysInitialize()

StatusCode AthAlgorithm::sysInitialize ( )

overridevirtualinherited

Override sysInitialize.

Override sysInitialize from the base class.

Loop through all output handles, and if they're WriteCondHandles, automatically register them and this Algorithm with the CondSvc

Scan through all outputHandles, and if they're WriteCondHandles, register them with the CondSvc

Reimplemented from AthCommonDataStore< AthCommonMsg< Algorithm > >.

Reimplemented in AthAnalysisAlgorithm, AthFilterAlgorithm, PyAthena::Alg, and AthHistogramAlgorithm.

Definition at line 66 of file AthAlgorithm.cxx.

                                        {
   StatusCode sc=AthCommonDataStore<AthCommonMsg<Algorithm>>::sysInitialize();
  
   if (sc.isFailure()) {
     return sc;
   }
   ServiceHandle<ICondSvc> cs("CondSvc",name());
   for (auto h : outputHandles()) {
     if (h->isCondition() && h->mode() == Gaudi::DataHandle::Writer) {
       // do this inside the loop so we don't create the CondSvc until needed
       if ( cs.retrieve().isFailure() ) {
         ATH_MSG_WARNING("no CondSvc found: won't autoreg WriteCondHandles");
         return StatusCode::SUCCESS;
       }
       if (cs->regHandle(this,*h).isFailure()) {
         sc = StatusCode::FAILURE;
         ATH_MSG_ERROR("unable to register WriteCondHandle " << h->fullKey()
                       << " with CondSvc");
       }
     }
   }
   return sc;
 }

◆ sysStart()

virtual StatusCode AthCommonDataStore< AthCommonMsg< Algorithm > >::sysStart ( )

overridevirtualinherited

Handle START transition.

We override this in order to make sure that conditions handle keys can cache a pointer to the conditions container.

◆ updateVHKA()

void AthCommonDataStore< AthCommonMsg< Algorithm > >::updateVHKA ( Gaudi::Details::PropertyBase & )

inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

                                                {
     // debug() << "updateVHKA for property " << p.name() << " " << p.toString() 
     //         << "  size: " << m_vhka.size() << endmsg;
     for (auto &a : m_vhka) {
       std::vector<SG::VarHandleKey*> keys = a->keys();
       for (auto k : keys) {
         k->setOwner(this);
       }
     }
   }

◆ writeSliceTree()

void FPGATrackSimMatrixGenAlgo::writeSliceTree ( )

private

Definition at line 959 of file FPGATrackSimMatrixGenAlgo.cxx.

 {
   TTree* sliceTree = new TTree("slice", "Region slice boundaries"); // slice
  
   sliceTree->Branch("c_max",  &m_sliceMax.qOverPt);
   sliceTree->Branch("d0_max",         &m_sliceMax.d0);
   sliceTree->Branch("phi_max",        &m_sliceMax.phi);
   sliceTree->Branch("z0_max",         &m_sliceMax.z0);
   sliceTree->Branch("eta_max",        &m_sliceMax.eta);
  
   sliceTree->Branch("c_min",  &m_sliceMin.qOverPt);
   sliceTree->Branch("d0_min",         &m_sliceMin.d0);
   sliceTree->Branch("phi_min",        &m_sliceMin.phi);
   sliceTree->Branch("z0_min",         &m_sliceMin.z0);
   sliceTree->Branch("eta_min",        &m_sliceMin.eta);
  
   sliceTree->Branch("c_slices", &m_nBins.qOverPt);
   sliceTree->Branch("d0_slices",        &m_nBins.d0);
   sliceTree->Branch("phi_slices",       &m_nBins.phi);
   sliceTree->Branch("z0_slices",        &m_nBins.z0);
   sliceTree->Branch("eta_slices",       &m_nBins.eta);
  
   StatusCode sc = m_tHistSvc->regTree("/TRIGFPGATrackSimMATRIXOUT/slice",sliceTree);
   if (sc.isFailure()) ATH_MSG_ERROR("tHist failed");
  
   sliceTree->Fill();
 }

Member Data Documentation

◆ m_absQOverPtBinning

Gaudi::Property<bool> FPGATrackSimMatrixGenAlgo::m_absQOverPtBinning {this, "qptAbsBinning", false, "This property controls whether or not to interpret the bins as q/pt or |q/pt|"}

private

Definition at line 125 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_clusteringTool

ToolHandle<FPGATrackSimClusteringToolI> FPGATrackSimMatrixGenAlgo::m_clusteringTool { this, "FPGATrackSimClusteringFTKTool", "FPGATrackSimClusteringFTKTool/FPGATrackSimClusteringFTKTool", "FPGATrackSimClusteringFTKTool" }

private

Definition at line 81 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_D0_THRESHOLD

Gaudi::Property<float> FPGATrackSimMatrixGenAlgo::m_D0_THRESHOLD {this, "D0_THRESHOLD", 1., "Max d0"}

private

Definition at line 108 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_detStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Algorithm > >::m_detStore

privateinherited

Pointer to StoreGate (detector store by default)

Definition at line 393 of file AthCommonDataStore.h.

◆ m_doClustering

Gaudi::Property<bool> FPGATrackSimMatrixGenAlgo::m_doClustering {this, "Clustering", true, "Do cluster?"}

private

Definition at line 98 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_doDeltaPhiConsts

Gaudi::Property<bool> FPGATrackSimMatrixGenAlgo::m_doDeltaPhiConsts {this, "DeltaPhiConstants", false, "If true will generate delta phi constants"}

private

Definition at line 104 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_doHoughConstants

Gaudi::Property<bool> FPGATrackSimMatrixGenAlgo::m_doHoughConstants {this, "HoughConstants", true, "If true will run Hough Transform to set q/pt and phi0"}

private

Definition at line 103 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_doSecondStage

Gaudi::Property<bool> FPGATrackSimMatrixGenAlgo::m_doSecondStage {this, "SecondStage", false, "Run second stage?"}

private

Definition at line 99 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_doSpacePoints

Gaudi::Property<bool> FPGATrackSimMatrixGenAlgo::m_doSpacePoints {this, "SpacePoints", true, "Do spacepoints?"}

private

Definition at line 100 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_dropHitsAndFill

Gaudi::Property<bool> FPGATrackSimMatrixGenAlgo::m_dropHitsAndFill {this, "dropHitsAndFill", false, "If true, we can drop hits to fill the accumulator"}

private

Definition at line 127 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_eventHeader

FPGATrackSimEventInputHeader* FPGATrackSimMatrixGenAlgo::m_eventHeader = nullptr

private

Definition at line 140 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_EvtSel

ServiceHandle<IFPGATrackSimEventSelectionSvc> FPGATrackSimMatrixGenAlgo::m_EvtSel {this,"FPGATrackSimEventSelectionSvc",""}

private

Definition at line 76 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_evtStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Algorithm > >::m_evtStore

privateinherited

Pointer to StoreGate (event store by default)

Definition at line 390 of file AthCommonDataStore.h.

◆ m_extendedExtraObjects

DataObjIDColl AthAlgorithm::m_extendedExtraObjects

privateinherited

Definition at line 79 of file AthAlgorithm.h.

◆ m_FPGATrackSimMapping

ServiceHandle<IFPGATrackSimMappingSvc> FPGATrackSimMatrixGenAlgo::m_FPGATrackSimMapping {this,"FPGATrackSimMappingSvc","FPGATrackSimMappingSvc"}

private

Definition at line 75 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_h_3hitsInLayer

TH1I* FPGATrackSimMatrixGenAlgo::m_h_3hitsInLayer[FPGATrackSimTrackPars::NPARS] {}

private

Definition at line 174 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_h_nHit

TH1I* FPGATrackSimMatrixGenAlgo::m_h_nHit = nullptr

private

Definition at line 179 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_h_notEnoughHits

TH1I* FPGATrackSimMatrixGenAlgo::m_h_notEnoughHits[FPGATrackSimTrackPars::NPARS] {}

private

Definition at line 175 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_h_sectorPars

TH1I* FPGATrackSimMatrixGenAlgo::m_h_sectorPars[FPGATrackSimTrackPars::NPARS] {}

private

Definition at line 172 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_h_SHfailure

TH1I* FPGATrackSimMatrixGenAlgo::m_h_SHfailure[FPGATrackSimTrackPars::NPARS] {}

private

Definition at line 173 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_h_trackQoP_okHits

TH1I* FPGATrackSimMatrixGenAlgo::m_h_trackQoP_okHits = nullptr

private

Definition at line 177 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_h_trackQoP_okRegion

TH1I* FPGATrackSimMatrixGenAlgo::m_h_trackQoP_okRegion = nullptr

private

Definition at line 178 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_h_trainingTrack

TH1I* FPGATrackSimMatrixGenAlgo::m_h_trainingTrack[FPGATrackSimTrackPars::NPARS] {}

private

Definition at line 171 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_hitInputTool

ToolHandle<IFPGATrackSimInputTool> FPGATrackSimMatrixGenAlgo::m_hitInputTool {this, "FPGATrackSimSGToRawHitsTool", "FPGATrackSimSGToRawHitsTool/FPGATrackSimSGToRawHits", "input handler"}

private

Definition at line 79 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_hitMapTool

ToolHandle<FPGATrackSimRawToLogicalHitsTool> FPGATrackSimMatrixGenAlgo::m_hitMapTool {this, "FPGATrackSimRawToLogicalHitsTool", "FPGATrackSimRawToLogicalHitsTool/FPGATrackSim_RawToLogicalHitsTool", "FPGATrackSim_RawToLogicalHitsTool"}

private

Definition at line 80 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_ideal_geom

Gaudi::Property<int> FPGATrackSimMatrixGenAlgo::m_ideal_geom {this, "IdealiseGeometry", 0, "Ideal geo flag, 0 is non, 1 is 1st order, 2 is 2nd order"}

private

Definition at line 101 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_MaxWC

Gaudi::Property<int> FPGATrackSimMatrixGenAlgo::m_MaxWC {this, "WCmax", 0, "Max number of WCs"}

private

Definition at line 105 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_minSpacePlusPixel

Gaudi::Property<int> FPGATrackSimMatrixGenAlgo::m_minSpacePlusPixel {this, "minSpacePlusPixel", 4, "Require that tracks in training have a certain number of pixel hits + spacepoints" }

private

Definition at line 106 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_nBins

FPGATrackSimTrackParsI FPGATrackSimMatrixGenAlgo::m_nBins

private

Definition at line 138 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_nDim_1st

int FPGATrackSimMatrixGenAlgo::m_nDim_1st = 0

private

Definition at line 130 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_nDim_2nd

int FPGATrackSimMatrixGenAlgo::m_nDim_2nd = 0

private

Definition at line 133 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_nLayers_1st

int FPGATrackSimMatrixGenAlgo::m_nLayers_1st = 0

private

Definition at line 129 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_nLayers_2nd

int FPGATrackSimMatrixGenAlgo::m_nLayers_2nd = 0

private

Definition at line 132 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_nRegions

Gaudi::Property<int> FPGATrackSimMatrixGenAlgo::m_nRegions {this, "NBanks", 0, "Number of banks to make"}

private

Definition at line 97 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_nTracks

size_t FPGATrackSimMatrixGenAlgo::m_nTracks = 0

private

Definition at line 145 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_nTracksUsed

size_t FPGATrackSimMatrixGenAlgo::m_nTracksUsed = 0

private

Definition at line 146 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_overlapRemovalTool

ToolHandle<FPGATrackSimOverlapRemovalTool> FPGATrackSimMatrixGenAlgo::m_overlapRemovalTool {this, "OverlapRemoval_1st", "FPGATrackSimOverlapRemovalTool/FPGATrackSimOverlapRemovalTool_1st", "1st stage overlap removal tool"}

private

Definition at line 88 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_pmap

const FPGATrackSimPlaneMap* FPGATrackSimMatrixGenAlgo::m_pmap = nullptr

private

Definition at line 83 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_pmap_1st

const FPGATrackSimPlaneMap* FPGATrackSimMatrixGenAlgo::m_pmap_1st = nullptr

private

Definition at line 91 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_pmap_2nd

const FPGATrackSimPlaneMap* FPGATrackSimMatrixGenAlgo::m_pmap_2nd = nullptr

private

Definition at line 92 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_PT_THRESHOLD

Gaudi::Property<float> FPGATrackSimMatrixGenAlgo::m_PT_THRESHOLD {this, "PT_THRESHOLD", 0., "Min pt"}

private

Definition at line 107 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_qOverPtBins

Gaudi::Property<std::vector<double> > FPGATrackSimMatrixGenAlgo::m_qOverPtBins {this, "sectorQPtBins", {}, "q/pt bins for sector definition"}

private

Definition at line 126 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_roadFinderTool

ToolHandle<FPGATrackSimRoadUnionTool> FPGATrackSimMatrixGenAlgo::m_roadFinderTool {this, "RoadFinder", "RoadFinder"}

private

Definition at line 84 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_sector_cum

std::vector<AccumulateMap> FPGATrackSimMatrixGenAlgo::m_sector_cum

private

Definition at line 70 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_single

Gaudi::Property<bool> FPGATrackSimMatrixGenAlgo::m_single {this, "SingleSector", false, "Run single sector"}

private

Definition at line 102 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_sliceMax

FPGATrackSimTrackPars FPGATrackSimMatrixGenAlgo::m_sliceMax = 0

private

Definition at line 137 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_sliceMin

FPGATrackSimTrackPars FPGATrackSimMatrixGenAlgo::m_sliceMin = 0

private

Definition at line 136 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_spacePointsTool

ToolHandle<FPGATrackSimSpacePointsToolI> FPGATrackSimMatrixGenAlgo::m_spacePointsTool { this, "SpacePointTool", "FPGATrackSimSpacePointsTool/FPGATrackSimSpacePointsTool", "FPGATrackSimSpacePointsTool" }

private

Definition at line 82 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_temp_c_max

Gaudi::Property<float> FPGATrackSimMatrixGenAlgo::m_temp_c_max {this, "par_c_max", 1, "Max curvature"}

private

Definition at line 111 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_temp_c_min

Gaudi::Property<float> FPGATrackSimMatrixGenAlgo::m_temp_c_min {this, "par_c_min", -1, "Min curvature"}

private

Definition at line 110 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_temp_c_slices

Gaudi::Property<int> FPGATrackSimMatrixGenAlgo::m_temp_c_slices {this, "par_c_slices", 100, "Number of c slides"}

private

Definition at line 120 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_temp_d0_max

Gaudi::Property<float> FPGATrackSimMatrixGenAlgo::m_temp_d0_max {this, "par_d0_max", 2, "Max d0"}

private

Definition at line 115 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_temp_d0_min

Gaudi::Property<float> FPGATrackSimMatrixGenAlgo::m_temp_d0_min {this, "par_d0_min", -2, "Min d0"}

private

Definition at line 114 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_temp_d0_slices

Gaudi::Property<int> FPGATrackSimMatrixGenAlgo::m_temp_d0_slices {this, "par_d0_slices", 100, "Number of d0 slices"}

private

Definition at line 122 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_temp_eta_max

Gaudi::Property<float> FPGATrackSimMatrixGenAlgo::m_temp_eta_max {this, "par_eta_max", 5, "Max eta"}

private

Definition at line 119 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_temp_eta_min

Gaudi::Property<float> FPGATrackSimMatrixGenAlgo::m_temp_eta_min {this, "par_eta_min", -5, "Min eta"}

private

Definition at line 118 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_temp_eta_slices

Gaudi::Property<int> FPGATrackSimMatrixGenAlgo::m_temp_eta_slices {this, "par_eta_slices", 100, "Number of eta slices"}

private

Definition at line 124 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_temp_phi_max

Gaudi::Property<float> FPGATrackSimMatrixGenAlgo::m_temp_phi_max {this, "par_phi_max", TMath::Pi(), "Max phi"}

private

Definition at line 113 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_temp_phi_min

Gaudi::Property<float> FPGATrackSimMatrixGenAlgo::m_temp_phi_min {this, "par_phi_min", -TMath::Pi(), "Min phi"}

private

Definition at line 112 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_temp_phi_slices

Gaudi::Property<int> FPGATrackSimMatrixGenAlgo::m_temp_phi_slices {this, "par_phi_slices", 100, "Number of phi slices"}

private

Definition at line 121 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_temp_z0_max

Gaudi::Property<float> FPGATrackSimMatrixGenAlgo::m_temp_z0_max {this, "par_z0_max", 200, "Max z0"}

private

Definition at line 117 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_temp_z0_min

Gaudi::Property<float> FPGATrackSimMatrixGenAlgo::m_temp_z0_min {this, "par_z0_min", -200, "Min z0"}

private

Definition at line 116 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_temp_z0_slices

Gaudi::Property<int> FPGATrackSimMatrixGenAlgo::m_temp_z0_slices {this, "par_z0_slices", 100, "Number of z0 slices"}

private

Definition at line 123 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_tHistSvc

ServiceHandle<ITHistSvc> FPGATrackSimMatrixGenAlgo::m_tHistSvc {this,"THistSvc","THistSvc"}

private

Definition at line 77 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_trackExtensionTool

ToolHandle<IFPGATrackSimTrackExtensionTool> FPGATrackSimMatrixGenAlgo::m_trackExtensionTool {this, "TrackExtensionTool", "FPGATrackSimTrackExtensionTool", "Track extensoin tool"}

private

Definition at line 87 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_trackFitterTool_1st

ToolHandle<FPGATrackSimTrackFitterTool> FPGATrackSimMatrixGenAlgo::m_trackFitterTool_1st {this, "TrackFitter_1st", "FPGATrackSimTrackFitterTool/FPGATrackSimTrackFitterTool_1st", "1st stage track fit tool"}

private

Definition at line 85 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_TRAIN_PDG

Gaudi::Property<int> FPGATrackSimMatrixGenAlgo::m_TRAIN_PDG {this, "TRAIN_PDG", 0, "PDG of particles to train on"}

private

Definition at line 109 of file FPGATrackSimMatrixGenAlgo.h.

◆ m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< Algorithm > >::m_varHandleArraysDeclared

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

◆ m_vhka

std::vector<SG::VarHandleKeyArray*> AthCommonDataStore< AthCommonMsg< Algorithm > >::m_vhka

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

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

Public Member Functions

Protected Member Functions

Private Types

Private Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ StoreGateSvc_t

Member Enumeration Documentation

◆ selectHit_returnCode

Constructor & Destructor Documentation

◆ FPGATrackSimMatrixGenAlgo()

◆ ~FPGATrackSimMatrixGenAlgo()

Member Function Documentation

◆ bookHistograms()

◆ createMatrixTrees()

◆ declareGaudiProperty() [1/4]

◆ declareGaudiProperty() [2/4]

◆ declareGaudiProperty() [3/4]

◆ declareGaudiProperty() [4/4]

◆ declareProperty() [1/6]

◆ declareProperty() [2/6]

◆ declareProperty() [3/6]

◆ declareProperty() [4/6]

◆ declareProperty() [5/6]

◆ declareProperty() [6/6]

◆ detStore()

◆ evtStore() [1/2]

◆ evtStore() [2/2]

◆ execute()

◆ extraDeps_update_handler()

◆ extraOutputDeps()

◆ fillAccumulatorByDropping()

◆ fillMatrixTrees()

◆ filterSectorHits()

◆ filterTrainingTracks()

◆ finalize()

◆ getLogicalHits()

◆ getRegion()

◆ initialize()

◆ inputHandles()

◆ makeAccumulator()

◆ makeBarcodeMap()

◆ msg() [1/2]

◆ msg() [2/2]

◆ msgLvl()

◆ outputHandles()

◆ renounce()

◆ renounceArray()

◆ selectHit()

◆ sysInitialize()

◆ sysStart()

◆ updateVHKA()

◆ writeSliceTree()

Member Data Documentation

◆ m_absQOverPtBinning

◆ m_clusteringTool

◆ m_D0_THRESHOLD

◆ m_detStore

◆ m_doClustering

◆ m_doDeltaPhiConsts

◆ m_doHoughConstants

◆ m_doSecondStage

◆ m_doSpacePoints

◆ m_dropHitsAndFill

◆ m_eventHeader

◆ m_EvtSel

◆ m_evtStore

◆ m_extendedExtraObjects

◆ m_FPGATrackSimMapping

◆ m_h_3hitsInLayer

◆ m_h_nHit

◆ m_h_notEnoughHits

◆ m_h_sectorPars

◆ m_h_SHfailure

◆ m_h_trackQoP_okHits

◆ m_h_trackQoP_okRegion

◆ m_h_trainingTrack

◆ m_hitInputTool

◆ m_hitMapTool