diff options
| author | Anand Shukla <ashukla@cs.uiuc.edu> | 2003-02-09 21:15:36 +0000 |
|---|---|---|
| committer | Anand Shukla <ashukla@cs.uiuc.edu> | 2003-02-09 21:15:36 +0000 |
| commit | 893dfda486d51b2f03c73fdb035be8a60aa0f1c0 (patch) | |
| tree | 46a1733128b7ab42376644cbcfc26862505fa99c /llvm/lib | |
| parent | c15e3d93f2d61d26c2a6243f6386358608537541 (diff) | |
| download | bcm5719-llvm-893dfda486d51b2f03c73fdb035be8a60aa0f1c0.tar.gz bcm5719-llvm-893dfda486d51b2f03c73fdb035be8a60aa0f1c0.zip | |
*** empty log message ***
llvm-svn: 5522
Diffstat (limited to 'llvm/lib')
| -rw-r--r-- | llvm/lib/Transforms/Instrumentation/ProfilePaths/Graph.h | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/llvm/lib/Transforms/Instrumentation/ProfilePaths/Graph.h b/llvm/lib/Transforms/Instrumentation/ProfilePaths/Graph.h index 11713ebb955..d9801f8505f 100644 --- a/llvm/lib/Transforms/Instrumentation/ProfilePaths/Graph.h +++ b/llvm/lib/Transforms/Instrumentation/ProfilePaths/Graph.h @@ -410,7 +410,7 @@ public: //get the code to be inserted on the edge //This is determined from cond (1-6) - void getCode(Instruction *a, Instruction *b, Function *M, BasicBlock *BB, + void getCode(Instruction *a, Value *b, Function *M, BasicBlock *BB, std::vector<Value *> &retVec); }; @@ -423,7 +423,7 @@ void printEdge(Edge ed); //Do graph processing: to determine minimal edge increments, //appropriate code insertions etc and insert the code at //appropriate locations -void processGraph(Graph &g, Instruction *rInst, Instruction *countInst, std::vector<Edge> &be, std::vector<Edge> &stDummy, std::vector<Edge> &exDummy, int n, int MethNo, Value *threshold); +void 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); //print the graph (for debugging) void printGraph(Graph &g); @@ -432,7 +432,7 @@ void printGraph(Graph &g); //void printGraph(const Graph g); //insert a basic block with appropriate code //along a given edge -void insertBB(Edge ed, getEdgeCode *edgeCode, Instruction *rInst, Instruction *countInst, int n, int Methno, Value *threshold); +void insertBB(Edge ed, getEdgeCode *edgeCode, Instruction *rInst, Value *countInst, int n, int Methno, Value *threshold); //Insert the initialization code in the top BB //this includes initializing r, and count @@ -442,7 +442,7 @@ void insertBB(Edge ed, getEdgeCode *edgeCode, Instruction *rInst, Instruction *c //number of that path //Count is an array, where Count[k] represents //the number of executions of path k -void insertInTopBB(BasicBlock *front, int k, Instruction *rVar, Instruction *countVar, Value *threshold); +void insertInTopBB(BasicBlock *front, int k, Instruction *rVar, Value *threshold); //Add dummy edges corresponding to the back edges //If a->b is a backedge |
