ATLAS Offline Software
Loading...
Searching...
No Matches
FPGATrackSimMatrixReductionAlgo Class Reference

#include <FPGATrackSimMatrixReductionAlgo.h>

Inheritance diagram for FPGATrackSimMatrixReductionAlgo:
Collaboration diagram for FPGATrackSimMatrixReductionAlgo:

Public Member Functions

 FPGATrackSimMatrixReductionAlgo (const std::string &name, ISvcLocator *pSvcLocator)
virtual ~FPGATrackSimMatrixReductionAlgo ()=default
StatusCode initialize () override
StatusCode finalize () override
StatusCode execute () override
virtual StatusCode sysInitialize () override
 Override sysInitialize.
virtual const DataObjIDColl & extraOutputDeps () const override
 Return the list of extra output dependencies.
ServiceHandle< StoreGateSvc > & evtStore ()
 The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.
const ServiceHandle< StoreGateSvc > & detStore () const
 The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.
virtual StatusCode sysStart () override
 Handle START transition.
virtual std::vector< Gaudi::DataHandle * > inputHandles () const override
 Return this algorithm's input handles.
virtual std::vector< Gaudi::DataHandle * > outputHandles () const override
 Return this algorithm's output handles.
Gaudi::Details::PropertyBase & declareProperty (Gaudi::Property< T, V, H > &t)
void updateVHKA (Gaudi::Details::PropertyBase &)
MsgStream & msg () const
bool msgLvl (const MSG::Level lvl) const

Protected Member Functions

void renounceArray (SG::VarHandleKeyArray &handlesArray)
 remove all handles from I/O resolution
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.

Private Types

typedef ServiceHandle< StoreGateSvcStoreGateSvc_t

Private Member Functions

StatusCode copySliceTree (TFile *file)
std::pair< std::vector< size_t >, std::vector< size_t > > matchStages ()
std::pair< std::vector< module_t >, FPGATrackSimMatrixAccumulatorreduce (std::vector< module_t > const &modules_2nd, FPGATrackSimMatrixAccumulator const &acc_2nd, std::vector< size_t > const &layers_1st_to_2nd, std::vector< size_t > const &coords_1st_to_2nd)
void extract_1stStage (TFile *file)
Gaudi::Details::PropertyBase & declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
 specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes

ServiceHandle< IFPGATrackSimMappingSvcm_FPGATrackSimMapping {this, "FPGATrackSimMappingSvc","FPGATrackSimMappingSvc"}
ServiceHandle< ITHistSvc > m_tHistSvc {this, "THistSvc","THistSvc"}
FPGATrackSimPlaneMap const * m_pmap_1st = nullptr
FPGATrackSimPlaneMap const * m_pmap_2nd = nullptr
Gaudi::Property< bool > m_allregion {this, "allregion", false,"Run all regions?"}
Gaudi::Property< std::string > m_filePath {this, "LayerChange_path", "default filepath"}
Gaudi::Property< int > m_region {this, "region", 0, "Region to run"}
Gaudi::Property< int > m_nRegions {this, "nbank", 96, "Number of regions and thus banks to create"}
int m_region_start = 0
int m_region_end = 0
std::vector< AccumulateMapm_sector_cum
DataObjIDColl m_extendedExtraObjects
StoreGateSvc_t m_evtStore
 Pointer to StoreGate (event store by default)
StoreGateSvc_t m_detStore
 Pointer to StoreGate (detector store by default)
std::vector< SG::VarHandleKeyArray * > m_vhka
bool m_varHandleArraysDeclared

Detailed Description

Definition at line 35 of file FPGATrackSimMatrixReductionAlgo.h.

Member Typedef Documentation

◆ StoreGateSvc_t

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

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

◆ FPGATrackSimMatrixReductionAlgo()

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

Definition at line 25 of file FPGATrackSimMatrixReductionAlgo.cxx.

25 :
26 AthAlgorithm(name, pSvcLocator)
27{
28}
AthAlgorithm()
Default constructor:

◆ ~FPGATrackSimMatrixReductionAlgo()

virtual FPGATrackSimMatrixReductionAlgo::~FPGATrackSimMatrixReductionAlgo ( )
virtualdefault

Member Function Documentation

◆ copySliceTree()

StatusCode FPGATrackSimMatrixReductionAlgo::copySliceTree ( TFile * file)
private

