34#ifndef TTA_CONTROL_DEPENDENCE_NODE_HH
35#define TTA_CONTROL_DEPENDENCE_NODE_HH
find Finds info of the inner loops in the false
void addToRegion(ControlDependenceNode &node)
void setLastNode()
LastNode marks node that must be ordered last compared to it's sibling nodes - Close node of loop.
const NodesInfo & region()
NodesInfo region_
Stores "region" information for computing serialization information.
bool isLoopEntryNode() const
std::string toString() const
TTAProgram::Instruction & instruction(int index) const
void printRelations() const
ControlDependenceNode(const NodeType type=CDEP_NODE_BB, BasicBlockNode *bblock=NULL)
int component_
Number of strong component the node belongs to, if any.
bool isPredicateNode() const
void setComponent(int component)
NodesInfo pseudoPredicateEEC_
Stores "shadow" eec information for predicate basic blocks which can be then copied into PDG for node...
int instructionCount() const
bool isRegionNode() const
const NodesInfo & pseudoPredicateEEC()
std::set< ControlDependenceNode * > NodesInfo
Storage type for other nodes of same graph needed to define some non graph relations....
NodesInfo eec_
Stores "eec" information for computing serialization information.
void addToEEC(ControlDependenceNode &node)
virtual ~ControlDependenceNode()
bool lastNode_
Indicated that the node should be scheduled last from it's siblings Case when node is predicate or re...
void setLoopEntryNode(int component)
bool isLoopCloseNode() const
bool isControlDependenceNode() const
BasicBlockNode * basicBlockNode() const
void addToPseudoPredicateEEC(ControlDependenceNode &node)