AMDGPU: Mark test as XFAIL in expensive_checks builds
[llvm-project.git] / llvm / lib / CodeGen / SelectionDAG / LegalizeTypesGeneric.cpp
blob113a3bc0bbea694f7d50ea9fb7617cb379090b0e
1 //===-------- LegalizeTypesGeneric.cpp - Generic type legalization --------===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8 //
9 // This file implements generic type expansion and splitting for LegalizeTypes.
10 // The routines here perform legalization when the details of the type (such as
11 // whether it is an integer or a float) do not matter.
12 // Expansion is the act of changing a computation in an illegal type to be a
13 // computation in two identical registers of a smaller type. The Lo/Hi part
14 // is required to be stored first in memory on little/big-endian machines.
15 // Splitting is the act of changing a computation in an illegal type to be a
16 // computation in two not necessarily identical registers of a smaller type.
17 // There are no requirements on how the type is represented in memory.
19 //===----------------------------------------------------------------------===//
21 #include "LegalizeTypes.h"
22 #include "llvm/IR/DataLayout.h"
23 using namespace llvm;
25 #define DEBUG_TYPE "legalize-types"
27 //===----------------------------------------------------------------------===//
28 // Generic Result Expansion.
29 //===----------------------------------------------------------------------===//
31 // These routines assume that the Lo/Hi part is stored first in memory on
32 // little/big-endian machines, followed by the Hi/Lo part. This means that
33 // they cannot be used as is on vectors, for which Lo is always stored first.
34 void DAGTypeLegalizer::ExpandRes_MERGE_VALUES(SDNode *N, unsigned ResNo,
35 SDValue &Lo, SDValue &Hi) {
36 SDValue Op = DisintegrateMERGE_VALUES(N, ResNo);
37 GetExpandedOp(Op, Lo, Hi);
40 void DAGTypeLegalizer::ExpandRes_BITCAST(SDNode *N, SDValue &Lo, SDValue &Hi) {
41 EVT OutVT = N->getValueType(0);
42 EVT NOutVT = TLI.getTypeToTransformTo(*DAG.getContext(), OutVT);
43 SDValue InOp = N->getOperand(0);
44 EVT InVT = InOp.getValueType();
45 SDLoc dl(N);
47 // Handle some special cases efficiently.
48 switch (getTypeAction(InVT)) {
49 case TargetLowering::TypeLegal:
50 case TargetLowering::TypePromoteInteger:
51 break;
52 case TargetLowering::TypePromoteFloat:
53 case TargetLowering::TypeSoftPromoteHalf:
54 llvm_unreachable("Bitcast of a promotion-needing float should never need"
55 "expansion");
56 case TargetLowering::TypeSoftenFloat:
57 SplitInteger(GetSoftenedFloat(InOp), Lo, Hi);
58 Lo = DAG.getNode(ISD::BITCAST, dl, NOutVT, Lo);
59 Hi = DAG.getNode(ISD::BITCAST, dl, NOutVT, Hi);
60 return;
61 case TargetLowering::TypeExpandInteger:
62 case TargetLowering::TypeExpandFloat: {
63 auto &DL = DAG.getDataLayout();
64 // Convert the expanded pieces of the input.
65 GetExpandedOp(InOp, Lo, Hi);
66 if (TLI.hasBigEndianPartOrdering(InVT, DL) !=
67 TLI.hasBigEndianPartOrdering(OutVT, DL))
68 std::swap(Lo, Hi);
69 Lo = DAG.getNode(ISD::BITCAST, dl, NOutVT, Lo);
70 Hi = DAG.getNode(ISD::BITCAST, dl, NOutVT, Hi);
71 return;
73 case TargetLowering::TypeSplitVector:
74 GetSplitVector(InOp, Lo, Hi);
75 if (TLI.hasBigEndianPartOrdering(OutVT, DAG.getDataLayout()))
76 std::swap(Lo, Hi);
77 Lo = DAG.getNode(ISD::BITCAST, dl, NOutVT, Lo);
78 Hi = DAG.getNode(ISD::BITCAST, dl, NOutVT, Hi);
79 return;
80 case TargetLowering::TypeScalarizeVector:
81 // Convert the element instead.
82 SplitInteger(BitConvertToInteger(GetScalarizedVector(InOp)), Lo, Hi);
83 Lo = DAG.getNode(ISD::BITCAST, dl, NOutVT, Lo);
84 Hi = DAG.getNode(ISD::BITCAST, dl, NOutVT, Hi);
85 return;
86 case TargetLowering::TypeScalarizeScalableVector:
87 report_fatal_error("Scalarization of scalable vectors is not supported.");
88 case TargetLowering::TypeWidenVector: {
89 assert(!(InVT.getVectorNumElements() & 1) && "Unsupported BITCAST");
90 InOp = GetWidenedVector(InOp);
91 EVT LoVT, HiVT;
92 std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(InVT);
93 std::tie(Lo, Hi) = DAG.SplitVector(InOp, dl, LoVT, HiVT);
94 if (TLI.hasBigEndianPartOrdering(OutVT, DAG.getDataLayout()))
95 std::swap(Lo, Hi);
96 Lo = DAG.getNode(ISD::BITCAST, dl, NOutVT, Lo);
97 Hi = DAG.getNode(ISD::BITCAST, dl, NOutVT, Hi);
98 return;
102 if (InVT.isVector() && OutVT.isInteger()) {
103 // Handle cases like i64 = BITCAST v1i64 on x86, where the operand
104 // is legal but the result is not.
105 unsigned NumElems = 2;
106 EVT ElemVT = NOutVT;
107 EVT NVT = EVT::getVectorVT(*DAG.getContext(), ElemVT, NumElems);
109 // If <ElemVT * N> is not a legal type, try <ElemVT/2 * (N*2)>.
110 while (!isTypeLegal(NVT)) {
111 unsigned NewSizeInBits = ElemVT.getSizeInBits() / 2;
112 // If the element size is smaller than byte, bail.
113 if (NewSizeInBits < 8)
114 break;
115 NumElems *= 2;
116 ElemVT = EVT::getIntegerVT(*DAG.getContext(), NewSizeInBits);
117 NVT = EVT::getVectorVT(*DAG.getContext(), ElemVT, NumElems);
120 if (isTypeLegal(NVT)) {
121 SDValue CastInOp = DAG.getNode(ISD::BITCAST, dl, NVT, InOp);
123 SmallVector<SDValue, 8> Vals;
124 for (unsigned i = 0; i < NumElems; ++i)
125 Vals.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, ElemVT,
126 CastInOp, DAG.getVectorIdxConstant(i, dl)));
128 // Build Lo, Hi pair by pairing extracted elements if needed.
129 unsigned Slot = 0;
130 for (unsigned e = Vals.size(); e - Slot > 2; Slot += 2, e += 1) {
131 // Each iteration will BUILD_PAIR two nodes and append the result until
132 // there are only two nodes left, i.e. Lo and Hi.
133 SDValue LHS = Vals[Slot];
134 SDValue RHS = Vals[Slot + 1];
136 if (DAG.getDataLayout().isBigEndian())
137 std::swap(LHS, RHS);
139 Vals.push_back(DAG.getNode(
140 ISD::BUILD_PAIR, dl,
141 EVT::getIntegerVT(*DAG.getContext(), LHS.getValueSizeInBits() << 1),
142 LHS, RHS));
144 Lo = Vals[Slot++];
145 Hi = Vals[Slot++];
147 if (DAG.getDataLayout().isBigEndian())
148 std::swap(Lo, Hi);
150 return;
154 // Lower the bit-convert to a store/load from the stack.
155 assert(NOutVT.isByteSized() && "Expanded type not byte sized!");
157 // Create the stack frame object. Make sure it is aligned for both
158 // the source and expanded destination types.
160 // In cases where the vector is illegal it will be broken down into parts
161 // and stored in parts - we should use the alignment for the smallest part.
162 Align InAlign = DAG.getReducedAlign(InVT, /*UseABI=*/false);
163 Align NOutAlign = DAG.getReducedAlign(NOutVT, /*UseABI=*/false);
164 Align Align = std::max(InAlign, NOutAlign);
165 SDValue StackPtr = DAG.CreateStackTemporary(InVT.getStoreSize(), Align);
166 int SPFI = cast<FrameIndexSDNode>(StackPtr.getNode())->getIndex();
167 MachinePointerInfo PtrInfo =
168 MachinePointerInfo::getFixedStack(DAG.getMachineFunction(), SPFI);
170 // Emit a store to the stack slot.
171 SDValue Store = DAG.getStore(DAG.getEntryNode(), dl, InOp, StackPtr, PtrInfo);
173 // Load the first half from the stack slot.
174 Lo = DAG.getLoad(NOutVT, dl, Store, StackPtr, PtrInfo, NOutAlign);
176 // Increment the pointer to the other half.
177 unsigned IncrementSize = NOutVT.getSizeInBits() / 8;
178 StackPtr =
179 DAG.getMemBasePlusOffset(StackPtr, TypeSize::getFixed(IncrementSize), dl);
181 // Load the second half from the stack slot.
182 Hi = DAG.getLoad(NOutVT, dl, Store, StackPtr,
183 PtrInfo.getWithOffset(IncrementSize), NOutAlign);
185 // Handle endianness of the load.
186 if (TLI.hasBigEndianPartOrdering(OutVT, DAG.getDataLayout()))
187 std::swap(Lo, Hi);
190 void DAGTypeLegalizer::ExpandRes_BUILD_PAIR(SDNode *N, SDValue &Lo,
191 SDValue &Hi) {
192 // Return the operands.
193 Lo = N->getOperand(0);
194 Hi = N->getOperand(1);
197 void DAGTypeLegalizer::ExpandRes_EXTRACT_ELEMENT(SDNode *N, SDValue &Lo,
198 SDValue &Hi) {
199 GetExpandedOp(N->getOperand(0), Lo, Hi);
200 SDValue Part = N->getConstantOperandVal(1) ? Hi : Lo;
202 assert(Part.getValueType() == N->getValueType(0) &&
203 "Type twice as big as expanded type not itself expanded!");
205 GetPairElements(Part, Lo, Hi);
208 void DAGTypeLegalizer::ExpandRes_EXTRACT_VECTOR_ELT(SDNode *N, SDValue &Lo,
209 SDValue &Hi) {
210 SDValue OldVec = N->getOperand(0);
211 ElementCount OldEltCount = OldVec.getValueType().getVectorElementCount();
212 EVT OldEltVT = OldVec.getValueType().getVectorElementType();
213 SDLoc dl(N);
215 // Convert to a vector of the expanded element type, for example
216 // <3 x i64> -> <6 x i32>.
217 EVT OldVT = N->getValueType(0);
218 EVT NewVT = TLI.getTypeToTransformTo(*DAG.getContext(), OldVT);
220 if (OldVT != OldEltVT) {
221 // The result of EXTRACT_VECTOR_ELT may be larger than the element type of
222 // the input vector. If so, extend the elements of the input vector to the
223 // same bitwidth as the result before expanding.
224 assert(OldEltVT.bitsLT(OldVT) && "Result type smaller then element type!");
225 EVT NVecVT = EVT::getVectorVT(*DAG.getContext(), OldVT, OldEltCount);
226 OldVec = DAG.getNode(ISD::ANY_EXTEND, dl, NVecVT, N->getOperand(0));
229 SDValue NewVec = DAG.getNode(
230 ISD::BITCAST, dl,
231 EVT::getVectorVT(*DAG.getContext(), NewVT, OldEltCount * 2), OldVec);
233 // Extract the elements at 2 * Idx and 2 * Idx + 1 from the new vector.
234 SDValue Idx = N->getOperand(1);
236 Idx = DAG.getNode(ISD::ADD, dl, Idx.getValueType(), Idx, Idx);
237 Lo = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, NewVT, NewVec, Idx);
239 Idx = DAG.getNode(ISD::ADD, dl, Idx.getValueType(), Idx,
240 DAG.getConstant(1, dl, Idx.getValueType()));
241 Hi = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, NewVT, NewVec, Idx);
243 if (DAG.getDataLayout().isBigEndian())
244 std::swap(Lo, Hi);
247 void DAGTypeLegalizer::ExpandRes_NormalLoad(SDNode *N, SDValue &Lo,
248 SDValue &Hi) {
249 assert(ISD::isNormalLoad(N) && "This routine only for normal loads!");
250 SDLoc dl(N);
252 LoadSDNode *LD = cast<LoadSDNode>(N);
253 assert(!LD->isAtomic() && "Atomics can not be split");
254 EVT ValueVT = LD->getValueType(0);
255 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), ValueVT);
256 SDValue Chain = LD->getChain();
257 SDValue Ptr = LD->getBasePtr();
258 AAMDNodes AAInfo = LD->getAAInfo();
260 assert(NVT.isByteSized() && "Expanded type not byte sized!");
262 Lo = DAG.getLoad(NVT, dl, Chain, Ptr, LD->getPointerInfo(),
263 LD->getOriginalAlign(), LD->getMemOperand()->getFlags(),
264 AAInfo);
266 // Increment the pointer to the other half.
267 unsigned IncrementSize = NVT.getSizeInBits() / 8;
268 Ptr = DAG.getObjectPtrOffset(dl, Ptr, TypeSize::getFixed(IncrementSize));
269 Hi = DAG.getLoad(
270 NVT, dl, Chain, Ptr, LD->getPointerInfo().getWithOffset(IncrementSize),
271 LD->getOriginalAlign(), LD->getMemOperand()->getFlags(), AAInfo);
273 // Build a factor node to remember that this load is independent of the
274 // other one.
275 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
276 Hi.getValue(1));
278 // Handle endianness of the load.
279 if (TLI.hasBigEndianPartOrdering(ValueVT, DAG.getDataLayout()))
280 std::swap(Lo, Hi);
282 // Modified the chain - switch anything that used the old chain to use
283 // the new one.
284 ReplaceValueWith(SDValue(N, 1), Chain);
287 void DAGTypeLegalizer::ExpandRes_VAARG(SDNode *N, SDValue &Lo, SDValue &Hi) {
288 EVT OVT = N->getValueType(0);
289 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), OVT);
290 SDValue Chain = N->getOperand(0);
291 SDValue Ptr = N->getOperand(1);
292 SDLoc dl(N);
293 const unsigned Align = N->getConstantOperandVal(3);
295 Lo = DAG.getVAArg(NVT, dl, Chain, Ptr, N->getOperand(2), Align);
296 Hi = DAG.getVAArg(NVT, dl, Lo.getValue(1), Ptr, N->getOperand(2), 0);
297 Chain = Hi.getValue(1);
299 // Handle endianness of the load.
300 if (TLI.hasBigEndianPartOrdering(OVT, DAG.getDataLayout()))
301 std::swap(Lo, Hi);
303 // Modified the chain - switch anything that used the old chain to use
304 // the new one.
305 ReplaceValueWith(SDValue(N, 1), Chain);
309 //===--------------------------------------------------------------------===//
310 // Generic Operand Expansion.
311 //===--------------------------------------------------------------------===//
313 void DAGTypeLegalizer::IntegerToVector(SDValue Op, unsigned NumElements,
314 SmallVectorImpl<SDValue> &Ops,
315 EVT EltVT) {
316 assert(Op.getValueType().isInteger());
317 SDLoc DL(Op);
318 SDValue Parts[2];
320 if (NumElements > 1) {
321 NumElements >>= 1;
322 SplitInteger(Op, Parts[0], Parts[1]);
323 if (DAG.getDataLayout().isBigEndian())
324 std::swap(Parts[0], Parts[1]);
325 IntegerToVector(Parts[0], NumElements, Ops, EltVT);
326 IntegerToVector(Parts[1], NumElements, Ops, EltVT);
327 } else {
328 Ops.push_back(DAG.getNode(ISD::BITCAST, DL, EltVT, Op));
332 SDValue DAGTypeLegalizer::ExpandOp_BITCAST(SDNode *N) {
333 SDLoc dl(N);
334 if (N->getValueType(0).isVector() &&
335 N->getOperand(0).getValueType().isInteger()) {
336 // An illegal expanding type is being converted to a legal vector type.
337 // Make a two element vector out of the expanded parts and convert that
338 // instead, but only if the new vector type is legal (otherwise there
339 // is no point, and it might create expansion loops). For example, on
340 // x86 this turns v1i64 = BITCAST i64 into v1i64 = BITCAST v2i32.
342 // FIXME: I'm not sure why we are first trying to split the input into
343 // a 2 element vector, so I'm leaving it here to maintain the current
344 // behavior.
345 unsigned NumElts = 2;
346 EVT OVT = N->getOperand(0).getValueType();
347 EVT NVT = EVT::getVectorVT(*DAG.getContext(),
348 TLI.getTypeToTransformTo(*DAG.getContext(), OVT),
349 NumElts);
350 if (!isTypeLegal(NVT)) {
351 // If we can't find a legal type by splitting the integer in half,
352 // then we can use the node's value type.
353 NumElts = N->getValueType(0).getVectorNumElements();
354 NVT = N->getValueType(0);
357 SmallVector<SDValue, 8> Ops;
358 IntegerToVector(N->getOperand(0), NumElts, Ops, NVT.getVectorElementType());
360 SDValue Vec = DAG.getBuildVector(NVT, dl, ArrayRef(Ops.data(), NumElts));
361 return DAG.getNode(ISD::BITCAST, dl, N->getValueType(0), Vec);
364 // Otherwise, store to a temporary and load out again as the new type.
365 return CreateStackStoreLoad(N->getOperand(0), N->getValueType(0));
368 SDValue DAGTypeLegalizer::ExpandOp_BUILD_VECTOR(SDNode *N) {
369 // The vector type is legal but the element type needs expansion.
370 EVT VecVT = N->getValueType(0);
371 unsigned NumElts = VecVT.getVectorNumElements();
372 EVT OldVT = N->getOperand(0).getValueType();
373 EVT NewVT = TLI.getTypeToTransformTo(*DAG.getContext(), OldVT);
374 SDLoc dl(N);
376 assert(OldVT == VecVT.getVectorElementType() &&
377 "BUILD_VECTOR operand type doesn't match vector element type!");
379 if (VecVT.isInteger() && TLI.isOperationLegal(ISD::SPLAT_VECTOR, VecVT) &&
380 TLI.isOperationLegalOrCustom(ISD::SPLAT_VECTOR_PARTS, VecVT)) {
381 if (SDValue V = cast<BuildVectorSDNode>(N)->getSplatValue()) {
382 SDValue Lo, Hi;
383 GetExpandedOp(V, Lo, Hi);
384 return DAG.getNode(ISD::SPLAT_VECTOR_PARTS, dl, VecVT, Lo, Hi);
388 // Build a vector of twice the length out of the expanded elements.
389 // For example <3 x i64> -> <6 x i32>.
390 SmallVector<SDValue, 16> NewElts;
391 NewElts.reserve(NumElts*2);
393 for (unsigned i = 0; i < NumElts; ++i) {
394 SDValue Lo, Hi;
395 GetExpandedOp(N->getOperand(i), Lo, Hi);
396 if (DAG.getDataLayout().isBigEndian())
397 std::swap(Lo, Hi);
398 NewElts.push_back(Lo);
399 NewElts.push_back(Hi);
402 EVT NewVecVT = EVT::getVectorVT(*DAG.getContext(), NewVT, NewElts.size());
403 SDValue NewVec = DAG.getBuildVector(NewVecVT, dl, NewElts);
405 // Convert the new vector to the old vector type.
406 return DAG.getNode(ISD::BITCAST, dl, VecVT, NewVec);
409 SDValue DAGTypeLegalizer::ExpandOp_EXTRACT_ELEMENT(SDNode *N) {
410 SDValue Lo, Hi;
411 GetExpandedOp(N->getOperand(0), Lo, Hi);
412 return N->getConstantOperandVal(1) ? Hi : Lo;
415 // Split the integer operand in two and create a second FAKE_USE node for
416 // the other half. The original SDNode is updated in place.
417 SDValue DAGTypeLegalizer::ExpandOp_FAKE_USE(SDNode *N) {
418 SDValue Lo, Hi;
419 SDValue Chain = N->getOperand(0);
420 GetExpandedOp(N->getOperand(1), Lo, Hi);
421 SDValue LoUse = DAG.getNode(ISD::FAKE_USE, SDLoc(), MVT::Other, Chain, Lo);
422 DAG.UpdateNodeOperands(N, LoUse, Hi);
423 return SDValue(N, 0);
426 SDValue DAGTypeLegalizer::ExpandOp_INSERT_VECTOR_ELT(SDNode *N) {
427 // The vector type is legal but the element type needs expansion.
428 EVT VecVT = N->getValueType(0);
429 unsigned NumElts = VecVT.getVectorNumElements();
430 SDLoc dl(N);
432 SDValue Val = N->getOperand(1);
433 EVT OldEVT = Val.getValueType();
434 EVT NewEVT = TLI.getTypeToTransformTo(*DAG.getContext(), OldEVT);
436 assert(OldEVT == VecVT.getVectorElementType() &&
437 "Inserted element type doesn't match vector element type!");
439 // Bitconvert to a vector of twice the length with elements of the expanded
440 // type, insert the expanded vector elements, and then convert back.
441 EVT NewVecVT = EVT::getVectorVT(*DAG.getContext(), NewEVT, NumElts*2);
442 SDValue NewVec = DAG.getNode(ISD::BITCAST, dl,
443 NewVecVT, N->getOperand(0));
445 SDValue Lo, Hi;
446 GetExpandedOp(Val, Lo, Hi);
447 if (DAG.getDataLayout().isBigEndian())
448 std::swap(Lo, Hi);
450 SDValue Idx = N->getOperand(2);
451 Idx = DAG.getNode(ISD::ADD, dl, Idx.getValueType(), Idx, Idx);
452 NewVec = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, NewVecVT, NewVec, Lo, Idx);
453 Idx = DAG.getNode(ISD::ADD, dl,
454 Idx.getValueType(), Idx,
455 DAG.getConstant(1, dl, Idx.getValueType()));
456 NewVec = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, NewVecVT, NewVec, Hi, Idx);
458 // Convert the new vector to the old vector type.
459 return DAG.getNode(ISD::BITCAST, dl, VecVT, NewVec);
462 SDValue DAGTypeLegalizer::ExpandOp_SCALAR_TO_VECTOR(SDNode *N) {
463 SDLoc dl(N);
464 EVT VT = N->getValueType(0);
465 assert(VT.getVectorElementType() == N->getOperand(0).getValueType() &&
466 "SCALAR_TO_VECTOR operand type doesn't match vector element type!");
467 unsigned NumElts = VT.getVectorNumElements();
468 SmallVector<SDValue, 16> Ops(NumElts);
469 Ops[0] = N->getOperand(0);
470 SDValue UndefVal = DAG.getUNDEF(Ops[0].getValueType());
471 for (unsigned i = 1; i < NumElts; ++i)
472 Ops[i] = UndefVal;
473 return DAG.getBuildVector(VT, dl, Ops);
476 SDValue DAGTypeLegalizer::ExpandOp_NormalStore(SDNode *N, unsigned OpNo) {
477 assert(ISD::isNormalStore(N) && "This routine only for normal stores!");
478 assert(OpNo == 1 && "Can only expand the stored value so far");
479 SDLoc dl(N);
481 StoreSDNode *St = cast<StoreSDNode>(N);
482 assert(!St->isAtomic() && "Atomics can not be split");
483 EVT ValueVT = St->getValue().getValueType();
484 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), ValueVT);
485 SDValue Chain = St->getChain();
486 SDValue Ptr = St->getBasePtr();
487 AAMDNodes AAInfo = St->getAAInfo();
489 assert(NVT.isByteSized() && "Expanded type not byte sized!");
490 unsigned IncrementSize = NVT.getSizeInBits() / 8;
492 SDValue Lo, Hi;
493 GetExpandedOp(St->getValue(), Lo, Hi);
495 if (TLI.hasBigEndianPartOrdering(ValueVT, DAG.getDataLayout()))
496 std::swap(Lo, Hi);
498 Lo = DAG.getStore(Chain, dl, Lo, Ptr, St->getPointerInfo(),
499 St->getOriginalAlign(), St->getMemOperand()->getFlags(),
500 AAInfo);
502 Ptr = DAG.getObjectPtrOffset(dl, Ptr, TypeSize::getFixed(IncrementSize));
503 Hi = DAG.getStore(
504 Chain, dl, Hi, Ptr, St->getPointerInfo().getWithOffset(IncrementSize),
505 St->getOriginalAlign(), St->getMemOperand()->getFlags(), AAInfo);
507 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo, Hi);
511 //===--------------------------------------------------------------------===//
512 // Generic Result Splitting.
513 //===--------------------------------------------------------------------===//
515 // Be careful to make no assumptions about which of Lo/Hi is stored first in
516 // memory (for vectors it is always Lo first followed by Hi in the following
517 // bytes; for integers and floats it is Lo first if and only if the machine is
518 // little-endian).
520 void DAGTypeLegalizer::SplitRes_MERGE_VALUES(SDNode *N, unsigned ResNo,
521 SDValue &Lo, SDValue &Hi) {
522 SDValue Op = DisintegrateMERGE_VALUES(N, ResNo);
523 GetSplitOp(Op, Lo, Hi);
526 void DAGTypeLegalizer::SplitRes_Select(SDNode *N, SDValue &Lo, SDValue &Hi) {
527 SDValue LL, LH, RL, RH, CL, CH;
528 SDLoc dl(N);
529 unsigned Opcode = N->getOpcode();
530 GetSplitOp(N->getOperand(1), LL, LH);
531 GetSplitOp(N->getOperand(2), RL, RH);
533 SDValue Cond = N->getOperand(0);
534 CL = CH = Cond;
535 if (Cond.getValueType().isVector()) {
536 if (SDValue Res = WidenVSELECTMask(N))
537 std::tie(CL, CH) = DAG.SplitVector(Res, dl);
538 // Check if there are already splitted versions of the vector available and
539 // use those instead of splitting the mask operand again.
540 else if (getTypeAction(Cond.getValueType()) ==
541 TargetLowering::TypeSplitVector)
542 GetSplitVector(Cond, CL, CH);
543 // It seems to improve code to generate two narrow SETCCs as opposed to
544 // splitting a wide result vector.
545 else if (Cond.getOpcode() == ISD::SETCC) {
546 // If the condition is a vXi1 vector, and the LHS of the setcc is a legal
547 // type and the setcc result type is the same vXi1, then leave the setcc
548 // alone.
549 EVT CondLHSVT = Cond.getOperand(0).getValueType();
550 if (Cond.getValueType().getVectorElementType() == MVT::i1 &&
551 isTypeLegal(CondLHSVT) &&
552 getSetCCResultType(CondLHSVT) == Cond.getValueType())
553 std::tie(CL, CH) = DAG.SplitVector(Cond, dl);
554 else
555 SplitVecRes_SETCC(Cond.getNode(), CL, CH);
556 } else
557 std::tie(CL, CH) = DAG.SplitVector(Cond, dl);
560 if (Opcode != ISD::VP_SELECT && Opcode != ISD::VP_MERGE) {
561 Lo = DAG.getNode(Opcode, dl, LL.getValueType(), CL, LL, RL);
562 Hi = DAG.getNode(Opcode, dl, LH.getValueType(), CH, LH, RH);
563 return;
566 SDValue EVLLo, EVLHi;
567 std::tie(EVLLo, EVLHi) =
568 DAG.SplitEVL(N->getOperand(3), N->getValueType(0), dl);
570 Lo = DAG.getNode(Opcode, dl, LL.getValueType(), CL, LL, RL, EVLLo);
571 Hi = DAG.getNode(Opcode, dl, LH.getValueType(), CH, LH, RH, EVLHi);
574 void DAGTypeLegalizer::SplitRes_SELECT_CC(SDNode *N, SDValue &Lo,
575 SDValue &Hi) {
576 SDValue LL, LH, RL, RH;
577 SDLoc dl(N);
578 GetSplitOp(N->getOperand(2), LL, LH);
579 GetSplitOp(N->getOperand(3), RL, RH);
581 Lo = DAG.getNode(ISD::SELECT_CC, dl, LL.getValueType(), N->getOperand(0),
582 N->getOperand(1), LL, RL, N->getOperand(4));
583 Hi = DAG.getNode(ISD::SELECT_CC, dl, LH.getValueType(), N->getOperand(0),
584 N->getOperand(1), LH, RH, N->getOperand(4));
587 void DAGTypeLegalizer::SplitRes_UNDEF(SDNode *N, SDValue &Lo, SDValue &Hi) {
588 EVT LoVT, HiVT;
589 std::tie(LoVT, HiVT) = DAG.GetSplitDestVTs(N->getValueType(0));
590 Lo = DAG.getUNDEF(LoVT);
591 Hi = DAG.getUNDEF(HiVT);
594 void DAGTypeLegalizer::SplitVecRes_AssertZext(SDNode *N, SDValue &Lo,
595 SDValue &Hi) {
596 SDValue L, H;
597 SDLoc dl(N);
598 GetSplitOp(N->getOperand(0), L, H);
600 Lo = DAG.getNode(ISD::AssertZext, dl, L.getValueType(), L, N->getOperand(1));
601 Hi = DAG.getNode(ISD::AssertZext, dl, H.getValueType(), H, N->getOperand(1));
604 void DAGTypeLegalizer::SplitRes_FREEZE(SDNode *N, SDValue &Lo, SDValue &Hi) {
605 SDValue L, H;
606 SDLoc dl(N);
607 GetSplitOp(N->getOperand(0), L, H);
609 Lo = DAG.getNode(ISD::FREEZE, dl, L.getValueType(), L);
610 Hi = DAG.getNode(ISD::FREEZE, dl, H.getValueType(), H);
613 void DAGTypeLegalizer::SplitRes_ARITH_FENCE(SDNode *N, SDValue &Lo,
614 SDValue &Hi) {
615 SDValue L, H;
616 SDLoc DL(N);
617 GetSplitOp(N->getOperand(0), L, H);
619 Lo = DAG.getNode(ISD::ARITH_FENCE, DL, L.getValueType(), L);
620 Hi = DAG.getNode(ISD::ARITH_FENCE, DL, H.getValueType(), H);