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

#include <CSC_RegSelCondAlg.h>

Inheritance diagram for CSC_RegSelCondAlg:
Collaboration diagram for CSC_RegSelCondAlg:

Public Member Functions

 CSC_RegSelCondAlg (const std::string &name, ISvcLocator *pSvcLocator)
std::unique_ptr< RegSelSiLUTcreateTable (const EventContext &ctx, EventIDRange &id_range) const override
virtual StatusCode initialize () override
virtual StatusCode execute (const EventContext &ctx) const override
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.

Protected Attributes

SG::ReadCondHandleKey< MuonGM::MuonDetectorManagerm_detMgrKey
 MuonDetectorManager from the conditions store.

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

Gaudi::Property< bool > m_printTable {this, "PrintTable", false}
Gaudi::Property< std::string > m_mangerName {this, "ManagerName", "", "Property no where used"}
SG::WriteCondHandleKey< IRegSelLUTCondDatam_tableKey { this, "RegSelLUT", "RegSelLUTCondData", "Region Selector lookup table" }
 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

Definition at line 18 of file CSC_RegSelCondAlg.h.

Member Typedef Documentation

◆ StoreGateSvc_t

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

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

◆ CSC_RegSelCondAlg()

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

Definition at line 37 of file CSC_RegSelCondAlg.cxx.

37 :
38 MuonRegSelCondAlg( name, pSvcLocator )
39{
40 ATH_MSG_DEBUG( "CSC_RegSelCondAlg::CSC_RegSelCondAlg() " << name );
41}
#define ATH_MSG_DEBUG(x)
MuonRegSelCondAlg(const std::string &name, ISvcLocator *pSvcLocator)

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}

◆ createTable()

std::unique_ptr< RegSelSiLUT > CSC_RegSelCondAlg::createTable ( const EventContext & ctx,
EventIDRange & id_range ) const
overridevirtual

now get the CSC cabling service ...

Implements MuonRegSelCondAlg.

Definition at line 46 of file CSC_RegSelCondAlg.cxx.