Definition at line 62 of file FPGATrackSimMatrixReductionAlgo.cxx.

63{
64 // Is there a better way to do this? Idk how the interface to tHistSvc works
65 FPGATrackSimTrackPars max;
66 FPGATrackSimTrackPars min;
67 FPGATrackSimTrackParsI nBins;
68
69 // Read old tree
70 TTree *old_tree = (TTree*)file->Get("slice");
71 old_tree->SetBranchAddress("c_max", &max.qOverPt);
72 old_tree->SetBranchAddress("c_min", &min.qOverPt);
73 old_tree->SetBranchAddress("c_slices", &nBins.qOverPt);
74
75 old_tree->SetBranchAddress("phi_max", &max.phi);
76 old_tree->SetBranchAddress("phi_min", &min.phi);
77 old_tree->SetBranchAddress("phi_slices", &nBins.phi);
78
79 old_tree->SetBranchAddress("d0_max", &max.d0);
80 old_tree->SetBranchAddress("d0_min", &min.d0);
81 old_tree->SetBranchAddress("d0_slices", &nBins.d0);
82
83 old_tree->SetBranchAddress("z0_max", &max.z0);
84 old_tree->SetBranchAddress("z0_min", &min.z0);
85 old_tree->SetBranchAddress("z0_slices", &nBins.z0);
86
87 old_tree->SetBranchAddress("eta_max", &max.eta);
88 old_tree->SetBranchAddress("eta_min", &min.eta);
89 old_tree->SetBranchAddress("eta_slices", &nBins.eta);
90
91 old_tree->GetEntry(0);
92
93 // Write new tree
94 TTree *new_tree = new TTree("slice", "Slice boundaries");
95 ATH_CHECK(m_tHistSvc->regTree("/TRIGFPGATrackSimMATRIX1STSTAGEOUT/slice", new_tree));
96
97 new_tree->Branch("c_max", &max.qOverPt);
98 new_tree->Branch("c_min", &min.qOverPt);
99 new_tree->Branch("c_slices", &nBins.qOverPt);
100
101 new_tree->Branch("phi_max", &max.phi);
102 new_tree->Branch("phi_min", &min.phi);
103 new_tree->Branch("phi_slices", &nBins.phi);
104
105 new_tree->Branch("d0_max", &max.d0);
106 new_tree->Branch("d0_min", &min.d0);
107 new_tree->Branch("d0_slices", &nBins.d0);
108
109 new_tree->Branch("z0_max", &max.z0);
110 new_tree->Branch("z0_min", &min.z0);
111 new_tree->Branch("z0_slices", &nBins.z0);
112
113 new_tree->Branch("eta_max", &max.eta);
114 new_tree->Branch("eta_min", &min.eta);
115 new_tree->Branch("eta_slices", &nBins.eta);
116
117 new_tree->Fill();
118
119 return StatusCode::SUCCESS;
120}
#define ATH_CHECK
Evaluate an expression and check for errors.
#define min(a, b)
Definition cfImp.cxx:40
#define max(a, b)
Definition cfImp.cxx:41
TFile * file

◆ declareGaudiProperty()

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.

158 {
160 hndl.value(),
161 hndl.documentation());
162
163 }
Gaudi::Details::PropertyBase & declareProperty(Gaudi::Property< T, V, H > &t)

◆ declareProperty()

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

Definition at line 145 of file AthCommonDataStore.h.

