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

#include <LArRawChannelBuilderAlg.h>

Inheritance diagram for LArRawChannelBuilderAlg:

Public Member Functions

StatusCode initialize () override
StatusCode execute (const EventContext &ctx) const override
StatusCode finalize () override
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

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

Private Attributes

SG::ReadHandleKey< LArDigitContainerm_digitKey
SG::WriteHandleKey< LArRawChannelContainerm_rawChannelKey
SG::ReadCondHandleKey< ILArPedestalm_pedestalKey {this,"PedestalKey","LArPedestal","SG Key of Pedestal conditions object"}
SG::ReadCondHandleKey< LArADC2MeVm_adc2MeVKey {this,"ADC2MeVKey","LArADC2MeV","SG Key of ADC2MeV conditions object"}
SG::ReadCondHandleKey< ILArOFCm_ofcKey {this,"OFCKey","LArOFC","SG Key of OFC conditions object"}
SG::ReadCondHandleKey< ILArShapem_shapeKey {this,"ShapeKey","LArShape","SG Key of Shape conditions object"}
SG::ReadCondHandleKey< LArOnOffIdMappingm_cablingKey {this,"CablingKey","LArOnOffIdMap","SG Key of LArOnOffIdMapping object"}
SG::ReadCondHandleKey< LArDSPThresholdsCompletem_run1DSPThresholdsKey {this, "Run1DSPThresholdsKey","", "SG Key for thresholds to compute time and quality, run 1"}
SG::ReadCondHandleKey< AthenaAttributeListm_run2DSPThresholdsKey {this, "Run2DSPThresholdsKey","", "SG Key for thresholds to compute time and quality, run 2"}
Gaudi::Property< float > m_eCutFortQ {this,"ECutFortQ",256.0,"Time and Quality will be computed only for channels with E above this value"}
Gaudi::Property< bool > m_absECutFortQ {this,"absECut",true,"Cut on fabs(E) for Q and t computation"}
Gaudi::Property< bool > m_useShapeDer {this,"useShapeDer",true,"Use shape derivative in Q-factor computation"}
Gaudi::Property< bool > m_useDBFortQ {this,"useDB",true,"Use DB for cut on t,Q"}
Gaudi::Property< int > m_firstSample {this,"firstSample",0,"first of the 32 sampels of the MC shape to be used"}
const LArOnlineIDm_onlineId = nullptr
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

Definition at line 28 of file LArRawChannelBuilderAlg.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 LArRawChannelBuilderAlg::execute ( const EventContext & ctx) const
override

Definition at line 49 of file LArRawChannelBuilderAlg.cxx.

