LLVM API Documentation
#include "llvm/Pass.h"#include "llvm/Module.h"#include "llvm/Instructions.h"#include "llvm/Support/Debug.h"#include <algorithm>#include "Graph.h"Include dependency graph for GraphAuxiliary.cpp:
Go to the source code of this file.
Namespaces | |
| namespace | llvm |
Functions | |
| static bool | llvm::edgesEqual (Edge ed1, Edge ed2) |
| static void | llvm::getChords (vector< Edge > &chords, Graph &g, Graph st) |
| static void | llvm::removeTreeEdges (Graph &g, Graph &t) |
| int | llvm::valueAssignmentToEdges (Graph &g, map< Node *, int > nodePriority, vector< Edge > &be) |
| static int | llvm::inc_Dir (Edge e, Edge f) |
| static void | llvm::inc_DFS (Graph &g, Graph &t, map< Edge, int, EdgeCompare2 > &Increment, int events, Node *v, Edge e) |
| static map< Edge, int, EdgeCompare2 > | llvm::getEdgeIncrements (Graph &g, Graph &t, vector< Edge > &be) |
| const graphListElement * | llvm::findNodeInList (const Graph::nodeList &NL, Node *N) |
| graphListElement * | llvm::findNodeInList (Graph::nodeList &NL, Node *N) |
| static void | llvm::getCodeInsertions (Graph &g, map< Edge, getEdgeCode *, EdgeCompare2 > &instr, vector< Edge > &chords, map< Edge, int, EdgeCompare2 > &edIncrements) |
| void | llvm::addDummyEdges (vector< Edge > &stDummy, vector< Edge > &exDummy, Graph &g, vector< Edge > &be) |
| void | llvm::printEdge (Edge ed) |
| static void | llvm::moveDummyCode (vector< Edge > &stDummy, vector< Edge > &exDummy, vector< Edge > &be, map< Edge, getEdgeCode *, EdgeCompare2 > &insertions, Graph &g) |
| void | llvm::processGraph (Graph &g, Instruction *rInst, Value *countInst, vector< Edge > &be, vector< Edge > &stDummy, vector< Edge > &exDummy, int numPaths, int MethNo, Value *threshold) |
| void | llvm::printGraph (Graph &g) |