concurrency::RankerByDataRealmEccentricity Class Reference

#include <src/PRGraphVisitors.h>

Inheritance diagram for concurrency::RankerByDataRealmEccentricity:

Collaboration diagram for concurrency::RankerByDataRealmEccentricity:

Public Member Functions
	RankerByDataRealmEccentricity ()
	Constructor. More...
bool	visit (AlgorithmNode &node) override
void	reset () override
void	recursiveVisit (AlgorithmNode &node)
	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 &)

Public Attributes
uint	m_currentDepth
uint	m_maxKnownDepth
Public Attributes inherited from concurrency::IGraphVisitor
int	m_nodesSucceeded
EventSlot *	m_slot

Detailed Description

Definition at line 115 of file PRGraphVisitors.h.

Constructor & Destructor Documentation

concurrency::RankerByDataRealmEccentricity::RankerByDataRealmEccentricity ( )

inline

Constructor.

Definition at line 118 of file PRGraphVisitors.h.

                                      {
        m_nodesSucceeded = 0;
        m_slot = nullptr;
        m_currentDepth = 0;
        m_maxKnownDepth = 0;
      };

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 324 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 129 of file PRGraphVisitors.h.

                            {
        m_nodesSucceeded = 0;
        m_currentDepth = 0;
        m_maxKnownDepth = 0;
      }

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

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

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

Definition at line 139 of file PRGraphVisitors.h.

uint concurrency::RankerByDataRealmEccentricity::m_maxKnownDepth

Definition at line 140 of file PRGraphVisitors.h.

---

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

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