LArAutoCorrTotalCondAlg Class Reference

#include <LArAutoCorrTotalCondAlg.h>

Inheritance diagram for LArAutoCorrTotalCondAlg:

Public Member Functions
virtual	~LArAutoCorrTotalCondAlg () 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.

Private Types
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_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::ReadCondHandleKey< LArADC2MeV >	m_LArADC2MeVObjKey {this,"LArADC2MeVObjKey","LArADC2MeV","SG key of the resulting LArADC2MeV object"}
SG::ReadCondHandleKey< LArOnOffIdMapping >	m_LArOnOffIdMappingObjKey {this,"LArOnOffIdMappingObjKey","LArOnOffIdMap","SG key of LArOnOffIdMapping object"}
SG::ReadCondHandleKey< ILArShape >	m_LArShapeObjKey {this,"LArShapeObjKey", "LArShapeSym","Key to read LArShape object"}
SG::ReadCondHandleKey< ILArAutoCorr >	m_LArAutoCorrObjKey {this,"LArAutoCorrObjKey", "LArAutoCorrSym","Key to read LArAutoCorr object"}
SG::ReadCondHandleKey< ILArNoise >	m_LArNoiseObjKey {this,"LArNoiseObjKey", "LArNoiseSym", "Key to read LArNoise object"}
SG::ReadCondHandleKey< ILArPedestal >	m_LArPedestalObjKey {this,"LArPedestalObjKey", "LArPedestal","Key to read LArPedestal object"}
SG::ReadCondHandleKey< ILArfSampl >	m_LArfSamplObjKey {this,"LArfSamplObjKey", "LArfSamplSym","Key to read LArfSampl object"}
SG::ReadCondHandleKey< ILArMinBias >	m_LArMinBiasObjKey {this,"LArMinBiasObjKey","LArMinBiasSym","Key to read LArMinBias object"}
SG::WriteCondHandleKey< LArAutoCorrTotal >	m_LArAutoCorrTotalObjKey {this,"LArAutoCorrTotalObjKey","LArAutoCorrTotal","Key to write LArAutoCorrTotal object"}
Gaudi::Property< bool >	m_NoPile {this,"NoPileUp",false}
Gaudi::Property< bool >	m_isMC {this,"isMC",true}
Gaudi::Property< bool >	m_isSuperCell {this,"isSuperCell",false}
Gaudi::Property< int >	m_Nsamples {this,"Nsamples",5, "Max number of samples to use"}
Gaudi::Property< unsigned int >	m_firstSample {this,"firstSample",0,"First sample to use for in-time event on the full pulse shape"}
Gaudi::Property< int >	m_deltaBunch {this,"deltaBunch",1,"Delta between filled bunches in 25 ns units"}
Gaudi::Property< unsigned >	m_nGains {this,"NGains",3,"Expected number of gains"}
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 26 of file LArAutoCorrTotalCondAlg.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

~LArAutoCorrTotalCondAlg()

LArAutoCorrTotalCondAlg::~LArAutoCorrTotalCondAlg ( )

overridevirtual

Definition at line 16 of file LArAutoCorrTotalCondAlg.cxx.

{}

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.

{
  return 0;
}

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

overridevirtual

