blob: bc09f1c173e37d8dbf2dff47a292b158e07edea8 [file] [log] [blame]
Misha Brukmanf2ccb772004-08-17 04:55:41 +00001//===-- PPC32ISelSimple.cpp - A simple instruction selector PowerPC32 -----===//
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002//
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003// 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.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00007//
Misha Brukman5dfe3a92004-06-21 16:55:25 +00008//===----------------------------------------------------------------------===//
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 Brukmanb5f662f2005-04-21 23:30:14 +000079
80 /// CollapsedGepOp - This struct is for recording the intermediate results
Nate Begeman645495d2004-09-23 05:31:33 +000081 /// 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
Misha Brukmanb5f662f2005-04-21 23:30:14 +000090 /// FoldedGEP - This struct is for recording the necessary information to
Nate Begeman645495d2004-09-23 05:31:33 +000091 /// 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) {}
Misha Brukmanb5f662f2005-04-21 23:30:14 +000097 FoldedGEP(unsigned b, unsigned i, ConstantSInt *o) :
Nate Begeman645495d2004-09-23 05:31:33 +000098 base(b), index(i), offset(o) {}
99 };
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000100
101 /// RlwimiRec - This struct is for recording the arguments to a PowerPC
Nate Begeman905a2912004-10-24 10:33:30 +0000102 /// rlwimi instruction to be output for a particular Instruction::Or when
103 /// we recognize the pattern for rlwimi, starting with a shift or and.
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000104 struct RlwimiRec {
Nate Begeman905a2912004-10-24 10:33:30 +0000105 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 };
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000111
Misha Brukmanc7cd5e52005-03-21 19:22:14 +0000112 // External functions we may use in compiling the Module
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000113 Function *fmodfFn, *fmodFn, *__cmpdi2Fn, *__moddi3Fn, *__divdi3Fn,
Nate Begemanb64af912004-08-10 20:42:36 +0000114 *__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;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000129
Nate Begeman1b750222004-10-17 05:19:20 +0000130 // 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;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000143
Misha Brukmana1dca552004-09-21 18:22:19 +0000144 PPC32ISel(TargetMachine &tm):TM(reinterpret_cast<PPC32TargetMachine&>(tm)),
Misha Brukmane2eceb52004-07-23 16:08:20 +0000145 F(0), BB(0) {}
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000146
Misha Brukman2834a4d2004-07-07 20:07:22 +0000147 bool doInitialization(Module &M) {
Misha Brukmanb0932592004-07-07 15:36:18 +0000148 // Add external functions that we may call
Nate Begemanb64af912004-08-10 20:42:36 +0000149 Type *i = Type::IntTy;
Misha Brukman2834a4d2004-07-07 20:07:22 +0000150 Type *d = Type::DoubleTy;
Misha Brukmanf3f63822004-07-08 19:41:16 +0000151 Type *f = Type::FloatTy;
Misha Brukman2834a4d2004-07-07 20:07:22 +0000152 Type *l = Type::LongTy;
153 Type *ul = Type::ULongTy;
Misha Brukman313efcb2004-07-09 15:45:07 +0000154 Type *voidPtr = PointerType::get(Type::SByteTy);
Misha Brukman7e898c32004-07-20 00:41:46 +0000155 // float fmodf(float, float);
156 fmodfFn = M.getOrInsertFunction("fmodf", f, f, f, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000157 // double fmod(double, double);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000158 fmodFn = M.getOrInsertFunction("fmod", d, d, d, 0);
Nate Begemanb64af912004-08-10 20:42:36 +0000159 // int __cmpdi2(long, long);
160 __cmpdi2Fn = M.getOrInsertFunction("__cmpdi2", i, l, l, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000161 // long __moddi3(long, long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000162 __moddi3Fn = M.getOrInsertFunction("__moddi3", l, l, l, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000163 // long __divdi3(long, long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000164 __divdi3Fn = M.getOrInsertFunction("__divdi3", l, l, l, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000165 // unsigned long __umoddi3(unsigned long, unsigned long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000166 __umoddi3Fn = M.getOrInsertFunction("__umoddi3", ul, ul, ul, 0);
Misha Brukman2834a4d2004-07-07 20:07:22 +0000167 // unsigned long __udivdi3(unsigned long, unsigned long);
Misha Brukman0aa97c62004-07-08 18:27:59 +0000168 __udivdi3Fn = M.getOrInsertFunction("__udivdi3", ul, ul, ul, 0);
Misha Brukman7e898c32004-07-20 00:41:46 +0000169 // long __fixsfdi(float)
Nate Begemanb64af912004-08-10 20:42:36 +0000170 __fixsfdiFn = M.getOrInsertFunction("__fixsfdi", l, f, 0);
Misha Brukmanf3f63822004-07-08 19:41:16 +0000171 // long __fixdfdi(double)
172 __fixdfdiFn = M.getOrInsertFunction("__fixdfdi", l, d, 0);
Nate Begemanb64af912004-08-10 20:42:36 +0000173 // unsigned long __fixunssfdi(float)
174 __fixunssfdiFn = M.getOrInsertFunction("__fixunssfdi", ul, f, 0);
175 // unsigned long __fixunsdfdi(double)
176 __fixunsdfdiFn = M.getOrInsertFunction("__fixunsdfdi", ul, d, 0);
Misha Brukmanf3f63822004-07-08 19:41:16 +0000177 // float __floatdisf(long)
178 __floatdisfFn = M.getOrInsertFunction("__floatdisf", f, l, 0);
179 // double __floatdidf(long)
180 __floatdidfFn = M.getOrInsertFunction("__floatdidf", d, l, 0);
Misha Brukman313efcb2004-07-09 15:45:07 +0000181 // void* malloc(size_t)
182 mallocFn = M.getOrInsertFunction("malloc", voidPtr, Type::UIntTy, 0);
183 // void free(void*)
184 freeFn = M.getOrInsertFunction("free", Type::VoidTy, voidPtr, 0);
Misha Brukmanc7cd5e52005-03-21 19:22:14 +0000185 return true;
Misha Brukman2834a4d2004-07-07 20:07:22 +0000186 }
Misha Brukmand18a31d2004-07-06 22:51:53 +0000187
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000188 /// runOnFunction - Top level implementation of instruction selection for
189 /// the entire function.
190 ///
191 bool runOnFunction(Function &Fn) {
192 // First pass over the function, lower any unknown intrinsic functions
193 // with the IntrinsicLowering class.
194 LowerUnknownIntrinsicFunctionCalls(Fn);
195
196 F = &MachineFunction::construct(&Fn, TM);
197
198 // Create all of the machine basic blocks for the function...
199 for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I)
200 F->getBasicBlockList().push_back(MBBMap[I] = new MachineBasicBlock(I));
201
202 BB = &F->front();
203
Misha Brukmanb097f212004-07-26 18:13:24 +0000204 // Make sure we re-emit a set of the global base reg if necessary
205 GlobalBaseInitialized = false;
206
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000207 // Copy incoming arguments off of the stack...
208 LoadArgumentsToVirtualRegs(Fn);
209
210 // Instruction select everything except PHI nodes
211 visit(Fn);
212
213 // Select the PHI nodes
214 SelectPHINodes();
215
Nate Begeman645495d2004-09-23 05:31:33 +0000216 GEPMap.clear();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000217 RegMap.clear();
218 MBBMap.clear();
Nate Begeman905a2912004-10-24 10:33:30 +0000219 InsertMap.clear();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000220 AllocaMap.clear();
Nate Begeman1b750222004-10-17 05:19:20 +0000221 SkipList.clear();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000222 F = 0;
223 // We always build a machine code representation for the function
224 return true;
225 }
226
227 virtual const char *getPassName() const {
228 return "PowerPC Simple Instruction Selection";
229 }
230
231 /// visitBasicBlock - This method is called when we are visiting a new basic
232 /// block. This simply creates a new MachineBasicBlock to emit code into
233 /// and adds it to the current MachineFunction. Subsequent visit* for
234 /// instructions will be invoked for all instructions in the basic block.
235 ///
236 void visitBasicBlock(BasicBlock &LLVM_BB) {
237 BB = MBBMap[&LLVM_BB];
238 }
239
240 /// LowerUnknownIntrinsicFunctionCalls - This performs a prepass over the
241 /// function, lowering any calls to unknown intrinsic functions into the
242 /// equivalent LLVM code.
243 ///
244 void LowerUnknownIntrinsicFunctionCalls(Function &F);
245
246 /// LoadArgumentsToVirtualRegs - Load all of the arguments to this function
247 /// from the stack into virtual registers.
248 ///
249 void LoadArgumentsToVirtualRegs(Function &F);
250
251 /// SelectPHINodes - Insert machine code to generate phis. This is tricky
252 /// because we have to generate our sources into the source basic blocks,
253 /// not the current one.
254 ///
255 void SelectPHINodes();
256
257 // Visitation methods for various instructions. These methods simply emit
258 // fixed PowerPC code for each instruction.
259
Chris Lattner289a49a2004-10-16 18:13:47 +0000260 // Control flow operators.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000261 void visitReturnInst(ReturnInst &RI);
262 void visitBranchInst(BranchInst &BI);
Chris Lattner289a49a2004-10-16 18:13:47 +0000263 void visitUnreachableInst(UnreachableInst &UI) {}
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000264
265 struct ValueRecord {
266 Value *Val;
267 unsigned Reg;
268 const Type *Ty;
269 ValueRecord(unsigned R, const Type *T) : Val(0), Reg(R), Ty(T) {}
270 ValueRecord(Value *V) : Val(V), Reg(0), Ty(V->getType()) {}
271 };
Misha Brukmanb097f212004-07-26 18:13:24 +0000272
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000273 void doCall(const ValueRecord &Ret, MachineInstr *CallMI,
Misha Brukmand18a31d2004-07-06 22:51:53 +0000274 const std::vector<ValueRecord> &Args, bool isVarArg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000275 void visitCallInst(CallInst &I);
276 void visitIntrinsicCall(Intrinsic::ID ID, CallInst &I);
277
278 // Arithmetic operators
279 void visitSimpleBinary(BinaryOperator &B, unsigned OpcodeClass);
280 void visitAdd(BinaryOperator &B) { visitSimpleBinary(B, 0); }
281 void visitSub(BinaryOperator &B) { visitSimpleBinary(B, 1); }
282 void visitMul(BinaryOperator &B);
283
284 void visitDiv(BinaryOperator &B) { visitDivRem(B); }
285 void visitRem(BinaryOperator &B) { visitDivRem(B); }
286 void visitDivRem(BinaryOperator &B);
287
288 // Bitwise operators
289 void visitAnd(BinaryOperator &B) { visitSimpleBinary(B, 2); }
290 void visitOr (BinaryOperator &B) { visitSimpleBinary(B, 3); }
291 void visitXor(BinaryOperator &B) { visitSimpleBinary(B, 4); }
292
293 // Comparison operators...
294 void visitSetCondInst(SetCondInst &I);
Chris Lattner51d2ed92005-04-10 01:03:31 +0000295 void EmitComparison(unsigned OpNum, Value *Op0, Value *Op1,
296 MachineBasicBlock *MBB,
297 MachineBasicBlock::iterator MBBI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000298 void visitSelectInst(SelectInst &SI);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000299
300
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000301 // 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);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000308
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000309 // 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);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000345
Nate Begeman905a2912004-10-24 10:33:30 +0000346 /// emitBitfieldExtract - return true if we were able to fold the sequence
347 /// of instructions into a bitfield extract (rlwinm).
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000348 bool emitBitfieldExtract(MachineBasicBlock *MBB,
Nate Begeman905a2912004-10-24 10:33:30 +0000349 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 ///
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000356 void emitBinaryConstOperation(MachineBasicBlock *MBB,
Nate Begemanb816f022004-10-07 22:30:03 +0000357 MachineBasicBlock::iterator IP,
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000358 unsigned Op0Reg, ConstantInt *Op1,
Nate Begemanb816f022004-10-07 22:30:03 +0000359 unsigned Opcode, unsigned DestReg);
360
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000361 /// emitSimpleBinaryOperation - Implement simple binary operators for
362 /// integral types. OperatorClass is one of: 0 for Add, 1 for Sub,
Nate Begemanb816f022004-10-07 22:30:03 +0000363 /// 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);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000383
Misha Brukman1013ef52004-07-21 20:09:08 +0000384 /// doMultiplyConst - This method will multiply the value in Op0Reg by the
385 /// value of the ContantInt *CI
Misha Brukmanb5f662f2005-04-21 23:30:14 +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,
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000409 const Type *ResultTy, ShiftInst *SI,
Nate Begeman9b508c32004-10-26 03:48:25 +0000410 unsigned DestReg);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000411
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000412 /// emitSelectOperation - Common code shared between visitSelectInst and the
413 /// constant expression support.
Misha Brukmanb097f212004-07-26 18:13:24 +0000414 ///
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000415 void emitSelectOperation(MachineBasicBlock *MBB,
416 MachineBasicBlock::iterator IP,
417 Value *Cond, Value *TrueVal, Value *FalseVal,
418 unsigned DestReg);
419
Nate Begeman1f5308e2004-11-18 06:51:29 +0000420 /// getGlobalBaseReg - Output the instructions required to put the
421 /// base address to use for accessing globals into a register. Returns the
422 /// register containing the base address.
Misha Brukmanb097f212004-07-26 18:13:24 +0000423 ///
Nate Begeman5e966612005-03-24 06:28:42 +0000424 unsigned getGlobalBaseReg();
Misha Brukmanb097f212004-07-26 18:13:24 +0000425
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000426 /// copyConstantToRegister - Output the instructions required to put the
427 /// specified constant into the specified register.
428 ///
429 void copyConstantToRegister(MachineBasicBlock *MBB,
430 MachineBasicBlock::iterator MBBI,
431 Constant *C, unsigned Reg);
432
433 void emitUCOM(MachineBasicBlock *MBB, MachineBasicBlock::iterator MBBI,
434 unsigned LHS, unsigned RHS);
435
436 /// makeAnotherReg - This method returns the next register number we haven't
437 /// yet used.
438 ///
439 /// Long values are handled somewhat specially. They are always allocated
440 /// as pairs of 32 bit integer values. The register number returned is the
Misha Brukman1013ef52004-07-21 20:09:08 +0000441 /// high 32 bits of the long value, and the regNum+1 is the low 32 bits.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000442 ///
443 unsigned makeAnotherReg(const Type *Ty) {
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000444 assert(dynamic_cast<const PPC32RegisterInfo*>(TM.getRegisterInfo()) &&
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000445 "Current target doesn't have PPC reg info??");
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000446 const PPC32RegisterInfo *PPCRI =
447 static_cast<const PPC32RegisterInfo*>(TM.getRegisterInfo());
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000448 if (Ty == Type::LongTy || Ty == Type::ULongTy) {
Nate Begemanb64af912004-08-10 20:42:36 +0000449 const TargetRegisterClass *RC = PPCRI->getRegClassForType(Type::IntTy);
450 // Create the upper part
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000451 F->getSSARegMap()->createVirtualRegister(RC);
Nate Begemanb64af912004-08-10 20:42:36 +0000452 // Create the lower part.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000453 return F->getSSARegMap()->createVirtualRegister(RC)-1;
454 }
455
456 // Add the mapping of regnumber => reg class to MachineFunction
Nate Begemanb64af912004-08-10 20:42:36 +0000457 const TargetRegisterClass *RC = PPCRI->getRegClassForType(Ty);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000458 return F->getSSARegMap()->createVirtualRegister(RC);
459 }
460
461 /// getReg - This method turns an LLVM value into a register number.
462 ///
463 unsigned getReg(Value &V) { return getReg(&V); } // Allow references
464 unsigned getReg(Value *V) {
465 // Just append to the end of the current bb.
466 MachineBasicBlock::iterator It = BB->end();
467 return getReg(V, BB, It);
468 }
469 unsigned getReg(Value *V, MachineBasicBlock *MBB,
470 MachineBasicBlock::iterator IPt);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000471
Misha Brukman1013ef52004-07-21 20:09:08 +0000472 /// canUseAsImmediateForOpcode - This method returns whether a ConstantInt
473 /// is okay to use as an immediate argument to a certain binary operation
Nate Begemanb816f022004-10-07 22:30:03 +0000474 bool canUseAsImmediateForOpcode(ConstantInt *CI, unsigned Opcode,
475 bool Shifted);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000476
477 /// getFixedSizedAllocaFI - Return the frame index for a fixed sized alloca
478 /// that is to be statically allocated with the initial stack frame
479 /// adjustment.
480 unsigned getFixedSizedAllocaFI(AllocaInst *AI);
481 };
482}
483
484/// dyn_castFixedAlloca - If the specified value is a fixed size alloca
485/// instruction in the entry block, return it. Otherwise, return a null
486/// pointer.
487static AllocaInst *dyn_castFixedAlloca(Value *V) {
488 if (AllocaInst *AI = dyn_cast<AllocaInst>(V)) {
489 BasicBlock *BB = AI->getParent();
490 if (isa<ConstantUInt>(AI->getArraySize()) && BB ==&BB->getParent()->front())
491 return AI;
492 }
493 return 0;
494}
495
496/// getReg - This method turns an LLVM value into a register number.
497///
Misha Brukmana1dca552004-09-21 18:22:19 +0000498unsigned PPC32ISel::getReg(Value *V, MachineBasicBlock *MBB,
499 MachineBasicBlock::iterator IPt) {
Misha Brukmanba1c1da2004-07-20 00:59:38 +0000500 if (Constant *C = dyn_cast<Constant>(V)) {
Chris Lattnera51e4f62004-07-18 18:45:01 +0000501 unsigned Reg = makeAnotherReg(V->getType());
502 copyConstantToRegister(MBB, IPt, C, Reg);
503 return Reg;
Nate Begeman676dee62004-11-08 02:25:40 +0000504 } else if (CastInst *CI = dyn_cast<CastInst>(V)) {
505 // Do not emit noop casts at all, unless it's a double -> float cast.
506 if (getClassB(CI->getType()) == getClassB(CI->getOperand(0)->getType()))
507 return getReg(CI->getOperand(0), MBB, IPt);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000508 } else if (AllocaInst *AI = dyn_castFixedAlloca(V)) {
509 unsigned Reg = makeAnotherReg(V->getType());
510 unsigned FI = getFixedSizedAllocaFI(AI);
Misha Brukman5b570812004-08-10 22:47:03 +0000511 addFrameReference(BuildMI(*MBB, IPt, PPC::ADDI, 2, Reg), FI, 0, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000512 return Reg;
513 }
514
515 unsigned &Reg = RegMap[V];
516 if (Reg == 0) {
517 Reg = makeAnotherReg(V->getType());
518 RegMap[V] = Reg;
519 }
520
521 return Reg;
522}
523
Misha Brukman1013ef52004-07-21 20:09:08 +0000524/// canUseAsImmediateForOpcode - This method returns whether a ConstantInt
525/// is okay to use as an immediate argument to a certain binary operator.
Nate Begemanb816f022004-10-07 22:30:03 +0000526/// The shifted argument determines if the immediate is suitable to be used with
527/// the PowerPC instructions such as addis which concatenate 16 bits of the
528/// immediate with 16 bits of zeroes.
Misha Brukman1013ef52004-07-21 20:09:08 +0000529///
Nate Begemanb816f022004-10-07 22:30:03 +0000530bool PPC32ISel::canUseAsImmediateForOpcode(ConstantInt *CI, unsigned Opcode,
531 bool Shifted) {
Misha Brukman1013ef52004-07-21 20:09:08 +0000532 ConstantSInt *Op1Cs;
533 ConstantUInt *Op1Cu;
Nate Begemanb816f022004-10-07 22:30:03 +0000534
535 // For shifted immediates, any value with the low halfword cleared may be used
536 if (Shifted) {
Nate Begemanbdf69842004-10-08 02:49:24 +0000537 if (((int32_t)CI->getRawValue() & 0x0000FFFF) == 0)
Nate Begemanb816f022004-10-07 22:30:03 +0000538 return true;
Nate Begemanbdf69842004-10-08 02:49:24 +0000539 else
540 return false;
Nate Begemanb816f022004-10-07 22:30:03 +0000541 }
Nate Begeman28dd2fc2004-11-04 19:43:18 +0000542
543 // Treat subfic like addi for the purposes of constant validation
544 if (Opcode == 5) Opcode = 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000545
Nate Begeman28dd2fc2004-11-04 19:43:18 +0000546 // addi, subfic, compare, and non-indexed load take SIMM
Nate Begemanb816f022004-10-07 22:30:03 +0000547 bool cond1 = (Opcode < 2)
Nate Begemana41fc772004-09-29 02:35:05 +0000548 && ((int32_t)CI->getRawValue() <= 32767)
549 && ((int32_t)CI->getRawValue() >= -32768);
Misha Brukman1013ef52004-07-21 20:09:08 +0000550
Misha Brukman1013ef52004-07-21 20:09:08 +0000551 // ANDIo, ORI, and XORI take unsigned values
Nate Begemanb816f022004-10-07 22:30:03 +0000552 bool cond2 = (Opcode >= 2)
Misha Brukman2ed17ca2004-07-22 15:58:04 +0000553 && (Op1Cs = dyn_cast<ConstantSInt>(CI))
554 && (Op1Cs->getValue() >= 0)
Nate Begemana41fc772004-09-29 02:35:05 +0000555 && (Op1Cs->getValue() <= 65535);
Misha Brukman1013ef52004-07-21 20:09:08 +0000556
557 // ANDIo, ORI, and XORI take UIMMs, so they can be larger
Nate Begemanb816f022004-10-07 22:30:03 +0000558 bool cond3 = (Opcode >= 2)
Misha Brukman17a90002004-07-21 20:22:06 +0000559 && (Op1Cu = dyn_cast<ConstantUInt>(CI))
560 && (Op1Cu->getValue() <= 65535);
Misha Brukman1013ef52004-07-21 20:09:08 +0000561
Nate Begemanb816f022004-10-07 22:30:03 +0000562 if (cond1 || cond2 || cond3)
Misha Brukman1013ef52004-07-21 20:09:08 +0000563 return true;
564
565 return false;
566}
567
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000568/// getFixedSizedAllocaFI - Return the frame index for a fixed sized alloca
569/// that is to be statically allocated with the initial stack frame
570/// adjustment.
Misha Brukmana1dca552004-09-21 18:22:19 +0000571unsigned PPC32ISel::getFixedSizedAllocaFI(AllocaInst *AI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000572 // Already computed this?
573 std::map<AllocaInst*, unsigned>::iterator I = AllocaMap.lower_bound(AI);
574 if (I != AllocaMap.end() && I->first == AI) return I->second;
575
576 const Type *Ty = AI->getAllocatedType();
577 ConstantUInt *CUI = cast<ConstantUInt>(AI->getArraySize());
578 unsigned TySize = TM.getTargetData().getTypeSize(Ty);
579 TySize *= CUI->getValue(); // Get total allocated size...
580 unsigned Alignment = TM.getTargetData().getTypeAlignment(Ty);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000581
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000582 // Create a new stack object using the frame manager...
583 int FrameIdx = F->getFrameInfo()->CreateStackObject(TySize, Alignment);
584 AllocaMap.insert(I, std::make_pair(AI, FrameIdx));
585 return FrameIdx;
586}
587
588
Nate Begeman1f5308e2004-11-18 06:51:29 +0000589/// getGlobalBaseReg - Output the instructions required to put the
Misha Brukmanb097f212004-07-26 18:13:24 +0000590/// base address to use for accessing globals into a register.
591///
Nate Begeman5e966612005-03-24 06:28:42 +0000592unsigned PPC32ISel::getGlobalBaseReg() {
Misha Brukmanb097f212004-07-26 18:13:24 +0000593 if (!GlobalBaseInitialized) {
594 // Insert the set of GlobalBaseReg into the first MBB of the function
595 MachineBasicBlock &FirstMBB = F->front();
596 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
597 GlobalBaseReg = makeAnotherReg(Type::IntTy);
Nate Begemanb7a8f2c2004-09-02 08:13:00 +0000598 BuildMI(FirstMBB, MBBI, PPC::MovePCtoLR, 0, PPC::LR);
Nate Begemanda721e72004-09-27 05:08:17 +0000599 BuildMI(FirstMBB, MBBI, PPC::MFLR, 1, GlobalBaseReg).addReg(PPC::LR);
Misha Brukmanb097f212004-07-26 18:13:24 +0000600 GlobalBaseInitialized = true;
601 }
Nate Begeman1f5308e2004-11-18 06:51:29 +0000602 return GlobalBaseReg;
Misha Brukmanb097f212004-07-26 18:13:24 +0000603}
604
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000605/// copyConstantToRegister - Output the instructions required to put the
606/// specified constant into the specified register.
607///
Misha Brukmana1dca552004-09-21 18:22:19 +0000608void PPC32ISel::copyConstantToRegister(MachineBasicBlock *MBB,
609 MachineBasicBlock::iterator IP,
610 Constant *C, unsigned R) {
Chris Lattner289a49a2004-10-16 18:13:47 +0000611 if (isa<UndefValue>(C)) {
612 BuildMI(*MBB, IP, PPC::IMPLICIT_DEF, 0, R);
Chris Lattner411eba02005-03-08 22:53:09 +0000613 if (getClassB(C->getType()) == cLong)
Chris Lattner3c707642005-01-14 20:22:02 +0000614 BuildMI(*MBB, IP, PPC::IMPLICIT_DEF, 0, R+1);
Chris Lattner289a49a2004-10-16 18:13:47 +0000615 return;
616 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000617 if (C->getType()->isIntegral()) {
618 unsigned Class = getClassB(C->getType());
619
620 if (Class == cLong) {
Misha Brukmana0af38c2004-07-28 19:13:49 +0000621 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(C)) {
622 uint64_t uval = CUI->getValue();
623 unsigned hiUVal = uval >> 32;
624 unsigned loUVal = uval;
625 ConstantUInt *CUHi = ConstantUInt::get(Type::UIntTy, hiUVal);
626 ConstantUInt *CULo = ConstantUInt::get(Type::UIntTy, loUVal);
627 copyConstantToRegister(MBB, IP, CUHi, R);
628 copyConstantToRegister(MBB, IP, CULo, R+1);
629 return;
630 } else if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(C)) {
631 int64_t sval = CSI->getValue();
632 int hiSVal = sval >> 32;
633 int loSVal = sval;
634 ConstantSInt *CSHi = ConstantSInt::get(Type::IntTy, hiSVal);
635 ConstantSInt *CSLo = ConstantSInt::get(Type::IntTy, loSVal);
636 copyConstantToRegister(MBB, IP, CSHi, R);
637 copyConstantToRegister(MBB, IP, CSLo, R+1);
638 return;
Misha Brukman7e898c32004-07-20 00:41:46 +0000639 } else {
Misha Brukmana0af38c2004-07-28 19:13:49 +0000640 std::cerr << "Unhandled long constant type!\n";
641 abort();
642 }
643 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000644
Misha Brukmana0af38c2004-07-28 19:13:49 +0000645 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 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000652
Misha Brukmana0af38c2004-07-28 19:13:49 +0000653 // Handle int
654 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(C)) {
655 unsigned uval = CUI->getValue();
656 if (uval < 32768) {
Misha Brukman5b570812004-08-10 22:47:03 +0000657 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(uval);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000658 } else {
659 unsigned Temp = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +0000660 BuildMI(*MBB, IP, PPC::LIS, 1, Temp).addSImm(uval >> 16);
Nate Begemanb816f022004-10-07 22:30:03 +0000661 BuildMI(*MBB, IP, PPC::ORI, 2, R).addReg(Temp).addImm(uval & 0xFFFF);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000662 }
663 return;
664 } else if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(C)) {
665 int sval = CSI->getValue();
666 if (sval < 32768 && sval >= -32768) {
Misha Brukman5b570812004-08-10 22:47:03 +0000667 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(sval);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000668 } else {
669 unsigned Temp = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +0000670 BuildMI(*MBB, IP, PPC::LIS, 1, Temp).addSImm(sval >> 16);
Nate Begemanb816f022004-10-07 22:30:03 +0000671 BuildMI(*MBB, IP, PPC::ORI, 2, R).addReg(Temp).addImm(sval & 0xFFFF);
Misha Brukman7e898c32004-07-20 00:41:46 +0000672 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000673 return;
674 }
Misha Brukmana0af38c2004-07-28 19:13:49 +0000675 std::cerr << "Unhandled integer constant!\n";
676 abort();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000677 } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) {
Misha Brukmand18a31d2004-07-06 22:51:53 +0000678 // We need to spill the constant to memory...
679 MachineConstantPool *CP = F->getConstantPool();
680 unsigned CPI = CP->getConstantPoolIndex(CFP);
681 const Type *Ty = CFP->getType();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000682
Misha Brukmand18a31d2004-07-06 22:51:53 +0000683 assert(Ty == Type::FloatTy || Ty == Type::DoubleTy && "Unknown FP type!");
Misha Brukmanfc879c32004-07-08 18:02:38 +0000684
Misha Brukmanb097f212004-07-26 18:13:24 +0000685 // Load addr of constant to reg; constant is located at base + distance
Misha Brukmanfc879c32004-07-08 18:02:38 +0000686 unsigned Reg1 = makeAnotherReg(Type::IntTy);
Nate Begeman07a73752004-08-17 07:17:44 +0000687 unsigned Opcode = (Ty == Type::FloatTy) ? PPC::LFS : PPC::LFD;
Misha Brukmanb097f212004-07-26 18:13:24 +0000688 // Move value at base + distance into return reg
Nate Begeman1f5308e2004-11-18 06:51:29 +0000689 BuildMI(*MBB, IP, PPC::LOADHiAddr, 2, Reg1)
Nate Begeman5e966612005-03-24 06:28:42 +0000690 .addReg(getGlobalBaseReg()).addConstantPoolIndex(CPI);
Nate Begemaned428532004-09-04 05:00:00 +0000691 BuildMI(*MBB, IP, Opcode, 2, R).addConstantPoolIndex(CPI).addReg(Reg1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000692 } else if (isa<ConstantPointerNull>(C)) {
693 // Copy zero (null pointer) to the register.
Misha Brukman5b570812004-08-10 22:47:03 +0000694 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(0);
Chris Lattner67910e12004-07-18 07:29:35 +0000695 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) {
Misha Brukmanb097f212004-07-26 18:13:24 +0000696 // GV is located at base + distance
Misha Brukmanba1c1da2004-07-20 00:59:38 +0000697 unsigned TmpReg = makeAnotherReg(GV->getType());
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000698
Misha Brukmanb097f212004-07-26 18:13:24 +0000699 // Move value at base + distance into return reg
Nate Begeman1f5308e2004-11-18 06:51:29 +0000700 BuildMI(*MBB, IP, PPC::LOADHiAddr, 2, TmpReg)
Nate Begeman5e966612005-03-24 06:28:42 +0000701 .addReg(getGlobalBaseReg()).addGlobalAddress(GV);
Chris Lattner6540c6c2004-11-23 05:54:25 +0000702
Nate Begemand4c8bea2004-11-25 07:09:01 +0000703 if (GV->hasWeakLinkage() || GV->isExternal()) {
Chris Lattner6540c6c2004-11-23 05:54:25 +0000704 BuildMI(*MBB, IP, PPC::LWZ, 2, R).addGlobalAddress(GV).addReg(TmpReg);
705 } else {
706 BuildMI(*MBB, IP, PPC::LA, 2, R).addReg(TmpReg).addGlobalAddress(GV);
707 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000708 } else {
Chris Lattner76e2df22004-07-15 02:14:30 +0000709 std::cerr << "Offending constant: " << *C << "\n";
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000710 assert(0 && "Type not handled yet!");
711 }
712}
713
714/// LoadArgumentsToVirtualRegs - Load all of the arguments to this function from
715/// the stack into virtual registers.
Misha Brukmana1dca552004-09-21 18:22:19 +0000716void PPC32ISel::LoadArgumentsToVirtualRegs(Function &Fn) {
Chris Lattner3ea93462004-08-06 06:58:50 +0000717 unsigned ArgOffset = 24;
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000718 unsigned GPR_remaining = 8;
719 unsigned FPR_remaining = 13;
Misha Brukmand18a31d2004-07-06 22:51:53 +0000720 unsigned GPR_idx = 0, FPR_idx = 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000721 static const unsigned GPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +0000722 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
723 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
Misha Brukmand18a31d2004-07-06 22:51:53 +0000724 };
725 static const unsigned FPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +0000726 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
727 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
Misha Brukmand18a31d2004-07-06 22:51:53 +0000728 };
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000729
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000730 MachineFrameInfo *MFI = F->getFrameInfo();
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000731
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000732 for (Function::arg_iterator I = Fn.arg_begin(), E = Fn.arg_end();
733 I != E; ++I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000734 bool ArgLive = !I->use_empty();
735 unsigned Reg = ArgLive ? getReg(*I) : 0;
736 int FI; // Frame object index
737
738 switch (getClassB(I->getType())) {
739 case cByte:
740 if (ArgLive) {
Misha Brukmanec6319a2004-07-20 15:51:37 +0000741 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000742 if (GPR_remaining > 0) {
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000743 F->addLiveIn(GPR[GPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000744 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000745 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000746 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000747 addFrameReference(BuildMI(BB, PPC::LBZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000748 }
749 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000750 break;
751 case cShort:
752 if (ArgLive) {
Misha Brukmanec6319a2004-07-20 15:51:37 +0000753 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000754 if (GPR_remaining > 0) {
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000755 F->addLiveIn(GPR[GPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000756 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000757 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000758 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000759 addFrameReference(BuildMI(BB, PPC::LHZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000760 }
761 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000762 break;
763 case cInt:
764 if (ArgLive) {
765 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000766 if (GPR_remaining > 0) {
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000767 F->addLiveIn(GPR[GPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000768 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000769 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000770 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000771 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000772 }
773 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000774 break;
775 case cLong:
776 if (ArgLive) {
777 FI = MFI->CreateFixedObject(8, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000778 if (GPR_remaining > 1) {
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000779 F->addLiveIn(GPR[GPR_idx]);
780 F->addLiveIn(GPR[GPR_idx+1]);
Misha Brukman5b570812004-08-10 22:47:03 +0000781 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukman313efcb2004-07-09 15:45:07 +0000782 .addReg(GPR[GPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000783 BuildMI(BB, PPC::OR, 2, Reg+1).addReg(GPR[GPR_idx+1])
Misha Brukman313efcb2004-07-09 15:45:07 +0000784 .addReg(GPR[GPR_idx+1]);
Misha Brukman422791f2004-06-21 17:41:12 +0000785 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000786 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg), FI);
787 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg+1), FI, 4);
Misha Brukman422791f2004-06-21 17:41:12 +0000788 }
789 }
Misha Brukman1013ef52004-07-21 20:09:08 +0000790 // longs require 4 additional bytes and use 2 GPRs
791 ArgOffset += 4;
Misha Brukman422791f2004-06-21 17:41:12 +0000792 if (GPR_remaining > 1) {
Misha Brukman1013ef52004-07-21 20:09:08 +0000793 GPR_remaining--;
Misha Brukman422791f2004-06-21 17:41:12 +0000794 GPR_idx++;
795 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000796 break;
Misha Brukman7e898c32004-07-20 00:41:46 +0000797 case cFP32:
798 if (ArgLive) {
799 FI = MFI->CreateFixedObject(4, ArgOffset);
800
Misha Brukman422791f2004-06-21 17:41:12 +0000801 if (FPR_remaining > 0) {
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000802 F->addLiveIn(FPR[FPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000803 BuildMI(BB, PPC::FMR, 1, Reg).addReg(FPR[FPR_idx]);
Misha Brukmand18a31d2004-07-06 22:51:53 +0000804 FPR_remaining--;
805 FPR_idx++;
Misha Brukman422791f2004-06-21 17:41:12 +0000806 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000807 addFrameReference(BuildMI(BB, PPC::LFS, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000808 }
809 }
Misha Brukman7e898c32004-07-20 00:41:46 +0000810 break;
811 case cFP64:
812 if (ArgLive) {
813 FI = MFI->CreateFixedObject(8, ArgOffset);
814
815 if (FPR_remaining > 0) {
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000816 F->addLiveIn(FPR[FPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000817 BuildMI(BB, PPC::FMR, 1, Reg).addReg(FPR[FPR_idx]);
Misha Brukman7e898c32004-07-20 00:41:46 +0000818 FPR_remaining--;
819 FPR_idx++;
820 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000821 addFrameReference(BuildMI(BB, PPC::LFD, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000822 }
823 }
Misha Brukman7e898c32004-07-20 00:41:46 +0000824
825 // doubles require 4 additional bytes and use 2 GPRs of param space
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000826 ArgOffset += 4;
Misha Brukman7e898c32004-07-20 00:41:46 +0000827 if (GPR_remaining > 0) {
828 GPR_remaining--;
829 GPR_idx++;
830 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000831 break;
832 default:
833 assert(0 && "Unhandled argument type!");
834 }
835 ArgOffset += 4; // Each argument takes at least 4 bytes on the stack...
Misha Brukman422791f2004-06-21 17:41:12 +0000836 if (GPR_remaining > 0) {
Misha Brukmand18a31d2004-07-06 22:51:53 +0000837 GPR_remaining--; // uses up 2 GPRs
838 GPR_idx++;
Misha Brukman422791f2004-06-21 17:41:12 +0000839 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000840 }
841
842 // If the function takes variable number of arguments, add a frame offset for
843 // the start of the first vararg value... this is used to expand
844 // llvm.va_start.
845 if (Fn.getFunctionType()->isVarArg())
Misha Brukmanb097f212004-07-26 18:13:24 +0000846 VarArgsFrameIndex = MFI->CreateFixedObject(4, ArgOffset);
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000847
848 if (Fn.getReturnType() != Type::VoidTy)
849 switch (getClassB(Fn.getReturnType())) {
850 case cByte:
851 case cShort:
852 case cInt:
853 F->addLiveOut(PPC::R3);
854 break;
855 case cLong:
856 F->addLiveOut(PPC::R3);
857 F->addLiveOut(PPC::R4);
858 break;
859 case cFP32:
860 case cFP64:
861 F->addLiveOut(PPC::F1);
862 break;
863 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000864}
865
866
867/// SelectPHINodes - Insert machine code to generate phis. This is tricky
868/// because we have to generate our sources into the source basic blocks, not
869/// the current one.
870///
Misha Brukmana1dca552004-09-21 18:22:19 +0000871void PPC32ISel::SelectPHINodes() {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000872 const TargetInstrInfo &TII = *TM.getInstrInfo();
873 const Function &LF = *F->getFunction(); // The LLVM function...
Chris Lattner9184bfb2005-04-09 22:05:17 +0000874
875 MachineBasicBlock::iterator MFLRIt = F->begin()->begin();
876 if (GlobalBaseInitialized) {
877 // If we emitted a MFLR for the global base reg, get an iterator to an
878 // instruction after it.
879 while (MFLRIt->getOpcode() != PPC::MFLR)
880 ++MFLRIt;
881 ++MFLRIt; // step one MI past it.
882 }
883
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000884 for (Function::const_iterator I = LF.begin(), E = LF.end(); I != E; ++I) {
885 const BasicBlock *BB = I;
886 MachineBasicBlock &MBB = *MBBMap[I];
887
888 // Loop over all of the PHI nodes in the LLVM basic block...
889 MachineBasicBlock::iterator PHIInsertPoint = MBB.begin();
890 for (BasicBlock::const_iterator I = BB->begin();
891 PHINode *PN = const_cast<PHINode*>(dyn_cast<PHINode>(I)); ++I) {
892
893 // Create a new machine instr PHI node, and insert it.
894 unsigned PHIReg = getReg(*PN);
895 MachineInstr *PhiMI = BuildMI(MBB, PHIInsertPoint,
Misha Brukman5b570812004-08-10 22:47:03 +0000896 PPC::PHI, PN->getNumOperands(), PHIReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000897
898 MachineInstr *LongPhiMI = 0;
899 if (PN->getType() == Type::LongTy || PN->getType() == Type::ULongTy)
900 LongPhiMI = BuildMI(MBB, PHIInsertPoint,
Misha Brukman5b570812004-08-10 22:47:03 +0000901 PPC::PHI, PN->getNumOperands(), PHIReg+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000902
903 // PHIValues - Map of blocks to incoming virtual registers. We use this
904 // so that we only initialize one incoming value for a particular block,
905 // even if the block has multiple entries in the PHI node.
906 //
907 std::map<MachineBasicBlock*, unsigned> PHIValues;
908
909 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
Misha Brukman313efcb2004-07-09 15:45:07 +0000910 MachineBasicBlock *PredMBB = 0;
911 for (MachineBasicBlock::pred_iterator PI = MBB.pred_begin (),
912 PE = MBB.pred_end (); PI != PE; ++PI)
913 if (PN->getIncomingBlock(i) == (*PI)->getBasicBlock()) {
914 PredMBB = *PI;
915 break;
916 }
917 assert (PredMBB && "Couldn't find incoming machine-cfg edge for phi");
918
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000919 unsigned ValReg;
920 std::map<MachineBasicBlock*, unsigned>::iterator EntryIt =
921 PHIValues.lower_bound(PredMBB);
922
923 if (EntryIt != PHIValues.end() && EntryIt->first == PredMBB) {
924 // We already inserted an initialization of the register for this
925 // predecessor. Recycle it.
926 ValReg = EntryIt->second;
Misha Brukman47225442004-07-23 22:35:49 +0000927 } else {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000928 // Get the incoming value into a virtual register.
929 //
930 Value *Val = PN->getIncomingValue(i);
931
932 // If this is a constant or GlobalValue, we may have to insert code
933 // into the basic block to compute it into a virtual register.
934 if ((isa<Constant>(Val) && !isa<ConstantExpr>(Val)) ||
935 isa<GlobalValue>(Val)) {
936 // Simple constants get emitted at the end of the basic block,
937 // before any terminator instructions. We "know" that the code to
938 // move a constant into a register will never clobber any flags.
939 ValReg = getReg(Val, PredMBB, PredMBB->getFirstTerminator());
940 } else {
941 // Because we don't want to clobber any values which might be in
942 // physical registers with the computation of this constant (which
943 // might be arbitrarily complex if it is a constant expression),
944 // just insert the computation at the top of the basic block.
945 MachineBasicBlock::iterator PI = PredMBB->begin();
Misha Brukman47225442004-07-23 22:35:49 +0000946
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000947 // Skip over any PHI nodes though!
Misha Brukman5b570812004-08-10 22:47:03 +0000948 while (PI != PredMBB->end() && PI->getOpcode() == PPC::PHI)
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000949 ++PI;
Misha Brukman47225442004-07-23 22:35:49 +0000950
Chris Lattner9184bfb2005-04-09 22:05:17 +0000951 // If this is the entry block, and if the entry block contains a
952 // MFLR instruction, emit this operation after it. This is needed
953 // because global addresses use it.
954 if (PredMBB == F->begin())
955 PI = MFLRIt;
956
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000957 ValReg = getReg(Val, PredMBB, PI);
958 }
959
960 // Remember that we inserted a value for this PHI for this predecessor
961 PHIValues.insert(EntryIt, std::make_pair(PredMBB, ValReg));
962 }
963
964 PhiMI->addRegOperand(ValReg);
965 PhiMI->addMachineBasicBlockOperand(PredMBB);
966 if (LongPhiMI) {
967 LongPhiMI->addRegOperand(ValReg+1);
968 LongPhiMI->addMachineBasicBlockOperand(PredMBB);
969 }
970 }
971
972 // Now that we emitted all of the incoming values for the PHI node, make
973 // sure to reposition the InsertPoint after the PHI that we just added.
974 // This is needed because we might have inserted a constant into this
975 // block, right after the PHI's which is before the old insert point!
976 PHIInsertPoint = LongPhiMI ? LongPhiMI : PhiMI;
977 ++PHIInsertPoint;
978 }
979 }
980}
981
982
983// canFoldSetCCIntoBranchOrSelect - Return the setcc instruction if we can fold
984// it into the conditional branch or select instruction which is the only user
985// of the cc instruction. This is the case if the conditional branch is the
986// only user of the setcc, and if the setcc is in the same basic block as the
Misha Brukman1013ef52004-07-21 20:09:08 +0000987// conditional branch.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000988//
989static SetCondInst *canFoldSetCCIntoBranchOrSelect(Value *V) {
990 if (SetCondInst *SCI = dyn_cast<SetCondInst>(V))
991 if (SCI->hasOneUse()) {
992 Instruction *User = cast<Instruction>(SCI->use_back());
Chris Lattnerfbd4de12005-01-14 19:31:00 +0000993 if ((isa<BranchInst>(User) ||
994 (isa<SelectInst>(User) && User->getOperand(0) == V)) &&
Misha Brukmanbebde752004-07-16 21:06:24 +0000995 SCI->getParent() == User->getParent())
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000996 return SCI;
997 }
998 return 0;
999}
1000
Misha Brukmanb097f212004-07-26 18:13:24 +00001001// canFoldGEPIntoLoadOrStore - Return the GEP instruction if we can fold it into
1002// the load or store instruction that is the only user of the GEP.
1003//
1004static GetElementPtrInst *canFoldGEPIntoLoadOrStore(Value *V) {
Nate Begeman645495d2004-09-23 05:31:33 +00001005 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(V)) {
1006 bool AllUsesAreMem = true;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001007 for (Value::use_iterator I = GEPI->use_begin(), E = GEPI->use_end();
Nate Begeman645495d2004-09-23 05:31:33 +00001008 I != E; ++I) {
1009 Instruction *User = cast<Instruction>(*I);
1010
1011 // If the GEP is the target of a store, but not the source, then we are ok
1012 // to fold it.
Misha Brukmanb097f212004-07-26 18:13:24 +00001013 if (isa<StoreInst>(User) &&
1014 GEPI->getParent() == User->getParent() &&
1015 User->getOperand(0) != GEPI &&
Nate Begeman645495d2004-09-23 05:31:33 +00001016 User->getOperand(1) == GEPI)
1017 continue;
1018
1019 // If the GEP is the source of a load, then we're always ok to fold it
Misha Brukmanb097f212004-07-26 18:13:24 +00001020 if (isa<LoadInst>(User) &&
1021 GEPI->getParent() == User->getParent() &&
Nate Begeman645495d2004-09-23 05:31:33 +00001022 User->getOperand(0) == GEPI)
1023 continue;
1024
1025 // if we got to this point, than the instruction was not a load or store
1026 // that we are capable of folding the GEP into.
1027 AllUsesAreMem = false;
1028 break;
Misha Brukmanb097f212004-07-26 18:13:24 +00001029 }
Nate Begeman645495d2004-09-23 05:31:33 +00001030 if (AllUsesAreMem)
1031 return GEPI;
1032 }
Misha Brukmanb097f212004-07-26 18:13:24 +00001033 return 0;
1034}
1035
1036
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001037// Return a fixed numbering for setcc instructions which does not depend on the
1038// order of the opcodes.
1039//
1040static unsigned getSetCCNumber(unsigned Opcode) {
Misha Brukmane9c65512004-07-06 15:32:44 +00001041 switch (Opcode) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001042 default: assert(0 && "Unknown setcc instruction!");
1043 case Instruction::SetEQ: return 0;
1044 case Instruction::SetNE: return 1;
1045 case Instruction::SetLT: return 2;
1046 case Instruction::SetGE: return 3;
1047 case Instruction::SetGT: return 4;
1048 case Instruction::SetLE: return 5;
1049 }
1050}
1051
Chris Lattner51d2ed92005-04-10 01:03:31 +00001052static unsigned getPPCOpcodeForSetCCOpcode(unsigned Opcode) {
Misha Brukmane9c65512004-07-06 15:32:44 +00001053 switch (Opcode) {
1054 default: assert(0 && "Unknown setcc instruction!");
Misha Brukman5b570812004-08-10 22:47:03 +00001055 case Instruction::SetEQ: return PPC::BEQ;
1056 case Instruction::SetNE: return PPC::BNE;
1057 case Instruction::SetLT: return PPC::BLT;
1058 case Instruction::SetGE: return PPC::BGE;
1059 case Instruction::SetGT: return PPC::BGT;
1060 case Instruction::SetLE: return PPC::BLE;
Misha Brukmane9c65512004-07-06 15:32:44 +00001061 }
1062}
1063
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001064/// emitUCOM - emits an unordered FP compare.
Misha Brukmana1dca552004-09-21 18:22:19 +00001065void PPC32ISel::emitUCOM(MachineBasicBlock *MBB, MachineBasicBlock::iterator IP,
1066 unsigned LHS, unsigned RHS) {
Misha Brukman5b570812004-08-10 22:47:03 +00001067 BuildMI(*MBB, IP, PPC::FCMPU, 2, PPC::CR0).addReg(LHS).addReg(RHS);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001068}
1069
Misha Brukmana1dca552004-09-21 18:22:19 +00001070unsigned PPC32ISel::ExtendOrClear(MachineBasicBlock *MBB,
1071 MachineBasicBlock::iterator IP,
Nate Begemana2de1022004-09-22 04:40:25 +00001072 Value *Op0) {
Nate Begeman0e5e5f52004-08-22 08:10:15 +00001073 const Type *CompTy = Op0->getType();
1074 unsigned Reg = getReg(Op0, MBB, IP);
Nate Begemanb47321b2004-08-20 09:56:22 +00001075 unsigned Class = getClassB(CompTy);
1076
Nate Begeman1b99fd32004-09-29 03:45:33 +00001077 // Since we know that boolean values will be either zero or one, we don't
1078 // have to extend or clear them.
1079 if (CompTy == Type::BoolTy)
1080 return Reg;
1081
Nate Begemanb47321b2004-08-20 09:56:22 +00001082 // Before we do a comparison or SetCC, we have to make sure that we truncate
1083 // the source registers appropriately.
1084 if (Class == cByte) {
1085 unsigned TmpReg = makeAnotherReg(CompTy);
1086 if (CompTy->isSigned())
1087 BuildMI(*MBB, IP, PPC::EXTSB, 1, TmpReg).addReg(Reg);
1088 else
1089 BuildMI(*MBB, IP, PPC::RLWINM, 4, TmpReg).addReg(Reg).addImm(0)
1090 .addImm(24).addImm(31);
1091 Reg = TmpReg;
1092 } else if (Class == cShort) {
1093 unsigned TmpReg = makeAnotherReg(CompTy);
1094 if (CompTy->isSigned())
1095 BuildMI(*MBB, IP, PPC::EXTSH, 1, TmpReg).addReg(Reg);
1096 else
1097 BuildMI(*MBB, IP, PPC::RLWINM, 4, TmpReg).addReg(Reg).addImm(0)
1098 .addImm(16).addImm(31);
1099 Reg = TmpReg;
1100 }
1101 return Reg;
1102}
1103
Chris Lattner51d2ed92005-04-10 01:03:31 +00001104/// EmitComparison - emits a comparison of the two operands. The result is in
1105/// CR0.
Misha Brukmanbebde752004-07-16 21:06:24 +00001106///
Chris Lattner51d2ed92005-04-10 01:03:31 +00001107void PPC32ISel::EmitComparison(unsigned OpNum, Value *Op0, Value *Op1,
1108 MachineBasicBlock *MBB,
1109 MachineBasicBlock::iterator IP) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001110 // The arguments are already supposed to be of the same type.
1111 const Type *CompTy = Op0->getType();
1112 unsigned Class = getClassB(CompTy);
Nate Begemana2de1022004-09-22 04:40:25 +00001113 unsigned Op0r = ExtendOrClear(MBB, IP, Op0);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001114
Misha Brukman1013ef52004-07-21 20:09:08 +00001115 // Use crand for lt, gt and crandc for le, ge
Misha Brukman5b570812004-08-10 22:47:03 +00001116 unsigned CROpcode = (OpNum == 2 || OpNum == 4) ? PPC::CRAND : PPC::CRANDC;
Misha Brukman1013ef52004-07-21 20:09:08 +00001117 // ? cr1[lt] : cr1[gt]
Nate Begemanef7288c2005-04-14 03:20:38 +00001118 unsigned CR1field = (OpNum == 2 || OpNum == 3) ? 0 : 1;
Misha Brukman1013ef52004-07-21 20:09:08 +00001119 // ? cr0[lt] : cr0[gt]
1120 unsigned CR0field = (OpNum == 2 || OpNum == 5) ? 0 : 1;
Misha Brukman5b570812004-08-10 22:47:03 +00001121 unsigned Opcode = CompTy->isSigned() ? PPC::CMPW : PPC::CMPLW;
1122 unsigned OpcodeImm = CompTy->isSigned() ? PPC::CMPWI : PPC::CMPLWI;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001123
1124 // Special case handling of: cmp R, i
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001125 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001126 if (Class == cByte || Class == cShort || Class == cInt) {
Misha Brukman1013ef52004-07-21 20:09:08 +00001127 unsigned Op1v = CI->getRawValue() & 0xFFFF;
Nate Begeman43d64ea2004-08-15 06:42:28 +00001128 unsigned OpClass = (CompTy->isSigned()) ? 0 : 2;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001129
Misha Brukman1013ef52004-07-21 20:09:08 +00001130 // Treat compare like ADDI for the purposes of immediate suitability
Nate Begemanb816f022004-10-07 22:30:03 +00001131 if (canUseAsImmediateForOpcode(CI, OpClass, false)) {
Misha Brukman5b570812004-08-10 22:47:03 +00001132 BuildMI(*MBB, IP, OpcodeImm, 2, PPC::CR0).addReg(Op0r).addSImm(Op1v);
Misha Brukman422791f2004-06-21 17:41:12 +00001133 } else {
1134 unsigned Op1r = getReg(Op1, MBB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00001135 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
Misha Brukman422791f2004-06-21 17:41:12 +00001136 }
Chris Lattner51d2ed92005-04-10 01:03:31 +00001137 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001138 } else {
1139 assert(Class == cLong && "Unknown integer class!");
1140 unsigned LowCst = CI->getRawValue();
1141 unsigned HiCst = CI->getRawValue() >> 32;
1142 if (OpNum < 2) { // seteq, setne
Misha Brukman1013ef52004-07-21 20:09:08 +00001143 unsigned LoLow = makeAnotherReg(Type::IntTy);
1144 unsigned LoTmp = makeAnotherReg(Type::IntTy);
1145 unsigned HiLow = makeAnotherReg(Type::IntTy);
1146 unsigned HiTmp = makeAnotherReg(Type::IntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001147 unsigned FinalTmp = makeAnotherReg(Type::IntTy);
Misha Brukman47225442004-07-23 22:35:49 +00001148
Misha Brukman5b570812004-08-10 22:47:03 +00001149 BuildMI(*MBB, IP, PPC::XORI, 2, LoLow).addReg(Op0r+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001150 .addImm(LowCst & 0xFFFF);
Misha Brukman5b570812004-08-10 22:47:03 +00001151 BuildMI(*MBB, IP, PPC::XORIS, 2, LoTmp).addReg(LoLow)
Misha Brukman1013ef52004-07-21 20:09:08 +00001152 .addImm(LowCst >> 16);
Misha Brukman5b570812004-08-10 22:47:03 +00001153 BuildMI(*MBB, IP, PPC::XORI, 2, HiLow).addReg(Op0r)
Misha Brukman1013ef52004-07-21 20:09:08 +00001154 .addImm(HiCst & 0xFFFF);
Misha Brukman5b570812004-08-10 22:47:03 +00001155 BuildMI(*MBB, IP, PPC::XORIS, 2, HiTmp).addReg(HiLow)
Misha Brukman1013ef52004-07-21 20:09:08 +00001156 .addImm(HiCst >> 16);
Misha Brukman5b570812004-08-10 22:47:03 +00001157 BuildMI(*MBB, IP, PPC::ORo, 2, FinalTmp).addReg(LoTmp).addReg(HiTmp);
Chris Lattner51d2ed92005-04-10 01:03:31 +00001158 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001159 } else {
Misha Brukmanbebde752004-07-16 21:06:24 +00001160 unsigned ConstReg = makeAnotherReg(CompTy);
Misha Brukmanbebde752004-07-16 21:06:24 +00001161 copyConstantToRegister(MBB, IP, CI, ConstReg);
Misha Brukman47225442004-07-23 22:35:49 +00001162
Misha Brukman1013ef52004-07-21 20:09:08 +00001163 // cr0 = r3 ccOpcode r5 or (r3 == r5 AND r4 ccOpcode r6)
Misha Brukman5b570812004-08-10 22:47:03 +00001164 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r)
Misha Brukmanbebde752004-07-16 21:06:24 +00001165 .addReg(ConstReg);
Misha Brukman5b570812004-08-10 22:47:03 +00001166 BuildMI(*MBB, IP, Opcode, 2, PPC::CR1).addReg(Op0r+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001167 .addReg(ConstReg+1);
Nate Begemanef7288c2005-04-14 03:20:38 +00001168 BuildMI(*MBB, IP, PPC::CRAND, 5, PPC::CR0).addImm(2)
1169 .addReg(PPC::CR0).addImm(2).addReg(PPC::CR1).addImm(CR1field);
1170 BuildMI(*MBB, IP, PPC::CROR, 5, PPC::CR0).addImm(CR0field)
1171 .addReg(PPC::CR0).addImm(CR0field).addReg(PPC::CR0).addImm(2);
Chris Lattner51d2ed92005-04-10 01:03:31 +00001172 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001173 }
1174 }
1175 }
1176
1177 unsigned Op1r = getReg(Op1, MBB, IP);
Misha Brukman1013ef52004-07-21 20:09:08 +00001178
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001179 switch (Class) {
1180 default: assert(0 && "Unknown type class!");
1181 case cByte:
1182 case cShort:
1183 case cInt:
Misha Brukman5b570812004-08-10 22:47:03 +00001184 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001185 break;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001186
Misha Brukman7e898c32004-07-20 00:41:46 +00001187 case cFP32:
1188 case cFP64:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001189 emitUCOM(MBB, IP, Op0r, Op1r);
1190 break;
1191
1192 case cLong:
1193 if (OpNum < 2) { // seteq, setne
1194 unsigned LoTmp = makeAnotherReg(Type::IntTy);
1195 unsigned HiTmp = makeAnotherReg(Type::IntTy);
1196 unsigned FinalTmp = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00001197 BuildMI(*MBB, IP, PPC::XOR, 2, HiTmp).addReg(Op0r).addReg(Op1r);
1198 BuildMI(*MBB, IP, PPC::XOR, 2, LoTmp).addReg(Op0r+1).addReg(Op1r+1);
1199 BuildMI(*MBB, IP, PPC::ORo, 2, FinalTmp).addReg(LoTmp).addReg(HiTmp);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001200 break; // Allow the sete or setne to be generated from flags set by OR
1201 } else {
Misha Brukmanbebde752004-07-16 21:06:24 +00001202 unsigned TmpReg1 = makeAnotherReg(Type::IntTy);
1203 unsigned TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman1013ef52004-07-21 20:09:08 +00001204
1205 // cr0 = r3 ccOpcode r5 or (r3 == r5 AND r4 ccOpcode r6)
Misha Brukman5b570812004-08-10 22:47:03 +00001206 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
1207 BuildMI(*MBB, IP, Opcode, 2, PPC::CR1).addReg(Op0r+1).addReg(Op1r+1);
Nate Begemanef7288c2005-04-14 03:20:38 +00001208 BuildMI(*MBB, IP, PPC::CRAND, 5, PPC::CR0).addImm(2)
1209 .addReg(PPC::CR0).addImm(2).addReg(PPC::CR1).addImm(CR1field);
1210 BuildMI(*MBB, IP, PPC::CROR, 5, PPC::CR0).addImm(CR0field)
1211 .addReg(PPC::CR0).addImm(CR0field).addReg(PPC::CR0).addImm(2);
Chris Lattner51d2ed92005-04-10 01:03:31 +00001212 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001213 }
1214 }
Chris Lattner51d2ed92005-04-10 01:03:31 +00001215 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001216}
1217
Misha Brukmand18a31d2004-07-06 22:51:53 +00001218/// visitSetCondInst - emit code to calculate the condition via
1219/// EmitComparison(), and possibly store a 0 or 1 to a register as a result
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001220///
Misha Brukmana1dca552004-09-21 18:22:19 +00001221void PPC32ISel::visitSetCondInst(SetCondInst &I) {
Misha Brukmand18a31d2004-07-06 22:51:53 +00001222 if (canFoldSetCCIntoBranchOrSelect(&I))
Misha Brukmane9c65512004-07-06 15:32:44 +00001223 return;
Misha Brukmanbebde752004-07-16 21:06:24 +00001224
Nate Begemana2de1022004-09-22 04:40:25 +00001225 MachineBasicBlock::iterator MI = BB->end();
1226 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
1227 const Type *Ty = Op0->getType();
1228 unsigned Class = getClassB(Ty);
Nate Begemana96c4af2004-08-21 20:42:14 +00001229 unsigned Opcode = I.getOpcode();
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001230 unsigned OpNum = getSetCCNumber(Opcode);
Nate Begemana2de1022004-09-22 04:40:25 +00001231 unsigned DestReg = getReg(I);
1232
1233 // If the comparison type is byte, short, or int, then we can emit a
1234 // branchless version of the SetCC that puts 0 (false) or 1 (true) in the
1235 // destination register.
1236 if (Class <= cInt) {
1237 ConstantInt *CI = dyn_cast<ConstantInt>(Op1);
1238
1239 if (CI && CI->getRawValue() == 0) {
Nate Begemana2de1022004-09-22 04:40:25 +00001240 unsigned Op0Reg = ExtendOrClear(BB, MI, Op0);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001241
Nate Begemana2de1022004-09-22 04:40:25 +00001242 // comparisons against constant zero and negative one often have shorter
1243 // and/or faster sequences than the set-and-branch general case, handled
1244 // below.
1245 switch(OpNum) {
1246 case 0: { // eq0
1247 unsigned TempReg = makeAnotherReg(Type::IntTy);
1248 BuildMI(*BB, MI, PPC::CNTLZW, 1, TempReg).addReg(Op0Reg);
1249 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(TempReg).addImm(27)
1250 .addImm(5).addImm(31);
1251 break;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001252 }
Nate Begemana2de1022004-09-22 04:40:25 +00001253 case 1: { // ne0
1254 unsigned TempReg = makeAnotherReg(Type::IntTy);
1255 BuildMI(*BB, MI, PPC::ADDIC, 2, TempReg).addReg(Op0Reg).addSImm(-1);
1256 BuildMI(*BB, MI, PPC::SUBFE, 2, DestReg).addReg(TempReg).addReg(Op0Reg);
1257 break;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001258 }
Nate Begemana2de1022004-09-22 04:40:25 +00001259 case 2: { // lt0, always false if unsigned
1260 if (Ty->isSigned())
1261 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Op0Reg).addImm(1)
1262 .addImm(31).addImm(31);
1263 else
1264 BuildMI(*BB, MI, PPC::LI, 1, DestReg).addSImm(0);
1265 break;
1266 }
1267 case 3: { // ge0, always true if unsigned
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001268 if (Ty->isSigned()) {
Nate Begemana2de1022004-09-22 04:40:25 +00001269 unsigned TempReg = makeAnotherReg(Type::IntTy);
1270 BuildMI(*BB, MI, PPC::RLWINM, 4, TempReg).addReg(Op0Reg).addImm(1)
1271 .addImm(31).addImm(31);
1272 BuildMI(*BB, MI, PPC::XORI, 2, DestReg).addReg(TempReg).addImm(1);
1273 } else {
1274 BuildMI(*BB, MI, PPC::LI, 1, DestReg).addSImm(1);
1275 }
1276 break;
1277 }
1278 case 4: { // gt0, equivalent to ne0 if unsigned
1279 unsigned Temp1 = makeAnotherReg(Type::IntTy);
1280 unsigned Temp2 = makeAnotherReg(Type::IntTy);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001281 if (Ty->isSigned()) {
Nate Begemana2de1022004-09-22 04:40:25 +00001282 BuildMI(*BB, MI, PPC::NEG, 2, Temp1).addReg(Op0Reg);
1283 BuildMI(*BB, MI, PPC::ANDC, 2, Temp2).addReg(Temp1).addReg(Op0Reg);
1284 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp2).addImm(1)
1285 .addImm(31).addImm(31);
1286 } else {
1287 BuildMI(*BB, MI, PPC::ADDIC, 2, Temp1).addReg(Op0Reg).addSImm(-1);
1288 BuildMI(*BB, MI, PPC::SUBFE, 2, DestReg).addReg(Temp1).addReg(Op0Reg);
1289 }
1290 break;
1291 }
1292 case 5: { // le0, equivalent to eq0 if unsigned
1293 unsigned Temp1 = makeAnotherReg(Type::IntTy);
1294 unsigned Temp2 = makeAnotherReg(Type::IntTy);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001295 if (Ty->isSigned()) {
Nate Begemana2de1022004-09-22 04:40:25 +00001296 BuildMI(*BB, MI, PPC::NEG, 2, Temp1).addReg(Op0Reg);
1297 BuildMI(*BB, MI, PPC::ORC, 2, Temp2).addReg(Op0Reg).addReg(Temp1);
1298 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp2).addImm(1)
1299 .addImm(31).addImm(31);
1300 } else {
1301 BuildMI(*BB, MI, PPC::CNTLZW, 1, Temp1).addReg(Op0Reg);
1302 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp1).addImm(27)
1303 .addImm(5).addImm(31);
1304 }
1305 break;
1306 }
1307 } // switch
1308 return;
1309 }
1310 }
Chris Lattner51d2ed92005-04-10 01:03:31 +00001311 unsigned PPCOpcode = getPPCOpcodeForSetCCOpcode(Opcode);
Nate Begemana96c4af2004-08-21 20:42:14 +00001312
1313 // Create an iterator with which to insert the MBB for copying the false value
1314 // and the MBB to hold the PHI instruction for this SetCC.
Misha Brukman425ff242004-07-01 21:34:10 +00001315 MachineBasicBlock *thisMBB = BB;
1316 const BasicBlock *LLVM_BB = BB->getBasicBlock();
Misha Brukman7e898c32004-07-20 00:41:46 +00001317 ilist<MachineBasicBlock>::iterator It = BB;
1318 ++It;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001319
Misha Brukman425ff242004-07-01 21:34:10 +00001320 // thisMBB:
1321 // ...
1322 // cmpTY cr0, r1, r2
Misha Brukman425ff242004-07-01 21:34:10 +00001323 // %TrueValue = li 1
Nate Begemana96c4af2004-08-21 20:42:14 +00001324 // bCC sinkMBB
Chris Lattner51d2ed92005-04-10 01:03:31 +00001325 EmitComparison(OpNum, Op0, Op1, BB, BB->end());
Misha Brukmane2eceb52004-07-23 16:08:20 +00001326 unsigned TrueValue = makeAnotherReg(I.getType());
Misha Brukman5b570812004-08-10 22:47:03 +00001327 BuildMI(BB, PPC::LI, 1, TrueValue).addSImm(1);
Nate Begemana96c4af2004-08-21 20:42:14 +00001328 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
1329 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
1330 BuildMI(BB, PPCOpcode, 2).addReg(PPC::CR0).addMBB(sinkMBB);
1331 F->getBasicBlockList().insert(It, copy0MBB);
1332 F->getBasicBlockList().insert(It, sinkMBB);
Misha Brukman425ff242004-07-01 21:34:10 +00001333 // Update machine-CFG edges
Nate Begemana96c4af2004-08-21 20:42:14 +00001334 BB->addSuccessor(copy0MBB);
Misha Brukman425ff242004-07-01 21:34:10 +00001335 BB->addSuccessor(sinkMBB);
1336
Misha Brukman1013ef52004-07-21 20:09:08 +00001337 // copy0MBB:
1338 // %FalseValue = li 0
1339 // fallthrough
1340 BB = copy0MBB;
1341 unsigned FalseValue = makeAnotherReg(I.getType());
Misha Brukman5b570812004-08-10 22:47:03 +00001342 BuildMI(BB, PPC::LI, 1, FalseValue).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00001343 // Update machine-CFG edges
1344 BB->addSuccessor(sinkMBB);
1345
Misha Brukman425ff242004-07-01 21:34:10 +00001346 // sinkMBB:
Nate Begemana96c4af2004-08-21 20:42:14 +00001347 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
Misha Brukman425ff242004-07-01 21:34:10 +00001348 // ...
1349 BB = sinkMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00001350 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(FalseValue)
Nate Begemana96c4af2004-08-21 20:42:14 +00001351 .addMBB(copy0MBB).addReg(TrueValue).addMBB(thisMBB);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001352}
1353
Misha Brukmana1dca552004-09-21 18:22:19 +00001354void PPC32ISel::visitSelectInst(SelectInst &SI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001355 unsigned DestReg = getReg(SI);
1356 MachineBasicBlock::iterator MII = BB->end();
Misha Brukman2fec9902004-06-21 20:22:03 +00001357 emitSelectOperation(BB, MII, SI.getCondition(), SI.getTrueValue(),
1358 SI.getFalseValue(), DestReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001359}
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001360
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001361/// emitSelect - Common code shared between visitSelectInst and the constant
1362/// expression support.
Misha Brukmana1dca552004-09-21 18:22:19 +00001363void PPC32ISel::emitSelectOperation(MachineBasicBlock *MBB,
1364 MachineBasicBlock::iterator IP,
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001365 Value *Cond, Value *TrueVal,
Misha Brukmana1dca552004-09-21 18:22:19 +00001366 Value *FalseVal, unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001367 unsigned SelectClass = getClassB(TrueVal->getType());
Misha Brukman7e898c32004-07-20 00:41:46 +00001368 unsigned Opcode;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001369
Misha Brukmanbebde752004-07-16 21:06:24 +00001370 // See if we can fold the setcc into the select instruction, or if we have
1371 // to get the register of the Cond value
Misha Brukmanbebde752004-07-16 21:06:24 +00001372 if (SetCondInst *SCI = canFoldSetCCIntoBranchOrSelect(Cond)) {
1373 // We successfully folded the setcc into the select instruction.
Misha Brukmanbebde752004-07-16 21:06:24 +00001374 unsigned OpNum = getSetCCNumber(SCI->getOpcode());
Nate Begeman087d5d92004-10-06 09:53:04 +00001375 if (OpNum >= 2 && OpNum <= 5) {
1376 unsigned SetCondClass = getClassB(SCI->getOperand(0)->getType());
1377 if ((SetCondClass == cFP32 || SetCondClass == cFP64) &&
1378 (SelectClass == cFP32 || SelectClass == cFP64)) {
1379 unsigned CondReg = getReg(SCI->getOperand(0), MBB, IP);
1380 unsigned TrueReg = getReg(TrueVal, MBB, IP);
1381 unsigned FalseReg = getReg(FalseVal, MBB, IP);
1382 // if the comparison of the floating point value used to for the select
1383 // is against 0, then we can emit an fsel without subtraction.
1384 ConstantFP *Op1C = dyn_cast<ConstantFP>(SCI->getOperand(1));
1385 if (Op1C && (Op1C->isExactlyValue(-0.0) || Op1C->isExactlyValue(0.0))) {
1386 switch(OpNum) {
1387 case 2: // LT
1388 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(CondReg)
1389 .addReg(FalseReg).addReg(TrueReg);
1390 break;
1391 case 3: // GE == !LT
1392 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(CondReg)
1393 .addReg(TrueReg).addReg(FalseReg);
1394 break;
1395 case 4: { // GT
1396 unsigned NegatedReg = makeAnotherReg(SCI->getOperand(0)->getType());
1397 BuildMI(*MBB, IP, PPC::FNEG, 1, NegatedReg).addReg(CondReg);
1398 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(NegatedReg)
1399 .addReg(FalseReg).addReg(TrueReg);
1400 }
1401 break;
1402 case 5: { // LE == !GT
1403 unsigned NegatedReg = makeAnotherReg(SCI->getOperand(0)->getType());
1404 BuildMI(*MBB, IP, PPC::FNEG, 1, NegatedReg).addReg(CondReg);
1405 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(NegatedReg)
1406 .addReg(TrueReg).addReg(FalseReg);
1407 }
1408 break;
1409 default:
1410 assert(0 && "Invalid SetCC opcode to fsel");
1411 abort();
1412 break;
1413 }
1414 } else {
1415 unsigned OtherCondReg = getReg(SCI->getOperand(1), MBB, IP);
1416 unsigned SelectReg = makeAnotherReg(SCI->getOperand(0)->getType());
1417 switch(OpNum) {
1418 case 2: // LT
1419 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(CondReg)
1420 .addReg(OtherCondReg);
1421 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1422 .addReg(FalseReg).addReg(TrueReg);
1423 break;
1424 case 3: // GE == !LT
1425 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(CondReg)
1426 .addReg(OtherCondReg);
1427 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1428 .addReg(TrueReg).addReg(FalseReg);
1429 break;
1430 case 4: // GT
1431 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(OtherCondReg)
1432 .addReg(CondReg);
1433 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1434 .addReg(FalseReg).addReg(TrueReg);
1435 break;
1436 case 5: // LE == !GT
1437 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(OtherCondReg)
1438 .addReg(CondReg);
1439 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1440 .addReg(TrueReg).addReg(FalseReg);
1441 break;
1442 default:
1443 assert(0 && "Invalid SetCC opcode to fsel");
1444 abort();
1445 break;
1446 }
1447 }
Nate Begeman087d5d92004-10-06 09:53:04 +00001448 return;
1449 }
1450 }
Chris Lattner51d2ed92005-04-10 01:03:31 +00001451 EmitComparison(OpNum, SCI->getOperand(0),SCI->getOperand(1),MBB,IP);
1452 Opcode = getPPCOpcodeForSetCCOpcode(SCI->getOpcode());
Misha Brukmanbebde752004-07-16 21:06:24 +00001453 } else {
1454 unsigned CondReg = getReg(Cond, MBB, IP);
Nate Begemaned428532004-09-04 05:00:00 +00001455 BuildMI(*MBB, IP, PPC::CMPWI, 2, PPC::CR0).addReg(CondReg).addSImm(0);
Chris Lattner51d2ed92005-04-10 01:03:31 +00001456 Opcode = getPPCOpcodeForSetCCOpcode(Instruction::SetNE);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001457 }
Misha Brukmanbebde752004-07-16 21:06:24 +00001458
1459 MachineBasicBlock *thisMBB = BB;
1460 const BasicBlock *LLVM_BB = BB->getBasicBlock();
Misha Brukman7e898c32004-07-20 00:41:46 +00001461 ilist<MachineBasicBlock>::iterator It = BB;
1462 ++It;
Misha Brukmanbebde752004-07-16 21:06:24 +00001463
Nate Begemana96c4af2004-08-21 20:42:14 +00001464 // thisMBB:
1465 // ...
Chris Lattner6dec0b02005-01-01 16:10:12 +00001466 // TrueVal = ...
Nate Begemana96c4af2004-08-21 20:42:14 +00001467 // cmpTY cr0, r1, r2
Nate Begeman1f49e862004-09-29 05:00:31 +00001468 // bCC copy1MBB
1469 // fallthrough --> copy0MBB
Misha Brukmanbebde752004-07-16 21:06:24 +00001470 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
Misha Brukman1013ef52004-07-21 20:09:08 +00001471 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
Chris Lattner35e5c7c2005-01-02 23:07:31 +00001472 unsigned TrueValue = getReg(TrueVal);
Chris Lattner6dec0b02005-01-01 16:10:12 +00001473 BuildMI(BB, Opcode, 2).addReg(PPC::CR0).addMBB(sinkMBB);
Nate Begemana96c4af2004-08-21 20:42:14 +00001474 F->getBasicBlockList().insert(It, copy0MBB);
Misha Brukman1013ef52004-07-21 20:09:08 +00001475 F->getBasicBlockList().insert(It, sinkMBB);
Misha Brukmanbebde752004-07-16 21:06:24 +00001476 // Update machine-CFG edges
Misha Brukmanbebde752004-07-16 21:06:24 +00001477 BB->addSuccessor(copy0MBB);
Chris Lattner6dec0b02005-01-01 16:10:12 +00001478 BB->addSuccessor(sinkMBB);
Misha Brukmanbebde752004-07-16 21:06:24 +00001479
Misha Brukman1013ef52004-07-21 20:09:08 +00001480 // copy0MBB:
1481 // %FalseValue = ...
Chris Lattner6dec0b02005-01-01 16:10:12 +00001482 // # fallthrough to sinkMBB
Misha Brukman1013ef52004-07-21 20:09:08 +00001483 BB = copy0MBB;
Chris Lattner35e5c7c2005-01-02 23:07:31 +00001484 unsigned FalseValue = getReg(FalseVal);
Misha Brukman1013ef52004-07-21 20:09:08 +00001485 // Update machine-CFG edges
1486 BB->addSuccessor(sinkMBB);
1487
Misha Brukmanbebde752004-07-16 21:06:24 +00001488 // sinkMBB:
Nate Begemana96c4af2004-08-21 20:42:14 +00001489 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
Misha Brukmanbebde752004-07-16 21:06:24 +00001490 // ...
1491 BB = sinkMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00001492 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(FalseValue)
Chris Lattner6dec0b02005-01-01 16:10:12 +00001493 .addMBB(copy0MBB).addReg(TrueValue).addMBB(thisMBB);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001494
Chris Lattner6dec0b02005-01-01 16:10:12 +00001495 // For a register pair representing a long value, define the top part.
Nate Begeman8d963e62004-08-11 03:30:55 +00001496 if (getClassB(TrueVal->getType()) == cLong)
Chris Lattner6dec0b02005-01-01 16:10:12 +00001497 BuildMI(BB, PPC::PHI, 4, DestReg+1).addReg(FalseValue+1)
1498 .addMBB(copy0MBB).addReg(TrueValue+1).addMBB(thisMBB);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001499}
1500
1501
1502
1503/// promote32 - Emit instructions to turn a narrow operand into a 32-bit-wide
1504/// operand, in the specified target register.
1505///
Misha Brukmana1dca552004-09-21 18:22:19 +00001506void PPC32ISel::promote32(unsigned targetReg, const ValueRecord &VR) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001507 bool isUnsigned = VR.Ty->isUnsigned() || VR.Ty == Type::BoolTy;
1508
1509 Value *Val = VR.Val;
1510 const Type *Ty = VR.Ty;
1511 if (Val) {
1512 if (Constant *C = dyn_cast<Constant>(Val)) {
1513 Val = ConstantExpr::getCast(C, Type::IntTy);
Chris Lattner74a806c2004-08-11 07:34:50 +00001514 if (isa<ConstantExpr>(Val)) // Could not fold
1515 Val = C;
1516 else
1517 Ty = Type::IntTy; // Folded!
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001518 }
1519
Misha Brukman2fec9902004-06-21 20:22:03 +00001520 // If this is a simple constant, just emit a load directly to avoid the copy
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001521 if (ConstantInt *CI = dyn_cast<ConstantInt>(Val)) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00001522 copyConstantToRegister(BB, BB->end(), CI, targetReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001523 return;
1524 }
1525 }
1526
1527 // Make sure we have the register number for this value...
1528 unsigned Reg = Val ? getReg(Val) : VR.Reg;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001529 switch (getClassB(Ty)) {
1530 case cByte:
1531 // Extend value into target register (8->32)
Nate Begeman1b99fd32004-09-29 03:45:33 +00001532 if (Ty == Type::BoolTy)
1533 BuildMI(BB, PPC::OR, 2, targetReg).addReg(Reg).addReg(Reg);
1534 else if (isUnsigned)
Misha Brukman5b570812004-08-10 22:47:03 +00001535 BuildMI(BB, PPC::RLWINM, 4, targetReg).addReg(Reg).addZImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00001536 .addZImm(24).addZImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001537 else
Misha Brukman5b570812004-08-10 22:47:03 +00001538 BuildMI(BB, PPC::EXTSB, 1, targetReg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001539 break;
1540 case cShort:
1541 // Extend value into target register (16->32)
1542 if (isUnsigned)
Misha Brukman5b570812004-08-10 22:47:03 +00001543 BuildMI(BB, PPC::RLWINM, 4, targetReg).addReg(Reg).addZImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00001544 .addZImm(16).addZImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001545 else
Misha Brukman5b570812004-08-10 22:47:03 +00001546 BuildMI(BB, PPC::EXTSH, 1, targetReg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001547 break;
1548 case cInt:
1549 // Move value into target register (32->32)
Misha Brukman5b570812004-08-10 22:47:03 +00001550 BuildMI(BB, PPC::OR, 2, targetReg).addReg(Reg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001551 break;
1552 default:
1553 assert(0 && "Unpromotable operand class in promote32");
1554 }
1555}
1556
Misha Brukman2fec9902004-06-21 20:22:03 +00001557/// visitReturnInst - implemented with BLR
1558///
Misha Brukmana1dca552004-09-21 18:22:19 +00001559void PPC32ISel::visitReturnInst(ReturnInst &I) {
Misha Brukmand47bbf72004-06-25 19:04:27 +00001560 // Only do the processing if this is a non-void return
1561 if (I.getNumOperands() > 0) {
1562 Value *RetVal = I.getOperand(0);
1563 switch (getClassB(RetVal->getType())) {
1564 case cByte: // integral return values: extend or move into r3 and return
1565 case cShort:
1566 case cInt:
Misha Brukman5b570812004-08-10 22:47:03 +00001567 promote32(PPC::R3, ValueRecord(RetVal));
Misha Brukmand47bbf72004-06-25 19:04:27 +00001568 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001569 case cFP32:
1570 case cFP64: { // Floats & Doubles: Return in f1
Misha Brukmand47bbf72004-06-25 19:04:27 +00001571 unsigned RetReg = getReg(RetVal);
Misha Brukman5b570812004-08-10 22:47:03 +00001572 BuildMI(BB, PPC::FMR, 1, PPC::F1).addReg(RetReg);
Misha Brukmand47bbf72004-06-25 19:04:27 +00001573 break;
1574 }
1575 case cLong: {
1576 unsigned RetReg = getReg(RetVal);
Misha Brukman5b570812004-08-10 22:47:03 +00001577 BuildMI(BB, PPC::OR, 2, PPC::R3).addReg(RetReg).addReg(RetReg);
1578 BuildMI(BB, PPC::OR, 2, PPC::R4).addReg(RetReg+1).addReg(RetReg+1);
Misha Brukmand47bbf72004-06-25 19:04:27 +00001579 break;
1580 }
1581 default:
1582 visitInstruction(I);
1583 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001584 }
Misha Brukman5b570812004-08-10 22:47:03 +00001585 BuildMI(BB, PPC::BLR, 1).addImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001586}
1587
1588// getBlockAfter - Return the basic block which occurs lexically after the
1589// specified one.
1590static inline BasicBlock *getBlockAfter(BasicBlock *BB) {
1591 Function::iterator I = BB; ++I; // Get iterator to next block
1592 return I != BB->getParent()->end() ? &*I : 0;
1593}
1594
1595/// visitBranchInst - Handle conditional and unconditional branches here. Note
1596/// that since code layout is frozen at this point, that if we are trying to
1597/// jump to a block that is the immediate successor of the current block, we can
1598/// just make a fall-through (but we don't currently).
1599///
Misha Brukmana1dca552004-09-21 18:22:19 +00001600void PPC32ISel::visitBranchInst(BranchInst &BI) {
Misha Brukman2fec9902004-06-21 20:22:03 +00001601 // Update machine-CFG edges
Misha Brukmane2eceb52004-07-23 16:08:20 +00001602 BB->addSuccessor(MBBMap[BI.getSuccessor(0)]);
Misha Brukman2fec9902004-06-21 20:22:03 +00001603 if (BI.isConditional())
Misha Brukmane2eceb52004-07-23 16:08:20 +00001604 BB->addSuccessor(MBBMap[BI.getSuccessor(1)]);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001605
Misha Brukman2fec9902004-06-21 20:22:03 +00001606 BasicBlock *NextBB = getBlockAfter(BI.getParent()); // BB after current one
Misha Brukmane9c65512004-07-06 15:32:44 +00001607
Misha Brukman2fec9902004-06-21 20:22:03 +00001608 if (!BI.isConditional()) { // Unconditional branch?
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001609 if (BI.getSuccessor(0) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001610 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001611 return;
Misha Brukman2fec9902004-06-21 20:22:03 +00001612 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001613
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001614 // See if we can fold the setcc into the branch itself...
1615 SetCondInst *SCI = canFoldSetCCIntoBranchOrSelect(BI.getCondition());
1616 if (SCI == 0) {
1617 // Nope, cannot fold setcc into this branch. Emit a branch on a condition
1618 // computed some other way...
1619 unsigned condReg = getReg(BI.getCondition());
Misha Brukman5b570812004-08-10 22:47:03 +00001620 BuildMI(BB, PPC::CMPLI, 3, PPC::CR0).addImm(0).addReg(condReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00001621 .addImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001622 if (BI.getSuccessor(1) == NextBB) {
1623 if (BI.getSuccessor(0) != NextBB)
Nate Begeman439b4442005-04-05 04:22:58 +00001624 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(PPC::CR0).addImm(PPC::BNE)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001625 .addMBB(MBBMap[BI.getSuccessor(0)])
1626 .addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001627 } else {
Nate Begeman439b4442005-04-05 04:22:58 +00001628 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(PPC::CR0).addImm(PPC::BEQ)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001629 .addMBB(MBBMap[BI.getSuccessor(1)])
1630 .addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001631 if (BI.getSuccessor(0) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001632 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001633 }
1634 return;
1635 }
1636
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001637 unsigned OpNum = getSetCCNumber(SCI->getOpcode());
Chris Lattner51d2ed92005-04-10 01:03:31 +00001638 unsigned Opcode = getPPCOpcodeForSetCCOpcode(SCI->getOpcode());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001639 MachineBasicBlock::iterator MII = BB->end();
Chris Lattner51d2ed92005-04-10 01:03:31 +00001640 EmitComparison(OpNum, SCI->getOperand(0), SCI->getOperand(1), BB,MII);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001641
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001642 if (BI.getSuccessor(0) != NextBB) {
Nate Begeman439b4442005-04-05 04:22:58 +00001643 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(PPC::CR0).addImm(Opcode)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001644 .addMBB(MBBMap[BI.getSuccessor(0)])
1645 .addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001646 if (BI.getSuccessor(1) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001647 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001648 } else {
1649 // Change to the inverse condition...
1650 if (BI.getSuccessor(1) != NextBB) {
Misha Brukmanf2ccb772004-08-17 04:55:41 +00001651 Opcode = PPC32InstrInfo::invertPPCBranchOpcode(Opcode);
Nate Begeman439b4442005-04-05 04:22:58 +00001652 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(PPC::CR0).addImm(Opcode)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001653 .addMBB(MBBMap[BI.getSuccessor(1)])
1654 .addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001655 }
1656 }
1657}
1658
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001659/// doCall - This emits an abstract call instruction, setting up the arguments
1660/// and the return value as appropriate. For the actual function call itself,
1661/// it inserts the specified CallMI instruction into the stream.
1662///
1663/// FIXME: See Documentation at the following URL for "correct" behavior
Nate Begemanc13a7f02005-03-26 01:28:05 +00001664/// <http://developer.apple.com/documentation/DeveloperTools/Conceptual/MachORuntime/PowerPCConventions/chapter_3_section_5.html>
Misha Brukmana1dca552004-09-21 18:22:19 +00001665void PPC32ISel::doCall(const ValueRecord &Ret, MachineInstr *CallMI,
1666 const std::vector<ValueRecord> &Args, bool isVarArg) {
Chris Lattner3ea93462004-08-06 06:58:50 +00001667 // Count how many bytes are to be pushed on the stack, including the linkage
1668 // area, and parameter passing area.
1669 unsigned NumBytes = 24;
1670 unsigned ArgOffset = 24;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001671
1672 if (!Args.empty()) {
1673 for (unsigned i = 0, e = Args.size(); i != e; ++i)
1674 switch (getClassB(Args[i].Ty)) {
1675 case cByte: case cShort: case cInt:
1676 NumBytes += 4; break;
1677 case cLong:
1678 NumBytes += 8; break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001679 case cFP32:
1680 NumBytes += 4; break;
1681 case cFP64:
1682 NumBytes += 8; break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001683 break;
1684 default: assert(0 && "Unknown class!");
1685 }
1686
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001687 // Just to be safe, we'll always reserve the full 24 bytes of linkage area
Nate Begeman865075e2004-08-16 01:50:22 +00001688 // plus 32 bytes of argument space in case any called code gets funky on us.
1689 if (NumBytes < 56) NumBytes = 56;
Chris Lattner3ea93462004-08-06 06:58:50 +00001690
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001691 // Adjust the stack pointer for the new arguments...
Nate Begemanc13a7f02005-03-26 01:28:05 +00001692 // These operations are automatically eliminated by the prolog/epilog pass
Misha Brukman5b570812004-08-10 22:47:03 +00001693 BuildMI(BB, PPC::ADJCALLSTACKDOWN, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001694
1695 // Arguments go on the stack in reverse order, as specified by the ABI.
Misha Brukman7e898c32004-07-20 00:41:46 +00001696 // Offset to the paramater area on the stack is 24.
Misha Brukmand18a31d2004-07-06 22:51:53 +00001697 int GPR_remaining = 8, FPR_remaining = 13;
Misha Brukmanfc879c32004-07-08 18:02:38 +00001698 unsigned GPR_idx = 0, FPR_idx = 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001699 static const unsigned GPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00001700 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
1701 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001702 };
Misha Brukmand18a31d2004-07-06 22:51:53 +00001703 static const unsigned FPR[] = {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001704 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6,
1705 PPC::F7, PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12,
Misha Brukman5b570812004-08-10 22:47:03 +00001706 PPC::F13
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001707 };
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001708
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001709 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
1710 unsigned ArgReg;
1711 switch (getClassB(Args[i].Ty)) {
1712 case cByte:
1713 case cShort:
1714 // Promote arg to 32 bits wide into a temporary register...
1715 ArgReg = makeAnotherReg(Type::UIntTy);
1716 promote32(ArgReg, Args[i]);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001717
Misha Brukman422791f2004-06-21 17:41:12 +00001718 // Reg or stack?
1719 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001720 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001721 .addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001722 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001723 }
1724 if (GPR_remaining <= 0 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001725 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1726 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001727 }
1728 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001729 case cInt:
1730 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
1731
Misha Brukman422791f2004-06-21 17:41:12 +00001732 // Reg or stack?
1733 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001734 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001735 .addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001736 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001737 }
1738 if (GPR_remaining <= 0 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001739 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1740 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001741 }
1742 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001743 case cLong:
Misha Brukman422791f2004-06-21 17:41:12 +00001744 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001745
Misha Brukmanec6319a2004-07-20 15:51:37 +00001746 // Reg or stack? Note that PPC calling conventions state that long args
1747 // are passed rN = hi, rN+1 = lo, opposite of LLVM.
Misha Brukman422791f2004-06-21 17:41:12 +00001748 if (GPR_remaining > 1) {
Misha Brukman5b570812004-08-10 22:47:03 +00001749 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanec6319a2004-07-20 15:51:37 +00001750 .addReg(ArgReg);
Misha Brukman5b570812004-08-10 22:47:03 +00001751 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx+1]).addReg(ArgReg+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001752 .addReg(ArgReg+1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001753 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1754 CallMI->addRegOperand(GPR[GPR_idx+1], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001755 }
1756 if (GPR_remaining <= 1 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001757 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1758 .addReg(PPC::R1);
1759 BuildMI(BB, PPC::STW, 3).addReg(ArgReg+1).addSImm(ArgOffset+4)
1760 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001761 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001762
1763 ArgOffset += 4; // 8 byte entry, not 4.
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001764 GPR_remaining -= 1; // uses up 2 GPRs
1765 GPR_idx += 1;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001766 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001767 case cFP32:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001768 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
Misha Brukman7e898c32004-07-20 00:41:46 +00001769 // Reg or stack?
1770 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001771 BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001772 CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use);
1773 FPR_remaining--;
1774 FPR_idx++;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001775
Misha Brukman7e898c32004-07-20 00:41:46 +00001776 // If this is a vararg function, and there are GPRs left, also
1777 // pass the float in an int. Otherwise, put it on the stack.
1778 if (isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001779 BuildMI(BB, PPC::STFS, 3).addReg(ArgReg).addSImm(ArgOffset)
1780 .addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001781 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001782 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx])
Nate Begeman293d88c2004-08-13 04:45:14 +00001783 .addSImm(ArgOffset).addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001784 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1785 }
Misha Brukman1916bf92004-06-24 21:56:15 +00001786 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001787 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00001788 BuildMI(BB, PPC::STFS, 3).addReg(ArgReg).addSImm(ArgOffset)
1789 .addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001790 }
1791 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001792 case cFP64:
1793 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
1794 // Reg or stack?
1795 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001796 BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001797 CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use);
1798 FPR_remaining--;
1799 FPR_idx++;
1800 // For vararg functions, must pass doubles via int regs as well
1801 if (isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001802 BuildMI(BB, PPC::STFD, 3).addReg(ArgReg).addSImm(ArgOffset)
1803 .addReg(PPC::R1);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001804
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001805 // Doubles can be split across reg + stack for varargs
1806 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001807 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx]).addSImm(ArgOffset)
1808 .addReg(PPC::R1);
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001809 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1810 }
1811 if (GPR_remaining > 1) {
Misha Brukman5b570812004-08-10 22:47:03 +00001812 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx+1])
1813 .addSImm(ArgOffset+4).addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001814 CallMI->addRegOperand(GPR[GPR_idx+1], MachineOperand::Use);
1815 }
1816 }
1817 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00001818 BuildMI(BB, PPC::STFD, 3).addReg(ArgReg).addSImm(ArgOffset)
1819 .addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001820 }
1821 // Doubles use 8 bytes, and 2 GPRs worth of param space
1822 ArgOffset += 4;
1823 GPR_remaining--;
1824 GPR_idx++;
1825 break;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001826
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001827 default: assert(0 && "Unknown class!");
1828 }
1829 ArgOffset += 4;
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001830 GPR_remaining--;
1831 GPR_idx++;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001832 }
1833 } else {
Nate Begeman865075e2004-08-16 01:50:22 +00001834 BuildMI(BB, PPC::ADJCALLSTACKDOWN, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001835 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001836
Misha Brukman5b570812004-08-10 22:47:03 +00001837 BuildMI(BB, PPC::IMPLICIT_DEF, 0, PPC::LR);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001838 BB->push_back(CallMI);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001839
Chris Lattner3ea93462004-08-06 06:58:50 +00001840 // These functions are automatically eliminated by the prolog/epilog pass
Misha Brukman5b570812004-08-10 22:47:03 +00001841 BuildMI(BB, PPC::ADJCALLSTACKUP, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001842
1843 // If there is a return value, scavenge the result from the location the call
1844 // leaves it in...
1845 //
1846 if (Ret.Ty != Type::VoidTy) {
1847 unsigned DestClass = getClassB(Ret.Ty);
1848 switch (DestClass) {
1849 case cByte:
1850 case cShort:
1851 case cInt:
1852 // Integral results are in r3
Misha Brukman5b570812004-08-10 22:47:03 +00001853 BuildMI(BB, PPC::OR, 2, Ret.Reg).addReg(PPC::R3).addReg(PPC::R3);
Misha Brukmane327e492004-06-24 23:53:24 +00001854 break;
Chris Lattner3ea93462004-08-06 06:58:50 +00001855 case cFP32: // Floating-point return values live in f1
Misha Brukman7e898c32004-07-20 00:41:46 +00001856 case cFP64:
Misha Brukman5b570812004-08-10 22:47:03 +00001857 BuildMI(BB, PPC::FMR, 1, Ret.Reg).addReg(PPC::F1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001858 break;
Chris Lattner3ea93462004-08-06 06:58:50 +00001859 case cLong: // Long values are in r3:r4
Misha Brukman5b570812004-08-10 22:47:03 +00001860 BuildMI(BB, PPC::OR, 2, Ret.Reg).addReg(PPC::R3).addReg(PPC::R3);
1861 BuildMI(BB, PPC::OR, 2, Ret.Reg+1).addReg(PPC::R4).addReg(PPC::R4);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001862 break;
1863 default: assert(0 && "Unknown class!");
1864 }
1865 }
1866}
1867
1868
1869/// visitCallInst - Push args on stack and do a procedure call instruction.
Misha Brukmana1dca552004-09-21 18:22:19 +00001870void PPC32ISel::visitCallInst(CallInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001871 MachineInstr *TheCall;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001872 Function *F = CI.getCalledFunction();
1873 if (F) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001874 // Is it an intrinsic function call?
1875 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID()) {
1876 visitIntrinsicCall(ID, CI); // Special intrinsics are not handled here
1877 return;
1878 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001879 // Emit a CALL instruction with PC-relative displacement.
Misha Brukman5b570812004-08-10 22:47:03 +00001880 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(F, true);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001881 } else { // Emit an indirect call through the CTR
1882 unsigned Reg = getReg(CI.getCalledValue());
Nate Begeman43d64ea2004-08-15 06:42:28 +00001883 BuildMI(BB, PPC::OR, 2, PPC::R12).addReg(Reg).addReg(Reg);
1884 BuildMI(BB, PPC::MTCTR, 1).addReg(PPC::R12);
Nate Begeman7ca541b2005-03-24 23:34:38 +00001885 TheCall = BuildMI(PPC::CALLindirect, 3).addZImm(20).addZImm(0)
Nate Begeman43d64ea2004-08-15 06:42:28 +00001886 .addReg(PPC::R12);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001887 }
1888
1889 std::vector<ValueRecord> Args;
1890 for (unsigned i = 1, e = CI.getNumOperands(); i != e; ++i)
1891 Args.push_back(ValueRecord(CI.getOperand(i)));
1892
1893 unsigned DestReg = CI.getType() != Type::VoidTy ? getReg(CI) : 0;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001894 bool isVarArg = F ? F->getFunctionType()->isVarArg() : true;
1895 doCall(ValueRecord(DestReg, CI.getType()), TheCall, Args, isVarArg);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001896}
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001897
1898
1899/// dyncastIsNan - Return the operand of an isnan operation if this is an isnan.
1900///
1901static Value *dyncastIsNan(Value *V) {
1902 if (CallInst *CI = dyn_cast<CallInst>(V))
1903 if (Function *F = CI->getCalledFunction())
Misha Brukmana2916ce2004-06-21 17:58:36 +00001904 if (F->getIntrinsicID() == Intrinsic::isunordered)
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001905 return CI->getOperand(1);
1906 return 0;
1907}
1908
1909/// isOnlyUsedByUnorderedComparisons - Return true if this value is only used by
1910/// or's whos operands are all calls to the isnan predicate.
1911static bool isOnlyUsedByUnorderedComparisons(Value *V) {
1912 assert(dyncastIsNan(V) && "The value isn't an isnan call!");
1913
1914 // Check all uses, which will be or's of isnans if this predicate is true.
1915 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;++UI){
1916 Instruction *I = cast<Instruction>(*UI);
1917 if (I->getOpcode() != Instruction::Or) return false;
1918 if (I->getOperand(0) != V && !dyncastIsNan(I->getOperand(0))) return false;
1919 if (I->getOperand(1) != V && !dyncastIsNan(I->getOperand(1))) return false;
1920 }
1921
1922 return true;
1923}
1924
1925/// LowerUnknownIntrinsicFunctionCalls - This performs a prepass over the
1926/// function, lowering any calls to unknown intrinsic functions into the
1927/// equivalent LLVM code.
1928///
Misha Brukmana1dca552004-09-21 18:22:19 +00001929void PPC32ISel::LowerUnknownIntrinsicFunctionCalls(Function &F) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001930 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
1931 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
1932 if (CallInst *CI = dyn_cast<CallInst>(I++))
1933 if (Function *F = CI->getCalledFunction())
1934 switch (F->getIntrinsicID()) {
1935 case Intrinsic::not_intrinsic:
1936 case Intrinsic::vastart:
1937 case Intrinsic::vacopy:
1938 case Intrinsic::vaend:
1939 case Intrinsic::returnaddress:
1940 case Intrinsic::frameaddress:
Misha Brukmanb097f212004-07-26 18:13:24 +00001941 // FIXME: should lower these ourselves
Misha Brukmana2916ce2004-06-21 17:58:36 +00001942 // case Intrinsic::isunordered:
Misha Brukmanb097f212004-07-26 18:13:24 +00001943 // case Intrinsic::memcpy: -> doCall(). system memcpy almost
1944 // guaranteed to be faster than anything we generate ourselves
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001945 // We directly implement these intrinsics
1946 break;
1947 case Intrinsic::readio: {
1948 // On PPC, memory operations are in-order. Lower this intrinsic
1949 // into a volatile load.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001950 LoadInst * LI = new LoadInst(CI->getOperand(1), "", true, CI);
1951 CI->replaceAllUsesWith(LI);
1952 BB->getInstList().erase(CI);
1953 break;
1954 }
1955 case Intrinsic::writeio: {
1956 // On PPC, memory operations are in-order. Lower this intrinsic
1957 // into a volatile store.
Misha Brukman8d442c22004-07-14 15:29:51 +00001958 StoreInst *SI = new StoreInst(CI->getOperand(1),
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001959 CI->getOperand(2), true, CI);
Misha Brukman8d442c22004-07-14 15:29:51 +00001960 CI->replaceAllUsesWith(SI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001961 BB->getInstList().erase(CI);
1962 break;
1963 }
Nate Begeman2daec452005-03-24 20:07:16 +00001964 default: {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001965 // All other intrinsic calls we must lower.
Nate Begeman2daec452005-03-24 20:07:16 +00001966 BasicBlock::iterator me(CI);
1967 bool atBegin(BB->begin() == me);
1968 if (!atBegin)
1969 --me;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001970 TM.getIntrinsicLowering().LowerIntrinsicCall(CI);
Nate Begeman2daec452005-03-24 20:07:16 +00001971 // Move iterator to instruction after call
1972 I = atBegin ? BB->begin() : ++me;
1973 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001974 }
1975}
1976
Misha Brukmana1dca552004-09-21 18:22:19 +00001977void PPC32ISel::visitIntrinsicCall(Intrinsic::ID ID, CallInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001978 unsigned TmpReg1, TmpReg2, TmpReg3;
1979 switch (ID) {
1980 case Intrinsic::vastart:
1981 // Get the address of the first vararg value...
1982 TmpReg1 = getReg(CI);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001983 addFrameReference(BuildMI(BB, PPC::ADDI, 2, TmpReg1), VarArgsFrameIndex,
Misha Brukmanec6319a2004-07-20 15:51:37 +00001984 0, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001985 return;
1986
1987 case Intrinsic::vacopy:
1988 TmpReg1 = getReg(CI);
1989 TmpReg2 = getReg(CI.getOperand(1));
Misha Brukman5b570812004-08-10 22:47:03 +00001990 BuildMI(BB, PPC::OR, 2, TmpReg1).addReg(TmpReg2).addReg(TmpReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001991 return;
1992 case Intrinsic::vaend: return;
1993
1994 case Intrinsic::returnaddress:
Misha Brukmanec6319a2004-07-20 15:51:37 +00001995 TmpReg1 = getReg(CI);
1996 if (cast<Constant>(CI.getOperand(1))->isNullValue()) {
1997 MachineFrameInfo *MFI = F->getFrameInfo();
1998 unsigned NumBytes = MFI->getStackSize();
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001999
Misha Brukman5b570812004-08-10 22:47:03 +00002000 BuildMI(BB, PPC::LWZ, 2, TmpReg1).addSImm(NumBytes+8)
2001 .addReg(PPC::R1);
Misha Brukmanec6319a2004-07-20 15:51:37 +00002002 } else {
2003 // Values other than zero are not implemented yet.
Misha Brukman5b570812004-08-10 22:47:03 +00002004 BuildMI(BB, PPC::LI, 1, TmpReg1).addSImm(0);
Misha Brukmanec6319a2004-07-20 15:51:37 +00002005 }
2006 return;
2007
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002008 case Intrinsic::frameaddress:
2009 TmpReg1 = getReg(CI);
2010 if (cast<Constant>(CI.getOperand(1))->isNullValue()) {
Misha Brukman5b570812004-08-10 22:47:03 +00002011 BuildMI(BB, PPC::OR, 2, TmpReg1).addReg(PPC::R1).addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002012 } else {
2013 // Values other than zero are not implemented yet.
Misha Brukman5b570812004-08-10 22:47:03 +00002014 BuildMI(BB, PPC::LI, 1, TmpReg1).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002015 }
2016 return;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002017
Misha Brukmana2916ce2004-06-21 17:58:36 +00002018#if 0
2019 // This may be useful for supporting isunordered
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002020 case Intrinsic::isnan:
2021 // If this is only used by 'isunordered' style comparisons, don't emit it.
2022 if (isOnlyUsedByUnorderedComparisons(&CI)) return;
2023 TmpReg1 = getReg(CI.getOperand(1));
2024 emitUCOM(BB, BB->end(), TmpReg1, TmpReg1);
Misha Brukman422791f2004-06-21 17:41:12 +00002025 TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00002026 BuildMI(BB, PPC::MFCR, TmpReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002027 TmpReg3 = getReg(CI);
Misha Brukman5b570812004-08-10 22:47:03 +00002028 BuildMI(BB, PPC::RLWINM, 4, TmpReg3).addReg(TmpReg2).addImm(4).addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002029 return;
Misha Brukmana2916ce2004-06-21 17:58:36 +00002030#endif
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002031
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002032 default: assert(0 && "Error: unknown intrinsics should have been lowered!");
2033 }
2034}
2035
2036/// visitSimpleBinary - Implement simple binary operators for integral types...
2037/// OperatorClass is one of: 0 for Add, 1 for Sub, 2 for And, 3 for Or, 4 for
2038/// Xor.
2039///
Misha Brukmana1dca552004-09-21 18:22:19 +00002040void PPC32ISel::visitSimpleBinary(BinaryOperator &B, unsigned OperatorClass) {
Nate Begeman1b750222004-10-17 05:19:20 +00002041 if (std::find(SkipList.begin(), SkipList.end(), &B) != SkipList.end())
2042 return;
Nate Begeman905a2912004-10-24 10:33:30 +00002043
2044 unsigned DestReg = getReg(B);
2045 MachineBasicBlock::iterator MI = BB->end();
2046 RlwimiRec RR = InsertMap[&B];
2047 if (RR.Target != 0) {
2048 unsigned TargetReg = getReg(RR.Target, BB, MI);
2049 unsigned InsertReg = getReg(RR.Insert, BB, MI);
2050 BuildMI(*BB, MI, PPC::RLWIMI, 5, DestReg).addReg(TargetReg)
2051 .addReg(InsertReg).addImm(RR.Shift).addImm(RR.MB).addImm(RR.ME);
2052 return;
Nate Begeman1b750222004-10-17 05:19:20 +00002053 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002054
Nate Begeman905a2912004-10-24 10:33:30 +00002055 unsigned Class = getClassB(B.getType());
2056 Value *Op0 = B.getOperand(0), *Op1 = B.getOperand(1);
2057 emitSimpleBinaryOperation(BB, MI, &B, Op0, Op1, OperatorClass, DestReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002058}
2059
2060/// emitBinaryFPOperation - This method handles emission of floating point
2061/// Add (0), Sub (1), Mul (2), and Div (3) operations.
Misha Brukmana1dca552004-09-21 18:22:19 +00002062void PPC32ISel::emitBinaryFPOperation(MachineBasicBlock *BB,
2063 MachineBasicBlock::iterator IP,
2064 Value *Op0, Value *Op1,
2065 unsigned OperatorClass, unsigned DestReg){
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002066
Nate Begeman6d1e2df2004-08-14 22:11:38 +00002067 static const unsigned OpcodeTab[][4] = {
2068 { PPC::FADDS, PPC::FSUBS, PPC::FMULS, PPC::FDIVS }, // Float
2069 { PPC::FADD, PPC::FSUB, PPC::FMUL, PPC::FDIV }, // Double
2070 };
2071
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002072 // Special case: R1 = op <const fp>, R2
Misha Brukmana596f8c2004-07-13 15:35:45 +00002073 if (ConstantFP *Op0C = dyn_cast<ConstantFP>(Op0))
2074 if (Op0C->isExactlyValue(-0.0) && OperatorClass == 1) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002075 // -0.0 - X === -X
2076 unsigned op1Reg = getReg(Op1, BB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00002077 BuildMI(*BB, IP, PPC::FNEG, 1, DestReg).addReg(op1Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002078 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002079 }
2080
Nate Begeman81d265d2004-08-19 05:20:54 +00002081 unsigned Opcode = OpcodeTab[Op0->getType() == Type::DoubleTy][OperatorClass];
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002082 unsigned Op0r = getReg(Op0, BB, IP);
2083 unsigned Op1r = getReg(Op1, BB, IP);
2084 BuildMI(*BB, IP, Opcode, 2, DestReg).addReg(Op0r).addReg(Op1r);
2085}
2086
Nate Begemanb816f022004-10-07 22:30:03 +00002087// ExactLog2 - This function solves for (Val == 1 << (N-1)) and returns N. It
2088// returns zero when the input is not exactly a power of two.
2089static unsigned ExactLog2(unsigned Val) {
2090 if (Val == 0 || (Val & (Val-1))) return 0;
2091 unsigned Count = 0;
2092 while (Val != 1) {
2093 Val >>= 1;
2094 ++Count;
2095 }
2096 return Count;
2097}
2098
Nate Begemanbdf69842004-10-08 02:49:24 +00002099// isRunOfOnes - returns true if Val consists of one contiguous run of 1's with
2100// any number of 0's on either side. the 1's are allowed to wrap from LSB to
2101// MSB. so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
2102// not, since all 1's are not contiguous.
2103static bool isRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME) {
2104 bool isRun = true;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002105 MB = 0;
Nate Begemanbdf69842004-10-08 02:49:24 +00002106 ME = 0;
2107
2108 // look for first set bit
2109 int i = 0;
2110 for (; i < 32; i++) {
2111 if ((Val & (1 << (31 - i))) != 0) {
2112 MB = i;
2113 ME = i;
2114 break;
2115 }
2116 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002117
Nate Begemanbdf69842004-10-08 02:49:24 +00002118 // look for last set bit
2119 for (; i < 32; i++) {
2120 if ((Val & (1 << (31 - i))) == 0)
2121 break;
2122 ME = i;
2123 }
2124
2125 // look for next set bit
2126 for (; i < 32; i++) {
2127 if ((Val & (1 << (31 - i))) != 0)
2128 break;
2129 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002130
Nate Begemanbdf69842004-10-08 02:49:24 +00002131 // if we exhausted all the bits, we found a match at this point for 0*1*0*
2132 if (i == 32)
2133 return true;
2134
2135 // since we just encountered more 1's, if it doesn't wrap around to the
2136 // most significant bit of the word, then we did not find a match to 1*0*1* so
2137 // exit.
2138 if (MB != 0)
2139 return false;
2140
2141 // look for last set bit
2142 for (MB = i; i < 32; i++) {
2143 if ((Val & (1 << (31 - i))) == 0)
2144 break;
2145 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002146
Nate Begemanbdf69842004-10-08 02:49:24 +00002147 // if we exhausted all the bits, then we found a match for 1*0*1*, otherwise,
2148 // the value is not a run of ones.
2149 if (i == 32)
2150 return true;
2151 return false;
2152}
2153
Nate Begeman905a2912004-10-24 10:33:30 +00002154/// isInsertAndHalf - Helper function for emitBitfieldInsert. Returns true if
2155/// OpUser has one use, is used by an or instruction, and is itself an and whose
2156/// second operand is a constant int. Optionally, set OrI to the Or instruction
2157/// that is the sole user of OpUser, and Op1User to the other operand of the Or
2158/// instruction.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002159static bool isInsertAndHalf(User *OpUser, Instruction **Op1User,
Nate Begeman905a2912004-10-24 10:33:30 +00002160 Instruction **OrI, unsigned &Mask) {
2161 // If this instruction doesn't have one use, then return false.
2162 if (!OpUser->hasOneUse())
2163 return false;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002164
Nate Begeman905a2912004-10-24 10:33:30 +00002165 Mask = 0xFFFFFFFF;
2166 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(OpUser))
2167 if (BO->getOpcode() == Instruction::And) {
2168 Value *AndUse = *(OpUser->use_begin());
2169 if (BinaryOperator *Or = dyn_cast<BinaryOperator>(AndUse)) {
2170 if (Or->getOpcode() == Instruction::Or) {
2171 if (ConstantInt *CI = dyn_cast<ConstantInt>(OpUser->getOperand(1))) {
2172 if (OrI) *OrI = Or;
2173 if (Op1User) {
2174 if (Or->getOperand(0) == OpUser)
2175 *Op1User = dyn_cast<Instruction>(Or->getOperand(1));
2176 else
2177 *Op1User = dyn_cast<Instruction>(Or->getOperand(0));
Nate Begeman1b750222004-10-17 05:19:20 +00002178 }
Nate Begeman905a2912004-10-24 10:33:30 +00002179 Mask &= CI->getRawValue();
2180 return true;
Nate Begeman1b750222004-10-17 05:19:20 +00002181 }
2182 }
2183 }
2184 }
Nate Begeman905a2912004-10-24 10:33:30 +00002185 return false;
2186}
2187
2188/// isInsertShiftHalf - Helper function for emitBitfieldInsert. Returns true if
2189/// OpUser has one use, is used by an or instruction, and is itself a shift
2190/// instruction that is either used directly by the or instruction, or is used
2191/// by an and instruction whose second operand is a constant int, and which is
2192/// used by the or instruction.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002193static bool isInsertShiftHalf(User *OpUser, Instruction **Op1User,
2194 Instruction **OrI, Instruction **OptAndI,
Nate Begeman905a2912004-10-24 10:33:30 +00002195 unsigned &Shift, unsigned &Mask) {
2196 // If this instruction doesn't have one use, then return false.
2197 if (!OpUser->hasOneUse())
2198 return false;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002199
Nate Begeman905a2912004-10-24 10:33:30 +00002200 Mask = 0xFFFFFFFF;
2201 if (ShiftInst *SI = dyn_cast<ShiftInst>(OpUser)) {
2202 if (ConstantInt *CI = dyn_cast<ConstantInt>(SI->getOperand(1))) {
2203 Shift = CI->getRawValue();
2204 if (SI->getOpcode() == Instruction::Shl)
2205 Mask <<= Shift;
2206 else if (!SI->getOperand(0)->getType()->isSigned()) {
2207 Mask >>= Shift;
2208 Shift = 32 - Shift;
2209 }
2210
2211 // Now check to see if the shift instruction is used by an or.
2212 Value *ShiftUse = *(OpUser->use_begin());
2213 Value *OptAndICopy = 0;
2214 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(ShiftUse)) {
2215 if (BO->getOpcode() == Instruction::And && BO->hasOneUse()) {
2216 if (ConstantInt *ACI = dyn_cast<ConstantInt>(BO->getOperand(1))) {
2217 if (OptAndI) *OptAndI = BO;
2218 OptAndICopy = BO;
2219 Mask &= ACI->getRawValue();
2220 BO = dyn_cast<BinaryOperator>(*(BO->use_begin()));
2221 }
2222 }
2223 if (BO && BO->getOpcode() == Instruction::Or) {
2224 if (OrI) *OrI = BO;
2225 if (Op1User) {
2226 if (BO->getOperand(0) == OpUser || BO->getOperand(0) == OptAndICopy)
2227 *Op1User = dyn_cast<Instruction>(BO->getOperand(1));
2228 else
2229 *Op1User = dyn_cast<Instruction>(BO->getOperand(0));
2230 }
2231 return true;
2232 }
2233 }
2234 }
2235 }
2236 return false;
2237}
2238
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002239/// emitBitfieldInsert - turn a shift used only by an and with immediate into
Nate Begeman905a2912004-10-24 10:33:30 +00002240/// the rotate left word immediate then mask insert (rlwimi) instruction.
2241/// Patterns matched:
2242/// 1. or shl, and 5. or (shl-and), and 9. or and, and
2243/// 2. or and, shl 6. or and, (shl-and)
2244/// 3. or shr, and 7. or (shr-and), and
2245/// 4. or and, shr 8. or and, (shr-and)
Nate Begeman9b508c32004-10-26 03:48:25 +00002246bool PPC32ISel::emitBitfieldInsert(User *OpUser, unsigned DestReg) {
Nate Begeman905a2912004-10-24 10:33:30 +00002247 // Instructions to skip if we match any of the patterns
2248 Instruction *Op0User, *Op1User = 0, *OptAndI = 0, *OrI = 0;
2249 unsigned TgtMask, InsMask, Amount = 0;
2250 bool matched = false;
2251
2252 // We require OpUser to be an instruction to continue
2253 Op0User = dyn_cast<Instruction>(OpUser);
2254 if (0 == Op0User)
2255 return false;
2256
2257 // Look for cases 2, 4, 6, 8, and 9
2258 if (isInsertAndHalf(Op0User, &Op1User, &OrI, TgtMask))
2259 if (Op1User)
2260 if (isInsertAndHalf(Op1User, 0, 0, InsMask))
2261 matched = true;
2262 else if (isInsertShiftHalf(Op1User, 0, 0, &OptAndI, Amount, InsMask))
2263 matched = true;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002264
Nate Begeman905a2912004-10-24 10:33:30 +00002265 // Look for cases 1, 3, 5, and 7. Force the shift argument to be the one
2266 // inserted into the target, since rlwimi can only rotate the value inserted,
2267 // not the value being inserted into.
2268 if (matched == false)
2269 if (isInsertShiftHalf(Op0User, &Op1User, &OrI, &OptAndI, Amount, InsMask))
2270 if (Op1User && isInsertAndHalf(Op1User, 0, 0, TgtMask)) {
2271 std::swap(Op0User, Op1User);
2272 matched = true;
2273 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002274
Nate Begeman905a2912004-10-24 10:33:30 +00002275 // We didn't succeed in matching one of the patterns, so return false
2276 if (matched == false)
2277 return false;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002278
Nate Begeman905a2912004-10-24 10:33:30 +00002279 // If the masks xor to -1, and the insert mask is a run of ones, then we have
2280 // succeeded in matching one of the cases for generating rlwimi. Update the
2281 // skip lists and users of the Instruction::Or.
2282 unsigned MB, ME;
2283 if (((TgtMask ^ InsMask) == 0xFFFFFFFF) && isRunOfOnes(InsMask, MB, ME)) {
2284 SkipList.push_back(Op0User);
2285 SkipList.push_back(Op1User);
2286 SkipList.push_back(OptAndI);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002287 InsertMap[OrI] = RlwimiRec(Op0User->getOperand(0), Op1User->getOperand(0),
Nate Begeman905a2912004-10-24 10:33:30 +00002288 Amount, MB, ME);
2289 return true;
2290 }
2291 return false;
2292}
2293
2294/// emitBitfieldExtract - turn a shift used only by an and with immediate into the
2295/// rotate left word immediate then and with mask (rlwinm) instruction.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002296bool PPC32ISel::emitBitfieldExtract(MachineBasicBlock *MBB,
Nate Begeman905a2912004-10-24 10:33:30 +00002297 MachineBasicBlock::iterator IP,
Nate Begeman9b508c32004-10-26 03:48:25 +00002298 User *OpUser, unsigned DestReg) {
Nate Begeman905a2912004-10-24 10:33:30 +00002299 return false;
Nate Begeman9b508c32004-10-26 03:48:25 +00002300 /*
2301 // Instructions to skip if we match any of the patterns
2302 Instruction *Op0User, *Op1User = 0;
2303 unsigned ShiftMask, AndMask, Amount = 0;
2304 bool matched = false;
Nate Begeman905a2912004-10-24 10:33:30 +00002305
Nate Begeman9b508c32004-10-26 03:48:25 +00002306 // We require OpUser to be an instruction to continue
2307 Op0User = dyn_cast<Instruction>(OpUser);
2308 if (0 == Op0User)
2309 return false;
2310
2311 if (isExtractShiftHalf)
2312 if (isExtractAndHalf)
2313 matched = true;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002314
Nate Begeman9b508c32004-10-26 03:48:25 +00002315 if (matched == false && isExtractAndHalf)
2316 if (isExtractShiftHalf)
2317 matched = true;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002318
Nate Begeman9b508c32004-10-26 03:48:25 +00002319 if (matched == false)
2320 return false;
2321
2322 if (isRunOfOnes(Imm, MB, ME)) {
2323 unsigned SrcReg = getReg(Op, MBB, IP);
2324 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(Rotate)
2325 .addImm(MB).addImm(ME);
2326 Op1User->replaceAllUsesWith(Op0User);
2327 SkipList.push_back(BO);
2328 return true;
Nate Begeman1b750222004-10-17 05:19:20 +00002329 }
Nate Begeman9b508c32004-10-26 03:48:25 +00002330 */
Nate Begeman1b750222004-10-17 05:19:20 +00002331}
2332
Nate Begemanb816f022004-10-07 22:30:03 +00002333/// emitBinaryConstOperation - Implement simple binary operators for integral
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002334/// types with a constant operand. Opcode is one of: 0 for Add, 1 for Sub,
Nate Begemanb816f022004-10-07 22:30:03 +00002335/// 2 for And, 3 for Or, 4 for Xor, and 5 for Subtract-From.
2336///
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002337void PPC32ISel::emitBinaryConstOperation(MachineBasicBlock *MBB,
Nate Begemanb816f022004-10-07 22:30:03 +00002338 MachineBasicBlock::iterator IP,
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002339 unsigned Op0Reg, ConstantInt *Op1,
Nate Begemanb816f022004-10-07 22:30:03 +00002340 unsigned Opcode, unsigned DestReg) {
2341 static const unsigned OpTab[] = {
2342 PPC::ADD, PPC::SUB, PPC::AND, PPC::OR, PPC::XOR, PPC::SUBF
2343 };
2344 static const unsigned ImmOpTab[2][6] = {
2345 { PPC::ADDI, PPC::ADDI, PPC::ANDIo, PPC::ORI, PPC::XORI, PPC::SUBFIC },
2346 { PPC::ADDIS, PPC::ADDIS, PPC::ANDISo, PPC::ORIS, PPC::XORIS, PPC::SUBFIC }
2347 };
2348
Chris Lattner02846282004-11-30 07:30:20 +00002349 // Handle subtract now by inverting the constant value: X-4 == X+(-4)
Nate Begemanb816f022004-10-07 22:30:03 +00002350 if (Opcode == 1) {
Chris Lattner02846282004-11-30 07:30:20 +00002351 Op1 = cast<ConstantInt>(ConstantExpr::getNeg(Op1));
2352 Opcode = 0;
Nate Begemanb816f022004-10-07 22:30:03 +00002353 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002354
Nate Begemanb816f022004-10-07 22:30:03 +00002355 // xor X, -1 -> not X
Chris Lattner02846282004-11-30 07:30:20 +00002356 if (Opcode == 4 && Op1->isAllOnesValue()) {
2357 BuildMI(*MBB, IP, PPC::NOR, 2, DestReg).addReg(Op0Reg).addReg(Op0Reg);
2358 return;
Nate Begemanb816f022004-10-07 22:30:03 +00002359 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002360
Chris Lattner02846282004-11-30 07:30:20 +00002361 if (Opcode == 2 && !Op1->isNullValue()) {
2362 unsigned MB, ME, mask = Op1->getRawValue();
Nate Begemanbdf69842004-10-08 02:49:24 +00002363 if (isRunOfOnes(mask, MB, ME)) {
Nate Begemanbdf69842004-10-08 02:49:24 +00002364 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(Op0Reg).addImm(0)
2365 .addImm(MB).addImm(ME);
2366 return;
2367 }
2368 }
Nate Begemanb816f022004-10-07 22:30:03 +00002369
Nate Begemane0c83a82004-10-15 00:50:19 +00002370 // PowerPC 16 bit signed immediates are sign extended before use by the
2371 // instruction. Therefore, we can only split up an add of a reg with a 32 bit
2372 // immediate into addis and addi if the sign bit of the low 16 bits is cleared
2373 // so that for register A, const imm X, we don't end up with
2374 // A + XXXX0000 + FFFFXXXX.
2375 bool WontSignExtend = (0 == (Op1->getRawValue() & 0x8000));
2376
Nate Begemanb816f022004-10-07 22:30:03 +00002377 // For Add, Sub, and SubF the instruction takes a signed immediate. For And,
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002378 // Or, and Xor, the instruction takes an unsigned immediate. There is no
Nate Begemanb816f022004-10-07 22:30:03 +00002379 // shifted immediate form of SubF so disallow its opcode for those constants.
Chris Lattner02846282004-11-30 07:30:20 +00002380 if (canUseAsImmediateForOpcode(Op1, Opcode, false)) {
Nate Begemanb816f022004-10-07 22:30:03 +00002381 if (Opcode < 2 || Opcode == 5)
2382 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(Op0Reg)
2383 .addSImm(Op1->getRawValue());
2384 else
2385 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(Op0Reg)
2386 .addZImm(Op1->getRawValue());
Chris Lattner02846282004-11-30 07:30:20 +00002387 } else if (canUseAsImmediateForOpcode(Op1, Opcode, true) && (Opcode < 5)) {
Nate Begemanb816f022004-10-07 22:30:03 +00002388 if (Opcode < 2)
2389 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, DestReg).addReg(Op0Reg)
2390 .addSImm(Op1->getRawValue() >> 16);
2391 else
2392 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, DestReg).addReg(Op0Reg)
2393 .addZImm(Op1->getRawValue() >> 16);
Nate Begemane0c83a82004-10-15 00:50:19 +00002394 } else if ((Opcode < 2 && WontSignExtend) || Opcode == 3 || Opcode == 4) {
2395 unsigned TmpReg = makeAnotherReg(Op1->getType());
Nate Begemane0c83a82004-10-15 00:50:19 +00002396 if (Opcode < 2) {
2397 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, TmpReg).addReg(Op0Reg)
2398 .addSImm(Op1->getRawValue() >> 16);
2399 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(TmpReg)
2400 .addSImm(Op1->getRawValue());
2401 } else {
2402 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, TmpReg).addReg(Op0Reg)
2403 .addZImm(Op1->getRawValue() >> 16);
2404 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(TmpReg)
2405 .addZImm(Op1->getRawValue());
2406 }
Nate Begemanb816f022004-10-07 22:30:03 +00002407 } else {
2408 unsigned Op1Reg = getReg(Op1, MBB, IP);
2409 BuildMI(*MBB, IP, OpTab[Opcode], 2, DestReg).addReg(Op0Reg).addReg(Op1Reg);
2410 }
2411}
2412
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002413/// emitSimpleBinaryOperation - Implement simple binary operators for integral
2414/// types... OperatorClass is one of: 0 for Add, 1 for Sub, 2 for And, 3 for
2415/// Or, 4 for Xor.
2416///
Misha Brukmana1dca552004-09-21 18:22:19 +00002417void PPC32ISel::emitSimpleBinaryOperation(MachineBasicBlock *MBB,
2418 MachineBasicBlock::iterator IP,
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002419 BinaryOperator *BO,
Misha Brukmana1dca552004-09-21 18:22:19 +00002420 Value *Op0, Value *Op1,
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002421 unsigned OperatorClass,
Misha Brukmana1dca552004-09-21 18:22:19 +00002422 unsigned DestReg) {
Misha Brukman422791f2004-06-21 17:41:12 +00002423 // Arithmetic and Bitwise operators
Misha Brukman911afde2004-06-25 14:50:41 +00002424 static const unsigned OpcodeTab[] = {
Nate Begemanf70b5762005-03-28 23:08:54 +00002425 PPC::ADD, PPC::SUBF, PPC::AND, PPC::OR, PPC::XOR
Misha Brukman422791f2004-06-21 17:41:12 +00002426 };
Nate Begemanb816f022004-10-07 22:30:03 +00002427 static const unsigned LongOpTab[2][5] = {
Nate Begemanca12a2b2005-03-28 22:28:37 +00002428 { PPC::ADDC, PPC::SUBFC, PPC::AND, PPC::OR, PPC::XOR },
Nate Begemanb816f022004-10-07 22:30:03 +00002429 { PPC::ADDE, PPC::SUBFE, PPC::AND, PPC::OR, PPC::XOR }
Misha Brukman422791f2004-06-21 17:41:12 +00002430 };
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002431
Nate Begemanb816f022004-10-07 22:30:03 +00002432 unsigned Class = getClassB(Op0->getType());
2433
Misha Brukman7e898c32004-07-20 00:41:46 +00002434 if (Class == cFP32 || Class == cFP64) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002435 assert(OperatorClass < 2 && "No logical ops for FP!");
2436 emitBinaryFPOperation(MBB, IP, Op0, Op1, OperatorClass, DestReg);
2437 return;
2438 }
2439
2440 if (Op0->getType() == Type::BoolTy) {
2441 if (OperatorClass == 3)
2442 // If this is an or of two isnan's, emit an FP comparison directly instead
2443 // of or'ing two isnan's together.
2444 if (Value *LHS = dyncastIsNan(Op0))
2445 if (Value *RHS = dyncastIsNan(Op1)) {
2446 unsigned Op0Reg = getReg(RHS, MBB, IP), Op1Reg = getReg(LHS, MBB, IP);
Misha Brukman422791f2004-06-21 17:41:12 +00002447 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002448 emitUCOM(MBB, IP, Op0Reg, Op1Reg);
Misha Brukman5b570812004-08-10 22:47:03 +00002449 BuildMI(*MBB, IP, PPC::MFCR, TmpReg);
2450 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(TmpReg).addImm(4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002451 .addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002452 return;
2453 }
2454 }
2455
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002456 // Special case: op <const int>, Reg
Nate Begemanb816f022004-10-07 22:30:03 +00002457 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op0))
Misha Brukman1013ef52004-07-21 20:09:08 +00002458 if (Class != cLong) {
Nate Begemanb816f022004-10-07 22:30:03 +00002459 unsigned Opcode = (OperatorClass == 1) ? 5 : OperatorClass;
2460 unsigned Op1r = getReg(Op1, MBB, IP);
2461 emitBinaryConstOperation(MBB, IP, Op1r, CI, Opcode, DestReg);
2462 return;
2463 }
2464 // Special case: op Reg, <const int>
2465 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1))
2466 if (Class != cLong) {
Nate Begeman9b508c32004-10-26 03:48:25 +00002467 if (emitBitfieldInsert(BO, DestReg))
Nate Begeman1b750222004-10-17 05:19:20 +00002468 return;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002469
Nate Begemanb816f022004-10-07 22:30:03 +00002470 unsigned Op0r = getReg(Op0, MBB, IP);
2471 emitBinaryConstOperation(MBB, IP, Op0r, CI, OperatorClass, DestReg);
Misha Brukman1013ef52004-07-21 20:09:08 +00002472 return;
2473 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002474
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002475 // We couldn't generate an immediate variant of the op, load both halves into
2476 // registers and emit the appropriate opcode.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002477 unsigned Op0r = getReg(Op0, MBB, IP);
2478 unsigned Op1r = getReg(Op1, MBB, IP);
2479
Nate Begemanf70b5762005-03-28 23:08:54 +00002480 // Subtracts have their operands swapped
2481 if (OperatorClass == 1) {
2482 if (Class != cLong) {
2483 BuildMI(*MBB, IP, PPC::SUBF, 2, DestReg).addReg(Op1r).addReg(Op0r);
2484 } else {
2485 BuildMI(*MBB, IP, PPC::SUBFC, 2, DestReg+1).addReg(Op1r+1).addReg(Op0r+1);
2486 BuildMI(*MBB, IP, PPC::SUBFE, 2, DestReg).addReg(Op1r).addReg(Op0r);
2487 }
2488 return;
2489 }
2490
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002491 if (Class != cLong) {
Misha Brukman422791f2004-06-21 17:41:12 +00002492 unsigned Opcode = OpcodeTab[OperatorClass];
2493 BuildMI(*MBB, IP, Opcode, 2, DestReg).addReg(Op0r).addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002494 } else {
Nate Begemanb816f022004-10-07 22:30:03 +00002495 BuildMI(*MBB, IP, LongOpTab[0][OperatorClass], 2, DestReg+1).addReg(Op0r+1)
Misha Brukman7e898c32004-07-20 00:41:46 +00002496 .addReg(Op1r+1);
Nate Begemanb816f022004-10-07 22:30:03 +00002497 BuildMI(*MBB, IP, LongOpTab[1][OperatorClass], 2, DestReg).addReg(Op0r)
Misha Brukman1013ef52004-07-21 20:09:08 +00002498 .addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002499 }
2500 return;
2501}
2502
Misha Brukman1013ef52004-07-21 20:09:08 +00002503/// doMultiply - Emit appropriate instructions to multiply together the
2504/// Values Op0 and Op1, and put the result in DestReg.
Misha Brukman2fec9902004-06-21 20:22:03 +00002505///
Misha Brukmana1dca552004-09-21 18:22:19 +00002506void PPC32ISel::doMultiply(MachineBasicBlock *MBB,
2507 MachineBasicBlock::iterator IP,
2508 unsigned DestReg, Value *Op0, Value *Op1) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002509 unsigned Class0 = getClass(Op0->getType());
2510 unsigned Class1 = getClass(Op1->getType());
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002511
Misha Brukman1013ef52004-07-21 20:09:08 +00002512 unsigned Op0r = getReg(Op0, MBB, IP);
2513 unsigned Op1r = getReg(Op1, MBB, IP);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002514
Misha Brukman1013ef52004-07-21 20:09:08 +00002515 // 64 x 64 -> 64
2516 if (Class0 == cLong && Class1 == cLong) {
2517 unsigned Tmp1 = makeAnotherReg(Type::IntTy);
2518 unsigned Tmp2 = makeAnotherReg(Type::IntTy);
2519 unsigned Tmp3 = makeAnotherReg(Type::IntTy);
2520 unsigned Tmp4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00002521 BuildMI(*MBB, IP, PPC::MULHWU, 2, Tmp1).addReg(Op0r+1).addReg(Op1r+1);
2522 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg+1).addReg(Op0r+1).addReg(Op1r+1);
2523 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp2).addReg(Op0r+1).addReg(Op1r);
2524 BuildMI(*MBB, IP, PPC::ADD, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
2525 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp4).addReg(Op0r).addReg(Op1r+1);
2526 BuildMI(*MBB, IP, PPC::ADD, 2, DestReg).addReg(Tmp3).addReg(Tmp4);
Misha Brukman1013ef52004-07-21 20:09:08 +00002527 return;
2528 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002529
Misha Brukman1013ef52004-07-21 20:09:08 +00002530 // 64 x 32 or less, promote 32 to 64 and do a 64 x 64
2531 if (Class0 == cLong && Class1 <= cInt) {
2532 unsigned Tmp0 = makeAnotherReg(Type::IntTy);
2533 unsigned Tmp1 = makeAnotherReg(Type::IntTy);
2534 unsigned Tmp2 = makeAnotherReg(Type::IntTy);
2535 unsigned Tmp3 = makeAnotherReg(Type::IntTy);
2536 unsigned Tmp4 = makeAnotherReg(Type::IntTy);
2537 if (Op1->getType()->isSigned())
Misha Brukman5b570812004-08-10 22:47:03 +00002538 BuildMI(*MBB, IP, PPC::SRAWI, 2, Tmp0).addReg(Op1r).addImm(31);
Misha Brukman1013ef52004-07-21 20:09:08 +00002539 else
Misha Brukman5b570812004-08-10 22:47:03 +00002540 BuildMI(*MBB, IP, PPC::LI, 2, Tmp0).addSImm(0);
2541 BuildMI(*MBB, IP, PPC::MULHWU, 2, Tmp1).addReg(Op0r+1).addReg(Op1r);
2542 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg+1).addReg(Op0r+1).addReg(Op1r);
2543 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp2).addReg(Op0r+1).addReg(Tmp0);
2544 BuildMI(*MBB, IP, PPC::ADD, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
2545 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp4).addReg(Op0r).addReg(Op1r);
2546 BuildMI(*MBB, IP, PPC::ADD, 2, DestReg).addReg(Tmp3).addReg(Tmp4);
Misha Brukman1013ef52004-07-21 20:09:08 +00002547 return;
2548 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002549
Misha Brukman1013ef52004-07-21 20:09:08 +00002550 // 32 x 32 -> 32
2551 if (Class0 <= cInt && Class1 <= cInt) {
Misha Brukman5b570812004-08-10 22:47:03 +00002552 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg).addReg(Op0r).addReg(Op1r);
Misha Brukman1013ef52004-07-21 20:09:08 +00002553 return;
2554 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002555
Misha Brukman1013ef52004-07-21 20:09:08 +00002556 assert(0 && "doMultiply cannot operate on unknown type!");
2557}
2558
2559/// doMultiplyConst - This method will multiply the value in Op0 by the
2560/// value of the ContantInt *CI
Misha Brukmana1dca552004-09-21 18:22:19 +00002561void PPC32ISel::doMultiplyConst(MachineBasicBlock *MBB,
2562 MachineBasicBlock::iterator IP,
2563 unsigned DestReg, Value *Op0, ConstantInt *CI) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002564 unsigned Class = getClass(Op0->getType());
2565
2566 // Mul op0, 0 ==> 0
2567 if (CI->isNullValue()) {
Misha Brukman5b570812004-08-10 22:47:03 +00002568 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00002569 if (Class == cLong)
Misha Brukman5b570812004-08-10 22:47:03 +00002570 BuildMI(*MBB, IP, PPC::LI, 1, DestReg+1).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002571 return;
Misha Brukman1013ef52004-07-21 20:09:08 +00002572 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002573
Misha Brukman1013ef52004-07-21 20:09:08 +00002574 // Mul op0, 1 ==> op0
2575 if (CI->equalsInt(1)) {
2576 unsigned Op0r = getReg(Op0, MBB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00002577 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(Op0r).addReg(Op0r);
Misha Brukman1013ef52004-07-21 20:09:08 +00002578 if (Class == cLong)
Misha Brukman5b570812004-08-10 22:47:03 +00002579 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(Op0r+1).addReg(Op0r+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002580 return;
2581 }
2582
2583 // If the element size is exactly a power of 2, use a shift to get it.
Misha Brukman1013ef52004-07-21 20:09:08 +00002584 if (unsigned Shift = ExactLog2(CI->getRawValue())) {
2585 ConstantUInt *ShiftCI = ConstantUInt::get(Type::UByteTy, Shift);
Nate Begeman9b508c32004-10-26 03:48:25 +00002586 emitShiftOperation(MBB, IP, Op0, ShiftCI, true, Op0->getType(), 0, DestReg);
Misha Brukman1013ef52004-07-21 20:09:08 +00002587 return;
2588 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002589
Misha Brukman1013ef52004-07-21 20:09:08 +00002590 // If 32 bits or less and immediate is in right range, emit mul by immediate
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002591 if (Class == cByte || Class == cShort || Class == cInt) {
Nate Begemanb816f022004-10-07 22:30:03 +00002592 if (canUseAsImmediateForOpcode(CI, 0, false)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002593 unsigned Op0r = getReg(Op0, MBB, IP);
2594 unsigned imm = CI->getRawValue() & 0xFFFF;
Misha Brukman5b570812004-08-10 22:47:03 +00002595 BuildMI(*MBB, IP, PPC::MULLI, 2, DestReg).addReg(Op0r).addSImm(imm);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002596 return;
2597 }
2598 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002599
Misha Brukman1013ef52004-07-21 20:09:08 +00002600 doMultiply(MBB, IP, DestReg, Op0, CI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002601}
2602
Misha Brukmana1dca552004-09-21 18:22:19 +00002603void PPC32ISel::visitMul(BinaryOperator &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002604 unsigned ResultReg = getReg(I);
2605
2606 Value *Op0 = I.getOperand(0);
2607 Value *Op1 = I.getOperand(1);
2608
2609 MachineBasicBlock::iterator IP = BB->end();
2610 emitMultiply(BB, IP, Op0, Op1, ResultReg);
2611}
2612
Misha Brukmana1dca552004-09-21 18:22:19 +00002613void PPC32ISel::emitMultiply(MachineBasicBlock *MBB,
2614 MachineBasicBlock::iterator IP,
2615 Value *Op0, Value *Op1, unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002616 TypeClass Class = getClass(Op0->getType());
2617
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002618 switch (Class) {
2619 case cByte:
2620 case cShort:
2621 case cInt:
Misha Brukman1013ef52004-07-21 20:09:08 +00002622 case cLong:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002623 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002624 doMultiplyConst(MBB, IP, DestReg, Op0, CI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002625 } else {
Misha Brukman1013ef52004-07-21 20:09:08 +00002626 doMultiply(MBB, IP, DestReg, Op0, Op1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002627 }
2628 return;
Misha Brukman7e898c32004-07-20 00:41:46 +00002629 case cFP32:
2630 case cFP64:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002631 emitBinaryFPOperation(MBB, IP, Op0, Op1, 2, DestReg);
2632 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002633 break;
2634 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002635}
2636
2637
2638/// visitDivRem - Handle division and remainder instructions... these
2639/// instruction both require the same instructions to be generated, they just
2640/// select the result from a different register. Note that both of these
2641/// instructions work differently for signed and unsigned operands.
2642///
Misha Brukmana1dca552004-09-21 18:22:19 +00002643void PPC32ISel::visitDivRem(BinaryOperator &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002644 unsigned ResultReg = getReg(I);
2645 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2646
2647 MachineBasicBlock::iterator IP = BB->end();
Misha Brukman2fec9902004-06-21 20:22:03 +00002648 emitDivRemOperation(BB, IP, Op0, Op1, I.getOpcode() == Instruction::Div,
2649 ResultReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002650}
2651
Nate Begeman087d5d92004-10-06 09:53:04 +00002652void PPC32ISel::emitDivRemOperation(MachineBasicBlock *MBB,
Misha Brukmana1dca552004-09-21 18:22:19 +00002653 MachineBasicBlock::iterator IP,
2654 Value *Op0, Value *Op1, bool isDiv,
2655 unsigned ResultReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002656 const Type *Ty = Op0->getType();
2657 unsigned Class = getClass(Ty);
2658 switch (Class) {
Misha Brukman7e898c32004-07-20 00:41:46 +00002659 case cFP32:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002660 if (isDiv) {
Misha Brukman7e898c32004-07-20 00:41:46 +00002661 // Floating point divide...
Nate Begeman087d5d92004-10-06 09:53:04 +00002662 emitBinaryFPOperation(MBB, IP, Op0, Op1, 3, ResultReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002663 return;
Misha Brukman7e898c32004-07-20 00:41:46 +00002664 } else {
2665 // Floating point remainder via fmodf(float x, float y);
Nate Begeman087d5d92004-10-06 09:53:04 +00002666 unsigned Op0Reg = getReg(Op0, MBB, IP);
2667 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman7e898c32004-07-20 00:41:46 +00002668 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002669 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(fmodfFn, true);
Misha Brukman7e898c32004-07-20 00:41:46 +00002670 std::vector<ValueRecord> Args;
2671 Args.push_back(ValueRecord(Op0Reg, Type::FloatTy));
2672 Args.push_back(ValueRecord(Op1Reg, Type::FloatTy));
2673 doCall(ValueRecord(ResultReg, Type::FloatTy), TheCall, Args, false);
2674 }
2675 return;
2676 case cFP64:
2677 if (isDiv) {
2678 // Floating point divide...
Nate Begeman087d5d92004-10-06 09:53:04 +00002679 emitBinaryFPOperation(MBB, IP, Op0, Op1, 3, ResultReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00002680 return;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002681 } else {
Misha Brukman7e898c32004-07-20 00:41:46 +00002682 // Floating point remainder via fmod(double x, double y);
Nate Begeman087d5d92004-10-06 09:53:04 +00002683 unsigned Op0Reg = getReg(Op0, MBB, IP);
2684 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002685 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002686 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(fmodFn, true);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002687 std::vector<ValueRecord> Args;
2688 Args.push_back(ValueRecord(Op0Reg, Type::DoubleTy));
2689 Args.push_back(ValueRecord(Op1Reg, Type::DoubleTy));
Misha Brukmand18a31d2004-07-06 22:51:53 +00002690 doCall(ValueRecord(ResultReg, Type::DoubleTy), TheCall, Args, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002691 }
2692 return;
2693 case cLong: {
Misha Brukman7e898c32004-07-20 00:41:46 +00002694 static Function* const Funcs[] =
Misha Brukman0aa97c62004-07-08 18:27:59 +00002695 { __moddi3Fn, __divdi3Fn, __umoddi3Fn, __udivdi3Fn };
Nate Begeman087d5d92004-10-06 09:53:04 +00002696 unsigned Op0Reg = getReg(Op0, MBB, IP);
2697 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002698 unsigned NameIdx = Ty->isUnsigned()*2 + isDiv;
2699 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002700 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(Funcs[NameIdx], true);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002701
2702 std::vector<ValueRecord> Args;
2703 Args.push_back(ValueRecord(Op0Reg, Type::LongTy));
2704 Args.push_back(ValueRecord(Op1Reg, Type::LongTy));
Misha Brukmand18a31d2004-07-06 22:51:53 +00002705 doCall(ValueRecord(ResultReg, Type::LongTy), TheCall, Args, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002706 return;
2707 }
2708 case cByte: case cShort: case cInt:
2709 break; // Small integrals, handled below...
2710 default: assert(0 && "Unknown class!");
2711 }
2712
2713 // Special case signed division by power of 2.
2714 if (isDiv)
2715 if (ConstantSInt *CI = dyn_cast<ConstantSInt>(Op1)) {
2716 assert(Class != cLong && "This doesn't handle 64-bit divides!");
2717 int V = CI->getValue();
2718
2719 if (V == 1) { // X /s 1 => X
Nate Begeman087d5d92004-10-06 09:53:04 +00002720 unsigned Op0Reg = getReg(Op0, MBB, IP);
2721 BuildMI(*MBB, IP, PPC::OR, 2, ResultReg).addReg(Op0Reg).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002722 return;
2723 }
2724
2725 if (V == -1) { // X /s -1 => -X
Nate Begeman087d5d92004-10-06 09:53:04 +00002726 unsigned Op0Reg = getReg(Op0, MBB, IP);
2727 BuildMI(*MBB, IP, PPC::NEG, 1, ResultReg).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002728 return;
2729 }
2730
Misha Brukmanec6319a2004-07-20 15:51:37 +00002731 unsigned log2V = ExactLog2(V);
2732 if (log2V != 0 && Ty->isSigned()) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002733 unsigned Op0Reg = getReg(Op0, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002734 unsigned TmpReg = makeAnotherReg(Op0->getType());
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002735
Nate Begeman087d5d92004-10-06 09:53:04 +00002736 BuildMI(*MBB, IP, PPC::SRAWI, 2, TmpReg).addReg(Op0Reg).addImm(log2V);
2737 BuildMI(*MBB, IP, PPC::ADDZE, 1, ResultReg).addReg(TmpReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002738 return;
2739 }
2740 }
2741
Nate Begeman087d5d92004-10-06 09:53:04 +00002742 unsigned Op0Reg = getReg(Op0, MBB, IP);
2743
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002744 if (isDiv) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002745 unsigned Op1Reg = getReg(Op1, MBB, IP);
2746 unsigned Opcode = Ty->isSigned() ? PPC::DIVW : PPC::DIVWU;
2747 BuildMI(*MBB, IP, Opcode, 2, ResultReg).addReg(Op0Reg).addReg(Op1Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002748 } else { // Remainder
Nate Begeman087d5d92004-10-06 09:53:04 +00002749 // FIXME: don't load the CI part of a CI divide twice
2750 ConstantInt *CI = dyn_cast<ConstantInt>(Op1);
Misha Brukman422791f2004-06-21 17:41:12 +00002751 unsigned TmpReg1 = makeAnotherReg(Op0->getType());
2752 unsigned TmpReg2 = makeAnotherReg(Op0->getType());
Nate Begeman087d5d92004-10-06 09:53:04 +00002753 emitDivRemOperation(MBB, IP, Op0, Op1, true, TmpReg1);
Nate Begemanb816f022004-10-07 22:30:03 +00002754 if (CI && canUseAsImmediateForOpcode(CI, 0, false)) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002755 BuildMI(*MBB, IP, PPC::MULLI, 2, TmpReg2).addReg(TmpReg1)
2756 .addSImm(CI->getRawValue());
2757 } else {
2758 unsigned Op1Reg = getReg(Op1, MBB, IP);
2759 BuildMI(*MBB, IP, PPC::MULLW, 2, TmpReg2).addReg(TmpReg1).addReg(Op1Reg);
2760 }
2761 BuildMI(*MBB, IP, PPC::SUBF, 2, ResultReg).addReg(TmpReg2).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002762 }
2763}
2764
2765
2766/// Shift instructions: 'shl', 'sar', 'shr' - Some special cases here
2767/// for constant immediate shift values, and for constant immediate
2768/// shift values equal to 1. Even the general case is sort of special,
2769/// because the shift amount has to be in CL, not just any old register.
2770///
Misha Brukmana1dca552004-09-21 18:22:19 +00002771void PPC32ISel::visitShiftInst(ShiftInst &I) {
Nate Begeman905a2912004-10-24 10:33:30 +00002772 if (std::find(SkipList.begin(), SkipList.end(), &I) != SkipList.end())
2773 return;
2774
Misha Brukmane2eceb52004-07-23 16:08:20 +00002775 MachineBasicBlock::iterator IP = BB->end();
2776 emitShiftOperation(BB, IP, I.getOperand(0), I.getOperand(1),
2777 I.getOpcode() == Instruction::Shl, I.getType(),
Nate Begeman9b508c32004-10-26 03:48:25 +00002778 &I, getReg(I));
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002779}
2780
2781/// emitShiftOperation - Common code shared between visitShiftInst and
2782/// constant expression support.
Misha Brukman2fec9902004-06-21 20:22:03 +00002783///
Misha Brukmana1dca552004-09-21 18:22:19 +00002784void PPC32ISel::emitShiftOperation(MachineBasicBlock *MBB,
2785 MachineBasicBlock::iterator IP,
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002786 Value *Op, Value *ShiftAmount,
Nate Begeman9b508c32004-10-26 03:48:25 +00002787 bool isLeftShift, const Type *ResultTy,
2788 ShiftInst *SI, unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002789 bool isSigned = ResultTy->isSigned ();
2790 unsigned Class = getClass (ResultTy);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002791
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002792 // Longs, as usual, are handled specially...
2793 if (Class == cLong) {
Nate Begeman1b750222004-10-17 05:19:20 +00002794 unsigned SrcReg = getReg (Op, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002795 // If we have a constant shift, we can generate much more efficient code
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002796 // than for a variable shift by using the rlwimi instruction.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002797 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(ShiftAmount)) {
2798 unsigned Amount = CUI->getValue();
Chris Lattner77470402004-11-30 06:29:10 +00002799 if (Amount == 0) {
2800 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
2801 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1)
2802 .addReg(SrcReg+1).addReg(SrcReg+1);
2803
2804 } else if (Amount < 32) {
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002805 unsigned TempReg = makeAnotherReg(ResultTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002806 if (isLeftShift) {
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002807 BuildMI(*MBB, IP, PPC::RLWINM, 4, TempReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002808 .addImm(Amount).addImm(0).addImm(31-Amount);
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002809 BuildMI(*MBB, IP, PPC::RLWIMI, 5, DestReg).addReg(TempReg)
2810 .addReg(SrcReg+1).addImm(Amount).addImm(32-Amount).addImm(31);
Misha Brukman5b570812004-08-10 22:47:03 +00002811 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg+1).addReg(SrcReg+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00002812 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002813 } else {
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002814 BuildMI(*MBB, IP, PPC::RLWINM, 4, TempReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002815 .addImm(32-Amount).addImm(Amount).addImm(31);
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002816 BuildMI(*MBB, IP, PPC::RLWIMI, 5, DestReg+1).addReg(TempReg)
2817 .addReg(SrcReg).addImm(32-Amount).addImm(0).addImm(Amount-1);
Nate Begeman020ef422005-04-06 22:42:08 +00002818 if (isSigned) {
2819 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg)
2820 .addImm(Amount);
2821 } else {
2822 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
2823 .addImm(32-Amount).addImm(Amount).addImm(31);
2824 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002825 }
2826 } else { // Shifting more than 32 bits
2827 Amount -= 32;
2828 if (isLeftShift) {
2829 if (Amount != 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00002830 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002831 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002832 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002833 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002834 .addReg(SrcReg+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002835 }
Misha Brukman5b570812004-08-10 22:47:03 +00002836 BuildMI(*MBB, IP, PPC::LI, 1, DestReg+1).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00002837 } else {
2838 if (Amount != 0) {
2839 if (isSigned)
Misha Brukman5b570812004-08-10 22:47:03 +00002840 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002841 .addImm(Amount);
2842 else
Misha Brukman5b570812004-08-10 22:47:03 +00002843 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002844 .addImm(32-Amount).addImm(Amount).addImm(31);
2845 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002846 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002847 .addReg(SrcReg);
2848 }
Nate Begeman020ef422005-04-06 22:42:08 +00002849 if (isSigned)
2850 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg)
2851 .addImm(31);
2852 else
2853 BuildMI(*MBB, IP,PPC::LI, 1, DestReg).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002854 }
2855 }
2856 } else {
2857 unsigned TmpReg1 = makeAnotherReg(Type::IntTy);
2858 unsigned TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman422791f2004-06-21 17:41:12 +00002859 unsigned TmpReg3 = makeAnotherReg(Type::IntTy);
2860 unsigned TmpReg4 = makeAnotherReg(Type::IntTy);
2861 unsigned TmpReg5 = makeAnotherReg(Type::IntTy);
2862 unsigned TmpReg6 = makeAnotherReg(Type::IntTy);
2863 unsigned ShiftAmountReg = getReg (ShiftAmount, MBB, IP);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002864
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002865 if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002866 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002867 .addSImm(32);
Misha Brukman5b570812004-08-10 22:47:03 +00002868 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg2).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002869 .addReg(ShiftAmountReg);
Misha Brukman5b570812004-08-10 22:47:03 +00002870 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg3).addReg(SrcReg+1)
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002871 .addReg(TmpReg1);
Misha Brukman5b570812004-08-10 22:47:03 +00002872 BuildMI(*MBB, IP, PPC::OR, 2,TmpReg4).addReg(TmpReg2).addReg(TmpReg3);
2873 BuildMI(*MBB, IP, PPC::ADDI, 2, TmpReg5).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002874 .addSImm(-32);
Misha Brukman5b570812004-08-10 22:47:03 +00002875 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg6).addReg(SrcReg+1)
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002876 .addReg(TmpReg5);
Misha Brukman5b570812004-08-10 22:47:03 +00002877 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(TmpReg4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002878 .addReg(TmpReg6);
Misha Brukman5b570812004-08-10 22:47:03 +00002879 BuildMI(*MBB, IP, PPC::SLW, 2, DestReg+1).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002880 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002881 } else {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002882 if (isSigned) { // shift right algebraic
Nate Begemanf2f07812004-08-29 08:19:32 +00002883 MachineBasicBlock *TmpMBB =new MachineBasicBlock(BB->getBasicBlock());
2884 MachineBasicBlock *PhiMBB =new MachineBasicBlock(BB->getBasicBlock());
2885 MachineBasicBlock *OldMBB = BB;
2886 ilist<MachineBasicBlock>::iterator It = BB; ++It;
2887 F->getBasicBlockList().insert(It, TmpMBB);
2888 F->getBasicBlockList().insert(It, PhiMBB);
2889 BB->addSuccessor(TmpMBB);
2890 BB->addSuccessor(PhiMBB);
2891
2892 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
2893 .addSImm(32);
2894 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg2).addReg(SrcReg+1)
2895 .addReg(ShiftAmountReg);
2896 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg3).addReg(SrcReg)
2897 .addReg(TmpReg1);
2898 BuildMI(*MBB, IP, PPC::OR, 2, TmpReg4).addReg(TmpReg2)
2899 .addReg(TmpReg3);
2900 BuildMI(*MBB, IP, PPC::ADDICo, 2, TmpReg5).addReg(ShiftAmountReg)
2901 .addSImm(-32);
2902 BuildMI(*MBB, IP, PPC::SRAW, 2, TmpReg6).addReg(SrcReg)
2903 .addReg(TmpReg5);
2904 BuildMI(*MBB, IP, PPC::SRAW, 2, DestReg).addReg(SrcReg)
2905 .addReg(ShiftAmountReg);
2906 BuildMI(*MBB, IP, PPC::BLE, 2).addReg(PPC::CR0).addMBB(PhiMBB);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002907
Nate Begemanf2f07812004-08-29 08:19:32 +00002908 // OrMBB:
2909 // Select correct least significant half if the shift amount > 32
2910 BB = TmpMBB;
2911 unsigned OrReg = makeAnotherReg(Type::IntTy);
Chris Lattner35f2bbe2004-11-30 06:40:04 +00002912 BuildMI(BB, PPC::OR, 2, OrReg).addReg(TmpReg6).addReg(TmpReg6);
Nate Begemanf2f07812004-08-29 08:19:32 +00002913 TmpMBB->addSuccessor(PhiMBB);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002914
Nate Begemanf2f07812004-08-29 08:19:32 +00002915 BB = PhiMBB;
2916 BuildMI(BB, PPC::PHI, 4, DestReg+1).addReg(TmpReg4).addMBB(OldMBB)
2917 .addReg(OrReg).addMBB(TmpMBB);
2918 } else { // shift right logical
Misha Brukman5b570812004-08-10 22:47:03 +00002919 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002920 .addSImm(32);
Misha Brukman5b570812004-08-10 22:47:03 +00002921 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg2).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002922 .addReg(ShiftAmountReg);
Misha Brukman5b570812004-08-10 22:47:03 +00002923 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg3).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002924 .addReg(TmpReg1);
Misha Brukman5b570812004-08-10 22:47:03 +00002925 BuildMI(*MBB, IP, PPC::OR, 2, TmpReg4).addReg(TmpReg2)
Misha Brukman2fec9902004-06-21 20:22:03 +00002926 .addReg(TmpReg3);
Misha Brukman5b570812004-08-10 22:47:03 +00002927 BuildMI(*MBB, IP, PPC::ADDI, 2, TmpReg5).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002928 .addSImm(-32);
Misha Brukman5b570812004-08-10 22:47:03 +00002929 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg6).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002930 .addReg(TmpReg5);
Misha Brukman5b570812004-08-10 22:47:03 +00002931 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(TmpReg4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002932 .addReg(TmpReg6);
Misha Brukman5b570812004-08-10 22:47:03 +00002933 BuildMI(*MBB, IP, PPC::SRW, 2, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002934 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002935 }
2936 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002937 }
2938 return;
2939 }
2940
2941 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(ShiftAmount)) {
2942 // The shift amount is constant, guaranteed to be a ubyte. Get its value.
2943 assert(CUI->getType() == Type::UByteTy && "Shift amount not a ubyte?");
2944 unsigned Amount = CUI->getValue();
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002945
Nate Begeman905a2912004-10-24 10:33:30 +00002946 // If this is a shift with one use, and that use is an And instruction,
2947 // then attempt to emit a bitfield operation.
Nate Begeman9b508c32004-10-26 03:48:25 +00002948 if (SI && emitBitfieldInsert(SI, DestReg))
2949 return;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002950
Nate Begeman1b750222004-10-17 05:19:20 +00002951 unsigned SrcReg = getReg (Op, MBB, IP);
Chris Lattnere74ed0d2004-11-30 06:36:11 +00002952 if (Amount == 0) {
2953 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
2954 } else if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002955 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002956 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman422791f2004-06-21 17:41:12 +00002957 } else {
Misha Brukman2fec9902004-06-21 20:22:03 +00002958 if (isSigned) {
Misha Brukman5b570812004-08-10 22:47:03 +00002959 BuildMI(*MBB, IP, PPC::SRAWI,2,DestReg).addReg(SrcReg).addImm(Amount);
Misha Brukman2fec9902004-06-21 20:22:03 +00002960 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002961 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002962 .addImm(32-Amount).addImm(Amount).addImm(31);
2963 }
Misha Brukman422791f2004-06-21 17:41:12 +00002964 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002965 } else { // The shift amount is non-constant.
Nate Begeman1b750222004-10-17 05:19:20 +00002966 unsigned SrcReg = getReg (Op, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002967 unsigned ShiftAmountReg = getReg (ShiftAmount, MBB, IP);
2968
Misha Brukman422791f2004-06-21 17:41:12 +00002969 if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002970 BuildMI(*MBB, IP, PPC::SLW, 2, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002971 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002972 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002973 BuildMI(*MBB, IP, isSigned ? PPC::SRAW : PPC::SRW, 2, DestReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002974 .addReg(SrcReg).addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002975 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002976 }
2977}
2978
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002979/// LoadNeedsSignExtend - On PowerPC, there is no load byte with sign extend.
2980/// Therefore, if this is a byte load and the destination type is signed, we
Nate Begeman35b020d2004-10-06 11:03:30 +00002981/// would normally need to also emit a sign extend instruction after the load.
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002982/// However, store instructions don't care whether a signed type was sign
2983/// extended across a whole register. Also, a SetCC instruction will emit its
2984/// own sign extension to force the value into the appropriate range, so we
2985/// need not emit it here. Ideally, this kind of thing wouldn't be necessary
2986/// once LLVM's type system is improved.
2987static bool LoadNeedsSignExtend(LoadInst &LI) {
2988 if (cByte == getClassB(LI.getType()) && LI.getType()->isSigned()) {
2989 bool AllUsesAreStoresOrSetCC = true;
Nate Begeman35b020d2004-10-06 11:03:30 +00002990 for (Value::use_iterator I = LI.use_begin(), E = LI.use_end(); I != E; ++I){
Chris Lattner7c348e12004-10-06 16:28:24 +00002991 if (isa<SetCondInst>(*I))
Nate Begeman35b020d2004-10-06 11:03:30 +00002992 continue;
Chris Lattner7c348e12004-10-06 16:28:24 +00002993 if (StoreInst *SI = dyn_cast<StoreInst>(*I))
Nate Begemanb816f022004-10-07 22:30:03 +00002994 if (cByte == getClassB(SI->getOperand(0)->getType()))
Nate Begeman35b020d2004-10-06 11:03:30 +00002995 continue;
2996 AllUsesAreStoresOrSetCC = false;
2997 break;
2998 }
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002999 if (!AllUsesAreStoresOrSetCC)
3000 return true;
3001 }
3002 return false;
3003}
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003004
Misha Brukmanb097f212004-07-26 18:13:24 +00003005/// visitLoadInst - Implement LLVM load instructions. Pretty straightforward
3006/// mapping of LLVM classes to PPC load instructions, with the exception of
3007/// signed byte loads, which need a sign extension following them.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003008///
Misha Brukmana1dca552004-09-21 18:22:19 +00003009void PPC32ISel::visitLoadInst(LoadInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003010 // Immediate opcodes, for reg+imm addressing
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003011 static const unsigned ImmOpcodes[] = {
3012 PPC::LBZ, PPC::LHZ, PPC::LWZ,
Misha Brukman5b570812004-08-10 22:47:03 +00003013 PPC::LFS, PPC::LFD, PPC::LWZ
Misha Brukmanb097f212004-07-26 18:13:24 +00003014 };
3015 // Indexed opcodes, for reg+reg addressing
3016 static const unsigned IdxOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00003017 PPC::LBZX, PPC::LHZX, PPC::LWZX,
3018 PPC::LFSX, PPC::LFDX, PPC::LWZX
Misha Brukman2fec9902004-06-21 20:22:03 +00003019 };
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003020
Misha Brukmanb097f212004-07-26 18:13:24 +00003021 unsigned Class = getClassB(I.getType());
3022 unsigned ImmOpcode = ImmOpcodes[Class];
3023 unsigned IdxOpcode = IdxOpcodes[Class];
3024 unsigned DestReg = getReg(I);
3025 Value *SourceAddr = I.getOperand(0);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003026
Misha Brukman5b570812004-08-10 22:47:03 +00003027 if (Class == cShort && I.getType()->isSigned()) ImmOpcode = PPC::LHA;
3028 if (Class == cShort && I.getType()->isSigned()) IdxOpcode = PPC::LHAX;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003029
Nate Begeman53e4aa52004-11-24 21:53:14 +00003030 // If this is a fixed size alloca, emit a load directly from the stack slot
3031 // corresponding to it.
Misha Brukmanb097f212004-07-26 18:13:24 +00003032 if (AllocaInst *AI = dyn_castFixedAlloca(SourceAddr)) {
Misha Brukman422791f2004-06-21 17:41:12 +00003033 unsigned FI = getFixedSizedAllocaFI(AI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003034 if (Class == cLong) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003035 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg), FI);
3036 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg+1), FI, 4);
Nate Begeman0e5e5f52004-08-22 08:10:15 +00003037 } else if (LoadNeedsSignExtend(I)) {
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003038 unsigned TmpReg = makeAnotherReg(I.getType());
Misha Brukmanb097f212004-07-26 18:13:24 +00003039 addFrameReference(BuildMI(BB, ImmOpcode, 2, TmpReg), FI);
Misha Brukman5b570812004-08-10 22:47:03 +00003040 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003041 } else {
Misha Brukmanb097f212004-07-26 18:13:24 +00003042 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +00003043 }
Misha Brukmanb097f212004-07-26 18:13:24 +00003044 return;
3045 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003046
Nate Begeman645495d2004-09-23 05:31:33 +00003047 // If the offset fits in 16 bits, we can emit a reg+imm load, otherwise, we
3048 // use the index from the FoldedGEP struct and use reg+reg addressing.
Misha Brukmanb097f212004-07-26 18:13:24 +00003049 if (GetElementPtrInst *GEPI = canFoldGEPIntoLoadOrStore(SourceAddr)) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003050
Nate Begeman645495d2004-09-23 05:31:33 +00003051 // Generate the code for the GEP and get the components of the folded GEP
3052 emitGEPOperation(BB, BB->end(), GEPI, true);
3053 unsigned baseReg = GEPMap[GEPI].base;
3054 unsigned indexReg = GEPMap[GEPI].index;
3055 ConstantSInt *offset = GEPMap[GEPI].offset;
3056
3057 if (Class != cLong) {
Nate Begemanbc3a5372004-11-19 08:01:16 +00003058 unsigned TmpReg = LoadNeedsSignExtend(I) ? makeAnotherReg(I.getType())
3059 : DestReg;
Nate Begeman645495d2004-09-23 05:31:33 +00003060 if (indexReg == 0)
Misha Brukmanb097f212004-07-26 18:13:24 +00003061 BuildMI(BB, ImmOpcode, 2, TmpReg).addSImm(offset->getValue())
3062 .addReg(baseReg);
Nate Begeman645495d2004-09-23 05:31:33 +00003063 else
3064 BuildMI(BB, IdxOpcode, 2, TmpReg).addReg(indexReg).addReg(baseReg);
3065 if (LoadNeedsSignExtend(I))
Misha Brukman5b570812004-08-10 22:47:03 +00003066 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Nate Begeman645495d2004-09-23 05:31:33 +00003067 } else {
3068 indexReg = (indexReg != 0) ? indexReg : getReg(offset);
Misha Brukmanb097f212004-07-26 18:13:24 +00003069 unsigned indexPlus4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003070 BuildMI(BB, PPC::ADDI, 2, indexPlus4).addReg(indexReg).addSImm(4);
Misha Brukmanb097f212004-07-26 18:13:24 +00003071 BuildMI(BB, IdxOpcode, 2, DestReg).addReg(indexReg).addReg(baseReg);
3072 BuildMI(BB, IdxOpcode, 2, DestReg+1).addReg(indexPlus4).addReg(baseReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003073 }
Misha Brukmanb097f212004-07-26 18:13:24 +00003074 return;
3075 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003076
Misha Brukmanb097f212004-07-26 18:13:24 +00003077 // The fallback case, where the load was from a source that could not be
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003078 // folded into the load instruction.
Misha Brukmanb097f212004-07-26 18:13:24 +00003079 unsigned SrcAddrReg = getReg(SourceAddr);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003080
Misha Brukmanb097f212004-07-26 18:13:24 +00003081 if (Class == cLong) {
3082 BuildMI(BB, ImmOpcode, 2, DestReg).addSImm(0).addReg(SrcAddrReg);
3083 BuildMI(BB, ImmOpcode, 2, DestReg+1).addSImm(4).addReg(SrcAddrReg);
Nate Begeman0e5e5f52004-08-22 08:10:15 +00003084 } else if (LoadNeedsSignExtend(I)) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003085 unsigned TmpReg = makeAnotherReg(I.getType());
3086 BuildMI(BB, ImmOpcode, 2, TmpReg).addSImm(0).addReg(SrcAddrReg);
Misha Brukman5b570812004-08-10 22:47:03 +00003087 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003088 } else {
3089 BuildMI(BB, ImmOpcode, 2, DestReg).addSImm(0).addReg(SrcAddrReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003090 }
3091}
3092
3093/// visitStoreInst - Implement LLVM store instructions
3094///
Misha Brukmana1dca552004-09-21 18:22:19 +00003095void PPC32ISel::visitStoreInst(StoreInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003096 // Immediate opcodes, for reg+imm addressing
3097 static const unsigned ImmOpcodes[] = {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003098 PPC::STB, PPC::STH, PPC::STW,
Misha Brukman5b570812004-08-10 22:47:03 +00003099 PPC::STFS, PPC::STFD, PPC::STW
Misha Brukmanb097f212004-07-26 18:13:24 +00003100 };
3101 // Indexed opcodes, for reg+reg addressing
3102 static const unsigned IdxOpcodes[] = {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003103 PPC::STBX, PPC::STHX, PPC::STWX,
Misha Brukman5b570812004-08-10 22:47:03 +00003104 PPC::STFSX, PPC::STFDX, PPC::STWX
Misha Brukmanb097f212004-07-26 18:13:24 +00003105 };
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003106
Misha Brukmanb097f212004-07-26 18:13:24 +00003107 Value *SourceAddr = I.getOperand(1);
3108 const Type *ValTy = I.getOperand(0)->getType();
3109 unsigned Class = getClassB(ValTy);
3110 unsigned ImmOpcode = ImmOpcodes[Class];
3111 unsigned IdxOpcode = IdxOpcodes[Class];
3112 unsigned ValReg = getReg(I.getOperand(0));
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003113
Nate Begeman53e4aa52004-11-24 21:53:14 +00003114 // If this is a fixed size alloca, emit a store directly to the stack slot
3115 // corresponding to it.
3116 if (AllocaInst *AI = dyn_castFixedAlloca(SourceAddr)) {
3117 unsigned FI = getFixedSizedAllocaFI(AI);
3118 addFrameReference(BuildMI(BB, ImmOpcode, 3).addReg(ValReg), FI);
3119 if (Class == cLong)
3120 addFrameReference(BuildMI(BB, ImmOpcode, 3).addReg(ValReg+1), FI, 4);
3121 return;
3122 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003123
Nate Begeman645495d2004-09-23 05:31:33 +00003124 // If the offset fits in 16 bits, we can emit a reg+imm store, otherwise, we
3125 // use the index from the FoldedGEP struct and use reg+reg addressing.
Misha Brukmanb097f212004-07-26 18:13:24 +00003126 if (GetElementPtrInst *GEPI = canFoldGEPIntoLoadOrStore(SourceAddr)) {
Nate Begeman645495d2004-09-23 05:31:33 +00003127 // Generate the code for the GEP and get the components of the folded GEP
3128 emitGEPOperation(BB, BB->end(), GEPI, true);
3129 unsigned baseReg = GEPMap[GEPI].base;
3130 unsigned indexReg = GEPMap[GEPI].index;
3131 ConstantSInt *offset = GEPMap[GEPI].offset;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003132
Nate Begeman645495d2004-09-23 05:31:33 +00003133 if (Class != cLong) {
3134 if (indexReg == 0)
3135 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(offset->getValue())
3136 .addReg(baseReg);
3137 else
3138 BuildMI(BB, IdxOpcode, 3).addReg(ValReg).addReg(indexReg)
3139 .addReg(baseReg);
3140 } else {
3141 indexReg = (indexReg != 0) ? indexReg : getReg(offset);
Misha Brukmanb097f212004-07-26 18:13:24 +00003142 unsigned indexPlus4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003143 BuildMI(BB, PPC::ADDI, 2, indexPlus4).addReg(indexReg).addSImm(4);
Misha Brukmanb097f212004-07-26 18:13:24 +00003144 BuildMI(BB, IdxOpcode, 3).addReg(ValReg).addReg(indexReg).addReg(baseReg);
3145 BuildMI(BB, IdxOpcode, 3).addReg(ValReg+1).addReg(indexPlus4)
3146 .addReg(baseReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003147 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003148 return;
3149 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003150
Misha Brukmanb097f212004-07-26 18:13:24 +00003151 // If the store address wasn't the only use of a GEP, we fall back to the
3152 // standard path: store the ValReg at the value in AddressReg.
3153 unsigned AddressReg = getReg(I.getOperand(1));
3154 if (Class == cLong) {
3155 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(0).addReg(AddressReg);
3156 BuildMI(BB, ImmOpcode, 3).addReg(ValReg+1).addSImm(4).addReg(AddressReg);
3157 return;
3158 }
3159 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(0).addReg(AddressReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003160}
3161
3162
3163/// visitCastInst - Here we have various kinds of copying with or without sign
3164/// extension going on.
3165///
Misha Brukmana1dca552004-09-21 18:22:19 +00003166void PPC32ISel::visitCastInst(CastInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003167 Value *Op = CI.getOperand(0);
3168
3169 unsigned SrcClass = getClassB(Op->getType());
3170 unsigned DestClass = getClassB(CI.getType());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003171
Nate Begeman676dee62004-11-08 02:25:40 +00003172 // Noop casts are not emitted: getReg will return the source operand as the
3173 // register to use for any uses of the noop cast.
3174 if (DestClass == SrcClass) return;
3175
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003176 // 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 +00003177 // of the cast are GEP instructions, then the cast does not need to be
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003178 // generated explicitly, it will be folded into the GEP.
3179 if (DestClass == cLong && SrcClass == cInt) {
3180 bool AllUsesAreGEPs = true;
3181 for (Value::use_iterator I = CI.use_begin(), E = CI.use_end(); I != E; ++I)
3182 if (!isa<GetElementPtrInst>(*I)) {
3183 AllUsesAreGEPs = false;
3184 break;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003185 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003186 if (AllUsesAreGEPs) return;
3187 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003188
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003189 unsigned DestReg = getReg(CI);
3190 MachineBasicBlock::iterator MI = BB->end();
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003191
Nate Begeman31dfc522004-10-23 00:50:23 +00003192 // If this is a cast from an integer type to a ubyte, with one use where the
3193 // use is the shift amount argument of a shift instruction, just emit a move
3194 // instead (since the shift instruction will only look at the low 5 bits
3195 // regardless of how it is sign extended)
3196 if (CI.getType() == Type::UByteTy && SrcClass <= cInt && CI.hasOneUse()) {
3197 ShiftInst *SI = dyn_cast<ShiftInst>(*(CI.use_begin()));
3198 if (SI && (SI->getOperand(1) == &CI)) {
3199 unsigned SrcReg = getReg(Op, BB, MI);
3200 BuildMI(*BB, MI, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003201 return;
Nate Begeman31dfc522004-10-23 00:50:23 +00003202 }
3203 }
3204
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003205 // If this is a cast from an byte, short, or int to an integer type of equal
3206 // or lesser width, and all uses of the cast are store instructions then dont
3207 // emit them, as the store instruction will implicitly not store the zero or
3208 // sign extended bytes.
3209 if (SrcClass <= cInt && SrcClass >= DestClass) {
Nate Begeman075cdc62004-11-07 20:23:42 +00003210 bool AllUsesAreStores = true;
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003211 for (Value::use_iterator I = CI.use_begin(), E = CI.use_end(); I != E; ++I)
Nate Begeman075cdc62004-11-07 20:23:42 +00003212 if (!isa<StoreInst>(*I)) {
3213 AllUsesAreStores = false;
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003214 break;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003215 }
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003216 // Turn this cast directly into a move instruction, which the register
3217 // allocator will deal with.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003218 if (AllUsesAreStores) {
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003219 unsigned SrcReg = getReg(Op, BB, MI);
3220 BuildMI(*BB, MI, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003221 return;
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003222 }
3223 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003224 emitCastOperation(BB, MI, Op, CI.getType(), DestReg);
3225}
3226
3227/// emitCastOperation - Common code shared between visitCastInst and constant
3228/// expression cast support.
3229///
Misha Brukmana1dca552004-09-21 18:22:19 +00003230void PPC32ISel::emitCastOperation(MachineBasicBlock *MBB,
3231 MachineBasicBlock::iterator IP,
3232 Value *Src, const Type *DestTy,
3233 unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003234 const Type *SrcTy = Src->getType();
3235 unsigned SrcClass = getClassB(SrcTy);
3236 unsigned DestClass = getClassB(DestTy);
Misha Brukman7e898c32004-07-20 00:41:46 +00003237 unsigned SrcReg = getReg(Src, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003238
Nate Begeman0797d492004-10-20 21:55:41 +00003239 // Implement casts from bool to integer types as a move operation
3240 if (SrcTy == Type::BoolTy) {
3241 switch (DestClass) {
3242 case cByte:
3243 case cShort:
3244 case cInt:
3245 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3246 return;
3247 case cLong:
3248 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addImm(0);
3249 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg).addReg(SrcReg);
3250 return;
3251 default:
3252 break;
3253 }
3254 }
3255
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003256 // Implement casts to bool by using compare on the operand followed by set if
3257 // not zero on the result.
3258 if (DestTy == Type::BoolTy) {
3259 switch (SrcClass) {
3260 case cByte:
Misha Brukman422791f2004-06-21 17:41:12 +00003261 case cShort:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003262 case cInt: {
3263 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003264 BuildMI(*MBB, IP, PPC::ADDIC, 2, TmpReg).addReg(SrcReg).addSImm(-1);
3265 BuildMI(*MBB, IP, PPC::SUBFE, 2, DestReg).addReg(TmpReg).addReg(SrcReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003266 break;
3267 }
3268 case cLong: {
3269 unsigned TmpReg = makeAnotherReg(Type::IntTy);
3270 unsigned SrcReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003271 BuildMI(*MBB, IP, PPC::OR, 2, SrcReg2).addReg(SrcReg).addReg(SrcReg+1);
3272 BuildMI(*MBB, IP, PPC::ADDIC, 2, TmpReg).addReg(SrcReg2).addSImm(-1);
3273 BuildMI(*MBB, IP, PPC::SUBFE, 2, DestReg).addReg(TmpReg)
Misha Brukmanbf417a62004-07-20 20:43:05 +00003274 .addReg(SrcReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003275 break;
3276 }
Misha Brukman7e898c32004-07-20 00:41:46 +00003277 case cFP32:
3278 case cFP64:
Nate Begemanf2f07812004-08-29 08:19:32 +00003279 unsigned TmpReg = makeAnotherReg(Type::IntTy);
3280 unsigned ConstZero = getReg(ConstantFP::get(Type::DoubleTy, 0.0), BB, IP);
3281 BuildMI(*MBB, IP, PPC::FCMPU, PPC::CR7).addReg(SrcReg).addReg(ConstZero);
3282 BuildMI(*MBB, IP, PPC::MFCR, TmpReg);
3283 BuildMI(*MBB, IP, PPC::RLWINM, DestReg).addReg(TmpReg).addImm(31)
3284 .addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003285 }
3286 return;
3287 }
3288
Misha Brukman7e898c32004-07-20 00:41:46 +00003289 // Handle cast of Float -> Double
3290 if (SrcClass == cFP32 && DestClass == cFP64) {
Misha Brukman5b570812004-08-10 22:47:03 +00003291 BuildMI(*MBB, IP, PPC::FMR, 1, DestReg).addReg(SrcReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00003292 return;
3293 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003294
Misha Brukman7e898c32004-07-20 00:41:46 +00003295 // Handle cast of Double -> Float
3296 if (SrcClass == cFP64 && DestClass == cFP32) {
Misha Brukman5b570812004-08-10 22:47:03 +00003297 BuildMI(*MBB, IP, PPC::FRSP, 1, DestReg).addReg(SrcReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00003298 return;
3299 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003300
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003301 // Handle casts from integer to floating point now...
Misha Brukman7e898c32004-07-20 00:41:46 +00003302 if (DestClass == cFP32 || DestClass == cFP64) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003303
Misha Brukman422791f2004-06-21 17:41:12 +00003304 // Emit a library call for long to float conversion
3305 if (SrcClass == cLong) {
Misha Brukman7e898c32004-07-20 00:41:46 +00003306 Function *floatFn = (DestClass == cFP32) ? __floatdisfFn : __floatdidfFn;
Nate Begemanf2f07812004-08-29 08:19:32 +00003307 if (SrcTy->isSigned()) {
3308 std::vector<ValueRecord> Args;
3309 Args.push_back(ValueRecord(SrcReg, SrcTy));
3310 MachineInstr *TheCall =
3311 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3312 doCall(ValueRecord(DestReg, DestTy), TheCall, Args, false);
Nate Begemanf2f07812004-08-29 08:19:32 +00003313 } else {
3314 std::vector<ValueRecord> CmpArgs, ClrArgs, SetArgs;
3315 unsigned ZeroLong = getReg(ConstantUInt::get(SrcTy, 0));
3316 unsigned CondReg = makeAnotherReg(Type::IntTy);
3317
3318 // Update machine-CFG edges
3319 MachineBasicBlock *ClrMBB = new MachineBasicBlock(BB->getBasicBlock());
3320 MachineBasicBlock *SetMBB = new MachineBasicBlock(BB->getBasicBlock());
3321 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
3322 MachineBasicBlock *OldMBB = BB;
3323 ilist<MachineBasicBlock>::iterator It = BB; ++It;
3324 F->getBasicBlockList().insert(It, ClrMBB);
3325 F->getBasicBlockList().insert(It, SetMBB);
3326 F->getBasicBlockList().insert(It, PhiMBB);
3327 BB->addSuccessor(ClrMBB);
3328 BB->addSuccessor(SetMBB);
3329
3330 CmpArgs.push_back(ValueRecord(SrcReg, SrcTy));
3331 CmpArgs.push_back(ValueRecord(ZeroLong, SrcTy));
3332 MachineInstr *TheCall =
3333 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(__cmpdi2Fn, true);
3334 doCall(ValueRecord(CondReg, Type::IntTy), TheCall, CmpArgs, false);
Nate Begemanf2f07812004-08-29 08:19:32 +00003335 BuildMI(*MBB, IP, PPC::CMPWI, 2, PPC::CR0).addReg(CondReg).addSImm(0);
3336 BuildMI(*MBB, IP, PPC::BLE, 2).addReg(PPC::CR0).addMBB(SetMBB);
3337
3338 // ClrMBB
3339 BB = ClrMBB;
3340 unsigned ClrReg = makeAnotherReg(DestTy);
3341 ClrArgs.push_back(ValueRecord(SrcReg, SrcTy));
3342 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3343 doCall(ValueRecord(ClrReg, DestTy), TheCall, ClrArgs, false);
Nate Begemanf2f07812004-08-29 08:19:32 +00003344 BuildMI(BB, PPC::B, 1).addMBB(PhiMBB);
3345 BB->addSuccessor(PhiMBB);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003346
Nate Begemanf2f07812004-08-29 08:19:32 +00003347 // SetMBB
3348 BB = SetMBB;
3349 unsigned SetReg = makeAnotherReg(DestTy);
3350 unsigned CallReg = makeAnotherReg(DestTy);
3351 unsigned ShiftedReg = makeAnotherReg(SrcTy);
3352 ConstantSInt *Const1 = ConstantSInt::get(Type::IntTy, 1);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003353 emitShiftOperation(BB, BB->end(), Src, Const1, false, SrcTy, 0,
Nate Begeman9b508c32004-10-26 03:48:25 +00003354 ShiftedReg);
Nate Begemanf2f07812004-08-29 08:19:32 +00003355 SetArgs.push_back(ValueRecord(ShiftedReg, SrcTy));
3356 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3357 doCall(ValueRecord(CallReg, DestTy), TheCall, SetArgs, false);
Nate Begemanf2f07812004-08-29 08:19:32 +00003358 unsigned SetOpcode = (DestClass == cFP32) ? PPC::FADDS : PPC::FADD;
3359 BuildMI(BB, SetOpcode, 2, SetReg).addReg(CallReg).addReg(CallReg);
3360 BB->addSuccessor(PhiMBB);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003361
Nate Begemanf2f07812004-08-29 08:19:32 +00003362 // PhiMBB
3363 BB = PhiMBB;
3364 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(ClrReg).addMBB(ClrMBB)
3365 .addReg(SetReg).addMBB(SetMBB);
3366 }
Misha Brukman422791f2004-06-21 17:41:12 +00003367 return;
3368 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003369
Misha Brukman7e898c32004-07-20 00:41:46 +00003370 // Make sure we're dealing with a full 32 bits
Nate Begeman8531f6f2004-11-19 02:06:40 +00003371 if (SrcClass < cInt) {
3372 unsigned TmpReg = makeAnotherReg(Type::IntTy);
3373 promote32(TmpReg, ValueRecord(SrcReg, SrcTy));
3374 SrcReg = TmpReg;
3375 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003376
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003377 // Spill the integer to memory and reload it from there.
Misha Brukman422791f2004-06-21 17:41:12 +00003378 // Also spill room for a special conversion constant
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003379 int ValueFrameIdx =
3380 F->getFrameInfo()->CreateStackObject(Type::DoubleTy, TM.getTargetData());
3381
Misha Brukman422791f2004-06-21 17:41:12 +00003382 unsigned constantHi = makeAnotherReg(Type::IntTy);
Misha Brukman422791f2004-06-21 17:41:12 +00003383 unsigned TempF = makeAnotherReg(Type::DoubleTy);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003384
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003385 if (!SrcTy->isSigned()) {
Nate Begeman81d265d2004-08-19 05:20:54 +00003386 ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, 0x1.000000p52);
3387 unsigned ConstF = getReg(CFP, BB, IP);
Nate Begemanf2f07812004-08-29 08:19:32 +00003388 BuildMI(*MBB, IP, PPC::LIS, 1, constantHi).addSImm(0x4330);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003389 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(constantHi),
Misha Brukman2fec9902004-06-21 20:22:03 +00003390 ValueFrameIdx);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003391 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(SrcReg),
Misha Brukman2fec9902004-06-21 20:22:03 +00003392 ValueFrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003393 addFrameReference(BuildMI(*MBB, IP, PPC::LFD, 2, TempF), ValueFrameIdx);
3394 BuildMI(*MBB, IP, PPC::FSUB, 2, DestReg).addReg(TempF).addReg(ConstF);
Misha Brukman422791f2004-06-21 17:41:12 +00003395 } else {
Nate Begeman81d265d2004-08-19 05:20:54 +00003396 ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, 0x1.000008p52);
3397 unsigned ConstF = getReg(CFP, BB, IP);
Misha Brukman422791f2004-06-21 17:41:12 +00003398 unsigned TempLo = makeAnotherReg(Type::IntTy);
Nate Begemanf2f07812004-08-29 08:19:32 +00003399 BuildMI(*MBB, IP, PPC::LIS, 1, constantHi).addSImm(0x4330);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003400 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(constantHi),
Misha Brukman2fec9902004-06-21 20:22:03 +00003401 ValueFrameIdx);
Nate Begemanf2f07812004-08-29 08:19:32 +00003402 BuildMI(*MBB, IP, PPC::XORIS, 2, TempLo).addReg(SrcReg).addImm(0x8000);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003403 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(TempLo),
Misha Brukman2fec9902004-06-21 20:22:03 +00003404 ValueFrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003405 addFrameReference(BuildMI(*MBB, IP, PPC::LFD, 2, TempF), ValueFrameIdx);
3406 BuildMI(*MBB, IP, PPC::FSUB, 2, DestReg).addReg(TempF).addReg(ConstF);
Misha Brukman422791f2004-06-21 17:41:12 +00003407 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003408 return;
3409 }
3410
3411 // Handle casts from floating point to integer now...
Misha Brukman7e898c32004-07-20 00:41:46 +00003412 if (SrcClass == cFP32 || SrcClass == cFP64) {
Nate Begemanb64af912004-08-10 20:42:36 +00003413 static Function* const Funcs[] =
3414 { __fixsfdiFn, __fixdfdiFn, __fixunssfdiFn, __fixunsdfdiFn };
Misha Brukman422791f2004-06-21 17:41:12 +00003415 // emit library call
3416 if (DestClass == cLong) {
Nate Begemanb64af912004-08-10 20:42:36 +00003417 bool isDouble = SrcClass == cFP64;
3418 unsigned nameIndex = 2 * DestTy->isSigned() + isDouble;
Misha Brukman422791f2004-06-21 17:41:12 +00003419 std::vector<ValueRecord> Args;
3420 Args.push_back(ValueRecord(SrcReg, SrcTy));
Nate Begemanb64af912004-08-10 20:42:36 +00003421 Function *floatFn = Funcs[nameIndex];
Misha Brukman2fec9902004-06-21 20:22:03 +00003422 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003423 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003424 doCall(ValueRecord(DestReg, DestTy), TheCall, Args, false);
Misha Brukman422791f2004-06-21 17:41:12 +00003425 return;
3426 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003427
3428 int ValueFrameIdx =
Nate Begeman43d64ea2004-08-15 06:42:28 +00003429 F->getFrameInfo()->CreateStackObject(Type::DoubleTy, TM.getTargetData());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003430
Misha Brukman7e898c32004-07-20 00:41:46 +00003431 if (DestTy->isSigned()) {
Misha Brukman4c14f332004-07-23 01:11:19 +00003432 unsigned TempReg = makeAnotherReg(Type::DoubleTy);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003433
Misha Brukman4c14f332004-07-23 01:11:19 +00003434 // Convert to integer in the FP reg and store it to a stack slot
Nate Begemanf2f07812004-08-29 08:19:32 +00003435 BuildMI(*MBB, IP, PPC::FCTIWZ, 1, TempReg).addReg(SrcReg);
3436 addFrameReference(BuildMI(*MBB, IP, PPC::STFD, 3)
Misha Brukman4c14f332004-07-23 01:11:19 +00003437 .addReg(TempReg), ValueFrameIdx);
Misha Brukmanb097f212004-07-26 18:13:24 +00003438
3439 // There is no load signed byte opcode, so we must emit a sign extend for
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003440 // that particular size. Make sure to source the new integer from the
Misha Brukmanb097f212004-07-26 18:13:24 +00003441 // correct offset.
Misha Brukman4c14f332004-07-23 01:11:19 +00003442 if (DestClass == cByte) {
3443 unsigned TempReg2 = makeAnotherReg(DestTy);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003444 addFrameReference(BuildMI(*MBB, IP, PPC::LBZ, 2, TempReg2),
Misha Brukmanb097f212004-07-26 18:13:24 +00003445 ValueFrameIdx, 7);
Nate Begemanf2f07812004-08-29 08:19:32 +00003446 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(TempReg2);
Misha Brukman4c14f332004-07-23 01:11:19 +00003447 } else {
Misha Brukmanb097f212004-07-26 18:13:24 +00003448 int offset = (DestClass == cShort) ? 6 : 4;
Misha Brukman5b570812004-08-10 22:47:03 +00003449 unsigned LoadOp = (DestClass == cShort) ? PPC::LHA : PPC::LWZ;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003450 addFrameReference(BuildMI(*MBB, IP, LoadOp, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003451 ValueFrameIdx, offset);
Misha Brukman4c14f332004-07-23 01:11:19 +00003452 }
Misha Brukman7e898c32004-07-20 00:41:46 +00003453 } else {
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003454 unsigned Zero = getReg(ConstantFP::get(Type::DoubleTy, 0.0f));
3455 double maxInt = (1LL << 32) - 1;
3456 unsigned MaxInt = getReg(ConstantFP::get(Type::DoubleTy, maxInt));
3457 double border = 1LL << 31;
3458 unsigned Border = getReg(ConstantFP::get(Type::DoubleTy, border));
3459 unsigned UseZero = makeAnotherReg(Type::DoubleTy);
3460 unsigned UseMaxInt = makeAnotherReg(Type::DoubleTy);
3461 unsigned UseChoice = makeAnotherReg(Type::DoubleTy);
3462 unsigned TmpReg = makeAnotherReg(Type::DoubleTy);
3463 unsigned TmpReg2 = makeAnotherReg(Type::DoubleTy);
3464 unsigned ConvReg = makeAnotherReg(Type::DoubleTy);
3465 unsigned IntTmp = makeAnotherReg(Type::IntTy);
3466 unsigned XorReg = makeAnotherReg(Type::IntTy);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003467 int FrameIdx =
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003468 F->getFrameInfo()->CreateStackObject(SrcTy, TM.getTargetData());
3469 // Update machine-CFG edges
3470 MachineBasicBlock *XorMBB = new MachineBasicBlock(BB->getBasicBlock());
3471 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
3472 MachineBasicBlock *OldMBB = BB;
3473 ilist<MachineBasicBlock>::iterator It = BB; ++It;
3474 F->getBasicBlockList().insert(It, XorMBB);
3475 F->getBasicBlockList().insert(It, PhiMBB);
3476 BB->addSuccessor(XorMBB);
3477 BB->addSuccessor(PhiMBB);
3478
3479 // Convert from floating point to unsigned 32-bit value
3480 // Use 0 if incoming value is < 0.0
Nate Begemanf2f07812004-08-29 08:19:32 +00003481 BuildMI(*MBB, IP, PPC::FSEL, 3, UseZero).addReg(SrcReg).addReg(SrcReg)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003482 .addReg(Zero);
3483 // Use 2**32 - 1 if incoming value is >= 2**32
Nate Begemanf2f07812004-08-29 08:19:32 +00003484 BuildMI(*MBB, IP, PPC::FSUB, 2, UseMaxInt).addReg(MaxInt).addReg(SrcReg);
3485 BuildMI(*MBB, IP, PPC::FSEL, 3, UseChoice).addReg(UseMaxInt)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003486 .addReg(UseZero).addReg(MaxInt);
3487 // Subtract 2**31
Nate Begemanf2f07812004-08-29 08:19:32 +00003488 BuildMI(*MBB, IP, PPC::FSUB, 2, TmpReg).addReg(UseChoice).addReg(Border);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003489 // Use difference if >= 2**31
Nate Begemanf2f07812004-08-29 08:19:32 +00003490 BuildMI(*MBB, IP, PPC::FCMPU, 2, PPC::CR0).addReg(UseChoice)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003491 .addReg(Border);
Nate Begemanf2f07812004-08-29 08:19:32 +00003492 BuildMI(*MBB, IP, PPC::FSEL, 3, TmpReg2).addReg(TmpReg).addReg(TmpReg)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003493 .addReg(UseChoice);
3494 // Convert to integer
Nate Begemanf2f07812004-08-29 08:19:32 +00003495 BuildMI(*MBB, IP, PPC::FCTIWZ, 1, ConvReg).addReg(TmpReg2);
3496 addFrameReference(BuildMI(*MBB, IP, PPC::STFD, 3).addReg(ConvReg),
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003497 FrameIdx);
Misha Brukmanb097f212004-07-26 18:13:24 +00003498 if (DestClass == cByte) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003499 addFrameReference(BuildMI(*MBB, IP, PPC::LBZ, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003500 FrameIdx, 7);
3501 } else if (DestClass == cShort) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003502 addFrameReference(BuildMI(*MBB, IP, PPC::LHZ, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003503 FrameIdx, 6);
3504 } if (DestClass == cInt) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003505 addFrameReference(BuildMI(*MBB, IP, PPC::LWZ, 2, IntTmp),
Misha Brukmanb097f212004-07-26 18:13:24 +00003506 FrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003507 BuildMI(*MBB, IP, PPC::BLT, 2).addReg(PPC::CR0).addMBB(PhiMBB);
3508 BuildMI(*MBB, IP, PPC::B, 1).addMBB(XorMBB);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003509
Misha Brukmanb097f212004-07-26 18:13:24 +00003510 // XorMBB:
3511 // add 2**31 if input was >= 2**31
3512 BB = XorMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00003513 BuildMI(BB, PPC::XORIS, 2, XorReg).addReg(IntTmp).addImm(0x8000);
Misha Brukmanb097f212004-07-26 18:13:24 +00003514 XorMBB->addSuccessor(PhiMBB);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003515
Misha Brukmanb097f212004-07-26 18:13:24 +00003516 // PhiMBB:
3517 // DestReg = phi [ IntTmp, OldMBB ], [ XorReg, XorMBB ]
3518 BB = PhiMBB;
Misha Brukmand2cbb872004-08-19 21:00:12 +00003519 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(IntTmp).addMBB(OldMBB)
Misha Brukmanb097f212004-07-26 18:13:24 +00003520 .addReg(XorReg).addMBB(XorMBB);
3521 }
3522 }
3523 return;
3524 }
3525
3526 // Check our invariants
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003527 assert((SrcClass <= cInt || SrcClass == cLong) &&
Misha Brukmanb097f212004-07-26 18:13:24 +00003528 "Unhandled source class for cast operation!");
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003529 assert((DestClass <= cInt || DestClass == cLong) &&
Misha Brukmanb097f212004-07-26 18:13:24 +00003530 "Unhandled destination class for cast operation!");
3531
3532 bool sourceUnsigned = SrcTy->isUnsigned() || SrcTy == Type::BoolTy;
3533 bool destUnsigned = DestTy->isUnsigned();
3534
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003535 // Unsigned -> Unsigned, clear if larger,
Misha Brukmanb097f212004-07-26 18:13:24 +00003536 if (sourceUnsigned && destUnsigned) {
3537 // handle long dest class now to keep switch clean
3538 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003539 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
3540 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3541 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003542 return;
3543 }
3544
3545 // handle u{ byte, short, int } x u{ byte, short, int }
3546 unsigned clearBits = (SrcClass == cByte || DestClass == cByte) ? 24 : 16;
3547 switch (SrcClass) {
3548 case cByte:
3549 case cShort:
Nate Begeman8531f6f2004-11-19 02:06:40 +00003550 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
3551 .addImm(0).addImm(clearBits).addImm(31);
Misha Brukmanb097f212004-07-26 18:13:24 +00003552 break;
3553 case cLong:
3554 ++SrcReg;
3555 // Fall through
3556 case cInt:
Nate Begeman8531f6f2004-11-19 02:06:40 +00003557 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
3558 .addImm(0).addImm(clearBits).addImm(31);
Misha Brukmanb097f212004-07-26 18:13:24 +00003559 break;
3560 }
3561 return;
3562 }
3563
3564 // Signed -> Signed
3565 if (!sourceUnsigned && !destUnsigned) {
3566 // handle long dest class now to keep switch clean
3567 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003568 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg).addImm(31);
3569 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3570 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003571 return;
3572 }
3573
3574 // handle { byte, short, int } x { byte, short, int }
3575 switch (SrcClass) {
3576 case cByte:
Nate Begeman01136382004-11-18 04:56:53 +00003577 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003578 break;
3579 case cShort:
3580 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003581 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003582 else
Misha Brukman5b570812004-08-10 22:47:03 +00003583 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003584 break;
3585 case cLong:
3586 ++SrcReg;
3587 // Fall through
3588 case cInt:
3589 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003590 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003591 else if (DestClass == cShort)
Misha Brukman5b570812004-08-10 22:47:03 +00003592 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003593 else
Misha Brukman5b570812004-08-10 22:47:03 +00003594 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003595 break;
3596 }
3597 return;
3598 }
3599
3600 // Unsigned -> Signed
3601 if (sourceUnsigned && !destUnsigned) {
3602 // handle long dest class now to keep switch clean
3603 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003604 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
3605 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3606 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003607 return;
3608 }
3609
3610 // handle u{ byte, short, int } -> { byte, short, int }
3611 switch (SrcClass) {
3612 case cByte:
Nate Begeman01136382004-11-18 04:56:53 +00003613 // uByte 255 -> signed short/int == 255
3614 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(0)
3615 .addImm(24).addImm(31);
Misha Brukmanb097f212004-07-26 18:13:24 +00003616 break;
3617 case cShort:
3618 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003619 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003620 else
Misha Brukman5b570812004-08-10 22:47:03 +00003621 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(0)
Misha Brukmanb097f212004-07-26 18:13:24 +00003622 .addImm(16).addImm(31);
3623 break;
3624 case cLong:
3625 ++SrcReg;
3626 // Fall through
3627 case cInt:
3628 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003629 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003630 else if (DestClass == cShort)
Misha Brukman5b570812004-08-10 22:47:03 +00003631 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003632 else
Misha Brukman5b570812004-08-10 22:47:03 +00003633 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003634 break;
3635 }
3636 return;
3637 }
3638
3639 // Signed -> Unsigned
3640 if (!sourceUnsigned && destUnsigned) {
3641 // handle long dest class now to keep switch clean
3642 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003643 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg).addImm(31);
3644 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3645 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003646 return;
3647 }
3648
3649 // handle { byte, short, int } -> u{ byte, short, int }
3650 unsigned clearBits = (DestClass == cByte) ? 24 : 16;
3651 switch (SrcClass) {
3652 case cByte:
Nate Begeman01136382004-11-18 04:56:53 +00003653 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
3654 break;
Misha Brukmanb097f212004-07-26 18:13:24 +00003655 case cShort:
Nate Begeman01136382004-11-18 04:56:53 +00003656 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003657 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003658 .addImm(0).addImm(clearBits).addImm(31);
3659 else
Nate Begeman01136382004-11-18 04:56:53 +00003660 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003661 break;
3662 case cLong:
3663 ++SrcReg;
3664 // Fall through
3665 case cInt:
3666 if (DestClass == cInt)
Misha Brukman5b570812004-08-10 22:47:03 +00003667 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003668 else
Misha Brukman5b570812004-08-10 22:47:03 +00003669 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003670 .addImm(0).addImm(clearBits).addImm(31);
3671 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00003672 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003673 return;
3674 }
3675
3676 // Anything we haven't handled already, we can't (yet) handle at all.
Misha Brukmanb097f212004-07-26 18:13:24 +00003677 std::cerr << "Unhandled cast from " << SrcTy->getDescription()
3678 << "to " << DestTy->getDescription() << '\n';
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003679 abort();
3680}
3681
3682/// visitVANextInst - Implement the va_next instruction...
3683///
Misha Brukmana1dca552004-09-21 18:22:19 +00003684void PPC32ISel::visitVANextInst(VANextInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003685 unsigned VAList = getReg(I.getOperand(0));
3686 unsigned DestReg = getReg(I);
3687
3688 unsigned Size;
Misha Brukman358829f2004-06-21 17:25:55 +00003689 switch (I.getArgType()->getTypeID()) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003690 default:
3691 std::cerr << I;
3692 assert(0 && "Error: bad type for va_next instruction!");
3693 return;
3694 case Type::PointerTyID:
3695 case Type::UIntTyID:
3696 case Type::IntTyID:
3697 Size = 4;
3698 break;
3699 case Type::ULongTyID:
3700 case Type::LongTyID:
3701 case Type::DoubleTyID:
3702 Size = 8;
3703 break;
3704 }
3705
3706 // Increment the VAList pointer...
Misha Brukman5b570812004-08-10 22:47:03 +00003707 BuildMI(BB, PPC::ADDI, 2, DestReg).addReg(VAList).addSImm(Size);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003708}
3709
Misha Brukmana1dca552004-09-21 18:22:19 +00003710void PPC32ISel::visitVAArgInst(VAArgInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003711 unsigned VAList = getReg(I.getOperand(0));
3712 unsigned DestReg = getReg(I);
3713
Misha Brukman358829f2004-06-21 17:25:55 +00003714 switch (I.getType()->getTypeID()) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003715 default:
3716 std::cerr << I;
3717 assert(0 && "Error: bad type for va_next instruction!");
3718 return;
3719 case Type::PointerTyID:
3720 case Type::UIntTyID:
3721 case Type::IntTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003722 BuildMI(BB, PPC::LWZ, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003723 break;
3724 case Type::ULongTyID:
3725 case Type::LongTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003726 BuildMI(BB, PPC::LWZ, 2, DestReg).addSImm(0).addReg(VAList);
3727 BuildMI(BB, PPC::LWZ, 2, DestReg+1).addSImm(4).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003728 break;
Misha Brukmanb097f212004-07-26 18:13:24 +00003729 case Type::FloatTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003730 BuildMI(BB, PPC::LFS, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukmanb097f212004-07-26 18:13:24 +00003731 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003732 case Type::DoubleTyID:
Misha Brukman5b570812004-08-10 22:47:03 +00003733 BuildMI(BB, PPC::LFD, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003734 break;
3735 }
3736}
3737
3738/// visitGetElementPtrInst - instruction-select GEP instructions
3739///
Misha Brukmana1dca552004-09-21 18:22:19 +00003740void PPC32ISel::visitGetElementPtrInst(GetElementPtrInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003741 if (canFoldGEPIntoLoadOrStore(&I))
3742 return;
3743
Nate Begeman645495d2004-09-23 05:31:33 +00003744 emitGEPOperation(BB, BB->end(), &I, false);
3745}
3746
Misha Brukman1013ef52004-07-21 20:09:08 +00003747/// emitGEPOperation - Common code shared between visitGetElementPtrInst and
3748/// constant expression GEP support.
3749///
Misha Brukmana1dca552004-09-21 18:22:19 +00003750void PPC32ISel::emitGEPOperation(MachineBasicBlock *MBB,
3751 MachineBasicBlock::iterator IP,
Nate Begeman645495d2004-09-23 05:31:33 +00003752 GetElementPtrInst *GEPI, bool GEPIsFolded) {
3753 // If we've already emitted this particular GEP, just return to avoid
3754 // multiple definitions of the base register.
Nate Begemana41fc772004-09-29 02:35:05 +00003755 if (GEPIsFolded && (GEPMap[GEPI].base != 0))
Nate Begeman645495d2004-09-23 05:31:33 +00003756 return;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003757
Nate Begeman645495d2004-09-23 05:31:33 +00003758 Value *Src = GEPI->getOperand(0);
3759 User::op_iterator IdxBegin = GEPI->op_begin()+1;
3760 User::op_iterator IdxEnd = GEPI->op_end();
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003761 const TargetData &TD = TM.getTargetData();
3762 const Type *Ty = Src->getType();
Chris Lattner27ee3a32005-04-09 19:47:21 +00003763 int32_t constValue = 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003764
Misha Brukmane2eceb52004-07-23 16:08:20 +00003765 // Record the operations to emit the GEP in a vector so that we can emit them
3766 // after having analyzed the entire instruction.
Misha Brukmanb097f212004-07-26 18:13:24 +00003767 std::vector<CollapsedGepOp> ops;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003768
Misha Brukman1013ef52004-07-21 20:09:08 +00003769 // GEPs have zero or more indices; we must perform a struct access
3770 // or array access for each one.
3771 for (GetElementPtrInst::op_iterator oi = IdxBegin, oe = IdxEnd; oi != oe;
3772 ++oi) {
3773 Value *idx = *oi;
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003774 if (const StructType *StTy = dyn_cast<StructType>(Ty)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00003775 // It's a struct access. idx is the index into the structure,
3776 // which names the field. Use the TargetData structure to
3777 // pick out what the layout of the structure is in memory.
3778 // Use the (constant) structure index's value to find the
3779 // right byte offset from the StructLayout class's list of
3780 // structure member offsets.
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003781 unsigned fieldIndex = cast<ConstantUInt>(idx)->getValue();
Misha Brukmane2eceb52004-07-23 16:08:20 +00003782
3783 // StructType member offsets are always constant values. Add it to the
3784 // running total.
Nate Begeman645495d2004-09-23 05:31:33 +00003785 constValue += TD.getStructLayout(StTy)->MemberOffsets[fieldIndex];
Misha Brukmane2eceb52004-07-23 16:08:20 +00003786
Nate Begeman645495d2004-09-23 05:31:33 +00003787 // The next type is the member of the structure selected by the index.
Misha Brukmane2eceb52004-07-23 16:08:20 +00003788 Ty = StTy->getElementType (fieldIndex);
Nate Begeman645495d2004-09-23 05:31:33 +00003789 } else if (const SequentialType *SqTy = dyn_cast<SequentialType>(Ty)) {
Misha Brukman313efcb2004-07-09 15:45:07 +00003790 // Many GEP instructions use a [cast (int/uint) to LongTy] as their
3791 // operand. Handle this case directly now...
3792 if (CastInst *CI = dyn_cast<CastInst>(idx))
3793 if (CI->getOperand(0)->getType() == Type::IntTy ||
3794 CI->getOperand(0)->getType() == Type::UIntTy)
3795 idx = CI->getOperand(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00003796
Misha Brukmane2eceb52004-07-23 16:08:20 +00003797 // It's an array or pointer access: [ArraySize x ElementType].
3798 // We want to add basePtrReg to (idxReg * sizeof ElementType). First, we
3799 // must find the size of the pointed-to type (Not coincidentally, the next
3800 // type is the type of the elements in the array).
Misha Brukman1013ef52004-07-21 20:09:08 +00003801 Ty = SqTy->getElementType();
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003802 unsigned elementSize = TD.getTypeSize(Ty);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003803
Misha Brukmane2eceb52004-07-23 16:08:20 +00003804 if (ConstantInt *C = dyn_cast<ConstantInt>(idx)) {
Misha Brukmane2eceb52004-07-23 16:08:20 +00003805 if (ConstantSInt *CS = dyn_cast<ConstantSInt>(C))
3806 constValue += CS->getValue() * elementSize;
3807 else if (ConstantUInt *CU = dyn_cast<ConstantUInt>(C))
3808 constValue += CU->getValue() * elementSize;
3809 else
3810 assert(0 && "Invalid ConstantInt GEP index type!");
3811 } else {
Nate Begeman645495d2004-09-23 05:31:33 +00003812 // Push current gep state to this point as an add and multiply
3813 ops.push_back(CollapsedGepOp(
3814 ConstantSInt::get(Type::IntTy, constValue),
3815 idx, ConstantUInt::get(Type::UIntTy, elementSize)));
3816
Misha Brukmane2eceb52004-07-23 16:08:20 +00003817 constValue = 0;
Misha Brukman313efcb2004-07-09 15:45:07 +00003818 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003819 }
Misha Brukmane2eceb52004-07-23 16:08:20 +00003820 }
Misha Brukmane2eceb52004-07-23 16:08:20 +00003821 // Emit instructions for all the collapsed ops
Nate Begeman645495d2004-09-23 05:31:33 +00003822 unsigned indexReg = 0;
Misha Brukmanb097f212004-07-26 18:13:24 +00003823 for(std::vector<CollapsedGepOp>::iterator cgo_i = ops.begin(),
Misha Brukmane2eceb52004-07-23 16:08:20 +00003824 cgo_e = ops.end(); cgo_i != cgo_e; ++cgo_i) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003825 CollapsedGepOp& cgo = *cgo_i;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003826
Nate Begeman8531f6f2004-11-19 02:06:40 +00003827 // Avoid emitting known move instructions here for the register allocator
3828 // to deal with later. val * 1 == val. val + 0 == val.
3829 unsigned TmpReg1;
3830 if (cgo.size->getValue() == 1) {
3831 TmpReg1 = getReg(cgo.index, MBB, IP);
3832 } else {
3833 TmpReg1 = makeAnotherReg(Type::IntTy);
3834 doMultiplyConst(MBB, IP, TmpReg1, cgo.index, cgo.size);
3835 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003836
Nate Begeman8531f6f2004-11-19 02:06:40 +00003837 unsigned TmpReg2;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003838 if (cgo.offset->isNullValue()) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003839 TmpReg2 = TmpReg1;
3840 } else {
3841 TmpReg2 = makeAnotherReg(Type::IntTy);
3842 emitBinaryConstOperation(MBB, IP, TmpReg1, cgo.offset, 0, TmpReg2);
3843 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003844
Nate Begeman645495d2004-09-23 05:31:33 +00003845 if (indexReg == 0)
3846 indexReg = TmpReg2;
3847 else {
3848 unsigned TmpReg3 = makeAnotherReg(Type::IntTy);
3849 BuildMI(*MBB, IP, PPC::ADD, 2, TmpReg3).addReg(indexReg).addReg(TmpReg2);
3850 indexReg = TmpReg3;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003851 }
Misha Brukman2fec9902004-06-21 20:22:03 +00003852 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003853
Nate Begeman645495d2004-09-23 05:31:33 +00003854 // We now have a base register, an index register, and possibly a constant
3855 // remainder. If the GEP is going to be folded, we try to generate the
3856 // optimal addressing mode.
Misha Brukmane2eceb52004-07-23 16:08:20 +00003857 ConstantSInt *remainder = ConstantSInt::get(Type::IntTy, constValue);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003858
Misha Brukmanb097f212004-07-26 18:13:24 +00003859 // If we are emitting this during a fold, copy the current base register to
3860 // the target, and save the current constant offset so the folding load or
3861 // store can try and use it as an immediate.
3862 if (GEPIsFolded) {
Nate Begeman645495d2004-09-23 05:31:33 +00003863 if (indexReg == 0) {
Nate Begemanb816f022004-10-07 22:30:03 +00003864 if (!canUseAsImmediateForOpcode(remainder, 0, false)) {
Nate Begeman645495d2004-09-23 05:31:33 +00003865 indexReg = getReg(remainder, MBB, IP);
3866 remainder = 0;
Nate Begemanb64af912004-08-10 20:42:36 +00003867 }
Nate Begemanbc3a5372004-11-19 08:01:16 +00003868 } else if (!remainder->isNullValue()) {
Nate Begeman645495d2004-09-23 05:31:33 +00003869 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Nate Begemanb816f022004-10-07 22:30:03 +00003870 emitBinaryConstOperation(MBB, IP, indexReg, remainder, 0, TmpReg);
Nate Begeman645495d2004-09-23 05:31:33 +00003871 indexReg = TmpReg;
3872 remainder = 0;
Nate Begemanb64af912004-08-10 20:42:36 +00003873 }
Nate Begemandb869aa2004-11-18 07:22:46 +00003874 unsigned basePtrReg = getReg(Src, MBB, IP);
3875 GEPMap[GEPI] = FoldedGEP(basePtrReg, indexReg, remainder);
Misha Brukmanb097f212004-07-26 18:13:24 +00003876 return;
3877 }
Nate Begemanb64af912004-08-10 20:42:36 +00003878
Nate Begeman645495d2004-09-23 05:31:33 +00003879 // We're not folding, so collapse the base, index, and any remainder into the
3880 // destination register.
Nate Begemandb869aa2004-11-18 07:22:46 +00003881 unsigned TargetReg = getReg(GEPI, MBB, IP);
3882 unsigned basePtrReg = getReg(Src, MBB, IP);
Nate Begemanbc3a5372004-11-19 08:01:16 +00003883
Nate Begeman486ebfd2004-11-21 05:14:06 +00003884 if ((indexReg == 0) && remainder->isNullValue()) {
3885 BuildMI(*MBB, IP, PPC::OR, 2, TargetReg).addReg(basePtrReg)
3886 .addReg(basePtrReg);
3887 return;
3888 }
Nate Begemanbc3a5372004-11-19 08:01:16 +00003889 if (!remainder->isNullValue()) {
3890 unsigned TmpReg = (indexReg == 0) ? TargetReg : makeAnotherReg(Type::IntTy);
3891 emitBinaryConstOperation(MBB, IP, basePtrReg, remainder, 0, TmpReg);
Nate Begemanb64af912004-08-10 20:42:36 +00003892 basePtrReg = TmpReg;
3893 }
Nate Begeman486ebfd2004-11-21 05:14:06 +00003894 if (indexReg != 0)
Nate Begemanbc3a5372004-11-19 08:01:16 +00003895 BuildMI(*MBB, IP, PPC::ADD, 2, TargetReg).addReg(indexReg)
3896 .addReg(basePtrReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003897}
3898
3899/// visitAllocaInst - If this is a fixed size alloca, allocate space from the
3900/// frame manager, otherwise do it the hard way.
3901///
Misha Brukmana1dca552004-09-21 18:22:19 +00003902void PPC32ISel::visitAllocaInst(AllocaInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003903 // If this is a fixed size alloca in the entry block for the function, we
3904 // statically stack allocate the space, so we don't need to do anything here.
3905 //
3906 if (dyn_castFixedAlloca(&I)) return;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003907
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003908 // Find the data size of the alloca inst's getAllocatedType.
3909 const Type *Ty = I.getAllocatedType();
3910 unsigned TySize = TM.getTargetData().getTypeSize(Ty);
3911
3912 // Create a register to hold the temporary result of multiplying the type size
3913 // constant by the variable amount.
3914 unsigned TotalSizeReg = makeAnotherReg(Type::UIntTy);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003915
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003916 // TotalSizeReg = mul <numelements>, <TypeSize>
3917 MachineBasicBlock::iterator MBBI = BB->end();
Misha Brukman1013ef52004-07-21 20:09:08 +00003918 ConstantUInt *CUI = ConstantUInt::get(Type::UIntTy, TySize);
3919 doMultiplyConst(BB, MBBI, TotalSizeReg, I.getArraySize(), CUI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003920
3921 // AddedSize = add <TotalSizeReg>, 15
3922 unsigned AddedSizeReg = makeAnotherReg(Type::UIntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003923 BuildMI(BB, PPC::ADDI, 2, AddedSizeReg).addReg(TotalSizeReg).addSImm(15);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003924
3925 // AlignedSize = and <AddedSize>, ~15
3926 unsigned AlignedSize = makeAnotherReg(Type::UIntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003927 BuildMI(BB, PPC::RLWINM, 4, AlignedSize).addReg(AddedSizeReg).addImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00003928 .addImm(0).addImm(27);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003929
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003930 // Subtract size from stack pointer, thereby allocating some space.
Nate Begemanf70b5762005-03-28 23:08:54 +00003931 BuildMI(BB, PPC::SUBF, 2, PPC::R1).addReg(AlignedSize).addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003932
3933 // Put a pointer to the space into the result register, by copying
3934 // the stack pointer.
Misha Brukman5b570812004-08-10 22:47:03 +00003935 BuildMI(BB, PPC::OR, 2, getReg(I)).addReg(PPC::R1).addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003936
3937 // Inform the Frame Information that we have just allocated a variable-sized
3938 // object.
3939 F->getFrameInfo()->CreateVariableSizedObject();
3940}
3941
3942/// visitMallocInst - Malloc instructions are code generated into direct calls
3943/// to the library malloc.
3944///
Misha Brukmana1dca552004-09-21 18:22:19 +00003945void PPC32ISel::visitMallocInst(MallocInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003946 unsigned AllocSize = TM.getTargetData().getTypeSize(I.getAllocatedType());
3947 unsigned Arg;
3948
3949 if (ConstantUInt *C = dyn_cast<ConstantUInt>(I.getOperand(0))) {
3950 Arg = getReg(ConstantUInt::get(Type::UIntTy, C->getValue() * AllocSize));
3951 } else {
3952 Arg = makeAnotherReg(Type::UIntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003953 MachineBasicBlock::iterator MBBI = BB->end();
Misha Brukman1013ef52004-07-21 20:09:08 +00003954 ConstantUInt *CUI = ConstantUInt::get(Type::UIntTy, AllocSize);
3955 doMultiplyConst(BB, MBBI, Arg, I.getOperand(0), CUI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003956 }
3957
3958 std::vector<ValueRecord> Args;
3959 Args.push_back(ValueRecord(Arg, Type::UIntTy));
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003960 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003961 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(mallocFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003962 doCall(ValueRecord(getReg(I), I.getType()), TheCall, Args, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003963}
3964
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003965/// visitFreeInst - Free instructions are code gen'd to call the free libc
3966/// function.
3967///
Misha Brukmana1dca552004-09-21 18:22:19 +00003968void PPC32ISel::visitFreeInst(FreeInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003969 std::vector<ValueRecord> Args;
3970 Args.push_back(ValueRecord(I.getOperand(0)));
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003971 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003972 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(freeFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003973 doCall(ValueRecord(0, Type::VoidTy), TheCall, Args, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003974}
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003975
Misha Brukman3d9a6c22004-08-11 00:09:42 +00003976/// createPPC32ISelSimple - This pass converts an LLVM function into a machine
3977/// code representation is a very simple peep-hole fashion.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003978///
Misha Brukman3d9a6c22004-08-11 00:09:42 +00003979FunctionPass *llvm::createPPC32ISelSimple(TargetMachine &TM) {
Misha Brukmana1dca552004-09-21 18:22:19 +00003980 return new PPC32ISel(TM);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003981}