LArConditionsTestAlg Class Reference

Athena algorithm used for testing LAr conditions data access. More...

#include <LArConditionsTestAlg.h>

Inheritance diagram for LArConditionsTestAlg:

Collaboration diagram for LArConditionsTestAlg:

Public Member Functions
	LArConditionsTestAlg (const std::string &name, ISvcLocator *pSvcLocator)
virtual	~LArConditionsTestAlg ()
virtual StatusCode	initialize () override
virtual StatusCode	execute (const EventContext &ctx) override
	Execute method.
virtual StatusCode	finalize () override
virtual StatusCode	sysInitialize () override
	Override sysInitialize.
virtual bool	isClonable () const override
	Specify if the algorithm is clonable.
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
	Get filter decision:
virtual void	setFilterPassed (bool state, const EventContext &ctx) const
	Set filter decision:
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
virtual bool	isReEntrant () const override final
	Legacy algorithms are not thread-safe.
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< StoreGateSvc >	StoreGateSvc_t

Private Member Functions
StatusCode	createCompareObjects ()
StatusCode	testCondObjects ()
StatusCode testEachCondObject	ATLAS_NOT_THREAD_SAFE (const LArRampMC *ramps)
StatusCode	testChannelSet ()
StatusCode	testDbObjectRead ()
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
std::vector< LArRampPTmp >	m_rampCache
std::vector< LArRampPTmp >	m_rampCorrections
const LArOnlineID *	m_onlineID {}
BooleanProperty	m_testCondObjs {this, "TestCondObjs", false}
BooleanProperty	m_readCondObjs {this, "ReadCondObjs", false}
BooleanProperty	m_writeCondObjs {this, "WriteCondObjs", false}
BooleanProperty	m_writeCorrections {this, "WriteCorrections", false}
BooleanProperty	m_applyCorrections {this, "ApplyCorrections", false}
BooleanProperty	m_testReadDB {this, "TestReadDBDirect", false}
BooleanProperty	m_TB {this, "Testbeam", false}
IntegerProperty	m_tbin {this, "Tbin", 0}
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

Athena algorithm used for testing LAr conditions data access.

Definition at line 39 of file LArConditionsTestAlg.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

LArConditionsTestAlg()

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

Definition at line 32 of file LArConditionsTestAlg.cxx.

                                                                                          :
    AthAlgorithm(name,pSvcLocator)
{
}

~LArConditionsTestAlg()

LArConditionsTestAlg::~LArConditionsTestAlg ( )

virtual

Definition at line 41 of file LArConditionsTestAlg.cxx.

{  }

Member Function Documentation

ATLAS_NOT_THREAD_SAFE()

StatusCode testEachCondObject LArConditionsTestAlg::ATLAS_NOT_THREAD_SAFE ( const LArRampMC * ramps )

private

createCompareObjects()

StatusCode LArConditionsTestAlg::createCompareObjects ( )

private

Definition at line 108 of file LArConditionsTestAlg.cxx.