Definition at line 43 of file LArAutoCorrTotalCondAlg.cxx.

                                                                         {
 
  // WriteHandle setup
  SG::WriteCondHandle<LArAutoCorrTotal> writeHandle(m_LArAutoCorrTotalObjKey, ctx);
  // So the following should not be called usually?!
  if (writeHandle.isValid()) {
    ATH_MSG_DEBUG(
        "CondHandle "
        << writeHandle.fullKey() << " is already valid.");
    return StatusCode::SUCCESS;
  }
 
  // Identifier helper
  const LArOnlineID_Base *larOnlineID = nullptr;
  if (m_isSuperCell) {
    const LArOnline_SuperCellID *scidhelper;
    ATH_CHECK(detStore()->retrieve(scidhelper, "LArOnline_SuperCellID"));
    larOnlineID = scidhelper; // cast to base-class
  } else {                    // regular cells
    const LArOnlineID *idhelper;
    ATH_CHECK(detStore()->retrieve(idhelper, "LArOnlineID"));
    larOnlineID = idhelper; // cast to base-class
  }
  // Mapping helper
  const LArOnOffIdMapping *larOnOffIdMapping = nullptr;
  SG::ReadCondHandle<LArOnOffIdMapping> larOnOffIdMappingHdl{
    m_LArOnOffIdMappingObjKey, ctx
  };
  larOnOffIdMapping = *larOnOffIdMappingHdl;
  if (larOnOffIdMapping == nullptr) {
    ATH_MSG_ERROR("Failed to retrieve LArOnOffIdMapping object");
  }
 
  // Get pointers to inputs
  SG::ReadCondHandle<ILArShape> ShapeHdl{ m_LArShapeObjKey, ctx };
  // FIXME: should check if handle is properly created and/or check if handle is
  // properly retrieved
  // operator star of a ReadCondHandle returns a const pointer to type T
  const ILArShape *larShape{ *ShapeHdl };
  writeHandle.addDependency(ShapeHdl);
 
  SG::ReadCondHandle<ILArAutoCorr> AutoCorrHdl{ m_LArAutoCorrObjKey, ctx };
  const ILArAutoCorr *larAutoCorr{ *AutoCorrHdl };
  writeHandle.addDependency(AutoCorrHdl);
 
  SG::ReadCondHandle<LArADC2MeV> ADC2MeVHdl{ m_LArADC2MeVObjKey, ctx };
  const LArADC2MeV *larADC2MeV = nullptr;
  larADC2MeV = *ADC2MeVHdl;
  if (larADC2MeV == nullptr) {
    ATH_MSG_ERROR("Failed to retrieve LArADC2MeV object");
    return StatusCode::FAILURE;
  }
  writeHandle.addDependency(ADC2MeVHdl);
 
  // Consider the determinstic objects
  // checking isMC and NoPile again seems very clumsy. How to check if key has
  // already been initialized?
  const ILArNoise *larNoise = nullptr;
  const ILArPedestal *larPedestal = nullptr;
  const ILArfSampl *larfSampl = nullptr;
  const ILArMinBias *larMinBias = nullptr;
 
  if (!m_NoPile) {
    if (m_isMC) {
      SG::ReadCondHandle<ILArNoise> NoiseHdl{ m_LArNoiseObjKey, ctx };
      larNoise = *NoiseHdl;
      writeHandle.addDependency(NoiseHdl);
    } else {
      SG::ReadCondHandle<ILArPedestal> PedestalHdl{ m_LArPedestalObjKey, ctx };
      larPedestal = *PedestalHdl;
      writeHandle.addDependency(PedestalHdl);
    }
 
    SG::ReadCondHandle<ILArfSampl> fSamplHdl{ m_LArfSamplObjKey, ctx };
    larfSampl = *fSamplHdl;
    writeHandle.addDependency(fSamplHdl);
 
    SG::ReadCondHandle<ILArMinBias> MinBiasHdl{ m_LArMinBiasObjKey, ctx };
    larMinBias = *MinBiasHdl;
    writeHandle.addDependency(MinBiasHdl);
  }
 
  ATH_MSG_INFO("IOV found from intersection for AutoCorrTotal object: "
               << writeHandle.getRange());
 
  // make output object
  // dimensions: number of gains x number of channel IDs x elements of
  // AutoCorrTotal
  std::unique_ptr<LArAutoCorrTotal> larAutoCorrTotal =
      std::make_unique<LArAutoCorrTotal>(larOnlineID, larOnOffIdMapping, m_nGains);
 
  int count = 0;
  int count2 = 0;
  int count3 =0;
 
  for (const HWIdentifier chid : larOnlineID->channel_range()) {
    count++;
    const IdentifierHash hid = larOnlineID->channel_Hash(chid);
    // const unsigned int id32 = chid.get_identifier32().get_compact();
 
    if (larOnOffIdMapping->isOnlineConnected(chid)) {
        count2++;
 
      for (size_t igain = 0; igain < m_nGains; igain++) {
        const ILArShape::ShapeRef_t Shape = larShape->Shape(chid, igain);
        const int nsamples_shape = static_cast<int>(Shape.size());
 
        const ILArAutoCorr::AutoCorrRef_t AC =
            larAutoCorr->autoCorr(chid, igain);
 
    if (AC.size() == 0) {
      ATH_MSG_INFO("No ElecCalib AC for channel " << larOnlineID->channel_name(chid) << ", gain "<<igain << ". Skip.");
      continue;
    }
        
    count3++;
        int nsamples_AC_OFC = AC.size() + 1;
 
        if (nsamples_AC_OFC > m_Nsamples) {
          nsamples_AC_OFC = m_Nsamples;
        }
 
        // fix HEC first sample +1 if the firstSample is 0 and nsamples 4
        unsigned int ihecshift = 0;
        if (larOnlineID->isHECchannel(chid) && nsamples_AC_OFC == 4 &&
            m_firstSample == 0) {
          ihecshift = 1;
          // ATH_MSG_DEBUG( "Using firstSample +1 for HEC ChID 0x" << MSG::hex
          // << id << MSG::dec  );
        }
 
        //:::::::::::::::::::::::::::::::
        // NB:
        // nsamples_shape    = number of samples of the Shape function (e.g 32)
        // nsamples_AC_OFC = size of AC matrix & OFC vector (e.g 5 in Atlas)
        //:::::::::::::::::::::::::::::::
        float fSigma2 = 0.;
        if (!m_NoPile) {
          float SigmaNoise;
          if (m_isMC)
            SigmaNoise = larNoise->noise(chid, igain);
          else {
            float RMSpedestal = larPedestal->pedestalRMS(chid, igain);
            if (RMSpedestal > (1.0 + LArElecCalib::ERRORCODE))
              SigmaNoise = RMSpedestal;
            else
              SigmaNoise = 0.; //(we will have the ERROR message below)
          }
          float fSampl = larfSampl->FSAMPL(chid);
          float MinBiasRMS = larMinBias->minBiasRMS(chid);
          if (fSampl != 0)
            MinBiasRMS /= fSampl;
          const auto polynom_adc2mev =
              larADC2MeV->ADC2MEV(hid, igain);
          float Adc2MeV = 0.;
          if (polynom_adc2mev.size() > 0) {
            Adc2MeV = (polynom_adc2mev)[1];
          }
          if (SigmaNoise != 0 && Adc2MeV != 0)
            fSigma2 = pow(MinBiasRMS / (SigmaNoise * Adc2MeV), 2);
 
          if (fSampl == 0 || SigmaNoise == 0 || Adc2MeV == 0) {
            if (m_isMC) {
              ATH_MSG_ERROR(larOnlineID->show_to_string(
                                larOnOffIdMapping->cnvToIdentifier(chid))
                            << "fSampl (" << fSampl << "), SigmaNoise ("
                            << SigmaNoise << ") or Adc2MeV (" << Adc2MeV
                            << ") null "
                            << "=> AutoCorrTotal = only AutoCorr elect. part ");
            }
            fSigma2 = 0.;
          }
           ATH_MSG_DEBUG(chid.get_identifier32().get_compact()
                                            << ")  fSampl (" << fSampl << ") "
                                            << ")  SigmaNoise (" << SigmaNoise << ") "
                                            << ")  Adc2MeV (" << Adc2MeV << ") "
 
                        );
 
          // warning: MinBiasRMS is in MeV (at the scale of the hits)
          //         SigmaNoise is in ADC counts
          //  so MinBiasRMS/fScale and SigmaNoise*Adc2MeV are the same scale
          //  (MeV at the scale of the cells)
        } // end if m_NoPile
 
        // get in vTerms all the possible non trivial N(N-1)/2 terms of the
        // autocorrelation matrix
        int nsize_tot = (nsamples_AC_OFC - 1) * (nsamples_AC_OFC) / 2;
 
        ATH_MSG_DEBUG(chid.get_identifier32().get_compact()
                                          << ")  fSigma2 (" << fSigma2 << ") "
                                          << ")  nsamples_AC_OFC ( " << nsamples_AC_OFC);
        std::vector<float> vTerms;
 
        vTerms.resize(2 * nsize_tot + nsamples_AC_OFC, 0.);
        //:::::::::::::::::::::::::::::::
 
        for (int j1 = 0; j1 < nsamples_AC_OFC - 1; j1++) {
          for (int j2 = j1 + 1; j2 < nsamples_AC_OFC; j2++) {
            int l = abs(j2 - j1) - 1;
            int index =
                j1 * nsamples_AC_OFC - j1 * (j1 + 1) / 2 + j2 - (j1 + 1);
            vTerms[index] = AC[l];
          }
        }
 
        ATH_MSG_DEBUG(chid.get_identifier32().get_compact()
                                          << ")  vTerms[1] (" << vTerms[1] << ") ");
        // 2nd terms :
        for (int j1 = 0; j1 < nsamples_AC_OFC - 1; ++j1) {
          for (int j2 = j1 + 1; j2 < nsamples_AC_OFC; j2++) {
            int index =
                j1 * nsamples_AC_OFC - j1 * (j1 + 1) / 2 + j2 - (j1 + 1);
            float Rij = 0;
            for (int k = 0; k < nsamples_shape; ++k) {
              if ((j2 - j1 + k) >= 0 && (j2 - j1 + k) < nsamples_shape) {
                int ibunch = 0;
                if ((j1 + m_firstSample + ihecshift - k) % m_deltaBunch == 0)
                  ibunch = 1;
                Rij += Shape[k] * Shape[j2 - j1 + k] * ibunch;
              }
            }
            vTerms[nsize_tot + index] = fSigma2 * Rij;
          }
        }
        ATH_MSG_DEBUG(chid.get_identifier32().get_compact()
                                          << ")  vTerms[mid] (" << vTerms[vTerms.size()/2] << ") ");
 
        // 3rd term : RMS of pileup per samples (multiplied by fSigma2)
        for (int j1 = 0; j1 < nsamples_AC_OFC; j1++) {
          float Rms2i = 0;
          for (int k = 0; k < nsamples_shape; ++k) {
            int ibunch = 0;
            if ((j1 + m_firstSample + ihecshift - k) % m_deltaBunch == 0)
              ibunch = 1;
            Rms2i += pow(Shape[k], 2) * ibunch;
          }
          vTerms[2 * nsize_tot + j1] = fSigma2 * Rms2i;
        }
        ATH_MSG_DEBUG(chid.get_identifier32().get_compact()
                                          << ")  vTerms[last] (" << vTerms[vTerms.size()-1] << ") ");
 
 
        // storage
        larAutoCorrTotal->set(hid, igain, vTerms);
 
      } //(loop on gains)
 
    } else // unconnected
      for (unsigned int igain = 0; igain < m_nGains; igain++) {
        unsigned nsize_tot = (m_Nsamples - 1) * (m_Nsamples) + m_Nsamples;
        std::vector<float> empty(nsize_tot, 0.);
        larAutoCorrTotal->set(hid, igain, empty);
      }
  }
 
  ATH_MSG_INFO("LArAutoCorrTotal Ncell " << count);
  ATH_MSG_INFO("LArAutoCorrTotal Ncell * Ngain " << count3);
  ATH_MSG_INFO("LArAutoCorrTotal Nconnected " << count2);
 
  ATH_MSG_INFO("LArAutoCorrTotal record with key" << m_LArAutoCorrTotalObjKey);
 
  ATH_CHECK(writeHandle.record(std::move(larAutoCorrTotal)));
 
 
  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 & 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.

{
  // 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 AthCommonReentrantAlgorithm< Gaudi::Algorithm >::filterPassed ( const EventContext & ctx ) const

inlinevirtualinherited

Definition at line 96 of file AthCommonReentrantAlgorithm.h.

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

initialize()

StatusCode LArAutoCorrTotalCondAlg::initialize ( )

overridevirtual

Definition at line 18 of file LArAutoCorrTotalCondAlg.cxx.

                                               {
  ATH_MSG_DEBUG("initialize " << name());
 
  // ReadCondHandle initialization
  ATH_CHECK(m_LArShapeObjKey.initialize());
  ATH_CHECK(m_LArAutoCorrObjKey.initialize());
  ATH_CHECK(m_LArOnOffIdMappingObjKey.initialize());
  ATH_CHECK( m_LArADC2MeVObjKey.initialize());
 
  ATH_CHECK(m_LArAutoCorrTotalObjKey.initialize());
 
  ATH_CHECK(m_LArNoiseObjKey.initialize(!m_NoPile && m_isMC));
  ATH_CHECK(m_LArPedestalObjKey.initialize(!m_NoPile && !m_isMC));
  ATH_CHECK(m_LArfSamplObjKey.initialize(!m_NoPile));
  ATH_CHECK(m_LArMinBiasObjKey.initialize(!m_NoPile));
 
  // Supercells have only one gain
  if (m_isSuperCell) {
    m_nGains = 1;
  }
 
  ATH_MSG_DEBUG("settings: m_NoPile " << m_NoPile);
  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()

bool AthCommonReentrantAlgorithm< Gaudi::Algorithm >::isClonable ( ) const

overridevirtualinherited

Specify if the algorithm is clonable.

Reentrant algorithms are clonable.

Reimplemented in HiveAlgBase, InDet::GNNSeedingTrackMaker, InDet::SCT_Clusterization, InDet::SiSPGNNTrackMaker, InDet::SiSPSeededTrackFinder, InDet::SiTrackerSpacePointFinder, ITkPixelCablingAlg, ITkStripCablingAlg, RoIBResultToxAOD, SCT_ByteStreamErrorsTestAlg, SCT_CablingCondAlgFromCoraCool, SCT_CablingCondAlgFromText, SCT_ConditionsParameterTestAlg, SCT_ConditionsSummaryTestAlg, SCT_ConfigurationConditionsTestAlg, 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, and Simulation::BeamEffectsAlg.

Definition at line 68 of file AthCommonReentrantAlgorithm.cxx.

{
  // Reentrant algorithms are clonable.
  return true;
}

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.

{ 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 AthCommonReentrantAlgorithm< Gaudi::Algorithm >::setFilterPassed ( bool state, const EventContext & ctx ) const

inlinevirtualinherited

Definition at line 100 of file AthCommonReentrantAlgorithm.h.

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

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.

{
  return BaseAlg::sysExecute (ctx);
}

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.

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

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_deltaBunch

Gaudi::Property<int> LArAutoCorrTotalCondAlg::m_deltaBunch {this,"deltaBunch",1,"Delta between filled bunches in 25 ns units"}

private

Definition at line 56 of file LArAutoCorrTotalCondAlg.h.

{this,"deltaBunch",1,"Delta between filled bunches in 25 ns units"};

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_firstSample

Gaudi::Property<unsigned int> LArAutoCorrTotalCondAlg::m_firstSample {this,"firstSample",0,"First sample to use for in-time event on the full pulse shape"}

private

Definition at line 55 of file LArAutoCorrTotalCondAlg.h.

{this,"firstSample",0,"First sample to use for in-time event on the full pulse shape"};

m_isMC

Gaudi::Property<bool> LArAutoCorrTotalCondAlg::m_isMC {this,"isMC",true}

private

Definition at line 52 of file LArAutoCorrTotalCondAlg.h.

{this,"isMC",true};

m_isSuperCell

Gaudi::Property<bool> LArAutoCorrTotalCondAlg::m_isSuperCell {this,"isSuperCell",false}

private

Definition at line 53 of file LArAutoCorrTotalCondAlg.h.

{this,"isSuperCell",false};

m_LArADC2MeVObjKey

SG::ReadCondHandleKey<LArADC2MeV> LArAutoCorrTotalCondAlg::m_LArADC2MeVObjKey {this,"LArADC2MeVObjKey","LArADC2MeV","SG key of the resulting LArADC2MeV object"}

private

Definition at line 38 of file LArAutoCorrTotalCondAlg.h.

{this,"LArADC2MeVObjKey","LArADC2MeV","SG key of the resulting LArADC2MeV object"};

m_LArAutoCorrObjKey

SG::ReadCondHandleKey<ILArAutoCorr> LArAutoCorrTotalCondAlg::m_LArAutoCorrObjKey {this,"LArAutoCorrObjKey", "LArAutoCorrSym","Key to read LArAutoCorr object"}

private

Definition at line 43 of file LArAutoCorrTotalCondAlg.h.

{this,"LArAutoCorrObjKey", "LArAutoCorrSym","Key to read LArAutoCorr object"};

m_LArAutoCorrTotalObjKey

SG::WriteCondHandleKey<LArAutoCorrTotal> LArAutoCorrTotalCondAlg::m_LArAutoCorrTotalObjKey {this,"LArAutoCorrTotalObjKey","LArAutoCorrTotal","Key to write LArAutoCorrTotal object"}

private

Definition at line 49 of file LArAutoCorrTotalCondAlg.h.

{this,"LArAutoCorrTotalObjKey","LArAutoCorrTotal","Key to write LArAutoCorrTotal object"};

m_LArfSamplObjKey

SG::ReadCondHandleKey<ILArfSampl> LArAutoCorrTotalCondAlg::m_LArfSamplObjKey {this,"LArfSamplObjKey", "LArfSamplSym","Key to read LArfSampl object"}

private

Definition at line 46 of file LArAutoCorrTotalCondAlg.h.

{this,"LArfSamplObjKey", "LArfSamplSym","Key to read LArfSampl object"};

m_LArMinBiasObjKey

SG::ReadCondHandleKey<ILArMinBias> LArAutoCorrTotalCondAlg::m_LArMinBiasObjKey {this,"LArMinBiasObjKey","LArMinBiasSym","Key to read LArMinBias object"}

private

Definition at line 47 of file LArAutoCorrTotalCondAlg.h.

{this,"LArMinBiasObjKey","LArMinBiasSym","Key to read LArMinBias object"};

m_LArNoiseObjKey

SG::ReadCondHandleKey<ILArNoise> LArAutoCorrTotalCondAlg::m_LArNoiseObjKey {this,"LArNoiseObjKey", "LArNoiseSym", "Key to read LArNoise object"}

private

Definition at line 44 of file LArAutoCorrTotalCondAlg.h.

{this,"LArNoiseObjKey", "LArNoiseSym", "Key to read LArNoise object"};

m_LArOnOffIdMappingObjKey

SG::ReadCondHandleKey<LArOnOffIdMapping> LArAutoCorrTotalCondAlg::m_LArOnOffIdMappingObjKey {this,"LArOnOffIdMappingObjKey","LArOnOffIdMap","SG key of LArOnOffIdMapping object"}

private

Definition at line 40 of file LArAutoCorrTotalCondAlg.h.

{this,"LArOnOffIdMappingObjKey","LArOnOffIdMap","SG key of LArOnOffIdMapping object"};

m_LArPedestalObjKey

SG::ReadCondHandleKey<ILArPedestal> LArAutoCorrTotalCondAlg::m_LArPedestalObjKey {this,"LArPedestalObjKey", "LArPedestal","Key to read LArPedestal object"}

private

Definition at line 45 of file LArAutoCorrTotalCondAlg.h.

{this,"LArPedestalObjKey", "LArPedestal","Key to read LArPedestal object"};

m_LArShapeObjKey

SG::ReadCondHandleKey<ILArShape> LArAutoCorrTotalCondAlg::m_LArShapeObjKey {this,"LArShapeObjKey", "LArShapeSym","Key to read LArShape object"}

private

Definition at line 42 of file LArAutoCorrTotalCondAlg.h.

{this,"LArShapeObjKey", "LArShapeSym","Key to read LArShape object"};

m_nGains

Gaudi::Property<unsigned> LArAutoCorrTotalCondAlg::m_nGains {this,"NGains",3,"Expected number of gains"}

private

Definition at line 58 of file LArAutoCorrTotalCondAlg.h.

{this,"NGains",3,"Expected number of gains"};

m_NoPile

Gaudi::Property<bool> LArAutoCorrTotalCondAlg::m_NoPile {this,"NoPileUp",false}

private

Definition at line 51 of file LArAutoCorrTotalCondAlg.h.

{this,"NoPileUp",false};

m_Nsamples

Gaudi::Property<int> LArAutoCorrTotalCondAlg::m_Nsamples {this,"Nsamples",5, "Max number of samples to use"}

private

Definition at line 54 of file LArAutoCorrTotalCondAlg.h.

{this,"Nsamples",5, "Max number of samples to use"};

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:

• LArAutoCorrTotalCondAlg.h
• LArAutoCorrTotalCondAlg.cxx