RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-12-28 22:43:29 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Update for new UnifyFunction... API

Browse Source 
Remove using decl

llvm-svn: 8458
This commit is contained in:
Chris Lattner 2003-09-10 20:35:33 +00:00
parent 3e9d3081fc
commit 0d124f6067
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
lib/Transforms/Instrumentation/ProfilePaths/ProfilePaths.cpp
View File

@ -35,7 +35,6 @@
#include "Graph.h"
#include <fstream>
#include "Config/stdio.h"
using std::vector;
struct ProfilePaths : public FunctionPass {
bool runOnFunction(Function &F);
@ -72,7 +71,8 @@ bool ProfilePaths::runOnFunction(Function &F){
mn++;
// Transform the cfg s.t. we have just one exit node
BasicBlock *ExitNode = getAnalysis<UnifyFunctionExitNodes>().getExitNode();
BasicBlock *ExitNode =
getAnalysis<UnifyFunctionExitNodes>().getReturnBlock();
//iterating over BBs and making graph
std::vector<Node *> nodes;
@ -118,13 +118,13 @@ bool ProfilePaths::runOnFunction(Function &F){
// The graph is made acyclic: this is done
// by removing back edges for now, and adding them later on
vector<Edge> be;
std::vector<Edge> be;
std::map<Node *, int> nodePriority; //it ranks nodes in depth first order traversal
g.getBackEdges(be, nodePriority);
#ifdef DEBUG_PATH_PROFILES
std::cerr<<"BackEdges-------------\n";
for(vector<Edge>::iterator VI=be.begin(); VI!=be.end(); ++VI){
for (std::vector<Edge>::iterator VI=be.begin(); VI!=be.end(); ++VI){
printEdge(*VI);
cerr<<"\n";
}
@ -140,8 +140,8 @@ bool ProfilePaths::runOnFunction(Function &F){
//Then we add 2 back edges for it:
//1. from root->b (in vector stDummy)
//and 2. from a->exit (in vector exDummy)
vector<Edge> stDummy;
vector<Edge> exDummy;
std::vector<Edge> stDummy;
std::vector<Edge> exDummy;
addDummyEdges(stDummy, exDummy, g, be);
#ifdef DEBUG_PATH_PROFILES
@ -183,7 +183,7 @@ bool ProfilePaths::runOnFunction(Function &F){
F.getParent()->getOrInsertFunction("reoptimizerInitialize", Type::VoidTy,
PointerType::get(Type::IntTy), 0);
vector<Value *> trargs;
std::vector<Value *> trargs;
trargs.push_back(threshold);
new CallInst(initialize, trargs, "", fr->begin());
}