{
    // StatusCode sc;
    ATH_MSG_INFO ("in createCompareObjects()" );
 
    // Create set of ids, LArRampComplete::LArCondObj
 
    std::vector<HWIdentifier>::const_iterator chanIt  = m_onlineID->channel_begin();
    std::vector<HWIdentifier>::const_iterator chanEnd = m_onlineID->channel_end();
    int ichan           = -1;
    int icorr           = 0;
    float vramp         = 0;
    int gain            = 0;
    for (; chanIt != chanEnd; ++chanIt, ++ichan) {
    // add channels with downscale factor
    if (ichan % 1000 != 5) continue;
 
    // Create ramp with 3 vRamp elements
    LArRampPTmp ramp((*chanIt), gain);
    ramp.m_vRamp.push_back(vramp);
    vramp += 1.0;
    ramp.m_vRamp.push_back(vramp);
    vramp += 1.0;
    ramp.m_vRamp.push_back(vramp);
    vramp += 1.0;
    // add to cache
    m_rampCache.push_back(ramp);
    
    // Change gain each time
    gain = (gain == 2) ? 0 : gain + 1;
    
    if (m_writeCorrections || m_applyCorrections) {
        // Create downscaled corrections
        ++icorr;
        if (icorr % 10 != 5) continue;
        // Just change sign of ramp values
        for (unsigned int i = 0; i < 3; ++i)ramp.m_vRamp[i] = -ramp.m_vRamp[i];
        m_rampCorrections.push_back(std::move(ramp));
    }
    }
    
    // Print out cache and corrections
    for (unsigned int i = 0; i < m_rampCache.size(); ++i) {
      ATH_MSG_DEBUG ("Cache: chan, gain, ramps "
                     << m_onlineID->show_to_string(m_rampCache[i].m_channelID) << " " 
                     << m_rampCache[i].m_gain << " " 
                     << m_rampCache[i].m_vRamp[0] << " " 
                     << m_rampCache[i].m_vRamp[1] << " " 
                     << m_rampCache[i].m_vRamp[2] << " " );
    }
    for (unsigned int i = 0; i < m_rampCorrections.size(); ++i) {
      ATH_MSG_DEBUG ("Corrections: chan, gain, ramps "
                     << m_onlineID->show_to_string(m_rampCorrections[i].m_channelID) << " " 
                     << m_rampCorrections[i].m_gain << " " 
                     << m_rampCorrections[i].m_vRamp[0] << " " 
                     << m_rampCorrections[i].m_vRamp[1] << " " 
                     << m_rampCorrections[i].m_vRamp[2] << " " );
    }
    
    ATH_MSG_DEBUG ( "End of create comparison objects " );
    return StatusCode::SUCCESS; 
} 

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.

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

declareProperty()

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

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

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

detStore()

const ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< 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.

{ return m_detStore; }

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.

{ return m_evtStore; }

execute()

StatusCode LArConditionsTestAlg::execute ( const EventContext & ctx )

overridevirtual

Execute method.

Implements AthAlgorithm.

Definition at line 71 of file LArConditionsTestAlg.cxx.

{
    if(m_testCondObjs){ 
 
    // create cache
        ATH_CHECK(  testCondObjects() );
    }
    
 
    if(m_TB){ 
    const ILArOFC* ofc = nullptr;
    ATH_CHECK( detStore()->retrieve(ofc, "LArOFC") );
 
    const ILArRamp* ramp = nullptr;
    ATH_CHECK( detStore()->retrieve(ramp, "LArRamp") );
    } 
 
    return StatusCode::SUCCESS;
}

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 & AthCommonAlgorithm< 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 89 of file AthCommonAlgorithm.cxx.

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

filterPassed()

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

inlinevirtualinherited

Get filter decision:

Definition at line 93 of file AthCommonAlgorithm.h.

                                                           {
    return execState( ctx ).filterPassed();
  }

finalize()

StatusCode LArConditionsTestAlg::finalize ( )

overridevirtual

Definition at line 98 of file LArConditionsTestAlg.cxx.

{
    if(m_testReadDB)  ATH_CHECK(testDbObjectRead());
    return StatusCode::SUCCESS; 
} 

initialize()

StatusCode LArConditionsTestAlg::initialize ( )

overridevirtual

Definition at line 48 of file LArConditionsTestAlg.cxx.

{
    ATH_MSG_DEBUG ( " TestCondObjs flag         = " << m_testCondObjs );
    ATH_MSG_DEBUG ( " ReadCondObjs flag         = " << m_readCondObjs );
    ATH_MSG_DEBUG ( " WriteCondObjs flag        = " << m_writeCondObjs );
    ATH_MSG_DEBUG ( " WriteCorrections flag     = " << m_writeCorrections );
    ATH_MSG_DEBUG ( " ApplyCorrections flag     = " << m_applyCorrections );
    ATH_MSG_DEBUG ( " TestReadDBDirect flag     = " << m_testReadDB );
    ATH_MSG_DEBUG ( " Testbeam flag             = " << m_TB );
 
    ATH_CHECK( detStore()->retrieve(m_onlineID) );
 
    const CaloCell_ID* calocell_id = nullptr;
    ATH_CHECK( detStore()->retrieve(calocell_id) );
 
    ATH_MSG_DEBUG ( "initialize done" );
    return StatusCode::SUCCESS;
}

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

