concurrency::Supervisor Class Reference

#include <src/PRGraphVisitors.h>

Inheritance diagram for concurrency::Supervisor:

Collaboration diagram for concurrency::Supervisor:

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

Additional Inherited Members
Public Attributes inherited from concurrency::IGraphVisitor
int	m_nodesSucceeded
EventSlot *	m_slot

Detailed Description

Definition at line 40 of file PRGraphVisitors.h.

Constructor & Destructor Documentation

concurrency::Supervisor::Supervisor ( EventSlot &  slot )

inline

Constructor.

Definition at line 43 of file PRGraphVisitors.h.

                                  {
        m_nodesSucceeded = 0;
        m_slot = &slot;
      };

Member Function Documentation

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

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 92 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 152 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);
      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 84 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 144 of file PRGraphVisitors.cpp.

                                                       {

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

---

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

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