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" |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 15 | #include "llvm/CodeGen/MachineFunction.h" |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 16 | #include "llvm/CodeGen/MachineFrameInfo.h" |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 17 | #include "llvm/Target/TargetLowering.h" |
Chris Lattner | e1bd822 | 2005-01-11 05:57:22 +0000 | [diff] [blame] | 18 | #include "llvm/Target/TargetData.h" |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 19 | #include "llvm/Target/TargetOptions.h" |
Chris Lattner | adf6a96 | 2005-05-13 18:50:42 +0000 | [diff] [blame] | 20 | #include "llvm/CallingConv.h" |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 21 | #include "llvm/Constants.h" |
Chris Lattner | 5e46a19 | 2006-04-02 03:07:27 +0000 | [diff] [blame] | 22 | #include "llvm/Support/MathExtras.h" |
| 23 | #include "llvm/Support/CommandLine.h" |
Chris Lattner | a4f0b3a | 2006-08-27 12:54:02 +0000 | [diff] [blame] | 24 | #include "llvm/Support/Compiler.h" |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 25 | #include "llvm/ADT/SmallVector.h" |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 26 | #include <iostream> |
Evan Cheng | 033e681 | 2006-03-24 01:17:21 +0000 | [diff] [blame] | 27 | #include <map> |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 28 | using namespace llvm; |
| 29 | |
Chris Lattner | 5e46a19 | 2006-04-02 03:07:27 +0000 | [diff] [blame] | 30 | #ifndef NDEBUG |
| 31 | static cl::opt<bool> |
| 32 | ViewLegalizeDAGs("view-legalize-dags", cl::Hidden, |
| 33 | cl::desc("Pop up a window to show dags before legalize")); |
| 34 | #else |
| 35 | static const bool ViewLegalizeDAGs = 0; |
| 36 | #endif |
| 37 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 38 | //===----------------------------------------------------------------------===// |
| 39 | /// SelectionDAGLegalize - This takes an arbitrary SelectionDAG as input and |
| 40 | /// hacks on it until the target machine can handle it. This involves |
| 41 | /// eliminating value sizes the machine cannot handle (promoting small sizes to |
| 42 | /// large sizes or splitting up large values into small values) as well as |
| 43 | /// eliminating operations the machine cannot handle. |
| 44 | /// |
| 45 | /// This code also does a small amount of optimization and recognition of idioms |
| 46 | /// as part of its processing. For example, if a target does not support a |
| 47 | /// 'setcc' instruction efficiently, but does support 'brcc' instruction, this |
| 48 | /// will attempt merge setcc and brc instructions into brcc's. |
| 49 | /// |
| 50 | namespace { |
Chris Lattner | 360e820 | 2006-06-28 21:58:30 +0000 | [diff] [blame] | 51 | class VISIBILITY_HIDDEN SelectionDAGLegalize { |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 52 | TargetLowering &TLI; |
| 53 | SelectionDAG &DAG; |
| 54 | |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 55 | // Libcall insertion helpers. |
| 56 | |
| 57 | /// LastCALLSEQ_END - This keeps track of the CALLSEQ_END node that has been |
| 58 | /// legalized. We use this to ensure that calls are properly serialized |
| 59 | /// against each other, including inserted libcalls. |
| 60 | SDOperand LastCALLSEQ_END; |
| 61 | |
| 62 | /// IsLegalizingCall - This member is used *only* for purposes of providing |
| 63 | /// helpful assertions that a libcall isn't created while another call is |
| 64 | /// being legalized (which could lead to non-serialized call sequences). |
| 65 | bool IsLegalizingCall; |
| 66 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 67 | enum LegalizeAction { |
Chris Lattner | 68a17fe | 2006-01-29 08:42:06 +0000 | [diff] [blame] | 68 | Legal, // The target natively supports this operation. |
| 69 | Promote, // This operation should be executed in a larger type. |
Chris Lattner | d74ea2b | 2006-05-24 17:04:05 +0000 | [diff] [blame] | 70 | Expand // Try to expand this to other ops, otherwise use a libcall. |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 71 | }; |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 72 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 73 | /// ValueTypeActions - This is a bitvector that contains two bits for each |
| 74 | /// value type, where the two bits correspond to the LegalizeAction enum. |
| 75 | /// This can be queried with "getTypeAction(VT)". |
Chris Lattner | 68a17fe | 2006-01-29 08:42:06 +0000 | [diff] [blame] | 76 | TargetLowering::ValueTypeActionImpl ValueTypeActions; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 77 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 78 | /// LegalizedNodes - For nodes that are of legal width, and that have more |
| 79 | /// than one use, this map indicates what regularized operand to use. This |
| 80 | /// allows us to avoid legalizing the same thing more than once. |
| 81 | std::map<SDOperand, SDOperand> LegalizedNodes; |
| 82 | |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 83 | /// PromotedNodes - For nodes that are below legal width, and that have more |
| 84 | /// than one use, this map indicates what promoted value to use. This allows |
| 85 | /// us to avoid promoting the same thing more than once. |
| 86 | std::map<SDOperand, SDOperand> PromotedNodes; |
| 87 | |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 88 | /// ExpandedNodes - For nodes that need to be expanded this map indicates |
| 89 | /// which which operands are the expanded version of the input. This allows |
| 90 | /// us to avoid expanding the same node more than once. |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 91 | std::map<SDOperand, std::pair<SDOperand, SDOperand> > ExpandedNodes; |
| 92 | |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 93 | /// SplitNodes - For vector nodes that need to be split, this map indicates |
| 94 | /// which which operands are the split version of the input. This allows us |
| 95 | /// to avoid splitting the same node more than once. |
| 96 | std::map<SDOperand, std::pair<SDOperand, SDOperand> > SplitNodes; |
| 97 | |
| 98 | /// PackedNodes - For nodes that need to be packed from MVT::Vector types to |
| 99 | /// concrete packed types, this contains the mapping of ones we have already |
| 100 | /// processed to the result. |
| 101 | std::map<SDOperand, SDOperand> PackedNodes; |
| 102 | |
Chris Lattner | 8afc48e | 2005-01-07 22:28:47 +0000 | [diff] [blame] | 103 | void AddLegalizedOperand(SDOperand From, SDOperand To) { |
Chris Lattner | 69a889e | 2005-12-20 00:53:54 +0000 | [diff] [blame] | 104 | LegalizedNodes.insert(std::make_pair(From, To)); |
| 105 | // If someone requests legalization of the new node, return itself. |
| 106 | if (From != To) |
| 107 | LegalizedNodes.insert(std::make_pair(To, To)); |
Chris Lattner | 8afc48e | 2005-01-07 22:28:47 +0000 | [diff] [blame] | 108 | } |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 109 | void AddPromotedOperand(SDOperand From, SDOperand To) { |
| 110 | bool isNew = PromotedNodes.insert(std::make_pair(From, To)).second; |
| 111 | assert(isNew && "Got into the map somehow?"); |
Chris Lattner | 69a889e | 2005-12-20 00:53:54 +0000 | [diff] [blame] | 112 | // If someone requests legalization of the new node, return itself. |
| 113 | LegalizedNodes.insert(std::make_pair(To, To)); |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 114 | } |
Chris Lattner | 8afc48e | 2005-01-07 22:28:47 +0000 | [diff] [blame] | 115 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 116 | public: |
| 117 | |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 118 | SelectionDAGLegalize(SelectionDAG &DAG); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 119 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 120 | /// getTypeAction - Return how we should legalize values of this type, either |
| 121 | /// it is already legal or we need to expand it into multiple registers of |
| 122 | /// smaller integer type, or we need to promote it to a larger type. |
| 123 | LegalizeAction getTypeAction(MVT::ValueType VT) const { |
Chris Lattner | 68a17fe | 2006-01-29 08:42:06 +0000 | [diff] [blame] | 124 | return (LegalizeAction)ValueTypeActions.getTypeAction(VT); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 125 | } |
| 126 | |
| 127 | /// isTypeLegal - Return true if this type is legal on this target. |
| 128 | /// |
| 129 | bool isTypeLegal(MVT::ValueType VT) const { |
| 130 | return getTypeAction(VT) == Legal; |
| 131 | } |
| 132 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 133 | void LegalizeDAG(); |
| 134 | |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 135 | private: |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 136 | /// HandleOp - Legalize, Promote, Expand or Pack the specified operand as |
| 137 | /// appropriate for its type. |
| 138 | void HandleOp(SDOperand Op); |
| 139 | |
| 140 | /// LegalizeOp - We know that the specified value has a legal type. |
| 141 | /// Recursively ensure that the operands have legal types, then return the |
| 142 | /// result. |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 143 | SDOperand LegalizeOp(SDOperand O); |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 144 | |
| 145 | /// PromoteOp - Given an operation that produces a value in an invalid type, |
| 146 | /// promote it to compute the value into a larger type. The produced value |
| 147 | /// will have the correct bits for the low portion of the register, but no |
| 148 | /// guarantee is made about the top bits: it may be zero, sign-extended, or |
| 149 | /// garbage. |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 150 | SDOperand PromoteOp(SDOperand O); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 151 | |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 152 | /// ExpandOp - Expand the specified SDOperand into its two component pieces |
| 153 | /// Lo&Hi. Note that the Op MUST be an expanded type. As a result of this, |
| 154 | /// the LegalizeNodes map is filled in for any results that are not expanded, |
| 155 | /// the ExpandedNodes map is filled in for any results that are expanded, and |
| 156 | /// the Lo/Hi values are returned. This applies to integer types and Vector |
| 157 | /// types. |
| 158 | void ExpandOp(SDOperand O, SDOperand &Lo, SDOperand &Hi); |
| 159 | |
| 160 | /// SplitVectorOp - Given an operand of MVT::Vector type, break it down into |
| 161 | /// two smaller values of MVT::Vector type. |
| 162 | void SplitVectorOp(SDOperand O, SDOperand &Lo, SDOperand &Hi); |
| 163 | |
| 164 | /// PackVectorOp - Given an operand of MVT::Vector type, convert it into the |
| 165 | /// equivalent operation that returns a packed value (e.g. MVT::V4F32). When |
| 166 | /// this is called, we know that PackedVT is the right type for the result and |
| 167 | /// we know that this type is legal for the target. |
| 168 | SDOperand PackVectorOp(SDOperand O, MVT::ValueType PackedVT); |
| 169 | |
Chris Lattner | 4352cc9 | 2006-04-04 17:23:26 +0000 | [diff] [blame] | 170 | /// isShuffleLegal - Return true if a vector shuffle is legal with the |
| 171 | /// specified mask and type. Targets can specify exactly which masks they |
| 172 | /// support and the code generator is tasked with not creating illegal masks. |
| 173 | /// |
| 174 | /// Note that this will also return true for shuffles that are promoted to a |
| 175 | /// different type. |
| 176 | /// |
| 177 | /// If this is a legal shuffle, this method returns the (possibly promoted) |
| 178 | /// build_vector Mask. If it's not a legal shuffle, it returns null. |
| 179 | SDNode *isShuffleLegal(MVT::ValueType VT, SDOperand Mask) const; |
| 180 | |
Chris Lattner | c9cf4f1 | 2006-07-26 23:55:56 +0000 | [diff] [blame] | 181 | bool LegalizeAllNodesNotLeadingTo(SDNode *N, SDNode *Dest, |
| 182 | std::set<SDNode*> &NodesLeadingTo); |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 183 | |
Nate Begeman | 750ac1b | 2006-02-01 07:19:44 +0000 | [diff] [blame] | 184 | void LegalizeSetCCOperands(SDOperand &LHS, SDOperand &RHS, SDOperand &CC); |
| 185 | |
Chris Lattner | ce87215 | 2006-03-19 06:31:19 +0000 | [diff] [blame] | 186 | SDOperand CreateStackTemporary(MVT::ValueType VT); |
| 187 | |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 188 | SDOperand ExpandLibCall(const char *Name, SDNode *Node, |
| 189 | SDOperand &Hi); |
| 190 | SDOperand ExpandIntToFP(bool isSigned, MVT::ValueType DestTy, |
| 191 | SDOperand Source); |
Chris Lattner | cad063f | 2005-07-16 00:19:57 +0000 | [diff] [blame] | 192 | |
Chris Lattner | 3548189 | 2005-12-23 00:16:34 +0000 | [diff] [blame] | 193 | SDOperand ExpandBIT_CONVERT(MVT::ValueType DestVT, SDOperand SrcOp); |
Chris Lattner | ce87215 | 2006-03-19 06:31:19 +0000 | [diff] [blame] | 194 | SDOperand ExpandBUILD_VECTOR(SDNode *Node); |
Chris Lattner | 4352cc9 | 2006-04-04 17:23:26 +0000 | [diff] [blame] | 195 | SDOperand ExpandSCALAR_TO_VECTOR(SDNode *Node); |
Jim Laskey | 6269ed1 | 2005-08-17 00:39:29 +0000 | [diff] [blame] | 196 | SDOperand ExpandLegalINT_TO_FP(bool isSigned, |
| 197 | SDOperand LegalOp, |
| 198 | MVT::ValueType DestVT); |
Nate Begeman | 5a8441e | 2005-07-16 02:02:34 +0000 | [diff] [blame] | 199 | SDOperand PromoteLegalINT_TO_FP(SDOperand LegalOp, MVT::ValueType DestVT, |
| 200 | bool isSigned); |
Chris Lattner | 1618beb | 2005-07-29 00:11:56 +0000 | [diff] [blame] | 201 | SDOperand PromoteLegalFP_TO_INT(SDOperand LegalOp, MVT::ValueType DestVT, |
| 202 | bool isSigned); |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 203 | |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 204 | SDOperand ExpandBSWAP(SDOperand Op); |
| 205 | SDOperand ExpandBitCount(unsigned Opc, SDOperand Op); |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 206 | bool ExpandShift(unsigned Opc, SDOperand Op, SDOperand Amt, |
| 207 | SDOperand &Lo, SDOperand &Hi); |
Chris Lattner | 5b359c6 | 2005-04-02 04:00:59 +0000 | [diff] [blame] | 208 | void ExpandShiftParts(unsigned NodeOp, SDOperand Op, SDOperand Amt, |
| 209 | SDOperand &Lo, SDOperand &Hi); |
Chris Lattner | b9fa3bc | 2005-05-12 04:49:08 +0000 | [diff] [blame] | 210 | |
Chris Lattner | 1597221 | 2006-03-31 17:55:51 +0000 | [diff] [blame] | 211 | SDOperand LowerVEXTRACT_VECTOR_ELT(SDOperand Op); |
Chris Lattner | 4aab2f4 | 2006-04-02 05:06:04 +0000 | [diff] [blame] | 212 | SDOperand ExpandEXTRACT_VECTOR_ELT(SDOperand Op); |
Chris Lattner | 1597221 | 2006-03-31 17:55:51 +0000 | [diff] [blame] | 213 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 214 | SDOperand getIntPtrConstant(uint64_t Val) { |
| 215 | return DAG.getConstant(Val, TLI.getPointerTy()); |
| 216 | } |
| 217 | }; |
| 218 | } |
| 219 | |
Chris Lattner | 4352cc9 | 2006-04-04 17:23:26 +0000 | [diff] [blame] | 220 | /// isVectorShuffleLegal - Return true if a vector shuffle is legal with the |
| 221 | /// specified mask and type. Targets can specify exactly which masks they |
| 222 | /// support and the code generator is tasked with not creating illegal masks. |
| 223 | /// |
| 224 | /// Note that this will also return true for shuffles that are promoted to a |
| 225 | /// different type. |
| 226 | SDNode *SelectionDAGLegalize::isShuffleLegal(MVT::ValueType VT, |
| 227 | SDOperand Mask) const { |
| 228 | switch (TLI.getOperationAction(ISD::VECTOR_SHUFFLE, VT)) { |
| 229 | default: return 0; |
| 230 | case TargetLowering::Legal: |
| 231 | case TargetLowering::Custom: |
| 232 | break; |
| 233 | case TargetLowering::Promote: { |
| 234 | // If this is promoted to a different type, convert the shuffle mask and |
| 235 | // ask if it is legal in the promoted type! |
| 236 | MVT::ValueType NVT = TLI.getTypeToPromoteTo(ISD::VECTOR_SHUFFLE, VT); |
| 237 | |
| 238 | // If we changed # elements, change the shuffle mask. |
| 239 | unsigned NumEltsGrowth = |
| 240 | MVT::getVectorNumElements(NVT) / MVT::getVectorNumElements(VT); |
| 241 | assert(NumEltsGrowth && "Cannot promote to vector type with fewer elts!"); |
| 242 | if (NumEltsGrowth > 1) { |
| 243 | // Renumber the elements. |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 244 | SmallVector<SDOperand, 8> Ops; |
Chris Lattner | 4352cc9 | 2006-04-04 17:23:26 +0000 | [diff] [blame] | 245 | for (unsigned i = 0, e = Mask.getNumOperands(); i != e; ++i) { |
| 246 | SDOperand InOp = Mask.getOperand(i); |
| 247 | for (unsigned j = 0; j != NumEltsGrowth; ++j) { |
| 248 | if (InOp.getOpcode() == ISD::UNDEF) |
| 249 | Ops.push_back(DAG.getNode(ISD::UNDEF, MVT::i32)); |
| 250 | else { |
| 251 | unsigned InEltNo = cast<ConstantSDNode>(InOp)->getValue(); |
| 252 | Ops.push_back(DAG.getConstant(InEltNo*NumEltsGrowth+j, MVT::i32)); |
| 253 | } |
| 254 | } |
| 255 | } |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 256 | Mask = DAG.getNode(ISD::BUILD_VECTOR, NVT, &Ops[0], Ops.size()); |
Chris Lattner | 4352cc9 | 2006-04-04 17:23:26 +0000 | [diff] [blame] | 257 | } |
| 258 | VT = NVT; |
| 259 | break; |
| 260 | } |
| 261 | } |
| 262 | return TLI.isShuffleMaskLegal(Mask, VT) ? Mask.Val : 0; |
| 263 | } |
| 264 | |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 265 | /// getScalarizedOpcode - Return the scalar opcode that corresponds to the |
| 266 | /// specified vector opcode. |
Chris Lattner | b89175f | 2005-11-19 05:51:46 +0000 | [diff] [blame] | 267 | static unsigned getScalarizedOpcode(unsigned VecOp, MVT::ValueType VT) { |
Nate Begeman | 5fbb5d2 | 2005-11-19 00:36:38 +0000 | [diff] [blame] | 268 | switch (VecOp) { |
| 269 | default: assert(0 && "Don't know how to scalarize this opcode!"); |
Evan Cheng | 3e1ce5a | 2006-03-03 07:01:07 +0000 | [diff] [blame] | 270 | case ISD::VADD: return MVT::isInteger(VT) ? ISD::ADD : ISD::FADD; |
| 271 | case ISD::VSUB: return MVT::isInteger(VT) ? ISD::SUB : ISD::FSUB; |
| 272 | case ISD::VMUL: return MVT::isInteger(VT) ? ISD::MUL : ISD::FMUL; |
| 273 | case ISD::VSDIV: return MVT::isInteger(VT) ? ISD::SDIV: ISD::FDIV; |
| 274 | case ISD::VUDIV: return MVT::isInteger(VT) ? ISD::UDIV: ISD::FDIV; |
| 275 | case ISD::VAND: return MVT::isInteger(VT) ? ISD::AND : 0; |
| 276 | case ISD::VOR: return MVT::isInteger(VT) ? ISD::OR : 0; |
| 277 | case ISD::VXOR: return MVT::isInteger(VT) ? ISD::XOR : 0; |
Nate Begeman | 5fbb5d2 | 2005-11-19 00:36:38 +0000 | [diff] [blame] | 278 | } |
| 279 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 280 | |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 281 | SelectionDAGLegalize::SelectionDAGLegalize(SelectionDAG &dag) |
| 282 | : TLI(dag.getTargetLoweringInfo()), DAG(dag), |
| 283 | ValueTypeActions(TLI.getValueTypeActions()) { |
Nate Begeman | 6a64861 | 2005-11-29 05:45:29 +0000 | [diff] [blame] | 284 | assert(MVT::LAST_VALUETYPE <= 32 && |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 285 | "Too many value types for ValueTypeActions to hold!"); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 286 | } |
| 287 | |
Chris Lattner | 32fca00 | 2005-10-06 01:20:27 +0000 | [diff] [blame] | 288 | /// ComputeTopDownOrdering - Add the specified node to the Order list if it has |
| 289 | /// not been visited yet and if all of its operands have already been visited. |
| 290 | static void ComputeTopDownOrdering(SDNode *N, std::vector<SDNode*> &Order, |
| 291 | std::map<SDNode*, unsigned> &Visited) { |
| 292 | if (++Visited[N] != N->getNumOperands()) |
| 293 | return; // Haven't visited all operands yet |
| 294 | |
| 295 | Order.push_back(N); |
| 296 | |
| 297 | if (N->hasOneUse()) { // Tail recurse in common case. |
| 298 | ComputeTopDownOrdering(*N->use_begin(), Order, Visited); |
| 299 | return; |
| 300 | } |
| 301 | |
| 302 | // Now that we have N in, add anything that uses it if all of their operands |
| 303 | // are now done. |
Chris Lattner | 32fca00 | 2005-10-06 01:20:27 +0000 | [diff] [blame] | 304 | for (SDNode::use_iterator UI = N->use_begin(), E = N->use_end(); UI != E;++UI) |
| 305 | ComputeTopDownOrdering(*UI, Order, Visited); |
| 306 | } |
| 307 | |
Chris Lattner | 1618beb | 2005-07-29 00:11:56 +0000 | [diff] [blame] | 308 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 309 | void SelectionDAGLegalize::LegalizeDAG() { |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 310 | LastCALLSEQ_END = DAG.getEntryNode(); |
| 311 | IsLegalizingCall = false; |
| 312 | |
Chris Lattner | ab510a7 | 2005-10-02 17:49:46 +0000 | [diff] [blame] | 313 | // The legalize process is inherently a bottom-up recursive process (users |
| 314 | // legalize their uses before themselves). Given infinite stack space, we |
| 315 | // could just start legalizing on the root and traverse the whole graph. In |
| 316 | // practice however, this causes us to run out of stack space on large basic |
Chris Lattner | 32fca00 | 2005-10-06 01:20:27 +0000 | [diff] [blame] | 317 | // blocks. To avoid this problem, compute an ordering of the nodes where each |
| 318 | // node is only legalized after all of its operands are legalized. |
| 319 | std::map<SDNode*, unsigned> Visited; |
| 320 | std::vector<SDNode*> Order; |
Chris Lattner | ab510a7 | 2005-10-02 17:49:46 +0000 | [diff] [blame] | 321 | |
Chris Lattner | 32fca00 | 2005-10-06 01:20:27 +0000 | [diff] [blame] | 322 | // Compute ordering from all of the leaves in the graphs, those (like the |
| 323 | // entry node) that have no operands. |
| 324 | for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(), |
| 325 | E = DAG.allnodes_end(); I != E; ++I) { |
Chris Lattner | de202b3 | 2005-11-09 23:47:37 +0000 | [diff] [blame] | 326 | if (I->getNumOperands() == 0) { |
| 327 | Visited[I] = 0 - 1U; |
| 328 | ComputeTopDownOrdering(I, Order, Visited); |
Chris Lattner | ab510a7 | 2005-10-02 17:49:46 +0000 | [diff] [blame] | 329 | } |
Chris Lattner | ab510a7 | 2005-10-02 17:49:46 +0000 | [diff] [blame] | 330 | } |
| 331 | |
Chris Lattner | de202b3 | 2005-11-09 23:47:37 +0000 | [diff] [blame] | 332 | assert(Order.size() == Visited.size() && |
| 333 | Order.size() == |
| 334 | (unsigned)std::distance(DAG.allnodes_begin(), DAG.allnodes_end()) && |
Chris Lattner | 32fca00 | 2005-10-06 01:20:27 +0000 | [diff] [blame] | 335 | "Error: DAG is cyclic!"); |
| 336 | Visited.clear(); |
Chris Lattner | ab510a7 | 2005-10-02 17:49:46 +0000 | [diff] [blame] | 337 | |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 338 | for (unsigned i = 0, e = Order.size(); i != e; ++i) |
| 339 | HandleOp(SDOperand(Order[i], 0)); |
Chris Lattner | 32fca00 | 2005-10-06 01:20:27 +0000 | [diff] [blame] | 340 | |
| 341 | // Finally, it's possible the root changed. Get the new root. |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 342 | SDOperand OldRoot = DAG.getRoot(); |
Chris Lattner | 32fca00 | 2005-10-06 01:20:27 +0000 | [diff] [blame] | 343 | assert(LegalizedNodes.count(OldRoot) && "Root didn't get legalized?"); |
| 344 | DAG.setRoot(LegalizedNodes[OldRoot]); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 345 | |
| 346 | ExpandedNodes.clear(); |
| 347 | LegalizedNodes.clear(); |
Chris Lattner | 71c42a0 | 2005-01-16 01:11:45 +0000 | [diff] [blame] | 348 | PromotedNodes.clear(); |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 349 | SplitNodes.clear(); |
| 350 | PackedNodes.clear(); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 351 | |
| 352 | // Remove dead nodes now. |
Chris Lattner | 190a418 | 2006-08-04 17:45:20 +0000 | [diff] [blame] | 353 | DAG.RemoveDeadNodes(); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 354 | } |
| 355 | |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 356 | |
| 357 | /// FindCallEndFromCallStart - Given a chained node that is part of a call |
| 358 | /// sequence, find the CALLSEQ_END node that terminates the call sequence. |
| 359 | static SDNode *FindCallEndFromCallStart(SDNode *Node) { |
| 360 | if (Node->getOpcode() == ISD::CALLSEQ_END) |
| 361 | return Node; |
| 362 | if (Node->use_empty()) |
| 363 | return 0; // No CallSeqEnd |
| 364 | |
| 365 | // The chain is usually at the end. |
| 366 | SDOperand TheChain(Node, Node->getNumValues()-1); |
| 367 | if (TheChain.getValueType() != MVT::Other) { |
| 368 | // Sometimes it's at the beginning. |
| 369 | TheChain = SDOperand(Node, 0); |
| 370 | if (TheChain.getValueType() != MVT::Other) { |
| 371 | // Otherwise, hunt for it. |
| 372 | for (unsigned i = 1, e = Node->getNumValues(); i != e; ++i) |
| 373 | if (Node->getValueType(i) == MVT::Other) { |
| 374 | TheChain = SDOperand(Node, i); |
| 375 | break; |
| 376 | } |
| 377 | |
| 378 | // Otherwise, we walked into a node without a chain. |
| 379 | if (TheChain.getValueType() != MVT::Other) |
| 380 | return 0; |
| 381 | } |
| 382 | } |
| 383 | |
| 384 | for (SDNode::use_iterator UI = Node->use_begin(), |
| 385 | E = Node->use_end(); UI != E; ++UI) { |
| 386 | |
| 387 | // Make sure to only follow users of our token chain. |
| 388 | SDNode *User = *UI; |
| 389 | for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i) |
| 390 | if (User->getOperand(i) == TheChain) |
| 391 | if (SDNode *Result = FindCallEndFromCallStart(User)) |
| 392 | return Result; |
| 393 | } |
| 394 | return 0; |
| 395 | } |
| 396 | |
| 397 | /// FindCallStartFromCallEnd - Given a chained node that is part of a call |
| 398 | /// sequence, find the CALLSEQ_START node that initiates the call sequence. |
| 399 | static SDNode *FindCallStartFromCallEnd(SDNode *Node) { |
| 400 | assert(Node && "Didn't find callseq_start for a call??"); |
| 401 | if (Node->getOpcode() == ISD::CALLSEQ_START) return Node; |
| 402 | |
| 403 | assert(Node->getOperand(0).getValueType() == MVT::Other && |
| 404 | "Node doesn't have a token chain argument!"); |
| 405 | return FindCallStartFromCallEnd(Node->getOperand(0).Val); |
| 406 | } |
| 407 | |
| 408 | /// LegalizeAllNodesNotLeadingTo - Recursively walk the uses of N, looking to |
| 409 | /// see if any uses can reach Dest. If no dest operands can get to dest, |
| 410 | /// legalize them, legalize ourself, and return false, otherwise, return true. |
Chris Lattner | c9cf4f1 | 2006-07-26 23:55:56 +0000 | [diff] [blame] | 411 | /// |
| 412 | /// Keep track of the nodes we fine that actually do lead to Dest in |
| 413 | /// NodesLeadingTo. This avoids retraversing them exponential number of times. |
| 414 | /// |
| 415 | bool SelectionDAGLegalize::LegalizeAllNodesNotLeadingTo(SDNode *N, SDNode *Dest, |
| 416 | std::set<SDNode*> &NodesLeadingTo) { |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 417 | if (N == Dest) return true; // N certainly leads to Dest :) |
| 418 | |
Chris Lattner | c9cf4f1 | 2006-07-26 23:55:56 +0000 | [diff] [blame] | 419 | // If we've already processed this node and it does lead to Dest, there is no |
| 420 | // need to reprocess it. |
| 421 | if (NodesLeadingTo.count(N)) return true; |
| 422 | |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 423 | // If the first result of this node has been already legalized, then it cannot |
| 424 | // reach N. |
| 425 | switch (getTypeAction(N->getValueType(0))) { |
| 426 | case Legal: |
| 427 | if (LegalizedNodes.count(SDOperand(N, 0))) return false; |
| 428 | break; |
| 429 | case Promote: |
| 430 | if (PromotedNodes.count(SDOperand(N, 0))) return false; |
| 431 | break; |
| 432 | case Expand: |
| 433 | if (ExpandedNodes.count(SDOperand(N, 0))) return false; |
| 434 | break; |
| 435 | } |
| 436 | |
| 437 | // Okay, this node has not already been legalized. Check and legalize all |
| 438 | // operands. If none lead to Dest, then we can legalize this node. |
| 439 | bool OperandsLeadToDest = false; |
| 440 | for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) |
| 441 | OperandsLeadToDest |= // If an operand leads to Dest, so do we. |
Chris Lattner | c9cf4f1 | 2006-07-26 23:55:56 +0000 | [diff] [blame] | 442 | LegalizeAllNodesNotLeadingTo(N->getOperand(i).Val, Dest, NodesLeadingTo); |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 443 | |
Chris Lattner | c9cf4f1 | 2006-07-26 23:55:56 +0000 | [diff] [blame] | 444 | if (OperandsLeadToDest) { |
| 445 | NodesLeadingTo.insert(N); |
| 446 | return true; |
| 447 | } |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 448 | |
| 449 | // Okay, this node looks safe, legalize it and return false. |
Chris Lattner | 80edfb3 | 2006-04-17 22:10:08 +0000 | [diff] [blame] | 450 | HandleOp(SDOperand(N, 0)); |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 451 | return false; |
| 452 | } |
| 453 | |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 454 | /// HandleOp - Legalize, Promote, Expand or Pack the specified operand as |
| 455 | /// appropriate for its type. |
| 456 | void SelectionDAGLegalize::HandleOp(SDOperand Op) { |
| 457 | switch (getTypeAction(Op.getValueType())) { |
| 458 | default: assert(0 && "Bad type action!"); |
| 459 | case Legal: LegalizeOp(Op); break; |
| 460 | case Promote: PromoteOp(Op); break; |
| 461 | case Expand: |
| 462 | if (Op.getValueType() != MVT::Vector) { |
| 463 | SDOperand X, Y; |
| 464 | ExpandOp(Op, X, Y); |
| 465 | } else { |
| 466 | SDNode *N = Op.Val; |
| 467 | unsigned NumOps = N->getNumOperands(); |
| 468 | unsigned NumElements = |
| 469 | cast<ConstantSDNode>(N->getOperand(NumOps-2))->getValue(); |
| 470 | MVT::ValueType EVT = cast<VTSDNode>(N->getOperand(NumOps-1))->getVT(); |
| 471 | MVT::ValueType PackedVT = getVectorType(EVT, NumElements); |
| 472 | if (PackedVT != MVT::Other && TLI.isTypeLegal(PackedVT)) { |
| 473 | // In the common case, this is a legal vector type, convert it to the |
| 474 | // packed operation and type now. |
| 475 | PackVectorOp(Op, PackedVT); |
| 476 | } else if (NumElements == 1) { |
| 477 | // Otherwise, if this is a single element vector, convert it to a |
| 478 | // scalar operation. |
| 479 | PackVectorOp(Op, EVT); |
| 480 | } else { |
| 481 | // Otherwise, this is a multiple element vector that isn't supported. |
| 482 | // Split it in half and legalize both parts. |
| 483 | SDOperand X, Y; |
Chris Lattner | 4794a6b | 2006-03-19 00:07:49 +0000 | [diff] [blame] | 484 | SplitVectorOp(Op, X, Y); |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 485 | } |
| 486 | } |
| 487 | break; |
| 488 | } |
| 489 | } |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 490 | |
| 491 | |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 492 | /// LegalizeOp - We know that the specified value has a legal type. |
| 493 | /// Recursively ensure that the operands have legal types, then return the |
| 494 | /// result. |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 495 | SDOperand SelectionDAGLegalize::LegalizeOp(SDOperand Op) { |
Chris Lattner | c9c60f6 | 2005-08-24 16:35:28 +0000 | [diff] [blame] | 496 | assert(isTypeLegal(Op.getValueType()) && |
Chris Lattner | e3304a3 | 2005-01-08 20:35:13 +0000 | [diff] [blame] | 497 | "Caller should expand or promote operands that are not legal!"); |
Chris Lattner | 45982da | 2005-05-12 16:53:42 +0000 | [diff] [blame] | 498 | SDNode *Node = Op.Val; |
Chris Lattner | e3304a3 | 2005-01-08 20:35:13 +0000 | [diff] [blame] | 499 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 500 | // If this operation defines any values that cannot be represented in a |
Chris Lattner | e3304a3 | 2005-01-08 20:35:13 +0000 | [diff] [blame] | 501 | // register on this target, make sure to expand or promote them. |
Chris Lattner | 45982da | 2005-05-12 16:53:42 +0000 | [diff] [blame] | 502 | if (Node->getNumValues() > 1) { |
| 503 | for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 504 | if (getTypeAction(Node->getValueType(i)) != Legal) { |
| 505 | HandleOp(Op.getValue(i)); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 506 | assert(LegalizedNodes.count(Op) && |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 507 | "Handling didn't add legal operands!"); |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 508 | return LegalizedNodes[Op]; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 509 | } |
| 510 | } |
| 511 | |
Chris Lattner | 45982da | 2005-05-12 16:53:42 +0000 | [diff] [blame] | 512 | // Note that LegalizeOp may be reentered even from single-use nodes, which |
| 513 | // means that we always must cache transformed nodes. |
Chris Lattner | e1bd822 | 2005-01-11 05:57:22 +0000 | [diff] [blame] | 514 | std::map<SDOperand, SDOperand>::iterator I = LegalizedNodes.find(Op); |
| 515 | if (I != LegalizedNodes.end()) return I->second; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 516 | |
Nate Begeman | 9373a81 | 2005-08-10 20:51:12 +0000 | [diff] [blame] | 517 | SDOperand Tmp1, Tmp2, Tmp3, Tmp4; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 518 | SDOperand Result = Op; |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 519 | bool isCustom = false; |
| 520 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 521 | switch (Node->getOpcode()) { |
Chris Lattner | 948c1b1 | 2006-01-28 08:31:04 +0000 | [diff] [blame] | 522 | case ISD::FrameIndex: |
| 523 | case ISD::EntryToken: |
| 524 | case ISD::Register: |
| 525 | case ISD::BasicBlock: |
| 526 | case ISD::TargetFrameIndex: |
Nate Begeman | 37efe67 | 2006-04-22 18:53:45 +0000 | [diff] [blame] | 527 | case ISD::TargetJumpTable: |
Chris Lattner | 948c1b1 | 2006-01-28 08:31:04 +0000 | [diff] [blame] | 528 | case ISD::TargetConstant: |
Chris Lattner | 3181a77 | 2006-01-29 06:26:56 +0000 | [diff] [blame] | 529 | case ISD::TargetConstantFP: |
Chris Lattner | 948c1b1 | 2006-01-28 08:31:04 +0000 | [diff] [blame] | 530 | case ISD::TargetConstantPool: |
| 531 | case ISD::TargetGlobalAddress: |
| 532 | case ISD::TargetExternalSymbol: |
| 533 | case ISD::VALUETYPE: |
| 534 | case ISD::SRCVALUE: |
| 535 | case ISD::STRING: |
| 536 | case ISD::CONDCODE: |
| 537 | // Primitives must all be legal. |
| 538 | assert(TLI.isOperationLegal(Node->getValueType(0), Node->getValueType(0)) && |
| 539 | "This must be legal!"); |
| 540 | break; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 541 | default: |
Chris Lattner | d73cc5d | 2005-05-14 06:34:48 +0000 | [diff] [blame] | 542 | if (Node->getOpcode() >= ISD::BUILTIN_OP_END) { |
| 543 | // If this is a target node, legalize it by legalizing the operands then |
| 544 | // passing it through. |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 545 | SmallVector<SDOperand, 8> Ops; |
Chris Lattner | c5d7d7c | 2006-05-17 18:00:08 +0000 | [diff] [blame] | 546 | for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) |
Chris Lattner | d73cc5d | 2005-05-14 06:34:48 +0000 | [diff] [blame] | 547 | Ops.push_back(LegalizeOp(Node->getOperand(i))); |
Chris Lattner | c5d7d7c | 2006-05-17 18:00:08 +0000 | [diff] [blame] | 548 | |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 549 | Result = DAG.UpdateNodeOperands(Result.getValue(0), &Ops[0], Ops.size()); |
Chris Lattner | d73cc5d | 2005-05-14 06:34:48 +0000 | [diff] [blame] | 550 | |
| 551 | for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) |
| 552 | AddLegalizedOperand(Op.getValue(i), Result.getValue(i)); |
| 553 | return Result.getValue(Op.ResNo); |
| 554 | } |
| 555 | // Otherwise this is an unhandled builtin node. splat. |
Jim Laskey | e37fe9b | 2006-07-11 17:58:07 +0000 | [diff] [blame] | 556 | #ifndef NDEBUG |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 557 | std::cerr << "NODE: "; Node->dump(); std::cerr << "\n"; |
Jim Laskey | e37fe9b | 2006-07-11 17:58:07 +0000 | [diff] [blame] | 558 | #endif |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 559 | assert(0 && "Do not know how to legalize this operator!"); |
| 560 | abort(); |
Andrew Lenharth | beec30e | 2006-09-24 19:45:58 +0000 | [diff] [blame] | 561 | case ISD::JumpTableRelocBase: |
| 562 | switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) { |
| 563 | case TargetLowering::Custom: |
| 564 | Tmp1 = TLI.LowerOperation(Op, DAG); |
| 565 | if (Tmp1.Val) Result = Tmp1; |
| 566 | break; |
| 567 | default: |
| 568 | Result = LegalizeOp(Node->getOperand(0)); |
| 569 | break; |
| 570 | } |
| 571 | break; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 572 | case ISD::GlobalAddress: |
Chris Lattner | 03c0cf8 | 2005-01-07 21:45:56 +0000 | [diff] [blame] | 573 | case ISD::ExternalSymbol: |
Nate Begeman | 37efe67 | 2006-04-22 18:53:45 +0000 | [diff] [blame] | 574 | case ISD::ConstantPool: |
| 575 | case ISD::JumpTable: // Nothing to do. |
Chris Lattner | 0c8fbe3 | 2005-11-17 06:41:44 +0000 | [diff] [blame] | 576 | switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) { |
| 577 | default: assert(0 && "This action is not supported yet!"); |
Chris Lattner | 948c1b1 | 2006-01-28 08:31:04 +0000 | [diff] [blame] | 578 | case TargetLowering::Custom: |
| 579 | Tmp1 = TLI.LowerOperation(Op, DAG); |
| 580 | if (Tmp1.Val) Result = Tmp1; |
| 581 | // FALLTHROUGH if the target doesn't want to lower this op after all. |
Chris Lattner | 0c8fbe3 | 2005-11-17 06:41:44 +0000 | [diff] [blame] | 582 | case TargetLowering::Legal: |
Chris Lattner | 0c8fbe3 | 2005-11-17 06:41:44 +0000 | [diff] [blame] | 583 | break; |
| 584 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 585 | break; |
Chris Lattner | 08951a3 | 2005-09-02 01:15:01 +0000 | [diff] [blame] | 586 | case ISD::AssertSext: |
| 587 | case ISD::AssertZext: |
| 588 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 589 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1)); |
Chris Lattner | 08951a3 | 2005-09-02 01:15:01 +0000 | [diff] [blame] | 590 | break; |
Chris Lattner | 308575b | 2005-11-20 22:56:56 +0000 | [diff] [blame] | 591 | case ISD::MERGE_VALUES: |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 592 | // Legalize eliminates MERGE_VALUES nodes. |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 593 | Result = Node->getOperand(Op.ResNo); |
| 594 | break; |
Chris Lattner | 69a5215 | 2005-01-14 22:38:01 +0000 | [diff] [blame] | 595 | case ISD::CopyFromReg: |
| 596 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
Chris Lattner | 7310fb1 | 2005-12-18 15:27:43 +0000 | [diff] [blame] | 597 | Result = Op.getValue(0); |
Chris Lattner | f1a47c3 | 2005-12-18 15:36:21 +0000 | [diff] [blame] | 598 | if (Node->getNumValues() == 2) { |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 599 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1)); |
Chris Lattner | 7310fb1 | 2005-12-18 15:27:43 +0000 | [diff] [blame] | 600 | } else { |
Chris Lattner | f1a47c3 | 2005-12-18 15:36:21 +0000 | [diff] [blame] | 601 | assert(Node->getNumValues() == 3 && "Invalid copyfromreg!"); |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 602 | if (Node->getNumOperands() == 3) { |
Chris Lattner | f1a47c3 | 2005-12-18 15:36:21 +0000 | [diff] [blame] | 603 | Tmp2 = LegalizeOp(Node->getOperand(2)); |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 604 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1),Tmp2); |
| 605 | } else { |
| 606 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1)); |
| 607 | } |
Chris Lattner | 7310fb1 | 2005-12-18 15:27:43 +0000 | [diff] [blame] | 608 | AddLegalizedOperand(Op.getValue(2), Result.getValue(2)); |
| 609 | } |
Chris Lattner | 13c184d | 2005-01-28 06:27:38 +0000 | [diff] [blame] | 610 | // Since CopyFromReg produces two values, make sure to remember that we |
| 611 | // legalized both of them. |
| 612 | AddLegalizedOperand(Op.getValue(0), Result); |
| 613 | AddLegalizedOperand(Op.getValue(1), Result.getValue(1)); |
| 614 | return Result.getValue(Op.ResNo); |
Nate Begeman | fc1b1da | 2005-04-01 22:34:39 +0000 | [diff] [blame] | 615 | case ISD::UNDEF: { |
| 616 | MVT::ValueType VT = Op.getValueType(); |
| 617 | switch (TLI.getOperationAction(ISD::UNDEF, VT)) { |
Nate Begeman | ea19cd5 | 2005-04-02 00:41:14 +0000 | [diff] [blame] | 618 | default: assert(0 && "This action is not supported yet!"); |
| 619 | case TargetLowering::Expand: |
Nate Begeman | fc1b1da | 2005-04-01 22:34:39 +0000 | [diff] [blame] | 620 | if (MVT::isInteger(VT)) |
| 621 | Result = DAG.getConstant(0, VT); |
| 622 | else if (MVT::isFloatingPoint(VT)) |
| 623 | Result = DAG.getConstantFP(0, VT); |
| 624 | else |
| 625 | assert(0 && "Unknown value type!"); |
| 626 | break; |
Nate Begeman | ea19cd5 | 2005-04-02 00:41:14 +0000 | [diff] [blame] | 627 | case TargetLowering::Legal: |
Nate Begeman | fc1b1da | 2005-04-01 22:34:39 +0000 | [diff] [blame] | 628 | break; |
| 629 | } |
| 630 | break; |
| 631 | } |
Chris Lattner | d1f04d4 | 2006-03-24 02:26:29 +0000 | [diff] [blame] | 632 | |
Chris Lattner | 48b61a7 | 2006-03-28 00:40:33 +0000 | [diff] [blame] | 633 | case ISD::INTRINSIC_W_CHAIN: |
| 634 | case ISD::INTRINSIC_WO_CHAIN: |
| 635 | case ISD::INTRINSIC_VOID: { |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 636 | SmallVector<SDOperand, 8> Ops; |
Chris Lattner | d1f04d4 | 2006-03-24 02:26:29 +0000 | [diff] [blame] | 637 | for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) |
| 638 | Ops.push_back(LegalizeOp(Node->getOperand(i))); |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 639 | Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size()); |
Chris Lattner | 10d7fa6 | 2006-03-26 09:12:51 +0000 | [diff] [blame] | 640 | |
| 641 | // Allow the target to custom lower its intrinsics if it wants to. |
Chris Lattner | 48b61a7 | 2006-03-28 00:40:33 +0000 | [diff] [blame] | 642 | if (TLI.getOperationAction(Node->getOpcode(), MVT::Other) == |
Chris Lattner | 10d7fa6 | 2006-03-26 09:12:51 +0000 | [diff] [blame] | 643 | TargetLowering::Custom) { |
| 644 | Tmp3 = TLI.LowerOperation(Result, DAG); |
| 645 | if (Tmp3.Val) Result = Tmp3; |
Chris Lattner | 13fc2f1 | 2006-03-27 20:28:29 +0000 | [diff] [blame] | 646 | } |
| 647 | |
| 648 | if (Result.Val->getNumValues() == 1) break; |
| 649 | |
| 650 | // Must have return value and chain result. |
| 651 | assert(Result.Val->getNumValues() == 2 && |
| 652 | "Cannot return more than two values!"); |
| 653 | |
| 654 | // Since loads produce two values, make sure to remember that we |
| 655 | // legalized both of them. |
| 656 | AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0)); |
| 657 | AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1)); |
| 658 | return Result.getValue(Op.ResNo); |
Chris Lattner | d1f04d4 | 2006-03-24 02:26:29 +0000 | [diff] [blame] | 659 | } |
Chris Lattner | 36ce691 | 2005-11-29 06:21:05 +0000 | [diff] [blame] | 660 | |
| 661 | case ISD::LOCATION: |
| 662 | assert(Node->getNumOperands() == 5 && "Invalid LOCATION node!"); |
| 663 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the input chain. |
| 664 | |
| 665 | switch (TLI.getOperationAction(ISD::LOCATION, MVT::Other)) { |
| 666 | case TargetLowering::Promote: |
| 667 | default: assert(0 && "This action is not supported yet!"); |
Jim Laskey | f5395ce | 2005-12-16 22:45:29 +0000 | [diff] [blame] | 668 | case TargetLowering::Expand: { |
Jim Laskey | b2efb85 | 2006-01-04 22:28:25 +0000 | [diff] [blame] | 669 | MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo(); |
Jim Laskey | abf6d17 | 2006-01-05 01:25:28 +0000 | [diff] [blame] | 670 | bool useDEBUG_LOC = TLI.isOperationLegal(ISD::DEBUG_LOC, MVT::Other); |
| 671 | bool useDEBUG_LABEL = TLI.isOperationLegal(ISD::DEBUG_LABEL, MVT::Other); |
| 672 | |
| 673 | if (DebugInfo && (useDEBUG_LOC || useDEBUG_LABEL)) { |
| 674 | const std::string &FName = |
| 675 | cast<StringSDNode>(Node->getOperand(3))->getValue(); |
| 676 | const std::string &DirName = |
| 677 | cast<StringSDNode>(Node->getOperand(4))->getValue(); |
Jim Laskey | 063e765 | 2006-01-17 17:31:53 +0000 | [diff] [blame] | 678 | unsigned SrcFile = DebugInfo->RecordSource(DirName, FName); |
Jim Laskey | abf6d17 | 2006-01-05 01:25:28 +0000 | [diff] [blame] | 679 | |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 680 | SmallVector<SDOperand, 8> Ops; |
Jim Laskey | e81aecb | 2005-12-21 20:51:37 +0000 | [diff] [blame] | 681 | Ops.push_back(Tmp1); // chain |
Jim Laskey | abf6d17 | 2006-01-05 01:25:28 +0000 | [diff] [blame] | 682 | SDOperand LineOp = Node->getOperand(1); |
| 683 | SDOperand ColOp = Node->getOperand(2); |
| 684 | |
| 685 | if (useDEBUG_LOC) { |
| 686 | Ops.push_back(LineOp); // line # |
| 687 | Ops.push_back(ColOp); // col # |
| 688 | Ops.push_back(DAG.getConstant(SrcFile, MVT::i32)); // source file id |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 689 | Result = DAG.getNode(ISD::DEBUG_LOC, MVT::Other, &Ops[0], Ops.size()); |
Jim Laskey | abf6d17 | 2006-01-05 01:25:28 +0000 | [diff] [blame] | 690 | } else { |
Jim Laskey | d0e58e3 | 2006-02-15 19:34:44 +0000 | [diff] [blame] | 691 | unsigned Line = cast<ConstantSDNode>(LineOp)->getValue(); |
| 692 | unsigned Col = cast<ConstantSDNode>(ColOp)->getValue(); |
Jim Laskey | abf6d17 | 2006-01-05 01:25:28 +0000 | [diff] [blame] | 693 | unsigned ID = DebugInfo->RecordLabel(Line, Col, SrcFile); |
| 694 | Ops.push_back(DAG.getConstant(ID, MVT::i32)); |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 695 | Result = DAG.getNode(ISD::DEBUG_LABEL, MVT::Other,&Ops[0],Ops.size()); |
Jim Laskey | abf6d17 | 2006-01-05 01:25:28 +0000 | [diff] [blame] | 696 | } |
Jim Laskey | e81aecb | 2005-12-21 20:51:37 +0000 | [diff] [blame] | 697 | } else { |
| 698 | Result = Tmp1; // chain |
| 699 | } |
Chris Lattner | 36ce691 | 2005-11-29 06:21:05 +0000 | [diff] [blame] | 700 | break; |
Chris Lattner | e773673 | 2005-12-18 23:54:29 +0000 | [diff] [blame] | 701 | } |
Chris Lattner | 36ce691 | 2005-11-29 06:21:05 +0000 | [diff] [blame] | 702 | case TargetLowering::Legal: |
Chris Lattner | 9ad17c9 | 2005-12-01 18:21:35 +0000 | [diff] [blame] | 703 | if (Tmp1 != Node->getOperand(0) || |
| 704 | getTypeAction(Node->getOperand(1).getValueType()) == Promote) { |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 705 | SmallVector<SDOperand, 8> Ops; |
Chris Lattner | 36ce691 | 2005-11-29 06:21:05 +0000 | [diff] [blame] | 706 | Ops.push_back(Tmp1); |
Chris Lattner | 9ad17c9 | 2005-12-01 18:21:35 +0000 | [diff] [blame] | 707 | if (getTypeAction(Node->getOperand(1).getValueType()) == Legal) { |
| 708 | Ops.push_back(Node->getOperand(1)); // line # must be legal. |
| 709 | Ops.push_back(Node->getOperand(2)); // col # must be legal. |
| 710 | } else { |
| 711 | // Otherwise promote them. |
| 712 | Ops.push_back(PromoteOp(Node->getOperand(1))); |
| 713 | Ops.push_back(PromoteOp(Node->getOperand(2))); |
| 714 | } |
Chris Lattner | 36ce691 | 2005-11-29 06:21:05 +0000 | [diff] [blame] | 715 | Ops.push_back(Node->getOperand(3)); // filename must be legal. |
| 716 | Ops.push_back(Node->getOperand(4)); // working dir # must be legal. |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 717 | Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size()); |
Chris Lattner | 36ce691 | 2005-11-29 06:21:05 +0000 | [diff] [blame] | 718 | } |
| 719 | break; |
| 720 | } |
| 721 | break; |
Jim Laskey | f5395ce | 2005-12-16 22:45:29 +0000 | [diff] [blame] | 722 | |
| 723 | case ISD::DEBUG_LOC: |
Jim Laskey | abf6d17 | 2006-01-05 01:25:28 +0000 | [diff] [blame] | 724 | assert(Node->getNumOperands() == 4 && "Invalid DEBUG_LOC node!"); |
Jim Laskey | f5395ce | 2005-12-16 22:45:29 +0000 | [diff] [blame] | 725 | switch (TLI.getOperationAction(ISD::DEBUG_LOC, MVT::Other)) { |
Jim Laskey | f5395ce | 2005-12-16 22:45:29 +0000 | [diff] [blame] | 726 | default: assert(0 && "This action is not supported yet!"); |
Jim Laskey | abf6d17 | 2006-01-05 01:25:28 +0000 | [diff] [blame] | 727 | case TargetLowering::Legal: |
| 728 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 729 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the line #. |
| 730 | Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the col #. |
| 731 | Tmp4 = LegalizeOp(Node->getOperand(3)); // Legalize the source file id. |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 732 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4); |
Jim Laskey | abf6d17 | 2006-01-05 01:25:28 +0000 | [diff] [blame] | 733 | break; |
| 734 | } |
| 735 | break; |
| 736 | |
| 737 | case ISD::DEBUG_LABEL: |
| 738 | assert(Node->getNumOperands() == 2 && "Invalid DEBUG_LABEL node!"); |
| 739 | switch (TLI.getOperationAction(ISD::DEBUG_LABEL, MVT::Other)) { |
Jim Laskey | abf6d17 | 2006-01-05 01:25:28 +0000 | [diff] [blame] | 740 | default: assert(0 && "This action is not supported yet!"); |
| 741 | case TargetLowering::Legal: |
| 742 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 743 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the label id. |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 744 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2); |
Jim Laskey | f5395ce | 2005-12-16 22:45:29 +0000 | [diff] [blame] | 745 | break; |
| 746 | } |
Nate Begeman | 551bf3f | 2006-02-17 05:43:56 +0000 | [diff] [blame] | 747 | break; |
Chris Lattner | 36ce691 | 2005-11-29 06:21:05 +0000 | [diff] [blame] | 748 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 749 | case ISD::Constant: |
| 750 | // We know we don't need to expand constants here, constants only have one |
| 751 | // value and we check that it is fine above. |
| 752 | |
| 753 | // FIXME: Maybe we should handle things like targets that don't support full |
| 754 | // 32-bit immediates? |
| 755 | break; |
| 756 | case ISD::ConstantFP: { |
| 757 | // Spill FP immediates to the constant pool if the target cannot directly |
| 758 | // codegen them. Targets often have some immediate values that can be |
| 759 | // efficiently generated into an FP register without a load. We explicitly |
| 760 | // leave these constants as ConstantFP nodes for the target to deal with. |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 761 | ConstantFPSDNode *CFP = cast<ConstantFPSDNode>(Node); |
| 762 | |
| 763 | // Check to see if this FP immediate is already legal. |
| 764 | bool isLegal = false; |
| 765 | for (TargetLowering::legal_fpimm_iterator I = TLI.legal_fpimm_begin(), |
| 766 | E = TLI.legal_fpimm_end(); I != E; ++I) |
| 767 | if (CFP->isExactlyValue(*I)) { |
| 768 | isLegal = true; |
| 769 | break; |
| 770 | } |
| 771 | |
Chris Lattner | 3181a77 | 2006-01-29 06:26:56 +0000 | [diff] [blame] | 772 | // If this is a legal constant, turn it into a TargetConstantFP node. |
| 773 | if (isLegal) { |
| 774 | Result = DAG.getTargetConstantFP(CFP->getValue(), CFP->getValueType(0)); |
| 775 | break; |
| 776 | } |
| 777 | |
| 778 | switch (TLI.getOperationAction(ISD::ConstantFP, CFP->getValueType(0))) { |
| 779 | default: assert(0 && "This action is not supported yet!"); |
| 780 | case TargetLowering::Custom: |
| 781 | Tmp3 = TLI.LowerOperation(Result, DAG); |
| 782 | if (Tmp3.Val) { |
| 783 | Result = Tmp3; |
| 784 | break; |
| 785 | } |
| 786 | // FALLTHROUGH |
| 787 | case TargetLowering::Expand: |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 788 | // Otherwise we need to spill the constant to memory. |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 789 | bool Extend = false; |
| 790 | |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 791 | // If a FP immediate is precise when represented as a float and if the |
| 792 | // target can do an extending load from float to double, we put it into |
| 793 | // the constant pool as a float, even if it's is statically typed as a |
| 794 | // double. |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 795 | MVT::ValueType VT = CFP->getValueType(0); |
| 796 | bool isDouble = VT == MVT::f64; |
| 797 | ConstantFP *LLVMC = ConstantFP::get(isDouble ? Type::DoubleTy : |
| 798 | Type::FloatTy, CFP->getValue()); |
Chris Lattner | 99939d3 | 2005-01-28 22:58:25 +0000 | [diff] [blame] | 799 | if (isDouble && CFP->isExactlyValue((float)CFP->getValue()) && |
| 800 | // Only do this if the target has a native EXTLOAD instruction from |
| 801 | // f32. |
Evan Cheng | c548428 | 2006-10-04 00:56:09 +0000 | [diff] [blame] | 802 | TLI.isLoadXLegal(ISD::EXTLOAD, MVT::f32)) { |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 803 | LLVMC = cast<ConstantFP>(ConstantExpr::getCast(LLVMC, Type::FloatTy)); |
| 804 | VT = MVT::f32; |
| 805 | Extend = true; |
| 806 | } |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 807 | |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 808 | SDOperand CPIdx = DAG.getConstantPool(LLVMC, TLI.getPointerTy()); |
Chris Lattner | f8161d8 | 2005-01-16 05:06:12 +0000 | [diff] [blame] | 809 | if (Extend) { |
Chris Lattner | 5f056bf | 2005-07-10 01:55:33 +0000 | [diff] [blame] | 810 | Result = DAG.getExtLoad(ISD::EXTLOAD, MVT::f64, DAG.getEntryNode(), |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 811 | CPIdx, NULL, 0, MVT::f32); |
Chris Lattner | f8161d8 | 2005-01-16 05:06:12 +0000 | [diff] [blame] | 812 | } else { |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 813 | Result = DAG.getLoad(VT, DAG.getEntryNode(), CPIdx, NULL, 0); |
Chris Lattner | f8161d8 | 2005-01-16 05:06:12 +0000 | [diff] [blame] | 814 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 815 | } |
| 816 | break; |
| 817 | } |
Chris Lattner | 040c11c | 2005-11-09 18:48:57 +0000 | [diff] [blame] | 818 | case ISD::TokenFactor: |
| 819 | if (Node->getNumOperands() == 2) { |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 820 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
| 821 | Tmp2 = LegalizeOp(Node->getOperand(1)); |
| 822 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2); |
| 823 | } else if (Node->getNumOperands() == 3) { |
| 824 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
| 825 | Tmp2 = LegalizeOp(Node->getOperand(1)); |
| 826 | Tmp3 = LegalizeOp(Node->getOperand(2)); |
| 827 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3); |
Chris Lattner | 040c11c | 2005-11-09 18:48:57 +0000 | [diff] [blame] | 828 | } else { |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 829 | SmallVector<SDOperand, 8> Ops; |
Chris Lattner | 040c11c | 2005-11-09 18:48:57 +0000 | [diff] [blame] | 830 | // Legalize the operands. |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 831 | for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) |
| 832 | Ops.push_back(LegalizeOp(Node->getOperand(i))); |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 833 | Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size()); |
Chris Lattner | a385e9b | 2005-01-13 17:59:25 +0000 | [diff] [blame] | 834 | } |
Chris Lattner | a385e9b | 2005-01-13 17:59:25 +0000 | [diff] [blame] | 835 | break; |
Chris Lattner | fdfded5 | 2006-04-12 16:20:43 +0000 | [diff] [blame] | 836 | |
| 837 | case ISD::FORMAL_ARGUMENTS: |
Chris Lattner | f4ec817 | 2006-05-16 22:53:20 +0000 | [diff] [blame] | 838 | case ISD::CALL: |
Chris Lattner | fdfded5 | 2006-04-12 16:20:43 +0000 | [diff] [blame] | 839 | // The only option for this is to custom lower it. |
Chris Lattner | b248e16 | 2006-05-17 17:55:45 +0000 | [diff] [blame] | 840 | Tmp3 = TLI.LowerOperation(Result.getValue(0), DAG); |
| 841 | assert(Tmp3.Val && "Target didn't custom lower this node!"); |
| 842 | assert(Tmp3.Val->getNumValues() == Result.Val->getNumValues() && |
| 843 | "Lowering call/formal_arguments produced unexpected # results!"); |
Chris Lattner | e2e4173 | 2006-05-16 05:49:56 +0000 | [diff] [blame] | 844 | |
Chris Lattner | f4ec817 | 2006-05-16 22:53:20 +0000 | [diff] [blame] | 845 | // Since CALL/FORMAL_ARGUMENTS nodes produce multiple values, make sure to |
Chris Lattner | e2e4173 | 2006-05-16 05:49:56 +0000 | [diff] [blame] | 846 | // remember that we legalized all of them, so it doesn't get relegalized. |
Chris Lattner | b248e16 | 2006-05-17 17:55:45 +0000 | [diff] [blame] | 847 | for (unsigned i = 0, e = Tmp3.Val->getNumValues(); i != e; ++i) { |
| 848 | Tmp1 = LegalizeOp(Tmp3.getValue(i)); |
Chris Lattner | e2e4173 | 2006-05-16 05:49:56 +0000 | [diff] [blame] | 849 | if (Op.ResNo == i) |
| 850 | Tmp2 = Tmp1; |
| 851 | AddLegalizedOperand(SDOperand(Node, i), Tmp1); |
| 852 | } |
| 853 | return Tmp2; |
Chris Lattner | fdfded5 | 2006-04-12 16:20:43 +0000 | [diff] [blame] | 854 | |
Chris Lattner | b2827b0 | 2006-03-19 00:52:58 +0000 | [diff] [blame] | 855 | case ISD::BUILD_VECTOR: |
| 856 | switch (TLI.getOperationAction(ISD::BUILD_VECTOR, Node->getValueType(0))) { |
Chris Lattner | 2332b9f | 2006-03-19 01:17:20 +0000 | [diff] [blame] | 857 | default: assert(0 && "This action is not supported yet!"); |
| 858 | case TargetLowering::Custom: |
| 859 | Tmp3 = TLI.LowerOperation(Result, DAG); |
| 860 | if (Tmp3.Val) { |
| 861 | Result = Tmp3; |
| 862 | break; |
| 863 | } |
| 864 | // FALLTHROUGH |
Chris Lattner | ce87215 | 2006-03-19 06:31:19 +0000 | [diff] [blame] | 865 | case TargetLowering::Expand: |
| 866 | Result = ExpandBUILD_VECTOR(Result.Val); |
Chris Lattner | b2827b0 | 2006-03-19 00:52:58 +0000 | [diff] [blame] | 867 | break; |
Chris Lattner | 2332b9f | 2006-03-19 01:17:20 +0000 | [diff] [blame] | 868 | } |
Chris Lattner | 2332b9f | 2006-03-19 01:17:20 +0000 | [diff] [blame] | 869 | break; |
| 870 | case ISD::INSERT_VECTOR_ELT: |
| 871 | Tmp1 = LegalizeOp(Node->getOperand(0)); // InVec |
| 872 | Tmp2 = LegalizeOp(Node->getOperand(1)); // InVal |
| 873 | Tmp3 = LegalizeOp(Node->getOperand(2)); // InEltNo |
| 874 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3); |
| 875 | |
| 876 | switch (TLI.getOperationAction(ISD::INSERT_VECTOR_ELT, |
| 877 | Node->getValueType(0))) { |
| 878 | default: assert(0 && "This action is not supported yet!"); |
| 879 | case TargetLowering::Legal: |
| 880 | break; |
| 881 | case TargetLowering::Custom: |
| 882 | Tmp3 = TLI.LowerOperation(Result, DAG); |
| 883 | if (Tmp3.Val) { |
| 884 | Result = Tmp3; |
| 885 | break; |
| 886 | } |
| 887 | // FALLTHROUGH |
| 888 | case TargetLowering::Expand: { |
Chris Lattner | 8d5a894 | 2006-04-17 19:21:01 +0000 | [diff] [blame] | 889 | // If the insert index is a constant, codegen this as a scalar_to_vector, |
| 890 | // then a shuffle that inserts it into the right position in the vector. |
| 891 | if (ConstantSDNode *InsertPos = dyn_cast<ConstantSDNode>(Tmp3)) { |
| 892 | SDOperand ScVec = DAG.getNode(ISD::SCALAR_TO_VECTOR, |
| 893 | Tmp1.getValueType(), Tmp2); |
| 894 | |
| 895 | unsigned NumElts = MVT::getVectorNumElements(Tmp1.getValueType()); |
| 896 | MVT::ValueType ShufMaskVT = MVT::getIntVectorWithNumElements(NumElts); |
| 897 | MVT::ValueType ShufMaskEltVT = MVT::getVectorBaseType(ShufMaskVT); |
| 898 | |
| 899 | // We generate a shuffle of InVec and ScVec, so the shuffle mask should |
| 900 | // be 0,1,2,3,4,5... with the appropriate element replaced with elt 0 of |
| 901 | // the RHS. |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 902 | SmallVector<SDOperand, 8> ShufOps; |
Chris Lattner | 8d5a894 | 2006-04-17 19:21:01 +0000 | [diff] [blame] | 903 | for (unsigned i = 0; i != NumElts; ++i) { |
| 904 | if (i != InsertPos->getValue()) |
| 905 | ShufOps.push_back(DAG.getConstant(i, ShufMaskEltVT)); |
| 906 | else |
| 907 | ShufOps.push_back(DAG.getConstant(NumElts, ShufMaskEltVT)); |
| 908 | } |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 909 | SDOperand ShufMask = DAG.getNode(ISD::BUILD_VECTOR, ShufMaskVT, |
| 910 | &ShufOps[0], ShufOps.size()); |
Chris Lattner | 8d5a894 | 2006-04-17 19:21:01 +0000 | [diff] [blame] | 911 | |
| 912 | Result = DAG.getNode(ISD::VECTOR_SHUFFLE, Tmp1.getValueType(), |
| 913 | Tmp1, ScVec, ShufMask); |
| 914 | Result = LegalizeOp(Result); |
| 915 | break; |
| 916 | } |
| 917 | |
Chris Lattner | 2332b9f | 2006-03-19 01:17:20 +0000 | [diff] [blame] | 918 | // If the target doesn't support this, we have to spill the input vector |
| 919 | // to a temporary stack slot, update the element, then reload it. This is |
| 920 | // badness. We could also load the value into a vector register (either |
| 921 | // with a "move to register" or "extload into register" instruction, then |
| 922 | // permute it into place, if the idx is a constant and if the idx is |
| 923 | // supported by the target. |
Evan Cheng | f6bf87f | 2006-04-08 01:46:37 +0000 | [diff] [blame] | 924 | MVT::ValueType VT = Tmp1.getValueType(); |
| 925 | MVT::ValueType EltVT = Tmp2.getValueType(); |
| 926 | MVT::ValueType IdxVT = Tmp3.getValueType(); |
| 927 | MVT::ValueType PtrVT = TLI.getPointerTy(); |
| 928 | SDOperand StackPtr = CreateStackTemporary(VT); |
Evan Cheng | eb0b461 | 2006-03-31 01:27:51 +0000 | [diff] [blame] | 929 | // Store the vector. |
Evan Cheng | 786225a | 2006-10-05 23:01:46 +0000 | [diff] [blame] | 930 | SDOperand Ch = DAG.getStore(DAG.getEntryNode(), |
| 931 | Tmp1, StackPtr, DAG.getSrcValue(NULL)); |
Evan Cheng | eb0b461 | 2006-03-31 01:27:51 +0000 | [diff] [blame] | 932 | |
| 933 | // Truncate or zero extend offset to target pointer type. |
Evan Cheng | f6bf87f | 2006-04-08 01:46:37 +0000 | [diff] [blame] | 934 | unsigned CastOpc = (IdxVT > PtrVT) ? ISD::TRUNCATE : ISD::ZERO_EXTEND; |
| 935 | Tmp3 = DAG.getNode(CastOpc, PtrVT, Tmp3); |
Evan Cheng | eb0b461 | 2006-03-31 01:27:51 +0000 | [diff] [blame] | 936 | // Add the offset to the index. |
Evan Cheng | f6bf87f | 2006-04-08 01:46:37 +0000 | [diff] [blame] | 937 | unsigned EltSize = MVT::getSizeInBits(EltVT)/8; |
| 938 | Tmp3 = DAG.getNode(ISD::MUL, IdxVT, Tmp3,DAG.getConstant(EltSize, IdxVT)); |
| 939 | SDOperand StackPtr2 = DAG.getNode(ISD::ADD, IdxVT, Tmp3, StackPtr); |
Evan Cheng | eb0b461 | 2006-03-31 01:27:51 +0000 | [diff] [blame] | 940 | // Store the scalar value. |
Evan Cheng | 786225a | 2006-10-05 23:01:46 +0000 | [diff] [blame] | 941 | Ch = DAG.getStore(Ch, Tmp2, StackPtr2, DAG.getSrcValue(NULL)); |
Evan Cheng | eb0b461 | 2006-03-31 01:27:51 +0000 | [diff] [blame] | 942 | // Load the updated vector. |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 943 | Result = DAG.getLoad(VT, Ch, StackPtr, NULL, 0); |
Chris Lattner | 2332b9f | 2006-03-19 01:17:20 +0000 | [diff] [blame] | 944 | break; |
| 945 | } |
| 946 | } |
| 947 | break; |
Chris Lattner | ce87215 | 2006-03-19 06:31:19 +0000 | [diff] [blame] | 948 | case ISD::SCALAR_TO_VECTOR: |
Chris Lattner | 4352cc9 | 2006-04-04 17:23:26 +0000 | [diff] [blame] | 949 | if (!TLI.isTypeLegal(Node->getOperand(0).getValueType())) { |
| 950 | Result = LegalizeOp(ExpandSCALAR_TO_VECTOR(Node)); |
| 951 | break; |
| 952 | } |
| 953 | |
Chris Lattner | ce87215 | 2006-03-19 06:31:19 +0000 | [diff] [blame] | 954 | Tmp1 = LegalizeOp(Node->getOperand(0)); // InVal |
| 955 | Result = DAG.UpdateNodeOperands(Result, Tmp1); |
| 956 | switch (TLI.getOperationAction(ISD::SCALAR_TO_VECTOR, |
| 957 | Node->getValueType(0))) { |
| 958 | default: assert(0 && "This action is not supported yet!"); |
| 959 | case TargetLowering::Legal: |
| 960 | break; |
Chris Lattner | 4d3abee | 2006-03-19 06:47:21 +0000 | [diff] [blame] | 961 | case TargetLowering::Custom: |
| 962 | Tmp3 = TLI.LowerOperation(Result, DAG); |
| 963 | if (Tmp3.Val) { |
| 964 | Result = Tmp3; |
| 965 | break; |
| 966 | } |
| 967 | // FALLTHROUGH |
Chris Lattner | 4352cc9 | 2006-04-04 17:23:26 +0000 | [diff] [blame] | 968 | case TargetLowering::Expand: |
| 969 | Result = LegalizeOp(ExpandSCALAR_TO_VECTOR(Node)); |
Chris Lattner | ce87215 | 2006-03-19 06:31:19 +0000 | [diff] [blame] | 970 | break; |
| 971 | } |
Chris Lattner | ce87215 | 2006-03-19 06:31:19 +0000 | [diff] [blame] | 972 | break; |
Chris Lattner | 87100e0 | 2006-03-20 01:52:29 +0000 | [diff] [blame] | 973 | case ISD::VECTOR_SHUFFLE: |
Chris Lattner | 87100e0 | 2006-03-20 01:52:29 +0000 | [diff] [blame] | 974 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the input vectors, |
| 975 | Tmp2 = LegalizeOp(Node->getOperand(1)); // but not the shuffle mask. |
| 976 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2)); |
| 977 | |
| 978 | // Allow targets to custom lower the SHUFFLEs they support. |
Chris Lattner | 4352cc9 | 2006-04-04 17:23:26 +0000 | [diff] [blame] | 979 | switch (TLI.getOperationAction(ISD::VECTOR_SHUFFLE,Result.getValueType())) { |
| 980 | default: assert(0 && "Unknown operation action!"); |
| 981 | case TargetLowering::Legal: |
| 982 | assert(isShuffleLegal(Result.getValueType(), Node->getOperand(2)) && |
| 983 | "vector shuffle should not be created if not legal!"); |
| 984 | break; |
| 985 | case TargetLowering::Custom: |
Evan Cheng | 18dd6d0 | 2006-04-05 06:07:11 +0000 | [diff] [blame] | 986 | Tmp3 = TLI.LowerOperation(Result, DAG); |
| 987 | if (Tmp3.Val) { |
| 988 | Result = Tmp3; |
| 989 | break; |
| 990 | } |
| 991 | // FALLTHROUGH |
| 992 | case TargetLowering::Expand: { |
| 993 | MVT::ValueType VT = Node->getValueType(0); |
| 994 | MVT::ValueType EltVT = MVT::getVectorBaseType(VT); |
| 995 | MVT::ValueType PtrVT = TLI.getPointerTy(); |
| 996 | SDOperand Mask = Node->getOperand(2); |
| 997 | unsigned NumElems = Mask.getNumOperands(); |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 998 | SmallVector<SDOperand,8> Ops; |
Evan Cheng | 18dd6d0 | 2006-04-05 06:07:11 +0000 | [diff] [blame] | 999 | for (unsigned i = 0; i != NumElems; ++i) { |
| 1000 | SDOperand Arg = Mask.getOperand(i); |
| 1001 | if (Arg.getOpcode() == ISD::UNDEF) { |
| 1002 | Ops.push_back(DAG.getNode(ISD::UNDEF, EltVT)); |
| 1003 | } else { |
| 1004 | assert(isa<ConstantSDNode>(Arg) && "Invalid VECTOR_SHUFFLE mask!"); |
| 1005 | unsigned Idx = cast<ConstantSDNode>(Arg)->getValue(); |
| 1006 | if (Idx < NumElems) |
| 1007 | Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, EltVT, Tmp1, |
| 1008 | DAG.getConstant(Idx, PtrVT))); |
| 1009 | else |
| 1010 | Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, EltVT, Tmp2, |
| 1011 | DAG.getConstant(Idx - NumElems, PtrVT))); |
| 1012 | } |
| 1013 | } |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 1014 | Result = DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size()); |
Chris Lattner | 4352cc9 | 2006-04-04 17:23:26 +0000 | [diff] [blame] | 1015 | break; |
Evan Cheng | 18dd6d0 | 2006-04-05 06:07:11 +0000 | [diff] [blame] | 1016 | } |
Chris Lattner | 4352cc9 | 2006-04-04 17:23:26 +0000 | [diff] [blame] | 1017 | case TargetLowering::Promote: { |
| 1018 | // Change base type to a different vector type. |
| 1019 | MVT::ValueType OVT = Node->getValueType(0); |
| 1020 | MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT); |
| 1021 | |
| 1022 | // Cast the two input vectors. |
| 1023 | Tmp1 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp1); |
| 1024 | Tmp2 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp2); |
| 1025 | |
| 1026 | // Convert the shuffle mask to the right # elements. |
| 1027 | Tmp3 = SDOperand(isShuffleLegal(OVT, Node->getOperand(2)), 0); |
| 1028 | assert(Tmp3.Val && "Shuffle not legal?"); |
| 1029 | Result = DAG.getNode(ISD::VECTOR_SHUFFLE, NVT, Tmp1, Tmp2, Tmp3); |
| 1030 | Result = DAG.getNode(ISD::BIT_CONVERT, OVT, Result); |
| 1031 | break; |
| 1032 | } |
Chris Lattner | 87100e0 | 2006-03-20 01:52:29 +0000 | [diff] [blame] | 1033 | } |
| 1034 | break; |
Chris Lattner | 384504c | 2006-03-21 20:44:12 +0000 | [diff] [blame] | 1035 | |
| 1036 | case ISD::EXTRACT_VECTOR_ELT: |
| 1037 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
| 1038 | Tmp2 = LegalizeOp(Node->getOperand(1)); |
| 1039 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2); |
Chris Lattner | e35c218 | 2006-03-21 21:02:03 +0000 | [diff] [blame] | 1040 | |
| 1041 | switch (TLI.getOperationAction(ISD::EXTRACT_VECTOR_ELT, |
| 1042 | Tmp1.getValueType())) { |
| 1043 | default: assert(0 && "This action is not supported yet!"); |
| 1044 | case TargetLowering::Legal: |
| 1045 | break; |
| 1046 | case TargetLowering::Custom: |
| 1047 | Tmp3 = TLI.LowerOperation(Result, DAG); |
| 1048 | if (Tmp3.Val) { |
| 1049 | Result = Tmp3; |
| 1050 | break; |
| 1051 | } |
| 1052 | // FALLTHROUGH |
Chris Lattner | 4aab2f4 | 2006-04-02 05:06:04 +0000 | [diff] [blame] | 1053 | case TargetLowering::Expand: |
| 1054 | Result = ExpandEXTRACT_VECTOR_ELT(Result); |
Chris Lattner | e35c218 | 2006-03-21 21:02:03 +0000 | [diff] [blame] | 1055 | break; |
| 1056 | } |
Chris Lattner | 384504c | 2006-03-21 20:44:12 +0000 | [diff] [blame] | 1057 | break; |
| 1058 | |
Chris Lattner | 1597221 | 2006-03-31 17:55:51 +0000 | [diff] [blame] | 1059 | case ISD::VEXTRACT_VECTOR_ELT: |
| 1060 | Result = LegalizeOp(LowerVEXTRACT_VECTOR_ELT(Op)); |
Chris Lattner | 384504c | 2006-03-21 20:44:12 +0000 | [diff] [blame] | 1061 | break; |
Chris Lattner | 87100e0 | 2006-03-20 01:52:29 +0000 | [diff] [blame] | 1062 | |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 1063 | case ISD::CALLSEQ_START: { |
| 1064 | SDNode *CallEnd = FindCallEndFromCallStart(Node); |
| 1065 | |
| 1066 | // Recursively Legalize all of the inputs of the call end that do not lead |
| 1067 | // to this call start. This ensures that any libcalls that need be inserted |
| 1068 | // are inserted *before* the CALLSEQ_START. |
Chris Lattner | c9cf4f1 | 2006-07-26 23:55:56 +0000 | [diff] [blame] | 1069 | {std::set<SDNode*> NodesLeadingTo; |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 1070 | for (unsigned i = 0, e = CallEnd->getNumOperands(); i != e; ++i) |
Chris Lattner | c9cf4f1 | 2006-07-26 23:55:56 +0000 | [diff] [blame] | 1071 | LegalizeAllNodesNotLeadingTo(CallEnd->getOperand(i).Val, Node, |
| 1072 | NodesLeadingTo); |
| 1073 | } |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 1074 | |
| 1075 | // Now that we legalized all of the inputs (which may have inserted |
| 1076 | // libcalls) create the new CALLSEQ_START node. |
| 1077 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 1078 | |
| 1079 | // Merge in the last call, to ensure that this call start after the last |
| 1080 | // call ended. |
Chris Lattner | c5d7d7c | 2006-05-17 18:00:08 +0000 | [diff] [blame] | 1081 | if (LastCALLSEQ_END.getOpcode() != ISD::EntryToken) { |
Chris Lattner | b248e16 | 2006-05-17 17:55:45 +0000 | [diff] [blame] | 1082 | Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END); |
| 1083 | Tmp1 = LegalizeOp(Tmp1); |
| 1084 | } |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 1085 | |
| 1086 | // Do not try to legalize the target-specific arguments (#1+). |
| 1087 | if (Tmp1 != Node->getOperand(0)) { |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 1088 | SmallVector<SDOperand, 8> Ops(Node->op_begin(), Node->op_end()); |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 1089 | Ops[0] = Tmp1; |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 1090 | Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size()); |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 1091 | } |
| 1092 | |
| 1093 | // Remember that the CALLSEQ_START is legalized. |
Chris Lattner | 4b653a0 | 2006-02-14 00:55:02 +0000 | [diff] [blame] | 1094 | AddLegalizedOperand(Op.getValue(0), Result); |
| 1095 | if (Node->getNumValues() == 2) // If this has a flag result, remember it. |
| 1096 | AddLegalizedOperand(Op.getValue(1), Result.getValue(1)); |
| 1097 | |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 1098 | // Now that the callseq_start and all of the non-call nodes above this call |
| 1099 | // sequence have been legalized, legalize the call itself. During this |
| 1100 | // process, no libcalls can/will be inserted, guaranteeing that no calls |
| 1101 | // can overlap. |
| 1102 | assert(!IsLegalizingCall && "Inconsistent sequentialization of calls!"); |
| 1103 | SDOperand InCallSEQ = LastCALLSEQ_END; |
| 1104 | // Note that we are selecting this call! |
| 1105 | LastCALLSEQ_END = SDOperand(CallEnd, 0); |
| 1106 | IsLegalizingCall = true; |
| 1107 | |
| 1108 | // Legalize the call, starting from the CALLSEQ_END. |
| 1109 | LegalizeOp(LastCALLSEQ_END); |
| 1110 | assert(!IsLegalizingCall && "CALLSEQ_END should have cleared this!"); |
| 1111 | return Result; |
| 1112 | } |
Chris Lattner | 16cd04d | 2005-05-12 23:24:06 +0000 | [diff] [blame] | 1113 | case ISD::CALLSEQ_END: |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 1114 | // If the CALLSEQ_START node hasn't been legalized first, legalize it. This |
| 1115 | // will cause this node to be legalized as well as handling libcalls right. |
| 1116 | if (LastCALLSEQ_END.Val != Node) { |
| 1117 | LegalizeOp(SDOperand(FindCallStartFromCallEnd(Node), 0)); |
| 1118 | std::map<SDOperand, SDOperand>::iterator I = LegalizedNodes.find(Op); |
| 1119 | assert(I != LegalizedNodes.end() && |
| 1120 | "Legalizing the call start should have legalized this node!"); |
| 1121 | return I->second; |
| 1122 | } |
| 1123 | |
| 1124 | // Otherwise, the call start has been legalized and everything is going |
| 1125 | // according to plan. Just legalize ourselves normally here. |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1126 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
Chris Lattner | 70814bc | 2006-01-29 07:58:15 +0000 | [diff] [blame] | 1127 | // Do not try to legalize the target-specific arguments (#1+), except for |
| 1128 | // an optional flag input. |
| 1129 | if (Node->getOperand(Node->getNumOperands()-1).getValueType() != MVT::Flag){ |
| 1130 | if (Tmp1 != Node->getOperand(0)) { |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 1131 | SmallVector<SDOperand, 8> Ops(Node->op_begin(), Node->op_end()); |
Chris Lattner | 70814bc | 2006-01-29 07:58:15 +0000 | [diff] [blame] | 1132 | Ops[0] = Tmp1; |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 1133 | Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size()); |
Chris Lattner | 70814bc | 2006-01-29 07:58:15 +0000 | [diff] [blame] | 1134 | } |
| 1135 | } else { |
| 1136 | Tmp2 = LegalizeOp(Node->getOperand(Node->getNumOperands()-1)); |
| 1137 | if (Tmp1 != Node->getOperand(0) || |
| 1138 | Tmp2 != Node->getOperand(Node->getNumOperands()-1)) { |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 1139 | SmallVector<SDOperand, 8> Ops(Node->op_begin(), Node->op_end()); |
Chris Lattner | 70814bc | 2006-01-29 07:58:15 +0000 | [diff] [blame] | 1140 | Ops[0] = Tmp1; |
| 1141 | Ops.back() = Tmp2; |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 1142 | Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size()); |
Chris Lattner | 70814bc | 2006-01-29 07:58:15 +0000 | [diff] [blame] | 1143 | } |
Chris Lattner | 6a54289 | 2006-01-24 05:48:21 +0000 | [diff] [blame] | 1144 | } |
Chris Lattner | 4b653a0 | 2006-02-14 00:55:02 +0000 | [diff] [blame] | 1145 | assert(IsLegalizingCall && "Call sequence imbalance between start/end?"); |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 1146 | // This finishes up call legalization. |
| 1147 | IsLegalizingCall = false; |
Chris Lattner | 4b653a0 | 2006-02-14 00:55:02 +0000 | [diff] [blame] | 1148 | |
| 1149 | // If the CALLSEQ_END node has a flag, remember that we legalized it. |
| 1150 | AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0)); |
| 1151 | if (Node->getNumValues() == 2) |
| 1152 | AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1)); |
| 1153 | return Result.getValue(Op.ResNo); |
Evan Cheng | a7dce3c | 2006-01-11 22:14:47 +0000 | [diff] [blame] | 1154 | case ISD::DYNAMIC_STACKALLOC: { |
Chris Lattner | fa404e8 | 2005-01-09 19:03:49 +0000 | [diff] [blame] | 1155 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 1156 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the size. |
| 1157 | Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the alignment. |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1158 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3); |
Chris Lattner | fa404e8 | 2005-01-09 19:03:49 +0000 | [diff] [blame] | 1159 | |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1160 | Tmp1 = Result.getValue(0); |
Chris Lattner | 5f65229 | 2006-01-15 08:43:08 +0000 | [diff] [blame] | 1161 | Tmp2 = Result.getValue(1); |
Evan Cheng | a7dce3c | 2006-01-11 22:14:47 +0000 | [diff] [blame] | 1162 | switch (TLI.getOperationAction(Node->getOpcode(), |
| 1163 | Node->getValueType(0))) { |
| 1164 | default: assert(0 && "This action is not supported yet!"); |
Chris Lattner | 903d278 | 2006-01-15 08:54:32 +0000 | [diff] [blame] | 1165 | case TargetLowering::Expand: { |
| 1166 | unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore(); |
| 1167 | assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and" |
| 1168 | " not tell us which reg is the stack pointer!"); |
| 1169 | SDOperand Chain = Tmp1.getOperand(0); |
| 1170 | SDOperand Size = Tmp2.getOperand(1); |
| 1171 | SDOperand SP = DAG.getCopyFromReg(Chain, SPReg, Node->getValueType(0)); |
| 1172 | Tmp1 = DAG.getNode(ISD::SUB, Node->getValueType(0), SP, Size); // Value |
| 1173 | Tmp2 = DAG.getCopyToReg(SP.getValue(1), SPReg, Tmp1); // Output chain |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1174 | Tmp1 = LegalizeOp(Tmp1); |
| 1175 | Tmp2 = LegalizeOp(Tmp2); |
Chris Lattner | 903d278 | 2006-01-15 08:54:32 +0000 | [diff] [blame] | 1176 | break; |
| 1177 | } |
| 1178 | case TargetLowering::Custom: |
Chris Lattner | 5f65229 | 2006-01-15 08:43:08 +0000 | [diff] [blame] | 1179 | Tmp3 = TLI.LowerOperation(Tmp1, DAG); |
| 1180 | if (Tmp3.Val) { |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1181 | Tmp1 = LegalizeOp(Tmp3); |
| 1182 | Tmp2 = LegalizeOp(Tmp3.getValue(1)); |
Evan Cheng | a7dce3c | 2006-01-11 22:14:47 +0000 | [diff] [blame] | 1183 | } |
Chris Lattner | 903d278 | 2006-01-15 08:54:32 +0000 | [diff] [blame] | 1184 | break; |
Evan Cheng | a7dce3c | 2006-01-11 22:14:47 +0000 | [diff] [blame] | 1185 | case TargetLowering::Legal: |
Chris Lattner | 903d278 | 2006-01-15 08:54:32 +0000 | [diff] [blame] | 1186 | break; |
Evan Cheng | a7dce3c | 2006-01-11 22:14:47 +0000 | [diff] [blame] | 1187 | } |
Chris Lattner | 903d278 | 2006-01-15 08:54:32 +0000 | [diff] [blame] | 1188 | // Since this op produce two values, make sure to remember that we |
| 1189 | // legalized both of them. |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1190 | AddLegalizedOperand(SDOperand(Node, 0), Tmp1); |
| 1191 | AddLegalizedOperand(SDOperand(Node, 1), Tmp2); |
Chris Lattner | 903d278 | 2006-01-15 08:54:32 +0000 | [diff] [blame] | 1192 | return Op.ResNo ? Tmp2 : Tmp1; |
Evan Cheng | a7dce3c | 2006-01-11 22:14:47 +0000 | [diff] [blame] | 1193 | } |
Chris Lattner | 25a022c | 2006-07-11 01:40:09 +0000 | [diff] [blame] | 1194 | case ISD::INLINEASM: { |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 1195 | SmallVector<SDOperand, 8> Ops(Node->op_begin(), Node->op_end()); |
Chris Lattner | 25a022c | 2006-07-11 01:40:09 +0000 | [diff] [blame] | 1196 | bool Changed = false; |
| 1197 | // Legalize all of the operands of the inline asm, in case they are nodes |
| 1198 | // that need to be expanded or something. Note we skip the asm string and |
| 1199 | // all of the TargetConstant flags. |
| 1200 | SDOperand Op = LegalizeOp(Ops[0]); |
| 1201 | Changed = Op != Ops[0]; |
| 1202 | Ops[0] = Op; |
| 1203 | |
| 1204 | bool HasInFlag = Ops.back().getValueType() == MVT::Flag; |
| 1205 | for (unsigned i = 2, e = Ops.size()-HasInFlag; i < e; ) { |
| 1206 | unsigned NumVals = cast<ConstantSDNode>(Ops[i])->getValue() >> 3; |
| 1207 | for (++i; NumVals; ++i, --NumVals) { |
| 1208 | SDOperand Op = LegalizeOp(Ops[i]); |
| 1209 | if (Op != Ops[i]) { |
| 1210 | Changed = true; |
| 1211 | Ops[i] = Op; |
| 1212 | } |
| 1213 | } |
Chris Lattner | ce7518c | 2006-01-26 22:24:51 +0000 | [diff] [blame] | 1214 | } |
Chris Lattner | 25a022c | 2006-07-11 01:40:09 +0000 | [diff] [blame] | 1215 | |
| 1216 | if (HasInFlag) { |
| 1217 | Op = LegalizeOp(Ops.back()); |
| 1218 | Changed |= Op != Ops.back(); |
| 1219 | Ops.back() = Op; |
| 1220 | } |
| 1221 | |
| 1222 | if (Changed) |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 1223 | Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size()); |
Chris Lattner | ce7518c | 2006-01-26 22:24:51 +0000 | [diff] [blame] | 1224 | |
| 1225 | // INLINE asm returns a chain and flag, make sure to add both to the map. |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1226 | AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0)); |
Chris Lattner | ce7518c | 2006-01-26 22:24:51 +0000 | [diff] [blame] | 1227 | AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1)); |
| 1228 | return Result.getValue(Op.ResNo); |
Chris Lattner | 25a022c | 2006-07-11 01:40:09 +0000 | [diff] [blame] | 1229 | } |
Chris Lattner | c7af179 | 2005-01-07 22:12:08 +0000 | [diff] [blame] | 1230 | case ISD::BR: |
| 1231 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 1232 | // Ensure that libcalls are emitted before a branch. |
| 1233 | Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END); |
| 1234 | Tmp1 = LegalizeOp(Tmp1); |
| 1235 | LastCALLSEQ_END = DAG.getEntryNode(); |
| 1236 | |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1237 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1)); |
Chris Lattner | c7af179 | 2005-01-07 22:12:08 +0000 | [diff] [blame] | 1238 | break; |
Nate Begeman | 37efe67 | 2006-04-22 18:53:45 +0000 | [diff] [blame] | 1239 | case ISD::BRIND: |
| 1240 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 1241 | // Ensure that libcalls are emitted before a branch. |
| 1242 | Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END); |
| 1243 | Tmp1 = LegalizeOp(Tmp1); |
| 1244 | LastCALLSEQ_END = DAG.getEntryNode(); |
| 1245 | |
| 1246 | switch (getTypeAction(Node->getOperand(1).getValueType())) { |
| 1247 | default: assert(0 && "Indirect target must be legal type (pointer)!"); |
| 1248 | case Legal: |
| 1249 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the condition. |
| 1250 | break; |
| 1251 | } |
| 1252 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2); |
| 1253 | break; |
Chris Lattner | c18ae4c | 2005-01-07 08:19:42 +0000 | [diff] [blame] | 1254 | case ISD::BRCOND: |
| 1255 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 1256 | // Ensure that libcalls are emitted before a return. |
| 1257 | Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END); |
| 1258 | Tmp1 = LegalizeOp(Tmp1); |
| 1259 | LastCALLSEQ_END = DAG.getEntryNode(); |
| 1260 | |
Chris Lattner | 47e9223 | 2005-01-18 19:27:06 +0000 | [diff] [blame] | 1261 | switch (getTypeAction(Node->getOperand(1).getValueType())) { |
| 1262 | case Expand: assert(0 && "It's impossible to expand bools"); |
| 1263 | case Legal: |
| 1264 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the condition. |
| 1265 | break; |
| 1266 | case Promote: |
| 1267 | Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the condition. |
| 1268 | break; |
| 1269 | } |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1270 | |
| 1271 | // Basic block destination (Op#2) is always legal. |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1272 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2)); |
Nate Begeman | 7cbd525 | 2005-08-16 19:49:35 +0000 | [diff] [blame] | 1273 | |
| 1274 | switch (TLI.getOperationAction(ISD::BRCOND, MVT::Other)) { |
| 1275 | default: assert(0 && "This action is not supported yet!"); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1276 | case TargetLowering::Legal: break; |
| 1277 | case TargetLowering::Custom: |
| 1278 | Tmp1 = TLI.LowerOperation(Result, DAG); |
| 1279 | if (Tmp1.Val) Result = Tmp1; |
| 1280 | break; |
Nate Begeman | 7cbd525 | 2005-08-16 19:49:35 +0000 | [diff] [blame] | 1281 | case TargetLowering::Expand: |
| 1282 | // Expand brcond's setcc into its constituent parts and create a BR_CC |
| 1283 | // Node. |
| 1284 | if (Tmp2.getOpcode() == ISD::SETCC) { |
| 1285 | Result = DAG.getNode(ISD::BR_CC, MVT::Other, Tmp1, Tmp2.getOperand(2), |
| 1286 | Tmp2.getOperand(0), Tmp2.getOperand(1), |
| 1287 | Node->getOperand(2)); |
| 1288 | } else { |
Chris Lattner | 550b1e5 | 2005-08-21 18:03:09 +0000 | [diff] [blame] | 1289 | // Make sure the condition is either zero or one. It may have been |
| 1290 | // promoted from something else. |
Chris Lattner | 19c5c4c | 2006-01-31 05:04:52 +0000 | [diff] [blame] | 1291 | unsigned NumBits = MVT::getSizeInBits(Tmp2.getValueType()); |
| 1292 | if (!TLI.MaskedValueIsZero(Tmp2, (~0ULL >> (64-NumBits))^1)) |
| 1293 | Tmp2 = DAG.getZeroExtendInReg(Tmp2, MVT::i1); |
Chris Lattner | 550b1e5 | 2005-08-21 18:03:09 +0000 | [diff] [blame] | 1294 | |
Nate Begeman | 7cbd525 | 2005-08-16 19:49:35 +0000 | [diff] [blame] | 1295 | Result = DAG.getNode(ISD::BR_CC, MVT::Other, Tmp1, |
| 1296 | DAG.getCondCode(ISD::SETNE), Tmp2, |
| 1297 | DAG.getConstant(0, Tmp2.getValueType()), |
| 1298 | Node->getOperand(2)); |
| 1299 | } |
| 1300 | break; |
Nate Begeman | 7cbd525 | 2005-08-16 19:49:35 +0000 | [diff] [blame] | 1301 | } |
| 1302 | break; |
| 1303 | case ISD::BR_CC: |
| 1304 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 1305 | // Ensure that libcalls are emitted before a branch. |
| 1306 | Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END); |
| 1307 | Tmp1 = LegalizeOp(Tmp1); |
| 1308 | LastCALLSEQ_END = DAG.getEntryNode(); |
| 1309 | |
Nate Begeman | 750ac1b | 2006-02-01 07:19:44 +0000 | [diff] [blame] | 1310 | Tmp2 = Node->getOperand(2); // LHS |
| 1311 | Tmp3 = Node->getOperand(3); // RHS |
| 1312 | Tmp4 = Node->getOperand(1); // CC |
| 1313 | |
| 1314 | LegalizeSetCCOperands(Tmp2, Tmp3, Tmp4); |
| 1315 | |
| 1316 | // If we didn't get both a LHS and RHS back from LegalizeSetCCOperands, |
| 1317 | // the LHS is a legal SETCC itself. In this case, we need to compare |
| 1318 | // the result against zero to select between true and false values. |
| 1319 | if (Tmp3.Val == 0) { |
| 1320 | Tmp3 = DAG.getConstant(0, Tmp2.getValueType()); |
| 1321 | Tmp4 = DAG.getCondCode(ISD::SETNE); |
Chris Lattner | 181b7a3 | 2005-12-17 23:46:46 +0000 | [diff] [blame] | 1322 | } |
Nate Begeman | 750ac1b | 2006-02-01 07:19:44 +0000 | [diff] [blame] | 1323 | |
| 1324 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp4, Tmp2, Tmp3, |
| 1325 | Node->getOperand(4)); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1326 | |
Chris Lattner | 181b7a3 | 2005-12-17 23:46:46 +0000 | [diff] [blame] | 1327 | switch (TLI.getOperationAction(ISD::BR_CC, Tmp3.getValueType())) { |
| 1328 | default: assert(0 && "Unexpected action for BR_CC!"); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1329 | case TargetLowering::Legal: break; |
| 1330 | case TargetLowering::Custom: |
| 1331 | Tmp4 = TLI.LowerOperation(Result, DAG); |
| 1332 | if (Tmp4.Val) Result = Tmp4; |
Chris Lattner | 181b7a3 | 2005-12-17 23:46:46 +0000 | [diff] [blame] | 1333 | break; |
Nate Begeman | 7cbd525 | 2005-08-16 19:49:35 +0000 | [diff] [blame] | 1334 | } |
Chris Lattner | c18ae4c | 2005-01-07 08:19:42 +0000 | [diff] [blame] | 1335 | break; |
Evan Cheng | f3fd9fe | 2005-12-23 07:29:34 +0000 | [diff] [blame] | 1336 | case ISD::LOAD: { |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 1337 | LoadSDNode *LD = cast<LoadSDNode>(Node); |
| 1338 | Tmp1 = LegalizeOp(LD->getChain()); // Legalize the chain. |
| 1339 | Tmp2 = LegalizeOp(LD->getBasePtr()); // Legalize the base pointer. |
Andrew Lenharth | 2d86ea2 | 2005-04-27 20:10:01 +0000 | [diff] [blame] | 1340 | |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 1341 | ISD::LoadExtType ExtType = LD->getExtensionType(); |
| 1342 | if (ExtType == ISD::NON_EXTLOAD) { |
| 1343 | MVT::ValueType VT = Node->getValueType(0); |
| 1344 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, LD->getOffset()); |
| 1345 | Tmp3 = Result.getValue(0); |
| 1346 | Tmp4 = Result.getValue(1); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1347 | |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 1348 | switch (TLI.getOperationAction(Node->getOpcode(), VT)) { |
| 1349 | default: assert(0 && "This action is not supported yet!"); |
| 1350 | case TargetLowering::Legal: break; |
| 1351 | case TargetLowering::Custom: |
| 1352 | Tmp1 = TLI.LowerOperation(Tmp3, DAG); |
| 1353 | if (Tmp1.Val) { |
| 1354 | Tmp3 = LegalizeOp(Tmp1); |
| 1355 | Tmp4 = LegalizeOp(Tmp1.getValue(1)); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1356 | } |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 1357 | break; |
| 1358 | case TargetLowering::Promote: { |
| 1359 | // Only promote a load of vector type to another. |
| 1360 | assert(MVT::isVector(VT) && "Cannot promote this load!"); |
| 1361 | // Change base type to a different vector type. |
| 1362 | MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), VT); |
| 1363 | |
| 1364 | Tmp1 = DAG.getLoad(NVT, Tmp1, Tmp2, LD->getSrcValue(), |
| 1365 | LD->getSrcValueOffset()); |
| 1366 | Tmp3 = LegalizeOp(DAG.getNode(ISD::BIT_CONVERT, VT, Tmp1)); |
| 1367 | Tmp4 = LegalizeOp(Tmp1.getValue(1)); |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1368 | break; |
Andrew Lenharth | 9d416f7 | 2005-06-30 19:22:37 +0000 | [diff] [blame] | 1369 | } |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 1370 | } |
| 1371 | // Since loads produce two values, make sure to remember that we |
| 1372 | // legalized both of them. |
| 1373 | AddLegalizedOperand(SDOperand(Node, 0), Tmp3); |
| 1374 | AddLegalizedOperand(SDOperand(Node, 1), Tmp4); |
| 1375 | return Op.ResNo ? Tmp4 : Tmp3; |
| 1376 | } else { |
| 1377 | MVT::ValueType SrcVT = LD->getLoadVT(); |
| 1378 | switch (TLI.getLoadXAction(ExtType, SrcVT)) { |
| 1379 | default: assert(0 && "This action is not supported yet!"); |
| 1380 | case TargetLowering::Promote: |
| 1381 | assert(SrcVT == MVT::i1 && |
| 1382 | "Can only promote extending LOAD from i1 -> i8!"); |
| 1383 | Result = DAG.getExtLoad(ExtType, Node->getValueType(0), Tmp1, Tmp2, |
| 1384 | LD->getSrcValue(), LD->getSrcValueOffset(), |
| 1385 | MVT::i8); |
| 1386 | Tmp1 = Result.getValue(0); |
| 1387 | Tmp2 = Result.getValue(1); |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1388 | break; |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 1389 | case TargetLowering::Custom: |
| 1390 | isCustom = true; |
| 1391 | // FALLTHROUGH |
| 1392 | case TargetLowering::Legal: |
| 1393 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, LD->getOffset()); |
| 1394 | Tmp1 = Result.getValue(0); |
| 1395 | Tmp2 = Result.getValue(1); |
| 1396 | |
| 1397 | if (isCustom) { |
| 1398 | Tmp3 = TLI.LowerOperation(Result, DAG); |
| 1399 | if (Tmp3.Val) { |
| 1400 | Tmp1 = LegalizeOp(Tmp3); |
| 1401 | Tmp2 = LegalizeOp(Tmp3.getValue(1)); |
| 1402 | } |
| 1403 | } |
| 1404 | break; |
| 1405 | case TargetLowering::Expand: |
| 1406 | // f64 = EXTLOAD f32 should expand to LOAD, FP_EXTEND |
| 1407 | if (SrcVT == MVT::f32 && Node->getValueType(0) == MVT::f64) { |
| 1408 | SDOperand Load = DAG.getLoad(SrcVT, Tmp1, Tmp2, LD->getSrcValue(), |
| 1409 | LD->getSrcValueOffset()); |
| 1410 | Result = DAG.getNode(ISD::FP_EXTEND, Node->getValueType(0), Load); |
| 1411 | Tmp1 = LegalizeOp(Result); // Relegalize new nodes. |
| 1412 | Tmp2 = LegalizeOp(Load.getValue(1)); |
| 1413 | break; |
| 1414 | } |
| 1415 | assert(ExtType != ISD::EXTLOAD && "EXTLOAD should always be supported!"); |
| 1416 | // Turn the unsupported load into an EXTLOAD followed by an explicit |
| 1417 | // zero/sign extend inreg. |
| 1418 | Result = DAG.getExtLoad(ISD::EXTLOAD, Node->getValueType(0), |
| 1419 | Tmp1, Tmp2, LD->getSrcValue(), |
| 1420 | LD->getSrcValueOffset(), SrcVT); |
| 1421 | SDOperand ValRes; |
| 1422 | if (ExtType == ISD::SEXTLOAD) |
| 1423 | ValRes = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(), |
| 1424 | Result, DAG.getValueType(SrcVT)); |
| 1425 | else |
| 1426 | ValRes = DAG.getZeroExtendInReg(Result, SrcVT); |
| 1427 | Tmp1 = LegalizeOp(ValRes); // Relegalize new nodes. |
| 1428 | Tmp2 = LegalizeOp(Result.getValue(1)); // Relegalize new nodes. |
| 1429 | break; |
| 1430 | } |
| 1431 | // Since loads produce two values, make sure to remember that we legalized |
| 1432 | // both of them. |
| 1433 | AddLegalizedOperand(SDOperand(Node, 0), Tmp1); |
| 1434 | AddLegalizedOperand(SDOperand(Node, 1), Tmp2); |
| 1435 | return Op.ResNo ? Tmp2 : Tmp1; |
Chris Lattner | 01ff721 | 2005-04-10 22:54:25 +0000 | [diff] [blame] | 1436 | } |
Chris Lattner | 01ff721 | 2005-04-10 22:54:25 +0000 | [diff] [blame] | 1437 | } |
Nate Begeman | 5dc897b | 2005-10-19 00:06:56 +0000 | [diff] [blame] | 1438 | case ISD::EXTRACT_ELEMENT: { |
| 1439 | MVT::ValueType OpTy = Node->getOperand(0).getValueType(); |
| 1440 | switch (getTypeAction(OpTy)) { |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1441 | default: assert(0 && "EXTRACT_ELEMENT action for type unimplemented!"); |
Nate Begeman | 5dc897b | 2005-10-19 00:06:56 +0000 | [diff] [blame] | 1442 | case Legal: |
| 1443 | if (cast<ConstantSDNode>(Node->getOperand(1))->getValue()) { |
| 1444 | // 1 -> Hi |
| 1445 | Result = DAG.getNode(ISD::SRL, OpTy, Node->getOperand(0), |
| 1446 | DAG.getConstant(MVT::getSizeInBits(OpTy)/2, |
| 1447 | TLI.getShiftAmountTy())); |
| 1448 | Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0), Result); |
| 1449 | } else { |
| 1450 | // 0 -> Lo |
| 1451 | Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0), |
| 1452 | Node->getOperand(0)); |
| 1453 | } |
Nate Begeman | 5dc897b | 2005-10-19 00:06:56 +0000 | [diff] [blame] | 1454 | break; |
| 1455 | case Expand: |
| 1456 | // Get both the low and high parts. |
| 1457 | ExpandOp(Node->getOperand(0), Tmp1, Tmp2); |
| 1458 | if (cast<ConstantSDNode>(Node->getOperand(1))->getValue()) |
| 1459 | Result = Tmp2; // 1 -> Hi |
| 1460 | else |
| 1461 | Result = Tmp1; // 0 -> Lo |
| 1462 | break; |
| 1463 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1464 | break; |
Nate Begeman | 5dc897b | 2005-10-19 00:06:56 +0000 | [diff] [blame] | 1465 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1466 | |
| 1467 | case ISD::CopyToReg: |
| 1468 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 1469 | |
Chris Lattner | c9c60f6 | 2005-08-24 16:35:28 +0000 | [diff] [blame] | 1470 | assert(isTypeLegal(Node->getOperand(2).getValueType()) && |
Chris Lattner | d5d0f9b | 2005-08-16 21:55:35 +0000 | [diff] [blame] | 1471 | "Register type must be legal!"); |
Chris Lattner | 7310fb1 | 2005-12-18 15:27:43 +0000 | [diff] [blame] | 1472 | // Legalize the incoming value (must be a legal type). |
Chris Lattner | d5d0f9b | 2005-08-16 21:55:35 +0000 | [diff] [blame] | 1473 | Tmp2 = LegalizeOp(Node->getOperand(2)); |
Chris Lattner | f1a47c3 | 2005-12-18 15:36:21 +0000 | [diff] [blame] | 1474 | if (Node->getNumValues() == 1) { |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1475 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1), Tmp2); |
Chris Lattner | 7310fb1 | 2005-12-18 15:27:43 +0000 | [diff] [blame] | 1476 | } else { |
Chris Lattner | f1a47c3 | 2005-12-18 15:36:21 +0000 | [diff] [blame] | 1477 | assert(Node->getNumValues() == 2 && "Unknown CopyToReg"); |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1478 | if (Node->getNumOperands() == 4) { |
Chris Lattner | f1a47c3 | 2005-12-18 15:36:21 +0000 | [diff] [blame] | 1479 | Tmp3 = LegalizeOp(Node->getOperand(3)); |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1480 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1), Tmp2, |
| 1481 | Tmp3); |
| 1482 | } else { |
| 1483 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1),Tmp2); |
Chris Lattner | 7310fb1 | 2005-12-18 15:27:43 +0000 | [diff] [blame] | 1484 | } |
| 1485 | |
| 1486 | // Since this produces two values, make sure to remember that we legalized |
| 1487 | // both of them. |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1488 | AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0)); |
Chris Lattner | 7310fb1 | 2005-12-18 15:27:43 +0000 | [diff] [blame] | 1489 | AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1)); |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1490 | return Result; |
Chris Lattner | 7310fb1 | 2005-12-18 15:27:43 +0000 | [diff] [blame] | 1491 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1492 | break; |
| 1493 | |
| 1494 | case ISD::RET: |
| 1495 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 1496 | |
| 1497 | // Ensure that libcalls are emitted before a return. |
| 1498 | Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END); |
| 1499 | Tmp1 = LegalizeOp(Tmp1); |
| 1500 | LastCALLSEQ_END = DAG.getEntryNode(); |
Chris Lattner | f87324e | 2006-04-11 01:31:51 +0000 | [diff] [blame] | 1501 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1502 | switch (Node->getNumOperands()) { |
Evan Cheng | 8e7d056 | 2006-05-26 23:09:09 +0000 | [diff] [blame] | 1503 | case 3: // ret val |
Evan Cheng | 98f8aeb | 2006-04-11 06:33:39 +0000 | [diff] [blame] | 1504 | Tmp2 = Node->getOperand(1); |
Evan Cheng | 8e7d056 | 2006-05-26 23:09:09 +0000 | [diff] [blame] | 1505 | Tmp3 = Node->getOperand(2); // Signness |
Chris Lattner | f87324e | 2006-04-11 01:31:51 +0000 | [diff] [blame] | 1506 | switch (getTypeAction(Tmp2.getValueType())) { |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1507 | case Legal: |
Evan Cheng | 8e7d056 | 2006-05-26 23:09:09 +0000 | [diff] [blame] | 1508 | Result = DAG.UpdateNodeOperands(Result, Tmp1, LegalizeOp(Tmp2), Tmp3); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1509 | break; |
Chris Lattner | f87324e | 2006-04-11 01:31:51 +0000 | [diff] [blame] | 1510 | case Expand: |
| 1511 | if (Tmp2.getValueType() != MVT::Vector) { |
| 1512 | SDOperand Lo, Hi; |
| 1513 | ExpandOp(Tmp2, Lo, Hi); |
Evan Cheng | 8e7d056 | 2006-05-26 23:09:09 +0000 | [diff] [blame] | 1514 | Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1, Lo, Tmp3, Hi, Tmp3); |
Chris Lattner | f921a51 | 2006-08-21 20:24:53 +0000 | [diff] [blame] | 1515 | Result = LegalizeOp(Result); |
Chris Lattner | f87324e | 2006-04-11 01:31:51 +0000 | [diff] [blame] | 1516 | } else { |
| 1517 | SDNode *InVal = Tmp2.Val; |
| 1518 | unsigned NumElems = |
| 1519 | cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue(); |
| 1520 | MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT(); |
| 1521 | |
| 1522 | // Figure out if there is a Packed type corresponding to this Vector |
| 1523 | // type. If so, convert to the packed type. |
| 1524 | MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems); |
| 1525 | if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) { |
| 1526 | // Turn this into a return of the packed type. |
| 1527 | Tmp2 = PackVectorOp(Tmp2, TVT); |
Evan Cheng | 8e7d056 | 2006-05-26 23:09:09 +0000 | [diff] [blame] | 1528 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3); |
Chris Lattner | f87324e | 2006-04-11 01:31:51 +0000 | [diff] [blame] | 1529 | } else if (NumElems == 1) { |
| 1530 | // Turn this into a return of the scalar type. |
| 1531 | Tmp2 = PackVectorOp(Tmp2, EVT); |
Evan Cheng | 8e7d056 | 2006-05-26 23:09:09 +0000 | [diff] [blame] | 1532 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3); |
Chris Lattner | b49e52c | 2006-04-11 02:00:08 +0000 | [diff] [blame] | 1533 | |
| 1534 | // FIXME: Returns of gcc generic vectors smaller than a legal type |
| 1535 | // should be returned in integer registers! |
| 1536 | |
Chris Lattner | f87324e | 2006-04-11 01:31:51 +0000 | [diff] [blame] | 1537 | // The scalarized value type may not be legal, e.g. it might require |
| 1538 | // promotion or expansion. Relegalize the return. |
| 1539 | Result = LegalizeOp(Result); |
| 1540 | } else { |
Chris Lattner | b49e52c | 2006-04-11 02:00:08 +0000 | [diff] [blame] | 1541 | // FIXME: Returns of gcc generic vectors larger than a legal vector |
| 1542 | // type should be returned by reference! |
Chris Lattner | f87324e | 2006-04-11 01:31:51 +0000 | [diff] [blame] | 1543 | SDOperand Lo, Hi; |
| 1544 | SplitVectorOp(Tmp2, Lo, Hi); |
Evan Cheng | 8e7d056 | 2006-05-26 23:09:09 +0000 | [diff] [blame] | 1545 | Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1, Lo, Tmp3, Hi, Tmp3); |
Chris Lattner | f87324e | 2006-04-11 01:31:51 +0000 | [diff] [blame] | 1546 | Result = LegalizeOp(Result); |
| 1547 | } |
| 1548 | } |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 1549 | break; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1550 | case Promote: |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 1551 | Tmp2 = PromoteOp(Node->getOperand(1)); |
Evan Cheng | 8e7d056 | 2006-05-26 23:09:09 +0000 | [diff] [blame] | 1552 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3); |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1553 | Result = LegalizeOp(Result); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 1554 | break; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1555 | } |
| 1556 | break; |
| 1557 | case 1: // ret void |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1558 | Result = DAG.UpdateNodeOperands(Result, Tmp1); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1559 | break; |
| 1560 | default: { // ret <values> |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 1561 | SmallVector<SDOperand, 8> NewValues; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1562 | NewValues.push_back(Tmp1); |
Evan Cheng | 8e7d056 | 2006-05-26 23:09:09 +0000 | [diff] [blame] | 1563 | for (unsigned i = 1, e = Node->getNumOperands(); i < e; i += 2) |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1564 | switch (getTypeAction(Node->getOperand(i).getValueType())) { |
| 1565 | case Legal: |
Chris Lattner | 4e6c746 | 2005-01-08 19:27:05 +0000 | [diff] [blame] | 1566 | NewValues.push_back(LegalizeOp(Node->getOperand(i))); |
Evan Cheng | 8e7d056 | 2006-05-26 23:09:09 +0000 | [diff] [blame] | 1567 | NewValues.push_back(Node->getOperand(i+1)); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1568 | break; |
| 1569 | case Expand: { |
| 1570 | SDOperand Lo, Hi; |
Chris Lattner | b49e52c | 2006-04-11 02:00:08 +0000 | [diff] [blame] | 1571 | assert(Node->getOperand(i).getValueType() != MVT::Vector && |
| 1572 | "FIXME: TODO: implement returning non-legal vector types!"); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1573 | ExpandOp(Node->getOperand(i), Lo, Hi); |
| 1574 | NewValues.push_back(Lo); |
Evan Cheng | 8e7d056 | 2006-05-26 23:09:09 +0000 | [diff] [blame] | 1575 | NewValues.push_back(Node->getOperand(i+1)); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1576 | NewValues.push_back(Hi); |
Evan Cheng | 8e7d056 | 2006-05-26 23:09:09 +0000 | [diff] [blame] | 1577 | NewValues.push_back(Node->getOperand(i+1)); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 1578 | break; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1579 | } |
| 1580 | case Promote: |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 1581 | assert(0 && "Can't promote multiple return value yet!"); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1582 | } |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1583 | |
| 1584 | if (NewValues.size() == Node->getNumOperands()) |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 1585 | Result = DAG.UpdateNodeOperands(Result, &NewValues[0],NewValues.size()); |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1586 | else |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 1587 | Result = DAG.getNode(ISD::RET, MVT::Other, |
| 1588 | &NewValues[0], NewValues.size()); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1589 | break; |
| 1590 | } |
| 1591 | } |
Evan Cheng | 17c428e | 2006-01-06 00:41:43 +0000 | [diff] [blame] | 1592 | |
Chris Lattner | 6862dbc | 2006-01-29 21:02:23 +0000 | [diff] [blame] | 1593 | if (Result.getOpcode() == ISD::RET) { |
| 1594 | switch (TLI.getOperationAction(Result.getOpcode(), MVT::Other)) { |
| 1595 | default: assert(0 && "This action is not supported yet!"); |
| 1596 | case TargetLowering::Legal: break; |
| 1597 | case TargetLowering::Custom: |
| 1598 | Tmp1 = TLI.LowerOperation(Result, DAG); |
| 1599 | if (Tmp1.Val) Result = Tmp1; |
| 1600 | break; |
| 1601 | } |
Evan Cheng | 17c428e | 2006-01-06 00:41:43 +0000 | [diff] [blame] | 1602 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1603 | break; |
Evan Cheng | f3fd9fe | 2005-12-23 07:29:34 +0000 | [diff] [blame] | 1604 | case ISD::STORE: { |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1605 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 1606 | Tmp2 = LegalizeOp(Node->getOperand(2)); // Legalize the pointer. |
| 1607 | |
Chris Lattner | 5d2c6c7 | 2005-01-08 06:25:56 +0000 | [diff] [blame] | 1608 | // Turn 'store float 1.0, Ptr' -> 'store int 0x12345678, Ptr' |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1609 | // FIXME: We shouldn't do this for TargetConstantFP's. |
Chris Lattner | 06ac6ab | 2006-03-15 22:19:18 +0000 | [diff] [blame] | 1610 | // FIXME: move this to the DAG Combiner! |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1611 | if (ConstantFPSDNode *CFP =dyn_cast<ConstantFPSDNode>(Node->getOperand(1))){ |
Chris Lattner | 5d2c6c7 | 2005-01-08 06:25:56 +0000 | [diff] [blame] | 1612 | if (CFP->getValueType(0) == MVT::f32) { |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1613 | Tmp3 = DAG.getConstant(FloatToBits(CFP->getValue()), MVT::i32); |
Chris Lattner | 5d2c6c7 | 2005-01-08 06:25:56 +0000 | [diff] [blame] | 1614 | } else { |
| 1615 | assert(CFP->getValueType(0) == MVT::f64 && "Unknown FP type!"); |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1616 | Tmp3 = DAG.getConstant(DoubleToBits(CFP->getValue()), MVT::i64); |
Chris Lattner | 5d2c6c7 | 2005-01-08 06:25:56 +0000 | [diff] [blame] | 1617 | } |
Evan Cheng | 786225a | 2006-10-05 23:01:46 +0000 | [diff] [blame] | 1618 | Result = DAG.getStore(Tmp1, Tmp3, Tmp2, Node->getOperand(3)); |
Chris Lattner | 6a54289 | 2006-01-24 05:48:21 +0000 | [diff] [blame] | 1619 | break; |
Chris Lattner | 5d2c6c7 | 2005-01-08 06:25:56 +0000 | [diff] [blame] | 1620 | } |
| 1621 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1622 | switch (getTypeAction(Node->getOperand(1).getValueType())) { |
| 1623 | case Legal: { |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1624 | Tmp3 = LegalizeOp(Node->getOperand(1)); |
| 1625 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2, |
| 1626 | Node->getOperand(3)); |
Evan Cheng | f3fd9fe | 2005-12-23 07:29:34 +0000 | [diff] [blame] | 1627 | |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1628 | MVT::ValueType VT = Tmp3.getValueType(); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1629 | switch (TLI.getOperationAction(ISD::STORE, VT)) { |
| 1630 | default: assert(0 && "This action is not supported yet!"); |
| 1631 | case TargetLowering::Legal: break; |
| 1632 | case TargetLowering::Custom: |
| 1633 | Tmp1 = TLI.LowerOperation(Result, DAG); |
| 1634 | if (Tmp1.Val) Result = Tmp1; |
| 1635 | break; |
Chris Lattner | 2efce0a | 2006-04-16 01:36:45 +0000 | [diff] [blame] | 1636 | case TargetLowering::Promote: |
| 1637 | assert(MVT::isVector(VT) && "Unknown legal promote case!"); |
| 1638 | Tmp3 = DAG.getNode(ISD::BIT_CONVERT, |
| 1639 | TLI.getTypeToPromoteTo(ISD::STORE, VT), Tmp3); |
| 1640 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2, |
| 1641 | Node->getOperand(3)); |
| 1642 | break; |
Evan Cheng | f3fd9fe | 2005-12-23 07:29:34 +0000 | [diff] [blame] | 1643 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1644 | break; |
| 1645 | } |
| 1646 | case Promote: |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1647 | // Truncate the value and store the result. |
| 1648 | Tmp3 = PromoteOp(Node->getOperand(1)); |
| 1649 | Result = DAG.getNode(ISD::TRUNCSTORE, MVT::Other, Tmp1, Tmp3, Tmp2, |
Andrew Lenharth | 2d86ea2 | 2005-04-27 20:10:01 +0000 | [diff] [blame] | 1650 | Node->getOperand(3), |
Chris Lattner | 9fadb4c | 2005-07-10 00:29:18 +0000 | [diff] [blame] | 1651 | DAG.getValueType(Node->getOperand(1).getValueType())); |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 1652 | break; |
| 1653 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1654 | case Expand: |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 1655 | unsigned IncrementSize = 0; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1656 | SDOperand Lo, Hi; |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 1657 | |
| 1658 | // If this is a vector type, then we have to calculate the increment as |
| 1659 | // the product of the element size in bytes, and the number of elements |
| 1660 | // in the high half of the vector. |
| 1661 | if (Node->getOperand(1).getValueType() == MVT::Vector) { |
| 1662 | SDNode *InVal = Node->getOperand(1).Val; |
| 1663 | unsigned NumElems = |
| 1664 | cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue(); |
| 1665 | MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT(); |
| 1666 | |
| 1667 | // Figure out if there is a Packed type corresponding to this Vector |
| 1668 | // type. If so, convert to the packed type. |
| 1669 | MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems); |
| 1670 | if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) { |
| 1671 | // Turn this into a normal store of the packed type. |
| 1672 | Tmp3 = PackVectorOp(Node->getOperand(1), TVT); |
| 1673 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2, |
| 1674 | Node->getOperand(3)); |
Chris Lattner | 2efce0a | 2006-04-16 01:36:45 +0000 | [diff] [blame] | 1675 | Result = LegalizeOp(Result); |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 1676 | break; |
| 1677 | } else if (NumElems == 1) { |
| 1678 | // Turn this into a normal store of the scalar type. |
| 1679 | Tmp3 = PackVectorOp(Node->getOperand(1), EVT); |
| 1680 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2, |
| 1681 | Node->getOperand(3)); |
Chris Lattner | 2ae2e98 | 2006-03-31 17:37:22 +0000 | [diff] [blame] | 1682 | // The scalarized value type may not be legal, e.g. it might require |
| 1683 | // promotion or expansion. Relegalize the scalar store. |
| 1684 | Result = LegalizeOp(Result); |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 1685 | break; |
| 1686 | } else { |
| 1687 | SplitVectorOp(Node->getOperand(1), Lo, Hi); |
| 1688 | IncrementSize = NumElems/2 * MVT::getSizeInBits(EVT)/8; |
| 1689 | } |
| 1690 | } else { |
| 1691 | ExpandOp(Node->getOperand(1), Lo, Hi); |
| 1692 | IncrementSize = MVT::getSizeInBits(Hi.getValueType())/8; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1693 | |
Chris Lattner | d9731af | 2006-03-31 18:20:46 +0000 | [diff] [blame] | 1694 | if (!TLI.isLittleEndian()) |
| 1695 | std::swap(Lo, Hi); |
| 1696 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1697 | |
Evan Cheng | 786225a | 2006-10-05 23:01:46 +0000 | [diff] [blame] | 1698 | Lo = DAG.getStore(Tmp1, Lo, Tmp2, Node->getOperand(3)); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1699 | Tmp2 = DAG.getNode(ISD::ADD, Tmp2.getValueType(), Tmp2, |
| 1700 | getIntPtrConstant(IncrementSize)); |
| 1701 | assert(isTypeLegal(Tmp2.getValueType()) && |
| 1702 | "Pointers must be legal!"); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1703 | // FIXME: This sets the srcvalue of both halves to be the same, which is |
| 1704 | // wrong. |
Evan Cheng | 786225a | 2006-10-05 23:01:46 +0000 | [diff] [blame] | 1705 | Hi = DAG.getStore(Tmp1, Hi, Tmp2, Node->getOperand(3)); |
Chris Lattner | ec39a45 | 2005-01-19 18:02:17 +0000 | [diff] [blame] | 1706 | Result = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo, Hi); |
| 1707 | break; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1708 | } |
| 1709 | break; |
Evan Cheng | f3fd9fe | 2005-12-23 07:29:34 +0000 | [diff] [blame] | 1710 | } |
Andrew Lenharth | 9576212 | 2005-03-31 21:24:06 +0000 | [diff] [blame] | 1711 | case ISD::PCMARKER: |
| 1712 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1713 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1)); |
Andrew Lenharth | 9576212 | 2005-03-31 21:24:06 +0000 | [diff] [blame] | 1714 | break; |
Chris Lattner | 140d53c | 2006-01-13 02:50:02 +0000 | [diff] [blame] | 1715 | case ISD::STACKSAVE: |
| 1716 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1717 | Result = DAG.UpdateNodeOperands(Result, Tmp1); |
| 1718 | Tmp1 = Result.getValue(0); |
| 1719 | Tmp2 = Result.getValue(1); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1720 | |
Chris Lattner | 140d53c | 2006-01-13 02:50:02 +0000 | [diff] [blame] | 1721 | switch (TLI.getOperationAction(ISD::STACKSAVE, MVT::Other)) { |
| 1722 | default: assert(0 && "This action is not supported yet!"); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1723 | case TargetLowering::Legal: break; |
| 1724 | case TargetLowering::Custom: |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1725 | Tmp3 = TLI.LowerOperation(Result, DAG); |
| 1726 | if (Tmp3.Val) { |
| 1727 | Tmp1 = LegalizeOp(Tmp3); |
| 1728 | Tmp2 = LegalizeOp(Tmp3.getValue(1)); |
Chris Lattner | 140d53c | 2006-01-13 02:50:02 +0000 | [diff] [blame] | 1729 | } |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1730 | break; |
Chris Lattner | 140d53c | 2006-01-13 02:50:02 +0000 | [diff] [blame] | 1731 | case TargetLowering::Expand: |
Chris Lattner | 4f0d8e4 | 2006-01-13 17:48:44 +0000 | [diff] [blame] | 1732 | // Expand to CopyFromReg if the target set |
| 1733 | // StackPointerRegisterToSaveRestore. |
| 1734 | if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) { |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1735 | Tmp1 = DAG.getCopyFromReg(Result.getOperand(0), SP, |
Chris Lattner | 4f0d8e4 | 2006-01-13 17:48:44 +0000 | [diff] [blame] | 1736 | Node->getValueType(0)); |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1737 | Tmp2 = Tmp1.getValue(1); |
Chris Lattner | 4f0d8e4 | 2006-01-13 17:48:44 +0000 | [diff] [blame] | 1738 | } else { |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1739 | Tmp1 = DAG.getNode(ISD::UNDEF, Node->getValueType(0)); |
| 1740 | Tmp2 = Node->getOperand(0); |
Chris Lattner | 4f0d8e4 | 2006-01-13 17:48:44 +0000 | [diff] [blame] | 1741 | } |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1742 | break; |
Chris Lattner | 140d53c | 2006-01-13 02:50:02 +0000 | [diff] [blame] | 1743 | } |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1744 | |
| 1745 | // Since stacksave produce two values, make sure to remember that we |
| 1746 | // legalized both of them. |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1747 | AddLegalizedOperand(SDOperand(Node, 0), Tmp1); |
| 1748 | AddLegalizedOperand(SDOperand(Node, 1), Tmp2); |
| 1749 | return Op.ResNo ? Tmp2 : Tmp1; |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1750 | |
Chris Lattner | 140d53c | 2006-01-13 02:50:02 +0000 | [diff] [blame] | 1751 | case ISD::STACKRESTORE: |
| 1752 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 1753 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer. |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1754 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2); |
Chris Lattner | 140d53c | 2006-01-13 02:50:02 +0000 | [diff] [blame] | 1755 | |
| 1756 | switch (TLI.getOperationAction(ISD::STACKRESTORE, MVT::Other)) { |
| 1757 | default: assert(0 && "This action is not supported yet!"); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1758 | case TargetLowering::Legal: break; |
| 1759 | case TargetLowering::Custom: |
| 1760 | Tmp1 = TLI.LowerOperation(Result, DAG); |
| 1761 | if (Tmp1.Val) Result = Tmp1; |
Chris Lattner | 140d53c | 2006-01-13 02:50:02 +0000 | [diff] [blame] | 1762 | break; |
| 1763 | case TargetLowering::Expand: |
Chris Lattner | 4f0d8e4 | 2006-01-13 17:48:44 +0000 | [diff] [blame] | 1764 | // Expand to CopyToReg if the target set |
| 1765 | // StackPointerRegisterToSaveRestore. |
| 1766 | if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) { |
| 1767 | Result = DAG.getCopyToReg(Tmp1, SP, Tmp2); |
| 1768 | } else { |
| 1769 | Result = Tmp1; |
| 1770 | } |
Chris Lattner | 140d53c | 2006-01-13 02:50:02 +0000 | [diff] [blame] | 1771 | break; |
| 1772 | } |
| 1773 | break; |
| 1774 | |
Andrew Lenharth | 51b8d54 | 2005-11-11 16:47:30 +0000 | [diff] [blame] | 1775 | case ISD::READCYCLECOUNTER: |
| 1776 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1777 | Result = DAG.UpdateNodeOperands(Result, Tmp1); |
Andrew Lenharth | 49c709f | 2005-12-02 04:56:24 +0000 | [diff] [blame] | 1778 | |
| 1779 | // Since rdcc produce two values, make sure to remember that we legalized |
| 1780 | // both of them. |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1781 | AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0)); |
Andrew Lenharth | 49c709f | 2005-12-02 04:56:24 +0000 | [diff] [blame] | 1782 | AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1)); |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1783 | return Result; |
Andrew Lenharth | f70e30b | 2005-11-20 21:32:07 +0000 | [diff] [blame] | 1784 | |
Evan Cheng | f3fd9fe | 2005-12-23 07:29:34 +0000 | [diff] [blame] | 1785 | case ISD::TRUNCSTORE: { |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 1786 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 1787 | Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the pointer. |
| 1788 | |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1789 | assert(isTypeLegal(Node->getOperand(1).getValueType()) && |
| 1790 | "Cannot handle illegal TRUNCSTORE yet!"); |
| 1791 | Tmp2 = LegalizeOp(Node->getOperand(1)); |
| 1792 | |
| 1793 | // The only promote case we handle is TRUNCSTORE:i1 X into |
| 1794 | // -> TRUNCSTORE:i8 (and X, 1) |
| 1795 | if (cast<VTSDNode>(Node->getOperand(4))->getVT() == MVT::i1 && |
| 1796 | TLI.getOperationAction(ISD::TRUNCSTORE, MVT::i1) == |
| 1797 | TargetLowering::Promote) { |
| 1798 | // Promote the bool to a mask then store. |
| 1799 | Tmp2 = DAG.getNode(ISD::AND, Tmp2.getValueType(), Tmp2, |
| 1800 | DAG.getConstant(1, Tmp2.getValueType())); |
| 1801 | Result = DAG.getNode(ISD::TRUNCSTORE, MVT::Other, Tmp1, Tmp2, Tmp3, |
| 1802 | Node->getOperand(3), DAG.getValueType(MVT::i8)); |
Chris Lattner | 13d58e7 | 2005-09-10 00:20:18 +0000 | [diff] [blame] | 1803 | |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1804 | } else if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1) || |
| 1805 | Tmp3 != Node->getOperand(2)) { |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1806 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, |
| 1807 | Node->getOperand(3), Node->getOperand(4)); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1808 | } |
Evan Cheng | f3fd9fe | 2005-12-23 07:29:34 +0000 | [diff] [blame] | 1809 | |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1810 | MVT::ValueType StVT = cast<VTSDNode>(Result.Val->getOperand(4))->getVT(); |
| 1811 | switch (TLI.getOperationAction(Result.Val->getOpcode(), StVT)) { |
| 1812 | default: assert(0 && "This action is not supported yet!"); |
| 1813 | case TargetLowering::Legal: break; |
| 1814 | case TargetLowering::Custom: |
| 1815 | Tmp1 = TLI.LowerOperation(Result, DAG); |
| 1816 | if (Tmp1.Val) Result = Tmp1; |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 1817 | break; |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 1818 | } |
| 1819 | break; |
Evan Cheng | f3fd9fe | 2005-12-23 07:29:34 +0000 | [diff] [blame] | 1820 | } |
Chris Lattner | 2ee743f | 2005-01-14 22:08:15 +0000 | [diff] [blame] | 1821 | case ISD::SELECT: |
Chris Lattner | 47e9223 | 2005-01-18 19:27:06 +0000 | [diff] [blame] | 1822 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 1823 | case Expand: assert(0 && "It's impossible to expand bools"); |
| 1824 | case Legal: |
| 1825 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the condition. |
| 1826 | break; |
| 1827 | case Promote: |
| 1828 | Tmp1 = PromoteOp(Node->getOperand(0)); // Promote the condition. |
| 1829 | break; |
| 1830 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1831 | Tmp2 = LegalizeOp(Node->getOperand(1)); // TrueVal |
Chris Lattner | 2ee743f | 2005-01-14 22:08:15 +0000 | [diff] [blame] | 1832 | Tmp3 = LegalizeOp(Node->getOperand(2)); // FalseVal |
Chris Lattner | 55ba8fb | 2005-01-16 07:29:19 +0000 | [diff] [blame] | 1833 | |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1834 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1835 | |
Nate Begeman | b942a3d | 2005-08-23 04:29:48 +0000 | [diff] [blame] | 1836 | switch (TLI.getOperationAction(ISD::SELECT, Tmp2.getValueType())) { |
Chris Lattner | 55ba8fb | 2005-01-16 07:29:19 +0000 | [diff] [blame] | 1837 | default: assert(0 && "This action is not supported yet!"); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1838 | case TargetLowering::Legal: break; |
| 1839 | case TargetLowering::Custom: { |
| 1840 | Tmp1 = TLI.LowerOperation(Result, DAG); |
| 1841 | if (Tmp1.Val) Result = Tmp1; |
| 1842 | break; |
| 1843 | } |
Nate Begeman | 9373a81 | 2005-08-10 20:51:12 +0000 | [diff] [blame] | 1844 | case TargetLowering::Expand: |
| 1845 | if (Tmp1.getOpcode() == ISD::SETCC) { |
| 1846 | Result = DAG.getSelectCC(Tmp1.getOperand(0), Tmp1.getOperand(1), |
| 1847 | Tmp2, Tmp3, |
| 1848 | cast<CondCodeSDNode>(Tmp1.getOperand(2))->get()); |
| 1849 | } else { |
Chris Lattner | 550b1e5 | 2005-08-21 18:03:09 +0000 | [diff] [blame] | 1850 | // Make sure the condition is either zero or one. It may have been |
| 1851 | // promoted from something else. |
Chris Lattner | 0e753d6 | 2006-01-30 04:22:28 +0000 | [diff] [blame] | 1852 | unsigned NumBits = MVT::getSizeInBits(Tmp1.getValueType()); |
| 1853 | if (!TLI.MaskedValueIsZero(Tmp1, (~0ULL >> (64-NumBits))^1)) |
| 1854 | Tmp1 = DAG.getZeroExtendInReg(Tmp1, MVT::i1); |
Nate Begeman | 9373a81 | 2005-08-10 20:51:12 +0000 | [diff] [blame] | 1855 | Result = DAG.getSelectCC(Tmp1, |
| 1856 | DAG.getConstant(0, Tmp1.getValueType()), |
| 1857 | Tmp2, Tmp3, ISD::SETNE); |
| 1858 | } |
Chris Lattner | 55ba8fb | 2005-01-16 07:29:19 +0000 | [diff] [blame] | 1859 | break; |
| 1860 | case TargetLowering::Promote: { |
| 1861 | MVT::ValueType NVT = |
| 1862 | TLI.getTypeToPromoteTo(ISD::SELECT, Tmp2.getValueType()); |
| 1863 | unsigned ExtOp, TruncOp; |
Evan Cheng | 41f6cbb | 2006-04-12 16:33:18 +0000 | [diff] [blame] | 1864 | if (MVT::isVector(Tmp2.getValueType())) { |
| 1865 | ExtOp = ISD::BIT_CONVERT; |
| 1866 | TruncOp = ISD::BIT_CONVERT; |
| 1867 | } else if (MVT::isInteger(Tmp2.getValueType())) { |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1868 | ExtOp = ISD::ANY_EXTEND; |
| 1869 | TruncOp = ISD::TRUNCATE; |
Chris Lattner | 55ba8fb | 2005-01-16 07:29:19 +0000 | [diff] [blame] | 1870 | } else { |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1871 | ExtOp = ISD::FP_EXTEND; |
| 1872 | TruncOp = ISD::FP_ROUND; |
Chris Lattner | 55ba8fb | 2005-01-16 07:29:19 +0000 | [diff] [blame] | 1873 | } |
| 1874 | // Promote each of the values to the new type. |
| 1875 | Tmp2 = DAG.getNode(ExtOp, NVT, Tmp2); |
| 1876 | Tmp3 = DAG.getNode(ExtOp, NVT, Tmp3); |
| 1877 | // Perform the larger operation, then round down. |
| 1878 | Result = DAG.getNode(ISD::SELECT, NVT, Tmp1, Tmp2,Tmp3); |
| 1879 | Result = DAG.getNode(TruncOp, Node->getValueType(0), Result); |
| 1880 | break; |
| 1881 | } |
| 1882 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1883 | break; |
Nate Begeman | 750ac1b | 2006-02-01 07:19:44 +0000 | [diff] [blame] | 1884 | case ISD::SELECT_CC: { |
| 1885 | Tmp1 = Node->getOperand(0); // LHS |
| 1886 | Tmp2 = Node->getOperand(1); // RHS |
Nate Begeman | 9373a81 | 2005-08-10 20:51:12 +0000 | [diff] [blame] | 1887 | Tmp3 = LegalizeOp(Node->getOperand(2)); // True |
| 1888 | Tmp4 = LegalizeOp(Node->getOperand(3)); // False |
Nate Begeman | 750ac1b | 2006-02-01 07:19:44 +0000 | [diff] [blame] | 1889 | SDOperand CC = Node->getOperand(4); |
Nate Begeman | 9373a81 | 2005-08-10 20:51:12 +0000 | [diff] [blame] | 1890 | |
Nate Begeman | 750ac1b | 2006-02-01 07:19:44 +0000 | [diff] [blame] | 1891 | LegalizeSetCCOperands(Tmp1, Tmp2, CC); |
| 1892 | |
| 1893 | // If we didn't get both a LHS and RHS back from LegalizeSetCCOperands, |
| 1894 | // the LHS is a legal SETCC itself. In this case, we need to compare |
| 1895 | // the result against zero to select between true and false values. |
| 1896 | if (Tmp2.Val == 0) { |
| 1897 | Tmp2 = DAG.getConstant(0, Tmp1.getValueType()); |
| 1898 | CC = DAG.getCondCode(ISD::SETNE); |
| 1899 | } |
| 1900 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4, CC); |
| 1901 | |
| 1902 | // Everything is legal, see if we should expand this op or something. |
| 1903 | switch (TLI.getOperationAction(ISD::SELECT_CC, Tmp3.getValueType())) { |
| 1904 | default: assert(0 && "This action is not supported yet!"); |
| 1905 | case TargetLowering::Legal: break; |
| 1906 | case TargetLowering::Custom: |
| 1907 | Tmp1 = TLI.LowerOperation(Result, DAG); |
| 1908 | if (Tmp1.Val) Result = Tmp1; |
Nate Begeman | 9373a81 | 2005-08-10 20:51:12 +0000 | [diff] [blame] | 1909 | break; |
Nate Begeman | 9373a81 | 2005-08-10 20:51:12 +0000 | [diff] [blame] | 1910 | } |
| 1911 | break; |
Nate Begeman | 750ac1b | 2006-02-01 07:19:44 +0000 | [diff] [blame] | 1912 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1913 | case ISD::SETCC: |
Nate Begeman | 750ac1b | 2006-02-01 07:19:44 +0000 | [diff] [blame] | 1914 | Tmp1 = Node->getOperand(0); |
| 1915 | Tmp2 = Node->getOperand(1); |
| 1916 | Tmp3 = Node->getOperand(2); |
| 1917 | LegalizeSetCCOperands(Tmp1, Tmp2, Tmp3); |
| 1918 | |
| 1919 | // If we had to Expand the SetCC operands into a SELECT node, then it may |
| 1920 | // not always be possible to return a true LHS & RHS. In this case, just |
| 1921 | // return the value we legalized, returned in the LHS |
| 1922 | if (Tmp2.Val == 0) { |
| 1923 | Result = Tmp1; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1924 | break; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1925 | } |
Nate Begeman | b942a3d | 2005-08-23 04:29:48 +0000 | [diff] [blame] | 1926 | |
Chris Lattner | 73e142f | 2006-01-30 22:43:50 +0000 | [diff] [blame] | 1927 | switch (TLI.getOperationAction(ISD::SETCC, Tmp1.getValueType())) { |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1928 | default: assert(0 && "Cannot handle this action for SETCC yet!"); |
| 1929 | case TargetLowering::Custom: |
| 1930 | isCustom = true; |
| 1931 | // FALLTHROUGH. |
| 1932 | case TargetLowering::Legal: |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1933 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2)); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 1934 | if (isCustom) { |
| 1935 | Tmp3 = TLI.LowerOperation(Result, DAG); |
| 1936 | if (Tmp3.Val) Result = Tmp3; |
| 1937 | } |
Nate Begeman | b942a3d | 2005-08-23 04:29:48 +0000 | [diff] [blame] | 1938 | break; |
Andrew Lenharth | ae35575 | 2005-11-30 17:12:26 +0000 | [diff] [blame] | 1939 | case TargetLowering::Promote: { |
| 1940 | // First step, figure out the appropriate operation to use. |
| 1941 | // Allow SETCC to not be supported for all legal data types |
| 1942 | // Mostly this targets FP |
| 1943 | MVT::ValueType NewInTy = Node->getOperand(0).getValueType(); |
| 1944 | MVT::ValueType OldVT = NewInTy; |
| 1945 | |
| 1946 | // Scan for the appropriate larger type to use. |
| 1947 | while (1) { |
| 1948 | NewInTy = (MVT::ValueType)(NewInTy+1); |
| 1949 | |
| 1950 | assert(MVT::isInteger(NewInTy) == MVT::isInteger(OldVT) && |
| 1951 | "Fell off of the edge of the integer world"); |
| 1952 | assert(MVT::isFloatingPoint(NewInTy) == MVT::isFloatingPoint(OldVT) && |
| 1953 | "Fell off of the edge of the floating point world"); |
| 1954 | |
| 1955 | // If the target supports SETCC of this type, use it. |
Chris Lattner | 1ccf26a | 2005-12-22 05:23:45 +0000 | [diff] [blame] | 1956 | if (TLI.isOperationLegal(ISD::SETCC, NewInTy)) |
Andrew Lenharth | ae35575 | 2005-11-30 17:12:26 +0000 | [diff] [blame] | 1957 | break; |
| 1958 | } |
| 1959 | if (MVT::isInteger(NewInTy)) |
| 1960 | assert(0 && "Cannot promote Legal Integer SETCC yet"); |
| 1961 | else { |
| 1962 | Tmp1 = DAG.getNode(ISD::FP_EXTEND, NewInTy, Tmp1); |
| 1963 | Tmp2 = DAG.getNode(ISD::FP_EXTEND, NewInTy, Tmp2); |
| 1964 | } |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 1965 | Tmp1 = LegalizeOp(Tmp1); |
| 1966 | Tmp2 = LegalizeOp(Tmp2); |
| 1967 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2)); |
Evan Cheng | 433f8ac | 2006-01-17 19:47:13 +0000 | [diff] [blame] | 1968 | Result = LegalizeOp(Result); |
Andrew Lenharth | 5e3efbc | 2005-08-29 20:46:51 +0000 | [diff] [blame] | 1969 | break; |
Andrew Lenharth | ae35575 | 2005-11-30 17:12:26 +0000 | [diff] [blame] | 1970 | } |
Nate Begeman | b942a3d | 2005-08-23 04:29:48 +0000 | [diff] [blame] | 1971 | case TargetLowering::Expand: |
| 1972 | // Expand a setcc node into a select_cc of the same condition, lhs, and |
| 1973 | // rhs that selects between const 1 (true) and const 0 (false). |
| 1974 | MVT::ValueType VT = Node->getValueType(0); |
| 1975 | Result = DAG.getNode(ISD::SELECT_CC, VT, Tmp1, Tmp2, |
| 1976 | DAG.getConstant(1, VT), DAG.getConstant(0, VT), |
| 1977 | Node->getOperand(2)); |
Nate Begeman | b942a3d | 2005-08-23 04:29:48 +0000 | [diff] [blame] | 1978 | break; |
| 1979 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 1980 | break; |
Chris Lattner | e1bd822 | 2005-01-11 05:57:22 +0000 | [diff] [blame] | 1981 | case ISD::MEMSET: |
| 1982 | case ISD::MEMCPY: |
| 1983 | case ISD::MEMMOVE: { |
Chris Lattner | deb692e | 2005-02-01 18:38:28 +0000 | [diff] [blame] | 1984 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Chain |
Chris Lattner | e560521 | 2005-01-28 22:29:18 +0000 | [diff] [blame] | 1985 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Pointer |
| 1986 | |
| 1987 | if (Node->getOpcode() == ISD::MEMSET) { // memset = ubyte |
| 1988 | switch (getTypeAction(Node->getOperand(2).getValueType())) { |
| 1989 | case Expand: assert(0 && "Cannot expand a byte!"); |
| 1990 | case Legal: |
Chris Lattner | deb692e | 2005-02-01 18:38:28 +0000 | [diff] [blame] | 1991 | Tmp3 = LegalizeOp(Node->getOperand(2)); |
Chris Lattner | e560521 | 2005-01-28 22:29:18 +0000 | [diff] [blame] | 1992 | break; |
| 1993 | case Promote: |
Chris Lattner | deb692e | 2005-02-01 18:38:28 +0000 | [diff] [blame] | 1994 | Tmp3 = PromoteOp(Node->getOperand(2)); |
Chris Lattner | e560521 | 2005-01-28 22:29:18 +0000 | [diff] [blame] | 1995 | break; |
| 1996 | } |
| 1997 | } else { |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 1998 | Tmp3 = LegalizeOp(Node->getOperand(2)); // memcpy/move = pointer, |
Chris Lattner | e560521 | 2005-01-28 22:29:18 +0000 | [diff] [blame] | 1999 | } |
Chris Lattner | 272455b | 2005-02-02 03:44:41 +0000 | [diff] [blame] | 2000 | |
| 2001 | SDOperand Tmp4; |
| 2002 | switch (getTypeAction(Node->getOperand(3).getValueType())) { |
Chris Lattner | 6814f15 | 2005-07-13 01:42:45 +0000 | [diff] [blame] | 2003 | case Expand: { |
| 2004 | // Length is too big, just take the lo-part of the length. |
| 2005 | SDOperand HiPart; |
| 2006 | ExpandOp(Node->getOperand(3), HiPart, Tmp4); |
| 2007 | break; |
| 2008 | } |
Chris Lattner | e560521 | 2005-01-28 22:29:18 +0000 | [diff] [blame] | 2009 | case Legal: |
| 2010 | Tmp4 = LegalizeOp(Node->getOperand(3)); |
Chris Lattner | e560521 | 2005-01-28 22:29:18 +0000 | [diff] [blame] | 2011 | break; |
| 2012 | case Promote: |
| 2013 | Tmp4 = PromoteOp(Node->getOperand(3)); |
Chris Lattner | 272455b | 2005-02-02 03:44:41 +0000 | [diff] [blame] | 2014 | break; |
| 2015 | } |
| 2016 | |
| 2017 | SDOperand Tmp5; |
| 2018 | switch (getTypeAction(Node->getOperand(4).getValueType())) { // uint |
| 2019 | case Expand: assert(0 && "Cannot expand this yet!"); |
| 2020 | case Legal: |
| 2021 | Tmp5 = LegalizeOp(Node->getOperand(4)); |
| 2022 | break; |
| 2023 | case Promote: |
Chris Lattner | e560521 | 2005-01-28 22:29:18 +0000 | [diff] [blame] | 2024 | Tmp5 = PromoteOp(Node->getOperand(4)); |
| 2025 | break; |
| 2026 | } |
Chris Lattner | 55ba8fb | 2005-01-16 07:29:19 +0000 | [diff] [blame] | 2027 | |
| 2028 | switch (TLI.getOperationAction(Node->getOpcode(), MVT::Other)) { |
| 2029 | default: assert(0 && "This action not implemented for this operation!"); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2030 | case TargetLowering::Custom: |
| 2031 | isCustom = true; |
| 2032 | // FALLTHROUGH |
Chris Lattner | 55ba8fb | 2005-01-16 07:29:19 +0000 | [diff] [blame] | 2033 | case TargetLowering::Legal: |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2034 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4, Tmp5); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2035 | if (isCustom) { |
| 2036 | Tmp1 = TLI.LowerOperation(Result, DAG); |
| 2037 | if (Tmp1.Val) Result = Tmp1; |
| 2038 | } |
Chris Lattner | 55ba8fb | 2005-01-16 07:29:19 +0000 | [diff] [blame] | 2039 | break; |
| 2040 | case TargetLowering::Expand: { |
Chris Lattner | e1bd822 | 2005-01-11 05:57:22 +0000 | [diff] [blame] | 2041 | // Otherwise, the target does not support this operation. Lower the |
| 2042 | // operation to an explicit libcall as appropriate. |
| 2043 | MVT::ValueType IntPtr = TLI.getPointerTy(); |
Owen Anderson | a69571c | 2006-05-03 01:29:57 +0000 | [diff] [blame] | 2044 | const Type *IntPtrTy = TLI.getTargetData()->getIntPtrType(); |
Chris Lattner | e1bd822 | 2005-01-11 05:57:22 +0000 | [diff] [blame] | 2045 | std::vector<std::pair<SDOperand, const Type*> > Args; |
| 2046 | |
Reid Spencer | 3bfbf4e | 2005-01-12 14:53:45 +0000 | [diff] [blame] | 2047 | const char *FnName = 0; |
Chris Lattner | e1bd822 | 2005-01-11 05:57:22 +0000 | [diff] [blame] | 2048 | if (Node->getOpcode() == ISD::MEMSET) { |
| 2049 | Args.push_back(std::make_pair(Tmp2, IntPtrTy)); |
Chris Lattner | dca7abe | 2006-02-20 06:38:35 +0000 | [diff] [blame] | 2050 | // Extend the (previously legalized) ubyte argument to be an int value |
| 2051 | // for the call. |
| 2052 | if (Tmp3.getValueType() > MVT::i32) |
| 2053 | Tmp3 = DAG.getNode(ISD::TRUNCATE, MVT::i32, Tmp3); |
| 2054 | else |
| 2055 | Tmp3 = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, Tmp3); |
Chris Lattner | e1bd822 | 2005-01-11 05:57:22 +0000 | [diff] [blame] | 2056 | Args.push_back(std::make_pair(Tmp3, Type::IntTy)); |
| 2057 | Args.push_back(std::make_pair(Tmp4, IntPtrTy)); |
| 2058 | |
| 2059 | FnName = "memset"; |
| 2060 | } else if (Node->getOpcode() == ISD::MEMCPY || |
| 2061 | Node->getOpcode() == ISD::MEMMOVE) { |
| 2062 | Args.push_back(std::make_pair(Tmp2, IntPtrTy)); |
| 2063 | Args.push_back(std::make_pair(Tmp3, IntPtrTy)); |
| 2064 | Args.push_back(std::make_pair(Tmp4, IntPtrTy)); |
| 2065 | FnName = Node->getOpcode() == ISD::MEMMOVE ? "memmove" : "memcpy"; |
| 2066 | } else { |
| 2067 | assert(0 && "Unknown op!"); |
| 2068 | } |
Chris Lattner | 45982da | 2005-05-12 16:53:42 +0000 | [diff] [blame] | 2069 | |
Chris Lattner | e1bd822 | 2005-01-11 05:57:22 +0000 | [diff] [blame] | 2070 | std::pair<SDOperand,SDOperand> CallResult = |
Chris Lattner | adf6a96 | 2005-05-13 18:50:42 +0000 | [diff] [blame] | 2071 | TLI.LowerCallTo(Tmp1, Type::VoidTy, false, CallingConv::C, false, |
Chris Lattner | e1bd822 | 2005-01-11 05:57:22 +0000 | [diff] [blame] | 2072 | DAG.getExternalSymbol(FnName, IntPtr), Args, DAG); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2073 | Result = CallResult.second; |
Chris Lattner | 55ba8fb | 2005-01-16 07:29:19 +0000 | [diff] [blame] | 2074 | break; |
| 2075 | } |
Chris Lattner | e1bd822 | 2005-01-11 05:57:22 +0000 | [diff] [blame] | 2076 | } |
| 2077 | break; |
| 2078 | } |
Chris Lattner | 52d08bd | 2005-05-09 20:23:03 +0000 | [diff] [blame] | 2079 | |
Chris Lattner | 5b359c6 | 2005-04-02 04:00:59 +0000 | [diff] [blame] | 2080 | case ISD::SHL_PARTS: |
| 2081 | case ISD::SRA_PARTS: |
| 2082 | case ISD::SRL_PARTS: { |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 2083 | SmallVector<SDOperand, 8> Ops; |
Chris Lattner | 84f6788 | 2005-01-20 18:52:28 +0000 | [diff] [blame] | 2084 | bool Changed = false; |
| 2085 | for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) { |
| 2086 | Ops.push_back(LegalizeOp(Node->getOperand(i))); |
| 2087 | Changed |= Ops.back() != Node->getOperand(i); |
| 2088 | } |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2089 | if (Changed) |
Chris Lattner | f06f35e | 2006-08-08 01:09:31 +0000 | [diff] [blame] | 2090 | Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size()); |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 2091 | |
Evan Cheng | 05a2d56 | 2006-01-09 18:31:59 +0000 | [diff] [blame] | 2092 | switch (TLI.getOperationAction(Node->getOpcode(), |
| 2093 | Node->getValueType(0))) { |
| 2094 | default: assert(0 && "This action is not supported yet!"); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2095 | case TargetLowering::Legal: break; |
| 2096 | case TargetLowering::Custom: |
| 2097 | Tmp1 = TLI.LowerOperation(Result, DAG); |
| 2098 | if (Tmp1.Val) { |
| 2099 | SDOperand Tmp2, RetVal(0, 0); |
Evan Cheng | 05a2d56 | 2006-01-09 18:31:59 +0000 | [diff] [blame] | 2100 | for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) { |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2101 | Tmp2 = LegalizeOp(Tmp1.getValue(i)); |
Evan Cheng | 05a2d56 | 2006-01-09 18:31:59 +0000 | [diff] [blame] | 2102 | AddLegalizedOperand(SDOperand(Node, i), Tmp2); |
| 2103 | if (i == Op.ResNo) |
Evan Cheng | 12f2274 | 2006-01-19 04:54:52 +0000 | [diff] [blame] | 2104 | RetVal = Tmp2; |
Evan Cheng | 05a2d56 | 2006-01-09 18:31:59 +0000 | [diff] [blame] | 2105 | } |
Chris Lattner | 269f8c0 | 2006-01-10 19:43:26 +0000 | [diff] [blame] | 2106 | assert(RetVal.Val && "Illegal result number"); |
Evan Cheng | 05a2d56 | 2006-01-09 18:31:59 +0000 | [diff] [blame] | 2107 | return RetVal; |
| 2108 | } |
Evan Cheng | 05a2d56 | 2006-01-09 18:31:59 +0000 | [diff] [blame] | 2109 | break; |
| 2110 | } |
| 2111 | |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 2112 | // Since these produce multiple values, make sure to remember that we |
| 2113 | // legalized all of them. |
| 2114 | for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) |
| 2115 | AddLegalizedOperand(SDOperand(Node, i), Result.getValue(i)); |
| 2116 | return Result.getValue(Op.ResNo); |
Chris Lattner | 84f6788 | 2005-01-20 18:52:28 +0000 | [diff] [blame] | 2117 | } |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 2118 | |
| 2119 | // Binary operators |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2120 | case ISD::ADD: |
| 2121 | case ISD::SUB: |
| 2122 | case ISD::MUL: |
Nate Begeman | c7c1657 | 2005-04-11 03:01:51 +0000 | [diff] [blame] | 2123 | case ISD::MULHS: |
| 2124 | case ISD::MULHU: |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2125 | case ISD::UDIV: |
| 2126 | case ISD::SDIV: |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2127 | case ISD::AND: |
| 2128 | case ISD::OR: |
| 2129 | case ISD::XOR: |
Chris Lattner | 03c0cf8 | 2005-01-07 21:45:56 +0000 | [diff] [blame] | 2130 | case ISD::SHL: |
| 2131 | case ISD::SRL: |
| 2132 | case ISD::SRA: |
Chris Lattner | 01b3d73 | 2005-09-28 22:28:18 +0000 | [diff] [blame] | 2133 | case ISD::FADD: |
| 2134 | case ISD::FSUB: |
| 2135 | case ISD::FMUL: |
| 2136 | case ISD::FDIV: |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2137 | Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS |
Andrew Lenharth | f2eb139 | 2005-07-05 19:52:39 +0000 | [diff] [blame] | 2138 | switch (getTypeAction(Node->getOperand(1).getValueType())) { |
| 2139 | case Expand: assert(0 && "Not possible"); |
| 2140 | case Legal: |
| 2141 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the RHS. |
| 2142 | break; |
| 2143 | case Promote: |
| 2144 | Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the RHS. |
| 2145 | break; |
| 2146 | } |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2147 | |
| 2148 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2149 | |
Andrew Lenharth | e8f65f1 | 2005-12-24 23:42:32 +0000 | [diff] [blame] | 2150 | switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) { |
Chris Lattner | bc70cf8 | 2006-04-02 03:57:31 +0000 | [diff] [blame] | 2151 | default: assert(0 && "BinOp legalize operation not supported"); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2152 | case TargetLowering::Legal: break; |
| 2153 | case TargetLowering::Custom: |
| 2154 | Tmp1 = TLI.LowerOperation(Result, DAG); |
| 2155 | if (Tmp1.Val) Result = Tmp1; |
Andrew Lenharth | 57030e3 | 2005-12-25 01:07:37 +0000 | [diff] [blame] | 2156 | break; |
Chris Lattner | bc70cf8 | 2006-04-02 03:57:31 +0000 | [diff] [blame] | 2157 | case TargetLowering::Expand: { |
Evan Cheng | 52cc1ea | 2006-09-18 21:49:04 +0000 | [diff] [blame] | 2158 | if (Node->getValueType(0) == MVT::i32) { |
| 2159 | switch (Node->getOpcode()) { |
| 2160 | default: assert(0 && "Do not know how to expand this integer BinOp!"); |
| 2161 | case ISD::UDIV: |
| 2162 | case ISD::SDIV: |
| 2163 | const char *FnName = Node->getOpcode() == ISD::UDIV |
| 2164 | ? "__udivsi3" : "__divsi3"; |
| 2165 | SDOperand Dummy; |
| 2166 | Result = ExpandLibCall(FnName, Node, Dummy); |
| 2167 | }; |
| 2168 | break; |
| 2169 | } |
| 2170 | |
Chris Lattner | bc70cf8 | 2006-04-02 03:57:31 +0000 | [diff] [blame] | 2171 | assert(MVT::isVector(Node->getValueType(0)) && |
| 2172 | "Cannot expand this binary operator!"); |
| 2173 | // Expand the operation into a bunch of nasty scalar code. |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 2174 | SmallVector<SDOperand, 8> Ops; |
Chris Lattner | bc70cf8 | 2006-04-02 03:57:31 +0000 | [diff] [blame] | 2175 | MVT::ValueType EltVT = MVT::getVectorBaseType(Node->getValueType(0)); |
| 2176 | MVT::ValueType PtrVT = TLI.getPointerTy(); |
| 2177 | for (unsigned i = 0, e = MVT::getVectorNumElements(Node->getValueType(0)); |
| 2178 | i != e; ++i) { |
| 2179 | SDOperand Idx = DAG.getConstant(i, PtrVT); |
| 2180 | SDOperand LHS = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, EltVT, Tmp1, Idx); |
| 2181 | SDOperand RHS = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, EltVT, Tmp2, Idx); |
| 2182 | Ops.push_back(DAG.getNode(Node->getOpcode(), EltVT, LHS, RHS)); |
| 2183 | } |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 2184 | Result = DAG.getNode(ISD::BUILD_VECTOR, Node->getValueType(0), |
| 2185 | &Ops[0], Ops.size()); |
Chris Lattner | bc70cf8 | 2006-04-02 03:57:31 +0000 | [diff] [blame] | 2186 | break; |
| 2187 | } |
Evan Cheng | cc98761 | 2006-04-12 21:20:24 +0000 | [diff] [blame] | 2188 | case TargetLowering::Promote: { |
| 2189 | switch (Node->getOpcode()) { |
| 2190 | default: assert(0 && "Do not know how to promote this BinOp!"); |
| 2191 | case ISD::AND: |
| 2192 | case ISD::OR: |
| 2193 | case ISD::XOR: { |
| 2194 | MVT::ValueType OVT = Node->getValueType(0); |
| 2195 | MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT); |
| 2196 | assert(MVT::isVector(OVT) && "Cannot promote this BinOp!"); |
| 2197 | // Bit convert each of the values to the new type. |
| 2198 | Tmp1 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp1); |
| 2199 | Tmp2 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp2); |
| 2200 | Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2); |
| 2201 | // Bit convert the result back the original type. |
| 2202 | Result = DAG.getNode(ISD::BIT_CONVERT, OVT, Result); |
| 2203 | break; |
| 2204 | } |
| 2205 | } |
| 2206 | } |
Andrew Lenharth | e8f65f1 | 2005-12-24 23:42:32 +0000 | [diff] [blame] | 2207 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2208 | break; |
Chris Lattner | a09f848 | 2006-03-05 05:09:38 +0000 | [diff] [blame] | 2209 | |
| 2210 | case ISD::FCOPYSIGN: // FCOPYSIGN does not require LHS/RHS to match type! |
| 2211 | Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS |
| 2212 | switch (getTypeAction(Node->getOperand(1).getValueType())) { |
| 2213 | case Expand: assert(0 && "Not possible"); |
| 2214 | case Legal: |
| 2215 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the RHS. |
| 2216 | break; |
| 2217 | case Promote: |
| 2218 | Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the RHS. |
| 2219 | break; |
| 2220 | } |
| 2221 | |
| 2222 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2); |
| 2223 | |
| 2224 | switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) { |
| 2225 | default: assert(0 && "Operation not supported"); |
| 2226 | case TargetLowering::Custom: |
| 2227 | Tmp1 = TLI.LowerOperation(Result, DAG); |
| 2228 | if (Tmp1.Val) Result = Tmp1; |
Chris Lattner | 8f4191d | 2006-03-13 06:08:38 +0000 | [diff] [blame] | 2229 | break; |
Chris Lattner | a09f848 | 2006-03-05 05:09:38 +0000 | [diff] [blame] | 2230 | case TargetLowering::Legal: break; |
| 2231 | case TargetLowering::Expand: |
Chris Lattner | 8f4191d | 2006-03-13 06:08:38 +0000 | [diff] [blame] | 2232 | // If this target supports fabs/fneg natively, do this efficiently. |
| 2233 | if (TLI.isOperationLegal(ISD::FABS, Tmp1.getValueType()) && |
| 2234 | TLI.isOperationLegal(ISD::FNEG, Tmp1.getValueType())) { |
| 2235 | // Get the sign bit of the RHS. |
| 2236 | MVT::ValueType IVT = |
| 2237 | Tmp2.getValueType() == MVT::f32 ? MVT::i32 : MVT::i64; |
| 2238 | SDOperand SignBit = DAG.getNode(ISD::BIT_CONVERT, IVT, Tmp2); |
| 2239 | SignBit = DAG.getSetCC(TLI.getSetCCResultTy(), |
| 2240 | SignBit, DAG.getConstant(0, IVT), ISD::SETLT); |
| 2241 | // Get the absolute value of the result. |
| 2242 | SDOperand AbsVal = DAG.getNode(ISD::FABS, Tmp1.getValueType(), Tmp1); |
| 2243 | // Select between the nabs and abs value based on the sign bit of |
| 2244 | // the input. |
| 2245 | Result = DAG.getNode(ISD::SELECT, AbsVal.getValueType(), SignBit, |
| 2246 | DAG.getNode(ISD::FNEG, AbsVal.getValueType(), |
| 2247 | AbsVal), |
| 2248 | AbsVal); |
| 2249 | Result = LegalizeOp(Result); |
| 2250 | break; |
| 2251 | } |
| 2252 | |
| 2253 | // Otherwise, do bitwise ops! |
| 2254 | |
| 2255 | // copysign -> copysignf/copysign libcall. |
Chris Lattner | a09f848 | 2006-03-05 05:09:38 +0000 | [diff] [blame] | 2256 | const char *FnName; |
| 2257 | if (Node->getValueType(0) == MVT::f32) { |
| 2258 | FnName = "copysignf"; |
| 2259 | if (Tmp2.getValueType() != MVT::f32) // Force operands to match type. |
| 2260 | Result = DAG.UpdateNodeOperands(Result, Tmp1, |
| 2261 | DAG.getNode(ISD::FP_ROUND, MVT::f32, Tmp2)); |
| 2262 | } else { |
| 2263 | FnName = "copysign"; |
| 2264 | if (Tmp2.getValueType() != MVT::f64) // Force operands to match type. |
| 2265 | Result = DAG.UpdateNodeOperands(Result, Tmp1, |
| 2266 | DAG.getNode(ISD::FP_EXTEND, MVT::f64, Tmp2)); |
| 2267 | } |
| 2268 | SDOperand Dummy; |
| 2269 | Result = ExpandLibCall(FnName, Node, Dummy); |
| 2270 | break; |
| 2271 | } |
| 2272 | break; |
| 2273 | |
Nate Begeman | 551bf3f | 2006-02-17 05:43:56 +0000 | [diff] [blame] | 2274 | case ISD::ADDC: |
| 2275 | case ISD::SUBC: |
| 2276 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
| 2277 | Tmp2 = LegalizeOp(Node->getOperand(1)); |
| 2278 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2); |
| 2279 | // Since this produces two values, make sure to remember that we legalized |
| 2280 | // both of them. |
| 2281 | AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0)); |
| 2282 | AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1)); |
| 2283 | return Result; |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 2284 | |
Nate Begeman | 551bf3f | 2006-02-17 05:43:56 +0000 | [diff] [blame] | 2285 | case ISD::ADDE: |
| 2286 | case ISD::SUBE: |
| 2287 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
| 2288 | Tmp2 = LegalizeOp(Node->getOperand(1)); |
| 2289 | Tmp3 = LegalizeOp(Node->getOperand(2)); |
| 2290 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3); |
| 2291 | // Since this produces two values, make sure to remember that we legalized |
| 2292 | // both of them. |
| 2293 | AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0)); |
| 2294 | AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1)); |
| 2295 | return Result; |
Nate Begeman | 551bf3f | 2006-02-17 05:43:56 +0000 | [diff] [blame] | 2296 | |
Nate Begeman | 419f8b6 | 2005-10-18 00:27:41 +0000 | [diff] [blame] | 2297 | case ISD::BUILD_PAIR: { |
| 2298 | MVT::ValueType PairTy = Node->getValueType(0); |
| 2299 | // TODO: handle the case where the Lo and Hi operands are not of legal type |
| 2300 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Lo |
| 2301 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Hi |
| 2302 | switch (TLI.getOperationAction(ISD::BUILD_PAIR, PairTy)) { |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2303 | case TargetLowering::Promote: |
| 2304 | case TargetLowering::Custom: |
| 2305 | assert(0 && "Cannot promote/custom this yet!"); |
Nate Begeman | 419f8b6 | 2005-10-18 00:27:41 +0000 | [diff] [blame] | 2306 | case TargetLowering::Legal: |
| 2307 | if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1)) |
| 2308 | Result = DAG.getNode(ISD::BUILD_PAIR, PairTy, Tmp1, Tmp2); |
| 2309 | break; |
Nate Begeman | 419f8b6 | 2005-10-18 00:27:41 +0000 | [diff] [blame] | 2310 | case TargetLowering::Expand: |
| 2311 | Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, PairTy, Tmp1); |
| 2312 | Tmp2 = DAG.getNode(ISD::ANY_EXTEND, PairTy, Tmp2); |
| 2313 | Tmp2 = DAG.getNode(ISD::SHL, PairTy, Tmp2, |
| 2314 | DAG.getConstant(MVT::getSizeInBits(PairTy)/2, |
| 2315 | TLI.getShiftAmountTy())); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2316 | Result = DAG.getNode(ISD::OR, PairTy, Tmp1, Tmp2); |
Nate Begeman | 419f8b6 | 2005-10-18 00:27:41 +0000 | [diff] [blame] | 2317 | break; |
| 2318 | } |
| 2319 | break; |
| 2320 | } |
| 2321 | |
Nate Begeman | c105e19 | 2005-04-06 00:23:54 +0000 | [diff] [blame] | 2322 | case ISD::UREM: |
| 2323 | case ISD::SREM: |
Chris Lattner | 01b3d73 | 2005-09-28 22:28:18 +0000 | [diff] [blame] | 2324 | case ISD::FREM: |
Nate Begeman | c105e19 | 2005-04-06 00:23:54 +0000 | [diff] [blame] | 2325 | Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS |
| 2326 | Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2327 | |
Nate Begeman | c105e19 | 2005-04-06 00:23:54 +0000 | [diff] [blame] | 2328 | switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) { |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2329 | case TargetLowering::Promote: assert(0 && "Cannot promote this yet!"); |
| 2330 | case TargetLowering::Custom: |
| 2331 | isCustom = true; |
| 2332 | // FALLTHROUGH |
Nate Begeman | c105e19 | 2005-04-06 00:23:54 +0000 | [diff] [blame] | 2333 | case TargetLowering::Legal: |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2334 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2335 | if (isCustom) { |
| 2336 | Tmp1 = TLI.LowerOperation(Result, DAG); |
| 2337 | if (Tmp1.Val) Result = Tmp1; |
| 2338 | } |
Nate Begeman | c105e19 | 2005-04-06 00:23:54 +0000 | [diff] [blame] | 2339 | break; |
Chris Lattner | 4c64dd7 | 2005-08-03 20:31:37 +0000 | [diff] [blame] | 2340 | case TargetLowering::Expand: |
Evan Cheng | 6b5578f | 2006-09-18 23:28:33 +0000 | [diff] [blame] | 2341 | unsigned DivOpc= (Node->getOpcode() == ISD::UREM) ? ISD::UDIV : ISD::SDIV; |
Chris Lattner | 4c64dd7 | 2005-08-03 20:31:37 +0000 | [diff] [blame] | 2342 | if (MVT::isInteger(Node->getValueType(0))) { |
Evan Cheng | 52cc1ea | 2006-09-18 21:49:04 +0000 | [diff] [blame] | 2343 | if (TLI.getOperationAction(DivOpc, Node->getValueType(0)) == |
| 2344 | TargetLowering::Legal) { |
| 2345 | // X % Y -> X-X/Y*Y |
| 2346 | MVT::ValueType VT = Node->getValueType(0); |
Evan Cheng | 6b5578f | 2006-09-18 23:28:33 +0000 | [diff] [blame] | 2347 | Result = DAG.getNode(DivOpc, VT, Tmp1, Tmp2); |
Evan Cheng | 52cc1ea | 2006-09-18 21:49:04 +0000 | [diff] [blame] | 2348 | Result = DAG.getNode(ISD::MUL, VT, Result, Tmp2); |
| 2349 | Result = DAG.getNode(ISD::SUB, VT, Tmp1, Result); |
| 2350 | } else { |
| 2351 | assert(Node->getValueType(0) == MVT::i32 && |
| 2352 | "Cannot expand this binary operator!"); |
| 2353 | const char *FnName = Node->getOpcode() == ISD::UREM |
| 2354 | ? "__umodsi3" : "__modsi3"; |
| 2355 | SDOperand Dummy; |
| 2356 | Result = ExpandLibCall(FnName, Node, Dummy); |
| 2357 | } |
Chris Lattner | 4c64dd7 | 2005-08-03 20:31:37 +0000 | [diff] [blame] | 2358 | } else { |
| 2359 | // Floating point mod -> fmod libcall. |
| 2360 | const char *FnName = Node->getValueType(0) == MVT::f32 ? "fmodf":"fmod"; |
| 2361 | SDOperand Dummy; |
Chris Lattner | 9c6b4b8 | 2006-01-28 04:28:26 +0000 | [diff] [blame] | 2362 | Result = ExpandLibCall(FnName, Node, Dummy); |
Nate Begeman | c105e19 | 2005-04-06 00:23:54 +0000 | [diff] [blame] | 2363 | } |
| 2364 | break; |
| 2365 | } |
| 2366 | break; |
Nate Begeman | acc398c | 2006-01-25 18:21:52 +0000 | [diff] [blame] | 2367 | case ISD::VAARG: { |
| 2368 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 2369 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer. |
| 2370 | |
Chris Lattner | 5c62f33 | 2006-01-28 07:42:08 +0000 | [diff] [blame] | 2371 | MVT::ValueType VT = Node->getValueType(0); |
Nate Begeman | acc398c | 2006-01-25 18:21:52 +0000 | [diff] [blame] | 2372 | switch (TLI.getOperationAction(Node->getOpcode(), MVT::Other)) { |
| 2373 | default: assert(0 && "This action is not supported yet!"); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2374 | case TargetLowering::Custom: |
| 2375 | isCustom = true; |
| 2376 | // FALLTHROUGH |
Nate Begeman | acc398c | 2006-01-25 18:21:52 +0000 | [diff] [blame] | 2377 | case TargetLowering::Legal: |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2378 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2)); |
| 2379 | Result = Result.getValue(0); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2380 | Tmp1 = Result.getValue(1); |
| 2381 | |
| 2382 | if (isCustom) { |
| 2383 | Tmp2 = TLI.LowerOperation(Result, DAG); |
| 2384 | if (Tmp2.Val) { |
| 2385 | Result = LegalizeOp(Tmp2); |
| 2386 | Tmp1 = LegalizeOp(Tmp2.getValue(1)); |
| 2387 | } |
| 2388 | } |
Nate Begeman | acc398c | 2006-01-25 18:21:52 +0000 | [diff] [blame] | 2389 | break; |
| 2390 | case TargetLowering::Expand: { |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 2391 | SrcValueSDNode *SV = cast<SrcValueSDNode>(Node->getOperand(2)); |
Nate Begeman | acc398c | 2006-01-25 18:21:52 +0000 | [diff] [blame] | 2392 | SDOperand VAList = DAG.getLoad(TLI.getPointerTy(), Tmp1, Tmp2, |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 2393 | SV->getValue(), SV->getOffset()); |
Nate Begeman | acc398c | 2006-01-25 18:21:52 +0000 | [diff] [blame] | 2394 | // Increment the pointer, VAList, to the next vaarg |
| 2395 | Tmp3 = DAG.getNode(ISD::ADD, TLI.getPointerTy(), VAList, |
| 2396 | DAG.getConstant(MVT::getSizeInBits(VT)/8, |
| 2397 | TLI.getPointerTy())); |
| 2398 | // Store the incremented VAList to the legalized pointer |
Evan Cheng | 786225a | 2006-10-05 23:01:46 +0000 | [diff] [blame] | 2399 | Tmp3 = DAG.getStore(VAList.getValue(1), Tmp3, Tmp2, Node->getOperand(2)); |
Nate Begeman | acc398c | 2006-01-25 18:21:52 +0000 | [diff] [blame] | 2400 | // Load the actual argument out of the pointer VAList |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 2401 | Result = DAG.getLoad(VT, Tmp3, VAList, NULL, 0); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2402 | Tmp1 = LegalizeOp(Result.getValue(1)); |
Nate Begeman | acc398c | 2006-01-25 18:21:52 +0000 | [diff] [blame] | 2403 | Result = LegalizeOp(Result); |
| 2404 | break; |
| 2405 | } |
| 2406 | } |
| 2407 | // Since VAARG produces two values, make sure to remember that we |
| 2408 | // legalized both of them. |
| 2409 | AddLegalizedOperand(SDOperand(Node, 0), Result); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2410 | AddLegalizedOperand(SDOperand(Node, 1), Tmp1); |
| 2411 | return Op.ResNo ? Tmp1 : Result; |
Nate Begeman | acc398c | 2006-01-25 18:21:52 +0000 | [diff] [blame] | 2412 | } |
| 2413 | |
| 2414 | case ISD::VACOPY: |
| 2415 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 2416 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the dest pointer. |
| 2417 | Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the source pointer. |
| 2418 | |
| 2419 | switch (TLI.getOperationAction(ISD::VACOPY, MVT::Other)) { |
| 2420 | default: assert(0 && "This action is not supported yet!"); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2421 | case TargetLowering::Custom: |
| 2422 | isCustom = true; |
| 2423 | // FALLTHROUGH |
Nate Begeman | acc398c | 2006-01-25 18:21:52 +0000 | [diff] [blame] | 2424 | case TargetLowering::Legal: |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2425 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, |
| 2426 | Node->getOperand(3), Node->getOperand(4)); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2427 | if (isCustom) { |
| 2428 | Tmp1 = TLI.LowerOperation(Result, DAG); |
| 2429 | if (Tmp1.Val) Result = Tmp1; |
| 2430 | } |
Nate Begeman | acc398c | 2006-01-25 18:21:52 +0000 | [diff] [blame] | 2431 | break; |
| 2432 | case TargetLowering::Expand: |
| 2433 | // This defaults to loading a pointer from the input and storing it to the |
| 2434 | // output, returning the chain. |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 2435 | SrcValueSDNode *SVD = cast<SrcValueSDNode>(Node->getOperand(3)); |
| 2436 | SrcValueSDNode *SVS = cast<SrcValueSDNode>(Node->getOperand(4)); |
| 2437 | Tmp4 = DAG.getLoad(TLI.getPointerTy(), Tmp1, Tmp3, SVD->getValue(), |
| 2438 | SVD->getOffset()); |
Evan Cheng | 786225a | 2006-10-05 23:01:46 +0000 | [diff] [blame] | 2439 | Result = DAG.getStore(Tmp4.getValue(1), Tmp4, Tmp2, Node->getOperand(4)); |
Nate Begeman | acc398c | 2006-01-25 18:21:52 +0000 | [diff] [blame] | 2440 | break; |
| 2441 | } |
| 2442 | break; |
| 2443 | |
| 2444 | case ISD::VAEND: |
| 2445 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 2446 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer. |
| 2447 | |
| 2448 | switch (TLI.getOperationAction(ISD::VAEND, MVT::Other)) { |
| 2449 | default: assert(0 && "This action is not supported yet!"); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2450 | case TargetLowering::Custom: |
| 2451 | isCustom = true; |
| 2452 | // FALLTHROUGH |
Nate Begeman | acc398c | 2006-01-25 18:21:52 +0000 | [diff] [blame] | 2453 | case TargetLowering::Legal: |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2454 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2)); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2455 | if (isCustom) { |
| 2456 | Tmp1 = TLI.LowerOperation(Tmp1, DAG); |
| 2457 | if (Tmp1.Val) Result = Tmp1; |
| 2458 | } |
Nate Begeman | acc398c | 2006-01-25 18:21:52 +0000 | [diff] [blame] | 2459 | break; |
| 2460 | case TargetLowering::Expand: |
| 2461 | Result = Tmp1; // Default to a no-op, return the chain |
| 2462 | break; |
| 2463 | } |
| 2464 | break; |
| 2465 | |
| 2466 | case ISD::VASTART: |
| 2467 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 2468 | Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer. |
| 2469 | |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2470 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2)); |
| 2471 | |
Nate Begeman | acc398c | 2006-01-25 18:21:52 +0000 | [diff] [blame] | 2472 | switch (TLI.getOperationAction(ISD::VASTART, MVT::Other)) { |
| 2473 | default: assert(0 && "This action is not supported yet!"); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2474 | case TargetLowering::Legal: break; |
| 2475 | case TargetLowering::Custom: |
| 2476 | Tmp1 = TLI.LowerOperation(Result, DAG); |
| 2477 | if (Tmp1.Val) Result = Tmp1; |
Nate Begeman | acc398c | 2006-01-25 18:21:52 +0000 | [diff] [blame] | 2478 | break; |
| 2479 | } |
| 2480 | break; |
| 2481 | |
Nate Begeman | 35ef913 | 2006-01-11 21:21:00 +0000 | [diff] [blame] | 2482 | case ISD::ROTL: |
| 2483 | case ISD::ROTR: |
| 2484 | Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS |
| 2485 | Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2486 | |
| 2487 | assert(TLI.isOperationLegal(Node->getOpcode(), Node->getValueType(0)) && |
| 2488 | "Cannot handle this yet!"); |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2489 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2); |
Nate Begeman | 35ef913 | 2006-01-11 21:21:00 +0000 | [diff] [blame] | 2490 | break; |
| 2491 | |
Nate Begeman | d88fc03 | 2006-01-14 03:14:10 +0000 | [diff] [blame] | 2492 | case ISD::BSWAP: |
| 2493 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Op |
| 2494 | switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) { |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2495 | case TargetLowering::Custom: |
| 2496 | assert(0 && "Cannot custom legalize this yet!"); |
| 2497 | case TargetLowering::Legal: |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2498 | Result = DAG.UpdateNodeOperands(Result, Tmp1); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2499 | break; |
| 2500 | case TargetLowering::Promote: { |
| 2501 | MVT::ValueType OVT = Tmp1.getValueType(); |
| 2502 | MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT); |
| 2503 | unsigned DiffBits = getSizeInBits(NVT) - getSizeInBits(OVT); |
Nate Begeman | d88fc03 | 2006-01-14 03:14:10 +0000 | [diff] [blame] | 2504 | |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2505 | Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1); |
| 2506 | Tmp1 = DAG.getNode(ISD::BSWAP, NVT, Tmp1); |
| 2507 | Result = DAG.getNode(ISD::SRL, NVT, Tmp1, |
| 2508 | DAG.getConstant(DiffBits, TLI.getShiftAmountTy())); |
| 2509 | break; |
| 2510 | } |
| 2511 | case TargetLowering::Expand: |
| 2512 | Result = ExpandBSWAP(Tmp1); |
| 2513 | break; |
Nate Begeman | d88fc03 | 2006-01-14 03:14:10 +0000 | [diff] [blame] | 2514 | } |
| 2515 | break; |
| 2516 | |
Andrew Lenharth | 691ef2b | 2005-05-03 17:19:30 +0000 | [diff] [blame] | 2517 | case ISD::CTPOP: |
| 2518 | case ISD::CTTZ: |
| 2519 | case ISD::CTLZ: |
| 2520 | Tmp1 = LegalizeOp(Node->getOperand(0)); // Op |
| 2521 | switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) { |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2522 | case TargetLowering::Custom: assert(0 && "Cannot custom handle this yet!"); |
Andrew Lenharth | 691ef2b | 2005-05-03 17:19:30 +0000 | [diff] [blame] | 2523 | case TargetLowering::Legal: |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2524 | Result = DAG.UpdateNodeOperands(Result, Tmp1); |
Andrew Lenharth | 691ef2b | 2005-05-03 17:19:30 +0000 | [diff] [blame] | 2525 | break; |
| 2526 | case TargetLowering::Promote: { |
| 2527 | MVT::ValueType OVT = Tmp1.getValueType(); |
| 2528 | MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT); |
Chris Lattner | edb1add | 2005-05-11 04:51:16 +0000 | [diff] [blame] | 2529 | |
| 2530 | // Zero extend the argument. |
Andrew Lenharth | 691ef2b | 2005-05-03 17:19:30 +0000 | [diff] [blame] | 2531 | Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1); |
| 2532 | // Perform the larger operation, then subtract if needed. |
| 2533 | Tmp1 = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Tmp1); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2534 | switch (Node->getOpcode()) { |
Andrew Lenharth | 691ef2b | 2005-05-03 17:19:30 +0000 | [diff] [blame] | 2535 | case ISD::CTPOP: |
| 2536 | Result = Tmp1; |
| 2537 | break; |
| 2538 | case ISD::CTTZ: |
| 2539 | //if Tmp1 == sizeinbits(NVT) then Tmp1 = sizeinbits(Old VT) |
Chris Lattner | 7cf7e3f | 2005-08-09 20:20:18 +0000 | [diff] [blame] | 2540 | Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), Tmp1, |
| 2541 | DAG.getConstant(getSizeInBits(NVT), NVT), |
| 2542 | ISD::SETEQ); |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 2543 | Result = DAG.getNode(ISD::SELECT, NVT, Tmp2, |
Andrew Lenharth | 691ef2b | 2005-05-03 17:19:30 +0000 | [diff] [blame] | 2544 | DAG.getConstant(getSizeInBits(OVT),NVT), Tmp1); |
| 2545 | break; |
| 2546 | case ISD::CTLZ: |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2547 | // Tmp1 = Tmp1 - (sizeinbits(NVT) - sizeinbits(Old VT)) |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 2548 | Result = DAG.getNode(ISD::SUB, NVT, Tmp1, |
| 2549 | DAG.getConstant(getSizeInBits(NVT) - |
Andrew Lenharth | 691ef2b | 2005-05-03 17:19:30 +0000 | [diff] [blame] | 2550 | getSizeInBits(OVT), NVT)); |
| 2551 | break; |
| 2552 | } |
| 2553 | break; |
| 2554 | } |
Andrew Lenharth | 691ef2b | 2005-05-03 17:19:30 +0000 | [diff] [blame] | 2555 | case TargetLowering::Expand: |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2556 | Result = ExpandBitCount(Node->getOpcode(), Tmp1); |
Andrew Lenharth | 691ef2b | 2005-05-03 17:19:30 +0000 | [diff] [blame] | 2557 | break; |
| 2558 | } |
| 2559 | break; |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 2560 | |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 2561 | // Unary operators |
| 2562 | case ISD::FABS: |
| 2563 | case ISD::FNEG: |
Chris Lattner | da6ba87 | 2005-04-28 21:44:33 +0000 | [diff] [blame] | 2564 | case ISD::FSQRT: |
| 2565 | case ISD::FSIN: |
| 2566 | case ISD::FCOS: |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 2567 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
| 2568 | switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) { |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2569 | case TargetLowering::Promote: |
| 2570 | case TargetLowering::Custom: |
Evan Cheng | 59ad781 | 2006-01-31 18:14:25 +0000 | [diff] [blame] | 2571 | isCustom = true; |
| 2572 | // FALLTHROUGH |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 2573 | case TargetLowering::Legal: |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2574 | Result = DAG.UpdateNodeOperands(Result, Tmp1); |
Evan Cheng | 59ad781 | 2006-01-31 18:14:25 +0000 | [diff] [blame] | 2575 | if (isCustom) { |
| 2576 | Tmp1 = TLI.LowerOperation(Result, DAG); |
| 2577 | if (Tmp1.Val) Result = Tmp1; |
| 2578 | } |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 2579 | break; |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 2580 | case TargetLowering::Expand: |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2581 | switch (Node->getOpcode()) { |
| 2582 | default: assert(0 && "Unreachable!"); |
| 2583 | case ISD::FNEG: |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 2584 | // Expand Y = FNEG(X) -> Y = SUB -0.0, X |
| 2585 | Tmp2 = DAG.getConstantFP(-0.0, Node->getValueType(0)); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2586 | Result = DAG.getNode(ISD::FSUB, Node->getValueType(0), Tmp2, Tmp1); |
Chris Lattner | f76e7dc | 2005-04-30 04:43:14 +0000 | [diff] [blame] | 2587 | break; |
Chris Lattner | f76e7dc | 2005-04-30 04:43:14 +0000 | [diff] [blame] | 2588 | case ISD::FABS: { |
Chris Lattner | 4af6e0d | 2005-04-02 05:26:37 +0000 | [diff] [blame] | 2589 | // Expand Y = FABS(X) -> Y = (X >u 0.0) ? X : fneg(X). |
| 2590 | MVT::ValueType VT = Node->getValueType(0); |
| 2591 | Tmp2 = DAG.getConstantFP(0.0, VT); |
Chris Lattner | 7cf7e3f | 2005-08-09 20:20:18 +0000 | [diff] [blame] | 2592 | Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), Tmp1, Tmp2, ISD::SETUGT); |
Chris Lattner | 4af6e0d | 2005-04-02 05:26:37 +0000 | [diff] [blame] | 2593 | Tmp3 = DAG.getNode(ISD::FNEG, VT, Tmp1); |
| 2594 | Result = DAG.getNode(ISD::SELECT, VT, Tmp2, Tmp1, Tmp3); |
Chris Lattner | f76e7dc | 2005-04-30 04:43:14 +0000 | [diff] [blame] | 2595 | break; |
| 2596 | } |
| 2597 | case ISD::FSQRT: |
| 2598 | case ISD::FSIN: |
| 2599 | case ISD::FCOS: { |
| 2600 | MVT::ValueType VT = Node->getValueType(0); |
Chris Lattner | f76e7dc | 2005-04-30 04:43:14 +0000 | [diff] [blame] | 2601 | const char *FnName = 0; |
| 2602 | switch(Node->getOpcode()) { |
| 2603 | case ISD::FSQRT: FnName = VT == MVT::f32 ? "sqrtf" : "sqrt"; break; |
| 2604 | case ISD::FSIN: FnName = VT == MVT::f32 ? "sinf" : "sin"; break; |
| 2605 | case ISD::FCOS: FnName = VT == MVT::f32 ? "cosf" : "cos"; break; |
| 2606 | default: assert(0 && "Unreachable!"); |
| 2607 | } |
Nate Begeman | 2ac4fc0 | 2005-08-04 21:43:28 +0000 | [diff] [blame] | 2608 | SDOperand Dummy; |
Chris Lattner | 9c6b4b8 | 2006-01-28 04:28:26 +0000 | [diff] [blame] | 2609 | Result = ExpandLibCall(FnName, Node, Dummy); |
Chris Lattner | f76e7dc | 2005-04-30 04:43:14 +0000 | [diff] [blame] | 2610 | break; |
| 2611 | } |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 2612 | } |
| 2613 | break; |
| 2614 | } |
| 2615 | break; |
Chris Lattner | 6ddf8ed | 2006-09-09 06:03:30 +0000 | [diff] [blame] | 2616 | case ISD::FPOWI: { |
| 2617 | // We always lower FPOWI into a libcall. No target support it yet. |
| 2618 | const char *FnName = Node->getValueType(0) == MVT::f32 |
| 2619 | ? "__powisf2" : "__powidf2"; |
| 2620 | SDOperand Dummy; |
| 2621 | Result = ExpandLibCall(FnName, Node, Dummy); |
| 2622 | break; |
| 2623 | } |
Chris Lattner | 3548189 | 2005-12-23 00:16:34 +0000 | [diff] [blame] | 2624 | case ISD::BIT_CONVERT: |
Chris Lattner | 67993f7 | 2006-01-23 07:30:46 +0000 | [diff] [blame] | 2625 | if (!isTypeLegal(Node->getOperand(0).getValueType())) { |
Chris Lattner | 3548189 | 2005-12-23 00:16:34 +0000 | [diff] [blame] | 2626 | Result = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0)); |
Chris Lattner | 67993f7 | 2006-01-23 07:30:46 +0000 | [diff] [blame] | 2627 | } else { |
Chris Lattner | 3548189 | 2005-12-23 00:16:34 +0000 | [diff] [blame] | 2628 | switch (TLI.getOperationAction(ISD::BIT_CONVERT, |
| 2629 | Node->getOperand(0).getValueType())) { |
| 2630 | default: assert(0 && "Unknown operation action!"); |
| 2631 | case TargetLowering::Expand: |
| 2632 | Result = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0)); |
| 2633 | break; |
| 2634 | case TargetLowering::Legal: |
| 2635 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2636 | Result = DAG.UpdateNodeOperands(Result, Tmp1); |
Chris Lattner | 3548189 | 2005-12-23 00:16:34 +0000 | [diff] [blame] | 2637 | break; |
| 2638 | } |
| 2639 | } |
| 2640 | break; |
Chris Lattner | d1f04d4 | 2006-03-24 02:26:29 +0000 | [diff] [blame] | 2641 | case ISD::VBIT_CONVERT: { |
| 2642 | assert(Op.getOperand(0).getValueType() == MVT::Vector && |
| 2643 | "Can only have VBIT_CONVERT where input or output is MVT::Vector!"); |
| 2644 | |
| 2645 | // The input has to be a vector type, we have to either scalarize it, pack |
| 2646 | // it, or convert it based on whether the input vector type is legal. |
| 2647 | SDNode *InVal = Node->getOperand(0).Val; |
| 2648 | unsigned NumElems = |
| 2649 | cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue(); |
| 2650 | MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT(); |
| 2651 | |
| 2652 | // Figure out if there is a Packed type corresponding to this Vector |
| 2653 | // type. If so, convert to the packed type. |
| 2654 | MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems); |
| 2655 | if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) { |
| 2656 | // Turn this into a bit convert of the packed input. |
| 2657 | Result = DAG.getNode(ISD::BIT_CONVERT, Node->getValueType(0), |
| 2658 | PackVectorOp(Node->getOperand(0), TVT)); |
| 2659 | break; |
| 2660 | } else if (NumElems == 1) { |
| 2661 | // Turn this into a bit convert of the scalar input. |
| 2662 | Result = DAG.getNode(ISD::BIT_CONVERT, Node->getValueType(0), |
| 2663 | PackVectorOp(Node->getOperand(0), EVT)); |
| 2664 | break; |
| 2665 | } else { |
| 2666 | // FIXME: UNIMP! Store then reload |
| 2667 | assert(0 && "Cast from unsupported vector type not implemented yet!"); |
| 2668 | } |
| 2669 | } |
| 2670 | |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 2671 | // Conversion operators. The source and destination have different types. |
Chris Lattner | ae0aacb | 2005-01-08 08:08:56 +0000 | [diff] [blame] | 2672 | case ISD::SINT_TO_FP: |
Chris Lattner | fa9c801 | 2005-07-28 23:31:12 +0000 | [diff] [blame] | 2673 | case ISD::UINT_TO_FP: { |
| 2674 | bool isSigned = Node->getOpcode() == ISD::SINT_TO_FP; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2675 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 2676 | case Legal: |
Jeff Cohen | d29b6aa | 2005-07-30 18:33:25 +0000 | [diff] [blame] | 2677 | switch (TLI.getOperationAction(Node->getOpcode(), |
Chris Lattner | fa9c801 | 2005-07-28 23:31:12 +0000 | [diff] [blame] | 2678 | Node->getOperand(0).getValueType())) { |
| 2679 | default: assert(0 && "Unknown operation action!"); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2680 | case TargetLowering::Custom: |
| 2681 | isCustom = true; |
| 2682 | // FALLTHROUGH |
| 2683 | case TargetLowering::Legal: |
| 2684 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2685 | Result = DAG.UpdateNodeOperands(Result, Tmp1); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2686 | if (isCustom) { |
| 2687 | Tmp1 = TLI.LowerOperation(Result, DAG); |
| 2688 | if (Tmp1.Val) Result = Tmp1; |
| 2689 | } |
| 2690 | break; |
Chris Lattner | fa9c801 | 2005-07-28 23:31:12 +0000 | [diff] [blame] | 2691 | case TargetLowering::Expand: |
Jim Laskey | 6269ed1 | 2005-08-17 00:39:29 +0000 | [diff] [blame] | 2692 | Result = ExpandLegalINT_TO_FP(isSigned, |
| 2693 | LegalizeOp(Node->getOperand(0)), |
| 2694 | Node->getValueType(0)); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2695 | break; |
Chris Lattner | fa9c801 | 2005-07-28 23:31:12 +0000 | [diff] [blame] | 2696 | case TargetLowering::Promote: |
| 2697 | Result = PromoteLegalINT_TO_FP(LegalizeOp(Node->getOperand(0)), |
| 2698 | Node->getValueType(0), |
| 2699 | isSigned); |
Chris Lattner | fa9c801 | 2005-07-28 23:31:12 +0000 | [diff] [blame] | 2700 | break; |
Andrew Lenharth | 5b5b8c2 | 2005-11-30 06:43:03 +0000 | [diff] [blame] | 2701 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2702 | break; |
Chris Lattner | b00a642 | 2005-01-07 22:37:48 +0000 | [diff] [blame] | 2703 | case Expand: |
Chris Lattner | fa9c801 | 2005-07-28 23:31:12 +0000 | [diff] [blame] | 2704 | Result = ExpandIntToFP(Node->getOpcode() == ISD::SINT_TO_FP, |
| 2705 | Node->getValueType(0), Node->getOperand(0)); |
| 2706 | break; |
| 2707 | case Promote: |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2708 | Tmp1 = PromoteOp(Node->getOperand(0)); |
Chris Lattner | fa9c801 | 2005-07-28 23:31:12 +0000 | [diff] [blame] | 2709 | if (isSigned) { |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2710 | Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, Tmp1.getValueType(), |
| 2711 | Tmp1, DAG.getValueType(Node->getOperand(0).getValueType())); |
Chris Lattner | fa9c801 | 2005-07-28 23:31:12 +0000 | [diff] [blame] | 2712 | } else { |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2713 | Tmp1 = DAG.getZeroExtendInReg(Tmp1, |
| 2714 | Node->getOperand(0).getValueType()); |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 2715 | } |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2716 | Result = DAG.UpdateNodeOperands(Result, Tmp1); |
| 2717 | Result = LegalizeOp(Result); // The 'op' is not necessarily legal! |
Chris Lattner | fa9c801 | 2005-07-28 23:31:12 +0000 | [diff] [blame] | 2718 | break; |
| 2719 | } |
| 2720 | break; |
| 2721 | } |
| 2722 | case ISD::TRUNCATE: |
| 2723 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 2724 | case Legal: |
| 2725 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2726 | Result = DAG.UpdateNodeOperands(Result, Tmp1); |
Chris Lattner | fa9c801 | 2005-07-28 23:31:12 +0000 | [diff] [blame] | 2727 | break; |
| 2728 | case Expand: |
| 2729 | ExpandOp(Node->getOperand(0), Tmp1, Tmp2); |
| 2730 | |
| 2731 | // Since the result is legal, we should just be able to truncate the low |
| 2732 | // part of the source. |
| 2733 | Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0), Tmp1); |
| 2734 | break; |
| 2735 | case Promote: |
| 2736 | Result = PromoteOp(Node->getOperand(0)); |
| 2737 | Result = DAG.getNode(ISD::TRUNCATE, Op.getValueType(), Result); |
| 2738 | break; |
| 2739 | } |
| 2740 | break; |
Jeff Cohen | d29b6aa | 2005-07-30 18:33:25 +0000 | [diff] [blame] | 2741 | |
Chris Lattner | fa9c801 | 2005-07-28 23:31:12 +0000 | [diff] [blame] | 2742 | case ISD::FP_TO_SINT: |
| 2743 | case ISD::FP_TO_UINT: |
| 2744 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 2745 | case Legal: |
Chris Lattner | f1fa74e | 2005-07-30 00:04:12 +0000 | [diff] [blame] | 2746 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
| 2747 | |
Chris Lattner | 1618beb | 2005-07-29 00:11:56 +0000 | [diff] [blame] | 2748 | switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))){ |
| 2749 | default: assert(0 && "Unknown operation action!"); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2750 | case TargetLowering::Custom: |
| 2751 | isCustom = true; |
| 2752 | // FALLTHROUGH |
| 2753 | case TargetLowering::Legal: |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2754 | Result = DAG.UpdateNodeOperands(Result, Tmp1); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2755 | if (isCustom) { |
| 2756 | Tmp1 = TLI.LowerOperation(Result, DAG); |
| 2757 | if (Tmp1.Val) Result = Tmp1; |
| 2758 | } |
| 2759 | break; |
| 2760 | case TargetLowering::Promote: |
| 2761 | Result = PromoteLegalFP_TO_INT(Tmp1, Node->getValueType(0), |
| 2762 | Node->getOpcode() == ISD::FP_TO_SINT); |
| 2763 | break; |
Chris Lattner | 1618beb | 2005-07-29 00:11:56 +0000 | [diff] [blame] | 2764 | case TargetLowering::Expand: |
Nate Begeman | d2558e3 | 2005-08-14 01:20:53 +0000 | [diff] [blame] | 2765 | if (Node->getOpcode() == ISD::FP_TO_UINT) { |
| 2766 | SDOperand True, False; |
| 2767 | MVT::ValueType VT = Node->getOperand(0).getValueType(); |
| 2768 | MVT::ValueType NVT = Node->getValueType(0); |
| 2769 | unsigned ShiftAmt = MVT::getSizeInBits(Node->getValueType(0))-1; |
| 2770 | Tmp2 = DAG.getConstantFP((double)(1ULL << ShiftAmt), VT); |
| 2771 | Tmp3 = DAG.getSetCC(TLI.getSetCCResultTy(), |
| 2772 | Node->getOperand(0), Tmp2, ISD::SETLT); |
| 2773 | True = DAG.getNode(ISD::FP_TO_SINT, NVT, Node->getOperand(0)); |
| 2774 | False = DAG.getNode(ISD::FP_TO_SINT, NVT, |
Chris Lattner | 01b3d73 | 2005-09-28 22:28:18 +0000 | [diff] [blame] | 2775 | DAG.getNode(ISD::FSUB, VT, Node->getOperand(0), |
Nate Begeman | d2558e3 | 2005-08-14 01:20:53 +0000 | [diff] [blame] | 2776 | Tmp2)); |
| 2777 | False = DAG.getNode(ISD::XOR, NVT, False, |
| 2778 | DAG.getConstant(1ULL << ShiftAmt, NVT)); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2779 | Result = DAG.getNode(ISD::SELECT, NVT, Tmp3, True, False); |
| 2780 | break; |
Nate Begeman | d2558e3 | 2005-08-14 01:20:53 +0000 | [diff] [blame] | 2781 | } else { |
| 2782 | assert(0 && "Do not know how to expand FP_TO_SINT yet!"); |
| 2783 | } |
| 2784 | break; |
Chris Lattner | 07dffd6 | 2005-08-26 00:14:16 +0000 | [diff] [blame] | 2785 | } |
Chris Lattner | fa9c801 | 2005-07-28 23:31:12 +0000 | [diff] [blame] | 2786 | break; |
| 2787 | case Expand: |
| 2788 | assert(0 && "Shouldn't need to expand other operators here!"); |
| 2789 | case Promote: |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2790 | Tmp1 = PromoteOp(Node->getOperand(0)); |
| 2791 | Result = DAG.UpdateNodeOperands(Result, LegalizeOp(Tmp1)); |
| 2792 | Result = LegalizeOp(Result); |
Chris Lattner | fa9c801 | 2005-07-28 23:31:12 +0000 | [diff] [blame] | 2793 | break; |
| 2794 | } |
| 2795 | break; |
Jeff Cohen | d29b6aa | 2005-07-30 18:33:25 +0000 | [diff] [blame] | 2796 | |
Chris Lattner | 13c78e2 | 2005-09-02 00:18:10 +0000 | [diff] [blame] | 2797 | case ISD::ANY_EXTEND: |
Chris Lattner | fa9c801 | 2005-07-28 23:31:12 +0000 | [diff] [blame] | 2798 | case ISD::ZERO_EXTEND: |
| 2799 | case ISD::SIGN_EXTEND: |
| 2800 | case ISD::FP_EXTEND: |
| 2801 | case ISD::FP_ROUND: |
| 2802 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2803 | case Expand: assert(0 && "Shouldn't need to expand other operators here!"); |
Chris Lattner | fa9c801 | 2005-07-28 23:31:12 +0000 | [diff] [blame] | 2804 | case Legal: |
| 2805 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2806 | Result = DAG.UpdateNodeOperands(Result, Tmp1); |
Chris Lattner | fa9c801 | 2005-07-28 23:31:12 +0000 | [diff] [blame] | 2807 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 2808 | case Promote: |
| 2809 | switch (Node->getOpcode()) { |
Chris Lattner | 13c78e2 | 2005-09-02 00:18:10 +0000 | [diff] [blame] | 2810 | case ISD::ANY_EXTEND: |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2811 | Tmp1 = PromoteOp(Node->getOperand(0)); |
| 2812 | Result = DAG.getNode(ISD::ANY_EXTEND, Op.getValueType(), Tmp1); |
Chris Lattner | 13c78e2 | 2005-09-02 00:18:10 +0000 | [diff] [blame] | 2813 | break; |
Chris Lattner | 1713e73 | 2005-01-16 00:38:00 +0000 | [diff] [blame] | 2814 | case ISD::ZERO_EXTEND: |
| 2815 | Result = PromoteOp(Node->getOperand(0)); |
Chris Lattner | 13c78e2 | 2005-09-02 00:18:10 +0000 | [diff] [blame] | 2816 | Result = DAG.getNode(ISD::ANY_EXTEND, Op.getValueType(), Result); |
Chris Lattner | 2399356 | 2005-04-13 02:38:47 +0000 | [diff] [blame] | 2817 | Result = DAG.getZeroExtendInReg(Result, |
| 2818 | Node->getOperand(0).getValueType()); |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 2819 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 2820 | case ISD::SIGN_EXTEND: |
Chris Lattner | 1713e73 | 2005-01-16 00:38:00 +0000 | [diff] [blame] | 2821 | Result = PromoteOp(Node->getOperand(0)); |
Chris Lattner | 13c78e2 | 2005-09-02 00:18:10 +0000 | [diff] [blame] | 2822 | Result = DAG.getNode(ISD::ANY_EXTEND, Op.getValueType(), Result); |
Chris Lattner | 1713e73 | 2005-01-16 00:38:00 +0000 | [diff] [blame] | 2823 | Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(), |
Chris Lattner | 15e4b01 | 2005-07-10 00:07:11 +0000 | [diff] [blame] | 2824 | Result, |
| 2825 | DAG.getValueType(Node->getOperand(0).getValueType())); |
Chris Lattner | 1713e73 | 2005-01-16 00:38:00 +0000 | [diff] [blame] | 2826 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 2827 | case ISD::FP_EXTEND: |
Chris Lattner | 1713e73 | 2005-01-16 00:38:00 +0000 | [diff] [blame] | 2828 | Result = PromoteOp(Node->getOperand(0)); |
| 2829 | if (Result.getValueType() != Op.getValueType()) |
| 2830 | // Dynamically dead while we have only 2 FP types. |
| 2831 | Result = DAG.getNode(ISD::FP_EXTEND, Op.getValueType(), Result); |
| 2832 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 2833 | case ISD::FP_ROUND: |
Chris Lattner | f8161d8 | 2005-01-16 05:06:12 +0000 | [diff] [blame] | 2834 | Result = PromoteOp(Node->getOperand(0)); |
| 2835 | Result = DAG.getNode(Node->getOpcode(), Op.getValueType(), Result); |
| 2836 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 2837 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2838 | } |
| 2839 | break; |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 2840 | case ISD::FP_ROUND_INREG: |
Chris Lattner | 2399356 | 2005-04-13 02:38:47 +0000 | [diff] [blame] | 2841 | case ISD::SIGN_EXTEND_INREG: { |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 2842 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
Chris Lattner | 15e4b01 | 2005-07-10 00:07:11 +0000 | [diff] [blame] | 2843 | MVT::ValueType ExtraVT = cast<VTSDNode>(Node->getOperand(1))->getVT(); |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 2844 | |
| 2845 | // If this operation is not supported, convert it to a shl/shr or load/store |
| 2846 | // pair. |
Chris Lattner | 55ba8fb | 2005-01-16 07:29:19 +0000 | [diff] [blame] | 2847 | switch (TLI.getOperationAction(Node->getOpcode(), ExtraVT)) { |
| 2848 | default: assert(0 && "This action not supported for this op yet!"); |
| 2849 | case TargetLowering::Legal: |
Chris Lattner | c52ad4f | 2006-01-28 10:58:55 +0000 | [diff] [blame] | 2850 | Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1)); |
Chris Lattner | 55ba8fb | 2005-01-16 07:29:19 +0000 | [diff] [blame] | 2851 | break; |
| 2852 | case TargetLowering::Expand: |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 2853 | // If this is an integer extend and shifts are supported, do that. |
Chris Lattner | 2399356 | 2005-04-13 02:38:47 +0000 | [diff] [blame] | 2854 | if (Node->getOpcode() == ISD::SIGN_EXTEND_INREG) { |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 2855 | // NOTE: we could fall back on load/store here too for targets without |
| 2856 | // SAR. However, it is doubtful that any exist. |
| 2857 | unsigned BitsDiff = MVT::getSizeInBits(Node->getValueType(0)) - |
| 2858 | MVT::getSizeInBits(ExtraVT); |
Chris Lattner | 27ff112 | 2005-01-22 00:31:52 +0000 | [diff] [blame] | 2859 | SDOperand ShiftCst = DAG.getConstant(BitsDiff, TLI.getShiftAmountTy()); |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 2860 | Result = DAG.getNode(ISD::SHL, Node->getValueType(0), |
| 2861 | Node->getOperand(0), ShiftCst); |
| 2862 | Result = DAG.getNode(ISD::SRA, Node->getValueType(0), |
| 2863 | Result, ShiftCst); |
| 2864 | } else if (Node->getOpcode() == ISD::FP_ROUND_INREG) { |
| 2865 | // The only way we can lower this is to turn it into a STORETRUNC, |
| 2866 | // EXTLOAD pair, targetting a temporary location (a stack slot). |
| 2867 | |
| 2868 | // NOTE: there is a choice here between constantly creating new stack |
| 2869 | // slots and always reusing the same one. We currently always create |
| 2870 | // new ones, as reuse may inhibit scheduling. |
| 2871 | const Type *Ty = MVT::getTypeForValueType(ExtraVT); |
Owen Anderson | a69571c | 2006-05-03 01:29:57 +0000 | [diff] [blame] | 2872 | unsigned TySize = (unsigned)TLI.getTargetData()->getTypeSize(Ty); |
| 2873 | unsigned Align = TLI.getTargetData()->getTypeAlignment(Ty); |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 2874 | MachineFunction &MF = DAG.getMachineFunction(); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 2875 | int SSFI = |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 2876 | MF.getFrameInfo()->CreateStackObject((unsigned)TySize, Align); |
| 2877 | SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy()); |
| 2878 | Result = DAG.getNode(ISD::TRUNCSTORE, MVT::Other, DAG.getEntryNode(), |
Chris Lattner | 52d08bd | 2005-05-09 20:23:03 +0000 | [diff] [blame] | 2879 | Node->getOperand(0), StackSlot, |
Chris Lattner | 9fadb4c | 2005-07-10 00:29:18 +0000 | [diff] [blame] | 2880 | DAG.getSrcValue(NULL), DAG.getValueType(ExtraVT)); |
Chris Lattner | 5f056bf | 2005-07-10 01:55:33 +0000 | [diff] [blame] | 2881 | Result = DAG.getExtLoad(ISD::EXTLOAD, Node->getValueType(0), |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 2882 | Result, StackSlot, NULL, 0, ExtraVT); |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 2883 | } else { |
| 2884 | assert(0 && "Unknown op"); |
| 2885 | } |
Chris Lattner | 55ba8fb | 2005-01-16 07:29:19 +0000 | [diff] [blame] | 2886 | break; |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 2887 | } |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 2888 | break; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2889 | } |
Chris Lattner | 45b8caf | 2005-01-15 07:15:18 +0000 | [diff] [blame] | 2890 | } |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2891 | |
Chris Lattner | 4ddd283 | 2006-04-08 04:13:17 +0000 | [diff] [blame] | 2892 | assert(Result.getValueType() == Op.getValueType() && |
| 2893 | "Bad legalization!"); |
| 2894 | |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2895 | // Make sure that the generated code is itself legal. |
| 2896 | if (Result != Op) |
| 2897 | Result = LegalizeOp(Result); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2898 | |
Chris Lattner | 45982da | 2005-05-12 16:53:42 +0000 | [diff] [blame] | 2899 | // Note that LegalizeOp may be reentered even from single-use nodes, which |
| 2900 | // means that we always must cache transformed nodes. |
| 2901 | AddLegalizedOperand(Op, Result); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 2902 | return Result; |
| 2903 | } |
| 2904 | |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 2905 | /// PromoteOp - Given an operation that produces a value in an invalid type, |
| 2906 | /// promote it to compute the value into a larger type. The produced value will |
| 2907 | /// have the correct bits for the low portion of the register, but no guarantee |
| 2908 | /// 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] | 2909 | SDOperand SelectionDAGLegalize::PromoteOp(SDOperand Op) { |
| 2910 | MVT::ValueType VT = Op.getValueType(); |
Chris Lattner | 71c42a0 | 2005-01-16 01:11:45 +0000 | [diff] [blame] | 2911 | MVT::ValueType NVT = TLI.getTypeToTransformTo(VT); |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 2912 | assert(getTypeAction(VT) == Promote && |
| 2913 | "Caller should expand or legalize operands that are not promotable!"); |
| 2914 | assert(NVT > VT && MVT::isInteger(NVT) == MVT::isInteger(VT) && |
| 2915 | "Cannot promote to smaller type!"); |
| 2916 | |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 2917 | SDOperand Tmp1, Tmp2, Tmp3; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 2918 | SDOperand Result; |
| 2919 | SDNode *Node = Op.Val; |
| 2920 | |
Chris Lattner | 6fdcb25 | 2005-09-02 20:32:45 +0000 | [diff] [blame] | 2921 | std::map<SDOperand, SDOperand>::iterator I = PromotedNodes.find(Op); |
| 2922 | if (I != PromotedNodes.end()) return I->second; |
Chris Lattner | 45982da | 2005-05-12 16:53:42 +0000 | [diff] [blame] | 2923 | |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 2924 | switch (Node->getOpcode()) { |
Chris Lattner | d5d0f9b | 2005-08-16 21:55:35 +0000 | [diff] [blame] | 2925 | case ISD::CopyFromReg: |
| 2926 | assert(0 && "CopyFromReg must be legal!"); |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 2927 | default: |
Jim Laskey | e37fe9b | 2006-07-11 17:58:07 +0000 | [diff] [blame] | 2928 | #ifndef NDEBUG |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 2929 | std::cerr << "NODE: "; Node->dump(); std::cerr << "\n"; |
Jim Laskey | e37fe9b | 2006-07-11 17:58:07 +0000 | [diff] [blame] | 2930 | #endif |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 2931 | assert(0 && "Do not know how to promote this operator!"); |
| 2932 | abort(); |
Nate Begeman | fc1b1da | 2005-04-01 22:34:39 +0000 | [diff] [blame] | 2933 | case ISD::UNDEF: |
| 2934 | Result = DAG.getNode(ISD::UNDEF, NVT); |
| 2935 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 2936 | case ISD::Constant: |
Chris Lattner | ec176e3 | 2005-08-30 16:56:19 +0000 | [diff] [blame] | 2937 | if (VT != MVT::i1) |
| 2938 | Result = DAG.getNode(ISD::SIGN_EXTEND, NVT, Op); |
| 2939 | else |
| 2940 | Result = DAG.getNode(ISD::ZERO_EXTEND, NVT, Op); |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 2941 | assert(isa<ConstantSDNode>(Result) && "Didn't constant fold zext?"); |
| 2942 | break; |
| 2943 | case ISD::ConstantFP: |
| 2944 | Result = DAG.getNode(ISD::FP_EXTEND, NVT, Op); |
| 2945 | assert(isa<ConstantFPSDNode>(Result) && "Didn't constant fold fp_extend?"); |
| 2946 | break; |
Chris Lattner | ef5cd1d | 2005-01-18 17:54:55 +0000 | [diff] [blame] | 2947 | |
Chris Lattner | 82fbfb6 | 2005-01-18 02:59:52 +0000 | [diff] [blame] | 2948 | case ISD::SETCC: |
Chris Lattner | c9c60f6 | 2005-08-24 16:35:28 +0000 | [diff] [blame] | 2949 | assert(isTypeLegal(TLI.getSetCCResultTy()) && "SetCC type is not legal??"); |
Chris Lattner | 7cf7e3f | 2005-08-09 20:20:18 +0000 | [diff] [blame] | 2950 | Result = DAG.getNode(ISD::SETCC, TLI.getSetCCResultTy(),Node->getOperand(0), |
| 2951 | Node->getOperand(1), Node->getOperand(2)); |
Chris Lattner | 82fbfb6 | 2005-01-18 02:59:52 +0000 | [diff] [blame] | 2952 | break; |
Chris Lattner | fdfded5 | 2006-04-12 16:20:43 +0000 | [diff] [blame] | 2953 | |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 2954 | case ISD::TRUNCATE: |
| 2955 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 2956 | case Legal: |
| 2957 | Result = LegalizeOp(Node->getOperand(0)); |
| 2958 | assert(Result.getValueType() >= NVT && |
| 2959 | "This truncation doesn't make sense!"); |
| 2960 | if (Result.getValueType() > NVT) // Truncate to NVT instead of VT |
| 2961 | Result = DAG.getNode(ISD::TRUNCATE, NVT, Result); |
| 2962 | break; |
Chris Lattner | e76ad6d | 2005-01-28 22:52:50 +0000 | [diff] [blame] | 2963 | case Promote: |
| 2964 | // The truncation is not required, because we don't guarantee anything |
| 2965 | // about high bits anyway. |
| 2966 | Result = PromoteOp(Node->getOperand(0)); |
| 2967 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 2968 | case Expand: |
Nate Begeman | 79e46ac | 2005-04-04 00:57:08 +0000 | [diff] [blame] | 2969 | ExpandOp(Node->getOperand(0), Tmp1, Tmp2); |
| 2970 | // Truncate the low part of the expanded value to the result type |
Chris Lattner | e21c305 | 2005-08-01 18:16:37 +0000 | [diff] [blame] | 2971 | Result = DAG.getNode(ISD::TRUNCATE, NVT, Tmp1); |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 2972 | } |
| 2973 | break; |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 2974 | case ISD::SIGN_EXTEND: |
| 2975 | case ISD::ZERO_EXTEND: |
Chris Lattner | 13c78e2 | 2005-09-02 00:18:10 +0000 | [diff] [blame] | 2976 | case ISD::ANY_EXTEND: |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 2977 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 2978 | case Expand: assert(0 && "BUG: Smaller reg should have been promoted!"); |
| 2979 | case Legal: |
| 2980 | // Input is legal? Just do extend all the way to the larger type. |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 2981 | Result = DAG.getNode(Node->getOpcode(), NVT, Node->getOperand(0)); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 2982 | break; |
| 2983 | case Promote: |
| 2984 | // Promote the reg if it's smaller. |
| 2985 | Result = PromoteOp(Node->getOperand(0)); |
| 2986 | // The high bits are not guaranteed to be anything. Insert an extend. |
| 2987 | if (Node->getOpcode() == ISD::SIGN_EXTEND) |
Chris Lattner | 595dc54 | 2005-02-04 18:39:19 +0000 | [diff] [blame] | 2988 | Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Result, |
Chris Lattner | 15e4b01 | 2005-07-10 00:07:11 +0000 | [diff] [blame] | 2989 | DAG.getValueType(Node->getOperand(0).getValueType())); |
Chris Lattner | 13c78e2 | 2005-09-02 00:18:10 +0000 | [diff] [blame] | 2990 | else if (Node->getOpcode() == ISD::ZERO_EXTEND) |
Chris Lattner | 2399356 | 2005-04-13 02:38:47 +0000 | [diff] [blame] | 2991 | Result = DAG.getZeroExtendInReg(Result, |
| 2992 | Node->getOperand(0).getValueType()); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 2993 | break; |
| 2994 | } |
| 2995 | break; |
Chris Lattner | 3548189 | 2005-12-23 00:16:34 +0000 | [diff] [blame] | 2996 | case ISD::BIT_CONVERT: |
| 2997 | Result = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0)); |
| 2998 | Result = PromoteOp(Result); |
| 2999 | break; |
| 3000 | |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3001 | case ISD::FP_EXTEND: |
| 3002 | assert(0 && "Case not implemented. Dynamically dead with 2 FP types!"); |
| 3003 | case ISD::FP_ROUND: |
| 3004 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 3005 | case Expand: assert(0 && "BUG: Cannot expand FP regs!"); |
| 3006 | case Promote: assert(0 && "Unreachable with 2 FP types!"); |
| 3007 | case Legal: |
| 3008 | // Input is legal? Do an FP_ROUND_INREG. |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 3009 | Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Node->getOperand(0), |
Chris Lattner | 15e4b01 | 2005-07-10 00:07:11 +0000 | [diff] [blame] | 3010 | DAG.getValueType(VT)); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3011 | break; |
| 3012 | } |
| 3013 | break; |
| 3014 | |
| 3015 | case ISD::SINT_TO_FP: |
| 3016 | case ISD::UINT_TO_FP: |
| 3017 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 3018 | case Legal: |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 3019 | // No extra round required here. |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 3020 | Result = DAG.getNode(Node->getOpcode(), NVT, Node->getOperand(0)); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3021 | break; |
| 3022 | |
| 3023 | case Promote: |
| 3024 | Result = PromoteOp(Node->getOperand(0)); |
| 3025 | if (Node->getOpcode() == ISD::SINT_TO_FP) |
| 3026 | Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(), |
Chris Lattner | 15e4b01 | 2005-07-10 00:07:11 +0000 | [diff] [blame] | 3027 | Result, |
| 3028 | DAG.getValueType(Node->getOperand(0).getValueType())); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3029 | else |
Chris Lattner | 2399356 | 2005-04-13 02:38:47 +0000 | [diff] [blame] | 3030 | Result = DAG.getZeroExtendInReg(Result, |
| 3031 | Node->getOperand(0).getValueType()); |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 3032 | // No extra round required here. |
| 3033 | Result = DAG.getNode(Node->getOpcode(), NVT, Result); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3034 | break; |
| 3035 | case Expand: |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 3036 | Result = ExpandIntToFP(Node->getOpcode() == ISD::SINT_TO_FP, NVT, |
| 3037 | Node->getOperand(0)); |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 3038 | // Round if we cannot tolerate excess precision. |
| 3039 | if (NoExcessFPPrecision) |
Chris Lattner | 15e4b01 | 2005-07-10 00:07:11 +0000 | [diff] [blame] | 3040 | Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result, |
| 3041 | DAG.getValueType(VT)); |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 3042 | break; |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3043 | } |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3044 | break; |
| 3045 | |
Chris Lattner | 5e3c5b4 | 2005-12-09 17:32:47 +0000 | [diff] [blame] | 3046 | case ISD::SIGN_EXTEND_INREG: |
| 3047 | Result = PromoteOp(Node->getOperand(0)); |
| 3048 | Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Result, |
| 3049 | Node->getOperand(1)); |
| 3050 | break; |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3051 | case ISD::FP_TO_SINT: |
| 3052 | case ISD::FP_TO_UINT: |
| 3053 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 3054 | case Legal: |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 3055 | Tmp1 = Node->getOperand(0); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3056 | break; |
| 3057 | case Promote: |
| 3058 | // The input result is prerounded, so we don't have to do anything |
| 3059 | // special. |
| 3060 | Tmp1 = PromoteOp(Node->getOperand(0)); |
| 3061 | break; |
| 3062 | case Expand: |
| 3063 | assert(0 && "not implemented"); |
| 3064 | } |
Nate Begeman | d2558e3 | 2005-08-14 01:20:53 +0000 | [diff] [blame] | 3065 | // If we're promoting a UINT to a larger size, check to see if the new node |
| 3066 | // will be legal. If it isn't, check to see if FP_TO_SINT is legal, since |
| 3067 | // we can use that instead. This allows us to generate better code for |
| 3068 | // FP_TO_UINT for small destination sizes on targets where FP_TO_UINT is not |
| 3069 | // legal, such as PowerPC. |
| 3070 | if (Node->getOpcode() == ISD::FP_TO_UINT && |
Chris Lattner | c9c60f6 | 2005-08-24 16:35:28 +0000 | [diff] [blame] | 3071 | !TLI.isOperationLegal(ISD::FP_TO_UINT, NVT) && |
Nate Begeman | b7f6ef1 | 2005-10-25 23:47:25 +0000 | [diff] [blame] | 3072 | (TLI.isOperationLegal(ISD::FP_TO_SINT, NVT) || |
| 3073 | TLI.getOperationAction(ISD::FP_TO_SINT, NVT)==TargetLowering::Custom)){ |
Nate Begeman | d2558e3 | 2005-08-14 01:20:53 +0000 | [diff] [blame] | 3074 | Result = DAG.getNode(ISD::FP_TO_SINT, NVT, Tmp1); |
| 3075 | } else { |
| 3076 | Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1); |
| 3077 | } |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3078 | break; |
| 3079 | |
Chris Lattner | 2c8086f | 2005-04-02 05:00:07 +0000 | [diff] [blame] | 3080 | case ISD::FABS: |
| 3081 | case ISD::FNEG: |
| 3082 | Tmp1 = PromoteOp(Node->getOperand(0)); |
| 3083 | assert(Tmp1.getValueType() == NVT); |
| 3084 | Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1); |
| 3085 | // NOTE: we do not have to do any extra rounding here for |
| 3086 | // NoExcessFPPrecision, because we know the input will have the appropriate |
| 3087 | // precision, and these operations don't modify precision at all. |
| 3088 | break; |
| 3089 | |
Chris Lattner | da6ba87 | 2005-04-28 21:44:33 +0000 | [diff] [blame] | 3090 | case ISD::FSQRT: |
| 3091 | case ISD::FSIN: |
| 3092 | case ISD::FCOS: |
| 3093 | Tmp1 = PromoteOp(Node->getOperand(0)); |
| 3094 | assert(Tmp1.getValueType() == NVT); |
| 3095 | Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 3096 | if (NoExcessFPPrecision) |
Chris Lattner | 15e4b01 | 2005-07-10 00:07:11 +0000 | [diff] [blame] | 3097 | Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result, |
| 3098 | DAG.getValueType(VT)); |
Chris Lattner | da6ba87 | 2005-04-28 21:44:33 +0000 | [diff] [blame] | 3099 | break; |
| 3100 | |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 3101 | case ISD::AND: |
| 3102 | case ISD::OR: |
| 3103 | case ISD::XOR: |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 3104 | case ISD::ADD: |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3105 | case ISD::SUB: |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 3106 | case ISD::MUL: |
| 3107 | // The input may have strange things in the top bits of the registers, but |
Chris Lattner | 01b3d73 | 2005-09-28 22:28:18 +0000 | [diff] [blame] | 3108 | // these operations don't care. They may have weird bits going out, but |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 3109 | // that too is okay if they are integer operations. |
| 3110 | Tmp1 = PromoteOp(Node->getOperand(0)); |
| 3111 | Tmp2 = PromoteOp(Node->getOperand(1)); |
| 3112 | assert(Tmp1.getValueType() == NVT && Tmp2.getValueType() == NVT); |
| 3113 | Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2); |
Chris Lattner | 01b3d73 | 2005-09-28 22:28:18 +0000 | [diff] [blame] | 3114 | break; |
| 3115 | case ISD::FADD: |
| 3116 | case ISD::FSUB: |
| 3117 | case ISD::FMUL: |
Chris Lattner | 01b3d73 | 2005-09-28 22:28:18 +0000 | [diff] [blame] | 3118 | Tmp1 = PromoteOp(Node->getOperand(0)); |
| 3119 | Tmp2 = PromoteOp(Node->getOperand(1)); |
| 3120 | assert(Tmp1.getValueType() == NVT && Tmp2.getValueType() == NVT); |
| 3121 | Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2); |
| 3122 | |
| 3123 | // Floating point operations will give excess precision that we may not be |
| 3124 | // able to tolerate. If we DO allow excess precision, just leave it, |
| 3125 | // otherwise excise it. |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3126 | // FIXME: Why would we need to round FP ops more than integer ones? |
| 3127 | // Is Round(Add(Add(A,B),C)) != Round(Add(Round(Add(A,B)), C)) |
Chris Lattner | 01b3d73 | 2005-09-28 22:28:18 +0000 | [diff] [blame] | 3128 | if (NoExcessFPPrecision) |
Chris Lattner | 15e4b01 | 2005-07-10 00:07:11 +0000 | [diff] [blame] | 3129 | Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result, |
| 3130 | DAG.getValueType(VT)); |
Chris Lattner | 0f69b29 | 2005-01-15 06:18:18 +0000 | [diff] [blame] | 3131 | break; |
| 3132 | |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3133 | case ISD::SDIV: |
| 3134 | case ISD::SREM: |
| 3135 | // These operators require that their input be sign extended. |
| 3136 | Tmp1 = PromoteOp(Node->getOperand(0)); |
| 3137 | Tmp2 = PromoteOp(Node->getOperand(1)); |
| 3138 | if (MVT::isInteger(NVT)) { |
Chris Lattner | 15e4b01 | 2005-07-10 00:07:11 +0000 | [diff] [blame] | 3139 | Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1, |
| 3140 | DAG.getValueType(VT)); |
| 3141 | Tmp2 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp2, |
| 3142 | DAG.getValueType(VT)); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3143 | } |
| 3144 | Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2); |
| 3145 | |
| 3146 | // Perform FP_ROUND: this is probably overly pessimistic. |
| 3147 | if (MVT::isFloatingPoint(NVT) && NoExcessFPPrecision) |
Chris Lattner | 15e4b01 | 2005-07-10 00:07:11 +0000 | [diff] [blame] | 3148 | Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result, |
| 3149 | DAG.getValueType(VT)); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3150 | break; |
Chris Lattner | 01b3d73 | 2005-09-28 22:28:18 +0000 | [diff] [blame] | 3151 | case ISD::FDIV: |
| 3152 | case ISD::FREM: |
Chris Lattner | a09f848 | 2006-03-05 05:09:38 +0000 | [diff] [blame] | 3153 | case ISD::FCOPYSIGN: |
Chris Lattner | 01b3d73 | 2005-09-28 22:28:18 +0000 | [diff] [blame] | 3154 | // These operators require that their input be fp extended. |
Nate Begeman | ec57fd9 | 2006-05-09 18:20:51 +0000 | [diff] [blame] | 3155 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 3156 | case Legal: |
| 3157 | Tmp1 = LegalizeOp(Node->getOperand(0)); |
| 3158 | break; |
| 3159 | case Promote: |
| 3160 | Tmp1 = PromoteOp(Node->getOperand(0)); |
| 3161 | break; |
| 3162 | case Expand: |
| 3163 | assert(0 && "not implemented"); |
| 3164 | } |
| 3165 | switch (getTypeAction(Node->getOperand(1).getValueType())) { |
| 3166 | case Legal: |
| 3167 | Tmp2 = LegalizeOp(Node->getOperand(1)); |
| 3168 | break; |
| 3169 | case Promote: |
| 3170 | Tmp2 = PromoteOp(Node->getOperand(1)); |
| 3171 | break; |
| 3172 | case Expand: |
| 3173 | assert(0 && "not implemented"); |
| 3174 | } |
Chris Lattner | 01b3d73 | 2005-09-28 22:28:18 +0000 | [diff] [blame] | 3175 | Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2); |
| 3176 | |
| 3177 | // Perform FP_ROUND: this is probably overly pessimistic. |
Chris Lattner | a09f848 | 2006-03-05 05:09:38 +0000 | [diff] [blame] | 3178 | if (NoExcessFPPrecision && Node->getOpcode() != ISD::FCOPYSIGN) |
Chris Lattner | 01b3d73 | 2005-09-28 22:28:18 +0000 | [diff] [blame] | 3179 | Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result, |
| 3180 | DAG.getValueType(VT)); |
| 3181 | break; |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3182 | |
| 3183 | case ISD::UDIV: |
| 3184 | case ISD::UREM: |
| 3185 | // These operators require that their input be zero extended. |
| 3186 | Tmp1 = PromoteOp(Node->getOperand(0)); |
| 3187 | Tmp2 = PromoteOp(Node->getOperand(1)); |
| 3188 | assert(MVT::isInteger(NVT) && "Operators don't apply to FP!"); |
Chris Lattner | 2399356 | 2005-04-13 02:38:47 +0000 | [diff] [blame] | 3189 | Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT); |
| 3190 | Tmp2 = DAG.getZeroExtendInReg(Tmp2, VT); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3191 | Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2); |
| 3192 | break; |
| 3193 | |
| 3194 | case ISD::SHL: |
| 3195 | Tmp1 = PromoteOp(Node->getOperand(0)); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 3196 | Result = DAG.getNode(ISD::SHL, NVT, Tmp1, Node->getOperand(1)); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3197 | break; |
| 3198 | case ISD::SRA: |
| 3199 | // The input value must be properly sign extended. |
| 3200 | Tmp1 = PromoteOp(Node->getOperand(0)); |
Chris Lattner | 15e4b01 | 2005-07-10 00:07:11 +0000 | [diff] [blame] | 3201 | Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1, |
| 3202 | DAG.getValueType(VT)); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 3203 | Result = DAG.getNode(ISD::SRA, NVT, Tmp1, Node->getOperand(1)); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3204 | break; |
| 3205 | case ISD::SRL: |
| 3206 | // The input value must be properly zero extended. |
| 3207 | Tmp1 = PromoteOp(Node->getOperand(0)); |
Chris Lattner | 2399356 | 2005-04-13 02:38:47 +0000 | [diff] [blame] | 3208 | Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 3209 | Result = DAG.getNode(ISD::SRL, NVT, Tmp1, Node->getOperand(1)); |
Chris Lattner | 8b6fa22 | 2005-01-15 22:16:26 +0000 | [diff] [blame] | 3210 | break; |
Nate Begeman | 0aed784 | 2006-01-28 03:14:31 +0000 | [diff] [blame] | 3211 | |
| 3212 | case ISD::VAARG: |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 3213 | Tmp1 = Node->getOperand(0); // Get the chain. |
| 3214 | Tmp2 = Node->getOperand(1); // Get the pointer. |
Nate Begeman | 0aed784 | 2006-01-28 03:14:31 +0000 | [diff] [blame] | 3215 | if (TLI.getOperationAction(ISD::VAARG, VT) == TargetLowering::Custom) { |
| 3216 | Tmp3 = DAG.getVAArg(VT, Tmp1, Tmp2, Node->getOperand(2)); |
| 3217 | Result = TLI.CustomPromoteOperation(Tmp3, DAG); |
| 3218 | } else { |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 3219 | SrcValueSDNode *SV = cast<SrcValueSDNode>(Node->getOperand(2)); |
Nate Begeman | 0aed784 | 2006-01-28 03:14:31 +0000 | [diff] [blame] | 3220 | SDOperand VAList = DAG.getLoad(TLI.getPointerTy(), Tmp1, Tmp2, |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 3221 | SV->getValue(), SV->getOffset()); |
Nate Begeman | 0aed784 | 2006-01-28 03:14:31 +0000 | [diff] [blame] | 3222 | // Increment the pointer, VAList, to the next vaarg |
| 3223 | Tmp3 = DAG.getNode(ISD::ADD, TLI.getPointerTy(), VAList, |
| 3224 | DAG.getConstant(MVT::getSizeInBits(VT)/8, |
| 3225 | TLI.getPointerTy())); |
| 3226 | // Store the incremented VAList to the legalized pointer |
Evan Cheng | 786225a | 2006-10-05 23:01:46 +0000 | [diff] [blame] | 3227 | Tmp3 = DAG.getStore(VAList.getValue(1), Tmp3, Tmp2, Node->getOperand(2)); |
Nate Begeman | 0aed784 | 2006-01-28 03:14:31 +0000 | [diff] [blame] | 3228 | // Load the actual argument out of the pointer VAList |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 3229 | Result = DAG.getExtLoad(ISD::EXTLOAD, NVT, Tmp3, VAList, NULL, 0, VT); |
Nate Begeman | 0aed784 | 2006-01-28 03:14:31 +0000 | [diff] [blame] | 3230 | } |
| 3231 | // Remember that we legalized the chain. |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 3232 | AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1))); |
Nate Begeman | 0aed784 | 2006-01-28 03:14:31 +0000 | [diff] [blame] | 3233 | break; |
| 3234 | |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 3235 | case ISD::LOAD: { |
| 3236 | LoadSDNode *LD = cast<LoadSDNode>(Node); |
| 3237 | Result = DAG.getExtLoad(ISD::EXTLOAD, NVT, LD->getChain(), LD->getBasePtr(), |
| 3238 | LD->getSrcValue(), LD->getSrcValueOffset(), VT); |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 3239 | // Remember that we legalized the chain. |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 3240 | AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1))); |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 3241 | break; |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 3242 | } |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 3243 | case ISD::SELECT: |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 3244 | Tmp2 = PromoteOp(Node->getOperand(1)); // Legalize the op0 |
| 3245 | Tmp3 = PromoteOp(Node->getOperand(2)); // Legalize the op1 |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 3246 | Result = DAG.getNode(ISD::SELECT, NVT, Node->getOperand(0), Tmp2, Tmp3); |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 3247 | break; |
Nate Begeman | 9373a81 | 2005-08-10 20:51:12 +0000 | [diff] [blame] | 3248 | case ISD::SELECT_CC: |
| 3249 | Tmp2 = PromoteOp(Node->getOperand(2)); // True |
| 3250 | Tmp3 = PromoteOp(Node->getOperand(3)); // False |
| 3251 | Result = DAG.getNode(ISD::SELECT_CC, NVT, Node->getOperand(0), |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 3252 | Node->getOperand(1), Tmp2, Tmp3, Node->getOperand(4)); |
Nate Begeman | 9373a81 | 2005-08-10 20:51:12 +0000 | [diff] [blame] | 3253 | break; |
Nate Begeman | d88fc03 | 2006-01-14 03:14:10 +0000 | [diff] [blame] | 3254 | case ISD::BSWAP: |
| 3255 | Tmp1 = Node->getOperand(0); |
| 3256 | Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1); |
| 3257 | Tmp1 = DAG.getNode(ISD::BSWAP, NVT, Tmp1); |
| 3258 | Result = DAG.getNode(ISD::SRL, NVT, Tmp1, |
| 3259 | DAG.getConstant(getSizeInBits(NVT) - getSizeInBits(VT), |
| 3260 | TLI.getShiftAmountTy())); |
| 3261 | break; |
Andrew Lenharth | fecf095 | 2005-05-04 19:11:05 +0000 | [diff] [blame] | 3262 | case ISD::CTPOP: |
| 3263 | case ISD::CTTZ: |
| 3264 | case ISD::CTLZ: |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 3265 | // Zero extend the argument |
| 3266 | Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Node->getOperand(0)); |
Andrew Lenharth | fecf095 | 2005-05-04 19:11:05 +0000 | [diff] [blame] | 3267 | // Perform the larger operation, then subtract if needed. |
| 3268 | Tmp1 = DAG.getNode(Node->getOpcode(), NVT, Tmp1); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 3269 | switch(Node->getOpcode()) { |
Andrew Lenharth | fecf095 | 2005-05-04 19:11:05 +0000 | [diff] [blame] | 3270 | case ISD::CTPOP: |
| 3271 | Result = Tmp1; |
| 3272 | break; |
| 3273 | case ISD::CTTZ: |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 3274 | // if Tmp1 == sizeinbits(NVT) then Tmp1 = sizeinbits(Old VT) |
Nate Begeman | d2558e3 | 2005-08-14 01:20:53 +0000 | [diff] [blame] | 3275 | Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), Tmp1, |
Chris Lattner | 7cf7e3f | 2005-08-09 20:20:18 +0000 | [diff] [blame] | 3276 | DAG.getConstant(getSizeInBits(NVT), NVT), ISD::SETEQ); |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 3277 | Result = DAG.getNode(ISD::SELECT, NVT, Tmp2, |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 3278 | DAG.getConstant(getSizeInBits(VT), NVT), Tmp1); |
Andrew Lenharth | fecf095 | 2005-05-04 19:11:05 +0000 | [diff] [blame] | 3279 | break; |
| 3280 | case ISD::CTLZ: |
| 3281 | //Tmp1 = Tmp1 - (sizeinbits(NVT) - sizeinbits(Old VT)) |
Jeff Cohen | 00b16889 | 2005-07-27 06:12:32 +0000 | [diff] [blame] | 3282 | Result = DAG.getNode(ISD::SUB, NVT, Tmp1, |
| 3283 | DAG.getConstant(getSizeInBits(NVT) - |
Andrew Lenharth | fecf095 | 2005-05-04 19:11:05 +0000 | [diff] [blame] | 3284 | getSizeInBits(VT), NVT)); |
| 3285 | break; |
| 3286 | } |
| 3287 | break; |
Chris Lattner | 1597221 | 2006-03-31 17:55:51 +0000 | [diff] [blame] | 3288 | case ISD::VEXTRACT_VECTOR_ELT: |
| 3289 | Result = PromoteOp(LowerVEXTRACT_VECTOR_ELT(Op)); |
| 3290 | break; |
Chris Lattner | 4aab2f4 | 2006-04-02 05:06:04 +0000 | [diff] [blame] | 3291 | case ISD::EXTRACT_VECTOR_ELT: |
| 3292 | Result = PromoteOp(ExpandEXTRACT_VECTOR_ELT(Op)); |
| 3293 | break; |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 3294 | } |
| 3295 | |
| 3296 | assert(Result.Val && "Didn't set a result!"); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 3297 | |
| 3298 | // Make sure the result is itself legal. |
| 3299 | Result = LegalizeOp(Result); |
| 3300 | |
| 3301 | // Remember that we promoted this! |
Chris Lattner | 03c8546 | 2005-01-15 05:21:40 +0000 | [diff] [blame] | 3302 | AddPromotedOperand(Op, Result); |
| 3303 | return Result; |
| 3304 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 3305 | |
Chris Lattner | 1597221 | 2006-03-31 17:55:51 +0000 | [diff] [blame] | 3306 | /// LowerVEXTRACT_VECTOR_ELT - Lower a VEXTRACT_VECTOR_ELT operation into a |
| 3307 | /// EXTRACT_VECTOR_ELT operation, to memory operations, or to scalar code based |
| 3308 | /// on the vector type. The return type of this matches the element type of the |
| 3309 | /// vector, which may not be legal for the target. |
| 3310 | SDOperand SelectionDAGLegalize::LowerVEXTRACT_VECTOR_ELT(SDOperand Op) { |
| 3311 | // We know that operand #0 is the Vec vector. If the index is a constant |
| 3312 | // or if the invec is a supported hardware type, we can use it. Otherwise, |
| 3313 | // lower to a store then an indexed load. |
| 3314 | SDOperand Vec = Op.getOperand(0); |
| 3315 | SDOperand Idx = LegalizeOp(Op.getOperand(1)); |
| 3316 | |
| 3317 | SDNode *InVal = Vec.Val; |
| 3318 | unsigned NumElems = cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue(); |
| 3319 | MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT(); |
| 3320 | |
| 3321 | // Figure out if there is a Packed type corresponding to this Vector |
| 3322 | // type. If so, convert to the packed type. |
| 3323 | MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems); |
| 3324 | if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) { |
| 3325 | // Turn this into a packed extract_vector_elt operation. |
| 3326 | Vec = PackVectorOp(Vec, TVT); |
| 3327 | return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, Op.getValueType(), Vec, Idx); |
| 3328 | } else if (NumElems == 1) { |
| 3329 | // This must be an access of the only element. Return it. |
| 3330 | return PackVectorOp(Vec, EVT); |
| 3331 | } else if (ConstantSDNode *CIdx = dyn_cast<ConstantSDNode>(Idx)) { |
| 3332 | SDOperand Lo, Hi; |
| 3333 | SplitVectorOp(Vec, Lo, Hi); |
| 3334 | if (CIdx->getValue() < NumElems/2) { |
| 3335 | Vec = Lo; |
| 3336 | } else { |
| 3337 | Vec = Hi; |
| 3338 | Idx = DAG.getConstant(CIdx->getValue() - NumElems/2, Idx.getValueType()); |
| 3339 | } |
| 3340 | |
| 3341 | // It's now an extract from the appropriate high or low part. Recurse. |
| 3342 | Op = DAG.UpdateNodeOperands(Op, Vec, Idx); |
| 3343 | return LowerVEXTRACT_VECTOR_ELT(Op); |
| 3344 | } else { |
| 3345 | // Variable index case for extract element. |
| 3346 | // FIXME: IMPLEMENT STORE/LOAD lowering. Need alignment of stack slot!! |
| 3347 | assert(0 && "unimp!"); |
| 3348 | return SDOperand(); |
| 3349 | } |
| 3350 | } |
| 3351 | |
Chris Lattner | 4aab2f4 | 2006-04-02 05:06:04 +0000 | [diff] [blame] | 3352 | /// ExpandEXTRACT_VECTOR_ELT - Expand an EXTRACT_VECTOR_ELT operation into |
| 3353 | /// memory traffic. |
| 3354 | SDOperand SelectionDAGLegalize::ExpandEXTRACT_VECTOR_ELT(SDOperand Op) { |
| 3355 | SDOperand Vector = Op.getOperand(0); |
| 3356 | SDOperand Idx = Op.getOperand(1); |
| 3357 | |
| 3358 | // If the target doesn't support this, store the value to a temporary |
| 3359 | // stack slot, then LOAD the scalar element back out. |
| 3360 | SDOperand StackPtr = CreateStackTemporary(Vector.getValueType()); |
Evan Cheng | 786225a | 2006-10-05 23:01:46 +0000 | [diff] [blame] | 3361 | SDOperand Ch = DAG.getStore(DAG.getEntryNode(), |
| 3362 | Vector, StackPtr, DAG.getSrcValue(NULL)); |
Chris Lattner | 4aab2f4 | 2006-04-02 05:06:04 +0000 | [diff] [blame] | 3363 | |
| 3364 | // Add the offset to the index. |
| 3365 | unsigned EltSize = MVT::getSizeInBits(Op.getValueType())/8; |
| 3366 | Idx = DAG.getNode(ISD::MUL, Idx.getValueType(), Idx, |
| 3367 | DAG.getConstant(EltSize, Idx.getValueType())); |
| 3368 | StackPtr = DAG.getNode(ISD::ADD, Idx.getValueType(), Idx, StackPtr); |
| 3369 | |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 3370 | return DAG.getLoad(Op.getValueType(), Ch, StackPtr, NULL, 0); |
Chris Lattner | 4aab2f4 | 2006-04-02 05:06:04 +0000 | [diff] [blame] | 3371 | } |
| 3372 | |
Chris Lattner | 1597221 | 2006-03-31 17:55:51 +0000 | [diff] [blame] | 3373 | |
Nate Begeman | 750ac1b | 2006-02-01 07:19:44 +0000 | [diff] [blame] | 3374 | /// LegalizeSetCCOperands - Attempts to create a legal LHS and RHS for a SETCC |
| 3375 | /// with condition CC on the current target. This usually involves legalizing |
| 3376 | /// or promoting the arguments. In the case where LHS and RHS must be expanded, |
| 3377 | /// there may be no choice but to create a new SetCC node to represent the |
| 3378 | /// legalized value of setcc lhs, rhs. In this case, the value is returned in |
| 3379 | /// LHS, and the SDOperand returned in RHS has a nil SDNode value. |
| 3380 | void SelectionDAGLegalize::LegalizeSetCCOperands(SDOperand &LHS, |
| 3381 | SDOperand &RHS, |
| 3382 | SDOperand &CC) { |
| 3383 | SDOperand Tmp1, Tmp2, Result; |
| 3384 | |
| 3385 | switch (getTypeAction(LHS.getValueType())) { |
| 3386 | case Legal: |
| 3387 | Tmp1 = LegalizeOp(LHS); // LHS |
| 3388 | Tmp2 = LegalizeOp(RHS); // RHS |
| 3389 | break; |
| 3390 | case Promote: |
| 3391 | Tmp1 = PromoteOp(LHS); // LHS |
| 3392 | Tmp2 = PromoteOp(RHS); // RHS |
| 3393 | |
| 3394 | // If this is an FP compare, the operands have already been extended. |
| 3395 | if (MVT::isInteger(LHS.getValueType())) { |
| 3396 | MVT::ValueType VT = LHS.getValueType(); |
| 3397 | MVT::ValueType NVT = TLI.getTypeToTransformTo(VT); |
| 3398 | |
| 3399 | // Otherwise, we have to insert explicit sign or zero extends. Note |
| 3400 | // that we could insert sign extends for ALL conditions, but zero extend |
| 3401 | // is cheaper on many machines (an AND instead of two shifts), so prefer |
| 3402 | // it. |
| 3403 | switch (cast<CondCodeSDNode>(CC)->get()) { |
| 3404 | default: assert(0 && "Unknown integer comparison!"); |
| 3405 | case ISD::SETEQ: |
| 3406 | case ISD::SETNE: |
| 3407 | case ISD::SETUGE: |
| 3408 | case ISD::SETUGT: |
| 3409 | case ISD::SETULE: |
| 3410 | case ISD::SETULT: |
| 3411 | // ALL of these operations will work if we either sign or zero extend |
| 3412 | // the operands (including the unsigned comparisons!). Zero extend is |
| 3413 | // usually a simpler/cheaper operation, so prefer it. |
| 3414 | Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT); |
| 3415 | Tmp2 = DAG.getZeroExtendInReg(Tmp2, VT); |
| 3416 | break; |
| 3417 | case ISD::SETGE: |
| 3418 | case ISD::SETGT: |
| 3419 | case ISD::SETLT: |
| 3420 | case ISD::SETLE: |
| 3421 | Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1, |
| 3422 | DAG.getValueType(VT)); |
| 3423 | Tmp2 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp2, |
| 3424 | DAG.getValueType(VT)); |
| 3425 | break; |
| 3426 | } |
| 3427 | } |
| 3428 | break; |
| 3429 | case Expand: |
| 3430 | SDOperand LHSLo, LHSHi, RHSLo, RHSHi; |
| 3431 | ExpandOp(LHS, LHSLo, LHSHi); |
| 3432 | ExpandOp(RHS, RHSLo, RHSHi); |
| 3433 | switch (cast<CondCodeSDNode>(CC)->get()) { |
| 3434 | case ISD::SETEQ: |
| 3435 | case ISD::SETNE: |
| 3436 | if (RHSLo == RHSHi) |
| 3437 | if (ConstantSDNode *RHSCST = dyn_cast<ConstantSDNode>(RHSLo)) |
| 3438 | if (RHSCST->isAllOnesValue()) { |
| 3439 | // Comparison to -1. |
| 3440 | Tmp1 = DAG.getNode(ISD::AND, LHSLo.getValueType(), LHSLo, LHSHi); |
| 3441 | Tmp2 = RHSLo; |
| 3442 | break; |
| 3443 | } |
| 3444 | |
| 3445 | Tmp1 = DAG.getNode(ISD::XOR, LHSLo.getValueType(), LHSLo, RHSLo); |
| 3446 | Tmp2 = DAG.getNode(ISD::XOR, LHSLo.getValueType(), LHSHi, RHSHi); |
| 3447 | Tmp1 = DAG.getNode(ISD::OR, Tmp1.getValueType(), Tmp1, Tmp2); |
| 3448 | Tmp2 = DAG.getConstant(0, Tmp1.getValueType()); |
| 3449 | break; |
| 3450 | default: |
| 3451 | // If this is a comparison of the sign bit, just look at the top part. |
| 3452 | // X > -1, x < 0 |
| 3453 | if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(RHS)) |
| 3454 | if ((cast<CondCodeSDNode>(CC)->get() == ISD::SETLT && |
| 3455 | CST->getValue() == 0) || // X < 0 |
| 3456 | (cast<CondCodeSDNode>(CC)->get() == ISD::SETGT && |
| 3457 | CST->isAllOnesValue())) { // X > -1 |
| 3458 | Tmp1 = LHSHi; |
| 3459 | Tmp2 = RHSHi; |
| 3460 | break; |
| 3461 | } |
| 3462 | |
| 3463 | // FIXME: This generated code sucks. |
| 3464 | ISD::CondCode LowCC; |
| 3465 | switch (cast<CondCodeSDNode>(CC)->get()) { |
| 3466 | default: assert(0 && "Unknown integer setcc!"); |
| 3467 | case ISD::SETLT: |
| 3468 | case ISD::SETULT: LowCC = ISD::SETULT; break; |
| 3469 | case ISD::SETGT: |
| 3470 | case ISD::SETUGT: LowCC = ISD::SETUGT; break; |
| 3471 | case ISD::SETLE: |
| 3472 | case ISD::SETULE: LowCC = ISD::SETULE; break; |
| 3473 | case ISD::SETGE: |
| 3474 | case ISD::SETUGE: LowCC = ISD::SETUGE; break; |
| 3475 | } |
| 3476 | |
| 3477 | // Tmp1 = lo(op1) < lo(op2) // Always unsigned comparison |
| 3478 | // Tmp2 = hi(op1) < hi(op2) // Signedness depends on operands |
| 3479 | // dest = hi(op1) == hi(op2) ? Tmp1 : Tmp2; |
| 3480 | |
| 3481 | // NOTE: on targets without efficient SELECT of bools, we can always use |
| 3482 | // this identity: (B1 ? B2 : B3) --> (B1 & B2)|(!B1&B3) |
| 3483 | Tmp1 = DAG.getSetCC(TLI.getSetCCResultTy(), LHSLo, RHSLo, LowCC); |
| 3484 | Tmp2 = DAG.getNode(ISD::SETCC, TLI.getSetCCResultTy(), LHSHi, RHSHi, CC); |
| 3485 | Result = DAG.getSetCC(TLI.getSetCCResultTy(), LHSHi, RHSHi, ISD::SETEQ); |
| 3486 | Result = LegalizeOp(DAG.getNode(ISD::SELECT, Tmp1.getValueType(), |
| 3487 | Result, Tmp1, Tmp2)); |
| 3488 | Tmp1 = Result; |
Nate Begeman | da06e9e | 2006-02-01 19:05:15 +0000 | [diff] [blame] | 3489 | Tmp2 = SDOperand(); |
Nate Begeman | 750ac1b | 2006-02-01 07:19:44 +0000 | [diff] [blame] | 3490 | } |
| 3491 | } |
| 3492 | LHS = Tmp1; |
| 3493 | RHS = Tmp2; |
| 3494 | } |
| 3495 | |
Chris Lattner | 3548189 | 2005-12-23 00:16:34 +0000 | [diff] [blame] | 3496 | /// ExpandBIT_CONVERT - Expand a BIT_CONVERT node into a store/load combination. |
Chris Lattner | 232348d | 2005-12-23 00:52:30 +0000 | [diff] [blame] | 3497 | /// The resultant code need not be legal. Note that SrcOp is the input operand |
| 3498 | /// to the BIT_CONVERT, not the BIT_CONVERT node itself. |
Chris Lattner | 3548189 | 2005-12-23 00:16:34 +0000 | [diff] [blame] | 3499 | SDOperand SelectionDAGLegalize::ExpandBIT_CONVERT(MVT::ValueType DestVT, |
| 3500 | SDOperand SrcOp) { |
| 3501 | // Create the stack frame object. |
Chris Lattner | ce87215 | 2006-03-19 06:31:19 +0000 | [diff] [blame] | 3502 | SDOperand FIPtr = CreateStackTemporary(DestVT); |
Chris Lattner | 3548189 | 2005-12-23 00:16:34 +0000 | [diff] [blame] | 3503 | |
| 3504 | // Emit a store to the stack slot. |
Evan Cheng | 786225a | 2006-10-05 23:01:46 +0000 | [diff] [blame] | 3505 | SDOperand Store = DAG.getStore(DAG.getEntryNode(), |
| 3506 | SrcOp, FIPtr, DAG.getSrcValue(NULL)); |
Chris Lattner | 3548189 | 2005-12-23 00:16:34 +0000 | [diff] [blame] | 3507 | // Result is a load from the stack slot. |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 3508 | return DAG.getLoad(DestVT, Store, FIPtr, NULL, 0); |
Chris Lattner | 3548189 | 2005-12-23 00:16:34 +0000 | [diff] [blame] | 3509 | } |
| 3510 | |
Chris Lattner | 4352cc9 | 2006-04-04 17:23:26 +0000 | [diff] [blame] | 3511 | SDOperand SelectionDAGLegalize::ExpandSCALAR_TO_VECTOR(SDNode *Node) { |
| 3512 | // Create a vector sized/aligned stack slot, store the value to element #0, |
| 3513 | // then load the whole vector back out. |
| 3514 | SDOperand StackPtr = CreateStackTemporary(Node->getValueType(0)); |
Evan Cheng | 786225a | 2006-10-05 23:01:46 +0000 | [diff] [blame] | 3515 | SDOperand Ch = DAG.getStore(DAG.getEntryNode(), Node->getOperand(0), StackPtr, |
| 3516 | DAG.getSrcValue(NULL)); |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 3517 | return DAG.getLoad(Node->getValueType(0), Ch, StackPtr, NULL, 0); |
Chris Lattner | 4352cc9 | 2006-04-04 17:23:26 +0000 | [diff] [blame] | 3518 | } |
| 3519 | |
| 3520 | |
Chris Lattner | ce87215 | 2006-03-19 06:31:19 +0000 | [diff] [blame] | 3521 | /// ExpandBUILD_VECTOR - Expand a BUILD_VECTOR node on targets that don't |
| 3522 | /// support the operation, but do support the resultant packed vector type. |
| 3523 | SDOperand SelectionDAGLegalize::ExpandBUILD_VECTOR(SDNode *Node) { |
| 3524 | |
| 3525 | // If the only non-undef value is the low element, turn this into a |
Chris Lattner | 87100e0 | 2006-03-20 01:52:29 +0000 | [diff] [blame] | 3526 | // SCALAR_TO_VECTOR node. If this is { X, X, X, X }, determine X. |
Evan Cheng | 033e681 | 2006-03-24 01:17:21 +0000 | [diff] [blame] | 3527 | unsigned NumElems = Node->getNumOperands(); |
Chris Lattner | ce87215 | 2006-03-19 06:31:19 +0000 | [diff] [blame] | 3528 | bool isOnlyLowElement = true; |
Chris Lattner | 87100e0 | 2006-03-20 01:52:29 +0000 | [diff] [blame] | 3529 | SDOperand SplatValue = Node->getOperand(0); |
Evan Cheng | 033e681 | 2006-03-24 01:17:21 +0000 | [diff] [blame] | 3530 | std::map<SDOperand, std::vector<unsigned> > Values; |
| 3531 | Values[SplatValue].push_back(0); |
Chris Lattner | 2eb8653 | 2006-03-24 07:29:17 +0000 | [diff] [blame] | 3532 | bool isConstant = true; |
| 3533 | if (!isa<ConstantFPSDNode>(SplatValue) && !isa<ConstantSDNode>(SplatValue) && |
| 3534 | SplatValue.getOpcode() != ISD::UNDEF) |
| 3535 | isConstant = false; |
| 3536 | |
Evan Cheng | 033e681 | 2006-03-24 01:17:21 +0000 | [diff] [blame] | 3537 | for (unsigned i = 1; i < NumElems; ++i) { |
| 3538 | SDOperand V = Node->getOperand(i); |
Chris Lattner | 89a1b38 | 2006-04-19 23:17:50 +0000 | [diff] [blame] | 3539 | Values[V].push_back(i); |
Evan Cheng | 033e681 | 2006-03-24 01:17:21 +0000 | [diff] [blame] | 3540 | if (V.getOpcode() != ISD::UNDEF) |
Chris Lattner | ce87215 | 2006-03-19 06:31:19 +0000 | [diff] [blame] | 3541 | isOnlyLowElement = false; |
Evan Cheng | 033e681 | 2006-03-24 01:17:21 +0000 | [diff] [blame] | 3542 | if (SplatValue != V) |
Chris Lattner | 87100e0 | 2006-03-20 01:52:29 +0000 | [diff] [blame] | 3543 | SplatValue = SDOperand(0,0); |
Chris Lattner | 2eb8653 | 2006-03-24 07:29:17 +0000 | [diff] [blame] | 3544 | |
| 3545 | // If this isn't a constant element or an undef, we can't use a constant |
| 3546 | // pool load. |
| 3547 | if (!isa<ConstantFPSDNode>(V) && !isa<ConstantSDNode>(V) && |
| 3548 | V.getOpcode() != ISD::UNDEF) |
| 3549 | isConstant = false; |
Chris Lattner | ce87215 | 2006-03-19 06:31:19 +0000 | [diff] [blame] | 3550 | } |
| 3551 | |
| 3552 | if (isOnlyLowElement) { |
| 3553 | // If the low element is an undef too, then this whole things is an undef. |
| 3554 | if (Node->getOperand(0).getOpcode() == ISD::UNDEF) |
| 3555 | return DAG.getNode(ISD::UNDEF, Node->getValueType(0)); |
| 3556 | // Otherwise, turn this into a scalar_to_vector node. |
| 3557 | return DAG.getNode(ISD::SCALAR_TO_VECTOR, Node->getValueType(0), |
| 3558 | Node->getOperand(0)); |
| 3559 | } |
| 3560 | |
Chris Lattner | 2eb8653 | 2006-03-24 07:29:17 +0000 | [diff] [blame] | 3561 | // If all elements are constants, create a load from the constant pool. |
| 3562 | if (isConstant) { |
| 3563 | MVT::ValueType VT = Node->getValueType(0); |
| 3564 | const Type *OpNTy = |
| 3565 | MVT::getTypeForValueType(Node->getOperand(0).getValueType()); |
| 3566 | std::vector<Constant*> CV; |
| 3567 | for (unsigned i = 0, e = NumElems; i != e; ++i) { |
| 3568 | if (ConstantFPSDNode *V = |
| 3569 | dyn_cast<ConstantFPSDNode>(Node->getOperand(i))) { |
| 3570 | CV.push_back(ConstantFP::get(OpNTy, V->getValue())); |
| 3571 | } else if (ConstantSDNode *V = |
| 3572 | dyn_cast<ConstantSDNode>(Node->getOperand(i))) { |
| 3573 | CV.push_back(ConstantUInt::get(OpNTy, V->getValue())); |
| 3574 | } else { |
| 3575 | assert(Node->getOperand(i).getOpcode() == ISD::UNDEF); |
| 3576 | CV.push_back(UndefValue::get(OpNTy)); |
| 3577 | } |
| 3578 | } |
| 3579 | Constant *CP = ConstantPacked::get(CV); |
| 3580 | SDOperand CPIdx = DAG.getConstantPool(CP, TLI.getPointerTy()); |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 3581 | return DAG.getLoad(VT, DAG.getEntryNode(), CPIdx, NULL, 0); |
Chris Lattner | 2eb8653 | 2006-03-24 07:29:17 +0000 | [diff] [blame] | 3582 | } |
| 3583 | |
Chris Lattner | 87100e0 | 2006-03-20 01:52:29 +0000 | [diff] [blame] | 3584 | if (SplatValue.Val) { // Splat of one value? |
| 3585 | // Build the shuffle constant vector: <0, 0, 0, 0> |
| 3586 | MVT::ValueType MaskVT = |
Evan Cheng | 033e681 | 2006-03-24 01:17:21 +0000 | [diff] [blame] | 3587 | MVT::getIntVectorWithNumElements(NumElems); |
Chris Lattner | 87100e0 | 2006-03-20 01:52:29 +0000 | [diff] [blame] | 3588 | SDOperand Zero = DAG.getConstant(0, MVT::getVectorBaseType(MaskVT)); |
Evan Cheng | 033e681 | 2006-03-24 01:17:21 +0000 | [diff] [blame] | 3589 | std::vector<SDOperand> ZeroVec(NumElems, Zero); |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 3590 | SDOperand SplatMask = DAG.getNode(ISD::BUILD_VECTOR, MaskVT, |
| 3591 | &ZeroVec[0], ZeroVec.size()); |
Chris Lattner | 87100e0 | 2006-03-20 01:52:29 +0000 | [diff] [blame] | 3592 | |
| 3593 | // If the target supports VECTOR_SHUFFLE and this shuffle mask, use it. |
Chris Lattner | 4352cc9 | 2006-04-04 17:23:26 +0000 | [diff] [blame] | 3594 | if (isShuffleLegal(Node->getValueType(0), SplatMask)) { |
Chris Lattner | 87100e0 | 2006-03-20 01:52:29 +0000 | [diff] [blame] | 3595 | // Get the splatted value into the low element of a vector register. |
| 3596 | SDOperand LowValVec = |
| 3597 | DAG.getNode(ISD::SCALAR_TO_VECTOR, Node->getValueType(0), SplatValue); |
| 3598 | |
| 3599 | // Return shuffle(LowValVec, undef, <0,0,0,0>) |
| 3600 | return DAG.getNode(ISD::VECTOR_SHUFFLE, Node->getValueType(0), LowValVec, |
| 3601 | DAG.getNode(ISD::UNDEF, Node->getValueType(0)), |
| 3602 | SplatMask); |
| 3603 | } |
| 3604 | } |
| 3605 | |
Evan Cheng | 033e681 | 2006-03-24 01:17:21 +0000 | [diff] [blame] | 3606 | // If there are only two unique elements, we may be able to turn this into a |
| 3607 | // vector shuffle. |
| 3608 | if (Values.size() == 2) { |
| 3609 | // Build the shuffle constant vector: e.g. <0, 4, 0, 4> |
| 3610 | MVT::ValueType MaskVT = |
| 3611 | MVT::getIntVectorWithNumElements(NumElems); |
| 3612 | std::vector<SDOperand> MaskVec(NumElems); |
| 3613 | unsigned i = 0; |
| 3614 | for (std::map<SDOperand,std::vector<unsigned> >::iterator I=Values.begin(), |
| 3615 | E = Values.end(); I != E; ++I) { |
| 3616 | for (std::vector<unsigned>::iterator II = I->second.begin(), |
| 3617 | EE = I->second.end(); II != EE; ++II) |
| 3618 | MaskVec[*II] = DAG.getConstant(i, MVT::getVectorBaseType(MaskVT)); |
| 3619 | i += NumElems; |
| 3620 | } |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 3621 | SDOperand ShuffleMask = DAG.getNode(ISD::BUILD_VECTOR, MaskVT, |
| 3622 | &MaskVec[0], MaskVec.size()); |
Evan Cheng | 033e681 | 2006-03-24 01:17:21 +0000 | [diff] [blame] | 3623 | |
| 3624 | // If the target supports VECTOR_SHUFFLE and this shuffle mask, use it. |
Chris Lattner | 4352cc9 | 2006-04-04 17:23:26 +0000 | [diff] [blame] | 3625 | if (TLI.isOperationLegal(ISD::SCALAR_TO_VECTOR, Node->getValueType(0)) && |
| 3626 | isShuffleLegal(Node->getValueType(0), ShuffleMask)) { |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 3627 | SmallVector<SDOperand, 8> Ops; |
Evan Cheng | 033e681 | 2006-03-24 01:17:21 +0000 | [diff] [blame] | 3628 | for(std::map<SDOperand,std::vector<unsigned> >::iterator I=Values.begin(), |
| 3629 | E = Values.end(); I != E; ++I) { |
| 3630 | SDOperand Op = DAG.getNode(ISD::SCALAR_TO_VECTOR, Node->getValueType(0), |
| 3631 | I->first); |
| 3632 | Ops.push_back(Op); |
| 3633 | } |
| 3634 | Ops.push_back(ShuffleMask); |
| 3635 | |
| 3636 | // Return shuffle(LoValVec, HiValVec, <0,1,0,1>) |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 3637 | return DAG.getNode(ISD::VECTOR_SHUFFLE, Node->getValueType(0), |
| 3638 | &Ops[0], Ops.size()); |
Evan Cheng | 033e681 | 2006-03-24 01:17:21 +0000 | [diff] [blame] | 3639 | } |
| 3640 | } |
Chris Lattner | ce87215 | 2006-03-19 06:31:19 +0000 | [diff] [blame] | 3641 | |
| 3642 | // Otherwise, we can't handle this case efficiently. Allocate a sufficiently |
| 3643 | // aligned object on the stack, store each element into it, then load |
| 3644 | // the result as a vector. |
| 3645 | MVT::ValueType VT = Node->getValueType(0); |
| 3646 | // Create the stack frame object. |
| 3647 | SDOperand FIPtr = CreateStackTemporary(VT); |
| 3648 | |
| 3649 | // Emit a store of each element to the stack slot. |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 3650 | SmallVector<SDOperand, 8> Stores; |
Chris Lattner | ce87215 | 2006-03-19 06:31:19 +0000 | [diff] [blame] | 3651 | unsigned TypeByteSize = |
| 3652 | MVT::getSizeInBits(Node->getOperand(0).getValueType())/8; |
| 3653 | unsigned VectorSize = MVT::getSizeInBits(VT)/8; |
| 3654 | // Store (in the right endianness) the elements to memory. |
| 3655 | for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) { |
| 3656 | // Ignore undef elements. |
| 3657 | if (Node->getOperand(i).getOpcode() == ISD::UNDEF) continue; |
| 3658 | |
Chris Lattner | 841c882 | 2006-03-22 01:46:54 +0000 | [diff] [blame] | 3659 | unsigned Offset = TypeByteSize*i; |
Chris Lattner | ce87215 | 2006-03-19 06:31:19 +0000 | [diff] [blame] | 3660 | |
| 3661 | SDOperand Idx = DAG.getConstant(Offset, FIPtr.getValueType()); |
| 3662 | Idx = DAG.getNode(ISD::ADD, FIPtr.getValueType(), FIPtr, Idx); |
| 3663 | |
Evan Cheng | 786225a | 2006-10-05 23:01:46 +0000 | [diff] [blame] | 3664 | Stores.push_back(DAG.getStore(DAG.getEntryNode(), Node->getOperand(i), Idx, |
| 3665 | DAG.getSrcValue(NULL))); |
Chris Lattner | ce87215 | 2006-03-19 06:31:19 +0000 | [diff] [blame] | 3666 | } |
| 3667 | |
| 3668 | SDOperand StoreChain; |
| 3669 | if (!Stores.empty()) // Not all undef elements? |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 3670 | StoreChain = DAG.getNode(ISD::TokenFactor, MVT::Other, |
| 3671 | &Stores[0], Stores.size()); |
Chris Lattner | ce87215 | 2006-03-19 06:31:19 +0000 | [diff] [blame] | 3672 | else |
| 3673 | StoreChain = DAG.getEntryNode(); |
| 3674 | |
| 3675 | // Result is a load from the stack slot. |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 3676 | return DAG.getLoad(VT, StoreChain, FIPtr, NULL, 0); |
Chris Lattner | ce87215 | 2006-03-19 06:31:19 +0000 | [diff] [blame] | 3677 | } |
| 3678 | |
| 3679 | /// CreateStackTemporary - Create a stack temporary, suitable for holding the |
| 3680 | /// specified value type. |
| 3681 | SDOperand SelectionDAGLegalize::CreateStackTemporary(MVT::ValueType VT) { |
| 3682 | MachineFrameInfo *FrameInfo = DAG.getMachineFunction().getFrameInfo(); |
| 3683 | unsigned ByteSize = MVT::getSizeInBits(VT)/8; |
| 3684 | int FrameIdx = FrameInfo->CreateStackObject(ByteSize, ByteSize); |
| 3685 | return DAG.getFrameIndex(FrameIdx, TLI.getPointerTy()); |
| 3686 | } |
| 3687 | |
Chris Lattner | 5b359c6 | 2005-04-02 04:00:59 +0000 | [diff] [blame] | 3688 | void SelectionDAGLegalize::ExpandShiftParts(unsigned NodeOp, |
| 3689 | SDOperand Op, SDOperand Amt, |
| 3690 | SDOperand &Lo, SDOperand &Hi) { |
| 3691 | // Expand the subcomponents. |
| 3692 | SDOperand LHSL, LHSH; |
| 3693 | ExpandOp(Op, LHSL, LHSH); |
| 3694 | |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 3695 | SDOperand Ops[] = { LHSL, LHSH, Amt }; |
Chris Lattner | f9f37fc | 2006-08-14 23:53:35 +0000 | [diff] [blame] | 3696 | MVT::ValueType VT = LHSL.getValueType(); |
| 3697 | Lo = DAG.getNode(NodeOp, DAG.getNodeValueTypes(VT, VT), 2, Ops, 3); |
Chris Lattner | 5b359c6 | 2005-04-02 04:00:59 +0000 | [diff] [blame] | 3698 | Hi = Lo.getValue(1); |
| 3699 | } |
| 3700 | |
| 3701 | |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 3702 | /// ExpandShift - Try to find a clever way to expand this shift operation out to |
| 3703 | /// smaller elements. If we can't find a way that is more efficient than a |
| 3704 | /// libcall on this target, return false. Otherwise, return true with the |
| 3705 | /// low-parts expanded into Lo and Hi. |
| 3706 | bool SelectionDAGLegalize::ExpandShift(unsigned Opc, SDOperand Op,SDOperand Amt, |
| 3707 | SDOperand &Lo, SDOperand &Hi) { |
| 3708 | assert((Opc == ISD::SHL || Opc == ISD::SRA || Opc == ISD::SRL) && |
| 3709 | "This is not a shift!"); |
Nate Begeman | f1fe32e | 2005-04-06 21:13:14 +0000 | [diff] [blame] | 3710 | |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 3711 | MVT::ValueType NVT = TLI.getTypeToTransformTo(Op.getValueType()); |
Nate Begeman | f1fe32e | 2005-04-06 21:13:14 +0000 | [diff] [blame] | 3712 | SDOperand ShAmt = LegalizeOp(Amt); |
| 3713 | MVT::ValueType ShTy = ShAmt.getValueType(); |
| 3714 | unsigned VTBits = MVT::getSizeInBits(Op.getValueType()); |
| 3715 | unsigned NVTBits = MVT::getSizeInBits(NVT); |
| 3716 | |
| 3717 | // Handle the case when Amt is an immediate. Other cases are currently broken |
| 3718 | // and are disabled. |
| 3719 | if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(Amt.Val)) { |
| 3720 | unsigned Cst = CN->getValue(); |
| 3721 | // Expand the incoming operand to be shifted, so that we have its parts |
| 3722 | SDOperand InL, InH; |
| 3723 | ExpandOp(Op, InL, InH); |
| 3724 | switch(Opc) { |
| 3725 | case ISD::SHL: |
| 3726 | if (Cst > VTBits) { |
| 3727 | Lo = DAG.getConstant(0, NVT); |
| 3728 | Hi = DAG.getConstant(0, NVT); |
| 3729 | } else if (Cst > NVTBits) { |
| 3730 | Lo = DAG.getConstant(0, NVT); |
| 3731 | Hi = DAG.getNode(ISD::SHL, NVT, InL, DAG.getConstant(Cst-NVTBits,ShTy)); |
Chris Lattner | ee27f57 | 2005-04-11 20:08:52 +0000 | [diff] [blame] | 3732 | } else if (Cst == NVTBits) { |
| 3733 | Lo = DAG.getConstant(0, NVT); |
| 3734 | Hi = InL; |
Nate Begeman | f1fe32e | 2005-04-06 21:13:14 +0000 | [diff] [blame] | 3735 | } else { |
| 3736 | Lo = DAG.getNode(ISD::SHL, NVT, InL, DAG.getConstant(Cst, ShTy)); |
| 3737 | Hi = DAG.getNode(ISD::OR, NVT, |
| 3738 | DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(Cst, ShTy)), |
| 3739 | DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(NVTBits-Cst, ShTy))); |
| 3740 | } |
| 3741 | return true; |
| 3742 | case ISD::SRL: |
| 3743 | if (Cst > VTBits) { |
| 3744 | Lo = DAG.getConstant(0, NVT); |
| 3745 | Hi = DAG.getConstant(0, NVT); |
| 3746 | } else if (Cst > NVTBits) { |
| 3747 | Lo = DAG.getNode(ISD::SRL, NVT, InH, DAG.getConstant(Cst-NVTBits,ShTy)); |
| 3748 | Hi = DAG.getConstant(0, NVT); |
Chris Lattner | ee27f57 | 2005-04-11 20:08:52 +0000 | [diff] [blame] | 3749 | } else if (Cst == NVTBits) { |
| 3750 | Lo = InH; |
| 3751 | Hi = DAG.getConstant(0, NVT); |
Nate Begeman | f1fe32e | 2005-04-06 21:13:14 +0000 | [diff] [blame] | 3752 | } else { |
| 3753 | Lo = DAG.getNode(ISD::OR, NVT, |
| 3754 | DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(Cst, ShTy)), |
| 3755 | DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(NVTBits-Cst, ShTy))); |
| 3756 | Hi = DAG.getNode(ISD::SRL, NVT, InH, DAG.getConstant(Cst, ShTy)); |
| 3757 | } |
| 3758 | return true; |
| 3759 | case ISD::SRA: |
| 3760 | if (Cst > VTBits) { |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 3761 | Hi = Lo = DAG.getNode(ISD::SRA, NVT, InH, |
Nate Begeman | f1fe32e | 2005-04-06 21:13:14 +0000 | [diff] [blame] | 3762 | DAG.getConstant(NVTBits-1, ShTy)); |
| 3763 | } else if (Cst > NVTBits) { |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 3764 | Lo = DAG.getNode(ISD::SRA, NVT, InH, |
Nate Begeman | f1fe32e | 2005-04-06 21:13:14 +0000 | [diff] [blame] | 3765 | DAG.getConstant(Cst-NVTBits, ShTy)); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 3766 | Hi = DAG.getNode(ISD::SRA, NVT, InH, |
Nate Begeman | f1fe32e | 2005-04-06 21:13:14 +0000 | [diff] [blame] | 3767 | DAG.getConstant(NVTBits-1, ShTy)); |
Chris Lattner | ee27f57 | 2005-04-11 20:08:52 +0000 | [diff] [blame] | 3768 | } else if (Cst == NVTBits) { |
| 3769 | Lo = InH; |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 3770 | Hi = DAG.getNode(ISD::SRA, NVT, InH, |
Chris Lattner | ee27f57 | 2005-04-11 20:08:52 +0000 | [diff] [blame] | 3771 | DAG.getConstant(NVTBits-1, ShTy)); |
Nate Begeman | f1fe32e | 2005-04-06 21:13:14 +0000 | [diff] [blame] | 3772 | } else { |
| 3773 | Lo = DAG.getNode(ISD::OR, NVT, |
| 3774 | DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(Cst, ShTy)), |
| 3775 | DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(NVTBits-Cst, ShTy))); |
| 3776 | Hi = DAG.getNode(ISD::SRA, NVT, InH, DAG.getConstant(Cst, ShTy)); |
| 3777 | } |
| 3778 | return true; |
| 3779 | } |
| 3780 | } |
Chris Lattner | 0ea26ca | 2006-09-20 03:38:48 +0000 | [diff] [blame] | 3781 | |
| 3782 | // Okay, the shift amount isn't constant. However, if we can tell that it is |
| 3783 | // >= 32 or < 32, we can still simplify it, without knowing the actual value. |
| 3784 | uint64_t Mask = NVTBits, KnownZero, KnownOne; |
| 3785 | TLI.ComputeMaskedBits(Amt, Mask, KnownZero, KnownOne); |
| 3786 | |
| 3787 | // If we know that the high bit of the shift amount is one, then we can do |
| 3788 | // this as a couple of simple shifts. |
| 3789 | if (KnownOne & Mask) { |
| 3790 | // Mask out the high bit, which we know is set. |
| 3791 | Amt = DAG.getNode(ISD::AND, Amt.getValueType(), Amt, |
| 3792 | DAG.getConstant(NVTBits-1, Amt.getValueType())); |
| 3793 | |
| 3794 | // Expand the incoming operand to be shifted, so that we have its parts |
| 3795 | SDOperand InL, InH; |
| 3796 | ExpandOp(Op, InL, InH); |
| 3797 | switch(Opc) { |
| 3798 | case ISD::SHL: |
| 3799 | Lo = DAG.getConstant(0, NVT); // Low part is zero. |
| 3800 | Hi = DAG.getNode(ISD::SHL, NVT, InL, Amt); // High part from Lo part. |
| 3801 | return true; |
| 3802 | case ISD::SRL: |
| 3803 | Hi = DAG.getConstant(0, NVT); // Hi part is zero. |
| 3804 | Lo = DAG.getNode(ISD::SRL, NVT, InH, Amt); // Lo part from Hi part. |
| 3805 | return true; |
| 3806 | case ISD::SRA: |
| 3807 | Hi = DAG.getNode(ISD::SRA, NVT, InH, // Sign extend high part. |
| 3808 | DAG.getConstant(NVTBits-1, Amt.getValueType())); |
| 3809 | Lo = DAG.getNode(ISD::SRA, NVT, InH, Amt); // Lo part from Hi part. |
| 3810 | return true; |
| 3811 | } |
| 3812 | } |
| 3813 | |
| 3814 | // If we know that the high bit of the shift amount is zero, then we can do |
| 3815 | // this as a couple of simple shifts. |
| 3816 | if (KnownZero & Mask) { |
| 3817 | // Compute 32-amt. |
| 3818 | SDOperand Amt2 = DAG.getNode(ISD::SUB, Amt.getValueType(), |
| 3819 | DAG.getConstant(NVTBits, Amt.getValueType()), |
| 3820 | Amt); |
| 3821 | |
| 3822 | // Expand the incoming operand to be shifted, so that we have its parts |
| 3823 | SDOperand InL, InH; |
| 3824 | ExpandOp(Op, InL, InH); |
| 3825 | switch(Opc) { |
| 3826 | case ISD::SHL: |
| 3827 | Lo = DAG.getNode(ISD::SHL, NVT, InL, Amt); |
| 3828 | Hi = DAG.getNode(ISD::OR, NVT, |
| 3829 | DAG.getNode(ISD::SHL, NVT, InH, Amt), |
| 3830 | DAG.getNode(ISD::SRL, NVT, InL, Amt2)); |
| 3831 | return true; |
| 3832 | case ISD::SRL: |
| 3833 | Hi = DAG.getNode(ISD::SRL, NVT, InH, Amt); |
| 3834 | Lo = DAG.getNode(ISD::OR, NVT, |
| 3835 | DAG.getNode(ISD::SRL, NVT, InL, Amt), |
| 3836 | DAG.getNode(ISD::SHL, NVT, InH, Amt2)); |
| 3837 | return true; |
| 3838 | case ISD::SRA: |
| 3839 | Hi = DAG.getNode(ISD::SRA, NVT, InH, Amt); |
| 3840 | Lo = DAG.getNode(ISD::OR, NVT, |
| 3841 | DAG.getNode(ISD::SRL, NVT, InL, Amt), |
| 3842 | DAG.getNode(ISD::SHL, NVT, InH, Amt2)); |
| 3843 | return true; |
| 3844 | } |
| 3845 | } |
| 3846 | |
Nate Begeman | f1fe32e | 2005-04-06 21:13:14 +0000 | [diff] [blame] | 3847 | return false; |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 3848 | } |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 3849 | |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 3850 | |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 3851 | // ExpandLibCall - Expand a node into a call to a libcall. If the result value |
| 3852 | // does not fit into a register, return the lo part and set the hi part to the |
| 3853 | // by-reg argument. If it does fit into a single register, return the result |
| 3854 | // and leave the Hi part unset. |
| 3855 | SDOperand SelectionDAGLegalize::ExpandLibCall(const char *Name, SDNode *Node, |
| 3856 | SDOperand &Hi) { |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 3857 | assert(!IsLegalizingCall && "Cannot overlap legalization of calls!"); |
| 3858 | // The input chain to this libcall is the entry node of the function. |
| 3859 | // Legalizing the call will automatically add the previous call to the |
| 3860 | // dependence. |
| 3861 | SDOperand InChain = DAG.getEntryNode(); |
| 3862 | |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 3863 | TargetLowering::ArgListTy Args; |
| 3864 | for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) { |
| 3865 | MVT::ValueType ArgVT = Node->getOperand(i).getValueType(); |
| 3866 | const Type *ArgTy = MVT::getTypeForValueType(ArgVT); |
| 3867 | Args.push_back(std::make_pair(Node->getOperand(i), ArgTy)); |
| 3868 | } |
| 3869 | SDOperand Callee = DAG.getExternalSymbol(Name, TLI.getPointerTy()); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 3870 | |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 3871 | // Splice the libcall in wherever FindInputOutputChains tells us to. |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 3872 | const Type *RetTy = MVT::getTypeForValueType(Node->getValueType(0)); |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 3873 | std::pair<SDOperand,SDOperand> CallInfo = |
Chris Lattner | adf6a96 | 2005-05-13 18:50:42 +0000 | [diff] [blame] | 3874 | TLI.LowerCallTo(InChain, RetTy, false, CallingConv::C, false, |
| 3875 | Callee, Args, DAG); |
Chris Lattner | b9fa3bc | 2005-05-12 04:49:08 +0000 | [diff] [blame] | 3876 | |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 3877 | // Legalize the call sequence, starting with the chain. This will advance |
| 3878 | // the LastCALLSEQ_END to the legalized version of the CALLSEQ_END node that |
| 3879 | // was added by LowerCallTo (guaranteeing proper serialization of calls). |
| 3880 | LegalizeOp(CallInfo.second); |
Chris Lattner | 99c25b8 | 2005-09-02 20:26:58 +0000 | [diff] [blame] | 3881 | SDOperand Result; |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 3882 | switch (getTypeAction(CallInfo.first.getValueType())) { |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 3883 | default: assert(0 && "Unknown thing"); |
| 3884 | case Legal: |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 3885 | Result = CallInfo.first; |
Chris Lattner | 99c25b8 | 2005-09-02 20:26:58 +0000 | [diff] [blame] | 3886 | break; |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 3887 | case Expand: |
Chris Lattner | 99c25b8 | 2005-09-02 20:26:58 +0000 | [diff] [blame] | 3888 | ExpandOp(CallInfo.first, Result, Hi); |
Chris Lattner | 99c25b8 | 2005-09-02 20:26:58 +0000 | [diff] [blame] | 3889 | break; |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 3890 | } |
Chris Lattner | 99c25b8 | 2005-09-02 20:26:58 +0000 | [diff] [blame] | 3891 | return Result; |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 3892 | } |
| 3893 | |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 3894 | |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 3895 | /// ExpandIntToFP - Expand a [US]INT_TO_FP operation, assuming that the |
| 3896 | /// destination type is legal. |
| 3897 | SDOperand SelectionDAGLegalize:: |
| 3898 | ExpandIntToFP(bool isSigned, MVT::ValueType DestTy, SDOperand Source) { |
Chris Lattner | c9c60f6 | 2005-08-24 16:35:28 +0000 | [diff] [blame] | 3899 | assert(isTypeLegal(DestTy) && "Destination type is not legal!"); |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 3900 | assert(getTypeAction(Source.getValueType()) == Expand && |
| 3901 | "This is not an expansion!"); |
| 3902 | assert(Source.getValueType() == MVT::i64 && "Only handle expand from i64!"); |
| 3903 | |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 3904 | if (!isSigned) { |
Chris Lattner | e9c35e7 | 2005-04-13 05:09:42 +0000 | [diff] [blame] | 3905 | assert(Source.getValueType() == MVT::i64 && |
| 3906 | "This only works for 64-bit -> FP"); |
| 3907 | // The 64-bit value loaded will be incorrectly if the 'sign bit' of the |
| 3908 | // incoming integer is set. To handle this, we dynamically test to see if |
| 3909 | // it is set, and, if so, add a fudge factor. |
| 3910 | SDOperand Lo, Hi; |
| 3911 | ExpandOp(Source, Lo, Hi); |
| 3912 | |
Chris Lattner | 66de05b | 2005-05-13 04:45:13 +0000 | [diff] [blame] | 3913 | // If this is unsigned, and not supported, first perform the conversion to |
| 3914 | // signed, then adjust the result if the sign bit is set. |
| 3915 | SDOperand SignedConv = ExpandIntToFP(true, DestTy, |
| 3916 | DAG.getNode(ISD::BUILD_PAIR, Source.getValueType(), Lo, Hi)); |
| 3917 | |
Chris Lattner | 7cf7e3f | 2005-08-09 20:20:18 +0000 | [diff] [blame] | 3918 | SDOperand SignSet = DAG.getSetCC(TLI.getSetCCResultTy(), Hi, |
| 3919 | DAG.getConstant(0, Hi.getValueType()), |
| 3920 | ISD::SETLT); |
Chris Lattner | e9c35e7 | 2005-04-13 05:09:42 +0000 | [diff] [blame] | 3921 | SDOperand Zero = getIntPtrConstant(0), Four = getIntPtrConstant(4); |
| 3922 | SDOperand CstOffset = DAG.getNode(ISD::SELECT, Zero.getValueType(), |
| 3923 | SignSet, Four, Zero); |
Chris Lattner | 383203b | 2005-05-12 18:52:34 +0000 | [diff] [blame] | 3924 | uint64_t FF = 0x5f800000ULL; |
| 3925 | if (TLI.isLittleEndian()) FF <<= 32; |
| 3926 | static Constant *FudgeFactor = ConstantUInt::get(Type::ULongTy, FF); |
Chris Lattner | e9c35e7 | 2005-04-13 05:09:42 +0000 | [diff] [blame] | 3927 | |
Chris Lattner | 5839bf2 | 2005-08-26 17:15:30 +0000 | [diff] [blame] | 3928 | SDOperand CPIdx = DAG.getConstantPool(FudgeFactor, TLI.getPointerTy()); |
Chris Lattner | e9c35e7 | 2005-04-13 05:09:42 +0000 | [diff] [blame] | 3929 | CPIdx = DAG.getNode(ISD::ADD, TLI.getPointerTy(), CPIdx, CstOffset); |
| 3930 | SDOperand FudgeInReg; |
| 3931 | if (DestTy == MVT::f32) |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 3932 | FudgeInReg = DAG.getLoad(MVT::f32, DAG.getEntryNode(), CPIdx, NULL, 0); |
Chris Lattner | e9c35e7 | 2005-04-13 05:09:42 +0000 | [diff] [blame] | 3933 | else { |
| 3934 | assert(DestTy == MVT::f64 && "Unexpected conversion"); |
Chris Lattner | 5f056bf | 2005-07-10 01:55:33 +0000 | [diff] [blame] | 3935 | FudgeInReg = DAG.getExtLoad(ISD::EXTLOAD, MVT::f64, DAG.getEntryNode(), |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 3936 | CPIdx, NULL, 0, MVT::f32); |
Chris Lattner | e9c35e7 | 2005-04-13 05:09:42 +0000 | [diff] [blame] | 3937 | } |
Chris Lattner | 473a990 | 2005-09-29 06:44:39 +0000 | [diff] [blame] | 3938 | return DAG.getNode(ISD::FADD, DestTy, SignedConv, FudgeInReg); |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 3939 | } |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 3940 | |
Chris Lattner | a88a260 | 2005-05-14 05:33:54 +0000 | [diff] [blame] | 3941 | // Check to see if the target has a custom way to lower this. If so, use it. |
| 3942 | switch (TLI.getOperationAction(ISD::SINT_TO_FP, Source.getValueType())) { |
| 3943 | default: assert(0 && "This action not implemented for this operation!"); |
| 3944 | case TargetLowering::Legal: |
| 3945 | case TargetLowering::Expand: |
| 3946 | break; // This case is handled below. |
Chris Lattner | 07dffd6 | 2005-08-26 00:14:16 +0000 | [diff] [blame] | 3947 | case TargetLowering::Custom: { |
| 3948 | SDOperand NV = TLI.LowerOperation(DAG.getNode(ISD::SINT_TO_FP, DestTy, |
| 3949 | Source), DAG); |
| 3950 | if (NV.Val) |
| 3951 | return LegalizeOp(NV); |
| 3952 | break; // The target decided this was legal after all |
| 3953 | } |
Chris Lattner | a88a260 | 2005-05-14 05:33:54 +0000 | [diff] [blame] | 3954 | } |
| 3955 | |
Chris Lattner | 13689e2 | 2005-05-12 07:00:44 +0000 | [diff] [blame] | 3956 | // Expand the source, then glue it back together for the call. We must expand |
| 3957 | // the source in case it is shared (this pass of legalize must traverse it). |
| 3958 | SDOperand SrcLo, SrcHi; |
| 3959 | ExpandOp(Source, SrcLo, SrcHi); |
| 3960 | Source = DAG.getNode(ISD::BUILD_PAIR, Source.getValueType(), SrcLo, SrcHi); |
| 3961 | |
Chris Lattner | 0d67f0c | 2005-05-11 19:02:11 +0000 | [diff] [blame] | 3962 | const char *FnName = 0; |
| 3963 | if (DestTy == MVT::f32) |
| 3964 | FnName = "__floatdisf"; |
| 3965 | else { |
| 3966 | assert(DestTy == MVT::f64 && "Unknown fp value type!"); |
| 3967 | FnName = "__floatdidf"; |
| 3968 | } |
Chris Lattner | 6831a81 | 2006-02-13 09:18:02 +0000 | [diff] [blame] | 3969 | |
| 3970 | Source = DAG.getNode(ISD::SINT_TO_FP, DestTy, Source); |
| 3971 | SDOperand UnusedHiPart; |
Chris Lattner | 2512569 | 2006-02-17 04:32:33 +0000 | [diff] [blame] | 3972 | return ExpandLibCall(FnName, Source.Val, UnusedHiPart); |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 3973 | } |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 3974 | |
Chris Lattner | 22cde6a | 2006-01-28 08:25:58 +0000 | [diff] [blame] | 3975 | /// ExpandLegalINT_TO_FP - This function is responsible for legalizing a |
| 3976 | /// INT_TO_FP operation of the specified operand when the target requests that |
| 3977 | /// we expand it. At this point, we know that the result and operand types are |
| 3978 | /// legal for the target. |
| 3979 | SDOperand SelectionDAGLegalize::ExpandLegalINT_TO_FP(bool isSigned, |
| 3980 | SDOperand Op0, |
| 3981 | MVT::ValueType DestVT) { |
| 3982 | if (Op0.getValueType() == MVT::i32) { |
| 3983 | // simple 32-bit [signed|unsigned] integer to float/double expansion |
| 3984 | |
| 3985 | // get the stack frame index of a 8 byte buffer |
| 3986 | MachineFunction &MF = DAG.getMachineFunction(); |
| 3987 | int SSFI = MF.getFrameInfo()->CreateStackObject(8, 8); |
| 3988 | // get address of 8 byte buffer |
| 3989 | SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy()); |
| 3990 | // word offset constant for Hi/Lo address computation |
| 3991 | SDOperand WordOff = DAG.getConstant(sizeof(int), TLI.getPointerTy()); |
| 3992 | // set up Hi and Lo (into buffer) address based on endian |
Chris Lattner | 408c428 | 2006-03-23 05:29:04 +0000 | [diff] [blame] | 3993 | SDOperand Hi = StackSlot; |
| 3994 | SDOperand Lo = DAG.getNode(ISD::ADD, TLI.getPointerTy(), StackSlot,WordOff); |
| 3995 | if (TLI.isLittleEndian()) |
| 3996 | std::swap(Hi, Lo); |
| 3997 | |
Chris Lattner | 22cde6a | 2006-01-28 08:25:58 +0000 | [diff] [blame] | 3998 | // if signed map to unsigned space |
| 3999 | SDOperand Op0Mapped; |
| 4000 | if (isSigned) { |
| 4001 | // constant used to invert sign bit (signed to unsigned mapping) |
| 4002 | SDOperand SignBit = DAG.getConstant(0x80000000u, MVT::i32); |
| 4003 | Op0Mapped = DAG.getNode(ISD::XOR, MVT::i32, Op0, SignBit); |
| 4004 | } else { |
| 4005 | Op0Mapped = Op0; |
| 4006 | } |
| 4007 | // store the lo of the constructed double - based on integer input |
Evan Cheng | 786225a | 2006-10-05 23:01:46 +0000 | [diff] [blame] | 4008 | SDOperand Store1 = DAG.getStore(DAG.getEntryNode(), |
| 4009 | Op0Mapped, Lo, DAG.getSrcValue(NULL)); |
Chris Lattner | 22cde6a | 2006-01-28 08:25:58 +0000 | [diff] [blame] | 4010 | // initial hi portion of constructed double |
| 4011 | SDOperand InitialHi = DAG.getConstant(0x43300000u, MVT::i32); |
| 4012 | // store the hi of the constructed double - biased exponent |
Evan Cheng | 786225a | 2006-10-05 23:01:46 +0000 | [diff] [blame] | 4013 | SDOperand Store2=DAG.getStore(Store1, InitialHi, Hi, DAG.getSrcValue(NULL)); |
Chris Lattner | 22cde6a | 2006-01-28 08:25:58 +0000 | [diff] [blame] | 4014 | // load the constructed double |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 4015 | SDOperand Load = DAG.getLoad(MVT::f64, Store2, StackSlot, NULL, 0); |
Chris Lattner | 22cde6a | 2006-01-28 08:25:58 +0000 | [diff] [blame] | 4016 | // FP constant to bias correct the final result |
| 4017 | SDOperand Bias = DAG.getConstantFP(isSigned ? |
| 4018 | BitsToDouble(0x4330000080000000ULL) |
| 4019 | : BitsToDouble(0x4330000000000000ULL), |
| 4020 | MVT::f64); |
| 4021 | // subtract the bias |
| 4022 | SDOperand Sub = DAG.getNode(ISD::FSUB, MVT::f64, Load, Bias); |
| 4023 | // final result |
| 4024 | SDOperand Result; |
| 4025 | // handle final rounding |
| 4026 | if (DestVT == MVT::f64) { |
| 4027 | // do nothing |
| 4028 | Result = Sub; |
| 4029 | } else { |
| 4030 | // if f32 then cast to f32 |
| 4031 | Result = DAG.getNode(ISD::FP_ROUND, MVT::f32, Sub); |
| 4032 | } |
| 4033 | return Result; |
| 4034 | } |
| 4035 | assert(!isSigned && "Legalize cannot Expand SINT_TO_FP for i64 yet"); |
| 4036 | SDOperand Tmp1 = DAG.getNode(ISD::SINT_TO_FP, DestVT, Op0); |
| 4037 | |
| 4038 | SDOperand SignSet = DAG.getSetCC(TLI.getSetCCResultTy(), Op0, |
| 4039 | DAG.getConstant(0, Op0.getValueType()), |
| 4040 | ISD::SETLT); |
| 4041 | SDOperand Zero = getIntPtrConstant(0), Four = getIntPtrConstant(4); |
| 4042 | SDOperand CstOffset = DAG.getNode(ISD::SELECT, Zero.getValueType(), |
| 4043 | SignSet, Four, Zero); |
| 4044 | |
| 4045 | // If the sign bit of the integer is set, the large number will be treated |
| 4046 | // as a negative number. To counteract this, the dynamic code adds an |
| 4047 | // offset depending on the data type. |
| 4048 | uint64_t FF; |
| 4049 | switch (Op0.getValueType()) { |
| 4050 | default: assert(0 && "Unsupported integer type!"); |
| 4051 | case MVT::i8 : FF = 0x43800000ULL; break; // 2^8 (as a float) |
| 4052 | case MVT::i16: FF = 0x47800000ULL; break; // 2^16 (as a float) |
| 4053 | case MVT::i32: FF = 0x4F800000ULL; break; // 2^32 (as a float) |
| 4054 | case MVT::i64: FF = 0x5F800000ULL; break; // 2^64 (as a float) |
| 4055 | } |
| 4056 | if (TLI.isLittleEndian()) FF <<= 32; |
| 4057 | static Constant *FudgeFactor = ConstantUInt::get(Type::ULongTy, FF); |
| 4058 | |
| 4059 | SDOperand CPIdx = DAG.getConstantPool(FudgeFactor, TLI.getPointerTy()); |
| 4060 | CPIdx = DAG.getNode(ISD::ADD, TLI.getPointerTy(), CPIdx, CstOffset); |
| 4061 | SDOperand FudgeInReg; |
| 4062 | if (DestVT == MVT::f32) |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 4063 | FudgeInReg = DAG.getLoad(MVT::f32, DAG.getEntryNode(), CPIdx, NULL, 0); |
Chris Lattner | 22cde6a | 2006-01-28 08:25:58 +0000 | [diff] [blame] | 4064 | else { |
| 4065 | assert(DestVT == MVT::f64 && "Unexpected conversion"); |
| 4066 | FudgeInReg = LegalizeOp(DAG.getExtLoad(ISD::EXTLOAD, MVT::f64, |
| 4067 | DAG.getEntryNode(), CPIdx, |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 4068 | NULL, 0, MVT::f32)); |
Chris Lattner | 22cde6a | 2006-01-28 08:25:58 +0000 | [diff] [blame] | 4069 | } |
| 4070 | |
| 4071 | return DAG.getNode(ISD::FADD, DestVT, Tmp1, FudgeInReg); |
| 4072 | } |
| 4073 | |
| 4074 | /// PromoteLegalINT_TO_FP - This function is responsible for legalizing a |
| 4075 | /// *INT_TO_FP operation of the specified operand when the target requests that |
| 4076 | /// we promote it. At this point, we know that the result and operand types are |
| 4077 | /// legal for the target, and that there is a legal UINT_TO_FP or SINT_TO_FP |
| 4078 | /// operation that takes a larger input. |
| 4079 | SDOperand SelectionDAGLegalize::PromoteLegalINT_TO_FP(SDOperand LegalOp, |
| 4080 | MVT::ValueType DestVT, |
| 4081 | bool isSigned) { |
| 4082 | // First step, figure out the appropriate *INT_TO_FP operation to use. |
| 4083 | MVT::ValueType NewInTy = LegalOp.getValueType(); |
| 4084 | |
| 4085 | unsigned OpToUse = 0; |
| 4086 | |
| 4087 | // Scan for the appropriate larger type to use. |
| 4088 | while (1) { |
| 4089 | NewInTy = (MVT::ValueType)(NewInTy+1); |
| 4090 | assert(MVT::isInteger(NewInTy) && "Ran out of possibilities!"); |
| 4091 | |
| 4092 | // If the target supports SINT_TO_FP of this type, use it. |
| 4093 | switch (TLI.getOperationAction(ISD::SINT_TO_FP, NewInTy)) { |
| 4094 | default: break; |
| 4095 | case TargetLowering::Legal: |
| 4096 | if (!TLI.isTypeLegal(NewInTy)) |
| 4097 | break; // Can't use this datatype. |
| 4098 | // FALL THROUGH. |
| 4099 | case TargetLowering::Custom: |
| 4100 | OpToUse = ISD::SINT_TO_FP; |
| 4101 | break; |
| 4102 | } |
| 4103 | if (OpToUse) break; |
| 4104 | if (isSigned) continue; |
| 4105 | |
| 4106 | // If the target supports UINT_TO_FP of this type, use it. |
| 4107 | switch (TLI.getOperationAction(ISD::UINT_TO_FP, NewInTy)) { |
| 4108 | default: break; |
| 4109 | case TargetLowering::Legal: |
| 4110 | if (!TLI.isTypeLegal(NewInTy)) |
| 4111 | break; // Can't use this datatype. |
| 4112 | // FALL THROUGH. |
| 4113 | case TargetLowering::Custom: |
| 4114 | OpToUse = ISD::UINT_TO_FP; |
| 4115 | break; |
| 4116 | } |
| 4117 | if (OpToUse) break; |
| 4118 | |
| 4119 | // Otherwise, try a larger type. |
| 4120 | } |
| 4121 | |
| 4122 | // Okay, we found the operation and type to use. Zero extend our input to the |
| 4123 | // desired type then run the operation on it. |
| 4124 | return DAG.getNode(OpToUse, DestVT, |
| 4125 | DAG.getNode(isSigned ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND, |
| 4126 | NewInTy, LegalOp)); |
| 4127 | } |
| 4128 | |
| 4129 | /// PromoteLegalFP_TO_INT - This function is responsible for legalizing a |
| 4130 | /// FP_TO_*INT operation of the specified operand when the target requests that |
| 4131 | /// we promote it. At this point, we know that the result and operand types are |
| 4132 | /// legal for the target, and that there is a legal FP_TO_UINT or FP_TO_SINT |
| 4133 | /// operation that returns a larger result. |
| 4134 | SDOperand SelectionDAGLegalize::PromoteLegalFP_TO_INT(SDOperand LegalOp, |
| 4135 | MVT::ValueType DestVT, |
| 4136 | bool isSigned) { |
| 4137 | // First step, figure out the appropriate FP_TO*INT operation to use. |
| 4138 | MVT::ValueType NewOutTy = DestVT; |
| 4139 | |
| 4140 | unsigned OpToUse = 0; |
| 4141 | |
| 4142 | // Scan for the appropriate larger type to use. |
| 4143 | while (1) { |
| 4144 | NewOutTy = (MVT::ValueType)(NewOutTy+1); |
| 4145 | assert(MVT::isInteger(NewOutTy) && "Ran out of possibilities!"); |
| 4146 | |
| 4147 | // If the target supports FP_TO_SINT returning this type, use it. |
| 4148 | switch (TLI.getOperationAction(ISD::FP_TO_SINT, NewOutTy)) { |
| 4149 | default: break; |
| 4150 | case TargetLowering::Legal: |
| 4151 | if (!TLI.isTypeLegal(NewOutTy)) |
| 4152 | break; // Can't use this datatype. |
| 4153 | // FALL THROUGH. |
| 4154 | case TargetLowering::Custom: |
| 4155 | OpToUse = ISD::FP_TO_SINT; |
| 4156 | break; |
| 4157 | } |
| 4158 | if (OpToUse) break; |
| 4159 | |
| 4160 | // If the target supports FP_TO_UINT of this type, use it. |
| 4161 | switch (TLI.getOperationAction(ISD::FP_TO_UINT, NewOutTy)) { |
| 4162 | default: break; |
| 4163 | case TargetLowering::Legal: |
| 4164 | if (!TLI.isTypeLegal(NewOutTy)) |
| 4165 | break; // Can't use this datatype. |
| 4166 | // FALL THROUGH. |
| 4167 | case TargetLowering::Custom: |
| 4168 | OpToUse = ISD::FP_TO_UINT; |
| 4169 | break; |
| 4170 | } |
| 4171 | if (OpToUse) break; |
| 4172 | |
| 4173 | // Otherwise, try a larger type. |
| 4174 | } |
| 4175 | |
| 4176 | // Okay, we found the operation and type to use. Truncate the result of the |
| 4177 | // extended FP_TO_*INT operation to the desired size. |
| 4178 | return DAG.getNode(ISD::TRUNCATE, DestVT, |
| 4179 | DAG.getNode(OpToUse, NewOutTy, LegalOp)); |
| 4180 | } |
| 4181 | |
| 4182 | /// ExpandBSWAP - Open code the operations for BSWAP of the specified operation. |
| 4183 | /// |
| 4184 | SDOperand SelectionDAGLegalize::ExpandBSWAP(SDOperand Op) { |
| 4185 | MVT::ValueType VT = Op.getValueType(); |
| 4186 | MVT::ValueType SHVT = TLI.getShiftAmountTy(); |
| 4187 | SDOperand Tmp1, Tmp2, Tmp3, Tmp4, Tmp5, Tmp6, Tmp7, Tmp8; |
| 4188 | switch (VT) { |
| 4189 | default: assert(0 && "Unhandled Expand type in BSWAP!"); abort(); |
| 4190 | case MVT::i16: |
| 4191 | Tmp2 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(8, SHVT)); |
| 4192 | Tmp1 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(8, SHVT)); |
| 4193 | return DAG.getNode(ISD::OR, VT, Tmp1, Tmp2); |
| 4194 | case MVT::i32: |
| 4195 | Tmp4 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(24, SHVT)); |
| 4196 | Tmp3 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(8, SHVT)); |
| 4197 | Tmp2 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(8, SHVT)); |
| 4198 | Tmp1 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(24, SHVT)); |
| 4199 | Tmp3 = DAG.getNode(ISD::AND, VT, Tmp3, DAG.getConstant(0xFF0000, VT)); |
| 4200 | Tmp2 = DAG.getNode(ISD::AND, VT, Tmp2, DAG.getConstant(0xFF00, VT)); |
| 4201 | Tmp4 = DAG.getNode(ISD::OR, VT, Tmp4, Tmp3); |
| 4202 | Tmp2 = DAG.getNode(ISD::OR, VT, Tmp2, Tmp1); |
| 4203 | return DAG.getNode(ISD::OR, VT, Tmp4, Tmp2); |
| 4204 | case MVT::i64: |
| 4205 | Tmp8 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(56, SHVT)); |
| 4206 | Tmp7 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(40, SHVT)); |
| 4207 | Tmp6 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(24, SHVT)); |
| 4208 | Tmp5 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(8, SHVT)); |
| 4209 | Tmp4 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(8, SHVT)); |
| 4210 | Tmp3 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(24, SHVT)); |
| 4211 | Tmp2 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(40, SHVT)); |
| 4212 | Tmp1 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(56, SHVT)); |
| 4213 | Tmp7 = DAG.getNode(ISD::AND, VT, Tmp7, DAG.getConstant(255ULL<<48, VT)); |
| 4214 | Tmp6 = DAG.getNode(ISD::AND, VT, Tmp6, DAG.getConstant(255ULL<<40, VT)); |
| 4215 | Tmp5 = DAG.getNode(ISD::AND, VT, Tmp5, DAG.getConstant(255ULL<<32, VT)); |
| 4216 | Tmp4 = DAG.getNode(ISD::AND, VT, Tmp4, DAG.getConstant(255ULL<<24, VT)); |
| 4217 | Tmp3 = DAG.getNode(ISD::AND, VT, Tmp3, DAG.getConstant(255ULL<<16, VT)); |
| 4218 | Tmp2 = DAG.getNode(ISD::AND, VT, Tmp2, DAG.getConstant(255ULL<<8 , VT)); |
| 4219 | Tmp8 = DAG.getNode(ISD::OR, VT, Tmp8, Tmp7); |
| 4220 | Tmp6 = DAG.getNode(ISD::OR, VT, Tmp6, Tmp5); |
| 4221 | Tmp4 = DAG.getNode(ISD::OR, VT, Tmp4, Tmp3); |
| 4222 | Tmp2 = DAG.getNode(ISD::OR, VT, Tmp2, Tmp1); |
| 4223 | Tmp8 = DAG.getNode(ISD::OR, VT, Tmp8, Tmp6); |
| 4224 | Tmp4 = DAG.getNode(ISD::OR, VT, Tmp4, Tmp2); |
| 4225 | return DAG.getNode(ISD::OR, VT, Tmp8, Tmp4); |
| 4226 | } |
| 4227 | } |
| 4228 | |
| 4229 | /// ExpandBitCount - Expand the specified bitcount instruction into operations. |
| 4230 | /// |
| 4231 | SDOperand SelectionDAGLegalize::ExpandBitCount(unsigned Opc, SDOperand Op) { |
| 4232 | switch (Opc) { |
| 4233 | default: assert(0 && "Cannot expand this yet!"); |
| 4234 | case ISD::CTPOP: { |
| 4235 | static const uint64_t mask[6] = { |
| 4236 | 0x5555555555555555ULL, 0x3333333333333333ULL, |
| 4237 | 0x0F0F0F0F0F0F0F0FULL, 0x00FF00FF00FF00FFULL, |
| 4238 | 0x0000FFFF0000FFFFULL, 0x00000000FFFFFFFFULL |
| 4239 | }; |
| 4240 | MVT::ValueType VT = Op.getValueType(); |
| 4241 | MVT::ValueType ShVT = TLI.getShiftAmountTy(); |
| 4242 | unsigned len = getSizeInBits(VT); |
| 4243 | for (unsigned i = 0; (1U << i) <= (len / 2); ++i) { |
| 4244 | //x = (x & mask[i][len/8]) + (x >> (1 << i) & mask[i][len/8]) |
| 4245 | SDOperand Tmp2 = DAG.getConstant(mask[i], VT); |
| 4246 | SDOperand Tmp3 = DAG.getConstant(1ULL << i, ShVT); |
| 4247 | Op = DAG.getNode(ISD::ADD, VT, DAG.getNode(ISD::AND, VT, Op, Tmp2), |
| 4248 | DAG.getNode(ISD::AND, VT, |
| 4249 | DAG.getNode(ISD::SRL, VT, Op, Tmp3),Tmp2)); |
| 4250 | } |
| 4251 | return Op; |
| 4252 | } |
| 4253 | case ISD::CTLZ: { |
| 4254 | // for now, we do this: |
| 4255 | // x = x | (x >> 1); |
| 4256 | // x = x | (x >> 2); |
| 4257 | // ... |
| 4258 | // x = x | (x >>16); |
| 4259 | // x = x | (x >>32); // for 64-bit input |
| 4260 | // return popcount(~x); |
| 4261 | // |
| 4262 | // but see also: http://www.hackersdelight.org/HDcode/nlz.cc |
| 4263 | MVT::ValueType VT = Op.getValueType(); |
| 4264 | MVT::ValueType ShVT = TLI.getShiftAmountTy(); |
| 4265 | unsigned len = getSizeInBits(VT); |
| 4266 | for (unsigned i = 0; (1U << i) <= (len / 2); ++i) { |
| 4267 | SDOperand Tmp3 = DAG.getConstant(1ULL << i, ShVT); |
| 4268 | Op = DAG.getNode(ISD::OR, VT, Op, DAG.getNode(ISD::SRL, VT, Op, Tmp3)); |
| 4269 | } |
| 4270 | Op = DAG.getNode(ISD::XOR, VT, Op, DAG.getConstant(~0ULL, VT)); |
| 4271 | return DAG.getNode(ISD::CTPOP, VT, Op); |
| 4272 | } |
| 4273 | case ISD::CTTZ: { |
| 4274 | // for now, we use: { return popcount(~x & (x - 1)); } |
| 4275 | // unless the target has ctlz but not ctpop, in which case we use: |
| 4276 | // { return 32 - nlz(~x & (x-1)); } |
| 4277 | // see also http://www.hackersdelight.org/HDcode/ntz.cc |
| 4278 | MVT::ValueType VT = Op.getValueType(); |
| 4279 | SDOperand Tmp2 = DAG.getConstant(~0ULL, VT); |
| 4280 | SDOperand Tmp3 = DAG.getNode(ISD::AND, VT, |
| 4281 | DAG.getNode(ISD::XOR, VT, Op, Tmp2), |
| 4282 | DAG.getNode(ISD::SUB, VT, Op, DAG.getConstant(1, VT))); |
| 4283 | // If ISD::CTLZ is legal and CTPOP isn't, then do that instead. |
| 4284 | if (!TLI.isOperationLegal(ISD::CTPOP, VT) && |
| 4285 | TLI.isOperationLegal(ISD::CTLZ, VT)) |
| 4286 | return DAG.getNode(ISD::SUB, VT, |
| 4287 | DAG.getConstant(getSizeInBits(VT), VT), |
| 4288 | DAG.getNode(ISD::CTLZ, VT, Tmp3)); |
| 4289 | return DAG.getNode(ISD::CTPOP, VT, Tmp3); |
| 4290 | } |
| 4291 | } |
| 4292 | } |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 4293 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4294 | /// ExpandOp - Expand the specified SDOperand into its two component pieces |
| 4295 | /// Lo&Hi. Note that the Op MUST be an expanded type. As a result of this, the |
| 4296 | /// LegalizeNodes map is filled in for any results that are not expanded, the |
| 4297 | /// ExpandedNodes map is filled in for any results that are expanded, and the |
| 4298 | /// Lo/Hi values are returned. |
| 4299 | void SelectionDAGLegalize::ExpandOp(SDOperand Op, SDOperand &Lo, SDOperand &Hi){ |
| 4300 | MVT::ValueType VT = Op.getValueType(); |
Chris Lattner | 71c42a0 | 2005-01-16 01:11:45 +0000 | [diff] [blame] | 4301 | MVT::ValueType NVT = TLI.getTypeToTransformTo(VT); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4302 | SDNode *Node = Op.Val; |
| 4303 | assert(getTypeAction(VT) == Expand && "Not an expanded type!"); |
Nate Begeman | ab48be3 | 2005-11-22 18:16:00 +0000 | [diff] [blame] | 4304 | assert((MVT::isInteger(VT) || VT == MVT::Vector) && |
| 4305 | "Cannot expand FP values!"); |
| 4306 | assert(((MVT::isInteger(NVT) && NVT < VT) || VT == MVT::Vector) && |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4307 | "Cannot expand to FP value or to larger int value!"); |
| 4308 | |
Chris Lattner | 6fdcb25 | 2005-09-02 20:32:45 +0000 | [diff] [blame] | 4309 | // See if we already expanded it. |
| 4310 | std::map<SDOperand, std::pair<SDOperand, SDOperand> >::iterator I |
| 4311 | = ExpandedNodes.find(Op); |
| 4312 | if (I != ExpandedNodes.end()) { |
| 4313 | Lo = I->second.first; |
| 4314 | Hi = I->second.second; |
| 4315 | return; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4316 | } |
| 4317 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4318 | switch (Node->getOpcode()) { |
Chris Lattner | 348e93c | 2006-01-21 04:27:00 +0000 | [diff] [blame] | 4319 | case ISD::CopyFromReg: |
| 4320 | assert(0 && "CopyFromReg must be legal!"); |
| 4321 | default: |
Jim Laskey | e37fe9b | 2006-07-11 17:58:07 +0000 | [diff] [blame] | 4322 | #ifndef NDEBUG |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4323 | std::cerr << "NODE: "; Node->dump(); std::cerr << "\n"; |
Jim Laskey | e37fe9b | 2006-07-11 17:58:07 +0000 | [diff] [blame] | 4324 | #endif |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4325 | assert(0 && "Do not know how to expand this operator!"); |
| 4326 | abort(); |
Nate Begeman | fc1b1da | 2005-04-01 22:34:39 +0000 | [diff] [blame] | 4327 | case ISD::UNDEF: |
| 4328 | Lo = DAG.getNode(ISD::UNDEF, NVT); |
| 4329 | Hi = DAG.getNode(ISD::UNDEF, NVT); |
| 4330 | break; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4331 | case ISD::Constant: { |
| 4332 | uint64_t Cst = cast<ConstantSDNode>(Node)->getValue(); |
| 4333 | Lo = DAG.getConstant(Cst, NVT); |
| 4334 | Hi = DAG.getConstant(Cst >> MVT::getSizeInBits(NVT), NVT); |
| 4335 | break; |
| 4336 | } |
Chris Lattner | d4e50bb | 2005-03-28 22:03:13 +0000 | [diff] [blame] | 4337 | case ISD::BUILD_PAIR: |
Chris Lattner | 8137c9e | 2006-01-28 05:07:51 +0000 | [diff] [blame] | 4338 | // Return the operands. |
| 4339 | Lo = Node->getOperand(0); |
| 4340 | Hi = Node->getOperand(1); |
Chris Lattner | d4e50bb | 2005-03-28 22:03:13 +0000 | [diff] [blame] | 4341 | break; |
Chris Lattner | 58f7963 | 2005-12-12 22:27:43 +0000 | [diff] [blame] | 4342 | |
| 4343 | case ISD::SIGN_EXTEND_INREG: |
| 4344 | ExpandOp(Node->getOperand(0), Lo, Hi); |
Chris Lattner | 4bdd275 | 2006-10-06 17:34:12 +0000 | [diff] [blame] | 4345 | // sext_inreg the low part if needed. |
| 4346 | Lo = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Lo, Node->getOperand(1)); |
| 4347 | |
| 4348 | // The high part gets the sign extension from the lo-part. This handles |
| 4349 | // things like sextinreg V:i64 from i8. |
Chris Lattner | 58f7963 | 2005-12-12 22:27:43 +0000 | [diff] [blame] | 4350 | Hi = DAG.getNode(ISD::SRA, NVT, Lo, |
| 4351 | DAG.getConstant(MVT::getSizeInBits(NVT)-1, |
| 4352 | TLI.getShiftAmountTy())); |
Chris Lattner | 58f7963 | 2005-12-12 22:27:43 +0000 | [diff] [blame] | 4353 | break; |
Chris Lattner | d4e50bb | 2005-03-28 22:03:13 +0000 | [diff] [blame] | 4354 | |
Nate Begeman | d88fc03 | 2006-01-14 03:14:10 +0000 | [diff] [blame] | 4355 | case ISD::BSWAP: { |
| 4356 | ExpandOp(Node->getOperand(0), Lo, Hi); |
| 4357 | SDOperand TempLo = DAG.getNode(ISD::BSWAP, NVT, Hi); |
| 4358 | Hi = DAG.getNode(ISD::BSWAP, NVT, Lo); |
| 4359 | Lo = TempLo; |
| 4360 | break; |
| 4361 | } |
| 4362 | |
Chris Lattner | edb1add | 2005-05-11 04:51:16 +0000 | [diff] [blame] | 4363 | case ISD::CTPOP: |
| 4364 | ExpandOp(Node->getOperand(0), Lo, Hi); |
Chris Lattner | 9b583b4 | 2005-05-11 05:09:47 +0000 | [diff] [blame] | 4365 | Lo = DAG.getNode(ISD::ADD, NVT, // ctpop(HL) -> ctpop(H)+ctpop(L) |
| 4366 | DAG.getNode(ISD::CTPOP, NVT, Lo), |
| 4367 | DAG.getNode(ISD::CTPOP, NVT, Hi)); |
Chris Lattner | edb1add | 2005-05-11 04:51:16 +0000 | [diff] [blame] | 4368 | Hi = DAG.getConstant(0, NVT); |
| 4369 | break; |
| 4370 | |
Chris Lattner | 39a8f33 | 2005-05-12 19:05:01 +0000 | [diff] [blame] | 4371 | case ISD::CTLZ: { |
| 4372 | // ctlz (HL) -> ctlz(H) != 32 ? ctlz(H) : (ctlz(L)+32) |
Chris Lattner | 3becf20 | 2005-05-12 19:27:51 +0000 | [diff] [blame] | 4373 | ExpandOp(Node->getOperand(0), Lo, Hi); |
Chris Lattner | 39a8f33 | 2005-05-12 19:05:01 +0000 | [diff] [blame] | 4374 | SDOperand BitsC = DAG.getConstant(MVT::getSizeInBits(NVT), NVT); |
| 4375 | SDOperand HLZ = DAG.getNode(ISD::CTLZ, NVT, Hi); |
Chris Lattner | 7cf7e3f | 2005-08-09 20:20:18 +0000 | [diff] [blame] | 4376 | SDOperand TopNotZero = DAG.getSetCC(TLI.getSetCCResultTy(), HLZ, BitsC, |
| 4377 | ISD::SETNE); |
Chris Lattner | 39a8f33 | 2005-05-12 19:05:01 +0000 | [diff] [blame] | 4378 | SDOperand LowPart = DAG.getNode(ISD::CTLZ, NVT, Lo); |
| 4379 | LowPart = DAG.getNode(ISD::ADD, NVT, LowPart, BitsC); |
| 4380 | |
| 4381 | Lo = DAG.getNode(ISD::SELECT, NVT, TopNotZero, HLZ, LowPart); |
| 4382 | Hi = DAG.getConstant(0, NVT); |
| 4383 | break; |
| 4384 | } |
| 4385 | |
| 4386 | case ISD::CTTZ: { |
| 4387 | // cttz (HL) -> cttz(L) != 32 ? cttz(L) : (cttz(H)+32) |
Chris Lattner | 3becf20 | 2005-05-12 19:27:51 +0000 | [diff] [blame] | 4388 | ExpandOp(Node->getOperand(0), Lo, Hi); |
Chris Lattner | 39a8f33 | 2005-05-12 19:05:01 +0000 | [diff] [blame] | 4389 | SDOperand BitsC = DAG.getConstant(MVT::getSizeInBits(NVT), NVT); |
| 4390 | SDOperand LTZ = DAG.getNode(ISD::CTTZ, NVT, Lo); |
Chris Lattner | 7cf7e3f | 2005-08-09 20:20:18 +0000 | [diff] [blame] | 4391 | SDOperand BotNotZero = DAG.getSetCC(TLI.getSetCCResultTy(), LTZ, BitsC, |
| 4392 | ISD::SETNE); |
Chris Lattner | 39a8f33 | 2005-05-12 19:05:01 +0000 | [diff] [blame] | 4393 | SDOperand HiPart = DAG.getNode(ISD::CTTZ, NVT, Hi); |
| 4394 | HiPart = DAG.getNode(ISD::ADD, NVT, HiPart, BitsC); |
| 4395 | |
| 4396 | Lo = DAG.getNode(ISD::SELECT, NVT, BotNotZero, LTZ, HiPart); |
| 4397 | Hi = DAG.getConstant(0, NVT); |
| 4398 | break; |
| 4399 | } |
Chris Lattner | edb1add | 2005-05-11 04:51:16 +0000 | [diff] [blame] | 4400 | |
Nate Begeman | acc398c | 2006-01-25 18:21:52 +0000 | [diff] [blame] | 4401 | case ISD::VAARG: { |
Chris Lattner | 8137c9e | 2006-01-28 05:07:51 +0000 | [diff] [blame] | 4402 | SDOperand Ch = Node->getOperand(0); // Legalize the chain. |
| 4403 | SDOperand Ptr = Node->getOperand(1); // Legalize the pointer. |
Nate Begeman | acc398c | 2006-01-25 18:21:52 +0000 | [diff] [blame] | 4404 | Lo = DAG.getVAArg(NVT, Ch, Ptr, Node->getOperand(2)); |
| 4405 | Hi = DAG.getVAArg(NVT, Lo.getValue(1), Ptr, Node->getOperand(2)); |
| 4406 | |
| 4407 | // Remember that we legalized the chain. |
Chris Lattner | 8137c9e | 2006-01-28 05:07:51 +0000 | [diff] [blame] | 4408 | Hi = LegalizeOp(Hi); |
Nate Begeman | acc398c | 2006-01-25 18:21:52 +0000 | [diff] [blame] | 4409 | AddLegalizedOperand(Op.getValue(1), Hi.getValue(1)); |
| 4410 | if (!TLI.isLittleEndian()) |
| 4411 | std::swap(Lo, Hi); |
| 4412 | break; |
| 4413 | } |
| 4414 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4415 | case ISD::LOAD: { |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 4416 | LoadSDNode *LD = cast<LoadSDNode>(Node); |
| 4417 | SDOperand Ch = LD->getChain(); // Legalize the chain. |
| 4418 | SDOperand Ptr = LD->getBasePtr(); // Legalize the pointer. |
| 4419 | ISD::LoadExtType ExtType = LD->getExtensionType(); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4420 | |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 4421 | if (ExtType == ISD::NON_EXTLOAD) { |
| 4422 | Lo = DAG.getLoad(NVT, Ch, Ptr, LD->getSrcValue(), LD->getSrcValueOffset()); |
Chris Lattner | ec39a45 | 2005-01-19 18:02:17 +0000 | [diff] [blame] | 4423 | |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 4424 | // Increment the pointer to the other half. |
| 4425 | unsigned IncrementSize = MVT::getSizeInBits(Lo.getValueType())/8; |
| 4426 | Ptr = DAG.getNode(ISD::ADD, Ptr.getValueType(), Ptr, |
| 4427 | getIntPtrConstant(IncrementSize)); |
| 4428 | // FIXME: This creates a bogus srcvalue! |
| 4429 | Hi = DAG.getLoad(NVT, Ch, Ptr, LD->getSrcValue(), LD->getSrcValueOffset()); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 4430 | |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 4431 | // Build a factor node to remember that this load is independent of the |
| 4432 | // other one. |
| 4433 | SDOperand TF = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo.getValue(1), |
| 4434 | Hi.getValue(1)); |
| 4435 | |
| 4436 | // Remember that we legalized the chain. |
| 4437 | AddLegalizedOperand(Op.getValue(1), LegalizeOp(TF)); |
| 4438 | if (!TLI.isLittleEndian()) |
| 4439 | std::swap(Lo, Hi); |
| 4440 | } else { |
| 4441 | MVT::ValueType EVT = LD->getLoadVT(); |
| 4442 | |
| 4443 | if (EVT == NVT) |
| 4444 | Lo = DAG.getLoad(NVT, Ch, Ptr, LD->getSrcValue(), |
| 4445 | LD->getSrcValueOffset()); |
| 4446 | else |
| 4447 | Lo = DAG.getExtLoad(ExtType, NVT, Ch, Ptr, LD->getSrcValue(), |
| 4448 | LD->getSrcValueOffset(), EVT); |
| 4449 | |
| 4450 | // Remember that we legalized the chain. |
| 4451 | AddLegalizedOperand(SDOperand(Node, 1), LegalizeOp(Lo.getValue(1))); |
| 4452 | |
| 4453 | if (ExtType == ISD::SEXTLOAD) { |
| 4454 | // The high part is obtained by SRA'ing all but one of the bits of the |
| 4455 | // lo part. |
| 4456 | unsigned LoSize = MVT::getSizeInBits(Lo.getValueType()); |
| 4457 | Hi = DAG.getNode(ISD::SRA, NVT, Lo, |
| 4458 | DAG.getConstant(LoSize-1, TLI.getShiftAmountTy())); |
| 4459 | } else if (ExtType == ISD::ZEXTLOAD) { |
| 4460 | // The high part is just a zero. |
| 4461 | Hi = DAG.getConstant(0, NVT); |
| 4462 | } else /* if (ExtType == ISD::EXTLOAD) */ { |
| 4463 | // The high part is undefined. |
| 4464 | Hi = DAG.getNode(ISD::UNDEF, NVT); |
| 4465 | } |
| 4466 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4467 | break; |
| 4468 | } |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4469 | case ISD::AND: |
| 4470 | case ISD::OR: |
| 4471 | case ISD::XOR: { // Simple logical operators -> two trivial pieces. |
| 4472 | SDOperand LL, LH, RL, RH; |
| 4473 | ExpandOp(Node->getOperand(0), LL, LH); |
| 4474 | ExpandOp(Node->getOperand(1), RL, RH); |
| 4475 | Lo = DAG.getNode(Node->getOpcode(), NVT, LL, RL); |
| 4476 | Hi = DAG.getNode(Node->getOpcode(), NVT, LH, RH); |
| 4477 | break; |
| 4478 | } |
| 4479 | case ISD::SELECT: { |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 4480 | SDOperand LL, LH, RL, RH; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4481 | ExpandOp(Node->getOperand(1), LL, LH); |
| 4482 | ExpandOp(Node->getOperand(2), RL, RH); |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 4483 | Lo = DAG.getNode(ISD::SELECT, NVT, Node->getOperand(0), LL, RL); |
| 4484 | Hi = DAG.getNode(ISD::SELECT, NVT, Node->getOperand(0), LH, RH); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4485 | break; |
| 4486 | } |
Nate Begeman | 9373a81 | 2005-08-10 20:51:12 +0000 | [diff] [blame] | 4487 | case ISD::SELECT_CC: { |
| 4488 | SDOperand TL, TH, FL, FH; |
| 4489 | ExpandOp(Node->getOperand(2), TL, TH); |
| 4490 | ExpandOp(Node->getOperand(3), FL, FH); |
| 4491 | Lo = DAG.getNode(ISD::SELECT_CC, NVT, Node->getOperand(0), |
| 4492 | Node->getOperand(1), TL, FL, Node->getOperand(4)); |
| 4493 | Hi = DAG.getNode(ISD::SELECT_CC, NVT, Node->getOperand(0), |
| 4494 | Node->getOperand(1), TH, FH, Node->getOperand(4)); |
| 4495 | break; |
| 4496 | } |
Chris Lattner | 8137c9e | 2006-01-28 05:07:51 +0000 | [diff] [blame] | 4497 | case ISD::ANY_EXTEND: |
| 4498 | // The low part is any extension of the input (which degenerates to a copy). |
| 4499 | Lo = DAG.getNode(ISD::ANY_EXTEND, NVT, Node->getOperand(0)); |
| 4500 | // The high part is undefined. |
| 4501 | Hi = DAG.getNode(ISD::UNDEF, NVT); |
| 4502 | break; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4503 | case ISD::SIGN_EXTEND: { |
| 4504 | // The low part is just a sign extension of the input (which degenerates to |
| 4505 | // a copy). |
Chris Lattner | 8137c9e | 2006-01-28 05:07:51 +0000 | [diff] [blame] | 4506 | Lo = DAG.getNode(ISD::SIGN_EXTEND, NVT, Node->getOperand(0)); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 4507 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4508 | // The high part is obtained by SRA'ing all but one of the bits of the lo |
| 4509 | // part. |
Chris Lattner | 2dad454 | 2005-01-12 18:19:52 +0000 | [diff] [blame] | 4510 | unsigned LoSize = MVT::getSizeInBits(Lo.getValueType()); |
Chris Lattner | 8137c9e | 2006-01-28 05:07:51 +0000 | [diff] [blame] | 4511 | Hi = DAG.getNode(ISD::SRA, NVT, Lo, |
| 4512 | DAG.getConstant(LoSize-1, TLI.getShiftAmountTy())); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4513 | break; |
| 4514 | } |
Chris Lattner | 8137c9e | 2006-01-28 05:07:51 +0000 | [diff] [blame] | 4515 | case ISD::ZERO_EXTEND: |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4516 | // The low part is just a zero extension of the input (which degenerates to |
| 4517 | // a copy). |
Chris Lattner | 8137c9e | 2006-01-28 05:07:51 +0000 | [diff] [blame] | 4518 | Lo = DAG.getNode(ISD::ZERO_EXTEND, NVT, Node->getOperand(0)); |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 4519 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4520 | // The high part is just a zero. |
| 4521 | Hi = DAG.getConstant(0, NVT); |
| 4522 | break; |
Chris Lattner | 3548189 | 2005-12-23 00:16:34 +0000 | [diff] [blame] | 4523 | |
| 4524 | case ISD::BIT_CONVERT: { |
Chris Lattner | f3f333d | 2006-09-09 00:20:27 +0000 | [diff] [blame] | 4525 | SDOperand Tmp; |
| 4526 | if (TLI.getOperationAction(ISD::BIT_CONVERT, VT) == TargetLowering::Custom){ |
| 4527 | // If the target wants to, allow it to lower this itself. |
| 4528 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 4529 | case Expand: assert(0 && "cannot expand FP!"); |
| 4530 | case Legal: Tmp = LegalizeOp(Node->getOperand(0)); break; |
| 4531 | case Promote: Tmp = PromoteOp (Node->getOperand(0)); break; |
| 4532 | } |
| 4533 | Tmp = TLI.LowerOperation(DAG.getNode(ISD::BIT_CONVERT, VT, Tmp), DAG); |
| 4534 | } |
| 4535 | |
| 4536 | // Turn this into a load/store pair by default. |
| 4537 | if (Tmp.Val == 0) |
| 4538 | Tmp = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0)); |
| 4539 | |
Chris Lattner | 3548189 | 2005-12-23 00:16:34 +0000 | [diff] [blame] | 4540 | ExpandOp(Tmp, Lo, Hi); |
| 4541 | break; |
| 4542 | } |
Andrew Lenharth | f70e30b | 2005-11-20 21:32:07 +0000 | [diff] [blame] | 4543 | |
Chris Lattner | 8137c9e | 2006-01-28 05:07:51 +0000 | [diff] [blame] | 4544 | case ISD::READCYCLECOUNTER: |
Chris Lattner | 308575b | 2005-11-20 22:56:56 +0000 | [diff] [blame] | 4545 | assert(TLI.getOperationAction(ISD::READCYCLECOUNTER, VT) == |
| 4546 | TargetLowering::Custom && |
| 4547 | "Must custom expand ReadCycleCounter"); |
Chris Lattner | 8137c9e | 2006-01-28 05:07:51 +0000 | [diff] [blame] | 4548 | Lo = TLI.LowerOperation(Op, DAG); |
| 4549 | assert(Lo.Val && "Node must be custom expanded!"); |
| 4550 | Hi = Lo.getValue(1); |
Chris Lattner | 308575b | 2005-11-20 22:56:56 +0000 | [diff] [blame] | 4551 | AddLegalizedOperand(SDOperand(Node, 1), // Remember we legalized the chain. |
Chris Lattner | 8137c9e | 2006-01-28 05:07:51 +0000 | [diff] [blame] | 4552 | LegalizeOp(Lo.getValue(2))); |
Andrew Lenharth | f70e30b | 2005-11-20 21:32:07 +0000 | [diff] [blame] | 4553 | break; |
| 4554 | |
Chris Lattner | 4e6c746 | 2005-01-08 19:27:05 +0000 | [diff] [blame] | 4555 | // These operators cannot be expanded directly, emit them as calls to |
| 4556 | // library functions. |
| 4557 | case ISD::FP_TO_SINT: |
Chris Lattner | 80a3e94 | 2005-07-29 00:33:32 +0000 | [diff] [blame] | 4558 | if (TLI.getOperationAction(ISD::FP_TO_SINT, VT) == TargetLowering::Custom) { |
Chris Lattner | f20d183 | 2005-07-30 01:40:57 +0000 | [diff] [blame] | 4559 | SDOperand Op; |
| 4560 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 4561 | case Expand: assert(0 && "cannot expand FP!"); |
Chris Lattner | 8137c9e | 2006-01-28 05:07:51 +0000 | [diff] [blame] | 4562 | case Legal: Op = LegalizeOp(Node->getOperand(0)); break; |
| 4563 | case Promote: Op = PromoteOp (Node->getOperand(0)); break; |
Chris Lattner | f20d183 | 2005-07-30 01:40:57 +0000 | [diff] [blame] | 4564 | } |
Jeff Cohen | d29b6aa | 2005-07-30 18:33:25 +0000 | [diff] [blame] | 4565 | |
Chris Lattner | f20d183 | 2005-07-30 01:40:57 +0000 | [diff] [blame] | 4566 | Op = TLI.LowerOperation(DAG.getNode(ISD::FP_TO_SINT, VT, Op), DAG); |
| 4567 | |
Chris Lattner | 80a3e94 | 2005-07-29 00:33:32 +0000 | [diff] [blame] | 4568 | // Now that the custom expander is done, expand the result, which is still |
| 4569 | // VT. |
Chris Lattner | 07dffd6 | 2005-08-26 00:14:16 +0000 | [diff] [blame] | 4570 | if (Op.Val) { |
| 4571 | ExpandOp(Op, Lo, Hi); |
| 4572 | break; |
| 4573 | } |
Chris Lattner | 80a3e94 | 2005-07-29 00:33:32 +0000 | [diff] [blame] | 4574 | } |
Jeff Cohen | d29b6aa | 2005-07-30 18:33:25 +0000 | [diff] [blame] | 4575 | |
Chris Lattner | 4e6c746 | 2005-01-08 19:27:05 +0000 | [diff] [blame] | 4576 | if (Node->getOperand(0).getValueType() == MVT::f32) |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 4577 | Lo = ExpandLibCall("__fixsfdi", Node, Hi); |
Chris Lattner | 4e6c746 | 2005-01-08 19:27:05 +0000 | [diff] [blame] | 4578 | else |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 4579 | Lo = ExpandLibCall("__fixdfdi", Node, Hi); |
Chris Lattner | 4e6c746 | 2005-01-08 19:27:05 +0000 | [diff] [blame] | 4580 | break; |
Jeff Cohen | d29b6aa | 2005-07-30 18:33:25 +0000 | [diff] [blame] | 4581 | |
Chris Lattner | 4e6c746 | 2005-01-08 19:27:05 +0000 | [diff] [blame] | 4582 | case ISD::FP_TO_UINT: |
Chris Lattner | 80a3e94 | 2005-07-29 00:33:32 +0000 | [diff] [blame] | 4583 | if (TLI.getOperationAction(ISD::FP_TO_UINT, VT) == TargetLowering::Custom) { |
Chris Lattner | 8137c9e | 2006-01-28 05:07:51 +0000 | [diff] [blame] | 4584 | SDOperand Op; |
| 4585 | switch (getTypeAction(Node->getOperand(0).getValueType())) { |
| 4586 | case Expand: assert(0 && "cannot expand FP!"); |
| 4587 | case Legal: Op = LegalizeOp(Node->getOperand(0)); break; |
| 4588 | case Promote: Op = PromoteOp (Node->getOperand(0)); break; |
| 4589 | } |
| 4590 | |
| 4591 | Op = TLI.LowerOperation(DAG.getNode(ISD::FP_TO_UINT, VT, Op), DAG); |
| 4592 | |
| 4593 | // Now that the custom expander is done, expand the result. |
Chris Lattner | 07dffd6 | 2005-08-26 00:14:16 +0000 | [diff] [blame] | 4594 | if (Op.Val) { |
| 4595 | ExpandOp(Op, Lo, Hi); |
| 4596 | break; |
| 4597 | } |
Chris Lattner | 80a3e94 | 2005-07-29 00:33:32 +0000 | [diff] [blame] | 4598 | } |
Jeff Cohen | d29b6aa | 2005-07-30 18:33:25 +0000 | [diff] [blame] | 4599 | |
Chris Lattner | 4e6c746 | 2005-01-08 19:27:05 +0000 | [diff] [blame] | 4600 | if (Node->getOperand(0).getValueType() == MVT::f32) |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 4601 | Lo = ExpandLibCall("__fixunssfdi", Node, Hi); |
Chris Lattner | 4e6c746 | 2005-01-08 19:27:05 +0000 | [diff] [blame] | 4602 | else |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 4603 | Lo = ExpandLibCall("__fixunsdfdi", Node, Hi); |
Chris Lattner | 4e6c746 | 2005-01-08 19:27:05 +0000 | [diff] [blame] | 4604 | break; |
| 4605 | |
Evan Cheng | 05a2d56 | 2006-01-09 18:31:59 +0000 | [diff] [blame] | 4606 | case ISD::SHL: { |
Chris Lattner | 50ec897 | 2005-08-31 19:01:53 +0000 | [diff] [blame] | 4607 | // If the target wants custom lowering, do so. |
Chris Lattner | 348e93c | 2006-01-21 04:27:00 +0000 | [diff] [blame] | 4608 | SDOperand ShiftAmt = LegalizeOp(Node->getOperand(1)); |
Chris Lattner | 50ec897 | 2005-08-31 19:01:53 +0000 | [diff] [blame] | 4609 | if (TLI.getOperationAction(ISD::SHL, VT) == TargetLowering::Custom) { |
Chris Lattner | 8137c9e | 2006-01-28 05:07:51 +0000 | [diff] [blame] | 4610 | SDOperand Op = DAG.getNode(ISD::SHL, VT, Node->getOperand(0), ShiftAmt); |
Chris Lattner | 50ec897 | 2005-08-31 19:01:53 +0000 | [diff] [blame] | 4611 | Op = TLI.LowerOperation(Op, DAG); |
| 4612 | if (Op.Val) { |
| 4613 | // Now that the custom expander is done, expand the result, which is |
| 4614 | // still VT. |
| 4615 | ExpandOp(Op, Lo, Hi); |
| 4616 | break; |
| 4617 | } |
| 4618 | } |
| 4619 | |
Chris Lattner | 79980b0 | 2006-09-13 03:50:39 +0000 | [diff] [blame] | 4620 | // If ADDC/ADDE are supported and if the shift amount is a constant 1, emit |
| 4621 | // this X << 1 as X+X. |
| 4622 | if (ConstantSDNode *ShAmt = dyn_cast<ConstantSDNode>(ShiftAmt)) { |
| 4623 | if (ShAmt->getValue() == 1 && TLI.isOperationLegal(ISD::ADDC, NVT) && |
| 4624 | TLI.isOperationLegal(ISD::ADDE, NVT)) { |
| 4625 | SDOperand LoOps[2], HiOps[3]; |
| 4626 | ExpandOp(Node->getOperand(0), LoOps[0], HiOps[0]); |
| 4627 | SDVTList VTList = DAG.getVTList(LoOps[0].getValueType(), MVT::Flag); |
| 4628 | LoOps[1] = LoOps[0]; |
| 4629 | Lo = DAG.getNode(ISD::ADDC, VTList, LoOps, 2); |
| 4630 | |
| 4631 | HiOps[1] = HiOps[0]; |
| 4632 | HiOps[2] = Lo.getValue(1); |
| 4633 | Hi = DAG.getNode(ISD::ADDE, VTList, HiOps, 3); |
| 4634 | break; |
| 4635 | } |
| 4636 | } |
| 4637 | |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 4638 | // If we can emit an efficient shift operation, do so now. |
Chris Lattner | 348e93c | 2006-01-21 04:27:00 +0000 | [diff] [blame] | 4639 | if (ExpandShift(ISD::SHL, Node->getOperand(0), ShiftAmt, Lo, Hi)) |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 4640 | break; |
Chris Lattner | 4759982 | 2005-04-02 03:38:53 +0000 | [diff] [blame] | 4641 | |
| 4642 | // If this target supports SHL_PARTS, use it. |
Evan Cheng | 05a2d56 | 2006-01-09 18:31:59 +0000 | [diff] [blame] | 4643 | TargetLowering::LegalizeAction Action = |
| 4644 | TLI.getOperationAction(ISD::SHL_PARTS, NVT); |
| 4645 | if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) || |
| 4646 | Action == TargetLowering::Custom) { |
Chris Lattner | 348e93c | 2006-01-21 04:27:00 +0000 | [diff] [blame] | 4647 | ExpandShiftParts(ISD::SHL_PARTS, Node->getOperand(0), ShiftAmt, Lo, Hi); |
Chris Lattner | 4759982 | 2005-04-02 03:38:53 +0000 | [diff] [blame] | 4648 | break; |
| 4649 | } |
| 4650 | |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 4651 | // Otherwise, emit a libcall. |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 4652 | Lo = ExpandLibCall("__ashldi3", Node, Hi); |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 4653 | break; |
Evan Cheng | 05a2d56 | 2006-01-09 18:31:59 +0000 | [diff] [blame] | 4654 | } |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 4655 | |
Evan Cheng | 05a2d56 | 2006-01-09 18:31:59 +0000 | [diff] [blame] | 4656 | case ISD::SRA: { |
Chris Lattner | 50ec897 | 2005-08-31 19:01:53 +0000 | [diff] [blame] | 4657 | // If the target wants custom lowering, do so. |
Chris Lattner | 348e93c | 2006-01-21 04:27:00 +0000 | [diff] [blame] | 4658 | SDOperand ShiftAmt = LegalizeOp(Node->getOperand(1)); |
Chris Lattner | 50ec897 | 2005-08-31 19:01:53 +0000 | [diff] [blame] | 4659 | if (TLI.getOperationAction(ISD::SRA, VT) == TargetLowering::Custom) { |
Chris Lattner | 8137c9e | 2006-01-28 05:07:51 +0000 | [diff] [blame] | 4660 | SDOperand Op = DAG.getNode(ISD::SRA, VT, Node->getOperand(0), ShiftAmt); |
Chris Lattner | 50ec897 | 2005-08-31 19:01:53 +0000 | [diff] [blame] | 4661 | Op = TLI.LowerOperation(Op, DAG); |
| 4662 | if (Op.Val) { |
| 4663 | // Now that the custom expander is done, expand the result, which is |
| 4664 | // still VT. |
| 4665 | ExpandOp(Op, Lo, Hi); |
| 4666 | break; |
| 4667 | } |
| 4668 | } |
| 4669 | |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 4670 | // If we can emit an efficient shift operation, do so now. |
Chris Lattner | 348e93c | 2006-01-21 04:27:00 +0000 | [diff] [blame] | 4671 | if (ExpandShift(ISD::SRA, Node->getOperand(0), ShiftAmt, Lo, Hi)) |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 4672 | break; |
Chris Lattner | 4759982 | 2005-04-02 03:38:53 +0000 | [diff] [blame] | 4673 | |
| 4674 | // If this target supports SRA_PARTS, use it. |
Evan Cheng | 05a2d56 | 2006-01-09 18:31:59 +0000 | [diff] [blame] | 4675 | TargetLowering::LegalizeAction Action = |
| 4676 | TLI.getOperationAction(ISD::SRA_PARTS, NVT); |
| 4677 | if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) || |
| 4678 | Action == TargetLowering::Custom) { |
Chris Lattner | 348e93c | 2006-01-21 04:27:00 +0000 | [diff] [blame] | 4679 | ExpandShiftParts(ISD::SRA_PARTS, Node->getOperand(0), ShiftAmt, Lo, Hi); |
Chris Lattner | 4759982 | 2005-04-02 03:38:53 +0000 | [diff] [blame] | 4680 | break; |
| 4681 | } |
| 4682 | |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 4683 | // Otherwise, emit a libcall. |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 4684 | Lo = ExpandLibCall("__ashrdi3", Node, Hi); |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 4685 | break; |
Evan Cheng | 05a2d56 | 2006-01-09 18:31:59 +0000 | [diff] [blame] | 4686 | } |
| 4687 | |
| 4688 | case ISD::SRL: { |
Chris Lattner | 50ec897 | 2005-08-31 19:01:53 +0000 | [diff] [blame] | 4689 | // If the target wants custom lowering, do so. |
Chris Lattner | 348e93c | 2006-01-21 04:27:00 +0000 | [diff] [blame] | 4690 | SDOperand ShiftAmt = LegalizeOp(Node->getOperand(1)); |
Chris Lattner | 50ec897 | 2005-08-31 19:01:53 +0000 | [diff] [blame] | 4691 | if (TLI.getOperationAction(ISD::SRL, VT) == TargetLowering::Custom) { |
Chris Lattner | 8137c9e | 2006-01-28 05:07:51 +0000 | [diff] [blame] | 4692 | SDOperand Op = DAG.getNode(ISD::SRL, VT, Node->getOperand(0), ShiftAmt); |
Chris Lattner | 50ec897 | 2005-08-31 19:01:53 +0000 | [diff] [blame] | 4693 | Op = TLI.LowerOperation(Op, DAG); |
| 4694 | if (Op.Val) { |
| 4695 | // Now that the custom expander is done, expand the result, which is |
| 4696 | // still VT. |
| 4697 | ExpandOp(Op, Lo, Hi); |
| 4698 | break; |
| 4699 | } |
| 4700 | } |
| 4701 | |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 4702 | // If we can emit an efficient shift operation, do so now. |
Chris Lattner | 348e93c | 2006-01-21 04:27:00 +0000 | [diff] [blame] | 4703 | if (ExpandShift(ISD::SRL, Node->getOperand(0), ShiftAmt, Lo, Hi)) |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 4704 | break; |
Chris Lattner | 4759982 | 2005-04-02 03:38:53 +0000 | [diff] [blame] | 4705 | |
| 4706 | // If this target supports SRL_PARTS, use it. |
Evan Cheng | 05a2d56 | 2006-01-09 18:31:59 +0000 | [diff] [blame] | 4707 | TargetLowering::LegalizeAction Action = |
| 4708 | TLI.getOperationAction(ISD::SRL_PARTS, NVT); |
| 4709 | if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) || |
| 4710 | Action == TargetLowering::Custom) { |
Chris Lattner | 348e93c | 2006-01-21 04:27:00 +0000 | [diff] [blame] | 4711 | ExpandShiftParts(ISD::SRL_PARTS, Node->getOperand(0), ShiftAmt, Lo, Hi); |
Chris Lattner | 4759982 | 2005-04-02 03:38:53 +0000 | [diff] [blame] | 4712 | break; |
| 4713 | } |
| 4714 | |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 4715 | // Otherwise, emit a libcall. |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 4716 | Lo = ExpandLibCall("__lshrdi3", Node, Hi); |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 4717 | break; |
Evan Cheng | 05a2d56 | 2006-01-09 18:31:59 +0000 | [diff] [blame] | 4718 | } |
Chris Lattner | e34b396 | 2005-01-19 04:19:40 +0000 | [diff] [blame] | 4719 | |
Misha Brukman | edf128a | 2005-04-21 22:36:52 +0000 | [diff] [blame] | 4720 | case ISD::ADD: |
Chris Lattner | 8137c9e | 2006-01-28 05:07:51 +0000 | [diff] [blame] | 4721 | case ISD::SUB: { |
| 4722 | // If the target wants to custom expand this, let them. |
| 4723 | if (TLI.getOperationAction(Node->getOpcode(), VT) == |
| 4724 | TargetLowering::Custom) { |
| 4725 | Op = TLI.LowerOperation(Op, DAG); |
| 4726 | if (Op.Val) { |
| 4727 | ExpandOp(Op, Lo, Hi); |
| 4728 | break; |
| 4729 | } |
| 4730 | } |
| 4731 | |
| 4732 | // Expand the subcomponents. |
| 4733 | SDOperand LHSL, LHSH, RHSL, RHSH; |
| 4734 | ExpandOp(Node->getOperand(0), LHSL, LHSH); |
| 4735 | ExpandOp(Node->getOperand(1), RHSL, RHSH); |
Chris Lattner | 79980b0 | 2006-09-13 03:50:39 +0000 | [diff] [blame] | 4736 | SDVTList VTList = DAG.getVTList(LHSL.getValueType(), MVT::Flag); |
| 4737 | SDOperand LoOps[2], HiOps[3]; |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 4738 | LoOps[0] = LHSL; |
| 4739 | LoOps[1] = RHSL; |
| 4740 | HiOps[0] = LHSH; |
| 4741 | HiOps[1] = RHSH; |
Nate Begeman | 551bf3f | 2006-02-17 05:43:56 +0000 | [diff] [blame] | 4742 | if (Node->getOpcode() == ISD::ADD) { |
Chris Lattner | 79980b0 | 2006-09-13 03:50:39 +0000 | [diff] [blame] | 4743 | Lo = DAG.getNode(ISD::ADDC, VTList, LoOps, 2); |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 4744 | HiOps[2] = Lo.getValue(1); |
Chris Lattner | 79980b0 | 2006-09-13 03:50:39 +0000 | [diff] [blame] | 4745 | Hi = DAG.getNode(ISD::ADDE, VTList, HiOps, 3); |
Nate Begeman | 551bf3f | 2006-02-17 05:43:56 +0000 | [diff] [blame] | 4746 | } else { |
Chris Lattner | 79980b0 | 2006-09-13 03:50:39 +0000 | [diff] [blame] | 4747 | Lo = DAG.getNode(ISD::SUBC, VTList, LoOps, 2); |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 4748 | HiOps[2] = Lo.getValue(1); |
Chris Lattner | 79980b0 | 2006-09-13 03:50:39 +0000 | [diff] [blame] | 4749 | Hi = DAG.getNode(ISD::SUBE, VTList, HiOps, 3); |
Nate Begeman | 551bf3f | 2006-02-17 05:43:56 +0000 | [diff] [blame] | 4750 | } |
Chris Lattner | 84f6788 | 2005-01-20 18:52:28 +0000 | [diff] [blame] | 4751 | break; |
Chris Lattner | 8137c9e | 2006-01-28 05:07:51 +0000 | [diff] [blame] | 4752 | } |
Nate Begeman | c7c1657 | 2005-04-11 03:01:51 +0000 | [diff] [blame] | 4753 | case ISD::MUL: { |
Chris Lattner | 7d7bffe | 2006-09-16 00:09:24 +0000 | [diff] [blame] | 4754 | // If the target wants to custom expand this, let them. |
| 4755 | if (TLI.getOperationAction(ISD::MUL, VT) == TargetLowering::Custom) { |
Chris Lattner | 8829dc8 | 2006-09-16 05:08:34 +0000 | [diff] [blame] | 4756 | SDOperand New = TLI.LowerOperation(Op, DAG); |
| 4757 | if (New.Val) { |
| 4758 | ExpandOp(New, Lo, Hi); |
Chris Lattner | 7d7bffe | 2006-09-16 00:09:24 +0000 | [diff] [blame] | 4759 | break; |
| 4760 | } |
| 4761 | } |
| 4762 | |
Evan Cheng | 3f4fd0f | 2006-09-01 18:17:58 +0000 | [diff] [blame] | 4763 | bool HasMULHS = TLI.isOperationLegal(ISD::MULHS, NVT); |
| 4764 | bool HasMULHU = TLI.isOperationLegal(ISD::MULHU, NVT); |
| 4765 | bool UseLibCall = true; |
| 4766 | if (HasMULHS || HasMULHU) { |
Nate Begeman | c7c1657 | 2005-04-11 03:01:51 +0000 | [diff] [blame] | 4767 | SDOperand LL, LH, RL, RH; |
| 4768 | ExpandOp(Node->getOperand(0), LL, LH); |
| 4769 | ExpandOp(Node->getOperand(1), RL, RH); |
Nate Begeman | 56eb868 | 2005-08-30 02:44:00 +0000 | [diff] [blame] | 4770 | unsigned SH = MVT::getSizeInBits(RH.getValueType())-1; |
| 4771 | // MULHS implicitly sign extends its inputs. Check to see if ExpandOp |
| 4772 | // extended the sign bit of the low half through the upper half, and if so |
| 4773 | // emit a MULHS instead of the alternate sequence that is valid for any |
| 4774 | // i64 x i64 multiply. |
Evan Cheng | 3f4fd0f | 2006-09-01 18:17:58 +0000 | [diff] [blame] | 4775 | if (HasMULHS && |
Nate Begeman | 56eb868 | 2005-08-30 02:44:00 +0000 | [diff] [blame] | 4776 | // is RH an extension of the sign bit of RL? |
| 4777 | RH.getOpcode() == ISD::SRA && RH.getOperand(0) == RL && |
| 4778 | RH.getOperand(1).getOpcode() == ISD::Constant && |
| 4779 | cast<ConstantSDNode>(RH.getOperand(1))->getValue() == SH && |
| 4780 | // is LH an extension of the sign bit of LL? |
| 4781 | LH.getOpcode() == ISD::SRA && LH.getOperand(0) == LL && |
| 4782 | LH.getOperand(1).getOpcode() == ISD::Constant && |
| 4783 | cast<ConstantSDNode>(LH.getOperand(1))->getValue() == SH) { |
Chris Lattner | a89654b | 2006-09-16 00:21:44 +0000 | [diff] [blame] | 4784 | // FIXME: Move this to the dag combiner. |
| 4785 | |
| 4786 | // Low part: |
| 4787 | Lo = DAG.getNode(ISD::MUL, NVT, LL, RL); |
| 4788 | // High part: |
Nate Begeman | 56eb868 | 2005-08-30 02:44:00 +0000 | [diff] [blame] | 4789 | Hi = DAG.getNode(ISD::MULHS, NVT, LL, RL); |
Chris Lattner | a89654b | 2006-09-16 00:21:44 +0000 | [diff] [blame] | 4790 | break; |
Evan Cheng | 3f4fd0f | 2006-09-01 18:17:58 +0000 | [diff] [blame] | 4791 | } else if (HasMULHU) { |
Chris Lattner | a89654b | 2006-09-16 00:21:44 +0000 | [diff] [blame] | 4792 | // Low part: |
| 4793 | Lo = DAG.getNode(ISD::MUL, NVT, LL, RL); |
| 4794 | |
| 4795 | // High part: |
Nate Begeman | 56eb868 | 2005-08-30 02:44:00 +0000 | [diff] [blame] | 4796 | Hi = DAG.getNode(ISD::MULHU, NVT, LL, RL); |
| 4797 | RH = DAG.getNode(ISD::MUL, NVT, LL, RH); |
| 4798 | LH = DAG.getNode(ISD::MUL, NVT, LH, RL); |
| 4799 | Hi = DAG.getNode(ISD::ADD, NVT, Hi, RH); |
| 4800 | Hi = DAG.getNode(ISD::ADD, NVT, Hi, LH); |
Chris Lattner | a89654b | 2006-09-16 00:21:44 +0000 | [diff] [blame] | 4801 | break; |
Nate Begeman | 56eb868 | 2005-08-30 02:44:00 +0000 | [diff] [blame] | 4802 | } |
Nate Begeman | c7c1657 | 2005-04-11 03:01:51 +0000 | [diff] [blame] | 4803 | } |
Evan Cheng | 3f4fd0f | 2006-09-01 18:17:58 +0000 | [diff] [blame] | 4804 | |
Chris Lattner | a89654b | 2006-09-16 00:21:44 +0000 | [diff] [blame] | 4805 | Lo = ExpandLibCall("__muldi3" , Node, Hi); |
Nate Begeman | c7c1657 | 2005-04-11 03:01:51 +0000 | [diff] [blame] | 4806 | break; |
| 4807 | } |
Chris Lattner | 77e77a6 | 2005-01-21 06:05:23 +0000 | [diff] [blame] | 4808 | case ISD::SDIV: Lo = ExpandLibCall("__divdi3" , Node, Hi); break; |
| 4809 | case ISD::UDIV: Lo = ExpandLibCall("__udivdi3", Node, Hi); break; |
| 4810 | case ISD::SREM: Lo = ExpandLibCall("__moddi3" , Node, Hi); break; |
| 4811 | case ISD::UREM: Lo = ExpandLibCall("__umoddi3", Node, Hi); break; |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4812 | } |
| 4813 | |
Chris Lattner | 8339736 | 2005-12-21 18:02:52 +0000 | [diff] [blame] | 4814 | // Make sure the resultant values have been legalized themselves, unless this |
| 4815 | // is a type that requires multi-step expansion. |
| 4816 | if (getTypeAction(NVT) != Expand && NVT != MVT::isVoid) { |
| 4817 | Lo = LegalizeOp(Lo); |
| 4818 | Hi = LegalizeOp(Hi); |
| 4819 | } |
Evan Cheng | 05a2d56 | 2006-01-09 18:31:59 +0000 | [diff] [blame] | 4820 | |
| 4821 | // Remember in a map if the values will be reused later. |
| 4822 | bool isNew = |
| 4823 | ExpandedNodes.insert(std::make_pair(Op, std::make_pair(Lo, Hi))).second; |
| 4824 | assert(isNew && "Value already expanded?!?"); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 4825 | } |
| 4826 | |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 4827 | /// SplitVectorOp - Given an operand of MVT::Vector type, break it down into |
| 4828 | /// two smaller values of MVT::Vector type. |
| 4829 | void SelectionDAGLegalize::SplitVectorOp(SDOperand Op, SDOperand &Lo, |
| 4830 | SDOperand &Hi) { |
| 4831 | assert(Op.getValueType() == MVT::Vector && "Cannot split non-vector type!"); |
| 4832 | SDNode *Node = Op.Val; |
| 4833 | unsigned NumElements = cast<ConstantSDNode>(*(Node->op_end()-2))->getValue(); |
| 4834 | assert(NumElements > 1 && "Cannot split a single element vector!"); |
| 4835 | unsigned NewNumElts = NumElements/2; |
| 4836 | SDOperand NewNumEltsNode = DAG.getConstant(NewNumElts, MVT::i32); |
| 4837 | SDOperand TypeNode = *(Node->op_end()-1); |
| 4838 | |
| 4839 | // See if we already split it. |
| 4840 | std::map<SDOperand, std::pair<SDOperand, SDOperand> >::iterator I |
| 4841 | = SplitNodes.find(Op); |
| 4842 | if (I != SplitNodes.end()) { |
| 4843 | Lo = I->second.first; |
| 4844 | Hi = I->second.second; |
| 4845 | return; |
| 4846 | } |
| 4847 | |
| 4848 | switch (Node->getOpcode()) { |
Jim Laskey | e37fe9b | 2006-07-11 17:58:07 +0000 | [diff] [blame] | 4849 | default: |
| 4850 | #ifndef NDEBUG |
| 4851 | Node->dump(); |
| 4852 | #endif |
| 4853 | assert(0 && "Unhandled operation in SplitVectorOp!"); |
Chris Lattner | b2827b0 | 2006-03-19 00:52:58 +0000 | [diff] [blame] | 4854 | case ISD::VBUILD_VECTOR: { |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 4855 | SmallVector<SDOperand, 8> LoOps(Node->op_begin(), |
| 4856 | Node->op_begin()+NewNumElts); |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 4857 | LoOps.push_back(NewNumEltsNode); |
| 4858 | LoOps.push_back(TypeNode); |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 4859 | Lo = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, &LoOps[0], LoOps.size()); |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 4860 | |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 4861 | SmallVector<SDOperand, 8> HiOps(Node->op_begin()+NewNumElts, |
| 4862 | Node->op_end()-2); |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 4863 | HiOps.push_back(NewNumEltsNode); |
| 4864 | HiOps.push_back(TypeNode); |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 4865 | Hi = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, &HiOps[0], HiOps.size()); |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 4866 | break; |
| 4867 | } |
| 4868 | case ISD::VADD: |
| 4869 | case ISD::VSUB: |
| 4870 | case ISD::VMUL: |
| 4871 | case ISD::VSDIV: |
| 4872 | case ISD::VUDIV: |
| 4873 | case ISD::VAND: |
| 4874 | case ISD::VOR: |
| 4875 | case ISD::VXOR: { |
| 4876 | SDOperand LL, LH, RL, RH; |
| 4877 | SplitVectorOp(Node->getOperand(0), LL, LH); |
| 4878 | SplitVectorOp(Node->getOperand(1), RL, RH); |
| 4879 | |
| 4880 | Lo = DAG.getNode(Node->getOpcode(), MVT::Vector, LL, RL, |
| 4881 | NewNumEltsNode, TypeNode); |
| 4882 | Hi = DAG.getNode(Node->getOpcode(), MVT::Vector, LH, RH, |
| 4883 | NewNumEltsNode, TypeNode); |
| 4884 | break; |
| 4885 | } |
| 4886 | case ISD::VLOAD: { |
| 4887 | SDOperand Ch = Node->getOperand(0); // Legalize the chain. |
| 4888 | SDOperand Ptr = Node->getOperand(1); // Legalize the pointer. |
| 4889 | MVT::ValueType EVT = cast<VTSDNode>(TypeNode)->getVT(); |
| 4890 | |
| 4891 | Lo = DAG.getVecLoad(NewNumElts, EVT, Ch, Ptr, Node->getOperand(2)); |
| 4892 | unsigned IncrementSize = NewNumElts * MVT::getSizeInBits(EVT)/8; |
| 4893 | Ptr = DAG.getNode(ISD::ADD, Ptr.getValueType(), Ptr, |
| 4894 | getIntPtrConstant(IncrementSize)); |
| 4895 | // FIXME: This creates a bogus srcvalue! |
| 4896 | Hi = DAG.getVecLoad(NewNumElts, EVT, Ch, Ptr, Node->getOperand(2)); |
| 4897 | |
| 4898 | // Build a factor node to remember that this load is independent of the |
| 4899 | // other one. |
| 4900 | SDOperand TF = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo.getValue(1), |
| 4901 | Hi.getValue(1)); |
| 4902 | |
| 4903 | // Remember that we legalized the chain. |
| 4904 | AddLegalizedOperand(Op.getValue(1), LegalizeOp(TF)); |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 4905 | break; |
| 4906 | } |
Chris Lattner | 7692eb4 | 2006-03-23 21:16:34 +0000 | [diff] [blame] | 4907 | case ISD::VBIT_CONVERT: { |
| 4908 | // We know the result is a vector. The input may be either a vector or a |
| 4909 | // scalar value. |
| 4910 | if (Op.getOperand(0).getValueType() != MVT::Vector) { |
| 4911 | // Lower to a store/load. FIXME: this could be improved probably. |
| 4912 | SDOperand Ptr = CreateStackTemporary(Op.getOperand(0).getValueType()); |
| 4913 | |
Evan Cheng | 786225a | 2006-10-05 23:01:46 +0000 | [diff] [blame] | 4914 | SDOperand St = DAG.getStore(DAG.getEntryNode(), |
| 4915 | Op.getOperand(0), Ptr, DAG.getSrcValue(0)); |
Chris Lattner | 7692eb4 | 2006-03-23 21:16:34 +0000 | [diff] [blame] | 4916 | MVT::ValueType EVT = cast<VTSDNode>(TypeNode)->getVT(); |
| 4917 | St = DAG.getVecLoad(NumElements, EVT, St, Ptr, DAG.getSrcValue(0)); |
| 4918 | SplitVectorOp(St, Lo, Hi); |
| 4919 | } else { |
| 4920 | // If the input is a vector type, we have to either scalarize it, pack it |
| 4921 | // or convert it based on whether the input vector type is legal. |
| 4922 | SDNode *InVal = Node->getOperand(0).Val; |
| 4923 | unsigned NumElems = |
| 4924 | cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue(); |
| 4925 | MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT(); |
| 4926 | |
| 4927 | // If the input is from a single element vector, scalarize the vector, |
| 4928 | // then treat like a scalar. |
| 4929 | if (NumElems == 1) { |
| 4930 | SDOperand Scalar = PackVectorOp(Op.getOperand(0), EVT); |
| 4931 | Scalar = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Scalar, |
| 4932 | Op.getOperand(1), Op.getOperand(2)); |
| 4933 | SplitVectorOp(Scalar, Lo, Hi); |
| 4934 | } else { |
| 4935 | // Split the input vector. |
| 4936 | SplitVectorOp(Op.getOperand(0), Lo, Hi); |
| 4937 | |
| 4938 | // Convert each of the pieces now. |
| 4939 | Lo = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Lo, |
| 4940 | NewNumEltsNode, TypeNode); |
| 4941 | Hi = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Hi, |
| 4942 | NewNumEltsNode, TypeNode); |
| 4943 | } |
| 4944 | break; |
| 4945 | } |
| 4946 | } |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 4947 | } |
| 4948 | |
| 4949 | // Remember in a map if the values will be reused later. |
| 4950 | bool isNew = |
| 4951 | SplitNodes.insert(std::make_pair(Op, std::make_pair(Lo, Hi))).second; |
| 4952 | assert(isNew && "Value already expanded?!?"); |
| 4953 | } |
| 4954 | |
| 4955 | |
| 4956 | /// PackVectorOp - Given an operand of MVT::Vector type, convert it into the |
| 4957 | /// equivalent operation that returns a scalar (e.g. F32) or packed value |
| 4958 | /// (e.g. MVT::V4F32). When this is called, we know that PackedVT is the right |
| 4959 | /// type for the result. |
| 4960 | SDOperand SelectionDAGLegalize::PackVectorOp(SDOperand Op, |
| 4961 | MVT::ValueType NewVT) { |
| 4962 | assert(Op.getValueType() == MVT::Vector && "Bad PackVectorOp invocation!"); |
| 4963 | SDNode *Node = Op.Val; |
| 4964 | |
| 4965 | // See if we already packed it. |
| 4966 | std::map<SDOperand, SDOperand>::iterator I = PackedNodes.find(Op); |
| 4967 | if (I != PackedNodes.end()) return I->second; |
| 4968 | |
| 4969 | SDOperand Result; |
| 4970 | switch (Node->getOpcode()) { |
Chris Lattner | 2332b9f | 2006-03-19 01:17:20 +0000 | [diff] [blame] | 4971 | default: |
Jim Laskey | e37fe9b | 2006-07-11 17:58:07 +0000 | [diff] [blame] | 4972 | #ifndef NDEBUG |
Chris Lattner | 2332b9f | 2006-03-19 01:17:20 +0000 | [diff] [blame] | 4973 | Node->dump(); std::cerr << "\n"; |
Jim Laskey | e37fe9b | 2006-07-11 17:58:07 +0000 | [diff] [blame] | 4974 | #endif |
Chris Lattner | 2332b9f | 2006-03-19 01:17:20 +0000 | [diff] [blame] | 4975 | assert(0 && "Unknown vector operation in PackVectorOp!"); |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 4976 | case ISD::VADD: |
| 4977 | case ISD::VSUB: |
| 4978 | case ISD::VMUL: |
| 4979 | case ISD::VSDIV: |
| 4980 | case ISD::VUDIV: |
| 4981 | case ISD::VAND: |
| 4982 | case ISD::VOR: |
| 4983 | case ISD::VXOR: |
| 4984 | Result = DAG.getNode(getScalarizedOpcode(Node->getOpcode(), NewVT), |
| 4985 | NewVT, |
| 4986 | PackVectorOp(Node->getOperand(0), NewVT), |
| 4987 | PackVectorOp(Node->getOperand(1), NewVT)); |
| 4988 | break; |
| 4989 | case ISD::VLOAD: { |
Chris Lattner | 4794a6b | 2006-03-19 00:07:49 +0000 | [diff] [blame] | 4990 | SDOperand Ch = LegalizeOp(Node->getOperand(0)); // Legalize the chain. |
| 4991 | SDOperand Ptr = LegalizeOp(Node->getOperand(1)); // Legalize the pointer. |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 4992 | |
Evan Cheng | 466685d | 2006-10-09 20:57:25 +0000 | [diff] [blame^] | 4993 | SrcValueSDNode *SV = cast<SrcValueSDNode>(Node->getOperand(2)); |
| 4994 | Result = DAG.getLoad(NewVT, Ch, Ptr, SV->getValue(), SV->getOffset()); |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 4995 | |
| 4996 | // Remember that we legalized the chain. |
| 4997 | AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1))); |
| 4998 | break; |
| 4999 | } |
Chris Lattner | b2827b0 | 2006-03-19 00:52:58 +0000 | [diff] [blame] | 5000 | case ISD::VBUILD_VECTOR: |
Chris Lattner | 70c2a61 | 2006-03-31 02:06:56 +0000 | [diff] [blame] | 5001 | if (Node->getOperand(0).getValueType() == NewVT) { |
Chris Lattner | b2827b0 | 2006-03-19 00:52:58 +0000 | [diff] [blame] | 5002 | // Returning a scalar? |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 5003 | Result = Node->getOperand(0); |
| 5004 | } else { |
Chris Lattner | b2827b0 | 2006-03-19 00:52:58 +0000 | [diff] [blame] | 5005 | // Returning a BUILD_VECTOR? |
Chris Lattner | 17614ea | 2006-04-08 05:34:25 +0000 | [diff] [blame] | 5006 | |
| 5007 | // If all elements of the build_vector are undefs, return an undef. |
| 5008 | bool AllUndef = true; |
| 5009 | for (unsigned i = 0, e = Node->getNumOperands()-2; i != e; ++i) |
| 5010 | if (Node->getOperand(i).getOpcode() != ISD::UNDEF) { |
| 5011 | AllUndef = false; |
| 5012 | break; |
| 5013 | } |
| 5014 | if (AllUndef) { |
| 5015 | Result = DAG.getNode(ISD::UNDEF, NewVT); |
| 5016 | } else { |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 5017 | Result = DAG.getNode(ISD::BUILD_VECTOR, NewVT, Node->op_begin(), |
| 5018 | Node->getNumOperands()-2); |
Chris Lattner | 17614ea | 2006-04-08 05:34:25 +0000 | [diff] [blame] | 5019 | } |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 5020 | } |
| 5021 | break; |
Chris Lattner | 2332b9f | 2006-03-19 01:17:20 +0000 | [diff] [blame] | 5022 | case ISD::VINSERT_VECTOR_ELT: |
| 5023 | if (!MVT::isVector(NewVT)) { |
| 5024 | // Returning a scalar? Must be the inserted element. |
| 5025 | Result = Node->getOperand(1); |
| 5026 | } else { |
| 5027 | Result = DAG.getNode(ISD::INSERT_VECTOR_ELT, NewVT, |
| 5028 | PackVectorOp(Node->getOperand(0), NewVT), |
| 5029 | Node->getOperand(1), Node->getOperand(2)); |
| 5030 | } |
| 5031 | break; |
Chris Lattner | 5b2316e | 2006-03-28 20:24:43 +0000 | [diff] [blame] | 5032 | case ISD::VVECTOR_SHUFFLE: |
| 5033 | if (!MVT::isVector(NewVT)) { |
| 5034 | // Returning a scalar? Figure out if it is the LHS or RHS and return it. |
| 5035 | SDOperand EltNum = Node->getOperand(2).getOperand(0); |
| 5036 | if (cast<ConstantSDNode>(EltNum)->getValue()) |
| 5037 | Result = PackVectorOp(Node->getOperand(1), NewVT); |
| 5038 | else |
| 5039 | Result = PackVectorOp(Node->getOperand(0), NewVT); |
| 5040 | } else { |
| 5041 | // Otherwise, return a VECTOR_SHUFFLE node. First convert the index |
| 5042 | // vector from a VBUILD_VECTOR to a BUILD_VECTOR. |
| 5043 | std::vector<SDOperand> BuildVecIdx(Node->getOperand(2).Val->op_begin(), |
| 5044 | Node->getOperand(2).Val->op_end()-2); |
| 5045 | MVT::ValueType BVT = MVT::getIntVectorWithNumElements(BuildVecIdx.size()); |
Chris Lattner | bd564bf | 2006-08-08 02:23:42 +0000 | [diff] [blame] | 5046 | SDOperand BV = DAG.getNode(ISD::BUILD_VECTOR, BVT, |
| 5047 | Node->getOperand(2).Val->op_begin(), |
| 5048 | Node->getOperand(2).Val->getNumOperands()-2); |
Chris Lattner | 5b2316e | 2006-03-28 20:24:43 +0000 | [diff] [blame] | 5049 | |
| 5050 | Result = DAG.getNode(ISD::VECTOR_SHUFFLE, NewVT, |
| 5051 | PackVectorOp(Node->getOperand(0), NewVT), |
| 5052 | PackVectorOp(Node->getOperand(1), NewVT), BV); |
| 5053 | } |
| 5054 | break; |
Chris Lattner | e25ca69 | 2006-03-22 20:09:35 +0000 | [diff] [blame] | 5055 | case ISD::VBIT_CONVERT: |
| 5056 | if (Op.getOperand(0).getValueType() != MVT::Vector) |
| 5057 | Result = DAG.getNode(ISD::BIT_CONVERT, NewVT, Op.getOperand(0)); |
| 5058 | else { |
| 5059 | // If the input is a vector type, we have to either scalarize it, pack it |
| 5060 | // or convert it based on whether the input vector type is legal. |
| 5061 | SDNode *InVal = Node->getOperand(0).Val; |
| 5062 | unsigned NumElems = |
| 5063 | cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue(); |
| 5064 | MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT(); |
| 5065 | |
| 5066 | // Figure out if there is a Packed type corresponding to this Vector |
| 5067 | // type. If so, convert to the packed type. |
| 5068 | MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems); |
| 5069 | if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) { |
| 5070 | // Turn this into a bit convert of the packed input. |
| 5071 | Result = DAG.getNode(ISD::BIT_CONVERT, NewVT, |
| 5072 | PackVectorOp(Node->getOperand(0), TVT)); |
| 5073 | break; |
| 5074 | } else if (NumElems == 1) { |
| 5075 | // Turn this into a bit convert of the scalar input. |
| 5076 | Result = DAG.getNode(ISD::BIT_CONVERT, NewVT, |
| 5077 | PackVectorOp(Node->getOperand(0), EVT)); |
| 5078 | break; |
| 5079 | } else { |
| 5080 | // FIXME: UNIMP! |
| 5081 | assert(0 && "Cast from unsupported vector type not implemented yet!"); |
| 5082 | } |
| 5083 | } |
Evan Cheng | db3c626 | 2006-04-10 18:54:36 +0000 | [diff] [blame] | 5084 | break; |
Chris Lattner | b22e35a | 2006-04-08 22:22:57 +0000 | [diff] [blame] | 5085 | case ISD::VSELECT: |
| 5086 | Result = DAG.getNode(ISD::SELECT, NewVT, Op.getOperand(0), |
| 5087 | PackVectorOp(Op.getOperand(1), NewVT), |
| 5088 | PackVectorOp(Op.getOperand(2), NewVT)); |
| 5089 | break; |
Chris Lattner | c702980 | 2006-03-18 01:44:44 +0000 | [diff] [blame] | 5090 | } |
| 5091 | |
| 5092 | if (TLI.isTypeLegal(NewVT)) |
| 5093 | Result = LegalizeOp(Result); |
| 5094 | bool isNew = PackedNodes.insert(std::make_pair(Op, Result)).second; |
| 5095 | assert(isNew && "Value already packed?"); |
| 5096 | return Result; |
| 5097 | } |
| 5098 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 5099 | |
| 5100 | // SelectionDAG::Legalize - This is the entry point for the file. |
| 5101 | // |
Chris Lattner | 9c32d3b | 2005-01-23 04:42:50 +0000 | [diff] [blame] | 5102 | void SelectionDAG::Legalize() { |
Chris Lattner | 5e46a19 | 2006-04-02 03:07:27 +0000 | [diff] [blame] | 5103 | if (ViewLegalizeDAGs) viewGraph(); |
| 5104 | |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 5105 | /// run - This is the main entry point to this class. |
| 5106 | /// |
Chris Lattner | 456a93a | 2006-01-28 07:39:30 +0000 | [diff] [blame] | 5107 | SelectionDAGLegalize(*this).LegalizeDAG(); |
Chris Lattner | 3e928bb | 2005-01-07 07:47:09 +0000 | [diff] [blame] | 5108 | } |
| 5109 | |