virtual bool AthCommonAlgorithm< Gaudi::Algorithm >::isClonable ( ) const

inlineoverridevirtualinherited

Specify if the algorithm is clonable.

Only relevant for non-reentrant algorithms. Actual number of clones needs to be set via the "Cardinality" property.

Reimplemented in AFP_DigiTop, AlgB, AlgT, BCM_Digitization, CscDigitBuilder, CscDigitToCscRDO, G4AtlasAlg, G4RunAlg, HGTD_Digitization, HiveAlgBase, InDet::GNNSeedingTrackMaker, InDet::SCT_Clusterization, InDet::SiSPGNNTrackMaker, InDet::SiSPSeededTrackFinder, InDet::SiTrackerSpacePointFinder, ISF::SimKernelMT, ITk::StripDigitization, ITkPixelCablingAlg, ITkStripCablingAlg, LArHitEMapMaker, LArTTL1Maker, LUCID_DigiTop, LVL1::L1TopoSimulation, MergeCalibHits, MergeGenericMuonSimHitColl, MergeHijingPars, MergeMcEventCollection, MergeTrackRecordCollection, MergeTruthJets, MergeTruthParticles, MuonDigitizer, PileUpMTAlg, PixelDigitization, RoIBResultToxAOD, SCT_ByteStreamErrorsTestAlg, SCT_CablingCondAlgFromCoraCool, SCT_CablingCondAlgFromText, SCT_ConditionsParameterTestAlg, SCT_ConditionsSummaryTestAlg, SCT_ConfigurationConditionsTestAlg, SCT_Digitization, SCT_FlaggedConditionTestAlg, SCT_LinkMaskingTestAlg, SCT_MajorityConditionsTestAlg, SCT_ModuleVetoTestAlg, SCT_MonitorConditionsTestAlg, SCT_PrepDataToxAOD, SCT_RawDataToxAOD, SCT_ReadCalibChipDataTestAlg, SCT_ReadCalibDataTestAlg, SCT_RODVetoTestAlg, SCT_SensorsTestAlg, SCT_SiliconConditionsTestAlg, SCT_StripVetoTestAlg, SCT_TdaqEnabledTestAlg, SCT_TestCablingAlg, SCTEventFlagWriter, SCTRawDataProvider, SCTSiLorentzAngleTestAlg, SCTSiPropertiesTestAlg, SGInputLoader, Simulation::BeamEffectsAlg, TileHitVecToCnt, TileMuonFitter, TilePulseForTileMuonReceiver, TileRawChannelMaker, TRTDigitization, and ZDC_DigiTop.

Definition at line 68 of file AthCommonAlgorithm.h.

                                           {
    return true;
  }

isReEntrant()

virtual bool AthAlgorithm::isReEntrant ( ) const

inlinefinaloverrideprotectedvirtualinherited

Legacy algorithms are not thread-safe.

Definition at line 47 of file AthAlgorithm.h.

{ return false; }

msg()

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

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

msgLvl()

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

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

