Graph.h File Reference

#include "llvm/BasicBlock.h"
#include <map>
#include <cstdlib>

Include dependency graph for Graph.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces

namespace llvm

namespace std

Classes

class llvm::Node

class llvm::Edge

struct llvm::graphListElement

struct std::less< Node * >

struct std::less< Edge >

struct llvm::BBSort

struct llvm::NodeListSort

struct llvm::EdgeCompare2

class llvm::Graph

class llvm::getEdgeCode

Enumerations

enum llvm::Color { llvm::WHITE, llvm::GREY, llvm::BLACK }

Functions

void llvm::printEdge (Edge ed)

void llvm::processGraph (Graph &g, Instruction *rInst, Value *countInst, std::vector< Edge > &be, std::vector< Edge > &stDummy, std::vector< Edge > &exDummy, int n, int MethNo, Value *threshold)

void llvm::printGraph (Graph &g)

void llvm::insertBB (Edge ed, getEdgeCode *edgeCode, Instruction *rInst, Value *countInst, int numPaths, int Methno, Value *threshold)

void llvm::insertInTopBB (BasicBlock *front, int k, Instruction *rVar, Value *threshold)

void llvm::addDummyEdges (std::vector< Edge > &stDummy, std::vector< Edge > &exDummy, Graph &g, std::vector< Edge > &be)

int llvm::valueAssignmentToEdges (Graph &g, std::map< Node *, int > nodePriority, std::vector< Edge > &be)

void llvm::getBBtrace (std::vector< BasicBlock * > &vBB, int pathNo, Function *M)


Namespaces
namespace	llvm
namespace	std
Classes
class	llvm::Node
class	llvm::Edge
struct	llvm::graphListElement
struct	std::less< Node * >
struct	std::less< Edge >
struct	llvm::BBSort
struct	llvm::NodeListSort
struct	llvm::EdgeCompare2
class	llvm::Graph
class	llvm::getEdgeCode
Enumerations
enum	llvm::Color { llvm::WHITE, llvm::GREY, llvm::BLACK }
Functions
void	llvm::printEdge (Edge ed)
void	llvm::processGraph (Graph &g, Instruction rInst, Value countInst, std::vector< Edge > &be, std::vector< Edge > &stDummy, std::vector< Edge > &exDummy, int n, int MethNo, Value *threshold)
void	llvm::printGraph (Graph &g)
void	llvm::insertBB (Edge ed, getEdgeCode edgeCode, Instruction rInst, Value countInst, int numPaths, int Methno, Value threshold)
void	llvm::insertInTopBB (BasicBlock front, int k, Instruction rVar, Value *threshold)
void	llvm::addDummyEdges (std::vector< Edge > &stDummy, std::vector< Edge > &exDummy, Graph &g, std::vector< Edge > &be)
int	llvm::valueAssignmentToEdges (Graph &g, std::map< Node *, int > nodePriority, std::vector< Edge > &be)
void	llvm::getBBtrace (std::vector< BasicBlock * > &vBB, int pathNo, Function *M)