-//===-- ProfilePaths.cpp - interface to insert instrumentation ---*- C++ -*--=//
+//===-- ProfilePaths.cpp - interface to insert instrumentation --*- C++ -*-===//
+//
+// The LLVM Compiler Infrastructure
+//
+// This file was developed by the LLVM research group and is distributed under
+// the University of Illinois Open Source License. See LICENSE.TXT for details.
+//
+//===----------------------------------------------------------------------===//
//
-// This inserts intrumentation for counting
-// execution of paths though a given function
-// Its implemented as a "Function" Pass, and called using opt
+// This inserts instrumentation for counting execution of paths though a given
+// function Its implemented as a "Function" Pass, and called using opt
//
// This pass is implemented by using algorithms similar to
// 1."Efficient Path Profiling": Ball, T. and Larus, J. R.,
-// Proceedings of Micro-29, Dec 1996, Paris, France.
+// Proceedings of Micro-29, Dec 1996, Paris, France.
// 2."Efficiently Counting Program events with support for on-line
// "queries": Ball T., ACM Transactions on Programming Languages
-// and systems, Sep 1994.
+// and systems, Sep 1994.
//
-// The algorithms work on a Graph constructed over the nodes
-// made from Basic Blocks: The transformations then take place on
-// the constucted graph (implementation in Graph.cpp and GraphAuxillary.cpp)
-// and finally, appropriate instrumentation is placed over suitable edges.
-// (code inserted through EdgeCode.cpp).
+// The algorithms work on a Graph constructed over the nodes made from Basic
+// Blocks: The transformations then take place on the constructed graph
+// (implementation in Graph.cpp and GraphAuxiliary.cpp) and finally, appropriate
+// instrumentation is placed over suitable edges. (code inserted through
+// EdgeCode.cpp).
//
-// The algorithm inserts code such that every acyclic path in the CFG
-// of a function is identified through a unique number. the code insertion
-// is optimal in the sense that its inserted over a minimal set of edges. Also,
-// the algorithm makes sure than initialization, path increment and counter
-// update can be collapsed into minimum number of edges.
+// The algorithm inserts code such that every acyclic path in the CFG of a
+// function is identified through a unique number. the code insertion is optimal
+// in the sense that its inserted over a minimal set of edges. Also, the
+// algorithm makes sure than initialization, path increment and counter update
+// can be collapsed into minimum number of edges.
+//
//===----------------------------------------------------------------------===//
-#include "llvm/Transforms/Instrumentation/ProfilePaths.h"
#include "llvm/Transforms/Utils/UnifyFunctionExitNodes.h"
-#include "llvm/Transforms/Instrumentation/Graph.h"
#include "llvm/Support/CFG.h"
#include "llvm/Constants.h"
#include "llvm/DerivedTypes.h"
-#include "llvm/iMemory.h"
-#include "llvm/GlobalVariable.h"
+#include "llvm/Instructions.h"
#include "llvm/Module.h"
-#include <iostream>
+#include "Graph.h"
#include <fstream>
+#include <cstdio>
-using std::vector;
+namespace llvm {
struct ProfilePaths : public FunctionPass {
bool runOnFunction(Function &F);
static RegisterOpt<ProfilePaths> X("paths", "Profile Paths");
-// createProfilePathsPass - Create a new pass to add path profiling
-//
-Pass *createProfilePathsPass() {
- return new ProfilePaths();
-}
-
-
static Node *findBB(std::vector<Node *> &st, BasicBlock *BB){
for(std::vector<Node *>::iterator si=st.begin(); si!=st.end(); ++si){
if(((*si)->getElement())==BB){
bool ProfilePaths::runOnFunction(Function &F){
static int mn = -1;
-
+ static int CountCounter = 1;
if(F.isExternal()) {
return false;
}
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;
Node *tmp;
Node *exitNode = 0, *startNode = 0;
- // The nodes must be uniquesly identified:
+ // The nodes must be uniquely identified:
// That is, no two nodes must hav same BB*
for (Function::iterator BB = F.begin(), BE = F.end(); BB != BE; ++BB) {
nodes.push_back(nd);
if(&*BB == ExitNode)
exitNode=nd;
- if(&*BB==F.begin())
+ if(BB==F.begin())
startNode=nd;
}
- // now do it againto insert edges
+ // now do it again to insert edges
for (Function::iterator BB = F.begin(), BE = F.end(); BB != BE; ++BB){
Node *nd=findBB(nodes, BB);
assert(nd && "No node for this edge!");
- for(BasicBlock::succ_iterator s=succ_begin(BB), se=succ_end(BB);
- s!=se; ++s){
+ for(succ_iterator s=succ_begin(BB), se=succ_end(BB); s!=se; ++s){
Node *nd2=findBB(nodes,*s);
assert(nd2 && "No node for this edge!");
Edge ed(nd,nd2,0);
// 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";
}
//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
// numPaths is the number of acyclic paths in the graph
int numPaths=valueAssignmentToEdges(g, nodePriority, be);
+ //if(numPaths<=1) return false;
+
+ static GlobalVariable *threshold = NULL;
+ static bool insertedThreshold = false;
+
+ if(!insertedThreshold){
+ threshold = new GlobalVariable(Type::IntTy, false,
+ GlobalValue::ExternalLinkage, 0,
+ "reopt_threshold");
+
+ F.getParent()->getGlobalList().push_back(threshold);
+ insertedThreshold = true;
+ }
+
+ assert(threshold && "GlobalVariable threshold not defined!");
+
+
+ if(fr->getParent()->getName() == "main"){
+ //initialize threshold
+
+ // FIXME: THIS IS HORRIBLY BROKEN. FUNCTION PASSES CANNOT DO THIS, EXCEPT
+ // IN THEIR INITIALIZE METHOD!!
+ Function *initialize =
+ F.getParent()->getOrInsertFunction("reoptimizerInitialize", Type::VoidTy,
+ PointerType::get(Type::IntTy), 0);
+
+ std::vector<Value *> trargs;
+ trargs.push_back(threshold);
+ new CallInst(initialize, trargs, "", fr->begin());
+ }
+
+
if(numPaths<=1 || numPaths >5000) return false;
#ifdef DEBUG_PATH_PROFILES
AllocaInst(Type::IntTy,
ConstantUInt::get(Type::UIntTy,1),"R");
- Instruction *countVar=new
- AllocaInst(Type::IntTy,
- ConstantUInt::get(Type::UIntTy, numPaths), "Count");
+ //Instruction *countVar=new
+ //AllocaInst(Type::IntTy,
+ // ConstantUInt::get(Type::UIntTy, numPaths), "Count");
+
+ //initialize counter array!
+ std::vector<Constant*> arrayInitialize;
+ for(int xi=0; xi<numPaths; xi++)
+ arrayInitialize.push_back(ConstantSInt::get(Type::IntTy, 0));
+
+ const ArrayType *ATy = ArrayType::get(Type::IntTy, numPaths);
+ Constant *initializer = ConstantArray::get(ATy, arrayInitialize);
+ char tempChar[20];
+ sprintf(tempChar, "Count%d", CountCounter);
+ CountCounter++;
+ std::string countStr = tempChar;
+ GlobalVariable *countVar = new GlobalVariable(ATy, false,
+ GlobalValue::InternalLinkage,
+ initializer, countStr,
+ F.getParent());
- static GlobalVariable *threshold = NULL;
- static bool insertedThreshold = false;
-
- if(!insertedThreshold){
- threshold = new GlobalVariable(Type::IntTy, false, false, 0,
- "reopt_threshold");
-
- F.getParent()->getGlobalList().push_back(threshold);
- insertedThreshold = true;
- }
-
- assert(threshold && "GlobalVariable threshold not defined!");
-
// insert initialization code in first (entry) BB
// this includes initializing r and count
- insertInTopBB(&F.getEntryNode(),numPaths, rVar, countVar, threshold);
+ insertInTopBB(&F.getEntryBlock(), numPaths, rVar, threshold);
//now process the graph: get path numbers,
//get increments along different paths,
return true; // Always modifies function
}
+
+} // End llvm namespace
projects / oota-llvm.git / blobdiff