blob: 90a5fa782cf5522f2b62d2aff7ae424a084fd03f [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
Brian Gaekee3d68072004-02-25 18:44:15 +000018#include "SparcV9Internals.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 }
Brian Gaekec46f8a42004-03-11 19:23:15 +000051 const char *getPassName() const { return "SparcV9 Instr. Pre-selection"; }
Vikram S. Adveabf055c2002-09-20 00:29:28 +000052
53 // These methods do the actual work of specializing code
54 void visitInstruction(Instruction &I); // common work for every instr.
55 void visitGetElementPtrInst(GetElementPtrInst &I);
Vikram S. Adve96358672003-05-31 07:34:57 +000056 void visitCallInst(CallInst &I);
Chris Lattner4c62e792003-10-21 16:09:23 +000057 void visitPHINode(PHINode &PN);
Vikram S. Adveabf055c2002-09-20 00:29:28 +000058
59 // Helper functions for visiting operands of every instruction
Vikram S. Adve96358672003-05-31 07:34:57 +000060 //
61 // visitOperands() works on every operand in [firstOp, lastOp-1].
62 // If lastOp==0, lastOp defaults to #operands or #incoming Phi values.
63 //
64 // visitOneOperand() does all the work for one operand.
65 //
Chris Lattnerd48a1d72003-10-21 16:06:07 +000066 void visitOperands(Instruction &I, int firstOp=0);
Vikram S. Adve96358672003-05-31 07:34:57 +000067 void visitOneOperand(Instruction &I, Value* Op, unsigned opNum,
68 Instruction& insertBefore);
Vikram S. Adveabf055c2002-09-20 00:29:28 +000069 };
Chris Lattnerec8aae32003-04-24 18:35:51 +000070
Misha Brukmanfeed25f2003-11-07 17:31:22 +000071#if 0
Chris Lattnerec8aae32003-04-24 18:35:51 +000072 // Register the pass...
Misha Brukmanfeed25f2003-11-07 17:31:22 +000073 RegisterPass<PreSelection> X("preselect",
74 "Specialize LLVM code for a target machine"
75 createPreselectionPass);
76#endif
Brian Gaeked0fde302003-11-11 22:41:34 +000077
Vikram S. Adveabf055c2002-09-20 00:29:28 +000078} // end anonymous namespace
79
80
Vikram S. Adved0451a92002-10-13 00:01:57 +000081//------------------------------------------------------------------------------
82// Helper functions used by methods of class PreSelection
83//------------------------------------------------------------------------------
84
85
86// getGlobalAddr(): Put address of a global into a v. register.
Misha Brukman523b30c2003-10-22 03:27:45 +000087static GetElementPtrInst* getGlobalAddr(Value* ptr, Instruction& insertBefore) {
Vikram S. Adved0451a92002-10-13 00:01:57 +000088 if (isa<ConstantPointerRef>(ptr))
89 ptr = cast<ConstantPointerRef>(ptr)->getValue();
90
Chris Lattner2ab5e122003-06-04 01:24:40 +000091 return (isa<GlobalVariable>(ptr))
Vikram S. Adveabf055c2002-09-20 00:29:28 +000092 ? new GetElementPtrInst(ptr,
93 std::vector<Value*>(1, ConstantSInt::get(Type::LongTy, 0U)),
Vikram S. Adved0451a92002-10-13 00:01:57 +000094 "addrOfGlobal", &insertBefore)
Vikram S. Adveabf055c2002-09-20 00:29:28 +000095 : NULL;
96}
97
Misha Brukmanc3402cd2003-12-17 22:06:08 +000098// Wrapper on Constant::classof to use in find_if
Misha Brukman523b30c2003-10-22 03:27:45 +000099inline static bool nonConstant(const Use& U) {
Vikram S. Adved0451a92002-10-13 00:01:57 +0000100 return ! isa<Constant>(U);
101}
102
Vikram S. Adved0451a92002-10-13 00:01:57 +0000103static Instruction* DecomposeConstantExpr(ConstantExpr* CE,
104 Instruction& insertBefore)
105{
106 Value *getArg1, *getArg2;
107
108 switch(CE->getOpcode())
109 {
110 case Instruction::Cast:
111 getArg1 = CE->getOperand(0);
112 if (ConstantExpr* CEarg = dyn_cast<ConstantExpr>(getArg1))
113 getArg1 = DecomposeConstantExpr(CEarg, insertBefore);
114 return new CastInst(getArg1, CE->getType(), "constantCast",&insertBefore);
115
116 case Instruction::GetElementPtr:
Chris Lattnerdc476b82002-10-27 19:09:51 +0000117 assert(find_if(CE->op_begin()+1, CE->op_end(),nonConstant) == CE->op_end()
Vikram S. Adved0451a92002-10-13 00:01:57 +0000118 && "All indices in ConstantExpr getelementptr must be constant!");
Vikram S. Adved0451a92002-10-13 00:01:57 +0000119 getArg1 = CE->getOperand(0);
120 if (ConstantExpr* CEarg = dyn_cast<ConstantExpr>(getArg1))
121 getArg1 = DecomposeConstantExpr(CEarg, insertBefore);
122 else if (GetElementPtrInst* gep = getGlobalAddr(getArg1, insertBefore))
123 getArg1 = gep;
124 return new GetElementPtrInst(getArg1,
Chris Lattnerdc476b82002-10-27 19:09:51 +0000125 std::vector<Value*>(CE->op_begin()+1, CE->op_end()),
Vikram S. Adved0451a92002-10-13 00:01:57 +0000126 "constantGEP", &insertBefore);
127
128 default: // must be a binary operator
Chris Lattner0b16ae22002-10-13 19:39:16 +0000129 assert(CE->getOpcode() >= Instruction::BinaryOpsBegin &&
130 CE->getOpcode() < Instruction::BinaryOpsEnd &&
Vikram S. Adved0451a92002-10-13 00:01:57 +0000131 "Unrecognized opcode in ConstantExpr");
132 getArg1 = CE->getOperand(0);
133 if (ConstantExpr* CEarg = dyn_cast<ConstantExpr>(getArg1))
134 getArg1 = DecomposeConstantExpr(CEarg, insertBefore);
135 getArg2 = CE->getOperand(1);
136 if (ConstantExpr* CEarg = dyn_cast<ConstantExpr>(getArg2))
137 getArg2 = DecomposeConstantExpr(CEarg, insertBefore);
138 return BinaryOperator::create((Instruction::BinaryOps) CE->getOpcode(),
139 getArg1, getArg2,
140 "constantBinaryOp", &insertBefore);
141 }
142}
143
144
Vikram S. Adveabf055c2002-09-20 00:29:28 +0000145//------------------------------------------------------------------------------
146// Instruction visitor methods to perform instruction-specific operations
147//------------------------------------------------------------------------------
Vikram S. Advecf819452003-06-05 21:12:56 +0000148inline void
149PreSelection::visitOneOperand(Instruction &I, Value* Op, unsigned opNum,
150 Instruction& insertBefore)
151{
Vikram S. Adve799ffee2003-07-02 01:23:15 +0000152 assert(&insertBefore != NULL && "Must have instruction to insert before.");
153
Vikram S. Advecf819452003-06-05 21:12:56 +0000154 if (GetElementPtrInst* gep = getGlobalAddr(Op, insertBefore)) {
155 I.setOperand(opNum, gep); // replace global operand
Vikram S. Adve799ffee2003-07-02 01:23:15 +0000156 return; // nothing more to do for this op.
Vikram S. Advecf819452003-06-05 21:12:56 +0000157 }
158
159 Constant* CV = dyn_cast<Constant>(Op);
160 if (CV == NULL)
161 return;
162
Misha Brukman523b30c2003-10-22 03:27:45 +0000163 if (ConstantExpr* CE = dyn_cast<ConstantExpr>(CV)) {
164 // load-time constant: factor it out so we optimize as best we can
165 Instruction* computeConst = DecomposeConstantExpr(CE, insertBefore);
166 I.setOperand(opNum, computeConst); // replace expr operand with result
167 } else if (instrInfo.ConstantTypeMustBeLoaded(CV)) {
168 // load address of constant into a register, then load the constant
Misha Brukmanfeed25f2003-11-07 17:31:22 +0000169 // this is now done during instruction selection
170 // the constant will live in the MachineConstantPool later on
Misha Brukman523b30c2003-10-22 03:27:45 +0000171 } else if (instrInfo.ConstantMayNotFitInImmedField(CV, &I)) {
172 // put the constant into a virtual register using a cast
173 CastInst* castI = new CastInst(CV, CV->getType(), "copyConst",
174 &insertBefore);
175 I.setOperand(opNum, castI); // replace operand with copy in v.reg.
176 }
Vikram S. Advecf819452003-06-05 21:12:56 +0000177}
178
Misha Brukmanc3402cd2003-12-17 22:06:08 +0000179/// visitOperands - transform individual operands of all instructions:
180/// -- Load "large" int constants into a virtual register. What is large
181/// depends on the type of instruction and on the target architecture.
182/// -- For any constants that cannot be put in an immediate field,
183/// load address into virtual register first, and then load the constant.
184///
185/// firstOp and lastOp can be used to skip leading and trailing operands.
186/// If lastOp is 0, it defaults to #operands or #incoming Phi values.
187///
Chris Lattnerd48a1d72003-10-21 16:06:07 +0000188inline void PreSelection::visitOperands(Instruction &I, int firstOp) {
Vikram S. Advecf819452003-06-05 21:12:56 +0000189 // For any instruction other than PHI, copies go just before the instr.
Chris Lattner4c62e792003-10-21 16:09:23 +0000190 for (unsigned i = firstOp, e = I.getNumOperands(); i != e; ++i)
191 visitOneOperand(I, I.getOperand(i), i, I);
192}
193
194
195void PreSelection::visitPHINode(PHINode &PN) {
Vikram S. Advecf819452003-06-05 21:12:56 +0000196 // For a PHI, operand copies must be before the terminator of the
197 // appropriate predecessor basic block. Remaining logic is simple
198 // so just handle PHIs and other instructions separately.
199 //
Chris Lattner4c62e792003-10-21 16:09:23 +0000200 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
Chris Lattner08d702b2003-10-21 17:22:23 +0000201 visitOneOperand(PN, PN.getIncomingValue(i),
Chris Lattner4c62e792003-10-21 16:09:23 +0000202 PN.getOperandNumForIncomingValue(i),
203 *PN.getIncomingBlock(i)->getTerminator());
204 // do not call visitOperands!
Vikram S. Advecf819452003-06-05 21:12:56 +0000205}
206
Vikram S. Adveabf055c2002-09-20 00:29:28 +0000207// Common work for *all* instructions. This needs to be called explicitly
208// by other visit<InstructionType> functions.
Misha Brukman523b30c2003-10-22 03:27:45 +0000209inline void PreSelection::visitInstruction(Instruction &I) {
Vikram S. Adveabf055c2002-09-20 00:29:28 +0000210 visitOperands(I); // Perform operand transformations
211}
212
Vikram S. Adveabf055c2002-09-20 00:29:28 +0000213// GetElementPtr instructions: check if pointer is a global
Misha Brukman523b30c2003-10-22 03:27:45 +0000214void PreSelection::visitGetElementPtrInst(GetElementPtrInst &I) {
Vikram S. Adve799ffee2003-07-02 01:23:15 +0000215 Instruction* curI = &I;
Vikram S. Adveabf055c2002-09-20 00:29:28 +0000216
217 // Decompose multidimensional array references
Vikram S. Adve799ffee2003-07-02 01:23:15 +0000218 if (I.getNumIndices() >= 2) {
219 // DecomposeArrayRef() replaces I and deletes it, if successful,
220 // so remember predecessor in order to find the replacement instruction.
221 // Also remember the basic block in case there is no predecessor.
222 Instruction* prevI = I.getPrev();
223 BasicBlock* bb = I.getParent();
224 if (DecomposeArrayRef(&I))
225 // first instr. replacing I
226 curI = cast<GetElementPtrInst>(prevI? prevI->getNext() : &bb->front());
227 }
Vikram S. Adveabf055c2002-09-20 00:29:28 +0000228
229 // Perform other transformations common to all instructions
Vikram S. Adve799ffee2003-07-02 01:23:15 +0000230 visitInstruction(*curI);
Vikram S. Adveabf055c2002-09-20 00:29:28 +0000231}
232
Misha Brukman523b30c2003-10-22 03:27:45 +0000233void PreSelection::visitCallInst(CallInst &I) {
Vikram S. Adve96358672003-05-31 07:34:57 +0000234 // Tell visitOperands to ignore the function name if this is a direct call.
235 visitOperands(I, (/*firstOp=*/ I.getCalledFunction()? 1 : 0));
236}
237
Misha Brukmanc3402cd2003-12-17 22:06:08 +0000238/// createPreSelectionPass - Public entry point for the PreSelection pass
239///
Misha Brukmanfeed25f2003-11-07 17:31:22 +0000240FunctionPass* createPreSelectionPass(const TargetMachine &TM) {
241 return new PreSelection(TM);
Vikram S. Adveabf055c2002-09-20 00:29:28 +0000242}
Brian Gaeked0fde302003-11-11 22:41:34 +0000243
244} // End llvm namespace