blob: f5a21f07c06faa3c35df99b9facf518ca38b6976 [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 Begeman1b750222004-10-17 05:19:20 +000035 Statistic<> Bitfields("ppc-codegen", "Number of bitfield inserts");
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
Nate Begeman1b750222004-10-17 05:19:20 +0000103 /// RlwimiRec - This struct is for recording the necessary information to
104 /// emit a PowerPC rlwimi instruction for a bitfield insert rather than
105 /// a sequence of shifts and ands, followed by an or.
106 struct RlwimiRec {
107 unsigned Shift;
108 unsigned MB, ME;
109 Value *Op0, *Op1;
110 RlwimiRec() : Shift(0), MB(0), ME(0), Op0(0), Op1(0) {}
111 RlwimiRec(unsigned s, unsigned b, unsigned e, Value *y, Value *z) :
112 Shift(s), MB(b), ME(e), Op0(y), Op1(z) {}
113 };
114
Misha Brukman2834a4d2004-07-07 20:07:22 +0000115 // External functions used in the Module
Nate Begemanb64af912004-08-10 20:42:36 +0000116 Function *fmodfFn, *fmodFn, *__cmpdi2Fn, *__moddi3Fn, *__divdi3Fn,
117 *__umoddi3Fn, *__udivdi3Fn, *__fixsfdiFn, *__fixdfdiFn, *__fixunssfdiFn,
118 *__fixunsdfdiFn, *__floatdisfFn, *__floatdidfFn, *mallocFn, *freeFn;
Misha Brukman2834a4d2004-07-07 20:07:22 +0000119
Nate Begeman645495d2004-09-23 05:31:33 +0000120 // Mapping between Values and SSA Regs
121 std::map<Value*, unsigned> RegMap;
122
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000123 // MBBMap - Mapping between LLVM BB -> Machine BB
124 std::map<const BasicBlock*, MachineBasicBlock*> MBBMap;
125
126 // AllocaMap - Mapping from fixed sized alloca instructions to the
127 // FrameIndex for the alloca.
128 std::map<AllocaInst*, unsigned> AllocaMap;
129
Nate Begeman645495d2004-09-23 05:31:33 +0000130 // GEPMap - Mapping between basic blocks and GEP definitions
131 std::map<GetElementPtrInst*, FoldedGEP> GEPMap;
Nate Begeman1b750222004-10-17 05:19:20 +0000132
133 // RlwimiMap - Mapping between BinaryOperand (Or) instructions and info
134 // needed to properly emit a rlwimi instruction in its place.
135 std::map<BinaryOperator *, RlwimiRec> RlwimiMap;
136 std::vector<Instruction *> SkipList;
Nate Begeman645495d2004-09-23 05:31:33 +0000137
Misha Brukmanb097f212004-07-26 18:13:24 +0000138 // A Reg to hold the base address used for global loads and stores, and a
139 // flag to set whether or not we need to emit it for this function.
140 unsigned GlobalBaseReg;
141 bool GlobalBaseInitialized;
142
Misha Brukmana1dca552004-09-21 18:22:19 +0000143 PPC32ISel(TargetMachine &tm):TM(reinterpret_cast<PPC32TargetMachine&>(tm)),
Misha Brukmane2eceb52004-07-23 16:08:20 +0000144 F(0), BB(0) {}
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000145
Misha Brukman2834a4d2004-07-07 20:07:22 +0000146 bool doInitialization(Module &M) {
Misha Brukmanb0932592004-07-07 15:36:18 +0000147 // Add external functions that we may call
Nate Begemanb64af912004-08-10 20:42:36 +0000148 Type *i = Type::IntTy;
Misha Brukman2834a4d2004-07-07 20:07:22 +0000149 Type *d = Type::DoubleTy;
Misha Brukmanf3f63822004-07-08 19:41:16 +0000150 Type *f = Type::FloatTy;
Misha Brukman2834a4d2004-07-07 20:07:22 +0000151 Type *l = Type::LongTy;
152 Type *ul = Type::ULongTy;
Misha Brukman313efcb2004-07-09 15:45:07 +0000153 Type *voidPtr = PointerType::get(Type::SByteTy);
Misha Brukman7e898c32004-07-20 00:41:46 +0000154 // float fmodf(float, float);
155 fmodfFn = M.getOrInsertFunction("fmodf", f, f, f, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000156 // double fmod(double, double);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000157 fmodFn = M.getOrInsertFunction("fmod", d, d, d, 0);
Nate Begemanb64af912004-08-10 20:42:36 +0000158 // int __cmpdi2(long, long);
159 __cmpdi2Fn = M.getOrInsertFunction("__cmpdi2", i, l, l, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000160 // long __moddi3(long, long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000161 __moddi3Fn = M.getOrInsertFunction("__moddi3", l, l, l, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000162 // long __divdi3(long, long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000163 __divdi3Fn = M.getOrInsertFunction("__divdi3", l, l, l, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000164 // unsigned long __umoddi3(unsigned long, unsigned long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000165 __umoddi3Fn = M.getOrInsertFunction("__umoddi3", ul, ul, ul, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000166 // unsigned long __udivdi3(unsigned long, unsigned long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000167 __udivdi3Fn = M.getOrInsertFunction("__udivdi3", ul, ul, ul, 0);
Misha Brukman7e898c32004-07-20 00:41:46 +0000168 // long __fixsfdi(float)
Nate Begemanb64af912004-08-10 20:42:36 +0000169 __fixsfdiFn = M.getOrInsertFunction("__fixsfdi", l, f, 0);
Misha Brukmanf3f63822004-07-08 19:41:16 +0000170 // long __fixdfdi(double)
171 __fixdfdiFn = M.getOrInsertFunction("__fixdfdi", l, d, 0);
Nate Begemanb64af912004-08-10 20:42:36 +0000172 // unsigned long __fixunssfdi(float)
173 __fixunssfdiFn = M.getOrInsertFunction("__fixunssfdi", ul, f, 0);
174 // unsigned long __fixunsdfdi(double)
175 __fixunsdfdiFn = M.getOrInsertFunction("__fixunsdfdi", ul, d, 0);
Misha Brukmanf3f63822004-07-08 19:41:16 +0000176 // float __floatdisf(long)
177 __floatdisfFn = M.getOrInsertFunction("__floatdisf", f, l, 0);
178 // double __floatdidf(long)
179 __floatdidfFn = M.getOrInsertFunction("__floatdidf", d, l, 0);
Misha Brukman313efcb2004-07-09 15:45:07 +0000180 // void* malloc(size_t)
181 mallocFn = M.getOrInsertFunction("malloc", voidPtr, Type::UIntTy, 0);
182 // void free(void*)
183 freeFn = M.getOrInsertFunction("free", Type::VoidTy, voidPtr, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000184 return false;
185 }
Misha Brukmand18a31d2004-07-06 22:51:53 +0000186
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000187 /// runOnFunction - Top level implementation of instruction selection for
188 /// the entire function.
189 ///
190 bool runOnFunction(Function &Fn) {
191 // First pass over the function, lower any unknown intrinsic functions
192 // with the IntrinsicLowering class.
193 LowerUnknownIntrinsicFunctionCalls(Fn);
194
195 F = &MachineFunction::construct(&Fn, TM);
196
197 // Create all of the machine basic blocks for the function...
198 for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I)
199 F->getBasicBlockList().push_back(MBBMap[I] = new MachineBasicBlock(I));
200
201 BB = &F->front();
202
Misha Brukmanb097f212004-07-26 18:13:24 +0000203 // Make sure we re-emit a set of the global base reg if necessary
204 GlobalBaseInitialized = false;
205
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000206 // Copy incoming arguments off of the stack...
207 LoadArgumentsToVirtualRegs(Fn);
208
209 // Instruction select everything except PHI nodes
210 visit(Fn);
211
212 // Select the PHI nodes
213 SelectPHINodes();
214
Nate Begeman645495d2004-09-23 05:31:33 +0000215 GEPMap.clear();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000216 RegMap.clear();
217 MBBMap.clear();
218 AllocaMap.clear();
Nate Begeman1b750222004-10-17 05:19:20 +0000219 RlwimiMap.clear();
220 SkipList.clear();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000221 F = 0;
222 // We always build a machine code representation for the function
223 return true;
224 }
225
226 virtual const char *getPassName() const {
227 return "PowerPC Simple Instruction Selection";
228 }
229
230 /// visitBasicBlock - This method is called when we are visiting a new basic
231 /// block. This simply creates a new MachineBasicBlock to emit code into
232 /// and adds it to the current MachineFunction. Subsequent visit* for
233 /// instructions will be invoked for all instructions in the basic block.
234 ///
235 void visitBasicBlock(BasicBlock &LLVM_BB) {
236 BB = MBBMap[&LLVM_BB];
237 }
238
239 /// LowerUnknownIntrinsicFunctionCalls - This performs a prepass over the
240 /// function, lowering any calls to unknown intrinsic functions into the
241 /// equivalent LLVM code.
242 ///
243 void LowerUnknownIntrinsicFunctionCalls(Function &F);
244
245 /// LoadArgumentsToVirtualRegs - Load all of the arguments to this function
246 /// from the stack into virtual registers.
247 ///
248 void LoadArgumentsToVirtualRegs(Function &F);
249
250 /// SelectPHINodes - Insert machine code to generate phis. This is tricky
251 /// because we have to generate our sources into the source basic blocks,
252 /// not the current one.
253 ///
254 void SelectPHINodes();
255
256 // Visitation methods for various instructions. These methods simply emit
257 // fixed PowerPC code for each instruction.
258
Chris Lattner289a49a2004-10-16 18:13:47 +0000259 // Control flow operators.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000260 void visitReturnInst(ReturnInst &RI);
261 void visitBranchInst(BranchInst &BI);
Chris Lattner289a49a2004-10-16 18:13:47 +0000262 void visitUnreachableInst(UnreachableInst &UI) {}
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000263
264 struct ValueRecord {
265 Value *Val;
266 unsigned Reg;
267 const Type *Ty;
268 ValueRecord(unsigned R, const Type *T) : Val(0), Reg(R), Ty(T) {}
269 ValueRecord(Value *V) : Val(V), Reg(0), Ty(V->getType()) {}
270 };
Misha Brukmanb097f212004-07-26 18:13:24 +0000271
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000272 void doCall(const ValueRecord &Ret, MachineInstr *CallMI,
Misha Brukmand18a31d2004-07-06 22:51:53 +0000273 const std::vector<ValueRecord> &Args, bool isVarArg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000274 void visitCallInst(CallInst &I);
275 void visitIntrinsicCall(Intrinsic::ID ID, CallInst &I);
276
277 // Arithmetic operators
278 void visitSimpleBinary(BinaryOperator &B, unsigned OpcodeClass);
279 void visitAdd(BinaryOperator &B) { visitSimpleBinary(B, 0); }
280 void visitSub(BinaryOperator &B) { visitSimpleBinary(B, 1); }
281 void visitMul(BinaryOperator &B);
282
283 void visitDiv(BinaryOperator &B) { visitDivRem(B); }
284 void visitRem(BinaryOperator &B) { visitDivRem(B); }
285 void visitDivRem(BinaryOperator &B);
286
287 // Bitwise operators
288 void visitAnd(BinaryOperator &B) { visitSimpleBinary(B, 2); }
289 void visitOr (BinaryOperator &B) { visitSimpleBinary(B, 3); }
290 void visitXor(BinaryOperator &B) { visitSimpleBinary(B, 4); }
291
292 // Comparison operators...
293 void visitSetCondInst(SetCondInst &I);
294 unsigned EmitComparison(unsigned OpNum, Value *Op0, Value *Op1,
295 MachineBasicBlock *MBB,
296 MachineBasicBlock::iterator MBBI);
297 void visitSelectInst(SelectInst &SI);
298
299
300 // Memory Instructions
301 void visitLoadInst(LoadInst &I);
302 void visitStoreInst(StoreInst &I);
303 void visitGetElementPtrInst(GetElementPtrInst &I);
304 void visitAllocaInst(AllocaInst &I);
305 void visitMallocInst(MallocInst &I);
306 void visitFreeInst(FreeInst &I);
307
308 // Other operators
309 void visitShiftInst(ShiftInst &I);
310 void visitPHINode(PHINode &I) {} // PHI nodes handled by second pass
311 void visitCastInst(CastInst &I);
312 void visitVANextInst(VANextInst &I);
313 void visitVAArgInst(VAArgInst &I);
314
315 void visitInstruction(Instruction &I) {
316 std::cerr << "Cannot instruction select: " << I;
317 abort();
318 }
319
Nate Begemanb47321b2004-08-20 09:56:22 +0000320 unsigned ExtendOrClear(MachineBasicBlock *MBB,
321 MachineBasicBlock::iterator IP,
Nate Begemana2de1022004-09-22 04:40:25 +0000322 Value *Op0);
Nate Begemanb47321b2004-08-20 09:56:22 +0000323
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000324 /// promote32 - Make a value 32-bits wide, and put it somewhere.
325 ///
326 void promote32(unsigned targetReg, const ValueRecord &VR);
327
328 /// emitGEPOperation - Common code shared between visitGetElementPtrInst and
329 /// constant expression GEP support.
330 ///
331 void emitGEPOperation(MachineBasicBlock *BB, MachineBasicBlock::iterator IP,
Nate Begeman645495d2004-09-23 05:31:33 +0000332 GetElementPtrInst *GEPI, bool foldGEP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000333
334 /// emitCastOperation - Common code shared between visitCastInst and
335 /// constant expression cast support.
336 ///
337 void emitCastOperation(MachineBasicBlock *BB,MachineBasicBlock::iterator IP,
338 Value *Src, const Type *DestTy, unsigned TargetReg);
339
Nate Begemanb816f022004-10-07 22:30:03 +0000340
Nate Begeman1b750222004-10-17 05:19:20 +0000341 /// emitBitfieldInsert - return true if we were able to fold the sequence of
342 /// instructions starting with AndI into a bitfield insert.
343 bool PPC32ISel::emitBitfieldInsert(BinaryOperator *AndI,
344 unsigned ShlAmount,
345 Value *InsertOp);
346
Nate Begemanb816f022004-10-07 22:30:03 +0000347 /// emitBinaryConstOperation - Used by several functions to emit simple
348 /// arithmetic and logical operations with constants on a register rather
349 /// than a Value.
350 ///
351 void emitBinaryConstOperation(MachineBasicBlock *MBB,
352 MachineBasicBlock::iterator IP,
353 unsigned Op0Reg, ConstantInt *Op1,
354 unsigned Opcode, unsigned DestReg);
355
356 /// emitSimpleBinaryOperation - Implement simple binary operators for
357 /// integral types. OperatorClass is one of: 0 for Add, 1 for Sub,
358 /// 2 for And, 3 for Or, 4 for Xor.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000359 ///
360 void emitSimpleBinaryOperation(MachineBasicBlock *BB,
361 MachineBasicBlock::iterator IP,
Nate Begeman1b750222004-10-17 05:19:20 +0000362 BinaryOperator *BO,
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000363 Value *Op0, Value *Op1,
364 unsigned OperatorClass, unsigned TargetReg);
365
366 /// emitBinaryFPOperation - This method handles emission of floating point
367 /// Add (0), Sub (1), Mul (2), and Div (3) operations.
368 void emitBinaryFPOperation(MachineBasicBlock *BB,
369 MachineBasicBlock::iterator IP,
370 Value *Op0, Value *Op1,
371 unsigned OperatorClass, unsigned TargetReg);
372
373 void emitMultiply(MachineBasicBlock *BB, MachineBasicBlock::iterator IP,
374 Value *Op0, Value *Op1, unsigned TargetReg);
375
Misha Brukman1013ef52004-07-21 20:09:08 +0000376 void doMultiply(MachineBasicBlock *MBB,
377 MachineBasicBlock::iterator IP,
378 unsigned DestReg, Value *Op0, Value *Op1);
379
380 /// doMultiplyConst - This method will multiply the value in Op0Reg by the
381 /// value of the ContantInt *CI
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000382 void doMultiplyConst(MachineBasicBlock *MBB,
Misha Brukman1013ef52004-07-21 20:09:08 +0000383 MachineBasicBlock::iterator IP,
384 unsigned DestReg, Value *Op0, ConstantInt *CI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000385
386 void emitDivRemOperation(MachineBasicBlock *BB,
387 MachineBasicBlock::iterator IP,
388 Value *Op0, Value *Op1, bool isDiv,
389 unsigned TargetReg);
390
391 /// emitSetCCOperation - Common code shared between visitSetCondInst and
392 /// constant expression support.
393 ///
394 void emitSetCCOperation(MachineBasicBlock *BB,
395 MachineBasicBlock::iterator IP,
396 Value *Op0, Value *Op1, unsigned Opcode,
397 unsigned TargetReg);
398
399 /// emitShiftOperation - Common code shared between visitShiftInst and
400 /// constant expression support.
401 ///
402 void emitShiftOperation(MachineBasicBlock *MBB,
403 MachineBasicBlock::iterator IP,
404 Value *Op, Value *ShiftAmount, bool isLeftShift,
405 const Type *ResultTy, unsigned DestReg);
406
407 /// emitSelectOperation - Common code shared between visitSelectInst and the
408 /// constant expression support.
Misha Brukmanb097f212004-07-26 18:13:24 +0000409 ///
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000410 void emitSelectOperation(MachineBasicBlock *MBB,
411 MachineBasicBlock::iterator IP,
412 Value *Cond, Value *TrueVal, Value *FalseVal,
413 unsigned DestReg);
414
Misha Brukmanb097f212004-07-26 18:13:24 +0000415 /// copyGlobalBaseToRegister - Output the instructions required to put the
416 /// base address to use for accessing globals into a register.
417 ///
Misha Brukmana1dca552004-09-21 18:22:19 +0000418 void copyGlobalBaseToRegister(MachineBasicBlock *MBB,
419 MachineBasicBlock::iterator IP,
420 unsigned R);
Misha Brukmanb097f212004-07-26 18:13:24 +0000421
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000422 /// copyConstantToRegister - Output the instructions required to put the
423 /// specified constant into the specified register.
424 ///
425 void copyConstantToRegister(MachineBasicBlock *MBB,
426 MachineBasicBlock::iterator MBBI,
427 Constant *C, unsigned Reg);
428
429 void emitUCOM(MachineBasicBlock *MBB, MachineBasicBlock::iterator MBBI,
430 unsigned LHS, unsigned RHS);
431
432 /// makeAnotherReg - This method returns the next register number we haven't
433 /// yet used.
434 ///
435 /// Long values are handled somewhat specially. They are always allocated
436 /// as pairs of 32 bit integer values. The register number returned is the
Misha Brukman1013ef52004-07-21 20:09:08 +0000437 /// high 32 bits of the long value, and the regNum+1 is the low 32 bits.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000438 ///
439 unsigned makeAnotherReg(const Type *Ty) {
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000440 assert(dynamic_cast<const PPC32RegisterInfo*>(TM.getRegisterInfo()) &&
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000441 "Current target doesn't have PPC reg info??");
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000442 const PPC32RegisterInfo *PPCRI =
443 static_cast<const PPC32RegisterInfo*>(TM.getRegisterInfo());
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000444 if (Ty == Type::LongTy || Ty == Type::ULongTy) {
Nate Begemanb64af912004-08-10 20:42:36 +0000445 const TargetRegisterClass *RC = PPCRI->getRegClassForType(Type::IntTy);
446 // Create the upper part
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000447 F->getSSARegMap()->createVirtualRegister(RC);
Nate Begemanb64af912004-08-10 20:42:36 +0000448 // Create the lower part.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000449 return F->getSSARegMap()->createVirtualRegister(RC)-1;
450 }
451
452 // Add the mapping of regnumber => reg class to MachineFunction
Nate Begemanb64af912004-08-10 20:42:36 +0000453 const TargetRegisterClass *RC = PPCRI->getRegClassForType(Ty);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000454 return F->getSSARegMap()->createVirtualRegister(RC);
455 }
456
457 /// getReg - This method turns an LLVM value into a register number.
458 ///
459 unsigned getReg(Value &V) { return getReg(&V); } // Allow references
460 unsigned getReg(Value *V) {
461 // Just append to the end of the current bb.
462 MachineBasicBlock::iterator It = BB->end();
463 return getReg(V, BB, It);
464 }
465 unsigned getReg(Value *V, MachineBasicBlock *MBB,
466 MachineBasicBlock::iterator IPt);
Misha Brukman1013ef52004-07-21 20:09:08 +0000467
468 /// canUseAsImmediateForOpcode - This method returns whether a ConstantInt
469 /// is okay to use as an immediate argument to a certain binary operation
Nate Begemanb816f022004-10-07 22:30:03 +0000470 bool canUseAsImmediateForOpcode(ConstantInt *CI, unsigned Opcode,
471 bool Shifted);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000472
473 /// getFixedSizedAllocaFI - Return the frame index for a fixed sized alloca
474 /// that is to be statically allocated with the initial stack frame
475 /// adjustment.
476 unsigned getFixedSizedAllocaFI(AllocaInst *AI);
477 };
478}
479
480/// dyn_castFixedAlloca - If the specified value is a fixed size alloca
481/// instruction in the entry block, return it. Otherwise, return a null
482/// pointer.
483static AllocaInst *dyn_castFixedAlloca(Value *V) {
484 if (AllocaInst *AI = dyn_cast<AllocaInst>(V)) {
485 BasicBlock *BB = AI->getParent();
486 if (isa<ConstantUInt>(AI->getArraySize()) && BB ==&BB->getParent()->front())
487 return AI;
488 }
489 return 0;
490}
491
492/// getReg - This method turns an LLVM value into a register number.
493///
Misha Brukmana1dca552004-09-21 18:22:19 +0000494unsigned PPC32ISel::getReg(Value *V, MachineBasicBlock *MBB,
495 MachineBasicBlock::iterator IPt) {
Misha Brukmanba1c1da2004-07-20 00:59:38 +0000496 if (Constant *C = dyn_cast<Constant>(V)) {
Chris Lattnera51e4f62004-07-18 18:45:01 +0000497 unsigned Reg = makeAnotherReg(V->getType());
498 copyConstantToRegister(MBB, IPt, C, Reg);
499 return Reg;
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000500 } else if (AllocaInst *AI = dyn_castFixedAlloca(V)) {
501 unsigned Reg = makeAnotherReg(V->getType());
502 unsigned FI = getFixedSizedAllocaFI(AI);
Misha Brukman5b570812004-08-10 22:47:03 +0000503 addFrameReference(BuildMI(*MBB, IPt, PPC::ADDI, 2, Reg), FI, 0, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000504 return Reg;
505 }
506
507 unsigned &Reg = RegMap[V];
508 if (Reg == 0) {
509 Reg = makeAnotherReg(V->getType());
510 RegMap[V] = Reg;
511 }
512
513 return Reg;
514}
515
Misha Brukman1013ef52004-07-21 20:09:08 +0000516/// canUseAsImmediateForOpcode - This method returns whether a ConstantInt
517/// is okay to use as an immediate argument to a certain binary operator.
Nate Begemanb816f022004-10-07 22:30:03 +0000518/// The shifted argument determines if the immediate is suitable to be used with
519/// the PowerPC instructions such as addis which concatenate 16 bits of the
520/// immediate with 16 bits of zeroes.
Misha Brukman1013ef52004-07-21 20:09:08 +0000521///
Nate Begemanb816f022004-10-07 22:30:03 +0000522bool PPC32ISel::canUseAsImmediateForOpcode(ConstantInt *CI, unsigned Opcode,
523 bool Shifted) {
Misha Brukman1013ef52004-07-21 20:09:08 +0000524 ConstantSInt *Op1Cs;
525 ConstantUInt *Op1Cu;
Nate Begemanb816f022004-10-07 22:30:03 +0000526
527 // For shifted immediates, any value with the low halfword cleared may be used
528 if (Shifted) {
Nate Begemanbdf69842004-10-08 02:49:24 +0000529 if (((int32_t)CI->getRawValue() & 0x0000FFFF) == 0)
Nate Begemanb816f022004-10-07 22:30:03 +0000530 return true;
Nate Begemanbdf69842004-10-08 02:49:24 +0000531 else
532 return false;
Nate Begemanb816f022004-10-07 22:30:03 +0000533 }
Misha Brukman1013ef52004-07-21 20:09:08 +0000534
535 // ADDI, Compare, and non-indexed Load take SIMM
Nate Begemanb816f022004-10-07 22:30:03 +0000536 bool cond1 = (Opcode < 2)
Nate Begemana41fc772004-09-29 02:35:05 +0000537 && ((int32_t)CI->getRawValue() <= 32767)
538 && ((int32_t)CI->getRawValue() >= -32768);
Misha Brukman1013ef52004-07-21 20:09:08 +0000539
Misha Brukman1013ef52004-07-21 20:09:08 +0000540 // ANDIo, ORI, and XORI take unsigned values
Nate Begemanb816f022004-10-07 22:30:03 +0000541 bool cond2 = (Opcode >= 2)
Misha Brukman2ed17ca2004-07-22 15:58:04 +0000542 && (Op1Cs = dyn_cast<ConstantSInt>(CI))
543 && (Op1Cs->getValue() >= 0)
Nate Begemana41fc772004-09-29 02:35:05 +0000544 && (Op1Cs->getValue() <= 65535);
Misha Brukman1013ef52004-07-21 20:09:08 +0000545
546 // ANDIo, ORI, and XORI take UIMMs, so they can be larger
Nate Begemanb816f022004-10-07 22:30:03 +0000547 bool cond3 = (Opcode >= 2)
Misha Brukman17a90002004-07-21 20:22:06 +0000548 && (Op1Cu = dyn_cast<ConstantUInt>(CI))
549 && (Op1Cu->getValue() <= 65535);
Misha Brukman1013ef52004-07-21 20:09:08 +0000550
Nate Begemanb816f022004-10-07 22:30:03 +0000551 if (cond1 || cond2 || cond3)
Misha Brukman1013ef52004-07-21 20:09:08 +0000552 return true;
553
554 return false;
555}
556
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000557/// getFixedSizedAllocaFI - Return the frame index for a fixed sized alloca
558/// that is to be statically allocated with the initial stack frame
559/// adjustment.
Misha Brukmana1dca552004-09-21 18:22:19 +0000560unsigned PPC32ISel::getFixedSizedAllocaFI(AllocaInst *AI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000561 // Already computed this?
562 std::map<AllocaInst*, unsigned>::iterator I = AllocaMap.lower_bound(AI);
563 if (I != AllocaMap.end() && I->first == AI) return I->second;
564
565 const Type *Ty = AI->getAllocatedType();
566 ConstantUInt *CUI = cast<ConstantUInt>(AI->getArraySize());
567 unsigned TySize = TM.getTargetData().getTypeSize(Ty);
568 TySize *= CUI->getValue(); // Get total allocated size...
569 unsigned Alignment = TM.getTargetData().getTypeAlignment(Ty);
570
571 // Create a new stack object using the frame manager...
572 int FrameIdx = F->getFrameInfo()->CreateStackObject(TySize, Alignment);
573 AllocaMap.insert(I, std::make_pair(AI, FrameIdx));
574 return FrameIdx;
575}
576
577
Misha Brukmanb097f212004-07-26 18:13:24 +0000578/// copyGlobalBaseToRegister - Output the instructions required to put the
579/// base address to use for accessing globals into a register.
580///
Misha Brukmana1dca552004-09-21 18:22:19 +0000581void PPC32ISel::copyGlobalBaseToRegister(MachineBasicBlock *MBB,
582 MachineBasicBlock::iterator IP,
583 unsigned R) {
Misha Brukmanb097f212004-07-26 18:13:24 +0000584 if (!GlobalBaseInitialized) {
585 // Insert the set of GlobalBaseReg into the first MBB of the function
586 MachineBasicBlock &FirstMBB = F->front();
587 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
588 GlobalBaseReg = makeAnotherReg(Type::IntTy);
Nate Begemanb7a8f2c2004-09-02 08:13:00 +0000589 BuildMI(FirstMBB, MBBI, PPC::MovePCtoLR, 0, PPC::LR);
Nate Begemanda721e72004-09-27 05:08:17 +0000590 BuildMI(FirstMBB, MBBI, PPC::MFLR, 1, GlobalBaseReg).addReg(PPC::LR);
Misha Brukmanb097f212004-07-26 18:13:24 +0000591 GlobalBaseInitialized = true;
592 }
593 // Emit our copy of GlobalBaseReg to the destination register in the
594 // current MBB
Misha Brukman5b570812004-08-10 22:47:03 +0000595 BuildMI(*MBB, IP, PPC::OR, 2, R).addReg(GlobalBaseReg)
Misha Brukmanb097f212004-07-26 18:13:24 +0000596 .addReg(GlobalBaseReg);
597}
598
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000599/// copyConstantToRegister - Output the instructions required to put the
600/// specified constant into the specified register.
601///
Misha Brukmana1dca552004-09-21 18:22:19 +0000602void PPC32ISel::copyConstantToRegister(MachineBasicBlock *MBB,
603 MachineBasicBlock::iterator IP,
604 Constant *C, unsigned R) {
Chris Lattner289a49a2004-10-16 18:13:47 +0000605 if (isa<UndefValue>(C)) {
606 BuildMI(*MBB, IP, PPC::IMPLICIT_DEF, 0, R);
607 return;
608 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000609 if (C->getType()->isIntegral()) {
610 unsigned Class = getClassB(C->getType());
611
612 if (Class == cLong) {
Misha Brukmana0af38c2004-07-28 19:13:49 +0000613 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(C)) {
614 uint64_t uval = CUI->getValue();
615 unsigned hiUVal = uval >> 32;
616 unsigned loUVal = uval;
617 ConstantUInt *CUHi = ConstantUInt::get(Type::UIntTy, hiUVal);
618 ConstantUInt *CULo = ConstantUInt::get(Type::UIntTy, loUVal);
619 copyConstantToRegister(MBB, IP, CUHi, R);
620 copyConstantToRegister(MBB, IP, CULo, R+1);
621 return;
622 } else if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(C)) {
623 int64_t sval = CSI->getValue();
624 int hiSVal = sval >> 32;
625 int loSVal = sval;
626 ConstantSInt *CSHi = ConstantSInt::get(Type::IntTy, hiSVal);
627 ConstantSInt *CSLo = ConstantSInt::get(Type::IntTy, loSVal);
628 copyConstantToRegister(MBB, IP, CSHi, R);
629 copyConstantToRegister(MBB, IP, CSLo, R+1);
630 return;
Misha Brukman7e898c32004-07-20 00:41:46 +0000631 } else {
Misha Brukmana0af38c2004-07-28 19:13:49 +0000632 std::cerr << "Unhandled long constant type!\n";
633 abort();
634 }
635 }
636
637 assert(Class <= cInt && "Type not handled yet!");
638
639 // Handle bool
640 if (C->getType() == Type::BoolTy) {
Misha Brukman5b570812004-08-10 22:47:03 +0000641 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(C == ConstantBool::True);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000642 return;
643 }
644
645 // Handle int
646 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(C)) {
647 unsigned uval = CUI->getValue();
648 if (uval < 32768) {
Misha Brukman5b570812004-08-10 22:47:03 +0000649 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(uval);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000650 } else {
651 unsigned Temp = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +0000652 BuildMI(*MBB, IP, PPC::LIS, 1, Temp).addSImm(uval >> 16);
Nate Begemanb816f022004-10-07 22:30:03 +0000653 BuildMI(*MBB, IP, PPC::ORI, 2, R).addReg(Temp).addImm(uval & 0xFFFF);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000654 }
655 return;
656 } else if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(C)) {
657 int sval = CSI->getValue();
658 if (sval < 32768 && sval >= -32768) {
Misha Brukman5b570812004-08-10 22:47:03 +0000659 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(sval);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000660 } else {
661 unsigned Temp = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +0000662 BuildMI(*MBB, IP, PPC::LIS, 1, Temp).addSImm(sval >> 16);
Nate Begemanb816f022004-10-07 22:30:03 +0000663 BuildMI(*MBB, IP, PPC::ORI, 2, R).addReg(Temp).addImm(sval & 0xFFFF);
Misha Brukman7e898c32004-07-20 00:41:46 +0000664 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000665 return;
666 }
Misha Brukmana0af38c2004-07-28 19:13:49 +0000667 std::cerr << "Unhandled integer constant!\n";
668 abort();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000669 } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) {
Misha Brukmand18a31d2004-07-06 22:51:53 +0000670 // We need to spill the constant to memory...
671 MachineConstantPool *CP = F->getConstantPool();
672 unsigned CPI = CP->getConstantPoolIndex(CFP);
673 const Type *Ty = CFP->getType();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000674
Misha Brukmand18a31d2004-07-06 22:51:53 +0000675 assert(Ty == Type::FloatTy || Ty == Type::DoubleTy && "Unknown FP type!");
Misha Brukmanfc879c32004-07-08 18:02:38 +0000676
Misha Brukmanb097f212004-07-26 18:13:24 +0000677 // Load addr of constant to reg; constant is located at base + distance
678 unsigned GlobalBase = makeAnotherReg(Type::IntTy);
Misha Brukmanfc879c32004-07-08 18:02:38 +0000679 unsigned Reg1 = makeAnotherReg(Type::IntTy);
Nate Begeman07a73752004-08-17 07:17:44 +0000680 unsigned Opcode = (Ty == Type::FloatTy) ? PPC::LFS : PPC::LFD;
Misha Brukmanb097f212004-07-26 18:13:24 +0000681 // Move value at base + distance into return reg
682 copyGlobalBaseToRegister(MBB, IP, GlobalBase);
Misha Brukman5b570812004-08-10 22:47:03 +0000683 BuildMI(*MBB, IP, PPC::LOADHiAddr, 2, Reg1).addReg(GlobalBase)
Misha Brukmanfc879c32004-07-08 18:02:38 +0000684 .addConstantPoolIndex(CPI);
Nate Begemaned428532004-09-04 05:00:00 +0000685 BuildMI(*MBB, IP, Opcode, 2, R).addConstantPoolIndex(CPI).addReg(Reg1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000686 } else if (isa<ConstantPointerNull>(C)) {
687 // Copy zero (null pointer) to the register.
Misha Brukman5b570812004-08-10 22:47:03 +0000688 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(0);
Chris Lattner67910e12004-07-18 07:29:35 +0000689 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) {
Misha Brukmanb097f212004-07-26 18:13:24 +0000690 // GV is located at base + distance
Nate Begemaned428532004-09-04 05:00:00 +0000691
Misha Brukmanb097f212004-07-26 18:13:24 +0000692 unsigned GlobalBase = makeAnotherReg(Type::IntTy);
Misha Brukmanba1c1da2004-07-20 00:59:38 +0000693 unsigned TmpReg = makeAnotherReg(GV->getType());
Nate Begeman81d265d2004-08-19 05:20:54 +0000694 unsigned Opcode = (GV->hasWeakLinkage()
695 || GV->isExternal()
696 || dyn_cast<Function>(GV)) ? PPC::LWZ : PPC::LA;
Misha Brukmanb097f212004-07-26 18:13:24 +0000697
698 // Move value at base + distance into return reg
699 copyGlobalBaseToRegister(MBB, IP, GlobalBase);
Misha Brukman5b570812004-08-10 22:47:03 +0000700 BuildMI(*MBB, IP, PPC::LOADHiAddr, 2, TmpReg).addReg(GlobalBase)
Misha Brukmanba1c1da2004-07-20 00:59:38 +0000701 .addGlobalAddress(GV);
Nate Begemaned428532004-09-04 05:00:00 +0000702 BuildMI(*MBB, IP, Opcode, 2, R).addGlobalAddress(GV).addReg(TmpReg);
Misha Brukmane2eceb52004-07-23 16:08:20 +0000703
704 // Add the GV to the list of things whose addresses have been taken.
705 TM.AddressTaken.insert(GV);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000706 } else {
Chris Lattner76e2df22004-07-15 02:14:30 +0000707 std::cerr << "Offending constant: " << *C << "\n";
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000708 assert(0 && "Type not handled yet!");
709 }
710}
711
712/// LoadArgumentsToVirtualRegs - Load all of the arguments to this function from
713/// the stack into virtual registers.
Misha Brukmana1dca552004-09-21 18:22:19 +0000714void PPC32ISel::LoadArgumentsToVirtualRegs(Function &Fn) {
Chris Lattner3ea93462004-08-06 06:58:50 +0000715 unsigned ArgOffset = 24;
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000716 unsigned GPR_remaining = 8;
717 unsigned FPR_remaining = 13;
Misha Brukmand18a31d2004-07-06 22:51:53 +0000718 unsigned GPR_idx = 0, FPR_idx = 0;
719 static const unsigned GPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +0000720 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
721 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
Misha Brukmand18a31d2004-07-06 22:51:53 +0000722 };
723 static const unsigned FPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +0000724 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
725 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
Misha Brukmand18a31d2004-07-06 22:51:53 +0000726 };
Misha Brukman422791f2004-06-21 17:41:12 +0000727
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000728 MachineFrameInfo *MFI = F->getFrameInfo();
Misha Brukmand18a31d2004-07-06 22:51:53 +0000729
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000730 for (Function::aiterator I = Fn.abegin(), E = Fn.aend(); I != E; ++I) {
731 bool ArgLive = !I->use_empty();
732 unsigned Reg = ArgLive ? getReg(*I) : 0;
733 int FI; // Frame object index
734
735 switch (getClassB(I->getType())) {
736 case cByte:
737 if (ArgLive) {
Misha Brukmanec6319a2004-07-20 15:51:37 +0000738 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000739 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000740 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]);
741 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000742 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000743 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000744 addFrameReference(BuildMI(BB, PPC::LBZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000745 }
746 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000747 break;
748 case cShort:
749 if (ArgLive) {
Misha Brukmanec6319a2004-07-20 15:51:37 +0000750 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000751 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000752 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]);
753 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000754 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000755 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000756 addFrameReference(BuildMI(BB, PPC::LHZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000757 }
758 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000759 break;
760 case cInt:
761 if (ArgLive) {
762 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000763 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000764 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]);
765 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000766 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000767 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000768 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000769 }
770 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000771 break;
772 case cLong:
773 if (ArgLive) {
774 FI = MFI->CreateFixedObject(8, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000775 if (GPR_remaining > 1) {
Misha Brukman5b570812004-08-10 22:47:03 +0000776 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]);
777 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx+1]);
778 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukman313efcb2004-07-09 15:45:07 +0000779 .addReg(GPR[GPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000780 BuildMI(BB, PPC::OR, 2, Reg+1).addReg(GPR[GPR_idx+1])
Misha Brukman313efcb2004-07-09 15:45:07 +0000781 .addReg(GPR[GPR_idx+1]);
Misha Brukman422791f2004-06-21 17:41:12 +0000782 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000783 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg), FI);
784 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg+1), FI, 4);
Misha Brukman422791f2004-06-21 17:41:12 +0000785 }
786 }
Misha Brukman1013ef52004-07-21 20:09:08 +0000787 // longs require 4 additional bytes and use 2 GPRs
788 ArgOffset += 4;
Misha Brukman422791f2004-06-21 17:41:12 +0000789 if (GPR_remaining > 1) {
Misha Brukman1013ef52004-07-21 20:09:08 +0000790 GPR_remaining--;
Misha Brukman422791f2004-06-21 17:41:12 +0000791 GPR_idx++;
792 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000793 break;
Misha Brukman7e898c32004-07-20 00:41:46 +0000794 case cFP32:
795 if (ArgLive) {
796 FI = MFI->CreateFixedObject(4, ArgOffset);
797
Misha Brukman422791f2004-06-21 17:41:12 +0000798 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000799 BuildMI(BB, PPC::IMPLICIT_DEF, 0, FPR[FPR_idx]);
800 BuildMI(BB, PPC::FMR, 1, Reg).addReg(FPR[FPR_idx]);
Misha Brukmand18a31d2004-07-06 22:51:53 +0000801 FPR_remaining--;
802 FPR_idx++;
Misha Brukman422791f2004-06-21 17:41:12 +0000803 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000804 addFrameReference(BuildMI(BB, PPC::LFS, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000805 }
806 }
Misha Brukman7e898c32004-07-20 00:41:46 +0000807 break;
808 case cFP64:
809 if (ArgLive) {
810 FI = MFI->CreateFixedObject(8, ArgOffset);
811
812 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000813 BuildMI(BB, PPC::IMPLICIT_DEF, 0, FPR[FPR_idx]);
814 BuildMI(BB, PPC::FMR, 1, Reg).addReg(FPR[FPR_idx]);
Misha Brukman7e898c32004-07-20 00:41:46 +0000815 FPR_remaining--;
816 FPR_idx++;
817 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000818 addFrameReference(BuildMI(BB, PPC::LFD, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000819 }
820 }
Misha Brukman7e898c32004-07-20 00:41:46 +0000821
822 // doubles require 4 additional bytes and use 2 GPRs of param space
823 ArgOffset += 4;
824 if (GPR_remaining > 0) {
825 GPR_remaining--;
826 GPR_idx++;
827 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000828 break;
829 default:
830 assert(0 && "Unhandled argument type!");
831 }
832 ArgOffset += 4; // Each argument takes at least 4 bytes on the stack...
Misha Brukman422791f2004-06-21 17:41:12 +0000833 if (GPR_remaining > 0) {
Misha Brukmand18a31d2004-07-06 22:51:53 +0000834 GPR_remaining--; // uses up 2 GPRs
835 GPR_idx++;
Misha Brukman422791f2004-06-21 17:41:12 +0000836 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000837 }
838
839 // If the function takes variable number of arguments, add a frame offset for
840 // the start of the first vararg value... this is used to expand
841 // llvm.va_start.
842 if (Fn.getFunctionType()->isVarArg())
Misha Brukmanb097f212004-07-26 18:13:24 +0000843 VarArgsFrameIndex = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000844}
845
846
847/// SelectPHINodes - Insert machine code to generate phis. This is tricky
848/// because we have to generate our sources into the source basic blocks, not
849/// the current one.
850///
Misha Brukmana1dca552004-09-21 18:22:19 +0000851void PPC32ISel::SelectPHINodes() {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000852 const TargetInstrInfo &TII = *TM.getInstrInfo();
853 const Function &LF = *F->getFunction(); // The LLVM function...
854 for (Function::const_iterator I = LF.begin(), E = LF.end(); I != E; ++I) {
855 const BasicBlock *BB = I;
856 MachineBasicBlock &MBB = *MBBMap[I];
857
858 // Loop over all of the PHI nodes in the LLVM basic block...
859 MachineBasicBlock::iterator PHIInsertPoint = MBB.begin();
860 for (BasicBlock::const_iterator I = BB->begin();
861 PHINode *PN = const_cast<PHINode*>(dyn_cast<PHINode>(I)); ++I) {
862
863 // Create a new machine instr PHI node, and insert it.
864 unsigned PHIReg = getReg(*PN);
865 MachineInstr *PhiMI = BuildMI(MBB, PHIInsertPoint,
Misha Brukman5b570812004-08-10 22:47:03 +0000866 PPC::PHI, PN->getNumOperands(), PHIReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000867
868 MachineInstr *LongPhiMI = 0;
869 if (PN->getType() == Type::LongTy || PN->getType() == Type::ULongTy)
870 LongPhiMI = BuildMI(MBB, PHIInsertPoint,
Misha Brukman5b570812004-08-10 22:47:03 +0000871 PPC::PHI, PN->getNumOperands(), PHIReg+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000872
873 // PHIValues - Map of blocks to incoming virtual registers. We use this
874 // so that we only initialize one incoming value for a particular block,
875 // even if the block has multiple entries in the PHI node.
876 //
877 std::map<MachineBasicBlock*, unsigned> PHIValues;
878
879 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
Misha Brukman313efcb2004-07-09 15:45:07 +0000880 MachineBasicBlock *PredMBB = 0;
881 for (MachineBasicBlock::pred_iterator PI = MBB.pred_begin (),
882 PE = MBB.pred_end (); PI != PE; ++PI)
883 if (PN->getIncomingBlock(i) == (*PI)->getBasicBlock()) {
884 PredMBB = *PI;
885 break;
886 }
887 assert (PredMBB && "Couldn't find incoming machine-cfg edge for phi");
888
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000889 unsigned ValReg;
890 std::map<MachineBasicBlock*, unsigned>::iterator EntryIt =
891 PHIValues.lower_bound(PredMBB);
892
893 if (EntryIt != PHIValues.end() && EntryIt->first == PredMBB) {
894 // We already inserted an initialization of the register for this
895 // predecessor. Recycle it.
896 ValReg = EntryIt->second;
Misha Brukman47225442004-07-23 22:35:49 +0000897 } else {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000898 // Get the incoming value into a virtual register.
899 //
900 Value *Val = PN->getIncomingValue(i);
901
902 // If this is a constant or GlobalValue, we may have to insert code
903 // into the basic block to compute it into a virtual register.
904 if ((isa<Constant>(Val) && !isa<ConstantExpr>(Val)) ||
905 isa<GlobalValue>(Val)) {
906 // Simple constants get emitted at the end of the basic block,
907 // before any terminator instructions. We "know" that the code to
908 // move a constant into a register will never clobber any flags.
909 ValReg = getReg(Val, PredMBB, PredMBB->getFirstTerminator());
910 } else {
911 // Because we don't want to clobber any values which might be in
912 // physical registers with the computation of this constant (which
913 // might be arbitrarily complex if it is a constant expression),
914 // just insert the computation at the top of the basic block.
915 MachineBasicBlock::iterator PI = PredMBB->begin();
Misha Brukman47225442004-07-23 22:35:49 +0000916
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000917 // Skip over any PHI nodes though!
Misha Brukman5b570812004-08-10 22:47:03 +0000918 while (PI != PredMBB->end() && PI->getOpcode() == PPC::PHI)
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000919 ++PI;
Misha Brukman47225442004-07-23 22:35:49 +0000920
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000921 ValReg = getReg(Val, PredMBB, PI);
922 }
923
924 // Remember that we inserted a value for this PHI for this predecessor
925 PHIValues.insert(EntryIt, std::make_pair(PredMBB, ValReg));
926 }
927
928 PhiMI->addRegOperand(ValReg);
929 PhiMI->addMachineBasicBlockOperand(PredMBB);
930 if (LongPhiMI) {
931 LongPhiMI->addRegOperand(ValReg+1);
932 LongPhiMI->addMachineBasicBlockOperand(PredMBB);
933 }
934 }
935
936 // Now that we emitted all of the incoming values for the PHI node, make
937 // sure to reposition the InsertPoint after the PHI that we just added.
938 // This is needed because we might have inserted a constant into this
939 // block, right after the PHI's which is before the old insert point!
940 PHIInsertPoint = LongPhiMI ? LongPhiMI : PhiMI;
941 ++PHIInsertPoint;
942 }
943 }
944}
945
946
947// canFoldSetCCIntoBranchOrSelect - Return the setcc instruction if we can fold
948// it into the conditional branch or select instruction which is the only user
949// of the cc instruction. This is the case if the conditional branch is the
950// only user of the setcc, and if the setcc is in the same basic block as the
Misha Brukman1013ef52004-07-21 20:09:08 +0000951// conditional branch.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000952//
953static SetCondInst *canFoldSetCCIntoBranchOrSelect(Value *V) {
954 if (SetCondInst *SCI = dyn_cast<SetCondInst>(V))
955 if (SCI->hasOneUse()) {
956 Instruction *User = cast<Instruction>(SCI->use_back());
957 if ((isa<BranchInst>(User) || isa<SelectInst>(User)) &&
Misha Brukmanbebde752004-07-16 21:06:24 +0000958 SCI->getParent() == User->getParent())
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000959 return SCI;
960 }
961 return 0;
962}
963
Misha Brukmanb097f212004-07-26 18:13:24 +0000964// canFoldGEPIntoLoadOrStore - Return the GEP instruction if we can fold it into
965// the load or store instruction that is the only user of the GEP.
966//
967static GetElementPtrInst *canFoldGEPIntoLoadOrStore(Value *V) {
Nate Begeman645495d2004-09-23 05:31:33 +0000968 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(V)) {
969 bool AllUsesAreMem = true;
970 for (Value::use_iterator I = GEPI->use_begin(), E = GEPI->use_end();
971 I != E; ++I) {
972 Instruction *User = cast<Instruction>(*I);
973
974 // If the GEP is the target of a store, but not the source, then we are ok
975 // to fold it.
Misha Brukmanb097f212004-07-26 18:13:24 +0000976 if (isa<StoreInst>(User) &&
977 GEPI->getParent() == User->getParent() &&
978 User->getOperand(0) != GEPI &&
Nate Begeman645495d2004-09-23 05:31:33 +0000979 User->getOperand(1) == GEPI)
980 continue;
981
982 // If the GEP is the source of a load, then we're always ok to fold it
Misha Brukmanb097f212004-07-26 18:13:24 +0000983 if (isa<LoadInst>(User) &&
984 GEPI->getParent() == User->getParent() &&
Nate Begeman645495d2004-09-23 05:31:33 +0000985 User->getOperand(0) == GEPI)
986 continue;
987
988 // if we got to this point, than the instruction was not a load or store
989 // that we are capable of folding the GEP into.
990 AllUsesAreMem = false;
991 break;
Misha Brukmanb097f212004-07-26 18:13:24 +0000992 }
Nate Begeman645495d2004-09-23 05:31:33 +0000993 if (AllUsesAreMem)
994 return GEPI;
995 }
Misha Brukmanb097f212004-07-26 18:13:24 +0000996 return 0;
997}
998
999
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001000// Return a fixed numbering for setcc instructions which does not depend on the
1001// order of the opcodes.
1002//
1003static unsigned getSetCCNumber(unsigned Opcode) {
Misha Brukmane9c65512004-07-06 15:32:44 +00001004 switch (Opcode) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001005 default: assert(0 && "Unknown setcc instruction!");
1006 case Instruction::SetEQ: return 0;
1007 case Instruction::SetNE: return 1;
1008 case Instruction::SetLT: return 2;
1009 case Instruction::SetGE: return 3;
1010 case Instruction::SetGT: return 4;
1011 case Instruction::SetLE: return 5;
1012 }
1013}
1014
Misha Brukmane9c65512004-07-06 15:32:44 +00001015static unsigned getPPCOpcodeForSetCCNumber(unsigned Opcode) {
1016 switch (Opcode) {
1017 default: assert(0 && "Unknown setcc instruction!");
Misha Brukman5b570812004-08-10 22:47:03 +00001018 case Instruction::SetEQ: return PPC::BEQ;
1019 case Instruction::SetNE: return PPC::BNE;
1020 case Instruction::SetLT: return PPC::BLT;
1021 case Instruction::SetGE: return PPC::BGE;
1022 case Instruction::SetGT: return PPC::BGT;
1023 case Instruction::SetLE: return PPC::BLE;
Misha Brukmane9c65512004-07-06 15:32:44 +00001024 }
1025}
1026
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001027/// emitUCOM - emits an unordered FP compare.
Misha Brukmana1dca552004-09-21 18:22:19 +00001028void PPC32ISel::emitUCOM(MachineBasicBlock *MBB, MachineBasicBlock::iterator IP,
1029 unsigned LHS, unsigned RHS) {
Misha Brukman5b570812004-08-10 22:47:03 +00001030 BuildMI(*MBB, IP, PPC::FCMPU, 2, PPC::CR0).addReg(LHS).addReg(RHS);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001031}
1032
Misha Brukmana1dca552004-09-21 18:22:19 +00001033unsigned PPC32ISel::ExtendOrClear(MachineBasicBlock *MBB,
1034 MachineBasicBlock::iterator IP,
Nate Begemana2de1022004-09-22 04:40:25 +00001035 Value *Op0) {
Nate Begeman0e5e5f52004-08-22 08:10:15 +00001036 const Type *CompTy = Op0->getType();
1037 unsigned Reg = getReg(Op0, MBB, IP);
Nate Begemanb47321b2004-08-20 09:56:22 +00001038 unsigned Class = getClassB(CompTy);
1039
Nate Begeman1b99fd32004-09-29 03:45:33 +00001040 // Since we know that boolean values will be either zero or one, we don't
1041 // have to extend or clear them.
1042 if (CompTy == Type::BoolTy)
1043 return Reg;
1044
Nate Begemanb47321b2004-08-20 09:56:22 +00001045 // Before we do a comparison or SetCC, we have to make sure that we truncate
1046 // the source registers appropriately.
1047 if (Class == cByte) {
1048 unsigned TmpReg = makeAnotherReg(CompTy);
1049 if (CompTy->isSigned())
1050 BuildMI(*MBB, IP, PPC::EXTSB, 1, TmpReg).addReg(Reg);
1051 else
1052 BuildMI(*MBB, IP, PPC::RLWINM, 4, TmpReg).addReg(Reg).addImm(0)
1053 .addImm(24).addImm(31);
1054 Reg = TmpReg;
1055 } else if (Class == cShort) {
1056 unsigned TmpReg = makeAnotherReg(CompTy);
1057 if (CompTy->isSigned())
1058 BuildMI(*MBB, IP, PPC::EXTSH, 1, TmpReg).addReg(Reg);
1059 else
1060 BuildMI(*MBB, IP, PPC::RLWINM, 4, TmpReg).addReg(Reg).addImm(0)
1061 .addImm(16).addImm(31);
1062 Reg = TmpReg;
1063 }
1064 return Reg;
1065}
1066
Misha Brukmanbebde752004-07-16 21:06:24 +00001067/// EmitComparison - emits a comparison of the two operands, returning the
1068/// extended setcc code to use. The result is in CR0.
1069///
Misha Brukmana1dca552004-09-21 18:22:19 +00001070unsigned PPC32ISel::EmitComparison(unsigned OpNum, Value *Op0, Value *Op1,
1071 MachineBasicBlock *MBB,
1072 MachineBasicBlock::iterator IP) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001073 // The arguments are already supposed to be of the same type.
1074 const Type *CompTy = Op0->getType();
1075 unsigned Class = getClassB(CompTy);
Nate Begemana2de1022004-09-22 04:40:25 +00001076 unsigned Op0r = ExtendOrClear(MBB, IP, Op0);
Misha Brukmanb097f212004-07-26 18:13:24 +00001077
Misha Brukman1013ef52004-07-21 20:09:08 +00001078 // Use crand for lt, gt and crandc for le, ge
Misha Brukman5b570812004-08-10 22:47:03 +00001079 unsigned CROpcode = (OpNum == 2 || OpNum == 4) ? PPC::CRAND : PPC::CRANDC;
Misha Brukman1013ef52004-07-21 20:09:08 +00001080 // ? cr1[lt] : cr1[gt]
1081 unsigned CR1field = (OpNum == 2 || OpNum == 3) ? 4 : 5;
1082 // ? cr0[lt] : cr0[gt]
1083 unsigned CR0field = (OpNum == 2 || OpNum == 5) ? 0 : 1;
Misha Brukman5b570812004-08-10 22:47:03 +00001084 unsigned Opcode = CompTy->isSigned() ? PPC::CMPW : PPC::CMPLW;
1085 unsigned OpcodeImm = CompTy->isSigned() ? PPC::CMPWI : PPC::CMPLWI;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001086
1087 // Special case handling of: cmp R, i
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001088 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001089 if (Class == cByte || Class == cShort || Class == cInt) {
Misha Brukman1013ef52004-07-21 20:09:08 +00001090 unsigned Op1v = CI->getRawValue() & 0xFFFF;
Nate Begeman43d64ea2004-08-15 06:42:28 +00001091 unsigned OpClass = (CompTy->isSigned()) ? 0 : 2;
1092
Misha Brukman1013ef52004-07-21 20:09:08 +00001093 // Treat compare like ADDI for the purposes of immediate suitability
Nate Begemanb816f022004-10-07 22:30:03 +00001094 if (canUseAsImmediateForOpcode(CI, OpClass, false)) {
Misha Brukman5b570812004-08-10 22:47:03 +00001095 BuildMI(*MBB, IP, OpcodeImm, 2, PPC::CR0).addReg(Op0r).addSImm(Op1v);
Misha Brukman422791f2004-06-21 17:41:12 +00001096 } else {
1097 unsigned Op1r = getReg(Op1, MBB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00001098 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
Misha Brukman422791f2004-06-21 17:41:12 +00001099 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001100 return OpNum;
1101 } else {
1102 assert(Class == cLong && "Unknown integer class!");
1103 unsigned LowCst = CI->getRawValue();
1104 unsigned HiCst = CI->getRawValue() >> 32;
1105 if (OpNum < 2) { // seteq, setne
Misha Brukman1013ef52004-07-21 20:09:08 +00001106 unsigned LoLow = makeAnotherReg(Type::IntTy);
1107 unsigned LoTmp = makeAnotherReg(Type::IntTy);
1108 unsigned HiLow = makeAnotherReg(Type::IntTy);
1109 unsigned HiTmp = makeAnotherReg(Type::IntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001110 unsigned FinalTmp = makeAnotherReg(Type::IntTy);
Misha Brukman47225442004-07-23 22:35:49 +00001111
Misha Brukman5b570812004-08-10 22:47:03 +00001112 BuildMI(*MBB, IP, PPC::XORI, 2, LoLow).addReg(Op0r+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001113 .addImm(LowCst & 0xFFFF);
Misha Brukman5b570812004-08-10 22:47:03 +00001114 BuildMI(*MBB, IP, PPC::XORIS, 2, LoTmp).addReg(LoLow)
Misha Brukman1013ef52004-07-21 20:09:08 +00001115 .addImm(LowCst >> 16);
Misha Brukman5b570812004-08-10 22:47:03 +00001116 BuildMI(*MBB, IP, PPC::XORI, 2, HiLow).addReg(Op0r)
Misha Brukman1013ef52004-07-21 20:09:08 +00001117 .addImm(HiCst & 0xFFFF);
Misha Brukman5b570812004-08-10 22:47:03 +00001118 BuildMI(*MBB, IP, PPC::XORIS, 2, HiTmp).addReg(HiLow)
Misha Brukman1013ef52004-07-21 20:09:08 +00001119 .addImm(HiCst >> 16);
Misha Brukman5b570812004-08-10 22:47:03 +00001120 BuildMI(*MBB, IP, PPC::ORo, 2, FinalTmp).addReg(LoTmp).addReg(HiTmp);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001121 return OpNum;
1122 } else {
Misha Brukmanbebde752004-07-16 21:06:24 +00001123 unsigned ConstReg = makeAnotherReg(CompTy);
Misha Brukmanbebde752004-07-16 21:06:24 +00001124 copyConstantToRegister(MBB, IP, CI, ConstReg);
Misha Brukman47225442004-07-23 22:35:49 +00001125
Misha Brukman1013ef52004-07-21 20:09:08 +00001126 // cr0 = r3 ccOpcode r5 or (r3 == r5 AND r4 ccOpcode r6)
Misha Brukman5b570812004-08-10 22:47:03 +00001127 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r)
Misha Brukmanbebde752004-07-16 21:06:24 +00001128 .addReg(ConstReg);
Misha Brukman5b570812004-08-10 22:47:03 +00001129 BuildMI(*MBB, IP, Opcode, 2, PPC::CR1).addReg(Op0r+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001130 .addReg(ConstReg+1);
Misha Brukman5b570812004-08-10 22:47:03 +00001131 BuildMI(*MBB, IP, PPC::CRAND, 3).addImm(2).addImm(2).addImm(CR1field);
1132 BuildMI(*MBB, IP, PPC::CROR, 3).addImm(CR0field).addImm(CR0field)
Misha Brukman1013ef52004-07-21 20:09:08 +00001133 .addImm(2);
Misha Brukman422791f2004-06-21 17:41:12 +00001134 return OpNum;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001135 }
1136 }
1137 }
1138
1139 unsigned Op1r = getReg(Op1, MBB, IP);
Misha Brukman1013ef52004-07-21 20:09:08 +00001140
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001141 switch (Class) {
1142 default: assert(0 && "Unknown type class!");
1143 case cByte:
1144 case cShort:
1145 case cInt:
Misha Brukman5b570812004-08-10 22:47:03 +00001146 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001147 break;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001148
Misha Brukman7e898c32004-07-20 00:41:46 +00001149 case cFP32:
1150 case cFP64:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001151 emitUCOM(MBB, IP, Op0r, Op1r);
1152 break;
1153
1154 case cLong:
1155 if (OpNum < 2) { // seteq, setne
1156 unsigned LoTmp = makeAnotherReg(Type::IntTy);
1157 unsigned HiTmp = makeAnotherReg(Type::IntTy);
1158 unsigned FinalTmp = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00001159 BuildMI(*MBB, IP, PPC::XOR, 2, HiTmp).addReg(Op0r).addReg(Op1r);
1160 BuildMI(*MBB, IP, PPC::XOR, 2, LoTmp).addReg(Op0r+1).addReg(Op1r+1);
1161 BuildMI(*MBB, IP, PPC::ORo, 2, FinalTmp).addReg(LoTmp).addReg(HiTmp);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001162 break; // Allow the sete or setne to be generated from flags set by OR
1163 } else {
Misha Brukmanbebde752004-07-16 21:06:24 +00001164 unsigned TmpReg1 = makeAnotherReg(Type::IntTy);
1165 unsigned TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman1013ef52004-07-21 20:09:08 +00001166
1167 // cr0 = r3 ccOpcode r5 or (r3 == r5 AND r4 ccOpcode r6)
Misha Brukman5b570812004-08-10 22:47:03 +00001168 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
1169 BuildMI(*MBB, IP, Opcode, 2, PPC::CR1).addReg(Op0r+1).addReg(Op1r+1);
1170 BuildMI(*MBB, IP, PPC::CRAND, 3).addImm(2).addImm(2).addImm(CR1field);
1171 BuildMI(*MBB, IP, PPC::CROR, 3).addImm(CR0field).addImm(CR0field)
Misha Brukman1013ef52004-07-21 20:09:08 +00001172 .addImm(2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001173 return OpNum;
1174 }
1175 }
1176 return OpNum;
1177}
1178
Misha Brukmand18a31d2004-07-06 22:51:53 +00001179/// visitSetCondInst - emit code to calculate the condition via
1180/// EmitComparison(), and possibly store a 0 or 1 to a register as a result
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001181///
Misha Brukmana1dca552004-09-21 18:22:19 +00001182void PPC32ISel::visitSetCondInst(SetCondInst &I) {
Misha Brukmand18a31d2004-07-06 22:51:53 +00001183 if (canFoldSetCCIntoBranchOrSelect(&I))
Misha Brukmane9c65512004-07-06 15:32:44 +00001184 return;
Misha Brukmanbebde752004-07-16 21:06:24 +00001185
Nate Begemana2de1022004-09-22 04:40:25 +00001186 MachineBasicBlock::iterator MI = BB->end();
1187 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
1188 const Type *Ty = Op0->getType();
1189 unsigned Class = getClassB(Ty);
Nate Begemana96c4af2004-08-21 20:42:14 +00001190 unsigned Opcode = I.getOpcode();
Nate Begemana2de1022004-09-22 04:40:25 +00001191 unsigned OpNum = getSetCCNumber(Opcode);
1192 unsigned DestReg = getReg(I);
1193
1194 // If the comparison type is byte, short, or int, then we can emit a
1195 // branchless version of the SetCC that puts 0 (false) or 1 (true) in the
1196 // destination register.
1197 if (Class <= cInt) {
1198 ConstantInt *CI = dyn_cast<ConstantInt>(Op1);
1199
1200 if (CI && CI->getRawValue() == 0) {
Nate Begemana2de1022004-09-22 04:40:25 +00001201 unsigned Op0Reg = ExtendOrClear(BB, MI, Op0);
1202
1203 // comparisons against constant zero and negative one often have shorter
1204 // and/or faster sequences than the set-and-branch general case, handled
1205 // below.
1206 switch(OpNum) {
1207 case 0: { // eq0
1208 unsigned TempReg = makeAnotherReg(Type::IntTy);
1209 BuildMI(*BB, MI, PPC::CNTLZW, 1, TempReg).addReg(Op0Reg);
1210 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(TempReg).addImm(27)
1211 .addImm(5).addImm(31);
1212 break;
1213 }
1214 case 1: { // ne0
1215 unsigned TempReg = makeAnotherReg(Type::IntTy);
1216 BuildMI(*BB, MI, PPC::ADDIC, 2, TempReg).addReg(Op0Reg).addSImm(-1);
1217 BuildMI(*BB, MI, PPC::SUBFE, 2, DestReg).addReg(TempReg).addReg(Op0Reg);
1218 break;
1219 }
1220 case 2: { // lt0, always false if unsigned
1221 if (Ty->isSigned())
1222 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Op0Reg).addImm(1)
1223 .addImm(31).addImm(31);
1224 else
1225 BuildMI(*BB, MI, PPC::LI, 1, DestReg).addSImm(0);
1226 break;
1227 }
1228 case 3: { // ge0, always true if unsigned
1229 if (Ty->isSigned()) {
1230 unsigned TempReg = makeAnotherReg(Type::IntTy);
1231 BuildMI(*BB, MI, PPC::RLWINM, 4, TempReg).addReg(Op0Reg).addImm(1)
1232 .addImm(31).addImm(31);
1233 BuildMI(*BB, MI, PPC::XORI, 2, DestReg).addReg(TempReg).addImm(1);
1234 } else {
1235 BuildMI(*BB, MI, PPC::LI, 1, DestReg).addSImm(1);
1236 }
1237 break;
1238 }
1239 case 4: { // gt0, equivalent to ne0 if unsigned
1240 unsigned Temp1 = makeAnotherReg(Type::IntTy);
1241 unsigned Temp2 = makeAnotherReg(Type::IntTy);
1242 if (Ty->isSigned()) {
1243 BuildMI(*BB, MI, PPC::NEG, 2, Temp1).addReg(Op0Reg);
1244 BuildMI(*BB, MI, PPC::ANDC, 2, Temp2).addReg(Temp1).addReg(Op0Reg);
1245 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp2).addImm(1)
1246 .addImm(31).addImm(31);
1247 } else {
1248 BuildMI(*BB, MI, PPC::ADDIC, 2, Temp1).addReg(Op0Reg).addSImm(-1);
1249 BuildMI(*BB, MI, PPC::SUBFE, 2, DestReg).addReg(Temp1).addReg(Op0Reg);
1250 }
1251 break;
1252 }
1253 case 5: { // le0, equivalent to eq0 if unsigned
1254 unsigned Temp1 = makeAnotherReg(Type::IntTy);
1255 unsigned Temp2 = makeAnotherReg(Type::IntTy);
1256 if (Ty->isSigned()) {
1257 BuildMI(*BB, MI, PPC::NEG, 2, Temp1).addReg(Op0Reg);
1258 BuildMI(*BB, MI, PPC::ORC, 2, Temp2).addReg(Op0Reg).addReg(Temp1);
1259 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp2).addImm(1)
1260 .addImm(31).addImm(31);
1261 } else {
1262 BuildMI(*BB, MI, PPC::CNTLZW, 1, Temp1).addReg(Op0Reg);
1263 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp1).addImm(27)
1264 .addImm(5).addImm(31);
1265 }
1266 break;
1267 }
1268 } // switch
1269 return;
1270 }
1271 }
Nate Begemanb47321b2004-08-20 09:56:22 +00001272 unsigned PPCOpcode = getPPCOpcodeForSetCCNumber(Opcode);
Nate Begemana96c4af2004-08-21 20:42:14 +00001273
1274 // Create an iterator with which to insert the MBB for copying the false value
1275 // and the MBB to hold the PHI instruction for this SetCC.
Misha Brukman425ff242004-07-01 21:34:10 +00001276 MachineBasicBlock *thisMBB = BB;
1277 const BasicBlock *LLVM_BB = BB->getBasicBlock();
Misha Brukman7e898c32004-07-20 00:41:46 +00001278 ilist<MachineBasicBlock>::iterator It = BB;
1279 ++It;
1280
Misha Brukman425ff242004-07-01 21:34:10 +00001281 // thisMBB:
1282 // ...
1283 // cmpTY cr0, r1, r2
Misha Brukman425ff242004-07-01 21:34:10 +00001284 // %TrueValue = li 1
Nate Begemana96c4af2004-08-21 20:42:14 +00001285 // bCC sinkMBB
Nate Begemana2de1022004-09-22 04:40:25 +00001286 EmitComparison(Opcode, Op0, Op1, BB, BB->end());
Misha Brukmane2eceb52004-07-23 16:08:20 +00001287 unsigned TrueValue = makeAnotherReg(I.getType());
Misha Brukman5b570812004-08-10 22:47:03 +00001288 BuildMI(BB, PPC::LI, 1, TrueValue).addSImm(1);
Nate Begemana96c4af2004-08-21 20:42:14 +00001289 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
1290 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
1291 BuildMI(BB, PPCOpcode, 2).addReg(PPC::CR0).addMBB(sinkMBB);
1292 F->getBasicBlockList().insert(It, copy0MBB);
1293 F->getBasicBlockList().insert(It, sinkMBB);
Misha Brukman425ff242004-07-01 21:34:10 +00001294 // Update machine-CFG edges
Nate Begemana96c4af2004-08-21 20:42:14 +00001295 BB->addSuccessor(copy0MBB);
Misha Brukman425ff242004-07-01 21:34:10 +00001296 BB->addSuccessor(sinkMBB);
1297
Misha Brukman1013ef52004-07-21 20:09:08 +00001298 // copy0MBB:
1299 // %FalseValue = li 0
1300 // fallthrough
1301 BB = copy0MBB;
1302 unsigned FalseValue = makeAnotherReg(I.getType());
Misha Brukman5b570812004-08-10 22:47:03 +00001303 BuildMI(BB, PPC::LI, 1, FalseValue).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00001304 // Update machine-CFG edges
1305 BB->addSuccessor(sinkMBB);
1306
Misha Brukman425ff242004-07-01 21:34:10 +00001307 // sinkMBB:
Nate Begemana96c4af2004-08-21 20:42:14 +00001308 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
Misha Brukman425ff242004-07-01 21:34:10 +00001309 // ...
1310 BB = sinkMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00001311 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(FalseValue)
Nate Begemana96c4af2004-08-21 20:42:14 +00001312 .addMBB(copy0MBB).addReg(TrueValue).addMBB(thisMBB);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001313}
1314
Misha Brukmana1dca552004-09-21 18:22:19 +00001315void PPC32ISel::visitSelectInst(SelectInst &SI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001316 unsigned DestReg = getReg(SI);
1317 MachineBasicBlock::iterator MII = BB->end();
Misha Brukman2fec9902004-06-21 20:22:03 +00001318 emitSelectOperation(BB, MII, SI.getCondition(), SI.getTrueValue(),
1319 SI.getFalseValue(), DestReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001320}
1321
1322/// emitSelect - Common code shared between visitSelectInst and the constant
1323/// expression support.
Misha Brukmana1dca552004-09-21 18:22:19 +00001324void PPC32ISel::emitSelectOperation(MachineBasicBlock *MBB,
1325 MachineBasicBlock::iterator IP,
1326 Value *Cond, Value *TrueVal,
1327 Value *FalseVal, unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001328 unsigned SelectClass = getClassB(TrueVal->getType());
Misha Brukman7e898c32004-07-20 00:41:46 +00001329 unsigned Opcode;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001330
Misha Brukmanbebde752004-07-16 21:06:24 +00001331 // See if we can fold the setcc into the select instruction, or if we have
1332 // to get the register of the Cond value
Misha Brukmanbebde752004-07-16 21:06:24 +00001333 if (SetCondInst *SCI = canFoldSetCCIntoBranchOrSelect(Cond)) {
1334 // We successfully folded the setcc into the select instruction.
Misha Brukmanbebde752004-07-16 21:06:24 +00001335 unsigned OpNum = getSetCCNumber(SCI->getOpcode());
Nate Begeman087d5d92004-10-06 09:53:04 +00001336 if (OpNum >= 2 && OpNum <= 5) {
1337 unsigned SetCondClass = getClassB(SCI->getOperand(0)->getType());
1338 if ((SetCondClass == cFP32 || SetCondClass == cFP64) &&
1339 (SelectClass == cFP32 || SelectClass == cFP64)) {
1340 unsigned CondReg = getReg(SCI->getOperand(0), MBB, IP);
1341 unsigned TrueReg = getReg(TrueVal, MBB, IP);
1342 unsigned FalseReg = getReg(FalseVal, MBB, IP);
1343 // if the comparison of the floating point value used to for the select
1344 // is against 0, then we can emit an fsel without subtraction.
1345 ConstantFP *Op1C = dyn_cast<ConstantFP>(SCI->getOperand(1));
1346 if (Op1C && (Op1C->isExactlyValue(-0.0) || Op1C->isExactlyValue(0.0))) {
1347 switch(OpNum) {
1348 case 2: // LT
1349 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(CondReg)
1350 .addReg(FalseReg).addReg(TrueReg);
1351 break;
1352 case 3: // GE == !LT
1353 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(CondReg)
1354 .addReg(TrueReg).addReg(FalseReg);
1355 break;
1356 case 4: { // GT
1357 unsigned NegatedReg = makeAnotherReg(SCI->getOperand(0)->getType());
1358 BuildMI(*MBB, IP, PPC::FNEG, 1, NegatedReg).addReg(CondReg);
1359 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(NegatedReg)
1360 .addReg(FalseReg).addReg(TrueReg);
1361 }
1362 break;
1363 case 5: { // LE == !GT
1364 unsigned NegatedReg = makeAnotherReg(SCI->getOperand(0)->getType());
1365 BuildMI(*MBB, IP, PPC::FNEG, 1, NegatedReg).addReg(CondReg);
1366 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(NegatedReg)
1367 .addReg(TrueReg).addReg(FalseReg);
1368 }
1369 break;
1370 default:
1371 assert(0 && "Invalid SetCC opcode to fsel");
1372 abort();
1373 break;
1374 }
1375 } else {
1376 unsigned OtherCondReg = getReg(SCI->getOperand(1), MBB, IP);
1377 unsigned SelectReg = makeAnotherReg(SCI->getOperand(0)->getType());
1378 switch(OpNum) {
1379 case 2: // LT
1380 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(CondReg)
1381 .addReg(OtherCondReg);
1382 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1383 .addReg(FalseReg).addReg(TrueReg);
1384 break;
1385 case 3: // GE == !LT
1386 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(CondReg)
1387 .addReg(OtherCondReg);
1388 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1389 .addReg(TrueReg).addReg(FalseReg);
1390 break;
1391 case 4: // GT
1392 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(OtherCondReg)
1393 .addReg(CondReg);
1394 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1395 .addReg(FalseReg).addReg(TrueReg);
1396 break;
1397 case 5: // LE == !GT
1398 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(OtherCondReg)
1399 .addReg(CondReg);
1400 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1401 .addReg(TrueReg).addReg(FalseReg);
1402 break;
1403 default:
1404 assert(0 && "Invalid SetCC opcode to fsel");
1405 abort();
1406 break;
1407 }
1408 }
Nate Begeman087d5d92004-10-06 09:53:04 +00001409 return;
1410 }
1411 }
Misha Brukman47225442004-07-23 22:35:49 +00001412 OpNum = EmitComparison(OpNum, SCI->getOperand(0),SCI->getOperand(1),MBB,IP);
Misha Brukmanbebde752004-07-16 21:06:24 +00001413 Opcode = getPPCOpcodeForSetCCNumber(SCI->getOpcode());
1414 } else {
1415 unsigned CondReg = getReg(Cond, MBB, IP);
Nate Begemaned428532004-09-04 05:00:00 +00001416 BuildMI(*MBB, IP, PPC::CMPWI, 2, PPC::CR0).addReg(CondReg).addSImm(0);
Misha Brukmanbebde752004-07-16 21:06:24 +00001417 Opcode = getPPCOpcodeForSetCCNumber(Instruction::SetNE);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001418 }
Misha Brukmanbebde752004-07-16 21:06:24 +00001419
1420 MachineBasicBlock *thisMBB = BB;
1421 const BasicBlock *LLVM_BB = BB->getBasicBlock();
Misha Brukman7e898c32004-07-20 00:41:46 +00001422 ilist<MachineBasicBlock>::iterator It = BB;
1423 ++It;
Misha Brukmanbebde752004-07-16 21:06:24 +00001424
Nate Begemana96c4af2004-08-21 20:42:14 +00001425 // thisMBB:
1426 // ...
1427 // cmpTY cr0, r1, r2
Nate Begeman1f49e862004-09-29 05:00:31 +00001428 // bCC copy1MBB
1429 // fallthrough --> copy0MBB
Misha Brukmanbebde752004-07-16 21:06:24 +00001430 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
Nate Begeman1f49e862004-09-29 05:00:31 +00001431 MachineBasicBlock *copy1MBB = new MachineBasicBlock(LLVM_BB);
Misha Brukman1013ef52004-07-21 20:09:08 +00001432 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
Nate Begeman1f49e862004-09-29 05:00:31 +00001433 BuildMI(BB, Opcode, 2).addReg(PPC::CR0).addMBB(copy1MBB);
Nate Begemana96c4af2004-08-21 20:42:14 +00001434 F->getBasicBlockList().insert(It, copy0MBB);
Nate Begeman1f49e862004-09-29 05:00:31 +00001435 F->getBasicBlockList().insert(It, copy1MBB);
Misha Brukman1013ef52004-07-21 20:09:08 +00001436 F->getBasicBlockList().insert(It, sinkMBB);
Misha Brukmanbebde752004-07-16 21:06:24 +00001437 // Update machine-CFG edges
Misha Brukmanbebde752004-07-16 21:06:24 +00001438 BB->addSuccessor(copy0MBB);
Nate Begeman1f49e862004-09-29 05:00:31 +00001439 BB->addSuccessor(copy1MBB);
Misha Brukmanbebde752004-07-16 21:06:24 +00001440
Misha Brukman1013ef52004-07-21 20:09:08 +00001441 // copy0MBB:
1442 // %FalseValue = ...
Nate Begeman1f49e862004-09-29 05:00:31 +00001443 // b sinkMBB
Misha Brukman1013ef52004-07-21 20:09:08 +00001444 BB = copy0MBB;
1445 unsigned FalseValue = getReg(FalseVal, BB, BB->begin());
Nate Begeman1f49e862004-09-29 05:00:31 +00001446 BuildMI(BB, PPC::B, 1).addMBB(sinkMBB);
1447 // Update machine-CFG edges
1448 BB->addSuccessor(sinkMBB);
1449
1450 // copy1MBB:
1451 // %TrueValue = ...
1452 // fallthrough
1453 BB = copy1MBB;
1454 unsigned TrueValue = getReg(TrueVal, BB, BB->begin());
Misha Brukman1013ef52004-07-21 20:09:08 +00001455 // Update machine-CFG edges
1456 BB->addSuccessor(sinkMBB);
1457
Misha Brukmanbebde752004-07-16 21:06:24 +00001458 // sinkMBB:
Nate Begemana96c4af2004-08-21 20:42:14 +00001459 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
Misha Brukmanbebde752004-07-16 21:06:24 +00001460 // ...
1461 BB = sinkMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00001462 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(FalseValue)
Nate Begeman1f49e862004-09-29 05:00:31 +00001463 .addMBB(copy0MBB).addReg(TrueValue).addMBB(copy1MBB);
Nate Begemana96c4af2004-08-21 20:42:14 +00001464
Misha Brukmana31f1f72004-07-21 20:30:18 +00001465 // For a register pair representing a long value, define the second reg
Nate Begemana96c4af2004-08-21 20:42:14 +00001466 // FIXME: Can this really be correct for selecting longs?
Nate Begeman8d963e62004-08-11 03:30:55 +00001467 if (getClassB(TrueVal->getType()) == cLong)
Misha Brukman5b570812004-08-10 22:47:03 +00001468 BuildMI(BB, PPC::LI, 1, DestReg+1).addImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001469 return;
1470}
1471
1472
1473
1474/// promote32 - Emit instructions to turn a narrow operand into a 32-bit-wide
1475/// operand, in the specified target register.
1476///
Misha Brukmana1dca552004-09-21 18:22:19 +00001477void PPC32ISel::promote32(unsigned targetReg, const ValueRecord &VR) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001478 bool isUnsigned = VR.Ty->isUnsigned() || VR.Ty == Type::BoolTy;
1479
1480 Value *Val = VR.Val;
1481 const Type *Ty = VR.Ty;
1482 if (Val) {
1483 if (Constant *C = dyn_cast<Constant>(Val)) {
1484 Val = ConstantExpr::getCast(C, Type::IntTy);
Chris Lattner74a806c2004-08-11 07:34:50 +00001485 if (isa<ConstantExpr>(Val)) // Could not fold
1486 Val = C;
1487 else
1488 Ty = Type::IntTy; // Folded!
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001489 }
1490
Misha Brukman2fec9902004-06-21 20:22:03 +00001491 // If this is a simple constant, just emit a load directly to avoid the copy
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001492 if (ConstantInt *CI = dyn_cast<ConstantInt>(Val)) {
1493 int TheVal = CI->getRawValue() & 0xFFFFFFFF;
1494
1495 if (TheVal < 32768 && TheVal >= -32768) {
Misha Brukman5b570812004-08-10 22:47:03 +00001496 BuildMI(BB, PPC::LI, 1, targetReg).addSImm(TheVal);
Misha Brukman422791f2004-06-21 17:41:12 +00001497 } else {
1498 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00001499 BuildMI(BB, PPC::LIS, 1, TmpReg).addSImm(TheVal >> 16);
1500 BuildMI(BB, PPC::ORI, 2, targetReg).addReg(TmpReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00001501 .addImm(TheVal & 0xFFFF);
Misha Brukman422791f2004-06-21 17:41:12 +00001502 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001503 return;
1504 }
1505 }
1506
1507 // Make sure we have the register number for this value...
1508 unsigned Reg = Val ? getReg(Val) : VR.Reg;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001509 switch (getClassB(Ty)) {
1510 case cByte:
1511 // Extend value into target register (8->32)
Nate Begeman1b99fd32004-09-29 03:45:33 +00001512 if (Ty == Type::BoolTy)
1513 BuildMI(BB, PPC::OR, 2, targetReg).addReg(Reg).addReg(Reg);
1514 else if (isUnsigned)
Misha Brukman5b570812004-08-10 22:47:03 +00001515 BuildMI(BB, PPC::RLWINM, 4, targetReg).addReg(Reg).addZImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00001516 .addZImm(24).addZImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001517 else
Misha Brukman5b570812004-08-10 22:47:03 +00001518 BuildMI(BB, PPC::EXTSB, 1, targetReg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001519 break;
1520 case cShort:
1521 // Extend value into target register (16->32)
1522 if (isUnsigned)
Misha Brukman5b570812004-08-10 22:47:03 +00001523 BuildMI(BB, PPC::RLWINM, 4, targetReg).addReg(Reg).addZImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00001524 .addZImm(16).addZImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001525 else
Misha Brukman5b570812004-08-10 22:47:03 +00001526 BuildMI(BB, PPC::EXTSH, 1, targetReg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001527 break;
1528 case cInt:
1529 // Move value into target register (32->32)
Misha Brukman5b570812004-08-10 22:47:03 +00001530 BuildMI(BB, PPC::OR, 2, targetReg).addReg(Reg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001531 break;
1532 default:
1533 assert(0 && "Unpromotable operand class in promote32");
1534 }
1535}
1536
Misha Brukman2fec9902004-06-21 20:22:03 +00001537/// visitReturnInst - implemented with BLR
1538///
Misha Brukmana1dca552004-09-21 18:22:19 +00001539void PPC32ISel::visitReturnInst(ReturnInst &I) {
Misha Brukmand47bbf72004-06-25 19:04:27 +00001540 // Only do the processing if this is a non-void return
1541 if (I.getNumOperands() > 0) {
1542 Value *RetVal = I.getOperand(0);
1543 switch (getClassB(RetVal->getType())) {
1544 case cByte: // integral return values: extend or move into r3 and return
1545 case cShort:
1546 case cInt:
Misha Brukman5b570812004-08-10 22:47:03 +00001547 promote32(PPC::R3, ValueRecord(RetVal));
Misha Brukmand47bbf72004-06-25 19:04:27 +00001548 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001549 case cFP32:
1550 case cFP64: { // Floats & Doubles: Return in f1
Misha Brukmand47bbf72004-06-25 19:04:27 +00001551 unsigned RetReg = getReg(RetVal);
Misha Brukman5b570812004-08-10 22:47:03 +00001552 BuildMI(BB, PPC::FMR, 1, PPC::F1).addReg(RetReg);
Misha Brukmand47bbf72004-06-25 19:04:27 +00001553 break;
1554 }
1555 case cLong: {
1556 unsigned RetReg = getReg(RetVal);
Misha Brukman5b570812004-08-10 22:47:03 +00001557 BuildMI(BB, PPC::OR, 2, PPC::R3).addReg(RetReg).addReg(RetReg);
1558 BuildMI(BB, PPC::OR, 2, PPC::R4).addReg(RetReg+1).addReg(RetReg+1);
Misha Brukmand47bbf72004-06-25 19:04:27 +00001559 break;
1560 }
1561 default:
1562 visitInstruction(I);
1563 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001564 }
Misha Brukman5b570812004-08-10 22:47:03 +00001565 BuildMI(BB, PPC::BLR, 1).addImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001566}
1567
1568// getBlockAfter - Return the basic block which occurs lexically after the
1569// specified one.
1570static inline BasicBlock *getBlockAfter(BasicBlock *BB) {
1571 Function::iterator I = BB; ++I; // Get iterator to next block
1572 return I != BB->getParent()->end() ? &*I : 0;
1573}
1574
1575/// visitBranchInst - Handle conditional and unconditional branches here. Note
1576/// that since code layout is frozen at this point, that if we are trying to
1577/// jump to a block that is the immediate successor of the current block, we can
1578/// just make a fall-through (but we don't currently).
1579///
Misha Brukmana1dca552004-09-21 18:22:19 +00001580void PPC32ISel::visitBranchInst(BranchInst &BI) {
Misha Brukman2fec9902004-06-21 20:22:03 +00001581 // Update machine-CFG edges
Misha Brukmane2eceb52004-07-23 16:08:20 +00001582 BB->addSuccessor(MBBMap[BI.getSuccessor(0)]);
Misha Brukman2fec9902004-06-21 20:22:03 +00001583 if (BI.isConditional())
Misha Brukmane2eceb52004-07-23 16:08:20 +00001584 BB->addSuccessor(MBBMap[BI.getSuccessor(1)]);
Misha Brukman2fec9902004-06-21 20:22:03 +00001585
1586 BasicBlock *NextBB = getBlockAfter(BI.getParent()); // BB after current one
Misha Brukmane9c65512004-07-06 15:32:44 +00001587
Misha Brukman2fec9902004-06-21 20:22:03 +00001588 if (!BI.isConditional()) { // Unconditional branch?
Misha Brukmane9c65512004-07-06 15:32:44 +00001589 if (BI.getSuccessor(0) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001590 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001591 return;
Misha Brukman2fec9902004-06-21 20:22:03 +00001592 }
1593
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001594 // See if we can fold the setcc into the branch itself...
1595 SetCondInst *SCI = canFoldSetCCIntoBranchOrSelect(BI.getCondition());
1596 if (SCI == 0) {
1597 // Nope, cannot fold setcc into this branch. Emit a branch on a condition
1598 // computed some other way...
1599 unsigned condReg = getReg(BI.getCondition());
Misha Brukman5b570812004-08-10 22:47:03 +00001600 BuildMI(BB, PPC::CMPLI, 3, PPC::CR0).addImm(0).addReg(condReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00001601 .addImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001602 if (BI.getSuccessor(1) == NextBB) {
1603 if (BI.getSuccessor(0) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001604 BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(PPC::BNE)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001605 .addMBB(MBBMap[BI.getSuccessor(0)])
1606 .addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001607 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00001608 BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(PPC::BEQ)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001609 .addMBB(MBBMap[BI.getSuccessor(1)])
1610 .addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001611 if (BI.getSuccessor(0) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001612 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001613 }
1614 return;
1615 }
1616
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001617 unsigned OpNum = getSetCCNumber(SCI->getOpcode());
Misha Brukmane9c65512004-07-06 15:32:44 +00001618 unsigned Opcode = getPPCOpcodeForSetCCNumber(SCI->getOpcode());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001619 MachineBasicBlock::iterator MII = BB->end();
1620 OpNum = EmitComparison(OpNum, SCI->getOperand(0), SCI->getOperand(1), BB,MII);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001621
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001622 if (BI.getSuccessor(0) != NextBB) {
Misha Brukman5b570812004-08-10 22:47:03 +00001623 BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(Opcode)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001624 .addMBB(MBBMap[BI.getSuccessor(0)])
1625 .addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001626 if (BI.getSuccessor(1) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001627 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001628 } else {
1629 // Change to the inverse condition...
1630 if (BI.getSuccessor(1) != NextBB) {
Misha Brukmanf2ccb772004-08-17 04:55:41 +00001631 Opcode = PPC32InstrInfo::invertPPCBranchOpcode(Opcode);
Misha Brukman5b570812004-08-10 22:47:03 +00001632 BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(Opcode)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001633 .addMBB(MBBMap[BI.getSuccessor(1)])
1634 .addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001635 }
1636 }
1637}
1638
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001639/// doCall - This emits an abstract call instruction, setting up the arguments
1640/// and the return value as appropriate. For the actual function call itself,
1641/// it inserts the specified CallMI instruction into the stream.
1642///
1643/// FIXME: See Documentation at the following URL for "correct" behavior
1644/// <http://developer.apple.com/documentation/DeveloperTools/Conceptual/MachORuntime/2rt_powerpc_abi/chapter_9_section_5.html>
Misha Brukmana1dca552004-09-21 18:22:19 +00001645void PPC32ISel::doCall(const ValueRecord &Ret, MachineInstr *CallMI,
1646 const std::vector<ValueRecord> &Args, bool isVarArg) {
Chris Lattner3ea93462004-08-06 06:58:50 +00001647 // Count how many bytes are to be pushed on the stack, including the linkage
1648 // area, and parameter passing area.
1649 unsigned NumBytes = 24;
1650 unsigned ArgOffset = 24;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001651
1652 if (!Args.empty()) {
1653 for (unsigned i = 0, e = Args.size(); i != e; ++i)
1654 switch (getClassB(Args[i].Ty)) {
1655 case cByte: case cShort: case cInt:
1656 NumBytes += 4; break;
1657 case cLong:
1658 NumBytes += 8; break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001659 case cFP32:
1660 NumBytes += 4; break;
1661 case cFP64:
1662 NumBytes += 8; break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001663 break;
1664 default: assert(0 && "Unknown class!");
1665 }
1666
Nate Begeman865075e2004-08-16 01:50:22 +00001667 // Just to be safe, we'll always reserve the full 24 bytes of linkage area
1668 // plus 32 bytes of argument space in case any called code gets funky on us.
1669 if (NumBytes < 56) NumBytes = 56;
Chris Lattner3ea93462004-08-06 06:58:50 +00001670
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001671 // Adjust the stack pointer for the new arguments...
Chris Lattner3ea93462004-08-06 06:58:50 +00001672 // These functions are automatically eliminated by the prolog/epilog pass
Misha Brukman5b570812004-08-10 22:47:03 +00001673 BuildMI(BB, PPC::ADJCALLSTACKDOWN, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001674
1675 // Arguments go on the stack in reverse order, as specified by the ABI.
Misha Brukman7e898c32004-07-20 00:41:46 +00001676 // Offset to the paramater area on the stack is 24.
Misha Brukmand18a31d2004-07-06 22:51:53 +00001677 int GPR_remaining = 8, FPR_remaining = 13;
Misha Brukmanfc879c32004-07-08 18:02:38 +00001678 unsigned GPR_idx = 0, FPR_idx = 0;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001679 static const unsigned GPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00001680 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
1681 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001682 };
Misha Brukmand18a31d2004-07-06 22:51:53 +00001683 static const unsigned FPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00001684 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6,
1685 PPC::F7, PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12,
1686 PPC::F13
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001687 };
Misha Brukman422791f2004-06-21 17:41:12 +00001688
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001689 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
1690 unsigned ArgReg;
1691 switch (getClassB(Args[i].Ty)) {
1692 case cByte:
1693 case cShort:
1694 // Promote arg to 32 bits wide into a temporary register...
1695 ArgReg = makeAnotherReg(Type::UIntTy);
1696 promote32(ArgReg, Args[i]);
Misha Brukman422791f2004-06-21 17:41:12 +00001697
1698 // Reg or stack?
1699 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001700 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001701 .addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001702 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001703 }
1704 if (GPR_remaining <= 0 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001705 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1706 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001707 }
1708 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001709 case cInt:
1710 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
1711
Misha Brukman422791f2004-06-21 17:41:12 +00001712 // Reg or stack?
1713 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001714 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001715 .addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001716 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001717 }
1718 if (GPR_remaining <= 0 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001719 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1720 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001721 }
1722 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001723 case cLong:
Misha Brukman422791f2004-06-21 17:41:12 +00001724 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001725
Misha Brukmanec6319a2004-07-20 15:51:37 +00001726 // Reg or stack? Note that PPC calling conventions state that long args
1727 // are passed rN = hi, rN+1 = lo, opposite of LLVM.
Misha Brukman422791f2004-06-21 17:41:12 +00001728 if (GPR_remaining > 1) {
Misha Brukman5b570812004-08-10 22:47:03 +00001729 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanec6319a2004-07-20 15:51:37 +00001730 .addReg(ArgReg);
Misha Brukman5b570812004-08-10 22:47:03 +00001731 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx+1]).addReg(ArgReg+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001732 .addReg(ArgReg+1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001733 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1734 CallMI->addRegOperand(GPR[GPR_idx+1], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001735 }
1736 if (GPR_remaining <= 1 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001737 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1738 .addReg(PPC::R1);
1739 BuildMI(BB, PPC::STW, 3).addReg(ArgReg+1).addSImm(ArgOffset+4)
1740 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001741 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001742
1743 ArgOffset += 4; // 8 byte entry, not 4.
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001744 GPR_remaining -= 1; // uses up 2 GPRs
1745 GPR_idx += 1;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001746 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001747 case cFP32:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001748 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
Misha Brukman7e898c32004-07-20 00:41:46 +00001749 // Reg or stack?
1750 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001751 BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001752 CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use);
1753 FPR_remaining--;
1754 FPR_idx++;
1755
1756 // If this is a vararg function, and there are GPRs left, also
1757 // pass the float in an int. Otherwise, put it on the stack.
1758 if (isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001759 BuildMI(BB, PPC::STFS, 3).addReg(ArgReg).addSImm(ArgOffset)
1760 .addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001761 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001762 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx])
Nate Begeman293d88c2004-08-13 04:45:14 +00001763 .addSImm(ArgOffset).addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001764 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1765 }
Misha Brukman1916bf92004-06-24 21:56:15 +00001766 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001767 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00001768 BuildMI(BB, PPC::STFS, 3).addReg(ArgReg).addSImm(ArgOffset)
1769 .addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001770 }
1771 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001772 case cFP64:
1773 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
1774 // Reg or stack?
1775 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001776 BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001777 CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use);
1778 FPR_remaining--;
1779 FPR_idx++;
1780 // For vararg functions, must pass doubles via int regs as well
1781 if (isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001782 BuildMI(BB, PPC::STFD, 3).addReg(ArgReg).addSImm(ArgOffset)
1783 .addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001784
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001785 // Doubles can be split across reg + stack for varargs
1786 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001787 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx]).addSImm(ArgOffset)
1788 .addReg(PPC::R1);
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001789 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1790 }
1791 if (GPR_remaining > 1) {
Misha Brukman5b570812004-08-10 22:47:03 +00001792 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx+1])
1793 .addSImm(ArgOffset+4).addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001794 CallMI->addRegOperand(GPR[GPR_idx+1], MachineOperand::Use);
1795 }
1796 }
1797 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00001798 BuildMI(BB, PPC::STFD, 3).addReg(ArgReg).addSImm(ArgOffset)
1799 .addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001800 }
1801 // Doubles use 8 bytes, and 2 GPRs worth of param space
1802 ArgOffset += 4;
1803 GPR_remaining--;
1804 GPR_idx++;
1805 break;
1806
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001807 default: assert(0 && "Unknown class!");
1808 }
1809 ArgOffset += 4;
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001810 GPR_remaining--;
1811 GPR_idx++;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001812 }
1813 } else {
Nate Begeman865075e2004-08-16 01:50:22 +00001814 BuildMI(BB, PPC::ADJCALLSTACKDOWN, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001815 }
Nate Begeman43d64ea2004-08-15 06:42:28 +00001816
Misha Brukman5b570812004-08-10 22:47:03 +00001817 BuildMI(BB, PPC::IMPLICIT_DEF, 0, PPC::LR);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001818 BB->push_back(CallMI);
Chris Lattner3ea93462004-08-06 06:58:50 +00001819
1820 // These functions are automatically eliminated by the prolog/epilog pass
Misha Brukman5b570812004-08-10 22:47:03 +00001821 BuildMI(BB, PPC::ADJCALLSTACKUP, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001822
1823 // If there is a return value, scavenge the result from the location the call
1824 // leaves it in...
1825 //
1826 if (Ret.Ty != Type::VoidTy) {
1827 unsigned DestClass = getClassB(Ret.Ty);
1828 switch (DestClass) {
1829 case cByte:
1830 case cShort:
1831 case cInt:
1832 // Integral results are in r3
Misha Brukman5b570812004-08-10 22:47:03 +00001833 BuildMI(BB, PPC::OR, 2, Ret.Reg).addReg(PPC::R3).addReg(PPC::R3);
Misha Brukmane327e492004-06-24 23:53:24 +00001834 break;
Chris Lattner3ea93462004-08-06 06:58:50 +00001835 case cFP32: // Floating-point return values live in f1
Misha Brukman7e898c32004-07-20 00:41:46 +00001836 case cFP64:
Misha Brukman5b570812004-08-10 22:47:03 +00001837 BuildMI(BB, PPC::FMR, 1, Ret.Reg).addReg(PPC::F1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001838 break;
Chris Lattner3ea93462004-08-06 06:58:50 +00001839 case cLong: // Long values are in r3:r4
Misha Brukman5b570812004-08-10 22:47:03 +00001840 BuildMI(BB, PPC::OR, 2, Ret.Reg).addReg(PPC::R3).addReg(PPC::R3);
1841 BuildMI(BB, PPC::OR, 2, Ret.Reg+1).addReg(PPC::R4).addReg(PPC::R4);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001842 break;
1843 default: assert(0 && "Unknown class!");
1844 }
1845 }
1846}
1847
1848
1849/// visitCallInst - Push args on stack and do a procedure call instruction.
Misha Brukmana1dca552004-09-21 18:22:19 +00001850void PPC32ISel::visitCallInst(CallInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001851 MachineInstr *TheCall;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001852 Function *F = CI.getCalledFunction();
1853 if (F) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001854 // Is it an intrinsic function call?
1855 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID()) {
1856 visitIntrinsicCall(ID, CI); // Special intrinsics are not handled here
1857 return;
1858 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001859 // Emit a CALL instruction with PC-relative displacement.
Misha Brukman5b570812004-08-10 22:47:03 +00001860 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(F, true);
Misha Brukmane2eceb52004-07-23 16:08:20 +00001861 // Add it to the set of functions called to be used by the Printer
1862 TM.CalledFunctions.insert(F);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001863 } else { // Emit an indirect call through the CTR
1864 unsigned Reg = getReg(CI.getCalledValue());
Nate Begeman43d64ea2004-08-15 06:42:28 +00001865 BuildMI(BB, PPC::OR, 2, PPC::R12).addReg(Reg).addReg(Reg);
1866 BuildMI(BB, PPC::MTCTR, 1).addReg(PPC::R12);
1867 TheCall = BuildMI(PPC::CALLindirect, 2).addZImm(20).addZImm(0)
1868 .addReg(PPC::R12);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001869 }
1870
1871 std::vector<ValueRecord> Args;
1872 for (unsigned i = 1, e = CI.getNumOperands(); i != e; ++i)
1873 Args.push_back(ValueRecord(CI.getOperand(i)));
1874
1875 unsigned DestReg = CI.getType() != Type::VoidTy ? getReg(CI) : 0;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001876 bool isVarArg = F ? F->getFunctionType()->isVarArg() : true;
1877 doCall(ValueRecord(DestReg, CI.getType()), TheCall, Args, isVarArg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001878}
1879
1880
1881/// dyncastIsNan - Return the operand of an isnan operation if this is an isnan.
1882///
1883static Value *dyncastIsNan(Value *V) {
1884 if (CallInst *CI = dyn_cast<CallInst>(V))
1885 if (Function *F = CI->getCalledFunction())
Misha Brukmana2916ce2004-06-21 17:58:36 +00001886 if (F->getIntrinsicID() == Intrinsic::isunordered)
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001887 return CI->getOperand(1);
1888 return 0;
1889}
1890
1891/// isOnlyUsedByUnorderedComparisons - Return true if this value is only used by
1892/// or's whos operands are all calls to the isnan predicate.
1893static bool isOnlyUsedByUnorderedComparisons(Value *V) {
1894 assert(dyncastIsNan(V) && "The value isn't an isnan call!");
1895
1896 // Check all uses, which will be or's of isnans if this predicate is true.
1897 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;++UI){
1898 Instruction *I = cast<Instruction>(*UI);
1899 if (I->getOpcode() != Instruction::Or) return false;
1900 if (I->getOperand(0) != V && !dyncastIsNan(I->getOperand(0))) return false;
1901 if (I->getOperand(1) != V && !dyncastIsNan(I->getOperand(1))) return false;
1902 }
1903
1904 return true;
1905}
1906
1907/// LowerUnknownIntrinsicFunctionCalls - This performs a prepass over the
1908/// function, lowering any calls to unknown intrinsic functions into the
1909/// equivalent LLVM code.
1910///
Misha Brukmana1dca552004-09-21 18:22:19 +00001911void PPC32ISel::LowerUnknownIntrinsicFunctionCalls(Function &F) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001912 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
1913 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
1914 if (CallInst *CI = dyn_cast<CallInst>(I++))
1915 if (Function *F = CI->getCalledFunction())
1916 switch (F->getIntrinsicID()) {
1917 case Intrinsic::not_intrinsic:
1918 case Intrinsic::vastart:
1919 case Intrinsic::vacopy:
1920 case Intrinsic::vaend:
1921 case Intrinsic::returnaddress:
1922 case Intrinsic::frameaddress:
Misha Brukmanb097f212004-07-26 18:13:24 +00001923 // FIXME: should lower these ourselves
Misha Brukmana2916ce2004-06-21 17:58:36 +00001924 // case Intrinsic::isunordered:
Misha Brukmanb097f212004-07-26 18:13:24 +00001925 // case Intrinsic::memcpy: -> doCall(). system memcpy almost
1926 // guaranteed to be faster than anything we generate ourselves
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001927 // We directly implement these intrinsics
1928 break;
1929 case Intrinsic::readio: {
1930 // On PPC, memory operations are in-order. Lower this intrinsic
1931 // into a volatile load.
1932 Instruction *Before = CI->getPrev();
1933 LoadInst * LI = new LoadInst(CI->getOperand(1), "", true, CI);
1934 CI->replaceAllUsesWith(LI);
1935 BB->getInstList().erase(CI);
1936 break;
1937 }
1938 case Intrinsic::writeio: {
1939 // On PPC, memory operations are in-order. Lower this intrinsic
1940 // into a volatile store.
1941 Instruction *Before = CI->getPrev();
Misha Brukman8d442c22004-07-14 15:29:51 +00001942 StoreInst *SI = new StoreInst(CI->getOperand(1),
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001943 CI->getOperand(2), true, CI);
Misha Brukman8d442c22004-07-14 15:29:51 +00001944 CI->replaceAllUsesWith(SI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001945 BB->getInstList().erase(CI);
1946 break;
1947 }
1948 default:
1949 // All other intrinsic calls we must lower.
1950 Instruction *Before = CI->getPrev();
1951 TM.getIntrinsicLowering().LowerIntrinsicCall(CI);
1952 if (Before) { // Move iterator to instruction after call
1953 I = Before; ++I;
1954 } else {
1955 I = BB->begin();
1956 }
1957 }
1958}
1959
Misha Brukmana1dca552004-09-21 18:22:19 +00001960void PPC32ISel::visitIntrinsicCall(Intrinsic::ID ID, CallInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001961 unsigned TmpReg1, TmpReg2, TmpReg3;
1962 switch (ID) {
1963 case Intrinsic::vastart:
1964 // Get the address of the first vararg value...
1965 TmpReg1 = getReg(CI);
Misha Brukman5b570812004-08-10 22:47:03 +00001966 addFrameReference(BuildMI(BB, PPC::ADDI, 2, TmpReg1), VarArgsFrameIndex,
Misha Brukmanec6319a2004-07-20 15:51:37 +00001967 0, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001968 return;
1969
1970 case Intrinsic::vacopy:
1971 TmpReg1 = getReg(CI);
1972 TmpReg2 = getReg(CI.getOperand(1));
Misha Brukman5b570812004-08-10 22:47:03 +00001973 BuildMI(BB, PPC::OR, 2, TmpReg1).addReg(TmpReg2).addReg(TmpReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001974 return;
1975 case Intrinsic::vaend: return;
1976
1977 case Intrinsic::returnaddress:
Misha Brukmanec6319a2004-07-20 15:51:37 +00001978 TmpReg1 = getReg(CI);
1979 if (cast<Constant>(CI.getOperand(1))->isNullValue()) {
1980 MachineFrameInfo *MFI = F->getFrameInfo();
1981 unsigned NumBytes = MFI->getStackSize();
1982
Misha Brukman5b570812004-08-10 22:47:03 +00001983 BuildMI(BB, PPC::LWZ, 2, TmpReg1).addSImm(NumBytes+8)
1984 .addReg(PPC::R1);
Misha Brukmanec6319a2004-07-20 15:51:37 +00001985 } else {
1986 // Values other than zero are not implemented yet.
Misha Brukman5b570812004-08-10 22:47:03 +00001987 BuildMI(BB, PPC::LI, 1, TmpReg1).addSImm(0);
Misha Brukmanec6319a2004-07-20 15:51:37 +00001988 }
1989 return;
1990
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001991 case Intrinsic::frameaddress:
1992 TmpReg1 = getReg(CI);
1993 if (cast<Constant>(CI.getOperand(1))->isNullValue()) {
Misha Brukman5b570812004-08-10 22:47:03 +00001994 BuildMI(BB, PPC::OR, 2, TmpReg1).addReg(PPC::R1).addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001995 } else {
1996 // Values other than zero are not implemented yet.
Misha Brukman5b570812004-08-10 22:47:03 +00001997 BuildMI(BB, PPC::LI, 1, TmpReg1).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001998 }
1999 return;
Misha Brukmanb097f212004-07-26 18:13:24 +00002000
Misha Brukmana2916ce2004-06-21 17:58:36 +00002001#if 0
2002 // This may be useful for supporting isunordered
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002003 case Intrinsic::isnan:
2004 // If this is only used by 'isunordered' style comparisons, don't emit it.
2005 if (isOnlyUsedByUnorderedComparisons(&CI)) return;
2006 TmpReg1 = getReg(CI.getOperand(1));
2007 emitUCOM(BB, BB->end(), TmpReg1, TmpReg1);
Misha Brukman422791f2004-06-21 17:41:12 +00002008 TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00002009 BuildMI(BB, PPC::MFCR, TmpReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002010 TmpReg3 = getReg(CI);
Misha Brukman5b570812004-08-10 22:47:03 +00002011 BuildMI(BB, PPC::RLWINM, 4, TmpReg3).addReg(TmpReg2).addImm(4).addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002012 return;
Misha Brukmana2916ce2004-06-21 17:58:36 +00002013#endif
2014
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002015 default: assert(0 && "Error: unknown intrinsics should have been lowered!");
2016 }
2017}
2018
2019/// visitSimpleBinary - Implement simple binary operators for integral types...
2020/// OperatorClass is one of: 0 for Add, 1 for Sub, 2 for And, 3 for Or, 4 for
2021/// Xor.
2022///
Misha Brukmana1dca552004-09-21 18:22:19 +00002023void PPC32ISel::visitSimpleBinary(BinaryOperator &B, unsigned OperatorClass) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002024 unsigned DestReg = getReg(B);
2025 MachineBasicBlock::iterator MI = BB->end();
2026 Value *Op0 = B.getOperand(0), *Op1 = B.getOperand(1);
2027 unsigned Class = getClassB(B.getType());
2028
Nate Begeman1b750222004-10-17 05:19:20 +00002029 if (std::find(SkipList.begin(), SkipList.end(), &B) != SkipList.end())
2030 return;
2031
2032 RlwimiRec r = RlwimiMap[&B];
2033 if (0 != r.Op0) {
2034 unsigned Op0Reg = getReg(r.Op0, BB, MI);
2035 unsigned Op1Reg = getReg(r.Op1, BB, MI);
2036 BuildMI(*BB, MI, PPC::RLWIMI, 5, DestReg).addReg(Op1Reg)
2037 .addReg(Op0Reg).addImm(r.Shift).addImm(r.MB).addImm(r.ME);
2038 } else {
2039 emitSimpleBinaryOperation(BB, MI, &B, Op0, Op1, OperatorClass, DestReg);
2040 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002041}
2042
2043/// emitBinaryFPOperation - This method handles emission of floating point
2044/// Add (0), Sub (1), Mul (2), and Div (3) operations.
Misha Brukmana1dca552004-09-21 18:22:19 +00002045void PPC32ISel::emitBinaryFPOperation(MachineBasicBlock *BB,
2046 MachineBasicBlock::iterator IP,
2047 Value *Op0, Value *Op1,
2048 unsigned OperatorClass, unsigned DestReg){
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002049
Nate Begeman6d1e2df2004-08-14 22:11:38 +00002050 static const unsigned OpcodeTab[][4] = {
2051 { PPC::FADDS, PPC::FSUBS, PPC::FMULS, PPC::FDIVS }, // Float
2052 { PPC::FADD, PPC::FSUB, PPC::FMUL, PPC::FDIV }, // Double
2053 };
2054
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002055 // Special case: R1 = op <const fp>, R2
Misha Brukmana596f8c2004-07-13 15:35:45 +00002056 if (ConstantFP *Op0C = dyn_cast<ConstantFP>(Op0))
2057 if (Op0C->isExactlyValue(-0.0) && OperatorClass == 1) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002058 // -0.0 - X === -X
2059 unsigned op1Reg = getReg(Op1, BB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00002060 BuildMI(*BB, IP, PPC::FNEG, 1, DestReg).addReg(op1Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002061 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002062 }
2063
Nate Begeman81d265d2004-08-19 05:20:54 +00002064 unsigned Opcode = OpcodeTab[Op0->getType() == Type::DoubleTy][OperatorClass];
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002065 unsigned Op0r = getReg(Op0, BB, IP);
2066 unsigned Op1r = getReg(Op1, BB, IP);
2067 BuildMI(*BB, IP, Opcode, 2, DestReg).addReg(Op0r).addReg(Op1r);
2068}
2069
Nate Begemanb816f022004-10-07 22:30:03 +00002070// ExactLog2 - This function solves for (Val == 1 << (N-1)) and returns N. It
2071// returns zero when the input is not exactly a power of two.
2072static unsigned ExactLog2(unsigned Val) {
2073 if (Val == 0 || (Val & (Val-1))) return 0;
2074 unsigned Count = 0;
2075 while (Val != 1) {
2076 Val >>= 1;
2077 ++Count;
2078 }
2079 return Count;
2080}
2081
Nate Begemanbdf69842004-10-08 02:49:24 +00002082// isRunOfOnes - returns true if Val consists of one contiguous run of 1's with
2083// any number of 0's on either side. the 1's are allowed to wrap from LSB to
2084// MSB. so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
2085// not, since all 1's are not contiguous.
2086static bool isRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME) {
2087 bool isRun = true;
2088 MB = 0;
2089 ME = 0;
2090
2091 // look for first set bit
2092 int i = 0;
2093 for (; i < 32; i++) {
2094 if ((Val & (1 << (31 - i))) != 0) {
2095 MB = i;
2096 ME = i;
2097 break;
2098 }
2099 }
2100
2101 // look for last set bit
2102 for (; i < 32; i++) {
2103 if ((Val & (1 << (31 - i))) == 0)
2104 break;
2105 ME = i;
2106 }
2107
2108 // look for next set bit
2109 for (; i < 32; i++) {
2110 if ((Val & (1 << (31 - i))) != 0)
2111 break;
2112 }
2113
2114 // if we exhausted all the bits, we found a match at this point for 0*1*0*
2115 if (i == 32)
2116 return true;
2117
2118 // since we just encountered more 1's, if it doesn't wrap around to the
2119 // most significant bit of the word, then we did not find a match to 1*0*1* so
2120 // exit.
2121 if (MB != 0)
2122 return false;
2123
2124 // look for last set bit
2125 for (MB = i; i < 32; i++) {
2126 if ((Val & (1 << (31 - i))) == 0)
2127 break;
2128 }
2129
2130 // if we exhausted all the bits, then we found a match for 1*0*1*, otherwise,
2131 // the value is not a run of ones.
2132 if (i == 32)
2133 return true;
2134 return false;
2135}
2136
Nate Begeman1b750222004-10-17 05:19:20 +00002137/// emitBitfieldInsert - return true if we were able to fold the sequence of
2138/// instructions starting with AndI into a bitfield insert.
2139bool PPC32ISel::emitBitfieldInsert(BinaryOperator *AndI, unsigned ShlAmount,
2140 Value *InsertOp) {
2141 if (AndI->hasOneUse()) {
2142 ConstantInt *CI_1 = dyn_cast<ConstantInt>(AndI->getOperand(1));
2143 BinaryOperator *OrI = dyn_cast<BinaryOperator>(*(AndI->use_begin()));
2144 if (CI_1 && OrI && OrI->getOpcode() == Instruction::Or) {
2145 Value *Op0 = OrI->getOperand(0);
2146 Value *Op1 = OrI->getOperand(1);
Reid Spencer8c2c3152004-10-22 21:02:08 +00002147 BinaryOperator *AndI_2 = 0;
Nate Begeman1b750222004-10-17 05:19:20 +00002148 // Whichever operand our initial And instruction is to the Or instruction,
2149 // Look at the other operand to determine if it is also an And instruction
2150 if (AndI == Op0) {
2151 AndI_2 = dyn_cast<BinaryOperator>(Op1);
2152 } else if (AndI == Op1) {
2153 AndI_2 = dyn_cast<BinaryOperator>(Op0);
2154 std::swap(Op0, Op1);
2155 } else {
2156 assert(0 && "And instruction not used in Or!");
2157 }
2158 // Verify that the second operand to the Or is an And with one use
2159 if (AndI_2 && AndI_2->hasOneUse()
2160 && AndI_2->getOpcode() == Instruction::And) {
2161 // Check to see if this And instruction also has a constant int operand.
2162 // If it does, then we can replace this sequence of instructions with an
2163 // insert if the sum of the two ConstantInts has all bits set, and
2164 // one is a run of ones (which implies the other is as well).
2165 ConstantInt *CI_2 = dyn_cast<ConstantInt>(AndI_2->getOperand(1));
2166 if (CI_2) {
2167 unsigned Imm1 = CI_1->getRawValue();
2168 unsigned Imm2 = CI_2->getRawValue();
2169 if (Imm1 + Imm2 == 0xFFFFFFFF) {
2170 unsigned MB, ME;
2171 if (isRunOfOnes(Imm1, MB, ME)) {
2172 ++Bitfields;
2173 SkipList.push_back(AndI);
2174 SkipList.push_back(AndI_2);
2175 RlwimiMap[OrI] = RlwimiRec(ShlAmount, MB, ME,
2176 InsertOp, AndI_2->getOperand(0));
2177 return true;
2178 }
2179 }
2180 }
2181 }
2182 }
2183 }
2184 return false;
2185}
2186
Nate Begemanb816f022004-10-07 22:30:03 +00002187/// emitBinaryConstOperation - Implement simple binary operators for integral
2188/// types with a constant operand. Opcode is one of: 0 for Add, 1 for Sub,
2189/// 2 for And, 3 for Or, 4 for Xor, and 5 for Subtract-From.
2190///
2191void PPC32ISel::emitBinaryConstOperation(MachineBasicBlock *MBB,
2192 MachineBasicBlock::iterator IP,
2193 unsigned Op0Reg, ConstantInt *Op1,
2194 unsigned Opcode, unsigned DestReg) {
2195 static const unsigned OpTab[] = {
2196 PPC::ADD, PPC::SUB, PPC::AND, PPC::OR, PPC::XOR, PPC::SUBF
2197 };
2198 static const unsigned ImmOpTab[2][6] = {
2199 { PPC::ADDI, PPC::ADDI, PPC::ANDIo, PPC::ORI, PPC::XORI, PPC::SUBFIC },
2200 { PPC::ADDIS, PPC::ADDIS, PPC::ANDISo, PPC::ORIS, PPC::XORIS, PPC::SUBFIC }
2201 };
2202
2203 // Handle subtract now by inverting the constant value
2204 ConstantInt *CI = Op1;
2205 if (Opcode == 1) {
2206 ConstantSInt *CSI = dyn_cast<ConstantSInt>(Op1);
2207 CI = ConstantSInt::get(Op1->getType(), -CSI->getValue());
2208 }
2209
2210 // xor X, -1 -> not X
2211 if (Opcode == 4) {
Chris Lattner289a49a2004-10-16 18:13:47 +00002212 ConstantInt *CI = dyn_cast<ConstantSInt>(Op1);
2213 if (CI && CI->isAllOnesValue()) {
Nate Begemanb816f022004-10-07 22:30:03 +00002214 BuildMI(*MBB, IP, PPC::NOR, 2, DestReg).addReg(Op0Reg).addReg(Op0Reg);
2215 return;
2216 }
2217 }
Nate Begemanbdf69842004-10-08 02:49:24 +00002218
2219 if (Opcode == 2) {
2220 unsigned MB, ME, mask = CI->getRawValue();
2221 if (isRunOfOnes(mask, MB, ME)) {
Nate Begemanbdf69842004-10-08 02:49:24 +00002222 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(Op0Reg).addImm(0)
2223 .addImm(MB).addImm(ME);
2224 return;
2225 }
2226 }
Nate Begemanb816f022004-10-07 22:30:03 +00002227
Nate Begemane0c83a82004-10-15 00:50:19 +00002228 // PowerPC 16 bit signed immediates are sign extended before use by the
2229 // instruction. Therefore, we can only split up an add of a reg with a 32 bit
2230 // immediate into addis and addi if the sign bit of the low 16 bits is cleared
2231 // so that for register A, const imm X, we don't end up with
2232 // A + XXXX0000 + FFFFXXXX.
2233 bool WontSignExtend = (0 == (Op1->getRawValue() & 0x8000));
2234
Nate Begemanb816f022004-10-07 22:30:03 +00002235 // For Add, Sub, and SubF the instruction takes a signed immediate. For And,
2236 // Or, and Xor, the instruction takes an unsigned immediate. There is no
2237 // shifted immediate form of SubF so disallow its opcode for those constants.
2238 if (canUseAsImmediateForOpcode(CI, Opcode, false)) {
2239 if (Opcode < 2 || Opcode == 5)
2240 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(Op0Reg)
2241 .addSImm(Op1->getRawValue());
2242 else
2243 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(Op0Reg)
2244 .addZImm(Op1->getRawValue());
2245 } else if (canUseAsImmediateForOpcode(CI, Opcode, true) && (Opcode < 5)) {
2246 if (Opcode < 2)
2247 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, DestReg).addReg(Op0Reg)
2248 .addSImm(Op1->getRawValue() >> 16);
2249 else
2250 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, DestReg).addReg(Op0Reg)
2251 .addZImm(Op1->getRawValue() >> 16);
Nate Begemane0c83a82004-10-15 00:50:19 +00002252 } else if ((Opcode < 2 && WontSignExtend) || Opcode == 3 || Opcode == 4) {
2253 unsigned TmpReg = makeAnotherReg(Op1->getType());
Nate Begemane0c83a82004-10-15 00:50:19 +00002254 if (Opcode < 2) {
2255 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, TmpReg).addReg(Op0Reg)
2256 .addSImm(Op1->getRawValue() >> 16);
2257 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(TmpReg)
2258 .addSImm(Op1->getRawValue());
2259 } else {
2260 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, TmpReg).addReg(Op0Reg)
2261 .addZImm(Op1->getRawValue() >> 16);
2262 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(TmpReg)
2263 .addZImm(Op1->getRawValue());
2264 }
Nate Begemanb816f022004-10-07 22:30:03 +00002265 } else {
2266 unsigned Op1Reg = getReg(Op1, MBB, IP);
2267 BuildMI(*MBB, IP, OpTab[Opcode], 2, DestReg).addReg(Op0Reg).addReg(Op1Reg);
2268 }
2269}
2270
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002271/// emitSimpleBinaryOperation - Implement simple binary operators for integral
2272/// types... OperatorClass is one of: 0 for Add, 1 for Sub, 2 for And, 3 for
2273/// Or, 4 for Xor.
2274///
Misha Brukmana1dca552004-09-21 18:22:19 +00002275void PPC32ISel::emitSimpleBinaryOperation(MachineBasicBlock *MBB,
2276 MachineBasicBlock::iterator IP,
Nate Begeman1b750222004-10-17 05:19:20 +00002277 BinaryOperator *BO,
Misha Brukmana1dca552004-09-21 18:22:19 +00002278 Value *Op0, Value *Op1,
2279 unsigned OperatorClass,
2280 unsigned DestReg) {
Misha Brukman422791f2004-06-21 17:41:12 +00002281 // Arithmetic and Bitwise operators
Misha Brukman911afde2004-06-25 14:50:41 +00002282 static const unsigned OpcodeTab[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00002283 PPC::ADD, PPC::SUB, PPC::AND, PPC::OR, PPC::XOR
Misha Brukman422791f2004-06-21 17:41:12 +00002284 };
Nate Begemanb816f022004-10-07 22:30:03 +00002285 static const unsigned LongOpTab[2][5] = {
2286 { PPC::ADDC, PPC::SUBC, PPC::AND, PPC::OR, PPC::XOR },
2287 { PPC::ADDE, PPC::SUBFE, PPC::AND, PPC::OR, PPC::XOR }
Misha Brukman422791f2004-06-21 17:41:12 +00002288 };
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002289
Nate Begemanb816f022004-10-07 22:30:03 +00002290 unsigned Class = getClassB(Op0->getType());
2291
Misha Brukman7e898c32004-07-20 00:41:46 +00002292 if (Class == cFP32 || Class == cFP64) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002293 assert(OperatorClass < 2 && "No logical ops for FP!");
2294 emitBinaryFPOperation(MBB, IP, Op0, Op1, OperatorClass, DestReg);
2295 return;
2296 }
2297
2298 if (Op0->getType() == Type::BoolTy) {
2299 if (OperatorClass == 3)
2300 // If this is an or of two isnan's, emit an FP comparison directly instead
2301 // of or'ing two isnan's together.
2302 if (Value *LHS = dyncastIsNan(Op0))
2303 if (Value *RHS = dyncastIsNan(Op1)) {
2304 unsigned Op0Reg = getReg(RHS, MBB, IP), Op1Reg = getReg(LHS, MBB, IP);
Misha Brukman422791f2004-06-21 17:41:12 +00002305 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002306 emitUCOM(MBB, IP, Op0Reg, Op1Reg);
Misha Brukman5b570812004-08-10 22:47:03 +00002307 BuildMI(*MBB, IP, PPC::MFCR, TmpReg);
2308 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(TmpReg).addImm(4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002309 .addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002310 return;
2311 }
2312 }
2313
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002314 // Special case: op <const int>, Reg
Nate Begemanb816f022004-10-07 22:30:03 +00002315 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op0))
Misha Brukman1013ef52004-07-21 20:09:08 +00002316 if (Class != cLong) {
Nate Begemanb816f022004-10-07 22:30:03 +00002317 unsigned Opcode = (OperatorClass == 1) ? 5 : OperatorClass;
2318 unsigned Op1r = getReg(Op1, MBB, IP);
2319 emitBinaryConstOperation(MBB, IP, Op1r, CI, Opcode, DestReg);
2320 return;
2321 }
2322 // Special case: op Reg, <const int>
2323 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1))
2324 if (Class != cLong) {
Nate Begeman1b750222004-10-17 05:19:20 +00002325 if (OperatorClass == 2 && emitBitfieldInsert(BO, 0, Op0))
2326 return;
2327
Nate Begemanb816f022004-10-07 22:30:03 +00002328 unsigned Op0r = getReg(Op0, MBB, IP);
2329 emitBinaryConstOperation(MBB, IP, Op0r, CI, OperatorClass, DestReg);
Misha Brukman1013ef52004-07-21 20:09:08 +00002330 return;
2331 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002332
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002333 // We couldn't generate an immediate variant of the op, load both halves into
2334 // registers and emit the appropriate opcode.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002335 unsigned Op0r = getReg(Op0, MBB, IP);
2336 unsigned Op1r = getReg(Op1, MBB, IP);
2337
2338 if (Class != cLong) {
Misha Brukman422791f2004-06-21 17:41:12 +00002339 unsigned Opcode = OpcodeTab[OperatorClass];
2340 BuildMI(*MBB, IP, Opcode, 2, DestReg).addReg(Op0r).addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002341 } else {
Nate Begemanb816f022004-10-07 22:30:03 +00002342 BuildMI(*MBB, IP, LongOpTab[0][OperatorClass], 2, DestReg+1).addReg(Op0r+1)
Misha Brukman7e898c32004-07-20 00:41:46 +00002343 .addReg(Op1r+1);
Nate Begemanb816f022004-10-07 22:30:03 +00002344 BuildMI(*MBB, IP, LongOpTab[1][OperatorClass], 2, DestReg).addReg(Op0r)
Misha Brukman1013ef52004-07-21 20:09:08 +00002345 .addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002346 }
2347 return;
2348}
2349
Misha Brukman1013ef52004-07-21 20:09:08 +00002350/// doMultiply - Emit appropriate instructions to multiply together the
2351/// Values Op0 and Op1, and put the result in DestReg.
Misha Brukman2fec9902004-06-21 20:22:03 +00002352///
Misha Brukmana1dca552004-09-21 18:22:19 +00002353void PPC32ISel::doMultiply(MachineBasicBlock *MBB,
2354 MachineBasicBlock::iterator IP,
2355 unsigned DestReg, Value *Op0, Value *Op1) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002356 unsigned Class0 = getClass(Op0->getType());
2357 unsigned Class1 = getClass(Op1->getType());
2358
2359 unsigned Op0r = getReg(Op0, MBB, IP);
2360 unsigned Op1r = getReg(Op1, MBB, IP);
2361
2362 // 64 x 64 -> 64
2363 if (Class0 == cLong && Class1 == cLong) {
2364 unsigned Tmp1 = makeAnotherReg(Type::IntTy);
2365 unsigned Tmp2 = makeAnotherReg(Type::IntTy);
2366 unsigned Tmp3 = makeAnotherReg(Type::IntTy);
2367 unsigned Tmp4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00002368 BuildMI(*MBB, IP, PPC::MULHWU, 2, Tmp1).addReg(Op0r+1).addReg(Op1r+1);
2369 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg+1).addReg(Op0r+1).addReg(Op1r+1);
2370 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp2).addReg(Op0r+1).addReg(Op1r);
2371 BuildMI(*MBB, IP, PPC::ADD, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
2372 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp4).addReg(Op0r).addReg(Op1r+1);
2373 BuildMI(*MBB, IP, PPC::ADD, 2, DestReg).addReg(Tmp3).addReg(Tmp4);
Misha Brukman1013ef52004-07-21 20:09:08 +00002374 return;
2375 }
2376
2377 // 64 x 32 or less, promote 32 to 64 and do a 64 x 64
2378 if (Class0 == cLong && Class1 <= cInt) {
2379 unsigned Tmp0 = makeAnotherReg(Type::IntTy);
2380 unsigned Tmp1 = makeAnotherReg(Type::IntTy);
2381 unsigned Tmp2 = makeAnotherReg(Type::IntTy);
2382 unsigned Tmp3 = makeAnotherReg(Type::IntTy);
2383 unsigned Tmp4 = makeAnotherReg(Type::IntTy);
2384 if (Op1->getType()->isSigned())
Misha Brukman5b570812004-08-10 22:47:03 +00002385 BuildMI(*MBB, IP, PPC::SRAWI, 2, Tmp0).addReg(Op1r).addImm(31);
Misha Brukman1013ef52004-07-21 20:09:08 +00002386 else
Misha Brukman5b570812004-08-10 22:47:03 +00002387 BuildMI(*MBB, IP, PPC::LI, 2, Tmp0).addSImm(0);
2388 BuildMI(*MBB, IP, PPC::MULHWU, 2, Tmp1).addReg(Op0r+1).addReg(Op1r);
2389 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg+1).addReg(Op0r+1).addReg(Op1r);
2390 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp2).addReg(Op0r+1).addReg(Tmp0);
2391 BuildMI(*MBB, IP, PPC::ADD, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
2392 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp4).addReg(Op0r).addReg(Op1r);
2393 BuildMI(*MBB, IP, PPC::ADD, 2, DestReg).addReg(Tmp3).addReg(Tmp4);
Misha Brukman1013ef52004-07-21 20:09:08 +00002394 return;
2395 }
2396
2397 // 32 x 32 -> 32
2398 if (Class0 <= cInt && Class1 <= cInt) {
Misha Brukman5b570812004-08-10 22:47:03 +00002399 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg).addReg(Op0r).addReg(Op1r);
Misha Brukman1013ef52004-07-21 20:09:08 +00002400 return;
2401 }
2402
2403 assert(0 && "doMultiply cannot operate on unknown type!");
2404}
2405
2406/// doMultiplyConst - This method will multiply the value in Op0 by the
2407/// value of the ContantInt *CI
Misha Brukmana1dca552004-09-21 18:22:19 +00002408void PPC32ISel::doMultiplyConst(MachineBasicBlock *MBB,
2409 MachineBasicBlock::iterator IP,
2410 unsigned DestReg, Value *Op0, ConstantInt *CI) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002411 unsigned Class = getClass(Op0->getType());
2412
2413 // Mul op0, 0 ==> 0
2414 if (CI->isNullValue()) {
Misha Brukman5b570812004-08-10 22:47:03 +00002415 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00002416 if (Class == cLong)
Misha Brukman5b570812004-08-10 22:47:03 +00002417 BuildMI(*MBB, IP, PPC::LI, 1, DestReg+1).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002418 return;
Misha Brukman1013ef52004-07-21 20:09:08 +00002419 }
2420
2421 // Mul op0, 1 ==> op0
2422 if (CI->equalsInt(1)) {
2423 unsigned Op0r = getReg(Op0, MBB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00002424 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(Op0r).addReg(Op0r);
Misha Brukman1013ef52004-07-21 20:09:08 +00002425 if (Class == cLong)
Misha Brukman5b570812004-08-10 22:47:03 +00002426 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(Op0r+1).addReg(Op0r+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002427 return;
2428 }
2429
2430 // If the element size is exactly a power of 2, use a shift to get it.
Misha Brukman1013ef52004-07-21 20:09:08 +00002431 if (unsigned Shift = ExactLog2(CI->getRawValue())) {
2432 ConstantUInt *ShiftCI = ConstantUInt::get(Type::UByteTy, Shift);
2433 emitShiftOperation(MBB, IP, Op0, ShiftCI, true, Op0->getType(), DestReg);
2434 return;
2435 }
2436
2437 // If 32 bits or less and immediate is in right range, emit mul by immediate
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002438 if (Class == cByte || Class == cShort || Class == cInt) {
Nate Begemanb816f022004-10-07 22:30:03 +00002439 if (canUseAsImmediateForOpcode(CI, 0, false)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002440 unsigned Op0r = getReg(Op0, MBB, IP);
2441 unsigned imm = CI->getRawValue() & 0xFFFF;
Misha Brukman5b570812004-08-10 22:47:03 +00002442 BuildMI(*MBB, IP, PPC::MULLI, 2, DestReg).addReg(Op0r).addSImm(imm);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002443 return;
2444 }
2445 }
2446
Misha Brukman1013ef52004-07-21 20:09:08 +00002447 doMultiply(MBB, IP, DestReg, Op0, CI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002448}
2449
Misha Brukmana1dca552004-09-21 18:22:19 +00002450void PPC32ISel::visitMul(BinaryOperator &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002451 unsigned ResultReg = getReg(I);
2452
2453 Value *Op0 = I.getOperand(0);
2454 Value *Op1 = I.getOperand(1);
2455
2456 MachineBasicBlock::iterator IP = BB->end();
2457 emitMultiply(BB, IP, Op0, Op1, ResultReg);
2458}
2459
Misha Brukmana1dca552004-09-21 18:22:19 +00002460void PPC32ISel::emitMultiply(MachineBasicBlock *MBB,
2461 MachineBasicBlock::iterator IP,
2462 Value *Op0, Value *Op1, unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002463 TypeClass Class = getClass(Op0->getType());
2464
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002465 switch (Class) {
2466 case cByte:
2467 case cShort:
2468 case cInt:
Misha Brukman1013ef52004-07-21 20:09:08 +00002469 case cLong:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002470 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002471 doMultiplyConst(MBB, IP, DestReg, Op0, CI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002472 } else {
Misha Brukman1013ef52004-07-21 20:09:08 +00002473 doMultiply(MBB, IP, DestReg, Op0, Op1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002474 }
2475 return;
Misha Brukman7e898c32004-07-20 00:41:46 +00002476 case cFP32:
2477 case cFP64:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002478 emitBinaryFPOperation(MBB, IP, Op0, Op1, 2, DestReg);
2479 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002480 break;
2481 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002482}
2483
2484
2485/// visitDivRem - Handle division and remainder instructions... these
2486/// instruction both require the same instructions to be generated, they just
2487/// select the result from a different register. Note that both of these
2488/// instructions work differently for signed and unsigned operands.
2489///
Misha Brukmana1dca552004-09-21 18:22:19 +00002490void PPC32ISel::visitDivRem(BinaryOperator &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002491 unsigned ResultReg = getReg(I);
2492 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2493
2494 MachineBasicBlock::iterator IP = BB->end();
Misha Brukman2fec9902004-06-21 20:22:03 +00002495 emitDivRemOperation(BB, IP, Op0, Op1, I.getOpcode() == Instruction::Div,
2496 ResultReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002497}
2498
Nate Begeman087d5d92004-10-06 09:53:04 +00002499void PPC32ISel::emitDivRemOperation(MachineBasicBlock *MBB,
Misha Brukmana1dca552004-09-21 18:22:19 +00002500 MachineBasicBlock::iterator IP,
2501 Value *Op0, Value *Op1, bool isDiv,
2502 unsigned ResultReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002503 const Type *Ty = Op0->getType();
2504 unsigned Class = getClass(Ty);
2505 switch (Class) {
Misha Brukman7e898c32004-07-20 00:41:46 +00002506 case cFP32:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002507 if (isDiv) {
Misha Brukman7e898c32004-07-20 00:41:46 +00002508 // Floating point divide...
Nate Begeman087d5d92004-10-06 09:53:04 +00002509 emitBinaryFPOperation(MBB, IP, Op0, Op1, 3, ResultReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002510 return;
Misha Brukman7e898c32004-07-20 00:41:46 +00002511 } else {
2512 // Floating point remainder via fmodf(float x, float y);
Nate Begeman087d5d92004-10-06 09:53:04 +00002513 unsigned Op0Reg = getReg(Op0, MBB, IP);
2514 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman7e898c32004-07-20 00:41:46 +00002515 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002516 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(fmodfFn, true);
Misha Brukman7e898c32004-07-20 00:41:46 +00002517 std::vector<ValueRecord> Args;
2518 Args.push_back(ValueRecord(Op0Reg, Type::FloatTy));
2519 Args.push_back(ValueRecord(Op1Reg, Type::FloatTy));
2520 doCall(ValueRecord(ResultReg, Type::FloatTy), TheCall, Args, false);
Misha Brukmane2eceb52004-07-23 16:08:20 +00002521 TM.CalledFunctions.insert(fmodfFn);
Misha Brukman7e898c32004-07-20 00:41:46 +00002522 }
2523 return;
2524 case cFP64:
2525 if (isDiv) {
2526 // Floating point divide...
Nate Begeman087d5d92004-10-06 09:53:04 +00002527 emitBinaryFPOperation(MBB, IP, Op0, Op1, 3, ResultReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00002528 return;
2529 } else {
2530 // Floating point remainder via fmod(double x, double y);
Nate Begeman087d5d92004-10-06 09:53:04 +00002531 unsigned Op0Reg = getReg(Op0, MBB, IP);
2532 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002533 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002534 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(fmodFn, true);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002535 std::vector<ValueRecord> Args;
2536 Args.push_back(ValueRecord(Op0Reg, Type::DoubleTy));
2537 Args.push_back(ValueRecord(Op1Reg, Type::DoubleTy));
Misha Brukmand18a31d2004-07-06 22:51:53 +00002538 doCall(ValueRecord(ResultReg, Type::DoubleTy), TheCall, Args, false);
Misha Brukmane2eceb52004-07-23 16:08:20 +00002539 TM.CalledFunctions.insert(fmodFn);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002540 }
2541 return;
2542 case cLong: {
Misha Brukman7e898c32004-07-20 00:41:46 +00002543 static Function* const Funcs[] =
Misha Brukman0aa97c62004-07-08 18:27:59 +00002544 { __moddi3Fn, __divdi3Fn, __umoddi3Fn, __udivdi3Fn };
Nate Begeman087d5d92004-10-06 09:53:04 +00002545 unsigned Op0Reg = getReg(Op0, MBB, IP);
2546 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002547 unsigned NameIdx = Ty->isUnsigned()*2 + isDiv;
2548 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002549 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(Funcs[NameIdx], true);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002550
2551 std::vector<ValueRecord> Args;
2552 Args.push_back(ValueRecord(Op0Reg, Type::LongTy));
2553 Args.push_back(ValueRecord(Op1Reg, Type::LongTy));
Misha Brukmand18a31d2004-07-06 22:51:53 +00002554 doCall(ValueRecord(ResultReg, Type::LongTy), TheCall, Args, false);
Misha Brukmane2eceb52004-07-23 16:08:20 +00002555 TM.CalledFunctions.insert(Funcs[NameIdx]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002556 return;
2557 }
2558 case cByte: case cShort: case cInt:
2559 break; // Small integrals, handled below...
2560 default: assert(0 && "Unknown class!");
2561 }
2562
2563 // Special case signed division by power of 2.
2564 if (isDiv)
2565 if (ConstantSInt *CI = dyn_cast<ConstantSInt>(Op1)) {
2566 assert(Class != cLong && "This doesn't handle 64-bit divides!");
2567 int V = CI->getValue();
2568
2569 if (V == 1) { // X /s 1 => X
Nate Begeman087d5d92004-10-06 09:53:04 +00002570 unsigned Op0Reg = getReg(Op0, MBB, IP);
2571 BuildMI(*MBB, IP, PPC::OR, 2, ResultReg).addReg(Op0Reg).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002572 return;
2573 }
2574
2575 if (V == -1) { // X /s -1 => -X
Nate Begeman087d5d92004-10-06 09:53:04 +00002576 unsigned Op0Reg = getReg(Op0, MBB, IP);
2577 BuildMI(*MBB, IP, PPC::NEG, 1, ResultReg).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002578 return;
2579 }
2580
Misha Brukmanec6319a2004-07-20 15:51:37 +00002581 unsigned log2V = ExactLog2(V);
2582 if (log2V != 0 && Ty->isSigned()) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002583 unsigned Op0Reg = getReg(Op0, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002584 unsigned TmpReg = makeAnotherReg(Op0->getType());
Misha Brukmanec6319a2004-07-20 15:51:37 +00002585
Nate Begeman087d5d92004-10-06 09:53:04 +00002586 BuildMI(*MBB, IP, PPC::SRAWI, 2, TmpReg).addReg(Op0Reg).addImm(log2V);
2587 BuildMI(*MBB, IP, PPC::ADDZE, 1, ResultReg).addReg(TmpReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002588 return;
2589 }
2590 }
2591
Nate Begeman087d5d92004-10-06 09:53:04 +00002592 unsigned Op0Reg = getReg(Op0, MBB, IP);
2593
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002594 if (isDiv) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002595 unsigned Op1Reg = getReg(Op1, MBB, IP);
2596 unsigned Opcode = Ty->isSigned() ? PPC::DIVW : PPC::DIVWU;
2597 BuildMI(*MBB, IP, Opcode, 2, ResultReg).addReg(Op0Reg).addReg(Op1Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002598 } else { // Remainder
Nate Begeman087d5d92004-10-06 09:53:04 +00002599 // FIXME: don't load the CI part of a CI divide twice
2600 ConstantInt *CI = dyn_cast<ConstantInt>(Op1);
Misha Brukman422791f2004-06-21 17:41:12 +00002601 unsigned TmpReg1 = makeAnotherReg(Op0->getType());
2602 unsigned TmpReg2 = makeAnotherReg(Op0->getType());
Nate Begeman087d5d92004-10-06 09:53:04 +00002603 emitDivRemOperation(MBB, IP, Op0, Op1, true, TmpReg1);
Nate Begemanb816f022004-10-07 22:30:03 +00002604 if (CI && canUseAsImmediateForOpcode(CI, 0, false)) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002605 BuildMI(*MBB, IP, PPC::MULLI, 2, TmpReg2).addReg(TmpReg1)
2606 .addSImm(CI->getRawValue());
2607 } else {
2608 unsigned Op1Reg = getReg(Op1, MBB, IP);
2609 BuildMI(*MBB, IP, PPC::MULLW, 2, TmpReg2).addReg(TmpReg1).addReg(Op1Reg);
2610 }
2611 BuildMI(*MBB, IP, PPC::SUBF, 2, ResultReg).addReg(TmpReg2).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002612 }
2613}
2614
2615
2616/// Shift instructions: 'shl', 'sar', 'shr' - Some special cases here
2617/// for constant immediate shift values, and for constant immediate
2618/// shift values equal to 1. Even the general case is sort of special,
2619/// because the shift amount has to be in CL, not just any old register.
2620///
Misha Brukmana1dca552004-09-21 18:22:19 +00002621void PPC32ISel::visitShiftInst(ShiftInst &I) {
Misha Brukmane2eceb52004-07-23 16:08:20 +00002622 MachineBasicBlock::iterator IP = BB->end();
2623 emitShiftOperation(BB, IP, I.getOperand(0), I.getOperand(1),
2624 I.getOpcode() == Instruction::Shl, I.getType(),
2625 getReg(I));
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002626}
2627
2628/// emitShiftOperation - Common code shared between visitShiftInst and
2629/// constant expression support.
Misha Brukman2fec9902004-06-21 20:22:03 +00002630///
Misha Brukmana1dca552004-09-21 18:22:19 +00002631void PPC32ISel::emitShiftOperation(MachineBasicBlock *MBB,
2632 MachineBasicBlock::iterator IP,
2633 Value *Op, Value *ShiftAmount,
2634 bool isLeftShift, const Type *ResultTy,
2635 unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002636 bool isSigned = ResultTy->isSigned ();
2637 unsigned Class = getClass (ResultTy);
2638
2639 // Longs, as usual, are handled specially...
2640 if (Class == cLong) {
Nate Begeman1b750222004-10-17 05:19:20 +00002641 unsigned SrcReg = getReg (Op, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002642 // If we have a constant shift, we can generate much more efficient code
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002643 // than for a variable shift by using the rlwimi instruction.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002644 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(ShiftAmount)) {
2645 unsigned Amount = CUI->getValue();
2646 if (Amount < 32) {
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002647 unsigned TempReg = makeAnotherReg(ResultTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002648 if (isLeftShift) {
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002649 BuildMI(*MBB, IP, PPC::RLWINM, 4, TempReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002650 .addImm(Amount).addImm(0).addImm(31-Amount);
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002651 BuildMI(*MBB, IP, PPC::RLWIMI, 5, DestReg).addReg(TempReg)
2652 .addReg(SrcReg+1).addImm(Amount).addImm(32-Amount).addImm(31);
Misha Brukman5b570812004-08-10 22:47:03 +00002653 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg+1).addReg(SrcReg+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00002654 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002655 } else {
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002656 BuildMI(*MBB, IP, PPC::RLWINM, 4, TempReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002657 .addImm(32-Amount).addImm(Amount).addImm(31);
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002658 BuildMI(*MBB, IP, PPC::RLWIMI, 5, DestReg+1).addReg(TempReg)
2659 .addReg(SrcReg).addImm(32-Amount).addImm(0).addImm(Amount-1);
Misha Brukman5b570812004-08-10 22:47:03 +00002660 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002661 .addImm(32-Amount).addImm(Amount).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002662 }
2663 } else { // Shifting more than 32 bits
2664 Amount -= 32;
2665 if (isLeftShift) {
2666 if (Amount != 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00002667 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002668 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002669 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002670 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002671 .addReg(SrcReg+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002672 }
Misha Brukman5b570812004-08-10 22:47:03 +00002673 BuildMI(*MBB, IP, PPC::LI, 1, DestReg+1).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00002674 } else {
2675 if (Amount != 0) {
2676 if (isSigned)
Misha Brukman5b570812004-08-10 22:47:03 +00002677 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002678 .addImm(Amount);
2679 else
Misha Brukman5b570812004-08-10 22:47:03 +00002680 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002681 .addImm(32-Amount).addImm(Amount).addImm(31);
2682 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002683 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002684 .addReg(SrcReg);
2685 }
Misha Brukman5b570812004-08-10 22:47:03 +00002686 BuildMI(*MBB, IP,PPC::LI, 1, DestReg).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002687 }
2688 }
2689 } else {
2690 unsigned TmpReg1 = makeAnotherReg(Type::IntTy);
2691 unsigned TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman422791f2004-06-21 17:41:12 +00002692 unsigned TmpReg3 = makeAnotherReg(Type::IntTy);
2693 unsigned TmpReg4 = makeAnotherReg(Type::IntTy);
2694 unsigned TmpReg5 = makeAnotherReg(Type::IntTy);
2695 unsigned TmpReg6 = makeAnotherReg(Type::IntTy);
2696 unsigned ShiftAmountReg = getReg (ShiftAmount, MBB, IP);
2697
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002698 if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002699 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002700 .addSImm(32);
Misha Brukman5b570812004-08-10 22:47:03 +00002701 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg2).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002702 .addReg(ShiftAmountReg);
Misha Brukman5b570812004-08-10 22:47:03 +00002703 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg3).addReg(SrcReg+1)
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002704 .addReg(TmpReg1);
Misha Brukman5b570812004-08-10 22:47:03 +00002705 BuildMI(*MBB, IP, PPC::OR, 2,TmpReg4).addReg(TmpReg2).addReg(TmpReg3);
2706 BuildMI(*MBB, IP, PPC::ADDI, 2, TmpReg5).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002707 .addSImm(-32);
Misha Brukman5b570812004-08-10 22:47:03 +00002708 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg6).addReg(SrcReg+1)
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002709 .addReg(TmpReg5);
Misha Brukman5b570812004-08-10 22:47:03 +00002710 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(TmpReg4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002711 .addReg(TmpReg6);
Misha Brukman5b570812004-08-10 22:47:03 +00002712 BuildMI(*MBB, IP, PPC::SLW, 2, DestReg+1).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002713 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002714 } else {
Nate Begemanf2f07812004-08-29 08:19:32 +00002715 if (isSigned) { // shift right algebraic
2716 MachineBasicBlock *TmpMBB =new MachineBasicBlock(BB->getBasicBlock());
2717 MachineBasicBlock *PhiMBB =new MachineBasicBlock(BB->getBasicBlock());
2718 MachineBasicBlock *OldMBB = BB;
2719 ilist<MachineBasicBlock>::iterator It = BB; ++It;
2720 F->getBasicBlockList().insert(It, TmpMBB);
2721 F->getBasicBlockList().insert(It, PhiMBB);
2722 BB->addSuccessor(TmpMBB);
2723 BB->addSuccessor(PhiMBB);
2724
2725 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
2726 .addSImm(32);
2727 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg2).addReg(SrcReg+1)
2728 .addReg(ShiftAmountReg);
2729 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg3).addReg(SrcReg)
2730 .addReg(TmpReg1);
2731 BuildMI(*MBB, IP, PPC::OR, 2, TmpReg4).addReg(TmpReg2)
2732 .addReg(TmpReg3);
2733 BuildMI(*MBB, IP, PPC::ADDICo, 2, TmpReg5).addReg(ShiftAmountReg)
2734 .addSImm(-32);
2735 BuildMI(*MBB, IP, PPC::SRAW, 2, TmpReg6).addReg(SrcReg)
2736 .addReg(TmpReg5);
2737 BuildMI(*MBB, IP, PPC::SRAW, 2, DestReg).addReg(SrcReg)
2738 .addReg(ShiftAmountReg);
2739 BuildMI(*MBB, IP, PPC::BLE, 2).addReg(PPC::CR0).addMBB(PhiMBB);
2740
2741 // OrMBB:
2742 // Select correct least significant half if the shift amount > 32
2743 BB = TmpMBB;
2744 unsigned OrReg = makeAnotherReg(Type::IntTy);
2745 BuildMI(BB, PPC::OR, 2, OrReg).addReg(TmpReg6).addImm(TmpReg6);
2746 TmpMBB->addSuccessor(PhiMBB);
2747
2748 BB = PhiMBB;
2749 BuildMI(BB, PPC::PHI, 4, DestReg+1).addReg(TmpReg4).addMBB(OldMBB)
2750 .addReg(OrReg).addMBB(TmpMBB);
2751 } else { // shift right logical
Misha Brukman5b570812004-08-10 22:47:03 +00002752 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002753 .addSImm(32);
Misha Brukman5b570812004-08-10 22:47:03 +00002754 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg2).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002755 .addReg(ShiftAmountReg);
Misha Brukman5b570812004-08-10 22:47:03 +00002756 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg3).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002757 .addReg(TmpReg1);
Misha Brukman5b570812004-08-10 22:47:03 +00002758 BuildMI(*MBB, IP, PPC::OR, 2, TmpReg4).addReg(TmpReg2)
Misha Brukman2fec9902004-06-21 20:22:03 +00002759 .addReg(TmpReg3);
Misha Brukman5b570812004-08-10 22:47:03 +00002760 BuildMI(*MBB, IP, PPC::ADDI, 2, TmpReg5).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002761 .addSImm(-32);
Misha Brukman5b570812004-08-10 22:47:03 +00002762 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg6).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002763 .addReg(TmpReg5);
Misha Brukman5b570812004-08-10 22:47:03 +00002764 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(TmpReg4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002765 .addReg(TmpReg6);
Misha Brukman5b570812004-08-10 22:47:03 +00002766 BuildMI(*MBB, IP, PPC::SRW, 2, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002767 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002768 }
2769 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002770 }
2771 return;
2772 }
2773
2774 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(ShiftAmount)) {
2775 // The shift amount is constant, guaranteed to be a ubyte. Get its value.
2776 assert(CUI->getType() == Type::UByteTy && "Shift amount not a ubyte?");
2777 unsigned Amount = CUI->getValue();
Nate Begeman1b750222004-10-17 05:19:20 +00002778
2779 // If this is a left shift with one use, and that use is an And instruction,
2780 // then attempt to emit a bitfield insert.
2781 if (isLeftShift) {
2782 User *U = Op->use_back();
2783 if (U->hasOneUse()) {
2784 Value *V = *(U->use_begin());
2785 BinaryOperator *BO = dyn_cast<BinaryOperator>(V);
2786 if (BO && BO->getOpcode() == Instruction::And) {
2787 if (emitBitfieldInsert(BO, Amount, Op))
2788 return;
2789 }
2790 }
2791 }
2792
2793 unsigned SrcReg = getReg (Op, MBB, IP);
Misha Brukman422791f2004-06-21 17:41:12 +00002794 if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002795 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002796 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman422791f2004-06-21 17:41:12 +00002797 } else {
Misha Brukman2fec9902004-06-21 20:22:03 +00002798 if (isSigned) {
Misha Brukman5b570812004-08-10 22:47:03 +00002799 BuildMI(*MBB, IP, PPC::SRAWI,2,DestReg).addReg(SrcReg).addImm(Amount);
Misha Brukman2fec9902004-06-21 20:22:03 +00002800 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002801 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002802 .addImm(32-Amount).addImm(Amount).addImm(31);
2803 }
Misha Brukman422791f2004-06-21 17:41:12 +00002804 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002805 } else { // The shift amount is non-constant.
Nate Begeman1b750222004-10-17 05:19:20 +00002806 unsigned SrcReg = getReg (Op, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002807 unsigned ShiftAmountReg = getReg (ShiftAmount, MBB, IP);
2808
Misha Brukman422791f2004-06-21 17:41:12 +00002809 if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002810 BuildMI(*MBB, IP, PPC::SLW, 2, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002811 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002812 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002813 BuildMI(*MBB, IP, isSigned ? PPC::SRAW : PPC::SRW, 2, DestReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002814 .addReg(SrcReg).addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002815 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002816 }
2817}
2818
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002819/// LoadNeedsSignExtend - On PowerPC, there is no load byte with sign extend.
2820/// Therefore, if this is a byte load and the destination type is signed, we
Nate Begeman35b020d2004-10-06 11:03:30 +00002821/// would normally need to also emit a sign extend instruction after the load.
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002822/// However, store instructions don't care whether a signed type was sign
2823/// extended across a whole register. Also, a SetCC instruction will emit its
2824/// own sign extension to force the value into the appropriate range, so we
2825/// need not emit it here. Ideally, this kind of thing wouldn't be necessary
2826/// once LLVM's type system is improved.
2827static bool LoadNeedsSignExtend(LoadInst &LI) {
2828 if (cByte == getClassB(LI.getType()) && LI.getType()->isSigned()) {
2829 bool AllUsesAreStoresOrSetCC = true;
Nate Begeman35b020d2004-10-06 11:03:30 +00002830 for (Value::use_iterator I = LI.use_begin(), E = LI.use_end(); I != E; ++I){
Chris Lattner7c348e12004-10-06 16:28:24 +00002831 if (isa<SetCondInst>(*I))
Nate Begeman35b020d2004-10-06 11:03:30 +00002832 continue;
Chris Lattner7c348e12004-10-06 16:28:24 +00002833 if (StoreInst *SI = dyn_cast<StoreInst>(*I))
Nate Begemanb816f022004-10-07 22:30:03 +00002834 if (cByte == getClassB(SI->getOperand(0)->getType()))
Nate Begeman35b020d2004-10-06 11:03:30 +00002835 continue;
2836 AllUsesAreStoresOrSetCC = false;
2837 break;
2838 }
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002839 if (!AllUsesAreStoresOrSetCC)
2840 return true;
2841 }
2842 return false;
2843}
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002844
Misha Brukmanb097f212004-07-26 18:13:24 +00002845/// visitLoadInst - Implement LLVM load instructions. Pretty straightforward
2846/// mapping of LLVM classes to PPC load instructions, with the exception of
2847/// signed byte loads, which need a sign extension following them.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002848///
Misha Brukmana1dca552004-09-21 18:22:19 +00002849void PPC32ISel::visitLoadInst(LoadInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00002850 // Immediate opcodes, for reg+imm addressing
2851 static const unsigned ImmOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00002852 PPC::LBZ, PPC::LHZ, PPC::LWZ,
2853 PPC::LFS, PPC::LFD, PPC::LWZ
Misha Brukmanb097f212004-07-26 18:13:24 +00002854 };
2855 // Indexed opcodes, for reg+reg addressing
2856 static const unsigned IdxOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00002857 PPC::LBZX, PPC::LHZX, PPC::LWZX,
2858 PPC::LFSX, PPC::LFDX, PPC::LWZX
Misha Brukman2fec9902004-06-21 20:22:03 +00002859 };
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002860
Misha Brukmanb097f212004-07-26 18:13:24 +00002861 unsigned Class = getClassB(I.getType());
2862 unsigned ImmOpcode = ImmOpcodes[Class];
2863 unsigned IdxOpcode = IdxOpcodes[Class];
2864 unsigned DestReg = getReg(I);
2865 Value *SourceAddr = I.getOperand(0);
2866
Misha Brukman5b570812004-08-10 22:47:03 +00002867 if (Class == cShort && I.getType()->isSigned()) ImmOpcode = PPC::LHA;
2868 if (Class == cShort && I.getType()->isSigned()) IdxOpcode = PPC::LHAX;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002869
Misha Brukmanb097f212004-07-26 18:13:24 +00002870 if (AllocaInst *AI = dyn_castFixedAlloca(SourceAddr)) {
Misha Brukman422791f2004-06-21 17:41:12 +00002871 unsigned FI = getFixedSizedAllocaFI(AI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002872 if (Class == cLong) {
Misha Brukmanb097f212004-07-26 18:13:24 +00002873 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg), FI);
2874 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg+1), FI, 4);
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002875 } else if (LoadNeedsSignExtend(I)) {
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002876 unsigned TmpReg = makeAnotherReg(I.getType());
Misha Brukmanb097f212004-07-26 18:13:24 +00002877 addFrameReference(BuildMI(BB, ImmOpcode, 2, TmpReg), FI);
Misha Brukman5b570812004-08-10 22:47:03 +00002878 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002879 } else {
Misha Brukmanb097f212004-07-26 18:13:24 +00002880 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +00002881 }
Misha Brukmanb097f212004-07-26 18:13:24 +00002882 return;
2883 }
2884
Nate Begeman645495d2004-09-23 05:31:33 +00002885 // If the offset fits in 16 bits, we can emit a reg+imm load, otherwise, we
2886 // use the index from the FoldedGEP struct and use reg+reg addressing.
Misha Brukmanb097f212004-07-26 18:13:24 +00002887 if (GetElementPtrInst *GEPI = canFoldGEPIntoLoadOrStore(SourceAddr)) {
Misha Brukmanb097f212004-07-26 18:13:24 +00002888
Nate Begeman645495d2004-09-23 05:31:33 +00002889 // Generate the code for the GEP and get the components of the folded GEP
2890 emitGEPOperation(BB, BB->end(), GEPI, true);
2891 unsigned baseReg = GEPMap[GEPI].base;
2892 unsigned indexReg = GEPMap[GEPI].index;
2893 ConstantSInt *offset = GEPMap[GEPI].offset;
2894
2895 if (Class != cLong) {
2896 unsigned TmpReg = makeAnotherReg(I.getType());
2897 if (indexReg == 0)
Misha Brukmanb097f212004-07-26 18:13:24 +00002898 BuildMI(BB, ImmOpcode, 2, TmpReg).addSImm(offset->getValue())
2899 .addReg(baseReg);
Nate Begeman645495d2004-09-23 05:31:33 +00002900 else
2901 BuildMI(BB, IdxOpcode, 2, TmpReg).addReg(indexReg).addReg(baseReg);
2902 if (LoadNeedsSignExtend(I))
Misha Brukman5b570812004-08-10 22:47:03 +00002903 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Nate Begeman645495d2004-09-23 05:31:33 +00002904 else
2905 BuildMI(BB, PPC::OR, 2, DestReg).addReg(TmpReg).addReg(TmpReg);
2906 } else {
2907 indexReg = (indexReg != 0) ? indexReg : getReg(offset);
Misha Brukmanb097f212004-07-26 18:13:24 +00002908 unsigned indexPlus4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00002909 BuildMI(BB, PPC::ADDI, 2, indexPlus4).addReg(indexReg).addSImm(4);
Misha Brukmanb097f212004-07-26 18:13:24 +00002910 BuildMI(BB, IdxOpcode, 2, DestReg).addReg(indexReg).addReg(baseReg);
2911 BuildMI(BB, IdxOpcode, 2, DestReg+1).addReg(indexPlus4).addReg(baseReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002912 }
Misha Brukmanb097f212004-07-26 18:13:24 +00002913 return;
2914 }
2915
2916 // The fallback case, where the load was from a source that could not be
2917 // folded into the load instruction.
2918 unsigned SrcAddrReg = getReg(SourceAddr);
2919
2920 if (Class == cLong) {
2921 BuildMI(BB, ImmOpcode, 2, DestReg).addSImm(0).addReg(SrcAddrReg);
2922 BuildMI(BB, ImmOpcode, 2, DestReg+1).addSImm(4).addReg(SrcAddrReg);
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002923 } else if (LoadNeedsSignExtend(I)) {
Misha Brukmanb097f212004-07-26 18:13:24 +00002924 unsigned TmpReg = makeAnotherReg(I.getType());
2925 BuildMI(BB, ImmOpcode, 2, TmpReg).addSImm(0).addReg(SrcAddrReg);
Misha Brukman5b570812004-08-10 22:47:03 +00002926 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00002927 } else {
2928 BuildMI(BB, ImmOpcode, 2, DestReg).addSImm(0).addReg(SrcAddrReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002929 }
2930}
2931
2932/// visitStoreInst - Implement LLVM store instructions
2933///
Misha Brukmana1dca552004-09-21 18:22:19 +00002934void PPC32ISel::visitStoreInst(StoreInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00002935 // Immediate opcodes, for reg+imm addressing
2936 static const unsigned ImmOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00002937 PPC::STB, PPC::STH, PPC::STW,
2938 PPC::STFS, PPC::STFD, PPC::STW
Misha Brukmanb097f212004-07-26 18:13:24 +00002939 };
2940 // Indexed opcodes, for reg+reg addressing
2941 static const unsigned IdxOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00002942 PPC::STBX, PPC::STHX, PPC::STWX,
2943 PPC::STFSX, PPC::STFDX, PPC::STWX
Misha Brukmanb097f212004-07-26 18:13:24 +00002944 };
2945
2946 Value *SourceAddr = I.getOperand(1);
2947 const Type *ValTy = I.getOperand(0)->getType();
2948 unsigned Class = getClassB(ValTy);
2949 unsigned ImmOpcode = ImmOpcodes[Class];
2950 unsigned IdxOpcode = IdxOpcodes[Class];
2951 unsigned ValReg = getReg(I.getOperand(0));
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002952
Nate Begeman645495d2004-09-23 05:31:33 +00002953 // If the offset fits in 16 bits, we can emit a reg+imm store, otherwise, we
2954 // use the index from the FoldedGEP struct and use reg+reg addressing.
Misha Brukmanb097f212004-07-26 18:13:24 +00002955 if (GetElementPtrInst *GEPI = canFoldGEPIntoLoadOrStore(SourceAddr)) {
Nate Begeman645495d2004-09-23 05:31:33 +00002956 // Generate the code for the GEP and get the components of the folded GEP
2957 emitGEPOperation(BB, BB->end(), GEPI, true);
2958 unsigned baseReg = GEPMap[GEPI].base;
2959 unsigned indexReg = GEPMap[GEPI].index;
2960 ConstantSInt *offset = GEPMap[GEPI].offset;
Misha Brukmanb097f212004-07-26 18:13:24 +00002961
Nate Begeman645495d2004-09-23 05:31:33 +00002962 if (Class != cLong) {
2963 if (indexReg == 0)
2964 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(offset->getValue())
2965 .addReg(baseReg);
2966 else
2967 BuildMI(BB, IdxOpcode, 3).addReg(ValReg).addReg(indexReg)
2968 .addReg(baseReg);
2969 } else {
2970 indexReg = (indexReg != 0) ? indexReg : getReg(offset);
Misha Brukmanb097f212004-07-26 18:13:24 +00002971 unsigned indexPlus4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00002972 BuildMI(BB, PPC::ADDI, 2, indexPlus4).addReg(indexReg).addSImm(4);
Misha Brukmanb097f212004-07-26 18:13:24 +00002973 BuildMI(BB, IdxOpcode, 3).addReg(ValReg).addReg(indexReg).addReg(baseReg);
2974 BuildMI(BB, IdxOpcode, 3).addReg(ValReg+1).addReg(indexPlus4)
2975 .addReg(baseReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00002976 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002977 return;
2978 }
Misha Brukmanb097f212004-07-26 18:13:24 +00002979
2980 // If the store address wasn't the only use of a GEP, we fall back to the
2981 // standard path: store the ValReg at the value in AddressReg.
2982 unsigned AddressReg = getReg(I.getOperand(1));
2983 if (Class == cLong) {
2984 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(0).addReg(AddressReg);
2985 BuildMI(BB, ImmOpcode, 3).addReg(ValReg+1).addSImm(4).addReg(AddressReg);
2986 return;
2987 }
2988 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(0).addReg(AddressReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002989}
2990
2991
2992/// visitCastInst - Here we have various kinds of copying with or without sign
2993/// extension going on.
2994///
Misha Brukmana1dca552004-09-21 18:22:19 +00002995void PPC32ISel::visitCastInst(CastInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002996 Value *Op = CI.getOperand(0);
2997
2998 unsigned SrcClass = getClassB(Op->getType());
2999 unsigned DestClass = getClassB(CI.getType());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003000
3001 // 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 +00003002 // of the cast are GEP instructions, then the cast does not need to be
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003003 // generated explicitly, it will be folded into the GEP.
3004 if (DestClass == cLong && SrcClass == cInt) {
3005 bool AllUsesAreGEPs = true;
3006 for (Value::use_iterator I = CI.use_begin(), E = CI.use_end(); I != E; ++I)
3007 if (!isa<GetElementPtrInst>(*I)) {
3008 AllUsesAreGEPs = false;
3009 break;
3010 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003011 if (AllUsesAreGEPs) return;
3012 }
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003013
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003014 unsigned DestReg = getReg(CI);
3015 MachineBasicBlock::iterator MI = BB->end();
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003016
Nate Begeman31dfc522004-10-23 00:50:23 +00003017 // If this is a cast from an integer type to a ubyte, with one use where the
3018 // use is the shift amount argument of a shift instruction, just emit a move
3019 // instead (since the shift instruction will only look at the low 5 bits
3020 // regardless of how it is sign extended)
3021 if (CI.getType() == Type::UByteTy && SrcClass <= cInt && CI.hasOneUse()) {
3022 ShiftInst *SI = dyn_cast<ShiftInst>(*(CI.use_begin()));
3023 if (SI && (SI->getOperand(1) == &CI)) {
3024 unsigned SrcReg = getReg(Op, BB, MI);
3025 BuildMI(*BB, MI, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3026 return;
3027 }
3028 }
3029
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003030 // If this is a cast from an byte, short, or int to an integer type of equal
3031 // or lesser width, and all uses of the cast are store instructions then dont
3032 // emit them, as the store instruction will implicitly not store the zero or
3033 // sign extended bytes.
3034 if (SrcClass <= cInt && SrcClass >= DestClass) {
3035 bool AllUsesAreStoresOrSetCC = true;
3036 for (Value::use_iterator I = CI.use_begin(), E = CI.use_end(); I != E; ++I)
3037 if (!isa<StoreInst>(*I) && !isa<SetCondInst>(*I)) {
3038 AllUsesAreStoresOrSetCC = false;
3039 break;
3040 }
3041 // Turn this cast directly into a move instruction, which the register
3042 // allocator will deal with.
3043 if (AllUsesAreStoresOrSetCC) {
3044 unsigned SrcReg = getReg(Op, BB, MI);
3045 BuildMI(*BB, MI, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3046 return;
3047 }
3048 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003049 emitCastOperation(BB, MI, Op, CI.getType(), DestReg);
3050}
3051
3052/// emitCastOperation - Common code shared between visitCastInst and constant
3053/// expression cast support.
3054///
Misha Brukmana1dca552004-09-21 18:22:19 +00003055void PPC32ISel::emitCastOperation(MachineBasicBlock *MBB,
3056 MachineBasicBlock::iterator IP,
3057 Value *Src, const Type *DestTy,
3058 unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003059 const Type *SrcTy = Src->getType();
3060 unsigned SrcClass = getClassB(SrcTy);
3061 unsigned DestClass = getClassB(DestTy);
Misha Brukman7e898c32004-07-20 00:41:46 +00003062 unsigned SrcReg = getReg(Src, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003063
Nate Begeman0797d492004-10-20 21:55:41 +00003064 // Implement casts from bool to integer types as a move operation
3065 if (SrcTy == Type::BoolTy) {
3066 switch (DestClass) {
3067 case cByte:
3068 case cShort:
3069 case cInt:
3070 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3071 return;
3072 case cLong:
3073 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addImm(0);
3074 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg).addReg(SrcReg);
3075 return;
3076 default:
3077 break;
3078 }
3079 }
3080
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003081 // Implement casts to bool by using compare on the operand followed by set if
3082 // not zero on the result.
3083 if (DestTy == Type::BoolTy) {
3084 switch (SrcClass) {
3085 case cByte:
Misha Brukman422791f2004-06-21 17:41:12 +00003086 case cShort:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003087 case cInt: {
3088 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003089 BuildMI(*MBB, IP, PPC::ADDIC, 2, TmpReg).addReg(SrcReg).addSImm(-1);
3090 BuildMI(*MBB, IP, PPC::SUBFE, 2, DestReg).addReg(TmpReg).addReg(SrcReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003091 break;
3092 }
3093 case cLong: {
3094 unsigned TmpReg = makeAnotherReg(Type::IntTy);
3095 unsigned SrcReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003096 BuildMI(*MBB, IP, PPC::OR, 2, SrcReg2).addReg(SrcReg).addReg(SrcReg+1);
3097 BuildMI(*MBB, IP, PPC::ADDIC, 2, TmpReg).addReg(SrcReg2).addSImm(-1);
3098 BuildMI(*MBB, IP, PPC::SUBFE, 2, DestReg).addReg(TmpReg)
Misha Brukmanbf417a62004-07-20 20:43:05 +00003099 .addReg(SrcReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003100 break;
3101 }
Misha Brukman7e898c32004-07-20 00:41:46 +00003102 case cFP32:
3103 case cFP64:
Nate Begemanf2f07812004-08-29 08:19:32 +00003104 unsigned TmpReg = makeAnotherReg(Type::IntTy);
3105 unsigned ConstZero = getReg(ConstantFP::get(Type::DoubleTy, 0.0), BB, IP);
3106 BuildMI(*MBB, IP, PPC::FCMPU, PPC::CR7).addReg(SrcReg).addReg(ConstZero);
3107 BuildMI(*MBB, IP, PPC::MFCR, TmpReg);
3108 BuildMI(*MBB, IP, PPC::RLWINM, DestReg).addReg(TmpReg).addImm(31)
3109 .addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003110 }
3111 return;
3112 }
3113
Misha Brukman7e898c32004-07-20 00:41:46 +00003114 // Handle cast of Float -> Double
3115 if (SrcClass == cFP32 && DestClass == cFP64) {
Misha Brukman5b570812004-08-10 22:47:03 +00003116 BuildMI(*MBB, IP, PPC::FMR, 1, DestReg).addReg(SrcReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00003117 return;
3118 }
3119
3120 // Handle cast of Double -> Float
3121 if (SrcClass == cFP64 && DestClass == cFP32) {
Misha Brukman5b570812004-08-10 22:47:03 +00003122 BuildMI(*MBB, IP, PPC::FRSP, 1, DestReg).addReg(SrcReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00003123 return;
3124 }
3125
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003126 // Handle casts from integer to floating point now...
Misha Brukman7e898c32004-07-20 00:41:46 +00003127 if (DestClass == cFP32 || DestClass == cFP64) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003128
Misha Brukman422791f2004-06-21 17:41:12 +00003129 // Emit a library call for long to float conversion
3130 if (SrcClass == cLong) {
Misha Brukman7e898c32004-07-20 00:41:46 +00003131 Function *floatFn = (DestClass == cFP32) ? __floatdisfFn : __floatdidfFn;
Nate Begemanf2f07812004-08-29 08:19:32 +00003132 if (SrcTy->isSigned()) {
3133 std::vector<ValueRecord> Args;
3134 Args.push_back(ValueRecord(SrcReg, SrcTy));
3135 MachineInstr *TheCall =
3136 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3137 doCall(ValueRecord(DestReg, DestTy), TheCall, Args, false);
3138 TM.CalledFunctions.insert(floatFn);
3139 } else {
3140 std::vector<ValueRecord> CmpArgs, ClrArgs, SetArgs;
3141 unsigned ZeroLong = getReg(ConstantUInt::get(SrcTy, 0));
3142 unsigned CondReg = makeAnotherReg(Type::IntTy);
3143
3144 // Update machine-CFG edges
3145 MachineBasicBlock *ClrMBB = new MachineBasicBlock(BB->getBasicBlock());
3146 MachineBasicBlock *SetMBB = new MachineBasicBlock(BB->getBasicBlock());
3147 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
3148 MachineBasicBlock *OldMBB = BB;
3149 ilist<MachineBasicBlock>::iterator It = BB; ++It;
3150 F->getBasicBlockList().insert(It, ClrMBB);
3151 F->getBasicBlockList().insert(It, SetMBB);
3152 F->getBasicBlockList().insert(It, PhiMBB);
3153 BB->addSuccessor(ClrMBB);
3154 BB->addSuccessor(SetMBB);
3155
3156 CmpArgs.push_back(ValueRecord(SrcReg, SrcTy));
3157 CmpArgs.push_back(ValueRecord(ZeroLong, SrcTy));
3158 MachineInstr *TheCall =
3159 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(__cmpdi2Fn, true);
3160 doCall(ValueRecord(CondReg, Type::IntTy), TheCall, CmpArgs, false);
3161 TM.CalledFunctions.insert(__cmpdi2Fn);
3162 BuildMI(*MBB, IP, PPC::CMPWI, 2, PPC::CR0).addReg(CondReg).addSImm(0);
3163 BuildMI(*MBB, IP, PPC::BLE, 2).addReg(PPC::CR0).addMBB(SetMBB);
3164
3165 // ClrMBB
3166 BB = ClrMBB;
3167 unsigned ClrReg = makeAnotherReg(DestTy);
3168 ClrArgs.push_back(ValueRecord(SrcReg, SrcTy));
3169 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3170 doCall(ValueRecord(ClrReg, DestTy), TheCall, ClrArgs, false);
3171 TM.CalledFunctions.insert(floatFn);
3172 BuildMI(BB, PPC::B, 1).addMBB(PhiMBB);
3173 BB->addSuccessor(PhiMBB);
3174
3175 // SetMBB
3176 BB = SetMBB;
3177 unsigned SetReg = makeAnotherReg(DestTy);
3178 unsigned CallReg = makeAnotherReg(DestTy);
3179 unsigned ShiftedReg = makeAnotherReg(SrcTy);
3180 ConstantSInt *Const1 = ConstantSInt::get(Type::IntTy, 1);
3181 emitShiftOperation(BB, BB->end(), Src, Const1, false, SrcTy, ShiftedReg);
3182 SetArgs.push_back(ValueRecord(ShiftedReg, SrcTy));
3183 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3184 doCall(ValueRecord(CallReg, DestTy), TheCall, SetArgs, false);
3185 TM.CalledFunctions.insert(floatFn);
3186 unsigned SetOpcode = (DestClass == cFP32) ? PPC::FADDS : PPC::FADD;
3187 BuildMI(BB, SetOpcode, 2, SetReg).addReg(CallReg).addReg(CallReg);
3188 BB->addSuccessor(PhiMBB);
3189
3190 // PhiMBB
3191 BB = PhiMBB;
3192 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(ClrReg).addMBB(ClrMBB)
3193 .addReg(SetReg).addMBB(SetMBB);
3194 }
Misha Brukman422791f2004-06-21 17:41:12 +00003195 return;
3196 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003197
Misha Brukman7e898c32004-07-20 00:41:46 +00003198 // Make sure we're dealing with a full 32 bits
3199 unsigned TmpReg = makeAnotherReg(Type::IntTy);
3200 promote32(TmpReg, ValueRecord(SrcReg, SrcTy));
3201
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003202 SrcReg = TmpReg;
Misha Brukman422791f2004-06-21 17:41:12 +00003203
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003204 // Spill the integer to memory and reload it from there.
Misha Brukman422791f2004-06-21 17:41:12 +00003205 // Also spill room for a special conversion constant
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003206 int ValueFrameIdx =
3207 F->getFrameInfo()->CreateStackObject(Type::DoubleTy, TM.getTargetData());
3208
Nate Begeman81d265d2004-08-19 05:20:54 +00003209 MachineConstantPool *CP = F->getConstantPool();
Misha Brukman422791f2004-06-21 17:41:12 +00003210 unsigned constantHi = makeAnotherReg(Type::IntTy);
Misha Brukman422791f2004-06-21 17:41:12 +00003211 unsigned TempF = makeAnotherReg(Type::DoubleTy);
3212
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003213 if (!SrcTy->isSigned()) {
Nate Begeman81d265d2004-08-19 05:20:54 +00003214 ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, 0x1.000000p52);
3215 unsigned ConstF = getReg(CFP, BB, IP);
Nate Begemanf2f07812004-08-29 08:19:32 +00003216 BuildMI(*MBB, IP, PPC::LIS, 1, constantHi).addSImm(0x4330);
3217 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(constantHi),
Misha Brukman2fec9902004-06-21 20:22:03 +00003218 ValueFrameIdx);
Nate Begemanf2f07812004-08-29 08:19:32 +00003219 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(SrcReg),
Misha Brukman2fec9902004-06-21 20:22:03 +00003220 ValueFrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003221 addFrameReference(BuildMI(*MBB, IP, PPC::LFD, 2, TempF), ValueFrameIdx);
3222 BuildMI(*MBB, IP, PPC::FSUB, 2, DestReg).addReg(TempF).addReg(ConstF);
Misha Brukman422791f2004-06-21 17:41:12 +00003223 } else {
Nate Begeman81d265d2004-08-19 05:20:54 +00003224 ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, 0x1.000008p52);
3225 unsigned ConstF = getReg(CFP, BB, IP);
Misha Brukman422791f2004-06-21 17:41:12 +00003226 unsigned TempLo = makeAnotherReg(Type::IntTy);
Nate Begemanf2f07812004-08-29 08:19:32 +00003227 BuildMI(*MBB, IP, PPC::LIS, 1, constantHi).addSImm(0x4330);
3228 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(constantHi),
Misha Brukman2fec9902004-06-21 20:22:03 +00003229 ValueFrameIdx);
Nate Begemanf2f07812004-08-29 08:19:32 +00003230 BuildMI(*MBB, IP, PPC::XORIS, 2, TempLo).addReg(SrcReg).addImm(0x8000);
3231 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(TempLo),
Misha Brukman2fec9902004-06-21 20:22:03 +00003232 ValueFrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003233 addFrameReference(BuildMI(*MBB, IP, PPC::LFD, 2, TempF), ValueFrameIdx);
3234 BuildMI(*MBB, IP, PPC::FSUB, 2, DestReg).addReg(TempF).addReg(ConstF);
Misha Brukman422791f2004-06-21 17:41:12 +00003235 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003236 return;
3237 }
3238
3239 // Handle casts from floating point to integer now...
Misha Brukman7e898c32004-07-20 00:41:46 +00003240 if (SrcClass == cFP32 || SrcClass == cFP64) {
Nate Begemanb64af912004-08-10 20:42:36 +00003241 static Function* const Funcs[] =
3242 { __fixsfdiFn, __fixdfdiFn, __fixunssfdiFn, __fixunsdfdiFn };
Misha Brukman422791f2004-06-21 17:41:12 +00003243 // emit library call
3244 if (DestClass == cLong) {
Nate Begemanb64af912004-08-10 20:42:36 +00003245 bool isDouble = SrcClass == cFP64;
3246 unsigned nameIndex = 2 * DestTy->isSigned() + isDouble;
Misha Brukman422791f2004-06-21 17:41:12 +00003247 std::vector<ValueRecord> Args;
3248 Args.push_back(ValueRecord(SrcReg, SrcTy));
Nate Begemanb64af912004-08-10 20:42:36 +00003249 Function *floatFn = Funcs[nameIndex];
Misha Brukman2fec9902004-06-21 20:22:03 +00003250 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003251 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003252 doCall(ValueRecord(DestReg, DestTy), TheCall, Args, false);
Misha Brukmane2eceb52004-07-23 16:08:20 +00003253 TM.CalledFunctions.insert(floatFn);
Misha Brukman422791f2004-06-21 17:41:12 +00003254 return;
3255 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003256
3257 int ValueFrameIdx =
Nate Begeman43d64ea2004-08-15 06:42:28 +00003258 F->getFrameInfo()->CreateStackObject(Type::DoubleTy, TM.getTargetData());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003259
Misha Brukman7e898c32004-07-20 00:41:46 +00003260 if (DestTy->isSigned()) {
Misha Brukman4c14f332004-07-23 01:11:19 +00003261 unsigned TempReg = makeAnotherReg(Type::DoubleTy);
3262
3263 // Convert to integer in the FP reg and store it to a stack slot
Nate Begemanf2f07812004-08-29 08:19:32 +00003264 BuildMI(*MBB, IP, PPC::FCTIWZ, 1, TempReg).addReg(SrcReg);
3265 addFrameReference(BuildMI(*MBB, IP, PPC::STFD, 3)
Misha Brukman4c14f332004-07-23 01:11:19 +00003266 .addReg(TempReg), ValueFrameIdx);
Misha Brukmanb097f212004-07-26 18:13:24 +00003267
3268 // There is no load signed byte opcode, so we must emit a sign extend for
3269 // that particular size. Make sure to source the new integer from the
3270 // correct offset.
Misha Brukman4c14f332004-07-23 01:11:19 +00003271 if (DestClass == cByte) {
3272 unsigned TempReg2 = makeAnotherReg(DestTy);
Nate Begemanf2f07812004-08-29 08:19:32 +00003273 addFrameReference(BuildMI(*MBB, IP, PPC::LBZ, 2, TempReg2),
Misha Brukmanb097f212004-07-26 18:13:24 +00003274 ValueFrameIdx, 7);
Nate Begemanf2f07812004-08-29 08:19:32 +00003275 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(TempReg2);
Misha Brukman4c14f332004-07-23 01:11:19 +00003276 } else {
Misha Brukmanb097f212004-07-26 18:13:24 +00003277 int offset = (DestClass == cShort) ? 6 : 4;
Misha Brukman5b570812004-08-10 22:47:03 +00003278 unsigned LoadOp = (DestClass == cShort) ? PPC::LHA : PPC::LWZ;
Nate Begemanf2f07812004-08-29 08:19:32 +00003279 addFrameReference(BuildMI(*MBB, IP, LoadOp, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003280 ValueFrameIdx, offset);
Misha Brukman4c14f332004-07-23 01:11:19 +00003281 }
Misha Brukman7e898c32004-07-20 00:41:46 +00003282 } else {
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003283 unsigned Zero = getReg(ConstantFP::get(Type::DoubleTy, 0.0f));
3284 double maxInt = (1LL << 32) - 1;
3285 unsigned MaxInt = getReg(ConstantFP::get(Type::DoubleTy, maxInt));
3286 double border = 1LL << 31;
3287 unsigned Border = getReg(ConstantFP::get(Type::DoubleTy, border));
3288 unsigned UseZero = makeAnotherReg(Type::DoubleTy);
3289 unsigned UseMaxInt = makeAnotherReg(Type::DoubleTy);
3290 unsigned UseChoice = makeAnotherReg(Type::DoubleTy);
3291 unsigned TmpReg = makeAnotherReg(Type::DoubleTy);
3292 unsigned TmpReg2 = makeAnotherReg(Type::DoubleTy);
3293 unsigned ConvReg = makeAnotherReg(Type::DoubleTy);
3294 unsigned IntTmp = makeAnotherReg(Type::IntTy);
3295 unsigned XorReg = makeAnotherReg(Type::IntTy);
3296 int FrameIdx =
3297 F->getFrameInfo()->CreateStackObject(SrcTy, TM.getTargetData());
3298 // Update machine-CFG edges
3299 MachineBasicBlock *XorMBB = new MachineBasicBlock(BB->getBasicBlock());
3300 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
3301 MachineBasicBlock *OldMBB = BB;
3302 ilist<MachineBasicBlock>::iterator It = BB; ++It;
3303 F->getBasicBlockList().insert(It, XorMBB);
3304 F->getBasicBlockList().insert(It, PhiMBB);
3305 BB->addSuccessor(XorMBB);
3306 BB->addSuccessor(PhiMBB);
3307
3308 // Convert from floating point to unsigned 32-bit value
3309 // Use 0 if incoming value is < 0.0
Nate Begemanf2f07812004-08-29 08:19:32 +00003310 BuildMI(*MBB, IP, PPC::FSEL, 3, UseZero).addReg(SrcReg).addReg(SrcReg)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003311 .addReg(Zero);
3312 // Use 2**32 - 1 if incoming value is >= 2**32
Nate Begemanf2f07812004-08-29 08:19:32 +00003313 BuildMI(*MBB, IP, PPC::FSUB, 2, UseMaxInt).addReg(MaxInt).addReg(SrcReg);
3314 BuildMI(*MBB, IP, PPC::FSEL, 3, UseChoice).addReg(UseMaxInt)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003315 .addReg(UseZero).addReg(MaxInt);
3316 // Subtract 2**31
Nate Begemanf2f07812004-08-29 08:19:32 +00003317 BuildMI(*MBB, IP, PPC::FSUB, 2, TmpReg).addReg(UseChoice).addReg(Border);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003318 // Use difference if >= 2**31
Nate Begemanf2f07812004-08-29 08:19:32 +00003319 BuildMI(*MBB, IP, PPC::FCMPU, 2, PPC::CR0).addReg(UseChoice)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003320 .addReg(Border);
Nate Begemanf2f07812004-08-29 08:19:32 +00003321 BuildMI(*MBB, IP, PPC::FSEL, 3, TmpReg2).addReg(TmpReg).addReg(TmpReg)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003322 .addReg(UseChoice);
3323 // Convert to integer
Nate Begemanf2f07812004-08-29 08:19:32 +00003324 BuildMI(*MBB, IP, PPC::FCTIWZ, 1, ConvReg).addReg(TmpReg2);
3325 addFrameReference(BuildMI(*MBB, IP, PPC::STFD, 3).addReg(ConvReg),
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003326 FrameIdx);
Misha Brukmanb097f212004-07-26 18:13:24 +00003327 if (DestClass == cByte) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003328 addFrameReference(BuildMI(*MBB, IP, PPC::LBZ, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003329 FrameIdx, 7);
3330 } else if (DestClass == cShort) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003331 addFrameReference(BuildMI(*MBB, IP, PPC::LHZ, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003332 FrameIdx, 6);
3333 } if (DestClass == cInt) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003334 addFrameReference(BuildMI(*MBB, IP, PPC::LWZ, 2, IntTmp),
Misha Brukmanb097f212004-07-26 18:13:24 +00003335 FrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003336 BuildMI(*MBB, IP, PPC::BLT, 2).addReg(PPC::CR0).addMBB(PhiMBB);
3337 BuildMI(*MBB, IP, PPC::B, 1).addMBB(XorMBB);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003338
Misha Brukmanb097f212004-07-26 18:13:24 +00003339 // XorMBB:
3340 // add 2**31 if input was >= 2**31
3341 BB = XorMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00003342 BuildMI(BB, PPC::XORIS, 2, XorReg).addReg(IntTmp).addImm(0x8000);
Misha Brukmanb097f212004-07-26 18:13:24 +00003343 XorMBB->addSuccessor(PhiMBB);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003344
Misha Brukmanb097f212004-07-26 18:13:24 +00003345 // PhiMBB:
3346 // DestReg = phi [ IntTmp, OldMBB ], [ XorReg, XorMBB ]
3347 BB = PhiMBB;
Misha Brukmand2cbb872004-08-19 21:00:12 +00003348 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(IntTmp).addMBB(OldMBB)
Misha Brukmanb097f212004-07-26 18:13:24 +00003349 .addReg(XorReg).addMBB(XorMBB);
3350 }
3351 }
3352 return;
3353 }
3354
3355 // Check our invariants
3356 assert((SrcClass <= cInt || SrcClass == cLong) &&
3357 "Unhandled source class for cast operation!");
3358 assert((DestClass <= cInt || DestClass == cLong) &&
3359 "Unhandled destination class for cast operation!");
3360
3361 bool sourceUnsigned = SrcTy->isUnsigned() || SrcTy == Type::BoolTy;
3362 bool destUnsigned = DestTy->isUnsigned();
3363
3364 // Unsigned -> Unsigned, clear if larger,
3365 if (sourceUnsigned && destUnsigned) {
3366 // handle long dest class now to keep switch clean
3367 if (DestClass == cLong) {
3368 if (SrcClass == cLong) {
Misha Brukman5b570812004-08-10 22:47:03 +00003369 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3370 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg+1)
Misha Brukmanb097f212004-07-26 18:13:24 +00003371 .addReg(SrcReg+1);
3372 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00003373 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
3374 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003375 .addReg(SrcReg);
3376 }
3377 return;
3378 }
3379
3380 // handle u{ byte, short, int } x u{ byte, short, int }
3381 unsigned clearBits = (SrcClass == cByte || DestClass == cByte) ? 24 : 16;
3382 switch (SrcClass) {
3383 case cByte:
3384 case cShort:
3385 if (SrcClass == DestClass)
Misha Brukman5b570812004-08-10 22:47:03 +00003386 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003387 else
Misha Brukman5b570812004-08-10 22:47:03 +00003388 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003389 .addImm(0).addImm(clearBits).addImm(31);
3390 break;
3391 case cLong:
3392 ++SrcReg;
3393 // Fall through
3394 case cInt:
3395 if (DestClass == cInt)
Misha Brukman5b570812004-08-10 22:47:03 +00003396 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003397 else
Misha Brukman5b570812004-08-10 22:47:03 +00003398 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003399 .addImm(0).addImm(clearBits).addImm(31);
3400 break;
3401 }
3402 return;
3403 }
3404
3405 // Signed -> Signed
3406 if (!sourceUnsigned && !destUnsigned) {
3407 // handle long dest class now to keep switch clean
3408 if (DestClass == cLong) {
3409 if (SrcClass == cLong) {
Misha Brukman5b570812004-08-10 22:47:03 +00003410 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3411 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg+1)
Misha Brukmanb097f212004-07-26 18:13:24 +00003412 .addReg(SrcReg+1);
3413 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00003414 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg).addImm(31);
3415 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003416 .addReg(SrcReg);
3417 }
3418 return;
3419 }
3420
3421 // handle { byte, short, int } x { byte, short, int }
3422 switch (SrcClass) {
3423 case cByte:
3424 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003425 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003426 else
Misha Brukman5b570812004-08-10 22:47:03 +00003427 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003428 break;
3429 case cShort:
3430 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003431 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003432 else if (DestClass == cShort)
Misha Brukman5b570812004-08-10 22:47:03 +00003433 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003434 else
Misha Brukman5b570812004-08-10 22:47:03 +00003435 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003436 break;
3437 case cLong:
3438 ++SrcReg;
3439 // Fall through
3440 case cInt:
3441 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003442 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003443 else if (DestClass == cShort)
Misha Brukman5b570812004-08-10 22:47:03 +00003444 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003445 else
Misha Brukman5b570812004-08-10 22:47:03 +00003446 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003447 break;
3448 }
3449 return;
3450 }
3451
3452 // Unsigned -> Signed
3453 if (sourceUnsigned && !destUnsigned) {
3454 // handle long dest class now to keep switch clean
3455 if (DestClass == cLong) {
3456 if (SrcClass == cLong) {
Misha Brukman5b570812004-08-10 22:47:03 +00003457 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3458 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg+1).
Misha Brukmanb097f212004-07-26 18:13:24 +00003459 addReg(SrcReg+1);
3460 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00003461 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
3462 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003463 .addReg(SrcReg);
3464 }
3465 return;
3466 }
3467
3468 // handle u{ byte, short, int } -> { byte, short, int }
3469 switch (SrcClass) {
3470 case cByte:
3471 if (DestClass == cByte)
3472 // uByte 255 -> signed byte == -1
Misha Brukman5b570812004-08-10 22:47:03 +00003473 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003474 else
3475 // uByte 255 -> signed short/int == 255
Misha Brukman5b570812004-08-10 22:47:03 +00003476 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(0)
Misha Brukmanb097f212004-07-26 18:13:24 +00003477 .addImm(24).addImm(31);
3478 break;
3479 case cShort:
3480 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003481 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003482 else if (DestClass == cShort)
Misha Brukman5b570812004-08-10 22:47:03 +00003483 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003484 else
Misha Brukman5b570812004-08-10 22:47:03 +00003485 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(0)
Misha Brukmanb097f212004-07-26 18:13:24 +00003486 .addImm(16).addImm(31);
3487 break;
3488 case cLong:
3489 ++SrcReg;
3490 // Fall through
3491 case cInt:
3492 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003493 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003494 else if (DestClass == cShort)
Misha Brukman5b570812004-08-10 22:47:03 +00003495 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003496 else
Misha Brukman5b570812004-08-10 22:47:03 +00003497 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003498 break;
3499 }
3500 return;
3501 }
3502
3503 // Signed -> Unsigned
3504 if (!sourceUnsigned && destUnsigned) {
3505 // handle long dest class now to keep switch clean
3506 if (DestClass == cLong) {
3507 if (SrcClass == cLong) {
Misha Brukman5b570812004-08-10 22:47:03 +00003508 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3509 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg+1)
Misha Brukmanb097f212004-07-26 18:13:24 +00003510 .addReg(SrcReg+1);
3511 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00003512 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg).addImm(31);
3513 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003514 .addReg(SrcReg);
3515 }
3516 return;
3517 }
3518
3519 // handle { byte, short, int } -> u{ byte, short, int }
3520 unsigned clearBits = (DestClass == cByte) ? 24 : 16;
3521 switch (SrcClass) {
3522 case cByte:
3523 case cShort:
3524 if (DestClass == cByte || DestClass == cShort)
3525 // sbyte -1 -> ubyte 0x000000FF
Misha Brukman5b570812004-08-10 22:47:03 +00003526 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003527 .addImm(0).addImm(clearBits).addImm(31);
3528 else
3529 // sbyte -1 -> ubyte 0xFFFFFFFF
Misha Brukman5b570812004-08-10 22:47:03 +00003530 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003531 break;
3532 case cLong:
3533 ++SrcReg;
3534 // Fall through
3535 case cInt:
3536 if (DestClass == cInt)
Misha Brukman5b570812004-08-10 22:47:03 +00003537 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003538 else
Misha Brukman5b570812004-08-10 22:47:03 +00003539 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003540 .addImm(0).addImm(clearBits).addImm(31);
3541 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00003542 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003543 return;
3544 }
3545
3546 // Anything we haven't handled already, we can't (yet) handle at all.
Misha Brukmanb097f212004-07-26 18:13:24 +00003547 std::cerr << "Unhandled cast from " << SrcTy->getDescription()
3548 << "to " << DestTy->getDescription() << '\n';
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003549 abort();
3550}
3551
3552/// visitVANextInst - Implement the va_next instruction...
3553///
Misha Brukmana1dca552004-09-21 18:22:19 +00003554void PPC32ISel::visitVANextInst(VANextInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003555 unsigned VAList = getReg(I.getOperand(0));
3556 unsigned DestReg = getReg(I);
3557
3558 unsigned Size;
Misha Brukman358829f2004-06-21 17:25:55 +00003559 switch (I.getArgType()->getTypeID()) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003560 default:
3561 std::cerr << I;
3562 assert(0 && "Error: bad type for va_next instruction!");
3563 return;
3564 case Type::PointerTyID:
3565 case Type::UIntTyID:
3566 case Type::IntTyID:
3567 Size = 4;
3568 break;
3569 case Type::ULongTyID:
3570 case Type::LongTyID:
3571 case Type::DoubleTyID:
3572 Size = 8;
3573 break;
3574 }
3575
3576 // Increment the VAList pointer...
Misha Brukman5b570812004-08-10 22:47:03 +00003577 BuildMI(BB, PPC::ADDI, 2, DestReg).addReg(VAList).addSImm(Size);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003578}
3579
Misha Brukmana1dca552004-09-21 18:22:19 +00003580void PPC32ISel::visitVAArgInst(VAArgInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003581 unsigned VAList = getReg(I.getOperand(0));
3582 unsigned DestReg = getReg(I);
3583
Misha Brukman358829f2004-06-21 17:25:55 +00003584 switch (I.getType()->getTypeID()) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003585 default:
3586 std::cerr << I;
3587 assert(0 && "Error: bad type for va_next instruction!");
3588 return;
3589 case Type::PointerTyID:
3590 case Type::UIntTyID:
3591 case Type::IntTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003592 BuildMI(BB, PPC::LWZ, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003593 break;
3594 case Type::ULongTyID:
3595 case Type::LongTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003596 BuildMI(BB, PPC::LWZ, 2, DestReg).addSImm(0).addReg(VAList);
3597 BuildMI(BB, PPC::LWZ, 2, DestReg+1).addSImm(4).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003598 break;
Misha Brukmanb097f212004-07-26 18:13:24 +00003599 case Type::FloatTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003600 BuildMI(BB, PPC::LFS, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukmanb097f212004-07-26 18:13:24 +00003601 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003602 case Type::DoubleTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003603 BuildMI(BB, PPC::LFD, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003604 break;
3605 }
3606}
3607
3608/// visitGetElementPtrInst - instruction-select GEP instructions
3609///
Misha Brukmana1dca552004-09-21 18:22:19 +00003610void PPC32ISel::visitGetElementPtrInst(GetElementPtrInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003611 if (canFoldGEPIntoLoadOrStore(&I))
3612 return;
3613
Nate Begeman645495d2004-09-23 05:31:33 +00003614 emitGEPOperation(BB, BB->end(), &I, false);
3615}
3616
Misha Brukman1013ef52004-07-21 20:09:08 +00003617/// emitGEPOperation - Common code shared between visitGetElementPtrInst and
3618/// constant expression GEP support.
3619///
Misha Brukmana1dca552004-09-21 18:22:19 +00003620void PPC32ISel::emitGEPOperation(MachineBasicBlock *MBB,
3621 MachineBasicBlock::iterator IP,
Nate Begeman645495d2004-09-23 05:31:33 +00003622 GetElementPtrInst *GEPI, bool GEPIsFolded) {
3623 // If we've already emitted this particular GEP, just return to avoid
3624 // multiple definitions of the base register.
Nate Begemana41fc772004-09-29 02:35:05 +00003625 if (GEPIsFolded && (GEPMap[GEPI].base != 0))
Nate Begeman645495d2004-09-23 05:31:33 +00003626 return;
Nate Begeman645495d2004-09-23 05:31:33 +00003627
3628 Value *Src = GEPI->getOperand(0);
3629 User::op_iterator IdxBegin = GEPI->op_begin()+1;
3630 User::op_iterator IdxEnd = GEPI->op_end();
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003631 const TargetData &TD = TM.getTargetData();
3632 const Type *Ty = Src->getType();
Misha Brukmane2eceb52004-07-23 16:08:20 +00003633 int64_t constValue = 0;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003634
3635 // Record the operations to emit the GEP in a vector so that we can emit them
3636 // after having analyzed the entire instruction.
Misha Brukmanb097f212004-07-26 18:13:24 +00003637 std::vector<CollapsedGepOp> ops;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003638
Misha Brukman1013ef52004-07-21 20:09:08 +00003639 // GEPs have zero or more indices; we must perform a struct access
3640 // or array access for each one.
3641 for (GetElementPtrInst::op_iterator oi = IdxBegin, oe = IdxEnd; oi != oe;
3642 ++oi) {
3643 Value *idx = *oi;
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003644 if (const StructType *StTy = dyn_cast<StructType>(Ty)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00003645 // It's a struct access. idx is the index into the structure,
3646 // which names the field. Use the TargetData structure to
3647 // pick out what the layout of the structure is in memory.
3648 // Use the (constant) structure index's value to find the
3649 // right byte offset from the StructLayout class's list of
3650 // structure member offsets.
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003651 unsigned fieldIndex = cast<ConstantUInt>(idx)->getValue();
Misha Brukmane2eceb52004-07-23 16:08:20 +00003652
3653 // StructType member offsets are always constant values. Add it to the
3654 // running total.
Nate Begeman645495d2004-09-23 05:31:33 +00003655 constValue += TD.getStructLayout(StTy)->MemberOffsets[fieldIndex];
Misha Brukmane2eceb52004-07-23 16:08:20 +00003656
Nate Begeman645495d2004-09-23 05:31:33 +00003657 // The next type is the member of the structure selected by the index.
Misha Brukmane2eceb52004-07-23 16:08:20 +00003658 Ty = StTy->getElementType (fieldIndex);
Nate Begeman645495d2004-09-23 05:31:33 +00003659 } else if (const SequentialType *SqTy = dyn_cast<SequentialType>(Ty)) {
Misha Brukman313efcb2004-07-09 15:45:07 +00003660 // Many GEP instructions use a [cast (int/uint) to LongTy] as their
3661 // operand. Handle this case directly now...
3662 if (CastInst *CI = dyn_cast<CastInst>(idx))
3663 if (CI->getOperand(0)->getType() == Type::IntTy ||
3664 CI->getOperand(0)->getType() == Type::UIntTy)
3665 idx = CI->getOperand(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00003666
Misha Brukmane2eceb52004-07-23 16:08:20 +00003667 // It's an array or pointer access: [ArraySize x ElementType].
3668 // We want to add basePtrReg to (idxReg * sizeof ElementType). First, we
3669 // must find the size of the pointed-to type (Not coincidentally, the next
3670 // type is the type of the elements in the array).
Misha Brukman1013ef52004-07-21 20:09:08 +00003671 Ty = SqTy->getElementType();
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003672 unsigned elementSize = TD.getTypeSize(Ty);
Misha Brukman1013ef52004-07-21 20:09:08 +00003673
Misha Brukmane2eceb52004-07-23 16:08:20 +00003674 if (ConstantInt *C = dyn_cast<ConstantInt>(idx)) {
Misha Brukmane2eceb52004-07-23 16:08:20 +00003675 if (ConstantSInt *CS = dyn_cast<ConstantSInt>(C))
3676 constValue += CS->getValue() * elementSize;
3677 else if (ConstantUInt *CU = dyn_cast<ConstantUInt>(C))
3678 constValue += CU->getValue() * elementSize;
3679 else
3680 assert(0 && "Invalid ConstantInt GEP index type!");
3681 } else {
Nate Begeman645495d2004-09-23 05:31:33 +00003682 // Push current gep state to this point as an add and multiply
3683 ops.push_back(CollapsedGepOp(
3684 ConstantSInt::get(Type::IntTy, constValue),
3685 idx, ConstantUInt::get(Type::UIntTy, elementSize)));
3686
Misha Brukmane2eceb52004-07-23 16:08:20 +00003687 constValue = 0;
Misha Brukman313efcb2004-07-09 15:45:07 +00003688 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003689 }
Misha Brukmane2eceb52004-07-23 16:08:20 +00003690 }
Misha Brukmane2eceb52004-07-23 16:08:20 +00003691 // Emit instructions for all the collapsed ops
Nate Begeman645495d2004-09-23 05:31:33 +00003692 unsigned indexReg = 0;
Misha Brukmanb097f212004-07-26 18:13:24 +00003693 for(std::vector<CollapsedGepOp>::iterator cgo_i = ops.begin(),
Misha Brukmane2eceb52004-07-23 16:08:20 +00003694 cgo_e = ops.end(); cgo_i != cgo_e; ++cgo_i) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003695 CollapsedGepOp& cgo = *cgo_i;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003696
Nate Begeman645495d2004-09-23 05:31:33 +00003697 unsigned TmpReg1 = makeAnotherReg(Type::IntTy);
3698 unsigned TmpReg2 = makeAnotherReg(Type::IntTy);
3699 doMultiplyConst(MBB, IP, TmpReg1, cgo.index, cgo.size);
Nate Begemanb816f022004-10-07 22:30:03 +00003700 emitBinaryConstOperation(MBB, IP, TmpReg1, cgo.offset, 0, TmpReg2);
Nate Begeman645495d2004-09-23 05:31:33 +00003701
3702 if (indexReg == 0)
3703 indexReg = TmpReg2;
3704 else {
3705 unsigned TmpReg3 = makeAnotherReg(Type::IntTy);
3706 BuildMI(*MBB, IP, PPC::ADD, 2, TmpReg3).addReg(indexReg).addReg(TmpReg2);
3707 indexReg = TmpReg3;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003708 }
Misha Brukman2fec9902004-06-21 20:22:03 +00003709 }
Nate Begeman645495d2004-09-23 05:31:33 +00003710
3711 // We now have a base register, an index register, and possibly a constant
3712 // remainder. If the GEP is going to be folded, we try to generate the
3713 // optimal addressing mode.
3714 unsigned TargetReg = getReg(GEPI, MBB, IP);
3715 unsigned basePtrReg = getReg(Src, MBB, IP);
Misha Brukmane2eceb52004-07-23 16:08:20 +00003716 ConstantSInt *remainder = ConstantSInt::get(Type::IntTy, constValue);
3717
Misha Brukmanb097f212004-07-26 18:13:24 +00003718 // If we are emitting this during a fold, copy the current base register to
3719 // the target, and save the current constant offset so the folding load or
3720 // store can try and use it as an immediate.
3721 if (GEPIsFolded) {
Nate Begeman645495d2004-09-23 05:31:33 +00003722 if (indexReg == 0) {
Nate Begemanb816f022004-10-07 22:30:03 +00003723 if (!canUseAsImmediateForOpcode(remainder, 0, false)) {
Nate Begeman645495d2004-09-23 05:31:33 +00003724 indexReg = getReg(remainder, MBB, IP);
3725 remainder = 0;
Nate Begemanb64af912004-08-10 20:42:36 +00003726 }
Nate Begeman645495d2004-09-23 05:31:33 +00003727 } else {
3728 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Nate Begemanb816f022004-10-07 22:30:03 +00003729 emitBinaryConstOperation(MBB, IP, indexReg, remainder, 0, TmpReg);
Nate Begeman645495d2004-09-23 05:31:33 +00003730 indexReg = TmpReg;
3731 remainder = 0;
Nate Begemanb64af912004-08-10 20:42:36 +00003732 }
Misha Brukman5b570812004-08-10 22:47:03 +00003733 BuildMI (*MBB, IP, PPC::OR, 2, TargetReg).addReg(basePtrReg)
Nate Begemanb64af912004-08-10 20:42:36 +00003734 .addReg(basePtrReg);
Nate Begeman645495d2004-09-23 05:31:33 +00003735 GEPMap[GEPI] = FoldedGEP(TargetReg, indexReg, remainder);
Misha Brukmanb097f212004-07-26 18:13:24 +00003736 return;
3737 }
Nate Begemanb64af912004-08-10 20:42:36 +00003738
Nate Begeman645495d2004-09-23 05:31:33 +00003739 // We're not folding, so collapse the base, index, and any remainder into the
3740 // destination register.
3741 if (indexReg != 0) {
Nate Begemanb64af912004-08-10 20:42:36 +00003742 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Nate Begeman645495d2004-09-23 05:31:33 +00003743 BuildMI(*MBB, IP, PPC::ADD, 2, TmpReg).addReg(indexReg).addReg(basePtrReg);
Nate Begemanb64af912004-08-10 20:42:36 +00003744 basePtrReg = TmpReg;
3745 }
Nate Begemanb816f022004-10-07 22:30:03 +00003746 emitBinaryConstOperation(MBB, IP, basePtrReg, remainder, 0, TargetReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003747}
3748
3749/// visitAllocaInst - If this is a fixed size alloca, allocate space from the
3750/// frame manager, otherwise do it the hard way.
3751///
Misha Brukmana1dca552004-09-21 18:22:19 +00003752void PPC32ISel::visitAllocaInst(AllocaInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003753 // If this is a fixed size alloca in the entry block for the function, we
3754 // statically stack allocate the space, so we don't need to do anything here.
3755 //
3756 if (dyn_castFixedAlloca(&I)) return;
3757
3758 // Find the data size of the alloca inst's getAllocatedType.
3759 const Type *Ty = I.getAllocatedType();
3760 unsigned TySize = TM.getTargetData().getTypeSize(Ty);
3761
3762 // Create a register to hold the temporary result of multiplying the type size
3763 // constant by the variable amount.
3764 unsigned TotalSizeReg = makeAnotherReg(Type::UIntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003765
3766 // TotalSizeReg = mul <numelements>, <TypeSize>
3767 MachineBasicBlock::iterator MBBI = BB->end();
Misha Brukman1013ef52004-07-21 20:09:08 +00003768 ConstantUInt *CUI = ConstantUInt::get(Type::UIntTy, TySize);
3769 doMultiplyConst(BB, MBBI, TotalSizeReg, I.getArraySize(), CUI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003770
3771 // AddedSize = add <TotalSizeReg>, 15
3772 unsigned AddedSizeReg = makeAnotherReg(Type::UIntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003773 BuildMI(BB, PPC::ADDI, 2, AddedSizeReg).addReg(TotalSizeReg).addSImm(15);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003774
3775 // AlignedSize = and <AddedSize>, ~15
3776 unsigned AlignedSize = makeAnotherReg(Type::UIntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003777 BuildMI(BB, PPC::RLWINM, 4, AlignedSize).addReg(AddedSizeReg).addImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00003778 .addImm(0).addImm(27);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003779
3780 // Subtract size from stack pointer, thereby allocating some space.
Misha Brukman5b570812004-08-10 22:47:03 +00003781 BuildMI(BB, PPC::SUB, 2, PPC::R1).addReg(PPC::R1).addReg(AlignedSize);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003782
3783 // Put a pointer to the space into the result register, by copying
3784 // the stack pointer.
Misha Brukman5b570812004-08-10 22:47:03 +00003785 BuildMI(BB, PPC::OR, 2, getReg(I)).addReg(PPC::R1).addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003786
3787 // Inform the Frame Information that we have just allocated a variable-sized
3788 // object.
3789 F->getFrameInfo()->CreateVariableSizedObject();
3790}
3791
3792/// visitMallocInst - Malloc instructions are code generated into direct calls
3793/// to the library malloc.
3794///
Misha Brukmana1dca552004-09-21 18:22:19 +00003795void PPC32ISel::visitMallocInst(MallocInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003796 unsigned AllocSize = TM.getTargetData().getTypeSize(I.getAllocatedType());
3797 unsigned Arg;
3798
3799 if (ConstantUInt *C = dyn_cast<ConstantUInt>(I.getOperand(0))) {
3800 Arg = getReg(ConstantUInt::get(Type::UIntTy, C->getValue() * AllocSize));
3801 } else {
3802 Arg = makeAnotherReg(Type::UIntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003803 MachineBasicBlock::iterator MBBI = BB->end();
Misha Brukman1013ef52004-07-21 20:09:08 +00003804 ConstantUInt *CUI = ConstantUInt::get(Type::UIntTy, AllocSize);
3805 doMultiplyConst(BB, MBBI, Arg, I.getOperand(0), CUI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003806 }
3807
3808 std::vector<ValueRecord> Args;
3809 Args.push_back(ValueRecord(Arg, Type::UIntTy));
Misha Brukman2fec9902004-06-21 20:22:03 +00003810 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003811 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(mallocFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003812 doCall(ValueRecord(getReg(I), I.getType()), TheCall, Args, false);
Misha Brukmane2eceb52004-07-23 16:08:20 +00003813 TM.CalledFunctions.insert(mallocFn);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003814}
3815
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003816/// visitFreeInst - Free instructions are code gen'd to call the free libc
3817/// function.
3818///
Misha Brukmana1dca552004-09-21 18:22:19 +00003819void PPC32ISel::visitFreeInst(FreeInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003820 std::vector<ValueRecord> Args;
3821 Args.push_back(ValueRecord(I.getOperand(0)));
Misha Brukman2fec9902004-06-21 20:22:03 +00003822 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003823 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(freeFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003824 doCall(ValueRecord(0, Type::VoidTy), TheCall, Args, false);
Misha Brukmane2eceb52004-07-23 16:08:20 +00003825 TM.CalledFunctions.insert(freeFn);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003826}
3827
Misha Brukman3d9a6c22004-08-11 00:09:42 +00003828/// createPPC32ISelSimple - This pass converts an LLVM function into a machine
3829/// code representation is a very simple peep-hole fashion.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003830///
Misha Brukman3d9a6c22004-08-11 00:09:42 +00003831FunctionPass *llvm::createPPC32ISelSimple(TargetMachine &TM) {
Misha Brukmana1dca552004-09-21 18:22:19 +00003832 return new PPC32ISel(TM);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003833}