1 //===-- LegalizeVectorOps.cpp - Implement SelectionDAG::LegalizeVectors ---===//
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 the SelectionDAG::LegalizeVectors method.
12 // The vector legalizer looks for vector operations which might need to be
13 // scalarized and legalizes them. This is a separate step from Legalize because
14 // scalarizing can introduce illegal types. For example, suppose we have an
15 // ISD::SDIV of type v2i64 on x86-32. The type is legal (for example, addition
16 // on a v2i64 is legal), but ISD::SDIV isn't legal, so we have to unroll the
17 // operation, which introduces nodes with the illegal type i64 which must be
18 // expanded. Similarly, suppose we have an ISD::SRA of type v16i8 on PowerPC;
19 // the operation must be unrolled, which introduces nodes with the illegal
20 // type i8 which must be promoted.
22 // This does not legalize vector manipulations like ISD::BUILD_VECTOR,
23 // or operations that happen to take a vector which are custom-lowered;
24 // the legalization for such operations never produces nodes
25 // with illegal types, so it's okay to put off legalizing them until
26 // SelectionDAG::Legalize runs.
28 //===----------------------------------------------------------------------===//
30 #include "llvm/CodeGen/SelectionDAG.h"
31 #include "llvm/Target/TargetLowering.h"
35 class VectorLegalizer {
37 const TargetLowering &TLI;
38 bool Changed; // Keep track of whether anything changed
40 /// For nodes that are of legal width, and that have more than one use, this
41 /// map indicates what regularized operand to use. This allows us to avoid
42 /// legalizing the same thing more than once.
43 SmallDenseMap<SDValue, SDValue, 64> LegalizedNodes;
45 /// \brief Adds a node to the translation cache.
46 void AddLegalizedOperand(SDValue From, SDValue To) {
47 LegalizedNodes.insert(std::make_pair(From, To));
48 // If someone requests legalization of the new node, return itself.
50 LegalizedNodes.insert(std::make_pair(To, To));
53 /// \brief Legalizes the given node.
54 SDValue LegalizeOp(SDValue Op);
56 /// \brief Assuming the node is legal, "legalize" the results.
57 SDValue TranslateLegalizeResults(SDValue Op, SDValue Result);
59 /// \brief Implements unrolling a VSETCC.
60 SDValue UnrollVSETCC(SDValue Op);
62 /// \brief Implements expansion for FNEG; falls back to UnrollVectorOp if
65 /// Implements expansion for UINT_TO_FLOAT; falls back to UnrollVectorOp if
66 /// SINT_TO_FLOAT and SHR on vectors isn't legal.
67 SDValue ExpandUINT_TO_FLOAT(SDValue Op);
69 /// \brief Implement expansion for SIGN_EXTEND_INREG using SRL and SRA.
70 SDValue ExpandSEXTINREG(SDValue Op);
72 /// \brief Expand bswap of vectors into a shuffle if legal.
73 SDValue ExpandBSWAP(SDValue Op);
75 /// \brief Implement vselect in terms of XOR, AND, OR when blend is not
76 /// supported by the target.
77 SDValue ExpandVSELECT(SDValue Op);
78 SDValue ExpandSELECT(SDValue Op);
79 SDValue ExpandLoad(SDValue Op);
80 SDValue ExpandStore(SDValue Op);
81 SDValue ExpandFNEG(SDValue Op);
83 /// \brief Implements vector promotion.
85 /// This is essentially just bitcasting the operands to a different type and
86 /// bitcasting the result back to the original type.
87 SDValue Promote(SDValue Op);
89 /// \brief Implements [SU]INT_TO_FP vector promotion.
91 /// This is a [zs]ext of the input operand to the next size up.
92 SDValue PromoteINT_TO_FP(SDValue Op);
94 /// \brief Implements FP_TO_[SU]INT vector promotion of the result type.
96 /// It is promoted to the next size up integer type. The result is then
97 /// truncated back to the original type.
98 SDValue PromoteFP_TO_INT(SDValue Op, bool isSigned);
101 /// \brief Begin legalizer the vector operations in the DAG.
103 VectorLegalizer(SelectionDAG& dag) :
104 DAG(dag), TLI(dag.getTargetLoweringInfo()), Changed(false) {}
107 bool VectorLegalizer::Run() {
108 // Before we start legalizing vector nodes, check if there are any vectors.
109 bool HasVectors = false;
110 for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(),
111 E = std::prev(DAG.allnodes_end()); I != std::next(E); ++I) {
112 // Check if the values of the nodes contain vectors. We don't need to check
113 // the operands because we are going to check their values at some point.
114 for (SDNode::value_iterator J = I->value_begin(), E = I->value_end();
116 HasVectors |= J->isVector();
118 // If we found a vector node we can start the legalization.
123 // If this basic block has no vectors then no need to legalize vectors.
127 // The legalize process is inherently a bottom-up recursive process (users
128 // legalize their uses before themselves). Given infinite stack space, we
129 // could just start legalizing on the root and traverse the whole graph. In
130 // practice however, this causes us to run out of stack space on large basic
131 // blocks. To avoid this problem, compute an ordering of the nodes where each
132 // node is only legalized after all of its operands are legalized.
133 DAG.AssignTopologicalOrder();
134 for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(),
135 E = std::prev(DAG.allnodes_end()); I != std::next(E); ++I)
136 LegalizeOp(SDValue(I, 0));
138 // Finally, it's possible the root changed. Get the new root.
139 SDValue OldRoot = DAG.getRoot();
140 assert(LegalizedNodes.count(OldRoot) && "Root didn't get legalized?");
141 DAG.setRoot(LegalizedNodes[OldRoot]);
143 LegalizedNodes.clear();
145 // Remove dead nodes now.
146 DAG.RemoveDeadNodes();
151 SDValue VectorLegalizer::TranslateLegalizeResults(SDValue Op, SDValue Result) {
152 // Generic legalization: just pass the operand through.
153 for (unsigned i = 0, e = Op.getNode()->getNumValues(); i != e; ++i)
154 AddLegalizedOperand(Op.getValue(i), Result.getValue(i));
155 return Result.getValue(Op.getResNo());
158 SDValue VectorLegalizer::LegalizeOp(SDValue Op) {
159 // Note that LegalizeOp may be reentered even from single-use nodes, which
160 // means that we always must cache transformed nodes.
161 DenseMap<SDValue, SDValue>::iterator I = LegalizedNodes.find(Op);
162 if (I != LegalizedNodes.end()) return I->second;
164 SDNode* Node = Op.getNode();
166 // Legalize the operands
167 SmallVector<SDValue, 8> Ops;
168 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
169 Ops.push_back(LegalizeOp(Node->getOperand(i)));
171 SDValue Result = SDValue(DAG.UpdateNodeOperands(Op.getNode(), Ops), 0);
173 if (Op.getOpcode() == ISD::LOAD) {
174 LoadSDNode *LD = cast<LoadSDNode>(Op.getNode());
175 ISD::LoadExtType ExtType = LD->getExtensionType();
176 if (LD->getMemoryVT().isVector() && ExtType != ISD::NON_EXTLOAD) {
177 if (TLI.isLoadExtLegal(LD->getExtensionType(), LD->getMemoryVT()))
178 return TranslateLegalizeResults(Op, Result);
180 return LegalizeOp(ExpandLoad(Op));
182 } else if (Op.getOpcode() == ISD::STORE) {
183 StoreSDNode *ST = cast<StoreSDNode>(Op.getNode());
184 EVT StVT = ST->getMemoryVT();
185 MVT ValVT = ST->getValue().getSimpleValueType();
186 if (StVT.isVector() && ST->isTruncatingStore())
187 switch (TLI.getTruncStoreAction(ValVT, StVT.getSimpleVT())) {
188 default: llvm_unreachable("This action is not supported yet!");
189 case TargetLowering::Legal:
190 return TranslateLegalizeResults(Op, Result);
191 case TargetLowering::Custom:
193 return TranslateLegalizeResults(Op, TLI.LowerOperation(Result, DAG));
194 case TargetLowering::Expand:
196 return LegalizeOp(ExpandStore(Op));
200 bool HasVectorValue = false;
201 for (SDNode::value_iterator J = Node->value_begin(), E = Node->value_end();
204 HasVectorValue |= J->isVector();
206 return TranslateLegalizeResults(Op, Result);
209 switch (Op.getOpcode()) {
211 return TranslateLegalizeResults(Op, Result);
235 case ISD::CTLZ_ZERO_UNDEF:
236 case ISD::CTTZ_ZERO_UNDEF:
242 case ISD::ZERO_EXTEND:
243 case ISD::ANY_EXTEND:
245 case ISD::SIGN_EXTEND:
246 case ISD::FP_TO_SINT:
247 case ISD::FP_TO_UINT:
264 case ISD::FNEARBYINT:
270 case ISD::SIGN_EXTEND_INREG:
271 QueryType = Node->getValueType(0);
273 case ISD::FP_ROUND_INREG:
274 QueryType = cast<VTSDNode>(Node->getOperand(1))->getVT();
276 case ISD::SINT_TO_FP:
277 case ISD::UINT_TO_FP:
278 QueryType = Node->getOperand(0).getValueType();
282 switch (TLI.getOperationAction(Node->getOpcode(), QueryType)) {
283 case TargetLowering::Promote:
284 Result = Promote(Op);
287 case TargetLowering::Legal:
289 case TargetLowering::Custom: {
290 SDValue Tmp1 = TLI.LowerOperation(Op, DAG);
291 if (Tmp1.getNode()) {
297 case TargetLowering::Expand:
298 if (Node->getOpcode() == ISD::SIGN_EXTEND_INREG)
299 Result = ExpandSEXTINREG(Op);
300 else if (Node->getOpcode() == ISD::BSWAP)
301 Result = ExpandBSWAP(Op);
302 else if (Node->getOpcode() == ISD::VSELECT)
303 Result = ExpandVSELECT(Op);
304 else if (Node->getOpcode() == ISD::SELECT)
305 Result = ExpandSELECT(Op);
306 else if (Node->getOpcode() == ISD::UINT_TO_FP)
307 Result = ExpandUINT_TO_FLOAT(Op);
308 else if (Node->getOpcode() == ISD::FNEG)
309 Result = ExpandFNEG(Op);
310 else if (Node->getOpcode() == ISD::SETCC)
311 Result = UnrollVSETCC(Op);
313 Result = DAG.UnrollVectorOp(Op.getNode());
317 // Make sure that the generated code is itself legal.
319 Result = LegalizeOp(Result);
323 // Note that LegalizeOp may be reentered even from single-use nodes, which
324 // means that we always must cache transformed nodes.
325 AddLegalizedOperand(Op, Result);
329 SDValue VectorLegalizer::Promote(SDValue Op) {
330 // For a few operations there is a specific concept for promotion based on
331 // the operand's type.
332 switch (Op.getOpcode()) {
333 case ISD::SINT_TO_FP:
334 case ISD::UINT_TO_FP:
335 // "Promote" the operation by extending the operand.
336 return PromoteINT_TO_FP(Op);
337 case ISD::FP_TO_UINT:
338 case ISD::FP_TO_SINT:
339 // Promote the operation by extending the operand.
340 return PromoteFP_TO_INT(Op, Op->getOpcode() == ISD::FP_TO_SINT);
343 // The rest of the time, vector "promotion" is basically just bitcasting and
344 // doing the operation in a different type. For example, x86 promotes
345 // ISD::AND on v2i32 to v1i64.
346 MVT VT = Op.getSimpleValueType();
347 assert(Op.getNode()->getNumValues() == 1 &&
348 "Can't promote a vector with multiple results!");
349 MVT NVT = TLI.getTypeToPromoteTo(Op.getOpcode(), VT);
351 SmallVector<SDValue, 4> Operands(Op.getNumOperands());
353 for (unsigned j = 0; j != Op.getNumOperands(); ++j) {
354 if (Op.getOperand(j).getValueType().isVector())
355 Operands[j] = DAG.getNode(ISD::BITCAST, dl, NVT, Op.getOperand(j));
357 Operands[j] = Op.getOperand(j);
360 Op = DAG.getNode(Op.getOpcode(), dl, NVT, Operands);
362 return DAG.getNode(ISD::BITCAST, dl, VT, Op);
365 SDValue VectorLegalizer::PromoteINT_TO_FP(SDValue Op) {
366 // INT_TO_FP operations may require the input operand be promoted even
367 // when the type is otherwise legal.
368 EVT VT = Op.getOperand(0).getValueType();
369 assert(Op.getNode()->getNumValues() == 1 &&
370 "Can't promote a vector with multiple results!");
372 // Normal getTypeToPromoteTo() doesn't work here, as that will promote
373 // by widening the vector w/ the same element width and twice the number
374 // of elements. We want the other way around, the same number of elements,
375 // each twice the width.
377 // Increase the bitwidth of the element to the next pow-of-two
378 // (which is greater than 8 bits).
380 EVT NVT = VT.widenIntegerVectorElementType(*DAG.getContext());
381 assert(NVT.isSimple() && "Promoting to a non-simple vector type!");
383 SmallVector<SDValue, 4> Operands(Op.getNumOperands());
385 unsigned Opc = Op.getOpcode() == ISD::UINT_TO_FP ? ISD::ZERO_EXTEND :
387 for (unsigned j = 0; j != Op.getNumOperands(); ++j) {
388 if (Op.getOperand(j).getValueType().isVector())
389 Operands[j] = DAG.getNode(Opc, dl, NVT, Op.getOperand(j));
391 Operands[j] = Op.getOperand(j);
394 return DAG.getNode(Op.getOpcode(), dl, Op.getValueType(), Operands);
397 // For FP_TO_INT we promote the result type to a vector type with wider
398 // elements and then truncate the result. This is different from the default
399 // PromoteVector which uses bitcast to promote thus assumning that the
400 // promoted vector type has the same overall size.
401 SDValue VectorLegalizer::PromoteFP_TO_INT(SDValue Op, bool isSigned) {
402 assert(Op.getNode()->getNumValues() == 1 &&
403 "Can't promote a vector with multiple results!");
404 EVT VT = Op.getValueType();
409 NewVT = VT.widenIntegerVectorElementType(*DAG.getContext());
410 assert(NewVT.isSimple() && "Promoting to a non-simple vector type!");
411 if (TLI.isOperationLegalOrCustom(ISD::FP_TO_SINT, NewVT)) {
412 NewOpc = ISD::FP_TO_SINT;
415 if (!isSigned && TLI.isOperationLegalOrCustom(ISD::FP_TO_UINT, NewVT)) {
416 NewOpc = ISD::FP_TO_UINT;
422 SDValue promoted = DAG.getNode(NewOpc, SDLoc(Op), NewVT, Op.getOperand(0));
423 return DAG.getNode(ISD::TRUNCATE, SDLoc(Op), VT, promoted);
427 SDValue VectorLegalizer::ExpandLoad(SDValue Op) {
429 LoadSDNode *LD = cast<LoadSDNode>(Op.getNode());
430 SDValue Chain = LD->getChain();
431 SDValue BasePTR = LD->getBasePtr();
432 EVT SrcVT = LD->getMemoryVT();
433 ISD::LoadExtType ExtType = LD->getExtensionType();
435 SmallVector<SDValue, 8> Vals;
436 SmallVector<SDValue, 8> LoadChains;
437 unsigned NumElem = SrcVT.getVectorNumElements();
439 EVT SrcEltVT = SrcVT.getScalarType();
440 EVT DstEltVT = Op.getNode()->getValueType(0).getScalarType();
442 if (SrcVT.getVectorNumElements() > 1 && !SrcEltVT.isByteSized()) {
443 // When elements in a vector is not byte-addressable, we cannot directly
444 // load each element by advancing pointer, which could only address bytes.
445 // Instead, we load all significant words, mask bits off, and concatenate
446 // them to form each element. Finally, they are extended to destination
447 // scalar type to build the destination vector.
448 EVT WideVT = TLI.getPointerTy();
450 assert(WideVT.isRound() &&
451 "Could not handle the sophisticated case when the widest integer is"
453 assert(WideVT.bitsGE(SrcEltVT) &&
454 "Type is not legalized?");
456 unsigned WideBytes = WideVT.getStoreSize();
458 unsigned RemainingBytes = SrcVT.getStoreSize();
459 SmallVector<SDValue, 8> LoadVals;
461 while (RemainingBytes > 0) {
463 unsigned LoadBytes = WideBytes;
465 if (RemainingBytes >= LoadBytes) {
466 ScalarLoad = DAG.getLoad(WideVT, dl, Chain, BasePTR,
467 LD->getPointerInfo().getWithOffset(Offset),
468 LD->isVolatile(), LD->isNonTemporal(),
469 LD->isInvariant(), LD->getAlignment(),
473 while (RemainingBytes < LoadBytes) {
474 LoadBytes >>= 1; // Reduce the load size by half.
475 LoadVT = EVT::getIntegerVT(*DAG.getContext(), LoadBytes << 3);
477 ScalarLoad = DAG.getExtLoad(ISD::EXTLOAD, dl, WideVT, Chain, BasePTR,
478 LD->getPointerInfo().getWithOffset(Offset),
479 LoadVT, LD->isVolatile(),
480 LD->isNonTemporal(), LD->getAlignment(),
484 RemainingBytes -= LoadBytes;
486 BasePTR = DAG.getNode(ISD::ADD, dl, BasePTR.getValueType(), BasePTR,
487 DAG.getConstant(LoadBytes, BasePTR.getValueType()));
489 LoadVals.push_back(ScalarLoad.getValue(0));
490 LoadChains.push_back(ScalarLoad.getValue(1));
493 // Extract bits, pack and extend/trunc them into destination type.
494 unsigned SrcEltBits = SrcEltVT.getSizeInBits();
495 SDValue SrcEltBitMask = DAG.getConstant((1U << SrcEltBits) - 1, WideVT);
497 unsigned BitOffset = 0;
498 unsigned WideIdx = 0;
499 unsigned WideBits = WideVT.getSizeInBits();
501 for (unsigned Idx = 0; Idx != NumElem; ++Idx) {
502 SDValue Lo, Hi, ShAmt;
504 if (BitOffset < WideBits) {
505 ShAmt = DAG.getConstant(BitOffset, TLI.getShiftAmountTy(WideVT));
506 Lo = DAG.getNode(ISD::SRL, dl, WideVT, LoadVals[WideIdx], ShAmt);
507 Lo = DAG.getNode(ISD::AND, dl, WideVT, Lo, SrcEltBitMask);
510 BitOffset += SrcEltBits;
511 if (BitOffset >= WideBits) {
515 ShAmt = DAG.getConstant(SrcEltBits - Offset,
516 TLI.getShiftAmountTy(WideVT));
517 Hi = DAG.getNode(ISD::SHL, dl, WideVT, LoadVals[WideIdx], ShAmt);
518 Hi = DAG.getNode(ISD::AND, dl, WideVT, Hi, SrcEltBitMask);
523 Lo = DAG.getNode(ISD::OR, dl, WideVT, Lo, Hi);
526 default: llvm_unreachable("Unknown extended-load op!");
528 Lo = DAG.getAnyExtOrTrunc(Lo, dl, DstEltVT);
531 Lo = DAG.getZExtOrTrunc(Lo, dl, DstEltVT);
534 ShAmt = DAG.getConstant(WideBits - SrcEltBits,
535 TLI.getShiftAmountTy(WideVT));
536 Lo = DAG.getNode(ISD::SHL, dl, WideVT, Lo, ShAmt);
537 Lo = DAG.getNode(ISD::SRA, dl, WideVT, Lo, ShAmt);
538 Lo = DAG.getSExtOrTrunc(Lo, dl, DstEltVT);
544 unsigned Stride = SrcVT.getScalarType().getSizeInBits()/8;
546 for (unsigned Idx=0; Idx<NumElem; Idx++) {
547 SDValue ScalarLoad = DAG.getExtLoad(ExtType, dl,
548 Op.getNode()->getValueType(0).getScalarType(),
549 Chain, BasePTR, LD->getPointerInfo().getWithOffset(Idx * Stride),
550 SrcVT.getScalarType(),
551 LD->isVolatile(), LD->isNonTemporal(),
552 LD->getAlignment(), LD->getTBAAInfo());
554 BasePTR = DAG.getNode(ISD::ADD, dl, BasePTR.getValueType(), BasePTR,
555 DAG.getConstant(Stride, BasePTR.getValueType()));
557 Vals.push_back(ScalarLoad.getValue(0));
558 LoadChains.push_back(ScalarLoad.getValue(1));
562 SDValue NewChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, LoadChains);
563 SDValue Value = DAG.getNode(ISD::BUILD_VECTOR, dl,
564 Op.getNode()->getValueType(0), Vals);
566 AddLegalizedOperand(Op.getValue(0), Value);
567 AddLegalizedOperand(Op.getValue(1), NewChain);
569 return (Op.getResNo() ? NewChain : Value);
572 SDValue VectorLegalizer::ExpandStore(SDValue Op) {
574 StoreSDNode *ST = cast<StoreSDNode>(Op.getNode());
575 SDValue Chain = ST->getChain();
576 SDValue BasePTR = ST->getBasePtr();
577 SDValue Value = ST->getValue();
578 EVT StVT = ST->getMemoryVT();
580 unsigned Alignment = ST->getAlignment();
581 bool isVolatile = ST->isVolatile();
582 bool isNonTemporal = ST->isNonTemporal();
583 const MDNode *TBAAInfo = ST->getTBAAInfo();
585 unsigned NumElem = StVT.getVectorNumElements();
586 // The type of the data we want to save
587 EVT RegVT = Value.getValueType();
588 EVT RegSclVT = RegVT.getScalarType();
589 // The type of data as saved in memory.
590 EVT MemSclVT = StVT.getScalarType();
592 // Cast floats into integers
593 unsigned ScalarSize = MemSclVT.getSizeInBits();
595 // Round odd types to the next pow of two.
596 if (!isPowerOf2_32(ScalarSize))
597 ScalarSize = NextPowerOf2(ScalarSize);
599 // Store Stride in bytes
600 unsigned Stride = ScalarSize/8;
601 // Extract each of the elements from the original vector
602 // and save them into memory individually.
603 SmallVector<SDValue, 8> Stores;
604 for (unsigned Idx = 0; Idx < NumElem; Idx++) {
605 SDValue Ex = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
606 RegSclVT, Value, DAG.getConstant(Idx, TLI.getVectorIdxTy()));
608 // This scalar TruncStore may be illegal, but we legalize it later.
609 SDValue Store = DAG.getTruncStore(Chain, dl, Ex, BasePTR,
610 ST->getPointerInfo().getWithOffset(Idx*Stride), MemSclVT,
611 isVolatile, isNonTemporal, Alignment, TBAAInfo);
613 BasePTR = DAG.getNode(ISD::ADD, dl, BasePTR.getValueType(), BasePTR,
614 DAG.getConstant(Stride, BasePTR.getValueType()));
616 Stores.push_back(Store);
618 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Stores);
619 AddLegalizedOperand(Op, TF);
623 SDValue VectorLegalizer::ExpandSELECT(SDValue Op) {
624 // Lower a select instruction where the condition is a scalar and the
625 // operands are vectors. Lower this select to VSELECT and implement it
626 // using XOR AND OR. The selector bit is broadcasted.
627 EVT VT = Op.getValueType();
630 SDValue Mask = Op.getOperand(0);
631 SDValue Op1 = Op.getOperand(1);
632 SDValue Op2 = Op.getOperand(2);
634 assert(VT.isVector() && !Mask.getValueType().isVector()
635 && Op1.getValueType() == Op2.getValueType() && "Invalid type");
637 unsigned NumElem = VT.getVectorNumElements();
639 // If we can't even use the basic vector operations of
640 // AND,OR,XOR, we will have to scalarize the op.
641 // Notice that the operation may be 'promoted' which means that it is
642 // 'bitcasted' to another type which is handled.
643 // Also, we need to be able to construct a splat vector using BUILD_VECTOR.
644 if (TLI.getOperationAction(ISD::AND, VT) == TargetLowering::Expand ||
645 TLI.getOperationAction(ISD::XOR, VT) == TargetLowering::Expand ||
646 TLI.getOperationAction(ISD::OR, VT) == TargetLowering::Expand ||
647 TLI.getOperationAction(ISD::BUILD_VECTOR, VT) == TargetLowering::Expand)
648 return DAG.UnrollVectorOp(Op.getNode());
650 // Generate a mask operand.
651 EVT MaskTy = VT.changeVectorElementTypeToInteger();
653 // What is the size of each element in the vector mask.
654 EVT BitTy = MaskTy.getScalarType();
656 Mask = DAG.getSelect(DL, BitTy, Mask,
657 DAG.getConstant(APInt::getAllOnesValue(BitTy.getSizeInBits()), BitTy),
658 DAG.getConstant(0, BitTy));
660 // Broadcast the mask so that the entire vector is all-one or all zero.
661 SmallVector<SDValue, 8> Ops(NumElem, Mask);
662 Mask = DAG.getNode(ISD::BUILD_VECTOR, DL, MaskTy, Ops);
664 // Bitcast the operands to be the same type as the mask.
665 // This is needed when we select between FP types because
666 // the mask is a vector of integers.
667 Op1 = DAG.getNode(ISD::BITCAST, DL, MaskTy, Op1);
668 Op2 = DAG.getNode(ISD::BITCAST, DL, MaskTy, Op2);
670 SDValue AllOnes = DAG.getConstant(
671 APInt::getAllOnesValue(BitTy.getSizeInBits()), MaskTy);
672 SDValue NotMask = DAG.getNode(ISD::XOR, DL, MaskTy, Mask, AllOnes);
674 Op1 = DAG.getNode(ISD::AND, DL, MaskTy, Op1, Mask);
675 Op2 = DAG.getNode(ISD::AND, DL, MaskTy, Op2, NotMask);
676 SDValue Val = DAG.getNode(ISD::OR, DL, MaskTy, Op1, Op2);
677 return DAG.getNode(ISD::BITCAST, DL, Op.getValueType(), Val);
680 SDValue VectorLegalizer::ExpandSEXTINREG(SDValue Op) {
681 EVT VT = Op.getValueType();
683 // Make sure that the SRA and SHL instructions are available.
684 if (TLI.getOperationAction(ISD::SRA, VT) == TargetLowering::Expand ||
685 TLI.getOperationAction(ISD::SHL, VT) == TargetLowering::Expand)
686 return DAG.UnrollVectorOp(Op.getNode());
689 EVT OrigTy = cast<VTSDNode>(Op->getOperand(1))->getVT();
691 unsigned BW = VT.getScalarType().getSizeInBits();
692 unsigned OrigBW = OrigTy.getScalarType().getSizeInBits();
693 SDValue ShiftSz = DAG.getConstant(BW - OrigBW, VT);
695 Op = Op.getOperand(0);
696 Op = DAG.getNode(ISD::SHL, DL, VT, Op, ShiftSz);
697 return DAG.getNode(ISD::SRA, DL, VT, Op, ShiftSz);
700 SDValue VectorLegalizer::ExpandBSWAP(SDValue Op) {
701 EVT VT = Op.getValueType();
703 // Generate a byte wise shuffle mask for the BSWAP.
704 SmallVector<int, 16> ShuffleMask;
705 int ScalarSizeInBytes = VT.getScalarSizeInBits() / 8;
706 for (int I = 0, E = VT.getVectorNumElements(); I != E; ++I)
707 for (int J = ScalarSizeInBytes - 1; J >= 0; --J)
708 ShuffleMask.push_back((I * ScalarSizeInBytes) + J);
710 EVT ByteVT = EVT::getVectorVT(*DAG.getContext(), MVT::i8, ShuffleMask.size());
712 // Only emit a shuffle if the mask is legal.
713 if (!TLI.isShuffleMaskLegal(ShuffleMask, ByteVT))
714 return DAG.UnrollVectorOp(Op.getNode());
717 Op = DAG.getNode(ISD::BITCAST, DL, ByteVT, Op.getOperand(0));
718 Op = DAG.getVectorShuffle(ByteVT, DL, Op, DAG.getUNDEF(ByteVT),
720 return DAG.getNode(ISD::BITCAST, DL, VT, Op);
723 SDValue VectorLegalizer::ExpandVSELECT(SDValue Op) {
724 // Implement VSELECT in terms of XOR, AND, OR
725 // on platforms which do not support blend natively.
728 SDValue Mask = Op.getOperand(0);
729 SDValue Op1 = Op.getOperand(1);
730 SDValue Op2 = Op.getOperand(2);
732 EVT VT = Mask.getValueType();
734 // If we can't even use the basic vector operations of
735 // AND,OR,XOR, we will have to scalarize the op.
736 // Notice that the operation may be 'promoted' which means that it is
737 // 'bitcasted' to another type which is handled.
738 // This operation also isn't safe with AND, OR, XOR when the boolean
739 // type is 0/1 as we need an all ones vector constant to mask with.
740 // FIXME: Sign extend 1 to all ones if thats legal on the target.
741 if (TLI.getOperationAction(ISD::AND, VT) == TargetLowering::Expand ||
742 TLI.getOperationAction(ISD::XOR, VT) == TargetLowering::Expand ||
743 TLI.getOperationAction(ISD::OR, VT) == TargetLowering::Expand ||
744 TLI.getBooleanContents(true) !=
745 TargetLowering::ZeroOrNegativeOneBooleanContent)
746 return DAG.UnrollVectorOp(Op.getNode());
748 // If the mask and the type are different sizes, unroll the vector op. This
749 // can occur when getSetCCResultType returns something that is different in
750 // size from the operand types. For example, v4i8 = select v4i32, v4i8, v4i8.
751 if (VT.getSizeInBits() != Op1.getValueType().getSizeInBits())
752 return DAG.UnrollVectorOp(Op.getNode());
754 // Bitcast the operands to be the same type as the mask.
755 // This is needed when we select between FP types because
756 // the mask is a vector of integers.
757 Op1 = DAG.getNode(ISD::BITCAST, DL, VT, Op1);
758 Op2 = DAG.getNode(ISD::BITCAST, DL, VT, Op2);
760 SDValue AllOnes = DAG.getConstant(
761 APInt::getAllOnesValue(VT.getScalarType().getSizeInBits()), VT);
762 SDValue NotMask = DAG.getNode(ISD::XOR, DL, VT, Mask, AllOnes);
764 Op1 = DAG.getNode(ISD::AND, DL, VT, Op1, Mask);
765 Op2 = DAG.getNode(ISD::AND, DL, VT, Op2, NotMask);
766 SDValue Val = DAG.getNode(ISD::OR, DL, VT, Op1, Op2);
767 return DAG.getNode(ISD::BITCAST, DL, Op.getValueType(), Val);
770 SDValue VectorLegalizer::ExpandUINT_TO_FLOAT(SDValue Op) {
771 EVT VT = Op.getOperand(0).getValueType();
774 // Make sure that the SINT_TO_FP and SRL instructions are available.
775 if (TLI.getOperationAction(ISD::SINT_TO_FP, VT) == TargetLowering::Expand ||
776 TLI.getOperationAction(ISD::SRL, VT) == TargetLowering::Expand)
777 return DAG.UnrollVectorOp(Op.getNode());
779 EVT SVT = VT.getScalarType();
780 assert((SVT.getSizeInBits() == 64 || SVT.getSizeInBits() == 32) &&
781 "Elements in vector-UINT_TO_FP must be 32 or 64 bits wide");
783 unsigned BW = SVT.getSizeInBits();
784 SDValue HalfWord = DAG.getConstant(BW/2, VT);
786 // Constants to clear the upper part of the word.
787 // Notice that we can also use SHL+SHR, but using a constant is slightly
789 uint64_t HWMask = (SVT.getSizeInBits()==64)?0x00000000FFFFFFFF:0x0000FFFF;
790 SDValue HalfWordMask = DAG.getConstant(HWMask, VT);
792 // Two to the power of half-word-size.
793 SDValue TWOHW = DAG.getConstantFP((1<<(BW/2)), Op.getValueType());
795 // Clear upper part of LO, lower HI
796 SDValue HI = DAG.getNode(ISD::SRL, DL, VT, Op.getOperand(0), HalfWord);
797 SDValue LO = DAG.getNode(ISD::AND, DL, VT, Op.getOperand(0), HalfWordMask);
799 // Convert hi and lo to floats
800 // Convert the hi part back to the upper values
801 SDValue fHI = DAG.getNode(ISD::SINT_TO_FP, DL, Op.getValueType(), HI);
802 fHI = DAG.getNode(ISD::FMUL, DL, Op.getValueType(), fHI, TWOHW);
803 SDValue fLO = DAG.getNode(ISD::SINT_TO_FP, DL, Op.getValueType(), LO);
805 // Add the two halves
806 return DAG.getNode(ISD::FADD, DL, Op.getValueType(), fHI, fLO);
810 SDValue VectorLegalizer::ExpandFNEG(SDValue Op) {
811 if (TLI.isOperationLegalOrCustom(ISD::FSUB, Op.getValueType())) {
812 SDValue Zero = DAG.getConstantFP(-0.0, Op.getValueType());
813 return DAG.getNode(ISD::FSUB, SDLoc(Op), Op.getValueType(),
814 Zero, Op.getOperand(0));
816 return DAG.UnrollVectorOp(Op.getNode());
819 SDValue VectorLegalizer::UnrollVSETCC(SDValue Op) {
820 EVT VT = Op.getValueType();
821 unsigned NumElems = VT.getVectorNumElements();
822 EVT EltVT = VT.getVectorElementType();
823 SDValue LHS = Op.getOperand(0), RHS = Op.getOperand(1), CC = Op.getOperand(2);
824 EVT TmpEltVT = LHS.getValueType().getVectorElementType();
826 SmallVector<SDValue, 8> Ops(NumElems);
827 for (unsigned i = 0; i < NumElems; ++i) {
828 SDValue LHSElem = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, TmpEltVT, LHS,
829 DAG.getConstant(i, TLI.getVectorIdxTy()));
830 SDValue RHSElem = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, TmpEltVT, RHS,
831 DAG.getConstant(i, TLI.getVectorIdxTy()));
832 Ops[i] = DAG.getNode(ISD::SETCC, dl,
833 TLI.getSetCCResultType(*DAG.getContext(), TmpEltVT),
834 LHSElem, RHSElem, CC);
835 Ops[i] = DAG.getSelect(dl, EltVT, Ops[i],
836 DAG.getConstant(APInt::getAllOnesValue
837 (EltVT.getSizeInBits()), EltVT),
838 DAG.getConstant(0, EltVT));
840 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, Ops);
845 bool SelectionDAG::LegalizeVectors() {
846 return VectorLegalizer(*this).Run();