46 {
47
48 SG::ReadCondHandle<MuonGM::MuonDetectorManager> manager( m_detMgrKey, ctx );
49
50 if( !manager.range( id_range ) ) {
51 ATH_MSG_ERROR("Failed to retrieve validity range for " << manager.key());
52 return {nullptr};
53 }
54
55
57
58 ServiceHandle<CSCcablingSvc> cabling("CSCcablingSvc", name());
59 ATH_CHECK( cabling.retrieve(), {} );
60
61 const CscIdHelper* helper = manager->cscIdHelper();
62
63 std::vector<Identifier>::const_iterator idfirst = helper->module_begin();
64 std::vector<Identifier>::const_iterator idlast = helper->module_end();
65
66 const IdContext ModuleContext = helper->module_context();
67
68 ATH_MSG_DEBUG("createTable()");
69
70 std::unique_ptr<RegSelSiLUT> lut = std::make_unique<RegSelSiLUT>();
71
72
73
74 for ( std::vector<Identifier>::const_iterator itr=idfirst ; itr!=idlast ; ++itr ) {
75 Identifier Id = *itr;
76 IdentifierHash Idhash;
77
78 helper->get_hash(Id, Idhash, &ModuleContext);
79
80 ExpandedIdentifier exp_id;
81 if (helper->get_expanded_id( Id, exp_id, &ModuleContext)) {
82 ATH_MSG_DEBUG("Failed retrieving ExpandedIdentifier for PRD Identifier = " << Id.getString() << ". Skipping to the next PRD.");
83 continue;
84 }
85
86 int detid = ( exp_id[2]<0 ? -1 : 1 );
87 int layerid = exp_id[1]+1;
88
89
90 // retrieve CscReadoutElement
91
92 Identifier Id2ndLayer;
93 int chamberLayer = 2;
94 const MuonGM::CscReadoutElement *csc = manager->getCscReadoutElement(Id);
95 if (csc == nullptr) {
96
97 // std::cout << "Csc Readout Element not found for this Id ---- try 2nd layer"<<std::endl;
98 Id2ndLayer = helper->parentID(Id);
99 Id2ndLayer = helper->channelID(Id2ndLayer, chamberLayer, 1, 0, 1);
100 csc = manager->getCscReadoutElement(Id2ndLayer);
101 if (csc == nullptr)
102 {
103 // std::cout << "Csc Readout Element not found for 2nd layer too ---- skip"<<std::endl;
104 continue;
105 }
106 }
107
108 double eta_min = 99999999.;
109 double eta_max = -99999999.;
110 double phi_min = 999999.;
111 double phi_max = -999999.;
112
113 double zmin = 999999999;
114 double zmax = -999999999;
115
116 double rmin = 0;
117 double rmax = 0;
118
119 double phi_test = 0.;
120 Identifier Id_phi_max;
121 Identifier Id_phi_min;
122 Identifier Id_eta_max;
123 Identifier Id_eta_min;
124
125 // only use the extreme chamber layers and wirelayers
126
127 int chlayer_inc = helper->chamberLayerMax(Id)-1;
128 if ( chlayer_inc<1 ) chlayer_inc = 1;
129 for ( int chlayer=1 ; chlayer<=helper->chamberLayerMax(Id) ; chlayer+=chlayer_inc ) {
130
131
132 int wlayer_inc = helper->wireLayerMax(Id)-1;
133 if ( wlayer_inc<1 ) wlayer_inc = 1;
134 for ( int wlayer=1 ; wlayer<=helper->wireLayerMax(Id) ; wlayer+=wlayer_inc ){
135
136 for ( int phis=1 ; phis<=csc->NphiStrips(wlayer) ; phis++ ) {
137
138
139 Identifier phis_id = helper->channelID(Id, chlayer, wlayer, 1, phis);
140 Amg::Vector3D phis_x = csc->localStripPos(phis_id);
141 double phis_lenght = csc->stripLength(phis_id);
142
143 // positions of the strip endpoints
144
145 Amg::Vector3D phis_x1 = phis_x;
146 Amg::Vector3D phis_x2 = phis_x;
147
148 //phis_x1.setZ(phis_x.z()-phis_lenght/2.0);
149 //phis_x2.setZ(phis_x.z()+phis_lenght/2.0);
150 phis_x1[2] = phis_x.z()-phis_lenght/2.0;
151 phis_x2[2] = phis_x.z()+phis_lenght/2.0;
152
153 Amg::Vector3D gphis_x1 = csc->globalPos(phis_x1);
154 Amg::Vector3D gphis_x2 = csc->globalPos(phis_x2);
155
156 phi_test=gphis_x1.phi();
157 // for detector in (-0.25,0.25) phi interval use +-3,14 phi interval
158 // if(!(aux1==51 && aux3==1))if (phi_test < 0) phi_test += 2.*M_PI;
159 if(exp_id[1]!=51 || exp_id[3]!=1)if (phi_test < 0) phi_test += 2.*M_PI;
160
161
162 if ( zmin>gphis_x1.z() ) zmin = gphis_x1.z();
163 if ( zmax<gphis_x1.z() ) zmax = gphis_x1.z();
164
165 if ( rmin==0 || rmin>gphis_x1.perp() ) rmin = gphis_x1.perp();
166 if ( rmax==0 || rmax<gphis_x1.perp() ) rmax = gphis_x1.perp();
167
168 if ( zmin>gphis_x2.z() ) zmin = gphis_x2.z();
169 if ( zmax<gphis_x2.z() ) zmax = gphis_x2.z();
170
171 if ( rmin==0 || rmin>gphis_x2.perp() ) rmin = gphis_x2.perp();
172 if ( rmax==0 || rmax<gphis_x2.perp() ) rmax = gphis_x2.perp();
173
174 // position of the strip centre
175
176
177 Amg::Vector3D gphis_x = csc->globalPos(phis_x);
178
179 if ( rmin==0 || rmin>gphis_x.perp() ) rmin = gphis_x.perp();
180 if ( rmax==0 || rmax<gphis_x.perp() ) rmax = gphis_x.perp();
181
182 // phi
183 if(phi_test > phi_max){
184 Id_phi_max=phis_id;
185 phi_max=phi_test;
186 }
187 if(phi_test < phi_min){
188 Id_phi_min=phis_id;
189 phi_min=phi_test;
190 }
191 // eta
192 if(gphis_x1.eta() > eta_max) {
193 Id_eta_max=phis_id;
194 eta_max=gphis_x1.eta();
195 }
196 if(gphis_x1.eta() < eta_min) {
197 Id_eta_min=phis_id;
198 eta_min=gphis_x1.eta();
199 }
200
201 phi_test=gphis_x2.phi();
202 // for detector in (-0.25,0.25) phi interval use +-3,14 phi interval
203 // if(!(aux1==51 && aux3==1)) if (phi_test < 0) phi_test += 2.*M_PI;
204 if(exp_id[1]!=51 || exp_id[3]!=1) if (phi_test < 0) phi_test += 2.*M_PI;
205
206 // phi
207 if(phi_test > phi_max) {
208 Id_phi_max=phis_id;
209 phi_max=phi_test;
210 }
211 if(phi_test < phi_min) {
212 Id_phi_min=phis_id;
213 phi_min=phi_test;
214 }
215 // eta
216 if(gphis_x2.eta() > eta_max) {
217 Id_eta_max=phis_id;
218 eta_max=gphis_x2.eta();
219 }
220 if(gphis_x2.eta() < eta_min) {
221 Id_eta_min=phis_id;
222 eta_min=gphis_x2.eta();
223 }
224
225 }
226
227 // only use the extreme and middle strips
228
229 int eta_inc = csc->NetaStrips(wlayer)/2;
230 if ( eta_inc<1 ) eta_inc = 1;
231 for ( int etas=1 ; etas<=csc->NetaStrips(wlayer) ; etas+=eta_inc ) {
232
233
234 Identifier etas_id = helper->channelID(Id, chlayer, wlayer, 0, etas);
235 Amg::Vector3D etas_x = csc->localStripPos(etas_id);
236 double etas_lenght = csc->stripLength(etas_id);
237
238 // strip endpoints
239
240 Amg::Vector3D etas_x1 = etas_x;
241 Amg::Vector3D etas_x2 = etas_x;
242
243 //etas_x1.setY(etas_x.y()-etas_lenght/2.0);
244 //etas_x2.setY(etas_x.y()+etas_lenght/2.0);
245 etas_x1[1] = etas_x.y()-etas_lenght/2.0;
246 etas_x2[1] = etas_x.y()+etas_lenght/2.0;
247
248 Amg::Vector3D getas_x1 = csc->globalPos(etas_x1);
249 Amg::Vector3D getas_x2 = csc->globalPos(etas_x2);
250
251 if ( zmin>getas_x1.z() ) zmin = getas_x1.z();
252 if ( zmax<getas_x1.z() ) zmax = getas_x1.z();
253
254 if ( zmin>getas_x2.z() ) zmin = getas_x2.z();
255 if ( zmax<getas_x2.z() ) zmax = getas_x2.z();
256
257 if ( rmin==0 || rmin>getas_x1.perp() ) rmin = getas_x1.perp();
258 if ( rmax==0 || rmax<getas_x1.perp() ) rmax = getas_x1.perp();
259
260 if ( rmin==0 || rmin>getas_x2.perp() ) rmin = getas_x2.perp();
261 if ( rmax==0 || rmax<getas_x2.perp() ) rmax = getas_x2.perp();
262
263 // position of the strip centre
264
265 Amg::Vector3D getas_x = csc->globalPos(etas_x);
266
267 if ( rmin==0 || rmin>getas_x.perp() ) rmin = getas_x.perp();
268 if ( rmax==0 || rmax<getas_x.perp() ) rmax = getas_x.perp();
269
270 phi_test = getas_x1.phi();
271 // for detector in (-0.25,0.25) phi interval use +-3,14 phi interval
272 // if(!(aux1==51 && aux3==1)) if (phi_test < 0) phi_test += 2.*M_PI;
273 if(exp_id[1]!=51 || exp_id[3]!=1) if (phi_test < 0) phi_test += 2.*M_PI;
274 // phi
275 if(phi_test > phi_max){
276 Id_phi_max=etas_id;
277 phi_max=phi_test;
278 }
279 if(phi_test < phi_min){
280 Id_phi_min=etas_id;
281 phi_min=phi_test;
282 }
283 // eta
284 if(getas_x1.eta() > eta_max) {
285 Id_eta_max=etas_id;
286 eta_max=getas_x1.eta();
287 }
288 if(getas_x1.eta() < eta_min) {
289 Id_eta_min=etas_id;
290 eta_min=getas_x1.eta();
291 }
292
293 phi_test = getas_x2.phi();
294 // for detector in (-0.25,0.25) phi interval use +-3,14 phi interval
295 // if (!(aux1==51 && aux3==1)) if (phi_test < 0) phi_test += 2.*M_PI;
296 if (exp_id[1]!=51 || exp_id[3]!=1) if (phi_test < 0) phi_test += 2.*M_PI;
297 // phi
298 if(phi_test > phi_max){
299 Id_phi_max=etas_id;
300 phi_max=phi_test;
301 }
302 if(phi_test < phi_min){
303 Id_phi_min=etas_id;
304 phi_min=phi_test;
305 }
306 // eta
307 if(getas_x2.eta() > eta_max) {
308 Id_eta_max=etas_id;
309 eta_max=getas_x2.eta();
310 }
311 if(getas_x2.eta() < eta_min) {
312 Id_eta_min=etas_id;
313 eta_min=getas_x2.eta();
314 }
315
316 }
317 } //gas gaps
318 } // chamber layers
319
320 // if(aux1==51 && aux3==1)if (phi_min < 0) phi_min += 2.*M_PI;
321 // if(aux1==51 && aux3==1)if (phi_max < 0) phi_max += 2.*M_PI;
322 if(exp_id[1]==51 && exp_id[3]==1) {
323 if (phi_max < 0) phi_max += 2.*M_PI;
324 if (phi_min < 0) phi_min += 2.*M_PI;
325 }
326
327 uint16_t subDetectorId = (detid == -1) ? 0x6a : 0x69;
328 uint32_t cscrob = 0x0;
329 cabling->hash2Rob(Idhash.value(),cscrob);
330 cscrob = ((subDetectorId << 16) | cscrob);
331 RegSelModule m( zmin, zmax, rmin, rmax, phi_min, phi_max, layerid, detid, cscrob, Idhash );
332 lut->addModule( m );
333
334
335 } // modules
336
337
338 lut->initialise();
339
340 return lut;
341
342}
#define M_PI
#define ATH_CHECK
Evaluate an expression and check for errors.
#define ATH_MSG_ERROR(x)
value_type value() const
std::string getString() const
Provide a string form of the identifier - hexadecimal.
Amg::Vector3D localStripPos(const Identifier &id) const
takes into account internal alignment parameters, hence gives generally accurate answer (local here i...
double stripLength(int chamberLayer, int measuresPhi, int stripNumber, double &epsilon) const
Amg::Vector3D globalPos(const Amg::Vector3D &localP) const
station-level method: does not depend on the strip view/layer, hence it cannot account for internal a...
int NphiStrips(int gasgaplayer) const
int NetaStrips(int gasgaplayer) const
SG::ReadCondHandleKey< MuonGM::MuonDetectorManager > m_detMgrKey
MuonDetectorManager from the conditions store.
Eigen::Matrix< double, 3, 1 > Vector3D
constexpr auto lut(Generator &&f)
setWord1 uint16_t
setEventNumber uint32_t

◆ 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 MuonRegSelCondAlg::execute ( const EventContext & ctx) const
overridevirtualinherited

do stuff here ...

inpractice, this should never be called, although in serial athena,
because the implementation of the conditions behaviour is flawed in
the framework, this routine will be called every event (!) regardless
of whether it should be called or not so we need this check to
prevent unecessary code execution on out our side

create the new lookup table

create the conditions data for storage

leave this commented here since this is where it should really be, but we had to move it up in the code to handle the flawed conditions handling in the serial athena use case SG::WriteCondHandle<IRegSelLUTCondData> lutCondData( m_tableKey, ctx );

Definition at line 46 of file MuonRegSelCondAlg.cxx.

46 {
47 ATH_MSG_DEBUG("MuonRegSelCondAlg::execute() -- enter -- ");
48
50 ATH_MSG_DEBUG( "Creating region selector table " << m_tableKey );
51
52
53 SG::WriteCondHandle<IRegSelLUTCondData> lutCondData( m_tableKey, ctx );
54 if (lutCondData.isValid()) {
60 ATH_MSG_DEBUG("CondHandle " << lutCondData.fullKey() << " is already valid." );
61 return StatusCode::SUCCESS;
62 }
63
65
66 EventIDRange id_range;
67
68 std::unique_ptr<IRegSelLUT> rd = createTable( ctx, id_range );
69
70 if ( !rd ) return StatusCode::FAILURE;
71
72 ATH_MSG_DEBUG( "Initialising new map " );;
73
74 // write out new new LUT to a file if need be
75
76 if ( m_printTable ) {
77 if (const auto *lut = dynamic_cast<const RegSelSiLUT*>(rd.get())) {
78 lut->write( name()+".map" );
79 }
80 }
81
83
84 IRegSelLUTCondData* rcd = new IRegSelLUTCondData( std::move(rd) );
85
86 try {
91 if( lutCondData.record( id_range, rcd ).isFailure() ) {
92 ATH_MSG_ERROR( "Could not record " << m_tableKey
93 << " " << lutCondData.key()
94 << " with range " << id_range );
95 return StatusCode::FAILURE;
96 }
97 ATH_MSG_INFO( "RegSelCondAlg LUT recorded: " << m_tableKey);
98 }
99 catch (...) {
100 ATH_MSG_ERROR("MuonRegSelCondAlg::execute() failed to record table: " << m_tableKey);
101 return StatusCode::FAILURE;
102 }
103
104
105 ATH_MSG_DEBUG("MuonRegSelCondAlg::execute() -- exit -- ");
106
107 return StatusCode::SUCCESS;
108}
#define ATH_MSG_INFO(x)
RegSelCondData< IRegSelLUT > IRegSelLUTCondData
Gaudi::Property< bool > m_printTable
virtual std::unique_ptr< RegSelSiLUT > createTable(const EventContext &ctx, EventIDRange &id_range) const =0
SG::WriteCondHandleKey< IRegSelLUTCondData > m_tableKey
Output conditions object.

◆ 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 MuonRegSelCondAlg::initialize ( )
overridevirtualinherited

Reimplemented in MDT_RegSelCondAlg, and RPC_RegSelCondAlg.

Definition at line 35 of file MuonRegSelCondAlg.cxx.

36{
37 ATH_MSG_DEBUG("MuonRegSelCondAlg::initialize() ");
38 ATH_CHECK(m_tableKey.initialize());
39 ATH_CHECK(m_detMgrKey.initialize());
40 ATH_MSG_INFO("MuonRegSelCondAlg::initialize() " << m_tableKey );
41 return StatusCode::SUCCESS;
42}

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

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

SG::ReadCondHandleKey<MuonGM::MuonDetectorManager> MuonRegSelCondAlg::m_detMgrKey
protectedinherited
Initial value:
{
this, "DetectorManagerKey", "MuonDetectorManager",
"Key of input MuonDetectorManager condition data"}

MuonDetectorManager from the conditions store.

Definition at line 45 of file MuonRegSelCondAlg.h.

45 {
46 this, "DetectorManagerKey", "MuonDetectorManager",
47 "Key of input MuonDetectorManager condition data"};

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

Gaudi::Property<std::string> MuonRegSelCondAlg::m_mangerName {this, "ManagerName", "", "Property no where used"}
privateinherited

Definition at line 51 of file MuonRegSelCondAlg.h.

51{this, "ManagerName", "", "Property no where used"};

◆ m_printTable

Gaudi::Property<bool> MuonRegSelCondAlg::m_printTable {this, "PrintTable", false}
privateinherited

Definition at line 50 of file MuonRegSelCondAlg.h.

50{this, "PrintTable", false};

◆ m_tableKey

SG::WriteCondHandleKey<IRegSelLUTCondData> MuonRegSelCondAlg::m_tableKey { this, "RegSelLUT", "RegSelLUTCondData", "Region Selector lookup table" }
privateinherited

Output conditions object.

Definition at line 54 of file MuonRegSelCondAlg.h.

55{ this, "RegSelLUT", "RegSelLUTCondData", "Region Selector lookup table" };

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