concurrency::DataReadyPromoter Class Reference

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

Inheritance diagram for concurrency::DataReadyPromoter:

Collaboration diagram for concurrency::DataReadyPromoter:

Public Member Functions
	DataReadyPromoter (EventSlot &slot, const Cause &cause, bool ifTrace=false)
	Constructor.
bool	visitEnter (AlgorithmNode &) const override
bool	visit (AlgorithmNode &) override
bool	visitEnter (DataNode &) const override
bool	visit (DataNode &) override
bool	visitEnter (ConditionNode &) const override
bool	visit (ConditionNode &) override
virtual bool	visit (DecisionNode &)
virtual bool	visitEnter (DecisionNode &) const
Public Member Functions inherited from concurrency::IGraphVisitor
virtual	~IGraphVisitor ()=default
virtual void	reset ()

Public Attributes
EventSlot *	m_slot
Cause	m_cause
bool	m_trace

Detailed Description

Definition at line 20 of file Promoters.h.

Constructor & Destructor Documentation

DataReadyPromoter()

concurrency::DataReadyPromoter::DataReadyPromoter ( EventSlot & slot, const Cause & cause, bool ifTrace = false )

inline

Constructor.

Definition at line 23 of file Promoters.h.

        : m_slot( &slot ), m_cause( cause ), m_trace( ifTrace ) {}

Member Function Documentation

visit() [1/4]

bool concurrency::DataReadyPromoter::visit ( AlgorithmNode & node )

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 32 of file Promoters.cpp.

                                                     {
 
    bool result = true; // return true if this algorithm has no data inputs
 
    for ( auto dataNode : node.getInputDataNodes() ) {
 
      result = dataNode->accept( *this );
 
      // With ConditionNodes, one may decide NOT to break here so that associated
      // ConditionAlgorithms are scheduled ASAP. This behavior can be made configurable
      if ( !result ) break; // skip checking other inputs if this input was not produced yet
    }
 
    if ( result ) {
      m_slot->algsStates.set( node.getAlgoIndex(), AState::DATAREADY ).ignore();
 
      if ( m_trace ) {
        auto sourceNode = ( m_cause.m_source == Cause::source::Task )
                              ? node.m_graph->getAlgorithmNode( m_cause.m_sourceName )
                              : nullptr;
        node.m_graph->addEdgeToPrecTrace( sourceNode, &node );
      }
    }
 
    // return true only if an algorithm is promoted to DR
    return result;
  }

visit() [2/4]

bool concurrency::DataReadyPromoter::visit ( ConditionNode & node )

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 90 of file Promoters.cpp.

                                                     {
    /* Implements 'requester' strategy, i.e., requests this ConditionNode to be loaded
     * by its associated ConditionAlgorithm */
 
    auto promoter = Supervisor( *m_slot, m_cause, m_trace );
 
    for ( auto condAlg : node.getProducers() ) condAlg->accept( promoter );
 
    // this method is called if, and only if, this ConditionNode is not yet produced.
    // thus, by definition, this ConditionNode is not yet available at this moment
    return false;
  }

visit() [3/4]

bool concurrency::DataReadyPromoter::visit ( DataNode & node )

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 64 of file Promoters.cpp.

                                                {
    /* Implements 'observer' strategy, i.e., only check if producer of this DataNode
     * has been already executed or not */
 
    auto const& producers = node.getProducers();
    for ( auto algoNode : producers ) {
      const auto& state = m_slot->algsStates[algoNode->getAlgoIndex()];
      if ( AState::EVTACCEPTED == state || AState::EVTREJECTED == state ) {
        return true; // skip checking other producers if one was found to be executed
      }
    }
 
    // return true only if this DataNode is produced
    return false;
  }

visit() [4/4]

virtual bool concurrency::IGraphVisitor::visit ( DecisionNode & )

inlinevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 25 of file IGraphVisitor.h.

{ return true; }

visitEnter() [1/4]

bool concurrency::DataReadyPromoter::visitEnter ( AlgorithmNode & node ) const

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 24 of file Promoters.cpp.

                                                                {
 
    if ( AState::CONTROLREADY != m_slot->algsStates[node.getAlgoIndex()] ) return false;
 
    return true;
  }

visitEnter() [2/4]

bool concurrency::DataReadyPromoter::visitEnter ( ConditionNode & node ) const

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 81 of file Promoters.cpp.

                                                                {
 
    if ( node.m_condSvc->isValidID( *( m_slot->eventContext ), node.name() ) )
      return false; // do not enter this ConditionNode if the condition has bee already loaded
 
    return true;
  }

visitEnter() [3/4]

bool concurrency::DataReadyPromoter::visitEnter ( DataNode & ) const

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 61 of file Promoters.cpp.

{ return true; }

visitEnter() [4/4]

virtual bool concurrency::IGraphVisitor::visitEnter ( DecisionNode & ) const

inlinevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 24 of file IGraphVisitor.h.

{ return true; }

Member Data Documentation

m_cause

Cause concurrency::DataReadyPromoter::m_cause

Definition at line 42 of file Promoters.h.

m_slot

EventSlot* concurrency::DataReadyPromoter::m_slot

Definition at line 41 of file Promoters.h.

m_trace

bool concurrency::DataReadyPromoter::m_trace

Definition at line 43 of file Promoters.h.

---

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

• GaudiHive/src/PRGraph/Visitors/Promoters.h
• GaudiHive/src/PRGraph/Visitors/Promoters.cpp