blob: 890ccb95dc6304b06c82390a458cd4624c8520f4 [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 {
Nate Begemanbdf69842004-10-08 02:49:24 +000035 Statistic<> NumClear("ppc-codegen", "Number of AND turned into mask");
Nate Begemanb816f022004-10-07 22:30:03 +000036
Misha Brukman422791f2004-06-21 17:41:12 +000037 /// TypeClass - Used by the PowerPC backend to group LLVM types by their basic
38 /// PPC Representation.
Misha Brukman5dfe3a92004-06-21 16:55:25 +000039 ///
40 enum TypeClass {
Misha Brukman7e898c32004-07-20 00:41:46 +000041 cByte, cShort, cInt, cFP32, cFP64, cLong
Misha Brukman5dfe3a92004-06-21 16:55:25 +000042 };
43}
44
45/// getClass - Turn a primitive type into a "class" number which is based on the
46/// size of the type, and whether or not it is floating point.
47///
48static inline TypeClass getClass(const Type *Ty) {
Misha Brukman358829f2004-06-21 17:25:55 +000049 switch (Ty->getTypeID()) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +000050 case Type::SByteTyID:
51 case Type::UByteTyID: return cByte; // Byte operands are class #0
52 case Type::ShortTyID:
53 case Type::UShortTyID: return cShort; // Short operands are class #1
54 case Type::IntTyID:
55 case Type::UIntTyID:
Misha Brukman2834a4d2004-07-07 20:07:22 +000056 case Type::PointerTyID: return cInt; // Ints and pointers are class #2
Misha Brukman5dfe3a92004-06-21 16:55:25 +000057
Misha Brukman7e898c32004-07-20 00:41:46 +000058 case Type::FloatTyID: return cFP32; // Single float is #3
59 case Type::DoubleTyID: return cFP64; // Double Point is #4
Misha Brukman5dfe3a92004-06-21 16:55:25 +000060
61 case Type::LongTyID:
Misha Brukman7e898c32004-07-20 00:41:46 +000062 case Type::ULongTyID: return cLong; // Longs are class #5
Misha Brukman5dfe3a92004-06-21 16:55:25 +000063 default:
64 assert(0 && "Invalid type to getClass!");
65 return cByte; // not reached
66 }
67}
68
69// getClassB - Just like getClass, but treat boolean values as ints.
70static inline TypeClass getClassB(const Type *Ty) {
Nate Begemanb73a7112004-08-13 09:32:01 +000071 if (Ty == Type::BoolTy) return cByte;
Misha Brukman5dfe3a92004-06-21 16:55:25 +000072 return getClass(Ty);
73}
74
75namespace {
Misha Brukmana1dca552004-09-21 18:22:19 +000076 struct PPC32ISel : public FunctionPass, InstVisitor<PPC32ISel> {
Misha Brukman3d9a6c22004-08-11 00:09:42 +000077 PPC32TargetMachine &TM;
Misha Brukman5dfe3a92004-06-21 16:55:25 +000078 MachineFunction *F; // The function we are compiling into
79 MachineBasicBlock *BB; // The current MBB we are compiling
80 int VarArgsFrameIndex; // FrameIndex for start of varargs area
Misha Brukmanb097f212004-07-26 18:13:24 +000081
Nate Begeman645495d2004-09-23 05:31:33 +000082 /// CollapsedGepOp - This struct is for recording the intermediate results
83 /// used to calculate the base, index, and offset of a GEP instruction.
84 struct CollapsedGepOp {
85 ConstantSInt *offset; // the current offset into the struct/array
86 Value *index; // the index of the array element
87 ConstantUInt *size; // the size of each array element
88 CollapsedGepOp(ConstantSInt *o, Value *i, ConstantUInt *s) :
89 offset(o), index(i), size(s) {}
90 };
91
92 /// FoldedGEP - This struct is for recording the necessary information to
93 /// emit the GEP in a load or store instruction, used by emitGEPOperation.
94 struct FoldedGEP {
95 unsigned base;
96 unsigned index;
97 ConstantSInt *offset;
98 FoldedGEP() : base(0), index(0), offset(0) {}
99 FoldedGEP(unsigned b, unsigned i, ConstantSInt *o) :
100 base(b), index(i), offset(o) {}
101 };
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000102
Misha Brukman2834a4d2004-07-07 20:07:22 +0000103 // External functions used in the Module
Nate Begemanb64af912004-08-10 20:42:36 +0000104 Function *fmodfFn, *fmodFn, *__cmpdi2Fn, *__moddi3Fn, *__divdi3Fn,
105 *__umoddi3Fn, *__udivdi3Fn, *__fixsfdiFn, *__fixdfdiFn, *__fixunssfdiFn,
106 *__fixunsdfdiFn, *__floatdisfFn, *__floatdidfFn, *mallocFn, *freeFn;
Misha Brukman2834a4d2004-07-07 20:07:22 +0000107
Nate Begeman645495d2004-09-23 05:31:33 +0000108 // Mapping between Values and SSA Regs
109 std::map<Value*, unsigned> RegMap;
110
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000111 // MBBMap - Mapping between LLVM BB -> Machine BB
112 std::map<const BasicBlock*, MachineBasicBlock*> MBBMap;
113
114 // AllocaMap - Mapping from fixed sized alloca instructions to the
115 // FrameIndex for the alloca.
116 std::map<AllocaInst*, unsigned> AllocaMap;
117
Nate Begeman645495d2004-09-23 05:31:33 +0000118 // GEPMap - Mapping between basic blocks and GEP definitions
119 std::map<GetElementPtrInst*, FoldedGEP> GEPMap;
120
Misha Brukmanb097f212004-07-26 18:13:24 +0000121 // A Reg to hold the base address used for global loads and stores, and a
122 // flag to set whether or not we need to emit it for this function.
123 unsigned GlobalBaseReg;
124 bool GlobalBaseInitialized;
125
Misha Brukmana1dca552004-09-21 18:22:19 +0000126 PPC32ISel(TargetMachine &tm):TM(reinterpret_cast<PPC32TargetMachine&>(tm)),
Misha Brukmane2eceb52004-07-23 16:08:20 +0000127 F(0), BB(0) {}
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000128
Misha Brukman2834a4d2004-07-07 20:07:22 +0000129 bool doInitialization(Module &M) {
Misha Brukmanb0932592004-07-07 15:36:18 +0000130 // Add external functions that we may call
Nate Begemanb64af912004-08-10 20:42:36 +0000131 Type *i = Type::IntTy;
Misha Brukman2834a4d2004-07-07 20:07:22 +0000132 Type *d = Type::DoubleTy;
Misha Brukmanf3f63822004-07-08 19:41:16 +0000133 Type *f = Type::FloatTy;
Misha Brukman2834a4d2004-07-07 20:07:22 +0000134 Type *l = Type::LongTy;
135 Type *ul = Type::ULongTy;
Misha Brukman313efcb2004-07-09 15:45:07 +0000136 Type *voidPtr = PointerType::get(Type::SByteTy);
Misha Brukman7e898c32004-07-20 00:41:46 +0000137 // float fmodf(float, float);
138 fmodfFn = M.getOrInsertFunction("fmodf", f, f, f, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000139 // double fmod(double, double);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000140 fmodFn = M.getOrInsertFunction("fmod", d, d, d, 0);
Nate Begemanb64af912004-08-10 20:42:36 +0000141 // int __cmpdi2(long, long);
142 __cmpdi2Fn = M.getOrInsertFunction("__cmpdi2", i, l, l, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000143 // long __moddi3(long, long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000144 __moddi3Fn = M.getOrInsertFunction("__moddi3", l, l, l, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000145 // long __divdi3(long, long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000146 __divdi3Fn = M.getOrInsertFunction("__divdi3", l, l, l, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000147 // unsigned long __umoddi3(unsigned long, unsigned long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000148 __umoddi3Fn = M.getOrInsertFunction("__umoddi3", ul, ul, ul, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000149 // unsigned long __udivdi3(unsigned long, unsigned long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000150 __udivdi3Fn = M.getOrInsertFunction("__udivdi3", ul, ul, ul, 0);
Misha Brukman7e898c32004-07-20 00:41:46 +0000151 // long __fixsfdi(float)
Nate Begemanb64af912004-08-10 20:42:36 +0000152 __fixsfdiFn = M.getOrInsertFunction("__fixsfdi", l, f, 0);
Misha Brukmanf3f63822004-07-08 19:41:16 +0000153 // long __fixdfdi(double)
154 __fixdfdiFn = M.getOrInsertFunction("__fixdfdi", l, d, 0);
Nate Begemanb64af912004-08-10 20:42:36 +0000155 // unsigned long __fixunssfdi(float)
156 __fixunssfdiFn = M.getOrInsertFunction("__fixunssfdi", ul, f, 0);
157 // unsigned long __fixunsdfdi(double)
158 __fixunsdfdiFn = M.getOrInsertFunction("__fixunsdfdi", ul, d, 0);
Misha Brukmanf3f63822004-07-08 19:41:16 +0000159 // float __floatdisf(long)
160 __floatdisfFn = M.getOrInsertFunction("__floatdisf", f, l, 0);
161 // double __floatdidf(long)
162 __floatdidfFn = M.getOrInsertFunction("__floatdidf", d, l, 0);
Misha Brukman313efcb2004-07-09 15:45:07 +0000163 // void* malloc(size_t)
164 mallocFn = M.getOrInsertFunction("malloc", voidPtr, Type::UIntTy, 0);
165 // void free(void*)
166 freeFn = M.getOrInsertFunction("free", Type::VoidTy, voidPtr, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000167 return false;
168 }
Misha Brukmand18a31d2004-07-06 22:51:53 +0000169
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000170 /// runOnFunction - Top level implementation of instruction selection for
171 /// the entire function.
172 ///
173 bool runOnFunction(Function &Fn) {
174 // First pass over the function, lower any unknown intrinsic functions
175 // with the IntrinsicLowering class.
176 LowerUnknownIntrinsicFunctionCalls(Fn);
177
178 F = &MachineFunction::construct(&Fn, TM);
179
180 // Create all of the machine basic blocks for the function...
181 for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I)
182 F->getBasicBlockList().push_back(MBBMap[I] = new MachineBasicBlock(I));
183
184 BB = &F->front();
185
Misha Brukmanb097f212004-07-26 18:13:24 +0000186 // Make sure we re-emit a set of the global base reg if necessary
187 GlobalBaseInitialized = false;
188
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000189 // Copy incoming arguments off of the stack...
190 LoadArgumentsToVirtualRegs(Fn);
191
192 // Instruction select everything except PHI nodes
193 visit(Fn);
194
195 // Select the PHI nodes
196 SelectPHINodes();
197
Nate Begeman645495d2004-09-23 05:31:33 +0000198 GEPMap.clear();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000199 RegMap.clear();
200 MBBMap.clear();
201 AllocaMap.clear();
202 F = 0;
203 // We always build a machine code representation for the function
204 return true;
205 }
206
207 virtual const char *getPassName() const {
208 return "PowerPC Simple Instruction Selection";
209 }
210
211 /// visitBasicBlock - This method is called when we are visiting a new basic
212 /// block. This simply creates a new MachineBasicBlock to emit code into
213 /// and adds it to the current MachineFunction. Subsequent visit* for
214 /// instructions will be invoked for all instructions in the basic block.
215 ///
216 void visitBasicBlock(BasicBlock &LLVM_BB) {
217 BB = MBBMap[&LLVM_BB];
218 }
219
220 /// LowerUnknownIntrinsicFunctionCalls - This performs a prepass over the
221 /// function, lowering any calls to unknown intrinsic functions into the
222 /// equivalent LLVM code.
223 ///
224 void LowerUnknownIntrinsicFunctionCalls(Function &F);
225
226 /// LoadArgumentsToVirtualRegs - Load all of the arguments to this function
227 /// from the stack into virtual registers.
228 ///
229 void LoadArgumentsToVirtualRegs(Function &F);
230
231 /// SelectPHINodes - Insert machine code to generate phis. This is tricky
232 /// because we have to generate our sources into the source basic blocks,
233 /// not the current one.
234 ///
235 void SelectPHINodes();
236
237 // Visitation methods for various instructions. These methods simply emit
238 // fixed PowerPC code for each instruction.
239
240 // Control flow operators
241 void visitReturnInst(ReturnInst &RI);
242 void visitBranchInst(BranchInst &BI);
243
244 struct ValueRecord {
245 Value *Val;
246 unsigned Reg;
247 const Type *Ty;
248 ValueRecord(unsigned R, const Type *T) : Val(0), Reg(R), Ty(T) {}
249 ValueRecord(Value *V) : Val(V), Reg(0), Ty(V->getType()) {}
250 };
Misha Brukmanb097f212004-07-26 18:13:24 +0000251
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000252 void doCall(const ValueRecord &Ret, MachineInstr *CallMI,
Misha Brukmand18a31d2004-07-06 22:51:53 +0000253 const std::vector<ValueRecord> &Args, bool isVarArg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000254 void visitCallInst(CallInst &I);
255 void visitIntrinsicCall(Intrinsic::ID ID, CallInst &I);
256
257 // Arithmetic operators
258 void visitSimpleBinary(BinaryOperator &B, unsigned OpcodeClass);
259 void visitAdd(BinaryOperator &B) { visitSimpleBinary(B, 0); }
260 void visitSub(BinaryOperator &B) { visitSimpleBinary(B, 1); }
261 void visitMul(BinaryOperator &B);
262
263 void visitDiv(BinaryOperator &B) { visitDivRem(B); }
264 void visitRem(BinaryOperator &B) { visitDivRem(B); }
265 void visitDivRem(BinaryOperator &B);
266
267 // Bitwise operators
268 void visitAnd(BinaryOperator &B) { visitSimpleBinary(B, 2); }
269 void visitOr (BinaryOperator &B) { visitSimpleBinary(B, 3); }
270 void visitXor(BinaryOperator &B) { visitSimpleBinary(B, 4); }
271
272 // Comparison operators...
273 void visitSetCondInst(SetCondInst &I);
274 unsigned EmitComparison(unsigned OpNum, Value *Op0, Value *Op1,
275 MachineBasicBlock *MBB,
276 MachineBasicBlock::iterator MBBI);
277 void visitSelectInst(SelectInst &SI);
278
279
280 // Memory Instructions
281 void visitLoadInst(LoadInst &I);
282 void visitStoreInst(StoreInst &I);
283 void visitGetElementPtrInst(GetElementPtrInst &I);
284 void visitAllocaInst(AllocaInst &I);
285 void visitMallocInst(MallocInst &I);
286 void visitFreeInst(FreeInst &I);
287
288 // Other operators
289 void visitShiftInst(ShiftInst &I);
290 void visitPHINode(PHINode &I) {} // PHI nodes handled by second pass
291 void visitCastInst(CastInst &I);
292 void visitVANextInst(VANextInst &I);
293 void visitVAArgInst(VAArgInst &I);
294
295 void visitInstruction(Instruction &I) {
296 std::cerr << "Cannot instruction select: " << I;
297 abort();
298 }
299
Nate Begemanb47321b2004-08-20 09:56:22 +0000300 unsigned ExtendOrClear(MachineBasicBlock *MBB,
301 MachineBasicBlock::iterator IP,
Nate Begemana2de1022004-09-22 04:40:25 +0000302 Value *Op0);
Nate Begemanb47321b2004-08-20 09:56:22 +0000303
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000304 /// promote32 - Make a value 32-bits wide, and put it somewhere.
305 ///
306 void promote32(unsigned targetReg, const ValueRecord &VR);
307
308 /// emitGEPOperation - Common code shared between visitGetElementPtrInst and
309 /// constant expression GEP support.
310 ///
311 void emitGEPOperation(MachineBasicBlock *BB, MachineBasicBlock::iterator IP,
Nate Begeman645495d2004-09-23 05:31:33 +0000312 GetElementPtrInst *GEPI, bool foldGEP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000313
314 /// emitCastOperation - Common code shared between visitCastInst and
315 /// constant expression cast support.
316 ///
317 void emitCastOperation(MachineBasicBlock *BB,MachineBasicBlock::iterator IP,
318 Value *Src, const Type *DestTy, unsigned TargetReg);
319
Nate Begemanb816f022004-10-07 22:30:03 +0000320
321 /// emitBinaryConstOperation - Used by several functions to emit simple
322 /// arithmetic and logical operations with constants on a register rather
323 /// than a Value.
324 ///
325 void emitBinaryConstOperation(MachineBasicBlock *MBB,
326 MachineBasicBlock::iterator IP,
327 unsigned Op0Reg, ConstantInt *Op1,
328 unsigned Opcode, unsigned DestReg);
329
330 /// emitSimpleBinaryOperation - Implement simple binary operators for
331 /// integral types. OperatorClass is one of: 0 for Add, 1 for Sub,
332 /// 2 for And, 3 for Or, 4 for Xor.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000333 ///
334 void emitSimpleBinaryOperation(MachineBasicBlock *BB,
335 MachineBasicBlock::iterator IP,
336 Value *Op0, Value *Op1,
337 unsigned OperatorClass, unsigned TargetReg);
338
339 /// emitBinaryFPOperation - This method handles emission of floating point
340 /// Add (0), Sub (1), Mul (2), and Div (3) operations.
341 void emitBinaryFPOperation(MachineBasicBlock *BB,
342 MachineBasicBlock::iterator IP,
343 Value *Op0, Value *Op1,
344 unsigned OperatorClass, unsigned TargetReg);
345
346 void emitMultiply(MachineBasicBlock *BB, MachineBasicBlock::iterator IP,
347 Value *Op0, Value *Op1, unsigned TargetReg);
348
Misha Brukman1013ef52004-07-21 20:09:08 +0000349 void doMultiply(MachineBasicBlock *MBB,
350 MachineBasicBlock::iterator IP,
351 unsigned DestReg, Value *Op0, Value *Op1);
352
353 /// doMultiplyConst - This method will multiply the value in Op0Reg by the
354 /// value of the ContantInt *CI
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000355 void doMultiplyConst(MachineBasicBlock *MBB,
Misha Brukman1013ef52004-07-21 20:09:08 +0000356 MachineBasicBlock::iterator IP,
357 unsigned DestReg, Value *Op0, ConstantInt *CI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000358
359 void emitDivRemOperation(MachineBasicBlock *BB,
360 MachineBasicBlock::iterator IP,
361 Value *Op0, Value *Op1, bool isDiv,
362 unsigned TargetReg);
363
364 /// emitSetCCOperation - Common code shared between visitSetCondInst and
365 /// constant expression support.
366 ///
367 void emitSetCCOperation(MachineBasicBlock *BB,
368 MachineBasicBlock::iterator IP,
369 Value *Op0, Value *Op1, unsigned Opcode,
370 unsigned TargetReg);
371
372 /// emitShiftOperation - Common code shared between visitShiftInst and
373 /// constant expression support.
374 ///
375 void emitShiftOperation(MachineBasicBlock *MBB,
376 MachineBasicBlock::iterator IP,
377 Value *Op, Value *ShiftAmount, bool isLeftShift,
378 const Type *ResultTy, unsigned DestReg);
379
380 /// emitSelectOperation - Common code shared between visitSelectInst and the
381 /// constant expression support.
Misha Brukmanb097f212004-07-26 18:13:24 +0000382 ///
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000383 void emitSelectOperation(MachineBasicBlock *MBB,
384 MachineBasicBlock::iterator IP,
385 Value *Cond, Value *TrueVal, Value *FalseVal,
386 unsigned DestReg);
387
Misha Brukmanb097f212004-07-26 18:13:24 +0000388 /// copyGlobalBaseToRegister - Output the instructions required to put the
389 /// base address to use for accessing globals into a register.
390 ///
Misha Brukmana1dca552004-09-21 18:22:19 +0000391 void copyGlobalBaseToRegister(MachineBasicBlock *MBB,
392 MachineBasicBlock::iterator IP,
393 unsigned R);
Misha Brukmanb097f212004-07-26 18:13:24 +0000394
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000395 /// copyConstantToRegister - Output the instructions required to put the
396 /// specified constant into the specified register.
397 ///
398 void copyConstantToRegister(MachineBasicBlock *MBB,
399 MachineBasicBlock::iterator MBBI,
400 Constant *C, unsigned Reg);
401
402 void emitUCOM(MachineBasicBlock *MBB, MachineBasicBlock::iterator MBBI,
403 unsigned LHS, unsigned RHS);
404
405 /// makeAnotherReg - This method returns the next register number we haven't
406 /// yet used.
407 ///
408 /// Long values are handled somewhat specially. They are always allocated
409 /// as pairs of 32 bit integer values. The register number returned is the
Misha Brukman1013ef52004-07-21 20:09:08 +0000410 /// high 32 bits of the long value, and the regNum+1 is the low 32 bits.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000411 ///
412 unsigned makeAnotherReg(const Type *Ty) {
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000413 assert(dynamic_cast<const PPC32RegisterInfo*>(TM.getRegisterInfo()) &&
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000414 "Current target doesn't have PPC reg info??");
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000415 const PPC32RegisterInfo *PPCRI =
416 static_cast<const PPC32RegisterInfo*>(TM.getRegisterInfo());
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000417 if (Ty == Type::LongTy || Ty == Type::ULongTy) {
Nate Begemanb64af912004-08-10 20:42:36 +0000418 const TargetRegisterClass *RC = PPCRI->getRegClassForType(Type::IntTy);
419 // Create the upper part
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000420 F->getSSARegMap()->createVirtualRegister(RC);
Nate Begemanb64af912004-08-10 20:42:36 +0000421 // Create the lower part.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000422 return F->getSSARegMap()->createVirtualRegister(RC)-1;
423 }
424
425 // Add the mapping of regnumber => reg class to MachineFunction
Nate Begemanb64af912004-08-10 20:42:36 +0000426 const TargetRegisterClass *RC = PPCRI->getRegClassForType(Ty);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000427 return F->getSSARegMap()->createVirtualRegister(RC);
428 }
429
430 /// getReg - This method turns an LLVM value into a register number.
431 ///
432 unsigned getReg(Value &V) { return getReg(&V); } // Allow references
433 unsigned getReg(Value *V) {
434 // Just append to the end of the current bb.
435 MachineBasicBlock::iterator It = BB->end();
436 return getReg(V, BB, It);
437 }
438 unsigned getReg(Value *V, MachineBasicBlock *MBB,
439 MachineBasicBlock::iterator IPt);
Misha Brukman1013ef52004-07-21 20:09:08 +0000440
441 /// canUseAsImmediateForOpcode - This method returns whether a ConstantInt
442 /// is okay to use as an immediate argument to a certain binary operation
Nate Begemanb816f022004-10-07 22:30:03 +0000443 bool canUseAsImmediateForOpcode(ConstantInt *CI, unsigned Opcode,
444 bool Shifted);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000445
446 /// getFixedSizedAllocaFI - Return the frame index for a fixed sized alloca
447 /// that is to be statically allocated with the initial stack frame
448 /// adjustment.
449 unsigned getFixedSizedAllocaFI(AllocaInst *AI);
450 };
451}
452
453/// dyn_castFixedAlloca - If the specified value is a fixed size alloca
454/// instruction in the entry block, return it. Otherwise, return a null
455/// pointer.
456static AllocaInst *dyn_castFixedAlloca(Value *V) {
457 if (AllocaInst *AI = dyn_cast<AllocaInst>(V)) {
458 BasicBlock *BB = AI->getParent();
459 if (isa<ConstantUInt>(AI->getArraySize()) && BB ==&BB->getParent()->front())
460 return AI;
461 }
462 return 0;
463}
464
465/// getReg - This method turns an LLVM value into a register number.
466///
Misha Brukmana1dca552004-09-21 18:22:19 +0000467unsigned PPC32ISel::getReg(Value *V, MachineBasicBlock *MBB,
468 MachineBasicBlock::iterator IPt) {
Misha Brukmanba1c1da2004-07-20 00:59:38 +0000469 if (Constant *C = dyn_cast<Constant>(V)) {
Chris Lattnera51e4f62004-07-18 18:45:01 +0000470 unsigned Reg = makeAnotherReg(V->getType());
471 copyConstantToRegister(MBB, IPt, C, Reg);
472 return Reg;
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000473 } else if (AllocaInst *AI = dyn_castFixedAlloca(V)) {
474 unsigned Reg = makeAnotherReg(V->getType());
475 unsigned FI = getFixedSizedAllocaFI(AI);
Misha Brukman5b570812004-08-10 22:47:03 +0000476 addFrameReference(BuildMI(*MBB, IPt, PPC::ADDI, 2, Reg), FI, 0, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000477 return Reg;
478 }
479
480 unsigned &Reg = RegMap[V];
481 if (Reg == 0) {
482 Reg = makeAnotherReg(V->getType());
483 RegMap[V] = Reg;
484 }
485
486 return Reg;
487}
488
Misha Brukman1013ef52004-07-21 20:09:08 +0000489/// canUseAsImmediateForOpcode - This method returns whether a ConstantInt
490/// is okay to use as an immediate argument to a certain binary operator.
Nate Begemanb816f022004-10-07 22:30:03 +0000491/// The shifted argument determines if the immediate is suitable to be used with
492/// the PowerPC instructions such as addis which concatenate 16 bits of the
493/// immediate with 16 bits of zeroes.
Misha Brukman1013ef52004-07-21 20:09:08 +0000494///
Nate Begemanb816f022004-10-07 22:30:03 +0000495bool PPC32ISel::canUseAsImmediateForOpcode(ConstantInt *CI, unsigned Opcode,
496 bool Shifted) {
Misha Brukman1013ef52004-07-21 20:09:08 +0000497 ConstantSInt *Op1Cs;
498 ConstantUInt *Op1Cu;
Nate Begemanb816f022004-10-07 22:30:03 +0000499
500 // For shifted immediates, any value with the low halfword cleared may be used
501 if (Shifted) {
Nate Begemanbdf69842004-10-08 02:49:24 +0000502 if (((int32_t)CI->getRawValue() & 0x0000FFFF) == 0)
Nate Begemanb816f022004-10-07 22:30:03 +0000503 return true;
Nate Begemanbdf69842004-10-08 02:49:24 +0000504 else
505 return false;
Nate Begemanb816f022004-10-07 22:30:03 +0000506 }
Misha Brukman1013ef52004-07-21 20:09:08 +0000507
508 // ADDI, Compare, and non-indexed Load take SIMM
Nate Begemanb816f022004-10-07 22:30:03 +0000509 bool cond1 = (Opcode < 2)
Nate Begemana41fc772004-09-29 02:35:05 +0000510 && ((int32_t)CI->getRawValue() <= 32767)
511 && ((int32_t)CI->getRawValue() >= -32768);
Misha Brukman1013ef52004-07-21 20:09:08 +0000512
Misha Brukman1013ef52004-07-21 20:09:08 +0000513 // ANDIo, ORI, and XORI take unsigned values
Nate Begemanb816f022004-10-07 22:30:03 +0000514 bool cond2 = (Opcode >= 2)
Misha Brukman2ed17ca2004-07-22 15:58:04 +0000515 && (Op1Cs = dyn_cast<ConstantSInt>(CI))
516 && (Op1Cs->getValue() >= 0)
Nate Begemana41fc772004-09-29 02:35:05 +0000517 && (Op1Cs->getValue() <= 65535);
Misha Brukman1013ef52004-07-21 20:09:08 +0000518
519 // ANDIo, ORI, and XORI take UIMMs, so they can be larger
Nate Begemanb816f022004-10-07 22:30:03 +0000520 bool cond3 = (Opcode >= 2)
Misha Brukman17a90002004-07-21 20:22:06 +0000521 && (Op1Cu = dyn_cast<ConstantUInt>(CI))
522 && (Op1Cu->getValue() <= 65535);
Misha Brukman1013ef52004-07-21 20:09:08 +0000523
Nate Begemanb816f022004-10-07 22:30:03 +0000524 if (cond1 || cond2 || cond3)
Misha Brukman1013ef52004-07-21 20:09:08 +0000525 return true;
526
527 return false;
528}
529
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000530/// getFixedSizedAllocaFI - Return the frame index for a fixed sized alloca
531/// that is to be statically allocated with the initial stack frame
532/// adjustment.
Misha Brukmana1dca552004-09-21 18:22:19 +0000533unsigned PPC32ISel::getFixedSizedAllocaFI(AllocaInst *AI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000534 // Already computed this?
535 std::map<AllocaInst*, unsigned>::iterator I = AllocaMap.lower_bound(AI);
536 if (I != AllocaMap.end() && I->first == AI) return I->second;
537
538 const Type *Ty = AI->getAllocatedType();
539 ConstantUInt *CUI = cast<ConstantUInt>(AI->getArraySize());
540 unsigned TySize = TM.getTargetData().getTypeSize(Ty);
541 TySize *= CUI->getValue(); // Get total allocated size...
542 unsigned Alignment = TM.getTargetData().getTypeAlignment(Ty);
543
544 // Create a new stack object using the frame manager...
545 int FrameIdx = F->getFrameInfo()->CreateStackObject(TySize, Alignment);
546 AllocaMap.insert(I, std::make_pair(AI, FrameIdx));
547 return FrameIdx;
548}
549
550
Misha Brukmanb097f212004-07-26 18:13:24 +0000551/// copyGlobalBaseToRegister - Output the instructions required to put the
552/// base address to use for accessing globals into a register.
553///
Misha Brukmana1dca552004-09-21 18:22:19 +0000554void PPC32ISel::copyGlobalBaseToRegister(MachineBasicBlock *MBB,
555 MachineBasicBlock::iterator IP,
556 unsigned R) {
Misha Brukmanb097f212004-07-26 18:13:24 +0000557 if (!GlobalBaseInitialized) {
558 // Insert the set of GlobalBaseReg into the first MBB of the function
559 MachineBasicBlock &FirstMBB = F->front();
560 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
561 GlobalBaseReg = makeAnotherReg(Type::IntTy);
Nate Begemanb7a8f2c2004-09-02 08:13:00 +0000562 BuildMI(FirstMBB, MBBI, PPC::MovePCtoLR, 0, PPC::LR);
Nate Begemanda721e72004-09-27 05:08:17 +0000563 BuildMI(FirstMBB, MBBI, PPC::MFLR, 1, GlobalBaseReg).addReg(PPC::LR);
Misha Brukmanb097f212004-07-26 18:13:24 +0000564 GlobalBaseInitialized = true;
565 }
566 // Emit our copy of GlobalBaseReg to the destination register in the
567 // current MBB
Misha Brukman5b570812004-08-10 22:47:03 +0000568 BuildMI(*MBB, IP, PPC::OR, 2, R).addReg(GlobalBaseReg)
Misha Brukmanb097f212004-07-26 18:13:24 +0000569 .addReg(GlobalBaseReg);
570}
571
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000572/// copyConstantToRegister - Output the instructions required to put the
573/// specified constant into the specified register.
574///
Misha Brukmana1dca552004-09-21 18:22:19 +0000575void PPC32ISel::copyConstantToRegister(MachineBasicBlock *MBB,
576 MachineBasicBlock::iterator IP,
577 Constant *C, unsigned R) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000578 if (C->getType()->isIntegral()) {
579 unsigned Class = getClassB(C->getType());
580
581 if (Class == cLong) {
Misha Brukmana0af38c2004-07-28 19:13:49 +0000582 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(C)) {
583 uint64_t uval = CUI->getValue();
584 unsigned hiUVal = uval >> 32;
585 unsigned loUVal = uval;
586 ConstantUInt *CUHi = ConstantUInt::get(Type::UIntTy, hiUVal);
587 ConstantUInt *CULo = ConstantUInt::get(Type::UIntTy, loUVal);
588 copyConstantToRegister(MBB, IP, CUHi, R);
589 copyConstantToRegister(MBB, IP, CULo, R+1);
590 return;
591 } else if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(C)) {
592 int64_t sval = CSI->getValue();
593 int hiSVal = sval >> 32;
594 int loSVal = sval;
595 ConstantSInt *CSHi = ConstantSInt::get(Type::IntTy, hiSVal);
596 ConstantSInt *CSLo = ConstantSInt::get(Type::IntTy, loSVal);
597 copyConstantToRegister(MBB, IP, CSHi, R);
598 copyConstantToRegister(MBB, IP, CSLo, R+1);
599 return;
Misha Brukman7e898c32004-07-20 00:41:46 +0000600 } else {
Misha Brukmana0af38c2004-07-28 19:13:49 +0000601 std::cerr << "Unhandled long constant type!\n";
602 abort();
603 }
604 }
605
606 assert(Class <= cInt && "Type not handled yet!");
607
608 // Handle bool
609 if (C->getType() == Type::BoolTy) {
Misha Brukman5b570812004-08-10 22:47:03 +0000610 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(C == ConstantBool::True);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000611 return;
612 }
613
614 // Handle int
615 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(C)) {
616 unsigned uval = CUI->getValue();
617 if (uval < 32768) {
Misha Brukman5b570812004-08-10 22:47:03 +0000618 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(uval);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000619 } else {
620 unsigned Temp = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +0000621 BuildMI(*MBB, IP, PPC::LIS, 1, Temp).addSImm(uval >> 16);
Nate Begemanb816f022004-10-07 22:30:03 +0000622 BuildMI(*MBB, IP, PPC::ORI, 2, R).addReg(Temp).addImm(uval & 0xFFFF);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000623 }
624 return;
625 } else if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(C)) {
626 int sval = CSI->getValue();
627 if (sval < 32768 && sval >= -32768) {
Misha Brukman5b570812004-08-10 22:47:03 +0000628 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(sval);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000629 } else {
630 unsigned Temp = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +0000631 BuildMI(*MBB, IP, PPC::LIS, 1, Temp).addSImm(sval >> 16);
Nate Begemanb816f022004-10-07 22:30:03 +0000632 BuildMI(*MBB, IP, PPC::ORI, 2, R).addReg(Temp).addImm(sval & 0xFFFF);
Misha Brukman7e898c32004-07-20 00:41:46 +0000633 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000634 return;
635 }
Misha Brukmana0af38c2004-07-28 19:13:49 +0000636 std::cerr << "Unhandled integer constant!\n";
637 abort();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000638 } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) {
Misha Brukmand18a31d2004-07-06 22:51:53 +0000639 // We need to spill the constant to memory...
640 MachineConstantPool *CP = F->getConstantPool();
641 unsigned CPI = CP->getConstantPoolIndex(CFP);
642 const Type *Ty = CFP->getType();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000643
Misha Brukmand18a31d2004-07-06 22:51:53 +0000644 assert(Ty == Type::FloatTy || Ty == Type::DoubleTy && "Unknown FP type!");
Misha Brukmanfc879c32004-07-08 18:02:38 +0000645
Misha Brukmanb097f212004-07-26 18:13:24 +0000646 // Load addr of constant to reg; constant is located at base + distance
647 unsigned GlobalBase = makeAnotherReg(Type::IntTy);
Misha Brukmanfc879c32004-07-08 18:02:38 +0000648 unsigned Reg1 = makeAnotherReg(Type::IntTy);
Nate Begeman07a73752004-08-17 07:17:44 +0000649 unsigned Opcode = (Ty == Type::FloatTy) ? PPC::LFS : PPC::LFD;
Misha Brukmanb097f212004-07-26 18:13:24 +0000650 // Move value at base + distance into return reg
651 copyGlobalBaseToRegister(MBB, IP, GlobalBase);
Misha Brukman5b570812004-08-10 22:47:03 +0000652 BuildMI(*MBB, IP, PPC::LOADHiAddr, 2, Reg1).addReg(GlobalBase)
Misha Brukmanfc879c32004-07-08 18:02:38 +0000653 .addConstantPoolIndex(CPI);
Nate Begemaned428532004-09-04 05:00:00 +0000654 BuildMI(*MBB, IP, Opcode, 2, R).addConstantPoolIndex(CPI).addReg(Reg1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000655 } else if (isa<ConstantPointerNull>(C)) {
656 // Copy zero (null pointer) to the register.
Misha Brukman5b570812004-08-10 22:47:03 +0000657 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(0);
Chris Lattner67910e12004-07-18 07:29:35 +0000658 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) {
Misha Brukmanb097f212004-07-26 18:13:24 +0000659 // GV is located at base + distance
Nate Begemaned428532004-09-04 05:00:00 +0000660
Misha Brukmanb097f212004-07-26 18:13:24 +0000661 unsigned GlobalBase = makeAnotherReg(Type::IntTy);
Misha Brukmanba1c1da2004-07-20 00:59:38 +0000662 unsigned TmpReg = makeAnotherReg(GV->getType());
Nate Begeman81d265d2004-08-19 05:20:54 +0000663 unsigned Opcode = (GV->hasWeakLinkage()
664 || GV->isExternal()
665 || dyn_cast<Function>(GV)) ? PPC::LWZ : PPC::LA;
Misha Brukmanb097f212004-07-26 18:13:24 +0000666
667 // Move value at base + distance into return reg
668 copyGlobalBaseToRegister(MBB, IP, GlobalBase);
Misha Brukman5b570812004-08-10 22:47:03 +0000669 BuildMI(*MBB, IP, PPC::LOADHiAddr, 2, TmpReg).addReg(GlobalBase)
Misha Brukmanba1c1da2004-07-20 00:59:38 +0000670 .addGlobalAddress(GV);
Nate Begemaned428532004-09-04 05:00:00 +0000671 BuildMI(*MBB, IP, Opcode, 2, R).addGlobalAddress(GV).addReg(TmpReg);
Misha Brukmane2eceb52004-07-23 16:08:20 +0000672
673 // Add the GV to the list of things whose addresses have been taken.
674 TM.AddressTaken.insert(GV);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000675 } else {
Chris Lattner76e2df22004-07-15 02:14:30 +0000676 std::cerr << "Offending constant: " << *C << "\n";
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000677 assert(0 && "Type not handled yet!");
678 }
679}
680
681/// LoadArgumentsToVirtualRegs - Load all of the arguments to this function from
682/// the stack into virtual registers.
Misha Brukmana1dca552004-09-21 18:22:19 +0000683void PPC32ISel::LoadArgumentsToVirtualRegs(Function &Fn) {
Chris Lattner3ea93462004-08-06 06:58:50 +0000684 unsigned ArgOffset = 24;
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000685 unsigned GPR_remaining = 8;
686 unsigned FPR_remaining = 13;
Misha Brukmand18a31d2004-07-06 22:51:53 +0000687 unsigned GPR_idx = 0, FPR_idx = 0;
688 static const unsigned GPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +0000689 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
690 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
Misha Brukmand18a31d2004-07-06 22:51:53 +0000691 };
692 static const unsigned FPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +0000693 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
694 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
Misha Brukmand18a31d2004-07-06 22:51:53 +0000695 };
Misha Brukman422791f2004-06-21 17:41:12 +0000696
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000697 MachineFrameInfo *MFI = F->getFrameInfo();
Misha Brukmand18a31d2004-07-06 22:51:53 +0000698
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000699 for (Function::aiterator I = Fn.abegin(), E = Fn.aend(); I != E; ++I) {
700 bool ArgLive = !I->use_empty();
701 unsigned Reg = ArgLive ? getReg(*I) : 0;
702 int FI; // Frame object index
703
704 switch (getClassB(I->getType())) {
705 case cByte:
706 if (ArgLive) {
Misha Brukmanec6319a2004-07-20 15:51:37 +0000707 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000708 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000709 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]);
710 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000711 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000712 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000713 addFrameReference(BuildMI(BB, PPC::LBZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000714 }
715 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000716 break;
717 case cShort:
718 if (ArgLive) {
Misha Brukmanec6319a2004-07-20 15:51:37 +0000719 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000720 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000721 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]);
722 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000723 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000724 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000725 addFrameReference(BuildMI(BB, PPC::LHZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000726 }
727 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000728 break;
729 case cInt:
730 if (ArgLive) {
731 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000732 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000733 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]);
734 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000735 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000736 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000737 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000738 }
739 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000740 break;
741 case cLong:
742 if (ArgLive) {
743 FI = MFI->CreateFixedObject(8, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000744 if (GPR_remaining > 1) {
Misha Brukman5b570812004-08-10 22:47:03 +0000745 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]);
746 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx+1]);
747 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukman313efcb2004-07-09 15:45:07 +0000748 .addReg(GPR[GPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000749 BuildMI(BB, PPC::OR, 2, Reg+1).addReg(GPR[GPR_idx+1])
Misha Brukman313efcb2004-07-09 15:45:07 +0000750 .addReg(GPR[GPR_idx+1]);
Misha Brukman422791f2004-06-21 17:41:12 +0000751 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000752 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg), FI);
753 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg+1), FI, 4);
Misha Brukman422791f2004-06-21 17:41:12 +0000754 }
755 }
Misha Brukman1013ef52004-07-21 20:09:08 +0000756 // longs require 4 additional bytes and use 2 GPRs
757 ArgOffset += 4;
Misha Brukman422791f2004-06-21 17:41:12 +0000758 if (GPR_remaining > 1) {
Misha Brukman1013ef52004-07-21 20:09:08 +0000759 GPR_remaining--;
Misha Brukman422791f2004-06-21 17:41:12 +0000760 GPR_idx++;
761 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000762 break;
Misha Brukman7e898c32004-07-20 00:41:46 +0000763 case cFP32:
764 if (ArgLive) {
765 FI = MFI->CreateFixedObject(4, ArgOffset);
766
Misha Brukman422791f2004-06-21 17:41:12 +0000767 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000768 BuildMI(BB, PPC::IMPLICIT_DEF, 0, FPR[FPR_idx]);
769 BuildMI(BB, PPC::FMR, 1, Reg).addReg(FPR[FPR_idx]);
Misha Brukmand18a31d2004-07-06 22:51:53 +0000770 FPR_remaining--;
771 FPR_idx++;
Misha Brukman422791f2004-06-21 17:41:12 +0000772 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000773 addFrameReference(BuildMI(BB, PPC::LFS, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000774 }
775 }
Misha Brukman7e898c32004-07-20 00:41:46 +0000776 break;
777 case cFP64:
778 if (ArgLive) {
779 FI = MFI->CreateFixedObject(8, ArgOffset);
780
781 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000782 BuildMI(BB, PPC::IMPLICIT_DEF, 0, FPR[FPR_idx]);
783 BuildMI(BB, PPC::FMR, 1, Reg).addReg(FPR[FPR_idx]);
Misha Brukman7e898c32004-07-20 00:41:46 +0000784 FPR_remaining--;
785 FPR_idx++;
786 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000787 addFrameReference(BuildMI(BB, PPC::LFD, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000788 }
789 }
Misha Brukman7e898c32004-07-20 00:41:46 +0000790
791 // doubles require 4 additional bytes and use 2 GPRs of param space
792 ArgOffset += 4;
793 if (GPR_remaining > 0) {
794 GPR_remaining--;
795 GPR_idx++;
796 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000797 break;
798 default:
799 assert(0 && "Unhandled argument type!");
800 }
801 ArgOffset += 4; // Each argument takes at least 4 bytes on the stack...
Misha Brukman422791f2004-06-21 17:41:12 +0000802 if (GPR_remaining > 0) {
Misha Brukmand18a31d2004-07-06 22:51:53 +0000803 GPR_remaining--; // uses up 2 GPRs
804 GPR_idx++;
Misha Brukman422791f2004-06-21 17:41:12 +0000805 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000806 }
807
808 // If the function takes variable number of arguments, add a frame offset for
809 // the start of the first vararg value... this is used to expand
810 // llvm.va_start.
811 if (Fn.getFunctionType()->isVarArg())
Misha Brukmanb097f212004-07-26 18:13:24 +0000812 VarArgsFrameIndex = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000813}
814
815
816/// SelectPHINodes - Insert machine code to generate phis. This is tricky
817/// because we have to generate our sources into the source basic blocks, not
818/// the current one.
819///
Misha Brukmana1dca552004-09-21 18:22:19 +0000820void PPC32ISel::SelectPHINodes() {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000821 const TargetInstrInfo &TII = *TM.getInstrInfo();
822 const Function &LF = *F->getFunction(); // The LLVM function...
823 for (Function::const_iterator I = LF.begin(), E = LF.end(); I != E; ++I) {
824 const BasicBlock *BB = I;
825 MachineBasicBlock &MBB = *MBBMap[I];
826
827 // Loop over all of the PHI nodes in the LLVM basic block...
828 MachineBasicBlock::iterator PHIInsertPoint = MBB.begin();
829 for (BasicBlock::const_iterator I = BB->begin();
830 PHINode *PN = const_cast<PHINode*>(dyn_cast<PHINode>(I)); ++I) {
831
832 // Create a new machine instr PHI node, and insert it.
833 unsigned PHIReg = getReg(*PN);
834 MachineInstr *PhiMI = BuildMI(MBB, PHIInsertPoint,
Misha Brukman5b570812004-08-10 22:47:03 +0000835 PPC::PHI, PN->getNumOperands(), PHIReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000836
837 MachineInstr *LongPhiMI = 0;
838 if (PN->getType() == Type::LongTy || PN->getType() == Type::ULongTy)
839 LongPhiMI = BuildMI(MBB, PHIInsertPoint,
Misha Brukman5b570812004-08-10 22:47:03 +0000840 PPC::PHI, PN->getNumOperands(), PHIReg+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000841
842 // PHIValues - Map of blocks to incoming virtual registers. We use this
843 // so that we only initialize one incoming value for a particular block,
844 // even if the block has multiple entries in the PHI node.
845 //
846 std::map<MachineBasicBlock*, unsigned> PHIValues;
847
848 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
Misha Brukman313efcb2004-07-09 15:45:07 +0000849 MachineBasicBlock *PredMBB = 0;
850 for (MachineBasicBlock::pred_iterator PI = MBB.pred_begin (),
851 PE = MBB.pred_end (); PI != PE; ++PI)
852 if (PN->getIncomingBlock(i) == (*PI)->getBasicBlock()) {
853 PredMBB = *PI;
854 break;
855 }
856 assert (PredMBB && "Couldn't find incoming machine-cfg edge for phi");
857
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000858 unsigned ValReg;
859 std::map<MachineBasicBlock*, unsigned>::iterator EntryIt =
860 PHIValues.lower_bound(PredMBB);
861
862 if (EntryIt != PHIValues.end() && EntryIt->first == PredMBB) {
863 // We already inserted an initialization of the register for this
864 // predecessor. Recycle it.
865 ValReg = EntryIt->second;
Misha Brukman47225442004-07-23 22:35:49 +0000866 } else {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000867 // Get the incoming value into a virtual register.
868 //
869 Value *Val = PN->getIncomingValue(i);
870
871 // If this is a constant or GlobalValue, we may have to insert code
872 // into the basic block to compute it into a virtual register.
873 if ((isa<Constant>(Val) && !isa<ConstantExpr>(Val)) ||
874 isa<GlobalValue>(Val)) {
875 // Simple constants get emitted at the end of the basic block,
876 // before any terminator instructions. We "know" that the code to
877 // move a constant into a register will never clobber any flags.
878 ValReg = getReg(Val, PredMBB, PredMBB->getFirstTerminator());
879 } else {
880 // Because we don't want to clobber any values which might be in
881 // physical registers with the computation of this constant (which
882 // might be arbitrarily complex if it is a constant expression),
883 // just insert the computation at the top of the basic block.
884 MachineBasicBlock::iterator PI = PredMBB->begin();
Misha Brukman47225442004-07-23 22:35:49 +0000885
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000886 // Skip over any PHI nodes though!
Misha Brukman5b570812004-08-10 22:47:03 +0000887 while (PI != PredMBB->end() && PI->getOpcode() == PPC::PHI)
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000888 ++PI;
Misha Brukman47225442004-07-23 22:35:49 +0000889
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000890 ValReg = getReg(Val, PredMBB, PI);
891 }
892
893 // Remember that we inserted a value for this PHI for this predecessor
894 PHIValues.insert(EntryIt, std::make_pair(PredMBB, ValReg));
895 }
896
897 PhiMI->addRegOperand(ValReg);
898 PhiMI->addMachineBasicBlockOperand(PredMBB);
899 if (LongPhiMI) {
900 LongPhiMI->addRegOperand(ValReg+1);
901 LongPhiMI->addMachineBasicBlockOperand(PredMBB);
902 }
903 }
904
905 // Now that we emitted all of the incoming values for the PHI node, make
906 // sure to reposition the InsertPoint after the PHI that we just added.
907 // This is needed because we might have inserted a constant into this
908 // block, right after the PHI's which is before the old insert point!
909 PHIInsertPoint = LongPhiMI ? LongPhiMI : PhiMI;
910 ++PHIInsertPoint;
911 }
912 }
913}
914
915
916// canFoldSetCCIntoBranchOrSelect - Return the setcc instruction if we can fold
917// it into the conditional branch or select instruction which is the only user
918// of the cc instruction. This is the case if the conditional branch is the
919// only user of the setcc, and if the setcc is in the same basic block as the
Misha Brukman1013ef52004-07-21 20:09:08 +0000920// conditional branch.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000921//
922static SetCondInst *canFoldSetCCIntoBranchOrSelect(Value *V) {
923 if (SetCondInst *SCI = dyn_cast<SetCondInst>(V))
924 if (SCI->hasOneUse()) {
925 Instruction *User = cast<Instruction>(SCI->use_back());
926 if ((isa<BranchInst>(User) || isa<SelectInst>(User)) &&
Misha Brukmanbebde752004-07-16 21:06:24 +0000927 SCI->getParent() == User->getParent())
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000928 return SCI;
929 }
930 return 0;
931}
932
Misha Brukmanb097f212004-07-26 18:13:24 +0000933// canFoldGEPIntoLoadOrStore - Return the GEP instruction if we can fold it into
934// the load or store instruction that is the only user of the GEP.
935//
936static GetElementPtrInst *canFoldGEPIntoLoadOrStore(Value *V) {
Nate Begeman645495d2004-09-23 05:31:33 +0000937 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(V)) {
938 bool AllUsesAreMem = true;
939 for (Value::use_iterator I = GEPI->use_begin(), E = GEPI->use_end();
940 I != E; ++I) {
941 Instruction *User = cast<Instruction>(*I);
942
943 // If the GEP is the target of a store, but not the source, then we are ok
944 // to fold it.
Misha Brukmanb097f212004-07-26 18:13:24 +0000945 if (isa<StoreInst>(User) &&
946 GEPI->getParent() == User->getParent() &&
947 User->getOperand(0) != GEPI &&
Nate Begeman645495d2004-09-23 05:31:33 +0000948 User->getOperand(1) == GEPI)
949 continue;
950
951 // If the GEP is the source of a load, then we're always ok to fold it
Misha Brukmanb097f212004-07-26 18:13:24 +0000952 if (isa<LoadInst>(User) &&
953 GEPI->getParent() == User->getParent() &&
Nate Begeman645495d2004-09-23 05:31:33 +0000954 User->getOperand(0) == GEPI)
955 continue;
956
957 // if we got to this point, than the instruction was not a load or store
958 // that we are capable of folding the GEP into.
959 AllUsesAreMem = false;
960 break;
Misha Brukmanb097f212004-07-26 18:13:24 +0000961 }
Nate Begeman645495d2004-09-23 05:31:33 +0000962 if (AllUsesAreMem)
963 return GEPI;
964 }
Misha Brukmanb097f212004-07-26 18:13:24 +0000965 return 0;
966}
967
968
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000969// Return a fixed numbering for setcc instructions which does not depend on the
970// order of the opcodes.
971//
972static unsigned getSetCCNumber(unsigned Opcode) {
Misha Brukmane9c65512004-07-06 15:32:44 +0000973 switch (Opcode) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000974 default: assert(0 && "Unknown setcc instruction!");
975 case Instruction::SetEQ: return 0;
976 case Instruction::SetNE: return 1;
977 case Instruction::SetLT: return 2;
978 case Instruction::SetGE: return 3;
979 case Instruction::SetGT: return 4;
980 case Instruction::SetLE: return 5;
981 }
982}
983
Misha Brukmane9c65512004-07-06 15:32:44 +0000984static unsigned getPPCOpcodeForSetCCNumber(unsigned Opcode) {
985 switch (Opcode) {
986 default: assert(0 && "Unknown setcc instruction!");
Misha Brukman5b570812004-08-10 22:47:03 +0000987 case Instruction::SetEQ: return PPC::BEQ;
988 case Instruction::SetNE: return PPC::BNE;
989 case Instruction::SetLT: return PPC::BLT;
990 case Instruction::SetGE: return PPC::BGE;
991 case Instruction::SetGT: return PPC::BGT;
992 case Instruction::SetLE: return PPC::BLE;
Misha Brukmane9c65512004-07-06 15:32:44 +0000993 }
994}
995
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000996/// emitUCOM - emits an unordered FP compare.
Misha Brukmana1dca552004-09-21 18:22:19 +0000997void PPC32ISel::emitUCOM(MachineBasicBlock *MBB, MachineBasicBlock::iterator IP,
998 unsigned LHS, unsigned RHS) {
Misha Brukman5b570812004-08-10 22:47:03 +0000999 BuildMI(*MBB, IP, PPC::FCMPU, 2, PPC::CR0).addReg(LHS).addReg(RHS);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001000}
1001
Misha Brukmana1dca552004-09-21 18:22:19 +00001002unsigned PPC32ISel::ExtendOrClear(MachineBasicBlock *MBB,
1003 MachineBasicBlock::iterator IP,
Nate Begemana2de1022004-09-22 04:40:25 +00001004 Value *Op0) {
Nate Begeman0e5e5f52004-08-22 08:10:15 +00001005 const Type *CompTy = Op0->getType();
1006 unsigned Reg = getReg(Op0, MBB, IP);
Nate Begemanb47321b2004-08-20 09:56:22 +00001007 unsigned Class = getClassB(CompTy);
1008
Nate Begeman1b99fd32004-09-29 03:45:33 +00001009 // Since we know that boolean values will be either zero or one, we don't
1010 // have to extend or clear them.
1011 if (CompTy == Type::BoolTy)
1012 return Reg;
1013
Nate Begemanb47321b2004-08-20 09:56:22 +00001014 // Before we do a comparison or SetCC, we have to make sure that we truncate
1015 // the source registers appropriately.
1016 if (Class == cByte) {
1017 unsigned TmpReg = makeAnotherReg(CompTy);
1018 if (CompTy->isSigned())
1019 BuildMI(*MBB, IP, PPC::EXTSB, 1, TmpReg).addReg(Reg);
1020 else
1021 BuildMI(*MBB, IP, PPC::RLWINM, 4, TmpReg).addReg(Reg).addImm(0)
1022 .addImm(24).addImm(31);
1023 Reg = TmpReg;
1024 } else if (Class == cShort) {
1025 unsigned TmpReg = makeAnotherReg(CompTy);
1026 if (CompTy->isSigned())
1027 BuildMI(*MBB, IP, PPC::EXTSH, 1, TmpReg).addReg(Reg);
1028 else
1029 BuildMI(*MBB, IP, PPC::RLWINM, 4, TmpReg).addReg(Reg).addImm(0)
1030 .addImm(16).addImm(31);
1031 Reg = TmpReg;
1032 }
1033 return Reg;
1034}
1035
Misha Brukmanbebde752004-07-16 21:06:24 +00001036/// EmitComparison - emits a comparison of the two operands, returning the
1037/// extended setcc code to use. The result is in CR0.
1038///
Misha Brukmana1dca552004-09-21 18:22:19 +00001039unsigned PPC32ISel::EmitComparison(unsigned OpNum, Value *Op0, Value *Op1,
1040 MachineBasicBlock *MBB,
1041 MachineBasicBlock::iterator IP) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001042 // The arguments are already supposed to be of the same type.
1043 const Type *CompTy = Op0->getType();
1044 unsigned Class = getClassB(CompTy);
Nate Begemana2de1022004-09-22 04:40:25 +00001045 unsigned Op0r = ExtendOrClear(MBB, IP, Op0);
Misha Brukmanb097f212004-07-26 18:13:24 +00001046
Misha Brukman1013ef52004-07-21 20:09:08 +00001047 // Use crand for lt, gt and crandc for le, ge
Misha Brukman5b570812004-08-10 22:47:03 +00001048 unsigned CROpcode = (OpNum == 2 || OpNum == 4) ? PPC::CRAND : PPC::CRANDC;
Misha Brukman1013ef52004-07-21 20:09:08 +00001049 // ? cr1[lt] : cr1[gt]
1050 unsigned CR1field = (OpNum == 2 || OpNum == 3) ? 4 : 5;
1051 // ? cr0[lt] : cr0[gt]
1052 unsigned CR0field = (OpNum == 2 || OpNum == 5) ? 0 : 1;
Misha Brukman5b570812004-08-10 22:47:03 +00001053 unsigned Opcode = CompTy->isSigned() ? PPC::CMPW : PPC::CMPLW;
1054 unsigned OpcodeImm = CompTy->isSigned() ? PPC::CMPWI : PPC::CMPLWI;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001055
1056 // Special case handling of: cmp R, i
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001057 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001058 if (Class == cByte || Class == cShort || Class == cInt) {
Misha Brukman1013ef52004-07-21 20:09:08 +00001059 unsigned Op1v = CI->getRawValue() & 0xFFFF;
Nate Begeman43d64ea2004-08-15 06:42:28 +00001060 unsigned OpClass = (CompTy->isSigned()) ? 0 : 2;
1061
Misha Brukman1013ef52004-07-21 20:09:08 +00001062 // Treat compare like ADDI for the purposes of immediate suitability
Nate Begemanb816f022004-10-07 22:30:03 +00001063 if (canUseAsImmediateForOpcode(CI, OpClass, false)) {
Misha Brukman5b570812004-08-10 22:47:03 +00001064 BuildMI(*MBB, IP, OpcodeImm, 2, PPC::CR0).addReg(Op0r).addSImm(Op1v);
Misha Brukman422791f2004-06-21 17:41:12 +00001065 } else {
1066 unsigned Op1r = getReg(Op1, MBB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00001067 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
Misha Brukman422791f2004-06-21 17:41:12 +00001068 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001069 return OpNum;
1070 } else {
1071 assert(Class == cLong && "Unknown integer class!");
1072 unsigned LowCst = CI->getRawValue();
1073 unsigned HiCst = CI->getRawValue() >> 32;
1074 if (OpNum < 2) { // seteq, setne
Misha Brukman1013ef52004-07-21 20:09:08 +00001075 unsigned LoLow = makeAnotherReg(Type::IntTy);
1076 unsigned LoTmp = makeAnotherReg(Type::IntTy);
1077 unsigned HiLow = makeAnotherReg(Type::IntTy);
1078 unsigned HiTmp = makeAnotherReg(Type::IntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001079 unsigned FinalTmp = makeAnotherReg(Type::IntTy);
Misha Brukman47225442004-07-23 22:35:49 +00001080
Misha Brukman5b570812004-08-10 22:47:03 +00001081 BuildMI(*MBB, IP, PPC::XORI, 2, LoLow).addReg(Op0r+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001082 .addImm(LowCst & 0xFFFF);
Misha Brukman5b570812004-08-10 22:47:03 +00001083 BuildMI(*MBB, IP, PPC::XORIS, 2, LoTmp).addReg(LoLow)
Misha Brukman1013ef52004-07-21 20:09:08 +00001084 .addImm(LowCst >> 16);
Misha Brukman5b570812004-08-10 22:47:03 +00001085 BuildMI(*MBB, IP, PPC::XORI, 2, HiLow).addReg(Op0r)
Misha Brukman1013ef52004-07-21 20:09:08 +00001086 .addImm(HiCst & 0xFFFF);
Misha Brukman5b570812004-08-10 22:47:03 +00001087 BuildMI(*MBB, IP, PPC::XORIS, 2, HiTmp).addReg(HiLow)
Misha Brukman1013ef52004-07-21 20:09:08 +00001088 .addImm(HiCst >> 16);
Misha Brukman5b570812004-08-10 22:47:03 +00001089 BuildMI(*MBB, IP, PPC::ORo, 2, FinalTmp).addReg(LoTmp).addReg(HiTmp);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001090 return OpNum;
1091 } else {
Misha Brukmanbebde752004-07-16 21:06:24 +00001092 unsigned ConstReg = makeAnotherReg(CompTy);
Misha Brukmanbebde752004-07-16 21:06:24 +00001093 copyConstantToRegister(MBB, IP, CI, ConstReg);
Misha Brukman47225442004-07-23 22:35:49 +00001094
Misha Brukman1013ef52004-07-21 20:09:08 +00001095 // cr0 = r3 ccOpcode r5 or (r3 == r5 AND r4 ccOpcode r6)
Misha Brukman5b570812004-08-10 22:47:03 +00001096 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r)
Misha Brukmanbebde752004-07-16 21:06:24 +00001097 .addReg(ConstReg);
Misha Brukman5b570812004-08-10 22:47:03 +00001098 BuildMI(*MBB, IP, Opcode, 2, PPC::CR1).addReg(Op0r+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001099 .addReg(ConstReg+1);
Misha Brukman5b570812004-08-10 22:47:03 +00001100 BuildMI(*MBB, IP, PPC::CRAND, 3).addImm(2).addImm(2).addImm(CR1field);
1101 BuildMI(*MBB, IP, PPC::CROR, 3).addImm(CR0field).addImm(CR0field)
Misha Brukman1013ef52004-07-21 20:09:08 +00001102 .addImm(2);
Misha Brukman422791f2004-06-21 17:41:12 +00001103 return OpNum;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001104 }
1105 }
1106 }
1107
1108 unsigned Op1r = getReg(Op1, MBB, IP);
Misha Brukman1013ef52004-07-21 20:09:08 +00001109
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001110 switch (Class) {
1111 default: assert(0 && "Unknown type class!");
1112 case cByte:
1113 case cShort:
1114 case cInt:
Misha Brukman5b570812004-08-10 22:47:03 +00001115 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001116 break;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001117
Misha Brukman7e898c32004-07-20 00:41:46 +00001118 case cFP32:
1119 case cFP64:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001120 emitUCOM(MBB, IP, Op0r, Op1r);
1121 break;
1122
1123 case cLong:
1124 if (OpNum < 2) { // seteq, setne
1125 unsigned LoTmp = makeAnotherReg(Type::IntTy);
1126 unsigned HiTmp = makeAnotherReg(Type::IntTy);
1127 unsigned FinalTmp = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00001128 BuildMI(*MBB, IP, PPC::XOR, 2, HiTmp).addReg(Op0r).addReg(Op1r);
1129 BuildMI(*MBB, IP, PPC::XOR, 2, LoTmp).addReg(Op0r+1).addReg(Op1r+1);
1130 BuildMI(*MBB, IP, PPC::ORo, 2, FinalTmp).addReg(LoTmp).addReg(HiTmp);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001131 break; // Allow the sete or setne to be generated from flags set by OR
1132 } else {
Misha Brukmanbebde752004-07-16 21:06:24 +00001133 unsigned TmpReg1 = makeAnotherReg(Type::IntTy);
1134 unsigned TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman1013ef52004-07-21 20:09:08 +00001135
1136 // cr0 = r3 ccOpcode r5 or (r3 == r5 AND r4 ccOpcode r6)
Misha Brukman5b570812004-08-10 22:47:03 +00001137 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
1138 BuildMI(*MBB, IP, Opcode, 2, PPC::CR1).addReg(Op0r+1).addReg(Op1r+1);
1139 BuildMI(*MBB, IP, PPC::CRAND, 3).addImm(2).addImm(2).addImm(CR1field);
1140 BuildMI(*MBB, IP, PPC::CROR, 3).addImm(CR0field).addImm(CR0field)
Misha Brukman1013ef52004-07-21 20:09:08 +00001141 .addImm(2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001142 return OpNum;
1143 }
1144 }
1145 return OpNum;
1146}
1147
Misha Brukmand18a31d2004-07-06 22:51:53 +00001148/// visitSetCondInst - emit code to calculate the condition via
1149/// EmitComparison(), and possibly store a 0 or 1 to a register as a result
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001150///
Misha Brukmana1dca552004-09-21 18:22:19 +00001151void PPC32ISel::visitSetCondInst(SetCondInst &I) {
Misha Brukmand18a31d2004-07-06 22:51:53 +00001152 if (canFoldSetCCIntoBranchOrSelect(&I))
Misha Brukmane9c65512004-07-06 15:32:44 +00001153 return;
Misha Brukmanbebde752004-07-16 21:06:24 +00001154
Nate Begemana2de1022004-09-22 04:40:25 +00001155 MachineBasicBlock::iterator MI = BB->end();
1156 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
1157 const Type *Ty = Op0->getType();
1158 unsigned Class = getClassB(Ty);
Nate Begemana96c4af2004-08-21 20:42:14 +00001159 unsigned Opcode = I.getOpcode();
Nate Begemana2de1022004-09-22 04:40:25 +00001160 unsigned OpNum = getSetCCNumber(Opcode);
1161 unsigned DestReg = getReg(I);
1162
1163 // If the comparison type is byte, short, or int, then we can emit a
1164 // branchless version of the SetCC that puts 0 (false) or 1 (true) in the
1165 // destination register.
1166 if (Class <= cInt) {
1167 ConstantInt *CI = dyn_cast<ConstantInt>(Op1);
1168
1169 if (CI && CI->getRawValue() == 0) {
Nate Begemana2de1022004-09-22 04:40:25 +00001170 unsigned Op0Reg = ExtendOrClear(BB, MI, Op0);
1171
1172 // comparisons against constant zero and negative one often have shorter
1173 // and/or faster sequences than the set-and-branch general case, handled
1174 // below.
1175 switch(OpNum) {
1176 case 0: { // eq0
1177 unsigned TempReg = makeAnotherReg(Type::IntTy);
1178 BuildMI(*BB, MI, PPC::CNTLZW, 1, TempReg).addReg(Op0Reg);
1179 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(TempReg).addImm(27)
1180 .addImm(5).addImm(31);
1181 break;
1182 }
1183 case 1: { // ne0
1184 unsigned TempReg = makeAnotherReg(Type::IntTy);
1185 BuildMI(*BB, MI, PPC::ADDIC, 2, TempReg).addReg(Op0Reg).addSImm(-1);
1186 BuildMI(*BB, MI, PPC::SUBFE, 2, DestReg).addReg(TempReg).addReg(Op0Reg);
1187 break;
1188 }
1189 case 2: { // lt0, always false if unsigned
1190 if (Ty->isSigned())
1191 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Op0Reg).addImm(1)
1192 .addImm(31).addImm(31);
1193 else
1194 BuildMI(*BB, MI, PPC::LI, 1, DestReg).addSImm(0);
1195 break;
1196 }
1197 case 3: { // ge0, always true if unsigned
1198 if (Ty->isSigned()) {
1199 unsigned TempReg = makeAnotherReg(Type::IntTy);
1200 BuildMI(*BB, MI, PPC::RLWINM, 4, TempReg).addReg(Op0Reg).addImm(1)
1201 .addImm(31).addImm(31);
1202 BuildMI(*BB, MI, PPC::XORI, 2, DestReg).addReg(TempReg).addImm(1);
1203 } else {
1204 BuildMI(*BB, MI, PPC::LI, 1, DestReg).addSImm(1);
1205 }
1206 break;
1207 }
1208 case 4: { // gt0, equivalent to ne0 if unsigned
1209 unsigned Temp1 = makeAnotherReg(Type::IntTy);
1210 unsigned Temp2 = makeAnotherReg(Type::IntTy);
1211 if (Ty->isSigned()) {
1212 BuildMI(*BB, MI, PPC::NEG, 2, Temp1).addReg(Op0Reg);
1213 BuildMI(*BB, MI, PPC::ANDC, 2, Temp2).addReg(Temp1).addReg(Op0Reg);
1214 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp2).addImm(1)
1215 .addImm(31).addImm(31);
1216 } else {
1217 BuildMI(*BB, MI, PPC::ADDIC, 2, Temp1).addReg(Op0Reg).addSImm(-1);
1218 BuildMI(*BB, MI, PPC::SUBFE, 2, DestReg).addReg(Temp1).addReg(Op0Reg);
1219 }
1220 break;
1221 }
1222 case 5: { // le0, equivalent to eq0 if unsigned
1223 unsigned Temp1 = makeAnotherReg(Type::IntTy);
1224 unsigned Temp2 = makeAnotherReg(Type::IntTy);
1225 if (Ty->isSigned()) {
1226 BuildMI(*BB, MI, PPC::NEG, 2, Temp1).addReg(Op0Reg);
1227 BuildMI(*BB, MI, PPC::ORC, 2, Temp2).addReg(Op0Reg).addReg(Temp1);
1228 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp2).addImm(1)
1229 .addImm(31).addImm(31);
1230 } else {
1231 BuildMI(*BB, MI, PPC::CNTLZW, 1, Temp1).addReg(Op0Reg);
1232 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp1).addImm(27)
1233 .addImm(5).addImm(31);
1234 }
1235 break;
1236 }
1237 } // switch
1238 return;
1239 }
1240 }
Nate Begemanb47321b2004-08-20 09:56:22 +00001241 unsigned PPCOpcode = getPPCOpcodeForSetCCNumber(Opcode);
Nate Begemana96c4af2004-08-21 20:42:14 +00001242
1243 // Create an iterator with which to insert the MBB for copying the false value
1244 // and the MBB to hold the PHI instruction for this SetCC.
Misha Brukman425ff242004-07-01 21:34:10 +00001245 MachineBasicBlock *thisMBB = BB;
1246 const BasicBlock *LLVM_BB = BB->getBasicBlock();
Misha Brukman7e898c32004-07-20 00:41:46 +00001247 ilist<MachineBasicBlock>::iterator It = BB;
1248 ++It;
1249
Misha Brukman425ff242004-07-01 21:34:10 +00001250 // thisMBB:
1251 // ...
1252 // cmpTY cr0, r1, r2
Misha Brukman425ff242004-07-01 21:34:10 +00001253 // %TrueValue = li 1
Nate Begemana96c4af2004-08-21 20:42:14 +00001254 // bCC sinkMBB
Nate Begemana2de1022004-09-22 04:40:25 +00001255 EmitComparison(Opcode, Op0, Op1, BB, BB->end());
Misha Brukmane2eceb52004-07-23 16:08:20 +00001256 unsigned TrueValue = makeAnotherReg(I.getType());
Misha Brukman5b570812004-08-10 22:47:03 +00001257 BuildMI(BB, PPC::LI, 1, TrueValue).addSImm(1);
Nate Begemana96c4af2004-08-21 20:42:14 +00001258 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
1259 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
1260 BuildMI(BB, PPCOpcode, 2).addReg(PPC::CR0).addMBB(sinkMBB);
1261 F->getBasicBlockList().insert(It, copy0MBB);
1262 F->getBasicBlockList().insert(It, sinkMBB);
Misha Brukman425ff242004-07-01 21:34:10 +00001263 // Update machine-CFG edges
Nate Begemana96c4af2004-08-21 20:42:14 +00001264 BB->addSuccessor(copy0MBB);
Misha Brukman425ff242004-07-01 21:34:10 +00001265 BB->addSuccessor(sinkMBB);
1266
Misha Brukman1013ef52004-07-21 20:09:08 +00001267 // copy0MBB:
1268 // %FalseValue = li 0
1269 // fallthrough
1270 BB = copy0MBB;
1271 unsigned FalseValue = makeAnotherReg(I.getType());
Misha Brukman5b570812004-08-10 22:47:03 +00001272 BuildMI(BB, PPC::LI, 1, FalseValue).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00001273 // Update machine-CFG edges
1274 BB->addSuccessor(sinkMBB);
1275
Misha Brukman425ff242004-07-01 21:34:10 +00001276 // sinkMBB:
Nate Begemana96c4af2004-08-21 20:42:14 +00001277 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
Misha Brukman425ff242004-07-01 21:34:10 +00001278 // ...
1279 BB = sinkMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00001280 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(FalseValue)
Nate Begemana96c4af2004-08-21 20:42:14 +00001281 .addMBB(copy0MBB).addReg(TrueValue).addMBB(thisMBB);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001282}
1283
Misha Brukmana1dca552004-09-21 18:22:19 +00001284void PPC32ISel::visitSelectInst(SelectInst &SI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001285 unsigned DestReg = getReg(SI);
1286 MachineBasicBlock::iterator MII = BB->end();
Misha Brukman2fec9902004-06-21 20:22:03 +00001287 emitSelectOperation(BB, MII, SI.getCondition(), SI.getTrueValue(),
1288 SI.getFalseValue(), DestReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001289}
1290
1291/// emitSelect - Common code shared between visitSelectInst and the constant
1292/// expression support.
Misha Brukmana1dca552004-09-21 18:22:19 +00001293void PPC32ISel::emitSelectOperation(MachineBasicBlock *MBB,
1294 MachineBasicBlock::iterator IP,
1295 Value *Cond, Value *TrueVal,
1296 Value *FalseVal, unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001297 unsigned SelectClass = getClassB(TrueVal->getType());
Misha Brukman7e898c32004-07-20 00:41:46 +00001298 unsigned Opcode;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001299
Misha Brukmanbebde752004-07-16 21:06:24 +00001300 // See if we can fold the setcc into the select instruction, or if we have
1301 // to get the register of the Cond value
Misha Brukmanbebde752004-07-16 21:06:24 +00001302 if (SetCondInst *SCI = canFoldSetCCIntoBranchOrSelect(Cond)) {
1303 // We successfully folded the setcc into the select instruction.
Misha Brukmanbebde752004-07-16 21:06:24 +00001304 unsigned OpNum = getSetCCNumber(SCI->getOpcode());
Nate Begeman087d5d92004-10-06 09:53:04 +00001305 if (OpNum >= 2 && OpNum <= 5) {
1306 unsigned SetCondClass = getClassB(SCI->getOperand(0)->getType());
1307 if ((SetCondClass == cFP32 || SetCondClass == cFP64) &&
1308 (SelectClass == cFP32 || SelectClass == cFP64)) {
1309 unsigned CondReg = getReg(SCI->getOperand(0), MBB, IP);
1310 unsigned TrueReg = getReg(TrueVal, MBB, IP);
1311 unsigned FalseReg = getReg(FalseVal, MBB, IP);
1312 // if the comparison of the floating point value used to for the select
1313 // is against 0, then we can emit an fsel without subtraction.
1314 ConstantFP *Op1C = dyn_cast<ConstantFP>(SCI->getOperand(1));
1315 if (Op1C && (Op1C->isExactlyValue(-0.0) || Op1C->isExactlyValue(0.0))) {
1316 switch(OpNum) {
1317 case 2: // LT
1318 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(CondReg)
1319 .addReg(FalseReg).addReg(TrueReg);
1320 break;
1321 case 3: // GE == !LT
1322 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(CondReg)
1323 .addReg(TrueReg).addReg(FalseReg);
1324 break;
1325 case 4: { // GT
1326 unsigned NegatedReg = makeAnotherReg(SCI->getOperand(0)->getType());
1327 BuildMI(*MBB, IP, PPC::FNEG, 1, NegatedReg).addReg(CondReg);
1328 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(NegatedReg)
1329 .addReg(FalseReg).addReg(TrueReg);
1330 }
1331 break;
1332 case 5: { // LE == !GT
1333 unsigned NegatedReg = makeAnotherReg(SCI->getOperand(0)->getType());
1334 BuildMI(*MBB, IP, PPC::FNEG, 1, NegatedReg).addReg(CondReg);
1335 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(NegatedReg)
1336 .addReg(TrueReg).addReg(FalseReg);
1337 }
1338 break;
1339 default:
1340 assert(0 && "Invalid SetCC opcode to fsel");
1341 abort();
1342 break;
1343 }
1344 } else {
1345 unsigned OtherCondReg = getReg(SCI->getOperand(1), MBB, IP);
1346 unsigned SelectReg = makeAnotherReg(SCI->getOperand(0)->getType());
1347 switch(OpNum) {
1348 case 2: // LT
1349 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(CondReg)
1350 .addReg(OtherCondReg);
1351 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1352 .addReg(FalseReg).addReg(TrueReg);
1353 break;
1354 case 3: // GE == !LT
1355 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(CondReg)
1356 .addReg(OtherCondReg);
1357 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1358 .addReg(TrueReg).addReg(FalseReg);
1359 break;
1360 case 4: // GT
1361 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(OtherCondReg)
1362 .addReg(CondReg);
1363 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1364 .addReg(FalseReg).addReg(TrueReg);
1365 break;
1366 case 5: // LE == !GT
1367 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(OtherCondReg)
1368 .addReg(CondReg);
1369 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1370 .addReg(TrueReg).addReg(FalseReg);
1371 break;
1372 default:
1373 assert(0 && "Invalid SetCC opcode to fsel");
1374 abort();
1375 break;
1376 }
1377 }
Nate Begeman087d5d92004-10-06 09:53:04 +00001378 return;
1379 }
1380 }
Misha Brukman47225442004-07-23 22:35:49 +00001381 OpNum = EmitComparison(OpNum, SCI->getOperand(0),SCI->getOperand(1),MBB,IP);
Misha Brukmanbebde752004-07-16 21:06:24 +00001382 Opcode = getPPCOpcodeForSetCCNumber(SCI->getOpcode());
1383 } else {
1384 unsigned CondReg = getReg(Cond, MBB, IP);
Nate Begemaned428532004-09-04 05:00:00 +00001385 BuildMI(*MBB, IP, PPC::CMPWI, 2, PPC::CR0).addReg(CondReg).addSImm(0);
Misha Brukmanbebde752004-07-16 21:06:24 +00001386 Opcode = getPPCOpcodeForSetCCNumber(Instruction::SetNE);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001387 }
Misha Brukmanbebde752004-07-16 21:06:24 +00001388
1389 MachineBasicBlock *thisMBB = BB;
1390 const BasicBlock *LLVM_BB = BB->getBasicBlock();
Misha Brukman7e898c32004-07-20 00:41:46 +00001391 ilist<MachineBasicBlock>::iterator It = BB;
1392 ++It;
Misha Brukmanbebde752004-07-16 21:06:24 +00001393
Nate Begemana96c4af2004-08-21 20:42:14 +00001394 // thisMBB:
1395 // ...
1396 // cmpTY cr0, r1, r2
Nate Begeman1f49e862004-09-29 05:00:31 +00001397 // bCC copy1MBB
1398 // fallthrough --> copy0MBB
Misha Brukmanbebde752004-07-16 21:06:24 +00001399 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
Nate Begeman1f49e862004-09-29 05:00:31 +00001400 MachineBasicBlock *copy1MBB = new MachineBasicBlock(LLVM_BB);
Misha Brukman1013ef52004-07-21 20:09:08 +00001401 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
Nate Begeman1f49e862004-09-29 05:00:31 +00001402 BuildMI(BB, Opcode, 2).addReg(PPC::CR0).addMBB(copy1MBB);
Nate Begemana96c4af2004-08-21 20:42:14 +00001403 F->getBasicBlockList().insert(It, copy0MBB);
Nate Begeman1f49e862004-09-29 05:00:31 +00001404 F->getBasicBlockList().insert(It, copy1MBB);
Misha Brukman1013ef52004-07-21 20:09:08 +00001405 F->getBasicBlockList().insert(It, sinkMBB);
Misha Brukmanbebde752004-07-16 21:06:24 +00001406 // Update machine-CFG edges
Misha Brukmanbebde752004-07-16 21:06:24 +00001407 BB->addSuccessor(copy0MBB);
Nate Begeman1f49e862004-09-29 05:00:31 +00001408 BB->addSuccessor(copy1MBB);
Misha Brukmanbebde752004-07-16 21:06:24 +00001409
Misha Brukman1013ef52004-07-21 20:09:08 +00001410 // copy0MBB:
1411 // %FalseValue = ...
Nate Begeman1f49e862004-09-29 05:00:31 +00001412 // b sinkMBB
Misha Brukman1013ef52004-07-21 20:09:08 +00001413 BB = copy0MBB;
1414 unsigned FalseValue = getReg(FalseVal, BB, BB->begin());
Nate Begeman1f49e862004-09-29 05:00:31 +00001415 BuildMI(BB, PPC::B, 1).addMBB(sinkMBB);
1416 // Update machine-CFG edges
1417 BB->addSuccessor(sinkMBB);
1418
1419 // copy1MBB:
1420 // %TrueValue = ...
1421 // fallthrough
1422 BB = copy1MBB;
1423 unsigned TrueValue = getReg(TrueVal, BB, BB->begin());
Misha Brukman1013ef52004-07-21 20:09:08 +00001424 // Update machine-CFG edges
1425 BB->addSuccessor(sinkMBB);
1426
Misha Brukmanbebde752004-07-16 21:06:24 +00001427 // sinkMBB:
Nate Begemana96c4af2004-08-21 20:42:14 +00001428 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
Misha Brukmanbebde752004-07-16 21:06:24 +00001429 // ...
1430 BB = sinkMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00001431 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(FalseValue)
Nate Begeman1f49e862004-09-29 05:00:31 +00001432 .addMBB(copy0MBB).addReg(TrueValue).addMBB(copy1MBB);
Nate Begemana96c4af2004-08-21 20:42:14 +00001433
Misha Brukmana31f1f72004-07-21 20:30:18 +00001434 // For a register pair representing a long value, define the second reg
Nate Begemana96c4af2004-08-21 20:42:14 +00001435 // FIXME: Can this really be correct for selecting longs?
Nate Begeman8d963e62004-08-11 03:30:55 +00001436 if (getClassB(TrueVal->getType()) == cLong)
Misha Brukman5b570812004-08-10 22:47:03 +00001437 BuildMI(BB, PPC::LI, 1, DestReg+1).addImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001438 return;
1439}
1440
1441
1442
1443/// promote32 - Emit instructions to turn a narrow operand into a 32-bit-wide
1444/// operand, in the specified target register.
1445///
Misha Brukmana1dca552004-09-21 18:22:19 +00001446void PPC32ISel::promote32(unsigned targetReg, const ValueRecord &VR) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001447 bool isUnsigned = VR.Ty->isUnsigned() || VR.Ty == Type::BoolTy;
1448
1449 Value *Val = VR.Val;
1450 const Type *Ty = VR.Ty;
1451 if (Val) {
1452 if (Constant *C = dyn_cast<Constant>(Val)) {
1453 Val = ConstantExpr::getCast(C, Type::IntTy);
Chris Lattner74a806c2004-08-11 07:34:50 +00001454 if (isa<ConstantExpr>(Val)) // Could not fold
1455 Val = C;
1456 else
1457 Ty = Type::IntTy; // Folded!
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001458 }
1459
Misha Brukman2fec9902004-06-21 20:22:03 +00001460 // If this is a simple constant, just emit a load directly to avoid the copy
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001461 if (ConstantInt *CI = dyn_cast<ConstantInt>(Val)) {
1462 int TheVal = CI->getRawValue() & 0xFFFFFFFF;
1463
1464 if (TheVal < 32768 && TheVal >= -32768) {
Misha Brukman5b570812004-08-10 22:47:03 +00001465 BuildMI(BB, PPC::LI, 1, targetReg).addSImm(TheVal);
Misha Brukman422791f2004-06-21 17:41:12 +00001466 } else {
1467 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00001468 BuildMI(BB, PPC::LIS, 1, TmpReg).addSImm(TheVal >> 16);
1469 BuildMI(BB, PPC::ORI, 2, targetReg).addReg(TmpReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00001470 .addImm(TheVal & 0xFFFF);
Misha Brukman422791f2004-06-21 17:41:12 +00001471 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001472 return;
1473 }
1474 }
1475
1476 // Make sure we have the register number for this value...
1477 unsigned Reg = Val ? getReg(Val) : VR.Reg;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001478 switch (getClassB(Ty)) {
1479 case cByte:
1480 // Extend value into target register (8->32)
Nate Begeman1b99fd32004-09-29 03:45:33 +00001481 if (Ty == Type::BoolTy)
1482 BuildMI(BB, PPC::OR, 2, targetReg).addReg(Reg).addReg(Reg);
1483 else if (isUnsigned)
Misha Brukman5b570812004-08-10 22:47:03 +00001484 BuildMI(BB, PPC::RLWINM, 4, targetReg).addReg(Reg).addZImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00001485 .addZImm(24).addZImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001486 else
Misha Brukman5b570812004-08-10 22:47:03 +00001487 BuildMI(BB, PPC::EXTSB, 1, targetReg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001488 break;
1489 case cShort:
1490 // Extend value into target register (16->32)
1491 if (isUnsigned)
Misha Brukman5b570812004-08-10 22:47:03 +00001492 BuildMI(BB, PPC::RLWINM, 4, targetReg).addReg(Reg).addZImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00001493 .addZImm(16).addZImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001494 else
Misha Brukman5b570812004-08-10 22:47:03 +00001495 BuildMI(BB, PPC::EXTSH, 1, targetReg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001496 break;
1497 case cInt:
1498 // Move value into target register (32->32)
Misha Brukman5b570812004-08-10 22:47:03 +00001499 BuildMI(BB, PPC::OR, 2, targetReg).addReg(Reg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001500 break;
1501 default:
1502 assert(0 && "Unpromotable operand class in promote32");
1503 }
1504}
1505
Misha Brukman2fec9902004-06-21 20:22:03 +00001506/// visitReturnInst - implemented with BLR
1507///
Misha Brukmana1dca552004-09-21 18:22:19 +00001508void PPC32ISel::visitReturnInst(ReturnInst &I) {
Misha Brukmand47bbf72004-06-25 19:04:27 +00001509 // Only do the processing if this is a non-void return
1510 if (I.getNumOperands() > 0) {
1511 Value *RetVal = I.getOperand(0);
1512 switch (getClassB(RetVal->getType())) {
1513 case cByte: // integral return values: extend or move into r3 and return
1514 case cShort:
1515 case cInt:
Misha Brukman5b570812004-08-10 22:47:03 +00001516 promote32(PPC::R3, ValueRecord(RetVal));
Misha Brukmand47bbf72004-06-25 19:04:27 +00001517 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001518 case cFP32:
1519 case cFP64: { // Floats & Doubles: Return in f1
Misha Brukmand47bbf72004-06-25 19:04:27 +00001520 unsigned RetReg = getReg(RetVal);
Misha Brukman5b570812004-08-10 22:47:03 +00001521 BuildMI(BB, PPC::FMR, 1, PPC::F1).addReg(RetReg);
Misha Brukmand47bbf72004-06-25 19:04:27 +00001522 break;
1523 }
1524 case cLong: {
1525 unsigned RetReg = getReg(RetVal);
Misha Brukman5b570812004-08-10 22:47:03 +00001526 BuildMI(BB, PPC::OR, 2, PPC::R3).addReg(RetReg).addReg(RetReg);
1527 BuildMI(BB, PPC::OR, 2, PPC::R4).addReg(RetReg+1).addReg(RetReg+1);
Misha Brukmand47bbf72004-06-25 19:04:27 +00001528 break;
1529 }
1530 default:
1531 visitInstruction(I);
1532 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001533 }
Misha Brukman5b570812004-08-10 22:47:03 +00001534 BuildMI(BB, PPC::BLR, 1).addImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001535}
1536
1537// getBlockAfter - Return the basic block which occurs lexically after the
1538// specified one.
1539static inline BasicBlock *getBlockAfter(BasicBlock *BB) {
1540 Function::iterator I = BB; ++I; // Get iterator to next block
1541 return I != BB->getParent()->end() ? &*I : 0;
1542}
1543
1544/// visitBranchInst - Handle conditional and unconditional branches here. Note
1545/// that since code layout is frozen at this point, that if we are trying to
1546/// jump to a block that is the immediate successor of the current block, we can
1547/// just make a fall-through (but we don't currently).
1548///
Misha Brukmana1dca552004-09-21 18:22:19 +00001549void PPC32ISel::visitBranchInst(BranchInst &BI) {
Misha Brukman2fec9902004-06-21 20:22:03 +00001550 // Update machine-CFG edges
Misha Brukmane2eceb52004-07-23 16:08:20 +00001551 BB->addSuccessor(MBBMap[BI.getSuccessor(0)]);
Misha Brukman2fec9902004-06-21 20:22:03 +00001552 if (BI.isConditional())
Misha Brukmane2eceb52004-07-23 16:08:20 +00001553 BB->addSuccessor(MBBMap[BI.getSuccessor(1)]);
Misha Brukman2fec9902004-06-21 20:22:03 +00001554
1555 BasicBlock *NextBB = getBlockAfter(BI.getParent()); // BB after current one
Misha Brukmane9c65512004-07-06 15:32:44 +00001556
Misha Brukman2fec9902004-06-21 20:22:03 +00001557 if (!BI.isConditional()) { // Unconditional branch?
Misha Brukmane9c65512004-07-06 15:32:44 +00001558 if (BI.getSuccessor(0) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001559 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001560 return;
Misha Brukman2fec9902004-06-21 20:22:03 +00001561 }
1562
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001563 // See if we can fold the setcc into the branch itself...
1564 SetCondInst *SCI = canFoldSetCCIntoBranchOrSelect(BI.getCondition());
1565 if (SCI == 0) {
1566 // Nope, cannot fold setcc into this branch. Emit a branch on a condition
1567 // computed some other way...
1568 unsigned condReg = getReg(BI.getCondition());
Misha Brukman5b570812004-08-10 22:47:03 +00001569 BuildMI(BB, PPC::CMPLI, 3, PPC::CR0).addImm(0).addReg(condReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00001570 .addImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001571 if (BI.getSuccessor(1) == NextBB) {
1572 if (BI.getSuccessor(0) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001573 BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(PPC::BNE)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001574 .addMBB(MBBMap[BI.getSuccessor(0)])
1575 .addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001576 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00001577 BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(PPC::BEQ)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001578 .addMBB(MBBMap[BI.getSuccessor(1)])
1579 .addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001580 if (BI.getSuccessor(0) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001581 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001582 }
1583 return;
1584 }
1585
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001586 unsigned OpNum = getSetCCNumber(SCI->getOpcode());
Misha Brukmane9c65512004-07-06 15:32:44 +00001587 unsigned Opcode = getPPCOpcodeForSetCCNumber(SCI->getOpcode());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001588 MachineBasicBlock::iterator MII = BB->end();
1589 OpNum = EmitComparison(OpNum, SCI->getOperand(0), SCI->getOperand(1), BB,MII);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001590
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001591 if (BI.getSuccessor(0) != NextBB) {
Misha Brukman5b570812004-08-10 22:47:03 +00001592 BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(Opcode)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001593 .addMBB(MBBMap[BI.getSuccessor(0)])
1594 .addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001595 if (BI.getSuccessor(1) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001596 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001597 } else {
1598 // Change to the inverse condition...
1599 if (BI.getSuccessor(1) != NextBB) {
Misha Brukmanf2ccb772004-08-17 04:55:41 +00001600 Opcode = PPC32InstrInfo::invertPPCBranchOpcode(Opcode);
Misha Brukman5b570812004-08-10 22:47:03 +00001601 BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(Opcode)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001602 .addMBB(MBBMap[BI.getSuccessor(1)])
1603 .addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001604 }
1605 }
1606}
1607
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001608/// doCall - This emits an abstract call instruction, setting up the arguments
1609/// and the return value as appropriate. For the actual function call itself,
1610/// it inserts the specified CallMI instruction into the stream.
1611///
1612/// FIXME: See Documentation at the following URL for "correct" behavior
1613/// <http://developer.apple.com/documentation/DeveloperTools/Conceptual/MachORuntime/2rt_powerpc_abi/chapter_9_section_5.html>
Misha Brukmana1dca552004-09-21 18:22:19 +00001614void PPC32ISel::doCall(const ValueRecord &Ret, MachineInstr *CallMI,
1615 const std::vector<ValueRecord> &Args, bool isVarArg) {
Chris Lattner3ea93462004-08-06 06:58:50 +00001616 // Count how many bytes are to be pushed on the stack, including the linkage
1617 // area, and parameter passing area.
1618 unsigned NumBytes = 24;
1619 unsigned ArgOffset = 24;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001620
1621 if (!Args.empty()) {
1622 for (unsigned i = 0, e = Args.size(); i != e; ++i)
1623 switch (getClassB(Args[i].Ty)) {
1624 case cByte: case cShort: case cInt:
1625 NumBytes += 4; break;
1626 case cLong:
1627 NumBytes += 8; break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001628 case cFP32:
1629 NumBytes += 4; break;
1630 case cFP64:
1631 NumBytes += 8; break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001632 break;
1633 default: assert(0 && "Unknown class!");
1634 }
1635
Nate Begeman865075e2004-08-16 01:50:22 +00001636 // Just to be safe, we'll always reserve the full 24 bytes of linkage area
1637 // plus 32 bytes of argument space in case any called code gets funky on us.
1638 if (NumBytes < 56) NumBytes = 56;
Chris Lattner3ea93462004-08-06 06:58:50 +00001639
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001640 // Adjust the stack pointer for the new arguments...
Chris Lattner3ea93462004-08-06 06:58:50 +00001641 // These functions are automatically eliminated by the prolog/epilog pass
Misha Brukman5b570812004-08-10 22:47:03 +00001642 BuildMI(BB, PPC::ADJCALLSTACKDOWN, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001643
1644 // Arguments go on the stack in reverse order, as specified by the ABI.
Misha Brukman7e898c32004-07-20 00:41:46 +00001645 // Offset to the paramater area on the stack is 24.
Misha Brukmand18a31d2004-07-06 22:51:53 +00001646 int GPR_remaining = 8, FPR_remaining = 13;
Misha Brukmanfc879c32004-07-08 18:02:38 +00001647 unsigned GPR_idx = 0, FPR_idx = 0;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001648 static const unsigned GPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00001649 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
1650 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001651 };
Misha Brukmand18a31d2004-07-06 22:51:53 +00001652 static const unsigned FPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00001653 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6,
1654 PPC::F7, PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12,
1655 PPC::F13
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001656 };
Misha Brukman422791f2004-06-21 17:41:12 +00001657
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001658 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
1659 unsigned ArgReg;
1660 switch (getClassB(Args[i].Ty)) {
1661 case cByte:
1662 case cShort:
1663 // Promote arg to 32 bits wide into a temporary register...
1664 ArgReg = makeAnotherReg(Type::UIntTy);
1665 promote32(ArgReg, Args[i]);
Misha Brukman422791f2004-06-21 17:41:12 +00001666
1667 // Reg or stack?
1668 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001669 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001670 .addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001671 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001672 }
1673 if (GPR_remaining <= 0 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001674 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1675 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001676 }
1677 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001678 case cInt:
1679 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
1680
Misha Brukman422791f2004-06-21 17:41:12 +00001681 // Reg or stack?
1682 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001683 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001684 .addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001685 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001686 }
1687 if (GPR_remaining <= 0 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001688 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1689 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001690 }
1691 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001692 case cLong:
Misha Brukman422791f2004-06-21 17:41:12 +00001693 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001694
Misha Brukmanec6319a2004-07-20 15:51:37 +00001695 // Reg or stack? Note that PPC calling conventions state that long args
1696 // are passed rN = hi, rN+1 = lo, opposite of LLVM.
Misha Brukman422791f2004-06-21 17:41:12 +00001697 if (GPR_remaining > 1) {
Misha Brukman5b570812004-08-10 22:47:03 +00001698 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanec6319a2004-07-20 15:51:37 +00001699 .addReg(ArgReg);
Misha Brukman5b570812004-08-10 22:47:03 +00001700 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx+1]).addReg(ArgReg+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001701 .addReg(ArgReg+1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001702 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1703 CallMI->addRegOperand(GPR[GPR_idx+1], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001704 }
1705 if (GPR_remaining <= 1 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001706 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1707 .addReg(PPC::R1);
1708 BuildMI(BB, PPC::STW, 3).addReg(ArgReg+1).addSImm(ArgOffset+4)
1709 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001710 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001711
1712 ArgOffset += 4; // 8 byte entry, not 4.
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001713 GPR_remaining -= 1; // uses up 2 GPRs
1714 GPR_idx += 1;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001715 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001716 case cFP32:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001717 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
Misha Brukman7e898c32004-07-20 00:41:46 +00001718 // Reg or stack?
1719 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001720 BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001721 CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use);
1722 FPR_remaining--;
1723 FPR_idx++;
1724
1725 // If this is a vararg function, and there are GPRs left, also
1726 // pass the float in an int. Otherwise, put it on the stack.
1727 if (isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001728 BuildMI(BB, PPC::STFS, 3).addReg(ArgReg).addSImm(ArgOffset)
1729 .addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001730 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001731 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx])
Nate Begeman293d88c2004-08-13 04:45:14 +00001732 .addSImm(ArgOffset).addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001733 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1734 }
Misha Brukman1916bf92004-06-24 21:56:15 +00001735 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001736 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00001737 BuildMI(BB, PPC::STFS, 3).addReg(ArgReg).addSImm(ArgOffset)
1738 .addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001739 }
1740 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001741 case cFP64:
1742 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
1743 // Reg or stack?
1744 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001745 BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001746 CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use);
1747 FPR_remaining--;
1748 FPR_idx++;
1749 // For vararg functions, must pass doubles via int regs as well
1750 if (isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001751 BuildMI(BB, PPC::STFD, 3).addReg(ArgReg).addSImm(ArgOffset)
1752 .addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001753
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001754 // Doubles can be split across reg + stack for varargs
1755 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001756 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx]).addSImm(ArgOffset)
1757 .addReg(PPC::R1);
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001758 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1759 }
1760 if (GPR_remaining > 1) {
Misha Brukman5b570812004-08-10 22:47:03 +00001761 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx+1])
1762 .addSImm(ArgOffset+4).addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001763 CallMI->addRegOperand(GPR[GPR_idx+1], MachineOperand::Use);
1764 }
1765 }
1766 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00001767 BuildMI(BB, PPC::STFD, 3).addReg(ArgReg).addSImm(ArgOffset)
1768 .addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001769 }
1770 // Doubles use 8 bytes, and 2 GPRs worth of param space
1771 ArgOffset += 4;
1772 GPR_remaining--;
1773 GPR_idx++;
1774 break;
1775
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001776 default: assert(0 && "Unknown class!");
1777 }
1778 ArgOffset += 4;
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001779 GPR_remaining--;
1780 GPR_idx++;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001781 }
1782 } else {
Nate Begeman865075e2004-08-16 01:50:22 +00001783 BuildMI(BB, PPC::ADJCALLSTACKDOWN, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001784 }
Nate Begeman43d64ea2004-08-15 06:42:28 +00001785
Misha Brukman5b570812004-08-10 22:47:03 +00001786 BuildMI(BB, PPC::IMPLICIT_DEF, 0, PPC::LR);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001787 BB->push_back(CallMI);
Chris Lattner3ea93462004-08-06 06:58:50 +00001788
1789 // These functions are automatically eliminated by the prolog/epilog pass
Misha Brukman5b570812004-08-10 22:47:03 +00001790 BuildMI(BB, PPC::ADJCALLSTACKUP, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001791
1792 // If there is a return value, scavenge the result from the location the call
1793 // leaves it in...
1794 //
1795 if (Ret.Ty != Type::VoidTy) {
1796 unsigned DestClass = getClassB(Ret.Ty);
1797 switch (DestClass) {
1798 case cByte:
1799 case cShort:
1800 case cInt:
1801 // Integral results are in r3
Misha Brukman5b570812004-08-10 22:47:03 +00001802 BuildMI(BB, PPC::OR, 2, Ret.Reg).addReg(PPC::R3).addReg(PPC::R3);
Misha Brukmane327e492004-06-24 23:53:24 +00001803 break;
Chris Lattner3ea93462004-08-06 06:58:50 +00001804 case cFP32: // Floating-point return values live in f1
Misha Brukman7e898c32004-07-20 00:41:46 +00001805 case cFP64:
Misha Brukman5b570812004-08-10 22:47:03 +00001806 BuildMI(BB, PPC::FMR, 1, Ret.Reg).addReg(PPC::F1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001807 break;
Chris Lattner3ea93462004-08-06 06:58:50 +00001808 case cLong: // Long values are in r3:r4
Misha Brukman5b570812004-08-10 22:47:03 +00001809 BuildMI(BB, PPC::OR, 2, Ret.Reg).addReg(PPC::R3).addReg(PPC::R3);
1810 BuildMI(BB, PPC::OR, 2, Ret.Reg+1).addReg(PPC::R4).addReg(PPC::R4);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001811 break;
1812 default: assert(0 && "Unknown class!");
1813 }
1814 }
1815}
1816
1817
1818/// visitCallInst - Push args on stack and do a procedure call instruction.
Misha Brukmana1dca552004-09-21 18:22:19 +00001819void PPC32ISel::visitCallInst(CallInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001820 MachineInstr *TheCall;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001821 Function *F = CI.getCalledFunction();
1822 if (F) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001823 // Is it an intrinsic function call?
1824 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID()) {
1825 visitIntrinsicCall(ID, CI); // Special intrinsics are not handled here
1826 return;
1827 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001828 // Emit a CALL instruction with PC-relative displacement.
Misha Brukman5b570812004-08-10 22:47:03 +00001829 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(F, true);
Misha Brukmane2eceb52004-07-23 16:08:20 +00001830 // Add it to the set of functions called to be used by the Printer
1831 TM.CalledFunctions.insert(F);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001832 } else { // Emit an indirect call through the CTR
1833 unsigned Reg = getReg(CI.getCalledValue());
Nate Begeman43d64ea2004-08-15 06:42:28 +00001834 BuildMI(BB, PPC::OR, 2, PPC::R12).addReg(Reg).addReg(Reg);
1835 BuildMI(BB, PPC::MTCTR, 1).addReg(PPC::R12);
1836 TheCall = BuildMI(PPC::CALLindirect, 2).addZImm(20).addZImm(0)
1837 .addReg(PPC::R12);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001838 }
1839
1840 std::vector<ValueRecord> Args;
1841 for (unsigned i = 1, e = CI.getNumOperands(); i != e; ++i)
1842 Args.push_back(ValueRecord(CI.getOperand(i)));
1843
1844 unsigned DestReg = CI.getType() != Type::VoidTy ? getReg(CI) : 0;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001845 bool isVarArg = F ? F->getFunctionType()->isVarArg() : true;
1846 doCall(ValueRecord(DestReg, CI.getType()), TheCall, Args, isVarArg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001847}
1848
1849
1850/// dyncastIsNan - Return the operand of an isnan operation if this is an isnan.
1851///
1852static Value *dyncastIsNan(Value *V) {
1853 if (CallInst *CI = dyn_cast<CallInst>(V))
1854 if (Function *F = CI->getCalledFunction())
Misha Brukmana2916ce2004-06-21 17:58:36 +00001855 if (F->getIntrinsicID() == Intrinsic::isunordered)
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001856 return CI->getOperand(1);
1857 return 0;
1858}
1859
1860/// isOnlyUsedByUnorderedComparisons - Return true if this value is only used by
1861/// or's whos operands are all calls to the isnan predicate.
1862static bool isOnlyUsedByUnorderedComparisons(Value *V) {
1863 assert(dyncastIsNan(V) && "The value isn't an isnan call!");
1864
1865 // Check all uses, which will be or's of isnans if this predicate is true.
1866 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;++UI){
1867 Instruction *I = cast<Instruction>(*UI);
1868 if (I->getOpcode() != Instruction::Or) return false;
1869 if (I->getOperand(0) != V && !dyncastIsNan(I->getOperand(0))) return false;
1870 if (I->getOperand(1) != V && !dyncastIsNan(I->getOperand(1))) return false;
1871 }
1872
1873 return true;
1874}
1875
1876/// LowerUnknownIntrinsicFunctionCalls - This performs a prepass over the
1877/// function, lowering any calls to unknown intrinsic functions into the
1878/// equivalent LLVM code.
1879///
Misha Brukmana1dca552004-09-21 18:22:19 +00001880void PPC32ISel::LowerUnknownIntrinsicFunctionCalls(Function &F) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001881 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
1882 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
1883 if (CallInst *CI = dyn_cast<CallInst>(I++))
1884 if (Function *F = CI->getCalledFunction())
1885 switch (F->getIntrinsicID()) {
1886 case Intrinsic::not_intrinsic:
1887 case Intrinsic::vastart:
1888 case Intrinsic::vacopy:
1889 case Intrinsic::vaend:
1890 case Intrinsic::returnaddress:
1891 case Intrinsic::frameaddress:
Misha Brukmanb097f212004-07-26 18:13:24 +00001892 // FIXME: should lower these ourselves
Misha Brukmana2916ce2004-06-21 17:58:36 +00001893 // case Intrinsic::isunordered:
Misha Brukmanb097f212004-07-26 18:13:24 +00001894 // case Intrinsic::memcpy: -> doCall(). system memcpy almost
1895 // guaranteed to be faster than anything we generate ourselves
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001896 // We directly implement these intrinsics
1897 break;
1898 case Intrinsic::readio: {
1899 // On PPC, memory operations are in-order. Lower this intrinsic
1900 // into a volatile load.
1901 Instruction *Before = CI->getPrev();
1902 LoadInst * LI = new LoadInst(CI->getOperand(1), "", true, CI);
1903 CI->replaceAllUsesWith(LI);
1904 BB->getInstList().erase(CI);
1905 break;
1906 }
1907 case Intrinsic::writeio: {
1908 // On PPC, memory operations are in-order. Lower this intrinsic
1909 // into a volatile store.
1910 Instruction *Before = CI->getPrev();
Misha Brukman8d442c22004-07-14 15:29:51 +00001911 StoreInst *SI = new StoreInst(CI->getOperand(1),
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001912 CI->getOperand(2), true, CI);
Misha Brukman8d442c22004-07-14 15:29:51 +00001913 CI->replaceAllUsesWith(SI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001914 BB->getInstList().erase(CI);
1915 break;
1916 }
1917 default:
1918 // All other intrinsic calls we must lower.
1919 Instruction *Before = CI->getPrev();
1920 TM.getIntrinsicLowering().LowerIntrinsicCall(CI);
1921 if (Before) { // Move iterator to instruction after call
1922 I = Before; ++I;
1923 } else {
1924 I = BB->begin();
1925 }
1926 }
1927}
1928
Misha Brukmana1dca552004-09-21 18:22:19 +00001929void PPC32ISel::visitIntrinsicCall(Intrinsic::ID ID, CallInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001930 unsigned TmpReg1, TmpReg2, TmpReg3;
1931 switch (ID) {
1932 case Intrinsic::vastart:
1933 // Get the address of the first vararg value...
1934 TmpReg1 = getReg(CI);
Misha Brukman5b570812004-08-10 22:47:03 +00001935 addFrameReference(BuildMI(BB, PPC::ADDI, 2, TmpReg1), VarArgsFrameIndex,
Misha Brukmanec6319a2004-07-20 15:51:37 +00001936 0, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001937 return;
1938
1939 case Intrinsic::vacopy:
1940 TmpReg1 = getReg(CI);
1941 TmpReg2 = getReg(CI.getOperand(1));
Misha Brukman5b570812004-08-10 22:47:03 +00001942 BuildMI(BB, PPC::OR, 2, TmpReg1).addReg(TmpReg2).addReg(TmpReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001943 return;
1944 case Intrinsic::vaend: return;
1945
1946 case Intrinsic::returnaddress:
Misha Brukmanec6319a2004-07-20 15:51:37 +00001947 TmpReg1 = getReg(CI);
1948 if (cast<Constant>(CI.getOperand(1))->isNullValue()) {
1949 MachineFrameInfo *MFI = F->getFrameInfo();
1950 unsigned NumBytes = MFI->getStackSize();
1951
Misha Brukman5b570812004-08-10 22:47:03 +00001952 BuildMI(BB, PPC::LWZ, 2, TmpReg1).addSImm(NumBytes+8)
1953 .addReg(PPC::R1);
Misha Brukmanec6319a2004-07-20 15:51:37 +00001954 } else {
1955 // Values other than zero are not implemented yet.
Misha Brukman5b570812004-08-10 22:47:03 +00001956 BuildMI(BB, PPC::LI, 1, TmpReg1).addSImm(0);
Misha Brukmanec6319a2004-07-20 15:51:37 +00001957 }
1958 return;
1959
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001960 case Intrinsic::frameaddress:
1961 TmpReg1 = getReg(CI);
1962 if (cast<Constant>(CI.getOperand(1))->isNullValue()) {
Misha Brukman5b570812004-08-10 22:47:03 +00001963 BuildMI(BB, PPC::OR, 2, TmpReg1).addReg(PPC::R1).addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001964 } else {
1965 // Values other than zero are not implemented yet.
Misha Brukman5b570812004-08-10 22:47:03 +00001966 BuildMI(BB, PPC::LI, 1, TmpReg1).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001967 }
1968 return;
Misha Brukmanb097f212004-07-26 18:13:24 +00001969
Misha Brukmana2916ce2004-06-21 17:58:36 +00001970#if 0
1971 // This may be useful for supporting isunordered
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001972 case Intrinsic::isnan:
1973 // If this is only used by 'isunordered' style comparisons, don't emit it.
1974 if (isOnlyUsedByUnorderedComparisons(&CI)) return;
1975 TmpReg1 = getReg(CI.getOperand(1));
1976 emitUCOM(BB, BB->end(), TmpReg1, TmpReg1);
Misha Brukman422791f2004-06-21 17:41:12 +00001977 TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00001978 BuildMI(BB, PPC::MFCR, TmpReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001979 TmpReg3 = getReg(CI);
Misha Brukman5b570812004-08-10 22:47:03 +00001980 BuildMI(BB, PPC::RLWINM, 4, TmpReg3).addReg(TmpReg2).addImm(4).addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001981 return;
Misha Brukmana2916ce2004-06-21 17:58:36 +00001982#endif
1983
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001984 default: assert(0 && "Error: unknown intrinsics should have been lowered!");
1985 }
1986}
1987
1988/// visitSimpleBinary - Implement simple binary operators for integral types...
1989/// OperatorClass is one of: 0 for Add, 1 for Sub, 2 for And, 3 for Or, 4 for
1990/// Xor.
1991///
Misha Brukmana1dca552004-09-21 18:22:19 +00001992void PPC32ISel::visitSimpleBinary(BinaryOperator &B, unsigned OperatorClass) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001993 unsigned DestReg = getReg(B);
1994 MachineBasicBlock::iterator MI = BB->end();
1995 Value *Op0 = B.getOperand(0), *Op1 = B.getOperand(1);
1996 unsigned Class = getClassB(B.getType());
1997
1998 emitSimpleBinaryOperation(BB, MI, Op0, Op1, OperatorClass, DestReg);
1999}
2000
2001/// emitBinaryFPOperation - This method handles emission of floating point
2002/// Add (0), Sub (1), Mul (2), and Div (3) operations.
Misha Brukmana1dca552004-09-21 18:22:19 +00002003void PPC32ISel::emitBinaryFPOperation(MachineBasicBlock *BB,
2004 MachineBasicBlock::iterator IP,
2005 Value *Op0, Value *Op1,
2006 unsigned OperatorClass, unsigned DestReg){
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002007
Nate Begeman6d1e2df2004-08-14 22:11:38 +00002008 static const unsigned OpcodeTab[][4] = {
2009 { PPC::FADDS, PPC::FSUBS, PPC::FMULS, PPC::FDIVS }, // Float
2010 { PPC::FADD, PPC::FSUB, PPC::FMUL, PPC::FDIV }, // Double
2011 };
2012
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002013 // Special case: R1 = op <const fp>, R2
Misha Brukmana596f8c2004-07-13 15:35:45 +00002014 if (ConstantFP *Op0C = dyn_cast<ConstantFP>(Op0))
2015 if (Op0C->isExactlyValue(-0.0) && OperatorClass == 1) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002016 // -0.0 - X === -X
2017 unsigned op1Reg = getReg(Op1, BB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00002018 BuildMI(*BB, IP, PPC::FNEG, 1, DestReg).addReg(op1Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002019 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002020 }
2021
Nate Begeman81d265d2004-08-19 05:20:54 +00002022 unsigned Opcode = OpcodeTab[Op0->getType() == Type::DoubleTy][OperatorClass];
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002023 unsigned Op0r = getReg(Op0, BB, IP);
2024 unsigned Op1r = getReg(Op1, BB, IP);
2025 BuildMI(*BB, IP, Opcode, 2, DestReg).addReg(Op0r).addReg(Op1r);
2026}
2027
Nate Begemanb816f022004-10-07 22:30:03 +00002028// ExactLog2 - This function solves for (Val == 1 << (N-1)) and returns N. It
2029// returns zero when the input is not exactly a power of two.
2030static unsigned ExactLog2(unsigned Val) {
2031 if (Val == 0 || (Val & (Val-1))) return 0;
2032 unsigned Count = 0;
2033 while (Val != 1) {
2034 Val >>= 1;
2035 ++Count;
2036 }
2037 return Count;
2038}
2039
Nate Begemanbdf69842004-10-08 02:49:24 +00002040// isRunOfOnes - returns true if Val consists of one contiguous run of 1's with
2041// any number of 0's on either side. the 1's are allowed to wrap from LSB to
2042// MSB. so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
2043// not, since all 1's are not contiguous.
2044static bool isRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME) {
2045 bool isRun = true;
2046 MB = 0;
2047 ME = 0;
2048
2049 // look for first set bit
2050 int i = 0;
2051 for (; i < 32; i++) {
2052 if ((Val & (1 << (31 - i))) != 0) {
2053 MB = i;
2054 ME = i;
2055 break;
2056 }
2057 }
2058
2059 // look for last set bit
2060 for (; i < 32; i++) {
2061 if ((Val & (1 << (31 - i))) == 0)
2062 break;
2063 ME = i;
2064 }
2065
2066 // look for next set bit
2067 for (; i < 32; i++) {
2068 if ((Val & (1 << (31 - i))) != 0)
2069 break;
2070 }
2071
2072 // if we exhausted all the bits, we found a match at this point for 0*1*0*
2073 if (i == 32)
2074 return true;
2075
2076 // since we just encountered more 1's, if it doesn't wrap around to the
2077 // most significant bit of the word, then we did not find a match to 1*0*1* so
2078 // exit.
2079 if (MB != 0)
2080 return false;
2081
2082 // look for last set bit
2083 for (MB = i; i < 32; i++) {
2084 if ((Val & (1 << (31 - i))) == 0)
2085 break;
2086 }
2087
2088 // if we exhausted all the bits, then we found a match for 1*0*1*, otherwise,
2089 // the value is not a run of ones.
2090 if (i == 32)
2091 return true;
2092 return false;
2093}
2094
Nate Begemanb816f022004-10-07 22:30:03 +00002095/// emitBinaryConstOperation - Implement simple binary operators for integral
2096/// types with a constant operand. Opcode is one of: 0 for Add, 1 for Sub,
2097/// 2 for And, 3 for Or, 4 for Xor, and 5 for Subtract-From.
2098///
2099void PPC32ISel::emitBinaryConstOperation(MachineBasicBlock *MBB,
2100 MachineBasicBlock::iterator IP,
2101 unsigned Op0Reg, ConstantInt *Op1,
2102 unsigned Opcode, unsigned DestReg) {
2103 static const unsigned OpTab[] = {
2104 PPC::ADD, PPC::SUB, PPC::AND, PPC::OR, PPC::XOR, PPC::SUBF
2105 };
2106 static const unsigned ImmOpTab[2][6] = {
2107 { PPC::ADDI, PPC::ADDI, PPC::ANDIo, PPC::ORI, PPC::XORI, PPC::SUBFIC },
2108 { PPC::ADDIS, PPC::ADDIS, PPC::ANDISo, PPC::ORIS, PPC::XORIS, PPC::SUBFIC }
2109 };
2110
2111 // Handle subtract now by inverting the constant value
2112 ConstantInt *CI = Op1;
2113 if (Opcode == 1) {
2114 ConstantSInt *CSI = dyn_cast<ConstantSInt>(Op1);
2115 CI = ConstantSInt::get(Op1->getType(), -CSI->getValue());
2116 }
2117
2118 // xor X, -1 -> not X
2119 if (Opcode == 4) {
2120 ConstantSInt *CSI = dyn_cast<ConstantSInt>(Op1);
2121 ConstantUInt *CUI = dyn_cast<ConstantUInt>(Op1);
2122 if ((CSI && CSI->isAllOnesValue()) || (CUI && CUI->isAllOnesValue())) {
2123 BuildMI(*MBB, IP, PPC::NOR, 2, DestReg).addReg(Op0Reg).addReg(Op0Reg);
2124 return;
2125 }
2126 }
Nate Begemanbdf69842004-10-08 02:49:24 +00002127
2128 if (Opcode == 2) {
2129 unsigned MB, ME, mask = CI->getRawValue();
2130 if (isRunOfOnes(mask, MB, ME)) {
2131 ++NumClear;
2132 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(Op0Reg).addImm(0)
2133 .addImm(MB).addImm(ME);
2134 return;
2135 }
2136 }
Nate Begemanb816f022004-10-07 22:30:03 +00002137
2138 // For Add, Sub, and SubF the instruction takes a signed immediate. For And,
2139 // Or, and Xor, the instruction takes an unsigned immediate. There is no
2140 // shifted immediate form of SubF so disallow its opcode for those constants.
2141 if (canUseAsImmediateForOpcode(CI, Opcode, false)) {
2142 if (Opcode < 2 || Opcode == 5)
2143 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(Op0Reg)
2144 .addSImm(Op1->getRawValue());
2145 else
2146 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(Op0Reg)
2147 .addZImm(Op1->getRawValue());
2148 } else if (canUseAsImmediateForOpcode(CI, Opcode, true) && (Opcode < 5)) {
2149 if (Opcode < 2)
2150 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, DestReg).addReg(Op0Reg)
2151 .addSImm(Op1->getRawValue() >> 16);
2152 else
2153 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, DestReg).addReg(Op0Reg)
2154 .addZImm(Op1->getRawValue() >> 16);
2155 } else {
2156 unsigned Op1Reg = getReg(Op1, MBB, IP);
2157 BuildMI(*MBB, IP, OpTab[Opcode], 2, DestReg).addReg(Op0Reg).addReg(Op1Reg);
2158 }
2159}
2160
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002161/// emitSimpleBinaryOperation - Implement simple binary operators for integral
2162/// types... OperatorClass is one of: 0 for Add, 1 for Sub, 2 for And, 3 for
2163/// Or, 4 for Xor.
2164///
Misha Brukmana1dca552004-09-21 18:22:19 +00002165void PPC32ISel::emitSimpleBinaryOperation(MachineBasicBlock *MBB,
2166 MachineBasicBlock::iterator IP,
2167 Value *Op0, Value *Op1,
2168 unsigned OperatorClass,
2169 unsigned DestReg) {
Misha Brukman422791f2004-06-21 17:41:12 +00002170 // Arithmetic and Bitwise operators
Misha Brukman911afde2004-06-25 14:50:41 +00002171 static const unsigned OpcodeTab[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00002172 PPC::ADD, PPC::SUB, PPC::AND, PPC::OR, PPC::XOR
Misha Brukman422791f2004-06-21 17:41:12 +00002173 };
Nate Begemanb816f022004-10-07 22:30:03 +00002174 static const unsigned LongOpTab[2][5] = {
2175 { PPC::ADDC, PPC::SUBC, PPC::AND, PPC::OR, PPC::XOR },
2176 { PPC::ADDE, PPC::SUBFE, PPC::AND, PPC::OR, PPC::XOR }
Misha Brukman422791f2004-06-21 17:41:12 +00002177 };
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002178
Nate Begemanb816f022004-10-07 22:30:03 +00002179 unsigned Class = getClassB(Op0->getType());
2180
Misha Brukman7e898c32004-07-20 00:41:46 +00002181 if (Class == cFP32 || Class == cFP64) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002182 assert(OperatorClass < 2 && "No logical ops for FP!");
2183 emitBinaryFPOperation(MBB, IP, Op0, Op1, OperatorClass, DestReg);
2184 return;
2185 }
2186
2187 if (Op0->getType() == Type::BoolTy) {
2188 if (OperatorClass == 3)
2189 // If this is an or of two isnan's, emit an FP comparison directly instead
2190 // of or'ing two isnan's together.
2191 if (Value *LHS = dyncastIsNan(Op0))
2192 if (Value *RHS = dyncastIsNan(Op1)) {
2193 unsigned Op0Reg = getReg(RHS, MBB, IP), Op1Reg = getReg(LHS, MBB, IP);
Misha Brukman422791f2004-06-21 17:41:12 +00002194 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002195 emitUCOM(MBB, IP, Op0Reg, Op1Reg);
Misha Brukman5b570812004-08-10 22:47:03 +00002196 BuildMI(*MBB, IP, PPC::MFCR, TmpReg);
2197 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(TmpReg).addImm(4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002198 .addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002199 return;
2200 }
2201 }
2202
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002203 // Special case: op <const int>, Reg
Nate Begemanb816f022004-10-07 22:30:03 +00002204 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op0))
Misha Brukman1013ef52004-07-21 20:09:08 +00002205 if (Class != cLong) {
Nate Begemanb816f022004-10-07 22:30:03 +00002206 unsigned Opcode = (OperatorClass == 1) ? 5 : OperatorClass;
2207 unsigned Op1r = getReg(Op1, MBB, IP);
2208 emitBinaryConstOperation(MBB, IP, Op1r, CI, Opcode, DestReg);
2209 return;
2210 }
2211 // Special case: op Reg, <const int>
2212 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1))
2213 if (Class != cLong) {
2214 unsigned Op0r = getReg(Op0, MBB, IP);
2215 emitBinaryConstOperation(MBB, IP, Op0r, CI, OperatorClass, DestReg);
Misha Brukman1013ef52004-07-21 20:09:08 +00002216 return;
2217 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002218
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002219 // We couldn't generate an immediate variant of the op, load both halves into
2220 // registers and emit the appropriate opcode.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002221 unsigned Op0r = getReg(Op0, MBB, IP);
2222 unsigned Op1r = getReg(Op1, MBB, IP);
2223
2224 if (Class != cLong) {
Misha Brukman422791f2004-06-21 17:41:12 +00002225 unsigned Opcode = OpcodeTab[OperatorClass];
2226 BuildMI(*MBB, IP, Opcode, 2, DestReg).addReg(Op0r).addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002227 } else {
Nate Begemanb816f022004-10-07 22:30:03 +00002228 BuildMI(*MBB, IP, LongOpTab[0][OperatorClass], 2, DestReg+1).addReg(Op0r+1)
Misha Brukman7e898c32004-07-20 00:41:46 +00002229 .addReg(Op1r+1);
Nate Begemanb816f022004-10-07 22:30:03 +00002230 BuildMI(*MBB, IP, LongOpTab[1][OperatorClass], 2, DestReg).addReg(Op0r)
Misha Brukman1013ef52004-07-21 20:09:08 +00002231 .addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002232 }
2233 return;
2234}
2235
Misha Brukman1013ef52004-07-21 20:09:08 +00002236/// doMultiply - Emit appropriate instructions to multiply together the
2237/// Values Op0 and Op1, and put the result in DestReg.
Misha Brukman2fec9902004-06-21 20:22:03 +00002238///
Misha Brukmana1dca552004-09-21 18:22:19 +00002239void PPC32ISel::doMultiply(MachineBasicBlock *MBB,
2240 MachineBasicBlock::iterator IP,
2241 unsigned DestReg, Value *Op0, Value *Op1) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002242 unsigned Class0 = getClass(Op0->getType());
2243 unsigned Class1 = getClass(Op1->getType());
2244
2245 unsigned Op0r = getReg(Op0, MBB, IP);
2246 unsigned Op1r = getReg(Op1, MBB, IP);
2247
2248 // 64 x 64 -> 64
2249 if (Class0 == cLong && Class1 == cLong) {
2250 unsigned Tmp1 = makeAnotherReg(Type::IntTy);
2251 unsigned Tmp2 = makeAnotherReg(Type::IntTy);
2252 unsigned Tmp3 = makeAnotherReg(Type::IntTy);
2253 unsigned Tmp4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00002254 BuildMI(*MBB, IP, PPC::MULHWU, 2, Tmp1).addReg(Op0r+1).addReg(Op1r+1);
2255 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg+1).addReg(Op0r+1).addReg(Op1r+1);
2256 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp2).addReg(Op0r+1).addReg(Op1r);
2257 BuildMI(*MBB, IP, PPC::ADD, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
2258 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp4).addReg(Op0r).addReg(Op1r+1);
2259 BuildMI(*MBB, IP, PPC::ADD, 2, DestReg).addReg(Tmp3).addReg(Tmp4);
Misha Brukman1013ef52004-07-21 20:09:08 +00002260 return;
2261 }
2262
2263 // 64 x 32 or less, promote 32 to 64 and do a 64 x 64
2264 if (Class0 == cLong && Class1 <= cInt) {
2265 unsigned Tmp0 = makeAnotherReg(Type::IntTy);
2266 unsigned Tmp1 = makeAnotherReg(Type::IntTy);
2267 unsigned Tmp2 = makeAnotherReg(Type::IntTy);
2268 unsigned Tmp3 = makeAnotherReg(Type::IntTy);
2269 unsigned Tmp4 = makeAnotherReg(Type::IntTy);
2270 if (Op1->getType()->isSigned())
Misha Brukman5b570812004-08-10 22:47:03 +00002271 BuildMI(*MBB, IP, PPC::SRAWI, 2, Tmp0).addReg(Op1r).addImm(31);
Misha Brukman1013ef52004-07-21 20:09:08 +00002272 else
Misha Brukman5b570812004-08-10 22:47:03 +00002273 BuildMI(*MBB, IP, PPC::LI, 2, Tmp0).addSImm(0);
2274 BuildMI(*MBB, IP, PPC::MULHWU, 2, Tmp1).addReg(Op0r+1).addReg(Op1r);
2275 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg+1).addReg(Op0r+1).addReg(Op1r);
2276 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp2).addReg(Op0r+1).addReg(Tmp0);
2277 BuildMI(*MBB, IP, PPC::ADD, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
2278 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp4).addReg(Op0r).addReg(Op1r);
2279 BuildMI(*MBB, IP, PPC::ADD, 2, DestReg).addReg(Tmp3).addReg(Tmp4);
Misha Brukman1013ef52004-07-21 20:09:08 +00002280 return;
2281 }
2282
2283 // 32 x 32 -> 32
2284 if (Class0 <= cInt && Class1 <= cInt) {
Misha Brukman5b570812004-08-10 22:47:03 +00002285 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg).addReg(Op0r).addReg(Op1r);
Misha Brukman1013ef52004-07-21 20:09:08 +00002286 return;
2287 }
2288
2289 assert(0 && "doMultiply cannot operate on unknown type!");
2290}
2291
2292/// doMultiplyConst - This method will multiply the value in Op0 by the
2293/// value of the ContantInt *CI
Misha Brukmana1dca552004-09-21 18:22:19 +00002294void PPC32ISel::doMultiplyConst(MachineBasicBlock *MBB,
2295 MachineBasicBlock::iterator IP,
2296 unsigned DestReg, Value *Op0, ConstantInt *CI) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002297 unsigned Class = getClass(Op0->getType());
2298
2299 // Mul op0, 0 ==> 0
2300 if (CI->isNullValue()) {
Misha Brukman5b570812004-08-10 22:47:03 +00002301 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00002302 if (Class == cLong)
Misha Brukman5b570812004-08-10 22:47:03 +00002303 BuildMI(*MBB, IP, PPC::LI, 1, DestReg+1).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002304 return;
Misha Brukman1013ef52004-07-21 20:09:08 +00002305 }
2306
2307 // Mul op0, 1 ==> op0
2308 if (CI->equalsInt(1)) {
2309 unsigned Op0r = getReg(Op0, MBB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00002310 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(Op0r).addReg(Op0r);
Misha Brukman1013ef52004-07-21 20:09:08 +00002311 if (Class == cLong)
Misha Brukman5b570812004-08-10 22:47:03 +00002312 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(Op0r+1).addReg(Op0r+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002313 return;
2314 }
2315
2316 // If the element size is exactly a power of 2, use a shift to get it.
Misha Brukman1013ef52004-07-21 20:09:08 +00002317 if (unsigned Shift = ExactLog2(CI->getRawValue())) {
2318 ConstantUInt *ShiftCI = ConstantUInt::get(Type::UByteTy, Shift);
2319 emitShiftOperation(MBB, IP, Op0, ShiftCI, true, Op0->getType(), DestReg);
2320 return;
2321 }
2322
2323 // If 32 bits or less and immediate is in right range, emit mul by immediate
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002324 if (Class == cByte || Class == cShort || Class == cInt) {
Nate Begemanb816f022004-10-07 22:30:03 +00002325 if (canUseAsImmediateForOpcode(CI, 0, false)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002326 unsigned Op0r = getReg(Op0, MBB, IP);
2327 unsigned imm = CI->getRawValue() & 0xFFFF;
Misha Brukman5b570812004-08-10 22:47:03 +00002328 BuildMI(*MBB, IP, PPC::MULLI, 2, DestReg).addReg(Op0r).addSImm(imm);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002329 return;
2330 }
2331 }
2332
Misha Brukman1013ef52004-07-21 20:09:08 +00002333 doMultiply(MBB, IP, DestReg, Op0, CI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002334}
2335
Misha Brukmana1dca552004-09-21 18:22:19 +00002336void PPC32ISel::visitMul(BinaryOperator &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002337 unsigned ResultReg = getReg(I);
2338
2339 Value *Op0 = I.getOperand(0);
2340 Value *Op1 = I.getOperand(1);
2341
2342 MachineBasicBlock::iterator IP = BB->end();
2343 emitMultiply(BB, IP, Op0, Op1, ResultReg);
2344}
2345
Misha Brukmana1dca552004-09-21 18:22:19 +00002346void PPC32ISel::emitMultiply(MachineBasicBlock *MBB,
2347 MachineBasicBlock::iterator IP,
2348 Value *Op0, Value *Op1, unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002349 TypeClass Class = getClass(Op0->getType());
2350
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002351 switch (Class) {
2352 case cByte:
2353 case cShort:
2354 case cInt:
Misha Brukman1013ef52004-07-21 20:09:08 +00002355 case cLong:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002356 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002357 doMultiplyConst(MBB, IP, DestReg, Op0, CI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002358 } else {
Misha Brukman1013ef52004-07-21 20:09:08 +00002359 doMultiply(MBB, IP, DestReg, Op0, Op1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002360 }
2361 return;
Misha Brukman7e898c32004-07-20 00:41:46 +00002362 case cFP32:
2363 case cFP64:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002364 emitBinaryFPOperation(MBB, IP, Op0, Op1, 2, DestReg);
2365 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002366 break;
2367 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002368}
2369
2370
2371/// visitDivRem - Handle division and remainder instructions... these
2372/// instruction both require the same instructions to be generated, they just
2373/// select the result from a different register. Note that both of these
2374/// instructions work differently for signed and unsigned operands.
2375///
Misha Brukmana1dca552004-09-21 18:22:19 +00002376void PPC32ISel::visitDivRem(BinaryOperator &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002377 unsigned ResultReg = getReg(I);
2378 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2379
2380 MachineBasicBlock::iterator IP = BB->end();
Misha Brukman2fec9902004-06-21 20:22:03 +00002381 emitDivRemOperation(BB, IP, Op0, Op1, I.getOpcode() == Instruction::Div,
2382 ResultReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002383}
2384
Nate Begeman087d5d92004-10-06 09:53:04 +00002385void PPC32ISel::emitDivRemOperation(MachineBasicBlock *MBB,
Misha Brukmana1dca552004-09-21 18:22:19 +00002386 MachineBasicBlock::iterator IP,
2387 Value *Op0, Value *Op1, bool isDiv,
2388 unsigned ResultReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002389 const Type *Ty = Op0->getType();
2390 unsigned Class = getClass(Ty);
2391 switch (Class) {
Misha Brukman7e898c32004-07-20 00:41:46 +00002392 case cFP32:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002393 if (isDiv) {
Misha Brukman7e898c32004-07-20 00:41:46 +00002394 // Floating point divide...
Nate Begeman087d5d92004-10-06 09:53:04 +00002395 emitBinaryFPOperation(MBB, IP, Op0, Op1, 3, ResultReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002396 return;
Misha Brukman7e898c32004-07-20 00:41:46 +00002397 } else {
2398 // Floating point remainder via fmodf(float x, float y);
Nate Begeman087d5d92004-10-06 09:53:04 +00002399 unsigned Op0Reg = getReg(Op0, MBB, IP);
2400 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman7e898c32004-07-20 00:41:46 +00002401 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002402 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(fmodfFn, true);
Misha Brukman7e898c32004-07-20 00:41:46 +00002403 std::vector<ValueRecord> Args;
2404 Args.push_back(ValueRecord(Op0Reg, Type::FloatTy));
2405 Args.push_back(ValueRecord(Op1Reg, Type::FloatTy));
2406 doCall(ValueRecord(ResultReg, Type::FloatTy), TheCall, Args, false);
Misha Brukmane2eceb52004-07-23 16:08:20 +00002407 TM.CalledFunctions.insert(fmodfFn);
Misha Brukman7e898c32004-07-20 00:41:46 +00002408 }
2409 return;
2410 case cFP64:
2411 if (isDiv) {
2412 // Floating point divide...
Nate Begeman087d5d92004-10-06 09:53:04 +00002413 emitBinaryFPOperation(MBB, IP, Op0, Op1, 3, ResultReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00002414 return;
2415 } else {
2416 // Floating point remainder via fmod(double x, double y);
Nate Begeman087d5d92004-10-06 09:53:04 +00002417 unsigned Op0Reg = getReg(Op0, MBB, IP);
2418 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002419 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002420 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(fmodFn, true);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002421 std::vector<ValueRecord> Args;
2422 Args.push_back(ValueRecord(Op0Reg, Type::DoubleTy));
2423 Args.push_back(ValueRecord(Op1Reg, Type::DoubleTy));
Misha Brukmand18a31d2004-07-06 22:51:53 +00002424 doCall(ValueRecord(ResultReg, Type::DoubleTy), TheCall, Args, false);
Misha Brukmane2eceb52004-07-23 16:08:20 +00002425 TM.CalledFunctions.insert(fmodFn);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002426 }
2427 return;
2428 case cLong: {
Misha Brukman7e898c32004-07-20 00:41:46 +00002429 static Function* const Funcs[] =
Misha Brukman0aa97c62004-07-08 18:27:59 +00002430 { __moddi3Fn, __divdi3Fn, __umoddi3Fn, __udivdi3Fn };
Nate Begeman087d5d92004-10-06 09:53:04 +00002431 unsigned Op0Reg = getReg(Op0, MBB, IP);
2432 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002433 unsigned NameIdx = Ty->isUnsigned()*2 + isDiv;
2434 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002435 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(Funcs[NameIdx], true);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002436
2437 std::vector<ValueRecord> Args;
2438 Args.push_back(ValueRecord(Op0Reg, Type::LongTy));
2439 Args.push_back(ValueRecord(Op1Reg, Type::LongTy));
Misha Brukmand18a31d2004-07-06 22:51:53 +00002440 doCall(ValueRecord(ResultReg, Type::LongTy), TheCall, Args, false);
Misha Brukmane2eceb52004-07-23 16:08:20 +00002441 TM.CalledFunctions.insert(Funcs[NameIdx]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002442 return;
2443 }
2444 case cByte: case cShort: case cInt:
2445 break; // Small integrals, handled below...
2446 default: assert(0 && "Unknown class!");
2447 }
2448
2449 // Special case signed division by power of 2.
2450 if (isDiv)
2451 if (ConstantSInt *CI = dyn_cast<ConstantSInt>(Op1)) {
2452 assert(Class != cLong && "This doesn't handle 64-bit divides!");
2453 int V = CI->getValue();
2454
2455 if (V == 1) { // X /s 1 => X
Nate Begeman087d5d92004-10-06 09:53:04 +00002456 unsigned Op0Reg = getReg(Op0, MBB, IP);
2457 BuildMI(*MBB, IP, PPC::OR, 2, ResultReg).addReg(Op0Reg).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002458 return;
2459 }
2460
2461 if (V == -1) { // X /s -1 => -X
Nate Begeman087d5d92004-10-06 09:53:04 +00002462 unsigned Op0Reg = getReg(Op0, MBB, IP);
2463 BuildMI(*MBB, IP, PPC::NEG, 1, ResultReg).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002464 return;
2465 }
2466
Misha Brukmanec6319a2004-07-20 15:51:37 +00002467 unsigned log2V = ExactLog2(V);
2468 if (log2V != 0 && Ty->isSigned()) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002469 unsigned Op0Reg = getReg(Op0, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002470 unsigned TmpReg = makeAnotherReg(Op0->getType());
Misha Brukmanec6319a2004-07-20 15:51:37 +00002471
Nate Begeman087d5d92004-10-06 09:53:04 +00002472 BuildMI(*MBB, IP, PPC::SRAWI, 2, TmpReg).addReg(Op0Reg).addImm(log2V);
2473 BuildMI(*MBB, IP, PPC::ADDZE, 1, ResultReg).addReg(TmpReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002474 return;
2475 }
2476 }
2477
Nate Begeman087d5d92004-10-06 09:53:04 +00002478 unsigned Op0Reg = getReg(Op0, MBB, IP);
2479
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002480 if (isDiv) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002481 unsigned Op1Reg = getReg(Op1, MBB, IP);
2482 unsigned Opcode = Ty->isSigned() ? PPC::DIVW : PPC::DIVWU;
2483 BuildMI(*MBB, IP, Opcode, 2, ResultReg).addReg(Op0Reg).addReg(Op1Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002484 } else { // Remainder
Nate Begeman087d5d92004-10-06 09:53:04 +00002485 // FIXME: don't load the CI part of a CI divide twice
2486 ConstantInt *CI = dyn_cast<ConstantInt>(Op1);
Misha Brukman422791f2004-06-21 17:41:12 +00002487 unsigned TmpReg1 = makeAnotherReg(Op0->getType());
2488 unsigned TmpReg2 = makeAnotherReg(Op0->getType());
Nate Begeman087d5d92004-10-06 09:53:04 +00002489 emitDivRemOperation(MBB, IP, Op0, Op1, true, TmpReg1);
Nate Begemanb816f022004-10-07 22:30:03 +00002490 if (CI && canUseAsImmediateForOpcode(CI, 0, false)) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002491 BuildMI(*MBB, IP, PPC::MULLI, 2, TmpReg2).addReg(TmpReg1)
2492 .addSImm(CI->getRawValue());
2493 } else {
2494 unsigned Op1Reg = getReg(Op1, MBB, IP);
2495 BuildMI(*MBB, IP, PPC::MULLW, 2, TmpReg2).addReg(TmpReg1).addReg(Op1Reg);
2496 }
2497 BuildMI(*MBB, IP, PPC::SUBF, 2, ResultReg).addReg(TmpReg2).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002498 }
2499}
2500
2501
2502/// Shift instructions: 'shl', 'sar', 'shr' - Some special cases here
2503/// for constant immediate shift values, and for constant immediate
2504/// shift values equal to 1. Even the general case is sort of special,
2505/// because the shift amount has to be in CL, not just any old register.
2506///
Misha Brukmana1dca552004-09-21 18:22:19 +00002507void PPC32ISel::visitShiftInst(ShiftInst &I) {
Misha Brukmane2eceb52004-07-23 16:08:20 +00002508 MachineBasicBlock::iterator IP = BB->end();
2509 emitShiftOperation(BB, IP, I.getOperand(0), I.getOperand(1),
2510 I.getOpcode() == Instruction::Shl, I.getType(),
2511 getReg(I));
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002512}
2513
2514/// emitShiftOperation - Common code shared between visitShiftInst and
2515/// constant expression support.
Misha Brukman2fec9902004-06-21 20:22:03 +00002516///
Misha Brukmana1dca552004-09-21 18:22:19 +00002517void PPC32ISel::emitShiftOperation(MachineBasicBlock *MBB,
2518 MachineBasicBlock::iterator IP,
2519 Value *Op, Value *ShiftAmount,
2520 bool isLeftShift, const Type *ResultTy,
2521 unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002522 unsigned SrcReg = getReg (Op, MBB, IP);
2523 bool isSigned = ResultTy->isSigned ();
2524 unsigned Class = getClass (ResultTy);
2525
2526 // Longs, as usual, are handled specially...
2527 if (Class == cLong) {
2528 // If we have a constant shift, we can generate much more efficient code
2529 // than otherwise...
2530 //
2531 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(ShiftAmount)) {
2532 unsigned Amount = CUI->getValue();
2533 if (Amount < 32) {
2534 if (isLeftShift) {
Misha Brukman422791f2004-06-21 17:41:12 +00002535 // FIXME: RLWIMI is a use-and-def of DestReg+1, but that violates SSA
Misha Brukman5b570812004-08-10 22:47:03 +00002536 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002537 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman5b570812004-08-10 22:47:03 +00002538 BuildMI(*MBB, IP, PPC::RLWIMI, 5).addReg(DestReg).addReg(SrcReg+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00002539 .addImm(Amount).addImm(32-Amount).addImm(31);
Misha Brukman5b570812004-08-10 22:47:03 +00002540 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg+1).addReg(SrcReg+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00002541 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002542 } else {
Misha Brukman422791f2004-06-21 17:41:12 +00002543 // FIXME: RLWIMI is a use-and-def of DestReg, but that violates SSA
Misha Brukman5b570812004-08-10 22:47:03 +00002544 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg+1).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002545 .addImm(32-Amount).addImm(Amount).addImm(31);
Misha Brukman5b570812004-08-10 22:47:03 +00002546 BuildMI(*MBB, IP, PPC::RLWIMI, 5).addReg(DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002547 .addImm(32-Amount).addImm(0).addImm(Amount-1);
Misha Brukman5b570812004-08-10 22:47:03 +00002548 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002549 .addImm(32-Amount).addImm(Amount).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002550 }
2551 } else { // Shifting more than 32 bits
2552 Amount -= 32;
2553 if (isLeftShift) {
2554 if (Amount != 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00002555 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002556 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002557 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002558 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002559 .addReg(SrcReg+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002560 }
Misha Brukman5b570812004-08-10 22:47:03 +00002561 BuildMI(*MBB, IP, PPC::LI, 1, DestReg+1).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00002562 } else {
2563 if (Amount != 0) {
2564 if (isSigned)
Misha Brukman5b570812004-08-10 22:47:03 +00002565 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002566 .addImm(Amount);
2567 else
Misha Brukman5b570812004-08-10 22:47:03 +00002568 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002569 .addImm(32-Amount).addImm(Amount).addImm(31);
2570 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002571 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002572 .addReg(SrcReg);
2573 }
Misha Brukman5b570812004-08-10 22:47:03 +00002574 BuildMI(*MBB, IP,PPC::LI, 1, DestReg).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002575 }
2576 }
2577 } else {
2578 unsigned TmpReg1 = makeAnotherReg(Type::IntTy);
2579 unsigned TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman422791f2004-06-21 17:41:12 +00002580 unsigned TmpReg3 = makeAnotherReg(Type::IntTy);
2581 unsigned TmpReg4 = makeAnotherReg(Type::IntTy);
2582 unsigned TmpReg5 = makeAnotherReg(Type::IntTy);
2583 unsigned TmpReg6 = makeAnotherReg(Type::IntTy);
2584 unsigned ShiftAmountReg = getReg (ShiftAmount, MBB, IP);
2585
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002586 if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002587 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002588 .addSImm(32);
Misha Brukman5b570812004-08-10 22:47:03 +00002589 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg2).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002590 .addReg(ShiftAmountReg);
Misha Brukman5b570812004-08-10 22:47:03 +00002591 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg3).addReg(SrcReg+1)
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002592 .addReg(TmpReg1);
Misha Brukman5b570812004-08-10 22:47:03 +00002593 BuildMI(*MBB, IP, PPC::OR, 2,TmpReg4).addReg(TmpReg2).addReg(TmpReg3);
2594 BuildMI(*MBB, IP, PPC::ADDI, 2, TmpReg5).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002595 .addSImm(-32);
Misha Brukman5b570812004-08-10 22:47:03 +00002596 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg6).addReg(SrcReg+1)
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002597 .addReg(TmpReg5);
Misha Brukman5b570812004-08-10 22:47:03 +00002598 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(TmpReg4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002599 .addReg(TmpReg6);
Misha Brukman5b570812004-08-10 22:47:03 +00002600 BuildMI(*MBB, IP, PPC::SLW, 2, DestReg+1).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002601 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002602 } else {
Nate Begemanf2f07812004-08-29 08:19:32 +00002603 if (isSigned) { // shift right algebraic
2604 MachineBasicBlock *TmpMBB =new MachineBasicBlock(BB->getBasicBlock());
2605 MachineBasicBlock *PhiMBB =new MachineBasicBlock(BB->getBasicBlock());
2606 MachineBasicBlock *OldMBB = BB;
2607 ilist<MachineBasicBlock>::iterator It = BB; ++It;
2608 F->getBasicBlockList().insert(It, TmpMBB);
2609 F->getBasicBlockList().insert(It, PhiMBB);
2610 BB->addSuccessor(TmpMBB);
2611 BB->addSuccessor(PhiMBB);
2612
2613 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
2614 .addSImm(32);
2615 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg2).addReg(SrcReg+1)
2616 .addReg(ShiftAmountReg);
2617 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg3).addReg(SrcReg)
2618 .addReg(TmpReg1);
2619 BuildMI(*MBB, IP, PPC::OR, 2, TmpReg4).addReg(TmpReg2)
2620 .addReg(TmpReg3);
2621 BuildMI(*MBB, IP, PPC::ADDICo, 2, TmpReg5).addReg(ShiftAmountReg)
2622 .addSImm(-32);
2623 BuildMI(*MBB, IP, PPC::SRAW, 2, TmpReg6).addReg(SrcReg)
2624 .addReg(TmpReg5);
2625 BuildMI(*MBB, IP, PPC::SRAW, 2, DestReg).addReg(SrcReg)
2626 .addReg(ShiftAmountReg);
2627 BuildMI(*MBB, IP, PPC::BLE, 2).addReg(PPC::CR0).addMBB(PhiMBB);
2628
2629 // OrMBB:
2630 // Select correct least significant half if the shift amount > 32
2631 BB = TmpMBB;
2632 unsigned OrReg = makeAnotherReg(Type::IntTy);
2633 BuildMI(BB, PPC::OR, 2, OrReg).addReg(TmpReg6).addImm(TmpReg6);
2634 TmpMBB->addSuccessor(PhiMBB);
2635
2636 BB = PhiMBB;
2637 BuildMI(BB, PPC::PHI, 4, DestReg+1).addReg(TmpReg4).addMBB(OldMBB)
2638 .addReg(OrReg).addMBB(TmpMBB);
2639 } else { // shift right logical
Misha Brukman5b570812004-08-10 22:47:03 +00002640 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002641 .addSImm(32);
Misha Brukman5b570812004-08-10 22:47:03 +00002642 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg2).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002643 .addReg(ShiftAmountReg);
Misha Brukman5b570812004-08-10 22:47:03 +00002644 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg3).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002645 .addReg(TmpReg1);
Misha Brukman5b570812004-08-10 22:47:03 +00002646 BuildMI(*MBB, IP, PPC::OR, 2, TmpReg4).addReg(TmpReg2)
Misha Brukman2fec9902004-06-21 20:22:03 +00002647 .addReg(TmpReg3);
Misha Brukman5b570812004-08-10 22:47:03 +00002648 BuildMI(*MBB, IP, PPC::ADDI, 2, TmpReg5).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002649 .addSImm(-32);
Misha Brukman5b570812004-08-10 22:47:03 +00002650 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg6).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002651 .addReg(TmpReg5);
Misha Brukman5b570812004-08-10 22:47:03 +00002652 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(TmpReg4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002653 .addReg(TmpReg6);
Misha Brukman5b570812004-08-10 22:47:03 +00002654 BuildMI(*MBB, IP, PPC::SRW, 2, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002655 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002656 }
2657 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002658 }
2659 return;
2660 }
2661
2662 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(ShiftAmount)) {
2663 // The shift amount is constant, guaranteed to be a ubyte. Get its value.
2664 assert(CUI->getType() == Type::UByteTy && "Shift amount not a ubyte?");
2665 unsigned Amount = CUI->getValue();
2666
Misha Brukman422791f2004-06-21 17:41:12 +00002667 if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002668 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002669 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman422791f2004-06-21 17:41:12 +00002670 } else {
Misha Brukman2fec9902004-06-21 20:22:03 +00002671 if (isSigned) {
Misha Brukman5b570812004-08-10 22:47:03 +00002672 BuildMI(*MBB, IP, PPC::SRAWI,2,DestReg).addReg(SrcReg).addImm(Amount);
Misha Brukman2fec9902004-06-21 20:22:03 +00002673 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002674 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002675 .addImm(32-Amount).addImm(Amount).addImm(31);
2676 }
Misha Brukman422791f2004-06-21 17:41:12 +00002677 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002678 } else { // The shift amount is non-constant.
2679 unsigned ShiftAmountReg = getReg (ShiftAmount, MBB, IP);
2680
Misha Brukman422791f2004-06-21 17:41:12 +00002681 if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002682 BuildMI(*MBB, IP, PPC::SLW, 2, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002683 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002684 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002685 BuildMI(*MBB, IP, isSigned ? PPC::SRAW : PPC::SRW, 2, DestReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002686 .addReg(SrcReg).addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002687 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002688 }
2689}
2690
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002691/// LoadNeedsSignExtend - On PowerPC, there is no load byte with sign extend.
2692/// Therefore, if this is a byte load and the destination type is signed, we
Nate Begeman35b020d2004-10-06 11:03:30 +00002693/// would normally need to also emit a sign extend instruction after the load.
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002694/// However, store instructions don't care whether a signed type was sign
2695/// extended across a whole register. Also, a SetCC instruction will emit its
2696/// own sign extension to force the value into the appropriate range, so we
2697/// need not emit it here. Ideally, this kind of thing wouldn't be necessary
2698/// once LLVM's type system is improved.
2699static bool LoadNeedsSignExtend(LoadInst &LI) {
2700 if (cByte == getClassB(LI.getType()) && LI.getType()->isSigned()) {
2701 bool AllUsesAreStoresOrSetCC = true;
Nate Begeman35b020d2004-10-06 11:03:30 +00002702 for (Value::use_iterator I = LI.use_begin(), E = LI.use_end(); I != E; ++I){
Chris Lattner7c348e12004-10-06 16:28:24 +00002703 if (isa<SetCondInst>(*I))
Nate Begeman35b020d2004-10-06 11:03:30 +00002704 continue;
Chris Lattner7c348e12004-10-06 16:28:24 +00002705 if (StoreInst *SI = dyn_cast<StoreInst>(*I))
Nate Begemanb816f022004-10-07 22:30:03 +00002706 if (cByte == getClassB(SI->getOperand(0)->getType()))
Nate Begeman35b020d2004-10-06 11:03:30 +00002707 continue;
2708 AllUsesAreStoresOrSetCC = false;
2709 break;
2710 }
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002711 if (!AllUsesAreStoresOrSetCC)
2712 return true;
2713 }
2714 return false;
2715}
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002716
Misha Brukmanb097f212004-07-26 18:13:24 +00002717/// visitLoadInst - Implement LLVM load instructions. Pretty straightforward
2718/// mapping of LLVM classes to PPC load instructions, with the exception of
2719/// signed byte loads, which need a sign extension following them.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002720///
Misha Brukmana1dca552004-09-21 18:22:19 +00002721void PPC32ISel::visitLoadInst(LoadInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00002722 // Immediate opcodes, for reg+imm addressing
2723 static const unsigned ImmOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00002724 PPC::LBZ, PPC::LHZ, PPC::LWZ,
2725 PPC::LFS, PPC::LFD, PPC::LWZ
Misha Brukmanb097f212004-07-26 18:13:24 +00002726 };
2727 // Indexed opcodes, for reg+reg addressing
2728 static const unsigned IdxOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00002729 PPC::LBZX, PPC::LHZX, PPC::LWZX,
2730 PPC::LFSX, PPC::LFDX, PPC::LWZX
Misha Brukman2fec9902004-06-21 20:22:03 +00002731 };
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002732
Misha Brukmanb097f212004-07-26 18:13:24 +00002733 unsigned Class = getClassB(I.getType());
2734 unsigned ImmOpcode = ImmOpcodes[Class];
2735 unsigned IdxOpcode = IdxOpcodes[Class];
2736 unsigned DestReg = getReg(I);
2737 Value *SourceAddr = I.getOperand(0);
2738
Misha Brukman5b570812004-08-10 22:47:03 +00002739 if (Class == cShort && I.getType()->isSigned()) ImmOpcode = PPC::LHA;
2740 if (Class == cShort && I.getType()->isSigned()) IdxOpcode = PPC::LHAX;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002741
Misha Brukmanb097f212004-07-26 18:13:24 +00002742 if (AllocaInst *AI = dyn_castFixedAlloca(SourceAddr)) {
Misha Brukman422791f2004-06-21 17:41:12 +00002743 unsigned FI = getFixedSizedAllocaFI(AI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002744 if (Class == cLong) {
Misha Brukmanb097f212004-07-26 18:13:24 +00002745 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg), FI);
2746 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg+1), FI, 4);
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002747 } else if (LoadNeedsSignExtend(I)) {
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002748 unsigned TmpReg = makeAnotherReg(I.getType());
Misha Brukmanb097f212004-07-26 18:13:24 +00002749 addFrameReference(BuildMI(BB, ImmOpcode, 2, TmpReg), FI);
Misha Brukman5b570812004-08-10 22:47:03 +00002750 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002751 } else {
Misha Brukmanb097f212004-07-26 18:13:24 +00002752 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +00002753 }
Misha Brukmanb097f212004-07-26 18:13:24 +00002754 return;
2755 }
2756
Nate Begeman645495d2004-09-23 05:31:33 +00002757 // If the offset fits in 16 bits, we can emit a reg+imm load, otherwise, we
2758 // use the index from the FoldedGEP struct and use reg+reg addressing.
Misha Brukmanb097f212004-07-26 18:13:24 +00002759 if (GetElementPtrInst *GEPI = canFoldGEPIntoLoadOrStore(SourceAddr)) {
Misha Brukmanb097f212004-07-26 18:13:24 +00002760
Nate Begeman645495d2004-09-23 05:31:33 +00002761 // Generate the code for the GEP and get the components of the folded GEP
2762 emitGEPOperation(BB, BB->end(), GEPI, true);
2763 unsigned baseReg = GEPMap[GEPI].base;
2764 unsigned indexReg = GEPMap[GEPI].index;
2765 ConstantSInt *offset = GEPMap[GEPI].offset;
2766
2767 if (Class != cLong) {
2768 unsigned TmpReg = makeAnotherReg(I.getType());
2769 if (indexReg == 0)
Misha Brukmanb097f212004-07-26 18:13:24 +00002770 BuildMI(BB, ImmOpcode, 2, TmpReg).addSImm(offset->getValue())
2771 .addReg(baseReg);
Nate Begeman645495d2004-09-23 05:31:33 +00002772 else
2773 BuildMI(BB, IdxOpcode, 2, TmpReg).addReg(indexReg).addReg(baseReg);
2774 if (LoadNeedsSignExtend(I))
Misha Brukman5b570812004-08-10 22:47:03 +00002775 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Nate Begeman645495d2004-09-23 05:31:33 +00002776 else
2777 BuildMI(BB, PPC::OR, 2, DestReg).addReg(TmpReg).addReg(TmpReg);
2778 } else {
2779 indexReg = (indexReg != 0) ? indexReg : getReg(offset);
Misha Brukmanb097f212004-07-26 18:13:24 +00002780 unsigned indexPlus4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00002781 BuildMI(BB, PPC::ADDI, 2, indexPlus4).addReg(indexReg).addSImm(4);
Misha Brukmanb097f212004-07-26 18:13:24 +00002782 BuildMI(BB, IdxOpcode, 2, DestReg).addReg(indexReg).addReg(baseReg);
2783 BuildMI(BB, IdxOpcode, 2, DestReg+1).addReg(indexPlus4).addReg(baseReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002784 }
Misha Brukmanb097f212004-07-26 18:13:24 +00002785 return;
2786 }
2787
2788 // The fallback case, where the load was from a source that could not be
2789 // folded into the load instruction.
2790 unsigned SrcAddrReg = getReg(SourceAddr);
2791
2792 if (Class == cLong) {
2793 BuildMI(BB, ImmOpcode, 2, DestReg).addSImm(0).addReg(SrcAddrReg);
2794 BuildMI(BB, ImmOpcode, 2, DestReg+1).addSImm(4).addReg(SrcAddrReg);
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002795 } else if (LoadNeedsSignExtend(I)) {
Misha Brukmanb097f212004-07-26 18:13:24 +00002796 unsigned TmpReg = makeAnotherReg(I.getType());
2797 BuildMI(BB, ImmOpcode, 2, TmpReg).addSImm(0).addReg(SrcAddrReg);
Misha Brukman5b570812004-08-10 22:47:03 +00002798 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00002799 } else {
2800 BuildMI(BB, ImmOpcode, 2, DestReg).addSImm(0).addReg(SrcAddrReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002801 }
2802}
2803
2804/// visitStoreInst - Implement LLVM store instructions
2805///
Misha Brukmana1dca552004-09-21 18:22:19 +00002806void PPC32ISel::visitStoreInst(StoreInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00002807 // Immediate opcodes, for reg+imm addressing
2808 static const unsigned ImmOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00002809 PPC::STB, PPC::STH, PPC::STW,
2810 PPC::STFS, PPC::STFD, PPC::STW
Misha Brukmanb097f212004-07-26 18:13:24 +00002811 };
2812 // Indexed opcodes, for reg+reg addressing
2813 static const unsigned IdxOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00002814 PPC::STBX, PPC::STHX, PPC::STWX,
2815 PPC::STFSX, PPC::STFDX, PPC::STWX
Misha Brukmanb097f212004-07-26 18:13:24 +00002816 };
2817
2818 Value *SourceAddr = I.getOperand(1);
2819 const Type *ValTy = I.getOperand(0)->getType();
2820 unsigned Class = getClassB(ValTy);
2821 unsigned ImmOpcode = ImmOpcodes[Class];
2822 unsigned IdxOpcode = IdxOpcodes[Class];
2823 unsigned ValReg = getReg(I.getOperand(0));
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002824
Nate Begeman645495d2004-09-23 05:31:33 +00002825 // If the offset fits in 16 bits, we can emit a reg+imm store, otherwise, we
2826 // use the index from the FoldedGEP struct and use reg+reg addressing.
Misha Brukmanb097f212004-07-26 18:13:24 +00002827 if (GetElementPtrInst *GEPI = canFoldGEPIntoLoadOrStore(SourceAddr)) {
Nate Begeman645495d2004-09-23 05:31:33 +00002828 // Generate the code for the GEP and get the components of the folded GEP
2829 emitGEPOperation(BB, BB->end(), GEPI, true);
2830 unsigned baseReg = GEPMap[GEPI].base;
2831 unsigned indexReg = GEPMap[GEPI].index;
2832 ConstantSInt *offset = GEPMap[GEPI].offset;
Misha Brukmanb097f212004-07-26 18:13:24 +00002833
Nate Begeman645495d2004-09-23 05:31:33 +00002834 if (Class != cLong) {
2835 if (indexReg == 0)
2836 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(offset->getValue())
2837 .addReg(baseReg);
2838 else
2839 BuildMI(BB, IdxOpcode, 3).addReg(ValReg).addReg(indexReg)
2840 .addReg(baseReg);
2841 } else {
2842 indexReg = (indexReg != 0) ? indexReg : getReg(offset);
Misha Brukmanb097f212004-07-26 18:13:24 +00002843 unsigned indexPlus4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00002844 BuildMI(BB, PPC::ADDI, 2, indexPlus4).addReg(indexReg).addSImm(4);
Misha Brukmanb097f212004-07-26 18:13:24 +00002845 BuildMI(BB, IdxOpcode, 3).addReg(ValReg).addReg(indexReg).addReg(baseReg);
2846 BuildMI(BB, IdxOpcode, 3).addReg(ValReg+1).addReg(indexPlus4)
2847 .addReg(baseReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00002848 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002849 return;
2850 }
Misha Brukmanb097f212004-07-26 18:13:24 +00002851
2852 // If the store address wasn't the only use of a GEP, we fall back to the
2853 // standard path: store the ValReg at the value in AddressReg.
2854 unsigned AddressReg = getReg(I.getOperand(1));
2855 if (Class == cLong) {
2856 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(0).addReg(AddressReg);
2857 BuildMI(BB, ImmOpcode, 3).addReg(ValReg+1).addSImm(4).addReg(AddressReg);
2858 return;
2859 }
2860 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(0).addReg(AddressReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002861}
2862
2863
2864/// visitCastInst - Here we have various kinds of copying with or without sign
2865/// extension going on.
2866///
Misha Brukmana1dca552004-09-21 18:22:19 +00002867void PPC32ISel::visitCastInst(CastInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002868 Value *Op = CI.getOperand(0);
2869
2870 unsigned SrcClass = getClassB(Op->getType());
2871 unsigned DestClass = getClassB(CI.getType());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002872
2873 // 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 +00002874 // of the cast are GEP instructions, then the cast does not need to be
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002875 // generated explicitly, it will be folded into the GEP.
2876 if (DestClass == cLong && SrcClass == cInt) {
2877 bool AllUsesAreGEPs = true;
2878 for (Value::use_iterator I = CI.use_begin(), E = CI.use_end(); I != E; ++I)
2879 if (!isa<GetElementPtrInst>(*I)) {
2880 AllUsesAreGEPs = false;
2881 break;
2882 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002883 if (AllUsesAreGEPs) return;
2884 }
Nate Begeman1e67d4d2004-08-19 08:07:50 +00002885
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002886 unsigned DestReg = getReg(CI);
2887 MachineBasicBlock::iterator MI = BB->end();
Nate Begeman1e67d4d2004-08-19 08:07:50 +00002888
2889 // If this is a cast from an byte, short, or int to an integer type of equal
2890 // or lesser width, and all uses of the cast are store instructions then dont
2891 // emit them, as the store instruction will implicitly not store the zero or
2892 // sign extended bytes.
2893 if (SrcClass <= cInt && SrcClass >= DestClass) {
2894 bool AllUsesAreStoresOrSetCC = true;
2895 for (Value::use_iterator I = CI.use_begin(), E = CI.use_end(); I != E; ++I)
2896 if (!isa<StoreInst>(*I) && !isa<SetCondInst>(*I)) {
2897 AllUsesAreStoresOrSetCC = false;
2898 break;
2899 }
2900 // Turn this cast directly into a move instruction, which the register
2901 // allocator will deal with.
2902 if (AllUsesAreStoresOrSetCC) {
2903 unsigned SrcReg = getReg(Op, BB, MI);
2904 BuildMI(*BB, MI, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
2905 return;
2906 }
2907 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002908 emitCastOperation(BB, MI, Op, CI.getType(), DestReg);
2909}
2910
2911/// emitCastOperation - Common code shared between visitCastInst and constant
2912/// expression cast support.
2913///
Misha Brukmana1dca552004-09-21 18:22:19 +00002914void PPC32ISel::emitCastOperation(MachineBasicBlock *MBB,
2915 MachineBasicBlock::iterator IP,
2916 Value *Src, const Type *DestTy,
2917 unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002918 const Type *SrcTy = Src->getType();
2919 unsigned SrcClass = getClassB(SrcTy);
2920 unsigned DestClass = getClassB(DestTy);
Misha Brukman7e898c32004-07-20 00:41:46 +00002921 unsigned SrcReg = getReg(Src, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002922
2923 // Implement casts to bool by using compare on the operand followed by set if
2924 // not zero on the result.
2925 if (DestTy == Type::BoolTy) {
2926 switch (SrcClass) {
2927 case cByte:
Misha Brukman422791f2004-06-21 17:41:12 +00002928 case cShort:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002929 case cInt: {
2930 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00002931 BuildMI(*MBB, IP, PPC::ADDIC, 2, TmpReg).addReg(SrcReg).addSImm(-1);
2932 BuildMI(*MBB, IP, PPC::SUBFE, 2, DestReg).addReg(TmpReg).addReg(SrcReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002933 break;
2934 }
2935 case cLong: {
2936 unsigned TmpReg = makeAnotherReg(Type::IntTy);
2937 unsigned SrcReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00002938 BuildMI(*MBB, IP, PPC::OR, 2, SrcReg2).addReg(SrcReg).addReg(SrcReg+1);
2939 BuildMI(*MBB, IP, PPC::ADDIC, 2, TmpReg).addReg(SrcReg2).addSImm(-1);
2940 BuildMI(*MBB, IP, PPC::SUBFE, 2, DestReg).addReg(TmpReg)
Misha Brukmanbf417a62004-07-20 20:43:05 +00002941 .addReg(SrcReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002942 break;
2943 }
Misha Brukman7e898c32004-07-20 00:41:46 +00002944 case cFP32:
2945 case cFP64:
Nate Begemanf2f07812004-08-29 08:19:32 +00002946 unsigned TmpReg = makeAnotherReg(Type::IntTy);
2947 unsigned ConstZero = getReg(ConstantFP::get(Type::DoubleTy, 0.0), BB, IP);
2948 BuildMI(*MBB, IP, PPC::FCMPU, PPC::CR7).addReg(SrcReg).addReg(ConstZero);
2949 BuildMI(*MBB, IP, PPC::MFCR, TmpReg);
2950 BuildMI(*MBB, IP, PPC::RLWINM, DestReg).addReg(TmpReg).addImm(31)
2951 .addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002952 }
2953 return;
2954 }
2955
Misha Brukman7e898c32004-07-20 00:41:46 +00002956 // Handle cast of Float -> Double
2957 if (SrcClass == cFP32 && DestClass == cFP64) {
Misha Brukman5b570812004-08-10 22:47:03 +00002958 BuildMI(*MBB, IP, PPC::FMR, 1, DestReg).addReg(SrcReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00002959 return;
2960 }
2961
2962 // Handle cast of Double -> Float
2963 if (SrcClass == cFP64 && DestClass == cFP32) {
Misha Brukman5b570812004-08-10 22:47:03 +00002964 BuildMI(*MBB, IP, PPC::FRSP, 1, DestReg).addReg(SrcReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00002965 return;
2966 }
2967
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002968 // Handle casts from integer to floating point now...
Misha Brukman7e898c32004-07-20 00:41:46 +00002969 if (DestClass == cFP32 || DestClass == cFP64) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002970
Misha Brukman422791f2004-06-21 17:41:12 +00002971 // Emit a library call for long to float conversion
2972 if (SrcClass == cLong) {
Misha Brukman7e898c32004-07-20 00:41:46 +00002973 Function *floatFn = (DestClass == cFP32) ? __floatdisfFn : __floatdidfFn;
Nate Begemanf2f07812004-08-29 08:19:32 +00002974 if (SrcTy->isSigned()) {
2975 std::vector<ValueRecord> Args;
2976 Args.push_back(ValueRecord(SrcReg, SrcTy));
2977 MachineInstr *TheCall =
2978 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
2979 doCall(ValueRecord(DestReg, DestTy), TheCall, Args, false);
2980 TM.CalledFunctions.insert(floatFn);
2981 } else {
2982 std::vector<ValueRecord> CmpArgs, ClrArgs, SetArgs;
2983 unsigned ZeroLong = getReg(ConstantUInt::get(SrcTy, 0));
2984 unsigned CondReg = makeAnotherReg(Type::IntTy);
2985
2986 // Update machine-CFG edges
2987 MachineBasicBlock *ClrMBB = new MachineBasicBlock(BB->getBasicBlock());
2988 MachineBasicBlock *SetMBB = new MachineBasicBlock(BB->getBasicBlock());
2989 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
2990 MachineBasicBlock *OldMBB = BB;
2991 ilist<MachineBasicBlock>::iterator It = BB; ++It;
2992 F->getBasicBlockList().insert(It, ClrMBB);
2993 F->getBasicBlockList().insert(It, SetMBB);
2994 F->getBasicBlockList().insert(It, PhiMBB);
2995 BB->addSuccessor(ClrMBB);
2996 BB->addSuccessor(SetMBB);
2997
2998 CmpArgs.push_back(ValueRecord(SrcReg, SrcTy));
2999 CmpArgs.push_back(ValueRecord(ZeroLong, SrcTy));
3000 MachineInstr *TheCall =
3001 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(__cmpdi2Fn, true);
3002 doCall(ValueRecord(CondReg, Type::IntTy), TheCall, CmpArgs, false);
3003 TM.CalledFunctions.insert(__cmpdi2Fn);
3004 BuildMI(*MBB, IP, PPC::CMPWI, 2, PPC::CR0).addReg(CondReg).addSImm(0);
3005 BuildMI(*MBB, IP, PPC::BLE, 2).addReg(PPC::CR0).addMBB(SetMBB);
3006
3007 // ClrMBB
3008 BB = ClrMBB;
3009 unsigned ClrReg = makeAnotherReg(DestTy);
3010 ClrArgs.push_back(ValueRecord(SrcReg, SrcTy));
3011 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3012 doCall(ValueRecord(ClrReg, DestTy), TheCall, ClrArgs, false);
3013 TM.CalledFunctions.insert(floatFn);
3014 BuildMI(BB, PPC::B, 1).addMBB(PhiMBB);
3015 BB->addSuccessor(PhiMBB);
3016
3017 // SetMBB
3018 BB = SetMBB;
3019 unsigned SetReg = makeAnotherReg(DestTy);
3020 unsigned CallReg = makeAnotherReg(DestTy);
3021 unsigned ShiftedReg = makeAnotherReg(SrcTy);
3022 ConstantSInt *Const1 = ConstantSInt::get(Type::IntTy, 1);
3023 emitShiftOperation(BB, BB->end(), Src, Const1, false, SrcTy, ShiftedReg);
3024 SetArgs.push_back(ValueRecord(ShiftedReg, SrcTy));
3025 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3026 doCall(ValueRecord(CallReg, DestTy), TheCall, SetArgs, false);
3027 TM.CalledFunctions.insert(floatFn);
3028 unsigned SetOpcode = (DestClass == cFP32) ? PPC::FADDS : PPC::FADD;
3029 BuildMI(BB, SetOpcode, 2, SetReg).addReg(CallReg).addReg(CallReg);
3030 BB->addSuccessor(PhiMBB);
3031
3032 // PhiMBB
3033 BB = PhiMBB;
3034 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(ClrReg).addMBB(ClrMBB)
3035 .addReg(SetReg).addMBB(SetMBB);
3036 }
Misha Brukman422791f2004-06-21 17:41:12 +00003037 return;
3038 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003039
Misha Brukman7e898c32004-07-20 00:41:46 +00003040 // Make sure we're dealing with a full 32 bits
3041 unsigned TmpReg = makeAnotherReg(Type::IntTy);
3042 promote32(TmpReg, ValueRecord(SrcReg, SrcTy));
3043
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003044 SrcReg = TmpReg;
Misha Brukman422791f2004-06-21 17:41:12 +00003045
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003046 // Spill the integer to memory and reload it from there.
Misha Brukman422791f2004-06-21 17:41:12 +00003047 // Also spill room for a special conversion constant
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003048 int ValueFrameIdx =
3049 F->getFrameInfo()->CreateStackObject(Type::DoubleTy, TM.getTargetData());
3050
Nate Begeman81d265d2004-08-19 05:20:54 +00003051 MachineConstantPool *CP = F->getConstantPool();
Misha Brukman422791f2004-06-21 17:41:12 +00003052 unsigned constantHi = makeAnotherReg(Type::IntTy);
Misha Brukman422791f2004-06-21 17:41:12 +00003053 unsigned TempF = makeAnotherReg(Type::DoubleTy);
3054
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003055 if (!SrcTy->isSigned()) {
Nate Begeman81d265d2004-08-19 05:20:54 +00003056 ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, 0x1.000000p52);
3057 unsigned ConstF = getReg(CFP, BB, IP);
Nate Begemanf2f07812004-08-29 08:19:32 +00003058 BuildMI(*MBB, IP, PPC::LIS, 1, constantHi).addSImm(0x4330);
3059 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(constantHi),
Misha Brukman2fec9902004-06-21 20:22:03 +00003060 ValueFrameIdx);
Nate Begemanf2f07812004-08-29 08:19:32 +00003061 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(SrcReg),
Misha Brukman2fec9902004-06-21 20:22:03 +00003062 ValueFrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003063 addFrameReference(BuildMI(*MBB, IP, PPC::LFD, 2, TempF), ValueFrameIdx);
3064 BuildMI(*MBB, IP, PPC::FSUB, 2, DestReg).addReg(TempF).addReg(ConstF);
Misha Brukman422791f2004-06-21 17:41:12 +00003065 } else {
Nate Begeman81d265d2004-08-19 05:20:54 +00003066 ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, 0x1.000008p52);
3067 unsigned ConstF = getReg(CFP, BB, IP);
Misha Brukman422791f2004-06-21 17:41:12 +00003068 unsigned TempLo = makeAnotherReg(Type::IntTy);
Nate Begemanf2f07812004-08-29 08:19:32 +00003069 BuildMI(*MBB, IP, PPC::LIS, 1, constantHi).addSImm(0x4330);
3070 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(constantHi),
Misha Brukman2fec9902004-06-21 20:22:03 +00003071 ValueFrameIdx);
Nate Begemanf2f07812004-08-29 08:19:32 +00003072 BuildMI(*MBB, IP, PPC::XORIS, 2, TempLo).addReg(SrcReg).addImm(0x8000);
3073 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(TempLo),
Misha Brukman2fec9902004-06-21 20:22:03 +00003074 ValueFrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003075 addFrameReference(BuildMI(*MBB, IP, PPC::LFD, 2, TempF), ValueFrameIdx);
3076 BuildMI(*MBB, IP, PPC::FSUB, 2, DestReg).addReg(TempF).addReg(ConstF);
Misha Brukman422791f2004-06-21 17:41:12 +00003077 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003078 return;
3079 }
3080
3081 // Handle casts from floating point to integer now...
Misha Brukman7e898c32004-07-20 00:41:46 +00003082 if (SrcClass == cFP32 || SrcClass == cFP64) {
Nate Begemanb64af912004-08-10 20:42:36 +00003083 static Function* const Funcs[] =
3084 { __fixsfdiFn, __fixdfdiFn, __fixunssfdiFn, __fixunsdfdiFn };
Misha Brukman422791f2004-06-21 17:41:12 +00003085 // emit library call
3086 if (DestClass == cLong) {
Nate Begemanb64af912004-08-10 20:42:36 +00003087 bool isDouble = SrcClass == cFP64;
3088 unsigned nameIndex = 2 * DestTy->isSigned() + isDouble;
Misha Brukman422791f2004-06-21 17:41:12 +00003089 std::vector<ValueRecord> Args;
3090 Args.push_back(ValueRecord(SrcReg, SrcTy));
Nate Begemanb64af912004-08-10 20:42:36 +00003091 Function *floatFn = Funcs[nameIndex];
Misha Brukman2fec9902004-06-21 20:22:03 +00003092 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003093 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003094 doCall(ValueRecord(DestReg, DestTy), TheCall, Args, false);
Misha Brukmane2eceb52004-07-23 16:08:20 +00003095 TM.CalledFunctions.insert(floatFn);
Misha Brukman422791f2004-06-21 17:41:12 +00003096 return;
3097 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003098
3099 int ValueFrameIdx =
Nate Begeman43d64ea2004-08-15 06:42:28 +00003100 F->getFrameInfo()->CreateStackObject(Type::DoubleTy, TM.getTargetData());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003101
Misha Brukman7e898c32004-07-20 00:41:46 +00003102 if (DestTy->isSigned()) {
Misha Brukman4c14f332004-07-23 01:11:19 +00003103 unsigned TempReg = makeAnotherReg(Type::DoubleTy);
3104
3105 // Convert to integer in the FP reg and store it to a stack slot
Nate Begemanf2f07812004-08-29 08:19:32 +00003106 BuildMI(*MBB, IP, PPC::FCTIWZ, 1, TempReg).addReg(SrcReg);
3107 addFrameReference(BuildMI(*MBB, IP, PPC::STFD, 3)
Misha Brukman4c14f332004-07-23 01:11:19 +00003108 .addReg(TempReg), ValueFrameIdx);
Misha Brukmanb097f212004-07-26 18:13:24 +00003109
3110 // There is no load signed byte opcode, so we must emit a sign extend for
3111 // that particular size. Make sure to source the new integer from the
3112 // correct offset.
Misha Brukman4c14f332004-07-23 01:11:19 +00003113 if (DestClass == cByte) {
3114 unsigned TempReg2 = makeAnotherReg(DestTy);
Nate Begemanf2f07812004-08-29 08:19:32 +00003115 addFrameReference(BuildMI(*MBB, IP, PPC::LBZ, 2, TempReg2),
Misha Brukmanb097f212004-07-26 18:13:24 +00003116 ValueFrameIdx, 7);
Nate Begemanf2f07812004-08-29 08:19:32 +00003117 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(TempReg2);
Misha Brukman4c14f332004-07-23 01:11:19 +00003118 } else {
Misha Brukmanb097f212004-07-26 18:13:24 +00003119 int offset = (DestClass == cShort) ? 6 : 4;
Misha Brukman5b570812004-08-10 22:47:03 +00003120 unsigned LoadOp = (DestClass == cShort) ? PPC::LHA : PPC::LWZ;
Nate Begemanf2f07812004-08-29 08:19:32 +00003121 addFrameReference(BuildMI(*MBB, IP, LoadOp, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003122 ValueFrameIdx, offset);
Misha Brukman4c14f332004-07-23 01:11:19 +00003123 }
Misha Brukman7e898c32004-07-20 00:41:46 +00003124 } else {
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003125 unsigned Zero = getReg(ConstantFP::get(Type::DoubleTy, 0.0f));
3126 double maxInt = (1LL << 32) - 1;
3127 unsigned MaxInt = getReg(ConstantFP::get(Type::DoubleTy, maxInt));
3128 double border = 1LL << 31;
3129 unsigned Border = getReg(ConstantFP::get(Type::DoubleTy, border));
3130 unsigned UseZero = makeAnotherReg(Type::DoubleTy);
3131 unsigned UseMaxInt = makeAnotherReg(Type::DoubleTy);
3132 unsigned UseChoice = makeAnotherReg(Type::DoubleTy);
3133 unsigned TmpReg = makeAnotherReg(Type::DoubleTy);
3134 unsigned TmpReg2 = makeAnotherReg(Type::DoubleTy);
3135 unsigned ConvReg = makeAnotherReg(Type::DoubleTy);
3136 unsigned IntTmp = makeAnotherReg(Type::IntTy);
3137 unsigned XorReg = makeAnotherReg(Type::IntTy);
3138 int FrameIdx =
3139 F->getFrameInfo()->CreateStackObject(SrcTy, TM.getTargetData());
3140 // Update machine-CFG edges
3141 MachineBasicBlock *XorMBB = new MachineBasicBlock(BB->getBasicBlock());
3142 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
3143 MachineBasicBlock *OldMBB = BB;
3144 ilist<MachineBasicBlock>::iterator It = BB; ++It;
3145 F->getBasicBlockList().insert(It, XorMBB);
3146 F->getBasicBlockList().insert(It, PhiMBB);
3147 BB->addSuccessor(XorMBB);
3148 BB->addSuccessor(PhiMBB);
3149
3150 // Convert from floating point to unsigned 32-bit value
3151 // Use 0 if incoming value is < 0.0
Nate Begemanf2f07812004-08-29 08:19:32 +00003152 BuildMI(*MBB, IP, PPC::FSEL, 3, UseZero).addReg(SrcReg).addReg(SrcReg)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003153 .addReg(Zero);
3154 // Use 2**32 - 1 if incoming value is >= 2**32
Nate Begemanf2f07812004-08-29 08:19:32 +00003155 BuildMI(*MBB, IP, PPC::FSUB, 2, UseMaxInt).addReg(MaxInt).addReg(SrcReg);
3156 BuildMI(*MBB, IP, PPC::FSEL, 3, UseChoice).addReg(UseMaxInt)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003157 .addReg(UseZero).addReg(MaxInt);
3158 // Subtract 2**31
Nate Begemanf2f07812004-08-29 08:19:32 +00003159 BuildMI(*MBB, IP, PPC::FSUB, 2, TmpReg).addReg(UseChoice).addReg(Border);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003160 // Use difference if >= 2**31
Nate Begemanf2f07812004-08-29 08:19:32 +00003161 BuildMI(*MBB, IP, PPC::FCMPU, 2, PPC::CR0).addReg(UseChoice)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003162 .addReg(Border);
Nate Begemanf2f07812004-08-29 08:19:32 +00003163 BuildMI(*MBB, IP, PPC::FSEL, 3, TmpReg2).addReg(TmpReg).addReg(TmpReg)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003164 .addReg(UseChoice);
3165 // Convert to integer
Nate Begemanf2f07812004-08-29 08:19:32 +00003166 BuildMI(*MBB, IP, PPC::FCTIWZ, 1, ConvReg).addReg(TmpReg2);
3167 addFrameReference(BuildMI(*MBB, IP, PPC::STFD, 3).addReg(ConvReg),
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003168 FrameIdx);
Misha Brukmanb097f212004-07-26 18:13:24 +00003169 if (DestClass == cByte) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003170 addFrameReference(BuildMI(*MBB, IP, PPC::LBZ, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003171 FrameIdx, 7);
3172 } else if (DestClass == cShort) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003173 addFrameReference(BuildMI(*MBB, IP, PPC::LHZ, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003174 FrameIdx, 6);
3175 } if (DestClass == cInt) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003176 addFrameReference(BuildMI(*MBB, IP, PPC::LWZ, 2, IntTmp),
Misha Brukmanb097f212004-07-26 18:13:24 +00003177 FrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003178 BuildMI(*MBB, IP, PPC::BLT, 2).addReg(PPC::CR0).addMBB(PhiMBB);
3179 BuildMI(*MBB, IP, PPC::B, 1).addMBB(XorMBB);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003180
Misha Brukmanb097f212004-07-26 18:13:24 +00003181 // XorMBB:
3182 // add 2**31 if input was >= 2**31
3183 BB = XorMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00003184 BuildMI(BB, PPC::XORIS, 2, XorReg).addReg(IntTmp).addImm(0x8000);
Misha Brukmanb097f212004-07-26 18:13:24 +00003185 XorMBB->addSuccessor(PhiMBB);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003186
Misha Brukmanb097f212004-07-26 18:13:24 +00003187 // PhiMBB:
3188 // DestReg = phi [ IntTmp, OldMBB ], [ XorReg, XorMBB ]
3189 BB = PhiMBB;
Misha Brukmand2cbb872004-08-19 21:00:12 +00003190 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(IntTmp).addMBB(OldMBB)
Misha Brukmanb097f212004-07-26 18:13:24 +00003191 .addReg(XorReg).addMBB(XorMBB);
3192 }
3193 }
3194 return;
3195 }
3196
3197 // Check our invariants
3198 assert((SrcClass <= cInt || SrcClass == cLong) &&
3199 "Unhandled source class for cast operation!");
3200 assert((DestClass <= cInt || DestClass == cLong) &&
3201 "Unhandled destination class for cast operation!");
3202
3203 bool sourceUnsigned = SrcTy->isUnsigned() || SrcTy == Type::BoolTy;
3204 bool destUnsigned = DestTy->isUnsigned();
3205
3206 // Unsigned -> Unsigned, clear if larger,
3207 if (sourceUnsigned && destUnsigned) {
3208 // handle long dest class now to keep switch clean
3209 if (DestClass == cLong) {
3210 if (SrcClass == cLong) {
Misha Brukman5b570812004-08-10 22:47:03 +00003211 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3212 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg+1)
Misha Brukmanb097f212004-07-26 18:13:24 +00003213 .addReg(SrcReg+1);
3214 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00003215 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
3216 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003217 .addReg(SrcReg);
3218 }
3219 return;
3220 }
3221
3222 // handle u{ byte, short, int } x u{ byte, short, int }
3223 unsigned clearBits = (SrcClass == cByte || DestClass == cByte) ? 24 : 16;
3224 switch (SrcClass) {
3225 case cByte:
3226 case cShort:
3227 if (SrcClass == DestClass)
Misha Brukman5b570812004-08-10 22:47:03 +00003228 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003229 else
Misha Brukman5b570812004-08-10 22:47:03 +00003230 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003231 .addImm(0).addImm(clearBits).addImm(31);
3232 break;
3233 case cLong:
3234 ++SrcReg;
3235 // Fall through
3236 case cInt:
3237 if (DestClass == cInt)
Misha Brukman5b570812004-08-10 22:47:03 +00003238 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003239 else
Misha Brukman5b570812004-08-10 22:47:03 +00003240 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003241 .addImm(0).addImm(clearBits).addImm(31);
3242 break;
3243 }
3244 return;
3245 }
3246
3247 // Signed -> Signed
3248 if (!sourceUnsigned && !destUnsigned) {
3249 // handle long dest class now to keep switch clean
3250 if (DestClass == cLong) {
3251 if (SrcClass == cLong) {
Misha Brukman5b570812004-08-10 22:47:03 +00003252 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3253 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg+1)
Misha Brukmanb097f212004-07-26 18:13:24 +00003254 .addReg(SrcReg+1);
3255 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00003256 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg).addImm(31);
3257 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003258 .addReg(SrcReg);
3259 }
3260 return;
3261 }
3262
3263 // handle { byte, short, int } x { byte, short, int }
3264 switch (SrcClass) {
3265 case cByte:
3266 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003267 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003268 else
Misha Brukman5b570812004-08-10 22:47:03 +00003269 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003270 break;
3271 case cShort:
3272 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003273 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003274 else if (DestClass == cShort)
Misha Brukman5b570812004-08-10 22:47:03 +00003275 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003276 else
Misha Brukman5b570812004-08-10 22:47:03 +00003277 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003278 break;
3279 case cLong:
3280 ++SrcReg;
3281 // Fall through
3282 case cInt:
3283 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003284 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003285 else if (DestClass == cShort)
Misha Brukman5b570812004-08-10 22:47:03 +00003286 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003287 else
Misha Brukman5b570812004-08-10 22:47:03 +00003288 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003289 break;
3290 }
3291 return;
3292 }
3293
3294 // Unsigned -> Signed
3295 if (sourceUnsigned && !destUnsigned) {
3296 // handle long dest class now to keep switch clean
3297 if (DestClass == cLong) {
3298 if (SrcClass == cLong) {
Misha Brukman5b570812004-08-10 22:47:03 +00003299 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3300 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg+1).
Misha Brukmanb097f212004-07-26 18:13:24 +00003301 addReg(SrcReg+1);
3302 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00003303 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
3304 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003305 .addReg(SrcReg);
3306 }
3307 return;
3308 }
3309
3310 // handle u{ byte, short, int } -> { byte, short, int }
3311 switch (SrcClass) {
3312 case cByte:
3313 if (DestClass == cByte)
3314 // uByte 255 -> signed byte == -1
Misha Brukman5b570812004-08-10 22:47:03 +00003315 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003316 else
3317 // uByte 255 -> signed short/int == 255
Misha Brukman5b570812004-08-10 22:47:03 +00003318 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(0)
Misha Brukmanb097f212004-07-26 18:13:24 +00003319 .addImm(24).addImm(31);
3320 break;
3321 case cShort:
3322 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003323 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003324 else if (DestClass == cShort)
Misha Brukman5b570812004-08-10 22:47:03 +00003325 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003326 else
Misha Brukman5b570812004-08-10 22:47:03 +00003327 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(0)
Misha Brukmanb097f212004-07-26 18:13:24 +00003328 .addImm(16).addImm(31);
3329 break;
3330 case cLong:
3331 ++SrcReg;
3332 // Fall through
3333 case cInt:
3334 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003335 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003336 else if (DestClass == cShort)
Misha Brukman5b570812004-08-10 22:47:03 +00003337 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003338 else
Misha Brukman5b570812004-08-10 22:47:03 +00003339 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003340 break;
3341 }
3342 return;
3343 }
3344
3345 // Signed -> Unsigned
3346 if (!sourceUnsigned && destUnsigned) {
3347 // handle long dest class now to keep switch clean
3348 if (DestClass == cLong) {
3349 if (SrcClass == cLong) {
Misha Brukman5b570812004-08-10 22:47:03 +00003350 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3351 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg+1)
Misha Brukmanb097f212004-07-26 18:13:24 +00003352 .addReg(SrcReg+1);
3353 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00003354 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg).addImm(31);
3355 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003356 .addReg(SrcReg);
3357 }
3358 return;
3359 }
3360
3361 // handle { byte, short, int } -> u{ byte, short, int }
3362 unsigned clearBits = (DestClass == cByte) ? 24 : 16;
3363 switch (SrcClass) {
3364 case cByte:
3365 case cShort:
3366 if (DestClass == cByte || DestClass == cShort)
3367 // sbyte -1 -> ubyte 0x000000FF
Misha Brukman5b570812004-08-10 22:47:03 +00003368 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003369 .addImm(0).addImm(clearBits).addImm(31);
3370 else
3371 // sbyte -1 -> ubyte 0xFFFFFFFF
Misha Brukman5b570812004-08-10 22:47:03 +00003372 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003373 break;
3374 case cLong:
3375 ++SrcReg;
3376 // Fall through
3377 case cInt:
3378 if (DestClass == cInt)
Misha Brukman5b570812004-08-10 22:47:03 +00003379 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003380 else
Misha Brukman5b570812004-08-10 22:47:03 +00003381 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003382 .addImm(0).addImm(clearBits).addImm(31);
3383 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00003384 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003385 return;
3386 }
3387
3388 // Anything we haven't handled already, we can't (yet) handle at all.
Misha Brukmanb097f212004-07-26 18:13:24 +00003389 std::cerr << "Unhandled cast from " << SrcTy->getDescription()
3390 << "to " << DestTy->getDescription() << '\n';
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003391 abort();
3392}
3393
3394/// visitVANextInst - Implement the va_next instruction...
3395///
Misha Brukmana1dca552004-09-21 18:22:19 +00003396void PPC32ISel::visitVANextInst(VANextInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003397 unsigned VAList = getReg(I.getOperand(0));
3398 unsigned DestReg = getReg(I);
3399
3400 unsigned Size;
Misha Brukman358829f2004-06-21 17:25:55 +00003401 switch (I.getArgType()->getTypeID()) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003402 default:
3403 std::cerr << I;
3404 assert(0 && "Error: bad type for va_next instruction!");
3405 return;
3406 case Type::PointerTyID:
3407 case Type::UIntTyID:
3408 case Type::IntTyID:
3409 Size = 4;
3410 break;
3411 case Type::ULongTyID:
3412 case Type::LongTyID:
3413 case Type::DoubleTyID:
3414 Size = 8;
3415 break;
3416 }
3417
3418 // Increment the VAList pointer...
Misha Brukman5b570812004-08-10 22:47:03 +00003419 BuildMI(BB, PPC::ADDI, 2, DestReg).addReg(VAList).addSImm(Size);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003420}
3421
Misha Brukmana1dca552004-09-21 18:22:19 +00003422void PPC32ISel::visitVAArgInst(VAArgInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003423 unsigned VAList = getReg(I.getOperand(0));
3424 unsigned DestReg = getReg(I);
3425
Misha Brukman358829f2004-06-21 17:25:55 +00003426 switch (I.getType()->getTypeID()) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003427 default:
3428 std::cerr << I;
3429 assert(0 && "Error: bad type for va_next instruction!");
3430 return;
3431 case Type::PointerTyID:
3432 case Type::UIntTyID:
3433 case Type::IntTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003434 BuildMI(BB, PPC::LWZ, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003435 break;
3436 case Type::ULongTyID:
3437 case Type::LongTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003438 BuildMI(BB, PPC::LWZ, 2, DestReg).addSImm(0).addReg(VAList);
3439 BuildMI(BB, PPC::LWZ, 2, DestReg+1).addSImm(4).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003440 break;
Misha Brukmanb097f212004-07-26 18:13:24 +00003441 case Type::FloatTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003442 BuildMI(BB, PPC::LFS, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukmanb097f212004-07-26 18:13:24 +00003443 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003444 case Type::DoubleTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003445 BuildMI(BB, PPC::LFD, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003446 break;
3447 }
3448}
3449
3450/// visitGetElementPtrInst - instruction-select GEP instructions
3451///
Misha Brukmana1dca552004-09-21 18:22:19 +00003452void PPC32ISel::visitGetElementPtrInst(GetElementPtrInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003453 if (canFoldGEPIntoLoadOrStore(&I))
3454 return;
3455
Nate Begeman645495d2004-09-23 05:31:33 +00003456 emitGEPOperation(BB, BB->end(), &I, false);
3457}
3458
Misha Brukman1013ef52004-07-21 20:09:08 +00003459/// emitGEPOperation - Common code shared between visitGetElementPtrInst and
3460/// constant expression GEP support.
3461///
Misha Brukmana1dca552004-09-21 18:22:19 +00003462void PPC32ISel::emitGEPOperation(MachineBasicBlock *MBB,
3463 MachineBasicBlock::iterator IP,
Nate Begeman645495d2004-09-23 05:31:33 +00003464 GetElementPtrInst *GEPI, bool GEPIsFolded) {
3465 // If we've already emitted this particular GEP, just return to avoid
3466 // multiple definitions of the base register.
Nate Begemana41fc772004-09-29 02:35:05 +00003467 if (GEPIsFolded && (GEPMap[GEPI].base != 0))
Nate Begeman645495d2004-09-23 05:31:33 +00003468 return;
Nate Begeman645495d2004-09-23 05:31:33 +00003469
3470 Value *Src = GEPI->getOperand(0);
3471 User::op_iterator IdxBegin = GEPI->op_begin()+1;
3472 User::op_iterator IdxEnd = GEPI->op_end();
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003473 const TargetData &TD = TM.getTargetData();
3474 const Type *Ty = Src->getType();
Misha Brukmane2eceb52004-07-23 16:08:20 +00003475 int64_t constValue = 0;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003476
3477 // Record the operations to emit the GEP in a vector so that we can emit them
3478 // after having analyzed the entire instruction.
Misha Brukmanb097f212004-07-26 18:13:24 +00003479 std::vector<CollapsedGepOp> ops;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003480
Misha Brukman1013ef52004-07-21 20:09:08 +00003481 // GEPs have zero or more indices; we must perform a struct access
3482 // or array access for each one.
3483 for (GetElementPtrInst::op_iterator oi = IdxBegin, oe = IdxEnd; oi != oe;
3484 ++oi) {
3485 Value *idx = *oi;
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003486 if (const StructType *StTy = dyn_cast<StructType>(Ty)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00003487 // It's a struct access. idx is the index into the structure,
3488 // which names the field. Use the TargetData structure to
3489 // pick out what the layout of the structure is in memory.
3490 // Use the (constant) structure index's value to find the
3491 // right byte offset from the StructLayout class's list of
3492 // structure member offsets.
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003493 unsigned fieldIndex = cast<ConstantUInt>(idx)->getValue();
Misha Brukmane2eceb52004-07-23 16:08:20 +00003494
3495 // StructType member offsets are always constant values. Add it to the
3496 // running total.
Nate Begeman645495d2004-09-23 05:31:33 +00003497 constValue += TD.getStructLayout(StTy)->MemberOffsets[fieldIndex];
Misha Brukmane2eceb52004-07-23 16:08:20 +00003498
Nate Begeman645495d2004-09-23 05:31:33 +00003499 // The next type is the member of the structure selected by the index.
Misha Brukmane2eceb52004-07-23 16:08:20 +00003500 Ty = StTy->getElementType (fieldIndex);
Nate Begeman645495d2004-09-23 05:31:33 +00003501 } else if (const SequentialType *SqTy = dyn_cast<SequentialType>(Ty)) {
Misha Brukman313efcb2004-07-09 15:45:07 +00003502 // Many GEP instructions use a [cast (int/uint) to LongTy] as their
3503 // operand. Handle this case directly now...
3504 if (CastInst *CI = dyn_cast<CastInst>(idx))
3505 if (CI->getOperand(0)->getType() == Type::IntTy ||
3506 CI->getOperand(0)->getType() == Type::UIntTy)
3507 idx = CI->getOperand(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00003508
Misha Brukmane2eceb52004-07-23 16:08:20 +00003509 // It's an array or pointer access: [ArraySize x ElementType].
3510 // We want to add basePtrReg to (idxReg * sizeof ElementType). First, we
3511 // must find the size of the pointed-to type (Not coincidentally, the next
3512 // type is the type of the elements in the array).
Misha Brukman1013ef52004-07-21 20:09:08 +00003513 Ty = SqTy->getElementType();
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003514 unsigned elementSize = TD.getTypeSize(Ty);
Misha Brukman1013ef52004-07-21 20:09:08 +00003515
Misha Brukmane2eceb52004-07-23 16:08:20 +00003516 if (ConstantInt *C = dyn_cast<ConstantInt>(idx)) {
Misha Brukmane2eceb52004-07-23 16:08:20 +00003517 if (ConstantSInt *CS = dyn_cast<ConstantSInt>(C))
3518 constValue += CS->getValue() * elementSize;
3519 else if (ConstantUInt *CU = dyn_cast<ConstantUInt>(C))
3520 constValue += CU->getValue() * elementSize;
3521 else
3522 assert(0 && "Invalid ConstantInt GEP index type!");
3523 } else {
Nate Begeman645495d2004-09-23 05:31:33 +00003524 // Push current gep state to this point as an add and multiply
3525 ops.push_back(CollapsedGepOp(
3526 ConstantSInt::get(Type::IntTy, constValue),
3527 idx, ConstantUInt::get(Type::UIntTy, elementSize)));
3528
Misha Brukmane2eceb52004-07-23 16:08:20 +00003529 constValue = 0;
Misha Brukman313efcb2004-07-09 15:45:07 +00003530 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003531 }
Misha Brukmane2eceb52004-07-23 16:08:20 +00003532 }
Misha Brukmane2eceb52004-07-23 16:08:20 +00003533 // Emit instructions for all the collapsed ops
Nate Begeman645495d2004-09-23 05:31:33 +00003534 unsigned indexReg = 0;
Misha Brukmanb097f212004-07-26 18:13:24 +00003535 for(std::vector<CollapsedGepOp>::iterator cgo_i = ops.begin(),
Misha Brukmane2eceb52004-07-23 16:08:20 +00003536 cgo_e = ops.end(); cgo_i != cgo_e; ++cgo_i) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003537 CollapsedGepOp& cgo = *cgo_i;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003538
Nate Begeman645495d2004-09-23 05:31:33 +00003539 unsigned TmpReg1 = makeAnotherReg(Type::IntTy);
3540 unsigned TmpReg2 = makeAnotherReg(Type::IntTy);
3541 doMultiplyConst(MBB, IP, TmpReg1, cgo.index, cgo.size);
Nate Begemanb816f022004-10-07 22:30:03 +00003542 emitBinaryConstOperation(MBB, IP, TmpReg1, cgo.offset, 0, TmpReg2);
Nate Begeman645495d2004-09-23 05:31:33 +00003543
3544 if (indexReg == 0)
3545 indexReg = TmpReg2;
3546 else {
3547 unsigned TmpReg3 = makeAnotherReg(Type::IntTy);
3548 BuildMI(*MBB, IP, PPC::ADD, 2, TmpReg3).addReg(indexReg).addReg(TmpReg2);
3549 indexReg = TmpReg3;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003550 }
Misha Brukman2fec9902004-06-21 20:22:03 +00003551 }
Nate Begeman645495d2004-09-23 05:31:33 +00003552
3553 // We now have a base register, an index register, and possibly a constant
3554 // remainder. If the GEP is going to be folded, we try to generate the
3555 // optimal addressing mode.
3556 unsigned TargetReg = getReg(GEPI, MBB, IP);
3557 unsigned basePtrReg = getReg(Src, MBB, IP);
Misha Brukmane2eceb52004-07-23 16:08:20 +00003558 ConstantSInt *remainder = ConstantSInt::get(Type::IntTy, constValue);
3559
Misha Brukmanb097f212004-07-26 18:13:24 +00003560 // If we are emitting this during a fold, copy the current base register to
3561 // the target, and save the current constant offset so the folding load or
3562 // store can try and use it as an immediate.
3563 if (GEPIsFolded) {
Nate Begeman645495d2004-09-23 05:31:33 +00003564 if (indexReg == 0) {
Nate Begemanb816f022004-10-07 22:30:03 +00003565 if (!canUseAsImmediateForOpcode(remainder, 0, false)) {
Nate Begeman645495d2004-09-23 05:31:33 +00003566 indexReg = getReg(remainder, MBB, IP);
3567 remainder = 0;
Nate Begemanb64af912004-08-10 20:42:36 +00003568 }
Nate Begeman645495d2004-09-23 05:31:33 +00003569 } else {
3570 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Nate Begemanb816f022004-10-07 22:30:03 +00003571 emitBinaryConstOperation(MBB, IP, indexReg, remainder, 0, TmpReg);
Nate Begeman645495d2004-09-23 05:31:33 +00003572 indexReg = TmpReg;
3573 remainder = 0;
Nate Begemanb64af912004-08-10 20:42:36 +00003574 }
Misha Brukman5b570812004-08-10 22:47:03 +00003575 BuildMI (*MBB, IP, PPC::OR, 2, TargetReg).addReg(basePtrReg)
Nate Begemanb64af912004-08-10 20:42:36 +00003576 .addReg(basePtrReg);
Nate Begeman645495d2004-09-23 05:31:33 +00003577 GEPMap[GEPI] = FoldedGEP(TargetReg, indexReg, remainder);
Misha Brukmanb097f212004-07-26 18:13:24 +00003578 return;
3579 }
Nate Begemanb64af912004-08-10 20:42:36 +00003580
Nate Begeman645495d2004-09-23 05:31:33 +00003581 // We're not folding, so collapse the base, index, and any remainder into the
3582 // destination register.
3583 if (indexReg != 0) {
Nate Begemanb64af912004-08-10 20:42:36 +00003584 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Nate Begeman645495d2004-09-23 05:31:33 +00003585 BuildMI(*MBB, IP, PPC::ADD, 2, TmpReg).addReg(indexReg).addReg(basePtrReg);
Nate Begemanb64af912004-08-10 20:42:36 +00003586 basePtrReg = TmpReg;
3587 }
Nate Begemanb816f022004-10-07 22:30:03 +00003588 emitBinaryConstOperation(MBB, IP, basePtrReg, remainder, 0, TargetReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003589}
3590
3591/// visitAllocaInst - If this is a fixed size alloca, allocate space from the
3592/// frame manager, otherwise do it the hard way.
3593///
Misha Brukmana1dca552004-09-21 18:22:19 +00003594void PPC32ISel::visitAllocaInst(AllocaInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003595 // If this is a fixed size alloca in the entry block for the function, we
3596 // statically stack allocate the space, so we don't need to do anything here.
3597 //
3598 if (dyn_castFixedAlloca(&I)) return;
3599
3600 // Find the data size of the alloca inst's getAllocatedType.
3601 const Type *Ty = I.getAllocatedType();
3602 unsigned TySize = TM.getTargetData().getTypeSize(Ty);
3603
3604 // Create a register to hold the temporary result of multiplying the type size
3605 // constant by the variable amount.
3606 unsigned TotalSizeReg = makeAnotherReg(Type::UIntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003607
3608 // TotalSizeReg = mul <numelements>, <TypeSize>
3609 MachineBasicBlock::iterator MBBI = BB->end();
Misha Brukman1013ef52004-07-21 20:09:08 +00003610 ConstantUInt *CUI = ConstantUInt::get(Type::UIntTy, TySize);
3611 doMultiplyConst(BB, MBBI, TotalSizeReg, I.getArraySize(), CUI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003612
3613 // AddedSize = add <TotalSizeReg>, 15
3614 unsigned AddedSizeReg = makeAnotherReg(Type::UIntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003615 BuildMI(BB, PPC::ADDI, 2, AddedSizeReg).addReg(TotalSizeReg).addSImm(15);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003616
3617 // AlignedSize = and <AddedSize>, ~15
3618 unsigned AlignedSize = makeAnotherReg(Type::UIntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003619 BuildMI(BB, PPC::RLWINM, 4, AlignedSize).addReg(AddedSizeReg).addImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00003620 .addImm(0).addImm(27);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003621
3622 // Subtract size from stack pointer, thereby allocating some space.
Misha Brukman5b570812004-08-10 22:47:03 +00003623 BuildMI(BB, PPC::SUB, 2, PPC::R1).addReg(PPC::R1).addReg(AlignedSize);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003624
3625 // Put a pointer to the space into the result register, by copying
3626 // the stack pointer.
Misha Brukman5b570812004-08-10 22:47:03 +00003627 BuildMI(BB, PPC::OR, 2, getReg(I)).addReg(PPC::R1).addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003628
3629 // Inform the Frame Information that we have just allocated a variable-sized
3630 // object.
3631 F->getFrameInfo()->CreateVariableSizedObject();
3632}
3633
3634/// visitMallocInst - Malloc instructions are code generated into direct calls
3635/// to the library malloc.
3636///
Misha Brukmana1dca552004-09-21 18:22:19 +00003637void PPC32ISel::visitMallocInst(MallocInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003638 unsigned AllocSize = TM.getTargetData().getTypeSize(I.getAllocatedType());
3639 unsigned Arg;
3640
3641 if (ConstantUInt *C = dyn_cast<ConstantUInt>(I.getOperand(0))) {
3642 Arg = getReg(ConstantUInt::get(Type::UIntTy, C->getValue() * AllocSize));
3643 } else {
3644 Arg = makeAnotherReg(Type::UIntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003645 MachineBasicBlock::iterator MBBI = BB->end();
Misha Brukman1013ef52004-07-21 20:09:08 +00003646 ConstantUInt *CUI = ConstantUInt::get(Type::UIntTy, AllocSize);
3647 doMultiplyConst(BB, MBBI, Arg, I.getOperand(0), CUI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003648 }
3649
3650 std::vector<ValueRecord> Args;
3651 Args.push_back(ValueRecord(Arg, Type::UIntTy));
Misha Brukman2fec9902004-06-21 20:22:03 +00003652 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003653 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(mallocFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003654 doCall(ValueRecord(getReg(I), I.getType()), TheCall, Args, false);
Misha Brukmane2eceb52004-07-23 16:08:20 +00003655 TM.CalledFunctions.insert(mallocFn);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003656}
3657
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003658/// visitFreeInst - Free instructions are code gen'd to call the free libc
3659/// function.
3660///
Misha Brukmana1dca552004-09-21 18:22:19 +00003661void PPC32ISel::visitFreeInst(FreeInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003662 std::vector<ValueRecord> Args;
3663 Args.push_back(ValueRecord(I.getOperand(0)));
Misha Brukman2fec9902004-06-21 20:22:03 +00003664 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003665 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(freeFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003666 doCall(ValueRecord(0, Type::VoidTy), TheCall, Args, false);
Misha Brukmane2eceb52004-07-23 16:08:20 +00003667 TM.CalledFunctions.insert(freeFn);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003668}
3669
Misha Brukman3d9a6c22004-08-11 00:09:42 +00003670/// createPPC32ISelSimple - This pass converts an LLVM function into a machine
3671/// code representation is a very simple peep-hole fashion.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003672///
Misha Brukman3d9a6c22004-08-11 00:09:42 +00003673FunctionPass *llvm::createPPC32ISelSimple(TargetMachine &TM) {
Misha Brukmana1dca552004-09-21 18:22:19 +00003674 return new PPC32ISel(TM);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003675}