SCT_CablingCondAlgFromCoraCool Class Reference

Condition algorithm which fills the SCT Cabling from the database, using CoraCool. More...

#include <SCT_CablingCondAlgFromCoraCool.h>

Inheritance diagram for SCT_CablingCondAlgFromCoraCool:

Collaboration diagram for SCT_CablingCondAlgFromCoraCool:

Public Member Functions
	SCT_CablingCondAlgFromCoraCool (const std::string &name, ISvcLocator *svc)
virtual	~SCT_CablingCondAlgFromCoraCool ()=default
virtual StatusCode	initialize () override
virtual StatusCode	execute (const EventContext &ctx) const override
virtual StatusCode	finalize () override
virtual bool	isClonable () const override
	Make this algorithm clonable.
virtual bool	isReEntrant () const override
	Avoid scheduling algorithm multiple times.
virtual StatusCode	sysInitialize () override
	Override sysInitialize.
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
bool	insert (const IdentifierHash &hash, const SCT_OnlineId &onlineId, const SCT_SerialNumber &sn, SCT_CablingData *data) const
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
SG::ReadCondHandleKey< CondAttrListVec >	m_readKeyRod {this, "ReadKeyRod", "/SCT/DAQ/Config/ROD", "Key of input (raw) conditions folder of Rods"}
	Input conditions folders.
SG::ReadCondHandleKey< CondAttrListVec >	m_readKeyRodMur {this, "ReadKeyRodMur", "/SCT/DAQ/Config/RODMUR", "Key of input (raw) conditions folder of RodMurs"}
SG::ReadCondHandleKey< CondAttrListVec >	m_readKeyMur {this, "ReadKeyMur", "/SCT/DAQ/Config/MUR", "Key of input (raw) conditions folder of Murs"}
SG::ReadCondHandleKey< CondAttrListVec >	m_readKeyGeo {this, "ReadKeyGeo", "/SCT/DAQ/Config/Geog", "Key of input (raw) conditions folder of Geography"}
SG::WriteCondHandleKey< SCT_CablingData >	m_writeKey {this, "WriteKey", "SCT_CablingData", "Key of output (derived) conditions data"}
	Output condition data.
const SCT_ID *	m_idHelper {nullptr}
DataObjIDColl	m_extendedExtraObjects
	Extra output dependency collection, extended by AthAlgorithmDHUpdate to add symlinks.
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default)
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default)
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared

Detailed Description

Condition algorithm which fills the SCT Cabling from the database, using CoraCool.

Definition at line 40 of file SCT_CablingCondAlgFromCoraCool.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

SCT_CablingCondAlgFromCoraCool()

SCT_CablingCondAlgFromCoraCool::SCT_CablingCondAlgFromCoraCool	(	const std::string &	name,
		ISvcLocator *	svc )

Definition at line 169 of file SCT_CablingCondAlgFromCoraCool.cxx.

                                                                                                             :
  AthCondAlgorithm(name, pSvcLocator)
{
}

~SCT_CablingCondAlgFromCoraCool()

virtual SCT_CablingCondAlgFromCoraCool::~SCT_CablingCondAlgFromCoraCool ( )

virtualdefault

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

overridevirtual

Get the geography table which gives where the MURs (harnesses, for endcap) really are. In fact for the barrel its obvious, so only extract the endcap ones

get the RODMUR which gives where the individual MURs are; this is an intermediate step, so make a temporary data structure.

