blob: d7e131daea3cf15d6d849a8a3dea811f994a1fee [file] [log] [blame]
Misha Brukmanf2ccb772004-08-17 04:55:41 +00001//===-- PPC32ISelSimple.cpp - A simple instruction selector PowerPC32 -----===//
Misha Brukman5dfe3a92004-06-21 16:55:25 +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//===----------------------------------------------------------------------===//
9
Misha Brukman98649d12004-06-24 21:54:47 +000010#define DEBUG_TYPE "isel"
Misha Brukman5dfe3a92004-06-21 16:55:25 +000011#include "PowerPC.h"
12#include "PowerPCInstrBuilder.h"
13#include "PowerPCInstrInfo.h"
Misha Brukman3d9a6c22004-08-11 00:09:42 +000014#include "PPC32TargetMachine.h"
Misha Brukman5dfe3a92004-06-21 16:55:25 +000015#include "llvm/Constants.h"
16#include "llvm/DerivedTypes.h"
17#include "llvm/Function.h"
18#include "llvm/Instructions.h"
Misha Brukman5dfe3a92004-06-21 16:55:25 +000019#include "llvm/Pass.h"
Misha Brukman8c9f5202004-06-21 18:30:31 +000020#include "llvm/CodeGen/IntrinsicLowering.h"
Misha Brukman5dfe3a92004-06-21 16:55:25 +000021#include "llvm/CodeGen/MachineConstantPool.h"
22#include "llvm/CodeGen/MachineFrameInfo.h"
23#include "llvm/CodeGen/MachineFunction.h"
24#include "llvm/CodeGen/SSARegMap.h"
25#include "llvm/Target/MRegisterInfo.h"
26#include "llvm/Target/TargetMachine.h"
27#include "llvm/Support/GetElementPtrTypeIterator.h"
28#include "llvm/Support/InstVisitor.h"
Reid Spencer551ccae2004-09-01 22:55:40 +000029#include "llvm/Support/Debug.h"
30#include "llvm/ADT/Statistic.h"
Misha Brukman98649d12004-06-24 21:54:47 +000031#include <vector>
Misha Brukman5dfe3a92004-06-21 16:55:25 +000032using namespace llvm;
33
34namespace {
Misha Brukman422791f2004-06-21 17:41:12 +000035 /// TypeClass - Used by the PowerPC backend to group LLVM types by their basic
36 /// PPC Representation.
Misha Brukman5dfe3a92004-06-21 16:55:25 +000037 ///
38 enum TypeClass {
Misha Brukman7e898c32004-07-20 00:41:46 +000039 cByte, cShort, cInt, cFP32, cFP64, cLong
Misha Brukman5dfe3a92004-06-21 16:55:25 +000040 };
41}
42
43/// getClass - Turn a primitive type into a "class" number which is based on the
44/// size of the type, and whether or not it is floating point.
45///
46static inline TypeClass getClass(const Type *Ty) {
Misha Brukman358829f2004-06-21 17:25:55 +000047 switch (Ty->getTypeID()) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +000048 case Type::SByteTyID:
49 case Type::UByteTyID: return cByte; // Byte operands are class #0
50 case Type::ShortTyID:
51 case Type::UShortTyID: return cShort; // Short operands are class #1
52 case Type::IntTyID:
53 case Type::UIntTyID:
Misha Brukman2834a4d2004-07-07 20:07:22 +000054 case Type::PointerTyID: return cInt; // Ints and pointers are class #2
Misha Brukman5dfe3a92004-06-21 16:55:25 +000055
Misha Brukman7e898c32004-07-20 00:41:46 +000056 case Type::FloatTyID: return cFP32; // Single float is #3
57 case Type::DoubleTyID: return cFP64; // Double Point is #4
Misha Brukman5dfe3a92004-06-21 16:55:25 +000058
59 case Type::LongTyID:
Misha Brukman7e898c32004-07-20 00:41:46 +000060 case Type::ULongTyID: return cLong; // Longs are class #5
Misha Brukman5dfe3a92004-06-21 16:55:25 +000061 default:
62 assert(0 && "Invalid type to getClass!");
63 return cByte; // not reached
64 }
65}
66
67// getClassB - Just like getClass, but treat boolean values as ints.
68static inline TypeClass getClassB(const Type *Ty) {
Nate Begemanb73a7112004-08-13 09:32:01 +000069 if (Ty == Type::BoolTy) return cByte;
Misha Brukman5dfe3a92004-06-21 16:55:25 +000070 return getClass(Ty);
71}
72
73namespace {
Misha Brukmana1dca552004-09-21 18:22:19 +000074 struct PPC32ISel : public FunctionPass, InstVisitor<PPC32ISel> {
Misha Brukman3d9a6c22004-08-11 00:09:42 +000075 PPC32TargetMachine &TM;
Misha Brukman5dfe3a92004-06-21 16:55:25 +000076 MachineFunction *F; // The function we are compiling into
77 MachineBasicBlock *BB; // The current MBB we are compiling
78 int VarArgsFrameIndex; // FrameIndex for start of varargs area
Misha Brukmanb097f212004-07-26 18:13:24 +000079
Nate Begeman645495d2004-09-23 05:31:33 +000080 /// CollapsedGepOp - This struct is for recording the intermediate results
81 /// used to calculate the base, index, and offset of a GEP instruction.
82 struct CollapsedGepOp {
83 ConstantSInt *offset; // the current offset into the struct/array
84 Value *index; // the index of the array element
85 ConstantUInt *size; // the size of each array element
86 CollapsedGepOp(ConstantSInt *o, Value *i, ConstantUInt *s) :
87 offset(o), index(i), size(s) {}
88 };
89
90 /// FoldedGEP - This struct is for recording the necessary information to
91 /// emit the GEP in a load or store instruction, used by emitGEPOperation.
92 struct FoldedGEP {
93 unsigned base;
94 unsigned index;
95 ConstantSInt *offset;
96 FoldedGEP() : base(0), index(0), offset(0) {}
97 FoldedGEP(unsigned b, unsigned i, ConstantSInt *o) :
98 base(b), index(i), offset(o) {}
99 };
Nate Begeman905a2912004-10-24 10:33:30 +0000100
101 /// RlwimiRec - This struct is for recording the arguments to a PowerPC
102 /// rlwimi instruction to be output for a particular Instruction::Or when
103 /// we recognize the pattern for rlwimi, starting with a shift or and.
104 struct RlwimiRec {
105 Value *Target, *Insert;
106 unsigned Shift, MB, ME;
107 RlwimiRec() : Target(0), Insert(0), Shift(0), MB(0), ME(0) {}
108 RlwimiRec(Value *tgt, Value *ins, unsigned s, unsigned b, unsigned e) :
109 Target(tgt), Insert(ins), Shift(s), MB(b), ME(e) {}
Nate Begeman1b750222004-10-17 05:19:20 +0000110 };
Nate Begeman905a2912004-10-24 10:33:30 +0000111
Misha Brukmanc7cd5e52005-03-21 19:22:14 +0000112 // External functions we may use in compiling the Module
Nate Begemanb64af912004-08-10 20:42:36 +0000113 Function *fmodfFn, *fmodFn, *__cmpdi2Fn, *__moddi3Fn, *__divdi3Fn,
114 *__umoddi3Fn, *__udivdi3Fn, *__fixsfdiFn, *__fixdfdiFn, *__fixunssfdiFn,
115 *__fixunsdfdiFn, *__floatdisfFn, *__floatdidfFn, *mallocFn, *freeFn;
Misha Brukman2834a4d2004-07-07 20:07:22 +0000116
Nate Begeman645495d2004-09-23 05:31:33 +0000117 // Mapping between Values and SSA Regs
118 std::map<Value*, unsigned> RegMap;
119
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000120 // MBBMap - Mapping between LLVM BB -> Machine BB
121 std::map<const BasicBlock*, MachineBasicBlock*> MBBMap;
122
123 // AllocaMap - Mapping from fixed sized alloca instructions to the
124 // FrameIndex for the alloca.
125 std::map<AllocaInst*, unsigned> AllocaMap;
126
Nate Begeman645495d2004-09-23 05:31:33 +0000127 // GEPMap - Mapping between basic blocks and GEP definitions
128 std::map<GetElementPtrInst*, FoldedGEP> GEPMap;
Nate Begeman1b750222004-10-17 05:19:20 +0000129
130 // RlwimiMap - Mapping between BinaryOperand (Or) instructions and info
131 // needed to properly emit a rlwimi instruction in its place.
Nate Begeman905a2912004-10-24 10:33:30 +0000132 std::map<Instruction *, RlwimiRec> InsertMap;
133
134 // A rlwimi instruction is the combination of at least three instructions.
135 // Keep a vector of instructions to skip around so that we do not try to
136 // emit instructions that were folded into a rlwimi.
Nate Begeman1b750222004-10-17 05:19:20 +0000137 std::vector<Instruction *> SkipList;
Nate Begeman645495d2004-09-23 05:31:33 +0000138
Misha Brukmanb097f212004-07-26 18:13:24 +0000139 // A Reg to hold the base address used for global loads and stores, and a
140 // flag to set whether or not we need to emit it for this function.
141 unsigned GlobalBaseReg;
142 bool GlobalBaseInitialized;
143
Misha Brukmana1dca552004-09-21 18:22:19 +0000144 PPC32ISel(TargetMachine &tm):TM(reinterpret_cast<PPC32TargetMachine&>(tm)),
Misha Brukmane2eceb52004-07-23 16:08:20 +0000145 F(0), BB(0) {}
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000146
Misha Brukman2834a4d2004-07-07 20:07:22 +0000147 bool doInitialization(Module &M) {
Misha Brukmanb0932592004-07-07 15:36:18 +0000148 // Add external functions that we may call
Nate Begemanb64af912004-08-10 20:42:36 +0000149 Type *i = Type::IntTy;
Misha Brukman2834a4d2004-07-07 20:07:22 +0000150 Type *d = Type::DoubleTy;
Misha Brukmanf3f63822004-07-08 19:41:16 +0000151 Type *f = Type::FloatTy;
Misha Brukman2834a4d2004-07-07 20:07:22 +0000152 Type *l = Type::LongTy;
153 Type *ul = Type::ULongTy;
Misha Brukman313efcb2004-07-09 15:45:07 +0000154 Type *voidPtr = PointerType::get(Type::SByteTy);
Misha Brukman7e898c32004-07-20 00:41:46 +0000155 // float fmodf(float, float);
156 fmodfFn = M.getOrInsertFunction("fmodf", f, f, f, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000157 // double fmod(double, double);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000158 fmodFn = M.getOrInsertFunction("fmod", d, d, d, 0);
Nate Begemanb64af912004-08-10 20:42:36 +0000159 // int __cmpdi2(long, long);
160 __cmpdi2Fn = M.getOrInsertFunction("__cmpdi2", i, l, l, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000161 // long __moddi3(long, long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000162 __moddi3Fn = M.getOrInsertFunction("__moddi3", l, l, l, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000163 // long __divdi3(long, long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000164 __divdi3Fn = M.getOrInsertFunction("__divdi3", l, l, l, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000165 // unsigned long __umoddi3(unsigned long, unsigned long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000166 __umoddi3Fn = M.getOrInsertFunction("__umoddi3", ul, ul, ul, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000167 // unsigned long __udivdi3(unsigned long, unsigned long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000168 __udivdi3Fn = M.getOrInsertFunction("__udivdi3", ul, ul, ul, 0);
Misha Brukman7e898c32004-07-20 00:41:46 +0000169 // long __fixsfdi(float)
Nate Begemanb64af912004-08-10 20:42:36 +0000170 __fixsfdiFn = M.getOrInsertFunction("__fixsfdi", l, f, 0);
Misha Brukmanf3f63822004-07-08 19:41:16 +0000171 // long __fixdfdi(double)
172 __fixdfdiFn = M.getOrInsertFunction("__fixdfdi", l, d, 0);
Nate Begemanb64af912004-08-10 20:42:36 +0000173 // unsigned long __fixunssfdi(float)
174 __fixunssfdiFn = M.getOrInsertFunction("__fixunssfdi", ul, f, 0);
175 // unsigned long __fixunsdfdi(double)
176 __fixunsdfdiFn = M.getOrInsertFunction("__fixunsdfdi", ul, d, 0);
Misha Brukmanf3f63822004-07-08 19:41:16 +0000177 // float __floatdisf(long)
178 __floatdisfFn = M.getOrInsertFunction("__floatdisf", f, l, 0);
179 // double __floatdidf(long)
180 __floatdidfFn = M.getOrInsertFunction("__floatdidf", d, l, 0);
Misha Brukman313efcb2004-07-09 15:45:07 +0000181 // void* malloc(size_t)
182 mallocFn = M.getOrInsertFunction("malloc", voidPtr, Type::UIntTy, 0);
183 // void free(void*)
184 freeFn = M.getOrInsertFunction("free", Type::VoidTy, voidPtr, 0);
Misha Brukmanc7cd5e52005-03-21 19:22:14 +0000185 return true;
Misha Brukman2834a4d2004-07-07 20:07:22 +0000186 }
Misha Brukmand18a31d2004-07-06 22:51:53 +0000187
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000188 /// runOnFunction - Top level implementation of instruction selection for
189 /// the entire function.
190 ///
191 bool runOnFunction(Function &Fn) {
192 // First pass over the function, lower any unknown intrinsic functions
193 // with the IntrinsicLowering class.
194 LowerUnknownIntrinsicFunctionCalls(Fn);
195
196 F = &MachineFunction::construct(&Fn, TM);
197
198 // Create all of the machine basic blocks for the function...
199 for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I)
200 F->getBasicBlockList().push_back(MBBMap[I] = new MachineBasicBlock(I));
201
202 BB = &F->front();
203
Misha Brukmanb097f212004-07-26 18:13:24 +0000204 // Make sure we re-emit a set of the global base reg if necessary
205 GlobalBaseInitialized = false;
206
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000207 // Copy incoming arguments off of the stack...
208 LoadArgumentsToVirtualRegs(Fn);
209
210 // Instruction select everything except PHI nodes
211 visit(Fn);
212
213 // Select the PHI nodes
214 SelectPHINodes();
215
Nate Begeman645495d2004-09-23 05:31:33 +0000216 GEPMap.clear();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000217 RegMap.clear();
218 MBBMap.clear();
Nate Begeman905a2912004-10-24 10:33:30 +0000219 InsertMap.clear();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000220 AllocaMap.clear();
Nate Begeman1b750222004-10-17 05:19:20 +0000221 SkipList.clear();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000222 F = 0;
223 // We always build a machine code representation for the function
224 return true;
225 }
226
227 virtual const char *getPassName() const {
228 return "PowerPC Simple Instruction Selection";
229 }
230
231 /// visitBasicBlock - This method is called when we are visiting a new basic
232 /// block. This simply creates a new MachineBasicBlock to emit code into
233 /// and adds it to the current MachineFunction. Subsequent visit* for
234 /// instructions will be invoked for all instructions in the basic block.
235 ///
236 void visitBasicBlock(BasicBlock &LLVM_BB) {
237 BB = MBBMap[&LLVM_BB];
238 }
239
240 /// LowerUnknownIntrinsicFunctionCalls - This performs a prepass over the
241 /// function, lowering any calls to unknown intrinsic functions into the
242 /// equivalent LLVM code.
243 ///
244 void LowerUnknownIntrinsicFunctionCalls(Function &F);
245
246 /// LoadArgumentsToVirtualRegs - Load all of the arguments to this function
247 /// from the stack into virtual registers.
248 ///
249 void LoadArgumentsToVirtualRegs(Function &F);
250
251 /// SelectPHINodes - Insert machine code to generate phis. This is tricky
252 /// because we have to generate our sources into the source basic blocks,
253 /// not the current one.
254 ///
255 void SelectPHINodes();
256
257 // Visitation methods for various instructions. These methods simply emit
258 // fixed PowerPC code for each instruction.
259
Chris Lattner289a49a2004-10-16 18:13:47 +0000260 // Control flow operators.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000261 void visitReturnInst(ReturnInst &RI);
262 void visitBranchInst(BranchInst &BI);
Chris Lattner289a49a2004-10-16 18:13:47 +0000263 void visitUnreachableInst(UnreachableInst &UI) {}
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000264
265 struct ValueRecord {
266 Value *Val;
267 unsigned Reg;
268 const Type *Ty;
269 ValueRecord(unsigned R, const Type *T) : Val(0), Reg(R), Ty(T) {}
270 ValueRecord(Value *V) : Val(V), Reg(0), Ty(V->getType()) {}
271 };
Misha Brukmanb097f212004-07-26 18:13:24 +0000272
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000273 void doCall(const ValueRecord &Ret, MachineInstr *CallMI,
Misha Brukmand18a31d2004-07-06 22:51:53 +0000274 const std::vector<ValueRecord> &Args, bool isVarArg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000275 void visitCallInst(CallInst &I);
276 void visitIntrinsicCall(Intrinsic::ID ID, CallInst &I);
277
278 // Arithmetic operators
279 void visitSimpleBinary(BinaryOperator &B, unsigned OpcodeClass);
280 void visitAdd(BinaryOperator &B) { visitSimpleBinary(B, 0); }
281 void visitSub(BinaryOperator &B) { visitSimpleBinary(B, 1); }
282 void visitMul(BinaryOperator &B);
283
284 void visitDiv(BinaryOperator &B) { visitDivRem(B); }
285 void visitRem(BinaryOperator &B) { visitDivRem(B); }
286 void visitDivRem(BinaryOperator &B);
287
288 // Bitwise operators
289 void visitAnd(BinaryOperator &B) { visitSimpleBinary(B, 2); }
290 void visitOr (BinaryOperator &B) { visitSimpleBinary(B, 3); }
291 void visitXor(BinaryOperator &B) { visitSimpleBinary(B, 4); }
292
293 // Comparison operators...
294 void visitSetCondInst(SetCondInst &I);
295 unsigned EmitComparison(unsigned OpNum, Value *Op0, Value *Op1,
296 MachineBasicBlock *MBB,
297 MachineBasicBlock::iterator MBBI);
298 void visitSelectInst(SelectInst &SI);
299
300
301 // Memory Instructions
302 void visitLoadInst(LoadInst &I);
303 void visitStoreInst(StoreInst &I);
304 void visitGetElementPtrInst(GetElementPtrInst &I);
305 void visitAllocaInst(AllocaInst &I);
306 void visitMallocInst(MallocInst &I);
307 void visitFreeInst(FreeInst &I);
308
309 // Other operators
310 void visitShiftInst(ShiftInst &I);
311 void visitPHINode(PHINode &I) {} // PHI nodes handled by second pass
312 void visitCastInst(CastInst &I);
313 void visitVANextInst(VANextInst &I);
314 void visitVAArgInst(VAArgInst &I);
315
316 void visitInstruction(Instruction &I) {
317 std::cerr << "Cannot instruction select: " << I;
318 abort();
319 }
320
Nate Begemanb47321b2004-08-20 09:56:22 +0000321 unsigned ExtendOrClear(MachineBasicBlock *MBB,
322 MachineBasicBlock::iterator IP,
Nate Begemana2de1022004-09-22 04:40:25 +0000323 Value *Op0);
Nate Begemanb47321b2004-08-20 09:56:22 +0000324
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000325 /// promote32 - Make a value 32-bits wide, and put it somewhere.
326 ///
327 void promote32(unsigned targetReg, const ValueRecord &VR);
328
329 /// emitGEPOperation - Common code shared between visitGetElementPtrInst and
330 /// constant expression GEP support.
331 ///
332 void emitGEPOperation(MachineBasicBlock *BB, MachineBasicBlock::iterator IP,
Nate Begeman645495d2004-09-23 05:31:33 +0000333 GetElementPtrInst *GEPI, bool foldGEP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000334
335 /// emitCastOperation - Common code shared between visitCastInst and
336 /// constant expression cast support.
337 ///
338 void emitCastOperation(MachineBasicBlock *BB,MachineBasicBlock::iterator IP,
339 Value *Src, const Type *DestTy, unsigned TargetReg);
340
Nate Begemanb816f022004-10-07 22:30:03 +0000341
Nate Begeman1b750222004-10-17 05:19:20 +0000342 /// emitBitfieldInsert - return true if we were able to fold the sequence of
Nate Begeman905a2912004-10-24 10:33:30 +0000343 /// instructions into a bitfield insert (rlwimi).
Nate Begeman9b508c32004-10-26 03:48:25 +0000344 bool emitBitfieldInsert(User *OpUser, unsigned DestReg);
Nate Begeman905a2912004-10-24 10:33:30 +0000345
346 /// emitBitfieldExtract - return true if we were able to fold the sequence
347 /// of instructions into a bitfield extract (rlwinm).
348 bool emitBitfieldExtract(MachineBasicBlock *MBB,
349 MachineBasicBlock::iterator IP,
Nate Begeman9b508c32004-10-26 03:48:25 +0000350 User *OpUser, unsigned DestReg);
Nate Begeman1b750222004-10-17 05:19:20 +0000351
Nate Begemanb816f022004-10-07 22:30:03 +0000352 /// emitBinaryConstOperation - Used by several functions to emit simple
353 /// arithmetic and logical operations with constants on a register rather
354 /// than a Value.
355 ///
356 void emitBinaryConstOperation(MachineBasicBlock *MBB,
357 MachineBasicBlock::iterator IP,
358 unsigned Op0Reg, ConstantInt *Op1,
359 unsigned Opcode, unsigned DestReg);
360
361 /// emitSimpleBinaryOperation - Implement simple binary operators for
362 /// integral types. OperatorClass is one of: 0 for Add, 1 for Sub,
363 /// 2 for And, 3 for Or, 4 for Xor.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000364 ///
365 void emitSimpleBinaryOperation(MachineBasicBlock *BB,
366 MachineBasicBlock::iterator IP,
Nate Begeman905a2912004-10-24 10:33:30 +0000367 BinaryOperator *BO, Value *Op0, Value *Op1,
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000368 unsigned OperatorClass, unsigned TargetReg);
369
370 /// emitBinaryFPOperation - This method handles emission of floating point
371 /// Add (0), Sub (1), Mul (2), and Div (3) operations.
372 void emitBinaryFPOperation(MachineBasicBlock *BB,
373 MachineBasicBlock::iterator IP,
374 Value *Op0, Value *Op1,
375 unsigned OperatorClass, unsigned TargetReg);
376
377 void emitMultiply(MachineBasicBlock *BB, MachineBasicBlock::iterator IP,
378 Value *Op0, Value *Op1, unsigned TargetReg);
379
Misha Brukman1013ef52004-07-21 20:09:08 +0000380 void doMultiply(MachineBasicBlock *MBB,
381 MachineBasicBlock::iterator IP,
382 unsigned DestReg, Value *Op0, Value *Op1);
383
384 /// doMultiplyConst - This method will multiply the value in Op0Reg by the
385 /// value of the ContantInt *CI
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000386 void doMultiplyConst(MachineBasicBlock *MBB,
Misha Brukman1013ef52004-07-21 20:09:08 +0000387 MachineBasicBlock::iterator IP,
388 unsigned DestReg, Value *Op0, ConstantInt *CI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000389
390 void emitDivRemOperation(MachineBasicBlock *BB,
391 MachineBasicBlock::iterator IP,
392 Value *Op0, Value *Op1, bool isDiv,
393 unsigned TargetReg);
394
395 /// emitSetCCOperation - Common code shared between visitSetCondInst and
396 /// constant expression support.
397 ///
398 void emitSetCCOperation(MachineBasicBlock *BB,
399 MachineBasicBlock::iterator IP,
400 Value *Op0, Value *Op1, unsigned Opcode,
401 unsigned TargetReg);
402
403 /// emitShiftOperation - Common code shared between visitShiftInst and
404 /// constant expression support.
405 ///
406 void emitShiftOperation(MachineBasicBlock *MBB,
407 MachineBasicBlock::iterator IP,
408 Value *Op, Value *ShiftAmount, bool isLeftShift,
Nate Begeman9b508c32004-10-26 03:48:25 +0000409 const Type *ResultTy, ShiftInst *SI,
410 unsigned DestReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000411
412 /// emitSelectOperation - Common code shared between visitSelectInst and the
413 /// constant expression support.
Misha Brukmanb097f212004-07-26 18:13:24 +0000414 ///
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000415 void emitSelectOperation(MachineBasicBlock *MBB,
416 MachineBasicBlock::iterator IP,
417 Value *Cond, Value *TrueVal, Value *FalseVal,
418 unsigned DestReg);
419
Nate Begeman1f5308e2004-11-18 06:51:29 +0000420 /// getGlobalBaseReg - Output the instructions required to put the
421 /// base address to use for accessing globals into a register. Returns the
422 /// register containing the base address.
Misha Brukmanb097f212004-07-26 18:13:24 +0000423 ///
Nate Begeman5e966612005-03-24 06:28:42 +0000424 unsigned getGlobalBaseReg();
Misha Brukmanb097f212004-07-26 18:13:24 +0000425
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000426 /// copyConstantToRegister - Output the instructions required to put the
427 /// specified constant into the specified register.
428 ///
429 void copyConstantToRegister(MachineBasicBlock *MBB,
430 MachineBasicBlock::iterator MBBI,
431 Constant *C, unsigned Reg);
432
433 void emitUCOM(MachineBasicBlock *MBB, MachineBasicBlock::iterator MBBI,
434 unsigned LHS, unsigned RHS);
435
436 /// makeAnotherReg - This method returns the next register number we haven't
437 /// yet used.
438 ///
439 /// Long values are handled somewhat specially. They are always allocated
440 /// as pairs of 32 bit integer values. The register number returned is the
Misha Brukman1013ef52004-07-21 20:09:08 +0000441 /// high 32 bits of the long value, and the regNum+1 is the low 32 bits.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000442 ///
443 unsigned makeAnotherReg(const Type *Ty) {
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000444 assert(dynamic_cast<const PPC32RegisterInfo*>(TM.getRegisterInfo()) &&
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000445 "Current target doesn't have PPC reg info??");
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000446 const PPC32RegisterInfo *PPCRI =
447 static_cast<const PPC32RegisterInfo*>(TM.getRegisterInfo());
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000448 if (Ty == Type::LongTy || Ty == Type::ULongTy) {
Nate Begemanb64af912004-08-10 20:42:36 +0000449 const TargetRegisterClass *RC = PPCRI->getRegClassForType(Type::IntTy);
450 // Create the upper part
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000451 F->getSSARegMap()->createVirtualRegister(RC);
Nate Begemanb64af912004-08-10 20:42:36 +0000452 // Create the lower part.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000453 return F->getSSARegMap()->createVirtualRegister(RC)-1;
454 }
455
456 // Add the mapping of regnumber => reg class to MachineFunction
Nate Begemanb64af912004-08-10 20:42:36 +0000457 const TargetRegisterClass *RC = PPCRI->getRegClassForType(Ty);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000458 return F->getSSARegMap()->createVirtualRegister(RC);
459 }
460
461 /// getReg - This method turns an LLVM value into a register number.
462 ///
463 unsigned getReg(Value &V) { return getReg(&V); } // Allow references
464 unsigned getReg(Value *V) {
465 // Just append to the end of the current bb.
466 MachineBasicBlock::iterator It = BB->end();
467 return getReg(V, BB, It);
468 }
469 unsigned getReg(Value *V, MachineBasicBlock *MBB,
470 MachineBasicBlock::iterator IPt);
Misha Brukman1013ef52004-07-21 20:09:08 +0000471
472 /// canUseAsImmediateForOpcode - This method returns whether a ConstantInt
473 /// is okay to use as an immediate argument to a certain binary operation
Nate Begemanb816f022004-10-07 22:30:03 +0000474 bool canUseAsImmediateForOpcode(ConstantInt *CI, unsigned Opcode,
475 bool Shifted);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000476
477 /// getFixedSizedAllocaFI - Return the frame index for a fixed sized alloca
478 /// that is to be statically allocated with the initial stack frame
479 /// adjustment.
480 unsigned getFixedSizedAllocaFI(AllocaInst *AI);
481 };
482}
483
484/// dyn_castFixedAlloca - If the specified value is a fixed size alloca
485/// instruction in the entry block, return it. Otherwise, return a null
486/// pointer.
487static AllocaInst *dyn_castFixedAlloca(Value *V) {
488 if (AllocaInst *AI = dyn_cast<AllocaInst>(V)) {
489 BasicBlock *BB = AI->getParent();
490 if (isa<ConstantUInt>(AI->getArraySize()) && BB ==&BB->getParent()->front())
491 return AI;
492 }
493 return 0;
494}
495
496/// getReg - This method turns an LLVM value into a register number.
497///
Misha Brukmana1dca552004-09-21 18:22:19 +0000498unsigned PPC32ISel::getReg(Value *V, MachineBasicBlock *MBB,
499 MachineBasicBlock::iterator IPt) {
Misha Brukmanba1c1da2004-07-20 00:59:38 +0000500 if (Constant *C = dyn_cast<Constant>(V)) {
Chris Lattnera51e4f62004-07-18 18:45:01 +0000501 unsigned Reg = makeAnotherReg(V->getType());
502 copyConstantToRegister(MBB, IPt, C, Reg);
503 return Reg;
Nate Begeman676dee62004-11-08 02:25:40 +0000504 } else if (CastInst *CI = dyn_cast<CastInst>(V)) {
505 // Do not emit noop casts at all, unless it's a double -> float cast.
506 if (getClassB(CI->getType()) == getClassB(CI->getOperand(0)->getType()))
507 return getReg(CI->getOperand(0), MBB, IPt);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000508 } else if (AllocaInst *AI = dyn_castFixedAlloca(V)) {
509 unsigned Reg = makeAnotherReg(V->getType());
510 unsigned FI = getFixedSizedAllocaFI(AI);
Misha Brukman5b570812004-08-10 22:47:03 +0000511 addFrameReference(BuildMI(*MBB, IPt, PPC::ADDI, 2, Reg), FI, 0, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000512 return Reg;
513 }
514
515 unsigned &Reg = RegMap[V];
516 if (Reg == 0) {
517 Reg = makeAnotherReg(V->getType());
518 RegMap[V] = Reg;
519 }
520
521 return Reg;
522}
523
Misha Brukman1013ef52004-07-21 20:09:08 +0000524/// canUseAsImmediateForOpcode - This method returns whether a ConstantInt
525/// is okay to use as an immediate argument to a certain binary operator.
Nate Begemanb816f022004-10-07 22:30:03 +0000526/// The shifted argument determines if the immediate is suitable to be used with
527/// the PowerPC instructions such as addis which concatenate 16 bits of the
528/// immediate with 16 bits of zeroes.
Misha Brukman1013ef52004-07-21 20:09:08 +0000529///
Nate Begemanb816f022004-10-07 22:30:03 +0000530bool PPC32ISel::canUseAsImmediateForOpcode(ConstantInt *CI, unsigned Opcode,
531 bool Shifted) {
Misha Brukman1013ef52004-07-21 20:09:08 +0000532 ConstantSInt *Op1Cs;
533 ConstantUInt *Op1Cu;
Nate Begemanb816f022004-10-07 22:30:03 +0000534
535 // For shifted immediates, any value with the low halfword cleared may be used
536 if (Shifted) {
Nate Begemanbdf69842004-10-08 02:49:24 +0000537 if (((int32_t)CI->getRawValue() & 0x0000FFFF) == 0)
Nate Begemanb816f022004-10-07 22:30:03 +0000538 return true;
Nate Begemanbdf69842004-10-08 02:49:24 +0000539 else
540 return false;
Nate Begemanb816f022004-10-07 22:30:03 +0000541 }
Nate Begeman28dd2fc2004-11-04 19:43:18 +0000542
543 // Treat subfic like addi for the purposes of constant validation
544 if (Opcode == 5) Opcode = 0;
Misha Brukman1013ef52004-07-21 20:09:08 +0000545
Nate Begeman28dd2fc2004-11-04 19:43:18 +0000546 // addi, subfic, compare, and non-indexed load take SIMM
Nate Begemanb816f022004-10-07 22:30:03 +0000547 bool cond1 = (Opcode < 2)
Nate Begemana41fc772004-09-29 02:35:05 +0000548 && ((int32_t)CI->getRawValue() <= 32767)
549 && ((int32_t)CI->getRawValue() >= -32768);
Misha Brukman1013ef52004-07-21 20:09:08 +0000550
Misha Brukman1013ef52004-07-21 20:09:08 +0000551 // ANDIo, ORI, and XORI take unsigned values
Nate Begemanb816f022004-10-07 22:30:03 +0000552 bool cond2 = (Opcode >= 2)
Misha Brukman2ed17ca2004-07-22 15:58:04 +0000553 && (Op1Cs = dyn_cast<ConstantSInt>(CI))
554 && (Op1Cs->getValue() >= 0)
Nate Begemana41fc772004-09-29 02:35:05 +0000555 && (Op1Cs->getValue() <= 65535);
Misha Brukman1013ef52004-07-21 20:09:08 +0000556
557 // ANDIo, ORI, and XORI take UIMMs, so they can be larger
Nate Begemanb816f022004-10-07 22:30:03 +0000558 bool cond3 = (Opcode >= 2)
Misha Brukman17a90002004-07-21 20:22:06 +0000559 && (Op1Cu = dyn_cast<ConstantUInt>(CI))
560 && (Op1Cu->getValue() <= 65535);
Misha Brukman1013ef52004-07-21 20:09:08 +0000561
Nate Begemanb816f022004-10-07 22:30:03 +0000562 if (cond1 || cond2 || cond3)
Misha Brukman1013ef52004-07-21 20:09:08 +0000563 return true;
564
565 return false;
566}
567
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000568/// getFixedSizedAllocaFI - Return the frame index for a fixed sized alloca
569/// that is to be statically allocated with the initial stack frame
570/// adjustment.
Misha Brukmana1dca552004-09-21 18:22:19 +0000571unsigned PPC32ISel::getFixedSizedAllocaFI(AllocaInst *AI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000572 // Already computed this?
573 std::map<AllocaInst*, unsigned>::iterator I = AllocaMap.lower_bound(AI);
574 if (I != AllocaMap.end() && I->first == AI) return I->second;
575
576 const Type *Ty = AI->getAllocatedType();
577 ConstantUInt *CUI = cast<ConstantUInt>(AI->getArraySize());
578 unsigned TySize = TM.getTargetData().getTypeSize(Ty);
579 TySize *= CUI->getValue(); // Get total allocated size...
580 unsigned Alignment = TM.getTargetData().getTypeAlignment(Ty);
581
582 // Create a new stack object using the frame manager...
583 int FrameIdx = F->getFrameInfo()->CreateStackObject(TySize, Alignment);
584 AllocaMap.insert(I, std::make_pair(AI, FrameIdx));
585 return FrameIdx;
586}
587
588
Nate Begeman1f5308e2004-11-18 06:51:29 +0000589/// getGlobalBaseReg - Output the instructions required to put the
Misha Brukmanb097f212004-07-26 18:13:24 +0000590/// base address to use for accessing globals into a register.
591///
Nate Begeman5e966612005-03-24 06:28:42 +0000592unsigned PPC32ISel::getGlobalBaseReg() {
Misha Brukmanb097f212004-07-26 18:13:24 +0000593 if (!GlobalBaseInitialized) {
594 // Insert the set of GlobalBaseReg into the first MBB of the function
595 MachineBasicBlock &FirstMBB = F->front();
596 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
597 GlobalBaseReg = makeAnotherReg(Type::IntTy);
Nate Begemanb7a8f2c2004-09-02 08:13:00 +0000598 BuildMI(FirstMBB, MBBI, PPC::MovePCtoLR, 0, PPC::LR);
Nate Begemanda721e72004-09-27 05:08:17 +0000599 BuildMI(FirstMBB, MBBI, PPC::MFLR, 1, GlobalBaseReg).addReg(PPC::LR);
Misha Brukmanb097f212004-07-26 18:13:24 +0000600 GlobalBaseInitialized = true;
601 }
Nate Begeman1f5308e2004-11-18 06:51:29 +0000602 return GlobalBaseReg;
Misha Brukmanb097f212004-07-26 18:13:24 +0000603}
604
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000605/// copyConstantToRegister - Output the instructions required to put the
606/// specified constant into the specified register.
607///
Misha Brukmana1dca552004-09-21 18:22:19 +0000608void PPC32ISel::copyConstantToRegister(MachineBasicBlock *MBB,
609 MachineBasicBlock::iterator IP,
610 Constant *C, unsigned R) {
Chris Lattner289a49a2004-10-16 18:13:47 +0000611 if (isa<UndefValue>(C)) {
612 BuildMI(*MBB, IP, PPC::IMPLICIT_DEF, 0, R);
Chris Lattner411eba02005-03-08 22:53:09 +0000613 if (getClassB(C->getType()) == cLong)
Chris Lattner3c707642005-01-14 20:22:02 +0000614 BuildMI(*MBB, IP, PPC::IMPLICIT_DEF, 0, R+1);
Chris Lattner289a49a2004-10-16 18:13:47 +0000615 return;
616 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000617 if (C->getType()->isIntegral()) {
618 unsigned Class = getClassB(C->getType());
619
620 if (Class == cLong) {
Misha Brukmana0af38c2004-07-28 19:13:49 +0000621 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(C)) {
622 uint64_t uval = CUI->getValue();
623 unsigned hiUVal = uval >> 32;
624 unsigned loUVal = uval;
625 ConstantUInt *CUHi = ConstantUInt::get(Type::UIntTy, hiUVal);
626 ConstantUInt *CULo = ConstantUInt::get(Type::UIntTy, loUVal);
627 copyConstantToRegister(MBB, IP, CUHi, R);
628 copyConstantToRegister(MBB, IP, CULo, R+1);
629 return;
630 } else if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(C)) {
631 int64_t sval = CSI->getValue();
632 int hiSVal = sval >> 32;
633 int loSVal = sval;
634 ConstantSInt *CSHi = ConstantSInt::get(Type::IntTy, hiSVal);
635 ConstantSInt *CSLo = ConstantSInt::get(Type::IntTy, loSVal);
636 copyConstantToRegister(MBB, IP, CSHi, R);
637 copyConstantToRegister(MBB, IP, CSLo, R+1);
638 return;
Misha Brukman7e898c32004-07-20 00:41:46 +0000639 } else {
Misha Brukmana0af38c2004-07-28 19:13:49 +0000640 std::cerr << "Unhandled long constant type!\n";
641 abort();
642 }
643 }
644
645 assert(Class <= cInt && "Type not handled yet!");
646
647 // Handle bool
648 if (C->getType() == Type::BoolTy) {
Misha Brukman5b570812004-08-10 22:47:03 +0000649 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(C == ConstantBool::True);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000650 return;
651 }
652
653 // Handle int
654 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(C)) {
655 unsigned uval = CUI->getValue();
656 if (uval < 32768) {
Misha Brukman5b570812004-08-10 22:47:03 +0000657 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(uval);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000658 } else {
659 unsigned Temp = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +0000660 BuildMI(*MBB, IP, PPC::LIS, 1, Temp).addSImm(uval >> 16);
Nate Begemanb816f022004-10-07 22:30:03 +0000661 BuildMI(*MBB, IP, PPC::ORI, 2, R).addReg(Temp).addImm(uval & 0xFFFF);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000662 }
663 return;
664 } else if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(C)) {
665 int sval = CSI->getValue();
666 if (sval < 32768 && sval >= -32768) {
Misha Brukman5b570812004-08-10 22:47:03 +0000667 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(sval);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000668 } else {
669 unsigned Temp = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +0000670 BuildMI(*MBB, IP, PPC::LIS, 1, Temp).addSImm(sval >> 16);
Nate Begemanb816f022004-10-07 22:30:03 +0000671 BuildMI(*MBB, IP, PPC::ORI, 2, R).addReg(Temp).addImm(sval & 0xFFFF);
Misha Brukman7e898c32004-07-20 00:41:46 +0000672 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000673 return;
674 }
Misha Brukmana0af38c2004-07-28 19:13:49 +0000675 std::cerr << "Unhandled integer constant!\n";
676 abort();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000677 } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) {
Misha Brukmand18a31d2004-07-06 22:51:53 +0000678 // We need to spill the constant to memory...
679 MachineConstantPool *CP = F->getConstantPool();
680 unsigned CPI = CP->getConstantPoolIndex(CFP);
681 const Type *Ty = CFP->getType();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000682
Misha Brukmand18a31d2004-07-06 22:51:53 +0000683 assert(Ty == Type::FloatTy || Ty == Type::DoubleTy && "Unknown FP type!");
Misha Brukmanfc879c32004-07-08 18:02:38 +0000684
Misha Brukmanb097f212004-07-26 18:13:24 +0000685 // Load addr of constant to reg; constant is located at base + distance
Misha Brukmanfc879c32004-07-08 18:02:38 +0000686 unsigned Reg1 = makeAnotherReg(Type::IntTy);
Nate Begeman07a73752004-08-17 07:17:44 +0000687 unsigned Opcode = (Ty == Type::FloatTy) ? PPC::LFS : PPC::LFD;
Misha Brukmanb097f212004-07-26 18:13:24 +0000688 // Move value at base + distance into return reg
Nate Begeman1f5308e2004-11-18 06:51:29 +0000689 BuildMI(*MBB, IP, PPC::LOADHiAddr, 2, Reg1)
Nate Begeman5e966612005-03-24 06:28:42 +0000690 .addReg(getGlobalBaseReg()).addConstantPoolIndex(CPI);
Nate Begemaned428532004-09-04 05:00:00 +0000691 BuildMI(*MBB, IP, Opcode, 2, R).addConstantPoolIndex(CPI).addReg(Reg1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000692 } else if (isa<ConstantPointerNull>(C)) {
693 // Copy zero (null pointer) to the register.
Misha Brukman5b570812004-08-10 22:47:03 +0000694 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(0);
Chris Lattner67910e12004-07-18 07:29:35 +0000695 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) {
Misha Brukmanb097f212004-07-26 18:13:24 +0000696 // GV is located at base + distance
Misha Brukmanba1c1da2004-07-20 00:59:38 +0000697 unsigned TmpReg = makeAnotherReg(GV->getType());
Misha Brukmanb097f212004-07-26 18:13:24 +0000698
699 // Move value at base + distance into return reg
Nate Begeman1f5308e2004-11-18 06:51:29 +0000700 BuildMI(*MBB, IP, PPC::LOADHiAddr, 2, TmpReg)
Nate Begeman5e966612005-03-24 06:28:42 +0000701 .addReg(getGlobalBaseReg()).addGlobalAddress(GV);
Chris Lattner6540c6c2004-11-23 05:54:25 +0000702
Nate Begemand4c8bea2004-11-25 07:09:01 +0000703 if (GV->hasWeakLinkage() || GV->isExternal()) {
Chris Lattner6540c6c2004-11-23 05:54:25 +0000704 BuildMI(*MBB, IP, PPC::LWZ, 2, R).addGlobalAddress(GV).addReg(TmpReg);
705 } else {
706 BuildMI(*MBB, IP, PPC::LA, 2, R).addReg(TmpReg).addGlobalAddress(GV);
707 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000708 } else {
Chris Lattner76e2df22004-07-15 02:14:30 +0000709 std::cerr << "Offending constant: " << *C << "\n";
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000710 assert(0 && "Type not handled yet!");
711 }
712}
713
714/// LoadArgumentsToVirtualRegs - Load all of the arguments to this function from
715/// the stack into virtual registers.
Misha Brukmana1dca552004-09-21 18:22:19 +0000716void PPC32ISel::LoadArgumentsToVirtualRegs(Function &Fn) {
Chris Lattner3ea93462004-08-06 06:58:50 +0000717 unsigned ArgOffset = 24;
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000718 unsigned GPR_remaining = 8;
719 unsigned FPR_remaining = 13;
Misha Brukmand18a31d2004-07-06 22:51:53 +0000720 unsigned GPR_idx = 0, FPR_idx = 0;
721 static const unsigned GPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +0000722 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
723 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
Misha Brukmand18a31d2004-07-06 22:51:53 +0000724 };
725 static const unsigned FPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +0000726 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
727 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
Misha Brukmand18a31d2004-07-06 22:51:53 +0000728 };
Misha Brukman422791f2004-06-21 17:41:12 +0000729
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000730 MachineFrameInfo *MFI = F->getFrameInfo();
Misha Brukmand18a31d2004-07-06 22:51:53 +0000731
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000732 for (Function::arg_iterator I = Fn.arg_begin(), E = Fn.arg_end();
733 I != E; ++I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000734 bool ArgLive = !I->use_empty();
735 unsigned Reg = ArgLive ? getReg(*I) : 0;
736 int FI; // Frame object index
737
738 switch (getClassB(I->getType())) {
739 case cByte:
740 if (ArgLive) {
Misha Brukmanec6319a2004-07-20 15:51:37 +0000741 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000742 if (GPR_remaining > 0) {
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000743 F->addLiveIn(GPR[GPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000744 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000745 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000746 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000747 addFrameReference(BuildMI(BB, PPC::LBZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000748 }
749 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000750 break;
751 case cShort:
752 if (ArgLive) {
Misha Brukmanec6319a2004-07-20 15:51:37 +0000753 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000754 if (GPR_remaining > 0) {
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000755 F->addLiveIn(GPR[GPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000756 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000757 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000758 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000759 addFrameReference(BuildMI(BB, PPC::LHZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000760 }
761 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000762 break;
763 case cInt:
764 if (ArgLive) {
765 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000766 if (GPR_remaining > 0) {
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000767 F->addLiveIn(GPR[GPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000768 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000769 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000770 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000771 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000772 }
773 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000774 break;
775 case cLong:
776 if (ArgLive) {
777 FI = MFI->CreateFixedObject(8, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000778 if (GPR_remaining > 1) {
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000779 F->addLiveIn(GPR[GPR_idx]);
780 F->addLiveIn(GPR[GPR_idx+1]);
Misha Brukman5b570812004-08-10 22:47:03 +0000781 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukman313efcb2004-07-09 15:45:07 +0000782 .addReg(GPR[GPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000783 BuildMI(BB, PPC::OR, 2, Reg+1).addReg(GPR[GPR_idx+1])
Misha Brukman313efcb2004-07-09 15:45:07 +0000784 .addReg(GPR[GPR_idx+1]);
Misha Brukman422791f2004-06-21 17:41:12 +0000785 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000786 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg), FI);
787 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg+1), FI, 4);
Misha Brukman422791f2004-06-21 17:41:12 +0000788 }
789 }
Misha Brukman1013ef52004-07-21 20:09:08 +0000790 // longs require 4 additional bytes and use 2 GPRs
791 ArgOffset += 4;
Misha Brukman422791f2004-06-21 17:41:12 +0000792 if (GPR_remaining > 1) {
Misha Brukman1013ef52004-07-21 20:09:08 +0000793 GPR_remaining--;
Misha Brukman422791f2004-06-21 17:41:12 +0000794 GPR_idx++;
795 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000796 break;
Misha Brukman7e898c32004-07-20 00:41:46 +0000797 case cFP32:
798 if (ArgLive) {
799 FI = MFI->CreateFixedObject(4, ArgOffset);
800
Misha Brukman422791f2004-06-21 17:41:12 +0000801 if (FPR_remaining > 0) {
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000802 F->addLiveIn(FPR[FPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000803 BuildMI(BB, PPC::FMR, 1, Reg).addReg(FPR[FPR_idx]);
Misha Brukmand18a31d2004-07-06 22:51:53 +0000804 FPR_remaining--;
805 FPR_idx++;
Misha Brukman422791f2004-06-21 17:41:12 +0000806 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000807 addFrameReference(BuildMI(BB, PPC::LFS, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000808 }
809 }
Misha Brukman7e898c32004-07-20 00:41:46 +0000810 break;
811 case cFP64:
812 if (ArgLive) {
813 FI = MFI->CreateFixedObject(8, ArgOffset);
814
815 if (FPR_remaining > 0) {
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000816 F->addLiveIn(FPR[FPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000817 BuildMI(BB, PPC::FMR, 1, Reg).addReg(FPR[FPR_idx]);
Misha Brukman7e898c32004-07-20 00:41:46 +0000818 FPR_remaining--;
819 FPR_idx++;
820 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000821 addFrameReference(BuildMI(BB, PPC::LFD, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000822 }
823 }
Misha Brukman7e898c32004-07-20 00:41:46 +0000824
825 // doubles require 4 additional bytes and use 2 GPRs of param space
826 ArgOffset += 4;
827 if (GPR_remaining > 0) {
828 GPR_remaining--;
829 GPR_idx++;
830 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000831 break;
832 default:
833 assert(0 && "Unhandled argument type!");
834 }
835 ArgOffset += 4; // Each argument takes at least 4 bytes on the stack...
Misha Brukman422791f2004-06-21 17:41:12 +0000836 if (GPR_remaining > 0) {
Misha Brukmand18a31d2004-07-06 22:51:53 +0000837 GPR_remaining--; // uses up 2 GPRs
838 GPR_idx++;
Misha Brukman422791f2004-06-21 17:41:12 +0000839 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000840 }
841
842 // If the function takes variable number of arguments, add a frame offset for
843 // the start of the first vararg value... this is used to expand
844 // llvm.va_start.
845 if (Fn.getFunctionType()->isVarArg())
Misha Brukmanb097f212004-07-26 18:13:24 +0000846 VarArgsFrameIndex = MFI->CreateFixedObject(4, ArgOffset);
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000847
848 if (Fn.getReturnType() != Type::VoidTy)
849 switch (getClassB(Fn.getReturnType())) {
850 case cByte:
851 case cShort:
852 case cInt:
853 F->addLiveOut(PPC::R3);
854 break;
855 case cLong:
856 F->addLiveOut(PPC::R3);
857 F->addLiveOut(PPC::R4);
858 break;
859 case cFP32:
860 case cFP64:
861 F->addLiveOut(PPC::F1);
862 break;
863 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000864}
865
866
867/// SelectPHINodes - Insert machine code to generate phis. This is tricky
868/// because we have to generate our sources into the source basic blocks, not
869/// the current one.
870///
Misha Brukmana1dca552004-09-21 18:22:19 +0000871void PPC32ISel::SelectPHINodes() {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000872 const TargetInstrInfo &TII = *TM.getInstrInfo();
873 const Function &LF = *F->getFunction(); // The LLVM function...
Chris Lattner9184bfb2005-04-09 22:05:17 +0000874
875 MachineBasicBlock::iterator MFLRIt = F->begin()->begin();
876 if (GlobalBaseInitialized) {
877 // If we emitted a MFLR for the global base reg, get an iterator to an
878 // instruction after it.
879 while (MFLRIt->getOpcode() != PPC::MFLR)
880 ++MFLRIt;
881 ++MFLRIt; // step one MI past it.
882 }
883
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000884 for (Function::const_iterator I = LF.begin(), E = LF.end(); I != E; ++I) {
885 const BasicBlock *BB = I;
886 MachineBasicBlock &MBB = *MBBMap[I];
887
888 // Loop over all of the PHI nodes in the LLVM basic block...
889 MachineBasicBlock::iterator PHIInsertPoint = MBB.begin();
890 for (BasicBlock::const_iterator I = BB->begin();
891 PHINode *PN = const_cast<PHINode*>(dyn_cast<PHINode>(I)); ++I) {
892
893 // Create a new machine instr PHI node, and insert it.
894 unsigned PHIReg = getReg(*PN);
895 MachineInstr *PhiMI = BuildMI(MBB, PHIInsertPoint,
Misha Brukman5b570812004-08-10 22:47:03 +0000896 PPC::PHI, PN->getNumOperands(), PHIReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000897
898 MachineInstr *LongPhiMI = 0;
899 if (PN->getType() == Type::LongTy || PN->getType() == Type::ULongTy)
900 LongPhiMI = BuildMI(MBB, PHIInsertPoint,
Misha Brukman5b570812004-08-10 22:47:03 +0000901 PPC::PHI, PN->getNumOperands(), PHIReg+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000902
903 // PHIValues - Map of blocks to incoming virtual registers. We use this
904 // so that we only initialize one incoming value for a particular block,
905 // even if the block has multiple entries in the PHI node.
906 //
907 std::map<MachineBasicBlock*, unsigned> PHIValues;
908
909 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
Misha Brukman313efcb2004-07-09 15:45:07 +0000910 MachineBasicBlock *PredMBB = 0;
911 for (MachineBasicBlock::pred_iterator PI = MBB.pred_begin (),
912 PE = MBB.pred_end (); PI != PE; ++PI)
913 if (PN->getIncomingBlock(i) == (*PI)->getBasicBlock()) {
914 PredMBB = *PI;
915 break;
916 }
917 assert (PredMBB && "Couldn't find incoming machine-cfg edge for phi");
918
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000919 unsigned ValReg;
920 std::map<MachineBasicBlock*, unsigned>::iterator EntryIt =
921 PHIValues.lower_bound(PredMBB);
922
923 if (EntryIt != PHIValues.end() && EntryIt->first == PredMBB) {
924 // We already inserted an initialization of the register for this
925 // predecessor. Recycle it.
926 ValReg = EntryIt->second;
Misha Brukman47225442004-07-23 22:35:49 +0000927 } else {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000928 // Get the incoming value into a virtual register.
929 //
930 Value *Val = PN->getIncomingValue(i);
931
932 // If this is a constant or GlobalValue, we may have to insert code
933 // into the basic block to compute it into a virtual register.
934 if ((isa<Constant>(Val) && !isa<ConstantExpr>(Val)) ||
935 isa<GlobalValue>(Val)) {
936 // Simple constants get emitted at the end of the basic block,
937 // before any terminator instructions. We "know" that the code to
938 // move a constant into a register will never clobber any flags.
939 ValReg = getReg(Val, PredMBB, PredMBB->getFirstTerminator());
940 } else {
941 // Because we don't want to clobber any values which might be in
942 // physical registers with the computation of this constant (which
943 // might be arbitrarily complex if it is a constant expression),
944 // just insert the computation at the top of the basic block.
945 MachineBasicBlock::iterator PI = PredMBB->begin();
Misha Brukman47225442004-07-23 22:35:49 +0000946
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000947 // Skip over any PHI nodes though!
Misha Brukman5b570812004-08-10 22:47:03 +0000948 while (PI != PredMBB->end() && PI->getOpcode() == PPC::PHI)
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000949 ++PI;
Misha Brukman47225442004-07-23 22:35:49 +0000950
Chris Lattner9184bfb2005-04-09 22:05:17 +0000951 // If this is the entry block, and if the entry block contains a
952 // MFLR instruction, emit this operation after it. This is needed
953 // because global addresses use it.
954 if (PredMBB == F->begin())
955 PI = MFLRIt;
956
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000957 ValReg = getReg(Val, PredMBB, PI);
958 }
959
960 // Remember that we inserted a value for this PHI for this predecessor
961 PHIValues.insert(EntryIt, std::make_pair(PredMBB, ValReg));
962 }
963
964 PhiMI->addRegOperand(ValReg);
965 PhiMI->addMachineBasicBlockOperand(PredMBB);
966 if (LongPhiMI) {
967 LongPhiMI->addRegOperand(ValReg+1);
968 LongPhiMI->addMachineBasicBlockOperand(PredMBB);
969 }
970 }
971
972 // Now that we emitted all of the incoming values for the PHI node, make
973 // sure to reposition the InsertPoint after the PHI that we just added.
974 // This is needed because we might have inserted a constant into this
975 // block, right after the PHI's which is before the old insert point!
976 PHIInsertPoint = LongPhiMI ? LongPhiMI : PhiMI;
977 ++PHIInsertPoint;
978 }
979 }
980}
981
982
983// canFoldSetCCIntoBranchOrSelect - Return the setcc instruction if we can fold
984// it into the conditional branch or select instruction which is the only user
985// of the cc instruction. This is the case if the conditional branch is the
986// only user of the setcc, and if the setcc is in the same basic block as the
Misha Brukman1013ef52004-07-21 20:09:08 +0000987// conditional branch.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000988//
989static SetCondInst *canFoldSetCCIntoBranchOrSelect(Value *V) {
990 if (SetCondInst *SCI = dyn_cast<SetCondInst>(V))
991 if (SCI->hasOneUse()) {
992 Instruction *User = cast<Instruction>(SCI->use_back());
Chris Lattnerfbd4de12005-01-14 19:31:00 +0000993 if ((isa<BranchInst>(User) ||
994 (isa<SelectInst>(User) && User->getOperand(0) == V)) &&
Misha Brukmanbebde752004-07-16 21:06:24 +0000995 SCI->getParent() == User->getParent())
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000996 return SCI;
997 }
998 return 0;
999}
1000
Misha Brukmanb097f212004-07-26 18:13:24 +00001001// canFoldGEPIntoLoadOrStore - Return the GEP instruction if we can fold it into
1002// the load or store instruction that is the only user of the GEP.
1003//
1004static GetElementPtrInst *canFoldGEPIntoLoadOrStore(Value *V) {
Nate Begeman645495d2004-09-23 05:31:33 +00001005 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(V)) {
1006 bool AllUsesAreMem = true;
1007 for (Value::use_iterator I = GEPI->use_begin(), E = GEPI->use_end();
1008 I != E; ++I) {
1009 Instruction *User = cast<Instruction>(*I);
1010
1011 // If the GEP is the target of a store, but not the source, then we are ok
1012 // to fold it.
Misha Brukmanb097f212004-07-26 18:13:24 +00001013 if (isa<StoreInst>(User) &&
1014 GEPI->getParent() == User->getParent() &&
1015 User->getOperand(0) != GEPI &&
Nate Begeman645495d2004-09-23 05:31:33 +00001016 User->getOperand(1) == GEPI)
1017 continue;
1018
1019 // If the GEP is the source of a load, then we're always ok to fold it
Misha Brukmanb097f212004-07-26 18:13:24 +00001020 if (isa<LoadInst>(User) &&
1021 GEPI->getParent() == User->getParent() &&
Nate Begeman645495d2004-09-23 05:31:33 +00001022 User->getOperand(0) == GEPI)
1023 continue;
1024
1025 // if we got to this point, than the instruction was not a load or store
1026 // that we are capable of folding the GEP into.
1027 AllUsesAreMem = false;
1028 break;
Misha Brukmanb097f212004-07-26 18:13:24 +00001029 }
Nate Begeman645495d2004-09-23 05:31:33 +00001030 if (AllUsesAreMem)
1031 return GEPI;
1032 }
Misha Brukmanb097f212004-07-26 18:13:24 +00001033 return 0;
1034}
1035
1036
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001037// Return a fixed numbering for setcc instructions which does not depend on the
1038// order of the opcodes.
1039//
1040static unsigned getSetCCNumber(unsigned Opcode) {
Misha Brukmane9c65512004-07-06 15:32:44 +00001041 switch (Opcode) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001042 default: assert(0 && "Unknown setcc instruction!");
1043 case Instruction::SetEQ: return 0;
1044 case Instruction::SetNE: return 1;
1045 case Instruction::SetLT: return 2;
1046 case Instruction::SetGE: return 3;
1047 case Instruction::SetGT: return 4;
1048 case Instruction::SetLE: return 5;
1049 }
1050}
1051
Misha Brukmane9c65512004-07-06 15:32:44 +00001052static unsigned getPPCOpcodeForSetCCNumber(unsigned Opcode) {
1053 switch (Opcode) {
1054 default: assert(0 && "Unknown setcc instruction!");
Misha Brukman5b570812004-08-10 22:47:03 +00001055 case Instruction::SetEQ: return PPC::BEQ;
1056 case Instruction::SetNE: return PPC::BNE;
1057 case Instruction::SetLT: return PPC::BLT;
1058 case Instruction::SetGE: return PPC::BGE;
1059 case Instruction::SetGT: return PPC::BGT;
1060 case Instruction::SetLE: return PPC::BLE;
Misha Brukmane9c65512004-07-06 15:32:44 +00001061 }
1062}
1063
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001064/// emitUCOM - emits an unordered FP compare.
Misha Brukmana1dca552004-09-21 18:22:19 +00001065void PPC32ISel::emitUCOM(MachineBasicBlock *MBB, MachineBasicBlock::iterator IP,
1066 unsigned LHS, unsigned RHS) {
Misha Brukman5b570812004-08-10 22:47:03 +00001067 BuildMI(*MBB, IP, PPC::FCMPU, 2, PPC::CR0).addReg(LHS).addReg(RHS);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001068}
1069
Misha Brukmana1dca552004-09-21 18:22:19 +00001070unsigned PPC32ISel::ExtendOrClear(MachineBasicBlock *MBB,
1071 MachineBasicBlock::iterator IP,
Nate Begemana2de1022004-09-22 04:40:25 +00001072 Value *Op0) {
Nate Begeman0e5e5f52004-08-22 08:10:15 +00001073 const Type *CompTy = Op0->getType();
1074 unsigned Reg = getReg(Op0, MBB, IP);
Nate Begemanb47321b2004-08-20 09:56:22 +00001075 unsigned Class = getClassB(CompTy);
1076
Nate Begeman1b99fd32004-09-29 03:45:33 +00001077 // Since we know that boolean values will be either zero or one, we don't
1078 // have to extend or clear them.
1079 if (CompTy == Type::BoolTy)
1080 return Reg;
1081
Nate Begemanb47321b2004-08-20 09:56:22 +00001082 // Before we do a comparison or SetCC, we have to make sure that we truncate
1083 // the source registers appropriately.
1084 if (Class == cByte) {
1085 unsigned TmpReg = makeAnotherReg(CompTy);
1086 if (CompTy->isSigned())
1087 BuildMI(*MBB, IP, PPC::EXTSB, 1, TmpReg).addReg(Reg);
1088 else
1089 BuildMI(*MBB, IP, PPC::RLWINM, 4, TmpReg).addReg(Reg).addImm(0)
1090 .addImm(24).addImm(31);
1091 Reg = TmpReg;
1092 } else if (Class == cShort) {
1093 unsigned TmpReg = makeAnotherReg(CompTy);
1094 if (CompTy->isSigned())
1095 BuildMI(*MBB, IP, PPC::EXTSH, 1, TmpReg).addReg(Reg);
1096 else
1097 BuildMI(*MBB, IP, PPC::RLWINM, 4, TmpReg).addReg(Reg).addImm(0)
1098 .addImm(16).addImm(31);
1099 Reg = TmpReg;
1100 }
1101 return Reg;
1102}
1103
Misha Brukmanbebde752004-07-16 21:06:24 +00001104/// EmitComparison - emits a comparison of the two operands, returning the
1105/// extended setcc code to use. The result is in CR0.
1106///
Misha Brukmana1dca552004-09-21 18:22:19 +00001107unsigned PPC32ISel::EmitComparison(unsigned OpNum, Value *Op0, Value *Op1,
1108 MachineBasicBlock *MBB,
1109 MachineBasicBlock::iterator IP) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001110 // The arguments are already supposed to be of the same type.
1111 const Type *CompTy = Op0->getType();
1112 unsigned Class = getClassB(CompTy);
Nate Begemana2de1022004-09-22 04:40:25 +00001113 unsigned Op0r = ExtendOrClear(MBB, IP, Op0);
Misha Brukmanb097f212004-07-26 18:13:24 +00001114
Misha Brukman1013ef52004-07-21 20:09:08 +00001115 // Use crand for lt, gt and crandc for le, ge
Misha Brukman5b570812004-08-10 22:47:03 +00001116 unsigned CROpcode = (OpNum == 2 || OpNum == 4) ? PPC::CRAND : PPC::CRANDC;
Misha Brukman1013ef52004-07-21 20:09:08 +00001117 // ? cr1[lt] : cr1[gt]
1118 unsigned CR1field = (OpNum == 2 || OpNum == 3) ? 4 : 5;
1119 // ? cr0[lt] : cr0[gt]
1120 unsigned CR0field = (OpNum == 2 || OpNum == 5) ? 0 : 1;
Misha Brukman5b570812004-08-10 22:47:03 +00001121 unsigned Opcode = CompTy->isSigned() ? PPC::CMPW : PPC::CMPLW;
1122 unsigned OpcodeImm = CompTy->isSigned() ? PPC::CMPWI : PPC::CMPLWI;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001123
1124 // Special case handling of: cmp R, i
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001125 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001126 if (Class == cByte || Class == cShort || Class == cInt) {
Misha Brukman1013ef52004-07-21 20:09:08 +00001127 unsigned Op1v = CI->getRawValue() & 0xFFFF;
Nate Begeman43d64ea2004-08-15 06:42:28 +00001128 unsigned OpClass = (CompTy->isSigned()) ? 0 : 2;
1129
Misha Brukman1013ef52004-07-21 20:09:08 +00001130 // Treat compare like ADDI for the purposes of immediate suitability
Nate Begemanb816f022004-10-07 22:30:03 +00001131 if (canUseAsImmediateForOpcode(CI, OpClass, false)) {
Misha Brukman5b570812004-08-10 22:47:03 +00001132 BuildMI(*MBB, IP, OpcodeImm, 2, PPC::CR0).addReg(Op0r).addSImm(Op1v);
Misha Brukman422791f2004-06-21 17:41:12 +00001133 } else {
1134 unsigned Op1r = getReg(Op1, MBB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00001135 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
Misha Brukman422791f2004-06-21 17:41:12 +00001136 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001137 return OpNum;
1138 } else {
1139 assert(Class == cLong && "Unknown integer class!");
1140 unsigned LowCst = CI->getRawValue();
1141 unsigned HiCst = CI->getRawValue() >> 32;
1142 if (OpNum < 2) { // seteq, setne
Misha Brukman1013ef52004-07-21 20:09:08 +00001143 unsigned LoLow = makeAnotherReg(Type::IntTy);
1144 unsigned LoTmp = makeAnotherReg(Type::IntTy);
1145 unsigned HiLow = makeAnotherReg(Type::IntTy);
1146 unsigned HiTmp = makeAnotherReg(Type::IntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001147 unsigned FinalTmp = makeAnotherReg(Type::IntTy);
Misha Brukman47225442004-07-23 22:35:49 +00001148
Misha Brukman5b570812004-08-10 22:47:03 +00001149 BuildMI(*MBB, IP, PPC::XORI, 2, LoLow).addReg(Op0r+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001150 .addImm(LowCst & 0xFFFF);
Misha Brukman5b570812004-08-10 22:47:03 +00001151 BuildMI(*MBB, IP, PPC::XORIS, 2, LoTmp).addReg(LoLow)
Misha Brukman1013ef52004-07-21 20:09:08 +00001152 .addImm(LowCst >> 16);
Misha Brukman5b570812004-08-10 22:47:03 +00001153 BuildMI(*MBB, IP, PPC::XORI, 2, HiLow).addReg(Op0r)
Misha Brukman1013ef52004-07-21 20:09:08 +00001154 .addImm(HiCst & 0xFFFF);
Misha Brukman5b570812004-08-10 22:47:03 +00001155 BuildMI(*MBB, IP, PPC::XORIS, 2, HiTmp).addReg(HiLow)
Misha Brukman1013ef52004-07-21 20:09:08 +00001156 .addImm(HiCst >> 16);
Misha Brukman5b570812004-08-10 22:47:03 +00001157 BuildMI(*MBB, IP, PPC::ORo, 2, FinalTmp).addReg(LoTmp).addReg(HiTmp);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001158 return OpNum;
1159 } else {
Misha Brukmanbebde752004-07-16 21:06:24 +00001160 unsigned ConstReg = makeAnotherReg(CompTy);
Misha Brukmanbebde752004-07-16 21:06:24 +00001161 copyConstantToRegister(MBB, IP, CI, ConstReg);
Misha Brukman47225442004-07-23 22:35:49 +00001162
Misha Brukman1013ef52004-07-21 20:09:08 +00001163 // cr0 = r3 ccOpcode r5 or (r3 == r5 AND r4 ccOpcode r6)
Misha Brukman5b570812004-08-10 22:47:03 +00001164 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r)
Misha Brukmanbebde752004-07-16 21:06:24 +00001165 .addReg(ConstReg);
Misha Brukman5b570812004-08-10 22:47:03 +00001166 BuildMI(*MBB, IP, Opcode, 2, PPC::CR1).addReg(Op0r+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001167 .addReg(ConstReg+1);
Misha Brukman5b570812004-08-10 22:47:03 +00001168 BuildMI(*MBB, IP, PPC::CRAND, 3).addImm(2).addImm(2).addImm(CR1field);
1169 BuildMI(*MBB, IP, PPC::CROR, 3).addImm(CR0field).addImm(CR0field)
Misha Brukman1013ef52004-07-21 20:09:08 +00001170 .addImm(2);
Misha Brukman422791f2004-06-21 17:41:12 +00001171 return OpNum;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001172 }
1173 }
1174 }
1175
1176 unsigned Op1r = getReg(Op1, MBB, IP);
Misha Brukman1013ef52004-07-21 20:09:08 +00001177
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001178 switch (Class) {
1179 default: assert(0 && "Unknown type class!");
1180 case cByte:
1181 case cShort:
1182 case cInt:
Misha Brukman5b570812004-08-10 22:47:03 +00001183 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001184 break;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001185
Misha Brukman7e898c32004-07-20 00:41:46 +00001186 case cFP32:
1187 case cFP64:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001188 emitUCOM(MBB, IP, Op0r, Op1r);
1189 break;
1190
1191 case cLong:
1192 if (OpNum < 2) { // seteq, setne
1193 unsigned LoTmp = makeAnotherReg(Type::IntTy);
1194 unsigned HiTmp = makeAnotherReg(Type::IntTy);
1195 unsigned FinalTmp = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00001196 BuildMI(*MBB, IP, PPC::XOR, 2, HiTmp).addReg(Op0r).addReg(Op1r);
1197 BuildMI(*MBB, IP, PPC::XOR, 2, LoTmp).addReg(Op0r+1).addReg(Op1r+1);
1198 BuildMI(*MBB, IP, PPC::ORo, 2, FinalTmp).addReg(LoTmp).addReg(HiTmp);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001199 break; // Allow the sete or setne to be generated from flags set by OR
1200 } else {
Misha Brukmanbebde752004-07-16 21:06:24 +00001201 unsigned TmpReg1 = makeAnotherReg(Type::IntTy);
1202 unsigned TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman1013ef52004-07-21 20:09:08 +00001203
1204 // cr0 = r3 ccOpcode r5 or (r3 == r5 AND r4 ccOpcode r6)
Misha Brukman5b570812004-08-10 22:47:03 +00001205 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
1206 BuildMI(*MBB, IP, Opcode, 2, PPC::CR1).addReg(Op0r+1).addReg(Op1r+1);
1207 BuildMI(*MBB, IP, PPC::CRAND, 3).addImm(2).addImm(2).addImm(CR1field);
1208 BuildMI(*MBB, IP, PPC::CROR, 3).addImm(CR0field).addImm(CR0field)
Misha Brukman1013ef52004-07-21 20:09:08 +00001209 .addImm(2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001210 return OpNum;
1211 }
1212 }
1213 return OpNum;
1214}
1215
Misha Brukmand18a31d2004-07-06 22:51:53 +00001216/// visitSetCondInst - emit code to calculate the condition via
1217/// EmitComparison(), and possibly store a 0 or 1 to a register as a result
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001218///
Misha Brukmana1dca552004-09-21 18:22:19 +00001219void PPC32ISel::visitSetCondInst(SetCondInst &I) {
Misha Brukmand18a31d2004-07-06 22:51:53 +00001220 if (canFoldSetCCIntoBranchOrSelect(&I))
Misha Brukmane9c65512004-07-06 15:32:44 +00001221 return;
Misha Brukmanbebde752004-07-16 21:06:24 +00001222
Nate Begemana2de1022004-09-22 04:40:25 +00001223 MachineBasicBlock::iterator MI = BB->end();
1224 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
1225 const Type *Ty = Op0->getType();
1226 unsigned Class = getClassB(Ty);
Nate Begemana96c4af2004-08-21 20:42:14 +00001227 unsigned Opcode = I.getOpcode();
Nate Begemana2de1022004-09-22 04:40:25 +00001228 unsigned OpNum = getSetCCNumber(Opcode);
1229 unsigned DestReg = getReg(I);
1230
1231 // If the comparison type is byte, short, or int, then we can emit a
1232 // branchless version of the SetCC that puts 0 (false) or 1 (true) in the
1233 // destination register.
1234 if (Class <= cInt) {
1235 ConstantInt *CI = dyn_cast<ConstantInt>(Op1);
1236
1237 if (CI && CI->getRawValue() == 0) {
Nate Begemana2de1022004-09-22 04:40:25 +00001238 unsigned Op0Reg = ExtendOrClear(BB, MI, Op0);
1239
1240 // comparisons against constant zero and negative one often have shorter
1241 // and/or faster sequences than the set-and-branch general case, handled
1242 // below.
1243 switch(OpNum) {
1244 case 0: { // eq0
1245 unsigned TempReg = makeAnotherReg(Type::IntTy);
1246 BuildMI(*BB, MI, PPC::CNTLZW, 1, TempReg).addReg(Op0Reg);
1247 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(TempReg).addImm(27)
1248 .addImm(5).addImm(31);
1249 break;
1250 }
1251 case 1: { // ne0
1252 unsigned TempReg = makeAnotherReg(Type::IntTy);
1253 BuildMI(*BB, MI, PPC::ADDIC, 2, TempReg).addReg(Op0Reg).addSImm(-1);
1254 BuildMI(*BB, MI, PPC::SUBFE, 2, DestReg).addReg(TempReg).addReg(Op0Reg);
1255 break;
1256 }
1257 case 2: { // lt0, always false if unsigned
1258 if (Ty->isSigned())
1259 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Op0Reg).addImm(1)
1260 .addImm(31).addImm(31);
1261 else
1262 BuildMI(*BB, MI, PPC::LI, 1, DestReg).addSImm(0);
1263 break;
1264 }
1265 case 3: { // ge0, always true if unsigned
1266 if (Ty->isSigned()) {
1267 unsigned TempReg = makeAnotherReg(Type::IntTy);
1268 BuildMI(*BB, MI, PPC::RLWINM, 4, TempReg).addReg(Op0Reg).addImm(1)
1269 .addImm(31).addImm(31);
1270 BuildMI(*BB, MI, PPC::XORI, 2, DestReg).addReg(TempReg).addImm(1);
1271 } else {
1272 BuildMI(*BB, MI, PPC::LI, 1, DestReg).addSImm(1);
1273 }
1274 break;
1275 }
1276 case 4: { // gt0, equivalent to ne0 if unsigned
1277 unsigned Temp1 = makeAnotherReg(Type::IntTy);
1278 unsigned Temp2 = makeAnotherReg(Type::IntTy);
1279 if (Ty->isSigned()) {
1280 BuildMI(*BB, MI, PPC::NEG, 2, Temp1).addReg(Op0Reg);
1281 BuildMI(*BB, MI, PPC::ANDC, 2, Temp2).addReg(Temp1).addReg(Op0Reg);
1282 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp2).addImm(1)
1283 .addImm(31).addImm(31);
1284 } else {
1285 BuildMI(*BB, MI, PPC::ADDIC, 2, Temp1).addReg(Op0Reg).addSImm(-1);
1286 BuildMI(*BB, MI, PPC::SUBFE, 2, DestReg).addReg(Temp1).addReg(Op0Reg);
1287 }
1288 break;
1289 }
1290 case 5: { // le0, equivalent to eq0 if unsigned
1291 unsigned Temp1 = makeAnotherReg(Type::IntTy);
1292 unsigned Temp2 = makeAnotherReg(Type::IntTy);
1293 if (Ty->isSigned()) {
1294 BuildMI(*BB, MI, PPC::NEG, 2, Temp1).addReg(Op0Reg);
1295 BuildMI(*BB, MI, PPC::ORC, 2, Temp2).addReg(Op0Reg).addReg(Temp1);
1296 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp2).addImm(1)
1297 .addImm(31).addImm(31);
1298 } else {
1299 BuildMI(*BB, MI, PPC::CNTLZW, 1, Temp1).addReg(Op0Reg);
1300 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp1).addImm(27)
1301 .addImm(5).addImm(31);
1302 }
1303 break;
1304 }
1305 } // switch
1306 return;
1307 }
1308 }
Nate Begemanb47321b2004-08-20 09:56:22 +00001309 unsigned PPCOpcode = getPPCOpcodeForSetCCNumber(Opcode);
Nate Begemana96c4af2004-08-21 20:42:14 +00001310
1311 // Create an iterator with which to insert the MBB for copying the false value
1312 // and the MBB to hold the PHI instruction for this SetCC.
Misha Brukman425ff242004-07-01 21:34:10 +00001313 MachineBasicBlock *thisMBB = BB;
1314 const BasicBlock *LLVM_BB = BB->getBasicBlock();
Misha Brukman7e898c32004-07-20 00:41:46 +00001315 ilist<MachineBasicBlock>::iterator It = BB;
1316 ++It;
1317
Misha Brukman425ff242004-07-01 21:34:10 +00001318 // thisMBB:
1319 // ...
1320 // cmpTY cr0, r1, r2
Misha Brukman425ff242004-07-01 21:34:10 +00001321 // %TrueValue = li 1
Nate Begemana96c4af2004-08-21 20:42:14 +00001322 // bCC sinkMBB
Nate Begemana2de1022004-09-22 04:40:25 +00001323 EmitComparison(Opcode, Op0, Op1, BB, BB->end());
Misha Brukmane2eceb52004-07-23 16:08:20 +00001324 unsigned TrueValue = makeAnotherReg(I.getType());
Misha Brukman5b570812004-08-10 22:47:03 +00001325 BuildMI(BB, PPC::LI, 1, TrueValue).addSImm(1);
Nate Begemana96c4af2004-08-21 20:42:14 +00001326 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
1327 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
1328 BuildMI(BB, PPCOpcode, 2).addReg(PPC::CR0).addMBB(sinkMBB);
1329 F->getBasicBlockList().insert(It, copy0MBB);
1330 F->getBasicBlockList().insert(It, sinkMBB);
Misha Brukman425ff242004-07-01 21:34:10 +00001331 // Update machine-CFG edges
Nate Begemana96c4af2004-08-21 20:42:14 +00001332 BB->addSuccessor(copy0MBB);
Misha Brukman425ff242004-07-01 21:34:10 +00001333 BB->addSuccessor(sinkMBB);
1334
Misha Brukman1013ef52004-07-21 20:09:08 +00001335 // copy0MBB:
1336 // %FalseValue = li 0
1337 // fallthrough
1338 BB = copy0MBB;
1339 unsigned FalseValue = makeAnotherReg(I.getType());
Misha Brukman5b570812004-08-10 22:47:03 +00001340 BuildMI(BB, PPC::LI, 1, FalseValue).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00001341 // Update machine-CFG edges
1342 BB->addSuccessor(sinkMBB);
1343
Misha Brukman425ff242004-07-01 21:34:10 +00001344 // sinkMBB:
Nate Begemana96c4af2004-08-21 20:42:14 +00001345 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
Misha Brukman425ff242004-07-01 21:34:10 +00001346 // ...
1347 BB = sinkMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00001348 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(FalseValue)
Nate Begemana96c4af2004-08-21 20:42:14 +00001349 .addMBB(copy0MBB).addReg(TrueValue).addMBB(thisMBB);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001350}
1351
Misha Brukmana1dca552004-09-21 18:22:19 +00001352void PPC32ISel::visitSelectInst(SelectInst &SI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001353 unsigned DestReg = getReg(SI);
1354 MachineBasicBlock::iterator MII = BB->end();
Misha Brukman2fec9902004-06-21 20:22:03 +00001355 emitSelectOperation(BB, MII, SI.getCondition(), SI.getTrueValue(),
1356 SI.getFalseValue(), DestReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001357}
1358
1359/// emitSelect - Common code shared between visitSelectInst and the constant
1360/// expression support.
Misha Brukmana1dca552004-09-21 18:22:19 +00001361void PPC32ISel::emitSelectOperation(MachineBasicBlock *MBB,
1362 MachineBasicBlock::iterator IP,
1363 Value *Cond, Value *TrueVal,
1364 Value *FalseVal, unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001365 unsigned SelectClass = getClassB(TrueVal->getType());
Misha Brukman7e898c32004-07-20 00:41:46 +00001366 unsigned Opcode;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001367
Misha Brukmanbebde752004-07-16 21:06:24 +00001368 // See if we can fold the setcc into the select instruction, or if we have
1369 // to get the register of the Cond value
Misha Brukmanbebde752004-07-16 21:06:24 +00001370 if (SetCondInst *SCI = canFoldSetCCIntoBranchOrSelect(Cond)) {
1371 // We successfully folded the setcc into the select instruction.
Misha Brukmanbebde752004-07-16 21:06:24 +00001372 unsigned OpNum = getSetCCNumber(SCI->getOpcode());
Nate Begeman087d5d92004-10-06 09:53:04 +00001373 if (OpNum >= 2 && OpNum <= 5) {
1374 unsigned SetCondClass = getClassB(SCI->getOperand(0)->getType());
1375 if ((SetCondClass == cFP32 || SetCondClass == cFP64) &&
1376 (SelectClass == cFP32 || SelectClass == cFP64)) {
1377 unsigned CondReg = getReg(SCI->getOperand(0), MBB, IP);
1378 unsigned TrueReg = getReg(TrueVal, MBB, IP);
1379 unsigned FalseReg = getReg(FalseVal, MBB, IP);
1380 // if the comparison of the floating point value used to for the select
1381 // is against 0, then we can emit an fsel without subtraction.
1382 ConstantFP *Op1C = dyn_cast<ConstantFP>(SCI->getOperand(1));
1383 if (Op1C && (Op1C->isExactlyValue(-0.0) || Op1C->isExactlyValue(0.0))) {
1384 switch(OpNum) {
1385 case 2: // LT
1386 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(CondReg)
1387 .addReg(FalseReg).addReg(TrueReg);
1388 break;
1389 case 3: // GE == !LT
1390 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(CondReg)
1391 .addReg(TrueReg).addReg(FalseReg);
1392 break;
1393 case 4: { // GT
1394 unsigned NegatedReg = makeAnotherReg(SCI->getOperand(0)->getType());
1395 BuildMI(*MBB, IP, PPC::FNEG, 1, NegatedReg).addReg(CondReg);
1396 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(NegatedReg)
1397 .addReg(FalseReg).addReg(TrueReg);
1398 }
1399 break;
1400 case 5: { // LE == !GT
1401 unsigned NegatedReg = makeAnotherReg(SCI->getOperand(0)->getType());
1402 BuildMI(*MBB, IP, PPC::FNEG, 1, NegatedReg).addReg(CondReg);
1403 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(NegatedReg)
1404 .addReg(TrueReg).addReg(FalseReg);
1405 }
1406 break;
1407 default:
1408 assert(0 && "Invalid SetCC opcode to fsel");
1409 abort();
1410 break;
1411 }
1412 } else {
1413 unsigned OtherCondReg = getReg(SCI->getOperand(1), MBB, IP);
1414 unsigned SelectReg = makeAnotherReg(SCI->getOperand(0)->getType());
1415 switch(OpNum) {
1416 case 2: // LT
1417 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(CondReg)
1418 .addReg(OtherCondReg);
1419 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1420 .addReg(FalseReg).addReg(TrueReg);
1421 break;
1422 case 3: // GE == !LT
1423 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(CondReg)
1424 .addReg(OtherCondReg);
1425 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1426 .addReg(TrueReg).addReg(FalseReg);
1427 break;
1428 case 4: // GT
1429 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(OtherCondReg)
1430 .addReg(CondReg);
1431 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1432 .addReg(FalseReg).addReg(TrueReg);
1433 break;
1434 case 5: // LE == !GT
1435 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(OtherCondReg)
1436 .addReg(CondReg);
1437 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1438 .addReg(TrueReg).addReg(FalseReg);
1439 break;
1440 default:
1441 assert(0 && "Invalid SetCC opcode to fsel");
1442 abort();
1443 break;
1444 }
1445 }
Nate Begeman087d5d92004-10-06 09:53:04 +00001446 return;
1447 }
1448 }
Misha Brukman47225442004-07-23 22:35:49 +00001449 OpNum = EmitComparison(OpNum, SCI->getOperand(0),SCI->getOperand(1),MBB,IP);
Misha Brukmanbebde752004-07-16 21:06:24 +00001450 Opcode = getPPCOpcodeForSetCCNumber(SCI->getOpcode());
1451 } else {
1452 unsigned CondReg = getReg(Cond, MBB, IP);
Nate Begemaned428532004-09-04 05:00:00 +00001453 BuildMI(*MBB, IP, PPC::CMPWI, 2, PPC::CR0).addReg(CondReg).addSImm(0);
Misha Brukmanbebde752004-07-16 21:06:24 +00001454 Opcode = getPPCOpcodeForSetCCNumber(Instruction::SetNE);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001455 }
Misha Brukmanbebde752004-07-16 21:06:24 +00001456
1457 MachineBasicBlock *thisMBB = BB;
1458 const BasicBlock *LLVM_BB = BB->getBasicBlock();
Misha Brukman7e898c32004-07-20 00:41:46 +00001459 ilist<MachineBasicBlock>::iterator It = BB;
1460 ++It;
Misha Brukmanbebde752004-07-16 21:06:24 +00001461
Nate Begemana96c4af2004-08-21 20:42:14 +00001462 // thisMBB:
1463 // ...
Chris Lattner6dec0b02005-01-01 16:10:12 +00001464 // TrueVal = ...
Nate Begemana96c4af2004-08-21 20:42:14 +00001465 // cmpTY cr0, r1, r2
Nate Begeman1f49e862004-09-29 05:00:31 +00001466 // bCC copy1MBB
1467 // fallthrough --> copy0MBB
Misha Brukmanbebde752004-07-16 21:06:24 +00001468 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
Misha Brukman1013ef52004-07-21 20:09:08 +00001469 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
Chris Lattner35e5c7c2005-01-02 23:07:31 +00001470 unsigned TrueValue = getReg(TrueVal);
Chris Lattner6dec0b02005-01-01 16:10:12 +00001471 BuildMI(BB, Opcode, 2).addReg(PPC::CR0).addMBB(sinkMBB);
Nate Begemana96c4af2004-08-21 20:42:14 +00001472 F->getBasicBlockList().insert(It, copy0MBB);
Misha Brukman1013ef52004-07-21 20:09:08 +00001473 F->getBasicBlockList().insert(It, sinkMBB);
Misha Brukmanbebde752004-07-16 21:06:24 +00001474 // Update machine-CFG edges
Misha Brukmanbebde752004-07-16 21:06:24 +00001475 BB->addSuccessor(copy0MBB);
Chris Lattner6dec0b02005-01-01 16:10:12 +00001476 BB->addSuccessor(sinkMBB);
Misha Brukmanbebde752004-07-16 21:06:24 +00001477
Misha Brukman1013ef52004-07-21 20:09:08 +00001478 // copy0MBB:
1479 // %FalseValue = ...
Chris Lattner6dec0b02005-01-01 16:10:12 +00001480 // # fallthrough to sinkMBB
Misha Brukman1013ef52004-07-21 20:09:08 +00001481 BB = copy0MBB;
Chris Lattner35e5c7c2005-01-02 23:07:31 +00001482 unsigned FalseValue = getReg(FalseVal);
Misha Brukman1013ef52004-07-21 20:09:08 +00001483 // Update machine-CFG edges
1484 BB->addSuccessor(sinkMBB);
1485
Misha Brukmanbebde752004-07-16 21:06:24 +00001486 // sinkMBB:
Nate Begemana96c4af2004-08-21 20:42:14 +00001487 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
Misha Brukmanbebde752004-07-16 21:06:24 +00001488 // ...
1489 BB = sinkMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00001490 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(FalseValue)
Chris Lattner6dec0b02005-01-01 16:10:12 +00001491 .addMBB(copy0MBB).addReg(TrueValue).addMBB(thisMBB);
Nate Begemana96c4af2004-08-21 20:42:14 +00001492
Chris Lattner6dec0b02005-01-01 16:10:12 +00001493 // For a register pair representing a long value, define the top part.
Nate Begeman8d963e62004-08-11 03:30:55 +00001494 if (getClassB(TrueVal->getType()) == cLong)
Chris Lattner6dec0b02005-01-01 16:10:12 +00001495 BuildMI(BB, PPC::PHI, 4, DestReg+1).addReg(FalseValue+1)
1496 .addMBB(copy0MBB).addReg(TrueValue+1).addMBB(thisMBB);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001497}
1498
1499
1500
1501/// promote32 - Emit instructions to turn a narrow operand into a 32-bit-wide
1502/// operand, in the specified target register.
1503///
Misha Brukmana1dca552004-09-21 18:22:19 +00001504void PPC32ISel::promote32(unsigned targetReg, const ValueRecord &VR) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001505 bool isUnsigned = VR.Ty->isUnsigned() || VR.Ty == Type::BoolTy;
1506
1507 Value *Val = VR.Val;
1508 const Type *Ty = VR.Ty;
1509 if (Val) {
1510 if (Constant *C = dyn_cast<Constant>(Val)) {
1511 Val = ConstantExpr::getCast(C, Type::IntTy);
Chris Lattner74a806c2004-08-11 07:34:50 +00001512 if (isa<ConstantExpr>(Val)) // Could not fold
1513 Val = C;
1514 else
1515 Ty = Type::IntTy; // Folded!
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001516 }
1517
Misha Brukman2fec9902004-06-21 20:22:03 +00001518 // If this is a simple constant, just emit a load directly to avoid the copy
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001519 if (ConstantInt *CI = dyn_cast<ConstantInt>(Val)) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00001520 copyConstantToRegister(BB, BB->end(), CI, targetReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001521 return;
1522 }
1523 }
1524
1525 // Make sure we have the register number for this value...
1526 unsigned Reg = Val ? getReg(Val) : VR.Reg;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001527 switch (getClassB(Ty)) {
1528 case cByte:
1529 // Extend value into target register (8->32)
Nate Begeman1b99fd32004-09-29 03:45:33 +00001530 if (Ty == Type::BoolTy)
1531 BuildMI(BB, PPC::OR, 2, targetReg).addReg(Reg).addReg(Reg);
1532 else if (isUnsigned)
Misha Brukman5b570812004-08-10 22:47:03 +00001533 BuildMI(BB, PPC::RLWINM, 4, targetReg).addReg(Reg).addZImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00001534 .addZImm(24).addZImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001535 else
Misha Brukman5b570812004-08-10 22:47:03 +00001536 BuildMI(BB, PPC::EXTSB, 1, targetReg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001537 break;
1538 case cShort:
1539 // Extend value into target register (16->32)
1540 if (isUnsigned)
Misha Brukman5b570812004-08-10 22:47:03 +00001541 BuildMI(BB, PPC::RLWINM, 4, targetReg).addReg(Reg).addZImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00001542 .addZImm(16).addZImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001543 else
Misha Brukman5b570812004-08-10 22:47:03 +00001544 BuildMI(BB, PPC::EXTSH, 1, targetReg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001545 break;
1546 case cInt:
1547 // Move value into target register (32->32)
Misha Brukman5b570812004-08-10 22:47:03 +00001548 BuildMI(BB, PPC::OR, 2, targetReg).addReg(Reg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001549 break;
1550 default:
1551 assert(0 && "Unpromotable operand class in promote32");
1552 }
1553}
1554
Misha Brukman2fec9902004-06-21 20:22:03 +00001555/// visitReturnInst - implemented with BLR
1556///
Misha Brukmana1dca552004-09-21 18:22:19 +00001557void PPC32ISel::visitReturnInst(ReturnInst &I) {
Misha Brukmand47bbf72004-06-25 19:04:27 +00001558 // Only do the processing if this is a non-void return
1559 if (I.getNumOperands() > 0) {
1560 Value *RetVal = I.getOperand(0);
1561 switch (getClassB(RetVal->getType())) {
1562 case cByte: // integral return values: extend or move into r3 and return
1563 case cShort:
1564 case cInt:
Misha Brukman5b570812004-08-10 22:47:03 +00001565 promote32(PPC::R3, ValueRecord(RetVal));
Misha Brukmand47bbf72004-06-25 19:04:27 +00001566 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001567 case cFP32:
1568 case cFP64: { // Floats & Doubles: Return in f1
Misha Brukmand47bbf72004-06-25 19:04:27 +00001569 unsigned RetReg = getReg(RetVal);
Misha Brukman5b570812004-08-10 22:47:03 +00001570 BuildMI(BB, PPC::FMR, 1, PPC::F1).addReg(RetReg);
Misha Brukmand47bbf72004-06-25 19:04:27 +00001571 break;
1572 }
1573 case cLong: {
1574 unsigned RetReg = getReg(RetVal);
Misha Brukman5b570812004-08-10 22:47:03 +00001575 BuildMI(BB, PPC::OR, 2, PPC::R3).addReg(RetReg).addReg(RetReg);
1576 BuildMI(BB, PPC::OR, 2, PPC::R4).addReg(RetReg+1).addReg(RetReg+1);
Misha Brukmand47bbf72004-06-25 19:04:27 +00001577 break;
1578 }
1579 default:
1580 visitInstruction(I);
1581 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001582 }
Misha Brukman5b570812004-08-10 22:47:03 +00001583 BuildMI(BB, PPC::BLR, 1).addImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001584}
1585
1586// getBlockAfter - Return the basic block which occurs lexically after the
1587// specified one.
1588static inline BasicBlock *getBlockAfter(BasicBlock *BB) {
1589 Function::iterator I = BB; ++I; // Get iterator to next block
1590 return I != BB->getParent()->end() ? &*I : 0;
1591}
1592
1593/// visitBranchInst - Handle conditional and unconditional branches here. Note
1594/// that since code layout is frozen at this point, that if we are trying to
1595/// jump to a block that is the immediate successor of the current block, we can
1596/// just make a fall-through (but we don't currently).
1597///
Misha Brukmana1dca552004-09-21 18:22:19 +00001598void PPC32ISel::visitBranchInst(BranchInst &BI) {
Misha Brukman2fec9902004-06-21 20:22:03 +00001599 // Update machine-CFG edges
Misha Brukmane2eceb52004-07-23 16:08:20 +00001600 BB->addSuccessor(MBBMap[BI.getSuccessor(0)]);
Misha Brukman2fec9902004-06-21 20:22:03 +00001601 if (BI.isConditional())
Misha Brukmane2eceb52004-07-23 16:08:20 +00001602 BB->addSuccessor(MBBMap[BI.getSuccessor(1)]);
Misha Brukman2fec9902004-06-21 20:22:03 +00001603
1604 BasicBlock *NextBB = getBlockAfter(BI.getParent()); // BB after current one
Misha Brukmane9c65512004-07-06 15:32:44 +00001605
Misha Brukman2fec9902004-06-21 20:22:03 +00001606 if (!BI.isConditional()) { // Unconditional branch?
Misha Brukmane9c65512004-07-06 15:32:44 +00001607 if (BI.getSuccessor(0) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001608 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001609 return;
Misha Brukman2fec9902004-06-21 20:22:03 +00001610 }
1611
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001612 // See if we can fold the setcc into the branch itself...
1613 SetCondInst *SCI = canFoldSetCCIntoBranchOrSelect(BI.getCondition());
1614 if (SCI == 0) {
1615 // Nope, cannot fold setcc into this branch. Emit a branch on a condition
1616 // computed some other way...
1617 unsigned condReg = getReg(BI.getCondition());
Misha Brukman5b570812004-08-10 22:47:03 +00001618 BuildMI(BB, PPC::CMPLI, 3, PPC::CR0).addImm(0).addReg(condReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00001619 .addImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001620 if (BI.getSuccessor(1) == NextBB) {
1621 if (BI.getSuccessor(0) != NextBB)
Nate Begeman439b4442005-04-05 04:22:58 +00001622 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(PPC::CR0).addImm(PPC::BNE)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001623 .addMBB(MBBMap[BI.getSuccessor(0)])
1624 .addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001625 } else {
Nate Begeman439b4442005-04-05 04:22:58 +00001626 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(PPC::CR0).addImm(PPC::BEQ)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001627 .addMBB(MBBMap[BI.getSuccessor(1)])
1628 .addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001629 if (BI.getSuccessor(0) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001630 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001631 }
1632 return;
1633 }
1634
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001635 unsigned OpNum = getSetCCNumber(SCI->getOpcode());
Misha Brukmane9c65512004-07-06 15:32:44 +00001636 unsigned Opcode = getPPCOpcodeForSetCCNumber(SCI->getOpcode());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001637 MachineBasicBlock::iterator MII = BB->end();
1638 OpNum = EmitComparison(OpNum, SCI->getOperand(0), SCI->getOperand(1), BB,MII);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001639
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001640 if (BI.getSuccessor(0) != NextBB) {
Nate Begeman439b4442005-04-05 04:22:58 +00001641 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(PPC::CR0).addImm(Opcode)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001642 .addMBB(MBBMap[BI.getSuccessor(0)])
1643 .addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001644 if (BI.getSuccessor(1) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001645 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001646 } else {
1647 // Change to the inverse condition...
1648 if (BI.getSuccessor(1) != NextBB) {
Misha Brukmanf2ccb772004-08-17 04:55:41 +00001649 Opcode = PPC32InstrInfo::invertPPCBranchOpcode(Opcode);
Nate Begeman439b4442005-04-05 04:22:58 +00001650 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(PPC::CR0).addImm(Opcode)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001651 .addMBB(MBBMap[BI.getSuccessor(1)])
1652 .addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001653 }
1654 }
1655}
1656
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001657/// doCall - This emits an abstract call instruction, setting up the arguments
1658/// and the return value as appropriate. For the actual function call itself,
1659/// it inserts the specified CallMI instruction into the stream.
1660///
1661/// FIXME: See Documentation at the following URL for "correct" behavior
Nate Begemanc13a7f02005-03-26 01:28:05 +00001662/// <http://developer.apple.com/documentation/DeveloperTools/Conceptual/MachORuntime/PowerPCConventions/chapter_3_section_5.html>
Misha Brukmana1dca552004-09-21 18:22:19 +00001663void PPC32ISel::doCall(const ValueRecord &Ret, MachineInstr *CallMI,
1664 const std::vector<ValueRecord> &Args, bool isVarArg) {
Chris Lattner3ea93462004-08-06 06:58:50 +00001665 // Count how many bytes are to be pushed on the stack, including the linkage
1666 // area, and parameter passing area.
1667 unsigned NumBytes = 24;
1668 unsigned ArgOffset = 24;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001669
1670 if (!Args.empty()) {
1671 for (unsigned i = 0, e = Args.size(); i != e; ++i)
1672 switch (getClassB(Args[i].Ty)) {
1673 case cByte: case cShort: case cInt:
1674 NumBytes += 4; break;
1675 case cLong:
1676 NumBytes += 8; break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001677 case cFP32:
1678 NumBytes += 4; break;
1679 case cFP64:
1680 NumBytes += 8; break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001681 break;
1682 default: assert(0 && "Unknown class!");
1683 }
1684
Nate Begeman865075e2004-08-16 01:50:22 +00001685 // Just to be safe, we'll always reserve the full 24 bytes of linkage area
1686 // plus 32 bytes of argument space in case any called code gets funky on us.
1687 if (NumBytes < 56) NumBytes = 56;
Chris Lattner3ea93462004-08-06 06:58:50 +00001688
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001689 // Adjust the stack pointer for the new arguments...
Nate Begemanc13a7f02005-03-26 01:28:05 +00001690 // These operations are automatically eliminated by the prolog/epilog pass
Misha Brukman5b570812004-08-10 22:47:03 +00001691 BuildMI(BB, PPC::ADJCALLSTACKDOWN, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001692
1693 // Arguments go on the stack in reverse order, as specified by the ABI.
Misha Brukman7e898c32004-07-20 00:41:46 +00001694 // Offset to the paramater area on the stack is 24.
Misha Brukmand18a31d2004-07-06 22:51:53 +00001695 int GPR_remaining = 8, FPR_remaining = 13;
Misha Brukmanfc879c32004-07-08 18:02:38 +00001696 unsigned GPR_idx = 0, FPR_idx = 0;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001697 static const unsigned GPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00001698 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
1699 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001700 };
Misha Brukmand18a31d2004-07-06 22:51:53 +00001701 static const unsigned FPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00001702 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6,
1703 PPC::F7, PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12,
1704 PPC::F13
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001705 };
Misha Brukman422791f2004-06-21 17:41:12 +00001706
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001707 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
1708 unsigned ArgReg;
1709 switch (getClassB(Args[i].Ty)) {
1710 case cByte:
1711 case cShort:
1712 // Promote arg to 32 bits wide into a temporary register...
1713 ArgReg = makeAnotherReg(Type::UIntTy);
1714 promote32(ArgReg, Args[i]);
Misha Brukman422791f2004-06-21 17:41:12 +00001715
1716 // Reg or stack?
1717 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001718 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001719 .addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001720 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001721 }
1722 if (GPR_remaining <= 0 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001723 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1724 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001725 }
1726 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001727 case cInt:
1728 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
1729
Misha Brukman422791f2004-06-21 17:41:12 +00001730 // Reg or stack?
1731 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001732 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001733 .addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001734 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001735 }
1736 if (GPR_remaining <= 0 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001737 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1738 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001739 }
1740 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001741 case cLong:
Misha Brukman422791f2004-06-21 17:41:12 +00001742 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001743
Misha Brukmanec6319a2004-07-20 15:51:37 +00001744 // Reg or stack? Note that PPC calling conventions state that long args
1745 // are passed rN = hi, rN+1 = lo, opposite of LLVM.
Misha Brukman422791f2004-06-21 17:41:12 +00001746 if (GPR_remaining > 1) {
Misha Brukman5b570812004-08-10 22:47:03 +00001747 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanec6319a2004-07-20 15:51:37 +00001748 .addReg(ArgReg);
Misha Brukman5b570812004-08-10 22:47:03 +00001749 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx+1]).addReg(ArgReg+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001750 .addReg(ArgReg+1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001751 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1752 CallMI->addRegOperand(GPR[GPR_idx+1], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001753 }
1754 if (GPR_remaining <= 1 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001755 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1756 .addReg(PPC::R1);
1757 BuildMI(BB, PPC::STW, 3).addReg(ArgReg+1).addSImm(ArgOffset+4)
1758 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001759 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001760
1761 ArgOffset += 4; // 8 byte entry, not 4.
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001762 GPR_remaining -= 1; // uses up 2 GPRs
1763 GPR_idx += 1;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001764 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001765 case cFP32:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001766 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
Misha Brukman7e898c32004-07-20 00:41:46 +00001767 // Reg or stack?
1768 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001769 BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001770 CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use);
1771 FPR_remaining--;
1772 FPR_idx++;
1773
1774 // If this is a vararg function, and there are GPRs left, also
1775 // pass the float in an int. Otherwise, put it on the stack.
1776 if (isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001777 BuildMI(BB, PPC::STFS, 3).addReg(ArgReg).addSImm(ArgOffset)
1778 .addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001779 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001780 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx])
Nate Begeman293d88c2004-08-13 04:45:14 +00001781 .addSImm(ArgOffset).addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001782 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1783 }
Misha Brukman1916bf92004-06-24 21:56:15 +00001784 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001785 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00001786 BuildMI(BB, PPC::STFS, 3).addReg(ArgReg).addSImm(ArgOffset)
1787 .addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001788 }
1789 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001790 case cFP64:
1791 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
1792 // Reg or stack?
1793 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001794 BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001795 CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use);
1796 FPR_remaining--;
1797 FPR_idx++;
1798 // For vararg functions, must pass doubles via int regs as well
1799 if (isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001800 BuildMI(BB, PPC::STFD, 3).addReg(ArgReg).addSImm(ArgOffset)
1801 .addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001802
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001803 // Doubles can be split across reg + stack for varargs
1804 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001805 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx]).addSImm(ArgOffset)
1806 .addReg(PPC::R1);
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001807 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1808 }
1809 if (GPR_remaining > 1) {
Misha Brukman5b570812004-08-10 22:47:03 +00001810 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx+1])
1811 .addSImm(ArgOffset+4).addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001812 CallMI->addRegOperand(GPR[GPR_idx+1], MachineOperand::Use);
1813 }
1814 }
1815 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00001816 BuildMI(BB, PPC::STFD, 3).addReg(ArgReg).addSImm(ArgOffset)
1817 .addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001818 }
1819 // Doubles use 8 bytes, and 2 GPRs worth of param space
1820 ArgOffset += 4;
1821 GPR_remaining--;
1822 GPR_idx++;
1823 break;
1824
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001825 default: assert(0 && "Unknown class!");
1826 }
1827 ArgOffset += 4;
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001828 GPR_remaining--;
1829 GPR_idx++;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001830 }
1831 } else {
Nate Begeman865075e2004-08-16 01:50:22 +00001832 BuildMI(BB, PPC::ADJCALLSTACKDOWN, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001833 }
Nate Begeman43d64ea2004-08-15 06:42:28 +00001834
Misha Brukman5b570812004-08-10 22:47:03 +00001835 BuildMI(BB, PPC::IMPLICIT_DEF, 0, PPC::LR);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001836 BB->push_back(CallMI);
Chris Lattner3ea93462004-08-06 06:58:50 +00001837
1838 // These functions are automatically eliminated by the prolog/epilog pass
Misha Brukman5b570812004-08-10 22:47:03 +00001839 BuildMI(BB, PPC::ADJCALLSTACKUP, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001840
1841 // If there is a return value, scavenge the result from the location the call
1842 // leaves it in...
1843 //
1844 if (Ret.Ty != Type::VoidTy) {
1845 unsigned DestClass = getClassB(Ret.Ty);
1846 switch (DestClass) {
1847 case cByte:
1848 case cShort:
1849 case cInt:
1850 // Integral results are in r3
Misha Brukman5b570812004-08-10 22:47:03 +00001851 BuildMI(BB, PPC::OR, 2, Ret.Reg).addReg(PPC::R3).addReg(PPC::R3);
Misha Brukmane327e492004-06-24 23:53:24 +00001852 break;
Chris Lattner3ea93462004-08-06 06:58:50 +00001853 case cFP32: // Floating-point return values live in f1
Misha Brukman7e898c32004-07-20 00:41:46 +00001854 case cFP64:
Misha Brukman5b570812004-08-10 22:47:03 +00001855 BuildMI(BB, PPC::FMR, 1, Ret.Reg).addReg(PPC::F1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001856 break;
Chris Lattner3ea93462004-08-06 06:58:50 +00001857 case cLong: // Long values are in r3:r4
Misha Brukman5b570812004-08-10 22:47:03 +00001858 BuildMI(BB, PPC::OR, 2, Ret.Reg).addReg(PPC::R3).addReg(PPC::R3);
1859 BuildMI(BB, PPC::OR, 2, Ret.Reg+1).addReg(PPC::R4).addReg(PPC::R4);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001860 break;
1861 default: assert(0 && "Unknown class!");
1862 }
1863 }
1864}
1865
1866
1867/// visitCallInst - Push args on stack and do a procedure call instruction.
Misha Brukmana1dca552004-09-21 18:22:19 +00001868void PPC32ISel::visitCallInst(CallInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001869 MachineInstr *TheCall;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001870 Function *F = CI.getCalledFunction();
1871 if (F) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001872 // Is it an intrinsic function call?
1873 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID()) {
1874 visitIntrinsicCall(ID, CI); // Special intrinsics are not handled here
1875 return;
1876 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001877 // Emit a CALL instruction with PC-relative displacement.
Misha Brukman5b570812004-08-10 22:47:03 +00001878 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(F, true);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001879 } else { // Emit an indirect call through the CTR
1880 unsigned Reg = getReg(CI.getCalledValue());
Nate Begeman43d64ea2004-08-15 06:42:28 +00001881 BuildMI(BB, PPC::OR, 2, PPC::R12).addReg(Reg).addReg(Reg);
1882 BuildMI(BB, PPC::MTCTR, 1).addReg(PPC::R12);
Nate Begeman7ca541b2005-03-24 23:34:38 +00001883 TheCall = BuildMI(PPC::CALLindirect, 3).addZImm(20).addZImm(0)
Nate Begeman43d64ea2004-08-15 06:42:28 +00001884 .addReg(PPC::R12);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001885 }
1886
1887 std::vector<ValueRecord> Args;
1888 for (unsigned i = 1, e = CI.getNumOperands(); i != e; ++i)
1889 Args.push_back(ValueRecord(CI.getOperand(i)));
1890
1891 unsigned DestReg = CI.getType() != Type::VoidTy ? getReg(CI) : 0;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001892 bool isVarArg = F ? F->getFunctionType()->isVarArg() : true;
1893 doCall(ValueRecord(DestReg, CI.getType()), TheCall, Args, isVarArg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001894}
1895
1896
1897/// dyncastIsNan - Return the operand of an isnan operation if this is an isnan.
1898///
1899static Value *dyncastIsNan(Value *V) {
1900 if (CallInst *CI = dyn_cast<CallInst>(V))
1901 if (Function *F = CI->getCalledFunction())
Misha Brukmana2916ce2004-06-21 17:58:36 +00001902 if (F->getIntrinsicID() == Intrinsic::isunordered)
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001903 return CI->getOperand(1);
1904 return 0;
1905}
1906
1907/// isOnlyUsedByUnorderedComparisons - Return true if this value is only used by
1908/// or's whos operands are all calls to the isnan predicate.
1909static bool isOnlyUsedByUnorderedComparisons(Value *V) {
1910 assert(dyncastIsNan(V) && "The value isn't an isnan call!");
1911
1912 // Check all uses, which will be or's of isnans if this predicate is true.
1913 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;++UI){
1914 Instruction *I = cast<Instruction>(*UI);
1915 if (I->getOpcode() != Instruction::Or) return false;
1916 if (I->getOperand(0) != V && !dyncastIsNan(I->getOperand(0))) return false;
1917 if (I->getOperand(1) != V && !dyncastIsNan(I->getOperand(1))) return false;
1918 }
1919
1920 return true;
1921}
1922
1923/// LowerUnknownIntrinsicFunctionCalls - This performs a prepass over the
1924/// function, lowering any calls to unknown intrinsic functions into the
1925/// equivalent LLVM code.
1926///
Misha Brukmana1dca552004-09-21 18:22:19 +00001927void PPC32ISel::LowerUnknownIntrinsicFunctionCalls(Function &F) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001928 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
1929 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
1930 if (CallInst *CI = dyn_cast<CallInst>(I++))
1931 if (Function *F = CI->getCalledFunction())
1932 switch (F->getIntrinsicID()) {
1933 case Intrinsic::not_intrinsic:
1934 case Intrinsic::vastart:
1935 case Intrinsic::vacopy:
1936 case Intrinsic::vaend:
1937 case Intrinsic::returnaddress:
1938 case Intrinsic::frameaddress:
Misha Brukmanb097f212004-07-26 18:13:24 +00001939 // FIXME: should lower these ourselves
Misha Brukmana2916ce2004-06-21 17:58:36 +00001940 // case Intrinsic::isunordered:
Misha Brukmanb097f212004-07-26 18:13:24 +00001941 // case Intrinsic::memcpy: -> doCall(). system memcpy almost
1942 // guaranteed to be faster than anything we generate ourselves
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001943 // We directly implement these intrinsics
1944 break;
1945 case Intrinsic::readio: {
1946 // On PPC, memory operations are in-order. Lower this intrinsic
1947 // into a volatile load.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001948 LoadInst * LI = new LoadInst(CI->getOperand(1), "", true, CI);
1949 CI->replaceAllUsesWith(LI);
1950 BB->getInstList().erase(CI);
1951 break;
1952 }
1953 case Intrinsic::writeio: {
1954 // On PPC, memory operations are in-order. Lower this intrinsic
1955 // into a volatile store.
Misha Brukman8d442c22004-07-14 15:29:51 +00001956 StoreInst *SI = new StoreInst(CI->getOperand(1),
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001957 CI->getOperand(2), true, CI);
Misha Brukman8d442c22004-07-14 15:29:51 +00001958 CI->replaceAllUsesWith(SI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001959 BB->getInstList().erase(CI);
1960 break;
1961 }
Nate Begeman2daec452005-03-24 20:07:16 +00001962 default: {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001963 // All other intrinsic calls we must lower.
Nate Begeman2daec452005-03-24 20:07:16 +00001964 BasicBlock::iterator me(CI);
1965 bool atBegin(BB->begin() == me);
1966 if (!atBegin)
1967 --me;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001968 TM.getIntrinsicLowering().LowerIntrinsicCall(CI);
Nate Begeman2daec452005-03-24 20:07:16 +00001969 // Move iterator to instruction after call
1970 I = atBegin ? BB->begin() : ++me;
1971 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001972 }
1973}
1974
Misha Brukmana1dca552004-09-21 18:22:19 +00001975void PPC32ISel::visitIntrinsicCall(Intrinsic::ID ID, CallInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001976 unsigned TmpReg1, TmpReg2, TmpReg3;
1977 switch (ID) {
1978 case Intrinsic::vastart:
1979 // Get the address of the first vararg value...
1980 TmpReg1 = getReg(CI);
Misha Brukman5b570812004-08-10 22:47:03 +00001981 addFrameReference(BuildMI(BB, PPC::ADDI, 2, TmpReg1), VarArgsFrameIndex,
Misha Brukmanec6319a2004-07-20 15:51:37 +00001982 0, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001983 return;
1984
1985 case Intrinsic::vacopy:
1986 TmpReg1 = getReg(CI);
1987 TmpReg2 = getReg(CI.getOperand(1));
Misha Brukman5b570812004-08-10 22:47:03 +00001988 BuildMI(BB, PPC::OR, 2, TmpReg1).addReg(TmpReg2).addReg(TmpReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001989 return;
1990 case Intrinsic::vaend: return;
1991
1992 case Intrinsic::returnaddress:
Misha Brukmanec6319a2004-07-20 15:51:37 +00001993 TmpReg1 = getReg(CI);
1994 if (cast<Constant>(CI.getOperand(1))->isNullValue()) {
1995 MachineFrameInfo *MFI = F->getFrameInfo();
1996 unsigned NumBytes = MFI->getStackSize();
1997
Misha Brukman5b570812004-08-10 22:47:03 +00001998 BuildMI(BB, PPC::LWZ, 2, TmpReg1).addSImm(NumBytes+8)
1999 .addReg(PPC::R1);
Misha Brukmanec6319a2004-07-20 15:51:37 +00002000 } else {
2001 // Values other than zero are not implemented yet.
Misha Brukman5b570812004-08-10 22:47:03 +00002002 BuildMI(BB, PPC::LI, 1, TmpReg1).addSImm(0);
Misha Brukmanec6319a2004-07-20 15:51:37 +00002003 }
2004 return;
2005
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002006 case Intrinsic::frameaddress:
2007 TmpReg1 = getReg(CI);
2008 if (cast<Constant>(CI.getOperand(1))->isNullValue()) {
Misha Brukman5b570812004-08-10 22:47:03 +00002009 BuildMI(BB, PPC::OR, 2, TmpReg1).addReg(PPC::R1).addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002010 } else {
2011 // Values other than zero are not implemented yet.
Misha Brukman5b570812004-08-10 22:47:03 +00002012 BuildMI(BB, PPC::LI, 1, TmpReg1).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002013 }
2014 return;
Misha Brukmanb097f212004-07-26 18:13:24 +00002015
Misha Brukmana2916ce2004-06-21 17:58:36 +00002016#if 0
2017 // This may be useful for supporting isunordered
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002018 case Intrinsic::isnan:
2019 // If this is only used by 'isunordered' style comparisons, don't emit it.
2020 if (isOnlyUsedByUnorderedComparisons(&CI)) return;
2021 TmpReg1 = getReg(CI.getOperand(1));
2022 emitUCOM(BB, BB->end(), TmpReg1, TmpReg1);
Misha Brukman422791f2004-06-21 17:41:12 +00002023 TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00002024 BuildMI(BB, PPC::MFCR, TmpReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002025 TmpReg3 = getReg(CI);
Misha Brukman5b570812004-08-10 22:47:03 +00002026 BuildMI(BB, PPC::RLWINM, 4, TmpReg3).addReg(TmpReg2).addImm(4).addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002027 return;
Misha Brukmana2916ce2004-06-21 17:58:36 +00002028#endif
2029
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002030 default: assert(0 && "Error: unknown intrinsics should have been lowered!");
2031 }
2032}
2033
2034/// visitSimpleBinary - Implement simple binary operators for integral types...
2035/// OperatorClass is one of: 0 for Add, 1 for Sub, 2 for And, 3 for Or, 4 for
2036/// Xor.
2037///
Misha Brukmana1dca552004-09-21 18:22:19 +00002038void PPC32ISel::visitSimpleBinary(BinaryOperator &B, unsigned OperatorClass) {
Nate Begeman1b750222004-10-17 05:19:20 +00002039 if (std::find(SkipList.begin(), SkipList.end(), &B) != SkipList.end())
2040 return;
Nate Begeman905a2912004-10-24 10:33:30 +00002041
2042 unsigned DestReg = getReg(B);
2043 MachineBasicBlock::iterator MI = BB->end();
2044 RlwimiRec RR = InsertMap[&B];
2045 if (RR.Target != 0) {
2046 unsigned TargetReg = getReg(RR.Target, BB, MI);
2047 unsigned InsertReg = getReg(RR.Insert, BB, MI);
2048 BuildMI(*BB, MI, PPC::RLWIMI, 5, DestReg).addReg(TargetReg)
2049 .addReg(InsertReg).addImm(RR.Shift).addImm(RR.MB).addImm(RR.ME);
2050 return;
Nate Begeman1b750222004-10-17 05:19:20 +00002051 }
Nate Begeman905a2912004-10-24 10:33:30 +00002052
2053 unsigned Class = getClassB(B.getType());
2054 Value *Op0 = B.getOperand(0), *Op1 = B.getOperand(1);
2055 emitSimpleBinaryOperation(BB, MI, &B, Op0, Op1, OperatorClass, DestReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002056}
2057
2058/// emitBinaryFPOperation - This method handles emission of floating point
2059/// Add (0), Sub (1), Mul (2), and Div (3) operations.
Misha Brukmana1dca552004-09-21 18:22:19 +00002060void PPC32ISel::emitBinaryFPOperation(MachineBasicBlock *BB,
2061 MachineBasicBlock::iterator IP,
2062 Value *Op0, Value *Op1,
2063 unsigned OperatorClass, unsigned DestReg){
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002064
Nate Begeman6d1e2df2004-08-14 22:11:38 +00002065 static const unsigned OpcodeTab[][4] = {
2066 { PPC::FADDS, PPC::FSUBS, PPC::FMULS, PPC::FDIVS }, // Float
2067 { PPC::FADD, PPC::FSUB, PPC::FMUL, PPC::FDIV }, // Double
2068 };
2069
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002070 // Special case: R1 = op <const fp>, R2
Misha Brukmana596f8c2004-07-13 15:35:45 +00002071 if (ConstantFP *Op0C = dyn_cast<ConstantFP>(Op0))
2072 if (Op0C->isExactlyValue(-0.0) && OperatorClass == 1) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002073 // -0.0 - X === -X
2074 unsigned op1Reg = getReg(Op1, BB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00002075 BuildMI(*BB, IP, PPC::FNEG, 1, DestReg).addReg(op1Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002076 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002077 }
2078
Nate Begeman81d265d2004-08-19 05:20:54 +00002079 unsigned Opcode = OpcodeTab[Op0->getType() == Type::DoubleTy][OperatorClass];
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002080 unsigned Op0r = getReg(Op0, BB, IP);
2081 unsigned Op1r = getReg(Op1, BB, IP);
2082 BuildMI(*BB, IP, Opcode, 2, DestReg).addReg(Op0r).addReg(Op1r);
2083}
2084
Nate Begemanb816f022004-10-07 22:30:03 +00002085// ExactLog2 - This function solves for (Val == 1 << (N-1)) and returns N. It
2086// returns zero when the input is not exactly a power of two.
2087static unsigned ExactLog2(unsigned Val) {
2088 if (Val == 0 || (Val & (Val-1))) return 0;
2089 unsigned Count = 0;
2090 while (Val != 1) {
2091 Val >>= 1;
2092 ++Count;
2093 }
2094 return Count;
2095}
2096
Nate Begemanbdf69842004-10-08 02:49:24 +00002097// isRunOfOnes - returns true if Val consists of one contiguous run of 1's with
2098// any number of 0's on either side. the 1's are allowed to wrap from LSB to
2099// MSB. so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
2100// not, since all 1's are not contiguous.
2101static bool isRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME) {
2102 bool isRun = true;
2103 MB = 0;
2104 ME = 0;
2105
2106 // look for first set bit
2107 int i = 0;
2108 for (; i < 32; i++) {
2109 if ((Val & (1 << (31 - i))) != 0) {
2110 MB = i;
2111 ME = i;
2112 break;
2113 }
2114 }
2115
2116 // look for last set bit
2117 for (; i < 32; i++) {
2118 if ((Val & (1 << (31 - i))) == 0)
2119 break;
2120 ME = i;
2121 }
2122
2123 // look for next set bit
2124 for (; i < 32; i++) {
2125 if ((Val & (1 << (31 - i))) != 0)
2126 break;
2127 }
2128
2129 // if we exhausted all the bits, we found a match at this point for 0*1*0*
2130 if (i == 32)
2131 return true;
2132
2133 // since we just encountered more 1's, if it doesn't wrap around to the
2134 // most significant bit of the word, then we did not find a match to 1*0*1* so
2135 // exit.
2136 if (MB != 0)
2137 return false;
2138
2139 // look for last set bit
2140 for (MB = i; i < 32; i++) {
2141 if ((Val & (1 << (31 - i))) == 0)
2142 break;
2143 }
2144
2145 // if we exhausted all the bits, then we found a match for 1*0*1*, otherwise,
2146 // the value is not a run of ones.
2147 if (i == 32)
2148 return true;
2149 return false;
2150}
2151
Nate Begeman905a2912004-10-24 10:33:30 +00002152/// isInsertAndHalf - Helper function for emitBitfieldInsert. Returns true if
2153/// OpUser has one use, is used by an or instruction, and is itself an and whose
2154/// second operand is a constant int. Optionally, set OrI to the Or instruction
2155/// that is the sole user of OpUser, and Op1User to the other operand of the Or
2156/// instruction.
2157static bool isInsertAndHalf(User *OpUser, Instruction **Op1User,
2158 Instruction **OrI, unsigned &Mask) {
2159 // If this instruction doesn't have one use, then return false.
2160 if (!OpUser->hasOneUse())
2161 return false;
2162
2163 Mask = 0xFFFFFFFF;
2164 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(OpUser))
2165 if (BO->getOpcode() == Instruction::And) {
2166 Value *AndUse = *(OpUser->use_begin());
2167 if (BinaryOperator *Or = dyn_cast<BinaryOperator>(AndUse)) {
2168 if (Or->getOpcode() == Instruction::Or) {
2169 if (ConstantInt *CI = dyn_cast<ConstantInt>(OpUser->getOperand(1))) {
2170 if (OrI) *OrI = Or;
2171 if (Op1User) {
2172 if (Or->getOperand(0) == OpUser)
2173 *Op1User = dyn_cast<Instruction>(Or->getOperand(1));
2174 else
2175 *Op1User = dyn_cast<Instruction>(Or->getOperand(0));
Nate Begeman1b750222004-10-17 05:19:20 +00002176 }
Nate Begeman905a2912004-10-24 10:33:30 +00002177 Mask &= CI->getRawValue();
2178 return true;
Nate Begeman1b750222004-10-17 05:19:20 +00002179 }
2180 }
2181 }
2182 }
Nate Begeman905a2912004-10-24 10:33:30 +00002183 return false;
2184}
2185
2186/// isInsertShiftHalf - Helper function for emitBitfieldInsert. Returns true if
2187/// OpUser has one use, is used by an or instruction, and is itself a shift
2188/// instruction that is either used directly by the or instruction, or is used
2189/// by an and instruction whose second operand is a constant int, and which is
2190/// used by the or instruction.
2191static bool isInsertShiftHalf(User *OpUser, Instruction **Op1User,
2192 Instruction **OrI, Instruction **OptAndI,
2193 unsigned &Shift, unsigned &Mask) {
2194 // If this instruction doesn't have one use, then return false.
2195 if (!OpUser->hasOneUse())
2196 return false;
2197
2198 Mask = 0xFFFFFFFF;
2199 if (ShiftInst *SI = dyn_cast<ShiftInst>(OpUser)) {
2200 if (ConstantInt *CI = dyn_cast<ConstantInt>(SI->getOperand(1))) {
2201 Shift = CI->getRawValue();
2202 if (SI->getOpcode() == Instruction::Shl)
2203 Mask <<= Shift;
2204 else if (!SI->getOperand(0)->getType()->isSigned()) {
2205 Mask >>= Shift;
2206 Shift = 32 - Shift;
2207 }
2208
2209 // Now check to see if the shift instruction is used by an or.
2210 Value *ShiftUse = *(OpUser->use_begin());
2211 Value *OptAndICopy = 0;
2212 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(ShiftUse)) {
2213 if (BO->getOpcode() == Instruction::And && BO->hasOneUse()) {
2214 if (ConstantInt *ACI = dyn_cast<ConstantInt>(BO->getOperand(1))) {
2215 if (OptAndI) *OptAndI = BO;
2216 OptAndICopy = BO;
2217 Mask &= ACI->getRawValue();
2218 BO = dyn_cast<BinaryOperator>(*(BO->use_begin()));
2219 }
2220 }
2221 if (BO && BO->getOpcode() == Instruction::Or) {
2222 if (OrI) *OrI = BO;
2223 if (Op1User) {
2224 if (BO->getOperand(0) == OpUser || BO->getOperand(0) == OptAndICopy)
2225 *Op1User = dyn_cast<Instruction>(BO->getOperand(1));
2226 else
2227 *Op1User = dyn_cast<Instruction>(BO->getOperand(0));
2228 }
2229 return true;
2230 }
2231 }
2232 }
2233 }
2234 return false;
2235}
2236
2237/// emitBitfieldInsert - turn a shift used only by an and with immediate into
2238/// the rotate left word immediate then mask insert (rlwimi) instruction.
2239/// Patterns matched:
2240/// 1. or shl, and 5. or (shl-and), and 9. or and, and
2241/// 2. or and, shl 6. or and, (shl-and)
2242/// 3. or shr, and 7. or (shr-and), and
2243/// 4. or and, shr 8. or and, (shr-and)
Nate Begeman9b508c32004-10-26 03:48:25 +00002244bool PPC32ISel::emitBitfieldInsert(User *OpUser, unsigned DestReg) {
Nate Begeman905a2912004-10-24 10:33:30 +00002245 // Instructions to skip if we match any of the patterns
2246 Instruction *Op0User, *Op1User = 0, *OptAndI = 0, *OrI = 0;
2247 unsigned TgtMask, InsMask, Amount = 0;
2248 bool matched = false;
2249
2250 // We require OpUser to be an instruction to continue
2251 Op0User = dyn_cast<Instruction>(OpUser);
2252 if (0 == Op0User)
2253 return false;
2254
2255 // Look for cases 2, 4, 6, 8, and 9
2256 if (isInsertAndHalf(Op0User, &Op1User, &OrI, TgtMask))
2257 if (Op1User)
2258 if (isInsertAndHalf(Op1User, 0, 0, InsMask))
2259 matched = true;
2260 else if (isInsertShiftHalf(Op1User, 0, 0, &OptAndI, Amount, InsMask))
2261 matched = true;
2262
2263 // Look for cases 1, 3, 5, and 7. Force the shift argument to be the one
2264 // inserted into the target, since rlwimi can only rotate the value inserted,
2265 // not the value being inserted into.
2266 if (matched == false)
2267 if (isInsertShiftHalf(Op0User, &Op1User, &OrI, &OptAndI, Amount, InsMask))
2268 if (Op1User && isInsertAndHalf(Op1User, 0, 0, TgtMask)) {
2269 std::swap(Op0User, Op1User);
2270 matched = true;
2271 }
2272
2273 // We didn't succeed in matching one of the patterns, so return false
2274 if (matched == false)
2275 return false;
2276
2277 // If the masks xor to -1, and the insert mask is a run of ones, then we have
2278 // succeeded in matching one of the cases for generating rlwimi. Update the
2279 // skip lists and users of the Instruction::Or.
2280 unsigned MB, ME;
2281 if (((TgtMask ^ InsMask) == 0xFFFFFFFF) && isRunOfOnes(InsMask, MB, ME)) {
2282 SkipList.push_back(Op0User);
2283 SkipList.push_back(Op1User);
2284 SkipList.push_back(OptAndI);
2285 InsertMap[OrI] = RlwimiRec(Op0User->getOperand(0), Op1User->getOperand(0),
2286 Amount, MB, ME);
2287 return true;
2288 }
2289 return false;
2290}
2291
2292/// emitBitfieldExtract - turn a shift used only by an and with immediate into the
2293/// rotate left word immediate then and with mask (rlwinm) instruction.
2294bool PPC32ISel::emitBitfieldExtract(MachineBasicBlock *MBB,
2295 MachineBasicBlock::iterator IP,
Nate Begeman9b508c32004-10-26 03:48:25 +00002296 User *OpUser, unsigned DestReg) {
Nate Begeman905a2912004-10-24 10:33:30 +00002297 return false;
Nate Begeman9b508c32004-10-26 03:48:25 +00002298 /*
2299 // Instructions to skip if we match any of the patterns
2300 Instruction *Op0User, *Op1User = 0;
2301 unsigned ShiftMask, AndMask, Amount = 0;
2302 bool matched = false;
Nate Begeman905a2912004-10-24 10:33:30 +00002303
Nate Begeman9b508c32004-10-26 03:48:25 +00002304 // We require OpUser to be an instruction to continue
2305 Op0User = dyn_cast<Instruction>(OpUser);
2306 if (0 == Op0User)
2307 return false;
2308
2309 if (isExtractShiftHalf)
2310 if (isExtractAndHalf)
2311 matched = true;
2312
2313 if (matched == false && isExtractAndHalf)
2314 if (isExtractShiftHalf)
2315 matched = true;
2316
2317 if (matched == false)
2318 return false;
2319
2320 if (isRunOfOnes(Imm, MB, ME)) {
2321 unsigned SrcReg = getReg(Op, MBB, IP);
2322 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(Rotate)
2323 .addImm(MB).addImm(ME);
2324 Op1User->replaceAllUsesWith(Op0User);
2325 SkipList.push_back(BO);
2326 return true;
Nate Begeman1b750222004-10-17 05:19:20 +00002327 }
Nate Begeman9b508c32004-10-26 03:48:25 +00002328 */
Nate Begeman1b750222004-10-17 05:19:20 +00002329}
2330
Nate Begemanb816f022004-10-07 22:30:03 +00002331/// emitBinaryConstOperation - Implement simple binary operators for integral
2332/// types with a constant operand. Opcode is one of: 0 for Add, 1 for Sub,
2333/// 2 for And, 3 for Or, 4 for Xor, and 5 for Subtract-From.
2334///
2335void PPC32ISel::emitBinaryConstOperation(MachineBasicBlock *MBB,
2336 MachineBasicBlock::iterator IP,
2337 unsigned Op0Reg, ConstantInt *Op1,
2338 unsigned Opcode, unsigned DestReg) {
2339 static const unsigned OpTab[] = {
2340 PPC::ADD, PPC::SUB, PPC::AND, PPC::OR, PPC::XOR, PPC::SUBF
2341 };
2342 static const unsigned ImmOpTab[2][6] = {
2343 { PPC::ADDI, PPC::ADDI, PPC::ANDIo, PPC::ORI, PPC::XORI, PPC::SUBFIC },
2344 { PPC::ADDIS, PPC::ADDIS, PPC::ANDISo, PPC::ORIS, PPC::XORIS, PPC::SUBFIC }
2345 };
2346
Chris Lattner02846282004-11-30 07:30:20 +00002347 // Handle subtract now by inverting the constant value: X-4 == X+(-4)
Nate Begemanb816f022004-10-07 22:30:03 +00002348 if (Opcode == 1) {
Chris Lattner02846282004-11-30 07:30:20 +00002349 Op1 = cast<ConstantInt>(ConstantExpr::getNeg(Op1));
2350 Opcode = 0;
Nate Begemanb816f022004-10-07 22:30:03 +00002351 }
2352
2353 // xor X, -1 -> not X
Chris Lattner02846282004-11-30 07:30:20 +00002354 if (Opcode == 4 && Op1->isAllOnesValue()) {
2355 BuildMI(*MBB, IP, PPC::NOR, 2, DestReg).addReg(Op0Reg).addReg(Op0Reg);
2356 return;
Nate Begemanb816f022004-10-07 22:30:03 +00002357 }
Nate Begemanbdf69842004-10-08 02:49:24 +00002358
Chris Lattner02846282004-11-30 07:30:20 +00002359 if (Opcode == 2 && !Op1->isNullValue()) {
2360 unsigned MB, ME, mask = Op1->getRawValue();
Nate Begemanbdf69842004-10-08 02:49:24 +00002361 if (isRunOfOnes(mask, MB, ME)) {
Nate Begemanbdf69842004-10-08 02:49:24 +00002362 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(Op0Reg).addImm(0)
2363 .addImm(MB).addImm(ME);
2364 return;
2365 }
2366 }
Nate Begemanb816f022004-10-07 22:30:03 +00002367
Nate Begemane0c83a82004-10-15 00:50:19 +00002368 // PowerPC 16 bit signed immediates are sign extended before use by the
2369 // instruction. Therefore, we can only split up an add of a reg with a 32 bit
2370 // immediate into addis and addi if the sign bit of the low 16 bits is cleared
2371 // so that for register A, const imm X, we don't end up with
2372 // A + XXXX0000 + FFFFXXXX.
2373 bool WontSignExtend = (0 == (Op1->getRawValue() & 0x8000));
2374
Nate Begemanb816f022004-10-07 22:30:03 +00002375 // For Add, Sub, and SubF the instruction takes a signed immediate. For And,
2376 // Or, and Xor, the instruction takes an unsigned immediate. There is no
2377 // shifted immediate form of SubF so disallow its opcode for those constants.
Chris Lattner02846282004-11-30 07:30:20 +00002378 if (canUseAsImmediateForOpcode(Op1, Opcode, false)) {
Nate Begemanb816f022004-10-07 22:30:03 +00002379 if (Opcode < 2 || Opcode == 5)
2380 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(Op0Reg)
2381 .addSImm(Op1->getRawValue());
2382 else
2383 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(Op0Reg)
2384 .addZImm(Op1->getRawValue());
Chris Lattner02846282004-11-30 07:30:20 +00002385 } else if (canUseAsImmediateForOpcode(Op1, Opcode, true) && (Opcode < 5)) {
Nate Begemanb816f022004-10-07 22:30:03 +00002386 if (Opcode < 2)
2387 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, DestReg).addReg(Op0Reg)
2388 .addSImm(Op1->getRawValue() >> 16);
2389 else
2390 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, DestReg).addReg(Op0Reg)
2391 .addZImm(Op1->getRawValue() >> 16);
Nate Begemane0c83a82004-10-15 00:50:19 +00002392 } else if ((Opcode < 2 && WontSignExtend) || Opcode == 3 || Opcode == 4) {
2393 unsigned TmpReg = makeAnotherReg(Op1->getType());
Nate Begemane0c83a82004-10-15 00:50:19 +00002394 if (Opcode < 2) {
2395 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, TmpReg).addReg(Op0Reg)
2396 .addSImm(Op1->getRawValue() >> 16);
2397 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(TmpReg)
2398 .addSImm(Op1->getRawValue());
2399 } else {
2400 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, TmpReg).addReg(Op0Reg)
2401 .addZImm(Op1->getRawValue() >> 16);
2402 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(TmpReg)
2403 .addZImm(Op1->getRawValue());
2404 }
Nate Begemanb816f022004-10-07 22:30:03 +00002405 } else {
2406 unsigned Op1Reg = getReg(Op1, MBB, IP);
2407 BuildMI(*MBB, IP, OpTab[Opcode], 2, DestReg).addReg(Op0Reg).addReg(Op1Reg);
2408 }
2409}
2410
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002411/// emitSimpleBinaryOperation - Implement simple binary operators for integral
2412/// types... OperatorClass is one of: 0 for Add, 1 for Sub, 2 for And, 3 for
2413/// Or, 4 for Xor.
2414///
Misha Brukmana1dca552004-09-21 18:22:19 +00002415void PPC32ISel::emitSimpleBinaryOperation(MachineBasicBlock *MBB,
2416 MachineBasicBlock::iterator IP,
Nate Begeman1b750222004-10-17 05:19:20 +00002417 BinaryOperator *BO,
Misha Brukmana1dca552004-09-21 18:22:19 +00002418 Value *Op0, Value *Op1,
2419 unsigned OperatorClass,
2420 unsigned DestReg) {
Misha Brukman422791f2004-06-21 17:41:12 +00002421 // Arithmetic and Bitwise operators
Misha Brukman911afde2004-06-25 14:50:41 +00002422 static const unsigned OpcodeTab[] = {
Nate Begemanf70b5762005-03-28 23:08:54 +00002423 PPC::ADD, PPC::SUBF, PPC::AND, PPC::OR, PPC::XOR
Misha Brukman422791f2004-06-21 17:41:12 +00002424 };
Nate Begemanb816f022004-10-07 22:30:03 +00002425 static const unsigned LongOpTab[2][5] = {
Nate Begemanca12a2b2005-03-28 22:28:37 +00002426 { PPC::ADDC, PPC::SUBFC, PPC::AND, PPC::OR, PPC::XOR },
Nate Begemanb816f022004-10-07 22:30:03 +00002427 { PPC::ADDE, PPC::SUBFE, PPC::AND, PPC::OR, PPC::XOR }
Misha Brukman422791f2004-06-21 17:41:12 +00002428 };
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002429
Nate Begemanb816f022004-10-07 22:30:03 +00002430 unsigned Class = getClassB(Op0->getType());
2431
Misha Brukman7e898c32004-07-20 00:41:46 +00002432 if (Class == cFP32 || Class == cFP64) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002433 assert(OperatorClass < 2 && "No logical ops for FP!");
2434 emitBinaryFPOperation(MBB, IP, Op0, Op1, OperatorClass, DestReg);
2435 return;
2436 }
2437
2438 if (Op0->getType() == Type::BoolTy) {
2439 if (OperatorClass == 3)
2440 // If this is an or of two isnan's, emit an FP comparison directly instead
2441 // of or'ing two isnan's together.
2442 if (Value *LHS = dyncastIsNan(Op0))
2443 if (Value *RHS = dyncastIsNan(Op1)) {
2444 unsigned Op0Reg = getReg(RHS, MBB, IP), Op1Reg = getReg(LHS, MBB, IP);
Misha Brukman422791f2004-06-21 17:41:12 +00002445 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002446 emitUCOM(MBB, IP, Op0Reg, Op1Reg);
Misha Brukman5b570812004-08-10 22:47:03 +00002447 BuildMI(*MBB, IP, PPC::MFCR, TmpReg);
2448 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(TmpReg).addImm(4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002449 .addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002450 return;
2451 }
2452 }
2453
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002454 // Special case: op <const int>, Reg
Nate Begemanb816f022004-10-07 22:30:03 +00002455 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op0))
Misha Brukman1013ef52004-07-21 20:09:08 +00002456 if (Class != cLong) {
Nate Begemanb816f022004-10-07 22:30:03 +00002457 unsigned Opcode = (OperatorClass == 1) ? 5 : OperatorClass;
2458 unsigned Op1r = getReg(Op1, MBB, IP);
2459 emitBinaryConstOperation(MBB, IP, Op1r, CI, Opcode, DestReg);
2460 return;
2461 }
2462 // Special case: op Reg, <const int>
2463 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1))
2464 if (Class != cLong) {
Nate Begeman9b508c32004-10-26 03:48:25 +00002465 if (emitBitfieldInsert(BO, DestReg))
Nate Begeman1b750222004-10-17 05:19:20 +00002466 return;
Nate Begeman905a2912004-10-24 10:33:30 +00002467
Nate Begemanb816f022004-10-07 22:30:03 +00002468 unsigned Op0r = getReg(Op0, MBB, IP);
2469 emitBinaryConstOperation(MBB, IP, Op0r, CI, OperatorClass, DestReg);
Misha Brukman1013ef52004-07-21 20:09:08 +00002470 return;
2471 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002472
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002473 // We couldn't generate an immediate variant of the op, load both halves into
2474 // registers and emit the appropriate opcode.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002475 unsigned Op0r = getReg(Op0, MBB, IP);
2476 unsigned Op1r = getReg(Op1, MBB, IP);
2477
Nate Begemanf70b5762005-03-28 23:08:54 +00002478 // Subtracts have their operands swapped
2479 if (OperatorClass == 1) {
2480 if (Class != cLong) {
2481 BuildMI(*MBB, IP, PPC::SUBF, 2, DestReg).addReg(Op1r).addReg(Op0r);
2482 } else {
2483 BuildMI(*MBB, IP, PPC::SUBFC, 2, DestReg+1).addReg(Op1r+1).addReg(Op0r+1);
2484 BuildMI(*MBB, IP, PPC::SUBFE, 2, DestReg).addReg(Op1r).addReg(Op0r);
2485 }
2486 return;
2487 }
2488
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002489 if (Class != cLong) {
Misha Brukman422791f2004-06-21 17:41:12 +00002490 unsigned Opcode = OpcodeTab[OperatorClass];
2491 BuildMI(*MBB, IP, Opcode, 2, DestReg).addReg(Op0r).addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002492 } else {
Nate Begemanb816f022004-10-07 22:30:03 +00002493 BuildMI(*MBB, IP, LongOpTab[0][OperatorClass], 2, DestReg+1).addReg(Op0r+1)
Misha Brukman7e898c32004-07-20 00:41:46 +00002494 .addReg(Op1r+1);
Nate Begemanb816f022004-10-07 22:30:03 +00002495 BuildMI(*MBB, IP, LongOpTab[1][OperatorClass], 2, DestReg).addReg(Op0r)
Misha Brukman1013ef52004-07-21 20:09:08 +00002496 .addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002497 }
2498 return;
2499}
2500
Misha Brukman1013ef52004-07-21 20:09:08 +00002501/// doMultiply - Emit appropriate instructions to multiply together the
2502/// Values Op0 and Op1, and put the result in DestReg.
Misha Brukman2fec9902004-06-21 20:22:03 +00002503///
Misha Brukmana1dca552004-09-21 18:22:19 +00002504void PPC32ISel::doMultiply(MachineBasicBlock *MBB,
2505 MachineBasicBlock::iterator IP,
2506 unsigned DestReg, Value *Op0, Value *Op1) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002507 unsigned Class0 = getClass(Op0->getType());
2508 unsigned Class1 = getClass(Op1->getType());
2509
2510 unsigned Op0r = getReg(Op0, MBB, IP);
2511 unsigned Op1r = getReg(Op1, MBB, IP);
2512
2513 // 64 x 64 -> 64
2514 if (Class0 == cLong && Class1 == cLong) {
2515 unsigned Tmp1 = makeAnotherReg(Type::IntTy);
2516 unsigned Tmp2 = makeAnotherReg(Type::IntTy);
2517 unsigned Tmp3 = makeAnotherReg(Type::IntTy);
2518 unsigned Tmp4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00002519 BuildMI(*MBB, IP, PPC::MULHWU, 2, Tmp1).addReg(Op0r+1).addReg(Op1r+1);
2520 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg+1).addReg(Op0r+1).addReg(Op1r+1);
2521 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp2).addReg(Op0r+1).addReg(Op1r);
2522 BuildMI(*MBB, IP, PPC::ADD, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
2523 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp4).addReg(Op0r).addReg(Op1r+1);
2524 BuildMI(*MBB, IP, PPC::ADD, 2, DestReg).addReg(Tmp3).addReg(Tmp4);
Misha Brukman1013ef52004-07-21 20:09:08 +00002525 return;
2526 }
2527
2528 // 64 x 32 or less, promote 32 to 64 and do a 64 x 64
2529 if (Class0 == cLong && Class1 <= cInt) {
2530 unsigned Tmp0 = makeAnotherReg(Type::IntTy);
2531 unsigned Tmp1 = makeAnotherReg(Type::IntTy);
2532 unsigned Tmp2 = makeAnotherReg(Type::IntTy);
2533 unsigned Tmp3 = makeAnotherReg(Type::IntTy);
2534 unsigned Tmp4 = makeAnotherReg(Type::IntTy);
2535 if (Op1->getType()->isSigned())
Misha Brukman5b570812004-08-10 22:47:03 +00002536 BuildMI(*MBB, IP, PPC::SRAWI, 2, Tmp0).addReg(Op1r).addImm(31);
Misha Brukman1013ef52004-07-21 20:09:08 +00002537 else
Misha Brukman5b570812004-08-10 22:47:03 +00002538 BuildMI(*MBB, IP, PPC::LI, 2, Tmp0).addSImm(0);
2539 BuildMI(*MBB, IP, PPC::MULHWU, 2, Tmp1).addReg(Op0r+1).addReg(Op1r);
2540 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg+1).addReg(Op0r+1).addReg(Op1r);
2541 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp2).addReg(Op0r+1).addReg(Tmp0);
2542 BuildMI(*MBB, IP, PPC::ADD, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
2543 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp4).addReg(Op0r).addReg(Op1r);
2544 BuildMI(*MBB, IP, PPC::ADD, 2, DestReg).addReg(Tmp3).addReg(Tmp4);
Misha Brukman1013ef52004-07-21 20:09:08 +00002545 return;
2546 }
2547
2548 // 32 x 32 -> 32
2549 if (Class0 <= cInt && Class1 <= cInt) {
Misha Brukman5b570812004-08-10 22:47:03 +00002550 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg).addReg(Op0r).addReg(Op1r);
Misha Brukman1013ef52004-07-21 20:09:08 +00002551 return;
2552 }
2553
2554 assert(0 && "doMultiply cannot operate on unknown type!");
2555}
2556
2557/// doMultiplyConst - This method will multiply the value in Op0 by the
2558/// value of the ContantInt *CI
Misha Brukmana1dca552004-09-21 18:22:19 +00002559void PPC32ISel::doMultiplyConst(MachineBasicBlock *MBB,
2560 MachineBasicBlock::iterator IP,
2561 unsigned DestReg, Value *Op0, ConstantInt *CI) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002562 unsigned Class = getClass(Op0->getType());
2563
2564 // Mul op0, 0 ==> 0
2565 if (CI->isNullValue()) {
Misha Brukman5b570812004-08-10 22:47:03 +00002566 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00002567 if (Class == cLong)
Misha Brukman5b570812004-08-10 22:47:03 +00002568 BuildMI(*MBB, IP, PPC::LI, 1, DestReg+1).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002569 return;
Misha Brukman1013ef52004-07-21 20:09:08 +00002570 }
2571
2572 // Mul op0, 1 ==> op0
2573 if (CI->equalsInt(1)) {
2574 unsigned Op0r = getReg(Op0, MBB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00002575 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(Op0r).addReg(Op0r);
Misha Brukman1013ef52004-07-21 20:09:08 +00002576 if (Class == cLong)
Misha Brukman5b570812004-08-10 22:47:03 +00002577 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(Op0r+1).addReg(Op0r+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002578 return;
2579 }
2580
2581 // If the element size is exactly a power of 2, use a shift to get it.
Misha Brukman1013ef52004-07-21 20:09:08 +00002582 if (unsigned Shift = ExactLog2(CI->getRawValue())) {
2583 ConstantUInt *ShiftCI = ConstantUInt::get(Type::UByteTy, Shift);
Nate Begeman9b508c32004-10-26 03:48:25 +00002584 emitShiftOperation(MBB, IP, Op0, ShiftCI, true, Op0->getType(), 0, DestReg);
Misha Brukman1013ef52004-07-21 20:09:08 +00002585 return;
2586 }
2587
2588 // If 32 bits or less and immediate is in right range, emit mul by immediate
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002589 if (Class == cByte || Class == cShort || Class == cInt) {
Nate Begemanb816f022004-10-07 22:30:03 +00002590 if (canUseAsImmediateForOpcode(CI, 0, false)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002591 unsigned Op0r = getReg(Op0, MBB, IP);
2592 unsigned imm = CI->getRawValue() & 0xFFFF;
Misha Brukman5b570812004-08-10 22:47:03 +00002593 BuildMI(*MBB, IP, PPC::MULLI, 2, DestReg).addReg(Op0r).addSImm(imm);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002594 return;
2595 }
2596 }
2597
Misha Brukman1013ef52004-07-21 20:09:08 +00002598 doMultiply(MBB, IP, DestReg, Op0, CI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002599}
2600
Misha Brukmana1dca552004-09-21 18:22:19 +00002601void PPC32ISel::visitMul(BinaryOperator &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002602 unsigned ResultReg = getReg(I);
2603
2604 Value *Op0 = I.getOperand(0);
2605 Value *Op1 = I.getOperand(1);
2606
2607 MachineBasicBlock::iterator IP = BB->end();
2608 emitMultiply(BB, IP, Op0, Op1, ResultReg);
2609}
2610
Misha Brukmana1dca552004-09-21 18:22:19 +00002611void PPC32ISel::emitMultiply(MachineBasicBlock *MBB,
2612 MachineBasicBlock::iterator IP,
2613 Value *Op0, Value *Op1, unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002614 TypeClass Class = getClass(Op0->getType());
2615
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002616 switch (Class) {
2617 case cByte:
2618 case cShort:
2619 case cInt:
Misha Brukman1013ef52004-07-21 20:09:08 +00002620 case cLong:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002621 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002622 doMultiplyConst(MBB, IP, DestReg, Op0, CI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002623 } else {
Misha Brukman1013ef52004-07-21 20:09:08 +00002624 doMultiply(MBB, IP, DestReg, Op0, Op1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002625 }
2626 return;
Misha Brukman7e898c32004-07-20 00:41:46 +00002627 case cFP32:
2628 case cFP64:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002629 emitBinaryFPOperation(MBB, IP, Op0, Op1, 2, DestReg);
2630 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002631 break;
2632 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002633}
2634
2635
2636/// visitDivRem - Handle division and remainder instructions... these
2637/// instruction both require the same instructions to be generated, they just
2638/// select the result from a different register. Note that both of these
2639/// instructions work differently for signed and unsigned operands.
2640///
Misha Brukmana1dca552004-09-21 18:22:19 +00002641void PPC32ISel::visitDivRem(BinaryOperator &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002642 unsigned ResultReg = getReg(I);
2643 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2644
2645 MachineBasicBlock::iterator IP = BB->end();
Misha Brukman2fec9902004-06-21 20:22:03 +00002646 emitDivRemOperation(BB, IP, Op0, Op1, I.getOpcode() == Instruction::Div,
2647 ResultReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002648}
2649
Nate Begeman087d5d92004-10-06 09:53:04 +00002650void PPC32ISel::emitDivRemOperation(MachineBasicBlock *MBB,
Misha Brukmana1dca552004-09-21 18:22:19 +00002651 MachineBasicBlock::iterator IP,
2652 Value *Op0, Value *Op1, bool isDiv,
2653 unsigned ResultReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002654 const Type *Ty = Op0->getType();
2655 unsigned Class = getClass(Ty);
2656 switch (Class) {
Misha Brukman7e898c32004-07-20 00:41:46 +00002657 case cFP32:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002658 if (isDiv) {
Misha Brukman7e898c32004-07-20 00:41:46 +00002659 // Floating point divide...
Nate Begeman087d5d92004-10-06 09:53:04 +00002660 emitBinaryFPOperation(MBB, IP, Op0, Op1, 3, ResultReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002661 return;
Misha Brukman7e898c32004-07-20 00:41:46 +00002662 } else {
2663 // Floating point remainder via fmodf(float x, float y);
Nate Begeman087d5d92004-10-06 09:53:04 +00002664 unsigned Op0Reg = getReg(Op0, MBB, IP);
2665 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman7e898c32004-07-20 00:41:46 +00002666 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002667 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(fmodfFn, true);
Misha Brukman7e898c32004-07-20 00:41:46 +00002668 std::vector<ValueRecord> Args;
2669 Args.push_back(ValueRecord(Op0Reg, Type::FloatTy));
2670 Args.push_back(ValueRecord(Op1Reg, Type::FloatTy));
2671 doCall(ValueRecord(ResultReg, Type::FloatTy), TheCall, Args, false);
2672 }
2673 return;
2674 case cFP64:
2675 if (isDiv) {
2676 // Floating point divide...
Nate Begeman087d5d92004-10-06 09:53:04 +00002677 emitBinaryFPOperation(MBB, IP, Op0, Op1, 3, ResultReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00002678 return;
2679 } else {
2680 // Floating point remainder via fmod(double x, double y);
Nate Begeman087d5d92004-10-06 09:53:04 +00002681 unsigned Op0Reg = getReg(Op0, MBB, IP);
2682 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002683 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002684 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(fmodFn, true);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002685 std::vector<ValueRecord> Args;
2686 Args.push_back(ValueRecord(Op0Reg, Type::DoubleTy));
2687 Args.push_back(ValueRecord(Op1Reg, Type::DoubleTy));
Misha Brukmand18a31d2004-07-06 22:51:53 +00002688 doCall(ValueRecord(ResultReg, Type::DoubleTy), TheCall, Args, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002689 }
2690 return;
2691 case cLong: {
Misha Brukman7e898c32004-07-20 00:41:46 +00002692 static Function* const Funcs[] =
Misha Brukman0aa97c62004-07-08 18:27:59 +00002693 { __moddi3Fn, __divdi3Fn, __umoddi3Fn, __udivdi3Fn };
Nate Begeman087d5d92004-10-06 09:53:04 +00002694 unsigned Op0Reg = getReg(Op0, MBB, IP);
2695 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002696 unsigned NameIdx = Ty->isUnsigned()*2 + isDiv;
2697 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002698 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(Funcs[NameIdx], true);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002699
2700 std::vector<ValueRecord> Args;
2701 Args.push_back(ValueRecord(Op0Reg, Type::LongTy));
2702 Args.push_back(ValueRecord(Op1Reg, Type::LongTy));
Misha Brukmand18a31d2004-07-06 22:51:53 +00002703 doCall(ValueRecord(ResultReg, Type::LongTy), TheCall, Args, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002704 return;
2705 }
2706 case cByte: case cShort: case cInt:
2707 break; // Small integrals, handled below...
2708 default: assert(0 && "Unknown class!");
2709 }
2710
2711 // Special case signed division by power of 2.
2712 if (isDiv)
2713 if (ConstantSInt *CI = dyn_cast<ConstantSInt>(Op1)) {
2714 assert(Class != cLong && "This doesn't handle 64-bit divides!");
2715 int V = CI->getValue();
2716
2717 if (V == 1) { // X /s 1 => X
Nate Begeman087d5d92004-10-06 09:53:04 +00002718 unsigned Op0Reg = getReg(Op0, MBB, IP);
2719 BuildMI(*MBB, IP, PPC::OR, 2, ResultReg).addReg(Op0Reg).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002720 return;
2721 }
2722
2723 if (V == -1) { // X /s -1 => -X
Nate Begeman087d5d92004-10-06 09:53:04 +00002724 unsigned Op0Reg = getReg(Op0, MBB, IP);
2725 BuildMI(*MBB, IP, PPC::NEG, 1, ResultReg).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002726 return;
2727 }
2728
Misha Brukmanec6319a2004-07-20 15:51:37 +00002729 unsigned log2V = ExactLog2(V);
2730 if (log2V != 0 && Ty->isSigned()) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002731 unsigned Op0Reg = getReg(Op0, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002732 unsigned TmpReg = makeAnotherReg(Op0->getType());
Misha Brukmanec6319a2004-07-20 15:51:37 +00002733
Nate Begeman087d5d92004-10-06 09:53:04 +00002734 BuildMI(*MBB, IP, PPC::SRAWI, 2, TmpReg).addReg(Op0Reg).addImm(log2V);
2735 BuildMI(*MBB, IP, PPC::ADDZE, 1, ResultReg).addReg(TmpReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002736 return;
2737 }
2738 }
2739
Nate Begeman087d5d92004-10-06 09:53:04 +00002740 unsigned Op0Reg = getReg(Op0, MBB, IP);
2741
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002742 if (isDiv) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002743 unsigned Op1Reg = getReg(Op1, MBB, IP);
2744 unsigned Opcode = Ty->isSigned() ? PPC::DIVW : PPC::DIVWU;
2745 BuildMI(*MBB, IP, Opcode, 2, ResultReg).addReg(Op0Reg).addReg(Op1Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002746 } else { // Remainder
Nate Begeman087d5d92004-10-06 09:53:04 +00002747 // FIXME: don't load the CI part of a CI divide twice
2748 ConstantInt *CI = dyn_cast<ConstantInt>(Op1);
Misha Brukman422791f2004-06-21 17:41:12 +00002749 unsigned TmpReg1 = makeAnotherReg(Op0->getType());
2750 unsigned TmpReg2 = makeAnotherReg(Op0->getType());
Nate Begeman087d5d92004-10-06 09:53:04 +00002751 emitDivRemOperation(MBB, IP, Op0, Op1, true, TmpReg1);
Nate Begemanb816f022004-10-07 22:30:03 +00002752 if (CI && canUseAsImmediateForOpcode(CI, 0, false)) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002753 BuildMI(*MBB, IP, PPC::MULLI, 2, TmpReg2).addReg(TmpReg1)
2754 .addSImm(CI->getRawValue());
2755 } else {
2756 unsigned Op1Reg = getReg(Op1, MBB, IP);
2757 BuildMI(*MBB, IP, PPC::MULLW, 2, TmpReg2).addReg(TmpReg1).addReg(Op1Reg);
2758 }
2759 BuildMI(*MBB, IP, PPC::SUBF, 2, ResultReg).addReg(TmpReg2).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002760 }
2761}
2762
2763
2764/// Shift instructions: 'shl', 'sar', 'shr' - Some special cases here
2765/// for constant immediate shift values, and for constant immediate
2766/// shift values equal to 1. Even the general case is sort of special,
2767/// because the shift amount has to be in CL, not just any old register.
2768///
Misha Brukmana1dca552004-09-21 18:22:19 +00002769void PPC32ISel::visitShiftInst(ShiftInst &I) {
Nate Begeman905a2912004-10-24 10:33:30 +00002770 if (std::find(SkipList.begin(), SkipList.end(), &I) != SkipList.end())
2771 return;
2772
Misha Brukmane2eceb52004-07-23 16:08:20 +00002773 MachineBasicBlock::iterator IP = BB->end();
2774 emitShiftOperation(BB, IP, I.getOperand(0), I.getOperand(1),
2775 I.getOpcode() == Instruction::Shl, I.getType(),
Nate Begeman9b508c32004-10-26 03:48:25 +00002776 &I, getReg(I));
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002777}
2778
2779/// emitShiftOperation - Common code shared between visitShiftInst and
2780/// constant expression support.
Misha Brukman2fec9902004-06-21 20:22:03 +00002781///
Misha Brukmana1dca552004-09-21 18:22:19 +00002782void PPC32ISel::emitShiftOperation(MachineBasicBlock *MBB,
2783 MachineBasicBlock::iterator IP,
2784 Value *Op, Value *ShiftAmount,
Nate Begeman9b508c32004-10-26 03:48:25 +00002785 bool isLeftShift, const Type *ResultTy,
2786 ShiftInst *SI, unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002787 bool isSigned = ResultTy->isSigned ();
2788 unsigned Class = getClass (ResultTy);
2789
2790 // Longs, as usual, are handled specially...
2791 if (Class == cLong) {
Nate Begeman1b750222004-10-17 05:19:20 +00002792 unsigned SrcReg = getReg (Op, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002793 // If we have a constant shift, we can generate much more efficient code
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002794 // than for a variable shift by using the rlwimi instruction.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002795 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(ShiftAmount)) {
2796 unsigned Amount = CUI->getValue();
Chris Lattner77470402004-11-30 06:29:10 +00002797 if (Amount == 0) {
2798 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
2799 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1)
2800 .addReg(SrcReg+1).addReg(SrcReg+1);
2801
2802 } else if (Amount < 32) {
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002803 unsigned TempReg = makeAnotherReg(ResultTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002804 if (isLeftShift) {
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002805 BuildMI(*MBB, IP, PPC::RLWINM, 4, TempReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002806 .addImm(Amount).addImm(0).addImm(31-Amount);
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002807 BuildMI(*MBB, IP, PPC::RLWIMI, 5, DestReg).addReg(TempReg)
2808 .addReg(SrcReg+1).addImm(Amount).addImm(32-Amount).addImm(31);
Misha Brukman5b570812004-08-10 22:47:03 +00002809 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg+1).addReg(SrcReg+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00002810 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002811 } else {
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002812 BuildMI(*MBB, IP, PPC::RLWINM, 4, TempReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002813 .addImm(32-Amount).addImm(Amount).addImm(31);
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002814 BuildMI(*MBB, IP, PPC::RLWIMI, 5, DestReg+1).addReg(TempReg)
2815 .addReg(SrcReg).addImm(32-Amount).addImm(0).addImm(Amount-1);
Nate Begeman020ef422005-04-06 22:42:08 +00002816 if (isSigned) {
2817 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg)
2818 .addImm(Amount);
2819 } else {
2820 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
2821 .addImm(32-Amount).addImm(Amount).addImm(31);
2822 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002823 }
2824 } else { // Shifting more than 32 bits
2825 Amount -= 32;
2826 if (isLeftShift) {
2827 if (Amount != 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00002828 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002829 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002830 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002831 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002832 .addReg(SrcReg+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002833 }
Misha Brukman5b570812004-08-10 22:47:03 +00002834 BuildMI(*MBB, IP, PPC::LI, 1, DestReg+1).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00002835 } else {
2836 if (Amount != 0) {
2837 if (isSigned)
Misha Brukman5b570812004-08-10 22:47:03 +00002838 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002839 .addImm(Amount);
2840 else
Misha Brukman5b570812004-08-10 22:47:03 +00002841 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002842 .addImm(32-Amount).addImm(Amount).addImm(31);
2843 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002844 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002845 .addReg(SrcReg);
2846 }
Nate Begeman020ef422005-04-06 22:42:08 +00002847 if (isSigned)
2848 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg)
2849 .addImm(31);
2850 else
2851 BuildMI(*MBB, IP,PPC::LI, 1, DestReg).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002852 }
2853 }
2854 } else {
2855 unsigned TmpReg1 = makeAnotherReg(Type::IntTy);
2856 unsigned TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman422791f2004-06-21 17:41:12 +00002857 unsigned TmpReg3 = makeAnotherReg(Type::IntTy);
2858 unsigned TmpReg4 = makeAnotherReg(Type::IntTy);
2859 unsigned TmpReg5 = makeAnotherReg(Type::IntTy);
2860 unsigned TmpReg6 = makeAnotherReg(Type::IntTy);
2861 unsigned ShiftAmountReg = getReg (ShiftAmount, MBB, IP);
2862
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002863 if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002864 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002865 .addSImm(32);
Misha Brukman5b570812004-08-10 22:47:03 +00002866 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg2).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002867 .addReg(ShiftAmountReg);
Misha Brukman5b570812004-08-10 22:47:03 +00002868 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg3).addReg(SrcReg+1)
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002869 .addReg(TmpReg1);
Misha Brukman5b570812004-08-10 22:47:03 +00002870 BuildMI(*MBB, IP, PPC::OR, 2,TmpReg4).addReg(TmpReg2).addReg(TmpReg3);
2871 BuildMI(*MBB, IP, PPC::ADDI, 2, TmpReg5).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002872 .addSImm(-32);
Misha Brukman5b570812004-08-10 22:47:03 +00002873 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg6).addReg(SrcReg+1)
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002874 .addReg(TmpReg5);
Misha Brukman5b570812004-08-10 22:47:03 +00002875 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(TmpReg4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002876 .addReg(TmpReg6);
Misha Brukman5b570812004-08-10 22:47:03 +00002877 BuildMI(*MBB, IP, PPC::SLW, 2, DestReg+1).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002878 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002879 } else {
Nate Begemanf2f07812004-08-29 08:19:32 +00002880 if (isSigned) { // shift right algebraic
2881 MachineBasicBlock *TmpMBB =new MachineBasicBlock(BB->getBasicBlock());
2882 MachineBasicBlock *PhiMBB =new MachineBasicBlock(BB->getBasicBlock());
2883 MachineBasicBlock *OldMBB = BB;
2884 ilist<MachineBasicBlock>::iterator It = BB; ++It;
2885 F->getBasicBlockList().insert(It, TmpMBB);
2886 F->getBasicBlockList().insert(It, PhiMBB);
2887 BB->addSuccessor(TmpMBB);
2888 BB->addSuccessor(PhiMBB);
2889
2890 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
2891 .addSImm(32);
2892 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg2).addReg(SrcReg+1)
2893 .addReg(ShiftAmountReg);
2894 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg3).addReg(SrcReg)
2895 .addReg(TmpReg1);
2896 BuildMI(*MBB, IP, PPC::OR, 2, TmpReg4).addReg(TmpReg2)
2897 .addReg(TmpReg3);
2898 BuildMI(*MBB, IP, PPC::ADDICo, 2, TmpReg5).addReg(ShiftAmountReg)
2899 .addSImm(-32);
2900 BuildMI(*MBB, IP, PPC::SRAW, 2, TmpReg6).addReg(SrcReg)
2901 .addReg(TmpReg5);
2902 BuildMI(*MBB, IP, PPC::SRAW, 2, DestReg).addReg(SrcReg)
2903 .addReg(ShiftAmountReg);
2904 BuildMI(*MBB, IP, PPC::BLE, 2).addReg(PPC::CR0).addMBB(PhiMBB);
2905
2906 // OrMBB:
2907 // Select correct least significant half if the shift amount > 32
2908 BB = TmpMBB;
2909 unsigned OrReg = makeAnotherReg(Type::IntTy);
Chris Lattner35f2bbe2004-11-30 06:40:04 +00002910 BuildMI(BB, PPC::OR, 2, OrReg).addReg(TmpReg6).addReg(TmpReg6);
Nate Begemanf2f07812004-08-29 08:19:32 +00002911 TmpMBB->addSuccessor(PhiMBB);
2912
2913 BB = PhiMBB;
2914 BuildMI(BB, PPC::PHI, 4, DestReg+1).addReg(TmpReg4).addMBB(OldMBB)
2915 .addReg(OrReg).addMBB(TmpMBB);
2916 } else { // shift right logical
Misha Brukman5b570812004-08-10 22:47:03 +00002917 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002918 .addSImm(32);
Misha Brukman5b570812004-08-10 22:47:03 +00002919 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg2).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002920 .addReg(ShiftAmountReg);
Misha Brukman5b570812004-08-10 22:47:03 +00002921 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg3).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002922 .addReg(TmpReg1);
Misha Brukman5b570812004-08-10 22:47:03 +00002923 BuildMI(*MBB, IP, PPC::OR, 2, TmpReg4).addReg(TmpReg2)
Misha Brukman2fec9902004-06-21 20:22:03 +00002924 .addReg(TmpReg3);
Misha Brukman5b570812004-08-10 22:47:03 +00002925 BuildMI(*MBB, IP, PPC::ADDI, 2, TmpReg5).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002926 .addSImm(-32);
Misha Brukman5b570812004-08-10 22:47:03 +00002927 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg6).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002928 .addReg(TmpReg5);
Misha Brukman5b570812004-08-10 22:47:03 +00002929 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(TmpReg4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002930 .addReg(TmpReg6);
Misha Brukman5b570812004-08-10 22:47:03 +00002931 BuildMI(*MBB, IP, PPC::SRW, 2, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002932 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002933 }
2934 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002935 }
2936 return;
2937 }
2938
2939 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(ShiftAmount)) {
2940 // The shift amount is constant, guaranteed to be a ubyte. Get its value.
2941 assert(CUI->getType() == Type::UByteTy && "Shift amount not a ubyte?");
2942 unsigned Amount = CUI->getValue();
Nate Begeman1b750222004-10-17 05:19:20 +00002943
Nate Begeman905a2912004-10-24 10:33:30 +00002944 // If this is a shift with one use, and that use is an And instruction,
2945 // then attempt to emit a bitfield operation.
Nate Begeman9b508c32004-10-26 03:48:25 +00002946 if (SI && emitBitfieldInsert(SI, DestReg))
2947 return;
Nate Begeman1b750222004-10-17 05:19:20 +00002948
2949 unsigned SrcReg = getReg (Op, MBB, IP);
Chris Lattnere74ed0d2004-11-30 06:36:11 +00002950 if (Amount == 0) {
2951 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
2952 } else if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002953 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002954 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman422791f2004-06-21 17:41:12 +00002955 } else {
Misha Brukman2fec9902004-06-21 20:22:03 +00002956 if (isSigned) {
Misha Brukman5b570812004-08-10 22:47:03 +00002957 BuildMI(*MBB, IP, PPC::SRAWI,2,DestReg).addReg(SrcReg).addImm(Amount);
Misha Brukman2fec9902004-06-21 20:22:03 +00002958 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002959 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002960 .addImm(32-Amount).addImm(Amount).addImm(31);
2961 }
Misha Brukman422791f2004-06-21 17:41:12 +00002962 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002963 } else { // The shift amount is non-constant.
Nate Begeman1b750222004-10-17 05:19:20 +00002964 unsigned SrcReg = getReg (Op, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002965 unsigned ShiftAmountReg = getReg (ShiftAmount, MBB, IP);
2966
Misha Brukman422791f2004-06-21 17:41:12 +00002967 if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002968 BuildMI(*MBB, IP, PPC::SLW, 2, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002969 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002970 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002971 BuildMI(*MBB, IP, isSigned ? PPC::SRAW : PPC::SRW, 2, DestReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002972 .addReg(SrcReg).addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002973 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002974 }
2975}
2976
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002977/// LoadNeedsSignExtend - On PowerPC, there is no load byte with sign extend.
2978/// Therefore, if this is a byte load and the destination type is signed, we
Nate Begeman35b020d2004-10-06 11:03:30 +00002979/// would normally need to also emit a sign extend instruction after the load.
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002980/// However, store instructions don't care whether a signed type was sign
2981/// extended across a whole register. Also, a SetCC instruction will emit its
2982/// own sign extension to force the value into the appropriate range, so we
2983/// need not emit it here. Ideally, this kind of thing wouldn't be necessary
2984/// once LLVM's type system is improved.
2985static bool LoadNeedsSignExtend(LoadInst &LI) {
2986 if (cByte == getClassB(LI.getType()) && LI.getType()->isSigned()) {
2987 bool AllUsesAreStoresOrSetCC = true;
Nate Begeman35b020d2004-10-06 11:03:30 +00002988 for (Value::use_iterator I = LI.use_begin(), E = LI.use_end(); I != E; ++I){
Chris Lattner7c348e12004-10-06 16:28:24 +00002989 if (isa<SetCondInst>(*I))
Nate Begeman35b020d2004-10-06 11:03:30 +00002990 continue;
Chris Lattner7c348e12004-10-06 16:28:24 +00002991 if (StoreInst *SI = dyn_cast<StoreInst>(*I))
Nate Begemanb816f022004-10-07 22:30:03 +00002992 if (cByte == getClassB(SI->getOperand(0)->getType()))
Nate Begeman35b020d2004-10-06 11:03:30 +00002993 continue;
2994 AllUsesAreStoresOrSetCC = false;
2995 break;
2996 }
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002997 if (!AllUsesAreStoresOrSetCC)
2998 return true;
2999 }
3000 return false;
3001}
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003002
Misha Brukmanb097f212004-07-26 18:13:24 +00003003/// visitLoadInst - Implement LLVM load instructions. Pretty straightforward
3004/// mapping of LLVM classes to PPC load instructions, with the exception of
3005/// signed byte loads, which need a sign extension following them.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003006///
Misha Brukmana1dca552004-09-21 18:22:19 +00003007void PPC32ISel::visitLoadInst(LoadInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003008 // Immediate opcodes, for reg+imm addressing
3009 static const unsigned ImmOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00003010 PPC::LBZ, PPC::LHZ, PPC::LWZ,
3011 PPC::LFS, PPC::LFD, PPC::LWZ
Misha Brukmanb097f212004-07-26 18:13:24 +00003012 };
3013 // Indexed opcodes, for reg+reg addressing
3014 static const unsigned IdxOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00003015 PPC::LBZX, PPC::LHZX, PPC::LWZX,
3016 PPC::LFSX, PPC::LFDX, PPC::LWZX
Misha Brukman2fec9902004-06-21 20:22:03 +00003017 };
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003018
Misha Brukmanb097f212004-07-26 18:13:24 +00003019 unsigned Class = getClassB(I.getType());
3020 unsigned ImmOpcode = ImmOpcodes[Class];
3021 unsigned IdxOpcode = IdxOpcodes[Class];
3022 unsigned DestReg = getReg(I);
3023 Value *SourceAddr = I.getOperand(0);
3024
Misha Brukman5b570812004-08-10 22:47:03 +00003025 if (Class == cShort && I.getType()->isSigned()) ImmOpcode = PPC::LHA;
3026 if (Class == cShort && I.getType()->isSigned()) IdxOpcode = PPC::LHAX;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003027
Nate Begeman53e4aa52004-11-24 21:53:14 +00003028 // If this is a fixed size alloca, emit a load directly from the stack slot
3029 // corresponding to it.
Misha Brukmanb097f212004-07-26 18:13:24 +00003030 if (AllocaInst *AI = dyn_castFixedAlloca(SourceAddr)) {
Misha Brukman422791f2004-06-21 17:41:12 +00003031 unsigned FI = getFixedSizedAllocaFI(AI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003032 if (Class == cLong) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003033 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg), FI);
3034 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg+1), FI, 4);
Nate Begeman0e5e5f52004-08-22 08:10:15 +00003035 } else if (LoadNeedsSignExtend(I)) {
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003036 unsigned TmpReg = makeAnotherReg(I.getType());
Misha Brukmanb097f212004-07-26 18:13:24 +00003037 addFrameReference(BuildMI(BB, ImmOpcode, 2, TmpReg), FI);
Misha Brukman5b570812004-08-10 22:47:03 +00003038 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003039 } else {
Misha Brukmanb097f212004-07-26 18:13:24 +00003040 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +00003041 }
Misha Brukmanb097f212004-07-26 18:13:24 +00003042 return;
3043 }
3044
Nate Begeman645495d2004-09-23 05:31:33 +00003045 // If the offset fits in 16 bits, we can emit a reg+imm load, otherwise, we
3046 // use the index from the FoldedGEP struct and use reg+reg addressing.
Misha Brukmanb097f212004-07-26 18:13:24 +00003047 if (GetElementPtrInst *GEPI = canFoldGEPIntoLoadOrStore(SourceAddr)) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003048
Nate Begeman645495d2004-09-23 05:31:33 +00003049 // Generate the code for the GEP and get the components of the folded GEP
3050 emitGEPOperation(BB, BB->end(), GEPI, true);
3051 unsigned baseReg = GEPMap[GEPI].base;
3052 unsigned indexReg = GEPMap[GEPI].index;
3053 ConstantSInt *offset = GEPMap[GEPI].offset;
3054
3055 if (Class != cLong) {
Nate Begemanbc3a5372004-11-19 08:01:16 +00003056 unsigned TmpReg = LoadNeedsSignExtend(I) ? makeAnotherReg(I.getType())
3057 : DestReg;
Nate Begeman645495d2004-09-23 05:31:33 +00003058 if (indexReg == 0)
Misha Brukmanb097f212004-07-26 18:13:24 +00003059 BuildMI(BB, ImmOpcode, 2, TmpReg).addSImm(offset->getValue())
3060 .addReg(baseReg);
Nate Begeman645495d2004-09-23 05:31:33 +00003061 else
3062 BuildMI(BB, IdxOpcode, 2, TmpReg).addReg(indexReg).addReg(baseReg);
3063 if (LoadNeedsSignExtend(I))
Misha Brukman5b570812004-08-10 22:47:03 +00003064 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Nate Begeman645495d2004-09-23 05:31:33 +00003065 } else {
3066 indexReg = (indexReg != 0) ? indexReg : getReg(offset);
Misha Brukmanb097f212004-07-26 18:13:24 +00003067 unsigned indexPlus4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003068 BuildMI(BB, PPC::ADDI, 2, indexPlus4).addReg(indexReg).addSImm(4);
Misha Brukmanb097f212004-07-26 18:13:24 +00003069 BuildMI(BB, IdxOpcode, 2, DestReg).addReg(indexReg).addReg(baseReg);
3070 BuildMI(BB, IdxOpcode, 2, DestReg+1).addReg(indexPlus4).addReg(baseReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003071 }
Misha Brukmanb097f212004-07-26 18:13:24 +00003072 return;
3073 }
3074
3075 // The fallback case, where the load was from a source that could not be
3076 // folded into the load instruction.
3077 unsigned SrcAddrReg = getReg(SourceAddr);
3078
3079 if (Class == cLong) {
3080 BuildMI(BB, ImmOpcode, 2, DestReg).addSImm(0).addReg(SrcAddrReg);
3081 BuildMI(BB, ImmOpcode, 2, DestReg+1).addSImm(4).addReg(SrcAddrReg);
Nate Begeman0e5e5f52004-08-22 08:10:15 +00003082 } else if (LoadNeedsSignExtend(I)) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003083 unsigned TmpReg = makeAnotherReg(I.getType());
3084 BuildMI(BB, ImmOpcode, 2, TmpReg).addSImm(0).addReg(SrcAddrReg);
Misha Brukman5b570812004-08-10 22:47:03 +00003085 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003086 } else {
3087 BuildMI(BB, ImmOpcode, 2, DestReg).addSImm(0).addReg(SrcAddrReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003088 }
3089}
3090
3091/// visitStoreInst - Implement LLVM store instructions
3092///
Misha Brukmana1dca552004-09-21 18:22:19 +00003093void PPC32ISel::visitStoreInst(StoreInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003094 // Immediate opcodes, for reg+imm addressing
3095 static const unsigned ImmOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00003096 PPC::STB, PPC::STH, PPC::STW,
3097 PPC::STFS, PPC::STFD, PPC::STW
Misha Brukmanb097f212004-07-26 18:13:24 +00003098 };
3099 // Indexed opcodes, for reg+reg addressing
3100 static const unsigned IdxOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00003101 PPC::STBX, PPC::STHX, PPC::STWX,
3102 PPC::STFSX, PPC::STFDX, PPC::STWX
Misha Brukmanb097f212004-07-26 18:13:24 +00003103 };
3104
3105 Value *SourceAddr = I.getOperand(1);
3106 const Type *ValTy = I.getOperand(0)->getType();
3107 unsigned Class = getClassB(ValTy);
3108 unsigned ImmOpcode = ImmOpcodes[Class];
3109 unsigned IdxOpcode = IdxOpcodes[Class];
3110 unsigned ValReg = getReg(I.getOperand(0));
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003111
Nate Begeman53e4aa52004-11-24 21:53:14 +00003112 // If this is a fixed size alloca, emit a store directly to the stack slot
3113 // corresponding to it.
3114 if (AllocaInst *AI = dyn_castFixedAlloca(SourceAddr)) {
3115 unsigned FI = getFixedSizedAllocaFI(AI);
3116 addFrameReference(BuildMI(BB, ImmOpcode, 3).addReg(ValReg), FI);
3117 if (Class == cLong)
3118 addFrameReference(BuildMI(BB, ImmOpcode, 3).addReg(ValReg+1), FI, 4);
3119 return;
3120 }
3121
Nate Begeman645495d2004-09-23 05:31:33 +00003122 // If the offset fits in 16 bits, we can emit a reg+imm store, otherwise, we
3123 // use the index from the FoldedGEP struct and use reg+reg addressing.
Misha Brukmanb097f212004-07-26 18:13:24 +00003124 if (GetElementPtrInst *GEPI = canFoldGEPIntoLoadOrStore(SourceAddr)) {
Nate Begeman645495d2004-09-23 05:31:33 +00003125 // Generate the code for the GEP and get the components of the folded GEP
3126 emitGEPOperation(BB, BB->end(), GEPI, true);
3127 unsigned baseReg = GEPMap[GEPI].base;
3128 unsigned indexReg = GEPMap[GEPI].index;
3129 ConstantSInt *offset = GEPMap[GEPI].offset;
Misha Brukmanb097f212004-07-26 18:13:24 +00003130
Nate Begeman645495d2004-09-23 05:31:33 +00003131 if (Class != cLong) {
3132 if (indexReg == 0)
3133 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(offset->getValue())
3134 .addReg(baseReg);
3135 else
3136 BuildMI(BB, IdxOpcode, 3).addReg(ValReg).addReg(indexReg)
3137 .addReg(baseReg);
3138 } else {
3139 indexReg = (indexReg != 0) ? indexReg : getReg(offset);
Misha Brukmanb097f212004-07-26 18:13:24 +00003140 unsigned indexPlus4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003141 BuildMI(BB, PPC::ADDI, 2, indexPlus4).addReg(indexReg).addSImm(4);
Misha Brukmanb097f212004-07-26 18:13:24 +00003142 BuildMI(BB, IdxOpcode, 3).addReg(ValReg).addReg(indexReg).addReg(baseReg);
3143 BuildMI(BB, IdxOpcode, 3).addReg(ValReg+1).addReg(indexPlus4)
3144 .addReg(baseReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003145 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003146 return;
3147 }
Misha Brukmanb097f212004-07-26 18:13:24 +00003148
3149 // If the store address wasn't the only use of a GEP, we fall back to the
3150 // standard path: store the ValReg at the value in AddressReg.
3151 unsigned AddressReg = getReg(I.getOperand(1));
3152 if (Class == cLong) {
3153 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(0).addReg(AddressReg);
3154 BuildMI(BB, ImmOpcode, 3).addReg(ValReg+1).addSImm(4).addReg(AddressReg);
3155 return;
3156 }
3157 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(0).addReg(AddressReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003158}
3159
3160
3161/// visitCastInst - Here we have various kinds of copying with or without sign
3162/// extension going on.
3163///
Misha Brukmana1dca552004-09-21 18:22:19 +00003164void PPC32ISel::visitCastInst(CastInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003165 Value *Op = CI.getOperand(0);
3166
3167 unsigned SrcClass = getClassB(Op->getType());
3168 unsigned DestClass = getClassB(CI.getType());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003169
Nate Begeman676dee62004-11-08 02:25:40 +00003170 // Noop casts are not emitted: getReg will return the source operand as the
3171 // register to use for any uses of the noop cast.
3172 if (DestClass == SrcClass) return;
3173
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003174 // If this is a cast from a 32-bit integer to a Long type, and the only uses
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003175 // of the cast are GEP instructions, then the cast does not need to be
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003176 // generated explicitly, it will be folded into the GEP.
3177 if (DestClass == cLong && SrcClass == cInt) {
3178 bool AllUsesAreGEPs = true;
3179 for (Value::use_iterator I = CI.use_begin(), E = CI.use_end(); I != E; ++I)
3180 if (!isa<GetElementPtrInst>(*I)) {
3181 AllUsesAreGEPs = false;
3182 break;
3183 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003184 if (AllUsesAreGEPs) return;
3185 }
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003186
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003187 unsigned DestReg = getReg(CI);
3188 MachineBasicBlock::iterator MI = BB->end();
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003189
Nate Begeman31dfc522004-10-23 00:50:23 +00003190 // If this is a cast from an integer type to a ubyte, with one use where the
3191 // use is the shift amount argument of a shift instruction, just emit a move
3192 // instead (since the shift instruction will only look at the low 5 bits
3193 // regardless of how it is sign extended)
3194 if (CI.getType() == Type::UByteTy && SrcClass <= cInt && CI.hasOneUse()) {
3195 ShiftInst *SI = dyn_cast<ShiftInst>(*(CI.use_begin()));
3196 if (SI && (SI->getOperand(1) == &CI)) {
3197 unsigned SrcReg = getReg(Op, BB, MI);
3198 BuildMI(*BB, MI, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3199 return;
3200 }
3201 }
3202
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003203 // If this is a cast from an byte, short, or int to an integer type of equal
3204 // or lesser width, and all uses of the cast are store instructions then dont
3205 // emit them, as the store instruction will implicitly not store the zero or
3206 // sign extended bytes.
3207 if (SrcClass <= cInt && SrcClass >= DestClass) {
Nate Begeman075cdc62004-11-07 20:23:42 +00003208 bool AllUsesAreStores = true;
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003209 for (Value::use_iterator I = CI.use_begin(), E = CI.use_end(); I != E; ++I)
Nate Begeman075cdc62004-11-07 20:23:42 +00003210 if (!isa<StoreInst>(*I)) {
3211 AllUsesAreStores = false;
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003212 break;
3213 }
3214 // Turn this cast directly into a move instruction, which the register
3215 // allocator will deal with.
Nate Begeman075cdc62004-11-07 20:23:42 +00003216 if (AllUsesAreStores) {
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003217 unsigned SrcReg = getReg(Op, BB, MI);
3218 BuildMI(*BB, MI, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3219 return;
3220 }
3221 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003222 emitCastOperation(BB, MI, Op, CI.getType(), DestReg);
3223}
3224
3225/// emitCastOperation - Common code shared between visitCastInst and constant
3226/// expression cast support.
3227///
Misha Brukmana1dca552004-09-21 18:22:19 +00003228void PPC32ISel::emitCastOperation(MachineBasicBlock *MBB,
3229 MachineBasicBlock::iterator IP,
3230 Value *Src, const Type *DestTy,
3231 unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003232 const Type *SrcTy = Src->getType();
3233 unsigned SrcClass = getClassB(SrcTy);
3234 unsigned DestClass = getClassB(DestTy);
Misha Brukman7e898c32004-07-20 00:41:46 +00003235 unsigned SrcReg = getReg(Src, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003236
Nate Begeman0797d492004-10-20 21:55:41 +00003237 // Implement casts from bool to integer types as a move operation
3238 if (SrcTy == Type::BoolTy) {
3239 switch (DestClass) {
3240 case cByte:
3241 case cShort:
3242 case cInt:
3243 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3244 return;
3245 case cLong:
3246 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addImm(0);
3247 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg).addReg(SrcReg);
3248 return;
3249 default:
3250 break;
3251 }
3252 }
3253
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003254 // Implement casts to bool by using compare on the operand followed by set if
3255 // not zero on the result.
3256 if (DestTy == Type::BoolTy) {
3257 switch (SrcClass) {
3258 case cByte:
Misha Brukman422791f2004-06-21 17:41:12 +00003259 case cShort:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003260 case cInt: {
3261 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003262 BuildMI(*MBB, IP, PPC::ADDIC, 2, TmpReg).addReg(SrcReg).addSImm(-1);
3263 BuildMI(*MBB, IP, PPC::SUBFE, 2, DestReg).addReg(TmpReg).addReg(SrcReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003264 break;
3265 }
3266 case cLong: {
3267 unsigned TmpReg = makeAnotherReg(Type::IntTy);
3268 unsigned SrcReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003269 BuildMI(*MBB, IP, PPC::OR, 2, SrcReg2).addReg(SrcReg).addReg(SrcReg+1);
3270 BuildMI(*MBB, IP, PPC::ADDIC, 2, TmpReg).addReg(SrcReg2).addSImm(-1);
3271 BuildMI(*MBB, IP, PPC::SUBFE, 2, DestReg).addReg(TmpReg)
Misha Brukmanbf417a62004-07-20 20:43:05 +00003272 .addReg(SrcReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003273 break;
3274 }
Misha Brukman7e898c32004-07-20 00:41:46 +00003275 case cFP32:
3276 case cFP64:
Nate Begemanf2f07812004-08-29 08:19:32 +00003277 unsigned TmpReg = makeAnotherReg(Type::IntTy);
3278 unsigned ConstZero = getReg(ConstantFP::get(Type::DoubleTy, 0.0), BB, IP);
3279 BuildMI(*MBB, IP, PPC::FCMPU, PPC::CR7).addReg(SrcReg).addReg(ConstZero);
3280 BuildMI(*MBB, IP, PPC::MFCR, TmpReg);
3281 BuildMI(*MBB, IP, PPC::RLWINM, DestReg).addReg(TmpReg).addImm(31)
3282 .addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003283 }
3284 return;
3285 }
3286
Misha Brukman7e898c32004-07-20 00:41:46 +00003287 // Handle cast of Float -> Double
3288 if (SrcClass == cFP32 && DestClass == cFP64) {
Misha Brukman5b570812004-08-10 22:47:03 +00003289 BuildMI(*MBB, IP, PPC::FMR, 1, DestReg).addReg(SrcReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00003290 return;
3291 }
3292
3293 // Handle cast of Double -> Float
3294 if (SrcClass == cFP64 && DestClass == cFP32) {
Misha Brukman5b570812004-08-10 22:47:03 +00003295 BuildMI(*MBB, IP, PPC::FRSP, 1, DestReg).addReg(SrcReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00003296 return;
3297 }
3298
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003299 // Handle casts from integer to floating point now...
Misha Brukman7e898c32004-07-20 00:41:46 +00003300 if (DestClass == cFP32 || DestClass == cFP64) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003301
Misha Brukman422791f2004-06-21 17:41:12 +00003302 // Emit a library call for long to float conversion
3303 if (SrcClass == cLong) {
Misha Brukman7e898c32004-07-20 00:41:46 +00003304 Function *floatFn = (DestClass == cFP32) ? __floatdisfFn : __floatdidfFn;
Nate Begemanf2f07812004-08-29 08:19:32 +00003305 if (SrcTy->isSigned()) {
3306 std::vector<ValueRecord> Args;
3307 Args.push_back(ValueRecord(SrcReg, SrcTy));
3308 MachineInstr *TheCall =
3309 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3310 doCall(ValueRecord(DestReg, DestTy), TheCall, Args, false);
Nate Begemanf2f07812004-08-29 08:19:32 +00003311 } else {
3312 std::vector<ValueRecord> CmpArgs, ClrArgs, SetArgs;
3313 unsigned ZeroLong = getReg(ConstantUInt::get(SrcTy, 0));
3314 unsigned CondReg = makeAnotherReg(Type::IntTy);
3315
3316 // Update machine-CFG edges
3317 MachineBasicBlock *ClrMBB = new MachineBasicBlock(BB->getBasicBlock());
3318 MachineBasicBlock *SetMBB = new MachineBasicBlock(BB->getBasicBlock());
3319 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
3320 MachineBasicBlock *OldMBB = BB;
3321 ilist<MachineBasicBlock>::iterator It = BB; ++It;
3322 F->getBasicBlockList().insert(It, ClrMBB);
3323 F->getBasicBlockList().insert(It, SetMBB);
3324 F->getBasicBlockList().insert(It, PhiMBB);
3325 BB->addSuccessor(ClrMBB);
3326 BB->addSuccessor(SetMBB);
3327
3328 CmpArgs.push_back(ValueRecord(SrcReg, SrcTy));
3329 CmpArgs.push_back(ValueRecord(ZeroLong, SrcTy));
3330 MachineInstr *TheCall =
3331 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(__cmpdi2Fn, true);
3332 doCall(ValueRecord(CondReg, Type::IntTy), TheCall, CmpArgs, false);
Nate Begemanf2f07812004-08-29 08:19:32 +00003333 BuildMI(*MBB, IP, PPC::CMPWI, 2, PPC::CR0).addReg(CondReg).addSImm(0);
3334 BuildMI(*MBB, IP, PPC::BLE, 2).addReg(PPC::CR0).addMBB(SetMBB);
3335
3336 // ClrMBB
3337 BB = ClrMBB;
3338 unsigned ClrReg = makeAnotherReg(DestTy);
3339 ClrArgs.push_back(ValueRecord(SrcReg, SrcTy));
3340 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3341 doCall(ValueRecord(ClrReg, DestTy), TheCall, ClrArgs, false);
Nate Begemanf2f07812004-08-29 08:19:32 +00003342 BuildMI(BB, PPC::B, 1).addMBB(PhiMBB);
3343 BB->addSuccessor(PhiMBB);
3344
3345 // SetMBB
3346 BB = SetMBB;
3347 unsigned SetReg = makeAnotherReg(DestTy);
3348 unsigned CallReg = makeAnotherReg(DestTy);
3349 unsigned ShiftedReg = makeAnotherReg(SrcTy);
3350 ConstantSInt *Const1 = ConstantSInt::get(Type::IntTy, 1);
Nate Begeman9b508c32004-10-26 03:48:25 +00003351 emitShiftOperation(BB, BB->end(), Src, Const1, false, SrcTy, 0,
3352 ShiftedReg);
Nate Begemanf2f07812004-08-29 08:19:32 +00003353 SetArgs.push_back(ValueRecord(ShiftedReg, SrcTy));
3354 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3355 doCall(ValueRecord(CallReg, DestTy), TheCall, SetArgs, false);
Nate Begemanf2f07812004-08-29 08:19:32 +00003356 unsigned SetOpcode = (DestClass == cFP32) ? PPC::FADDS : PPC::FADD;
3357 BuildMI(BB, SetOpcode, 2, SetReg).addReg(CallReg).addReg(CallReg);
3358 BB->addSuccessor(PhiMBB);
3359
3360 // PhiMBB
3361 BB = PhiMBB;
3362 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(ClrReg).addMBB(ClrMBB)
3363 .addReg(SetReg).addMBB(SetMBB);
3364 }
Misha Brukman422791f2004-06-21 17:41:12 +00003365 return;
3366 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003367
Misha Brukman7e898c32004-07-20 00:41:46 +00003368 // Make sure we're dealing with a full 32 bits
Nate Begeman8531f6f2004-11-19 02:06:40 +00003369 if (SrcClass < cInt) {
3370 unsigned TmpReg = makeAnotherReg(Type::IntTy);
3371 promote32(TmpReg, ValueRecord(SrcReg, SrcTy));
3372 SrcReg = TmpReg;
3373 }
Misha Brukman422791f2004-06-21 17:41:12 +00003374
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003375 // Spill the integer to memory and reload it from there.
Misha Brukman422791f2004-06-21 17:41:12 +00003376 // Also spill room for a special conversion constant
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003377 int ValueFrameIdx =
3378 F->getFrameInfo()->CreateStackObject(Type::DoubleTy, TM.getTargetData());
3379
Misha Brukman422791f2004-06-21 17:41:12 +00003380 unsigned constantHi = makeAnotherReg(Type::IntTy);
Misha Brukman422791f2004-06-21 17:41:12 +00003381 unsigned TempF = makeAnotherReg(Type::DoubleTy);
3382
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003383 if (!SrcTy->isSigned()) {
Nate Begeman81d265d2004-08-19 05:20:54 +00003384 ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, 0x1.000000p52);
3385 unsigned ConstF = getReg(CFP, BB, IP);
Nate Begemanf2f07812004-08-29 08:19:32 +00003386 BuildMI(*MBB, IP, PPC::LIS, 1, constantHi).addSImm(0x4330);
3387 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(constantHi),
Misha Brukman2fec9902004-06-21 20:22:03 +00003388 ValueFrameIdx);
Nate Begemanf2f07812004-08-29 08:19:32 +00003389 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(SrcReg),
Misha Brukman2fec9902004-06-21 20:22:03 +00003390 ValueFrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003391 addFrameReference(BuildMI(*MBB, IP, PPC::LFD, 2, TempF), ValueFrameIdx);
3392 BuildMI(*MBB, IP, PPC::FSUB, 2, DestReg).addReg(TempF).addReg(ConstF);
Misha Brukman422791f2004-06-21 17:41:12 +00003393 } else {
Nate Begeman81d265d2004-08-19 05:20:54 +00003394 ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, 0x1.000008p52);
3395 unsigned ConstF = getReg(CFP, BB, IP);
Misha Brukman422791f2004-06-21 17:41:12 +00003396 unsigned TempLo = makeAnotherReg(Type::IntTy);
Nate Begemanf2f07812004-08-29 08:19:32 +00003397 BuildMI(*MBB, IP, PPC::LIS, 1, constantHi).addSImm(0x4330);
3398 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(constantHi),
Misha Brukman2fec9902004-06-21 20:22:03 +00003399 ValueFrameIdx);
Nate Begemanf2f07812004-08-29 08:19:32 +00003400 BuildMI(*MBB, IP, PPC::XORIS, 2, TempLo).addReg(SrcReg).addImm(0x8000);
3401 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(TempLo),
Misha Brukman2fec9902004-06-21 20:22:03 +00003402 ValueFrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003403 addFrameReference(BuildMI(*MBB, IP, PPC::LFD, 2, TempF), ValueFrameIdx);
3404 BuildMI(*MBB, IP, PPC::FSUB, 2, DestReg).addReg(TempF).addReg(ConstF);
Misha Brukman422791f2004-06-21 17:41:12 +00003405 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003406 return;
3407 }
3408
3409 // Handle casts from floating point to integer now...
Misha Brukman7e898c32004-07-20 00:41:46 +00003410 if (SrcClass == cFP32 || SrcClass == cFP64) {
Nate Begemanb64af912004-08-10 20:42:36 +00003411 static Function* const Funcs[] =
3412 { __fixsfdiFn, __fixdfdiFn, __fixunssfdiFn, __fixunsdfdiFn };
Misha Brukman422791f2004-06-21 17:41:12 +00003413 // emit library call
3414 if (DestClass == cLong) {
Nate Begemanb64af912004-08-10 20:42:36 +00003415 bool isDouble = SrcClass == cFP64;
3416 unsigned nameIndex = 2 * DestTy->isSigned() + isDouble;
Misha Brukman422791f2004-06-21 17:41:12 +00003417 std::vector<ValueRecord> Args;
3418 Args.push_back(ValueRecord(SrcReg, SrcTy));
Nate Begemanb64af912004-08-10 20:42:36 +00003419 Function *floatFn = Funcs[nameIndex];
Misha Brukman2fec9902004-06-21 20:22:03 +00003420 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003421 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003422 doCall(ValueRecord(DestReg, DestTy), TheCall, Args, false);
Misha Brukman422791f2004-06-21 17:41:12 +00003423 return;
3424 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003425
3426 int ValueFrameIdx =
Nate Begeman43d64ea2004-08-15 06:42:28 +00003427 F->getFrameInfo()->CreateStackObject(Type::DoubleTy, TM.getTargetData());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003428
Misha Brukman7e898c32004-07-20 00:41:46 +00003429 if (DestTy->isSigned()) {
Misha Brukman4c14f332004-07-23 01:11:19 +00003430 unsigned TempReg = makeAnotherReg(Type::DoubleTy);
3431
3432 // Convert to integer in the FP reg and store it to a stack slot
Nate Begemanf2f07812004-08-29 08:19:32 +00003433 BuildMI(*MBB, IP, PPC::FCTIWZ, 1, TempReg).addReg(SrcReg);
3434 addFrameReference(BuildMI(*MBB, IP, PPC::STFD, 3)
Misha Brukman4c14f332004-07-23 01:11:19 +00003435 .addReg(TempReg), ValueFrameIdx);
Misha Brukmanb097f212004-07-26 18:13:24 +00003436
3437 // There is no load signed byte opcode, so we must emit a sign extend for
3438 // that particular size. Make sure to source the new integer from the
3439 // correct offset.
Misha Brukman4c14f332004-07-23 01:11:19 +00003440 if (DestClass == cByte) {
3441 unsigned TempReg2 = makeAnotherReg(DestTy);
Nate Begemanf2f07812004-08-29 08:19:32 +00003442 addFrameReference(BuildMI(*MBB, IP, PPC::LBZ, 2, TempReg2),
Misha Brukmanb097f212004-07-26 18:13:24 +00003443 ValueFrameIdx, 7);
Nate Begemanf2f07812004-08-29 08:19:32 +00003444 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(TempReg2);
Misha Brukman4c14f332004-07-23 01:11:19 +00003445 } else {
Misha Brukmanb097f212004-07-26 18:13:24 +00003446 int offset = (DestClass == cShort) ? 6 : 4;
Misha Brukman5b570812004-08-10 22:47:03 +00003447 unsigned LoadOp = (DestClass == cShort) ? PPC::LHA : PPC::LWZ;
Nate Begemanf2f07812004-08-29 08:19:32 +00003448 addFrameReference(BuildMI(*MBB, IP, LoadOp, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003449 ValueFrameIdx, offset);
Misha Brukman4c14f332004-07-23 01:11:19 +00003450 }
Misha Brukman7e898c32004-07-20 00:41:46 +00003451 } else {
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003452 unsigned Zero = getReg(ConstantFP::get(Type::DoubleTy, 0.0f));
3453 double maxInt = (1LL << 32) - 1;
3454 unsigned MaxInt = getReg(ConstantFP::get(Type::DoubleTy, maxInt));
3455 double border = 1LL << 31;
3456 unsigned Border = getReg(ConstantFP::get(Type::DoubleTy, border));
3457 unsigned UseZero = makeAnotherReg(Type::DoubleTy);
3458 unsigned UseMaxInt = makeAnotherReg(Type::DoubleTy);
3459 unsigned UseChoice = makeAnotherReg(Type::DoubleTy);
3460 unsigned TmpReg = makeAnotherReg(Type::DoubleTy);
3461 unsigned TmpReg2 = makeAnotherReg(Type::DoubleTy);
3462 unsigned ConvReg = makeAnotherReg(Type::DoubleTy);
3463 unsigned IntTmp = makeAnotherReg(Type::IntTy);
3464 unsigned XorReg = makeAnotherReg(Type::IntTy);
3465 int FrameIdx =
3466 F->getFrameInfo()->CreateStackObject(SrcTy, TM.getTargetData());
3467 // Update machine-CFG edges
3468 MachineBasicBlock *XorMBB = new MachineBasicBlock(BB->getBasicBlock());
3469 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
3470 MachineBasicBlock *OldMBB = BB;
3471 ilist<MachineBasicBlock>::iterator It = BB; ++It;
3472 F->getBasicBlockList().insert(It, XorMBB);
3473 F->getBasicBlockList().insert(It, PhiMBB);
3474 BB->addSuccessor(XorMBB);
3475 BB->addSuccessor(PhiMBB);
3476
3477 // Convert from floating point to unsigned 32-bit value
3478 // Use 0 if incoming value is < 0.0
Nate Begemanf2f07812004-08-29 08:19:32 +00003479 BuildMI(*MBB, IP, PPC::FSEL, 3, UseZero).addReg(SrcReg).addReg(SrcReg)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003480 .addReg(Zero);
3481 // Use 2**32 - 1 if incoming value is >= 2**32
Nate Begemanf2f07812004-08-29 08:19:32 +00003482 BuildMI(*MBB, IP, PPC::FSUB, 2, UseMaxInt).addReg(MaxInt).addReg(SrcReg);
3483 BuildMI(*MBB, IP, PPC::FSEL, 3, UseChoice).addReg(UseMaxInt)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003484 .addReg(UseZero).addReg(MaxInt);
3485 // Subtract 2**31
Nate Begemanf2f07812004-08-29 08:19:32 +00003486 BuildMI(*MBB, IP, PPC::FSUB, 2, TmpReg).addReg(UseChoice).addReg(Border);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003487 // Use difference if >= 2**31
Nate Begemanf2f07812004-08-29 08:19:32 +00003488 BuildMI(*MBB, IP, PPC::FCMPU, 2, PPC::CR0).addReg(UseChoice)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003489 .addReg(Border);
Nate Begemanf2f07812004-08-29 08:19:32 +00003490 BuildMI(*MBB, IP, PPC::FSEL, 3, TmpReg2).addReg(TmpReg).addReg(TmpReg)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003491 .addReg(UseChoice);
3492 // Convert to integer
Nate Begemanf2f07812004-08-29 08:19:32 +00003493 BuildMI(*MBB, IP, PPC::FCTIWZ, 1, ConvReg).addReg(TmpReg2);
3494 addFrameReference(BuildMI(*MBB, IP, PPC::STFD, 3).addReg(ConvReg),
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003495 FrameIdx);
Misha Brukmanb097f212004-07-26 18:13:24 +00003496 if (DestClass == cByte) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003497 addFrameReference(BuildMI(*MBB, IP, PPC::LBZ, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003498 FrameIdx, 7);
3499 } else if (DestClass == cShort) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003500 addFrameReference(BuildMI(*MBB, IP, PPC::LHZ, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003501 FrameIdx, 6);
3502 } if (DestClass == cInt) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003503 addFrameReference(BuildMI(*MBB, IP, PPC::LWZ, 2, IntTmp),
Misha Brukmanb097f212004-07-26 18:13:24 +00003504 FrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003505 BuildMI(*MBB, IP, PPC::BLT, 2).addReg(PPC::CR0).addMBB(PhiMBB);
3506 BuildMI(*MBB, IP, PPC::B, 1).addMBB(XorMBB);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003507
Misha Brukmanb097f212004-07-26 18:13:24 +00003508 // XorMBB:
3509 // add 2**31 if input was >= 2**31
3510 BB = XorMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00003511 BuildMI(BB, PPC::XORIS, 2, XorReg).addReg(IntTmp).addImm(0x8000);
Misha Brukmanb097f212004-07-26 18:13:24 +00003512 XorMBB->addSuccessor(PhiMBB);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003513
Misha Brukmanb097f212004-07-26 18:13:24 +00003514 // PhiMBB:
3515 // DestReg = phi [ IntTmp, OldMBB ], [ XorReg, XorMBB ]
3516 BB = PhiMBB;
Misha Brukmand2cbb872004-08-19 21:00:12 +00003517 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(IntTmp).addMBB(OldMBB)
Misha Brukmanb097f212004-07-26 18:13:24 +00003518 .addReg(XorReg).addMBB(XorMBB);
3519 }
3520 }
3521 return;
3522 }
3523
3524 // Check our invariants
3525 assert((SrcClass <= cInt || SrcClass == cLong) &&
3526 "Unhandled source class for cast operation!");
3527 assert((DestClass <= cInt || DestClass == cLong) &&
3528 "Unhandled destination class for cast operation!");
3529
3530 bool sourceUnsigned = SrcTy->isUnsigned() || SrcTy == Type::BoolTy;
3531 bool destUnsigned = DestTy->isUnsigned();
3532
3533 // Unsigned -> Unsigned, clear if larger,
3534 if (sourceUnsigned && destUnsigned) {
3535 // handle long dest class now to keep switch clean
3536 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003537 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
3538 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3539 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003540 return;
3541 }
3542
3543 // handle u{ byte, short, int } x u{ byte, short, int }
3544 unsigned clearBits = (SrcClass == cByte || DestClass == cByte) ? 24 : 16;
3545 switch (SrcClass) {
3546 case cByte:
3547 case cShort:
Nate Begeman8531f6f2004-11-19 02:06:40 +00003548 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
3549 .addImm(0).addImm(clearBits).addImm(31);
Misha Brukmanb097f212004-07-26 18:13:24 +00003550 break;
3551 case cLong:
3552 ++SrcReg;
3553 // Fall through
3554 case cInt:
Nate Begeman8531f6f2004-11-19 02:06:40 +00003555 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
3556 .addImm(0).addImm(clearBits).addImm(31);
Misha Brukmanb097f212004-07-26 18:13:24 +00003557 break;
3558 }
3559 return;
3560 }
3561
3562 // Signed -> Signed
3563 if (!sourceUnsigned && !destUnsigned) {
3564 // handle long dest class now to keep switch clean
3565 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003566 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg).addImm(31);
3567 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3568 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003569 return;
3570 }
3571
3572 // handle { byte, short, int } x { byte, short, int }
3573 switch (SrcClass) {
3574 case cByte:
Nate Begeman01136382004-11-18 04:56:53 +00003575 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003576 break;
3577 case cShort:
3578 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003579 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003580 else
Misha Brukman5b570812004-08-10 22:47:03 +00003581 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003582 break;
3583 case cLong:
3584 ++SrcReg;
3585 // Fall through
3586 case cInt:
3587 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003588 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003589 else if (DestClass == cShort)
Misha Brukman5b570812004-08-10 22:47:03 +00003590 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003591 else
Misha Brukman5b570812004-08-10 22:47:03 +00003592 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003593 break;
3594 }
3595 return;
3596 }
3597
3598 // Unsigned -> Signed
3599 if (sourceUnsigned && !destUnsigned) {
3600 // handle long dest class now to keep switch clean
3601 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003602 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
3603 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3604 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003605 return;
3606 }
3607
3608 // handle u{ byte, short, int } -> { byte, short, int }
3609 switch (SrcClass) {
3610 case cByte:
Nate Begeman01136382004-11-18 04:56:53 +00003611 // uByte 255 -> signed short/int == 255
3612 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(0)
3613 .addImm(24).addImm(31);
Misha Brukmanb097f212004-07-26 18:13:24 +00003614 break;
3615 case cShort:
3616 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003617 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003618 else
Misha Brukman5b570812004-08-10 22:47:03 +00003619 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(0)
Misha Brukmanb097f212004-07-26 18:13:24 +00003620 .addImm(16).addImm(31);
3621 break;
3622 case cLong:
3623 ++SrcReg;
3624 // Fall through
3625 case cInt:
3626 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003627 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003628 else if (DestClass == cShort)
Misha Brukman5b570812004-08-10 22:47:03 +00003629 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003630 else
Misha Brukman5b570812004-08-10 22:47:03 +00003631 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003632 break;
3633 }
3634 return;
3635 }
3636
3637 // Signed -> Unsigned
3638 if (!sourceUnsigned && destUnsigned) {
3639 // handle long dest class now to keep switch clean
3640 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003641 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg).addImm(31);
3642 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3643 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003644 return;
3645 }
3646
3647 // handle { byte, short, int } -> u{ byte, short, int }
3648 unsigned clearBits = (DestClass == cByte) ? 24 : 16;
3649 switch (SrcClass) {
3650 case cByte:
Nate Begeman01136382004-11-18 04:56:53 +00003651 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
3652 break;
Misha Brukmanb097f212004-07-26 18:13:24 +00003653 case cShort:
Nate Begeman01136382004-11-18 04:56:53 +00003654 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003655 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003656 .addImm(0).addImm(clearBits).addImm(31);
3657 else
Nate Begeman01136382004-11-18 04:56:53 +00003658 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003659 break;
3660 case cLong:
3661 ++SrcReg;
3662 // Fall through
3663 case cInt:
3664 if (DestClass == cInt)
Misha Brukman5b570812004-08-10 22:47:03 +00003665 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003666 else
Misha Brukman5b570812004-08-10 22:47:03 +00003667 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003668 .addImm(0).addImm(clearBits).addImm(31);
3669 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00003670 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003671 return;
3672 }
3673
3674 // Anything we haven't handled already, we can't (yet) handle at all.
Misha Brukmanb097f212004-07-26 18:13:24 +00003675 std::cerr << "Unhandled cast from " << SrcTy->getDescription()
3676 << "to " << DestTy->getDescription() << '\n';
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003677 abort();
3678}
3679
3680/// visitVANextInst - Implement the va_next instruction...
3681///
Misha Brukmana1dca552004-09-21 18:22:19 +00003682void PPC32ISel::visitVANextInst(VANextInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003683 unsigned VAList = getReg(I.getOperand(0));
3684 unsigned DestReg = getReg(I);
3685
3686 unsigned Size;
Misha Brukman358829f2004-06-21 17:25:55 +00003687 switch (I.getArgType()->getTypeID()) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003688 default:
3689 std::cerr << I;
3690 assert(0 && "Error: bad type for va_next instruction!");
3691 return;
3692 case Type::PointerTyID:
3693 case Type::UIntTyID:
3694 case Type::IntTyID:
3695 Size = 4;
3696 break;
3697 case Type::ULongTyID:
3698 case Type::LongTyID:
3699 case Type::DoubleTyID:
3700 Size = 8;
3701 break;
3702 }
3703
3704 // Increment the VAList pointer...
Misha Brukman5b570812004-08-10 22:47:03 +00003705 BuildMI(BB, PPC::ADDI, 2, DestReg).addReg(VAList).addSImm(Size);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003706}
3707
Misha Brukmana1dca552004-09-21 18:22:19 +00003708void PPC32ISel::visitVAArgInst(VAArgInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003709 unsigned VAList = getReg(I.getOperand(0));
3710 unsigned DestReg = getReg(I);
3711
Misha Brukman358829f2004-06-21 17:25:55 +00003712 switch (I.getType()->getTypeID()) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003713 default:
3714 std::cerr << I;
3715 assert(0 && "Error: bad type for va_next instruction!");
3716 return;
3717 case Type::PointerTyID:
3718 case Type::UIntTyID:
3719 case Type::IntTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003720 BuildMI(BB, PPC::LWZ, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003721 break;
3722 case Type::ULongTyID:
3723 case Type::LongTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003724 BuildMI(BB, PPC::LWZ, 2, DestReg).addSImm(0).addReg(VAList);
3725 BuildMI(BB, PPC::LWZ, 2, DestReg+1).addSImm(4).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003726 break;
Misha Brukmanb097f212004-07-26 18:13:24 +00003727 case Type::FloatTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003728 BuildMI(BB, PPC::LFS, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukmanb097f212004-07-26 18:13:24 +00003729 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003730 case Type::DoubleTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003731 BuildMI(BB, PPC::LFD, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003732 break;
3733 }
3734}
3735
3736/// visitGetElementPtrInst - instruction-select GEP instructions
3737///
Misha Brukmana1dca552004-09-21 18:22:19 +00003738void PPC32ISel::visitGetElementPtrInst(GetElementPtrInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003739 if (canFoldGEPIntoLoadOrStore(&I))
3740 return;
3741
Nate Begeman645495d2004-09-23 05:31:33 +00003742 emitGEPOperation(BB, BB->end(), &I, false);
3743}
3744
Misha Brukman1013ef52004-07-21 20:09:08 +00003745/// emitGEPOperation - Common code shared between visitGetElementPtrInst and
3746/// constant expression GEP support.
3747///
Misha Brukmana1dca552004-09-21 18:22:19 +00003748void PPC32ISel::emitGEPOperation(MachineBasicBlock *MBB,
3749 MachineBasicBlock::iterator IP,
Nate Begeman645495d2004-09-23 05:31:33 +00003750 GetElementPtrInst *GEPI, bool GEPIsFolded) {
3751 // If we've already emitted this particular GEP, just return to avoid
3752 // multiple definitions of the base register.
Nate Begemana41fc772004-09-29 02:35:05 +00003753 if (GEPIsFolded && (GEPMap[GEPI].base != 0))
Nate Begeman645495d2004-09-23 05:31:33 +00003754 return;
Nate Begeman645495d2004-09-23 05:31:33 +00003755
3756 Value *Src = GEPI->getOperand(0);
3757 User::op_iterator IdxBegin = GEPI->op_begin()+1;
3758 User::op_iterator IdxEnd = GEPI->op_end();
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003759 const TargetData &TD = TM.getTargetData();
3760 const Type *Ty = Src->getType();
Chris Lattner27ee3a32005-04-09 19:47:21 +00003761 int32_t constValue = 0;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003762
3763 // Record the operations to emit the GEP in a vector so that we can emit them
3764 // after having analyzed the entire instruction.
Misha Brukmanb097f212004-07-26 18:13:24 +00003765 std::vector<CollapsedGepOp> ops;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003766
Misha Brukman1013ef52004-07-21 20:09:08 +00003767 // GEPs have zero or more indices; we must perform a struct access
3768 // or array access for each one.
3769 for (GetElementPtrInst::op_iterator oi = IdxBegin, oe = IdxEnd; oi != oe;
3770 ++oi) {
3771 Value *idx = *oi;
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003772 if (const StructType *StTy = dyn_cast<StructType>(Ty)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00003773 // It's a struct access. idx is the index into the structure,
3774 // which names the field. Use the TargetData structure to
3775 // pick out what the layout of the structure is in memory.
3776 // Use the (constant) structure index's value to find the
3777 // right byte offset from the StructLayout class's list of
3778 // structure member offsets.
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003779 unsigned fieldIndex = cast<ConstantUInt>(idx)->getValue();
Misha Brukmane2eceb52004-07-23 16:08:20 +00003780
3781 // StructType member offsets are always constant values. Add it to the
3782 // running total.
Nate Begeman645495d2004-09-23 05:31:33 +00003783 constValue += TD.getStructLayout(StTy)->MemberOffsets[fieldIndex];
Misha Brukmane2eceb52004-07-23 16:08:20 +00003784
Nate Begeman645495d2004-09-23 05:31:33 +00003785 // The next type is the member of the structure selected by the index.
Misha Brukmane2eceb52004-07-23 16:08:20 +00003786 Ty = StTy->getElementType (fieldIndex);
Nate Begeman645495d2004-09-23 05:31:33 +00003787 } else if (const SequentialType *SqTy = dyn_cast<SequentialType>(Ty)) {
Misha Brukman313efcb2004-07-09 15:45:07 +00003788 // Many GEP instructions use a [cast (int/uint) to LongTy] as their
3789 // operand. Handle this case directly now...
3790 if (CastInst *CI = dyn_cast<CastInst>(idx))
3791 if (CI->getOperand(0)->getType() == Type::IntTy ||
3792 CI->getOperand(0)->getType() == Type::UIntTy)
3793 idx = CI->getOperand(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00003794
Misha Brukmane2eceb52004-07-23 16:08:20 +00003795 // It's an array or pointer access: [ArraySize x ElementType].
3796 // We want to add basePtrReg to (idxReg * sizeof ElementType). First, we
3797 // must find the size of the pointed-to type (Not coincidentally, the next
3798 // type is the type of the elements in the array).
Misha Brukman1013ef52004-07-21 20:09:08 +00003799 Ty = SqTy->getElementType();
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003800 unsigned elementSize = TD.getTypeSize(Ty);
Misha Brukman1013ef52004-07-21 20:09:08 +00003801
Misha Brukmane2eceb52004-07-23 16:08:20 +00003802 if (ConstantInt *C = dyn_cast<ConstantInt>(idx)) {
Misha Brukmane2eceb52004-07-23 16:08:20 +00003803 if (ConstantSInt *CS = dyn_cast<ConstantSInt>(C))
3804 constValue += CS->getValue() * elementSize;
3805 else if (ConstantUInt *CU = dyn_cast<ConstantUInt>(C))
3806 constValue += CU->getValue() * elementSize;
3807 else
3808 assert(0 && "Invalid ConstantInt GEP index type!");
3809 } else {
Nate Begeman645495d2004-09-23 05:31:33 +00003810 // Push current gep state to this point as an add and multiply
3811 ops.push_back(CollapsedGepOp(
3812 ConstantSInt::get(Type::IntTy, constValue),
3813 idx, ConstantUInt::get(Type::UIntTy, elementSize)));
3814
Misha Brukmane2eceb52004-07-23 16:08:20 +00003815 constValue = 0;
Misha Brukman313efcb2004-07-09 15:45:07 +00003816 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003817 }
Misha Brukmane2eceb52004-07-23 16:08:20 +00003818 }
Misha Brukmane2eceb52004-07-23 16:08:20 +00003819 // Emit instructions for all the collapsed ops
Nate Begeman645495d2004-09-23 05:31:33 +00003820 unsigned indexReg = 0;
Misha Brukmanb097f212004-07-26 18:13:24 +00003821 for(std::vector<CollapsedGepOp>::iterator cgo_i = ops.begin(),
Misha Brukmane2eceb52004-07-23 16:08:20 +00003822 cgo_e = ops.end(); cgo_i != cgo_e; ++cgo_i) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003823 CollapsedGepOp& cgo = *cgo_i;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003824
Nate Begeman8531f6f2004-11-19 02:06:40 +00003825 // Avoid emitting known move instructions here for the register allocator
3826 // to deal with later. val * 1 == val. val + 0 == val.
3827 unsigned TmpReg1;
3828 if (cgo.size->getValue() == 1) {
3829 TmpReg1 = getReg(cgo.index, MBB, IP);
3830 } else {
3831 TmpReg1 = makeAnotherReg(Type::IntTy);
3832 doMultiplyConst(MBB, IP, TmpReg1, cgo.index, cgo.size);
3833 }
3834
3835 unsigned TmpReg2;
3836 if (cgo.offset->isNullValue()) {
3837 TmpReg2 = TmpReg1;
3838 } else {
3839 TmpReg2 = makeAnotherReg(Type::IntTy);
3840 emitBinaryConstOperation(MBB, IP, TmpReg1, cgo.offset, 0, TmpReg2);
3841 }
Nate Begeman645495d2004-09-23 05:31:33 +00003842
3843 if (indexReg == 0)
3844 indexReg = TmpReg2;
3845 else {
3846 unsigned TmpReg3 = makeAnotherReg(Type::IntTy);
3847 BuildMI(*MBB, IP, PPC::ADD, 2, TmpReg3).addReg(indexReg).addReg(TmpReg2);
3848 indexReg = TmpReg3;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003849 }
Misha Brukman2fec9902004-06-21 20:22:03 +00003850 }
Nate Begeman645495d2004-09-23 05:31:33 +00003851
3852 // We now have a base register, an index register, and possibly a constant
3853 // remainder. If the GEP is going to be folded, we try to generate the
3854 // optimal addressing mode.
Misha Brukmane2eceb52004-07-23 16:08:20 +00003855 ConstantSInt *remainder = ConstantSInt::get(Type::IntTy, constValue);
3856
Misha Brukmanb097f212004-07-26 18:13:24 +00003857 // If we are emitting this during a fold, copy the current base register to
3858 // the target, and save the current constant offset so the folding load or
3859 // store can try and use it as an immediate.
3860 if (GEPIsFolded) {
Nate Begeman645495d2004-09-23 05:31:33 +00003861 if (indexReg == 0) {
Nate Begemanb816f022004-10-07 22:30:03 +00003862 if (!canUseAsImmediateForOpcode(remainder, 0, false)) {
Nate Begeman645495d2004-09-23 05:31:33 +00003863 indexReg = getReg(remainder, MBB, IP);
3864 remainder = 0;
Nate Begemanb64af912004-08-10 20:42:36 +00003865 }
Nate Begemanbc3a5372004-11-19 08:01:16 +00003866 } else if (!remainder->isNullValue()) {
Nate Begeman645495d2004-09-23 05:31:33 +00003867 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Nate Begemanb816f022004-10-07 22:30:03 +00003868 emitBinaryConstOperation(MBB, IP, indexReg, remainder, 0, TmpReg);
Nate Begeman645495d2004-09-23 05:31:33 +00003869 indexReg = TmpReg;
3870 remainder = 0;
Nate Begemanb64af912004-08-10 20:42:36 +00003871 }
Nate Begemandb869aa2004-11-18 07:22:46 +00003872 unsigned basePtrReg = getReg(Src, MBB, IP);
3873 GEPMap[GEPI] = FoldedGEP(basePtrReg, indexReg, remainder);
Misha Brukmanb097f212004-07-26 18:13:24 +00003874 return;
3875 }
Nate Begemanb64af912004-08-10 20:42:36 +00003876
Nate Begeman645495d2004-09-23 05:31:33 +00003877 // We're not folding, so collapse the base, index, and any remainder into the
3878 // destination register.
Nate Begemandb869aa2004-11-18 07:22:46 +00003879 unsigned TargetReg = getReg(GEPI, MBB, IP);
3880 unsigned basePtrReg = getReg(Src, MBB, IP);
Nate Begemanbc3a5372004-11-19 08:01:16 +00003881
Nate Begeman486ebfd2004-11-21 05:14:06 +00003882 if ((indexReg == 0) && remainder->isNullValue()) {
3883 BuildMI(*MBB, IP, PPC::OR, 2, TargetReg).addReg(basePtrReg)
3884 .addReg(basePtrReg);
3885 return;
3886 }
Nate Begemanbc3a5372004-11-19 08:01:16 +00003887 if (!remainder->isNullValue()) {
3888 unsigned TmpReg = (indexReg == 0) ? TargetReg : makeAnotherReg(Type::IntTy);
3889 emitBinaryConstOperation(MBB, IP, basePtrReg, remainder, 0, TmpReg);
Nate Begemanb64af912004-08-10 20:42:36 +00003890 basePtrReg = TmpReg;
3891 }
Nate Begeman486ebfd2004-11-21 05:14:06 +00003892 if (indexReg != 0)
Nate Begemanbc3a5372004-11-19 08:01:16 +00003893 BuildMI(*MBB, IP, PPC::ADD, 2, TargetReg).addReg(indexReg)
3894 .addReg(basePtrReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003895}
3896
3897/// visitAllocaInst - If this is a fixed size alloca, allocate space from the
3898/// frame manager, otherwise do it the hard way.
3899///
Misha Brukmana1dca552004-09-21 18:22:19 +00003900void PPC32ISel::visitAllocaInst(AllocaInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003901 // If this is a fixed size alloca in the entry block for the function, we
3902 // statically stack allocate the space, so we don't need to do anything here.
3903 //
3904 if (dyn_castFixedAlloca(&I)) return;
3905
3906 // Find the data size of the alloca inst's getAllocatedType.
3907 const Type *Ty = I.getAllocatedType();
3908 unsigned TySize = TM.getTargetData().getTypeSize(Ty);
3909
3910 // Create a register to hold the temporary result of multiplying the type size
3911 // constant by the variable amount.
3912 unsigned TotalSizeReg = makeAnotherReg(Type::UIntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003913
3914 // TotalSizeReg = mul <numelements>, <TypeSize>
3915 MachineBasicBlock::iterator MBBI = BB->end();
Misha Brukman1013ef52004-07-21 20:09:08 +00003916 ConstantUInt *CUI = ConstantUInt::get(Type::UIntTy, TySize);
3917 doMultiplyConst(BB, MBBI, TotalSizeReg, I.getArraySize(), CUI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003918
3919 // AddedSize = add <TotalSizeReg>, 15
3920 unsigned AddedSizeReg = makeAnotherReg(Type::UIntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003921 BuildMI(BB, PPC::ADDI, 2, AddedSizeReg).addReg(TotalSizeReg).addSImm(15);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003922
3923 // AlignedSize = and <AddedSize>, ~15
3924 unsigned AlignedSize = makeAnotherReg(Type::UIntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003925 BuildMI(BB, PPC::RLWINM, 4, AlignedSize).addReg(AddedSizeReg).addImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00003926 .addImm(0).addImm(27);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003927
3928 // Subtract size from stack pointer, thereby allocating some space.
Nate Begemanf70b5762005-03-28 23:08:54 +00003929 BuildMI(BB, PPC::SUBF, 2, PPC::R1).addReg(AlignedSize).addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003930
3931 // Put a pointer to the space into the result register, by copying
3932 // the stack pointer.
Misha Brukman5b570812004-08-10 22:47:03 +00003933 BuildMI(BB, PPC::OR, 2, getReg(I)).addReg(PPC::R1).addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003934
3935 // Inform the Frame Information that we have just allocated a variable-sized
3936 // object.
3937 F->getFrameInfo()->CreateVariableSizedObject();
3938}
3939
3940/// visitMallocInst - Malloc instructions are code generated into direct calls
3941/// to the library malloc.
3942///
Misha Brukmana1dca552004-09-21 18:22:19 +00003943void PPC32ISel::visitMallocInst(MallocInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003944 unsigned AllocSize = TM.getTargetData().getTypeSize(I.getAllocatedType());
3945 unsigned Arg;
3946
3947 if (ConstantUInt *C = dyn_cast<ConstantUInt>(I.getOperand(0))) {
3948 Arg = getReg(ConstantUInt::get(Type::UIntTy, C->getValue() * AllocSize));
3949 } else {
3950 Arg = makeAnotherReg(Type::UIntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003951 MachineBasicBlock::iterator MBBI = BB->end();
Misha Brukman1013ef52004-07-21 20:09:08 +00003952 ConstantUInt *CUI = ConstantUInt::get(Type::UIntTy, AllocSize);
3953 doMultiplyConst(BB, MBBI, Arg, I.getOperand(0), CUI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003954 }
3955
3956 std::vector<ValueRecord> Args;
3957 Args.push_back(ValueRecord(Arg, Type::UIntTy));
Misha Brukman2fec9902004-06-21 20:22:03 +00003958 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003959 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(mallocFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003960 doCall(ValueRecord(getReg(I), I.getType()), TheCall, Args, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003961}
3962
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003963/// visitFreeInst - Free instructions are code gen'd to call the free libc
3964/// function.
3965///
Misha Brukmana1dca552004-09-21 18:22:19 +00003966void PPC32ISel::visitFreeInst(FreeInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003967 std::vector<ValueRecord> Args;
3968 Args.push_back(ValueRecord(I.getOperand(0)));
Misha Brukman2fec9902004-06-21 20:22:03 +00003969 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003970 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(freeFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003971 doCall(ValueRecord(0, Type::VoidTy), TheCall, Args, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003972}
3973
Misha Brukman3d9a6c22004-08-11 00:09:42 +00003974/// createPPC32ISelSimple - This pass converts an LLVM function into a machine
3975/// code representation is a very simple peep-hole fashion.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003976///
Misha Brukman3d9a6c22004-08-11 00:09:42 +00003977FunctionPass *llvm::createPPC32ISelSimple(TargetMachine &TM) {
Misha Brukmana1dca552004-09-21 18:22:19 +00003978 return new PPC32ISel(TM);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003979}