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

Conditions algorithm to unpack raw luminosity data from COOL. More...

#include <BunchLumisCondAlg.h>

Inheritance diagram for BunchLumisCondAlg:
Collaboration diagram for BunchLumisCondAlg:

Public Member Functions

virtual StatusCode initialize () override
 Gaudi initialize method.
virtual StatusCode execute (const EventContext &ctx) const override
 Algorithm execute method.
virtual bool isReEntrant () const override
 Avoid scheduling algorithm multiple times.
virtual StatusCode sysInitialize () override
 Override sysInitialize.
virtual bool isClonable () const override
 Specify if the algorithm is clonable.
virtual unsigned int cardinality () const override
 Cardinality (Maximum number of clones that can exist) special value 0 means that algorithm is reentrant.
virtual StatusCode sysExecute (const EventContext &ctx) override
 Execute an algorithm.
virtual const DataObjIDColl & extraOutputDeps () const override
 Return the list of extra output dependencies.
virtual bool filterPassed (const EventContext &ctx) const
virtual void setFilterPassed (bool state, const EventContext &ctx) const
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 unpackLumis (const coral::Blob &blob, const std::vector< unsigned int > &luminousBunches, float avgRawLumi, std::vector< float > &rawLumiOut) const
 Unpack raw luminosity data for one channel.
Gaudi::Details::PropertyBase & declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
 specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes

SG::ReadCondHandleKey< CondAttrListCollectionm_bunchLumisFolderInputKey { this, "BunchLumisFolderInputKey", "", "" }
 Input conditions object.
SG::ReadCondHandleKey< FillParamsCondDatam_fillParamsInputKey { this, "FillParamsInputKey", "", "" }
 Fill parameters needed for storage mode 0.
SG::WriteCondHandleKey< BunchLumisCondDatam_bunchLumisOutputKey {this, "BunchLumisOutputKey", "BunchLumisCondData", "" }
 Output conditions object.
DataObjIDColl m_extendedExtraObjects
 Extra output dependency collection, extended by AthAlgorithmDHUpdate to add symlinks.
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

Conditions algorithm to unpack raw luminosity data from COOL.

Definition at line 33 of file BunchLumisCondAlg.h.

Member Typedef Documentation

◆ StoreGateSvc_t

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

Definition at line 388 of file AthCommonDataStore.h.

Member Function Documentation

◆ cardinality()

unsigned int AthCommonReentrantAlgorithm< Gaudi::Algorithm >::cardinality ( ) const
overridevirtualinherited

Cardinality (Maximum number of clones that can exist) special value 0 means that algorithm is reentrant.

Override this to return 0 for reentrant algorithms.

Definition at line 75 of file AthCommonReentrantAlgorithm.cxx.

64{
65 return 0;
66}

◆ declareGaudiProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< Gaudi::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< Gaudi::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< Gaudi::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< Gaudi::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 BunchLumisCondAlg::execute ( const EventContext & ctx) const
overridevirtual

Algorithm execute method.

Parameters
ctxEvent Context.

Definition at line 208 of file BunchLumisCondAlg.cxx.

209{
210 auto lumis = std::make_unique<BunchLumisCondData>();
211
212 SG::ReadCondHandle<CondAttrListCollection> bunchLumisFolder
214 EventIDRange range;
215 ATH_CHECK( bunchLumisFolder.range (range) );
216
217 std::vector<unsigned int> luminousBunches;
218 if (!m_fillParamsInputKey.empty()) {
219 SG::ReadCondHandle<FillParamsCondData> fillParams
221 luminousBunches = fillParams->luminousBunches();
222 EventIDRange fpRange;
223 ATH_CHECK( fillParams.range (fpRange) );
224 range = EventIDRange::intersect (range, fpRange);
225 }
226
227 for (const auto& p : *bunchLumisFolder.retrieve()) {
228 unsigned int channel = p.first;
229 const coral::AttributeList& attrList = p.second;
230
231 if (attrList["BunchRawInstLum"].isNull()) {
232 ATH_MSG_ERROR( "BunchRawInstLum blob not found for channel " << channel << "!" );
233 return StatusCode::FAILURE;
234 }
235
236 const coral::Blob& blob = attrList["BunchRawInstLum"].data<coral::Blob>();
237 if (blob.size() == 0) {
238 ATH_MSG_DEBUG( "BunchRawInstLumi blob found with zero size for channel " << channel << "!" );
239 continue;
240 }
241
242 // Make sure the scale factor exists (needed below to unpack integer blob schemes)
243 if (attrList["AverageRawInstLum"].isNull()) {
244 ATH_MSG_ERROR( "AverageRawInstLum value not found for channel " << channel << "!" );
245 return StatusCode::FAILURE;
246 }
247 float avgRawLumi = attrList["AverageRawInstLum"].data<cool::Float>();
248
249 std::vector<float> rawLumis;
250 ATH_CHECK( unpackLumis (blob, luminousBunches, avgRawLumi, rawLumis) );
251 lumis->addChannel (channel, std::move (rawLumis));
252 }
253
254 SG::WriteCondHandle<BunchLumisCondData> bunchLumisData
256 ATH_CHECK( bunchLumisData.record (range, std::move (lumis)) );
257 return StatusCode::SUCCESS;
258}
#define ATH_CHECK
Evaluate an expression and check for errors.
#define ATH_MSG_ERROR(x)
#define ATH_MSG_DEBUG(x)
SG::ReadCondHandleKey< FillParamsCondData > m_fillParamsInputKey
Fill parameters needed for storage mode 0.
SG::WriteCondHandleKey< BunchLumisCondData > m_bunchLumisOutputKey
Output conditions object.
SG::ReadCondHandleKey< CondAttrListCollection > m_bunchLumisFolderInputKey
Input conditions object.
StatusCode unpackLumis(const coral::Blob &blob, const std::vector< unsigned int > &luminousBunches, float avgRawLumi, std::vector< float > &rawLumiOut) const
Unpack raw luminosity data for one channel.

