blob: 5bfd9893d708c85a1a03df65b5a8f364576727a4 [file] [log] [blame]
Tanya Lattner658c5bc2003-05-31 20:01:37 +00001//===- CloneTrace.cpp - Clone a trace -------------------------------------===//
Misha Brukmanfd939082005-04-21 23:48:37 +00002//
John Criswellb576c942003-10-20 19:43:21 +00003// The LLVM Compiler Infrastructure
4//
5// This file was developed by the LLVM research group and is distributed under
6// the University of Illinois Open Source License. See LICENSE.TXT for details.
Misha Brukmanfd939082005-04-21 23:48:37 +00007//
John Criswellb576c942003-10-20 19:43:21 +00008//===----------------------------------------------------------------------===//
Tanya Lattner6074d2f2003-05-30 15:50:18 +00009//
Chris Lattner23b4c682004-02-04 01:19:43 +000010// This file implements the CloneTrace interface, which is used when writing
11// runtime optimizations. It takes a vector of basic blocks clones the basic
12// blocks, removes internal phi nodes, adds it to the same function as the
13// original (although there is no jump to it) and returns the new vector of
14// basic blocks.
Tanya Lattner6074d2f2003-05-30 15:50:18 +000015//
16//===----------------------------------------------------------------------===//
17
Brian Gaekec58a7f42004-05-19 09:08:14 +000018#include "llvm/Analysis/Trace.h"
Tanya Lattner658c5bc2003-05-31 20:01:37 +000019#include "llvm/Transforms/Utils/Cloning.h"
Misha Brukman47b14a42004-07-29 17:30:56 +000020#include "llvm/Instructions.h"
Tanya Lattner6074d2f2003-05-30 15:50:18 +000021#include "llvm/Function.h"
Brian Gaekec58a7f42004-05-19 09:08:14 +000022#include "ValueMapper.h"
Chris Lattnerf7703df2004-01-09 06:12:26 +000023using namespace llvm;
Brian Gaeked0fde302003-11-11 22:41:34 +000024
Tanya Lattner6074d2f2003-05-30 15:50:18 +000025//Clones the trace (a vector of basic blocks)
Chris Lattnerf7703df2004-01-09 06:12:26 +000026std::vector<BasicBlock *>
27llvm::CloneTrace(const std::vector<BasicBlock*> &origTrace) {
Tanya Lattner6074d2f2003-05-30 15:50:18 +000028 std::vector<BasicBlock *> clonedTrace;
29 std::map<const Value*, Value*> ValueMap;
Misha Brukmanfd939082005-04-21 23:48:37 +000030
Tanya Lattner6074d2f2003-05-30 15:50:18 +000031 //First, loop over all the Basic Blocks in the trace and copy
32 //them using CloneBasicBlock. Also fix the phi nodes during
33 //this loop. To fix the phi nodes, we delete incoming branches
34 //that are not in the trace.
35 for(std::vector<BasicBlock *>::const_iterator T = origTrace.begin(),
Jeff Cohen9d809302005-04-23 21:38:35 +000036 End = origTrace.end(); T != End; ++T) {
Tanya Lattner6074d2f2003-05-30 15:50:18 +000037
38 //Clone Basic Block
Chris Lattner23b4c682004-02-04 01:19:43 +000039 BasicBlock *clonedBlock =
40 CloneBasicBlock(*T, ValueMap, ".tr", (*T)->getParent());
Misha Brukmanfd939082005-04-21 23:48:37 +000041
Tanya Lattner6074d2f2003-05-30 15:50:18 +000042 //Add it to our new trace
43 clonedTrace.push_back(clonedBlock);
44
45 //Add this new mapping to our Value Map
46 ValueMap[*T] = clonedBlock;
47
Tanya Lattner6074d2f2003-05-30 15:50:18 +000048 //Loop over the phi instructions and delete operands
49 //that are from blocks not in the trace
50 //only do this if we are NOT the first block
51 if(T != origTrace.begin()) {
52 for (BasicBlock::iterator I = clonedBlock->begin();
Reid Spencer2da5c3d2004-09-15 17:06:42 +000053 isa<PHINode>(I); ++I) {
54 PHINode *PN = cast<PHINode>(I);
55 //get incoming value for the previous BB
56 Value *V = PN->getIncomingValueForBlock(*(T-1));
57 assert(V && "No incoming value from a BasicBlock in our trace!");
Misha Brukmanfd939082005-04-21 23:48:37 +000058
Reid Spencer2da5c3d2004-09-15 17:06:42 +000059 //remap our phi node to point to incoming value
60 ValueMap[*&I] = V;
Misha Brukmanfd939082005-04-21 23:48:37 +000061
Reid Spencer2da5c3d2004-09-15 17:06:42 +000062 //remove phi node
63 clonedBlock->getInstList().erase(PN);
Tanya Lattner6074d2f2003-05-30 15:50:18 +000064 }
65 }
66 }
67
68 //Second loop to do the remapping
69 for(std::vector<BasicBlock *>::const_iterator BB = clonedTrace.begin(),
Jeff Cohen9d809302005-04-23 21:38:35 +000070 BE = clonedTrace.end(); BB != BE; ++BB) {
Tanya Lattner6074d2f2003-05-30 15:50:18 +000071 for(BasicBlock::iterator I = (*BB)->begin(); I != (*BB)->end(); ++I) {
Misha Brukmanfd939082005-04-21 23:48:37 +000072
Tanya Lattner6074d2f2003-05-30 15:50:18 +000073 //Loop over all the operands of the instruction
74 for(unsigned op=0, E = I->getNumOperands(); op != E; ++op) {
Jeff Cohen9d809302005-04-23 21:38:35 +000075 const Value *Op = I->getOperand(op);
Tanya Lattner6074d2f2003-05-30 15:50:18 +000076
Jeff Cohen9d809302005-04-23 21:38:35 +000077 //Get it out of the value map
78 Value *V = ValueMap[Op];
79
80 //If not in the value map, then its outside our trace so ignore
81 if(V != 0)
82 I->setOperand(op,V);
Tanya Lattner6074d2f2003-05-30 15:50:18 +000083 }
84 }
85 }
Misha Brukmanfd939082005-04-21 23:48:37 +000086
Tanya Lattner6074d2f2003-05-30 15:50:18 +000087 //return new vector of basic blocks
88 return clonedTrace;
89}
Brian Gaekec58a7f42004-05-19 09:08:14 +000090
91/// CloneTraceInto - Clone T into NewFunc. Original<->clone mapping is
92/// saved in ValueMap.
93///
94void llvm::CloneTraceInto(Function *NewFunc, Trace &T,
95 std::map<const Value*, Value*> &ValueMap,
96 const char *NameSuffix) {
97 assert(NameSuffix && "NameSuffix cannot be null!");
98
99 // Loop over all of the basic blocks in the trace, cloning them as
100 // appropriate.
101 //
102 for (Trace::const_iterator BI = T.begin(), BE = T.end(); BI != BE; ++BI) {
103 const BasicBlock *BB = *BI;
104
105 // Create a new basic block and copy instructions into it!
106 BasicBlock *CBB = CloneBasicBlock(BB, ValueMap, NameSuffix, NewFunc);
107 ValueMap[BB] = CBB; // Add basic block mapping.
108 }
109
110 // Loop over all of the instructions in the new function, fixing up operand
111 // references as we go. This uses ValueMap to do all the hard work.
112 //
113 for (Function::iterator BB =
114 cast<BasicBlock>(ValueMap[T.getEntryBasicBlock()]),
115 BE = NewFunc->end(); BB != BE; ++BB)
116 // Loop over all instructions, fixing each one as we find it...
117 for (BasicBlock::iterator II = BB->begin(); II != BB->end(); ++II)
118 RemapInstruction(II, ValueMap);
119}
120