blob: 065262c10d5def98da8d81de022d94f5b54e821f [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);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000313 void visitVAArgInst(VAArgInst &I);
314
315 void visitInstruction(Instruction &I) {
316 std::cerr << "Cannot instruction select: " << I;
317 abort();
318 }
319
Nate Begemanb47321b2004-08-20 09:56:22 +0000320 unsigned ExtendOrClear(MachineBasicBlock *MBB,
321 MachineBasicBlock::iterator IP,
Nate Begemana2de1022004-09-22 04:40:25 +0000322 Value *Op0);
Nate Begemanb47321b2004-08-20 09:56:22 +0000323
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000324 /// promote32 - Make a value 32-bits wide, and put it somewhere.
325 ///
326 void promote32(unsigned targetReg, const ValueRecord &VR);
327
328 /// emitGEPOperation - Common code shared between visitGetElementPtrInst and
329 /// constant expression GEP support.
330 ///
331 void emitGEPOperation(MachineBasicBlock *BB, MachineBasicBlock::iterator IP,
Nate Begeman645495d2004-09-23 05:31:33 +0000332 GetElementPtrInst *GEPI, bool foldGEP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000333
334 /// emitCastOperation - Common code shared between visitCastInst and
335 /// constant expression cast support.
336 ///
337 void emitCastOperation(MachineBasicBlock *BB,MachineBasicBlock::iterator IP,
338 Value *Src, const Type *DestTy, unsigned TargetReg);
339
Nate Begemanb816f022004-10-07 22:30:03 +0000340
Nate Begeman1b750222004-10-17 05:19:20 +0000341 /// emitBitfieldInsert - return true if we were able to fold the sequence of
Nate Begeman905a2912004-10-24 10:33:30 +0000342 /// instructions into a bitfield insert (rlwimi).
Nate Begeman9b508c32004-10-26 03:48:25 +0000343 bool emitBitfieldInsert(User *OpUser, unsigned DestReg);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000344
Nate Begeman905a2912004-10-24 10:33:30 +0000345 /// emitBitfieldExtract - return true if we were able to fold the sequence
346 /// of instructions into a bitfield extract (rlwinm).
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000347 bool emitBitfieldExtract(MachineBasicBlock *MBB,
Nate Begeman905a2912004-10-24 10:33:30 +0000348 MachineBasicBlock::iterator IP,
Nate Begeman9b508c32004-10-26 03:48:25 +0000349 User *OpUser, unsigned DestReg);
Nate Begeman1b750222004-10-17 05:19:20 +0000350
Nate Begemanb816f022004-10-07 22:30:03 +0000351 /// emitBinaryConstOperation - Used by several functions to emit simple
352 /// arithmetic and logical operations with constants on a register rather
353 /// than a Value.
354 ///
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000355 void emitBinaryConstOperation(MachineBasicBlock *MBB,
Nate Begemanb816f022004-10-07 22:30:03 +0000356 MachineBasicBlock::iterator IP,
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000357 unsigned Op0Reg, ConstantInt *Op1,
Nate Begemanb816f022004-10-07 22:30:03 +0000358 unsigned Opcode, unsigned DestReg);
359
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000360 /// emitSimpleBinaryOperation - Implement simple binary operators for
361 /// integral types. OperatorClass is one of: 0 for Add, 1 for Sub,
Nate Begemanb816f022004-10-07 22:30:03 +0000362 /// 2 for And, 3 for Or, 4 for Xor.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000363 ///
364 void emitSimpleBinaryOperation(MachineBasicBlock *BB,
365 MachineBasicBlock::iterator IP,
Nate Begeman905a2912004-10-24 10:33:30 +0000366 BinaryOperator *BO, Value *Op0, Value *Op1,
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000367 unsigned OperatorClass, unsigned TargetReg);
368
369 /// emitBinaryFPOperation - This method handles emission of floating point
370 /// Add (0), Sub (1), Mul (2), and Div (3) operations.
371 void emitBinaryFPOperation(MachineBasicBlock *BB,
372 MachineBasicBlock::iterator IP,
373 Value *Op0, Value *Op1,
374 unsigned OperatorClass, unsigned TargetReg);
375
376 void emitMultiply(MachineBasicBlock *BB, MachineBasicBlock::iterator IP,
377 Value *Op0, Value *Op1, unsigned TargetReg);
378
Misha Brukman1013ef52004-07-21 20:09:08 +0000379 void doMultiply(MachineBasicBlock *MBB,
380 MachineBasicBlock::iterator IP,
381 unsigned DestReg, Value *Op0, Value *Op1);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000382
Misha Brukman1013ef52004-07-21 20:09:08 +0000383 /// doMultiplyConst - This method will multiply the value in Op0Reg by the
384 /// value of the ContantInt *CI
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000385 void doMultiplyConst(MachineBasicBlock *MBB,
Misha Brukman1013ef52004-07-21 20:09:08 +0000386 MachineBasicBlock::iterator IP,
387 unsigned DestReg, Value *Op0, ConstantInt *CI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000388
389 void emitDivRemOperation(MachineBasicBlock *BB,
390 MachineBasicBlock::iterator IP,
391 Value *Op0, Value *Op1, bool isDiv,
392 unsigned TargetReg);
393
394 /// emitSetCCOperation - Common code shared between visitSetCondInst and
395 /// constant expression support.
396 ///
397 void emitSetCCOperation(MachineBasicBlock *BB,
398 MachineBasicBlock::iterator IP,
399 Value *Op0, Value *Op1, unsigned Opcode,
400 unsigned TargetReg);
401
402 /// emitShiftOperation - Common code shared between visitShiftInst and
403 /// constant expression support.
404 ///
405 void emitShiftOperation(MachineBasicBlock *MBB,
406 MachineBasicBlock::iterator IP,
407 Value *Op, Value *ShiftAmount, bool isLeftShift,
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000408 const Type *ResultTy, ShiftInst *SI,
Nate Begeman9b508c32004-10-26 03:48:25 +0000409 unsigned DestReg);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000410
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000411 /// emitSelectOperation - Common code shared between visitSelectInst and the
412 /// constant expression support.
Misha Brukmanb097f212004-07-26 18:13:24 +0000413 ///
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000414 void emitSelectOperation(MachineBasicBlock *MBB,
415 MachineBasicBlock::iterator IP,
416 Value *Cond, Value *TrueVal, Value *FalseVal,
417 unsigned DestReg);
418
Nate Begeman1f5308e2004-11-18 06:51:29 +0000419 /// getGlobalBaseReg - Output the instructions required to put the
420 /// base address to use for accessing globals into a register. Returns the
421 /// register containing the base address.
Misha Brukmanb097f212004-07-26 18:13:24 +0000422 ///
Nate Begeman5e966612005-03-24 06:28:42 +0000423 unsigned getGlobalBaseReg();
Misha Brukmanb097f212004-07-26 18:13:24 +0000424
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000425 /// copyConstantToRegister - Output the instructions required to put the
426 /// specified constant into the specified register.
427 ///
428 void copyConstantToRegister(MachineBasicBlock *MBB,
429 MachineBasicBlock::iterator MBBI,
430 Constant *C, unsigned Reg);
431
432 void emitUCOM(MachineBasicBlock *MBB, MachineBasicBlock::iterator MBBI,
433 unsigned LHS, unsigned RHS);
434
435 /// makeAnotherReg - This method returns the next register number we haven't
436 /// yet used.
437 ///
438 /// Long values are handled somewhat specially. They are always allocated
439 /// as pairs of 32 bit integer values. The register number returned is the
Misha Brukman1013ef52004-07-21 20:09:08 +0000440 /// high 32 bits of the long value, and the regNum+1 is the low 32 bits.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000441 ///
442 unsigned makeAnotherReg(const Type *Ty) {
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000443 assert(dynamic_cast<const PPC32RegisterInfo*>(TM.getRegisterInfo()) &&
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000444 "Current target doesn't have PPC reg info??");
Misha Brukmanf2ccb772004-08-17 04:55:41 +0000445 const PPC32RegisterInfo *PPCRI =
446 static_cast<const PPC32RegisterInfo*>(TM.getRegisterInfo());
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000447 if (Ty == Type::LongTy || Ty == Type::ULongTy) {
Nate Begemanb64af912004-08-10 20:42:36 +0000448 const TargetRegisterClass *RC = PPCRI->getRegClassForType(Type::IntTy);
449 // Create the upper part
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000450 F->getSSARegMap()->createVirtualRegister(RC);
Nate Begemanb64af912004-08-10 20:42:36 +0000451 // Create the lower part.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000452 return F->getSSARegMap()->createVirtualRegister(RC)-1;
453 }
454
455 // Add the mapping of regnumber => reg class to MachineFunction
Nate Begemanb64af912004-08-10 20:42:36 +0000456 const TargetRegisterClass *RC = PPCRI->getRegClassForType(Ty);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000457 return F->getSSARegMap()->createVirtualRegister(RC);
458 }
459
460 /// getReg - This method turns an LLVM value into a register number.
461 ///
462 unsigned getReg(Value &V) { return getReg(&V); } // Allow references
463 unsigned getReg(Value *V) {
464 // Just append to the end of the current bb.
465 MachineBasicBlock::iterator It = BB->end();
466 return getReg(V, BB, It);
467 }
468 unsigned getReg(Value *V, MachineBasicBlock *MBB,
469 MachineBasicBlock::iterator IPt);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000470
Misha Brukman1013ef52004-07-21 20:09:08 +0000471 /// canUseAsImmediateForOpcode - This method returns whether a ConstantInt
472 /// is okay to use as an immediate argument to a certain binary operation
Nate Begemanb816f022004-10-07 22:30:03 +0000473 bool canUseAsImmediateForOpcode(ConstantInt *CI, unsigned Opcode,
474 bool Shifted);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000475
476 /// getFixedSizedAllocaFI - Return the frame index for a fixed sized alloca
477 /// that is to be statically allocated with the initial stack frame
478 /// adjustment.
479 unsigned getFixedSizedAllocaFI(AllocaInst *AI);
480 };
481}
482
483/// dyn_castFixedAlloca - If the specified value is a fixed size alloca
484/// instruction in the entry block, return it. Otherwise, return a null
485/// pointer.
486static AllocaInst *dyn_castFixedAlloca(Value *V) {
487 if (AllocaInst *AI = dyn_cast<AllocaInst>(V)) {
488 BasicBlock *BB = AI->getParent();
489 if (isa<ConstantUInt>(AI->getArraySize()) && BB ==&BB->getParent()->front())
490 return AI;
491 }
492 return 0;
493}
494
495/// getReg - This method turns an LLVM value into a register number.
496///
Misha Brukmana1dca552004-09-21 18:22:19 +0000497unsigned PPC32ISel::getReg(Value *V, MachineBasicBlock *MBB,
498 MachineBasicBlock::iterator IPt) {
Misha Brukmanba1c1da2004-07-20 00:59:38 +0000499 if (Constant *C = dyn_cast<Constant>(V)) {
Chris Lattnera51e4f62004-07-18 18:45:01 +0000500 unsigned Reg = makeAnotherReg(V->getType());
501 copyConstantToRegister(MBB, IPt, C, Reg);
502 return Reg;
Nate Begeman676dee62004-11-08 02:25:40 +0000503 } else if (CastInst *CI = dyn_cast<CastInst>(V)) {
504 // Do not emit noop casts at all, unless it's a double -> float cast.
505 if (getClassB(CI->getType()) == getClassB(CI->getOperand(0)->getType()))
506 return getReg(CI->getOperand(0), MBB, IPt);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000507 } else if (AllocaInst *AI = dyn_castFixedAlloca(V)) {
508 unsigned Reg = makeAnotherReg(V->getType());
509 unsigned FI = getFixedSizedAllocaFI(AI);
Misha Brukman5b570812004-08-10 22:47:03 +0000510 addFrameReference(BuildMI(*MBB, IPt, PPC::ADDI, 2, Reg), FI, 0, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000511 return Reg;
512 }
513
514 unsigned &Reg = RegMap[V];
515 if (Reg == 0) {
516 Reg = makeAnotherReg(V->getType());
517 RegMap[V] = Reg;
518 }
519
520 return Reg;
521}
522
Misha Brukman1013ef52004-07-21 20:09:08 +0000523/// canUseAsImmediateForOpcode - This method returns whether a ConstantInt
524/// is okay to use as an immediate argument to a certain binary operator.
Nate Begemanb816f022004-10-07 22:30:03 +0000525/// The shifted argument determines if the immediate is suitable to be used with
526/// the PowerPC instructions such as addis which concatenate 16 bits of the
527/// immediate with 16 bits of zeroes.
Misha Brukman1013ef52004-07-21 20:09:08 +0000528///
Nate Begemanb816f022004-10-07 22:30:03 +0000529bool PPC32ISel::canUseAsImmediateForOpcode(ConstantInt *CI, unsigned Opcode,
530 bool Shifted) {
Misha Brukman1013ef52004-07-21 20:09:08 +0000531 ConstantSInt *Op1Cs;
532 ConstantUInt *Op1Cu;
Nate Begemanb816f022004-10-07 22:30:03 +0000533
534 // For shifted immediates, any value with the low halfword cleared may be used
535 if (Shifted) {
Nate Begemanbdf69842004-10-08 02:49:24 +0000536 if (((int32_t)CI->getRawValue() & 0x0000FFFF) == 0)
Nate Begemanb816f022004-10-07 22:30:03 +0000537 return true;
Nate Begemanbdf69842004-10-08 02:49:24 +0000538 else
539 return false;
Nate Begemanb816f022004-10-07 22:30:03 +0000540 }
Nate Begeman28dd2fc2004-11-04 19:43:18 +0000541
542 // Treat subfic like addi for the purposes of constant validation
543 if (Opcode == 5) Opcode = 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000544
Nate Begeman28dd2fc2004-11-04 19:43:18 +0000545 // addi, subfic, compare, and non-indexed load take SIMM
Nate Begemanb816f022004-10-07 22:30:03 +0000546 bool cond1 = (Opcode < 2)
Nate Begemana41fc772004-09-29 02:35:05 +0000547 && ((int32_t)CI->getRawValue() <= 32767)
548 && ((int32_t)CI->getRawValue() >= -32768);
Misha Brukman1013ef52004-07-21 20:09:08 +0000549
Misha Brukman1013ef52004-07-21 20:09:08 +0000550 // ANDIo, ORI, and XORI take unsigned values
Nate Begemanb816f022004-10-07 22:30:03 +0000551 bool cond2 = (Opcode >= 2)
Misha Brukman2ed17ca2004-07-22 15:58:04 +0000552 && (Op1Cs = dyn_cast<ConstantSInt>(CI))
553 && (Op1Cs->getValue() >= 0)
Nate Begemana41fc772004-09-29 02:35:05 +0000554 && (Op1Cs->getValue() <= 65535);
Misha Brukman1013ef52004-07-21 20:09:08 +0000555
556 // ANDIo, ORI, and XORI take UIMMs, so they can be larger
Nate Begemanb816f022004-10-07 22:30:03 +0000557 bool cond3 = (Opcode >= 2)
Misha Brukman17a90002004-07-21 20:22:06 +0000558 && (Op1Cu = dyn_cast<ConstantUInt>(CI))
559 && (Op1Cu->getValue() <= 65535);
Misha Brukman1013ef52004-07-21 20:09:08 +0000560
Nate Begemanb816f022004-10-07 22:30:03 +0000561 if (cond1 || cond2 || cond3)
Misha Brukman1013ef52004-07-21 20:09:08 +0000562 return true;
563
564 return false;
565}
566
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000567/// getFixedSizedAllocaFI - Return the frame index for a fixed sized alloca
568/// that is to be statically allocated with the initial stack frame
569/// adjustment.
Misha Brukmana1dca552004-09-21 18:22:19 +0000570unsigned PPC32ISel::getFixedSizedAllocaFI(AllocaInst *AI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000571 // Already computed this?
572 std::map<AllocaInst*, unsigned>::iterator I = AllocaMap.lower_bound(AI);
573 if (I != AllocaMap.end() && I->first == AI) return I->second;
574
575 const Type *Ty = AI->getAllocatedType();
576 ConstantUInt *CUI = cast<ConstantUInt>(AI->getArraySize());
577 unsigned TySize = TM.getTargetData().getTypeSize(Ty);
578 TySize *= CUI->getValue(); // Get total allocated size...
579 unsigned Alignment = TM.getTargetData().getTypeAlignment(Ty);
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000580
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000581 // Create a new stack object using the frame manager...
582 int FrameIdx = F->getFrameInfo()->CreateStackObject(TySize, Alignment);
583 AllocaMap.insert(I, std::make_pair(AI, FrameIdx));
584 return FrameIdx;
585}
586
587
Nate Begeman1f5308e2004-11-18 06:51:29 +0000588/// getGlobalBaseReg - Output the instructions required to put the
Misha Brukmanb097f212004-07-26 18:13:24 +0000589/// base address to use for accessing globals into a register.
590///
Nate Begeman5e966612005-03-24 06:28:42 +0000591unsigned PPC32ISel::getGlobalBaseReg() {
Misha Brukmanb097f212004-07-26 18:13:24 +0000592 if (!GlobalBaseInitialized) {
593 // Insert the set of GlobalBaseReg into the first MBB of the function
594 MachineBasicBlock &FirstMBB = F->front();
595 MachineBasicBlock::iterator MBBI = FirstMBB.begin();
596 GlobalBaseReg = makeAnotherReg(Type::IntTy);
Nate Begemanb7a8f2c2004-09-02 08:13:00 +0000597 BuildMI(FirstMBB, MBBI, PPC::MovePCtoLR, 0, PPC::LR);
Nate Begemanda721e72004-09-27 05:08:17 +0000598 BuildMI(FirstMBB, MBBI, PPC::MFLR, 1, GlobalBaseReg).addReg(PPC::LR);
Misha Brukmanb097f212004-07-26 18:13:24 +0000599 GlobalBaseInitialized = true;
600 }
Nate Begeman1f5308e2004-11-18 06:51:29 +0000601 return GlobalBaseReg;
Misha Brukmanb097f212004-07-26 18:13:24 +0000602}
603
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000604/// copyConstantToRegister - Output the instructions required to put the
605/// specified constant into the specified register.
606///
Misha Brukmana1dca552004-09-21 18:22:19 +0000607void PPC32ISel::copyConstantToRegister(MachineBasicBlock *MBB,
608 MachineBasicBlock::iterator IP,
609 Constant *C, unsigned R) {
Chris Lattner289a49a2004-10-16 18:13:47 +0000610 if (isa<UndefValue>(C)) {
611 BuildMI(*MBB, IP, PPC::IMPLICIT_DEF, 0, R);
Chris Lattner411eba02005-03-08 22:53:09 +0000612 if (getClassB(C->getType()) == cLong)
Chris Lattner3c707642005-01-14 20:22:02 +0000613 BuildMI(*MBB, IP, PPC::IMPLICIT_DEF, 0, R+1);
Chris Lattner289a49a2004-10-16 18:13:47 +0000614 return;
615 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000616 if (C->getType()->isIntegral()) {
617 unsigned Class = getClassB(C->getType());
618
619 if (Class == cLong) {
Misha Brukmana0af38c2004-07-28 19:13:49 +0000620 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(C)) {
621 uint64_t uval = CUI->getValue();
622 unsigned hiUVal = uval >> 32;
623 unsigned loUVal = uval;
624 ConstantUInt *CUHi = ConstantUInt::get(Type::UIntTy, hiUVal);
625 ConstantUInt *CULo = ConstantUInt::get(Type::UIntTy, loUVal);
626 copyConstantToRegister(MBB, IP, CUHi, R);
627 copyConstantToRegister(MBB, IP, CULo, R+1);
628 return;
629 } else if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(C)) {
630 int64_t sval = CSI->getValue();
631 int hiSVal = sval >> 32;
632 int loSVal = sval;
633 ConstantSInt *CSHi = ConstantSInt::get(Type::IntTy, hiSVal);
634 ConstantSInt *CSLo = ConstantSInt::get(Type::IntTy, loSVal);
635 copyConstantToRegister(MBB, IP, CSHi, R);
636 copyConstantToRegister(MBB, IP, CSLo, R+1);
637 return;
Misha Brukman7e898c32004-07-20 00:41:46 +0000638 } else {
Misha Brukmana0af38c2004-07-28 19:13:49 +0000639 std::cerr << "Unhandled long constant type!\n";
640 abort();
641 }
642 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000643
Misha Brukmana0af38c2004-07-28 19:13:49 +0000644 assert(Class <= cInt && "Type not handled yet!");
645
646 // Handle bool
647 if (C->getType() == Type::BoolTy) {
Misha Brukman5b570812004-08-10 22:47:03 +0000648 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(C == ConstantBool::True);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000649 return;
650 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000651
Misha Brukmana0af38c2004-07-28 19:13:49 +0000652 // Handle int
653 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(C)) {
654 unsigned uval = CUI->getValue();
655 if (uval < 32768) {
Misha Brukman5b570812004-08-10 22:47:03 +0000656 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(uval);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000657 } else {
658 unsigned Temp = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +0000659 BuildMI(*MBB, IP, PPC::LIS, 1, Temp).addSImm(uval >> 16);
Nate Begemanb816f022004-10-07 22:30:03 +0000660 BuildMI(*MBB, IP, PPC::ORI, 2, R).addReg(Temp).addImm(uval & 0xFFFF);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000661 }
662 return;
663 } else if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(C)) {
664 int sval = CSI->getValue();
665 if (sval < 32768 && sval >= -32768) {
Misha Brukman5b570812004-08-10 22:47:03 +0000666 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(sval);
Misha Brukmana0af38c2004-07-28 19:13:49 +0000667 } else {
668 unsigned Temp = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +0000669 BuildMI(*MBB, IP, PPC::LIS, 1, Temp).addSImm(sval >> 16);
Nate Begemanb816f022004-10-07 22:30:03 +0000670 BuildMI(*MBB, IP, PPC::ORI, 2, R).addReg(Temp).addImm(sval & 0xFFFF);
Misha Brukman7e898c32004-07-20 00:41:46 +0000671 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000672 return;
673 }
Misha Brukmana0af38c2004-07-28 19:13:49 +0000674 std::cerr << "Unhandled integer constant!\n";
675 abort();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000676 } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) {
Misha Brukmand18a31d2004-07-06 22:51:53 +0000677 // We need to spill the constant to memory...
678 MachineConstantPool *CP = F->getConstantPool();
679 unsigned CPI = CP->getConstantPoolIndex(CFP);
680 const Type *Ty = CFP->getType();
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000681
Misha Brukmand18a31d2004-07-06 22:51:53 +0000682 assert(Ty == Type::FloatTy || Ty == Type::DoubleTy && "Unknown FP type!");
Misha Brukmanfc879c32004-07-08 18:02:38 +0000683
Misha Brukmanb097f212004-07-26 18:13:24 +0000684 // Load addr of constant to reg; constant is located at base + distance
Misha Brukmanfc879c32004-07-08 18:02:38 +0000685 unsigned Reg1 = makeAnotherReg(Type::IntTy);
Nate Begeman07a73752004-08-17 07:17:44 +0000686 unsigned Opcode = (Ty == Type::FloatTy) ? PPC::LFS : PPC::LFD;
Misha Brukmanb097f212004-07-26 18:13:24 +0000687 // Move value at base + distance into return reg
Nate Begeman1f5308e2004-11-18 06:51:29 +0000688 BuildMI(*MBB, IP, PPC::LOADHiAddr, 2, Reg1)
Nate Begeman5e966612005-03-24 06:28:42 +0000689 .addReg(getGlobalBaseReg()).addConstantPoolIndex(CPI);
Nate Begemaned428532004-09-04 05:00:00 +0000690 BuildMI(*MBB, IP, Opcode, 2, R).addConstantPoolIndex(CPI).addReg(Reg1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000691 } else if (isa<ConstantPointerNull>(C)) {
692 // Copy zero (null pointer) to the register.
Misha Brukman5b570812004-08-10 22:47:03 +0000693 BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(0);
Chris Lattner67910e12004-07-18 07:29:35 +0000694 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) {
Misha Brukmanb097f212004-07-26 18:13:24 +0000695 // GV is located at base + distance
Misha Brukmanba1c1da2004-07-20 00:59:38 +0000696 unsigned TmpReg = makeAnotherReg(GV->getType());
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000697
Misha Brukmanb097f212004-07-26 18:13:24 +0000698 // Move value at base + distance into return reg
Nate Begeman1f5308e2004-11-18 06:51:29 +0000699 BuildMI(*MBB, IP, PPC::LOADHiAddr, 2, TmpReg)
Nate Begeman5e966612005-03-24 06:28:42 +0000700 .addReg(getGlobalBaseReg()).addGlobalAddress(GV);
Chris Lattner6540c6c2004-11-23 05:54:25 +0000701
Nate Begemand4c8bea2004-11-25 07:09:01 +0000702 if (GV->hasWeakLinkage() || GV->isExternal()) {
Chris Lattner6540c6c2004-11-23 05:54:25 +0000703 BuildMI(*MBB, IP, PPC::LWZ, 2, R).addGlobalAddress(GV).addReg(TmpReg);
704 } else {
705 BuildMI(*MBB, IP, PPC::LA, 2, R).addReg(TmpReg).addGlobalAddress(GV);
706 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000707 } else {
Chris Lattner76e2df22004-07-15 02:14:30 +0000708 std::cerr << "Offending constant: " << *C << "\n";
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000709 assert(0 && "Type not handled yet!");
710 }
711}
712
713/// LoadArgumentsToVirtualRegs - Load all of the arguments to this function from
714/// the stack into virtual registers.
Misha Brukmana1dca552004-09-21 18:22:19 +0000715void PPC32ISel::LoadArgumentsToVirtualRegs(Function &Fn) {
Chris Lattner3ea93462004-08-06 06:58:50 +0000716 unsigned ArgOffset = 24;
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000717 unsigned GPR_remaining = 8;
718 unsigned FPR_remaining = 13;
Misha Brukmand18a31d2004-07-06 22:51:53 +0000719 unsigned GPR_idx = 0, FPR_idx = 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000720 static const unsigned GPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +0000721 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
722 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
Misha Brukmand18a31d2004-07-06 22:51:53 +0000723 };
724 static const unsigned FPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +0000725 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7,
726 PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13
Misha Brukmand18a31d2004-07-06 22:51:53 +0000727 };
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000728
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000729 MachineFrameInfo *MFI = F->getFrameInfo();
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000730
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000731 for (Function::arg_iterator I = Fn.arg_begin(), E = Fn.arg_end();
732 I != E; ++I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000733 bool ArgLive = !I->use_empty();
734 unsigned Reg = ArgLive ? getReg(*I) : 0;
735 int FI; // Frame object index
736
737 switch (getClassB(I->getType())) {
738 case cByte:
739 if (ArgLive) {
Misha Brukmanec6319a2004-07-20 15:51:37 +0000740 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000741 if (GPR_remaining > 0) {
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000742 F->addLiveIn(GPR[GPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000743 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000744 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000745 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000746 addFrameReference(BuildMI(BB, PPC::LBZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000747 }
748 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000749 break;
750 case cShort:
751 if (ArgLive) {
Misha Brukmanec6319a2004-07-20 15:51:37 +0000752 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000753 if (GPR_remaining > 0) {
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000754 F->addLiveIn(GPR[GPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000755 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000756 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000757 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000758 addFrameReference(BuildMI(BB, PPC::LHZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000759 }
760 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000761 break;
762 case cInt:
763 if (ArgLive) {
764 FI = MFI->CreateFixedObject(4, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000765 if (GPR_remaining > 0) {
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000766 F->addLiveIn(GPR[GPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000767 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukmand18a31d2004-07-06 22:51:53 +0000768 .addReg(GPR[GPR_idx]);
Misha Brukman422791f2004-06-21 17:41:12 +0000769 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000770 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000771 }
772 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000773 break;
774 case cLong:
775 if (ArgLive) {
776 FI = MFI->CreateFixedObject(8, ArgOffset);
Misha Brukman422791f2004-06-21 17:41:12 +0000777 if (GPR_remaining > 1) {
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000778 F->addLiveIn(GPR[GPR_idx]);
779 F->addLiveIn(GPR[GPR_idx+1]);
Misha Brukman5b570812004-08-10 22:47:03 +0000780 BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx])
Misha Brukman313efcb2004-07-09 15:45:07 +0000781 .addReg(GPR[GPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000782 BuildMI(BB, PPC::OR, 2, Reg+1).addReg(GPR[GPR_idx+1])
Misha Brukman313efcb2004-07-09 15:45:07 +0000783 .addReg(GPR[GPR_idx+1]);
Misha Brukman422791f2004-06-21 17:41:12 +0000784 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000785 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg), FI);
786 addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg+1), FI, 4);
Misha Brukman422791f2004-06-21 17:41:12 +0000787 }
788 }
Misha Brukman1013ef52004-07-21 20:09:08 +0000789 // longs require 4 additional bytes and use 2 GPRs
790 ArgOffset += 4;
Misha Brukman422791f2004-06-21 17:41:12 +0000791 if (GPR_remaining > 1) {
Misha Brukman1013ef52004-07-21 20:09:08 +0000792 GPR_remaining--;
Misha Brukman422791f2004-06-21 17:41:12 +0000793 GPR_idx++;
794 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000795 break;
Misha Brukman7e898c32004-07-20 00:41:46 +0000796 case cFP32:
797 if (ArgLive) {
798 FI = MFI->CreateFixedObject(4, ArgOffset);
799
Misha Brukman422791f2004-06-21 17:41:12 +0000800 if (FPR_remaining > 0) {
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000801 F->addLiveIn(FPR[FPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000802 BuildMI(BB, PPC::FMR, 1, Reg).addReg(FPR[FPR_idx]);
Misha Brukmand18a31d2004-07-06 22:51:53 +0000803 FPR_remaining--;
804 FPR_idx++;
Misha Brukman422791f2004-06-21 17:41:12 +0000805 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000806 addFrameReference(BuildMI(BB, PPC::LFS, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000807 }
808 }
Misha Brukman7e898c32004-07-20 00:41:46 +0000809 break;
810 case cFP64:
811 if (ArgLive) {
812 FI = MFI->CreateFixedObject(8, ArgOffset);
813
814 if (FPR_remaining > 0) {
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000815 F->addLiveIn(FPR[FPR_idx]);
Misha Brukman5b570812004-08-10 22:47:03 +0000816 BuildMI(BB, PPC::FMR, 1, Reg).addReg(FPR[FPR_idx]);
Misha Brukman7e898c32004-07-20 00:41:46 +0000817 FPR_remaining--;
818 FPR_idx++;
819 } else {
Misha Brukman5b570812004-08-10 22:47:03 +0000820 addFrameReference(BuildMI(BB, PPC::LFD, 2, Reg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +0000821 }
822 }
Misha Brukman7e898c32004-07-20 00:41:46 +0000823
824 // doubles require 4 additional bytes and use 2 GPRs of param space
Misha Brukmanb5f662f2005-04-21 23:30:14 +0000825 ArgOffset += 4;
Misha Brukman7e898c32004-07-20 00:41:46 +0000826 if (GPR_remaining > 0) {
827 GPR_remaining--;
828 GPR_idx++;
829 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000830 break;
831 default:
832 assert(0 && "Unhandled argument type!");
833 }
834 ArgOffset += 4; // Each argument takes at least 4 bytes on the stack...
Misha Brukman422791f2004-06-21 17:41:12 +0000835 if (GPR_remaining > 0) {
Misha Brukmand18a31d2004-07-06 22:51:53 +0000836 GPR_remaining--; // uses up 2 GPRs
837 GPR_idx++;
Misha Brukman422791f2004-06-21 17:41:12 +0000838 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000839 }
840
841 // If the function takes variable number of arguments, add a frame offset for
842 // the start of the first vararg value... this is used to expand
843 // llvm.va_start.
844 if (Fn.getFunctionType()->isVarArg())
Misha Brukmanb097f212004-07-26 18:13:24 +0000845 VarArgsFrameIndex = MFI->CreateFixedObject(4, ArgOffset);
Chris Lattnerf429a3e2005-04-09 16:32:30 +0000846
847 if (Fn.getReturnType() != Type::VoidTy)
848 switch (getClassB(Fn.getReturnType())) {
849 case cByte:
850 case cShort:
851 case cInt:
852 F->addLiveOut(PPC::R3);
853 break;
854 case cLong:
855 F->addLiveOut(PPC::R3);
856 F->addLiveOut(PPC::R4);
857 break;
858 case cFP32:
859 case cFP64:
860 F->addLiveOut(PPC::F1);
861 break;
862 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000863}
864
865
866/// SelectPHINodes - Insert machine code to generate phis. This is tricky
867/// because we have to generate our sources into the source basic blocks, not
868/// the current one.
869///
Misha Brukmana1dca552004-09-21 18:22:19 +0000870void PPC32ISel::SelectPHINodes() {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000871 const TargetInstrInfo &TII = *TM.getInstrInfo();
872 const Function &LF = *F->getFunction(); // The LLVM function...
Chris Lattner9184bfb2005-04-09 22:05:17 +0000873
874 MachineBasicBlock::iterator MFLRIt = F->begin()->begin();
875 if (GlobalBaseInitialized) {
876 // If we emitted a MFLR for the global base reg, get an iterator to an
877 // instruction after it.
878 while (MFLRIt->getOpcode() != PPC::MFLR)
879 ++MFLRIt;
880 ++MFLRIt; // step one MI past it.
881 }
882
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000883 for (Function::const_iterator I = LF.begin(), E = LF.end(); I != E; ++I) {
884 const BasicBlock *BB = I;
885 MachineBasicBlock &MBB = *MBBMap[I];
886
887 // Loop over all of the PHI nodes in the LLVM basic block...
888 MachineBasicBlock::iterator PHIInsertPoint = MBB.begin();
889 for (BasicBlock::const_iterator I = BB->begin();
890 PHINode *PN = const_cast<PHINode*>(dyn_cast<PHINode>(I)); ++I) {
891
892 // Create a new machine instr PHI node, and insert it.
893 unsigned PHIReg = getReg(*PN);
894 MachineInstr *PhiMI = BuildMI(MBB, PHIInsertPoint,
Misha Brukman5b570812004-08-10 22:47:03 +0000895 PPC::PHI, PN->getNumOperands(), PHIReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000896
897 MachineInstr *LongPhiMI = 0;
898 if (PN->getType() == Type::LongTy || PN->getType() == Type::ULongTy)
899 LongPhiMI = BuildMI(MBB, PHIInsertPoint,
Misha Brukman5b570812004-08-10 22:47:03 +0000900 PPC::PHI, PN->getNumOperands(), PHIReg+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000901
902 // PHIValues - Map of blocks to incoming virtual registers. We use this
903 // so that we only initialize one incoming value for a particular block,
904 // even if the block has multiple entries in the PHI node.
905 //
906 std::map<MachineBasicBlock*, unsigned> PHIValues;
907
908 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
Misha Brukman313efcb2004-07-09 15:45:07 +0000909 MachineBasicBlock *PredMBB = 0;
910 for (MachineBasicBlock::pred_iterator PI = MBB.pred_begin (),
911 PE = MBB.pred_end (); PI != PE; ++PI)
912 if (PN->getIncomingBlock(i) == (*PI)->getBasicBlock()) {
913 PredMBB = *PI;
914 break;
915 }
916 assert (PredMBB && "Couldn't find incoming machine-cfg edge for phi");
917
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000918 unsigned ValReg;
919 std::map<MachineBasicBlock*, unsigned>::iterator EntryIt =
920 PHIValues.lower_bound(PredMBB);
921
922 if (EntryIt != PHIValues.end() && EntryIt->first == PredMBB) {
923 // We already inserted an initialization of the register for this
924 // predecessor. Recycle it.
925 ValReg = EntryIt->second;
Misha Brukman47225442004-07-23 22:35:49 +0000926 } else {
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000927 // Get the incoming value into a virtual register.
928 //
929 Value *Val = PN->getIncomingValue(i);
930
931 // If this is a constant or GlobalValue, we may have to insert code
932 // into the basic block to compute it into a virtual register.
933 if ((isa<Constant>(Val) && !isa<ConstantExpr>(Val)) ||
934 isa<GlobalValue>(Val)) {
935 // Simple constants get emitted at the end of the basic block,
936 // before any terminator instructions. We "know" that the code to
937 // move a constant into a register will never clobber any flags.
938 ValReg = getReg(Val, PredMBB, PredMBB->getFirstTerminator());
939 } else {
940 // Because we don't want to clobber any values which might be in
941 // physical registers with the computation of this constant (which
942 // might be arbitrarily complex if it is a constant expression),
943 // just insert the computation at the top of the basic block.
944 MachineBasicBlock::iterator PI = PredMBB->begin();
Misha Brukman47225442004-07-23 22:35:49 +0000945
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000946 // Skip over any PHI nodes though!
Misha Brukman5b570812004-08-10 22:47:03 +0000947 while (PI != PredMBB->end() && PI->getOpcode() == PPC::PHI)
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000948 ++PI;
Misha Brukman47225442004-07-23 22:35:49 +0000949
Chris Lattner9184bfb2005-04-09 22:05:17 +0000950 // If this is the entry block, and if the entry block contains a
951 // MFLR instruction, emit this operation after it. This is needed
952 // because global addresses use it.
953 if (PredMBB == F->begin())
954 PI = MFLRIt;
955
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000956 ValReg = getReg(Val, PredMBB, PI);
957 }
958
959 // Remember that we inserted a value for this PHI for this predecessor
960 PHIValues.insert(EntryIt, std::make_pair(PredMBB, ValReg));
961 }
962
963 PhiMI->addRegOperand(ValReg);
964 PhiMI->addMachineBasicBlockOperand(PredMBB);
965 if (LongPhiMI) {
966 LongPhiMI->addRegOperand(ValReg+1);
967 LongPhiMI->addMachineBasicBlockOperand(PredMBB);
968 }
969 }
970
971 // Now that we emitted all of the incoming values for the PHI node, make
972 // sure to reposition the InsertPoint after the PHI that we just added.
973 // This is needed because we might have inserted a constant into this
974 // block, right after the PHI's which is before the old insert point!
975 PHIInsertPoint = LongPhiMI ? LongPhiMI : PhiMI;
976 ++PHIInsertPoint;
977 }
978 }
979}
980
981
982// canFoldSetCCIntoBranchOrSelect - Return the setcc instruction if we can fold
983// it into the conditional branch or select instruction which is the only user
984// of the cc instruction. This is the case if the conditional branch is the
985// only user of the setcc, and if the setcc is in the same basic block as the
Misha Brukman1013ef52004-07-21 20:09:08 +0000986// conditional branch.
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000987//
988static SetCondInst *canFoldSetCCIntoBranchOrSelect(Value *V) {
989 if (SetCondInst *SCI = dyn_cast<SetCondInst>(V))
990 if (SCI->hasOneUse()) {
991 Instruction *User = cast<Instruction>(SCI->use_back());
Chris Lattnerfbd4de12005-01-14 19:31:00 +0000992 if ((isa<BranchInst>(User) ||
993 (isa<SelectInst>(User) && User->getOperand(0) == V)) &&
Misha Brukmanbebde752004-07-16 21:06:24 +0000994 SCI->getParent() == User->getParent())
Misha Brukman5dfe3a92004-06-21 16:55:25 +0000995 return SCI;
996 }
997 return 0;
998}
999
Misha Brukmanb097f212004-07-26 18:13:24 +00001000// canFoldGEPIntoLoadOrStore - Return the GEP instruction if we can fold it into
1001// the load or store instruction that is the only user of the GEP.
1002//
1003static GetElementPtrInst *canFoldGEPIntoLoadOrStore(Value *V) {
Nate Begeman645495d2004-09-23 05:31:33 +00001004 if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(V)) {
1005 bool AllUsesAreMem = true;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001006 for (Value::use_iterator I = GEPI->use_begin(), E = GEPI->use_end();
Nate Begeman645495d2004-09-23 05:31:33 +00001007 I != E; ++I) {
1008 Instruction *User = cast<Instruction>(*I);
1009
1010 // If the GEP is the target of a store, but not the source, then we are ok
1011 // to fold it.
Misha Brukmanb097f212004-07-26 18:13:24 +00001012 if (isa<StoreInst>(User) &&
1013 GEPI->getParent() == User->getParent() &&
1014 User->getOperand(0) != GEPI &&
Nate Begeman645495d2004-09-23 05:31:33 +00001015 User->getOperand(1) == GEPI)
1016 continue;
1017
1018 // If the GEP is the source of a load, then we're always ok to fold it
Misha Brukmanb097f212004-07-26 18:13:24 +00001019 if (isa<LoadInst>(User) &&
1020 GEPI->getParent() == User->getParent() &&
Nate Begeman645495d2004-09-23 05:31:33 +00001021 User->getOperand(0) == GEPI)
1022 continue;
1023
1024 // if we got to this point, than the instruction was not a load or store
1025 // that we are capable of folding the GEP into.
1026 AllUsesAreMem = false;
1027 break;
Misha Brukmanb097f212004-07-26 18:13:24 +00001028 }
Nate Begeman645495d2004-09-23 05:31:33 +00001029 if (AllUsesAreMem)
1030 return GEPI;
1031 }
Misha Brukmanb097f212004-07-26 18:13:24 +00001032 return 0;
1033}
1034
1035
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001036// Return a fixed numbering for setcc instructions which does not depend on the
1037// order of the opcodes.
1038//
1039static unsigned getSetCCNumber(unsigned Opcode) {
Misha Brukmane9c65512004-07-06 15:32:44 +00001040 switch (Opcode) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001041 default: assert(0 && "Unknown setcc instruction!");
1042 case Instruction::SetEQ: return 0;
1043 case Instruction::SetNE: return 1;
1044 case Instruction::SetLT: return 2;
1045 case Instruction::SetGE: return 3;
1046 case Instruction::SetGT: return 4;
1047 case Instruction::SetLE: return 5;
1048 }
1049}
1050
Chris Lattner51d2ed92005-04-10 01:03:31 +00001051static unsigned getPPCOpcodeForSetCCOpcode(unsigned Opcode) {
Misha Brukmane9c65512004-07-06 15:32:44 +00001052 switch (Opcode) {
1053 default: assert(0 && "Unknown setcc instruction!");
Misha Brukman5b570812004-08-10 22:47:03 +00001054 case Instruction::SetEQ: return PPC::BEQ;
1055 case Instruction::SetNE: return PPC::BNE;
1056 case Instruction::SetLT: return PPC::BLT;
1057 case Instruction::SetGE: return PPC::BGE;
1058 case Instruction::SetGT: return PPC::BGT;
1059 case Instruction::SetLE: return PPC::BLE;
Misha Brukmane9c65512004-07-06 15:32:44 +00001060 }
1061}
1062
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001063/// emitUCOM - emits an unordered FP compare.
Misha Brukmana1dca552004-09-21 18:22:19 +00001064void PPC32ISel::emitUCOM(MachineBasicBlock *MBB, MachineBasicBlock::iterator IP,
1065 unsigned LHS, unsigned RHS) {
Misha Brukman5b570812004-08-10 22:47:03 +00001066 BuildMI(*MBB, IP, PPC::FCMPU, 2, PPC::CR0).addReg(LHS).addReg(RHS);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001067}
1068
Misha Brukmana1dca552004-09-21 18:22:19 +00001069unsigned PPC32ISel::ExtendOrClear(MachineBasicBlock *MBB,
1070 MachineBasicBlock::iterator IP,
Nate Begemana2de1022004-09-22 04:40:25 +00001071 Value *Op0) {
Nate Begeman0e5e5f52004-08-22 08:10:15 +00001072 const Type *CompTy = Op0->getType();
1073 unsigned Reg = getReg(Op0, MBB, IP);
Nate Begemanb47321b2004-08-20 09:56:22 +00001074 unsigned Class = getClassB(CompTy);
1075
Nate Begeman1b99fd32004-09-29 03:45:33 +00001076 // Since we know that boolean values will be either zero or one, we don't
1077 // have to extend or clear them.
1078 if (CompTy == Type::BoolTy)
1079 return Reg;
1080
Nate Begemanb47321b2004-08-20 09:56:22 +00001081 // Before we do a comparison or SetCC, we have to make sure that we truncate
1082 // the source registers appropriately.
1083 if (Class == cByte) {
1084 unsigned TmpReg = makeAnotherReg(CompTy);
1085 if (CompTy->isSigned())
1086 BuildMI(*MBB, IP, PPC::EXTSB, 1, TmpReg).addReg(Reg);
1087 else
1088 BuildMI(*MBB, IP, PPC::RLWINM, 4, TmpReg).addReg(Reg).addImm(0)
1089 .addImm(24).addImm(31);
1090 Reg = TmpReg;
1091 } else if (Class == cShort) {
1092 unsigned TmpReg = makeAnotherReg(CompTy);
1093 if (CompTy->isSigned())
1094 BuildMI(*MBB, IP, PPC::EXTSH, 1, TmpReg).addReg(Reg);
1095 else
1096 BuildMI(*MBB, IP, PPC::RLWINM, 4, TmpReg).addReg(Reg).addImm(0)
1097 .addImm(16).addImm(31);
1098 Reg = TmpReg;
1099 }
1100 return Reg;
1101}
1102
Chris Lattner51d2ed92005-04-10 01:03:31 +00001103/// EmitComparison - emits a comparison of the two operands. The result is in
1104/// CR0.
Misha Brukmanbebde752004-07-16 21:06:24 +00001105///
Chris Lattner51d2ed92005-04-10 01:03:31 +00001106void PPC32ISel::EmitComparison(unsigned OpNum, Value *Op0, Value *Op1,
1107 MachineBasicBlock *MBB,
1108 MachineBasicBlock::iterator IP) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001109 // The arguments are already supposed to be of the same type.
1110 const Type *CompTy = Op0->getType();
1111 unsigned Class = getClassB(CompTy);
Nate Begemana2de1022004-09-22 04:40:25 +00001112 unsigned Op0r = ExtendOrClear(MBB, IP, Op0);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001113
Misha Brukman1013ef52004-07-21 20:09:08 +00001114 // Use crand for lt, gt and crandc for le, ge
Misha Brukman5b570812004-08-10 22:47:03 +00001115 unsigned CROpcode = (OpNum == 2 || OpNum == 4) ? PPC::CRAND : PPC::CRANDC;
Misha Brukman1013ef52004-07-21 20:09:08 +00001116 // ? cr1[lt] : cr1[gt]
Nate Begemanef7288c2005-04-14 03:20:38 +00001117 unsigned CR1field = (OpNum == 2 || OpNum == 3) ? 0 : 1;
Misha Brukman1013ef52004-07-21 20:09:08 +00001118 // ? cr0[lt] : cr0[gt]
1119 unsigned CR0field = (OpNum == 2 || OpNum == 5) ? 0 : 1;
Misha Brukman5b570812004-08-10 22:47:03 +00001120 unsigned Opcode = CompTy->isSigned() ? PPC::CMPW : PPC::CMPLW;
1121 unsigned OpcodeImm = CompTy->isSigned() ? PPC::CMPWI : PPC::CMPLWI;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001122
1123 // Special case handling of: cmp R, i
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001124 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001125 if (Class == cByte || Class == cShort || Class == cInt) {
Misha Brukman1013ef52004-07-21 20:09:08 +00001126 unsigned Op1v = CI->getRawValue() & 0xFFFF;
Nate Begeman43d64ea2004-08-15 06:42:28 +00001127 unsigned OpClass = (CompTy->isSigned()) ? 0 : 2;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001128
Misha Brukman1013ef52004-07-21 20:09:08 +00001129 // Treat compare like ADDI for the purposes of immediate suitability
Nate Begemanb816f022004-10-07 22:30:03 +00001130 if (canUseAsImmediateForOpcode(CI, OpClass, false)) {
Misha Brukman5b570812004-08-10 22:47:03 +00001131 BuildMI(*MBB, IP, OpcodeImm, 2, PPC::CR0).addReg(Op0r).addSImm(Op1v);
Misha Brukman422791f2004-06-21 17:41:12 +00001132 } else {
1133 unsigned Op1r = getReg(Op1, MBB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00001134 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
Misha Brukman422791f2004-06-21 17:41:12 +00001135 }
Chris Lattner51d2ed92005-04-10 01:03:31 +00001136 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001137 } else {
1138 assert(Class == cLong && "Unknown integer class!");
1139 unsigned LowCst = CI->getRawValue();
1140 unsigned HiCst = CI->getRawValue() >> 32;
1141 if (OpNum < 2) { // seteq, setne
Misha Brukman1013ef52004-07-21 20:09:08 +00001142 unsigned LoLow = makeAnotherReg(Type::IntTy);
1143 unsigned LoTmp = makeAnotherReg(Type::IntTy);
1144 unsigned HiLow = makeAnotherReg(Type::IntTy);
1145 unsigned HiTmp = makeAnotherReg(Type::IntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001146 unsigned FinalTmp = makeAnotherReg(Type::IntTy);
Misha Brukman47225442004-07-23 22:35:49 +00001147
Misha Brukman5b570812004-08-10 22:47:03 +00001148 BuildMI(*MBB, IP, PPC::XORI, 2, LoLow).addReg(Op0r+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001149 .addImm(LowCst & 0xFFFF);
Misha Brukman5b570812004-08-10 22:47:03 +00001150 BuildMI(*MBB, IP, PPC::XORIS, 2, LoTmp).addReg(LoLow)
Misha Brukman1013ef52004-07-21 20:09:08 +00001151 .addImm(LowCst >> 16);
Misha Brukman5b570812004-08-10 22:47:03 +00001152 BuildMI(*MBB, IP, PPC::XORI, 2, HiLow).addReg(Op0r)
Misha Brukman1013ef52004-07-21 20:09:08 +00001153 .addImm(HiCst & 0xFFFF);
Misha Brukman5b570812004-08-10 22:47:03 +00001154 BuildMI(*MBB, IP, PPC::XORIS, 2, HiTmp).addReg(HiLow)
Misha Brukman1013ef52004-07-21 20:09:08 +00001155 .addImm(HiCst >> 16);
Misha Brukman5b570812004-08-10 22:47:03 +00001156 BuildMI(*MBB, IP, PPC::ORo, 2, FinalTmp).addReg(LoTmp).addReg(HiTmp);
Chris Lattner51d2ed92005-04-10 01:03:31 +00001157 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001158 } else {
Misha Brukmanbebde752004-07-16 21:06:24 +00001159 unsigned ConstReg = makeAnotherReg(CompTy);
Misha Brukmanbebde752004-07-16 21:06:24 +00001160 copyConstantToRegister(MBB, IP, CI, ConstReg);
Misha Brukman47225442004-07-23 22:35:49 +00001161
Misha Brukman1013ef52004-07-21 20:09:08 +00001162 // cr0 = r3 ccOpcode r5 or (r3 == r5 AND r4 ccOpcode r6)
Misha Brukman5b570812004-08-10 22:47:03 +00001163 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r)
Misha Brukmanbebde752004-07-16 21:06:24 +00001164 .addReg(ConstReg);
Misha Brukman5b570812004-08-10 22:47:03 +00001165 BuildMI(*MBB, IP, Opcode, 2, PPC::CR1).addReg(Op0r+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001166 .addReg(ConstReg+1);
Nate Begemanef7288c2005-04-14 03:20:38 +00001167 BuildMI(*MBB, IP, PPC::CRAND, 5, PPC::CR0).addImm(2)
1168 .addReg(PPC::CR0).addImm(2).addReg(PPC::CR1).addImm(CR1field);
1169 BuildMI(*MBB, IP, PPC::CROR, 5, PPC::CR0).addImm(CR0field)
1170 .addReg(PPC::CR0).addImm(CR0field).addReg(PPC::CR0).addImm(2);
Chris Lattner51d2ed92005-04-10 01:03:31 +00001171 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001172 }
1173 }
1174 }
1175
1176 unsigned Op1r = getReg(Op1, MBB, IP);
Misha Brukman1013ef52004-07-21 20:09:08 +00001177
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001178 switch (Class) {
1179 default: assert(0 && "Unknown type class!");
1180 case cByte:
1181 case cShort:
1182 case cInt:
Misha Brukman5b570812004-08-10 22:47:03 +00001183 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001184 break;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001185
Misha Brukman7e898c32004-07-20 00:41:46 +00001186 case cFP32:
1187 case cFP64:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001188 emitUCOM(MBB, IP, Op0r, Op1r);
1189 break;
1190
1191 case cLong:
1192 if (OpNum < 2) { // seteq, setne
1193 unsigned LoTmp = makeAnotherReg(Type::IntTy);
1194 unsigned HiTmp = makeAnotherReg(Type::IntTy);
1195 unsigned FinalTmp = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00001196 BuildMI(*MBB, IP, PPC::XOR, 2, HiTmp).addReg(Op0r).addReg(Op1r);
1197 BuildMI(*MBB, IP, PPC::XOR, 2, LoTmp).addReg(Op0r+1).addReg(Op1r+1);
1198 BuildMI(*MBB, IP, PPC::ORo, 2, FinalTmp).addReg(LoTmp).addReg(HiTmp);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001199 break; // Allow the sete or setne to be generated from flags set by OR
1200 } else {
Misha Brukmanbebde752004-07-16 21:06:24 +00001201 unsigned TmpReg1 = makeAnotherReg(Type::IntTy);
1202 unsigned TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman1013ef52004-07-21 20:09:08 +00001203
1204 // cr0 = r3 ccOpcode r5 or (r3 == r5 AND r4 ccOpcode r6)
Misha Brukman5b570812004-08-10 22:47:03 +00001205 BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r);
1206 BuildMI(*MBB, IP, Opcode, 2, PPC::CR1).addReg(Op0r+1).addReg(Op1r+1);
Nate Begemanef7288c2005-04-14 03:20:38 +00001207 BuildMI(*MBB, IP, PPC::CRAND, 5, PPC::CR0).addImm(2)
1208 .addReg(PPC::CR0).addImm(2).addReg(PPC::CR1).addImm(CR1field);
1209 BuildMI(*MBB, IP, PPC::CROR, 5, PPC::CR0).addImm(CR0field)
1210 .addReg(PPC::CR0).addImm(CR0field).addReg(PPC::CR0).addImm(2);
Chris Lattner51d2ed92005-04-10 01:03:31 +00001211 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001212 }
1213 }
Chris Lattner51d2ed92005-04-10 01:03:31 +00001214 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001215}
1216
Misha Brukmand18a31d2004-07-06 22:51:53 +00001217/// visitSetCondInst - emit code to calculate the condition via
1218/// EmitComparison(), and possibly store a 0 or 1 to a register as a result
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001219///
Misha Brukmana1dca552004-09-21 18:22:19 +00001220void PPC32ISel::visitSetCondInst(SetCondInst &I) {
Misha Brukmand18a31d2004-07-06 22:51:53 +00001221 if (canFoldSetCCIntoBranchOrSelect(&I))
Misha Brukmane9c65512004-07-06 15:32:44 +00001222 return;
Misha Brukmanbebde752004-07-16 21:06:24 +00001223
Nate Begemana2de1022004-09-22 04:40:25 +00001224 MachineBasicBlock::iterator MI = BB->end();
1225 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
1226 const Type *Ty = Op0->getType();
1227 unsigned Class = getClassB(Ty);
Nate Begemana96c4af2004-08-21 20:42:14 +00001228 unsigned Opcode = I.getOpcode();
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001229 unsigned OpNum = getSetCCNumber(Opcode);
Nate Begemana2de1022004-09-22 04:40:25 +00001230 unsigned DestReg = getReg(I);
1231
1232 // If the comparison type is byte, short, or int, then we can emit a
1233 // branchless version of the SetCC that puts 0 (false) or 1 (true) in the
1234 // destination register.
1235 if (Class <= cInt) {
1236 ConstantInt *CI = dyn_cast<ConstantInt>(Op1);
1237
1238 if (CI && CI->getRawValue() == 0) {
Nate Begemana2de1022004-09-22 04:40:25 +00001239 unsigned Op0Reg = ExtendOrClear(BB, MI, Op0);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001240
Nate Begemana2de1022004-09-22 04:40:25 +00001241 // comparisons against constant zero and negative one often have shorter
1242 // and/or faster sequences than the set-and-branch general case, handled
1243 // below.
1244 switch(OpNum) {
1245 case 0: { // eq0
1246 unsigned TempReg = makeAnotherReg(Type::IntTy);
1247 BuildMI(*BB, MI, PPC::CNTLZW, 1, TempReg).addReg(Op0Reg);
1248 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(TempReg).addImm(27)
1249 .addImm(5).addImm(31);
1250 break;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001251 }
Nate Begemana2de1022004-09-22 04:40:25 +00001252 case 1: { // ne0
1253 unsigned TempReg = makeAnotherReg(Type::IntTy);
1254 BuildMI(*BB, MI, PPC::ADDIC, 2, TempReg).addReg(Op0Reg).addSImm(-1);
1255 BuildMI(*BB, MI, PPC::SUBFE, 2, DestReg).addReg(TempReg).addReg(Op0Reg);
1256 break;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001257 }
Nate Begemana2de1022004-09-22 04:40:25 +00001258 case 2: { // lt0, always false if unsigned
1259 if (Ty->isSigned())
1260 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Op0Reg).addImm(1)
1261 .addImm(31).addImm(31);
1262 else
1263 BuildMI(*BB, MI, PPC::LI, 1, DestReg).addSImm(0);
1264 break;
1265 }
1266 case 3: { // ge0, always true if unsigned
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001267 if (Ty->isSigned()) {
Nate Begemana2de1022004-09-22 04:40:25 +00001268 unsigned TempReg = makeAnotherReg(Type::IntTy);
1269 BuildMI(*BB, MI, PPC::RLWINM, 4, TempReg).addReg(Op0Reg).addImm(1)
1270 .addImm(31).addImm(31);
1271 BuildMI(*BB, MI, PPC::XORI, 2, DestReg).addReg(TempReg).addImm(1);
1272 } else {
1273 BuildMI(*BB, MI, PPC::LI, 1, DestReg).addSImm(1);
1274 }
1275 break;
1276 }
1277 case 4: { // gt0, equivalent to ne0 if unsigned
1278 unsigned Temp1 = makeAnotherReg(Type::IntTy);
1279 unsigned Temp2 = makeAnotherReg(Type::IntTy);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001280 if (Ty->isSigned()) {
Nate Begemana2de1022004-09-22 04:40:25 +00001281 BuildMI(*BB, MI, PPC::NEG, 2, Temp1).addReg(Op0Reg);
1282 BuildMI(*BB, MI, PPC::ANDC, 2, Temp2).addReg(Temp1).addReg(Op0Reg);
1283 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp2).addImm(1)
1284 .addImm(31).addImm(31);
1285 } else {
1286 BuildMI(*BB, MI, PPC::ADDIC, 2, Temp1).addReg(Op0Reg).addSImm(-1);
1287 BuildMI(*BB, MI, PPC::SUBFE, 2, DestReg).addReg(Temp1).addReg(Op0Reg);
1288 }
1289 break;
1290 }
1291 case 5: { // le0, equivalent to eq0 if unsigned
1292 unsigned Temp1 = makeAnotherReg(Type::IntTy);
1293 unsigned Temp2 = makeAnotherReg(Type::IntTy);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001294 if (Ty->isSigned()) {
Nate Begemana2de1022004-09-22 04:40:25 +00001295 BuildMI(*BB, MI, PPC::NEG, 2, Temp1).addReg(Op0Reg);
1296 BuildMI(*BB, MI, PPC::ORC, 2, Temp2).addReg(Op0Reg).addReg(Temp1);
1297 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp2).addImm(1)
1298 .addImm(31).addImm(31);
1299 } else {
1300 BuildMI(*BB, MI, PPC::CNTLZW, 1, Temp1).addReg(Op0Reg);
1301 BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp1).addImm(27)
1302 .addImm(5).addImm(31);
1303 }
1304 break;
1305 }
1306 } // switch
1307 return;
Misha Brukman7847fca2005-04-22 17:54:37 +00001308 }
Nate Begemana2de1022004-09-22 04:40:25 +00001309 }
Chris Lattner51d2ed92005-04-10 01:03:31 +00001310 unsigned PPCOpcode = getPPCOpcodeForSetCCOpcode(Opcode);
Nate Begemana96c4af2004-08-21 20:42:14 +00001311
1312 // Create an iterator with which to insert the MBB for copying the false value
1313 // and the MBB to hold the PHI instruction for this SetCC.
Misha Brukman425ff242004-07-01 21:34:10 +00001314 MachineBasicBlock *thisMBB = BB;
1315 const BasicBlock *LLVM_BB = BB->getBasicBlock();
Misha Brukman7e898c32004-07-20 00:41:46 +00001316 ilist<MachineBasicBlock>::iterator It = BB;
1317 ++It;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001318
Misha Brukman425ff242004-07-01 21:34:10 +00001319 // thisMBB:
1320 // ...
1321 // cmpTY cr0, r1, r2
Misha Brukman425ff242004-07-01 21:34:10 +00001322 // %TrueValue = li 1
Nate Begemana96c4af2004-08-21 20:42:14 +00001323 // bCC sinkMBB
Chris Lattner51d2ed92005-04-10 01:03:31 +00001324 EmitComparison(OpNum, Op0, Op1, BB, BB->end());
Misha Brukmane2eceb52004-07-23 16:08:20 +00001325 unsigned TrueValue = makeAnotherReg(I.getType());
Misha Brukman5b570812004-08-10 22:47:03 +00001326 BuildMI(BB, PPC::LI, 1, TrueValue).addSImm(1);
Nate Begemana96c4af2004-08-21 20:42:14 +00001327 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
1328 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
1329 BuildMI(BB, PPCOpcode, 2).addReg(PPC::CR0).addMBB(sinkMBB);
1330 F->getBasicBlockList().insert(It, copy0MBB);
1331 F->getBasicBlockList().insert(It, sinkMBB);
Misha Brukman425ff242004-07-01 21:34:10 +00001332 // Update machine-CFG edges
Nate Begemana96c4af2004-08-21 20:42:14 +00001333 BB->addSuccessor(copy0MBB);
Misha Brukman425ff242004-07-01 21:34:10 +00001334 BB->addSuccessor(sinkMBB);
1335
Misha Brukman1013ef52004-07-21 20:09:08 +00001336 // copy0MBB:
1337 // %FalseValue = li 0
1338 // fallthrough
1339 BB = copy0MBB;
1340 unsigned FalseValue = makeAnotherReg(I.getType());
Misha Brukman5b570812004-08-10 22:47:03 +00001341 BuildMI(BB, PPC::LI, 1, FalseValue).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00001342 // Update machine-CFG edges
1343 BB->addSuccessor(sinkMBB);
1344
Misha Brukman425ff242004-07-01 21:34:10 +00001345 // sinkMBB:
Nate Begemana96c4af2004-08-21 20:42:14 +00001346 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
Misha Brukman425ff242004-07-01 21:34:10 +00001347 // ...
1348 BB = sinkMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00001349 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(FalseValue)
Nate Begemana96c4af2004-08-21 20:42:14 +00001350 .addMBB(copy0MBB).addReg(TrueValue).addMBB(thisMBB);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001351}
1352
Misha Brukmana1dca552004-09-21 18:22:19 +00001353void PPC32ISel::visitSelectInst(SelectInst &SI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001354 unsigned DestReg = getReg(SI);
1355 MachineBasicBlock::iterator MII = BB->end();
Misha Brukman2fec9902004-06-21 20:22:03 +00001356 emitSelectOperation(BB, MII, SI.getCondition(), SI.getTrueValue(),
1357 SI.getFalseValue(), DestReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001358}
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001359
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001360/// emitSelect - Common code shared between visitSelectInst and the constant
1361/// expression support.
Misha Brukmana1dca552004-09-21 18:22:19 +00001362void PPC32ISel::emitSelectOperation(MachineBasicBlock *MBB,
1363 MachineBasicBlock::iterator IP,
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001364 Value *Cond, Value *TrueVal,
Misha Brukmana1dca552004-09-21 18:22:19 +00001365 Value *FalseVal, unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001366 unsigned SelectClass = getClassB(TrueVal->getType());
Misha Brukman7e898c32004-07-20 00:41:46 +00001367 unsigned Opcode;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001368
Misha Brukmanbebde752004-07-16 21:06:24 +00001369 // See if we can fold the setcc into the select instruction, or if we have
1370 // to get the register of the Cond value
Misha Brukmanbebde752004-07-16 21:06:24 +00001371 if (SetCondInst *SCI = canFoldSetCCIntoBranchOrSelect(Cond)) {
1372 // We successfully folded the setcc into the select instruction.
Misha Brukmanbebde752004-07-16 21:06:24 +00001373 unsigned OpNum = getSetCCNumber(SCI->getOpcode());
Nate Begeman087d5d92004-10-06 09:53:04 +00001374 if (OpNum >= 2 && OpNum <= 5) {
1375 unsigned SetCondClass = getClassB(SCI->getOperand(0)->getType());
1376 if ((SetCondClass == cFP32 || SetCondClass == cFP64) &&
1377 (SelectClass == cFP32 || SelectClass == cFP64)) {
1378 unsigned CondReg = getReg(SCI->getOperand(0), MBB, IP);
1379 unsigned TrueReg = getReg(TrueVal, MBB, IP);
1380 unsigned FalseReg = getReg(FalseVal, MBB, IP);
1381 // if the comparison of the floating point value used to for the select
1382 // is against 0, then we can emit an fsel without subtraction.
1383 ConstantFP *Op1C = dyn_cast<ConstantFP>(SCI->getOperand(1));
1384 if (Op1C && (Op1C->isExactlyValue(-0.0) || Op1C->isExactlyValue(0.0))) {
1385 switch(OpNum) {
1386 case 2: // LT
1387 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(CondReg)
1388 .addReg(FalseReg).addReg(TrueReg);
1389 break;
1390 case 3: // GE == !LT
1391 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(CondReg)
1392 .addReg(TrueReg).addReg(FalseReg);
1393 break;
1394 case 4: { // GT
1395 unsigned NegatedReg = makeAnotherReg(SCI->getOperand(0)->getType());
1396 BuildMI(*MBB, IP, PPC::FNEG, 1, NegatedReg).addReg(CondReg);
1397 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(NegatedReg)
1398 .addReg(FalseReg).addReg(TrueReg);
1399 }
1400 break;
1401 case 5: { // LE == !GT
1402 unsigned NegatedReg = makeAnotherReg(SCI->getOperand(0)->getType());
1403 BuildMI(*MBB, IP, PPC::FNEG, 1, NegatedReg).addReg(CondReg);
1404 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(NegatedReg)
1405 .addReg(TrueReg).addReg(FalseReg);
1406 }
1407 break;
1408 default:
1409 assert(0 && "Invalid SetCC opcode to fsel");
1410 abort();
1411 break;
1412 }
1413 } else {
1414 unsigned OtherCondReg = getReg(SCI->getOperand(1), MBB, IP);
1415 unsigned SelectReg = makeAnotherReg(SCI->getOperand(0)->getType());
1416 switch(OpNum) {
1417 case 2: // LT
1418 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(CondReg)
1419 .addReg(OtherCondReg);
1420 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1421 .addReg(FalseReg).addReg(TrueReg);
1422 break;
1423 case 3: // GE == !LT
1424 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(CondReg)
1425 .addReg(OtherCondReg);
1426 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1427 .addReg(TrueReg).addReg(FalseReg);
1428 break;
1429 case 4: // GT
1430 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(OtherCondReg)
1431 .addReg(CondReg);
1432 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1433 .addReg(FalseReg).addReg(TrueReg);
1434 break;
1435 case 5: // LE == !GT
1436 BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(OtherCondReg)
1437 .addReg(CondReg);
1438 BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg)
1439 .addReg(TrueReg).addReg(FalseReg);
1440 break;
1441 default:
1442 assert(0 && "Invalid SetCC opcode to fsel");
1443 abort();
1444 break;
1445 }
1446 }
Nate Begeman087d5d92004-10-06 09:53:04 +00001447 return;
1448 }
1449 }
Chris Lattner51d2ed92005-04-10 01:03:31 +00001450 EmitComparison(OpNum, SCI->getOperand(0),SCI->getOperand(1),MBB,IP);
1451 Opcode = getPPCOpcodeForSetCCOpcode(SCI->getOpcode());
Misha Brukmanbebde752004-07-16 21:06:24 +00001452 } else {
1453 unsigned CondReg = getReg(Cond, MBB, IP);
Nate Begemaned428532004-09-04 05:00:00 +00001454 BuildMI(*MBB, IP, PPC::CMPWI, 2, PPC::CR0).addReg(CondReg).addSImm(0);
Chris Lattner51d2ed92005-04-10 01:03:31 +00001455 Opcode = getPPCOpcodeForSetCCOpcode(Instruction::SetNE);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001456 }
Misha Brukmanbebde752004-07-16 21:06:24 +00001457
1458 MachineBasicBlock *thisMBB = BB;
1459 const BasicBlock *LLVM_BB = BB->getBasicBlock();
Misha Brukman7e898c32004-07-20 00:41:46 +00001460 ilist<MachineBasicBlock>::iterator It = BB;
1461 ++It;
Misha Brukmanbebde752004-07-16 21:06:24 +00001462
Nate Begemana96c4af2004-08-21 20:42:14 +00001463 // thisMBB:
1464 // ...
Chris Lattner6dec0b02005-01-01 16:10:12 +00001465 // TrueVal = ...
Nate Begemana96c4af2004-08-21 20:42:14 +00001466 // cmpTY cr0, r1, r2
Nate Begeman1f49e862004-09-29 05:00:31 +00001467 // bCC copy1MBB
1468 // fallthrough --> copy0MBB
Misha Brukmanbebde752004-07-16 21:06:24 +00001469 MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB);
Misha Brukman1013ef52004-07-21 20:09:08 +00001470 MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB);
Chris Lattner35e5c7c2005-01-02 23:07:31 +00001471 unsigned TrueValue = getReg(TrueVal);
Chris Lattner6dec0b02005-01-01 16:10:12 +00001472 BuildMI(BB, Opcode, 2).addReg(PPC::CR0).addMBB(sinkMBB);
Nate Begemana96c4af2004-08-21 20:42:14 +00001473 F->getBasicBlockList().insert(It, copy0MBB);
Misha Brukman1013ef52004-07-21 20:09:08 +00001474 F->getBasicBlockList().insert(It, sinkMBB);
Misha Brukmanbebde752004-07-16 21:06:24 +00001475 // Update machine-CFG edges
Misha Brukmanbebde752004-07-16 21:06:24 +00001476 BB->addSuccessor(copy0MBB);
Chris Lattner6dec0b02005-01-01 16:10:12 +00001477 BB->addSuccessor(sinkMBB);
Misha Brukmanbebde752004-07-16 21:06:24 +00001478
Misha Brukman1013ef52004-07-21 20:09:08 +00001479 // copy0MBB:
1480 // %FalseValue = ...
Chris Lattner6dec0b02005-01-01 16:10:12 +00001481 // # fallthrough to sinkMBB
Misha Brukman1013ef52004-07-21 20:09:08 +00001482 BB = copy0MBB;
Chris Lattner35e5c7c2005-01-02 23:07:31 +00001483 unsigned FalseValue = getReg(FalseVal);
Misha Brukman1013ef52004-07-21 20:09:08 +00001484 // Update machine-CFG edges
1485 BB->addSuccessor(sinkMBB);
1486
Misha Brukmanbebde752004-07-16 21:06:24 +00001487 // sinkMBB:
Nate Begemana96c4af2004-08-21 20:42:14 +00001488 // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ]
Misha Brukmanbebde752004-07-16 21:06:24 +00001489 // ...
1490 BB = sinkMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00001491 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(FalseValue)
Chris Lattner6dec0b02005-01-01 16:10:12 +00001492 .addMBB(copy0MBB).addReg(TrueValue).addMBB(thisMBB);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001493
Chris Lattner6dec0b02005-01-01 16:10:12 +00001494 // For a register pair representing a long value, define the top part.
Nate Begeman8d963e62004-08-11 03:30:55 +00001495 if (getClassB(TrueVal->getType()) == cLong)
Chris Lattner6dec0b02005-01-01 16:10:12 +00001496 BuildMI(BB, PPC::PHI, 4, DestReg+1).addReg(FalseValue+1)
1497 .addMBB(copy0MBB).addReg(TrueValue+1).addMBB(thisMBB);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001498}
1499
1500
1501
1502/// promote32 - Emit instructions to turn a narrow operand into a 32-bit-wide
1503/// operand, in the specified target register.
1504///
Misha Brukmana1dca552004-09-21 18:22:19 +00001505void PPC32ISel::promote32(unsigned targetReg, const ValueRecord &VR) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001506 bool isUnsigned = VR.Ty->isUnsigned() || VR.Ty == Type::BoolTy;
1507
1508 Value *Val = VR.Val;
1509 const Type *Ty = VR.Ty;
1510 if (Val) {
1511 if (Constant *C = dyn_cast<Constant>(Val)) {
1512 Val = ConstantExpr::getCast(C, Type::IntTy);
Chris Lattner74a806c2004-08-11 07:34:50 +00001513 if (isa<ConstantExpr>(Val)) // Could not fold
1514 Val = C;
1515 else
1516 Ty = Type::IntTy; // Folded!
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001517 }
1518
Misha Brukman2fec9902004-06-21 20:22:03 +00001519 // If this is a simple constant, just emit a load directly to avoid the copy
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001520 if (ConstantInt *CI = dyn_cast<ConstantInt>(Val)) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00001521 copyConstantToRegister(BB, BB->end(), CI, targetReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001522 return;
1523 }
1524 }
1525
1526 // Make sure we have the register number for this value...
1527 unsigned Reg = Val ? getReg(Val) : VR.Reg;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001528 switch (getClassB(Ty)) {
1529 case cByte:
1530 // Extend value into target register (8->32)
Nate Begeman1b99fd32004-09-29 03:45:33 +00001531 if (Ty == Type::BoolTy)
1532 BuildMI(BB, PPC::OR, 2, targetReg).addReg(Reg).addReg(Reg);
1533 else if (isUnsigned)
Misha Brukman5b570812004-08-10 22:47:03 +00001534 BuildMI(BB, PPC::RLWINM, 4, targetReg).addReg(Reg).addZImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00001535 .addZImm(24).addZImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001536 else
Misha Brukman5b570812004-08-10 22:47:03 +00001537 BuildMI(BB, PPC::EXTSB, 1, targetReg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001538 break;
1539 case cShort:
1540 // Extend value into target register (16->32)
1541 if (isUnsigned)
Misha Brukman5b570812004-08-10 22:47:03 +00001542 BuildMI(BB, PPC::RLWINM, 4, targetReg).addReg(Reg).addZImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00001543 .addZImm(16).addZImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001544 else
Misha Brukman5b570812004-08-10 22:47:03 +00001545 BuildMI(BB, PPC::EXTSH, 1, targetReg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001546 break;
1547 case cInt:
1548 // Move value into target register (32->32)
Misha Brukman5b570812004-08-10 22:47:03 +00001549 BuildMI(BB, PPC::OR, 2, targetReg).addReg(Reg).addReg(Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001550 break;
1551 default:
1552 assert(0 && "Unpromotable operand class in promote32");
1553 }
1554}
1555
Misha Brukman2fec9902004-06-21 20:22:03 +00001556/// visitReturnInst - implemented with BLR
1557///
Misha Brukmana1dca552004-09-21 18:22:19 +00001558void PPC32ISel::visitReturnInst(ReturnInst &I) {
Misha Brukmand47bbf72004-06-25 19:04:27 +00001559 // Only do the processing if this is a non-void return
1560 if (I.getNumOperands() > 0) {
1561 Value *RetVal = I.getOperand(0);
1562 switch (getClassB(RetVal->getType())) {
1563 case cByte: // integral return values: extend or move into r3 and return
1564 case cShort:
1565 case cInt:
Misha Brukman5b570812004-08-10 22:47:03 +00001566 promote32(PPC::R3, ValueRecord(RetVal));
Misha Brukmand47bbf72004-06-25 19:04:27 +00001567 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001568 case cFP32:
1569 case cFP64: { // Floats & Doubles: Return in f1
Misha Brukmand47bbf72004-06-25 19:04:27 +00001570 unsigned RetReg = getReg(RetVal);
Misha Brukman5b570812004-08-10 22:47:03 +00001571 BuildMI(BB, PPC::FMR, 1, PPC::F1).addReg(RetReg);
Misha Brukmand47bbf72004-06-25 19:04:27 +00001572 break;
1573 }
1574 case cLong: {
1575 unsigned RetReg = getReg(RetVal);
Misha Brukman5b570812004-08-10 22:47:03 +00001576 BuildMI(BB, PPC::OR, 2, PPC::R3).addReg(RetReg).addReg(RetReg);
1577 BuildMI(BB, PPC::OR, 2, PPC::R4).addReg(RetReg+1).addReg(RetReg+1);
Misha Brukmand47bbf72004-06-25 19:04:27 +00001578 break;
1579 }
1580 default:
1581 visitInstruction(I);
1582 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001583 }
Misha Brukman5b570812004-08-10 22:47:03 +00001584 BuildMI(BB, PPC::BLR, 1).addImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001585}
1586
1587// getBlockAfter - Return the basic block which occurs lexically after the
1588// specified one.
1589static inline BasicBlock *getBlockAfter(BasicBlock *BB) {
1590 Function::iterator I = BB; ++I; // Get iterator to next block
1591 return I != BB->getParent()->end() ? &*I : 0;
1592}
1593
1594/// visitBranchInst - Handle conditional and unconditional branches here. Note
1595/// that since code layout is frozen at this point, that if we are trying to
1596/// jump to a block that is the immediate successor of the current block, we can
1597/// just make a fall-through (but we don't currently).
1598///
Misha Brukmana1dca552004-09-21 18:22:19 +00001599void PPC32ISel::visitBranchInst(BranchInst &BI) {
Misha Brukman2fec9902004-06-21 20:22:03 +00001600 // Update machine-CFG edges
Misha Brukmane2eceb52004-07-23 16:08:20 +00001601 BB->addSuccessor(MBBMap[BI.getSuccessor(0)]);
Misha Brukman2fec9902004-06-21 20:22:03 +00001602 if (BI.isConditional())
Misha Brukmane2eceb52004-07-23 16:08:20 +00001603 BB->addSuccessor(MBBMap[BI.getSuccessor(1)]);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001604
Misha Brukman2fec9902004-06-21 20:22:03 +00001605 BasicBlock *NextBB = getBlockAfter(BI.getParent()); // BB after current one
Misha Brukmane9c65512004-07-06 15:32:44 +00001606
Misha Brukman2fec9902004-06-21 20:22:03 +00001607 if (!BI.isConditional()) { // Unconditional branch?
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001608 if (BI.getSuccessor(0) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001609 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001610 return;
Misha Brukman2fec9902004-06-21 20:22:03 +00001611 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001612
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001613 // See if we can fold the setcc into the branch itself...
1614 SetCondInst *SCI = canFoldSetCCIntoBranchOrSelect(BI.getCondition());
1615 if (SCI == 0) {
1616 // Nope, cannot fold setcc into this branch. Emit a branch on a condition
1617 // computed some other way...
1618 unsigned condReg = getReg(BI.getCondition());
Misha Brukman5b570812004-08-10 22:47:03 +00001619 BuildMI(BB, PPC::CMPLI, 3, PPC::CR0).addImm(0).addReg(condReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00001620 .addImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001621 if (BI.getSuccessor(1) == NextBB) {
1622 if (BI.getSuccessor(0) != NextBB)
Nate Begeman439b4442005-04-05 04:22:58 +00001623 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(PPC::CR0).addImm(PPC::BNE)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001624 .addMBB(MBBMap[BI.getSuccessor(0)])
1625 .addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001626 } else {
Nate Begeman439b4442005-04-05 04:22:58 +00001627 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(PPC::CR0).addImm(PPC::BEQ)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001628 .addMBB(MBBMap[BI.getSuccessor(1)])
1629 .addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001630 if (BI.getSuccessor(0) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001631 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001632 }
1633 return;
1634 }
1635
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001636 unsigned OpNum = getSetCCNumber(SCI->getOpcode());
Chris Lattner51d2ed92005-04-10 01:03:31 +00001637 unsigned Opcode = getPPCOpcodeForSetCCOpcode(SCI->getOpcode());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001638 MachineBasicBlock::iterator MII = BB->end();
Chris Lattner51d2ed92005-04-10 01:03:31 +00001639 EmitComparison(OpNum, SCI->getOperand(0), SCI->getOperand(1), BB,MII);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001640
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001641 if (BI.getSuccessor(0) != NextBB) {
Nate Begeman439b4442005-04-05 04:22:58 +00001642 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(PPC::CR0).addImm(Opcode)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001643 .addMBB(MBBMap[BI.getSuccessor(0)])
1644 .addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001645 if (BI.getSuccessor(1) != NextBB)
Misha Brukman5b570812004-08-10 22:47:03 +00001646 BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(1)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001647 } else {
1648 // Change to the inverse condition...
1649 if (BI.getSuccessor(1) != NextBB) {
Misha Brukmanf2ccb772004-08-17 04:55:41 +00001650 Opcode = PPC32InstrInfo::invertPPCBranchOpcode(Opcode);
Nate Begeman439b4442005-04-05 04:22:58 +00001651 BuildMI(BB, PPC::COND_BRANCH, 4).addReg(PPC::CR0).addImm(Opcode)
Misha Brukmanfa20a6d2004-07-27 18:35:23 +00001652 .addMBB(MBBMap[BI.getSuccessor(1)])
1653 .addMBB(MBBMap[BI.getSuccessor(0)]);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001654 }
1655 }
1656}
1657
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001658/// doCall - This emits an abstract call instruction, setting up the arguments
1659/// and the return value as appropriate. For the actual function call itself,
1660/// it inserts the specified CallMI instruction into the stream.
1661///
1662/// FIXME: See Documentation at the following URL for "correct" behavior
Nate Begemanc13a7f02005-03-26 01:28:05 +00001663/// <http://developer.apple.com/documentation/DeveloperTools/Conceptual/MachORuntime/PowerPCConventions/chapter_3_section_5.html>
Misha Brukmana1dca552004-09-21 18:22:19 +00001664void PPC32ISel::doCall(const ValueRecord &Ret, MachineInstr *CallMI,
1665 const std::vector<ValueRecord> &Args, bool isVarArg) {
Chris Lattner3ea93462004-08-06 06:58:50 +00001666 // Count how many bytes are to be pushed on the stack, including the linkage
1667 // area, and parameter passing area.
1668 unsigned NumBytes = 24;
1669 unsigned ArgOffset = 24;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001670
1671 if (!Args.empty()) {
1672 for (unsigned i = 0, e = Args.size(); i != e; ++i)
1673 switch (getClassB(Args[i].Ty)) {
1674 case cByte: case cShort: case cInt:
1675 NumBytes += 4; break;
1676 case cLong:
1677 NumBytes += 8; break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001678 case cFP32:
1679 NumBytes += 4; break;
1680 case cFP64:
1681 NumBytes += 8; break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001682 break;
1683 default: assert(0 && "Unknown class!");
1684 }
1685
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001686 // Just to be safe, we'll always reserve the full 24 bytes of linkage area
Nate Begeman865075e2004-08-16 01:50:22 +00001687 // plus 32 bytes of argument space in case any called code gets funky on us.
1688 if (NumBytes < 56) NumBytes = 56;
Chris Lattner3ea93462004-08-06 06:58:50 +00001689
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001690 // Adjust the stack pointer for the new arguments...
Nate Begemanc13a7f02005-03-26 01:28:05 +00001691 // These operations are automatically eliminated by the prolog/epilog pass
Misha Brukman5b570812004-08-10 22:47:03 +00001692 BuildMI(BB, PPC::ADJCALLSTACKDOWN, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001693
1694 // Arguments go on the stack in reverse order, as specified by the ABI.
Misha Brukman7e898c32004-07-20 00:41:46 +00001695 // Offset to the paramater area on the stack is 24.
Misha Brukmand18a31d2004-07-06 22:51:53 +00001696 int GPR_remaining = 8, FPR_remaining = 13;
Misha Brukmanfc879c32004-07-08 18:02:38 +00001697 unsigned GPR_idx = 0, FPR_idx = 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001698 static const unsigned GPR[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00001699 PPC::R3, PPC::R4, PPC::R5, PPC::R6,
1700 PPC::R7, PPC::R8, PPC::R9, PPC::R10,
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001701 };
Misha Brukmand18a31d2004-07-06 22:51:53 +00001702 static const unsigned FPR[] = {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001703 PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6,
1704 PPC::F7, PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12,
Misha Brukman5b570812004-08-10 22:47:03 +00001705 PPC::F13
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001706 };
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001707
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001708 for (unsigned i = 0, e = Args.size(); i != e; ++i) {
1709 unsigned ArgReg;
1710 switch (getClassB(Args[i].Ty)) {
1711 case cByte:
1712 case cShort:
1713 // Promote arg to 32 bits wide into a temporary register...
1714 ArgReg = makeAnotherReg(Type::UIntTy);
1715 promote32(ArgReg, Args[i]);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001716
Misha Brukman422791f2004-06-21 17:41:12 +00001717 // Reg or stack?
1718 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001719 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001720 .addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001721 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001722 }
1723 if (GPR_remaining <= 0 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001724 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1725 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001726 }
1727 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001728 case cInt:
1729 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
1730
Misha Brukman422791f2004-06-21 17:41:12 +00001731 // Reg or stack?
1732 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001733 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanfadb82f2004-06-24 22:00:15 +00001734 .addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001735 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001736 }
1737 if (GPR_remaining <= 0 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001738 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1739 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001740 }
1741 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001742 case cLong:
Misha Brukman422791f2004-06-21 17:41:12 +00001743 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001744
Misha Brukmanec6319a2004-07-20 15:51:37 +00001745 // Reg or stack? Note that PPC calling conventions state that long args
1746 // are passed rN = hi, rN+1 = lo, opposite of LLVM.
Misha Brukman422791f2004-06-21 17:41:12 +00001747 if (GPR_remaining > 1) {
Misha Brukman5b570812004-08-10 22:47:03 +00001748 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg)
Misha Brukmanec6319a2004-07-20 15:51:37 +00001749 .addReg(ArgReg);
Misha Brukman5b570812004-08-10 22:47:03 +00001750 BuildMI(BB, PPC::OR, 2, GPR[GPR_idx+1]).addReg(ArgReg+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00001751 .addReg(ArgReg+1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001752 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1753 CallMI->addRegOperand(GPR[GPR_idx+1], MachineOperand::Use);
Misha Brukmanb097f212004-07-26 18:13:24 +00001754 }
1755 if (GPR_remaining <= 1 || isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001756 BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset)
1757 .addReg(PPC::R1);
1758 BuildMI(BB, PPC::STW, 3).addReg(ArgReg+1).addSImm(ArgOffset+4)
1759 .addReg(PPC::R1);
Misha Brukman422791f2004-06-21 17:41:12 +00001760 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001761
1762 ArgOffset += 4; // 8 byte entry, not 4.
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001763 GPR_remaining -= 1; // uses up 2 GPRs
1764 GPR_idx += 1;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001765 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001766 case cFP32:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001767 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
Misha Brukman7e898c32004-07-20 00:41:46 +00001768 // Reg or stack?
1769 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001770 BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001771 CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use);
1772 FPR_remaining--;
1773 FPR_idx++;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001774
Misha Brukman7e898c32004-07-20 00:41:46 +00001775 // If this is a vararg function, and there are GPRs left, also
1776 // pass the float in an int. Otherwise, put it on the stack.
1777 if (isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001778 BuildMI(BB, PPC::STFS, 3).addReg(ArgReg).addSImm(ArgOffset)
1779 .addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001780 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001781 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx])
Nate Begeman293d88c2004-08-13 04:45:14 +00001782 .addSImm(ArgOffset).addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001783 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1784 }
Misha Brukman1916bf92004-06-24 21:56:15 +00001785 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001786 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00001787 BuildMI(BB, PPC::STFS, 3).addReg(ArgReg).addSImm(ArgOffset)
1788 .addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001789 }
1790 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00001791 case cFP64:
1792 ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg;
1793 // Reg or stack?
1794 if (FPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001795 BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00001796 CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use);
1797 FPR_remaining--;
1798 FPR_idx++;
1799 // For vararg functions, must pass doubles via int regs as well
1800 if (isVarArg) {
Misha Brukman5b570812004-08-10 22:47:03 +00001801 BuildMI(BB, PPC::STFD, 3).addReg(ArgReg).addSImm(ArgOffset)
1802 .addReg(PPC::R1);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001803
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001804 // Doubles can be split across reg + stack for varargs
1805 if (GPR_remaining > 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00001806 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx]).addSImm(ArgOffset)
1807 .addReg(PPC::R1);
Misha Brukman2ed17ca2004-07-22 15:58:04 +00001808 CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use);
1809 }
1810 if (GPR_remaining > 1) {
Misha Brukman5b570812004-08-10 22:47:03 +00001811 BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx+1])
1812 .addSImm(ArgOffset+4).addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001813 CallMI->addRegOperand(GPR[GPR_idx+1], MachineOperand::Use);
1814 }
1815 }
1816 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00001817 BuildMI(BB, PPC::STFD, 3).addReg(ArgReg).addSImm(ArgOffset)
1818 .addReg(PPC::R1);
Misha Brukman7e898c32004-07-20 00:41:46 +00001819 }
1820 // Doubles use 8 bytes, and 2 GPRs worth of param space
1821 ArgOffset += 4;
1822 GPR_remaining--;
1823 GPR_idx++;
1824 break;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001825
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001826 default: assert(0 && "Unknown class!");
1827 }
1828 ArgOffset += 4;
Misha Brukman14d8c7a2004-06-29 23:45:05 +00001829 GPR_remaining--;
1830 GPR_idx++;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001831 }
1832 } else {
Nate Begeman865075e2004-08-16 01:50:22 +00001833 BuildMI(BB, PPC::ADJCALLSTACKDOWN, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001834 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001835
Misha Brukman5b570812004-08-10 22:47:03 +00001836 BuildMI(BB, PPC::IMPLICIT_DEF, 0, PPC::LR);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001837 BB->push_back(CallMI);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001838
Chris Lattner3ea93462004-08-06 06:58:50 +00001839 // These functions are automatically eliminated by the prolog/epilog pass
Misha Brukman5b570812004-08-10 22:47:03 +00001840 BuildMI(BB, PPC::ADJCALLSTACKUP, 1).addImm(NumBytes);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001841
1842 // If there is a return value, scavenge the result from the location the call
1843 // leaves it in...
1844 //
1845 if (Ret.Ty != Type::VoidTy) {
1846 unsigned DestClass = getClassB(Ret.Ty);
1847 switch (DestClass) {
1848 case cByte:
1849 case cShort:
1850 case cInt:
1851 // Integral results are in r3
Misha Brukman5b570812004-08-10 22:47:03 +00001852 BuildMI(BB, PPC::OR, 2, Ret.Reg).addReg(PPC::R3).addReg(PPC::R3);
Misha Brukmane327e492004-06-24 23:53:24 +00001853 break;
Chris Lattner3ea93462004-08-06 06:58:50 +00001854 case cFP32: // Floating-point return values live in f1
Misha Brukman7e898c32004-07-20 00:41:46 +00001855 case cFP64:
Misha Brukman5b570812004-08-10 22:47:03 +00001856 BuildMI(BB, PPC::FMR, 1, Ret.Reg).addReg(PPC::F1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001857 break;
Chris Lattner3ea93462004-08-06 06:58:50 +00001858 case cLong: // Long values are in r3:r4
Misha Brukman5b570812004-08-10 22:47:03 +00001859 BuildMI(BB, PPC::OR, 2, Ret.Reg).addReg(PPC::R3).addReg(PPC::R3);
1860 BuildMI(BB, PPC::OR, 2, Ret.Reg+1).addReg(PPC::R4).addReg(PPC::R4);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001861 break;
1862 default: assert(0 && "Unknown class!");
1863 }
1864 }
1865}
1866
1867
1868/// visitCallInst - Push args on stack and do a procedure call instruction.
Misha Brukmana1dca552004-09-21 18:22:19 +00001869void PPC32ISel::visitCallInst(CallInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001870 MachineInstr *TheCall;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001871 Function *F = CI.getCalledFunction();
1872 if (F) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001873 // Is it an intrinsic function call?
1874 if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID()) {
1875 visitIntrinsicCall(ID, CI); // Special intrinsics are not handled here
1876 return;
1877 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001878 // Emit a CALL instruction with PC-relative displacement.
Misha Brukman5b570812004-08-10 22:47:03 +00001879 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(F, true);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001880 } else { // Emit an indirect call through the CTR
1881 unsigned Reg = getReg(CI.getCalledValue());
Nate Begeman43d64ea2004-08-15 06:42:28 +00001882 BuildMI(BB, PPC::OR, 2, PPC::R12).addReg(Reg).addReg(Reg);
1883 BuildMI(BB, PPC::MTCTR, 1).addReg(PPC::R12);
Nate Begeman7ca541b2005-03-24 23:34:38 +00001884 TheCall = BuildMI(PPC::CALLindirect, 3).addZImm(20).addZImm(0)
Nate Begeman43d64ea2004-08-15 06:42:28 +00001885 .addReg(PPC::R12);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001886 }
1887
1888 std::vector<ValueRecord> Args;
1889 for (unsigned i = 1, e = CI.getNumOperands(); i != e; ++i)
1890 Args.push_back(ValueRecord(CI.getOperand(i)));
1891
1892 unsigned DestReg = CI.getType() != Type::VoidTy ? getReg(CI) : 0;
Misha Brukmand18a31d2004-07-06 22:51:53 +00001893 bool isVarArg = F ? F->getFunctionType()->isVarArg() : true;
1894 doCall(ValueRecord(DestReg, CI.getType()), TheCall, Args, isVarArg);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00001895}
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001896
1897
1898/// dyncastIsNan - Return the operand of an isnan operation if this is an isnan.
1899///
1900static Value *dyncastIsNan(Value *V) {
1901 if (CallInst *CI = dyn_cast<CallInst>(V))
1902 if (Function *F = CI->getCalledFunction())
Misha Brukmana2916ce2004-06-21 17:58:36 +00001903 if (F->getIntrinsicID() == Intrinsic::isunordered)
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001904 return CI->getOperand(1);
1905 return 0;
1906}
1907
1908/// isOnlyUsedByUnorderedComparisons - Return true if this value is only used by
1909/// or's whos operands are all calls to the isnan predicate.
1910static bool isOnlyUsedByUnorderedComparisons(Value *V) {
1911 assert(dyncastIsNan(V) && "The value isn't an isnan call!");
1912
1913 // Check all uses, which will be or's of isnans if this predicate is true.
1914 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;++UI){
1915 Instruction *I = cast<Instruction>(*UI);
1916 if (I->getOpcode() != Instruction::Or) return false;
1917 if (I->getOperand(0) != V && !dyncastIsNan(I->getOperand(0))) return false;
1918 if (I->getOperand(1) != V && !dyncastIsNan(I->getOperand(1))) return false;
1919 }
1920
1921 return true;
1922}
1923
1924/// LowerUnknownIntrinsicFunctionCalls - This performs a prepass over the
1925/// function, lowering any calls to unknown intrinsic functions into the
1926/// equivalent LLVM code.
1927///
Misha Brukmana1dca552004-09-21 18:22:19 +00001928void PPC32ISel::LowerUnknownIntrinsicFunctionCalls(Function &F) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001929 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
1930 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; )
1931 if (CallInst *CI = dyn_cast<CallInst>(I++))
1932 if (Function *F = CI->getCalledFunction())
1933 switch (F->getIntrinsicID()) {
1934 case Intrinsic::not_intrinsic:
1935 case Intrinsic::vastart:
1936 case Intrinsic::vacopy:
1937 case Intrinsic::vaend:
1938 case Intrinsic::returnaddress:
1939 case Intrinsic::frameaddress:
Misha Brukmanb097f212004-07-26 18:13:24 +00001940 // FIXME: should lower these ourselves
Misha Brukmana2916ce2004-06-21 17:58:36 +00001941 // case Intrinsic::isunordered:
Misha Brukmanb097f212004-07-26 18:13:24 +00001942 // case Intrinsic::memcpy: -> doCall(). system memcpy almost
1943 // guaranteed to be faster than anything we generate ourselves
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001944 // We directly implement these intrinsics
1945 break;
1946 case Intrinsic::readio: {
1947 // On PPC, memory operations are in-order. Lower this intrinsic
1948 // into a volatile load.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001949 LoadInst * LI = new LoadInst(CI->getOperand(1), "", true, CI);
1950 CI->replaceAllUsesWith(LI);
1951 BB->getInstList().erase(CI);
1952 break;
1953 }
1954 case Intrinsic::writeio: {
1955 // On PPC, memory operations are in-order. Lower this intrinsic
1956 // into a volatile store.
Misha Brukman8d442c22004-07-14 15:29:51 +00001957 StoreInst *SI = new StoreInst(CI->getOperand(1),
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001958 CI->getOperand(2), true, CI);
Misha Brukman8d442c22004-07-14 15:29:51 +00001959 CI->replaceAllUsesWith(SI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001960 BB->getInstList().erase(CI);
1961 break;
1962 }
Nate Begeman2daec452005-03-24 20:07:16 +00001963 default: {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001964 // All other intrinsic calls we must lower.
Nate Begeman2daec452005-03-24 20:07:16 +00001965 BasicBlock::iterator me(CI);
1966 bool atBegin(BB->begin() == me);
1967 if (!atBegin)
1968 --me;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001969 TM.getIntrinsicLowering().LowerIntrinsicCall(CI);
Nate Begeman2daec452005-03-24 20:07:16 +00001970 // Move iterator to instruction after call
1971 I = atBegin ? BB->begin() : ++me;
1972 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001973 }
1974}
1975
Misha Brukmana1dca552004-09-21 18:22:19 +00001976void PPC32ISel::visitIntrinsicCall(Intrinsic::ID ID, CallInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001977 unsigned TmpReg1, TmpReg2, TmpReg3;
1978 switch (ID) {
1979 case Intrinsic::vastart:
Andrew Lenharth558bc882005-06-18 18:34:52 +00001980 //FIXME: need to store, not return a value
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001981 // 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:
Andrew Lenharth558bc882005-06-18 18:34:52 +00001988 //FIXME: need to store into first arg the value of the second
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001989 TmpReg1 = getReg(CI);
1990 TmpReg2 = getReg(CI.getOperand(1));
Misha Brukman5b570812004-08-10 22:47:03 +00001991 BuildMI(BB, PPC::OR, 2, TmpReg1).addReg(TmpReg2).addReg(TmpReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00001992 return;
1993 case Intrinsic::vaend: return;
1994
1995 case Intrinsic::returnaddress:
Misha Brukmanec6319a2004-07-20 15:51:37 +00001996 TmpReg1 = getReg(CI);
1997 if (cast<Constant>(CI.getOperand(1))->isNullValue()) {
1998 MachineFrameInfo *MFI = F->getFrameInfo();
1999 unsigned NumBytes = MFI->getStackSize();
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002000
Misha Brukman5b570812004-08-10 22:47:03 +00002001 BuildMI(BB, PPC::LWZ, 2, TmpReg1).addSImm(NumBytes+8)
2002 .addReg(PPC::R1);
Misha Brukmanec6319a2004-07-20 15:51:37 +00002003 } else {
2004 // Values other than zero are not implemented yet.
Misha Brukman5b570812004-08-10 22:47:03 +00002005 BuildMI(BB, PPC::LI, 1, TmpReg1).addSImm(0);
Misha Brukmanec6319a2004-07-20 15:51:37 +00002006 }
2007 return;
2008
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002009 case Intrinsic::frameaddress:
2010 TmpReg1 = getReg(CI);
2011 if (cast<Constant>(CI.getOperand(1))->isNullValue()) {
Misha Brukman5b570812004-08-10 22:47:03 +00002012 BuildMI(BB, PPC::OR, 2, TmpReg1).addReg(PPC::R1).addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002013 } else {
2014 // Values other than zero are not implemented yet.
Misha Brukman5b570812004-08-10 22:47:03 +00002015 BuildMI(BB, PPC::LI, 1, TmpReg1).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002016 }
2017 return;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002018
Misha Brukmana2916ce2004-06-21 17:58:36 +00002019#if 0
2020 // This may be useful for supporting isunordered
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002021 case Intrinsic::isnan:
2022 // If this is only used by 'isunordered' style comparisons, don't emit it.
2023 if (isOnlyUsedByUnorderedComparisons(&CI)) return;
2024 TmpReg1 = getReg(CI.getOperand(1));
2025 emitUCOM(BB, BB->end(), TmpReg1, TmpReg1);
Misha Brukman422791f2004-06-21 17:41:12 +00002026 TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00002027 BuildMI(BB, PPC::MFCR, TmpReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002028 TmpReg3 = getReg(CI);
Misha Brukman5b570812004-08-10 22:47:03 +00002029 BuildMI(BB, PPC::RLWINM, 4, TmpReg3).addReg(TmpReg2).addImm(4).addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002030 return;
Misha Brukmana2916ce2004-06-21 17:58:36 +00002031#endif
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002032
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002033 default: assert(0 && "Error: unknown intrinsics should have been lowered!");
2034 }
2035}
2036
2037/// visitSimpleBinary - Implement simple binary operators for integral types...
2038/// OperatorClass is one of: 0 for Add, 1 for Sub, 2 for And, 3 for Or, 4 for
2039/// Xor.
2040///
Misha Brukmana1dca552004-09-21 18:22:19 +00002041void PPC32ISel::visitSimpleBinary(BinaryOperator &B, unsigned OperatorClass) {
Nate Begeman1b750222004-10-17 05:19:20 +00002042 if (std::find(SkipList.begin(), SkipList.end(), &B) != SkipList.end())
2043 return;
Nate Begeman905a2912004-10-24 10:33:30 +00002044
2045 unsigned DestReg = getReg(B);
2046 MachineBasicBlock::iterator MI = BB->end();
2047 RlwimiRec RR = InsertMap[&B];
2048 if (RR.Target != 0) {
2049 unsigned TargetReg = getReg(RR.Target, BB, MI);
2050 unsigned InsertReg = getReg(RR.Insert, BB, MI);
2051 BuildMI(*BB, MI, PPC::RLWIMI, 5, DestReg).addReg(TargetReg)
2052 .addReg(InsertReg).addImm(RR.Shift).addImm(RR.MB).addImm(RR.ME);
2053 return;
Nate Begeman1b750222004-10-17 05:19:20 +00002054 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002055
Nate Begeman905a2912004-10-24 10:33:30 +00002056 unsigned Class = getClassB(B.getType());
2057 Value *Op0 = B.getOperand(0), *Op1 = B.getOperand(1);
2058 emitSimpleBinaryOperation(BB, MI, &B, Op0, Op1, OperatorClass, DestReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002059}
2060
2061/// emitBinaryFPOperation - This method handles emission of floating point
2062/// Add (0), Sub (1), Mul (2), and Div (3) operations.
Misha Brukmana1dca552004-09-21 18:22:19 +00002063void PPC32ISel::emitBinaryFPOperation(MachineBasicBlock *BB,
2064 MachineBasicBlock::iterator IP,
2065 Value *Op0, Value *Op1,
2066 unsigned OperatorClass, unsigned DestReg){
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002067
Nate Begeman6d1e2df2004-08-14 22:11:38 +00002068 static const unsigned OpcodeTab[][4] = {
2069 { PPC::FADDS, PPC::FSUBS, PPC::FMULS, PPC::FDIVS }, // Float
2070 { PPC::FADD, PPC::FSUB, PPC::FMUL, PPC::FDIV }, // Double
2071 };
2072
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002073 // Special case: R1 = op <const fp>, R2
Misha Brukmana596f8c2004-07-13 15:35:45 +00002074 if (ConstantFP *Op0C = dyn_cast<ConstantFP>(Op0))
2075 if (Op0C->isExactlyValue(-0.0) && OperatorClass == 1) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002076 // -0.0 - X === -X
2077 unsigned op1Reg = getReg(Op1, BB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00002078 BuildMI(*BB, IP, PPC::FNEG, 1, DestReg).addReg(op1Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002079 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002080 }
2081
Nate Begeman81d265d2004-08-19 05:20:54 +00002082 unsigned Opcode = OpcodeTab[Op0->getType() == Type::DoubleTy][OperatorClass];
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002083 unsigned Op0r = getReg(Op0, BB, IP);
2084 unsigned Op1r = getReg(Op1, BB, IP);
2085 BuildMI(*BB, IP, Opcode, 2, DestReg).addReg(Op0r).addReg(Op1r);
2086}
2087
Nate Begemanb816f022004-10-07 22:30:03 +00002088// ExactLog2 - This function solves for (Val == 1 << (N-1)) and returns N. It
2089// returns zero when the input is not exactly a power of two.
2090static unsigned ExactLog2(unsigned Val) {
2091 if (Val == 0 || (Val & (Val-1))) return 0;
2092 unsigned Count = 0;
2093 while (Val != 1) {
2094 Val >>= 1;
2095 ++Count;
2096 }
2097 return Count;
2098}
2099
Nate Begemanbdf69842004-10-08 02:49:24 +00002100// isRunOfOnes - returns true if Val consists of one contiguous run of 1's with
2101// any number of 0's on either side. the 1's are allowed to wrap from LSB to
2102// MSB. so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
2103// not, since all 1's are not contiguous.
2104static bool isRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME) {
2105 bool isRun = true;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002106 MB = 0;
Nate Begemanbdf69842004-10-08 02:49:24 +00002107 ME = 0;
2108
2109 // look for first set bit
2110 int i = 0;
2111 for (; i < 32; i++) {
2112 if ((Val & (1 << (31 - i))) != 0) {
2113 MB = i;
2114 ME = i;
2115 break;
2116 }
2117 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002118
Nate Begemanbdf69842004-10-08 02:49:24 +00002119 // look for last set bit
2120 for (; i < 32; i++) {
2121 if ((Val & (1 << (31 - i))) == 0)
2122 break;
2123 ME = i;
2124 }
2125
2126 // look for next set bit
2127 for (; i < 32; i++) {
2128 if ((Val & (1 << (31 - i))) != 0)
2129 break;
2130 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002131
Nate Begemanbdf69842004-10-08 02:49:24 +00002132 // if we exhausted all the bits, we found a match at this point for 0*1*0*
2133 if (i == 32)
2134 return true;
2135
2136 // since we just encountered more 1's, if it doesn't wrap around to the
2137 // most significant bit of the word, then we did not find a match to 1*0*1* so
2138 // exit.
2139 if (MB != 0)
2140 return false;
2141
2142 // look for last set bit
2143 for (MB = i; i < 32; i++) {
2144 if ((Val & (1 << (31 - i))) == 0)
2145 break;
2146 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002147
Nate Begemanbdf69842004-10-08 02:49:24 +00002148 // if we exhausted all the bits, then we found a match for 1*0*1*, otherwise,
2149 // the value is not a run of ones.
2150 if (i == 32)
2151 return true;
2152 return false;
2153}
2154
Nate Begeman905a2912004-10-24 10:33:30 +00002155/// isInsertAndHalf - Helper function for emitBitfieldInsert. Returns true if
2156/// OpUser has one use, is used by an or instruction, and is itself an and whose
2157/// second operand is a constant int. Optionally, set OrI to the Or instruction
2158/// that is the sole user of OpUser, and Op1User to the other operand of the Or
2159/// instruction.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002160static bool isInsertAndHalf(User *OpUser, Instruction **Op1User,
Nate Begeman905a2912004-10-24 10:33:30 +00002161 Instruction **OrI, unsigned &Mask) {
2162 // If this instruction doesn't have one use, then return false.
2163 if (!OpUser->hasOneUse())
2164 return false;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002165
Nate Begeman905a2912004-10-24 10:33:30 +00002166 Mask = 0xFFFFFFFF;
2167 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(OpUser))
2168 if (BO->getOpcode() == Instruction::And) {
2169 Value *AndUse = *(OpUser->use_begin());
2170 if (BinaryOperator *Or = dyn_cast<BinaryOperator>(AndUse)) {
2171 if (Or->getOpcode() == Instruction::Or) {
2172 if (ConstantInt *CI = dyn_cast<ConstantInt>(OpUser->getOperand(1))) {
2173 if (OrI) *OrI = Or;
2174 if (Op1User) {
2175 if (Or->getOperand(0) == OpUser)
2176 *Op1User = dyn_cast<Instruction>(Or->getOperand(1));
2177 else
2178 *Op1User = dyn_cast<Instruction>(Or->getOperand(0));
Nate Begeman1b750222004-10-17 05:19:20 +00002179 }
Nate Begeman905a2912004-10-24 10:33:30 +00002180 Mask &= CI->getRawValue();
2181 return true;
Nate Begeman1b750222004-10-17 05:19:20 +00002182 }
2183 }
2184 }
2185 }
Nate Begeman905a2912004-10-24 10:33:30 +00002186 return false;
2187}
2188
2189/// isInsertShiftHalf - Helper function for emitBitfieldInsert. Returns true if
2190/// OpUser has one use, is used by an or instruction, and is itself a shift
2191/// instruction that is either used directly by the or instruction, or is used
2192/// by an and instruction whose second operand is a constant int, and which is
2193/// used by the or instruction.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002194static bool isInsertShiftHalf(User *OpUser, Instruction **Op1User,
2195 Instruction **OrI, Instruction **OptAndI,
Nate Begeman905a2912004-10-24 10:33:30 +00002196 unsigned &Shift, unsigned &Mask) {
2197 // If this instruction doesn't have one use, then return false.
2198 if (!OpUser->hasOneUse())
2199 return false;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002200
Nate Begeman905a2912004-10-24 10:33:30 +00002201 Mask = 0xFFFFFFFF;
2202 if (ShiftInst *SI = dyn_cast<ShiftInst>(OpUser)) {
2203 if (ConstantInt *CI = dyn_cast<ConstantInt>(SI->getOperand(1))) {
2204 Shift = CI->getRawValue();
2205 if (SI->getOpcode() == Instruction::Shl)
2206 Mask <<= Shift;
2207 else if (!SI->getOperand(0)->getType()->isSigned()) {
2208 Mask >>= Shift;
2209 Shift = 32 - Shift;
2210 }
2211
2212 // Now check to see if the shift instruction is used by an or.
2213 Value *ShiftUse = *(OpUser->use_begin());
2214 Value *OptAndICopy = 0;
2215 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(ShiftUse)) {
2216 if (BO->getOpcode() == Instruction::And && BO->hasOneUse()) {
2217 if (ConstantInt *ACI = dyn_cast<ConstantInt>(BO->getOperand(1))) {
2218 if (OptAndI) *OptAndI = BO;
2219 OptAndICopy = BO;
2220 Mask &= ACI->getRawValue();
2221 BO = dyn_cast<BinaryOperator>(*(BO->use_begin()));
2222 }
2223 }
2224 if (BO && BO->getOpcode() == Instruction::Or) {
2225 if (OrI) *OrI = BO;
2226 if (Op1User) {
2227 if (BO->getOperand(0) == OpUser || BO->getOperand(0) == OptAndICopy)
2228 *Op1User = dyn_cast<Instruction>(BO->getOperand(1));
2229 else
2230 *Op1User = dyn_cast<Instruction>(BO->getOperand(0));
2231 }
2232 return true;
2233 }
2234 }
2235 }
2236 }
2237 return false;
2238}
2239
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002240/// emitBitfieldInsert - turn a shift used only by an and with immediate into
Nate Begeman905a2912004-10-24 10:33:30 +00002241/// the rotate left word immediate then mask insert (rlwimi) instruction.
2242/// Patterns matched:
2243/// 1. or shl, and 5. or (shl-and), and 9. or and, and
2244/// 2. or and, shl 6. or and, (shl-and)
2245/// 3. or shr, and 7. or (shr-and), and
2246/// 4. or and, shr 8. or and, (shr-and)
Nate Begeman9b508c32004-10-26 03:48:25 +00002247bool PPC32ISel::emitBitfieldInsert(User *OpUser, unsigned DestReg) {
Nate Begeman905a2912004-10-24 10:33:30 +00002248 // Instructions to skip if we match any of the patterns
2249 Instruction *Op0User, *Op1User = 0, *OptAndI = 0, *OrI = 0;
2250 unsigned TgtMask, InsMask, Amount = 0;
2251 bool matched = false;
2252
2253 // We require OpUser to be an instruction to continue
2254 Op0User = dyn_cast<Instruction>(OpUser);
2255 if (0 == Op0User)
2256 return false;
2257
2258 // Look for cases 2, 4, 6, 8, and 9
2259 if (isInsertAndHalf(Op0User, &Op1User, &OrI, TgtMask))
2260 if (Op1User)
2261 if (isInsertAndHalf(Op1User, 0, 0, InsMask))
2262 matched = true;
2263 else if (isInsertShiftHalf(Op1User, 0, 0, &OptAndI, Amount, InsMask))
2264 matched = true;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002265
Nate Begeman905a2912004-10-24 10:33:30 +00002266 // Look for cases 1, 3, 5, and 7. Force the shift argument to be the one
2267 // inserted into the target, since rlwimi can only rotate the value inserted,
2268 // not the value being inserted into.
2269 if (matched == false)
2270 if (isInsertShiftHalf(Op0User, &Op1User, &OrI, &OptAndI, Amount, InsMask))
2271 if (Op1User && isInsertAndHalf(Op1User, 0, 0, TgtMask)) {
2272 std::swap(Op0User, Op1User);
2273 matched = true;
2274 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002275
Nate Begeman905a2912004-10-24 10:33:30 +00002276 // We didn't succeed in matching one of the patterns, so return false
2277 if (matched == false)
2278 return false;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002279
Nate Begeman905a2912004-10-24 10:33:30 +00002280 // If the masks xor to -1, and the insert mask is a run of ones, then we have
2281 // succeeded in matching one of the cases for generating rlwimi. Update the
2282 // skip lists and users of the Instruction::Or.
2283 unsigned MB, ME;
2284 if (((TgtMask ^ InsMask) == 0xFFFFFFFF) && isRunOfOnes(InsMask, MB, ME)) {
2285 SkipList.push_back(Op0User);
2286 SkipList.push_back(Op1User);
2287 SkipList.push_back(OptAndI);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002288 InsertMap[OrI] = RlwimiRec(Op0User->getOperand(0), Op1User->getOperand(0),
Nate Begeman905a2912004-10-24 10:33:30 +00002289 Amount, MB, ME);
2290 return true;
2291 }
2292 return false;
2293}
2294
2295/// emitBitfieldExtract - turn a shift used only by an and with immediate into the
2296/// rotate left word immediate then and with mask (rlwinm) instruction.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002297bool PPC32ISel::emitBitfieldExtract(MachineBasicBlock *MBB,
Nate Begeman905a2912004-10-24 10:33:30 +00002298 MachineBasicBlock::iterator IP,
Nate Begeman9b508c32004-10-26 03:48:25 +00002299 User *OpUser, unsigned DestReg) {
Nate Begeman905a2912004-10-24 10:33:30 +00002300 return false;
Nate Begeman9b508c32004-10-26 03:48:25 +00002301 /*
2302 // Instructions to skip if we match any of the patterns
2303 Instruction *Op0User, *Op1User = 0;
2304 unsigned ShiftMask, AndMask, Amount = 0;
2305 bool matched = false;
Nate Begeman905a2912004-10-24 10:33:30 +00002306
Nate Begeman9b508c32004-10-26 03:48:25 +00002307 // We require OpUser to be an instruction to continue
2308 Op0User = dyn_cast<Instruction>(OpUser);
2309 if (0 == Op0User)
2310 return false;
2311
2312 if (isExtractShiftHalf)
2313 if (isExtractAndHalf)
2314 matched = true;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002315
Nate Begeman9b508c32004-10-26 03:48:25 +00002316 if (matched == false && isExtractAndHalf)
2317 if (isExtractShiftHalf)
2318 matched = true;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002319
Nate Begeman9b508c32004-10-26 03:48:25 +00002320 if (matched == false)
2321 return false;
2322
2323 if (isRunOfOnes(Imm, MB, ME)) {
2324 unsigned SrcReg = getReg(Op, MBB, IP);
2325 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(Rotate)
2326 .addImm(MB).addImm(ME);
2327 Op1User->replaceAllUsesWith(Op0User);
2328 SkipList.push_back(BO);
2329 return true;
Nate Begeman1b750222004-10-17 05:19:20 +00002330 }
Nate Begeman9b508c32004-10-26 03:48:25 +00002331 */
Nate Begeman1b750222004-10-17 05:19:20 +00002332}
2333
Nate Begemanb816f022004-10-07 22:30:03 +00002334/// emitBinaryConstOperation - Implement simple binary operators for integral
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002335/// types with a constant operand. Opcode is one of: 0 for Add, 1 for Sub,
Nate Begemanb816f022004-10-07 22:30:03 +00002336/// 2 for And, 3 for Or, 4 for Xor, and 5 for Subtract-From.
2337///
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002338void PPC32ISel::emitBinaryConstOperation(MachineBasicBlock *MBB,
Nate Begemanb816f022004-10-07 22:30:03 +00002339 MachineBasicBlock::iterator IP,
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002340 unsigned Op0Reg, ConstantInt *Op1,
Nate Begemanb816f022004-10-07 22:30:03 +00002341 unsigned Opcode, unsigned DestReg) {
2342 static const unsigned OpTab[] = {
2343 PPC::ADD, PPC::SUB, PPC::AND, PPC::OR, PPC::XOR, PPC::SUBF
2344 };
2345 static const unsigned ImmOpTab[2][6] = {
2346 { PPC::ADDI, PPC::ADDI, PPC::ANDIo, PPC::ORI, PPC::XORI, PPC::SUBFIC },
2347 { PPC::ADDIS, PPC::ADDIS, PPC::ANDISo, PPC::ORIS, PPC::XORIS, PPC::SUBFIC }
2348 };
2349
Chris Lattner02846282004-11-30 07:30:20 +00002350 // Handle subtract now by inverting the constant value: X-4 == X+(-4)
Nate Begemanb816f022004-10-07 22:30:03 +00002351 if (Opcode == 1) {
Chris Lattner02846282004-11-30 07:30:20 +00002352 Op1 = cast<ConstantInt>(ConstantExpr::getNeg(Op1));
2353 Opcode = 0;
Nate Begemanb816f022004-10-07 22:30:03 +00002354 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002355
Nate Begemanb816f022004-10-07 22:30:03 +00002356 // xor X, -1 -> not X
Chris Lattner02846282004-11-30 07:30:20 +00002357 if (Opcode == 4 && Op1->isAllOnesValue()) {
2358 BuildMI(*MBB, IP, PPC::NOR, 2, DestReg).addReg(Op0Reg).addReg(Op0Reg);
2359 return;
Nate Begemanb816f022004-10-07 22:30:03 +00002360 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002361
Chris Lattner02846282004-11-30 07:30:20 +00002362 if (Opcode == 2 && !Op1->isNullValue()) {
2363 unsigned MB, ME, mask = Op1->getRawValue();
Nate Begemanbdf69842004-10-08 02:49:24 +00002364 if (isRunOfOnes(mask, MB, ME)) {
Nate Begemanbdf69842004-10-08 02:49:24 +00002365 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(Op0Reg).addImm(0)
2366 .addImm(MB).addImm(ME);
2367 return;
2368 }
2369 }
Nate Begemanb816f022004-10-07 22:30:03 +00002370
Nate Begemane0c83a82004-10-15 00:50:19 +00002371 // PowerPC 16 bit signed immediates are sign extended before use by the
2372 // instruction. Therefore, we can only split up an add of a reg with a 32 bit
2373 // immediate into addis and addi if the sign bit of the low 16 bits is cleared
2374 // so that for register A, const imm X, we don't end up with
2375 // A + XXXX0000 + FFFFXXXX.
2376 bool WontSignExtend = (0 == (Op1->getRawValue() & 0x8000));
2377
Nate Begemanb816f022004-10-07 22:30:03 +00002378 // For Add, Sub, and SubF the instruction takes a signed immediate. For And,
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002379 // Or, and Xor, the instruction takes an unsigned immediate. There is no
Nate Begemanb816f022004-10-07 22:30:03 +00002380 // shifted immediate form of SubF so disallow its opcode for those constants.
Chris Lattner02846282004-11-30 07:30:20 +00002381 if (canUseAsImmediateForOpcode(Op1, Opcode, false)) {
Nate Begemanb816f022004-10-07 22:30:03 +00002382 if (Opcode < 2 || Opcode == 5)
2383 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(Op0Reg)
2384 .addSImm(Op1->getRawValue());
2385 else
2386 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(Op0Reg)
2387 .addZImm(Op1->getRawValue());
Chris Lattner02846282004-11-30 07:30:20 +00002388 } else if (canUseAsImmediateForOpcode(Op1, Opcode, true) && (Opcode < 5)) {
Nate Begemanb816f022004-10-07 22:30:03 +00002389 if (Opcode < 2)
2390 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, DestReg).addReg(Op0Reg)
2391 .addSImm(Op1->getRawValue() >> 16);
2392 else
2393 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, DestReg).addReg(Op0Reg)
2394 .addZImm(Op1->getRawValue() >> 16);
Nate Begemane0c83a82004-10-15 00:50:19 +00002395 } else if ((Opcode < 2 && WontSignExtend) || Opcode == 3 || Opcode == 4) {
2396 unsigned TmpReg = makeAnotherReg(Op1->getType());
Nate Begemane0c83a82004-10-15 00:50:19 +00002397 if (Opcode < 2) {
2398 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, TmpReg).addReg(Op0Reg)
2399 .addSImm(Op1->getRawValue() >> 16);
2400 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(TmpReg)
2401 .addSImm(Op1->getRawValue());
2402 } else {
2403 BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, TmpReg).addReg(Op0Reg)
2404 .addZImm(Op1->getRawValue() >> 16);
2405 BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(TmpReg)
2406 .addZImm(Op1->getRawValue());
2407 }
Nate Begemanb816f022004-10-07 22:30:03 +00002408 } else {
2409 unsigned Op1Reg = getReg(Op1, MBB, IP);
2410 BuildMI(*MBB, IP, OpTab[Opcode], 2, DestReg).addReg(Op0Reg).addReg(Op1Reg);
2411 }
2412}
2413
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002414/// emitSimpleBinaryOperation - Implement simple binary operators for integral
2415/// types... OperatorClass is one of: 0 for Add, 1 for Sub, 2 for And, 3 for
2416/// Or, 4 for Xor.
2417///
Misha Brukmana1dca552004-09-21 18:22:19 +00002418void PPC32ISel::emitSimpleBinaryOperation(MachineBasicBlock *MBB,
2419 MachineBasicBlock::iterator IP,
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002420 BinaryOperator *BO,
Misha Brukmana1dca552004-09-21 18:22:19 +00002421 Value *Op0, Value *Op1,
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002422 unsigned OperatorClass,
Misha Brukmana1dca552004-09-21 18:22:19 +00002423 unsigned DestReg) {
Misha Brukman422791f2004-06-21 17:41:12 +00002424 // Arithmetic and Bitwise operators
Misha Brukman911afde2004-06-25 14:50:41 +00002425 static const unsigned OpcodeTab[] = {
Nate Begemanf70b5762005-03-28 23:08:54 +00002426 PPC::ADD, PPC::SUBF, PPC::AND, PPC::OR, PPC::XOR
Misha Brukman422791f2004-06-21 17:41:12 +00002427 };
Nate Begemanb816f022004-10-07 22:30:03 +00002428 static const unsigned LongOpTab[2][5] = {
Nate Begemanca12a2b2005-03-28 22:28:37 +00002429 { PPC::ADDC, PPC::SUBFC, PPC::AND, PPC::OR, PPC::XOR },
Nate Begemanb816f022004-10-07 22:30:03 +00002430 { PPC::ADDE, PPC::SUBFE, PPC::AND, PPC::OR, PPC::XOR }
Misha Brukman422791f2004-06-21 17:41:12 +00002431 };
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002432
Nate Begemanb816f022004-10-07 22:30:03 +00002433 unsigned Class = getClassB(Op0->getType());
2434
Misha Brukman7e898c32004-07-20 00:41:46 +00002435 if (Class == cFP32 || Class == cFP64) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002436 assert(OperatorClass < 2 && "No logical ops for FP!");
2437 emitBinaryFPOperation(MBB, IP, Op0, Op1, OperatorClass, DestReg);
2438 return;
2439 }
2440
2441 if (Op0->getType() == Type::BoolTy) {
2442 if (OperatorClass == 3)
2443 // If this is an or of two isnan's, emit an FP comparison directly instead
2444 // of or'ing two isnan's together.
2445 if (Value *LHS = dyncastIsNan(Op0))
2446 if (Value *RHS = dyncastIsNan(Op1)) {
2447 unsigned Op0Reg = getReg(RHS, MBB, IP), Op1Reg = getReg(LHS, MBB, IP);
Misha Brukman422791f2004-06-21 17:41:12 +00002448 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002449 emitUCOM(MBB, IP, Op0Reg, Op1Reg);
Misha Brukman5b570812004-08-10 22:47:03 +00002450 BuildMI(*MBB, IP, PPC::MFCR, TmpReg);
2451 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(TmpReg).addImm(4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002452 .addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002453 return;
2454 }
2455 }
2456
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002457 // Special case: op <const int>, Reg
Nate Begemanb816f022004-10-07 22:30:03 +00002458 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op0))
Misha Brukman1013ef52004-07-21 20:09:08 +00002459 if (Class != cLong) {
Nate Begemanb816f022004-10-07 22:30:03 +00002460 unsigned Opcode = (OperatorClass == 1) ? 5 : OperatorClass;
2461 unsigned Op1r = getReg(Op1, MBB, IP);
2462 emitBinaryConstOperation(MBB, IP, Op1r, CI, Opcode, DestReg);
2463 return;
2464 }
2465 // Special case: op Reg, <const int>
2466 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1))
2467 if (Class != cLong) {
Nate Begeman9b508c32004-10-26 03:48:25 +00002468 if (emitBitfieldInsert(BO, DestReg))
Nate Begeman1b750222004-10-17 05:19:20 +00002469 return;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002470
Nate Begemanb816f022004-10-07 22:30:03 +00002471 unsigned Op0r = getReg(Op0, MBB, IP);
2472 emitBinaryConstOperation(MBB, IP, Op0r, CI, OperatorClass, DestReg);
Misha Brukman1013ef52004-07-21 20:09:08 +00002473 return;
2474 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002475
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002476 // We couldn't generate an immediate variant of the op, load both halves into
2477 // registers and emit the appropriate opcode.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002478 unsigned Op0r = getReg(Op0, MBB, IP);
2479 unsigned Op1r = getReg(Op1, MBB, IP);
2480
Nate Begemanf70b5762005-03-28 23:08:54 +00002481 // Subtracts have their operands swapped
2482 if (OperatorClass == 1) {
2483 if (Class != cLong) {
2484 BuildMI(*MBB, IP, PPC::SUBF, 2, DestReg).addReg(Op1r).addReg(Op0r);
2485 } else {
2486 BuildMI(*MBB, IP, PPC::SUBFC, 2, DestReg+1).addReg(Op1r+1).addReg(Op0r+1);
2487 BuildMI(*MBB, IP, PPC::SUBFE, 2, DestReg).addReg(Op1r).addReg(Op0r);
2488 }
2489 return;
2490 }
2491
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002492 if (Class != cLong) {
Misha Brukman422791f2004-06-21 17:41:12 +00002493 unsigned Opcode = OpcodeTab[OperatorClass];
2494 BuildMI(*MBB, IP, Opcode, 2, DestReg).addReg(Op0r).addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002495 } else {
Nate Begemanb816f022004-10-07 22:30:03 +00002496 BuildMI(*MBB, IP, LongOpTab[0][OperatorClass], 2, DestReg+1).addReg(Op0r+1)
Misha Brukman7e898c32004-07-20 00:41:46 +00002497 .addReg(Op1r+1);
Nate Begemanb816f022004-10-07 22:30:03 +00002498 BuildMI(*MBB, IP, LongOpTab[1][OperatorClass], 2, DestReg).addReg(Op0r)
Misha Brukman1013ef52004-07-21 20:09:08 +00002499 .addReg(Op1r);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002500 }
2501 return;
2502}
2503
Misha Brukman1013ef52004-07-21 20:09:08 +00002504/// doMultiply - Emit appropriate instructions to multiply together the
2505/// Values Op0 and Op1, and put the result in DestReg.
Misha Brukman2fec9902004-06-21 20:22:03 +00002506///
Misha Brukmana1dca552004-09-21 18:22:19 +00002507void PPC32ISel::doMultiply(MachineBasicBlock *MBB,
2508 MachineBasicBlock::iterator IP,
2509 unsigned DestReg, Value *Op0, Value *Op1) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002510 unsigned Class0 = getClass(Op0->getType());
2511 unsigned Class1 = getClass(Op1->getType());
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002512
Misha Brukman1013ef52004-07-21 20:09:08 +00002513 unsigned Op0r = getReg(Op0, MBB, IP);
2514 unsigned Op1r = getReg(Op1, MBB, IP);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002515
Misha Brukman1013ef52004-07-21 20:09:08 +00002516 // 64 x 64 -> 64
2517 if (Class0 == cLong && Class1 == cLong) {
2518 unsigned Tmp1 = makeAnotherReg(Type::IntTy);
2519 unsigned Tmp2 = makeAnotherReg(Type::IntTy);
2520 unsigned Tmp3 = makeAnotherReg(Type::IntTy);
2521 unsigned Tmp4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00002522 BuildMI(*MBB, IP, PPC::MULHWU, 2, Tmp1).addReg(Op0r+1).addReg(Op1r+1);
2523 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg+1).addReg(Op0r+1).addReg(Op1r+1);
2524 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp2).addReg(Op0r+1).addReg(Op1r);
2525 BuildMI(*MBB, IP, PPC::ADD, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
2526 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp4).addReg(Op0r).addReg(Op1r+1);
2527 BuildMI(*MBB, IP, PPC::ADD, 2, DestReg).addReg(Tmp3).addReg(Tmp4);
Misha Brukman1013ef52004-07-21 20:09:08 +00002528 return;
2529 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002530
Misha Brukman1013ef52004-07-21 20:09:08 +00002531 // 64 x 32 or less, promote 32 to 64 and do a 64 x 64
2532 if (Class0 == cLong && Class1 <= cInt) {
2533 unsigned Tmp0 = makeAnotherReg(Type::IntTy);
2534 unsigned Tmp1 = makeAnotherReg(Type::IntTy);
2535 unsigned Tmp2 = makeAnotherReg(Type::IntTy);
2536 unsigned Tmp3 = makeAnotherReg(Type::IntTy);
2537 unsigned Tmp4 = makeAnotherReg(Type::IntTy);
2538 if (Op1->getType()->isSigned())
Misha Brukman5b570812004-08-10 22:47:03 +00002539 BuildMI(*MBB, IP, PPC::SRAWI, 2, Tmp0).addReg(Op1r).addImm(31);
Misha Brukman1013ef52004-07-21 20:09:08 +00002540 else
Misha Brukman5b570812004-08-10 22:47:03 +00002541 BuildMI(*MBB, IP, PPC::LI, 2, Tmp0).addSImm(0);
2542 BuildMI(*MBB, IP, PPC::MULHWU, 2, Tmp1).addReg(Op0r+1).addReg(Op1r);
2543 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg+1).addReg(Op0r+1).addReg(Op1r);
2544 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp2).addReg(Op0r+1).addReg(Tmp0);
2545 BuildMI(*MBB, IP, PPC::ADD, 2, Tmp3).addReg(Tmp1).addReg(Tmp2);
2546 BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp4).addReg(Op0r).addReg(Op1r);
2547 BuildMI(*MBB, IP, PPC::ADD, 2, DestReg).addReg(Tmp3).addReg(Tmp4);
Misha Brukman1013ef52004-07-21 20:09:08 +00002548 return;
2549 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002550
Misha Brukman1013ef52004-07-21 20:09:08 +00002551 // 32 x 32 -> 32
2552 if (Class0 <= cInt && Class1 <= cInt) {
Misha Brukman5b570812004-08-10 22:47:03 +00002553 BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg).addReg(Op0r).addReg(Op1r);
Misha Brukman1013ef52004-07-21 20:09:08 +00002554 return;
2555 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002556
Misha Brukman1013ef52004-07-21 20:09:08 +00002557 assert(0 && "doMultiply cannot operate on unknown type!");
2558}
2559
2560/// doMultiplyConst - This method will multiply the value in Op0 by the
2561/// value of the ContantInt *CI
Misha Brukmana1dca552004-09-21 18:22:19 +00002562void PPC32ISel::doMultiplyConst(MachineBasicBlock *MBB,
2563 MachineBasicBlock::iterator IP,
2564 unsigned DestReg, Value *Op0, ConstantInt *CI) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002565 unsigned Class = getClass(Op0->getType());
2566
2567 // Mul op0, 0 ==> 0
2568 if (CI->isNullValue()) {
Misha Brukman5b570812004-08-10 22:47:03 +00002569 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00002570 if (Class == cLong)
Misha Brukman5b570812004-08-10 22:47:03 +00002571 BuildMI(*MBB, IP, PPC::LI, 1, DestReg+1).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002572 return;
Misha Brukman1013ef52004-07-21 20:09:08 +00002573 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002574
Misha Brukman1013ef52004-07-21 20:09:08 +00002575 // Mul op0, 1 ==> op0
2576 if (CI->equalsInt(1)) {
2577 unsigned Op0r = getReg(Op0, MBB, IP);
Misha Brukman5b570812004-08-10 22:47:03 +00002578 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(Op0r).addReg(Op0r);
Misha Brukman1013ef52004-07-21 20:09:08 +00002579 if (Class == cLong)
Misha Brukman5b570812004-08-10 22:47:03 +00002580 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(Op0r+1).addReg(Op0r+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002581 return;
2582 }
2583
2584 // If the element size is exactly a power of 2, use a shift to get it.
Misha Brukman1013ef52004-07-21 20:09:08 +00002585 if (unsigned Shift = ExactLog2(CI->getRawValue())) {
2586 ConstantUInt *ShiftCI = ConstantUInt::get(Type::UByteTy, Shift);
Nate Begeman9b508c32004-10-26 03:48:25 +00002587 emitShiftOperation(MBB, IP, Op0, ShiftCI, true, Op0->getType(), 0, DestReg);
Misha Brukman1013ef52004-07-21 20:09:08 +00002588 return;
2589 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002590
Misha Brukman1013ef52004-07-21 20:09:08 +00002591 // If 32 bits or less and immediate is in right range, emit mul by immediate
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002592 if (Class == cByte || Class == cShort || Class == cInt) {
Nate Begemanb816f022004-10-07 22:30:03 +00002593 if (canUseAsImmediateForOpcode(CI, 0, false)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002594 unsigned Op0r = getReg(Op0, MBB, IP);
2595 unsigned imm = CI->getRawValue() & 0xFFFF;
Misha Brukman5b570812004-08-10 22:47:03 +00002596 BuildMI(*MBB, IP, PPC::MULLI, 2, DestReg).addReg(Op0r).addSImm(imm);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002597 return;
2598 }
2599 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002600
Misha Brukman1013ef52004-07-21 20:09:08 +00002601 doMultiply(MBB, IP, DestReg, Op0, CI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002602}
2603
Misha Brukmana1dca552004-09-21 18:22:19 +00002604void PPC32ISel::visitMul(BinaryOperator &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002605 unsigned ResultReg = getReg(I);
2606
2607 Value *Op0 = I.getOperand(0);
2608 Value *Op1 = I.getOperand(1);
2609
2610 MachineBasicBlock::iterator IP = BB->end();
2611 emitMultiply(BB, IP, Op0, Op1, ResultReg);
2612}
2613
Misha Brukmana1dca552004-09-21 18:22:19 +00002614void PPC32ISel::emitMultiply(MachineBasicBlock *MBB,
2615 MachineBasicBlock::iterator IP,
2616 Value *Op0, Value *Op1, unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002617 TypeClass Class = getClass(Op0->getType());
2618
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002619 switch (Class) {
2620 case cByte:
2621 case cShort:
2622 case cInt:
Misha Brukman1013ef52004-07-21 20:09:08 +00002623 case cLong:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002624 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00002625 doMultiplyConst(MBB, IP, DestReg, Op0, CI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002626 } else {
Misha Brukman1013ef52004-07-21 20:09:08 +00002627 doMultiply(MBB, IP, DestReg, Op0, Op1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002628 }
2629 return;
Misha Brukman7e898c32004-07-20 00:41:46 +00002630 case cFP32:
2631 case cFP64:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002632 emitBinaryFPOperation(MBB, IP, Op0, Op1, 2, DestReg);
2633 return;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002634 break;
2635 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002636}
2637
2638
2639/// visitDivRem - Handle division and remainder instructions... these
2640/// instruction both require the same instructions to be generated, they just
2641/// select the result from a different register. Note that both of these
2642/// instructions work differently for signed and unsigned operands.
2643///
Misha Brukmana1dca552004-09-21 18:22:19 +00002644void PPC32ISel::visitDivRem(BinaryOperator &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002645 unsigned ResultReg = getReg(I);
2646 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2647
2648 MachineBasicBlock::iterator IP = BB->end();
Misha Brukman2fec9902004-06-21 20:22:03 +00002649 emitDivRemOperation(BB, IP, Op0, Op1, I.getOpcode() == Instruction::Div,
2650 ResultReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002651}
2652
Nate Begeman087d5d92004-10-06 09:53:04 +00002653void PPC32ISel::emitDivRemOperation(MachineBasicBlock *MBB,
Misha Brukmana1dca552004-09-21 18:22:19 +00002654 MachineBasicBlock::iterator IP,
2655 Value *Op0, Value *Op1, bool isDiv,
2656 unsigned ResultReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002657 const Type *Ty = Op0->getType();
2658 unsigned Class = getClass(Ty);
2659 switch (Class) {
Misha Brukman7e898c32004-07-20 00:41:46 +00002660 case cFP32:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002661 if (isDiv) {
Misha Brukman7e898c32004-07-20 00:41:46 +00002662 // Floating point divide...
Nate Begeman087d5d92004-10-06 09:53:04 +00002663 emitBinaryFPOperation(MBB, IP, Op0, Op1, 3, ResultReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002664 return;
Misha Brukman7e898c32004-07-20 00:41:46 +00002665 } else {
2666 // Floating point remainder via fmodf(float x, float y);
Nate Begeman087d5d92004-10-06 09:53:04 +00002667 unsigned Op0Reg = getReg(Op0, MBB, IP);
2668 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman7e898c32004-07-20 00:41:46 +00002669 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002670 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(fmodfFn, true);
Misha Brukman7e898c32004-07-20 00:41:46 +00002671 std::vector<ValueRecord> Args;
2672 Args.push_back(ValueRecord(Op0Reg, Type::FloatTy));
2673 Args.push_back(ValueRecord(Op1Reg, Type::FloatTy));
2674 doCall(ValueRecord(ResultReg, Type::FloatTy), TheCall, Args, false);
2675 }
2676 return;
2677 case cFP64:
2678 if (isDiv) {
2679 // Floating point divide...
Nate Begeman087d5d92004-10-06 09:53:04 +00002680 emitBinaryFPOperation(MBB, IP, Op0, Op1, 3, ResultReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00002681 return;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002682 } else {
Misha Brukman7e898c32004-07-20 00:41:46 +00002683 // Floating point remainder via fmod(double x, double y);
Nate Begeman087d5d92004-10-06 09:53:04 +00002684 unsigned Op0Reg = getReg(Op0, MBB, IP);
2685 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002686 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002687 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(fmodFn, true);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002688 std::vector<ValueRecord> Args;
2689 Args.push_back(ValueRecord(Op0Reg, Type::DoubleTy));
2690 Args.push_back(ValueRecord(Op1Reg, Type::DoubleTy));
Misha Brukmand18a31d2004-07-06 22:51:53 +00002691 doCall(ValueRecord(ResultReg, Type::DoubleTy), TheCall, Args, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002692 }
2693 return;
2694 case cLong: {
Misha Brukman7e898c32004-07-20 00:41:46 +00002695 static Function* const Funcs[] =
Misha Brukman0aa97c62004-07-08 18:27:59 +00002696 { __moddi3Fn, __divdi3Fn, __umoddi3Fn, __udivdi3Fn };
Nate Begeman087d5d92004-10-06 09:53:04 +00002697 unsigned Op0Reg = getReg(Op0, MBB, IP);
2698 unsigned Op1Reg = getReg(Op1, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002699 unsigned NameIdx = Ty->isUnsigned()*2 + isDiv;
2700 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00002701 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(Funcs[NameIdx], true);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002702
2703 std::vector<ValueRecord> Args;
2704 Args.push_back(ValueRecord(Op0Reg, Type::LongTy));
2705 Args.push_back(ValueRecord(Op1Reg, Type::LongTy));
Misha Brukmand18a31d2004-07-06 22:51:53 +00002706 doCall(ValueRecord(ResultReg, Type::LongTy), TheCall, Args, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002707 return;
2708 }
2709 case cByte: case cShort: case cInt:
2710 break; // Small integrals, handled below...
2711 default: assert(0 && "Unknown class!");
2712 }
2713
2714 // Special case signed division by power of 2.
2715 if (isDiv)
2716 if (ConstantSInt *CI = dyn_cast<ConstantSInt>(Op1)) {
2717 assert(Class != cLong && "This doesn't handle 64-bit divides!");
2718 int V = CI->getValue();
2719
2720 if (V == 1) { // X /s 1 => X
Nate Begeman087d5d92004-10-06 09:53:04 +00002721 unsigned Op0Reg = getReg(Op0, MBB, IP);
2722 BuildMI(*MBB, IP, PPC::OR, 2, ResultReg).addReg(Op0Reg).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002723 return;
2724 }
2725
2726 if (V == -1) { // X /s -1 => -X
Nate Begeman087d5d92004-10-06 09:53:04 +00002727 unsigned Op0Reg = getReg(Op0, MBB, IP);
2728 BuildMI(*MBB, IP, PPC::NEG, 1, ResultReg).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002729 return;
2730 }
2731
Misha Brukmanec6319a2004-07-20 15:51:37 +00002732 unsigned log2V = ExactLog2(V);
2733 if (log2V != 0 && Ty->isSigned()) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002734 unsigned Op0Reg = getReg(Op0, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002735 unsigned TmpReg = makeAnotherReg(Op0->getType());
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002736
Nate Begeman087d5d92004-10-06 09:53:04 +00002737 BuildMI(*MBB, IP, PPC::SRAWI, 2, TmpReg).addReg(Op0Reg).addImm(log2V);
2738 BuildMI(*MBB, IP, PPC::ADDZE, 1, ResultReg).addReg(TmpReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002739 return;
2740 }
2741 }
2742
Nate Begeman087d5d92004-10-06 09:53:04 +00002743 unsigned Op0Reg = getReg(Op0, MBB, IP);
2744
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002745 if (isDiv) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002746 unsigned Op1Reg = getReg(Op1, MBB, IP);
2747 unsigned Opcode = Ty->isSigned() ? PPC::DIVW : PPC::DIVWU;
2748 BuildMI(*MBB, IP, Opcode, 2, ResultReg).addReg(Op0Reg).addReg(Op1Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002749 } else { // Remainder
Nate Begeman087d5d92004-10-06 09:53:04 +00002750 // FIXME: don't load the CI part of a CI divide twice
2751 ConstantInt *CI = dyn_cast<ConstantInt>(Op1);
Misha Brukman422791f2004-06-21 17:41:12 +00002752 unsigned TmpReg1 = makeAnotherReg(Op0->getType());
2753 unsigned TmpReg2 = makeAnotherReg(Op0->getType());
Nate Begeman087d5d92004-10-06 09:53:04 +00002754 emitDivRemOperation(MBB, IP, Op0, Op1, true, TmpReg1);
Nate Begemanb816f022004-10-07 22:30:03 +00002755 if (CI && canUseAsImmediateForOpcode(CI, 0, false)) {
Nate Begeman087d5d92004-10-06 09:53:04 +00002756 BuildMI(*MBB, IP, PPC::MULLI, 2, TmpReg2).addReg(TmpReg1)
2757 .addSImm(CI->getRawValue());
2758 } else {
2759 unsigned Op1Reg = getReg(Op1, MBB, IP);
2760 BuildMI(*MBB, IP, PPC::MULLW, 2, TmpReg2).addReg(TmpReg1).addReg(Op1Reg);
2761 }
2762 BuildMI(*MBB, IP, PPC::SUBF, 2, ResultReg).addReg(TmpReg2).addReg(Op0Reg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002763 }
2764}
2765
2766
2767/// Shift instructions: 'shl', 'sar', 'shr' - Some special cases here
2768/// for constant immediate shift values, and for constant immediate
2769/// shift values equal to 1. Even the general case is sort of special,
2770/// because the shift amount has to be in CL, not just any old register.
2771///
Misha Brukmana1dca552004-09-21 18:22:19 +00002772void PPC32ISel::visitShiftInst(ShiftInst &I) {
Nate Begeman905a2912004-10-24 10:33:30 +00002773 if (std::find(SkipList.begin(), SkipList.end(), &I) != SkipList.end())
2774 return;
2775
Misha Brukmane2eceb52004-07-23 16:08:20 +00002776 MachineBasicBlock::iterator IP = BB->end();
2777 emitShiftOperation(BB, IP, I.getOperand(0), I.getOperand(1),
2778 I.getOpcode() == Instruction::Shl, I.getType(),
Nate Begeman9b508c32004-10-26 03:48:25 +00002779 &I, getReg(I));
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002780}
2781
2782/// emitShiftOperation - Common code shared between visitShiftInst and
2783/// constant expression support.
Misha Brukman2fec9902004-06-21 20:22:03 +00002784///
Misha Brukmana1dca552004-09-21 18:22:19 +00002785void PPC32ISel::emitShiftOperation(MachineBasicBlock *MBB,
2786 MachineBasicBlock::iterator IP,
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002787 Value *Op, Value *ShiftAmount,
Nate Begeman9b508c32004-10-26 03:48:25 +00002788 bool isLeftShift, const Type *ResultTy,
2789 ShiftInst *SI, unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002790 bool isSigned = ResultTy->isSigned ();
2791 unsigned Class = getClass (ResultTy);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002792
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002793 // Longs, as usual, are handled specially...
2794 if (Class == cLong) {
Nate Begeman1b750222004-10-17 05:19:20 +00002795 unsigned SrcReg = getReg (Op, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002796 // If we have a constant shift, we can generate much more efficient code
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002797 // than for a variable shift by using the rlwimi instruction.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002798 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(ShiftAmount)) {
2799 unsigned Amount = CUI->getValue();
Chris Lattner77470402004-11-30 06:29:10 +00002800 if (Amount == 0) {
2801 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
2802 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1)
2803 .addReg(SrcReg+1).addReg(SrcReg+1);
2804
2805 } else if (Amount < 32) {
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002806 unsigned TempReg = makeAnotherReg(ResultTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002807 if (isLeftShift) {
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002808 BuildMI(*MBB, IP, PPC::RLWINM, 4, TempReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002809 .addImm(Amount).addImm(0).addImm(31-Amount);
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002810 BuildMI(*MBB, IP, PPC::RLWIMI, 5, DestReg).addReg(TempReg)
2811 .addReg(SrcReg+1).addImm(Amount).addImm(32-Amount).addImm(31);
Misha Brukman5b570812004-08-10 22:47:03 +00002812 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg+1).addReg(SrcReg+1)
Misha Brukman1013ef52004-07-21 20:09:08 +00002813 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002814 } else {
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002815 BuildMI(*MBB, IP, PPC::RLWINM, 4, TempReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002816 .addImm(32-Amount).addImm(Amount).addImm(31);
Nate Begeman2d4c98d2004-10-16 20:43:38 +00002817 BuildMI(*MBB, IP, PPC::RLWIMI, 5, DestReg+1).addReg(TempReg)
2818 .addReg(SrcReg).addImm(32-Amount).addImm(0).addImm(Amount-1);
Nate Begeman020ef422005-04-06 22:42:08 +00002819 if (isSigned) {
2820 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg)
2821 .addImm(Amount);
2822 } else {
2823 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
2824 .addImm(32-Amount).addImm(Amount).addImm(31);
2825 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002826 }
2827 } else { // Shifting more than 32 bits
2828 Amount -= 32;
2829 if (isLeftShift) {
2830 if (Amount != 0) {
Misha Brukman5b570812004-08-10 22:47:03 +00002831 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002832 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002833 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002834 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002835 .addReg(SrcReg+1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002836 }
Misha Brukman5b570812004-08-10 22:47:03 +00002837 BuildMI(*MBB, IP, PPC::LI, 1, DestReg+1).addSImm(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00002838 } else {
2839 if (Amount != 0) {
2840 if (isSigned)
Misha Brukman5b570812004-08-10 22:47:03 +00002841 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002842 .addImm(Amount);
2843 else
Misha Brukman5b570812004-08-10 22:47:03 +00002844 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002845 .addImm(32-Amount).addImm(Amount).addImm(31);
2846 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002847 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002848 .addReg(SrcReg);
2849 }
Nate Begeman020ef422005-04-06 22:42:08 +00002850 if (isSigned)
2851 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg)
2852 .addImm(31);
2853 else
2854 BuildMI(*MBB, IP,PPC::LI, 1, DestReg).addSImm(0);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002855 }
2856 }
2857 } else {
2858 unsigned TmpReg1 = makeAnotherReg(Type::IntTy);
2859 unsigned TmpReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman422791f2004-06-21 17:41:12 +00002860 unsigned TmpReg3 = makeAnotherReg(Type::IntTy);
2861 unsigned TmpReg4 = makeAnotherReg(Type::IntTy);
2862 unsigned TmpReg5 = makeAnotherReg(Type::IntTy);
2863 unsigned TmpReg6 = makeAnotherReg(Type::IntTy);
2864 unsigned ShiftAmountReg = getReg (ShiftAmount, MBB, IP);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002865
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002866 if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002867 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002868 .addSImm(32);
Misha Brukman5b570812004-08-10 22:47:03 +00002869 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg2).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002870 .addReg(ShiftAmountReg);
Misha Brukman5b570812004-08-10 22:47:03 +00002871 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg3).addReg(SrcReg+1)
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002872 .addReg(TmpReg1);
Misha Brukman5b570812004-08-10 22:47:03 +00002873 BuildMI(*MBB, IP, PPC::OR, 2,TmpReg4).addReg(TmpReg2).addReg(TmpReg3);
2874 BuildMI(*MBB, IP, PPC::ADDI, 2, TmpReg5).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002875 .addSImm(-32);
Misha Brukman5b570812004-08-10 22:47:03 +00002876 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg6).addReg(SrcReg+1)
Misha Brukman2ed17ca2004-07-22 15:58:04 +00002877 .addReg(TmpReg5);
Misha Brukman5b570812004-08-10 22:47:03 +00002878 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(TmpReg4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002879 .addReg(TmpReg6);
Misha Brukman5b570812004-08-10 22:47:03 +00002880 BuildMI(*MBB, IP, PPC::SLW, 2, DestReg+1).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002881 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002882 } else {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002883 if (isSigned) { // shift right algebraic
Nate Begemanf2f07812004-08-29 08:19:32 +00002884 MachineBasicBlock *TmpMBB =new MachineBasicBlock(BB->getBasicBlock());
2885 MachineBasicBlock *PhiMBB =new MachineBasicBlock(BB->getBasicBlock());
2886 MachineBasicBlock *OldMBB = BB;
2887 ilist<MachineBasicBlock>::iterator It = BB; ++It;
2888 F->getBasicBlockList().insert(It, TmpMBB);
2889 F->getBasicBlockList().insert(It, PhiMBB);
2890 BB->addSuccessor(TmpMBB);
2891 BB->addSuccessor(PhiMBB);
2892
2893 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
2894 .addSImm(32);
2895 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg2).addReg(SrcReg+1)
2896 .addReg(ShiftAmountReg);
2897 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg3).addReg(SrcReg)
2898 .addReg(TmpReg1);
2899 BuildMI(*MBB, IP, PPC::OR, 2, TmpReg4).addReg(TmpReg2)
2900 .addReg(TmpReg3);
2901 BuildMI(*MBB, IP, PPC::ADDICo, 2, TmpReg5).addReg(ShiftAmountReg)
2902 .addSImm(-32);
2903 BuildMI(*MBB, IP, PPC::SRAW, 2, TmpReg6).addReg(SrcReg)
2904 .addReg(TmpReg5);
2905 BuildMI(*MBB, IP, PPC::SRAW, 2, DestReg).addReg(SrcReg)
2906 .addReg(ShiftAmountReg);
2907 BuildMI(*MBB, IP, PPC::BLE, 2).addReg(PPC::CR0).addMBB(PhiMBB);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002908
Nate Begemanf2f07812004-08-29 08:19:32 +00002909 // OrMBB:
2910 // Select correct least significant half if the shift amount > 32
2911 BB = TmpMBB;
2912 unsigned OrReg = makeAnotherReg(Type::IntTy);
Chris Lattner35f2bbe2004-11-30 06:40:04 +00002913 BuildMI(BB, PPC::OR, 2, OrReg).addReg(TmpReg6).addReg(TmpReg6);
Nate Begemanf2f07812004-08-29 08:19:32 +00002914 TmpMBB->addSuccessor(PhiMBB);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002915
Nate Begemanf2f07812004-08-29 08:19:32 +00002916 BB = PhiMBB;
2917 BuildMI(BB, PPC::PHI, 4, DestReg+1).addReg(TmpReg4).addMBB(OldMBB)
2918 .addReg(OrReg).addMBB(TmpMBB);
2919 } else { // shift right logical
Misha Brukman5b570812004-08-10 22:47:03 +00002920 BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002921 .addSImm(32);
Misha Brukman5b570812004-08-10 22:47:03 +00002922 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg2).addReg(SrcReg+1)
Misha Brukman2fec9902004-06-21 20:22:03 +00002923 .addReg(ShiftAmountReg);
Misha Brukman5b570812004-08-10 22:47:03 +00002924 BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg3).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002925 .addReg(TmpReg1);
Misha Brukman5b570812004-08-10 22:47:03 +00002926 BuildMI(*MBB, IP, PPC::OR, 2, TmpReg4).addReg(TmpReg2)
Misha Brukman2fec9902004-06-21 20:22:03 +00002927 .addReg(TmpReg3);
Misha Brukman5b570812004-08-10 22:47:03 +00002928 BuildMI(*MBB, IP, PPC::ADDI, 2, TmpReg5).addReg(ShiftAmountReg)
Misha Brukman1013ef52004-07-21 20:09:08 +00002929 .addSImm(-32);
Misha Brukman5b570812004-08-10 22:47:03 +00002930 BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg6).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002931 .addReg(TmpReg5);
Misha Brukman5b570812004-08-10 22:47:03 +00002932 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(TmpReg4)
Misha Brukman2fec9902004-06-21 20:22:03 +00002933 .addReg(TmpReg6);
Misha Brukman5b570812004-08-10 22:47:03 +00002934 BuildMI(*MBB, IP, PPC::SRW, 2, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002935 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002936 }
2937 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002938 }
2939 return;
2940 }
2941
2942 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(ShiftAmount)) {
2943 // The shift amount is constant, guaranteed to be a ubyte. Get its value.
2944 assert(CUI->getType() == Type::UByteTy && "Shift amount not a ubyte?");
2945 unsigned Amount = CUI->getValue();
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002946
Nate Begeman905a2912004-10-24 10:33:30 +00002947 // If this is a shift with one use, and that use is an And instruction,
2948 // then attempt to emit a bitfield operation.
Nate Begeman9b508c32004-10-26 03:48:25 +00002949 if (SI && emitBitfieldInsert(SI, DestReg))
2950 return;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00002951
Nate Begeman1b750222004-10-17 05:19:20 +00002952 unsigned SrcReg = getReg (Op, MBB, IP);
Chris Lattnere74ed0d2004-11-30 06:36:11 +00002953 if (Amount == 0) {
2954 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
2955 } else if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002956 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002957 .addImm(Amount).addImm(0).addImm(31-Amount);
Misha Brukman422791f2004-06-21 17:41:12 +00002958 } else {
Misha Brukman2fec9902004-06-21 20:22:03 +00002959 if (isSigned) {
Misha Brukman5b570812004-08-10 22:47:03 +00002960 BuildMI(*MBB, IP, PPC::SRAWI,2,DestReg).addReg(SrcReg).addImm(Amount);
Misha Brukman2fec9902004-06-21 20:22:03 +00002961 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002962 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002963 .addImm(32-Amount).addImm(Amount).addImm(31);
2964 }
Misha Brukman422791f2004-06-21 17:41:12 +00002965 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002966 } else { // The shift amount is non-constant.
Nate Begeman1b750222004-10-17 05:19:20 +00002967 unsigned SrcReg = getReg (Op, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002968 unsigned ShiftAmountReg = getReg (ShiftAmount, MBB, IP);
2969
Misha Brukman422791f2004-06-21 17:41:12 +00002970 if (isLeftShift) {
Misha Brukman5b570812004-08-10 22:47:03 +00002971 BuildMI(*MBB, IP, PPC::SLW, 2, DestReg).addReg(SrcReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002972 .addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002973 } else {
Misha Brukman5b570812004-08-10 22:47:03 +00002974 BuildMI(*MBB, IP, isSigned ? PPC::SRAW : PPC::SRW, 2, DestReg)
Misha Brukman2fec9902004-06-21 20:22:03 +00002975 .addReg(SrcReg).addReg(ShiftAmountReg);
Misha Brukman422791f2004-06-21 17:41:12 +00002976 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00002977 }
2978}
2979
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002980/// LoadNeedsSignExtend - On PowerPC, there is no load byte with sign extend.
2981/// Therefore, if this is a byte load and the destination type is signed, we
Nate Begeman35b020d2004-10-06 11:03:30 +00002982/// would normally need to also emit a sign extend instruction after the load.
Nate Begeman0e5e5f52004-08-22 08:10:15 +00002983/// However, store instructions don't care whether a signed type was sign
2984/// extended across a whole register. Also, a SetCC instruction will emit its
2985/// own sign extension to force the value into the appropriate range, so we
2986/// need not emit it here. Ideally, this kind of thing wouldn't be necessary
2987/// once LLVM's type system is improved.
2988static bool LoadNeedsSignExtend(LoadInst &LI) {
2989 if (cByte == getClassB(LI.getType()) && LI.getType()->isSigned()) {
2990 bool AllUsesAreStoresOrSetCC = true;
Nate Begeman35b020d2004-10-06 11:03:30 +00002991 for (Value::use_iterator I = LI.use_begin(), E = LI.use_end(); I != E; ++I){
Chris Lattner7c348e12004-10-06 16:28:24 +00002992 if (isa<SetCondInst>(*I))
Nate Begeman35b020d2004-10-06 11:03:30 +00002993 continue;
Chris Lattner7c348e12004-10-06 16:28:24 +00002994 if (StoreInst *SI = dyn_cast<StoreInst>(*I))
Nate Begemanb816f022004-10-07 22:30:03 +00002995 if (cByte == getClassB(SI->getOperand(0)->getType()))
Nate Begeman35b020d2004-10-06 11:03:30 +00002996 continue;
2997 AllUsesAreStoresOrSetCC = false;
2998 break;
2999 }
Nate Begeman0e5e5f52004-08-22 08:10:15 +00003000 if (!AllUsesAreStoresOrSetCC)
3001 return true;
3002 }
3003 return false;
3004}
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003005
Misha Brukmanb097f212004-07-26 18:13:24 +00003006/// visitLoadInst - Implement LLVM load instructions. Pretty straightforward
3007/// mapping of LLVM classes to PPC load instructions, with the exception of
3008/// signed byte loads, which need a sign extension following them.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003009///
Misha Brukmana1dca552004-09-21 18:22:19 +00003010void PPC32ISel::visitLoadInst(LoadInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003011 // Immediate opcodes, for reg+imm addressing
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003012 static const unsigned ImmOpcodes[] = {
3013 PPC::LBZ, PPC::LHZ, PPC::LWZ,
Misha Brukman5b570812004-08-10 22:47:03 +00003014 PPC::LFS, PPC::LFD, PPC::LWZ
Misha Brukmanb097f212004-07-26 18:13:24 +00003015 };
3016 // Indexed opcodes, for reg+reg addressing
3017 static const unsigned IdxOpcodes[] = {
Misha Brukman5b570812004-08-10 22:47:03 +00003018 PPC::LBZX, PPC::LHZX, PPC::LWZX,
3019 PPC::LFSX, PPC::LFDX, PPC::LWZX
Misha Brukman2fec9902004-06-21 20:22:03 +00003020 };
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003021
Misha Brukmanb097f212004-07-26 18:13:24 +00003022 unsigned Class = getClassB(I.getType());
3023 unsigned ImmOpcode = ImmOpcodes[Class];
3024 unsigned IdxOpcode = IdxOpcodes[Class];
3025 unsigned DestReg = getReg(I);
3026 Value *SourceAddr = I.getOperand(0);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003027
Misha Brukman5b570812004-08-10 22:47:03 +00003028 if (Class == cShort && I.getType()->isSigned()) ImmOpcode = PPC::LHA;
3029 if (Class == cShort && I.getType()->isSigned()) IdxOpcode = PPC::LHAX;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003030
Nate Begeman53e4aa52004-11-24 21:53:14 +00003031 // If this is a fixed size alloca, emit a load directly from the stack slot
3032 // corresponding to it.
Misha Brukmanb097f212004-07-26 18:13:24 +00003033 if (AllocaInst *AI = dyn_castFixedAlloca(SourceAddr)) {
Misha Brukman422791f2004-06-21 17:41:12 +00003034 unsigned FI = getFixedSizedAllocaFI(AI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003035 if (Class == cLong) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003036 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg), FI);
3037 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg+1), FI, 4);
Nate Begeman0e5e5f52004-08-22 08:10:15 +00003038 } else if (LoadNeedsSignExtend(I)) {
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003039 unsigned TmpReg = makeAnotherReg(I.getType());
Misha Brukmanb097f212004-07-26 18:13:24 +00003040 addFrameReference(BuildMI(BB, ImmOpcode, 2, TmpReg), FI);
Misha Brukman5b570812004-08-10 22:47:03 +00003041 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003042 } else {
Misha Brukmanb097f212004-07-26 18:13:24 +00003043 addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg), FI);
Misha Brukman422791f2004-06-21 17:41:12 +00003044 }
Misha Brukmanb097f212004-07-26 18:13:24 +00003045 return;
3046 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003047
Nate Begeman645495d2004-09-23 05:31:33 +00003048 // If the offset fits in 16 bits, we can emit a reg+imm load, otherwise, we
3049 // use the index from the FoldedGEP struct and use reg+reg addressing.
Misha Brukmanb097f212004-07-26 18:13:24 +00003050 if (GetElementPtrInst *GEPI = canFoldGEPIntoLoadOrStore(SourceAddr)) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003051
Nate Begeman645495d2004-09-23 05:31:33 +00003052 // Generate the code for the GEP and get the components of the folded GEP
3053 emitGEPOperation(BB, BB->end(), GEPI, true);
3054 unsigned baseReg = GEPMap[GEPI].base;
3055 unsigned indexReg = GEPMap[GEPI].index;
3056 ConstantSInt *offset = GEPMap[GEPI].offset;
3057
3058 if (Class != cLong) {
Nate Begemanbc3a5372004-11-19 08:01:16 +00003059 unsigned TmpReg = LoadNeedsSignExtend(I) ? makeAnotherReg(I.getType())
3060 : DestReg;
Nate Begeman645495d2004-09-23 05:31:33 +00003061 if (indexReg == 0)
Misha Brukmanb097f212004-07-26 18:13:24 +00003062 BuildMI(BB, ImmOpcode, 2, TmpReg).addSImm(offset->getValue())
3063 .addReg(baseReg);
Nate Begeman645495d2004-09-23 05:31:33 +00003064 else
3065 BuildMI(BB, IdxOpcode, 2, TmpReg).addReg(indexReg).addReg(baseReg);
3066 if (LoadNeedsSignExtend(I))
Misha Brukman5b570812004-08-10 22:47:03 +00003067 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Nate Begeman645495d2004-09-23 05:31:33 +00003068 } else {
3069 indexReg = (indexReg != 0) ? indexReg : getReg(offset);
Misha Brukmanb097f212004-07-26 18:13:24 +00003070 unsigned indexPlus4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003071 BuildMI(BB, PPC::ADDI, 2, indexPlus4).addReg(indexReg).addSImm(4);
Misha Brukmanb097f212004-07-26 18:13:24 +00003072 BuildMI(BB, IdxOpcode, 2, DestReg).addReg(indexReg).addReg(baseReg);
3073 BuildMI(BB, IdxOpcode, 2, DestReg+1).addReg(indexPlus4).addReg(baseReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003074 }
Misha Brukmanb097f212004-07-26 18:13:24 +00003075 return;
3076 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003077
Misha Brukmanb097f212004-07-26 18:13:24 +00003078 // The fallback case, where the load was from a source that could not be
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003079 // folded into the load instruction.
Misha Brukmanb097f212004-07-26 18:13:24 +00003080 unsigned SrcAddrReg = getReg(SourceAddr);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003081
Misha Brukmanb097f212004-07-26 18:13:24 +00003082 if (Class == cLong) {
3083 BuildMI(BB, ImmOpcode, 2, DestReg).addSImm(0).addReg(SrcAddrReg);
3084 BuildMI(BB, ImmOpcode, 2, DestReg+1).addSImm(4).addReg(SrcAddrReg);
Nate Begeman0e5e5f52004-08-22 08:10:15 +00003085 } else if (LoadNeedsSignExtend(I)) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003086 unsigned TmpReg = makeAnotherReg(I.getType());
3087 BuildMI(BB, ImmOpcode, 2, TmpReg).addSImm(0).addReg(SrcAddrReg);
Misha Brukman5b570812004-08-10 22:47:03 +00003088 BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003089 } else {
3090 BuildMI(BB, ImmOpcode, 2, DestReg).addSImm(0).addReg(SrcAddrReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003091 }
3092}
3093
3094/// visitStoreInst - Implement LLVM store instructions
3095///
Misha Brukmana1dca552004-09-21 18:22:19 +00003096void PPC32ISel::visitStoreInst(StoreInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003097 // Immediate opcodes, for reg+imm addressing
3098 static const unsigned ImmOpcodes[] = {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003099 PPC::STB, PPC::STH, PPC::STW,
Misha Brukman5b570812004-08-10 22:47:03 +00003100 PPC::STFS, PPC::STFD, PPC::STW
Misha Brukmanb097f212004-07-26 18:13:24 +00003101 };
3102 // Indexed opcodes, for reg+reg addressing
3103 static const unsigned IdxOpcodes[] = {
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003104 PPC::STBX, PPC::STHX, PPC::STWX,
Misha Brukman5b570812004-08-10 22:47:03 +00003105 PPC::STFSX, PPC::STFDX, PPC::STWX
Misha Brukmanb097f212004-07-26 18:13:24 +00003106 };
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003107
Misha Brukmanb097f212004-07-26 18:13:24 +00003108 Value *SourceAddr = I.getOperand(1);
3109 const Type *ValTy = I.getOperand(0)->getType();
3110 unsigned Class = getClassB(ValTy);
3111 unsigned ImmOpcode = ImmOpcodes[Class];
3112 unsigned IdxOpcode = IdxOpcodes[Class];
3113 unsigned ValReg = getReg(I.getOperand(0));
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003114
Nate Begeman53e4aa52004-11-24 21:53:14 +00003115 // If this is a fixed size alloca, emit a store directly to the stack slot
3116 // corresponding to it.
3117 if (AllocaInst *AI = dyn_castFixedAlloca(SourceAddr)) {
3118 unsigned FI = getFixedSizedAllocaFI(AI);
3119 addFrameReference(BuildMI(BB, ImmOpcode, 3).addReg(ValReg), FI);
3120 if (Class == cLong)
3121 addFrameReference(BuildMI(BB, ImmOpcode, 3).addReg(ValReg+1), FI, 4);
3122 return;
3123 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003124
Nate Begeman645495d2004-09-23 05:31:33 +00003125 // If the offset fits in 16 bits, we can emit a reg+imm store, otherwise, we
3126 // use the index from the FoldedGEP struct and use reg+reg addressing.
Misha Brukmanb097f212004-07-26 18:13:24 +00003127 if (GetElementPtrInst *GEPI = canFoldGEPIntoLoadOrStore(SourceAddr)) {
Nate Begeman645495d2004-09-23 05:31:33 +00003128 // Generate the code for the GEP and get the components of the folded GEP
3129 emitGEPOperation(BB, BB->end(), GEPI, true);
3130 unsigned baseReg = GEPMap[GEPI].base;
3131 unsigned indexReg = GEPMap[GEPI].index;
3132 ConstantSInt *offset = GEPMap[GEPI].offset;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003133
Nate Begeman645495d2004-09-23 05:31:33 +00003134 if (Class != cLong) {
3135 if (indexReg == 0)
3136 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(offset->getValue())
3137 .addReg(baseReg);
3138 else
3139 BuildMI(BB, IdxOpcode, 3).addReg(ValReg).addReg(indexReg)
3140 .addReg(baseReg);
3141 } else {
3142 indexReg = (indexReg != 0) ? indexReg : getReg(offset);
Misha Brukmanb097f212004-07-26 18:13:24 +00003143 unsigned indexPlus4 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003144 BuildMI(BB, PPC::ADDI, 2, indexPlus4).addReg(indexReg).addSImm(4);
Misha Brukmanb097f212004-07-26 18:13:24 +00003145 BuildMI(BB, IdxOpcode, 3).addReg(ValReg).addReg(indexReg).addReg(baseReg);
3146 BuildMI(BB, IdxOpcode, 3).addReg(ValReg+1).addReg(indexPlus4)
3147 .addReg(baseReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003148 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003149 return;
3150 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003151
Misha Brukmanb097f212004-07-26 18:13:24 +00003152 // If the store address wasn't the only use of a GEP, we fall back to the
3153 // standard path: store the ValReg at the value in AddressReg.
3154 unsigned AddressReg = getReg(I.getOperand(1));
3155 if (Class == cLong) {
3156 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(0).addReg(AddressReg);
3157 BuildMI(BB, ImmOpcode, 3).addReg(ValReg+1).addSImm(4).addReg(AddressReg);
3158 return;
3159 }
3160 BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(0).addReg(AddressReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003161}
3162
3163
3164/// visitCastInst - Here we have various kinds of copying with or without sign
3165/// extension going on.
3166///
Misha Brukmana1dca552004-09-21 18:22:19 +00003167void PPC32ISel::visitCastInst(CastInst &CI) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003168 Value *Op = CI.getOperand(0);
3169
3170 unsigned SrcClass = getClassB(Op->getType());
3171 unsigned DestClass = getClassB(CI.getType());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003172
Nate Begeman676dee62004-11-08 02:25:40 +00003173 // Noop casts are not emitted: getReg will return the source operand as the
3174 // register to use for any uses of the noop cast.
3175 if (DestClass == SrcClass) return;
3176
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003177 // 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 +00003178 // of the cast are GEP instructions, then the cast does not need to be
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003179 // generated explicitly, it will be folded into the GEP.
3180 if (DestClass == cLong && SrcClass == cInt) {
3181 bool AllUsesAreGEPs = true;
3182 for (Value::use_iterator I = CI.use_begin(), E = CI.use_end(); I != E; ++I)
3183 if (!isa<GetElementPtrInst>(*I)) {
3184 AllUsesAreGEPs = false;
3185 break;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003186 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003187 if (AllUsesAreGEPs) return;
3188 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003189
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003190 unsigned DestReg = getReg(CI);
3191 MachineBasicBlock::iterator MI = BB->end();
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003192
Nate Begeman31dfc522004-10-23 00:50:23 +00003193 // If this is a cast from an integer type to a ubyte, with one use where the
3194 // use is the shift amount argument of a shift instruction, just emit a move
3195 // instead (since the shift instruction will only look at the low 5 bits
3196 // regardless of how it is sign extended)
3197 if (CI.getType() == Type::UByteTy && SrcClass <= cInt && CI.hasOneUse()) {
3198 ShiftInst *SI = dyn_cast<ShiftInst>(*(CI.use_begin()));
3199 if (SI && (SI->getOperand(1) == &CI)) {
3200 unsigned SrcReg = getReg(Op, BB, MI);
3201 BuildMI(*BB, MI, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003202 return;
Nate Begeman31dfc522004-10-23 00:50:23 +00003203 }
3204 }
3205
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003206 // If this is a cast from an byte, short, or int to an integer type of equal
3207 // or lesser width, and all uses of the cast are store instructions then dont
3208 // emit them, as the store instruction will implicitly not store the zero or
3209 // sign extended bytes.
3210 if (SrcClass <= cInt && SrcClass >= DestClass) {
Nate Begeman075cdc62004-11-07 20:23:42 +00003211 bool AllUsesAreStores = true;
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003212 for (Value::use_iterator I = CI.use_begin(), E = CI.use_end(); I != E; ++I)
Nate Begeman075cdc62004-11-07 20:23:42 +00003213 if (!isa<StoreInst>(*I)) {
3214 AllUsesAreStores = false;
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003215 break;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003216 }
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003217 // Turn this cast directly into a move instruction, which the register
3218 // allocator will deal with.
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003219 if (AllUsesAreStores) {
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003220 unsigned SrcReg = getReg(Op, BB, MI);
3221 BuildMI(*BB, MI, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003222 return;
Nate Begeman1e67d4d2004-08-19 08:07:50 +00003223 }
3224 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003225 emitCastOperation(BB, MI, Op, CI.getType(), DestReg);
3226}
3227
3228/// emitCastOperation - Common code shared between visitCastInst and constant
3229/// expression cast support.
3230///
Misha Brukmana1dca552004-09-21 18:22:19 +00003231void PPC32ISel::emitCastOperation(MachineBasicBlock *MBB,
3232 MachineBasicBlock::iterator IP,
3233 Value *Src, const Type *DestTy,
3234 unsigned DestReg) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003235 const Type *SrcTy = Src->getType();
3236 unsigned SrcClass = getClassB(SrcTy);
3237 unsigned DestClass = getClassB(DestTy);
Misha Brukman7e898c32004-07-20 00:41:46 +00003238 unsigned SrcReg = getReg(Src, MBB, IP);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003239
Nate Begeman0797d492004-10-20 21:55:41 +00003240 // Implement casts from bool to integer types as a move operation
3241 if (SrcTy == Type::BoolTy) {
3242 switch (DestClass) {
3243 case cByte:
3244 case cShort:
3245 case cInt:
3246 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
3247 return;
3248 case cLong:
3249 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addImm(0);
3250 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg).addReg(SrcReg);
3251 return;
3252 default:
3253 break;
3254 }
3255 }
3256
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003257 // Implement casts to bool by using compare on the operand followed by set if
3258 // not zero on the result.
3259 if (DestTy == Type::BoolTy) {
3260 switch (SrcClass) {
3261 case cByte:
Misha Brukman422791f2004-06-21 17:41:12 +00003262 case cShort:
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003263 case cInt: {
3264 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003265 BuildMI(*MBB, IP, PPC::ADDIC, 2, TmpReg).addReg(SrcReg).addSImm(-1);
3266 BuildMI(*MBB, IP, PPC::SUBFE, 2, DestReg).addReg(TmpReg).addReg(SrcReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003267 break;
3268 }
3269 case cLong: {
3270 unsigned TmpReg = makeAnotherReg(Type::IntTy);
3271 unsigned SrcReg2 = makeAnotherReg(Type::IntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003272 BuildMI(*MBB, IP, PPC::OR, 2, SrcReg2).addReg(SrcReg).addReg(SrcReg+1);
3273 BuildMI(*MBB, IP, PPC::ADDIC, 2, TmpReg).addReg(SrcReg2).addSImm(-1);
3274 BuildMI(*MBB, IP, PPC::SUBFE, 2, DestReg).addReg(TmpReg)
Misha Brukmanbf417a62004-07-20 20:43:05 +00003275 .addReg(SrcReg2);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003276 break;
3277 }
Misha Brukman7e898c32004-07-20 00:41:46 +00003278 case cFP32:
3279 case cFP64:
Nate Begemanf2f07812004-08-29 08:19:32 +00003280 unsigned TmpReg = makeAnotherReg(Type::IntTy);
3281 unsigned ConstZero = getReg(ConstantFP::get(Type::DoubleTy, 0.0), BB, IP);
3282 BuildMI(*MBB, IP, PPC::FCMPU, PPC::CR7).addReg(SrcReg).addReg(ConstZero);
3283 BuildMI(*MBB, IP, PPC::MFCR, TmpReg);
3284 BuildMI(*MBB, IP, PPC::RLWINM, DestReg).addReg(TmpReg).addImm(31)
3285 .addImm(31).addImm(31);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003286 }
3287 return;
3288 }
3289
Misha Brukman7e898c32004-07-20 00:41:46 +00003290 // Handle cast of Float -> Double
3291 if (SrcClass == cFP32 && DestClass == cFP64) {
Misha Brukman5b570812004-08-10 22:47:03 +00003292 BuildMI(*MBB, IP, PPC::FMR, 1, DestReg).addReg(SrcReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00003293 return;
3294 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003295
Misha Brukman7e898c32004-07-20 00:41:46 +00003296 // Handle cast of Double -> Float
3297 if (SrcClass == cFP64 && DestClass == cFP32) {
Misha Brukman5b570812004-08-10 22:47:03 +00003298 BuildMI(*MBB, IP, PPC::FRSP, 1, DestReg).addReg(SrcReg);
Misha Brukman7e898c32004-07-20 00:41:46 +00003299 return;
3300 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003301
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003302 // Handle casts from integer to floating point now...
Misha Brukman7e898c32004-07-20 00:41:46 +00003303 if (DestClass == cFP32 || DestClass == cFP64) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003304
Misha Brukman422791f2004-06-21 17:41:12 +00003305 // Emit a library call for long to float conversion
3306 if (SrcClass == cLong) {
Misha Brukman7e898c32004-07-20 00:41:46 +00003307 Function *floatFn = (DestClass == cFP32) ? __floatdisfFn : __floatdidfFn;
Nate Begemanf2f07812004-08-29 08:19:32 +00003308 if (SrcTy->isSigned()) {
3309 std::vector<ValueRecord> Args;
3310 Args.push_back(ValueRecord(SrcReg, SrcTy));
3311 MachineInstr *TheCall =
3312 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3313 doCall(ValueRecord(DestReg, DestTy), TheCall, Args, false);
Nate Begemanf2f07812004-08-29 08:19:32 +00003314 } else {
3315 std::vector<ValueRecord> CmpArgs, ClrArgs, SetArgs;
3316 unsigned ZeroLong = getReg(ConstantUInt::get(SrcTy, 0));
3317 unsigned CondReg = makeAnotherReg(Type::IntTy);
3318
3319 // Update machine-CFG edges
3320 MachineBasicBlock *ClrMBB = new MachineBasicBlock(BB->getBasicBlock());
3321 MachineBasicBlock *SetMBB = new MachineBasicBlock(BB->getBasicBlock());
3322 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
3323 MachineBasicBlock *OldMBB = BB;
3324 ilist<MachineBasicBlock>::iterator It = BB; ++It;
3325 F->getBasicBlockList().insert(It, ClrMBB);
3326 F->getBasicBlockList().insert(It, SetMBB);
3327 F->getBasicBlockList().insert(It, PhiMBB);
3328 BB->addSuccessor(ClrMBB);
3329 BB->addSuccessor(SetMBB);
3330
3331 CmpArgs.push_back(ValueRecord(SrcReg, SrcTy));
3332 CmpArgs.push_back(ValueRecord(ZeroLong, SrcTy));
3333 MachineInstr *TheCall =
3334 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(__cmpdi2Fn, true);
3335 doCall(ValueRecord(CondReg, Type::IntTy), TheCall, CmpArgs, false);
Nate Begemanf2f07812004-08-29 08:19:32 +00003336 BuildMI(*MBB, IP, PPC::CMPWI, 2, PPC::CR0).addReg(CondReg).addSImm(0);
3337 BuildMI(*MBB, IP, PPC::BLE, 2).addReg(PPC::CR0).addMBB(SetMBB);
3338
3339 // ClrMBB
3340 BB = ClrMBB;
3341 unsigned ClrReg = makeAnotherReg(DestTy);
3342 ClrArgs.push_back(ValueRecord(SrcReg, SrcTy));
3343 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3344 doCall(ValueRecord(ClrReg, DestTy), TheCall, ClrArgs, false);
Nate Begemanf2f07812004-08-29 08:19:32 +00003345 BuildMI(BB, PPC::B, 1).addMBB(PhiMBB);
3346 BB->addSuccessor(PhiMBB);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003347
Nate Begemanf2f07812004-08-29 08:19:32 +00003348 // SetMBB
3349 BB = SetMBB;
3350 unsigned SetReg = makeAnotherReg(DestTy);
3351 unsigned CallReg = makeAnotherReg(DestTy);
3352 unsigned ShiftedReg = makeAnotherReg(SrcTy);
3353 ConstantSInt *Const1 = ConstantSInt::get(Type::IntTy, 1);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003354 emitShiftOperation(BB, BB->end(), Src, Const1, false, SrcTy, 0,
Nate Begeman9b508c32004-10-26 03:48:25 +00003355 ShiftedReg);
Nate Begemanf2f07812004-08-29 08:19:32 +00003356 SetArgs.push_back(ValueRecord(ShiftedReg, SrcTy));
3357 TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
3358 doCall(ValueRecord(CallReg, DestTy), TheCall, SetArgs, false);
Nate Begemanf2f07812004-08-29 08:19:32 +00003359 unsigned SetOpcode = (DestClass == cFP32) ? PPC::FADDS : PPC::FADD;
3360 BuildMI(BB, SetOpcode, 2, SetReg).addReg(CallReg).addReg(CallReg);
3361 BB->addSuccessor(PhiMBB);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003362
Nate Begemanf2f07812004-08-29 08:19:32 +00003363 // PhiMBB
3364 BB = PhiMBB;
3365 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(ClrReg).addMBB(ClrMBB)
3366 .addReg(SetReg).addMBB(SetMBB);
3367 }
Misha Brukman422791f2004-06-21 17:41:12 +00003368 return;
3369 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003370
Misha Brukman7e898c32004-07-20 00:41:46 +00003371 // Make sure we're dealing with a full 32 bits
Nate Begeman8531f6f2004-11-19 02:06:40 +00003372 if (SrcClass < cInt) {
3373 unsigned TmpReg = makeAnotherReg(Type::IntTy);
3374 promote32(TmpReg, ValueRecord(SrcReg, SrcTy));
3375 SrcReg = TmpReg;
3376 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003377
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003378 // Spill the integer to memory and reload it from there.
Misha Brukman422791f2004-06-21 17:41:12 +00003379 // Also spill room for a special conversion constant
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003380 int ValueFrameIdx =
3381 F->getFrameInfo()->CreateStackObject(Type::DoubleTy, TM.getTargetData());
3382
Misha Brukman422791f2004-06-21 17:41:12 +00003383 unsigned constantHi = makeAnotherReg(Type::IntTy);
Misha Brukman422791f2004-06-21 17:41:12 +00003384 unsigned TempF = makeAnotherReg(Type::DoubleTy);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003385
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003386 if (!SrcTy->isSigned()) {
Nate Begeman81d265d2004-08-19 05:20:54 +00003387 ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, 0x1.000000p52);
3388 unsigned ConstF = getReg(CFP, BB, IP);
Nate Begemanf2f07812004-08-29 08:19:32 +00003389 BuildMI(*MBB, IP, PPC::LIS, 1, constantHi).addSImm(0x4330);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003390 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(constantHi),
Misha Brukman2fec9902004-06-21 20:22:03 +00003391 ValueFrameIdx);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003392 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(SrcReg),
Misha Brukman2fec9902004-06-21 20:22:03 +00003393 ValueFrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003394 addFrameReference(BuildMI(*MBB, IP, PPC::LFD, 2, TempF), ValueFrameIdx);
3395 BuildMI(*MBB, IP, PPC::FSUB, 2, DestReg).addReg(TempF).addReg(ConstF);
Misha Brukman422791f2004-06-21 17:41:12 +00003396 } else {
Nate Begeman81d265d2004-08-19 05:20:54 +00003397 ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, 0x1.000008p52);
3398 unsigned ConstF = getReg(CFP, BB, IP);
Misha Brukman422791f2004-06-21 17:41:12 +00003399 unsigned TempLo = makeAnotherReg(Type::IntTy);
Nate Begemanf2f07812004-08-29 08:19:32 +00003400 BuildMI(*MBB, IP, PPC::LIS, 1, constantHi).addSImm(0x4330);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003401 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(constantHi),
Misha Brukman2fec9902004-06-21 20:22:03 +00003402 ValueFrameIdx);
Nate Begemanf2f07812004-08-29 08:19:32 +00003403 BuildMI(*MBB, IP, PPC::XORIS, 2, TempLo).addReg(SrcReg).addImm(0x8000);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003404 addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(TempLo),
Misha Brukman2fec9902004-06-21 20:22:03 +00003405 ValueFrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003406 addFrameReference(BuildMI(*MBB, IP, PPC::LFD, 2, TempF), ValueFrameIdx);
3407 BuildMI(*MBB, IP, PPC::FSUB, 2, DestReg).addReg(TempF).addReg(ConstF);
Misha Brukman422791f2004-06-21 17:41:12 +00003408 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003409 return;
3410 }
3411
3412 // Handle casts from floating point to integer now...
Misha Brukman7e898c32004-07-20 00:41:46 +00003413 if (SrcClass == cFP32 || SrcClass == cFP64) {
Nate Begemanb64af912004-08-10 20:42:36 +00003414 static Function* const Funcs[] =
3415 { __fixsfdiFn, __fixdfdiFn, __fixunssfdiFn, __fixunsdfdiFn };
Misha Brukman422791f2004-06-21 17:41:12 +00003416 // emit library call
3417 if (DestClass == cLong) {
Nate Begemanb64af912004-08-10 20:42:36 +00003418 bool isDouble = SrcClass == cFP64;
3419 unsigned nameIndex = 2 * DestTy->isSigned() + isDouble;
Misha Brukman422791f2004-06-21 17:41:12 +00003420 std::vector<ValueRecord> Args;
3421 Args.push_back(ValueRecord(SrcReg, SrcTy));
Nate Begemanb64af912004-08-10 20:42:36 +00003422 Function *floatFn = Funcs[nameIndex];
Misha Brukman2fec9902004-06-21 20:22:03 +00003423 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003424 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003425 doCall(ValueRecord(DestReg, DestTy), TheCall, Args, false);
Misha Brukman422791f2004-06-21 17:41:12 +00003426 return;
3427 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003428
3429 int ValueFrameIdx =
Nate Begeman43d64ea2004-08-15 06:42:28 +00003430 F->getFrameInfo()->CreateStackObject(Type::DoubleTy, TM.getTargetData());
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003431
Misha Brukman7e898c32004-07-20 00:41:46 +00003432 if (DestTy->isSigned()) {
Misha Brukman4c14f332004-07-23 01:11:19 +00003433 unsigned TempReg = makeAnotherReg(Type::DoubleTy);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003434
Misha Brukman4c14f332004-07-23 01:11:19 +00003435 // Convert to integer in the FP reg and store it to a stack slot
Nate Begemanf2f07812004-08-29 08:19:32 +00003436 BuildMI(*MBB, IP, PPC::FCTIWZ, 1, TempReg).addReg(SrcReg);
3437 addFrameReference(BuildMI(*MBB, IP, PPC::STFD, 3)
Misha Brukman4c14f332004-07-23 01:11:19 +00003438 .addReg(TempReg), ValueFrameIdx);
Misha Brukmanb097f212004-07-26 18:13:24 +00003439
3440 // There is no load signed byte opcode, so we must emit a sign extend for
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003441 // that particular size. Make sure to source the new integer from the
Misha Brukmanb097f212004-07-26 18:13:24 +00003442 // correct offset.
Misha Brukman4c14f332004-07-23 01:11:19 +00003443 if (DestClass == cByte) {
3444 unsigned TempReg2 = makeAnotherReg(DestTy);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003445 addFrameReference(BuildMI(*MBB, IP, PPC::LBZ, 2, TempReg2),
Misha Brukmanb097f212004-07-26 18:13:24 +00003446 ValueFrameIdx, 7);
Nate Begemanf2f07812004-08-29 08:19:32 +00003447 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(TempReg2);
Misha Brukman4c14f332004-07-23 01:11:19 +00003448 } else {
Misha Brukmanb097f212004-07-26 18:13:24 +00003449 int offset = (DestClass == cShort) ? 6 : 4;
Misha Brukman5b570812004-08-10 22:47:03 +00003450 unsigned LoadOp = (DestClass == cShort) ? PPC::LHA : PPC::LWZ;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003451 addFrameReference(BuildMI(*MBB, IP, LoadOp, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003452 ValueFrameIdx, offset);
Misha Brukman4c14f332004-07-23 01:11:19 +00003453 }
Misha Brukman7e898c32004-07-20 00:41:46 +00003454 } else {
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003455 unsigned Zero = getReg(ConstantFP::get(Type::DoubleTy, 0.0f));
3456 double maxInt = (1LL << 32) - 1;
3457 unsigned MaxInt = getReg(ConstantFP::get(Type::DoubleTy, maxInt));
3458 double border = 1LL << 31;
3459 unsigned Border = getReg(ConstantFP::get(Type::DoubleTy, border));
3460 unsigned UseZero = makeAnotherReg(Type::DoubleTy);
3461 unsigned UseMaxInt = makeAnotherReg(Type::DoubleTy);
3462 unsigned UseChoice = makeAnotherReg(Type::DoubleTy);
3463 unsigned TmpReg = makeAnotherReg(Type::DoubleTy);
3464 unsigned TmpReg2 = makeAnotherReg(Type::DoubleTy);
3465 unsigned ConvReg = makeAnotherReg(Type::DoubleTy);
3466 unsigned IntTmp = makeAnotherReg(Type::IntTy);
3467 unsigned XorReg = makeAnotherReg(Type::IntTy);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003468 int FrameIdx =
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003469 F->getFrameInfo()->CreateStackObject(SrcTy, TM.getTargetData());
3470 // Update machine-CFG edges
3471 MachineBasicBlock *XorMBB = new MachineBasicBlock(BB->getBasicBlock());
3472 MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock());
3473 MachineBasicBlock *OldMBB = BB;
3474 ilist<MachineBasicBlock>::iterator It = BB; ++It;
3475 F->getBasicBlockList().insert(It, XorMBB);
3476 F->getBasicBlockList().insert(It, PhiMBB);
3477 BB->addSuccessor(XorMBB);
3478 BB->addSuccessor(PhiMBB);
3479
3480 // Convert from floating point to unsigned 32-bit value
3481 // Use 0 if incoming value is < 0.0
Nate Begemanf2f07812004-08-29 08:19:32 +00003482 BuildMI(*MBB, IP, PPC::FSEL, 3, UseZero).addReg(SrcReg).addReg(SrcReg)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003483 .addReg(Zero);
3484 // Use 2**32 - 1 if incoming value is >= 2**32
Nate Begemanf2f07812004-08-29 08:19:32 +00003485 BuildMI(*MBB, IP, PPC::FSUB, 2, UseMaxInt).addReg(MaxInt).addReg(SrcReg);
3486 BuildMI(*MBB, IP, PPC::FSEL, 3, UseChoice).addReg(UseMaxInt)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003487 .addReg(UseZero).addReg(MaxInt);
3488 // Subtract 2**31
Nate Begemanf2f07812004-08-29 08:19:32 +00003489 BuildMI(*MBB, IP, PPC::FSUB, 2, TmpReg).addReg(UseChoice).addReg(Border);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003490 // Use difference if >= 2**31
Nate Begemanf2f07812004-08-29 08:19:32 +00003491 BuildMI(*MBB, IP, PPC::FCMPU, 2, PPC::CR0).addReg(UseChoice)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003492 .addReg(Border);
Nate Begemanf2f07812004-08-29 08:19:32 +00003493 BuildMI(*MBB, IP, PPC::FSEL, 3, TmpReg2).addReg(TmpReg).addReg(TmpReg)
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003494 .addReg(UseChoice);
3495 // Convert to integer
Nate Begemanf2f07812004-08-29 08:19:32 +00003496 BuildMI(*MBB, IP, PPC::FCTIWZ, 1, ConvReg).addReg(TmpReg2);
3497 addFrameReference(BuildMI(*MBB, IP, PPC::STFD, 3).addReg(ConvReg),
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003498 FrameIdx);
Misha Brukmanb097f212004-07-26 18:13:24 +00003499 if (DestClass == cByte) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003500 addFrameReference(BuildMI(*MBB, IP, PPC::LBZ, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003501 FrameIdx, 7);
3502 } else if (DestClass == cShort) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003503 addFrameReference(BuildMI(*MBB, IP, PPC::LHZ, 2, DestReg),
Misha Brukmanb097f212004-07-26 18:13:24 +00003504 FrameIdx, 6);
3505 } if (DestClass == cInt) {
Nate Begemanf2f07812004-08-29 08:19:32 +00003506 addFrameReference(BuildMI(*MBB, IP, PPC::LWZ, 2, IntTmp),
Misha Brukmanb097f212004-07-26 18:13:24 +00003507 FrameIdx, 4);
Nate Begemanf2f07812004-08-29 08:19:32 +00003508 BuildMI(*MBB, IP, PPC::BLT, 2).addReg(PPC::CR0).addMBB(PhiMBB);
3509 BuildMI(*MBB, IP, PPC::B, 1).addMBB(XorMBB);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003510
Misha Brukmanb097f212004-07-26 18:13:24 +00003511 // XorMBB:
3512 // add 2**31 if input was >= 2**31
3513 BB = XorMBB;
Misha Brukman5b570812004-08-10 22:47:03 +00003514 BuildMI(BB, PPC::XORIS, 2, XorReg).addReg(IntTmp).addImm(0x8000);
Misha Brukmanb097f212004-07-26 18:13:24 +00003515 XorMBB->addSuccessor(PhiMBB);
Misha Brukmanb160d1f2004-07-23 20:32:59 +00003516
Misha Brukmanb097f212004-07-26 18:13:24 +00003517 // PhiMBB:
3518 // DestReg = phi [ IntTmp, OldMBB ], [ XorReg, XorMBB ]
3519 BB = PhiMBB;
Misha Brukmand2cbb872004-08-19 21:00:12 +00003520 BuildMI(BB, PPC::PHI, 4, DestReg).addReg(IntTmp).addMBB(OldMBB)
Misha Brukmanb097f212004-07-26 18:13:24 +00003521 .addReg(XorReg).addMBB(XorMBB);
3522 }
3523 }
3524 return;
3525 }
3526
3527 // Check our invariants
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003528 assert((SrcClass <= cInt || SrcClass == cLong) &&
Misha Brukmanb097f212004-07-26 18:13:24 +00003529 "Unhandled source class for cast operation!");
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003530 assert((DestClass <= cInt || DestClass == cLong) &&
Misha Brukmanb097f212004-07-26 18:13:24 +00003531 "Unhandled destination class for cast operation!");
3532
3533 bool sourceUnsigned = SrcTy->isUnsigned() || SrcTy == Type::BoolTy;
3534 bool destUnsigned = DestTy->isUnsigned();
3535
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003536 // Unsigned -> Unsigned, clear if larger,
Misha Brukmanb097f212004-07-26 18:13:24 +00003537 if (sourceUnsigned && destUnsigned) {
3538 // handle long dest class now to keep switch clean
3539 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003540 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
3541 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3542 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003543 return;
3544 }
3545
3546 // handle u{ byte, short, int } x u{ byte, short, int }
3547 unsigned clearBits = (SrcClass == cByte || DestClass == cByte) ? 24 : 16;
3548 switch (SrcClass) {
3549 case cByte:
3550 case cShort:
Nate Begeman8531f6f2004-11-19 02:06:40 +00003551 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
3552 .addImm(0).addImm(clearBits).addImm(31);
Misha Brukmanb097f212004-07-26 18:13:24 +00003553 break;
3554 case cLong:
3555 ++SrcReg;
3556 // Fall through
3557 case cInt:
Nate Begeman8531f6f2004-11-19 02:06:40 +00003558 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
3559 .addImm(0).addImm(clearBits).addImm(31);
Misha Brukmanb097f212004-07-26 18:13:24 +00003560 break;
3561 }
3562 return;
3563 }
3564
3565 // Signed -> Signed
3566 if (!sourceUnsigned && !destUnsigned) {
3567 // handle long dest class now to keep switch clean
3568 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003569 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg).addImm(31);
3570 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3571 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003572 return;
3573 }
3574
3575 // handle { byte, short, int } x { byte, short, int }
3576 switch (SrcClass) {
3577 case cByte:
Nate Begeman01136382004-11-18 04:56:53 +00003578 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003579 break;
3580 case cShort:
3581 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003582 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003583 else
Misha Brukman5b570812004-08-10 22:47:03 +00003584 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003585 break;
3586 case cLong:
3587 ++SrcReg;
3588 // Fall through
3589 case cInt:
3590 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003591 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003592 else if (DestClass == cShort)
Misha Brukman5b570812004-08-10 22:47:03 +00003593 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003594 else
Misha Brukman5b570812004-08-10 22:47:03 +00003595 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003596 break;
3597 }
3598 return;
3599 }
3600
3601 // Unsigned -> Signed
3602 if (sourceUnsigned && !destUnsigned) {
3603 // handle long dest class now to keep switch clean
3604 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003605 BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0);
3606 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3607 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003608 return;
3609 }
3610
3611 // handle u{ byte, short, int } -> { byte, short, int }
3612 switch (SrcClass) {
3613 case cByte:
Nate Begeman01136382004-11-18 04:56:53 +00003614 // uByte 255 -> signed short/int == 255
3615 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(0)
3616 .addImm(24).addImm(31);
Misha Brukmanb097f212004-07-26 18:13:24 +00003617 break;
3618 case cShort:
3619 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003620 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003621 else
Misha Brukman5b570812004-08-10 22:47:03 +00003622 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(0)
Misha Brukmanb097f212004-07-26 18:13:24 +00003623 .addImm(16).addImm(31);
3624 break;
3625 case cLong:
3626 ++SrcReg;
3627 // Fall through
3628 case cInt:
3629 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003630 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003631 else if (DestClass == cShort)
Misha Brukman5b570812004-08-10 22:47:03 +00003632 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003633 else
Misha Brukman5b570812004-08-10 22:47:03 +00003634 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003635 break;
3636 }
3637 return;
3638 }
3639
3640 // Signed -> Unsigned
3641 if (!sourceUnsigned && destUnsigned) {
3642 // handle long dest class now to keep switch clean
3643 if (DestClass == cLong) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003644 BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg).addImm(31);
3645 BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg)
3646 .addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003647 return;
3648 }
3649
3650 // handle { byte, short, int } -> u{ byte, short, int }
3651 unsigned clearBits = (DestClass == cByte) ? 24 : 16;
3652 switch (SrcClass) {
3653 case cByte:
Nate Begeman01136382004-11-18 04:56:53 +00003654 BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg);
3655 break;
Misha Brukmanb097f212004-07-26 18:13:24 +00003656 case cShort:
Nate Begeman01136382004-11-18 04:56:53 +00003657 if (DestClass == cByte)
Misha Brukman5b570812004-08-10 22:47:03 +00003658 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003659 .addImm(0).addImm(clearBits).addImm(31);
3660 else
Nate Begeman01136382004-11-18 04:56:53 +00003661 BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003662 break;
3663 case cLong:
3664 ++SrcReg;
3665 // Fall through
3666 case cInt:
3667 if (DestClass == cInt)
Misha Brukman5b570812004-08-10 22:47:03 +00003668 BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg);
Misha Brukmanb097f212004-07-26 18:13:24 +00003669 else
Misha Brukman5b570812004-08-10 22:47:03 +00003670 BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg)
Misha Brukmanb097f212004-07-26 18:13:24 +00003671 .addImm(0).addImm(clearBits).addImm(31);
3672 break;
Misha Brukman7e898c32004-07-20 00:41:46 +00003673 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003674 return;
3675 }
3676
3677 // Anything we haven't handled already, we can't (yet) handle at all.
Misha Brukmanb097f212004-07-26 18:13:24 +00003678 std::cerr << "Unhandled cast from " << SrcTy->getDescription()
3679 << "to " << DestTy->getDescription() << '\n';
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003680 abort();
3681}
3682
Misha Brukmana1dca552004-09-21 18:22:19 +00003683void PPC32ISel::visitVAArgInst(VAArgInst &I) {
Andrew Lenharth558bc882005-06-18 18:34:52 +00003684 unsigned VAListPtr = getReg(I.getOperand(0));
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003685 unsigned DestReg = getReg(I);
Andrew Lenharth558bc882005-06-18 18:34:52 +00003686 unsigned VAList = makeAnotherReg(Type::IntTy);
3687 BuildMI(BB, PPC::LWZ, 2, VAList).addSImm(0).addReg(VAListPtr);
3688 int Size;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003689
Misha Brukman358829f2004-06-21 17:25:55 +00003690 switch (I.getType()->getTypeID()) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003691 default:
3692 std::cerr << I;
3693 assert(0 && "Error: bad type for va_next instruction!");
3694 return;
3695 case Type::PointerTyID:
3696 case Type::UIntTyID:
3697 case Type::IntTyID:
Andrew Lenharth558bc882005-06-18 18:34:52 +00003698 Size = 4;
Misha Brukman5b570812004-08-10 22:47:03 +00003699 BuildMI(BB, PPC::LWZ, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003700 break;
3701 case Type::ULongTyID:
3702 case Type::LongTyID:
Andrew Lenharth558bc882005-06-18 18:34:52 +00003703 Size = 8;
Misha Brukman5b570812004-08-10 22:47:03 +00003704 BuildMI(BB, PPC::LWZ, 2, DestReg).addSImm(0).addReg(VAList);
3705 BuildMI(BB, PPC::LWZ, 2, DestReg+1).addSImm(4).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003706 break;
Misha Brukmanb097f212004-07-26 18:13:24 +00003707 case Type::FloatTyID:
Andrew Lenharth558bc882005-06-18 18:34:52 +00003708 Size = 4; //?? Bad value?
Misha Brukman5b570812004-08-10 22:47:03 +00003709 BuildMI(BB, PPC::LFS, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukmanb097f212004-07-26 18:13:24 +00003710 break;
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003711 case Type::DoubleTyID:
Andrew Lenharth558bc882005-06-18 18:34:52 +00003712 Size = 8;
Misha Brukman5b570812004-08-10 22:47:03 +00003713 BuildMI(BB, PPC::LFD, 2, DestReg).addSImm(0).addReg(VAList);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003714 break;
3715 }
Andrew Lenharth558bc882005-06-18 18:34:52 +00003716 // Increment the VAList pointer...
3717 unsigned NP = makeAnotherReg(Type::IntTy);
3718 BuildMI(BB, PPC::ADDI, 2, NP).addReg(VAList).addSImm(Size);
3719 BuildMI(BB, PPC::STW, 3).addReg(NP).addSImm(0).addReg(VAListPtr);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003720}
3721
3722/// visitGetElementPtrInst - instruction-select GEP instructions
3723///
Misha Brukmana1dca552004-09-21 18:22:19 +00003724void PPC32ISel::visitGetElementPtrInst(GetElementPtrInst &I) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003725 if (canFoldGEPIntoLoadOrStore(&I))
3726 return;
3727
Nate Begeman645495d2004-09-23 05:31:33 +00003728 emitGEPOperation(BB, BB->end(), &I, false);
3729}
3730
Misha Brukman1013ef52004-07-21 20:09:08 +00003731/// emitGEPOperation - Common code shared between visitGetElementPtrInst and
3732/// constant expression GEP support.
3733///
Misha Brukmana1dca552004-09-21 18:22:19 +00003734void PPC32ISel::emitGEPOperation(MachineBasicBlock *MBB,
3735 MachineBasicBlock::iterator IP,
Nate Begeman645495d2004-09-23 05:31:33 +00003736 GetElementPtrInst *GEPI, bool GEPIsFolded) {
3737 // If we've already emitted this particular GEP, just return to avoid
3738 // multiple definitions of the base register.
Nate Begemana41fc772004-09-29 02:35:05 +00003739 if (GEPIsFolded && (GEPMap[GEPI].base != 0))
Nate Begeman645495d2004-09-23 05:31:33 +00003740 return;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003741
Nate Begeman645495d2004-09-23 05:31:33 +00003742 Value *Src = GEPI->getOperand(0);
3743 User::op_iterator IdxBegin = GEPI->op_begin()+1;
3744 User::op_iterator IdxEnd = GEPI->op_end();
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003745 const TargetData &TD = TM.getTargetData();
3746 const Type *Ty = Src->getType();
Chris Lattner27ee3a32005-04-09 19:47:21 +00003747 int32_t constValue = 0;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003748
Misha Brukmane2eceb52004-07-23 16:08:20 +00003749 // Record the operations to emit the GEP in a vector so that we can emit them
3750 // after having analyzed the entire instruction.
Misha Brukmanb097f212004-07-26 18:13:24 +00003751 std::vector<CollapsedGepOp> ops;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003752
Misha Brukman1013ef52004-07-21 20:09:08 +00003753 // GEPs have zero or more indices; we must perform a struct access
3754 // or array access for each one.
3755 for (GetElementPtrInst::op_iterator oi = IdxBegin, oe = IdxEnd; oi != oe;
3756 ++oi) {
3757 Value *idx = *oi;
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003758 if (const StructType *StTy = dyn_cast<StructType>(Ty)) {
Misha Brukman1013ef52004-07-21 20:09:08 +00003759 // It's a struct access. idx is the index into the structure,
3760 // which names the field. Use the TargetData structure to
3761 // pick out what the layout of the structure is in memory.
3762 // Use the (constant) structure index's value to find the
3763 // right byte offset from the StructLayout class's list of
3764 // structure member offsets.
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003765 unsigned fieldIndex = cast<ConstantUInt>(idx)->getValue();
Misha Brukmane2eceb52004-07-23 16:08:20 +00003766
3767 // StructType member offsets are always constant values. Add it to the
3768 // running total.
Nate Begeman645495d2004-09-23 05:31:33 +00003769 constValue += TD.getStructLayout(StTy)->MemberOffsets[fieldIndex];
Misha Brukmane2eceb52004-07-23 16:08:20 +00003770
Nate Begeman645495d2004-09-23 05:31:33 +00003771 // The next type is the member of the structure selected by the index.
Misha Brukmane2eceb52004-07-23 16:08:20 +00003772 Ty = StTy->getElementType (fieldIndex);
Nate Begeman645495d2004-09-23 05:31:33 +00003773 } else if (const SequentialType *SqTy = dyn_cast<SequentialType>(Ty)) {
Misha Brukman313efcb2004-07-09 15:45:07 +00003774 // Many GEP instructions use a [cast (int/uint) to LongTy] as their
3775 // operand. Handle this case directly now...
3776 if (CastInst *CI = dyn_cast<CastInst>(idx))
3777 if (CI->getOperand(0)->getType() == Type::IntTy ||
3778 CI->getOperand(0)->getType() == Type::UIntTy)
3779 idx = CI->getOperand(0);
Misha Brukman1013ef52004-07-21 20:09:08 +00003780
Misha Brukmane2eceb52004-07-23 16:08:20 +00003781 // It's an array or pointer access: [ArraySize x ElementType].
3782 // We want to add basePtrReg to (idxReg * sizeof ElementType). First, we
3783 // must find the size of the pointed-to type (Not coincidentally, the next
3784 // type is the type of the elements in the array).
Misha Brukman1013ef52004-07-21 20:09:08 +00003785 Ty = SqTy->getElementType();
Misha Brukman2ed17ca2004-07-22 15:58:04 +00003786 unsigned elementSize = TD.getTypeSize(Ty);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003787
Misha Brukmane2eceb52004-07-23 16:08:20 +00003788 if (ConstantInt *C = dyn_cast<ConstantInt>(idx)) {
Misha Brukmane2eceb52004-07-23 16:08:20 +00003789 if (ConstantSInt *CS = dyn_cast<ConstantSInt>(C))
3790 constValue += CS->getValue() * elementSize;
3791 else if (ConstantUInt *CU = dyn_cast<ConstantUInt>(C))
3792 constValue += CU->getValue() * elementSize;
3793 else
3794 assert(0 && "Invalid ConstantInt GEP index type!");
3795 } else {
Nate Begeman645495d2004-09-23 05:31:33 +00003796 // Push current gep state to this point as an add and multiply
3797 ops.push_back(CollapsedGepOp(
3798 ConstantSInt::get(Type::IntTy, constValue),
3799 idx, ConstantUInt::get(Type::UIntTy, elementSize)));
3800
Misha Brukmane2eceb52004-07-23 16:08:20 +00003801 constValue = 0;
Misha Brukman313efcb2004-07-09 15:45:07 +00003802 }
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003803 }
Misha Brukmane2eceb52004-07-23 16:08:20 +00003804 }
Misha Brukmane2eceb52004-07-23 16:08:20 +00003805 // Emit instructions for all the collapsed ops
Nate Begeman645495d2004-09-23 05:31:33 +00003806 unsigned indexReg = 0;
Misha Brukmanb097f212004-07-26 18:13:24 +00003807 for(std::vector<CollapsedGepOp>::iterator cgo_i = ops.begin(),
Misha Brukmane2eceb52004-07-23 16:08:20 +00003808 cgo_e = ops.end(); cgo_i != cgo_e; ++cgo_i) {
Misha Brukmanb097f212004-07-26 18:13:24 +00003809 CollapsedGepOp& cgo = *cgo_i;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003810
Nate Begeman8531f6f2004-11-19 02:06:40 +00003811 // Avoid emitting known move instructions here for the register allocator
3812 // to deal with later. val * 1 == val. val + 0 == val.
3813 unsigned TmpReg1;
3814 if (cgo.size->getValue() == 1) {
3815 TmpReg1 = getReg(cgo.index, MBB, IP);
3816 } else {
3817 TmpReg1 = makeAnotherReg(Type::IntTy);
3818 doMultiplyConst(MBB, IP, TmpReg1, cgo.index, cgo.size);
3819 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003820
Nate Begeman8531f6f2004-11-19 02:06:40 +00003821 unsigned TmpReg2;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003822 if (cgo.offset->isNullValue()) {
Nate Begeman8531f6f2004-11-19 02:06:40 +00003823 TmpReg2 = TmpReg1;
3824 } else {
3825 TmpReg2 = makeAnotherReg(Type::IntTy);
3826 emitBinaryConstOperation(MBB, IP, TmpReg1, cgo.offset, 0, TmpReg2);
3827 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003828
Nate Begeman645495d2004-09-23 05:31:33 +00003829 if (indexReg == 0)
3830 indexReg = TmpReg2;
3831 else {
3832 unsigned TmpReg3 = makeAnotherReg(Type::IntTy);
3833 BuildMI(*MBB, IP, PPC::ADD, 2, TmpReg3).addReg(indexReg).addReg(TmpReg2);
3834 indexReg = TmpReg3;
Misha Brukmane2eceb52004-07-23 16:08:20 +00003835 }
Misha Brukman2fec9902004-06-21 20:22:03 +00003836 }
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003837
Nate Begeman645495d2004-09-23 05:31:33 +00003838 // We now have a base register, an index register, and possibly a constant
3839 // remainder. If the GEP is going to be folded, we try to generate the
3840 // optimal addressing mode.
Misha Brukmane2eceb52004-07-23 16:08:20 +00003841 ConstantSInt *remainder = ConstantSInt::get(Type::IntTy, constValue);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003842
Misha Brukmanb097f212004-07-26 18:13:24 +00003843 // If we are emitting this during a fold, copy the current base register to
3844 // the target, and save the current constant offset so the folding load or
3845 // store can try and use it as an immediate.
3846 if (GEPIsFolded) {
Nate Begeman645495d2004-09-23 05:31:33 +00003847 if (indexReg == 0) {
Nate Begemanb816f022004-10-07 22:30:03 +00003848 if (!canUseAsImmediateForOpcode(remainder, 0, false)) {
Nate Begeman645495d2004-09-23 05:31:33 +00003849 indexReg = getReg(remainder, MBB, IP);
3850 remainder = 0;
Nate Begemanb64af912004-08-10 20:42:36 +00003851 }
Nate Begemanbc3a5372004-11-19 08:01:16 +00003852 } else if (!remainder->isNullValue()) {
Nate Begeman645495d2004-09-23 05:31:33 +00003853 unsigned TmpReg = makeAnotherReg(Type::IntTy);
Nate Begemanb816f022004-10-07 22:30:03 +00003854 emitBinaryConstOperation(MBB, IP, indexReg, remainder, 0, TmpReg);
Nate Begeman645495d2004-09-23 05:31:33 +00003855 indexReg = TmpReg;
3856 remainder = 0;
Nate Begemanb64af912004-08-10 20:42:36 +00003857 }
Nate Begemandb869aa2004-11-18 07:22:46 +00003858 unsigned basePtrReg = getReg(Src, MBB, IP);
3859 GEPMap[GEPI] = FoldedGEP(basePtrReg, indexReg, remainder);
Misha Brukmanb097f212004-07-26 18:13:24 +00003860 return;
3861 }
Nate Begemanb64af912004-08-10 20:42:36 +00003862
Nate Begeman645495d2004-09-23 05:31:33 +00003863 // We're not folding, so collapse the base, index, and any remainder into the
3864 // destination register.
Nate Begemandb869aa2004-11-18 07:22:46 +00003865 unsigned TargetReg = getReg(GEPI, MBB, IP);
3866 unsigned basePtrReg = getReg(Src, MBB, IP);
Nate Begemanbc3a5372004-11-19 08:01:16 +00003867
Nate Begeman486ebfd2004-11-21 05:14:06 +00003868 if ((indexReg == 0) && remainder->isNullValue()) {
3869 BuildMI(*MBB, IP, PPC::OR, 2, TargetReg).addReg(basePtrReg)
3870 .addReg(basePtrReg);
3871 return;
3872 }
Nate Begemanbc3a5372004-11-19 08:01:16 +00003873 if (!remainder->isNullValue()) {
3874 unsigned TmpReg = (indexReg == 0) ? TargetReg : makeAnotherReg(Type::IntTy);
3875 emitBinaryConstOperation(MBB, IP, basePtrReg, remainder, 0, TmpReg);
Nate Begemanb64af912004-08-10 20:42:36 +00003876 basePtrReg = TmpReg;
3877 }
Nate Begeman486ebfd2004-11-21 05:14:06 +00003878 if (indexReg != 0)
Nate Begemanbc3a5372004-11-19 08:01:16 +00003879 BuildMI(*MBB, IP, PPC::ADD, 2, TargetReg).addReg(indexReg)
3880 .addReg(basePtrReg);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003881}
3882
3883/// visitAllocaInst - If this is a fixed size alloca, allocate space from the
3884/// frame manager, otherwise do it the hard way.
3885///
Misha Brukmana1dca552004-09-21 18:22:19 +00003886void PPC32ISel::visitAllocaInst(AllocaInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003887 // If this is a fixed size alloca in the entry block for the function, we
3888 // statically stack allocate the space, so we don't need to do anything here.
3889 //
3890 if (dyn_castFixedAlloca(&I)) return;
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003891
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003892 // Find the data size of the alloca inst's getAllocatedType.
3893 const Type *Ty = I.getAllocatedType();
3894 unsigned TySize = TM.getTargetData().getTypeSize(Ty);
3895
3896 // Create a register to hold the temporary result of multiplying the type size
3897 // constant by the variable amount.
3898 unsigned TotalSizeReg = makeAnotherReg(Type::UIntTy);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003899
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003900 // TotalSizeReg = mul <numelements>, <TypeSize>
3901 MachineBasicBlock::iterator MBBI = BB->end();
Misha Brukman1013ef52004-07-21 20:09:08 +00003902 ConstantUInt *CUI = ConstantUInt::get(Type::UIntTy, TySize);
3903 doMultiplyConst(BB, MBBI, TotalSizeReg, I.getArraySize(), CUI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003904
3905 // AddedSize = add <TotalSizeReg>, 15
3906 unsigned AddedSizeReg = makeAnotherReg(Type::UIntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003907 BuildMI(BB, PPC::ADDI, 2, AddedSizeReg).addReg(TotalSizeReg).addSImm(15);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003908
3909 // AlignedSize = and <AddedSize>, ~15
3910 unsigned AlignedSize = makeAnotherReg(Type::UIntTy);
Misha Brukman5b570812004-08-10 22:47:03 +00003911 BuildMI(BB, PPC::RLWINM, 4, AlignedSize).addReg(AddedSizeReg).addImm(0)
Misha Brukman2fec9902004-06-21 20:22:03 +00003912 .addImm(0).addImm(27);
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003913
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003914 // Subtract size from stack pointer, thereby allocating some space.
Nate Begemanf70b5762005-03-28 23:08:54 +00003915 BuildMI(BB, PPC::SUBF, 2, PPC::R1).addReg(AlignedSize).addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003916
3917 // Put a pointer to the space into the result register, by copying
3918 // the stack pointer.
Misha Brukman5b570812004-08-10 22:47:03 +00003919 BuildMI(BB, PPC::OR, 2, getReg(I)).addReg(PPC::R1).addReg(PPC::R1);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003920
3921 // Inform the Frame Information that we have just allocated a variable-sized
3922 // object.
3923 F->getFrameInfo()->CreateVariableSizedObject();
3924}
3925
3926/// visitMallocInst - Malloc instructions are code generated into direct calls
3927/// to the library malloc.
3928///
Misha Brukmana1dca552004-09-21 18:22:19 +00003929void PPC32ISel::visitMallocInst(MallocInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003930 unsigned AllocSize = TM.getTargetData().getTypeSize(I.getAllocatedType());
3931 unsigned Arg;
3932
3933 if (ConstantUInt *C = dyn_cast<ConstantUInt>(I.getOperand(0))) {
3934 Arg = getReg(ConstantUInt::get(Type::UIntTy, C->getValue() * AllocSize));
3935 } else {
3936 Arg = makeAnotherReg(Type::UIntTy);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003937 MachineBasicBlock::iterator MBBI = BB->end();
Misha Brukman1013ef52004-07-21 20:09:08 +00003938 ConstantUInt *CUI = ConstantUInt::get(Type::UIntTy, AllocSize);
3939 doMultiplyConst(BB, MBBI, Arg, I.getOperand(0), CUI);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003940 }
3941
3942 std::vector<ValueRecord> Args;
3943 Args.push_back(ValueRecord(Arg, Type::UIntTy));
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003944 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003945 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(mallocFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003946 doCall(ValueRecord(getReg(I), I.getType()), TheCall, Args, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003947}
3948
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003949/// visitFreeInst - Free instructions are code gen'd to call the free libc
3950/// function.
3951///
Misha Brukmana1dca552004-09-21 18:22:19 +00003952void PPC32ISel::visitFreeInst(FreeInst &I) {
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003953 std::vector<ValueRecord> Args;
3954 Args.push_back(ValueRecord(I.getOperand(0)));
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003955 MachineInstr *TheCall =
Misha Brukman5b570812004-08-10 22:47:03 +00003956 BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(freeFn, true);
Misha Brukmand18a31d2004-07-06 22:51:53 +00003957 doCall(ValueRecord(0, Type::VoidTy), TheCall, Args, false);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003958}
Misha Brukmanb5f662f2005-04-21 23:30:14 +00003959
Misha Brukman3d9a6c22004-08-11 00:09:42 +00003960/// createPPC32ISelSimple - This pass converts an LLVM function into a machine
3961/// code representation is a very simple peep-hole fashion.
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003962///
Misha Brukman3d9a6c22004-08-11 00:09:42 +00003963FunctionPass *llvm::createPPC32ISelSimple(TargetMachine &TM) {
Misha Brukmana1dca552004-09-21 18:22:19 +00003964 return new PPC32ISel(TM);
Misha Brukman5dfe3a92004-06-21 16:55:25 +00003965}