concurrency::Supervisor Class Reference

#include <src/PRGraphVisitors.h>

Inheritance diagram for concurrency::Supervisor:

Collaboration diagram for concurrency::Supervisor:

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

Public Attributes
EventSlot *	m_slot
Cause	m_cause
bool	m_trace

Detailed Description

Definition at line 54 of file PRGraphVisitors.h.

Constructor & Destructor Documentation

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

inline

Constructor.

Definition at line 58 of file PRGraphVisitors.h.

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

Member Function Documentation

bool concurrency::Supervisor::visit ( DecisionNode &  node )

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 140 of file PRGraphVisitors.cpp.

  {

    bool foundNonResolvedChild = false;
    bool foundNegativeChild    = false;
    bool foundPositiveChild    = false;
    int decision               = -1;

    for ( auto child : node.getDaughters() ) {
      int& childDecision = m_slot->controlFlowState[child->getNodeIndex()];

      if ( childDecision == -1 )
        foundNonResolvedChild = true;
      else if ( childDecision == 1 )
        foundPositiveChild = true;
      else
        foundNegativeChild = true;

      if ( node.m_modePromptDecision ) {
        if ( node.m_modeOR && foundPositiveChild ) {
          decision = 1;
          break;
        } else if ( !node.m_modeOR && foundNegativeChild ) {
          decision = 0;
          break;
        }
      } else {
        if ( foundNonResolvedChild ) break;
      }
    } // end monitoring children

    if ( !foundNonResolvedChild && decision == -1 ) {
      if ( node.m_modeOR ) { // OR
        if ( foundPositiveChild )
          decision = 1;
        else
          decision = 0;
      } else { // AND
        if ( foundNegativeChild )
          decision = 0;
        else
          decision = 1;
      }
    }

    if ( node.m_allPass && !foundNonResolvedChild ) decision = 1;

    if ( decision != -1 ) {
      m_slot->controlFlowState[node.getNodeIndex()] = decision;
      return true;
    }
    return false;
  }

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

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 203 of file PRGraphVisitors.cpp.

  {

    bool result = false;

    auto& states = m_slot->algsStates;
    auto& state  = states[node.getAlgoIndex()];

    // Promote with INITIAL->CR
    if ( State::INITIAL == state ) states.updateState( node.getAlgoIndex(), State::CONTROLREADY ).ignore();

    // Try to promote with CR->DR
    if ( State::CONTROLREADY == state ) {
      auto promoter = DataReadyPromoter( *m_slot, m_cause, m_trace );
      result        = promoter.visit( node );
    } else {
      result = true;
    }

    // return true only when an algorithm is not lower than DR in its FSM
    // i.e., the visitor has done everything it could with this algorithm
    return result;
  }

bool concurrency::Supervisor::visitEnter ( DecisionNode &  node ) const

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 132 of file PRGraphVisitors.cpp.

  {

    if ( m_slot->controlFlowState[node.getNodeIndex()] != -1 ) return false;
    return true;
  }

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

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 195 of file PRGraphVisitors.cpp.

  {

    if ( m_slot->controlFlowState[node.getNodeIndex()] != -1 ) return false;
    return true;
  }

Member Data Documentation

Cause concurrency::Supervisor::m_cause

Definition at line 73 of file PRGraphVisitors.h.

EventSlot* concurrency::Supervisor::m_slot

Definition at line 72 of file PRGraphVisitors.h.

bool concurrency::Supervisor::m_trace

Definition at line 74 of file PRGraphVisitors.h.

---

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

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