1 //===-- EdgeCode.cpp - generate LLVM instrumentation code -----------------===//
2 //It implements the class EdgeCode: which provides
3 //support for inserting "appropriate" instrumentation at
4 //designated points in the graph
6 //It also has methods to insert initialization code in
8 //===----------------------------------------------------------------------===//
11 #include "llvm/Constants.h"
12 #include "llvm/DerivedTypes.h"
13 #include "llvm/iMemory.h"
14 #include "llvm/iTerminators.h"
15 #include "llvm/iOther.h"
16 #include "llvm/iOperators.h"
17 #include "llvm/iPHINode.h"
18 #include "llvm/Module.h"
21 #define INSERT_LOAD_COUNT
27 static void getTriggerCode(Module *M, BasicBlock *BB, int MethNo, Value *pathNo,
28 Value *cnt, Instruction *rInst){
30 vector<const Type*> args;
31 //args.push_back(PointerType::get(Type::SByteTy));
32 args.push_back(Type::IntTy);
33 args.push_back(Type::IntTy);
34 //args.push_back(Type::IntTy);
35 args.push_back(PointerType::get(Type::IntTy));
36 args.push_back(PointerType::get(Type::IntTy));
37 const FunctionType *MTy = FunctionType::get(Type::VoidTy, args, false);
39 vector<Value *> tmpVec;
40 tmpVec.push_back(Constant::getNullValue(Type::LongTy));
41 tmpVec.push_back(Constant::getNullValue(Type::LongTy));
42 Instruction *Idx = new GetElementPtrInst(cnt, tmpVec, "");//,
43 BB->getInstList().push_back(Idx);
45 Function *trigMeth = M->getOrInsertFunction("trigger", MTy);
46 assert(trigMeth && "trigger method could not be inserted!");
48 vector<Value *> trargs;
50 trargs.push_back(ConstantSInt::get(Type::IntTy,MethNo));
51 trargs.push_back(pathNo);
52 trargs.push_back(Idx);
53 trargs.push_back(rInst);
55 Instruction *callInst=new CallInst(trigMeth, trargs, "");//, BB->begin());
56 BB->getInstList().push_back(callInst);
57 //triggerInst = new CallInst(trigMeth, trargs, "");//, InsertPos);
61 //get the code to be inserted on the edge
62 //This is determined from cond (1-6)
63 void getEdgeCode::getCode(Instruction *rInst, Value *countInst,
64 Function *M, BasicBlock *BB,
65 vector<Value *> &retVec){
67 //Instruction *InsertPos = BB->getInstList().begin();
69 //now check for cdIn and cdOut
72 cdOut->getCode(rInst, countInst, M, BB, retVec);
76 cdIn->getCode(rInst, countInst, M, BB, retVec);
79 //case: r=k code to be inserted
82 Value *val=ConstantSInt::get(Type::IntTy,inc);
84 Instruction *stInst=new StoreInst(val, rInst);//, InsertPos);
85 BB->getInstList().push_back(stInst);
90 //case: r=0 to be inserted
93 Instruction *stInst = new StoreInst(ConstantSInt::getNullValue(Type::IntTy), rInst);//, InsertPos);
94 BB->getInstList().push_back(stInst);
101 Instruction *ldInst = new LoadInst(rInst, "ti1");//, InsertPos);
102 BB->getInstList().push_back(ldInst);
103 Value *val = ConstantSInt::get(Type::IntTy,inc);
104 Instruction *addIn = BinaryOperator::create(Instruction::Add, ldInst, val,
105 "ti2");//, InsertPos);
106 BB->getInstList().push_back(addIn);
108 Instruction *stInst = new StoreInst(addIn, rInst);//, InsertPos);
109 BB->getInstList().push_back(stInst);
116 vector<Value *> tmpVec;
117 tmpVec.push_back(Constant::getNullValue(Type::LongTy));
118 tmpVec.push_back(ConstantSInt::get(Type::LongTy, inc));
119 Instruction *Idx = new GetElementPtrInst(countInst, tmpVec, "");//,
121 //Instruction *Idx = new GetElementPtrInst(countInst,
122 // vector<Value*>(1,ConstantSInt::get(Type::LongTy, inc)),
123 // "");//, InsertPos);
124 BB->getInstList().push_back(Idx);
126 Instruction *ldInst=new LoadInst(Idx, "ti1");//, InsertPos);
127 BB->getInstList().push_back(ldInst);
129 Value *val = ConstantSInt::get(Type::IntTy, 1);
130 //Instruction *addIn =
131 Instruction *newCount =
132 BinaryOperator::create(Instruction::Add, ldInst, val,"ti2");
133 BB->getInstList().push_back(newCount);
137 //Instruction *stInst=new StoreInst(addIn, Idx, InsertPos);
138 Instruction *stInst=new StoreInst(newCount, Idx);//, InsertPos);
139 BB->getInstList().push_back(stInst);
142 Value *trAddIndex = ConstantSInt::get(Type::IntTy,inc);
144 retVec.push_back(newCount);
145 retVec.push_back(trAddIndex);
147 //getTriggerCode(M->getParent(), BB, MethNo,
148 // ConstantSInt::get(Type::IntTy,inc), newCount, triggerInst);
151 assert(inc>=0 && "IT MUST BE POSITIVE NOW");
155 //case: count[r+inc]++
159 Instruction *ldIndex=new LoadInst(rInst, "ti1");//, InsertPos);
160 BB->getInstList().push_back(ldIndex);
162 Value *val=ConstantSInt::get(Type::IntTy,inc);
163 Instruction *addIndex=BinaryOperator::
164 create(Instruction::Add, ldIndex, val,"ti2");//, InsertPos);
165 BB->getInstList().push_back(addIndex);
167 //now load count[addIndex]
168 Instruction *castInst=new CastInst(addIndex,
169 Type::LongTy,"ctin");//, InsertPos);
170 BB->getInstList().push_back(castInst);
172 vector<Value *> tmpVec;
173 tmpVec.push_back(Constant::getNullValue(Type::LongTy));
174 tmpVec.push_back(castInst);
175 Instruction *Idx = new GetElementPtrInst(countInst, tmpVec, "");//,
177 BB->getInstList().push_back(Idx);
179 Instruction *ldInst=new LoadInst(Idx, "ti3");//, InsertPos);
180 BB->getInstList().push_back(ldInst);
182 Value *cons=ConstantSInt::get(Type::IntTy,1);
184 //std::cerr<<"Type ldInst:"<<ldInst->getType()<<"\t cons:"<<cons->getType()<<"\n";
185 Instruction *newCount = BinaryOperator::create(Instruction::Add, ldInst,
187 BB->getInstList().push_back(newCount);
190 Instruction *stInst = new StoreInst(newCount, Idx);//, InsertPos);
191 BB->getInstList().push_back(stInst);
194 retVec.push_back(newCount);
195 retVec.push_back(addIndex);
197 //getTriggerCode(M->getParent(), BB, MethNo, addIndex, newCount, triggerInst);
206 Instruction *ldIndex=new LoadInst(rInst, "ti1");//, InsertPos);
207 BB->getInstList().push_back(ldIndex);
209 //now load count[addIndex]
210 Instruction *castInst2=new CastInst(ldIndex, Type::LongTy,"ctin");
211 BB->getInstList().push_back(castInst2);
213 vector<Value *> tmpVec;
214 tmpVec.push_back(Constant::getNullValue(Type::LongTy));
215 tmpVec.push_back(castInst2);
216 Instruction *Idx = new GetElementPtrInst(countInst, tmpVec, "");//,
218 //Instruction *Idx = new GetElementPtrInst(countInst,
219 // vector<Value*>(1,castInst2), "");
221 BB->getInstList().push_back(Idx);
223 Instruction *ldInst=new LoadInst(Idx, "ti2");//, InsertPos);
224 BB->getInstList().push_back(ldInst);
226 Value *cons=ConstantSInt::get(Type::IntTy,1);
229 Instruction *newCount = BinaryOperator::create(Instruction::Add, ldInst,
231 BB->getInstList().push_back(newCount);
234 Instruction *stInst = new StoreInst(newCount, Idx);//, InsertPos);
235 BB->getInstList().push_back(stInst);
238 retVec.push_back(newCount);
239 retVec.push_back(ldIndex);
248 //Insert the initialization code in the top BB
249 //this includes initializing r, and count
250 //r is like an accumulator, that
251 //keeps on adding increments as we traverse along a path
252 //and at the end of the path, r contains the path
253 //number of that path
254 //Count is an array, where Count[k] represents
255 //the number of executions of path k
256 void insertInTopBB(BasicBlock *front,
258 Instruction *rVar, Value *threshold){
259 //rVar is variable r,
260 //countVar is count[]
262 Value *Int0 = ConstantInt::get(Type::IntTy, 0);
264 //now push all instructions in front of the BB
265 BasicBlock::iterator here=front->begin();
266 front->getInstList().insert(here, rVar);
267 //front->getInstList().insert(here,countVar);
269 //Initialize Count[...] with 0
271 //for (int i=0;i<k; i++){
272 //Value *GEP2 = new GetElementPtrInst(countVar,
273 // vector<Value *>(1,ConstantSInt::get(Type::LongTy, i)),
275 //new StoreInst(Int0, GEP2, here);
278 //store uint 0, uint *%R
279 new StoreInst(Int0, rVar, here);
281 //insert initialize function for initializing
282 //vector<const Type*> inCountArgs;
283 //inCountArgs.push_back(PointerType::get(Type::IntTy));
284 //inCountArgs.push_back(Type::IntTy);
286 //const FunctionType *cFty = FunctionType::get(Type::VoidTy, inCountArgs,
288 //Function *inCountMth = front->getParent()->getParent()->getOrInsertFunction("llvmInitializeCounter", cFty);
289 //assert(inCountMth && "Initialize method could not be inserted!");
291 //vector<Value *> iniArgs;
292 //iniArgs.push_back(countVar);
293 //iniArgs.push_back(ConstantSInt::get(Type::IntTy, k));
294 //new CallInst(inCountMth, iniArgs, "", here);
297 if(front->getParent()->getName() == "main"){
298 //intialize threshold
299 vector<const Type*> initialize_args;
300 initialize_args.push_back(PointerType::get(Type::IntTy));
302 const FunctionType *Fty = FunctionType::get(Type::VoidTy, initialize_args,
304 Function *initialMeth = front->getParent()->getParent()->getOrInsertFunction("reoptimizerInitialize", Fty);
305 assert(initialMeth && "Initialize method could not be inserted!");
307 vector<Value *> trargs;
308 trargs.push_back(threshold);
310 new CallInst(initialMeth, trargs, "", here);
315 //insert a basic block with appropriate code
317 void insertBB(Edge ed,
318 getEdgeCode *edgeCode,
321 int numPaths, int Methno, Value *threshold){
323 BasicBlock* BB1=ed.getFirst()->getElement();
324 BasicBlock* BB2=ed.getSecond()->getElement();
326 #ifdef DEBUG_PATH_PROFILES
328 cerr<<"Edges with codes ######################\n";
329 cerr<<BB1->getName()<<"->"<<BB2->getName()<<"\n";
330 cerr<<"########################\n";
333 //We need to insert a BB between BB1 and BB2
334 TerminatorInst *TI=BB1->getTerminator();
335 BasicBlock *newBB=new BasicBlock("counter", BB1->getParent());
337 //get code for the new BB
338 vector<Value *> retVec;
340 edgeCode->getCode(rInst, countInst, BB1->getParent(), newBB, retVec);
342 BranchInst *BI = cast<BranchInst>(TI);
344 //Is terminator a branch instruction?
345 //then we need to change branch destinations to include new BB
347 if(BI->isUnconditional()){
348 BI->setUnconditionalDest(newBB);
351 if(BI->getSuccessor(0)==BB2)
352 BI->setSuccessor(0, newBB);
354 if(BI->getSuccessor(1)==BB2)
355 BI->setSuccessor(1, newBB);
358 BasicBlock *triggerBB = NULL;
360 triggerBB = new BasicBlock("trigger", BB1->getParent());
361 getTriggerCode(BB1->getParent()->getParent(), triggerBB, Methno,
362 retVec[1], countInst, rInst);//retVec[0]);
364 //Instruction *castInst = new CastInst(retVec[0], Type::IntTy, "");
365 Instruction *etr = new LoadInst(threshold, "threshold");
367 //std::cerr<<"type1: "<<etr->getType()<<" type2: "<<retVec[0]->getType()<<"\n";
368 Instruction *cmpInst = new SetCondInst(Instruction::SetLE, etr,
370 Instruction *newBI2 = new BranchInst(triggerBB, BB2, cmpInst);
371 //newBB->getInstList().push_back(castInst);
372 newBB->getInstList().push_back(etr);
373 newBB->getInstList().push_back(cmpInst);
374 newBB->getInstList().push_back(newBI2);
376 //triggerBB->getInstList().push_back(triggerInst);
377 Instruction *triggerBranch = new BranchInst(BB2);
378 triggerBB->getInstList().push_back(triggerBranch);
381 Instruction *newBI2=new BranchInst(BB2);
382 newBB->getInstList().push_back(newBI2);
385 //now iterate over BB2, and set its Phi nodes right
386 for(BasicBlock::iterator BB2Inst = BB2->begin(), BBend = BB2->end();
387 BB2Inst != BBend; ++BB2Inst){
389 if(PHINode *phiInst=dyn_cast<PHINode>(BB2Inst)){
390 int bbIndex=phiInst->getBasicBlockIndex(BB1);
392 phiInst->setIncomingBlock(bbIndex, newBB);
394 ///check if trigger!=null, then add value corresponding to it too!
396 assert(triggerBB && "BasicBlock with trigger should not be null!");
397 Value *vl = phiInst->getIncomingValue((unsigned int)bbIndex);
398 phiInst->addIncoming(vl, triggerBB);