concurrency::Supervisor Class Reference

#include <src/PRGraphVisitors.h>

Inheritance diagram for concurrency::Supervisor:

Collaboration diagram for concurrency::Supervisor:

Public Member Functions
	Supervisor (const int &slotNum)
	Constructor. More...
	~Supervisor () override
	Destructor. More...
bool	visitEnter (DecisionNode &node) const override
bool	visit (DecisionNode &node) override
bool	visitLeave (DecisionNode &) const override
bool	visitEnter (AlgorithmNode &node) const override
bool	visit (AlgorithmNode &node) override
void	reset () override
Public Member Functions inherited from concurrency::IGraphVisitor
virtual	~IGraphVisitor ()

Additional Inherited Members
Public Attributes inherited from concurrency::IGraphVisitor
int	m_nodesSucceeded
int	m_slotNum

Detailed Description

Definition at line 65 of file PRGraphVisitors.h.

Constructor & Destructor Documentation

concurrency::Supervisor::Supervisor ( const int &  slotNum )

inline

Constructor.

Definition at line 68 of file PRGraphVisitors.h.

                                     {
        m_nodesSucceeded = 0;
        m_slotNum = slotNum;
      };

concurrency::Supervisor::~Supervisor ( )

inlineoverride

Destructor.

Definition at line 73 of file PRGraphVisitors.h.

{}

Member Function Documentation

void concurrency::Supervisor::reset ( )

inlineoverridevirtual

Implements concurrency::IGraphVisitor.

Definition at line 87 of file PRGraphVisitors.h.

{ m_nodesSucceeded = 0; }

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

overridevirtual

Implements concurrency::IGraphVisitor.

Definition at line 157 of file PRGraphVisitors.cpp.

                                           {

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

    for (auto child : node.getDaughters()) {
      int& childDecision = child->m_graph->getNodeDecisions(m_slotNum)[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) {
      node.m_graph->getNodeDecisions(m_slotNum)[node.getNodeIndex()] = decision;
      return true;
    }
    return false;
  }

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

overridevirtual

Implements concurrency::IGraphVisitor.

Definition at line 218 of file PRGraphVisitors.cpp.

                                            {

    bool result = false;

    auto& decisions = node.m_graph->getNodeDecisions(m_slotNum);
    auto& states = node.m_graph->getAlgoStates(m_slotNum);

    // Try to shift an algorithm with I->CF, and then, if successful, with CF->DF
    if (node.promoteToControlReadyState(m_slotNum,states,decisions))
      result = node.promoteToDataReadyState(m_slotNum);

    //returns true only when an algorithm is DF-ready
    // i.e., the visitor reached its final goal with the algorithm
    return result;
  }

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

overridevirtual

Implements concurrency::IGraphVisitor.

Definition at line 149 of file PRGraphVisitors.cpp.

                                                      {

    if (node.m_graph->getNodeDecisions(m_slotNum)[node.getNodeIndex()] != -1)
      return false;
    return true;
  }

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

overridevirtual

Implements concurrency::IGraphVisitor.

Definition at line 210 of file PRGraphVisitors.cpp.

                                                       {

    if (node.m_graph->getNodeDecisions(m_slotNum)[node.getNodeIndex()] != -1)
      return false;
    return true;
  }

bool concurrency::Supervisor::visitLeave ( DecisionNode &  ) const

inlineoverridevirtual

Implements concurrency::IGraphVisitor.

Definition at line 79 of file PRGraphVisitors.h.

{return true;};

---

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

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