concurrency::RunSimulator Class Reference

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

Inheritance diagram for concurrency::RunSimulator:

Collaboration diagram for concurrency::RunSimulator:

Public Member Functions
	RunSimulator (EventSlot &slot, const Cause &cause)
	Constructor. More...
bool	visitEnter (DecisionNode &) const override
bool	visit (DecisionNode &) override
bool	visitEnter (AlgorithmNode &) const override
bool	visit (AlgorithmNode &) override
void	reset () override
virtual bool	visit (DecisionNode &)
virtual bool	visit (AlgorithmNode &)
virtual bool	visit (DataNode &)
virtual bool	visit (ConditionNode &)
virtual bool	visitEnter (DecisionNode &) const
virtual bool	visitEnter (AlgorithmNode &) const
virtual bool	visitEnter (DataNode &) const
virtual bool	visitEnter (ConditionNode &) const
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 &)

Public Attributes
EventSlot *	m_slot
Cause	m_cause
int	m_nodesSucceeded { 0 }

Detailed Description

Definition at line 87 of file Promoters.h.

Constructor & Destructor Documentation

RunSimulator()

concurrency::RunSimulator::RunSimulator ( EventSlot &  slot, const Cause &  cause  )

inline

Constructor.

Definition at line 90 of file Promoters.h.

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

Member Function Documentation

reset()

void concurrency::RunSimulator::reset ( )

inlineoverridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 103 of file Promoters.h.

{ m_nodesSucceeded = 0; };

visit() [1/6]

virtual bool concurrency::IGraphVisitor::visit

inline

Definition at line 29 of file IGraphVisitor.h.

{ return true; };

visit() [2/6]

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

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 403 of file Promoters.cpp.

                                                {
 
    auto& states   = m_slot->algsStates;
    int&  decision = m_slot->controlFlowState[node.getNodeIndex()];
 
    auto dataPromoter = DataReadyPromoter( *m_slot, m_cause );
 
    if ( AState::INITIAL == states[node.getAlgoIndex()] ) {
      states.set( node.getAlgoIndex(), AState::CONTROLREADY ).ignore( /* AUTOMATICALLY ADDED FOR gaudi/Gaudi!763 */ );
      if ( dataPromoter.visit( node ) ) {
        states.set( node.getAlgoIndex(), AState::SCHEDULED ).ignore( /* AUTOMATICALLY ADDED FOR gaudi/Gaudi!763 */ );
        states.set( node.getAlgoIndex(), AState::EVTACCEPTED ).ignore( /* AUTOMATICALLY ADDED FOR gaudi/Gaudi!763 */ );
        decision = 1;
        ++m_nodesSucceeded;
        // std::cout << "Algorithm decided: " << node.getNodeName() << std::endl;
        return true;
      }
    } else if ( AState::CONTROLREADY == states[node.getAlgoIndex()] && dataPromoter.visit( node ) ) {
      states.set( node.getAlgoIndex(), AState::SCHEDULED ).ignore( /* AUTOMATICALLY ADDED FOR gaudi/Gaudi!763 */ );
      states.set( node.getAlgoIndex(), AState::EVTACCEPTED ).ignore( /* AUTOMATICALLY ADDED FOR gaudi/Gaudi!763 */ );
      decision = 1;
      ++m_nodesSucceeded;
      // std::cout << "Algorithm decided: " << node.getNodeName() << std::endl;
      return true;
    }
 
    return false;
  }

visit() [3/6]

virtual bool concurrency::IGraphVisitor::visit

inline

Definition at line 35 of file IGraphVisitor.h.

{ return true; };

visit() [4/6]

virtual bool concurrency::IGraphVisitor::visit

inline

Definition at line 32 of file IGraphVisitor.h.

{ return true; };

visit() [5/6]

virtual bool concurrency::IGraphVisitor::visit

inline

Definition at line 26 of file IGraphVisitor.h.

{ return true; };

visit() [6/6]

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

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 362 of file Promoters.cpp.

                                               {
 
    bool allChildDecisionsResolved = true;
 
    for ( const auto& child : node.getDaughters() ) {
 
      child->accept( *this );
 
      int childDecision = m_slot->controlFlowState[child->getNodeIndex()];
      if ( childDecision == -1 ) allChildDecisionsResolved = false;
 
      // process children sequentially if their decision hub is sequential
      if ( !node.m_modeConcurrent && childDecision == -1 ) return false;
 
      if ( childDecision == 1 && node.m_modeOR && node.m_modePromptDecision ) {
        m_slot->controlFlowState[node.getNodeIndex()] = 1;
 
        // if a decision was made for this node, propagate the result upwards
        for ( auto parent : node.m_parents ) { parent->accept( *this ); }
        return true;
      }
    }
 
    if ( allChildDecisionsResolved ) {
      m_slot->controlFlowState[node.getNodeIndex()] = 1;
 
      // if a decision was made for this node, propagate the result upwards
      for ( auto parent : node.m_parents ) { parent->accept( *this ); }
    }
 
    return allChildDecisionsResolved;
  }

visitEnter() [1/6]

virtual bool concurrency::IGraphVisitor::visitEnter

inline

Definition at line 28 of file IGraphVisitor.h.

{ return true; };

visitEnter() [2/6]

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

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 396 of file Promoters.cpp.

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

visitEnter() [3/6]

virtual bool concurrency::IGraphVisitor::visitEnter

inline

Definition at line 34 of file IGraphVisitor.h.

{ return true; };

visitEnter() [4/6]

virtual bool concurrency::IGraphVisitor::visitEnter

inline

Definition at line 31 of file IGraphVisitor.h.

{ return true; };

visitEnter() [5/6]

virtual bool concurrency::IGraphVisitor::visitEnter

inline

Definition at line 25 of file IGraphVisitor.h.

{ return true; };

visitEnter() [6/6]

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

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 355 of file Promoters.cpp.

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

Member Data Documentation

m_cause

Cause concurrency::RunSimulator::m_cause

Definition at line 106 of file Promoters.h.

m_nodesSucceeded

int concurrency::RunSimulator::m_nodesSucceeded { 0 }

Definition at line 107 of file Promoters.h.

m_slot

EventSlot* concurrency::RunSimulator::m_slot

Definition at line 105 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