outputHandles()

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

  {
    h.renounce();
    PBASE::renounce (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.

                                                          {
    handlesArray.renounce();
  }

setFilterPassed()

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

inlinevirtualinherited

Set filter decision:

Reimplemented in AthFilterAlgorithm.

Definition at line 99 of file AthCommonAlgorithm.h.

                                                                            {
    execState( ctx ).setFilterPassed( state );
  }

sysExecute()

StatusCode AthCommonAlgorithm< 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.

Reimplemented in AthAnalysisAlgorithm.

Definition at line 80 of file AthCommonAlgorithm.cxx.

{
  return BaseAlg::sysExecute (ctx);
}

sysInitialize()

StatusCode AthCommonAlgorithm< 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 AthAnalysisAlgorithm, AthFilterAlgorithm, AthHistogramAlgorithm, HypoBase, InputMakerBase, and PyAthena::Alg.

Definition at line 60 of file AthCommonAlgorithm.cxx.

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

sysStart()

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

testChannelSet()

StatusCode LArConditionsTestAlg::testChannelSet ( )

private

Definition at line 1010 of file LArConditionsTestAlg.cxx.

{
 
    typedef LArConditionsChannelSet<LArRampComplete::LArCondObj>    ChanSet;
    typedef ChanSet::ConstChannelIt              ConstChannelIt;
 
    ATH_MSG_INFO ("in testChannelSet" );
 
    ChanSet chanSet;
    
    // corrections not always available:
    if (m_writeCorrections || m_applyCorrections) {
    // add corrections to channel set 
    for (unsigned int i = 0; i < m_rampCorrections.size(); ++i) {
        // Must copy LArRampPTmp into a LArRampComplete::LArCondObj
        LArRampComplete::LArCondObj ramp;
        ramp.m_vRamp = m_rampCorrections[i].m_vRamp;
        chanSet.insert(m_rampCorrections[i].m_channelID.get_identifier32().get_compact(), ramp);
    }
    // Now loop over corrections and check that they agree
    bool error = false;
    if (m_rampCorrections.size() != chanSet.size()) {
            ATH_MSG_ERROR ("Corrections not the same size as channel set: " 
                           << m_rampCorrections.size() << " " << chanSet.size() );
        return (StatusCode::FAILURE);
    }
    else {
          ATH_MSG_DEBUG ("Sizes OK: "  << chanSet.size() );
    }
 
    ConstChannelIt it    = chanSet.begin();
    ConstChannelIt itEnd = chanSet.end();
 
    
    unsigned int i = 0;
    for (; it != itEnd; ++it, ++i) {
 
        HWIdentifier id          = m_rampCorrections[i].m_channelID;
        HWIdentifier id1((*it).first);
        LArRampComplete::LArCondObj rampP           = (*it).second;
        if (id != id1 || rampP != m_rampCorrections[i]) {
                ATH_MSG_ERROR ("Correction retrieved with iterator does not match: " 
                               << " i = " << i );
        error = true;
        }
        ATH_MSG_DEBUG ("New        : chan id, gain, ramps "
                           << m_onlineID->show_to_string(id1) << " " 
                           << m_rampCorrections[i].m_gain << " " 
                           << rampP.m_vRamp[0] << " " 
                           << rampP.m_vRamp[1] << " " 
                           << rampP.m_vRamp[2] << " " 
                           );
        ATH_MSG_DEBUG ("Corrections: chan id, gain, ramps "
                           << m_onlineID->show_to_string(m_rampCorrections[i].m_channelID) << " " 
                           << m_rampCorrections[i].m_gain << " " 
                           << m_rampCorrections[i].m_vRamp[0] << " " 
                           << m_rampCorrections[i].m_vRamp[1] << " " 
                           << m_rampCorrections[i].m_vRamp[2] << " " 
                           << " Compare = " << (rampP == m_rampCorrections[i])
                           );
    }
    if (!error) {
          ATH_MSG_DEBUG ("Iteration check OK "  );
    }
    
    i = 0;
    for (; i < m_rampCorrections.size(); ++i) {
 
        unsigned int id = m_rampCorrections[i].m_channelID.get_identifier32().get_compact();
        it = chanSet.find(id);
        if (it == itEnd) {
                ATH_MSG_ERROR ("Could not find correction: " 
                               << " i = " << i );
        error = true;
        ATH_MSG_DEBUG ("Corrections: cool chan, chan id, gain, ramps "
                               << m_onlineID->show_to_string(m_rampCorrections[i].m_channelID) << " " 
                               << m_rampCorrections[i].m_gain << " " 
                               << m_rampCorrections[i].m_vRamp[0] << " " 
                               << m_rampCorrections[i].m_vRamp[1] << " " 
                               << m_rampCorrections[i].m_vRamp[2] << " " 
                               );
        }
    }
    if (!error) {
          ATH_MSG_DEBUG ("Find check OK "  );
    }
 
    if (error) {
            ATH_MSG_ERROR ("Failing check of channel set - see above" );
        return (StatusCode::FAILURE);
    }
    }
 
    return StatusCode::SUCCESS; 
 
}

testCondObjects()

StatusCode LArConditionsTestAlg::testCondObjects ( )

private

Statistics: total number of conditions

Statistics: total number of conditions

Statistics: total number of conditions

Definition at line 207 of file LArConditionsTestAlg.cxx.

{
    ATH_MSG_INFO ("in testCondObjects()" );
 
    static std::atomic<bool> first = true;
    if (!first) {
        ATH_MSG_INFO ("Multiple entries - returning" );
    return StatusCode::SUCCESS; 
    }
    first = false;
    
    typedef LArRampMC::CONTAINER            CONTAINER; 
    typedef CONTAINER::chan_const_iterator  chan_const_iterator;
    typedef CONTAINER::iov_const_iterator   iov_const_iterator;
    
    ATH_CHECK( createCompareObjects() );
    ATH_CHECK( testChannelSet() );
 
    const LArRampMC* ramps = 0;
    
    // Create SingleGroup
    if (m_readCondObjs) {
    const ILArRamp* iramps = 0;
    ATH_CHECK( detStore()->retrieve(iramps, "/LArCalorimeter/LArTests/LArRampsSingleGroup") );
    ATH_MSG_INFO ( "Retrieved ramps for LArRampsSingleGroup " );
    ramps = dynamic_cast<const LArRampMC*>(iramps);
    if (!ramps) {
            ATH_MSG_ERROR ("Could not dynamic cast ILArRamp to LArRampMC" );
        return( StatusCode::FAILURE);
    }
    }
    else {
    LArRampMC* ramps_rw = new LArRampMC;
    ramps = ramps_rw;
    ATH_MSG_INFO ( "Created ramps for LArRampsSingleGroup "  );
    ramps_rw->setGroupingType(LArConditionsContainerBase::SingleGroup);
    ATH_CHECK( ramps_rw->initialize() );
    }
    
    ATH_CHECK( testEachCondObject(ramps) );
    ATH_MSG_INFO ( "Succeeded SingleGroup test  " );
 
    if (!m_readCondObjs) {
    // Save in DetectorStore
        ATH_CHECK( detStore()->record(ramps, "/LArCalorimeter/LArTests/LArRampsSingleGroup") );

        if (ramps) {
          ATH_MSG_DEBUG  ( "Total number of conditions objects"
                           << ramps->totalNumberOfConditions() );
        }
    if (!m_writeCondObjs) {
        // Remove conditions objects if not writing out
        LArRampMC* ramps_rw = const_cast<LArRampMC*>(ramps);
        if (!ramps_rw) {
                ATH_MSG_ERROR ( "Could not const cast to LArRampMC " );
        return StatusCode::FAILURE;
        }
        ramps_rw->removeConditions();
        ATH_MSG_DEBUG  ( "Removed conditions objects" );
    }
    ATH_MSG_DEBUG  ( "Total number of conditions objects "
                         << ramps->totalNumberOfConditions() );
    ATH_MSG_DEBUG  ( "Total number of correction objects"
                         << ramps->totalNumberOfCorrections() );
    }
    
    // Create SubDetectorGrouping
    if (m_readCondObjs) {
    const ILArRamp* iramps = 0;
    ATH_CHECK( detStore()->retrieve(iramps, "/LArCalorimeter/LArTests/LArRampsSubDetectorGrouping") );
    ATH_MSG_INFO ( "Retrieved ramps for LArRampsSubDetectorGrouping "  );
    ramps = dynamic_cast<const LArRampMC*>(iramps);
    if (!ramps) {
          ATH_MSG_ERROR ("Could not dynamic cast ILArRamp to LArRampMC" );
          return( StatusCode::FAILURE);
    }
    }
    else {
    LArRampMC* ramps_rw = new LArRampMC;
    ramps = ramps_rw;
    //ramps_rw->setGroupingType(LArConditionsContainerBase::SubDetectorGrouping);
    ATH_CHECK( ramps_rw->initialize() );
    }
    
    ATH_CHECK( testEachCondObject(ramps) );
    ATH_MSG_INFO ( "Succeeded SubDetectorGrouping test  " );
 
    if (!m_readCondObjs) {
    // Save in DetectorStore
        ATH_CHECK( detStore()->record(ramps, "/LArCalorimeter/LArTests/LArRampsSubDetectorGrouping") );
        if (ramps) {
          ATH_MSG_DEBUG  ( "Total number of conditions objects"
                           << ramps->totalNumberOfConditions() );
        }
    if (!m_writeCondObjs) {
        // Remove conditions objects if not writing out
        LArRampMC* ramps_rw = const_cast<LArRampMC*>(ramps);
        if (!ramps_rw) {
                ATH_MSG_ERROR ( "Could not const cast to LArRampMC " );
        return StatusCode::FAILURE;
        }
        ramps_rw->removeConditions();
        ATH_MSG_DEBUG  ( "Removed conditions objects" );
    }
    ATH_MSG_DEBUG  ( "Total number of conditions objects "
                         << ramps->totalNumberOfConditions() );
    ATH_MSG_DEBUG  ( "Total number of correction objects"
                         << ramps->totalNumberOfConditions() );
    }
    
    // Create FeedThroughGrouping
    if (m_readCondObjs) {
    const ILArRamp* iramps = 0;
    ATH_CHECK( detStore()->retrieve(iramps, "/LArCalorimeter/LArTests/LArRampsFeedThroughGrouping") );
    ATH_MSG_INFO ( "Retrieved ramps for LArRampsFeedThroughGrouping " );
    ramps = dynamic_cast<const LArRampMC*>(iramps);
    if (!ramps) {
            ATH_MSG_ERROR ("Could not dynamic cast ILArRamp to LArRampMC" );
        return( StatusCode::FAILURE);
    }
    }
    else {
    LArRampMC* ramps_rw = new LArRampMC;
    ramps = ramps_rw;
    ramps_rw->setGroupingType(LArConditionsContainerBase::FeedThroughGrouping);
    ATH_CHECK( ramps_rw->initialize() );
    }
    
    ATH_CHECK( testEachCondObject(ramps) );
    ATH_MSG_INFO ( "Succeeded FeedThroughGrouping test  " );
 
    if (!m_readCondObjs) {
    // Save in DetectorStore
      ATH_CHECK( detStore()->record(ramps, "/LArCalorimeter/LArTests/LArRampsFeedThroughGrouping") );
        if (ramps) {
          ATH_MSG_DEBUG  ( "Total number of conditions objects"
                           << ramps->totalNumberOfConditions() );
        }
    if (!m_writeCondObjs) {
        // Remove conditions objects if not writing out
        LArRampMC* ramps_rw = const_cast<LArRampMC*>(ramps);
        if (!ramps_rw) {
                ATH_MSG_ERROR ( "Could not const cast to LArRampMC " );
        return StatusCode::FAILURE;
        }
        ramps_rw->removeConditions();
        ATH_MSG_DEBUG  ( "Removed conditions objects" );
    }
    ATH_MSG_DEBUG  ( "Total number of conditions objects "
                         << ramps->totalNumberOfConditions() );
    ATH_MSG_DEBUG  ( "Total number of correction objects"
                         << ramps->totalNumberOfCorrections() );
    }
 
    ATH_MSG_DEBUG ( "Statistics for LArRampsFeedThroughGrouping " );
    ATH_MSG_DEBUG ( "Number of channels, iovs "
                    << ramps->chan_size() << " " << ramps->iov_size() );
 
    iov_const_iterator iovIt  = ramps->iov_begin();
    iov_const_iterator iovEnd = ramps->iov_end  ();
    msg() << MSG::DEBUG << "IOVs found:  ";
    for (; iovIt != iovEnd; ++iovIt) {
      msg() << MSG::DEBUG << (*iovIt) << ", ";
    }
    msg() << MSG::DEBUG << endmsg;
    
    chan_const_iterator chIt  = ramps->chan_begin();
    chan_const_iterator chEnd = ramps->chan_end  ();
    for (; chIt != chEnd; ++chIt) {
      ATH_MSG_DEBUG ( "Channel:  " << (*chIt) 
                      << " number of conditions: " << ramps->conditionsPerChannel((*chIt)) );
    }
    
    for (unsigned int i = 0; i < ramps->nGroups(); ++i) {
      ATH_MSG_DEBUG ( "Group:  " << i 
                      << " number of conditions: " << ramps->conditionsPerGroup(i) );
    }
    ATH_MSG_DEBUG ("");
    
    for (unsigned int i = 0; i < ramps->nGains(); ++i) {
      ATH_MSG_DEBUG ( "Gain:  " << i 
                      << " number of conditions: " << ramps->conditionsPerGain(i) );
    }
    ATH_MSG_DEBUG  ( "Total number of conditions objects "
                     << ramps->totalNumberOfConditions() );
    ATH_MSG_DEBUG  ( "Total number of correction objects "
                     << ramps->totalNumberOfCorrections() );
 
    
    ATH_MSG_DEBUG ( "End of testCondObjects " );
 
    return StatusCode::SUCCESS; 
} 

testDbObjectRead()

StatusCode LArConditionsTestAlg::testDbObjectRead ( )

private

Definition at line 1108 of file LArConditionsTestAlg.cxx.

{
 
    typedef LArRampMC::CONTAINER  CONTAINER; 
    typedef CONTAINER::Subset     Subset;
 
    const LArRampMC* ramp = 0 ;
    ATH_CHECK( detStore()->retrieve(ramp, "LArRamp") );
  
    ATH_MSG_DEBUG ( " Found LArRampMC, key LArRamp." );
 
    // Print out channels
    ATH_MSG_DEBUG ( " Number of channels " << ramp->chan_size() );
 
    // Print out first 10 elements of each gain for subset
    CONTAINER::chan_const_iterator   chanIt  = ramp->chan_begin();
    CONTAINER::chan_const_iterator   endChan = ramp->chan_end  ();
    for (unsigned int i = 0; chanIt != endChan; ++chanIt, ++i) {
    unsigned int coolChan = *chanIt;
    const Subset* subset = ramp->at(i);
 
    ATH_MSG_DEBUG ( " Channel " << coolChan << " "
                        << " Subset size " << subset->subsetSize() 
                        << " gain, channel, grouping type " << subset->gain() << " "
                        << MSG::hex << subset->channel() << " "  << MSG::dec
                        << subset->groupingType() << " "
                        );
 
    Subset::ConstSubsetIt   first = subset->subsetBegin();
    Subset::ConstSubsetIt   last  = subset->subsetEnd();
    //for (int i = 0; i < 10 && first != last; ++i, ++first) {
    for (; first != last; ++first) {
 
        // select non-zero subsets
        if ((*first).second.size()) {
 
              ATH_MSG_DEBUG ( " FEB id " 
                              << m_onlineID->show_to_string(HWIdentifier((*first).first)) << " " 
                              );
        for (unsigned int k = 0; k < 5; ++k) {
                    msg() << MSG::DEBUG << " vramp " ;
//          << m_onlineID->show_to_string((*first).second[k].m_channelID) << " " 
//          << (*first).second[k].m_gain << " ";
            for (unsigned int j = 0; j < (*first).second[k].m_vRamp.size(); ++j) {
                      msg() << MSG::DEBUG << (*first).second[k].m_vRamp[j] << " ";
            }
            msg() << MSG::DEBUG << endmsg;
        }
 
        }
 
    }
    }
    
 
    /*
 
    // Print out first 10 elements of each gain for corrections
    for (unsigned int gain = 0; gain < 3; ++gain) {
    log << MSG::DEBUG << " Gain, size " 
        << gain << " "
        << ramp->correctionsSize(gain) << endmsg;
    CONTAINER::ConstCorrectionIt  first = ramp->correctionsBegin(gain);
    CONTAINER::ConstCorrectionIt  last  = ramp->correctionsEnd(gain);
    for (int i = 0; i < 10 && first != last; ++i, ++first) {
        log << MSG::DEBUG << " id, vramp " 
        << m_onlineID->show_to_string(HWIdentifier((*first).first)) << " ";
//      << m_onlineID->show_to_string((*first).second.m_channelID) << " " 
//      << (*first).second.m_gain << " ";
        for (unsigned int j = 0; j < (*first).second.m_vRamp.size(); ++j) {
        log << MSG::DEBUG << (*first).second.m_vRamp[j] << " ";
        }
        log << MSG::DEBUG << endmsg;
    }
    }
 
    */
 
    return StatusCode::SUCCESS; 
 
}

updateVHKA()

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

inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

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

Member Data Documentation

m_applyCorrections

BooleanProperty LArConditionsTestAlg::m_applyCorrections {this, "ApplyCorrections", false}

private

Definition at line 68 of file LArConditionsTestAlg.h.

{this, "ApplyCorrections", false};

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 AthCommonAlgorithm< Gaudi::Algorithm >::m_extendedExtraObjects

privateinherited

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

Empty if no symlinks were found.

Definition at line 108 of file AthCommonAlgorithm.h.

m_onlineID

const LArOnlineID* LArConditionsTestAlg::m_onlineID {}

private

Definition at line 63 of file LArConditionsTestAlg.h.

{};

m_rampCache

std::vector<LArRampPTmp> LArConditionsTestAlg::m_rampCache

private

Definition at line 60 of file LArConditionsTestAlg.h.

m_rampCorrections

std::vector<LArRampPTmp> LArConditionsTestAlg::m_rampCorrections

private

Definition at line 61 of file LArConditionsTestAlg.h.

m_readCondObjs

BooleanProperty LArConditionsTestAlg::m_readCondObjs {this, "ReadCondObjs", false}

private

Definition at line 65 of file LArConditionsTestAlg.h.

{this, "ReadCondObjs", false};

m_TB

BooleanProperty LArConditionsTestAlg::m_TB {this, "Testbeam", false}

private

Definition at line 70 of file LArConditionsTestAlg.h.

{this, "Testbeam", false};

m_tbin

IntegerProperty LArConditionsTestAlg::m_tbin {this, "Tbin", 0}

private

Definition at line 71 of file LArConditionsTestAlg.h.

{this, "Tbin", 0};

m_testCondObjs

BooleanProperty LArConditionsTestAlg::m_testCondObjs {this, "TestCondObjs", false}

private

Definition at line 64 of file LArConditionsTestAlg.h.

{this, "TestCondObjs", false};

m_testReadDB

BooleanProperty LArConditionsTestAlg::m_testReadDB {this, "TestReadDBDirect", false}

private

Definition at line 69 of file LArConditionsTestAlg.h.

{this, "TestReadDBDirect", false};

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.

m_writeCondObjs

BooleanProperty LArConditionsTestAlg::m_writeCondObjs {this, "WriteCondObjs", false}

private

Definition at line 66 of file LArConditionsTestAlg.h.

{this, "WriteCondObjs", false};

m_writeCorrections

BooleanProperty LArConditionsTestAlg::m_writeCorrections {this, "WriteCorrections", false}

private

Definition at line 67 of file LArConditionsTestAlg.h.

{this, "WriteCorrections", false};

---

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

• LArConditionsTestAlg.h
• LArConditionsTestAlg.cxx