LLVM API Documentation

Main Page | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members | Related Pages

llvm::Graph Member List

This is the complete list of members for llvm::Graph, including all inherited members.

addEdge(Edge ed, int w)llvm::Graph
addEdgeForce(Edge ed)llvm::Graph
addNode(Node *nd)llvm::Graph
constElementIterator typedefllvm::Graph
elementIterator typedefllvm::Graph
getAllNodes() const llvm::Graph
getAllNodes()llvm::Graph
getBackEdges(std::vector< Edge > &be, std::map< Node *, int > &d)llvm::Graph
getExit()llvm::Graph [inline]
getExit() const llvm::Graph [inline]
getMaxSpanningTree()llvm::Graph
getNodeList(Node *nd)llvm::Graph [inline]
getNumberOfIncomingEdges(Node *nd)llvm::Graph
getNumberOfOutgoingEdges(Node *nd) const llvm::Graph
getPredNodes(Node *nd)llvm::Graph
getRoot()llvm::Graph [inline]
getRoot() const llvm::Graph [inline]
getSortedNodeList(Node *nd, std::vector< Edge > &be)llvm::Graph [inline]
getSuccNodes(Node *nd)llvm::Graph
Graph()llvm::Graph [inline]
Graph(std::vector< Node * > n, std::vector< Edge > e, Node *rt, Node *lt)llvm::Graph
hasEdge(Edge ed)llvm::Graph
hasEdgeAndWt(Edge ed)llvm::Graph
isLeaf(Node *n) const llvm::Graph [inline]
isRoot(Node *n) const llvm::Graph [inline]
makeUnDirectional()llvm::Graph
nodeList typedefllvm::Graph
nodeMapTy typedefllvm::Graph
printGraph()llvm::Graph
removeEdge(Edge ed)llvm::Graph
removeEdgeWithWt(Edge ed)llvm::Graph
reverseTopologicalSort()llvm::Graph
reverseWts()llvm::Graph
setWeight(Edge ed)llvm::Graph
sortNodeList(Node *par, nodeList &nl, std::vector< Edge > &be)llvm::Graph