OpenAnalysis::CFG::Node

Synopsis

Declared in <src/midend/programAnalysis/OpenAnalysis/CFG/CFG.h>

class Node
    : public DGraph::Node

Base Classes

Name	Description
DGraph::Node	An node in an undirected graph has a list of neighboring nodes and a list of incident edges.

Member Functions

Name	Description
Node [constructor]	Constructors
~Node [destructor] [virtual]	Destructor
add
addEndExpr
dump [virtual]
empty
erase
getEndExpr
getID
longdump
size
split

Private Data Members

Name

end

label

stmt_list

Private Static Data Members

Name

label_count

Friends

Name	Description
OpenAnalysis::CFG::NodeStatementsIterator
OpenAnalysis::CFG	CFG is a DGraph (directed graph) with enhanced nodes and edges. Each node in the CFG points to a list of statements that together represent a basic block. The entire program would be represented by a set of CFGs, one for each subroutine, and one for the main program.

Created with MrDocs