49 {
50
51 //Get event inputs from read handles:
52 SG::ReadHandle<LArDigitContainer> inputContainer(m_digitKey,ctx);
53
54 //Write output via write handle
55 auto outputContainer = std::make_unique<LArRawChannelContainer>();
56
57 //Get Conditions input
58 SG::ReadCondHandle<ILArPedestal> pedHdl(m_pedestalKey,ctx);
59 const ILArPedestal* peds=*pedHdl;
60
61 SG::ReadCondHandle<LArADC2MeV> adc2mevHdl(m_adc2MeVKey,ctx);
62 const LArADC2MeV* adc2MeVs=*adc2mevHdl;
63
64 SG::ReadCondHandle<ILArOFC> ofcHdl(m_ofcKey,ctx);
65 const ILArOFC* ofcs=*ofcHdl;
66
67 SG::ReadCondHandle<ILArShape> shapeHdl(m_shapeKey,ctx);
68 const ILArShape* shapes=*shapeHdl;
69
70 SG::ReadCondHandle<LArOnOffIdMapping> cabling(m_cablingKey,ctx);
71
72 std::unique_ptr<LArDSPThresholdsFlat> run2DSPThresh;
73 const LArDSPThresholdsComplete* run1DSPThresh = nullptr;
74 if (m_useDBFortQ) {
75 if (!m_run2DSPThresholdsKey.empty()) {
76 SG::ReadCondHandle<AthenaAttributeList> dspThrshAttr (m_run2DSPThresholdsKey, ctx);
77 run2DSPThresh = std::make_unique<LArDSPThresholdsFlat>(*dspThrshAttr);
78 if (ATH_UNLIKELY(!run2DSPThresh->good())) {
79 ATH_MSG_ERROR( "Failed to initialize LArDSPThresholdFlat from attribute list loaded from " << m_run2DSPThresholdsKey.key()
80 << ". Aborting." );
81 return StatusCode::FAILURE;
82 }
83 }
84 else if (!m_run1DSPThresholdsKey.empty()) {
85 SG::ReadCondHandle<LArDSPThresholdsComplete> dspThresh (m_run1DSPThresholdsKey, ctx);
86 run1DSPThresh = dspThresh.cptr();
87 }
88 else {
89 ATH_MSG_ERROR( "No DSP threshold configured.");
90 return StatusCode::FAILURE;
91 }
92 }
93
94 //Loop over digits:
95 for (const LArDigit* digit : *inputContainer) {
96
97 size_t firstSample=m_firstSample;
98
99 const HWIdentifier id=digit->hardwareID();
100 const bool connected=(*cabling)->isOnlineConnected(id);
101
102
103 ATH_MSG_VERBOSE("Working on channel " << m_onlineId->channel_name(id));
104
105 const std::vector<short>& samples=digit->samples();
106 const int gain=digit->gain();
107 const float p=peds->pedestal(id,gain);
108
109
110
111 //The following autos will resolve either into vectors or vector-proxies
112 const auto& ofca=ofcs->OFC_a(id,gain);
113 const auto& adc2mev=adc2MeVs->ADC2MEV(id,gain);
114
115 const size_t nOFC=ofca.size();
116
117 //Sanity check on input conditions data:
118 // ensure that the size of the samples vector is compatible with ofc_a size when preceeding samples are saved
119 const size_t nSamples=samples.size()-firstSample;
120 if (nSamples<nOFC) {
121 ATH_MSG_ERROR("effective sample size: "<< nSamples << ", must be >= OFC_a size: " << ofca.size());
122 return StatusCode::FAILURE;
123 }
124
125
127 if (!connected) continue; //No conditions for disconencted channel, who cares?
128 ATH_MSG_ERROR("No valid pedestal for connected channel " << m_onlineId->channel_name(id)
129 << " gain " << gain);
130 return StatusCode::FAILURE;
131 }
132
133 if(ATH_UNLIKELY(adc2mev.size()<2)) {
134 if (!connected) continue; //No conditions for disconencted channel, who cares?
135 ATH_MSG_ERROR("No valid ADC2MeV for connected channel " << m_onlineId->channel_name(id)
136 << " gain " << gain);
137 return StatusCode::FAILURE;
138 }
139
140
141 //Apply OFCs to get amplitude
142 // Evaluate sums in double-precision to get consistent results
143 // across platforms.
144 double A=0;
145 bool saturated=false;
146
147 // Check saturation AND discount pedestal
148 std::vector<float> samp_no_ped(nOFC,0.0);
149 for (size_t i=0;i<nOFC;++i) {
150 if (samples[i+firstSample]==4096 || samples[i+firstSample]==0) saturated=true;
151 samp_no_ped[i]=samples[i+firstSample]-p;
152 }
153 for (size_t i=0;i<nOFC;++i) {
154 A+=static_cast<double>(samp_no_ped[i])*ofca[i];
155 }
156
157 //Apply Ramp
158 const float E=adc2mev[0]+A*adc2mev[1];
159
160 uint16_t iquaShort=0;
161 float tau=0;
162
163
164 uint16_t prov=LArProv::DEFAULTRECO; //Means all constants from DB + OFC
165 if (saturated) prov|=LArProv::SATURATED;
166
167 const float E1=m_absECutFortQ.value() ? std::fabs(E) : E;
168 float ecut(0.);
169 if (m_useDBFortQ) {
170 if (run2DSPThresh) {
171 ecut = run2DSPThresh->tQThr(id);
172 }
173 else if (run1DSPThresh) {
174 ecut = run1DSPThresh->tQThr(id);
175 }
176 else {
177 ATH_MSG_ERROR ("DSP threshold problem");
178 return StatusCode::FAILURE;
179 }
180 }
181 else {
182 ecut = m_eCutFortQ;
183 }
184 if (E1 > ecut) {
185 ATH_MSG_VERBOSE("Channel " << m_onlineId->channel_name(id) << " gain " << gain << " above threshold for tQ computation");
186 prov|=LArProv::QTPRESENT; // fill bit in provenance that time+quality information are available
187
188 //Get time by applying OFC-b coefficients:
189 const auto& ofcb=ofcs->OFC_b(id,gain);
190 double At=0;
191 for (size_t i=0;i<nOFC;++i) {
192 At+=static_cast<double>(samp_no_ped[i])*ofcb[i];
193 }
194 //Divide A*t/A to get time
195 tau=(std::fabs(A)>0.1) ? At/A : 0.0;
196 const auto& fullShape=shapes->Shape(id,gain);
197
198 //Get Q-factor
199 //fixing HEC to move +1 in case of 4 samples and firstSample 0 (copied from old LArRawChannelBuilder)
200 const size_t nSamples=samples.size();
201 if (fullShape.size()>nSamples && nSamples==4 && m_firstSample==0) {
202 if (m_onlineId->isHECchannel(id)) {
203 firstSample=1;
204 }
205 }
206
207 if (ATH_UNLIKELY(fullShape.size()<nOFC+firstSample)) {
208 if (!connected) continue; //No conditions for disconnected channel, who cares?
209 ATH_MSG_ERROR("No valid shape for channel " << m_onlineId->channel_name(id)
210 << " gain " << gain);
211 ATH_MSG_ERROR("Got size " << fullShape.size() << ", expected at least " << nSamples+firstSample);
212 return StatusCode::FAILURE;
213 }
214
215 const float* shape=&*fullShape.begin()+firstSample;
216
217 double q=0;
218 if (m_useShapeDer) {
219 const auto& fullshapeDer=shapes->ShapeDer(id,gain);
220 if (ATH_UNLIKELY(fullshapeDer.size()<nOFC+firstSample)) {
221 ATH_MSG_ERROR("No valid shape derivative for channel " << m_onlineId->channel_name(id)
222 << " gain " << gain);
223 ATH_MSG_ERROR("Got size " << fullshapeDer.size() << ", expected at least " << nOFC+firstSample);
224 return StatusCode::FAILURE;
225 }
226
227 const float* shapeDer=&*fullshapeDer.begin()+firstSample;
228 for (size_t i=0;i<nOFC;++i) {
229 q += std::pow((A*(shape[i]-tau*shapeDer[i])-(samp_no_ped[i])),2);
230 }
231 }//end if useShapeDer
232 else {
233 //Q-factor w/o shape derivative
234 for (size_t i=0;i<nOFC;++i) {
235 q += std::pow((A*shape[i]-(samp_no_ped[i])),2);
236 }
237 }
238
239 int iqua = static_cast<int>(q);
240 if (iqua > 0xFFFF) iqua=0xFFFF;
241 iquaShort = static_cast<uint16_t>(iqua & 0xFFFF);
242
243 tau-=ofcs->timeOffset(id,gain);
244 tau*=(Gaudi::Units::nanosecond/Gaudi::Units::picosecond); //Convert time to ps
245 }//end if above cut
246
247 outputContainer->emplace_back(id,static_cast<int>(std::floor(E+0.5)),
248 static_cast<int>(std::floor(tau+0.5)),
249 iquaShort,prov,(CaloGain::CaloGain)gain);
250 }
251
252
253 SG::WriteHandle<LArRawChannelContainer>outputHandle(m_rawChannelKey,ctx);
254 ATH_CHECK(outputHandle.record(std::move(outputContainer) ) );
255
256 return StatusCode::SUCCESS;
257}
#define ATH_CHECK
Evaluate an expression and check for errors.
#define ATH_MSG_ERROR(x)
#define ATH_MSG_VERBOSE(x)
#define ATH_UNLIKELY(x)
virtual OFCRef_t OFC_b(const HWIdentifier &id, int gain, int tbin=0) const =0
virtual OFCRef_t OFC_a(const HWIdentifier &id, int gain, int tbin=0) const =0
access to OFCs by online ID, gain, and tbin (!=0 for testbeam)
virtual float timeOffset(const HWIdentifier &CellID, int gain) const =0
virtual float pedestal(const HWIdentifier &id, int gain) const =0
virtual ShapeRef_t Shape(const HWIdentifier &id, int gain, int tbin=0, int mode=0) const =0
virtual ShapeRef_t ShapeDer(const HWIdentifier &id, int gain, int tbin=0, int mode=0) const =0
const LArVectorProxy ADC2MEV(const HWIdentifier &id, int gain) const
Definition LArADC2MeV.h:32
float tQThr(const HWIdentifier chid) const
Gaudi::Property< int > m_firstSample
SG::ReadCondHandleKey< ILArPedestal > m_pedestalKey
SG::ReadHandleKey< LArDigitContainer > m_digitKey
Gaudi::Property< bool > m_useShapeDer
SG::ReadCondHandleKey< LArOnOffIdMapping > m_cablingKey
SG::ReadCondHandleKey< AthenaAttributeList > m_run2DSPThresholdsKey
SG::ReadCondHandleKey< LArDSPThresholdsComplete > m_run1DSPThresholdsKey
SG::WriteHandleKey< LArRawChannelContainer > m_rawChannelKey
Gaudi::Property< bool > m_useDBFortQ
Gaudi::Property< bool > m_absECutFortQ
SG::ReadCondHandleKey< LArADC2MeV > m_adc2MeVKey
SG::ReadCondHandleKey< ILArShape > m_shapeKey
SG::ReadCondHandleKey< ILArOFC > m_ofcKey
Gaudi::Property< float > m_eCutFortQ
setScaleOne setStatusOne saturated
setWord1 uint16_t

