concurrency::RankerByDataRealmEccentricity Class Reference

#include <src/PRGraphVisitors.h>

Inheritance diagram for concurrency::RankerByDataRealmEccentricity:

Collaboration diagram for concurrency::RankerByDataRealmEccentricity:

Public Member Functions
bool	visit (AlgorithmNode &) override
void	reset () override
void	recursiveVisit (AlgorithmNode &)
	Depth-first node parser to calculate node eccentricity (only within the data realm of the precedence rules graph) More...
Public Member Functions inherited from concurrency::IGraphVisitor
virtual	~IGraphVisitor ()=default
virtual bool	visitEnter (DecisionNode &) const
virtual bool	visit (DecisionNode &)
virtual bool	visitEnter (AlgorithmNode &) const
virtual bool	visitEnter (DataNode &) const
virtual bool	visit (DataNode &)
virtual bool	visitEnter (ConditionNode &) const
virtual bool	visit (ConditionNode &)

Public Attributes
uint	m_currentDepth {0}
uint	m_maxKnownDepth {0}

Detailed Description

Definition at line 114 of file PRGraphVisitors.h.

Member Function Documentation

void concurrency::RankerByDataRealmEccentricity::recursiveVisit

(

AlgorithmNode &

node

)

Depth-first node parser to calculate node eccentricity (only within the data realm of the precedence rules graph)

Definition at line 388 of file PRGraphVisitors.cpp.

  {

    m_currentDepth += 1;

    auto& products = node.getOutputDataNodes();

    if ( products.empty() )
      if ( ( m_currentDepth - 1 ) > m_maxKnownDepth ) m_maxKnownDepth = m_currentDepth - 1;

    for ( auto p : products )
      for ( auto algoNode : p->getConsumers() ) recursiveVisit( *algoNode );

    m_currentDepth -= 1;
  }

void concurrency::RankerByDataRealmEccentricity::reset ( )

inlineoverridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 121 of file PRGraphVisitors.h.

    {
      m_currentDepth  = 0;
      m_maxKnownDepth = 0;
    }

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

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 372 of file PRGraphVisitors.cpp.

  {

    // Find eccentricity of the node (only within the data realm of the execution flow graph)
    recursiveVisit( node );

    float rank = m_maxKnownDepth;
    node.setRank( rank );

    // Reset visitor for next nodes, if any
    reset();

    return true;
  }

Member Data Documentation

uint concurrency::RankerByDataRealmEccentricity::m_currentDepth {0}

Definition at line 131 of file PRGraphVisitors.h.

uint concurrency::RankerByDataRealmEccentricity::m_maxKnownDepth {0}

Definition at line 132 of file PRGraphVisitors.h.

---

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

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