#include <src/PrecedenceRulesGraph.h>

Inheritance diagram for concurrency::AlgorithmNode:

Collaboration diagram for concurrency::AlgorithmNode:

[legend]

Public Member Functions
	AlgorithmNode (PrecedenceRulesGraph &graph, Algorithm *algoPtr, unsigned int nodeIndex, unsigned int algoIndex, bool inverted, bool allPass)
	Constructor. More...

bool	accept (IGraphVisitor &visitor) override
	Visitor entry point. More...

void	addParentNode (DecisionNode *node)
	Add a parent node. More...

const std::vector< DecisionNode * > &	getParentDecisionHubs () const
	Get all parent decision hubs. More...

void	addOutputDataNode (DataNode *node)
	Associate an AlgorithmNode, which is a data supplier for this one. More...

void	addInputDataNode (DataNode *node)
	Associate an AlgorithmNode, which is a data consumer of this one. More...

const std::vector< DataNode * > &	getOutputDataNodes () const
	Get all supplier nodes. More...

const std::vector< DataNode * > &	getInputDataNodes () const
	Get all consumer nodes. More...

void	setRank (float &rank)
	Set Algorithm rank. More...

const float &	getRank () const
	Get Algorithm rank. More...

Algorithm *	getAlgorithm () const
	get Algorithm representatives More...

const unsigned int &	getAlgoIndex () const
	Get algorithm index. More...

void	setIOBound (bool value)
	Set the I/O-boundness flag. More...

bool	isIOBound () const
	Check if algorithm is I/O-bound. More...

bool	isOptimist () const
	Check if positive control flow decision is enforced. More...

bool	isLiar () const
	Check if control flow logic is always inverted. More...

void	printState (std::stringstream &output, AlgsExecutionStates &states, const std::vector< int > &node_decisions, const unsigned int &recursionLevel) const override
	Print a string representing the control flow state. More...

Public Member Functions inherited from concurrency::ControlFlowNode
	ControlFlowNode (PrecedenceRulesGraph &graph, unsigned int nodeIndex, const std::string &name)
	Constructor. More...

virtual	~ControlFlowNode ()=default
	Destructor. More...

const unsigned int &	getNodeIndex () const
	Get node index. More...

const std::string &	getNodeName () const
	Get node name. More...

Public Attributes
std::vector< DecisionNode * >	m_parents
	Control flow parents of an AlgorithmNode (DecisionNodes) More...

Public Attributes inherited from concurrency::ControlFlowNode
PrecedenceRulesGraph *	m_graph

Private Attributes
Algorithm *	m_algorithm
	Algorithm representative behind the AlgorithmNode. More...

unsigned int	m_algoIndex
	The index of the algorithm. More...

std::string	m_algoName
	The name of the algorithm. More...

bool	m_inverted
	Whether the selection result is negated or not. More...

bool	m_allPass
	Whether the selection result is relevant or always "pass". More...

float	m_rank = -1
	Algorithm rank of any kind. More...

bool	m_isIOBound
	If an algorithm is blocking. More...

std::vector< DataNode * >	m_outputs
	Algorithm outputs (DataNodes) More...

std::vector< DataNode * >	m_inputs
	Algorithm inputs (DataNodes) More...

Additional Inherited Members
Protected Attributes inherited from concurrency::ControlFlowNode
unsigned int	m_nodeIndex

std::string	m_nodeName

Detailed Description

Definition at line 506 of file PrecedenceRulesGraph.h.

Constructor & Destructor Documentation

concurrency::AlgorithmNode::AlgorithmNode	(	PrecedenceRulesGraph &	graph,
		Algorithm *	algoPtr,
		unsigned int	nodeIndex,
		unsigned int	algoIndex,
		bool	inverted,
		bool	allPass
	)

inline

Constructor.

Definition at line 510 of file PrecedenceRulesGraph.h.

         : ControlFlowNode( graph, nodeIndex, algoPtr->name() )
         , m_algorithm( algoPtr )
         , m_algoIndex( algoIndex )
         , m_algoName( algoPtr->name() )
         , m_inverted( inverted )
         , m_allPass( allPass )
         , m_isIOBound( algoPtr->isIOBound() ){};

Member Function Documentation