◆ 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

◆ finalize()

StatusCode LArRawChannelBuilderAlg::finalize ( )
override

Definition at line 45 of file LArRawChannelBuilderAlg.cxx.

45 {
46 return StatusCode::SUCCESS;
47}

◆ initialize()

StatusCode LArRawChannelBuilderAlg::initialize ( )
override

Definition at line 16 of file LArRawChannelBuilderAlg.cxx.

16 {
17 ATH_CHECK(m_digitKey.initialize());
18 ATH_CHECK(m_rawChannelKey.initialize());
19 ATH_CHECK(m_pedestalKey.initialize());
20 ATH_CHECK(m_adc2MeVKey.initialize());
21 ATH_CHECK(m_ofcKey.initialize());
22 ATH_CHECK(m_shapeKey.initialize());
23 ATH_CHECK(m_cablingKey.initialize() );
26 if (m_useDBFortQ) {
27 if (m_run1DSPThresholdsKey.empty() && m_run2DSPThresholdsKey.empty()) {
28 ATH_MSG_ERROR ("useDB requested but neither Run1DSPThresholdsKey nor Run2DSPThresholdsKey initialized.");
29 return StatusCode::FAILURE;
30 }
31 }
32
33
34 ATH_CHECK(detStore()->retrieve(m_onlineId,"LArOnlineID"));
35
36
37 const std::string cutmsg = m_absECutFortQ.value() ? " fabs(E) < " : " E < ";
38 ATH_MSG_INFO("Energy cut for time and quality computation: " << cutmsg <<
39 " taken from COOL folder "<<
40 m_run1DSPThresholdsKey.key() << " (run1) " <<
41 m_run2DSPThresholdsKey.key() << " (run2) ");
42 return StatusCode::SUCCESS;
43}
#define ATH_MSG_INFO(x)
const ServiceHandle< StoreGateSvc > & detStore() const
retrieve(aClass, aKey=None)
Definition PyKernel.py:110

