Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 1 | //===- PreSelection.cpp - Specialize LLVM code for target machine ---------===// |
John Criswell | b576c94 | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 2 | // |
| 3 | // 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. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 9 | // |
| 10 | // This file defines the PreSelection pass which specializes LLVM code for a |
| 11 | // target machine, while remaining in legal portable LLVM form and |
| 12 | // preserving type information and type safety. This is meant to enable |
| 13 | // dataflow optimizations on target-specific operations such as accesses to |
| 14 | // constants, globals, and array indexing. |
| 15 | // |
| 16 | //===----------------------------------------------------------------------===// |
| 17 | |
Chris Lattner | 67699ff | 2003-09-01 20:33:07 +0000 | [diff] [blame] | 18 | #include "SparcInternals.h" |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 19 | #include "llvm/Constants.h" |
Misha Brukman | bb8c863 | 2003-10-22 04:51:36 +0000 | [diff] [blame] | 20 | #include "llvm/DerivedTypes.h" |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 21 | #include "llvm/iMemory.h" |
| 22 | #include "llvm/iPHINode.h" |
| 23 | #include "llvm/iOther.h" |
Misha Brukman | 523b30c | 2003-10-22 03:27:45 +0000 | [diff] [blame] | 24 | #include "llvm/Module.h" |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 25 | #include "llvm/Pass.h" |
Misha Brukman | 523b30c | 2003-10-22 03:27:45 +0000 | [diff] [blame] | 26 | #include "llvm/Support/InstVisitor.h" |
| 27 | #include "llvm/Target/TargetInstrInfo.h" |
| 28 | #include "llvm/Target/TargetMachine.h" |
| 29 | #include "llvm/Transforms/Scalar.h" |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 30 | #include <algorithm> |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 31 | |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 32 | namespace llvm { |
| 33 | |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 34 | namespace { |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 35 | |
| 36 | //===--------------------------------------------------------------------===// |
| 37 | // PreSelection Pass - Specialize LLVM code for the current target machine. |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 38 | // |
Misha Brukman | feed25f | 2003-11-07 17:31:22 +0000 | [diff] [blame] | 39 | class PreSelection : public FunctionPass, public InstVisitor<PreSelection> { |
Vikram S. Adve | cf81945 | 2003-06-05 21:12:56 +0000 | [diff] [blame] | 40 | const TargetInstrInfo &instrInfo; |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 41 | |
| 42 | public: |
Chris Lattner | dac9131 | 2003-10-21 14:49:19 +0000 | [diff] [blame] | 43 | PreSelection(const TargetMachine &T) |
Misha Brukman | feed25f | 2003-11-07 17:31:22 +0000 | [diff] [blame] | 44 | : instrInfo(T.getInstrInfo()) {} |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 45 | |
Misha Brukman | feed25f | 2003-11-07 17:31:22 +0000 | [diff] [blame] | 46 | // runOnFunction - apply this pass to each Function |
| 47 | bool runOnFunction(Function &F) { |
| 48 | visit(F); |
Chris Lattner | dac9131 | 2003-10-21 14:49:19 +0000 | [diff] [blame] | 49 | return true; |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 50 | } |
| 51 | |
| 52 | // These methods do the actual work of specializing code |
| 53 | void visitInstruction(Instruction &I); // common work for every instr. |
| 54 | void visitGetElementPtrInst(GetElementPtrInst &I); |
Vikram S. Adve | 9635867 | 2003-05-31 07:34:57 +0000 | [diff] [blame] | 55 | void visitCallInst(CallInst &I); |
Chris Lattner | 4c62e79 | 2003-10-21 16:09:23 +0000 | [diff] [blame] | 56 | void visitPHINode(PHINode &PN); |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 57 | |
| 58 | // Helper functions for visiting operands of every instruction |
Vikram S. Adve | 9635867 | 2003-05-31 07:34:57 +0000 | [diff] [blame] | 59 | // |
| 60 | // visitOperands() works on every operand in [firstOp, lastOp-1]. |
| 61 | // If lastOp==0, lastOp defaults to #operands or #incoming Phi values. |
| 62 | // |
| 63 | // visitOneOperand() does all the work for one operand. |
| 64 | // |
Chris Lattner | d48a1d7 | 2003-10-21 16:06:07 +0000 | [diff] [blame] | 65 | void visitOperands(Instruction &I, int firstOp=0); |
Vikram S. Adve | 9635867 | 2003-05-31 07:34:57 +0000 | [diff] [blame] | 66 | void visitOneOperand(Instruction &I, Value* Op, unsigned opNum, |
| 67 | Instruction& insertBefore); |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 68 | }; |
Chris Lattner | ec8aae3 | 2003-04-24 18:35:51 +0000 | [diff] [blame] | 69 | |
Misha Brukman | feed25f | 2003-11-07 17:31:22 +0000 | [diff] [blame] | 70 | #if 0 |
Chris Lattner | ec8aae3 | 2003-04-24 18:35:51 +0000 | [diff] [blame] | 71 | // Register the pass... |
Misha Brukman | feed25f | 2003-11-07 17:31:22 +0000 | [diff] [blame] | 72 | RegisterPass<PreSelection> X("preselect", |
| 73 | "Specialize LLVM code for a target machine" |
| 74 | createPreselectionPass); |
| 75 | #endif |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 76 | |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 77 | } // end anonymous namespace |
| 78 | |
| 79 | |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 80 | //------------------------------------------------------------------------------ |
| 81 | // Helper functions used by methods of class PreSelection |
| 82 | //------------------------------------------------------------------------------ |
| 83 | |
| 84 | |
| 85 | // getGlobalAddr(): Put address of a global into a v. register. |
Misha Brukman | 523b30c | 2003-10-22 03:27:45 +0000 | [diff] [blame] | 86 | static GetElementPtrInst* getGlobalAddr(Value* ptr, Instruction& insertBefore) { |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 87 | if (isa<ConstantPointerRef>(ptr)) |
| 88 | ptr = cast<ConstantPointerRef>(ptr)->getValue(); |
| 89 | |
Chris Lattner | 2ab5e12 | 2003-06-04 01:24:40 +0000 | [diff] [blame] | 90 | return (isa<GlobalVariable>(ptr)) |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 91 | ? new GetElementPtrInst(ptr, |
| 92 | std::vector<Value*>(1, ConstantSInt::get(Type::LongTy, 0U)), |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 93 | "addrOfGlobal", &insertBefore) |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 94 | : NULL; |
| 95 | } |
| 96 | |
Misha Brukman | c3402cd | 2003-12-17 22:06:08 +0000 | [diff] [blame^] | 97 | // Wrapper on Constant::classof to use in find_if |
Misha Brukman | 523b30c | 2003-10-22 03:27:45 +0000 | [diff] [blame] | 98 | inline static bool nonConstant(const Use& U) { |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 99 | return ! isa<Constant>(U); |
| 100 | } |
| 101 | |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 102 | static Instruction* DecomposeConstantExpr(ConstantExpr* CE, |
| 103 | Instruction& insertBefore) |
| 104 | { |
| 105 | Value *getArg1, *getArg2; |
| 106 | |
| 107 | switch(CE->getOpcode()) |
| 108 | { |
| 109 | case Instruction::Cast: |
| 110 | getArg1 = CE->getOperand(0); |
| 111 | if (ConstantExpr* CEarg = dyn_cast<ConstantExpr>(getArg1)) |
| 112 | getArg1 = DecomposeConstantExpr(CEarg, insertBefore); |
| 113 | return new CastInst(getArg1, CE->getType(), "constantCast",&insertBefore); |
| 114 | |
| 115 | case Instruction::GetElementPtr: |
Chris Lattner | dc476b8 | 2002-10-27 19:09:51 +0000 | [diff] [blame] | 116 | assert(find_if(CE->op_begin()+1, CE->op_end(),nonConstant) == CE->op_end() |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 117 | && "All indices in ConstantExpr getelementptr must be constant!"); |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 118 | getArg1 = CE->getOperand(0); |
| 119 | if (ConstantExpr* CEarg = dyn_cast<ConstantExpr>(getArg1)) |
| 120 | getArg1 = DecomposeConstantExpr(CEarg, insertBefore); |
| 121 | else if (GetElementPtrInst* gep = getGlobalAddr(getArg1, insertBefore)) |
| 122 | getArg1 = gep; |
| 123 | return new GetElementPtrInst(getArg1, |
Chris Lattner | dc476b8 | 2002-10-27 19:09:51 +0000 | [diff] [blame] | 124 | std::vector<Value*>(CE->op_begin()+1, CE->op_end()), |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 125 | "constantGEP", &insertBefore); |
| 126 | |
| 127 | default: // must be a binary operator |
Chris Lattner | 0b16ae2 | 2002-10-13 19:39:16 +0000 | [diff] [blame] | 128 | assert(CE->getOpcode() >= Instruction::BinaryOpsBegin && |
| 129 | CE->getOpcode() < Instruction::BinaryOpsEnd && |
Vikram S. Adve | d0451a9 | 2002-10-13 00:01:57 +0000 | [diff] [blame] | 130 | "Unrecognized opcode in ConstantExpr"); |
| 131 | getArg1 = CE->getOperand(0); |
| 132 | if (ConstantExpr* CEarg = dyn_cast<ConstantExpr>(getArg1)) |
| 133 | getArg1 = DecomposeConstantExpr(CEarg, insertBefore); |
| 134 | getArg2 = CE->getOperand(1); |
| 135 | if (ConstantExpr* CEarg = dyn_cast<ConstantExpr>(getArg2)) |
| 136 | getArg2 = DecomposeConstantExpr(CEarg, insertBefore); |
| 137 | return BinaryOperator::create((Instruction::BinaryOps) CE->getOpcode(), |
| 138 | getArg1, getArg2, |
| 139 | "constantBinaryOp", &insertBefore); |
| 140 | } |
| 141 | } |
| 142 | |
| 143 | |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 144 | //------------------------------------------------------------------------------ |
| 145 | // Instruction visitor methods to perform instruction-specific operations |
| 146 | //------------------------------------------------------------------------------ |
Vikram S. Adve | cf81945 | 2003-06-05 21:12:56 +0000 | [diff] [blame] | 147 | inline void |
| 148 | PreSelection::visitOneOperand(Instruction &I, Value* Op, unsigned opNum, |
| 149 | Instruction& insertBefore) |
| 150 | { |
Vikram S. Adve | 799ffee | 2003-07-02 01:23:15 +0000 | [diff] [blame] | 151 | assert(&insertBefore != NULL && "Must have instruction to insert before."); |
| 152 | |
Vikram S. Adve | cf81945 | 2003-06-05 21:12:56 +0000 | [diff] [blame] | 153 | if (GetElementPtrInst* gep = getGlobalAddr(Op, insertBefore)) { |
| 154 | I.setOperand(opNum, gep); // replace global operand |
Vikram S. Adve | 799ffee | 2003-07-02 01:23:15 +0000 | [diff] [blame] | 155 | return; // nothing more to do for this op. |
Vikram S. Adve | cf81945 | 2003-06-05 21:12:56 +0000 | [diff] [blame] | 156 | } |
| 157 | |
| 158 | Constant* CV = dyn_cast<Constant>(Op); |
| 159 | if (CV == NULL) |
| 160 | return; |
| 161 | |
Misha Brukman | 523b30c | 2003-10-22 03:27:45 +0000 | [diff] [blame] | 162 | if (ConstantExpr* CE = dyn_cast<ConstantExpr>(CV)) { |
| 163 | // load-time constant: factor it out so we optimize as best we can |
| 164 | Instruction* computeConst = DecomposeConstantExpr(CE, insertBefore); |
| 165 | I.setOperand(opNum, computeConst); // replace expr operand with result |
| 166 | } else if (instrInfo.ConstantTypeMustBeLoaded(CV)) { |
| 167 | // load address of constant into a register, then load the constant |
Misha Brukman | feed25f | 2003-11-07 17:31:22 +0000 | [diff] [blame] | 168 | // this is now done during instruction selection |
| 169 | // the constant will live in the MachineConstantPool later on |
Misha Brukman | 523b30c | 2003-10-22 03:27:45 +0000 | [diff] [blame] | 170 | } else if (instrInfo.ConstantMayNotFitInImmedField(CV, &I)) { |
| 171 | // put the constant into a virtual register using a cast |
| 172 | CastInst* castI = new CastInst(CV, CV->getType(), "copyConst", |
| 173 | &insertBefore); |
| 174 | I.setOperand(opNum, castI); // replace operand with copy in v.reg. |
| 175 | } |
Vikram S. Adve | cf81945 | 2003-06-05 21:12:56 +0000 | [diff] [blame] | 176 | } |
| 177 | |
Misha Brukman | c3402cd | 2003-12-17 22:06:08 +0000 | [diff] [blame^] | 178 | /// visitOperands - transform individual operands of all instructions: |
| 179 | /// -- Load "large" int constants into a virtual register. What is large |
| 180 | /// depends on the type of instruction and on the target architecture. |
| 181 | /// -- For any constants that cannot be put in an immediate field, |
| 182 | /// load address into virtual register first, and then load the constant. |
| 183 | /// |
| 184 | /// firstOp and lastOp can be used to skip leading and trailing operands. |
| 185 | /// If lastOp is 0, it defaults to #operands or #incoming Phi values. |
| 186 | /// |
Chris Lattner | d48a1d7 | 2003-10-21 16:06:07 +0000 | [diff] [blame] | 187 | inline void PreSelection::visitOperands(Instruction &I, int firstOp) { |
Vikram S. Adve | cf81945 | 2003-06-05 21:12:56 +0000 | [diff] [blame] | 188 | // For any instruction other than PHI, copies go just before the instr. |
Chris Lattner | 4c62e79 | 2003-10-21 16:09:23 +0000 | [diff] [blame] | 189 | for (unsigned i = firstOp, e = I.getNumOperands(); i != e; ++i) |
| 190 | visitOneOperand(I, I.getOperand(i), i, I); |
| 191 | } |
| 192 | |
| 193 | |
| 194 | void PreSelection::visitPHINode(PHINode &PN) { |
Vikram S. Adve | cf81945 | 2003-06-05 21:12:56 +0000 | [diff] [blame] | 195 | // For a PHI, operand copies must be before the terminator of the |
| 196 | // appropriate predecessor basic block. Remaining logic is simple |
| 197 | // so just handle PHIs and other instructions separately. |
| 198 | // |
Chris Lattner | 4c62e79 | 2003-10-21 16:09:23 +0000 | [diff] [blame] | 199 | for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) |
Chris Lattner | 08d702b | 2003-10-21 17:22:23 +0000 | [diff] [blame] | 200 | visitOneOperand(PN, PN.getIncomingValue(i), |
Chris Lattner | 4c62e79 | 2003-10-21 16:09:23 +0000 | [diff] [blame] | 201 | PN.getOperandNumForIncomingValue(i), |
| 202 | *PN.getIncomingBlock(i)->getTerminator()); |
| 203 | // do not call visitOperands! |
Vikram S. Adve | cf81945 | 2003-06-05 21:12:56 +0000 | [diff] [blame] | 204 | } |
| 205 | |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 206 | // Common work for *all* instructions. This needs to be called explicitly |
| 207 | // by other visit<InstructionType> functions. |
Misha Brukman | 523b30c | 2003-10-22 03:27:45 +0000 | [diff] [blame] | 208 | inline void PreSelection::visitInstruction(Instruction &I) { |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 209 | visitOperands(I); // Perform operand transformations |
| 210 | } |
| 211 | |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 212 | // GetElementPtr instructions: check if pointer is a global |
Misha Brukman | 523b30c | 2003-10-22 03:27:45 +0000 | [diff] [blame] | 213 | void PreSelection::visitGetElementPtrInst(GetElementPtrInst &I) { |
Vikram S. Adve | 799ffee | 2003-07-02 01:23:15 +0000 | [diff] [blame] | 214 | Instruction* curI = &I; |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 215 | |
| 216 | // Decompose multidimensional array references |
Vikram S. Adve | 799ffee | 2003-07-02 01:23:15 +0000 | [diff] [blame] | 217 | if (I.getNumIndices() >= 2) { |
| 218 | // DecomposeArrayRef() replaces I and deletes it, if successful, |
| 219 | // so remember predecessor in order to find the replacement instruction. |
| 220 | // Also remember the basic block in case there is no predecessor. |
| 221 | Instruction* prevI = I.getPrev(); |
| 222 | BasicBlock* bb = I.getParent(); |
| 223 | if (DecomposeArrayRef(&I)) |
| 224 | // first instr. replacing I |
| 225 | curI = cast<GetElementPtrInst>(prevI? prevI->getNext() : &bb->front()); |
| 226 | } |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 227 | |
| 228 | // Perform other transformations common to all instructions |
Vikram S. Adve | 799ffee | 2003-07-02 01:23:15 +0000 | [diff] [blame] | 229 | visitInstruction(*curI); |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 230 | } |
| 231 | |
Misha Brukman | 523b30c | 2003-10-22 03:27:45 +0000 | [diff] [blame] | 232 | void PreSelection::visitCallInst(CallInst &I) { |
Vikram S. Adve | 9635867 | 2003-05-31 07:34:57 +0000 | [diff] [blame] | 233 | // Tell visitOperands to ignore the function name if this is a direct call. |
| 234 | visitOperands(I, (/*firstOp=*/ I.getCalledFunction()? 1 : 0)); |
| 235 | } |
| 236 | |
Misha Brukman | c3402cd | 2003-12-17 22:06:08 +0000 | [diff] [blame^] | 237 | /// createPreSelectionPass - Public entry point for the PreSelection pass |
| 238 | /// |
Misha Brukman | feed25f | 2003-11-07 17:31:22 +0000 | [diff] [blame] | 239 | FunctionPass* createPreSelectionPass(const TargetMachine &TM) { |
| 240 | return new PreSelection(TM); |
Vikram S. Adve | abf055c | 2002-09-20 00:29:28 +0000 | [diff] [blame] | 241 | } |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 242 | |
| 243 | } // End llvm namespace |