bool concurrency::AlgorithmNode::accept ( IGraphVisitor & visitor )

overridevirtual

Visitor entry point.

Implements concurrency::ControlFlowNode.

Definition at line 82 of file PrecedenceRulesGraph.cpp.

   {
 
     if ( visitor.visitEnter( *this ) ) {
       visitor.visit( *this );
       return true; // visitor was accepted to promote the algorithm
     }
 
     return false; // visitor was rejected (since the algorithm already produced a decision)
   }

void concurrency::AlgorithmNode::addInputDataNode ( DataNode * node )

Associate an AlgorithmNode, which is a data consumer of this one.

Definition at line 108 of file PrecedenceRulesGraph.cpp.

   {
 
     if ( std::find( m_inputs.begin(), m_inputs.end(), node ) == m_inputs.end() ) m_inputs.push_back( node );
   }

void concurrency::AlgorithmNode::addOutputDataNode ( DataNode * node )

Associate an AlgorithmNode, which is a data supplier for this one.

Definition at line 101 of file PrecedenceRulesGraph.cpp.

   {
 
     if ( std::find( m_outputs.begin(), m_outputs.end(), node ) == m_outputs.end() ) m_outputs.push_back( node );
   }

void concurrency::AlgorithmNode::addParentNode ( DecisionNode * node )

Add a parent node.

Definition at line 94 of file PrecedenceRulesGraph.cpp.

   {
 
     if ( std::find( m_parents.begin(), m_parents.end(), node ) == m_parents.end() ) m_parents.push_back( node );
   }

const unsigned int& concurrency::AlgorithmNode::getAlgoIndex ( ) const

inline

Get algorithm index.

Definition at line 545 of file PrecedenceRulesGraph.h.

545 { return m_algoIndex; }

concurrency::AlgorithmNode::m_algoIndex

unsigned int m_algoIndex

The index of the algorithm.

Definition: PrecedenceRulesGraph.h:569

Algorithm* concurrency::AlgorithmNode::getAlgorithm ( ) const

inline

get Algorithm representatives

Definition at line 543 of file PrecedenceRulesGraph.h.

543 { return m_algorithm; }

concurrency::AlgorithmNode::m_algorithm

Algorithm * m_algorithm

Algorithm representative behind the AlgorithmNode.

Definition: PrecedenceRulesGraph.h:567

const std::vector<DataNode*>& concurrency::AlgorithmNode::getInputDataNodes ( ) const

inline

Get all consumer nodes.

Definition at line 535 of file PrecedenceRulesGraph.h.

535 { return m_inputs; }

concurrency::AlgorithmNode::m_inputs

std::vector< DataNode * > m_inputs

Algorithm inputs (DataNodes)

Definition: PrecedenceRulesGraph.h:584

const std::vector<DataNode*>& concurrency::AlgorithmNode::getOutputDataNodes ( ) const

inline

Get all supplier nodes.

Definition at line 533 of file PrecedenceRulesGraph.h.

533 { return m_outputs; }

concurrency::AlgorithmNode::m_outputs

std::vector< DataNode * > m_outputs

Algorithm outputs (DataNodes)

Definition: PrecedenceRulesGraph.h:582

const std::vector<DecisionNode*>& concurrency::AlgorithmNode::getParentDecisionHubs ( ) const

inline

Get all parent decision hubs.

Definition at line 526 of file PrecedenceRulesGraph.h.

526 { return m_parents; }

concurrency::AlgorithmNode::m_parents

std::vector< DecisionNode * > m_parents

Control flow parents of an AlgorithmNode (DecisionNodes)

Definition: PrecedenceRulesGraph.h:563

const float& concurrency::AlgorithmNode::getRank ( ) const

inline

Get Algorithm rank.

Definition at line 540 of file PrecedenceRulesGraph.h.

540 { return m_rank; }

concurrency::AlgorithmNode::m_rank

float m_rank

Algorithm rank of any kind.

Definition: PrecedenceRulesGraph.h:577

bool concurrency::AlgorithmNode::isIOBound ( ) const

inline

Check if algorithm is I/O-bound.

Definition at line 550 of file PrecedenceRulesGraph.h.

550 { return m_isIOBound; }

concurrency::AlgorithmNode::m_isIOBound

bool m_isIOBound