145 {
146 typedef typename SG::HandleClassifier<T>::type htype;
148 }
Gaudi::Details::PropertyBase & declareGaudiProperty(Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
specialization for handling Gaudi::Property<SG::VarHandleKey>

◆ 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.

◆ evtStore()

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.

◆ execute()

StatusCode FPGATrackSimMatrixReductionAlgo::execute ( )
override

Definition at line 250 of file FPGATrackSimMatrixReductionAlgo.cxx.

251{
252 // Do nothing; this class does not process events. The main algorithm is
253 // called in initialize() and finalize().
254 return StatusCode::SUCCESS;
255}

◆ extract_1stStage()

void FPGATrackSimMatrixReductionAlgo::extract_1stStage ( TFile * file)
private

Definition at line 229 of file FPGATrackSimMatrixReductionAlgo.cxx.

230{
231 auto matched_layers_coords = matchStages();
232 // Read 2nd stage info from file
233 TTree *tree_2nd = (TTree*)file->Get(Form("am0"));
234 FPGATrackSimMatrixReader reader(tree_2nd, m_pmap_2nd->getNLogiLayers(), m_pmap_2nd->getNCoords());
235
236 // Create 1st stage matrix and modules, and accumulate into m_sector_cum
237 while (reader.nextEntry())
238 {
239 auto sector_acc = reduce(reader.getModules(), reader.getAccumulator(), matched_layers_coords.first, matched_layers_coords.second);
240 ::accumulate(m_sector_cum[0], sector_acc.first, sector_acc.second);
241 }
242}
bool accumulate(AccumulateMap &map, std::vector< module_t > const &modules, FPGATrackSimMatrixAccumulator const &acc)
Accumulates an accumulator (e.g.
std::pair< std::vector< module_t >, FPGATrackSimMatrixAccumulator > reduce(std::vector< module_t > const &modules_2nd, FPGATrackSimMatrixAccumulator const &acc_2nd, std::vector< size_t > const &layers_1st_to_2nd, std::vector< size_t > const &coords_1st_to_2nd)
std::pair< std::vector< size_t >, std::vector< size_t > > matchStages()
reader
read the goodrunslist xml file(s)
Definition collisions.py:22

◆ 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.

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

◆ finalize()

StatusCode FPGATrackSimMatrixReductionAlgo::finalize ( )
override

Definition at line 261 of file FPGATrackSimMatrixReductionAlgo.cxx.

262{
263 {
264 // Create the tree
265 std::stringstream name;
266 std::stringstream title;
267 name << "am0";
268 title << "Ambank 0" << " parameters";
269 TTree* tree = new TTree(name.str().c_str(), title.str().c_str());
270 ATH_CHECK(m_tHistSvc->regTree(Form("/TRIGFPGATrackSimMATRIX1STSTAGEOUT/%s",tree->GetName()), tree));
271
272 // Fill the tree
273 ::fillTree(m_sector_cum[0], tree, m_pmap_1st->getNLogiLayers(), m_pmap_1st->getNCoords());
274 }
275
276 ATH_CHECK(m_tHistSvc->finalize());
277 return StatusCode::SUCCESS;
278}
void fillTree(AccumulateMap &map, TTree *tree, int nLayers, int nCoords)
Writes the contents of an AccumulateMap into the supplied tree (one entry per sector).
TChain * tree

◆ initialize()

StatusCode FPGATrackSimMatrixReductionAlgo::initialize ( )
override

Definition at line 30 of file FPGATrackSimMatrixReductionAlgo.cxx.

31{
33 ATH_CHECK(m_tHistSvc.retrieve());
34
35 m_pmap_1st = m_FPGATrackSimMapping->PlaneMap_1st(0);
36 m_pmap_2nd = m_FPGATrackSimMapping->PlaneMap_2nd(0);
37
38 // Setup the boundaries for the merge
39 if (m_allregion)
40 {
43 }
44 else
45 {
48 }
50
51 ATH_MSG_INFO("Reading " << m_filePath);
52 TFile *file = TFile::Open(m_filePath.value().c_str(), "");
54
55 // Main execution function
57
58 return StatusCode::SUCCESS;
59}
#define ATH_MSG_INFO(x)
ServiceHandle< IFPGATrackSimMappingSvc > m_FPGATrackSimMapping

◆ 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.

◆ matchStages()

std::pair< std::vector< size_t >, std::vector< size_t > > FPGATrackSimMatrixReductionAlgo::matchStages ( )
private

ultimately we may want a function to get inversion for each specific layer, aka getInversion(ls_2nd.layer), so this is a placeholder;

Definition at line 136 of file FPGATrackSimMatrixReductionAlgo.cxx.

137{
138 size_t iCoord_1st = 0;
139
140 std::vector<size_t> layers_1st_to_2nd(m_pmap_1st->getNLogiLayers());
141 std::vector<size_t> coords_1st_to_2nd(m_pmap_1st->getNCoords());
142
143 for (unsigned layer_1st = 0; layer_1st < m_pmap_1st->getNLogiLayers(); layer_1st++)
144 {
145 LayerInfo const & info_1st = m_pmap_1st->getLayerInfo(layer_1st, 0);
146 // all sections in stage 1 should also be in stage 2, so can just use 0 to retrieve info
147 LayerSection const & ls_2nd = m_pmap_2nd->getLayerSection(info_1st);
148
149 int inversion(0);
150 layers_1st_to_2nd[layer_1st] = ls_2nd.layer + inversion;
151 for (size_t iDim = 0; iDim < m_pmap_1st->getDim(layer_1st); iDim++)
152 {
153 coords_1st_to_2nd[iCoord_1st] = m_pmap_2nd->getCoordOffset(ls_2nd.layer) + iDim + inversion;
154 iCoord_1st++;
155 }
156 }
157
158 assert(iCoord_1st == m_pmap_1st->getNCoords());
159 return { layers_1st_to_2nd, coords_1st_to_2nd };
160}

◆ msg()

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

Definition at line 24 of file AthCommonMsg.h.

24 {
25 return this->msgStream();
26 }

◆ msgLvl()

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

Definition at line 30 of file AthCommonMsg.h.

30 {
31 return this->msgLevel(lvl);
32 }

◆ 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.

◆ reduce()

std::pair< std::vector< module_t >, FPGATrackSimMatrixAccumulator > FPGATrackSimMatrixReductionAlgo::reduce ( std::vector< module_t > const & modules_2nd,
FPGATrackSimMatrixAccumulator const & acc_2nd,
std::vector< size_t > const & layers_1st_to_2nd,
std::vector< size_t > const & coords_1st_to_2nd )
private

Definition at line 181 of file FPGATrackSimMatrixReductionAlgo.cxx.

184{
185 std::vector<module_t> modules_1st(m_pmap_1st->getNLogiLayers()); // First stage sector definition (to be filled)
186 FPGATrackSimMatrixAccumulator acc_1st(m_pmap_1st->getNLogiLayers(), m_pmap_1st->getNCoords()); // First stage accumulator (to be filled)
187
188 acc_1st.pars = acc_2nd.pars;
189 acc_1st.track_bins = acc_2nd.track_bins;
190
191 // For each first stage layer, copy relavant info from matching second stage layer
192 for (size_t layer_1st = 0; layer_1st < m_pmap_1st->getNLogiLayers(); layer_1st++)
193 {
194 size_t layer_2nd = layers_1st_to_2nd[layer_1st];
195 modules_1st[layer_1st] = modules_2nd[layer_2nd];
196 acc_1st.FTK_modules[layer_1st] = acc_2nd.FTK_modules[layer_2nd];
197 }
198
199 // Copy coordinates from matching second stage coordinate
200 for (size_t iCoord_1st = 0; iCoord_1st < m_pmap_1st->getNCoords(); iCoord_1st++)
201 {
202 size_t iCoord_2nd = coords_1st_to_2nd[iCoord_1st];
203
204 acc_1st.hit_coords[iCoord_1st] = acc_2nd.hit_coords[iCoord_2nd];
205 acc_1st.hit_x_QoP [iCoord_1st] = acc_2nd.hit_x_QoP [iCoord_2nd];
206 acc_1st.hit_x_d0 [iCoord_1st] = acc_2nd.hit_x_d0 [iCoord_2nd];
207 acc_1st.hit_x_z0 [iCoord_1st] = acc_2nd.hit_x_z0 [iCoord_2nd];
208 acc_1st.hit_x_eta [iCoord_1st] = acc_2nd.hit_x_eta [iCoord_2nd];
209 acc_1st.hit_x_phi [iCoord_1st] = acc_2nd.hit_x_phi [iCoord_2nd];
210
211 // Covariance calculation. This requires a second loop through layers/coordinates,
212 // so postfix those variables with _j, as in (i,j). Only need triangular matrix
213 // so start loop at iCoord_1st.
214 for (size_t iCoord_1st_j = iCoord_1st; iCoord_1st_j < m_pmap_1st->getNCoords(); iCoord_1st_j++)
215 {
216 size_t iCoord_2nd_j = coords_1st_to_2nd[iCoord_1st_j];
217 acc_1st.covariance[iCoord_1st * m_pmap_1st->getNCoords() + iCoord_1st_j] =
218 acc_2nd.covariance[iCoord_2nd * m_pmap_2nd->getNCoords() + iCoord_2nd_j];
219 }
220 }
221
222 return { modules_1st, acc_1st };
223}

◆ 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.

381 {
382 h.renounce();
384 }
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)

◆ 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.

364 {
366 }

◆ 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, AthHistogramAlgorithm, and PyAthena::Alg.

Definition at line 66 of file AthAlgorithm.cxx.

66 {
68
69 if (sc.isFailure()) {
70 return sc;
71 }
72 ServiceHandle<ICondSvc> cs("CondSvc",name());
73 for (auto h : outputHandles()) {
74 if (h->isCondition() && h->mode() == Gaudi::DataHandle::Writer) {
75 // do this inside the loop so we don't create the CondSvc until needed
76 if ( cs.retrieve().isFailure() ) {
77 ATH_MSG_WARNING("no CondSvc found: won't autoreg WriteCondHandles");
78 return StatusCode::SUCCESS;
79 }
80 if (cs->regHandle(this,*h).isFailure()) {
81 sc = StatusCode::FAILURE;
82 ATH_MSG_ERROR("unable to register WriteCondHandle " << h->fullKey()
83 << " with CondSvc");
84 }
85 }
86 }
87 return sc;
88}
#define ATH_MSG_ERROR(x)
#define ATH_MSG_WARNING(x)
static Double_t sc
virtual StatusCode sysInitialize() override
Override sysInitialize.
AthCommonDataStore(const std::string &name, T... args)
virtual std::vector< Gaudi::DataHandle * > outputHandles() const override
::StatusCode StatusCode
StatusCode definition for legacy code.

◆ 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.

308 {
309 // debug() << "updateVHKA for property " << p.name() << " " << p.toString()
310 // << " size: " << m_vhka.size() << endmsg;
311 for (auto &a : m_vhka) {
313 for (auto k : keys) {
314 k->setOwner(this);
315 }
316 }
317 }
std::vector< SG::VarHandleKeyArray * > m_vhka

Member Data Documentation

◆ m_allregion

Gaudi::Property<bool> FPGATrackSimMatrixReductionAlgo::m_allregion {this, "allregion", false,"Run all regions?"}
private

Definition at line 58 of file FPGATrackSimMatrixReductionAlgo.h.

58{this, "allregion", false,"Run all regions?"};

◆ 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_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_filePath

Gaudi::Property<std::string> FPGATrackSimMatrixReductionAlgo::m_filePath {this, "LayerChange_path", "default filepath"}
private

Definition at line 59 of file FPGATrackSimMatrixReductionAlgo.h.

59{this, "LayerChange_path", "default filepath"};

◆ m_FPGATrackSimMapping

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

Definition at line 51 of file FPGATrackSimMatrixReductionAlgo.h.

51{this, "FPGATrackSimMappingSvc","FPGATrackSimMappingSvc"};

◆ m_nRegions

Gaudi::Property<int> FPGATrackSimMatrixReductionAlgo::m_nRegions {this, "nbank", 96, "Number of regions and thus banks to create"}
private

Definition at line 61 of file FPGATrackSimMatrixReductionAlgo.h.

61{this, "nbank", 96, "Number of regions and thus banks to create"};

◆ m_pmap_1st

FPGATrackSimPlaneMap const* FPGATrackSimMatrixReductionAlgo::m_pmap_1st = nullptr
private

Definition at line 53 of file FPGATrackSimMatrixReductionAlgo.h.

◆ m_pmap_2nd

FPGATrackSimPlaneMap const* FPGATrackSimMatrixReductionAlgo::m_pmap_2nd = nullptr
private

Definition at line 54 of file FPGATrackSimMatrixReductionAlgo.h.

◆ m_region

Gaudi::Property<int> FPGATrackSimMatrixReductionAlgo::m_region {this, "region", 0, "Region to run"}
private

Definition at line 60 of file FPGATrackSimMatrixReductionAlgo.h.

60{this, "region", 0, "Region to run"};

◆ m_region_end

int FPGATrackSimMatrixReductionAlgo::m_region_end = 0
private

Definition at line 64 of file FPGATrackSimMatrixReductionAlgo.h.

◆ m_region_start

int FPGATrackSimMatrixReductionAlgo::m_region_start = 0
private

Definition at line 63 of file FPGATrackSimMatrixReductionAlgo.h.

◆ m_sector_cum

std::vector<AccumulateMap> FPGATrackSimMatrixReductionAlgo::m_sector_cum
private

Definition at line 69 of file FPGATrackSimMatrixReductionAlgo.h.

◆ m_tHistSvc

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

Definition at line 52 of file FPGATrackSimMatrixReductionAlgo.h.

52{this, "THistSvc","THistSvc"};

◆ 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: