1 //===----- LegalizeIntegerTypes.cpp - Legalization of integer types -------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements integer type expansion and promotion for LegalizeTypes.
11 // Promotion is the act of changing a computation in an illegal type into a
12 // computation in a larger type. For example, implementing i8 arithmetic in an
13 // i32 register (often needed on powerpc).
14 // Expansion is the act of changing a computation in an illegal type into a
15 // computation in two identical registers of a smaller type. For example,
16 // implementing i64 arithmetic in two i32 registers (often needed on 32-bit
19 //===----------------------------------------------------------------------===//
21 #include "LegalizeTypes.h"
22 #include "llvm/CodeGen/PseudoSourceValue.h"
25 //===----------------------------------------------------------------------===//
26 // Integer Result Promotion
27 //===----------------------------------------------------------------------===//
29 /// PromoteIntegerResult - This method is called when a result of a node is
30 /// found to be in need of promotion to a larger type. At this point, the node
31 /// may also have invalid operands or may have other results that need
32 /// expansion, we just know that (at least) one result needs promotion.
33 void DAGTypeLegalizer::PromoteIntegerResult(SDNode *N, unsigned ResNo) {
34 DEBUG(cerr << "Promote integer result: "; N->dump(&DAG); cerr << "\n");
35 SDValue Res = SDValue();
37 // See if the target wants to custom expand this node.
38 if (CustomLowerResults(N, N->getValueType(ResNo), true))
41 switch (N->getOpcode()) {
44 cerr << "PromoteIntegerResult #" << ResNo << ": ";
45 N->dump(&DAG); cerr << "\n";
47 assert(0 && "Do not know how to promote this operator!");
49 case ISD::AssertSext: Res = PromoteIntRes_AssertSext(N); break;
50 case ISD::AssertZext: Res = PromoteIntRes_AssertZext(N); break;
51 case ISD::BIT_CONVERT: Res = PromoteIntRes_BIT_CONVERT(N); break;
52 case ISD::BSWAP: Res = PromoteIntRes_BSWAP(N); break;
53 case ISD::BUILD_PAIR: Res = PromoteIntRes_BUILD_PAIR(N); break;
54 case ISD::Constant: Res = PromoteIntRes_Constant(N); break;
55 case ISD::CONVERT_RNDSAT:
56 Res = PromoteIntRes_CONVERT_RNDSAT(N); break;
57 case ISD::CTLZ: Res = PromoteIntRes_CTLZ(N); break;
58 case ISD::CTPOP: Res = PromoteIntRes_CTPOP(N); break;
59 case ISD::CTTZ: Res = PromoteIntRes_CTTZ(N); break;
60 case ISD::EXTRACT_VECTOR_ELT:
61 Res = PromoteIntRes_EXTRACT_VECTOR_ELT(N); break;
62 case ISD::LOAD: Res = PromoteIntRes_LOAD(cast<LoadSDNode>(N));break;
63 case ISD::SELECT: Res = PromoteIntRes_SELECT(N); break;
64 case ISD::SELECT_CC: Res = PromoteIntRes_SELECT_CC(N); break;
65 case ISD::SETCC: Res = PromoteIntRes_SETCC(N); break;
66 case ISD::SHL: Res = PromoteIntRes_SHL(N); break;
67 case ISD::SIGN_EXTEND_INREG:
68 Res = PromoteIntRes_SIGN_EXTEND_INREG(N); break;
69 case ISD::SRA: Res = PromoteIntRes_SRA(N); break;
70 case ISD::SRL: Res = PromoteIntRes_SRL(N); break;
71 case ISD::TRUNCATE: Res = PromoteIntRes_TRUNCATE(N); break;
72 case ISD::UNDEF: Res = PromoteIntRes_UNDEF(N); break;
73 case ISD::VAARG: Res = PromoteIntRes_VAARG(N); break;
75 case ISD::SIGN_EXTEND:
76 case ISD::ZERO_EXTEND:
77 case ISD::ANY_EXTEND: Res = PromoteIntRes_INT_EXTEND(N); break;
80 case ISD::FP_TO_UINT: Res = PromoteIntRes_FP_TO_XINT(N); break;
87 case ISD::MUL: Res = PromoteIntRes_SimpleIntBinOp(N); break;
90 case ISD::SREM: Res = PromoteIntRes_SDIV(N); break;
93 case ISD::UREM: Res = PromoteIntRes_UDIV(N); break;
96 case ISD::SSUBO: Res = PromoteIntRes_SADDSUBO(N, ResNo); break;
98 case ISD::USUBO: Res = PromoteIntRes_UADDSUBO(N, ResNo); break;
100 case ISD::UMULO: Res = PromoteIntRes_XMULO(N, ResNo); break;
102 case ISD::ATOMIC_LOAD_ADD:
103 case ISD::ATOMIC_LOAD_SUB:
104 case ISD::ATOMIC_LOAD_AND:
105 case ISD::ATOMIC_LOAD_OR:
106 case ISD::ATOMIC_LOAD_XOR:
107 case ISD::ATOMIC_LOAD_NAND:
108 case ISD::ATOMIC_LOAD_MIN:
109 case ISD::ATOMIC_LOAD_MAX:
110 case ISD::ATOMIC_LOAD_UMIN:
111 case ISD::ATOMIC_LOAD_UMAX:
112 case ISD::ATOMIC_SWAP:
113 Res = PromoteIntRes_Atomic1(cast<AtomicSDNode>(N)); break;
115 case ISD::ATOMIC_CMP_SWAP:
116 Res = PromoteIntRes_Atomic2(cast<AtomicSDNode>(N)); break;
119 // If the result is null then the sub-method took care of registering it.
121 SetPromotedInteger(SDValue(N, ResNo), Res);
124 SDValue DAGTypeLegalizer::PromoteIntRes_AssertSext(SDNode *N) {
125 // Sign-extend the new bits, and continue the assertion.
126 SDValue Op = SExtPromotedInteger(N->getOperand(0));
127 return DAG.getNode(ISD::AssertSext, N->getDebugLoc(),
128 Op.getValueType(), Op, N->getOperand(1));
131 SDValue DAGTypeLegalizer::PromoteIntRes_AssertZext(SDNode *N) {
132 // Zero the new bits, and continue the assertion.
133 SDValue Op = ZExtPromotedInteger(N->getOperand(0));
134 return DAG.getNode(ISD::AssertZext, N->getDebugLoc(),
135 Op.getValueType(), Op, N->getOperand(1));
138 SDValue DAGTypeLegalizer::PromoteIntRes_Atomic1(AtomicSDNode *N) {
139 SDValue Op2 = GetPromotedInteger(N->getOperand(2));
140 SDValue Res = DAG.getAtomic(N->getOpcode(), N->getDebugLoc(),
142 N->getChain(), N->getBasePtr(),
143 Op2, N->getSrcValue(), N->getAlignment());
144 // Legalized the chain result - switch anything that used the old chain to
146 ReplaceValueWith(SDValue(N, 1), Res.getValue(1));
150 SDValue DAGTypeLegalizer::PromoteIntRes_Atomic2(AtomicSDNode *N) {
151 SDValue Op2 = GetPromotedInteger(N->getOperand(2));
152 SDValue Op3 = GetPromotedInteger(N->getOperand(3));
153 SDValue Res = DAG.getAtomic(N->getOpcode(), N->getDebugLoc(),
154 N->getMemoryVT(), N->getChain(), N->getBasePtr(),
155 Op2, Op3, N->getSrcValue(), N->getAlignment());
156 // Legalized the chain result - switch anything that used the old chain to
158 ReplaceValueWith(SDValue(N, 1), Res.getValue(1));
162 SDValue DAGTypeLegalizer::PromoteIntRes_BIT_CONVERT(SDNode *N) {
163 SDValue InOp = N->getOperand(0);
164 MVT InVT = InOp.getValueType();
165 MVT NInVT = TLI.getTypeToTransformTo(InVT);
166 MVT OutVT = N->getValueType(0);
167 MVT NOutVT = TLI.getTypeToTransformTo(OutVT);
168 DebugLoc dl = N->getDebugLoc();
170 switch (getTypeAction(InVT)) {
172 assert(false && "Unknown type action!");
177 if (NOutVT.bitsEq(NInVT))
178 // The input promotes to the same size. Convert the promoted value.
179 return DAG.getNode(ISD::BIT_CONVERT, dl,
180 NOutVT, GetPromotedInteger(InOp));
183 // Promote the integer operand by hand.
184 return DAG.getNode(ISD::ANY_EXTEND, dl, NOutVT, GetSoftenedFloat(InOp));
188 case ScalarizeVector:
189 // Convert the element to an integer and promote it by hand.
190 return DAG.getNode(ISD::ANY_EXTEND, dl, NOutVT,
191 BitConvertToInteger(GetScalarizedVector(InOp)));
193 // For example, i32 = BIT_CONVERT v2i16 on alpha. Convert the split
194 // pieces of the input into integers and reassemble in the final type.
196 GetSplitVector(N->getOperand(0), Lo, Hi);
197 Lo = BitConvertToInteger(Lo);
198 Hi = BitConvertToInteger(Hi);
200 if (TLI.isBigEndian())
203 InOp = DAG.getNode(ISD::ANY_EXTEND, dl,
204 MVT::getIntegerVT(NOutVT.getSizeInBits()),
205 JoinIntegers(Lo, Hi));
206 return DAG.getNode(ISD::BIT_CONVERT, dl, NOutVT, InOp);
209 if (OutVT.bitsEq(NInVT))
210 // The input is widened to the same size. Convert to the widened value.
211 return DAG.getNode(ISD::BIT_CONVERT, dl, OutVT, GetWidenedVector(InOp));
214 // Otherwise, lower the bit-convert to a store/load from the stack.
215 // Create the stack frame object. Make sure it is aligned for both
216 // the source and destination types.
217 SDValue FIPtr = DAG.CreateStackTemporary(InVT, OutVT);
218 int FI = cast<FrameIndexSDNode>(FIPtr.getNode())->getIndex();
219 const Value *SV = PseudoSourceValue::getFixedStack(FI);
221 // Emit a store to the stack slot.
222 SDValue Store = DAG.getStore(DAG.getEntryNode(), dl, InOp, FIPtr, SV, 0);
224 // Result is an extending load from the stack slot.
225 return DAG.getExtLoad(ISD::EXTLOAD, dl, NOutVT, Store, FIPtr, SV, 0, OutVT);
228 SDValue DAGTypeLegalizer::PromoteIntRes_BSWAP(SDNode *N) {
229 SDValue Op = GetPromotedInteger(N->getOperand(0));
230 MVT OVT = N->getValueType(0);
231 MVT NVT = Op.getValueType();
232 DebugLoc dl = N->getDebugLoc();
234 unsigned DiffBits = NVT.getSizeInBits() - OVT.getSizeInBits();
235 return DAG.getNode(ISD::SRL, dl, NVT, DAG.getNode(ISD::BSWAP, dl, NVT, Op),
236 DAG.getConstant(DiffBits, TLI.getPointerTy()));
239 SDValue DAGTypeLegalizer::PromoteIntRes_BUILD_PAIR(SDNode *N) {
240 // The pair element type may be legal, or may not promote to the same type as
241 // the result, for example i14 = BUILD_PAIR (i7, i7). Handle all cases.
242 return DAG.getNode(ISD::ANY_EXTEND, N->getDebugLoc(),
243 TLI.getTypeToTransformTo(N->getValueType(0)),
244 JoinIntegers(N->getOperand(0), N->getOperand(1)));
247 SDValue DAGTypeLegalizer::PromoteIntRes_Constant(SDNode *N) {
248 MVT VT = N->getValueType(0);
249 // FIXME there is no actual debug info here
250 DebugLoc dl = N->getDebugLoc();
251 // Zero extend things like i1, sign extend everything else. It shouldn't
252 // matter in theory which one we pick, but this tends to give better code?
253 unsigned Opc = VT.isByteSized() ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
254 SDValue Result = DAG.getNode(Opc, dl, TLI.getTypeToTransformTo(VT),
256 assert(isa<ConstantSDNode>(Result) && "Didn't constant fold ext?");
260 SDValue DAGTypeLegalizer::PromoteIntRes_CONVERT_RNDSAT(SDNode *N) {
261 ISD::CvtCode CvtCode = cast<CvtRndSatSDNode>(N)->getCvtCode();
262 assert ((CvtCode == ISD::CVT_SS || CvtCode == ISD::CVT_SU ||
263 CvtCode == ISD::CVT_US || CvtCode == ISD::CVT_UU ||
264 CvtCode == ISD::CVT_SF || CvtCode == ISD::CVT_UF) &&
265 "can only promote integers");
266 MVT OutVT = TLI.getTypeToTransformTo(N->getValueType(0));
267 return DAG.getConvertRndSat(OutVT, N->getDebugLoc(), N->getOperand(0),
268 N->getOperand(1), N->getOperand(2),
269 N->getOperand(3), N->getOperand(4), CvtCode);
272 SDValue DAGTypeLegalizer::PromoteIntRes_CTLZ(SDNode *N) {
273 // Zero extend to the promoted type and do the count there.
274 SDValue Op = ZExtPromotedInteger(N->getOperand(0));
275 DebugLoc dl = N->getDebugLoc();
276 MVT OVT = N->getValueType(0);
277 MVT NVT = Op.getValueType();
278 Op = DAG.getNode(ISD::CTLZ, dl, NVT, Op);
279 // Subtract off the extra leading bits in the bigger type.
280 return DAG.getNode(ISD::SUB, dl, NVT, Op,
281 DAG.getConstant(NVT.getSizeInBits() -
282 OVT.getSizeInBits(), NVT));
285 SDValue DAGTypeLegalizer::PromoteIntRes_CTPOP(SDNode *N) {
286 // Zero extend to the promoted type and do the count there.
287 SDValue Op = ZExtPromotedInteger(N->getOperand(0));
288 return DAG.getNode(ISD::CTPOP, N->getDebugLoc(), Op.getValueType(), Op);
291 SDValue DAGTypeLegalizer::PromoteIntRes_CTTZ(SDNode *N) {
292 SDValue Op = GetPromotedInteger(N->getOperand(0));
293 MVT OVT = N->getValueType(0);
294 MVT NVT = Op.getValueType();
295 DebugLoc dl = N->getDebugLoc();
296 // The count is the same in the promoted type except if the original
297 // value was zero. This can be handled by setting the bit just off
298 // the top of the original type.
299 APInt TopBit(NVT.getSizeInBits(), 0);
300 TopBit.set(OVT.getSizeInBits());
301 Op = DAG.getNode(ISD::OR, dl, NVT, Op, DAG.getConstant(TopBit, NVT));
302 return DAG.getNode(ISD::CTTZ, dl, NVT, Op);
305 SDValue DAGTypeLegalizer::PromoteIntRes_EXTRACT_VECTOR_ELT(SDNode *N) {
306 MVT OldVT = N->getValueType(0);
307 SDValue OldVec = N->getOperand(0);
308 if (getTypeAction(OldVec.getValueType()) == WidenVector)
309 OldVec = GetWidenedVector(N->getOperand(0));
310 unsigned OldElts = OldVec.getValueType().getVectorNumElements();
311 DebugLoc dl = N->getDebugLoc();
314 assert(!isTypeLegal(OldVec.getValueType()) &&
315 "Legal one-element vector of a type needing promotion!");
316 // It is tempting to follow GetScalarizedVector by a call to
317 // GetPromotedInteger, but this would be wrong because the
318 // scalarized value may not yet have been processed.
319 return DAG.getNode(ISD::ANY_EXTEND, dl, TLI.getTypeToTransformTo(OldVT),
320 GetScalarizedVector(OldVec));
323 // Convert to a vector half as long with an element type of twice the width,
324 // for example <4 x i16> -> <2 x i32>.
325 assert(!(OldElts & 1) && "Odd length vectors not supported!");
326 MVT NewVT = MVT::getIntegerVT(2 * OldVT.getSizeInBits());
327 assert(OldVT.isSimple() && NewVT.isSimple());
329 SDValue NewVec = DAG.getNode(ISD::BIT_CONVERT, dl,
330 MVT::getVectorVT(NewVT, OldElts / 2),
333 // Extract the element at OldIdx / 2 from the new vector.
334 SDValue OldIdx = N->getOperand(1);
335 SDValue NewIdx = DAG.getNode(ISD::SRL, dl, OldIdx.getValueType(), OldIdx,
336 DAG.getConstant(1, TLI.getPointerTy()));
337 SDValue Elt = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, NewVT, NewVec, NewIdx);
339 // Select the appropriate half of the element: Lo if OldIdx was even,
342 SDValue Hi = DAG.getNode(ISD::SRL, dl, NewVT, Elt,
343 DAG.getConstant(OldVT.getSizeInBits(),
344 TLI.getPointerTy()));
345 if (TLI.isBigEndian())
348 // Extend to the promoted type.
349 SDValue Odd = DAG.getNode(ISD::TRUNCATE, dl, MVT::i1, OldIdx);
350 SDValue Res = DAG.getNode(ISD::SELECT, dl, NewVT, Odd, Hi, Lo);
351 return DAG.getNode(ISD::ANY_EXTEND, dl, TLI.getTypeToTransformTo(OldVT), Res);
354 SDValue DAGTypeLegalizer::PromoteIntRes_FP_TO_XINT(SDNode *N) {
355 MVT NVT = TLI.getTypeToTransformTo(N->getValueType(0));
356 unsigned NewOpc = N->getOpcode();
357 DebugLoc dl = N->getDebugLoc();
359 // If we're promoting a UINT to a larger size, check to see if the new node
360 // will be legal. If it isn't, check to see if FP_TO_SINT is legal, since
361 // we can use that instead. This allows us to generate better code for
362 // FP_TO_UINT for small destination sizes on targets where FP_TO_UINT is not
363 // legal, such as PowerPC.
364 if (N->getOpcode() == ISD::FP_TO_UINT &&
365 !TLI.isOperationLegalOrCustom(ISD::FP_TO_UINT, NVT) &&
366 TLI.isOperationLegalOrCustom(ISD::FP_TO_SINT, NVT))
367 NewOpc = ISD::FP_TO_SINT;
369 SDValue Res = DAG.getNode(NewOpc, dl, NVT, N->getOperand(0));
371 // Assert that the converted value fits in the original type. If it doesn't
372 // (eg: because the value being converted is too big), then the result of the
373 // original operation was undefined anyway, so the assert is still correct.
374 return DAG.getNode(N->getOpcode() == ISD::FP_TO_UINT ?
375 ISD::AssertZext : ISD::AssertSext, dl,
376 NVT, Res, DAG.getValueType(N->getValueType(0)));
379 SDValue DAGTypeLegalizer::PromoteIntRes_INT_EXTEND(SDNode *N) {
380 MVT NVT = TLI.getTypeToTransformTo(N->getValueType(0));
381 DebugLoc dl = N->getDebugLoc();
383 if (getTypeAction(N->getOperand(0).getValueType()) == PromoteInteger) {
384 SDValue Res = GetPromotedInteger(N->getOperand(0));
385 assert(Res.getValueType().bitsLE(NVT) && "Extension doesn't make sense!");
387 // If the result and operand types are the same after promotion, simplify
388 // to an in-register extension.
389 if (NVT == Res.getValueType()) {
390 // The high bits are not guaranteed to be anything. Insert an extend.
391 if (N->getOpcode() == ISD::SIGN_EXTEND)
392 return DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, NVT, Res,
393 DAG.getValueType(N->getOperand(0).getValueType()));
394 if (N->getOpcode() == ISD::ZERO_EXTEND)
395 return DAG.getZeroExtendInReg(Res, dl, N->getOperand(0).getValueType());
396 assert(N->getOpcode() == ISD::ANY_EXTEND && "Unknown integer extension!");
401 // Otherwise, just extend the original operand all the way to the larger type.
402 return DAG.getNode(N->getOpcode(), dl, NVT, N->getOperand(0));
405 SDValue DAGTypeLegalizer::PromoteIntRes_LOAD(LoadSDNode *N) {
406 assert(ISD::isUNINDEXEDLoad(N) && "Indexed load during type legalization!");
407 MVT NVT = TLI.getTypeToTransformTo(N->getValueType(0));
408 ISD::LoadExtType ExtType =
409 ISD::isNON_EXTLoad(N) ? ISD::EXTLOAD : N->getExtensionType();
410 DebugLoc dl = N->getDebugLoc();
411 SDValue Res = DAG.getExtLoad(ExtType, dl, NVT, N->getChain(), N->getBasePtr(),
412 N->getSrcValue(), N->getSrcValueOffset(),
413 N->getMemoryVT(), N->isVolatile(),
416 // Legalized the chain result - switch anything that used the old chain to
418 ReplaceValueWith(SDValue(N, 1), Res.getValue(1));
422 /// Promote the overflow flag of an overflowing arithmetic node.
423 SDValue DAGTypeLegalizer::PromoteIntRes_Overflow(SDNode *N) {
424 // Simply change the return type of the boolean result.
425 MVT NVT = TLI.getTypeToTransformTo(N->getValueType(1));
426 MVT ValueVTs[] = { N->getValueType(0), NVT };
427 SDValue Ops[] = { N->getOperand(0), N->getOperand(1) };
428 SDValue Res = DAG.getNode(N->getOpcode(), N->getDebugLoc(),
429 DAG.getVTList(ValueVTs, 2), Ops, 2);
431 // Modified the sum result - switch anything that used the old sum to use
433 ReplaceValueWith(SDValue(N, 0), Res);
435 return SDValue(Res.getNode(), 1);
438 SDValue DAGTypeLegalizer::PromoteIntRes_SADDSUBO(SDNode *N, unsigned ResNo) {
440 return PromoteIntRes_Overflow(N);
442 // The operation overflowed iff the result in the larger type is not the
443 // sign extension of its truncation to the original type.
444 SDValue LHS = SExtPromotedInteger(N->getOperand(0));
445 SDValue RHS = SExtPromotedInteger(N->getOperand(1));
446 MVT OVT = N->getOperand(0).getValueType();
447 MVT NVT = LHS.getValueType();
448 DebugLoc dl = N->getDebugLoc();
450 // Do the arithmetic in the larger type.
451 unsigned Opcode = N->getOpcode() == ISD::SADDO ? ISD::ADD : ISD::SUB;
452 SDValue Res = DAG.getNode(Opcode, dl, NVT, LHS, RHS);
454 // Calculate the overflow flag: sign extend the arithmetic result from
455 // the original type.
456 SDValue Ofl = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, NVT, Res,
457 DAG.getValueType(OVT));
458 // Overflowed if and only if this is not equal to Res.
459 Ofl = DAG.getSetCC(dl, N->getValueType(1), Ofl, Res, ISD::SETNE);
461 // Use the calculated overflow everywhere.
462 ReplaceValueWith(SDValue(N, 1), Ofl);
467 SDValue DAGTypeLegalizer::PromoteIntRes_SDIV(SDNode *N) {
468 // Sign extend the input.
469 SDValue LHS = SExtPromotedInteger(N->getOperand(0));
470 SDValue RHS = SExtPromotedInteger(N->getOperand(1));
471 return DAG.getNode(N->getOpcode(), N->getDebugLoc(),
472 LHS.getValueType(), LHS, RHS);
475 SDValue DAGTypeLegalizer::PromoteIntRes_SELECT(SDNode *N) {
476 SDValue LHS = GetPromotedInteger(N->getOperand(1));
477 SDValue RHS = GetPromotedInteger(N->getOperand(2));
478 return DAG.getNode(ISD::SELECT, N->getDebugLoc(),
479 LHS.getValueType(), N->getOperand(0),LHS,RHS);
482 SDValue DAGTypeLegalizer::PromoteIntRes_SELECT_CC(SDNode *N) {
483 SDValue LHS = GetPromotedInteger(N->getOperand(2));
484 SDValue RHS = GetPromotedInteger(N->getOperand(3));
485 return DAG.getNode(ISD::SELECT_CC, N->getDebugLoc(),
486 LHS.getValueType(), N->getOperand(0),
487 N->getOperand(1), LHS, RHS, N->getOperand(4));
490 SDValue DAGTypeLegalizer::PromoteIntRes_SETCC(SDNode *N) {
491 MVT SVT = TLI.getSetCCResultType(N->getOperand(0).getValueType());
492 assert(isTypeLegal(SVT) && "Illegal SetCC type!");
493 DebugLoc dl = N->getDebugLoc();
495 // Get the SETCC result using the canonical SETCC type.
496 SDValue SetCC = DAG.getNode(ISD::SETCC, dl, SVT, N->getOperand(0),
497 N->getOperand(1), N->getOperand(2));
499 // Convert to the expected type.
500 MVT NVT = TLI.getTypeToTransformTo(N->getValueType(0));
501 assert(NVT.bitsLE(SVT) && "Integer type overpromoted?");
502 return DAG.getNode(ISD::TRUNCATE, dl, NVT, SetCC);
505 SDValue DAGTypeLegalizer::PromoteIntRes_SHL(SDNode *N) {
506 return DAG.getNode(ISD::SHL, N->getDebugLoc(),
507 TLI.getTypeToTransformTo(N->getValueType(0)),
508 GetPromotedInteger(N->getOperand(0)), N->getOperand(1));
511 SDValue DAGTypeLegalizer::PromoteIntRes_SIGN_EXTEND_INREG(SDNode *N) {
512 SDValue Op = GetPromotedInteger(N->getOperand(0));
513 return DAG.getNode(ISD::SIGN_EXTEND_INREG, N->getDebugLoc(),
514 Op.getValueType(), Op, N->getOperand(1));
517 SDValue DAGTypeLegalizer::PromoteIntRes_SimpleIntBinOp(SDNode *N) {
518 // The input may have strange things in the top bits of the registers, but
519 // these operations don't care. They may have weird bits going out, but
520 // that too is okay if they are integer operations.
521 SDValue LHS = GetPromotedInteger(N->getOperand(0));
522 SDValue RHS = GetPromotedInteger(N->getOperand(1));
523 return DAG.getNode(N->getOpcode(), N->getDebugLoc(),
524 LHS.getValueType(), LHS, RHS);
527 SDValue DAGTypeLegalizer::PromoteIntRes_SRA(SDNode *N) {
528 // The input value must be properly sign extended.
529 SDValue Res = SExtPromotedInteger(N->getOperand(0));
530 return DAG.getNode(ISD::SRA, N->getDebugLoc(),
531 Res.getValueType(), Res, N->getOperand(1));
534 SDValue DAGTypeLegalizer::PromoteIntRes_SRL(SDNode *N) {
535 // The input value must be properly zero extended.
536 MVT VT = N->getValueType(0);
537 MVT NVT = TLI.getTypeToTransformTo(VT);
538 SDValue Res = ZExtPromotedInteger(N->getOperand(0));
539 return DAG.getNode(ISD::SRL, N->getDebugLoc(), NVT, Res, N->getOperand(1));
542 SDValue DAGTypeLegalizer::PromoteIntRes_TRUNCATE(SDNode *N) {
543 MVT NVT = TLI.getTypeToTransformTo(N->getValueType(0));
546 switch (getTypeAction(N->getOperand(0).getValueType())) {
547 default: assert(0 && "Unknown type action!");
550 Res = N->getOperand(0);
553 Res = GetPromotedInteger(N->getOperand(0));
557 // Truncate to NVT instead of VT
558 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), NVT, Res);
561 SDValue DAGTypeLegalizer::PromoteIntRes_UADDSUBO(SDNode *N, unsigned ResNo) {
563 return PromoteIntRes_Overflow(N);
565 // The operation overflowed iff the result in the larger type is not the
566 // zero extension of its truncation to the original type.
567 SDValue LHS = ZExtPromotedInteger(N->getOperand(0));
568 SDValue RHS = ZExtPromotedInteger(N->getOperand(1));
569 MVT OVT = N->getOperand(0).getValueType();
570 MVT NVT = LHS.getValueType();
571 DebugLoc dl = N->getDebugLoc();
573 // Do the arithmetic in the larger type.
574 unsigned Opcode = N->getOpcode() == ISD::UADDO ? ISD::ADD : ISD::SUB;
575 SDValue Res = DAG.getNode(Opcode, dl, NVT, LHS, RHS);
577 // Calculate the overflow flag: zero extend the arithmetic result from
578 // the original type.
579 SDValue Ofl = DAG.getZeroExtendInReg(Res, dl, OVT);
580 // Overflowed if and only if this is not equal to Res.
581 Ofl = DAG.getSetCC(dl, N->getValueType(1), Ofl, Res, ISD::SETNE);
583 // Use the calculated overflow everywhere.
584 ReplaceValueWith(SDValue(N, 1), Ofl);
589 SDValue DAGTypeLegalizer::PromoteIntRes_UDIV(SDNode *N) {
590 // Zero extend the input.
591 SDValue LHS = ZExtPromotedInteger(N->getOperand(0));
592 SDValue RHS = ZExtPromotedInteger(N->getOperand(1));
593 return DAG.getNode(N->getOpcode(), N->getDebugLoc(),
594 LHS.getValueType(), LHS, RHS);
597 SDValue DAGTypeLegalizer::PromoteIntRes_UNDEF(SDNode *N) {
598 return DAG.getUNDEF(TLI.getTypeToTransformTo(N->getValueType(0)));
601 SDValue DAGTypeLegalizer::PromoteIntRes_VAARG(SDNode *N) {
602 SDValue Chain = N->getOperand(0); // Get the chain.
603 SDValue Ptr = N->getOperand(1); // Get the pointer.
604 MVT VT = N->getValueType(0);
605 DebugLoc dl = N->getDebugLoc();
607 MVT RegVT = TLI.getRegisterType(VT);
608 unsigned NumRegs = TLI.getNumRegisters(VT);
609 // The argument is passed as NumRegs registers of type RegVT.
611 SmallVector<SDValue, 8> Parts(NumRegs);
612 for (unsigned i = 0; i < NumRegs; ++i) {
613 Parts[i] = DAG.getVAArg(RegVT, dl, Chain, Ptr, N->getOperand(2));
614 Chain = Parts[i].getValue(1);
617 // Handle endianness of the load.
618 if (TLI.isBigEndian())
619 std::reverse(Parts.begin(), Parts.end());
621 // Assemble the parts in the promoted type.
622 MVT NVT = TLI.getTypeToTransformTo(N->getValueType(0));
623 SDValue Res = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Parts[0]);
624 for (unsigned i = 1; i < NumRegs; ++i) {
625 SDValue Part = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Parts[i]);
626 // Shift it to the right position and "or" it in.
627 Part = DAG.getNode(ISD::SHL, dl, NVT, Part,
628 DAG.getConstant(i * RegVT.getSizeInBits(),
629 TLI.getPointerTy()));
630 Res = DAG.getNode(ISD::OR, dl, NVT, Res, Part);
633 // Modified the chain result - switch anything that used the old chain to
635 ReplaceValueWith(SDValue(N, 1), Chain);
640 SDValue DAGTypeLegalizer::PromoteIntRes_XMULO(SDNode *N, unsigned ResNo) {
641 assert(ResNo == 1 && "Only boolean result promotion currently supported!");
642 return PromoteIntRes_Overflow(N);
645 //===----------------------------------------------------------------------===//
646 // Integer Operand Promotion
647 //===----------------------------------------------------------------------===//
649 /// PromoteIntegerOperand - This method is called when the specified operand of
650 /// the specified node is found to need promotion. At this point, all of the
651 /// result types of the node are known to be legal, but other operands of the
652 /// node may need promotion or expansion as well as the specified one.
653 bool DAGTypeLegalizer::PromoteIntegerOperand(SDNode *N, unsigned OpNo) {
654 DEBUG(cerr << "Promote integer operand: "; N->dump(&DAG); cerr << "\n");
655 SDValue Res = SDValue();
657 if (CustomLowerResults(N, N->getOperand(OpNo).getValueType(), false))
660 switch (N->getOpcode()) {
663 cerr << "PromoteIntegerOperand Op #" << OpNo << ": ";
664 N->dump(&DAG); cerr << "\n";
666 assert(0 && "Do not know how to promote this operator's operand!");
669 case ISD::ANY_EXTEND: Res = PromoteIntOp_ANY_EXTEND(N); break;
670 case ISD::BR_CC: Res = PromoteIntOp_BR_CC(N, OpNo); break;
671 case ISD::BRCOND: Res = PromoteIntOp_BRCOND(N, OpNo); break;
672 case ISD::BUILD_PAIR: Res = PromoteIntOp_BUILD_PAIR(N); break;
673 case ISD::BUILD_VECTOR: Res = PromoteIntOp_BUILD_VECTOR(N); break;
674 case ISD::CONVERT_RNDSAT:
675 Res = PromoteIntOp_CONVERT_RNDSAT(N); break;
676 case ISD::INSERT_VECTOR_ELT:
677 Res = PromoteIntOp_INSERT_VECTOR_ELT(N, OpNo);break;
678 case ISD::MEMBARRIER: Res = PromoteIntOp_MEMBARRIER(N); break;
679 case ISD::SELECT: Res = PromoteIntOp_SELECT(N, OpNo); break;
680 case ISD::SELECT_CC: Res = PromoteIntOp_SELECT_CC(N, OpNo); break;
681 case ISD::SETCC: Res = PromoteIntOp_SETCC(N, OpNo); break;
682 case ISD::SIGN_EXTEND: Res = PromoteIntOp_SIGN_EXTEND(N); break;
683 case ISD::SINT_TO_FP: Res = PromoteIntOp_SINT_TO_FP(N); break;
684 case ISD::STORE: Res = PromoteIntOp_STORE(cast<StoreSDNode>(N),
686 case ISD::TRUNCATE: Res = PromoteIntOp_TRUNCATE(N); break;
687 case ISD::UINT_TO_FP: Res = PromoteIntOp_UINT_TO_FP(N); break;
688 case ISD::ZERO_EXTEND: Res = PromoteIntOp_ZERO_EXTEND(N); break;
694 case ISD::ROTR: Res = PromoteIntOp_Shift(N); break;
697 // If the result is null, the sub-method took care of registering results etc.
698 if (!Res.getNode()) return false;
700 // If the result is N, the sub-method updated N in place. Tell the legalizer
702 if (Res.getNode() == N)
705 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
706 "Invalid operand expansion");
708 ReplaceValueWith(SDValue(N, 0), Res);
712 /// PromoteSetCCOperands - Promote the operands of a comparison. This code is
713 /// shared among BR_CC, SELECT_CC, and SETCC handlers.
714 void DAGTypeLegalizer::PromoteSetCCOperands(SDValue &NewLHS,SDValue &NewRHS,
715 ISD::CondCode CCCode) {
716 // We have to insert explicit sign or zero extends. Note that we could
717 // insert sign extends for ALL conditions, but zero extend is cheaper on
718 // many machines (an AND instead of two shifts), so prefer it.
720 default: assert(0 && "Unknown integer comparison!");
727 // ALL of these operations will work if we either sign or zero extend
728 // the operands (including the unsigned comparisons!). Zero extend is
729 // usually a simpler/cheaper operation, so prefer it.
730 NewLHS = ZExtPromotedInteger(NewLHS);
731 NewRHS = ZExtPromotedInteger(NewRHS);
737 NewLHS = SExtPromotedInteger(NewLHS);
738 NewRHS = SExtPromotedInteger(NewRHS);
743 SDValue DAGTypeLegalizer::PromoteIntOp_ANY_EXTEND(SDNode *N) {
744 SDValue Op = GetPromotedInteger(N->getOperand(0));
745 return DAG.getNode(ISD::ANY_EXTEND, N->getDebugLoc(), N->getValueType(0), Op);
748 SDValue DAGTypeLegalizer::PromoteIntOp_BR_CC(SDNode *N, unsigned OpNo) {
749 assert(OpNo == 2 && "Don't know how to promote this operand!");
751 SDValue LHS = N->getOperand(2);
752 SDValue RHS = N->getOperand(3);
753 PromoteSetCCOperands(LHS, RHS, cast<CondCodeSDNode>(N->getOperand(1))->get());
755 // The chain (Op#0), CC (#1) and basic block destination (Op#4) are always
757 return DAG.UpdateNodeOperands(SDValue(N, 0), N->getOperand(0),
758 N->getOperand(1), LHS, RHS, N->getOperand(4));
761 SDValue DAGTypeLegalizer::PromoteIntOp_BRCOND(SDNode *N, unsigned OpNo) {
762 assert(OpNo == 1 && "only know how to promote condition");
764 // Promote all the way up to the canonical SetCC type.
765 MVT SVT = TLI.getSetCCResultType(MVT::Other);
766 SDValue Cond = PromoteTargetBoolean(N->getOperand(1), SVT);
768 // The chain (Op#0) and basic block destination (Op#2) are always legal types.
769 return DAG.UpdateNodeOperands(SDValue(N, 0), N->getOperand(0), Cond,
773 SDValue DAGTypeLegalizer::PromoteIntOp_BUILD_PAIR(SDNode *N) {
774 // Since the result type is legal, the operands must promote to it.
775 MVT OVT = N->getOperand(0).getValueType();
776 SDValue Lo = ZExtPromotedInteger(N->getOperand(0));
777 SDValue Hi = GetPromotedInteger(N->getOperand(1));
778 assert(Lo.getValueType() == N->getValueType(0) && "Operand over promoted?");
779 DebugLoc dl = N->getDebugLoc();
781 Hi = DAG.getNode(ISD::SHL, dl, N->getValueType(0), Hi,
782 DAG.getConstant(OVT.getSizeInBits(), TLI.getPointerTy()));
783 return DAG.getNode(ISD::OR, dl, N->getValueType(0), Lo, Hi);
786 SDValue DAGTypeLegalizer::PromoteIntOp_BUILD_VECTOR(SDNode *N) {
787 // The vector type is legal but the element type is not. This implies
788 // that the vector is a power-of-two in length and that the element
789 // type does not have a strange size (eg: it is not i1).
790 MVT VecVT = N->getValueType(0);
791 unsigned NumElts = VecVT.getVectorNumElements();
792 assert(!(NumElts & 1) && "Legal vector of one illegal element?");
793 DebugLoc dl = N->getDebugLoc();
795 // Build a vector of half the length out of elements of twice the bitwidth.
796 // For example <4 x i16> -> <2 x i32>.
797 MVT OldVT = N->getOperand(0).getValueType();
798 MVT NewVT = MVT::getIntegerVT(2 * OldVT.getSizeInBits());
799 assert(OldVT.isSimple() && NewVT.isSimple());
801 std::vector<SDValue> NewElts;
802 NewElts.reserve(NumElts/2);
804 for (unsigned i = 0; i < NumElts; i += 2) {
805 // Combine two successive elements into one promoted element.
806 SDValue Lo = N->getOperand(i);
807 SDValue Hi = N->getOperand(i+1);
808 if (TLI.isBigEndian())
810 NewElts.push_back(JoinIntegers(Lo, Hi));
813 SDValue NewVec = DAG.getBUILD_VECTOR(MVT::getVectorVT(NewVT, NewElts.size()),
814 dl, &NewElts[0], NewElts.size());
816 // Convert the new vector to the old vector type.
817 return DAG.getNode(ISD::BIT_CONVERT, dl, VecVT, NewVec);
820 SDValue DAGTypeLegalizer::PromoteIntOp_CONVERT_RNDSAT(SDNode *N) {
821 ISD::CvtCode CvtCode = cast<CvtRndSatSDNode>(N)->getCvtCode();
822 assert ((CvtCode == ISD::CVT_SS || CvtCode == ISD::CVT_SU ||
823 CvtCode == ISD::CVT_US || CvtCode == ISD::CVT_UU ||
824 CvtCode == ISD::CVT_FS || CvtCode == ISD::CVT_FU) &&
825 "can only promote integer arguments");
826 SDValue InOp = GetPromotedInteger(N->getOperand(0));
827 return DAG.getConvertRndSat(N->getValueType(0), N->getDebugLoc(), InOp,
828 N->getOperand(1), N->getOperand(2),
829 N->getOperand(3), N->getOperand(4), CvtCode);
832 SDValue DAGTypeLegalizer::PromoteIntOp_INSERT_VECTOR_ELT(SDNode *N,
835 // Promote the inserted value. This is valid because the type does not
836 // have to match the vector element type.
838 // Check that any extra bits introduced will be truncated away.
839 assert(N->getOperand(1).getValueType().getSizeInBits() >=
840 N->getValueType(0).getVectorElementType().getSizeInBits() &&
841 "Type of inserted value narrower than vector element type!");
842 return DAG.UpdateNodeOperands(SDValue(N, 0), N->getOperand(0),
843 GetPromotedInteger(N->getOperand(1)),
847 assert(OpNo == 2 && "Different operand and result vector types?");
849 // Promote the index.
850 SDValue Idx = ZExtPromotedInteger(N->getOperand(2));
851 return DAG.UpdateNodeOperands(SDValue(N, 0), N->getOperand(0),
852 N->getOperand(1), Idx);
855 SDValue DAGTypeLegalizer::PromoteIntOp_MEMBARRIER(SDNode *N) {
857 DebugLoc dl = N->getDebugLoc();
858 NewOps[0] = N->getOperand(0);
859 for (unsigned i = 1; i < array_lengthof(NewOps); ++i) {
860 SDValue Flag = GetPromotedInteger(N->getOperand(i));
861 NewOps[i] = DAG.getZeroExtendInReg(Flag, dl, MVT::i1);
863 return DAG.UpdateNodeOperands(SDValue (N, 0), NewOps,
864 array_lengthof(NewOps));
867 SDValue DAGTypeLegalizer::PromoteIntOp_SELECT(SDNode *N, unsigned OpNo) {
868 assert(OpNo == 0 && "Only know how to promote condition");
870 // Promote all the way up to the canonical SetCC type.
871 MVT SVT = TLI.getSetCCResultType(N->getOperand(1).getValueType());
872 SDValue Cond = PromoteTargetBoolean(N->getOperand(0), SVT);
874 return DAG.UpdateNodeOperands(SDValue(N, 0), Cond,
875 N->getOperand(1), N->getOperand(2));
878 SDValue DAGTypeLegalizer::PromoteIntOp_SELECT_CC(SDNode *N, unsigned OpNo) {
879 assert(OpNo == 0 && "Don't know how to promote this operand!");
881 SDValue LHS = N->getOperand(0);
882 SDValue RHS = N->getOperand(1);
883 PromoteSetCCOperands(LHS, RHS, cast<CondCodeSDNode>(N->getOperand(4))->get());
885 // The CC (#4) and the possible return values (#2 and #3) have legal types.
886 return DAG.UpdateNodeOperands(SDValue(N, 0), LHS, RHS, N->getOperand(2),
887 N->getOperand(3), N->getOperand(4));
890 SDValue DAGTypeLegalizer::PromoteIntOp_SETCC(SDNode *N, unsigned OpNo) {
891 assert(OpNo == 0 && "Don't know how to promote this operand!");
893 SDValue LHS = N->getOperand(0);
894 SDValue RHS = N->getOperand(1);
895 PromoteSetCCOperands(LHS, RHS, cast<CondCodeSDNode>(N->getOperand(2))->get());
897 // The CC (#2) is always legal.
898 return DAG.UpdateNodeOperands(SDValue(N, 0), LHS, RHS, N->getOperand(2));
901 SDValue DAGTypeLegalizer::PromoteIntOp_Shift(SDNode *N) {
902 return DAG.UpdateNodeOperands(SDValue(N, 0), N->getOperand(0),
903 ZExtPromotedInteger(N->getOperand(1)));
906 SDValue DAGTypeLegalizer::PromoteIntOp_SIGN_EXTEND(SDNode *N) {
907 SDValue Op = GetPromotedInteger(N->getOperand(0));
908 DebugLoc dl = N->getDebugLoc();
909 Op = DAG.getNode(ISD::ANY_EXTEND, dl, N->getValueType(0), Op);
910 return DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Op.getValueType(),
911 Op, DAG.getValueType(N->getOperand(0).getValueType()));
914 SDValue DAGTypeLegalizer::PromoteIntOp_SINT_TO_FP(SDNode *N) {
915 return DAG.UpdateNodeOperands(SDValue(N, 0),
916 SExtPromotedInteger(N->getOperand(0)));
919 SDValue DAGTypeLegalizer::PromoteIntOp_STORE(StoreSDNode *N, unsigned OpNo){
920 assert(ISD::isUNINDEXEDStore(N) && "Indexed store during type legalization!");
921 SDValue Ch = N->getChain(), Ptr = N->getBasePtr();
922 int SVOffset = N->getSrcValueOffset();
923 unsigned Alignment = N->getAlignment();
924 bool isVolatile = N->isVolatile();
925 DebugLoc dl = N->getDebugLoc();
927 SDValue Val = GetPromotedInteger(N->getValue()); // Get promoted value.
929 // Truncate the value and store the result.
930 return DAG.getTruncStore(Ch, dl, Val, Ptr, N->getSrcValue(),
931 SVOffset, N->getMemoryVT(),
932 isVolatile, Alignment);
935 SDValue DAGTypeLegalizer::PromoteIntOp_TRUNCATE(SDNode *N) {
936 SDValue Op = GetPromotedInteger(N->getOperand(0));
937 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), N->getValueType(0), Op);
940 SDValue DAGTypeLegalizer::PromoteIntOp_UINT_TO_FP(SDNode *N) {
941 return DAG.UpdateNodeOperands(SDValue(N, 0),
942 ZExtPromotedInteger(N->getOperand(0)));
945 SDValue DAGTypeLegalizer::PromoteIntOp_ZERO_EXTEND(SDNode *N) {
946 DebugLoc dl = N->getDebugLoc();
947 SDValue Op = GetPromotedInteger(N->getOperand(0));
948 Op = DAG.getNode(ISD::ANY_EXTEND, dl, N->getValueType(0), Op);
949 return DAG.getZeroExtendInReg(Op, dl, N->getOperand(0).getValueType());
953 //===----------------------------------------------------------------------===//
954 // Integer Result Expansion
955 //===----------------------------------------------------------------------===//
957 /// ExpandIntegerResult - This method is called when the specified result of the
958 /// specified node is found to need expansion. At this point, the node may also
959 /// have invalid operands or may have other results that need promotion, we just
960 /// know that (at least) one result needs expansion.
961 void DAGTypeLegalizer::ExpandIntegerResult(SDNode *N, unsigned ResNo) {
962 DEBUG(cerr << "Expand integer result: "; N->dump(&DAG); cerr << "\n");
966 // See if the target wants to custom expand this node.
967 if (CustomLowerResults(N, N->getValueType(ResNo), true))
970 switch (N->getOpcode()) {
973 cerr << "ExpandIntegerResult #" << ResNo << ": ";
974 N->dump(&DAG); cerr << "\n";
976 assert(0 && "Do not know how to expand the result of this operator!");
979 case ISD::MERGE_VALUES: SplitRes_MERGE_VALUES(N, Lo, Hi); break;
980 case ISD::SELECT: SplitRes_SELECT(N, Lo, Hi); break;
981 case ISD::SELECT_CC: SplitRes_SELECT_CC(N, Lo, Hi); break;
982 case ISD::UNDEF: SplitRes_UNDEF(N, Lo, Hi); break;
984 case ISD::BIT_CONVERT: ExpandRes_BIT_CONVERT(N, Lo, Hi); break;
985 case ISD::BUILD_PAIR: ExpandRes_BUILD_PAIR(N, Lo, Hi); break;
986 case ISD::EXTRACT_ELEMENT: ExpandRes_EXTRACT_ELEMENT(N, Lo, Hi); break;
987 case ISD::EXTRACT_VECTOR_ELT: ExpandRes_EXTRACT_VECTOR_ELT(N, Lo, Hi); break;
988 case ISD::VAARG: ExpandRes_VAARG(N, Lo, Hi); break;
990 case ISD::ANY_EXTEND: ExpandIntRes_ANY_EXTEND(N, Lo, Hi); break;
991 case ISD::AssertSext: ExpandIntRes_AssertSext(N, Lo, Hi); break;
992 case ISD::AssertZext: ExpandIntRes_AssertZext(N, Lo, Hi); break;
993 case ISD::BSWAP: ExpandIntRes_BSWAP(N, Lo, Hi); break;
994 case ISD::Constant: ExpandIntRes_Constant(N, Lo, Hi); break;
995 case ISD::CTLZ: ExpandIntRes_CTLZ(N, Lo, Hi); break;
996 case ISD::CTPOP: ExpandIntRes_CTPOP(N, Lo, Hi); break;
997 case ISD::CTTZ: ExpandIntRes_CTTZ(N, Lo, Hi); break;
998 case ISD::FP_TO_SINT: ExpandIntRes_FP_TO_SINT(N, Lo, Hi); break;
999 case ISD::FP_TO_UINT: ExpandIntRes_FP_TO_UINT(N, Lo, Hi); break;
1000 case ISD::LOAD: ExpandIntRes_LOAD(cast<LoadSDNode>(N), Lo, Hi); break;
1001 case ISD::MUL: ExpandIntRes_MUL(N, Lo, Hi); break;
1002 case ISD::SDIV: ExpandIntRes_SDIV(N, Lo, Hi); break;
1003 case ISD::SIGN_EXTEND: ExpandIntRes_SIGN_EXTEND(N, Lo, Hi); break;
1004 case ISD::SIGN_EXTEND_INREG: ExpandIntRes_SIGN_EXTEND_INREG(N, Lo, Hi); break;
1005 case ISD::SREM: ExpandIntRes_SREM(N, Lo, Hi); break;
1006 case ISD::TRUNCATE: ExpandIntRes_TRUNCATE(N, Lo, Hi); break;
1007 case ISD::UDIV: ExpandIntRes_UDIV(N, Lo, Hi); break;
1008 case ISD::UREM: ExpandIntRes_UREM(N, Lo, Hi); break;
1009 case ISD::ZERO_EXTEND: ExpandIntRes_ZERO_EXTEND(N, Lo, Hi); break;
1013 case ISD::XOR: ExpandIntRes_Logical(N, Lo, Hi); break;
1016 case ISD::SUB: ExpandIntRes_ADDSUB(N, Lo, Hi); break;
1019 case ISD::SUBC: ExpandIntRes_ADDSUBC(N, Lo, Hi); break;
1022 case ISD::SUBE: ExpandIntRes_ADDSUBE(N, Lo, Hi); break;
1026 case ISD::SRL: ExpandIntRes_Shift(N, Lo, Hi); break;
1029 // If Lo/Hi is null, the sub-method took care of registering results etc.
1031 SetExpandedInteger(SDValue(N, ResNo), Lo, Hi);
1034 /// ExpandShiftByConstant - N is a shift by a value that needs to be expanded,
1035 /// and the shift amount is a constant 'Amt'. Expand the operation.
1036 void DAGTypeLegalizer::ExpandShiftByConstant(SDNode *N, unsigned Amt,
1037 SDValue &Lo, SDValue &Hi) {
1038 DebugLoc dl = N->getDebugLoc();
1039 // Expand the incoming operand to be shifted, so that we have its parts
1041 GetExpandedInteger(N->getOperand(0), InL, InH);
1043 MVT NVT = InL.getValueType();
1044 unsigned VTBits = N->getValueType(0).getSizeInBits();
1045 unsigned NVTBits = NVT.getSizeInBits();
1046 MVT ShTy = N->getOperand(1).getValueType();
1048 if (N->getOpcode() == ISD::SHL) {
1050 Lo = Hi = DAG.getConstant(0, NVT);
1051 } else if (Amt > NVTBits) {
1052 Lo = DAG.getConstant(0, NVT);
1053 Hi = DAG.getNode(ISD::SHL, dl,
1054 NVT, InL, DAG.getConstant(Amt-NVTBits,ShTy));
1055 } else if (Amt == NVTBits) {
1056 Lo = DAG.getConstant(0, NVT);
1058 } else if (Amt == 1 &&
1059 TLI.isOperationLegalOrCustom(ISD::ADDC,
1060 TLI.getTypeToExpandTo(NVT))) {
1061 // Emit this X << 1 as X+X.
1062 SDVTList VTList = DAG.getVTList(NVT, MVT::Flag);
1063 SDValue LoOps[2] = { InL, InL };
1064 Lo = DAG.getNode(ISD::ADDC, dl, VTList, LoOps, 2);
1065 SDValue HiOps[3] = { InH, InH, Lo.getValue(1) };
1066 Hi = DAG.getNode(ISD::ADDE, dl, VTList, HiOps, 3);
1068 Lo = DAG.getNode(ISD::SHL, dl, NVT, InL, DAG.getConstant(Amt, ShTy));
1069 Hi = DAG.getNode(ISD::OR, dl, NVT,
1070 DAG.getNode(ISD::SHL, dl, NVT, InH,
1071 DAG.getConstant(Amt, ShTy)),
1072 DAG.getNode(ISD::SRL, dl, NVT, InL,
1073 DAG.getConstant(NVTBits-Amt, ShTy)));
1078 if (N->getOpcode() == ISD::SRL) {
1080 Lo = DAG.getConstant(0, NVT);
1081 Hi = DAG.getConstant(0, NVT);
1082 } else if (Amt > NVTBits) {
1083 Lo = DAG.getNode(ISD::SRL, dl,
1084 NVT, InH, DAG.getConstant(Amt-NVTBits,ShTy));
1085 Hi = DAG.getConstant(0, NVT);
1086 } else if (Amt == NVTBits) {
1088 Hi = DAG.getConstant(0, NVT);
1090 Lo = DAG.getNode(ISD::OR, dl, NVT,
1091 DAG.getNode(ISD::SRL, dl, NVT, InL,
1092 DAG.getConstant(Amt, ShTy)),
1093 DAG.getNode(ISD::SHL, dl, NVT, InH,
1094 DAG.getConstant(NVTBits-Amt, ShTy)));
1095 Hi = DAG.getNode(ISD::SRL, dl, NVT, InH, DAG.getConstant(Amt, ShTy));
1100 assert(N->getOpcode() == ISD::SRA && "Unknown shift!");
1102 Hi = Lo = DAG.getNode(ISD::SRA, dl, NVT, InH,
1103 DAG.getConstant(NVTBits-1, ShTy));
1104 } else if (Amt > NVTBits) {
1105 Lo = DAG.getNode(ISD::SRA, dl, NVT, InH,
1106 DAG.getConstant(Amt-NVTBits, ShTy));
1107 Hi = DAG.getNode(ISD::SRA, dl, NVT, InH,
1108 DAG.getConstant(NVTBits-1, ShTy));
1109 } else if (Amt == NVTBits) {
1111 Hi = DAG.getNode(ISD::SRA, dl, NVT, InH,
1112 DAG.getConstant(NVTBits-1, ShTy));
1114 Lo = DAG.getNode(ISD::OR, dl, NVT,
1115 DAG.getNode(ISD::SRL, dl, NVT, InL,
1116 DAG.getConstant(Amt, ShTy)),
1117 DAG.getNode(ISD::SHL, dl, NVT, InH,
1118 DAG.getConstant(NVTBits-Amt, ShTy)));
1119 Hi = DAG.getNode(ISD::SRA, dl, NVT, InH, DAG.getConstant(Amt, ShTy));
1123 /// ExpandShiftWithKnownAmountBit - Try to determine whether we can simplify
1124 /// this shift based on knowledge of the high bit of the shift amount. If we
1125 /// can tell this, we know that it is >= 32 or < 32, without knowing the actual
1127 bool DAGTypeLegalizer::
1128 ExpandShiftWithKnownAmountBit(SDNode *N, SDValue &Lo, SDValue &Hi) {
1129 SDValue Amt = N->getOperand(1);
1130 MVT NVT = TLI.getTypeToTransformTo(N->getValueType(0));
1131 MVT ShTy = Amt.getValueType();
1132 unsigned ShBits = ShTy.getSizeInBits();
1133 unsigned NVTBits = NVT.getSizeInBits();
1134 assert(isPowerOf2_32(NVTBits) &&
1135 "Expanded integer type size not a power of two!");
1136 DebugLoc dl = N->getDebugLoc();
1138 APInt HighBitMask = APInt::getHighBitsSet(ShBits, ShBits - Log2_32(NVTBits));
1139 APInt KnownZero, KnownOne;
1140 DAG.ComputeMaskedBits(N->getOperand(1), HighBitMask, KnownZero, KnownOne);
1142 // If we don't know anything about the high bits, exit.
1143 if (((KnownZero|KnownOne) & HighBitMask) == 0)
1146 // Get the incoming operand to be shifted.
1148 GetExpandedInteger(N->getOperand(0), InL, InH);
1150 // If we know that any of the high bits of the shift amount are one, then we
1151 // can do this as a couple of simple shifts.
1152 if (KnownOne.intersects(HighBitMask)) {
1153 // Mask out the high bit, which we know is set.
1154 Amt = DAG.getNode(ISD::AND, dl, ShTy, Amt,
1155 DAG.getConstant(~HighBitMask, ShTy));
1157 switch (N->getOpcode()) {
1158 default: assert(0 && "Unknown shift");
1160 Lo = DAG.getConstant(0, NVT); // Low part is zero.
1161 Hi = DAG.getNode(ISD::SHL, dl, NVT, InL, Amt); // High part from Lo part.
1164 Hi = DAG.getConstant(0, NVT); // Hi part is zero.
1165 Lo = DAG.getNode(ISD::SRL, dl, NVT, InH, Amt); // Lo part from Hi part.
1168 Hi = DAG.getNode(ISD::SRA, dl, NVT, InH, // Sign extend high part.
1169 DAG.getConstant(NVTBits-1, ShTy));
1170 Lo = DAG.getNode(ISD::SRA, dl, NVT, InH, Amt); // Lo part from Hi part.
1176 // FIXME: This code is broken for shifts with a zero amount!
1177 // If we know that all of the high bits of the shift amount are zero, then we
1178 // can do this as a couple of simple shifts.
1179 if ((KnownZero & HighBitMask) == HighBitMask) {
1181 SDValue Amt2 = DAG.getNode(ISD::SUB, ShTy,
1182 DAG.getConstant(NVTBits, ShTy),
1185 switch (N->getOpcode()) {
1186 default: assert(0 && "Unknown shift");
1187 case ISD::SHL: Op1 = ISD::SHL; Op2 = ISD::SRL; break;
1189 case ISD::SRA: Op1 = ISD::SRL; Op2 = ISD::SHL; break;
1192 Lo = DAG.getNode(N->getOpcode(), NVT, InL, Amt);
1193 Hi = DAG.getNode(ISD::OR, NVT,
1194 DAG.getNode(Op1, NVT, InH, Amt),
1195 DAG.getNode(Op2, NVT, InL, Amt2));
1203 void DAGTypeLegalizer::ExpandIntRes_ADDSUB(SDNode *N,
1204 SDValue &Lo, SDValue &Hi) {
1205 DebugLoc dl = N->getDebugLoc();
1206 // Expand the subcomponents.
1207 SDValue LHSL, LHSH, RHSL, RHSH;
1208 GetExpandedInteger(N->getOperand(0), LHSL, LHSH);
1209 GetExpandedInteger(N->getOperand(1), RHSL, RHSH);
1211 MVT NVT = LHSL.getValueType();
1212 SDValue LoOps[2] = { LHSL, RHSL };
1213 SDValue HiOps[3] = { LHSH, RHSH };
1215 // Do not generate ADDC/ADDE or SUBC/SUBE if the target does not support
1216 // them. TODO: Teach operation legalization how to expand unsupported
1217 // ADDC/ADDE/SUBC/SUBE. The problem is that these operations generate
1218 // a carry of type MVT::Flag, but there doesn't seem to be any way to
1219 // generate a value of this type in the expanded code sequence.
1221 TLI.isOperationLegalOrCustom(N->getOpcode() == ISD::ADD ?
1222 ISD::ADDC : ISD::SUBC,
1223 TLI.getTypeToExpandTo(NVT));
1226 SDVTList VTList = DAG.getVTList(NVT, MVT::Flag);
1227 if (N->getOpcode() == ISD::ADD) {
1228 Lo = DAG.getNode(ISD::ADDC, dl, VTList, LoOps, 2);
1229 HiOps[2] = Lo.getValue(1);
1230 Hi = DAG.getNode(ISD::ADDE, dl, VTList, HiOps, 3);
1232 Lo = DAG.getNode(ISD::SUBC, dl, VTList, LoOps, 2);
1233 HiOps[2] = Lo.getValue(1);
1234 Hi = DAG.getNode(ISD::SUBE, dl, VTList, HiOps, 3);
1237 if (N->getOpcode() == ISD::ADD) {
1238 Lo = DAG.getNode(ISD::ADD, dl, NVT, LoOps, 2);
1239 Hi = DAG.getNode(ISD::ADD, dl, NVT, HiOps, 2);
1240 SDValue Cmp1 = DAG.getSetCC(dl, TLI.getSetCCResultType(NVT), Lo, LoOps[0],
1242 SDValue Carry1 = DAG.getNode(ISD::SELECT, dl, NVT, Cmp1,
1243 DAG.getConstant(1, NVT),
1244 DAG.getConstant(0, NVT));
1245 SDValue Cmp2 = DAG.getSetCC(dl, TLI.getSetCCResultType(NVT), Lo, LoOps[1],
1247 SDValue Carry2 = DAG.getNode(ISD::SELECT, dl, NVT, Cmp2,
1248 DAG.getConstant(1, NVT), Carry1);
1249 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, Carry2);
1251 Lo = DAG.getNode(ISD::SUB, dl, NVT, LoOps, 2);
1252 Hi = DAG.getNode(ISD::SUB, dl, NVT, HiOps, 2);
1254 DAG.getSetCC(dl, TLI.getSetCCResultType(LoOps[0].getValueType()),
1255 LoOps[0], LoOps[1], ISD::SETULT);
1256 SDValue Borrow = DAG.getNode(ISD::SELECT, dl, NVT, Cmp,
1257 DAG.getConstant(1, NVT),
1258 DAG.getConstant(0, NVT));
1259 Hi = DAG.getNode(ISD::SUB, dl, NVT, Hi, Borrow);
1264 void DAGTypeLegalizer::ExpandIntRes_ADDSUBC(SDNode *N,
1265 SDValue &Lo, SDValue &Hi) {
1266 // Expand the subcomponents.
1267 SDValue LHSL, LHSH, RHSL, RHSH;
1268 DebugLoc dl = N->getDebugLoc();
1269 GetExpandedInteger(N->getOperand(0), LHSL, LHSH);
1270 GetExpandedInteger(N->getOperand(1), RHSL, RHSH);
1271 SDVTList VTList = DAG.getVTList(LHSL.getValueType(), MVT::Flag);
1272 SDValue LoOps[2] = { LHSL, RHSL };
1273 SDValue HiOps[3] = { LHSH, RHSH };
1275 if (N->getOpcode() == ISD::ADDC) {
1276 Lo = DAG.getNode(ISD::ADDC, dl, VTList, LoOps, 2);
1277 HiOps[2] = Lo.getValue(1);
1278 Hi = DAG.getNode(ISD::ADDE, dl, VTList, HiOps, 3);
1280 Lo = DAG.getNode(ISD::SUBC, dl, VTList, LoOps, 2);
1281 HiOps[2] = Lo.getValue(1);
1282 Hi = DAG.getNode(ISD::SUBE, dl, VTList, HiOps, 3);
1285 // Legalized the flag result - switch anything that used the old flag to
1287 ReplaceValueWith(SDValue(N, 1), Hi.getValue(1));
1290 void DAGTypeLegalizer::ExpandIntRes_ADDSUBE(SDNode *N,
1291 SDValue &Lo, SDValue &Hi) {
1292 // Expand the subcomponents.
1293 SDValue LHSL, LHSH, RHSL, RHSH;
1294 DebugLoc dl = N->getDebugLoc();
1295 GetExpandedInteger(N->getOperand(0), LHSL, LHSH);
1296 GetExpandedInteger(N->getOperand(1), RHSL, RHSH);
1297 SDVTList VTList = DAG.getVTList(LHSL.getValueType(), MVT::Flag);
1298 SDValue LoOps[3] = { LHSL, RHSL, N->getOperand(2) };
1299 SDValue HiOps[3] = { LHSH, RHSH };
1301 Lo = DAG.getNode(N->getOpcode(), dl, VTList, LoOps, 3);
1302 HiOps[2] = Lo.getValue(1);
1303 Hi = DAG.getNode(N->getOpcode(), dl, VTList, HiOps, 3);
1305 // Legalized the flag result - switch anything that used the old flag to
1307 ReplaceValueWith(SDValue(N, 1), Hi.getValue(1));
1310 void DAGTypeLegalizer::ExpandIntRes_ANY_EXTEND(SDNode *N,
1311 SDValue &Lo, SDValue &Hi) {
1312 MVT NVT = TLI.getTypeToTransformTo(N->getValueType(0));
1313 DebugLoc dl = N->getDebugLoc();
1314 SDValue Op = N->getOperand(0);
1315 if (Op.getValueType().bitsLE(NVT)) {
1316 // The low part is any extension of the input (which degenerates to a copy).
1317 Lo = DAG.getNode(ISD::ANY_EXTEND, dl, NVT, Op);
1318 Hi = DAG.getUNDEF(NVT); // The high part is undefined.
1320 // For example, extension of an i48 to an i64. The operand type necessarily
1321 // promotes to the result type, so will end up being expanded too.
1322 assert(getTypeAction(Op.getValueType()) == PromoteInteger &&
1323 "Only know how to promote this result!");
1324 SDValue Res = GetPromotedInteger(Op);
1325 assert(Res.getValueType() == N->getValueType(0) &&
1326 "Operand over promoted?");
1327 // Split the promoted operand. This will simplify when it is expanded.
1328 SplitInteger(Res, Lo, Hi);
1332 void DAGTypeLegalizer::ExpandIntRes_AssertSext(SDNode *N,
1333 SDValue &Lo, SDValue &Hi) {
1334 DebugLoc dl = N->getDebugLoc();
1335 GetExpandedInteger(N->getOperand(0), Lo, Hi);
1336 MVT NVT = Lo.getValueType();
1337 MVT EVT = cast<VTSDNode>(N->getOperand(1))->getVT();
1338 unsigned NVTBits = NVT.getSizeInBits();
1339 unsigned EVTBits = EVT.getSizeInBits();
1341 if (NVTBits < EVTBits) {
1342 Hi = DAG.getNode(ISD::AssertSext, dl, NVT, Hi,
1343 DAG.getValueType(MVT::getIntegerVT(EVTBits - NVTBits)));
1345 Lo = DAG.getNode(ISD::AssertSext, dl, NVT, Lo, DAG.getValueType(EVT));
1346 // The high part replicates the sign bit of Lo, make it explicit.
1347 Hi = DAG.getNode(ISD::SRA, dl, NVT, Lo,
1348 DAG.getConstant(NVTBits-1, TLI.getPointerTy()));
1352 void DAGTypeLegalizer::ExpandIntRes_AssertZext(SDNode *N,
1353 SDValue &Lo, SDValue &Hi) {
1354 DebugLoc dl = N->getDebugLoc();
1355 GetExpandedInteger(N->getOperand(0), Lo, Hi);
1356 MVT NVT = Lo.getValueType();
1357 MVT EVT = cast<VTSDNode>(N->getOperand(1))->getVT();
1358 unsigned NVTBits = NVT.getSizeInBits();
1359 unsigned EVTBits = EVT.getSizeInBits();
1361 if (NVTBits < EVTBits) {
1362 Hi = DAG.getNode(ISD::AssertZext, dl, NVT, Hi,
1363 DAG.getValueType(MVT::getIntegerVT(EVTBits - NVTBits)));
1365 Lo = DAG.getNode(ISD::AssertZext, dl, NVT, Lo, DAG.getValueType(EVT));
1366 // The high part must be zero, make it explicit.
1367 Hi = DAG.getConstant(0, NVT);
1371 void DAGTypeLegalizer::ExpandIntRes_BSWAP(SDNode *N,
1372 SDValue &Lo, SDValue &Hi) {
1373 DebugLoc dl = N->getDebugLoc();
1374 GetExpandedInteger(N->getOperand(0), Hi, Lo); // Note swapped operands.
1375 Lo = DAG.getNode(ISD::BSWAP, dl, Lo.getValueType(), Lo);
1376 Hi = DAG.getNode(ISD::BSWAP, dl, Hi.getValueType(), Hi);
1379 void DAGTypeLegalizer::ExpandIntRes_Constant(SDNode *N,
1380 SDValue &Lo, SDValue &Hi) {
1381 MVT NVT = TLI.getTypeToTransformTo(N->getValueType(0));
1382 unsigned NBitWidth = NVT.getSizeInBits();
1383 const APInt &Cst = cast<ConstantSDNode>(N)->getAPIntValue();
1384 Lo = DAG.getConstant(APInt(Cst).trunc(NBitWidth), NVT);
1385 Hi = DAG.getConstant(Cst.lshr(NBitWidth).trunc(NBitWidth), NVT);
1388 void DAGTypeLegalizer::ExpandIntRes_CTLZ(SDNode *N,
1389 SDValue &Lo, SDValue &Hi) {
1390 DebugLoc dl = N->getDebugLoc();
1391 // ctlz (HiLo) -> Hi != 0 ? ctlz(Hi) : (ctlz(Lo)+32)
1392 GetExpandedInteger(N->getOperand(0), Lo, Hi);
1393 MVT NVT = Lo.getValueType();
1395 SDValue HiNotZero = DAG.getSetCC(dl, TLI.getSetCCResultType(NVT), Hi,
1396 DAG.getConstant(0, NVT), ISD::SETNE);
1398 SDValue LoLZ = DAG.getNode(ISD::CTLZ, dl, NVT, Lo);
1399 SDValue HiLZ = DAG.getNode(ISD::CTLZ, dl, NVT, Hi);
1401 Lo = DAG.getNode(ISD::SELECT, dl, NVT, HiNotZero, HiLZ,
1402 DAG.getNode(ISD::ADD, dl, NVT, LoLZ,
1403 DAG.getConstant(NVT.getSizeInBits(), NVT)));
1404 Hi = DAG.getConstant(0, NVT);
1407 void DAGTypeLegalizer::ExpandIntRes_CTPOP(SDNode *N,
1408 SDValue &Lo, SDValue &Hi) {
1409 DebugLoc dl = N->getDebugLoc();
1410 // ctpop(HiLo) -> ctpop(Hi)+ctpop(Lo)
1411 GetExpandedInteger(N->getOperand(0), Lo, Hi);
1412 MVT NVT = Lo.getValueType();
1413 Lo = DAG.getNode(ISD::ADD, dl, NVT, DAG.getNode(ISD::CTPOP, dl, NVT, Lo),
1414 DAG.getNode(ISD::CTPOP, dl, NVT, Hi));
1415 Hi = DAG.getConstant(0, NVT);
1418 void DAGTypeLegalizer::ExpandIntRes_CTTZ(SDNode *N,
1419 SDValue &Lo, SDValue &Hi) {
1420 DebugLoc dl = N->getDebugLoc();
1421 // cttz (HiLo) -> Lo != 0 ? cttz(Lo) : (cttz(Hi)+32)
1422 GetExpandedInteger(N->getOperand(0), Lo, Hi);
1423 MVT NVT = Lo.getValueType();
1425 SDValue LoNotZero = DAG.getSetCC(dl, TLI.getSetCCResultType(NVT), Lo,
1426 DAG.getConstant(0, NVT), ISD::SETNE);
1428 SDValue LoLZ = DAG.getNode(ISD::CTTZ, dl, NVT, Lo);
1429 SDValue HiLZ = DAG.getNode(ISD::CTTZ, dl, NVT, Hi);
1431 Lo = DAG.getNode(ISD::SELECT, dl, NVT, LoNotZero, LoLZ,
1432 DAG.getNode(ISD::ADD, dl, NVT, HiLZ,
1433 DAG.getConstant(NVT.getSizeInBits(), NVT)));
1434 Hi = DAG.getConstant(0, NVT);
1437 void DAGTypeLegalizer::ExpandIntRes_FP_TO_SINT(SDNode *N, SDValue &Lo,
1439 DebugLoc dl = N->getDebugLoc();
1440 MVT VT = N->getValueType(0);
1441 SDValue Op = N->getOperand(0);
1442 RTLIB::Libcall LC = RTLIB::getFPTOSINT(Op.getValueType(), VT);
1443 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unexpected fp-to-sint conversion!");
1444 SplitInteger(MakeLibCall(LC, VT, &Op, 1, true/*irrelevant*/, dl), Lo, Hi);
1447 void DAGTypeLegalizer::ExpandIntRes_FP_TO_UINT(SDNode *N, SDValue &Lo,
1449 DebugLoc dl = N->getDebugLoc();
1450 MVT VT = N->getValueType(0);
1451 SDValue Op = N->getOperand(0);
1452 RTLIB::Libcall LC = RTLIB::getFPTOUINT(Op.getValueType(), VT);
1453 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unexpected fp-to-uint conversion!");
1454 SplitInteger(MakeLibCall(LC, VT, &Op, 1, false/*irrelevant*/, dl), Lo, Hi);
1457 void DAGTypeLegalizer::ExpandIntRes_LOAD(LoadSDNode *N,
1458 SDValue &Lo, SDValue &Hi) {
1459 if (ISD::isNormalLoad(N)) {
1460 ExpandRes_NormalLoad(N, Lo, Hi);
1464 assert(ISD::isUNINDEXEDLoad(N) && "Indexed load during type legalization!");
1466 MVT VT = N->getValueType(0);
1467 MVT NVT = TLI.getTypeToTransformTo(VT);
1468 SDValue Ch = N->getChain();
1469 SDValue Ptr = N->getBasePtr();
1470 ISD::LoadExtType ExtType = N->getExtensionType();
1471 int SVOffset = N->getSrcValueOffset();
1472 unsigned Alignment = N->getAlignment();
1473 bool isVolatile = N->isVolatile();
1474 DebugLoc dl = N->getDebugLoc();
1476 assert(NVT.isByteSized() && "Expanded type not byte sized!");
1478 if (N->getMemoryVT().bitsLE(NVT)) {
1479 MVT EVT = N->getMemoryVT();
1481 Lo = DAG.getExtLoad(ExtType, dl, NVT, Ch, Ptr, N->getSrcValue(), SVOffset,
1482 EVT, isVolatile, Alignment);
1484 // Remember the chain.
1485 Ch = Lo.getValue(1);
1487 if (ExtType == ISD::SEXTLOAD) {
1488 // The high part is obtained by SRA'ing all but one of the bits of the
1490 unsigned LoSize = Lo.getValueType().getSizeInBits();
1491 Hi = DAG.getNode(ISD::SRA, dl, NVT, Lo,
1492 DAG.getConstant(LoSize-1, TLI.getPointerTy()));
1493 } else if (ExtType == ISD::ZEXTLOAD) {
1494 // The high part is just a zero.
1495 Hi = DAG.getConstant(0, NVT);
1497 assert(ExtType == ISD::EXTLOAD && "Unknown extload!");
1498 // The high part is undefined.
1499 Hi = DAG.getUNDEF(NVT);
1501 } else if (TLI.isLittleEndian()) {
1502 // Little-endian - low bits are at low addresses.
1503 Lo = DAG.getLoad(NVT, dl, Ch, Ptr, N->getSrcValue(), SVOffset,
1504 isVolatile, Alignment);
1506 unsigned ExcessBits =
1507 N->getMemoryVT().getSizeInBits() - NVT.getSizeInBits();
1508 MVT NEVT = MVT::getIntegerVT(ExcessBits);
1510 // Increment the pointer to the other half.
1511 unsigned IncrementSize = NVT.getSizeInBits()/8;
1512 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
1513 DAG.getIntPtrConstant(IncrementSize));
1514 Hi = DAG.getExtLoad(ExtType, dl, NVT, Ch, Ptr, N->getSrcValue(),
1515 SVOffset+IncrementSize, NEVT,
1516 isVolatile, MinAlign(Alignment, IncrementSize));
1518 // Build a factor node to remember that this load is independent of the
1520 Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
1523 // Big-endian - high bits are at low addresses. Favor aligned loads at
1524 // the cost of some bit-fiddling.
1525 MVT EVT = N->getMemoryVT();
1526 unsigned EBytes = EVT.getStoreSizeInBits()/8;
1527 unsigned IncrementSize = NVT.getSizeInBits()/8;
1528 unsigned ExcessBits = (EBytes - IncrementSize)*8;
1530 // Load both the high bits and maybe some of the low bits.
1531 Hi = DAG.getExtLoad(ExtType, dl, NVT, Ch, Ptr, N->getSrcValue(), SVOffset,
1532 MVT::getIntegerVT(EVT.getSizeInBits() - ExcessBits),
1533 isVolatile, Alignment);
1535 // Increment the pointer to the other half.
1536 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
1537 DAG.getIntPtrConstant(IncrementSize));
1538 // Load the rest of the low bits.
1539 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, dl, NVT, Ch, Ptr, N->getSrcValue(),
1540 SVOffset+IncrementSize,
1541 MVT::getIntegerVT(ExcessBits),
1542 isVolatile, MinAlign(Alignment, IncrementSize));
1544 // Build a factor node to remember that this load is independent of the
1546 Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
1549 if (ExcessBits < NVT.getSizeInBits()) {
1550 // Transfer low bits from the bottom of Hi to the top of Lo.
1551 Lo = DAG.getNode(ISD::OR, dl, NVT, Lo,
1552 DAG.getNode(ISD::SHL, dl, NVT, Hi,
1553 DAG.getConstant(ExcessBits,
1554 TLI.getPointerTy())));
1555 // Move high bits to the right position in Hi.
1556 Hi = DAG.getNode(ExtType == ISD::SEXTLOAD ? ISD::SRA : ISD::SRL, dl,
1558 DAG.getConstant(NVT.getSizeInBits() - ExcessBits,
1559 TLI.getPointerTy()));
1563 // Legalized the chain result - switch anything that used the old chain to
1565 ReplaceValueWith(SDValue(N, 1), Ch);
1568 void DAGTypeLegalizer::ExpandIntRes_Logical(SDNode *N,
1569 SDValue &Lo, SDValue &Hi) {
1570 DebugLoc dl = N->getDebugLoc();
1571 SDValue LL, LH, RL, RH;
1572 GetExpandedInteger(N->getOperand(0), LL, LH);
1573 GetExpandedInteger(N->getOperand(1), RL, RH);
1574 Lo = DAG.getNode(N->getOpcode(), dl, LL.getValueType(), LL, RL);
1575 Hi = DAG.getNode(N->getOpcode(), dl, LL.getValueType(), LH, RH);
1578 void DAGTypeLegalizer::ExpandIntRes_MUL(SDNode *N,
1579 SDValue &Lo, SDValue &Hi) {
1580 MVT VT = N->getValueType(0);
1581 MVT NVT = TLI.getTypeToTransformTo(VT);
1582 DebugLoc dl = N->getDebugLoc();
1584 bool HasMULHS = TLI.isOperationLegalOrCustom(ISD::MULHS, NVT);
1585 bool HasMULHU = TLI.isOperationLegalOrCustom(ISD::MULHU, NVT);
1586 bool HasSMUL_LOHI = TLI.isOperationLegalOrCustom(ISD::SMUL_LOHI, NVT);
1587 bool HasUMUL_LOHI = TLI.isOperationLegalOrCustom(ISD::UMUL_LOHI, NVT);
1588 if (HasMULHU || HasMULHS || HasUMUL_LOHI || HasSMUL_LOHI) {
1589 SDValue LL, LH, RL, RH;
1590 GetExpandedInteger(N->getOperand(0), LL, LH);
1591 GetExpandedInteger(N->getOperand(1), RL, RH);
1592 unsigned OuterBitSize = VT.getSizeInBits();
1593 unsigned InnerBitSize = NVT.getSizeInBits();
1594 unsigned LHSSB = DAG.ComputeNumSignBits(N->getOperand(0));
1595 unsigned RHSSB = DAG.ComputeNumSignBits(N->getOperand(1));
1597 APInt HighMask = APInt::getHighBitsSet(OuterBitSize, InnerBitSize);
1598 if (DAG.MaskedValueIsZero(N->getOperand(0), HighMask) &&
1599 DAG.MaskedValueIsZero(N->getOperand(1), HighMask)) {
1600 // The inputs are both zero-extended.
1602 // We can emit a umul_lohi.
1603 Lo = DAG.getNode(ISD::UMUL_LOHI, dl, DAG.getVTList(NVT, NVT), LL, RL);
1604 Hi = SDValue(Lo.getNode(), 1);
1608 // We can emit a mulhu+mul.
1609 Lo = DAG.getNode(ISD::MUL, dl, NVT, LL, RL);
1610 Hi = DAG.getNode(ISD::MULHU, dl, NVT, LL, RL);
1614 if (LHSSB > InnerBitSize && RHSSB > InnerBitSize) {
1615 // The input values are both sign-extended.
1617 // We can emit a smul_lohi.
1618 Lo = DAG.getNode(ISD::SMUL_LOHI, dl, DAG.getVTList(NVT, NVT), LL, RL);
1619 Hi = SDValue(Lo.getNode(), 1);
1623 // We can emit a mulhs+mul.
1624 Lo = DAG.getNode(ISD::MUL, dl, NVT, LL, RL);
1625 Hi = DAG.getNode(ISD::MULHS, dl, NVT, LL, RL);
1630 // Lo,Hi = umul LHS, RHS.
1631 SDValue UMulLOHI = DAG.getNode(ISD::UMUL_LOHI, dl,
1632 DAG.getVTList(NVT, NVT), LL, RL);
1634 Hi = UMulLOHI.getValue(1);
1635 RH = DAG.getNode(ISD::MUL, dl, NVT, LL, RH);
1636 LH = DAG.getNode(ISD::MUL, dl, NVT, LH, RL);
1637 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, RH);
1638 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, LH);
1642 Lo = DAG.getNode(ISD::MUL, dl, NVT, LL, RL);
1643 Hi = DAG.getNode(ISD::MULHU, dl, NVT, LL, RL);
1644 RH = DAG.getNode(ISD::MUL, dl, NVT, LL, RH);
1645 LH = DAG.getNode(ISD::MUL, dl, NVT, LH, RL);
1646 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, RH);
1647 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, LH);
1652 // If nothing else, we can make a libcall.
1653 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
1655 LC = RTLIB::MUL_I16;
1656 else if (VT == MVT::i32)
1657 LC = RTLIB::MUL_I32;
1658 else if (VT == MVT::i64)
1659 LC = RTLIB::MUL_I64;
1660 else if (VT == MVT::i128)
1661 LC = RTLIB::MUL_I128;
1662 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported MUL!");
1664 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) };
1665 SplitInteger(MakeLibCall(LC, VT, Ops, 2, true/*irrelevant*/, dl), Lo, Hi);
1668 void DAGTypeLegalizer::ExpandIntRes_SDIV(SDNode *N,
1669 SDValue &Lo, SDValue &Hi) {
1670 MVT VT = N->getValueType(0);
1671 DebugLoc dl = N->getDebugLoc();
1673 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
1675 LC = RTLIB::SDIV_I32;
1676 else if (VT == MVT::i64)
1677 LC = RTLIB::SDIV_I64;
1678 else if (VT == MVT::i128)
1679 LC = RTLIB::SDIV_I128;
1680 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported SDIV!");
1682 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) };
1683 SplitInteger(MakeLibCall(LC, VT, Ops, 2, true, dl), Lo, Hi);
1686 void DAGTypeLegalizer::ExpandIntRes_Shift(SDNode *N,
1687 SDValue &Lo, SDValue &Hi) {
1688 MVT VT = N->getValueType(0);
1689 DebugLoc dl = N->getDebugLoc();
1691 // If we can emit an efficient shift operation, do so now. Check to see if
1692 // the RHS is a constant.
1693 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N->getOperand(1)))
1694 return ExpandShiftByConstant(N, CN->getZExtValue(), Lo, Hi);
1696 // If we can determine that the high bit of the shift is zero or one, even if
1697 // the low bits are variable, emit this shift in an optimized form.
1698 if (ExpandShiftWithKnownAmountBit(N, Lo, Hi))
1701 // If this target supports shift_PARTS, use it. First, map to the _PARTS opc.
1703 if (N->getOpcode() == ISD::SHL) {
1704 PartsOpc = ISD::SHL_PARTS;
1705 } else if (N->getOpcode() == ISD::SRL) {
1706 PartsOpc = ISD::SRL_PARTS;
1708 assert(N->getOpcode() == ISD::SRA && "Unknown shift!");
1709 PartsOpc = ISD::SRA_PARTS;
1712 // Next check to see if the target supports this SHL_PARTS operation or if it
1713 // will custom expand it.
1714 MVT NVT = TLI.getTypeToTransformTo(VT);
1715 TargetLowering::LegalizeAction Action = TLI.getOperationAction(PartsOpc, NVT);
1716 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
1717 Action == TargetLowering::Custom) {
1718 // Expand the subcomponents.
1720 GetExpandedInteger(N->getOperand(0), LHSL, LHSH);
1722 SDValue Ops[] = { LHSL, LHSH, N->getOperand(1) };
1723 MVT VT = LHSL.getValueType();
1724 Lo = DAG.getNode(PartsOpc, dl, DAG.getNodeValueTypes(VT, VT), 2, Ops, 3);
1725 Hi = Lo.getValue(1);
1729 // Otherwise, emit a libcall.
1730 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
1732 if (N->getOpcode() == ISD::SHL) {
1733 isSigned = false; /*sign irrelevant*/
1735 LC = RTLIB::SHL_I16;
1736 else if (VT == MVT::i32)
1737 LC = RTLIB::SHL_I32;
1738 else if (VT == MVT::i64)
1739 LC = RTLIB::SHL_I64;
1740 else if (VT == MVT::i128)
1741 LC = RTLIB::SHL_I128;
1742 } else if (N->getOpcode() == ISD::SRL) {
1745 LC = RTLIB::SRL_I16;
1746 else if (VT == MVT::i32)
1747 LC = RTLIB::SRL_I32;
1748 else if (VT == MVT::i64)
1749 LC = RTLIB::SRL_I64;
1750 else if (VT == MVT::i128)
1751 LC = RTLIB::SRL_I128;
1753 assert(N->getOpcode() == ISD::SRA && "Unknown shift!");
1756 LC = RTLIB::SRA_I16;
1757 else if (VT == MVT::i32)
1758 LC = RTLIB::SRA_I32;
1759 else if (VT == MVT::i64)
1760 LC = RTLIB::SRA_I64;
1761 else if (VT == MVT::i128)
1762 LC = RTLIB::SRA_I128;
1764 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported shift!");
1766 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) };
1767 SplitInteger(MakeLibCall(LC, VT, Ops, 2, isSigned, dl), Lo, Hi);
1770 void DAGTypeLegalizer::ExpandIntRes_SIGN_EXTEND(SDNode *N,
1771 SDValue &Lo, SDValue &Hi) {
1772 MVT NVT = TLI.getTypeToTransformTo(N->getValueType(0));
1773 DebugLoc dl = N->getDebugLoc();
1774 SDValue Op = N->getOperand(0);
1775 if (Op.getValueType().bitsLE(NVT)) {
1776 // The low part is sign extension of the input (degenerates to a copy).
1777 Lo = DAG.getNode(ISD::SIGN_EXTEND, dl, NVT, N->getOperand(0));
1778 // The high part is obtained by SRA'ing all but one of the bits of low part.
1779 unsigned LoSize = NVT.getSizeInBits();
1780 Hi = DAG.getNode(ISD::SRA, dl, NVT, Lo,
1781 DAG.getConstant(LoSize-1, TLI.getPointerTy()));
1783 // For example, extension of an i48 to an i64. The operand type necessarily
1784 // promotes to the result type, so will end up being expanded too.
1785 assert(getTypeAction(Op.getValueType()) == PromoteInteger &&
1786 "Only know how to promote this result!");
1787 SDValue Res = GetPromotedInteger(Op);
1788 assert(Res.getValueType() == N->getValueType(0) &&
1789 "Operand over promoted?");
1790 // Split the promoted operand. This will simplify when it is expanded.
1791 SplitInteger(Res, Lo, Hi);
1792 unsigned ExcessBits =
1793 Op.getValueType().getSizeInBits() - NVT.getSizeInBits();
1794 Hi = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Hi.getValueType(), Hi,
1795 DAG.getValueType(MVT::getIntegerVT(ExcessBits)));
1799 void DAGTypeLegalizer::
1800 ExpandIntRes_SIGN_EXTEND_INREG(SDNode *N, SDValue &Lo, SDValue &Hi) {
1801 DebugLoc dl = N->getDebugLoc();
1802 GetExpandedInteger(N->getOperand(0), Lo, Hi);
1803 MVT EVT = cast<VTSDNode>(N->getOperand(1))->getVT();
1805 if (EVT.bitsLE(Lo.getValueType())) {
1806 // sext_inreg the low part if needed.
1807 Lo = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Lo.getValueType(), Lo,
1810 // The high part gets the sign extension from the lo-part. This handles
1811 // things like sextinreg V:i64 from i8.
1812 Hi = DAG.getNode(ISD::SRA, dl, Hi.getValueType(), Lo,
1813 DAG.getConstant(Hi.getValueType().getSizeInBits()-1,
1814 TLI.getPointerTy()));
1816 // For example, extension of an i48 to an i64. Leave the low part alone,
1817 // sext_inreg the high part.
1818 unsigned ExcessBits =
1819 EVT.getSizeInBits() - Lo.getValueType().getSizeInBits();
1820 Hi = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Hi.getValueType(), Hi,
1821 DAG.getValueType(MVT::getIntegerVT(ExcessBits)));
1825 void DAGTypeLegalizer::ExpandIntRes_SREM(SDNode *N,
1826 SDValue &Lo, SDValue &Hi) {
1827 MVT VT = N->getValueType(0);
1828 DebugLoc dl = N->getDebugLoc();
1830 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
1832 LC = RTLIB::SREM_I32;
1833 else if (VT == MVT::i64)
1834 LC = RTLIB::SREM_I64;
1835 else if (VT == MVT::i128)
1836 LC = RTLIB::SREM_I128;
1837 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported SREM!");
1839 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) };
1840 SplitInteger(MakeLibCall(LC, VT, Ops, 2, true, dl), Lo, Hi);
1843 void DAGTypeLegalizer::ExpandIntRes_TRUNCATE(SDNode *N,
1844 SDValue &Lo, SDValue &Hi) {
1845 MVT NVT = TLI.getTypeToTransformTo(N->getValueType(0));
1846 DebugLoc dl = N->getDebugLoc();
1847 Lo = DAG.getNode(ISD::TRUNCATE, dl, NVT, N->getOperand(0));
1848 Hi = DAG.getNode(ISD::SRL, dl,
1849 N->getOperand(0).getValueType(), N->getOperand(0),
1850 DAG.getConstant(NVT.getSizeInBits(), TLI.getPointerTy()));
1851 Hi = DAG.getNode(ISD::TRUNCATE, dl, NVT, Hi);
1854 void DAGTypeLegalizer::ExpandIntRes_UDIV(SDNode *N,
1855 SDValue &Lo, SDValue &Hi) {
1856 MVT VT = N->getValueType(0);
1857 DebugLoc dl = N->getDebugLoc();
1859 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
1861 LC = RTLIB::UDIV_I32;
1862 else if (VT == MVT::i64)
1863 LC = RTLIB::UDIV_I64;
1864 else if (VT == MVT::i128)
1865 LC = RTLIB::UDIV_I128;
1866 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported UDIV!");
1868 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) };
1869 SplitInteger(MakeLibCall(LC, VT, Ops, 2, false, dl), Lo, Hi);
1872 void DAGTypeLegalizer::ExpandIntRes_UREM(SDNode *N,
1873 SDValue &Lo, SDValue &Hi) {
1874 MVT VT = N->getValueType(0);
1875 DebugLoc dl = N->getDebugLoc();
1877 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
1879 LC = RTLIB::UREM_I32;
1880 else if (VT == MVT::i64)
1881 LC = RTLIB::UREM_I64;
1882 else if (VT == MVT::i128)
1883 LC = RTLIB::UREM_I128;
1884 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported UREM!");
1886 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) };
1887 SplitInteger(MakeLibCall(LC, VT, Ops, 2, false, dl), Lo, Hi);
1890 void DAGTypeLegalizer::ExpandIntRes_ZERO_EXTEND(SDNode *N,
1891 SDValue &Lo, SDValue &Hi) {
1892 MVT NVT = TLI.getTypeToTransformTo(N->getValueType(0));
1893 DebugLoc dl = N->getDebugLoc();
1894 SDValue Op = N->getOperand(0);
1895 if (Op.getValueType().bitsLE(NVT)) {
1896 // The low part is zero extension of the input (degenerates to a copy).
1897 Lo = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, N->getOperand(0));
1898 Hi = DAG.getConstant(0, NVT); // The high part is just a zero.
1900 // For example, extension of an i48 to an i64. The operand type necessarily
1901 // promotes to the result type, so will end up being expanded too.
1902 assert(getTypeAction(Op.getValueType()) == PromoteInteger &&
1903 "Only know how to promote this result!");
1904 SDValue Res = GetPromotedInteger(Op);
1905 assert(Res.getValueType() == N->getValueType(0) &&
1906 "Operand over promoted?");
1907 // Split the promoted operand. This will simplify when it is expanded.
1908 SplitInteger(Res, Lo, Hi);
1909 unsigned ExcessBits =
1910 Op.getValueType().getSizeInBits() - NVT.getSizeInBits();
1911 Hi = DAG.getZeroExtendInReg(Hi, dl, MVT::getIntegerVT(ExcessBits));
1916 //===----------------------------------------------------------------------===//
1917 // Integer Operand Expansion
1918 //===----------------------------------------------------------------------===//
1920 /// ExpandIntegerOperand - This method is called when the specified operand of
1921 /// the specified node is found to need expansion. At this point, all of the
1922 /// result types of the node are known to be legal, but other operands of the
1923 /// node may need promotion or expansion as well as the specified one.
1924 bool DAGTypeLegalizer::ExpandIntegerOperand(SDNode *N, unsigned OpNo) {
1925 DEBUG(cerr << "Expand integer operand: "; N->dump(&DAG); cerr << "\n");
1926 SDValue Res = SDValue();
1928 if (CustomLowerResults(N, N->getOperand(OpNo).getValueType(), false))
1931 switch (N->getOpcode()) {
1934 cerr << "ExpandIntegerOperand Op #" << OpNo << ": ";
1935 N->dump(&DAG); cerr << "\n";
1937 assert(0 && "Do not know how to expand this operator's operand!");
1940 case ISD::BIT_CONVERT: Res = ExpandOp_BIT_CONVERT(N); break;
1941 case ISD::BR_CC: Res = ExpandIntOp_BR_CC(N); break;
1942 case ISD::BUILD_VECTOR: Res = ExpandOp_BUILD_VECTOR(N); break;
1943 case ISD::EXTRACT_ELEMENT: Res = ExpandOp_EXTRACT_ELEMENT(N); break;
1944 case ISD::INSERT_VECTOR_ELT: Res = ExpandOp_INSERT_VECTOR_ELT(N); break;
1945 case ISD::SCALAR_TO_VECTOR: Res = ExpandOp_SCALAR_TO_VECTOR(N); break;
1946 case ISD::SELECT_CC: Res = ExpandIntOp_SELECT_CC(N); break;
1947 case ISD::SETCC: Res = ExpandIntOp_SETCC(N); break;
1948 case ISD::SINT_TO_FP: Res = ExpandIntOp_SINT_TO_FP(N); break;
1949 case ISD::STORE: Res = ExpandIntOp_STORE(cast<StoreSDNode>(N), OpNo); break;
1950 case ISD::TRUNCATE: Res = ExpandIntOp_TRUNCATE(N); break;
1951 case ISD::UINT_TO_FP: Res = ExpandIntOp_UINT_TO_FP(N); break;
1957 case ISD::ROTR: Res = ExpandIntOp_Shift(N); break;
1960 // If the result is null, the sub-method took care of registering results etc.
1961 if (!Res.getNode()) return false;
1963 // If the result is N, the sub-method updated N in place. Tell the legalizer
1965 if (Res.getNode() == N)
1968 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
1969 "Invalid operand expansion");
1971 ReplaceValueWith(SDValue(N, 0), Res);
1975 /// IntegerExpandSetCCOperands - Expand the operands of a comparison. This code
1976 /// is shared among BR_CC, SELECT_CC, and SETCC handlers.
1977 void DAGTypeLegalizer::IntegerExpandSetCCOperands(SDValue &NewLHS,
1979 ISD::CondCode &CCCode,
1981 SDValue LHSLo, LHSHi, RHSLo, RHSHi;
1982 GetExpandedInteger(NewLHS, LHSLo, LHSHi);
1983 GetExpandedInteger(NewRHS, RHSLo, RHSHi);
1985 MVT VT = NewLHS.getValueType();
1987 if (CCCode == ISD::SETEQ || CCCode == ISD::SETNE) {
1988 if (RHSLo == RHSHi) {
1989 if (ConstantSDNode *RHSCST = dyn_cast<ConstantSDNode>(RHSLo)) {
1990 if (RHSCST->isAllOnesValue()) {
1991 // Equality comparison to -1.
1992 NewLHS = DAG.getNode(ISD::AND, dl,
1993 LHSLo.getValueType(), LHSLo, LHSHi);
2000 NewLHS = DAG.getNode(ISD::XOR, dl, LHSLo.getValueType(), LHSLo, RHSLo);
2001 NewRHS = DAG.getNode(ISD::XOR, dl, LHSLo.getValueType(), LHSHi, RHSHi);
2002 NewLHS = DAG.getNode(ISD::OR, dl, NewLHS.getValueType(), NewLHS, NewRHS);
2003 NewRHS = DAG.getConstant(0, NewLHS.getValueType());
2007 // If this is a comparison of the sign bit, just look at the top part.
2009 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(NewRHS))
2010 if ((CCCode == ISD::SETLT && CST->isNullValue()) || // X < 0
2011 (CCCode == ISD::SETGT && CST->isAllOnesValue())) { // X > -1
2017 // FIXME: This generated code sucks.
2018 ISD::CondCode LowCC;
2020 default: assert(0 && "Unknown integer setcc!");
2022 case ISD::SETULT: LowCC = ISD::SETULT; break;
2024 case ISD::SETUGT: LowCC = ISD::SETUGT; break;
2026 case ISD::SETULE: LowCC = ISD::SETULE; break;
2028 case ISD::SETUGE: LowCC = ISD::SETUGE; break;
2031 // Tmp1 = lo(op1) < lo(op2) // Always unsigned comparison
2032 // Tmp2 = hi(op1) < hi(op2) // Signedness depends on operands
2033 // dest = hi(op1) == hi(op2) ? Tmp1 : Tmp2;
2035 // NOTE: on targets without efficient SELECT of bools, we can always use
2036 // this identity: (B1 ? B2 : B3) --> (B1 & B2)|(!B1&B3)
2037 TargetLowering::DAGCombinerInfo DagCombineInfo(DAG, false, true, NULL);
2039 Tmp1 = TLI.SimplifySetCC(TLI.getSetCCResultType(LHSLo.getValueType()),
2040 LHSLo, RHSLo, LowCC, false, DagCombineInfo, dl);
2041 if (!Tmp1.getNode())
2042 Tmp1 = DAG.getSetCC(dl, TLI.getSetCCResultType(LHSLo.getValueType()),
2043 LHSLo, RHSLo, LowCC);
2044 Tmp2 = TLI.SimplifySetCC(TLI.getSetCCResultType(LHSHi.getValueType()),
2045 LHSHi, RHSHi, CCCode, false, DagCombineInfo, dl);
2046 if (!Tmp2.getNode())
2047 Tmp2 = DAG.getNode(ISD::SETCC, dl,
2048 TLI.getSetCCResultType(LHSHi.getValueType()),
2049 LHSHi, RHSHi, DAG.getCondCode(CCCode));
2051 ConstantSDNode *Tmp1C = dyn_cast<ConstantSDNode>(Tmp1.getNode());
2052 ConstantSDNode *Tmp2C = dyn_cast<ConstantSDNode>(Tmp2.getNode());
2053 if ((Tmp1C && Tmp1C->isNullValue()) ||
2054 (Tmp2C && Tmp2C->isNullValue() &&
2055 (CCCode == ISD::SETLE || CCCode == ISD::SETGE ||
2056 CCCode == ISD::SETUGE || CCCode == ISD::SETULE)) ||
2057 (Tmp2C && Tmp2C->getAPIntValue() == 1 &&
2058 (CCCode == ISD::SETLT || CCCode == ISD::SETGT ||
2059 CCCode == ISD::SETUGT || CCCode == ISD::SETULT))) {
2060 // low part is known false, returns high part.
2061 // For LE / GE, if high part is known false, ignore the low part.
2062 // For LT / GT, if high part is known true, ignore the low part.
2068 NewLHS = TLI.SimplifySetCC(TLI.getSetCCResultType(LHSHi.getValueType()),
2069 LHSHi, RHSHi, ISD::SETEQ, false,
2070 DagCombineInfo, dl);
2071 if (!NewLHS.getNode())
2072 NewLHS = DAG.getSetCC(dl, TLI.getSetCCResultType(LHSHi.getValueType()),
2073 LHSHi, RHSHi, ISD::SETEQ);
2074 NewLHS = DAG.getNode(ISD::SELECT, dl, Tmp1.getValueType(),
2075 NewLHS, Tmp1, Tmp2);
2079 SDValue DAGTypeLegalizer::ExpandIntOp_BR_CC(SDNode *N) {
2080 SDValue NewLHS = N->getOperand(2), NewRHS = N->getOperand(3);
2081 ISD::CondCode CCCode = cast<CondCodeSDNode>(N->getOperand(1))->get();
2082 IntegerExpandSetCCOperands(NewLHS, NewRHS, CCCode, N->getDebugLoc());
2084 // If ExpandSetCCOperands returned a scalar, we need to compare the result
2085 // against zero to select between true and false values.
2086 if (NewRHS.getNode() == 0) {
2087 NewRHS = DAG.getConstant(0, NewLHS.getValueType());
2088 CCCode = ISD::SETNE;
2091 // Update N to have the operands specified.
2092 return DAG.UpdateNodeOperands(SDValue(N, 0), N->getOperand(0),
2093 DAG.getCondCode(CCCode), NewLHS, NewRHS,
2097 SDValue DAGTypeLegalizer::ExpandIntOp_SELECT_CC(SDNode *N) {
2098 SDValue NewLHS = N->getOperand(0), NewRHS = N->getOperand(1);
2099 ISD::CondCode CCCode = cast<CondCodeSDNode>(N->getOperand(4))->get();
2100 IntegerExpandSetCCOperands(NewLHS, NewRHS, CCCode, N->getDebugLoc());
2102 // If ExpandSetCCOperands returned a scalar, we need to compare the result
2103 // against zero to select between true and false values.
2104 if (NewRHS.getNode() == 0) {
2105 NewRHS = DAG.getConstant(0, NewLHS.getValueType());
2106 CCCode = ISD::SETNE;
2109 // Update N to have the operands specified.
2110 return DAG.UpdateNodeOperands(SDValue(N, 0), NewLHS, NewRHS,
2111 N->getOperand(2), N->getOperand(3),
2112 DAG.getCondCode(CCCode));
2115 SDValue DAGTypeLegalizer::ExpandIntOp_SETCC(SDNode *N) {
2116 SDValue NewLHS = N->getOperand(0), NewRHS = N->getOperand(1);
2117 ISD::CondCode CCCode = cast<CondCodeSDNode>(N->getOperand(2))->get();
2118 IntegerExpandSetCCOperands(NewLHS, NewRHS, CCCode, N->getDebugLoc());
2120 // If ExpandSetCCOperands returned a scalar, use it.
2121 if (NewRHS.getNode() == 0) {
2122 assert(NewLHS.getValueType() == N->getValueType(0) &&
2123 "Unexpected setcc expansion!");
2127 // Otherwise, update N to have the operands specified.
2128 return DAG.UpdateNodeOperands(SDValue(N, 0), NewLHS, NewRHS,
2129 DAG.getCondCode(CCCode));
2132 SDValue DAGTypeLegalizer::ExpandIntOp_Shift(SDNode *N) {
2133 // The value being shifted is legal, but the shift amount is too big.
2134 // It follows that either the result of the shift is undefined, or the
2135 // upper half of the shift amount is zero. Just use the lower half.
2137 GetExpandedInteger(N->getOperand(1), Lo, Hi);
2138 return DAG.UpdateNodeOperands(SDValue(N, 0), N->getOperand(0), Lo);
2141 SDValue DAGTypeLegalizer::ExpandIntOp_SINT_TO_FP(SDNode *N) {
2142 SDValue Op = N->getOperand(0);
2143 MVT DstVT = N->getValueType(0);
2144 RTLIB::Libcall LC = RTLIB::getSINTTOFP(Op.getValueType(), DstVT);
2145 assert(LC != RTLIB::UNKNOWN_LIBCALL &&
2146 "Don't know how to expand this SINT_TO_FP!");
2147 return MakeLibCall(LC, DstVT, &Op, 1, true, N->getDebugLoc());
2150 SDValue DAGTypeLegalizer::ExpandIntOp_STORE(StoreSDNode *N, unsigned OpNo) {
2151 if (ISD::isNormalStore(N))
2152 return ExpandOp_NormalStore(N, OpNo);
2154 assert(ISD::isUNINDEXEDStore(N) && "Indexed store during type legalization!");
2155 assert(OpNo == 1 && "Can only expand the stored value so far");
2157 MVT VT = N->getOperand(1).getValueType();
2158 MVT NVT = TLI.getTypeToTransformTo(VT);
2159 SDValue Ch = N->getChain();
2160 SDValue Ptr = N->getBasePtr();
2161 int SVOffset = N->getSrcValueOffset();
2162 unsigned Alignment = N->getAlignment();
2163 bool isVolatile = N->isVolatile();
2164 DebugLoc dl = N->getDebugLoc();
2167 assert(NVT.isByteSized() && "Expanded type not byte sized!");
2169 if (N->getMemoryVT().bitsLE(NVT)) {
2170 GetExpandedInteger(N->getValue(), Lo, Hi);
2171 return DAG.getTruncStore(Ch, dl, Lo, Ptr, N->getSrcValue(), SVOffset,
2172 N->getMemoryVT(), isVolatile, Alignment);
2173 } else if (TLI.isLittleEndian()) {
2174 // Little-endian - low bits are at low addresses.
2175 GetExpandedInteger(N->getValue(), Lo, Hi);
2177 Lo = DAG.getStore(Ch, dl, Lo, Ptr, N->getSrcValue(), SVOffset,
2178 isVolatile, Alignment);
2180 unsigned ExcessBits =
2181 N->getMemoryVT().getSizeInBits() - NVT.getSizeInBits();
2182 MVT NEVT = MVT::getIntegerVT(ExcessBits);
2184 // Increment the pointer to the other half.
2185 unsigned IncrementSize = NVT.getSizeInBits()/8;
2186 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
2187 DAG.getIntPtrConstant(IncrementSize));
2188 Hi = DAG.getTruncStore(Ch, dl, Hi, Ptr, N->getSrcValue(),
2189 SVOffset+IncrementSize, NEVT,
2190 isVolatile, MinAlign(Alignment, IncrementSize));
2191 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo, Hi);
2193 // Big-endian - high bits are at low addresses. Favor aligned stores at
2194 // the cost of some bit-fiddling.
2195 GetExpandedInteger(N->getValue(), Lo, Hi);
2197 MVT EVT = N->getMemoryVT();
2198 unsigned EBytes = EVT.getStoreSizeInBits()/8;
2199 unsigned IncrementSize = NVT.getSizeInBits()/8;
2200 unsigned ExcessBits = (EBytes - IncrementSize)*8;
2201 MVT HiVT = MVT::getIntegerVT(EVT.getSizeInBits() - ExcessBits);
2203 if (ExcessBits < NVT.getSizeInBits()) {
2204 // Transfer high bits from the top of Lo to the bottom of Hi.
2205 Hi = DAG.getNode(ISD::SHL, dl, NVT, Hi,
2206 DAG.getConstant(NVT.getSizeInBits() - ExcessBits,
2207 TLI.getPointerTy()));
2208 Hi = DAG.getNode(ISD::OR, dl, NVT, Hi,
2209 DAG.getNode(ISD::SRL, dl, NVT, Lo,
2210 DAG.getConstant(ExcessBits,
2211 TLI.getPointerTy())));
2214 // Store both the high bits and maybe some of the low bits.
2215 Hi = DAG.getTruncStore(Ch, dl, Hi, Ptr, N->getSrcValue(),
2216 SVOffset, HiVT, isVolatile, Alignment);
2218 // Increment the pointer to the other half.
2219 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
2220 DAG.getIntPtrConstant(IncrementSize));
2221 // Store the lowest ExcessBits bits in the second half.
2222 Lo = DAG.getTruncStore(Ch, dl, Lo, Ptr, N->getSrcValue(),
2223 SVOffset+IncrementSize,
2224 MVT::getIntegerVT(ExcessBits),
2225 isVolatile, MinAlign(Alignment, IncrementSize));
2226 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo, Hi);
2230 SDValue DAGTypeLegalizer::ExpandIntOp_TRUNCATE(SDNode *N) {
2232 GetExpandedInteger(N->getOperand(0), InL, InH);
2233 // Just truncate the low part of the source.
2234 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), N->getValueType(0), InL);
2237 SDValue DAGTypeLegalizer::ExpandIntOp_UINT_TO_FP(SDNode *N) {
2238 SDValue Op = N->getOperand(0);
2239 MVT SrcVT = Op.getValueType();
2240 MVT DstVT = N->getValueType(0);
2241 DebugLoc dl = N->getDebugLoc();
2243 if (TLI.getOperationAction(ISD::SINT_TO_FP, SrcVT) == TargetLowering::Custom){
2244 // Do a signed conversion then adjust the result.
2245 SDValue SignedConv = DAG.getNode(ISD::SINT_TO_FP, dl, DstVT, Op);
2246 SignedConv = TLI.LowerOperation(SignedConv, DAG);
2248 // The result of the signed conversion needs adjusting if the 'sign bit' of
2249 // the incoming integer was set. To handle this, we dynamically test to see
2250 // if it is set, and, if so, add a fudge factor.
2252 const uint64_t F32TwoE32 = 0x4F800000ULL;
2253 const uint64_t F32TwoE64 = 0x5F800000ULL;
2254 const uint64_t F32TwoE128 = 0x7F800000ULL;
2257 if (SrcVT == MVT::i32)
2258 FF = APInt(32, F32TwoE32);
2259 else if (SrcVT == MVT::i64)
2260 FF = APInt(32, F32TwoE64);
2261 else if (SrcVT == MVT::i128)
2262 FF = APInt(32, F32TwoE128);
2264 assert(false && "Unsupported UINT_TO_FP!");
2266 // Check whether the sign bit is set.
2268 GetExpandedInteger(Op, Lo, Hi);
2269 SDValue SignSet = DAG.getSetCC(dl,
2270 TLI.getSetCCResultType(Hi.getValueType()),
2271 Hi, DAG.getConstant(0, Hi.getValueType()),
2274 // Build a 64 bit pair (0, FF) in the constant pool, with FF in the lo bits.
2275 SDValue FudgePtr = DAG.getConstantPool(ConstantInt::get(FF.zext(64)),
2276 TLI.getPointerTy());
2278 // Get a pointer to FF if the sign bit was set, or to 0 otherwise.
2279 SDValue Zero = DAG.getIntPtrConstant(0);
2280 SDValue Four = DAG.getIntPtrConstant(4);
2281 if (TLI.isBigEndian()) std::swap(Zero, Four);
2282 SDValue Offset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(), SignSet,
2284 unsigned Alignment =
2285 1 << cast<ConstantPoolSDNode>(FudgePtr)->getAlignment();
2286 FudgePtr = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(), FudgePtr, Offset);
2287 Alignment = std::min(Alignment, 4u);
2289 // Load the value out, extending it from f32 to the destination float type.
2290 // FIXME: Avoid the extend by constructing the right constant pool?
2291 SDValue Fudge = DAG.getExtLoad(ISD::EXTLOAD, dl, DstVT, DAG.getEntryNode(),
2292 FudgePtr, NULL, 0, MVT::f32,
2294 return DAG.getNode(ISD::FADD, dl, DstVT, SignedConv, Fudge);
2297 // Otherwise, use a libcall.
2298 RTLIB::Libcall LC = RTLIB::getUINTTOFP(SrcVT, DstVT);
2299 assert(LC != RTLIB::UNKNOWN_LIBCALL &&
2300 "Don't know how to expand this UINT_TO_FP!");
2301 return MakeLibCall(LC, DstVT, &Op, 1, true, dl);