precedence::Duration Struct Reference

#include </builds/gaudi/Gaudi/GaudiHive/src/PRGraph/PrecedenceRulesGraph.h>

Collaboration diagram for precedence::Duration:

Public Member Functions
	Duration (const EventSlot &slot, SmartIF< ISvcLocator > &svcLocator)
std::string	operator() (const AlgoProps &props) const
std::string	operator() (const DecisionHubProps &) const
std::string	operator() (const DataProps &) const

Public Attributes
const EventSlot &	m_slot
SmartIF< ITimelineSvc >	m_timelineSvc

Detailed Description

Definition at line 339 of file PrecedenceRulesGraph.h.

Constructor & Destructor Documentation

Duration()

precedence::Duration::Duration ( const EventSlot & slot, SmartIF< ISvcLocator > & svcLocator )

inline

Definition at line 340 of file PrecedenceRulesGraph.h.

        : m_slot( slot ), m_timelineSvc( svcLocator->service<ITimelineSvc>( "TimelineSvc", false ) ) {
      SmartIF<IMessageSvc> msgSvc{ svcLocator };
      MsgStream            log{ msgSvc, "Duration.Getter" };
 
      // Figure if we can discover the algorithm timings
      if ( !m_timelineSvc.isValid() )
        log << MSG::WARNING << "Failed to locate the TimelineSvc: no way to add "
            << "algorithm's runtimes to the TTT dumps" << endmsg;
    }

Member Function Documentation

operator()() [1/3]

std::string precedence::Duration::operator() ( const AlgoProps & props ) const

inline

Definition at line 351 of file PrecedenceRulesGraph.h.

                                                         {
 
      std::string time;
 
      if ( m_timelineSvc.isValid() ) {
 
        TimelineEvent te;
        te.algorithm = props.m_name;
        te.slot      = m_slot.eventContext->slot();
        te.event     = m_slot.eventContext->evt();
 
        // Calculate duration that is the difference between stop and and start for given algorithm. Asynchronous
        // algorithms will have multiple TimelineEvents, so the start should be taken from the first and the end from
        // the last.
        m_timelineSvc->getFirstMatching( te );
        auto start = te.start;
        m_timelineSvc->getLastMatching( te );
        auto end = te.end;
        time     = std::to_string( std::chrono::duration_cast<std::chrono::nanoseconds>( end - start ).count() );
      }
 
      return time;
    }

operator()() [2/3]

std::string precedence::Duration::operator() ( const DataProps & ) const

inline

Definition at line 377 of file PrecedenceRulesGraph.h.

{ return ""; }

operator()() [3/3]

std::string precedence::Duration::operator() ( const DecisionHubProps & ) const

inline

Definition at line 375 of file PrecedenceRulesGraph.h.

{ return ""; }

Member Data Documentation

m_slot

const EventSlot& precedence::Duration::m_slot

Definition at line 379 of file PrecedenceRulesGraph.h.

m_timelineSvc

SmartIF<ITimelineSvc> precedence::Duration::m_timelineSvc

Definition at line 380 of file PrecedenceRulesGraph.h.

---

The documentation for this struct was generated from the following file:

• GaudiHive/src/PRGraph/PrecedenceRulesGraph.h