blob: 5bb9b2b361996ffcdb5bf7ad82ddd1b2c647d5cc [file] [log] [blame]
Vikram S. Adveabf055c2002-09-20 00:29:28 +00001//===- PreSelection.cpp - Specialize LLVM code for target machine ---------===//
John Criswellb576c942003-10-20 19:43:21 +00002//
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. Adveabf055c2002-09-20 00:29:28 +00009//
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 Lattner67699ff2003-09-01 20:33:07 +000018#include "SparcInternals.h"
Vikram S. Adveabf055c2002-09-20 00:29:28 +000019#include "llvm/Constants.h"
Misha Brukmanbb8c8632003-10-22 04:51:36 +000020#include "llvm/DerivedTypes.h"
Vikram S. Adveabf055c2002-09-20 00:29:28 +000021#include "llvm/iMemory.h"
22#include "llvm/iPHINode.h"
23#include "llvm/iOther.h"
Misha Brukman523b30c2003-10-22 03:27:45 +000024#include "llvm/Module.h"
Vikram S. Adveabf055c2002-09-20 00:29:28 +000025#include "llvm/Pass.h"
Misha Brukman523b30c2003-10-22 03:27:45 +000026#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. Adved0451a92002-10-13 00:01:57 +000030#include <algorithm>
Vikram S. Adveabf055c2002-09-20 00:29:28 +000031
Brian Gaeked0fde302003-11-11 22:41:34 +000032namespace llvm {
33
Vikram S. Adveabf055c2002-09-20 00:29:28 +000034namespace {
Vikram S. Adveabf055c2002-09-20 00:29:28 +000035
36 //===--------------------------------------------------------------------===//
37 // PreSelection Pass - Specialize LLVM code for the current target machine.
Vikram S. Adveabf055c2002-09-20 00:29:28 +000038 //
Misha Brukmanfeed25f2003-11-07 17:31:22 +000039 class PreSelection : public FunctionPass, public InstVisitor<PreSelection> {
Vikram S. Advecf819452003-06-05 21:12:56 +000040 const TargetInstrInfo &instrInfo;
Vikram S. Adveabf055c2002-09-20 00:29:28 +000041
42 public:
Chris Lattnerdac91312003-10-21 14:49:19 +000043 PreSelection(const TargetMachine &T)
Misha Brukmanfeed25f2003-11-07 17:31:22 +000044 : instrInfo(T.getInstrInfo()) {}
Vikram S. Adveabf055c2002-09-20 00:29:28 +000045
Misha Brukmanfeed25f2003-11-07 17:31:22 +000046 // runOnFunction - apply this pass to each Function
47 bool runOnFunction(Function &F) {
48 visit(F);
Chris Lattnerdac91312003-10-21 14:49:19 +000049 return true;
Vikram S. Adveabf055c2002-09-20 00:29:28 +000050 }
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. Adve96358672003-05-31 07:34:57 +000055 void visitCallInst(CallInst &I);
Chris Lattner4c62e792003-10-21 16:09:23 +000056 void visitPHINode(PHINode &PN);
Vikram S. Adveabf055c2002-09-20 00:29:28 +000057
58 // Helper functions for visiting operands of every instruction
Vikram S. Adve96358672003-05-31 07:34:57 +000059 //
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 Lattnerd48a1d72003-10-21 16:06:07 +000065 void visitOperands(Instruction &I, int firstOp=0);
Vikram S. Adve96358672003-05-31 07:34:57 +000066 void visitOneOperand(Instruction &I, Value* Op, unsigned opNum,
67 Instruction& insertBefore);
Vikram S. Adveabf055c2002-09-20 00:29:28 +000068 };
Chris Lattnerec8aae32003-04-24 18:35:51 +000069
Misha Brukmanfeed25f2003-11-07 17:31:22 +000070#if 0
Chris Lattnerec8aae32003-04-24 18:35:51 +000071 // Register the pass...
Misha Brukmanfeed25f2003-11-07 17:31:22 +000072 RegisterPass<PreSelection> X("preselect",
73 "Specialize LLVM code for a target machine"
74 createPreselectionPass);
75#endif
Brian Gaeked0fde302003-11-11 22:41:34 +000076
Vikram S. Adveabf055c2002-09-20 00:29:28 +000077} // end anonymous namespace
78
79
Vikram S. Adved0451a92002-10-13 00:01:57 +000080//------------------------------------------------------------------------------
81// Helper functions used by methods of class PreSelection
82//------------------------------------------------------------------------------
83
84
85// getGlobalAddr(): Put address of a global into a v. register.
Misha Brukman523b30c2003-10-22 03:27:45 +000086static GetElementPtrInst* getGlobalAddr(Value* ptr, Instruction& insertBefore) {
Vikram S. Adved0451a92002-10-13 00:01:57 +000087 if (isa<ConstantPointerRef>(ptr))
88 ptr = cast<ConstantPointerRef>(ptr)->getValue();
89
Chris Lattner2ab5e122003-06-04 01:24:40 +000090 return (isa<GlobalVariable>(ptr))
Vikram S. Adveabf055c2002-09-20 00:29:28 +000091 ? new GetElementPtrInst(ptr,
92 std::vector<Value*>(1, ConstantSInt::get(Type::LongTy, 0U)),
Vikram S. Adved0451a92002-10-13 00:01:57 +000093 "addrOfGlobal", &insertBefore)
Vikram S. Adveabf055c2002-09-20 00:29:28 +000094 : NULL;
95}
96
Misha Brukmanc3402cd2003-12-17 22:06:08 +000097// Wrapper on Constant::classof to use in find_if
Misha Brukman523b30c2003-10-22 03:27:45 +000098inline static bool nonConstant(const Use& U) {
Vikram S. Adved0451a92002-10-13 00:01:57 +000099 return ! isa<Constant>(U);
100}
101
Vikram S. Adved0451a92002-10-13 00:01:57 +0000102static 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 Lattnerdc476b82002-10-27 19:09:51 +0000116 assert(find_if(CE->op_begin()+1, CE->op_end(),nonConstant) == CE->op_end()
Vikram S. Adved0451a92002-10-13 00:01:57 +0000117 && "All indices in ConstantExpr getelementptr must be constant!");
Vikram S. Adved0451a92002-10-13 00:01:57 +0000118 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 Lattnerdc476b82002-10-27 19:09:51 +0000124 std::vector<Value*>(CE->op_begin()+1, CE->op_end()),
Vikram S. Adved0451a92002-10-13 00:01:57 +0000125 "constantGEP", &insertBefore);
126
127 default: // must be a binary operator
Chris Lattner0b16ae22002-10-13 19:39:16 +0000128 assert(CE->getOpcode() >= Instruction::BinaryOpsBegin &&
129 CE->getOpcode() < Instruction::BinaryOpsEnd &&
Vikram S. Adved0451a92002-10-13 00:01:57 +0000130 "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. Adveabf055c2002-09-20 00:29:28 +0000144//------------------------------------------------------------------------------
145// Instruction visitor methods to perform instruction-specific operations
146//------------------------------------------------------------------------------
Vikram S. Advecf819452003-06-05 21:12:56 +0000147inline void
148PreSelection::visitOneOperand(Instruction &I, Value* Op, unsigned opNum,
149 Instruction& insertBefore)
150{
Vikram S. Adve799ffee2003-07-02 01:23:15 +0000151 assert(&insertBefore != NULL && "Must have instruction to insert before.");
152
Vikram S. Advecf819452003-06-05 21:12:56 +0000153 if (GetElementPtrInst* gep = getGlobalAddr(Op, insertBefore)) {
154 I.setOperand(opNum, gep); // replace global operand
Vikram S. Adve799ffee2003-07-02 01:23:15 +0000155 return; // nothing more to do for this op.
Vikram S. Advecf819452003-06-05 21:12:56 +0000156 }
157
158 Constant* CV = dyn_cast<Constant>(Op);
159 if (CV == NULL)
160 return;
161
Misha Brukman523b30c2003-10-22 03:27:45 +0000162 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 Brukmanfeed25f2003-11-07 17:31:22 +0000168 // this is now done during instruction selection
169 // the constant will live in the MachineConstantPool later on
Misha Brukman523b30c2003-10-22 03:27:45 +0000170 } 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. Advecf819452003-06-05 21:12:56 +0000176}
177
Misha Brukmanc3402cd2003-12-17 22:06:08 +0000178/// 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 Lattnerd48a1d72003-10-21 16:06:07 +0000187inline void PreSelection::visitOperands(Instruction &I, int firstOp) {
Vikram S. Advecf819452003-06-05 21:12:56 +0000188 // For any instruction other than PHI, copies go just before the instr.
Chris Lattner4c62e792003-10-21 16:09:23 +0000189 for (unsigned i = firstOp, e = I.getNumOperands(); i != e; ++i)
190 visitOneOperand(I, I.getOperand(i), i, I);
191}
192
193
194void PreSelection::visitPHINode(PHINode &PN) {
Vikram S. Advecf819452003-06-05 21:12:56 +0000195 // 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 Lattner4c62e792003-10-21 16:09:23 +0000199 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
Chris Lattner08d702b2003-10-21 17:22:23 +0000200 visitOneOperand(PN, PN.getIncomingValue(i),
Chris Lattner4c62e792003-10-21 16:09:23 +0000201 PN.getOperandNumForIncomingValue(i),
202 *PN.getIncomingBlock(i)->getTerminator());
203 // do not call visitOperands!
Vikram S. Advecf819452003-06-05 21:12:56 +0000204}
205
Vikram S. Adveabf055c2002-09-20 00:29:28 +0000206// Common work for *all* instructions. This needs to be called explicitly
207// by other visit<InstructionType> functions.
Misha Brukman523b30c2003-10-22 03:27:45 +0000208inline void PreSelection::visitInstruction(Instruction &I) {
Vikram S. Adveabf055c2002-09-20 00:29:28 +0000209 visitOperands(I); // Perform operand transformations
210}
211
Vikram S. Adveabf055c2002-09-20 00:29:28 +0000212// GetElementPtr instructions: check if pointer is a global
Misha Brukman523b30c2003-10-22 03:27:45 +0000213void PreSelection::visitGetElementPtrInst(GetElementPtrInst &I) {
Vikram S. Adve799ffee2003-07-02 01:23:15 +0000214 Instruction* curI = &I;
Vikram S. Adveabf055c2002-09-20 00:29:28 +0000215
216 // Decompose multidimensional array references
Vikram S. Adve799ffee2003-07-02 01:23:15 +0000217 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. Adveabf055c2002-09-20 00:29:28 +0000227
228 // Perform other transformations common to all instructions
Vikram S. Adve799ffee2003-07-02 01:23:15 +0000229 visitInstruction(*curI);
Vikram S. Adveabf055c2002-09-20 00:29:28 +0000230}
231
Misha Brukman523b30c2003-10-22 03:27:45 +0000232void PreSelection::visitCallInst(CallInst &I) {
Vikram S. Adve96358672003-05-31 07:34:57 +0000233 // Tell visitOperands to ignore the function name if this is a direct call.
234 visitOperands(I, (/*firstOp=*/ I.getCalledFunction()? 1 : 0));
235}
236
Misha Brukmanc3402cd2003-12-17 22:06:08 +0000237/// createPreSelectionPass - Public entry point for the PreSelection pass
238///
Misha Brukmanfeed25f2003-11-07 17:31:22 +0000239FunctionPass* createPreSelectionPass(const TargetMachine &TM) {
240 return new PreSelection(TM);
Vikram S. Adveabf055c2002-09-20 00:29:28 +0000241}
Brian Gaeked0fde302003-11-11 22:41:34 +0000242
243} // End llvm namespace