◆ extraDeps_update_handler()

void AthCommonDataStore< AthCommonMsg< Gaudi::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 & AthCommonReentrantAlgorithm< Gaudi::Algorithm >::extraOutputDeps ( ) const
overridevirtualinherited

Return the list of extra output dependencies.

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

Definition at line 94 of file AthCommonReentrantAlgorithm.cxx.

90{
91 // If we didn't find any symlinks to add, just return the collection
92 // from the base class. Otherwise, return the extended collection.
93 if (!m_extendedExtraObjects.empty()) {
95 }
97}
An algorithm that can be simultaneously executed in multiple threads.

◆ filterPassed()

virtual bool AthCommonReentrantAlgorithm< Gaudi::Algorithm >::filterPassed ( const EventContext & ctx) const
inlinevirtualinherited

Definition at line 96 of file AthCommonReentrantAlgorithm.h.

96 {
97 return execState( ctx ).filterPassed();
98 }
virtual bool filterPassed(const EventContext &ctx) const

◆ initialize()

StatusCode BunchLumisCondAlg::initialize ( )
overridevirtual

Gaudi initialize method.

Definition at line 41 of file BunchLumisCondAlg.cxx.

42{
45 ATH_CHECK( m_bunchLumisOutputKey.initialize() );
46 return StatusCode::SUCCESS;
47}

◆ inputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< Gaudi::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.

◆ isClonable()

◆ isReEntrant()

virtual bool AthCondAlgorithm::isReEntrant ( ) const
inlineoverridevirtualinherited

Avoid scheduling algorithm multiple times.

With multiple concurrent events, conditions objects often expire simultaneously for all slots. To avoid that the scheduler runs the CondAlg in each slot, we declare it as "non-reentrant". This ensures that the conditions objects are only created once.

In case a particular CondAlg should behave differently, it can override this method again and return true.

See also
ATEAM-836

Definition at line 39 of file AthCondAlgorithm.h.

39{ return false; }

◆ msg()

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

Definition at line 24 of file AthCommonMsg.h.

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

◆ msgLvl()

bool AthCommonMsg< Gaudi::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< Gaudi::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< Gaudi::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< Gaudi::Algorithm > >::renounceArray ( SG::VarHandleKeyArray & handlesArray)
inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

364 {
366 }

◆ setFilterPassed()

virtual void AthCommonReentrantAlgorithm< Gaudi::Algorithm >::setFilterPassed ( bool state,
const EventContext & ctx ) const
inlinevirtualinherited

Definition at line 100 of file AthCommonReentrantAlgorithm.h.

100 {
102 }
virtual void setFilterPassed(bool state, const EventContext &ctx) const

◆ sysExecute()

StatusCode AthCommonReentrantAlgorithm< Gaudi::Algorithm >::sysExecute ( const EventContext & ctx)
overridevirtualinherited

Execute an algorithm.

We override this in order to work around an issue with the Algorithm base class storing the event context in a member variable that can cause crashes in MT jobs.

Definition at line 85 of file AthCommonReentrantAlgorithm.cxx.

77{
78 return BaseAlg::sysExecute (ctx);
79}

◆ sysInitialize()

StatusCode AthCommonReentrantAlgorithm< Gaudi::Algorithm >::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< Gaudi::Algorithm > >.

Reimplemented in HypoBase, and InputMakerBase.

Definition at line 61 of file AthCommonReentrantAlgorithm.cxx.

