LLVM API Documentation
#include <Graph.h>
Collaboration diagram for llvm::Graph:
Public Types | |
typedef std::map< Node *, std::vector< graphListElement > > | nodeMapTy |
typedef nodeMapTy::iterator | elementIterator |
typedef nodeMapTy::const_iterator | constElementIterator |
typedef std::vector< graphListElement > | nodeList |
Public Member Functions | |
Graph () | |
Graph (std::vector< Node * > n, std::vector< Edge > e, Node *rt, Node *lt) | |
void | addNode (Node *nd) |
void | addEdge (Edge ed, int w) |
void | addEdgeForce (Edge ed) |
void | setWeight (Edge ed) |
void | removeEdge (Edge ed) |
void | removeEdgeWithWt (Edge ed) |
bool | hasEdge (Edge ed) |
bool | hasEdgeAndWt (Edge ed) |
std::vector< Node * > | getSuccNodes (Node *nd) |
int | getNumberOfOutgoingEdges (Node *nd) const |
std::vector< Node * > | getPredNodes (Node *nd) |
int | getNumberOfIncomingEdges (Node *nd) |
std::vector< Node * > | getAllNodes () const |
std::vector< Node * > | getAllNodes () |
std::vector< Node * > | reverseTopologicalSort () |
void | reverseWts () |
void | makeUnDirectional () |
void | printGraph () |
void | getBackEdges (std::vector< Edge > &be, std::map< Node *, int > &d) |
nodeList & | sortNodeList (Node *par, nodeList &nl, std::vector< Edge > &be) |
Graph * | getMaxSpanningTree () |
nodeList & | getNodeList (Node *nd) |
nodeList & | getSortedNodeList (Node *nd, std::vector< Edge > &be) |
Node * | getRoot () |
Node *const | getRoot () const |
Node * | getExit () |
Node *const | getExit () const |
bool | isRoot (Node *n) const |
bool | isLeaf (Node *n) const |
Definition at line 206 of file Graph.h.
|
|
|
|
|
|
|
|
|
Definition at line 250 of file Graph.h. Referenced by getMaxSpanningTree(). |
|
Definition at line 41 of file Graph.cpp. References llvm::Edge::getFirst(), llvm::Edge::getRandId(), llvm::Edge::getSecond(), and llvm::Edge::getWeight(). |
|
Definition at line 187 of file Graph.cpp. References llvm::findNodeInList(), llvm::Edge::getFirst(), llvm::Edge::getRandId(), and llvm::Edge::getSecond(). Referenced by getMaxSpanningTree(), and llvm::processGraph(). |
|
Definition at line 205 of file Graph.cpp. References llvm::Edge::getFirst(), llvm::Edge::getRandId(), llvm::Edge::getSecond(), and llvm::Edge::getWeight(). Referenced by llvm::addDummyEdges(), and makeUnDirectional(). |
|
Definition at line 171 of file Graph.cpp. References getAllNodes(). Referenced by getMaxSpanningTree(). |
|
|
|
Definition at line 308 of file Graph.cpp. Referenced by addNode(), llvm::getChords(), llvm::getCodeInsertions(), llvm::getEdgeIncrements(), getMaxSpanningTree(), llvm::inc_DFS(), makeUnDirectional(), llvm::printGraph(), printGraph(), llvm::removeTreeEdges(), reverseTopologicalSort(), and reverseWts(). |
|
Referenced by llvm::getBBtrace(), and llvm::ProfilePaths::runOnFunction(). |
|
|
|
Definition at line 358 of file Graph.h. Referenced by llvm::addDummyEdges(), llvm::getCodeInsertions(), llvm::getPathFrmNode(), llvm::moveDummyCode(), and llvm::processGraph(). |
|
Definition at line 341 of file Graph.cpp. References addEdge(), addNode(), DEBUG, getAllNodes(), getNodeList(), getRoot(), llvm::Node::getWeight(), Graph(), llvm::printEdge(), printGraph(), llvm::printNode(), and llvm::Node::setWeight(). Referenced by llvm::processGraph(). |
|
Definition at line 341 of file Graph.h. Referenced by llvm::getChords(), llvm::getCodeInsertions(), getMaxSpanningTree(), getNumberOfIncomingEdges(), llvm::getPathFrmNode(), getPredNodes(), getSuccNodes(), llvm::inc_DFS(), makeUnDirectional(), llvm::printGraph(), printGraph(), llvm::removeTreeEdges(), and reverseWts(). |
|
Definition at line 294 of file Graph.cpp. References EE, and getNodeList(). Referenced by llvm::getCodeInsertions(). |
|
Definition at line 268 of file Graph.cpp. Referenced by llvm::getCodeInsertions(). |
|
Definition at line 281 of file Graph.cpp. References EE, llvm::findNodeInList(), and getNodeList(). |
|
|
|
Definition at line 354 of file Graph.h. Referenced by llvm::addDummyEdges(), llvm::getCodeInsertions(), llvm::getEdgeIncrements(), getMaxSpanningTree(), llvm::getPathFrmNode(), llvm::moveDummyCode(), llvm::processGraph(), and llvm::valueAssignmentToEdges(). |
|
Definition at line 347 of file Graph.h. References sortNodeList(). Referenced by llvm::getEdgeIncrements(), and llvm::valueAssignmentToEdges(). |
|
Definition at line 255 of file Graph.cpp. References getNodeList(). |
|
Definition at line 140 of file Graph.cpp. References llvm::findNodeInList(), llvm::Edge::getFirst(), llvm::Edge::getSecond(), and llvm::Edge::isNull(). Referenced by llvm::processGraph(). |
|
Definition at line 156 of file Graph.cpp. References llvm::Edge::getFirst(), llvm::Edge::getSecond(), llvm::Edge::getWeight(), and llvm::Edge::isNull(). Referenced by llvm::getChords(), llvm::getEdgeIncrements(), llvm::inc_DFS(), makeUnDirectional(), and llvm::removeTreeEdges(). |
|
Definition at line 365 of file Graph.h. Referenced by llvm::valueAssignmentToEdges(). |
|
|
|
Definition at line 489 of file Graph.cpp. References addEdgeForce(), DEBUG, getAllNodes(), getNodeList(), hasEdgeAndWt(), and llvm::printEdge(). Referenced by llvm::processGraph(). |
|
Definition at line 442 of file Graph.cpp. References getAllNodes(), and getNodeList(). Referenced by getMaxSpanningTree(). |
|
Definition at line 218 of file Graph.cpp. References llvm::Edge::getFirst(), and llvm::Edge::getSecond(). Referenced by llvm::addDummyEdges(), llvm::processGraph(), and llvm::removeTreeEdges(). |
|
Definition at line 233 of file Graph.cpp. References llvm::Edge::getFirst(), llvm::Edge::getSecond(), llvm::Edge::getWeight(), and llvm::Node::weight. Referenced by llvm::moveDummyCode(). |
|
Definition at line 460 of file Graph.cpp. References llvm::BLACK, getAllNodes(), and llvm::GREY. Referenced by llvm::valueAssignmentToEdges(). |
|
Definition at line 508 of file Graph.cpp. References getAllNodes(), and getNodeList(). Referenced by llvm::processGraph(). |
|
Definition at line 246 of file Graph.cpp. References llvm::findNodeInList(), llvm::Edge::getFirst(), llvm::Edge::getSecond(), llvm::Edge::getWeight(), and llvm::graphListElement::weight. |
|
Referenced by getSortedNodeList(). |