concurrency::DataReadyPromoter Class Reference

#include <src/PRGraphVisitors.h>

Inheritance diagram for concurrency::DataReadyPromoter:

Collaboration diagram for concurrency::DataReadyPromoter:

Public Member Functions
	DataReadyPromoter (EventSlot &slot, const Cause &cause, bool ifTrace=false)
	Constructor. More...
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
Public Member Functions inherited from concurrency::IGraphVisitor
virtual	~IGraphVisitor ()=default
virtual bool	visitEnter (DecisionNode &) const
virtual bool	visit (DecisionNode &)
virtual void	reset ()

Public Attributes
EventSlot *	m_slot
Cause	m_cause
bool	m_trace

Detailed Description

Definition at line 11 of file PRGraphVisitors.h.

Constructor & Destructor Documentation

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

inline

Constructor.

Definition at line 15 of file PRGraphVisitors.h.

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

Member Function Documentation

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

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 23 of file PRGraphVisitors.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;
  }

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

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 56 of file PRGraphVisitors.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
      }
    }

    // Check parent slot if necessary
    if ( m_slot->parentSlot ) {
      for ( auto algoNode : producers ) {
        const auto& state = m_slot->parentSlot->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;
  }

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

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 94 of file PRGraphVisitors.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;
  }

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

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 14 of file PRGraphVisitors.cpp.

  {

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

    return true;
  }

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

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 53 of file PRGraphVisitors.cpp.

{ return true; }

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

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 84 of file PRGraphVisitors.cpp.

  {

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

    return true;
  }

Member Data Documentation

Cause concurrency::DataReadyPromoter::m_cause

Definition at line 34 of file PRGraphVisitors.h.

EventSlot* concurrency::DataReadyPromoter::m_slot

Definition at line 33 of file PRGraphVisitors.h.

bool concurrency::DataReadyPromoter::m_trace

Definition at line 35 of file PRGraphVisitors.h.

---

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

• GaudiHive/src/PRGraphVisitors.h
• GaudiHive/src/PRGraphVisitors.cpp