107 {
109
110 if (sc.isFailure()) {
111 return sc;
112 }
113
114 ServiceHandle<ICondSvc> cs("CondSvc",name());
115 for (auto h : outputHandles()) {
116 if (h->isCondition() && h->mode() == Gaudi::DataHandle::Writer) {
117 // do this inside the loop so we don't create the CondSvc until needed
118 if ( cs.retrieve().isFailure() ) {
119 ATH_MSG_WARNING("no CondSvc found: won't autoreg WriteCondHandles");
120 return StatusCode::SUCCESS;
121 }
122 if (cs->regHandle(this,*h).isFailure()) {
124 ATH_MSG_ERROR("unable to register WriteCondHandle " << h->fullKey()
125 << " with CondSvc");
126 }
127 }
128 }
129 return sc;
130}
#define ATH_MSG_WARNING(x)
virtual std::vector< Gaudi::DataHandle * > outputHandles() const override

◆ sysStart()

virtual StatusCode AthCommonDataStore< AthCommonMsg< Gaudi::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.

◆ unpackLumis()

StatusCode BunchLumisCondAlg::unpackLumis ( const coral::Blob & blob,
const std::vector< unsigned int > & luminousBunches,
float avgRawLumi,
std::vector< float > & rawLumiOut ) const
private

Unpack raw luminosity data for one channel.

Parameters
blobPacked data to unpack.
luminousBunchesBCIDs of occupied bunches, or an empty vector if not available.
avgRawLumiAverage raw luminosity, from the conditions object.
rawLumiOut[out]Unpacked per-BCID raw luminosities.

Definition at line 59 of file BunchLumisCondAlg.cxx.

63{
64 // Figure out Mika's blob packing mode (should really have a utility for this)
65 // See description: https://twiki.cern.ch/twiki/bin/viewauth/Atlas/CoolOnlineData#Folder_TDAQ_OLC_BUNCHLUMIS
66
67 const uint8_t* ATH_RESTRICT pchar = static_cast<const uint8_t*>(blob.startingAddress()); // First byte holds storage size and mode
68 unsigned int bss = ((*pchar) % 100) / 10; // Byte storage size
69 unsigned int smod = ((*pchar) % 10); // Storage mode
70
71 ATH_MSG_DEBUG( "BunchRawInstLumi blob found with storage mode " << smod << " and byte storage size " << bss );
72
73 // Check blob length and point pchar to start of raw lumi data
74 unsigned int bloblength = 0;
75 unsigned int nbcids = 0;
76
77 ++pchar;
78 const uint8_t* ATH_RESTRICT pbcids = nullptr;
79
80 // Treat different storage modes independently
81 switch (smod) {
82 case 0:
83 // Packed according to luminousBunches
84 // Make sure tool is configured
85 if (luminousBunches.empty()) {
86 ATH_MSG_ERROR("Can't unpack using luminousBunches!");
87 return StatusCode::SUCCESS;
88 }
89
90 nbcids = luminousBunches.size();
91 bloblength = bss * nbcids + 1;
92 break;
93
94 case 1:
95 // Full orbit stored
96 nbcids = TOTAL_LHC_BCIDS;
97 bloblength = bss * nbcids + 1;
98 break;
99
100 case 2:
101 // Self describing length, with 2-byte length followed by 2-byte BCID vector, then data
102 nbcids = CxxUtils::get_unaligned16 (pchar);
103 pbcids = pchar;
104 bloblength = (2+bss)*nbcids + 3; // 2-bytes for vector plus bss plus 2 bytes for vector length, plus one byte for packing
105 pchar += 2*nbcids; // Advance pchar past bicd vector list to raw data
106 // ATH_MSG_DEBUG( "Found mode 2 with " << nbcids << " BCIDs" );
107 break;
108
109 default:
110 ATH_MSG_ERROR( "BunchRawInstLumi blob found with unknown storage mode " << smod << "!" );
111 return StatusCode::FAILURE;
112 }
113
114 // Check blob size against needed length. Give up if these don't match
115 if (static_cast<cool::UInt32>(blob.size()) != bloblength) {
116 ATH_MSG_ERROR( "BunchRawInstLumi blob found with length " << blob.size() <<
117 " in storage mode " << smod << " with size " << bss <<
118 ", expecting " << bloblength << "!" );
119 return StatusCode::FAILURE;
120 }
121
122 // Length is correct, read raw data according to packing scheme
123 // Some schemes are relative and must be renormalized, while the float/double schemes are absolute values - *pay attention!*
124 std::vector<float> rawLumi;
125 rawLumi.clear();
126 rawLumi.reserve (nbcids);
127
128 // Different depending upon bytes allocated (this is ugly, but it works)
129 // pchar is pointing to the start of the data (past first byte of blob)
130 switch (bss) {
131
132 case 1: { // 1-byte integers, just use pchar
133 float scale = avgRawLumi / 100;
134 for (unsigned int i=0; i<nbcids; i++) {
135 float val = (*pchar++) * scale;
136 rawLumi.push_back(val);
137 }
138 break;
139 }
140
141 case 2: { // 2-byte integers
142 float scale = avgRawLumi / (100*100);
143 for (unsigned int i=0; i<nbcids; i++) {
144 float val = CxxUtils::get_unaligned16(pchar) * scale;
145 rawLumi.push_back(val);
146 }
147 break;
148 }
149
150 case 4: // 4-byte floats
151 for (unsigned int i=0; i<nbcids; i++) {
152 rawLumi.push_back (CxxUtils::get_unaligned_float(pchar));
153 }
154 break;
155
156 case 8: // 8-byte doubles
157 for (unsigned int i=0; i<nbcids; i++) {
158 rawLumi.push_back (CxxUtils::get_unaligned_double(pchar));
159 }
160 break;
161
162 default:
163 ATH_MSG_ERROR( "BunchRawInstLumi blob found with unknown byte storage size " << bss << "!" );
164 return StatusCode::FAILURE;
165 }
166
167 // Now figure which BCIDs these values belong to and fill into vector indexed by BCID
168
169 rawLumiOut.clear();
170 // Remember, nbcids was set before and the blob size was checked
171 switch (smod) {
172 case 0:
173 // Packed according to luminous bunches, fill accordingly
174 // Checked before that FillParamsTool is configured, don't need to check again
175 rawLumiOut.resize (TOTAL_LHC_BCIDS, 0);
176 for (unsigned int i=0; i<nbcids; i++)
177 rawLumiOut[luminousBunches[i]] = rawLumi[i];
178 break;
179
180 case 1:
181 // Packed according to full turn, just copy
182 rawLumiOut = std::move (rawLumi);
183 break;
184
185 case 2:
186 // Packed according to private list, must read here. pbcids points to start of this data
187 rawLumiOut.resize (TOTAL_LHC_BCIDS, 0);
188 for (unsigned int i=0; i<nbcids; i++) {
189 rawLumiOut[CxxUtils::get_unaligned16(pbcids)] = rawLumi[i];
190 // ATH_MSG_DEBUG( "BCID: " << *p16 << " Lumi= " << rawLumi[i] );
191 }
192 break;
193
194 // This error condition was dealt with before
195 //default:
196 }
197
198 return StatusCode::SUCCESS;
199}
double get_unaligned_double(const uint8_t *ATH_RESTRICT &p)
Read a little-endian double value from a possibly unaligned pointer.
uint16_t get_unaligned16(const uint8_t *ATH_RESTRICT &p)
Read a 2-byte little-endian value from a possibly unaligned pointer.
float get_unaligned_float(const uint8_t *ATH_RESTRICT &p)
Read a little-endian float value from a possibly unaligned pointer.
#define ATH_RESTRICT
Definition restrict.h:31

