Nate Begeman | 21e463b | 2005-10-16 05:39:50 +0000 | [diff] [blame] | 1 | //===-- PPCISelDAGToDAG.cpp - PPC --pattern matching inst selector --------===// |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file was developed by Chris Lattner and is distributed under |
| 6 | // the University of Illinois Open Source License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
Nate Begeman | 21e463b | 2005-10-16 05:39:50 +0000 | [diff] [blame] | 10 | // This file defines a pattern matching instruction selector for PowerPC, |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 11 | // converting from a legalized dag to a PPC dag. |
| 12 | // |
| 13 | //===----------------------------------------------------------------------===// |
| 14 | |
Chris Lattner | 2668959 | 2005-10-14 23:51:18 +0000 | [diff] [blame] | 15 | #include "PPC.h" |
Chris Lattner | 16e71f2 | 2005-10-14 23:59:06 +0000 | [diff] [blame] | 16 | #include "PPCTargetMachine.h" |
| 17 | #include "PPCISelLowering.h" |
Chris Lattner | c664418 | 2006-03-07 06:32:48 +0000 | [diff] [blame] | 18 | #include "PPCHazardRecognizers.h" |
Chris Lattner | 4416f1a | 2005-08-19 22:38:53 +0000 | [diff] [blame] | 19 | #include "llvm/CodeGen/MachineInstrBuilder.h" |
| 20 | #include "llvm/CodeGen/MachineFunction.h" |
| 21 | #include "llvm/CodeGen/SSARegMap.h" |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 22 | #include "llvm/CodeGen/SelectionDAG.h" |
| 23 | #include "llvm/CodeGen/SelectionDAGISel.h" |
| 24 | #include "llvm/Target/TargetOptions.h" |
| 25 | #include "llvm/ADT/Statistic.h" |
Chris Lattner | 2fe76e5 | 2005-08-25 04:47:18 +0000 | [diff] [blame] | 26 | #include "llvm/Constants.h" |
Chris Lattner | 4416f1a | 2005-08-19 22:38:53 +0000 | [diff] [blame] | 27 | #include "llvm/GlobalValue.h" |
Chris Lattner | 420736d | 2006-03-25 06:47:10 +0000 | [diff] [blame] | 28 | #include "llvm/Intrinsics.h" |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 29 | #include "llvm/Support/Debug.h" |
| 30 | #include "llvm/Support/MathExtras.h" |
Chris Lattner | 2c2c6c6 | 2006-01-22 23:41:00 +0000 | [diff] [blame] | 31 | #include <iostream> |
Evan Cheng | ba2f0a9 | 2006-02-05 06:46:41 +0000 | [diff] [blame] | 32 | #include <set> |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 33 | using namespace llvm; |
| 34 | |
| 35 | namespace { |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 36 | Statistic<> FrameOff("ppc-codegen", "Number of frame idx offsets collapsed"); |
| 37 | |
| 38 | //===--------------------------------------------------------------------===// |
Nate Begeman | 1d9d742 | 2005-10-18 00:28:58 +0000 | [diff] [blame] | 39 | /// PPCDAGToDAGISel - PPC specific code to select PPC machine |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 40 | /// instructions for SelectionDAG operations. |
| 41 | /// |
Nate Begeman | 1d9d742 | 2005-10-18 00:28:58 +0000 | [diff] [blame] | 42 | class PPCDAGToDAGISel : public SelectionDAGISel { |
Chris Lattner | 4bb1895 | 2006-03-16 18:25:23 +0000 | [diff] [blame] | 43 | PPCTargetMachine &TM; |
Nate Begeman | 21e463b | 2005-10-16 05:39:50 +0000 | [diff] [blame] | 44 | PPCTargetLowering PPCLowering; |
Chris Lattner | 4416f1a | 2005-08-19 22:38:53 +0000 | [diff] [blame] | 45 | unsigned GlobalBaseReg; |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 46 | public: |
Chris Lattner | 4bb1895 | 2006-03-16 18:25:23 +0000 | [diff] [blame] | 47 | PPCDAGToDAGISel(PPCTargetMachine &tm) |
| 48 | : SelectionDAGISel(PPCLowering), TM(tm), |
| 49 | PPCLowering(*TM.getTargetLowering()) {} |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 50 | |
Chris Lattner | 4416f1a | 2005-08-19 22:38:53 +0000 | [diff] [blame] | 51 | virtual bool runOnFunction(Function &Fn) { |
| 52 | // Make sure we re-emit a set of the global base reg if necessary |
| 53 | GlobalBaseReg = 0; |
Chris Lattner | 4bb1895 | 2006-03-16 18:25:23 +0000 | [diff] [blame] | 54 | SelectionDAGISel::runOnFunction(Fn); |
| 55 | |
| 56 | InsertVRSaveCode(Fn); |
| 57 | return true; |
Chris Lattner | 4416f1a | 2005-08-19 22:38:53 +0000 | [diff] [blame] | 58 | } |
| 59 | |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 60 | /// getI32Imm - Return a target constant with the specified value, of type |
| 61 | /// i32. |
| 62 | inline SDOperand getI32Imm(unsigned Imm) { |
| 63 | return CurDAG->getTargetConstant(Imm, MVT::i32); |
| 64 | } |
Chris Lattner | 4416f1a | 2005-08-19 22:38:53 +0000 | [diff] [blame] | 65 | |
| 66 | /// getGlobalBaseReg - insert code into the entry mbb to materialize the PIC |
| 67 | /// base register. Return the virtual register that holds this value. |
Chris Lattner | 9944b76 | 2005-08-21 22:31:09 +0000 | [diff] [blame] | 68 | SDOperand getGlobalBaseReg(); |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 69 | |
| 70 | // Select - Convert the specified operand from a target-independent to a |
| 71 | // target-specific node if it hasn't already been changed. |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 72 | void Select(SDOperand &Result, SDOperand Op); |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 73 | |
Nate Begeman | 02b88a4 | 2005-08-19 00:38:14 +0000 | [diff] [blame] | 74 | SDNode *SelectBitfieldInsert(SDNode *N); |
| 75 | |
Chris Lattner | 2fbb457 | 2005-08-21 18:50:37 +0000 | [diff] [blame] | 76 | /// SelectCC - Select a comparison of the specified values with the |
| 77 | /// specified condition code, returning the CR# of the expression. |
| 78 | SDOperand SelectCC(SDOperand LHS, SDOperand RHS, ISD::CondCode CC); |
| 79 | |
Nate Begeman | 7fd1edd | 2005-12-19 23:25:09 +0000 | [diff] [blame] | 80 | /// SelectAddrImm - Returns true if the address N can be represented by |
| 81 | /// a base register plus a signed 16-bit displacement [r+imm]. |
| 82 | bool SelectAddrImm(SDOperand N, SDOperand &Disp, SDOperand &Base); |
| 83 | |
| 84 | /// SelectAddrIdx - Given the specified addressed, check to see if it can be |
| 85 | /// represented as an indexed [r+r] operation. Returns false if it can |
| 86 | /// be represented by [r+imm], which are preferred. |
| 87 | bool SelectAddrIdx(SDOperand N, SDOperand &Base, SDOperand &Index); |
Nate Begeman | f43a3ca | 2005-11-30 08:22:07 +0000 | [diff] [blame] | 88 | |
Nate Begeman | 7fd1edd | 2005-12-19 23:25:09 +0000 | [diff] [blame] | 89 | /// SelectAddrIdxOnly - Given the specified addressed, force it to be |
| 90 | /// represented as an indexed [r+r] operation. |
| 91 | bool SelectAddrIdxOnly(SDOperand N, SDOperand &Base, SDOperand &Index); |
Chris Lattner | 9944b76 | 2005-08-21 22:31:09 +0000 | [diff] [blame] | 92 | |
Chris Lattner | e5ba580 | 2006-03-22 05:26:03 +0000 | [diff] [blame] | 93 | /// SelectAddrImmShift - Returns true if the address N can be represented by |
| 94 | /// a base register plus a signed 14-bit displacement [r+imm*4]. Suitable |
| 95 | /// for use by STD and friends. |
| 96 | bool SelectAddrImmShift(SDOperand N, SDOperand &Disp, SDOperand &Base); |
| 97 | |
Chris Lattner | e5d8861 | 2006-02-24 02:13:12 +0000 | [diff] [blame] | 98 | /// SelectInlineAsmMemoryOperand - Implement addressing mode selection for |
| 99 | /// inline asm expressions. |
| 100 | virtual bool SelectInlineAsmMemoryOperand(const SDOperand &Op, |
| 101 | char ConstraintCode, |
| 102 | std::vector<SDOperand> &OutOps, |
| 103 | SelectionDAG &DAG) { |
| 104 | SDOperand Op0, Op1; |
| 105 | switch (ConstraintCode) { |
| 106 | default: return true; |
| 107 | case 'm': // memory |
| 108 | if (!SelectAddrIdx(Op, Op0, Op1)) |
| 109 | SelectAddrImm(Op, Op0, Op1); |
| 110 | break; |
| 111 | case 'o': // offsetable |
| 112 | if (!SelectAddrImm(Op, Op0, Op1)) { |
| 113 | Select(Op0, Op); // r+0. |
| 114 | Op1 = getI32Imm(0); |
| 115 | } |
| 116 | break; |
| 117 | case 'v': // not offsetable |
| 118 | SelectAddrIdxOnly(Op, Op0, Op1); |
| 119 | break; |
| 120 | } |
| 121 | |
| 122 | OutOps.push_back(Op0); |
| 123 | OutOps.push_back(Op1); |
| 124 | return false; |
| 125 | } |
| 126 | |
Chris Lattner | 047b952 | 2005-08-25 22:04:30 +0000 | [diff] [blame] | 127 | SDOperand BuildSDIVSequence(SDNode *N); |
| 128 | SDOperand BuildUDIVSequence(SDNode *N); |
| 129 | |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 130 | /// InstructionSelectBasicBlock - This callback is invoked by |
| 131 | /// SelectionDAGISel when it has created a SelectionDAG for us to codegen. |
Chris Lattner | bd937b9 | 2005-10-06 18:45:51 +0000 | [diff] [blame] | 132 | virtual void InstructionSelectBasicBlock(SelectionDAG &DAG); |
| 133 | |
Chris Lattner | 4bb1895 | 2006-03-16 18:25:23 +0000 | [diff] [blame] | 134 | void InsertVRSaveCode(Function &Fn); |
| 135 | |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 136 | virtual const char *getPassName() const { |
| 137 | return "PowerPC DAG->DAG Pattern Instruction Selection"; |
| 138 | } |
Chris Lattner | c664418 | 2006-03-07 06:32:48 +0000 | [diff] [blame] | 139 | |
Chris Lattner | b0d21ef | 2006-03-08 04:25:59 +0000 | [diff] [blame] | 140 | /// CreateTargetHazardRecognizer - Return the hazard recognizer to use for this |
Chris Lattner | c664418 | 2006-03-07 06:32:48 +0000 | [diff] [blame] | 141 | /// target when scheduling the DAG. |
Chris Lattner | b0d21ef | 2006-03-08 04:25:59 +0000 | [diff] [blame] | 142 | virtual HazardRecognizer *CreateTargetHazardRecognizer() { |
Chris Lattner | c664418 | 2006-03-07 06:32:48 +0000 | [diff] [blame] | 143 | // Should use subtarget info to pick the right hazard recognizer. For |
| 144 | // now, always return a PPC970 recognizer. |
Chris Lattner | 88d211f | 2006-03-12 09:13:49 +0000 | [diff] [blame] | 145 | const TargetInstrInfo *II = PPCLowering.getTargetMachine().getInstrInfo(); |
| 146 | assert(II && "No InstrInfo?"); |
| 147 | return new PPCHazardRecognizer970(*II); |
Chris Lattner | c664418 | 2006-03-07 06:32:48 +0000 | [diff] [blame] | 148 | } |
Chris Lattner | af16538 | 2005-09-13 22:03:06 +0000 | [diff] [blame] | 149 | |
| 150 | // Include the pieces autogenerated from the target description. |
Chris Lattner | 4c7b43b | 2005-10-14 23:37:35 +0000 | [diff] [blame] | 151 | #include "PPCGenDAGISel.inc" |
Chris Lattner | bd937b9 | 2005-10-06 18:45:51 +0000 | [diff] [blame] | 152 | |
| 153 | private: |
Chris Lattner | 222adac | 2005-10-06 19:03:35 +0000 | [diff] [blame] | 154 | SDOperand SelectSETCC(SDOperand Op); |
Chris Lattner | 6a16f6a | 2005-10-06 19:07:45 +0000 | [diff] [blame] | 155 | SDOperand SelectCALL(SDOperand Op); |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 156 | }; |
| 157 | } |
| 158 | |
Chris Lattner | bd937b9 | 2005-10-06 18:45:51 +0000 | [diff] [blame] | 159 | /// InstructionSelectBasicBlock - This callback is invoked by |
| 160 | /// SelectionDAGISel when it has created a SelectionDAG for us to codegen. |
Nate Begeman | 1d9d742 | 2005-10-18 00:28:58 +0000 | [diff] [blame] | 161 | void PPCDAGToDAGISel::InstructionSelectBasicBlock(SelectionDAG &DAG) { |
Chris Lattner | bd937b9 | 2005-10-06 18:45:51 +0000 | [diff] [blame] | 162 | DEBUG(BB->dump()); |
| 163 | |
| 164 | // The selection process is inherently a bottom-up recursive process (users |
| 165 | // select their uses before themselves). Given infinite stack space, we |
| 166 | // could just start selecting on the root and traverse the whole graph. In |
| 167 | // practice however, this causes us to run out of stack space on large basic |
| 168 | // blocks. To avoid this problem, select the entry node, then all its uses, |
| 169 | // iteratively instead of recursively. |
| 170 | std::vector<SDOperand> Worklist; |
| 171 | Worklist.push_back(DAG.getEntryNode()); |
| 172 | |
| 173 | // Note that we can do this in the PPC target (scanning forward across token |
| 174 | // chain edges) because no nodes ever get folded across these edges. On a |
| 175 | // target like X86 which supports load/modify/store operations, this would |
| 176 | // have to be more careful. |
| 177 | while (!Worklist.empty()) { |
| 178 | SDOperand Node = Worklist.back(); |
| 179 | Worklist.pop_back(); |
| 180 | |
Chris Lattner | cf01a70 | 2005-10-07 22:10:27 +0000 | [diff] [blame] | 181 | // Chose from the least deep of the top two nodes. |
| 182 | if (!Worklist.empty() && |
| 183 | Worklist.back().Val->getNodeDepth() < Node.Val->getNodeDepth()) |
| 184 | std::swap(Worklist.back(), Node); |
| 185 | |
Chris Lattner | bd937b9 | 2005-10-06 18:45:51 +0000 | [diff] [blame] | 186 | if ((Node.Val->getOpcode() >= ISD::BUILTIN_OP_END && |
| 187 | Node.Val->getOpcode() < PPCISD::FIRST_NUMBER) || |
| 188 | CodeGenMap.count(Node)) continue; |
| 189 | |
| 190 | for (SDNode::use_iterator UI = Node.Val->use_begin(), |
| 191 | E = Node.Val->use_end(); UI != E; ++UI) { |
| 192 | // Scan the values. If this use has a value that is a token chain, add it |
| 193 | // to the worklist. |
| 194 | SDNode *User = *UI; |
| 195 | for (unsigned i = 0, e = User->getNumValues(); i != e; ++i) |
| 196 | if (User->getValueType(i) == MVT::Other) { |
| 197 | Worklist.push_back(SDOperand(User, i)); |
| 198 | break; |
| 199 | } |
| 200 | } |
| 201 | |
| 202 | // Finally, legalize this node. |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 203 | SDOperand Dummy; |
| 204 | Select(Dummy, Node); |
Chris Lattner | bd937b9 | 2005-10-06 18:45:51 +0000 | [diff] [blame] | 205 | } |
Chris Lattner | cf01a70 | 2005-10-07 22:10:27 +0000 | [diff] [blame] | 206 | |
Chris Lattner | bd937b9 | 2005-10-06 18:45:51 +0000 | [diff] [blame] | 207 | // Select target instructions for the DAG. |
Evan Cheng | ba2f0a9 | 2006-02-05 06:46:41 +0000 | [diff] [blame] | 208 | DAG.setRoot(SelectRoot(DAG.getRoot())); |
Chris Lattner | bd937b9 | 2005-10-06 18:45:51 +0000 | [diff] [blame] | 209 | CodeGenMap.clear(); |
| 210 | DAG.RemoveDeadNodes(); |
| 211 | |
Chris Lattner | 1877ec9 | 2006-03-13 21:52:10 +0000 | [diff] [blame] | 212 | // Emit machine code to BB. |
Chris Lattner | bd937b9 | 2005-10-06 18:45:51 +0000 | [diff] [blame] | 213 | ScheduleAndEmitDAG(DAG); |
Chris Lattner | 4bb1895 | 2006-03-16 18:25:23 +0000 | [diff] [blame] | 214 | } |
| 215 | |
| 216 | /// InsertVRSaveCode - Once the entire function has been instruction selected, |
| 217 | /// all virtual registers are created and all machine instructions are built, |
| 218 | /// check to see if we need to save/restore VRSAVE. If so, do it. |
| 219 | void PPCDAGToDAGISel::InsertVRSaveCode(Function &F) { |
Chris Lattner | 1877ec9 | 2006-03-13 21:52:10 +0000 | [diff] [blame] | 220 | // Check to see if this function uses vector registers, which means we have to |
| 221 | // save and restore the VRSAVE register and update it with the regs we use. |
| 222 | // |
| 223 | // In this case, there will be virtual registers of vector type type created |
| 224 | // by the scheduler. Detect them now. |
Chris Lattner | 4bb1895 | 2006-03-16 18:25:23 +0000 | [diff] [blame] | 225 | MachineFunction &Fn = MachineFunction::get(&F); |
| 226 | SSARegMap *RegMap = Fn.getSSARegMap(); |
Chris Lattner | 1877ec9 | 2006-03-13 21:52:10 +0000 | [diff] [blame] | 227 | bool HasVectorVReg = false; |
| 228 | for (unsigned i = MRegisterInfo::FirstVirtualRegister, |
Chris Lattner | a08610c | 2006-03-14 17:56:49 +0000 | [diff] [blame] | 229 | e = RegMap->getLastVirtReg()+1; i != e; ++i) |
Chris Lattner | 1877ec9 | 2006-03-13 21:52:10 +0000 | [diff] [blame] | 230 | if (RegMap->getRegClass(i) == &PPC::VRRCRegClass) { |
| 231 | HasVectorVReg = true; |
| 232 | break; |
| 233 | } |
Chris Lattner | 4bb1895 | 2006-03-16 18:25:23 +0000 | [diff] [blame] | 234 | if (!HasVectorVReg) return; // nothing to do. |
| 235 | |
Chris Lattner | 1877ec9 | 2006-03-13 21:52:10 +0000 | [diff] [blame] | 236 | // If we have a vector register, we want to emit code into the entry and exit |
| 237 | // blocks to save and restore the VRSAVE register. We do this here (instead |
| 238 | // of marking all vector instructions as clobbering VRSAVE) for two reasons: |
| 239 | // |
| 240 | // 1. This (trivially) reduces the load on the register allocator, by not |
| 241 | // having to represent the live range of the VRSAVE register. |
| 242 | // 2. This (more significantly) allows us to create a temporary virtual |
| 243 | // register to hold the saved VRSAVE value, allowing this temporary to be |
| 244 | // register allocated, instead of forcing it to be spilled to the stack. |
Chris Lattner | 4bb1895 | 2006-03-16 18:25:23 +0000 | [diff] [blame] | 245 | |
| 246 | // Create two vregs - one to hold the VRSAVE register that is live-in to the |
| 247 | // function and one for the value after having bits or'd into it. |
| 248 | unsigned InVRSAVE = RegMap->createVirtualRegister(&PPC::GPRCRegClass); |
| 249 | unsigned UpdatedVRSAVE = RegMap->createVirtualRegister(&PPC::GPRCRegClass); |
| 250 | |
| 251 | MachineBasicBlock &EntryBB = *Fn.begin(); |
| 252 | // Emit the following code into the entry block: |
| 253 | // InVRSAVE = MFVRSAVE |
| 254 | // UpdatedVRSAVE = UPDATE_VRSAVE InVRSAVE |
| 255 | // MTVRSAVE UpdatedVRSAVE |
| 256 | MachineBasicBlock::iterator IP = EntryBB.begin(); // Insert Point |
| 257 | BuildMI(EntryBB, IP, PPC::MFVRSAVE, 0, InVRSAVE); |
| 258 | BuildMI(EntryBB, IP, PPC::UPDATE_VRSAVE, 1, UpdatedVRSAVE).addReg(InVRSAVE); |
| 259 | BuildMI(EntryBB, IP, PPC::MTVRSAVE, 1).addReg(UpdatedVRSAVE); |
| 260 | |
| 261 | // Find all return blocks, outputting a restore in each epilog. |
| 262 | const TargetInstrInfo &TII = *TM.getInstrInfo(); |
| 263 | for (MachineFunction::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) { |
| 264 | if (!BB->empty() && TII.isReturn(BB->back().getOpcode())) { |
| 265 | IP = BB->end(); --IP; |
| 266 | |
| 267 | // Skip over all terminator instructions, which are part of the return |
| 268 | // sequence. |
| 269 | MachineBasicBlock::iterator I2 = IP; |
| 270 | while (I2 != BB->begin() && TII.isTerminatorInstr((--I2)->getOpcode())) |
| 271 | IP = I2; |
| 272 | |
| 273 | // Emit: MTVRSAVE InVRSave |
| 274 | BuildMI(*BB, IP, PPC::MTVRSAVE, 1).addReg(InVRSAVE); |
| 275 | } |
Chris Lattner | 1877ec9 | 2006-03-13 21:52:10 +0000 | [diff] [blame] | 276 | } |
Chris Lattner | bd937b9 | 2005-10-06 18:45:51 +0000 | [diff] [blame] | 277 | } |
Chris Lattner | 6cd40d5 | 2005-09-03 01:17:22 +0000 | [diff] [blame] | 278 | |
Chris Lattner | 4bb1895 | 2006-03-16 18:25:23 +0000 | [diff] [blame] | 279 | |
Chris Lattner | 4416f1a | 2005-08-19 22:38:53 +0000 | [diff] [blame] | 280 | /// getGlobalBaseReg - Output the instructions required to put the |
| 281 | /// base address to use for accessing globals into a register. |
| 282 | /// |
Nate Begeman | 1d9d742 | 2005-10-18 00:28:58 +0000 | [diff] [blame] | 283 | SDOperand PPCDAGToDAGISel::getGlobalBaseReg() { |
Chris Lattner | 4416f1a | 2005-08-19 22:38:53 +0000 | [diff] [blame] | 284 | if (!GlobalBaseReg) { |
| 285 | // Insert the set of GlobalBaseReg into the first MBB of the function |
| 286 | MachineBasicBlock &FirstMBB = BB->getParent()->front(); |
| 287 | MachineBasicBlock::iterator MBBI = FirstMBB.begin(); |
| 288 | SSARegMap *RegMap = BB->getParent()->getSSARegMap(); |
Nate Begeman | 1d9d742 | 2005-10-18 00:28:58 +0000 | [diff] [blame] | 289 | // FIXME: when we get to LP64, we will need to create the appropriate |
| 290 | // type of register here. |
| 291 | GlobalBaseReg = RegMap->createVirtualRegister(PPC::GPRCRegisterClass); |
Chris Lattner | 4416f1a | 2005-08-19 22:38:53 +0000 | [diff] [blame] | 292 | BuildMI(FirstMBB, MBBI, PPC::MovePCtoLR, 0, PPC::LR); |
| 293 | BuildMI(FirstMBB, MBBI, PPC::MFLR, 1, GlobalBaseReg); |
| 294 | } |
Chris Lattner | 9944b76 | 2005-08-21 22:31:09 +0000 | [diff] [blame] | 295 | return CurDAG->getRegister(GlobalBaseReg, MVT::i32); |
Chris Lattner | 4416f1a | 2005-08-19 22:38:53 +0000 | [diff] [blame] | 296 | } |
| 297 | |
| 298 | |
Nate Begeman | 0f3257a | 2005-08-18 05:00:13 +0000 | [diff] [blame] | 299 | // isIntImmediate - This method tests to see if a constant operand. |
| 300 | // If so Imm will receive the 32 bit value. |
| 301 | static bool isIntImmediate(SDNode *N, unsigned& Imm) { |
| 302 | if (N->getOpcode() == ISD::Constant) { |
| 303 | Imm = cast<ConstantSDNode>(N)->getValue(); |
| 304 | return true; |
| 305 | } |
| 306 | return false; |
| 307 | } |
| 308 | |
Nate Begeman | cffc32b | 2005-08-18 07:30:46 +0000 | [diff] [blame] | 309 | // isRunOfOnes - Returns true iff Val consists of one contiguous run of 1s with |
| 310 | // any number of 0s on either side. The 1s are allowed to wrap from LSB to |
| 311 | // MSB, so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is |
| 312 | // not, since all 1s are not contiguous. |
| 313 | static bool isRunOfOnes(unsigned Val, unsigned &MB, unsigned &ME) { |
| 314 | if (isShiftedMask_32(Val)) { |
| 315 | // look for the first non-zero bit |
| 316 | MB = CountLeadingZeros_32(Val); |
| 317 | // look for the first zero bit after the run of ones |
| 318 | ME = CountLeadingZeros_32((Val - 1) ^ Val); |
| 319 | return true; |
Chris Lattner | 2fe76e5 | 2005-08-25 04:47:18 +0000 | [diff] [blame] | 320 | } else { |
| 321 | Val = ~Val; // invert mask |
| 322 | if (isShiftedMask_32(Val)) { |
| 323 | // effectively look for the first zero bit |
| 324 | ME = CountLeadingZeros_32(Val) - 1; |
| 325 | // effectively look for the first one bit after the run of zeros |
| 326 | MB = CountLeadingZeros_32((Val - 1) ^ Val) + 1; |
| 327 | return true; |
| 328 | } |
Nate Begeman | cffc32b | 2005-08-18 07:30:46 +0000 | [diff] [blame] | 329 | } |
| 330 | // no run present |
| 331 | return false; |
| 332 | } |
| 333 | |
Chris Lattner | 65a419a | 2005-10-09 05:36:17 +0000 | [diff] [blame] | 334 | // isRotateAndMask - Returns true if Mask and Shift can be folded into a rotate |
Nate Begeman | cffc32b | 2005-08-18 07:30:46 +0000 | [diff] [blame] | 335 | // and mask opcode and mask operation. |
| 336 | static bool isRotateAndMask(SDNode *N, unsigned Mask, bool IsShiftMask, |
| 337 | unsigned &SH, unsigned &MB, unsigned &ME) { |
Nate Begeman | da32c9e | 2005-10-19 00:05:37 +0000 | [diff] [blame] | 338 | // Don't even go down this path for i64, since different logic will be |
| 339 | // necessary for rldicl/rldicr/rldimi. |
| 340 | if (N->getValueType(0) != MVT::i32) |
| 341 | return false; |
| 342 | |
Nate Begeman | cffc32b | 2005-08-18 07:30:46 +0000 | [diff] [blame] | 343 | unsigned Shift = 32; |
| 344 | unsigned Indeterminant = ~0; // bit mask marking indeterminant results |
| 345 | unsigned Opcode = N->getOpcode(); |
Chris Lattner | 1505573 | 2005-08-30 00:59:16 +0000 | [diff] [blame] | 346 | if (N->getNumOperands() != 2 || |
| 347 | !isIntImmediate(N->getOperand(1).Val, Shift) || (Shift > 31)) |
Nate Begeman | cffc32b | 2005-08-18 07:30:46 +0000 | [diff] [blame] | 348 | return false; |
| 349 | |
| 350 | if (Opcode == ISD::SHL) { |
| 351 | // apply shift left to mask if it comes first |
| 352 | if (IsShiftMask) Mask = Mask << Shift; |
| 353 | // determine which bits are made indeterminant by shift |
| 354 | Indeterminant = ~(0xFFFFFFFFu << Shift); |
Chris Lattner | 651dea7 | 2005-10-15 21:40:12 +0000 | [diff] [blame] | 355 | } else if (Opcode == ISD::SRL) { |
Nate Begeman | cffc32b | 2005-08-18 07:30:46 +0000 | [diff] [blame] | 356 | // apply shift right to mask if it comes first |
| 357 | if (IsShiftMask) Mask = Mask >> Shift; |
| 358 | // determine which bits are made indeterminant by shift |
| 359 | Indeterminant = ~(0xFFFFFFFFu >> Shift); |
| 360 | // adjust for the left rotate |
| 361 | Shift = 32 - Shift; |
| 362 | } else { |
| 363 | return false; |
| 364 | } |
| 365 | |
| 366 | // if the mask doesn't intersect any Indeterminant bits |
| 367 | if (Mask && !(Mask & Indeterminant)) { |
| 368 | SH = Shift; |
| 369 | // make sure the mask is still a mask (wrap arounds may not be) |
| 370 | return isRunOfOnes(Mask, MB, ME); |
| 371 | } |
| 372 | return false; |
| 373 | } |
| 374 | |
Nate Begeman | 0f3257a | 2005-08-18 05:00:13 +0000 | [diff] [blame] | 375 | // isOpcWithIntImmediate - This method tests to see if the node is a specific |
| 376 | // opcode and that it has a immediate integer right operand. |
| 377 | // If so Imm will receive the 32 bit value. |
| 378 | static bool isOpcWithIntImmediate(SDNode *N, unsigned Opc, unsigned& Imm) { |
| 379 | return N->getOpcode() == Opc && isIntImmediate(N->getOperand(1).Val, Imm); |
| 380 | } |
| 381 | |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 382 | // isIntImmediate - This method tests to see if a constant operand. |
| 383 | // If so Imm will receive the 32 bit value. |
| 384 | static bool isIntImmediate(SDOperand N, unsigned& Imm) { |
| 385 | if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N)) { |
| 386 | Imm = (unsigned)CN->getSignExtended(); |
| 387 | return true; |
| 388 | } |
| 389 | return false; |
| 390 | } |
| 391 | |
Nate Begeman | 02b88a4 | 2005-08-19 00:38:14 +0000 | [diff] [blame] | 392 | /// SelectBitfieldInsert - turn an or of two masked values into |
| 393 | /// the rotate left word immediate then mask insert (rlwimi) instruction. |
Nate Begeman | 1d9d742 | 2005-10-18 00:28:58 +0000 | [diff] [blame] | 394 | SDNode *PPCDAGToDAGISel::SelectBitfieldInsert(SDNode *N) { |
Nate Begeman | 02b88a4 | 2005-08-19 00:38:14 +0000 | [diff] [blame] | 395 | unsigned TgtMask = 0xFFFFFFFF, InsMask = 0xFFFFFFFF, SH = 0; |
| 396 | unsigned Value; |
| 397 | |
| 398 | SDOperand Op0 = N->getOperand(0); |
| 399 | SDOperand Op1 = N->getOperand(1); |
| 400 | |
| 401 | unsigned Op0Opc = Op0.getOpcode(); |
| 402 | unsigned Op1Opc = Op1.getOpcode(); |
| 403 | |
Nate Begeman | 77f361f | 2006-05-07 00:23:38 +0000 | [diff] [blame^] | 404 | uint64_t LKZ, LKO, RKZ, RKO; |
| 405 | TLI.ComputeMaskedBits(Op0, TgtMask, LKZ, LKO); |
| 406 | TLI.ComputeMaskedBits(Op1, TgtMask, RKZ, RKO); |
Nate Begeman | 02b88a4 | 2005-08-19 00:38:14 +0000 | [diff] [blame] | 407 | |
Nate Begeman | 77f361f | 2006-05-07 00:23:38 +0000 | [diff] [blame^] | 408 | // FIXME: rotrwi / rotlwi |
| 409 | if ((LKZ | RKZ) == 0x00000000FFFFFFFFULL) { |
| 410 | unsigned PInsMask = ~RKZ; |
| 411 | unsigned PTgtMask = ~LKZ; |
| 412 | |
| 413 | // If the LHS has a foldable shift, then swap it to the RHS so that we can |
| 414 | // fold the shift into the insert. |
| 415 | if (Op0Opc == ISD::AND && Op1Opc == ISD::AND) { |
| 416 | if (Op0.getOperand(0).getOpcode() == ISD::SHL || |
| 417 | Op0.getOperand(0).getOpcode() == ISD::SRL) { |
| 418 | if (Op1.getOperand(0).getOpcode() != ISD::SHL && |
| 419 | Op1.getOperand(0).getOpcode() != ISD::SRL) { |
| 420 | std::swap(Op0, Op1); |
| 421 | std::swap(Op0Opc, Op1Opc); |
| 422 | std::swap(PInsMask, PTgtMask); |
| 423 | } |
Nate Begeman | 02b88a4 | 2005-08-19 00:38:14 +0000 | [diff] [blame] | 424 | } |
| 425 | } |
Nate Begeman | 77f361f | 2006-05-07 00:23:38 +0000 | [diff] [blame^] | 426 | |
| 427 | unsigned MB, ME; |
| 428 | if (isRunOfOnes(PInsMask, MB, ME)) { |
| 429 | SDOperand Tmp1, Tmp2, Tmp3; |
| 430 | bool DisjointMask = (PTgtMask ^ PInsMask) == 0xFFFFFFFF; |
| 431 | |
| 432 | if ((Op1Opc == ISD::SHL || Op1Opc == ISD::SRL) && |
| 433 | isIntImmediate(Op1.getOperand(1), Value)) { |
| 434 | Op1 = Op1.getOperand(0); |
| 435 | SH = (Op1Opc == ISD::SHL) ? Value : 32 - Value; |
| 436 | } |
| 437 | if (Op1Opc == ISD::AND) { |
| 438 | unsigned SHOpc = Op1.getOperand(0).getOpcode(); |
| 439 | if ((SHOpc == ISD::SHL || SHOpc == ISD::SRL) && |
| 440 | isIntImmediate(Op1.getOperand(0).getOperand(1), Value)) { |
| 441 | Op1 = Op1.getOperand(0).getOperand(0); |
| 442 | SH = (SHOpc == ISD::SHL) ? Value : 32 - Value; |
| 443 | } else { |
| 444 | Op1 = Op1.getOperand(0); |
| 445 | } |
| 446 | } |
| 447 | |
| 448 | Tmp3 = (Op0Opc == ISD::AND && DisjointMask) ? Op0.getOperand(0) : Op0; |
| 449 | Select(Tmp1, Tmp3); |
| 450 | Select(Tmp2, Op1); |
| 451 | return CurDAG->getTargetNode(PPC::RLWIMI, MVT::i32, Tmp1, Tmp2, |
| 452 | getI32Imm(SH), getI32Imm(MB), getI32Imm(ME)); |
Nate Begeman | 02b88a4 | 2005-08-19 00:38:14 +0000 | [diff] [blame] | 453 | } |
Nate Begeman | 02b88a4 | 2005-08-19 00:38:14 +0000 | [diff] [blame] | 454 | } |
| 455 | return 0; |
| 456 | } |
| 457 | |
Nate Begeman | 7fd1edd | 2005-12-19 23:25:09 +0000 | [diff] [blame] | 458 | /// SelectAddrImm - Returns true if the address N can be represented by |
| 459 | /// a base register plus a signed 16-bit displacement [r+imm]. |
| 460 | bool PPCDAGToDAGISel::SelectAddrImm(SDOperand N, SDOperand &Disp, |
| 461 | SDOperand &Base) { |
Chris Lattner | 0f6ab6f | 2006-03-01 07:14:48 +0000 | [diff] [blame] | 462 | // If this can be more profitably realized as r+r, fail. |
| 463 | if (SelectAddrIdx(N, Disp, Base)) |
| 464 | return false; |
| 465 | |
Nate Begeman | 7fd1edd | 2005-12-19 23:25:09 +0000 | [diff] [blame] | 466 | if (N.getOpcode() == ISD::ADD) { |
| 467 | unsigned imm = 0; |
| 468 | if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm)) { |
Chris Lattner | 17e82d2 | 2006-01-12 01:54:15 +0000 | [diff] [blame] | 469 | Disp = getI32Imm(imm & 0xFFFF); |
Nate Begeman | 7fd1edd | 2005-12-19 23:25:09 +0000 | [diff] [blame] | 470 | if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(N.getOperand(0))) { |
| 471 | Base = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32); |
Chris Lattner | 9944b76 | 2005-08-21 22:31:09 +0000 | [diff] [blame] | 472 | } else { |
Evan Cheng | 7564e0b | 2006-02-05 08:45:01 +0000 | [diff] [blame] | 473 | Base = N.getOperand(0); |
Chris Lattner | 9944b76 | 2005-08-21 22:31:09 +0000 | [diff] [blame] | 474 | } |
Nate Begeman | 7fd1edd | 2005-12-19 23:25:09 +0000 | [diff] [blame] | 475 | return true; // [r+i] |
| 476 | } else if (N.getOperand(1).getOpcode() == PPCISD::Lo) { |
Chris Lattner | 4f0f86d | 2005-11-17 18:02:16 +0000 | [diff] [blame] | 477 | // Match LOAD (ADD (X, Lo(G))). |
Nate Begeman | 7fd1edd | 2005-12-19 23:25:09 +0000 | [diff] [blame] | 478 | assert(!cast<ConstantSDNode>(N.getOperand(1).getOperand(1))->getValue() |
Chris Lattner | 4f0f86d | 2005-11-17 18:02:16 +0000 | [diff] [blame] | 479 | && "Cannot handle constant offsets yet!"); |
Nate Begeman | 7fd1edd | 2005-12-19 23:25:09 +0000 | [diff] [blame] | 480 | Disp = N.getOperand(1).getOperand(0); // The global address. |
| 481 | assert(Disp.getOpcode() == ISD::TargetGlobalAddress || |
Nate Begeman | 37efe67 | 2006-04-22 18:53:45 +0000 | [diff] [blame] | 482 | Disp.getOpcode() == ISD::TargetConstantPool || |
| 483 | Disp.getOpcode() == ISD::TargetJumpTable); |
Evan Cheng | 7564e0b | 2006-02-05 08:45:01 +0000 | [diff] [blame] | 484 | Base = N.getOperand(0); |
Nate Begeman | 7fd1edd | 2005-12-19 23:25:09 +0000 | [diff] [blame] | 485 | return true; // [&g+r] |
Chris Lattner | 9944b76 | 2005-08-21 22:31:09 +0000 | [diff] [blame] | 486 | } |
Chris Lattner | 0f6ab6f | 2006-03-01 07:14:48 +0000 | [diff] [blame] | 487 | } else if (N.getOpcode() == ISD::OR) { |
| 488 | unsigned imm = 0; |
| 489 | if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm)) { |
| 490 | // If this is an or of disjoint bitfields, we can codegen this as an add |
| 491 | // (for better address arithmetic) if the LHS and RHS of the OR are |
| 492 | // provably disjoint. |
| 493 | uint64_t LHSKnownZero, LHSKnownOne; |
| 494 | PPCLowering.ComputeMaskedBits(N.getOperand(0), ~0U, |
| 495 | LHSKnownZero, LHSKnownOne); |
| 496 | if ((LHSKnownZero|~imm) == ~0U) { |
| 497 | // If all of the bits are known zero on the LHS or RHS, the add won't |
| 498 | // carry. |
| 499 | Base = N.getOperand(0); |
| 500 | Disp = getI32Imm(imm & 0xFFFF); |
| 501 | return true; |
| 502 | } |
| 503 | } |
Chris Lattner | d979644 | 2006-03-20 22:38:22 +0000 | [diff] [blame] | 504 | } else if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N)) { |
| 505 | // Loading from a constant address. |
| 506 | int Addr = (int)CN->getValue(); |
| 507 | |
| 508 | // If this address fits entirely in a 16-bit sext immediate field, codegen |
| 509 | // this as "d, 0" |
| 510 | if (Addr == (short)Addr) { |
| 511 | Disp = getI32Imm(Addr); |
| 512 | Base = CurDAG->getRegister(PPC::R0, MVT::i32); |
| 513 | return true; |
| 514 | } |
| 515 | |
| 516 | // Otherwise, break this down into an LIS + disp. |
| 517 | Disp = getI32Imm((short)Addr); |
| 518 | Base = CurDAG->getConstant(Addr - (signed short)Addr, MVT::i32); |
| 519 | return true; |
Chris Lattner | 9944b76 | 2005-08-21 22:31:09 +0000 | [diff] [blame] | 520 | } |
Chris Lattner | d979644 | 2006-03-20 22:38:22 +0000 | [diff] [blame] | 521 | |
Nate Begeman | 7fd1edd | 2005-12-19 23:25:09 +0000 | [diff] [blame] | 522 | Disp = getI32Imm(0); |
| 523 | if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(N)) |
| 524 | Base = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32); |
Nate Begeman | 28a6b02 | 2005-12-10 02:36:00 +0000 | [diff] [blame] | 525 | else |
Evan Cheng | 7564e0b | 2006-02-05 08:45:01 +0000 | [diff] [blame] | 526 | Base = N; |
Nate Begeman | 7fd1edd | 2005-12-19 23:25:09 +0000 | [diff] [blame] | 527 | return true; // [r+0] |
Chris Lattner | 9944b76 | 2005-08-21 22:31:09 +0000 | [diff] [blame] | 528 | } |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 529 | |
Nate Begeman | 7fd1edd | 2005-12-19 23:25:09 +0000 | [diff] [blame] | 530 | /// SelectAddrIdx - Given the specified addressed, check to see if it can be |
| 531 | /// represented as an indexed [r+r] operation. Returns false if it can |
| 532 | /// be represented by [r+imm], which are preferred. |
| 533 | bool PPCDAGToDAGISel::SelectAddrIdx(SDOperand N, SDOperand &Base, |
| 534 | SDOperand &Index) { |
Chris Lattner | 0f6ab6f | 2006-03-01 07:14:48 +0000 | [diff] [blame] | 535 | unsigned imm = 0; |
Nate Begeman | 7fd1edd | 2005-12-19 23:25:09 +0000 | [diff] [blame] | 536 | if (N.getOpcode() == ISD::ADD) { |
Chris Lattner | 0f6ab6f | 2006-03-01 07:14:48 +0000 | [diff] [blame] | 537 | if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm)) |
| 538 | return false; // r+i |
| 539 | if (N.getOperand(1).getOpcode() == PPCISD::Lo) |
| 540 | return false; // r+i |
| 541 | |
Evan Cheng | 7564e0b | 2006-02-05 08:45:01 +0000 | [diff] [blame] | 542 | Base = N.getOperand(0); |
| 543 | Index = N.getOperand(1); |
Nate Begeman | 7fd1edd | 2005-12-19 23:25:09 +0000 | [diff] [blame] | 544 | return true; |
Chris Lattner | 0f6ab6f | 2006-03-01 07:14:48 +0000 | [diff] [blame] | 545 | } else if (N.getOpcode() == ISD::OR) { |
| 546 | if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm)) |
| 547 | return false; // r+i can fold it if we can. |
| 548 | |
| 549 | // If this is an or of disjoint bitfields, we can codegen this as an add |
| 550 | // (for better address arithmetic) if the LHS and RHS of the OR are provably |
| 551 | // disjoint. |
| 552 | uint64_t LHSKnownZero, LHSKnownOne; |
| 553 | uint64_t RHSKnownZero, RHSKnownOne; |
| 554 | PPCLowering.ComputeMaskedBits(N.getOperand(0), ~0U, |
| 555 | LHSKnownZero, LHSKnownOne); |
| 556 | |
| 557 | if (LHSKnownZero) { |
| 558 | PPCLowering.ComputeMaskedBits(N.getOperand(1), ~0U, |
| 559 | RHSKnownZero, RHSKnownOne); |
| 560 | // If all of the bits are known zero on the LHS or RHS, the add won't |
| 561 | // carry. |
| 562 | if ((LHSKnownZero | RHSKnownZero) == ~0U) { |
| 563 | Base = N.getOperand(0); |
| 564 | Index = N.getOperand(1); |
| 565 | return true; |
| 566 | } |
| 567 | } |
Nate Begeman | 7fd1edd | 2005-12-19 23:25:09 +0000 | [diff] [blame] | 568 | } |
Chris Lattner | 0f6ab6f | 2006-03-01 07:14:48 +0000 | [diff] [blame] | 569 | |
| 570 | return false; |
Nate Begeman | 7fd1edd | 2005-12-19 23:25:09 +0000 | [diff] [blame] | 571 | } |
| 572 | |
| 573 | /// SelectAddrIdxOnly - Given the specified addressed, force it to be |
| 574 | /// represented as an indexed [r+r] operation. |
| 575 | bool PPCDAGToDAGISel::SelectAddrIdxOnly(SDOperand N, SDOperand &Base, |
| 576 | SDOperand &Index) { |
Chris Lattner | 0f6ab6f | 2006-03-01 07:14:48 +0000 | [diff] [blame] | 577 | // Check to see if we can easily represent this as an [r+r] address. This |
| 578 | // will fail if it thinks that the address is more profitably represented as |
| 579 | // reg+imm, e.g. where imm = 0. |
Chris Lattner | 54e869e | 2006-03-24 17:58:06 +0000 | [diff] [blame] | 580 | if (SelectAddrIdx(N, Base, Index)) |
| 581 | return true; |
| 582 | |
| 583 | // If the operand is an addition, always emit this as [r+r], since this is |
| 584 | // better (for code size, and execution, as the memop does the add for free) |
| 585 | // than emitting an explicit add. |
| 586 | if (N.getOpcode() == ISD::ADD) { |
| 587 | Base = N.getOperand(0); |
| 588 | Index = N.getOperand(1); |
| 589 | return true; |
Nate Begeman | f43a3ca | 2005-11-30 08:22:07 +0000 | [diff] [blame] | 590 | } |
Chris Lattner | 54e869e | 2006-03-24 17:58:06 +0000 | [diff] [blame] | 591 | |
| 592 | // Otherwise, do it the hard way, using R0 as the base register. |
| 593 | Base = CurDAG->getRegister(PPC::R0, MVT::i32); |
| 594 | Index = N; |
Nate Begeman | 7fd1edd | 2005-12-19 23:25:09 +0000 | [diff] [blame] | 595 | return true; |
Nate Begeman | f43a3ca | 2005-11-30 08:22:07 +0000 | [diff] [blame] | 596 | } |
| 597 | |
Chris Lattner | e5ba580 | 2006-03-22 05:26:03 +0000 | [diff] [blame] | 598 | /// SelectAddrImmShift - Returns true if the address N can be represented by |
| 599 | /// a base register plus a signed 14-bit displacement [r+imm*4]. Suitable |
| 600 | /// for use by STD and friends. |
| 601 | bool PPCDAGToDAGISel::SelectAddrImmShift(SDOperand N, SDOperand &Disp, |
| 602 | SDOperand &Base) { |
| 603 | // If this can be more profitably realized as r+r, fail. |
| 604 | if (SelectAddrIdx(N, Disp, Base)) |
| 605 | return false; |
| 606 | |
| 607 | if (N.getOpcode() == ISD::ADD) { |
| 608 | unsigned imm = 0; |
| 609 | if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm) && |
| 610 | (imm & 3) == 0) { |
| 611 | Disp = getI32Imm((imm & 0xFFFF) >> 2); |
| 612 | if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(N.getOperand(0))) { |
| 613 | Base = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32); |
| 614 | } else { |
| 615 | Base = N.getOperand(0); |
| 616 | } |
| 617 | return true; // [r+i] |
| 618 | } else if (N.getOperand(1).getOpcode() == PPCISD::Lo) { |
| 619 | // Match LOAD (ADD (X, Lo(G))). |
| 620 | assert(!cast<ConstantSDNode>(N.getOperand(1).getOperand(1))->getValue() |
| 621 | && "Cannot handle constant offsets yet!"); |
| 622 | Disp = N.getOperand(1).getOperand(0); // The global address. |
| 623 | assert(Disp.getOpcode() == ISD::TargetGlobalAddress || |
Nate Begeman | 37efe67 | 2006-04-22 18:53:45 +0000 | [diff] [blame] | 624 | Disp.getOpcode() == ISD::TargetConstantPool || |
| 625 | Disp.getOpcode() == ISD::TargetJumpTable); |
Chris Lattner | e5ba580 | 2006-03-22 05:26:03 +0000 | [diff] [blame] | 626 | Base = N.getOperand(0); |
| 627 | return true; // [&g+r] |
| 628 | } |
| 629 | } else if (N.getOpcode() == ISD::OR) { |
| 630 | unsigned imm = 0; |
| 631 | if (isIntImmediate(N.getOperand(1), imm) && isInt16(imm) && |
| 632 | (imm & 3) == 0) { |
| 633 | // If this is an or of disjoint bitfields, we can codegen this as an add |
| 634 | // (for better address arithmetic) if the LHS and RHS of the OR are |
| 635 | // provably disjoint. |
| 636 | uint64_t LHSKnownZero, LHSKnownOne; |
| 637 | PPCLowering.ComputeMaskedBits(N.getOperand(0), ~0U, |
| 638 | LHSKnownZero, LHSKnownOne); |
| 639 | if ((LHSKnownZero|~imm) == ~0U) { |
| 640 | // If all of the bits are known zero on the LHS or RHS, the add won't |
| 641 | // carry. |
| 642 | Base = N.getOperand(0); |
| 643 | Disp = getI32Imm((imm & 0xFFFF) >> 2); |
| 644 | return true; |
| 645 | } |
| 646 | } |
| 647 | } else if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N)) { |
| 648 | // Loading from a constant address. |
| 649 | int Addr = (int)CN->getValue(); |
| 650 | if ((Addr & 3) == 0) { |
| 651 | // If this address fits entirely in a 16-bit sext immediate field, codegen |
| 652 | // this as "d, 0" |
| 653 | if (Addr == (short)Addr) { |
| 654 | Disp = getI32Imm(Addr >> 2); |
| 655 | Base = CurDAG->getRegister(PPC::R0, MVT::i32); |
| 656 | return true; |
| 657 | } |
| 658 | |
| 659 | // Otherwise, break this down into an LIS + disp. |
| 660 | Disp = getI32Imm((short)Addr >> 2); |
| 661 | Base = CurDAG->getConstant(Addr - (signed short)Addr, MVT::i32); |
| 662 | return true; |
| 663 | } |
| 664 | } |
| 665 | |
| 666 | Disp = getI32Imm(0); |
| 667 | if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(N)) |
| 668 | Base = CurDAG->getTargetFrameIndex(FI->getIndex(), MVT::i32); |
| 669 | else |
| 670 | Base = N; |
| 671 | return true; // [r+0] |
| 672 | } |
| 673 | |
| 674 | |
Chris Lattner | 2fbb457 | 2005-08-21 18:50:37 +0000 | [diff] [blame] | 675 | /// SelectCC - Select a comparison of the specified values with the specified |
| 676 | /// condition code, returning the CR# of the expression. |
Nate Begeman | 1d9d742 | 2005-10-18 00:28:58 +0000 | [diff] [blame] | 677 | SDOperand PPCDAGToDAGISel::SelectCC(SDOperand LHS, SDOperand RHS, |
| 678 | ISD::CondCode CC) { |
Chris Lattner | 2fbb457 | 2005-08-21 18:50:37 +0000 | [diff] [blame] | 679 | // Always select the LHS. |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 680 | Select(LHS, LHS); |
Chris Lattner | 2fbb457 | 2005-08-21 18:50:37 +0000 | [diff] [blame] | 681 | |
| 682 | // Use U to determine whether the SETCC immediate range is signed or not. |
| 683 | if (MVT::isInteger(LHS.getValueType())) { |
| 684 | bool U = ISD::isUnsignedIntSetCC(CC); |
| 685 | unsigned Imm; |
| 686 | if (isIntImmediate(RHS, Imm) && |
| 687 | ((U && isUInt16(Imm)) || (!U && isInt16(Imm)))) |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 688 | return SDOperand(CurDAG->getTargetNode(U ? PPC::CMPLWI : PPC::CMPWI, |
| 689 | MVT::i32, LHS, getI32Imm(Imm & 0xFFFF)), 0); |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 690 | Select(RHS, RHS); |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 691 | return SDOperand(CurDAG->getTargetNode(U ? PPC::CMPLW : PPC::CMPW, MVT::i32, |
| 692 | LHS, RHS), 0); |
Chris Lattner | 919c032 | 2005-10-01 01:35:02 +0000 | [diff] [blame] | 693 | } else if (LHS.getValueType() == MVT::f32) { |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 694 | Select(RHS, RHS); |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 695 | return SDOperand(CurDAG->getTargetNode(PPC::FCMPUS, MVT::i32, LHS, RHS), 0); |
Chris Lattner | 2fbb457 | 2005-08-21 18:50:37 +0000 | [diff] [blame] | 696 | } else { |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 697 | Select(RHS, RHS); |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 698 | return SDOperand(CurDAG->getTargetNode(PPC::FCMPUD, MVT::i32, LHS, RHS), 0); |
Chris Lattner | 2fbb457 | 2005-08-21 18:50:37 +0000 | [diff] [blame] | 699 | } |
| 700 | } |
| 701 | |
| 702 | /// getBCCForSetCC - Returns the PowerPC condition branch mnemonic corresponding |
| 703 | /// to Condition. |
| 704 | static unsigned getBCCForSetCC(ISD::CondCode CC) { |
| 705 | switch (CC) { |
| 706 | default: assert(0 && "Unknown condition!"); abort(); |
Chris Lattner | ed048c0 | 2005-10-28 20:49:47 +0000 | [diff] [blame] | 707 | case ISD::SETOEQ: // FIXME: This is incorrect see PR642. |
Chris Lattner | 2fbb457 | 2005-08-21 18:50:37 +0000 | [diff] [blame] | 708 | case ISD::SETEQ: return PPC::BEQ; |
Chris Lattner | ed048c0 | 2005-10-28 20:49:47 +0000 | [diff] [blame] | 709 | case ISD::SETONE: // FIXME: This is incorrect see PR642. |
Chris Lattner | 2fbb457 | 2005-08-21 18:50:37 +0000 | [diff] [blame] | 710 | case ISD::SETNE: return PPC::BNE; |
Chris Lattner | ed048c0 | 2005-10-28 20:49:47 +0000 | [diff] [blame] | 711 | case ISD::SETOLT: // FIXME: This is incorrect see PR642. |
Chris Lattner | 2fbb457 | 2005-08-21 18:50:37 +0000 | [diff] [blame] | 712 | case ISD::SETULT: |
| 713 | case ISD::SETLT: return PPC::BLT; |
Chris Lattner | ed048c0 | 2005-10-28 20:49:47 +0000 | [diff] [blame] | 714 | case ISD::SETOLE: // FIXME: This is incorrect see PR642. |
Chris Lattner | 2fbb457 | 2005-08-21 18:50:37 +0000 | [diff] [blame] | 715 | case ISD::SETULE: |
| 716 | case ISD::SETLE: return PPC::BLE; |
Chris Lattner | ed048c0 | 2005-10-28 20:49:47 +0000 | [diff] [blame] | 717 | case ISD::SETOGT: // FIXME: This is incorrect see PR642. |
Chris Lattner | 2fbb457 | 2005-08-21 18:50:37 +0000 | [diff] [blame] | 718 | case ISD::SETUGT: |
| 719 | case ISD::SETGT: return PPC::BGT; |
Chris Lattner | ed048c0 | 2005-10-28 20:49:47 +0000 | [diff] [blame] | 720 | case ISD::SETOGE: // FIXME: This is incorrect see PR642. |
Chris Lattner | 2fbb457 | 2005-08-21 18:50:37 +0000 | [diff] [blame] | 721 | case ISD::SETUGE: |
| 722 | case ISD::SETGE: return PPC::BGE; |
Chris Lattner | 6df2507 | 2005-10-28 20:32:44 +0000 | [diff] [blame] | 723 | |
| 724 | case ISD::SETO: return PPC::BUN; |
| 725 | case ISD::SETUO: return PPC::BNU; |
Chris Lattner | 2fbb457 | 2005-08-21 18:50:37 +0000 | [diff] [blame] | 726 | } |
| 727 | return 0; |
| 728 | } |
| 729 | |
Chris Lattner | 64906a0 | 2005-08-25 20:08:18 +0000 | [diff] [blame] | 730 | /// getCRIdxForSetCC - Return the index of the condition register field |
| 731 | /// associated with the SetCC condition, and whether or not the field is |
| 732 | /// treated as inverted. That is, lt = 0; ge = 0 inverted. |
| 733 | static unsigned getCRIdxForSetCC(ISD::CondCode CC, bool& Inv) { |
| 734 | switch (CC) { |
| 735 | default: assert(0 && "Unknown condition!"); abort(); |
Chris Lattner | ed048c0 | 2005-10-28 20:49:47 +0000 | [diff] [blame] | 736 | case ISD::SETOLT: // FIXME: This is incorrect see PR642. |
Chris Lattner | 64906a0 | 2005-08-25 20:08:18 +0000 | [diff] [blame] | 737 | case ISD::SETULT: |
| 738 | case ISD::SETLT: Inv = false; return 0; |
Chris Lattner | ed048c0 | 2005-10-28 20:49:47 +0000 | [diff] [blame] | 739 | case ISD::SETOGE: // FIXME: This is incorrect see PR642. |
Chris Lattner | 64906a0 | 2005-08-25 20:08:18 +0000 | [diff] [blame] | 740 | case ISD::SETUGE: |
| 741 | case ISD::SETGE: Inv = true; return 0; |
Chris Lattner | ed048c0 | 2005-10-28 20:49:47 +0000 | [diff] [blame] | 742 | case ISD::SETOGT: // FIXME: This is incorrect see PR642. |
Chris Lattner | 64906a0 | 2005-08-25 20:08:18 +0000 | [diff] [blame] | 743 | case ISD::SETUGT: |
| 744 | case ISD::SETGT: Inv = false; return 1; |
Chris Lattner | ed048c0 | 2005-10-28 20:49:47 +0000 | [diff] [blame] | 745 | case ISD::SETOLE: // FIXME: This is incorrect see PR642. |
Chris Lattner | 64906a0 | 2005-08-25 20:08:18 +0000 | [diff] [blame] | 746 | case ISD::SETULE: |
| 747 | case ISD::SETLE: Inv = true; return 1; |
Chris Lattner | ed048c0 | 2005-10-28 20:49:47 +0000 | [diff] [blame] | 748 | case ISD::SETOEQ: // FIXME: This is incorrect see PR642. |
Chris Lattner | 64906a0 | 2005-08-25 20:08:18 +0000 | [diff] [blame] | 749 | case ISD::SETEQ: Inv = false; return 2; |
Chris Lattner | ed048c0 | 2005-10-28 20:49:47 +0000 | [diff] [blame] | 750 | case ISD::SETONE: // FIXME: This is incorrect see PR642. |
Chris Lattner | 64906a0 | 2005-08-25 20:08:18 +0000 | [diff] [blame] | 751 | case ISD::SETNE: Inv = true; return 2; |
Chris Lattner | 6df2507 | 2005-10-28 20:32:44 +0000 | [diff] [blame] | 752 | case ISD::SETO: Inv = true; return 3; |
| 753 | case ISD::SETUO: Inv = false; return 3; |
Chris Lattner | 64906a0 | 2005-08-25 20:08:18 +0000 | [diff] [blame] | 754 | } |
| 755 | return 0; |
| 756 | } |
Chris Lattner | 9944b76 | 2005-08-21 22:31:09 +0000 | [diff] [blame] | 757 | |
Nate Begeman | 1d9d742 | 2005-10-18 00:28:58 +0000 | [diff] [blame] | 758 | SDOperand PPCDAGToDAGISel::SelectSETCC(SDOperand Op) { |
Chris Lattner | 222adac | 2005-10-06 19:03:35 +0000 | [diff] [blame] | 759 | SDNode *N = Op.Val; |
| 760 | unsigned Imm; |
| 761 | ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(2))->get(); |
| 762 | if (isIntImmediate(N->getOperand(1), Imm)) { |
| 763 | // We can codegen setcc op, imm very efficiently compared to a brcond. |
| 764 | // Check for those cases here. |
| 765 | // setcc op, 0 |
| 766 | if (Imm == 0) { |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 767 | SDOperand Op; |
| 768 | Select(Op, N->getOperand(0)); |
Chris Lattner | 222adac | 2005-10-06 19:03:35 +0000 | [diff] [blame] | 769 | switch (CC) { |
Chris Lattner | dabb829 | 2005-10-21 21:17:10 +0000 | [diff] [blame] | 770 | default: break; |
| 771 | case ISD::SETEQ: |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 772 | Op = SDOperand(CurDAG->getTargetNode(PPC::CNTLZW, MVT::i32, Op), 0); |
Chris Lattner | 71d3d50 | 2005-11-30 22:53:06 +0000 | [diff] [blame] | 773 | return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Op, getI32Imm(27), |
| 774 | getI32Imm(5), getI32Imm(31)); |
Chris Lattner | dabb829 | 2005-10-21 21:17:10 +0000 | [diff] [blame] | 775 | case ISD::SETNE: { |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 776 | SDOperand AD = |
| 777 | SDOperand(CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag, |
| 778 | Op, getI32Imm(~0U)), 0); |
Chris Lattner | 71d3d50 | 2005-11-30 22:53:06 +0000 | [diff] [blame] | 779 | return CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, AD, Op, |
| 780 | AD.getValue(1)); |
Chris Lattner | 222adac | 2005-10-06 19:03:35 +0000 | [diff] [blame] | 781 | } |
Chris Lattner | dabb829 | 2005-10-21 21:17:10 +0000 | [diff] [blame] | 782 | case ISD::SETLT: |
Chris Lattner | 71d3d50 | 2005-11-30 22:53:06 +0000 | [diff] [blame] | 783 | return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Op, getI32Imm(1), |
| 784 | getI32Imm(31), getI32Imm(31)); |
Chris Lattner | dabb829 | 2005-10-21 21:17:10 +0000 | [diff] [blame] | 785 | case ISD::SETGT: { |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 786 | SDOperand T = |
| 787 | SDOperand(CurDAG->getTargetNode(PPC::NEG, MVT::i32, Op), 0); |
| 788 | T = SDOperand(CurDAG->getTargetNode(PPC::ANDC, MVT::i32, T, Op), 0); |
Chris Lattner | 71d3d50 | 2005-11-30 22:53:06 +0000 | [diff] [blame] | 789 | return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, T, getI32Imm(1), |
| 790 | getI32Imm(31), getI32Imm(31)); |
Chris Lattner | dabb829 | 2005-10-21 21:17:10 +0000 | [diff] [blame] | 791 | } |
| 792 | } |
Chris Lattner | 222adac | 2005-10-06 19:03:35 +0000 | [diff] [blame] | 793 | } else if (Imm == ~0U) { // setcc op, -1 |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 794 | SDOperand Op; |
| 795 | Select(Op, N->getOperand(0)); |
Chris Lattner | 222adac | 2005-10-06 19:03:35 +0000 | [diff] [blame] | 796 | switch (CC) { |
Chris Lattner | dabb829 | 2005-10-21 21:17:10 +0000 | [diff] [blame] | 797 | default: break; |
| 798 | case ISD::SETEQ: |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 799 | Op = SDOperand(CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag, |
| 800 | Op, getI32Imm(1)), 0); |
Chris Lattner | 71d3d50 | 2005-11-30 22:53:06 +0000 | [diff] [blame] | 801 | return CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32, |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 802 | SDOperand(CurDAG->getTargetNode(PPC::LI, MVT::i32, |
| 803 | getI32Imm(0)), 0), |
Chris Lattner | 71d3d50 | 2005-11-30 22:53:06 +0000 | [diff] [blame] | 804 | Op.getValue(1)); |
Chris Lattner | dabb829 | 2005-10-21 21:17:10 +0000 | [diff] [blame] | 805 | case ISD::SETNE: { |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 806 | Op = SDOperand(CurDAG->getTargetNode(PPC::NOR, MVT::i32, Op, Op), 0); |
| 807 | SDNode *AD = CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag, |
| 808 | Op, getI32Imm(~0U)); |
| 809 | return CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, SDOperand(AD, 0), Op, |
| 810 | SDOperand(AD, 1)); |
Chris Lattner | 222adac | 2005-10-06 19:03:35 +0000 | [diff] [blame] | 811 | } |
Chris Lattner | dabb829 | 2005-10-21 21:17:10 +0000 | [diff] [blame] | 812 | case ISD::SETLT: { |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 813 | SDOperand AD = SDOperand(CurDAG->getTargetNode(PPC::ADDI, MVT::i32, Op, |
| 814 | getI32Imm(1)), 0); |
| 815 | SDOperand AN = SDOperand(CurDAG->getTargetNode(PPC::AND, MVT::i32, AD, |
| 816 | Op), 0); |
Chris Lattner | 71d3d50 | 2005-11-30 22:53:06 +0000 | [diff] [blame] | 817 | return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, AN, getI32Imm(1), |
| 818 | getI32Imm(31), getI32Imm(31)); |
Chris Lattner | dabb829 | 2005-10-21 21:17:10 +0000 | [diff] [blame] | 819 | } |
| 820 | case ISD::SETGT: |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 821 | Op = SDOperand(CurDAG->getTargetNode(PPC::RLWINM, MVT::i32, Op, |
| 822 | getI32Imm(1), getI32Imm(31), |
| 823 | getI32Imm(31)), 0); |
Chris Lattner | 71d3d50 | 2005-11-30 22:53:06 +0000 | [diff] [blame] | 824 | return CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Op, getI32Imm(1)); |
Chris Lattner | dabb829 | 2005-10-21 21:17:10 +0000 | [diff] [blame] | 825 | } |
Chris Lattner | 222adac | 2005-10-06 19:03:35 +0000 | [diff] [blame] | 826 | } |
| 827 | } |
| 828 | |
| 829 | bool Inv; |
| 830 | unsigned Idx = getCRIdxForSetCC(CC, Inv); |
| 831 | SDOperand CCReg = SelectCC(N->getOperand(0), N->getOperand(1), CC); |
| 832 | SDOperand IntCR; |
| 833 | |
| 834 | // Force the ccreg into CR7. |
| 835 | SDOperand CR7Reg = CurDAG->getRegister(PPC::CR7, MVT::i32); |
| 836 | |
Chris Lattner | 85961d5 | 2005-12-06 20:56:18 +0000 | [diff] [blame] | 837 | SDOperand InFlag(0, 0); // Null incoming flag value. |
Chris Lattner | db1cb2b | 2005-12-01 03:50:19 +0000 | [diff] [blame] | 838 | CCReg = CurDAG->getCopyToReg(CurDAG->getEntryNode(), CR7Reg, CCReg, |
| 839 | InFlag).getValue(1); |
Chris Lattner | 222adac | 2005-10-06 19:03:35 +0000 | [diff] [blame] | 840 | |
| 841 | if (TLI.getTargetMachine().getSubtarget<PPCSubtarget>().isGigaProcessor()) |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 842 | IntCR = SDOperand(CurDAG->getTargetNode(PPC::MFOCRF, MVT::i32, CR7Reg, |
| 843 | CCReg), 0); |
Chris Lattner | 222adac | 2005-10-06 19:03:35 +0000 | [diff] [blame] | 844 | else |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 845 | IntCR = SDOperand(CurDAG->getTargetNode(PPC::MFCR, MVT::i32, CCReg), 0); |
Chris Lattner | 222adac | 2005-10-06 19:03:35 +0000 | [diff] [blame] | 846 | |
| 847 | if (!Inv) { |
Chris Lattner | 71d3d50 | 2005-11-30 22:53:06 +0000 | [diff] [blame] | 848 | return CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, IntCR, |
| 849 | getI32Imm((32-(3-Idx)) & 31), |
| 850 | getI32Imm(31), getI32Imm(31)); |
Chris Lattner | 222adac | 2005-10-06 19:03:35 +0000 | [diff] [blame] | 851 | } else { |
| 852 | SDOperand Tmp = |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 853 | SDOperand(CurDAG->getTargetNode(PPC::RLWINM, MVT::i32, IntCR, |
| 854 | getI32Imm((32-(3-Idx)) & 31), |
| 855 | getI32Imm(31),getI32Imm(31)), 0); |
Chris Lattner | 71d3d50 | 2005-11-30 22:53:06 +0000 | [diff] [blame] | 856 | return CurDAG->SelectNodeTo(N, PPC::XORI, MVT::i32, Tmp, getI32Imm(1)); |
Chris Lattner | 222adac | 2005-10-06 19:03:35 +0000 | [diff] [blame] | 857 | } |
Chris Lattner | 222adac | 2005-10-06 19:03:35 +0000 | [diff] [blame] | 858 | } |
Chris Lattner | 2b63e4c | 2005-10-06 18:56:10 +0000 | [diff] [blame] | 859 | |
Nate Begeman | 422b0ce | 2005-11-16 00:48:01 +0000 | [diff] [blame] | 860 | /// isCallCompatibleAddress - Return true if the specified 32-bit value is |
| 861 | /// representable in the immediate field of a Bx instruction. |
| 862 | static bool isCallCompatibleAddress(ConstantSDNode *C) { |
| 863 | int Addr = C->getValue(); |
| 864 | if (Addr & 3) return false; // Low 2 bits are implicitly zero. |
| 865 | return (Addr << 6 >> 6) == Addr; // Top 6 bits have to be sext of immediate. |
| 866 | } |
| 867 | |
Nate Begeman | 1d9d742 | 2005-10-18 00:28:58 +0000 | [diff] [blame] | 868 | SDOperand PPCDAGToDAGISel::SelectCALL(SDOperand Op) { |
Chris Lattner | 6a16f6a | 2005-10-06 19:07:45 +0000 | [diff] [blame] | 869 | SDNode *N = Op.Val; |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 870 | SDOperand Chain; |
| 871 | Select(Chain, N->getOperand(0)); |
Chris Lattner | 6a16f6a | 2005-10-06 19:07:45 +0000 | [diff] [blame] | 872 | |
| 873 | unsigned CallOpcode; |
| 874 | std::vector<SDOperand> CallOperands; |
| 875 | |
| 876 | if (GlobalAddressSDNode *GASD = |
| 877 | dyn_cast<GlobalAddressSDNode>(N->getOperand(1))) { |
Nate Begeman | 422b0ce | 2005-11-16 00:48:01 +0000 | [diff] [blame] | 878 | CallOpcode = PPC::BL; |
Chris Lattner | 2823b3e | 2005-11-17 05:56:14 +0000 | [diff] [blame] | 879 | CallOperands.push_back(N->getOperand(1)); |
Chris Lattner | 6a16f6a | 2005-10-06 19:07:45 +0000 | [diff] [blame] | 880 | } else if (ExternalSymbolSDNode *ESSDN = |
| 881 | dyn_cast<ExternalSymbolSDNode>(N->getOperand(1))) { |
Nate Begeman | 422b0ce | 2005-11-16 00:48:01 +0000 | [diff] [blame] | 882 | CallOpcode = PPC::BL; |
Chris Lattner | 6a16f6a | 2005-10-06 19:07:45 +0000 | [diff] [blame] | 883 | CallOperands.push_back(N->getOperand(1)); |
Nate Begeman | 422b0ce | 2005-11-16 00:48:01 +0000 | [diff] [blame] | 884 | } else if (isa<ConstantSDNode>(N->getOperand(1)) && |
| 885 | isCallCompatibleAddress(cast<ConstantSDNode>(N->getOperand(1)))) { |
| 886 | ConstantSDNode *C = cast<ConstantSDNode>(N->getOperand(1)); |
| 887 | CallOpcode = PPC::BLA; |
| 888 | CallOperands.push_back(getI32Imm((int)C->getValue() >> 2)); |
Chris Lattner | 6a16f6a | 2005-10-06 19:07:45 +0000 | [diff] [blame] | 889 | } else { |
| 890 | // Copy the callee address into the CTR register. |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 891 | SDOperand Callee; |
| 892 | Select(Callee, N->getOperand(1)); |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 893 | Chain = SDOperand(CurDAG->getTargetNode(PPC::MTCTR, MVT::Other, Callee, |
| 894 | Chain), 0); |
Chris Lattner | 6a16f6a | 2005-10-06 19:07:45 +0000 | [diff] [blame] | 895 | |
| 896 | // Copy the callee address into R12 on darwin. |
| 897 | SDOperand R12 = CurDAG->getRegister(PPC::R12, MVT::i32); |
| 898 | Chain = CurDAG->getNode(ISD::CopyToReg, MVT::Other, Chain, R12, Callee); |
Nate Begeman | 422b0ce | 2005-11-16 00:48:01 +0000 | [diff] [blame] | 899 | |
Chris Lattner | 6a16f6a | 2005-10-06 19:07:45 +0000 | [diff] [blame] | 900 | CallOperands.push_back(R12); |
Nate Begeman | 422b0ce | 2005-11-16 00:48:01 +0000 | [diff] [blame] | 901 | CallOpcode = PPC::BCTRL; |
Chris Lattner | 6a16f6a | 2005-10-06 19:07:45 +0000 | [diff] [blame] | 902 | } |
| 903 | |
| 904 | unsigned GPR_idx = 0, FPR_idx = 0; |
| 905 | static const unsigned GPR[] = { |
| 906 | PPC::R3, PPC::R4, PPC::R5, PPC::R6, |
| 907 | PPC::R7, PPC::R8, PPC::R9, PPC::R10, |
| 908 | }; |
| 909 | static const unsigned FPR[] = { |
| 910 | PPC::F1, PPC::F2, PPC::F3, PPC::F4, PPC::F5, PPC::F6, PPC::F7, |
| 911 | PPC::F8, PPC::F9, PPC::F10, PPC::F11, PPC::F12, PPC::F13 |
| 912 | }; |
| 913 | |
| 914 | SDOperand InFlag; // Null incoming flag value. |
| 915 | |
| 916 | for (unsigned i = 2, e = N->getNumOperands(); i != e; ++i) { |
| 917 | unsigned DestReg = 0; |
| 918 | MVT::ValueType RegTy = N->getOperand(i).getValueType(); |
| 919 | if (RegTy == MVT::i32) { |
| 920 | assert(GPR_idx < 8 && "Too many int args"); |
| 921 | DestReg = GPR[GPR_idx++]; |
| 922 | } else { |
| 923 | assert(MVT::isFloatingPoint(N->getOperand(i).getValueType()) && |
| 924 | "Unpromoted integer arg?"); |
| 925 | assert(FPR_idx < 13 && "Too many fp args"); |
| 926 | DestReg = FPR[FPR_idx++]; |
| 927 | } |
| 928 | |
| 929 | if (N->getOperand(i).getOpcode() != ISD::UNDEF) { |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 930 | SDOperand Val; |
| 931 | Select(Val, N->getOperand(i)); |
Chris Lattner | 6a16f6a | 2005-10-06 19:07:45 +0000 | [diff] [blame] | 932 | Chain = CurDAG->getCopyToReg(Chain, DestReg, Val, InFlag); |
| 933 | InFlag = Chain.getValue(1); |
| 934 | CallOperands.push_back(CurDAG->getRegister(DestReg, RegTy)); |
| 935 | } |
| 936 | } |
| 937 | |
| 938 | // Finally, once everything is in registers to pass to the call, emit the |
| 939 | // call itself. |
| 940 | if (InFlag.Val) |
| 941 | CallOperands.push_back(InFlag); // Strong dep on register copies. |
| 942 | else |
| 943 | CallOperands.push_back(Chain); // Weak dep on whatever occurs before |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 944 | Chain = SDOperand(CurDAG->getTargetNode(CallOpcode, MVT::Other, MVT::Flag, |
| 945 | CallOperands), 0); |
Chris Lattner | 6a16f6a | 2005-10-06 19:07:45 +0000 | [diff] [blame] | 946 | |
| 947 | std::vector<SDOperand> CallResults; |
| 948 | |
| 949 | // If the call has results, copy the values out of the ret val registers. |
| 950 | switch (N->getValueType(0)) { |
| 951 | default: assert(0 && "Unexpected ret value!"); |
| 952 | case MVT::Other: break; |
| 953 | case MVT::i32: |
| 954 | if (N->getValueType(1) == MVT::i32) { |
| 955 | Chain = CurDAG->getCopyFromReg(Chain, PPC::R4, MVT::i32, |
| 956 | Chain.getValue(1)).getValue(1); |
| 957 | CallResults.push_back(Chain.getValue(0)); |
| 958 | Chain = CurDAG->getCopyFromReg(Chain, PPC::R3, MVT::i32, |
| 959 | Chain.getValue(2)).getValue(1); |
| 960 | CallResults.push_back(Chain.getValue(0)); |
| 961 | } else { |
| 962 | Chain = CurDAG->getCopyFromReg(Chain, PPC::R3, MVT::i32, |
| 963 | Chain.getValue(1)).getValue(1); |
| 964 | CallResults.push_back(Chain.getValue(0)); |
| 965 | } |
| 966 | break; |
| 967 | case MVT::f32: |
| 968 | case MVT::f64: |
| 969 | Chain = CurDAG->getCopyFromReg(Chain, PPC::F1, N->getValueType(0), |
| 970 | Chain.getValue(1)).getValue(1); |
| 971 | CallResults.push_back(Chain.getValue(0)); |
| 972 | break; |
| 973 | } |
| 974 | |
| 975 | CallResults.push_back(Chain); |
| 976 | for (unsigned i = 0, e = CallResults.size(); i != e; ++i) |
| 977 | CodeGenMap[Op.getValue(i)] = CallResults[i]; |
| 978 | return CallResults[Op.ResNo]; |
| 979 | } |
| 980 | |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 981 | // Select - Convert the specified operand from a target-independent to a |
| 982 | // target-specific node if it hasn't already been changed. |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 983 | void PPCDAGToDAGISel::Select(SDOperand &Result, SDOperand Op) { |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 984 | SDNode *N = Op.Val; |
Chris Lattner | 0bbea95 | 2005-08-26 20:25:03 +0000 | [diff] [blame] | 985 | if (N->getOpcode() >= ISD::BUILTIN_OP_END && |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 986 | N->getOpcode() < PPCISD::FIRST_NUMBER) { |
| 987 | Result = Op; |
| 988 | return; // Already selected. |
| 989 | } |
Chris Lattner | d3d2cf5 | 2005-09-29 00:59:32 +0000 | [diff] [blame] | 990 | |
| 991 | // If this has already been converted, use it. |
| 992 | std::map<SDOperand, SDOperand>::iterator CGMI = CodeGenMap.find(Op); |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 993 | if (CGMI != CodeGenMap.end()) { |
| 994 | Result = CGMI->second; |
| 995 | return; |
| 996 | } |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 997 | |
| 998 | switch (N->getOpcode()) { |
Chris Lattner | 19c0907 | 2005-09-07 23:45:15 +0000 | [diff] [blame] | 999 | default: break; |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1000 | case ISD::SETCC: |
| 1001 | Result = SelectSETCC(Op); |
| 1002 | return; |
| 1003 | case PPCISD::CALL: |
| 1004 | Result = SelectCALL(Op); |
| 1005 | return; |
| 1006 | case PPCISD::GlobalBaseReg: |
| 1007 | Result = getGlobalBaseReg(); |
| 1008 | return; |
Chris Lattner | 860e886 | 2005-11-17 07:30:41 +0000 | [diff] [blame] | 1009 | |
Chris Lattner | e28e40a | 2005-08-25 00:45:43 +0000 | [diff] [blame] | 1010 | case ISD::FrameIndex: { |
| 1011 | int FI = cast<FrameIndexSDNode>(N)->getIndex(); |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1012 | if (N->hasOneUse()) { |
| 1013 | Result = CurDAG->SelectNodeTo(N, PPC::ADDI, MVT::i32, |
| 1014 | CurDAG->getTargetFrameIndex(FI, MVT::i32), |
| 1015 | getI32Imm(0)); |
| 1016 | return; |
| 1017 | } |
| 1018 | Result = CodeGenMap[Op] = |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 1019 | SDOperand(CurDAG->getTargetNode(PPC::ADDI, MVT::i32, |
| 1020 | CurDAG->getTargetFrameIndex(FI, MVT::i32), |
| 1021 | getI32Imm(0)), 0); |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1022 | return; |
Chris Lattner | e28e40a | 2005-08-25 00:45:43 +0000 | [diff] [blame] | 1023 | } |
Chris Lattner | 6d92cad | 2006-03-26 10:06:40 +0000 | [diff] [blame] | 1024 | |
| 1025 | case PPCISD::MFCR: { |
| 1026 | SDOperand InFlag; |
| 1027 | Select(InFlag, N->getOperand(1)); |
| 1028 | // Use MFOCRF if supported. |
| 1029 | if (TLI.getTargetMachine().getSubtarget<PPCSubtarget>().isGigaProcessor()) |
| 1030 | Result = SDOperand(CurDAG->getTargetNode(PPC::MFOCRF, MVT::i32, |
| 1031 | N->getOperand(0), InFlag), 0); |
| 1032 | else |
| 1033 | Result = SDOperand(CurDAG->getTargetNode(PPC::MFCR, MVT::i32, InFlag), 0); |
| 1034 | CodeGenMap[Op] = Result; |
| 1035 | return; |
| 1036 | } |
| 1037 | |
Chris Lattner | 88add10 | 2005-09-28 22:50:24 +0000 | [diff] [blame] | 1038 | case ISD::SDIV: { |
Nate Begeman | 405e3ec | 2005-10-21 00:02:42 +0000 | [diff] [blame] | 1039 | // FIXME: since this depends on the setting of the carry flag from the srawi |
| 1040 | // we should really be making notes about that for the scheduler. |
| 1041 | // FIXME: It sure would be nice if we could cheaply recognize the |
| 1042 | // srl/add/sra pattern the dag combiner will generate for this as |
| 1043 | // sra/addze rather than having to handle sdiv ourselves. oh well. |
Chris Lattner | 8784a23 | 2005-08-25 17:50:06 +0000 | [diff] [blame] | 1044 | unsigned Imm; |
| 1045 | if (isIntImmediate(N->getOperand(1), Imm)) { |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1046 | SDOperand N0; |
| 1047 | Select(N0, N->getOperand(0)); |
Chris Lattner | 8784a23 | 2005-08-25 17:50:06 +0000 | [diff] [blame] | 1048 | if ((signed)Imm > 0 && isPowerOf2_32(Imm)) { |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 1049 | SDNode *Op = |
Chris Lattner | 8784a23 | 2005-08-25 17:50:06 +0000 | [diff] [blame] | 1050 | CurDAG->getTargetNode(PPC::SRAWI, MVT::i32, MVT::Flag, |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1051 | N0, getI32Imm(Log2_32(Imm))); |
| 1052 | Result = CurDAG->SelectNodeTo(N, PPC::ADDZE, MVT::i32, |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 1053 | SDOperand(Op, 0), SDOperand(Op, 1)); |
Chris Lattner | 8784a23 | 2005-08-25 17:50:06 +0000 | [diff] [blame] | 1054 | } else if ((signed)Imm < 0 && isPowerOf2_32(-Imm)) { |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 1055 | SDNode *Op = |
Chris Lattner | 2501d5e | 2005-08-30 17:13:58 +0000 | [diff] [blame] | 1056 | CurDAG->getTargetNode(PPC::SRAWI, MVT::i32, MVT::Flag, |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1057 | N0, getI32Imm(Log2_32(-Imm))); |
Chris Lattner | 8784a23 | 2005-08-25 17:50:06 +0000 | [diff] [blame] | 1058 | SDOperand PT = |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 1059 | SDOperand(CurDAG->getTargetNode(PPC::ADDZE, MVT::i32, |
| 1060 | SDOperand(Op, 0), SDOperand(Op, 1)), |
| 1061 | 0); |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1062 | Result = CurDAG->SelectNodeTo(N, PPC::NEG, MVT::i32, PT); |
Chris Lattner | 8784a23 | 2005-08-25 17:50:06 +0000 | [diff] [blame] | 1063 | } |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1064 | return; |
Chris Lattner | 8784a23 | 2005-08-25 17:50:06 +0000 | [diff] [blame] | 1065 | } |
Chris Lattner | 047b952 | 2005-08-25 22:04:30 +0000 | [diff] [blame] | 1066 | |
Chris Lattner | 237733e | 2005-09-29 23:33:31 +0000 | [diff] [blame] | 1067 | // Other cases are autogenerated. |
| 1068 | break; |
Chris Lattner | 047b952 | 2005-08-25 22:04:30 +0000 | [diff] [blame] | 1069 | } |
Nate Begeman | cffc32b | 2005-08-18 07:30:46 +0000 | [diff] [blame] | 1070 | case ISD::AND: { |
Nate Begeman | 50fb3c4 | 2005-12-24 01:00:15 +0000 | [diff] [blame] | 1071 | unsigned Imm, Imm2; |
Nate Begeman | cffc32b | 2005-08-18 07:30:46 +0000 | [diff] [blame] | 1072 | // If this is an and of a value rotated between 0 and 31 bits and then and'd |
| 1073 | // with a mask, emit rlwinm |
| 1074 | if (isIntImmediate(N->getOperand(1), Imm) && (isShiftedMask_32(Imm) || |
| 1075 | isShiftedMask_32(~Imm))) { |
| 1076 | SDOperand Val; |
Nate Begeman | a694047 | 2005-08-18 18:01:39 +0000 | [diff] [blame] | 1077 | unsigned SH, MB, ME; |
Nate Begeman | cffc32b | 2005-08-18 07:30:46 +0000 | [diff] [blame] | 1078 | if (isRotateAndMask(N->getOperand(0).Val, Imm, false, SH, MB, ME)) { |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1079 | Select(Val, N->getOperand(0).getOperand(0)); |
Chris Lattner | 3393e80 | 2005-10-25 19:32:37 +0000 | [diff] [blame] | 1080 | } else if (Imm == 0) { |
| 1081 | // AND X, 0 -> 0, not "rlwinm 32". |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1082 | Select(Result, N->getOperand(1)); |
| 1083 | return ; |
Chris Lattner | 3393e80 | 2005-10-25 19:32:37 +0000 | [diff] [blame] | 1084 | } else { |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1085 | Select(Val, N->getOperand(0)); |
Nate Begeman | cffc32b | 2005-08-18 07:30:46 +0000 | [diff] [blame] | 1086 | isRunOfOnes(Imm, MB, ME); |
| 1087 | SH = 0; |
| 1088 | } |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1089 | Result = CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, Val, |
| 1090 | getI32Imm(SH), getI32Imm(MB), |
| 1091 | getI32Imm(ME)); |
| 1092 | return; |
Nate Begeman | cffc32b | 2005-08-18 07:30:46 +0000 | [diff] [blame] | 1093 | } |
Nate Begeman | 50fb3c4 | 2005-12-24 01:00:15 +0000 | [diff] [blame] | 1094 | // ISD::OR doesn't get all the bitfield insertion fun. |
| 1095 | // (and (or x, c1), c2) where isRunOfOnes(~(c1^c2)) is a bitfield insert |
| 1096 | if (isIntImmediate(N->getOperand(1), Imm) && |
| 1097 | N->getOperand(0).getOpcode() == ISD::OR && |
| 1098 | isIntImmediate(N->getOperand(0).getOperand(1), Imm2)) { |
Chris Lattner | c9a5ef5 | 2006-01-05 18:32:49 +0000 | [diff] [blame] | 1099 | unsigned MB, ME; |
Nate Begeman | 50fb3c4 | 2005-12-24 01:00:15 +0000 | [diff] [blame] | 1100 | Imm = ~(Imm^Imm2); |
| 1101 | if (isRunOfOnes(Imm, MB, ME)) { |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1102 | SDOperand Tmp1, Tmp2; |
| 1103 | Select(Tmp1, N->getOperand(0).getOperand(0)); |
| 1104 | Select(Tmp2, N->getOperand(0).getOperand(1)); |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 1105 | Result = SDOperand(CurDAG->getTargetNode(PPC::RLWIMI, MVT::i32, |
| 1106 | Tmp1, Tmp2, |
| 1107 | getI32Imm(0), getI32Imm(MB), |
| 1108 | getI32Imm(ME)), 0); |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1109 | return; |
Nate Begeman | 50fb3c4 | 2005-12-24 01:00:15 +0000 | [diff] [blame] | 1110 | } |
| 1111 | } |
Chris Lattner | 237733e | 2005-09-29 23:33:31 +0000 | [diff] [blame] | 1112 | |
| 1113 | // Other cases are autogenerated. |
| 1114 | break; |
Nate Begeman | cffc32b | 2005-08-18 07:30:46 +0000 | [diff] [blame] | 1115 | } |
Nate Begeman | 02b88a4 | 2005-08-19 00:38:14 +0000 | [diff] [blame] | 1116 | case ISD::OR: |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1117 | if (SDNode *I = SelectBitfieldInsert(N)) { |
| 1118 | Result = CodeGenMap[Op] = SDOperand(I, 0); |
| 1119 | return; |
| 1120 | } |
Chris Lattner | d3d2cf5 | 2005-09-29 00:59:32 +0000 | [diff] [blame] | 1121 | |
Chris Lattner | 237733e | 2005-09-29 23:33:31 +0000 | [diff] [blame] | 1122 | // Other cases are autogenerated. |
| 1123 | break; |
Nate Begeman | c15ed44 | 2005-08-18 23:38:00 +0000 | [diff] [blame] | 1124 | case ISD::SHL: { |
| 1125 | unsigned Imm, SH, MB, ME; |
| 1126 | if (isOpcWithIntImmediate(N->getOperand(0).Val, ISD::AND, Imm) && |
Nate Begeman | 2d5aff7 | 2005-10-19 18:42:01 +0000 | [diff] [blame] | 1127 | isRotateAndMask(N, Imm, true, SH, MB, ME)) { |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1128 | SDOperand Val; |
| 1129 | Select(Val, N->getOperand(0).getOperand(0)); |
| 1130 | Result = CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, |
| 1131 | Val, getI32Imm(SH), getI32Imm(MB), |
| 1132 | getI32Imm(ME)); |
| 1133 | return; |
Nate Begeman | 8d94832 | 2005-10-19 01:12:32 +0000 | [diff] [blame] | 1134 | } |
Nate Begeman | 2d5aff7 | 2005-10-19 18:42:01 +0000 | [diff] [blame] | 1135 | |
| 1136 | // Other cases are autogenerated. |
| 1137 | break; |
Nate Begeman | c15ed44 | 2005-08-18 23:38:00 +0000 | [diff] [blame] | 1138 | } |
| 1139 | case ISD::SRL: { |
| 1140 | unsigned Imm, SH, MB, ME; |
| 1141 | if (isOpcWithIntImmediate(N->getOperand(0).Val, ISD::AND, Imm) && |
Nate Begeman | 2d5aff7 | 2005-10-19 18:42:01 +0000 | [diff] [blame] | 1142 | isRotateAndMask(N, Imm, true, SH, MB, ME)) { |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1143 | SDOperand Val; |
| 1144 | Select(Val, N->getOperand(0).getOperand(0)); |
| 1145 | Result = CurDAG->SelectNodeTo(N, PPC::RLWINM, MVT::i32, |
| 1146 | Val, getI32Imm(SH & 0x1F), getI32Imm(MB), |
| 1147 | getI32Imm(ME)); |
| 1148 | return; |
Nate Begeman | 8d94832 | 2005-10-19 01:12:32 +0000 | [diff] [blame] | 1149 | } |
Nate Begeman | 2d5aff7 | 2005-10-19 18:42:01 +0000 | [diff] [blame] | 1150 | |
| 1151 | // Other cases are autogenerated. |
| 1152 | break; |
Nate Begeman | c15ed44 | 2005-08-18 23:38:00 +0000 | [diff] [blame] | 1153 | } |
Chris Lattner | 13794f5 | 2005-08-26 18:46:49 +0000 | [diff] [blame] | 1154 | case ISD::SELECT_CC: { |
| 1155 | ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(4))->get(); |
| 1156 | |
| 1157 | // handle the setcc cases here. select_cc lhs, 0, 1, 0, cc |
| 1158 | if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N->getOperand(1))) |
| 1159 | if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N->getOperand(2))) |
| 1160 | if (ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N->getOperand(3))) |
| 1161 | if (N1C->isNullValue() && N3C->isNullValue() && |
| 1162 | N2C->getValue() == 1ULL && CC == ISD::SETNE) { |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1163 | SDOperand LHS; |
| 1164 | Select(LHS, N->getOperand(0)); |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 1165 | SDNode *Tmp = |
Chris Lattner | 13794f5 | 2005-08-26 18:46:49 +0000 | [diff] [blame] | 1166 | CurDAG->getTargetNode(PPC::ADDIC, MVT::i32, MVT::Flag, |
| 1167 | LHS, getI32Imm(~0U)); |
Evan Cheng | 7e9b26f | 2006-02-09 07:17:49 +0000 | [diff] [blame] | 1168 | Result = CurDAG->SelectNodeTo(N, PPC::SUBFE, MVT::i32, |
| 1169 | SDOperand(Tmp, 0), LHS, |
| 1170 | SDOperand(Tmp, 1)); |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1171 | return; |
Chris Lattner | 13794f5 | 2005-08-26 18:46:49 +0000 | [diff] [blame] | 1172 | } |
Chris Lattner | 8a2d3ca | 2005-08-26 21:23:58 +0000 | [diff] [blame] | 1173 | |
Chris Lattner | 50ff55c | 2005-09-01 19:20:44 +0000 | [diff] [blame] | 1174 | SDOperand CCReg = SelectCC(N->getOperand(0), N->getOperand(1), CC); |
Chris Lattner | 8a2d3ca | 2005-08-26 21:23:58 +0000 | [diff] [blame] | 1175 | unsigned BROpc = getBCCForSetCC(CC); |
| 1176 | |
| 1177 | bool isFP = MVT::isFloatingPoint(N->getValueType(0)); |
Chris Lattner | 919c032 | 2005-10-01 01:35:02 +0000 | [diff] [blame] | 1178 | unsigned SelectCCOp; |
| 1179 | if (MVT::isInteger(N->getValueType(0))) |
| 1180 | SelectCCOp = PPC::SELECT_CC_Int; |
| 1181 | else if (N->getValueType(0) == MVT::f32) |
| 1182 | SelectCCOp = PPC::SELECT_CC_F4; |
Chris Lattner | 710ff32 | 2006-04-08 22:45:08 +0000 | [diff] [blame] | 1183 | else if (N->getValueType(0) == MVT::f64) |
Chris Lattner | 919c032 | 2005-10-01 01:35:02 +0000 | [diff] [blame] | 1184 | SelectCCOp = PPC::SELECT_CC_F8; |
Chris Lattner | 710ff32 | 2006-04-08 22:45:08 +0000 | [diff] [blame] | 1185 | else |
| 1186 | SelectCCOp = PPC::SELECT_CC_VRRC; |
| 1187 | |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1188 | SDOperand N2, N3; |
| 1189 | Select(N2, N->getOperand(2)); |
| 1190 | Select(N3, N->getOperand(3)); |
| 1191 | Result = CurDAG->SelectNodeTo(N, SelectCCOp, N->getValueType(0), CCReg, |
| 1192 | N2, N3, getI32Imm(BROpc)); |
| 1193 | return; |
Chris Lattner | 13794f5 | 2005-08-26 18:46:49 +0000 | [diff] [blame] | 1194 | } |
Nate Begeman | 81e8097 | 2006-03-17 01:40:33 +0000 | [diff] [blame] | 1195 | case ISD::BR_CC: { |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1196 | SDOperand Chain; |
| 1197 | Select(Chain, N->getOperand(0)); |
Chris Lattner | 2fbb457 | 2005-08-21 18:50:37 +0000 | [diff] [blame] | 1198 | ISD::CondCode CC = cast<CondCodeSDNode>(N->getOperand(1))->get(); |
| 1199 | SDOperand CondCode = SelectCC(N->getOperand(2), N->getOperand(3), CC); |
Nate Begeman | 81e8097 | 2006-03-17 01:40:33 +0000 | [diff] [blame] | 1200 | Result = CurDAG->SelectNodeTo(N, PPC::COND_BRANCH, MVT::Other, |
| 1201 | CondCode, getI32Imm(getBCCForSetCC(CC)), |
| 1202 | N->getOperand(4), Chain); |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1203 | return; |
Chris Lattner | 2fbb457 | 2005-08-21 18:50:37 +0000 | [diff] [blame] | 1204 | } |
Nate Begeman | 37efe67 | 2006-04-22 18:53:45 +0000 | [diff] [blame] | 1205 | case ISD::BRIND: { |
| 1206 | SDOperand Chain, Target; |
| 1207 | Select(Chain, N->getOperand(0)); |
| 1208 | Select(Target,N->getOperand(1)); |
| 1209 | Chain = SDOperand(CurDAG->getTargetNode(PPC::MTCTR, MVT::Other, Target, |
| 1210 | Chain), 0); |
| 1211 | Result = CurDAG->SelectNodeTo(N, PPC::BCTR, MVT::Other, Chain); |
| 1212 | return; |
| 1213 | } |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 1214 | } |
Chris Lattner | 25dae72 | 2005-09-03 00:53:47 +0000 | [diff] [blame] | 1215 | |
Evan Cheng | 3416721 | 2006-02-09 00:37:58 +0000 | [diff] [blame] | 1216 | SelectCode(Result, Op); |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 1217 | } |
| 1218 | |
| 1219 | |
Nate Begeman | 1d9d742 | 2005-10-18 00:28:58 +0000 | [diff] [blame] | 1220 | /// createPPCISelDag - This pass converts a legalized DAG into a |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 1221 | /// PowerPC-specific DAG, ready for instruction scheduling. |
| 1222 | /// |
Evan Cheng | c4c6257 | 2006-03-13 23:20:37 +0000 | [diff] [blame] | 1223 | FunctionPass *llvm::createPPCISelDag(PPCTargetMachine &TM) { |
Nate Begeman | 1d9d742 | 2005-10-18 00:28:58 +0000 | [diff] [blame] | 1224 | return new PPCDAGToDAGISel(TM); |
Chris Lattner | a5a91b1 | 2005-08-17 19:33:03 +0000 | [diff] [blame] | 1225 | } |
| 1226 | |