blob: f2fc56395748b6d0a612f3cdc7d478db757dfd11 [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 Brukmane2eceb52004-07-23 16:08:20 +0000711
712 // Add the GV to the list of things whose addresses have been taken.
713 TM.AddressTaken.insert(GV);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000714 } else {
Chris Lattner76e2df22004-07-15 02:14:30 +0000715 std::cerr << "Offending constant: " << *C << "\n";
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000716 assert(0 && "Type not handled yet!");
717 }
718}
719
720/// LoadArgumentsToVirtualRegs - Load all of the arguments to this function from
721/// the stack into virtual registers.
Misha Brukmana1dca552004-09-21 18:22:19 +0000722void PPC32ISel::LoadArgumentsToVirtualRegs(Function &Fn) {
Chris Lattner3ea93462004-08-06 06:58:50 +0000723 unsigned ArgOffset = 24;
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000724 unsigned GPR_remaining = 8;
725 unsigned FPR_remaining = 13;
Misha Brukmand18a31d2004-07-06 22:51:53 +0000726 unsigned GPR_idx = 0, FPR_idx = 0;
727 static const unsigned GPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +0000728 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
729 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
Misha Brukmand18a31d2004-07-06 22:51:53 +0000730 };
731 static const unsigned FPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +0000732 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
733 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
Misha Brukmand18a31d2004-07-06 22:51:53 +0000734 };
Misha Brukman422791f2004-06-21 17:41:12 +0000735
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000736 MachineFrameInfo *MFI = F->getFrameInfo();
Misha Brukmand18a31d2004-07-06 22:51:53 +0000737
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000738 for (Function::aiterator I = Fn.abegin(), E = Fn.aend(); I != E; ++I) {
739 bool ArgLive = !I->use_empty();
740 unsigned Reg = ArgLive ? getReg(*I) : 0;
741 int FI; // Frame object index
742
743 switch (getClassB(I->getType())) {
744 case cByte:
745 if (ArgLive) {
Misha Brukmanec6319a2004-07-20 15:51:37 +0000746 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000747 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000748 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]);
749 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000750 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000751 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000752 addFrameReference(BuildMI(BB, PPC::LBZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000753 }
754 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000755 break;
756 case cShort:
757 if (ArgLive) {
Misha Brukmanec6319a2004-07-20 15:51:37 +0000758 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000759 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000760 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]);
761 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000762 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000763 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000764 addFrameReference(BuildMI(BB, PPC::LHZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000765 }
766 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000767 break;
768 case cInt:
769 if (ArgLive) {
770 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000771 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000772 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]);
773 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000774 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000775 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000776 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000777 }
778 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000779 break;
780 case cLong:
781 if (ArgLive) {
782 FI = MFI->CreateFixedObject(8, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000783 if (GPR_remaining > 1) {
Misha Brukman5b570812004-08-10 22:47:03 +0000784 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]);
785 BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx+1]);
786 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukman313efcb2004-07-09 15:45:07 +0000787 .addReg(GPR[GPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000788 BuildMI(BB, PPC::OR, 2, Reg+1).addReg(GPR[GPR_idx+1])
Misha Brukman313efcb2004-07-09 15:45:07 +0000789 .addReg(GPR[GPR_idx+1]);
Misha Brukman422791f2004-06-21 17:41:12 +0000790 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000791 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg), FI);
792 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg+1), FI, 4);
Misha Brukman422791f2004-06-21 17:41:12 +0000793 }
794 }
Misha Brukman1013ef52004-07-21 20:09:08 +0000795 // longs require 4 additional bytes and use 2 GPRs
796 ArgOffset += 4;
Misha Brukman422791f2004-06-21 17:41:12 +0000797 if (GPR_remaining > 1) {
Misha Brukman1013ef52004-07-21 20:09:08 +0000798 GPR_remaining--;
Misha Brukman422791f2004-06-21 17:41:12 +0000799 GPR_idx++;
800 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000801 break;
Misha Brukman7e898c32004-07-20 00:41:46 +0000802 case cFP32:
803 if (ArgLive) {
804 FI = MFI->CreateFixedObject(4, ArgOffset);
805
Misha Brukman422791f2004-06-21 17:41:12 +0000806 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000807 BuildMI(BB, PPC::IMPLICIT_DEF, 0, FPR[FPR_idx]);
808 BuildMI(BB, PPC::FMR, 1, Reg).addReg(FPR[FPR_idx]);
Misha Brukmand18a31d2004-07-06 22:51:53 +0000809 FPR_remaining--;
810 FPR_idx++;
Misha Brukman422791f2004-06-21 17:41:12 +0000811 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000812 addFrameReference(BuildMI(BB, PPC::LFS, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000813 }
814 }
Misha Brukman7e898c32004-07-20 00:41:46 +0000815 break;
816 case cFP64:
817 if (ArgLive) {
818 FI = MFI->CreateFixedObject(8, ArgOffset);
819
820 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +0000821 BuildMI(BB, PPC::IMPLICIT_DEF, 0, FPR[FPR_idx]);
822 BuildMI(BB, PPC::FMR, 1, Reg).addReg(FPR[FPR_idx]);
Misha Brukman7e898c32004-07-20 00:41:46 +0000823 FPR_remaining--;
824 FPR_idx++;
825 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000826 addFrameReference(BuildMI(BB, PPC::LFD, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000827 }
828 }
Misha Brukman7e898c32004-07-20 00:41:46 +0000829
830 // doubles require 4 additional bytes and use 2 GPRs of param space
831 ArgOffset += 4;
832 if (GPR_remaining > 0) {
833 GPR_remaining--;
834 GPR_idx++;
835 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000836 break;
837 default:
838 assert(0 && "Unhandled argument type!");
839 }
840 ArgOffset += 4; // Each argument takes at least 4 bytes on the stack...
Misha Brukman422791f2004-06-21 17:41:12 +0000841 if (GPR_remaining > 0) {
Misha Brukmand18a31d2004-07-06 22:51:53 +0000842 GPR_remaining--; // uses up 2 GPRs
843 GPR_idx++;
Misha Brukman422791f2004-06-21 17:41:12 +0000844 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000845 }
846
847 // If the function takes variable number of arguments, add a frame offset for
848 // the start of the first vararg value... this is used to expand
849 // llvm.va_start.
850 if (Fn.getFunctionType()->isVarArg())
Misha Brukmanb097f212004-07-26 18:13:24 +0000851 VarArgsFrameIndex = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000852}
853
854
855/// SelectPHINodes - Insert machine code to generate phis. This is tricky
856/// because we have to generate our sources into the source basic blocks, not
857/// the current one.
858///
Misha Brukmana1dca552004-09-21 18:22:19 +0000859void PPC32ISel::SelectPHINodes() {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000860 const TargetInstrInfo &TII = *TM.getInstrInfo();
861 const Function &LF = *F->getFunction(); // The LLVM function...
862 for (Function::const_iterator I = LF.begin(), E = LF.end(); I != E; ++I) {
863 const BasicBlock *BB = I;
864 MachineBasicBlock &MBB = *MBBMap[I];
865
866 // Loop over all of the PHI nodes in the LLVM basic block...
867 MachineBasicBlock::iterator PHIInsertPoint = MBB.begin();
868 for (BasicBlock::const_iterator I = BB->begin();
869 PHINode *PN = const_cast<PHINode*>(dyn_cast<PHINode>(I)); ++I) {
870
871 // Create a new machine instr PHI node, and insert it.
872 unsigned PHIReg = getReg(*PN);
873 MachineInstr *PhiMI = BuildMI(MBB, PHIInsertPoint,
Misha Brukman5b570812004-08-10 22:47:03 +0000874 PPC::PHI, PN->getNumOperands(), PHIReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000875
876 MachineInstr *LongPhiMI = 0;
877 if (PN->getType() == Type::LongTy || PN->getType() == Type::ULongTy)
878 LongPhiMI = BuildMI(MBB, PHIInsertPoint,
Misha Brukman5b570812004-08-10 22:47:03 +0000879 PPC::PHI, PN->getNumOperands(), PHIReg+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000880
881 // PHIValues - Map of blocks to incoming virtual registers. We use this
882 // so that we only initialize one incoming value for a particular block,
883 // even if the block has multiple entries in the PHI node.
884 //
885 std::map<MachineBasicBlock*, unsigned> PHIValues;
886
887 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
Misha Brukman313efcb2004-07-09 15:45:07 +0000888 MachineBasicBlock *PredMBB = 0;
889 for (MachineBasicBlock::pred_iterator PI = MBB.pred_begin (),
890 PE = MBB.pred_end (); PI != PE; ++PI)
891 if (PN->getIncomingBlock(i) == (*PI)->getBasicBlock()) {
892 PredMBB = *PI;
893 break;
894 }
895 assert (PredMBB && "Couldn't find incoming machine-cfg edge for phi");
896
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000897 unsigned ValReg;
898 std::map<MachineBasicBlock*, unsigned>::iterator EntryIt =
899 PHIValues.lower_bound(PredMBB);
900
901 if (EntryIt != PHIValues.end() && EntryIt->first == PredMBB) {
902 // We already inserted an initialization of the register for this
903 // predecessor. Recycle it.
904 ValReg = EntryIt->second;
Misha Brukman47225442004-07-23 22:35:49 +0000905 } else {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000906 // Get the incoming value into a virtual register.
907 //
908 Value *Val = PN->getIncomingValue(i);
909
910 // If this is a constant or GlobalValue, we may have to insert code
911 // into the basic block to compute it into a virtual register.
912 if ((isa<Constant>(Val) && !isa<ConstantExpr>(Val)) ||
913 isa<GlobalValue>(Val)) {
914 // Simple constants get emitted at the end of the basic block,
915 // before any terminator instructions. We "know" that the code to
916 // move a constant into a register will never clobber any flags.
917 ValReg = getReg(Val, PredMBB, PredMBB->getFirstTerminator());
918 } else {
919 // Because we don't want to clobber any values which might be in
920 // physical registers with the computation of this constant (which
921 // might be arbitrarily complex if it is a constant expression),
922 // just insert the computation at the top of the basic block.
923 MachineBasicBlock::iterator PI = PredMBB->begin();
Misha Brukman47225442004-07-23 22:35:49 +0000924
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000925 // Skip over any PHI nodes though!
Misha Brukman5b570812004-08-10 22:47:03 +0000926 while (PI != PredMBB->end() && PI->getOpcode() == PPC::PHI)
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000927 ++PI;
Misha Brukman47225442004-07-23 22:35:49 +0000928
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000929 ValReg = getReg(Val, PredMBB, PI);
930 }
931
932 // Remember that we inserted a value for this PHI for this predecessor
933 PHIValues.insert(EntryIt, std::make_pair(PredMBB, ValReg));
934 }
935
936 PhiMI->addRegOperand(ValReg);
937 PhiMI->addMachineBasicBlockOperand(PredMBB);
938 if (LongPhiMI) {
939 LongPhiMI->addRegOperand(ValReg+1);
940 LongPhiMI->addMachineBasicBlockOperand(PredMBB);
941 }
942 }
943
944 // Now that we emitted all of the incoming values for the PHI node, make
945 // sure to reposition the InsertPoint after the PHI that we just added.
946 // This is needed because we might have inserted a constant into this
947 // block, right after the PHI's which is before the old insert point!
948 PHIInsertPoint = LongPhiMI ? LongPhiMI : PhiMI;
949 ++PHIInsertPoint;
950 }
951 }
952}
953
954
955// canFoldSetCCIntoBranchOrSelect - Return the setcc instruction if we can fold
956// it into the conditional branch or select instruction which is the only user
957// of the cc instruction. This is the case if the conditional branch is the
958// only user of the setcc, and if the setcc is in the same basic block as the
Misha Brukman1013ef52004-07-21 20:09:08 +0000959// conditional branch.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000960//
961static SetCondInst *canFoldSetCCIntoBranchOrSelect(Value *V) {
962 if (SetCondInst *SCI = dyn_cast<SetCondInst>(V))
963 if (SCI->hasOneUse()) {
964 Instruction *User = cast<Instruction>(SCI->use_back());
965 if ((isa<BranchInst>(User) || isa<SelectInst>(User)) &&
Misha Brukmanbebde752004-07-16 21:06:24 +0000966 SCI->getParent() == User->getParent())
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000967 return SCI;
968 }
969 return 0;
970}
971
Misha Brukmanb097f212004-07-26 18:13:24 +0000972// canFoldGEPIntoLoadOrStore - Return the GEP instruction if we can fold it into
973// the load or store instruction that is the only user of the GEP.
974//
975static GetElementPtrInst *canFoldGEPIntoLoadOrStore(Value *V) {
Nate Begeman645495d2004-09-23 05:31:33 +0000976 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(V)) {
977 bool AllUsesAreMem = true;
978 for (Value::use_iterator I = GEPI->use_begin(), E = GEPI->use_end();
979 I != E; ++I) {
980 Instruction *User = cast<Instruction>(*I);
981
982 // If the GEP is the target of a store, but not the source, then we are ok
983 // to fold it.
Misha Brukmanb097f212004-07-26 18:13:24 +0000984 if (isa<StoreInst>(User) &&
985 GEPI->getParent() == User->getParent() &&
986 User->getOperand(0) != GEPI &&
Nate Begeman645495d2004-09-23 05:31:33 +0000987 User->getOperand(1) == GEPI)
988 continue;
989
990 // If the GEP is the source of a load, then we're always ok to fold it
Misha Brukmanb097f212004-07-26 18:13:24 +0000991 if (isa<LoadInst>(User) &&
992 GEPI->getParent() == User->getParent() &&
Nate Begeman645495d2004-09-23 05:31:33 +0000993 User->getOperand(0) == GEPI)
994 continue;
995
996 // if we got to this point, than the instruction was not a load or store
997 // that we are capable of folding the GEP into.
998 AllUsesAreMem = false;
999 break;
Misha Brukmanb097f212004-07-26 18:13:24 +00001000 }
Nate Begeman645495d2004-09-23 05:31:33 +00001001 if (AllUsesAreMem)
1002 return GEPI;
1003 }
Misha Brukmanb097f212004-07-26 18:13:24 +00001004 return 0;
1005}
1006
1007
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001008// Return a fixed numbering for setcc instructions which does not depend on the
1009// order of the opcodes.
1010//
1011static unsigned getSetCCNumber(unsigned Opcode) {
Misha Brukmane9c65512004-07-06 15:32:44 +00001012 switch (Opcode) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001013 default: assert(0 && "Unknown setcc instruction!");
1014 case Instruction::SetEQ: return 0;
1015 case Instruction::SetNE: return 1;
1016 case Instruction::SetLT: return 2;
1017 case Instruction::SetGE: return 3;
1018 case Instruction::SetGT: return 4;
1019 case Instruction::SetLE: return 5;
1020 }
1021}
1022
Misha Brukmane9c65512004-07-06 15:32:44 +00001023static unsigned getPPCOpcodeForSetCCNumber(unsigned Opcode) {
1024 switch (Opcode) {
1025 default: assert(0 && "Unknown setcc instruction!");
Misha Brukman5b570812004-08-10 22:47:03 +00001026 case Instruction::SetEQ: return PPC::BEQ;
1027 case Instruction::SetNE: return PPC::BNE;
1028 case Instruction::SetLT: return PPC::BLT;
1029 case Instruction::SetGE: return PPC::BGE;
1030 case Instruction::SetGT: return PPC::BGT;
1031 case Instruction::SetLE: return PPC::BLE;
Misha Brukmane9c65512004-07-06 15:32:44 +00001032 }
1033}
1034
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001035/// emitUCOM - emits an unordered FP compare.
Misha Brukmana1dca552004-09-21 18:22:19 +00001036void PPC32ISel::emitUCOM(MachineBasicBlock *MBB, MachineBasicBlock::iterator IP,
1037 unsigned LHS, unsigned RHS) {
Misha Brukman5b570812004-08-10 22:47:03 +00001038 BuildMI(*MBB, IP, PPC::FCMPU, 2, PPC::CR0).addReg(LHS).addReg(RHS);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001039}
1040
Misha Brukmana1dca552004-09-21 18:22:19 +00001041unsigned PPC32ISel::ExtendOrClear(MachineBasicBlock *MBB,
1042 MachineBasicBlock::iterator IP,
Nate Begemana2de1022004-09-22 04:40:25 +00001043 Value *Op0) {
Nate Begeman0e5e5f52004-08-22 08:10:15 +00001044 const Type *CompTy = Op0->getType();
1045 unsigned Reg = getReg(Op0, MBB, IP);
Nate Begemanb47321b2004-08-20 09:56:22 +00001046 unsigned Class = getClassB(CompTy);
1047
Nate Begeman1b99fd32004-09-29 03:45:33 +00001048 // Since we know that boolean values will be either zero or one, we don't
1049 // have to extend or clear them.
1050 if (CompTy == Type::BoolTy)
1051 return Reg;
1052
Nate Begemanb47321b2004-08-20 09:56:22 +00001053 // Before we do a comparison or SetCC, we have to make sure that we truncate
1054 // the source registers appropriately.
1055 if (Class == cByte) {
1056 unsigned TmpReg = makeAnotherReg(CompTy);
1057 if (CompTy->isSigned())
1058 BuildMI(*MBB, IP, PPC::EXTSB, 1, TmpReg).addReg(Reg);
1059 else
1060 BuildMI(*MBB, IP, PPC::RLWINM, 4, TmpReg).addReg(Reg).addImm(0)
1061 .addImm(24).addImm(31);
1062 Reg = TmpReg;
1063 } else if (Class == cShort) {
1064 unsigned TmpReg = makeAnotherReg(CompTy);
1065 if (CompTy->isSigned())
1066 BuildMI(*MBB, IP, PPC::EXTSH, 1, TmpReg).addReg(Reg);
1067 else
1068 BuildMI(*MBB, IP, PPC::RLWINM, 4, TmpReg).addReg(Reg).addImm(0)
1069 .addImm(16).addImm(31);
1070 Reg = TmpReg;
1071 }
1072 return Reg;
1073}
1074
Misha Brukmanbebde752004-07-16 21:06:24 +00001075/// EmitComparison - emits a comparison of the two operands, returning the
1076/// extended setcc code to use. The result is in CR0.
1077///
Misha Brukmana1dca552004-09-21 18:22:19 +00001078unsigned PPC32ISel::EmitComparison(unsigned OpNum, Value *Op0, Value *Op1,
1079 MachineBasicBlock *MBB,
1080 MachineBasicBlock::iterator IP) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001081 // The arguments are already supposed to be of the same type.
1082 const Type *CompTy = Op0->getType();
1083 unsigned Class = getClassB(CompTy);
Nate Begemana2de1022004-09-22 04:40:25 +00001084 unsigned Op0r = ExtendOrClear(MBB, IP, Op0);
Misha Brukmanb097f212004-07-26 18:13:24 +00001085
Misha Brukman1013ef52004-07-21 20:09:08 +00001086 // Use crand for lt, gt and crandc for le, ge
Misha Brukman5b570812004-08-10 22:47:03 +00001087 unsigned CROpcode = (OpNum == 2 || OpNum == 4) ? PPC::CRAND : PPC::CRANDC;
Misha Brukman1013ef52004-07-21 20:09:08 +00001088 // ? cr1[lt] : cr1[gt]
1089 unsigned CR1field = (OpNum == 2 || OpNum == 3) ? 4 : 5;
1090 // ? cr0[lt] : cr0[gt]
1091 unsigned CR0field = (OpNum == 2 || OpNum == 5) ? 0 : 1;
Misha Brukman5b570812004-08-10 22:47:03 +00001092 unsigned Opcode = CompTy->isSigned() ? PPC::CMPW : PPC::CMPLW;
1093 unsigned OpcodeImm = CompTy->isSigned() ? PPC::CMPWI : PPC::CMPLWI;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001094
1095 // Special case handling of: cmp R, i
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001096 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001097 if (Class == cByte || Class == cShort || Class == cInt) {
Misha Brukman1013ef52004-07-21 20:09:08 +00001098 unsigned Op1v = CI->getRawValue() & 0xFFFF;
Nate Begeman43d64ea2004-08-15 06:42:28 +00001099 unsigned OpClass = (CompTy->isSigned()) ? 0 : 2;
1100
Misha Brukman1013ef52004-07-21 20:09:08 +00001101 // Treat compare like ADDI for the purposes of immediate suitability
Nate Begemanb816f022004-10-07 22:30:03 +00001102 if (canUseAsImmediateForOpcode(CI, OpClass, false)) {
Misha Brukman5b570812004-08-10 22:47:03 +00001103 BuildMI(*MBB, IP, OpcodeImm, 2, PPC::CR0).addReg(Op0r).addSImm(Op1v);
Misha Brukman422791f2004-06-21 17:41:12 +00001104 } else {
1105 unsigned Op1r = getReg(Op1, MBB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00001106 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
Misha Brukman422791f2004-06-21 17:41:12 +00001107 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001108 return OpNum;
1109 } else {
1110 assert(Class == cLong && "Unknown integer class!");
1111 unsigned LowCst = CI->getRawValue();
1112 unsigned HiCst = CI->getRawValue() >> 32;
1113 if (OpNum < 2) { // seteq, setne
Misha Brukman1013ef52004-07-21 20:09:08 +00001114 unsigned LoLow = makeAnotherReg(Type::IntTy);
1115 unsigned LoTmp = makeAnotherReg(Type::IntTy);
1116 unsigned HiLow = makeAnotherReg(Type::IntTy);
1117 unsigned HiTmp = makeAnotherReg(Type::IntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001118 unsigned FinalTmp = makeAnotherReg(Type::IntTy);
Misha Brukman47225442004-07-23 22:35:49 +00001119
Misha Brukman5b570812004-08-10 22:47:03 +00001120 BuildMI(*MBB, IP, PPC::XORI, 2, LoLow).addReg(Op0r+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001121 .addImm(LowCst & 0xFFFF);
Misha Brukman5b570812004-08-10 22:47:03 +00001122 BuildMI(*MBB, IP, PPC::XORIS, 2, LoTmp).addReg(LoLow)
Misha Brukman1013ef52004-07-21 20:09:08 +00001123 .addImm(LowCst >> 16);
Misha Brukman5b570812004-08-10 22:47:03 +00001124 BuildMI(*MBB, IP, PPC::XORI, 2, HiLow).addReg(Op0r)
Misha Brukman1013ef52004-07-21 20:09:08 +00001125 .addImm(HiCst & 0xFFFF);
Misha Brukman5b570812004-08-10 22:47:03 +00001126 BuildMI(*MBB, IP, PPC::XORIS, 2, HiTmp).addReg(HiLow)
Misha Brukman1013ef52004-07-21 20:09:08 +00001127 .addImm(HiCst >> 16);
Misha Brukman5b570812004-08-10 22:47:03 +00001128 BuildMI(*MBB, IP, PPC::ORo, 2, FinalTmp).addReg(LoTmp).addReg(HiTmp);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001129 return OpNum;
1130 } else {
Misha Brukmanbebde752004-07-16 21:06:24 +00001131 unsigned ConstReg = makeAnotherReg(CompTy);
Misha Brukmanbebde752004-07-16 21:06:24 +00001132 copyConstantToRegister(MBB, IP, CI, ConstReg);
Misha Brukman47225442004-07-23 22:35:49 +00001133
Misha Brukman1013ef52004-07-21 20:09:08 +00001134 // cr0 = r3 ccOpcode r5 or (r3 == r5 AND r4 ccOpcode r6)
Misha Brukman5b570812004-08-10 22:47:03 +00001135 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r)
Misha Brukmanbebde752004-07-16 21:06:24 +00001136 .addReg(ConstReg);
Misha Brukman5b570812004-08-10 22:47:03 +00001137 BuildMI(*MBB, IP, Opcode, 2, PPC::CR1).addReg(Op0r+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001138 .addReg(ConstReg+1);
Misha Brukman5b570812004-08-10 22:47:03 +00001139 BuildMI(*MBB, IP, PPC::CRAND, 3).addImm(2).addImm(2).addImm(CR1field);
1140 BuildMI(*MBB, IP, PPC::CROR, 3).addImm(CR0field).addImm(CR0field)
Misha Brukman1013ef52004-07-21 20:09:08 +00001141 .addImm(2);
Misha Brukman422791f2004-06-21 17:41:12 +00001142 return OpNum;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001143 }
1144 }
1145 }
1146
1147 unsigned Op1r = getReg(Op1, MBB, IP);
Misha Brukman1013ef52004-07-21 20:09:08 +00001148
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001149 switch (Class) {
1150 default: assert(0 && "Unknown type class!");
1151 case cByte:
1152 case cShort:
1153 case cInt:
Misha Brukman5b570812004-08-10 22:47:03 +00001154 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001155 break;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001156
Misha Brukman7e898c32004-07-20 00:41:46 +00001157 case cFP32:
1158 case cFP64:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001159 emitUCOM(MBB, IP, Op0r, Op1r);
1160 break;
1161
1162 case cLong:
1163 if (OpNum < 2) { // seteq, setne
1164 unsigned LoTmp = makeAnotherReg(Type::IntTy);
1165 unsigned HiTmp = makeAnotherReg(Type::IntTy);
1166 unsigned FinalTmp = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00001167 BuildMI(*MBB, IP, PPC::XOR, 2, HiTmp).addReg(Op0r).addReg(Op1r);
1168 BuildMI(*MBB, IP, PPC::XOR, 2, LoTmp).addReg(Op0r+1).addReg(Op1r+1);
1169 BuildMI(*MBB, IP, PPC::ORo, 2, FinalTmp).addReg(LoTmp).addReg(HiTmp);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001170 break; // Allow the sete or setne to be generated from flags set by OR
1171 } else {
Misha Brukmanbebde752004-07-16 21:06:24 +00001172 unsigned TmpReg1 = makeAnotherReg(Type::IntTy);
1173 unsigned TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman1013ef52004-07-21 20:09:08 +00001174
1175 // cr0 = r3 ccOpcode r5 or (r3 == r5 AND r4 ccOpcode r6)
Misha Brukman5b570812004-08-10 22:47:03 +00001176 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
1177 BuildMI(*MBB, IP, Opcode, 2, PPC::CR1).addReg(Op0r+1).addReg(Op1r+1);
1178 BuildMI(*MBB, IP, PPC::CRAND, 3).addImm(2).addImm(2).addImm(CR1field);
1179 BuildMI(*MBB, IP, PPC::CROR, 3).addImm(CR0field).addImm(CR0field)
Misha Brukman1013ef52004-07-21 20:09:08 +00001180 .addImm(2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001181 return OpNum;
1182 }
1183 }
1184 return OpNum;
1185}
1186
Misha Brukmand18a31d2004-07-06 22:51:53 +00001187/// visitSetCondInst - emit code to calculate the condition via
1188/// EmitComparison(), and possibly store a 0 or 1 to a register as a result
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001189///
Misha Brukmana1dca552004-09-21 18:22:19 +00001190void PPC32ISel::visitSetCondInst(SetCondInst &I) {
Misha Brukmand18a31d2004-07-06 22:51:53 +00001191 if (canFoldSetCCIntoBranchOrSelect(&I))
Misha Brukmane9c65512004-07-06 15:32:44 +00001192 return;
Misha Brukmanbebde752004-07-16 21:06:24 +00001193
Nate Begemana2de1022004-09-22 04:40:25 +00001194 MachineBasicBlock::iterator MI = BB->end();
1195 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
1196 const Type *Ty = Op0->getType();
1197 unsigned Class = getClassB(Ty);
Nate Begemana96c4af2004-08-21 20:42:14 +00001198 unsigned Opcode = I.getOpcode();
Nate Begemana2de1022004-09-22 04:40:25 +00001199 unsigned OpNum = getSetCCNumber(Opcode);
1200 unsigned DestReg = getReg(I);
1201
1202 // If the comparison type is byte, short, or int, then we can emit a
1203 // branchless version of the SetCC that puts 0 (false) or 1 (true) in the
1204 // destination register.
1205 if (Class <= cInt) {
1206 ConstantInt *CI = dyn_cast<ConstantInt>(Op1);
1207
1208 if (CI && CI->getRawValue() == 0) {
Nate Begemana2de1022004-09-22 04:40:25 +00001209 unsigned Op0Reg = ExtendOrClear(BB, MI, Op0);
1210
1211 // comparisons against constant zero and negative one often have shorter
1212 // and/or faster sequences than the set-and-branch general case, handled
1213 // below.
1214 switch(OpNum) {
1215 case 0: { // eq0
1216 unsigned TempReg = makeAnotherReg(Type::IntTy);
1217 BuildMI(*BB, MI, PPC::CNTLZW, 1, TempReg).addReg(Op0Reg);
1218 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(TempReg).addImm(27)
1219 .addImm(5).addImm(31);
1220 break;
1221 }
1222 case 1: { // ne0
1223 unsigned TempReg = makeAnotherReg(Type::IntTy);
1224 BuildMI(*BB, MI, PPC::ADDIC, 2, TempReg).addReg(Op0Reg).addSImm(-1);
1225 BuildMI(*BB, MI, PPC::SUBFE, 2, DestReg).addReg(TempReg).addReg(Op0Reg);
1226 break;
1227 }
1228 case 2: { // lt0, always false if unsigned
1229 if (Ty->isSigned())
1230 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Op0Reg).addImm(1)
1231 .addImm(31).addImm(31);
1232 else
1233 BuildMI(*BB, MI, PPC::LI, 1, DestReg).addSImm(0);
1234 break;
1235 }
1236 case 3: { // ge0, always true if unsigned
1237 if (Ty->isSigned()) {
1238 unsigned TempReg = makeAnotherReg(Type::IntTy);
1239 BuildMI(*BB, MI, PPC::RLWINM, 4, TempReg).addReg(Op0Reg).addImm(1)
1240 .addImm(31).addImm(31);
1241 BuildMI(*BB, MI, PPC::XORI, 2, DestReg).addReg(TempReg).addImm(1);
1242 } else {
1243 BuildMI(*BB, MI, PPC::LI, 1, DestReg).addSImm(1);
1244 }
1245 break;
1246 }
1247 case 4: { // gt0, equivalent to ne0 if unsigned
1248 unsigned Temp1 = makeAnotherReg(Type::IntTy);
1249 unsigned Temp2 = makeAnotherReg(Type::IntTy);
1250 if (Ty->isSigned()) {
1251 BuildMI(*BB, MI, PPC::NEG, 2, Temp1).addReg(Op0Reg);
1252 BuildMI(*BB, MI, PPC::ANDC, 2, Temp2).addReg(Temp1).addReg(Op0Reg);
1253 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp2).addImm(1)
1254 .addImm(31).addImm(31);
1255 } else {
1256 BuildMI(*BB, MI, PPC::ADDIC, 2, Temp1).addReg(Op0Reg).addSImm(-1);
1257 BuildMI(*BB, MI, PPC::SUBFE, 2, DestReg).addReg(Temp1).addReg(Op0Reg);
1258 }
1259 break;
1260 }
1261 case 5: { // le0, equivalent to eq0 if unsigned
1262 unsigned Temp1 = makeAnotherReg(Type::IntTy);
1263 unsigned Temp2 = makeAnotherReg(Type::IntTy);
1264 if (Ty->isSigned()) {
1265 BuildMI(*BB, MI, PPC::NEG, 2, Temp1).addReg(Op0Reg);
1266 BuildMI(*BB, MI, PPC::ORC, 2, Temp2).addReg(Op0Reg).addReg(Temp1);
1267 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp2).addImm(1)
1268 .addImm(31).addImm(31);
1269 } else {
1270 BuildMI(*BB, MI, PPC::CNTLZW, 1, Temp1).addReg(Op0Reg);
1271 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp1).addImm(27)
1272 .addImm(5).addImm(31);
1273 }
1274 break;
1275 }
1276 } // switch
1277 return;
1278 }
1279 }
Nate Begemanb47321b2004-08-20 09:56:22 +00001280 unsigned PPCOpcode = getPPCOpcodeForSetCCNumber(Opcode);
Nate Begemana96c4af2004-08-21 20:42:14 +00001281
1282 // Create an iterator with which to insert the MBB for copying the false value
1283 // and the MBB to hold the PHI instruction for this SetCC.
Misha Brukman425ff242004-07-01 21:34:10 +00001284 MachineBasicBlock *thisMBB = BB;
1285 const BasicBlock *LLVM_BB = BB->getBasicBlock();
Misha Brukman7e898c32004-07-20 00:41:46 +00001286 ilist<MachineBasicBlock>::iterator It = BB;
1287 ++It;
1288
Misha Brukman425ff242004-07-01 21:34:10 +00001289 // thisMBB:
1290 // ...
1291 // cmpTY cr0, r1, r2
Misha Brukman425ff242004-07-01 21:34:10 +00001292 // %TrueValue = li 1
Nate Begemana96c4af2004-08-21 20:42:14 +00001293 // bCC sinkMBB
Nate Begemana2de1022004-09-22 04:40:25 +00001294 EmitComparison(Opcode, Op0, Op1, BB, BB->end());
Misha Brukmane2eceb52004-07-23 16:08:20 +00001295 unsigned TrueValue = makeAnotherReg(I.getType());
Misha Brukman5b570812004-08-10 22:47:03 +00001296 BuildMI(BB, PPC::LI, 1, TrueValue).addSImm(1);
Nate Begemana96c4af2004-08-21 20:42:14 +00001297 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
1298 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
1299 BuildMI(BB, PPCOpcode, 2).addReg(PPC::CR0).addMBB(sinkMBB);
1300 F->getBasicBlockList().insert(It, copy0MBB);
1301 F->getBasicBlockList().insert(It, sinkMBB);
Misha Brukman425ff242004-07-01 21:34:10 +00001302 // Update machine-CFG edges
Nate Begemana96c4af2004-08-21 20:42:14 +00001303 BB->addSuccessor(copy0MBB);
Misha Brukman425ff242004-07-01 21:34:10 +00001304 BB->addSuccessor(sinkMBB);
1305
Misha Brukman1013ef52004-07-21 20:09:08 +00001306 // copy0MBB:
1307 // %FalseValue = li 0
1308 // fallthrough
1309 BB = copy0MBB;
1310 unsigned FalseValue = makeAnotherReg(I.getType());
Misha Brukman5b570812004-08-10 22:47:03 +00001311 BuildMI(BB, PPC::LI, 1, FalseValue).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00001312 // Update machine-CFG edges
1313 BB->addSuccessor(sinkMBB);
1314
Misha Brukman425ff242004-07-01 21:34:10 +00001315 // sinkMBB:
Nate Begemana96c4af2004-08-21 20:42:14 +00001316 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
Misha Brukman425ff242004-07-01 21:34:10 +00001317 // ...
1318 BB = sinkMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00001319 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(FalseValue)
Nate Begemana96c4af2004-08-21 20:42:14 +00001320 .addMBB(copy0MBB).addReg(TrueValue).addMBB(thisMBB);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001321}
1322
Misha Brukmana1dca552004-09-21 18:22:19 +00001323void PPC32ISel::visitSelectInst(SelectInst &SI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001324 unsigned DestReg = getReg(SI);
1325 MachineBasicBlock::iterator MII = BB->end();
Misha Brukman2fec9902004-06-21 20:22:03 +00001326 emitSelectOperation(BB, MII, SI.getCondition(), SI.getTrueValue(),
1327 SI.getFalseValue(), DestReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001328}
1329
1330/// emitSelect - Common code shared between visitSelectInst and the constant
1331/// expression support.
Misha Brukmana1dca552004-09-21 18:22:19 +00001332void PPC32ISel::emitSelectOperation(MachineBasicBlock *MBB,
1333 MachineBasicBlock::iterator IP,
1334 Value *Cond, Value *TrueVal,
1335 Value *FalseVal, unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001336 unsigned SelectClass = getClassB(TrueVal->getType());
Misha Brukman7e898c32004-07-20 00:41:46 +00001337 unsigned Opcode;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001338
Misha Brukmanbebde752004-07-16 21:06:24 +00001339 // See if we can fold the setcc into the select instruction, or if we have
1340 // to get the register of the Cond value
Misha Brukmanbebde752004-07-16 21:06:24 +00001341 if (SetCondInst *SCI = canFoldSetCCIntoBranchOrSelect(Cond)) {
1342 // We successfully folded the setcc into the select instruction.
Misha Brukmanbebde752004-07-16 21:06:24 +00001343 unsigned OpNum = getSetCCNumber(SCI->getOpcode());
Nate Begeman087d5d92004-10-06 09:53:04 +00001344 if (OpNum >= 2 && OpNum <= 5) {
1345 unsigned SetCondClass = getClassB(SCI->getOperand(0)->getType());
1346 if ((SetCondClass == cFP32 || SetCondClass == cFP64) &&
1347 (SelectClass == cFP32 || SelectClass == cFP64)) {
1348 unsigned CondReg = getReg(SCI->getOperand(0), MBB, IP);
1349 unsigned TrueReg = getReg(TrueVal, MBB, IP);
1350 unsigned FalseReg = getReg(FalseVal, MBB, IP);
1351 // if the comparison of the floating point value used to for the select
1352 // is against 0, then we can emit an fsel without subtraction.
1353 ConstantFP *Op1C = dyn_cast<ConstantFP>(SCI->getOperand(1));
1354 if (Op1C && (Op1C->isExactlyValue(-0.0) || Op1C->isExactlyValue(0.0))) {
1355 switch(OpNum) {
1356 case 2: // LT
1357 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(CondReg)
1358 .addReg(FalseReg).addReg(TrueReg);
1359 break;
1360 case 3: // GE == !LT
1361 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(CondReg)
1362 .addReg(TrueReg).addReg(FalseReg);
1363 break;
1364 case 4: { // GT
1365 unsigned NegatedReg = makeAnotherReg(SCI->getOperand(0)->getType());
1366 BuildMI(*MBB, IP, PPC::FNEG, 1, NegatedReg).addReg(CondReg);
1367 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(NegatedReg)
1368 .addReg(FalseReg).addReg(TrueReg);
1369 }
1370 break;
1371 case 5: { // LE == !GT
1372 unsigned NegatedReg = makeAnotherReg(SCI->getOperand(0)->getType());
1373 BuildMI(*MBB, IP, PPC::FNEG, 1, NegatedReg).addReg(CondReg);
1374 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(NegatedReg)
1375 .addReg(TrueReg).addReg(FalseReg);
1376 }
1377 break;
1378 default:
1379 assert(0 && "Invalid SetCC opcode to fsel");
1380 abort();
1381 break;
1382 }
1383 } else {
1384 unsigned OtherCondReg = getReg(SCI->getOperand(1), MBB, IP);
1385 unsigned SelectReg = makeAnotherReg(SCI->getOperand(0)->getType());
1386 switch(OpNum) {
1387 case 2: // LT
1388 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(CondReg)
1389 .addReg(OtherCondReg);
1390 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1391 .addReg(FalseReg).addReg(TrueReg);
1392 break;
1393 case 3: // GE == !LT
1394 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(CondReg)
1395 .addReg(OtherCondReg);
1396 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1397 .addReg(TrueReg).addReg(FalseReg);
1398 break;
1399 case 4: // GT
1400 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(OtherCondReg)
1401 .addReg(CondReg);
1402 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1403 .addReg(FalseReg).addReg(TrueReg);
1404 break;
1405 case 5: // LE == !GT
1406 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(OtherCondReg)
1407 .addReg(CondReg);
1408 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1409 .addReg(TrueReg).addReg(FalseReg);
1410 break;
1411 default:
1412 assert(0 && "Invalid SetCC opcode to fsel");
1413 abort();
1414 break;
1415 }
1416 }
Nate Begeman087d5d92004-10-06 09:53:04 +00001417 return;
1418 }
1419 }
Misha Brukman47225442004-07-23 22:35:49 +00001420 OpNum = EmitComparison(OpNum, SCI->getOperand(0),SCI->getOperand(1),MBB,IP);
Misha Brukmanbebde752004-07-16 21:06:24 +00001421 Opcode = getPPCOpcodeForSetCCNumber(SCI->getOpcode());
1422 } else {
1423 unsigned CondReg = getReg(Cond, MBB, IP);
Nate Begemaned428532004-09-04 05:00:00 +00001424 BuildMI(*MBB, IP, PPC::CMPWI, 2, PPC::CR0).addReg(CondReg).addSImm(0);
Misha Brukmanbebde752004-07-16 21:06:24 +00001425 Opcode = getPPCOpcodeForSetCCNumber(Instruction::SetNE);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001426 }
Misha Brukmanbebde752004-07-16 21:06:24 +00001427
1428 MachineBasicBlock *thisMBB = BB;
1429 const BasicBlock *LLVM_BB = BB->getBasicBlock();
Misha Brukman7e898c32004-07-20 00:41:46 +00001430 ilist<MachineBasicBlock>::iterator It = BB;
1431 ++It;
Misha Brukmanbebde752004-07-16 21:06:24 +00001432
Nate Begemana96c4af2004-08-21 20:42:14 +00001433 // thisMBB:
1434 // ...
1435 // cmpTY cr0, r1, r2
Nate Begeman1f49e862004-09-29 05:00:31 +00001436 // bCC copy1MBB
1437 // fallthrough --> copy0MBB
Misha Brukmanbebde752004-07-16 21:06:24 +00001438 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
Nate Begeman1f49e862004-09-29 05:00:31 +00001439 MachineBasicBlock *copy1MBB = new MachineBasicBlock(LLVM_BB);
Misha Brukman1013ef52004-07-21 20:09:08 +00001440 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
Nate Begeman1f49e862004-09-29 05:00:31 +00001441 BuildMI(BB, Opcode, 2).addReg(PPC::CR0).addMBB(copy1MBB);
Nate Begemana96c4af2004-08-21 20:42:14 +00001442 F->getBasicBlockList().insert(It, copy0MBB);
Nate Begeman1f49e862004-09-29 05:00:31 +00001443 F->getBasicBlockList().insert(It, copy1MBB);
Misha Brukman1013ef52004-07-21 20:09:08 +00001444 F->getBasicBlockList().insert(It, sinkMBB);
Misha Brukmanbebde752004-07-16 21:06:24 +00001445 // Update machine-CFG edges
Misha Brukmanbebde752004-07-16 21:06:24 +00001446 BB->addSuccessor(copy0MBB);
Nate Begeman1f49e862004-09-29 05:00:31 +00001447 BB->addSuccessor(copy1MBB);
Misha Brukmanbebde752004-07-16 21:06:24 +00001448
Misha Brukman1013ef52004-07-21 20:09:08 +00001449 // copy0MBB:
1450 // %FalseValue = ...
Nate Begeman1f49e862004-09-29 05:00:31 +00001451 // b sinkMBB
Misha Brukman1013ef52004-07-21 20:09:08 +00001452 BB = copy0MBB;
1453 unsigned FalseValue = getReg(FalseVal, BB, BB->begin());
Nate Begeman1f49e862004-09-29 05:00:31 +00001454 BuildMI(BB, PPC::B, 1).addMBB(sinkMBB);
1455 // Update machine-CFG edges
1456 BB->addSuccessor(sinkMBB);
1457
1458 // copy1MBB:
1459 // %TrueValue = ...
1460 // fallthrough
1461 BB = copy1MBB;
1462 unsigned TrueValue = getReg(TrueVal, BB, BB->begin());
Misha Brukman1013ef52004-07-21 20:09:08 +00001463 // Update machine-CFG edges
1464 BB->addSuccessor(sinkMBB);
1465
Misha Brukmanbebde752004-07-16 21:06:24 +00001466 // sinkMBB:
Nate Begemana96c4af2004-08-21 20:42:14 +00001467 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
Misha Brukmanbebde752004-07-16 21:06:24 +00001468 // ...
1469 BB = sinkMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00001470 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(FalseValue)
Nate Begeman1f49e862004-09-29 05:00:31 +00001471 .addMBB(copy0MBB).addReg(TrueValue).addMBB(copy1MBB);
Nate Begemana96c4af2004-08-21 20:42:14 +00001472
Misha Brukmana31f1f72004-07-21 20:30:18 +00001473 // For a register pair representing a long value, define the second reg
Nate Begemana96c4af2004-08-21 20:42:14 +00001474 // FIXME: Can this really be correct for selecting longs?
Nate Begeman8d963e62004-08-11 03:30:55 +00001475 if (getClassB(TrueVal->getType()) == cLong)
Misha Brukman5b570812004-08-10 22:47:03 +00001476 BuildMI(BB, PPC::LI, 1, DestReg+1).addImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001477 return;
1478}
1479
1480
1481
1482/// promote32 - Emit instructions to turn a narrow operand into a 32-bit-wide
1483/// operand, in the specified target register.
1484///
Misha Brukmana1dca552004-09-21 18:22:19 +00001485void PPC32ISel::promote32(unsigned targetReg, const ValueRecord &VR) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001486 bool isUnsigned = VR.Ty->isUnsigned() || VR.Ty == Type::BoolTy;
1487
1488 Value *Val = VR.Val;
1489 const Type *Ty = VR.Ty;
1490 if (Val) {
1491 if (Constant *C = dyn_cast<Constant>(Val)) {
1492 Val = ConstantExpr::getCast(C, Type::IntTy);
Chris Lattner74a806c2004-08-11 07:34:50 +00001493 if (isa<ConstantExpr>(Val)) // Could not fold
1494 Val = C;
1495 else
1496 Ty = Type::IntTy; // Folded!
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001497 }
1498
Misha Brukman2fec9902004-06-21 20:22:03 +00001499 // If this is a simple constant, just emit a load directly to avoid the copy
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001500 if (ConstantInt *CI = dyn_cast<ConstantInt>(Val)) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00001501 copyConstantToRegister(BB, BB->end(), CI, targetReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001502 return;
1503 }
1504 }
1505
1506 // Make sure we have the register number for this value...
1507 unsigned Reg = Val ? getReg(Val) : VR.Reg;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001508 switch (getClassB(Ty)) {
1509 case cByte:
1510 // Extend value into target register (8->32)
Nate Begeman1b99fd32004-09-29 03:45:33 +00001511 if (Ty == Type::BoolTy)
1512 BuildMI(BB, PPC::OR, 2, targetReg).addReg(Reg).addReg(Reg);
1513 else if (isUnsigned)
Misha Brukman5b570812004-08-10 22:47:03 +00001514 BuildMI(BB, PPC::RLWINM, 4, targetReg).addReg(Reg).addZImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00001515 .addZImm(24).addZImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001516 else
Misha Brukman5b570812004-08-10 22:47:03 +00001517 BuildMI(BB, PPC::EXTSB, 1, targetReg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001518 break;
1519 case cShort:
1520 // Extend value into target register (16->32)
1521 if (isUnsigned)
Misha Brukman5b570812004-08-10 22:47:03 +00001522 BuildMI(BB, PPC::RLWINM, 4, targetReg).addReg(Reg).addZImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00001523 .addZImm(16).addZImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001524 else
Misha Brukman5b570812004-08-10 22:47:03 +00001525 BuildMI(BB, PPC::EXTSH, 1, targetReg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001526 break;
1527 case cInt:
1528 // Move value into target register (32->32)
Misha Brukman5b570812004-08-10 22:47:03 +00001529 BuildMI(BB, PPC::OR, 2, targetReg).addReg(Reg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001530 break;
1531 default:
1532 assert(0 && "Unpromotable operand class in promote32");
1533 }
1534}
1535
Misha Brukman2fec9902004-06-21 20:22:03 +00001536/// visitReturnInst - implemented with BLR
1537///
Misha Brukmana1dca552004-09-21 18:22:19 +00001538void PPC32ISel::visitReturnInst(ReturnInst &I) {
Misha Brukmand47bbf72004-06-25 19:04:27 +00001539 // Only do the processing if this is a non-void return
1540 if (I.getNumOperands() > 0) {
1541 Value *RetVal = I.getOperand(0);
1542 switch (getClassB(RetVal->getType())) {
1543 case cByte: // integral return values: extend or move into r3 and return
1544 case cShort:
1545 case cInt:
Misha Brukman5b570812004-08-10 22:47:03 +00001546 promote32(PPC::R3, ValueRecord(RetVal));
Misha Brukmand47bbf72004-06-25 19:04:27 +00001547 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001548 case cFP32:
1549 case cFP64: { // Floats & Doubles: Return in f1
Misha Brukmand47bbf72004-06-25 19:04:27 +00001550 unsigned RetReg = getReg(RetVal);
Misha Brukman5b570812004-08-10 22:47:03 +00001551 BuildMI(BB, PPC::FMR, 1, PPC::F1).addReg(RetReg);
Misha Brukmand47bbf72004-06-25 19:04:27 +00001552 break;
1553 }
1554 case cLong: {
1555 unsigned RetReg = getReg(RetVal);
Misha Brukman5b570812004-08-10 22:47:03 +00001556 BuildMI(BB, PPC::OR, 2, PPC::R3).addReg(RetReg).addReg(RetReg);
1557 BuildMI(BB, PPC::OR, 2, PPC::R4).addReg(RetReg+1).addReg(RetReg+1);
Misha Brukmand47bbf72004-06-25 19:04:27 +00001558 break;
1559 }
1560 default:
1561 visitInstruction(I);
1562 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001563 }
Misha Brukman5b570812004-08-10 22:47:03 +00001564 BuildMI(BB, PPC::BLR, 1).addImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001565}
1566
1567// getBlockAfter - Return the basic block which occurs lexically after the
1568// specified one.
1569static inline BasicBlock *getBlockAfter(BasicBlock *BB) {
1570 Function::iterator I = BB; ++I; // Get iterator to next block
1571 return I != BB->getParent()->end() ? &*I : 0;
1572}
1573
1574/// visitBranchInst - Handle conditional and unconditional branches here. Note
1575/// that since code layout is frozen at this point, that if we are trying to
1576/// jump to a block that is the immediate successor of the current block, we can
1577/// just make a fall-through (but we don't currently).
1578///
Misha Brukmana1dca552004-09-21 18:22:19 +00001579void PPC32ISel::visitBranchInst(BranchInst &BI) {
Misha Brukman2fec9902004-06-21 20:22:03 +00001580 // Update machine-CFG edges
Misha Brukmane2eceb52004-07-23 16:08:20 +00001581 BB->addSuccessor(MBBMap[BI.getSuccessor(0)]);
Misha Brukman2fec9902004-06-21 20:22:03 +00001582 if (BI.isConditional())
Misha Brukmane2eceb52004-07-23 16:08:20 +00001583 BB->addSuccessor(MBBMap[BI.getSuccessor(1)]);
Misha Brukman2fec9902004-06-21 20:22:03 +00001584
1585 BasicBlock *NextBB = getBlockAfter(BI.getParent()); // BB after current one
Misha Brukmane9c65512004-07-06 15:32:44 +00001586
Misha Brukman2fec9902004-06-21 20:22:03 +00001587 if (!BI.isConditional()) { // Unconditional branch?
Misha Brukmane9c65512004-07-06 15:32:44 +00001588 if (BI.getSuccessor(0) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001589 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001590 return;
Misha Brukman2fec9902004-06-21 20:22:03 +00001591 }
1592
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001593 // See if we can fold the setcc into the branch itself...
1594 SetCondInst *SCI = canFoldSetCCIntoBranchOrSelect(BI.getCondition());
1595 if (SCI == 0) {
1596 // Nope, cannot fold setcc into this branch. Emit a branch on a condition
1597 // computed some other way...
1598 unsigned condReg = getReg(BI.getCondition());
Misha Brukman5b570812004-08-10 22:47:03 +00001599 BuildMI(BB, PPC::CMPLI, 3, PPC::CR0).addImm(0).addReg(condReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00001600 .addImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001601 if (BI.getSuccessor(1) == NextBB) {
1602 if (BI.getSuccessor(0) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001603 BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(PPC::BNE)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001604 .addMBB(MBBMap[BI.getSuccessor(0)])
1605 .addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001606 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00001607 BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(PPC::BEQ)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001608 .addMBB(MBBMap[BI.getSuccessor(1)])
1609 .addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001610 if (BI.getSuccessor(0) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001611 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001612 }
1613 return;
1614 }
1615
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001616 unsigned OpNum = getSetCCNumber(SCI->getOpcode());
Misha Brukmane9c65512004-07-06 15:32:44 +00001617 unsigned Opcode = getPPCOpcodeForSetCCNumber(SCI->getOpcode());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001618 MachineBasicBlock::iterator MII = BB->end();
1619 OpNum = EmitComparison(OpNum, SCI->getOperand(0), SCI->getOperand(1), BB,MII);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001620
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001621 if (BI.getSuccessor(0) != NextBB) {
Misha Brukman5b570812004-08-10 22:47:03 +00001622 BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(Opcode)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001623 .addMBB(MBBMap[BI.getSuccessor(0)])
1624 .addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001625 if (BI.getSuccessor(1) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001626 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001627 } else {
1628 // Change to the inverse condition...
1629 if (BI.getSuccessor(1) != NextBB) {
Misha Brukmanf2ccb772004-08-17 04:55:41 +00001630 Opcode = PPC32InstrInfo::invertPPCBranchOpcode(Opcode);
Misha Brukman5b570812004-08-10 22:47:03 +00001631 BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(Opcode)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001632 .addMBB(MBBMap[BI.getSuccessor(1)])
1633 .addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001634 }
1635 }
1636}
1637
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001638/// doCall - This emits an abstract call instruction, setting up the arguments
1639/// and the return value as appropriate. For the actual function call itself,
1640/// it inserts the specified CallMI instruction into the stream.
1641///
1642/// FIXME: See Documentation at the following URL for "correct" behavior
1643/// <http://developer.apple.com/documentation/DeveloperTools/Conceptual/MachORuntime/2rt_powerpc_abi/chapter_9_section_5.html>
Misha Brukmana1dca552004-09-21 18:22:19 +00001644void PPC32ISel::doCall(const ValueRecord &Ret, MachineInstr *CallMI,
1645 const std::vector<ValueRecord> &Args, bool isVarArg) {
Chris Lattner3ea93462004-08-06 06:58:50 +00001646 // Count how many bytes are to be pushed on the stack, including the linkage
1647 // area, and parameter passing area.
1648 unsigned NumBytes = 24;
1649 unsigned ArgOffset = 24;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001650
1651 if (!Args.empty()) {
1652 for (unsigned i = 0, e = Args.size(); i != e; ++i)
1653 switch (getClassB(Args[i].Ty)) {
1654 case cByte: case cShort: case cInt:
1655 NumBytes += 4; break;
1656 case cLong:
1657 NumBytes += 8; break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001658 case cFP32:
1659 NumBytes += 4; break;
1660 case cFP64:
1661 NumBytes += 8; break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001662 break;
1663 default: assert(0 && "Unknown class!");
1664 }
1665
Nate Begeman865075e2004-08-16 01:50:22 +00001666 // Just to be safe, we'll always reserve the full 24 bytes of linkage area
1667 // plus 32 bytes of argument space in case any called code gets funky on us.
1668 if (NumBytes < 56) NumBytes = 56;
Chris Lattner3ea93462004-08-06 06:58:50 +00001669
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001670 // Adjust the stack pointer for the new arguments...
Chris Lattner3ea93462004-08-06 06:58:50 +00001671 // These functions are automatically eliminated by the prolog/epilog pass
Misha Brukman5b570812004-08-10 22:47:03 +00001672 BuildMI(BB, PPC::ADJCALLSTACKDOWN, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001673
1674 // Arguments go on the stack in reverse order, as specified by the ABI.
Misha Brukman7e898c32004-07-20 00:41:46 +00001675 // Offset to the paramater area on the stack is 24.
Misha Brukmand18a31d2004-07-06 22:51:53 +00001676 int GPR_remaining = 8, FPR_remaining = 13;
Misha Brukmanfc879c32004-07-08 18:02:38 +00001677 unsigned GPR_idx = 0, FPR_idx = 0;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001678 static const unsigned GPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00001679 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
1680 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001681 };
Misha Brukmand18a31d2004-07-06 22:51:53 +00001682 static const unsigned FPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00001683 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6,
1684 PPC::F7, PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12,
1685 PPC::F13
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001686 };
Misha Brukman422791f2004-06-21 17:41:12 +00001687
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001688 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
1689 unsigned ArgReg;
1690 switch (getClassB(Args[i].Ty)) {
1691 case cByte:
1692 case cShort:
1693 // Promote arg to 32 bits wide into a temporary register...
1694 ArgReg = makeAnotherReg(Type::UIntTy);
1695 promote32(ArgReg, Args[i]);
Misha Brukman422791f2004-06-21 17:41:12 +00001696
1697 // Reg or stack?
1698 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001699 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001700 .addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001701 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001702 }
1703 if (GPR_remaining <= 0 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001704 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1705 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001706 }
1707 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001708 case cInt:
1709 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
1710
Misha Brukman422791f2004-06-21 17:41:12 +00001711 // Reg or stack?
1712 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001713 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001714 .addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001715 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001716 }
1717 if (GPR_remaining <= 0 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001718 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1719 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001720 }
1721 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001722 case cLong:
Misha Brukman422791f2004-06-21 17:41:12 +00001723 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001724
Misha Brukmanec6319a2004-07-20 15:51:37 +00001725 // Reg or stack? Note that PPC calling conventions state that long args
1726 // are passed rN = hi, rN+1 = lo, opposite of LLVM.
Misha Brukman422791f2004-06-21 17:41:12 +00001727 if (GPR_remaining > 1) {
Misha Brukman5b570812004-08-10 22:47:03 +00001728 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanec6319a2004-07-20 15:51:37 +00001729 .addReg(ArgReg);
Misha Brukman5b570812004-08-10 22:47:03 +00001730 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx+1]).addReg(ArgReg+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001731 .addReg(ArgReg+1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001732 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1733 CallMI->addRegOperand(GPR[GPR_idx+1], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001734 }
1735 if (GPR_remaining <= 1 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001736 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1737 .addReg(PPC::R1);
1738 BuildMI(BB, PPC::STW, 3).addReg(ArgReg+1).addSImm(ArgOffset+4)
1739 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001740 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001741
1742 ArgOffset += 4; // 8 byte entry, not 4.
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001743 GPR_remaining -= 1; // uses up 2 GPRs
1744 GPR_idx += 1;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001745 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001746 case cFP32:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001747 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
Misha Brukman7e898c32004-07-20 00:41:46 +00001748 // Reg or stack?
1749 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001750 BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001751 CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use);
1752 FPR_remaining--;
1753 FPR_idx++;
1754
1755 // If this is a vararg function, and there are GPRs left, also
1756 // pass the float in an int. Otherwise, put it on the stack.
1757 if (isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001758 BuildMI(BB, PPC::STFS, 3).addReg(ArgReg).addSImm(ArgOffset)
1759 .addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001760 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001761 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx])
Nate Begeman293d88c2004-08-13 04:45:14 +00001762 .addSImm(ArgOffset).addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001763 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1764 }
Misha Brukman1916bf92004-06-24 21:56:15 +00001765 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001766 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00001767 BuildMI(BB, PPC::STFS, 3).addReg(ArgReg).addSImm(ArgOffset)
1768 .addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001769 }
1770 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001771 case cFP64:
1772 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
1773 // Reg or stack?
1774 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001775 BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001776 CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use);
1777 FPR_remaining--;
1778 FPR_idx++;
1779 // For vararg functions, must pass doubles via int regs as well
1780 if (isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001781 BuildMI(BB, PPC::STFD, 3).addReg(ArgReg).addSImm(ArgOffset)
1782 .addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001783
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001784 // Doubles can be split across reg + stack for varargs
1785 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001786 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx]).addSImm(ArgOffset)
1787 .addReg(PPC::R1);
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001788 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1789 }
1790 if (GPR_remaining > 1) {
Misha Brukman5b570812004-08-10 22:47:03 +00001791 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx+1])
1792 .addSImm(ArgOffset+4).addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001793 CallMI->addRegOperand(GPR[GPR_idx+1], MachineOperand::Use);
1794 }
1795 }
1796 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00001797 BuildMI(BB, PPC::STFD, 3).addReg(ArgReg).addSImm(ArgOffset)
1798 .addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001799 }
1800 // Doubles use 8 bytes, and 2 GPRs worth of param space
1801 ArgOffset += 4;
1802 GPR_remaining--;
1803 GPR_idx++;
1804 break;
1805
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001806 default: assert(0 && "Unknown class!");
1807 }
1808 ArgOffset += 4;
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001809 GPR_remaining--;
1810 GPR_idx++;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001811 }
1812 } else {
Nate Begeman865075e2004-08-16 01:50:22 +00001813 BuildMI(BB, PPC::ADJCALLSTACKDOWN, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001814 }
Nate Begeman43d64ea2004-08-15 06:42:28 +00001815
Misha Brukman5b570812004-08-10 22:47:03 +00001816 BuildMI(BB, PPC::IMPLICIT_DEF, 0, PPC::LR);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001817 BB->push_back(CallMI);
Chris Lattner3ea93462004-08-06 06:58:50 +00001818
1819 // These functions are automatically eliminated by the prolog/epilog pass
Misha Brukman5b570812004-08-10 22:47:03 +00001820 BuildMI(BB, PPC::ADJCALLSTACKUP, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001821
1822 // If there is a return value, scavenge the result from the location the call
1823 // leaves it in...
1824 //
1825 if (Ret.Ty != Type::VoidTy) {
1826 unsigned DestClass = getClassB(Ret.Ty);
1827 switch (DestClass) {
1828 case cByte:
1829 case cShort:
1830 case cInt:
1831 // Integral results are in r3
Misha Brukman5b570812004-08-10 22:47:03 +00001832 BuildMI(BB, PPC::OR, 2, Ret.Reg).addReg(PPC::R3).addReg(PPC::R3);
Misha Brukmane327e492004-06-24 23:53:24 +00001833 break;
Chris Lattner3ea93462004-08-06 06:58:50 +00001834 case cFP32: // Floating-point return values live in f1
Misha Brukman7e898c32004-07-20 00:41:46 +00001835 case cFP64:
Misha Brukman5b570812004-08-10 22:47:03 +00001836 BuildMI(BB, PPC::FMR, 1, Ret.Reg).addReg(PPC::F1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001837 break;
Chris Lattner3ea93462004-08-06 06:58:50 +00001838 case cLong: // Long values are in r3:r4
Misha Brukman5b570812004-08-10 22:47:03 +00001839 BuildMI(BB, PPC::OR, 2, Ret.Reg).addReg(PPC::R3).addReg(PPC::R3);
1840 BuildMI(BB, PPC::OR, 2, Ret.Reg+1).addReg(PPC::R4).addReg(PPC::R4);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001841 break;
1842 default: assert(0 && "Unknown class!");
1843 }
1844 }
1845}
1846
1847
1848/// visitCallInst - Push args on stack and do a procedure call instruction.
Misha Brukmana1dca552004-09-21 18:22:19 +00001849void PPC32ISel::visitCallInst(CallInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001850 MachineInstr *TheCall;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001851 Function *F = CI.getCalledFunction();
1852 if (F) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001853 // Is it an intrinsic function call?
1854 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID()) {
1855 visitIntrinsicCall(ID, CI); // Special intrinsics are not handled here
1856 return;
1857 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001858 // Emit a CALL instruction with PC-relative displacement.
Misha Brukman5b570812004-08-10 22:47:03 +00001859 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(F, true);
Misha Brukmane2eceb52004-07-23 16:08:20 +00001860 // Add it to the set of functions called to be used by the Printer
1861 TM.CalledFunctions.insert(F);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001862 } else { // Emit an indirect call through the CTR
1863 unsigned Reg = getReg(CI.getCalledValue());
Nate Begeman43d64ea2004-08-15 06:42:28 +00001864 BuildMI(BB, PPC::OR, 2, PPC::R12).addReg(Reg).addReg(Reg);
1865 BuildMI(BB, PPC::MTCTR, 1).addReg(PPC::R12);
1866 TheCall = BuildMI(PPC::CALLindirect, 2).addZImm(20).addZImm(0)
1867 .addReg(PPC::R12);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001868 }
1869
1870 std::vector<ValueRecord> Args;
1871 for (unsigned i = 1, e = CI.getNumOperands(); i != e; ++i)
1872 Args.push_back(ValueRecord(CI.getOperand(i)));
1873
1874 unsigned DestReg = CI.getType() != Type::VoidTy ? getReg(CI) : 0;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001875 bool isVarArg = F ? F->getFunctionType()->isVarArg() : true;
1876 doCall(ValueRecord(DestReg, CI.getType()), TheCall, Args, isVarArg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001877}
1878
1879
1880/// dyncastIsNan - Return the operand of an isnan operation if this is an isnan.
1881///
1882static Value *dyncastIsNan(Value *V) {
1883 if (CallInst *CI = dyn_cast<CallInst>(V))
1884 if (Function *F = CI->getCalledFunction())
Misha Brukmana2916ce2004-06-21 17:58:36 +00001885 if (F->getIntrinsicID() == Intrinsic::isunordered)
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001886 return CI->getOperand(1);
1887 return 0;
1888}
1889
1890/// isOnlyUsedByUnorderedComparisons - Return true if this value is only used by
1891/// or's whos operands are all calls to the isnan predicate.
1892static bool isOnlyUsedByUnorderedComparisons(Value *V) {
1893 assert(dyncastIsNan(V) && "The value isn't an isnan call!");
1894
1895 // Check all uses, which will be or's of isnans if this predicate is true.
1896 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;++UI){
1897 Instruction *I = cast<Instruction>(*UI);
1898 if (I->getOpcode() != Instruction::Or) return false;
1899 if (I->getOperand(0) != V && !dyncastIsNan(I->getOperand(0))) return false;
1900 if (I->getOperand(1) != V && !dyncastIsNan(I->getOperand(1))) return false;
1901 }
1902
1903 return true;
1904}
1905
1906/// LowerUnknownIntrinsicFunctionCalls - This performs a prepass over the
1907/// function, lowering any calls to unknown intrinsic functions into the
1908/// equivalent LLVM code.
1909///
Misha Brukmana1dca552004-09-21 18:22:19 +00001910void PPC32ISel::LowerUnknownIntrinsicFunctionCalls(Function &F) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001911 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
1912 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
1913 if (CallInst *CI = dyn_cast<CallInst>(I++))
1914 if (Function *F = CI->getCalledFunction())
1915 switch (F->getIntrinsicID()) {
1916 case Intrinsic::not_intrinsic:
1917 case Intrinsic::vastart:
1918 case Intrinsic::vacopy:
1919 case Intrinsic::vaend:
1920 case Intrinsic::returnaddress:
1921 case Intrinsic::frameaddress:
Misha Brukmanb097f212004-07-26 18:13:24 +00001922 // FIXME: should lower these ourselves
Misha Brukmana2916ce2004-06-21 17:58:36 +00001923 // case Intrinsic::isunordered:
Misha Brukmanb097f212004-07-26 18:13:24 +00001924 // case Intrinsic::memcpy: -> doCall(). system memcpy almost
1925 // guaranteed to be faster than anything we generate ourselves
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001926 // We directly implement these intrinsics
1927 break;
1928 case Intrinsic::readio: {
1929 // On PPC, memory operations are in-order. Lower this intrinsic
1930 // into a volatile load.
1931 Instruction *Before = CI->getPrev();
1932 LoadInst * LI = new LoadInst(CI->getOperand(1), "", true, CI);
1933 CI->replaceAllUsesWith(LI);
1934 BB->getInstList().erase(CI);
1935 break;
1936 }
1937 case Intrinsic::writeio: {
1938 // On PPC, memory operations are in-order. Lower this intrinsic
1939 // into a volatile store.
1940 Instruction *Before = CI->getPrev();
Misha Brukman8d442c22004-07-14 15:29:51 +00001941 StoreInst *SI = new StoreInst(CI->getOperand(1),
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001942 CI->getOperand(2), true, CI);
Misha Brukman8d442c22004-07-14 15:29:51 +00001943 CI->replaceAllUsesWith(SI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001944 BB->getInstList().erase(CI);
1945 break;
1946 }
1947 default:
1948 // All other intrinsic calls we must lower.
1949 Instruction *Before = CI->getPrev();
1950 TM.getIntrinsicLowering().LowerIntrinsicCall(CI);
1951 if (Before) { // Move iterator to instruction after call
1952 I = Before; ++I;
1953 } else {
1954 I = BB->begin();
1955 }
1956 }
1957}
1958
Misha Brukmana1dca552004-09-21 18:22:19 +00001959void PPC32ISel::visitIntrinsicCall(Intrinsic::ID ID, CallInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001960 unsigned TmpReg1, TmpReg2, TmpReg3;
1961 switch (ID) {
1962 case Intrinsic::vastart:
1963 // Get the address of the first vararg value...
1964 TmpReg1 = getReg(CI);
Misha Brukman5b570812004-08-10 22:47:03 +00001965 addFrameReference(BuildMI(BB, PPC::ADDI, 2, TmpReg1), VarArgsFrameIndex,
Misha Brukmanec6319a2004-07-20 15:51:37 +00001966 0, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001967 return;
1968
1969 case Intrinsic::vacopy:
1970 TmpReg1 = getReg(CI);
1971 TmpReg2 = getReg(CI.getOperand(1));
Misha Brukman5b570812004-08-10 22:47:03 +00001972 BuildMI(BB, PPC::OR, 2, TmpReg1).addReg(TmpReg2).addReg(TmpReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001973 return;
1974 case Intrinsic::vaend: return;
1975
1976 case Intrinsic::returnaddress:
Misha Brukmanec6319a2004-07-20 15:51:37 +00001977 TmpReg1 = getReg(CI);
1978 if (cast<Constant>(CI.getOperand(1))->isNullValue()) {
1979 MachineFrameInfo *MFI = F->getFrameInfo();
1980 unsigned NumBytes = MFI->getStackSize();
1981
Misha Brukman5b570812004-08-10 22:47:03 +00001982 BuildMI(BB, PPC::LWZ, 2, TmpReg1).addSImm(NumBytes+8)
1983 .addReg(PPC::R1);
Misha Brukmanec6319a2004-07-20 15:51:37 +00001984 } else {
1985 // Values other than zero are not implemented yet.
Misha Brukman5b570812004-08-10 22:47:03 +00001986 BuildMI(BB, PPC::LI, 1, TmpReg1).addSImm(0);
Misha Brukmanec6319a2004-07-20 15:51:37 +00001987 }
1988 return;
1989
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001990 case Intrinsic::frameaddress:
1991 TmpReg1 = getReg(CI);
1992 if (cast<Constant>(CI.getOperand(1))->isNullValue()) {
Misha Brukman5b570812004-08-10 22:47:03 +00001993 BuildMI(BB, PPC::OR, 2, TmpReg1).addReg(PPC::R1).addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001994 } else {
1995 // Values other than zero are not implemented yet.
Misha Brukman5b570812004-08-10 22:47:03 +00001996 BuildMI(BB, PPC::LI, 1, TmpReg1).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001997 }
1998 return;
Misha Brukmanb097f212004-07-26 18:13:24 +00001999
Misha Brukmana2916ce2004-06-21 17:58:36 +00002000#if 0
2001 // This may be useful for supporting isunordered
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002002 case Intrinsic::isnan:
2003 // If this is only used by 'isunordered' style comparisons, don't emit it.
2004 if (isOnlyUsedByUnorderedComparisons(&CI)) return;
2005 TmpReg1 = getReg(CI.getOperand(1));
2006 emitUCOM(BB, BB->end(), TmpReg1, TmpReg1);
Misha Brukman422791f2004-06-21 17:41:12 +00002007 TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00002008 BuildMI(BB, PPC::MFCR, TmpReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002009 TmpReg3 = getReg(CI);
Misha Brukman5b570812004-08-10 22:47:03 +00002010 BuildMI(BB, PPC::RLWINM, 4, TmpReg3).addReg(TmpReg2).addImm(4).addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002011 return;
Misha Brukmana2916ce2004-06-21 17:58:36 +00002012#endif
2013
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002014 default: assert(0 && "Error: unknown intrinsics should have been lowered!");
2015 }
2016}
2017
2018/// visitSimpleBinary - Implement simple binary operators for integral types...
2019/// OperatorClass is one of: 0 for Add, 1 for Sub, 2 for And, 3 for Or, 4 for
2020/// Xor.
2021///
Misha Brukmana1dca552004-09-21 18:22:19 +00002022void PPC32ISel::visitSimpleBinary(BinaryOperator &B, unsigned OperatorClass) {
Nate Begeman1b750222004-10-17 05:19:20 +00002023 if (std::find(SkipList.begin(), SkipList.end(), &B) != SkipList.end())
2024 return;
Nate Begeman905a2912004-10-24 10:33:30 +00002025
2026 unsigned DestReg = getReg(B);
2027 MachineBasicBlock::iterator MI = BB->end();
2028 RlwimiRec RR = InsertMap[&B];
2029 if (RR.Target != 0) {
2030 unsigned TargetReg = getReg(RR.Target, BB, MI);
2031 unsigned InsertReg = getReg(RR.Insert, BB, MI);
2032 BuildMI(*BB, MI, PPC::RLWIMI, 5, DestReg).addReg(TargetReg)
2033 .addReg(InsertReg).addImm(RR.Shift).addImm(RR.MB).addImm(RR.ME);
2034 return;
Nate Begeman1b750222004-10-17 05:19:20 +00002035 }
Nate Begeman905a2912004-10-24 10:33:30 +00002036
2037 unsigned Class = getClassB(B.getType());
2038 Value *Op0 = B.getOperand(0), *Op1 = B.getOperand(1);
2039 emitSimpleBinaryOperation(BB, MI, &B, Op0, Op1, OperatorClass, DestReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002040}
2041
2042/// emitBinaryFPOperation - This method handles emission of floating point
2043/// Add (0), Sub (1), Mul (2), and Div (3) operations.
Misha Brukmana1dca552004-09-21 18:22:19 +00002044void PPC32ISel::emitBinaryFPOperation(MachineBasicBlock *BB,
2045 MachineBasicBlock::iterator IP,
2046 Value *Op0, Value *Op1,
2047 unsigned OperatorClass, unsigned DestReg){
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002048
Nate Begeman6d1e2df2004-08-14 22:11:38 +00002049 static const unsigned OpcodeTab[][4] = {
2050 { PPC::FADDS, PPC::FSUBS, PPC::FMULS, PPC::FDIVS }, // Float
2051 { PPC::FADD, PPC::FSUB, PPC::FMUL, PPC::FDIV }, // Double
2052 };
2053
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002054 // Special case: R1 = op <const fp>, R2
Misha Brukmana596f8c2004-07-13 15:35:45 +00002055 if (ConstantFP *Op0C = dyn_cast<ConstantFP>(Op0))
2056 if (Op0C->isExactlyValue(-0.0) && OperatorClass == 1) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002057 // -0.0 - X === -X
2058 unsigned op1Reg = getReg(Op1, BB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00002059 BuildMI(*BB, IP, PPC::FNEG, 1, DestReg).addReg(op1Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002060 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002061 }
2062
Nate Begeman81d265d2004-08-19 05:20:54 +00002063 unsigned Opcode = OpcodeTab[Op0->getType() == Type::DoubleTy][OperatorClass];
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002064 unsigned Op0r = getReg(Op0, BB, IP);
2065 unsigned Op1r = getReg(Op1, BB, IP);
2066 BuildMI(*BB, IP, Opcode, 2, DestReg).addReg(Op0r).addReg(Op1r);
2067}
2068
Nate Begemanb816f022004-10-07 22:30:03 +00002069// ExactLog2 - This function solves for (Val == 1 << (N-1)) and returns N. It
2070// returns zero when the input is not exactly a power of two.
2071static unsigned ExactLog2(unsigned Val) {
2072 if (Val == 0 || (Val & (Val-1))) return 0;
2073 unsigned Count = 0;
2074 while (Val != 1) {
2075 Val >>= 1;
2076 ++Count;
2077 }
2078 return Count;
2079}
2080
Nate Begemanbdf69842004-10-08 02:49:24 +00002081// isRunOfOnes - returns true if Val consists of one contiguous run of 1's with
2082// any number of 0's on either side. the 1's are allowed to wrap from LSB to
2083// MSB. so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
2084// not, since all 1's are not contiguous.
2085static bool isRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME) {
2086 bool isRun = true;
2087 MB = 0;
2088 ME = 0;
2089
2090 // look for first set bit
2091 int i = 0;
2092 for (; i < 32; i++) {
2093 if ((Val & (1 << (31 - i))) != 0) {
2094 MB = i;
2095 ME = i;
2096 break;
2097 }
2098 }
2099
2100 // look for last set bit
2101 for (; i < 32; i++) {
2102 if ((Val & (1 << (31 - i))) == 0)
2103 break;
2104 ME = i;
2105 }
2106
2107 // look for next set bit
2108 for (; i < 32; i++) {
2109 if ((Val & (1 << (31 - i))) != 0)
2110 break;
2111 }
2112
2113 // if we exhausted all the bits, we found a match at this point for 0*1*0*
2114 if (i == 32)
2115 return true;
2116
2117 // since we just encountered more 1's, if it doesn't wrap around to the
2118 // most significant bit of the word, then we did not find a match to 1*0*1* so
2119 // exit.
2120 if (MB != 0)
2121 return false;
2122
2123 // look for last set bit
2124 for (MB = i; i < 32; i++) {
2125 if ((Val & (1 << (31 - i))) == 0)
2126 break;
2127 }
2128
2129 // if we exhausted all the bits, then we found a match for 1*0*1*, otherwise,
2130 // the value is not a run of ones.
2131 if (i == 32)
2132 return true;
2133 return false;
2134}
2135
Nate Begeman905a2912004-10-24 10:33:30 +00002136/// isInsertAndHalf - Helper function for emitBitfieldInsert. Returns true if
2137/// OpUser has one use, is used by an or instruction, and is itself an and whose
2138/// second operand is a constant int. Optionally, set OrI to the Or instruction
2139/// that is the sole user of OpUser, and Op1User to the other operand of the Or
2140/// instruction.
2141static bool isInsertAndHalf(User *OpUser, Instruction **Op1User,
2142 Instruction **OrI, unsigned &Mask) {
2143 // If this instruction doesn't have one use, then return false.
2144 if (!OpUser->hasOneUse())
2145 return false;
2146
2147 Mask = 0xFFFFFFFF;
2148 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(OpUser))
2149 if (BO->getOpcode() == Instruction::And) {
2150 Value *AndUse = *(OpUser->use_begin());
2151 if (BinaryOperator *Or = dyn_cast<BinaryOperator>(AndUse)) {
2152 if (Or->getOpcode() == Instruction::Or) {
2153 if (ConstantInt *CI = dyn_cast<ConstantInt>(OpUser->getOperand(1))) {
2154 if (OrI) *OrI = Or;
2155 if (Op1User) {
2156 if (Or->getOperand(0) == OpUser)
2157 *Op1User = dyn_cast<Instruction>(Or->getOperand(1));
2158 else
2159 *Op1User = dyn_cast<Instruction>(Or->getOperand(0));
Nate Begeman1b750222004-10-17 05:19:20 +00002160 }
Nate Begeman905a2912004-10-24 10:33:30 +00002161 Mask &= CI->getRawValue();
2162 return true;
Nate Begeman1b750222004-10-17 05:19:20 +00002163 }
2164 }
2165 }
2166 }
Nate Begeman905a2912004-10-24 10:33:30 +00002167 return false;
2168}
2169
2170/// isInsertShiftHalf - Helper function for emitBitfieldInsert. Returns true if
2171/// OpUser has one use, is used by an or instruction, and is itself a shift
2172/// instruction that is either used directly by the or instruction, or is used
2173/// by an and instruction whose second operand is a constant int, and which is
2174/// used by the or instruction.
2175static bool isInsertShiftHalf(User *OpUser, Instruction **Op1User,
2176 Instruction **OrI, Instruction **OptAndI,
2177 unsigned &Shift, unsigned &Mask) {
2178 // If this instruction doesn't have one use, then return false.
2179 if (!OpUser->hasOneUse())
2180 return false;
2181
2182 Mask = 0xFFFFFFFF;
2183 if (ShiftInst *SI = dyn_cast<ShiftInst>(OpUser)) {
2184 if (ConstantInt *CI = dyn_cast<ConstantInt>(SI->getOperand(1))) {
2185 Shift = CI->getRawValue();
2186 if (SI->getOpcode() == Instruction::Shl)
2187 Mask <<= Shift;
2188 else if (!SI->getOperand(0)->getType()->isSigned()) {
2189 Mask >>= Shift;
2190 Shift = 32 - Shift;
2191 }
2192
2193 // Now check to see if the shift instruction is used by an or.
2194 Value *ShiftUse = *(OpUser->use_begin());
2195 Value *OptAndICopy = 0;
2196 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(ShiftUse)) {
2197 if (BO->getOpcode() == Instruction::And && BO->hasOneUse()) {
2198 if (ConstantInt *ACI = dyn_cast<ConstantInt>(BO->getOperand(1))) {
2199 if (OptAndI) *OptAndI = BO;
2200 OptAndICopy = BO;
2201 Mask &= ACI->getRawValue();
2202 BO = dyn_cast<BinaryOperator>(*(BO->use_begin()));
2203 }
2204 }
2205 if (BO && BO->getOpcode() == Instruction::Or) {
2206 if (OrI) *OrI = BO;
2207 if (Op1User) {
2208 if (BO->getOperand(0) == OpUser || BO->getOperand(0) == OptAndICopy)
2209 *Op1User = dyn_cast<Instruction>(BO->getOperand(1));
2210 else
2211 *Op1User = dyn_cast<Instruction>(BO->getOperand(0));
2212 }
2213 return true;
2214 }
2215 }
2216 }
2217 }
2218 return false;
2219}
2220
2221/// emitBitfieldInsert - turn a shift used only by an and with immediate into
2222/// the rotate left word immediate then mask insert (rlwimi) instruction.
2223/// Patterns matched:
2224/// 1. or shl, and 5. or (shl-and), and 9. or and, and
2225/// 2. or and, shl 6. or and, (shl-and)
2226/// 3. or shr, and 7. or (shr-and), and
2227/// 4. or and, shr 8. or and, (shr-and)
Nate Begeman9b508c32004-10-26 03:48:25 +00002228bool PPC32ISel::emitBitfieldInsert(User *OpUser, unsigned DestReg) {
Nate Begeman905a2912004-10-24 10:33:30 +00002229 // Instructions to skip if we match any of the patterns
2230 Instruction *Op0User, *Op1User = 0, *OptAndI = 0, *OrI = 0;
2231 unsigned TgtMask, InsMask, Amount = 0;
2232 bool matched = false;
2233
2234 // We require OpUser to be an instruction to continue
2235 Op0User = dyn_cast<Instruction>(OpUser);
2236 if (0 == Op0User)
2237 return false;
2238
2239 // Look for cases 2, 4, 6, 8, and 9
2240 if (isInsertAndHalf(Op0User, &Op1User, &OrI, TgtMask))
2241 if (Op1User)
2242 if (isInsertAndHalf(Op1User, 0, 0, InsMask))
2243 matched = true;
2244 else if (isInsertShiftHalf(Op1User, 0, 0, &OptAndI, Amount, InsMask))
2245 matched = true;
2246
2247 // Look for cases 1, 3, 5, and 7. Force the shift argument to be the one
2248 // inserted into the target, since rlwimi can only rotate the value inserted,
2249 // not the value being inserted into.
2250 if (matched == false)
2251 if (isInsertShiftHalf(Op0User, &Op1User, &OrI, &OptAndI, Amount, InsMask))
2252 if (Op1User && isInsertAndHalf(Op1User, 0, 0, TgtMask)) {
2253 std::swap(Op0User, Op1User);
2254 matched = true;
2255 }
2256
2257 // We didn't succeed in matching one of the patterns, so return false
2258 if (matched == false)
2259 return false;
2260
2261 // If the masks xor to -1, and the insert mask is a run of ones, then we have
2262 // succeeded in matching one of the cases for generating rlwimi. Update the
2263 // skip lists and users of the Instruction::Or.
2264 unsigned MB, ME;
2265 if (((TgtMask ^ InsMask) == 0xFFFFFFFF) && isRunOfOnes(InsMask, MB, ME)) {
2266 SkipList.push_back(Op0User);
2267 SkipList.push_back(Op1User);
2268 SkipList.push_back(OptAndI);
2269 InsertMap[OrI] = RlwimiRec(Op0User->getOperand(0), Op1User->getOperand(0),
2270 Amount, MB, ME);
2271 return true;
2272 }
2273 return false;
2274}
2275
2276/// emitBitfieldExtract - turn a shift used only by an and with immediate into the
2277/// rotate left word immediate then and with mask (rlwinm) instruction.
2278bool PPC32ISel::emitBitfieldExtract(MachineBasicBlock *MBB,
2279 MachineBasicBlock::iterator IP,
Nate Begeman9b508c32004-10-26 03:48:25 +00002280 User *OpUser, unsigned DestReg) {
Nate Begeman905a2912004-10-24 10:33:30 +00002281 return false;
Nate Begeman9b508c32004-10-26 03:48:25 +00002282 /*
2283 // Instructions to skip if we match any of the patterns
2284 Instruction *Op0User, *Op1User = 0;
2285 unsigned ShiftMask, AndMask, Amount = 0;
2286 bool matched = false;
Nate Begeman905a2912004-10-24 10:33:30 +00002287
Nate Begeman9b508c32004-10-26 03:48:25 +00002288 // We require OpUser to be an instruction to continue
2289 Op0User = dyn_cast<Instruction>(OpUser);
2290 if (0 == Op0User)
2291 return false;
2292
2293 if (isExtractShiftHalf)
2294 if (isExtractAndHalf)
2295 matched = true;
2296
2297 if (matched == false && isExtractAndHalf)
2298 if (isExtractShiftHalf)
2299 matched = true;
2300
2301 if (matched == false)
2302 return false;
2303
2304 if (isRunOfOnes(Imm, MB, ME)) {
2305 unsigned SrcReg = getReg(Op, MBB, IP);
2306 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(Rotate)
2307 .addImm(MB).addImm(ME);
2308 Op1User->replaceAllUsesWith(Op0User);
2309 SkipList.push_back(BO);
2310 return true;
Nate Begeman1b750222004-10-17 05:19:20 +00002311 }
Nate Begeman9b508c32004-10-26 03:48:25 +00002312 */
Nate Begeman1b750222004-10-17 05:19:20 +00002313}
2314
Nate Begemanb816f022004-10-07 22:30:03 +00002315/// emitBinaryConstOperation - Implement simple binary operators for integral
2316/// types with a constant operand. Opcode is one of: 0 for Add, 1 for Sub,
2317/// 2 for And, 3 for Or, 4 for Xor, and 5 for Subtract-From.
2318///
2319void PPC32ISel::emitBinaryConstOperation(MachineBasicBlock *MBB,
2320 MachineBasicBlock::iterator IP,
2321 unsigned Op0Reg, ConstantInt *Op1,
2322 unsigned Opcode, unsigned DestReg) {
2323 static const unsigned OpTab[] = {
2324 PPC::ADD, PPC::SUB, PPC::AND, PPC::OR, PPC::XOR, PPC::SUBF
2325 };
2326 static const unsigned ImmOpTab[2][6] = {
2327 { PPC::ADDI, PPC::ADDI, PPC::ANDIo, PPC::ORI, PPC::XORI, PPC::SUBFIC },
2328 { PPC::ADDIS, PPC::ADDIS, PPC::ANDISo, PPC::ORIS, PPC::XORIS, PPC::SUBFIC }
2329 };
2330
2331 // Handle subtract now by inverting the constant value
2332 ConstantInt *CI = Op1;
2333 if (Opcode == 1) {
2334 ConstantSInt *CSI = dyn_cast<ConstantSInt>(Op1);
2335 CI = ConstantSInt::get(Op1->getType(), -CSI->getValue());
2336 }
2337
2338 // xor X, -1 -> not X
2339 if (Opcode == 4) {
Chris Lattner289a49a2004-10-16 18:13:47 +00002340 ConstantInt *CI = dyn_cast<ConstantSInt>(Op1);
2341 if (CI && CI->isAllOnesValue()) {
Nate Begemanb816f022004-10-07 22:30:03 +00002342 BuildMI(*MBB, IP, PPC::NOR, 2, DestReg).addReg(Op0Reg).addReg(Op0Reg);
2343 return;
2344 }
2345 }
Nate Begemanbdf69842004-10-08 02:49:24 +00002346
Nate Begeman9b508c32004-10-26 03:48:25 +00002347 if (Opcode == 2 && !CI->isNullValue()) {
Nate Begemanbdf69842004-10-08 02:49:24 +00002348 unsigned MB, ME, mask = CI->getRawValue();
2349 if (isRunOfOnes(mask, MB, ME)) {
Nate Begemanbdf69842004-10-08 02:49:24 +00002350 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(Op0Reg).addImm(0)
2351 .addImm(MB).addImm(ME);
2352 return;
2353 }
2354 }
Nate Begemanb816f022004-10-07 22:30:03 +00002355
Nate Begemane0c83a82004-10-15 00:50:19 +00002356 // PowerPC 16 bit signed immediates are sign extended before use by the
2357 // instruction. Therefore, we can only split up an add of a reg with a 32 bit
2358 // immediate into addis and addi if the sign bit of the low 16 bits is cleared
2359 // so that for register A, const imm X, we don't end up with
2360 // A + XXXX0000 + FFFFXXXX.
2361 bool WontSignExtend = (0 == (Op1->getRawValue() & 0x8000));
2362
Nate Begemanb816f022004-10-07 22:30:03 +00002363 // For Add, Sub, and SubF the instruction takes a signed immediate. For And,
2364 // Or, and Xor, the instruction takes an unsigned immediate. There is no
2365 // shifted immediate form of SubF so disallow its opcode for those constants.
2366 if (canUseAsImmediateForOpcode(CI, Opcode, false)) {
2367 if (Opcode < 2 || Opcode == 5)
2368 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(Op0Reg)
2369 .addSImm(Op1->getRawValue());
2370 else
2371 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(Op0Reg)
2372 .addZImm(Op1->getRawValue());
2373 } else if (canUseAsImmediateForOpcode(CI, Opcode, true) && (Opcode < 5)) {
2374 if (Opcode < 2)
2375 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, DestReg).addReg(Op0Reg)
2376 .addSImm(Op1->getRawValue() >> 16);
2377 else
2378 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, DestReg).addReg(Op0Reg)
2379 .addZImm(Op1->getRawValue() >> 16);
Nate Begemane0c83a82004-10-15 00:50:19 +00002380 } else if ((Opcode < 2 && WontSignExtend) || Opcode == 3 || Opcode == 4) {
2381 unsigned TmpReg = makeAnotherReg(Op1->getType());
Nate Begemane0c83a82004-10-15 00:50:19 +00002382 if (Opcode < 2) {
2383 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, TmpReg).addReg(Op0Reg)
2384 .addSImm(Op1->getRawValue() >> 16);
2385 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(TmpReg)
2386 .addSImm(Op1->getRawValue());
2387 } else {
2388 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, TmpReg).addReg(Op0Reg)
2389 .addZImm(Op1->getRawValue() >> 16);
2390 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(TmpReg)
2391 .addZImm(Op1->getRawValue());
2392 }
Nate Begemanb816f022004-10-07 22:30:03 +00002393 } else {
2394 unsigned Op1Reg = getReg(Op1, MBB, IP);
2395 BuildMI(*MBB, IP, OpTab[Opcode], 2, DestReg).addReg(Op0Reg).addReg(Op1Reg);
2396 }
2397}
2398
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002399/// emitSimpleBinaryOperation - Implement simple binary operators for integral
2400/// types... OperatorClass is one of: 0 for Add, 1 for Sub, 2 for And, 3 for
2401/// Or, 4 for Xor.
2402///
Misha Brukmana1dca552004-09-21 18:22:19 +00002403void PPC32ISel::emitSimpleBinaryOperation(MachineBasicBlock *MBB,
2404 MachineBasicBlock::iterator IP,
Nate Begeman1b750222004-10-17 05:19:20 +00002405 BinaryOperator *BO,
Misha Brukmana1dca552004-09-21 18:22:19 +00002406 Value *Op0, Value *Op1,
2407 unsigned OperatorClass,
2408 unsigned DestReg) {
Misha Brukman422791f2004-06-21 17:41:12 +00002409 // Arithmetic and Bitwise operators
Misha Brukman911afde2004-06-25 14:50:41 +00002410 static const unsigned OpcodeTab[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00002411 PPC::ADD, PPC::SUB, PPC::AND, PPC::OR, PPC::XOR
Misha Brukman422791f2004-06-21 17:41:12 +00002412 };
Nate Begemanb816f022004-10-07 22:30:03 +00002413 static const unsigned LongOpTab[2][5] = {
2414 { PPC::ADDC, PPC::SUBC, PPC::AND, PPC::OR, PPC::XOR },
2415 { PPC::ADDE, PPC::SUBFE, PPC::AND, PPC::OR, PPC::XOR }
Misha Brukman422791f2004-06-21 17:41:12 +00002416 };
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002417
Nate Begemanb816f022004-10-07 22:30:03 +00002418 unsigned Class = getClassB(Op0->getType());
2419
Misha Brukman7e898c32004-07-20 00:41:46 +00002420 if (Class == cFP32 || Class == cFP64) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002421 assert(OperatorClass < 2 && "No logical ops for FP!");
2422 emitBinaryFPOperation(MBB, IP, Op0, Op1, OperatorClass, DestReg);
2423 return;
2424 }
2425
2426 if (Op0->getType() == Type::BoolTy) {
2427 if (OperatorClass == 3)
2428 // If this is an or of two isnan's, emit an FP comparison directly instead
2429 // of or'ing two isnan's together.
2430 if (Value *LHS = dyncastIsNan(Op0))
2431 if (Value *RHS = dyncastIsNan(Op1)) {
2432 unsigned Op0Reg = getReg(RHS, MBB, IP), Op1Reg = getReg(LHS, MBB, IP);
Misha Brukman422791f2004-06-21 17:41:12 +00002433 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002434 emitUCOM(MBB, IP, Op0Reg, Op1Reg);
Misha Brukman5b570812004-08-10 22:47:03 +00002435 BuildMI(*MBB, IP, PPC::MFCR, TmpReg);
2436 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(TmpReg).addImm(4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002437 .addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002438 return;
2439 }
2440 }
2441
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002442 // Special case: op <const int>, Reg
Nate Begemanb816f022004-10-07 22:30:03 +00002443 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op0))
Misha Brukman1013ef52004-07-21 20:09:08 +00002444 if (Class != cLong) {
Nate Begemanb816f022004-10-07 22:30:03 +00002445 unsigned Opcode = (OperatorClass == 1) ? 5 : OperatorClass;
2446 unsigned Op1r = getReg(Op1, MBB, IP);
2447 emitBinaryConstOperation(MBB, IP, Op1r, CI, Opcode, DestReg);
2448 return;
2449 }
2450 // Special case: op Reg, <const int>
2451 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1))
2452 if (Class != cLong) {
Nate Begeman9b508c32004-10-26 03:48:25 +00002453 if (emitBitfieldInsert(BO, DestReg))
Nate Begeman1b750222004-10-17 05:19:20 +00002454 return;
Nate Begeman905a2912004-10-24 10:33:30 +00002455
Nate Begemanb816f022004-10-07 22:30:03 +00002456 unsigned Op0r = getReg(Op0, MBB, IP);
2457 emitBinaryConstOperation(MBB, IP, Op0r, CI, OperatorClass, DestReg);
Misha Brukman1013ef52004-07-21 20:09:08 +00002458 return;
2459 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002460
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002461 // We couldn't generate an immediate variant of the op, load both halves into
2462 // registers and emit the appropriate opcode.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002463 unsigned Op0r = getReg(Op0, MBB, IP);
2464 unsigned Op1r = getReg(Op1, MBB, IP);
2465
2466 if (Class != cLong) {
Misha Brukman422791f2004-06-21 17:41:12 +00002467 unsigned Opcode = OpcodeTab[OperatorClass];
2468 BuildMI(*MBB, IP, Opcode, 2, DestReg).addReg(Op0r).addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002469 } else {
Nate Begemanb816f022004-10-07 22:30:03 +00002470 BuildMI(*MBB, IP, LongOpTab[0][OperatorClass], 2, DestReg+1).addReg(Op0r+1)
Misha Brukman7e898c32004-07-20 00:41:46 +00002471 .addReg(Op1r+1);
Nate Begemanb816f022004-10-07 22:30:03 +00002472 BuildMI(*MBB, IP, LongOpTab[1][OperatorClass], 2, DestReg).addReg(Op0r)
Misha Brukman1013ef52004-07-21 20:09:08 +00002473 .addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002474 }
2475 return;
2476}
2477
Misha Brukman1013ef52004-07-21 20:09:08 +00002478/// doMultiply - Emit appropriate instructions to multiply together the
2479/// Values Op0 and Op1, and put the result in DestReg.
Misha Brukman2fec9902004-06-21 20:22:03 +00002480///
Misha Brukmana1dca552004-09-21 18:22:19 +00002481void PPC32ISel::doMultiply(MachineBasicBlock *MBB,
2482 MachineBasicBlock::iterator IP,
2483 unsigned DestReg, Value *Op0, Value *Op1) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002484 unsigned Class0 = getClass(Op0->getType());
2485 unsigned Class1 = getClass(Op1->getType());
2486
2487 unsigned Op0r = getReg(Op0, MBB, IP);
2488 unsigned Op1r = getReg(Op1, MBB, IP);
2489
2490 // 64 x 64 -> 64
2491 if (Class0 == cLong && Class1 == cLong) {
2492 unsigned Tmp1 = makeAnotherReg(Type::IntTy);
2493 unsigned Tmp2 = makeAnotherReg(Type::IntTy);
2494 unsigned Tmp3 = makeAnotherReg(Type::IntTy);
2495 unsigned Tmp4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00002496 BuildMI(*MBB, IP, PPC::MULHWU, 2, Tmp1).addReg(Op0r+1).addReg(Op1r+1);
2497 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg+1).addReg(Op0r+1).addReg(Op1r+1);
2498 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp2).addReg(Op0r+1).addReg(Op1r);
2499 BuildMI(*MBB, IP, PPC::ADD, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
2500 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp4).addReg(Op0r).addReg(Op1r+1);
2501 BuildMI(*MBB, IP, PPC::ADD, 2, DestReg).addReg(Tmp3).addReg(Tmp4);
Misha Brukman1013ef52004-07-21 20:09:08 +00002502 return;
2503 }
2504
2505 // 64 x 32 or less, promote 32 to 64 and do a 64 x 64
2506 if (Class0 == cLong && Class1 <= cInt) {
2507 unsigned Tmp0 = makeAnotherReg(Type::IntTy);
2508 unsigned Tmp1 = makeAnotherReg(Type::IntTy);
2509 unsigned Tmp2 = makeAnotherReg(Type::IntTy);
2510 unsigned Tmp3 = makeAnotherReg(Type::IntTy);
2511 unsigned Tmp4 = makeAnotherReg(Type::IntTy);
2512 if (Op1->getType()->isSigned())
Misha Brukman5b570812004-08-10 22:47:03 +00002513 BuildMI(*MBB, IP, PPC::SRAWI, 2, Tmp0).addReg(Op1r).addImm(31);
Misha Brukman1013ef52004-07-21 20:09:08 +00002514 else
Misha Brukman5b570812004-08-10 22:47:03 +00002515 BuildMI(*MBB, IP, PPC::LI, 2, Tmp0).addSImm(0);
2516 BuildMI(*MBB, IP, PPC::MULHWU, 2, Tmp1).addReg(Op0r+1).addReg(Op1r);
2517 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg+1).addReg(Op0r+1).addReg(Op1r);
2518 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp2).addReg(Op0r+1).addReg(Tmp0);
2519 BuildMI(*MBB, IP, PPC::ADD, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
2520 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp4).addReg(Op0r).addReg(Op1r);
2521 BuildMI(*MBB, IP, PPC::ADD, 2, DestReg).addReg(Tmp3).addReg(Tmp4);
Misha Brukman1013ef52004-07-21 20:09:08 +00002522 return;
2523 }
2524
2525 // 32 x 32 -> 32
2526 if (Class0 <= cInt && Class1 <= cInt) {
Misha Brukman5b570812004-08-10 22:47:03 +00002527 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg).addReg(Op0r).addReg(Op1r);
Misha Brukman1013ef52004-07-21 20:09:08 +00002528 return;
2529 }
2530
2531 assert(0 && "doMultiply cannot operate on unknown type!");
2532}
2533
2534/// doMultiplyConst - This method will multiply the value in Op0 by the
2535/// value of the ContantInt *CI
Misha Brukmana1dca552004-09-21 18:22:19 +00002536void PPC32ISel::doMultiplyConst(MachineBasicBlock *MBB,
2537 MachineBasicBlock::iterator IP,
2538 unsigned DestReg, Value *Op0, ConstantInt *CI) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002539 unsigned Class = getClass(Op0->getType());
2540
2541 // Mul op0, 0 ==> 0
2542 if (CI->isNullValue()) {
Misha Brukman5b570812004-08-10 22:47:03 +00002543 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00002544 if (Class == cLong)
Misha Brukman5b570812004-08-10 22:47:03 +00002545 BuildMI(*MBB, IP, PPC::LI, 1, DestReg+1).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002546 return;
Misha Brukman1013ef52004-07-21 20:09:08 +00002547 }
2548
2549 // Mul op0, 1 ==> op0
2550 if (CI->equalsInt(1)) {
2551 unsigned Op0r = getReg(Op0, MBB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00002552 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(Op0r).addReg(Op0r);
Misha Brukman1013ef52004-07-21 20:09:08 +00002553 if (Class == cLong)
Misha Brukman5b570812004-08-10 22:47:03 +00002554 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(Op0r+1).addReg(Op0r+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002555 return;
2556 }
2557
2558 // If the element size is exactly a power of 2, use a shift to get it.
Misha Brukman1013ef52004-07-21 20:09:08 +00002559 if (unsigned Shift = ExactLog2(CI->getRawValue())) {
2560 ConstantUInt *ShiftCI = ConstantUInt::get(Type::UByteTy, Shift);
Nate Begeman9b508c32004-10-26 03:48:25 +00002561 emitShiftOperation(MBB, IP, Op0, ShiftCI, true, Op0->getType(), 0, DestReg);
Misha Brukman1013ef52004-07-21 20:09:08 +00002562 return;
2563 }
2564
2565 // If 32 bits or less and immediate is in right range, emit mul by immediate
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002566 if (Class == cByte || Class == cShort || Class == cInt) {
Nate Begemanb816f022004-10-07 22:30:03 +00002567 if (canUseAsImmediateForOpcode(CI, 0, false)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002568 unsigned Op0r = getReg(Op0, MBB, IP);
2569 unsigned imm = CI->getRawValue() & 0xFFFF;
Misha Brukman5b570812004-08-10 22:47:03 +00002570 BuildMI(*MBB, IP, PPC::MULLI, 2, DestReg).addReg(Op0r).addSImm(imm);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002571 return;
2572 }
2573 }
2574
Misha Brukman1013ef52004-07-21 20:09:08 +00002575 doMultiply(MBB, IP, DestReg, Op0, CI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002576}
2577
Misha Brukmana1dca552004-09-21 18:22:19 +00002578void PPC32ISel::visitMul(BinaryOperator &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002579 unsigned ResultReg = getReg(I);
2580
2581 Value *Op0 = I.getOperand(0);
2582 Value *Op1 = I.getOperand(1);
2583
2584 MachineBasicBlock::iterator IP = BB->end();
2585 emitMultiply(BB, IP, Op0, Op1, ResultReg);
2586}
2587
Misha Brukmana1dca552004-09-21 18:22:19 +00002588void PPC32ISel::emitMultiply(MachineBasicBlock *MBB,
2589 MachineBasicBlock::iterator IP,
2590 Value *Op0, Value *Op1, unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002591 TypeClass Class = getClass(Op0->getType());
2592
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002593 switch (Class) {
2594 case cByte:
2595 case cShort:
2596 case cInt:
Misha Brukman1013ef52004-07-21 20:09:08 +00002597 case cLong:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002598 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002599 doMultiplyConst(MBB, IP, DestReg, Op0, CI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002600 } else {
Misha Brukman1013ef52004-07-21 20:09:08 +00002601 doMultiply(MBB, IP, DestReg, Op0, Op1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002602 }
2603 return;
Misha Brukman7e898c32004-07-20 00:41:46 +00002604 case cFP32:
2605 case cFP64:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002606 emitBinaryFPOperation(MBB, IP, Op0, Op1, 2, DestReg);
2607 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002608 break;
2609 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002610}
2611
2612
2613/// visitDivRem - Handle division and remainder instructions... these
2614/// instruction both require the same instructions to be generated, they just
2615/// select the result from a different register. Note that both of these
2616/// instructions work differently for signed and unsigned operands.
2617///
Misha Brukmana1dca552004-09-21 18:22:19 +00002618void PPC32ISel::visitDivRem(BinaryOperator &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002619 unsigned ResultReg = getReg(I);
2620 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2621
2622 MachineBasicBlock::iterator IP = BB->end();
Misha Brukman2fec9902004-06-21 20:22:03 +00002623 emitDivRemOperation(BB, IP, Op0, Op1, I.getOpcode() == Instruction::Div,
2624 ResultReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002625}
2626
Nate Begeman087d5d92004-10-06 09:53:04 +00002627void PPC32ISel::emitDivRemOperation(MachineBasicBlock *MBB,
Misha Brukmana1dca552004-09-21 18:22:19 +00002628 MachineBasicBlock::iterator IP,
2629 Value *Op0, Value *Op1, bool isDiv,
2630 unsigned ResultReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002631 const Type *Ty = Op0->getType();
2632 unsigned Class = getClass(Ty);
2633 switch (Class) {
Misha Brukman7e898c32004-07-20 00:41:46 +00002634 case cFP32:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002635 if (isDiv) {
Misha Brukman7e898c32004-07-20 00:41:46 +00002636 // Floating point divide...
Nate Begeman087d5d92004-10-06 09:53:04 +00002637 emitBinaryFPOperation(MBB, IP, Op0, Op1, 3, ResultReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002638 return;
Misha Brukman7e898c32004-07-20 00:41:46 +00002639 } else {
2640 // Floating point remainder via fmodf(float x, float y);
Nate Begeman087d5d92004-10-06 09:53:04 +00002641 unsigned Op0Reg = getReg(Op0, MBB, IP);
2642 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman7e898c32004-07-20 00:41:46 +00002643 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002644 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(fmodfFn, true);
Misha Brukman7e898c32004-07-20 00:41:46 +00002645 std::vector<ValueRecord> Args;
2646 Args.push_back(ValueRecord(Op0Reg, Type::FloatTy));
2647 Args.push_back(ValueRecord(Op1Reg, Type::FloatTy));
2648 doCall(ValueRecord(ResultReg, Type::FloatTy), TheCall, Args, false);
Misha Brukmane2eceb52004-07-23 16:08:20 +00002649 TM.CalledFunctions.insert(fmodfFn);
Misha Brukman7e898c32004-07-20 00:41:46 +00002650 }
2651 return;
2652 case cFP64:
2653 if (isDiv) {
2654 // Floating point divide...
Nate Begeman087d5d92004-10-06 09:53:04 +00002655 emitBinaryFPOperation(MBB, IP, Op0, Op1, 3, ResultReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00002656 return;
2657 } else {
2658 // Floating point remainder via fmod(double x, double y);
Nate Begeman087d5d92004-10-06 09:53:04 +00002659 unsigned Op0Reg = getReg(Op0, MBB, IP);
2660 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002661 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002662 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(fmodFn, true);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002663 std::vector<ValueRecord> Args;
2664 Args.push_back(ValueRecord(Op0Reg, Type::DoubleTy));
2665 Args.push_back(ValueRecord(Op1Reg, Type::DoubleTy));
Misha Brukmand18a31d2004-07-06 22:51:53 +00002666 doCall(ValueRecord(ResultReg, Type::DoubleTy), TheCall, Args, false);
Misha Brukmane2eceb52004-07-23 16:08:20 +00002667 TM.CalledFunctions.insert(fmodFn);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002668 }
2669 return;
2670 case cLong: {
Misha Brukman7e898c32004-07-20 00:41:46 +00002671 static Function* const Funcs[] =
Misha Brukman0aa97c62004-07-08 18:27:59 +00002672 { __moddi3Fn, __divdi3Fn, __umoddi3Fn, __udivdi3Fn };
Nate Begeman087d5d92004-10-06 09:53:04 +00002673 unsigned Op0Reg = getReg(Op0, MBB, IP);
2674 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002675 unsigned NameIdx = Ty->isUnsigned()*2 + isDiv;
2676 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002677 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(Funcs[NameIdx], true);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002678
2679 std::vector<ValueRecord> Args;
2680 Args.push_back(ValueRecord(Op0Reg, Type::LongTy));
2681 Args.push_back(ValueRecord(Op1Reg, Type::LongTy));
Misha Brukmand18a31d2004-07-06 22:51:53 +00002682 doCall(ValueRecord(ResultReg, Type::LongTy), TheCall, Args, false);
Misha Brukmane2eceb52004-07-23 16:08:20 +00002683 TM.CalledFunctions.insert(Funcs[NameIdx]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002684 return;
2685 }
2686 case cByte: case cShort: case cInt:
2687 break; // Small integrals, handled below...
2688 default: assert(0 && "Unknown class!");
2689 }
2690
2691 // Special case signed division by power of 2.
2692 if (isDiv)
2693 if (ConstantSInt *CI = dyn_cast<ConstantSInt>(Op1)) {
2694 assert(Class != cLong && "This doesn't handle 64-bit divides!");
2695 int V = CI->getValue();
2696
2697 if (V == 1) { // X /s 1 => X
Nate Begeman087d5d92004-10-06 09:53:04 +00002698 unsigned Op0Reg = getReg(Op0, MBB, IP);
2699 BuildMI(*MBB, IP, PPC::OR, 2, ResultReg).addReg(Op0Reg).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002700 return;
2701 }
2702
2703 if (V == -1) { // X /s -1 => -X
Nate Begeman087d5d92004-10-06 09:53:04 +00002704 unsigned Op0Reg = getReg(Op0, MBB, IP);
2705 BuildMI(*MBB, IP, PPC::NEG, 1, ResultReg).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002706 return;
2707 }
2708
Misha Brukmanec6319a2004-07-20 15:51:37 +00002709 unsigned log2V = ExactLog2(V);
2710 if (log2V != 0 && Ty->isSigned()) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002711 unsigned Op0Reg = getReg(Op0, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002712 unsigned TmpReg = makeAnotherReg(Op0->getType());
Misha Brukmanec6319a2004-07-20 15:51:37 +00002713
Nate Begeman087d5d92004-10-06 09:53:04 +00002714 BuildMI(*MBB, IP, PPC::SRAWI, 2, TmpReg).addReg(Op0Reg).addImm(log2V);
2715 BuildMI(*MBB, IP, PPC::ADDZE, 1, ResultReg).addReg(TmpReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002716 return;
2717 }
2718 }
2719
Nate Begeman087d5d92004-10-06 09:53:04 +00002720 unsigned Op0Reg = getReg(Op0, MBB, IP);
2721
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002722 if (isDiv) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002723 unsigned Op1Reg = getReg(Op1, MBB, IP);
2724 unsigned Opcode = Ty->isSigned() ? PPC::DIVW : PPC::DIVWU;
2725 BuildMI(*MBB, IP, Opcode, 2, ResultReg).addReg(Op0Reg).addReg(Op1Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002726 } else { // Remainder
Nate Begeman087d5d92004-10-06 09:53:04 +00002727 // FIXME: don't load the CI part of a CI divide twice
2728 ConstantInt *CI = dyn_cast<ConstantInt>(Op1);
Misha Brukman422791f2004-06-21 17:41:12 +00002729 unsigned TmpReg1 = makeAnotherReg(Op0->getType());
2730 unsigned TmpReg2 = makeAnotherReg(Op0->getType());
Nate Begeman087d5d92004-10-06 09:53:04 +00002731 emitDivRemOperation(MBB, IP, Op0, Op1, true, TmpReg1);
Nate Begemanb816f022004-10-07 22:30:03 +00002732 if (CI && canUseAsImmediateForOpcode(CI, 0, false)) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002733 BuildMI(*MBB, IP, PPC::MULLI, 2, TmpReg2).addReg(TmpReg1)
2734 .addSImm(CI->getRawValue());
2735 } else {
2736 unsigned Op1Reg = getReg(Op1, MBB, IP);
2737 BuildMI(*MBB, IP, PPC::MULLW, 2, TmpReg2).addReg(TmpReg1).addReg(Op1Reg);
2738 }
2739 BuildMI(*MBB, IP, PPC::SUBF, 2, ResultReg).addReg(TmpReg2).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002740 }
2741}
2742
2743
2744/// Shift instructions: 'shl', 'sar', 'shr' - Some special cases here
2745/// for constant immediate shift values, and for constant immediate
2746/// shift values equal to 1. Even the general case is sort of special,
2747/// because the shift amount has to be in CL, not just any old register.
2748///
Misha Brukmana1dca552004-09-21 18:22:19 +00002749void PPC32ISel::visitShiftInst(ShiftInst &I) {
Nate Begeman905a2912004-10-24 10:33:30 +00002750 if (std::find(SkipList.begin(), SkipList.end(), &I) != SkipList.end())
2751 return;
2752
Misha Brukmane2eceb52004-07-23 16:08:20 +00002753 MachineBasicBlock::iterator IP = BB->end();
2754 emitShiftOperation(BB, IP, I.getOperand(0), I.getOperand(1),
2755 I.getOpcode() == Instruction::Shl, I.getType(),
Nate Begeman9b508c32004-10-26 03:48:25 +00002756 &I, getReg(I));
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002757}
2758
2759/// emitShiftOperation - Common code shared between visitShiftInst and
2760/// constant expression support.
Misha Brukman2fec9902004-06-21 20:22:03 +00002761///
Misha Brukmana1dca552004-09-21 18:22:19 +00002762void PPC32ISel::emitShiftOperation(MachineBasicBlock *MBB,
2763 MachineBasicBlock::iterator IP,
2764 Value *Op, Value *ShiftAmount,
Nate Begeman9b508c32004-10-26 03:48:25 +00002765 bool isLeftShift, const Type *ResultTy,
2766 ShiftInst *SI, unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002767 bool isSigned = ResultTy->isSigned ();
2768 unsigned Class = getClass (ResultTy);
2769
2770 // Longs, as usual, are handled specially...
2771 if (Class == cLong) {
Nate Begeman1b750222004-10-17 05:19:20 +00002772 unsigned SrcReg = getReg (Op, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002773 // If we have a constant shift, we can generate much more efficient code
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002774 // than for a variable shift by using the rlwimi instruction.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002775 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(ShiftAmount)) {
2776 unsigned Amount = CUI->getValue();
2777 if (Amount < 32) {
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002778 unsigned TempReg = makeAnotherReg(ResultTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002779 if (isLeftShift) {
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002780 BuildMI(*MBB, IP, PPC::RLWINM, 4, TempReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002781 .addImm(Amount).addImm(0).addImm(31-Amount);
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002782 BuildMI(*MBB, IP, PPC::RLWIMI, 5, DestReg).addReg(TempReg)
2783 .addReg(SrcReg+1).addImm(Amount).addImm(32-Amount).addImm(31);
Misha Brukman5b570812004-08-10 22:47:03 +00002784 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg+1).addReg(SrcReg+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00002785 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002786 } else {
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002787 BuildMI(*MBB, IP, PPC::RLWINM, 4, TempReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002788 .addImm(32-Amount).addImm(Amount).addImm(31);
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002789 BuildMI(*MBB, IP, PPC::RLWIMI, 5, DestReg+1).addReg(TempReg)
2790 .addReg(SrcReg).addImm(32-Amount).addImm(0).addImm(Amount-1);
Misha Brukman5b570812004-08-10 22:47:03 +00002791 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002792 .addImm(32-Amount).addImm(Amount).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002793 }
2794 } else { // Shifting more than 32 bits
2795 Amount -= 32;
2796 if (isLeftShift) {
2797 if (Amount != 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00002798 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002799 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002800 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002801 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002802 .addReg(SrcReg+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002803 }
Misha Brukman5b570812004-08-10 22:47:03 +00002804 BuildMI(*MBB, IP, PPC::LI, 1, DestReg+1).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00002805 } else {
2806 if (Amount != 0) {
2807 if (isSigned)
Misha Brukman5b570812004-08-10 22:47:03 +00002808 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002809 .addImm(Amount);
2810 else
Misha Brukman5b570812004-08-10 22:47:03 +00002811 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002812 .addImm(32-Amount).addImm(Amount).addImm(31);
2813 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002814 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002815 .addReg(SrcReg);
2816 }
Misha Brukman5b570812004-08-10 22:47:03 +00002817 BuildMI(*MBB, IP,PPC::LI, 1, DestReg).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002818 }
2819 }
2820 } else {
2821 unsigned TmpReg1 = makeAnotherReg(Type::IntTy);
2822 unsigned TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman422791f2004-06-21 17:41:12 +00002823 unsigned TmpReg3 = makeAnotherReg(Type::IntTy);
2824 unsigned TmpReg4 = makeAnotherReg(Type::IntTy);
2825 unsigned TmpReg5 = makeAnotherReg(Type::IntTy);
2826 unsigned TmpReg6 = makeAnotherReg(Type::IntTy);
2827 unsigned ShiftAmountReg = getReg (ShiftAmount, MBB, IP);
2828
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002829 if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002830 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002831 .addSImm(32);
Misha Brukman5b570812004-08-10 22:47:03 +00002832 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg2).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002833 .addReg(ShiftAmountReg);
Misha Brukman5b570812004-08-10 22:47:03 +00002834 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg3).addReg(SrcReg+1)
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002835 .addReg(TmpReg1);
Misha Brukman5b570812004-08-10 22:47:03 +00002836 BuildMI(*MBB, IP, PPC::OR, 2,TmpReg4).addReg(TmpReg2).addReg(TmpReg3);
2837 BuildMI(*MBB, IP, PPC::ADDI, 2, TmpReg5).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002838 .addSImm(-32);
Misha Brukman5b570812004-08-10 22:47:03 +00002839 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg6).addReg(SrcReg+1)
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002840 .addReg(TmpReg5);
Misha Brukman5b570812004-08-10 22:47:03 +00002841 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(TmpReg4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002842 .addReg(TmpReg6);
Misha Brukman5b570812004-08-10 22:47:03 +00002843 BuildMI(*MBB, IP, PPC::SLW, 2, DestReg+1).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002844 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002845 } else {
Nate Begemanf2f07812004-08-29 08:19:32 +00002846 if (isSigned) { // shift right algebraic
2847 MachineBasicBlock *TmpMBB =new MachineBasicBlock(BB->getBasicBlock());
2848 MachineBasicBlock *PhiMBB =new MachineBasicBlock(BB->getBasicBlock());
2849 MachineBasicBlock *OldMBB = BB;
2850 ilist<MachineBasicBlock>::iterator It = BB; ++It;
2851 F->getBasicBlockList().insert(It, TmpMBB);
2852 F->getBasicBlockList().insert(It, PhiMBB);
2853 BB->addSuccessor(TmpMBB);
2854 BB->addSuccessor(PhiMBB);
2855
2856 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
2857 .addSImm(32);
2858 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg2).addReg(SrcReg+1)
2859 .addReg(ShiftAmountReg);
2860 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg3).addReg(SrcReg)
2861 .addReg(TmpReg1);
2862 BuildMI(*MBB, IP, PPC::OR, 2, TmpReg4).addReg(TmpReg2)
2863 .addReg(TmpReg3);
2864 BuildMI(*MBB, IP, PPC::ADDICo, 2, TmpReg5).addReg(ShiftAmountReg)
2865 .addSImm(-32);
2866 BuildMI(*MBB, IP, PPC::SRAW, 2, TmpReg6).addReg(SrcReg)
2867 .addReg(TmpReg5);
2868 BuildMI(*MBB, IP, PPC::SRAW, 2, DestReg).addReg(SrcReg)
2869 .addReg(ShiftAmountReg);
2870 BuildMI(*MBB, IP, PPC::BLE, 2).addReg(PPC::CR0).addMBB(PhiMBB);
2871
2872 // OrMBB:
2873 // Select correct least significant half if the shift amount > 32
2874 BB = TmpMBB;
2875 unsigned OrReg = makeAnotherReg(Type::IntTy);
2876 BuildMI(BB, PPC::OR, 2, OrReg).addReg(TmpReg6).addImm(TmpReg6);
2877 TmpMBB->addSuccessor(PhiMBB);
2878
2879 BB = PhiMBB;
2880 BuildMI(BB, PPC::PHI, 4, DestReg+1).addReg(TmpReg4).addMBB(OldMBB)
2881 .addReg(OrReg).addMBB(TmpMBB);
2882 } else { // shift right logical
Misha Brukman5b570812004-08-10 22:47:03 +00002883 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002884 .addSImm(32);
Misha Brukman5b570812004-08-10 22:47:03 +00002885 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg2).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002886 .addReg(ShiftAmountReg);
Misha Brukman5b570812004-08-10 22:47:03 +00002887 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg3).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002888 .addReg(TmpReg1);
Misha Brukman5b570812004-08-10 22:47:03 +00002889 BuildMI(*MBB, IP, PPC::OR, 2, TmpReg4).addReg(TmpReg2)
Misha Brukman2fec9902004-06-21 20:22:03 +00002890 .addReg(TmpReg3);
Misha Brukman5b570812004-08-10 22:47:03 +00002891 BuildMI(*MBB, IP, PPC::ADDI, 2, TmpReg5).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002892 .addSImm(-32);
Misha Brukman5b570812004-08-10 22:47:03 +00002893 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg6).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002894 .addReg(TmpReg5);
Misha Brukman5b570812004-08-10 22:47:03 +00002895 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(TmpReg4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002896 .addReg(TmpReg6);
Misha Brukman5b570812004-08-10 22:47:03 +00002897 BuildMI(*MBB, IP, PPC::SRW, 2, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002898 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002899 }
2900 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002901 }
2902 return;
2903 }
2904
2905 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(ShiftAmount)) {
2906 // The shift amount is constant, guaranteed to be a ubyte. Get its value.
2907 assert(CUI->getType() == Type::UByteTy && "Shift amount not a ubyte?");
2908 unsigned Amount = CUI->getValue();
Nate Begeman1b750222004-10-17 05:19:20 +00002909
Nate Begeman905a2912004-10-24 10:33:30 +00002910 // If this is a shift with one use, and that use is an And instruction,
2911 // then attempt to emit a bitfield operation.
Nate Begeman9b508c32004-10-26 03:48:25 +00002912 if (SI && emitBitfieldInsert(SI, DestReg))
2913 return;
Nate Begeman1b750222004-10-17 05:19:20 +00002914
2915 unsigned SrcReg = getReg (Op, MBB, IP);
Misha Brukman422791f2004-06-21 17:41:12 +00002916 if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002917 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002918 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman422791f2004-06-21 17:41:12 +00002919 } else {
Misha Brukman2fec9902004-06-21 20:22:03 +00002920 if (isSigned) {
Misha Brukman5b570812004-08-10 22:47:03 +00002921 BuildMI(*MBB, IP, PPC::SRAWI,2,DestReg).addReg(SrcReg).addImm(Amount);
Misha Brukman2fec9902004-06-21 20:22:03 +00002922 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002923 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002924 .addImm(32-Amount).addImm(Amount).addImm(31);
2925 }
Misha Brukman422791f2004-06-21 17:41:12 +00002926 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002927 } else { // The shift amount is non-constant.
Nate Begeman1b750222004-10-17 05:19:20 +00002928 unsigned SrcReg = getReg (Op, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002929 unsigned ShiftAmountReg = getReg (ShiftAmount, MBB, IP);
2930
Misha Brukman422791f2004-06-21 17:41:12 +00002931 if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002932 BuildMI(*MBB, IP, PPC::SLW, 2, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002933 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002934 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002935 BuildMI(*MBB, IP, isSigned ? PPC::SRAW : PPC::SRW, 2, DestReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002936 .addReg(SrcReg).addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002937 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002938 }
2939}
2940
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002941/// LoadNeedsSignExtend - On PowerPC, there is no load byte with sign extend.
2942/// Therefore, if this is a byte load and the destination type is signed, we
Nate Begeman35b020d2004-10-06 11:03:30 +00002943/// would normally need to also emit a sign extend instruction after the load.
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002944/// However, store instructions don't care whether a signed type was sign
2945/// extended across a whole register. Also, a SetCC instruction will emit its
2946/// own sign extension to force the value into the appropriate range, so we
2947/// need not emit it here. Ideally, this kind of thing wouldn't be necessary
2948/// once LLVM's type system is improved.
2949static bool LoadNeedsSignExtend(LoadInst &LI) {
2950 if (cByte == getClassB(LI.getType()) && LI.getType()->isSigned()) {
2951 bool AllUsesAreStoresOrSetCC = true;
Nate Begeman35b020d2004-10-06 11:03:30 +00002952 for (Value::use_iterator I = LI.use_begin(), E = LI.use_end(); I != E; ++I){
Chris Lattner7c348e12004-10-06 16:28:24 +00002953 if (isa<SetCondInst>(*I))
Nate Begeman35b020d2004-10-06 11:03:30 +00002954 continue;
Chris Lattner7c348e12004-10-06 16:28:24 +00002955 if (StoreInst *SI = dyn_cast<StoreInst>(*I))
Nate Begemanb816f022004-10-07 22:30:03 +00002956 if (cByte == getClassB(SI->getOperand(0)->getType()))
Nate Begeman35b020d2004-10-06 11:03:30 +00002957 continue;
2958 AllUsesAreStoresOrSetCC = false;
2959 break;
2960 }
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002961 if (!AllUsesAreStoresOrSetCC)
2962 return true;
2963 }
2964 return false;
2965}
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002966
Misha Brukmanb097f212004-07-26 18:13:24 +00002967/// visitLoadInst - Implement LLVM load instructions. Pretty straightforward
2968/// mapping of LLVM classes to PPC load instructions, with the exception of
2969/// signed byte loads, which need a sign extension following them.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002970///
Misha Brukmana1dca552004-09-21 18:22:19 +00002971void PPC32ISel::visitLoadInst(LoadInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00002972 // Immediate opcodes, for reg+imm addressing
2973 static const unsigned ImmOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00002974 PPC::LBZ, PPC::LHZ, PPC::LWZ,
2975 PPC::LFS, PPC::LFD, PPC::LWZ
Misha Brukmanb097f212004-07-26 18:13:24 +00002976 };
2977 // Indexed opcodes, for reg+reg addressing
2978 static const unsigned IdxOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00002979 PPC::LBZX, PPC::LHZX, PPC::LWZX,
2980 PPC::LFSX, PPC::LFDX, PPC::LWZX
Misha Brukman2fec9902004-06-21 20:22:03 +00002981 };
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002982
Misha Brukmanb097f212004-07-26 18:13:24 +00002983 unsigned Class = getClassB(I.getType());
2984 unsigned ImmOpcode = ImmOpcodes[Class];
2985 unsigned IdxOpcode = IdxOpcodes[Class];
2986 unsigned DestReg = getReg(I);
2987 Value *SourceAddr = I.getOperand(0);
2988
Misha Brukman5b570812004-08-10 22:47:03 +00002989 if (Class == cShort && I.getType()->isSigned()) ImmOpcode = PPC::LHA;
2990 if (Class == cShort && I.getType()->isSigned()) IdxOpcode = PPC::LHAX;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002991
Nate Begeman53e4aa52004-11-24 21:53:14 +00002992 // If this is a fixed size alloca, emit a load directly from the stack slot
2993 // corresponding to it.
Misha Brukmanb097f212004-07-26 18:13:24 +00002994 if (AllocaInst *AI = dyn_castFixedAlloca(SourceAddr)) {
Misha Brukman422791f2004-06-21 17:41:12 +00002995 unsigned FI = getFixedSizedAllocaFI(AI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002996 if (Class == cLong) {
Misha Brukmanb097f212004-07-26 18:13:24 +00002997 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg), FI);
2998 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg+1), FI, 4);
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002999 } else if (LoadNeedsSignExtend(I)) {
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003000 unsigned TmpReg = makeAnotherReg(I.getType());
Misha Brukmanb097f212004-07-26 18:13:24 +00003001 addFrameReference(BuildMI(BB, ImmOpcode, 2, TmpReg), FI);
Misha Brukman5b570812004-08-10 22:47:03 +00003002 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003003 } else {
Misha Brukmanb097f212004-07-26 18:13:24 +00003004 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +00003005 }
Misha Brukmanb097f212004-07-26 18:13:24 +00003006 return;
3007 }
3008
Nate Begeman645495d2004-09-23 05:31:33 +00003009 // If the offset fits in 16 bits, we can emit a reg+imm load, otherwise, we
3010 // use the index from the FoldedGEP struct and use reg+reg addressing.
Misha Brukmanb097f212004-07-26 18:13:24 +00003011 if (GetElementPtrInst *GEPI = canFoldGEPIntoLoadOrStore(SourceAddr)) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003012
Nate Begeman645495d2004-09-23 05:31:33 +00003013 // Generate the code for the GEP and get the components of the folded GEP
3014 emitGEPOperation(BB, BB->end(), GEPI, true);
3015 unsigned baseReg = GEPMap[GEPI].base;
3016 unsigned indexReg = GEPMap[GEPI].index;
3017 ConstantSInt *offset = GEPMap[GEPI].offset;
3018
3019 if (Class != cLong) {
Nate Begemanbc3a5372004-11-19 08:01:16 +00003020 unsigned TmpReg = LoadNeedsSignExtend(I) ? makeAnotherReg(I.getType())
3021 : DestReg;
Nate Begeman645495d2004-09-23 05:31:33 +00003022 if (indexReg == 0)
Misha Brukmanb097f212004-07-26 18:13:24 +00003023 BuildMI(BB, ImmOpcode, 2, TmpReg).addSImm(offset->getValue())
3024 .addReg(baseReg);
Nate Begeman645495d2004-09-23 05:31:33 +00003025 else
3026 BuildMI(BB, IdxOpcode, 2, TmpReg).addReg(indexReg).addReg(baseReg);
3027 if (LoadNeedsSignExtend(I))
Misha Brukman5b570812004-08-10 22:47:03 +00003028 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Nate Begeman645495d2004-09-23 05:31:33 +00003029 } else {
3030 indexReg = (indexReg != 0) ? indexReg : getReg(offset);
Misha Brukmanb097f212004-07-26 18:13:24 +00003031 unsigned indexPlus4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003032 BuildMI(BB, PPC::ADDI, 2, indexPlus4).addReg(indexReg).addSImm(4);
Misha Brukmanb097f212004-07-26 18:13:24 +00003033 BuildMI(BB, IdxOpcode, 2, DestReg).addReg(indexReg).addReg(baseReg);
3034 BuildMI(BB, IdxOpcode, 2, DestReg+1).addReg(indexPlus4).addReg(baseReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003035 }
Misha Brukmanb097f212004-07-26 18:13:24 +00003036 return;
3037 }
3038
3039 // The fallback case, where the load was from a source that could not be
3040 // folded into the load instruction.
3041 unsigned SrcAddrReg = getReg(SourceAddr);
3042
3043 if (Class == cLong) {
3044 BuildMI(BB, ImmOpcode, 2, DestReg).addSImm(0).addReg(SrcAddrReg);
3045 BuildMI(BB, ImmOpcode, 2, DestReg+1).addSImm(4).addReg(SrcAddrReg);
Nate Begeman0e5e5f52004-08-22 08:10:15 +00003046 } else if (LoadNeedsSignExtend(I)) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003047 unsigned TmpReg = makeAnotherReg(I.getType());
3048 BuildMI(BB, ImmOpcode, 2, TmpReg).addSImm(0).addReg(SrcAddrReg);
Misha Brukman5b570812004-08-10 22:47:03 +00003049 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003050 } else {
3051 BuildMI(BB, ImmOpcode, 2, DestReg).addSImm(0).addReg(SrcAddrReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003052 }
3053}
3054
3055/// visitStoreInst - Implement LLVM store instructions
3056///
Misha Brukmana1dca552004-09-21 18:22:19 +00003057void PPC32ISel::visitStoreInst(StoreInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003058 // Immediate opcodes, for reg+imm addressing
3059 static const unsigned ImmOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00003060 PPC::STB, PPC::STH, PPC::STW,
3061 PPC::STFS, PPC::STFD, PPC::STW
Misha Brukmanb097f212004-07-26 18:13:24 +00003062 };
3063 // Indexed opcodes, for reg+reg addressing
3064 static const unsigned IdxOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00003065 PPC::STBX, PPC::STHX, PPC::STWX,
3066 PPC::STFSX, PPC::STFDX, PPC::STWX
Misha Brukmanb097f212004-07-26 18:13:24 +00003067 };
3068
3069 Value *SourceAddr = I.getOperand(1);
3070 const Type *ValTy = I.getOperand(0)->getType();
3071 unsigned Class = getClassB(ValTy);
3072 unsigned ImmOpcode = ImmOpcodes[Class];
3073 unsigned IdxOpcode = IdxOpcodes[Class];
3074 unsigned ValReg = getReg(I.getOperand(0));
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003075
Nate Begeman53e4aa52004-11-24 21:53:14 +00003076 // If this is a fixed size alloca, emit a store directly to the stack slot
3077 // corresponding to it.
3078 if (AllocaInst *AI = dyn_castFixedAlloca(SourceAddr)) {
3079 unsigned FI = getFixedSizedAllocaFI(AI);
3080 addFrameReference(BuildMI(BB, ImmOpcode, 3).addReg(ValReg), FI);
3081 if (Class == cLong)
3082 addFrameReference(BuildMI(BB, ImmOpcode, 3).addReg(ValReg+1), FI, 4);
3083 return;
3084 }
3085
Nate Begeman645495d2004-09-23 05:31:33 +00003086 // If the offset fits in 16 bits, we can emit a reg+imm store, otherwise, we
3087 // use the index from the FoldedGEP struct and use reg+reg addressing.
Misha Brukmanb097f212004-07-26 18:13:24 +00003088 if (GetElementPtrInst *GEPI = canFoldGEPIntoLoadOrStore(SourceAddr)) {
Nate Begeman645495d2004-09-23 05:31:33 +00003089 // Generate the code for the GEP and get the components of the folded GEP
3090 emitGEPOperation(BB, BB->end(), GEPI, true);
3091 unsigned baseReg = GEPMap[GEPI].base;
3092 unsigned indexReg = GEPMap[GEPI].index;
3093 ConstantSInt *offset = GEPMap[GEPI].offset;
Misha Brukmanb097f212004-07-26 18:13:24 +00003094
Nate Begeman645495d2004-09-23 05:31:33 +00003095 if (Class != cLong) {
3096 if (indexReg == 0)
3097 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(offset->getValue())
3098 .addReg(baseReg);
3099 else
3100 BuildMI(BB, IdxOpcode, 3).addReg(ValReg).addReg(indexReg)
3101 .addReg(baseReg);
3102 } else {
3103 indexReg = (indexReg != 0) ? indexReg : getReg(offset);
Misha Brukmanb097f212004-07-26 18:13:24 +00003104 unsigned indexPlus4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003105 BuildMI(BB, PPC::ADDI, 2, indexPlus4).addReg(indexReg).addSImm(4);
Misha Brukmanb097f212004-07-26 18:13:24 +00003106 BuildMI(BB, IdxOpcode, 3).addReg(ValReg).addReg(indexReg).addReg(baseReg);
3107 BuildMI(BB, IdxOpcode, 3).addReg(ValReg+1).addReg(indexPlus4)
3108 .addReg(baseReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003109 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003110 return;
3111 }
Misha Brukmanb097f212004-07-26 18:13:24 +00003112
3113 // If the store address wasn't the only use of a GEP, we fall back to the
3114 // standard path: store the ValReg at the value in AddressReg.
3115 unsigned AddressReg = getReg(I.getOperand(1));
3116 if (Class == cLong) {
3117 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(0).addReg(AddressReg);
3118 BuildMI(BB, ImmOpcode, 3).addReg(ValReg+1).addSImm(4).addReg(AddressReg);
3119 return;
3120 }
3121 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(0).addReg(AddressReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003122}
3123
3124
3125/// visitCastInst - Here we have various kinds of copying with or without sign
3126/// extension going on.
3127///
Misha Brukmana1dca552004-09-21 18:22:19 +00003128void PPC32ISel::visitCastInst(CastInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003129 Value *Op = CI.getOperand(0);
3130
3131 unsigned SrcClass = getClassB(Op->getType());
3132 unsigned DestClass = getClassB(CI.getType());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003133
Nate Begeman676dee62004-11-08 02:25:40 +00003134 // Noop casts are not emitted: getReg will return the source operand as the
3135 // register to use for any uses of the noop cast.
3136 if (DestClass == SrcClass) return;
3137
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003138 // 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 +00003139 // of the cast are GEP instructions, then the cast does not need to be
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003140 // generated explicitly, it will be folded into the GEP.
3141 if (DestClass == cLong && SrcClass == cInt) {
3142 bool AllUsesAreGEPs = true;
3143 for (Value::use_iterator I = CI.use_begin(), E = CI.use_end(); I != E; ++I)
3144 if (!isa<GetElementPtrInst>(*I)) {
3145 AllUsesAreGEPs = false;
3146 break;
3147 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003148 if (AllUsesAreGEPs) return;
3149 }
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003150
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003151 unsigned DestReg = getReg(CI);
3152 MachineBasicBlock::iterator MI = BB->end();
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003153
Nate Begeman31dfc522004-10-23 00:50:23 +00003154 // If this is a cast from an integer type to a ubyte, with one use where the
3155 // use is the shift amount argument of a shift instruction, just emit a move
3156 // instead (since the shift instruction will only look at the low 5 bits
3157 // regardless of how it is sign extended)
3158 if (CI.getType() == Type::UByteTy && SrcClass <= cInt && CI.hasOneUse()) {
3159 ShiftInst *SI = dyn_cast<ShiftInst>(*(CI.use_begin()));
3160 if (SI && (SI->getOperand(1) == &CI)) {
3161 unsigned SrcReg = getReg(Op, BB, MI);
3162 BuildMI(*BB, MI, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3163 return;
3164 }
3165 }
3166
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003167 // If this is a cast from an byte, short, or int to an integer type of equal
3168 // or lesser width, and all uses of the cast are store instructions then dont
3169 // emit them, as the store instruction will implicitly not store the zero or
3170 // sign extended bytes.
3171 if (SrcClass <= cInt && SrcClass >= DestClass) {
Nate Begeman075cdc62004-11-07 20:23:42 +00003172 bool AllUsesAreStores = true;
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003173 for (Value::use_iterator I = CI.use_begin(), E = CI.use_end(); I != E; ++I)
Nate Begeman075cdc62004-11-07 20:23:42 +00003174 if (!isa<StoreInst>(*I)) {
3175 AllUsesAreStores = false;
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003176 break;
3177 }
3178 // Turn this cast directly into a move instruction, which the register
3179 // allocator will deal with.
Nate Begeman075cdc62004-11-07 20:23:42 +00003180 if (AllUsesAreStores) {
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003181 unsigned SrcReg = getReg(Op, BB, MI);
3182 BuildMI(*BB, MI, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3183 return;
3184 }
3185 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003186 emitCastOperation(BB, MI, Op, CI.getType(), DestReg);
3187}
3188
3189/// emitCastOperation - Common code shared between visitCastInst and constant
3190/// expression cast support.
3191///
Misha Brukmana1dca552004-09-21 18:22:19 +00003192void PPC32ISel::emitCastOperation(MachineBasicBlock *MBB,
3193 MachineBasicBlock::iterator IP,
3194 Value *Src, const Type *DestTy,
3195 unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003196 const Type *SrcTy = Src->getType();
3197 unsigned SrcClass = getClassB(SrcTy);
3198 unsigned DestClass = getClassB(DestTy);
Misha Brukman7e898c32004-07-20 00:41:46 +00003199 unsigned SrcReg = getReg(Src, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003200
Nate Begeman0797d492004-10-20 21:55:41 +00003201 // Implement casts from bool to integer types as a move operation
3202 if (SrcTy == Type::BoolTy) {
3203 switch (DestClass) {
3204 case cByte:
3205 case cShort:
3206 case cInt:
3207 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3208 return;
3209 case cLong:
3210 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addImm(0);
3211 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg).addReg(SrcReg);
3212 return;
3213 default:
3214 break;
3215 }
3216 }
3217
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003218 // Implement casts to bool by using compare on the operand followed by set if
3219 // not zero on the result.
3220 if (DestTy == Type::BoolTy) {
3221 switch (SrcClass) {
3222 case cByte:
Misha Brukman422791f2004-06-21 17:41:12 +00003223 case cShort:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003224 case cInt: {
3225 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003226 BuildMI(*MBB, IP, PPC::ADDIC, 2, TmpReg).addReg(SrcReg).addSImm(-1);
3227 BuildMI(*MBB, IP, PPC::SUBFE, 2, DestReg).addReg(TmpReg).addReg(SrcReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003228 break;
3229 }
3230 case cLong: {
3231 unsigned TmpReg = makeAnotherReg(Type::IntTy);
3232 unsigned SrcReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003233 BuildMI(*MBB, IP, PPC::OR, 2, SrcReg2).addReg(SrcReg).addReg(SrcReg+1);
3234 BuildMI(*MBB, IP, PPC::ADDIC, 2, TmpReg).addReg(SrcReg2).addSImm(-1);
3235 BuildMI(*MBB, IP, PPC::SUBFE, 2, DestReg).addReg(TmpReg)
Misha Brukmanbf417a62004-07-20 20:43:05 +00003236 .addReg(SrcReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003237 break;
3238 }
Misha Brukman7e898c32004-07-20 00:41:46 +00003239 case cFP32:
3240 case cFP64:
Nate Begemanf2f07812004-08-29 08:19:32 +00003241 unsigned TmpReg = makeAnotherReg(Type::IntTy);
3242 unsigned ConstZero = getReg(ConstantFP::get(Type::DoubleTy, 0.0), BB, IP);
3243 BuildMI(*MBB, IP, PPC::FCMPU, PPC::CR7).addReg(SrcReg).addReg(ConstZero);
3244 BuildMI(*MBB, IP, PPC::MFCR, TmpReg);
3245 BuildMI(*MBB, IP, PPC::RLWINM, DestReg).addReg(TmpReg).addImm(31)
3246 .addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003247 }
3248 return;
3249 }
3250
Misha Brukman7e898c32004-07-20 00:41:46 +00003251 // Handle cast of Float -> Double
3252 if (SrcClass == cFP32 && DestClass == cFP64) {
Misha Brukman5b570812004-08-10 22:47:03 +00003253 BuildMI(*MBB, IP, PPC::FMR, 1, DestReg).addReg(SrcReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00003254 return;
3255 }
3256
3257 // Handle cast of Double -> Float
3258 if (SrcClass == cFP64 && DestClass == cFP32) {
Misha Brukman5b570812004-08-10 22:47:03 +00003259 BuildMI(*MBB, IP, PPC::FRSP, 1, DestReg).addReg(SrcReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00003260 return;
3261 }
3262
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003263 // Handle casts from integer to floating point now...
Misha Brukman7e898c32004-07-20 00:41:46 +00003264 if (DestClass == cFP32 || DestClass == cFP64) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003265
Misha Brukman422791f2004-06-21 17:41:12 +00003266 // Emit a library call for long to float conversion
3267 if (SrcClass == cLong) {
Misha Brukman7e898c32004-07-20 00:41:46 +00003268 Function *floatFn = (DestClass == cFP32) ? __floatdisfFn : __floatdidfFn;
Nate Begemanf2f07812004-08-29 08:19:32 +00003269 if (SrcTy->isSigned()) {
3270 std::vector<ValueRecord> Args;
3271 Args.push_back(ValueRecord(SrcReg, SrcTy));
3272 MachineInstr *TheCall =
3273 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3274 doCall(ValueRecord(DestReg, DestTy), TheCall, Args, false);
3275 TM.CalledFunctions.insert(floatFn);
3276 } else {
3277 std::vector<ValueRecord> CmpArgs, ClrArgs, SetArgs;
3278 unsigned ZeroLong = getReg(ConstantUInt::get(SrcTy, 0));
3279 unsigned CondReg = makeAnotherReg(Type::IntTy);
3280
3281 // Update machine-CFG edges
3282 MachineBasicBlock *ClrMBB = new MachineBasicBlock(BB->getBasicBlock());
3283 MachineBasicBlock *SetMBB = new MachineBasicBlock(BB->getBasicBlock());
3284 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
3285 MachineBasicBlock *OldMBB = BB;
3286 ilist<MachineBasicBlock>::iterator It = BB; ++It;
3287 F->getBasicBlockList().insert(It, ClrMBB);
3288 F->getBasicBlockList().insert(It, SetMBB);
3289 F->getBasicBlockList().insert(It, PhiMBB);
3290 BB->addSuccessor(ClrMBB);
3291 BB->addSuccessor(SetMBB);
3292
3293 CmpArgs.push_back(ValueRecord(SrcReg, SrcTy));
3294 CmpArgs.push_back(ValueRecord(ZeroLong, SrcTy));
3295 MachineInstr *TheCall =
3296 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(__cmpdi2Fn, true);
3297 doCall(ValueRecord(CondReg, Type::IntTy), TheCall, CmpArgs, false);
3298 TM.CalledFunctions.insert(__cmpdi2Fn);
3299 BuildMI(*MBB, IP, PPC::CMPWI, 2, PPC::CR0).addReg(CondReg).addSImm(0);
3300 BuildMI(*MBB, IP, PPC::BLE, 2).addReg(PPC::CR0).addMBB(SetMBB);
3301
3302 // ClrMBB
3303 BB = ClrMBB;
3304 unsigned ClrReg = makeAnotherReg(DestTy);
3305 ClrArgs.push_back(ValueRecord(SrcReg, SrcTy));
3306 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3307 doCall(ValueRecord(ClrReg, DestTy), TheCall, ClrArgs, false);
3308 TM.CalledFunctions.insert(floatFn);
3309 BuildMI(BB, PPC::B, 1).addMBB(PhiMBB);
3310 BB->addSuccessor(PhiMBB);
3311
3312 // SetMBB
3313 BB = SetMBB;
3314 unsigned SetReg = makeAnotherReg(DestTy);
3315 unsigned CallReg = makeAnotherReg(DestTy);
3316 unsigned ShiftedReg = makeAnotherReg(SrcTy);
3317 ConstantSInt *Const1 = ConstantSInt::get(Type::IntTy, 1);
Nate Begeman9b508c32004-10-26 03:48:25 +00003318 emitShiftOperation(BB, BB->end(), Src, Const1, false, SrcTy, 0,
3319 ShiftedReg);
Nate Begemanf2f07812004-08-29 08:19:32 +00003320 SetArgs.push_back(ValueRecord(ShiftedReg, SrcTy));
3321 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3322 doCall(ValueRecord(CallReg, DestTy), TheCall, SetArgs, false);
3323 TM.CalledFunctions.insert(floatFn);
3324 unsigned SetOpcode = (DestClass == cFP32) ? PPC::FADDS : PPC::FADD;
3325 BuildMI(BB, SetOpcode, 2, SetReg).addReg(CallReg).addReg(CallReg);
3326 BB->addSuccessor(PhiMBB);
3327
3328 // PhiMBB
3329 BB = PhiMBB;
3330 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(ClrReg).addMBB(ClrMBB)
3331 .addReg(SetReg).addMBB(SetMBB);
3332 }
Misha Brukman422791f2004-06-21 17:41:12 +00003333 return;
3334 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003335
Misha Brukman7e898c32004-07-20 00:41:46 +00003336 // Make sure we're dealing with a full 32 bits
Nate Begeman8531f6f2004-11-19 02:06:40 +00003337 if (SrcClass < cInt) {
3338 unsigned TmpReg = makeAnotherReg(Type::IntTy);
3339 promote32(TmpReg, ValueRecord(SrcReg, SrcTy));
3340 SrcReg = TmpReg;
3341 }
Misha Brukman422791f2004-06-21 17:41:12 +00003342
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003343 // Spill the integer to memory and reload it from there.
Misha Brukman422791f2004-06-21 17:41:12 +00003344 // Also spill room for a special conversion constant
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003345 int ValueFrameIdx =
3346 F->getFrameInfo()->CreateStackObject(Type::DoubleTy, TM.getTargetData());
3347
Nate Begeman81d265d2004-08-19 05:20:54 +00003348 MachineConstantPool *CP = F->getConstantPool();
Misha Brukman422791f2004-06-21 17:41:12 +00003349 unsigned constantHi = makeAnotherReg(Type::IntTy);
Misha Brukman422791f2004-06-21 17:41:12 +00003350 unsigned TempF = makeAnotherReg(Type::DoubleTy);
3351
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003352 if (!SrcTy->isSigned()) {
Nate Begeman81d265d2004-08-19 05:20:54 +00003353 ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, 0x1.000000p52);
3354 unsigned ConstF = getReg(CFP, BB, IP);
Nate Begemanf2f07812004-08-29 08:19:32 +00003355 BuildMI(*MBB, IP, PPC::LIS, 1, constantHi).addSImm(0x4330);
3356 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(constantHi),
Misha Brukman2fec9902004-06-21 20:22:03 +00003357 ValueFrameIdx);
Nate Begemanf2f07812004-08-29 08:19:32 +00003358 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(SrcReg),
Misha Brukman2fec9902004-06-21 20:22:03 +00003359 ValueFrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003360 addFrameReference(BuildMI(*MBB, IP, PPC::LFD, 2, TempF), ValueFrameIdx);
3361 BuildMI(*MBB, IP, PPC::FSUB, 2, DestReg).addReg(TempF).addReg(ConstF);
Misha Brukman422791f2004-06-21 17:41:12 +00003362 } else {
Nate Begeman81d265d2004-08-19 05:20:54 +00003363 ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, 0x1.000008p52);
3364 unsigned ConstF = getReg(CFP, BB, IP);
Misha Brukman422791f2004-06-21 17:41:12 +00003365 unsigned TempLo = makeAnotherReg(Type::IntTy);
Nate Begemanf2f07812004-08-29 08:19:32 +00003366 BuildMI(*MBB, IP, PPC::LIS, 1, constantHi).addSImm(0x4330);
3367 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(constantHi),
Misha Brukman2fec9902004-06-21 20:22:03 +00003368 ValueFrameIdx);
Nate Begemanf2f07812004-08-29 08:19:32 +00003369 BuildMI(*MBB, IP, PPC::XORIS, 2, TempLo).addReg(SrcReg).addImm(0x8000);
3370 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(TempLo),
Misha Brukman2fec9902004-06-21 20:22:03 +00003371 ValueFrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003372 addFrameReference(BuildMI(*MBB, IP, PPC::LFD, 2, TempF), ValueFrameIdx);
3373 BuildMI(*MBB, IP, PPC::FSUB, 2, DestReg).addReg(TempF).addReg(ConstF);
Misha Brukman422791f2004-06-21 17:41:12 +00003374 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003375 return;
3376 }
3377
3378 // Handle casts from floating point to integer now...
Misha Brukman7e898c32004-07-20 00:41:46 +00003379 if (SrcClass == cFP32 || SrcClass == cFP64) {
Nate Begemanb64af912004-08-10 20:42:36 +00003380 static Function* const Funcs[] =
3381 { __fixsfdiFn, __fixdfdiFn, __fixunssfdiFn, __fixunsdfdiFn };
Misha Brukman422791f2004-06-21 17:41:12 +00003382 // emit library call
3383 if (DestClass == cLong) {
Nate Begemanb64af912004-08-10 20:42:36 +00003384 bool isDouble = SrcClass == cFP64;
3385 unsigned nameIndex = 2 * DestTy->isSigned() + isDouble;
Misha Brukman422791f2004-06-21 17:41:12 +00003386 std::vector<ValueRecord> Args;
3387 Args.push_back(ValueRecord(SrcReg, SrcTy));
Nate Begemanb64af912004-08-10 20:42:36 +00003388 Function *floatFn = Funcs[nameIndex];
Misha Brukman2fec9902004-06-21 20:22:03 +00003389 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003390 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003391 doCall(ValueRecord(DestReg, DestTy), TheCall, Args, false);
Misha Brukmane2eceb52004-07-23 16:08:20 +00003392 TM.CalledFunctions.insert(floatFn);
Misha Brukman422791f2004-06-21 17:41:12 +00003393 return;
3394 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003395
3396 int ValueFrameIdx =
Nate Begeman43d64ea2004-08-15 06:42:28 +00003397 F->getFrameInfo()->CreateStackObject(Type::DoubleTy, TM.getTargetData());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003398
Misha Brukman7e898c32004-07-20 00:41:46 +00003399 if (DestTy->isSigned()) {
Misha Brukman4c14f332004-07-23 01:11:19 +00003400 unsigned TempReg = makeAnotherReg(Type::DoubleTy);
3401
3402 // Convert to integer in the FP reg and store it to a stack slot
Nate Begemanf2f07812004-08-29 08:19:32 +00003403 BuildMI(*MBB, IP, PPC::FCTIWZ, 1, TempReg).addReg(SrcReg);
3404 addFrameReference(BuildMI(*MBB, IP, PPC::STFD, 3)
Misha Brukman4c14f332004-07-23 01:11:19 +00003405 .addReg(TempReg), ValueFrameIdx);
Misha Brukmanb097f212004-07-26 18:13:24 +00003406
3407 // There is no load signed byte opcode, so we must emit a sign extend for
3408 // that particular size. Make sure to source the new integer from the
3409 // correct offset.
Misha Brukman4c14f332004-07-23 01:11:19 +00003410 if (DestClass == cByte) {
3411 unsigned TempReg2 = makeAnotherReg(DestTy);
Nate Begemanf2f07812004-08-29 08:19:32 +00003412 addFrameReference(BuildMI(*MBB, IP, PPC::LBZ, 2, TempReg2),
Misha Brukmanb097f212004-07-26 18:13:24 +00003413 ValueFrameIdx, 7);
Nate Begemanf2f07812004-08-29 08:19:32 +00003414 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(TempReg2);
Misha Brukman4c14f332004-07-23 01:11:19 +00003415 } else {
Misha Brukmanb097f212004-07-26 18:13:24 +00003416 int offset = (DestClass == cShort) ? 6 : 4;
Misha Brukman5b570812004-08-10 22:47:03 +00003417 unsigned LoadOp = (DestClass == cShort) ? PPC::LHA : PPC::LWZ;
Nate Begemanf2f07812004-08-29 08:19:32 +00003418 addFrameReference(BuildMI(*MBB, IP, LoadOp, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003419 ValueFrameIdx, offset);
Misha Brukman4c14f332004-07-23 01:11:19 +00003420 }
Misha Brukman7e898c32004-07-20 00:41:46 +00003421 } else {
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003422 unsigned Zero = getReg(ConstantFP::get(Type::DoubleTy, 0.0f));
3423 double maxInt = (1LL << 32) - 1;
3424 unsigned MaxInt = getReg(ConstantFP::get(Type::DoubleTy, maxInt));
3425 double border = 1LL << 31;
3426 unsigned Border = getReg(ConstantFP::get(Type::DoubleTy, border));
3427 unsigned UseZero = makeAnotherReg(Type::DoubleTy);
3428 unsigned UseMaxInt = makeAnotherReg(Type::DoubleTy);
3429 unsigned UseChoice = makeAnotherReg(Type::DoubleTy);
3430 unsigned TmpReg = makeAnotherReg(Type::DoubleTy);
3431 unsigned TmpReg2 = makeAnotherReg(Type::DoubleTy);
3432 unsigned ConvReg = makeAnotherReg(Type::DoubleTy);
3433 unsigned IntTmp = makeAnotherReg(Type::IntTy);
3434 unsigned XorReg = makeAnotherReg(Type::IntTy);
3435 int FrameIdx =
3436 F->getFrameInfo()->CreateStackObject(SrcTy, TM.getTargetData());
3437 // Update machine-CFG edges
3438 MachineBasicBlock *XorMBB = new MachineBasicBlock(BB->getBasicBlock());
3439 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
3440 MachineBasicBlock *OldMBB = BB;
3441 ilist<MachineBasicBlock>::iterator It = BB; ++It;
3442 F->getBasicBlockList().insert(It, XorMBB);
3443 F->getBasicBlockList().insert(It, PhiMBB);
3444 BB->addSuccessor(XorMBB);
3445 BB->addSuccessor(PhiMBB);
3446
3447 // Convert from floating point to unsigned 32-bit value
3448 // Use 0 if incoming value is < 0.0
Nate Begemanf2f07812004-08-29 08:19:32 +00003449 BuildMI(*MBB, IP, PPC::FSEL, 3, UseZero).addReg(SrcReg).addReg(SrcReg)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003450 .addReg(Zero);
3451 // Use 2**32 - 1 if incoming value is >= 2**32
Nate Begemanf2f07812004-08-29 08:19:32 +00003452 BuildMI(*MBB, IP, PPC::FSUB, 2, UseMaxInt).addReg(MaxInt).addReg(SrcReg);
3453 BuildMI(*MBB, IP, PPC::FSEL, 3, UseChoice).addReg(UseMaxInt)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003454 .addReg(UseZero).addReg(MaxInt);
3455 // Subtract 2**31
Nate Begemanf2f07812004-08-29 08:19:32 +00003456 BuildMI(*MBB, IP, PPC::FSUB, 2, TmpReg).addReg(UseChoice).addReg(Border);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003457 // Use difference if >= 2**31
Nate Begemanf2f07812004-08-29 08:19:32 +00003458 BuildMI(*MBB, IP, PPC::FCMPU, 2, PPC::CR0).addReg(UseChoice)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003459 .addReg(Border);
Nate Begemanf2f07812004-08-29 08:19:32 +00003460 BuildMI(*MBB, IP, PPC::FSEL, 3, TmpReg2).addReg(TmpReg).addReg(TmpReg)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003461 .addReg(UseChoice);
3462 // Convert to integer
Nate Begemanf2f07812004-08-29 08:19:32 +00003463 BuildMI(*MBB, IP, PPC::FCTIWZ, 1, ConvReg).addReg(TmpReg2);
3464 addFrameReference(BuildMI(*MBB, IP, PPC::STFD, 3).addReg(ConvReg),
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003465 FrameIdx);
Misha Brukmanb097f212004-07-26 18:13:24 +00003466 if (DestClass == cByte) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003467 addFrameReference(BuildMI(*MBB, IP, PPC::LBZ, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003468 FrameIdx, 7);
3469 } else if (DestClass == cShort) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003470 addFrameReference(BuildMI(*MBB, IP, PPC::LHZ, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003471 FrameIdx, 6);
3472 } if (DestClass == cInt) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003473 addFrameReference(BuildMI(*MBB, IP, PPC::LWZ, 2, IntTmp),
Misha Brukmanb097f212004-07-26 18:13:24 +00003474 FrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003475 BuildMI(*MBB, IP, PPC::BLT, 2).addReg(PPC::CR0).addMBB(PhiMBB);
3476 BuildMI(*MBB, IP, PPC::B, 1).addMBB(XorMBB);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003477
Misha Brukmanb097f212004-07-26 18:13:24 +00003478 // XorMBB:
3479 // add 2**31 if input was >= 2**31
3480 BB = XorMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00003481 BuildMI(BB, PPC::XORIS, 2, XorReg).addReg(IntTmp).addImm(0x8000);
Misha Brukmanb097f212004-07-26 18:13:24 +00003482 XorMBB->addSuccessor(PhiMBB);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003483
Misha Brukmanb097f212004-07-26 18:13:24 +00003484 // PhiMBB:
3485 // DestReg = phi [ IntTmp, OldMBB ], [ XorReg, XorMBB ]
3486 BB = PhiMBB;
Misha Brukmand2cbb872004-08-19 21:00:12 +00003487 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(IntTmp).addMBB(OldMBB)
Misha Brukmanb097f212004-07-26 18:13:24 +00003488 .addReg(XorReg).addMBB(XorMBB);
3489 }
3490 }
3491 return;
3492 }
3493
3494 // Check our invariants
3495 assert((SrcClass <= cInt || SrcClass == cLong) &&
3496 "Unhandled source class for cast operation!");
3497 assert((DestClass <= cInt || DestClass == cLong) &&
3498 "Unhandled destination class for cast operation!");
3499
3500 bool sourceUnsigned = SrcTy->isUnsigned() || SrcTy == Type::BoolTy;
3501 bool destUnsigned = DestTy->isUnsigned();
3502
3503 // Unsigned -> Unsigned, clear if larger,
3504 if (sourceUnsigned && destUnsigned) {
3505 // handle long dest class now to keep switch clean
3506 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003507 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
3508 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3509 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003510 return;
3511 }
3512
3513 // handle u{ byte, short, int } x u{ byte, short, int }
3514 unsigned clearBits = (SrcClass == cByte || DestClass == cByte) ? 24 : 16;
3515 switch (SrcClass) {
3516 case cByte:
3517 case cShort:
Nate Begeman8531f6f2004-11-19 02:06:40 +00003518 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
3519 .addImm(0).addImm(clearBits).addImm(31);
Misha Brukmanb097f212004-07-26 18:13:24 +00003520 break;
3521 case cLong:
3522 ++SrcReg;
3523 // Fall through
3524 case cInt:
Nate Begeman8531f6f2004-11-19 02:06:40 +00003525 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
3526 .addImm(0).addImm(clearBits).addImm(31);
Misha Brukmanb097f212004-07-26 18:13:24 +00003527 break;
3528 }
3529 return;
3530 }
3531
3532 // Signed -> Signed
3533 if (!sourceUnsigned && !destUnsigned) {
3534 // handle long dest class now to keep switch clean
3535 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003536 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg).addImm(31);
3537 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3538 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003539 return;
3540 }
3541
3542 // handle { byte, short, int } x { byte, short, int }
3543 switch (SrcClass) {
3544 case cByte:
Nate Begeman01136382004-11-18 04:56:53 +00003545 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003546 break;
3547 case cShort:
3548 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003549 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003550 else
Misha Brukman5b570812004-08-10 22:47:03 +00003551 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003552 break;
3553 case cLong:
3554 ++SrcReg;
3555 // Fall through
3556 case cInt:
3557 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003558 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003559 else if (DestClass == cShort)
Misha Brukman5b570812004-08-10 22:47:03 +00003560 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003561 else
Misha Brukman5b570812004-08-10 22:47:03 +00003562 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003563 break;
3564 }
3565 return;
3566 }
3567
3568 // Unsigned -> Signed
3569 if (sourceUnsigned && !destUnsigned) {
3570 // handle long dest class now to keep switch clean
3571 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003572 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
3573 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3574 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003575 return;
3576 }
3577
3578 // handle u{ byte, short, int } -> { byte, short, int }
3579 switch (SrcClass) {
3580 case cByte:
Nate Begeman01136382004-11-18 04:56:53 +00003581 // uByte 255 -> signed short/int == 255
3582 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(0)
3583 .addImm(24).addImm(31);
Misha Brukmanb097f212004-07-26 18:13:24 +00003584 break;
3585 case cShort:
3586 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003587 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003588 else
Misha Brukman5b570812004-08-10 22:47:03 +00003589 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(0)
Misha Brukmanb097f212004-07-26 18:13:24 +00003590 .addImm(16).addImm(31);
3591 break;
3592 case cLong:
3593 ++SrcReg;
3594 // Fall through
3595 case cInt:
3596 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003597 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003598 else if (DestClass == cShort)
Misha Brukman5b570812004-08-10 22:47:03 +00003599 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003600 else
Misha Brukman5b570812004-08-10 22:47:03 +00003601 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003602 break;
3603 }
3604 return;
3605 }
3606
3607 // Signed -> Unsigned
3608 if (!sourceUnsigned && destUnsigned) {
3609 // handle long dest class now to keep switch clean
3610 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003611 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg).addImm(31);
3612 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3613 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003614 return;
3615 }
3616
3617 // handle { byte, short, int } -> u{ byte, short, int }
3618 unsigned clearBits = (DestClass == cByte) ? 24 : 16;
3619 switch (SrcClass) {
3620 case cByte:
Nate Begeman01136382004-11-18 04:56:53 +00003621 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
3622 break;
Misha Brukmanb097f212004-07-26 18:13:24 +00003623 case cShort:
Nate Begeman01136382004-11-18 04:56:53 +00003624 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003625 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003626 .addImm(0).addImm(clearBits).addImm(31);
3627 else
Nate Begeman01136382004-11-18 04:56:53 +00003628 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003629 break;
3630 case cLong:
3631 ++SrcReg;
3632 // Fall through
3633 case cInt:
3634 if (DestClass == cInt)
Misha Brukman5b570812004-08-10 22:47:03 +00003635 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003636 else
Misha Brukman5b570812004-08-10 22:47:03 +00003637 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003638 .addImm(0).addImm(clearBits).addImm(31);
3639 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00003640 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003641 return;
3642 }
3643
3644 // Anything we haven't handled already, we can't (yet) handle at all.
Misha Brukmanb097f212004-07-26 18:13:24 +00003645 std::cerr << "Unhandled cast from " << SrcTy->getDescription()
3646 << "to " << DestTy->getDescription() << '\n';
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003647 abort();
3648}
3649
3650/// visitVANextInst - Implement the va_next instruction...
3651///
Misha Brukmana1dca552004-09-21 18:22:19 +00003652void PPC32ISel::visitVANextInst(VANextInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003653 unsigned VAList = getReg(I.getOperand(0));
3654 unsigned DestReg = getReg(I);
3655
3656 unsigned Size;
Misha Brukman358829f2004-06-21 17:25:55 +00003657 switch (I.getArgType()->getTypeID()) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003658 default:
3659 std::cerr << I;
3660 assert(0 && "Error: bad type for va_next instruction!");
3661 return;
3662 case Type::PointerTyID:
3663 case Type::UIntTyID:
3664 case Type::IntTyID:
3665 Size = 4;
3666 break;
3667 case Type::ULongTyID:
3668 case Type::LongTyID:
3669 case Type::DoubleTyID:
3670 Size = 8;
3671 break;
3672 }
3673
3674 // Increment the VAList pointer...
Misha Brukman5b570812004-08-10 22:47:03 +00003675 BuildMI(BB, PPC::ADDI, 2, DestReg).addReg(VAList).addSImm(Size);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003676}
3677
Misha Brukmana1dca552004-09-21 18:22:19 +00003678void PPC32ISel::visitVAArgInst(VAArgInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003679 unsigned VAList = getReg(I.getOperand(0));
3680 unsigned DestReg = getReg(I);
3681
Misha Brukman358829f2004-06-21 17:25:55 +00003682 switch (I.getType()->getTypeID()) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003683 default:
3684 std::cerr << I;
3685 assert(0 && "Error: bad type for va_next instruction!");
3686 return;
3687 case Type::PointerTyID:
3688 case Type::UIntTyID:
3689 case Type::IntTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003690 BuildMI(BB, PPC::LWZ, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003691 break;
3692 case Type::ULongTyID:
3693 case Type::LongTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003694 BuildMI(BB, PPC::LWZ, 2, DestReg).addSImm(0).addReg(VAList);
3695 BuildMI(BB, PPC::LWZ, 2, DestReg+1).addSImm(4).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003696 break;
Misha Brukmanb097f212004-07-26 18:13:24 +00003697 case Type::FloatTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003698 BuildMI(BB, PPC::LFS, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukmanb097f212004-07-26 18:13:24 +00003699 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003700 case Type::DoubleTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003701 BuildMI(BB, PPC::LFD, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003702 break;
3703 }
3704}
3705
3706/// visitGetElementPtrInst - instruction-select GEP instructions
3707///
Misha Brukmana1dca552004-09-21 18:22:19 +00003708void PPC32ISel::visitGetElementPtrInst(GetElementPtrInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003709 if (canFoldGEPIntoLoadOrStore(&I))
3710 return;
3711
Nate Begeman645495d2004-09-23 05:31:33 +00003712 emitGEPOperation(BB, BB->end(), &I, false);
3713}
3714
Misha Brukman1013ef52004-07-21 20:09:08 +00003715/// emitGEPOperation - Common code shared between visitGetElementPtrInst and
3716/// constant expression GEP support.
3717///
Misha Brukmana1dca552004-09-21 18:22:19 +00003718void PPC32ISel::emitGEPOperation(MachineBasicBlock *MBB,
3719 MachineBasicBlock::iterator IP,
Nate Begeman645495d2004-09-23 05:31:33 +00003720 GetElementPtrInst *GEPI, bool GEPIsFolded) {
3721 // If we've already emitted this particular GEP, just return to avoid
3722 // multiple definitions of the base register.
Nate Begemana41fc772004-09-29 02:35:05 +00003723 if (GEPIsFolded && (GEPMap[GEPI].base != 0))
Nate Begeman645495d2004-09-23 05:31:33 +00003724 return;
Nate Begeman645495d2004-09-23 05:31:33 +00003725
3726 Value *Src = GEPI->getOperand(0);
3727 User::op_iterator IdxBegin = GEPI->op_begin()+1;
3728 User::op_iterator IdxEnd = GEPI->op_end();
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003729 const TargetData &TD = TM.getTargetData();
3730 const Type *Ty = Src->getType();
Misha Brukmane2eceb52004-07-23 16:08:20 +00003731 int64_t constValue = 0;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003732
3733 // Record the operations to emit the GEP in a vector so that we can emit them
3734 // after having analyzed the entire instruction.
Misha Brukmanb097f212004-07-26 18:13:24 +00003735 std::vector<CollapsedGepOp> ops;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003736
Misha Brukman1013ef52004-07-21 20:09:08 +00003737 // GEPs have zero or more indices; we must perform a struct access
3738 // or array access for each one.
3739 for (GetElementPtrInst::op_iterator oi = IdxBegin, oe = IdxEnd; oi != oe;
3740 ++oi) {
3741 Value *idx = *oi;
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003742 if (const StructType *StTy = dyn_cast<StructType>(Ty)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00003743 // It's a struct access. idx is the index into the structure,
3744 // which names the field. Use the TargetData structure to
3745 // pick out what the layout of the structure is in memory.
3746 // Use the (constant) structure index's value to find the
3747 // right byte offset from the StructLayout class's list of
3748 // structure member offsets.
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003749 unsigned fieldIndex = cast<ConstantUInt>(idx)->getValue();
Misha Brukmane2eceb52004-07-23 16:08:20 +00003750
3751 // StructType member offsets are always constant values. Add it to the
3752 // running total.
Nate Begeman645495d2004-09-23 05:31:33 +00003753 constValue += TD.getStructLayout(StTy)->MemberOffsets[fieldIndex];
Misha Brukmane2eceb52004-07-23 16:08:20 +00003754
Nate Begeman645495d2004-09-23 05:31:33 +00003755 // The next type is the member of the structure selected by the index.
Misha Brukmane2eceb52004-07-23 16:08:20 +00003756 Ty = StTy->getElementType (fieldIndex);
Nate Begeman645495d2004-09-23 05:31:33 +00003757 } else if (const SequentialType *SqTy = dyn_cast<SequentialType>(Ty)) {
Misha Brukman313efcb2004-07-09 15:45:07 +00003758 // Many GEP instructions use a [cast (int/uint) to LongTy] as their
3759 // operand. Handle this case directly now...
3760 if (CastInst *CI = dyn_cast<CastInst>(idx))
3761 if (CI->getOperand(0)->getType() == Type::IntTy ||
3762 CI->getOperand(0)->getType() == Type::UIntTy)
3763 idx = CI->getOperand(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00003764
Misha Brukmane2eceb52004-07-23 16:08:20 +00003765 // It's an array or pointer access: [ArraySize x ElementType].
3766 // We want to add basePtrReg to (idxReg * sizeof ElementType). First, we
3767 // must find the size of the pointed-to type (Not coincidentally, the next
3768 // type is the type of the elements in the array).
Misha Brukman1013ef52004-07-21 20:09:08 +00003769 Ty = SqTy->getElementType();
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003770 unsigned elementSize = TD.getTypeSize(Ty);
Misha Brukman1013ef52004-07-21 20:09:08 +00003771
Misha Brukmane2eceb52004-07-23 16:08:20 +00003772 if (ConstantInt *C = dyn_cast<ConstantInt>(idx)) {
Misha Brukmane2eceb52004-07-23 16:08:20 +00003773 if (ConstantSInt *CS = dyn_cast<ConstantSInt>(C))
3774 constValue += CS->getValue() * elementSize;
3775 else if (ConstantUInt *CU = dyn_cast<ConstantUInt>(C))
3776 constValue += CU->getValue() * elementSize;
3777 else
3778 assert(0 && "Invalid ConstantInt GEP index type!");
3779 } else {
Nate Begeman645495d2004-09-23 05:31:33 +00003780 // Push current gep state to this point as an add and multiply
3781 ops.push_back(CollapsedGepOp(
3782 ConstantSInt::get(Type::IntTy, constValue),
3783 idx, ConstantUInt::get(Type::UIntTy, elementSize)));
3784
Misha Brukmane2eceb52004-07-23 16:08:20 +00003785 constValue = 0;
Misha Brukman313efcb2004-07-09 15:45:07 +00003786 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003787 }
Misha Brukmane2eceb52004-07-23 16:08:20 +00003788 }
Misha Brukmane2eceb52004-07-23 16:08:20 +00003789 // Emit instructions for all the collapsed ops
Nate Begeman645495d2004-09-23 05:31:33 +00003790 unsigned indexReg = 0;
Misha Brukmanb097f212004-07-26 18:13:24 +00003791 for(std::vector<CollapsedGepOp>::iterator cgo_i = ops.begin(),
Misha Brukmane2eceb52004-07-23 16:08:20 +00003792 cgo_e = ops.end(); cgo_i != cgo_e; ++cgo_i) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003793 CollapsedGepOp& cgo = *cgo_i;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003794
Nate Begeman8531f6f2004-11-19 02:06:40 +00003795 // Avoid emitting known move instructions here for the register allocator
3796 // to deal with later. val * 1 == val. val + 0 == val.
3797 unsigned TmpReg1;
3798 if (cgo.size->getValue() == 1) {
3799 TmpReg1 = getReg(cgo.index, MBB, IP);
3800 } else {
3801 TmpReg1 = makeAnotherReg(Type::IntTy);
3802 doMultiplyConst(MBB, IP, TmpReg1, cgo.index, cgo.size);
3803 }
3804
3805 unsigned TmpReg2;
3806 if (cgo.offset->isNullValue()) {
3807 TmpReg2 = TmpReg1;
3808 } else {
3809 TmpReg2 = makeAnotherReg(Type::IntTy);
3810 emitBinaryConstOperation(MBB, IP, TmpReg1, cgo.offset, 0, TmpReg2);
3811 }
Nate Begeman645495d2004-09-23 05:31:33 +00003812
3813 if (indexReg == 0)
3814 indexReg = TmpReg2;
3815 else {
3816 unsigned TmpReg3 = makeAnotherReg(Type::IntTy);
3817 BuildMI(*MBB, IP, PPC::ADD, 2, TmpReg3).addReg(indexReg).addReg(TmpReg2);
3818 indexReg = TmpReg3;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003819 }
Misha Brukman2fec9902004-06-21 20:22:03 +00003820 }
Nate Begeman645495d2004-09-23 05:31:33 +00003821
3822 // We now have a base register, an index register, and possibly a constant
3823 // remainder. If the GEP is going to be folded, we try to generate the
3824 // optimal addressing mode.
Misha Brukmane2eceb52004-07-23 16:08:20 +00003825 ConstantSInt *remainder = ConstantSInt::get(Type::IntTy, constValue);
3826
Misha Brukmanb097f212004-07-26 18:13:24 +00003827 // If we are emitting this during a fold, copy the current base register to
3828 // the target, and save the current constant offset so the folding load or
3829 // store can try and use it as an immediate.
3830 if (GEPIsFolded) {
Nate Begeman645495d2004-09-23 05:31:33 +00003831 if (indexReg == 0) {
Nate Begemanb816f022004-10-07 22:30:03 +00003832 if (!canUseAsImmediateForOpcode(remainder, 0, false)) {
Nate Begeman645495d2004-09-23 05:31:33 +00003833 indexReg = getReg(remainder, MBB, IP);
3834 remainder = 0;
Nate Begemanb64af912004-08-10 20:42:36 +00003835 }
Nate Begemanbc3a5372004-11-19 08:01:16 +00003836 } else if (!remainder->isNullValue()) {
Nate Begeman645495d2004-09-23 05:31:33 +00003837 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Nate Begemanb816f022004-10-07 22:30:03 +00003838 emitBinaryConstOperation(MBB, IP, indexReg, remainder, 0, TmpReg);
Nate Begeman645495d2004-09-23 05:31:33 +00003839 indexReg = TmpReg;
3840 remainder = 0;
Nate Begemanb64af912004-08-10 20:42:36 +00003841 }
Nate Begemandb869aa2004-11-18 07:22:46 +00003842 unsigned basePtrReg = getReg(Src, MBB, IP);
3843 GEPMap[GEPI] = FoldedGEP(basePtrReg, indexReg, remainder);
Misha Brukmanb097f212004-07-26 18:13:24 +00003844 return;
3845 }
Nate Begemanb64af912004-08-10 20:42:36 +00003846
Nate Begeman645495d2004-09-23 05:31:33 +00003847 // We're not folding, so collapse the base, index, and any remainder into the
3848 // destination register.
Nate Begemandb869aa2004-11-18 07:22:46 +00003849 unsigned TargetReg = getReg(GEPI, MBB, IP);
3850 unsigned basePtrReg = getReg(Src, MBB, IP);
Nate Begemanbc3a5372004-11-19 08:01:16 +00003851
Nate Begeman486ebfd2004-11-21 05:14:06 +00003852 if ((indexReg == 0) && remainder->isNullValue()) {
3853 BuildMI(*MBB, IP, PPC::OR, 2, TargetReg).addReg(basePtrReg)
3854 .addReg(basePtrReg);
3855 return;
3856 }
Nate Begemanbc3a5372004-11-19 08:01:16 +00003857 if (!remainder->isNullValue()) {
3858 unsigned TmpReg = (indexReg == 0) ? TargetReg : makeAnotherReg(Type::IntTy);
3859 emitBinaryConstOperation(MBB, IP, basePtrReg, remainder, 0, TmpReg);
Nate Begemanb64af912004-08-10 20:42:36 +00003860 basePtrReg = TmpReg;
3861 }
Nate Begeman486ebfd2004-11-21 05:14:06 +00003862 if (indexReg != 0)
Nate Begemanbc3a5372004-11-19 08:01:16 +00003863 BuildMI(*MBB, IP, PPC::ADD, 2, TargetReg).addReg(indexReg)
3864 .addReg(basePtrReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003865}
3866
3867/// visitAllocaInst - If this is a fixed size alloca, allocate space from the
3868/// frame manager, otherwise do it the hard way.
3869///
Misha Brukmana1dca552004-09-21 18:22:19 +00003870void PPC32ISel::visitAllocaInst(AllocaInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003871 // If this is a fixed size alloca in the entry block for the function, we
3872 // statically stack allocate the space, so we don't need to do anything here.
3873 //
3874 if (dyn_castFixedAlloca(&I)) return;
3875
3876 // Find the data size of the alloca inst's getAllocatedType.
3877 const Type *Ty = I.getAllocatedType();
3878 unsigned TySize = TM.getTargetData().getTypeSize(Ty);
3879
3880 // Create a register to hold the temporary result of multiplying the type size
3881 // constant by the variable amount.
3882 unsigned TotalSizeReg = makeAnotherReg(Type::UIntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003883
3884 // TotalSizeReg = mul <numelements>, <TypeSize>
3885 MachineBasicBlock::iterator MBBI = BB->end();
Misha Brukman1013ef52004-07-21 20:09:08 +00003886 ConstantUInt *CUI = ConstantUInt::get(Type::UIntTy, TySize);
3887 doMultiplyConst(BB, MBBI, TotalSizeReg, I.getArraySize(), CUI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003888
3889 // AddedSize = add <TotalSizeReg>, 15
3890 unsigned AddedSizeReg = makeAnotherReg(Type::UIntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003891 BuildMI(BB, PPC::ADDI, 2, AddedSizeReg).addReg(TotalSizeReg).addSImm(15);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003892
3893 // AlignedSize = and <AddedSize>, ~15
3894 unsigned AlignedSize = makeAnotherReg(Type::UIntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003895 BuildMI(BB, PPC::RLWINM, 4, AlignedSize).addReg(AddedSizeReg).addImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00003896 .addImm(0).addImm(27);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003897
3898 // Subtract size from stack pointer, thereby allocating some space.
Misha Brukman5b570812004-08-10 22:47:03 +00003899 BuildMI(BB, PPC::SUB, 2, PPC::R1).addReg(PPC::R1).addReg(AlignedSize);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003900
3901 // Put a pointer to the space into the result register, by copying
3902 // the stack pointer.
Misha Brukman5b570812004-08-10 22:47:03 +00003903 BuildMI(BB, PPC::OR, 2, getReg(I)).addReg(PPC::R1).addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003904
3905 // Inform the Frame Information that we have just allocated a variable-sized
3906 // object.
3907 F->getFrameInfo()->CreateVariableSizedObject();
3908}
3909
3910/// visitMallocInst - Malloc instructions are code generated into direct calls
3911/// to the library malloc.
3912///
Misha Brukmana1dca552004-09-21 18:22:19 +00003913void PPC32ISel::visitMallocInst(MallocInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003914 unsigned AllocSize = TM.getTargetData().getTypeSize(I.getAllocatedType());
3915 unsigned Arg;
3916
3917 if (ConstantUInt *C = dyn_cast<ConstantUInt>(I.getOperand(0))) {
3918 Arg = getReg(ConstantUInt::get(Type::UIntTy, C->getValue() * AllocSize));
3919 } else {
3920 Arg = makeAnotherReg(Type::UIntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003921 MachineBasicBlock::iterator MBBI = BB->end();
Misha Brukman1013ef52004-07-21 20:09:08 +00003922 ConstantUInt *CUI = ConstantUInt::get(Type::UIntTy, AllocSize);
3923 doMultiplyConst(BB, MBBI, Arg, I.getOperand(0), CUI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003924 }
3925
3926 std::vector<ValueRecord> Args;
3927 Args.push_back(ValueRecord(Arg, Type::UIntTy));
Misha Brukman2fec9902004-06-21 20:22:03 +00003928 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003929 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(mallocFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003930 doCall(ValueRecord(getReg(I), I.getType()), TheCall, Args, false);
Misha Brukmane2eceb52004-07-23 16:08:20 +00003931 TM.CalledFunctions.insert(mallocFn);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003932}
3933
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003934/// visitFreeInst - Free instructions are code gen'd to call the free libc
3935/// function.
3936///
Misha Brukmana1dca552004-09-21 18:22:19 +00003937void PPC32ISel::visitFreeInst(FreeInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003938 std::vector<ValueRecord> Args;
3939 Args.push_back(ValueRecord(I.getOperand(0)));
Misha Brukman2fec9902004-06-21 20:22:03 +00003940 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003941 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(freeFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003942 doCall(ValueRecord(0, Type::VoidTy), TheCall, Args, false);
Misha Brukmane2eceb52004-07-23 16:08:20 +00003943 TM.CalledFunctions.insert(freeFn);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003944}
3945
Misha Brukman3d9a6c22004-08-11 00:09:42 +00003946/// createPPC32ISelSimple - This pass converts an LLVM function into a machine
3947/// code representation is a very simple peep-hole fashion.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003948///
Misha Brukman3d9a6c22004-08-11 00:09:42 +00003949FunctionPass *llvm::createPPC32ISelSimple(TargetMachine &TM) {
Misha Brukmana1dca552004-09-21 18:22:19 +00003950 return new PPC32ISel(TM);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003951}