◆ updateVHKA()

void AthCommonDataStore< AthCommonMsg< Gaudi::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 }

Member Data Documentation

◆ m_bunchLumisFolderInputKey

SG::ReadCondHandleKey<CondAttrListCollection> BunchLumisCondAlg::m_bunchLumisFolderInputKey { this, "BunchLumisFolderInputKey", "", "" }
private

Input conditions object.

Definition at line 63 of file BunchLumisCondAlg.h.

64{ this, "BunchLumisFolderInputKey", "", "" };

◆ m_bunchLumisOutputKey

SG::WriteCondHandleKey<BunchLumisCondData> BunchLumisCondAlg::m_bunchLumisOutputKey {this, "BunchLumisOutputKey", "BunchLumisCondData", "" }
private

Output conditions object.

Definition at line 71 of file BunchLumisCondAlg.h.

72{this, "BunchLumisOutputKey", "BunchLumisCondData", "" };

◆ m_detStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Gaudi::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< Gaudi::Algorithm > >::m_evtStore
privateinherited

Pointer to StoreGate (event store by default)

Definition at line 390 of file AthCommonDataStore.h.

◆ m_extendedExtraObjects

DataObjIDColl AthCommonReentrantAlgorithm< Gaudi::Algorithm >::m_extendedExtraObjects
privateinherited

Extra output dependency collection, extended by AthAlgorithmDHUpdate to add symlinks.

Empty if no symlinks were found.

Definition at line 114 of file AthCommonReentrantAlgorithm.h.

◆ m_fillParamsInputKey

SG::ReadCondHandleKey<FillParamsCondData> BunchLumisCondAlg::m_fillParamsInputKey { this, "FillParamsInputKey", "", "" }
private

Fill parameters needed for storage mode 0.

Definition at line 67 of file BunchLumisCondAlg.h.

68{ this, "FillParamsInputKey", "", "" };

◆ m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_varHandleArraysDeclared
privateinherited

Definition at line 399 of file AthCommonDataStore.h.

◆ m_vhka

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

Definition at line 398 of file AthCommonDataStore.h.


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