◆ 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()

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

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

Gaudi::Property<bool> LArRawChannelBuilderAlg::m_absECutFortQ {this,"absECut",true,"Cut on fabs(E) for Q and t computation"}
private

Definition at line 61 of file LArRawChannelBuilderAlg.h.

61{this,"absECut",true,"Cut on fabs(E) for Q and t computation"};

◆ m_adc2MeVKey

SG::ReadCondHandleKey<LArADC2MeV> LArRawChannelBuilderAlg::m_adc2MeVKey {this,"ADC2MeVKey","LArADC2MeV","SG Key of ADC2MeV conditions object"}
private

Definition at line 49 of file LArRawChannelBuilderAlg.h.

49{this,"ADC2MeVKey","LArADC2MeV","SG Key of ADC2MeV conditions object"};

◆ m_cablingKey

SG::ReadCondHandleKey<LArOnOffIdMapping> LArRawChannelBuilderAlg::m_cablingKey {this,"CablingKey","LArOnOffIdMap","SG Key of LArOnOffIdMapping object"}
private

Definition at line 53 of file LArRawChannelBuilderAlg.h.

53{this,"CablingKey","LArOnOffIdMap","SG Key of LArOnOffIdMapping object"};

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

SG::ReadHandleKey<LArDigitContainer> LArRawChannelBuilderAlg::m_digitKey
private
Initial value:
{this, "LArDigitKey","FREE",
"SG Key of LArDigitContaiiner"}

