concurrency::DecisionUpdater Class Reference

#include <Promoters.h>

Inheritance diagram for concurrency::DecisionUpdater:

Collaboration diagram for concurrency::DecisionUpdater:

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

Public Attributes
EventSlot *	m_slot
Cause	m_cause
bool	m_trace

Detailed Description

Definition at line 47 of file Promoters.h.

Constructor & Destructor Documentation

DecisionUpdater()

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

inline

Constructor.

Definition at line 50 of file Promoters.h.

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

Member Function Documentation

visit() [1/4]

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

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 104 of file Promoters.cpp.

                                                   {
 
    auto&         states   = m_slot->algsStates;
    const AState& state    = states[node.getAlgoIndex()];
    const int     decision = [state]() {
      switch ( state ) {
      case AState::EVTACCEPTED:
        return 1;
      case AState::EVTREJECTED:
        return 0;
      default:
        return -1;
      };
    }();
 
    if ( -1 == decision ) { return false; }
 
    m_slot->controlFlowState[node.getNodeIndex()] = decision;
 
    auto promoter = DataReadyPromoter( *m_slot, m_cause, m_trace );
    for ( const auto& output : node.getOutputDataNodes() )
      for ( auto& consumer : output->getConsumers() ) consumer->accept( promoter );
 
    // propagate decision upward to active regions of the graph
    auto  vis     = concurrency::Supervisor( *m_slot, m_cause, m_trace );
    auto& parents = node.getParentDecisionHubs();
    if ( parents.size() == 1 ) {
      parents[0]->accept( vis );
    } else if ( m_slot->parentSlot ) {
      auto scout = SubSlotScout( m_slot, node );
      for ( auto& p : parents ) {
        p->accept( scout );
        if ( scout.reply() ) p->accept( vis );
        scout.reset();
      }
    } else {
      auto scout = ActiveLineageScout( m_slot, node );
      for ( auto& p : parents ) {
        p->accept( scout );
        if ( scout.reply() ) p->accept( vis );
        scout.reset();
      }
    }
 
    return true; // return true only if the algorithm produced a decision
  }

visit() [2/4]

virtual bool concurrency::IGraphVisitor::visit ( ConditionNode & )

inlinevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 34 of file IGraphVisitor.h.

{ return true; }

visit() [3/4]

virtual bool concurrency::IGraphVisitor::visit ( DataNode & )

inlinevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 31 of file IGraphVisitor.h.

{ return true; }

visit() [4/4]

virtual bool concurrency::IGraphVisitor::visit ( DecisionNode & )

inlinevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 25 of file IGraphVisitor.h.

{ return true; }

Member Data Documentation

m_cause

Cause concurrency::DecisionUpdater::m_cause

Definition at line 58 of file Promoters.h.

m_slot

EventSlot* concurrency::DecisionUpdater::m_slot

Definition at line 57 of file Promoters.h.

m_trace

bool concurrency::DecisionUpdater::m_trace

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