concurrency::RankerByDataRealmEccentricity Class Reference

#include <src/PRGraph/Visitors/Rankers.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...
virtual bool	visit (DecisionNode &)
virtual bool	visit (AlgorithmNode &)
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	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 47 of file Rankers.h.

Member Function Documentation

recursiveVisit()

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 155 of file Rankers.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;
  }

reset()

void concurrency::RankerByDataRealmEccentricity::reset ( )

inlineoverridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 53 of file Rankers.h.

                          {
      m_currentDepth  = 0;
      m_maxKnownDepth = 0;
    }

visit() [1/5]

virtual bool concurrency::IGraphVisitor::visit

inline

Definition at line 22 of file IGraphVisitor.h.

{ return true; };

visit() [2/5]

virtual bool concurrency::IGraphVisitor::visit

inline

Definition at line 19 of file IGraphVisitor.h.

{ return true; };

visit() [3/5]

virtual bool concurrency::IGraphVisitor::visit

inline

Definition at line 16 of file IGraphVisitor.h.

{ return true; };

visit() [4/5]

virtual bool concurrency::IGraphVisitor::visit

inline

Definition at line 25 of file IGraphVisitor.h.

{ return true; };

visit() [5/5]

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

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 140 of file Rankers.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

m_currentDepth

uint concurrency::RankerByDataRealmEccentricity::m_currentDepth {0}

Definition at line 62 of file Rankers.h.

m_maxKnownDepth

uint concurrency::RankerByDataRealmEccentricity::m_maxKnownDepth {0}

Definition at line 63 of file Rankers.h.

---

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

• GaudiHive/src/PRGraph/Visitors/Rankers.h
• GaudiHive/src/PRGraph/Visitors/Rankers.cpp