If an algorithm is blocking.

Definition: PrecedenceRulesGraph.h:579

bool concurrency::AlgorithmNode::isLiar ( ) const

inline

Check if control flow logic is always inverted.

Definition at line 555 of file PrecedenceRulesGraph.h.

555 { return m_inverted; };

concurrency::AlgorithmNode::m_inverted

bool m_inverted

Whether the selection result is negated or not.

Definition: PrecedenceRulesGraph.h:573

bool concurrency::AlgorithmNode::isOptimist ( ) const

inline

Check if positive control flow decision is enforced.

Definition at line 553 of file PrecedenceRulesGraph.h.

553 { return m_allPass; };

concurrency::AlgorithmNode::m_allPass

bool m_allPass

Whether the selection result is relevant or always "pass".

Definition: PrecedenceRulesGraph.h:575

void concurrency::AlgorithmNode::printState	(	std::stringstream &	output,
		AlgsExecutionStates &	states,
		const std::vector< int > &	node_decisions,
		const unsigned int &	recursionLevel
	)		const

overridevirtual

Print a string representing the control flow state.

Implements concurrency::ControlFlowNode.

Definition at line 72 of file PrecedenceRulesGraph.cpp.

   {
     output << std::string( recursionLevel, ' ' ) << m_nodeName << " (" << m_nodeIndex << ")"
            << ", w/ decision: " << stateToString( node_decisions[m_nodeIndex] ) << "(" << node_decisions[m_nodeIndex]
            << ")"
            << ", in state: " << states[m_algoIndex] << std::endl;
   }

void concurrency::AlgorithmNode::setIOBound ( bool value )

inline

Set the I/O-boundness flag.

Definition at line 548 of file PrecedenceRulesGraph.h.

548 { m_isIOBound = value; }

concurrency::AlgorithmNode::m_isIOBound

bool m_isIOBound

If an algorithm is blocking.

Definition: PrecedenceRulesGraph.h:579

void concurrency::AlgorithmNode::setRank ( float & rank )

inline

Set Algorithm rank.

Definition at line 538 of file PrecedenceRulesGraph.h.

538 { m_rank = rank; }

concurrency::AlgorithmNode::m_rank

float m_rank

Algorithm rank of any kind.

Definition: PrecedenceRulesGraph.h:577

Member Data Documentation

unsigned int concurrency::AlgorithmNode::m_algoIndex

private

The index of the algorithm.

Definition at line 569 of file PrecedenceRulesGraph.h.

std::string concurrency::AlgorithmNode::m_algoName

private

The name of the algorithm.

Definition at line 571 of file PrecedenceRulesGraph.h.

Algorithm* concurrency::AlgorithmNode::m_algorithm

private

Algorithm representative behind the AlgorithmNode.

Definition at line 567 of file PrecedenceRulesGraph.h.

bool concurrency::AlgorithmNode::m_allPass

private

Whether the selection result is relevant or always "pass".

Definition at line 575 of file PrecedenceRulesGraph.h.

std::vector<DataNode*> concurrency::AlgorithmNode::m_inputs

private

Algorithm inputs (DataNodes)

Definition at line 584 of file PrecedenceRulesGraph.h.

bool concurrency::AlgorithmNode::m_inverted

private

Whether the selection result is negated or not.

Definition at line 573 of file PrecedenceRulesGraph.h.

bool concurrency::AlgorithmNode::m_isIOBound

private

If an algorithm is blocking.

Definition at line 579 of file PrecedenceRulesGraph.h.

std::vector<DataNode*> concurrency::AlgorithmNode::m_outputs

private

Algorithm outputs (DataNodes)

Definition at line 582 of file PrecedenceRulesGraph.h.

std::vector<DecisionNode*> concurrency::AlgorithmNode::m_parents

Control flow parents of an AlgorithmNode (DecisionNodes)

Definition at line 563 of file PrecedenceRulesGraph.h.

float concurrency::AlgorithmNode::m_rank = -1

private

Algorithm rank of any kind.

Definition at line 577 of file PrecedenceRulesGraph.h.

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

GaudiHive/src/PrecedenceRulesGraph.h
GaudiHive/src/PrecedenceRulesGraph.cpp

Public Member Functions

Public Attributes

Private Attributes

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation