blob: 1314087b7f98e5cb823de5a1093df56dcb42b4c3 [file] [log] [blame]
Misha Brukmanf2ccb772004-08-17 04:55:41 +00001//===-- PPC32ISelSimple.cpp - A simple instruction selector PowerPC32 -----===//
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002//
3// The LLVM Compiler Infrastructure
4//
5// This file was developed by the LLVM research group and is distributed under
6// the University of Illinois Open Source License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
Misha Brukman98649d12004-06-24 21:54:47 +000010#define DEBUG_TYPE "isel"
Misha Brukman5dfe3a92004-06-21 16:55:25 +000011#include "PowerPC.h"
12#include "PowerPCInstrBuilder.h"
13#include "PowerPCInstrInfo.h"
Misha Brukman3d9a6c22004-08-11 00:09:42 +000014#include "PPC32TargetMachine.h"
Misha Brukman5dfe3a92004-06-21 16:55:25 +000015#include "llvm/Constants.h"
16#include "llvm/DerivedTypes.h"
17#include "llvm/Function.h"
18#include "llvm/Instructions.h"
Misha Brukman5dfe3a92004-06-21 16:55:25 +000019#include "llvm/Pass.h"
Misha Brukman8c9f5202004-06-21 18:30:31 +000020#include "llvm/CodeGen/IntrinsicLowering.h"
Misha Brukman5dfe3a92004-06-21 16:55:25 +000021#include "llvm/CodeGen/MachineConstantPool.h"
22#include "llvm/CodeGen/MachineFrameInfo.h"
23#include "llvm/CodeGen/MachineFunction.h"
24#include "llvm/CodeGen/SSARegMap.h"
25#include "llvm/Target/MRegisterInfo.h"
26#include "llvm/Target/TargetMachine.h"
27#include "llvm/Support/GetElementPtrTypeIterator.h"
28#include "llvm/Support/InstVisitor.h"
Reid Spencer551ccae2004-09-01 22:55:40 +000029#include "llvm/Support/Debug.h"
30#include "llvm/ADT/Statistic.h"
Misha Brukman98649d12004-06-24 21:54:47 +000031#include <vector>
Misha Brukman5dfe3a92004-06-21 16:55:25 +000032using namespace llvm;
33
34namespace {
Misha Brukman422791f2004-06-21 17:41:12 +000035 /// TypeClass - Used by the PowerPC backend to group LLVM types by their basic
36 /// PPC Representation.
Misha Brukman5dfe3a92004-06-21 16:55:25 +000037 ///
38 enum TypeClass {
Misha Brukman7e898c32004-07-20 00:41:46 +000039 cByte, cShort, cInt, cFP32, cFP64, cLong
Misha Brukman5dfe3a92004-06-21 16:55:25 +000040 };
41}
42
43/// getClass - Turn a primitive type into a "class" number which is based on the
44/// size of the type, and whether or not it is floating point.
45///
46static inline TypeClass getClass(const Type *Ty) {
Misha Brukman358829f2004-06-21 17:25:55 +000047 switch (Ty->getTypeID()) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +000048 case Type::SByteTyID:
49 case Type::UByteTyID: return cByte; // Byte operands are class #0
50 case Type::ShortTyID:
51 case Type::UShortTyID: return cShort; // Short operands are class #1
52 case Type::IntTyID:
53 case Type::UIntTyID:
Misha Brukman2834a4d2004-07-07 20:07:22 +000054 case Type::PointerTyID: return cInt; // Ints and pointers are class #2
Misha Brukman5dfe3a92004-06-21 16:55:25 +000055
Misha Brukman7e898c32004-07-20 00:41:46 +000056 case Type::FloatTyID: return cFP32; // Single float is #3
57 case Type::DoubleTyID: return cFP64; // Double Point is #4
Misha Brukman5dfe3a92004-06-21 16:55:25 +000058
59 case Type::LongTyID:
Misha Brukman7e898c32004-07-20 00:41:46 +000060 case Type::ULongTyID: return cLong; // Longs are class #5
Misha Brukman5dfe3a92004-06-21 16:55:25 +000061 default:
62 assert(0 && "Invalid type to getClass!");
63 return cByte; // not reached
64 }
65}
66
67// getClassB - Just like getClass, but treat boolean values as ints.
68static inline TypeClass getClassB(const Type *Ty) {
Nate Begemanb73a7112004-08-13 09:32:01 +000069 if (Ty == Type::BoolTy) return cByte;
Misha Brukman5dfe3a92004-06-21 16:55:25 +000070 return getClass(Ty);
71}
72
73namespace {
Misha Brukmana1dca552004-09-21 18:22:19 +000074 struct PPC32ISel : public FunctionPass, InstVisitor<PPC32ISel> {
Misha Brukman3d9a6c22004-08-11 00:09:42 +000075 PPC32TargetMachine &TM;
Misha Brukman5dfe3a92004-06-21 16:55:25 +000076 MachineFunction *F; // The function we are compiling into
77 MachineBasicBlock *BB; // The current MBB we are compiling
78 int VarArgsFrameIndex; // FrameIndex for start of varargs area
Misha Brukmanb097f212004-07-26 18:13:24 +000079
Nate Begeman645495d2004-09-23 05:31:33 +000080 /// CollapsedGepOp - This struct is for recording the intermediate results
81 /// used to calculate the base, index, and offset of a GEP instruction.
82 struct CollapsedGepOp {
83 ConstantSInt *offset; // the current offset into the struct/array
84 Value *index; // the index of the array element
85 ConstantUInt *size; // the size of each array element
86 CollapsedGepOp(ConstantSInt *o, Value *i, ConstantUInt *s) :
87 offset(o), index(i), size(s) {}
88 };
89
90 /// FoldedGEP - This struct is for recording the necessary information to
91 /// emit the GEP in a load or store instruction, used by emitGEPOperation.
92 struct FoldedGEP {
93 unsigned base;
94 unsigned index;
95 ConstantSInt *offset;
96 FoldedGEP() : base(0), index(0), offset(0) {}
97 FoldedGEP(unsigned b, unsigned i, ConstantSInt *o) :
98 base(b), index(i), offset(o) {}
99 };
Nate Begeman905a2912004-10-24 10:33:30 +0000100
101 /// RlwimiRec - This struct is for recording the arguments to a PowerPC
102 /// rlwimi instruction to be output for a particular Instruction::Or when
103 /// we recognize the pattern for rlwimi, starting with a shift or and.
104 struct RlwimiRec {
105 Value *Target, *Insert;
106 unsigned Shift, MB, ME;
107 RlwimiRec() : Target(0), Insert(0), Shift(0), MB(0), ME(0) {}
108 RlwimiRec(Value *tgt, Value *ins, unsigned s, unsigned b, unsigned e) :
109 Target(tgt), Insert(ins), Shift(s), MB(b), ME(e) {}
Nate Begeman1b750222004-10-17 05:19:20 +0000110 };
Nate Begeman905a2912004-10-24 10:33:30 +0000111
Misha Brukman2834a4d2004-07-07 20:07:22 +0000112 // External functions used in the Module
Nate Begemanb64af912004-08-10 20:42:36 +0000113 Function *fmodfFn, *fmodFn, *__cmpdi2Fn, *__moddi3Fn, *__divdi3Fn,
114 *__umoddi3Fn, *__udivdi3Fn, *__fixsfdiFn, *__fixdfdiFn, *__fixunssfdiFn,
115 *__fixunsdfdiFn, *__floatdisfFn, *__floatdidfFn, *mallocFn, *freeFn;
Misha Brukman2834a4d2004-07-07 20:07:22 +0000116
Nate Begeman645495d2004-09-23 05:31:33 +0000117 // Mapping between Values and SSA Regs
118 std::map<Value*, unsigned> RegMap;
119
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000120 // MBBMap - Mapping between LLVM BB -> Machine BB
121 std::map<const BasicBlock*, MachineBasicBlock*> MBBMap;
122
123 // AllocaMap - Mapping from fixed sized alloca instructions to the
124 // FrameIndex for the alloca.
125 std::map<AllocaInst*, unsigned> AllocaMap;
126
Nate Begeman645495d2004-09-23 05:31:33 +0000127 // GEPMap - Mapping between basic blocks and GEP definitions
128 std::map<GetElementPtrInst*, FoldedGEP> GEPMap;
Nate Begeman1b750222004-10-17 05:19:20 +0000129
130 // RlwimiMap - Mapping between BinaryOperand (Or) instructions and info
131 // needed to properly emit a rlwimi instruction in its place.
Nate Begeman905a2912004-10-24 10:33:30 +0000132 std::map<Instruction *, RlwimiRec> InsertMap;
133
134 // A rlwimi instruction is the combination of at least three instructions.
135 // Keep a vector of instructions to skip around so that we do not try to
136 // emit instructions that were folded into a rlwimi.
Nate Begeman1b750222004-10-17 05:19:20 +0000137 std::vector<Instruction *> SkipList;
Nate Begeman645495d2004-09-23 05:31:33 +0000138
Misha Brukmanb097f212004-07-26 18:13:24 +0000139 // A Reg to hold the base address used for global loads and stores, and a
140 // flag to set whether or not we need to emit it for this function.
141 unsigned GlobalBaseReg;
142 bool GlobalBaseInitialized;
143
Misha Brukmana1dca552004-09-21 18:22:19 +0000144 PPC32ISel(TargetMachine &tm):TM(reinterpret_cast<PPC32TargetMachine&>(tm)),
Misha Brukmane2eceb52004-07-23 16:08:20 +0000145 F(0), BB(0) {}
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000146
Misha Brukman2834a4d2004-07-07 20:07:22 +0000147 bool doInitialization(Module &M) {
Misha Brukmanb0932592004-07-07 15:36:18 +0000148 // Add external functions that we may call
Nate Begemanb64af912004-08-10 20:42:36 +0000149 Type *i = Type::IntTy;
Misha Brukman2834a4d2004-07-07 20:07:22 +0000150 Type *d = Type::DoubleTy;
Misha Brukmanf3f63822004-07-08 19:41:16 +0000151 Type *f = Type::FloatTy;
Misha Brukman2834a4d2004-07-07 20:07:22 +0000152 Type *l = Type::LongTy;
153 Type *ul = Type::ULongTy;
Misha Brukman313efcb2004-07-09 15:45:07 +0000154 Type *voidPtr = PointerType::get(Type::SByteTy);
Misha Brukman7e898c32004-07-20 00:41:46 +0000155 // float fmodf(float, float);
156 fmodfFn = M.getOrInsertFunction("fmodf", f, f, f, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000157 // double fmod(double, double);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000158 fmodFn = M.getOrInsertFunction("fmod", d, d, d, 0);
Nate Begemanb64af912004-08-10 20:42:36 +0000159 // int __cmpdi2(long, long);
160 __cmpdi2Fn = M.getOrInsertFunction("__cmpdi2", i, l, l, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000161 // long __moddi3(long, long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000162 __moddi3Fn = M.getOrInsertFunction("__moddi3", l, l, l, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000163 // long __divdi3(long, long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000164 __divdi3Fn = M.getOrInsertFunction("__divdi3", l, l, l, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000165 // unsigned long __umoddi3(unsigned long, unsigned long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000166 __umoddi3Fn = M.getOrInsertFunction("__umoddi3", ul, ul, ul, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000167 // unsigned long __udivdi3(unsigned long, unsigned long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000168 __udivdi3Fn = M.getOrInsertFunction("__udivdi3", ul, ul, ul, 0);
Misha Brukman7e898c32004-07-20 00:41:46 +0000169 // long __fixsfdi(float)
Nate Begemanb64af912004-08-10 20:42:36 +0000170 __fixsfdiFn = M.getOrInsertFunction("__fixsfdi", l, f, 0);
Misha Brukmanf3f63822004-07-08 19:41:16 +0000171 // long __fixdfdi(double)
172 __fixdfdiFn = M.getOrInsertFunction("__fixdfdi", l, d, 0);
Nate Begemanb64af912004-08-10 20:42:36 +0000173 // unsigned long __fixunssfdi(float)
174 __fixunssfdiFn = M.getOrInsertFunction("__fixunssfdi", ul, f, 0);
175 // unsigned long __fixunsdfdi(double)
176 __fixunsdfdiFn = M.getOrInsertFunction("__fixunsdfdi", ul, d, 0);
Misha Brukmanf3f63822004-07-08 19:41:16 +0000177 // float __floatdisf(long)
178 __floatdisfFn = M.getOrInsertFunction("__floatdisf", f, l, 0);
179 // double __floatdidf(long)
180 __floatdidfFn = M.getOrInsertFunction("__floatdidf", d, l, 0);
Misha Brukman313efcb2004-07-09 15:45:07 +0000181 // void* malloc(size_t)
182 mallocFn = M.getOrInsertFunction("malloc", voidPtr, Type::UIntTy, 0);
183 // void free(void*)
184 freeFn = M.getOrInsertFunction("free", Type::VoidTy, voidPtr, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000185 return false;
186 }
Misha Brukmand18a31d2004-07-06 22:51:53 +0000187
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000188 /// runOnFunction - Top level implementation of instruction selection for
189 /// the entire function.
190 ///
191 bool runOnFunction(Function &Fn) {
192 // First pass over the function, lower any unknown intrinsic functions
193 // with the IntrinsicLowering class.
194 LowerUnknownIntrinsicFunctionCalls(Fn);
195
196 F = &MachineFunction::construct(&Fn, TM);
197
198 // Create all of the machine basic blocks for the function...
199 for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I)
200 F->getBasicBlockList().push_back(MBBMap[I] = new MachineBasicBlock(I));
201
202 BB = &F->front();
203
Misha Brukmanb097f212004-07-26 18:13:24 +0000204 // Make sure we re-emit a set of the global base reg if necessary
205 GlobalBaseInitialized = false;
206
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000207 // Copy incoming arguments off of the stack...
208 LoadArgumentsToVirtualRegs(Fn);
209
210 // Instruction select everything except PHI nodes
211 visit(Fn);
212
213 // Select the PHI nodes
214 SelectPHINodes();
215
Nate Begeman645495d2004-09-23 05:31:33 +0000216 GEPMap.clear();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000217 RegMap.clear();
218 MBBMap.clear();
Nate Begeman905a2912004-10-24 10:33:30 +0000219 InsertMap.clear();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000220 AllocaMap.clear();
Nate Begeman1b750222004-10-17 05:19:20 +0000221 SkipList.clear();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000222 F = 0;
223 // We always build a machine code representation for the function
224 return true;
225 }
226
227 virtual const char *getPassName() const {
228 return "PowerPC Simple Instruction Selection";
229 }
230
231 /// visitBasicBlock - This method is called when we are visiting a new basic
232 /// block. This simply creates a new MachineBasicBlock to emit code into
233 /// and adds it to the current MachineFunction. Subsequent visit* for
234 /// instructions will be invoked for all instructions in the basic block.
235 ///
236 void visitBasicBlock(BasicBlock &LLVM_BB) {
237 BB = MBBMap[&LLVM_BB];
238 }
239
240 /// LowerUnknownIntrinsicFunctionCalls - This performs a prepass over the
241 /// function, lowering any calls to unknown intrinsic functions into the
242 /// equivalent LLVM code.
243 ///
244 void LowerUnknownIntrinsicFunctionCalls(Function &F);
245
246 /// LoadArgumentsToVirtualRegs - Load all of the arguments to this function
247 /// from the stack into virtual registers.
248 ///
249 void LoadArgumentsToVirtualRegs(Function &F);
250
251 /// SelectPHINodes - Insert machine code to generate phis. This is tricky
252 /// because we have to generate our sources into the source basic blocks,
253 /// not the current one.
254 ///
255 void SelectPHINodes();
256
257 // Visitation methods for various instructions. These methods simply emit
258 // fixed PowerPC code for each instruction.
259
Chris Lattner289a49a2004-10-16 18:13:47 +0000260 // Control flow operators.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000261 void visitReturnInst(ReturnInst &RI);
262 void visitBranchInst(BranchInst &BI);
Chris Lattner289a49a2004-10-16 18:13:47 +0000263 void visitUnreachableInst(UnreachableInst &UI) {}
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000264
265 struct ValueRecord {
266 Value *Val;
267 unsigned Reg;
268 const Type *Ty;
269 ValueRecord(unsigned R, const Type *T) : Val(0), Reg(R), Ty(T) {}
270 ValueRecord(Value *V) : Val(V), Reg(0), Ty(V->getType()) {}
271 };
Misha Brukmanb097f212004-07-26 18:13:24 +0000272
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000273 void doCall(const ValueRecord &Ret, MachineInstr *CallMI,
Misha Brukmand18a31d2004-07-06 22:51:53 +0000274 const std::vector<ValueRecord> &Args, bool isVarArg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000275 void visitCallInst(CallInst &I);
276 void visitIntrinsicCall(Intrinsic::ID ID, CallInst &I);
277
278 // Arithmetic operators
279 void visitSimpleBinary(BinaryOperator &B, unsigned OpcodeClass);
280 void visitAdd(BinaryOperator &B) { visitSimpleBinary(B, 0); }
281 void visitSub(BinaryOperator &B) { visitSimpleBinary(B, 1); }
282 void visitMul(BinaryOperator &B);
283
284 void visitDiv(BinaryOperator &B) { visitDivRem(B); }
285 void visitRem(BinaryOperator &B) { visitDivRem(B); }
286 void visitDivRem(BinaryOperator &B);
287
288 // Bitwise operators
289 void visitAnd(BinaryOperator &B) { visitSimpleBinary(B, 2); }
290 void visitOr (BinaryOperator &B) { visitSimpleBinary(B, 3); }
291 void visitXor(BinaryOperator &B) { visitSimpleBinary(B, 4); }
292
293 // Comparison operators...
294 void visitSetCondInst(SetCondInst &I);
295 unsigned EmitComparison(unsigned OpNum, Value *Op0, Value *Op1,
296 MachineBasicBlock *MBB,
297 MachineBasicBlock::iterator MBBI);
298 void visitSelectInst(SelectInst &SI);
299
300
301 // Memory Instructions
302 void visitLoadInst(LoadInst &I);
303 void visitStoreInst(StoreInst &I);
304 void visitGetElementPtrInst(GetElementPtrInst &I);
305 void visitAllocaInst(AllocaInst &I);
306 void visitMallocInst(MallocInst &I);
307 void visitFreeInst(FreeInst &I);
308
309 // Other operators
310 void visitShiftInst(ShiftInst &I);
311 void visitPHINode(PHINode &I) {} // PHI nodes handled by second pass
312 void visitCastInst(CastInst &I);
313 void visitVANextInst(VANextInst &I);
314 void visitVAArgInst(VAArgInst &I);
315
316 void visitInstruction(Instruction &I) {
317 std::cerr << "Cannot instruction select: " << I;
318 abort();
319 }
320
Nate Begemanb47321b2004-08-20 09:56:22 +0000321 unsigned ExtendOrClear(MachineBasicBlock *MBB,
322 MachineBasicBlock::iterator IP,
Nate Begemana2de1022004-09-22 04:40:25 +0000323 Value *Op0);
Nate Begemanb47321b2004-08-20 09:56:22 +0000324
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000325 /// promote32 - Make a value 32-bits wide, and put it somewhere.
326 ///
327 void promote32(unsigned targetReg, const ValueRecord &VR);
328
329 /// emitGEPOperation - Common code shared between visitGetElementPtrInst and
330 /// constant expression GEP support.
331 ///
332 void emitGEPOperation(MachineBasicBlock *BB, MachineBasicBlock::iterator IP,
Nate Begeman645495d2004-09-23 05:31:33 +0000333 GetElementPtrInst *GEPI, bool foldGEP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000334
335 /// emitCastOperation - Common code shared between visitCastInst and
336 /// constant expression cast support.
337 ///
338 void emitCastOperation(MachineBasicBlock *BB,MachineBasicBlock::iterator IP,
339 Value *Src, const Type *DestTy, unsigned TargetReg);
340
Nate Begemanb816f022004-10-07 22:30:03 +0000341
Nate Begeman1b750222004-10-17 05:19:20 +0000342 /// emitBitfieldInsert - return true if we were able to fold the sequence of
Nate Begeman905a2912004-10-24 10:33:30 +0000343 /// instructions into a bitfield insert (rlwimi).
Nate Begeman9b508c32004-10-26 03:48:25 +0000344 bool emitBitfieldInsert(User *OpUser, unsigned DestReg);
Nate Begeman905a2912004-10-24 10:33:30 +0000345
346 /// emitBitfieldExtract - return true if we were able to fold the sequence
347 /// of instructions into a bitfield extract (rlwinm).
348 bool emitBitfieldExtract(MachineBasicBlock *MBB,
349 MachineBasicBlock::iterator IP,
Nate Begeman9b508c32004-10-26 03:48:25 +0000350 User *OpUser, unsigned DestReg);
Nate Begeman1b750222004-10-17 05:19:20 +0000351
Nate Begemanb816f022004-10-07 22:30:03 +0000352 /// emitBinaryConstOperation - Used by several functions to emit simple
353 /// arithmetic and logical operations with constants on a register rather
354 /// than a Value.
355 ///
356 void emitBinaryConstOperation(MachineBasicBlock *MBB,
357 MachineBasicBlock::iterator IP,
358 unsigned Op0Reg, ConstantInt *Op1,
359 unsigned Opcode, unsigned DestReg);
360
361 /// emitSimpleBinaryOperation - Implement simple binary operators for
362 /// integral types. OperatorClass is one of: 0 for Add, 1 for Sub,
363 /// 2 for And, 3 for Or, 4 for Xor.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000364 ///
365 void emitSimpleBinaryOperation(MachineBasicBlock *BB,
366 MachineBasicBlock::iterator IP,
Nate Begeman905a2912004-10-24 10:33:30 +0000367 BinaryOperator *BO, Value *Op0, Value *Op1,
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000368 unsigned OperatorClass, unsigned TargetReg);
369
370 /// emitBinaryFPOperation - This method handles emission of floating point
371 /// Add (0), Sub (1), Mul (2), and Div (3) operations.
372 void emitBinaryFPOperation(MachineBasicBlock *BB,
373 MachineBasicBlock::iterator IP,
374 Value *Op0, Value *Op1,
375 unsigned OperatorClass, unsigned TargetReg);
376
377 void emitMultiply(MachineBasicBlock *BB, MachineBasicBlock::iterator IP,
378 Value *Op0, Value *Op1, unsigned TargetReg);
379
Misha Brukman1013ef52004-07-21 20:09:08 +0000380 void doMultiply(MachineBasicBlock *MBB,
381 MachineBasicBlock::iterator IP,
382 unsigned DestReg, Value *Op0, Value *Op1);
383
384 /// doMultiplyConst - This method will multiply the value in Op0Reg by the
385 /// value of the ContantInt *CI
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000386 void doMultiplyConst(MachineBasicBlock *MBB,
Misha Brukman1013ef52004-07-21 20:09:08 +0000387 MachineBasicBlock::iterator IP,
388 unsigned DestReg, Value *Op0, ConstantInt *CI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000389
390 void emitDivRemOperation(MachineBasicBlock *BB,
391 MachineBasicBlock::iterator IP,
392 Value *Op0, Value *Op1, bool isDiv,
393 unsigned TargetReg);
394
395 /// emitSetCCOperation - Common code shared between visitSetCondInst and
396 /// constant expression support.
397 ///
398 void emitSetCCOperation(MachineBasicBlock *BB,
399 MachineBasicBlock::iterator IP,
400 Value *Op0, Value *Op1, unsigned Opcode,
401 unsigned TargetReg);
402
403 /// emitShiftOperation - Common code shared between visitShiftInst and
404 /// constant expression support.
405 ///
406 void emitShiftOperation(MachineBasicBlock *MBB,
407 MachineBasicBlock::iterator IP,
408 Value *Op, Value *ShiftAmount, bool isLeftShift,
Nate Begeman9b508c32004-10-26 03:48:25 +0000409 const Type *ResultTy, ShiftInst *SI,
410 unsigned DestReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000411
412 /// emitSelectOperation - Common code shared between visitSelectInst and the
413 /// constant expression support.
Misha Brukmanb097f212004-07-26 18:13:24 +0000414 ///
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000415 void emitSelectOperation(MachineBasicBlock *MBB,
416 MachineBasicBlock::iterator IP,
417 Value *Cond, Value *TrueVal, Value *FalseVal,
418 unsigned DestReg);
419
Nate Begeman1f5308e2004-11-18 06:51:29 +0000420 /// getGlobalBaseReg - Output the instructions required to put the
421 /// base address to use for accessing globals into a register. Returns the
422 /// register containing the base address.
Misha Brukmanb097f212004-07-26 18:13:24 +0000423 ///
Nate Begeman1f5308e2004-11-18 06:51:29 +0000424 unsigned getGlobalBaseReg(MachineBasicBlock *MBB,
425 MachineBasicBlock::iterator IP);
Misha Brukmanb097f212004-07-26 18:13:24 +0000426
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000427 /// copyConstantToRegister - Output the instructions required to put the
428 /// specified constant into the specified register.
429 ///
430 void copyConstantToRegister(MachineBasicBlock *MBB,
431 MachineBasicBlock::iterator MBBI,
432 Constant *C, unsigned Reg);
433
434 void emitUCOM(MachineBasicBlock *MBB, MachineBasicBlock::iterator MBBI,
435 unsigned LHS, unsigned RHS);
436
437 /// makeAnotherReg - This method returns the next register number we haven't
438 /// yet used.
439 ///
440 /// Long values are handled somewhat specially. They are always allocated
441 /// as pairs of 32 bit integer values. The register number returned is the
Misha Brukman1013ef52004-07-21 20:09:08 +0000442 /// high 32 bits of the long value, and the regNum+1 is the low 32 bits.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000443 ///
444 unsigned makeAnotherReg(const Type *Ty) {
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000445 assert(dynamic_cast<const PPC32RegisterInfo*>(TM.getRegisterInfo()) &&
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000446 "Current target doesn't have PPC reg info??");
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000447 const PPC32RegisterInfo *PPCRI =
448 static_cast<const PPC32RegisterInfo*>(TM.getRegisterInfo());
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000449 if (Ty == Type::LongTy || Ty == Type::ULongTy) {
Nate Begemanb64af912004-08-10 20:42:36 +0000450 const TargetRegisterClass *RC = PPCRI->getRegClassForType(Type::IntTy);
451 // Create the upper part
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000452 F->getSSARegMap()->createVirtualRegister(RC);
Nate Begemanb64af912004-08-10 20:42:36 +0000453 // Create the lower part.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000454 return F->getSSARegMap()->createVirtualRegister(RC)-1;
455 }
456
457 // Add the mapping of regnumber => reg class to MachineFunction
Nate Begemanb64af912004-08-10 20:42:36 +0000458 const TargetRegisterClass *RC = PPCRI->getRegClassForType(Ty);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000459 return F->getSSARegMap()->createVirtualRegister(RC);
460 }
461
462 /// getReg - This method turns an LLVM value into a register number.
463 ///
464 unsigned getReg(Value &V) { return getReg(&V); } // Allow references
465 unsigned getReg(Value *V) {
466 // Just append to the end of the current bb.
467 MachineBasicBlock::iterator It = BB->end();
468 return getReg(V, BB, It);
469 }
470 unsigned getReg(Value *V, MachineBasicBlock *MBB,
471 MachineBasicBlock::iterator IPt);
Misha Brukman1013ef52004-07-21 20:09:08 +0000472
473 /// canUseAsImmediateForOpcode - This method returns whether a ConstantInt
474 /// is okay to use as an immediate argument to a certain binary operation
Nate Begemanb816f022004-10-07 22:30:03 +0000475 bool canUseAsImmediateForOpcode(ConstantInt *CI, unsigned Opcode,
476 bool Shifted);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000477
478 /// getFixedSizedAllocaFI - Return the frame index for a fixed sized alloca
479 /// that is to be statically allocated with the initial stack frame
480 /// adjustment.
481 unsigned getFixedSizedAllocaFI(AllocaInst *AI);
482 };
483}
484
485/// dyn_castFixedAlloca - If the specified value is a fixed size alloca
486/// instruction in the entry block, return it. Otherwise, return a null
487/// pointer.
488static AllocaInst *dyn_castFixedAlloca(Value *V) {
489 if (AllocaInst *AI = dyn_cast<AllocaInst>(V)) {
490 BasicBlock *BB = AI->getParent();
491 if (isa<ConstantUInt>(AI->getArraySize()) && BB ==&BB->getParent()->front())
492 return AI;
493 }
494 return 0;
495}
496
497/// getReg - This method turns an LLVM value into a register number.
498///
Misha Brukmana1dca552004-09-21 18:22:19 +0000499unsigned PPC32ISel::getReg(Value *V, MachineBasicBlock *MBB,
500 MachineBasicBlock::iterator IPt) {
Misha Brukmanba1c1da2004-07-20 00:59:38 +0000501 if (Constant *C = dyn_cast<Constant>(V)) {
Chris Lattnera51e4f62004-07-18 18:45:01 +0000502 unsigned Reg = makeAnotherReg(V->getType());
503 copyConstantToRegister(MBB, IPt, C, Reg);
504 return Reg;
Nate Begeman676dee62004-11-08 02:25:40 +0000505 } else if (CastInst *CI = dyn_cast<CastInst>(V)) {
506 // Do not emit noop casts at all, unless it's a double -> float cast.
507 if (getClassB(CI->getType()) == getClassB(CI->getOperand(0)->getType()))
508 return getReg(CI->getOperand(0), MBB, IPt);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000509 } else if (AllocaInst *AI = dyn_castFixedAlloca(V)) {
510 unsigned Reg = makeAnotherReg(V->getType());
511 unsigned FI = getFixedSizedAllocaFI(AI);
Misha Brukman5b570812004-08-10 22:47:03 +0000512 addFrameReference(BuildMI(*MBB, IPt, PPC::ADDI, 2, Reg), FI, 0, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000513 return Reg;
514 }
515
516 unsigned &Reg = RegMap[V];
517 if (Reg == 0) {
518 Reg = makeAnotherReg(V->getType());
519 RegMap[V] = Reg;
520 }
521
522 return Reg;
523}
524
Misha Brukman1013ef52004-07-21 20:09:08 +0000525/// canUseAsImmediateForOpcode - This method returns whether a ConstantInt
526/// is okay to use as an immediate argument to a certain binary operator.
Nate Begemanb816f022004-10-07 22:30:03 +0000527/// The shifted argument determines if the immediate is suitable to be used with
528/// the PowerPC instructions such as addis which concatenate 16 bits of the
529/// immediate with 16 bits of zeroes.
Misha Brukman1013ef52004-07-21 20:09:08 +0000530///
Nate Begemanb816f022004-10-07 22:30:03 +0000531bool PPC32ISel::canUseAsImmediateForOpcode(ConstantInt *CI, unsigned Opcode,
532 bool Shifted) {
Misha Brukman1013ef52004-07-21 20:09:08 +0000533 ConstantSInt *Op1Cs;
534 ConstantUInt *Op1Cu;
Nate Begemanb816f022004-10-07 22:30:03 +0000535
536 // For shifted immediates, any value with the low halfword cleared may be used
537 if (Shifted) {
Nate Begemanbdf69842004-10-08 02:49:24 +0000538 if (((int32_t)CI->getRawValue() & 0x0000FFFF) == 0)
Nate Begemanb816f022004-10-07 22:30:03 +0000539 return true;
Nate Begemanbdf69842004-10-08 02:49:24 +0000540 else
541 return false;
Nate Begemanb816f022004-10-07 22:30:03 +0000542 }
Nate Begeman28dd2fc2004-11-04 19:43:18 +0000543
544 // Treat subfic like addi for the purposes of constant validation
545 if (Opcode == 5) Opcode = 0;
Misha Brukman1013ef52004-07-21 20:09:08 +0000546
Nate Begeman28dd2fc2004-11-04 19:43:18 +0000547 // addi, subfic, compare, and non-indexed load take SIMM
Nate Begemanb816f022004-10-07 22:30:03 +0000548 bool cond1 = (Opcode < 2)
Nate Begemana41fc772004-09-29 02:35:05 +0000549 && ((int32_t)CI->getRawValue() <= 32767)
550 && ((int32_t)CI->getRawValue() >= -32768);
Misha Brukman1013ef52004-07-21 20:09:08 +0000551
Misha Brukman1013ef52004-07-21 20:09:08 +0000552 // ANDIo, ORI, and XORI take unsigned values
Nate Begemanb816f022004-10-07 22:30:03 +0000553 bool cond2 = (Opcode >= 2)
Misha Brukman2ed17ca2004-07-22 15:58:04 +0000554 && (Op1Cs = dyn_cast<ConstantSInt>(CI))
555 && (Op1Cs->getValue() >= 0)
Nate Begemana41fc772004-09-29 02:35:05 +0000556 && (Op1Cs->getValue() <= 65535);
Misha Brukman1013ef52004-07-21 20:09:08 +0000557
558 // ANDIo, ORI, and XORI take UIMMs, so they can be larger
Nate Begemanb816f022004-10-07 22:30:03 +0000559 bool cond3 = (Opcode >= 2)
Misha Brukman17a90002004-07-21 20:22:06 +0000560 && (Op1Cu = dyn_cast<ConstantUInt>(CI))
561 && (Op1Cu->getValue() <= 65535);
Misha Brukman1013ef52004-07-21 20:09:08 +0000562
Nate Begemanb816f022004-10-07 22:30:03 +0000563 if (cond1 || cond2 || cond3)
Misha Brukman1013ef52004-07-21 20:09:08 +0000564 return true;
565
566 return false;
567}
568
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000569/// getFixedSizedAllocaFI - Return the frame index for a fixed sized alloca
570/// that is to be statically allocated with the initial stack frame
571/// adjustment.
Misha Brukmana1dca552004-09-21 18:22:19 +0000572unsigned PPC32ISel::getFixedSizedAllocaFI(AllocaInst *AI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000573 // Already computed this?
574 std::map<AllocaInst*, unsigned>::iterator I = AllocaMap.lower_bound(AI);
575 if (I != AllocaMap.end() && I->first == AI) return I->second;
576
577 const Type *Ty = AI->getAllocatedType();
578 ConstantUInt *CUI = cast<ConstantUInt>(AI->getArraySize());
579 unsigned TySize = TM.getTargetData().getTypeSize(Ty);
580 TySize *= CUI->getValue(); // Get total allocated size...
581 unsigned Alignment = TM.getTargetData().getTypeAlignment(Ty);
582
583 // Create a new stack object using the frame manager...
584 int FrameIdx = F->getFrameInfo()->CreateStackObject(TySize, Alignment);
585 AllocaMap.insert(I, std::make_pair(AI, FrameIdx));
586 return FrameIdx;
587}
588
589
Nate Begeman1f5308e2004-11-18 06:51:29 +0000590/// getGlobalBaseReg - Output the instructions required to put the
Misha Brukmanb097f212004-07-26 18:13:24 +0000591/// base address to use for accessing globals into a register.
592///
Nate Begeman1f5308e2004-11-18 06:51:29 +0000593unsigned PPC32ISel::getGlobalBaseReg(MachineBasicBlock *MBB,
594 MachineBasicBlock::iterator IP) {
Misha Brukmanb097f212004-07-26 18:13:24 +0000595 if (!GlobalBaseInitialized) {
596 // Insert the set of GlobalBaseReg into the first MBB of the function
597 MachineBasicBlock &FirstMBB = F->front();
598 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
599 GlobalBaseReg = makeAnotherReg(Type::IntTy);
Nate Begemanb7a8f2c2004-09-02 08:13:00 +0000600 BuildMI(FirstMBB, MBBI, PPC::MovePCtoLR, 0, PPC::LR);
Nate Begemanda721e72004-09-27 05:08:17 +0000601 BuildMI(FirstMBB, MBBI, PPC::MFLR, 1, GlobalBaseReg).addReg(PPC::LR);
Misha Brukmanb097f212004-07-26 18:13:24 +0000602 GlobalBaseInitialized = true;
603 }
Nate Begeman1f5308e2004-11-18 06:51:29 +0000604 return GlobalBaseReg;
Misha Brukmanb097f212004-07-26 18:13:24 +0000605}
606
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000607/// copyConstantToRegister - Output the instructions required to put the
608/// specified constant into the specified register.
609///
Misha Brukmana1dca552004-09-21 18:22:19 +0000610void PPC32ISel::copyConstantToRegister(MachineBasicBlock *MBB,
611 MachineBasicBlock::iterator IP,
612 Constant *C, unsigned R) {
Chris Lattner289a49a2004-10-16 18:13:47 +0000613 if (isa<UndefValue>(C)) {
614 BuildMI(*MBB, IP, PPC::IMPLICIT_DEF, 0, R);
615 return;
616 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000617 if (C->getType()->isIntegral()) {
618 unsigned Class = getClassB(C->getType());
619
620 if (Class == cLong) {
Misha Brukmana0af38c2004-07-28 19:13:49 +0000621 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(C)) {
622 uint64_t uval = CUI->getValue();
623 unsigned hiUVal = uval >> 32;
624 unsigned loUVal = uval;
625 ConstantUInt *CUHi = ConstantUInt::get(Type::UIntTy, hiUVal);
626 ConstantUInt *CULo = ConstantUInt::get(Type::UIntTy, loUVal);
627 copyConstantToRegister(MBB, IP, CUHi, R);
628 copyConstantToRegister(MBB, IP, CULo, R+1);
629 return;
630 } else if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(C)) {
631 int64_t sval = CSI->getValue();
632 int hiSVal = sval >> 32;
633 int loSVal = sval;
634 ConstantSInt *CSHi = ConstantSInt::get(Type::IntTy, hiSVal);
635 ConstantSInt *CSLo = ConstantSInt::get(Type::IntTy, loSVal);
636 copyConstantToRegister(MBB, IP, CSHi, R);
637 copyConstantToRegister(MBB, IP, CSLo, R+1);
638 return;
Misha Brukman7e898c32004-07-20 00:41:46 +0000639 } else {
Misha Brukmana0af38c2004-07-28 19:13:49 +0000640 std::cerr << "Unhandled long constant type!\n";
641 abort();
642 }
643 }
644
645 assert(Class <= cInt && "Type not handled yet!");
646
647 // Handle bool
648 if (C->getType() == Type::BoolTy) {
Misha Brukman5b570812004-08-10 22:47:03 +0000649 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(C == ConstantBool::True);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000650 return;
651 }
652
653 // Handle int
654 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(C)) {
655 unsigned uval = CUI->getValue();
656 if (uval < 32768) {
Misha Brukman5b570812004-08-10 22:47:03 +0000657 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(uval);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000658 } else {
659 unsigned Temp = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +0000660 BuildMI(*MBB, IP, PPC::LIS, 1, Temp).addSImm(uval >> 16);
Nate Begemanb816f022004-10-07 22:30:03 +0000661 BuildMI(*MBB, IP, PPC::ORI, 2, R).addReg(Temp).addImm(uval & 0xFFFF);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000662 }
663 return;
664 } else if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(C)) {
665 int sval = CSI->getValue();
666 if (sval < 32768 && sval >= -32768) {
Misha Brukman5b570812004-08-10 22:47:03 +0000667 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(sval);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000668 } else {
669 unsigned Temp = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +0000670 BuildMI(*MBB, IP, PPC::LIS, 1, Temp).addSImm(sval >> 16);
Nate Begemanb816f022004-10-07 22:30:03 +0000671 BuildMI(*MBB, IP, PPC::ORI, 2, R).addReg(Temp).addImm(sval & 0xFFFF);
Misha Brukman7e898c32004-07-20 00:41:46 +0000672 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000673 return;
674 }
Misha Brukmana0af38c2004-07-28 19:13:49 +0000675 std::cerr << "Unhandled integer constant!\n";
676 abort();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000677 } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) {
Misha Brukmand18a31d2004-07-06 22:51:53 +0000678 // We need to spill the constant to memory...
679 MachineConstantPool *CP = F->getConstantPool();
680 unsigned CPI = CP->getConstantPoolIndex(CFP);
681 const Type *Ty = CFP->getType();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000682
Misha Brukmand18a31d2004-07-06 22:51:53 +0000683 assert(Ty == Type::FloatTy || Ty == Type::DoubleTy && "Unknown FP type!");
Misha Brukmanfc879c32004-07-08 18:02:38 +0000684
Misha Brukmanb097f212004-07-26 18:13:24 +0000685 // Load addr of constant to reg; constant is located at base + distance
686 unsigned GlobalBase = makeAnotherReg(Type::IntTy);
Misha Brukmanfc879c32004-07-08 18:02:38 +0000687 unsigned Reg1 = makeAnotherReg(Type::IntTy);
Nate Begeman07a73752004-08-17 07:17:44 +0000688 unsigned Opcode = (Ty == Type::FloatTy) ? PPC::LFS : PPC::LFD;
Misha Brukmanb097f212004-07-26 18:13:24 +0000689 // Move value at base + distance into return reg
Nate Begeman1f5308e2004-11-18 06:51:29 +0000690 BuildMI(*MBB, IP, PPC::LOADHiAddr, 2, Reg1)
691 .addReg(getGlobalBaseReg(MBB, IP)).addConstantPoolIndex(CPI);
Nate Begemaned428532004-09-04 05:00:00 +0000692 BuildMI(*MBB, IP, Opcode, 2, R).addConstantPoolIndex(CPI).addReg(Reg1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000693 } else if (isa<ConstantPointerNull>(C)) {
694 // Copy zero (null pointer) to the register.
Misha Brukman5b570812004-08-10 22:47:03 +0000695 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(0);
Chris Lattner67910e12004-07-18 07:29:35 +0000696 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) {
Misha Brukmanb097f212004-07-26 18:13:24 +0000697 // GV is located at base + distance
Nate Begemaned428532004-09-04 05:00:00 +0000698
Misha Brukmanb097f212004-07-26 18:13:24 +0000699 unsigned GlobalBase = makeAnotherReg(Type::IntTy);
Misha Brukmanba1c1da2004-07-20 00:59:38 +0000700 unsigned TmpReg = makeAnotherReg(GV->getType());
Misha Brukmanb097f212004-07-26 18:13:24 +0000701
702 // Move value at base + distance into return reg
Nate Begeman1f5308e2004-11-18 06:51:29 +0000703 BuildMI(*MBB, IP, PPC::LOADHiAddr, 2, TmpReg)
704 .addReg(getGlobalBaseReg(MBB, IP)).addGlobalAddress(GV);
Chris Lattner6540c6c2004-11-23 05:54:25 +0000705
Nate Begemand4c8bea2004-11-25 07:09:01 +0000706 if (GV->hasWeakLinkage() || GV->isExternal()) {
Chris Lattner6540c6c2004-11-23 05:54:25 +0000707 BuildMI(*MBB, IP, PPC::LWZ, 2, R).addGlobalAddress(GV).addReg(TmpReg);
708 } else {
709 BuildMI(*MBB, IP, PPC::LA, 2, R).addReg(TmpReg).addGlobalAddress(GV);
710 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000711 } else {
Chris Lattner76e2df22004-07-15 02:14:30 +0000712 std::cerr << "Offending constant: " << *C << "\n";
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000713 assert(0 && "Type not handled yet!");
714 }
715}
716
717/// LoadArgumentsToVirtualRegs - Load all of the arguments to this function from
718/// the stack into virtual registers.
Misha Brukmana1dca552004-09-21 18:22:19 +0000719void PPC32ISel::LoadArgumentsToVirtualRegs(Function &Fn) {
Chris Lattner3ea93462004-08-06 06:58:50 +0000720 unsigned ArgOffset = 24;
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000721 unsigned GPR_remaining = 8;
722 unsigned FPR_remaining = 13;
Misha Brukmand18a31d2004-07-06 22:51:53 +0000723 unsigned GPR_idx = 0, FPR_idx = 0;
724 static const unsigned GPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +0000725 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
726 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
Misha Brukmand18a31d2004-07-06 22:51:53 +0000727 };
728 static const unsigned FPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +0000729 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
730 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
Misha Brukmand18a31d2004-07-06 22:51:53 +0000731 };
Misha Brukman422791f2004-06-21 17:41:12 +0000732
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000733 MachineFrameInfo *MFI = F->getFrameInfo();
Misha Brukmand18a31d2004-07-06 22:51:53 +0000734
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000735 for (Function::aiterator I = Fn.abegin(), E = Fn.aend(); I != E; ++I) {
736 bool ArgLive = !I->use_empty();
737 unsigned Reg = ArgLive ? getReg(*I) : 0;
738 int FI; // Frame object index
739
740 switch (getClassB(I->getType())) {
741 case cByte:
742 if (ArgLive) {
Misha Brukmanec6319a2004-07-20 15:51:37 +0000743 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000744 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000745 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]);
746 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000747 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000748 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000749 addFrameReference(BuildMI(BB, PPC::LBZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000750 }
751 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000752 break;
753 case cShort:
754 if (ArgLive) {
Misha Brukmanec6319a2004-07-20 15:51:37 +0000755 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000756 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000757 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]);
758 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000759 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000760 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000761 addFrameReference(BuildMI(BB, PPC::LHZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000762 }
763 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000764 break;
765 case cInt:
766 if (ArgLive) {
767 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000768 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000769 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]);
770 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000771 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000772 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000773 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000774 }
775 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000776 break;
777 case cLong:
778 if (ArgLive) {
779 FI = MFI->CreateFixedObject(8, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000780 if (GPR_remaining > 1) {
Misha Brukman5b570812004-08-10 22:47:03 +0000781 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]);
782 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx+1]);
783 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukman313efcb2004-07-09 15:45:07 +0000784 .addReg(GPR[GPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000785 BuildMI(BB, PPC::OR, 2, Reg+1).addReg(GPR[GPR_idx+1])
Misha Brukman313efcb2004-07-09 15:45:07 +0000786 .addReg(GPR[GPR_idx+1]);
Misha Brukman422791f2004-06-21 17:41:12 +0000787 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000788 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg), FI);
789 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg+1), FI, 4);
Misha Brukman422791f2004-06-21 17:41:12 +0000790 }
791 }
Misha Brukman1013ef52004-07-21 20:09:08 +0000792 // longs require 4 additional bytes and use 2 GPRs
793 ArgOffset += 4;
Misha Brukman422791f2004-06-21 17:41:12 +0000794 if (GPR_remaining > 1) {
Misha Brukman1013ef52004-07-21 20:09:08 +0000795 GPR_remaining--;
Misha Brukman422791f2004-06-21 17:41:12 +0000796 GPR_idx++;
797 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000798 break;
Misha Brukman7e898c32004-07-20 00:41:46 +0000799 case cFP32:
800 if (ArgLive) {
801 FI = MFI->CreateFixedObject(4, ArgOffset);
802
Misha Brukman422791f2004-06-21 17:41:12 +0000803 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000804 BuildMI(BB, PPC::IMPLICIT_DEF, 0, FPR[FPR_idx]);
805 BuildMI(BB, PPC::FMR, 1, Reg).addReg(FPR[FPR_idx]);
Misha Brukmand18a31d2004-07-06 22:51:53 +0000806 FPR_remaining--;
807 FPR_idx++;
Misha Brukman422791f2004-06-21 17:41:12 +0000808 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000809 addFrameReference(BuildMI(BB, PPC::LFS, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000810 }
811 }
Misha Brukman7e898c32004-07-20 00:41:46 +0000812 break;
813 case cFP64:
814 if (ArgLive) {
815 FI = MFI->CreateFixedObject(8, ArgOffset);
816
817 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000818 BuildMI(BB, PPC::IMPLICIT_DEF, 0, FPR[FPR_idx]);
819 BuildMI(BB, PPC::FMR, 1, Reg).addReg(FPR[FPR_idx]);
Misha Brukman7e898c32004-07-20 00:41:46 +0000820 FPR_remaining--;
821 FPR_idx++;
822 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000823 addFrameReference(BuildMI(BB, PPC::LFD, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000824 }
825 }
Misha Brukman7e898c32004-07-20 00:41:46 +0000826
827 // doubles require 4 additional bytes and use 2 GPRs of param space
828 ArgOffset += 4;
829 if (GPR_remaining > 0) {
830 GPR_remaining--;
831 GPR_idx++;
832 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000833 break;
834 default:
835 assert(0 && "Unhandled argument type!");
836 }
837 ArgOffset += 4; // Each argument takes at least 4 bytes on the stack...
Misha Brukman422791f2004-06-21 17:41:12 +0000838 if (GPR_remaining > 0) {
Misha Brukmand18a31d2004-07-06 22:51:53 +0000839 GPR_remaining--; // uses up 2 GPRs
840 GPR_idx++;
Misha Brukman422791f2004-06-21 17:41:12 +0000841 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000842 }
843
844 // If the function takes variable number of arguments, add a frame offset for
845 // the start of the first vararg value... this is used to expand
846 // llvm.va_start.
847 if (Fn.getFunctionType()->isVarArg())
Misha Brukmanb097f212004-07-26 18:13:24 +0000848 VarArgsFrameIndex = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000849}
850
851
852/// SelectPHINodes - Insert machine code to generate phis. This is tricky
853/// because we have to generate our sources into the source basic blocks, not
854/// the current one.
855///
Misha Brukmana1dca552004-09-21 18:22:19 +0000856void PPC32ISel::SelectPHINodes() {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000857 const TargetInstrInfo &TII = *TM.getInstrInfo();
858 const Function &LF = *F->getFunction(); // The LLVM function...
859 for (Function::const_iterator I = LF.begin(), E = LF.end(); I != E; ++I) {
860 const BasicBlock *BB = I;
861 MachineBasicBlock &MBB = *MBBMap[I];
862
863 // Loop over all of the PHI nodes in the LLVM basic block...
864 MachineBasicBlock::iterator PHIInsertPoint = MBB.begin();
865 for (BasicBlock::const_iterator I = BB->begin();
866 PHINode *PN = const_cast<PHINode*>(dyn_cast<PHINode>(I)); ++I) {
867
868 // Create a new machine instr PHI node, and insert it.
869 unsigned PHIReg = getReg(*PN);
870 MachineInstr *PhiMI = BuildMI(MBB, PHIInsertPoint,
Misha Brukman5b570812004-08-10 22:47:03 +0000871 PPC::PHI, PN->getNumOperands(), PHIReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000872
873 MachineInstr *LongPhiMI = 0;
874 if (PN->getType() == Type::LongTy || PN->getType() == Type::ULongTy)
875 LongPhiMI = BuildMI(MBB, PHIInsertPoint,
Misha Brukman5b570812004-08-10 22:47:03 +0000876 PPC::PHI, PN->getNumOperands(), PHIReg+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000877
878 // PHIValues - Map of blocks to incoming virtual registers. We use this
879 // so that we only initialize one incoming value for a particular block,
880 // even if the block has multiple entries in the PHI node.
881 //
882 std::map<MachineBasicBlock*, unsigned> PHIValues;
883
884 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
Misha Brukman313efcb2004-07-09 15:45:07 +0000885 MachineBasicBlock *PredMBB = 0;
886 for (MachineBasicBlock::pred_iterator PI = MBB.pred_begin (),
887 PE = MBB.pred_end (); PI != PE; ++PI)
888 if (PN->getIncomingBlock(i) == (*PI)->getBasicBlock()) {
889 PredMBB = *PI;
890 break;
891 }
892 assert (PredMBB && "Couldn't find incoming machine-cfg edge for phi");
893
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000894 unsigned ValReg;
895 std::map<MachineBasicBlock*, unsigned>::iterator EntryIt =
896 PHIValues.lower_bound(PredMBB);
897
898 if (EntryIt != PHIValues.end() && EntryIt->first == PredMBB) {
899 // We already inserted an initialization of the register for this
900 // predecessor. Recycle it.
901 ValReg = EntryIt->second;
Misha Brukman47225442004-07-23 22:35:49 +0000902 } else {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000903 // Get the incoming value into a virtual register.
904 //
905 Value *Val = PN->getIncomingValue(i);
906
907 // If this is a constant or GlobalValue, we may have to insert code
908 // into the basic block to compute it into a virtual register.
909 if ((isa<Constant>(Val) && !isa<ConstantExpr>(Val)) ||
910 isa<GlobalValue>(Val)) {
911 // Simple constants get emitted at the end of the basic block,
912 // before any terminator instructions. We "know" that the code to
913 // move a constant into a register will never clobber any flags.
914 ValReg = getReg(Val, PredMBB, PredMBB->getFirstTerminator());
915 } else {
916 // Because we don't want to clobber any values which might be in
917 // physical registers with the computation of this constant (which
918 // might be arbitrarily complex if it is a constant expression),
919 // just insert the computation at the top of the basic block.
920 MachineBasicBlock::iterator PI = PredMBB->begin();
Misha Brukman47225442004-07-23 22:35:49 +0000921
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000922 // Skip over any PHI nodes though!
Misha Brukman5b570812004-08-10 22:47:03 +0000923 while (PI != PredMBB->end() && PI->getOpcode() == PPC::PHI)
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000924 ++PI;
Misha Brukman47225442004-07-23 22:35:49 +0000925
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000926 ValReg = getReg(Val, PredMBB, PI);
927 }
928
929 // Remember that we inserted a value for this PHI for this predecessor
930 PHIValues.insert(EntryIt, std::make_pair(PredMBB, ValReg));
931 }
932
933 PhiMI->addRegOperand(ValReg);
934 PhiMI->addMachineBasicBlockOperand(PredMBB);
935 if (LongPhiMI) {
936 LongPhiMI->addRegOperand(ValReg+1);
937 LongPhiMI->addMachineBasicBlockOperand(PredMBB);
938 }
939 }
940
941 // Now that we emitted all of the incoming values for the PHI node, make
942 // sure to reposition the InsertPoint after the PHI that we just added.
943 // This is needed because we might have inserted a constant into this
944 // block, right after the PHI's which is before the old insert point!
945 PHIInsertPoint = LongPhiMI ? LongPhiMI : PhiMI;
946 ++PHIInsertPoint;
947 }
948 }
949}
950
951
952// canFoldSetCCIntoBranchOrSelect - Return the setcc instruction if we can fold
953// it into the conditional branch or select instruction which is the only user
954// of the cc instruction. This is the case if the conditional branch is the
955// only user of the setcc, and if the setcc is in the same basic block as the
Misha Brukman1013ef52004-07-21 20:09:08 +0000956// conditional branch.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000957//
958static SetCondInst *canFoldSetCCIntoBranchOrSelect(Value *V) {
959 if (SetCondInst *SCI = dyn_cast<SetCondInst>(V))
960 if (SCI->hasOneUse()) {
961 Instruction *User = cast<Instruction>(SCI->use_back());
962 if ((isa<BranchInst>(User) || isa<SelectInst>(User)) &&
Misha Brukmanbebde752004-07-16 21:06:24 +0000963 SCI->getParent() == User->getParent())
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000964 return SCI;
965 }
966 return 0;
967}
968
Misha Brukmanb097f212004-07-26 18:13:24 +0000969// canFoldGEPIntoLoadOrStore - Return the GEP instruction if we can fold it into
970// the load or store instruction that is the only user of the GEP.
971//
972static GetElementPtrInst *canFoldGEPIntoLoadOrStore(Value *V) {
Nate Begeman645495d2004-09-23 05:31:33 +0000973 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(V)) {
974 bool AllUsesAreMem = true;
975 for (Value::use_iterator I = GEPI->use_begin(), E = GEPI->use_end();
976 I != E; ++I) {
977 Instruction *User = cast<Instruction>(*I);
978
979 // If the GEP is the target of a store, but not the source, then we are ok
980 // to fold it.
Misha Brukmanb097f212004-07-26 18:13:24 +0000981 if (isa<StoreInst>(User) &&
982 GEPI->getParent() == User->getParent() &&
983 User->getOperand(0) != GEPI &&
Nate Begeman645495d2004-09-23 05:31:33 +0000984 User->getOperand(1) == GEPI)
985 continue;
986
987 // If the GEP is the source of a load, then we're always ok to fold it
Misha Brukmanb097f212004-07-26 18:13:24 +0000988 if (isa<LoadInst>(User) &&
989 GEPI->getParent() == User->getParent() &&
Nate Begeman645495d2004-09-23 05:31:33 +0000990 User->getOperand(0) == GEPI)
991 continue;
992
993 // if we got to this point, than the instruction was not a load or store
994 // that we are capable of folding the GEP into.
995 AllUsesAreMem = false;
996 break;
Misha Brukmanb097f212004-07-26 18:13:24 +0000997 }
Nate Begeman645495d2004-09-23 05:31:33 +0000998 if (AllUsesAreMem)
999 return GEPI;
1000 }
Misha Brukmanb097f212004-07-26 18:13:24 +00001001 return 0;
1002}
1003
1004
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001005// Return a fixed numbering for setcc instructions which does not depend on the
1006// order of the opcodes.
1007//
1008static unsigned getSetCCNumber(unsigned Opcode) {
Misha Brukmane9c65512004-07-06 15:32:44 +00001009 switch (Opcode) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001010 default: assert(0 && "Unknown setcc instruction!");
1011 case Instruction::SetEQ: return 0;
1012 case Instruction::SetNE: return 1;
1013 case Instruction::SetLT: return 2;
1014 case Instruction::SetGE: return 3;
1015 case Instruction::SetGT: return 4;
1016 case Instruction::SetLE: return 5;
1017 }
1018}
1019
Misha Brukmane9c65512004-07-06 15:32:44 +00001020static unsigned getPPCOpcodeForSetCCNumber(unsigned Opcode) {
1021 switch (Opcode) {
1022 default: assert(0 && "Unknown setcc instruction!");
Misha Brukman5b570812004-08-10 22:47:03 +00001023 case Instruction::SetEQ: return PPC::BEQ;
1024 case Instruction::SetNE: return PPC::BNE;
1025 case Instruction::SetLT: return PPC::BLT;
1026 case Instruction::SetGE: return PPC::BGE;
1027 case Instruction::SetGT: return PPC::BGT;
1028 case Instruction::SetLE: return PPC::BLE;
Misha Brukmane9c65512004-07-06 15:32:44 +00001029 }
1030}
1031
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001032/// emitUCOM - emits an unordered FP compare.
Misha Brukmana1dca552004-09-21 18:22:19 +00001033void PPC32ISel::emitUCOM(MachineBasicBlock *MBB, MachineBasicBlock::iterator IP,
1034 unsigned LHS, unsigned RHS) {
Misha Brukman5b570812004-08-10 22:47:03 +00001035 BuildMI(*MBB, IP, PPC::FCMPU, 2, PPC::CR0).addReg(LHS).addReg(RHS);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001036}
1037
Misha Brukmana1dca552004-09-21 18:22:19 +00001038unsigned PPC32ISel::ExtendOrClear(MachineBasicBlock *MBB,
1039 MachineBasicBlock::iterator IP,
Nate Begemana2de1022004-09-22 04:40:25 +00001040 Value *Op0) {
Nate Begeman0e5e5f52004-08-22 08:10:15 +00001041 const Type *CompTy = Op0->getType();
1042 unsigned Reg = getReg(Op0, MBB, IP);
Nate Begemanb47321b2004-08-20 09:56:22 +00001043 unsigned Class = getClassB(CompTy);
1044
Nate Begeman1b99fd32004-09-29 03:45:33 +00001045 // Since we know that boolean values will be either zero or one, we don't
1046 // have to extend or clear them.
1047 if (CompTy == Type::BoolTy)
1048 return Reg;
1049
Nate Begemanb47321b2004-08-20 09:56:22 +00001050 // Before we do a comparison or SetCC, we have to make sure that we truncate
1051 // the source registers appropriately.
1052 if (Class == cByte) {
1053 unsigned TmpReg = makeAnotherReg(CompTy);
1054 if (CompTy->isSigned())
1055 BuildMI(*MBB, IP, PPC::EXTSB, 1, TmpReg).addReg(Reg);
1056 else
1057 BuildMI(*MBB, IP, PPC::RLWINM, 4, TmpReg).addReg(Reg).addImm(0)
1058 .addImm(24).addImm(31);
1059 Reg = TmpReg;
1060 } else if (Class == cShort) {
1061 unsigned TmpReg = makeAnotherReg(CompTy);
1062 if (CompTy->isSigned())
1063 BuildMI(*MBB, IP, PPC::EXTSH, 1, TmpReg).addReg(Reg);
1064 else
1065 BuildMI(*MBB, IP, PPC::RLWINM, 4, TmpReg).addReg(Reg).addImm(0)
1066 .addImm(16).addImm(31);
1067 Reg = TmpReg;
1068 }
1069 return Reg;
1070}
1071
Misha Brukmanbebde752004-07-16 21:06:24 +00001072/// EmitComparison - emits a comparison of the two operands, returning the
1073/// extended setcc code to use. The result is in CR0.
1074///
Misha Brukmana1dca552004-09-21 18:22:19 +00001075unsigned PPC32ISel::EmitComparison(unsigned OpNum, Value *Op0, Value *Op1,
1076 MachineBasicBlock *MBB,
1077 MachineBasicBlock::iterator IP) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001078 // The arguments are already supposed to be of the same type.
1079 const Type *CompTy = Op0->getType();
1080 unsigned Class = getClassB(CompTy);
Nate Begemana2de1022004-09-22 04:40:25 +00001081 unsigned Op0r = ExtendOrClear(MBB, IP, Op0);
Misha Brukmanb097f212004-07-26 18:13:24 +00001082
Misha Brukman1013ef52004-07-21 20:09:08 +00001083 // Use crand for lt, gt and crandc for le, ge
Misha Brukman5b570812004-08-10 22:47:03 +00001084 unsigned CROpcode = (OpNum == 2 || OpNum == 4) ? PPC::CRAND : PPC::CRANDC;
Misha Brukman1013ef52004-07-21 20:09:08 +00001085 // ? cr1[lt] : cr1[gt]
1086 unsigned CR1field = (OpNum == 2 || OpNum == 3) ? 4 : 5;
1087 // ? cr0[lt] : cr0[gt]
1088 unsigned CR0field = (OpNum == 2 || OpNum == 5) ? 0 : 1;
Misha Brukman5b570812004-08-10 22:47:03 +00001089 unsigned Opcode = CompTy->isSigned() ? PPC::CMPW : PPC::CMPLW;
1090 unsigned OpcodeImm = CompTy->isSigned() ? PPC::CMPWI : PPC::CMPLWI;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001091
1092 // Special case handling of: cmp R, i
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001093 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001094 if (Class == cByte || Class == cShort || Class == cInt) {
Misha Brukman1013ef52004-07-21 20:09:08 +00001095 unsigned Op1v = CI->getRawValue() & 0xFFFF;
Nate Begeman43d64ea2004-08-15 06:42:28 +00001096 unsigned OpClass = (CompTy->isSigned()) ? 0 : 2;
1097
Misha Brukman1013ef52004-07-21 20:09:08 +00001098 // Treat compare like ADDI for the purposes of immediate suitability
Nate Begemanb816f022004-10-07 22:30:03 +00001099 if (canUseAsImmediateForOpcode(CI, OpClass, false)) {
Misha Brukman5b570812004-08-10 22:47:03 +00001100 BuildMI(*MBB, IP, OpcodeImm, 2, PPC::CR0).addReg(Op0r).addSImm(Op1v);
Misha Brukman422791f2004-06-21 17:41:12 +00001101 } else {
1102 unsigned Op1r = getReg(Op1, MBB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00001103 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
Misha Brukman422791f2004-06-21 17:41:12 +00001104 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001105 return OpNum;
1106 } else {
1107 assert(Class == cLong && "Unknown integer class!");
1108 unsigned LowCst = CI->getRawValue();
1109 unsigned HiCst = CI->getRawValue() >> 32;
1110 if (OpNum < 2) { // seteq, setne
Misha Brukman1013ef52004-07-21 20:09:08 +00001111 unsigned LoLow = makeAnotherReg(Type::IntTy);
1112 unsigned LoTmp = makeAnotherReg(Type::IntTy);
1113 unsigned HiLow = makeAnotherReg(Type::IntTy);
1114 unsigned HiTmp = makeAnotherReg(Type::IntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001115 unsigned FinalTmp = makeAnotherReg(Type::IntTy);
Misha Brukman47225442004-07-23 22:35:49 +00001116
Misha Brukman5b570812004-08-10 22:47:03 +00001117 BuildMI(*MBB, IP, PPC::XORI, 2, LoLow).addReg(Op0r+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001118 .addImm(LowCst & 0xFFFF);
Misha Brukman5b570812004-08-10 22:47:03 +00001119 BuildMI(*MBB, IP, PPC::XORIS, 2, LoTmp).addReg(LoLow)
Misha Brukman1013ef52004-07-21 20:09:08 +00001120 .addImm(LowCst >> 16);
Misha Brukman5b570812004-08-10 22:47:03 +00001121 BuildMI(*MBB, IP, PPC::XORI, 2, HiLow).addReg(Op0r)
Misha Brukman1013ef52004-07-21 20:09:08 +00001122 .addImm(HiCst & 0xFFFF);
Misha Brukman5b570812004-08-10 22:47:03 +00001123 BuildMI(*MBB, IP, PPC::XORIS, 2, HiTmp).addReg(HiLow)
Misha Brukman1013ef52004-07-21 20:09:08 +00001124 .addImm(HiCst >> 16);
Misha Brukman5b570812004-08-10 22:47:03 +00001125 BuildMI(*MBB, IP, PPC::ORo, 2, FinalTmp).addReg(LoTmp).addReg(HiTmp);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001126 return OpNum;
1127 } else {
Misha Brukmanbebde752004-07-16 21:06:24 +00001128 unsigned ConstReg = makeAnotherReg(CompTy);
Misha Brukmanbebde752004-07-16 21:06:24 +00001129 copyConstantToRegister(MBB, IP, CI, ConstReg);
Misha Brukman47225442004-07-23 22:35:49 +00001130
Misha Brukman1013ef52004-07-21 20:09:08 +00001131 // cr0 = r3 ccOpcode r5 or (r3 == r5 AND r4 ccOpcode r6)
Misha Brukman5b570812004-08-10 22:47:03 +00001132 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r)
Misha Brukmanbebde752004-07-16 21:06:24 +00001133 .addReg(ConstReg);
Misha Brukman5b570812004-08-10 22:47:03 +00001134 BuildMI(*MBB, IP, Opcode, 2, PPC::CR1).addReg(Op0r+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001135 .addReg(ConstReg+1);
Misha Brukman5b570812004-08-10 22:47:03 +00001136 BuildMI(*MBB, IP, PPC::CRAND, 3).addImm(2).addImm(2).addImm(CR1field);
1137 BuildMI(*MBB, IP, PPC::CROR, 3).addImm(CR0field).addImm(CR0field)
Misha Brukman1013ef52004-07-21 20:09:08 +00001138 .addImm(2);
Misha Brukman422791f2004-06-21 17:41:12 +00001139 return OpNum;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001140 }
1141 }
1142 }
1143
1144 unsigned Op1r = getReg(Op1, MBB, IP);
Misha Brukman1013ef52004-07-21 20:09:08 +00001145
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001146 switch (Class) {
1147 default: assert(0 && "Unknown type class!");
1148 case cByte:
1149 case cShort:
1150 case cInt:
Misha Brukman5b570812004-08-10 22:47:03 +00001151 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001152 break;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001153
Misha Brukman7e898c32004-07-20 00:41:46 +00001154 case cFP32:
1155 case cFP64:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001156 emitUCOM(MBB, IP, Op0r, Op1r);
1157 break;
1158
1159 case cLong:
1160 if (OpNum < 2) { // seteq, setne
1161 unsigned LoTmp = makeAnotherReg(Type::IntTy);
1162 unsigned HiTmp = makeAnotherReg(Type::IntTy);
1163 unsigned FinalTmp = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00001164 BuildMI(*MBB, IP, PPC::XOR, 2, HiTmp).addReg(Op0r).addReg(Op1r);
1165 BuildMI(*MBB, IP, PPC::XOR, 2, LoTmp).addReg(Op0r+1).addReg(Op1r+1);
1166 BuildMI(*MBB, IP, PPC::ORo, 2, FinalTmp).addReg(LoTmp).addReg(HiTmp);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001167 break; // Allow the sete or setne to be generated from flags set by OR
1168 } else {
Misha Brukmanbebde752004-07-16 21:06:24 +00001169 unsigned TmpReg1 = makeAnotherReg(Type::IntTy);
1170 unsigned TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman1013ef52004-07-21 20:09:08 +00001171
1172 // cr0 = r3 ccOpcode r5 or (r3 == r5 AND r4 ccOpcode r6)
Misha Brukman5b570812004-08-10 22:47:03 +00001173 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
1174 BuildMI(*MBB, IP, Opcode, 2, PPC::CR1).addReg(Op0r+1).addReg(Op1r+1);
1175 BuildMI(*MBB, IP, PPC::CRAND, 3).addImm(2).addImm(2).addImm(CR1field);
1176 BuildMI(*MBB, IP, PPC::CROR, 3).addImm(CR0field).addImm(CR0field)
Misha Brukman1013ef52004-07-21 20:09:08 +00001177 .addImm(2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001178 return OpNum;
1179 }
1180 }
1181 return OpNum;
1182}
1183
Misha Brukmand18a31d2004-07-06 22:51:53 +00001184/// visitSetCondInst - emit code to calculate the condition via
1185/// EmitComparison(), and possibly store a 0 or 1 to a register as a result
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001186///
Misha Brukmana1dca552004-09-21 18:22:19 +00001187void PPC32ISel::visitSetCondInst(SetCondInst &I) {
Misha Brukmand18a31d2004-07-06 22:51:53 +00001188 if (canFoldSetCCIntoBranchOrSelect(&I))
Misha Brukmane9c65512004-07-06 15:32:44 +00001189 return;
Misha Brukmanbebde752004-07-16 21:06:24 +00001190
Nate Begemana2de1022004-09-22 04:40:25 +00001191 MachineBasicBlock::iterator MI = BB->end();
1192 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
1193 const Type *Ty = Op0->getType();
1194 unsigned Class = getClassB(Ty);
Nate Begemana96c4af2004-08-21 20:42:14 +00001195 unsigned Opcode = I.getOpcode();
Nate Begemana2de1022004-09-22 04:40:25 +00001196 unsigned OpNum = getSetCCNumber(Opcode);
1197 unsigned DestReg = getReg(I);
1198
1199 // If the comparison type is byte, short, or int, then we can emit a
1200 // branchless version of the SetCC that puts 0 (false) or 1 (true) in the
1201 // destination register.
1202 if (Class <= cInt) {
1203 ConstantInt *CI = dyn_cast<ConstantInt>(Op1);
1204
1205 if (CI && CI->getRawValue() == 0) {
Nate Begemana2de1022004-09-22 04:40:25 +00001206 unsigned Op0Reg = ExtendOrClear(BB, MI, Op0);
1207
1208 // comparisons against constant zero and negative one often have shorter
1209 // and/or faster sequences than the set-and-branch general case, handled
1210 // below.
1211 switch(OpNum) {
1212 case 0: { // eq0
1213 unsigned TempReg = makeAnotherReg(Type::IntTy);
1214 BuildMI(*BB, MI, PPC::CNTLZW, 1, TempReg).addReg(Op0Reg);
1215 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(TempReg).addImm(27)
1216 .addImm(5).addImm(31);
1217 break;
1218 }
1219 case 1: { // ne0
1220 unsigned TempReg = makeAnotherReg(Type::IntTy);
1221 BuildMI(*BB, MI, PPC::ADDIC, 2, TempReg).addReg(Op0Reg).addSImm(-1);
1222 BuildMI(*BB, MI, PPC::SUBFE, 2, DestReg).addReg(TempReg).addReg(Op0Reg);
1223 break;
1224 }
1225 case 2: { // lt0, always false if unsigned
1226 if (Ty->isSigned())
1227 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Op0Reg).addImm(1)
1228 .addImm(31).addImm(31);
1229 else
1230 BuildMI(*BB, MI, PPC::LI, 1, DestReg).addSImm(0);
1231 break;
1232 }
1233 case 3: { // ge0, always true if unsigned
1234 if (Ty->isSigned()) {
1235 unsigned TempReg = makeAnotherReg(Type::IntTy);
1236 BuildMI(*BB, MI, PPC::RLWINM, 4, TempReg).addReg(Op0Reg).addImm(1)
1237 .addImm(31).addImm(31);
1238 BuildMI(*BB, MI, PPC::XORI, 2, DestReg).addReg(TempReg).addImm(1);
1239 } else {
1240 BuildMI(*BB, MI, PPC::LI, 1, DestReg).addSImm(1);
1241 }
1242 break;
1243 }
1244 case 4: { // gt0, equivalent to ne0 if unsigned
1245 unsigned Temp1 = makeAnotherReg(Type::IntTy);
1246 unsigned Temp2 = makeAnotherReg(Type::IntTy);
1247 if (Ty->isSigned()) {
1248 BuildMI(*BB, MI, PPC::NEG, 2, Temp1).addReg(Op0Reg);
1249 BuildMI(*BB, MI, PPC::ANDC, 2, Temp2).addReg(Temp1).addReg(Op0Reg);
1250 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp2).addImm(1)
1251 .addImm(31).addImm(31);
1252 } else {
1253 BuildMI(*BB, MI, PPC::ADDIC, 2, Temp1).addReg(Op0Reg).addSImm(-1);
1254 BuildMI(*BB, MI, PPC::SUBFE, 2, DestReg).addReg(Temp1).addReg(Op0Reg);
1255 }
1256 break;
1257 }
1258 case 5: { // le0, equivalent to eq0 if unsigned
1259 unsigned Temp1 = makeAnotherReg(Type::IntTy);
1260 unsigned Temp2 = makeAnotherReg(Type::IntTy);
1261 if (Ty->isSigned()) {
1262 BuildMI(*BB, MI, PPC::NEG, 2, Temp1).addReg(Op0Reg);
1263 BuildMI(*BB, MI, PPC::ORC, 2, Temp2).addReg(Op0Reg).addReg(Temp1);
1264 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp2).addImm(1)
1265 .addImm(31).addImm(31);
1266 } else {
1267 BuildMI(*BB, MI, PPC::CNTLZW, 1, Temp1).addReg(Op0Reg);
1268 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp1).addImm(27)
1269 .addImm(5).addImm(31);
1270 }
1271 break;
1272 }
1273 } // switch
1274 return;
1275 }
1276 }
Nate Begemanb47321b2004-08-20 09:56:22 +00001277 unsigned PPCOpcode = getPPCOpcodeForSetCCNumber(Opcode);
Nate Begemana96c4af2004-08-21 20:42:14 +00001278
1279 // Create an iterator with which to insert the MBB for copying the false value
1280 // and the MBB to hold the PHI instruction for this SetCC.
Misha Brukman425ff242004-07-01 21:34:10 +00001281 MachineBasicBlock *thisMBB = BB;
1282 const BasicBlock *LLVM_BB = BB->getBasicBlock();
Misha Brukman7e898c32004-07-20 00:41:46 +00001283 ilist<MachineBasicBlock>::iterator It = BB;
1284 ++It;
1285
Misha Brukman425ff242004-07-01 21:34:10 +00001286 // thisMBB:
1287 // ...
1288 // cmpTY cr0, r1, r2
Misha Brukman425ff242004-07-01 21:34:10 +00001289 // %TrueValue = li 1
Nate Begemana96c4af2004-08-21 20:42:14 +00001290 // bCC sinkMBB
Nate Begemana2de1022004-09-22 04:40:25 +00001291 EmitComparison(Opcode, Op0, Op1, BB, BB->end());
Misha Brukmane2eceb52004-07-23 16:08:20 +00001292 unsigned TrueValue = makeAnotherReg(I.getType());
Misha Brukman5b570812004-08-10 22:47:03 +00001293 BuildMI(BB, PPC::LI, 1, TrueValue).addSImm(1);
Nate Begemana96c4af2004-08-21 20:42:14 +00001294 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
1295 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
1296 BuildMI(BB, PPCOpcode, 2).addReg(PPC::CR0).addMBB(sinkMBB);
1297 F->getBasicBlockList().insert(It, copy0MBB);
1298 F->getBasicBlockList().insert(It, sinkMBB);
Misha Brukman425ff242004-07-01 21:34:10 +00001299 // Update machine-CFG edges
Nate Begemana96c4af2004-08-21 20:42:14 +00001300 BB->addSuccessor(copy0MBB);
Misha Brukman425ff242004-07-01 21:34:10 +00001301 BB->addSuccessor(sinkMBB);
1302
Misha Brukman1013ef52004-07-21 20:09:08 +00001303 // copy0MBB:
1304 // %FalseValue = li 0
1305 // fallthrough
1306 BB = copy0MBB;
1307 unsigned FalseValue = makeAnotherReg(I.getType());
Misha Brukman5b570812004-08-10 22:47:03 +00001308 BuildMI(BB, PPC::LI, 1, FalseValue).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00001309 // Update machine-CFG edges
1310 BB->addSuccessor(sinkMBB);
1311
Misha Brukman425ff242004-07-01 21:34:10 +00001312 // sinkMBB:
Nate Begemana96c4af2004-08-21 20:42:14 +00001313 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
Misha Brukman425ff242004-07-01 21:34:10 +00001314 // ...
1315 BB = sinkMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00001316 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(FalseValue)
Nate Begemana96c4af2004-08-21 20:42:14 +00001317 .addMBB(copy0MBB).addReg(TrueValue).addMBB(thisMBB);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001318}
1319
Misha Brukmana1dca552004-09-21 18:22:19 +00001320void PPC32ISel::visitSelectInst(SelectInst &SI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001321 unsigned DestReg = getReg(SI);
1322 MachineBasicBlock::iterator MII = BB->end();
Misha Brukman2fec9902004-06-21 20:22:03 +00001323 emitSelectOperation(BB, MII, SI.getCondition(), SI.getTrueValue(),
1324 SI.getFalseValue(), DestReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001325}
1326
1327/// emitSelect - Common code shared between visitSelectInst and the constant
1328/// expression support.
Misha Brukmana1dca552004-09-21 18:22:19 +00001329void PPC32ISel::emitSelectOperation(MachineBasicBlock *MBB,
1330 MachineBasicBlock::iterator IP,
1331 Value *Cond, Value *TrueVal,
1332 Value *FalseVal, unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001333 unsigned SelectClass = getClassB(TrueVal->getType());
Misha Brukman7e898c32004-07-20 00:41:46 +00001334 unsigned Opcode;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001335
Misha Brukmanbebde752004-07-16 21:06:24 +00001336 // See if we can fold the setcc into the select instruction, or if we have
1337 // to get the register of the Cond value
Misha Brukmanbebde752004-07-16 21:06:24 +00001338 if (SetCondInst *SCI = canFoldSetCCIntoBranchOrSelect(Cond)) {
1339 // We successfully folded the setcc into the select instruction.
Misha Brukmanbebde752004-07-16 21:06:24 +00001340 unsigned OpNum = getSetCCNumber(SCI->getOpcode());
Nate Begeman087d5d92004-10-06 09:53:04 +00001341 if (OpNum >= 2 && OpNum <= 5) {
1342 unsigned SetCondClass = getClassB(SCI->getOperand(0)->getType());
1343 if ((SetCondClass == cFP32 || SetCondClass == cFP64) &&
1344 (SelectClass == cFP32 || SelectClass == cFP64)) {
1345 unsigned CondReg = getReg(SCI->getOperand(0), MBB, IP);
1346 unsigned TrueReg = getReg(TrueVal, MBB, IP);
1347 unsigned FalseReg = getReg(FalseVal, MBB, IP);
1348 // if the comparison of the floating point value used to for the select
1349 // is against 0, then we can emit an fsel without subtraction.
1350 ConstantFP *Op1C = dyn_cast<ConstantFP>(SCI->getOperand(1));
1351 if (Op1C && (Op1C->isExactlyValue(-0.0) || Op1C->isExactlyValue(0.0))) {
1352 switch(OpNum) {
1353 case 2: // LT
1354 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(CondReg)
1355 .addReg(FalseReg).addReg(TrueReg);
1356 break;
1357 case 3: // GE == !LT
1358 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(CondReg)
1359 .addReg(TrueReg).addReg(FalseReg);
1360 break;
1361 case 4: { // GT
1362 unsigned NegatedReg = makeAnotherReg(SCI->getOperand(0)->getType());
1363 BuildMI(*MBB, IP, PPC::FNEG, 1, NegatedReg).addReg(CondReg);
1364 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(NegatedReg)
1365 .addReg(FalseReg).addReg(TrueReg);
1366 }
1367 break;
1368 case 5: { // LE == !GT
1369 unsigned NegatedReg = makeAnotherReg(SCI->getOperand(0)->getType());
1370 BuildMI(*MBB, IP, PPC::FNEG, 1, NegatedReg).addReg(CondReg);
1371 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(NegatedReg)
1372 .addReg(TrueReg).addReg(FalseReg);
1373 }
1374 break;
1375 default:
1376 assert(0 && "Invalid SetCC opcode to fsel");
1377 abort();
1378 break;
1379 }
1380 } else {
1381 unsigned OtherCondReg = getReg(SCI->getOperand(1), MBB, IP);
1382 unsigned SelectReg = makeAnotherReg(SCI->getOperand(0)->getType());
1383 switch(OpNum) {
1384 case 2: // LT
1385 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(CondReg)
1386 .addReg(OtherCondReg);
1387 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1388 .addReg(FalseReg).addReg(TrueReg);
1389 break;
1390 case 3: // GE == !LT
1391 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(CondReg)
1392 .addReg(OtherCondReg);
1393 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1394 .addReg(TrueReg).addReg(FalseReg);
1395 break;
1396 case 4: // GT
1397 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(OtherCondReg)
1398 .addReg(CondReg);
1399 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1400 .addReg(FalseReg).addReg(TrueReg);
1401 break;
1402 case 5: // LE == !GT
1403 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(OtherCondReg)
1404 .addReg(CondReg);
1405 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1406 .addReg(TrueReg).addReg(FalseReg);
1407 break;
1408 default:
1409 assert(0 && "Invalid SetCC opcode to fsel");
1410 abort();
1411 break;
1412 }
1413 }
Nate Begeman087d5d92004-10-06 09:53:04 +00001414 return;
1415 }
1416 }
Misha Brukman47225442004-07-23 22:35:49 +00001417 OpNum = EmitComparison(OpNum, SCI->getOperand(0),SCI->getOperand(1),MBB,IP);
Misha Brukmanbebde752004-07-16 21:06:24 +00001418 Opcode = getPPCOpcodeForSetCCNumber(SCI->getOpcode());
1419 } else {
1420 unsigned CondReg = getReg(Cond, MBB, IP);
Nate Begemaned428532004-09-04 05:00:00 +00001421 BuildMI(*MBB, IP, PPC::CMPWI, 2, PPC::CR0).addReg(CondReg).addSImm(0);
Misha Brukmanbebde752004-07-16 21:06:24 +00001422 Opcode = getPPCOpcodeForSetCCNumber(Instruction::SetNE);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001423 }
Misha Brukmanbebde752004-07-16 21:06:24 +00001424
1425 MachineBasicBlock *thisMBB = BB;
1426 const BasicBlock *LLVM_BB = BB->getBasicBlock();
Misha Brukman7e898c32004-07-20 00:41:46 +00001427 ilist<MachineBasicBlock>::iterator It = BB;
1428 ++It;
Misha Brukmanbebde752004-07-16 21:06:24 +00001429
Nate Begemana96c4af2004-08-21 20:42:14 +00001430 // thisMBB:
1431 // ...
1432 // cmpTY cr0, r1, r2
Nate Begeman1f49e862004-09-29 05:00:31 +00001433 // bCC copy1MBB
1434 // fallthrough --> copy0MBB
Misha Brukmanbebde752004-07-16 21:06:24 +00001435 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
Nate Begeman1f49e862004-09-29 05:00:31 +00001436 MachineBasicBlock *copy1MBB = new MachineBasicBlock(LLVM_BB);
Misha Brukman1013ef52004-07-21 20:09:08 +00001437 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
Nate Begeman1f49e862004-09-29 05:00:31 +00001438 BuildMI(BB, Opcode, 2).addReg(PPC::CR0).addMBB(copy1MBB);
Nate Begemana96c4af2004-08-21 20:42:14 +00001439 F->getBasicBlockList().insert(It, copy0MBB);
Nate Begeman1f49e862004-09-29 05:00:31 +00001440 F->getBasicBlockList().insert(It, copy1MBB);
Misha Brukman1013ef52004-07-21 20:09:08 +00001441 F->getBasicBlockList().insert(It, sinkMBB);
Misha Brukmanbebde752004-07-16 21:06:24 +00001442 // Update machine-CFG edges
Misha Brukmanbebde752004-07-16 21:06:24 +00001443 BB->addSuccessor(copy0MBB);
Nate Begeman1f49e862004-09-29 05:00:31 +00001444 BB->addSuccessor(copy1MBB);
Misha Brukmanbebde752004-07-16 21:06:24 +00001445
Misha Brukman1013ef52004-07-21 20:09:08 +00001446 // copy0MBB:
1447 // %FalseValue = ...
Nate Begeman1f49e862004-09-29 05:00:31 +00001448 // b sinkMBB
Misha Brukman1013ef52004-07-21 20:09:08 +00001449 BB = copy0MBB;
1450 unsigned FalseValue = getReg(FalseVal, BB, BB->begin());
Nate Begeman1f49e862004-09-29 05:00:31 +00001451 BuildMI(BB, PPC::B, 1).addMBB(sinkMBB);
1452 // Update machine-CFG edges
1453 BB->addSuccessor(sinkMBB);
1454
1455 // copy1MBB:
1456 // %TrueValue = ...
1457 // fallthrough
1458 BB = copy1MBB;
1459 unsigned TrueValue = getReg(TrueVal, BB, BB->begin());
Misha Brukman1013ef52004-07-21 20:09:08 +00001460 // Update machine-CFG edges
1461 BB->addSuccessor(sinkMBB);
1462
Misha Brukmanbebde752004-07-16 21:06:24 +00001463 // sinkMBB:
Nate Begemana96c4af2004-08-21 20:42:14 +00001464 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
Misha Brukmanbebde752004-07-16 21:06:24 +00001465 // ...
1466 BB = sinkMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00001467 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(FalseValue)
Nate Begeman1f49e862004-09-29 05:00:31 +00001468 .addMBB(copy0MBB).addReg(TrueValue).addMBB(copy1MBB);
Nate Begemana96c4af2004-08-21 20:42:14 +00001469
Misha Brukmana31f1f72004-07-21 20:30:18 +00001470 // For a register pair representing a long value, define the second reg
Nate Begemana96c4af2004-08-21 20:42:14 +00001471 // FIXME: Can this really be correct for selecting longs?
Nate Begeman8d963e62004-08-11 03:30:55 +00001472 if (getClassB(TrueVal->getType()) == cLong)
Misha Brukman5b570812004-08-10 22:47:03 +00001473 BuildMI(BB, PPC::LI, 1, DestReg+1).addImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001474 return;
1475}
1476
1477
1478
1479/// promote32 - Emit instructions to turn a narrow operand into a 32-bit-wide
1480/// operand, in the specified target register.
1481///
Misha Brukmana1dca552004-09-21 18:22:19 +00001482void PPC32ISel::promote32(unsigned targetReg, const ValueRecord &VR) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001483 bool isUnsigned = VR.Ty->isUnsigned() || VR.Ty == Type::BoolTy;
1484
1485 Value *Val = VR.Val;
1486 const Type *Ty = VR.Ty;
1487 if (Val) {
1488 if (Constant *C = dyn_cast<Constant>(Val)) {
1489 Val = ConstantExpr::getCast(C, Type::IntTy);
Chris Lattner74a806c2004-08-11 07:34:50 +00001490 if (isa<ConstantExpr>(Val)) // Could not fold
1491 Val = C;
1492 else
1493 Ty = Type::IntTy; // Folded!
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001494 }
1495
Misha Brukman2fec9902004-06-21 20:22:03 +00001496 // If this is a simple constant, just emit a load directly to avoid the copy
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001497 if (ConstantInt *CI = dyn_cast<ConstantInt>(Val)) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00001498 copyConstantToRegister(BB, BB->end(), CI, targetReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001499 return;
1500 }
1501 }
1502
1503 // Make sure we have the register number for this value...
1504 unsigned Reg = Val ? getReg(Val) : VR.Reg;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001505 switch (getClassB(Ty)) {
1506 case cByte:
1507 // Extend value into target register (8->32)
Nate Begeman1b99fd32004-09-29 03:45:33 +00001508 if (Ty == Type::BoolTy)
1509 BuildMI(BB, PPC::OR, 2, targetReg).addReg(Reg).addReg(Reg);
1510 else if (isUnsigned)
Misha Brukman5b570812004-08-10 22:47:03 +00001511 BuildMI(BB, PPC::RLWINM, 4, targetReg).addReg(Reg).addZImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00001512 .addZImm(24).addZImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001513 else
Misha Brukman5b570812004-08-10 22:47:03 +00001514 BuildMI(BB, PPC::EXTSB, 1, targetReg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001515 break;
1516 case cShort:
1517 // Extend value into target register (16->32)
1518 if (isUnsigned)
Misha Brukman5b570812004-08-10 22:47:03 +00001519 BuildMI(BB, PPC::RLWINM, 4, targetReg).addReg(Reg).addZImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00001520 .addZImm(16).addZImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001521 else
Misha Brukman5b570812004-08-10 22:47:03 +00001522 BuildMI(BB, PPC::EXTSH, 1, targetReg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001523 break;
1524 case cInt:
1525 // Move value into target register (32->32)
Misha Brukman5b570812004-08-10 22:47:03 +00001526 BuildMI(BB, PPC::OR, 2, targetReg).addReg(Reg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001527 break;
1528 default:
1529 assert(0 && "Unpromotable operand class in promote32");
1530 }
1531}
1532
Misha Brukman2fec9902004-06-21 20:22:03 +00001533/// visitReturnInst - implemented with BLR
1534///
Misha Brukmana1dca552004-09-21 18:22:19 +00001535void PPC32ISel::visitReturnInst(ReturnInst &I) {
Misha Brukmand47bbf72004-06-25 19:04:27 +00001536 // Only do the processing if this is a non-void return
1537 if (I.getNumOperands() > 0) {
1538 Value *RetVal = I.getOperand(0);
1539 switch (getClassB(RetVal->getType())) {
1540 case cByte: // integral return values: extend or move into r3 and return
1541 case cShort:
1542 case cInt:
Misha Brukman5b570812004-08-10 22:47:03 +00001543 promote32(PPC::R3, ValueRecord(RetVal));
Misha Brukmand47bbf72004-06-25 19:04:27 +00001544 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001545 case cFP32:
1546 case cFP64: { // Floats & Doubles: Return in f1
Misha Brukmand47bbf72004-06-25 19:04:27 +00001547 unsigned RetReg = getReg(RetVal);
Misha Brukman5b570812004-08-10 22:47:03 +00001548 BuildMI(BB, PPC::FMR, 1, PPC::F1).addReg(RetReg);
Misha Brukmand47bbf72004-06-25 19:04:27 +00001549 break;
1550 }
1551 case cLong: {
1552 unsigned RetReg = getReg(RetVal);
Misha Brukman5b570812004-08-10 22:47:03 +00001553 BuildMI(BB, PPC::OR, 2, PPC::R3).addReg(RetReg).addReg(RetReg);
1554 BuildMI(BB, PPC::OR, 2, PPC::R4).addReg(RetReg+1).addReg(RetReg+1);
Misha Brukmand47bbf72004-06-25 19:04:27 +00001555 break;
1556 }
1557 default:
1558 visitInstruction(I);
1559 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001560 }
Misha Brukman5b570812004-08-10 22:47:03 +00001561 BuildMI(BB, PPC::BLR, 1).addImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001562}
1563
1564// getBlockAfter - Return the basic block which occurs lexically after the
1565// specified one.
1566static inline BasicBlock *getBlockAfter(BasicBlock *BB) {
1567 Function::iterator I = BB; ++I; // Get iterator to next block
1568 return I != BB->getParent()->end() ? &*I : 0;
1569}
1570
1571/// visitBranchInst - Handle conditional and unconditional branches here. Note
1572/// that since code layout is frozen at this point, that if we are trying to
1573/// jump to a block that is the immediate successor of the current block, we can
1574/// just make a fall-through (but we don't currently).
1575///
Misha Brukmana1dca552004-09-21 18:22:19 +00001576void PPC32ISel::visitBranchInst(BranchInst &BI) {
Misha Brukman2fec9902004-06-21 20:22:03 +00001577 // Update machine-CFG edges
Misha Brukmane2eceb52004-07-23 16:08:20 +00001578 BB->addSuccessor(MBBMap[BI.getSuccessor(0)]);
Misha Brukman2fec9902004-06-21 20:22:03 +00001579 if (BI.isConditional())
Misha Brukmane2eceb52004-07-23 16:08:20 +00001580 BB->addSuccessor(MBBMap[BI.getSuccessor(1)]);
Misha Brukman2fec9902004-06-21 20:22:03 +00001581
1582 BasicBlock *NextBB = getBlockAfter(BI.getParent()); // BB after current one
Misha Brukmane9c65512004-07-06 15:32:44 +00001583
Misha Brukman2fec9902004-06-21 20:22:03 +00001584 if (!BI.isConditional()) { // Unconditional branch?
Misha Brukmane9c65512004-07-06 15:32:44 +00001585 if (BI.getSuccessor(0) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001586 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001587 return;
Misha Brukman2fec9902004-06-21 20:22:03 +00001588 }
1589
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001590 // See if we can fold the setcc into the branch itself...
1591 SetCondInst *SCI = canFoldSetCCIntoBranchOrSelect(BI.getCondition());
1592 if (SCI == 0) {
1593 // Nope, cannot fold setcc into this branch. Emit a branch on a condition
1594 // computed some other way...
1595 unsigned condReg = getReg(BI.getCondition());
Misha Brukman5b570812004-08-10 22:47:03 +00001596 BuildMI(BB, PPC::CMPLI, 3, PPC::CR0).addImm(0).addReg(condReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00001597 .addImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001598 if (BI.getSuccessor(1) == NextBB) {
1599 if (BI.getSuccessor(0) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001600 BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(PPC::BNE)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001601 .addMBB(MBBMap[BI.getSuccessor(0)])
1602 .addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001603 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00001604 BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(PPC::BEQ)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001605 .addMBB(MBBMap[BI.getSuccessor(1)])
1606 .addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001607 if (BI.getSuccessor(0) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001608 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001609 }
1610 return;
1611 }
1612
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001613 unsigned OpNum = getSetCCNumber(SCI->getOpcode());
Misha Brukmane9c65512004-07-06 15:32:44 +00001614 unsigned Opcode = getPPCOpcodeForSetCCNumber(SCI->getOpcode());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001615 MachineBasicBlock::iterator MII = BB->end();
1616 OpNum = EmitComparison(OpNum, SCI->getOperand(0), SCI->getOperand(1), BB,MII);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001617
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001618 if (BI.getSuccessor(0) != NextBB) {
Misha Brukman5b570812004-08-10 22:47:03 +00001619 BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(Opcode)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001620 .addMBB(MBBMap[BI.getSuccessor(0)])
1621 .addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001622 if (BI.getSuccessor(1) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001623 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001624 } else {
1625 // Change to the inverse condition...
1626 if (BI.getSuccessor(1) != NextBB) {
Misha Brukmanf2ccb772004-08-17 04:55:41 +00001627 Opcode = PPC32InstrInfo::invertPPCBranchOpcode(Opcode);
Misha Brukman5b570812004-08-10 22:47:03 +00001628 BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(Opcode)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001629 .addMBB(MBBMap[BI.getSuccessor(1)])
1630 .addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001631 }
1632 }
1633}
1634
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001635/// doCall - This emits an abstract call instruction, setting up the arguments
1636/// and the return value as appropriate. For the actual function call itself,
1637/// it inserts the specified CallMI instruction into the stream.
1638///
1639/// FIXME: See Documentation at the following URL for "correct" behavior
1640/// <http://developer.apple.com/documentation/DeveloperTools/Conceptual/MachORuntime/2rt_powerpc_abi/chapter_9_section_5.html>
Misha Brukmana1dca552004-09-21 18:22:19 +00001641void PPC32ISel::doCall(const ValueRecord &Ret, MachineInstr *CallMI,
1642 const std::vector<ValueRecord> &Args, bool isVarArg) {
Chris Lattner3ea93462004-08-06 06:58:50 +00001643 // Count how many bytes are to be pushed on the stack, including the linkage
1644 // area, and parameter passing area.
1645 unsigned NumBytes = 24;
1646 unsigned ArgOffset = 24;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001647
1648 if (!Args.empty()) {
1649 for (unsigned i = 0, e = Args.size(); i != e; ++i)
1650 switch (getClassB(Args[i].Ty)) {
1651 case cByte: case cShort: case cInt:
1652 NumBytes += 4; break;
1653 case cLong:
1654 NumBytes += 8; break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001655 case cFP32:
1656 NumBytes += 4; break;
1657 case cFP64:
1658 NumBytes += 8; break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001659 break;
1660 default: assert(0 && "Unknown class!");
1661 }
1662
Nate Begeman865075e2004-08-16 01:50:22 +00001663 // Just to be safe, we'll always reserve the full 24 bytes of linkage area
1664 // plus 32 bytes of argument space in case any called code gets funky on us.
1665 if (NumBytes < 56) NumBytes = 56;
Chris Lattner3ea93462004-08-06 06:58:50 +00001666
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001667 // Adjust the stack pointer for the new arguments...
Chris Lattner3ea93462004-08-06 06:58:50 +00001668 // These functions are automatically eliminated by the prolog/epilog pass
Misha Brukman5b570812004-08-10 22:47:03 +00001669 BuildMI(BB, PPC::ADJCALLSTACKDOWN, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001670
1671 // Arguments go on the stack in reverse order, as specified by the ABI.
Misha Brukman7e898c32004-07-20 00:41:46 +00001672 // Offset to the paramater area on the stack is 24.
Misha Brukmand18a31d2004-07-06 22:51:53 +00001673 int GPR_remaining = 8, FPR_remaining = 13;
Misha Brukmanfc879c32004-07-08 18:02:38 +00001674 unsigned GPR_idx = 0, FPR_idx = 0;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001675 static const unsigned GPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00001676 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
1677 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001678 };
Misha Brukmand18a31d2004-07-06 22:51:53 +00001679 static const unsigned FPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00001680 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6,
1681 PPC::F7, PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12,
1682 PPC::F13
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001683 };
Misha Brukman422791f2004-06-21 17:41:12 +00001684
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001685 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
1686 unsigned ArgReg;
1687 switch (getClassB(Args[i].Ty)) {
1688 case cByte:
1689 case cShort:
1690 // Promote arg to 32 bits wide into a temporary register...
1691 ArgReg = makeAnotherReg(Type::UIntTy);
1692 promote32(ArgReg, Args[i]);
Misha Brukman422791f2004-06-21 17:41:12 +00001693
1694 // Reg or stack?
1695 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001696 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001697 .addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001698 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001699 }
1700 if (GPR_remaining <= 0 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001701 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1702 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001703 }
1704 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001705 case cInt:
1706 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
1707
Misha Brukman422791f2004-06-21 17:41:12 +00001708 // Reg or stack?
1709 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001710 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001711 .addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001712 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001713 }
1714 if (GPR_remaining <= 0 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001715 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1716 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001717 }
1718 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001719 case cLong:
Misha Brukman422791f2004-06-21 17:41:12 +00001720 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001721
Misha Brukmanec6319a2004-07-20 15:51:37 +00001722 // Reg or stack? Note that PPC calling conventions state that long args
1723 // are passed rN = hi, rN+1 = lo, opposite of LLVM.
Misha Brukman422791f2004-06-21 17:41:12 +00001724 if (GPR_remaining > 1) {
Misha Brukman5b570812004-08-10 22:47:03 +00001725 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanec6319a2004-07-20 15:51:37 +00001726 .addReg(ArgReg);
Misha Brukman5b570812004-08-10 22:47:03 +00001727 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx+1]).addReg(ArgReg+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001728 .addReg(ArgReg+1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001729 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1730 CallMI->addRegOperand(GPR[GPR_idx+1], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001731 }
1732 if (GPR_remaining <= 1 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001733 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1734 .addReg(PPC::R1);
1735 BuildMI(BB, PPC::STW, 3).addReg(ArgReg+1).addSImm(ArgOffset+4)
1736 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001737 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001738
1739 ArgOffset += 4; // 8 byte entry, not 4.
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001740 GPR_remaining -= 1; // uses up 2 GPRs
1741 GPR_idx += 1;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001742 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001743 case cFP32:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001744 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
Misha Brukman7e898c32004-07-20 00:41:46 +00001745 // Reg or stack?
1746 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001747 BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001748 CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use);
1749 FPR_remaining--;
1750 FPR_idx++;
1751
1752 // If this is a vararg function, and there are GPRs left, also
1753 // pass the float in an int. Otherwise, put it on the stack.
1754 if (isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001755 BuildMI(BB, PPC::STFS, 3).addReg(ArgReg).addSImm(ArgOffset)
1756 .addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001757 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001758 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx])
Nate Begeman293d88c2004-08-13 04:45:14 +00001759 .addSImm(ArgOffset).addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001760 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1761 }
Misha Brukman1916bf92004-06-24 21:56:15 +00001762 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001763 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00001764 BuildMI(BB, PPC::STFS, 3).addReg(ArgReg).addSImm(ArgOffset)
1765 .addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001766 }
1767 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001768 case cFP64:
1769 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
1770 // Reg or stack?
1771 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001772 BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001773 CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use);
1774 FPR_remaining--;
1775 FPR_idx++;
1776 // For vararg functions, must pass doubles via int regs as well
1777 if (isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001778 BuildMI(BB, PPC::STFD, 3).addReg(ArgReg).addSImm(ArgOffset)
1779 .addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001780
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001781 // Doubles can be split across reg + stack for varargs
1782 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001783 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx]).addSImm(ArgOffset)
1784 .addReg(PPC::R1);
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001785 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1786 }
1787 if (GPR_remaining > 1) {
Misha Brukman5b570812004-08-10 22:47:03 +00001788 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx+1])
1789 .addSImm(ArgOffset+4).addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001790 CallMI->addRegOperand(GPR[GPR_idx+1], MachineOperand::Use);
1791 }
1792 }
1793 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00001794 BuildMI(BB, PPC::STFD, 3).addReg(ArgReg).addSImm(ArgOffset)
1795 .addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001796 }
1797 // Doubles use 8 bytes, and 2 GPRs worth of param space
1798 ArgOffset += 4;
1799 GPR_remaining--;
1800 GPR_idx++;
1801 break;
1802
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001803 default: assert(0 && "Unknown class!");
1804 }
1805 ArgOffset += 4;
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001806 GPR_remaining--;
1807 GPR_idx++;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001808 }
1809 } else {
Nate Begeman865075e2004-08-16 01:50:22 +00001810 BuildMI(BB, PPC::ADJCALLSTACKDOWN, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001811 }
Nate Begeman43d64ea2004-08-15 06:42:28 +00001812
Misha Brukman5b570812004-08-10 22:47:03 +00001813 BuildMI(BB, PPC::IMPLICIT_DEF, 0, PPC::LR);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001814 BB->push_back(CallMI);
Chris Lattner3ea93462004-08-06 06:58:50 +00001815
1816 // These functions are automatically eliminated by the prolog/epilog pass
Misha Brukman5b570812004-08-10 22:47:03 +00001817 BuildMI(BB, PPC::ADJCALLSTACKUP, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001818
1819 // If there is a return value, scavenge the result from the location the call
1820 // leaves it in...
1821 //
1822 if (Ret.Ty != Type::VoidTy) {
1823 unsigned DestClass = getClassB(Ret.Ty);
1824 switch (DestClass) {
1825 case cByte:
1826 case cShort:
1827 case cInt:
1828 // Integral results are in r3
Misha Brukman5b570812004-08-10 22:47:03 +00001829 BuildMI(BB, PPC::OR, 2, Ret.Reg).addReg(PPC::R3).addReg(PPC::R3);
Misha Brukmane327e492004-06-24 23:53:24 +00001830 break;
Chris Lattner3ea93462004-08-06 06:58:50 +00001831 case cFP32: // Floating-point return values live in f1
Misha Brukman7e898c32004-07-20 00:41:46 +00001832 case cFP64:
Misha Brukman5b570812004-08-10 22:47:03 +00001833 BuildMI(BB, PPC::FMR, 1, Ret.Reg).addReg(PPC::F1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001834 break;
Chris Lattner3ea93462004-08-06 06:58:50 +00001835 case cLong: // Long values are in r3:r4
Misha Brukman5b570812004-08-10 22:47:03 +00001836 BuildMI(BB, PPC::OR, 2, Ret.Reg).addReg(PPC::R3).addReg(PPC::R3);
1837 BuildMI(BB, PPC::OR, 2, Ret.Reg+1).addReg(PPC::R4).addReg(PPC::R4);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001838 break;
1839 default: assert(0 && "Unknown class!");
1840 }
1841 }
1842}
1843
1844
1845/// visitCallInst - Push args on stack and do a procedure call instruction.
Misha Brukmana1dca552004-09-21 18:22:19 +00001846void PPC32ISel::visitCallInst(CallInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001847 MachineInstr *TheCall;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001848 Function *F = CI.getCalledFunction();
1849 if (F) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001850 // Is it an intrinsic function call?
1851 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID()) {
1852 visitIntrinsicCall(ID, CI); // Special intrinsics are not handled here
1853 return;
1854 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001855 // Emit a CALL instruction with PC-relative displacement.
Misha Brukman5b570812004-08-10 22:47:03 +00001856 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(F, true);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001857 } else { // Emit an indirect call through the CTR
1858 unsigned Reg = getReg(CI.getCalledValue());
Nate Begeman43d64ea2004-08-15 06:42:28 +00001859 BuildMI(BB, PPC::OR, 2, PPC::R12).addReg(Reg).addReg(Reg);
1860 BuildMI(BB, PPC::MTCTR, 1).addReg(PPC::R12);
1861 TheCall = BuildMI(PPC::CALLindirect, 2).addZImm(20).addZImm(0)
1862 .addReg(PPC::R12);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001863 }
1864
1865 std::vector<ValueRecord> Args;
1866 for (unsigned i = 1, e = CI.getNumOperands(); i != e; ++i)
1867 Args.push_back(ValueRecord(CI.getOperand(i)));
1868
1869 unsigned DestReg = CI.getType() != Type::VoidTy ? getReg(CI) : 0;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001870 bool isVarArg = F ? F->getFunctionType()->isVarArg() : true;
1871 doCall(ValueRecord(DestReg, CI.getType()), TheCall, Args, isVarArg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001872}
1873
1874
1875/// dyncastIsNan - Return the operand of an isnan operation if this is an isnan.
1876///
1877static Value *dyncastIsNan(Value *V) {
1878 if (CallInst *CI = dyn_cast<CallInst>(V))
1879 if (Function *F = CI->getCalledFunction())
Misha Brukmana2916ce2004-06-21 17:58:36 +00001880 if (F->getIntrinsicID() == Intrinsic::isunordered)
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001881 return CI->getOperand(1);
1882 return 0;
1883}
1884
1885/// isOnlyUsedByUnorderedComparisons - Return true if this value is only used by
1886/// or's whos operands are all calls to the isnan predicate.
1887static bool isOnlyUsedByUnorderedComparisons(Value *V) {
1888 assert(dyncastIsNan(V) && "The value isn't an isnan call!");
1889
1890 // Check all uses, which will be or's of isnans if this predicate is true.
1891 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;++UI){
1892 Instruction *I = cast<Instruction>(*UI);
1893 if (I->getOpcode() != Instruction::Or) return false;
1894 if (I->getOperand(0) != V && !dyncastIsNan(I->getOperand(0))) return false;
1895 if (I->getOperand(1) != V && !dyncastIsNan(I->getOperand(1))) return false;
1896 }
1897
1898 return true;
1899}
1900
1901/// LowerUnknownIntrinsicFunctionCalls - This performs a prepass over the
1902/// function, lowering any calls to unknown intrinsic functions into the
1903/// equivalent LLVM code.
1904///
Misha Brukmana1dca552004-09-21 18:22:19 +00001905void PPC32ISel::LowerUnknownIntrinsicFunctionCalls(Function &F) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001906 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
1907 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
1908 if (CallInst *CI = dyn_cast<CallInst>(I++))
1909 if (Function *F = CI->getCalledFunction())
1910 switch (F->getIntrinsicID()) {
1911 case Intrinsic::not_intrinsic:
1912 case Intrinsic::vastart:
1913 case Intrinsic::vacopy:
1914 case Intrinsic::vaend:
1915 case Intrinsic::returnaddress:
1916 case Intrinsic::frameaddress:
Misha Brukmanb097f212004-07-26 18:13:24 +00001917 // FIXME: should lower these ourselves
Misha Brukmana2916ce2004-06-21 17:58:36 +00001918 // case Intrinsic::isunordered:
Misha Brukmanb097f212004-07-26 18:13:24 +00001919 // case Intrinsic::memcpy: -> doCall(). system memcpy almost
1920 // guaranteed to be faster than anything we generate ourselves
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001921 // We directly implement these intrinsics
1922 break;
1923 case Intrinsic::readio: {
1924 // On PPC, memory operations are in-order. Lower this intrinsic
1925 // into a volatile load.
1926 Instruction *Before = CI->getPrev();
1927 LoadInst * LI = new LoadInst(CI->getOperand(1), "", true, CI);
1928 CI->replaceAllUsesWith(LI);
1929 BB->getInstList().erase(CI);
1930 break;
1931 }
1932 case Intrinsic::writeio: {
1933 // On PPC, memory operations are in-order. Lower this intrinsic
1934 // into a volatile store.
1935 Instruction *Before = CI->getPrev();
Misha Brukman8d442c22004-07-14 15:29:51 +00001936 StoreInst *SI = new StoreInst(CI->getOperand(1),
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001937 CI->getOperand(2), true, CI);
Misha Brukman8d442c22004-07-14 15:29:51 +00001938 CI->replaceAllUsesWith(SI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001939 BB->getInstList().erase(CI);
1940 break;
1941 }
1942 default:
1943 // All other intrinsic calls we must lower.
1944 Instruction *Before = CI->getPrev();
1945 TM.getIntrinsicLowering().LowerIntrinsicCall(CI);
1946 if (Before) { // Move iterator to instruction after call
1947 I = Before; ++I;
1948 } else {
1949 I = BB->begin();
1950 }
1951 }
1952}
1953
Misha Brukmana1dca552004-09-21 18:22:19 +00001954void PPC32ISel::visitIntrinsicCall(Intrinsic::ID ID, CallInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001955 unsigned TmpReg1, TmpReg2, TmpReg3;
1956 switch (ID) {
1957 case Intrinsic::vastart:
1958 // Get the address of the first vararg value...
1959 TmpReg1 = getReg(CI);
Misha Brukman5b570812004-08-10 22:47:03 +00001960 addFrameReference(BuildMI(BB, PPC::ADDI, 2, TmpReg1), VarArgsFrameIndex,
Misha Brukmanec6319a2004-07-20 15:51:37 +00001961 0, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001962 return;
1963
1964 case Intrinsic::vacopy:
1965 TmpReg1 = getReg(CI);
1966 TmpReg2 = getReg(CI.getOperand(1));
Misha Brukman5b570812004-08-10 22:47:03 +00001967 BuildMI(BB, PPC::OR, 2, TmpReg1).addReg(TmpReg2).addReg(TmpReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001968 return;
1969 case Intrinsic::vaend: return;
1970
1971 case Intrinsic::returnaddress:
Misha Brukmanec6319a2004-07-20 15:51:37 +00001972 TmpReg1 = getReg(CI);
1973 if (cast<Constant>(CI.getOperand(1))->isNullValue()) {
1974 MachineFrameInfo *MFI = F->getFrameInfo();
1975 unsigned NumBytes = MFI->getStackSize();
1976
Misha Brukman5b570812004-08-10 22:47:03 +00001977 BuildMI(BB, PPC::LWZ, 2, TmpReg1).addSImm(NumBytes+8)
1978 .addReg(PPC::R1);
Misha Brukmanec6319a2004-07-20 15:51:37 +00001979 } else {
1980 // Values other than zero are not implemented yet.
Misha Brukman5b570812004-08-10 22:47:03 +00001981 BuildMI(BB, PPC::LI, 1, TmpReg1).addSImm(0);
Misha Brukmanec6319a2004-07-20 15:51:37 +00001982 }
1983 return;
1984
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001985 case Intrinsic::frameaddress:
1986 TmpReg1 = getReg(CI);
1987 if (cast<Constant>(CI.getOperand(1))->isNullValue()) {
Misha Brukman5b570812004-08-10 22:47:03 +00001988 BuildMI(BB, PPC::OR, 2, TmpReg1).addReg(PPC::R1).addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001989 } else {
1990 // Values other than zero are not implemented yet.
Misha Brukman5b570812004-08-10 22:47:03 +00001991 BuildMI(BB, PPC::LI, 1, TmpReg1).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001992 }
1993 return;
Misha Brukmanb097f212004-07-26 18:13:24 +00001994
Misha Brukmana2916ce2004-06-21 17:58:36 +00001995#if 0
1996 // This may be useful for supporting isunordered
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001997 case Intrinsic::isnan:
1998 // If this is only used by 'isunordered' style comparisons, don't emit it.
1999 if (isOnlyUsedByUnorderedComparisons(&CI)) return;
2000 TmpReg1 = getReg(CI.getOperand(1));
2001 emitUCOM(BB, BB->end(), TmpReg1, TmpReg1);
Misha Brukman422791f2004-06-21 17:41:12 +00002002 TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00002003 BuildMI(BB, PPC::MFCR, TmpReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002004 TmpReg3 = getReg(CI);
Misha Brukman5b570812004-08-10 22:47:03 +00002005 BuildMI(BB, PPC::RLWINM, 4, TmpReg3).addReg(TmpReg2).addImm(4).addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002006 return;
Misha Brukmana2916ce2004-06-21 17:58:36 +00002007#endif
2008
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002009 default: assert(0 && "Error: unknown intrinsics should have been lowered!");
2010 }
2011}
2012
2013/// visitSimpleBinary - Implement simple binary operators for integral types...
2014/// OperatorClass is one of: 0 for Add, 1 for Sub, 2 for And, 3 for Or, 4 for
2015/// Xor.
2016///
Misha Brukmana1dca552004-09-21 18:22:19 +00002017void PPC32ISel::visitSimpleBinary(BinaryOperator &B, unsigned OperatorClass) {
Nate Begeman1b750222004-10-17 05:19:20 +00002018 if (std::find(SkipList.begin(), SkipList.end(), &B) != SkipList.end())
2019 return;
Nate Begeman905a2912004-10-24 10:33:30 +00002020
2021 unsigned DestReg = getReg(B);
2022 MachineBasicBlock::iterator MI = BB->end();
2023 RlwimiRec RR = InsertMap[&B];
2024 if (RR.Target != 0) {
2025 unsigned TargetReg = getReg(RR.Target, BB, MI);
2026 unsigned InsertReg = getReg(RR.Insert, BB, MI);
2027 BuildMI(*BB, MI, PPC::RLWIMI, 5, DestReg).addReg(TargetReg)
2028 .addReg(InsertReg).addImm(RR.Shift).addImm(RR.MB).addImm(RR.ME);
2029 return;
Nate Begeman1b750222004-10-17 05:19:20 +00002030 }
Nate Begeman905a2912004-10-24 10:33:30 +00002031
2032 unsigned Class = getClassB(B.getType());
2033 Value *Op0 = B.getOperand(0), *Op1 = B.getOperand(1);
2034 emitSimpleBinaryOperation(BB, MI, &B, Op0, Op1, OperatorClass, DestReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002035}
2036
2037/// emitBinaryFPOperation - This method handles emission of floating point
2038/// Add (0), Sub (1), Mul (2), and Div (3) operations.
Misha Brukmana1dca552004-09-21 18:22:19 +00002039void PPC32ISel::emitBinaryFPOperation(MachineBasicBlock *BB,
2040 MachineBasicBlock::iterator IP,
2041 Value *Op0, Value *Op1,
2042 unsigned OperatorClass, unsigned DestReg){
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002043
Nate Begeman6d1e2df2004-08-14 22:11:38 +00002044 static const unsigned OpcodeTab[][4] = {
2045 { PPC::FADDS, PPC::FSUBS, PPC::FMULS, PPC::FDIVS }, // Float
2046 { PPC::FADD, PPC::FSUB, PPC::FMUL, PPC::FDIV }, // Double
2047 };
2048
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002049 // Special case: R1 = op <const fp>, R2
Misha Brukmana596f8c2004-07-13 15:35:45 +00002050 if (ConstantFP *Op0C = dyn_cast<ConstantFP>(Op0))
2051 if (Op0C->isExactlyValue(-0.0) && OperatorClass == 1) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002052 // -0.0 - X === -X
2053 unsigned op1Reg = getReg(Op1, BB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00002054 BuildMI(*BB, IP, PPC::FNEG, 1, DestReg).addReg(op1Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002055 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002056 }
2057
Nate Begeman81d265d2004-08-19 05:20:54 +00002058 unsigned Opcode = OpcodeTab[Op0->getType() == Type::DoubleTy][OperatorClass];
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002059 unsigned Op0r = getReg(Op0, BB, IP);
2060 unsigned Op1r = getReg(Op1, BB, IP);
2061 BuildMI(*BB, IP, Opcode, 2, DestReg).addReg(Op0r).addReg(Op1r);
2062}
2063
Nate Begemanb816f022004-10-07 22:30:03 +00002064// ExactLog2 - This function solves for (Val == 1 << (N-1)) and returns N. It
2065// returns zero when the input is not exactly a power of two.
2066static unsigned ExactLog2(unsigned Val) {
2067 if (Val == 0 || (Val & (Val-1))) return 0;
2068 unsigned Count = 0;
2069 while (Val != 1) {
2070 Val >>= 1;
2071 ++Count;
2072 }
2073 return Count;
2074}
2075
Nate Begemanbdf69842004-10-08 02:49:24 +00002076// isRunOfOnes - returns true if Val consists of one contiguous run of 1's with
2077// any number of 0's on either side. the 1's are allowed to wrap from LSB to
2078// MSB. so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
2079// not, since all 1's are not contiguous.
2080static bool isRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME) {
2081 bool isRun = true;
2082 MB = 0;
2083 ME = 0;
2084
2085 // look for first set bit
2086 int i = 0;
2087 for (; i < 32; i++) {
2088 if ((Val & (1 << (31 - i))) != 0) {
2089 MB = i;
2090 ME = i;
2091 break;
2092 }
2093 }
2094
2095 // look for last set bit
2096 for (; i < 32; i++) {
2097 if ((Val & (1 << (31 - i))) == 0)
2098 break;
2099 ME = i;
2100 }
2101
2102 // look for next set bit
2103 for (; i < 32; i++) {
2104 if ((Val & (1 << (31 - i))) != 0)
2105 break;
2106 }
2107
2108 // if we exhausted all the bits, we found a match at this point for 0*1*0*
2109 if (i == 32)
2110 return true;
2111
2112 // since we just encountered more 1's, if it doesn't wrap around to the
2113 // most significant bit of the word, then we did not find a match to 1*0*1* so
2114 // exit.
2115 if (MB != 0)
2116 return false;
2117
2118 // look for last set bit
2119 for (MB = i; i < 32; i++) {
2120 if ((Val & (1 << (31 - i))) == 0)
2121 break;
2122 }
2123
2124 // if we exhausted all the bits, then we found a match for 1*0*1*, otherwise,
2125 // the value is not a run of ones.
2126 if (i == 32)
2127 return true;
2128 return false;
2129}
2130
Nate Begeman905a2912004-10-24 10:33:30 +00002131/// isInsertAndHalf - Helper function for emitBitfieldInsert. Returns true if
2132/// OpUser has one use, is used by an or instruction, and is itself an and whose
2133/// second operand is a constant int. Optionally, set OrI to the Or instruction
2134/// that is the sole user of OpUser, and Op1User to the other operand of the Or
2135/// instruction.
2136static bool isInsertAndHalf(User *OpUser, Instruction **Op1User,
2137 Instruction **OrI, unsigned &Mask) {
2138 // If this instruction doesn't have one use, then return false.
2139 if (!OpUser->hasOneUse())
2140 return false;
2141
2142 Mask = 0xFFFFFFFF;
2143 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(OpUser))
2144 if (BO->getOpcode() == Instruction::And) {
2145 Value *AndUse = *(OpUser->use_begin());
2146 if (BinaryOperator *Or = dyn_cast<BinaryOperator>(AndUse)) {
2147 if (Or->getOpcode() == Instruction::Or) {
2148 if (ConstantInt *CI = dyn_cast<ConstantInt>(OpUser->getOperand(1))) {
2149 if (OrI) *OrI = Or;
2150 if (Op1User) {
2151 if (Or->getOperand(0) == OpUser)
2152 *Op1User = dyn_cast<Instruction>(Or->getOperand(1));
2153 else
2154 *Op1User = dyn_cast<Instruction>(Or->getOperand(0));
Nate Begeman1b750222004-10-17 05:19:20 +00002155 }
Nate Begeman905a2912004-10-24 10:33:30 +00002156 Mask &= CI->getRawValue();
2157 return true;
Nate Begeman1b750222004-10-17 05:19:20 +00002158 }
2159 }
2160 }
2161 }
Nate Begeman905a2912004-10-24 10:33:30 +00002162 return false;
2163}
2164
2165/// isInsertShiftHalf - Helper function for emitBitfieldInsert. Returns true if
2166/// OpUser has one use, is used by an or instruction, and is itself a shift
2167/// instruction that is either used directly by the or instruction, or is used
2168/// by an and instruction whose second operand is a constant int, and which is
2169/// used by the or instruction.
2170static bool isInsertShiftHalf(User *OpUser, Instruction **Op1User,
2171 Instruction **OrI, Instruction **OptAndI,
2172 unsigned &Shift, unsigned &Mask) {
2173 // If this instruction doesn't have one use, then return false.
2174 if (!OpUser->hasOneUse())
2175 return false;
2176
2177 Mask = 0xFFFFFFFF;
2178 if (ShiftInst *SI = dyn_cast<ShiftInst>(OpUser)) {
2179 if (ConstantInt *CI = dyn_cast<ConstantInt>(SI->getOperand(1))) {
2180 Shift = CI->getRawValue();
2181 if (SI->getOpcode() == Instruction::Shl)
2182 Mask <<= Shift;
2183 else if (!SI->getOperand(0)->getType()->isSigned()) {
2184 Mask >>= Shift;
2185 Shift = 32 - Shift;
2186 }
2187
2188 // Now check to see if the shift instruction is used by an or.
2189 Value *ShiftUse = *(OpUser->use_begin());
2190 Value *OptAndICopy = 0;
2191 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(ShiftUse)) {
2192 if (BO->getOpcode() == Instruction::And && BO->hasOneUse()) {
2193 if (ConstantInt *ACI = dyn_cast<ConstantInt>(BO->getOperand(1))) {
2194 if (OptAndI) *OptAndI = BO;
2195 OptAndICopy = BO;
2196 Mask &= ACI->getRawValue();
2197 BO = dyn_cast<BinaryOperator>(*(BO->use_begin()));
2198 }
2199 }
2200 if (BO && BO->getOpcode() == Instruction::Or) {
2201 if (OrI) *OrI = BO;
2202 if (Op1User) {
2203 if (BO->getOperand(0) == OpUser || BO->getOperand(0) == OptAndICopy)
2204 *Op1User = dyn_cast<Instruction>(BO->getOperand(1));
2205 else
2206 *Op1User = dyn_cast<Instruction>(BO->getOperand(0));
2207 }
2208 return true;
2209 }
2210 }
2211 }
2212 }
2213 return false;
2214}
2215
2216/// emitBitfieldInsert - turn a shift used only by an and with immediate into
2217/// the rotate left word immediate then mask insert (rlwimi) instruction.
2218/// Patterns matched:
2219/// 1. or shl, and 5. or (shl-and), and 9. or and, and
2220/// 2. or and, shl 6. or and, (shl-and)
2221/// 3. or shr, and 7. or (shr-and), and
2222/// 4. or and, shr 8. or and, (shr-and)
Nate Begeman9b508c32004-10-26 03:48:25 +00002223bool PPC32ISel::emitBitfieldInsert(User *OpUser, unsigned DestReg) {
Nate Begeman905a2912004-10-24 10:33:30 +00002224 // Instructions to skip if we match any of the patterns
2225 Instruction *Op0User, *Op1User = 0, *OptAndI = 0, *OrI = 0;
2226 unsigned TgtMask, InsMask, Amount = 0;
2227 bool matched = false;
2228
2229 // We require OpUser to be an instruction to continue
2230 Op0User = dyn_cast<Instruction>(OpUser);
2231 if (0 == Op0User)
2232 return false;
2233
2234 // Look for cases 2, 4, 6, 8, and 9
2235 if (isInsertAndHalf(Op0User, &Op1User, &OrI, TgtMask))
2236 if (Op1User)
2237 if (isInsertAndHalf(Op1User, 0, 0, InsMask))
2238 matched = true;
2239 else if (isInsertShiftHalf(Op1User, 0, 0, &OptAndI, Amount, InsMask))
2240 matched = true;
2241
2242 // Look for cases 1, 3, 5, and 7. Force the shift argument to be the one
2243 // inserted into the target, since rlwimi can only rotate the value inserted,
2244 // not the value being inserted into.
2245 if (matched == false)
2246 if (isInsertShiftHalf(Op0User, &Op1User, &OrI, &OptAndI, Amount, InsMask))
2247 if (Op1User && isInsertAndHalf(Op1User, 0, 0, TgtMask)) {
2248 std::swap(Op0User, Op1User);
2249 matched = true;
2250 }
2251
2252 // We didn't succeed in matching one of the patterns, so return false
2253 if (matched == false)
2254 return false;
2255
2256 // If the masks xor to -1, and the insert mask is a run of ones, then we have
2257 // succeeded in matching one of the cases for generating rlwimi. Update the
2258 // skip lists and users of the Instruction::Or.
2259 unsigned MB, ME;
2260 if (((TgtMask ^ InsMask) == 0xFFFFFFFF) && isRunOfOnes(InsMask, MB, ME)) {
2261 SkipList.push_back(Op0User);
2262 SkipList.push_back(Op1User);
2263 SkipList.push_back(OptAndI);
2264 InsertMap[OrI] = RlwimiRec(Op0User->getOperand(0), Op1User->getOperand(0),
2265 Amount, MB, ME);
2266 return true;
2267 }
2268 return false;
2269}
2270
2271/// emitBitfieldExtract - turn a shift used only by an and with immediate into the
2272/// rotate left word immediate then and with mask (rlwinm) instruction.
2273bool PPC32ISel::emitBitfieldExtract(MachineBasicBlock *MBB,
2274 MachineBasicBlock::iterator IP,
Nate Begeman9b508c32004-10-26 03:48:25 +00002275 User *OpUser, unsigned DestReg) {
Nate Begeman905a2912004-10-24 10:33:30 +00002276 return false;
Nate Begeman9b508c32004-10-26 03:48:25 +00002277 /*
2278 // Instructions to skip if we match any of the patterns
2279 Instruction *Op0User, *Op1User = 0;
2280 unsigned ShiftMask, AndMask, Amount = 0;
2281 bool matched = false;
Nate Begeman905a2912004-10-24 10:33:30 +00002282
Nate Begeman9b508c32004-10-26 03:48:25 +00002283 // We require OpUser to be an instruction to continue
2284 Op0User = dyn_cast<Instruction>(OpUser);
2285 if (0 == Op0User)
2286 return false;
2287
2288 if (isExtractShiftHalf)
2289 if (isExtractAndHalf)
2290 matched = true;
2291
2292 if (matched == false && isExtractAndHalf)
2293 if (isExtractShiftHalf)
2294 matched = true;
2295
2296 if (matched == false)
2297 return false;
2298
2299 if (isRunOfOnes(Imm, MB, ME)) {
2300 unsigned SrcReg = getReg(Op, MBB, IP);
2301 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(Rotate)
2302 .addImm(MB).addImm(ME);
2303 Op1User->replaceAllUsesWith(Op0User);
2304 SkipList.push_back(BO);
2305 return true;
Nate Begeman1b750222004-10-17 05:19:20 +00002306 }
Nate Begeman9b508c32004-10-26 03:48:25 +00002307 */
Nate Begeman1b750222004-10-17 05:19:20 +00002308}
2309
Nate Begemanb816f022004-10-07 22:30:03 +00002310/// emitBinaryConstOperation - Implement simple binary operators for integral
2311/// types with a constant operand. Opcode is one of: 0 for Add, 1 for Sub,
2312/// 2 for And, 3 for Or, 4 for Xor, and 5 for Subtract-From.
2313///
2314void PPC32ISel::emitBinaryConstOperation(MachineBasicBlock *MBB,
2315 MachineBasicBlock::iterator IP,
2316 unsigned Op0Reg, ConstantInt *Op1,
2317 unsigned Opcode, unsigned DestReg) {
2318 static const unsigned OpTab[] = {
2319 PPC::ADD, PPC::SUB, PPC::AND, PPC::OR, PPC::XOR, PPC::SUBF
2320 };
2321 static const unsigned ImmOpTab[2][6] = {
2322 { PPC::ADDI, PPC::ADDI, PPC::ANDIo, PPC::ORI, PPC::XORI, PPC::SUBFIC },
2323 { PPC::ADDIS, PPC::ADDIS, PPC::ANDISo, PPC::ORIS, PPC::XORIS, PPC::SUBFIC }
2324 };
2325
2326 // Handle subtract now by inverting the constant value
2327 ConstantInt *CI = Op1;
2328 if (Opcode == 1) {
2329 ConstantSInt *CSI = dyn_cast<ConstantSInt>(Op1);
2330 CI = ConstantSInt::get(Op1->getType(), -CSI->getValue());
2331 }
2332
2333 // xor X, -1 -> not X
2334 if (Opcode == 4) {
Chris Lattner289a49a2004-10-16 18:13:47 +00002335 ConstantInt *CI = dyn_cast<ConstantSInt>(Op1);
2336 if (CI && CI->isAllOnesValue()) {
Nate Begemanb816f022004-10-07 22:30:03 +00002337 BuildMI(*MBB, IP, PPC::NOR, 2, DestReg).addReg(Op0Reg).addReg(Op0Reg);
2338 return;
2339 }
2340 }
Nate Begemanbdf69842004-10-08 02:49:24 +00002341
Nate Begeman9b508c32004-10-26 03:48:25 +00002342 if (Opcode == 2 && !CI->isNullValue()) {
Nate Begemanbdf69842004-10-08 02:49:24 +00002343 unsigned MB, ME, mask = CI->getRawValue();
2344 if (isRunOfOnes(mask, MB, ME)) {
Nate Begemanbdf69842004-10-08 02:49:24 +00002345 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(Op0Reg).addImm(0)
2346 .addImm(MB).addImm(ME);
2347 return;
2348 }
2349 }
Nate Begemanb816f022004-10-07 22:30:03 +00002350
Nate Begemane0c83a82004-10-15 00:50:19 +00002351 // PowerPC 16 bit signed immediates are sign extended before use by the
2352 // instruction. Therefore, we can only split up an add of a reg with a 32 bit
2353 // immediate into addis and addi if the sign bit of the low 16 bits is cleared
2354 // so that for register A, const imm X, we don't end up with
2355 // A + XXXX0000 + FFFFXXXX.
2356 bool WontSignExtend = (0 == (Op1->getRawValue() & 0x8000));
2357
Nate Begemanb816f022004-10-07 22:30:03 +00002358 // For Add, Sub, and SubF the instruction takes a signed immediate. For And,
2359 // Or, and Xor, the instruction takes an unsigned immediate. There is no
2360 // shifted immediate form of SubF so disallow its opcode for those constants.
2361 if (canUseAsImmediateForOpcode(CI, Opcode, false)) {
2362 if (Opcode < 2 || Opcode == 5)
2363 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(Op0Reg)
2364 .addSImm(Op1->getRawValue());
2365 else
2366 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(Op0Reg)
2367 .addZImm(Op1->getRawValue());
2368 } else if (canUseAsImmediateForOpcode(CI, Opcode, true) && (Opcode < 5)) {
2369 if (Opcode < 2)
2370 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, DestReg).addReg(Op0Reg)
2371 .addSImm(Op1->getRawValue() >> 16);
2372 else
2373 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, DestReg).addReg(Op0Reg)
2374 .addZImm(Op1->getRawValue() >> 16);
Nate Begemane0c83a82004-10-15 00:50:19 +00002375 } else if ((Opcode < 2 && WontSignExtend) || Opcode == 3 || Opcode == 4) {
2376 unsigned TmpReg = makeAnotherReg(Op1->getType());
Nate Begemane0c83a82004-10-15 00:50:19 +00002377 if (Opcode < 2) {
2378 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, TmpReg).addReg(Op0Reg)
2379 .addSImm(Op1->getRawValue() >> 16);
2380 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(TmpReg)
2381 .addSImm(Op1->getRawValue());
2382 } else {
2383 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, TmpReg).addReg(Op0Reg)
2384 .addZImm(Op1->getRawValue() >> 16);
2385 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(TmpReg)
2386 .addZImm(Op1->getRawValue());
2387 }
Nate Begemanb816f022004-10-07 22:30:03 +00002388 } else {
2389 unsigned Op1Reg = getReg(Op1, MBB, IP);
2390 BuildMI(*MBB, IP, OpTab[Opcode], 2, DestReg).addReg(Op0Reg).addReg(Op1Reg);
2391 }
2392}
2393
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002394/// emitSimpleBinaryOperation - Implement simple binary operators for integral
2395/// types... OperatorClass is one of: 0 for Add, 1 for Sub, 2 for And, 3 for
2396/// Or, 4 for Xor.
2397///
Misha Brukmana1dca552004-09-21 18:22:19 +00002398void PPC32ISel::emitSimpleBinaryOperation(MachineBasicBlock *MBB,
2399 MachineBasicBlock::iterator IP,
Nate Begeman1b750222004-10-17 05:19:20 +00002400 BinaryOperator *BO,
Misha Brukmana1dca552004-09-21 18:22:19 +00002401 Value *Op0, Value *Op1,
2402 unsigned OperatorClass,
2403 unsigned DestReg) {
Misha Brukman422791f2004-06-21 17:41:12 +00002404 // Arithmetic and Bitwise operators
Misha Brukman911afde2004-06-25 14:50:41 +00002405 static const unsigned OpcodeTab[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00002406 PPC::ADD, PPC::SUB, PPC::AND, PPC::OR, PPC::XOR
Misha Brukman422791f2004-06-21 17:41:12 +00002407 };
Nate Begemanb816f022004-10-07 22:30:03 +00002408 static const unsigned LongOpTab[2][5] = {
2409 { PPC::ADDC, PPC::SUBC, PPC::AND, PPC::OR, PPC::XOR },
2410 { PPC::ADDE, PPC::SUBFE, PPC::AND, PPC::OR, PPC::XOR }
Misha Brukman422791f2004-06-21 17:41:12 +00002411 };
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002412
Nate Begemanb816f022004-10-07 22:30:03 +00002413 unsigned Class = getClassB(Op0->getType());
2414
Misha Brukman7e898c32004-07-20 00:41:46 +00002415 if (Class == cFP32 || Class == cFP64) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002416 assert(OperatorClass < 2 && "No logical ops for FP!");
2417 emitBinaryFPOperation(MBB, IP, Op0, Op1, OperatorClass, DestReg);
2418 return;
2419 }
2420
2421 if (Op0->getType() == Type::BoolTy) {
2422 if (OperatorClass == 3)
2423 // If this is an or of two isnan's, emit an FP comparison directly instead
2424 // of or'ing two isnan's together.
2425 if (Value *LHS = dyncastIsNan(Op0))
2426 if (Value *RHS = dyncastIsNan(Op1)) {
2427 unsigned Op0Reg = getReg(RHS, MBB, IP), Op1Reg = getReg(LHS, MBB, IP);
Misha Brukman422791f2004-06-21 17:41:12 +00002428 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002429 emitUCOM(MBB, IP, Op0Reg, Op1Reg);
Misha Brukman5b570812004-08-10 22:47:03 +00002430 BuildMI(*MBB, IP, PPC::MFCR, TmpReg);
2431 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(TmpReg).addImm(4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002432 .addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002433 return;
2434 }
2435 }
2436
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002437 // Special case: op <const int>, Reg
Nate Begemanb816f022004-10-07 22:30:03 +00002438 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op0))
Misha Brukman1013ef52004-07-21 20:09:08 +00002439 if (Class != cLong) {
Nate Begemanb816f022004-10-07 22:30:03 +00002440 unsigned Opcode = (OperatorClass == 1) ? 5 : OperatorClass;
2441 unsigned Op1r = getReg(Op1, MBB, IP);
2442 emitBinaryConstOperation(MBB, IP, Op1r, CI, Opcode, DestReg);
2443 return;
2444 }
2445 // Special case: op Reg, <const int>
2446 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1))
2447 if (Class != cLong) {
Nate Begeman9b508c32004-10-26 03:48:25 +00002448 if (emitBitfieldInsert(BO, DestReg))
Nate Begeman1b750222004-10-17 05:19:20 +00002449 return;
Nate Begeman905a2912004-10-24 10:33:30 +00002450
Nate Begemanb816f022004-10-07 22:30:03 +00002451 unsigned Op0r = getReg(Op0, MBB, IP);
2452 emitBinaryConstOperation(MBB, IP, Op0r, CI, OperatorClass, DestReg);
Misha Brukman1013ef52004-07-21 20:09:08 +00002453 return;
2454 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002455
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002456 // We couldn't generate an immediate variant of the op, load both halves into
2457 // registers and emit the appropriate opcode.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002458 unsigned Op0r = getReg(Op0, MBB, IP);
2459 unsigned Op1r = getReg(Op1, MBB, IP);
2460
2461 if (Class != cLong) {
Misha Brukman422791f2004-06-21 17:41:12 +00002462 unsigned Opcode = OpcodeTab[OperatorClass];
2463 BuildMI(*MBB, IP, Opcode, 2, DestReg).addReg(Op0r).addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002464 } else {
Nate Begemanb816f022004-10-07 22:30:03 +00002465 BuildMI(*MBB, IP, LongOpTab[0][OperatorClass], 2, DestReg+1).addReg(Op0r+1)
Misha Brukman7e898c32004-07-20 00:41:46 +00002466 .addReg(Op1r+1);
Nate Begemanb816f022004-10-07 22:30:03 +00002467 BuildMI(*MBB, IP, LongOpTab[1][OperatorClass], 2, DestReg).addReg(Op0r)
Misha Brukman1013ef52004-07-21 20:09:08 +00002468 .addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002469 }
2470 return;
2471}
2472
Misha Brukman1013ef52004-07-21 20:09:08 +00002473/// doMultiply - Emit appropriate instructions to multiply together the
2474/// Values Op0 and Op1, and put the result in DestReg.
Misha Brukman2fec9902004-06-21 20:22:03 +00002475///
Misha Brukmana1dca552004-09-21 18:22:19 +00002476void PPC32ISel::doMultiply(MachineBasicBlock *MBB,
2477 MachineBasicBlock::iterator IP,
2478 unsigned DestReg, Value *Op0, Value *Op1) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002479 unsigned Class0 = getClass(Op0->getType());
2480 unsigned Class1 = getClass(Op1->getType());
2481
2482 unsigned Op0r = getReg(Op0, MBB, IP);
2483 unsigned Op1r = getReg(Op1, MBB, IP);
2484
2485 // 64 x 64 -> 64
2486 if (Class0 == cLong && Class1 == cLong) {
2487 unsigned Tmp1 = makeAnotherReg(Type::IntTy);
2488 unsigned Tmp2 = makeAnotherReg(Type::IntTy);
2489 unsigned Tmp3 = makeAnotherReg(Type::IntTy);
2490 unsigned Tmp4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00002491 BuildMI(*MBB, IP, PPC::MULHWU, 2, Tmp1).addReg(Op0r+1).addReg(Op1r+1);
2492 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg+1).addReg(Op0r+1).addReg(Op1r+1);
2493 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp2).addReg(Op0r+1).addReg(Op1r);
2494 BuildMI(*MBB, IP, PPC::ADD, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
2495 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp4).addReg(Op0r).addReg(Op1r+1);
2496 BuildMI(*MBB, IP, PPC::ADD, 2, DestReg).addReg(Tmp3).addReg(Tmp4);
Misha Brukman1013ef52004-07-21 20:09:08 +00002497 return;
2498 }
2499
2500 // 64 x 32 or less, promote 32 to 64 and do a 64 x 64
2501 if (Class0 == cLong && Class1 <= cInt) {
2502 unsigned Tmp0 = makeAnotherReg(Type::IntTy);
2503 unsigned Tmp1 = makeAnotherReg(Type::IntTy);
2504 unsigned Tmp2 = makeAnotherReg(Type::IntTy);
2505 unsigned Tmp3 = makeAnotherReg(Type::IntTy);
2506 unsigned Tmp4 = makeAnotherReg(Type::IntTy);
2507 if (Op1->getType()->isSigned())
Misha Brukman5b570812004-08-10 22:47:03 +00002508 BuildMI(*MBB, IP, PPC::SRAWI, 2, Tmp0).addReg(Op1r).addImm(31);
Misha Brukman1013ef52004-07-21 20:09:08 +00002509 else
Misha Brukman5b570812004-08-10 22:47:03 +00002510 BuildMI(*MBB, IP, PPC::LI, 2, Tmp0).addSImm(0);
2511 BuildMI(*MBB, IP, PPC::MULHWU, 2, Tmp1).addReg(Op0r+1).addReg(Op1r);
2512 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg+1).addReg(Op0r+1).addReg(Op1r);
2513 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp2).addReg(Op0r+1).addReg(Tmp0);
2514 BuildMI(*MBB, IP, PPC::ADD, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
2515 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp4).addReg(Op0r).addReg(Op1r);
2516 BuildMI(*MBB, IP, PPC::ADD, 2, DestReg).addReg(Tmp3).addReg(Tmp4);
Misha Brukman1013ef52004-07-21 20:09:08 +00002517 return;
2518 }
2519
2520 // 32 x 32 -> 32
2521 if (Class0 <= cInt && Class1 <= cInt) {
Misha Brukman5b570812004-08-10 22:47:03 +00002522 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg).addReg(Op0r).addReg(Op1r);
Misha Brukman1013ef52004-07-21 20:09:08 +00002523 return;
2524 }
2525
2526 assert(0 && "doMultiply cannot operate on unknown type!");
2527}
2528
2529/// doMultiplyConst - This method will multiply the value in Op0 by the
2530/// value of the ContantInt *CI
Misha Brukmana1dca552004-09-21 18:22:19 +00002531void PPC32ISel::doMultiplyConst(MachineBasicBlock *MBB,
2532 MachineBasicBlock::iterator IP,
2533 unsigned DestReg, Value *Op0, ConstantInt *CI) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002534 unsigned Class = getClass(Op0->getType());
2535
2536 // Mul op0, 0 ==> 0
2537 if (CI->isNullValue()) {
Misha Brukman5b570812004-08-10 22:47:03 +00002538 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00002539 if (Class == cLong)
Misha Brukman5b570812004-08-10 22:47:03 +00002540 BuildMI(*MBB, IP, PPC::LI, 1, DestReg+1).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002541 return;
Misha Brukman1013ef52004-07-21 20:09:08 +00002542 }
2543
2544 // Mul op0, 1 ==> op0
2545 if (CI->equalsInt(1)) {
2546 unsigned Op0r = getReg(Op0, MBB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00002547 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(Op0r).addReg(Op0r);
Misha Brukman1013ef52004-07-21 20:09:08 +00002548 if (Class == cLong)
Misha Brukman5b570812004-08-10 22:47:03 +00002549 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(Op0r+1).addReg(Op0r+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002550 return;
2551 }
2552
2553 // If the element size is exactly a power of 2, use a shift to get it.
Misha Brukman1013ef52004-07-21 20:09:08 +00002554 if (unsigned Shift = ExactLog2(CI->getRawValue())) {
2555 ConstantUInt *ShiftCI = ConstantUInt::get(Type::UByteTy, Shift);
Nate Begeman9b508c32004-10-26 03:48:25 +00002556 emitShiftOperation(MBB, IP, Op0, ShiftCI, true, Op0->getType(), 0, DestReg);
Misha Brukman1013ef52004-07-21 20:09:08 +00002557 return;
2558 }
2559
2560 // If 32 bits or less and immediate is in right range, emit mul by immediate
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002561 if (Class == cByte || Class == cShort || Class == cInt) {
Nate Begemanb816f022004-10-07 22:30:03 +00002562 if (canUseAsImmediateForOpcode(CI, 0, false)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002563 unsigned Op0r = getReg(Op0, MBB, IP);
2564 unsigned imm = CI->getRawValue() & 0xFFFF;
Misha Brukman5b570812004-08-10 22:47:03 +00002565 BuildMI(*MBB, IP, PPC::MULLI, 2, DestReg).addReg(Op0r).addSImm(imm);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002566 return;
2567 }
2568 }
2569
Misha Brukman1013ef52004-07-21 20:09:08 +00002570 doMultiply(MBB, IP, DestReg, Op0, CI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002571}
2572
Misha Brukmana1dca552004-09-21 18:22:19 +00002573void PPC32ISel::visitMul(BinaryOperator &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002574 unsigned ResultReg = getReg(I);
2575
2576 Value *Op0 = I.getOperand(0);
2577 Value *Op1 = I.getOperand(1);
2578
2579 MachineBasicBlock::iterator IP = BB->end();
2580 emitMultiply(BB, IP, Op0, Op1, ResultReg);
2581}
2582
Misha Brukmana1dca552004-09-21 18:22:19 +00002583void PPC32ISel::emitMultiply(MachineBasicBlock *MBB,
2584 MachineBasicBlock::iterator IP,
2585 Value *Op0, Value *Op1, unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002586 TypeClass Class = getClass(Op0->getType());
2587
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002588 switch (Class) {
2589 case cByte:
2590 case cShort:
2591 case cInt:
Misha Brukman1013ef52004-07-21 20:09:08 +00002592 case cLong:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002593 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002594 doMultiplyConst(MBB, IP, DestReg, Op0, CI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002595 } else {
Misha Brukman1013ef52004-07-21 20:09:08 +00002596 doMultiply(MBB, IP, DestReg, Op0, Op1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002597 }
2598 return;
Misha Brukman7e898c32004-07-20 00:41:46 +00002599 case cFP32:
2600 case cFP64:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002601 emitBinaryFPOperation(MBB, IP, Op0, Op1, 2, DestReg);
2602 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002603 break;
2604 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002605}
2606
2607
2608/// visitDivRem - Handle division and remainder instructions... these
2609/// instruction both require the same instructions to be generated, they just
2610/// select the result from a different register. Note that both of these
2611/// instructions work differently for signed and unsigned operands.
2612///
Misha Brukmana1dca552004-09-21 18:22:19 +00002613void PPC32ISel::visitDivRem(BinaryOperator &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002614 unsigned ResultReg = getReg(I);
2615 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2616
2617 MachineBasicBlock::iterator IP = BB->end();
Misha Brukman2fec9902004-06-21 20:22:03 +00002618 emitDivRemOperation(BB, IP, Op0, Op1, I.getOpcode() == Instruction::Div,
2619 ResultReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002620}
2621
Nate Begeman087d5d92004-10-06 09:53:04 +00002622void PPC32ISel::emitDivRemOperation(MachineBasicBlock *MBB,
Misha Brukmana1dca552004-09-21 18:22:19 +00002623 MachineBasicBlock::iterator IP,
2624 Value *Op0, Value *Op1, bool isDiv,
2625 unsigned ResultReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002626 const Type *Ty = Op0->getType();
2627 unsigned Class = getClass(Ty);
2628 switch (Class) {
Misha Brukman7e898c32004-07-20 00:41:46 +00002629 case cFP32:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002630 if (isDiv) {
Misha Brukman7e898c32004-07-20 00:41:46 +00002631 // Floating point divide...
Nate Begeman087d5d92004-10-06 09:53:04 +00002632 emitBinaryFPOperation(MBB, IP, Op0, Op1, 3, ResultReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002633 return;
Misha Brukman7e898c32004-07-20 00:41:46 +00002634 } else {
2635 // Floating point remainder via fmodf(float x, float y);
Nate Begeman087d5d92004-10-06 09:53:04 +00002636 unsigned Op0Reg = getReg(Op0, MBB, IP);
2637 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman7e898c32004-07-20 00:41:46 +00002638 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002639 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(fmodfFn, true);
Misha Brukman7e898c32004-07-20 00:41:46 +00002640 std::vector<ValueRecord> Args;
2641 Args.push_back(ValueRecord(Op0Reg, Type::FloatTy));
2642 Args.push_back(ValueRecord(Op1Reg, Type::FloatTy));
2643 doCall(ValueRecord(ResultReg, Type::FloatTy), TheCall, Args, false);
2644 }
2645 return;
2646 case cFP64:
2647 if (isDiv) {
2648 // Floating point divide...
Nate Begeman087d5d92004-10-06 09:53:04 +00002649 emitBinaryFPOperation(MBB, IP, Op0, Op1, 3, ResultReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00002650 return;
2651 } else {
2652 // Floating point remainder via fmod(double x, double y);
Nate Begeman087d5d92004-10-06 09:53:04 +00002653 unsigned Op0Reg = getReg(Op0, MBB, IP);
2654 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002655 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002656 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(fmodFn, true);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002657 std::vector<ValueRecord> Args;
2658 Args.push_back(ValueRecord(Op0Reg, Type::DoubleTy));
2659 Args.push_back(ValueRecord(Op1Reg, Type::DoubleTy));
Misha Brukmand18a31d2004-07-06 22:51:53 +00002660 doCall(ValueRecord(ResultReg, Type::DoubleTy), TheCall, Args, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002661 }
2662 return;
2663 case cLong: {
Misha Brukman7e898c32004-07-20 00:41:46 +00002664 static Function* const Funcs[] =
Misha Brukman0aa97c62004-07-08 18:27:59 +00002665 { __moddi3Fn, __divdi3Fn, __umoddi3Fn, __udivdi3Fn };
Nate Begeman087d5d92004-10-06 09:53:04 +00002666 unsigned Op0Reg = getReg(Op0, MBB, IP);
2667 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002668 unsigned NameIdx = Ty->isUnsigned()*2 + isDiv;
2669 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002670 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(Funcs[NameIdx], true);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002671
2672 std::vector<ValueRecord> Args;
2673 Args.push_back(ValueRecord(Op0Reg, Type::LongTy));
2674 Args.push_back(ValueRecord(Op1Reg, Type::LongTy));
Misha Brukmand18a31d2004-07-06 22:51:53 +00002675 doCall(ValueRecord(ResultReg, Type::LongTy), TheCall, Args, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002676 return;
2677 }
2678 case cByte: case cShort: case cInt:
2679 break; // Small integrals, handled below...
2680 default: assert(0 && "Unknown class!");
2681 }
2682
2683 // Special case signed division by power of 2.
2684 if (isDiv)
2685 if (ConstantSInt *CI = dyn_cast<ConstantSInt>(Op1)) {
2686 assert(Class != cLong && "This doesn't handle 64-bit divides!");
2687 int V = CI->getValue();
2688
2689 if (V == 1) { // X /s 1 => X
Nate Begeman087d5d92004-10-06 09:53:04 +00002690 unsigned Op0Reg = getReg(Op0, MBB, IP);
2691 BuildMI(*MBB, IP, PPC::OR, 2, ResultReg).addReg(Op0Reg).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002692 return;
2693 }
2694
2695 if (V == -1) { // X /s -1 => -X
Nate Begeman087d5d92004-10-06 09:53:04 +00002696 unsigned Op0Reg = getReg(Op0, MBB, IP);
2697 BuildMI(*MBB, IP, PPC::NEG, 1, ResultReg).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002698 return;
2699 }
2700
Misha Brukmanec6319a2004-07-20 15:51:37 +00002701 unsigned log2V = ExactLog2(V);
2702 if (log2V != 0 && Ty->isSigned()) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002703 unsigned Op0Reg = getReg(Op0, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002704 unsigned TmpReg = makeAnotherReg(Op0->getType());
Misha Brukmanec6319a2004-07-20 15:51:37 +00002705
Nate Begeman087d5d92004-10-06 09:53:04 +00002706 BuildMI(*MBB, IP, PPC::SRAWI, 2, TmpReg).addReg(Op0Reg).addImm(log2V);
2707 BuildMI(*MBB, IP, PPC::ADDZE, 1, ResultReg).addReg(TmpReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002708 return;
2709 }
2710 }
2711
Nate Begeman087d5d92004-10-06 09:53:04 +00002712 unsigned Op0Reg = getReg(Op0, MBB, IP);
2713
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002714 if (isDiv) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002715 unsigned Op1Reg = getReg(Op1, MBB, IP);
2716 unsigned Opcode = Ty->isSigned() ? PPC::DIVW : PPC::DIVWU;
2717 BuildMI(*MBB, IP, Opcode, 2, ResultReg).addReg(Op0Reg).addReg(Op1Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002718 } else { // Remainder
Nate Begeman087d5d92004-10-06 09:53:04 +00002719 // FIXME: don't load the CI part of a CI divide twice
2720 ConstantInt *CI = dyn_cast<ConstantInt>(Op1);
Misha Brukman422791f2004-06-21 17:41:12 +00002721 unsigned TmpReg1 = makeAnotherReg(Op0->getType());
2722 unsigned TmpReg2 = makeAnotherReg(Op0->getType());
Nate Begeman087d5d92004-10-06 09:53:04 +00002723 emitDivRemOperation(MBB, IP, Op0, Op1, true, TmpReg1);
Nate Begemanb816f022004-10-07 22:30:03 +00002724 if (CI && canUseAsImmediateForOpcode(CI, 0, false)) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002725 BuildMI(*MBB, IP, PPC::MULLI, 2, TmpReg2).addReg(TmpReg1)
2726 .addSImm(CI->getRawValue());
2727 } else {
2728 unsigned Op1Reg = getReg(Op1, MBB, IP);
2729 BuildMI(*MBB, IP, PPC::MULLW, 2, TmpReg2).addReg(TmpReg1).addReg(Op1Reg);
2730 }
2731 BuildMI(*MBB, IP, PPC::SUBF, 2, ResultReg).addReg(TmpReg2).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002732 }
2733}
2734
2735
2736/// Shift instructions: 'shl', 'sar', 'shr' - Some special cases here
2737/// for constant immediate shift values, and for constant immediate
2738/// shift values equal to 1. Even the general case is sort of special,
2739/// because the shift amount has to be in CL, not just any old register.
2740///
Misha Brukmana1dca552004-09-21 18:22:19 +00002741void PPC32ISel::visitShiftInst(ShiftInst &I) {
Nate Begeman905a2912004-10-24 10:33:30 +00002742 if (std::find(SkipList.begin(), SkipList.end(), &I) != SkipList.end())
2743 return;
2744
Misha Brukmane2eceb52004-07-23 16:08:20 +00002745 MachineBasicBlock::iterator IP = BB->end();
2746 emitShiftOperation(BB, IP, I.getOperand(0), I.getOperand(1),
2747 I.getOpcode() == Instruction::Shl, I.getType(),
Nate Begeman9b508c32004-10-26 03:48:25 +00002748 &I, getReg(I));
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002749}
2750
2751/// emitShiftOperation - Common code shared between visitShiftInst and
2752/// constant expression support.
Misha Brukman2fec9902004-06-21 20:22:03 +00002753///
Misha Brukmana1dca552004-09-21 18:22:19 +00002754void PPC32ISel::emitShiftOperation(MachineBasicBlock *MBB,
2755 MachineBasicBlock::iterator IP,
2756 Value *Op, Value *ShiftAmount,
Nate Begeman9b508c32004-10-26 03:48:25 +00002757 bool isLeftShift, const Type *ResultTy,
2758 ShiftInst *SI, unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002759 bool isSigned = ResultTy->isSigned ();
2760 unsigned Class = getClass (ResultTy);
2761
2762 // Longs, as usual, are handled specially...
2763 if (Class == cLong) {
Nate Begeman1b750222004-10-17 05:19:20 +00002764 unsigned SrcReg = getReg (Op, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002765 // If we have a constant shift, we can generate much more efficient code
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002766 // than for a variable shift by using the rlwimi instruction.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002767 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(ShiftAmount)) {
2768 unsigned Amount = CUI->getValue();
Chris Lattner77470402004-11-30 06:29:10 +00002769 if (Amount == 0) {
2770 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
2771 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1)
2772 .addReg(SrcReg+1).addReg(SrcReg+1);
2773
2774 } else if (Amount < 32) {
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002775 unsigned TempReg = makeAnotherReg(ResultTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002776 if (isLeftShift) {
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002777 BuildMI(*MBB, IP, PPC::RLWINM, 4, TempReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002778 .addImm(Amount).addImm(0).addImm(31-Amount);
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002779 BuildMI(*MBB, IP, PPC::RLWIMI, 5, DestReg).addReg(TempReg)
2780 .addReg(SrcReg+1).addImm(Amount).addImm(32-Amount).addImm(31);
Misha Brukman5b570812004-08-10 22:47:03 +00002781 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg+1).addReg(SrcReg+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00002782 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002783 } else {
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002784 BuildMI(*MBB, IP, PPC::RLWINM, 4, TempReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002785 .addImm(32-Amount).addImm(Amount).addImm(31);
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002786 BuildMI(*MBB, IP, PPC::RLWIMI, 5, DestReg+1).addReg(TempReg)
2787 .addReg(SrcReg).addImm(32-Amount).addImm(0).addImm(Amount-1);
Misha Brukman5b570812004-08-10 22:47:03 +00002788 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002789 .addImm(32-Amount).addImm(Amount).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002790 }
2791 } else { // Shifting more than 32 bits
2792 Amount -= 32;
2793 if (isLeftShift) {
2794 if (Amount != 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00002795 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002796 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002797 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002798 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002799 .addReg(SrcReg+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002800 }
Misha Brukman5b570812004-08-10 22:47:03 +00002801 BuildMI(*MBB, IP, PPC::LI, 1, DestReg+1).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00002802 } else {
2803 if (Amount != 0) {
2804 if (isSigned)
Misha Brukman5b570812004-08-10 22:47:03 +00002805 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002806 .addImm(Amount);
2807 else
Misha Brukman5b570812004-08-10 22:47:03 +00002808 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002809 .addImm(32-Amount).addImm(Amount).addImm(31);
2810 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002811 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002812 .addReg(SrcReg);
2813 }
Misha Brukman5b570812004-08-10 22:47:03 +00002814 BuildMI(*MBB, IP,PPC::LI, 1, DestReg).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002815 }
2816 }
2817 } else {
2818 unsigned TmpReg1 = makeAnotherReg(Type::IntTy);
2819 unsigned TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman422791f2004-06-21 17:41:12 +00002820 unsigned TmpReg3 = makeAnotherReg(Type::IntTy);
2821 unsigned TmpReg4 = makeAnotherReg(Type::IntTy);
2822 unsigned TmpReg5 = makeAnotherReg(Type::IntTy);
2823 unsigned TmpReg6 = makeAnotherReg(Type::IntTy);
2824 unsigned ShiftAmountReg = getReg (ShiftAmount, MBB, IP);
2825
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002826 if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002827 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002828 .addSImm(32);
Misha Brukman5b570812004-08-10 22:47:03 +00002829 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg2).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002830 .addReg(ShiftAmountReg);
Misha Brukman5b570812004-08-10 22:47:03 +00002831 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg3).addReg(SrcReg+1)
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002832 .addReg(TmpReg1);
Misha Brukman5b570812004-08-10 22:47:03 +00002833 BuildMI(*MBB, IP, PPC::OR, 2,TmpReg4).addReg(TmpReg2).addReg(TmpReg3);
2834 BuildMI(*MBB, IP, PPC::ADDI, 2, TmpReg5).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002835 .addSImm(-32);
Misha Brukman5b570812004-08-10 22:47:03 +00002836 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg6).addReg(SrcReg+1)
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002837 .addReg(TmpReg5);
Misha Brukman5b570812004-08-10 22:47:03 +00002838 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(TmpReg4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002839 .addReg(TmpReg6);
Misha Brukman5b570812004-08-10 22:47:03 +00002840 BuildMI(*MBB, IP, PPC::SLW, 2, DestReg+1).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002841 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002842 } else {
Nate Begemanf2f07812004-08-29 08:19:32 +00002843 if (isSigned) { // shift right algebraic
2844 MachineBasicBlock *TmpMBB =new MachineBasicBlock(BB->getBasicBlock());
2845 MachineBasicBlock *PhiMBB =new MachineBasicBlock(BB->getBasicBlock());
2846 MachineBasicBlock *OldMBB = BB;
2847 ilist<MachineBasicBlock>::iterator It = BB; ++It;
2848 F->getBasicBlockList().insert(It, TmpMBB);
2849 F->getBasicBlockList().insert(It, PhiMBB);
2850 BB->addSuccessor(TmpMBB);
2851 BB->addSuccessor(PhiMBB);
2852
2853 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
2854 .addSImm(32);
2855 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg2).addReg(SrcReg+1)
2856 .addReg(ShiftAmountReg);
2857 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg3).addReg(SrcReg)
2858 .addReg(TmpReg1);
2859 BuildMI(*MBB, IP, PPC::OR, 2, TmpReg4).addReg(TmpReg2)
2860 .addReg(TmpReg3);
2861 BuildMI(*MBB, IP, PPC::ADDICo, 2, TmpReg5).addReg(ShiftAmountReg)
2862 .addSImm(-32);
2863 BuildMI(*MBB, IP, PPC::SRAW, 2, TmpReg6).addReg(SrcReg)
2864 .addReg(TmpReg5);
2865 BuildMI(*MBB, IP, PPC::SRAW, 2, DestReg).addReg(SrcReg)
2866 .addReg(ShiftAmountReg);
2867 BuildMI(*MBB, IP, PPC::BLE, 2).addReg(PPC::CR0).addMBB(PhiMBB);
2868
2869 // OrMBB:
2870 // Select correct least significant half if the shift amount > 32
2871 BB = TmpMBB;
2872 unsigned OrReg = makeAnotherReg(Type::IntTy);
Chris Lattner35f2bbe2004-11-30 06:40:04 +00002873 BuildMI(BB, PPC::OR, 2, OrReg).addReg(TmpReg6).addReg(TmpReg6);
Nate Begemanf2f07812004-08-29 08:19:32 +00002874 TmpMBB->addSuccessor(PhiMBB);
2875
2876 BB = PhiMBB;
2877 BuildMI(BB, PPC::PHI, 4, DestReg+1).addReg(TmpReg4).addMBB(OldMBB)
2878 .addReg(OrReg).addMBB(TmpMBB);
2879 } else { // shift right logical
Misha Brukman5b570812004-08-10 22:47:03 +00002880 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002881 .addSImm(32);
Misha Brukman5b570812004-08-10 22:47:03 +00002882 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg2).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002883 .addReg(ShiftAmountReg);
Misha Brukman5b570812004-08-10 22:47:03 +00002884 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg3).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002885 .addReg(TmpReg1);
Misha Brukman5b570812004-08-10 22:47:03 +00002886 BuildMI(*MBB, IP, PPC::OR, 2, TmpReg4).addReg(TmpReg2)
Misha Brukman2fec9902004-06-21 20:22:03 +00002887 .addReg(TmpReg3);
Misha Brukman5b570812004-08-10 22:47:03 +00002888 BuildMI(*MBB, IP, PPC::ADDI, 2, TmpReg5).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002889 .addSImm(-32);
Misha Brukman5b570812004-08-10 22:47:03 +00002890 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg6).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002891 .addReg(TmpReg5);
Misha Brukman5b570812004-08-10 22:47:03 +00002892 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(TmpReg4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002893 .addReg(TmpReg6);
Misha Brukman5b570812004-08-10 22:47:03 +00002894 BuildMI(*MBB, IP, PPC::SRW, 2, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002895 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002896 }
2897 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002898 }
2899 return;
2900 }
2901
2902 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(ShiftAmount)) {
2903 // The shift amount is constant, guaranteed to be a ubyte. Get its value.
2904 assert(CUI->getType() == Type::UByteTy && "Shift amount not a ubyte?");
2905 unsigned Amount = CUI->getValue();
Nate Begeman1b750222004-10-17 05:19:20 +00002906
Nate Begeman905a2912004-10-24 10:33:30 +00002907 // If this is a shift with one use, and that use is an And instruction,
2908 // then attempt to emit a bitfield operation.
Nate Begeman9b508c32004-10-26 03:48:25 +00002909 if (SI && emitBitfieldInsert(SI, DestReg))
2910 return;
Nate Begeman1b750222004-10-17 05:19:20 +00002911
2912 unsigned SrcReg = getReg (Op, MBB, IP);
Chris Lattnere74ed0d2004-11-30 06:36:11 +00002913 if (Amount == 0) {
2914 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
2915 } else if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002916 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002917 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman422791f2004-06-21 17:41:12 +00002918 } else {
Misha Brukman2fec9902004-06-21 20:22:03 +00002919 if (isSigned) {
Misha Brukman5b570812004-08-10 22:47:03 +00002920 BuildMI(*MBB, IP, PPC::SRAWI,2,DestReg).addReg(SrcReg).addImm(Amount);
Misha Brukman2fec9902004-06-21 20:22:03 +00002921 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002922 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002923 .addImm(32-Amount).addImm(Amount).addImm(31);
2924 }
Misha Brukman422791f2004-06-21 17:41:12 +00002925 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002926 } else { // The shift amount is non-constant.
Nate Begeman1b750222004-10-17 05:19:20 +00002927 unsigned SrcReg = getReg (Op, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002928 unsigned ShiftAmountReg = getReg (ShiftAmount, MBB, IP);
2929
Misha Brukman422791f2004-06-21 17:41:12 +00002930 if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002931 BuildMI(*MBB, IP, PPC::SLW, 2, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002932 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002933 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002934 BuildMI(*MBB, IP, isSigned ? PPC::SRAW : PPC::SRW, 2, DestReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002935 .addReg(SrcReg).addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002936 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002937 }
2938}
2939
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002940/// LoadNeedsSignExtend - On PowerPC, there is no load byte with sign extend.
2941/// Therefore, if this is a byte load and the destination type is signed, we
Nate Begeman35b020d2004-10-06 11:03:30 +00002942/// would normally need to also emit a sign extend instruction after the load.
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002943/// However, store instructions don't care whether a signed type was sign
2944/// extended across a whole register. Also, a SetCC instruction will emit its
2945/// own sign extension to force the value into the appropriate range, so we
2946/// need not emit it here. Ideally, this kind of thing wouldn't be necessary
2947/// once LLVM's type system is improved.
2948static bool LoadNeedsSignExtend(LoadInst &LI) {
2949 if (cByte == getClassB(LI.getType()) && LI.getType()->isSigned()) {
2950 bool AllUsesAreStoresOrSetCC = true;
Nate Begeman35b020d2004-10-06 11:03:30 +00002951 for (Value::use_iterator I = LI.use_begin(), E = LI.use_end(); I != E; ++I){
Chris Lattner7c348e12004-10-06 16:28:24 +00002952 if (isa<SetCondInst>(*I))
Nate Begeman35b020d2004-10-06 11:03:30 +00002953 continue;
Chris Lattner7c348e12004-10-06 16:28:24 +00002954 if (StoreInst *SI = dyn_cast<StoreInst>(*I))
Nate Begemanb816f022004-10-07 22:30:03 +00002955 if (cByte == getClassB(SI->getOperand(0)->getType()))
Nate Begeman35b020d2004-10-06 11:03:30 +00002956 continue;
2957 AllUsesAreStoresOrSetCC = false;
2958 break;
2959 }
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002960 if (!AllUsesAreStoresOrSetCC)
2961 return true;
2962 }
2963 return false;
2964}
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002965
Misha Brukmanb097f212004-07-26 18:13:24 +00002966/// visitLoadInst - Implement LLVM load instructions. Pretty straightforward
2967/// mapping of LLVM classes to PPC load instructions, with the exception of
2968/// signed byte loads, which need a sign extension following them.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002969///
Misha Brukmana1dca552004-09-21 18:22:19 +00002970void PPC32ISel::visitLoadInst(LoadInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00002971 // Immediate opcodes, for reg+imm addressing
2972 static const unsigned ImmOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00002973 PPC::LBZ, PPC::LHZ, PPC::LWZ,
2974 PPC::LFS, PPC::LFD, PPC::LWZ
Misha Brukmanb097f212004-07-26 18:13:24 +00002975 };
2976 // Indexed opcodes, for reg+reg addressing
2977 static const unsigned IdxOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00002978 PPC::LBZX, PPC::LHZX, PPC::LWZX,
2979 PPC::LFSX, PPC::LFDX, PPC::LWZX
Misha Brukman2fec9902004-06-21 20:22:03 +00002980 };
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002981
Misha Brukmanb097f212004-07-26 18:13:24 +00002982 unsigned Class = getClassB(I.getType());
2983 unsigned ImmOpcode = ImmOpcodes[Class];
2984 unsigned IdxOpcode = IdxOpcodes[Class];
2985 unsigned DestReg = getReg(I);
2986 Value *SourceAddr = I.getOperand(0);
2987
Misha Brukman5b570812004-08-10 22:47:03 +00002988 if (Class == cShort && I.getType()->isSigned()) ImmOpcode = PPC::LHA;
2989 if (Class == cShort && I.getType()->isSigned()) IdxOpcode = PPC::LHAX;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002990
Nate Begeman53e4aa52004-11-24 21:53:14 +00002991 // If this is a fixed size alloca, emit a load directly from the stack slot
2992 // corresponding to it.
Misha Brukmanb097f212004-07-26 18:13:24 +00002993 if (AllocaInst *AI = dyn_castFixedAlloca(SourceAddr)) {
Misha Brukman422791f2004-06-21 17:41:12 +00002994 unsigned FI = getFixedSizedAllocaFI(AI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002995 if (Class == cLong) {
Misha Brukmanb097f212004-07-26 18:13:24 +00002996 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg), FI);
2997 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg+1), FI, 4);
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002998 } else if (LoadNeedsSignExtend(I)) {
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002999 unsigned TmpReg = makeAnotherReg(I.getType());
Misha Brukmanb097f212004-07-26 18:13:24 +00003000 addFrameReference(BuildMI(BB, ImmOpcode, 2, TmpReg), FI);
Misha Brukman5b570812004-08-10 22:47:03 +00003001 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003002 } else {
Misha Brukmanb097f212004-07-26 18:13:24 +00003003 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +00003004 }
Misha Brukmanb097f212004-07-26 18:13:24 +00003005 return;
3006 }
3007
Nate Begeman645495d2004-09-23 05:31:33 +00003008 // If the offset fits in 16 bits, we can emit a reg+imm load, otherwise, we
3009 // use the index from the FoldedGEP struct and use reg+reg addressing.
Misha Brukmanb097f212004-07-26 18:13:24 +00003010 if (GetElementPtrInst *GEPI = canFoldGEPIntoLoadOrStore(SourceAddr)) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003011
Nate Begeman645495d2004-09-23 05:31:33 +00003012 // Generate the code for the GEP and get the components of the folded GEP
3013 emitGEPOperation(BB, BB->end(), GEPI, true);
3014 unsigned baseReg = GEPMap[GEPI].base;
3015 unsigned indexReg = GEPMap[GEPI].index;
3016 ConstantSInt *offset = GEPMap[GEPI].offset;
3017
3018 if (Class != cLong) {
Nate Begemanbc3a5372004-11-19 08:01:16 +00003019 unsigned TmpReg = LoadNeedsSignExtend(I) ? makeAnotherReg(I.getType())
3020 : DestReg;
Nate Begeman645495d2004-09-23 05:31:33 +00003021 if (indexReg == 0)
Misha Brukmanb097f212004-07-26 18:13:24 +00003022 BuildMI(BB, ImmOpcode, 2, TmpReg).addSImm(offset->getValue())
3023 .addReg(baseReg);
Nate Begeman645495d2004-09-23 05:31:33 +00003024 else
3025 BuildMI(BB, IdxOpcode, 2, TmpReg).addReg(indexReg).addReg(baseReg);
3026 if (LoadNeedsSignExtend(I))
Misha Brukman5b570812004-08-10 22:47:03 +00003027 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Nate Begeman645495d2004-09-23 05:31:33 +00003028 } else {
3029 indexReg = (indexReg != 0) ? indexReg : getReg(offset);
Misha Brukmanb097f212004-07-26 18:13:24 +00003030 unsigned indexPlus4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003031 BuildMI(BB, PPC::ADDI, 2, indexPlus4).addReg(indexReg).addSImm(4);
Misha Brukmanb097f212004-07-26 18:13:24 +00003032 BuildMI(BB, IdxOpcode, 2, DestReg).addReg(indexReg).addReg(baseReg);
3033 BuildMI(BB, IdxOpcode, 2, DestReg+1).addReg(indexPlus4).addReg(baseReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003034 }
Misha Brukmanb097f212004-07-26 18:13:24 +00003035 return;
3036 }
3037
3038 // The fallback case, where the load was from a source that could not be
3039 // folded into the load instruction.
3040 unsigned SrcAddrReg = getReg(SourceAddr);
3041
3042 if (Class == cLong) {
3043 BuildMI(BB, ImmOpcode, 2, DestReg).addSImm(0).addReg(SrcAddrReg);
3044 BuildMI(BB, ImmOpcode, 2, DestReg+1).addSImm(4).addReg(SrcAddrReg);
Nate Begeman0e5e5f52004-08-22 08:10:15 +00003045 } else if (LoadNeedsSignExtend(I)) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003046 unsigned TmpReg = makeAnotherReg(I.getType());
3047 BuildMI(BB, ImmOpcode, 2, TmpReg).addSImm(0).addReg(SrcAddrReg);
Misha Brukman5b570812004-08-10 22:47:03 +00003048 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003049 } else {
3050 BuildMI(BB, ImmOpcode, 2, DestReg).addSImm(0).addReg(SrcAddrReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003051 }
3052}
3053
3054/// visitStoreInst - Implement LLVM store instructions
3055///
Misha Brukmana1dca552004-09-21 18:22:19 +00003056void PPC32ISel::visitStoreInst(StoreInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003057 // Immediate opcodes, for reg+imm addressing
3058 static const unsigned ImmOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00003059 PPC::STB, PPC::STH, PPC::STW,
3060 PPC::STFS, PPC::STFD, PPC::STW
Misha Brukmanb097f212004-07-26 18:13:24 +00003061 };
3062 // Indexed opcodes, for reg+reg addressing
3063 static const unsigned IdxOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00003064 PPC::STBX, PPC::STHX, PPC::STWX,
3065 PPC::STFSX, PPC::STFDX, PPC::STWX
Misha Brukmanb097f212004-07-26 18:13:24 +00003066 };
3067
3068 Value *SourceAddr = I.getOperand(1);
3069 const Type *ValTy = I.getOperand(0)->getType();
3070 unsigned Class = getClassB(ValTy);
3071 unsigned ImmOpcode = ImmOpcodes[Class];
3072 unsigned IdxOpcode = IdxOpcodes[Class];
3073 unsigned ValReg = getReg(I.getOperand(0));
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003074
Nate Begeman53e4aa52004-11-24 21:53:14 +00003075 // If this is a fixed size alloca, emit a store directly to the stack slot
3076 // corresponding to it.
3077 if (AllocaInst *AI = dyn_castFixedAlloca(SourceAddr)) {
3078 unsigned FI = getFixedSizedAllocaFI(AI);
3079 addFrameReference(BuildMI(BB, ImmOpcode, 3).addReg(ValReg), FI);
3080 if (Class == cLong)
3081 addFrameReference(BuildMI(BB, ImmOpcode, 3).addReg(ValReg+1), FI, 4);
3082 return;
3083 }
3084
Nate Begeman645495d2004-09-23 05:31:33 +00003085 // If the offset fits in 16 bits, we can emit a reg+imm store, otherwise, we
3086 // use the index from the FoldedGEP struct and use reg+reg addressing.
Misha Brukmanb097f212004-07-26 18:13:24 +00003087 if (GetElementPtrInst *GEPI = canFoldGEPIntoLoadOrStore(SourceAddr)) {
Nate Begeman645495d2004-09-23 05:31:33 +00003088 // Generate the code for the GEP and get the components of the folded GEP
3089 emitGEPOperation(BB, BB->end(), GEPI, true);
3090 unsigned baseReg = GEPMap[GEPI].base;
3091 unsigned indexReg = GEPMap[GEPI].index;
3092 ConstantSInt *offset = GEPMap[GEPI].offset;
Misha Brukmanb097f212004-07-26 18:13:24 +00003093
Nate Begeman645495d2004-09-23 05:31:33 +00003094 if (Class != cLong) {
3095 if (indexReg == 0)
3096 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(offset->getValue())
3097 .addReg(baseReg);
3098 else
3099 BuildMI(BB, IdxOpcode, 3).addReg(ValReg).addReg(indexReg)
3100 .addReg(baseReg);
3101 } else {
3102 indexReg = (indexReg != 0) ? indexReg : getReg(offset);
Misha Brukmanb097f212004-07-26 18:13:24 +00003103 unsigned indexPlus4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003104 BuildMI(BB, PPC::ADDI, 2, indexPlus4).addReg(indexReg).addSImm(4);
Misha Brukmanb097f212004-07-26 18:13:24 +00003105 BuildMI(BB, IdxOpcode, 3).addReg(ValReg).addReg(indexReg).addReg(baseReg);
3106 BuildMI(BB, IdxOpcode, 3).addReg(ValReg+1).addReg(indexPlus4)
3107 .addReg(baseReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003108 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003109 return;
3110 }
Misha Brukmanb097f212004-07-26 18:13:24 +00003111
3112 // If the store address wasn't the only use of a GEP, we fall back to the
3113 // standard path: store the ValReg at the value in AddressReg.
3114 unsigned AddressReg = getReg(I.getOperand(1));
3115 if (Class == cLong) {
3116 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(0).addReg(AddressReg);
3117 BuildMI(BB, ImmOpcode, 3).addReg(ValReg+1).addSImm(4).addReg(AddressReg);
3118 return;
3119 }
3120 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(0).addReg(AddressReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003121}
3122
3123
3124/// visitCastInst - Here we have various kinds of copying with or without sign
3125/// extension going on.
3126///
Misha Brukmana1dca552004-09-21 18:22:19 +00003127void PPC32ISel::visitCastInst(CastInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003128 Value *Op = CI.getOperand(0);
3129
3130 unsigned SrcClass = getClassB(Op->getType());
3131 unsigned DestClass = getClassB(CI.getType());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003132
Nate Begeman676dee62004-11-08 02:25:40 +00003133 // Noop casts are not emitted: getReg will return the source operand as the
3134 // register to use for any uses of the noop cast.
3135 if (DestClass == SrcClass) return;
3136
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003137 // 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 +00003138 // of the cast are GEP instructions, then the cast does not need to be
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003139 // generated explicitly, it will be folded into the GEP.
3140 if (DestClass == cLong && SrcClass == cInt) {
3141 bool AllUsesAreGEPs = true;
3142 for (Value::use_iterator I = CI.use_begin(), E = CI.use_end(); I != E; ++I)
3143 if (!isa<GetElementPtrInst>(*I)) {
3144 AllUsesAreGEPs = false;
3145 break;
3146 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003147 if (AllUsesAreGEPs) return;
3148 }
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003149
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003150 unsigned DestReg = getReg(CI);
3151 MachineBasicBlock::iterator MI = BB->end();
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003152
Nate Begeman31dfc522004-10-23 00:50:23 +00003153 // If this is a cast from an integer type to a ubyte, with one use where the
3154 // use is the shift amount argument of a shift instruction, just emit a move
3155 // instead (since the shift instruction will only look at the low 5 bits
3156 // regardless of how it is sign extended)
3157 if (CI.getType() == Type::UByteTy && SrcClass <= cInt && CI.hasOneUse()) {
3158 ShiftInst *SI = dyn_cast<ShiftInst>(*(CI.use_begin()));
3159 if (SI && (SI->getOperand(1) == &CI)) {
3160 unsigned SrcReg = getReg(Op, BB, MI);
3161 BuildMI(*BB, MI, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3162 return;
3163 }
3164 }
3165
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003166 // If this is a cast from an byte, short, or int to an integer type of equal
3167 // or lesser width, and all uses of the cast are store instructions then dont
3168 // emit them, as the store instruction will implicitly not store the zero or
3169 // sign extended bytes.
3170 if (SrcClass <= cInt && SrcClass >= DestClass) {
Nate Begeman075cdc62004-11-07 20:23:42 +00003171 bool AllUsesAreStores = true;
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003172 for (Value::use_iterator I = CI.use_begin(), E = CI.use_end(); I != E; ++I)
Nate Begeman075cdc62004-11-07 20:23:42 +00003173 if (!isa<StoreInst>(*I)) {
3174 AllUsesAreStores = false;
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003175 break;
3176 }
3177 // Turn this cast directly into a move instruction, which the register
3178 // allocator will deal with.
Nate Begeman075cdc62004-11-07 20:23:42 +00003179 if (AllUsesAreStores) {
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003180 unsigned SrcReg = getReg(Op, BB, MI);
3181 BuildMI(*BB, MI, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3182 return;
3183 }
3184 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003185 emitCastOperation(BB, MI, Op, CI.getType(), DestReg);
3186}
3187
3188/// emitCastOperation - Common code shared between visitCastInst and constant
3189/// expression cast support.
3190///
Misha Brukmana1dca552004-09-21 18:22:19 +00003191void PPC32ISel::emitCastOperation(MachineBasicBlock *MBB,
3192 MachineBasicBlock::iterator IP,
3193 Value *Src, const Type *DestTy,
3194 unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003195 const Type *SrcTy = Src->getType();
3196 unsigned SrcClass = getClassB(SrcTy);
3197 unsigned DestClass = getClassB(DestTy);
Misha Brukman7e898c32004-07-20 00:41:46 +00003198 unsigned SrcReg = getReg(Src, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003199
Nate Begeman0797d492004-10-20 21:55:41 +00003200 // Implement casts from bool to integer types as a move operation
3201 if (SrcTy == Type::BoolTy) {
3202 switch (DestClass) {
3203 case cByte:
3204 case cShort:
3205 case cInt:
3206 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3207 return;
3208 case cLong:
3209 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addImm(0);
3210 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg).addReg(SrcReg);
3211 return;
3212 default:
3213 break;
3214 }
3215 }
3216
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003217 // Implement casts to bool by using compare on the operand followed by set if
3218 // not zero on the result.
3219 if (DestTy == Type::BoolTy) {
3220 switch (SrcClass) {
3221 case cByte:
Misha Brukman422791f2004-06-21 17:41:12 +00003222 case cShort:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003223 case cInt: {
3224 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003225 BuildMI(*MBB, IP, PPC::ADDIC, 2, TmpReg).addReg(SrcReg).addSImm(-1);
3226 BuildMI(*MBB, IP, PPC::SUBFE, 2, DestReg).addReg(TmpReg).addReg(SrcReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003227 break;
3228 }
3229 case cLong: {
3230 unsigned TmpReg = makeAnotherReg(Type::IntTy);
3231 unsigned SrcReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003232 BuildMI(*MBB, IP, PPC::OR, 2, SrcReg2).addReg(SrcReg).addReg(SrcReg+1);
3233 BuildMI(*MBB, IP, PPC::ADDIC, 2, TmpReg).addReg(SrcReg2).addSImm(-1);
3234 BuildMI(*MBB, IP, PPC::SUBFE, 2, DestReg).addReg(TmpReg)
Misha Brukmanbf417a62004-07-20 20:43:05 +00003235 .addReg(SrcReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003236 break;
3237 }
Misha Brukman7e898c32004-07-20 00:41:46 +00003238 case cFP32:
3239 case cFP64:
Nate Begemanf2f07812004-08-29 08:19:32 +00003240 unsigned TmpReg = makeAnotherReg(Type::IntTy);
3241 unsigned ConstZero = getReg(ConstantFP::get(Type::DoubleTy, 0.0), BB, IP);
3242 BuildMI(*MBB, IP, PPC::FCMPU, PPC::CR7).addReg(SrcReg).addReg(ConstZero);
3243 BuildMI(*MBB, IP, PPC::MFCR, TmpReg);
3244 BuildMI(*MBB, IP, PPC::RLWINM, DestReg).addReg(TmpReg).addImm(31)
3245 .addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003246 }
3247 return;
3248 }
3249
Misha Brukman7e898c32004-07-20 00:41:46 +00003250 // Handle cast of Float -> Double
3251 if (SrcClass == cFP32 && DestClass == cFP64) {
Misha Brukman5b570812004-08-10 22:47:03 +00003252 BuildMI(*MBB, IP, PPC::FMR, 1, DestReg).addReg(SrcReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00003253 return;
3254 }
3255
3256 // Handle cast of Double -> Float
3257 if (SrcClass == cFP64 && DestClass == cFP32) {
Misha Brukman5b570812004-08-10 22:47:03 +00003258 BuildMI(*MBB, IP, PPC::FRSP, 1, DestReg).addReg(SrcReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00003259 return;
3260 }
3261
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003262 // Handle casts from integer to floating point now...
Misha Brukman7e898c32004-07-20 00:41:46 +00003263 if (DestClass == cFP32 || DestClass == cFP64) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003264
Misha Brukman422791f2004-06-21 17:41:12 +00003265 // Emit a library call for long to float conversion
3266 if (SrcClass == cLong) {
Misha Brukman7e898c32004-07-20 00:41:46 +00003267 Function *floatFn = (DestClass == cFP32) ? __floatdisfFn : __floatdidfFn;
Nate Begemanf2f07812004-08-29 08:19:32 +00003268 if (SrcTy->isSigned()) {
3269 std::vector<ValueRecord> Args;
3270 Args.push_back(ValueRecord(SrcReg, SrcTy));
3271 MachineInstr *TheCall =
3272 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3273 doCall(ValueRecord(DestReg, DestTy), TheCall, Args, false);
Nate Begemanf2f07812004-08-29 08:19:32 +00003274 } else {
3275 std::vector<ValueRecord> CmpArgs, ClrArgs, SetArgs;
3276 unsigned ZeroLong = getReg(ConstantUInt::get(SrcTy, 0));
3277 unsigned CondReg = makeAnotherReg(Type::IntTy);
3278
3279 // Update machine-CFG edges
3280 MachineBasicBlock *ClrMBB = new MachineBasicBlock(BB->getBasicBlock());
3281 MachineBasicBlock *SetMBB = new MachineBasicBlock(BB->getBasicBlock());
3282 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
3283 MachineBasicBlock *OldMBB = BB;
3284 ilist<MachineBasicBlock>::iterator It = BB; ++It;
3285 F->getBasicBlockList().insert(It, ClrMBB);
3286 F->getBasicBlockList().insert(It, SetMBB);
3287 F->getBasicBlockList().insert(It, PhiMBB);
3288 BB->addSuccessor(ClrMBB);
3289 BB->addSuccessor(SetMBB);
3290
3291 CmpArgs.push_back(ValueRecord(SrcReg, SrcTy));
3292 CmpArgs.push_back(ValueRecord(ZeroLong, SrcTy));
3293 MachineInstr *TheCall =
3294 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(__cmpdi2Fn, true);
3295 doCall(ValueRecord(CondReg, Type::IntTy), TheCall, CmpArgs, false);
Nate Begemanf2f07812004-08-29 08:19:32 +00003296 BuildMI(*MBB, IP, PPC::CMPWI, 2, PPC::CR0).addReg(CondReg).addSImm(0);
3297 BuildMI(*MBB, IP, PPC::BLE, 2).addReg(PPC::CR0).addMBB(SetMBB);
3298
3299 // ClrMBB
3300 BB = ClrMBB;
3301 unsigned ClrReg = makeAnotherReg(DestTy);
3302 ClrArgs.push_back(ValueRecord(SrcReg, SrcTy));
3303 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3304 doCall(ValueRecord(ClrReg, DestTy), TheCall, ClrArgs, false);
Nate Begemanf2f07812004-08-29 08:19:32 +00003305 BuildMI(BB, PPC::B, 1).addMBB(PhiMBB);
3306 BB->addSuccessor(PhiMBB);
3307
3308 // SetMBB
3309 BB = SetMBB;
3310 unsigned SetReg = makeAnotherReg(DestTy);
3311 unsigned CallReg = makeAnotherReg(DestTy);
3312 unsigned ShiftedReg = makeAnotherReg(SrcTy);
3313 ConstantSInt *Const1 = ConstantSInt::get(Type::IntTy, 1);
Nate Begeman9b508c32004-10-26 03:48:25 +00003314 emitShiftOperation(BB, BB->end(), Src, Const1, false, SrcTy, 0,
3315 ShiftedReg);
Nate Begemanf2f07812004-08-29 08:19:32 +00003316 SetArgs.push_back(ValueRecord(ShiftedReg, SrcTy));
3317 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3318 doCall(ValueRecord(CallReg, DestTy), TheCall, SetArgs, false);
Nate Begemanf2f07812004-08-29 08:19:32 +00003319 unsigned SetOpcode = (DestClass == cFP32) ? PPC::FADDS : PPC::FADD;
3320 BuildMI(BB, SetOpcode, 2, SetReg).addReg(CallReg).addReg(CallReg);
3321 BB->addSuccessor(PhiMBB);
3322
3323 // PhiMBB
3324 BB = PhiMBB;
3325 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(ClrReg).addMBB(ClrMBB)
3326 .addReg(SetReg).addMBB(SetMBB);
3327 }
Misha Brukman422791f2004-06-21 17:41:12 +00003328 return;
3329 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003330
Misha Brukman7e898c32004-07-20 00:41:46 +00003331 // Make sure we're dealing with a full 32 bits
Nate Begeman8531f6f2004-11-19 02:06:40 +00003332 if (SrcClass < cInt) {
3333 unsigned TmpReg = makeAnotherReg(Type::IntTy);
3334 promote32(TmpReg, ValueRecord(SrcReg, SrcTy));
3335 SrcReg = TmpReg;
3336 }
Misha Brukman422791f2004-06-21 17:41:12 +00003337
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003338 // Spill the integer to memory and reload it from there.
Misha Brukman422791f2004-06-21 17:41:12 +00003339 // Also spill room for a special conversion constant
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003340 int ValueFrameIdx =
3341 F->getFrameInfo()->CreateStackObject(Type::DoubleTy, TM.getTargetData());
3342
Nate Begeman81d265d2004-08-19 05:20:54 +00003343 MachineConstantPool *CP = F->getConstantPool();
Misha Brukman422791f2004-06-21 17:41:12 +00003344 unsigned constantHi = makeAnotherReg(Type::IntTy);
Misha Brukman422791f2004-06-21 17:41:12 +00003345 unsigned TempF = makeAnotherReg(Type::DoubleTy);
3346
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003347 if (!SrcTy->isSigned()) {
Nate Begeman81d265d2004-08-19 05:20:54 +00003348 ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, 0x1.000000p52);
3349 unsigned ConstF = getReg(CFP, BB, IP);
Nate Begemanf2f07812004-08-29 08:19:32 +00003350 BuildMI(*MBB, IP, PPC::LIS, 1, constantHi).addSImm(0x4330);
3351 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(constantHi),
Misha Brukman2fec9902004-06-21 20:22:03 +00003352 ValueFrameIdx);
Nate Begemanf2f07812004-08-29 08:19:32 +00003353 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(SrcReg),
Misha Brukman2fec9902004-06-21 20:22:03 +00003354 ValueFrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003355 addFrameReference(BuildMI(*MBB, IP, PPC::LFD, 2, TempF), ValueFrameIdx);
3356 BuildMI(*MBB, IP, PPC::FSUB, 2, DestReg).addReg(TempF).addReg(ConstF);
Misha Brukman422791f2004-06-21 17:41:12 +00003357 } else {
Nate Begeman81d265d2004-08-19 05:20:54 +00003358 ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, 0x1.000008p52);
3359 unsigned ConstF = getReg(CFP, BB, IP);
Misha Brukman422791f2004-06-21 17:41:12 +00003360 unsigned TempLo = makeAnotherReg(Type::IntTy);
Nate Begemanf2f07812004-08-29 08:19:32 +00003361 BuildMI(*MBB, IP, PPC::LIS, 1, constantHi).addSImm(0x4330);
3362 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(constantHi),
Misha Brukman2fec9902004-06-21 20:22:03 +00003363 ValueFrameIdx);
Nate Begemanf2f07812004-08-29 08:19:32 +00003364 BuildMI(*MBB, IP, PPC::XORIS, 2, TempLo).addReg(SrcReg).addImm(0x8000);
3365 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(TempLo),
Misha Brukman2fec9902004-06-21 20:22:03 +00003366 ValueFrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003367 addFrameReference(BuildMI(*MBB, IP, PPC::LFD, 2, TempF), ValueFrameIdx);
3368 BuildMI(*MBB, IP, PPC::FSUB, 2, DestReg).addReg(TempF).addReg(ConstF);
Misha Brukman422791f2004-06-21 17:41:12 +00003369 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003370 return;
3371 }
3372
3373 // Handle casts from floating point to integer now...
Misha Brukman7e898c32004-07-20 00:41:46 +00003374 if (SrcClass == cFP32 || SrcClass == cFP64) {
Nate Begemanb64af912004-08-10 20:42:36 +00003375 static Function* const Funcs[] =
3376 { __fixsfdiFn, __fixdfdiFn, __fixunssfdiFn, __fixunsdfdiFn };
Misha Brukman422791f2004-06-21 17:41:12 +00003377 // emit library call
3378 if (DestClass == cLong) {
Nate Begemanb64af912004-08-10 20:42:36 +00003379 bool isDouble = SrcClass == cFP64;
3380 unsigned nameIndex = 2 * DestTy->isSigned() + isDouble;
Misha Brukman422791f2004-06-21 17:41:12 +00003381 std::vector<ValueRecord> Args;
3382 Args.push_back(ValueRecord(SrcReg, SrcTy));
Nate Begemanb64af912004-08-10 20:42:36 +00003383 Function *floatFn = Funcs[nameIndex];
Misha Brukman2fec9902004-06-21 20:22:03 +00003384 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003385 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003386 doCall(ValueRecord(DestReg, DestTy), TheCall, Args, false);
Misha Brukman422791f2004-06-21 17:41:12 +00003387 return;
3388 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003389
3390 int ValueFrameIdx =
Nate Begeman43d64ea2004-08-15 06:42:28 +00003391 F->getFrameInfo()->CreateStackObject(Type::DoubleTy, TM.getTargetData());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003392
Misha Brukman7e898c32004-07-20 00:41:46 +00003393 if (DestTy->isSigned()) {
Misha Brukman4c14f332004-07-23 01:11:19 +00003394 unsigned TempReg = makeAnotherReg(Type::DoubleTy);
3395
3396 // Convert to integer in the FP reg and store it to a stack slot
Nate Begemanf2f07812004-08-29 08:19:32 +00003397 BuildMI(*MBB, IP, PPC::FCTIWZ, 1, TempReg).addReg(SrcReg);
3398 addFrameReference(BuildMI(*MBB, IP, PPC::STFD, 3)
Misha Brukman4c14f332004-07-23 01:11:19 +00003399 .addReg(TempReg), ValueFrameIdx);
Misha Brukmanb097f212004-07-26 18:13:24 +00003400
3401 // There is no load signed byte opcode, so we must emit a sign extend for
3402 // that particular size. Make sure to source the new integer from the
3403 // correct offset.
Misha Brukman4c14f332004-07-23 01:11:19 +00003404 if (DestClass == cByte) {
3405 unsigned TempReg2 = makeAnotherReg(DestTy);
Nate Begemanf2f07812004-08-29 08:19:32 +00003406 addFrameReference(BuildMI(*MBB, IP, PPC::LBZ, 2, TempReg2),
Misha Brukmanb097f212004-07-26 18:13:24 +00003407 ValueFrameIdx, 7);
Nate Begemanf2f07812004-08-29 08:19:32 +00003408 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(TempReg2);
Misha Brukman4c14f332004-07-23 01:11:19 +00003409 } else {
Misha Brukmanb097f212004-07-26 18:13:24 +00003410 int offset = (DestClass == cShort) ? 6 : 4;
Misha Brukman5b570812004-08-10 22:47:03 +00003411 unsigned LoadOp = (DestClass == cShort) ? PPC::LHA : PPC::LWZ;
Nate Begemanf2f07812004-08-29 08:19:32 +00003412 addFrameReference(BuildMI(*MBB, IP, LoadOp, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003413 ValueFrameIdx, offset);
Misha Brukman4c14f332004-07-23 01:11:19 +00003414 }
Misha Brukman7e898c32004-07-20 00:41:46 +00003415 } else {
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003416 unsigned Zero = getReg(ConstantFP::get(Type::DoubleTy, 0.0f));
3417 double maxInt = (1LL << 32) - 1;
3418 unsigned MaxInt = getReg(ConstantFP::get(Type::DoubleTy, maxInt));
3419 double border = 1LL << 31;
3420 unsigned Border = getReg(ConstantFP::get(Type::DoubleTy, border));
3421 unsigned UseZero = makeAnotherReg(Type::DoubleTy);
3422 unsigned UseMaxInt = makeAnotherReg(Type::DoubleTy);
3423 unsigned UseChoice = makeAnotherReg(Type::DoubleTy);
3424 unsigned TmpReg = makeAnotherReg(Type::DoubleTy);
3425 unsigned TmpReg2 = makeAnotherReg(Type::DoubleTy);
3426 unsigned ConvReg = makeAnotherReg(Type::DoubleTy);
3427 unsigned IntTmp = makeAnotherReg(Type::IntTy);
3428 unsigned XorReg = makeAnotherReg(Type::IntTy);
3429 int FrameIdx =
3430 F->getFrameInfo()->CreateStackObject(SrcTy, TM.getTargetData());
3431 // Update machine-CFG edges
3432 MachineBasicBlock *XorMBB = new MachineBasicBlock(BB->getBasicBlock());
3433 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
3434 MachineBasicBlock *OldMBB = BB;
3435 ilist<MachineBasicBlock>::iterator It = BB; ++It;
3436 F->getBasicBlockList().insert(It, XorMBB);
3437 F->getBasicBlockList().insert(It, PhiMBB);
3438 BB->addSuccessor(XorMBB);
3439 BB->addSuccessor(PhiMBB);
3440
3441 // Convert from floating point to unsigned 32-bit value
3442 // Use 0 if incoming value is < 0.0
Nate Begemanf2f07812004-08-29 08:19:32 +00003443 BuildMI(*MBB, IP, PPC::FSEL, 3, UseZero).addReg(SrcReg).addReg(SrcReg)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003444 .addReg(Zero);
3445 // Use 2**32 - 1 if incoming value is >= 2**32
Nate Begemanf2f07812004-08-29 08:19:32 +00003446 BuildMI(*MBB, IP, PPC::FSUB, 2, UseMaxInt).addReg(MaxInt).addReg(SrcReg);
3447 BuildMI(*MBB, IP, PPC::FSEL, 3, UseChoice).addReg(UseMaxInt)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003448 .addReg(UseZero).addReg(MaxInt);
3449 // Subtract 2**31
Nate Begemanf2f07812004-08-29 08:19:32 +00003450 BuildMI(*MBB, IP, PPC::FSUB, 2, TmpReg).addReg(UseChoice).addReg(Border);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003451 // Use difference if >= 2**31
Nate Begemanf2f07812004-08-29 08:19:32 +00003452 BuildMI(*MBB, IP, PPC::FCMPU, 2, PPC::CR0).addReg(UseChoice)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003453 .addReg(Border);
Nate Begemanf2f07812004-08-29 08:19:32 +00003454 BuildMI(*MBB, IP, PPC::FSEL, 3, TmpReg2).addReg(TmpReg).addReg(TmpReg)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003455 .addReg(UseChoice);
3456 // Convert to integer
Nate Begemanf2f07812004-08-29 08:19:32 +00003457 BuildMI(*MBB, IP, PPC::FCTIWZ, 1, ConvReg).addReg(TmpReg2);
3458 addFrameReference(BuildMI(*MBB, IP, PPC::STFD, 3).addReg(ConvReg),
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003459 FrameIdx);
Misha Brukmanb097f212004-07-26 18:13:24 +00003460 if (DestClass == cByte) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003461 addFrameReference(BuildMI(*MBB, IP, PPC::LBZ, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003462 FrameIdx, 7);
3463 } else if (DestClass == cShort) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003464 addFrameReference(BuildMI(*MBB, IP, PPC::LHZ, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003465 FrameIdx, 6);
3466 } if (DestClass == cInt) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003467 addFrameReference(BuildMI(*MBB, IP, PPC::LWZ, 2, IntTmp),
Misha Brukmanb097f212004-07-26 18:13:24 +00003468 FrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003469 BuildMI(*MBB, IP, PPC::BLT, 2).addReg(PPC::CR0).addMBB(PhiMBB);
3470 BuildMI(*MBB, IP, PPC::B, 1).addMBB(XorMBB);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003471
Misha Brukmanb097f212004-07-26 18:13:24 +00003472 // XorMBB:
3473 // add 2**31 if input was >= 2**31
3474 BB = XorMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00003475 BuildMI(BB, PPC::XORIS, 2, XorReg).addReg(IntTmp).addImm(0x8000);
Misha Brukmanb097f212004-07-26 18:13:24 +00003476 XorMBB->addSuccessor(PhiMBB);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003477
Misha Brukmanb097f212004-07-26 18:13:24 +00003478 // PhiMBB:
3479 // DestReg = phi [ IntTmp, OldMBB ], [ XorReg, XorMBB ]
3480 BB = PhiMBB;
Misha Brukmand2cbb872004-08-19 21:00:12 +00003481 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(IntTmp).addMBB(OldMBB)
Misha Brukmanb097f212004-07-26 18:13:24 +00003482 .addReg(XorReg).addMBB(XorMBB);
3483 }
3484 }
3485 return;
3486 }
3487
3488 // Check our invariants
3489 assert((SrcClass <= cInt || SrcClass == cLong) &&
3490 "Unhandled source class for cast operation!");
3491 assert((DestClass <= cInt || DestClass == cLong) &&
3492 "Unhandled destination class for cast operation!");
3493
3494 bool sourceUnsigned = SrcTy->isUnsigned() || SrcTy == Type::BoolTy;
3495 bool destUnsigned = DestTy->isUnsigned();
3496
3497 // Unsigned -> Unsigned, clear if larger,
3498 if (sourceUnsigned && destUnsigned) {
3499 // handle long dest class now to keep switch clean
3500 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003501 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
3502 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3503 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003504 return;
3505 }
3506
3507 // handle u{ byte, short, int } x u{ byte, short, int }
3508 unsigned clearBits = (SrcClass == cByte || DestClass == cByte) ? 24 : 16;
3509 switch (SrcClass) {
3510 case cByte:
3511 case cShort:
Nate Begeman8531f6f2004-11-19 02:06:40 +00003512 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
3513 .addImm(0).addImm(clearBits).addImm(31);
Misha Brukmanb097f212004-07-26 18:13:24 +00003514 break;
3515 case cLong:
3516 ++SrcReg;
3517 // Fall through
3518 case cInt:
Nate Begeman8531f6f2004-11-19 02:06:40 +00003519 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
3520 .addImm(0).addImm(clearBits).addImm(31);
Misha Brukmanb097f212004-07-26 18:13:24 +00003521 break;
3522 }
3523 return;
3524 }
3525
3526 // Signed -> Signed
3527 if (!sourceUnsigned && !destUnsigned) {
3528 // handle long dest class now to keep switch clean
3529 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003530 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg).addImm(31);
3531 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3532 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003533 return;
3534 }
3535
3536 // handle { byte, short, int } x { byte, short, int }
3537 switch (SrcClass) {
3538 case cByte:
Nate Begeman01136382004-11-18 04:56:53 +00003539 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003540 break;
3541 case cShort:
3542 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003543 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003544 else
Misha Brukman5b570812004-08-10 22:47:03 +00003545 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003546 break;
3547 case cLong:
3548 ++SrcReg;
3549 // Fall through
3550 case cInt:
3551 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003552 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003553 else if (DestClass == cShort)
Misha Brukman5b570812004-08-10 22:47:03 +00003554 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003555 else
Misha Brukman5b570812004-08-10 22:47:03 +00003556 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003557 break;
3558 }
3559 return;
3560 }
3561
3562 // Unsigned -> Signed
3563 if (sourceUnsigned && !destUnsigned) {
3564 // handle long dest class now to keep switch clean
3565 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003566 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
3567 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3568 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003569 return;
3570 }
3571
3572 // handle u{ byte, short, int } -> { byte, short, int }
3573 switch (SrcClass) {
3574 case cByte:
Nate Begeman01136382004-11-18 04:56:53 +00003575 // uByte 255 -> signed short/int == 255
3576 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(0)
3577 .addImm(24).addImm(31);
Misha Brukmanb097f212004-07-26 18:13:24 +00003578 break;
3579 case cShort:
3580 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003581 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003582 else
Misha Brukman5b570812004-08-10 22:47:03 +00003583 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(0)
Misha Brukmanb097f212004-07-26 18:13:24 +00003584 .addImm(16).addImm(31);
3585 break;
3586 case cLong:
3587 ++SrcReg;
3588 // Fall through
3589 case cInt:
3590 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003591 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003592 else if (DestClass == cShort)
Misha Brukman5b570812004-08-10 22:47:03 +00003593 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003594 else
Misha Brukman5b570812004-08-10 22:47:03 +00003595 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003596 break;
3597 }
3598 return;
3599 }
3600
3601 // Signed -> Unsigned
3602 if (!sourceUnsigned && destUnsigned) {
3603 // handle long dest class now to keep switch clean
3604 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003605 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg).addImm(31);
3606 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3607 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003608 return;
3609 }
3610
3611 // handle { byte, short, int } -> u{ byte, short, int }
3612 unsigned clearBits = (DestClass == cByte) ? 24 : 16;
3613 switch (SrcClass) {
3614 case cByte:
Nate Begeman01136382004-11-18 04:56:53 +00003615 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
3616 break;
Misha Brukmanb097f212004-07-26 18:13:24 +00003617 case cShort:
Nate Begeman01136382004-11-18 04:56:53 +00003618 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003619 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003620 .addImm(0).addImm(clearBits).addImm(31);
3621 else
Nate Begeman01136382004-11-18 04:56:53 +00003622 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003623 break;
3624 case cLong:
3625 ++SrcReg;
3626 // Fall through
3627 case cInt:
3628 if (DestClass == cInt)
Misha Brukman5b570812004-08-10 22:47:03 +00003629 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003630 else
Misha Brukman5b570812004-08-10 22:47:03 +00003631 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003632 .addImm(0).addImm(clearBits).addImm(31);
3633 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00003634 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003635 return;
3636 }
3637
3638 // Anything we haven't handled already, we can't (yet) handle at all.
Misha Brukmanb097f212004-07-26 18:13:24 +00003639 std::cerr << "Unhandled cast from " << SrcTy->getDescription()
3640 << "to " << DestTy->getDescription() << '\n';
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003641 abort();
3642}
3643
3644/// visitVANextInst - Implement the va_next instruction...
3645///
Misha Brukmana1dca552004-09-21 18:22:19 +00003646void PPC32ISel::visitVANextInst(VANextInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003647 unsigned VAList = getReg(I.getOperand(0));
3648 unsigned DestReg = getReg(I);
3649
3650 unsigned Size;
Misha Brukman358829f2004-06-21 17:25:55 +00003651 switch (I.getArgType()->getTypeID()) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003652 default:
3653 std::cerr << I;
3654 assert(0 && "Error: bad type for va_next instruction!");
3655 return;
3656 case Type::PointerTyID:
3657 case Type::UIntTyID:
3658 case Type::IntTyID:
3659 Size = 4;
3660 break;
3661 case Type::ULongTyID:
3662 case Type::LongTyID:
3663 case Type::DoubleTyID:
3664 Size = 8;
3665 break;
3666 }
3667
3668 // Increment the VAList pointer...
Misha Brukman5b570812004-08-10 22:47:03 +00003669 BuildMI(BB, PPC::ADDI, 2, DestReg).addReg(VAList).addSImm(Size);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003670}
3671
Misha Brukmana1dca552004-09-21 18:22:19 +00003672void PPC32ISel::visitVAArgInst(VAArgInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003673 unsigned VAList = getReg(I.getOperand(0));
3674 unsigned DestReg = getReg(I);
3675
Misha Brukman358829f2004-06-21 17:25:55 +00003676 switch (I.getType()->getTypeID()) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003677 default:
3678 std::cerr << I;
3679 assert(0 && "Error: bad type for va_next instruction!");
3680 return;
3681 case Type::PointerTyID:
3682 case Type::UIntTyID:
3683 case Type::IntTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003684 BuildMI(BB, PPC::LWZ, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003685 break;
3686 case Type::ULongTyID:
3687 case Type::LongTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003688 BuildMI(BB, PPC::LWZ, 2, DestReg).addSImm(0).addReg(VAList);
3689 BuildMI(BB, PPC::LWZ, 2, DestReg+1).addSImm(4).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003690 break;
Misha Brukmanb097f212004-07-26 18:13:24 +00003691 case Type::FloatTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003692 BuildMI(BB, PPC::LFS, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukmanb097f212004-07-26 18:13:24 +00003693 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003694 case Type::DoubleTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003695 BuildMI(BB, PPC::LFD, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003696 break;
3697 }
3698}
3699
3700/// visitGetElementPtrInst - instruction-select GEP instructions
3701///
Misha Brukmana1dca552004-09-21 18:22:19 +00003702void PPC32ISel::visitGetElementPtrInst(GetElementPtrInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003703 if (canFoldGEPIntoLoadOrStore(&I))
3704 return;
3705
Nate Begeman645495d2004-09-23 05:31:33 +00003706 emitGEPOperation(BB, BB->end(), &I, false);
3707}
3708
Misha Brukman1013ef52004-07-21 20:09:08 +00003709/// emitGEPOperation - Common code shared between visitGetElementPtrInst and
3710/// constant expression GEP support.
3711///
Misha Brukmana1dca552004-09-21 18:22:19 +00003712void PPC32ISel::emitGEPOperation(MachineBasicBlock *MBB,
3713 MachineBasicBlock::iterator IP,
Nate Begeman645495d2004-09-23 05:31:33 +00003714 GetElementPtrInst *GEPI, bool GEPIsFolded) {
3715 // If we've already emitted this particular GEP, just return to avoid
3716 // multiple definitions of the base register.
Nate Begemana41fc772004-09-29 02:35:05 +00003717 if (GEPIsFolded && (GEPMap[GEPI].base != 0))
Nate Begeman645495d2004-09-23 05:31:33 +00003718 return;
Nate Begeman645495d2004-09-23 05:31:33 +00003719
3720 Value *Src = GEPI->getOperand(0);
3721 User::op_iterator IdxBegin = GEPI->op_begin()+1;
3722 User::op_iterator IdxEnd = GEPI->op_end();
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003723 const TargetData &TD = TM.getTargetData();
3724 const Type *Ty = Src->getType();
Misha Brukmane2eceb52004-07-23 16:08:20 +00003725 int64_t constValue = 0;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003726
3727 // Record the operations to emit the GEP in a vector so that we can emit them
3728 // after having analyzed the entire instruction.
Misha Brukmanb097f212004-07-26 18:13:24 +00003729 std::vector<CollapsedGepOp> ops;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003730
Misha Brukman1013ef52004-07-21 20:09:08 +00003731 // GEPs have zero or more indices; we must perform a struct access
3732 // or array access for each one.
3733 for (GetElementPtrInst::op_iterator oi = IdxBegin, oe = IdxEnd; oi != oe;
3734 ++oi) {
3735 Value *idx = *oi;
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003736 if (const StructType *StTy = dyn_cast<StructType>(Ty)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00003737 // It's a struct access. idx is the index into the structure,
3738 // which names the field. Use the TargetData structure to
3739 // pick out what the layout of the structure is in memory.
3740 // Use the (constant) structure index's value to find the
3741 // right byte offset from the StructLayout class's list of
3742 // structure member offsets.
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003743 unsigned fieldIndex = cast<ConstantUInt>(idx)->getValue();
Misha Brukmane2eceb52004-07-23 16:08:20 +00003744
3745 // StructType member offsets are always constant values. Add it to the
3746 // running total.
Nate Begeman645495d2004-09-23 05:31:33 +00003747 constValue += TD.getStructLayout(StTy)->MemberOffsets[fieldIndex];
Misha Brukmane2eceb52004-07-23 16:08:20 +00003748
Nate Begeman645495d2004-09-23 05:31:33 +00003749 // The next type is the member of the structure selected by the index.
Misha Brukmane2eceb52004-07-23 16:08:20 +00003750 Ty = StTy->getElementType (fieldIndex);
Nate Begeman645495d2004-09-23 05:31:33 +00003751 } else if (const SequentialType *SqTy = dyn_cast<SequentialType>(Ty)) {
Misha Brukman313efcb2004-07-09 15:45:07 +00003752 // Many GEP instructions use a [cast (int/uint) to LongTy] as their
3753 // operand. Handle this case directly now...
3754 if (CastInst *CI = dyn_cast<CastInst>(idx))
3755 if (CI->getOperand(0)->getType() == Type::IntTy ||
3756 CI->getOperand(0)->getType() == Type::UIntTy)
3757 idx = CI->getOperand(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00003758
Misha Brukmane2eceb52004-07-23 16:08:20 +00003759 // It's an array or pointer access: [ArraySize x ElementType].
3760 // We want to add basePtrReg to (idxReg * sizeof ElementType). First, we
3761 // must find the size of the pointed-to type (Not coincidentally, the next
3762 // type is the type of the elements in the array).
Misha Brukman1013ef52004-07-21 20:09:08 +00003763 Ty = SqTy->getElementType();
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003764 unsigned elementSize = TD.getTypeSize(Ty);
Misha Brukman1013ef52004-07-21 20:09:08 +00003765
Misha Brukmane2eceb52004-07-23 16:08:20 +00003766 if (ConstantInt *C = dyn_cast<ConstantInt>(idx)) {
Misha Brukmane2eceb52004-07-23 16:08:20 +00003767 if (ConstantSInt *CS = dyn_cast<ConstantSInt>(C))
3768 constValue += CS->getValue() * elementSize;
3769 else if (ConstantUInt *CU = dyn_cast<ConstantUInt>(C))
3770 constValue += CU->getValue() * elementSize;
3771 else
3772 assert(0 && "Invalid ConstantInt GEP index type!");
3773 } else {
Nate Begeman645495d2004-09-23 05:31:33 +00003774 // Push current gep state to this point as an add and multiply
3775 ops.push_back(CollapsedGepOp(
3776 ConstantSInt::get(Type::IntTy, constValue),
3777 idx, ConstantUInt::get(Type::UIntTy, elementSize)));
3778
Misha Brukmane2eceb52004-07-23 16:08:20 +00003779 constValue = 0;
Misha Brukman313efcb2004-07-09 15:45:07 +00003780 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003781 }
Misha Brukmane2eceb52004-07-23 16:08:20 +00003782 }
Misha Brukmane2eceb52004-07-23 16:08:20 +00003783 // Emit instructions for all the collapsed ops
Nate Begeman645495d2004-09-23 05:31:33 +00003784 unsigned indexReg = 0;
Misha Brukmanb097f212004-07-26 18:13:24 +00003785 for(std::vector<CollapsedGepOp>::iterator cgo_i = ops.begin(),
Misha Brukmane2eceb52004-07-23 16:08:20 +00003786 cgo_e = ops.end(); cgo_i != cgo_e; ++cgo_i) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003787 CollapsedGepOp& cgo = *cgo_i;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003788
Nate Begeman8531f6f2004-11-19 02:06:40 +00003789 // Avoid emitting known move instructions here for the register allocator
3790 // to deal with later. val * 1 == val. val + 0 == val.
3791 unsigned TmpReg1;
3792 if (cgo.size->getValue() == 1) {
3793 TmpReg1 = getReg(cgo.index, MBB, IP);
3794 } else {
3795 TmpReg1 = makeAnotherReg(Type::IntTy);
3796 doMultiplyConst(MBB, IP, TmpReg1, cgo.index, cgo.size);
3797 }
3798
3799 unsigned TmpReg2;
3800 if (cgo.offset->isNullValue()) {
3801 TmpReg2 = TmpReg1;
3802 } else {
3803 TmpReg2 = makeAnotherReg(Type::IntTy);
3804 emitBinaryConstOperation(MBB, IP, TmpReg1, cgo.offset, 0, TmpReg2);
3805 }
Nate Begeman645495d2004-09-23 05:31:33 +00003806
3807 if (indexReg == 0)
3808 indexReg = TmpReg2;
3809 else {
3810 unsigned TmpReg3 = makeAnotherReg(Type::IntTy);
3811 BuildMI(*MBB, IP, PPC::ADD, 2, TmpReg3).addReg(indexReg).addReg(TmpReg2);
3812 indexReg = TmpReg3;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003813 }
Misha Brukman2fec9902004-06-21 20:22:03 +00003814 }
Nate Begeman645495d2004-09-23 05:31:33 +00003815
3816 // We now have a base register, an index register, and possibly a constant
3817 // remainder. If the GEP is going to be folded, we try to generate the
3818 // optimal addressing mode.
Misha Brukmane2eceb52004-07-23 16:08:20 +00003819 ConstantSInt *remainder = ConstantSInt::get(Type::IntTy, constValue);
3820
Misha Brukmanb097f212004-07-26 18:13:24 +00003821 // If we are emitting this during a fold, copy the current base register to
3822 // the target, and save the current constant offset so the folding load or
3823 // store can try and use it as an immediate.
3824 if (GEPIsFolded) {
Nate Begeman645495d2004-09-23 05:31:33 +00003825 if (indexReg == 0) {
Nate Begemanb816f022004-10-07 22:30:03 +00003826 if (!canUseAsImmediateForOpcode(remainder, 0, false)) {
Nate Begeman645495d2004-09-23 05:31:33 +00003827 indexReg = getReg(remainder, MBB, IP);
3828 remainder = 0;
Nate Begemanb64af912004-08-10 20:42:36 +00003829 }
Nate Begemanbc3a5372004-11-19 08:01:16 +00003830 } else if (!remainder->isNullValue()) {
Nate Begeman645495d2004-09-23 05:31:33 +00003831 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Nate Begemanb816f022004-10-07 22:30:03 +00003832 emitBinaryConstOperation(MBB, IP, indexReg, remainder, 0, TmpReg);
Nate Begeman645495d2004-09-23 05:31:33 +00003833 indexReg = TmpReg;
3834 remainder = 0;
Nate Begemanb64af912004-08-10 20:42:36 +00003835 }
Nate Begemandb869aa2004-11-18 07:22:46 +00003836 unsigned basePtrReg = getReg(Src, MBB, IP);
3837 GEPMap[GEPI] = FoldedGEP(basePtrReg, indexReg, remainder);
Misha Brukmanb097f212004-07-26 18:13:24 +00003838 return;
3839 }
Nate Begemanb64af912004-08-10 20:42:36 +00003840
Nate Begeman645495d2004-09-23 05:31:33 +00003841 // We're not folding, so collapse the base, index, and any remainder into the
3842 // destination register.
Nate Begemandb869aa2004-11-18 07:22:46 +00003843 unsigned TargetReg = getReg(GEPI, MBB, IP);
3844 unsigned basePtrReg = getReg(Src, MBB, IP);
Nate Begemanbc3a5372004-11-19 08:01:16 +00003845
Nate Begeman486ebfd2004-11-21 05:14:06 +00003846 if ((indexReg == 0) && remainder->isNullValue()) {
3847 BuildMI(*MBB, IP, PPC::OR, 2, TargetReg).addReg(basePtrReg)
3848 .addReg(basePtrReg);
3849 return;
3850 }
Nate Begemanbc3a5372004-11-19 08:01:16 +00003851 if (!remainder->isNullValue()) {
3852 unsigned TmpReg = (indexReg == 0) ? TargetReg : makeAnotherReg(Type::IntTy);
3853 emitBinaryConstOperation(MBB, IP, basePtrReg, remainder, 0, TmpReg);
Nate Begemanb64af912004-08-10 20:42:36 +00003854 basePtrReg = TmpReg;
3855 }
Nate Begeman486ebfd2004-11-21 05:14:06 +00003856 if (indexReg != 0)
Nate Begemanbc3a5372004-11-19 08:01:16 +00003857 BuildMI(*MBB, IP, PPC::ADD, 2, TargetReg).addReg(indexReg)
3858 .addReg(basePtrReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003859}
3860
3861/// visitAllocaInst - If this is a fixed size alloca, allocate space from the
3862/// frame manager, otherwise do it the hard way.
3863///
Misha Brukmana1dca552004-09-21 18:22:19 +00003864void PPC32ISel::visitAllocaInst(AllocaInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003865 // If this is a fixed size alloca in the entry block for the function, we
3866 // statically stack allocate the space, so we don't need to do anything here.
3867 //
3868 if (dyn_castFixedAlloca(&I)) return;
3869
3870 // Find the data size of the alloca inst's getAllocatedType.
3871 const Type *Ty = I.getAllocatedType();
3872 unsigned TySize = TM.getTargetData().getTypeSize(Ty);
3873
3874 // Create a register to hold the temporary result of multiplying the type size
3875 // constant by the variable amount.
3876 unsigned TotalSizeReg = makeAnotherReg(Type::UIntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003877
3878 // TotalSizeReg = mul <numelements>, <TypeSize>
3879 MachineBasicBlock::iterator MBBI = BB->end();
Misha Brukman1013ef52004-07-21 20:09:08 +00003880 ConstantUInt *CUI = ConstantUInt::get(Type::UIntTy, TySize);
3881 doMultiplyConst(BB, MBBI, TotalSizeReg, I.getArraySize(), CUI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003882
3883 // AddedSize = add <TotalSizeReg>, 15
3884 unsigned AddedSizeReg = makeAnotherReg(Type::UIntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003885 BuildMI(BB, PPC::ADDI, 2, AddedSizeReg).addReg(TotalSizeReg).addSImm(15);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003886
3887 // AlignedSize = and <AddedSize>, ~15
3888 unsigned AlignedSize = makeAnotherReg(Type::UIntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003889 BuildMI(BB, PPC::RLWINM, 4, AlignedSize).addReg(AddedSizeReg).addImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00003890 .addImm(0).addImm(27);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003891
3892 // Subtract size from stack pointer, thereby allocating some space.
Misha Brukman5b570812004-08-10 22:47:03 +00003893 BuildMI(BB, PPC::SUB, 2, PPC::R1).addReg(PPC::R1).addReg(AlignedSize);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003894
3895 // Put a pointer to the space into the result register, by copying
3896 // the stack pointer.
Misha Brukman5b570812004-08-10 22:47:03 +00003897 BuildMI(BB, PPC::OR, 2, getReg(I)).addReg(PPC::R1).addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003898
3899 // Inform the Frame Information that we have just allocated a variable-sized
3900 // object.
3901 F->getFrameInfo()->CreateVariableSizedObject();
3902}
3903
3904/// visitMallocInst - Malloc instructions are code generated into direct calls
3905/// to the library malloc.
3906///
Misha Brukmana1dca552004-09-21 18:22:19 +00003907void PPC32ISel::visitMallocInst(MallocInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003908 unsigned AllocSize = TM.getTargetData().getTypeSize(I.getAllocatedType());
3909 unsigned Arg;
3910
3911 if (ConstantUInt *C = dyn_cast<ConstantUInt>(I.getOperand(0))) {
3912 Arg = getReg(ConstantUInt::get(Type::UIntTy, C->getValue() * AllocSize));
3913 } else {
3914 Arg = makeAnotherReg(Type::UIntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003915 MachineBasicBlock::iterator MBBI = BB->end();
Misha Brukman1013ef52004-07-21 20:09:08 +00003916 ConstantUInt *CUI = ConstantUInt::get(Type::UIntTy, AllocSize);
3917 doMultiplyConst(BB, MBBI, Arg, I.getOperand(0), CUI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003918 }
3919
3920 std::vector<ValueRecord> Args;
3921 Args.push_back(ValueRecord(Arg, Type::UIntTy));
Misha Brukman2fec9902004-06-21 20:22:03 +00003922 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003923 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(mallocFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003924 doCall(ValueRecord(getReg(I), I.getType()), TheCall, Args, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003925}
3926
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003927/// visitFreeInst - Free instructions are code gen'd to call the free libc
3928/// function.
3929///
Misha Brukmana1dca552004-09-21 18:22:19 +00003930void PPC32ISel::visitFreeInst(FreeInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003931 std::vector<ValueRecord> Args;
3932 Args.push_back(ValueRecord(I.getOperand(0)));
Misha Brukman2fec9902004-06-21 20:22:03 +00003933 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003934 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(freeFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003935 doCall(ValueRecord(0, Type::VoidTy), TheCall, Args, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003936}
3937
Misha Brukman3d9a6c22004-08-11 00:09:42 +00003938/// createPPC32ISelSimple - This pass converts an LLVM function into a machine
3939/// code representation is a very simple peep-hole fashion.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003940///
Misha Brukman3d9a6c22004-08-11 00:09:42 +00003941FunctionPass *llvm::createPPC32ISelSimple(TargetMachine &TM) {
Misha Brukmana1dca552004-09-21 18:22:19 +00003942 return new PPC32ISel(TM);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003943}