Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1 | //===-- LegalizeDAG.cpp - Implement SelectionDAG::Legalize ----------------===// |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 2 | // |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 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. |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 7 | // |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This file implements the SelectionDAG::Legalize method. |
| 11 | // |
| 12 | //===----------------------------------------------------------------------===// |
| 13 | |
| 14 | #include "llvm/CodeGen/SelectionDAG.h" |
| 15 | #include "llvm/CodeGen/MachineConstantPool.h" |
| 16 | #include "llvm/CodeGen/MachineFunction.h" |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 17 | #include "llvm/CodeGen/MachineFrameInfo.h" |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 18 | #include "llvm/Target/TargetLowering.h" |
Chris Lattner | e1bd822 | 2005-01-11 05:57:22 +0000 | [diff] [blame] | 19 | #include "llvm/Target/TargetData.h" |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 20 | #include "llvm/Target/TargetOptions.h" |
Chris Lattner | adf6a96 | 2005-05-13 18:50:42 +0000 | [diff] [blame^] | 21 | #include "llvm/CallingConv.h" |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 22 | #include "llvm/Constants.h" |
| 23 | #include <iostream> |
| 24 | using namespace llvm; |
| 25 | |
| 26 | //===----------------------------------------------------------------------===// |
| 27 | /// SelectionDAGLegalize - This takes an arbitrary SelectionDAG as input and |
| 28 | /// hacks on it until the target machine can handle it. This involves |
| 29 | /// eliminating value sizes the machine cannot handle (promoting small sizes to |
| 30 | /// large sizes or splitting up large values into small values) as well as |
| 31 | /// eliminating operations the machine cannot handle. |
| 32 | /// |
| 33 | /// This code also does a small amount of optimization and recognition of idioms |
| 34 | /// as part of its processing. For example, if a target does not support a |
| 35 | /// 'setcc' instruction efficiently, but does support 'brcc' instruction, this |
| 36 | /// will attempt merge setcc and brc instructions into brcc's. |
| 37 | /// |
| 38 | namespace { |
| 39 | class SelectionDAGLegalize { |
| 40 | TargetLowering &TLI; |
| 41 | SelectionDAG &DAG; |
| 42 | |
| 43 | /// LegalizeAction - This enum indicates what action we should take for each |
| 44 | /// value type the can occur in the program. |
| 45 | enum LegalizeAction { |
| 46 | Legal, // The target natively supports this value type. |
| 47 | Promote, // This should be promoted to the next larger type. |
| 48 | Expand, // This integer type should be broken into smaller pieces. |
| 49 | }; |
| 50 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 51 | /// ValueTypeActions - This is a bitvector that contains two bits for each |
| 52 | /// value type, where the two bits correspond to the LegalizeAction enum. |
| 53 | /// This can be queried with "getTypeAction(VT)". |
| 54 | unsigned ValueTypeActions; |
| 55 | |
| 56 | /// NeedsAnotherIteration - This is set when we expand a large integer |
| 57 | /// operation into smaller integer operations, but the smaller operations are |
| 58 | /// not set. This occurs only rarely in practice, for targets that don't have |
| 59 | /// 32-bit or larger integer registers. |
| 60 | bool NeedsAnotherIteration; |
| 61 | |
| 62 | /// LegalizedNodes - For nodes that are of legal width, and that have more |
| 63 | /// than one use, this map indicates what regularized operand to use. This |
| 64 | /// allows us to avoid legalizing the same thing more than once. |
| 65 | std::map<SDOperand, SDOperand> LegalizedNodes; |
| 66 | |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 67 | /// PromotedNodes - For nodes that are below legal width, and that have more |
| 68 | /// than one use, this map indicates what promoted value to use. This allows |
| 69 | /// us to avoid promoting the same thing more than once. |
| 70 | std::map<SDOperand, SDOperand> PromotedNodes; |
| 71 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 72 | /// ExpandedNodes - For nodes that need to be expanded, and which have more |
| 73 | /// than one use, this map indicates which which operands are the expanded |
| 74 | /// version of the input. This allows us to avoid expanding the same node |
| 75 | /// more than once. |
| 76 | std::map<SDOperand, std::pair<SDOperand, SDOperand> > ExpandedNodes; |
| 77 | |
Chris Lattner | 8afc48e | 2005-01-07 22:28:47 +0000 | [diff] [blame] | 78 | void AddLegalizedOperand(SDOperand From, SDOperand To) { |
| 79 | bool isNew = LegalizedNodes.insert(std::make_pair(From, To)).second; |
| 80 | assert(isNew && "Got into the map somehow?"); |
| 81 | } |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 82 | void AddPromotedOperand(SDOperand From, SDOperand To) { |
| 83 | bool isNew = PromotedNodes.insert(std::make_pair(From, To)).second; |
| 84 | assert(isNew && "Got into the map somehow?"); |
| 85 | } |
Chris Lattner | 8afc48e | 2005-01-07 22:28:47 +0000 | [diff] [blame] | 86 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 87 | public: |
| 88 | |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 89 | SelectionDAGLegalize(SelectionDAG &DAG); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 90 | |
| 91 | /// Run - While there is still lowering to do, perform a pass over the DAG. |
| 92 | /// Most regularization can be done in a single pass, but targets that require |
| 93 | /// large values to be split into registers multiple times (e.g. i64 -> 4x |
| 94 | /// i16) require iteration for these values (the first iteration will demote |
| 95 | /// to i32, the second will demote to i16). |
| 96 | void Run() { |
| 97 | do { |
| 98 | NeedsAnotherIteration = false; |
| 99 | LegalizeDAG(); |
| 100 | } while (NeedsAnotherIteration); |
| 101 | } |
| 102 | |
| 103 | /// getTypeAction - Return how we should legalize values of this type, either |
| 104 | /// it is already legal or we need to expand it into multiple registers of |
| 105 | /// smaller integer type, or we need to promote it to a larger type. |
| 106 | LegalizeAction getTypeAction(MVT::ValueType VT) const { |
| 107 | return (LegalizeAction)((ValueTypeActions >> (2*VT)) & 3); |
| 108 | } |
| 109 | |
| 110 | /// isTypeLegal - Return true if this type is legal on this target. |
| 111 | /// |
| 112 | bool isTypeLegal(MVT::ValueType VT) const { |
| 113 | return getTypeAction(VT) == Legal; |
| 114 | } |
| 115 | |
| 116 | private: |
| 117 | void LegalizeDAG(); |
| 118 | |
| 119 | SDOperand LegalizeOp(SDOperand O); |
| 120 | void ExpandOp(SDOperand O, SDOperand &Lo, SDOperand &Hi); |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 121 | SDOperand PromoteOp(SDOperand O); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 122 | |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 123 | SDOperand ExpandLibCall(const char *Name, SDNode *Node, |
| 124 | SDOperand &Hi); |
| 125 | SDOperand ExpandIntToFP(bool isSigned, MVT::ValueType DestTy, |
| 126 | SDOperand Source); |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 127 | bool ExpandShift(unsigned Opc, SDOperand Op, SDOperand Amt, |
| 128 | SDOperand &Lo, SDOperand &Hi); |
Chris Lattner | 5b359c6 | 2005-04-02 04:00:59 +0000 | [diff] [blame] | 129 | void ExpandShiftParts(unsigned NodeOp, SDOperand Op, SDOperand Amt, |
| 130 | SDOperand &Lo, SDOperand &Hi); |
| 131 | void ExpandByParts(unsigned NodeOp, SDOperand LHS, SDOperand RHS, |
Chris Lattner | 4759982 | 2005-04-02 03:38:53 +0000 | [diff] [blame] | 132 | SDOperand &Lo, SDOperand &Hi); |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 133 | |
Chris Lattner | b9fa3bc | 2005-05-12 04:49:08 +0000 | [diff] [blame] | 134 | void SpliceCallInto(const SDOperand &CallResult, SDNode *OutChain); |
| 135 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 136 | SDOperand getIntPtrConstant(uint64_t Val) { |
| 137 | return DAG.getConstant(Val, TLI.getPointerTy()); |
| 138 | } |
| 139 | }; |
| 140 | } |
| 141 | |
| 142 | |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 143 | SelectionDAGLegalize::SelectionDAGLegalize(SelectionDAG &dag) |
| 144 | : TLI(dag.getTargetLoweringInfo()), DAG(dag), |
| 145 | ValueTypeActions(TLI.getValueTypeActions()) { |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 146 | assert(MVT::LAST_VALUETYPE <= 16 && |
| 147 | "Too many value types for ValueTypeActions to hold!"); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 148 | } |
| 149 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 150 | void SelectionDAGLegalize::LegalizeDAG() { |
| 151 | SDOperand OldRoot = DAG.getRoot(); |
| 152 | SDOperand NewRoot = LegalizeOp(OldRoot); |
| 153 | DAG.setRoot(NewRoot); |
| 154 | |
| 155 | ExpandedNodes.clear(); |
| 156 | LegalizedNodes.clear(); |
Chris Lattner | 71c42a0 | 2005-01-16 01:11:45 +0000 | [diff] [blame] | 157 | PromotedNodes.clear(); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 158 | |
| 159 | // Remove dead nodes now. |
Chris Lattner | 62fd269 | 2005-01-07 21:09:37 +0000 | [diff] [blame] | 160 | DAG.RemoveDeadNodes(OldRoot.Val); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 161 | } |
| 162 | |
| 163 | SDOperand SelectionDAGLegalize::LegalizeOp(SDOperand Op) { |
Chris Lattner | e3304a3 | 2005-01-08 20:35:13 +0000 | [diff] [blame] | 164 | assert(getTypeAction(Op.getValueType()) == Legal && |
| 165 | "Caller should expand or promote operands that are not legal!"); |
Chris Lattner | 45982da | 2005-05-12 16:53:42 +0000 | [diff] [blame] | 166 | SDNode *Node = Op.Val; |
Chris Lattner | e3304a3 | 2005-01-08 20:35:13 +0000 | [diff] [blame] | 167 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 168 | // If this operation defines any values that cannot be represented in a |
Chris Lattner | e3304a3 | 2005-01-08 20:35:13 +0000 | [diff] [blame] | 169 | // register on this target, make sure to expand or promote them. |
Chris Lattner | 45982da | 2005-05-12 16:53:42 +0000 | [diff] [blame] | 170 | if (Node->getNumValues() > 1) { |
| 171 | for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) |
| 172 | switch (getTypeAction(Node->getValueType(i))) { |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 173 | case Legal: break; // Nothing to do. |
| 174 | case Expand: { |
| 175 | SDOperand T1, T2; |
| 176 | ExpandOp(Op.getValue(i), T1, T2); |
| 177 | assert(LegalizedNodes.count(Op) && |
| 178 | "Expansion didn't add legal operands!"); |
| 179 | return LegalizedNodes[Op]; |
| 180 | } |
| 181 | case Promote: |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 182 | PromoteOp(Op.getValue(i)); |
| 183 | assert(LegalizedNodes.count(Op) && |
| 184 | "Expansion didn't add legal operands!"); |
| 185 | return LegalizedNodes[Op]; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 186 | } |
| 187 | } |
| 188 | |
Chris Lattner | 45982da | 2005-05-12 16:53:42 +0000 | [diff] [blame] | 189 | // Note that LegalizeOp may be reentered even from single-use nodes, which |
| 190 | // means that we always must cache transformed nodes. |
Chris Lattner | e1bd822 | 2005-01-11 05:57:22 +0000 | [diff] [blame] | 191 | std::map<SDOperand, SDOperand>::iterator I = LegalizedNodes.find(Op); |
| 192 | if (I != LegalizedNodes.end()) return I->second; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 193 | |
Chris Lattner | fa404e8 | 2005-01-09 19:03:49 +0000 | [diff] [blame] | 194 | SDOperand Tmp1, Tmp2, Tmp3; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 195 | |
| 196 | SDOperand Result = Op; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 197 | |
| 198 | switch (Node->getOpcode()) { |
| 199 | default: |
| 200 | std::cerr << "NODE: "; Node->dump(); std::cerr << "\n"; |
| 201 | assert(0 && "Do not know how to legalize this operator!"); |
| 202 | abort(); |
| 203 | case ISD::EntryToken: |
| 204 | case ISD::FrameIndex: |
| 205 | case ISD::GlobalAddress: |
Chris Lattner | 03c0cf8 | 2005-01-07 21:45:56 +0000 | [diff] [blame] | 206 | case ISD::ExternalSymbol: |
Chris Lattner | 69a5215 | 2005-01-14 22:38:01 +0000 | [diff] [blame] | 207 | case ISD::ConstantPool: // Nothing to do. |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 208 | assert(getTypeAction(Node->getValueType(0)) == Legal && |
| 209 | "This must be legal!"); |
| 210 | break; |
Chris Lattner | 69a5215 | 2005-01-14 22:38:01 +0000 | [diff] [blame] | 211 | case ISD::CopyFromReg: |
| 212 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
| 213 | if (Tmp1 != Node->getOperand(0)) |
| 214 | Result = DAG.getCopyFromReg(cast<RegSDNode>(Node)->getReg(), |
| 215 | Node->getValueType(0), Tmp1); |
Chris Lattner | 13c184d | 2005-01-28 06:27:38 +0000 | [diff] [blame] | 216 | else |
| 217 | Result = Op.getValue(0); |
| 218 | |
| 219 | // Since CopyFromReg produces two values, make sure to remember that we |
| 220 | // legalized both of them. |
| 221 | AddLegalizedOperand(Op.getValue(0), Result); |
| 222 | AddLegalizedOperand(Op.getValue(1), Result.getValue(1)); |
| 223 | return Result.getValue(Op.ResNo); |
Chris Lattner | 18c2f13 | 2005-01-13 20:50:02 +0000 | [diff] [blame] | 224 | case ISD::ImplicitDef: |
| 225 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
| 226 | if (Tmp1 != Node->getOperand(0)) |
Chris Lattner | 2ee743f | 2005-01-14 22:08:15 +0000 | [diff] [blame] | 227 | Result = DAG.getImplicitDef(Tmp1, cast<RegSDNode>(Node)->getReg()); |
Chris Lattner | 18c2f13 | 2005-01-13 20:50:02 +0000 | [diff] [blame] | 228 | break; |
Nate Begeman | fc1b1da | 2005-04-01 22:34:39 +0000 | [diff] [blame] | 229 | case ISD::UNDEF: { |
| 230 | MVT::ValueType VT = Op.getValueType(); |
| 231 | switch (TLI.getOperationAction(ISD::UNDEF, VT)) { |
Nate Begeman | ea19cd5 | 2005-04-02 00:41:14 +0000 | [diff] [blame] | 232 | default: assert(0 && "This action is not supported yet!"); |
| 233 | case TargetLowering::Expand: |
| 234 | case TargetLowering::Promote: |
Nate Begeman | fc1b1da | 2005-04-01 22:34:39 +0000 | [diff] [blame] | 235 | if (MVT::isInteger(VT)) |
| 236 | Result = DAG.getConstant(0, VT); |
| 237 | else if (MVT::isFloatingPoint(VT)) |
| 238 | Result = DAG.getConstantFP(0, VT); |
| 239 | else |
| 240 | assert(0 && "Unknown value type!"); |
| 241 | break; |
Nate Begeman | ea19cd5 | 2005-04-02 00:41:14 +0000 | [diff] [blame] | 242 | case TargetLowering::Legal: |
Nate Begeman | fc1b1da | 2005-04-01 22:34:39 +0000 | [diff] [blame] | 243 | break; |
| 244 | } |
| 245 | break; |
| 246 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 247 | case ISD::Constant: |
| 248 | // We know we don't need to expand constants here, constants only have one |
| 249 | // value and we check that it is fine above. |
| 250 | |
| 251 | // FIXME: Maybe we should handle things like targets that don't support full |
| 252 | // 32-bit immediates? |
| 253 | break; |
| 254 | case ISD::ConstantFP: { |
| 255 | // Spill FP immediates to the constant pool if the target cannot directly |
| 256 | // codegen them. Targets often have some immediate values that can be |
| 257 | // efficiently generated into an FP register without a load. We explicitly |
| 258 | // leave these constants as ConstantFP nodes for the target to deal with. |
| 259 | |
| 260 | ConstantFPSDNode *CFP = cast<ConstantFPSDNode>(Node); |
| 261 | |
| 262 | // Check to see if this FP immediate is already legal. |
| 263 | bool isLegal = false; |
| 264 | for (TargetLowering::legal_fpimm_iterator I = TLI.legal_fpimm_begin(), |
| 265 | E = TLI.legal_fpimm_end(); I != E; ++I) |
| 266 | if (CFP->isExactlyValue(*I)) { |
| 267 | isLegal = true; |
| 268 | break; |
| 269 | } |
| 270 | |
| 271 | if (!isLegal) { |
| 272 | // Otherwise we need to spill the constant to memory. |
| 273 | MachineConstantPool *CP = DAG.getMachineFunction().getConstantPool(); |
| 274 | |
| 275 | bool Extend = false; |
| 276 | |
| 277 | // If a FP immediate is precise when represented as a float, we put it |
| 278 | // into the constant pool as a float, even if it's is statically typed |
| 279 | // as a double. |
| 280 | MVT::ValueType VT = CFP->getValueType(0); |
| 281 | bool isDouble = VT == MVT::f64; |
| 282 | ConstantFP *LLVMC = ConstantFP::get(isDouble ? Type::DoubleTy : |
| 283 | Type::FloatTy, CFP->getValue()); |
Chris Lattner | 99939d3 | 2005-01-28 22:58:25 +0000 | [diff] [blame] | 284 | if (isDouble && CFP->isExactlyValue((float)CFP->getValue()) && |
| 285 | // Only do this if the target has a native EXTLOAD instruction from |
| 286 | // f32. |
| 287 | TLI.getOperationAction(ISD::EXTLOAD, |
| 288 | MVT::f32) == TargetLowering::Legal) { |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 289 | LLVMC = cast<ConstantFP>(ConstantExpr::getCast(LLVMC, Type::FloatTy)); |
| 290 | VT = MVT::f32; |
| 291 | Extend = true; |
| 292 | } |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 293 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 294 | SDOperand CPIdx = DAG.getConstantPool(CP->getConstantPoolIndex(LLVMC), |
| 295 | TLI.getPointerTy()); |
Chris Lattner | f8161d8 | 2005-01-16 05:06:12 +0000 | [diff] [blame] | 296 | if (Extend) { |
| 297 | Result = DAG.getNode(ISD::EXTLOAD, MVT::f64, DAG.getEntryNode(), CPIdx, |
Andrew Lenharth | 2d86ea2 | 2005-04-27 20:10:01 +0000 | [diff] [blame] | 298 | DAG.getSrcValue(NULL), MVT::f32); |
Chris Lattner | f8161d8 | 2005-01-16 05:06:12 +0000 | [diff] [blame] | 299 | } else { |
Chris Lattner | 52d08bd | 2005-05-09 20:23:03 +0000 | [diff] [blame] | 300 | Result = DAG.getLoad(VT, DAG.getEntryNode(), CPIdx, |
| 301 | DAG.getSrcValue(NULL)); |
Chris Lattner | f8161d8 | 2005-01-16 05:06:12 +0000 | [diff] [blame] | 302 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 303 | } |
| 304 | break; |
| 305 | } |
Chris Lattner | a385e9b | 2005-01-13 17:59:25 +0000 | [diff] [blame] | 306 | case ISD::TokenFactor: { |
| 307 | std::vector<SDOperand> Ops; |
| 308 | bool Changed = false; |
| 309 | for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) { |
Chris Lattner | 1e81b9e | 2005-01-19 19:10:54 +0000 | [diff] [blame] | 310 | SDOperand Op = Node->getOperand(i); |
| 311 | // Fold single-use TokenFactor nodes into this token factor as we go. |
Chris Lattner | e131e5b | 2005-05-12 06:04:14 +0000 | [diff] [blame] | 312 | // FIXME: This is something that the DAGCombiner should do!! |
Chris Lattner | 1e81b9e | 2005-01-19 19:10:54 +0000 | [diff] [blame] | 313 | if (Op.getOpcode() == ISD::TokenFactor && Op.hasOneUse()) { |
| 314 | Changed = true; |
| 315 | for (unsigned j = 0, e = Op.getNumOperands(); j != e; ++j) |
| 316 | Ops.push_back(LegalizeOp(Op.getOperand(j))); |
| 317 | } else { |
| 318 | Ops.push_back(LegalizeOp(Op)); // Legalize the operands |
| 319 | Changed |= Ops[i] != Op; |
| 320 | } |
Chris Lattner | a385e9b | 2005-01-13 17:59:25 +0000 | [diff] [blame] | 321 | } |
| 322 | if (Changed) |
| 323 | Result = DAG.getNode(ISD::TokenFactor, MVT::Other, Ops); |
| 324 | break; |
| 325 | } |
| 326 | |
Chris Lattner | 16cd04d | 2005-05-12 23:24:06 +0000 | [diff] [blame] | 327 | case ISD::CALLSEQ_START: |
| 328 | case ISD::CALLSEQ_END: |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 329 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
Chris Lattner | 128b52d | 2005-05-12 23:24:44 +0000 | [diff] [blame] | 330 | // Do not try to legalize the target-specific arguments (#1+) |
Chris Lattner | 45982da | 2005-05-12 16:53:42 +0000 | [diff] [blame] | 331 | Tmp2 = Node->getOperand(0); |
| 332 | if (Tmp1 != Tmp2) { |
Chris Lattner | 88de6e7 | 2005-05-12 00:17:04 +0000 | [diff] [blame] | 333 | Node->setAdjCallChain(Tmp1); |
Chris Lattner | 45982da | 2005-05-12 16:53:42 +0000 | [diff] [blame] | 334 | |
| 335 | // If moving the operand from pointing to Tmp2 dropped its use count to 1, |
| 336 | // this will cause the maps used to memoize results to get confused. |
| 337 | // Create and add a dummy use, just to increase its use count. This will |
| 338 | // be removed at the end of legalize when dead nodes are removed. |
| 339 | if (Tmp2.Val->hasOneUse()) |
| 340 | DAG.getNode(ISD::PCMARKER, MVT::Other, Tmp2, |
| 341 | DAG.getConstant(0, MVT::i32)); |
| 342 | } |
Chris Lattner | 16cd04d | 2005-05-12 23:24:06 +0000 | [diff] [blame] | 343 | // Note that we do not create new CALLSEQ_DOWN/UP nodes here. These |
Chris Lattner | 88de6e7 | 2005-05-12 00:17:04 +0000 | [diff] [blame] | 344 | // nodes are treated specially and are mutated in place. This makes the dag |
| 345 | // legalization process more efficient and also makes libcall insertion |
| 346 | // easier. |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 347 | break; |
Chris Lattner | fa404e8 | 2005-01-09 19:03:49 +0000 | [diff] [blame] | 348 | case ISD::DYNAMIC_STACKALLOC: |
| 349 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 350 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the size. |
| 351 | Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the alignment. |
| 352 | if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1) || |
| 353 | Tmp3 != Node->getOperand(2)) |
| 354 | Result = DAG.getNode(ISD::DYNAMIC_STACKALLOC, Node->getValueType(0), |
| 355 | Tmp1, Tmp2, Tmp3); |
Chris Lattner | 513e52e | 2005-01-09 19:07:54 +0000 | [diff] [blame] | 356 | else |
| 357 | Result = Op.getValue(0); |
Chris Lattner | fa404e8 | 2005-01-09 19:03:49 +0000 | [diff] [blame] | 358 | |
| 359 | // Since this op produces two values, make sure to remember that we |
| 360 | // legalized both of them. |
| 361 | AddLegalizedOperand(SDOperand(Node, 0), Result); |
| 362 | AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1)); |
| 363 | return Result.getValue(Op.ResNo); |
| 364 | |
Chris Lattner | d71c041 | 2005-05-13 18:43:43 +0000 | [diff] [blame] | 365 | case ISD::TAILCALL: |
Chris Lattner | 3d9dffc | 2005-01-19 20:24:35 +0000 | [diff] [blame] | 366 | case ISD::CALL: { |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 367 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 368 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the callee. |
Chris Lattner | 3d9dffc | 2005-01-19 20:24:35 +0000 | [diff] [blame] | 369 | |
| 370 | bool Changed = false; |
| 371 | std::vector<SDOperand> Ops; |
| 372 | for (unsigned i = 2, e = Node->getNumOperands(); i != e; ++i) { |
| 373 | Ops.push_back(LegalizeOp(Node->getOperand(i))); |
| 374 | Changed |= Ops.back() != Node->getOperand(i); |
| 375 | } |
| 376 | |
| 377 | if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1) || Changed) { |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 378 | std::vector<MVT::ValueType> RetTyVTs; |
| 379 | RetTyVTs.reserve(Node->getNumValues()); |
| 380 | for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) |
Chris Lattner | ebda942 | 2005-01-07 21:34:13 +0000 | [diff] [blame] | 381 | RetTyVTs.push_back(Node->getValueType(i)); |
Chris Lattner | d71c041 | 2005-05-13 18:43:43 +0000 | [diff] [blame] | 382 | Result = SDOperand(DAG.getCall(RetTyVTs, Tmp1, Tmp2, Ops, |
| 383 | Node->getOpcode() == ISD::TAILCALL), 0); |
Chris Lattner | 38d6be5 | 2005-01-09 19:43:23 +0000 | [diff] [blame] | 384 | } else { |
| 385 | Result = Result.getValue(0); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 386 | } |
Chris Lattner | 38d6be5 | 2005-01-09 19:43:23 +0000 | [diff] [blame] | 387 | // Since calls produce multiple values, make sure to remember that we |
| 388 | // legalized all of them. |
| 389 | for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) |
| 390 | AddLegalizedOperand(SDOperand(Node, i), Result.getValue(i)); |
| 391 | return Result.getValue(Op.ResNo); |
Chris Lattner | 3d9dffc | 2005-01-19 20:24:35 +0000 | [diff] [blame] | 392 | } |
Chris Lattner | c7af179 | 2005-01-07 22:12:08 +0000 | [diff] [blame] | 393 | case ISD::BR: |
| 394 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 395 | if (Tmp1 != Node->getOperand(0)) |
| 396 | Result = DAG.getNode(ISD::BR, MVT::Other, Tmp1, Node->getOperand(1)); |
| 397 | break; |
| 398 | |
Chris Lattner | c18ae4c | 2005-01-07 08:19:42 +0000 | [diff] [blame] | 399 | case ISD::BRCOND: |
| 400 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
Chris Lattner | 47e9223 | 2005-01-18 19:27:06 +0000 | [diff] [blame] | 401 | |
| 402 | switch (getTypeAction(Node->getOperand(1).getValueType())) { |
| 403 | case Expand: assert(0 && "It's impossible to expand bools"); |
| 404 | case Legal: |
| 405 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the condition. |
| 406 | break; |
| 407 | case Promote: |
| 408 | Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the condition. |
| 409 | break; |
| 410 | } |
Chris Lattner | c18ae4c | 2005-01-07 08:19:42 +0000 | [diff] [blame] | 411 | // Basic block destination (Op#2) is always legal. |
| 412 | if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1)) |
| 413 | Result = DAG.getNode(ISD::BRCOND, MVT::Other, Tmp1, Tmp2, |
| 414 | Node->getOperand(2)); |
| 415 | break; |
Chris Lattner | 411e888 | 2005-04-09 03:30:19 +0000 | [diff] [blame] | 416 | case ISD::BRCONDTWOWAY: |
| 417 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 418 | switch (getTypeAction(Node->getOperand(1).getValueType())) { |
| 419 | case Expand: assert(0 && "It's impossible to expand bools"); |
| 420 | case Legal: |
| 421 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the condition. |
| 422 | break; |
| 423 | case Promote: |
| 424 | Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the condition. |
| 425 | break; |
| 426 | } |
| 427 | // If this target does not support BRCONDTWOWAY, lower it to a BRCOND/BR |
| 428 | // pair. |
| 429 | switch (TLI.getOperationAction(ISD::BRCONDTWOWAY, MVT::Other)) { |
| 430 | case TargetLowering::Promote: |
| 431 | default: assert(0 && "This action is not supported yet!"); |
| 432 | case TargetLowering::Legal: |
| 433 | if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1)) { |
| 434 | std::vector<SDOperand> Ops; |
| 435 | Ops.push_back(Tmp1); |
| 436 | Ops.push_back(Tmp2); |
| 437 | Ops.push_back(Node->getOperand(2)); |
| 438 | Ops.push_back(Node->getOperand(3)); |
| 439 | Result = DAG.getNode(ISD::BRCONDTWOWAY, MVT::Other, Ops); |
| 440 | } |
| 441 | break; |
| 442 | case TargetLowering::Expand: |
| 443 | Result = DAG.getNode(ISD::BRCOND, MVT::Other, Tmp1, Tmp2, |
| 444 | Node->getOperand(2)); |
| 445 | Result = DAG.getNode(ISD::BR, MVT::Other, Result, Node->getOperand(3)); |
| 446 | break; |
| 447 | } |
| 448 | break; |
Chris Lattner | c18ae4c | 2005-01-07 08:19:42 +0000 | [diff] [blame] | 449 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 450 | case ISD::LOAD: |
| 451 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 452 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer. |
Andrew Lenharth | 2d86ea2 | 2005-04-27 20:10:01 +0000 | [diff] [blame] | 453 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 454 | if (Tmp1 != Node->getOperand(0) || |
| 455 | Tmp2 != Node->getOperand(1)) |
Chris Lattner | 52d08bd | 2005-05-09 20:23:03 +0000 | [diff] [blame] | 456 | Result = DAG.getLoad(Node->getValueType(0), Tmp1, Tmp2, |
| 457 | Node->getOperand(2)); |
Chris Lattner | 8afc48e | 2005-01-07 22:28:47 +0000 | [diff] [blame] | 458 | else |
| 459 | Result = SDOperand(Node, 0); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 460 | |
Chris Lattner | 8afc48e | 2005-01-07 22:28:47 +0000 | [diff] [blame] | 461 | // Since loads produce two values, make sure to remember that we legalized |
| 462 | // both of them. |
| 463 | AddLegalizedOperand(SDOperand(Node, 0), Result); |
| 464 | AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1)); |
| 465 | return Result.getValue(Op.ResNo); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 466 | |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 467 | case ISD::EXTLOAD: |
| 468 | case ISD::SEXTLOAD: |
Chris Lattner | 01ff721 | 2005-04-10 22:54:25 +0000 | [diff] [blame] | 469 | case ISD::ZEXTLOAD: { |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 470 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 471 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer. |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 472 | |
Chris Lattner | 01ff721 | 2005-04-10 22:54:25 +0000 | [diff] [blame] | 473 | MVT::ValueType SrcVT = cast<MVTSDNode>(Node)->getExtraValueType(); |
| 474 | switch (TLI.getOperationAction(Node->getOpcode(), SrcVT)) { |
Chris Lattner | 01ff721 | 2005-04-10 22:54:25 +0000 | [diff] [blame] | 475 | default: assert(0 && "This action is not supported yet!"); |
Chris Lattner | 1c51c6a | 2005-04-12 20:30:10 +0000 | [diff] [blame] | 476 | case TargetLowering::Promote: |
| 477 | assert(SrcVT == MVT::i1 && "Can only promote EXTLOAD from i1 -> i8!"); |
| 478 | Result = DAG.getNode(Node->getOpcode(), Node->getValueType(0), |
Andrew Lenharth | 2d86ea2 | 2005-04-27 20:10:01 +0000 | [diff] [blame] | 479 | Tmp1, Tmp2, Node->getOperand(2), MVT::i8); |
Chris Lattner | 1c51c6a | 2005-04-12 20:30:10 +0000 | [diff] [blame] | 480 | // Since loads produce two values, make sure to remember that we legalized |
| 481 | // both of them. |
| 482 | AddLegalizedOperand(SDOperand(Node, 0), Result); |
| 483 | AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1)); |
| 484 | return Result.getValue(Op.ResNo); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 485 | |
Chris Lattner | 01ff721 | 2005-04-10 22:54:25 +0000 | [diff] [blame] | 486 | case TargetLowering::Legal: |
| 487 | if (Tmp1 != Node->getOperand(0) || |
| 488 | Tmp2 != Node->getOperand(1)) |
| 489 | Result = DAG.getNode(Node->getOpcode(), Node->getValueType(0), |
Andrew Lenharth | 2d86ea2 | 2005-04-27 20:10:01 +0000 | [diff] [blame] | 490 | Tmp1, Tmp2, Node->getOperand(2), SrcVT); |
Chris Lattner | 01ff721 | 2005-04-10 22:54:25 +0000 | [diff] [blame] | 491 | else |
| 492 | Result = SDOperand(Node, 0); |
| 493 | |
| 494 | // Since loads produce two values, make sure to remember that we legalized |
| 495 | // both of them. |
| 496 | AddLegalizedOperand(SDOperand(Node, 0), Result); |
| 497 | AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1)); |
| 498 | return Result.getValue(Op.ResNo); |
Chris Lattner | 01ff721 | 2005-04-10 22:54:25 +0000 | [diff] [blame] | 499 | case TargetLowering::Expand: |
| 500 | assert(Node->getOpcode() != ISD::EXTLOAD && |
| 501 | "EXTLOAD should always be supported!"); |
| 502 | // Turn the unsupported load into an EXTLOAD followed by an explicit |
| 503 | // zero/sign extend inreg. |
| 504 | Result = DAG.getNode(ISD::EXTLOAD, Node->getValueType(0), |
Andrew Lenharth | 2d86ea2 | 2005-04-27 20:10:01 +0000 | [diff] [blame] | 505 | Tmp1, Tmp2, Node->getOperand(2), SrcVT); |
Chris Lattner | 2399356 | 2005-04-13 02:38:47 +0000 | [diff] [blame] | 506 | SDOperand ValRes; |
| 507 | if (Node->getOpcode() == ISD::SEXTLOAD) |
| 508 | ValRes = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(), |
| 509 | Result, SrcVT); |
| 510 | else |
| 511 | ValRes = DAG.getZeroExtendInReg(Result, SrcVT); |
Chris Lattner | 01ff721 | 2005-04-10 22:54:25 +0000 | [diff] [blame] | 512 | AddLegalizedOperand(SDOperand(Node, 0), ValRes); |
| 513 | AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1)); |
| 514 | if (Op.ResNo) |
| 515 | return Result.getValue(1); |
| 516 | return ValRes; |
| 517 | } |
| 518 | assert(0 && "Unreachable"); |
| 519 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 520 | case ISD::EXTRACT_ELEMENT: |
| 521 | // Get both the low and high parts. |
| 522 | ExpandOp(Node->getOperand(0), Tmp1, Tmp2); |
| 523 | if (cast<ConstantSDNode>(Node->getOperand(1))->getValue()) |
| 524 | Result = Tmp2; // 1 -> Hi |
| 525 | else |
| 526 | Result = Tmp1; // 0 -> Lo |
| 527 | break; |
| 528 | |
| 529 | case ISD::CopyToReg: |
| 530 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 531 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 532 | switch (getTypeAction(Node->getOperand(1).getValueType())) { |
| 533 | case Legal: |
| 534 | // Legalize the incoming value (must be legal). |
| 535 | Tmp2 = LegalizeOp(Node->getOperand(1)); |
| 536 | if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1)) |
Chris Lattner | 18c2f13 | 2005-01-13 20:50:02 +0000 | [diff] [blame] | 537 | Result = DAG.getCopyToReg(Tmp1, Tmp2, cast<RegSDNode>(Node)->getReg()); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 538 | break; |
Chris Lattner | ef5cd1d | 2005-01-18 17:54:55 +0000 | [diff] [blame] | 539 | case Promote: |
| 540 | Tmp2 = PromoteOp(Node->getOperand(1)); |
| 541 | Result = DAG.getCopyToReg(Tmp1, Tmp2, cast<RegSDNode>(Node)->getReg()); |
| 542 | break; |
| 543 | case Expand: |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 544 | SDOperand Lo, Hi; |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 545 | ExpandOp(Node->getOperand(1), Lo, Hi); |
Chris Lattner | 18c2f13 | 2005-01-13 20:50:02 +0000 | [diff] [blame] | 546 | unsigned Reg = cast<RegSDNode>(Node)->getReg(); |
Chris Lattner | ec39a45 | 2005-01-19 18:02:17 +0000 | [diff] [blame] | 547 | Lo = DAG.getCopyToReg(Tmp1, Lo, Reg); |
| 548 | Hi = DAG.getCopyToReg(Tmp1, Hi, Reg+1); |
| 549 | // Note that the copytoreg nodes are independent of each other. |
| 550 | Result = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo, Hi); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 551 | assert(isTypeLegal(Result.getValueType()) && |
| 552 | "Cannot expand multiple times yet (i64 -> i16)"); |
| 553 | break; |
| 554 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 555 | break; |
| 556 | |
| 557 | case ISD::RET: |
| 558 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 559 | switch (Node->getNumOperands()) { |
| 560 | case 2: // ret val |
| 561 | switch (getTypeAction(Node->getOperand(1).getValueType())) { |
| 562 | case Legal: |
| 563 | Tmp2 = LegalizeOp(Node->getOperand(1)); |
Chris Lattner | 8afc48e | 2005-01-07 22:28:47 +0000 | [diff] [blame] | 564 | if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1)) |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 565 | Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1, Tmp2); |
| 566 | break; |
| 567 | case Expand: { |
| 568 | SDOperand Lo, Hi; |
| 569 | ExpandOp(Node->getOperand(1), Lo, Hi); |
| 570 | Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1, Lo, Hi); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 571 | break; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 572 | } |
| 573 | case Promote: |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 574 | Tmp2 = PromoteOp(Node->getOperand(1)); |
| 575 | Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1, Tmp2); |
| 576 | break; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 577 | } |
| 578 | break; |
| 579 | case 1: // ret void |
| 580 | if (Tmp1 != Node->getOperand(0)) |
| 581 | Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1); |
| 582 | break; |
| 583 | default: { // ret <values> |
| 584 | std::vector<SDOperand> NewValues; |
| 585 | NewValues.push_back(Tmp1); |
| 586 | for (unsigned i = 1, e = Node->getNumOperands(); i != e; ++i) |
| 587 | switch (getTypeAction(Node->getOperand(i).getValueType())) { |
| 588 | case Legal: |
Chris Lattner | 4e6c746 | 2005-01-08 19:27:05 +0000 | [diff] [blame] | 589 | NewValues.push_back(LegalizeOp(Node->getOperand(i))); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 590 | break; |
| 591 | case Expand: { |
| 592 | SDOperand Lo, Hi; |
| 593 | ExpandOp(Node->getOperand(i), Lo, Hi); |
| 594 | NewValues.push_back(Lo); |
| 595 | NewValues.push_back(Hi); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 596 | break; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 597 | } |
| 598 | case Promote: |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 599 | assert(0 && "Can't promote multiple return value yet!"); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 600 | } |
| 601 | Result = DAG.getNode(ISD::RET, MVT::Other, NewValues); |
| 602 | break; |
| 603 | } |
| 604 | } |
| 605 | break; |
| 606 | case ISD::STORE: |
| 607 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 608 | Tmp2 = LegalizeOp(Node->getOperand(2)); // Legalize the pointer. |
| 609 | |
Chris Lattner | 5d2c6c7 | 2005-01-08 06:25:56 +0000 | [diff] [blame] | 610 | // Turn 'store float 1.0, Ptr' -> 'store int 0x12345678, Ptr' |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 611 | if (ConstantFPSDNode *CFP =dyn_cast<ConstantFPSDNode>(Node->getOperand(1))){ |
Chris Lattner | 5d2c6c7 | 2005-01-08 06:25:56 +0000 | [diff] [blame] | 612 | if (CFP->getValueType(0) == MVT::f32) { |
| 613 | union { |
| 614 | unsigned I; |
| 615 | float F; |
| 616 | } V; |
| 617 | V.F = CFP->getValue(); |
Andrew Lenharth | 2d86ea2 | 2005-04-27 20:10:01 +0000 | [diff] [blame] | 618 | Result = DAG.getNode(ISD::STORE, MVT::Other, Tmp1, |
Chris Lattner | 6d5b8e1 | 2005-05-09 20:36:57 +0000 | [diff] [blame] | 619 | DAG.getConstant(V.I, MVT::i32), Tmp2, |
Chris Lattner | 52d08bd | 2005-05-09 20:23:03 +0000 | [diff] [blame] | 620 | Node->getOperand(3)); |
Chris Lattner | 5d2c6c7 | 2005-01-08 06:25:56 +0000 | [diff] [blame] | 621 | } else { |
| 622 | assert(CFP->getValueType(0) == MVT::f64 && "Unknown FP type!"); |
| 623 | union { |
| 624 | uint64_t I; |
| 625 | double F; |
| 626 | } V; |
| 627 | V.F = CFP->getValue(); |
Andrew Lenharth | 2d86ea2 | 2005-04-27 20:10:01 +0000 | [diff] [blame] | 628 | Result = DAG.getNode(ISD::STORE, MVT::Other, Tmp1, |
Chris Lattner | 52d08bd | 2005-05-09 20:23:03 +0000 | [diff] [blame] | 629 | DAG.getConstant(V.I, MVT::i64), Tmp2, |
| 630 | Node->getOperand(3)); |
Chris Lattner | 5d2c6c7 | 2005-01-08 06:25:56 +0000 | [diff] [blame] | 631 | } |
Chris Lattner | 84734ce | 2005-02-22 07:23:39 +0000 | [diff] [blame] | 632 | Node = Result.Val; |
Chris Lattner | 5d2c6c7 | 2005-01-08 06:25:56 +0000 | [diff] [blame] | 633 | } |
| 634 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 635 | switch (getTypeAction(Node->getOperand(1).getValueType())) { |
| 636 | case Legal: { |
| 637 | SDOperand Val = LegalizeOp(Node->getOperand(1)); |
| 638 | if (Val != Node->getOperand(1) || Tmp1 != Node->getOperand(0) || |
| 639 | Tmp2 != Node->getOperand(2)) |
Chris Lattner | 52d08bd | 2005-05-09 20:23:03 +0000 | [diff] [blame] | 640 | Result = DAG.getNode(ISD::STORE, MVT::Other, Tmp1, Val, Tmp2, |
| 641 | Node->getOperand(3)); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 642 | break; |
| 643 | } |
| 644 | case Promote: |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 645 | // Truncate the value and store the result. |
| 646 | Tmp3 = PromoteOp(Node->getOperand(1)); |
| 647 | Result = DAG.getNode(ISD::TRUNCSTORE, MVT::Other, Tmp1, Tmp3, Tmp2, |
Andrew Lenharth | 2d86ea2 | 2005-04-27 20:10:01 +0000 | [diff] [blame] | 648 | Node->getOperand(3), |
| 649 | Node->getOperand(1).getValueType()); |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 650 | break; |
| 651 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 652 | case Expand: |
| 653 | SDOperand Lo, Hi; |
| 654 | ExpandOp(Node->getOperand(1), Lo, Hi); |
| 655 | |
| 656 | if (!TLI.isLittleEndian()) |
| 657 | std::swap(Lo, Hi); |
| 658 | |
Chris Lattner | edb1add | 2005-05-11 04:51:16 +0000 | [diff] [blame] | 659 | Lo = DAG.getNode(ISD::STORE, MVT::Other, Tmp1, Lo, Tmp2, |
| 660 | Node->getOperand(3)); |
Chris Lattner | ec39a45 | 2005-01-19 18:02:17 +0000 | [diff] [blame] | 661 | unsigned IncrementSize = MVT::getSizeInBits(Hi.getValueType())/8; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 662 | Tmp2 = DAG.getNode(ISD::ADD, Tmp2.getValueType(), Tmp2, |
| 663 | getIntPtrConstant(IncrementSize)); |
| 664 | assert(isTypeLegal(Tmp2.getValueType()) && |
| 665 | "Pointers must be legal!"); |
Andrew Lenharth | 2d86ea2 | 2005-04-27 20:10:01 +0000 | [diff] [blame] | 666 | //Again, claiming both parts of the store came form the same Instr |
Chris Lattner | edb1add | 2005-05-11 04:51:16 +0000 | [diff] [blame] | 667 | Hi = DAG.getNode(ISD::STORE, MVT::Other, Tmp1, Hi, Tmp2, |
| 668 | Node->getOperand(3)); |
Chris Lattner | ec39a45 | 2005-01-19 18:02:17 +0000 | [diff] [blame] | 669 | Result = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo, Hi); |
| 670 | break; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 671 | } |
| 672 | break; |
Andrew Lenharth | 9576212 | 2005-03-31 21:24:06 +0000 | [diff] [blame] | 673 | case ISD::PCMARKER: |
| 674 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 675 | if (Tmp1 != Node->getOperand(0)) |
| 676 | Result = DAG.getNode(ISD::PCMARKER, MVT::Other, Tmp1,Node->getOperand(1)); |
Andrew Lenharth | 9576212 | 2005-03-31 21:24:06 +0000 | [diff] [blame] | 677 | break; |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 678 | case ISD::TRUNCSTORE: |
| 679 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 680 | Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the pointer. |
| 681 | |
| 682 | switch (getTypeAction(Node->getOperand(1).getValueType())) { |
| 683 | case Legal: |
| 684 | Tmp2 = LegalizeOp(Node->getOperand(1)); |
| 685 | if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1) || |
| 686 | Tmp3 != Node->getOperand(2)) |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 687 | Result = DAG.getNode(ISD::TRUNCSTORE, MVT::Other, Tmp1, Tmp2, Tmp3, |
Andrew Lenharth | 2d86ea2 | 2005-04-27 20:10:01 +0000 | [diff] [blame] | 688 | Node->getOperand(3), |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 689 | cast<MVTSDNode>(Node)->getExtraValueType()); |
| 690 | break; |
| 691 | case Promote: |
| 692 | case Expand: |
| 693 | assert(0 && "Cannot handle illegal TRUNCSTORE yet!"); |
| 694 | } |
| 695 | break; |
Chris Lattner | 2ee743f | 2005-01-14 22:08:15 +0000 | [diff] [blame] | 696 | case ISD::SELECT: |
Chris Lattner | 47e9223 | 2005-01-18 19:27:06 +0000 | [diff] [blame] | 697 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 698 | case Expand: assert(0 && "It's impossible to expand bools"); |
| 699 | case Legal: |
| 700 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the condition. |
| 701 | break; |
| 702 | case Promote: |
| 703 | Tmp1 = PromoteOp(Node->getOperand(0)); // Promote the condition. |
| 704 | break; |
| 705 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 706 | Tmp2 = LegalizeOp(Node->getOperand(1)); // TrueVal |
Chris Lattner | 2ee743f | 2005-01-14 22:08:15 +0000 | [diff] [blame] | 707 | Tmp3 = LegalizeOp(Node->getOperand(2)); // FalseVal |
Chris Lattner | 55ba8fb | 2005-01-16 07:29:19 +0000 | [diff] [blame] | 708 | |
| 709 | switch (TLI.getOperationAction(Node->getOpcode(), Tmp2.getValueType())) { |
| 710 | default: assert(0 && "This action is not supported yet!"); |
| 711 | case TargetLowering::Legal: |
| 712 | if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1) || |
| 713 | Tmp3 != Node->getOperand(2)) |
| 714 | Result = DAG.getNode(ISD::SELECT, Node->getValueType(0), |
| 715 | Tmp1, Tmp2, Tmp3); |
| 716 | break; |
| 717 | case TargetLowering::Promote: { |
| 718 | MVT::ValueType NVT = |
| 719 | TLI.getTypeToPromoteTo(ISD::SELECT, Tmp2.getValueType()); |
| 720 | unsigned ExtOp, TruncOp; |
| 721 | if (MVT::isInteger(Tmp2.getValueType())) { |
| 722 | ExtOp = ISD::ZERO_EXTEND; |
| 723 | TruncOp = ISD::TRUNCATE; |
| 724 | } else { |
| 725 | ExtOp = ISD::FP_EXTEND; |
| 726 | TruncOp = ISD::FP_ROUND; |
| 727 | } |
| 728 | // Promote each of the values to the new type. |
| 729 | Tmp2 = DAG.getNode(ExtOp, NVT, Tmp2); |
| 730 | Tmp3 = DAG.getNode(ExtOp, NVT, Tmp3); |
| 731 | // Perform the larger operation, then round down. |
| 732 | Result = DAG.getNode(ISD::SELECT, NVT, Tmp1, Tmp2,Tmp3); |
| 733 | Result = DAG.getNode(TruncOp, Node->getValueType(0), Result); |
| 734 | break; |
| 735 | } |
| 736 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 737 | break; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 738 | case ISD::SETCC: |
| 739 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 740 | case Legal: |
| 741 | Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS |
| 742 | Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS |
| 743 | if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1)) |
| 744 | Result = DAG.getSetCC(cast<SetCCSDNode>(Node)->getCondition(), |
Chris Lattner | f30b73b | 2005-01-18 02:52:03 +0000 | [diff] [blame] | 745 | Node->getValueType(0), Tmp1, Tmp2); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 746 | break; |
| 747 | case Promote: |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 748 | Tmp1 = PromoteOp(Node->getOperand(0)); // LHS |
| 749 | Tmp2 = PromoteOp(Node->getOperand(1)); // RHS |
| 750 | |
| 751 | // If this is an FP compare, the operands have already been extended. |
| 752 | if (MVT::isInteger(Node->getOperand(0).getValueType())) { |
| 753 | MVT::ValueType VT = Node->getOperand(0).getValueType(); |
Chris Lattner | 71c42a0 | 2005-01-16 01:11:45 +0000 | [diff] [blame] | 754 | MVT::ValueType NVT = TLI.getTypeToTransformTo(VT); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 755 | |
| 756 | // Otherwise, we have to insert explicit sign or zero extends. Note |
| 757 | // that we could insert sign extends for ALL conditions, but zero extend |
| 758 | // is cheaper on many machines (an AND instead of two shifts), so prefer |
| 759 | // it. |
| 760 | switch (cast<SetCCSDNode>(Node)->getCondition()) { |
| 761 | default: assert(0 && "Unknown integer comparison!"); |
| 762 | case ISD::SETEQ: |
| 763 | case ISD::SETNE: |
| 764 | case ISD::SETUGE: |
| 765 | case ISD::SETUGT: |
| 766 | case ISD::SETULE: |
| 767 | case ISD::SETULT: |
| 768 | // ALL of these operations will work if we either sign or zero extend |
| 769 | // the operands (including the unsigned comparisons!). Zero extend is |
| 770 | // usually a simpler/cheaper operation, so prefer it. |
Chris Lattner | 2399356 | 2005-04-13 02:38:47 +0000 | [diff] [blame] | 771 | Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT); |
| 772 | Tmp2 = DAG.getZeroExtendInReg(Tmp2, VT); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 773 | break; |
| 774 | case ISD::SETGE: |
| 775 | case ISD::SETGT: |
| 776 | case ISD::SETLT: |
| 777 | case ISD::SETLE: |
| 778 | Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1, VT); |
| 779 | Tmp2 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp2, VT); |
| 780 | break; |
| 781 | } |
| 782 | |
| 783 | } |
| 784 | Result = DAG.getSetCC(cast<SetCCSDNode>(Node)->getCondition(), |
Chris Lattner | f30b73b | 2005-01-18 02:52:03 +0000 | [diff] [blame] | 785 | Node->getValueType(0), Tmp1, Tmp2); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 786 | break; |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 787 | case Expand: |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 788 | SDOperand LHSLo, LHSHi, RHSLo, RHSHi; |
| 789 | ExpandOp(Node->getOperand(0), LHSLo, LHSHi); |
| 790 | ExpandOp(Node->getOperand(1), RHSLo, RHSHi); |
| 791 | switch (cast<SetCCSDNode>(Node)->getCondition()) { |
| 792 | case ISD::SETEQ: |
| 793 | case ISD::SETNE: |
Chris Lattner | 08b698e | 2005-04-12 01:46:05 +0000 | [diff] [blame] | 794 | if (RHSLo == RHSHi) |
| 795 | if (ConstantSDNode *RHSCST = dyn_cast<ConstantSDNode>(RHSLo)) |
| 796 | if (RHSCST->isAllOnesValue()) { |
| 797 | // Comparison to -1. |
| 798 | Tmp1 = DAG.getNode(ISD::AND, LHSLo.getValueType(), LHSLo, LHSHi); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 799 | Result = DAG.getSetCC(cast<SetCCSDNode>(Node)->getCondition(), |
Chris Lattner | 08b698e | 2005-04-12 01:46:05 +0000 | [diff] [blame] | 800 | Node->getValueType(0), Tmp1, RHSLo); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 801 | break; |
Chris Lattner | 08b698e | 2005-04-12 01:46:05 +0000 | [diff] [blame] | 802 | } |
| 803 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 804 | Tmp1 = DAG.getNode(ISD::XOR, LHSLo.getValueType(), LHSLo, RHSLo); |
| 805 | Tmp2 = DAG.getNode(ISD::XOR, LHSLo.getValueType(), LHSHi, RHSHi); |
| 806 | Tmp1 = DAG.getNode(ISD::OR, Tmp1.getValueType(), Tmp1, Tmp2); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 807 | Result = DAG.getSetCC(cast<SetCCSDNode>(Node)->getCondition(), |
Chris Lattner | f30b73b | 2005-01-18 02:52:03 +0000 | [diff] [blame] | 808 | Node->getValueType(0), Tmp1, |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 809 | DAG.getConstant(0, Tmp1.getValueType())); |
| 810 | break; |
| 811 | default: |
Chris Lattner | 5b95ed6 | 2005-04-12 02:19:10 +0000 | [diff] [blame] | 812 | // If this is a comparison of the sign bit, just look at the top part. |
| 813 | // X > -1, x < 0 |
| 814 | if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(Node->getOperand(1))) |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 815 | if ((cast<SetCCSDNode>(Node)->getCondition() == ISD::SETLT && |
Chris Lattner | 5b95ed6 | 2005-04-12 02:19:10 +0000 | [diff] [blame] | 816 | CST->getValue() == 0) || // X < 0 |
| 817 | (cast<SetCCSDNode>(Node)->getCondition() == ISD::SETGT && |
| 818 | (CST->isAllOnesValue()))) // X > -1 |
| 819 | return DAG.getSetCC(cast<SetCCSDNode>(Node)->getCondition(), |
| 820 | Node->getValueType(0), LHSHi, RHSHi); |
| 821 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 822 | // FIXME: This generated code sucks. |
| 823 | ISD::CondCode LowCC; |
| 824 | switch (cast<SetCCSDNode>(Node)->getCondition()) { |
| 825 | default: assert(0 && "Unknown integer setcc!"); |
| 826 | case ISD::SETLT: |
| 827 | case ISD::SETULT: LowCC = ISD::SETULT; break; |
| 828 | case ISD::SETGT: |
| 829 | case ISD::SETUGT: LowCC = ISD::SETUGT; break; |
| 830 | case ISD::SETLE: |
| 831 | case ISD::SETULE: LowCC = ISD::SETULE; break; |
| 832 | case ISD::SETGE: |
| 833 | case ISD::SETUGE: LowCC = ISD::SETUGE; break; |
| 834 | } |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 835 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 836 | // Tmp1 = lo(op1) < lo(op2) // Always unsigned comparison |
| 837 | // Tmp2 = hi(op1) < hi(op2) // Signedness depends on operands |
| 838 | // dest = hi(op1) == hi(op2) ? Tmp1 : Tmp2; |
| 839 | |
| 840 | // NOTE: on targets without efficient SELECT of bools, we can always use |
| 841 | // this identity: (B1 ? B2 : B3) --> (B1 & B2)|(!B1&B3) |
Chris Lattner | f30b73b | 2005-01-18 02:52:03 +0000 | [diff] [blame] | 842 | Tmp1 = DAG.getSetCC(LowCC, Node->getValueType(0), LHSLo, RHSLo); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 843 | Tmp2 = DAG.getSetCC(cast<SetCCSDNode>(Node)->getCondition(), |
Chris Lattner | f30b73b | 2005-01-18 02:52:03 +0000 | [diff] [blame] | 844 | Node->getValueType(0), LHSHi, RHSHi); |
| 845 | Result = DAG.getSetCC(ISD::SETEQ, Node->getValueType(0), LHSHi, RHSHi); |
| 846 | Result = DAG.getNode(ISD::SELECT, Tmp1.getValueType(), |
| 847 | Result, Tmp1, Tmp2); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 848 | break; |
| 849 | } |
| 850 | } |
| 851 | break; |
| 852 | |
Chris Lattner | e1bd822 | 2005-01-11 05:57:22 +0000 | [diff] [blame] | 853 | case ISD::MEMSET: |
| 854 | case ISD::MEMCPY: |
| 855 | case ISD::MEMMOVE: { |
Chris Lattner | deb692e | 2005-02-01 18:38:28 +0000 | [diff] [blame] | 856 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Chain |
Chris Lattner | e560521 | 2005-01-28 22:29:18 +0000 | [diff] [blame] | 857 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Pointer |
| 858 | |
| 859 | if (Node->getOpcode() == ISD::MEMSET) { // memset = ubyte |
| 860 | switch (getTypeAction(Node->getOperand(2).getValueType())) { |
| 861 | case Expand: assert(0 && "Cannot expand a byte!"); |
| 862 | case Legal: |
Chris Lattner | deb692e | 2005-02-01 18:38:28 +0000 | [diff] [blame] | 863 | Tmp3 = LegalizeOp(Node->getOperand(2)); |
Chris Lattner | e560521 | 2005-01-28 22:29:18 +0000 | [diff] [blame] | 864 | break; |
| 865 | case Promote: |
Chris Lattner | deb692e | 2005-02-01 18:38:28 +0000 | [diff] [blame] | 866 | Tmp3 = PromoteOp(Node->getOperand(2)); |
Chris Lattner | e560521 | 2005-01-28 22:29:18 +0000 | [diff] [blame] | 867 | break; |
| 868 | } |
| 869 | } else { |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 870 | Tmp3 = LegalizeOp(Node->getOperand(2)); // memcpy/move = pointer, |
Chris Lattner | e560521 | 2005-01-28 22:29:18 +0000 | [diff] [blame] | 871 | } |
Chris Lattner | 272455b | 2005-02-02 03:44:41 +0000 | [diff] [blame] | 872 | |
| 873 | SDOperand Tmp4; |
| 874 | switch (getTypeAction(Node->getOperand(3).getValueType())) { |
Chris Lattner | e560521 | 2005-01-28 22:29:18 +0000 | [diff] [blame] | 875 | case Expand: assert(0 && "Cannot expand this yet!"); |
| 876 | case Legal: |
| 877 | Tmp4 = LegalizeOp(Node->getOperand(3)); |
Chris Lattner | e560521 | 2005-01-28 22:29:18 +0000 | [diff] [blame] | 878 | break; |
| 879 | case Promote: |
| 880 | Tmp4 = PromoteOp(Node->getOperand(3)); |
Chris Lattner | 272455b | 2005-02-02 03:44:41 +0000 | [diff] [blame] | 881 | break; |
| 882 | } |
| 883 | |
| 884 | SDOperand Tmp5; |
| 885 | switch (getTypeAction(Node->getOperand(4).getValueType())) { // uint |
| 886 | case Expand: assert(0 && "Cannot expand this yet!"); |
| 887 | case Legal: |
| 888 | Tmp5 = LegalizeOp(Node->getOperand(4)); |
| 889 | break; |
| 890 | case Promote: |
Chris Lattner | e560521 | 2005-01-28 22:29:18 +0000 | [diff] [blame] | 891 | Tmp5 = PromoteOp(Node->getOperand(4)); |
| 892 | break; |
| 893 | } |
Chris Lattner | 55ba8fb | 2005-01-16 07:29:19 +0000 | [diff] [blame] | 894 | |
| 895 | switch (TLI.getOperationAction(Node->getOpcode(), MVT::Other)) { |
| 896 | default: assert(0 && "This action not implemented for this operation!"); |
| 897 | case TargetLowering::Legal: |
Chris Lattner | e1bd822 | 2005-01-11 05:57:22 +0000 | [diff] [blame] | 898 | if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1) || |
| 899 | Tmp3 != Node->getOperand(2) || Tmp4 != Node->getOperand(3) || |
| 900 | Tmp5 != Node->getOperand(4)) { |
| 901 | std::vector<SDOperand> Ops; |
| 902 | Ops.push_back(Tmp1); Ops.push_back(Tmp2); Ops.push_back(Tmp3); |
| 903 | Ops.push_back(Tmp4); Ops.push_back(Tmp5); |
| 904 | Result = DAG.getNode(Node->getOpcode(), MVT::Other, Ops); |
| 905 | } |
Chris Lattner | 55ba8fb | 2005-01-16 07:29:19 +0000 | [diff] [blame] | 906 | break; |
| 907 | case TargetLowering::Expand: { |
Chris Lattner | e1bd822 | 2005-01-11 05:57:22 +0000 | [diff] [blame] | 908 | // Otherwise, the target does not support this operation. Lower the |
| 909 | // operation to an explicit libcall as appropriate. |
| 910 | MVT::ValueType IntPtr = TLI.getPointerTy(); |
| 911 | const Type *IntPtrTy = TLI.getTargetData().getIntPtrType(); |
| 912 | std::vector<std::pair<SDOperand, const Type*> > Args; |
| 913 | |
Reid Spencer | 3bfbf4e | 2005-01-12 14:53:45 +0000 | [diff] [blame] | 914 | const char *FnName = 0; |
Chris Lattner | e1bd822 | 2005-01-11 05:57:22 +0000 | [diff] [blame] | 915 | if (Node->getOpcode() == ISD::MEMSET) { |
| 916 | Args.push_back(std::make_pair(Tmp2, IntPtrTy)); |
| 917 | // Extend the ubyte argument to be an int value for the call. |
| 918 | Tmp3 = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, Tmp3); |
| 919 | Args.push_back(std::make_pair(Tmp3, Type::IntTy)); |
| 920 | Args.push_back(std::make_pair(Tmp4, IntPtrTy)); |
| 921 | |
| 922 | FnName = "memset"; |
| 923 | } else if (Node->getOpcode() == ISD::MEMCPY || |
| 924 | Node->getOpcode() == ISD::MEMMOVE) { |
| 925 | Args.push_back(std::make_pair(Tmp2, IntPtrTy)); |
| 926 | Args.push_back(std::make_pair(Tmp3, IntPtrTy)); |
| 927 | Args.push_back(std::make_pair(Tmp4, IntPtrTy)); |
| 928 | FnName = Node->getOpcode() == ISD::MEMMOVE ? "memmove" : "memcpy"; |
| 929 | } else { |
| 930 | assert(0 && "Unknown op!"); |
| 931 | } |
Chris Lattner | 45982da | 2005-05-12 16:53:42 +0000 | [diff] [blame] | 932 | |
Chris Lattner | e1bd822 | 2005-01-11 05:57:22 +0000 | [diff] [blame] | 933 | std::pair<SDOperand,SDOperand> CallResult = |
Chris Lattner | adf6a96 | 2005-05-13 18:50:42 +0000 | [diff] [blame^] | 934 | TLI.LowerCallTo(Tmp1, Type::VoidTy, false, CallingConv::C, false, |
Chris Lattner | e1bd822 | 2005-01-11 05:57:22 +0000 | [diff] [blame] | 935 | DAG.getExternalSymbol(FnName, IntPtr), Args, DAG); |
| 936 | Result = LegalizeOp(CallResult.second); |
Chris Lattner | 55ba8fb | 2005-01-16 07:29:19 +0000 | [diff] [blame] | 937 | break; |
| 938 | } |
| 939 | case TargetLowering::Custom: |
| 940 | std::vector<SDOperand> Ops; |
| 941 | Ops.push_back(Tmp1); Ops.push_back(Tmp2); Ops.push_back(Tmp3); |
| 942 | Ops.push_back(Tmp4); Ops.push_back(Tmp5); |
| 943 | Result = DAG.getNode(Node->getOpcode(), MVT::Other, Ops); |
| 944 | Result = TLI.LowerOperation(Result); |
| 945 | Result = LegalizeOp(Result); |
| 946 | break; |
Chris Lattner | e1bd822 | 2005-01-11 05:57:22 +0000 | [diff] [blame] | 947 | } |
| 948 | break; |
| 949 | } |
Chris Lattner | 52d08bd | 2005-05-09 20:23:03 +0000 | [diff] [blame] | 950 | |
| 951 | case ISD::READPORT: |
Chris Lattner | 52d08bd | 2005-05-09 20:23:03 +0000 | [diff] [blame] | 952 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
| 953 | Tmp2 = LegalizeOp(Node->getOperand(1)); |
Chris Lattner | 6d5b8e1 | 2005-05-09 20:36:57 +0000 | [diff] [blame] | 954 | |
Chris Lattner | 52d08bd | 2005-05-09 20:23:03 +0000 | [diff] [blame] | 955 | if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1)) |
Chris Lattner | 6d5b8e1 | 2005-05-09 20:36:57 +0000 | [diff] [blame] | 956 | Result = DAG.getNode(ISD::READPORT, Node->getValueType(0), Tmp1, Tmp2); |
Chris Lattner | 52d08bd | 2005-05-09 20:23:03 +0000 | [diff] [blame] | 957 | else |
| 958 | Result = SDOperand(Node, 0); |
| 959 | // Since these produce two values, make sure to remember that we legalized |
| 960 | // both of them. |
| 961 | AddLegalizedOperand(SDOperand(Node, 0), Result); |
| 962 | AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1)); |
| 963 | return Result.getValue(Op.ResNo); |
Chris Lattner | 52d08bd | 2005-05-09 20:23:03 +0000 | [diff] [blame] | 964 | case ISD::WRITEPORT: |
Chris Lattner | 52d08bd | 2005-05-09 20:23:03 +0000 | [diff] [blame] | 965 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
| 966 | Tmp2 = LegalizeOp(Node->getOperand(1)); |
| 967 | Tmp3 = LegalizeOp(Node->getOperand(2)); |
| 968 | if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1) || |
| 969 | Tmp3 != Node->getOperand(2)) |
| 970 | Result = DAG.getNode(Node->getOpcode(), MVT::Other, Tmp1, Tmp2, Tmp3); |
| 971 | break; |
| 972 | |
Chris Lattner | 6d5b8e1 | 2005-05-09 20:36:57 +0000 | [diff] [blame] | 973 | case ISD::READIO: |
| 974 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
| 975 | Tmp2 = LegalizeOp(Node->getOperand(1)); |
| 976 | |
| 977 | switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) { |
| 978 | case TargetLowering::Custom: |
| 979 | default: assert(0 && "This action not implemented for this operation!"); |
| 980 | case TargetLowering::Legal: |
| 981 | if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1)) |
| 982 | Result = DAG.getNode(Node->getOpcode(), Node->getValueType(0), |
| 983 | Tmp1, Tmp2); |
| 984 | else |
| 985 | Result = SDOperand(Node, 0); |
| 986 | break; |
| 987 | case TargetLowering::Expand: |
| 988 | // Replace this with a load from memory. |
| 989 | Result = DAG.getLoad(Node->getValueType(0), Node->getOperand(0), |
| 990 | Node->getOperand(1), DAG.getSrcValue(NULL)); |
| 991 | Result = LegalizeOp(Result); |
| 992 | break; |
| 993 | } |
| 994 | |
| 995 | // Since these produce two values, make sure to remember that we legalized |
| 996 | // both of them. |
| 997 | AddLegalizedOperand(SDOperand(Node, 0), Result); |
| 998 | AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1)); |
| 999 | return Result.getValue(Op.ResNo); |
| 1000 | |
| 1001 | case ISD::WRITEIO: |
| 1002 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
| 1003 | Tmp2 = LegalizeOp(Node->getOperand(1)); |
| 1004 | Tmp3 = LegalizeOp(Node->getOperand(2)); |
| 1005 | |
| 1006 | switch (TLI.getOperationAction(Node->getOpcode(), |
| 1007 | Node->getOperand(1).getValueType())) { |
| 1008 | case TargetLowering::Custom: |
| 1009 | default: assert(0 && "This action not implemented for this operation!"); |
| 1010 | case TargetLowering::Legal: |
| 1011 | if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1) || |
| 1012 | Tmp3 != Node->getOperand(2)) |
| 1013 | Result = DAG.getNode(Node->getOpcode(), MVT::Other, Tmp1, Tmp2, Tmp3); |
| 1014 | break; |
| 1015 | case TargetLowering::Expand: |
| 1016 | // Replace this with a store to memory. |
| 1017 | Result = DAG.getNode(ISD::STORE, MVT::Other, Node->getOperand(0), |
| 1018 | Node->getOperand(1), Node->getOperand(2), |
| 1019 | DAG.getSrcValue(NULL)); |
| 1020 | Result = LegalizeOp(Result); |
| 1021 | break; |
| 1022 | } |
| 1023 | break; |
| 1024 | |
Chris Lattner | 84f6788 | 2005-01-20 18:52:28 +0000 | [diff] [blame] | 1025 | case ISD::ADD_PARTS: |
Chris Lattner | 5b359c6 | 2005-04-02 04:00:59 +0000 | [diff] [blame] | 1026 | case ISD::SUB_PARTS: |
| 1027 | case ISD::SHL_PARTS: |
| 1028 | case ISD::SRA_PARTS: |
| 1029 | case ISD::SRL_PARTS: { |
Chris Lattner | 84f6788 | 2005-01-20 18:52:28 +0000 | [diff] [blame] | 1030 | std::vector<SDOperand> Ops; |
| 1031 | bool Changed = false; |
| 1032 | for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) { |
| 1033 | Ops.push_back(LegalizeOp(Node->getOperand(i))); |
| 1034 | Changed |= Ops.back() != Node->getOperand(i); |
| 1035 | } |
| 1036 | if (Changed) |
| 1037 | Result = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Ops); |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 1038 | |
| 1039 | // Since these produce multiple values, make sure to remember that we |
| 1040 | // legalized all of them. |
| 1041 | for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) |
| 1042 | AddLegalizedOperand(SDOperand(Node, i), Result.getValue(i)); |
| 1043 | return Result.getValue(Op.ResNo); |
Chris Lattner | 84f6788 | 2005-01-20 18:52:28 +0000 | [diff] [blame] | 1044 | } |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 1045 | |
| 1046 | // Binary operators |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1047 | case ISD::ADD: |
| 1048 | case ISD::SUB: |
| 1049 | case ISD::MUL: |
Nate Begeman | c7c1657 | 2005-04-11 03:01:51 +0000 | [diff] [blame] | 1050 | case ISD::MULHS: |
| 1051 | case ISD::MULHU: |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1052 | case ISD::UDIV: |
| 1053 | case ISD::SDIV: |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1054 | case ISD::AND: |
| 1055 | case ISD::OR: |
| 1056 | case ISD::XOR: |
Chris Lattner | 03c0cf8 | 2005-01-07 21:45:56 +0000 | [diff] [blame] | 1057 | case ISD::SHL: |
| 1058 | case ISD::SRL: |
| 1059 | case ISD::SRA: |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1060 | Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS |
| 1061 | Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS |
| 1062 | if (Tmp1 != Node->getOperand(0) || |
| 1063 | Tmp2 != Node->getOperand(1)) |
| 1064 | Result = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Tmp1,Tmp2); |
| 1065 | break; |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 1066 | |
Nate Begeman | c105e19 | 2005-04-06 00:23:54 +0000 | [diff] [blame] | 1067 | case ISD::UREM: |
| 1068 | case ISD::SREM: |
| 1069 | Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS |
| 1070 | Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS |
| 1071 | switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) { |
| 1072 | case TargetLowering::Legal: |
| 1073 | if (Tmp1 != Node->getOperand(0) || |
| 1074 | Tmp2 != Node->getOperand(1)) |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 1075 | Result = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Tmp1, |
Nate Begeman | c105e19 | 2005-04-06 00:23:54 +0000 | [diff] [blame] | 1076 | Tmp2); |
| 1077 | break; |
| 1078 | case TargetLowering::Promote: |
| 1079 | case TargetLowering::Custom: |
| 1080 | assert(0 && "Cannot promote/custom handle this yet!"); |
| 1081 | case TargetLowering::Expand: { |
| 1082 | MVT::ValueType VT = Node->getValueType(0); |
| 1083 | unsigned Opc = (Node->getOpcode() == ISD::UREM) ? ISD::UDIV : ISD::SDIV; |
| 1084 | Result = DAG.getNode(Opc, VT, Tmp1, Tmp2); |
| 1085 | Result = DAG.getNode(ISD::MUL, VT, Result, Tmp2); |
| 1086 | Result = DAG.getNode(ISD::SUB, VT, Tmp1, Result); |
| 1087 | } |
| 1088 | break; |
| 1089 | } |
| 1090 | break; |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 1091 | |
Andrew Lenharth | 691ef2b | 2005-05-03 17:19:30 +0000 | [diff] [blame] | 1092 | case ISD::CTPOP: |
| 1093 | case ISD::CTTZ: |
| 1094 | case ISD::CTLZ: |
| 1095 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Op |
| 1096 | switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) { |
| 1097 | case TargetLowering::Legal: |
| 1098 | if (Tmp1 != Node->getOperand(0)) |
| 1099 | Result = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Tmp1); |
| 1100 | break; |
| 1101 | case TargetLowering::Promote: { |
| 1102 | MVT::ValueType OVT = Tmp1.getValueType(); |
| 1103 | MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT); |
Chris Lattner | edb1add | 2005-05-11 04:51:16 +0000 | [diff] [blame] | 1104 | |
| 1105 | // Zero extend the argument. |
Andrew Lenharth | 691ef2b | 2005-05-03 17:19:30 +0000 | [diff] [blame] | 1106 | Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1); |
| 1107 | // Perform the larger operation, then subtract if needed. |
| 1108 | Tmp1 = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Tmp1); |
| 1109 | switch(Node->getOpcode()) |
| 1110 | { |
| 1111 | case ISD::CTPOP: |
| 1112 | Result = Tmp1; |
| 1113 | break; |
| 1114 | case ISD::CTTZ: |
| 1115 | //if Tmp1 == sizeinbits(NVT) then Tmp1 = sizeinbits(Old VT) |
Chris Lattner | 39a8f33 | 2005-05-12 19:05:01 +0000 | [diff] [blame] | 1116 | Tmp2 = DAG.getSetCC(ISD::SETEQ, TLI.getSetCCResultTy(), Tmp1, |
Andrew Lenharth | 691ef2b | 2005-05-03 17:19:30 +0000 | [diff] [blame] | 1117 | DAG.getConstant(getSizeInBits(NVT), NVT)); |
| 1118 | Result = DAG.getNode(ISD::SELECT, NVT, Tmp2, |
| 1119 | DAG.getConstant(getSizeInBits(OVT),NVT), Tmp1); |
| 1120 | break; |
| 1121 | case ISD::CTLZ: |
| 1122 | //Tmp1 = Tmp1 - (sizeinbits(NVT) - sizeinbits(Old VT)) |
| 1123 | Result = DAG.getNode(ISD::SUB, NVT, Tmp1, |
| 1124 | DAG.getConstant(getSizeInBits(NVT) - |
| 1125 | getSizeInBits(OVT), NVT)); |
| 1126 | break; |
| 1127 | } |
| 1128 | break; |
| 1129 | } |
| 1130 | case TargetLowering::Custom: |
| 1131 | assert(0 && "Cannot custom handle this yet!"); |
| 1132 | case TargetLowering::Expand: |
Andrew Lenharth | ded10bf | 2005-05-05 15:55:21 +0000 | [diff] [blame] | 1133 | switch(Node->getOpcode()) |
| 1134 | { |
| 1135 | case ISD::CTPOP: { |
Chris Lattner | e3ef0a8 | 2005-05-11 05:21:31 +0000 | [diff] [blame] | 1136 | static const uint64_t mask[6] = { |
| 1137 | 0x5555555555555555ULL, 0x3333333333333333ULL, |
| 1138 | 0x0F0F0F0F0F0F0F0FULL, 0x00FF00FF00FF00FFULL, |
| 1139 | 0x0000FFFF0000FFFFULL, 0x00000000FFFFFFFFULL |
| 1140 | }; |
Andrew Lenharth | ded10bf | 2005-05-05 15:55:21 +0000 | [diff] [blame] | 1141 | MVT::ValueType VT = Tmp1.getValueType(); |
Chris Lattner | e3ef0a8 | 2005-05-11 05:21:31 +0000 | [diff] [blame] | 1142 | MVT::ValueType ShVT = TLI.getShiftAmountTy(); |
| 1143 | unsigned len = getSizeInBits(VT); |
| 1144 | for (unsigned i = 0; (1U << i) <= (len / 2); ++i) { |
Andrew Lenharth | ded10bf | 2005-05-05 15:55:21 +0000 | [diff] [blame] | 1145 | //x = (x & mask[i][len/8]) + (x >> (1 << i) & mask[i][len/8]) |
Chris Lattner | e3ef0a8 | 2005-05-11 05:21:31 +0000 | [diff] [blame] | 1146 | Tmp2 = DAG.getConstant(mask[i], VT); |
| 1147 | Tmp3 = DAG.getConstant(1ULL << i, ShVT); |
Andrew Lenharth | ded10bf | 2005-05-05 15:55:21 +0000 | [diff] [blame] | 1148 | Tmp1 = DAG.getNode(ISD::ADD, VT, |
| 1149 | DAG.getNode(ISD::AND, VT, Tmp1, Tmp2), |
| 1150 | DAG.getNode(ISD::AND, VT, |
| 1151 | DAG.getNode(ISD::SRL, VT, Tmp1, Tmp3), |
| 1152 | Tmp2)); |
| 1153 | } |
| 1154 | Result = Tmp1; |
| 1155 | break; |
| 1156 | } |
Duraid Madina | 57ff7e5 | 2005-05-11 08:45:08 +0000 | [diff] [blame] | 1157 | case ISD::CTLZ: { |
| 1158 | /* for now, we do this: |
Chris Lattner | 5c33c9a | 2005-05-11 18:35:21 +0000 | [diff] [blame] | 1159 | x = x | (x >> 1); |
| 1160 | x = x | (x >> 2); |
| 1161 | ... |
| 1162 | x = x | (x >>16); |
| 1163 | x = x | (x >>32); // for 64-bit input |
| 1164 | return popcount(~x); |
Duraid Madina | 57ff7e5 | 2005-05-11 08:45:08 +0000 | [diff] [blame] | 1165 | |
Chris Lattner | 5c33c9a | 2005-05-11 18:35:21 +0000 | [diff] [blame] | 1166 | but see also: http://www.hackersdelight.org/HDcode/nlz.cc */ |
| 1167 | MVT::ValueType VT = Tmp1.getValueType(); |
Duraid Madina | 57ff7e5 | 2005-05-11 08:45:08 +0000 | [diff] [blame] | 1168 | MVT::ValueType ShVT = TLI.getShiftAmountTy(); |
| 1169 | unsigned len = getSizeInBits(VT); |
| 1170 | for (unsigned i = 0; (1U << i) <= (len / 2); ++i) { |
| 1171 | Tmp3 = DAG.getConstant(1ULL << i, ShVT); |
| 1172 | Tmp1 = DAG.getNode(ISD::OR, VT, Tmp1, |
| 1173 | DAG.getNode(ISD::SRL, VT, Tmp1, Tmp3)); |
| 1174 | } |
| 1175 | Tmp3 = DAG.getNode(ISD::XOR, VT, Tmp1, DAG.getConstant(~0ULL, VT)); |
Chris Lattner | 5c33c9a | 2005-05-11 18:35:21 +0000 | [diff] [blame] | 1176 | Result = LegalizeOp(DAG.getNode(ISD::CTPOP, VT, Tmp3)); |
Chris Lattner | 18aa680 | 2005-05-11 05:27:09 +0000 | [diff] [blame] | 1177 | break; |
Duraid Madina | 57ff7e5 | 2005-05-11 08:45:08 +0000 | [diff] [blame] | 1178 | } |
| 1179 | case ISD::CTTZ: { |
Nate Begeman | d7c4a4a | 2005-05-11 23:43:56 +0000 | [diff] [blame] | 1180 | // for now, we use: { return popcount(~x & (x - 1)); } |
| 1181 | // unless the target has ctlz but not ctpop, in which case we use: |
| 1182 | // { return 32 - nlz(~x & (x-1)); } |
| 1183 | // see also http://www.hackersdelight.org/HDcode/ntz.cc |
Chris Lattner | 5c33c9a | 2005-05-11 18:35:21 +0000 | [diff] [blame] | 1184 | MVT::ValueType VT = Tmp1.getValueType(); |
| 1185 | Tmp2 = DAG.getConstant(~0ULL, VT); |
| 1186 | Tmp3 = DAG.getNode(ISD::AND, VT, |
| 1187 | DAG.getNode(ISD::XOR, VT, Tmp1, Tmp2), |
| 1188 | DAG.getNode(ISD::SUB, VT, Tmp1, |
| 1189 | DAG.getConstant(1, VT))); |
Nate Begeman | d7c4a4a | 2005-05-11 23:43:56 +0000 | [diff] [blame] | 1190 | // If ISD::CTLZ is legal and CTPOP isn't, then do that instead |
| 1191 | if (TLI.getOperationAction(ISD::CTPOP, VT) != TargetLowering::Legal && |
| 1192 | TLI.getOperationAction(ISD::CTLZ, VT) == TargetLowering::Legal) { |
| 1193 | Result = LegalizeOp(DAG.getNode(ISD::SUB, VT, |
| 1194 | DAG.getConstant(getSizeInBits(VT), VT), |
| 1195 | DAG.getNode(ISD::CTLZ, VT, Tmp3))); |
| 1196 | } else { |
| 1197 | Result = LegalizeOp(DAG.getNode(ISD::CTPOP, VT, Tmp3)); |
| 1198 | } |
Chris Lattner | 18aa680 | 2005-05-11 05:27:09 +0000 | [diff] [blame] | 1199 | break; |
Duraid Madina | 57ff7e5 | 2005-05-11 08:45:08 +0000 | [diff] [blame] | 1200 | } |
Andrew Lenharth | ded10bf | 2005-05-05 15:55:21 +0000 | [diff] [blame] | 1201 | default: |
| 1202 | assert(0 && "Cannot expand this yet!"); |
| 1203 | break; |
| 1204 | } |
Andrew Lenharth | 691ef2b | 2005-05-03 17:19:30 +0000 | [diff] [blame] | 1205 | break; |
| 1206 | } |
| 1207 | break; |
| 1208 | |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 1209 | // Unary operators |
| 1210 | case ISD::FABS: |
| 1211 | case ISD::FNEG: |
Chris Lattner | da6ba87 | 2005-04-28 21:44:33 +0000 | [diff] [blame] | 1212 | case ISD::FSQRT: |
| 1213 | case ISD::FSIN: |
| 1214 | case ISD::FCOS: |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 1215 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
| 1216 | switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) { |
| 1217 | case TargetLowering::Legal: |
| 1218 | if (Tmp1 != Node->getOperand(0)) |
| 1219 | Result = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Tmp1); |
| 1220 | break; |
| 1221 | case TargetLowering::Promote: |
| 1222 | case TargetLowering::Custom: |
| 1223 | assert(0 && "Cannot promote/custom handle this yet!"); |
| 1224 | case TargetLowering::Expand: |
Chris Lattner | f76e7dc | 2005-04-30 04:43:14 +0000 | [diff] [blame] | 1225 | switch(Node->getOpcode()) { |
| 1226 | case ISD::FNEG: { |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 1227 | // Expand Y = FNEG(X) -> Y = SUB -0.0, X |
| 1228 | Tmp2 = DAG.getConstantFP(-0.0, Node->getValueType(0)); |
| 1229 | Result = LegalizeOp(DAG.getNode(ISD::SUB, Node->getValueType(0), |
| 1230 | Tmp2, Tmp1)); |
Chris Lattner | f76e7dc | 2005-04-30 04:43:14 +0000 | [diff] [blame] | 1231 | break; |
| 1232 | } |
| 1233 | case ISD::FABS: { |
Chris Lattner | 4af6e0d | 2005-04-02 05:26:37 +0000 | [diff] [blame] | 1234 | // Expand Y = FABS(X) -> Y = (X >u 0.0) ? X : fneg(X). |
| 1235 | MVT::ValueType VT = Node->getValueType(0); |
| 1236 | Tmp2 = DAG.getConstantFP(0.0, VT); |
| 1237 | Tmp2 = DAG.getSetCC(ISD::SETUGT, TLI.getSetCCResultTy(), Tmp1, Tmp2); |
| 1238 | Tmp3 = DAG.getNode(ISD::FNEG, VT, Tmp1); |
| 1239 | Result = DAG.getNode(ISD::SELECT, VT, Tmp2, Tmp1, Tmp3); |
| 1240 | Result = LegalizeOp(Result); |
Chris Lattner | f76e7dc | 2005-04-30 04:43:14 +0000 | [diff] [blame] | 1241 | break; |
| 1242 | } |
| 1243 | case ISD::FSQRT: |
| 1244 | case ISD::FSIN: |
| 1245 | case ISD::FCOS: { |
| 1246 | MVT::ValueType VT = Node->getValueType(0); |
| 1247 | Type *T = VT == MVT::f32 ? Type::FloatTy : Type::DoubleTy; |
| 1248 | const char *FnName = 0; |
| 1249 | switch(Node->getOpcode()) { |
| 1250 | case ISD::FSQRT: FnName = VT == MVT::f32 ? "sqrtf" : "sqrt"; break; |
| 1251 | case ISD::FSIN: FnName = VT == MVT::f32 ? "sinf" : "sin"; break; |
| 1252 | case ISD::FCOS: FnName = VT == MVT::f32 ? "cosf" : "cos"; break; |
| 1253 | default: assert(0 && "Unreachable!"); |
| 1254 | } |
| 1255 | std::vector<std::pair<SDOperand, const Type*> > Args; |
| 1256 | Args.push_back(std::make_pair(Tmp1, T)); |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 1257 | // FIXME: should use ExpandLibCall! |
Chris Lattner | f76e7dc | 2005-04-30 04:43:14 +0000 | [diff] [blame] | 1258 | std::pair<SDOperand,SDOperand> CallResult = |
Chris Lattner | adf6a96 | 2005-05-13 18:50:42 +0000 | [diff] [blame^] | 1259 | TLI.LowerCallTo(DAG.getEntryNode(), T, false, CallingConv::C, true, |
Chris Lattner | f76e7dc | 2005-04-30 04:43:14 +0000 | [diff] [blame] | 1260 | DAG.getExternalSymbol(FnName, VT), Args, DAG); |
| 1261 | Result = LegalizeOp(CallResult.first); |
| 1262 | break; |
| 1263 | } |
| 1264 | default: |
Chris Lattner | 4af6e0d | 2005-04-02 05:26:37 +0000 | [diff] [blame] | 1265 | assert(0 && "Unreachable!"); |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 1266 | } |
| 1267 | break; |
| 1268 | } |
| 1269 | break; |
| 1270 | |
| 1271 | // Conversion operators. The source and destination have different types. |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1272 | case ISD::ZERO_EXTEND: |
| 1273 | case ISD::SIGN_EXTEND: |
Chris Lattner | 7cc4777 | 2005-01-07 21:56:57 +0000 | [diff] [blame] | 1274 | case ISD::TRUNCATE: |
Chris Lattner | 03c0cf8 | 2005-01-07 21:45:56 +0000 | [diff] [blame] | 1275 | case ISD::FP_EXTEND: |
| 1276 | case ISD::FP_ROUND: |
Chris Lattner | ae0aacb | 2005-01-08 08:08:56 +0000 | [diff] [blame] | 1277 | case ISD::FP_TO_SINT: |
| 1278 | case ISD::FP_TO_UINT: |
| 1279 | case ISD::SINT_TO_FP: |
| 1280 | case ISD::UINT_TO_FP: |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1281 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 1282 | case Legal: |
| 1283 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
| 1284 | if (Tmp1 != Node->getOperand(0)) |
| 1285 | Result = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Tmp1); |
| 1286 | break; |
Chris Lattner | b00a642 | 2005-01-07 22:37:48 +0000 | [diff] [blame] | 1287 | case Expand: |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 1288 | if (Node->getOpcode() == ISD::SINT_TO_FP || |
| 1289 | Node->getOpcode() == ISD::UINT_TO_FP) { |
| 1290 | Result = ExpandIntToFP(Node->getOpcode() == ISD::SINT_TO_FP, |
| 1291 | Node->getValueType(0), Node->getOperand(0)); |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 1292 | break; |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 1293 | } else if (Node->getOpcode() == ISD::TRUNCATE) { |
| 1294 | // In the expand case, we must be dealing with a truncate, because |
| 1295 | // otherwise the result would be larger than the source. |
| 1296 | ExpandOp(Node->getOperand(0), Tmp1, Tmp2); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 1297 | |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 1298 | // Since the result is legal, we should just be able to truncate the low |
| 1299 | // part of the source. |
| 1300 | Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0), Tmp1); |
| 1301 | break; |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 1302 | } |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 1303 | assert(0 && "Shouldn't need to expand other operators here!"); |
Chris Lattner | b00a642 | 2005-01-07 22:37:48 +0000 | [diff] [blame] | 1304 | |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1305 | case Promote: |
| 1306 | switch (Node->getOpcode()) { |
Chris Lattner | 1713e73 | 2005-01-16 00:38:00 +0000 | [diff] [blame] | 1307 | case ISD::ZERO_EXTEND: |
| 1308 | Result = PromoteOp(Node->getOperand(0)); |
Chris Lattner | 47e9223 | 2005-01-18 19:27:06 +0000 | [diff] [blame] | 1309 | // NOTE: Any extend would work here... |
| 1310 | Result = DAG.getNode(ISD::ZERO_EXTEND, Op.getValueType(), Result); |
Chris Lattner | 2399356 | 2005-04-13 02:38:47 +0000 | [diff] [blame] | 1311 | Result = DAG.getZeroExtendInReg(Result, |
| 1312 | Node->getOperand(0).getValueType()); |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1313 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1314 | case ISD::SIGN_EXTEND: |
Chris Lattner | 1713e73 | 2005-01-16 00:38:00 +0000 | [diff] [blame] | 1315 | Result = PromoteOp(Node->getOperand(0)); |
Chris Lattner | 47e9223 | 2005-01-18 19:27:06 +0000 | [diff] [blame] | 1316 | // NOTE: Any extend would work here... |
Chris Lattner | d5d5682 | 2005-01-18 21:57:59 +0000 | [diff] [blame] | 1317 | Result = DAG.getNode(ISD::ZERO_EXTEND, Op.getValueType(), Result); |
Chris Lattner | 1713e73 | 2005-01-16 00:38:00 +0000 | [diff] [blame] | 1318 | Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(), |
| 1319 | Result, Node->getOperand(0).getValueType()); |
| 1320 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1321 | case ISD::TRUNCATE: |
Chris Lattner | 1713e73 | 2005-01-16 00:38:00 +0000 | [diff] [blame] | 1322 | Result = PromoteOp(Node->getOperand(0)); |
| 1323 | Result = DAG.getNode(ISD::TRUNCATE, Op.getValueType(), Result); |
| 1324 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1325 | case ISD::FP_EXTEND: |
Chris Lattner | 1713e73 | 2005-01-16 00:38:00 +0000 | [diff] [blame] | 1326 | Result = PromoteOp(Node->getOperand(0)); |
| 1327 | if (Result.getValueType() != Op.getValueType()) |
| 1328 | // Dynamically dead while we have only 2 FP types. |
| 1329 | Result = DAG.getNode(ISD::FP_EXTEND, Op.getValueType(), Result); |
| 1330 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1331 | case ISD::FP_ROUND: |
| 1332 | case ISD::FP_TO_SINT: |
| 1333 | case ISD::FP_TO_UINT: |
Chris Lattner | f8161d8 | 2005-01-16 05:06:12 +0000 | [diff] [blame] | 1334 | Result = PromoteOp(Node->getOperand(0)); |
| 1335 | Result = DAG.getNode(Node->getOpcode(), Op.getValueType(), Result); |
| 1336 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1337 | case ISD::SINT_TO_FP: |
Chris Lattner | f8161d8 | 2005-01-16 05:06:12 +0000 | [diff] [blame] | 1338 | Result = PromoteOp(Node->getOperand(0)); |
| 1339 | Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(), |
| 1340 | Result, Node->getOperand(0).getValueType()); |
| 1341 | Result = DAG.getNode(ISD::SINT_TO_FP, Op.getValueType(), Result); |
| 1342 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1343 | case ISD::UINT_TO_FP: |
Chris Lattner | f8161d8 | 2005-01-16 05:06:12 +0000 | [diff] [blame] | 1344 | Result = PromoteOp(Node->getOperand(0)); |
Chris Lattner | 2399356 | 2005-04-13 02:38:47 +0000 | [diff] [blame] | 1345 | Result = DAG.getZeroExtendInReg(Result, |
| 1346 | Node->getOperand(0).getValueType()); |
Chris Lattner | f8161d8 | 2005-01-16 05:06:12 +0000 | [diff] [blame] | 1347 | Result = DAG.getNode(ISD::UINT_TO_FP, Op.getValueType(), Result); |
| 1348 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1349 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1350 | } |
| 1351 | break; |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 1352 | case ISD::FP_ROUND_INREG: |
Chris Lattner | 2399356 | 2005-04-13 02:38:47 +0000 | [diff] [blame] | 1353 | case ISD::SIGN_EXTEND_INREG: { |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 1354 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 1355 | MVT::ValueType ExtraVT = cast<MVTSDNode>(Node)->getExtraValueType(); |
| 1356 | |
| 1357 | // If this operation is not supported, convert it to a shl/shr or load/store |
| 1358 | // pair. |
Chris Lattner | 55ba8fb | 2005-01-16 07:29:19 +0000 | [diff] [blame] | 1359 | switch (TLI.getOperationAction(Node->getOpcode(), ExtraVT)) { |
| 1360 | default: assert(0 && "This action not supported for this op yet!"); |
| 1361 | case TargetLowering::Legal: |
| 1362 | if (Tmp1 != Node->getOperand(0)) |
| 1363 | Result = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Tmp1, |
| 1364 | ExtraVT); |
| 1365 | break; |
| 1366 | case TargetLowering::Expand: |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 1367 | // If this is an integer extend and shifts are supported, do that. |
Chris Lattner | 2399356 | 2005-04-13 02:38:47 +0000 | [diff] [blame] | 1368 | if (Node->getOpcode() == ISD::SIGN_EXTEND_INREG) { |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 1369 | // NOTE: we could fall back on load/store here too for targets without |
| 1370 | // SAR. However, it is doubtful that any exist. |
| 1371 | unsigned BitsDiff = MVT::getSizeInBits(Node->getValueType(0)) - |
| 1372 | MVT::getSizeInBits(ExtraVT); |
Chris Lattner | 27ff112 | 2005-01-22 00:31:52 +0000 | [diff] [blame] | 1373 | SDOperand ShiftCst = DAG.getConstant(BitsDiff, TLI.getShiftAmountTy()); |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 1374 | Result = DAG.getNode(ISD::SHL, Node->getValueType(0), |
| 1375 | Node->getOperand(0), ShiftCst); |
| 1376 | Result = DAG.getNode(ISD::SRA, Node->getValueType(0), |
| 1377 | Result, ShiftCst); |
| 1378 | } else if (Node->getOpcode() == ISD::FP_ROUND_INREG) { |
| 1379 | // The only way we can lower this is to turn it into a STORETRUNC, |
| 1380 | // EXTLOAD pair, targetting a temporary location (a stack slot). |
| 1381 | |
| 1382 | // NOTE: there is a choice here between constantly creating new stack |
| 1383 | // slots and always reusing the same one. We currently always create |
| 1384 | // new ones, as reuse may inhibit scheduling. |
| 1385 | const Type *Ty = MVT::getTypeForValueType(ExtraVT); |
| 1386 | unsigned TySize = (unsigned)TLI.getTargetData().getTypeSize(Ty); |
| 1387 | unsigned Align = TLI.getTargetData().getTypeAlignment(Ty); |
| 1388 | MachineFunction &MF = DAG.getMachineFunction(); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 1389 | int SSFI = |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 1390 | MF.getFrameInfo()->CreateStackObject((unsigned)TySize, Align); |
| 1391 | SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy()); |
| 1392 | Result = DAG.getNode(ISD::TRUNCSTORE, MVT::Other, DAG.getEntryNode(), |
Chris Lattner | 52d08bd | 2005-05-09 20:23:03 +0000 | [diff] [blame] | 1393 | Node->getOperand(0), StackSlot, |
| 1394 | DAG.getSrcValue(NULL), ExtraVT); |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 1395 | Result = DAG.getNode(ISD::EXTLOAD, Node->getValueType(0), |
Andrew Lenharth | 2d86ea2 | 2005-04-27 20:10:01 +0000 | [diff] [blame] | 1396 | Result, StackSlot, DAG.getSrcValue(NULL), ExtraVT); |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 1397 | } else { |
| 1398 | assert(0 && "Unknown op"); |
| 1399 | } |
| 1400 | Result = LegalizeOp(Result); |
Chris Lattner | 55ba8fb | 2005-01-16 07:29:19 +0000 | [diff] [blame] | 1401 | break; |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 1402 | } |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 1403 | break; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1404 | } |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 1405 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1406 | |
Chris Lattner | 45982da | 2005-05-12 16:53:42 +0000 | [diff] [blame] | 1407 | // Note that LegalizeOp may be reentered even from single-use nodes, which |
| 1408 | // means that we always must cache transformed nodes. |
| 1409 | AddLegalizedOperand(Op, Result); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1410 | return Result; |
| 1411 | } |
| 1412 | |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 1413 | /// PromoteOp - Given an operation that produces a value in an invalid type, |
| 1414 | /// promote it to compute the value into a larger type. The produced value will |
| 1415 | /// have the correct bits for the low portion of the register, but no guarantee |
| 1416 | /// is made about the top bits: it may be zero, sign-extended, or garbage. |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1417 | SDOperand SelectionDAGLegalize::PromoteOp(SDOperand Op) { |
| 1418 | MVT::ValueType VT = Op.getValueType(); |
Chris Lattner | 71c42a0 | 2005-01-16 01:11:45 +0000 | [diff] [blame] | 1419 | MVT::ValueType NVT = TLI.getTypeToTransformTo(VT); |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1420 | assert(getTypeAction(VT) == Promote && |
| 1421 | "Caller should expand or legalize operands that are not promotable!"); |
| 1422 | assert(NVT > VT && MVT::isInteger(NVT) == MVT::isInteger(VT) && |
| 1423 | "Cannot promote to smaller type!"); |
| 1424 | |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1425 | SDOperand Tmp1, Tmp2, Tmp3; |
| 1426 | |
| 1427 | SDOperand Result; |
| 1428 | SDNode *Node = Op.Val; |
| 1429 | |
Chris Lattner | 45982da | 2005-05-12 16:53:42 +0000 | [diff] [blame] | 1430 | if (!Node->hasOneUse()) { |
| 1431 | std::map<SDOperand, SDOperand>::iterator I = PromotedNodes.find(Op); |
| 1432 | if (I != PromotedNodes.end()) return I->second; |
| 1433 | } else { |
| 1434 | assert(!PromotedNodes.count(Op) && "Repromoted this node??"); |
| 1435 | } |
| 1436 | |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 1437 | // Promotion needs an optimization step to clean up after it, and is not |
| 1438 | // careful to avoid operations the target does not support. Make sure that |
| 1439 | // all generated operations are legalized in the next iteration. |
| 1440 | NeedsAnotherIteration = true; |
| 1441 | |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1442 | switch (Node->getOpcode()) { |
| 1443 | default: |
| 1444 | std::cerr << "NODE: "; Node->dump(); std::cerr << "\n"; |
| 1445 | assert(0 && "Do not know how to promote this operator!"); |
| 1446 | abort(); |
Nate Begeman | fc1b1da | 2005-04-01 22:34:39 +0000 | [diff] [blame] | 1447 | case ISD::UNDEF: |
| 1448 | Result = DAG.getNode(ISD::UNDEF, NVT); |
| 1449 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1450 | case ISD::Constant: |
| 1451 | Result = DAG.getNode(ISD::ZERO_EXTEND, NVT, Op); |
| 1452 | assert(isa<ConstantSDNode>(Result) && "Didn't constant fold zext?"); |
| 1453 | break; |
| 1454 | case ISD::ConstantFP: |
| 1455 | Result = DAG.getNode(ISD::FP_EXTEND, NVT, Op); |
| 1456 | assert(isa<ConstantFPSDNode>(Result) && "Didn't constant fold fp_extend?"); |
| 1457 | break; |
Chris Lattner | ef5cd1d | 2005-01-18 17:54:55 +0000 | [diff] [blame] | 1458 | case ISD::CopyFromReg: |
| 1459 | Result = DAG.getCopyFromReg(cast<RegSDNode>(Node)->getReg(), NVT, |
| 1460 | Node->getOperand(0)); |
| 1461 | // Remember that we legalized the chain. |
| 1462 | AddLegalizedOperand(Op.getValue(1), Result.getValue(1)); |
| 1463 | break; |
| 1464 | |
Chris Lattner | 82fbfb6 | 2005-01-18 02:59:52 +0000 | [diff] [blame] | 1465 | case ISD::SETCC: |
| 1466 | assert(getTypeAction(TLI.getSetCCResultTy()) == Legal && |
| 1467 | "SetCC type is not legal??"); |
| 1468 | Result = DAG.getSetCC(cast<SetCCSDNode>(Node)->getCondition(), |
| 1469 | TLI.getSetCCResultTy(), Node->getOperand(0), |
| 1470 | Node->getOperand(1)); |
| 1471 | Result = LegalizeOp(Result); |
| 1472 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1473 | |
| 1474 | case ISD::TRUNCATE: |
| 1475 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 1476 | case Legal: |
| 1477 | Result = LegalizeOp(Node->getOperand(0)); |
| 1478 | assert(Result.getValueType() >= NVT && |
| 1479 | "This truncation doesn't make sense!"); |
| 1480 | if (Result.getValueType() > NVT) // Truncate to NVT instead of VT |
| 1481 | Result = DAG.getNode(ISD::TRUNCATE, NVT, Result); |
| 1482 | break; |
Chris Lattner | e76ad6d | 2005-01-28 22:52:50 +0000 | [diff] [blame] | 1483 | case Promote: |
| 1484 | // The truncation is not required, because we don't guarantee anything |
| 1485 | // about high bits anyway. |
| 1486 | Result = PromoteOp(Node->getOperand(0)); |
| 1487 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1488 | case Expand: |
Nate Begeman | 79e46ac | 2005-04-04 00:57:08 +0000 | [diff] [blame] | 1489 | ExpandOp(Node->getOperand(0), Tmp1, Tmp2); |
| 1490 | // Truncate the low part of the expanded value to the result type |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 1491 | Result = DAG.getNode(ISD::TRUNCATE, VT, Tmp1); |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1492 | } |
| 1493 | break; |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 1494 | case ISD::SIGN_EXTEND: |
| 1495 | case ISD::ZERO_EXTEND: |
| 1496 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 1497 | case Expand: assert(0 && "BUG: Smaller reg should have been promoted!"); |
| 1498 | case Legal: |
| 1499 | // Input is legal? Just do extend all the way to the larger type. |
| 1500 | Result = LegalizeOp(Node->getOperand(0)); |
| 1501 | Result = DAG.getNode(Node->getOpcode(), NVT, Result); |
| 1502 | break; |
| 1503 | case Promote: |
| 1504 | // Promote the reg if it's smaller. |
| 1505 | Result = PromoteOp(Node->getOperand(0)); |
| 1506 | // The high bits are not guaranteed to be anything. Insert an extend. |
| 1507 | if (Node->getOpcode() == ISD::SIGN_EXTEND) |
Chris Lattner | 595dc54 | 2005-02-04 18:39:19 +0000 | [diff] [blame] | 1508 | Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Result, |
| 1509 | Node->getOperand(0).getValueType()); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 1510 | else |
Chris Lattner | 2399356 | 2005-04-13 02:38:47 +0000 | [diff] [blame] | 1511 | Result = DAG.getZeroExtendInReg(Result, |
| 1512 | Node->getOperand(0).getValueType()); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 1513 | break; |
| 1514 | } |
| 1515 | break; |
| 1516 | |
| 1517 | case ISD::FP_EXTEND: |
| 1518 | assert(0 && "Case not implemented. Dynamically dead with 2 FP types!"); |
| 1519 | case ISD::FP_ROUND: |
| 1520 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 1521 | case Expand: assert(0 && "BUG: Cannot expand FP regs!"); |
| 1522 | case Promote: assert(0 && "Unreachable with 2 FP types!"); |
| 1523 | case Legal: |
| 1524 | // Input is legal? Do an FP_ROUND_INREG. |
| 1525 | Result = LegalizeOp(Node->getOperand(0)); |
| 1526 | Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result, VT); |
| 1527 | break; |
| 1528 | } |
| 1529 | break; |
| 1530 | |
| 1531 | case ISD::SINT_TO_FP: |
| 1532 | case ISD::UINT_TO_FP: |
| 1533 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 1534 | case Legal: |
| 1535 | Result = LegalizeOp(Node->getOperand(0)); |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 1536 | // No extra round required here. |
| 1537 | Result = DAG.getNode(Node->getOpcode(), NVT, Result); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 1538 | break; |
| 1539 | |
| 1540 | case Promote: |
| 1541 | Result = PromoteOp(Node->getOperand(0)); |
| 1542 | if (Node->getOpcode() == ISD::SINT_TO_FP) |
| 1543 | Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(), |
| 1544 | Result, Node->getOperand(0).getValueType()); |
| 1545 | else |
Chris Lattner | 2399356 | 2005-04-13 02:38:47 +0000 | [diff] [blame] | 1546 | Result = DAG.getZeroExtendInReg(Result, |
| 1547 | Node->getOperand(0).getValueType()); |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 1548 | // No extra round required here. |
| 1549 | Result = DAG.getNode(Node->getOpcode(), NVT, Result); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 1550 | break; |
| 1551 | case Expand: |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 1552 | Result = ExpandIntToFP(Node->getOpcode() == ISD::SINT_TO_FP, NVT, |
| 1553 | Node->getOperand(0)); |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 1554 | // Round if we cannot tolerate excess precision. |
| 1555 | if (NoExcessFPPrecision) |
| 1556 | Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result, VT); |
| 1557 | break; |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 1558 | } |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 1559 | break; |
| 1560 | |
| 1561 | case ISD::FP_TO_SINT: |
| 1562 | case ISD::FP_TO_UINT: |
| 1563 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 1564 | case Legal: |
| 1565 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
| 1566 | break; |
| 1567 | case Promote: |
| 1568 | // The input result is prerounded, so we don't have to do anything |
| 1569 | // special. |
| 1570 | Tmp1 = PromoteOp(Node->getOperand(0)); |
| 1571 | break; |
| 1572 | case Expand: |
| 1573 | assert(0 && "not implemented"); |
| 1574 | } |
| 1575 | Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1); |
| 1576 | break; |
| 1577 | |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 1578 | case ISD::FABS: |
| 1579 | case ISD::FNEG: |
| 1580 | Tmp1 = PromoteOp(Node->getOperand(0)); |
| 1581 | assert(Tmp1.getValueType() == NVT); |
| 1582 | Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1); |
| 1583 | // NOTE: we do not have to do any extra rounding here for |
| 1584 | // NoExcessFPPrecision, because we know the input will have the appropriate |
| 1585 | // precision, and these operations don't modify precision at all. |
| 1586 | break; |
| 1587 | |
Chris Lattner | da6ba87 | 2005-04-28 21:44:33 +0000 | [diff] [blame] | 1588 | case ISD::FSQRT: |
| 1589 | case ISD::FSIN: |
| 1590 | case ISD::FCOS: |
| 1591 | Tmp1 = PromoteOp(Node->getOperand(0)); |
| 1592 | assert(Tmp1.getValueType() == NVT); |
| 1593 | Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1); |
| 1594 | if(NoExcessFPPrecision) |
| 1595 | Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result, VT); |
| 1596 | break; |
| 1597 | |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1598 | case ISD::AND: |
| 1599 | case ISD::OR: |
| 1600 | case ISD::XOR: |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 1601 | case ISD::ADD: |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 1602 | case ISD::SUB: |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 1603 | case ISD::MUL: |
| 1604 | // The input may have strange things in the top bits of the registers, but |
| 1605 | // these operations don't care. They may have wierd bits going out, but |
| 1606 | // that too is okay if they are integer operations. |
| 1607 | Tmp1 = PromoteOp(Node->getOperand(0)); |
| 1608 | Tmp2 = PromoteOp(Node->getOperand(1)); |
| 1609 | assert(Tmp1.getValueType() == NVT && Tmp2.getValueType() == NVT); |
| 1610 | Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2); |
| 1611 | |
| 1612 | // However, if this is a floating point operation, they will give excess |
| 1613 | // precision that we may not be able to tolerate. If we DO allow excess |
| 1614 | // precision, just leave it, otherwise excise it. |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 1615 | // FIXME: Why would we need to round FP ops more than integer ones? |
| 1616 | // Is Round(Add(Add(A,B),C)) != Round(Add(Round(Add(A,B)), C)) |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 1617 | if (MVT::isFloatingPoint(NVT) && NoExcessFPPrecision) |
| 1618 | Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result, VT); |
| 1619 | break; |
| 1620 | |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 1621 | case ISD::SDIV: |
| 1622 | case ISD::SREM: |
| 1623 | // These operators require that their input be sign extended. |
| 1624 | Tmp1 = PromoteOp(Node->getOperand(0)); |
| 1625 | Tmp2 = PromoteOp(Node->getOperand(1)); |
| 1626 | if (MVT::isInteger(NVT)) { |
| 1627 | Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1, VT); |
Chris Lattner | ff3e50c | 2005-01-16 00:17:42 +0000 | [diff] [blame] | 1628 | Tmp2 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp2, VT); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 1629 | } |
| 1630 | Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2); |
| 1631 | |
| 1632 | // Perform FP_ROUND: this is probably overly pessimistic. |
| 1633 | if (MVT::isFloatingPoint(NVT) && NoExcessFPPrecision) |
| 1634 | Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result, VT); |
| 1635 | break; |
| 1636 | |
| 1637 | case ISD::UDIV: |
| 1638 | case ISD::UREM: |
| 1639 | // These operators require that their input be zero extended. |
| 1640 | Tmp1 = PromoteOp(Node->getOperand(0)); |
| 1641 | Tmp2 = PromoteOp(Node->getOperand(1)); |
| 1642 | assert(MVT::isInteger(NVT) && "Operators don't apply to FP!"); |
Chris Lattner | 2399356 | 2005-04-13 02:38:47 +0000 | [diff] [blame] | 1643 | Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT); |
| 1644 | Tmp2 = DAG.getZeroExtendInReg(Tmp2, VT); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 1645 | Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2); |
| 1646 | break; |
| 1647 | |
| 1648 | case ISD::SHL: |
| 1649 | Tmp1 = PromoteOp(Node->getOperand(0)); |
| 1650 | Tmp2 = LegalizeOp(Node->getOperand(1)); |
| 1651 | Result = DAG.getNode(ISD::SHL, NVT, Tmp1, Tmp2); |
| 1652 | break; |
| 1653 | case ISD::SRA: |
| 1654 | // The input value must be properly sign extended. |
| 1655 | Tmp1 = PromoteOp(Node->getOperand(0)); |
| 1656 | Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1, VT); |
| 1657 | Tmp2 = LegalizeOp(Node->getOperand(1)); |
| 1658 | Result = DAG.getNode(ISD::SRA, NVT, Tmp1, Tmp2); |
| 1659 | break; |
| 1660 | case ISD::SRL: |
| 1661 | // The input value must be properly zero extended. |
| 1662 | Tmp1 = PromoteOp(Node->getOperand(0)); |
Chris Lattner | 2399356 | 2005-04-13 02:38:47 +0000 | [diff] [blame] | 1663 | Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 1664 | Tmp2 = LegalizeOp(Node->getOperand(1)); |
| 1665 | Result = DAG.getNode(ISD::SRL, NVT, Tmp1, Tmp2); |
| 1666 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1667 | case ISD::LOAD: |
| 1668 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 1669 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer. |
Chris Lattner | 232ee95 | 2005-04-10 04:33:47 +0000 | [diff] [blame] | 1670 | // FIXME: When the DAG combiner exists, change this to use EXTLOAD! |
Chris Lattner | 6841dec | 2005-04-10 17:40:35 +0000 | [diff] [blame] | 1671 | if (MVT::isInteger(NVT)) |
Chris Lattner | 52d08bd | 2005-05-09 20:23:03 +0000 | [diff] [blame] | 1672 | Result = DAG.getNode(ISD::ZEXTLOAD, NVT, Tmp1, Tmp2, Node->getOperand(2), |
| 1673 | VT); |
Chris Lattner | 6841dec | 2005-04-10 17:40:35 +0000 | [diff] [blame] | 1674 | else |
Chris Lattner | 52d08bd | 2005-05-09 20:23:03 +0000 | [diff] [blame] | 1675 | Result = DAG.getNode(ISD::EXTLOAD, NVT, Tmp1, Tmp2, Node->getOperand(2), |
| 1676 | VT); |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1677 | |
| 1678 | // Remember that we legalized the chain. |
| 1679 | AddLegalizedOperand(Op.getValue(1), Result.getValue(1)); |
| 1680 | break; |
| 1681 | case ISD::SELECT: |
Chris Lattner | 47e9223 | 2005-01-18 19:27:06 +0000 | [diff] [blame] | 1682 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 1683 | case Expand: assert(0 && "It's impossible to expand bools"); |
| 1684 | case Legal: |
| 1685 | Tmp1 = LegalizeOp(Node->getOperand(0));// Legalize the condition. |
| 1686 | break; |
| 1687 | case Promote: |
| 1688 | Tmp1 = PromoteOp(Node->getOperand(0)); // Promote the condition. |
| 1689 | break; |
| 1690 | } |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1691 | Tmp2 = PromoteOp(Node->getOperand(1)); // Legalize the op0 |
| 1692 | Tmp3 = PromoteOp(Node->getOperand(2)); // Legalize the op1 |
| 1693 | Result = DAG.getNode(ISD::SELECT, NVT, Tmp1, Tmp2, Tmp3); |
| 1694 | break; |
Chris Lattner | d71c041 | 2005-05-13 18:43:43 +0000 | [diff] [blame] | 1695 | case ISD::TAILCALL: |
Chris Lattner | 8ac532c | 2005-01-16 19:46:48 +0000 | [diff] [blame] | 1696 | case ISD::CALL: { |
| 1697 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 1698 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the callee. |
| 1699 | |
Chris Lattner | 3d9dffc | 2005-01-19 20:24:35 +0000 | [diff] [blame] | 1700 | std::vector<SDOperand> Ops; |
| 1701 | for (unsigned i = 2, e = Node->getNumOperands(); i != e; ++i) |
| 1702 | Ops.push_back(LegalizeOp(Node->getOperand(i))); |
| 1703 | |
Chris Lattner | 8ac532c | 2005-01-16 19:46:48 +0000 | [diff] [blame] | 1704 | assert(Node->getNumValues() == 2 && Op.ResNo == 0 && |
| 1705 | "Can only promote single result calls"); |
| 1706 | std::vector<MVT::ValueType> RetTyVTs; |
| 1707 | RetTyVTs.reserve(2); |
| 1708 | RetTyVTs.push_back(NVT); |
| 1709 | RetTyVTs.push_back(MVT::Other); |
Chris Lattner | d71c041 | 2005-05-13 18:43:43 +0000 | [diff] [blame] | 1710 | SDNode *NC = DAG.getCall(RetTyVTs, Tmp1, Tmp2, Ops, |
| 1711 | Node->getOpcode() == ISD::TAILCALL); |
Chris Lattner | 8ac532c | 2005-01-16 19:46:48 +0000 | [diff] [blame] | 1712 | Result = SDOperand(NC, 0); |
| 1713 | |
| 1714 | // Insert the new chain mapping. |
| 1715 | AddLegalizedOperand(Op.getValue(1), Result.getValue(1)); |
| 1716 | break; |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 1717 | } |
Andrew Lenharth | fecf095 | 2005-05-04 19:11:05 +0000 | [diff] [blame] | 1718 | case ISD::CTPOP: |
| 1719 | case ISD::CTTZ: |
| 1720 | case ISD::CTLZ: |
| 1721 | Tmp1 = Node->getOperand(0); |
| 1722 | //Zero extend the argument |
| 1723 | Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1); |
| 1724 | // Perform the larger operation, then subtract if needed. |
| 1725 | Tmp1 = DAG.getNode(Node->getOpcode(), NVT, Tmp1); |
| 1726 | switch(Node->getOpcode()) |
| 1727 | { |
| 1728 | case ISD::CTPOP: |
| 1729 | Result = Tmp1; |
| 1730 | break; |
| 1731 | case ISD::CTTZ: |
| 1732 | //if Tmp1 == sizeinbits(NVT) then Tmp1 = sizeinbits(Old VT) |
| 1733 | Tmp2 = DAG.getSetCC(ISD::SETEQ, MVT::i1, Tmp1, |
| 1734 | DAG.getConstant(getSizeInBits(NVT), NVT)); |
| 1735 | Result = DAG.getNode(ISD::SELECT, NVT, Tmp2, |
| 1736 | DAG.getConstant(getSizeInBits(VT),NVT), Tmp1); |
| 1737 | break; |
| 1738 | case ISD::CTLZ: |
| 1739 | //Tmp1 = Tmp1 - (sizeinbits(NVT) - sizeinbits(Old VT)) |
| 1740 | Result = DAG.getNode(ISD::SUB, NVT, Tmp1, |
| 1741 | DAG.getConstant(getSizeInBits(NVT) - |
| 1742 | getSizeInBits(VT), NVT)); |
| 1743 | break; |
| 1744 | } |
| 1745 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1746 | } |
| 1747 | |
| 1748 | assert(Result.Val && "Didn't set a result!"); |
| 1749 | AddPromotedOperand(Op, Result); |
| 1750 | return Result; |
| 1751 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1752 | |
Chris Lattner | 84f6788 | 2005-01-20 18:52:28 +0000 | [diff] [blame] | 1753 | /// ExpandAddSub - Find a clever way to expand this add operation into |
| 1754 | /// subcomponents. |
Chris Lattner | 4759982 | 2005-04-02 03:38:53 +0000 | [diff] [blame] | 1755 | void SelectionDAGLegalize:: |
| 1756 | ExpandByParts(unsigned NodeOp, SDOperand LHS, SDOperand RHS, |
| 1757 | SDOperand &Lo, SDOperand &Hi) { |
Chris Lattner | 84f6788 | 2005-01-20 18:52:28 +0000 | [diff] [blame] | 1758 | // Expand the subcomponents. |
| 1759 | SDOperand LHSL, LHSH, RHSL, RHSH; |
| 1760 | ExpandOp(LHS, LHSL, LHSH); |
| 1761 | ExpandOp(RHS, RHSL, RHSH); |
| 1762 | |
Chris Lattner | bd0781e | 2005-04-11 20:29:59 +0000 | [diff] [blame] | 1763 | // FIXME: this should be moved to the dag combiner someday. |
| 1764 | if (NodeOp == ISD::ADD_PARTS || NodeOp == ISD::SUB_PARTS) |
| 1765 | if (LHSL.getValueType() == MVT::i32) { |
| 1766 | SDOperand LowEl; |
| 1767 | if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(LHSL)) |
| 1768 | if (C->getValue() == 0) |
| 1769 | LowEl = RHSL; |
| 1770 | if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(RHSL)) |
| 1771 | if (C->getValue() == 0) |
| 1772 | LowEl = LHSL; |
| 1773 | if (LowEl.Val) { |
| 1774 | // Turn this into an add/sub of the high part only. |
| 1775 | SDOperand HiEl = |
| 1776 | DAG.getNode(NodeOp == ISD::ADD_PARTS ? ISD::ADD : ISD::SUB, |
| 1777 | LowEl.getValueType(), LHSH, RHSH); |
| 1778 | Lo = LowEl; |
| 1779 | Hi = HiEl; |
| 1780 | return; |
| 1781 | } |
| 1782 | } |
| 1783 | |
Chris Lattner | 84f6788 | 2005-01-20 18:52:28 +0000 | [diff] [blame] | 1784 | std::vector<SDOperand> Ops; |
| 1785 | Ops.push_back(LHSL); |
| 1786 | Ops.push_back(LHSH); |
| 1787 | Ops.push_back(RHSL); |
| 1788 | Ops.push_back(RHSH); |
Chris Lattner | 4759982 | 2005-04-02 03:38:53 +0000 | [diff] [blame] | 1789 | Lo = DAG.getNode(NodeOp, LHSL.getValueType(), Ops); |
Chris Lattner | 84f6788 | 2005-01-20 18:52:28 +0000 | [diff] [blame] | 1790 | Hi = Lo.getValue(1); |
| 1791 | } |
| 1792 | |
Chris Lattner | 5b359c6 | 2005-04-02 04:00:59 +0000 | [diff] [blame] | 1793 | void SelectionDAGLegalize::ExpandShiftParts(unsigned NodeOp, |
| 1794 | SDOperand Op, SDOperand Amt, |
| 1795 | SDOperand &Lo, SDOperand &Hi) { |
| 1796 | // Expand the subcomponents. |
| 1797 | SDOperand LHSL, LHSH; |
| 1798 | ExpandOp(Op, LHSL, LHSH); |
| 1799 | |
| 1800 | std::vector<SDOperand> Ops; |
| 1801 | Ops.push_back(LHSL); |
| 1802 | Ops.push_back(LHSH); |
| 1803 | Ops.push_back(Amt); |
| 1804 | Lo = DAG.getNode(NodeOp, LHSL.getValueType(), Ops); |
| 1805 | Hi = Lo.getValue(1); |
| 1806 | } |
| 1807 | |
| 1808 | |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 1809 | /// ExpandShift - Try to find a clever way to expand this shift operation out to |
| 1810 | /// smaller elements. If we can't find a way that is more efficient than a |
| 1811 | /// libcall on this target, return false. Otherwise, return true with the |
| 1812 | /// low-parts expanded into Lo and Hi. |
| 1813 | bool SelectionDAGLegalize::ExpandShift(unsigned Opc, SDOperand Op,SDOperand Amt, |
| 1814 | SDOperand &Lo, SDOperand &Hi) { |
| 1815 | assert((Opc == ISD::SHL || Opc == ISD::SRA || Opc == ISD::SRL) && |
| 1816 | "This is not a shift!"); |
Nate Begeman | f1fe32e | 2005-04-06 21:13:14 +0000 | [diff] [blame] | 1817 | |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 1818 | MVT::ValueType NVT = TLI.getTypeToTransformTo(Op.getValueType()); |
Nate Begeman | f1fe32e | 2005-04-06 21:13:14 +0000 | [diff] [blame] | 1819 | SDOperand ShAmt = LegalizeOp(Amt); |
| 1820 | MVT::ValueType ShTy = ShAmt.getValueType(); |
| 1821 | unsigned VTBits = MVT::getSizeInBits(Op.getValueType()); |
| 1822 | unsigned NVTBits = MVT::getSizeInBits(NVT); |
| 1823 | |
| 1824 | // Handle the case when Amt is an immediate. Other cases are currently broken |
| 1825 | // and are disabled. |
| 1826 | if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(Amt.Val)) { |
| 1827 | unsigned Cst = CN->getValue(); |
| 1828 | // Expand the incoming operand to be shifted, so that we have its parts |
| 1829 | SDOperand InL, InH; |
| 1830 | ExpandOp(Op, InL, InH); |
| 1831 | switch(Opc) { |
| 1832 | case ISD::SHL: |
| 1833 | if (Cst > VTBits) { |
| 1834 | Lo = DAG.getConstant(0, NVT); |
| 1835 | Hi = DAG.getConstant(0, NVT); |
| 1836 | } else if (Cst > NVTBits) { |
| 1837 | Lo = DAG.getConstant(0, NVT); |
| 1838 | Hi = DAG.getNode(ISD::SHL, NVT, InL, DAG.getConstant(Cst-NVTBits,ShTy)); |
Chris Lattner | ee27f57 | 2005-04-11 20:08:52 +0000 | [diff] [blame] | 1839 | } else if (Cst == NVTBits) { |
| 1840 | Lo = DAG.getConstant(0, NVT); |
| 1841 | Hi = InL; |
Nate Begeman | f1fe32e | 2005-04-06 21:13:14 +0000 | [diff] [blame] | 1842 | } else { |
| 1843 | Lo = DAG.getNode(ISD::SHL, NVT, InL, DAG.getConstant(Cst, ShTy)); |
| 1844 | Hi = DAG.getNode(ISD::OR, NVT, |
| 1845 | DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(Cst, ShTy)), |
| 1846 | DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(NVTBits-Cst, ShTy))); |
| 1847 | } |
| 1848 | return true; |
| 1849 | case ISD::SRL: |
| 1850 | if (Cst > VTBits) { |
| 1851 | Lo = DAG.getConstant(0, NVT); |
| 1852 | Hi = DAG.getConstant(0, NVT); |
| 1853 | } else if (Cst > NVTBits) { |
| 1854 | Lo = DAG.getNode(ISD::SRL, NVT, InH, DAG.getConstant(Cst-NVTBits,ShTy)); |
| 1855 | Hi = DAG.getConstant(0, NVT); |
Chris Lattner | ee27f57 | 2005-04-11 20:08:52 +0000 | [diff] [blame] | 1856 | } else if (Cst == NVTBits) { |
| 1857 | Lo = InH; |
| 1858 | Hi = DAG.getConstant(0, NVT); |
Nate Begeman | f1fe32e | 2005-04-06 21:13:14 +0000 | [diff] [blame] | 1859 | } else { |
| 1860 | Lo = DAG.getNode(ISD::OR, NVT, |
| 1861 | DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(Cst, ShTy)), |
| 1862 | DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(NVTBits-Cst, ShTy))); |
| 1863 | Hi = DAG.getNode(ISD::SRL, NVT, InH, DAG.getConstant(Cst, ShTy)); |
| 1864 | } |
| 1865 | return true; |
| 1866 | case ISD::SRA: |
| 1867 | if (Cst > VTBits) { |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 1868 | Hi = Lo = DAG.getNode(ISD::SRA, NVT, InH, |
Nate Begeman | f1fe32e | 2005-04-06 21:13:14 +0000 | [diff] [blame] | 1869 | DAG.getConstant(NVTBits-1, ShTy)); |
| 1870 | } else if (Cst > NVTBits) { |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 1871 | Lo = DAG.getNode(ISD::SRA, NVT, InH, |
Nate Begeman | f1fe32e | 2005-04-06 21:13:14 +0000 | [diff] [blame] | 1872 | DAG.getConstant(Cst-NVTBits, ShTy)); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 1873 | Hi = DAG.getNode(ISD::SRA, NVT, InH, |
Nate Begeman | f1fe32e | 2005-04-06 21:13:14 +0000 | [diff] [blame] | 1874 | DAG.getConstant(NVTBits-1, ShTy)); |
Chris Lattner | ee27f57 | 2005-04-11 20:08:52 +0000 | [diff] [blame] | 1875 | } else if (Cst == NVTBits) { |
| 1876 | Lo = InH; |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 1877 | Hi = DAG.getNode(ISD::SRA, NVT, InH, |
Chris Lattner | ee27f57 | 2005-04-11 20:08:52 +0000 | [diff] [blame] | 1878 | DAG.getConstant(NVTBits-1, ShTy)); |
Nate Begeman | f1fe32e | 2005-04-06 21:13:14 +0000 | [diff] [blame] | 1879 | } else { |
| 1880 | Lo = DAG.getNode(ISD::OR, NVT, |
| 1881 | DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(Cst, ShTy)), |
| 1882 | DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(NVTBits-Cst, ShTy))); |
| 1883 | Hi = DAG.getNode(ISD::SRA, NVT, InH, DAG.getConstant(Cst, ShTy)); |
| 1884 | } |
| 1885 | return true; |
| 1886 | } |
| 1887 | } |
| 1888 | // FIXME: The following code for expanding shifts using ISD::SELECT is buggy, |
| 1889 | // so disable it for now. Currently targets are handling this via SHL_PARTS |
| 1890 | // and friends. |
| 1891 | return false; |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 1892 | |
| 1893 | // If we have an efficient select operation (or if the selects will all fold |
| 1894 | // away), lower to some complex code, otherwise just emit the libcall. |
| 1895 | if (TLI.getOperationAction(ISD::SELECT, NVT) != TargetLowering::Legal && |
| 1896 | !isa<ConstantSDNode>(Amt)) |
| 1897 | return false; |
| 1898 | |
| 1899 | SDOperand InL, InH; |
| 1900 | ExpandOp(Op, InL, InH); |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 1901 | SDOperand NAmt = DAG.getNode(ISD::SUB, ShTy, // NAmt = 32-ShAmt |
| 1902 | DAG.getConstant(NVTBits, ShTy), ShAmt); |
| 1903 | |
Chris Lattner | e5544f8 | 2005-01-20 20:29:23 +0000 | [diff] [blame] | 1904 | // Compare the unmasked shift amount against 32. |
| 1905 | SDOperand Cond = DAG.getSetCC(ISD::SETGE, TLI.getSetCCResultTy(), ShAmt, |
| 1906 | DAG.getConstant(NVTBits, ShTy)); |
| 1907 | |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 1908 | if (TLI.getShiftAmountFlavor() != TargetLowering::Mask) { |
| 1909 | ShAmt = DAG.getNode(ISD::AND, ShTy, ShAmt, // ShAmt &= 31 |
| 1910 | DAG.getConstant(NVTBits-1, ShTy)); |
| 1911 | NAmt = DAG.getNode(ISD::AND, ShTy, NAmt, // NAmt &= 31 |
| 1912 | DAG.getConstant(NVTBits-1, ShTy)); |
| 1913 | } |
| 1914 | |
| 1915 | if (Opc == ISD::SHL) { |
| 1916 | SDOperand T1 = DAG.getNode(ISD::OR, NVT,// T1 = (Hi << Amt) | (Lo >> NAmt) |
| 1917 | DAG.getNode(ISD::SHL, NVT, InH, ShAmt), |
| 1918 | DAG.getNode(ISD::SRL, NVT, InL, NAmt)); |
Chris Lattner | e5544f8 | 2005-01-20 20:29:23 +0000 | [diff] [blame] | 1919 | SDOperand T2 = DAG.getNode(ISD::SHL, NVT, InL, ShAmt); // T2 = Lo << Amt&31 |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 1920 | |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 1921 | Hi = DAG.getNode(ISD::SELECT, NVT, Cond, T2, T1); |
| 1922 | Lo = DAG.getNode(ISD::SELECT, NVT, Cond, DAG.getConstant(0, NVT), T2); |
| 1923 | } else { |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 1924 | SDOperand HiLoPart = DAG.getNode(ISD::SELECT, NVT, |
| 1925 | DAG.getSetCC(ISD::SETEQ, |
| 1926 | TLI.getSetCCResultTy(), NAmt, |
| 1927 | DAG.getConstant(32, ShTy)), |
| 1928 | DAG.getConstant(0, NVT), |
| 1929 | DAG.getNode(ISD::SHL, NVT, InH, NAmt)); |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 1930 | SDOperand T1 = DAG.getNode(ISD::OR, NVT,// T1 = (Hi << NAmt) | (Lo >> Amt) |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 1931 | HiLoPart, |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 1932 | DAG.getNode(ISD::SRL, NVT, InL, ShAmt)); |
Chris Lattner | e5544f8 | 2005-01-20 20:29:23 +0000 | [diff] [blame] | 1933 | SDOperand T2 = DAG.getNode(Opc, NVT, InH, ShAmt); // T2 = InH >> ShAmt&31 |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 1934 | |
| 1935 | SDOperand HiPart; |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 1936 | if (Opc == ISD::SRA) |
| 1937 | HiPart = DAG.getNode(ISD::SRA, NVT, InH, |
| 1938 | DAG.getConstant(NVTBits-1, ShTy)); |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 1939 | else |
| 1940 | HiPart = DAG.getConstant(0, NVT); |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 1941 | Lo = DAG.getNode(ISD::SELECT, NVT, Cond, T2, T1); |
Chris Lattner | e5544f8 | 2005-01-20 20:29:23 +0000 | [diff] [blame] | 1942 | Hi = DAG.getNode(ISD::SELECT, NVT, Cond, HiPart, T2); |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 1943 | } |
| 1944 | return true; |
| 1945 | } |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 1946 | |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 1947 | /// FindLatestCallSeqStart - Scan up the dag to find the latest (highest |
| 1948 | /// NodeDepth) node that is an CallSeqStart operation and occurs later than |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 1949 | /// Found. |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 1950 | static void FindLatestCallSeqStart(SDNode *Node, SDNode *&Found) { |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 1951 | if (Node->getNodeDepth() <= Found->getNodeDepth()) return; |
| 1952 | |
Chris Lattner | 16cd04d | 2005-05-12 23:24:06 +0000 | [diff] [blame] | 1953 | // If we found an CALLSEQ_START, we already know this node occurs later |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 1954 | // than the Found node. Just remember this node and return. |
Chris Lattner | 16cd04d | 2005-05-12 23:24:06 +0000 | [diff] [blame] | 1955 | if (Node->getOpcode() == ISD::CALLSEQ_START) { |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 1956 | Found = Node; |
| 1957 | return; |
| 1958 | } |
| 1959 | |
| 1960 | // Otherwise, scan the operands of Node to see if any of them is a call. |
| 1961 | assert(Node->getNumOperands() != 0 && |
| 1962 | "All leaves should have depth equal to the entry node!"); |
| 1963 | for (unsigned i = 0, e = Node->getNumOperands()-1; i != e; ++i) |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 1964 | FindLatestCallSeqStart(Node->getOperand(i).Val, Found); |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 1965 | |
| 1966 | // Tail recurse for the last iteration. |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 1967 | FindLatestCallSeqStart(Node->getOperand(Node->getNumOperands()-1).Val, |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 1968 | Found); |
| 1969 | } |
| 1970 | |
| 1971 | |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 1972 | /// FindEarliestCallSeqEnd - Scan down the dag to find the earliest (lowest |
| 1973 | /// NodeDepth) node that is an CallSeqEnd operation and occurs more recent |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 1974 | /// than Found. |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 1975 | static void FindEarliestCallSeqEnd(SDNode *Node, SDNode *&Found) { |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 1976 | if (Found && Node->getNodeDepth() >= Found->getNodeDepth()) return; |
| 1977 | |
Chris Lattner | 16cd04d | 2005-05-12 23:24:06 +0000 | [diff] [blame] | 1978 | // If we found an CALLSEQ_END, we already know this node occurs earlier |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 1979 | // than the Found node. Just remember this node and return. |
Chris Lattner | 16cd04d | 2005-05-12 23:24:06 +0000 | [diff] [blame] | 1980 | if (Node->getOpcode() == ISD::CALLSEQ_END) { |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 1981 | Found = Node; |
| 1982 | return; |
| 1983 | } |
| 1984 | |
| 1985 | // Otherwise, scan the operands of Node to see if any of them is a call. |
| 1986 | SDNode::use_iterator UI = Node->use_begin(), E = Node->use_end(); |
| 1987 | if (UI == E) return; |
| 1988 | for (--E; UI != E; ++UI) |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 1989 | FindEarliestCallSeqEnd(*UI, Found); |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 1990 | |
| 1991 | // Tail recurse for the last iteration. |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 1992 | FindEarliestCallSeqEnd(*UI, Found); |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 1993 | } |
| 1994 | |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 1995 | /// FindCallSeqEnd - Given a chained node that is part of a call sequence, |
Chris Lattner | 16cd04d | 2005-05-12 23:24:06 +0000 | [diff] [blame] | 1996 | /// find the CALLSEQ_END node that terminates the call sequence. |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 1997 | static SDNode *FindCallSeqEnd(SDNode *Node) { |
Chris Lattner | 16cd04d | 2005-05-12 23:24:06 +0000 | [diff] [blame] | 1998 | if (Node->getOpcode() == ISD::CALLSEQ_END) |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 1999 | return Node; |
Chris Lattner | f4b4579 | 2005-04-02 03:22:40 +0000 | [diff] [blame] | 2000 | if (Node->use_empty()) |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 2001 | return 0; // No CallSeqEnd |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 2002 | |
| 2003 | if (Node->hasOneUse()) // Simple case, only has one user to check. |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 2004 | return FindCallSeqEnd(*Node->use_begin()); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 2005 | |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 2006 | SDOperand TheChain(Node, Node->getNumValues()-1); |
| 2007 | assert(TheChain.getValueType() == MVT::Other && "Is not a token chain!"); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 2008 | |
| 2009 | for (SDNode::use_iterator UI = Node->use_begin(), |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 2010 | E = Node->use_end(); ; ++UI) { |
Chris Lattner | 16cd04d | 2005-05-12 23:24:06 +0000 | [diff] [blame] | 2011 | assert(UI != E && "Didn't find a user of the tokchain, no CALLSEQ_END!"); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 2012 | |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 2013 | // Make sure to only follow users of our token chain. |
| 2014 | SDNode *User = *UI; |
| 2015 | for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i) |
| 2016 | if (User->getOperand(i) == TheChain) |
Chris Lattner | eb516e7 | 2005-05-13 05:17:00 +0000 | [diff] [blame] | 2017 | if (SDNode *Result = FindCallSeqEnd(User)) |
| 2018 | return Result; |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 2019 | } |
| 2020 | assert(0 && "Unreachable"); |
| 2021 | abort(); |
| 2022 | } |
| 2023 | |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 2024 | /// FindCallSeqStart - Given a chained node that is part of a call sequence, |
Chris Lattner | 16cd04d | 2005-05-12 23:24:06 +0000 | [diff] [blame] | 2025 | /// find the CALLSEQ_START node that initiates the call sequence. |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 2026 | static SDNode *FindCallSeqStart(SDNode *Node) { |
| 2027 | assert(Node && "Didn't find callseq_start for a call??"); |
Chris Lattner | 16cd04d | 2005-05-12 23:24:06 +0000 | [diff] [blame] | 2028 | if (Node->getOpcode() == ISD::CALLSEQ_START) return Node; |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 2029 | |
| 2030 | assert(Node->getOperand(0).getValueType() == MVT::Other && |
| 2031 | "Node doesn't have a token chain argument!"); |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 2032 | return FindCallSeqStart(Node->getOperand(0).Val); |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 2033 | } |
| 2034 | |
| 2035 | |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 2036 | /// FindInputOutputChains - If we are replacing an operation with a call we need |
| 2037 | /// to find the call that occurs before and the call that occurs after it to |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 2038 | /// properly serialize the calls in the block. The returned operand is the |
| 2039 | /// input chain value for the new call (e.g. the entry node or the previous |
| 2040 | /// call), and OutChain is set to be the chain node to update to point to the |
| 2041 | /// end of the call chain. |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 2042 | static SDOperand FindInputOutputChains(SDNode *OpNode, SDNode *&OutChain, |
| 2043 | SDOperand Entry) { |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 2044 | SDNode *LatestCallSeqStart = Entry.Val; |
| 2045 | SDNode *LatestCallSeqEnd = 0; |
| 2046 | FindLatestCallSeqStart(OpNode, LatestCallSeqStart); |
| 2047 | //std::cerr<<"Found node: "; LatestCallSeqStart->dump(); std::cerr <<"\n"; |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 2048 | |
Chris Lattner | 16cd04d | 2005-05-12 23:24:06 +0000 | [diff] [blame] | 2049 | // It is possible that no ISD::CALLSEQ_START was found because there is no |
Nate Begeman | c7c1657 | 2005-04-11 03:01:51 +0000 | [diff] [blame] | 2050 | // previous call in the function. LatestCallStackDown may in that case be |
Chris Lattner | 16cd04d | 2005-05-12 23:24:06 +0000 | [diff] [blame] | 2051 | // the entry node itself. Do not attempt to find a matching CALLSEQ_END |
| 2052 | // unless LatestCallStackDown is an CALLSEQ_START. |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 2053 | if (LatestCallSeqStart->getOpcode() == ISD::CALLSEQ_START) |
| 2054 | LatestCallSeqEnd = FindCallSeqEnd(LatestCallSeqStart); |
Nate Begeman | c7c1657 | 2005-04-11 03:01:51 +0000 | [diff] [blame] | 2055 | else |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 2056 | LatestCallSeqEnd = Entry.Val; |
| 2057 | assert(LatestCallSeqEnd && "NULL return from FindCallSeqEnd"); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 2058 | |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 2059 | // Finally, find the first call that this must come before, first we find the |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 2060 | // CallSeqEnd that ends the call. |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 2061 | OutChain = 0; |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 2062 | FindEarliestCallSeqEnd(OpNode, OutChain); |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 2063 | |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 2064 | // If we found one, translate from the adj up to the callseq_start. |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 2065 | if (OutChain) |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 2066 | OutChain = FindCallSeqStart(OutChain); |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 2067 | |
Chris Lattner | 9530ddc | 2005-05-13 05:09:11 +0000 | [diff] [blame] | 2068 | return SDOperand(LatestCallSeqEnd, 0); |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 2069 | } |
| 2070 | |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 2071 | /// SpliceCallInto - Given the result chain of a libcall (CallResult), and a |
Chris Lattner | b9fa3bc | 2005-05-12 04:49:08 +0000 | [diff] [blame] | 2072 | void SelectionDAGLegalize::SpliceCallInto(const SDOperand &CallResult, |
| 2073 | SDNode *OutChain) { |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 2074 | // Nothing to splice it into? |
| 2075 | if (OutChain == 0) return; |
| 2076 | |
| 2077 | assert(OutChain->getOperand(0).getValueType() == MVT::Other); |
| 2078 | //OutChain->dump(); |
| 2079 | |
| 2080 | // Form a token factor node merging the old inval and the new inval. |
| 2081 | SDOperand InToken = DAG.getNode(ISD::TokenFactor, MVT::Other, CallResult, |
| 2082 | OutChain->getOperand(0)); |
| 2083 | // Change the node to refer to the new token. |
| 2084 | OutChain->setAdjCallChain(InToken); |
| 2085 | } |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 2086 | |
| 2087 | |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2088 | // ExpandLibCall - Expand a node into a call to a libcall. If the result value |
| 2089 | // does not fit into a register, return the lo part and set the hi part to the |
| 2090 | // by-reg argument. If it does fit into a single register, return the result |
| 2091 | // and leave the Hi part unset. |
| 2092 | SDOperand SelectionDAGLegalize::ExpandLibCall(const char *Name, SDNode *Node, |
| 2093 | SDOperand &Hi) { |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 2094 | SDNode *OutChain; |
| 2095 | SDOperand InChain = FindInputOutputChains(Node, OutChain, |
| 2096 | DAG.getEntryNode()); |
Chris Lattner | f4b4579 | 2005-04-02 03:22:40 +0000 | [diff] [blame] | 2097 | if (InChain.Val == 0) |
| 2098 | InChain = DAG.getEntryNode(); |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 2099 | |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2100 | TargetLowering::ArgListTy Args; |
| 2101 | for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) { |
| 2102 | MVT::ValueType ArgVT = Node->getOperand(i).getValueType(); |
| 2103 | const Type *ArgTy = MVT::getTypeForValueType(ArgVT); |
| 2104 | Args.push_back(std::make_pair(Node->getOperand(i), ArgTy)); |
| 2105 | } |
| 2106 | SDOperand Callee = DAG.getExternalSymbol(Name, TLI.getPointerTy()); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 2107 | |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 2108 | // Splice the libcall in wherever FindInputOutputChains tells us to. |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2109 | const Type *RetTy = MVT::getTypeForValueType(Node->getValueType(0)); |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 2110 | std::pair<SDOperand,SDOperand> CallInfo = |
Chris Lattner | adf6a96 | 2005-05-13 18:50:42 +0000 | [diff] [blame^] | 2111 | TLI.LowerCallTo(InChain, RetTy, false, CallingConv::C, false, |
| 2112 | Callee, Args, DAG); |
Chris Lattner | b9fa3bc | 2005-05-12 04:49:08 +0000 | [diff] [blame] | 2113 | SpliceCallInto(CallInfo.second, OutChain); |
| 2114 | |
| 2115 | NeedsAnotherIteration = true; |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 2116 | |
| 2117 | switch (getTypeAction(CallInfo.first.getValueType())) { |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2118 | default: assert(0 && "Unknown thing"); |
| 2119 | case Legal: |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 2120 | return CallInfo.first; |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2121 | case Promote: |
| 2122 | assert(0 && "Cannot promote this yet!"); |
| 2123 | case Expand: |
| 2124 | SDOperand Lo; |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 2125 | ExpandOp(CallInfo.first, Lo, Hi); |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2126 | return Lo; |
| 2127 | } |
| 2128 | } |
| 2129 | |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 2130 | |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2131 | /// ExpandIntToFP - Expand a [US]INT_TO_FP operation, assuming that the |
| 2132 | /// destination type is legal. |
| 2133 | SDOperand SelectionDAGLegalize:: |
| 2134 | ExpandIntToFP(bool isSigned, MVT::ValueType DestTy, SDOperand Source) { |
| 2135 | assert(getTypeAction(DestTy) == Legal && "Destination type is not legal!"); |
| 2136 | assert(getTypeAction(Source.getValueType()) == Expand && |
| 2137 | "This is not an expansion!"); |
| 2138 | assert(Source.getValueType() == MVT::i64 && "Only handle expand from i64!"); |
| 2139 | |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 2140 | if (!isSigned) { |
Chris Lattner | e9c35e7 | 2005-04-13 05:09:42 +0000 | [diff] [blame] | 2141 | assert(Source.getValueType() == MVT::i64 && |
| 2142 | "This only works for 64-bit -> FP"); |
| 2143 | // The 64-bit value loaded will be incorrectly if the 'sign bit' of the |
| 2144 | // incoming integer is set. To handle this, we dynamically test to see if |
| 2145 | // it is set, and, if so, add a fudge factor. |
| 2146 | SDOperand Lo, Hi; |
| 2147 | ExpandOp(Source, Lo, Hi); |
| 2148 | |
Chris Lattner | 66de05b | 2005-05-13 04:45:13 +0000 | [diff] [blame] | 2149 | // If this is unsigned, and not supported, first perform the conversion to |
| 2150 | // signed, then adjust the result if the sign bit is set. |
| 2151 | SDOperand SignedConv = ExpandIntToFP(true, DestTy, |
| 2152 | DAG.getNode(ISD::BUILD_PAIR, Source.getValueType(), Lo, Hi)); |
| 2153 | |
Chris Lattner | e9c35e7 | 2005-04-13 05:09:42 +0000 | [diff] [blame] | 2154 | SDOperand SignSet = DAG.getSetCC(ISD::SETLT, TLI.getSetCCResultTy(), Hi, |
| 2155 | DAG.getConstant(0, Hi.getValueType())); |
| 2156 | SDOperand Zero = getIntPtrConstant(0), Four = getIntPtrConstant(4); |
| 2157 | SDOperand CstOffset = DAG.getNode(ISD::SELECT, Zero.getValueType(), |
| 2158 | SignSet, Four, Zero); |
Chris Lattner | 383203b | 2005-05-12 18:52:34 +0000 | [diff] [blame] | 2159 | uint64_t FF = 0x5f800000ULL; |
| 2160 | if (TLI.isLittleEndian()) FF <<= 32; |
| 2161 | static Constant *FudgeFactor = ConstantUInt::get(Type::ULongTy, FF); |
Chris Lattner | e9c35e7 | 2005-04-13 05:09:42 +0000 | [diff] [blame] | 2162 | |
| 2163 | MachineConstantPool *CP = DAG.getMachineFunction().getConstantPool(); |
| 2164 | SDOperand CPIdx = DAG.getConstantPool(CP->getConstantPoolIndex(FudgeFactor), |
| 2165 | TLI.getPointerTy()); |
| 2166 | CPIdx = DAG.getNode(ISD::ADD, TLI.getPointerTy(), CPIdx, CstOffset); |
| 2167 | SDOperand FudgeInReg; |
| 2168 | if (DestTy == MVT::f32) |
Chris Lattner | 52d08bd | 2005-05-09 20:23:03 +0000 | [diff] [blame] | 2169 | FudgeInReg = DAG.getLoad(MVT::f32, DAG.getEntryNode(), CPIdx, |
| 2170 | DAG.getSrcValue(NULL)); |
Chris Lattner | e9c35e7 | 2005-04-13 05:09:42 +0000 | [diff] [blame] | 2171 | else { |
| 2172 | assert(DestTy == MVT::f64 && "Unexpected conversion"); |
| 2173 | FudgeInReg = DAG.getNode(ISD::EXTLOAD, MVT::f64, DAG.getEntryNode(), |
Andrew Lenharth | 2d86ea2 | 2005-04-27 20:10:01 +0000 | [diff] [blame] | 2174 | CPIdx, DAG.getSrcValue(NULL), MVT::f32); |
Chris Lattner | e9c35e7 | 2005-04-13 05:09:42 +0000 | [diff] [blame] | 2175 | } |
| 2176 | return DAG.getNode(ISD::ADD, DestTy, SignedConv, FudgeInReg); |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2177 | } |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 2178 | |
Chris Lattner | 13689e2 | 2005-05-12 07:00:44 +0000 | [diff] [blame] | 2179 | // Expand the source, then glue it back together for the call. We must expand |
| 2180 | // the source in case it is shared (this pass of legalize must traverse it). |
| 2181 | SDOperand SrcLo, SrcHi; |
| 2182 | ExpandOp(Source, SrcLo, SrcHi); |
| 2183 | Source = DAG.getNode(ISD::BUILD_PAIR, Source.getValueType(), SrcLo, SrcHi); |
| 2184 | |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 2185 | SDNode *OutChain = 0; |
| 2186 | SDOperand InChain = FindInputOutputChains(Source.Val, OutChain, |
| 2187 | DAG.getEntryNode()); |
| 2188 | const char *FnName = 0; |
| 2189 | if (DestTy == MVT::f32) |
| 2190 | FnName = "__floatdisf"; |
| 2191 | else { |
| 2192 | assert(DestTy == MVT::f64 && "Unknown fp value type!"); |
| 2193 | FnName = "__floatdidf"; |
| 2194 | } |
| 2195 | |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2196 | SDOperand Callee = DAG.getExternalSymbol(FnName, TLI.getPointerTy()); |
| 2197 | |
| 2198 | TargetLowering::ArgListTy Args; |
| 2199 | const Type *ArgTy = MVT::getTypeForValueType(Source.getValueType()); |
Chris Lattner | 44d105b | 2005-05-12 06:54:21 +0000 | [diff] [blame] | 2200 | |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2201 | Args.push_back(std::make_pair(Source, ArgTy)); |
| 2202 | |
| 2203 | // We don't care about token chains for libcalls. We just use the entry |
| 2204 | // node as our input and ignore the output chain. This allows us to place |
| 2205 | // calls wherever we need them to satisfy data dependences. |
| 2206 | const Type *RetTy = MVT::getTypeForValueType(DestTy); |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 2207 | |
| 2208 | std::pair<SDOperand,SDOperand> CallResult = |
Chris Lattner | adf6a96 | 2005-05-13 18:50:42 +0000 | [diff] [blame^] | 2209 | TLI.LowerCallTo(InChain, RetTy, false, CallingConv::C, true, |
| 2210 | Callee, Args, DAG); |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 2211 | |
Chris Lattner | b9fa3bc | 2005-05-12 04:49:08 +0000 | [diff] [blame] | 2212 | SpliceCallInto(CallResult.second, OutChain); |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 2213 | return CallResult.first; |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2214 | } |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 2215 | |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 2216 | |
| 2217 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2218 | /// ExpandOp - Expand the specified SDOperand into its two component pieces |
| 2219 | /// Lo&Hi. Note that the Op MUST be an expanded type. As a result of this, the |
| 2220 | /// LegalizeNodes map is filled in for any results that are not expanded, the |
| 2221 | /// ExpandedNodes map is filled in for any results that are expanded, and the |
| 2222 | /// Lo/Hi values are returned. |
| 2223 | void SelectionDAGLegalize::ExpandOp(SDOperand Op, SDOperand &Lo, SDOperand &Hi){ |
| 2224 | MVT::ValueType VT = Op.getValueType(); |
Chris Lattner | 71c42a0 | 2005-01-16 01:11:45 +0000 | [diff] [blame] | 2225 | MVT::ValueType NVT = TLI.getTypeToTransformTo(VT); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2226 | SDNode *Node = Op.Val; |
| 2227 | assert(getTypeAction(VT) == Expand && "Not an expanded type!"); |
| 2228 | assert(MVT::isInteger(VT) && "Cannot expand FP values!"); |
| 2229 | assert(MVT::isInteger(NVT) && NVT < VT && |
| 2230 | "Cannot expand to FP value or to larger int value!"); |
| 2231 | |
| 2232 | // If there is more than one use of this, see if we already expanded it. |
| 2233 | // There is no use remembering values that only have a single use, as the map |
| 2234 | // entries will never be reused. |
| 2235 | if (!Node->hasOneUse()) { |
| 2236 | std::map<SDOperand, std::pair<SDOperand, SDOperand> >::iterator I |
| 2237 | = ExpandedNodes.find(Op); |
| 2238 | if (I != ExpandedNodes.end()) { |
| 2239 | Lo = I->second.first; |
| 2240 | Hi = I->second.second; |
| 2241 | return; |
| 2242 | } |
Chris Lattner | 45982da | 2005-05-12 16:53:42 +0000 | [diff] [blame] | 2243 | } else { |
| 2244 | assert(!ExpandedNodes.count(Op) && "Re-expanding a node!"); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2245 | } |
| 2246 | |
Chris Lattner | 4e6c746 | 2005-01-08 19:27:05 +0000 | [diff] [blame] | 2247 | // Expanding to multiple registers needs to perform an optimization step, and |
| 2248 | // is not careful to avoid operations the target does not support. Make sure |
| 2249 | // that all generated operations are legalized in the next iteration. |
| 2250 | NeedsAnotherIteration = true; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2251 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2252 | switch (Node->getOpcode()) { |
| 2253 | default: |
| 2254 | std::cerr << "NODE: "; Node->dump(); std::cerr << "\n"; |
| 2255 | assert(0 && "Do not know how to expand this operator!"); |
| 2256 | abort(); |
Nate Begeman | fc1b1da | 2005-04-01 22:34:39 +0000 | [diff] [blame] | 2257 | case ISD::UNDEF: |
| 2258 | Lo = DAG.getNode(ISD::UNDEF, NVT); |
| 2259 | Hi = DAG.getNode(ISD::UNDEF, NVT); |
| 2260 | break; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2261 | case ISD::Constant: { |
| 2262 | uint64_t Cst = cast<ConstantSDNode>(Node)->getValue(); |
| 2263 | Lo = DAG.getConstant(Cst, NVT); |
| 2264 | Hi = DAG.getConstant(Cst >> MVT::getSizeInBits(NVT), NVT); |
| 2265 | break; |
| 2266 | } |
| 2267 | |
| 2268 | case ISD::CopyFromReg: { |
Chris Lattner | 18c2f13 | 2005-01-13 20:50:02 +0000 | [diff] [blame] | 2269 | unsigned Reg = cast<RegSDNode>(Node)->getReg(); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2270 | // Aggregate register values are always in consequtive pairs. |
Chris Lattner | 69a5215 | 2005-01-14 22:38:01 +0000 | [diff] [blame] | 2271 | Lo = DAG.getCopyFromReg(Reg, NVT, Node->getOperand(0)); |
| 2272 | Hi = DAG.getCopyFromReg(Reg+1, NVT, Lo.getValue(1)); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 2273 | |
Chris Lattner | 69a5215 | 2005-01-14 22:38:01 +0000 | [diff] [blame] | 2274 | // Remember that we legalized the chain. |
| 2275 | AddLegalizedOperand(Op.getValue(1), Hi.getValue(1)); |
| 2276 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2277 | assert(isTypeLegal(NVT) && "Cannot expand this multiple times yet!"); |
| 2278 | break; |
| 2279 | } |
| 2280 | |
Chris Lattner | d4e50bb | 2005-03-28 22:03:13 +0000 | [diff] [blame] | 2281 | case ISD::BUILD_PAIR: |
| 2282 | // Legalize both operands. FIXME: in the future we should handle the case |
| 2283 | // where the two elements are not legal. |
| 2284 | assert(isTypeLegal(NVT) && "Cannot expand this multiple times yet!"); |
| 2285 | Lo = LegalizeOp(Node->getOperand(0)); |
| 2286 | Hi = LegalizeOp(Node->getOperand(1)); |
| 2287 | break; |
| 2288 | |
Chris Lattner | edb1add | 2005-05-11 04:51:16 +0000 | [diff] [blame] | 2289 | case ISD::CTPOP: |
| 2290 | ExpandOp(Node->getOperand(0), Lo, Hi); |
Chris Lattner | 9b583b4 | 2005-05-11 05:09:47 +0000 | [diff] [blame] | 2291 | Lo = DAG.getNode(ISD::ADD, NVT, // ctpop(HL) -> ctpop(H)+ctpop(L) |
| 2292 | DAG.getNode(ISD::CTPOP, NVT, Lo), |
| 2293 | DAG.getNode(ISD::CTPOP, NVT, Hi)); |
Chris Lattner | edb1add | 2005-05-11 04:51:16 +0000 | [diff] [blame] | 2294 | Hi = DAG.getConstant(0, NVT); |
| 2295 | break; |
| 2296 | |
Chris Lattner | 39a8f33 | 2005-05-12 19:05:01 +0000 | [diff] [blame] | 2297 | case ISD::CTLZ: { |
| 2298 | // ctlz (HL) -> ctlz(H) != 32 ? ctlz(H) : (ctlz(L)+32) |
Chris Lattner | 3becf20 | 2005-05-12 19:27:51 +0000 | [diff] [blame] | 2299 | ExpandOp(Node->getOperand(0), Lo, Hi); |
Chris Lattner | 39a8f33 | 2005-05-12 19:05:01 +0000 | [diff] [blame] | 2300 | SDOperand BitsC = DAG.getConstant(MVT::getSizeInBits(NVT), NVT); |
| 2301 | SDOperand HLZ = DAG.getNode(ISD::CTLZ, NVT, Hi); |
| 2302 | SDOperand TopNotZero = DAG.getSetCC(ISD::SETNE, TLI.getSetCCResultTy(), |
| 2303 | HLZ, BitsC); |
| 2304 | SDOperand LowPart = DAG.getNode(ISD::CTLZ, NVT, Lo); |
| 2305 | LowPart = DAG.getNode(ISD::ADD, NVT, LowPart, BitsC); |
| 2306 | |
| 2307 | Lo = DAG.getNode(ISD::SELECT, NVT, TopNotZero, HLZ, LowPart); |
| 2308 | Hi = DAG.getConstant(0, NVT); |
| 2309 | break; |
| 2310 | } |
| 2311 | |
| 2312 | case ISD::CTTZ: { |
| 2313 | // cttz (HL) -> cttz(L) != 32 ? cttz(L) : (cttz(H)+32) |
Chris Lattner | 3becf20 | 2005-05-12 19:27:51 +0000 | [diff] [blame] | 2314 | ExpandOp(Node->getOperand(0), Lo, Hi); |
Chris Lattner | 39a8f33 | 2005-05-12 19:05:01 +0000 | [diff] [blame] | 2315 | SDOperand BitsC = DAG.getConstant(MVT::getSizeInBits(NVT), NVT); |
| 2316 | SDOperand LTZ = DAG.getNode(ISD::CTTZ, NVT, Lo); |
| 2317 | SDOperand BotNotZero = DAG.getSetCC(ISD::SETNE, TLI.getSetCCResultTy(), |
| 2318 | LTZ, BitsC); |
| 2319 | SDOperand HiPart = DAG.getNode(ISD::CTTZ, NVT, Hi); |
| 2320 | HiPart = DAG.getNode(ISD::ADD, NVT, HiPart, BitsC); |
| 2321 | |
| 2322 | Lo = DAG.getNode(ISD::SELECT, NVT, BotNotZero, LTZ, HiPart); |
| 2323 | Hi = DAG.getConstant(0, NVT); |
| 2324 | break; |
| 2325 | } |
Chris Lattner | edb1add | 2005-05-11 04:51:16 +0000 | [diff] [blame] | 2326 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2327 | case ISD::LOAD: { |
| 2328 | SDOperand Ch = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 2329 | SDOperand Ptr = LegalizeOp(Node->getOperand(1)); // Legalize the pointer. |
Andrew Lenharth | 2d86ea2 | 2005-04-27 20:10:01 +0000 | [diff] [blame] | 2330 | Lo = DAG.getLoad(NVT, Ch, Ptr, Node->getOperand(2)); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2331 | |
| 2332 | // Increment the pointer to the other half. |
Chris Lattner | 38d6be5 | 2005-01-09 19:43:23 +0000 | [diff] [blame] | 2333 | unsigned IncrementSize = MVT::getSizeInBits(Lo.getValueType())/8; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2334 | Ptr = DAG.getNode(ISD::ADD, Ptr.getValueType(), Ptr, |
| 2335 | getIntPtrConstant(IncrementSize)); |
Andrew Lenharth | 2d86ea2 | 2005-04-27 20:10:01 +0000 | [diff] [blame] | 2336 | //Is this safe? declaring that the two parts of the split load |
| 2337 | //are from the same instruction? |
| 2338 | Hi = DAG.getLoad(NVT, Ch, Ptr, Node->getOperand(2)); |
Chris Lattner | ec39a45 | 2005-01-19 18:02:17 +0000 | [diff] [blame] | 2339 | |
| 2340 | // Build a factor node to remember that this load is independent of the |
| 2341 | // other one. |
| 2342 | SDOperand TF = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo.getValue(1), |
| 2343 | Hi.getValue(1)); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 2344 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2345 | // Remember that we legalized the chain. |
Chris Lattner | ec39a45 | 2005-01-19 18:02:17 +0000 | [diff] [blame] | 2346 | AddLegalizedOperand(Op.getValue(1), TF); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2347 | if (!TLI.isLittleEndian()) |
| 2348 | std::swap(Lo, Hi); |
| 2349 | break; |
| 2350 | } |
Chris Lattner | d71c041 | 2005-05-13 18:43:43 +0000 | [diff] [blame] | 2351 | case ISD::TAILCALL: |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2352 | case ISD::CALL: { |
| 2353 | SDOperand Chain = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 2354 | SDOperand Callee = LegalizeOp(Node->getOperand(1)); // Legalize the callee. |
| 2355 | |
Chris Lattner | 3d9dffc | 2005-01-19 20:24:35 +0000 | [diff] [blame] | 2356 | bool Changed = false; |
| 2357 | std::vector<SDOperand> Ops; |
| 2358 | for (unsigned i = 2, e = Node->getNumOperands(); i != e; ++i) { |
| 2359 | Ops.push_back(LegalizeOp(Node->getOperand(i))); |
| 2360 | Changed |= Ops.back() != Node->getOperand(i); |
| 2361 | } |
| 2362 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2363 | assert(Node->getNumValues() == 2 && Op.ResNo == 0 && |
| 2364 | "Can only expand a call once so far, not i64 -> i16!"); |
| 2365 | |
| 2366 | std::vector<MVT::ValueType> RetTyVTs; |
| 2367 | RetTyVTs.reserve(3); |
| 2368 | RetTyVTs.push_back(NVT); |
| 2369 | RetTyVTs.push_back(NVT); |
| 2370 | RetTyVTs.push_back(MVT::Other); |
Chris Lattner | d71c041 | 2005-05-13 18:43:43 +0000 | [diff] [blame] | 2371 | SDNode *NC = DAG.getCall(RetTyVTs, Chain, Callee, Ops, |
| 2372 | Node->getOpcode() == ISD::TAILCALL); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2373 | Lo = SDOperand(NC, 0); |
| 2374 | Hi = SDOperand(NC, 1); |
| 2375 | |
| 2376 | // Insert the new chain mapping. |
Chris Lattner | e3304a3 | 2005-01-08 20:35:13 +0000 | [diff] [blame] | 2377 | AddLegalizedOperand(Op.getValue(1), Hi.getValue(2)); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2378 | break; |
| 2379 | } |
| 2380 | case ISD::AND: |
| 2381 | case ISD::OR: |
| 2382 | case ISD::XOR: { // Simple logical operators -> two trivial pieces. |
| 2383 | SDOperand LL, LH, RL, RH; |
| 2384 | ExpandOp(Node->getOperand(0), LL, LH); |
| 2385 | ExpandOp(Node->getOperand(1), RL, RH); |
| 2386 | Lo = DAG.getNode(Node->getOpcode(), NVT, LL, RL); |
| 2387 | Hi = DAG.getNode(Node->getOpcode(), NVT, LH, RH); |
| 2388 | break; |
| 2389 | } |
| 2390 | case ISD::SELECT: { |
| 2391 | SDOperand C, LL, LH, RL, RH; |
Chris Lattner | 47e9223 | 2005-01-18 19:27:06 +0000 | [diff] [blame] | 2392 | |
| 2393 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 2394 | case Expand: assert(0 && "It's impossible to expand bools"); |
| 2395 | case Legal: |
| 2396 | C = LegalizeOp(Node->getOperand(0)); // Legalize the condition. |
| 2397 | break; |
| 2398 | case Promote: |
| 2399 | C = PromoteOp(Node->getOperand(0)); // Promote the condition. |
| 2400 | break; |
| 2401 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2402 | ExpandOp(Node->getOperand(1), LL, LH); |
| 2403 | ExpandOp(Node->getOperand(2), RL, RH); |
| 2404 | Lo = DAG.getNode(ISD::SELECT, NVT, C, LL, RL); |
| 2405 | Hi = DAG.getNode(ISD::SELECT, NVT, C, LH, RH); |
| 2406 | break; |
| 2407 | } |
| 2408 | case ISD::SIGN_EXTEND: { |
Chris Lattner | 06098e0 | 2005-04-03 23:41:52 +0000 | [diff] [blame] | 2409 | SDOperand In; |
| 2410 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 2411 | case Expand: assert(0 && "expand-expand not implemented yet!"); |
| 2412 | case Legal: In = LegalizeOp(Node->getOperand(0)); break; |
| 2413 | case Promote: |
| 2414 | In = PromoteOp(Node->getOperand(0)); |
| 2415 | // Emit the appropriate sign_extend_inreg to get the value we want. |
| 2416 | In = DAG.getNode(ISD::SIGN_EXTEND_INREG, In.getValueType(), In, |
| 2417 | Node->getOperand(0).getValueType()); |
| 2418 | break; |
| 2419 | } |
| 2420 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2421 | // The low part is just a sign extension of the input (which degenerates to |
| 2422 | // a copy). |
Chris Lattner | 06098e0 | 2005-04-03 23:41:52 +0000 | [diff] [blame] | 2423 | Lo = DAG.getNode(ISD::SIGN_EXTEND, NVT, In); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 2424 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2425 | // The high part is obtained by SRA'ing all but one of the bits of the lo |
| 2426 | // part. |
Chris Lattner | 2dad454 | 2005-01-12 18:19:52 +0000 | [diff] [blame] | 2427 | unsigned LoSize = MVT::getSizeInBits(Lo.getValueType()); |
Chris Lattner | 27ff112 | 2005-01-22 00:31:52 +0000 | [diff] [blame] | 2428 | Hi = DAG.getNode(ISD::SRA, NVT, Lo, DAG.getConstant(LoSize-1, |
| 2429 | TLI.getShiftAmountTy())); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2430 | break; |
| 2431 | } |
Chris Lattner | 06098e0 | 2005-04-03 23:41:52 +0000 | [diff] [blame] | 2432 | case ISD::ZERO_EXTEND: { |
| 2433 | SDOperand In; |
| 2434 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 2435 | case Expand: assert(0 && "expand-expand not implemented yet!"); |
| 2436 | case Legal: In = LegalizeOp(Node->getOperand(0)); break; |
| 2437 | case Promote: |
| 2438 | In = PromoteOp(Node->getOperand(0)); |
| 2439 | // Emit the appropriate zero_extend_inreg to get the value we want. |
Chris Lattner | 2399356 | 2005-04-13 02:38:47 +0000 | [diff] [blame] | 2440 | In = DAG.getZeroExtendInReg(In, Node->getOperand(0).getValueType()); |
Chris Lattner | 06098e0 | 2005-04-03 23:41:52 +0000 | [diff] [blame] | 2441 | break; |
| 2442 | } |
| 2443 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2444 | // The low part is just a zero extension of the input (which degenerates to |
| 2445 | // a copy). |
Chris Lattner | dea29e2 | 2005-04-10 01:13:15 +0000 | [diff] [blame] | 2446 | Lo = DAG.getNode(ISD::ZERO_EXTEND, NVT, In); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 2447 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2448 | // The high part is just a zero. |
| 2449 | Hi = DAG.getConstant(0, NVT); |
| 2450 | break; |
Chris Lattner | 06098e0 | 2005-04-03 23:41:52 +0000 | [diff] [blame] | 2451 | } |
Chris Lattner | 4e6c746 | 2005-01-08 19:27:05 +0000 | [diff] [blame] | 2452 | // These operators cannot be expanded directly, emit them as calls to |
| 2453 | // library functions. |
| 2454 | case ISD::FP_TO_SINT: |
| 2455 | if (Node->getOperand(0).getValueType() == MVT::f32) |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2456 | Lo = ExpandLibCall("__fixsfdi", Node, Hi); |
Chris Lattner | 4e6c746 | 2005-01-08 19:27:05 +0000 | [diff] [blame] | 2457 | else |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2458 | Lo = ExpandLibCall("__fixdfdi", Node, Hi); |
Chris Lattner | 4e6c746 | 2005-01-08 19:27:05 +0000 | [diff] [blame] | 2459 | break; |
| 2460 | case ISD::FP_TO_UINT: |
| 2461 | if (Node->getOperand(0).getValueType() == MVT::f32) |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2462 | Lo = ExpandLibCall("__fixunssfdi", Node, Hi); |
Chris Lattner | 4e6c746 | 2005-01-08 19:27:05 +0000 | [diff] [blame] | 2463 | else |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2464 | Lo = ExpandLibCall("__fixunsdfdi", Node, Hi); |
Chris Lattner | 4e6c746 | 2005-01-08 19:27:05 +0000 | [diff] [blame] | 2465 | break; |
| 2466 | |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 2467 | case ISD::SHL: |
| 2468 | // If we can emit an efficient shift operation, do so now. |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2469 | if (ExpandShift(ISD::SHL, Node->getOperand(0), Node->getOperand(1), Lo, Hi)) |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 2470 | break; |
Chris Lattner | 4759982 | 2005-04-02 03:38:53 +0000 | [diff] [blame] | 2471 | |
| 2472 | // If this target supports SHL_PARTS, use it. |
| 2473 | if (TLI.getOperationAction(ISD::SHL_PARTS, NVT) == TargetLowering::Legal) { |
Chris Lattner | 5b359c6 | 2005-04-02 04:00:59 +0000 | [diff] [blame] | 2474 | ExpandShiftParts(ISD::SHL_PARTS, Node->getOperand(0), Node->getOperand(1), |
| 2475 | Lo, Hi); |
Chris Lattner | 4759982 | 2005-04-02 03:38:53 +0000 | [diff] [blame] | 2476 | break; |
| 2477 | } |
| 2478 | |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 2479 | // Otherwise, emit a libcall. |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2480 | Lo = ExpandLibCall("__ashldi3", Node, Hi); |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 2481 | break; |
| 2482 | |
| 2483 | case ISD::SRA: |
| 2484 | // If we can emit an efficient shift operation, do so now. |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2485 | if (ExpandShift(ISD::SRA, Node->getOperand(0), Node->getOperand(1), Lo, Hi)) |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 2486 | break; |
Chris Lattner | 4759982 | 2005-04-02 03:38:53 +0000 | [diff] [blame] | 2487 | |
| 2488 | // If this target supports SRA_PARTS, use it. |
| 2489 | if (TLI.getOperationAction(ISD::SRA_PARTS, NVT) == TargetLowering::Legal) { |
Chris Lattner | 5b359c6 | 2005-04-02 04:00:59 +0000 | [diff] [blame] | 2490 | ExpandShiftParts(ISD::SRA_PARTS, Node->getOperand(0), Node->getOperand(1), |
| 2491 | Lo, Hi); |
Chris Lattner | 4759982 | 2005-04-02 03:38:53 +0000 | [diff] [blame] | 2492 | break; |
| 2493 | } |
| 2494 | |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 2495 | // Otherwise, emit a libcall. |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2496 | Lo = ExpandLibCall("__ashrdi3", Node, Hi); |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 2497 | break; |
| 2498 | case ISD::SRL: |
| 2499 | // If we can emit an efficient shift operation, do so now. |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2500 | if (ExpandShift(ISD::SRL, Node->getOperand(0), Node->getOperand(1), Lo, Hi)) |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 2501 | break; |
Chris Lattner | 4759982 | 2005-04-02 03:38:53 +0000 | [diff] [blame] | 2502 | |
| 2503 | // If this target supports SRL_PARTS, use it. |
| 2504 | if (TLI.getOperationAction(ISD::SRL_PARTS, NVT) == TargetLowering::Legal) { |
Chris Lattner | 5b359c6 | 2005-04-02 04:00:59 +0000 | [diff] [blame] | 2505 | ExpandShiftParts(ISD::SRL_PARTS, Node->getOperand(0), Node->getOperand(1), |
| 2506 | Lo, Hi); |
Chris Lattner | 4759982 | 2005-04-02 03:38:53 +0000 | [diff] [blame] | 2507 | break; |
| 2508 | } |
| 2509 | |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 2510 | // Otherwise, emit a libcall. |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2511 | Lo = ExpandLibCall("__lshrdi3", Node, Hi); |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 2512 | break; |
| 2513 | |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 2514 | case ISD::ADD: |
Chris Lattner | 4759982 | 2005-04-02 03:38:53 +0000 | [diff] [blame] | 2515 | ExpandByParts(ISD::ADD_PARTS, Node->getOperand(0), Node->getOperand(1), |
| 2516 | Lo, Hi); |
Chris Lattner | 84f6788 | 2005-01-20 18:52:28 +0000 | [diff] [blame] | 2517 | break; |
| 2518 | case ISD::SUB: |
Chris Lattner | 4759982 | 2005-04-02 03:38:53 +0000 | [diff] [blame] | 2519 | ExpandByParts(ISD::SUB_PARTS, Node->getOperand(0), Node->getOperand(1), |
| 2520 | Lo, Hi); |
Chris Lattner | 84f6788 | 2005-01-20 18:52:28 +0000 | [diff] [blame] | 2521 | break; |
Nate Begeman | c7c1657 | 2005-04-11 03:01:51 +0000 | [diff] [blame] | 2522 | case ISD::MUL: { |
| 2523 | if (TLI.getOperationAction(ISD::MULHU, NVT) == TargetLowering::Legal) { |
| 2524 | SDOperand LL, LH, RL, RH; |
| 2525 | ExpandOp(Node->getOperand(0), LL, LH); |
| 2526 | ExpandOp(Node->getOperand(1), RL, RH); |
| 2527 | Hi = DAG.getNode(ISD::MULHU, NVT, LL, RL); |
| 2528 | RH = DAG.getNode(ISD::MUL, NVT, LL, RH); |
| 2529 | LH = DAG.getNode(ISD::MUL, NVT, LH, RL); |
| 2530 | Hi = DAG.getNode(ISD::ADD, NVT, Hi, RH); |
| 2531 | Hi = DAG.getNode(ISD::ADD, NVT, Hi, LH); |
| 2532 | Lo = DAG.getNode(ISD::MUL, NVT, LL, RL); |
| 2533 | } else { |
| 2534 | Lo = ExpandLibCall("__muldi3" , Node, Hi); break; |
| 2535 | } |
| 2536 | break; |
| 2537 | } |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2538 | case ISD::SDIV: Lo = ExpandLibCall("__divdi3" , Node, Hi); break; |
| 2539 | case ISD::UDIV: Lo = ExpandLibCall("__udivdi3", Node, Hi); break; |
| 2540 | case ISD::SREM: Lo = ExpandLibCall("__moddi3" , Node, Hi); break; |
| 2541 | case ISD::UREM: Lo = ExpandLibCall("__umoddi3", Node, Hi); break; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2542 | } |
| 2543 | |
| 2544 | // Remember in a map if the values will be reused later. |
| 2545 | if (!Node->hasOneUse()) { |
| 2546 | bool isNew = ExpandedNodes.insert(std::make_pair(Op, |
| 2547 | std::make_pair(Lo, Hi))).second; |
| 2548 | assert(isNew && "Value already expanded?!?"); |
| 2549 | } |
| 2550 | } |
| 2551 | |
| 2552 | |
| 2553 | // SelectionDAG::Legalize - This is the entry point for the file. |
| 2554 | // |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 2555 | void SelectionDAG::Legalize() { |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2556 | /// run - This is the main entry point to this class. |
| 2557 | /// |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 2558 | SelectionDAGLegalize(*this).Run(); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2559 | } |
| 2560 | |