Misha Brukman | f2ccb77 | 2004-08-17 04:55:41 +0000 | [diff] [blame] | 1 | //===-- PPC32ISelSimple.cpp - A simple instruction selector PowerPC32 -----===// |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file was developed by the LLVM research group and is distributed under |
| 6 | // the University of Illinois Open Source License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | |
Misha Brukman | 98649d1 | 2004-06-24 21:54:47 +0000 | [diff] [blame] | 10 | #define DEBUG_TYPE "isel" |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 11 | #include "PowerPC.h" |
| 12 | #include "PowerPCInstrBuilder.h" |
| 13 | #include "PowerPCInstrInfo.h" |
Misha Brukman | 3d9a6c2 | 2004-08-11 00:09:42 +0000 | [diff] [blame] | 14 | #include "PPC32TargetMachine.h" |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 15 | #include "llvm/Constants.h" |
| 16 | #include "llvm/DerivedTypes.h" |
| 17 | #include "llvm/Function.h" |
| 18 | #include "llvm/Instructions.h" |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 19 | #include "llvm/Pass.h" |
Misha Brukman | 8c9f520 | 2004-06-21 18:30:31 +0000 | [diff] [blame] | 20 | #include "llvm/CodeGen/IntrinsicLowering.h" |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 21 | #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 Spencer | 551ccae | 2004-09-01 22:55:40 +0000 | [diff] [blame] | 29 | #include "llvm/Support/Debug.h" |
| 30 | #include "llvm/ADT/Statistic.h" |
Misha Brukman | 98649d1 | 2004-06-24 21:54:47 +0000 | [diff] [blame] | 31 | #include <vector> |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 32 | using namespace llvm; |
| 33 | |
| 34 | namespace { |
Nate Begeman | 1b75022 | 2004-10-17 05:19:20 +0000 | [diff] [blame^] | 35 | Statistic<> Bitfields("ppc-codegen", "Number of bitfield inserts"); |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 36 | |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 37 | /// TypeClass - Used by the PowerPC backend to group LLVM types by their basic |
| 38 | /// PPC Representation. |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 39 | /// |
| 40 | enum TypeClass { |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 41 | cByte, cShort, cInt, cFP32, cFP64, cLong |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 42 | }; |
| 43 | } |
| 44 | |
| 45 | /// getClass - Turn a primitive type into a "class" number which is based on the |
| 46 | /// size of the type, and whether or not it is floating point. |
| 47 | /// |
| 48 | static inline TypeClass getClass(const Type *Ty) { |
Misha Brukman | 358829f | 2004-06-21 17:25:55 +0000 | [diff] [blame] | 49 | switch (Ty->getTypeID()) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 50 | case Type::SByteTyID: |
| 51 | case Type::UByteTyID: return cByte; // Byte operands are class #0 |
| 52 | case Type::ShortTyID: |
| 53 | case Type::UShortTyID: return cShort; // Short operands are class #1 |
| 54 | case Type::IntTyID: |
| 55 | case Type::UIntTyID: |
Misha Brukman | 2834a4d | 2004-07-07 20:07:22 +0000 | [diff] [blame] | 56 | case Type::PointerTyID: return cInt; // Ints and pointers are class #2 |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 57 | |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 58 | case Type::FloatTyID: return cFP32; // Single float is #3 |
| 59 | case Type::DoubleTyID: return cFP64; // Double Point is #4 |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 60 | |
| 61 | case Type::LongTyID: |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 62 | case Type::ULongTyID: return cLong; // Longs are class #5 |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 63 | default: |
| 64 | assert(0 && "Invalid type to getClass!"); |
| 65 | return cByte; // not reached |
| 66 | } |
| 67 | } |
| 68 | |
| 69 | // getClassB - Just like getClass, but treat boolean values as ints. |
| 70 | static inline TypeClass getClassB(const Type *Ty) { |
Nate Begeman | b73a711 | 2004-08-13 09:32:01 +0000 | [diff] [blame] | 71 | if (Ty == Type::BoolTy) return cByte; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 72 | return getClass(Ty); |
| 73 | } |
| 74 | |
| 75 | namespace { |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 76 | struct PPC32ISel : public FunctionPass, InstVisitor<PPC32ISel> { |
Misha Brukman | 3d9a6c2 | 2004-08-11 00:09:42 +0000 | [diff] [blame] | 77 | PPC32TargetMachine &TM; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 78 | MachineFunction *F; // The function we are compiling into |
| 79 | MachineBasicBlock *BB; // The current MBB we are compiling |
| 80 | int VarArgsFrameIndex; // FrameIndex for start of varargs area |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 81 | |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 82 | /// CollapsedGepOp - This struct is for recording the intermediate results |
| 83 | /// used to calculate the base, index, and offset of a GEP instruction. |
| 84 | struct CollapsedGepOp { |
| 85 | ConstantSInt *offset; // the current offset into the struct/array |
| 86 | Value *index; // the index of the array element |
| 87 | ConstantUInt *size; // the size of each array element |
| 88 | CollapsedGepOp(ConstantSInt *o, Value *i, ConstantUInt *s) : |
| 89 | offset(o), index(i), size(s) {} |
| 90 | }; |
| 91 | |
| 92 | /// FoldedGEP - This struct is for recording the necessary information to |
| 93 | /// emit the GEP in a load or store instruction, used by emitGEPOperation. |
| 94 | struct FoldedGEP { |
| 95 | unsigned base; |
| 96 | unsigned index; |
| 97 | ConstantSInt *offset; |
| 98 | FoldedGEP() : base(0), index(0), offset(0) {} |
| 99 | FoldedGEP(unsigned b, unsigned i, ConstantSInt *o) : |
| 100 | base(b), index(i), offset(o) {} |
| 101 | }; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 102 | |
Nate Begeman | 1b75022 | 2004-10-17 05:19:20 +0000 | [diff] [blame^] | 103 | /// RlwimiRec - This struct is for recording the necessary information to |
| 104 | /// emit a PowerPC rlwimi instruction for a bitfield insert rather than |
| 105 | /// a sequence of shifts and ands, followed by an or. |
| 106 | struct RlwimiRec { |
| 107 | unsigned Shift; |
| 108 | unsigned MB, ME; |
| 109 | Value *Op0, *Op1; |
| 110 | RlwimiRec() : Shift(0), MB(0), ME(0), Op0(0), Op1(0) {} |
| 111 | RlwimiRec(unsigned s, unsigned b, unsigned e, Value *y, Value *z) : |
| 112 | Shift(s), MB(b), ME(e), Op0(y), Op1(z) {} |
| 113 | }; |
| 114 | |
Misha Brukman | 2834a4d | 2004-07-07 20:07:22 +0000 | [diff] [blame] | 115 | // External functions used in the Module |
Nate Begeman | b64af91 | 2004-08-10 20:42:36 +0000 | [diff] [blame] | 116 | Function *fmodfFn, *fmodFn, *__cmpdi2Fn, *__moddi3Fn, *__divdi3Fn, |
| 117 | *__umoddi3Fn, *__udivdi3Fn, *__fixsfdiFn, *__fixdfdiFn, *__fixunssfdiFn, |
| 118 | *__fixunsdfdiFn, *__floatdisfFn, *__floatdidfFn, *mallocFn, *freeFn; |
Misha Brukman | 2834a4d | 2004-07-07 20:07:22 +0000 | [diff] [blame] | 119 | |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 120 | // Mapping between Values and SSA Regs |
| 121 | std::map<Value*, unsigned> RegMap; |
| 122 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 123 | // MBBMap - Mapping between LLVM BB -> Machine BB |
| 124 | std::map<const BasicBlock*, MachineBasicBlock*> MBBMap; |
| 125 | |
| 126 | // AllocaMap - Mapping from fixed sized alloca instructions to the |
| 127 | // FrameIndex for the alloca. |
| 128 | std::map<AllocaInst*, unsigned> AllocaMap; |
| 129 | |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 130 | // GEPMap - Mapping between basic blocks and GEP definitions |
| 131 | std::map<GetElementPtrInst*, FoldedGEP> GEPMap; |
Nate Begeman | 1b75022 | 2004-10-17 05:19:20 +0000 | [diff] [blame^] | 132 | |
| 133 | // RlwimiMap - Mapping between BinaryOperand (Or) instructions and info |
| 134 | // needed to properly emit a rlwimi instruction in its place. |
| 135 | std::map<BinaryOperator *, RlwimiRec> RlwimiMap; |
| 136 | std::vector<Instruction *> SkipList; |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 137 | |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 138 | // A Reg to hold the base address used for global loads and stores, and a |
| 139 | // flag to set whether or not we need to emit it for this function. |
| 140 | unsigned GlobalBaseReg; |
| 141 | bool GlobalBaseInitialized; |
| 142 | |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 143 | PPC32ISel(TargetMachine &tm):TM(reinterpret_cast<PPC32TargetMachine&>(tm)), |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 144 | F(0), BB(0) {} |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 145 | |
Misha Brukman | 2834a4d | 2004-07-07 20:07:22 +0000 | [diff] [blame] | 146 | bool doInitialization(Module &M) { |
Misha Brukman | b093259 | 2004-07-07 15:36:18 +0000 | [diff] [blame] | 147 | // Add external functions that we may call |
Nate Begeman | b64af91 | 2004-08-10 20:42:36 +0000 | [diff] [blame] | 148 | Type *i = Type::IntTy; |
Misha Brukman | 2834a4d | 2004-07-07 20:07:22 +0000 | [diff] [blame] | 149 | Type *d = Type::DoubleTy; |
Misha Brukman | f3f6382 | 2004-07-08 19:41:16 +0000 | [diff] [blame] | 150 | Type *f = Type::FloatTy; |
Misha Brukman | 2834a4d | 2004-07-07 20:07:22 +0000 | [diff] [blame] | 151 | Type *l = Type::LongTy; |
| 152 | Type *ul = Type::ULongTy; |
Misha Brukman | 313efcb | 2004-07-09 15:45:07 +0000 | [diff] [blame] | 153 | Type *voidPtr = PointerType::get(Type::SByteTy); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 154 | // float fmodf(float, float); |
| 155 | fmodfFn = M.getOrInsertFunction("fmodf", f, f, f, 0); |
Misha Brukman | 2834a4d | 2004-07-07 20:07:22 +0000 | [diff] [blame] | 156 | // double fmod(double, double); |
Misha Brukman | 0aa97c6 | 2004-07-08 18:27:59 +0000 | [diff] [blame] | 157 | fmodFn = M.getOrInsertFunction("fmod", d, d, d, 0); |
Nate Begeman | b64af91 | 2004-08-10 20:42:36 +0000 | [diff] [blame] | 158 | // int __cmpdi2(long, long); |
| 159 | __cmpdi2Fn = M.getOrInsertFunction("__cmpdi2", i, l, l, 0); |
Misha Brukman | 2834a4d | 2004-07-07 20:07:22 +0000 | [diff] [blame] | 160 | // long __moddi3(long, long); |
Misha Brukman | 0aa97c6 | 2004-07-08 18:27:59 +0000 | [diff] [blame] | 161 | __moddi3Fn = M.getOrInsertFunction("__moddi3", l, l, l, 0); |
Misha Brukman | 2834a4d | 2004-07-07 20:07:22 +0000 | [diff] [blame] | 162 | // long __divdi3(long, long); |
Misha Brukman | 0aa97c6 | 2004-07-08 18:27:59 +0000 | [diff] [blame] | 163 | __divdi3Fn = M.getOrInsertFunction("__divdi3", l, l, l, 0); |
Misha Brukman | 2834a4d | 2004-07-07 20:07:22 +0000 | [diff] [blame] | 164 | // unsigned long __umoddi3(unsigned long, unsigned long); |
Misha Brukman | 0aa97c6 | 2004-07-08 18:27:59 +0000 | [diff] [blame] | 165 | __umoddi3Fn = M.getOrInsertFunction("__umoddi3", ul, ul, ul, 0); |
Misha Brukman | 2834a4d | 2004-07-07 20:07:22 +0000 | [diff] [blame] | 166 | // unsigned long __udivdi3(unsigned long, unsigned long); |
Misha Brukman | 0aa97c6 | 2004-07-08 18:27:59 +0000 | [diff] [blame] | 167 | __udivdi3Fn = M.getOrInsertFunction("__udivdi3", ul, ul, ul, 0); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 168 | // long __fixsfdi(float) |
Nate Begeman | b64af91 | 2004-08-10 20:42:36 +0000 | [diff] [blame] | 169 | __fixsfdiFn = M.getOrInsertFunction("__fixsfdi", l, f, 0); |
Misha Brukman | f3f6382 | 2004-07-08 19:41:16 +0000 | [diff] [blame] | 170 | // long __fixdfdi(double) |
| 171 | __fixdfdiFn = M.getOrInsertFunction("__fixdfdi", l, d, 0); |
Nate Begeman | b64af91 | 2004-08-10 20:42:36 +0000 | [diff] [blame] | 172 | // unsigned long __fixunssfdi(float) |
| 173 | __fixunssfdiFn = M.getOrInsertFunction("__fixunssfdi", ul, f, 0); |
| 174 | // unsigned long __fixunsdfdi(double) |
| 175 | __fixunsdfdiFn = M.getOrInsertFunction("__fixunsdfdi", ul, d, 0); |
Misha Brukman | f3f6382 | 2004-07-08 19:41:16 +0000 | [diff] [blame] | 176 | // float __floatdisf(long) |
| 177 | __floatdisfFn = M.getOrInsertFunction("__floatdisf", f, l, 0); |
| 178 | // double __floatdidf(long) |
| 179 | __floatdidfFn = M.getOrInsertFunction("__floatdidf", d, l, 0); |
Misha Brukman | 313efcb | 2004-07-09 15:45:07 +0000 | [diff] [blame] | 180 | // void* malloc(size_t) |
| 181 | mallocFn = M.getOrInsertFunction("malloc", voidPtr, Type::UIntTy, 0); |
| 182 | // void free(void*) |
| 183 | freeFn = M.getOrInsertFunction("free", Type::VoidTy, voidPtr, 0); |
Misha Brukman | 2834a4d | 2004-07-07 20:07:22 +0000 | [diff] [blame] | 184 | return false; |
| 185 | } |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 186 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 187 | /// runOnFunction - Top level implementation of instruction selection for |
| 188 | /// the entire function. |
| 189 | /// |
| 190 | bool runOnFunction(Function &Fn) { |
| 191 | // First pass over the function, lower any unknown intrinsic functions |
| 192 | // with the IntrinsicLowering class. |
| 193 | LowerUnknownIntrinsicFunctionCalls(Fn); |
| 194 | |
| 195 | F = &MachineFunction::construct(&Fn, TM); |
| 196 | |
| 197 | // Create all of the machine basic blocks for the function... |
| 198 | for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) |
| 199 | F->getBasicBlockList().push_back(MBBMap[I] = new MachineBasicBlock(I)); |
| 200 | |
| 201 | BB = &F->front(); |
| 202 | |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 203 | // Make sure we re-emit a set of the global base reg if necessary |
| 204 | GlobalBaseInitialized = false; |
| 205 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 206 | // Copy incoming arguments off of the stack... |
| 207 | LoadArgumentsToVirtualRegs(Fn); |
| 208 | |
| 209 | // Instruction select everything except PHI nodes |
| 210 | visit(Fn); |
| 211 | |
| 212 | // Select the PHI nodes |
| 213 | SelectPHINodes(); |
| 214 | |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 215 | GEPMap.clear(); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 216 | RegMap.clear(); |
| 217 | MBBMap.clear(); |
| 218 | AllocaMap.clear(); |
Nate Begeman | 1b75022 | 2004-10-17 05:19:20 +0000 | [diff] [blame^] | 219 | RlwimiMap.clear(); |
| 220 | SkipList.clear(); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 221 | F = 0; |
| 222 | // We always build a machine code representation for the function |
| 223 | return true; |
| 224 | } |
| 225 | |
| 226 | virtual const char *getPassName() const { |
| 227 | return "PowerPC Simple Instruction Selection"; |
| 228 | } |
| 229 | |
| 230 | /// visitBasicBlock - This method is called when we are visiting a new basic |
| 231 | /// block. This simply creates a new MachineBasicBlock to emit code into |
| 232 | /// and adds it to the current MachineFunction. Subsequent visit* for |
| 233 | /// instructions will be invoked for all instructions in the basic block. |
| 234 | /// |
| 235 | void visitBasicBlock(BasicBlock &LLVM_BB) { |
| 236 | BB = MBBMap[&LLVM_BB]; |
| 237 | } |
| 238 | |
| 239 | /// LowerUnknownIntrinsicFunctionCalls - This performs a prepass over the |
| 240 | /// function, lowering any calls to unknown intrinsic functions into the |
| 241 | /// equivalent LLVM code. |
| 242 | /// |
| 243 | void LowerUnknownIntrinsicFunctionCalls(Function &F); |
| 244 | |
| 245 | /// LoadArgumentsToVirtualRegs - Load all of the arguments to this function |
| 246 | /// from the stack into virtual registers. |
| 247 | /// |
| 248 | void LoadArgumentsToVirtualRegs(Function &F); |
| 249 | |
| 250 | /// SelectPHINodes - Insert machine code to generate phis. This is tricky |
| 251 | /// because we have to generate our sources into the source basic blocks, |
| 252 | /// not the current one. |
| 253 | /// |
| 254 | void SelectPHINodes(); |
| 255 | |
| 256 | // Visitation methods for various instructions. These methods simply emit |
| 257 | // fixed PowerPC code for each instruction. |
| 258 | |
Chris Lattner | 289a49a | 2004-10-16 18:13:47 +0000 | [diff] [blame] | 259 | // Control flow operators. |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 260 | void visitReturnInst(ReturnInst &RI); |
| 261 | void visitBranchInst(BranchInst &BI); |
Chris Lattner | 289a49a | 2004-10-16 18:13:47 +0000 | [diff] [blame] | 262 | void visitUnreachableInst(UnreachableInst &UI) {} |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 263 | |
| 264 | struct ValueRecord { |
| 265 | Value *Val; |
| 266 | unsigned Reg; |
| 267 | const Type *Ty; |
| 268 | ValueRecord(unsigned R, const Type *T) : Val(0), Reg(R), Ty(T) {} |
| 269 | ValueRecord(Value *V) : Val(V), Reg(0), Ty(V->getType()) {} |
| 270 | }; |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 271 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 272 | void doCall(const ValueRecord &Ret, MachineInstr *CallMI, |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 273 | const std::vector<ValueRecord> &Args, bool isVarArg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 274 | void visitCallInst(CallInst &I); |
| 275 | void visitIntrinsicCall(Intrinsic::ID ID, CallInst &I); |
| 276 | |
| 277 | // Arithmetic operators |
| 278 | void visitSimpleBinary(BinaryOperator &B, unsigned OpcodeClass); |
| 279 | void visitAdd(BinaryOperator &B) { visitSimpleBinary(B, 0); } |
| 280 | void visitSub(BinaryOperator &B) { visitSimpleBinary(B, 1); } |
| 281 | void visitMul(BinaryOperator &B); |
| 282 | |
| 283 | void visitDiv(BinaryOperator &B) { visitDivRem(B); } |
| 284 | void visitRem(BinaryOperator &B) { visitDivRem(B); } |
| 285 | void visitDivRem(BinaryOperator &B); |
| 286 | |
| 287 | // Bitwise operators |
| 288 | void visitAnd(BinaryOperator &B) { visitSimpleBinary(B, 2); } |
| 289 | void visitOr (BinaryOperator &B) { visitSimpleBinary(B, 3); } |
| 290 | void visitXor(BinaryOperator &B) { visitSimpleBinary(B, 4); } |
| 291 | |
| 292 | // Comparison operators... |
| 293 | void visitSetCondInst(SetCondInst &I); |
| 294 | unsigned EmitComparison(unsigned OpNum, Value *Op0, Value *Op1, |
| 295 | MachineBasicBlock *MBB, |
| 296 | MachineBasicBlock::iterator MBBI); |
| 297 | void visitSelectInst(SelectInst &SI); |
| 298 | |
| 299 | |
| 300 | // Memory Instructions |
| 301 | void visitLoadInst(LoadInst &I); |
| 302 | void visitStoreInst(StoreInst &I); |
| 303 | void visitGetElementPtrInst(GetElementPtrInst &I); |
| 304 | void visitAllocaInst(AllocaInst &I); |
| 305 | void visitMallocInst(MallocInst &I); |
| 306 | void visitFreeInst(FreeInst &I); |
| 307 | |
| 308 | // Other operators |
| 309 | void visitShiftInst(ShiftInst &I); |
| 310 | void visitPHINode(PHINode &I) {} // PHI nodes handled by second pass |
| 311 | void visitCastInst(CastInst &I); |
| 312 | void visitVANextInst(VANextInst &I); |
| 313 | void visitVAArgInst(VAArgInst &I); |
| 314 | |
| 315 | void visitInstruction(Instruction &I) { |
| 316 | std::cerr << "Cannot instruction select: " << I; |
| 317 | abort(); |
| 318 | } |
| 319 | |
Nate Begeman | b47321b | 2004-08-20 09:56:22 +0000 | [diff] [blame] | 320 | unsigned ExtendOrClear(MachineBasicBlock *MBB, |
| 321 | MachineBasicBlock::iterator IP, |
Nate Begeman | a2de102 | 2004-09-22 04:40:25 +0000 | [diff] [blame] | 322 | Value *Op0); |
Nate Begeman | b47321b | 2004-08-20 09:56:22 +0000 | [diff] [blame] | 323 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 324 | /// 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 Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 332 | GetElementPtrInst *GEPI, bool foldGEP); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 333 | |
| 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 Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 340 | |
Nate Begeman | 1b75022 | 2004-10-17 05:19:20 +0000 | [diff] [blame^] | 341 | /// emitBitfieldInsert - return true if we were able to fold the sequence of |
| 342 | /// instructions starting with AndI into a bitfield insert. |
| 343 | bool PPC32ISel::emitBitfieldInsert(BinaryOperator *AndI, |
| 344 | unsigned ShlAmount, |
| 345 | Value *InsertOp); |
| 346 | |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 347 | /// emitBinaryConstOperation - Used by several functions to emit simple |
| 348 | /// arithmetic and logical operations with constants on a register rather |
| 349 | /// than a Value. |
| 350 | /// |
| 351 | void emitBinaryConstOperation(MachineBasicBlock *MBB, |
| 352 | MachineBasicBlock::iterator IP, |
| 353 | unsigned Op0Reg, ConstantInt *Op1, |
| 354 | unsigned Opcode, unsigned DestReg); |
| 355 | |
| 356 | /// emitSimpleBinaryOperation - Implement simple binary operators for |
| 357 | /// integral types. OperatorClass is one of: 0 for Add, 1 for Sub, |
| 358 | /// 2 for And, 3 for Or, 4 for Xor. |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 359 | /// |
| 360 | void emitSimpleBinaryOperation(MachineBasicBlock *BB, |
| 361 | MachineBasicBlock::iterator IP, |
Nate Begeman | 1b75022 | 2004-10-17 05:19:20 +0000 | [diff] [blame^] | 362 | BinaryOperator *BO, |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 363 | Value *Op0, Value *Op1, |
| 364 | unsigned OperatorClass, unsigned TargetReg); |
| 365 | |
| 366 | /// emitBinaryFPOperation - This method handles emission of floating point |
| 367 | /// Add (0), Sub (1), Mul (2), and Div (3) operations. |
| 368 | void emitBinaryFPOperation(MachineBasicBlock *BB, |
| 369 | MachineBasicBlock::iterator IP, |
| 370 | Value *Op0, Value *Op1, |
| 371 | unsigned OperatorClass, unsigned TargetReg); |
| 372 | |
| 373 | void emitMultiply(MachineBasicBlock *BB, MachineBasicBlock::iterator IP, |
| 374 | Value *Op0, Value *Op1, unsigned TargetReg); |
| 375 | |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 376 | void doMultiply(MachineBasicBlock *MBB, |
| 377 | MachineBasicBlock::iterator IP, |
| 378 | unsigned DestReg, Value *Op0, Value *Op1); |
| 379 | |
| 380 | /// doMultiplyConst - This method will multiply the value in Op0Reg by the |
| 381 | /// value of the ContantInt *CI |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 382 | void doMultiplyConst(MachineBasicBlock *MBB, |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 383 | MachineBasicBlock::iterator IP, |
| 384 | unsigned DestReg, Value *Op0, ConstantInt *CI); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 385 | |
| 386 | void emitDivRemOperation(MachineBasicBlock *BB, |
| 387 | MachineBasicBlock::iterator IP, |
| 388 | Value *Op0, Value *Op1, bool isDiv, |
| 389 | unsigned TargetReg); |
| 390 | |
| 391 | /// emitSetCCOperation - Common code shared between visitSetCondInst and |
| 392 | /// constant expression support. |
| 393 | /// |
| 394 | void emitSetCCOperation(MachineBasicBlock *BB, |
| 395 | MachineBasicBlock::iterator IP, |
| 396 | Value *Op0, Value *Op1, unsigned Opcode, |
| 397 | unsigned TargetReg); |
| 398 | |
| 399 | /// emitShiftOperation - Common code shared between visitShiftInst and |
| 400 | /// constant expression support. |
| 401 | /// |
| 402 | void emitShiftOperation(MachineBasicBlock *MBB, |
| 403 | MachineBasicBlock::iterator IP, |
| 404 | Value *Op, Value *ShiftAmount, bool isLeftShift, |
| 405 | const Type *ResultTy, unsigned DestReg); |
| 406 | |
| 407 | /// emitSelectOperation - Common code shared between visitSelectInst and the |
| 408 | /// constant expression support. |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 409 | /// |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 410 | void emitSelectOperation(MachineBasicBlock *MBB, |
| 411 | MachineBasicBlock::iterator IP, |
| 412 | Value *Cond, Value *TrueVal, Value *FalseVal, |
| 413 | unsigned DestReg); |
| 414 | |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 415 | /// copyGlobalBaseToRegister - Output the instructions required to put the |
| 416 | /// base address to use for accessing globals into a register. |
| 417 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 418 | void copyGlobalBaseToRegister(MachineBasicBlock *MBB, |
| 419 | MachineBasicBlock::iterator IP, |
| 420 | unsigned R); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 421 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 422 | /// copyConstantToRegister - Output the instructions required to put the |
| 423 | /// specified constant into the specified register. |
| 424 | /// |
| 425 | void copyConstantToRegister(MachineBasicBlock *MBB, |
| 426 | MachineBasicBlock::iterator MBBI, |
| 427 | Constant *C, unsigned Reg); |
| 428 | |
| 429 | void emitUCOM(MachineBasicBlock *MBB, MachineBasicBlock::iterator MBBI, |
| 430 | unsigned LHS, unsigned RHS); |
| 431 | |
| 432 | /// makeAnotherReg - This method returns the next register number we haven't |
| 433 | /// yet used. |
| 434 | /// |
| 435 | /// Long values are handled somewhat specially. They are always allocated |
| 436 | /// as pairs of 32 bit integer values. The register number returned is the |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 437 | /// high 32 bits of the long value, and the regNum+1 is the low 32 bits. |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 438 | /// |
| 439 | unsigned makeAnotherReg(const Type *Ty) { |
Misha Brukman | f2ccb77 | 2004-08-17 04:55:41 +0000 | [diff] [blame] | 440 | assert(dynamic_cast<const PPC32RegisterInfo*>(TM.getRegisterInfo()) && |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 441 | "Current target doesn't have PPC reg info??"); |
Misha Brukman | f2ccb77 | 2004-08-17 04:55:41 +0000 | [diff] [blame] | 442 | const PPC32RegisterInfo *PPCRI = |
| 443 | static_cast<const PPC32RegisterInfo*>(TM.getRegisterInfo()); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 444 | if (Ty == Type::LongTy || Ty == Type::ULongTy) { |
Nate Begeman | b64af91 | 2004-08-10 20:42:36 +0000 | [diff] [blame] | 445 | const TargetRegisterClass *RC = PPCRI->getRegClassForType(Type::IntTy); |
| 446 | // Create the upper part |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 447 | F->getSSARegMap()->createVirtualRegister(RC); |
Nate Begeman | b64af91 | 2004-08-10 20:42:36 +0000 | [diff] [blame] | 448 | // Create the lower part. |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 449 | return F->getSSARegMap()->createVirtualRegister(RC)-1; |
| 450 | } |
| 451 | |
| 452 | // Add the mapping of regnumber => reg class to MachineFunction |
Nate Begeman | b64af91 | 2004-08-10 20:42:36 +0000 | [diff] [blame] | 453 | const TargetRegisterClass *RC = PPCRI->getRegClassForType(Ty); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 454 | return F->getSSARegMap()->createVirtualRegister(RC); |
| 455 | } |
| 456 | |
| 457 | /// getReg - This method turns an LLVM value into a register number. |
| 458 | /// |
| 459 | unsigned getReg(Value &V) { return getReg(&V); } // Allow references |
| 460 | unsigned getReg(Value *V) { |
| 461 | // Just append to the end of the current bb. |
| 462 | MachineBasicBlock::iterator It = BB->end(); |
| 463 | return getReg(V, BB, It); |
| 464 | } |
| 465 | unsigned getReg(Value *V, MachineBasicBlock *MBB, |
| 466 | MachineBasicBlock::iterator IPt); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 467 | |
| 468 | /// canUseAsImmediateForOpcode - This method returns whether a ConstantInt |
| 469 | /// is okay to use as an immediate argument to a certain binary operation |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 470 | bool canUseAsImmediateForOpcode(ConstantInt *CI, unsigned Opcode, |
| 471 | bool Shifted); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 472 | |
| 473 | /// getFixedSizedAllocaFI - Return the frame index for a fixed sized alloca |
| 474 | /// that is to be statically allocated with the initial stack frame |
| 475 | /// adjustment. |
| 476 | unsigned getFixedSizedAllocaFI(AllocaInst *AI); |
| 477 | }; |
| 478 | } |
| 479 | |
| 480 | /// dyn_castFixedAlloca - If the specified value is a fixed size alloca |
| 481 | /// instruction in the entry block, return it. Otherwise, return a null |
| 482 | /// pointer. |
| 483 | static AllocaInst *dyn_castFixedAlloca(Value *V) { |
| 484 | if (AllocaInst *AI = dyn_cast<AllocaInst>(V)) { |
| 485 | BasicBlock *BB = AI->getParent(); |
| 486 | if (isa<ConstantUInt>(AI->getArraySize()) && BB ==&BB->getParent()->front()) |
| 487 | return AI; |
| 488 | } |
| 489 | return 0; |
| 490 | } |
| 491 | |
| 492 | /// getReg - This method turns an LLVM value into a register number. |
| 493 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 494 | unsigned PPC32ISel::getReg(Value *V, MachineBasicBlock *MBB, |
| 495 | MachineBasicBlock::iterator IPt) { |
Misha Brukman | ba1c1da | 2004-07-20 00:59:38 +0000 | [diff] [blame] | 496 | if (Constant *C = dyn_cast<Constant>(V)) { |
Chris Lattner | a51e4f6 | 2004-07-18 18:45:01 +0000 | [diff] [blame] | 497 | unsigned Reg = makeAnotherReg(V->getType()); |
| 498 | copyConstantToRegister(MBB, IPt, C, Reg); |
| 499 | return Reg; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 500 | } else if (AllocaInst *AI = dyn_castFixedAlloca(V)) { |
| 501 | unsigned Reg = makeAnotherReg(V->getType()); |
| 502 | unsigned FI = getFixedSizedAllocaFI(AI); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 503 | addFrameReference(BuildMI(*MBB, IPt, PPC::ADDI, 2, Reg), FI, 0, false); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 504 | return Reg; |
| 505 | } |
| 506 | |
| 507 | unsigned &Reg = RegMap[V]; |
| 508 | if (Reg == 0) { |
| 509 | Reg = makeAnotherReg(V->getType()); |
| 510 | RegMap[V] = Reg; |
| 511 | } |
| 512 | |
| 513 | return Reg; |
| 514 | } |
| 515 | |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 516 | /// canUseAsImmediateForOpcode - This method returns whether a ConstantInt |
| 517 | /// is okay to use as an immediate argument to a certain binary operator. |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 518 | /// The shifted argument determines if the immediate is suitable to be used with |
| 519 | /// the PowerPC instructions such as addis which concatenate 16 bits of the |
| 520 | /// immediate with 16 bits of zeroes. |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 521 | /// |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 522 | bool PPC32ISel::canUseAsImmediateForOpcode(ConstantInt *CI, unsigned Opcode, |
| 523 | bool Shifted) { |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 524 | ConstantSInt *Op1Cs; |
| 525 | ConstantUInt *Op1Cu; |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 526 | |
| 527 | // For shifted immediates, any value with the low halfword cleared may be used |
| 528 | if (Shifted) { |
Nate Begeman | bdf6984 | 2004-10-08 02:49:24 +0000 | [diff] [blame] | 529 | if (((int32_t)CI->getRawValue() & 0x0000FFFF) == 0) |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 530 | return true; |
Nate Begeman | bdf6984 | 2004-10-08 02:49:24 +0000 | [diff] [blame] | 531 | else |
| 532 | return false; |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 533 | } |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 534 | |
| 535 | // ADDI, Compare, and non-indexed Load take SIMM |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 536 | bool cond1 = (Opcode < 2) |
Nate Begeman | a41fc77 | 2004-09-29 02:35:05 +0000 | [diff] [blame] | 537 | && ((int32_t)CI->getRawValue() <= 32767) |
| 538 | && ((int32_t)CI->getRawValue() >= -32768); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 539 | |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 540 | // ANDIo, ORI, and XORI take unsigned values |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 541 | bool cond2 = (Opcode >= 2) |
Misha Brukman | 2ed17ca | 2004-07-22 15:58:04 +0000 | [diff] [blame] | 542 | && (Op1Cs = dyn_cast<ConstantSInt>(CI)) |
| 543 | && (Op1Cs->getValue() >= 0) |
Nate Begeman | a41fc77 | 2004-09-29 02:35:05 +0000 | [diff] [blame] | 544 | && (Op1Cs->getValue() <= 65535); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 545 | |
| 546 | // ANDIo, ORI, and XORI take UIMMs, so they can be larger |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 547 | bool cond3 = (Opcode >= 2) |
Misha Brukman | 17a9000 | 2004-07-21 20:22:06 +0000 | [diff] [blame] | 548 | && (Op1Cu = dyn_cast<ConstantUInt>(CI)) |
| 549 | && (Op1Cu->getValue() <= 65535); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 550 | |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 551 | if (cond1 || cond2 || cond3) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 552 | return true; |
| 553 | |
| 554 | return false; |
| 555 | } |
| 556 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 557 | /// getFixedSizedAllocaFI - Return the frame index for a fixed sized alloca |
| 558 | /// that is to be statically allocated with the initial stack frame |
| 559 | /// adjustment. |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 560 | unsigned PPC32ISel::getFixedSizedAllocaFI(AllocaInst *AI) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 561 | // Already computed this? |
| 562 | std::map<AllocaInst*, unsigned>::iterator I = AllocaMap.lower_bound(AI); |
| 563 | if (I != AllocaMap.end() && I->first == AI) return I->second; |
| 564 | |
| 565 | const Type *Ty = AI->getAllocatedType(); |
| 566 | ConstantUInt *CUI = cast<ConstantUInt>(AI->getArraySize()); |
| 567 | unsigned TySize = TM.getTargetData().getTypeSize(Ty); |
| 568 | TySize *= CUI->getValue(); // Get total allocated size... |
| 569 | unsigned Alignment = TM.getTargetData().getTypeAlignment(Ty); |
| 570 | |
| 571 | // Create a new stack object using the frame manager... |
| 572 | int FrameIdx = F->getFrameInfo()->CreateStackObject(TySize, Alignment); |
| 573 | AllocaMap.insert(I, std::make_pair(AI, FrameIdx)); |
| 574 | return FrameIdx; |
| 575 | } |
| 576 | |
| 577 | |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 578 | /// copyGlobalBaseToRegister - Output the instructions required to put the |
| 579 | /// base address to use for accessing globals into a register. |
| 580 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 581 | void PPC32ISel::copyGlobalBaseToRegister(MachineBasicBlock *MBB, |
| 582 | MachineBasicBlock::iterator IP, |
| 583 | unsigned R) { |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 584 | if (!GlobalBaseInitialized) { |
| 585 | // Insert the set of GlobalBaseReg into the first MBB of the function |
| 586 | MachineBasicBlock &FirstMBB = F->front(); |
| 587 | MachineBasicBlock::iterator MBBI = FirstMBB.begin(); |
| 588 | GlobalBaseReg = makeAnotherReg(Type::IntTy); |
Nate Begeman | b7a8f2c | 2004-09-02 08:13:00 +0000 | [diff] [blame] | 589 | BuildMI(FirstMBB, MBBI, PPC::MovePCtoLR, 0, PPC::LR); |
Nate Begeman | da721e7 | 2004-09-27 05:08:17 +0000 | [diff] [blame] | 590 | BuildMI(FirstMBB, MBBI, PPC::MFLR, 1, GlobalBaseReg).addReg(PPC::LR); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 591 | GlobalBaseInitialized = true; |
| 592 | } |
| 593 | // Emit our copy of GlobalBaseReg to the destination register in the |
| 594 | // current MBB |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 595 | BuildMI(*MBB, IP, PPC::OR, 2, R).addReg(GlobalBaseReg) |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 596 | .addReg(GlobalBaseReg); |
| 597 | } |
| 598 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 599 | /// copyConstantToRegister - Output the instructions required to put the |
| 600 | /// specified constant into the specified register. |
| 601 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 602 | void PPC32ISel::copyConstantToRegister(MachineBasicBlock *MBB, |
| 603 | MachineBasicBlock::iterator IP, |
| 604 | Constant *C, unsigned R) { |
Chris Lattner | 289a49a | 2004-10-16 18:13:47 +0000 | [diff] [blame] | 605 | if (isa<UndefValue>(C)) { |
| 606 | BuildMI(*MBB, IP, PPC::IMPLICIT_DEF, 0, R); |
| 607 | return; |
| 608 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 609 | if (C->getType()->isIntegral()) { |
| 610 | unsigned Class = getClassB(C->getType()); |
| 611 | |
| 612 | if (Class == cLong) { |
Misha Brukman | a0af38c | 2004-07-28 19:13:49 +0000 | [diff] [blame] | 613 | if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(C)) { |
| 614 | uint64_t uval = CUI->getValue(); |
| 615 | unsigned hiUVal = uval >> 32; |
| 616 | unsigned loUVal = uval; |
| 617 | ConstantUInt *CUHi = ConstantUInt::get(Type::UIntTy, hiUVal); |
| 618 | ConstantUInt *CULo = ConstantUInt::get(Type::UIntTy, loUVal); |
| 619 | copyConstantToRegister(MBB, IP, CUHi, R); |
| 620 | copyConstantToRegister(MBB, IP, CULo, R+1); |
| 621 | return; |
| 622 | } else if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(C)) { |
| 623 | int64_t sval = CSI->getValue(); |
| 624 | int hiSVal = sval >> 32; |
| 625 | int loSVal = sval; |
| 626 | ConstantSInt *CSHi = ConstantSInt::get(Type::IntTy, hiSVal); |
| 627 | ConstantSInt *CSLo = ConstantSInt::get(Type::IntTy, loSVal); |
| 628 | copyConstantToRegister(MBB, IP, CSHi, R); |
| 629 | copyConstantToRegister(MBB, IP, CSLo, R+1); |
| 630 | return; |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 631 | } else { |
Misha Brukman | a0af38c | 2004-07-28 19:13:49 +0000 | [diff] [blame] | 632 | std::cerr << "Unhandled long constant type!\n"; |
| 633 | abort(); |
| 634 | } |
| 635 | } |
| 636 | |
| 637 | assert(Class <= cInt && "Type not handled yet!"); |
| 638 | |
| 639 | // Handle bool |
| 640 | if (C->getType() == Type::BoolTy) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 641 | BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(C == ConstantBool::True); |
Misha Brukman | a0af38c | 2004-07-28 19:13:49 +0000 | [diff] [blame] | 642 | return; |
| 643 | } |
| 644 | |
| 645 | // Handle int |
| 646 | if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(C)) { |
| 647 | unsigned uval = CUI->getValue(); |
| 648 | if (uval < 32768) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 649 | BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(uval); |
Misha Brukman | a0af38c | 2004-07-28 19:13:49 +0000 | [diff] [blame] | 650 | } else { |
| 651 | unsigned Temp = makeAnotherReg(Type::IntTy); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 652 | BuildMI(*MBB, IP, PPC::LIS, 1, Temp).addSImm(uval >> 16); |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 653 | BuildMI(*MBB, IP, PPC::ORI, 2, R).addReg(Temp).addImm(uval & 0xFFFF); |
Misha Brukman | a0af38c | 2004-07-28 19:13:49 +0000 | [diff] [blame] | 654 | } |
| 655 | return; |
| 656 | } else if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(C)) { |
| 657 | int sval = CSI->getValue(); |
| 658 | if (sval < 32768 && sval >= -32768) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 659 | BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(sval); |
Misha Brukman | a0af38c | 2004-07-28 19:13:49 +0000 | [diff] [blame] | 660 | } else { |
| 661 | unsigned Temp = makeAnotherReg(Type::IntTy); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 662 | BuildMI(*MBB, IP, PPC::LIS, 1, Temp).addSImm(sval >> 16); |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 663 | BuildMI(*MBB, IP, PPC::ORI, 2, R).addReg(Temp).addImm(sval & 0xFFFF); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 664 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 665 | return; |
| 666 | } |
Misha Brukman | a0af38c | 2004-07-28 19:13:49 +0000 | [diff] [blame] | 667 | std::cerr << "Unhandled integer constant!\n"; |
| 668 | abort(); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 669 | } else if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) { |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 670 | // We need to spill the constant to memory... |
| 671 | MachineConstantPool *CP = F->getConstantPool(); |
| 672 | unsigned CPI = CP->getConstantPoolIndex(CFP); |
| 673 | const Type *Ty = CFP->getType(); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 674 | |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 675 | assert(Ty == Type::FloatTy || Ty == Type::DoubleTy && "Unknown FP type!"); |
Misha Brukman | fc879c3 | 2004-07-08 18:02:38 +0000 | [diff] [blame] | 676 | |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 677 | // Load addr of constant to reg; constant is located at base + distance |
| 678 | unsigned GlobalBase = makeAnotherReg(Type::IntTy); |
Misha Brukman | fc879c3 | 2004-07-08 18:02:38 +0000 | [diff] [blame] | 679 | unsigned Reg1 = makeAnotherReg(Type::IntTy); |
Nate Begeman | 07a7375 | 2004-08-17 07:17:44 +0000 | [diff] [blame] | 680 | unsigned Opcode = (Ty == Type::FloatTy) ? PPC::LFS : PPC::LFD; |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 681 | // Move value at base + distance into return reg |
| 682 | copyGlobalBaseToRegister(MBB, IP, GlobalBase); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 683 | BuildMI(*MBB, IP, PPC::LOADHiAddr, 2, Reg1).addReg(GlobalBase) |
Misha Brukman | fc879c3 | 2004-07-08 18:02:38 +0000 | [diff] [blame] | 684 | .addConstantPoolIndex(CPI); |
Nate Begeman | ed42853 | 2004-09-04 05:00:00 +0000 | [diff] [blame] | 685 | BuildMI(*MBB, IP, Opcode, 2, R).addConstantPoolIndex(CPI).addReg(Reg1); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 686 | } else if (isa<ConstantPointerNull>(C)) { |
| 687 | // Copy zero (null pointer) to the register. |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 688 | BuildMI(*MBB, IP, PPC::LI, 1, R).addSImm(0); |
Chris Lattner | 67910e1 | 2004-07-18 07:29:35 +0000 | [diff] [blame] | 689 | } else if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) { |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 690 | // GV is located at base + distance |
Nate Begeman | ed42853 | 2004-09-04 05:00:00 +0000 | [diff] [blame] | 691 | |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 692 | unsigned GlobalBase = makeAnotherReg(Type::IntTy); |
Misha Brukman | ba1c1da | 2004-07-20 00:59:38 +0000 | [diff] [blame] | 693 | unsigned TmpReg = makeAnotherReg(GV->getType()); |
Nate Begeman | 81d265d | 2004-08-19 05:20:54 +0000 | [diff] [blame] | 694 | unsigned Opcode = (GV->hasWeakLinkage() |
| 695 | || GV->isExternal() |
| 696 | || dyn_cast<Function>(GV)) ? PPC::LWZ : PPC::LA; |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 697 | |
| 698 | // Move value at base + distance into return reg |
| 699 | copyGlobalBaseToRegister(MBB, IP, GlobalBase); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 700 | BuildMI(*MBB, IP, PPC::LOADHiAddr, 2, TmpReg).addReg(GlobalBase) |
Misha Brukman | ba1c1da | 2004-07-20 00:59:38 +0000 | [diff] [blame] | 701 | .addGlobalAddress(GV); |
Nate Begeman | ed42853 | 2004-09-04 05:00:00 +0000 | [diff] [blame] | 702 | BuildMI(*MBB, IP, Opcode, 2, R).addGlobalAddress(GV).addReg(TmpReg); |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 703 | |
| 704 | // Add the GV to the list of things whose addresses have been taken. |
| 705 | TM.AddressTaken.insert(GV); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 706 | } else { |
Chris Lattner | 76e2df2 | 2004-07-15 02:14:30 +0000 | [diff] [blame] | 707 | std::cerr << "Offending constant: " << *C << "\n"; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 708 | assert(0 && "Type not handled yet!"); |
| 709 | } |
| 710 | } |
| 711 | |
| 712 | /// LoadArgumentsToVirtualRegs - Load all of the arguments to this function from |
| 713 | /// the stack into virtual registers. |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 714 | void PPC32ISel::LoadArgumentsToVirtualRegs(Function &Fn) { |
Chris Lattner | 3ea9346 | 2004-08-06 06:58:50 +0000 | [diff] [blame] | 715 | unsigned ArgOffset = 24; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 716 | unsigned GPR_remaining = 8; |
| 717 | unsigned FPR_remaining = 13; |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 718 | unsigned GPR_idx = 0, FPR_idx = 0; |
| 719 | static const unsigned GPR[] = { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 720 | PPC::R3, PPC::R4, PPC::R5, PPC::R6, |
| 721 | PPC::R7, PPC::R8, PPC::R9, PPC::R10, |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 722 | }; |
| 723 | static const unsigned FPR[] = { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 724 | PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7, |
| 725 | PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13 |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 726 | }; |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 727 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 728 | MachineFrameInfo *MFI = F->getFrameInfo(); |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 729 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 730 | for (Function::aiterator I = Fn.abegin(), E = Fn.aend(); I != E; ++I) { |
| 731 | bool ArgLive = !I->use_empty(); |
| 732 | unsigned Reg = ArgLive ? getReg(*I) : 0; |
| 733 | int FI; // Frame object index |
| 734 | |
| 735 | switch (getClassB(I->getType())) { |
| 736 | case cByte: |
| 737 | if (ArgLive) { |
Misha Brukman | ec6319a | 2004-07-20 15:51:37 +0000 | [diff] [blame] | 738 | FI = MFI->CreateFixedObject(4, ArgOffset); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 739 | if (GPR_remaining > 0) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 740 | BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]); |
| 741 | BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx]) |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 742 | .addReg(GPR[GPR_idx]); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 743 | } else { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 744 | addFrameReference(BuildMI(BB, PPC::LBZ, 2, Reg), FI); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 745 | } |
| 746 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 747 | break; |
| 748 | case cShort: |
| 749 | if (ArgLive) { |
Misha Brukman | ec6319a | 2004-07-20 15:51:37 +0000 | [diff] [blame] | 750 | FI = MFI->CreateFixedObject(4, ArgOffset); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 751 | if (GPR_remaining > 0) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 752 | BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]); |
| 753 | BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx]) |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 754 | .addReg(GPR[GPR_idx]); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 755 | } else { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 756 | addFrameReference(BuildMI(BB, PPC::LHZ, 2, Reg), FI); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 757 | } |
| 758 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 759 | break; |
| 760 | case cInt: |
| 761 | if (ArgLive) { |
| 762 | FI = MFI->CreateFixedObject(4, ArgOffset); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 763 | if (GPR_remaining > 0) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 764 | BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]); |
| 765 | BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx]) |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 766 | .addReg(GPR[GPR_idx]); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 767 | } else { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 768 | addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg), FI); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 769 | } |
| 770 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 771 | break; |
| 772 | case cLong: |
| 773 | if (ArgLive) { |
| 774 | FI = MFI->CreateFixedObject(8, ArgOffset); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 775 | if (GPR_remaining > 1) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 776 | BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx]); |
| 777 | BuildMI(BB, PPC::IMPLICIT_DEF, 0, GPR[GPR_idx+1]); |
| 778 | BuildMI(BB, PPC::OR, 2, Reg).addReg(GPR[GPR_idx]) |
Misha Brukman | 313efcb | 2004-07-09 15:45:07 +0000 | [diff] [blame] | 779 | .addReg(GPR[GPR_idx]); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 780 | BuildMI(BB, PPC::OR, 2, Reg+1).addReg(GPR[GPR_idx+1]) |
Misha Brukman | 313efcb | 2004-07-09 15:45:07 +0000 | [diff] [blame] | 781 | .addReg(GPR[GPR_idx+1]); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 782 | } else { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 783 | addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg), FI); |
| 784 | addFrameReference(BuildMI(BB, PPC::LWZ, 2, Reg+1), FI, 4); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 785 | } |
| 786 | } |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 787 | // longs require 4 additional bytes and use 2 GPRs |
| 788 | ArgOffset += 4; |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 789 | if (GPR_remaining > 1) { |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 790 | GPR_remaining--; |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 791 | GPR_idx++; |
| 792 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 793 | break; |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 794 | case cFP32: |
| 795 | if (ArgLive) { |
| 796 | FI = MFI->CreateFixedObject(4, ArgOffset); |
| 797 | |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 798 | if (FPR_remaining > 0) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 799 | BuildMI(BB, PPC::IMPLICIT_DEF, 0, FPR[FPR_idx]); |
| 800 | BuildMI(BB, PPC::FMR, 1, Reg).addReg(FPR[FPR_idx]); |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 801 | FPR_remaining--; |
| 802 | FPR_idx++; |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 803 | } else { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 804 | addFrameReference(BuildMI(BB, PPC::LFS, 2, Reg), FI); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 805 | } |
| 806 | } |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 807 | break; |
| 808 | case cFP64: |
| 809 | if (ArgLive) { |
| 810 | FI = MFI->CreateFixedObject(8, ArgOffset); |
| 811 | |
| 812 | if (FPR_remaining > 0) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 813 | BuildMI(BB, PPC::IMPLICIT_DEF, 0, FPR[FPR_idx]); |
| 814 | BuildMI(BB, PPC::FMR, 1, Reg).addReg(FPR[FPR_idx]); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 815 | FPR_remaining--; |
| 816 | FPR_idx++; |
| 817 | } else { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 818 | addFrameReference(BuildMI(BB, PPC::LFD, 2, Reg), FI); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 819 | } |
| 820 | } |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 821 | |
| 822 | // doubles require 4 additional bytes and use 2 GPRs of param space |
| 823 | ArgOffset += 4; |
| 824 | if (GPR_remaining > 0) { |
| 825 | GPR_remaining--; |
| 826 | GPR_idx++; |
| 827 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 828 | break; |
| 829 | default: |
| 830 | assert(0 && "Unhandled argument type!"); |
| 831 | } |
| 832 | ArgOffset += 4; // Each argument takes at least 4 bytes on the stack... |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 833 | if (GPR_remaining > 0) { |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 834 | GPR_remaining--; // uses up 2 GPRs |
| 835 | GPR_idx++; |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 836 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 837 | } |
| 838 | |
| 839 | // If the function takes variable number of arguments, add a frame offset for |
| 840 | // the start of the first vararg value... this is used to expand |
| 841 | // llvm.va_start. |
| 842 | if (Fn.getFunctionType()->isVarArg()) |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 843 | VarArgsFrameIndex = MFI->CreateFixedObject(4, ArgOffset); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 844 | } |
| 845 | |
| 846 | |
| 847 | /// SelectPHINodes - Insert machine code to generate phis. This is tricky |
| 848 | /// because we have to generate our sources into the source basic blocks, not |
| 849 | /// the current one. |
| 850 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 851 | void PPC32ISel::SelectPHINodes() { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 852 | const TargetInstrInfo &TII = *TM.getInstrInfo(); |
| 853 | const Function &LF = *F->getFunction(); // The LLVM function... |
| 854 | for (Function::const_iterator I = LF.begin(), E = LF.end(); I != E; ++I) { |
| 855 | const BasicBlock *BB = I; |
| 856 | MachineBasicBlock &MBB = *MBBMap[I]; |
| 857 | |
| 858 | // Loop over all of the PHI nodes in the LLVM basic block... |
| 859 | MachineBasicBlock::iterator PHIInsertPoint = MBB.begin(); |
| 860 | for (BasicBlock::const_iterator I = BB->begin(); |
| 861 | PHINode *PN = const_cast<PHINode*>(dyn_cast<PHINode>(I)); ++I) { |
| 862 | |
| 863 | // Create a new machine instr PHI node, and insert it. |
| 864 | unsigned PHIReg = getReg(*PN); |
| 865 | MachineInstr *PhiMI = BuildMI(MBB, PHIInsertPoint, |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 866 | PPC::PHI, PN->getNumOperands(), PHIReg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 867 | |
| 868 | MachineInstr *LongPhiMI = 0; |
| 869 | if (PN->getType() == Type::LongTy || PN->getType() == Type::ULongTy) |
| 870 | LongPhiMI = BuildMI(MBB, PHIInsertPoint, |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 871 | PPC::PHI, PN->getNumOperands(), PHIReg+1); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 872 | |
| 873 | // PHIValues - Map of blocks to incoming virtual registers. We use this |
| 874 | // so that we only initialize one incoming value for a particular block, |
| 875 | // even if the block has multiple entries in the PHI node. |
| 876 | // |
| 877 | std::map<MachineBasicBlock*, unsigned> PHIValues; |
| 878 | |
| 879 | for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) { |
Misha Brukman | 313efcb | 2004-07-09 15:45:07 +0000 | [diff] [blame] | 880 | MachineBasicBlock *PredMBB = 0; |
| 881 | for (MachineBasicBlock::pred_iterator PI = MBB.pred_begin (), |
| 882 | PE = MBB.pred_end (); PI != PE; ++PI) |
| 883 | if (PN->getIncomingBlock(i) == (*PI)->getBasicBlock()) { |
| 884 | PredMBB = *PI; |
| 885 | break; |
| 886 | } |
| 887 | assert (PredMBB && "Couldn't find incoming machine-cfg edge for phi"); |
| 888 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 889 | unsigned ValReg; |
| 890 | std::map<MachineBasicBlock*, unsigned>::iterator EntryIt = |
| 891 | PHIValues.lower_bound(PredMBB); |
| 892 | |
| 893 | if (EntryIt != PHIValues.end() && EntryIt->first == PredMBB) { |
| 894 | // We already inserted an initialization of the register for this |
| 895 | // predecessor. Recycle it. |
| 896 | ValReg = EntryIt->second; |
Misha Brukman | 4722544 | 2004-07-23 22:35:49 +0000 | [diff] [blame] | 897 | } else { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 898 | // Get the incoming value into a virtual register. |
| 899 | // |
| 900 | Value *Val = PN->getIncomingValue(i); |
| 901 | |
| 902 | // If this is a constant or GlobalValue, we may have to insert code |
| 903 | // into the basic block to compute it into a virtual register. |
| 904 | if ((isa<Constant>(Val) && !isa<ConstantExpr>(Val)) || |
| 905 | isa<GlobalValue>(Val)) { |
| 906 | // Simple constants get emitted at the end of the basic block, |
| 907 | // before any terminator instructions. We "know" that the code to |
| 908 | // move a constant into a register will never clobber any flags. |
| 909 | ValReg = getReg(Val, PredMBB, PredMBB->getFirstTerminator()); |
| 910 | } else { |
| 911 | // Because we don't want to clobber any values which might be in |
| 912 | // physical registers with the computation of this constant (which |
| 913 | // might be arbitrarily complex if it is a constant expression), |
| 914 | // just insert the computation at the top of the basic block. |
| 915 | MachineBasicBlock::iterator PI = PredMBB->begin(); |
Misha Brukman | 4722544 | 2004-07-23 22:35:49 +0000 | [diff] [blame] | 916 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 917 | // Skip over any PHI nodes though! |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 918 | while (PI != PredMBB->end() && PI->getOpcode() == PPC::PHI) |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 919 | ++PI; |
Misha Brukman | 4722544 | 2004-07-23 22:35:49 +0000 | [diff] [blame] | 920 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 921 | ValReg = getReg(Val, PredMBB, PI); |
| 922 | } |
| 923 | |
| 924 | // Remember that we inserted a value for this PHI for this predecessor |
| 925 | PHIValues.insert(EntryIt, std::make_pair(PredMBB, ValReg)); |
| 926 | } |
| 927 | |
| 928 | PhiMI->addRegOperand(ValReg); |
| 929 | PhiMI->addMachineBasicBlockOperand(PredMBB); |
| 930 | if (LongPhiMI) { |
| 931 | LongPhiMI->addRegOperand(ValReg+1); |
| 932 | LongPhiMI->addMachineBasicBlockOperand(PredMBB); |
| 933 | } |
| 934 | } |
| 935 | |
| 936 | // Now that we emitted all of the incoming values for the PHI node, make |
| 937 | // sure to reposition the InsertPoint after the PHI that we just added. |
| 938 | // This is needed because we might have inserted a constant into this |
| 939 | // block, right after the PHI's which is before the old insert point! |
| 940 | PHIInsertPoint = LongPhiMI ? LongPhiMI : PhiMI; |
| 941 | ++PHIInsertPoint; |
| 942 | } |
| 943 | } |
| 944 | } |
| 945 | |
| 946 | |
| 947 | // canFoldSetCCIntoBranchOrSelect - Return the setcc instruction if we can fold |
| 948 | // it into the conditional branch or select instruction which is the only user |
| 949 | // of the cc instruction. This is the case if the conditional branch is the |
| 950 | // only user of the setcc, and if the setcc is in the same basic block as the |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 951 | // conditional branch. |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 952 | // |
| 953 | static SetCondInst *canFoldSetCCIntoBranchOrSelect(Value *V) { |
| 954 | if (SetCondInst *SCI = dyn_cast<SetCondInst>(V)) |
| 955 | if (SCI->hasOneUse()) { |
| 956 | Instruction *User = cast<Instruction>(SCI->use_back()); |
| 957 | if ((isa<BranchInst>(User) || isa<SelectInst>(User)) && |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 958 | SCI->getParent() == User->getParent()) |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 959 | return SCI; |
| 960 | } |
| 961 | return 0; |
| 962 | } |
| 963 | |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 964 | // canFoldGEPIntoLoadOrStore - Return the GEP instruction if we can fold it into |
| 965 | // the load or store instruction that is the only user of the GEP. |
| 966 | // |
| 967 | static GetElementPtrInst *canFoldGEPIntoLoadOrStore(Value *V) { |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 968 | if (GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(V)) { |
| 969 | bool AllUsesAreMem = true; |
| 970 | for (Value::use_iterator I = GEPI->use_begin(), E = GEPI->use_end(); |
| 971 | I != E; ++I) { |
| 972 | Instruction *User = cast<Instruction>(*I); |
| 973 | |
| 974 | // If the GEP is the target of a store, but not the source, then we are ok |
| 975 | // to fold it. |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 976 | if (isa<StoreInst>(User) && |
| 977 | GEPI->getParent() == User->getParent() && |
| 978 | User->getOperand(0) != GEPI && |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 979 | User->getOperand(1) == GEPI) |
| 980 | continue; |
| 981 | |
| 982 | // If the GEP is the source of a load, then we're always ok to fold it |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 983 | if (isa<LoadInst>(User) && |
| 984 | GEPI->getParent() == User->getParent() && |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 985 | User->getOperand(0) == GEPI) |
| 986 | continue; |
| 987 | |
| 988 | // if we got to this point, than the instruction was not a load or store |
| 989 | // that we are capable of folding the GEP into. |
| 990 | AllUsesAreMem = false; |
| 991 | break; |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 992 | } |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 993 | if (AllUsesAreMem) |
| 994 | return GEPI; |
| 995 | } |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 996 | return 0; |
| 997 | } |
| 998 | |
| 999 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1000 | // Return a fixed numbering for setcc instructions which does not depend on the |
| 1001 | // order of the opcodes. |
| 1002 | // |
| 1003 | static unsigned getSetCCNumber(unsigned Opcode) { |
Misha Brukman | e9c6551 | 2004-07-06 15:32:44 +0000 | [diff] [blame] | 1004 | switch (Opcode) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1005 | default: assert(0 && "Unknown setcc instruction!"); |
| 1006 | case Instruction::SetEQ: return 0; |
| 1007 | case Instruction::SetNE: return 1; |
| 1008 | case Instruction::SetLT: return 2; |
| 1009 | case Instruction::SetGE: return 3; |
| 1010 | case Instruction::SetGT: return 4; |
| 1011 | case Instruction::SetLE: return 5; |
| 1012 | } |
| 1013 | } |
| 1014 | |
Misha Brukman | e9c6551 | 2004-07-06 15:32:44 +0000 | [diff] [blame] | 1015 | static unsigned getPPCOpcodeForSetCCNumber(unsigned Opcode) { |
| 1016 | switch (Opcode) { |
| 1017 | default: assert(0 && "Unknown setcc instruction!"); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1018 | case Instruction::SetEQ: return PPC::BEQ; |
| 1019 | case Instruction::SetNE: return PPC::BNE; |
| 1020 | case Instruction::SetLT: return PPC::BLT; |
| 1021 | case Instruction::SetGE: return PPC::BGE; |
| 1022 | case Instruction::SetGT: return PPC::BGT; |
| 1023 | case Instruction::SetLE: return PPC::BLE; |
Misha Brukman | e9c6551 | 2004-07-06 15:32:44 +0000 | [diff] [blame] | 1024 | } |
| 1025 | } |
| 1026 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1027 | /// emitUCOM - emits an unordered FP compare. |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 1028 | void PPC32ISel::emitUCOM(MachineBasicBlock *MBB, MachineBasicBlock::iterator IP, |
| 1029 | unsigned LHS, unsigned RHS) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1030 | BuildMI(*MBB, IP, PPC::FCMPU, 2, PPC::CR0).addReg(LHS).addReg(RHS); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1031 | } |
| 1032 | |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 1033 | unsigned PPC32ISel::ExtendOrClear(MachineBasicBlock *MBB, |
| 1034 | MachineBasicBlock::iterator IP, |
Nate Begeman | a2de102 | 2004-09-22 04:40:25 +0000 | [diff] [blame] | 1035 | Value *Op0) { |
Nate Begeman | 0e5e5f5 | 2004-08-22 08:10:15 +0000 | [diff] [blame] | 1036 | const Type *CompTy = Op0->getType(); |
| 1037 | unsigned Reg = getReg(Op0, MBB, IP); |
Nate Begeman | b47321b | 2004-08-20 09:56:22 +0000 | [diff] [blame] | 1038 | unsigned Class = getClassB(CompTy); |
| 1039 | |
Nate Begeman | 1b99fd3 | 2004-09-29 03:45:33 +0000 | [diff] [blame] | 1040 | // Since we know that boolean values will be either zero or one, we don't |
| 1041 | // have to extend or clear them. |
| 1042 | if (CompTy == Type::BoolTy) |
| 1043 | return Reg; |
| 1044 | |
Nate Begeman | b47321b | 2004-08-20 09:56:22 +0000 | [diff] [blame] | 1045 | // Before we do a comparison or SetCC, we have to make sure that we truncate |
| 1046 | // the source registers appropriately. |
| 1047 | if (Class == cByte) { |
| 1048 | unsigned TmpReg = makeAnotherReg(CompTy); |
| 1049 | if (CompTy->isSigned()) |
| 1050 | BuildMI(*MBB, IP, PPC::EXTSB, 1, TmpReg).addReg(Reg); |
| 1051 | else |
| 1052 | BuildMI(*MBB, IP, PPC::RLWINM, 4, TmpReg).addReg(Reg).addImm(0) |
| 1053 | .addImm(24).addImm(31); |
| 1054 | Reg = TmpReg; |
| 1055 | } else if (Class == cShort) { |
| 1056 | unsigned TmpReg = makeAnotherReg(CompTy); |
| 1057 | if (CompTy->isSigned()) |
| 1058 | BuildMI(*MBB, IP, PPC::EXTSH, 1, TmpReg).addReg(Reg); |
| 1059 | else |
| 1060 | BuildMI(*MBB, IP, PPC::RLWINM, 4, TmpReg).addReg(Reg).addImm(0) |
| 1061 | .addImm(16).addImm(31); |
| 1062 | Reg = TmpReg; |
| 1063 | } |
| 1064 | return Reg; |
| 1065 | } |
| 1066 | |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 1067 | /// EmitComparison - emits a comparison of the two operands, returning the |
| 1068 | /// extended setcc code to use. The result is in CR0. |
| 1069 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 1070 | unsigned PPC32ISel::EmitComparison(unsigned OpNum, Value *Op0, Value *Op1, |
| 1071 | MachineBasicBlock *MBB, |
| 1072 | MachineBasicBlock::iterator IP) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1073 | // The arguments are already supposed to be of the same type. |
| 1074 | const Type *CompTy = Op0->getType(); |
| 1075 | unsigned Class = getClassB(CompTy); |
Nate Begeman | a2de102 | 2004-09-22 04:40:25 +0000 | [diff] [blame] | 1076 | unsigned Op0r = ExtendOrClear(MBB, IP, Op0); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 1077 | |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1078 | // Use crand for lt, gt and crandc for le, ge |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1079 | unsigned CROpcode = (OpNum == 2 || OpNum == 4) ? PPC::CRAND : PPC::CRANDC; |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1080 | // ? cr1[lt] : cr1[gt] |
| 1081 | unsigned CR1field = (OpNum == 2 || OpNum == 3) ? 4 : 5; |
| 1082 | // ? cr0[lt] : cr0[gt] |
| 1083 | unsigned CR0field = (OpNum == 2 || OpNum == 5) ? 0 : 1; |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1084 | unsigned Opcode = CompTy->isSigned() ? PPC::CMPW : PPC::CMPLW; |
| 1085 | unsigned OpcodeImm = CompTy->isSigned() ? PPC::CMPWI : PPC::CMPLWI; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1086 | |
| 1087 | // Special case handling of: cmp R, i |
Misha Brukman | 2ed17ca | 2004-07-22 15:58:04 +0000 | [diff] [blame] | 1088 | if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1089 | if (Class == cByte || Class == cShort || Class == cInt) { |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1090 | unsigned Op1v = CI->getRawValue() & 0xFFFF; |
Nate Begeman | 43d64ea | 2004-08-15 06:42:28 +0000 | [diff] [blame] | 1091 | unsigned OpClass = (CompTy->isSigned()) ? 0 : 2; |
| 1092 | |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1093 | // Treat compare like ADDI for the purposes of immediate suitability |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 1094 | if (canUseAsImmediateForOpcode(CI, OpClass, false)) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1095 | BuildMI(*MBB, IP, OpcodeImm, 2, PPC::CR0).addReg(Op0r).addSImm(Op1v); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 1096 | } else { |
| 1097 | unsigned Op1r = getReg(Op1, MBB, IP); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1098 | BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 1099 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1100 | return OpNum; |
| 1101 | } else { |
| 1102 | assert(Class == cLong && "Unknown integer class!"); |
| 1103 | unsigned LowCst = CI->getRawValue(); |
| 1104 | unsigned HiCst = CI->getRawValue() >> 32; |
| 1105 | if (OpNum < 2) { // seteq, setne |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1106 | unsigned LoLow = makeAnotherReg(Type::IntTy); |
| 1107 | unsigned LoTmp = makeAnotherReg(Type::IntTy); |
| 1108 | unsigned HiLow = makeAnotherReg(Type::IntTy); |
| 1109 | unsigned HiTmp = makeAnotherReg(Type::IntTy); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1110 | unsigned FinalTmp = makeAnotherReg(Type::IntTy); |
Misha Brukman | 4722544 | 2004-07-23 22:35:49 +0000 | [diff] [blame] | 1111 | |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1112 | BuildMI(*MBB, IP, PPC::XORI, 2, LoLow).addReg(Op0r+1) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1113 | .addImm(LowCst & 0xFFFF); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1114 | BuildMI(*MBB, IP, PPC::XORIS, 2, LoTmp).addReg(LoLow) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1115 | .addImm(LowCst >> 16); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1116 | BuildMI(*MBB, IP, PPC::XORI, 2, HiLow).addReg(Op0r) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1117 | .addImm(HiCst & 0xFFFF); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1118 | BuildMI(*MBB, IP, PPC::XORIS, 2, HiTmp).addReg(HiLow) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1119 | .addImm(HiCst >> 16); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1120 | BuildMI(*MBB, IP, PPC::ORo, 2, FinalTmp).addReg(LoTmp).addReg(HiTmp); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1121 | return OpNum; |
| 1122 | } else { |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 1123 | unsigned ConstReg = makeAnotherReg(CompTy); |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 1124 | copyConstantToRegister(MBB, IP, CI, ConstReg); |
Misha Brukman | 4722544 | 2004-07-23 22:35:49 +0000 | [diff] [blame] | 1125 | |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1126 | // cr0 = r3 ccOpcode r5 or (r3 == r5 AND r4 ccOpcode r6) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1127 | BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r) |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 1128 | .addReg(ConstReg); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1129 | BuildMI(*MBB, IP, Opcode, 2, PPC::CR1).addReg(Op0r+1) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1130 | .addReg(ConstReg+1); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1131 | BuildMI(*MBB, IP, PPC::CRAND, 3).addImm(2).addImm(2).addImm(CR1field); |
| 1132 | BuildMI(*MBB, IP, PPC::CROR, 3).addImm(CR0field).addImm(CR0field) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1133 | .addImm(2); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 1134 | return OpNum; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1135 | } |
| 1136 | } |
| 1137 | } |
| 1138 | |
| 1139 | unsigned Op1r = getReg(Op1, MBB, IP); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1140 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1141 | switch (Class) { |
| 1142 | default: assert(0 && "Unknown type class!"); |
| 1143 | case cByte: |
| 1144 | case cShort: |
| 1145 | case cInt: |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1146 | BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1147 | break; |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 1148 | |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1149 | case cFP32: |
| 1150 | case cFP64: |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1151 | emitUCOM(MBB, IP, Op0r, Op1r); |
| 1152 | break; |
| 1153 | |
| 1154 | case cLong: |
| 1155 | if (OpNum < 2) { // seteq, setne |
| 1156 | unsigned LoTmp = makeAnotherReg(Type::IntTy); |
| 1157 | unsigned HiTmp = makeAnotherReg(Type::IntTy); |
| 1158 | unsigned FinalTmp = makeAnotherReg(Type::IntTy); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1159 | BuildMI(*MBB, IP, PPC::XOR, 2, HiTmp).addReg(Op0r).addReg(Op1r); |
| 1160 | BuildMI(*MBB, IP, PPC::XOR, 2, LoTmp).addReg(Op0r+1).addReg(Op1r+1); |
| 1161 | BuildMI(*MBB, IP, PPC::ORo, 2, FinalTmp).addReg(LoTmp).addReg(HiTmp); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1162 | break; // Allow the sete or setne to be generated from flags set by OR |
| 1163 | } else { |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 1164 | unsigned TmpReg1 = makeAnotherReg(Type::IntTy); |
| 1165 | unsigned TmpReg2 = makeAnotherReg(Type::IntTy); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1166 | |
| 1167 | // cr0 = r3 ccOpcode r5 or (r3 == r5 AND r4 ccOpcode r6) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1168 | BuildMI(*MBB, IP, Opcode, 2, PPC::CR0).addReg(Op0r).addReg(Op1r); |
| 1169 | BuildMI(*MBB, IP, Opcode, 2, PPC::CR1).addReg(Op0r+1).addReg(Op1r+1); |
| 1170 | BuildMI(*MBB, IP, PPC::CRAND, 3).addImm(2).addImm(2).addImm(CR1field); |
| 1171 | BuildMI(*MBB, IP, PPC::CROR, 3).addImm(CR0field).addImm(CR0field) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1172 | .addImm(2); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1173 | return OpNum; |
| 1174 | } |
| 1175 | } |
| 1176 | return OpNum; |
| 1177 | } |
| 1178 | |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 1179 | /// visitSetCondInst - emit code to calculate the condition via |
| 1180 | /// EmitComparison(), and possibly store a 0 or 1 to a register as a result |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1181 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 1182 | void PPC32ISel::visitSetCondInst(SetCondInst &I) { |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 1183 | if (canFoldSetCCIntoBranchOrSelect(&I)) |
Misha Brukman | e9c6551 | 2004-07-06 15:32:44 +0000 | [diff] [blame] | 1184 | return; |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 1185 | |
Nate Begeman | a2de102 | 2004-09-22 04:40:25 +0000 | [diff] [blame] | 1186 | MachineBasicBlock::iterator MI = BB->end(); |
| 1187 | Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1); |
| 1188 | const Type *Ty = Op0->getType(); |
| 1189 | unsigned Class = getClassB(Ty); |
Nate Begeman | a96c4af | 2004-08-21 20:42:14 +0000 | [diff] [blame] | 1190 | unsigned Opcode = I.getOpcode(); |
Nate Begeman | a2de102 | 2004-09-22 04:40:25 +0000 | [diff] [blame] | 1191 | unsigned OpNum = getSetCCNumber(Opcode); |
| 1192 | unsigned DestReg = getReg(I); |
| 1193 | |
| 1194 | // If the comparison type is byte, short, or int, then we can emit a |
| 1195 | // branchless version of the SetCC that puts 0 (false) or 1 (true) in the |
| 1196 | // destination register. |
| 1197 | if (Class <= cInt) { |
| 1198 | ConstantInt *CI = dyn_cast<ConstantInt>(Op1); |
| 1199 | |
| 1200 | if (CI && CI->getRawValue() == 0) { |
Nate Begeman | a2de102 | 2004-09-22 04:40:25 +0000 | [diff] [blame] | 1201 | unsigned Op0Reg = ExtendOrClear(BB, MI, Op0); |
| 1202 | |
| 1203 | // comparisons against constant zero and negative one often have shorter |
| 1204 | // and/or faster sequences than the set-and-branch general case, handled |
| 1205 | // below. |
| 1206 | switch(OpNum) { |
| 1207 | case 0: { // eq0 |
| 1208 | unsigned TempReg = makeAnotherReg(Type::IntTy); |
| 1209 | BuildMI(*BB, MI, PPC::CNTLZW, 1, TempReg).addReg(Op0Reg); |
| 1210 | BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(TempReg).addImm(27) |
| 1211 | .addImm(5).addImm(31); |
| 1212 | break; |
| 1213 | } |
| 1214 | case 1: { // ne0 |
| 1215 | unsigned TempReg = makeAnotherReg(Type::IntTy); |
| 1216 | BuildMI(*BB, MI, PPC::ADDIC, 2, TempReg).addReg(Op0Reg).addSImm(-1); |
| 1217 | BuildMI(*BB, MI, PPC::SUBFE, 2, DestReg).addReg(TempReg).addReg(Op0Reg); |
| 1218 | break; |
| 1219 | } |
| 1220 | case 2: { // lt0, always false if unsigned |
| 1221 | if (Ty->isSigned()) |
| 1222 | BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Op0Reg).addImm(1) |
| 1223 | .addImm(31).addImm(31); |
| 1224 | else |
| 1225 | BuildMI(*BB, MI, PPC::LI, 1, DestReg).addSImm(0); |
| 1226 | break; |
| 1227 | } |
| 1228 | case 3: { // ge0, always true if unsigned |
| 1229 | if (Ty->isSigned()) { |
| 1230 | unsigned TempReg = makeAnotherReg(Type::IntTy); |
| 1231 | BuildMI(*BB, MI, PPC::RLWINM, 4, TempReg).addReg(Op0Reg).addImm(1) |
| 1232 | .addImm(31).addImm(31); |
| 1233 | BuildMI(*BB, MI, PPC::XORI, 2, DestReg).addReg(TempReg).addImm(1); |
| 1234 | } else { |
| 1235 | BuildMI(*BB, MI, PPC::LI, 1, DestReg).addSImm(1); |
| 1236 | } |
| 1237 | break; |
| 1238 | } |
| 1239 | case 4: { // gt0, equivalent to ne0 if unsigned |
| 1240 | unsigned Temp1 = makeAnotherReg(Type::IntTy); |
| 1241 | unsigned Temp2 = makeAnotherReg(Type::IntTy); |
| 1242 | if (Ty->isSigned()) { |
| 1243 | BuildMI(*BB, MI, PPC::NEG, 2, Temp1).addReg(Op0Reg); |
| 1244 | BuildMI(*BB, MI, PPC::ANDC, 2, Temp2).addReg(Temp1).addReg(Op0Reg); |
| 1245 | BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp2).addImm(1) |
| 1246 | .addImm(31).addImm(31); |
| 1247 | } else { |
| 1248 | BuildMI(*BB, MI, PPC::ADDIC, 2, Temp1).addReg(Op0Reg).addSImm(-1); |
| 1249 | BuildMI(*BB, MI, PPC::SUBFE, 2, DestReg).addReg(Temp1).addReg(Op0Reg); |
| 1250 | } |
| 1251 | break; |
| 1252 | } |
| 1253 | case 5: { // le0, equivalent to eq0 if unsigned |
| 1254 | unsigned Temp1 = makeAnotherReg(Type::IntTy); |
| 1255 | unsigned Temp2 = makeAnotherReg(Type::IntTy); |
| 1256 | if (Ty->isSigned()) { |
| 1257 | BuildMI(*BB, MI, PPC::NEG, 2, Temp1).addReg(Op0Reg); |
| 1258 | BuildMI(*BB, MI, PPC::ORC, 2, Temp2).addReg(Op0Reg).addReg(Temp1); |
| 1259 | BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp2).addImm(1) |
| 1260 | .addImm(31).addImm(31); |
| 1261 | } else { |
| 1262 | BuildMI(*BB, MI, PPC::CNTLZW, 1, Temp1).addReg(Op0Reg); |
| 1263 | BuildMI(*BB, MI, PPC::RLWINM, 4, DestReg).addReg(Temp1).addImm(27) |
| 1264 | .addImm(5).addImm(31); |
| 1265 | } |
| 1266 | break; |
| 1267 | } |
| 1268 | } // switch |
| 1269 | return; |
| 1270 | } |
| 1271 | } |
Nate Begeman | b47321b | 2004-08-20 09:56:22 +0000 | [diff] [blame] | 1272 | unsigned PPCOpcode = getPPCOpcodeForSetCCNumber(Opcode); |
Nate Begeman | a96c4af | 2004-08-21 20:42:14 +0000 | [diff] [blame] | 1273 | |
| 1274 | // Create an iterator with which to insert the MBB for copying the false value |
| 1275 | // and the MBB to hold the PHI instruction for this SetCC. |
Misha Brukman | 425ff24 | 2004-07-01 21:34:10 +0000 | [diff] [blame] | 1276 | MachineBasicBlock *thisMBB = BB; |
| 1277 | const BasicBlock *LLVM_BB = BB->getBasicBlock(); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1278 | ilist<MachineBasicBlock>::iterator It = BB; |
| 1279 | ++It; |
| 1280 | |
Misha Brukman | 425ff24 | 2004-07-01 21:34:10 +0000 | [diff] [blame] | 1281 | // thisMBB: |
| 1282 | // ... |
| 1283 | // cmpTY cr0, r1, r2 |
Misha Brukman | 425ff24 | 2004-07-01 21:34:10 +0000 | [diff] [blame] | 1284 | // %TrueValue = li 1 |
Nate Begeman | a96c4af | 2004-08-21 20:42:14 +0000 | [diff] [blame] | 1285 | // bCC sinkMBB |
Nate Begeman | a2de102 | 2004-09-22 04:40:25 +0000 | [diff] [blame] | 1286 | EmitComparison(Opcode, Op0, Op1, BB, BB->end()); |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 1287 | unsigned TrueValue = makeAnotherReg(I.getType()); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1288 | BuildMI(BB, PPC::LI, 1, TrueValue).addSImm(1); |
Nate Begeman | a96c4af | 2004-08-21 20:42:14 +0000 | [diff] [blame] | 1289 | MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB); |
| 1290 | MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB); |
| 1291 | BuildMI(BB, PPCOpcode, 2).addReg(PPC::CR0).addMBB(sinkMBB); |
| 1292 | F->getBasicBlockList().insert(It, copy0MBB); |
| 1293 | F->getBasicBlockList().insert(It, sinkMBB); |
Misha Brukman | 425ff24 | 2004-07-01 21:34:10 +0000 | [diff] [blame] | 1294 | // Update machine-CFG edges |
Nate Begeman | a96c4af | 2004-08-21 20:42:14 +0000 | [diff] [blame] | 1295 | BB->addSuccessor(copy0MBB); |
Misha Brukman | 425ff24 | 2004-07-01 21:34:10 +0000 | [diff] [blame] | 1296 | BB->addSuccessor(sinkMBB); |
| 1297 | |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1298 | // copy0MBB: |
| 1299 | // %FalseValue = li 0 |
| 1300 | // fallthrough |
| 1301 | BB = copy0MBB; |
| 1302 | unsigned FalseValue = makeAnotherReg(I.getType()); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1303 | BuildMI(BB, PPC::LI, 1, FalseValue).addSImm(0); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1304 | // Update machine-CFG edges |
| 1305 | BB->addSuccessor(sinkMBB); |
| 1306 | |
Misha Brukman | 425ff24 | 2004-07-01 21:34:10 +0000 | [diff] [blame] | 1307 | // sinkMBB: |
Nate Begeman | a96c4af | 2004-08-21 20:42:14 +0000 | [diff] [blame] | 1308 | // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ] |
Misha Brukman | 425ff24 | 2004-07-01 21:34:10 +0000 | [diff] [blame] | 1309 | // ... |
| 1310 | BB = sinkMBB; |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1311 | BuildMI(BB, PPC::PHI, 4, DestReg).addReg(FalseValue) |
Nate Begeman | a96c4af | 2004-08-21 20:42:14 +0000 | [diff] [blame] | 1312 | .addMBB(copy0MBB).addReg(TrueValue).addMBB(thisMBB); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1313 | } |
| 1314 | |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 1315 | void PPC32ISel::visitSelectInst(SelectInst &SI) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1316 | unsigned DestReg = getReg(SI); |
| 1317 | MachineBasicBlock::iterator MII = BB->end(); |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 1318 | emitSelectOperation(BB, MII, SI.getCondition(), SI.getTrueValue(), |
| 1319 | SI.getFalseValue(), DestReg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1320 | } |
| 1321 | |
| 1322 | /// emitSelect - Common code shared between visitSelectInst and the constant |
| 1323 | /// expression support. |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 1324 | void PPC32ISel::emitSelectOperation(MachineBasicBlock *MBB, |
| 1325 | MachineBasicBlock::iterator IP, |
| 1326 | Value *Cond, Value *TrueVal, |
| 1327 | Value *FalseVal, unsigned DestReg) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1328 | unsigned SelectClass = getClassB(TrueVal->getType()); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1329 | unsigned Opcode; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1330 | |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 1331 | // See if we can fold the setcc into the select instruction, or if we have |
| 1332 | // to get the register of the Cond value |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 1333 | if (SetCondInst *SCI = canFoldSetCCIntoBranchOrSelect(Cond)) { |
| 1334 | // We successfully folded the setcc into the select instruction. |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 1335 | unsigned OpNum = getSetCCNumber(SCI->getOpcode()); |
Nate Begeman | 087d5d9 | 2004-10-06 09:53:04 +0000 | [diff] [blame] | 1336 | if (OpNum >= 2 && OpNum <= 5) { |
| 1337 | unsigned SetCondClass = getClassB(SCI->getOperand(0)->getType()); |
| 1338 | if ((SetCondClass == cFP32 || SetCondClass == cFP64) && |
| 1339 | (SelectClass == cFP32 || SelectClass == cFP64)) { |
| 1340 | unsigned CondReg = getReg(SCI->getOperand(0), MBB, IP); |
| 1341 | unsigned TrueReg = getReg(TrueVal, MBB, IP); |
| 1342 | unsigned FalseReg = getReg(FalseVal, MBB, IP); |
| 1343 | // if the comparison of the floating point value used to for the select |
| 1344 | // is against 0, then we can emit an fsel without subtraction. |
| 1345 | ConstantFP *Op1C = dyn_cast<ConstantFP>(SCI->getOperand(1)); |
| 1346 | if (Op1C && (Op1C->isExactlyValue(-0.0) || Op1C->isExactlyValue(0.0))) { |
| 1347 | switch(OpNum) { |
| 1348 | case 2: // LT |
| 1349 | BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(CondReg) |
| 1350 | .addReg(FalseReg).addReg(TrueReg); |
| 1351 | break; |
| 1352 | case 3: // GE == !LT |
| 1353 | BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(CondReg) |
| 1354 | .addReg(TrueReg).addReg(FalseReg); |
| 1355 | break; |
| 1356 | case 4: { // GT |
| 1357 | unsigned NegatedReg = makeAnotherReg(SCI->getOperand(0)->getType()); |
| 1358 | BuildMI(*MBB, IP, PPC::FNEG, 1, NegatedReg).addReg(CondReg); |
| 1359 | BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(NegatedReg) |
| 1360 | .addReg(FalseReg).addReg(TrueReg); |
| 1361 | } |
| 1362 | break; |
| 1363 | case 5: { // LE == !GT |
| 1364 | unsigned NegatedReg = makeAnotherReg(SCI->getOperand(0)->getType()); |
| 1365 | BuildMI(*MBB, IP, PPC::FNEG, 1, NegatedReg).addReg(CondReg); |
| 1366 | BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(NegatedReg) |
| 1367 | .addReg(TrueReg).addReg(FalseReg); |
| 1368 | } |
| 1369 | break; |
| 1370 | default: |
| 1371 | assert(0 && "Invalid SetCC opcode to fsel"); |
| 1372 | abort(); |
| 1373 | break; |
| 1374 | } |
| 1375 | } else { |
| 1376 | unsigned OtherCondReg = getReg(SCI->getOperand(1), MBB, IP); |
| 1377 | unsigned SelectReg = makeAnotherReg(SCI->getOperand(0)->getType()); |
| 1378 | switch(OpNum) { |
| 1379 | case 2: // LT |
| 1380 | BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(CondReg) |
| 1381 | .addReg(OtherCondReg); |
| 1382 | BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg) |
| 1383 | .addReg(FalseReg).addReg(TrueReg); |
| 1384 | break; |
| 1385 | case 3: // GE == !LT |
| 1386 | BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(CondReg) |
| 1387 | .addReg(OtherCondReg); |
| 1388 | BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg) |
| 1389 | .addReg(TrueReg).addReg(FalseReg); |
| 1390 | break; |
| 1391 | case 4: // GT |
| 1392 | BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(OtherCondReg) |
| 1393 | .addReg(CondReg); |
| 1394 | BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg) |
| 1395 | .addReg(FalseReg).addReg(TrueReg); |
| 1396 | break; |
| 1397 | case 5: // LE == !GT |
| 1398 | BuildMI(*MBB, IP, PPC::FSUB, 2, SelectReg).addReg(OtherCondReg) |
| 1399 | .addReg(CondReg); |
| 1400 | BuildMI(*MBB, IP, PPC::FSEL, 3, DestReg).addReg(SelectReg) |
| 1401 | .addReg(TrueReg).addReg(FalseReg); |
| 1402 | break; |
| 1403 | default: |
| 1404 | assert(0 && "Invalid SetCC opcode to fsel"); |
| 1405 | abort(); |
| 1406 | break; |
| 1407 | } |
| 1408 | } |
Nate Begeman | 087d5d9 | 2004-10-06 09:53:04 +0000 | [diff] [blame] | 1409 | return; |
| 1410 | } |
| 1411 | } |
Misha Brukman | 4722544 | 2004-07-23 22:35:49 +0000 | [diff] [blame] | 1412 | OpNum = EmitComparison(OpNum, SCI->getOperand(0),SCI->getOperand(1),MBB,IP); |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 1413 | Opcode = getPPCOpcodeForSetCCNumber(SCI->getOpcode()); |
| 1414 | } else { |
| 1415 | unsigned CondReg = getReg(Cond, MBB, IP); |
Nate Begeman | ed42853 | 2004-09-04 05:00:00 +0000 | [diff] [blame] | 1416 | BuildMI(*MBB, IP, PPC::CMPWI, 2, PPC::CR0).addReg(CondReg).addSImm(0); |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 1417 | Opcode = getPPCOpcodeForSetCCNumber(Instruction::SetNE); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1418 | } |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 1419 | |
| 1420 | MachineBasicBlock *thisMBB = BB; |
| 1421 | const BasicBlock *LLVM_BB = BB->getBasicBlock(); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1422 | ilist<MachineBasicBlock>::iterator It = BB; |
| 1423 | ++It; |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 1424 | |
Nate Begeman | a96c4af | 2004-08-21 20:42:14 +0000 | [diff] [blame] | 1425 | // thisMBB: |
| 1426 | // ... |
| 1427 | // cmpTY cr0, r1, r2 |
Nate Begeman | 1f49e86 | 2004-09-29 05:00:31 +0000 | [diff] [blame] | 1428 | // bCC copy1MBB |
| 1429 | // fallthrough --> copy0MBB |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 1430 | MachineBasicBlock *copy0MBB = new MachineBasicBlock(LLVM_BB); |
Nate Begeman | 1f49e86 | 2004-09-29 05:00:31 +0000 | [diff] [blame] | 1431 | MachineBasicBlock *copy1MBB = new MachineBasicBlock(LLVM_BB); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1432 | MachineBasicBlock *sinkMBB = new MachineBasicBlock(LLVM_BB); |
Nate Begeman | 1f49e86 | 2004-09-29 05:00:31 +0000 | [diff] [blame] | 1433 | BuildMI(BB, Opcode, 2).addReg(PPC::CR0).addMBB(copy1MBB); |
Nate Begeman | a96c4af | 2004-08-21 20:42:14 +0000 | [diff] [blame] | 1434 | F->getBasicBlockList().insert(It, copy0MBB); |
Nate Begeman | 1f49e86 | 2004-09-29 05:00:31 +0000 | [diff] [blame] | 1435 | F->getBasicBlockList().insert(It, copy1MBB); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1436 | F->getBasicBlockList().insert(It, sinkMBB); |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 1437 | // Update machine-CFG edges |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 1438 | BB->addSuccessor(copy0MBB); |
Nate Begeman | 1f49e86 | 2004-09-29 05:00:31 +0000 | [diff] [blame] | 1439 | BB->addSuccessor(copy1MBB); |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 1440 | |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1441 | // copy0MBB: |
| 1442 | // %FalseValue = ... |
Nate Begeman | 1f49e86 | 2004-09-29 05:00:31 +0000 | [diff] [blame] | 1443 | // b sinkMBB |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1444 | BB = copy0MBB; |
| 1445 | unsigned FalseValue = getReg(FalseVal, BB, BB->begin()); |
Nate Begeman | 1f49e86 | 2004-09-29 05:00:31 +0000 | [diff] [blame] | 1446 | BuildMI(BB, PPC::B, 1).addMBB(sinkMBB); |
| 1447 | // Update machine-CFG edges |
| 1448 | BB->addSuccessor(sinkMBB); |
| 1449 | |
| 1450 | // copy1MBB: |
| 1451 | // %TrueValue = ... |
| 1452 | // fallthrough |
| 1453 | BB = copy1MBB; |
| 1454 | unsigned TrueValue = getReg(TrueVal, BB, BB->begin()); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1455 | // Update machine-CFG edges |
| 1456 | BB->addSuccessor(sinkMBB); |
| 1457 | |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 1458 | // sinkMBB: |
Nate Begeman | a96c4af | 2004-08-21 20:42:14 +0000 | [diff] [blame] | 1459 | // %Result = phi [ %FalseValue, copy0MBB ], [ %TrueValue, thisMBB ] |
Misha Brukman | bebde75 | 2004-07-16 21:06:24 +0000 | [diff] [blame] | 1460 | // ... |
| 1461 | BB = sinkMBB; |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1462 | BuildMI(BB, PPC::PHI, 4, DestReg).addReg(FalseValue) |
Nate Begeman | 1f49e86 | 2004-09-29 05:00:31 +0000 | [diff] [blame] | 1463 | .addMBB(copy0MBB).addReg(TrueValue).addMBB(copy1MBB); |
Nate Begeman | a96c4af | 2004-08-21 20:42:14 +0000 | [diff] [blame] | 1464 | |
Misha Brukman | a31f1f7 | 2004-07-21 20:30:18 +0000 | [diff] [blame] | 1465 | // For a register pair representing a long value, define the second reg |
Nate Begeman | a96c4af | 2004-08-21 20:42:14 +0000 | [diff] [blame] | 1466 | // FIXME: Can this really be correct for selecting longs? |
Nate Begeman | 8d963e6 | 2004-08-11 03:30:55 +0000 | [diff] [blame] | 1467 | if (getClassB(TrueVal->getType()) == cLong) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1468 | BuildMI(BB, PPC::LI, 1, DestReg+1).addImm(0); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1469 | return; |
| 1470 | } |
| 1471 | |
| 1472 | |
| 1473 | |
| 1474 | /// promote32 - Emit instructions to turn a narrow operand into a 32-bit-wide |
| 1475 | /// operand, in the specified target register. |
| 1476 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 1477 | void PPC32ISel::promote32(unsigned targetReg, const ValueRecord &VR) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1478 | bool isUnsigned = VR.Ty->isUnsigned() || VR.Ty == Type::BoolTy; |
| 1479 | |
| 1480 | Value *Val = VR.Val; |
| 1481 | const Type *Ty = VR.Ty; |
| 1482 | if (Val) { |
| 1483 | if (Constant *C = dyn_cast<Constant>(Val)) { |
| 1484 | Val = ConstantExpr::getCast(C, Type::IntTy); |
Chris Lattner | 74a806c | 2004-08-11 07:34:50 +0000 | [diff] [blame] | 1485 | if (isa<ConstantExpr>(Val)) // Could not fold |
| 1486 | Val = C; |
| 1487 | else |
| 1488 | Ty = Type::IntTy; // Folded! |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1489 | } |
| 1490 | |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 1491 | // If this is a simple constant, just emit a load directly to avoid the copy |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1492 | if (ConstantInt *CI = dyn_cast<ConstantInt>(Val)) { |
| 1493 | int TheVal = CI->getRawValue() & 0xFFFFFFFF; |
| 1494 | |
| 1495 | if (TheVal < 32768 && TheVal >= -32768) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1496 | BuildMI(BB, PPC::LI, 1, targetReg).addSImm(TheVal); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 1497 | } else { |
| 1498 | unsigned TmpReg = makeAnotherReg(Type::IntTy); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1499 | BuildMI(BB, PPC::LIS, 1, TmpReg).addSImm(TheVal >> 16); |
| 1500 | BuildMI(BB, PPC::ORI, 2, targetReg).addReg(TmpReg) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 1501 | .addImm(TheVal & 0xFFFF); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 1502 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1503 | return; |
| 1504 | } |
| 1505 | } |
| 1506 | |
| 1507 | // Make sure we have the register number for this value... |
| 1508 | unsigned Reg = Val ? getReg(Val) : VR.Reg; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1509 | switch (getClassB(Ty)) { |
| 1510 | case cByte: |
| 1511 | // Extend value into target register (8->32) |
Nate Begeman | 1b99fd3 | 2004-09-29 03:45:33 +0000 | [diff] [blame] | 1512 | if (Ty == Type::BoolTy) |
| 1513 | BuildMI(BB, PPC::OR, 2, targetReg).addReg(Reg).addReg(Reg); |
| 1514 | else if (isUnsigned) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1515 | BuildMI(BB, PPC::RLWINM, 4, targetReg).addReg(Reg).addZImm(0) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 1516 | .addZImm(24).addZImm(31); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1517 | else |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1518 | BuildMI(BB, PPC::EXTSB, 1, targetReg).addReg(Reg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1519 | break; |
| 1520 | case cShort: |
| 1521 | // Extend value into target register (16->32) |
| 1522 | if (isUnsigned) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1523 | BuildMI(BB, PPC::RLWINM, 4, targetReg).addReg(Reg).addZImm(0) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 1524 | .addZImm(16).addZImm(31); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1525 | else |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1526 | BuildMI(BB, PPC::EXTSH, 1, targetReg).addReg(Reg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1527 | break; |
| 1528 | case cInt: |
| 1529 | // Move value into target register (32->32) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1530 | BuildMI(BB, PPC::OR, 2, targetReg).addReg(Reg).addReg(Reg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1531 | break; |
| 1532 | default: |
| 1533 | assert(0 && "Unpromotable operand class in promote32"); |
| 1534 | } |
| 1535 | } |
| 1536 | |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 1537 | /// visitReturnInst - implemented with BLR |
| 1538 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 1539 | void PPC32ISel::visitReturnInst(ReturnInst &I) { |
Misha Brukman | d47bbf7 | 2004-06-25 19:04:27 +0000 | [diff] [blame] | 1540 | // Only do the processing if this is a non-void return |
| 1541 | if (I.getNumOperands() > 0) { |
| 1542 | Value *RetVal = I.getOperand(0); |
| 1543 | switch (getClassB(RetVal->getType())) { |
| 1544 | case cByte: // integral return values: extend or move into r3 and return |
| 1545 | case cShort: |
| 1546 | case cInt: |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1547 | promote32(PPC::R3, ValueRecord(RetVal)); |
Misha Brukman | d47bbf7 | 2004-06-25 19:04:27 +0000 | [diff] [blame] | 1548 | break; |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1549 | case cFP32: |
| 1550 | case cFP64: { // Floats & Doubles: Return in f1 |
Misha Brukman | d47bbf7 | 2004-06-25 19:04:27 +0000 | [diff] [blame] | 1551 | unsigned RetReg = getReg(RetVal); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1552 | BuildMI(BB, PPC::FMR, 1, PPC::F1).addReg(RetReg); |
Misha Brukman | d47bbf7 | 2004-06-25 19:04:27 +0000 | [diff] [blame] | 1553 | break; |
| 1554 | } |
| 1555 | case cLong: { |
| 1556 | unsigned RetReg = getReg(RetVal); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1557 | BuildMI(BB, PPC::OR, 2, PPC::R3).addReg(RetReg).addReg(RetReg); |
| 1558 | BuildMI(BB, PPC::OR, 2, PPC::R4).addReg(RetReg+1).addReg(RetReg+1); |
Misha Brukman | d47bbf7 | 2004-06-25 19:04:27 +0000 | [diff] [blame] | 1559 | break; |
| 1560 | } |
| 1561 | default: |
| 1562 | visitInstruction(I); |
| 1563 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1564 | } |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1565 | BuildMI(BB, PPC::BLR, 1).addImm(0); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1566 | } |
| 1567 | |
| 1568 | // getBlockAfter - Return the basic block which occurs lexically after the |
| 1569 | // specified one. |
| 1570 | static inline BasicBlock *getBlockAfter(BasicBlock *BB) { |
| 1571 | Function::iterator I = BB; ++I; // Get iterator to next block |
| 1572 | return I != BB->getParent()->end() ? &*I : 0; |
| 1573 | } |
| 1574 | |
| 1575 | /// visitBranchInst - Handle conditional and unconditional branches here. Note |
| 1576 | /// that since code layout is frozen at this point, that if we are trying to |
| 1577 | /// jump to a block that is the immediate successor of the current block, we can |
| 1578 | /// just make a fall-through (but we don't currently). |
| 1579 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 1580 | void PPC32ISel::visitBranchInst(BranchInst &BI) { |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 1581 | // Update machine-CFG edges |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 1582 | BB->addSuccessor(MBBMap[BI.getSuccessor(0)]); |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 1583 | if (BI.isConditional()) |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 1584 | BB->addSuccessor(MBBMap[BI.getSuccessor(1)]); |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 1585 | |
| 1586 | BasicBlock *NextBB = getBlockAfter(BI.getParent()); // BB after current one |
Misha Brukman | e9c6551 | 2004-07-06 15:32:44 +0000 | [diff] [blame] | 1587 | |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 1588 | if (!BI.isConditional()) { // Unconditional branch? |
Misha Brukman | e9c6551 | 2004-07-06 15:32:44 +0000 | [diff] [blame] | 1589 | if (BI.getSuccessor(0) != NextBB) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1590 | BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(0)]); |
Misha Brukman | fadb82f | 2004-06-24 22:00:15 +0000 | [diff] [blame] | 1591 | return; |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 1592 | } |
| 1593 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1594 | // See if we can fold the setcc into the branch itself... |
| 1595 | SetCondInst *SCI = canFoldSetCCIntoBranchOrSelect(BI.getCondition()); |
| 1596 | if (SCI == 0) { |
| 1597 | // Nope, cannot fold setcc into this branch. Emit a branch on a condition |
| 1598 | // computed some other way... |
| 1599 | unsigned condReg = getReg(BI.getCondition()); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1600 | BuildMI(BB, PPC::CMPLI, 3, PPC::CR0).addImm(0).addReg(condReg) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 1601 | .addImm(0); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1602 | if (BI.getSuccessor(1) == NextBB) { |
| 1603 | if (BI.getSuccessor(0) != NextBB) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1604 | BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(PPC::BNE) |
Misha Brukman | fa20a6d | 2004-07-27 18:35:23 +0000 | [diff] [blame] | 1605 | .addMBB(MBBMap[BI.getSuccessor(0)]) |
| 1606 | .addMBB(MBBMap[BI.getSuccessor(1)]); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1607 | } else { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1608 | BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(PPC::BEQ) |
Misha Brukman | fa20a6d | 2004-07-27 18:35:23 +0000 | [diff] [blame] | 1609 | .addMBB(MBBMap[BI.getSuccessor(1)]) |
| 1610 | .addMBB(MBBMap[BI.getSuccessor(0)]); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1611 | if (BI.getSuccessor(0) != NextBB) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1612 | BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(0)]); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1613 | } |
| 1614 | return; |
| 1615 | } |
| 1616 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1617 | unsigned OpNum = getSetCCNumber(SCI->getOpcode()); |
Misha Brukman | e9c6551 | 2004-07-06 15:32:44 +0000 | [diff] [blame] | 1618 | unsigned Opcode = getPPCOpcodeForSetCCNumber(SCI->getOpcode()); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1619 | MachineBasicBlock::iterator MII = BB->end(); |
| 1620 | OpNum = EmitComparison(OpNum, SCI->getOperand(0), SCI->getOperand(1), BB,MII); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1621 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1622 | if (BI.getSuccessor(0) != NextBB) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1623 | BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(Opcode) |
Misha Brukman | fa20a6d | 2004-07-27 18:35:23 +0000 | [diff] [blame] | 1624 | .addMBB(MBBMap[BI.getSuccessor(0)]) |
| 1625 | .addMBB(MBBMap[BI.getSuccessor(1)]); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1626 | if (BI.getSuccessor(1) != NextBB) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1627 | BuildMI(BB, PPC::B, 1).addMBB(MBBMap[BI.getSuccessor(1)]); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1628 | } else { |
| 1629 | // Change to the inverse condition... |
| 1630 | if (BI.getSuccessor(1) != NextBB) { |
Misha Brukman | f2ccb77 | 2004-08-17 04:55:41 +0000 | [diff] [blame] | 1631 | Opcode = PPC32InstrInfo::invertPPCBranchOpcode(Opcode); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1632 | BuildMI(BB, PPC::COND_BRANCH, 3).addReg(PPC::CR0).addImm(Opcode) |
Misha Brukman | fa20a6d | 2004-07-27 18:35:23 +0000 | [diff] [blame] | 1633 | .addMBB(MBBMap[BI.getSuccessor(1)]) |
| 1634 | .addMBB(MBBMap[BI.getSuccessor(0)]); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1635 | } |
| 1636 | } |
| 1637 | } |
| 1638 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1639 | /// doCall - This emits an abstract call instruction, setting up the arguments |
| 1640 | /// and the return value as appropriate. For the actual function call itself, |
| 1641 | /// it inserts the specified CallMI instruction into the stream. |
| 1642 | /// |
| 1643 | /// FIXME: See Documentation at the following URL for "correct" behavior |
| 1644 | /// <http://developer.apple.com/documentation/DeveloperTools/Conceptual/MachORuntime/2rt_powerpc_abi/chapter_9_section_5.html> |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 1645 | void PPC32ISel::doCall(const ValueRecord &Ret, MachineInstr *CallMI, |
| 1646 | const std::vector<ValueRecord> &Args, bool isVarArg) { |
Chris Lattner | 3ea9346 | 2004-08-06 06:58:50 +0000 | [diff] [blame] | 1647 | // Count how many bytes are to be pushed on the stack, including the linkage |
| 1648 | // area, and parameter passing area. |
| 1649 | unsigned NumBytes = 24; |
| 1650 | unsigned ArgOffset = 24; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1651 | |
| 1652 | if (!Args.empty()) { |
| 1653 | for (unsigned i = 0, e = Args.size(); i != e; ++i) |
| 1654 | switch (getClassB(Args[i].Ty)) { |
| 1655 | case cByte: case cShort: case cInt: |
| 1656 | NumBytes += 4; break; |
| 1657 | case cLong: |
| 1658 | NumBytes += 8; break; |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1659 | case cFP32: |
| 1660 | NumBytes += 4; break; |
| 1661 | case cFP64: |
| 1662 | NumBytes += 8; break; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1663 | break; |
| 1664 | default: assert(0 && "Unknown class!"); |
| 1665 | } |
| 1666 | |
Nate Begeman | 865075e | 2004-08-16 01:50:22 +0000 | [diff] [blame] | 1667 | // Just to be safe, we'll always reserve the full 24 bytes of linkage area |
| 1668 | // plus 32 bytes of argument space in case any called code gets funky on us. |
| 1669 | if (NumBytes < 56) NumBytes = 56; |
Chris Lattner | 3ea9346 | 2004-08-06 06:58:50 +0000 | [diff] [blame] | 1670 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1671 | // Adjust the stack pointer for the new arguments... |
Chris Lattner | 3ea9346 | 2004-08-06 06:58:50 +0000 | [diff] [blame] | 1672 | // These functions are automatically eliminated by the prolog/epilog pass |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1673 | BuildMI(BB, PPC::ADJCALLSTACKDOWN, 1).addImm(NumBytes); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1674 | |
| 1675 | // Arguments go on the stack in reverse order, as specified by the ABI. |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1676 | // Offset to the paramater area on the stack is 24. |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 1677 | int GPR_remaining = 8, FPR_remaining = 13; |
Misha Brukman | fc879c3 | 2004-07-08 18:02:38 +0000 | [diff] [blame] | 1678 | unsigned GPR_idx = 0, FPR_idx = 0; |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 1679 | static const unsigned GPR[] = { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1680 | PPC::R3, PPC::R4, PPC::R5, PPC::R6, |
| 1681 | PPC::R7, PPC::R8, PPC::R9, PPC::R10, |
Misha Brukman | 14d8c7a | 2004-06-29 23:45:05 +0000 | [diff] [blame] | 1682 | }; |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 1683 | static const unsigned FPR[] = { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1684 | PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, |
| 1685 | PPC::F7, PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, |
| 1686 | PPC::F13 |
Misha Brukman | 14d8c7a | 2004-06-29 23:45:05 +0000 | [diff] [blame] | 1687 | }; |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 1688 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1689 | for (unsigned i = 0, e = Args.size(); i != e; ++i) { |
| 1690 | unsigned ArgReg; |
| 1691 | switch (getClassB(Args[i].Ty)) { |
| 1692 | case cByte: |
| 1693 | case cShort: |
| 1694 | // Promote arg to 32 bits wide into a temporary register... |
| 1695 | ArgReg = makeAnotherReg(Type::UIntTy); |
| 1696 | promote32(ArgReg, Args[i]); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 1697 | |
| 1698 | // Reg or stack? |
| 1699 | if (GPR_remaining > 0) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1700 | BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg) |
Misha Brukman | fadb82f | 2004-06-24 22:00:15 +0000 | [diff] [blame] | 1701 | .addReg(ArgReg); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1702 | CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 1703 | } |
| 1704 | if (GPR_remaining <= 0 || isVarArg) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1705 | BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset) |
| 1706 | .addReg(PPC::R1); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 1707 | } |
| 1708 | break; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1709 | case cInt: |
| 1710 | ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg; |
| 1711 | |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 1712 | // Reg or stack? |
| 1713 | if (GPR_remaining > 0) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1714 | BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg) |
Misha Brukman | fadb82f | 2004-06-24 22:00:15 +0000 | [diff] [blame] | 1715 | .addReg(ArgReg); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1716 | CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 1717 | } |
| 1718 | if (GPR_remaining <= 0 || isVarArg) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1719 | BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset) |
| 1720 | .addReg(PPC::R1); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 1721 | } |
| 1722 | break; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1723 | case cLong: |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 1724 | ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1725 | |
Misha Brukman | ec6319a | 2004-07-20 15:51:37 +0000 | [diff] [blame] | 1726 | // Reg or stack? Note that PPC calling conventions state that long args |
| 1727 | // are passed rN = hi, rN+1 = lo, opposite of LLVM. |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 1728 | if (GPR_remaining > 1) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1729 | BuildMI(BB, PPC::OR, 2, GPR[GPR_idx]).addReg(ArgReg) |
Misha Brukman | ec6319a | 2004-07-20 15:51:37 +0000 | [diff] [blame] | 1730 | .addReg(ArgReg); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1731 | BuildMI(BB, PPC::OR, 2, GPR[GPR_idx+1]).addReg(ArgReg+1) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 1732 | .addReg(ArgReg+1); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1733 | CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use); |
| 1734 | CallMI->addRegOperand(GPR[GPR_idx+1], MachineOperand::Use); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 1735 | } |
| 1736 | if (GPR_remaining <= 1 || isVarArg) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1737 | BuildMI(BB, PPC::STW, 3).addReg(ArgReg).addSImm(ArgOffset) |
| 1738 | .addReg(PPC::R1); |
| 1739 | BuildMI(BB, PPC::STW, 3).addReg(ArgReg+1).addSImm(ArgOffset+4) |
| 1740 | .addReg(PPC::R1); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 1741 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1742 | |
| 1743 | ArgOffset += 4; // 8 byte entry, not 4. |
Misha Brukman | 14d8c7a | 2004-06-29 23:45:05 +0000 | [diff] [blame] | 1744 | GPR_remaining -= 1; // uses up 2 GPRs |
| 1745 | GPR_idx += 1; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1746 | break; |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1747 | case cFP32: |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1748 | ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg; |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1749 | // Reg or stack? |
| 1750 | if (FPR_remaining > 0) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1751 | BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgReg); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1752 | CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use); |
| 1753 | FPR_remaining--; |
| 1754 | FPR_idx++; |
| 1755 | |
| 1756 | // If this is a vararg function, and there are GPRs left, also |
| 1757 | // pass the float in an int. Otherwise, put it on the stack. |
| 1758 | if (isVarArg) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1759 | BuildMI(BB, PPC::STFS, 3).addReg(ArgReg).addSImm(ArgOffset) |
| 1760 | .addReg(PPC::R1); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1761 | if (GPR_remaining > 0) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1762 | BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx]) |
Nate Begeman | 293d88c | 2004-08-13 04:45:14 +0000 | [diff] [blame] | 1763 | .addSImm(ArgOffset).addReg(PPC::R1); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1764 | CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use); |
| 1765 | } |
Misha Brukman | 1916bf9 | 2004-06-24 21:56:15 +0000 | [diff] [blame] | 1766 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1767 | } else { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1768 | BuildMI(BB, PPC::STFS, 3).addReg(ArgReg).addSImm(ArgOffset) |
| 1769 | .addReg(PPC::R1); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1770 | } |
| 1771 | break; |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1772 | case cFP64: |
| 1773 | ArgReg = Args[i].Val ? getReg(Args[i].Val) : Args[i].Reg; |
| 1774 | // Reg or stack? |
| 1775 | if (FPR_remaining > 0) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1776 | BuildMI(BB, PPC::FMR, 1, FPR[FPR_idx]).addReg(ArgReg); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1777 | CallMI->addRegOperand(FPR[FPR_idx], MachineOperand::Use); |
| 1778 | FPR_remaining--; |
| 1779 | FPR_idx++; |
| 1780 | // For vararg functions, must pass doubles via int regs as well |
| 1781 | if (isVarArg) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1782 | BuildMI(BB, PPC::STFD, 3).addReg(ArgReg).addSImm(ArgOffset) |
| 1783 | .addReg(PPC::R1); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1784 | |
Misha Brukman | 2ed17ca | 2004-07-22 15:58:04 +0000 | [diff] [blame] | 1785 | // Doubles can be split across reg + stack for varargs |
| 1786 | if (GPR_remaining > 0) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1787 | BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx]).addSImm(ArgOffset) |
| 1788 | .addReg(PPC::R1); |
Misha Brukman | 2ed17ca | 2004-07-22 15:58:04 +0000 | [diff] [blame] | 1789 | CallMI->addRegOperand(GPR[GPR_idx], MachineOperand::Use); |
| 1790 | } |
| 1791 | if (GPR_remaining > 1) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1792 | BuildMI(BB, PPC::LWZ, 2, GPR[GPR_idx+1]) |
| 1793 | .addSImm(ArgOffset+4).addReg(PPC::R1); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1794 | CallMI->addRegOperand(GPR[GPR_idx+1], MachineOperand::Use); |
| 1795 | } |
| 1796 | } |
| 1797 | } else { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1798 | BuildMI(BB, PPC::STFD, 3).addReg(ArgReg).addSImm(ArgOffset) |
| 1799 | .addReg(PPC::R1); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1800 | } |
| 1801 | // Doubles use 8 bytes, and 2 GPRs worth of param space |
| 1802 | ArgOffset += 4; |
| 1803 | GPR_remaining--; |
| 1804 | GPR_idx++; |
| 1805 | break; |
| 1806 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1807 | default: assert(0 && "Unknown class!"); |
| 1808 | } |
| 1809 | ArgOffset += 4; |
Misha Brukman | 14d8c7a | 2004-06-29 23:45:05 +0000 | [diff] [blame] | 1810 | GPR_remaining--; |
| 1811 | GPR_idx++; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1812 | } |
| 1813 | } else { |
Nate Begeman | 865075e | 2004-08-16 01:50:22 +0000 | [diff] [blame] | 1814 | BuildMI(BB, PPC::ADJCALLSTACKDOWN, 1).addImm(NumBytes); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1815 | } |
Nate Begeman | 43d64ea | 2004-08-15 06:42:28 +0000 | [diff] [blame] | 1816 | |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1817 | BuildMI(BB, PPC::IMPLICIT_DEF, 0, PPC::LR); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1818 | BB->push_back(CallMI); |
Chris Lattner | 3ea9346 | 2004-08-06 06:58:50 +0000 | [diff] [blame] | 1819 | |
| 1820 | // These functions are automatically eliminated by the prolog/epilog pass |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1821 | BuildMI(BB, PPC::ADJCALLSTACKUP, 1).addImm(NumBytes); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1822 | |
| 1823 | // If there is a return value, scavenge the result from the location the call |
| 1824 | // leaves it in... |
| 1825 | // |
| 1826 | if (Ret.Ty != Type::VoidTy) { |
| 1827 | unsigned DestClass = getClassB(Ret.Ty); |
| 1828 | switch (DestClass) { |
| 1829 | case cByte: |
| 1830 | case cShort: |
| 1831 | case cInt: |
| 1832 | // Integral results are in r3 |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1833 | BuildMI(BB, PPC::OR, 2, Ret.Reg).addReg(PPC::R3).addReg(PPC::R3); |
Misha Brukman | e327e49 | 2004-06-24 23:53:24 +0000 | [diff] [blame] | 1834 | break; |
Chris Lattner | 3ea9346 | 2004-08-06 06:58:50 +0000 | [diff] [blame] | 1835 | case cFP32: // Floating-point return values live in f1 |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 1836 | case cFP64: |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1837 | BuildMI(BB, PPC::FMR, 1, Ret.Reg).addReg(PPC::F1); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1838 | break; |
Chris Lattner | 3ea9346 | 2004-08-06 06:58:50 +0000 | [diff] [blame] | 1839 | case cLong: // Long values are in r3:r4 |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1840 | BuildMI(BB, PPC::OR, 2, Ret.Reg).addReg(PPC::R3).addReg(PPC::R3); |
| 1841 | BuildMI(BB, PPC::OR, 2, Ret.Reg+1).addReg(PPC::R4).addReg(PPC::R4); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1842 | break; |
| 1843 | default: assert(0 && "Unknown class!"); |
| 1844 | } |
| 1845 | } |
| 1846 | } |
| 1847 | |
| 1848 | |
| 1849 | /// visitCallInst - Push args on stack and do a procedure call instruction. |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 1850 | void PPC32ISel::visitCallInst(CallInst &CI) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1851 | MachineInstr *TheCall; |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 1852 | Function *F = CI.getCalledFunction(); |
| 1853 | if (F) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1854 | // Is it an intrinsic function call? |
| 1855 | if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID()) { |
| 1856 | visitIntrinsicCall(ID, CI); // Special intrinsics are not handled here |
| 1857 | return; |
| 1858 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1859 | // Emit a CALL instruction with PC-relative displacement. |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1860 | TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(F, true); |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 1861 | // Add it to the set of functions called to be used by the Printer |
| 1862 | TM.CalledFunctions.insert(F); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1863 | } else { // Emit an indirect call through the CTR |
| 1864 | unsigned Reg = getReg(CI.getCalledValue()); |
Nate Begeman | 43d64ea | 2004-08-15 06:42:28 +0000 | [diff] [blame] | 1865 | BuildMI(BB, PPC::OR, 2, PPC::R12).addReg(Reg).addReg(Reg); |
| 1866 | BuildMI(BB, PPC::MTCTR, 1).addReg(PPC::R12); |
| 1867 | TheCall = BuildMI(PPC::CALLindirect, 2).addZImm(20).addZImm(0) |
| 1868 | .addReg(PPC::R12); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1869 | } |
| 1870 | |
| 1871 | std::vector<ValueRecord> Args; |
| 1872 | for (unsigned i = 1, e = CI.getNumOperands(); i != e; ++i) |
| 1873 | Args.push_back(ValueRecord(CI.getOperand(i))); |
| 1874 | |
| 1875 | unsigned DestReg = CI.getType() != Type::VoidTy ? getReg(CI) : 0; |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 1876 | bool isVarArg = F ? F->getFunctionType()->isVarArg() : true; |
| 1877 | doCall(ValueRecord(DestReg, CI.getType()), TheCall, Args, isVarArg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1878 | } |
| 1879 | |
| 1880 | |
| 1881 | /// dyncastIsNan - Return the operand of an isnan operation if this is an isnan. |
| 1882 | /// |
| 1883 | static Value *dyncastIsNan(Value *V) { |
| 1884 | if (CallInst *CI = dyn_cast<CallInst>(V)) |
| 1885 | if (Function *F = CI->getCalledFunction()) |
Misha Brukman | a2916ce | 2004-06-21 17:58:36 +0000 | [diff] [blame] | 1886 | if (F->getIntrinsicID() == Intrinsic::isunordered) |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1887 | return CI->getOperand(1); |
| 1888 | return 0; |
| 1889 | } |
| 1890 | |
| 1891 | /// isOnlyUsedByUnorderedComparisons - Return true if this value is only used by |
| 1892 | /// or's whos operands are all calls to the isnan predicate. |
| 1893 | static bool isOnlyUsedByUnorderedComparisons(Value *V) { |
| 1894 | assert(dyncastIsNan(V) && "The value isn't an isnan call!"); |
| 1895 | |
| 1896 | // Check all uses, which will be or's of isnans if this predicate is true. |
| 1897 | for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;++UI){ |
| 1898 | Instruction *I = cast<Instruction>(*UI); |
| 1899 | if (I->getOpcode() != Instruction::Or) return false; |
| 1900 | if (I->getOperand(0) != V && !dyncastIsNan(I->getOperand(0))) return false; |
| 1901 | if (I->getOperand(1) != V && !dyncastIsNan(I->getOperand(1))) return false; |
| 1902 | } |
| 1903 | |
| 1904 | return true; |
| 1905 | } |
| 1906 | |
| 1907 | /// LowerUnknownIntrinsicFunctionCalls - This performs a prepass over the |
| 1908 | /// function, lowering any calls to unknown intrinsic functions into the |
| 1909 | /// equivalent LLVM code. |
| 1910 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 1911 | void PPC32ISel::LowerUnknownIntrinsicFunctionCalls(Function &F) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1912 | for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) |
| 1913 | for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ) |
| 1914 | if (CallInst *CI = dyn_cast<CallInst>(I++)) |
| 1915 | if (Function *F = CI->getCalledFunction()) |
| 1916 | switch (F->getIntrinsicID()) { |
| 1917 | case Intrinsic::not_intrinsic: |
| 1918 | case Intrinsic::vastart: |
| 1919 | case Intrinsic::vacopy: |
| 1920 | case Intrinsic::vaend: |
| 1921 | case Intrinsic::returnaddress: |
| 1922 | case Intrinsic::frameaddress: |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 1923 | // FIXME: should lower these ourselves |
Misha Brukman | a2916ce | 2004-06-21 17:58:36 +0000 | [diff] [blame] | 1924 | // case Intrinsic::isunordered: |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 1925 | // case Intrinsic::memcpy: -> doCall(). system memcpy almost |
| 1926 | // guaranteed to be faster than anything we generate ourselves |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1927 | // We directly implement these intrinsics |
| 1928 | break; |
| 1929 | case Intrinsic::readio: { |
| 1930 | // On PPC, memory operations are in-order. Lower this intrinsic |
| 1931 | // into a volatile load. |
| 1932 | Instruction *Before = CI->getPrev(); |
| 1933 | LoadInst * LI = new LoadInst(CI->getOperand(1), "", true, CI); |
| 1934 | CI->replaceAllUsesWith(LI); |
| 1935 | BB->getInstList().erase(CI); |
| 1936 | break; |
| 1937 | } |
| 1938 | case Intrinsic::writeio: { |
| 1939 | // On PPC, memory operations are in-order. Lower this intrinsic |
| 1940 | // into a volatile store. |
| 1941 | Instruction *Before = CI->getPrev(); |
Misha Brukman | 8d442c2 | 2004-07-14 15:29:51 +0000 | [diff] [blame] | 1942 | StoreInst *SI = new StoreInst(CI->getOperand(1), |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1943 | CI->getOperand(2), true, CI); |
Misha Brukman | 8d442c2 | 2004-07-14 15:29:51 +0000 | [diff] [blame] | 1944 | CI->replaceAllUsesWith(SI); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1945 | BB->getInstList().erase(CI); |
| 1946 | break; |
| 1947 | } |
| 1948 | default: |
| 1949 | // All other intrinsic calls we must lower. |
| 1950 | Instruction *Before = CI->getPrev(); |
| 1951 | TM.getIntrinsicLowering().LowerIntrinsicCall(CI); |
| 1952 | if (Before) { // Move iterator to instruction after call |
| 1953 | I = Before; ++I; |
| 1954 | } else { |
| 1955 | I = BB->begin(); |
| 1956 | } |
| 1957 | } |
| 1958 | } |
| 1959 | |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 1960 | void PPC32ISel::visitIntrinsicCall(Intrinsic::ID ID, CallInst &CI) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1961 | unsigned TmpReg1, TmpReg2, TmpReg3; |
| 1962 | switch (ID) { |
| 1963 | case Intrinsic::vastart: |
| 1964 | // Get the address of the first vararg value... |
| 1965 | TmpReg1 = getReg(CI); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1966 | addFrameReference(BuildMI(BB, PPC::ADDI, 2, TmpReg1), VarArgsFrameIndex, |
Misha Brukman | ec6319a | 2004-07-20 15:51:37 +0000 | [diff] [blame] | 1967 | 0, false); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1968 | return; |
| 1969 | |
| 1970 | case Intrinsic::vacopy: |
| 1971 | TmpReg1 = getReg(CI); |
| 1972 | TmpReg2 = getReg(CI.getOperand(1)); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1973 | BuildMI(BB, PPC::OR, 2, TmpReg1).addReg(TmpReg2).addReg(TmpReg2); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1974 | return; |
| 1975 | case Intrinsic::vaend: return; |
| 1976 | |
| 1977 | case Intrinsic::returnaddress: |
Misha Brukman | ec6319a | 2004-07-20 15:51:37 +0000 | [diff] [blame] | 1978 | TmpReg1 = getReg(CI); |
| 1979 | if (cast<Constant>(CI.getOperand(1))->isNullValue()) { |
| 1980 | MachineFrameInfo *MFI = F->getFrameInfo(); |
| 1981 | unsigned NumBytes = MFI->getStackSize(); |
| 1982 | |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1983 | BuildMI(BB, PPC::LWZ, 2, TmpReg1).addSImm(NumBytes+8) |
| 1984 | .addReg(PPC::R1); |
Misha Brukman | ec6319a | 2004-07-20 15:51:37 +0000 | [diff] [blame] | 1985 | } else { |
| 1986 | // Values other than zero are not implemented yet. |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1987 | BuildMI(BB, PPC::LI, 1, TmpReg1).addSImm(0); |
Misha Brukman | ec6319a | 2004-07-20 15:51:37 +0000 | [diff] [blame] | 1988 | } |
| 1989 | return; |
| 1990 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1991 | case Intrinsic::frameaddress: |
| 1992 | TmpReg1 = getReg(CI); |
| 1993 | if (cast<Constant>(CI.getOperand(1))->isNullValue()) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1994 | BuildMI(BB, PPC::OR, 2, TmpReg1).addReg(PPC::R1).addReg(PPC::R1); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1995 | } else { |
| 1996 | // Values other than zero are not implemented yet. |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 1997 | BuildMI(BB, PPC::LI, 1, TmpReg1).addSImm(0); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 1998 | } |
| 1999 | return; |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2000 | |
Misha Brukman | a2916ce | 2004-06-21 17:58:36 +0000 | [diff] [blame] | 2001 | #if 0 |
| 2002 | // This may be useful for supporting isunordered |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2003 | case Intrinsic::isnan: |
| 2004 | // If this is only used by 'isunordered' style comparisons, don't emit it. |
| 2005 | if (isOnlyUsedByUnorderedComparisons(&CI)) return; |
| 2006 | TmpReg1 = getReg(CI.getOperand(1)); |
| 2007 | emitUCOM(BB, BB->end(), TmpReg1, TmpReg1); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 2008 | TmpReg2 = makeAnotherReg(Type::IntTy); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2009 | BuildMI(BB, PPC::MFCR, TmpReg2); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2010 | TmpReg3 = getReg(CI); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2011 | BuildMI(BB, PPC::RLWINM, 4, TmpReg3).addReg(TmpReg2).addImm(4).addImm(31).addImm(31); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2012 | return; |
Misha Brukman | a2916ce | 2004-06-21 17:58:36 +0000 | [diff] [blame] | 2013 | #endif |
| 2014 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2015 | default: assert(0 && "Error: unknown intrinsics should have been lowered!"); |
| 2016 | } |
| 2017 | } |
| 2018 | |
| 2019 | /// visitSimpleBinary - Implement simple binary operators for integral types... |
| 2020 | /// OperatorClass is one of: 0 for Add, 1 for Sub, 2 for And, 3 for Or, 4 for |
| 2021 | /// Xor. |
| 2022 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 2023 | void PPC32ISel::visitSimpleBinary(BinaryOperator &B, unsigned OperatorClass) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2024 | unsigned DestReg = getReg(B); |
| 2025 | MachineBasicBlock::iterator MI = BB->end(); |
| 2026 | Value *Op0 = B.getOperand(0), *Op1 = B.getOperand(1); |
| 2027 | unsigned Class = getClassB(B.getType()); |
| 2028 | |
Nate Begeman | 1b75022 | 2004-10-17 05:19:20 +0000 | [diff] [blame^] | 2029 | if (std::find(SkipList.begin(), SkipList.end(), &B) != SkipList.end()) |
| 2030 | return; |
| 2031 | |
| 2032 | RlwimiRec r = RlwimiMap[&B]; |
| 2033 | if (0 != r.Op0) { |
| 2034 | unsigned Op0Reg = getReg(r.Op0, BB, MI); |
| 2035 | unsigned Op1Reg = getReg(r.Op1, BB, MI); |
| 2036 | BuildMI(*BB, MI, PPC::RLWIMI, 5, DestReg).addReg(Op1Reg) |
| 2037 | .addReg(Op0Reg).addImm(r.Shift).addImm(r.MB).addImm(r.ME); |
| 2038 | } else { |
| 2039 | emitSimpleBinaryOperation(BB, MI, &B, Op0, Op1, OperatorClass, DestReg); |
| 2040 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2041 | } |
| 2042 | |
| 2043 | /// emitBinaryFPOperation - This method handles emission of floating point |
| 2044 | /// Add (0), Sub (1), Mul (2), and Div (3) operations. |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 2045 | void PPC32ISel::emitBinaryFPOperation(MachineBasicBlock *BB, |
| 2046 | MachineBasicBlock::iterator IP, |
| 2047 | Value *Op0, Value *Op1, |
| 2048 | unsigned OperatorClass, unsigned DestReg){ |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2049 | |
Nate Begeman | 6d1e2df | 2004-08-14 22:11:38 +0000 | [diff] [blame] | 2050 | static const unsigned OpcodeTab[][4] = { |
| 2051 | { PPC::FADDS, PPC::FSUBS, PPC::FMULS, PPC::FDIVS }, // Float |
| 2052 | { PPC::FADD, PPC::FSUB, PPC::FMUL, PPC::FDIV }, // Double |
| 2053 | }; |
| 2054 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2055 | // Special case: R1 = op <const fp>, R2 |
Misha Brukman | a596f8c | 2004-07-13 15:35:45 +0000 | [diff] [blame] | 2056 | if (ConstantFP *Op0C = dyn_cast<ConstantFP>(Op0)) |
| 2057 | if (Op0C->isExactlyValue(-0.0) && OperatorClass == 1) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2058 | // -0.0 - X === -X |
| 2059 | unsigned op1Reg = getReg(Op1, BB, IP); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2060 | BuildMI(*BB, IP, PPC::FNEG, 1, DestReg).addReg(op1Reg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2061 | return; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2062 | } |
| 2063 | |
Nate Begeman | 81d265d | 2004-08-19 05:20:54 +0000 | [diff] [blame] | 2064 | unsigned Opcode = OpcodeTab[Op0->getType() == Type::DoubleTy][OperatorClass]; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2065 | unsigned Op0r = getReg(Op0, BB, IP); |
| 2066 | unsigned Op1r = getReg(Op1, BB, IP); |
| 2067 | BuildMI(*BB, IP, Opcode, 2, DestReg).addReg(Op0r).addReg(Op1r); |
| 2068 | } |
| 2069 | |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 2070 | // ExactLog2 - This function solves for (Val == 1 << (N-1)) and returns N. It |
| 2071 | // returns zero when the input is not exactly a power of two. |
| 2072 | static unsigned ExactLog2(unsigned Val) { |
| 2073 | if (Val == 0 || (Val & (Val-1))) return 0; |
| 2074 | unsigned Count = 0; |
| 2075 | while (Val != 1) { |
| 2076 | Val >>= 1; |
| 2077 | ++Count; |
| 2078 | } |
| 2079 | return Count; |
| 2080 | } |
| 2081 | |
Nate Begeman | bdf6984 | 2004-10-08 02:49:24 +0000 | [diff] [blame] | 2082 | // isRunOfOnes - returns true if Val consists of one contiguous run of 1's with |
| 2083 | // any number of 0's on either side. the 1's are allowed to wrap from LSB to |
| 2084 | // MSB. so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is |
| 2085 | // not, since all 1's are not contiguous. |
| 2086 | static bool isRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME) { |
| 2087 | bool isRun = true; |
| 2088 | MB = 0; |
| 2089 | ME = 0; |
| 2090 | |
| 2091 | // look for first set bit |
| 2092 | int i = 0; |
| 2093 | for (; i < 32; i++) { |
| 2094 | if ((Val & (1 << (31 - i))) != 0) { |
| 2095 | MB = i; |
| 2096 | ME = i; |
| 2097 | break; |
| 2098 | } |
| 2099 | } |
| 2100 | |
| 2101 | // look for last set bit |
| 2102 | for (; i < 32; i++) { |
| 2103 | if ((Val & (1 << (31 - i))) == 0) |
| 2104 | break; |
| 2105 | ME = i; |
| 2106 | } |
| 2107 | |
| 2108 | // look for next set bit |
| 2109 | for (; i < 32; i++) { |
| 2110 | if ((Val & (1 << (31 - i))) != 0) |
| 2111 | break; |
| 2112 | } |
| 2113 | |
| 2114 | // if we exhausted all the bits, we found a match at this point for 0*1*0* |
| 2115 | if (i == 32) |
| 2116 | return true; |
| 2117 | |
| 2118 | // since we just encountered more 1's, if it doesn't wrap around to the |
| 2119 | // most significant bit of the word, then we did not find a match to 1*0*1* so |
| 2120 | // exit. |
| 2121 | if (MB != 0) |
| 2122 | return false; |
| 2123 | |
| 2124 | // look for last set bit |
| 2125 | for (MB = i; i < 32; i++) { |
| 2126 | if ((Val & (1 << (31 - i))) == 0) |
| 2127 | break; |
| 2128 | } |
| 2129 | |
| 2130 | // if we exhausted all the bits, then we found a match for 1*0*1*, otherwise, |
| 2131 | // the value is not a run of ones. |
| 2132 | if (i == 32) |
| 2133 | return true; |
| 2134 | return false; |
| 2135 | } |
| 2136 | |
Nate Begeman | 1b75022 | 2004-10-17 05:19:20 +0000 | [diff] [blame^] | 2137 | /// emitBitfieldInsert - return true if we were able to fold the sequence of |
| 2138 | /// instructions starting with AndI into a bitfield insert. |
| 2139 | bool PPC32ISel::emitBitfieldInsert(BinaryOperator *AndI, unsigned ShlAmount, |
| 2140 | Value *InsertOp) { |
| 2141 | if (AndI->hasOneUse()) { |
| 2142 | ConstantInt *CI_1 = dyn_cast<ConstantInt>(AndI->getOperand(1)); |
| 2143 | BinaryOperator *OrI = dyn_cast<BinaryOperator>(*(AndI->use_begin())); |
| 2144 | if (CI_1 && OrI && OrI->getOpcode() == Instruction::Or) { |
| 2145 | Value *Op0 = OrI->getOperand(0); |
| 2146 | Value *Op1 = OrI->getOperand(1); |
| 2147 | BinaryOperator *AndI_2; |
| 2148 | // Whichever operand our initial And instruction is to the Or instruction, |
| 2149 | // Look at the other operand to determine if it is also an And instruction |
| 2150 | if (AndI == Op0) { |
| 2151 | AndI_2 = dyn_cast<BinaryOperator>(Op1); |
| 2152 | } else if (AndI == Op1) { |
| 2153 | AndI_2 = dyn_cast<BinaryOperator>(Op0); |
| 2154 | std::swap(Op0, Op1); |
| 2155 | } else { |
| 2156 | assert(0 && "And instruction not used in Or!"); |
| 2157 | } |
| 2158 | // Verify that the second operand to the Or is an And with one use |
| 2159 | if (AndI_2 && AndI_2->hasOneUse() |
| 2160 | && AndI_2->getOpcode() == Instruction::And) { |
| 2161 | // Check to see if this And instruction also has a constant int operand. |
| 2162 | // If it does, then we can replace this sequence of instructions with an |
| 2163 | // insert if the sum of the two ConstantInts has all bits set, and |
| 2164 | // one is a run of ones (which implies the other is as well). |
| 2165 | ConstantInt *CI_2 = dyn_cast<ConstantInt>(AndI_2->getOperand(1)); |
| 2166 | if (CI_2) { |
| 2167 | unsigned Imm1 = CI_1->getRawValue(); |
| 2168 | unsigned Imm2 = CI_2->getRawValue(); |
| 2169 | if (Imm1 + Imm2 == 0xFFFFFFFF) { |
| 2170 | unsigned MB, ME; |
| 2171 | if (isRunOfOnes(Imm1, MB, ME)) { |
| 2172 | ++Bitfields; |
| 2173 | SkipList.push_back(AndI); |
| 2174 | SkipList.push_back(AndI_2); |
| 2175 | RlwimiMap[OrI] = RlwimiRec(ShlAmount, MB, ME, |
| 2176 | InsertOp, AndI_2->getOperand(0)); |
| 2177 | return true; |
| 2178 | } |
| 2179 | } |
| 2180 | } |
| 2181 | } |
| 2182 | } |
| 2183 | } |
| 2184 | return false; |
| 2185 | } |
| 2186 | |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 2187 | /// emitBinaryConstOperation - Implement simple binary operators for integral |
| 2188 | /// types with a constant operand. Opcode is one of: 0 for Add, 1 for Sub, |
| 2189 | /// 2 for And, 3 for Or, 4 for Xor, and 5 for Subtract-From. |
| 2190 | /// |
| 2191 | void PPC32ISel::emitBinaryConstOperation(MachineBasicBlock *MBB, |
| 2192 | MachineBasicBlock::iterator IP, |
| 2193 | unsigned Op0Reg, ConstantInt *Op1, |
| 2194 | unsigned Opcode, unsigned DestReg) { |
| 2195 | static const unsigned OpTab[] = { |
| 2196 | PPC::ADD, PPC::SUB, PPC::AND, PPC::OR, PPC::XOR, PPC::SUBF |
| 2197 | }; |
| 2198 | static const unsigned ImmOpTab[2][6] = { |
| 2199 | { PPC::ADDI, PPC::ADDI, PPC::ANDIo, PPC::ORI, PPC::XORI, PPC::SUBFIC }, |
| 2200 | { PPC::ADDIS, PPC::ADDIS, PPC::ANDISo, PPC::ORIS, PPC::XORIS, PPC::SUBFIC } |
| 2201 | }; |
| 2202 | |
| 2203 | // Handle subtract now by inverting the constant value |
| 2204 | ConstantInt *CI = Op1; |
| 2205 | if (Opcode == 1) { |
| 2206 | ConstantSInt *CSI = dyn_cast<ConstantSInt>(Op1); |
| 2207 | CI = ConstantSInt::get(Op1->getType(), -CSI->getValue()); |
| 2208 | } |
| 2209 | |
| 2210 | // xor X, -1 -> not X |
| 2211 | if (Opcode == 4) { |
Chris Lattner | 289a49a | 2004-10-16 18:13:47 +0000 | [diff] [blame] | 2212 | ConstantInt *CI = dyn_cast<ConstantSInt>(Op1); |
| 2213 | if (CI && CI->isAllOnesValue()) { |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 2214 | BuildMI(*MBB, IP, PPC::NOR, 2, DestReg).addReg(Op0Reg).addReg(Op0Reg); |
| 2215 | return; |
| 2216 | } |
| 2217 | } |
Nate Begeman | bdf6984 | 2004-10-08 02:49:24 +0000 | [diff] [blame] | 2218 | |
| 2219 | if (Opcode == 2) { |
| 2220 | unsigned MB, ME, mask = CI->getRawValue(); |
| 2221 | if (isRunOfOnes(mask, MB, ME)) { |
Nate Begeman | bdf6984 | 2004-10-08 02:49:24 +0000 | [diff] [blame] | 2222 | BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(Op0Reg).addImm(0) |
| 2223 | .addImm(MB).addImm(ME); |
| 2224 | return; |
| 2225 | } |
| 2226 | } |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 2227 | |
Nate Begeman | e0c83a8 | 2004-10-15 00:50:19 +0000 | [diff] [blame] | 2228 | // PowerPC 16 bit signed immediates are sign extended before use by the |
| 2229 | // instruction. Therefore, we can only split up an add of a reg with a 32 bit |
| 2230 | // immediate into addis and addi if the sign bit of the low 16 bits is cleared |
| 2231 | // so that for register A, const imm X, we don't end up with |
| 2232 | // A + XXXX0000 + FFFFXXXX. |
| 2233 | bool WontSignExtend = (0 == (Op1->getRawValue() & 0x8000)); |
| 2234 | |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 2235 | // For Add, Sub, and SubF the instruction takes a signed immediate. For And, |
| 2236 | // Or, and Xor, the instruction takes an unsigned immediate. There is no |
| 2237 | // shifted immediate form of SubF so disallow its opcode for those constants. |
| 2238 | if (canUseAsImmediateForOpcode(CI, Opcode, false)) { |
| 2239 | if (Opcode < 2 || Opcode == 5) |
| 2240 | BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(Op0Reg) |
| 2241 | .addSImm(Op1->getRawValue()); |
| 2242 | else |
| 2243 | BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(Op0Reg) |
| 2244 | .addZImm(Op1->getRawValue()); |
| 2245 | } else if (canUseAsImmediateForOpcode(CI, Opcode, true) && (Opcode < 5)) { |
| 2246 | if (Opcode < 2) |
| 2247 | BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, DestReg).addReg(Op0Reg) |
| 2248 | .addSImm(Op1->getRawValue() >> 16); |
| 2249 | else |
| 2250 | BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, DestReg).addReg(Op0Reg) |
| 2251 | .addZImm(Op1->getRawValue() >> 16); |
Nate Begeman | e0c83a8 | 2004-10-15 00:50:19 +0000 | [diff] [blame] | 2252 | } else if ((Opcode < 2 && WontSignExtend) || Opcode == 3 || Opcode == 4) { |
| 2253 | unsigned TmpReg = makeAnotherReg(Op1->getType()); |
Nate Begeman | e0c83a8 | 2004-10-15 00:50:19 +0000 | [diff] [blame] | 2254 | if (Opcode < 2) { |
| 2255 | BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, TmpReg).addReg(Op0Reg) |
| 2256 | .addSImm(Op1->getRawValue() >> 16); |
| 2257 | BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(TmpReg) |
| 2258 | .addSImm(Op1->getRawValue()); |
| 2259 | } else { |
| 2260 | BuildMI(*MBB, IP, ImmOpTab[1][Opcode], 2, TmpReg).addReg(Op0Reg) |
| 2261 | .addZImm(Op1->getRawValue() >> 16); |
| 2262 | BuildMI(*MBB, IP, ImmOpTab[0][Opcode], 2, DestReg).addReg(TmpReg) |
| 2263 | .addZImm(Op1->getRawValue()); |
| 2264 | } |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 2265 | } else { |
| 2266 | unsigned Op1Reg = getReg(Op1, MBB, IP); |
| 2267 | BuildMI(*MBB, IP, OpTab[Opcode], 2, DestReg).addReg(Op0Reg).addReg(Op1Reg); |
| 2268 | } |
| 2269 | } |
| 2270 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2271 | /// emitSimpleBinaryOperation - Implement simple binary operators for integral |
| 2272 | /// types... OperatorClass is one of: 0 for Add, 1 for Sub, 2 for And, 3 for |
| 2273 | /// Or, 4 for Xor. |
| 2274 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 2275 | void PPC32ISel::emitSimpleBinaryOperation(MachineBasicBlock *MBB, |
| 2276 | MachineBasicBlock::iterator IP, |
Nate Begeman | 1b75022 | 2004-10-17 05:19:20 +0000 | [diff] [blame^] | 2277 | BinaryOperator *BO, |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 2278 | Value *Op0, Value *Op1, |
| 2279 | unsigned OperatorClass, |
| 2280 | unsigned DestReg) { |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 2281 | // Arithmetic and Bitwise operators |
Misha Brukman | 911afde | 2004-06-25 14:50:41 +0000 | [diff] [blame] | 2282 | static const unsigned OpcodeTab[] = { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2283 | PPC::ADD, PPC::SUB, PPC::AND, PPC::OR, PPC::XOR |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 2284 | }; |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 2285 | static const unsigned LongOpTab[2][5] = { |
| 2286 | { PPC::ADDC, PPC::SUBC, PPC::AND, PPC::OR, PPC::XOR }, |
| 2287 | { PPC::ADDE, PPC::SUBFE, PPC::AND, PPC::OR, PPC::XOR } |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 2288 | }; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2289 | |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 2290 | unsigned Class = getClassB(Op0->getType()); |
| 2291 | |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 2292 | if (Class == cFP32 || Class == cFP64) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2293 | assert(OperatorClass < 2 && "No logical ops for FP!"); |
| 2294 | emitBinaryFPOperation(MBB, IP, Op0, Op1, OperatorClass, DestReg); |
| 2295 | return; |
| 2296 | } |
| 2297 | |
| 2298 | if (Op0->getType() == Type::BoolTy) { |
| 2299 | if (OperatorClass == 3) |
| 2300 | // If this is an or of two isnan's, emit an FP comparison directly instead |
| 2301 | // of or'ing two isnan's together. |
| 2302 | if (Value *LHS = dyncastIsNan(Op0)) |
| 2303 | if (Value *RHS = dyncastIsNan(Op1)) { |
| 2304 | unsigned Op0Reg = getReg(RHS, MBB, IP), Op1Reg = getReg(LHS, MBB, IP); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 2305 | unsigned TmpReg = makeAnotherReg(Type::IntTy); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2306 | emitUCOM(MBB, IP, Op0Reg, Op1Reg); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2307 | BuildMI(*MBB, IP, PPC::MFCR, TmpReg); |
| 2308 | BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(TmpReg).addImm(4) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2309 | .addImm(31).addImm(31); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2310 | return; |
| 2311 | } |
| 2312 | } |
| 2313 | |
Misha Brukman | 2ed17ca | 2004-07-22 15:58:04 +0000 | [diff] [blame] | 2314 | // Special case: op <const int>, Reg |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 2315 | if (ConstantInt *CI = dyn_cast<ConstantInt>(Op0)) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2316 | if (Class != cLong) { |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 2317 | unsigned Opcode = (OperatorClass == 1) ? 5 : OperatorClass; |
| 2318 | unsigned Op1r = getReg(Op1, MBB, IP); |
| 2319 | emitBinaryConstOperation(MBB, IP, Op1r, CI, Opcode, DestReg); |
| 2320 | return; |
| 2321 | } |
| 2322 | // Special case: op Reg, <const int> |
| 2323 | if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) |
| 2324 | if (Class != cLong) { |
Nate Begeman | 1b75022 | 2004-10-17 05:19:20 +0000 | [diff] [blame^] | 2325 | if (OperatorClass == 2 && emitBitfieldInsert(BO, 0, Op0)) |
| 2326 | return; |
| 2327 | |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 2328 | unsigned Op0r = getReg(Op0, MBB, IP); |
| 2329 | emitBinaryConstOperation(MBB, IP, Op0r, CI, OperatorClass, DestReg); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2330 | return; |
| 2331 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2332 | |
Misha Brukman | 2ed17ca | 2004-07-22 15:58:04 +0000 | [diff] [blame] | 2333 | // We couldn't generate an immediate variant of the op, load both halves into |
| 2334 | // registers and emit the appropriate opcode. |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2335 | unsigned Op0r = getReg(Op0, MBB, IP); |
| 2336 | unsigned Op1r = getReg(Op1, MBB, IP); |
| 2337 | |
| 2338 | if (Class != cLong) { |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 2339 | unsigned Opcode = OpcodeTab[OperatorClass]; |
| 2340 | BuildMI(*MBB, IP, Opcode, 2, DestReg).addReg(Op0r).addReg(Op1r); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2341 | } else { |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 2342 | BuildMI(*MBB, IP, LongOpTab[0][OperatorClass], 2, DestReg+1).addReg(Op0r+1) |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 2343 | .addReg(Op1r+1); |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 2344 | BuildMI(*MBB, IP, LongOpTab[1][OperatorClass], 2, DestReg).addReg(Op0r) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2345 | .addReg(Op1r); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2346 | } |
| 2347 | return; |
| 2348 | } |
| 2349 | |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2350 | /// doMultiply - Emit appropriate instructions to multiply together the |
| 2351 | /// Values Op0 and Op1, and put the result in DestReg. |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2352 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 2353 | void PPC32ISel::doMultiply(MachineBasicBlock *MBB, |
| 2354 | MachineBasicBlock::iterator IP, |
| 2355 | unsigned DestReg, Value *Op0, Value *Op1) { |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2356 | unsigned Class0 = getClass(Op0->getType()); |
| 2357 | unsigned Class1 = getClass(Op1->getType()); |
| 2358 | |
| 2359 | unsigned Op0r = getReg(Op0, MBB, IP); |
| 2360 | unsigned Op1r = getReg(Op1, MBB, IP); |
| 2361 | |
| 2362 | // 64 x 64 -> 64 |
| 2363 | if (Class0 == cLong && Class1 == cLong) { |
| 2364 | unsigned Tmp1 = makeAnotherReg(Type::IntTy); |
| 2365 | unsigned Tmp2 = makeAnotherReg(Type::IntTy); |
| 2366 | unsigned Tmp3 = makeAnotherReg(Type::IntTy); |
| 2367 | unsigned Tmp4 = makeAnotherReg(Type::IntTy); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2368 | BuildMI(*MBB, IP, PPC::MULHWU, 2, Tmp1).addReg(Op0r+1).addReg(Op1r+1); |
| 2369 | BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg+1).addReg(Op0r+1).addReg(Op1r+1); |
| 2370 | BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp2).addReg(Op0r+1).addReg(Op1r); |
| 2371 | BuildMI(*MBB, IP, PPC::ADD, 2, Tmp3).addReg(Tmp1).addReg(Tmp2); |
| 2372 | BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp4).addReg(Op0r).addReg(Op1r+1); |
| 2373 | BuildMI(*MBB, IP, PPC::ADD, 2, DestReg).addReg(Tmp3).addReg(Tmp4); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2374 | return; |
| 2375 | } |
| 2376 | |
| 2377 | // 64 x 32 or less, promote 32 to 64 and do a 64 x 64 |
| 2378 | if (Class0 == cLong && Class1 <= cInt) { |
| 2379 | unsigned Tmp0 = makeAnotherReg(Type::IntTy); |
| 2380 | unsigned Tmp1 = makeAnotherReg(Type::IntTy); |
| 2381 | unsigned Tmp2 = makeAnotherReg(Type::IntTy); |
| 2382 | unsigned Tmp3 = makeAnotherReg(Type::IntTy); |
| 2383 | unsigned Tmp4 = makeAnotherReg(Type::IntTy); |
| 2384 | if (Op1->getType()->isSigned()) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2385 | BuildMI(*MBB, IP, PPC::SRAWI, 2, Tmp0).addReg(Op1r).addImm(31); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2386 | else |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2387 | BuildMI(*MBB, IP, PPC::LI, 2, Tmp0).addSImm(0); |
| 2388 | BuildMI(*MBB, IP, PPC::MULHWU, 2, Tmp1).addReg(Op0r+1).addReg(Op1r); |
| 2389 | BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg+1).addReg(Op0r+1).addReg(Op1r); |
| 2390 | BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp2).addReg(Op0r+1).addReg(Tmp0); |
| 2391 | BuildMI(*MBB, IP, PPC::ADD, 2, Tmp3).addReg(Tmp1).addReg(Tmp2); |
| 2392 | BuildMI(*MBB, IP, PPC::MULLW, 2, Tmp4).addReg(Op0r).addReg(Op1r); |
| 2393 | BuildMI(*MBB, IP, PPC::ADD, 2, DestReg).addReg(Tmp3).addReg(Tmp4); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2394 | return; |
| 2395 | } |
| 2396 | |
| 2397 | // 32 x 32 -> 32 |
| 2398 | if (Class0 <= cInt && Class1 <= cInt) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2399 | BuildMI(*MBB, IP, PPC::MULLW, 2, DestReg).addReg(Op0r).addReg(Op1r); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2400 | return; |
| 2401 | } |
| 2402 | |
| 2403 | assert(0 && "doMultiply cannot operate on unknown type!"); |
| 2404 | } |
| 2405 | |
| 2406 | /// doMultiplyConst - This method will multiply the value in Op0 by the |
| 2407 | /// value of the ContantInt *CI |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 2408 | void PPC32ISel::doMultiplyConst(MachineBasicBlock *MBB, |
| 2409 | MachineBasicBlock::iterator IP, |
| 2410 | unsigned DestReg, Value *Op0, ConstantInt *CI) { |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2411 | unsigned Class = getClass(Op0->getType()); |
| 2412 | |
| 2413 | // Mul op0, 0 ==> 0 |
| 2414 | if (CI->isNullValue()) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2415 | BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2416 | if (Class == cLong) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2417 | BuildMI(*MBB, IP, PPC::LI, 1, DestReg+1).addSImm(0); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2418 | return; |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2419 | } |
| 2420 | |
| 2421 | // Mul op0, 1 ==> op0 |
| 2422 | if (CI->equalsInt(1)) { |
| 2423 | unsigned Op0r = getReg(Op0, MBB, IP); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2424 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(Op0r).addReg(Op0r); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2425 | if (Class == cLong) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2426 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(Op0r+1).addReg(Op0r+1); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2427 | return; |
| 2428 | } |
| 2429 | |
| 2430 | // If the element size is exactly a power of 2, use a shift to get it. |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2431 | if (unsigned Shift = ExactLog2(CI->getRawValue())) { |
| 2432 | ConstantUInt *ShiftCI = ConstantUInt::get(Type::UByteTy, Shift); |
| 2433 | emitShiftOperation(MBB, IP, Op0, ShiftCI, true, Op0->getType(), DestReg); |
| 2434 | return; |
| 2435 | } |
| 2436 | |
| 2437 | // If 32 bits or less and immediate is in right range, emit mul by immediate |
Misha Brukman | 2ed17ca | 2004-07-22 15:58:04 +0000 | [diff] [blame] | 2438 | if (Class == cByte || Class == cShort || Class == cInt) { |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 2439 | if (canUseAsImmediateForOpcode(CI, 0, false)) { |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2440 | unsigned Op0r = getReg(Op0, MBB, IP); |
| 2441 | unsigned imm = CI->getRawValue() & 0xFFFF; |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2442 | BuildMI(*MBB, IP, PPC::MULLI, 2, DestReg).addReg(Op0r).addSImm(imm); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2443 | return; |
| 2444 | } |
| 2445 | } |
| 2446 | |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2447 | doMultiply(MBB, IP, DestReg, Op0, CI); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2448 | } |
| 2449 | |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 2450 | void PPC32ISel::visitMul(BinaryOperator &I) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2451 | unsigned ResultReg = getReg(I); |
| 2452 | |
| 2453 | Value *Op0 = I.getOperand(0); |
| 2454 | Value *Op1 = I.getOperand(1); |
| 2455 | |
| 2456 | MachineBasicBlock::iterator IP = BB->end(); |
| 2457 | emitMultiply(BB, IP, Op0, Op1, ResultReg); |
| 2458 | } |
| 2459 | |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 2460 | void PPC32ISel::emitMultiply(MachineBasicBlock *MBB, |
| 2461 | MachineBasicBlock::iterator IP, |
| 2462 | Value *Op0, Value *Op1, unsigned DestReg) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2463 | TypeClass Class = getClass(Op0->getType()); |
| 2464 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2465 | switch (Class) { |
| 2466 | case cByte: |
| 2467 | case cShort: |
| 2468 | case cInt: |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2469 | case cLong: |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2470 | if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) { |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2471 | doMultiplyConst(MBB, IP, DestReg, Op0, CI); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2472 | } else { |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2473 | doMultiply(MBB, IP, DestReg, Op0, Op1); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2474 | } |
| 2475 | return; |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 2476 | case cFP32: |
| 2477 | case cFP64: |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2478 | emitBinaryFPOperation(MBB, IP, Op0, Op1, 2, DestReg); |
| 2479 | return; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2480 | break; |
| 2481 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2482 | } |
| 2483 | |
| 2484 | |
| 2485 | /// visitDivRem - Handle division and remainder instructions... these |
| 2486 | /// instruction both require the same instructions to be generated, they just |
| 2487 | /// select the result from a different register. Note that both of these |
| 2488 | /// instructions work differently for signed and unsigned operands. |
| 2489 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 2490 | void PPC32ISel::visitDivRem(BinaryOperator &I) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2491 | unsigned ResultReg = getReg(I); |
| 2492 | Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1); |
| 2493 | |
| 2494 | MachineBasicBlock::iterator IP = BB->end(); |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2495 | emitDivRemOperation(BB, IP, Op0, Op1, I.getOpcode() == Instruction::Div, |
| 2496 | ResultReg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2497 | } |
| 2498 | |
Nate Begeman | 087d5d9 | 2004-10-06 09:53:04 +0000 | [diff] [blame] | 2499 | void PPC32ISel::emitDivRemOperation(MachineBasicBlock *MBB, |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 2500 | MachineBasicBlock::iterator IP, |
| 2501 | Value *Op0, Value *Op1, bool isDiv, |
| 2502 | unsigned ResultReg) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2503 | const Type *Ty = Op0->getType(); |
| 2504 | unsigned Class = getClass(Ty); |
| 2505 | switch (Class) { |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 2506 | case cFP32: |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2507 | if (isDiv) { |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 2508 | // Floating point divide... |
Nate Begeman | 087d5d9 | 2004-10-06 09:53:04 +0000 | [diff] [blame] | 2509 | emitBinaryFPOperation(MBB, IP, Op0, Op1, 3, ResultReg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2510 | return; |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 2511 | } else { |
| 2512 | // Floating point remainder via fmodf(float x, float y); |
Nate Begeman | 087d5d9 | 2004-10-06 09:53:04 +0000 | [diff] [blame] | 2513 | unsigned Op0Reg = getReg(Op0, MBB, IP); |
| 2514 | unsigned Op1Reg = getReg(Op1, MBB, IP); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 2515 | MachineInstr *TheCall = |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2516 | BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(fmodfFn, true); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 2517 | std::vector<ValueRecord> Args; |
| 2518 | Args.push_back(ValueRecord(Op0Reg, Type::FloatTy)); |
| 2519 | Args.push_back(ValueRecord(Op1Reg, Type::FloatTy)); |
| 2520 | doCall(ValueRecord(ResultReg, Type::FloatTy), TheCall, Args, false); |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 2521 | TM.CalledFunctions.insert(fmodfFn); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 2522 | } |
| 2523 | return; |
| 2524 | case cFP64: |
| 2525 | if (isDiv) { |
| 2526 | // Floating point divide... |
Nate Begeman | 087d5d9 | 2004-10-06 09:53:04 +0000 | [diff] [blame] | 2527 | emitBinaryFPOperation(MBB, IP, Op0, Op1, 3, ResultReg); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 2528 | return; |
| 2529 | } else { |
| 2530 | // Floating point remainder via fmod(double x, double y); |
Nate Begeman | 087d5d9 | 2004-10-06 09:53:04 +0000 | [diff] [blame] | 2531 | unsigned Op0Reg = getReg(Op0, MBB, IP); |
| 2532 | unsigned Op1Reg = getReg(Op1, MBB, IP); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2533 | MachineInstr *TheCall = |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2534 | BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(fmodFn, true); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2535 | std::vector<ValueRecord> Args; |
| 2536 | Args.push_back(ValueRecord(Op0Reg, Type::DoubleTy)); |
| 2537 | Args.push_back(ValueRecord(Op1Reg, Type::DoubleTy)); |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 2538 | doCall(ValueRecord(ResultReg, Type::DoubleTy), TheCall, Args, false); |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 2539 | TM.CalledFunctions.insert(fmodFn); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2540 | } |
| 2541 | return; |
| 2542 | case cLong: { |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 2543 | static Function* const Funcs[] = |
Misha Brukman | 0aa97c6 | 2004-07-08 18:27:59 +0000 | [diff] [blame] | 2544 | { __moddi3Fn, __divdi3Fn, __umoddi3Fn, __udivdi3Fn }; |
Nate Begeman | 087d5d9 | 2004-10-06 09:53:04 +0000 | [diff] [blame] | 2545 | unsigned Op0Reg = getReg(Op0, MBB, IP); |
| 2546 | unsigned Op1Reg = getReg(Op1, MBB, IP); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2547 | unsigned NameIdx = Ty->isUnsigned()*2 + isDiv; |
| 2548 | MachineInstr *TheCall = |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2549 | BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(Funcs[NameIdx], true); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2550 | |
| 2551 | std::vector<ValueRecord> Args; |
| 2552 | Args.push_back(ValueRecord(Op0Reg, Type::LongTy)); |
| 2553 | Args.push_back(ValueRecord(Op1Reg, Type::LongTy)); |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 2554 | doCall(ValueRecord(ResultReg, Type::LongTy), TheCall, Args, false); |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 2555 | TM.CalledFunctions.insert(Funcs[NameIdx]); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2556 | return; |
| 2557 | } |
| 2558 | case cByte: case cShort: case cInt: |
| 2559 | break; // Small integrals, handled below... |
| 2560 | default: assert(0 && "Unknown class!"); |
| 2561 | } |
| 2562 | |
| 2563 | // Special case signed division by power of 2. |
| 2564 | if (isDiv) |
| 2565 | if (ConstantSInt *CI = dyn_cast<ConstantSInt>(Op1)) { |
| 2566 | assert(Class != cLong && "This doesn't handle 64-bit divides!"); |
| 2567 | int V = CI->getValue(); |
| 2568 | |
| 2569 | if (V == 1) { // X /s 1 => X |
Nate Begeman | 087d5d9 | 2004-10-06 09:53:04 +0000 | [diff] [blame] | 2570 | unsigned Op0Reg = getReg(Op0, MBB, IP); |
| 2571 | BuildMI(*MBB, IP, PPC::OR, 2, ResultReg).addReg(Op0Reg).addReg(Op0Reg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2572 | return; |
| 2573 | } |
| 2574 | |
| 2575 | if (V == -1) { // X /s -1 => -X |
Nate Begeman | 087d5d9 | 2004-10-06 09:53:04 +0000 | [diff] [blame] | 2576 | unsigned Op0Reg = getReg(Op0, MBB, IP); |
| 2577 | BuildMI(*MBB, IP, PPC::NEG, 1, ResultReg).addReg(Op0Reg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2578 | return; |
| 2579 | } |
| 2580 | |
Misha Brukman | ec6319a | 2004-07-20 15:51:37 +0000 | [diff] [blame] | 2581 | unsigned log2V = ExactLog2(V); |
| 2582 | if (log2V != 0 && Ty->isSigned()) { |
Nate Begeman | 087d5d9 | 2004-10-06 09:53:04 +0000 | [diff] [blame] | 2583 | unsigned Op0Reg = getReg(Op0, MBB, IP); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2584 | unsigned TmpReg = makeAnotherReg(Op0->getType()); |
Misha Brukman | ec6319a | 2004-07-20 15:51:37 +0000 | [diff] [blame] | 2585 | |
Nate Begeman | 087d5d9 | 2004-10-06 09:53:04 +0000 | [diff] [blame] | 2586 | BuildMI(*MBB, IP, PPC::SRAWI, 2, TmpReg).addReg(Op0Reg).addImm(log2V); |
| 2587 | BuildMI(*MBB, IP, PPC::ADDZE, 1, ResultReg).addReg(TmpReg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2588 | return; |
| 2589 | } |
| 2590 | } |
| 2591 | |
Nate Begeman | 087d5d9 | 2004-10-06 09:53:04 +0000 | [diff] [blame] | 2592 | unsigned Op0Reg = getReg(Op0, MBB, IP); |
| 2593 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2594 | if (isDiv) { |
Nate Begeman | 087d5d9 | 2004-10-06 09:53:04 +0000 | [diff] [blame] | 2595 | unsigned Op1Reg = getReg(Op1, MBB, IP); |
| 2596 | unsigned Opcode = Ty->isSigned() ? PPC::DIVW : PPC::DIVWU; |
| 2597 | BuildMI(*MBB, IP, Opcode, 2, ResultReg).addReg(Op0Reg).addReg(Op1Reg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2598 | } else { // Remainder |
Nate Begeman | 087d5d9 | 2004-10-06 09:53:04 +0000 | [diff] [blame] | 2599 | // FIXME: don't load the CI part of a CI divide twice |
| 2600 | ConstantInt *CI = dyn_cast<ConstantInt>(Op1); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 2601 | unsigned TmpReg1 = makeAnotherReg(Op0->getType()); |
| 2602 | unsigned TmpReg2 = makeAnotherReg(Op0->getType()); |
Nate Begeman | 087d5d9 | 2004-10-06 09:53:04 +0000 | [diff] [blame] | 2603 | emitDivRemOperation(MBB, IP, Op0, Op1, true, TmpReg1); |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 2604 | if (CI && canUseAsImmediateForOpcode(CI, 0, false)) { |
Nate Begeman | 087d5d9 | 2004-10-06 09:53:04 +0000 | [diff] [blame] | 2605 | BuildMI(*MBB, IP, PPC::MULLI, 2, TmpReg2).addReg(TmpReg1) |
| 2606 | .addSImm(CI->getRawValue()); |
| 2607 | } else { |
| 2608 | unsigned Op1Reg = getReg(Op1, MBB, IP); |
| 2609 | BuildMI(*MBB, IP, PPC::MULLW, 2, TmpReg2).addReg(TmpReg1).addReg(Op1Reg); |
| 2610 | } |
| 2611 | BuildMI(*MBB, IP, PPC::SUBF, 2, ResultReg).addReg(TmpReg2).addReg(Op0Reg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2612 | } |
| 2613 | } |
| 2614 | |
| 2615 | |
| 2616 | /// Shift instructions: 'shl', 'sar', 'shr' - Some special cases here |
| 2617 | /// for constant immediate shift values, and for constant immediate |
| 2618 | /// shift values equal to 1. Even the general case is sort of special, |
| 2619 | /// because the shift amount has to be in CL, not just any old register. |
| 2620 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 2621 | void PPC32ISel::visitShiftInst(ShiftInst &I) { |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 2622 | MachineBasicBlock::iterator IP = BB->end(); |
| 2623 | emitShiftOperation(BB, IP, I.getOperand(0), I.getOperand(1), |
| 2624 | I.getOpcode() == Instruction::Shl, I.getType(), |
| 2625 | getReg(I)); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2626 | } |
| 2627 | |
| 2628 | /// emitShiftOperation - Common code shared between visitShiftInst and |
| 2629 | /// constant expression support. |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2630 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 2631 | void PPC32ISel::emitShiftOperation(MachineBasicBlock *MBB, |
| 2632 | MachineBasicBlock::iterator IP, |
| 2633 | Value *Op, Value *ShiftAmount, |
| 2634 | bool isLeftShift, const Type *ResultTy, |
| 2635 | unsigned DestReg) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2636 | bool isSigned = ResultTy->isSigned (); |
| 2637 | unsigned Class = getClass (ResultTy); |
| 2638 | |
| 2639 | // Longs, as usual, are handled specially... |
| 2640 | if (Class == cLong) { |
Nate Begeman | 1b75022 | 2004-10-17 05:19:20 +0000 | [diff] [blame^] | 2641 | unsigned SrcReg = getReg (Op, MBB, IP); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2642 | // If we have a constant shift, we can generate much more efficient code |
Nate Begeman | 2d4c98d | 2004-10-16 20:43:38 +0000 | [diff] [blame] | 2643 | // than for a variable shift by using the rlwimi instruction. |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2644 | if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(ShiftAmount)) { |
| 2645 | unsigned Amount = CUI->getValue(); |
| 2646 | if (Amount < 32) { |
Nate Begeman | 2d4c98d | 2004-10-16 20:43:38 +0000 | [diff] [blame] | 2647 | unsigned TempReg = makeAnotherReg(ResultTy); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2648 | if (isLeftShift) { |
Nate Begeman | 2d4c98d | 2004-10-16 20:43:38 +0000 | [diff] [blame] | 2649 | BuildMI(*MBB, IP, PPC::RLWINM, 4, TempReg).addReg(SrcReg) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2650 | .addImm(Amount).addImm(0).addImm(31-Amount); |
Nate Begeman | 2d4c98d | 2004-10-16 20:43:38 +0000 | [diff] [blame] | 2651 | BuildMI(*MBB, IP, PPC::RLWIMI, 5, DestReg).addReg(TempReg) |
| 2652 | .addReg(SrcReg+1).addImm(Amount).addImm(32-Amount).addImm(31); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2653 | BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg+1).addReg(SrcReg+1) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2654 | .addImm(Amount).addImm(0).addImm(31-Amount); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2655 | } else { |
Nate Begeman | 2d4c98d | 2004-10-16 20:43:38 +0000 | [diff] [blame] | 2656 | BuildMI(*MBB, IP, PPC::RLWINM, 4, TempReg).addReg(SrcReg+1) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2657 | .addImm(32-Amount).addImm(Amount).addImm(31); |
Nate Begeman | 2d4c98d | 2004-10-16 20:43:38 +0000 | [diff] [blame] | 2658 | BuildMI(*MBB, IP, PPC::RLWIMI, 5, DestReg+1).addReg(TempReg) |
| 2659 | .addReg(SrcReg).addImm(32-Amount).addImm(0).addImm(Amount-1); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2660 | BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2661 | .addImm(32-Amount).addImm(Amount).addImm(31); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2662 | } |
| 2663 | } else { // Shifting more than 32 bits |
| 2664 | Amount -= 32; |
| 2665 | if (isLeftShift) { |
| 2666 | if (Amount != 0) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2667 | BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg+1) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2668 | .addImm(Amount).addImm(0).addImm(31-Amount); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2669 | } else { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2670 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg+1) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2671 | .addReg(SrcReg+1); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2672 | } |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2673 | BuildMI(*MBB, IP, PPC::LI, 1, DestReg+1).addSImm(0); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2674 | } else { |
| 2675 | if (Amount != 0) { |
| 2676 | if (isSigned) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2677 | BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg+1).addReg(SrcReg) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2678 | .addImm(Amount); |
| 2679 | else |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2680 | BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg+1).addReg(SrcReg) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2681 | .addImm(32-Amount).addImm(Amount).addImm(31); |
| 2682 | } else { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2683 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2684 | .addReg(SrcReg); |
| 2685 | } |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2686 | BuildMI(*MBB, IP,PPC::LI, 1, DestReg).addSImm(0); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2687 | } |
| 2688 | } |
| 2689 | } else { |
| 2690 | unsigned TmpReg1 = makeAnotherReg(Type::IntTy); |
| 2691 | unsigned TmpReg2 = makeAnotherReg(Type::IntTy); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 2692 | unsigned TmpReg3 = makeAnotherReg(Type::IntTy); |
| 2693 | unsigned TmpReg4 = makeAnotherReg(Type::IntTy); |
| 2694 | unsigned TmpReg5 = makeAnotherReg(Type::IntTy); |
| 2695 | unsigned TmpReg6 = makeAnotherReg(Type::IntTy); |
| 2696 | unsigned ShiftAmountReg = getReg (ShiftAmount, MBB, IP); |
| 2697 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2698 | if (isLeftShift) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2699 | BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2700 | .addSImm(32); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2701 | BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg2).addReg(SrcReg) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2702 | .addReg(ShiftAmountReg); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2703 | BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg3).addReg(SrcReg+1) |
Misha Brukman | 2ed17ca | 2004-07-22 15:58:04 +0000 | [diff] [blame] | 2704 | .addReg(TmpReg1); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2705 | BuildMI(*MBB, IP, PPC::OR, 2,TmpReg4).addReg(TmpReg2).addReg(TmpReg3); |
| 2706 | BuildMI(*MBB, IP, PPC::ADDI, 2, TmpReg5).addReg(ShiftAmountReg) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2707 | .addSImm(-32); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2708 | BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg6).addReg(SrcReg+1) |
Misha Brukman | 2ed17ca | 2004-07-22 15:58:04 +0000 | [diff] [blame] | 2709 | .addReg(TmpReg5); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2710 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(TmpReg4) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2711 | .addReg(TmpReg6); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2712 | BuildMI(*MBB, IP, PPC::SLW, 2, DestReg+1).addReg(SrcReg+1) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2713 | .addReg(ShiftAmountReg); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 2714 | } else { |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 2715 | if (isSigned) { // shift right algebraic |
| 2716 | MachineBasicBlock *TmpMBB =new MachineBasicBlock(BB->getBasicBlock()); |
| 2717 | MachineBasicBlock *PhiMBB =new MachineBasicBlock(BB->getBasicBlock()); |
| 2718 | MachineBasicBlock *OldMBB = BB; |
| 2719 | ilist<MachineBasicBlock>::iterator It = BB; ++It; |
| 2720 | F->getBasicBlockList().insert(It, TmpMBB); |
| 2721 | F->getBasicBlockList().insert(It, PhiMBB); |
| 2722 | BB->addSuccessor(TmpMBB); |
| 2723 | BB->addSuccessor(PhiMBB); |
| 2724 | |
| 2725 | BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg) |
| 2726 | .addSImm(32); |
| 2727 | BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg2).addReg(SrcReg+1) |
| 2728 | .addReg(ShiftAmountReg); |
| 2729 | BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg3).addReg(SrcReg) |
| 2730 | .addReg(TmpReg1); |
| 2731 | BuildMI(*MBB, IP, PPC::OR, 2, TmpReg4).addReg(TmpReg2) |
| 2732 | .addReg(TmpReg3); |
| 2733 | BuildMI(*MBB, IP, PPC::ADDICo, 2, TmpReg5).addReg(ShiftAmountReg) |
| 2734 | .addSImm(-32); |
| 2735 | BuildMI(*MBB, IP, PPC::SRAW, 2, TmpReg6).addReg(SrcReg) |
| 2736 | .addReg(TmpReg5); |
| 2737 | BuildMI(*MBB, IP, PPC::SRAW, 2, DestReg).addReg(SrcReg) |
| 2738 | .addReg(ShiftAmountReg); |
| 2739 | BuildMI(*MBB, IP, PPC::BLE, 2).addReg(PPC::CR0).addMBB(PhiMBB); |
| 2740 | |
| 2741 | // OrMBB: |
| 2742 | // Select correct least significant half if the shift amount > 32 |
| 2743 | BB = TmpMBB; |
| 2744 | unsigned OrReg = makeAnotherReg(Type::IntTy); |
| 2745 | BuildMI(BB, PPC::OR, 2, OrReg).addReg(TmpReg6).addImm(TmpReg6); |
| 2746 | TmpMBB->addSuccessor(PhiMBB); |
| 2747 | |
| 2748 | BB = PhiMBB; |
| 2749 | BuildMI(BB, PPC::PHI, 4, DestReg+1).addReg(TmpReg4).addMBB(OldMBB) |
| 2750 | .addReg(OrReg).addMBB(TmpMBB); |
| 2751 | } else { // shift right logical |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2752 | BuildMI(*MBB, IP, PPC::SUBFIC, 2, TmpReg1).addReg(ShiftAmountReg) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2753 | .addSImm(32); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2754 | BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg2).addReg(SrcReg+1) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2755 | .addReg(ShiftAmountReg); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2756 | BuildMI(*MBB, IP, PPC::SLW, 2, TmpReg3).addReg(SrcReg) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2757 | .addReg(TmpReg1); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2758 | BuildMI(*MBB, IP, PPC::OR, 2, TmpReg4).addReg(TmpReg2) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2759 | .addReg(TmpReg3); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2760 | BuildMI(*MBB, IP, PPC::ADDI, 2, TmpReg5).addReg(ShiftAmountReg) |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 2761 | .addSImm(-32); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2762 | BuildMI(*MBB, IP, PPC::SRW, 2, TmpReg6).addReg(SrcReg) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2763 | .addReg(TmpReg5); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2764 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(TmpReg4) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2765 | .addReg(TmpReg6); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2766 | BuildMI(*MBB, IP, PPC::SRW, 2, DestReg).addReg(SrcReg) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2767 | .addReg(ShiftAmountReg); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 2768 | } |
| 2769 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2770 | } |
| 2771 | return; |
| 2772 | } |
| 2773 | |
| 2774 | if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(ShiftAmount)) { |
| 2775 | // The shift amount is constant, guaranteed to be a ubyte. Get its value. |
| 2776 | assert(CUI->getType() == Type::UByteTy && "Shift amount not a ubyte?"); |
| 2777 | unsigned Amount = CUI->getValue(); |
Nate Begeman | 1b75022 | 2004-10-17 05:19:20 +0000 | [diff] [blame^] | 2778 | |
| 2779 | // If this is a left shift with one use, and that use is an And instruction, |
| 2780 | // then attempt to emit a bitfield insert. |
| 2781 | if (isLeftShift) { |
| 2782 | User *U = Op->use_back(); |
| 2783 | if (U->hasOneUse()) { |
| 2784 | Value *V = *(U->use_begin()); |
| 2785 | BinaryOperator *BO = dyn_cast<BinaryOperator>(V); |
| 2786 | if (BO && BO->getOpcode() == Instruction::And) { |
| 2787 | if (emitBitfieldInsert(BO, Amount, Op)) |
| 2788 | return; |
| 2789 | } |
| 2790 | } |
| 2791 | } |
| 2792 | |
| 2793 | unsigned SrcReg = getReg (Op, MBB, IP); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 2794 | if (isLeftShift) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2795 | BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2796 | .addImm(Amount).addImm(0).addImm(31-Amount); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 2797 | } else { |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2798 | if (isSigned) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2799 | BuildMI(*MBB, IP, PPC::SRAWI,2,DestReg).addReg(SrcReg).addImm(Amount); |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2800 | } else { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2801 | BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2802 | .addImm(32-Amount).addImm(Amount).addImm(31); |
| 2803 | } |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 2804 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2805 | } else { // The shift amount is non-constant. |
Nate Begeman | 1b75022 | 2004-10-17 05:19:20 +0000 | [diff] [blame^] | 2806 | unsigned SrcReg = getReg (Op, MBB, IP); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2807 | unsigned ShiftAmountReg = getReg (ShiftAmount, MBB, IP); |
| 2808 | |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 2809 | if (isLeftShift) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2810 | BuildMI(*MBB, IP, PPC::SLW, 2, DestReg).addReg(SrcReg) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2811 | .addReg(ShiftAmountReg); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 2812 | } else { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2813 | BuildMI(*MBB, IP, isSigned ? PPC::SRAW : PPC::SRW, 2, DestReg) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2814 | .addReg(SrcReg).addReg(ShiftAmountReg); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 2815 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2816 | } |
| 2817 | } |
| 2818 | |
Nate Begeman | 0e5e5f5 | 2004-08-22 08:10:15 +0000 | [diff] [blame] | 2819 | /// LoadNeedsSignExtend - On PowerPC, there is no load byte with sign extend. |
| 2820 | /// Therefore, if this is a byte load and the destination type is signed, we |
Nate Begeman | 35b020d | 2004-10-06 11:03:30 +0000 | [diff] [blame] | 2821 | /// would normally need to also emit a sign extend instruction after the load. |
Nate Begeman | 0e5e5f5 | 2004-08-22 08:10:15 +0000 | [diff] [blame] | 2822 | /// However, store instructions don't care whether a signed type was sign |
| 2823 | /// extended across a whole register. Also, a SetCC instruction will emit its |
| 2824 | /// own sign extension to force the value into the appropriate range, so we |
| 2825 | /// need not emit it here. Ideally, this kind of thing wouldn't be necessary |
| 2826 | /// once LLVM's type system is improved. |
| 2827 | static bool LoadNeedsSignExtend(LoadInst &LI) { |
| 2828 | if (cByte == getClassB(LI.getType()) && LI.getType()->isSigned()) { |
| 2829 | bool AllUsesAreStoresOrSetCC = true; |
Nate Begeman | 35b020d | 2004-10-06 11:03:30 +0000 | [diff] [blame] | 2830 | for (Value::use_iterator I = LI.use_begin(), E = LI.use_end(); I != E; ++I){ |
Chris Lattner | 7c348e1 | 2004-10-06 16:28:24 +0000 | [diff] [blame] | 2831 | if (isa<SetCondInst>(*I)) |
Nate Begeman | 35b020d | 2004-10-06 11:03:30 +0000 | [diff] [blame] | 2832 | continue; |
Chris Lattner | 7c348e1 | 2004-10-06 16:28:24 +0000 | [diff] [blame] | 2833 | if (StoreInst *SI = dyn_cast<StoreInst>(*I)) |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 2834 | if (cByte == getClassB(SI->getOperand(0)->getType())) |
Nate Begeman | 35b020d | 2004-10-06 11:03:30 +0000 | [diff] [blame] | 2835 | continue; |
| 2836 | AllUsesAreStoresOrSetCC = false; |
| 2837 | break; |
| 2838 | } |
Nate Begeman | 0e5e5f5 | 2004-08-22 08:10:15 +0000 | [diff] [blame] | 2839 | if (!AllUsesAreStoresOrSetCC) |
| 2840 | return true; |
| 2841 | } |
| 2842 | return false; |
| 2843 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2844 | |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2845 | /// visitLoadInst - Implement LLVM load instructions. Pretty straightforward |
| 2846 | /// mapping of LLVM classes to PPC load instructions, with the exception of |
| 2847 | /// signed byte loads, which need a sign extension following them. |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2848 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 2849 | void PPC32ISel::visitLoadInst(LoadInst &I) { |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2850 | // Immediate opcodes, for reg+imm addressing |
| 2851 | static const unsigned ImmOpcodes[] = { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2852 | PPC::LBZ, PPC::LHZ, PPC::LWZ, |
| 2853 | PPC::LFS, PPC::LFD, PPC::LWZ |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2854 | }; |
| 2855 | // Indexed opcodes, for reg+reg addressing |
| 2856 | static const unsigned IdxOpcodes[] = { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2857 | PPC::LBZX, PPC::LHZX, PPC::LWZX, |
| 2858 | PPC::LFSX, PPC::LFDX, PPC::LWZX |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 2859 | }; |
Misha Brukman | 2ed17ca | 2004-07-22 15:58:04 +0000 | [diff] [blame] | 2860 | |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2861 | unsigned Class = getClassB(I.getType()); |
| 2862 | unsigned ImmOpcode = ImmOpcodes[Class]; |
| 2863 | unsigned IdxOpcode = IdxOpcodes[Class]; |
| 2864 | unsigned DestReg = getReg(I); |
| 2865 | Value *SourceAddr = I.getOperand(0); |
| 2866 | |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2867 | if (Class == cShort && I.getType()->isSigned()) ImmOpcode = PPC::LHA; |
| 2868 | if (Class == cShort && I.getType()->isSigned()) IdxOpcode = PPC::LHAX; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2869 | |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2870 | if (AllocaInst *AI = dyn_castFixedAlloca(SourceAddr)) { |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 2871 | unsigned FI = getFixedSizedAllocaFI(AI); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2872 | if (Class == cLong) { |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2873 | addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg), FI); |
| 2874 | addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg+1), FI, 4); |
Nate Begeman | 0e5e5f5 | 2004-08-22 08:10:15 +0000 | [diff] [blame] | 2875 | } else if (LoadNeedsSignExtend(I)) { |
Misha Brukman | 2ed17ca | 2004-07-22 15:58:04 +0000 | [diff] [blame] | 2876 | unsigned TmpReg = makeAnotherReg(I.getType()); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2877 | addFrameReference(BuildMI(BB, ImmOpcode, 2, TmpReg), FI); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2878 | BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2879 | } else { |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2880 | addFrameReference(BuildMI(BB, ImmOpcode, 2, DestReg), FI); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 2881 | } |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2882 | return; |
| 2883 | } |
| 2884 | |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 2885 | // If the offset fits in 16 bits, we can emit a reg+imm load, otherwise, we |
| 2886 | // use the index from the FoldedGEP struct and use reg+reg addressing. |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2887 | if (GetElementPtrInst *GEPI = canFoldGEPIntoLoadOrStore(SourceAddr)) { |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2888 | |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 2889 | // Generate the code for the GEP and get the components of the folded GEP |
| 2890 | emitGEPOperation(BB, BB->end(), GEPI, true); |
| 2891 | unsigned baseReg = GEPMap[GEPI].base; |
| 2892 | unsigned indexReg = GEPMap[GEPI].index; |
| 2893 | ConstantSInt *offset = GEPMap[GEPI].offset; |
| 2894 | |
| 2895 | if (Class != cLong) { |
| 2896 | unsigned TmpReg = makeAnotherReg(I.getType()); |
| 2897 | if (indexReg == 0) |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2898 | BuildMI(BB, ImmOpcode, 2, TmpReg).addSImm(offset->getValue()) |
| 2899 | .addReg(baseReg); |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 2900 | else |
| 2901 | BuildMI(BB, IdxOpcode, 2, TmpReg).addReg(indexReg).addReg(baseReg); |
| 2902 | if (LoadNeedsSignExtend(I)) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2903 | BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg); |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 2904 | else |
| 2905 | BuildMI(BB, PPC::OR, 2, DestReg).addReg(TmpReg).addReg(TmpReg); |
| 2906 | } else { |
| 2907 | indexReg = (indexReg != 0) ? indexReg : getReg(offset); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2908 | unsigned indexPlus4 = makeAnotherReg(Type::IntTy); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2909 | BuildMI(BB, PPC::ADDI, 2, indexPlus4).addReg(indexReg).addSImm(4); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2910 | BuildMI(BB, IdxOpcode, 2, DestReg).addReg(indexReg).addReg(baseReg); |
| 2911 | BuildMI(BB, IdxOpcode, 2, DestReg+1).addReg(indexPlus4).addReg(baseReg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2912 | } |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2913 | return; |
| 2914 | } |
| 2915 | |
| 2916 | // The fallback case, where the load was from a source that could not be |
| 2917 | // folded into the load instruction. |
| 2918 | unsigned SrcAddrReg = getReg(SourceAddr); |
| 2919 | |
| 2920 | if (Class == cLong) { |
| 2921 | BuildMI(BB, ImmOpcode, 2, DestReg).addSImm(0).addReg(SrcAddrReg); |
| 2922 | BuildMI(BB, ImmOpcode, 2, DestReg+1).addSImm(4).addReg(SrcAddrReg); |
Nate Begeman | 0e5e5f5 | 2004-08-22 08:10:15 +0000 | [diff] [blame] | 2923 | } else if (LoadNeedsSignExtend(I)) { |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2924 | unsigned TmpReg = makeAnotherReg(I.getType()); |
| 2925 | BuildMI(BB, ImmOpcode, 2, TmpReg).addSImm(0).addReg(SrcAddrReg); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2926 | BuildMI(BB, PPC::EXTSB, 1, DestReg).addReg(TmpReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2927 | } else { |
| 2928 | BuildMI(BB, ImmOpcode, 2, DestReg).addSImm(0).addReg(SrcAddrReg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2929 | } |
| 2930 | } |
| 2931 | |
| 2932 | /// visitStoreInst - Implement LLVM store instructions |
| 2933 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 2934 | void PPC32ISel::visitStoreInst(StoreInst &I) { |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2935 | // Immediate opcodes, for reg+imm addressing |
| 2936 | static const unsigned ImmOpcodes[] = { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2937 | PPC::STB, PPC::STH, PPC::STW, |
| 2938 | PPC::STFS, PPC::STFD, PPC::STW |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2939 | }; |
| 2940 | // Indexed opcodes, for reg+reg addressing |
| 2941 | static const unsigned IdxOpcodes[] = { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2942 | PPC::STBX, PPC::STHX, PPC::STWX, |
| 2943 | PPC::STFSX, PPC::STFDX, PPC::STWX |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2944 | }; |
| 2945 | |
| 2946 | Value *SourceAddr = I.getOperand(1); |
| 2947 | const Type *ValTy = I.getOperand(0)->getType(); |
| 2948 | unsigned Class = getClassB(ValTy); |
| 2949 | unsigned ImmOpcode = ImmOpcodes[Class]; |
| 2950 | unsigned IdxOpcode = IdxOpcodes[Class]; |
| 2951 | unsigned ValReg = getReg(I.getOperand(0)); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2952 | |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 2953 | // If the offset fits in 16 bits, we can emit a reg+imm store, otherwise, we |
| 2954 | // use the index from the FoldedGEP struct and use reg+reg addressing. |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2955 | if (GetElementPtrInst *GEPI = canFoldGEPIntoLoadOrStore(SourceAddr)) { |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 2956 | // Generate the code for the GEP and get the components of the folded GEP |
| 2957 | emitGEPOperation(BB, BB->end(), GEPI, true); |
| 2958 | unsigned baseReg = GEPMap[GEPI].base; |
| 2959 | unsigned indexReg = GEPMap[GEPI].index; |
| 2960 | ConstantSInt *offset = GEPMap[GEPI].offset; |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2961 | |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 2962 | if (Class != cLong) { |
| 2963 | if (indexReg == 0) |
| 2964 | BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(offset->getValue()) |
| 2965 | .addReg(baseReg); |
| 2966 | else |
| 2967 | BuildMI(BB, IdxOpcode, 3).addReg(ValReg).addReg(indexReg) |
| 2968 | .addReg(baseReg); |
| 2969 | } else { |
| 2970 | indexReg = (indexReg != 0) ? indexReg : getReg(offset); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2971 | unsigned indexPlus4 = makeAnotherReg(Type::IntTy); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 2972 | BuildMI(BB, PPC::ADDI, 2, indexPlus4).addReg(indexReg).addSImm(4); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2973 | BuildMI(BB, IdxOpcode, 3).addReg(ValReg).addReg(indexReg).addReg(baseReg); |
| 2974 | BuildMI(BB, IdxOpcode, 3).addReg(ValReg+1).addReg(indexPlus4) |
| 2975 | .addReg(baseReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2976 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2977 | return; |
| 2978 | } |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 2979 | |
| 2980 | // If the store address wasn't the only use of a GEP, we fall back to the |
| 2981 | // standard path: store the ValReg at the value in AddressReg. |
| 2982 | unsigned AddressReg = getReg(I.getOperand(1)); |
| 2983 | if (Class == cLong) { |
| 2984 | BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(0).addReg(AddressReg); |
| 2985 | BuildMI(BB, ImmOpcode, 3).addReg(ValReg+1).addSImm(4).addReg(AddressReg); |
| 2986 | return; |
| 2987 | } |
| 2988 | BuildMI(BB, ImmOpcode, 3).addReg(ValReg).addSImm(0).addReg(AddressReg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2989 | } |
| 2990 | |
| 2991 | |
| 2992 | /// visitCastInst - Here we have various kinds of copying with or without sign |
| 2993 | /// extension going on. |
| 2994 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 2995 | void PPC32ISel::visitCastInst(CastInst &CI) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 2996 | Value *Op = CI.getOperand(0); |
| 2997 | |
| 2998 | unsigned SrcClass = getClassB(Op->getType()); |
| 2999 | unsigned DestClass = getClassB(CI.getType()); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3000 | |
| 3001 | // If this is a cast from a 32-bit integer to a Long type, and the only uses |
Nate Begeman | 1e67d4d | 2004-08-19 08:07:50 +0000 | [diff] [blame] | 3002 | // of the cast are GEP instructions, then the cast does not need to be |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3003 | // generated explicitly, it will be folded into the GEP. |
| 3004 | if (DestClass == cLong && SrcClass == cInt) { |
| 3005 | bool AllUsesAreGEPs = true; |
| 3006 | for (Value::use_iterator I = CI.use_begin(), E = CI.use_end(); I != E; ++I) |
| 3007 | if (!isa<GetElementPtrInst>(*I)) { |
| 3008 | AllUsesAreGEPs = false; |
| 3009 | break; |
| 3010 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3011 | if (AllUsesAreGEPs) return; |
| 3012 | } |
Nate Begeman | 1e67d4d | 2004-08-19 08:07:50 +0000 | [diff] [blame] | 3013 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3014 | unsigned DestReg = getReg(CI); |
| 3015 | MachineBasicBlock::iterator MI = BB->end(); |
Nate Begeman | 1e67d4d | 2004-08-19 08:07:50 +0000 | [diff] [blame] | 3016 | |
| 3017 | // If this is a cast from an byte, short, or int to an integer type of equal |
| 3018 | // or lesser width, and all uses of the cast are store instructions then dont |
| 3019 | // emit them, as the store instruction will implicitly not store the zero or |
| 3020 | // sign extended bytes. |
| 3021 | if (SrcClass <= cInt && SrcClass >= DestClass) { |
| 3022 | bool AllUsesAreStoresOrSetCC = true; |
| 3023 | for (Value::use_iterator I = CI.use_begin(), E = CI.use_end(); I != E; ++I) |
| 3024 | if (!isa<StoreInst>(*I) && !isa<SetCondInst>(*I)) { |
| 3025 | AllUsesAreStoresOrSetCC = false; |
| 3026 | break; |
| 3027 | } |
| 3028 | // Turn this cast directly into a move instruction, which the register |
| 3029 | // allocator will deal with. |
| 3030 | if (AllUsesAreStoresOrSetCC) { |
| 3031 | unsigned SrcReg = getReg(Op, BB, MI); |
| 3032 | BuildMI(*BB, MI, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg); |
| 3033 | return; |
| 3034 | } |
| 3035 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3036 | emitCastOperation(BB, MI, Op, CI.getType(), DestReg); |
| 3037 | } |
| 3038 | |
| 3039 | /// emitCastOperation - Common code shared between visitCastInst and constant |
| 3040 | /// expression cast support. |
| 3041 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 3042 | void PPC32ISel::emitCastOperation(MachineBasicBlock *MBB, |
| 3043 | MachineBasicBlock::iterator IP, |
| 3044 | Value *Src, const Type *DestTy, |
| 3045 | unsigned DestReg) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3046 | const Type *SrcTy = Src->getType(); |
| 3047 | unsigned SrcClass = getClassB(SrcTy); |
| 3048 | unsigned DestClass = getClassB(DestTy); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 3049 | unsigned SrcReg = getReg(Src, MBB, IP); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3050 | |
| 3051 | // Implement casts to bool by using compare on the operand followed by set if |
| 3052 | // not zero on the result. |
| 3053 | if (DestTy == Type::BoolTy) { |
| 3054 | switch (SrcClass) { |
| 3055 | case cByte: |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 3056 | case cShort: |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3057 | case cInt: { |
| 3058 | unsigned TmpReg = makeAnotherReg(Type::IntTy); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3059 | BuildMI(*MBB, IP, PPC::ADDIC, 2, TmpReg).addReg(SrcReg).addSImm(-1); |
| 3060 | BuildMI(*MBB, IP, PPC::SUBFE, 2, DestReg).addReg(TmpReg).addReg(SrcReg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3061 | break; |
| 3062 | } |
| 3063 | case cLong: { |
| 3064 | unsigned TmpReg = makeAnotherReg(Type::IntTy); |
| 3065 | unsigned SrcReg2 = makeAnotherReg(Type::IntTy); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3066 | BuildMI(*MBB, IP, PPC::OR, 2, SrcReg2).addReg(SrcReg).addReg(SrcReg+1); |
| 3067 | BuildMI(*MBB, IP, PPC::ADDIC, 2, TmpReg).addReg(SrcReg2).addSImm(-1); |
| 3068 | BuildMI(*MBB, IP, PPC::SUBFE, 2, DestReg).addReg(TmpReg) |
Misha Brukman | bf417a6 | 2004-07-20 20:43:05 +0000 | [diff] [blame] | 3069 | .addReg(SrcReg2); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3070 | break; |
| 3071 | } |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 3072 | case cFP32: |
| 3073 | case cFP64: |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3074 | unsigned TmpReg = makeAnotherReg(Type::IntTy); |
| 3075 | unsigned ConstZero = getReg(ConstantFP::get(Type::DoubleTy, 0.0), BB, IP); |
| 3076 | BuildMI(*MBB, IP, PPC::FCMPU, PPC::CR7).addReg(SrcReg).addReg(ConstZero); |
| 3077 | BuildMI(*MBB, IP, PPC::MFCR, TmpReg); |
| 3078 | BuildMI(*MBB, IP, PPC::RLWINM, DestReg).addReg(TmpReg).addImm(31) |
| 3079 | .addImm(31).addImm(31); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3080 | } |
| 3081 | return; |
| 3082 | } |
| 3083 | |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 3084 | // Handle cast of Float -> Double |
| 3085 | if (SrcClass == cFP32 && DestClass == cFP64) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3086 | BuildMI(*MBB, IP, PPC::FMR, 1, DestReg).addReg(SrcReg); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 3087 | return; |
| 3088 | } |
| 3089 | |
| 3090 | // Handle cast of Double -> Float |
| 3091 | if (SrcClass == cFP64 && DestClass == cFP32) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3092 | BuildMI(*MBB, IP, PPC::FRSP, 1, DestReg).addReg(SrcReg); |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 3093 | return; |
| 3094 | } |
| 3095 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3096 | // Handle casts from integer to floating point now... |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 3097 | if (DestClass == cFP32 || DestClass == cFP64) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3098 | |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 3099 | // Emit a library call for long to float conversion |
| 3100 | if (SrcClass == cLong) { |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 3101 | Function *floatFn = (DestClass == cFP32) ? __floatdisfFn : __floatdidfFn; |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3102 | if (SrcTy->isSigned()) { |
| 3103 | std::vector<ValueRecord> Args; |
| 3104 | Args.push_back(ValueRecord(SrcReg, SrcTy)); |
| 3105 | MachineInstr *TheCall = |
| 3106 | BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true); |
| 3107 | doCall(ValueRecord(DestReg, DestTy), TheCall, Args, false); |
| 3108 | TM.CalledFunctions.insert(floatFn); |
| 3109 | } else { |
| 3110 | std::vector<ValueRecord> CmpArgs, ClrArgs, SetArgs; |
| 3111 | unsigned ZeroLong = getReg(ConstantUInt::get(SrcTy, 0)); |
| 3112 | unsigned CondReg = makeAnotherReg(Type::IntTy); |
| 3113 | |
| 3114 | // Update machine-CFG edges |
| 3115 | MachineBasicBlock *ClrMBB = new MachineBasicBlock(BB->getBasicBlock()); |
| 3116 | MachineBasicBlock *SetMBB = new MachineBasicBlock(BB->getBasicBlock()); |
| 3117 | MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock()); |
| 3118 | MachineBasicBlock *OldMBB = BB; |
| 3119 | ilist<MachineBasicBlock>::iterator It = BB; ++It; |
| 3120 | F->getBasicBlockList().insert(It, ClrMBB); |
| 3121 | F->getBasicBlockList().insert(It, SetMBB); |
| 3122 | F->getBasicBlockList().insert(It, PhiMBB); |
| 3123 | BB->addSuccessor(ClrMBB); |
| 3124 | BB->addSuccessor(SetMBB); |
| 3125 | |
| 3126 | CmpArgs.push_back(ValueRecord(SrcReg, SrcTy)); |
| 3127 | CmpArgs.push_back(ValueRecord(ZeroLong, SrcTy)); |
| 3128 | MachineInstr *TheCall = |
| 3129 | BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(__cmpdi2Fn, true); |
| 3130 | doCall(ValueRecord(CondReg, Type::IntTy), TheCall, CmpArgs, false); |
| 3131 | TM.CalledFunctions.insert(__cmpdi2Fn); |
| 3132 | BuildMI(*MBB, IP, PPC::CMPWI, 2, PPC::CR0).addReg(CondReg).addSImm(0); |
| 3133 | BuildMI(*MBB, IP, PPC::BLE, 2).addReg(PPC::CR0).addMBB(SetMBB); |
| 3134 | |
| 3135 | // ClrMBB |
| 3136 | BB = ClrMBB; |
| 3137 | unsigned ClrReg = makeAnotherReg(DestTy); |
| 3138 | ClrArgs.push_back(ValueRecord(SrcReg, SrcTy)); |
| 3139 | TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true); |
| 3140 | doCall(ValueRecord(ClrReg, DestTy), TheCall, ClrArgs, false); |
| 3141 | TM.CalledFunctions.insert(floatFn); |
| 3142 | BuildMI(BB, PPC::B, 1).addMBB(PhiMBB); |
| 3143 | BB->addSuccessor(PhiMBB); |
| 3144 | |
| 3145 | // SetMBB |
| 3146 | BB = SetMBB; |
| 3147 | unsigned SetReg = makeAnotherReg(DestTy); |
| 3148 | unsigned CallReg = makeAnotherReg(DestTy); |
| 3149 | unsigned ShiftedReg = makeAnotherReg(SrcTy); |
| 3150 | ConstantSInt *Const1 = ConstantSInt::get(Type::IntTy, 1); |
| 3151 | emitShiftOperation(BB, BB->end(), Src, Const1, false, SrcTy, ShiftedReg); |
| 3152 | SetArgs.push_back(ValueRecord(ShiftedReg, SrcTy)); |
| 3153 | TheCall = BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true); |
| 3154 | doCall(ValueRecord(CallReg, DestTy), TheCall, SetArgs, false); |
| 3155 | TM.CalledFunctions.insert(floatFn); |
| 3156 | unsigned SetOpcode = (DestClass == cFP32) ? PPC::FADDS : PPC::FADD; |
| 3157 | BuildMI(BB, SetOpcode, 2, SetReg).addReg(CallReg).addReg(CallReg); |
| 3158 | BB->addSuccessor(PhiMBB); |
| 3159 | |
| 3160 | // PhiMBB |
| 3161 | BB = PhiMBB; |
| 3162 | BuildMI(BB, PPC::PHI, 4, DestReg).addReg(ClrReg).addMBB(ClrMBB) |
| 3163 | .addReg(SetReg).addMBB(SetMBB); |
| 3164 | } |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 3165 | return; |
| 3166 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3167 | |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 3168 | // Make sure we're dealing with a full 32 bits |
| 3169 | unsigned TmpReg = makeAnotherReg(Type::IntTy); |
| 3170 | promote32(TmpReg, ValueRecord(SrcReg, SrcTy)); |
| 3171 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3172 | SrcReg = TmpReg; |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 3173 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3174 | // Spill the integer to memory and reload it from there. |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 3175 | // Also spill room for a special conversion constant |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3176 | int ValueFrameIdx = |
| 3177 | F->getFrameInfo()->CreateStackObject(Type::DoubleTy, TM.getTargetData()); |
| 3178 | |
Nate Begeman | 81d265d | 2004-08-19 05:20:54 +0000 | [diff] [blame] | 3179 | MachineConstantPool *CP = F->getConstantPool(); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 3180 | unsigned constantHi = makeAnotherReg(Type::IntTy); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 3181 | unsigned TempF = makeAnotherReg(Type::DoubleTy); |
| 3182 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3183 | if (!SrcTy->isSigned()) { |
Nate Begeman | 81d265d | 2004-08-19 05:20:54 +0000 | [diff] [blame] | 3184 | ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, 0x1.000000p52); |
| 3185 | unsigned ConstF = getReg(CFP, BB, IP); |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3186 | BuildMI(*MBB, IP, PPC::LIS, 1, constantHi).addSImm(0x4330); |
| 3187 | addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(constantHi), |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 3188 | ValueFrameIdx); |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3189 | addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(SrcReg), |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 3190 | ValueFrameIdx, 4); |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3191 | addFrameReference(BuildMI(*MBB, IP, PPC::LFD, 2, TempF), ValueFrameIdx); |
| 3192 | BuildMI(*MBB, IP, PPC::FSUB, 2, DestReg).addReg(TempF).addReg(ConstF); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 3193 | } else { |
Nate Begeman | 81d265d | 2004-08-19 05:20:54 +0000 | [diff] [blame] | 3194 | ConstantFP *CFP = ConstantFP::get(Type::DoubleTy, 0x1.000008p52); |
| 3195 | unsigned ConstF = getReg(CFP, BB, IP); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 3196 | unsigned TempLo = makeAnotherReg(Type::IntTy); |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3197 | BuildMI(*MBB, IP, PPC::LIS, 1, constantHi).addSImm(0x4330); |
| 3198 | addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(constantHi), |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 3199 | ValueFrameIdx); |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3200 | BuildMI(*MBB, IP, PPC::XORIS, 2, TempLo).addReg(SrcReg).addImm(0x8000); |
| 3201 | addFrameReference(BuildMI(*MBB, IP, PPC::STW, 3).addReg(TempLo), |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 3202 | ValueFrameIdx, 4); |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3203 | addFrameReference(BuildMI(*MBB, IP, PPC::LFD, 2, TempF), ValueFrameIdx); |
| 3204 | BuildMI(*MBB, IP, PPC::FSUB, 2, DestReg).addReg(TempF).addReg(ConstF); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 3205 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3206 | return; |
| 3207 | } |
| 3208 | |
| 3209 | // Handle casts from floating point to integer now... |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 3210 | if (SrcClass == cFP32 || SrcClass == cFP64) { |
Nate Begeman | b64af91 | 2004-08-10 20:42:36 +0000 | [diff] [blame] | 3211 | static Function* const Funcs[] = |
| 3212 | { __fixsfdiFn, __fixdfdiFn, __fixunssfdiFn, __fixunsdfdiFn }; |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 3213 | // emit library call |
| 3214 | if (DestClass == cLong) { |
Nate Begeman | b64af91 | 2004-08-10 20:42:36 +0000 | [diff] [blame] | 3215 | bool isDouble = SrcClass == cFP64; |
| 3216 | unsigned nameIndex = 2 * DestTy->isSigned() + isDouble; |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 3217 | std::vector<ValueRecord> Args; |
| 3218 | Args.push_back(ValueRecord(SrcReg, SrcTy)); |
Nate Begeman | b64af91 | 2004-08-10 20:42:36 +0000 | [diff] [blame] | 3219 | Function *floatFn = Funcs[nameIndex]; |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 3220 | MachineInstr *TheCall = |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3221 | BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(floatFn, true); |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 3222 | doCall(ValueRecord(DestReg, DestTy), TheCall, Args, false); |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 3223 | TM.CalledFunctions.insert(floatFn); |
Misha Brukman | 422791f | 2004-06-21 17:41:12 +0000 | [diff] [blame] | 3224 | return; |
| 3225 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3226 | |
| 3227 | int ValueFrameIdx = |
Nate Begeman | 43d64ea | 2004-08-15 06:42:28 +0000 | [diff] [blame] | 3228 | F->getFrameInfo()->CreateStackObject(Type::DoubleTy, TM.getTargetData()); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3229 | |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 3230 | if (DestTy->isSigned()) { |
Misha Brukman | 4c14f33 | 2004-07-23 01:11:19 +0000 | [diff] [blame] | 3231 | unsigned TempReg = makeAnotherReg(Type::DoubleTy); |
| 3232 | |
| 3233 | // Convert to integer in the FP reg and store it to a stack slot |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3234 | BuildMI(*MBB, IP, PPC::FCTIWZ, 1, TempReg).addReg(SrcReg); |
| 3235 | addFrameReference(BuildMI(*MBB, IP, PPC::STFD, 3) |
Misha Brukman | 4c14f33 | 2004-07-23 01:11:19 +0000 | [diff] [blame] | 3236 | .addReg(TempReg), ValueFrameIdx); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3237 | |
| 3238 | // There is no load signed byte opcode, so we must emit a sign extend for |
| 3239 | // that particular size. Make sure to source the new integer from the |
| 3240 | // correct offset. |
Misha Brukman | 4c14f33 | 2004-07-23 01:11:19 +0000 | [diff] [blame] | 3241 | if (DestClass == cByte) { |
| 3242 | unsigned TempReg2 = makeAnotherReg(DestTy); |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3243 | addFrameReference(BuildMI(*MBB, IP, PPC::LBZ, 2, TempReg2), |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3244 | ValueFrameIdx, 7); |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3245 | BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(TempReg2); |
Misha Brukman | 4c14f33 | 2004-07-23 01:11:19 +0000 | [diff] [blame] | 3246 | } else { |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3247 | int offset = (DestClass == cShort) ? 6 : 4; |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3248 | unsigned LoadOp = (DestClass == cShort) ? PPC::LHA : PPC::LWZ; |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3249 | addFrameReference(BuildMI(*MBB, IP, LoadOp, 2, DestReg), |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3250 | ValueFrameIdx, offset); |
Misha Brukman | 4c14f33 | 2004-07-23 01:11:19 +0000 | [diff] [blame] | 3251 | } |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 3252 | } else { |
Misha Brukman | b160d1f | 2004-07-23 20:32:59 +0000 | [diff] [blame] | 3253 | unsigned Zero = getReg(ConstantFP::get(Type::DoubleTy, 0.0f)); |
| 3254 | double maxInt = (1LL << 32) - 1; |
| 3255 | unsigned MaxInt = getReg(ConstantFP::get(Type::DoubleTy, maxInt)); |
| 3256 | double border = 1LL << 31; |
| 3257 | unsigned Border = getReg(ConstantFP::get(Type::DoubleTy, border)); |
| 3258 | unsigned UseZero = makeAnotherReg(Type::DoubleTy); |
| 3259 | unsigned UseMaxInt = makeAnotherReg(Type::DoubleTy); |
| 3260 | unsigned UseChoice = makeAnotherReg(Type::DoubleTy); |
| 3261 | unsigned TmpReg = makeAnotherReg(Type::DoubleTy); |
| 3262 | unsigned TmpReg2 = makeAnotherReg(Type::DoubleTy); |
| 3263 | unsigned ConvReg = makeAnotherReg(Type::DoubleTy); |
| 3264 | unsigned IntTmp = makeAnotherReg(Type::IntTy); |
| 3265 | unsigned XorReg = makeAnotherReg(Type::IntTy); |
| 3266 | int FrameIdx = |
| 3267 | F->getFrameInfo()->CreateStackObject(SrcTy, TM.getTargetData()); |
| 3268 | // Update machine-CFG edges |
| 3269 | MachineBasicBlock *XorMBB = new MachineBasicBlock(BB->getBasicBlock()); |
| 3270 | MachineBasicBlock *PhiMBB = new MachineBasicBlock(BB->getBasicBlock()); |
| 3271 | MachineBasicBlock *OldMBB = BB; |
| 3272 | ilist<MachineBasicBlock>::iterator It = BB; ++It; |
| 3273 | F->getBasicBlockList().insert(It, XorMBB); |
| 3274 | F->getBasicBlockList().insert(It, PhiMBB); |
| 3275 | BB->addSuccessor(XorMBB); |
| 3276 | BB->addSuccessor(PhiMBB); |
| 3277 | |
| 3278 | // Convert from floating point to unsigned 32-bit value |
| 3279 | // Use 0 if incoming value is < 0.0 |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3280 | BuildMI(*MBB, IP, PPC::FSEL, 3, UseZero).addReg(SrcReg).addReg(SrcReg) |
Misha Brukman | b160d1f | 2004-07-23 20:32:59 +0000 | [diff] [blame] | 3281 | .addReg(Zero); |
| 3282 | // Use 2**32 - 1 if incoming value is >= 2**32 |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3283 | BuildMI(*MBB, IP, PPC::FSUB, 2, UseMaxInt).addReg(MaxInt).addReg(SrcReg); |
| 3284 | BuildMI(*MBB, IP, PPC::FSEL, 3, UseChoice).addReg(UseMaxInt) |
Misha Brukman | b160d1f | 2004-07-23 20:32:59 +0000 | [diff] [blame] | 3285 | .addReg(UseZero).addReg(MaxInt); |
| 3286 | // Subtract 2**31 |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3287 | BuildMI(*MBB, IP, PPC::FSUB, 2, TmpReg).addReg(UseChoice).addReg(Border); |
Misha Brukman | b160d1f | 2004-07-23 20:32:59 +0000 | [diff] [blame] | 3288 | // Use difference if >= 2**31 |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3289 | BuildMI(*MBB, IP, PPC::FCMPU, 2, PPC::CR0).addReg(UseChoice) |
Misha Brukman | b160d1f | 2004-07-23 20:32:59 +0000 | [diff] [blame] | 3290 | .addReg(Border); |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3291 | BuildMI(*MBB, IP, PPC::FSEL, 3, TmpReg2).addReg(TmpReg).addReg(TmpReg) |
Misha Brukman | b160d1f | 2004-07-23 20:32:59 +0000 | [diff] [blame] | 3292 | .addReg(UseChoice); |
| 3293 | // Convert to integer |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3294 | BuildMI(*MBB, IP, PPC::FCTIWZ, 1, ConvReg).addReg(TmpReg2); |
| 3295 | addFrameReference(BuildMI(*MBB, IP, PPC::STFD, 3).addReg(ConvReg), |
Misha Brukman | b160d1f | 2004-07-23 20:32:59 +0000 | [diff] [blame] | 3296 | FrameIdx); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3297 | if (DestClass == cByte) { |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3298 | addFrameReference(BuildMI(*MBB, IP, PPC::LBZ, 2, DestReg), |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3299 | FrameIdx, 7); |
| 3300 | } else if (DestClass == cShort) { |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3301 | addFrameReference(BuildMI(*MBB, IP, PPC::LHZ, 2, DestReg), |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3302 | FrameIdx, 6); |
| 3303 | } if (DestClass == cInt) { |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3304 | addFrameReference(BuildMI(*MBB, IP, PPC::LWZ, 2, IntTmp), |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3305 | FrameIdx, 4); |
Nate Begeman | f2f0781 | 2004-08-29 08:19:32 +0000 | [diff] [blame] | 3306 | BuildMI(*MBB, IP, PPC::BLT, 2).addReg(PPC::CR0).addMBB(PhiMBB); |
| 3307 | BuildMI(*MBB, IP, PPC::B, 1).addMBB(XorMBB); |
Misha Brukman | b160d1f | 2004-07-23 20:32:59 +0000 | [diff] [blame] | 3308 | |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3309 | // XorMBB: |
| 3310 | // add 2**31 if input was >= 2**31 |
| 3311 | BB = XorMBB; |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3312 | BuildMI(BB, PPC::XORIS, 2, XorReg).addReg(IntTmp).addImm(0x8000); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3313 | XorMBB->addSuccessor(PhiMBB); |
Misha Brukman | b160d1f | 2004-07-23 20:32:59 +0000 | [diff] [blame] | 3314 | |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3315 | // PhiMBB: |
| 3316 | // DestReg = phi [ IntTmp, OldMBB ], [ XorReg, XorMBB ] |
| 3317 | BB = PhiMBB; |
Misha Brukman | d2cbb87 | 2004-08-19 21:00:12 +0000 | [diff] [blame] | 3318 | BuildMI(BB, PPC::PHI, 4, DestReg).addReg(IntTmp).addMBB(OldMBB) |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3319 | .addReg(XorReg).addMBB(XorMBB); |
| 3320 | } |
| 3321 | } |
| 3322 | return; |
| 3323 | } |
| 3324 | |
| 3325 | // Check our invariants |
| 3326 | assert((SrcClass <= cInt || SrcClass == cLong) && |
| 3327 | "Unhandled source class for cast operation!"); |
| 3328 | assert((DestClass <= cInt || DestClass == cLong) && |
| 3329 | "Unhandled destination class for cast operation!"); |
| 3330 | |
| 3331 | bool sourceUnsigned = SrcTy->isUnsigned() || SrcTy == Type::BoolTy; |
| 3332 | bool destUnsigned = DestTy->isUnsigned(); |
| 3333 | |
| 3334 | // Unsigned -> Unsigned, clear if larger, |
| 3335 | if (sourceUnsigned && destUnsigned) { |
| 3336 | // handle long dest class now to keep switch clean |
| 3337 | if (DestClass == cLong) { |
| 3338 | if (SrcClass == cLong) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3339 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg); |
| 3340 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg+1) |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3341 | .addReg(SrcReg+1); |
| 3342 | } else { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3343 | BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0); |
| 3344 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg) |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3345 | .addReg(SrcReg); |
| 3346 | } |
| 3347 | return; |
| 3348 | } |
| 3349 | |
| 3350 | // handle u{ byte, short, int } x u{ byte, short, int } |
| 3351 | unsigned clearBits = (SrcClass == cByte || DestClass == cByte) ? 24 : 16; |
| 3352 | switch (SrcClass) { |
| 3353 | case cByte: |
| 3354 | case cShort: |
| 3355 | if (SrcClass == DestClass) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3356 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3357 | else |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3358 | BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg) |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3359 | .addImm(0).addImm(clearBits).addImm(31); |
| 3360 | break; |
| 3361 | case cLong: |
| 3362 | ++SrcReg; |
| 3363 | // Fall through |
| 3364 | case cInt: |
| 3365 | if (DestClass == cInt) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3366 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3367 | else |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3368 | BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg) |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3369 | .addImm(0).addImm(clearBits).addImm(31); |
| 3370 | break; |
| 3371 | } |
| 3372 | return; |
| 3373 | } |
| 3374 | |
| 3375 | // Signed -> Signed |
| 3376 | if (!sourceUnsigned && !destUnsigned) { |
| 3377 | // handle long dest class now to keep switch clean |
| 3378 | if (DestClass == cLong) { |
| 3379 | if (SrcClass == cLong) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3380 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg); |
| 3381 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg+1) |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3382 | .addReg(SrcReg+1); |
| 3383 | } else { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3384 | BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg).addImm(31); |
| 3385 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg) |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3386 | .addReg(SrcReg); |
| 3387 | } |
| 3388 | return; |
| 3389 | } |
| 3390 | |
| 3391 | // handle { byte, short, int } x { byte, short, int } |
| 3392 | switch (SrcClass) { |
| 3393 | case cByte: |
| 3394 | if (DestClass == cByte) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3395 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3396 | else |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3397 | BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3398 | break; |
| 3399 | case cShort: |
| 3400 | if (DestClass == cByte) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3401 | BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3402 | else if (DestClass == cShort) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3403 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3404 | else |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3405 | BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3406 | break; |
| 3407 | case cLong: |
| 3408 | ++SrcReg; |
| 3409 | // Fall through |
| 3410 | case cInt: |
| 3411 | if (DestClass == cByte) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3412 | BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3413 | else if (DestClass == cShort) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3414 | BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3415 | else |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3416 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3417 | break; |
| 3418 | } |
| 3419 | return; |
| 3420 | } |
| 3421 | |
| 3422 | // Unsigned -> Signed |
| 3423 | if (sourceUnsigned && !destUnsigned) { |
| 3424 | // handle long dest class now to keep switch clean |
| 3425 | if (DestClass == cLong) { |
| 3426 | if (SrcClass == cLong) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3427 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg); |
| 3428 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg+1). |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3429 | addReg(SrcReg+1); |
| 3430 | } else { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3431 | BuildMI(*MBB, IP, PPC::LI, 1, DestReg).addSImm(0); |
| 3432 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg) |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3433 | .addReg(SrcReg); |
| 3434 | } |
| 3435 | return; |
| 3436 | } |
| 3437 | |
| 3438 | // handle u{ byte, short, int } -> { byte, short, int } |
| 3439 | switch (SrcClass) { |
| 3440 | case cByte: |
| 3441 | if (DestClass == cByte) |
| 3442 | // uByte 255 -> signed byte == -1 |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3443 | BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3444 | else |
| 3445 | // uByte 255 -> signed short/int == 255 |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3446 | BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(0) |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3447 | .addImm(24).addImm(31); |
| 3448 | break; |
| 3449 | case cShort: |
| 3450 | if (DestClass == cByte) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3451 | BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3452 | else if (DestClass == cShort) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3453 | BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3454 | else |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3455 | BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg).addImm(0) |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3456 | .addImm(16).addImm(31); |
| 3457 | break; |
| 3458 | case cLong: |
| 3459 | ++SrcReg; |
| 3460 | // Fall through |
| 3461 | case cInt: |
| 3462 | if (DestClass == cByte) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3463 | BuildMI(*MBB, IP, PPC::EXTSB, 1, DestReg).addReg(SrcReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3464 | else if (DestClass == cShort) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3465 | BuildMI(*MBB, IP, PPC::EXTSH, 1, DestReg).addReg(SrcReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3466 | else |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3467 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3468 | break; |
| 3469 | } |
| 3470 | return; |
| 3471 | } |
| 3472 | |
| 3473 | // Signed -> Unsigned |
| 3474 | if (!sourceUnsigned && destUnsigned) { |
| 3475 | // handle long dest class now to keep switch clean |
| 3476 | if (DestClass == cLong) { |
| 3477 | if (SrcClass == cLong) { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3478 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg); |
| 3479 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg+1) |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3480 | .addReg(SrcReg+1); |
| 3481 | } else { |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3482 | BuildMI(*MBB, IP, PPC::SRAWI, 2, DestReg).addReg(SrcReg).addImm(31); |
| 3483 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg+1).addReg(SrcReg) |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3484 | .addReg(SrcReg); |
| 3485 | } |
| 3486 | return; |
| 3487 | } |
| 3488 | |
| 3489 | // handle { byte, short, int } -> u{ byte, short, int } |
| 3490 | unsigned clearBits = (DestClass == cByte) ? 24 : 16; |
| 3491 | switch (SrcClass) { |
| 3492 | case cByte: |
| 3493 | case cShort: |
| 3494 | if (DestClass == cByte || DestClass == cShort) |
| 3495 | // sbyte -1 -> ubyte 0x000000FF |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3496 | BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg) |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3497 | .addImm(0).addImm(clearBits).addImm(31); |
| 3498 | else |
| 3499 | // sbyte -1 -> ubyte 0xFFFFFFFF |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3500 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3501 | break; |
| 3502 | case cLong: |
| 3503 | ++SrcReg; |
| 3504 | // Fall through |
| 3505 | case cInt: |
| 3506 | if (DestClass == cInt) |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3507 | BuildMI(*MBB, IP, PPC::OR, 2, DestReg).addReg(SrcReg).addReg(SrcReg); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3508 | else |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3509 | BuildMI(*MBB, IP, PPC::RLWINM, 4, DestReg).addReg(SrcReg) |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3510 | .addImm(0).addImm(clearBits).addImm(31); |
| 3511 | break; |
Misha Brukman | 7e898c3 | 2004-07-20 00:41:46 +0000 | [diff] [blame] | 3512 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3513 | return; |
| 3514 | } |
| 3515 | |
| 3516 | // Anything we haven't handled already, we can't (yet) handle at all. |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3517 | std::cerr << "Unhandled cast from " << SrcTy->getDescription() |
| 3518 | << "to " << DestTy->getDescription() << '\n'; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3519 | abort(); |
| 3520 | } |
| 3521 | |
| 3522 | /// visitVANextInst - Implement the va_next instruction... |
| 3523 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 3524 | void PPC32ISel::visitVANextInst(VANextInst &I) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3525 | unsigned VAList = getReg(I.getOperand(0)); |
| 3526 | unsigned DestReg = getReg(I); |
| 3527 | |
| 3528 | unsigned Size; |
Misha Brukman | 358829f | 2004-06-21 17:25:55 +0000 | [diff] [blame] | 3529 | switch (I.getArgType()->getTypeID()) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3530 | default: |
| 3531 | std::cerr << I; |
| 3532 | assert(0 && "Error: bad type for va_next instruction!"); |
| 3533 | return; |
| 3534 | case Type::PointerTyID: |
| 3535 | case Type::UIntTyID: |
| 3536 | case Type::IntTyID: |
| 3537 | Size = 4; |
| 3538 | break; |
| 3539 | case Type::ULongTyID: |
| 3540 | case Type::LongTyID: |
| 3541 | case Type::DoubleTyID: |
| 3542 | Size = 8; |
| 3543 | break; |
| 3544 | } |
| 3545 | |
| 3546 | // Increment the VAList pointer... |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3547 | BuildMI(BB, PPC::ADDI, 2, DestReg).addReg(VAList).addSImm(Size); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3548 | } |
| 3549 | |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 3550 | void PPC32ISel::visitVAArgInst(VAArgInst &I) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3551 | unsigned VAList = getReg(I.getOperand(0)); |
| 3552 | unsigned DestReg = getReg(I); |
| 3553 | |
Misha Brukman | 358829f | 2004-06-21 17:25:55 +0000 | [diff] [blame] | 3554 | switch (I.getType()->getTypeID()) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3555 | default: |
| 3556 | std::cerr << I; |
| 3557 | assert(0 && "Error: bad type for va_next instruction!"); |
| 3558 | return; |
| 3559 | case Type::PointerTyID: |
| 3560 | case Type::UIntTyID: |
| 3561 | case Type::IntTyID: |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3562 | BuildMI(BB, PPC::LWZ, 2, DestReg).addSImm(0).addReg(VAList); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3563 | break; |
| 3564 | case Type::ULongTyID: |
| 3565 | case Type::LongTyID: |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3566 | BuildMI(BB, PPC::LWZ, 2, DestReg).addSImm(0).addReg(VAList); |
| 3567 | BuildMI(BB, PPC::LWZ, 2, DestReg+1).addSImm(4).addReg(VAList); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3568 | break; |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3569 | case Type::FloatTyID: |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3570 | BuildMI(BB, PPC::LFS, 2, DestReg).addSImm(0).addReg(VAList); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3571 | break; |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3572 | case Type::DoubleTyID: |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3573 | BuildMI(BB, PPC::LFD, 2, DestReg).addSImm(0).addReg(VAList); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3574 | break; |
| 3575 | } |
| 3576 | } |
| 3577 | |
| 3578 | /// visitGetElementPtrInst - instruction-select GEP instructions |
| 3579 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 3580 | void PPC32ISel::visitGetElementPtrInst(GetElementPtrInst &I) { |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3581 | if (canFoldGEPIntoLoadOrStore(&I)) |
| 3582 | return; |
| 3583 | |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 3584 | emitGEPOperation(BB, BB->end(), &I, false); |
| 3585 | } |
| 3586 | |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 3587 | /// emitGEPOperation - Common code shared between visitGetElementPtrInst and |
| 3588 | /// constant expression GEP support. |
| 3589 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 3590 | void PPC32ISel::emitGEPOperation(MachineBasicBlock *MBB, |
| 3591 | MachineBasicBlock::iterator IP, |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 3592 | GetElementPtrInst *GEPI, bool GEPIsFolded) { |
| 3593 | // If we've already emitted this particular GEP, just return to avoid |
| 3594 | // multiple definitions of the base register. |
Nate Begeman | a41fc77 | 2004-09-29 02:35:05 +0000 | [diff] [blame] | 3595 | if (GEPIsFolded && (GEPMap[GEPI].base != 0)) |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 3596 | return; |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 3597 | |
| 3598 | Value *Src = GEPI->getOperand(0); |
| 3599 | User::op_iterator IdxBegin = GEPI->op_begin()+1; |
| 3600 | User::op_iterator IdxEnd = GEPI->op_end(); |
Misha Brukman | 2ed17ca | 2004-07-22 15:58:04 +0000 | [diff] [blame] | 3601 | const TargetData &TD = TM.getTargetData(); |
| 3602 | const Type *Ty = Src->getType(); |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 3603 | int64_t constValue = 0; |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 3604 | |
| 3605 | // Record the operations to emit the GEP in a vector so that we can emit them |
| 3606 | // after having analyzed the entire instruction. |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3607 | std::vector<CollapsedGepOp> ops; |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 3608 | |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 3609 | // GEPs have zero or more indices; we must perform a struct access |
| 3610 | // or array access for each one. |
| 3611 | for (GetElementPtrInst::op_iterator oi = IdxBegin, oe = IdxEnd; oi != oe; |
| 3612 | ++oi) { |
| 3613 | Value *idx = *oi; |
Misha Brukman | 2ed17ca | 2004-07-22 15:58:04 +0000 | [diff] [blame] | 3614 | if (const StructType *StTy = dyn_cast<StructType>(Ty)) { |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 3615 | // It's a struct access. idx is the index into the structure, |
| 3616 | // which names the field. Use the TargetData structure to |
| 3617 | // pick out what the layout of the structure is in memory. |
| 3618 | // Use the (constant) structure index's value to find the |
| 3619 | // right byte offset from the StructLayout class's list of |
| 3620 | // structure member offsets. |
Misha Brukman | 2ed17ca | 2004-07-22 15:58:04 +0000 | [diff] [blame] | 3621 | unsigned fieldIndex = cast<ConstantUInt>(idx)->getValue(); |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 3622 | |
| 3623 | // StructType member offsets are always constant values. Add it to the |
| 3624 | // running total. |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 3625 | constValue += TD.getStructLayout(StTy)->MemberOffsets[fieldIndex]; |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 3626 | |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 3627 | // The next type is the member of the structure selected by the index. |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 3628 | Ty = StTy->getElementType (fieldIndex); |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 3629 | } else if (const SequentialType *SqTy = dyn_cast<SequentialType>(Ty)) { |
Misha Brukman | 313efcb | 2004-07-09 15:45:07 +0000 | [diff] [blame] | 3630 | // Many GEP instructions use a [cast (int/uint) to LongTy] as their |
| 3631 | // operand. Handle this case directly now... |
| 3632 | if (CastInst *CI = dyn_cast<CastInst>(idx)) |
| 3633 | if (CI->getOperand(0)->getType() == Type::IntTy || |
| 3634 | CI->getOperand(0)->getType() == Type::UIntTy) |
| 3635 | idx = CI->getOperand(0); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 3636 | |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 3637 | // It's an array or pointer access: [ArraySize x ElementType]. |
| 3638 | // We want to add basePtrReg to (idxReg * sizeof ElementType). First, we |
| 3639 | // must find the size of the pointed-to type (Not coincidentally, the next |
| 3640 | // type is the type of the elements in the array). |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 3641 | Ty = SqTy->getElementType(); |
Misha Brukman | 2ed17ca | 2004-07-22 15:58:04 +0000 | [diff] [blame] | 3642 | unsigned elementSize = TD.getTypeSize(Ty); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 3643 | |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 3644 | if (ConstantInt *C = dyn_cast<ConstantInt>(idx)) { |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 3645 | if (ConstantSInt *CS = dyn_cast<ConstantSInt>(C)) |
| 3646 | constValue += CS->getValue() * elementSize; |
| 3647 | else if (ConstantUInt *CU = dyn_cast<ConstantUInt>(C)) |
| 3648 | constValue += CU->getValue() * elementSize; |
| 3649 | else |
| 3650 | assert(0 && "Invalid ConstantInt GEP index type!"); |
| 3651 | } else { |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 3652 | // Push current gep state to this point as an add and multiply |
| 3653 | ops.push_back(CollapsedGepOp( |
| 3654 | ConstantSInt::get(Type::IntTy, constValue), |
| 3655 | idx, ConstantUInt::get(Type::UIntTy, elementSize))); |
| 3656 | |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 3657 | constValue = 0; |
Misha Brukman | 313efcb | 2004-07-09 15:45:07 +0000 | [diff] [blame] | 3658 | } |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3659 | } |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 3660 | } |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 3661 | // Emit instructions for all the collapsed ops |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 3662 | unsigned indexReg = 0; |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3663 | for(std::vector<CollapsedGepOp>::iterator cgo_i = ops.begin(), |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 3664 | cgo_e = ops.end(); cgo_i != cgo_e; ++cgo_i) { |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3665 | CollapsedGepOp& cgo = *cgo_i; |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 3666 | |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 3667 | unsigned TmpReg1 = makeAnotherReg(Type::IntTy); |
| 3668 | unsigned TmpReg2 = makeAnotherReg(Type::IntTy); |
| 3669 | doMultiplyConst(MBB, IP, TmpReg1, cgo.index, cgo.size); |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 3670 | emitBinaryConstOperation(MBB, IP, TmpReg1, cgo.offset, 0, TmpReg2); |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 3671 | |
| 3672 | if (indexReg == 0) |
| 3673 | indexReg = TmpReg2; |
| 3674 | else { |
| 3675 | unsigned TmpReg3 = makeAnotherReg(Type::IntTy); |
| 3676 | BuildMI(*MBB, IP, PPC::ADD, 2, TmpReg3).addReg(indexReg).addReg(TmpReg2); |
| 3677 | indexReg = TmpReg3; |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 3678 | } |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 3679 | } |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 3680 | |
| 3681 | // We now have a base register, an index register, and possibly a constant |
| 3682 | // remainder. If the GEP is going to be folded, we try to generate the |
| 3683 | // optimal addressing mode. |
| 3684 | unsigned TargetReg = getReg(GEPI, MBB, IP); |
| 3685 | unsigned basePtrReg = getReg(Src, MBB, IP); |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 3686 | ConstantSInt *remainder = ConstantSInt::get(Type::IntTy, constValue); |
| 3687 | |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3688 | // If we are emitting this during a fold, copy the current base register to |
| 3689 | // the target, and save the current constant offset so the folding load or |
| 3690 | // store can try and use it as an immediate. |
| 3691 | if (GEPIsFolded) { |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 3692 | if (indexReg == 0) { |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 3693 | if (!canUseAsImmediateForOpcode(remainder, 0, false)) { |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 3694 | indexReg = getReg(remainder, MBB, IP); |
| 3695 | remainder = 0; |
Nate Begeman | b64af91 | 2004-08-10 20:42:36 +0000 | [diff] [blame] | 3696 | } |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 3697 | } else { |
| 3698 | unsigned TmpReg = makeAnotherReg(Type::IntTy); |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 3699 | emitBinaryConstOperation(MBB, IP, indexReg, remainder, 0, TmpReg); |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 3700 | indexReg = TmpReg; |
| 3701 | remainder = 0; |
Nate Begeman | b64af91 | 2004-08-10 20:42:36 +0000 | [diff] [blame] | 3702 | } |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3703 | BuildMI (*MBB, IP, PPC::OR, 2, TargetReg).addReg(basePtrReg) |
Nate Begeman | b64af91 | 2004-08-10 20:42:36 +0000 | [diff] [blame] | 3704 | .addReg(basePtrReg); |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 3705 | GEPMap[GEPI] = FoldedGEP(TargetReg, indexReg, remainder); |
Misha Brukman | b097f21 | 2004-07-26 18:13:24 +0000 | [diff] [blame] | 3706 | return; |
| 3707 | } |
Nate Begeman | b64af91 | 2004-08-10 20:42:36 +0000 | [diff] [blame] | 3708 | |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 3709 | // We're not folding, so collapse the base, index, and any remainder into the |
| 3710 | // destination register. |
| 3711 | if (indexReg != 0) { |
Nate Begeman | b64af91 | 2004-08-10 20:42:36 +0000 | [diff] [blame] | 3712 | unsigned TmpReg = makeAnotherReg(Type::IntTy); |
Nate Begeman | 645495d | 2004-09-23 05:31:33 +0000 | [diff] [blame] | 3713 | BuildMI(*MBB, IP, PPC::ADD, 2, TmpReg).addReg(indexReg).addReg(basePtrReg); |
Nate Begeman | b64af91 | 2004-08-10 20:42:36 +0000 | [diff] [blame] | 3714 | basePtrReg = TmpReg; |
| 3715 | } |
Nate Begeman | b816f02 | 2004-10-07 22:30:03 +0000 | [diff] [blame] | 3716 | emitBinaryConstOperation(MBB, IP, basePtrReg, remainder, 0, TargetReg); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3717 | } |
| 3718 | |
| 3719 | /// visitAllocaInst - If this is a fixed size alloca, allocate space from the |
| 3720 | /// frame manager, otherwise do it the hard way. |
| 3721 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 3722 | void PPC32ISel::visitAllocaInst(AllocaInst &I) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3723 | // If this is a fixed size alloca in the entry block for the function, we |
| 3724 | // statically stack allocate the space, so we don't need to do anything here. |
| 3725 | // |
| 3726 | if (dyn_castFixedAlloca(&I)) return; |
| 3727 | |
| 3728 | // Find the data size of the alloca inst's getAllocatedType. |
| 3729 | const Type *Ty = I.getAllocatedType(); |
| 3730 | unsigned TySize = TM.getTargetData().getTypeSize(Ty); |
| 3731 | |
| 3732 | // Create a register to hold the temporary result of multiplying the type size |
| 3733 | // constant by the variable amount. |
| 3734 | unsigned TotalSizeReg = makeAnotherReg(Type::UIntTy); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3735 | |
| 3736 | // TotalSizeReg = mul <numelements>, <TypeSize> |
| 3737 | MachineBasicBlock::iterator MBBI = BB->end(); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 3738 | ConstantUInt *CUI = ConstantUInt::get(Type::UIntTy, TySize); |
| 3739 | doMultiplyConst(BB, MBBI, TotalSizeReg, I.getArraySize(), CUI); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3740 | |
| 3741 | // AddedSize = add <TotalSizeReg>, 15 |
| 3742 | unsigned AddedSizeReg = makeAnotherReg(Type::UIntTy); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3743 | BuildMI(BB, PPC::ADDI, 2, AddedSizeReg).addReg(TotalSizeReg).addSImm(15); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3744 | |
| 3745 | // AlignedSize = and <AddedSize>, ~15 |
| 3746 | unsigned AlignedSize = makeAnotherReg(Type::UIntTy); |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3747 | BuildMI(BB, PPC::RLWINM, 4, AlignedSize).addReg(AddedSizeReg).addImm(0) |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 3748 | .addImm(0).addImm(27); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3749 | |
| 3750 | // Subtract size from stack pointer, thereby allocating some space. |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3751 | BuildMI(BB, PPC::SUB, 2, PPC::R1).addReg(PPC::R1).addReg(AlignedSize); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3752 | |
| 3753 | // Put a pointer to the space into the result register, by copying |
| 3754 | // the stack pointer. |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3755 | BuildMI(BB, PPC::OR, 2, getReg(I)).addReg(PPC::R1).addReg(PPC::R1); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3756 | |
| 3757 | // Inform the Frame Information that we have just allocated a variable-sized |
| 3758 | // object. |
| 3759 | F->getFrameInfo()->CreateVariableSizedObject(); |
| 3760 | } |
| 3761 | |
| 3762 | /// visitMallocInst - Malloc instructions are code generated into direct calls |
| 3763 | /// to the library malloc. |
| 3764 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 3765 | void PPC32ISel::visitMallocInst(MallocInst &I) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3766 | unsigned AllocSize = TM.getTargetData().getTypeSize(I.getAllocatedType()); |
| 3767 | unsigned Arg; |
| 3768 | |
| 3769 | if (ConstantUInt *C = dyn_cast<ConstantUInt>(I.getOperand(0))) { |
| 3770 | Arg = getReg(ConstantUInt::get(Type::UIntTy, C->getValue() * AllocSize)); |
| 3771 | } else { |
| 3772 | Arg = makeAnotherReg(Type::UIntTy); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3773 | MachineBasicBlock::iterator MBBI = BB->end(); |
Misha Brukman | 1013ef5 | 2004-07-21 20:09:08 +0000 | [diff] [blame] | 3774 | ConstantUInt *CUI = ConstantUInt::get(Type::UIntTy, AllocSize); |
| 3775 | doMultiplyConst(BB, MBBI, Arg, I.getOperand(0), CUI); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3776 | } |
| 3777 | |
| 3778 | std::vector<ValueRecord> Args; |
| 3779 | Args.push_back(ValueRecord(Arg, Type::UIntTy)); |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 3780 | MachineInstr *TheCall = |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3781 | BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(mallocFn, true); |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 3782 | doCall(ValueRecord(getReg(I), I.getType()), TheCall, Args, false); |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 3783 | TM.CalledFunctions.insert(mallocFn); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3784 | } |
| 3785 | |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3786 | /// visitFreeInst - Free instructions are code gen'd to call the free libc |
| 3787 | /// function. |
| 3788 | /// |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 3789 | void PPC32ISel::visitFreeInst(FreeInst &I) { |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3790 | std::vector<ValueRecord> Args; |
| 3791 | Args.push_back(ValueRecord(I.getOperand(0))); |
Misha Brukman | 2fec990 | 2004-06-21 20:22:03 +0000 | [diff] [blame] | 3792 | MachineInstr *TheCall = |
Misha Brukman | 5b57081 | 2004-08-10 22:47:03 +0000 | [diff] [blame] | 3793 | BuildMI(PPC::CALLpcrel, 1).addGlobalAddress(freeFn, true); |
Misha Brukman | d18a31d | 2004-07-06 22:51:53 +0000 | [diff] [blame] | 3794 | doCall(ValueRecord(0, Type::VoidTy), TheCall, Args, false); |
Misha Brukman | e2eceb5 | 2004-07-23 16:08:20 +0000 | [diff] [blame] | 3795 | TM.CalledFunctions.insert(freeFn); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3796 | } |
| 3797 | |
Misha Brukman | 3d9a6c2 | 2004-08-11 00:09:42 +0000 | [diff] [blame] | 3798 | /// createPPC32ISelSimple - This pass converts an LLVM function into a machine |
| 3799 | /// code representation is a very simple peep-hole fashion. |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3800 | /// |
Misha Brukman | 3d9a6c2 | 2004-08-11 00:09:42 +0000 | [diff] [blame] | 3801 | FunctionPass *llvm::createPPC32ISelSimple(TargetMachine &TM) { |
Misha Brukman | a1dca55 | 2004-09-21 18:22:19 +0000 | [diff] [blame] | 3802 | return new PPC32ISel(TM); |
Misha Brukman | 5dfe3a9 | 2004-06-21 16:55:25 +0000 | [diff] [blame] | 3803 | } |