Definition at line 41 of file LArRawChannelBuilderAlg.h.

41 {this, "LArDigitKey","FREE",
42 "SG Key of LArDigitContaiiner"};

◆ m_eCutFortQ

Gaudi::Property<float> LArRawChannelBuilderAlg::m_eCutFortQ {this,"ECutFortQ",256.0,"Time and Quality will be computed only for channels with E above this value"}
private

Definition at line 59 of file LArRawChannelBuilderAlg.h.

59{this,"ECutFortQ",256.0,"Time and Quality will be computed only for channels with E above this value"};

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

Gaudi::Property<int> LArRawChannelBuilderAlg::m_firstSample {this,"firstSample",0,"first of the 32 sampels of the MC shape to be used"}
private

Definition at line 66 of file LArRawChannelBuilderAlg.h.

66{this,"firstSample",0,"first of the 32 sampels of the MC shape to be used"};

◆ m_ofcKey

SG::ReadCondHandleKey<ILArOFC> LArRawChannelBuilderAlg::m_ofcKey {this,"OFCKey","LArOFC","SG Key of OFC conditions object"}
private

Definition at line 50 of file LArRawChannelBuilderAlg.h.

50{this,"OFCKey","LArOFC","SG Key of OFC conditions object"};

◆ m_onlineId

const LArOnlineID* LArRawChannelBuilderAlg::m_onlineId = nullptr
private

Definition at line 69 of file LArRawChannelBuilderAlg.h.

◆ m_pedestalKey

SG::ReadCondHandleKey<ILArPedestal> LArRawChannelBuilderAlg::m_pedestalKey {this,"PedestalKey","LArPedestal","SG Key of Pedestal conditions object"}
private

Definition at line 48 of file LArRawChannelBuilderAlg.h.

48{this,"PedestalKey","LArPedestal","SG Key of Pedestal conditions object"};

◆ m_rawChannelKey

SG::WriteHandleKey<LArRawChannelContainer> LArRawChannelBuilderAlg::m_rawChannelKey
private
Initial value:
{this,"LArRawChannelKey","LArRawChannels",
"SG key of the output LArRawChannelContainer"}

Definition at line 44 of file LArRawChannelBuilderAlg.h.

44 {this,"LArRawChannelKey","LArRawChannels",
45 "SG key of the output LArRawChannelContainer"};

◆ m_run1DSPThresholdsKey

SG::ReadCondHandleKey<LArDSPThresholdsComplete> LArRawChannelBuilderAlg::m_run1DSPThresholdsKey {this, "Run1DSPThresholdsKey","", "SG Key for thresholds to compute time and quality, run 1"}
private

Definition at line 54 of file LArRawChannelBuilderAlg.h.

54{this, "Run1DSPThresholdsKey","", "SG Key for thresholds to compute time and quality, run 1"};

◆ m_run2DSPThresholdsKey

SG::ReadCondHandleKey<AthenaAttributeList> LArRawChannelBuilderAlg::m_run2DSPThresholdsKey {this, "Run2DSPThresholdsKey","", "SG Key for thresholds to compute time and quality, run 2"}
private

Definition at line 55 of file LArRawChannelBuilderAlg.h.

55{this, "Run2DSPThresholdsKey","", "SG Key for thresholds to compute time and quality, run 2"};

◆ m_shapeKey

SG::ReadCondHandleKey<ILArShape> LArRawChannelBuilderAlg::m_shapeKey {this,"ShapeKey","LArShape","SG Key of Shape conditions object"}
private

Definition at line 51 of file LArRawChannelBuilderAlg.h.

51{this,"ShapeKey","LArShape","SG Key of Shape conditions object"};

◆ m_useDBFortQ

Gaudi::Property<bool> LArRawChannelBuilderAlg::m_useDBFortQ {this,"useDB",true,"Use DB for cut on t,Q"}
private

Definition at line 64 of file LArRawChannelBuilderAlg.h.

64{this,"useDB",true,"Use DB for cut on t,Q"};

◆ m_useShapeDer

Gaudi::Property<bool> LArRawChannelBuilderAlg::m_useShapeDer {this,"useShapeDer",true,"Use shape derivative in Q-factor computation"}
private

Definition at line 62 of file LArRawChannelBuilderAlg.h.

62{this,"useShapeDer",true,"Use shape derivative in Q-factor computation"};

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