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/IR/DerivedTypes.h"
23 #include "llvm/Support/ErrorHandling.h"
24 #include "llvm/Support/raw_ostream.h"
27 //===----------------------------------------------------------------------===//
28 // Integer Result Promotion
29 //===----------------------------------------------------------------------===//
31 /// PromoteIntegerResult - This method is called when a result of a node is
32 /// found to be in need of promotion to a larger type. At this point, the node
33 /// may also have invalid operands or may have other results that need
34 /// expansion, we just know that (at least) one result needs promotion.
35 void DAGTypeLegalizer::PromoteIntegerResult(SDNode *N, unsigned ResNo) {
36 DEBUG(dbgs() << "Promote integer result: "; N->dump(&DAG); dbgs() << "\n");
37 SDValue Res = SDValue();
39 // See if the target wants to custom expand this node.
40 if (CustomLowerNode(N, N->getValueType(ResNo), true))
43 switch (N->getOpcode()) {
46 dbgs() << "PromoteIntegerResult #" << ResNo << ": ";
47 N->dump(&DAG); dbgs() << "\n";
49 llvm_unreachable("Do not know how to promote this operator!");
50 case ISD::MERGE_VALUES:Res = PromoteIntRes_MERGE_VALUES(N, ResNo); break;
51 case ISD::AssertSext: Res = PromoteIntRes_AssertSext(N); break;
52 case ISD::AssertZext: Res = PromoteIntRes_AssertZext(N); break;
53 case ISD::BITCAST: Res = PromoteIntRes_BITCAST(N); break;
54 case ISD::BSWAP: Res = PromoteIntRes_BSWAP(N); break;
55 case ISD::BUILD_PAIR: Res = PromoteIntRes_BUILD_PAIR(N); break;
56 case ISD::Constant: Res = PromoteIntRes_Constant(N); break;
57 case ISD::CONVERT_RNDSAT:
58 Res = PromoteIntRes_CONVERT_RNDSAT(N); break;
59 case ISD::CTLZ_ZERO_UNDEF:
60 case ISD::CTLZ: Res = PromoteIntRes_CTLZ(N); break;
61 case ISD::CTPOP: Res = PromoteIntRes_CTPOP(N); break;
62 case ISD::CTTZ_ZERO_UNDEF:
63 case ISD::CTTZ: Res = PromoteIntRes_CTTZ(N); break;
64 case ISD::EXTRACT_VECTOR_ELT:
65 Res = PromoteIntRes_EXTRACT_VECTOR_ELT(N); break;
66 case ISD::LOAD: Res = PromoteIntRes_LOAD(cast<LoadSDNode>(N));break;
67 case ISD::SELECT: Res = PromoteIntRes_SELECT(N); break;
68 case ISD::VSELECT: Res = PromoteIntRes_VSELECT(N); break;
69 case ISD::SELECT_CC: Res = PromoteIntRes_SELECT_CC(N); break;
70 case ISD::SETCC: Res = PromoteIntRes_SETCC(N); break;
71 case ISD::SHL: Res = PromoteIntRes_SHL(N); break;
72 case ISD::SIGN_EXTEND_INREG:
73 Res = PromoteIntRes_SIGN_EXTEND_INREG(N); break;
74 case ISD::SRA: Res = PromoteIntRes_SRA(N); break;
75 case ISD::SRL: Res = PromoteIntRes_SRL(N); break;
76 case ISD::TRUNCATE: Res = PromoteIntRes_TRUNCATE(N); break;
77 case ISD::UNDEF: Res = PromoteIntRes_UNDEF(N); break;
78 case ISD::VAARG: Res = PromoteIntRes_VAARG(N); break;
80 case ISD::EXTRACT_SUBVECTOR:
81 Res = PromoteIntRes_EXTRACT_SUBVECTOR(N); break;
82 case ISD::VECTOR_SHUFFLE:
83 Res = PromoteIntRes_VECTOR_SHUFFLE(N); break;
84 case ISD::INSERT_VECTOR_ELT:
85 Res = PromoteIntRes_INSERT_VECTOR_ELT(N); break;
86 case ISD::BUILD_VECTOR:
87 Res = PromoteIntRes_BUILD_VECTOR(N); break;
88 case ISD::SCALAR_TO_VECTOR:
89 Res = PromoteIntRes_SCALAR_TO_VECTOR(N); break;
90 case ISD::CONCAT_VECTORS:
91 Res = PromoteIntRes_CONCAT_VECTORS(N); break;
93 case ISD::SIGN_EXTEND:
94 case ISD::ZERO_EXTEND:
95 case ISD::ANY_EXTEND: Res = PromoteIntRes_INT_EXTEND(N); break;
98 case ISD::FP_TO_UINT: Res = PromoteIntRes_FP_TO_XINT(N); break;
100 case ISD::FP32_TO_FP16:Res = PromoteIntRes_FP32_TO_FP16(N); break;
107 case ISD::MUL: Res = PromoteIntRes_SimpleIntBinOp(N); break;
110 case ISD::SREM: Res = PromoteIntRes_SDIV(N); break;
113 case ISD::UREM: Res = PromoteIntRes_UDIV(N); break;
116 case ISD::SSUBO: Res = PromoteIntRes_SADDSUBO(N, ResNo); break;
118 case ISD::USUBO: Res = PromoteIntRes_UADDSUBO(N, ResNo); break;
120 case ISD::UMULO: Res = PromoteIntRes_XMULO(N, ResNo); break;
122 case ISD::ATOMIC_LOAD:
123 Res = PromoteIntRes_Atomic0(cast<AtomicSDNode>(N)); break;
125 case ISD::ATOMIC_LOAD_ADD:
126 case ISD::ATOMIC_LOAD_SUB:
127 case ISD::ATOMIC_LOAD_AND:
128 case ISD::ATOMIC_LOAD_OR:
129 case ISD::ATOMIC_LOAD_XOR:
130 case ISD::ATOMIC_LOAD_NAND:
131 case ISD::ATOMIC_LOAD_MIN:
132 case ISD::ATOMIC_LOAD_MAX:
133 case ISD::ATOMIC_LOAD_UMIN:
134 case ISD::ATOMIC_LOAD_UMAX:
135 case ISD::ATOMIC_SWAP:
136 Res = PromoteIntRes_Atomic1(cast<AtomicSDNode>(N)); break;
138 case ISD::ATOMIC_CMP_SWAP:
139 Res = PromoteIntRes_Atomic2(cast<AtomicSDNode>(N)); break;
142 // If the result is null then the sub-method took care of registering it.
144 SetPromotedInteger(SDValue(N, ResNo), Res);
147 SDValue DAGTypeLegalizer::PromoteIntRes_MERGE_VALUES(SDNode *N,
149 SDValue Op = DisintegrateMERGE_VALUES(N, ResNo);
150 return GetPromotedInteger(Op);
153 SDValue DAGTypeLegalizer::PromoteIntRes_AssertSext(SDNode *N) {
154 // Sign-extend the new bits, and continue the assertion.
155 SDValue Op = SExtPromotedInteger(N->getOperand(0));
156 return DAG.getNode(ISD::AssertSext, SDLoc(N),
157 Op.getValueType(), Op, N->getOperand(1));
160 SDValue DAGTypeLegalizer::PromoteIntRes_AssertZext(SDNode *N) {
161 // Zero the new bits, and continue the assertion.
162 SDValue Op = ZExtPromotedInteger(N->getOperand(0));
163 return DAG.getNode(ISD::AssertZext, SDLoc(N),
164 Op.getValueType(), Op, N->getOperand(1));
167 SDValue DAGTypeLegalizer::PromoteIntRes_Atomic0(AtomicSDNode *N) {
168 EVT ResVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
169 SDValue Res = DAG.getAtomic(N->getOpcode(), SDLoc(N),
170 N->getMemoryVT(), ResVT,
171 N->getChain(), N->getBasePtr(),
172 N->getMemOperand(), N->getOrdering(),
174 // Legalized the chain result - switch anything that used the old chain to
176 ReplaceValueWith(SDValue(N, 1), Res.getValue(1));
180 SDValue DAGTypeLegalizer::PromoteIntRes_Atomic1(AtomicSDNode *N) {
181 SDValue Op2 = GetPromotedInteger(N->getOperand(2));
182 SDValue Res = DAG.getAtomic(N->getOpcode(), SDLoc(N),
184 N->getChain(), N->getBasePtr(),
185 Op2, N->getMemOperand(), N->getOrdering(),
187 // Legalized the chain result - switch anything that used the old chain to
189 ReplaceValueWith(SDValue(N, 1), Res.getValue(1));
193 SDValue DAGTypeLegalizer::PromoteIntRes_Atomic2(AtomicSDNode *N) {
194 SDValue Op2 = GetPromotedInteger(N->getOperand(2));
195 SDValue Op3 = GetPromotedInteger(N->getOperand(3));
196 SDValue Res = DAG.getAtomic(N->getOpcode(), SDLoc(N),
197 N->getMemoryVT(), N->getChain(), N->getBasePtr(),
198 Op2, Op3, N->getMemOperand(), N->getOrdering(),
200 // Legalized the chain result - switch anything that used the old chain to
202 ReplaceValueWith(SDValue(N, 1), Res.getValue(1));
206 SDValue DAGTypeLegalizer::PromoteIntRes_BITCAST(SDNode *N) {
207 SDValue InOp = N->getOperand(0);
208 EVT InVT = InOp.getValueType();
209 EVT NInVT = TLI.getTypeToTransformTo(*DAG.getContext(), InVT);
210 EVT OutVT = N->getValueType(0);
211 EVT NOutVT = TLI.getTypeToTransformTo(*DAG.getContext(), OutVT);
214 switch (getTypeAction(InVT)) {
215 case TargetLowering::TypeLegal:
217 case TargetLowering::TypePromoteInteger:
218 if (NOutVT.bitsEq(NInVT) && !NOutVT.isVector() && !NInVT.isVector())
219 // The input promotes to the same size. Convert the promoted value.
220 return DAG.getNode(ISD::BITCAST, dl, NOutVT, GetPromotedInteger(InOp));
222 case TargetLowering::TypeSoftenFloat:
223 // Promote the integer operand by hand.
224 return DAG.getNode(ISD::ANY_EXTEND, dl, NOutVT, GetSoftenedFloat(InOp));
225 case TargetLowering::TypeExpandInteger:
226 case TargetLowering::TypeExpandFloat:
228 case TargetLowering::TypeScalarizeVector:
229 // Convert the element to an integer and promote it by hand.
230 if (!NOutVT.isVector())
231 return DAG.getNode(ISD::ANY_EXTEND, dl, NOutVT,
232 BitConvertToInteger(GetScalarizedVector(InOp)));
234 case TargetLowering::TypeSplitVector: {
235 // For example, i32 = BITCAST v2i16 on alpha. Convert the split
236 // pieces of the input into integers and reassemble in the final type.
238 GetSplitVector(N->getOperand(0), Lo, Hi);
239 Lo = BitConvertToInteger(Lo);
240 Hi = BitConvertToInteger(Hi);
242 if (TLI.isBigEndian())
245 InOp = DAG.getNode(ISD::ANY_EXTEND, dl,
246 EVT::getIntegerVT(*DAG.getContext(),
247 NOutVT.getSizeInBits()),
248 JoinIntegers(Lo, Hi));
249 return DAG.getNode(ISD::BITCAST, dl, NOutVT, InOp);
251 case TargetLowering::TypeWidenVector:
252 // The input is widened to the same size. Convert to the widened value.
253 // Make sure that the outgoing value is not a vector, because this would
254 // make us bitcast between two vectors which are legalized in different ways.
255 if (NOutVT.bitsEq(NInVT) && !NOutVT.isVector())
256 return DAG.getNode(ISD::BITCAST, dl, NOutVT, GetWidenedVector(InOp));
259 return DAG.getNode(ISD::ANY_EXTEND, dl, NOutVT,
260 CreateStackStoreLoad(InOp, OutVT));
263 SDValue DAGTypeLegalizer::PromoteIntRes_BSWAP(SDNode *N) {
264 SDValue Op = GetPromotedInteger(N->getOperand(0));
265 EVT OVT = N->getValueType(0);
266 EVT NVT = Op.getValueType();
269 unsigned DiffBits = NVT.getSizeInBits() - OVT.getSizeInBits();
270 return DAG.getNode(ISD::SRL, dl, NVT, DAG.getNode(ISD::BSWAP, dl, NVT, Op),
271 DAG.getConstant(DiffBits, TLI.getPointerTy()));
274 SDValue DAGTypeLegalizer::PromoteIntRes_BUILD_PAIR(SDNode *N) {
275 // The pair element type may be legal, or may not promote to the same type as
276 // the result, for example i14 = BUILD_PAIR (i7, i7). Handle all cases.
277 return DAG.getNode(ISD::ANY_EXTEND, SDLoc(N),
278 TLI.getTypeToTransformTo(*DAG.getContext(),
279 N->getValueType(0)), JoinIntegers(N->getOperand(0),
283 SDValue DAGTypeLegalizer::PromoteIntRes_Constant(SDNode *N) {
284 EVT VT = N->getValueType(0);
285 // FIXME there is no actual debug info here
287 // Zero extend things like i1, sign extend everything else. It shouldn't
288 // matter in theory which one we pick, but this tends to give better code?
289 unsigned Opc = VT.isByteSized() ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
290 SDValue Result = DAG.getNode(Opc, dl,
291 TLI.getTypeToTransformTo(*DAG.getContext(), VT),
293 assert(isa<ConstantSDNode>(Result) && "Didn't constant fold ext?");
297 SDValue DAGTypeLegalizer::PromoteIntRes_CONVERT_RNDSAT(SDNode *N) {
298 ISD::CvtCode CvtCode = cast<CvtRndSatSDNode>(N)->getCvtCode();
299 assert ((CvtCode == ISD::CVT_SS || CvtCode == ISD::CVT_SU ||
300 CvtCode == ISD::CVT_US || CvtCode == ISD::CVT_UU ||
301 CvtCode == ISD::CVT_SF || CvtCode == ISD::CVT_UF) &&
302 "can only promote integers");
303 EVT OutVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
304 return DAG.getConvertRndSat(OutVT, SDLoc(N), N->getOperand(0),
305 N->getOperand(1), N->getOperand(2),
306 N->getOperand(3), N->getOperand(4), CvtCode);
309 SDValue DAGTypeLegalizer::PromoteIntRes_CTLZ(SDNode *N) {
310 // Zero extend to the promoted type and do the count there.
311 SDValue Op = ZExtPromotedInteger(N->getOperand(0));
313 EVT OVT = N->getValueType(0);
314 EVT NVT = Op.getValueType();
315 Op = DAG.getNode(N->getOpcode(), dl, NVT, Op);
316 // Subtract off the extra leading bits in the bigger type.
317 return DAG.getNode(ISD::SUB, dl, NVT, Op,
318 DAG.getConstant(NVT.getSizeInBits() -
319 OVT.getSizeInBits(), NVT));
322 SDValue DAGTypeLegalizer::PromoteIntRes_CTPOP(SDNode *N) {
323 // Zero extend to the promoted type and do the count there.
324 SDValue Op = ZExtPromotedInteger(N->getOperand(0));
325 return DAG.getNode(ISD::CTPOP, SDLoc(N), Op.getValueType(), Op);
328 SDValue DAGTypeLegalizer::PromoteIntRes_CTTZ(SDNode *N) {
329 SDValue Op = GetPromotedInteger(N->getOperand(0));
330 EVT OVT = N->getValueType(0);
331 EVT NVT = Op.getValueType();
333 if (N->getOpcode() == ISD::CTTZ) {
334 // The count is the same in the promoted type except if the original
335 // value was zero. This can be handled by setting the bit just off
336 // the top of the original type.
337 APInt TopBit(NVT.getSizeInBits(), 0);
338 TopBit.setBit(OVT.getSizeInBits());
339 Op = DAG.getNode(ISD::OR, dl, NVT, Op, DAG.getConstant(TopBit, NVT));
341 return DAG.getNode(N->getOpcode(), dl, NVT, Op);
344 SDValue DAGTypeLegalizer::PromoteIntRes_EXTRACT_VECTOR_ELT(SDNode *N) {
346 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
347 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, NVT, N->getOperand(0),
351 SDValue DAGTypeLegalizer::PromoteIntRes_FP_TO_XINT(SDNode *N) {
352 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
353 unsigned NewOpc = N->getOpcode();
356 // If we're promoting a UINT to a larger size and the larger FP_TO_UINT is
357 // not Legal, check to see if we can use FP_TO_SINT instead. (If both UINT
358 // and SINT conversions are Custom, there is no way to tell which is
359 // preferable. We choose SINT because that's the right thing on PPC.)
360 if (N->getOpcode() == ISD::FP_TO_UINT &&
361 !TLI.isOperationLegal(ISD::FP_TO_UINT, NVT) &&
362 TLI.isOperationLegalOrCustom(ISD::FP_TO_SINT, NVT))
363 NewOpc = ISD::FP_TO_SINT;
365 SDValue Res = DAG.getNode(NewOpc, dl, NVT, N->getOperand(0));
367 // Assert that the converted value fits in the original type. If it doesn't
368 // (eg: because the value being converted is too big), then the result of the
369 // original operation was undefined anyway, so the assert is still correct.
370 return DAG.getNode(N->getOpcode() == ISD::FP_TO_UINT ?
371 ISD::AssertZext : ISD::AssertSext, dl, NVT, Res,
372 DAG.getValueType(N->getValueType(0).getScalarType()));
375 SDValue DAGTypeLegalizer::PromoteIntRes_FP32_TO_FP16(SDNode *N) {
376 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
379 SDValue Res = DAG.getNode(N->getOpcode(), dl, NVT, N->getOperand(0));
381 return DAG.getNode(ISD::AssertZext, dl,
382 NVT, Res, DAG.getValueType(N->getValueType(0)));
385 SDValue DAGTypeLegalizer::PromoteIntRes_INT_EXTEND(SDNode *N) {
386 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
389 if (getTypeAction(N->getOperand(0).getValueType())
390 == TargetLowering::TypePromoteInteger) {
391 SDValue Res = GetPromotedInteger(N->getOperand(0));
392 assert(Res.getValueType().bitsLE(NVT) && "Extension doesn't make sense!");
394 // If the result and operand types are the same after promotion, simplify
395 // to an in-register extension.
396 if (NVT == Res.getValueType()) {
397 // The high bits are not guaranteed to be anything. Insert an extend.
398 if (N->getOpcode() == ISD::SIGN_EXTEND)
399 return DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, NVT, Res,
400 DAG.getValueType(N->getOperand(0).getValueType()));
401 if (N->getOpcode() == ISD::ZERO_EXTEND)
402 return DAG.getZeroExtendInReg(Res, dl,
403 N->getOperand(0).getValueType().getScalarType());
404 assert(N->getOpcode() == ISD::ANY_EXTEND && "Unknown integer extension!");
409 // Otherwise, just extend the original operand all the way to the larger type.
410 return DAG.getNode(N->getOpcode(), dl, NVT, N->getOperand(0));
413 SDValue DAGTypeLegalizer::PromoteIntRes_LOAD(LoadSDNode *N) {
414 assert(ISD::isUNINDEXEDLoad(N) && "Indexed load during type legalization!");
415 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
416 ISD::LoadExtType ExtType =
417 ISD::isNON_EXTLoad(N) ? ISD::EXTLOAD : N->getExtensionType();
419 SDValue Res = DAG.getExtLoad(ExtType, dl, NVT, N->getChain(), N->getBasePtr(),
421 N->getMemoryVT(), N->isVolatile(),
422 N->isNonTemporal(), N->getAlignment());
424 // Legalized the chain result - switch anything that used the old chain to
426 ReplaceValueWith(SDValue(N, 1), Res.getValue(1));
430 /// Promote the overflow flag of an overflowing arithmetic node.
431 SDValue DAGTypeLegalizer::PromoteIntRes_Overflow(SDNode *N) {
432 // Simply change the return type of the boolean result.
433 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(1));
434 EVT ValueVTs[] = { N->getValueType(0), NVT };
435 SDValue Ops[] = { N->getOperand(0), N->getOperand(1) };
436 SDValue Res = DAG.getNode(N->getOpcode(), SDLoc(N),
437 DAG.getVTList(ValueVTs, 2), Ops, 2);
439 // Modified the sum result - switch anything that used the old sum to use
441 ReplaceValueWith(SDValue(N, 0), Res);
443 return SDValue(Res.getNode(), 1);
446 SDValue DAGTypeLegalizer::PromoteIntRes_SADDSUBO(SDNode *N, unsigned ResNo) {
448 return PromoteIntRes_Overflow(N);
450 // The operation overflowed iff the result in the larger type is not the
451 // sign extension of its truncation to the original type.
452 SDValue LHS = SExtPromotedInteger(N->getOperand(0));
453 SDValue RHS = SExtPromotedInteger(N->getOperand(1));
454 EVT OVT = N->getOperand(0).getValueType();
455 EVT NVT = LHS.getValueType();
458 // Do the arithmetic in the larger type.
459 unsigned Opcode = N->getOpcode() == ISD::SADDO ? ISD::ADD : ISD::SUB;
460 SDValue Res = DAG.getNode(Opcode, dl, NVT, LHS, RHS);
462 // Calculate the overflow flag: sign extend the arithmetic result from
463 // the original type.
464 SDValue Ofl = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, NVT, Res,
465 DAG.getValueType(OVT));
466 // Overflowed if and only if this is not equal to Res.
467 Ofl = DAG.getSetCC(dl, N->getValueType(1), Ofl, Res, ISD::SETNE);
469 // Use the calculated overflow everywhere.
470 ReplaceValueWith(SDValue(N, 1), Ofl);
475 SDValue DAGTypeLegalizer::PromoteIntRes_SDIV(SDNode *N) {
476 // Sign extend the input.
477 SDValue LHS = SExtPromotedInteger(N->getOperand(0));
478 SDValue RHS = SExtPromotedInteger(N->getOperand(1));
479 return DAG.getNode(N->getOpcode(), SDLoc(N),
480 LHS.getValueType(), LHS, RHS);
483 SDValue DAGTypeLegalizer::PromoteIntRes_SELECT(SDNode *N) {
484 SDValue LHS = GetPromotedInteger(N->getOperand(1));
485 SDValue RHS = GetPromotedInteger(N->getOperand(2));
486 return DAG.getSelect(SDLoc(N),
487 LHS.getValueType(), N->getOperand(0), LHS, RHS);
490 SDValue DAGTypeLegalizer::PromoteIntRes_VSELECT(SDNode *N) {
491 SDValue Mask = N->getOperand(0);
492 EVT OpTy = N->getOperand(1).getValueType();
494 // Promote all the way up to the canonical SetCC type.
495 Mask = PromoteTargetBoolean(Mask, getSetCCResultType(OpTy));
496 SDValue LHS = GetPromotedInteger(N->getOperand(1));
497 SDValue RHS = GetPromotedInteger(N->getOperand(2));
498 return DAG.getNode(ISD::VSELECT, SDLoc(N),
499 LHS.getValueType(), Mask, LHS, RHS);
502 SDValue DAGTypeLegalizer::PromoteIntRes_SELECT_CC(SDNode *N) {
503 SDValue LHS = GetPromotedInteger(N->getOperand(2));
504 SDValue RHS = GetPromotedInteger(N->getOperand(3));
505 return DAG.getNode(ISD::SELECT_CC, SDLoc(N),
506 LHS.getValueType(), N->getOperand(0),
507 N->getOperand(1), LHS, RHS, N->getOperand(4));
510 SDValue DAGTypeLegalizer::PromoteIntRes_SETCC(SDNode *N) {
511 EVT SVT = getSetCCResultType(N->getOperand(0).getValueType());
513 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
515 // Only use the result of getSetCCResultType if it is legal,
516 // otherwise just use the promoted result type (NVT).
517 if (!TLI.isTypeLegal(SVT))
521 assert(SVT.isVector() == N->getOperand(0).getValueType().isVector() &&
522 "Vector compare must return a vector result!");
524 SDValue LHS = N->getOperand(0);
525 SDValue RHS = N->getOperand(1);
526 if (LHS.getValueType() != RHS.getValueType()) {
527 if (getTypeAction(LHS.getValueType()) == TargetLowering::TypePromoteInteger &&
528 !LHS.getValueType().isVector())
529 LHS = GetPromotedInteger(LHS);
530 if (getTypeAction(RHS.getValueType()) == TargetLowering::TypePromoteInteger &&
531 !RHS.getValueType().isVector())
532 RHS = GetPromotedInteger(RHS);
535 // Get the SETCC result using the canonical SETCC type.
536 SDValue SetCC = DAG.getNode(N->getOpcode(), dl, SVT, LHS, RHS,
539 assert(NVT.bitsLE(SVT) && "Integer type overpromoted?");
540 // Convert to the expected type.
541 return DAG.getNode(ISD::TRUNCATE, dl, NVT, SetCC);
544 SDValue DAGTypeLegalizer::PromoteIntRes_SHL(SDNode *N) {
545 SDValue Res = GetPromotedInteger(N->getOperand(0));
546 SDValue Amt = N->getOperand(1);
547 Amt = Amt.getValueType().isVector() ? ZExtPromotedInteger(Amt) : Amt;
548 return DAG.getNode(ISD::SHL, SDLoc(N), Res.getValueType(), Res, Amt);
551 SDValue DAGTypeLegalizer::PromoteIntRes_SIGN_EXTEND_INREG(SDNode *N) {
552 SDValue Op = GetPromotedInteger(N->getOperand(0));
553 return DAG.getNode(ISD::SIGN_EXTEND_INREG, SDLoc(N),
554 Op.getValueType(), Op, N->getOperand(1));
557 SDValue DAGTypeLegalizer::PromoteIntRes_SimpleIntBinOp(SDNode *N) {
558 // The input may have strange things in the top bits of the registers, but
559 // these operations don't care. They may have weird bits going out, but
560 // that too is okay if they are integer operations.
561 SDValue LHS = GetPromotedInteger(N->getOperand(0));
562 SDValue RHS = GetPromotedInteger(N->getOperand(1));
563 return DAG.getNode(N->getOpcode(), SDLoc(N),
564 LHS.getValueType(), LHS, RHS);
567 SDValue DAGTypeLegalizer::PromoteIntRes_SRA(SDNode *N) {
568 // The input value must be properly sign extended.
569 SDValue Res = SExtPromotedInteger(N->getOperand(0));
570 SDValue Amt = N->getOperand(1);
571 Amt = Amt.getValueType().isVector() ? ZExtPromotedInteger(Amt) : Amt;
572 return DAG.getNode(ISD::SRA, SDLoc(N), Res.getValueType(), Res, Amt);
575 SDValue DAGTypeLegalizer::PromoteIntRes_SRL(SDNode *N) {
576 // The input value must be properly zero extended.
577 SDValue Res = ZExtPromotedInteger(N->getOperand(0));
578 SDValue Amt = N->getOperand(1);
579 Amt = Amt.getValueType().isVector() ? ZExtPromotedInteger(Amt) : Amt;
580 return DAG.getNode(ISD::SRL, SDLoc(N), Res.getValueType(), Res, Amt);
583 SDValue DAGTypeLegalizer::PromoteIntRes_TRUNCATE(SDNode *N) {
584 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
586 SDValue InOp = N->getOperand(0);
589 switch (getTypeAction(InOp.getValueType())) {
590 default: llvm_unreachable("Unknown type action!");
591 case TargetLowering::TypeLegal:
592 case TargetLowering::TypeExpandInteger:
595 case TargetLowering::TypePromoteInteger:
596 Res = GetPromotedInteger(InOp);
598 case TargetLowering::TypeSplitVector:
599 EVT InVT = InOp.getValueType();
600 assert(InVT.isVector() && "Cannot split scalar types");
601 unsigned NumElts = InVT.getVectorNumElements();
602 assert(NumElts == NVT.getVectorNumElements() &&
603 "Dst and Src must have the same number of elements");
604 assert(isPowerOf2_32(NumElts) &&
605 "Promoted vector type must be a power of two");
608 GetSplitVector(InOp, EOp1, EOp2);
610 EVT HalfNVT = EVT::getVectorVT(*DAG.getContext(), NVT.getScalarType(),
612 EOp1 = DAG.getNode(ISD::TRUNCATE, dl, HalfNVT, EOp1);
613 EOp2 = DAG.getNode(ISD::TRUNCATE, dl, HalfNVT, EOp2);
615 return DAG.getNode(ISD::CONCAT_VECTORS, dl, NVT, EOp1, EOp2);
618 // Truncate to NVT instead of VT
619 return DAG.getNode(ISD::TRUNCATE, dl, NVT, Res);
622 SDValue DAGTypeLegalizer::PromoteIntRes_UADDSUBO(SDNode *N, unsigned ResNo) {
624 return PromoteIntRes_Overflow(N);
626 // The operation overflowed iff the result in the larger type is not the
627 // zero extension of its truncation to the original type.
628 SDValue LHS = ZExtPromotedInteger(N->getOperand(0));
629 SDValue RHS = ZExtPromotedInteger(N->getOperand(1));
630 EVT OVT = N->getOperand(0).getValueType();
631 EVT NVT = LHS.getValueType();
634 // Do the arithmetic in the larger type.
635 unsigned Opcode = N->getOpcode() == ISD::UADDO ? ISD::ADD : ISD::SUB;
636 SDValue Res = DAG.getNode(Opcode, dl, NVT, LHS, RHS);
638 // Calculate the overflow flag: zero extend the arithmetic result from
639 // the original type.
640 SDValue Ofl = DAG.getZeroExtendInReg(Res, dl, OVT);
641 // Overflowed if and only if this is not equal to Res.
642 Ofl = DAG.getSetCC(dl, N->getValueType(1), Ofl, Res, ISD::SETNE);
644 // Use the calculated overflow everywhere.
645 ReplaceValueWith(SDValue(N, 1), Ofl);
650 SDValue DAGTypeLegalizer::PromoteIntRes_XMULO(SDNode *N, unsigned ResNo) {
651 // Promote the overflow bit trivially.
653 return PromoteIntRes_Overflow(N);
655 SDValue LHS = N->getOperand(0), RHS = N->getOperand(1);
657 EVT SmallVT = LHS.getValueType();
659 // To determine if the result overflowed in a larger type, we extend the
660 // input to the larger type, do the multiply (checking if it overflows),
661 // then also check the high bits of the result to see if overflow happened
663 if (N->getOpcode() == ISD::SMULO) {
664 LHS = SExtPromotedInteger(LHS);
665 RHS = SExtPromotedInteger(RHS);
667 LHS = ZExtPromotedInteger(LHS);
668 RHS = ZExtPromotedInteger(RHS);
670 SDVTList VTs = DAG.getVTList(LHS.getValueType(), N->getValueType(1));
671 SDValue Mul = DAG.getNode(N->getOpcode(), DL, VTs, LHS, RHS);
673 // Overflow occurred if it occurred in the larger type, or if the high part
674 // of the result does not zero/sign-extend the low part. Check this second
675 // possibility first.
677 if (N->getOpcode() == ISD::UMULO) {
678 // Unsigned overflow occurred if the high part is non-zero.
679 SDValue Hi = DAG.getNode(ISD::SRL, DL, Mul.getValueType(), Mul,
680 DAG.getIntPtrConstant(SmallVT.getSizeInBits()));
681 Overflow = DAG.getSetCC(DL, N->getValueType(1), Hi,
682 DAG.getConstant(0, Hi.getValueType()), ISD::SETNE);
684 // Signed overflow occurred if the high part does not sign extend the low.
685 SDValue SExt = DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, Mul.getValueType(),
686 Mul, DAG.getValueType(SmallVT));
687 Overflow = DAG.getSetCC(DL, N->getValueType(1), SExt, Mul, ISD::SETNE);
690 // The only other way for overflow to occur is if the multiplication in the
691 // larger type itself overflowed.
692 Overflow = DAG.getNode(ISD::OR, DL, N->getValueType(1), Overflow,
693 SDValue(Mul.getNode(), 1));
695 // Use the calculated overflow everywhere.
696 ReplaceValueWith(SDValue(N, 1), Overflow);
700 SDValue DAGTypeLegalizer::PromoteIntRes_UDIV(SDNode *N) {
701 // Zero extend the input.
702 SDValue LHS = ZExtPromotedInteger(N->getOperand(0));
703 SDValue RHS = ZExtPromotedInteger(N->getOperand(1));
704 return DAG.getNode(N->getOpcode(), SDLoc(N),
705 LHS.getValueType(), LHS, RHS);
708 SDValue DAGTypeLegalizer::PromoteIntRes_UNDEF(SDNode *N) {
709 return DAG.getUNDEF(TLI.getTypeToTransformTo(*DAG.getContext(),
710 N->getValueType(0)));
713 SDValue DAGTypeLegalizer::PromoteIntRes_VAARG(SDNode *N) {
714 SDValue Chain = N->getOperand(0); // Get the chain.
715 SDValue Ptr = N->getOperand(1); // Get the pointer.
716 EVT VT = N->getValueType(0);
719 MVT RegVT = TLI.getRegisterType(*DAG.getContext(), VT);
720 unsigned NumRegs = TLI.getNumRegisters(*DAG.getContext(), VT);
721 // The argument is passed as NumRegs registers of type RegVT.
723 SmallVector<SDValue, 8> Parts(NumRegs);
724 for (unsigned i = 0; i < NumRegs; ++i) {
725 Parts[i] = DAG.getVAArg(RegVT, dl, Chain, Ptr, N->getOperand(2),
726 N->getConstantOperandVal(3));
727 Chain = Parts[i].getValue(1);
730 // Handle endianness of the load.
731 if (TLI.isBigEndian())
732 std::reverse(Parts.begin(), Parts.end());
734 // Assemble the parts in the promoted type.
735 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
736 SDValue Res = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Parts[0]);
737 for (unsigned i = 1; i < NumRegs; ++i) {
738 SDValue Part = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Parts[i]);
739 // Shift it to the right position and "or" it in.
740 Part = DAG.getNode(ISD::SHL, dl, NVT, Part,
741 DAG.getConstant(i * RegVT.getSizeInBits(),
742 TLI.getPointerTy()));
743 Res = DAG.getNode(ISD::OR, dl, NVT, Res, Part);
746 // Modified the chain result - switch anything that used the old chain to
748 ReplaceValueWith(SDValue(N, 1), Chain);
753 //===----------------------------------------------------------------------===//
754 // Integer Operand Promotion
755 //===----------------------------------------------------------------------===//
757 /// PromoteIntegerOperand - This method is called when the specified operand of
758 /// the specified node is found to need promotion. At this point, all of the
759 /// result types of the node are known to be legal, but other operands of the
760 /// node may need promotion or expansion as well as the specified one.
761 bool DAGTypeLegalizer::PromoteIntegerOperand(SDNode *N, unsigned OpNo) {
762 DEBUG(dbgs() << "Promote integer operand: "; N->dump(&DAG); dbgs() << "\n");
763 SDValue Res = SDValue();
765 if (CustomLowerNode(N, N->getOperand(OpNo).getValueType(), false))
768 switch (N->getOpcode()) {
771 dbgs() << "PromoteIntegerOperand Op #" << OpNo << ": ";
772 N->dump(&DAG); dbgs() << "\n";
774 llvm_unreachable("Do not know how to promote this operator's operand!");
776 case ISD::ANY_EXTEND: Res = PromoteIntOp_ANY_EXTEND(N); break;
777 case ISD::ATOMIC_STORE:
778 Res = PromoteIntOp_ATOMIC_STORE(cast<AtomicSDNode>(N));
780 case ISD::BITCAST: Res = PromoteIntOp_BITCAST(N); break;
781 case ISD::BR_CC: Res = PromoteIntOp_BR_CC(N, OpNo); break;
782 case ISD::BRCOND: Res = PromoteIntOp_BRCOND(N, OpNo); break;
783 case ISD::BUILD_PAIR: Res = PromoteIntOp_BUILD_PAIR(N); break;
784 case ISD::BUILD_VECTOR: Res = PromoteIntOp_BUILD_VECTOR(N); break;
785 case ISD::CONCAT_VECTORS: Res = PromoteIntOp_CONCAT_VECTORS(N); break;
786 case ISD::EXTRACT_VECTOR_ELT: Res = PromoteIntOp_EXTRACT_VECTOR_ELT(N); break;
787 case ISD::CONVERT_RNDSAT:
788 Res = PromoteIntOp_CONVERT_RNDSAT(N); break;
789 case ISD::INSERT_VECTOR_ELT:
790 Res = PromoteIntOp_INSERT_VECTOR_ELT(N, OpNo);break;
791 case ISD::SCALAR_TO_VECTOR:
792 Res = PromoteIntOp_SCALAR_TO_VECTOR(N); break;
794 case ISD::SELECT: Res = PromoteIntOp_SELECT(N, OpNo); break;
795 case ISD::SELECT_CC: Res = PromoteIntOp_SELECT_CC(N, OpNo); break;
796 case ISD::SETCC: Res = PromoteIntOp_SETCC(N, OpNo); break;
797 case ISD::SIGN_EXTEND: Res = PromoteIntOp_SIGN_EXTEND(N); break;
798 case ISD::SINT_TO_FP: Res = PromoteIntOp_SINT_TO_FP(N); break;
799 case ISD::STORE: Res = PromoteIntOp_STORE(cast<StoreSDNode>(N),
801 case ISD::TRUNCATE: Res = PromoteIntOp_TRUNCATE(N); break;
802 case ISD::FP16_TO_FP32:
803 case ISD::UINT_TO_FP: Res = PromoteIntOp_UINT_TO_FP(N); break;
804 case ISD::ZERO_EXTEND: Res = PromoteIntOp_ZERO_EXTEND(N); break;
810 case ISD::ROTR: Res = PromoteIntOp_Shift(N); break;
813 // If the result is null, the sub-method took care of registering results etc.
814 if (!Res.getNode()) return false;
816 // If the result is N, the sub-method updated N in place. Tell the legalizer
818 if (Res.getNode() == N)
821 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
822 "Invalid operand expansion");
824 ReplaceValueWith(SDValue(N, 0), Res);
828 /// PromoteSetCCOperands - Promote the operands of a comparison. This code is
829 /// shared among BR_CC, SELECT_CC, and SETCC handlers.
830 void DAGTypeLegalizer::PromoteSetCCOperands(SDValue &NewLHS,SDValue &NewRHS,
831 ISD::CondCode CCCode) {
832 // We have to insert explicit sign or zero extends. Note that we could
833 // insert sign extends for ALL conditions, but zero extend is cheaper on
834 // many machines (an AND instead of two shifts), so prefer it.
836 default: llvm_unreachable("Unknown integer comparison!");
843 // ALL of these operations will work if we either sign or zero extend
844 // the operands (including the unsigned comparisons!). Zero extend is
845 // usually a simpler/cheaper operation, so prefer it.
846 NewLHS = ZExtPromotedInteger(NewLHS);
847 NewRHS = ZExtPromotedInteger(NewRHS);
853 NewLHS = SExtPromotedInteger(NewLHS);
854 NewRHS = SExtPromotedInteger(NewRHS);
859 SDValue DAGTypeLegalizer::PromoteIntOp_ANY_EXTEND(SDNode *N) {
860 SDValue Op = GetPromotedInteger(N->getOperand(0));
861 return DAG.getNode(ISD::ANY_EXTEND, SDLoc(N), N->getValueType(0), Op);
864 SDValue DAGTypeLegalizer::PromoteIntOp_ATOMIC_STORE(AtomicSDNode *N) {
865 SDValue Op2 = GetPromotedInteger(N->getOperand(2));
866 return DAG.getAtomic(N->getOpcode(), SDLoc(N), N->getMemoryVT(),
867 N->getChain(), N->getBasePtr(), Op2, N->getMemOperand(),
868 N->getOrdering(), N->getSynchScope());
871 SDValue DAGTypeLegalizer::PromoteIntOp_BITCAST(SDNode *N) {
872 // This should only occur in unusual situations like bitcasting to an
873 // x86_fp80, so just turn it into a store+load
874 return CreateStackStoreLoad(N->getOperand(0), N->getValueType(0));
877 SDValue DAGTypeLegalizer::PromoteIntOp_BR_CC(SDNode *N, unsigned OpNo) {
878 assert(OpNo == 2 && "Don't know how to promote this operand!");
880 SDValue LHS = N->getOperand(2);
881 SDValue RHS = N->getOperand(3);
882 PromoteSetCCOperands(LHS, RHS, cast<CondCodeSDNode>(N->getOperand(1))->get());
884 // The chain (Op#0), CC (#1) and basic block destination (Op#4) are always
886 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0),
887 N->getOperand(1), LHS, RHS, N->getOperand(4)),
891 SDValue DAGTypeLegalizer::PromoteIntOp_BRCOND(SDNode *N, unsigned OpNo) {
892 assert(OpNo == 1 && "only know how to promote condition");
894 // Promote all the way up to the canonical SetCC type.
895 EVT SVT = getSetCCResultType(MVT::Other);
896 SDValue Cond = PromoteTargetBoolean(N->getOperand(1), SVT);
898 // The chain (Op#0) and basic block destination (Op#2) are always legal types.
899 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0), Cond,
900 N->getOperand(2)), 0);
903 SDValue DAGTypeLegalizer::PromoteIntOp_BUILD_PAIR(SDNode *N) {
904 // Since the result type is legal, the operands must promote to it.
905 EVT OVT = N->getOperand(0).getValueType();
906 SDValue Lo = ZExtPromotedInteger(N->getOperand(0));
907 SDValue Hi = GetPromotedInteger(N->getOperand(1));
908 assert(Lo.getValueType() == N->getValueType(0) && "Operand over promoted?");
911 Hi = DAG.getNode(ISD::SHL, dl, N->getValueType(0), Hi,
912 DAG.getConstant(OVT.getSizeInBits(), TLI.getPointerTy()));
913 return DAG.getNode(ISD::OR, dl, N->getValueType(0), Lo, Hi);
916 SDValue DAGTypeLegalizer::PromoteIntOp_BUILD_VECTOR(SDNode *N) {
917 // The vector type is legal but the element type is not. This implies
918 // that the vector is a power-of-two in length and that the element
919 // type does not have a strange size (eg: it is not i1).
920 EVT VecVT = N->getValueType(0);
921 unsigned NumElts = VecVT.getVectorNumElements();
922 assert(!(NumElts & 1) && "Legal vector of one illegal element?");
924 // Promote the inserted value. The type does not need to match the
925 // vector element type. Check that any extra bits introduced will be
927 assert(N->getOperand(0).getValueType().getSizeInBits() >=
928 N->getValueType(0).getVectorElementType().getSizeInBits() &&
929 "Type of inserted value narrower than vector element type!");
931 SmallVector<SDValue, 16> NewOps;
932 for (unsigned i = 0; i < NumElts; ++i)
933 NewOps.push_back(GetPromotedInteger(N->getOperand(i)));
935 return SDValue(DAG.UpdateNodeOperands(N, &NewOps[0], NumElts), 0);
938 SDValue DAGTypeLegalizer::PromoteIntOp_CONVERT_RNDSAT(SDNode *N) {
939 ISD::CvtCode CvtCode = cast<CvtRndSatSDNode>(N)->getCvtCode();
940 assert ((CvtCode == ISD::CVT_SS || CvtCode == ISD::CVT_SU ||
941 CvtCode == ISD::CVT_US || CvtCode == ISD::CVT_UU ||
942 CvtCode == ISD::CVT_FS || CvtCode == ISD::CVT_FU) &&
943 "can only promote integer arguments");
944 SDValue InOp = GetPromotedInteger(N->getOperand(0));
945 return DAG.getConvertRndSat(N->getValueType(0), SDLoc(N), InOp,
946 N->getOperand(1), N->getOperand(2),
947 N->getOperand(3), N->getOperand(4), CvtCode);
950 SDValue DAGTypeLegalizer::PromoteIntOp_INSERT_VECTOR_ELT(SDNode *N,
953 // Promote the inserted value. This is valid because the type does not
954 // have to match the vector element type.
956 // Check that any extra bits introduced will be truncated away.
957 assert(N->getOperand(1).getValueType().getSizeInBits() >=
958 N->getValueType(0).getVectorElementType().getSizeInBits() &&
959 "Type of inserted value narrower than vector element type!");
960 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0),
961 GetPromotedInteger(N->getOperand(1)),
966 assert(OpNo == 2 && "Different operand and result vector types?");
968 // Promote the index.
969 SDValue Idx = DAG.getZExtOrTrunc(N->getOperand(2), SDLoc(N),
970 TLI.getVectorIdxTy());
971 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0),
972 N->getOperand(1), Idx), 0);
975 SDValue DAGTypeLegalizer::PromoteIntOp_SCALAR_TO_VECTOR(SDNode *N) {
976 // Integer SCALAR_TO_VECTOR operands are implicitly truncated, so just promote
977 // the operand in place.
978 return SDValue(DAG.UpdateNodeOperands(N,
979 GetPromotedInteger(N->getOperand(0))), 0);
982 SDValue DAGTypeLegalizer::PromoteIntOp_SELECT(SDNode *N, unsigned OpNo) {
983 assert(OpNo == 0 && "Only know how to promote the condition!");
984 SDValue Cond = N->getOperand(0);
985 EVT OpTy = N->getOperand(1).getValueType();
987 // Promote all the way up to the canonical SetCC type.
988 EVT SVT = getSetCCResultType(N->getOpcode() == ISD::SELECT ?
989 OpTy.getScalarType() : OpTy);
990 Cond = PromoteTargetBoolean(Cond, SVT);
992 return SDValue(DAG.UpdateNodeOperands(N, Cond, N->getOperand(1),
993 N->getOperand(2)), 0);
996 SDValue DAGTypeLegalizer::PromoteIntOp_SELECT_CC(SDNode *N, unsigned OpNo) {
997 assert(OpNo == 0 && "Don't know how to promote this operand!");
999 SDValue LHS = N->getOperand(0);
1000 SDValue RHS = N->getOperand(1);
1001 PromoteSetCCOperands(LHS, RHS, cast<CondCodeSDNode>(N->getOperand(4))->get());
1003 // The CC (#4) and the possible return values (#2 and #3) have legal types.
1004 return SDValue(DAG.UpdateNodeOperands(N, LHS, RHS, N->getOperand(2),
1005 N->getOperand(3), N->getOperand(4)), 0);
1008 SDValue DAGTypeLegalizer::PromoteIntOp_SETCC(SDNode *N, unsigned OpNo) {
1009 assert(OpNo == 0 && "Don't know how to promote this operand!");
1011 SDValue LHS = N->getOperand(0);
1012 SDValue RHS = N->getOperand(1);
1013 PromoteSetCCOperands(LHS, RHS, cast<CondCodeSDNode>(N->getOperand(2))->get());
1015 // The CC (#2) is always legal.
1016 return SDValue(DAG.UpdateNodeOperands(N, LHS, RHS, N->getOperand(2)), 0);
1019 SDValue DAGTypeLegalizer::PromoteIntOp_Shift(SDNode *N) {
1020 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0),
1021 ZExtPromotedInteger(N->getOperand(1))), 0);
1024 SDValue DAGTypeLegalizer::PromoteIntOp_SIGN_EXTEND(SDNode *N) {
1025 SDValue Op = GetPromotedInteger(N->getOperand(0));
1027 Op = DAG.getNode(ISD::ANY_EXTEND, dl, N->getValueType(0), Op);
1028 return DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Op.getValueType(),
1029 Op, DAG.getValueType(N->getOperand(0).getValueType()));
1032 SDValue DAGTypeLegalizer::PromoteIntOp_SINT_TO_FP(SDNode *N) {
1033 return SDValue(DAG.UpdateNodeOperands(N,
1034 SExtPromotedInteger(N->getOperand(0))), 0);
1037 SDValue DAGTypeLegalizer::PromoteIntOp_STORE(StoreSDNode *N, unsigned OpNo){
1038 assert(ISD::isUNINDEXEDStore(N) && "Indexed store during type legalization!");
1039 SDValue Ch = N->getChain(), Ptr = N->getBasePtr();
1040 unsigned Alignment = N->getAlignment();
1041 bool isVolatile = N->isVolatile();
1042 bool isNonTemporal = N->isNonTemporal();
1045 SDValue Val = GetPromotedInteger(N->getValue()); // Get promoted value.
1047 // Truncate the value and store the result.
1048 return DAG.getTruncStore(Ch, dl, Val, Ptr, N->getPointerInfo(),
1050 isVolatile, isNonTemporal, Alignment);
1053 SDValue DAGTypeLegalizer::PromoteIntOp_TRUNCATE(SDNode *N) {
1054 SDValue Op = GetPromotedInteger(N->getOperand(0));
1055 return DAG.getNode(ISD::TRUNCATE, SDLoc(N), N->getValueType(0), Op);
1058 SDValue DAGTypeLegalizer::PromoteIntOp_UINT_TO_FP(SDNode *N) {
1059 return SDValue(DAG.UpdateNodeOperands(N,
1060 ZExtPromotedInteger(N->getOperand(0))), 0);
1063 SDValue DAGTypeLegalizer::PromoteIntOp_ZERO_EXTEND(SDNode *N) {
1065 SDValue Op = GetPromotedInteger(N->getOperand(0));
1066 Op = DAG.getNode(ISD::ANY_EXTEND, dl, N->getValueType(0), Op);
1067 return DAG.getZeroExtendInReg(Op, dl,
1068 N->getOperand(0).getValueType().getScalarType());
1072 //===----------------------------------------------------------------------===//
1073 // Integer Result Expansion
1074 //===----------------------------------------------------------------------===//
1076 /// ExpandIntegerResult - This method is called when the specified result of the
1077 /// specified node is found to need expansion. At this point, the node may also
1078 /// have invalid operands or may have other results that need promotion, we just
1079 /// know that (at least) one result needs expansion.
1080 void DAGTypeLegalizer::ExpandIntegerResult(SDNode *N, unsigned ResNo) {
1081 DEBUG(dbgs() << "Expand integer result: "; N->dump(&DAG); dbgs() << "\n");
1083 Lo = Hi = SDValue();
1085 // See if the target wants to custom expand this node.
1086 if (CustomLowerNode(N, N->getValueType(ResNo), true))
1089 switch (N->getOpcode()) {
1092 dbgs() << "ExpandIntegerResult #" << ResNo << ": ";
1093 N->dump(&DAG); dbgs() << "\n";
1095 llvm_unreachable("Do not know how to expand the result of this operator!");
1097 case ISD::MERGE_VALUES: SplitRes_MERGE_VALUES(N, ResNo, Lo, Hi); break;
1098 case ISD::SELECT: SplitRes_SELECT(N, Lo, Hi); break;
1099 case ISD::SELECT_CC: SplitRes_SELECT_CC(N, Lo, Hi); break;
1100 case ISD::UNDEF: SplitRes_UNDEF(N, Lo, Hi); break;
1102 case ISD::BITCAST: ExpandRes_BITCAST(N, Lo, Hi); break;
1103 case ISD::BUILD_PAIR: ExpandRes_BUILD_PAIR(N, Lo, Hi); break;
1104 case ISD::EXTRACT_ELEMENT: ExpandRes_EXTRACT_ELEMENT(N, Lo, Hi); break;
1105 case ISD::EXTRACT_VECTOR_ELT: ExpandRes_EXTRACT_VECTOR_ELT(N, Lo, Hi); break;
1106 case ISD::VAARG: ExpandRes_VAARG(N, Lo, Hi); break;
1108 case ISD::ANY_EXTEND: ExpandIntRes_ANY_EXTEND(N, Lo, Hi); break;
1109 case ISD::AssertSext: ExpandIntRes_AssertSext(N, Lo, Hi); break;
1110 case ISD::AssertZext: ExpandIntRes_AssertZext(N, Lo, Hi); break;
1111 case ISD::BSWAP: ExpandIntRes_BSWAP(N, Lo, Hi); break;
1112 case ISD::Constant: ExpandIntRes_Constant(N, Lo, Hi); break;
1113 case ISD::CTLZ_ZERO_UNDEF:
1114 case ISD::CTLZ: ExpandIntRes_CTLZ(N, Lo, Hi); break;
1115 case ISD::CTPOP: ExpandIntRes_CTPOP(N, Lo, Hi); break;
1116 case ISD::CTTZ_ZERO_UNDEF:
1117 case ISD::CTTZ: ExpandIntRes_CTTZ(N, Lo, Hi); break;
1118 case ISD::FP_TO_SINT: ExpandIntRes_FP_TO_SINT(N, Lo, Hi); break;
1119 case ISD::FP_TO_UINT: ExpandIntRes_FP_TO_UINT(N, Lo, Hi); break;
1120 case ISD::LOAD: ExpandIntRes_LOAD(cast<LoadSDNode>(N), Lo, Hi); break;
1121 case ISD::MUL: ExpandIntRes_MUL(N, Lo, Hi); break;
1122 case ISD::SDIV: ExpandIntRes_SDIV(N, Lo, Hi); break;
1123 case ISD::SIGN_EXTEND: ExpandIntRes_SIGN_EXTEND(N, Lo, Hi); break;
1124 case ISD::SIGN_EXTEND_INREG: ExpandIntRes_SIGN_EXTEND_INREG(N, Lo, Hi); break;
1125 case ISD::SREM: ExpandIntRes_SREM(N, Lo, Hi); break;
1126 case ISD::TRUNCATE: ExpandIntRes_TRUNCATE(N, Lo, Hi); break;
1127 case ISD::UDIV: ExpandIntRes_UDIV(N, Lo, Hi); break;
1128 case ISD::UREM: ExpandIntRes_UREM(N, Lo, Hi); break;
1129 case ISD::ZERO_EXTEND: ExpandIntRes_ZERO_EXTEND(N, Lo, Hi); break;
1130 case ISD::ATOMIC_LOAD: ExpandIntRes_ATOMIC_LOAD(N, Lo, Hi); break;
1132 case ISD::ATOMIC_LOAD_ADD:
1133 case ISD::ATOMIC_LOAD_SUB:
1134 case ISD::ATOMIC_LOAD_AND:
1135 case ISD::ATOMIC_LOAD_OR:
1136 case ISD::ATOMIC_LOAD_XOR:
1137 case ISD::ATOMIC_LOAD_NAND:
1138 case ISD::ATOMIC_LOAD_MIN:
1139 case ISD::ATOMIC_LOAD_MAX:
1140 case ISD::ATOMIC_LOAD_UMIN:
1141 case ISD::ATOMIC_LOAD_UMAX:
1142 case ISD::ATOMIC_SWAP:
1143 case ISD::ATOMIC_CMP_SWAP: {
1144 std::pair<SDValue, SDValue> Tmp = ExpandAtomic(N);
1145 SplitInteger(Tmp.first, Lo, Hi);
1146 ReplaceValueWith(SDValue(N, 1), Tmp.second);
1152 case ISD::XOR: ExpandIntRes_Logical(N, Lo, Hi); break;
1155 case ISD::SUB: ExpandIntRes_ADDSUB(N, Lo, Hi); break;
1158 case ISD::SUBC: ExpandIntRes_ADDSUBC(N, Lo, Hi); break;
1161 case ISD::SUBE: ExpandIntRes_ADDSUBE(N, Lo, Hi); break;
1165 case ISD::SRL: ExpandIntRes_Shift(N, Lo, Hi); break;
1168 case ISD::SSUBO: ExpandIntRes_SADDSUBO(N, Lo, Hi); break;
1170 case ISD::USUBO: ExpandIntRes_UADDSUBO(N, Lo, Hi); break;
1172 case ISD::SMULO: ExpandIntRes_XMULO(N, Lo, Hi); break;
1175 // If Lo/Hi is null, the sub-method took care of registering results etc.
1177 SetExpandedInteger(SDValue(N, ResNo), Lo, Hi);
1180 /// Lower an atomic node to the appropriate builtin call.
1181 std::pair <SDValue, SDValue> DAGTypeLegalizer::ExpandAtomic(SDNode *Node) {
1182 unsigned Opc = Node->getOpcode();
1183 MVT VT = cast<AtomicSDNode>(Node)->getMemoryVT().getSimpleVT();
1188 llvm_unreachable("Unhandled atomic intrinsic Expand!");
1189 case ISD::ATOMIC_SWAP:
1190 switch (VT.SimpleTy) {
1191 default: llvm_unreachable("Unexpected value type for atomic!");
1192 case MVT::i8: LC = RTLIB::SYNC_LOCK_TEST_AND_SET_1; break;
1193 case MVT::i16: LC = RTLIB::SYNC_LOCK_TEST_AND_SET_2; break;
1194 case MVT::i32: LC = RTLIB::SYNC_LOCK_TEST_AND_SET_4; break;
1195 case MVT::i64: LC = RTLIB::SYNC_LOCK_TEST_AND_SET_8; break;
1198 case ISD::ATOMIC_CMP_SWAP:
1199 switch (VT.SimpleTy) {
1200 default: llvm_unreachable("Unexpected value type for atomic!");
1201 case MVT::i8: LC = RTLIB::SYNC_VAL_COMPARE_AND_SWAP_1; break;
1202 case MVT::i16: LC = RTLIB::SYNC_VAL_COMPARE_AND_SWAP_2; break;
1203 case MVT::i32: LC = RTLIB::SYNC_VAL_COMPARE_AND_SWAP_4; break;
1204 case MVT::i64: LC = RTLIB::SYNC_VAL_COMPARE_AND_SWAP_8; break;
1207 case ISD::ATOMIC_LOAD_ADD:
1208 switch (VT.SimpleTy) {
1209 default: llvm_unreachable("Unexpected value type for atomic!");
1210 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_ADD_1; break;
1211 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_ADD_2; break;
1212 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_ADD_4; break;
1213 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_ADD_8; break;
1216 case ISD::ATOMIC_LOAD_SUB:
1217 switch (VT.SimpleTy) {
1218 default: llvm_unreachable("Unexpected value type for atomic!");
1219 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_SUB_1; break;
1220 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_SUB_2; break;
1221 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_SUB_4; break;
1222 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_SUB_8; break;
1225 case ISD::ATOMIC_LOAD_AND:
1226 switch (VT.SimpleTy) {
1227 default: llvm_unreachable("Unexpected value type for atomic!");
1228 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_AND_1; break;
1229 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_AND_2; break;
1230 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_AND_4; break;
1231 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_AND_8; break;
1234 case ISD::ATOMIC_LOAD_OR:
1235 switch (VT.SimpleTy) {
1236 default: llvm_unreachable("Unexpected value type for atomic!");
1237 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_OR_1; break;
1238 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_OR_2; break;
1239 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_OR_4; break;
1240 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_OR_8; break;
1243 case ISD::ATOMIC_LOAD_XOR:
1244 switch (VT.SimpleTy) {
1245 default: llvm_unreachable("Unexpected value type for atomic!");
1246 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_XOR_1; break;
1247 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_XOR_2; break;
1248 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_XOR_4; break;
1249 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_XOR_8; break;
1252 case ISD::ATOMIC_LOAD_NAND:
1253 switch (VT.SimpleTy) {
1254 default: llvm_unreachable("Unexpected value type for atomic!");
1255 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_NAND_1; break;
1256 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_NAND_2; break;
1257 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_NAND_4; break;
1258 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_NAND_8; break;
1263 return ExpandChainLibCall(LC, Node, false);
1266 /// ExpandShiftByConstant - N is a shift by a value that needs to be expanded,
1267 /// and the shift amount is a constant 'Amt'. Expand the operation.
1268 void DAGTypeLegalizer::ExpandShiftByConstant(SDNode *N, unsigned Amt,
1269 SDValue &Lo, SDValue &Hi) {
1271 // Expand the incoming operand to be shifted, so that we have its parts
1273 GetExpandedInteger(N->getOperand(0), InL, InH);
1275 EVT NVT = InL.getValueType();
1276 unsigned VTBits = N->getValueType(0).getSizeInBits();
1277 unsigned NVTBits = NVT.getSizeInBits();
1278 EVT ShTy = N->getOperand(1).getValueType();
1280 if (N->getOpcode() == ISD::SHL) {
1282 Lo = Hi = DAG.getConstant(0, NVT);
1283 } else if (Amt > NVTBits) {
1284 Lo = DAG.getConstant(0, NVT);
1285 Hi = DAG.getNode(ISD::SHL, DL,
1286 NVT, InL, DAG.getConstant(Amt-NVTBits, ShTy));
1287 } else if (Amt == NVTBits) {
1288 Lo = DAG.getConstant(0, NVT);
1290 } else if (Amt == 1 &&
1291 TLI.isOperationLegalOrCustom(ISD::ADDC,
1292 TLI.getTypeToExpandTo(*DAG.getContext(), NVT))) {
1293 // Emit this X << 1 as X+X.
1294 SDVTList VTList = DAG.getVTList(NVT, MVT::Glue);
1295 SDValue LoOps[2] = { InL, InL };
1296 Lo = DAG.getNode(ISD::ADDC, DL, VTList, LoOps, 2);
1297 SDValue HiOps[3] = { InH, InH, Lo.getValue(1) };
1298 Hi = DAG.getNode(ISD::ADDE, DL, VTList, HiOps, 3);
1300 Lo = DAG.getNode(ISD::SHL, DL, NVT, InL, DAG.getConstant(Amt, ShTy));
1301 Hi = DAG.getNode(ISD::OR, DL, NVT,
1302 DAG.getNode(ISD::SHL, DL, NVT, InH,
1303 DAG.getConstant(Amt, ShTy)),
1304 DAG.getNode(ISD::SRL, DL, NVT, InL,
1305 DAG.getConstant(NVTBits-Amt, ShTy)));
1310 if (N->getOpcode() == ISD::SRL) {
1312 Lo = DAG.getConstant(0, NVT);
1313 Hi = DAG.getConstant(0, NVT);
1314 } else if (Amt > NVTBits) {
1315 Lo = DAG.getNode(ISD::SRL, DL,
1316 NVT, InH, DAG.getConstant(Amt-NVTBits,ShTy));
1317 Hi = DAG.getConstant(0, NVT);
1318 } else if (Amt == NVTBits) {
1320 Hi = DAG.getConstant(0, NVT);
1322 Lo = DAG.getNode(ISD::OR, DL, NVT,
1323 DAG.getNode(ISD::SRL, DL, NVT, InL,
1324 DAG.getConstant(Amt, ShTy)),
1325 DAG.getNode(ISD::SHL, DL, NVT, InH,
1326 DAG.getConstant(NVTBits-Amt, ShTy)));
1327 Hi = DAG.getNode(ISD::SRL, DL, NVT, InH, DAG.getConstant(Amt, ShTy));
1332 assert(N->getOpcode() == ISD::SRA && "Unknown shift!");
1334 Hi = Lo = DAG.getNode(ISD::SRA, DL, NVT, InH,
1335 DAG.getConstant(NVTBits-1, ShTy));
1336 } else if (Amt > NVTBits) {
1337 Lo = DAG.getNode(ISD::SRA, DL, NVT, InH,
1338 DAG.getConstant(Amt-NVTBits, ShTy));
1339 Hi = DAG.getNode(ISD::SRA, DL, NVT, InH,
1340 DAG.getConstant(NVTBits-1, ShTy));
1341 } else if (Amt == NVTBits) {
1343 Hi = DAG.getNode(ISD::SRA, DL, NVT, InH,
1344 DAG.getConstant(NVTBits-1, ShTy));
1346 Lo = DAG.getNode(ISD::OR, DL, NVT,
1347 DAG.getNode(ISD::SRL, DL, NVT, InL,
1348 DAG.getConstant(Amt, ShTy)),
1349 DAG.getNode(ISD::SHL, DL, NVT, InH,
1350 DAG.getConstant(NVTBits-Amt, ShTy)));
1351 Hi = DAG.getNode(ISD::SRA, DL, NVT, InH, DAG.getConstant(Amt, ShTy));
1355 /// ExpandShiftWithKnownAmountBit - Try to determine whether we can simplify
1356 /// this shift based on knowledge of the high bit of the shift amount. If we
1357 /// can tell this, we know that it is >= 32 or < 32, without knowing the actual
1359 bool DAGTypeLegalizer::
1360 ExpandShiftWithKnownAmountBit(SDNode *N, SDValue &Lo, SDValue &Hi) {
1361 SDValue Amt = N->getOperand(1);
1362 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
1363 EVT ShTy = Amt.getValueType();
1364 unsigned ShBits = ShTy.getScalarType().getSizeInBits();
1365 unsigned NVTBits = NVT.getScalarType().getSizeInBits();
1366 assert(isPowerOf2_32(NVTBits) &&
1367 "Expanded integer type size not a power of two!");
1370 APInt HighBitMask = APInt::getHighBitsSet(ShBits, ShBits - Log2_32(NVTBits));
1371 APInt KnownZero, KnownOne;
1372 DAG.ComputeMaskedBits(N->getOperand(1), KnownZero, KnownOne);
1374 // If we don't know anything about the high bits, exit.
1375 if (((KnownZero|KnownOne) & HighBitMask) == 0)
1378 // Get the incoming operand to be shifted.
1380 GetExpandedInteger(N->getOperand(0), InL, InH);
1382 // If we know that any of the high bits of the shift amount are one, then we
1383 // can do this as a couple of simple shifts.
1384 if (KnownOne.intersects(HighBitMask)) {
1385 // Mask out the high bit, which we know is set.
1386 Amt = DAG.getNode(ISD::AND, dl, ShTy, Amt,
1387 DAG.getConstant(~HighBitMask, ShTy));
1389 switch (N->getOpcode()) {
1390 default: llvm_unreachable("Unknown shift");
1392 Lo = DAG.getConstant(0, NVT); // Low part is zero.
1393 Hi = DAG.getNode(ISD::SHL, dl, NVT, InL, Amt); // High part from Lo part.
1396 Hi = DAG.getConstant(0, NVT); // Hi part is zero.
1397 Lo = DAG.getNode(ISD::SRL, dl, NVT, InH, Amt); // Lo part from Hi part.
1400 Hi = DAG.getNode(ISD::SRA, dl, NVT, InH, // Sign extend high part.
1401 DAG.getConstant(NVTBits-1, ShTy));
1402 Lo = DAG.getNode(ISD::SRA, dl, NVT, InH, Amt); // Lo part from Hi part.
1407 // If we know that all of the high bits of the shift amount are zero, then we
1408 // can do this as a couple of simple shifts.
1409 if ((KnownZero & HighBitMask) == HighBitMask) {
1410 // Calculate 31-x. 31 is used instead of 32 to avoid creating an undefined
1411 // shift if x is zero. We can use XOR here because x is known to be smaller
1413 SDValue Amt2 = DAG.getNode(ISD::XOR, dl, ShTy, Amt,
1414 DAG.getConstant(NVTBits-1, ShTy));
1417 switch (N->getOpcode()) {
1418 default: llvm_unreachable("Unknown shift");
1419 case ISD::SHL: Op1 = ISD::SHL; Op2 = ISD::SRL; break;
1421 case ISD::SRA: Op1 = ISD::SRL; Op2 = ISD::SHL; break;
1424 // When shifting right the arithmetic for Lo and Hi is swapped.
1425 if (N->getOpcode() != ISD::SHL)
1426 std::swap(InL, InH);
1428 // Use a little trick to get the bits that move from Lo to Hi. First
1429 // shift by one bit.
1430 SDValue Sh1 = DAG.getNode(Op2, dl, NVT, InL, DAG.getConstant(1, ShTy));
1431 // Then compute the remaining shift with amount-1.
1432 SDValue Sh2 = DAG.getNode(Op2, dl, NVT, Sh1, Amt2);
1434 Lo = DAG.getNode(N->getOpcode(), dl, NVT, InL, Amt);
1435 Hi = DAG.getNode(ISD::OR, dl, NVT, DAG.getNode(Op1, dl, NVT, InH, Amt),Sh2);
1437 if (N->getOpcode() != ISD::SHL)
1445 /// ExpandShiftWithUnknownAmountBit - Fully general expansion of integer shift
1447 bool DAGTypeLegalizer::
1448 ExpandShiftWithUnknownAmountBit(SDNode *N, SDValue &Lo, SDValue &Hi) {
1449 SDValue Amt = N->getOperand(1);
1450 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
1451 EVT ShTy = Amt.getValueType();
1452 unsigned NVTBits = NVT.getSizeInBits();
1453 assert(isPowerOf2_32(NVTBits) &&
1454 "Expanded integer type size not a power of two!");
1457 // Get the incoming operand to be shifted.
1459 GetExpandedInteger(N->getOperand(0), InL, InH);
1461 SDValue NVBitsNode = DAG.getConstant(NVTBits, ShTy);
1462 SDValue AmtExcess = DAG.getNode(ISD::SUB, dl, ShTy, Amt, NVBitsNode);
1463 SDValue AmtLack = DAG.getNode(ISD::SUB, dl, ShTy, NVBitsNode, Amt);
1464 SDValue isShort = DAG.getSetCC(dl, getSetCCResultType(ShTy),
1465 Amt, NVBitsNode, ISD::SETULT);
1467 SDValue LoS, HiS, LoL, HiL;
1468 switch (N->getOpcode()) {
1469 default: llvm_unreachable("Unknown shift");
1471 // Short: ShAmt < NVTBits
1472 LoS = DAG.getNode(ISD::SHL, dl, NVT, InL, Amt);
1473 HiS = DAG.getNode(ISD::OR, dl, NVT,
1474 DAG.getNode(ISD::SHL, dl, NVT, InH, Amt),
1475 // FIXME: If Amt is zero, the following shift generates an undefined result
1476 // on some architectures.
1477 DAG.getNode(ISD::SRL, dl, NVT, InL, AmtLack));
1479 // Long: ShAmt >= NVTBits
1480 LoL = DAG.getConstant(0, NVT); // Lo part is zero.
1481 HiL = DAG.getNode(ISD::SHL, dl, NVT, InL, AmtExcess); // Hi from Lo part.
1483 Lo = DAG.getSelect(dl, NVT, isShort, LoS, LoL);
1484 Hi = DAG.getSelect(dl, NVT, isShort, HiS, HiL);
1487 // Short: ShAmt < NVTBits
1488 HiS = DAG.getNode(ISD::SRL, dl, NVT, InH, Amt);
1489 LoS = DAG.getNode(ISD::OR, dl, NVT,
1490 DAG.getNode(ISD::SRL, dl, NVT, InL, Amt),
1491 // FIXME: If Amt is zero, the following shift generates an undefined result
1492 // on some architectures.
1493 DAG.getNode(ISD::SHL, dl, NVT, InH, AmtLack));
1495 // Long: ShAmt >= NVTBits
1496 HiL = DAG.getConstant(0, NVT); // Hi part is zero.
1497 LoL = DAG.getNode(ISD::SRL, dl, NVT, InH, AmtExcess); // Lo from Hi part.
1499 Lo = DAG.getSelect(dl, NVT, isShort, LoS, LoL);
1500 Hi = DAG.getSelect(dl, NVT, isShort, HiS, HiL);
1503 // Short: ShAmt < NVTBits
1504 HiS = DAG.getNode(ISD::SRA, dl, NVT, InH, Amt);
1505 LoS = DAG.getNode(ISD::OR, dl, NVT,
1506 DAG.getNode(ISD::SRL, dl, NVT, InL, Amt),
1507 // FIXME: If Amt is zero, the following shift generates an undefined result
1508 // on some architectures.
1509 DAG.getNode(ISD::SHL, dl, NVT, InH, AmtLack));
1511 // Long: ShAmt >= NVTBits
1512 HiL = DAG.getNode(ISD::SRA, dl, NVT, InH, // Sign of Hi part.
1513 DAG.getConstant(NVTBits-1, ShTy));
1514 LoL = DAG.getNode(ISD::SRA, dl, NVT, InH, AmtExcess); // Lo from Hi part.
1516 Lo = DAG.getSelect(dl, NVT, isShort, LoS, LoL);
1517 Hi = DAG.getSelect(dl, NVT, isShort, HiS, HiL);
1522 void DAGTypeLegalizer::ExpandIntRes_ADDSUB(SDNode *N,
1523 SDValue &Lo, SDValue &Hi) {
1525 // Expand the subcomponents.
1526 SDValue LHSL, LHSH, RHSL, RHSH;
1527 GetExpandedInteger(N->getOperand(0), LHSL, LHSH);
1528 GetExpandedInteger(N->getOperand(1), RHSL, RHSH);
1530 EVT NVT = LHSL.getValueType();
1531 SDValue LoOps[2] = { LHSL, RHSL };
1532 SDValue HiOps[3] = { LHSH, RHSH };
1534 // Do not generate ADDC/ADDE or SUBC/SUBE if the target does not support
1535 // them. TODO: Teach operation legalization how to expand unsupported
1536 // ADDC/ADDE/SUBC/SUBE. The problem is that these operations generate
1537 // a carry of type MVT::Glue, but there doesn't seem to be any way to
1538 // generate a value of this type in the expanded code sequence.
1540 TLI.isOperationLegalOrCustom(N->getOpcode() == ISD::ADD ?
1541 ISD::ADDC : ISD::SUBC,
1542 TLI.getTypeToExpandTo(*DAG.getContext(), NVT));
1545 SDVTList VTList = DAG.getVTList(NVT, MVT::Glue);
1546 if (N->getOpcode() == ISD::ADD) {
1547 Lo = DAG.getNode(ISD::ADDC, dl, VTList, LoOps, 2);
1548 HiOps[2] = Lo.getValue(1);
1549 Hi = DAG.getNode(ISD::ADDE, dl, VTList, HiOps, 3);
1551 Lo = DAG.getNode(ISD::SUBC, dl, VTList, LoOps, 2);
1552 HiOps[2] = Lo.getValue(1);
1553 Hi = DAG.getNode(ISD::SUBE, dl, VTList, HiOps, 3);
1558 if (N->getOpcode() == ISD::ADD) {
1559 Lo = DAG.getNode(ISD::ADD, dl, NVT, LoOps, 2);
1560 Hi = DAG.getNode(ISD::ADD, dl, NVT, HiOps, 2);
1561 SDValue Cmp1 = DAG.getSetCC(dl, getSetCCResultType(NVT), Lo, LoOps[0],
1563 SDValue Carry1 = DAG.getSelect(dl, NVT, Cmp1,
1564 DAG.getConstant(1, NVT),
1565 DAG.getConstant(0, NVT));
1566 SDValue Cmp2 = DAG.getSetCC(dl, getSetCCResultType(NVT), Lo, LoOps[1],
1568 SDValue Carry2 = DAG.getSelect(dl, NVT, Cmp2,
1569 DAG.getConstant(1, NVT), Carry1);
1570 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, Carry2);
1572 Lo = DAG.getNode(ISD::SUB, dl, NVT, LoOps, 2);
1573 Hi = DAG.getNode(ISD::SUB, dl, NVT, HiOps, 2);
1575 DAG.getSetCC(dl, getSetCCResultType(LoOps[0].getValueType()),
1576 LoOps[0], LoOps[1], ISD::SETULT);
1577 SDValue Borrow = DAG.getSelect(dl, NVT, Cmp,
1578 DAG.getConstant(1, NVT),
1579 DAG.getConstant(0, NVT));
1580 Hi = DAG.getNode(ISD::SUB, dl, NVT, Hi, Borrow);
1584 void DAGTypeLegalizer::ExpandIntRes_ADDSUBC(SDNode *N,
1585 SDValue &Lo, SDValue &Hi) {
1586 // Expand the subcomponents.
1587 SDValue LHSL, LHSH, RHSL, RHSH;
1589 GetExpandedInteger(N->getOperand(0), LHSL, LHSH);
1590 GetExpandedInteger(N->getOperand(1), RHSL, RHSH);
1591 SDVTList VTList = DAG.getVTList(LHSL.getValueType(), MVT::Glue);
1592 SDValue LoOps[2] = { LHSL, RHSL };
1593 SDValue HiOps[3] = { LHSH, RHSH };
1595 if (N->getOpcode() == ISD::ADDC) {
1596 Lo = DAG.getNode(ISD::ADDC, dl, VTList, LoOps, 2);
1597 HiOps[2] = Lo.getValue(1);
1598 Hi = DAG.getNode(ISD::ADDE, dl, VTList, HiOps, 3);
1600 Lo = DAG.getNode(ISD::SUBC, dl, VTList, LoOps, 2);
1601 HiOps[2] = Lo.getValue(1);
1602 Hi = DAG.getNode(ISD::SUBE, dl, VTList, HiOps, 3);
1605 // Legalized the flag result - switch anything that used the old flag to
1607 ReplaceValueWith(SDValue(N, 1), Hi.getValue(1));
1610 void DAGTypeLegalizer::ExpandIntRes_ADDSUBE(SDNode *N,
1611 SDValue &Lo, SDValue &Hi) {
1612 // Expand the subcomponents.
1613 SDValue LHSL, LHSH, RHSL, RHSH;
1615 GetExpandedInteger(N->getOperand(0), LHSL, LHSH);
1616 GetExpandedInteger(N->getOperand(1), RHSL, RHSH);
1617 SDVTList VTList = DAG.getVTList(LHSL.getValueType(), MVT::Glue);
1618 SDValue LoOps[3] = { LHSL, RHSL, N->getOperand(2) };
1619 SDValue HiOps[3] = { LHSH, RHSH };
1621 Lo = DAG.getNode(N->getOpcode(), dl, VTList, LoOps, 3);
1622 HiOps[2] = Lo.getValue(1);
1623 Hi = DAG.getNode(N->getOpcode(), dl, VTList, HiOps, 3);
1625 // Legalized the flag result - switch anything that used the old flag to
1627 ReplaceValueWith(SDValue(N, 1), Hi.getValue(1));
1630 void DAGTypeLegalizer::ExpandIntRes_MERGE_VALUES(SDNode *N, unsigned ResNo,
1631 SDValue &Lo, SDValue &Hi) {
1632 SDValue Res = DisintegrateMERGE_VALUES(N, ResNo);
1633 SplitInteger(Res, Lo, Hi);
1636 void DAGTypeLegalizer::ExpandIntRes_ANY_EXTEND(SDNode *N,
1637 SDValue &Lo, SDValue &Hi) {
1638 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
1640 SDValue Op = N->getOperand(0);
1641 if (Op.getValueType().bitsLE(NVT)) {
1642 // The low part is any extension of the input (which degenerates to a copy).
1643 Lo = DAG.getNode(ISD::ANY_EXTEND, dl, NVT, Op);
1644 Hi = DAG.getUNDEF(NVT); // The high part is undefined.
1646 // For example, extension of an i48 to an i64. The operand type necessarily
1647 // promotes to the result type, so will end up being expanded too.
1648 assert(getTypeAction(Op.getValueType()) ==
1649 TargetLowering::TypePromoteInteger &&
1650 "Only know how to promote this result!");
1651 SDValue Res = GetPromotedInteger(Op);
1652 assert(Res.getValueType() == N->getValueType(0) &&
1653 "Operand over promoted?");
1654 // Split the promoted operand. This will simplify when it is expanded.
1655 SplitInteger(Res, Lo, Hi);
1659 void DAGTypeLegalizer::ExpandIntRes_AssertSext(SDNode *N,
1660 SDValue &Lo, SDValue &Hi) {
1662 GetExpandedInteger(N->getOperand(0), Lo, Hi);
1663 EVT NVT = Lo.getValueType();
1664 EVT EVT = cast<VTSDNode>(N->getOperand(1))->getVT();
1665 unsigned NVTBits = NVT.getSizeInBits();
1666 unsigned EVTBits = EVT.getSizeInBits();
1668 if (NVTBits < EVTBits) {
1669 Hi = DAG.getNode(ISD::AssertSext, dl, NVT, Hi,
1670 DAG.getValueType(EVT::getIntegerVT(*DAG.getContext(),
1671 EVTBits - NVTBits)));
1673 Lo = DAG.getNode(ISD::AssertSext, dl, NVT, Lo, DAG.getValueType(EVT));
1674 // The high part replicates the sign bit of Lo, make it explicit.
1675 Hi = DAG.getNode(ISD::SRA, dl, NVT, Lo,
1676 DAG.getConstant(NVTBits-1, TLI.getPointerTy()));
1680 void DAGTypeLegalizer::ExpandIntRes_AssertZext(SDNode *N,
1681 SDValue &Lo, SDValue &Hi) {
1683 GetExpandedInteger(N->getOperand(0), Lo, Hi);
1684 EVT NVT = Lo.getValueType();
1685 EVT EVT = cast<VTSDNode>(N->getOperand(1))->getVT();
1686 unsigned NVTBits = NVT.getSizeInBits();
1687 unsigned EVTBits = EVT.getSizeInBits();
1689 if (NVTBits < EVTBits) {
1690 Hi = DAG.getNode(ISD::AssertZext, dl, NVT, Hi,
1691 DAG.getValueType(EVT::getIntegerVT(*DAG.getContext(),
1692 EVTBits - NVTBits)));
1694 Lo = DAG.getNode(ISD::AssertZext, dl, NVT, Lo, DAG.getValueType(EVT));
1695 // The high part must be zero, make it explicit.
1696 Hi = DAG.getConstant(0, NVT);
1700 void DAGTypeLegalizer::ExpandIntRes_BSWAP(SDNode *N,
1701 SDValue &Lo, SDValue &Hi) {
1703 GetExpandedInteger(N->getOperand(0), Hi, Lo); // Note swapped operands.
1704 Lo = DAG.getNode(ISD::BSWAP, dl, Lo.getValueType(), Lo);
1705 Hi = DAG.getNode(ISD::BSWAP, dl, Hi.getValueType(), Hi);
1708 void DAGTypeLegalizer::ExpandIntRes_Constant(SDNode *N,
1709 SDValue &Lo, SDValue &Hi) {
1710 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
1711 unsigned NBitWidth = NVT.getSizeInBits();
1712 const APInt &Cst = cast<ConstantSDNode>(N)->getAPIntValue();
1713 Lo = DAG.getConstant(Cst.trunc(NBitWidth), NVT);
1714 Hi = DAG.getConstant(Cst.lshr(NBitWidth).trunc(NBitWidth), NVT);
1717 void DAGTypeLegalizer::ExpandIntRes_CTLZ(SDNode *N,
1718 SDValue &Lo, SDValue &Hi) {
1720 // ctlz (HiLo) -> Hi != 0 ? ctlz(Hi) : (ctlz(Lo)+32)
1721 GetExpandedInteger(N->getOperand(0), Lo, Hi);
1722 EVT NVT = Lo.getValueType();
1724 SDValue HiNotZero = DAG.getSetCC(dl, getSetCCResultType(NVT), Hi,
1725 DAG.getConstant(0, NVT), ISD::SETNE);
1727 SDValue LoLZ = DAG.getNode(N->getOpcode(), dl, NVT, Lo);
1728 SDValue HiLZ = DAG.getNode(ISD::CTLZ_ZERO_UNDEF, dl, NVT, Hi);
1730 Lo = DAG.getSelect(dl, NVT, HiNotZero, HiLZ,
1731 DAG.getNode(ISD::ADD, dl, NVT, LoLZ,
1732 DAG.getConstant(NVT.getSizeInBits(), NVT)));
1733 Hi = DAG.getConstant(0, NVT);
1736 void DAGTypeLegalizer::ExpandIntRes_CTPOP(SDNode *N,
1737 SDValue &Lo, SDValue &Hi) {
1739 // ctpop(HiLo) -> ctpop(Hi)+ctpop(Lo)
1740 GetExpandedInteger(N->getOperand(0), Lo, Hi);
1741 EVT NVT = Lo.getValueType();
1742 Lo = DAG.getNode(ISD::ADD, dl, NVT, DAG.getNode(ISD::CTPOP, dl, NVT, Lo),
1743 DAG.getNode(ISD::CTPOP, dl, NVT, Hi));
1744 Hi = DAG.getConstant(0, NVT);
1747 void DAGTypeLegalizer::ExpandIntRes_CTTZ(SDNode *N,
1748 SDValue &Lo, SDValue &Hi) {
1750 // cttz (HiLo) -> Lo != 0 ? cttz(Lo) : (cttz(Hi)+32)
1751 GetExpandedInteger(N->getOperand(0), Lo, Hi);
1752 EVT NVT = Lo.getValueType();
1754 SDValue LoNotZero = DAG.getSetCC(dl, getSetCCResultType(NVT), Lo,
1755 DAG.getConstant(0, NVT), ISD::SETNE);
1757 SDValue LoLZ = DAG.getNode(ISD::CTTZ_ZERO_UNDEF, dl, NVT, Lo);
1758 SDValue HiLZ = DAG.getNode(N->getOpcode(), dl, NVT, Hi);
1760 Lo = DAG.getSelect(dl, NVT, LoNotZero, LoLZ,
1761 DAG.getNode(ISD::ADD, dl, NVT, HiLZ,
1762 DAG.getConstant(NVT.getSizeInBits(), NVT)));
1763 Hi = DAG.getConstant(0, NVT);
1766 void DAGTypeLegalizer::ExpandIntRes_FP_TO_SINT(SDNode *N, SDValue &Lo,
1769 EVT VT = N->getValueType(0);
1770 SDValue Op = N->getOperand(0);
1771 RTLIB::Libcall LC = RTLIB::getFPTOSINT(Op.getValueType(), VT);
1772 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unexpected fp-to-sint conversion!");
1773 SplitInteger(TLI.makeLibCall(DAG, LC, VT, &Op, 1, true/*irrelevant*/,
1778 void DAGTypeLegalizer::ExpandIntRes_FP_TO_UINT(SDNode *N, SDValue &Lo,
1781 EVT VT = N->getValueType(0);
1782 SDValue Op = N->getOperand(0);
1783 RTLIB::Libcall LC = RTLIB::getFPTOUINT(Op.getValueType(), VT);
1784 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unexpected fp-to-uint conversion!");
1785 SplitInteger(TLI.makeLibCall(DAG, LC, VT, &Op, 1, false/*irrelevant*/,
1790 void DAGTypeLegalizer::ExpandIntRes_LOAD(LoadSDNode *N,
1791 SDValue &Lo, SDValue &Hi) {
1792 if (ISD::isNormalLoad(N)) {
1793 ExpandRes_NormalLoad(N, Lo, Hi);
1797 assert(ISD::isUNINDEXEDLoad(N) && "Indexed load during type legalization!");
1799 EVT VT = N->getValueType(0);
1800 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT);
1801 SDValue Ch = N->getChain();
1802 SDValue Ptr = N->getBasePtr();
1803 ISD::LoadExtType ExtType = N->getExtensionType();
1804 unsigned Alignment = N->getAlignment();
1805 bool isVolatile = N->isVolatile();
1806 bool isNonTemporal = N->isNonTemporal();
1807 bool isInvariant = N->isInvariant();
1810 assert(NVT.isByteSized() && "Expanded type not byte sized!");
1812 if (N->getMemoryVT().bitsLE(NVT)) {
1813 EVT MemVT = N->getMemoryVT();
1815 Lo = DAG.getExtLoad(ExtType, dl, NVT, Ch, Ptr, N->getPointerInfo(),
1816 MemVT, isVolatile, isNonTemporal, Alignment);
1818 // Remember the chain.
1819 Ch = Lo.getValue(1);
1821 if (ExtType == ISD::SEXTLOAD) {
1822 // The high part is obtained by SRA'ing all but one of the bits of the
1824 unsigned LoSize = Lo.getValueType().getSizeInBits();
1825 Hi = DAG.getNode(ISD::SRA, dl, NVT, Lo,
1826 DAG.getConstant(LoSize-1, TLI.getPointerTy()));
1827 } else if (ExtType == ISD::ZEXTLOAD) {
1828 // The high part is just a zero.
1829 Hi = DAG.getConstant(0, NVT);
1831 assert(ExtType == ISD::EXTLOAD && "Unknown extload!");
1832 // The high part is undefined.
1833 Hi = DAG.getUNDEF(NVT);
1835 } else if (TLI.isLittleEndian()) {
1836 // Little-endian - low bits are at low addresses.
1837 Lo = DAG.getLoad(NVT, dl, Ch, Ptr, N->getPointerInfo(),
1838 isVolatile, isNonTemporal, isInvariant, Alignment);
1840 unsigned ExcessBits =
1841 N->getMemoryVT().getSizeInBits() - NVT.getSizeInBits();
1842 EVT NEVT = EVT::getIntegerVT(*DAG.getContext(), ExcessBits);
1844 // Increment the pointer to the other half.
1845 unsigned IncrementSize = NVT.getSizeInBits()/8;
1846 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
1847 DAG.getIntPtrConstant(IncrementSize));
1848 Hi = DAG.getExtLoad(ExtType, dl, NVT, Ch, Ptr,
1849 N->getPointerInfo().getWithOffset(IncrementSize), NEVT,
1850 isVolatile, isNonTemporal,
1851 MinAlign(Alignment, IncrementSize));
1853 // Build a factor node to remember that this load is independent of the
1855 Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
1858 // Big-endian - high bits are at low addresses. Favor aligned loads at
1859 // the cost of some bit-fiddling.
1860 EVT MemVT = N->getMemoryVT();
1861 unsigned EBytes = MemVT.getStoreSize();
1862 unsigned IncrementSize = NVT.getSizeInBits()/8;
1863 unsigned ExcessBits = (EBytes - IncrementSize)*8;
1865 // Load both the high bits and maybe some of the low bits.
1866 Hi = DAG.getExtLoad(ExtType, dl, NVT, Ch, Ptr, N->getPointerInfo(),
1867 EVT::getIntegerVT(*DAG.getContext(),
1868 MemVT.getSizeInBits() - ExcessBits),
1869 isVolatile, isNonTemporal, Alignment);
1871 // Increment the pointer to the other half.
1872 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
1873 DAG.getIntPtrConstant(IncrementSize));
1874 // Load the rest of the low bits.
1875 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, dl, NVT, Ch, Ptr,
1876 N->getPointerInfo().getWithOffset(IncrementSize),
1877 EVT::getIntegerVT(*DAG.getContext(), ExcessBits),
1878 isVolatile, isNonTemporal,
1879 MinAlign(Alignment, IncrementSize));
1881 // Build a factor node to remember that this load is independent of the
1883 Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
1886 if (ExcessBits < NVT.getSizeInBits()) {
1887 // Transfer low bits from the bottom of Hi to the top of Lo.
1888 Lo = DAG.getNode(ISD::OR, dl, NVT, Lo,
1889 DAG.getNode(ISD::SHL, dl, NVT, Hi,
1890 DAG.getConstant(ExcessBits,
1891 TLI.getPointerTy())));
1892 // Move high bits to the right position in Hi.
1893 Hi = DAG.getNode(ExtType == ISD::SEXTLOAD ? ISD::SRA : ISD::SRL, dl,
1895 DAG.getConstant(NVT.getSizeInBits() - ExcessBits,
1896 TLI.getPointerTy()));
1900 // Legalized the chain result - switch anything that used the old chain to
1902 ReplaceValueWith(SDValue(N, 1), Ch);
1905 void DAGTypeLegalizer::ExpandIntRes_Logical(SDNode *N,
1906 SDValue &Lo, SDValue &Hi) {
1908 SDValue LL, LH, RL, RH;
1909 GetExpandedInteger(N->getOperand(0), LL, LH);
1910 GetExpandedInteger(N->getOperand(1), RL, RH);
1911 Lo = DAG.getNode(N->getOpcode(), dl, LL.getValueType(), LL, RL);
1912 Hi = DAG.getNode(N->getOpcode(), dl, LL.getValueType(), LH, RH);
1915 void DAGTypeLegalizer::ExpandIntRes_MUL(SDNode *N,
1916 SDValue &Lo, SDValue &Hi) {
1917 EVT VT = N->getValueType(0);
1918 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT);
1921 bool HasMULHS = TLI.isOperationLegalOrCustom(ISD::MULHS, NVT);
1922 bool HasMULHU = TLI.isOperationLegalOrCustom(ISD::MULHU, NVT);
1923 bool HasSMUL_LOHI = TLI.isOperationLegalOrCustom(ISD::SMUL_LOHI, NVT);
1924 bool HasUMUL_LOHI = TLI.isOperationLegalOrCustom(ISD::UMUL_LOHI, NVT);
1925 if (HasMULHU || HasMULHS || HasUMUL_LOHI || HasSMUL_LOHI) {
1926 SDValue LL, LH, RL, RH;
1927 GetExpandedInteger(N->getOperand(0), LL, LH);
1928 GetExpandedInteger(N->getOperand(1), RL, RH);
1929 unsigned OuterBitSize = VT.getSizeInBits();
1930 unsigned InnerBitSize = NVT.getSizeInBits();
1931 unsigned LHSSB = DAG.ComputeNumSignBits(N->getOperand(0));
1932 unsigned RHSSB = DAG.ComputeNumSignBits(N->getOperand(1));
1934 APInt HighMask = APInt::getHighBitsSet(OuterBitSize, InnerBitSize);
1935 if (DAG.MaskedValueIsZero(N->getOperand(0), HighMask) &&
1936 DAG.MaskedValueIsZero(N->getOperand(1), HighMask)) {
1937 // The inputs are both zero-extended.
1939 // We can emit a umul_lohi.
1940 Lo = DAG.getNode(ISD::UMUL_LOHI, dl, DAG.getVTList(NVT, NVT), LL, RL);
1941 Hi = SDValue(Lo.getNode(), 1);
1945 // We can emit a mulhu+mul.
1946 Lo = DAG.getNode(ISD::MUL, dl, NVT, LL, RL);
1947 Hi = DAG.getNode(ISD::MULHU, dl, NVT, LL, RL);
1951 if (LHSSB > InnerBitSize && RHSSB > InnerBitSize) {
1952 // The input values are both sign-extended.
1954 // We can emit a smul_lohi.
1955 Lo = DAG.getNode(ISD::SMUL_LOHI, dl, DAG.getVTList(NVT, NVT), LL, RL);
1956 Hi = SDValue(Lo.getNode(), 1);
1960 // We can emit a mulhs+mul.
1961 Lo = DAG.getNode(ISD::MUL, dl, NVT, LL, RL);
1962 Hi = DAG.getNode(ISD::MULHS, dl, NVT, LL, RL);
1967 // Lo,Hi = umul LHS, RHS.
1968 SDValue UMulLOHI = DAG.getNode(ISD::UMUL_LOHI, dl,
1969 DAG.getVTList(NVT, NVT), LL, RL);
1971 Hi = UMulLOHI.getValue(1);
1972 RH = DAG.getNode(ISD::MUL, dl, NVT, LL, RH);
1973 LH = DAG.getNode(ISD::MUL, dl, NVT, LH, RL);
1974 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, RH);
1975 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, LH);
1979 Lo = DAG.getNode(ISD::MUL, dl, NVT, LL, RL);
1980 Hi = DAG.getNode(ISD::MULHU, dl, NVT, LL, RL);
1981 RH = DAG.getNode(ISD::MUL, dl, NVT, LL, RH);
1982 LH = DAG.getNode(ISD::MUL, dl, NVT, LH, RL);
1983 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, RH);
1984 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, LH);
1989 // If nothing else, we can make a libcall.
1990 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
1992 LC = RTLIB::MUL_I16;
1993 else if (VT == MVT::i32)
1994 LC = RTLIB::MUL_I32;
1995 else if (VT == MVT::i64)
1996 LC = RTLIB::MUL_I64;
1997 else if (VT == MVT::i128)
1998 LC = RTLIB::MUL_I128;
1999 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported MUL!");
2001 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) };
2002 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Ops, 2, true/*irrelevant*/,
2007 void DAGTypeLegalizer::ExpandIntRes_SADDSUBO(SDNode *Node,
2008 SDValue &Lo, SDValue &Hi) {
2009 SDValue LHS = Node->getOperand(0);
2010 SDValue RHS = Node->getOperand(1);
2013 // Expand the result by simply replacing it with the equivalent
2014 // non-overflow-checking operation.
2015 SDValue Sum = DAG.getNode(Node->getOpcode() == ISD::SADDO ?
2016 ISD::ADD : ISD::SUB, dl, LHS.getValueType(),
2018 SplitInteger(Sum, Lo, Hi);
2020 // Compute the overflow.
2022 // LHSSign -> LHS >= 0
2023 // RHSSign -> RHS >= 0
2024 // SumSign -> Sum >= 0
2027 // Overflow -> (LHSSign == RHSSign) && (LHSSign != SumSign)
2029 // Overflow -> (LHSSign != RHSSign) && (LHSSign != SumSign)
2031 EVT OType = Node->getValueType(1);
2032 SDValue Zero = DAG.getConstant(0, LHS.getValueType());
2034 SDValue LHSSign = DAG.getSetCC(dl, OType, LHS, Zero, ISD::SETGE);
2035 SDValue RHSSign = DAG.getSetCC(dl, OType, RHS, Zero, ISD::SETGE);
2036 SDValue SignsMatch = DAG.getSetCC(dl, OType, LHSSign, RHSSign,
2037 Node->getOpcode() == ISD::SADDO ?
2038 ISD::SETEQ : ISD::SETNE);
2040 SDValue SumSign = DAG.getSetCC(dl, OType, Sum, Zero, ISD::SETGE);
2041 SDValue SumSignNE = DAG.getSetCC(dl, OType, LHSSign, SumSign, ISD::SETNE);
2043 SDValue Cmp = DAG.getNode(ISD::AND, dl, OType, SignsMatch, SumSignNE);
2045 // Use the calculated overflow everywhere.
2046 ReplaceValueWith(SDValue(Node, 1), Cmp);
2049 void DAGTypeLegalizer::ExpandIntRes_SDIV(SDNode *N,
2050 SDValue &Lo, SDValue &Hi) {
2051 EVT VT = N->getValueType(0);
2054 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
2056 LC = RTLIB::SDIV_I16;
2057 else if (VT == MVT::i32)
2058 LC = RTLIB::SDIV_I32;
2059 else if (VT == MVT::i64)
2060 LC = RTLIB::SDIV_I64;
2061 else if (VT == MVT::i128)
2062 LC = RTLIB::SDIV_I128;
2063 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported SDIV!");
2065 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) };
2066 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Ops, 2, true, dl).first, Lo, Hi);
2069 void DAGTypeLegalizer::ExpandIntRes_Shift(SDNode *N,
2070 SDValue &Lo, SDValue &Hi) {
2071 EVT VT = N->getValueType(0);
2074 // If we can emit an efficient shift operation, do so now. Check to see if
2075 // the RHS is a constant.
2076 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N->getOperand(1)))
2077 return ExpandShiftByConstant(N, CN->getZExtValue(), Lo, Hi);
2079 // If we can determine that the high bit of the shift is zero or one, even if
2080 // the low bits are variable, emit this shift in an optimized form.
2081 if (ExpandShiftWithKnownAmountBit(N, Lo, Hi))
2084 // If this target supports shift_PARTS, use it. First, map to the _PARTS opc.
2086 if (N->getOpcode() == ISD::SHL) {
2087 PartsOpc = ISD::SHL_PARTS;
2088 } else if (N->getOpcode() == ISD::SRL) {
2089 PartsOpc = ISD::SRL_PARTS;
2091 assert(N->getOpcode() == ISD::SRA && "Unknown shift!");
2092 PartsOpc = ISD::SRA_PARTS;
2095 // Next check to see if the target supports this SHL_PARTS operation or if it
2096 // will custom expand it.
2097 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT);
2098 TargetLowering::LegalizeAction Action = TLI.getOperationAction(PartsOpc, NVT);
2099 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
2100 Action == TargetLowering::Custom) {
2101 // Expand the subcomponents.
2103 GetExpandedInteger(N->getOperand(0), LHSL, LHSH);
2104 EVT VT = LHSL.getValueType();
2106 // If the shift amount operand is coming from a vector legalization it may
2107 // have an illegal type. Fix that first by casting the operand, otherwise
2108 // the new SHL_PARTS operation would need further legalization.
2109 SDValue ShiftOp = N->getOperand(1);
2110 EVT ShiftTy = TLI.getShiftAmountTy(VT);
2111 assert(ShiftTy.getScalarType().getSizeInBits() >=
2112 Log2_32_Ceil(VT.getScalarType().getSizeInBits()) &&
2113 "ShiftAmountTy is too small to cover the range of this type!");
2114 if (ShiftOp.getValueType() != ShiftTy)
2115 ShiftOp = DAG.getZExtOrTrunc(ShiftOp, dl, ShiftTy);
2117 SDValue Ops[] = { LHSL, LHSH, ShiftOp };
2118 Lo = DAG.getNode(PartsOpc, dl, DAG.getVTList(VT, VT), Ops, 3);
2119 Hi = Lo.getValue(1);
2123 // Otherwise, emit a libcall.
2124 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
2126 if (N->getOpcode() == ISD::SHL) {
2127 isSigned = false; /*sign irrelevant*/
2129 LC = RTLIB::SHL_I16;
2130 else if (VT == MVT::i32)
2131 LC = RTLIB::SHL_I32;
2132 else if (VT == MVT::i64)
2133 LC = RTLIB::SHL_I64;
2134 else if (VT == MVT::i128)
2135 LC = RTLIB::SHL_I128;
2136 } else if (N->getOpcode() == ISD::SRL) {
2139 LC = RTLIB::SRL_I16;
2140 else if (VT == MVT::i32)
2141 LC = RTLIB::SRL_I32;
2142 else if (VT == MVT::i64)
2143 LC = RTLIB::SRL_I64;
2144 else if (VT == MVT::i128)
2145 LC = RTLIB::SRL_I128;
2147 assert(N->getOpcode() == ISD::SRA && "Unknown shift!");
2150 LC = RTLIB::SRA_I16;
2151 else if (VT == MVT::i32)
2152 LC = RTLIB::SRA_I32;
2153 else if (VT == MVT::i64)
2154 LC = RTLIB::SRA_I64;
2155 else if (VT == MVT::i128)
2156 LC = RTLIB::SRA_I128;
2159 if (LC != RTLIB::UNKNOWN_LIBCALL && TLI.getLibcallName(LC)) {
2160 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) };
2161 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Ops, 2, isSigned, dl).first, Lo,
2166 if (!ExpandShiftWithUnknownAmountBit(N, Lo, Hi))
2167 llvm_unreachable("Unsupported shift!");
2170 void DAGTypeLegalizer::ExpandIntRes_SIGN_EXTEND(SDNode *N,
2171 SDValue &Lo, SDValue &Hi) {
2172 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
2174 SDValue Op = N->getOperand(0);
2175 if (Op.getValueType().bitsLE(NVT)) {
2176 // The low part is sign extension of the input (degenerates to a copy).
2177 Lo = DAG.getNode(ISD::SIGN_EXTEND, dl, NVT, N->getOperand(0));
2178 // The high part is obtained by SRA'ing all but one of the bits of low part.
2179 unsigned LoSize = NVT.getSizeInBits();
2180 Hi = DAG.getNode(ISD::SRA, dl, NVT, Lo,
2181 DAG.getConstant(LoSize-1, TLI.getPointerTy()));
2183 // For example, extension of an i48 to an i64. The operand type necessarily
2184 // promotes to the result type, so will end up being expanded too.
2185 assert(getTypeAction(Op.getValueType()) ==
2186 TargetLowering::TypePromoteInteger &&
2187 "Only know how to promote this result!");
2188 SDValue Res = GetPromotedInteger(Op);
2189 assert(Res.getValueType() == N->getValueType(0) &&
2190 "Operand over promoted?");
2191 // Split the promoted operand. This will simplify when it is expanded.
2192 SplitInteger(Res, Lo, Hi);
2193 unsigned ExcessBits =
2194 Op.getValueType().getSizeInBits() - NVT.getSizeInBits();
2195 Hi = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Hi.getValueType(), Hi,
2196 DAG.getValueType(EVT::getIntegerVT(*DAG.getContext(),
2201 void DAGTypeLegalizer::
2202 ExpandIntRes_SIGN_EXTEND_INREG(SDNode *N, SDValue &Lo, SDValue &Hi) {
2204 GetExpandedInteger(N->getOperand(0), Lo, Hi);
2205 EVT EVT = cast<VTSDNode>(N->getOperand(1))->getVT();
2207 if (EVT.bitsLE(Lo.getValueType())) {
2208 // sext_inreg the low part if needed.
2209 Lo = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Lo.getValueType(), Lo,
2212 // The high part gets the sign extension from the lo-part. This handles
2213 // things like sextinreg V:i64 from i8.
2214 Hi = DAG.getNode(ISD::SRA, dl, Hi.getValueType(), Lo,
2215 DAG.getConstant(Hi.getValueType().getSizeInBits()-1,
2216 TLI.getPointerTy()));
2218 // For example, extension of an i48 to an i64. Leave the low part alone,
2219 // sext_inreg the high part.
2220 unsigned ExcessBits =
2221 EVT.getSizeInBits() - Lo.getValueType().getSizeInBits();
2222 Hi = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Hi.getValueType(), Hi,
2223 DAG.getValueType(EVT::getIntegerVT(*DAG.getContext(),
2228 void DAGTypeLegalizer::ExpandIntRes_SREM(SDNode *N,
2229 SDValue &Lo, SDValue &Hi) {
2230 EVT VT = N->getValueType(0);
2233 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
2235 LC = RTLIB::SREM_I16;
2236 else if (VT == MVT::i32)
2237 LC = RTLIB::SREM_I32;
2238 else if (VT == MVT::i64)
2239 LC = RTLIB::SREM_I64;
2240 else if (VT == MVT::i128)
2241 LC = RTLIB::SREM_I128;
2242 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported SREM!");
2244 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) };
2245 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Ops, 2, true, dl).first, Lo, Hi);
2248 void DAGTypeLegalizer::ExpandIntRes_TRUNCATE(SDNode *N,
2249 SDValue &Lo, SDValue &Hi) {
2250 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
2252 Lo = DAG.getNode(ISD::TRUNCATE, dl, NVT, N->getOperand(0));
2253 Hi = DAG.getNode(ISD::SRL, dl,
2254 N->getOperand(0).getValueType(), N->getOperand(0),
2255 DAG.getConstant(NVT.getSizeInBits(), TLI.getPointerTy()));
2256 Hi = DAG.getNode(ISD::TRUNCATE, dl, NVT, Hi);
2259 void DAGTypeLegalizer::ExpandIntRes_UADDSUBO(SDNode *N,
2260 SDValue &Lo, SDValue &Hi) {
2261 SDValue LHS = N->getOperand(0);
2262 SDValue RHS = N->getOperand(1);
2265 // Expand the result by simply replacing it with the equivalent
2266 // non-overflow-checking operation.
2267 SDValue Sum = DAG.getNode(N->getOpcode() == ISD::UADDO ?
2268 ISD::ADD : ISD::SUB, dl, LHS.getValueType(),
2270 SplitInteger(Sum, Lo, Hi);
2272 // Calculate the overflow: addition overflows iff a + b < a, and subtraction
2273 // overflows iff a - b > a.
2274 SDValue Ofl = DAG.getSetCC(dl, N->getValueType(1), Sum, LHS,
2275 N->getOpcode () == ISD::UADDO ?
2276 ISD::SETULT : ISD::SETUGT);
2278 // Use the calculated overflow everywhere.
2279 ReplaceValueWith(SDValue(N, 1), Ofl);
2282 void DAGTypeLegalizer::ExpandIntRes_XMULO(SDNode *N,
2283 SDValue &Lo, SDValue &Hi) {
2284 EVT VT = N->getValueType(0);
2287 // A divide for UMULO should be faster than a function call.
2288 if (N->getOpcode() == ISD::UMULO) {
2289 SDValue LHS = N->getOperand(0), RHS = N->getOperand(1);
2291 SDValue MUL = DAG.getNode(ISD::MUL, dl, LHS.getValueType(), LHS, RHS);
2292 SplitInteger(MUL, Lo, Hi);
2294 // A divide for UMULO will be faster than a function call. Select to
2295 // make sure we aren't using 0.
2296 SDValue isZero = DAG.getSetCC(dl, getSetCCResultType(VT),
2297 RHS, DAG.getConstant(0, VT), ISD::SETEQ);
2298 SDValue NotZero = DAG.getSelect(dl, VT, isZero,
2299 DAG.getConstant(1, VT), RHS);
2300 SDValue DIV = DAG.getNode(ISD::UDIV, dl, VT, MUL, NotZero);
2301 SDValue Overflow = DAG.getSetCC(dl, N->getValueType(1), DIV, LHS,
2303 Overflow = DAG.getSelect(dl, N->getValueType(1), isZero,
2304 DAG.getConstant(0, N->getValueType(1)),
2306 ReplaceValueWith(SDValue(N, 1), Overflow);
2310 Type *RetTy = VT.getTypeForEVT(*DAG.getContext());
2311 EVT PtrVT = TLI.getPointerTy();
2312 Type *PtrTy = PtrVT.getTypeForEVT(*DAG.getContext());
2314 // Replace this with a libcall that will check overflow.
2315 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
2317 LC = RTLIB::MULO_I32;
2318 else if (VT == MVT::i64)
2319 LC = RTLIB::MULO_I64;
2320 else if (VT == MVT::i128)
2321 LC = RTLIB::MULO_I128;
2322 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported XMULO!");
2324 SDValue Temp = DAG.CreateStackTemporary(PtrVT);
2325 // Temporary for the overflow value, default it to zero.
2326 SDValue Chain = DAG.getStore(DAG.getEntryNode(), dl,
2327 DAG.getConstant(0, PtrVT), Temp,
2328 MachinePointerInfo(), false, false, 0);
2330 TargetLowering::ArgListTy Args;
2331 TargetLowering::ArgListEntry Entry;
2332 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
2333 EVT ArgVT = N->getOperand(i).getValueType();
2334 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
2335 Entry.Node = N->getOperand(i);
2337 Entry.isSExt = true;
2338 Entry.isZExt = false;
2339 Args.push_back(Entry);
2342 // Also pass the address of the overflow check.
2344 Entry.Ty = PtrTy->getPointerTo();
2345 Entry.isSExt = true;
2346 Entry.isZExt = false;
2347 Args.push_back(Entry);
2349 SDValue Func = DAG.getExternalSymbol(TLI.getLibcallName(LC), PtrVT);
2351 CallLoweringInfo CLI(Chain, RetTy, true, false, false, false,
2352 0, TLI.getLibcallCallingConv(LC),
2353 /*isTailCall=*/false,
2354 /*doesNotReturn=*/false, /*isReturnValueUsed=*/true,
2355 Func, Args, DAG, dl);
2356 std::pair<SDValue, SDValue> CallInfo = TLI.LowerCallTo(CLI);
2358 SplitInteger(CallInfo.first, Lo, Hi);
2359 SDValue Temp2 = DAG.getLoad(PtrVT, dl, CallInfo.second, Temp,
2360 MachinePointerInfo(), false, false, false, 0);
2361 SDValue Ofl = DAG.getSetCC(dl, N->getValueType(1), Temp2,
2362 DAG.getConstant(0, PtrVT),
2364 // Use the overflow from the libcall everywhere.
2365 ReplaceValueWith(SDValue(N, 1), Ofl);
2368 void DAGTypeLegalizer::ExpandIntRes_UDIV(SDNode *N,
2369 SDValue &Lo, SDValue &Hi) {
2370 EVT VT = N->getValueType(0);
2373 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
2375 LC = RTLIB::UDIV_I16;
2376 else if (VT == MVT::i32)
2377 LC = RTLIB::UDIV_I32;
2378 else if (VT == MVT::i64)
2379 LC = RTLIB::UDIV_I64;
2380 else if (VT == MVT::i128)
2381 LC = RTLIB::UDIV_I128;
2382 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported UDIV!");
2384 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) };
2385 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Ops, 2, false, dl).first, Lo, Hi);
2388 void DAGTypeLegalizer::ExpandIntRes_UREM(SDNode *N,
2389 SDValue &Lo, SDValue &Hi) {
2390 EVT VT = N->getValueType(0);
2393 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
2395 LC = RTLIB::UREM_I16;
2396 else if (VT == MVT::i32)
2397 LC = RTLIB::UREM_I32;
2398 else if (VT == MVT::i64)
2399 LC = RTLIB::UREM_I64;
2400 else if (VT == MVT::i128)
2401 LC = RTLIB::UREM_I128;
2402 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported UREM!");
2404 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) };
2405 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Ops, 2, false, dl).first, Lo, Hi);
2408 void DAGTypeLegalizer::ExpandIntRes_ZERO_EXTEND(SDNode *N,
2409 SDValue &Lo, SDValue &Hi) {
2410 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
2412 SDValue Op = N->getOperand(0);
2413 if (Op.getValueType().bitsLE(NVT)) {
2414 // The low part is zero extension of the input (degenerates to a copy).
2415 Lo = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, N->getOperand(0));
2416 Hi = DAG.getConstant(0, NVT); // The high part is just a zero.
2418 // For example, extension of an i48 to an i64. The operand type necessarily
2419 // promotes to the result type, so will end up being expanded too.
2420 assert(getTypeAction(Op.getValueType()) ==
2421 TargetLowering::TypePromoteInteger &&
2422 "Only know how to promote this result!");
2423 SDValue Res = GetPromotedInteger(Op);
2424 assert(Res.getValueType() == N->getValueType(0) &&
2425 "Operand over promoted?");
2426 // Split the promoted operand. This will simplify when it is expanded.
2427 SplitInteger(Res, Lo, Hi);
2428 unsigned ExcessBits =
2429 Op.getValueType().getSizeInBits() - NVT.getSizeInBits();
2430 Hi = DAG.getZeroExtendInReg(Hi, dl,
2431 EVT::getIntegerVT(*DAG.getContext(),
2436 void DAGTypeLegalizer::ExpandIntRes_ATOMIC_LOAD(SDNode *N,
2437 SDValue &Lo, SDValue &Hi) {
2439 EVT VT = cast<AtomicSDNode>(N)->getMemoryVT();
2440 SDValue Zero = DAG.getConstant(0, VT);
2441 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_CMP_SWAP, dl, VT,
2443 N->getOperand(1), Zero, Zero,
2444 cast<AtomicSDNode>(N)->getMemOperand(),
2445 cast<AtomicSDNode>(N)->getOrdering(),
2446 cast<AtomicSDNode>(N)->getSynchScope());
2447 ReplaceValueWith(SDValue(N, 0), Swap.getValue(0));
2448 ReplaceValueWith(SDValue(N, 1), Swap.getValue(1));
2451 //===----------------------------------------------------------------------===//
2452 // Integer Operand Expansion
2453 //===----------------------------------------------------------------------===//
2455 /// ExpandIntegerOperand - This method is called when the specified operand of
2456 /// the specified node is found to need expansion. At this point, all of the
2457 /// result types of the node are known to be legal, but other operands of the
2458 /// node may need promotion or expansion as well as the specified one.
2459 bool DAGTypeLegalizer::ExpandIntegerOperand(SDNode *N, unsigned OpNo) {
2460 DEBUG(dbgs() << "Expand integer operand: "; N->dump(&DAG); dbgs() << "\n");
2461 SDValue Res = SDValue();
2463 if (CustomLowerNode(N, N->getOperand(OpNo).getValueType(), false))
2466 switch (N->getOpcode()) {
2469 dbgs() << "ExpandIntegerOperand Op #" << OpNo << ": ";
2470 N->dump(&DAG); dbgs() << "\n";
2472 llvm_unreachable("Do not know how to expand this operator's operand!");
2474 case ISD::BITCAST: Res = ExpandOp_BITCAST(N); break;
2475 case ISD::BR_CC: Res = ExpandIntOp_BR_CC(N); break;
2476 case ISD::BUILD_VECTOR: Res = ExpandOp_BUILD_VECTOR(N); break;
2477 case ISD::EXTRACT_ELEMENT: Res = ExpandOp_EXTRACT_ELEMENT(N); break;
2478 case ISD::INSERT_VECTOR_ELT: Res = ExpandOp_INSERT_VECTOR_ELT(N); break;
2479 case ISD::SCALAR_TO_VECTOR: Res = ExpandOp_SCALAR_TO_VECTOR(N); break;
2480 case ISD::SELECT_CC: Res = ExpandIntOp_SELECT_CC(N); break;
2481 case ISD::SETCC: Res = ExpandIntOp_SETCC(N); break;
2482 case ISD::SINT_TO_FP: Res = ExpandIntOp_SINT_TO_FP(N); break;
2483 case ISD::STORE: Res = ExpandIntOp_STORE(cast<StoreSDNode>(N), OpNo); break;
2484 case ISD::TRUNCATE: Res = ExpandIntOp_TRUNCATE(N); break;
2485 case ISD::UINT_TO_FP: Res = ExpandIntOp_UINT_TO_FP(N); break;
2491 case ISD::ROTR: Res = ExpandIntOp_Shift(N); break;
2492 case ISD::RETURNADDR:
2493 case ISD::FRAMEADDR: Res = ExpandIntOp_RETURNADDR(N); break;
2495 case ISD::ATOMIC_STORE: Res = ExpandIntOp_ATOMIC_STORE(N); break;
2498 // If the result is null, the sub-method took care of registering results etc.
2499 if (!Res.getNode()) return false;
2501 // If the result is N, the sub-method updated N in place. Tell the legalizer
2503 if (Res.getNode() == N)
2506 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
2507 "Invalid operand expansion");
2509 ReplaceValueWith(SDValue(N, 0), Res);
2513 /// IntegerExpandSetCCOperands - Expand the operands of a comparison. This code
2514 /// is shared among BR_CC, SELECT_CC, and SETCC handlers.
2515 void DAGTypeLegalizer::IntegerExpandSetCCOperands(SDValue &NewLHS,
2517 ISD::CondCode &CCCode,
2519 SDValue LHSLo, LHSHi, RHSLo, RHSHi;
2520 GetExpandedInteger(NewLHS, LHSLo, LHSHi);
2521 GetExpandedInteger(NewRHS, RHSLo, RHSHi);
2523 if (CCCode == ISD::SETEQ || CCCode == ISD::SETNE) {
2524 if (RHSLo == RHSHi) {
2525 if (ConstantSDNode *RHSCST = dyn_cast<ConstantSDNode>(RHSLo)) {
2526 if (RHSCST->isAllOnesValue()) {
2527 // Equality comparison to -1.
2528 NewLHS = DAG.getNode(ISD::AND, dl,
2529 LHSLo.getValueType(), LHSLo, LHSHi);
2536 NewLHS = DAG.getNode(ISD::XOR, dl, LHSLo.getValueType(), LHSLo, RHSLo);
2537 NewRHS = DAG.getNode(ISD::XOR, dl, LHSLo.getValueType(), LHSHi, RHSHi);
2538 NewLHS = DAG.getNode(ISD::OR, dl, NewLHS.getValueType(), NewLHS, NewRHS);
2539 NewRHS = DAG.getConstant(0, NewLHS.getValueType());
2543 // If this is a comparison of the sign bit, just look at the top part.
2545 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(NewRHS))
2546 if ((CCCode == ISD::SETLT && CST->isNullValue()) || // X < 0
2547 (CCCode == ISD::SETGT && CST->isAllOnesValue())) { // X > -1
2553 // FIXME: This generated code sucks.
2554 ISD::CondCode LowCC;
2556 default: llvm_unreachable("Unknown integer setcc!");
2558 case ISD::SETULT: LowCC = ISD::SETULT; break;
2560 case ISD::SETUGT: LowCC = ISD::SETUGT; break;
2562 case ISD::SETULE: LowCC = ISD::SETULE; break;
2564 case ISD::SETUGE: LowCC = ISD::SETUGE; break;
2567 // Tmp1 = lo(op1) < lo(op2) // Always unsigned comparison
2568 // Tmp2 = hi(op1) < hi(op2) // Signedness depends on operands
2569 // dest = hi(op1) == hi(op2) ? Tmp1 : Tmp2;
2571 // NOTE: on targets without efficient SELECT of bools, we can always use
2572 // this identity: (B1 ? B2 : B3) --> (B1 & B2)|(!B1&B3)
2573 TargetLowering::DAGCombinerInfo DagCombineInfo(DAG, AfterLegalizeTypes, true, NULL);
2575 Tmp1 = TLI.SimplifySetCC(getSetCCResultType(LHSLo.getValueType()),
2576 LHSLo, RHSLo, LowCC, false, DagCombineInfo, dl);
2577 if (!Tmp1.getNode())
2578 Tmp1 = DAG.getSetCC(dl, getSetCCResultType(LHSLo.getValueType()),
2579 LHSLo, RHSLo, LowCC);
2580 Tmp2 = TLI.SimplifySetCC(getSetCCResultType(LHSHi.getValueType()),
2581 LHSHi, RHSHi, CCCode, false, DagCombineInfo, dl);
2582 if (!Tmp2.getNode())
2583 Tmp2 = DAG.getNode(ISD::SETCC, dl,
2584 getSetCCResultType(LHSHi.getValueType()),
2585 LHSHi, RHSHi, DAG.getCondCode(CCCode));
2587 ConstantSDNode *Tmp1C = dyn_cast<ConstantSDNode>(Tmp1.getNode());
2588 ConstantSDNode *Tmp2C = dyn_cast<ConstantSDNode>(Tmp2.getNode());
2589 if ((Tmp1C && Tmp1C->isNullValue()) ||
2590 (Tmp2C && Tmp2C->isNullValue() &&
2591 (CCCode == ISD::SETLE || CCCode == ISD::SETGE ||
2592 CCCode == ISD::SETUGE || CCCode == ISD::SETULE)) ||
2593 (Tmp2C && Tmp2C->getAPIntValue() == 1 &&
2594 (CCCode == ISD::SETLT || CCCode == ISD::SETGT ||
2595 CCCode == ISD::SETUGT || CCCode == ISD::SETULT))) {
2596 // low part is known false, returns high part.
2597 // For LE / GE, if high part is known false, ignore the low part.
2598 // For LT / GT, if high part is known true, ignore the low part.
2604 NewLHS = TLI.SimplifySetCC(getSetCCResultType(LHSHi.getValueType()),
2605 LHSHi, RHSHi, ISD::SETEQ, false,
2606 DagCombineInfo, dl);
2607 if (!NewLHS.getNode())
2608 NewLHS = DAG.getSetCC(dl, getSetCCResultType(LHSHi.getValueType()),
2609 LHSHi, RHSHi, ISD::SETEQ);
2610 NewLHS = DAG.getSelect(dl, Tmp1.getValueType(),
2611 NewLHS, Tmp1, Tmp2);
2615 SDValue DAGTypeLegalizer::ExpandIntOp_BR_CC(SDNode *N) {
2616 SDValue NewLHS = N->getOperand(2), NewRHS = N->getOperand(3);
2617 ISD::CondCode CCCode = cast<CondCodeSDNode>(N->getOperand(1))->get();
2618 IntegerExpandSetCCOperands(NewLHS, NewRHS, CCCode, SDLoc(N));
2620 // If ExpandSetCCOperands returned a scalar, we need to compare the result
2621 // against zero to select between true and false values.
2622 if (NewRHS.getNode() == 0) {
2623 NewRHS = DAG.getConstant(0, NewLHS.getValueType());
2624 CCCode = ISD::SETNE;
2627 // Update N to have the operands specified.
2628 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0),
2629 DAG.getCondCode(CCCode), NewLHS, NewRHS,
2630 N->getOperand(4)), 0);
2633 SDValue DAGTypeLegalizer::ExpandIntOp_SELECT_CC(SDNode *N) {
2634 SDValue NewLHS = N->getOperand(0), NewRHS = N->getOperand(1);
2635 ISD::CondCode CCCode = cast<CondCodeSDNode>(N->getOperand(4))->get();
2636 IntegerExpandSetCCOperands(NewLHS, NewRHS, CCCode, SDLoc(N));
2638 // If ExpandSetCCOperands returned a scalar, we need to compare the result
2639 // against zero to select between true and false values.
2640 if (NewRHS.getNode() == 0) {
2641 NewRHS = DAG.getConstant(0, NewLHS.getValueType());
2642 CCCode = ISD::SETNE;
2645 // Update N to have the operands specified.
2646 return SDValue(DAG.UpdateNodeOperands(N, NewLHS, NewRHS,
2647 N->getOperand(2), N->getOperand(3),
2648 DAG.getCondCode(CCCode)), 0);
2651 SDValue DAGTypeLegalizer::ExpandIntOp_SETCC(SDNode *N) {
2652 SDValue NewLHS = N->getOperand(0), NewRHS = N->getOperand(1);
2653 ISD::CondCode CCCode = cast<CondCodeSDNode>(N->getOperand(2))->get();
2654 IntegerExpandSetCCOperands(NewLHS, NewRHS, CCCode, SDLoc(N));
2656 // If ExpandSetCCOperands returned a scalar, use it.
2657 if (NewRHS.getNode() == 0) {
2658 assert(NewLHS.getValueType() == N->getValueType(0) &&
2659 "Unexpected setcc expansion!");
2663 // Otherwise, update N to have the operands specified.
2664 return SDValue(DAG.UpdateNodeOperands(N, NewLHS, NewRHS,
2665 DAG.getCondCode(CCCode)), 0);
2668 SDValue DAGTypeLegalizer::ExpandIntOp_Shift(SDNode *N) {
2669 // The value being shifted is legal, but the shift amount is too big.
2670 // It follows that either the result of the shift is undefined, or the
2671 // upper half of the shift amount is zero. Just use the lower half.
2673 GetExpandedInteger(N->getOperand(1), Lo, Hi);
2674 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0), Lo), 0);
2677 SDValue DAGTypeLegalizer::ExpandIntOp_RETURNADDR(SDNode *N) {
2678 // The argument of RETURNADDR / FRAMEADDR builtin is 32 bit contant. This
2679 // surely makes pretty nice problems on 8/16 bit targets. Just truncate this
2680 // constant to valid type.
2682 GetExpandedInteger(N->getOperand(0), Lo, Hi);
2683 return SDValue(DAG.UpdateNodeOperands(N, Lo), 0);
2686 SDValue DAGTypeLegalizer::ExpandIntOp_SINT_TO_FP(SDNode *N) {
2687 SDValue Op = N->getOperand(0);
2688 EVT DstVT = N->getValueType(0);
2689 RTLIB::Libcall LC = RTLIB::getSINTTOFP(Op.getValueType(), DstVT);
2690 assert(LC != RTLIB::UNKNOWN_LIBCALL &&
2691 "Don't know how to expand this SINT_TO_FP!");
2692 return TLI.makeLibCall(DAG, LC, DstVT, &Op, 1, true, SDLoc(N)).first;
2695 SDValue DAGTypeLegalizer::ExpandIntOp_STORE(StoreSDNode *N, unsigned OpNo) {
2696 if (ISD::isNormalStore(N))
2697 return ExpandOp_NormalStore(N, OpNo);
2699 assert(ISD::isUNINDEXEDStore(N) && "Indexed store during type legalization!");
2700 assert(OpNo == 1 && "Can only expand the stored value so far");
2702 EVT VT = N->getOperand(1).getValueType();
2703 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT);
2704 SDValue Ch = N->getChain();
2705 SDValue Ptr = N->getBasePtr();
2706 unsigned Alignment = N->getAlignment();
2707 bool isVolatile = N->isVolatile();
2708 bool isNonTemporal = N->isNonTemporal();
2712 assert(NVT.isByteSized() && "Expanded type not byte sized!");
2714 if (N->getMemoryVT().bitsLE(NVT)) {
2715 GetExpandedInteger(N->getValue(), Lo, Hi);
2716 return DAG.getTruncStore(Ch, dl, Lo, Ptr, N->getPointerInfo(),
2717 N->getMemoryVT(), isVolatile, isNonTemporal,
2721 if (TLI.isLittleEndian()) {
2722 // Little-endian - low bits are at low addresses.
2723 GetExpandedInteger(N->getValue(), Lo, Hi);
2725 Lo = DAG.getStore(Ch, dl, Lo, Ptr, N->getPointerInfo(),
2726 isVolatile, isNonTemporal, Alignment);
2728 unsigned ExcessBits =
2729 N->getMemoryVT().getSizeInBits() - NVT.getSizeInBits();
2730 EVT NEVT = EVT::getIntegerVT(*DAG.getContext(), ExcessBits);
2732 // Increment the pointer to the other half.
2733 unsigned IncrementSize = NVT.getSizeInBits()/8;
2734 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
2735 DAG.getIntPtrConstant(IncrementSize));
2736 Hi = DAG.getTruncStore(Ch, dl, Hi, Ptr,
2737 N->getPointerInfo().getWithOffset(IncrementSize),
2738 NEVT, isVolatile, isNonTemporal,
2739 MinAlign(Alignment, IncrementSize));
2740 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo, Hi);
2743 // Big-endian - high bits are at low addresses. Favor aligned stores at
2744 // the cost of some bit-fiddling.
2745 GetExpandedInteger(N->getValue(), Lo, Hi);
2747 EVT ExtVT = N->getMemoryVT();
2748 unsigned EBytes = ExtVT.getStoreSize();
2749 unsigned IncrementSize = NVT.getSizeInBits()/8;
2750 unsigned ExcessBits = (EBytes - IncrementSize)*8;
2751 EVT HiVT = EVT::getIntegerVT(*DAG.getContext(),
2752 ExtVT.getSizeInBits() - ExcessBits);
2754 if (ExcessBits < NVT.getSizeInBits()) {
2755 // Transfer high bits from the top of Lo to the bottom of Hi.
2756 Hi = DAG.getNode(ISD::SHL, dl, NVT, Hi,
2757 DAG.getConstant(NVT.getSizeInBits() - ExcessBits,
2758 TLI.getPointerTy()));
2759 Hi = DAG.getNode(ISD::OR, dl, NVT, Hi,
2760 DAG.getNode(ISD::SRL, dl, NVT, Lo,
2761 DAG.getConstant(ExcessBits,
2762 TLI.getPointerTy())));
2765 // Store both the high bits and maybe some of the low bits.
2766 Hi = DAG.getTruncStore(Ch, dl, Hi, Ptr, N->getPointerInfo(),
2767 HiVT, isVolatile, isNonTemporal, Alignment);
2769 // Increment the pointer to the other half.
2770 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
2771 DAG.getIntPtrConstant(IncrementSize));
2772 // Store the lowest ExcessBits bits in the second half.
2773 Lo = DAG.getTruncStore(Ch, dl, Lo, Ptr,
2774 N->getPointerInfo().getWithOffset(IncrementSize),
2775 EVT::getIntegerVT(*DAG.getContext(), ExcessBits),
2776 isVolatile, isNonTemporal,
2777 MinAlign(Alignment, IncrementSize));
2778 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo, Hi);
2781 SDValue DAGTypeLegalizer::ExpandIntOp_TRUNCATE(SDNode *N) {
2783 GetExpandedInteger(N->getOperand(0), InL, InH);
2784 // Just truncate the low part of the source.
2785 return DAG.getNode(ISD::TRUNCATE, SDLoc(N), N->getValueType(0), InL);
2788 SDValue DAGTypeLegalizer::ExpandIntOp_UINT_TO_FP(SDNode *N) {
2789 SDValue Op = N->getOperand(0);
2790 EVT SrcVT = Op.getValueType();
2791 EVT DstVT = N->getValueType(0);
2794 // The following optimization is valid only if every value in SrcVT (when
2795 // treated as signed) is representable in DstVT. Check that the mantissa
2796 // size of DstVT is >= than the number of bits in SrcVT -1.
2797 const fltSemantics &sem = DAG.EVTToAPFloatSemantics(DstVT);
2798 if (APFloat::semanticsPrecision(sem) >= SrcVT.getSizeInBits()-1 &&
2799 TLI.getOperationAction(ISD::SINT_TO_FP, SrcVT) == TargetLowering::Custom){
2800 // Do a signed conversion then adjust the result.
2801 SDValue SignedConv = DAG.getNode(ISD::SINT_TO_FP, dl, DstVT, Op);
2802 SignedConv = TLI.LowerOperation(SignedConv, DAG);
2804 // The result of the signed conversion needs adjusting if the 'sign bit' of
2805 // the incoming integer was set. To handle this, we dynamically test to see
2806 // if it is set, and, if so, add a fudge factor.
2808 const uint64_t F32TwoE32 = 0x4F800000ULL;
2809 const uint64_t F32TwoE64 = 0x5F800000ULL;
2810 const uint64_t F32TwoE128 = 0x7F800000ULL;
2813 if (SrcVT == MVT::i32)
2814 FF = APInt(32, F32TwoE32);
2815 else if (SrcVT == MVT::i64)
2816 FF = APInt(32, F32TwoE64);
2817 else if (SrcVT == MVT::i128)
2818 FF = APInt(32, F32TwoE128);
2820 llvm_unreachable("Unsupported UINT_TO_FP!");
2822 // Check whether the sign bit is set.
2824 GetExpandedInteger(Op, Lo, Hi);
2825 SDValue SignSet = DAG.getSetCC(dl,
2826 getSetCCResultType(Hi.getValueType()),
2827 Hi, DAG.getConstant(0, Hi.getValueType()),
2830 // Build a 64 bit pair (0, FF) in the constant pool, with FF in the lo bits.
2831 SDValue FudgePtr = DAG.getConstantPool(
2832 ConstantInt::get(*DAG.getContext(), FF.zext(64)),
2833 TLI.getPointerTy());
2835 // Get a pointer to FF if the sign bit was set, or to 0 otherwise.
2836 SDValue Zero = DAG.getIntPtrConstant(0);
2837 SDValue Four = DAG.getIntPtrConstant(4);
2838 if (TLI.isBigEndian()) std::swap(Zero, Four);
2839 SDValue Offset = DAG.getSelect(dl, Zero.getValueType(), SignSet,
2841 unsigned Alignment = cast<ConstantPoolSDNode>(FudgePtr)->getAlignment();
2842 FudgePtr = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(), FudgePtr, Offset);
2843 Alignment = std::min(Alignment, 4u);
2845 // Load the value out, extending it from f32 to the destination float type.
2846 // FIXME: Avoid the extend by constructing the right constant pool?
2847 SDValue Fudge = DAG.getExtLoad(ISD::EXTLOAD, dl, DstVT, DAG.getEntryNode(),
2849 MachinePointerInfo::getConstantPool(),
2851 false, false, Alignment);
2852 return DAG.getNode(ISD::FADD, dl, DstVT, SignedConv, Fudge);
2855 // Otherwise, use a libcall.
2856 RTLIB::Libcall LC = RTLIB::getUINTTOFP(SrcVT, DstVT);
2857 assert(LC != RTLIB::UNKNOWN_LIBCALL &&
2858 "Don't know how to expand this UINT_TO_FP!");
2859 return TLI.makeLibCall(DAG, LC, DstVT, &Op, 1, true, dl).first;
2862 SDValue DAGTypeLegalizer::ExpandIntOp_ATOMIC_STORE(SDNode *N) {
2864 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_SWAP, dl,
2865 cast<AtomicSDNode>(N)->getMemoryVT(),
2867 N->getOperand(1), N->getOperand(2),
2868 cast<AtomicSDNode>(N)->getMemOperand(),
2869 cast<AtomicSDNode>(N)->getOrdering(),
2870 cast<AtomicSDNode>(N)->getSynchScope());
2871 return Swap.getValue(1);
2875 SDValue DAGTypeLegalizer::PromoteIntRes_EXTRACT_SUBVECTOR(SDNode *N) {
2876 SDValue InOp0 = N->getOperand(0);
2877 EVT InVT = InOp0.getValueType();
2879 EVT OutVT = N->getValueType(0);
2880 EVT NOutVT = TLI.getTypeToTransformTo(*DAG.getContext(), OutVT);
2881 assert(NOutVT.isVector() && "This type must be promoted to a vector type");
2882 unsigned OutNumElems = OutVT.getVectorNumElements();
2883 EVT NOutVTElem = NOutVT.getVectorElementType();
2886 SDValue BaseIdx = N->getOperand(1);
2888 SmallVector<SDValue, 8> Ops;
2889 Ops.reserve(OutNumElems);
2890 for (unsigned i = 0; i != OutNumElems; ++i) {
2892 // Extract the element from the original vector.
2893 SDValue Index = DAG.getNode(ISD::ADD, dl, BaseIdx.getValueType(),
2894 BaseIdx, DAG.getConstant(i, BaseIdx.getValueType()));
2895 SDValue Ext = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
2896 InVT.getVectorElementType(), N->getOperand(0), Index);
2898 SDValue Op = DAG.getNode(ISD::ANY_EXTEND, dl, NOutVTElem, Ext);
2899 // Insert the converted element to the new vector.
2903 return DAG.getNode(ISD::BUILD_VECTOR, dl, NOutVT, &Ops[0], Ops.size());
2907 SDValue DAGTypeLegalizer::PromoteIntRes_VECTOR_SHUFFLE(SDNode *N) {
2908 ShuffleVectorSDNode *SV = cast<ShuffleVectorSDNode>(N);
2909 EVT VT = N->getValueType(0);
2912 unsigned NumElts = VT.getVectorNumElements();
2913 SmallVector<int, 8> NewMask;
2914 for (unsigned i = 0; i != NumElts; ++i) {
2915 NewMask.push_back(SV->getMaskElt(i));
2918 SDValue V0 = GetPromotedInteger(N->getOperand(0));
2919 SDValue V1 = GetPromotedInteger(N->getOperand(1));
2920 EVT OutVT = V0.getValueType();
2922 return DAG.getVectorShuffle(OutVT, dl, V0, V1, &NewMask[0]);
2926 SDValue DAGTypeLegalizer::PromoteIntRes_BUILD_VECTOR(SDNode *N) {
2927 EVT OutVT = N->getValueType(0);
2928 EVT NOutVT = TLI.getTypeToTransformTo(*DAG.getContext(), OutVT);
2929 assert(NOutVT.isVector() && "This type must be promoted to a vector type");
2930 unsigned NumElems = N->getNumOperands();
2931 EVT NOutVTElem = NOutVT.getVectorElementType();
2935 SmallVector<SDValue, 8> Ops;
2936 Ops.reserve(NumElems);
2937 for (unsigned i = 0; i != NumElems; ++i) {
2939 // BUILD_VECTOR integer operand types are allowed to be larger than the
2940 // result's element type. This may still be true after the promotion. For
2941 // example, we might be promoting (<v?i1> = BV <i32>, <i32>, ...) to
2942 // (v?i16 = BV <i32>, <i32>, ...), and we can't any_extend <i32> to <i16>.
2943 if (N->getOperand(i).getValueType().bitsLT(NOutVTElem))
2944 Op = DAG.getNode(ISD::ANY_EXTEND, dl, NOutVTElem, N->getOperand(i));
2946 Op = N->getOperand(i);
2950 return DAG.getNode(ISD::BUILD_VECTOR, dl, NOutVT, &Ops[0], Ops.size());
2953 SDValue DAGTypeLegalizer::PromoteIntRes_SCALAR_TO_VECTOR(SDNode *N) {
2957 assert(!N->getOperand(0).getValueType().isVector() &&
2958 "Input must be a scalar");
2960 EVT OutVT = N->getValueType(0);
2961 EVT NOutVT = TLI.getTypeToTransformTo(*DAG.getContext(), OutVT);
2962 assert(NOutVT.isVector() && "This type must be promoted to a vector type");
2963 EVT NOutVTElem = NOutVT.getVectorElementType();
2965 SDValue Op = DAG.getNode(ISD::ANY_EXTEND, dl, NOutVTElem, N->getOperand(0));
2967 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, NOutVT, Op);
2970 SDValue DAGTypeLegalizer::PromoteIntRes_CONCAT_VECTORS(SDNode *N) {
2973 EVT OutVT = N->getValueType(0);
2974 EVT NOutVT = TLI.getTypeToTransformTo(*DAG.getContext(), OutVT);
2975 assert(NOutVT.isVector() && "This type must be promoted to a vector type");
2977 EVT InElemTy = OutVT.getVectorElementType();
2978 EVT OutElemTy = NOutVT.getVectorElementType();
2980 unsigned NumElem = N->getOperand(0).getValueType().getVectorNumElements();
2981 unsigned NumOutElem = NOutVT.getVectorNumElements();
2982 unsigned NumOperands = N->getNumOperands();
2983 assert(NumElem * NumOperands == NumOutElem &&
2984 "Unexpected number of elements");
2986 // Take the elements from the first vector.
2987 SmallVector<SDValue, 8> Ops(NumOutElem);
2988 for (unsigned i = 0; i < NumOperands; ++i) {
2989 SDValue Op = N->getOperand(i);
2990 for (unsigned j = 0; j < NumElem; ++j) {
2991 SDValue Ext = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
2992 InElemTy, Op, DAG.getConstant(j,
2993 TLI.getVectorIdxTy()));
2994 Ops[i * NumElem + j] = DAG.getNode(ISD::ANY_EXTEND, dl, OutElemTy, Ext);
2998 return DAG.getNode(ISD::BUILD_VECTOR, dl, NOutVT, &Ops[0], Ops.size());
3001 SDValue DAGTypeLegalizer::PromoteIntRes_INSERT_VECTOR_ELT(SDNode *N) {
3002 EVT OutVT = N->getValueType(0);
3003 EVT NOutVT = TLI.getTypeToTransformTo(*DAG.getContext(), OutVT);
3004 assert(NOutVT.isVector() && "This type must be promoted to a vector type");
3006 EVT NOutVTElem = NOutVT.getVectorElementType();
3009 SDValue V0 = GetPromotedInteger(N->getOperand(0));
3011 SDValue ConvElem = DAG.getNode(ISD::ANY_EXTEND, dl,
3012 NOutVTElem, N->getOperand(1));
3013 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, NOutVT,
3014 V0, ConvElem, N->getOperand(2));
3017 SDValue DAGTypeLegalizer::PromoteIntOp_EXTRACT_VECTOR_ELT(SDNode *N) {
3019 SDValue V0 = GetPromotedInteger(N->getOperand(0));
3020 SDValue V1 = DAG.getZExtOrTrunc(N->getOperand(1), dl, TLI.getVectorIdxTy());
3021 SDValue Ext = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
3022 V0->getValueType(0).getScalarType(), V0, V1);
3024 // EXTRACT_VECTOR_ELT can return types which are wider than the incoming
3025 // element types. If this is the case then we need to expand the outgoing
3026 // value and not truncate it.
3027 return DAG.getAnyExtOrTrunc(Ext, dl, N->getValueType(0));
3030 SDValue DAGTypeLegalizer::PromoteIntOp_CONCAT_VECTORS(SDNode *N) {
3032 unsigned NumElems = N->getNumOperands();
3034 EVT RetSclrTy = N->getValueType(0).getVectorElementType();
3036 SmallVector<SDValue, 8> NewOps;
3037 NewOps.reserve(NumElems);
3039 // For each incoming vector
3040 for (unsigned VecIdx = 0; VecIdx != NumElems; ++VecIdx) {
3041 SDValue Incoming = GetPromotedInteger(N->getOperand(VecIdx));
3042 EVT SclrTy = Incoming->getValueType(0).getVectorElementType();
3043 unsigned NumElem = Incoming->getValueType(0).getVectorNumElements();
3045 for (unsigned i=0; i<NumElem; ++i) {
3046 // Extract element from incoming vector
3047 SDValue Ex = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SclrTy,
3048 Incoming, DAG.getConstant(i, TLI.getVectorIdxTy()));
3049 SDValue Tr = DAG.getNode(ISD::TRUNCATE, dl, RetSclrTy, Ex);
3050 NewOps.push_back(Tr);
3054 return DAG.getNode(ISD::BUILD_VECTOR, dl, N->getValueType(0),
3055 &NewOps[0], NewOps.size());