Definition at line 218 of file SCT_CablingCondAlgFromCoraCool.cxx.

                                                                     {
  // Write Cond Handle
  SG::WriteCondHandle<SCT_CablingData> writeHandle{m_writeKey, ctx};
  if (writeHandle.isValid()) {
    ATH_MSG_DEBUG("CondHandle " << writeHandle.fullKey() << " is already valid."
                  << ". In theory this should not be called, but may happen"
                  << " if multiple concurrent events are being processed out of order.");
    return StatusCode::SUCCESS;
  }
 
  // Determine the folders are Run2 or Run1
  bool isRun2{m_readKeyRod.key()==rodFolderName2};
 
  // let's get the ROD AttrLists
  SG::ReadCondHandle<CondAttrListVec> readHandleRod{m_readKeyRod, ctx};
  const CondAttrListVec* pRod{*readHandleRod};
  if (pRod==nullptr) {
    ATH_MSG_FATAL("Could not find ROD configuration data: " << m_readKeyRod.key());
    return StatusCode::FAILURE;
  }
  // build rod-rob map, and store the crate/slot to RobId mapping
  CondAttrListVec::const_iterator rodIt{pRod->begin()};
  CondAttrListVec::const_iterator last_rod{pRod->end()};
  using IntMap = std::map<int, int>;
  IntMap slotMap;
  //there are now 16 crate slots, but they may be numbered (in the DB) as some non-monotonic sequence
  //so here we take whatever is in the database and map it onto numbers 0-15
  {//scope this calculation, only slotMap should emerge
    //map slots onto 0-15
    using S = std::set<int>;
    S slots;
    for (; rodIt != last_rod; ++rodIt) {
      //type of 'slot' changed between COMP200 and CONDBR2:
      if (isRun2) {
        slots.insert(int(rodIt->second["slot"].data<unsigned char>())); //all but 15 inserts will fail, and these 15 should be sorted
      } else {
        slots.insert(int(rodIt->second["slot"].data<short>())); //all but 15 inserts will fail, and these 15 should be sorted
      }
    }
    int counter{0};
    for (S::const_iterator i{slots.begin()};i != slots.end();++i) {
      slotMap[*i]=counter++;
    }
    ATH_MSG_INFO("Number of SCT rod slots inserted: " << counter);
  }
  IntMap crateSlot2RobMap; //local data structure
  bool allInsertsSucceeded{true};
  rodIt=pRod->begin();
  int nrods{0};
  std::set<int> tempRobSet;
  for (; rodIt != last_rod; ++rodIt) {
    const coral::AttributeList& rodAttributes{rodIt->second};
    int rob{rodAttributes["ROB"].data<int>()};
    if (not tempRobSet.insert(rob).second) ATH_MSG_WARNING("Duplicate rob? :" << std::hex << rob << std::dec);
    int crate{isRun2 ? static_cast<int>(rodAttributes["crate"].data<unsigned char>()) : (rodAttributes["crate"].data<int>())};
    int crateSlot{isRun2 ? static_cast<int>(rodAttributes["slot"].data<unsigned char>()) : static_cast<int>(rodAttributes["slot"].data<short>())};
    //see note in header; these may be 0-15, but not necessarily, so we need to map these onto 0-15
    IntMap::const_iterator pSlot{slotMap.find(crateSlot)};
    int slot{(pSlot==slotMap.end()) ? -1 : pSlot->second};
    if (slot==-1) ATH_MSG_ERROR("Failed to find a crate slot in the crate map");
    int rodPosition{(crate * slotsPerCrate) +slot};//generate identifier using crate and slot for use later
    //use the return type of insert which is a pair with the second component(bool) indicating whether the insert was successful
    bool thisInsertSucceeded{crateSlot2RobMap.insert(IntMap::value_type(rodPosition, rob)).second};
    if (not thisInsertSucceeded) {
      ATH_MSG_WARNING("Insert (rodPosition, rob) " << rodPosition << ", " << rob << " failed.");
      ATH_MSG_INFO("map(rod position) is already " << crateSlot2RobMap[rodPosition]);
      ATH_MSG_INFO("crate, slot, slots per crate: " << crate << ", " << slot << ", " << slotsPerCrate);
    }
    allInsertsSucceeded = thisInsertSucceeded and allInsertsSucceeded;
    ++nrods;
  }
  ATH_MSG_INFO(nrods << " rods entered, of which " << tempRobSet.size() << " are unique.");
  
  if (not allInsertsSucceeded) ATH_MSG_WARNING("Some Rod-Rob map inserts failed.");

  IntMap geoMurMap;
  SG::ReadCondHandle<CondAttrListVec> readHandleGeo{m_readKeyGeo, ctx};
  const CondAttrListVec* pGeo{*readHandleGeo};
  if (pGeo==nullptr) {
    ATH_MSG_FATAL("Could not find Geog configuration data: " << m_readKeyGeo.key());
    return StatusCode::FAILURE;
  }
  CondAttrListVec::const_iterator geoIt{pGeo->begin()};
  CondAttrListVec::const_iterator last_geo{pGeo->end()};
  for (;geoIt != last_geo;++geoIt) {
    const coral::AttributeList& geoAttributes{geoIt->second};
    int mur{isRun2 ? static_cast<int>(geoAttributes["MUR"].data<unsigned int>()) : (geoAttributes["MUR"].data<int>())};
    int position{isRun2 ? static_cast<int>(geoAttributes["position"].data<short>()) : (geoAttributes["position"].data<int>())};
    if (mur > 10000) geoMurMap[mur]=position; //only for endcap case
  }

  IntMap murPositionMap;
  SG::ReadCondHandle<CondAttrListVec> readHandleRodMur{m_readKeyRodMur, ctx};
  const CondAttrListVec* pRodMur{*readHandleRodMur};
  if (pRodMur==nullptr) {
    ATH_MSG_FATAL("Could not find RodMur configuration data: " << m_readKeyRodMur.key());
    return StatusCode::FAILURE;
  }
  CondAttrListVec::const_iterator rodMurIt{pRodMur->begin()};
  CondAttrListVec::const_iterator last_rodMur{pRodMur->end()};
  allInsertsSucceeded = true;
  std::set<int> tempRobSet2;
  for (; rodMurIt!=last_rodMur; ++rodMurIt) {
    const coral::AttributeList& rodMurAttributes{rodMurIt->second};
    int mur{isRun2 ? static_cast<int>(rodMurAttributes["MUR"].data<unsigned int>()) : (rodMurAttributes["MUR"].data<int>())};
    int crate{isRun2 ? static_cast<int>(rodMurAttributes["crate"].data<unsigned char>()) : (rodMurAttributes["crate"].data<int>())};
    int crateSlot{isRun2 ? static_cast<int>(rodMurAttributes["rod"].data<unsigned char>()) : (rodMurAttributes["rod"].data<int>())};//slot is int16, others are int32
    //map slot onto 0-15 range
    IntMap::const_iterator pSlot{slotMap.find(crateSlot)};
    int slot{(pSlot==slotMap.end()) ? -1 : pSlot->second};
    if (slot==-1) ATH_MSG_ERROR("Failed to find a crate slot in the crate map");
    //
    int order{isRun2 ? static_cast<int>(rodMurAttributes["position"].data<unsigned char>()) : (rodMurAttributes["position"].data<int>())};
    int fibreOrder{((((crate * slotsPerCrate) + slot ) * mursPerRod) + order) * fibresPerMur};
    bool thisInsertSucceeded{murPositionMap.insert(IntMap::value_type(mur, fibreOrder)).second};
    if (not thisInsertSucceeded) ATH_MSG_WARNING("Insert (mur, fibre) " << mur << ", " << fibreOrder << " failed.");
    allInsertsSucceeded = thisInsertSucceeded and allInsertsSucceeded;
  }
  if (not allInsertsSucceeded) ATH_MSG_WARNING("Some MUR-position map inserts failed.");
 
  // let's get the MUR AttrLists
  SG::ReadCondHandle<CondAttrListVec> readHandleMur{m_readKeyMur, ctx};
  const CondAttrListVec* pMur{*readHandleMur};
  if (pMur==nullptr) {
    ATH_MSG_FATAL("Could not find ROD configuration data: " << m_readKeyMur.key());
    return StatusCode::FAILURE;
  }
 
  // Add dependency
  writeHandle.addDependency(readHandleRod);
  writeHandle.addDependency(readHandleRodMur);
  writeHandle.addDependency(readHandleMur);
  writeHandle.addDependency(readHandleGeo);
 
  // Construct the output Cond Object and fill it in
  std::unique_ptr<SCT_CablingData> writeCdo{std::make_unique<SCT_CablingData>()};
 
  //build identifier map
  CondAttrListVec::const_iterator murIt{pMur->begin()};
  CondAttrListVec::const_iterator last_mur{pMur->end()};
  int numEntries{0};
  std::set<int> onlineIdSet, robSet;
  std::set<Identifier> offlineIdSet;
  long long lastSerialNumber{0};
  for (; murIt != last_mur; ++murIt) {
    const coral::AttributeList& murAttributes{murIt->second};
    int mur{isRun2 ? static_cast<int>(murAttributes["MUR"].data<unsigned int>()) : (murAttributes["MUR"].data<int>())};
    bool nullMur{murAttributes["moduleID"].isNull() or murAttributes["module"].isNull()};
    if (9999 == mur or nullMur) continue;
    int fibreInMur{ (isRun2 ? static_cast<int>(murAttributes["module"].data<unsigned char>()) : (murAttributes["module"].data<int>()) ) - 1};
    long long sn{murAttributes["moduleID"].data<long long>()};
    if (lastSerialNumber==sn) { //old version (<2.6) of Coral/Cool doesn't detect a 'null' value, instead it simply repeats the last known value.
      continue;
    }
    lastSerialNumber=sn;
    std::string snString{std::to_string(sn)};
    IntMap::const_iterator pFibre{murPositionMap.find(mur)};
    int fibreOffset{-1};
    if (pFibre==murPositionMap.end()) {
      ATH_MSG_WARNING("Failed to find an MUR position in the cabling");
    } else {
      fibreOffset = pFibre->second;
    }
    int encodedCrateSlot{fibreOffset / (fibresPerMur * mursPerRod)};
    int rob{-1};
    IntMap::const_iterator pCrate{crateSlot2RobMap.find(encodedCrateSlot)};
    if (pCrate == crateSlot2RobMap.end()) {
      ATH_MSG_WARNING("Failed to find a crate slot in the cabling, slot " << encodedCrateSlot);
    } else {
      rob=pCrate->second;
      tempRobSet2.insert(rob);
    }
    
    //cheat to get the geography: use the MUR notation
    int bec{0},eta{0}, layer{0}, phi{0};
    std::pair<int, int> etaPhiPair;
    int harnessPosition{-1};
    if (mur > 10000) { //its an endcap, so has 5 digits in the mur
      layer = (mur/10000) - 1; //first digit is the disk number, 1-9, so subtract 1
      bec = (((mur /1000) % 2)==0) ? ENDCAP_A : ENDCAP_C; //bec is +2 for A if second digit is 0
      int quadrant{(mur/100) % 10}; //3rd digit is quadrant
      //eta = ((mur /10) % 10);  //eta of the harness is the 4th digit
      //int harness = (mur % 10) -1; //last digit is harness, 1 or 2
      harnessPosition=geoMurMap[mur];
      etaPhiPair= convertToAthenaCoords(bec,layer, quadrant,  harnessPosition, fibreInMur);
      eta=etaPhiPair.first;
      phi=etaPhiPair.second;
    } else {
      bec = 0;
      layer= (mur /1000) - 3;//first digit is layer, 3-6
      phi= (mur % 100) - 1; //lower 2 digits are phi check whether this wraps around!
      eta = (((mur / 100) % 10) *2 -1) * (fibreInMur+1);//second digit gives eta sign, 0-> -, 1-> +
    }
    int rxLink[2];
    if (isRun2) {
      rxLink[0]=murAttributes["rx0Fibre"].data<unsigned char>();rxLink[1]= murAttributes["rx1Fibre"].data<unsigned char>();
    } else {
      rxLink[0]=murAttributes["rx0Fibre"].data<int>();rxLink[1]=murAttributes["rx1Fibre"].data<int>();
    }
    if (not (validLinkNumber(rxLink[0]) and validLinkNumber(rxLink[1]))) {
      ATH_MSG_WARNING("Invalid link number in database in one of these db entries: rx0Fibre=" << rxLink[0] << ", rx1Fibre=" << rxLink[1]);
      continue;
    }
    //normal ordering is like rx0=0, rx1=1; i.e. odd links in rx1.
    bool normalOrdering{true};
    if (rxLink[0] != disabledFibre) { //if the first link is not disabled, use that and check its even
      normalOrdering=(rxLink[0] % 2)==0;
    } else { //...otherwise use link1 and check its odd
      normalOrdering=(rxLink[1] % 2)==1;
    }
    
    int possibleLinks[2]{0,0};
    if (normalOrdering) {
      possibleLinks[0]=(rxLink[0]!=disabledFibre) ? rxLink[0] : (rxLink[1]-1);
      possibleLinks[1]=(rxLink[1]!=disabledFibre) ? rxLink[1] : (rxLink[0]+1);
    } else {
      possibleLinks[0]=(rxLink[0]!=disabledFibre) ? rxLink[0] : (rxLink[1]+1);
      possibleLinks[1]=(rxLink[1]!=disabledFibre) ? rxLink[1] : (rxLink[0]-1);
    }
    for (int side{0}; side!=2; ++side) {
      if ((-1==phi) and (-1==eta)) {
        ATH_MSG_WARNING("Invalid eta, phi..skipping insertion to map for module " << snString << " (may be already present in map)");
        continue;
      }
      Identifier offlineId{m_idHelper->wafer_id(bec,layer,phi,eta,side)};
      int link{rxLink[side]};
      if (defaultLink==link) {
        link = (fibreOffset % fibresPerRod) + fibreInMur*2 + side;
      }
      if (disabledFibre==link) {
        int otherLink{rxLink[1-side]};
        if (otherLink==possibleLinks[0]) link=possibleLinks[1];
        if (otherLink==possibleLinks[1]) link=possibleLinks[0];
      }
      bool flippedModule{isOdd(side)!=isOdd(link)};
      if (flippedModule) {
        link = (link==possibleLinks[0]) ? possibleLinks[1] : possibleLinks[0];
      }
      int onlineId{(rob & 0xFFFFFF)|(link << 24)};
      //check uniqueness
      if (not onlineIdSet.insert(onlineId).second) ATH_MSG_WARNING("Insert of online Id : " << onlineId << " failed.");
      if (not offlineIdSet.insert(offlineId).second) {
        ATH_MSG_WARNING("Insert of offline Id : " << offlineId << " failed.");
        ATH_MSG_WARNING(bec << " " << layer << " " << phi << " " << eta << " " << side);
        ATH_MSG_INFO("MUR, position " << mur << ", " << harnessPosition);
      } 
      IdentifierHash offlineIdHash{m_idHelper->wafer_hash(offlineId)};
      insert(offlineIdHash, onlineId, SCT_SerialNumber(sn), writeCdo.get());
      numEntries++;
    }
  }
 
  if (writeHandle.record(std::move(writeCdo)).isFailure()) {
    ATH_MSG_FATAL("Could not record SCT_CablingData " << writeHandle.key() 
                  << " with EventRange " << writeHandle.getRange()
                  << " into Conditions Store");
    return StatusCode::FAILURE;
  }
  ATH_MSG_INFO("recorded new CDO " << writeHandle.key() << " with range " << writeHandle.getRange() << " into Conditions Store");
 
  const int robLo{*(tempRobSet2.cbegin())};
  const int robHi{*(tempRobSet2.crbegin())};
  ATH_MSG_INFO(numEntries << " entries were made to the identifier map.");
  ATH_MSG_INFO(tempRobSet2.size() << " unique rob ids were used, spanning 0x" << std::hex << robLo << " to 0x" << robHi << std::dec);
  if (tempRobSet.size() != tempRobSet2.size()) {
    ATH_MSG_WARNING("The following existing rods were not inserted : ");
    std::cout << std::hex;
    std::set_difference(tempRobSet.cbegin(), tempRobSet.cend(),
                        tempRobSet2.cbegin(), tempRobSet2.cend(),
                        std::ostream_iterator<int>(std::cout,", "));
    std::cout << std::dec << std::endl;
  }
  tempRobSet.clear();
  return (numEntries==0) ? (StatusCode::FAILURE) : (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();
  }

finalize()

StatusCode SCT_CablingCondAlgFromCoraCool::finalize ( )

overridevirtual

Definition at line 212 of file SCT_CablingCondAlgFromCoraCool.cxx.

                                         {
  return StatusCode::SUCCESS;
}

initialize()

StatusCode SCT_CablingCondAlgFromCoraCool::initialize ( )

overridevirtual

Definition at line 176 of file SCT_CablingCondAlgFromCoraCool.cxx.

                                           {
  // Check conditions folder names
  if((m_readKeyRod.key()!=rodFolderName) and (m_readKeyRod.key()!=rodFolderName2)) {
    ATH_MSG_FATAL(m_readKeyRod.key() << " is incorrect.");
    return StatusCode::FAILURE;
  }
  if((m_readKeyRodMur.key()!=rodMurFolderName) and (m_readKeyRodMur.key()!=rodMurFolderName2)) {
    ATH_MSG_FATAL(m_readKeyRodMur.key() << " is incorrect.");
    return StatusCode::FAILURE;
  }
  if((m_readKeyMur.key()!=murFolderName) and (m_readKeyMur.key()!=murFolderName2)) {
    ATH_MSG_FATAL(m_readKeyMur.key() << " is incorrect.");
    return StatusCode::FAILURE;
  }
  if((m_readKeyGeo.key()!=geoFolderName) and (m_readKeyGeo.key()!=geoFolderName2)) {
    ATH_MSG_FATAL(m_readKeyGeo.key() << " is incorrect.");
    return StatusCode::FAILURE;
  }
 
  // SCT_ID
  ATH_CHECK(detStore()->retrieve(m_idHelper, "SCT_ID"));
 
  // Read Cond Handle
  ATH_CHECK(m_readKeyRod.initialize());
  ATH_CHECK(m_readKeyRodMur.initialize());
  ATH_CHECK(m_readKeyMur.initialize());
  ATH_CHECK(m_readKeyGeo.initialize());
 
  // Write Cond Handle
  ATH_CHECK(m_writeKey.initialize());
 
  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.

insert()

bool SCT_CablingCondAlgFromCoraCool::insert ( const IdentifierHash & hash, const SCT_OnlineId & onlineId, const SCT_SerialNumber & sn, SCT_CablingData * data ) const

private

Definition at line 504 of file SCT_CablingCondAlgFromCoraCool.cxx.

                                                                                                                                                        {
  if (not sn.isWellFormed()) {
    ATH_MSG_FATAL("Serial number is not in correct format");
    return false;
  }
  if (not hash.is_valid()) {
    ATH_MSG_FATAL("Invalid hash: " << hash);
    return false;
  }
  // Check if the pointer of derived conditions object is valid.
  if (data==nullptr) {
    ATH_MSG_FATAL("Pointer of derived conditions object is null");
    return false;
  }
  
  if (not data->setHashForOnlineId(hash, onlineId)) return false;
  if (not data->setOnlineIdForHash(onlineId, hash)) return false;
 
  bool successfulInsert{data->setHashForSerialNumber(hash, sn)};
  successfulInsert &= data->setSerialNumberForHash(sn, hash);
  // in this form, the data->getHashEntries() will be half the number of hashes
  if (successfulInsert) {
    data->setRod(onlineId.rod()); //move this here so insertion only happens for valid onlineId, hash
  }
  return true;
}

isClonable()

virtual bool SCT_CablingCondAlgFromCoraCool::isClonable ( ) const

inlineoverridevirtual

Make this algorithm clonable.

Reimplemented from AthCommonReentrantAlgorithm< Gaudi::Algorithm >.

Definition at line 49 of file SCT_CablingCondAlgFromCoraCool.h.

{ 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_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_idHelper

const SCT_ID* SCT_CablingCondAlgFromCoraCool::m_idHelper {nullptr}

private

Definition at line 63 of file SCT_CablingCondAlgFromCoraCool.h.

{nullptr};

m_readKeyGeo

SG::ReadCondHandleKey<CondAttrListVec> SCT_CablingCondAlgFromCoraCool::m_readKeyGeo {this, "ReadKeyGeo", "/SCT/DAQ/Config/Geog", "Key of input (raw) conditions folder of Geography"}

private

Definition at line 59 of file SCT_CablingCondAlgFromCoraCool.h.

{this, "ReadKeyGeo", "/SCT/DAQ/Config/Geog", "Key of input (raw) conditions folder of Geography"};

m_readKeyMur

SG::ReadCondHandleKey<CondAttrListVec> SCT_CablingCondAlgFromCoraCool::m_readKeyMur {this, "ReadKeyMur", "/SCT/DAQ/Config/MUR", "Key of input (raw) conditions folder of Murs"}

private

Definition at line 58 of file SCT_CablingCondAlgFromCoraCool.h.

{this, "ReadKeyMur", "/SCT/DAQ/Config/MUR", "Key of input (raw) conditions folder of Murs"};

m_readKeyRod

SG::ReadCondHandleKey<CondAttrListVec> SCT_CablingCondAlgFromCoraCool::m_readKeyRod {this, "ReadKeyRod", "/SCT/DAQ/Config/ROD", "Key of input (raw) conditions folder of Rods"}

private

Input conditions folders.

Definition at line 56 of file SCT_CablingCondAlgFromCoraCool.h.

{this, "ReadKeyRod", "/SCT/DAQ/Config/ROD", "Key of input (raw) conditions folder of Rods"};

m_readKeyRodMur

SG::ReadCondHandleKey<CondAttrListVec> SCT_CablingCondAlgFromCoraCool::m_readKeyRodMur {this, "ReadKeyRodMur", "/SCT/DAQ/Config/RODMUR", "Key of input (raw) conditions folder of RodMurs"}

private

Definition at line 57 of file SCT_CablingCondAlgFromCoraCool.h.

{this, "ReadKeyRodMur", "/SCT/DAQ/Config/RODMUR", "Key of input (raw) conditions folder of RodMurs"};

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_writeKey

SG::WriteCondHandleKey<SCT_CablingData> SCT_CablingCondAlgFromCoraCool::m_writeKey {this, "WriteKey", "SCT_CablingData", "Key of output (derived) conditions data"}

private

Output condition data.

Definition at line 61 of file SCT_CablingCondAlgFromCoraCool.h.

{this, "WriteKey", "SCT_CablingData", "Key of output (derived) conditions data"};

---

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

• SCT_CablingCondAlgFromCoraCool.h
• SCT_CablingCondAlgFromCoraCool.cxx