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, N->getDebugLoc(),
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, N->getDebugLoc(),
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(), N->getDebugLoc(),
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(), N->getDebugLoc(),
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(), N->getDebugLoc(),
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);
212 DebugLoc dl = N->getDebugLoc();
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();
267 DebugLoc dl = N->getDebugLoc();
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, N->getDebugLoc(),
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
286 DebugLoc dl = N->getDebugLoc();
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, N->getDebugLoc(), 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));
312 DebugLoc dl = N->getDebugLoc();
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, N->getDebugLoc(), 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();
332 DebugLoc dl = N->getDebugLoc();
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) {
345 DebugLoc dl = N->getDebugLoc();
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();
354 DebugLoc dl = N->getDebugLoc();
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));
377 DebugLoc dl = N->getDebugLoc();
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));
387 DebugLoc dl = N->getDebugLoc();
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();
418 DebugLoc dl = N->getDebugLoc();
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(), N->getDebugLoc(),
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();
456 DebugLoc dl = N->getDebugLoc();
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(), N->getDebugLoc(),
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.getNode(ISD::SELECT, N->getDebugLoc(),
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, TLI.getSetCCResultType(OpTy));
496 SDValue LHS = GetPromotedInteger(N->getOperand(1));
497 SDValue RHS = GetPromotedInteger(N->getOperand(2));
498 return DAG.getNode(ISD::VSELECT, N->getDebugLoc(),
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, N->getDebugLoc(),
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 = TLI.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))
520 DebugLoc dl = N->getDebugLoc();
521 assert(SVT.isVector() == N->getOperand(0).getValueType().isVector() &&
522 "Vector compare must return a vector result!");
524 // Get the SETCC result using the canonical SETCC type.
525 SDValue SetCC = DAG.getNode(N->getOpcode(), dl, SVT, N->getOperand(0),
526 N->getOperand(1), N->getOperand(2));
528 assert(NVT.bitsLE(SVT) && "Integer type overpromoted?");
529 // Convert to the expected type.
530 return DAG.getNode(ISD::TRUNCATE, dl, NVT, SetCC);
533 SDValue DAGTypeLegalizer::PromoteIntRes_SHL(SDNode *N) {
534 return DAG.getNode(ISD::SHL, N->getDebugLoc(),
535 TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0)),
536 GetPromotedInteger(N->getOperand(0)), N->getOperand(1));
539 SDValue DAGTypeLegalizer::PromoteIntRes_SIGN_EXTEND_INREG(SDNode *N) {
540 SDValue Op = GetPromotedInteger(N->getOperand(0));
541 return DAG.getNode(ISD::SIGN_EXTEND_INREG, N->getDebugLoc(),
542 Op.getValueType(), Op, N->getOperand(1));
545 SDValue DAGTypeLegalizer::PromoteIntRes_SimpleIntBinOp(SDNode *N) {
546 // The input may have strange things in the top bits of the registers, but
547 // these operations don't care. They may have weird bits going out, but
548 // that too is okay if they are integer operations.
549 SDValue LHS = GetPromotedInteger(N->getOperand(0));
550 SDValue RHS = GetPromotedInteger(N->getOperand(1));
551 return DAG.getNode(N->getOpcode(), N->getDebugLoc(),
552 LHS.getValueType(), LHS, RHS);
555 SDValue DAGTypeLegalizer::PromoteIntRes_SRA(SDNode *N) {
556 // The input value must be properly sign extended.
557 SDValue Res = SExtPromotedInteger(N->getOperand(0));
558 return DAG.getNode(ISD::SRA, N->getDebugLoc(),
559 Res.getValueType(), Res, N->getOperand(1));
562 SDValue DAGTypeLegalizer::PromoteIntRes_SRL(SDNode *N) {
563 // The input value must be properly zero extended.
564 EVT VT = N->getValueType(0);
565 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT);
566 SDValue Res = ZExtPromotedInteger(N->getOperand(0));
567 return DAG.getNode(ISD::SRL, N->getDebugLoc(), NVT, Res, N->getOperand(1));
570 SDValue DAGTypeLegalizer::PromoteIntRes_TRUNCATE(SDNode *N) {
571 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
573 SDValue InOp = N->getOperand(0);
574 DebugLoc dl = N->getDebugLoc();
576 switch (getTypeAction(InOp.getValueType())) {
577 default: llvm_unreachable("Unknown type action!");
578 case TargetLowering::TypeLegal:
579 case TargetLowering::TypeExpandInteger:
582 case TargetLowering::TypePromoteInteger:
583 Res = GetPromotedInteger(InOp);
585 case TargetLowering::TypeSplitVector:
586 EVT InVT = InOp.getValueType();
587 assert(InVT.isVector() && "Cannot split scalar types");
588 unsigned NumElts = InVT.getVectorNumElements();
589 assert(NumElts == NVT.getVectorNumElements() &&
590 "Dst and Src must have the same number of elements");
591 assert(isPowerOf2_32(NumElts) &&
592 "Promoted vector type must be a power of two");
595 GetSplitVector(InOp, EOp1, EOp2);
597 EVT HalfNVT = EVT::getVectorVT(*DAG.getContext(), NVT.getScalarType(),
599 EOp1 = DAG.getNode(ISD::TRUNCATE, dl, HalfNVT, EOp1);
600 EOp2 = DAG.getNode(ISD::TRUNCATE, dl, HalfNVT, EOp2);
602 return DAG.getNode(ISD::CONCAT_VECTORS, dl, NVT, EOp1, EOp2);
605 // Truncate to NVT instead of VT
606 return DAG.getNode(ISD::TRUNCATE, dl, NVT, Res);
609 SDValue DAGTypeLegalizer::PromoteIntRes_UADDSUBO(SDNode *N, unsigned ResNo) {
611 return PromoteIntRes_Overflow(N);
613 // The operation overflowed iff the result in the larger type is not the
614 // zero extension of its truncation to the original type.
615 SDValue LHS = ZExtPromotedInteger(N->getOperand(0));
616 SDValue RHS = ZExtPromotedInteger(N->getOperand(1));
617 EVT OVT = N->getOperand(0).getValueType();
618 EVT NVT = LHS.getValueType();
619 DebugLoc dl = N->getDebugLoc();
621 // Do the arithmetic in the larger type.
622 unsigned Opcode = N->getOpcode() == ISD::UADDO ? ISD::ADD : ISD::SUB;
623 SDValue Res = DAG.getNode(Opcode, dl, NVT, LHS, RHS);
625 // Calculate the overflow flag: zero extend the arithmetic result from
626 // the original type.
627 SDValue Ofl = DAG.getZeroExtendInReg(Res, dl, OVT);
628 // Overflowed if and only if this is not equal to Res.
629 Ofl = DAG.getSetCC(dl, N->getValueType(1), Ofl, Res, ISD::SETNE);
631 // Use the calculated overflow everywhere.
632 ReplaceValueWith(SDValue(N, 1), Ofl);
637 SDValue DAGTypeLegalizer::PromoteIntRes_XMULO(SDNode *N, unsigned ResNo) {
638 // Promote the overflow bit trivially.
640 return PromoteIntRes_Overflow(N);
642 SDValue LHS = N->getOperand(0), RHS = N->getOperand(1);
643 DebugLoc DL = N->getDebugLoc();
644 EVT SmallVT = LHS.getValueType();
646 // To determine if the result overflowed in a larger type, we extend the
647 // input to the larger type, do the multiply (checking if it overflows),
648 // then also check the high bits of the result to see if overflow happened
650 if (N->getOpcode() == ISD::SMULO) {
651 LHS = SExtPromotedInteger(LHS);
652 RHS = SExtPromotedInteger(RHS);
654 LHS = ZExtPromotedInteger(LHS);
655 RHS = ZExtPromotedInteger(RHS);
657 SDVTList VTs = DAG.getVTList(LHS.getValueType(), N->getValueType(1));
658 SDValue Mul = DAG.getNode(N->getOpcode(), DL, VTs, LHS, RHS);
660 // Overflow occurred if it occurred in the larger type, or if the high part
661 // of the result does not zero/sign-extend the low part. Check this second
662 // possibility first.
664 if (N->getOpcode() == ISD::UMULO) {
665 // Unsigned overflow occurred if the high part is non-zero.
666 SDValue Hi = DAG.getNode(ISD::SRL, DL, Mul.getValueType(), Mul,
667 DAG.getIntPtrConstant(SmallVT.getSizeInBits()));
668 Overflow = DAG.getSetCC(DL, N->getValueType(1), Hi,
669 DAG.getConstant(0, Hi.getValueType()), ISD::SETNE);
671 // Signed overflow occurred if the high part does not sign extend the low.
672 SDValue SExt = DAG.getNode(ISD::SIGN_EXTEND_INREG, DL, Mul.getValueType(),
673 Mul, DAG.getValueType(SmallVT));
674 Overflow = DAG.getSetCC(DL, N->getValueType(1), SExt, Mul, ISD::SETNE);
677 // The only other way for overflow to occur is if the multiplication in the
678 // larger type itself overflowed.
679 Overflow = DAG.getNode(ISD::OR, DL, N->getValueType(1), Overflow,
680 SDValue(Mul.getNode(), 1));
682 // Use the calculated overflow everywhere.
683 ReplaceValueWith(SDValue(N, 1), Overflow);
687 SDValue DAGTypeLegalizer::PromoteIntRes_UDIV(SDNode *N) {
688 // Zero extend the input.
689 SDValue LHS = ZExtPromotedInteger(N->getOperand(0));
690 SDValue RHS = ZExtPromotedInteger(N->getOperand(1));
691 return DAG.getNode(N->getOpcode(), N->getDebugLoc(),
692 LHS.getValueType(), LHS, RHS);
695 SDValue DAGTypeLegalizer::PromoteIntRes_UNDEF(SDNode *N) {
696 return DAG.getUNDEF(TLI.getTypeToTransformTo(*DAG.getContext(),
697 N->getValueType(0)));
700 SDValue DAGTypeLegalizer::PromoteIntRes_VAARG(SDNode *N) {
701 SDValue Chain = N->getOperand(0); // Get the chain.
702 SDValue Ptr = N->getOperand(1); // Get the pointer.
703 EVT VT = N->getValueType(0);
704 DebugLoc dl = N->getDebugLoc();
706 MVT RegVT = TLI.getRegisterType(*DAG.getContext(), VT);
707 unsigned NumRegs = TLI.getNumRegisters(*DAG.getContext(), VT);
708 // The argument is passed as NumRegs registers of type RegVT.
710 SmallVector<SDValue, 8> Parts(NumRegs);
711 for (unsigned i = 0; i < NumRegs; ++i) {
712 Parts[i] = DAG.getVAArg(RegVT, dl, Chain, Ptr, N->getOperand(2),
713 N->getConstantOperandVal(3));
714 Chain = Parts[i].getValue(1);
717 // Handle endianness of the load.
718 if (TLI.isBigEndian())
719 std::reverse(Parts.begin(), Parts.end());
721 // Assemble the parts in the promoted type.
722 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
723 SDValue Res = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Parts[0]);
724 for (unsigned i = 1; i < NumRegs; ++i) {
725 SDValue Part = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Parts[i]);
726 // Shift it to the right position and "or" it in.
727 Part = DAG.getNode(ISD::SHL, dl, NVT, Part,
728 DAG.getConstant(i * RegVT.getSizeInBits(),
729 TLI.getPointerTy()));
730 Res = DAG.getNode(ISD::OR, dl, NVT, Res, Part);
733 // Modified the chain result - switch anything that used the old chain to
735 ReplaceValueWith(SDValue(N, 1), Chain);
740 //===----------------------------------------------------------------------===//
741 // Integer Operand Promotion
742 //===----------------------------------------------------------------------===//
744 /// PromoteIntegerOperand - This method is called when the specified operand of
745 /// the specified node is found to need promotion. At this point, all of the
746 /// result types of the node are known to be legal, but other operands of the
747 /// node may need promotion or expansion as well as the specified one.
748 bool DAGTypeLegalizer::PromoteIntegerOperand(SDNode *N, unsigned OpNo) {
749 DEBUG(dbgs() << "Promote integer operand: "; N->dump(&DAG); dbgs() << "\n");
750 SDValue Res = SDValue();
752 if (CustomLowerNode(N, N->getOperand(OpNo).getValueType(), false))
755 switch (N->getOpcode()) {
758 dbgs() << "PromoteIntegerOperand Op #" << OpNo << ": ";
759 N->dump(&DAG); dbgs() << "\n";
761 llvm_unreachable("Do not know how to promote this operator's operand!");
763 case ISD::ANY_EXTEND: Res = PromoteIntOp_ANY_EXTEND(N); break;
764 case ISD::ATOMIC_STORE:
765 Res = PromoteIntOp_ATOMIC_STORE(cast<AtomicSDNode>(N));
767 case ISD::BITCAST: Res = PromoteIntOp_BITCAST(N); break;
768 case ISD::BR_CC: Res = PromoteIntOp_BR_CC(N, OpNo); break;
769 case ISD::BRCOND: Res = PromoteIntOp_BRCOND(N, OpNo); break;
770 case ISD::BUILD_PAIR: Res = PromoteIntOp_BUILD_PAIR(N); break;
771 case ISD::BUILD_VECTOR: Res = PromoteIntOp_BUILD_VECTOR(N); break;
772 case ISD::CONCAT_VECTORS: Res = PromoteIntOp_CONCAT_VECTORS(N); break;
773 case ISD::EXTRACT_VECTOR_ELT: Res = PromoteIntOp_EXTRACT_VECTOR_ELT(N); break;
774 case ISD::CONVERT_RNDSAT:
775 Res = PromoteIntOp_CONVERT_RNDSAT(N); break;
776 case ISD::INSERT_VECTOR_ELT:
777 Res = PromoteIntOp_INSERT_VECTOR_ELT(N, OpNo);break;
778 case ISD::MEMBARRIER: Res = PromoteIntOp_MEMBARRIER(N); break;
779 case ISD::SCALAR_TO_VECTOR:
780 Res = PromoteIntOp_SCALAR_TO_VECTOR(N); break;
782 case ISD::SELECT: Res = PromoteIntOp_SELECT(N, OpNo); break;
783 case ISD::SELECT_CC: Res = PromoteIntOp_SELECT_CC(N, OpNo); break;
784 case ISD::SETCC: Res = PromoteIntOp_SETCC(N, OpNo); break;
785 case ISD::SIGN_EXTEND: Res = PromoteIntOp_SIGN_EXTEND(N); break;
786 case ISD::SINT_TO_FP: Res = PromoteIntOp_SINT_TO_FP(N); break;
787 case ISD::STORE: Res = PromoteIntOp_STORE(cast<StoreSDNode>(N),
789 case ISD::TRUNCATE: Res = PromoteIntOp_TRUNCATE(N); break;
790 case ISD::FP16_TO_FP32:
791 case ISD::UINT_TO_FP: Res = PromoteIntOp_UINT_TO_FP(N); break;
792 case ISD::ZERO_EXTEND: Res = PromoteIntOp_ZERO_EXTEND(N); break;
798 case ISD::ROTR: Res = PromoteIntOp_Shift(N); break;
801 // If the result is null, the sub-method took care of registering results etc.
802 if (!Res.getNode()) return false;
804 // If the result is N, the sub-method updated N in place. Tell the legalizer
806 if (Res.getNode() == N)
809 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
810 "Invalid operand expansion");
812 ReplaceValueWith(SDValue(N, 0), Res);
816 /// PromoteSetCCOperands - Promote the operands of a comparison. This code is
817 /// shared among BR_CC, SELECT_CC, and SETCC handlers.
818 void DAGTypeLegalizer::PromoteSetCCOperands(SDValue &NewLHS,SDValue &NewRHS,
819 ISD::CondCode CCCode) {
820 // We have to insert explicit sign or zero extends. Note that we could
821 // insert sign extends for ALL conditions, but zero extend is cheaper on
822 // many machines (an AND instead of two shifts), so prefer it.
824 default: llvm_unreachable("Unknown integer comparison!");
831 // ALL of these operations will work if we either sign or zero extend
832 // the operands (including the unsigned comparisons!). Zero extend is
833 // usually a simpler/cheaper operation, so prefer it.
834 NewLHS = ZExtPromotedInteger(NewLHS);
835 NewRHS = ZExtPromotedInteger(NewRHS);
841 NewLHS = SExtPromotedInteger(NewLHS);
842 NewRHS = SExtPromotedInteger(NewRHS);
847 SDValue DAGTypeLegalizer::PromoteIntOp_ANY_EXTEND(SDNode *N) {
848 SDValue Op = GetPromotedInteger(N->getOperand(0));
849 return DAG.getNode(ISD::ANY_EXTEND, N->getDebugLoc(), N->getValueType(0), Op);
852 SDValue DAGTypeLegalizer::PromoteIntOp_ATOMIC_STORE(AtomicSDNode *N) {
853 SDValue Op2 = GetPromotedInteger(N->getOperand(2));
854 return DAG.getAtomic(N->getOpcode(), N->getDebugLoc(), N->getMemoryVT(),
855 N->getChain(), N->getBasePtr(), Op2, N->getMemOperand(),
856 N->getOrdering(), N->getSynchScope());
859 SDValue DAGTypeLegalizer::PromoteIntOp_BITCAST(SDNode *N) {
860 // This should only occur in unusual situations like bitcasting to an
861 // x86_fp80, so just turn it into a store+load
862 return CreateStackStoreLoad(N->getOperand(0), N->getValueType(0));
865 SDValue DAGTypeLegalizer::PromoteIntOp_BR_CC(SDNode *N, unsigned OpNo) {
866 assert(OpNo == 2 && "Don't know how to promote this operand!");
868 SDValue LHS = N->getOperand(2);
869 SDValue RHS = N->getOperand(3);
870 PromoteSetCCOperands(LHS, RHS, cast<CondCodeSDNode>(N->getOperand(1))->get());
872 // The chain (Op#0), CC (#1) and basic block destination (Op#4) are always
874 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0),
875 N->getOperand(1), LHS, RHS, N->getOperand(4)),
879 SDValue DAGTypeLegalizer::PromoteIntOp_BRCOND(SDNode *N, unsigned OpNo) {
880 assert(OpNo == 1 && "only know how to promote condition");
882 // Promote all the way up to the canonical SetCC type.
883 EVT SVT = TLI.getSetCCResultType(MVT::Other);
884 SDValue Cond = PromoteTargetBoolean(N->getOperand(1), SVT);
886 // The chain (Op#0) and basic block destination (Op#2) are always legal types.
887 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0), Cond,
888 N->getOperand(2)), 0);
891 SDValue DAGTypeLegalizer::PromoteIntOp_BUILD_PAIR(SDNode *N) {
892 // Since the result type is legal, the operands must promote to it.
893 EVT OVT = N->getOperand(0).getValueType();
894 SDValue Lo = ZExtPromotedInteger(N->getOperand(0));
895 SDValue Hi = GetPromotedInteger(N->getOperand(1));
896 assert(Lo.getValueType() == N->getValueType(0) && "Operand over promoted?");
897 DebugLoc dl = N->getDebugLoc();
899 Hi = DAG.getNode(ISD::SHL, dl, N->getValueType(0), Hi,
900 DAG.getConstant(OVT.getSizeInBits(), TLI.getPointerTy()));
901 return DAG.getNode(ISD::OR, dl, N->getValueType(0), Lo, Hi);
904 SDValue DAGTypeLegalizer::PromoteIntOp_BUILD_VECTOR(SDNode *N) {
905 // The vector type is legal but the element type is not. This implies
906 // that the vector is a power-of-two in length and that the element
907 // type does not have a strange size (eg: it is not i1).
908 EVT VecVT = N->getValueType(0);
909 unsigned NumElts = VecVT.getVectorNumElements();
910 assert(!(NumElts & 1) && "Legal vector of one illegal element?");
912 // Promote the inserted value. The type does not need to match the
913 // vector element type. Check that any extra bits introduced will be
915 assert(N->getOperand(0).getValueType().getSizeInBits() >=
916 N->getValueType(0).getVectorElementType().getSizeInBits() &&
917 "Type of inserted value narrower than vector element type!");
919 SmallVector<SDValue, 16> NewOps;
920 for (unsigned i = 0; i < NumElts; ++i)
921 NewOps.push_back(GetPromotedInteger(N->getOperand(i)));
923 return SDValue(DAG.UpdateNodeOperands(N, &NewOps[0], NumElts), 0);
926 SDValue DAGTypeLegalizer::PromoteIntOp_CONVERT_RNDSAT(SDNode *N) {
927 ISD::CvtCode CvtCode = cast<CvtRndSatSDNode>(N)->getCvtCode();
928 assert ((CvtCode == ISD::CVT_SS || CvtCode == ISD::CVT_SU ||
929 CvtCode == ISD::CVT_US || CvtCode == ISD::CVT_UU ||
930 CvtCode == ISD::CVT_FS || CvtCode == ISD::CVT_FU) &&
931 "can only promote integer arguments");
932 SDValue InOp = GetPromotedInteger(N->getOperand(0));
933 return DAG.getConvertRndSat(N->getValueType(0), N->getDebugLoc(), InOp,
934 N->getOperand(1), N->getOperand(2),
935 N->getOperand(3), N->getOperand(4), CvtCode);
938 SDValue DAGTypeLegalizer::PromoteIntOp_INSERT_VECTOR_ELT(SDNode *N,
941 // Promote the inserted value. This is valid because the type does not
942 // have to match the vector element type.
944 // Check that any extra bits introduced will be truncated away.
945 assert(N->getOperand(1).getValueType().getSizeInBits() >=
946 N->getValueType(0).getVectorElementType().getSizeInBits() &&
947 "Type of inserted value narrower than vector element type!");
948 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0),
949 GetPromotedInteger(N->getOperand(1)),
954 assert(OpNo == 2 && "Different operand and result vector types?");
956 // Promote the index.
957 SDValue Idx = ZExtPromotedInteger(N->getOperand(2));
958 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0),
959 N->getOperand(1), Idx), 0);
962 SDValue DAGTypeLegalizer::PromoteIntOp_MEMBARRIER(SDNode *N) {
964 DebugLoc dl = N->getDebugLoc();
965 NewOps[0] = N->getOperand(0);
966 for (unsigned i = 1; i < array_lengthof(NewOps); ++i) {
967 SDValue Flag = GetPromotedInteger(N->getOperand(i));
968 NewOps[i] = DAG.getZeroExtendInReg(Flag, dl, MVT::i1);
970 return SDValue(DAG.UpdateNodeOperands(N, NewOps, array_lengthof(NewOps)), 0);
973 SDValue DAGTypeLegalizer::PromoteIntOp_SCALAR_TO_VECTOR(SDNode *N) {
974 // Integer SCALAR_TO_VECTOR operands are implicitly truncated, so just promote
975 // the operand in place.
976 return SDValue(DAG.UpdateNodeOperands(N,
977 GetPromotedInteger(N->getOperand(0))), 0);
980 SDValue DAGTypeLegalizer::PromoteIntOp_SELECT(SDNode *N, unsigned OpNo) {
981 assert(OpNo == 0 && "Only know how to promote the condition!");
982 SDValue Cond = N->getOperand(0);
983 EVT OpTy = N->getOperand(1).getValueType();
985 // Promote all the way up to the canonical SetCC type.
986 EVT SVT = TLI.getSetCCResultType(N->getOpcode() == ISD::SELECT ?
987 OpTy.getScalarType() : OpTy);
988 Cond = PromoteTargetBoolean(Cond, SVT);
990 return SDValue(DAG.UpdateNodeOperands(N, Cond, N->getOperand(1),
991 N->getOperand(2)), 0);
994 SDValue DAGTypeLegalizer::PromoteIntOp_SELECT_CC(SDNode *N, unsigned OpNo) {
995 assert(OpNo == 0 && "Don't know how to promote this operand!");
997 SDValue LHS = N->getOperand(0);
998 SDValue RHS = N->getOperand(1);
999 PromoteSetCCOperands(LHS, RHS, cast<CondCodeSDNode>(N->getOperand(4))->get());
1001 // The CC (#4) and the possible return values (#2 and #3) have legal types.
1002 return SDValue(DAG.UpdateNodeOperands(N, LHS, RHS, N->getOperand(2),
1003 N->getOperand(3), N->getOperand(4)), 0);
1006 SDValue DAGTypeLegalizer::PromoteIntOp_SETCC(SDNode *N, unsigned OpNo) {
1007 assert(OpNo == 0 && "Don't know how to promote this operand!");
1009 SDValue LHS = N->getOperand(0);
1010 SDValue RHS = N->getOperand(1);
1011 PromoteSetCCOperands(LHS, RHS, cast<CondCodeSDNode>(N->getOperand(2))->get());
1013 // The CC (#2) is always legal.
1014 return SDValue(DAG.UpdateNodeOperands(N, LHS, RHS, N->getOperand(2)), 0);
1017 SDValue DAGTypeLegalizer::PromoteIntOp_Shift(SDNode *N) {
1018 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0),
1019 ZExtPromotedInteger(N->getOperand(1))), 0);
1022 SDValue DAGTypeLegalizer::PromoteIntOp_SIGN_EXTEND(SDNode *N) {
1023 SDValue Op = GetPromotedInteger(N->getOperand(0));
1024 DebugLoc dl = N->getDebugLoc();
1025 Op = DAG.getNode(ISD::ANY_EXTEND, dl, N->getValueType(0), Op);
1026 return DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Op.getValueType(),
1027 Op, DAG.getValueType(N->getOperand(0).getValueType()));
1030 SDValue DAGTypeLegalizer::PromoteIntOp_SINT_TO_FP(SDNode *N) {
1031 return SDValue(DAG.UpdateNodeOperands(N,
1032 SExtPromotedInteger(N->getOperand(0))), 0);
1035 SDValue DAGTypeLegalizer::PromoteIntOp_STORE(StoreSDNode *N, unsigned OpNo){
1036 assert(ISD::isUNINDEXEDStore(N) && "Indexed store during type legalization!");
1037 SDValue Ch = N->getChain(), Ptr = N->getBasePtr();
1038 unsigned Alignment = N->getAlignment();
1039 bool isVolatile = N->isVolatile();
1040 bool isNonTemporal = N->isNonTemporal();
1041 DebugLoc dl = N->getDebugLoc();
1043 SDValue Val = GetPromotedInteger(N->getValue()); // Get promoted value.
1045 // Truncate the value and store the result.
1046 return DAG.getTruncStore(Ch, dl, Val, Ptr, N->getPointerInfo(),
1048 isVolatile, isNonTemporal, Alignment);
1051 SDValue DAGTypeLegalizer::PromoteIntOp_TRUNCATE(SDNode *N) {
1052 SDValue Op = GetPromotedInteger(N->getOperand(0));
1053 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), N->getValueType(0), Op);
1056 SDValue DAGTypeLegalizer::PromoteIntOp_UINT_TO_FP(SDNode *N) {
1057 return SDValue(DAG.UpdateNodeOperands(N,
1058 ZExtPromotedInteger(N->getOperand(0))), 0);
1061 SDValue DAGTypeLegalizer::PromoteIntOp_ZERO_EXTEND(SDNode *N) {
1062 DebugLoc dl = N->getDebugLoc();
1063 SDValue Op = GetPromotedInteger(N->getOperand(0));
1064 Op = DAG.getNode(ISD::ANY_EXTEND, dl, N->getValueType(0), Op);
1065 return DAG.getZeroExtendInReg(Op, dl,
1066 N->getOperand(0).getValueType().getScalarType());
1070 //===----------------------------------------------------------------------===//
1071 // Integer Result Expansion
1072 //===----------------------------------------------------------------------===//
1074 /// ExpandIntegerResult - This method is called when the specified result of the
1075 /// specified node is found to need expansion. At this point, the node may also
1076 /// have invalid operands or may have other results that need promotion, we just
1077 /// know that (at least) one result needs expansion.
1078 void DAGTypeLegalizer::ExpandIntegerResult(SDNode *N, unsigned ResNo) {
1079 DEBUG(dbgs() << "Expand integer result: "; N->dump(&DAG); dbgs() << "\n");
1081 Lo = Hi = SDValue();
1083 // See if the target wants to custom expand this node.
1084 if (CustomLowerNode(N, N->getValueType(ResNo), true))
1087 switch (N->getOpcode()) {
1090 dbgs() << "ExpandIntegerResult #" << ResNo << ": ";
1091 N->dump(&DAG); dbgs() << "\n";
1093 llvm_unreachable("Do not know how to expand the result of this operator!");
1095 case ISD::MERGE_VALUES: SplitRes_MERGE_VALUES(N, ResNo, Lo, Hi); break;
1096 case ISD::SELECT: SplitRes_SELECT(N, Lo, Hi); break;
1097 case ISD::SELECT_CC: SplitRes_SELECT_CC(N, Lo, Hi); break;
1098 case ISD::UNDEF: SplitRes_UNDEF(N, Lo, Hi); break;
1100 case ISD::BITCAST: ExpandRes_BITCAST(N, Lo, Hi); break;
1101 case ISD::BUILD_PAIR: ExpandRes_BUILD_PAIR(N, Lo, Hi); break;
1102 case ISD::EXTRACT_ELEMENT: ExpandRes_EXTRACT_ELEMENT(N, Lo, Hi); break;
1103 case ISD::EXTRACT_VECTOR_ELT: ExpandRes_EXTRACT_VECTOR_ELT(N, Lo, Hi); break;
1104 case ISD::VAARG: ExpandRes_VAARG(N, Lo, Hi); break;
1106 case ISD::ANY_EXTEND: ExpandIntRes_ANY_EXTEND(N, Lo, Hi); break;
1107 case ISD::AssertSext: ExpandIntRes_AssertSext(N, Lo, Hi); break;
1108 case ISD::AssertZext: ExpandIntRes_AssertZext(N, Lo, Hi); break;
1109 case ISD::BSWAP: ExpandIntRes_BSWAP(N, Lo, Hi); break;
1110 case ISD::Constant: ExpandIntRes_Constant(N, Lo, Hi); break;
1111 case ISD::CTLZ_ZERO_UNDEF:
1112 case ISD::CTLZ: ExpandIntRes_CTLZ(N, Lo, Hi); break;
1113 case ISD::CTPOP: ExpandIntRes_CTPOP(N, Lo, Hi); break;
1114 case ISD::CTTZ_ZERO_UNDEF:
1115 case ISD::CTTZ: ExpandIntRes_CTTZ(N, Lo, Hi); break;
1116 case ISD::FP_TO_SINT: ExpandIntRes_FP_TO_SINT(N, Lo, Hi); break;
1117 case ISD::FP_TO_UINT: ExpandIntRes_FP_TO_UINT(N, Lo, Hi); break;
1118 case ISD::LOAD: ExpandIntRes_LOAD(cast<LoadSDNode>(N), Lo, Hi); break;
1119 case ISD::MUL: ExpandIntRes_MUL(N, Lo, Hi); break;
1120 case ISD::SDIV: ExpandIntRes_SDIV(N, Lo, Hi); break;
1121 case ISD::SIGN_EXTEND: ExpandIntRes_SIGN_EXTEND(N, Lo, Hi); break;
1122 case ISD::SIGN_EXTEND_INREG: ExpandIntRes_SIGN_EXTEND_INREG(N, Lo, Hi); break;
1123 case ISD::SREM: ExpandIntRes_SREM(N, Lo, Hi); break;
1124 case ISD::TRUNCATE: ExpandIntRes_TRUNCATE(N, Lo, Hi); break;
1125 case ISD::UDIV: ExpandIntRes_UDIV(N, Lo, Hi); break;
1126 case ISD::UREM: ExpandIntRes_UREM(N, Lo, Hi); break;
1127 case ISD::ZERO_EXTEND: ExpandIntRes_ZERO_EXTEND(N, Lo, Hi); break;
1128 case ISD::ATOMIC_LOAD: ExpandIntRes_ATOMIC_LOAD(N, Lo, Hi); break;
1130 case ISD::ATOMIC_LOAD_ADD:
1131 case ISD::ATOMIC_LOAD_SUB:
1132 case ISD::ATOMIC_LOAD_AND:
1133 case ISD::ATOMIC_LOAD_OR:
1134 case ISD::ATOMIC_LOAD_XOR:
1135 case ISD::ATOMIC_LOAD_NAND:
1136 case ISD::ATOMIC_LOAD_MIN:
1137 case ISD::ATOMIC_LOAD_MAX:
1138 case ISD::ATOMIC_LOAD_UMIN:
1139 case ISD::ATOMIC_LOAD_UMAX:
1140 case ISD::ATOMIC_SWAP: {
1141 std::pair<SDValue, SDValue> Tmp = ExpandAtomic(N);
1142 SplitInteger(Tmp.first, Lo, Hi);
1143 ReplaceValueWith(SDValue(N, 1), Tmp.second);
1149 case ISD::XOR: ExpandIntRes_Logical(N, Lo, Hi); break;
1152 case ISD::SUB: ExpandIntRes_ADDSUB(N, Lo, Hi); break;
1155 case ISD::SUBC: ExpandIntRes_ADDSUBC(N, Lo, Hi); break;
1158 case ISD::SUBE: ExpandIntRes_ADDSUBE(N, Lo, Hi); break;
1162 case ISD::SRL: ExpandIntRes_Shift(N, Lo, Hi); break;
1165 case ISD::SSUBO: ExpandIntRes_SADDSUBO(N, Lo, Hi); break;
1167 case ISD::USUBO: ExpandIntRes_UADDSUBO(N, Lo, Hi); break;
1169 case ISD::SMULO: ExpandIntRes_XMULO(N, Lo, Hi); break;
1172 // If Lo/Hi is null, the sub-method took care of registering results etc.
1174 SetExpandedInteger(SDValue(N, ResNo), Lo, Hi);
1177 /// Lower an atomic node to the appropriate builtin call.
1178 std::pair <SDValue, SDValue> DAGTypeLegalizer::ExpandAtomic(SDNode *Node) {
1179 unsigned Opc = Node->getOpcode();
1180 MVT VT = cast<AtomicSDNode>(Node)->getMemoryVT().getSimpleVT();
1185 llvm_unreachable("Unhandled atomic intrinsic Expand!");
1186 case ISD::ATOMIC_SWAP:
1187 switch (VT.SimpleTy) {
1188 default: llvm_unreachable("Unexpected value type for atomic!");
1189 case MVT::i8: LC = RTLIB::SYNC_LOCK_TEST_AND_SET_1; break;
1190 case MVT::i16: LC = RTLIB::SYNC_LOCK_TEST_AND_SET_2; break;
1191 case MVT::i32: LC = RTLIB::SYNC_LOCK_TEST_AND_SET_4; break;
1192 case MVT::i64: LC = RTLIB::SYNC_LOCK_TEST_AND_SET_8; break;
1195 case ISD::ATOMIC_CMP_SWAP:
1196 switch (VT.SimpleTy) {
1197 default: llvm_unreachable("Unexpected value type for atomic!");
1198 case MVT::i8: LC = RTLIB::SYNC_VAL_COMPARE_AND_SWAP_1; break;
1199 case MVT::i16: LC = RTLIB::SYNC_VAL_COMPARE_AND_SWAP_2; break;
1200 case MVT::i32: LC = RTLIB::SYNC_VAL_COMPARE_AND_SWAP_4; break;
1201 case MVT::i64: LC = RTLIB::SYNC_VAL_COMPARE_AND_SWAP_8; break;
1204 case ISD::ATOMIC_LOAD_ADD:
1205 switch (VT.SimpleTy) {
1206 default: llvm_unreachable("Unexpected value type for atomic!");
1207 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_ADD_1; break;
1208 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_ADD_2; break;
1209 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_ADD_4; break;
1210 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_ADD_8; break;
1213 case ISD::ATOMIC_LOAD_SUB:
1214 switch (VT.SimpleTy) {
1215 default: llvm_unreachable("Unexpected value type for atomic!");
1216 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_SUB_1; break;
1217 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_SUB_2; break;
1218 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_SUB_4; break;
1219 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_SUB_8; break;
1222 case ISD::ATOMIC_LOAD_AND:
1223 switch (VT.SimpleTy) {
1224 default: llvm_unreachable("Unexpected value type for atomic!");
1225 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_AND_1; break;
1226 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_AND_2; break;
1227 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_AND_4; break;
1228 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_AND_8; break;
1231 case ISD::ATOMIC_LOAD_OR:
1232 switch (VT.SimpleTy) {
1233 default: llvm_unreachable("Unexpected value type for atomic!");
1234 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_OR_1; break;
1235 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_OR_2; break;
1236 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_OR_4; break;
1237 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_OR_8; break;
1240 case ISD::ATOMIC_LOAD_XOR:
1241 switch (VT.SimpleTy) {
1242 default: llvm_unreachable("Unexpected value type for atomic!");
1243 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_XOR_1; break;
1244 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_XOR_2; break;
1245 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_XOR_4; break;
1246 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_XOR_8; break;
1249 case ISD::ATOMIC_LOAD_NAND:
1250 switch (VT.SimpleTy) {
1251 default: llvm_unreachable("Unexpected value type for atomic!");
1252 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_NAND_1; break;
1253 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_NAND_2; break;
1254 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_NAND_4; break;
1255 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_NAND_8; break;
1260 return ExpandChainLibCall(LC, Node, false);
1263 /// ExpandShiftByConstant - N is a shift by a value that needs to be expanded,
1264 /// and the shift amount is a constant 'Amt'. Expand the operation.
1265 void DAGTypeLegalizer::ExpandShiftByConstant(SDNode *N, unsigned Amt,
1266 SDValue &Lo, SDValue &Hi) {
1267 DebugLoc DL = N->getDebugLoc();
1268 // Expand the incoming operand to be shifted, so that we have its parts
1270 GetExpandedInteger(N->getOperand(0), InL, InH);
1272 EVT NVT = InL.getValueType();
1273 unsigned VTBits = N->getValueType(0).getSizeInBits();
1274 unsigned NVTBits = NVT.getSizeInBits();
1275 EVT ShTy = N->getOperand(1).getValueType();
1277 if (N->getOpcode() == ISD::SHL) {
1279 Lo = Hi = DAG.getConstant(0, NVT);
1280 } else if (Amt > NVTBits) {
1281 Lo = DAG.getConstant(0, NVT);
1282 Hi = DAG.getNode(ISD::SHL, DL,
1283 NVT, InL, DAG.getConstant(Amt-NVTBits, ShTy));
1284 } else if (Amt == NVTBits) {
1285 Lo = DAG.getConstant(0, NVT);
1287 } else if (Amt == 1 &&
1288 TLI.isOperationLegalOrCustom(ISD::ADDC,
1289 TLI.getTypeToExpandTo(*DAG.getContext(), NVT))) {
1290 // Emit this X << 1 as X+X.
1291 SDVTList VTList = DAG.getVTList(NVT, MVT::Glue);
1292 SDValue LoOps[2] = { InL, InL };
1293 Lo = DAG.getNode(ISD::ADDC, DL, VTList, LoOps, 2);
1294 SDValue HiOps[3] = { InH, InH, Lo.getValue(1) };
1295 Hi = DAG.getNode(ISD::ADDE, DL, VTList, HiOps, 3);
1297 Lo = DAG.getNode(ISD::SHL, DL, NVT, InL, DAG.getConstant(Amt, ShTy));
1298 Hi = DAG.getNode(ISD::OR, DL, NVT,
1299 DAG.getNode(ISD::SHL, DL, NVT, InH,
1300 DAG.getConstant(Amt, ShTy)),
1301 DAG.getNode(ISD::SRL, DL, NVT, InL,
1302 DAG.getConstant(NVTBits-Amt, ShTy)));
1307 if (N->getOpcode() == ISD::SRL) {
1309 Lo = DAG.getConstant(0, NVT);
1310 Hi = DAG.getConstant(0, NVT);
1311 } else if (Amt > NVTBits) {
1312 Lo = DAG.getNode(ISD::SRL, DL,
1313 NVT, InH, DAG.getConstant(Amt-NVTBits,ShTy));
1314 Hi = DAG.getConstant(0, NVT);
1315 } else if (Amt == NVTBits) {
1317 Hi = DAG.getConstant(0, NVT);
1319 Lo = DAG.getNode(ISD::OR, DL, NVT,
1320 DAG.getNode(ISD::SRL, DL, NVT, InL,
1321 DAG.getConstant(Amt, ShTy)),
1322 DAG.getNode(ISD::SHL, DL, NVT, InH,
1323 DAG.getConstant(NVTBits-Amt, ShTy)));
1324 Hi = DAG.getNode(ISD::SRL, DL, NVT, InH, DAG.getConstant(Amt, ShTy));
1329 assert(N->getOpcode() == ISD::SRA && "Unknown shift!");
1331 Hi = Lo = DAG.getNode(ISD::SRA, DL, NVT, InH,
1332 DAG.getConstant(NVTBits-1, ShTy));
1333 } else if (Amt > NVTBits) {
1334 Lo = DAG.getNode(ISD::SRA, DL, NVT, InH,
1335 DAG.getConstant(Amt-NVTBits, ShTy));
1336 Hi = DAG.getNode(ISD::SRA, DL, NVT, InH,
1337 DAG.getConstant(NVTBits-1, ShTy));
1338 } else if (Amt == NVTBits) {
1340 Hi = DAG.getNode(ISD::SRA, DL, NVT, InH,
1341 DAG.getConstant(NVTBits-1, ShTy));
1343 Lo = DAG.getNode(ISD::OR, DL, NVT,
1344 DAG.getNode(ISD::SRL, DL, NVT, InL,
1345 DAG.getConstant(Amt, ShTy)),
1346 DAG.getNode(ISD::SHL, DL, NVT, InH,
1347 DAG.getConstant(NVTBits-Amt, ShTy)));
1348 Hi = DAG.getNode(ISD::SRA, DL, NVT, InH, DAG.getConstant(Amt, ShTy));
1352 /// ExpandShiftWithKnownAmountBit - Try to determine whether we can simplify
1353 /// this shift based on knowledge of the high bit of the shift amount. If we
1354 /// can tell this, we know that it is >= 32 or < 32, without knowing the actual
1356 bool DAGTypeLegalizer::
1357 ExpandShiftWithKnownAmountBit(SDNode *N, SDValue &Lo, SDValue &Hi) {
1358 SDValue Amt = N->getOperand(1);
1359 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
1360 EVT ShTy = Amt.getValueType();
1361 unsigned ShBits = ShTy.getScalarType().getSizeInBits();
1362 unsigned NVTBits = NVT.getScalarType().getSizeInBits();
1363 assert(isPowerOf2_32(NVTBits) &&
1364 "Expanded integer type size not a power of two!");
1365 DebugLoc dl = N->getDebugLoc();
1367 APInt HighBitMask = APInt::getHighBitsSet(ShBits, ShBits - Log2_32(NVTBits));
1368 APInt KnownZero, KnownOne;
1369 DAG.ComputeMaskedBits(N->getOperand(1), KnownZero, KnownOne);
1371 // If we don't know anything about the high bits, exit.
1372 if (((KnownZero|KnownOne) & HighBitMask) == 0)
1375 // Get the incoming operand to be shifted.
1377 GetExpandedInteger(N->getOperand(0), InL, InH);
1379 // If we know that any of the high bits of the shift amount are one, then we
1380 // can do this as a couple of simple shifts.
1381 if (KnownOne.intersects(HighBitMask)) {
1382 // Mask out the high bit, which we know is set.
1383 Amt = DAG.getNode(ISD::AND, dl, ShTy, Amt,
1384 DAG.getConstant(~HighBitMask, ShTy));
1386 switch (N->getOpcode()) {
1387 default: llvm_unreachable("Unknown shift");
1389 Lo = DAG.getConstant(0, NVT); // Low part is zero.
1390 Hi = DAG.getNode(ISD::SHL, dl, NVT, InL, Amt); // High part from Lo part.
1393 Hi = DAG.getConstant(0, NVT); // Hi part is zero.
1394 Lo = DAG.getNode(ISD::SRL, dl, NVT, InH, Amt); // Lo part from Hi part.
1397 Hi = DAG.getNode(ISD::SRA, dl, NVT, InH, // Sign extend high part.
1398 DAG.getConstant(NVTBits-1, ShTy));
1399 Lo = DAG.getNode(ISD::SRA, dl, NVT, InH, Amt); // Lo part from Hi part.
1404 // If we know that all of the high bits of the shift amount are zero, then we
1405 // can do this as a couple of simple shifts.
1406 if ((KnownZero & HighBitMask) == HighBitMask) {
1407 // Calculate 31-x. 31 is used instead of 32 to avoid creating an undefined
1408 // shift if x is zero. We can use XOR here because x is known to be smaller
1410 SDValue Amt2 = DAG.getNode(ISD::XOR, dl, ShTy, Amt,
1411 DAG.getConstant(NVTBits-1, ShTy));
1414 switch (N->getOpcode()) {
1415 default: llvm_unreachable("Unknown shift");
1416 case ISD::SHL: Op1 = ISD::SHL; Op2 = ISD::SRL; break;
1418 case ISD::SRA: Op1 = ISD::SRL; Op2 = ISD::SHL; break;
1421 // When shifting right the arithmetic for Lo and Hi is swapped.
1422 if (N->getOpcode() != ISD::SHL)
1423 std::swap(InL, InH);
1425 // Use a little trick to get the bits that move from Lo to Hi. First
1426 // shift by one bit.
1427 SDValue Sh1 = DAG.getNode(Op2, dl, NVT, InL, DAG.getConstant(1, ShTy));
1428 // Then compute the remaining shift with amount-1.
1429 SDValue Sh2 = DAG.getNode(Op2, dl, NVT, Sh1, Amt2);
1431 Lo = DAG.getNode(N->getOpcode(), dl, NVT, InL, Amt);
1432 Hi = DAG.getNode(ISD::OR, dl, NVT, DAG.getNode(Op1, dl, NVT, InH, Amt),Sh2);
1434 if (N->getOpcode() != ISD::SHL)
1442 /// ExpandShiftWithUnknownAmountBit - Fully general expansion of integer shift
1444 bool DAGTypeLegalizer::
1445 ExpandShiftWithUnknownAmountBit(SDNode *N, SDValue &Lo, SDValue &Hi) {
1446 SDValue Amt = N->getOperand(1);
1447 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
1448 EVT ShTy = Amt.getValueType();
1449 unsigned NVTBits = NVT.getSizeInBits();
1450 assert(isPowerOf2_32(NVTBits) &&
1451 "Expanded integer type size not a power of two!");
1452 DebugLoc dl = N->getDebugLoc();
1454 // Get the incoming operand to be shifted.
1456 GetExpandedInteger(N->getOperand(0), InL, InH);
1458 SDValue NVBitsNode = DAG.getConstant(NVTBits, ShTy);
1459 SDValue AmtExcess = DAG.getNode(ISD::SUB, dl, ShTy, Amt, NVBitsNode);
1460 SDValue AmtLack = DAG.getNode(ISD::SUB, dl, ShTy, NVBitsNode, Amt);
1461 SDValue isShort = DAG.getSetCC(dl, TLI.getSetCCResultType(ShTy),
1462 Amt, NVBitsNode, ISD::SETULT);
1464 SDValue LoS, HiS, LoL, HiL;
1465 switch (N->getOpcode()) {
1466 default: llvm_unreachable("Unknown shift");
1468 // Short: ShAmt < NVTBits
1469 LoS = DAG.getNode(ISD::SHL, dl, NVT, InL, Amt);
1470 HiS = DAG.getNode(ISD::OR, dl, NVT,
1471 DAG.getNode(ISD::SHL, dl, NVT, InH, Amt),
1472 // FIXME: If Amt is zero, the following shift generates an undefined result
1473 // on some architectures.
1474 DAG.getNode(ISD::SRL, dl, NVT, InL, AmtLack));
1476 // Long: ShAmt >= NVTBits
1477 LoL = DAG.getConstant(0, NVT); // Lo part is zero.
1478 HiL = DAG.getNode(ISD::SHL, dl, NVT, InL, AmtExcess); // Hi from Lo part.
1480 Lo = DAG.getNode(ISD::SELECT, dl, NVT, isShort, LoS, LoL);
1481 Hi = DAG.getNode(ISD::SELECT, dl, NVT, isShort, HiS, HiL);
1484 // Short: ShAmt < NVTBits
1485 HiS = DAG.getNode(ISD::SRL, dl, NVT, InH, Amt);
1486 LoS = DAG.getNode(ISD::OR, dl, NVT,
1487 DAG.getNode(ISD::SRL, dl, NVT, InL, Amt),
1488 // FIXME: If Amt is zero, the following shift generates an undefined result
1489 // on some architectures.
1490 DAG.getNode(ISD::SHL, dl, NVT, InH, AmtLack));
1492 // Long: ShAmt >= NVTBits
1493 HiL = DAG.getConstant(0, NVT); // Hi part is zero.
1494 LoL = DAG.getNode(ISD::SRL, dl, NVT, InH, AmtExcess); // Lo from Hi part.
1496 Lo = DAG.getNode(ISD::SELECT, dl, NVT, isShort, LoS, LoL);
1497 Hi = DAG.getNode(ISD::SELECT, dl, NVT, isShort, HiS, HiL);
1500 // Short: ShAmt < NVTBits
1501 HiS = DAG.getNode(ISD::SRA, dl, NVT, InH, Amt);
1502 LoS = DAG.getNode(ISD::OR, dl, NVT,
1503 DAG.getNode(ISD::SRL, dl, NVT, InL, Amt),
1504 // FIXME: If Amt is zero, the following shift generates an undefined result
1505 // on some architectures.
1506 DAG.getNode(ISD::SHL, dl, NVT, InH, AmtLack));
1508 // Long: ShAmt >= NVTBits
1509 HiL = DAG.getNode(ISD::SRA, dl, NVT, InH, // Sign of Hi part.
1510 DAG.getConstant(NVTBits-1, ShTy));
1511 LoL = DAG.getNode(ISD::SRA, dl, NVT, InH, AmtExcess); // Lo from Hi part.
1513 Lo = DAG.getNode(ISD::SELECT, dl, NVT, isShort, LoS, LoL);
1514 Hi = DAG.getNode(ISD::SELECT, dl, NVT, isShort, HiS, HiL);
1519 void DAGTypeLegalizer::ExpandIntRes_ADDSUB(SDNode *N,
1520 SDValue &Lo, SDValue &Hi) {
1521 DebugLoc dl = N->getDebugLoc();
1522 // Expand the subcomponents.
1523 SDValue LHSL, LHSH, RHSL, RHSH;
1524 GetExpandedInteger(N->getOperand(0), LHSL, LHSH);
1525 GetExpandedInteger(N->getOperand(1), RHSL, RHSH);
1527 EVT NVT = LHSL.getValueType();
1528 SDValue LoOps[2] = { LHSL, RHSL };
1529 SDValue HiOps[3] = { LHSH, RHSH };
1531 // Do not generate ADDC/ADDE or SUBC/SUBE if the target does not support
1532 // them. TODO: Teach operation legalization how to expand unsupported
1533 // ADDC/ADDE/SUBC/SUBE. The problem is that these operations generate
1534 // a carry of type MVT::Glue, but there doesn't seem to be any way to
1535 // generate a value of this type in the expanded code sequence.
1537 TLI.isOperationLegalOrCustom(N->getOpcode() == ISD::ADD ?
1538 ISD::ADDC : ISD::SUBC,
1539 TLI.getTypeToExpandTo(*DAG.getContext(), NVT));
1542 SDVTList VTList = DAG.getVTList(NVT, MVT::Glue);
1543 if (N->getOpcode() == ISD::ADD) {
1544 Lo = DAG.getNode(ISD::ADDC, dl, VTList, LoOps, 2);
1545 HiOps[2] = Lo.getValue(1);
1546 Hi = DAG.getNode(ISD::ADDE, dl, VTList, HiOps, 3);
1548 Lo = DAG.getNode(ISD::SUBC, dl, VTList, LoOps, 2);
1549 HiOps[2] = Lo.getValue(1);
1550 Hi = DAG.getNode(ISD::SUBE, dl, VTList, HiOps, 3);
1555 if (N->getOpcode() == ISD::ADD) {
1556 Lo = DAG.getNode(ISD::ADD, dl, NVT, LoOps, 2);
1557 Hi = DAG.getNode(ISD::ADD, dl, NVT, HiOps, 2);
1558 SDValue Cmp1 = DAG.getSetCC(dl, TLI.getSetCCResultType(NVT), Lo, LoOps[0],
1560 SDValue Carry1 = DAG.getNode(ISD::SELECT, dl, NVT, Cmp1,
1561 DAG.getConstant(1, NVT),
1562 DAG.getConstant(0, NVT));
1563 SDValue Cmp2 = DAG.getSetCC(dl, TLI.getSetCCResultType(NVT), Lo, LoOps[1],
1565 SDValue Carry2 = DAG.getNode(ISD::SELECT, dl, NVT, Cmp2,
1566 DAG.getConstant(1, NVT), Carry1);
1567 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, Carry2);
1569 Lo = DAG.getNode(ISD::SUB, dl, NVT, LoOps, 2);
1570 Hi = DAG.getNode(ISD::SUB, dl, NVT, HiOps, 2);
1572 DAG.getSetCC(dl, TLI.getSetCCResultType(LoOps[0].getValueType()),
1573 LoOps[0], LoOps[1], ISD::SETULT);
1574 SDValue Borrow = DAG.getNode(ISD::SELECT, dl, NVT, Cmp,
1575 DAG.getConstant(1, NVT),
1576 DAG.getConstant(0, NVT));
1577 Hi = DAG.getNode(ISD::SUB, dl, NVT, Hi, Borrow);
1581 void DAGTypeLegalizer::ExpandIntRes_ADDSUBC(SDNode *N,
1582 SDValue &Lo, SDValue &Hi) {
1583 // Expand the subcomponents.
1584 SDValue LHSL, LHSH, RHSL, RHSH;
1585 DebugLoc dl = N->getDebugLoc();
1586 GetExpandedInteger(N->getOperand(0), LHSL, LHSH);
1587 GetExpandedInteger(N->getOperand(1), RHSL, RHSH);
1588 SDVTList VTList = DAG.getVTList(LHSL.getValueType(), MVT::Glue);
1589 SDValue LoOps[2] = { LHSL, RHSL };
1590 SDValue HiOps[3] = { LHSH, RHSH };
1592 if (N->getOpcode() == ISD::ADDC) {
1593 Lo = DAG.getNode(ISD::ADDC, dl, VTList, LoOps, 2);
1594 HiOps[2] = Lo.getValue(1);
1595 Hi = DAG.getNode(ISD::ADDE, dl, VTList, HiOps, 3);
1597 Lo = DAG.getNode(ISD::SUBC, dl, VTList, LoOps, 2);
1598 HiOps[2] = Lo.getValue(1);
1599 Hi = DAG.getNode(ISD::SUBE, dl, VTList, HiOps, 3);
1602 // Legalized the flag result - switch anything that used the old flag to
1604 ReplaceValueWith(SDValue(N, 1), Hi.getValue(1));
1607 void DAGTypeLegalizer::ExpandIntRes_ADDSUBE(SDNode *N,
1608 SDValue &Lo, SDValue &Hi) {
1609 // Expand the subcomponents.
1610 SDValue LHSL, LHSH, RHSL, RHSH;
1611 DebugLoc dl = N->getDebugLoc();
1612 GetExpandedInteger(N->getOperand(0), LHSL, LHSH);
1613 GetExpandedInteger(N->getOperand(1), RHSL, RHSH);
1614 SDVTList VTList = DAG.getVTList(LHSL.getValueType(), MVT::Glue);
1615 SDValue LoOps[3] = { LHSL, RHSL, N->getOperand(2) };
1616 SDValue HiOps[3] = { LHSH, RHSH };
1618 Lo = DAG.getNode(N->getOpcode(), dl, VTList, LoOps, 3);
1619 HiOps[2] = Lo.getValue(1);
1620 Hi = DAG.getNode(N->getOpcode(), dl, VTList, HiOps, 3);
1622 // Legalized the flag result - switch anything that used the old flag to
1624 ReplaceValueWith(SDValue(N, 1), Hi.getValue(1));
1627 void DAGTypeLegalizer::ExpandIntRes_MERGE_VALUES(SDNode *N, unsigned ResNo,
1628 SDValue &Lo, SDValue &Hi) {
1629 SDValue Res = DisintegrateMERGE_VALUES(N, ResNo);
1630 SplitInteger(Res, Lo, Hi);
1633 void DAGTypeLegalizer::ExpandIntRes_ANY_EXTEND(SDNode *N,
1634 SDValue &Lo, SDValue &Hi) {
1635 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
1636 DebugLoc dl = N->getDebugLoc();
1637 SDValue Op = N->getOperand(0);
1638 if (Op.getValueType().bitsLE(NVT)) {
1639 // The low part is any extension of the input (which degenerates to a copy).
1640 Lo = DAG.getNode(ISD::ANY_EXTEND, dl, NVT, Op);
1641 Hi = DAG.getUNDEF(NVT); // The high part is undefined.
1643 // For example, extension of an i48 to an i64. The operand type necessarily
1644 // promotes to the result type, so will end up being expanded too.
1645 assert(getTypeAction(Op.getValueType()) ==
1646 TargetLowering::TypePromoteInteger &&
1647 "Only know how to promote this result!");
1648 SDValue Res = GetPromotedInteger(Op);
1649 assert(Res.getValueType() == N->getValueType(0) &&
1650 "Operand over promoted?");
1651 // Split the promoted operand. This will simplify when it is expanded.
1652 SplitInteger(Res, Lo, Hi);
1656 void DAGTypeLegalizer::ExpandIntRes_AssertSext(SDNode *N,
1657 SDValue &Lo, SDValue &Hi) {
1658 DebugLoc dl = N->getDebugLoc();
1659 GetExpandedInteger(N->getOperand(0), Lo, Hi);
1660 EVT NVT = Lo.getValueType();
1661 EVT EVT = cast<VTSDNode>(N->getOperand(1))->getVT();
1662 unsigned NVTBits = NVT.getSizeInBits();
1663 unsigned EVTBits = EVT.getSizeInBits();
1665 if (NVTBits < EVTBits) {
1666 Hi = DAG.getNode(ISD::AssertSext, dl, NVT, Hi,
1667 DAG.getValueType(EVT::getIntegerVT(*DAG.getContext(),
1668 EVTBits - NVTBits)));
1670 Lo = DAG.getNode(ISD::AssertSext, dl, NVT, Lo, DAG.getValueType(EVT));
1671 // The high part replicates the sign bit of Lo, make it explicit.
1672 Hi = DAG.getNode(ISD::SRA, dl, NVT, Lo,
1673 DAG.getConstant(NVTBits-1, TLI.getPointerTy()));
1677 void DAGTypeLegalizer::ExpandIntRes_AssertZext(SDNode *N,
1678 SDValue &Lo, SDValue &Hi) {
1679 DebugLoc dl = N->getDebugLoc();
1680 GetExpandedInteger(N->getOperand(0), Lo, Hi);
1681 EVT NVT = Lo.getValueType();
1682 EVT EVT = cast<VTSDNode>(N->getOperand(1))->getVT();
1683 unsigned NVTBits = NVT.getSizeInBits();
1684 unsigned EVTBits = EVT.getSizeInBits();
1686 if (NVTBits < EVTBits) {
1687 Hi = DAG.getNode(ISD::AssertZext, dl, NVT, Hi,
1688 DAG.getValueType(EVT::getIntegerVT(*DAG.getContext(),
1689 EVTBits - NVTBits)));
1691 Lo = DAG.getNode(ISD::AssertZext, dl, NVT, Lo, DAG.getValueType(EVT));
1692 // The high part must be zero, make it explicit.
1693 Hi = DAG.getConstant(0, NVT);
1697 void DAGTypeLegalizer::ExpandIntRes_BSWAP(SDNode *N,
1698 SDValue &Lo, SDValue &Hi) {
1699 DebugLoc dl = N->getDebugLoc();
1700 GetExpandedInteger(N->getOperand(0), Hi, Lo); // Note swapped operands.
1701 Lo = DAG.getNode(ISD::BSWAP, dl, Lo.getValueType(), Lo);
1702 Hi = DAG.getNode(ISD::BSWAP, dl, Hi.getValueType(), Hi);
1705 void DAGTypeLegalizer::ExpandIntRes_Constant(SDNode *N,
1706 SDValue &Lo, SDValue &Hi) {
1707 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
1708 unsigned NBitWidth = NVT.getSizeInBits();
1709 const APInt &Cst = cast<ConstantSDNode>(N)->getAPIntValue();
1710 Lo = DAG.getConstant(Cst.trunc(NBitWidth), NVT);
1711 Hi = DAG.getConstant(Cst.lshr(NBitWidth).trunc(NBitWidth), NVT);
1714 void DAGTypeLegalizer::ExpandIntRes_CTLZ(SDNode *N,
1715 SDValue &Lo, SDValue &Hi) {
1716 DebugLoc dl = N->getDebugLoc();
1717 // ctlz (HiLo) -> Hi != 0 ? ctlz(Hi) : (ctlz(Lo)+32)
1718 GetExpandedInteger(N->getOperand(0), Lo, Hi);
1719 EVT NVT = Lo.getValueType();
1721 SDValue HiNotZero = DAG.getSetCC(dl, TLI.getSetCCResultType(NVT), Hi,
1722 DAG.getConstant(0, NVT), ISD::SETNE);
1724 SDValue LoLZ = DAG.getNode(N->getOpcode(), dl, NVT, Lo);
1725 SDValue HiLZ = DAG.getNode(ISD::CTLZ_ZERO_UNDEF, dl, NVT, Hi);
1727 Lo = DAG.getNode(ISD::SELECT, dl, NVT, HiNotZero, HiLZ,
1728 DAG.getNode(ISD::ADD, dl, NVT, LoLZ,
1729 DAG.getConstant(NVT.getSizeInBits(), NVT)));
1730 Hi = DAG.getConstant(0, NVT);
1733 void DAGTypeLegalizer::ExpandIntRes_CTPOP(SDNode *N,
1734 SDValue &Lo, SDValue &Hi) {
1735 DebugLoc dl = N->getDebugLoc();
1736 // ctpop(HiLo) -> ctpop(Hi)+ctpop(Lo)
1737 GetExpandedInteger(N->getOperand(0), Lo, Hi);
1738 EVT NVT = Lo.getValueType();
1739 Lo = DAG.getNode(ISD::ADD, dl, NVT, DAG.getNode(ISD::CTPOP, dl, NVT, Lo),
1740 DAG.getNode(ISD::CTPOP, dl, NVT, Hi));
1741 Hi = DAG.getConstant(0, NVT);
1744 void DAGTypeLegalizer::ExpandIntRes_CTTZ(SDNode *N,
1745 SDValue &Lo, SDValue &Hi) {
1746 DebugLoc dl = N->getDebugLoc();
1747 // cttz (HiLo) -> Lo != 0 ? cttz(Lo) : (cttz(Hi)+32)
1748 GetExpandedInteger(N->getOperand(0), Lo, Hi);
1749 EVT NVT = Lo.getValueType();
1751 SDValue LoNotZero = DAG.getSetCC(dl, TLI.getSetCCResultType(NVT), Lo,
1752 DAG.getConstant(0, NVT), ISD::SETNE);
1754 SDValue LoLZ = DAG.getNode(ISD::CTTZ_ZERO_UNDEF, dl, NVT, Lo);
1755 SDValue HiLZ = DAG.getNode(N->getOpcode(), dl, NVT, Hi);
1757 Lo = DAG.getNode(ISD::SELECT, dl, NVT, LoNotZero, LoLZ,
1758 DAG.getNode(ISD::ADD, dl, NVT, HiLZ,
1759 DAG.getConstant(NVT.getSizeInBits(), NVT)));
1760 Hi = DAG.getConstant(0, NVT);
1763 void DAGTypeLegalizer::ExpandIntRes_FP_TO_SINT(SDNode *N, SDValue &Lo,
1765 DebugLoc dl = N->getDebugLoc();
1766 EVT VT = N->getValueType(0);
1767 SDValue Op = N->getOperand(0);
1768 RTLIB::Libcall LC = RTLIB::getFPTOSINT(Op.getValueType(), VT);
1769 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unexpected fp-to-sint conversion!");
1770 SplitInteger(TLI.makeLibCall(DAG, LC, VT, &Op, 1, true/*irrelevant*/, dl),
1774 void DAGTypeLegalizer::ExpandIntRes_FP_TO_UINT(SDNode *N, SDValue &Lo,
1776 DebugLoc dl = N->getDebugLoc();
1777 EVT VT = N->getValueType(0);
1778 SDValue Op = N->getOperand(0);
1779 RTLIB::Libcall LC = RTLIB::getFPTOUINT(Op.getValueType(), VT);
1780 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unexpected fp-to-uint conversion!");
1781 SplitInteger(TLI.makeLibCall(DAG, LC, VT, &Op, 1, false/*irrelevant*/, dl),
1785 void DAGTypeLegalizer::ExpandIntRes_LOAD(LoadSDNode *N,
1786 SDValue &Lo, SDValue &Hi) {
1787 if (ISD::isNormalLoad(N)) {
1788 ExpandRes_NormalLoad(N, Lo, Hi);
1792 assert(ISD::isUNINDEXEDLoad(N) && "Indexed load during type legalization!");
1794 EVT VT = N->getValueType(0);
1795 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT);
1796 SDValue Ch = N->getChain();
1797 SDValue Ptr = N->getBasePtr();
1798 ISD::LoadExtType ExtType = N->getExtensionType();
1799 unsigned Alignment = N->getAlignment();
1800 bool isVolatile = N->isVolatile();
1801 bool isNonTemporal = N->isNonTemporal();
1802 bool isInvariant = N->isInvariant();
1803 DebugLoc dl = N->getDebugLoc();
1805 assert(NVT.isByteSized() && "Expanded type not byte sized!");
1807 if (N->getMemoryVT().bitsLE(NVT)) {
1808 EVT MemVT = N->getMemoryVT();
1810 Lo = DAG.getExtLoad(ExtType, dl, NVT, Ch, Ptr, N->getPointerInfo(),
1811 MemVT, isVolatile, isNonTemporal, Alignment);
1813 // Remember the chain.
1814 Ch = Lo.getValue(1);
1816 if (ExtType == ISD::SEXTLOAD) {
1817 // The high part is obtained by SRA'ing all but one of the bits of the
1819 unsigned LoSize = Lo.getValueType().getSizeInBits();
1820 Hi = DAG.getNode(ISD::SRA, dl, NVT, Lo,
1821 DAG.getConstant(LoSize-1, TLI.getPointerTy()));
1822 } else if (ExtType == ISD::ZEXTLOAD) {
1823 // The high part is just a zero.
1824 Hi = DAG.getConstant(0, NVT);
1826 assert(ExtType == ISD::EXTLOAD && "Unknown extload!");
1827 // The high part is undefined.
1828 Hi = DAG.getUNDEF(NVT);
1830 } else if (TLI.isLittleEndian()) {
1831 // Little-endian - low bits are at low addresses.
1832 Lo = DAG.getLoad(NVT, dl, Ch, Ptr, N->getPointerInfo(),
1833 isVolatile, isNonTemporal, isInvariant, Alignment);
1835 unsigned ExcessBits =
1836 N->getMemoryVT().getSizeInBits() - NVT.getSizeInBits();
1837 EVT NEVT = EVT::getIntegerVT(*DAG.getContext(), ExcessBits);
1839 // Increment the pointer to the other half.
1840 unsigned IncrementSize = NVT.getSizeInBits()/8;
1841 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
1842 DAG.getIntPtrConstant(IncrementSize));
1843 Hi = DAG.getExtLoad(ExtType, dl, NVT, Ch, Ptr,
1844 N->getPointerInfo().getWithOffset(IncrementSize), NEVT,
1845 isVolatile, isNonTemporal,
1846 MinAlign(Alignment, IncrementSize));
1848 // Build a factor node to remember that this load is independent of the
1850 Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
1853 // Big-endian - high bits are at low addresses. Favor aligned loads at
1854 // the cost of some bit-fiddling.
1855 EVT MemVT = N->getMemoryVT();
1856 unsigned EBytes = MemVT.getStoreSize();
1857 unsigned IncrementSize = NVT.getSizeInBits()/8;
1858 unsigned ExcessBits = (EBytes - IncrementSize)*8;
1860 // Load both the high bits and maybe some of the low bits.
1861 Hi = DAG.getExtLoad(ExtType, dl, NVT, Ch, Ptr, N->getPointerInfo(),
1862 EVT::getIntegerVT(*DAG.getContext(),
1863 MemVT.getSizeInBits() - ExcessBits),
1864 isVolatile, isNonTemporal, Alignment);
1866 // Increment the pointer to the other half.
1867 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
1868 DAG.getIntPtrConstant(IncrementSize));
1869 // Load the rest of the low bits.
1870 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, dl, NVT, Ch, Ptr,
1871 N->getPointerInfo().getWithOffset(IncrementSize),
1872 EVT::getIntegerVT(*DAG.getContext(), ExcessBits),
1873 isVolatile, isNonTemporal,
1874 MinAlign(Alignment, IncrementSize));
1876 // Build a factor node to remember that this load is independent of the
1878 Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
1881 if (ExcessBits < NVT.getSizeInBits()) {
1882 // Transfer low bits from the bottom of Hi to the top of Lo.
1883 Lo = DAG.getNode(ISD::OR, dl, NVT, Lo,
1884 DAG.getNode(ISD::SHL, dl, NVT, Hi,
1885 DAG.getConstant(ExcessBits,
1886 TLI.getPointerTy())));
1887 // Move high bits to the right position in Hi.
1888 Hi = DAG.getNode(ExtType == ISD::SEXTLOAD ? ISD::SRA : ISD::SRL, dl,
1890 DAG.getConstant(NVT.getSizeInBits() - ExcessBits,
1891 TLI.getPointerTy()));
1895 // Legalized the chain result - switch anything that used the old chain to
1897 ReplaceValueWith(SDValue(N, 1), Ch);
1900 void DAGTypeLegalizer::ExpandIntRes_Logical(SDNode *N,
1901 SDValue &Lo, SDValue &Hi) {
1902 DebugLoc dl = N->getDebugLoc();
1903 SDValue LL, LH, RL, RH;
1904 GetExpandedInteger(N->getOperand(0), LL, LH);
1905 GetExpandedInteger(N->getOperand(1), RL, RH);
1906 Lo = DAG.getNode(N->getOpcode(), dl, LL.getValueType(), LL, RL);
1907 Hi = DAG.getNode(N->getOpcode(), dl, LL.getValueType(), LH, RH);
1910 void DAGTypeLegalizer::ExpandIntRes_MUL(SDNode *N,
1911 SDValue &Lo, SDValue &Hi) {
1912 EVT VT = N->getValueType(0);
1913 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT);
1914 DebugLoc dl = N->getDebugLoc();
1916 bool HasMULHS = TLI.isOperationLegalOrCustom(ISD::MULHS, NVT);
1917 bool HasMULHU = TLI.isOperationLegalOrCustom(ISD::MULHU, NVT);
1918 bool HasSMUL_LOHI = TLI.isOperationLegalOrCustom(ISD::SMUL_LOHI, NVT);
1919 bool HasUMUL_LOHI = TLI.isOperationLegalOrCustom(ISD::UMUL_LOHI, NVT);
1920 if (HasMULHU || HasMULHS || HasUMUL_LOHI || HasSMUL_LOHI) {
1921 SDValue LL, LH, RL, RH;
1922 GetExpandedInteger(N->getOperand(0), LL, LH);
1923 GetExpandedInteger(N->getOperand(1), RL, RH);
1924 unsigned OuterBitSize = VT.getSizeInBits();
1925 unsigned InnerBitSize = NVT.getSizeInBits();
1926 unsigned LHSSB = DAG.ComputeNumSignBits(N->getOperand(0));
1927 unsigned RHSSB = DAG.ComputeNumSignBits(N->getOperand(1));
1929 APInt HighMask = APInt::getHighBitsSet(OuterBitSize, InnerBitSize);
1930 if (DAG.MaskedValueIsZero(N->getOperand(0), HighMask) &&
1931 DAG.MaskedValueIsZero(N->getOperand(1), HighMask)) {
1932 // The inputs are both zero-extended.
1934 // We can emit a umul_lohi.
1935 Lo = DAG.getNode(ISD::UMUL_LOHI, dl, DAG.getVTList(NVT, NVT), LL, RL);
1936 Hi = SDValue(Lo.getNode(), 1);
1940 // We can emit a mulhu+mul.
1941 Lo = DAG.getNode(ISD::MUL, dl, NVT, LL, RL);
1942 Hi = DAG.getNode(ISD::MULHU, dl, NVT, LL, RL);
1946 if (LHSSB > InnerBitSize && RHSSB > InnerBitSize) {
1947 // The input values are both sign-extended.
1949 // We can emit a smul_lohi.
1950 Lo = DAG.getNode(ISD::SMUL_LOHI, dl, DAG.getVTList(NVT, NVT), LL, RL);
1951 Hi = SDValue(Lo.getNode(), 1);
1955 // We can emit a mulhs+mul.
1956 Lo = DAG.getNode(ISD::MUL, dl, NVT, LL, RL);
1957 Hi = DAG.getNode(ISD::MULHS, dl, NVT, LL, RL);
1962 // Lo,Hi = umul LHS, RHS.
1963 SDValue UMulLOHI = DAG.getNode(ISD::UMUL_LOHI, dl,
1964 DAG.getVTList(NVT, NVT), LL, RL);
1966 Hi = UMulLOHI.getValue(1);
1967 RH = DAG.getNode(ISD::MUL, dl, NVT, LL, RH);
1968 LH = DAG.getNode(ISD::MUL, dl, NVT, LH, RL);
1969 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, RH);
1970 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, LH);
1974 Lo = DAG.getNode(ISD::MUL, dl, NVT, LL, RL);
1975 Hi = DAG.getNode(ISD::MULHU, dl, NVT, LL, RL);
1976 RH = DAG.getNode(ISD::MUL, dl, NVT, LL, RH);
1977 LH = DAG.getNode(ISD::MUL, dl, NVT, LH, RL);
1978 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, RH);
1979 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, LH);
1984 // If nothing else, we can make a libcall.
1985 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
1987 LC = RTLIB::MUL_I16;
1988 else if (VT == MVT::i32)
1989 LC = RTLIB::MUL_I32;
1990 else if (VT == MVT::i64)
1991 LC = RTLIB::MUL_I64;
1992 else if (VT == MVT::i128)
1993 LC = RTLIB::MUL_I128;
1994 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported MUL!");
1996 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) };
1997 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Ops, 2, true/*irrelevant*/, dl),
2001 void DAGTypeLegalizer::ExpandIntRes_SADDSUBO(SDNode *Node,
2002 SDValue &Lo, SDValue &Hi) {
2003 SDValue LHS = Node->getOperand(0);
2004 SDValue RHS = Node->getOperand(1);
2005 DebugLoc dl = Node->getDebugLoc();
2007 // Expand the result by simply replacing it with the equivalent
2008 // non-overflow-checking operation.
2009 SDValue Sum = DAG.getNode(Node->getOpcode() == ISD::SADDO ?
2010 ISD::ADD : ISD::SUB, dl, LHS.getValueType(),
2012 SplitInteger(Sum, Lo, Hi);
2014 // Compute the overflow.
2016 // LHSSign -> LHS >= 0
2017 // RHSSign -> RHS >= 0
2018 // SumSign -> Sum >= 0
2021 // Overflow -> (LHSSign == RHSSign) && (LHSSign != SumSign)
2023 // Overflow -> (LHSSign != RHSSign) && (LHSSign != SumSign)
2025 EVT OType = Node->getValueType(1);
2026 SDValue Zero = DAG.getConstant(0, LHS.getValueType());
2028 SDValue LHSSign = DAG.getSetCC(dl, OType, LHS, Zero, ISD::SETGE);
2029 SDValue RHSSign = DAG.getSetCC(dl, OType, RHS, Zero, ISD::SETGE);
2030 SDValue SignsMatch = DAG.getSetCC(dl, OType, LHSSign, RHSSign,
2031 Node->getOpcode() == ISD::SADDO ?
2032 ISD::SETEQ : ISD::SETNE);
2034 SDValue SumSign = DAG.getSetCC(dl, OType, Sum, Zero, ISD::SETGE);
2035 SDValue SumSignNE = DAG.getSetCC(dl, OType, LHSSign, SumSign, ISD::SETNE);
2037 SDValue Cmp = DAG.getNode(ISD::AND, dl, OType, SignsMatch, SumSignNE);
2039 // Use the calculated overflow everywhere.
2040 ReplaceValueWith(SDValue(Node, 1), Cmp);
2043 void DAGTypeLegalizer::ExpandIntRes_SDIV(SDNode *N,
2044 SDValue &Lo, SDValue &Hi) {
2045 EVT VT = N->getValueType(0);
2046 DebugLoc dl = N->getDebugLoc();
2048 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
2050 LC = RTLIB::SDIV_I16;
2051 else if (VT == MVT::i32)
2052 LC = RTLIB::SDIV_I32;
2053 else if (VT == MVT::i64)
2054 LC = RTLIB::SDIV_I64;
2055 else if (VT == MVT::i128)
2056 LC = RTLIB::SDIV_I128;
2057 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported SDIV!");
2059 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) };
2060 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Ops, 2, true, dl), Lo, Hi);
2063 void DAGTypeLegalizer::ExpandIntRes_Shift(SDNode *N,
2064 SDValue &Lo, SDValue &Hi) {
2065 EVT VT = N->getValueType(0);
2066 DebugLoc dl = N->getDebugLoc();
2068 // If we can emit an efficient shift operation, do so now. Check to see if
2069 // the RHS is a constant.
2070 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(N->getOperand(1)))
2071 return ExpandShiftByConstant(N, CN->getZExtValue(), Lo, Hi);
2073 // If we can determine that the high bit of the shift is zero or one, even if
2074 // the low bits are variable, emit this shift in an optimized form.
2075 if (ExpandShiftWithKnownAmountBit(N, Lo, Hi))
2078 // If this target supports shift_PARTS, use it. First, map to the _PARTS opc.
2080 if (N->getOpcode() == ISD::SHL) {
2081 PartsOpc = ISD::SHL_PARTS;
2082 } else if (N->getOpcode() == ISD::SRL) {
2083 PartsOpc = ISD::SRL_PARTS;
2085 assert(N->getOpcode() == ISD::SRA && "Unknown shift!");
2086 PartsOpc = ISD::SRA_PARTS;
2089 // Next check to see if the target supports this SHL_PARTS operation or if it
2090 // will custom expand it.
2091 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT);
2092 TargetLowering::LegalizeAction Action = TLI.getOperationAction(PartsOpc, NVT);
2093 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
2094 Action == TargetLowering::Custom) {
2095 // Expand the subcomponents.
2097 GetExpandedInteger(N->getOperand(0), LHSL, LHSH);
2098 EVT VT = LHSL.getValueType();
2100 // If the shift amount operand is coming from a vector legalization it may
2101 // not have the right return type. Fix that first by casting the operand.
2102 SDValue ShiftOp = N->getOperand(1);
2103 MVT ShiftTy = TLI.getShiftAmountTy(VT);
2104 if (ShiftOp.getValueType() != ShiftTy)
2105 ShiftOp = DAG.getZExtOrTrunc(ShiftOp, dl, ShiftTy);
2107 SDValue Ops[] = { LHSL, LHSH, ShiftOp };
2108 Lo = DAG.getNode(PartsOpc, dl, DAG.getVTList(VT, VT), Ops, 3);
2109 Hi = Lo.getValue(1);
2113 // Otherwise, emit a libcall.
2114 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
2116 if (N->getOpcode() == ISD::SHL) {
2117 isSigned = false; /*sign irrelevant*/
2119 LC = RTLIB::SHL_I16;
2120 else if (VT == MVT::i32)
2121 LC = RTLIB::SHL_I32;
2122 else if (VT == MVT::i64)
2123 LC = RTLIB::SHL_I64;
2124 else if (VT == MVT::i128)
2125 LC = RTLIB::SHL_I128;
2126 } else if (N->getOpcode() == ISD::SRL) {
2129 LC = RTLIB::SRL_I16;
2130 else if (VT == MVT::i32)
2131 LC = RTLIB::SRL_I32;
2132 else if (VT == MVT::i64)
2133 LC = RTLIB::SRL_I64;
2134 else if (VT == MVT::i128)
2135 LC = RTLIB::SRL_I128;
2137 assert(N->getOpcode() == ISD::SRA && "Unknown shift!");
2140 LC = RTLIB::SRA_I16;
2141 else if (VT == MVT::i32)
2142 LC = RTLIB::SRA_I32;
2143 else if (VT == MVT::i64)
2144 LC = RTLIB::SRA_I64;
2145 else if (VT == MVT::i128)
2146 LC = RTLIB::SRA_I128;
2149 if (LC != RTLIB::UNKNOWN_LIBCALL && TLI.getLibcallName(LC)) {
2150 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) };
2151 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Ops, 2, isSigned, dl), Lo, Hi);
2155 if (!ExpandShiftWithUnknownAmountBit(N, Lo, Hi))
2156 llvm_unreachable("Unsupported shift!");
2159 void DAGTypeLegalizer::ExpandIntRes_SIGN_EXTEND(SDNode *N,
2160 SDValue &Lo, SDValue &Hi) {
2161 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
2162 DebugLoc dl = N->getDebugLoc();
2163 SDValue Op = N->getOperand(0);
2164 if (Op.getValueType().bitsLE(NVT)) {
2165 // The low part is sign extension of the input (degenerates to a copy).
2166 Lo = DAG.getNode(ISD::SIGN_EXTEND, dl, NVT, N->getOperand(0));
2167 // The high part is obtained by SRA'ing all but one of the bits of low part.
2168 unsigned LoSize = NVT.getSizeInBits();
2169 Hi = DAG.getNode(ISD::SRA, dl, NVT, Lo,
2170 DAG.getConstant(LoSize-1, TLI.getPointerTy()));
2172 // For example, extension of an i48 to an i64. The operand type necessarily
2173 // promotes to the result type, so will end up being expanded too.
2174 assert(getTypeAction(Op.getValueType()) ==
2175 TargetLowering::TypePromoteInteger &&
2176 "Only know how to promote this result!");
2177 SDValue Res = GetPromotedInteger(Op);
2178 assert(Res.getValueType() == N->getValueType(0) &&
2179 "Operand over promoted?");
2180 // Split the promoted operand. This will simplify when it is expanded.
2181 SplitInteger(Res, Lo, Hi);
2182 unsigned ExcessBits =
2183 Op.getValueType().getSizeInBits() - NVT.getSizeInBits();
2184 Hi = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Hi.getValueType(), Hi,
2185 DAG.getValueType(EVT::getIntegerVT(*DAG.getContext(),
2190 void DAGTypeLegalizer::
2191 ExpandIntRes_SIGN_EXTEND_INREG(SDNode *N, SDValue &Lo, SDValue &Hi) {
2192 DebugLoc dl = N->getDebugLoc();
2193 GetExpandedInteger(N->getOperand(0), Lo, Hi);
2194 EVT EVT = cast<VTSDNode>(N->getOperand(1))->getVT();
2196 if (EVT.bitsLE(Lo.getValueType())) {
2197 // sext_inreg the low part if needed.
2198 Lo = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Lo.getValueType(), Lo,
2201 // The high part gets the sign extension from the lo-part. This handles
2202 // things like sextinreg V:i64 from i8.
2203 Hi = DAG.getNode(ISD::SRA, dl, Hi.getValueType(), Lo,
2204 DAG.getConstant(Hi.getValueType().getSizeInBits()-1,
2205 TLI.getPointerTy()));
2207 // For example, extension of an i48 to an i64. Leave the low part alone,
2208 // sext_inreg the high part.
2209 unsigned ExcessBits =
2210 EVT.getSizeInBits() - Lo.getValueType().getSizeInBits();
2211 Hi = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Hi.getValueType(), Hi,
2212 DAG.getValueType(EVT::getIntegerVT(*DAG.getContext(),
2217 void DAGTypeLegalizer::ExpandIntRes_SREM(SDNode *N,
2218 SDValue &Lo, SDValue &Hi) {
2219 EVT VT = N->getValueType(0);
2220 DebugLoc dl = N->getDebugLoc();
2222 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
2224 LC = RTLIB::SREM_I16;
2225 else if (VT == MVT::i32)
2226 LC = RTLIB::SREM_I32;
2227 else if (VT == MVT::i64)
2228 LC = RTLIB::SREM_I64;
2229 else if (VT == MVT::i128)
2230 LC = RTLIB::SREM_I128;
2231 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported SREM!");
2233 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) };
2234 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Ops, 2, true, dl), Lo, Hi);
2237 void DAGTypeLegalizer::ExpandIntRes_TRUNCATE(SDNode *N,
2238 SDValue &Lo, SDValue &Hi) {
2239 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
2240 DebugLoc dl = N->getDebugLoc();
2241 Lo = DAG.getNode(ISD::TRUNCATE, dl, NVT, N->getOperand(0));
2242 Hi = DAG.getNode(ISD::SRL, dl,
2243 N->getOperand(0).getValueType(), N->getOperand(0),
2244 DAG.getConstant(NVT.getSizeInBits(), TLI.getPointerTy()));
2245 Hi = DAG.getNode(ISD::TRUNCATE, dl, NVT, Hi);
2248 void DAGTypeLegalizer::ExpandIntRes_UADDSUBO(SDNode *N,
2249 SDValue &Lo, SDValue &Hi) {
2250 SDValue LHS = N->getOperand(0);
2251 SDValue RHS = N->getOperand(1);
2252 DebugLoc dl = N->getDebugLoc();
2254 // Expand the result by simply replacing it with the equivalent
2255 // non-overflow-checking operation.
2256 SDValue Sum = DAG.getNode(N->getOpcode() == ISD::UADDO ?
2257 ISD::ADD : ISD::SUB, dl, LHS.getValueType(),
2259 SplitInteger(Sum, Lo, Hi);
2261 // Calculate the overflow: addition overflows iff a + b < a, and subtraction
2262 // overflows iff a - b > a.
2263 SDValue Ofl = DAG.getSetCC(dl, N->getValueType(1), Sum, LHS,
2264 N->getOpcode () == ISD::UADDO ?
2265 ISD::SETULT : ISD::SETUGT);
2267 // Use the calculated overflow everywhere.
2268 ReplaceValueWith(SDValue(N, 1), Ofl);
2271 void DAGTypeLegalizer::ExpandIntRes_XMULO(SDNode *N,
2272 SDValue &Lo, SDValue &Hi) {
2273 EVT VT = N->getValueType(0);
2274 DebugLoc dl = N->getDebugLoc();
2276 // A divide for UMULO should be faster than a function call.
2277 if (N->getOpcode() == ISD::UMULO) {
2278 SDValue LHS = N->getOperand(0), RHS = N->getOperand(1);
2280 SDValue MUL = DAG.getNode(ISD::MUL, dl, LHS.getValueType(), LHS, RHS);
2281 SplitInteger(MUL, Lo, Hi);
2283 // A divide for UMULO will be faster than a function call. Select to
2284 // make sure we aren't using 0.
2285 SDValue isZero = DAG.getSetCC(dl, TLI.getSetCCResultType(VT),
2286 RHS, DAG.getConstant(0, VT), ISD::SETEQ);
2287 SDValue NotZero = DAG.getNode(ISD::SELECT, dl, VT, isZero,
2288 DAG.getConstant(1, VT), RHS);
2289 SDValue DIV = DAG.getNode(ISD::UDIV, dl, VT, MUL, NotZero);
2290 SDValue Overflow = DAG.getSetCC(dl, N->getValueType(1), DIV, LHS,
2292 Overflow = DAG.getNode(ISD::SELECT, dl, N->getValueType(1), isZero,
2293 DAG.getConstant(0, N->getValueType(1)),
2295 ReplaceValueWith(SDValue(N, 1), Overflow);
2299 Type *RetTy = VT.getTypeForEVT(*DAG.getContext());
2300 EVT PtrVT = TLI.getPointerTy();
2301 Type *PtrTy = PtrVT.getTypeForEVT(*DAG.getContext());
2303 // Replace this with a libcall that will check overflow.
2304 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
2306 LC = RTLIB::MULO_I32;
2307 else if (VT == MVT::i64)
2308 LC = RTLIB::MULO_I64;
2309 else if (VT == MVT::i128)
2310 LC = RTLIB::MULO_I128;
2311 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported XMULO!");
2313 SDValue Temp = DAG.CreateStackTemporary(PtrVT);
2314 // Temporary for the overflow value, default it to zero.
2315 SDValue Chain = DAG.getStore(DAG.getEntryNode(), dl,
2316 DAG.getConstant(0, PtrVT), Temp,
2317 MachinePointerInfo(), false, false, 0);
2319 TargetLowering::ArgListTy Args;
2320 TargetLowering::ArgListEntry Entry;
2321 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
2322 EVT ArgVT = N->getOperand(i).getValueType();
2323 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
2324 Entry.Node = N->getOperand(i);
2326 Entry.isSExt = true;
2327 Entry.isZExt = false;
2328 Args.push_back(Entry);
2331 // Also pass the address of the overflow check.
2333 Entry.Ty = PtrTy->getPointerTo();
2334 Entry.isSExt = true;
2335 Entry.isZExt = false;
2336 Args.push_back(Entry);
2338 SDValue Func = DAG.getExternalSymbol(TLI.getLibcallName(LC), PtrVT);
2340 CallLoweringInfo CLI(Chain, RetTy, true, false, false, false,
2341 0, TLI.getLibcallCallingConv(LC),
2342 /*isTailCall=*/false,
2343 /*doesNotReturn=*/false, /*isReturnValueUsed=*/true,
2344 Func, Args, DAG, dl);
2345 std::pair<SDValue, SDValue> CallInfo = TLI.LowerCallTo(CLI);
2347 SplitInteger(CallInfo.first, Lo, Hi);
2348 SDValue Temp2 = DAG.getLoad(PtrVT, dl, CallInfo.second, Temp,
2349 MachinePointerInfo(), false, false, false, 0);
2350 SDValue Ofl = DAG.getSetCC(dl, N->getValueType(1), Temp2,
2351 DAG.getConstant(0, PtrVT),
2353 // Use the overflow from the libcall everywhere.
2354 ReplaceValueWith(SDValue(N, 1), Ofl);
2357 void DAGTypeLegalizer::ExpandIntRes_UDIV(SDNode *N,
2358 SDValue &Lo, SDValue &Hi) {
2359 EVT VT = N->getValueType(0);
2360 DebugLoc dl = N->getDebugLoc();
2362 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
2364 LC = RTLIB::UDIV_I16;
2365 else if (VT == MVT::i32)
2366 LC = RTLIB::UDIV_I32;
2367 else if (VT == MVT::i64)
2368 LC = RTLIB::UDIV_I64;
2369 else if (VT == MVT::i128)
2370 LC = RTLIB::UDIV_I128;
2371 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported UDIV!");
2373 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) };
2374 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Ops, 2, false, dl), Lo, Hi);
2377 void DAGTypeLegalizer::ExpandIntRes_UREM(SDNode *N,
2378 SDValue &Lo, SDValue &Hi) {
2379 EVT VT = N->getValueType(0);
2380 DebugLoc dl = N->getDebugLoc();
2382 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
2384 LC = RTLIB::UREM_I16;
2385 else if (VT == MVT::i32)
2386 LC = RTLIB::UREM_I32;
2387 else if (VT == MVT::i64)
2388 LC = RTLIB::UREM_I64;
2389 else if (VT == MVT::i128)
2390 LC = RTLIB::UREM_I128;
2391 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported UREM!");
2393 SDValue Ops[2] = { N->getOperand(0), N->getOperand(1) };
2394 SplitInteger(TLI.makeLibCall(DAG, LC, VT, Ops, 2, false, dl), Lo, Hi);
2397 void DAGTypeLegalizer::ExpandIntRes_ZERO_EXTEND(SDNode *N,
2398 SDValue &Lo, SDValue &Hi) {
2399 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), N->getValueType(0));
2400 DebugLoc dl = N->getDebugLoc();
2401 SDValue Op = N->getOperand(0);
2402 if (Op.getValueType().bitsLE(NVT)) {
2403 // The low part is zero extension of the input (degenerates to a copy).
2404 Lo = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, N->getOperand(0));
2405 Hi = DAG.getConstant(0, NVT); // The high part is just a zero.
2407 // For example, extension of an i48 to an i64. The operand type necessarily
2408 // promotes to the result type, so will end up being expanded too.
2409 assert(getTypeAction(Op.getValueType()) ==
2410 TargetLowering::TypePromoteInteger &&
2411 "Only know how to promote this result!");
2412 SDValue Res = GetPromotedInteger(Op);
2413 assert(Res.getValueType() == N->getValueType(0) &&
2414 "Operand over promoted?");
2415 // Split the promoted operand. This will simplify when it is expanded.
2416 SplitInteger(Res, Lo, Hi);
2417 unsigned ExcessBits =
2418 Op.getValueType().getSizeInBits() - NVT.getSizeInBits();
2419 Hi = DAG.getZeroExtendInReg(Hi, dl,
2420 EVT::getIntegerVT(*DAG.getContext(),
2425 void DAGTypeLegalizer::ExpandIntRes_ATOMIC_LOAD(SDNode *N,
2426 SDValue &Lo, SDValue &Hi) {
2427 DebugLoc dl = N->getDebugLoc();
2428 EVT VT = cast<AtomicSDNode>(N)->getMemoryVT();
2429 SDValue Zero = DAG.getConstant(0, VT);
2430 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_CMP_SWAP, dl, VT,
2432 N->getOperand(1), Zero, Zero,
2433 cast<AtomicSDNode>(N)->getMemOperand(),
2434 cast<AtomicSDNode>(N)->getOrdering(),
2435 cast<AtomicSDNode>(N)->getSynchScope());
2436 ReplaceValueWith(SDValue(N, 0), Swap.getValue(0));
2437 ReplaceValueWith(SDValue(N, 1), Swap.getValue(1));
2440 //===----------------------------------------------------------------------===//
2441 // Integer Operand Expansion
2442 //===----------------------------------------------------------------------===//
2444 /// ExpandIntegerOperand - This method is called when the specified operand of
2445 /// the specified node is found to need expansion. At this point, all of the
2446 /// result types of the node are known to be legal, but other operands of the
2447 /// node may need promotion or expansion as well as the specified one.
2448 bool DAGTypeLegalizer::ExpandIntegerOperand(SDNode *N, unsigned OpNo) {
2449 DEBUG(dbgs() << "Expand integer operand: "; N->dump(&DAG); dbgs() << "\n");
2450 SDValue Res = SDValue();
2452 if (CustomLowerNode(N, N->getOperand(OpNo).getValueType(), false))
2455 switch (N->getOpcode()) {
2458 dbgs() << "ExpandIntegerOperand Op #" << OpNo << ": ";
2459 N->dump(&DAG); dbgs() << "\n";
2461 llvm_unreachable("Do not know how to expand this operator's operand!");
2463 case ISD::BITCAST: Res = ExpandOp_BITCAST(N); break;
2464 case ISD::BR_CC: Res = ExpandIntOp_BR_CC(N); break;
2465 case ISD::BUILD_VECTOR: Res = ExpandOp_BUILD_VECTOR(N); break;
2466 case ISD::EXTRACT_ELEMENT: Res = ExpandOp_EXTRACT_ELEMENT(N); break;
2467 case ISD::INSERT_VECTOR_ELT: Res = ExpandOp_INSERT_VECTOR_ELT(N); break;
2468 case ISD::SCALAR_TO_VECTOR: Res = ExpandOp_SCALAR_TO_VECTOR(N); break;
2469 case ISD::SELECT_CC: Res = ExpandIntOp_SELECT_CC(N); break;
2470 case ISD::SETCC: Res = ExpandIntOp_SETCC(N); break;
2471 case ISD::SINT_TO_FP: Res = ExpandIntOp_SINT_TO_FP(N); break;
2472 case ISD::STORE: Res = ExpandIntOp_STORE(cast<StoreSDNode>(N), OpNo); break;
2473 case ISD::TRUNCATE: Res = ExpandIntOp_TRUNCATE(N); break;
2474 case ISD::UINT_TO_FP: Res = ExpandIntOp_UINT_TO_FP(N); break;
2480 case ISD::ROTR: Res = ExpandIntOp_Shift(N); break;
2481 case ISD::RETURNADDR:
2482 case ISD::FRAMEADDR: Res = ExpandIntOp_RETURNADDR(N); break;
2484 case ISD::ATOMIC_STORE: Res = ExpandIntOp_ATOMIC_STORE(N); break;
2487 // If the result is null, the sub-method took care of registering results etc.
2488 if (!Res.getNode()) return false;
2490 // If the result is N, the sub-method updated N in place. Tell the legalizer
2492 if (Res.getNode() == N)
2495 assert(Res.getValueType() == N->getValueType(0) && N->getNumValues() == 1 &&
2496 "Invalid operand expansion");
2498 ReplaceValueWith(SDValue(N, 0), Res);
2502 /// IntegerExpandSetCCOperands - Expand the operands of a comparison. This code
2503 /// is shared among BR_CC, SELECT_CC, and SETCC handlers.
2504 void DAGTypeLegalizer::IntegerExpandSetCCOperands(SDValue &NewLHS,
2506 ISD::CondCode &CCCode,
2508 SDValue LHSLo, LHSHi, RHSLo, RHSHi;
2509 GetExpandedInteger(NewLHS, LHSLo, LHSHi);
2510 GetExpandedInteger(NewRHS, RHSLo, RHSHi);
2512 if (CCCode == ISD::SETEQ || CCCode == ISD::SETNE) {
2513 if (RHSLo == RHSHi) {
2514 if (ConstantSDNode *RHSCST = dyn_cast<ConstantSDNode>(RHSLo)) {
2515 if (RHSCST->isAllOnesValue()) {
2516 // Equality comparison to -1.
2517 NewLHS = DAG.getNode(ISD::AND, dl,
2518 LHSLo.getValueType(), LHSLo, LHSHi);
2525 NewLHS = DAG.getNode(ISD::XOR, dl, LHSLo.getValueType(), LHSLo, RHSLo);
2526 NewRHS = DAG.getNode(ISD::XOR, dl, LHSLo.getValueType(), LHSHi, RHSHi);
2527 NewLHS = DAG.getNode(ISD::OR, dl, NewLHS.getValueType(), NewLHS, NewRHS);
2528 NewRHS = DAG.getConstant(0, NewLHS.getValueType());
2532 // If this is a comparison of the sign bit, just look at the top part.
2534 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(NewRHS))
2535 if ((CCCode == ISD::SETLT && CST->isNullValue()) || // X < 0
2536 (CCCode == ISD::SETGT && CST->isAllOnesValue())) { // X > -1
2542 // FIXME: This generated code sucks.
2543 ISD::CondCode LowCC;
2545 default: llvm_unreachable("Unknown integer setcc!");
2547 case ISD::SETULT: LowCC = ISD::SETULT; break;
2549 case ISD::SETUGT: LowCC = ISD::SETUGT; break;
2551 case ISD::SETULE: LowCC = ISD::SETULE; break;
2553 case ISD::SETUGE: LowCC = ISD::SETUGE; break;
2556 // Tmp1 = lo(op1) < lo(op2) // Always unsigned comparison
2557 // Tmp2 = hi(op1) < hi(op2) // Signedness depends on operands
2558 // dest = hi(op1) == hi(op2) ? Tmp1 : Tmp2;
2560 // NOTE: on targets without efficient SELECT of bools, we can always use
2561 // this identity: (B1 ? B2 : B3) --> (B1 & B2)|(!B1&B3)
2562 TargetLowering::DAGCombinerInfo DagCombineInfo(DAG, AfterLegalizeTypes, true, NULL);
2564 Tmp1 = TLI.SimplifySetCC(TLI.getSetCCResultType(LHSLo.getValueType()),
2565 LHSLo, RHSLo, LowCC, false, DagCombineInfo, dl);
2566 if (!Tmp1.getNode())
2567 Tmp1 = DAG.getSetCC(dl, TLI.getSetCCResultType(LHSLo.getValueType()),
2568 LHSLo, RHSLo, LowCC);
2569 Tmp2 = TLI.SimplifySetCC(TLI.getSetCCResultType(LHSHi.getValueType()),
2570 LHSHi, RHSHi, CCCode, false, DagCombineInfo, dl);
2571 if (!Tmp2.getNode())
2572 Tmp2 = DAG.getNode(ISD::SETCC, dl,
2573 TLI.getSetCCResultType(LHSHi.getValueType()),
2574 LHSHi, RHSHi, DAG.getCondCode(CCCode));
2576 ConstantSDNode *Tmp1C = dyn_cast<ConstantSDNode>(Tmp1.getNode());
2577 ConstantSDNode *Tmp2C = dyn_cast<ConstantSDNode>(Tmp2.getNode());
2578 if ((Tmp1C && Tmp1C->isNullValue()) ||
2579 (Tmp2C && Tmp2C->isNullValue() &&
2580 (CCCode == ISD::SETLE || CCCode == ISD::SETGE ||
2581 CCCode == ISD::SETUGE || CCCode == ISD::SETULE)) ||
2582 (Tmp2C && Tmp2C->getAPIntValue() == 1 &&
2583 (CCCode == ISD::SETLT || CCCode == ISD::SETGT ||
2584 CCCode == ISD::SETUGT || CCCode == ISD::SETULT))) {
2585 // low part is known false, returns high part.
2586 // For LE / GE, if high part is known false, ignore the low part.
2587 // For LT / GT, if high part is known true, ignore the low part.
2593 NewLHS = TLI.SimplifySetCC(TLI.getSetCCResultType(LHSHi.getValueType()),
2594 LHSHi, RHSHi, ISD::SETEQ, false,
2595 DagCombineInfo, dl);
2596 if (!NewLHS.getNode())
2597 NewLHS = DAG.getSetCC(dl, TLI.getSetCCResultType(LHSHi.getValueType()),
2598 LHSHi, RHSHi, ISD::SETEQ);
2599 NewLHS = DAG.getNode(ISD::SELECT, dl, Tmp1.getValueType(),
2600 NewLHS, Tmp1, Tmp2);
2604 SDValue DAGTypeLegalizer::ExpandIntOp_BR_CC(SDNode *N) {
2605 SDValue NewLHS = N->getOperand(2), NewRHS = N->getOperand(3);
2606 ISD::CondCode CCCode = cast<CondCodeSDNode>(N->getOperand(1))->get();
2607 IntegerExpandSetCCOperands(NewLHS, NewRHS, CCCode, N->getDebugLoc());
2609 // If ExpandSetCCOperands returned a scalar, we need to compare the result
2610 // against zero to select between true and false values.
2611 if (NewRHS.getNode() == 0) {
2612 NewRHS = DAG.getConstant(0, NewLHS.getValueType());
2613 CCCode = ISD::SETNE;
2616 // Update N to have the operands specified.
2617 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0),
2618 DAG.getCondCode(CCCode), NewLHS, NewRHS,
2619 N->getOperand(4)), 0);
2622 SDValue DAGTypeLegalizer::ExpandIntOp_SELECT_CC(SDNode *N) {
2623 SDValue NewLHS = N->getOperand(0), NewRHS = N->getOperand(1);
2624 ISD::CondCode CCCode = cast<CondCodeSDNode>(N->getOperand(4))->get();
2625 IntegerExpandSetCCOperands(NewLHS, NewRHS, CCCode, N->getDebugLoc());
2627 // If ExpandSetCCOperands returned a scalar, we need to compare the result
2628 // against zero to select between true and false values.
2629 if (NewRHS.getNode() == 0) {
2630 NewRHS = DAG.getConstant(0, NewLHS.getValueType());
2631 CCCode = ISD::SETNE;
2634 // Update N to have the operands specified.
2635 return SDValue(DAG.UpdateNodeOperands(N, NewLHS, NewRHS,
2636 N->getOperand(2), N->getOperand(3),
2637 DAG.getCondCode(CCCode)), 0);
2640 SDValue DAGTypeLegalizer::ExpandIntOp_SETCC(SDNode *N) {
2641 SDValue NewLHS = N->getOperand(0), NewRHS = N->getOperand(1);
2642 ISD::CondCode CCCode = cast<CondCodeSDNode>(N->getOperand(2))->get();
2643 IntegerExpandSetCCOperands(NewLHS, NewRHS, CCCode, N->getDebugLoc());
2645 // If ExpandSetCCOperands returned a scalar, use it.
2646 if (NewRHS.getNode() == 0) {
2647 assert(NewLHS.getValueType() == N->getValueType(0) &&
2648 "Unexpected setcc expansion!");
2652 // Otherwise, update N to have the operands specified.
2653 return SDValue(DAG.UpdateNodeOperands(N, NewLHS, NewRHS,
2654 DAG.getCondCode(CCCode)), 0);
2657 SDValue DAGTypeLegalizer::ExpandIntOp_Shift(SDNode *N) {
2658 // The value being shifted is legal, but the shift amount is too big.
2659 // It follows that either the result of the shift is undefined, or the
2660 // upper half of the shift amount is zero. Just use the lower half.
2662 GetExpandedInteger(N->getOperand(1), Lo, Hi);
2663 return SDValue(DAG.UpdateNodeOperands(N, N->getOperand(0), Lo), 0);
2666 SDValue DAGTypeLegalizer::ExpandIntOp_RETURNADDR(SDNode *N) {
2667 // The argument of RETURNADDR / FRAMEADDR builtin is 32 bit contant. This
2668 // surely makes pretty nice problems on 8/16 bit targets. Just truncate this
2669 // constant to valid type.
2671 GetExpandedInteger(N->getOperand(0), Lo, Hi);
2672 return SDValue(DAG.UpdateNodeOperands(N, Lo), 0);
2675 SDValue DAGTypeLegalizer::ExpandIntOp_SINT_TO_FP(SDNode *N) {
2676 SDValue Op = N->getOperand(0);
2677 EVT DstVT = N->getValueType(0);
2678 RTLIB::Libcall LC = RTLIB::getSINTTOFP(Op.getValueType(), DstVT);
2679 assert(LC != RTLIB::UNKNOWN_LIBCALL &&
2680 "Don't know how to expand this SINT_TO_FP!");
2681 return TLI.makeLibCall(DAG, LC, DstVT, &Op, 1, true, N->getDebugLoc());
2684 SDValue DAGTypeLegalizer::ExpandIntOp_STORE(StoreSDNode *N, unsigned OpNo) {
2685 if (ISD::isNormalStore(N))
2686 return ExpandOp_NormalStore(N, OpNo);
2688 assert(ISD::isUNINDEXEDStore(N) && "Indexed store during type legalization!");
2689 assert(OpNo == 1 && "Can only expand the stored value so far");
2691 EVT VT = N->getOperand(1).getValueType();
2692 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT);
2693 SDValue Ch = N->getChain();
2694 SDValue Ptr = N->getBasePtr();
2695 unsigned Alignment = N->getAlignment();
2696 bool isVolatile = N->isVolatile();
2697 bool isNonTemporal = N->isNonTemporal();
2698 DebugLoc dl = N->getDebugLoc();
2701 assert(NVT.isByteSized() && "Expanded type not byte sized!");
2703 if (N->getMemoryVT().bitsLE(NVT)) {
2704 GetExpandedInteger(N->getValue(), Lo, Hi);
2705 return DAG.getTruncStore(Ch, dl, Lo, Ptr, N->getPointerInfo(),
2706 N->getMemoryVT(), isVolatile, isNonTemporal,
2710 if (TLI.isLittleEndian()) {
2711 // Little-endian - low bits are at low addresses.
2712 GetExpandedInteger(N->getValue(), Lo, Hi);
2714 Lo = DAG.getStore(Ch, dl, Lo, Ptr, N->getPointerInfo(),
2715 isVolatile, isNonTemporal, Alignment);
2717 unsigned ExcessBits =
2718 N->getMemoryVT().getSizeInBits() - NVT.getSizeInBits();
2719 EVT NEVT = EVT::getIntegerVT(*DAG.getContext(), ExcessBits);
2721 // Increment the pointer to the other half.
2722 unsigned IncrementSize = NVT.getSizeInBits()/8;
2723 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
2724 DAG.getIntPtrConstant(IncrementSize));
2725 Hi = DAG.getTruncStore(Ch, dl, Hi, Ptr,
2726 N->getPointerInfo().getWithOffset(IncrementSize),
2727 NEVT, isVolatile, isNonTemporal,
2728 MinAlign(Alignment, IncrementSize));
2729 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo, Hi);
2732 // Big-endian - high bits are at low addresses. Favor aligned stores at
2733 // the cost of some bit-fiddling.
2734 GetExpandedInteger(N->getValue(), Lo, Hi);
2736 EVT ExtVT = N->getMemoryVT();
2737 unsigned EBytes = ExtVT.getStoreSize();
2738 unsigned IncrementSize = NVT.getSizeInBits()/8;
2739 unsigned ExcessBits = (EBytes - IncrementSize)*8;
2740 EVT HiVT = EVT::getIntegerVT(*DAG.getContext(),
2741 ExtVT.getSizeInBits() - ExcessBits);
2743 if (ExcessBits < NVT.getSizeInBits()) {
2744 // Transfer high bits from the top of Lo to the bottom of Hi.
2745 Hi = DAG.getNode(ISD::SHL, dl, NVT, Hi,
2746 DAG.getConstant(NVT.getSizeInBits() - ExcessBits,
2747 TLI.getPointerTy()));
2748 Hi = DAG.getNode(ISD::OR, dl, NVT, Hi,
2749 DAG.getNode(ISD::SRL, dl, NVT, Lo,
2750 DAG.getConstant(ExcessBits,
2751 TLI.getPointerTy())));
2754 // Store both the high bits and maybe some of the low bits.
2755 Hi = DAG.getTruncStore(Ch, dl, Hi, Ptr, N->getPointerInfo(),
2756 HiVT, isVolatile, isNonTemporal, Alignment);
2758 // Increment the pointer to the other half.
2759 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
2760 DAG.getIntPtrConstant(IncrementSize));
2761 // Store the lowest ExcessBits bits in the second half.
2762 Lo = DAG.getTruncStore(Ch, dl, Lo, Ptr,
2763 N->getPointerInfo().getWithOffset(IncrementSize),
2764 EVT::getIntegerVT(*DAG.getContext(), ExcessBits),
2765 isVolatile, isNonTemporal,
2766 MinAlign(Alignment, IncrementSize));
2767 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo, Hi);
2770 SDValue DAGTypeLegalizer::ExpandIntOp_TRUNCATE(SDNode *N) {
2772 GetExpandedInteger(N->getOperand(0), InL, InH);
2773 // Just truncate the low part of the source.
2774 return DAG.getNode(ISD::TRUNCATE, N->getDebugLoc(), N->getValueType(0), InL);
2777 SDValue DAGTypeLegalizer::ExpandIntOp_UINT_TO_FP(SDNode *N) {
2778 SDValue Op = N->getOperand(0);
2779 EVT SrcVT = Op.getValueType();
2780 EVT DstVT = N->getValueType(0);
2781 DebugLoc dl = N->getDebugLoc();
2783 // The following optimization is valid only if every value in SrcVT (when
2784 // treated as signed) is representable in DstVT. Check that the mantissa
2785 // size of DstVT is >= than the number of bits in SrcVT -1.
2786 const fltSemantics &sem = DAG.EVTToAPFloatSemantics(DstVT);
2787 if (APFloat::semanticsPrecision(sem) >= SrcVT.getSizeInBits()-1 &&
2788 TLI.getOperationAction(ISD::SINT_TO_FP, SrcVT) == TargetLowering::Custom){
2789 // Do a signed conversion then adjust the result.
2790 SDValue SignedConv = DAG.getNode(ISD::SINT_TO_FP, dl, DstVT, Op);
2791 SignedConv = TLI.LowerOperation(SignedConv, DAG);
2793 // The result of the signed conversion needs adjusting if the 'sign bit' of
2794 // the incoming integer was set. To handle this, we dynamically test to see
2795 // if it is set, and, if so, add a fudge factor.
2797 const uint64_t F32TwoE32 = 0x4F800000ULL;
2798 const uint64_t F32TwoE64 = 0x5F800000ULL;
2799 const uint64_t F32TwoE128 = 0x7F800000ULL;
2802 if (SrcVT == MVT::i32)
2803 FF = APInt(32, F32TwoE32);
2804 else if (SrcVT == MVT::i64)
2805 FF = APInt(32, F32TwoE64);
2806 else if (SrcVT == MVT::i128)
2807 FF = APInt(32, F32TwoE128);
2809 llvm_unreachable("Unsupported UINT_TO_FP!");
2811 // Check whether the sign bit is set.
2813 GetExpandedInteger(Op, Lo, Hi);
2814 SDValue SignSet = DAG.getSetCC(dl,
2815 TLI.getSetCCResultType(Hi.getValueType()),
2816 Hi, DAG.getConstant(0, Hi.getValueType()),
2819 // Build a 64 bit pair (0, FF) in the constant pool, with FF in the lo bits.
2820 SDValue FudgePtr = DAG.getConstantPool(
2821 ConstantInt::get(*DAG.getContext(), FF.zext(64)),
2822 TLI.getPointerTy());
2824 // Get a pointer to FF if the sign bit was set, or to 0 otherwise.
2825 SDValue Zero = DAG.getIntPtrConstant(0);
2826 SDValue Four = DAG.getIntPtrConstant(4);
2827 if (TLI.isBigEndian()) std::swap(Zero, Four);
2828 SDValue Offset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(), SignSet,
2830 unsigned Alignment = cast<ConstantPoolSDNode>(FudgePtr)->getAlignment();
2831 FudgePtr = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(), FudgePtr, Offset);
2832 Alignment = std::min(Alignment, 4u);
2834 // Load the value out, extending it from f32 to the destination float type.
2835 // FIXME: Avoid the extend by constructing the right constant pool?
2836 SDValue Fudge = DAG.getExtLoad(ISD::EXTLOAD, dl, DstVT, DAG.getEntryNode(),
2838 MachinePointerInfo::getConstantPool(),
2840 false, false, Alignment);
2841 return DAG.getNode(ISD::FADD, dl, DstVT, SignedConv, Fudge);
2844 // Otherwise, use a libcall.
2845 RTLIB::Libcall LC = RTLIB::getUINTTOFP(SrcVT, DstVT);
2846 assert(LC != RTLIB::UNKNOWN_LIBCALL &&
2847 "Don't know how to expand this UINT_TO_FP!");
2848 return TLI.makeLibCall(DAG, LC, DstVT, &Op, 1, true, dl);
2851 SDValue DAGTypeLegalizer::ExpandIntOp_ATOMIC_STORE(SDNode *N) {
2852 DebugLoc dl = N->getDebugLoc();
2853 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_SWAP, dl,
2854 cast<AtomicSDNode>(N)->getMemoryVT(),
2856 N->getOperand(1), N->getOperand(2),
2857 cast<AtomicSDNode>(N)->getMemOperand(),
2858 cast<AtomicSDNode>(N)->getOrdering(),
2859 cast<AtomicSDNode>(N)->getSynchScope());
2860 return Swap.getValue(1);
2864 SDValue DAGTypeLegalizer::PromoteIntRes_EXTRACT_SUBVECTOR(SDNode *N) {
2865 SDValue InOp0 = N->getOperand(0);
2866 EVT InVT = InOp0.getValueType();
2868 EVT OutVT = N->getValueType(0);
2869 EVT NOutVT = TLI.getTypeToTransformTo(*DAG.getContext(), OutVT);
2870 assert(NOutVT.isVector() && "This type must be promoted to a vector type");
2871 unsigned OutNumElems = OutVT.getVectorNumElements();
2872 EVT NOutVTElem = NOutVT.getVectorElementType();
2874 DebugLoc dl = N->getDebugLoc();
2875 SDValue BaseIdx = N->getOperand(1);
2877 SmallVector<SDValue, 8> Ops;
2878 Ops.reserve(OutNumElems);
2879 for (unsigned i = 0; i != OutNumElems; ++i) {
2881 // Extract the element from the original vector.
2882 SDValue Index = DAG.getNode(ISD::ADD, dl, BaseIdx.getValueType(),
2883 BaseIdx, DAG.getIntPtrConstant(i));
2884 SDValue Ext = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
2885 InVT.getVectorElementType(), N->getOperand(0), Index);
2887 SDValue Op = DAG.getNode(ISD::ANY_EXTEND, dl, NOutVTElem, Ext);
2888 // Insert the converted element to the new vector.
2892 return DAG.getNode(ISD::BUILD_VECTOR, dl, NOutVT, &Ops[0], Ops.size());
2896 SDValue DAGTypeLegalizer::PromoteIntRes_VECTOR_SHUFFLE(SDNode *N) {
2897 ShuffleVectorSDNode *SV = cast<ShuffleVectorSDNode>(N);
2898 EVT VT = N->getValueType(0);
2899 DebugLoc dl = N->getDebugLoc();
2901 unsigned NumElts = VT.getVectorNumElements();
2902 SmallVector<int, 8> NewMask;
2903 for (unsigned i = 0; i != NumElts; ++i) {
2904 NewMask.push_back(SV->getMaskElt(i));
2907 SDValue V0 = GetPromotedInteger(N->getOperand(0));
2908 SDValue V1 = GetPromotedInteger(N->getOperand(1));
2909 EVT OutVT = V0.getValueType();
2911 return DAG.getVectorShuffle(OutVT, dl, V0, V1, &NewMask[0]);
2915 SDValue DAGTypeLegalizer::PromoteIntRes_BUILD_VECTOR(SDNode *N) {
2916 EVT OutVT = N->getValueType(0);
2917 EVT NOutVT = TLI.getTypeToTransformTo(*DAG.getContext(), OutVT);
2918 assert(NOutVT.isVector() && "This type must be promoted to a vector type");
2919 unsigned NumElems = N->getNumOperands();
2920 EVT NOutVTElem = NOutVT.getVectorElementType();
2922 DebugLoc dl = N->getDebugLoc();
2924 SmallVector<SDValue, 8> Ops;
2925 Ops.reserve(NumElems);
2926 for (unsigned i = 0; i != NumElems; ++i) {
2927 SDValue Op = DAG.getNode(ISD::ANY_EXTEND, dl, NOutVTElem, N->getOperand(i));
2931 return DAG.getNode(ISD::BUILD_VECTOR, dl, NOutVT, &Ops[0], Ops.size());
2934 SDValue DAGTypeLegalizer::PromoteIntRes_SCALAR_TO_VECTOR(SDNode *N) {
2936 DebugLoc dl = N->getDebugLoc();
2938 assert(!N->getOperand(0).getValueType().isVector() &&
2939 "Input must be a scalar");
2941 EVT OutVT = N->getValueType(0);
2942 EVT NOutVT = TLI.getTypeToTransformTo(*DAG.getContext(), OutVT);
2943 assert(NOutVT.isVector() && "This type must be promoted to a vector type");
2944 EVT NOutVTElem = NOutVT.getVectorElementType();
2946 SDValue Op = DAG.getNode(ISD::ANY_EXTEND, dl, NOutVTElem, N->getOperand(0));
2948 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, NOutVT, Op);
2951 SDValue DAGTypeLegalizer::PromoteIntRes_CONCAT_VECTORS(SDNode *N) {
2952 DebugLoc dl = N->getDebugLoc();
2954 EVT OutVT = N->getValueType(0);
2955 EVT NOutVT = TLI.getTypeToTransformTo(*DAG.getContext(), OutVT);
2956 assert(NOutVT.isVector() && "This type must be promoted to a vector type");
2958 EVT InElemTy = OutVT.getVectorElementType();
2959 EVT OutElemTy = NOutVT.getVectorElementType();
2961 unsigned NumElem = N->getOperand(0).getValueType().getVectorNumElements();
2962 unsigned NumOutElem = NOutVT.getVectorNumElements();
2963 unsigned NumOperands = N->getNumOperands();
2964 assert(NumElem * NumOperands == NumOutElem &&
2965 "Unexpected number of elements");
2967 // Take the elements from the first vector.
2968 SmallVector<SDValue, 8> Ops(NumOutElem);
2969 for (unsigned i = 0; i < NumOperands; ++i) {
2970 SDValue Op = N->getOperand(i);
2971 for (unsigned j = 0; j < NumElem; ++j) {
2972 SDValue Ext = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
2973 InElemTy, Op, DAG.getIntPtrConstant(j));
2974 Ops[i * NumElem + j] = DAG.getNode(ISD::ANY_EXTEND, dl, OutElemTy, Ext);
2978 return DAG.getNode(ISD::BUILD_VECTOR, dl, NOutVT, &Ops[0], Ops.size());
2981 SDValue DAGTypeLegalizer::PromoteIntRes_INSERT_VECTOR_ELT(SDNode *N) {
2982 EVT OutVT = N->getValueType(0);
2983 EVT NOutVT = TLI.getTypeToTransformTo(*DAG.getContext(), OutVT);
2984 assert(NOutVT.isVector() && "This type must be promoted to a vector type");
2986 EVT NOutVTElem = NOutVT.getVectorElementType();
2988 DebugLoc dl = N->getDebugLoc();
2989 SDValue V0 = GetPromotedInteger(N->getOperand(0));
2991 SDValue ConvElem = DAG.getNode(ISD::ANY_EXTEND, dl,
2992 NOutVTElem, N->getOperand(1));
2993 return DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, NOutVT,
2994 V0, ConvElem, N->getOperand(2));
2997 SDValue DAGTypeLegalizer::PromoteIntOp_EXTRACT_VECTOR_ELT(SDNode *N) {
2998 DebugLoc dl = N->getDebugLoc();
2999 SDValue V0 = GetPromotedInteger(N->getOperand(0));
3000 SDValue V1 = N->getOperand(1);
3001 SDValue Ext = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
3002 V0->getValueType(0).getScalarType(), V0, V1);
3004 // EXTRACT_VECTOR_ELT can return types which are wider than the incoming
3005 // element types. If this is the case then we need to expand the outgoing
3006 // value and not truncate it.
3007 return DAG.getAnyExtOrTrunc(Ext, dl, N->getValueType(0));
3010 SDValue DAGTypeLegalizer::PromoteIntOp_CONCAT_VECTORS(SDNode *N) {
3011 DebugLoc dl = N->getDebugLoc();
3012 unsigned NumElems = N->getNumOperands();
3014 EVT RetSclrTy = N->getValueType(0).getVectorElementType();
3016 SmallVector<SDValue, 8> NewOps;
3017 NewOps.reserve(NumElems);
3019 // For each incoming vector
3020 for (unsigned VecIdx = 0; VecIdx != NumElems; ++VecIdx) {
3021 SDValue Incoming = GetPromotedInteger(N->getOperand(VecIdx));
3022 EVT SclrTy = Incoming->getValueType(0).getVectorElementType();
3023 unsigned NumElem = Incoming->getValueType(0).getVectorNumElements();
3025 for (unsigned i=0; i<NumElem; ++i) {
3026 // Extract element from incoming vector
3027 SDValue Ex = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, SclrTy,
3028 Incoming, DAG.getIntPtrConstant(i));
3029 SDValue Tr = DAG.getNode(ISD::TRUNCATE, dl, RetSclrTy, Ex);
3030 NewOps.push_back(Tr);
3034 return DAG.getNode(ISD::BUILD_VECTOR, dl, N->getValueType(0),
3035 &NewOps[0], NewOps.size());