2009-05-23 20:35:30 +08:00
|
|
|
//===-- LegalizeVectorOps.cpp - Implement SelectionDAG::LegalizeVectors ---===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file implements the SelectionDAG::LegalizeVectors method.
|
|
|
|
//
|
|
|
|
// The vector legalizer looks for vector operations which might need to be
|
2009-05-27 15:58:35 +08:00
|
|
|
// scalarized and legalizes them. This is a separate step from Legalize because
|
|
|
|
// scalarizing can introduce illegal types. For example, suppose we have an
|
2009-05-23 20:35:30 +08:00
|
|
|
// ISD::SDIV of type v2i64 on x86-32. The type is legal (for example, addition
|
|
|
|
// on a v2i64 is legal), but ISD::SDIV isn't legal, so we have to unroll the
|
|
|
|
// operation, which introduces nodes with the illegal type i64 which must be
|
|
|
|
// expanded. Similarly, suppose we have an ISD::SRA of type v16i8 on PowerPC;
|
|
|
|
// the operation must be unrolled, which introduces nodes with the illegal
|
|
|
|
// type i8 which must be promoted.
|
|
|
|
//
|
|
|
|
// This does not legalize vector manipulations like ISD::BUILD_VECTOR,
|
Major calling convention code refactoring.
Instead of awkwardly encoding calling-convention information with ISD::CALL,
ISD::FORMAL_ARGUMENTS, ISD::RET, and ISD::ARG_FLAGS nodes, TargetLowering
provides three virtual functions for targets to override:
LowerFormalArguments, LowerCall, and LowerRet, which replace the custom
lowering done on the special nodes. They provide the same information, but
in a more immediately usable format.
This also reworks much of the target-independent tail call logic. The
decision of whether or not to perform a tail call is now cleanly split
between target-independent portions, and the target dependent portion
in IsEligibleForTailCallOptimization.
This also synchronizes all in-tree targets, to help enable future
refactoring and feature work.
llvm-svn: 78142
2009-08-05 09:29:28 +08:00
|
|
|
// or operations that happen to take a vector which are custom-lowered;
|
|
|
|
// the legalization for such operations never produces nodes
|
2009-05-23 20:35:30 +08:00
|
|
|
// with illegal types, so it's okay to put off legalizing them until
|
|
|
|
// SelectionDAG::Legalize runs.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm/CodeGen/SelectionDAG.h"
|
|
|
|
#include "llvm/Target/TargetLowering.h"
|
|
|
|
using namespace llvm;
|
|
|
|
|
|
|
|
namespace {
|
|
|
|
class VectorLegalizer {
|
|
|
|
SelectionDAG& DAG;
|
2010-04-17 23:26:15 +08:00
|
|
|
const TargetLowering &TLI;
|
2009-05-23 20:35:30 +08:00
|
|
|
bool Changed; // Keep track of whether anything changed
|
|
|
|
|
|
|
|
/// LegalizedNodes - For nodes that are of legal width, and that have more
|
|
|
|
/// than one use, this map indicates what regularized operand to use. This
|
|
|
|
/// allows us to avoid legalizing the same thing more than once.
|
2013-01-25 23:18:54 +08:00
|
|
|
SmallDenseMap<SDValue, SDValue, 64> LegalizedNodes;
|
2009-05-23 20:35:30 +08:00
|
|
|
|
|
|
|
// Adds a node to the translation cache
|
|
|
|
void AddLegalizedOperand(SDValue From, SDValue To) {
|
|
|
|
LegalizedNodes.insert(std::make_pair(From, To));
|
|
|
|
// If someone requests legalization of the new node, return itself.
|
|
|
|
if (From != To)
|
|
|
|
LegalizedNodes.insert(std::make_pair(To, To));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Legalizes the given node
|
|
|
|
SDValue LegalizeOp(SDValue Op);
|
|
|
|
// Assuming the node is legal, "legalize" the results
|
|
|
|
SDValue TranslateLegalizeResults(SDValue Op, SDValue Result);
|
|
|
|
// Implements unrolling a VSETCC.
|
|
|
|
SDValue UnrollVSETCC(SDValue Op);
|
|
|
|
// Implements expansion for FNEG; falls back to UnrollVectorOp if FSUB
|
|
|
|
// isn't legal.
|
2011-03-19 21:09:10 +08:00
|
|
|
// Implements expansion for UINT_TO_FLOAT; falls back to UnrollVectorOp if
|
|
|
|
// SINT_TO_FLOAT and SHR on vectors isn't legal.
|
|
|
|
SDValue ExpandUINT_TO_FLOAT(SDValue Op);
|
2013-01-12 06:57:48 +08:00
|
|
|
// Implement expansion for SIGN_EXTEND_INREG using SRL and SRA.
|
|
|
|
SDValue ExpandSEXTINREG(SDValue Op);
|
2011-09-18 18:29:29 +08:00
|
|
|
// Implement vselect in terms of XOR, AND, OR when blend is not supported
|
|
|
|
// by the target.
|
2011-09-14 03:17:42 +08:00
|
|
|
SDValue ExpandVSELECT(SDValue Op);
|
2012-08-31 03:17:29 +08:00
|
|
|
SDValue ExpandSELECT(SDValue Op);
|
2011-10-15 15:41:10 +08:00
|
|
|
SDValue ExpandLoad(SDValue Op);
|
|
|
|
SDValue ExpandStore(SDValue Op);
|
2009-05-23 20:35:30 +08:00
|
|
|
SDValue ExpandFNEG(SDValue Op);
|
|
|
|
// Implements vector promotion; this is essentially just bitcasting the
|
|
|
|
// operands to a different type and bitcasting the result back to the
|
|
|
|
// original type.
|
|
|
|
SDValue PromoteVectorOp(SDValue Op);
|
2012-06-29 05:03:44 +08:00
|
|
|
// Implements [SU]INT_TO_FP vector promotion; this is a [zs]ext of the input
|
|
|
|
// operand to the next size up.
|
|
|
|
SDValue PromoteVectorOpINT_TO_FP(SDValue Op);
|
2009-05-23 20:35:30 +08:00
|
|
|
|
|
|
|
public:
|
|
|
|
bool Run();
|
|
|
|
VectorLegalizer(SelectionDAG& dag) :
|
|
|
|
DAG(dag), TLI(dag.getTargetLoweringInfo()), Changed(false) {}
|
|
|
|
};
|
|
|
|
|
|
|
|
bool VectorLegalizer::Run() {
|
2013-02-23 07:33:30 +08:00
|
|
|
// Before we start legalizing vector nodes, check if there are any vectors.
|
|
|
|
bool HasVectors = false;
|
|
|
|
for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(),
|
|
|
|
E = prior(DAG.allnodes_end()); I != llvm::next(E); ++I) {
|
|
|
|
// Check if the values of the nodes contain vectors. We don't need to check
|
|
|
|
// the operands because we are going to check their values at some point.
|
|
|
|
for (SDNode::value_iterator J = I->value_begin(), E = I->value_end();
|
|
|
|
J != E; ++J)
|
|
|
|
HasVectors |= J->isVector();
|
|
|
|
|
|
|
|
// If we found a vector node we can start the legalization.
|
|
|
|
if (HasVectors)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
// If this basic block has no vectors then no need to legalize vectors.
|
|
|
|
if (!HasVectors)
|
|
|
|
return false;
|
|
|
|
|
2009-05-23 20:35:30 +08:00
|
|
|
// The legalize process is inherently a bottom-up recursive process (users
|
|
|
|
// legalize their uses before themselves). Given infinite stack space, we
|
|
|
|
// could just start legalizing on the root and traverse the whole graph. In
|
|
|
|
// practice however, this causes us to run out of stack space on large basic
|
|
|
|
// blocks. To avoid this problem, compute an ordering of the nodes where each
|
|
|
|
// node is only legalized after all of its operands are legalized.
|
|
|
|
DAG.AssignTopologicalOrder();
|
|
|
|
for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(),
|
2009-12-03 08:50:42 +08:00
|
|
|
E = prior(DAG.allnodes_end()); I != llvm::next(E); ++I)
|
2009-05-23 20:35:30 +08:00
|
|
|
LegalizeOp(SDValue(I, 0));
|
|
|
|
|
|
|
|
// Finally, it's possible the root changed. Get the new root.
|
|
|
|
SDValue OldRoot = DAG.getRoot();
|
|
|
|
assert(LegalizedNodes.count(OldRoot) && "Root didn't get legalized?");
|
|
|
|
DAG.setRoot(LegalizedNodes[OldRoot]);
|
|
|
|
|
|
|
|
LegalizedNodes.clear();
|
|
|
|
|
|
|
|
// Remove dead nodes now.
|
|
|
|
DAG.RemoveDeadNodes();
|
|
|
|
|
|
|
|
return Changed;
|
|
|
|
}
|
|
|
|
|
|
|
|
SDValue VectorLegalizer::TranslateLegalizeResults(SDValue Op, SDValue Result) {
|
|
|
|
// Generic legalization: just pass the operand through.
|
|
|
|
for (unsigned i = 0, e = Op.getNode()->getNumValues(); i != e; ++i)
|
|
|
|
AddLegalizedOperand(Op.getValue(i), Result.getValue(i));
|
|
|
|
return Result.getValue(Op.getResNo());
|
|
|
|
}
|
|
|
|
|
|
|
|
SDValue VectorLegalizer::LegalizeOp(SDValue Op) {
|
|
|
|
// Note that LegalizeOp may be reentered even from single-use nodes, which
|
|
|
|
// means that we always must cache transformed nodes.
|
|
|
|
DenseMap<SDValue, SDValue>::iterator I = LegalizedNodes.find(Op);
|
|
|
|
if (I != LegalizedNodes.end()) return I->second;
|
|
|
|
|
|
|
|
SDNode* Node = Op.getNode();
|
|
|
|
|
|
|
|
// Legalize the operands
|
|
|
|
SmallVector<SDValue, 8> Ops;
|
|
|
|
for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
|
|
|
|
Ops.push_back(LegalizeOp(Node->getOperand(i)));
|
|
|
|
|
|
|
|
SDValue Result =
|
2010-06-18 23:30:29 +08:00
|
|
|
SDValue(DAG.UpdateNodeOperands(Op.getNode(), Ops.data(), Ops.size()), 0);
|
2009-05-23 20:35:30 +08:00
|
|
|
|
2011-10-15 15:41:10 +08:00
|
|
|
if (Op.getOpcode() == ISD::LOAD) {
|
|
|
|
LoadSDNode *LD = cast<LoadSDNode>(Op.getNode());
|
|
|
|
ISD::LoadExtType ExtType = LD->getExtensionType();
|
|
|
|
if (LD->getMemoryVT().isVector() && ExtType != ISD::NON_EXTLOAD) {
|
|
|
|
if (TLI.isLoadExtLegal(LD->getExtensionType(), LD->getMemoryVT()))
|
|
|
|
return TranslateLegalizeResults(Op, Result);
|
|
|
|
Changed = true;
|
|
|
|
return LegalizeOp(ExpandLoad(Op));
|
|
|
|
}
|
|
|
|
} else if (Op.getOpcode() == ISD::STORE) {
|
|
|
|
StoreSDNode *ST = cast<StoreSDNode>(Op.getNode());
|
|
|
|
EVT StVT = ST->getMemoryVT();
|
2012-12-19 16:28:51 +08:00
|
|
|
MVT ValVT = ST->getValue().getSimpleValueType();
|
2011-10-15 15:41:10 +08:00
|
|
|
if (StVT.isVector() && ST->isTruncatingStore())
|
2012-12-19 16:28:51 +08:00
|
|
|
switch (TLI.getTruncStoreAction(ValVT, StVT.getSimpleVT())) {
|
2012-02-05 16:31:47 +08:00
|
|
|
default: llvm_unreachable("This action is not supported yet!");
|
2011-10-15 15:41:10 +08:00
|
|
|
case TargetLowering::Legal:
|
|
|
|
return TranslateLegalizeResults(Op, Result);
|
|
|
|
case TargetLowering::Custom:
|
|
|
|
Changed = true;
|
2013-08-22 06:42:58 +08:00
|
|
|
return TranslateLegalizeResults(Op, TLI.LowerOperation(Result, DAG));
|
2011-10-15 15:41:10 +08:00
|
|
|
case TargetLowering::Expand:
|
|
|
|
Changed = true;
|
|
|
|
return LegalizeOp(ExpandStore(Op));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-05-23 20:35:30 +08:00
|
|
|
bool HasVectorValue = false;
|
|
|
|
for (SDNode::value_iterator J = Node->value_begin(), E = Node->value_end();
|
|
|
|
J != E;
|
|
|
|
++J)
|
|
|
|
HasVectorValue |= J->isVector();
|
|
|
|
if (!HasVectorValue)
|
|
|
|
return TranslateLegalizeResults(Op, Result);
|
|
|
|
|
2009-08-11 06:56:29 +08:00
|
|
|
EVT QueryType;
|
2009-05-23 20:35:30 +08:00
|
|
|
switch (Op.getOpcode()) {
|
|
|
|
default:
|
|
|
|
return TranslateLegalizeResults(Op, Result);
|
|
|
|
case ISD::ADD:
|
|
|
|
case ISD::SUB:
|
|
|
|
case ISD::MUL:
|
|
|
|
case ISD::SDIV:
|
|
|
|
case ISD::UDIV:
|
|
|
|
case ISD::SREM:
|
|
|
|
case ISD::UREM:
|
|
|
|
case ISD::FADD:
|
|
|
|
case ISD::FSUB:
|
|
|
|
case ISD::FMUL:
|
|
|
|
case ISD::FDIV:
|
|
|
|
case ISD::FREM:
|
|
|
|
case ISD::AND:
|
|
|
|
case ISD::OR:
|
|
|
|
case ISD::XOR:
|
|
|
|
case ISD::SHL:
|
|
|
|
case ISD::SRA:
|
|
|
|
case ISD::SRL:
|
|
|
|
case ISD::ROTL:
|
|
|
|
case ISD::ROTR:
|
|
|
|
case ISD::CTLZ:
|
2011-12-13 09:56:10 +08:00
|
|
|
case ISD::CTTZ:
|
|
|
|
case ISD::CTLZ_ZERO_UNDEF:
|
|
|
|
case ISD::CTTZ_ZERO_UNDEF:
|
2009-05-23 20:35:30 +08:00
|
|
|
case ISD::CTPOP:
|
|
|
|
case ISD::SELECT:
|
2011-09-14 03:17:42 +08:00
|
|
|
case ISD::VSELECT:
|
2009-05-23 20:35:30 +08:00
|
|
|
case ISD::SELECT_CC:
|
2011-09-07 03:07:46 +08:00
|
|
|
case ISD::SETCC:
|
2009-05-23 20:35:30 +08:00
|
|
|
case ISD::ZERO_EXTEND:
|
|
|
|
case ISD::ANY_EXTEND:
|
|
|
|
case ISD::TRUNCATE:
|
|
|
|
case ISD::SIGN_EXTEND:
|
|
|
|
case ISD::FP_TO_SINT:
|
|
|
|
case ISD::FP_TO_UINT:
|
|
|
|
case ISD::FNEG:
|
|
|
|
case ISD::FABS:
|
Add a llvm.copysign intrinsic
This adds a llvm.copysign intrinsic; We already have Libfunc recognition for
copysign (which is turned into the FCOPYSIGN SDAG node). In order to
autovectorize calls to copysign in the loop vectorizer, we need a corresponding
intrinsic as well.
In addition to the expected changes to the language reference, the loop
vectorizer, BasicTTI, and the SDAG builder (the intrinsic is transformed into
an FCOPYSIGN node, just like the function call), this also adds FCOPYSIGN to a
few lists in LegalizeVector{Ops,Types} so that vector copysigns can be
expanded.
In TargetLoweringBase::initActions, I've made the default action for FCOPYSIGN
be Expand for vector types. This seems correct for all in-tree targets, and I
think is the right thing to do because, previously, there was no way to generate
vector-values FCOPYSIGN nodes (and most targets don't specify an action for
vector-typed FCOPYSIGN).
llvm-svn: 188728
2013-08-20 07:35:46 +08:00
|
|
|
case ISD::FCOPYSIGN:
|
2009-05-23 20:35:30 +08:00
|
|
|
case ISD::FSQRT:
|
|
|
|
case ISD::FSIN:
|
|
|
|
case ISD::FCOS:
|
|
|
|
case ISD::FPOWI:
|
|
|
|
case ISD::FPOW:
|
|
|
|
case ISD::FLOG:
|
|
|
|
case ISD::FLOG2:
|
|
|
|
case ISD::FLOG10:
|
|
|
|
case ISD::FEXP:
|
|
|
|
case ISD::FEXP2:
|
|
|
|
case ISD::FCEIL:
|
|
|
|
case ISD::FTRUNC:
|
|
|
|
case ISD::FRINT:
|
|
|
|
case ISD::FNEARBYINT:
|
2013-08-08 06:49:12 +08:00
|
|
|
case ISD::FROUND:
|
2009-05-23 20:35:30 +08:00
|
|
|
case ISD::FFLOOR:
|
2012-11-16 06:44:27 +08:00
|
|
|
case ISD::FP_ROUND:
|
2012-11-17 09:52:46 +08:00
|
|
|
case ISD::FP_EXTEND:
|
2012-08-30 15:34:22 +08:00
|
|
|
case ISD::FMA:
|
2011-07-14 19:11:14 +08:00
|
|
|
case ISD::SIGN_EXTEND_INREG:
|
2009-06-06 11:27:50 +08:00
|
|
|
QueryType = Node->getValueType(0);
|
|
|
|
break;
|
2010-01-09 10:13:55 +08:00
|
|
|
case ISD::FP_ROUND_INREG:
|
|
|
|
QueryType = cast<VTSDNode>(Node->getOperand(1))->getVT();
|
|
|
|
break;
|
2009-06-06 11:27:50 +08:00
|
|
|
case ISD::SINT_TO_FP:
|
|
|
|
case ISD::UINT_TO_FP:
|
|
|
|
QueryType = Node->getOperand(0).getValueType();
|
2009-05-23 20:35:30 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2009-06-06 11:27:50 +08:00
|
|
|
switch (TLI.getOperationAction(Node->getOpcode(), QueryType)) {
|
2009-05-23 20:35:30 +08:00
|
|
|
case TargetLowering::Promote:
|
2012-06-29 05:03:44 +08:00
|
|
|
switch (Op.getOpcode()) {
|
|
|
|
default:
|
|
|
|
// "Promote" the operation by bitcasting
|
|
|
|
Result = PromoteVectorOp(Op);
|
|
|
|
Changed = true;
|
|
|
|
break;
|
|
|
|
case ISD::SINT_TO_FP:
|
|
|
|
case ISD::UINT_TO_FP:
|
|
|
|
// "Promote" the operation by extending the operand.
|
|
|
|
Result = PromoteVectorOpINT_TO_FP(Op);
|
|
|
|
Changed = true;
|
|
|
|
break;
|
|
|
|
}
|
2009-05-23 20:35:30 +08:00
|
|
|
break;
|
|
|
|
case TargetLowering::Legal: break;
|
|
|
|
case TargetLowering::Custom: {
|
|
|
|
SDValue Tmp1 = TLI.LowerOperation(Op, DAG);
|
|
|
|
if (Tmp1.getNode()) {
|
|
|
|
Result = Tmp1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
// FALL THROUGH
|
|
|
|
}
|
|
|
|
case TargetLowering::Expand:
|
2013-01-12 06:57:48 +08:00
|
|
|
if (Node->getOpcode() == ISD::SIGN_EXTEND_INREG)
|
|
|
|
Result = ExpandSEXTINREG(Op);
|
|
|
|
else if (Node->getOpcode() == ISD::VSELECT)
|
2011-09-14 03:17:42 +08:00
|
|
|
Result = ExpandVSELECT(Op);
|
2012-08-31 03:17:29 +08:00
|
|
|
else if (Node->getOpcode() == ISD::SELECT)
|
|
|
|
Result = ExpandSELECT(Op);
|
2011-09-14 03:17:42 +08:00
|
|
|
else if (Node->getOpcode() == ISD::UINT_TO_FP)
|
2011-03-19 21:09:10 +08:00
|
|
|
Result = ExpandUINT_TO_FLOAT(Op);
|
|
|
|
else if (Node->getOpcode() == ISD::FNEG)
|
2009-05-23 20:35:30 +08:00
|
|
|
Result = ExpandFNEG(Op);
|
2011-09-07 03:07:46 +08:00
|
|
|
else if (Node->getOpcode() == ISD::SETCC)
|
2009-05-23 20:35:30 +08:00
|
|
|
Result = UnrollVSETCC(Op);
|
|
|
|
else
|
2009-11-30 10:42:02 +08:00
|
|
|
Result = DAG.UnrollVectorOp(Op.getNode());
|
2009-05-23 20:35:30 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Make sure that the generated code is itself legal.
|
|
|
|
if (Result != Op) {
|
|
|
|
Result = LegalizeOp(Result);
|
|
|
|
Changed = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Note that LegalizeOp may be reentered even from single-use nodes, which
|
|
|
|
// means that we always must cache transformed nodes.
|
|
|
|
AddLegalizedOperand(Op, Result);
|
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
|
|
|
SDValue VectorLegalizer::PromoteVectorOp(SDValue Op) {
|
2009-05-25 04:32:10 +08:00
|
|
|
// Vector "promotion" is basically just bitcasting and doing the operation
|
|
|
|
// in a different type. For example, x86 promotes ISD::AND on v2i32 to
|
|
|
|
// v1i64.
|
2012-12-19 19:21:04 +08:00
|
|
|
MVT VT = Op.getSimpleValueType();
|
2009-05-23 20:35:30 +08:00
|
|
|
assert(Op.getNode()->getNumValues() == 1 &&
|
|
|
|
"Can't promote a vector with multiple results!");
|
2012-12-19 19:21:04 +08:00
|
|
|
MVT NVT = TLI.getTypeToPromoteTo(Op.getOpcode(), VT);
|
2013-05-29 00:31:26 +08:00
|
|
|
SDLoc dl(Op);
|
2009-05-23 20:35:30 +08:00
|
|
|
SmallVector<SDValue, 4> Operands(Op.getNumOperands());
|
|
|
|
|
|
|
|
for (unsigned j = 0; j != Op.getNumOperands(); ++j) {
|
|
|
|
if (Op.getOperand(j).getValueType().isVector())
|
2010-11-23 11:31:01 +08:00
|
|
|
Operands[j] = DAG.getNode(ISD::BITCAST, dl, NVT, Op.getOperand(j));
|
2009-05-23 20:35:30 +08:00
|
|
|
else
|
|
|
|
Operands[j] = Op.getOperand(j);
|
|
|
|
}
|
|
|
|
|
|
|
|
Op = DAG.getNode(Op.getOpcode(), dl, NVT, &Operands[0], Operands.size());
|
|
|
|
|
2010-11-23 11:31:01 +08:00
|
|
|
return DAG.getNode(ISD::BITCAST, dl, VT, Op);
|
2009-05-23 20:35:30 +08:00
|
|
|
}
|
|
|
|
|
2012-06-29 05:03:44 +08:00
|
|
|
SDValue VectorLegalizer::PromoteVectorOpINT_TO_FP(SDValue Op) {
|
|
|
|
// INT_TO_FP operations may require the input operand be promoted even
|
|
|
|
// when the type is otherwise legal.
|
|
|
|
EVT VT = Op.getOperand(0).getValueType();
|
|
|
|
assert(Op.getNode()->getNumValues() == 1 &&
|
|
|
|
"Can't promote a vector with multiple results!");
|
|
|
|
|
|
|
|
// Normal getTypeToPromoteTo() doesn't work here, as that will promote
|
|
|
|
// by widening the vector w/ the same element width and twice the number
|
|
|
|
// of elements. We want the other way around, the same number of elements,
|
|
|
|
// each twice the width.
|
|
|
|
//
|
|
|
|
// Increase the bitwidth of the element to the next pow-of-two
|
|
|
|
// (which is greater than 8 bits).
|
|
|
|
unsigned NumElts = VT.getVectorNumElements();
|
|
|
|
EVT EltVT = VT.getVectorElementType();
|
|
|
|
EltVT = EVT::getIntegerVT(*DAG.getContext(), 2 * EltVT.getSizeInBits());
|
|
|
|
assert(EltVT.isSimple() && "Promoting to a non-simple vector type!");
|
|
|
|
|
|
|
|
// Build a new vector type and check if it is legal.
|
|
|
|
MVT NVT = MVT::getVectorVT(EltVT.getSimpleVT(), NumElts);
|
|
|
|
|
2013-05-29 00:31:26 +08:00
|
|
|
SDLoc dl(Op);
|
2012-06-29 05:03:44 +08:00
|
|
|
SmallVector<SDValue, 4> Operands(Op.getNumOperands());
|
|
|
|
|
|
|
|
unsigned Opc = Op.getOpcode() == ISD::UINT_TO_FP ? ISD::ZERO_EXTEND :
|
|
|
|
ISD::SIGN_EXTEND;
|
|
|
|
for (unsigned j = 0; j != Op.getNumOperands(); ++j) {
|
|
|
|
if (Op.getOperand(j).getValueType().isVector())
|
|
|
|
Operands[j] = DAG.getNode(Opc, dl, NVT, Op.getOperand(j));
|
|
|
|
else
|
|
|
|
Operands[j] = Op.getOperand(j);
|
|
|
|
}
|
|
|
|
|
|
|
|
return DAG.getNode(Op.getOpcode(), dl, Op.getValueType(), &Operands[0],
|
|
|
|
Operands.size());
|
|
|
|
}
|
|
|
|
|
2011-10-15 15:41:10 +08:00
|
|
|
|
|
|
|
SDValue VectorLegalizer::ExpandLoad(SDValue Op) {
|
2013-05-29 00:31:26 +08:00
|
|
|
SDLoc dl(Op);
|
2011-10-15 15:41:10 +08:00
|
|
|
LoadSDNode *LD = cast<LoadSDNode>(Op.getNode());
|
|
|
|
SDValue Chain = LD->getChain();
|
|
|
|
SDValue BasePTR = LD->getBasePtr();
|
|
|
|
EVT SrcVT = LD->getMemoryVT();
|
2011-10-19 06:32:43 +08:00
|
|
|
ISD::LoadExtType ExtType = LD->getExtensionType();
|
2011-10-15 15:41:10 +08:00
|
|
|
|
2013-02-21 02:04:21 +08:00
|
|
|
SmallVector<SDValue, 8> Vals;
|
2011-10-15 15:41:10 +08:00
|
|
|
SmallVector<SDValue, 8> LoadChains;
|
|
|
|
unsigned NumElem = SrcVT.getVectorNumElements();
|
|
|
|
|
2013-02-21 02:04:21 +08:00
|
|
|
EVT SrcEltVT = SrcVT.getScalarType();
|
|
|
|
EVT DstEltVT = Op.getNode()->getValueType(0).getScalarType();
|
|
|
|
|
|
|
|
if (SrcVT.getVectorNumElements() > 1 && !SrcEltVT.isByteSized()) {
|
|
|
|
// When elements in a vector is not byte-addressable, we cannot directly
|
|
|
|
// load each element by advancing pointer, which could only address bytes.
|
|
|
|
// Instead, we load all significant words, mask bits off, and concatenate
|
|
|
|
// them to form each element. Finally, they are extended to destination
|
|
|
|
// scalar type to build the destination vector.
|
|
|
|
EVT WideVT = TLI.getPointerTy();
|
|
|
|
|
|
|
|
assert(WideVT.isRound() &&
|
|
|
|
"Could not handle the sophisticated case when the widest integer is"
|
|
|
|
" not power of 2.");
|
|
|
|
assert(WideVT.bitsGE(SrcEltVT) &&
|
|
|
|
"Type is not legalized?");
|
|
|
|
|
|
|
|
unsigned WideBytes = WideVT.getStoreSize();
|
|
|
|
unsigned Offset = 0;
|
|
|
|
unsigned RemainingBytes = SrcVT.getStoreSize();
|
|
|
|
SmallVector<SDValue, 8> LoadVals;
|
|
|
|
|
|
|
|
while (RemainingBytes > 0) {
|
|
|
|
SDValue ScalarLoad;
|
|
|
|
unsigned LoadBytes = WideBytes;
|
|
|
|
|
|
|
|
if (RemainingBytes >= LoadBytes) {
|
|
|
|
ScalarLoad = DAG.getLoad(WideVT, dl, Chain, BasePTR,
|
|
|
|
LD->getPointerInfo().getWithOffset(Offset),
|
|
|
|
LD->isVolatile(), LD->isNonTemporal(),
|
2013-10-28 19:17:59 +08:00
|
|
|
LD->isInvariant(), LD->getAlignment(),
|
|
|
|
LD->getTBAAInfo());
|
2013-02-21 02:04:21 +08:00
|
|
|
} else {
|
|
|
|
EVT LoadVT = WideVT;
|
|
|
|
while (RemainingBytes < LoadBytes) {
|
|
|
|
LoadBytes >>= 1; // Reduce the load size by half.
|
|
|
|
LoadVT = EVT::getIntegerVT(*DAG.getContext(), LoadBytes << 3);
|
|
|
|
}
|
|
|
|
ScalarLoad = DAG.getExtLoad(ISD::EXTLOAD, dl, WideVT, Chain, BasePTR,
|
|
|
|
LD->getPointerInfo().getWithOffset(Offset),
|
|
|
|
LoadVT, LD->isVolatile(),
|
2013-10-28 19:17:59 +08:00
|
|
|
LD->isNonTemporal(), LD->getAlignment(),
|
|
|
|
LD->getTBAAInfo());
|
2013-02-21 02:04:21 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
RemainingBytes -= LoadBytes;
|
|
|
|
Offset += LoadBytes;
|
|
|
|
BasePTR = DAG.getNode(ISD::ADD, dl, BasePTR.getValueType(), BasePTR,
|
2013-08-26 23:06:10 +08:00
|
|
|
DAG.getConstant(LoadBytes, BasePTR.getValueType()));
|
2013-02-21 02:04:21 +08:00
|
|
|
|
|
|
|
LoadVals.push_back(ScalarLoad.getValue(0));
|
|
|
|
LoadChains.push_back(ScalarLoad.getValue(1));
|
|
|
|
}
|
2011-10-15 15:41:10 +08:00
|
|
|
|
2013-02-21 02:04:21 +08:00
|
|
|
// Extract bits, pack and extend/trunc them into destination type.
|
|
|
|
unsigned SrcEltBits = SrcEltVT.getSizeInBits();
|
|
|
|
SDValue SrcEltBitMask = DAG.getConstant((1U << SrcEltBits) - 1, WideVT);
|
2011-10-19 06:32:43 +08:00
|
|
|
|
2013-02-21 02:04:21 +08:00
|
|
|
unsigned BitOffset = 0;
|
|
|
|
unsigned WideIdx = 0;
|
|
|
|
unsigned WideBits = WideVT.getSizeInBits();
|
|
|
|
|
|
|
|
for (unsigned Idx = 0; Idx != NumElem; ++Idx) {
|
|
|
|
SDValue Lo, Hi, ShAmt;
|
|
|
|
|
|
|
|
if (BitOffset < WideBits) {
|
|
|
|
ShAmt = DAG.getConstant(BitOffset, TLI.getShiftAmountTy(WideVT));
|
|
|
|
Lo = DAG.getNode(ISD::SRL, dl, WideVT, LoadVals[WideIdx], ShAmt);
|
|
|
|
Lo = DAG.getNode(ISD::AND, dl, WideVT, Lo, SrcEltBitMask);
|
|
|
|
}
|
|
|
|
|
|
|
|
BitOffset += SrcEltBits;
|
|
|
|
if (BitOffset >= WideBits) {
|
|
|
|
WideIdx++;
|
|
|
|
Offset -= WideBits;
|
|
|
|
if (Offset > 0) {
|
|
|
|
ShAmt = DAG.getConstant(SrcEltBits - Offset,
|
|
|
|
TLI.getShiftAmountTy(WideVT));
|
|
|
|
Hi = DAG.getNode(ISD::SHL, dl, WideVT, LoadVals[WideIdx], ShAmt);
|
|
|
|
Hi = DAG.getNode(ISD::AND, dl, WideVT, Hi, SrcEltBitMask);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (Hi.getNode())
|
|
|
|
Lo = DAG.getNode(ISD::OR, dl, WideVT, Lo, Hi);
|
|
|
|
|
|
|
|
switch (ExtType) {
|
|
|
|
default: llvm_unreachable("Unknown extended-load op!");
|
|
|
|
case ISD::EXTLOAD:
|
|
|
|
Lo = DAG.getAnyExtOrTrunc(Lo, dl, DstEltVT);
|
|
|
|
break;
|
|
|
|
case ISD::ZEXTLOAD:
|
|
|
|
Lo = DAG.getZExtOrTrunc(Lo, dl, DstEltVT);
|
|
|
|
break;
|
|
|
|
case ISD::SEXTLOAD:
|
|
|
|
ShAmt = DAG.getConstant(WideBits - SrcEltBits,
|
|
|
|
TLI.getShiftAmountTy(WideVT));
|
|
|
|
Lo = DAG.getNode(ISD::SHL, dl, WideVT, Lo, ShAmt);
|
|
|
|
Lo = DAG.getNode(ISD::SRA, dl, WideVT, Lo, ShAmt);
|
|
|
|
Lo = DAG.getSExtOrTrunc(Lo, dl, DstEltVT);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
Vals.push_back(Lo);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
unsigned Stride = SrcVT.getScalarType().getSizeInBits()/8;
|
|
|
|
|
|
|
|
for (unsigned Idx=0; Idx<NumElem; Idx++) {
|
|
|
|
SDValue ScalarLoad = DAG.getExtLoad(ExtType, dl,
|
|
|
|
Op.getNode()->getValueType(0).getScalarType(),
|
|
|
|
Chain, BasePTR, LD->getPointerInfo().getWithOffset(Idx * Stride),
|
|
|
|
SrcVT.getScalarType(),
|
|
|
|
LD->isVolatile(), LD->isNonTemporal(),
|
2013-10-28 19:17:59 +08:00
|
|
|
LD->getAlignment(), LD->getTBAAInfo());
|
2013-02-21 02:04:21 +08:00
|
|
|
|
|
|
|
BasePTR = DAG.getNode(ISD::ADD, dl, BasePTR.getValueType(), BasePTR,
|
2013-08-26 23:06:10 +08:00
|
|
|
DAG.getConstant(Stride, BasePTR.getValueType()));
|
2013-02-21 02:04:21 +08:00
|
|
|
|
|
|
|
Vals.push_back(ScalarLoad.getValue(0));
|
|
|
|
LoadChains.push_back(ScalarLoad.getValue(1));
|
|
|
|
}
|
2011-10-15 15:41:10 +08:00
|
|
|
}
|
2011-10-19 06:32:43 +08:00
|
|
|
|
2011-10-15 15:41:10 +08:00
|
|
|
SDValue NewChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
|
|
|
|
&LoadChains[0], LoadChains.size());
|
|
|
|
SDValue Value = DAG.getNode(ISD::BUILD_VECTOR, dl,
|
2013-02-21 02:04:21 +08:00
|
|
|
Op.getNode()->getValueType(0), &Vals[0], Vals.size());
|
2011-10-15 15:41:10 +08:00
|
|
|
|
|
|
|
AddLegalizedOperand(Op.getValue(0), Value);
|
|
|
|
AddLegalizedOperand(Op.getValue(1), NewChain);
|
|
|
|
|
|
|
|
return (Op.getResNo() ? NewChain : Value);
|
|
|
|
}
|
|
|
|
|
|
|
|
SDValue VectorLegalizer::ExpandStore(SDValue Op) {
|
2013-05-29 00:31:26 +08:00
|
|
|
SDLoc dl(Op);
|
2011-10-15 15:41:10 +08:00
|
|
|
StoreSDNode *ST = cast<StoreSDNode>(Op.getNode());
|
|
|
|
SDValue Chain = ST->getChain();
|
|
|
|
SDValue BasePTR = ST->getBasePtr();
|
|
|
|
SDValue Value = ST->getValue();
|
|
|
|
EVT StVT = ST->getMemoryVT();
|
|
|
|
|
|
|
|
unsigned Alignment = ST->getAlignment();
|
|
|
|
bool isVolatile = ST->isVolatile();
|
|
|
|
bool isNonTemporal = ST->isNonTemporal();
|
2013-10-28 19:17:59 +08:00
|
|
|
const MDNode *TBAAInfo = ST->getTBAAInfo();
|
2011-10-15 15:41:10 +08:00
|
|
|
|
|
|
|
unsigned NumElem = StVT.getVectorNumElements();
|
|
|
|
// The type of the data we want to save
|
|
|
|
EVT RegVT = Value.getValueType();
|
|
|
|
EVT RegSclVT = RegVT.getScalarType();
|
|
|
|
// The type of data as saved in memory.
|
|
|
|
EVT MemSclVT = StVT.getScalarType();
|
|
|
|
|
|
|
|
// Cast floats into integers
|
|
|
|
unsigned ScalarSize = MemSclVT.getSizeInBits();
|
|
|
|
|
|
|
|
// Round odd types to the next pow of two.
|
|
|
|
if (!isPowerOf2_32(ScalarSize))
|
|
|
|
ScalarSize = NextPowerOf2(ScalarSize);
|
|
|
|
|
|
|
|
// Store Stride in bytes
|
|
|
|
unsigned Stride = ScalarSize/8;
|
|
|
|
// Extract each of the elements from the original vector
|
|
|
|
// and save them into memory individually.
|
|
|
|
SmallVector<SDValue, 8> Stores;
|
|
|
|
for (unsigned Idx = 0; Idx < NumElem; Idx++) {
|
|
|
|
SDValue Ex = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
|
2013-08-06 06:22:01 +08:00
|
|
|
RegSclVT, Value, DAG.getConstant(Idx, TLI.getVectorIdxTy()));
|
2011-10-15 15:41:10 +08:00
|
|
|
|
|
|
|
// This scalar TruncStore may be illegal, but we legalize it later.
|
|
|
|
SDValue Store = DAG.getTruncStore(Chain, dl, Ex, BasePTR,
|
|
|
|
ST->getPointerInfo().getWithOffset(Idx*Stride), MemSclVT,
|
2013-10-28 19:17:59 +08:00
|
|
|
isVolatile, isNonTemporal, Alignment, TBAAInfo);
|
2011-10-15 15:41:10 +08:00
|
|
|
|
2011-10-19 06:32:43 +08:00
|
|
|
BasePTR = DAG.getNode(ISD::ADD, dl, BasePTR.getValueType(), BasePTR,
|
2013-08-26 23:06:10 +08:00
|
|
|
DAG.getConstant(Stride, BasePTR.getValueType()));
|
2011-10-19 06:32:43 +08:00
|
|
|
|
2011-10-15 15:41:10 +08:00
|
|
|
Stores.push_back(Store);
|
|
|
|
}
|
|
|
|
SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
|
|
|
|
&Stores[0], Stores.size());
|
|
|
|
AddLegalizedOperand(Op, TF);
|
|
|
|
return TF;
|
|
|
|
}
|
|
|
|
|
2012-08-31 03:17:29 +08:00
|
|
|
SDValue VectorLegalizer::ExpandSELECT(SDValue Op) {
|
|
|
|
// Lower a select instruction where the condition is a scalar and the
|
|
|
|
// operands are vectors. Lower this select to VSELECT and implement it
|
2013-07-08 08:37:03 +08:00
|
|
|
// using XOR AND OR. The selector bit is broadcasted.
|
2012-08-31 03:17:29 +08:00
|
|
|
EVT VT = Op.getValueType();
|
2013-05-29 00:31:26 +08:00
|
|
|
SDLoc DL(Op);
|
2012-08-31 03:17:29 +08:00
|
|
|
|
|
|
|
SDValue Mask = Op.getOperand(0);
|
|
|
|
SDValue Op1 = Op.getOperand(1);
|
|
|
|
SDValue Op2 = Op.getOperand(2);
|
|
|
|
|
|
|
|
assert(VT.isVector() && !Mask.getValueType().isVector()
|
|
|
|
&& Op1.getValueType() == Op2.getValueType() && "Invalid type");
|
|
|
|
|
|
|
|
unsigned NumElem = VT.getVectorNumElements();
|
|
|
|
|
|
|
|
// If we can't even use the basic vector operations of
|
|
|
|
// AND,OR,XOR, we will have to scalarize the op.
|
|
|
|
// Notice that the operation may be 'promoted' which means that it is
|
|
|
|
// 'bitcasted' to another type which is handled.
|
|
|
|
// Also, we need to be able to construct a splat vector using BUILD_VECTOR.
|
|
|
|
if (TLI.getOperationAction(ISD::AND, VT) == TargetLowering::Expand ||
|
|
|
|
TLI.getOperationAction(ISD::XOR, VT) == TargetLowering::Expand ||
|
|
|
|
TLI.getOperationAction(ISD::OR, VT) == TargetLowering::Expand ||
|
|
|
|
TLI.getOperationAction(ISD::BUILD_VECTOR, VT) == TargetLowering::Expand)
|
|
|
|
return DAG.UnrollVectorOp(Op.getNode());
|
|
|
|
|
|
|
|
// Generate a mask operand.
|
2013-09-10 08:41:56 +08:00
|
|
|
EVT MaskTy = VT.changeVectorElementTypeToInteger();
|
2012-08-31 03:17:29 +08:00
|
|
|
|
|
|
|
// What is the size of each element in the vector mask.
|
|
|
|
EVT BitTy = MaskTy.getScalarType();
|
|
|
|
|
2013-06-15 06:04:37 +08:00
|
|
|
Mask = DAG.getSelect(DL, BitTy, Mask,
|
2012-09-02 16:20:07 +08:00
|
|
|
DAG.getConstant(APInt::getAllOnesValue(BitTy.getSizeInBits()), BitTy),
|
2012-09-02 20:21:50 +08:00
|
|
|
DAG.getConstant(0, BitTy));
|
2012-08-31 03:17:29 +08:00
|
|
|
|
|
|
|
// Broadcast the mask so that the entire vector is all-one or all zero.
|
|
|
|
SmallVector<SDValue, 8> Ops(NumElem, Mask);
|
|
|
|
Mask = DAG.getNode(ISD::BUILD_VECTOR, DL, MaskTy, &Ops[0], Ops.size());
|
|
|
|
|
|
|
|
// Bitcast the operands to be the same type as the mask.
|
|
|
|
// This is needed when we select between FP types because
|
|
|
|
// the mask is a vector of integers.
|
|
|
|
Op1 = DAG.getNode(ISD::BITCAST, DL, MaskTy, Op1);
|
|
|
|
Op2 = DAG.getNode(ISD::BITCAST, DL, MaskTy, Op2);
|
|
|
|
|
|
|
|
SDValue AllOnes = DAG.getConstant(
|
|
|
|
APInt::getAllOnesValue(BitTy.getSizeInBits()), MaskTy);
|
|
|
|
SDValue NotMask = DAG.getNode(ISD::XOR, DL, MaskTy, Mask, AllOnes);
|
|
|
|
|
|
|
|
Op1 = DAG.getNode(ISD::AND, DL, MaskTy, Op1, Mask);
|
|
|
|
Op2 = DAG.getNode(ISD::AND, DL, MaskTy, Op2, NotMask);
|
|
|
|
SDValue Val = DAG.getNode(ISD::OR, DL, MaskTy, Op1, Op2);
|
|
|
|
return DAG.getNode(ISD::BITCAST, DL, Op.getValueType(), Val);
|
|
|
|
}
|
|
|
|
|
2013-01-12 06:57:48 +08:00
|
|
|
SDValue VectorLegalizer::ExpandSEXTINREG(SDValue Op) {
|
|
|
|
EVT VT = Op.getValueType();
|
|
|
|
|
2013-01-13 03:06:44 +08:00
|
|
|
// Make sure that the SRA and SHL instructions are available.
|
2013-01-12 06:57:48 +08:00
|
|
|
if (TLI.getOperationAction(ISD::SRA, VT) == TargetLowering::Expand ||
|
2013-01-13 03:06:44 +08:00
|
|
|
TLI.getOperationAction(ISD::SHL, VT) == TargetLowering::Expand)
|
2013-01-12 06:57:48 +08:00
|
|
|
return DAG.UnrollVectorOp(Op.getNode());
|
|
|
|
|
2013-05-29 00:31:26 +08:00
|
|
|
SDLoc DL(Op);
|
2013-01-12 06:57:48 +08:00
|
|
|
EVT OrigTy = cast<VTSDNode>(Op->getOperand(1))->getVT();
|
|
|
|
|
|
|
|
unsigned BW = VT.getScalarType().getSizeInBits();
|
|
|
|
unsigned OrigBW = OrigTy.getScalarType().getSizeInBits();
|
|
|
|
SDValue ShiftSz = DAG.getConstant(BW - OrigBW, VT);
|
|
|
|
|
|
|
|
Op = Op.getOperand(0);
|
2013-01-13 03:06:44 +08:00
|
|
|
Op = DAG.getNode(ISD::SHL, DL, VT, Op, ShiftSz);
|
2013-01-12 06:57:48 +08:00
|
|
|
return DAG.getNode(ISD::SRA, DL, VT, Op, ShiftSz);
|
|
|
|
}
|
|
|
|
|
2011-09-14 03:17:42 +08:00
|
|
|
SDValue VectorLegalizer::ExpandVSELECT(SDValue Op) {
|
|
|
|
// Implement VSELECT in terms of XOR, AND, OR
|
|
|
|
// on platforms which do not support blend natively.
|
2013-05-29 00:31:26 +08:00
|
|
|
SDLoc DL(Op);
|
2011-09-14 03:17:42 +08:00
|
|
|
|
|
|
|
SDValue Mask = Op.getOperand(0);
|
|
|
|
SDValue Op1 = Op.getOperand(1);
|
|
|
|
SDValue Op2 = Op.getOperand(2);
|
|
|
|
|
2013-05-08 04:24:18 +08:00
|
|
|
EVT VT = Mask.getValueType();
|
|
|
|
|
2011-09-14 03:17:42 +08:00
|
|
|
// If we can't even use the basic vector operations of
|
|
|
|
// AND,OR,XOR, we will have to scalarize the op.
|
2011-10-20 04:43:16 +08:00
|
|
|
// Notice that the operation may be 'promoted' which means that it is
|
|
|
|
// 'bitcasted' to another type which is handled.
|
2012-09-02 06:27:48 +08:00
|
|
|
// This operation also isn't safe with AND, OR, XOR when the boolean
|
|
|
|
// type is 0/1 as we need an all ones vector constant to mask with.
|
|
|
|
// FIXME: Sign extend 1 to all ones if thats legal on the target.
|
2011-10-20 04:43:16 +08:00
|
|
|
if (TLI.getOperationAction(ISD::AND, VT) == TargetLowering::Expand ||
|
|
|
|
TLI.getOperationAction(ISD::XOR, VT) == TargetLowering::Expand ||
|
2012-09-02 06:27:48 +08:00
|
|
|
TLI.getOperationAction(ISD::OR, VT) == TargetLowering::Expand ||
|
|
|
|
TLI.getBooleanContents(true) !=
|
|
|
|
TargetLowering::ZeroOrNegativeOneBooleanContent)
|
2011-10-20 04:43:16 +08:00
|
|
|
return DAG.UnrollVectorOp(Op.getNode());
|
2011-03-19 21:09:10 +08:00
|
|
|
|
2013-05-08 04:24:18 +08:00
|
|
|
// If the mask and the type are different sizes, unroll the vector op. This
|
|
|
|
// can occur when getSetCCResultType returns something that is different in
|
|
|
|
// size from the operand types. For example, v4i8 = select v4i32, v4i8, v4i8.
|
|
|
|
if (VT.getSizeInBits() != Op1.getValueType().getSizeInBits())
|
|
|
|
return DAG.UnrollVectorOp(Op.getNode());
|
|
|
|
|
2011-09-14 03:17:42 +08:00
|
|
|
// Bitcast the operands to be the same type as the mask.
|
|
|
|
// This is needed when we select between FP types because
|
|
|
|
// the mask is a vector of integers.
|
|
|
|
Op1 = DAG.getNode(ISD::BITCAST, DL, VT, Op1);
|
|
|
|
Op2 = DAG.getNode(ISD::BITCAST, DL, VT, Op2);
|
2011-03-19 21:09:10 +08:00
|
|
|
|
2011-09-14 03:17:42 +08:00
|
|
|
SDValue AllOnes = DAG.getConstant(
|
|
|
|
APInt::getAllOnesValue(VT.getScalarType().getSizeInBits()), VT);
|
|
|
|
SDValue NotMask = DAG.getNode(ISD::XOR, DL, VT, Mask, AllOnes);
|
|
|
|
|
|
|
|
Op1 = DAG.getNode(ISD::AND, DL, VT, Op1, Mask);
|
|
|
|
Op2 = DAG.getNode(ISD::AND, DL, VT, Op2, NotMask);
|
2012-04-15 23:08:09 +08:00
|
|
|
SDValue Val = DAG.getNode(ISD::OR, DL, VT, Op1, Op2);
|
|
|
|
return DAG.getNode(ISD::BITCAST, DL, Op.getValueType(), Val);
|
2011-09-14 03:17:42 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
SDValue VectorLegalizer::ExpandUINT_TO_FLOAT(SDValue Op) {
|
2011-03-19 21:09:10 +08:00
|
|
|
EVT VT = Op.getOperand(0).getValueType();
|
2013-05-29 00:31:26 +08:00
|
|
|
SDLoc DL(Op);
|
2011-03-19 21:09:10 +08:00
|
|
|
|
|
|
|
// Make sure that the SINT_TO_FP and SRL instructions are available.
|
2011-10-20 04:43:16 +08:00
|
|
|
if (TLI.getOperationAction(ISD::SINT_TO_FP, VT) == TargetLowering::Expand ||
|
|
|
|
TLI.getOperationAction(ISD::SRL, VT) == TargetLowering::Expand)
|
|
|
|
return DAG.UnrollVectorOp(Op.getNode());
|
2011-03-19 21:09:10 +08:00
|
|
|
|
|
|
|
EVT SVT = VT.getScalarType();
|
|
|
|
assert((SVT.getSizeInBits() == 64 || SVT.getSizeInBits() == 32) &&
|
|
|
|
"Elements in vector-UINT_TO_FP must be 32 or 64 bits wide");
|
|
|
|
|
|
|
|
unsigned BW = SVT.getSizeInBits();
|
|
|
|
SDValue HalfWord = DAG.getConstant(BW/2, VT);
|
|
|
|
|
|
|
|
// Constants to clear the upper part of the word.
|
|
|
|
// Notice that we can also use SHL+SHR, but using a constant is slightly
|
|
|
|
// faster on x86.
|
|
|
|
uint64_t HWMask = (SVT.getSizeInBits()==64)?0x00000000FFFFFFFF:0x0000FFFF;
|
|
|
|
SDValue HalfWordMask = DAG.getConstant(HWMask, VT);
|
|
|
|
|
|
|
|
// Two to the power of half-word-size.
|
|
|
|
SDValue TWOHW = DAG.getConstantFP((1<<(BW/2)), Op.getValueType());
|
|
|
|
|
|
|
|
// Clear upper part of LO, lower HI
|
|
|
|
SDValue HI = DAG.getNode(ISD::SRL, DL, VT, Op.getOperand(0), HalfWord);
|
|
|
|
SDValue LO = DAG.getNode(ISD::AND, DL, VT, Op.getOperand(0), HalfWordMask);
|
|
|
|
|
|
|
|
// Convert hi and lo to floats
|
|
|
|
// Convert the hi part back to the upper values
|
|
|
|
SDValue fHI = DAG.getNode(ISD::SINT_TO_FP, DL, Op.getValueType(), HI);
|
|
|
|
fHI = DAG.getNode(ISD::FMUL, DL, Op.getValueType(), fHI, TWOHW);
|
|
|
|
SDValue fLO = DAG.getNode(ISD::SINT_TO_FP, DL, Op.getValueType(), LO);
|
|
|
|
|
|
|
|
// Add the two halves
|
|
|
|
return DAG.getNode(ISD::FADD, DL, Op.getValueType(), fHI, fLO);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-05-23 20:35:30 +08:00
|
|
|
SDValue VectorLegalizer::ExpandFNEG(SDValue Op) {
|
|
|
|
if (TLI.isOperationLegalOrCustom(ISD::FSUB, Op.getValueType())) {
|
|
|
|
SDValue Zero = DAG.getConstantFP(-0.0, Op.getValueType());
|
2013-05-25 10:42:55 +08:00
|
|
|
return DAG.getNode(ISD::FSUB, SDLoc(Op), Op.getValueType(),
|
2009-05-23 20:35:30 +08:00
|
|
|
Zero, Op.getOperand(0));
|
|
|
|
}
|
2009-11-30 10:42:02 +08:00
|
|
|
return DAG.UnrollVectorOp(Op.getNode());
|
2009-05-23 20:35:30 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
SDValue VectorLegalizer::UnrollVSETCC(SDValue Op) {
|
2009-08-11 06:56:29 +08:00
|
|
|
EVT VT = Op.getValueType();
|
2009-05-23 20:35:30 +08:00
|
|
|
unsigned NumElems = VT.getVectorNumElements();
|
2009-08-11 06:56:29 +08:00
|
|
|
EVT EltVT = VT.getVectorElementType();
|
2009-05-23 20:35:30 +08:00
|
|
|
SDValue LHS = Op.getOperand(0), RHS = Op.getOperand(1), CC = Op.getOperand(2);
|
2009-08-11 06:56:29 +08:00
|
|
|
EVT TmpEltVT = LHS.getValueType().getVectorElementType();
|
2013-05-29 00:31:26 +08:00
|
|
|
SDLoc dl(Op);
|
2009-05-23 20:35:30 +08:00
|
|
|
SmallVector<SDValue, 8> Ops(NumElems);
|
|
|
|
for (unsigned i = 0; i < NumElems; ++i) {
|
|
|
|
SDValue LHSElem = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, TmpEltVT, LHS,
|
2013-08-06 06:22:01 +08:00
|
|
|
DAG.getConstant(i, TLI.getVectorIdxTy()));
|
2009-05-23 20:35:30 +08:00
|
|
|
SDValue RHSElem = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, TmpEltVT, RHS,
|
2013-08-06 06:22:01 +08:00
|
|
|
DAG.getConstant(i, TLI.getVectorIdxTy()));
|
2013-05-18 08:21:46 +08:00
|
|
|
Ops[i] = DAG.getNode(ISD::SETCC, dl,
|
|
|
|
TLI.getSetCCResultType(*DAG.getContext(), TmpEltVT),
|
2009-05-23 20:35:30 +08:00
|
|
|
LHSElem, RHSElem, CC);
|
2013-06-15 06:04:37 +08:00
|
|
|
Ops[i] = DAG.getSelect(dl, EltVT, Ops[i],
|
|
|
|
DAG.getConstant(APInt::getAllOnesValue
|
|
|
|
(EltVT.getSizeInBits()), EltVT),
|
|
|
|
DAG.getConstant(0, EltVT));
|
2009-05-23 20:35:30 +08:00
|
|
|
}
|
|
|
|
return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, &Ops[0], NumElems);
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
bool SelectionDAG::LegalizeVectors() {
|
|
|
|
return VectorLegalizer(*this).Run();
|
|
|
|
}
|