2014-02-26 11:10:45 +08:00
|
|
|
//===-- InstrinsicInst.cpp - Intrinsic Instruction Wrappers ---------------===//
|
2006-03-24 02:05:12 +08:00
|
|
|
//
|
2019-01-19 16:50:56 +08:00
|
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
2006-03-24 02:05:12 +08:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
2006-03-24 18:00:56 +08:00
|
|
|
//
|
|
|
|
// This file implements methods that make it really easy to deal with intrinsic
|
2010-01-05 09:10:40 +08:00
|
|
|
// functions.
|
2006-03-24 18:00:56 +08:00
|
|
|
//
|
|
|
|
// All intrinsic function calls are instances of the call instruction, so these
|
|
|
|
// are all subclasses of the CallInst class. Note that none of these classes
|
|
|
|
// has state or virtual methods, which is an important part of this gross/neat
|
|
|
|
// hack working.
|
2017-08-24 12:18:24 +08:00
|
|
|
//
|
2006-03-24 18:00:56 +08:00
|
|
|
// In some cases, arguments to intrinsics need to be generic and are defined as
|
|
|
|
// type pointer to empty struct { }*. To access the real item of interest the
|
2017-08-24 12:18:24 +08:00
|
|
|
// cast instruction needs to be stripped away.
|
2006-03-24 18:00:56 +08:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
2006-03-24 02:05:12 +08:00
|
|
|
|
2013-01-02 19:36:10 +08:00
|
|
|
#include "llvm/IR/IntrinsicInst.h"
|
2017-06-06 19:49:48 +08:00
|
|
|
#include "llvm/ADT/StringSwitch.h"
|
2013-01-02 19:36:10 +08:00
|
|
|
#include "llvm/IR/Constants.h"
|
2018-06-15 21:48:55 +08:00
|
|
|
#include "llvm/IR/DebugInfoMetadata.h"
|
2013-01-02 19:36:10 +08:00
|
|
|
#include "llvm/IR/GlobalVariable.h"
|
|
|
|
#include "llvm/IR/Metadata.h"
|
2016-09-21 03:07:22 +08:00
|
|
|
#include "llvm/IR/Module.h"
|
2020-04-15 18:05:07 +08:00
|
|
|
#include "llvm/IR/Operator.h"
|
2020-03-17 21:52:06 +08:00
|
|
|
#include "llvm/IR/PatternMatch.h"
|
|
|
|
|
2016-01-27 06:33:19 +08:00
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2006-03-24 02:05:12 +08:00
|
|
|
using namespace llvm;
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
2018-08-06 11:59:47 +08:00
|
|
|
/// DbgVariableIntrinsic - This is the common base class for debug info
|
|
|
|
/// intrinsics for variables.
|
2006-03-24 02:05:12 +08:00
|
|
|
///
|
|
|
|
|
2018-08-06 11:59:47 +08:00
|
|
|
Value *DbgVariableIntrinsic::getVariableLocation(bool AllowNullOp) const {
|
2016-03-30 02:56:03 +08:00
|
|
|
Value *Op = getArgOperand(0);
|
|
|
|
if (AllowNullOp && !Op)
|
|
|
|
return nullptr;
|
|
|
|
|
IR: Split Metadata from Value
Split `Metadata` away from the `Value` class hierarchy, as part of
PR21532. Assembly and bitcode changes are in the wings, but this is the
bulk of the change for the IR C++ API.
I have a follow-up patch prepared for `clang`. If this breaks other
sub-projects, I apologize in advance :(. Help me compile it on Darwin
I'll try to fix it. FWIW, the errors should be easy to fix, so it may
be simpler to just fix it yourself.
This breaks the build for all metadata-related code that's out-of-tree.
Rest assured the transition is mechanical and the compiler should catch
almost all of the problems.
Here's a quick guide for updating your code:
- `Metadata` is the root of a class hierarchy with three main classes:
`MDNode`, `MDString`, and `ValueAsMetadata`. It is distinct from
the `Value` class hierarchy. It is typeless -- i.e., instances do
*not* have a `Type`.
- `MDNode`'s operands are all `Metadata *` (instead of `Value *`).
- `TrackingVH<MDNode>` and `WeakVH` referring to metadata can be
replaced with `TrackingMDNodeRef` and `TrackingMDRef`, respectively.
If you're referring solely to resolved `MDNode`s -- post graph
construction -- just use `MDNode*`.
- `MDNode` (and the rest of `Metadata`) have only limited support for
`replaceAllUsesWith()`.
As long as an `MDNode` is pointing at a forward declaration -- the
result of `MDNode::getTemporary()` -- it maintains a side map of its
uses and can RAUW itself. Once the forward declarations are fully
resolved RAUW support is dropped on the ground. This means that
uniquing collisions on changing operands cause nodes to become
"distinct". (This already happened fairly commonly, whenever an
operand went to null.)
If you're constructing complex (non self-reference) `MDNode` cycles,
you need to call `MDNode::resolveCycles()` on each node (or on a
top-level node that somehow references all of the nodes). Also,
don't do that. Metadata cycles (and the RAUW machinery needed to
construct them) are expensive.
- An `MDNode` can only refer to a `Constant` through a bridge called
`ConstantAsMetadata` (one of the subclasses of `ValueAsMetadata`).
As a side effect, accessing an operand of an `MDNode` that is known
to be, e.g., `ConstantInt`, takes three steps: first, cast from
`Metadata` to `ConstantAsMetadata`; second, extract the `Constant`;
third, cast down to `ConstantInt`.
The eventual goal is to introduce `MDInt`/`MDFloat`/etc. and have
metadata schema owners transition away from using `Constant`s when
the type isn't important (and they don't care about referring to
`GlobalValue`s).
In the meantime, I've added transitional API to the `mdconst`
namespace that matches semantics with the old code, in order to
avoid adding the error-prone three-step equivalent to every call
site. If your old code was:
MDNode *N = foo();
bar(isa <ConstantInt>(N->getOperand(0)));
baz(cast <ConstantInt>(N->getOperand(1)));
bak(cast_or_null <ConstantInt>(N->getOperand(2)));
bat(dyn_cast <ConstantInt>(N->getOperand(3)));
bay(dyn_cast_or_null<ConstantInt>(N->getOperand(4)));
you can trivially match its semantics with:
MDNode *N = foo();
bar(mdconst::hasa <ConstantInt>(N->getOperand(0)));
baz(mdconst::extract <ConstantInt>(N->getOperand(1)));
bak(mdconst::extract_or_null <ConstantInt>(N->getOperand(2)));
bat(mdconst::dyn_extract <ConstantInt>(N->getOperand(3)));
bay(mdconst::dyn_extract_or_null<ConstantInt>(N->getOperand(4)));
and when you transition your metadata schema to `MDInt`:
MDNode *N = foo();
bar(isa <MDInt>(N->getOperand(0)));
baz(cast <MDInt>(N->getOperand(1)));
bak(cast_or_null <MDInt>(N->getOperand(2)));
bat(dyn_cast <MDInt>(N->getOperand(3)));
bay(dyn_cast_or_null<MDInt>(N->getOperand(4)));
- A `CallInst` -- specifically, intrinsic instructions -- can refer to
metadata through a bridge called `MetadataAsValue`. This is a
subclass of `Value` where `getType()->isMetadataTy()`.
`MetadataAsValue` is the *only* class that can legally refer to a
`LocalAsMetadata`, which is a bridged form of non-`Constant` values
like `Argument` and `Instruction`. It can also refer to any other
`Metadata` subclass.
(I'll break all your testcases in a follow-up commit, when I propagate
this change to assembly.)
llvm-svn: 223802
2014-12-10 02:38:53 +08:00
|
|
|
auto *MD = cast<MetadataAsValue>(Op)->getMetadata();
|
|
|
|
if (auto *V = dyn_cast<ValueAsMetadata>(MD))
|
|
|
|
return V->getValue();
|
|
|
|
|
|
|
|
// When the value goes to null, it gets replaced by an empty MDNode.
|
2018-08-06 11:59:47 +08:00
|
|
|
assert(!cast<MDNode>(MD)->getNumOperands() && "Expected an empty MDNode");
|
IR: Split Metadata from Value
Split `Metadata` away from the `Value` class hierarchy, as part of
PR21532. Assembly and bitcode changes are in the wings, but this is the
bulk of the change for the IR C++ API.
I have a follow-up patch prepared for `clang`. If this breaks other
sub-projects, I apologize in advance :(. Help me compile it on Darwin
I'll try to fix it. FWIW, the errors should be easy to fix, so it may
be simpler to just fix it yourself.
This breaks the build for all metadata-related code that's out-of-tree.
Rest assured the transition is mechanical and the compiler should catch
almost all of the problems.
Here's a quick guide for updating your code:
- `Metadata` is the root of a class hierarchy with three main classes:
`MDNode`, `MDString`, and `ValueAsMetadata`. It is distinct from
the `Value` class hierarchy. It is typeless -- i.e., instances do
*not* have a `Type`.
- `MDNode`'s operands are all `Metadata *` (instead of `Value *`).
- `TrackingVH<MDNode>` and `WeakVH` referring to metadata can be
replaced with `TrackingMDNodeRef` and `TrackingMDRef`, respectively.
If you're referring solely to resolved `MDNode`s -- post graph
construction -- just use `MDNode*`.
- `MDNode` (and the rest of `Metadata`) have only limited support for
`replaceAllUsesWith()`.
As long as an `MDNode` is pointing at a forward declaration -- the
result of `MDNode::getTemporary()` -- it maintains a side map of its
uses and can RAUW itself. Once the forward declarations are fully
resolved RAUW support is dropped on the ground. This means that
uniquing collisions on changing operands cause nodes to become
"distinct". (This already happened fairly commonly, whenever an
operand went to null.)
If you're constructing complex (non self-reference) `MDNode` cycles,
you need to call `MDNode::resolveCycles()` on each node (or on a
top-level node that somehow references all of the nodes). Also,
don't do that. Metadata cycles (and the RAUW machinery needed to
construct them) are expensive.
- An `MDNode` can only refer to a `Constant` through a bridge called
`ConstantAsMetadata` (one of the subclasses of `ValueAsMetadata`).
As a side effect, accessing an operand of an `MDNode` that is known
to be, e.g., `ConstantInt`, takes three steps: first, cast from
`Metadata` to `ConstantAsMetadata`; second, extract the `Constant`;
third, cast down to `ConstantInt`.
The eventual goal is to introduce `MDInt`/`MDFloat`/etc. and have
metadata schema owners transition away from using `Constant`s when
the type isn't important (and they don't care about referring to
`GlobalValue`s).
In the meantime, I've added transitional API to the `mdconst`
namespace that matches semantics with the old code, in order to
avoid adding the error-prone three-step equivalent to every call
site. If your old code was:
MDNode *N = foo();
bar(isa <ConstantInt>(N->getOperand(0)));
baz(cast <ConstantInt>(N->getOperand(1)));
bak(cast_or_null <ConstantInt>(N->getOperand(2)));
bat(dyn_cast <ConstantInt>(N->getOperand(3)));
bay(dyn_cast_or_null<ConstantInt>(N->getOperand(4)));
you can trivially match its semantics with:
MDNode *N = foo();
bar(mdconst::hasa <ConstantInt>(N->getOperand(0)));
baz(mdconst::extract <ConstantInt>(N->getOperand(1)));
bak(mdconst::extract_or_null <ConstantInt>(N->getOperand(2)));
bat(mdconst::dyn_extract <ConstantInt>(N->getOperand(3)));
bay(mdconst::dyn_extract_or_null<ConstantInt>(N->getOperand(4)));
and when you transition your metadata schema to `MDInt`:
MDNode *N = foo();
bar(isa <MDInt>(N->getOperand(0)));
baz(cast <MDInt>(N->getOperand(1)));
bak(cast_or_null <MDInt>(N->getOperand(2)));
bat(dyn_cast <MDInt>(N->getOperand(3)));
bay(dyn_cast_or_null<MDInt>(N->getOperand(4)));
- A `CallInst` -- specifically, intrinsic instructions -- can refer to
metadata through a bridge called `MetadataAsValue`. This is a
subclass of `Value` where `getType()->isMetadataTy()`.
`MetadataAsValue` is the *only* class that can legally refer to a
`LocalAsMetadata`, which is a bridged form of non-`Constant` values
like `Argument` and `Instruction`. It can also refer to any other
`Metadata` subclass.
(I'll break all your testcases in a follow-up commit, when I propagate
this change to assembly.)
llvm-svn: 223802
2014-12-10 02:38:53 +08:00
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
2018-08-06 11:59:47 +08:00
|
|
|
Optional<uint64_t> DbgVariableIntrinsic::getFragmentSizeInBits() const {
|
2018-06-15 21:48:55 +08:00
|
|
|
if (auto Fragment = getExpression()->getFragmentInfo())
|
|
|
|
return Fragment->SizeInBits;
|
|
|
|
return getVariable()->getSizeInBits();
|
|
|
|
}
|
|
|
|
|
2016-01-27 06:33:19 +08:00
|
|
|
int llvm::Intrinsic::lookupLLVMIntrinsicByName(ArrayRef<const char *> NameTable,
|
|
|
|
StringRef Name) {
|
|
|
|
assert(Name.startswith("llvm."));
|
|
|
|
|
|
|
|
// Do successive binary searches of the dotted name components. For
|
|
|
|
// "llvm.gc.experimental.statepoint.p1i8.p1i32", we will find the range of
|
|
|
|
// intrinsics starting with "llvm.gc", then "llvm.gc.experimental", then
|
|
|
|
// "llvm.gc.experimental.statepoint", and then we will stop as the range is
|
|
|
|
// size 1. During the search, we can skip the prefix that we already know is
|
|
|
|
// identical. By using strncmp we consider names with differing suffixes to
|
|
|
|
// be part of the equal range.
|
|
|
|
size_t CmpEnd = 4; // Skip the "llvm" component.
|
|
|
|
const char *const *Low = NameTable.begin();
|
|
|
|
const char *const *High = NameTable.end();
|
|
|
|
const char *const *LastLow = Low;
|
|
|
|
while (CmpEnd < Name.size() && High - Low > 0) {
|
2019-09-24 20:30:07 +08:00
|
|
|
size_t CmpStart = CmpEnd;
|
2016-01-27 06:33:19 +08:00
|
|
|
CmpEnd = Name.find('.', CmpStart + 1);
|
|
|
|
CmpEnd = CmpEnd == StringRef::npos ? Name.size() : CmpEnd;
|
|
|
|
auto Cmp = [CmpStart, CmpEnd](const char *LHS, const char *RHS) {
|
|
|
|
return strncmp(LHS + CmpStart, RHS + CmpStart, CmpEnd - CmpStart) < 0;
|
|
|
|
};
|
|
|
|
LastLow = Low;
|
|
|
|
std::tie(Low, High) = std::equal_range(Low, High, Name.data(), Cmp);
|
|
|
|
}
|
|
|
|
if (High - Low > 0)
|
|
|
|
LastLow = Low;
|
|
|
|
|
|
|
|
if (LastLow == NameTable.end())
|
|
|
|
return -1;
|
|
|
|
StringRef NameFound = *LastLow;
|
|
|
|
if (Name == NameFound ||
|
|
|
|
(Name.startswith(NameFound) && Name[NameFound.size()] == '.'))
|
|
|
|
return LastLow - NameTable.begin();
|
|
|
|
return -1;
|
|
|
|
}
|
2016-09-21 03:07:22 +08:00
|
|
|
|
|
|
|
Value *InstrProfIncrementInst::getStep() const {
|
|
|
|
if (InstrProfIncrementInstStep::classof(this)) {
|
|
|
|
return const_cast<Value *>(getArgOperand(4));
|
|
|
|
}
|
|
|
|
const Module *M = getModule();
|
|
|
|
LLVMContext &Context = M->getContext();
|
|
|
|
return ConstantInt::get(Type::getInt64Ty(Context), 1);
|
|
|
|
}
|
2017-01-27 07:27:59 +08:00
|
|
|
|
2020-03-26 15:51:09 +08:00
|
|
|
Optional<RoundingMode> ConstrainedFPIntrinsic::getRoundingMode() const {
|
2017-05-26 05:31:00 +08:00
|
|
|
unsigned NumOperands = getNumArgOperands();
|
2017-08-24 12:18:24 +08:00
|
|
|
Metadata *MD =
|
2019-09-24 19:40:45 +08:00
|
|
|
cast<MetadataAsValue>(getArgOperand(NumOperands - 2))->getMetadata();
|
2017-01-27 07:27:59 +08:00
|
|
|
if (!MD || !isa<MDString>(MD))
|
2019-07-09 00:18:18 +08:00
|
|
|
return None;
|
|
|
|
return StrToRoundingMode(cast<MDString>(MD)->getString());
|
|
|
|
}
|
2017-01-27 07:27:59 +08:00
|
|
|
|
2019-08-29 20:29:11 +08:00
|
|
|
Optional<fp::ExceptionBehavior>
|
2017-01-27 07:27:59 +08:00
|
|
|
ConstrainedFPIntrinsic::getExceptionBehavior() const {
|
2017-05-26 05:31:00 +08:00
|
|
|
unsigned NumOperands = getNumArgOperands();
|
2017-08-24 12:18:24 +08:00
|
|
|
Metadata *MD =
|
2019-09-24 19:40:45 +08:00
|
|
|
cast<MetadataAsValue>(getArgOperand(NumOperands - 1))->getMetadata();
|
2017-01-27 07:27:59 +08:00
|
|
|
if (!MD || !isa<MDString>(MD))
|
2019-07-09 00:18:18 +08:00
|
|
|
return None;
|
|
|
|
return StrToExceptionBehavior(cast<MDString>(MD)->getString());
|
|
|
|
}
|
|
|
|
|
2020-04-15 18:05:07 +08:00
|
|
|
FCmpInst::Predicate ConstrainedFPCmpIntrinsic::getPredicate() const {
|
|
|
|
Metadata *MD = cast<MetadataAsValue>(getArgOperand(2))->getMetadata();
|
[FPEnv] Constrained FCmp intrinsics
This adds support for constrained floating-point comparison intrinsics.
Specifically, we add:
declare <ty2>
@llvm.experimental.constrained.fcmp(<type> <op1>, <type> <op2>,
metadata <condition code>,
metadata <exception behavior>)
declare <ty2>
@llvm.experimental.constrained.fcmps(<type> <op1>, <type> <op2>,
metadata <condition code>,
metadata <exception behavior>)
The first variant implements an IEEE "quiet" comparison (i.e. we only
get an invalid FP exception if either argument is a SNaN), while the
second variant implements an IEEE "signaling" comparison (i.e. we get
an invalid FP exception if either argument is any NaN).
The condition code is implemented as a metadata string. The same set
of predicates as for the fcmp instruction is supported (except for the
"true" and "false" predicates).
These new intrinsics are mapped by SelectionDAG codegen onto two new
ISD opcodes, ISD::STRICT_FSETCC and ISD::STRICT_FSETCCS, again
representing quiet vs. signaling comparison operations. Otherwise
those nodes look like SETCC nodes, with an additional chain argument
and result as usual for strict FP nodes. The patch includes support
for the common legalization operations for those nodes.
The patch also includes full SystemZ back-end support for the new
ISD nodes, mapping them to all available SystemZ instruction to
fully implement strict semantics (scalar and vector).
Differential Revision: https://reviews.llvm.org/D69281
2019-12-06 18:30:04 +08:00
|
|
|
if (!MD || !isa<MDString>(MD))
|
|
|
|
return FCmpInst::BAD_FCMP_PREDICATE;
|
|
|
|
return StringSwitch<FCmpInst::Predicate>(cast<MDString>(MD)->getString())
|
2020-04-15 18:05:07 +08:00
|
|
|
.Case("oeq", FCmpInst::FCMP_OEQ)
|
|
|
|
.Case("ogt", FCmpInst::FCMP_OGT)
|
|
|
|
.Case("oge", FCmpInst::FCMP_OGE)
|
|
|
|
.Case("olt", FCmpInst::FCMP_OLT)
|
|
|
|
.Case("ole", FCmpInst::FCMP_OLE)
|
|
|
|
.Case("one", FCmpInst::FCMP_ONE)
|
|
|
|
.Case("ord", FCmpInst::FCMP_ORD)
|
|
|
|
.Case("uno", FCmpInst::FCMP_UNO)
|
|
|
|
.Case("ueq", FCmpInst::FCMP_UEQ)
|
|
|
|
.Case("ugt", FCmpInst::FCMP_UGT)
|
|
|
|
.Case("uge", FCmpInst::FCMP_UGE)
|
|
|
|
.Case("ult", FCmpInst::FCMP_ULT)
|
|
|
|
.Case("ule", FCmpInst::FCMP_ULE)
|
|
|
|
.Case("une", FCmpInst::FCMP_UNE)
|
|
|
|
.Default(FCmpInst::BAD_FCMP_PREDICATE);
|
[FPEnv] Constrained FCmp intrinsics
This adds support for constrained floating-point comparison intrinsics.
Specifically, we add:
declare <ty2>
@llvm.experimental.constrained.fcmp(<type> <op1>, <type> <op2>,
metadata <condition code>,
metadata <exception behavior>)
declare <ty2>
@llvm.experimental.constrained.fcmps(<type> <op1>, <type> <op2>,
metadata <condition code>,
metadata <exception behavior>)
The first variant implements an IEEE "quiet" comparison (i.e. we only
get an invalid FP exception if either argument is a SNaN), while the
second variant implements an IEEE "signaling" comparison (i.e. we get
an invalid FP exception if either argument is any NaN).
The condition code is implemented as a metadata string. The same set
of predicates as for the fcmp instruction is supported (except for the
"true" and "false" predicates).
These new intrinsics are mapped by SelectionDAG codegen onto two new
ISD opcodes, ISD::STRICT_FSETCC and ISD::STRICT_FSETCCS, again
representing quiet vs. signaling comparison operations. Otherwise
those nodes look like SETCC nodes, with an additional chain argument
and result as usual for strict FP nodes. The patch includes support
for the common legalization operations for those nodes.
The patch also includes full SystemZ back-end support for the new
ISD nodes, mapping them to all available SystemZ instruction to
fully implement strict semantics (scalar and vector).
Differential Revision: https://reviews.llvm.org/D69281
2019-12-06 18:30:04 +08:00
|
|
|
}
|
|
|
|
|
2017-05-26 05:31:00 +08:00
|
|
|
bool ConstrainedFPIntrinsic::isUnaryOp() const {
|
|
|
|
switch (getIntrinsicID()) {
|
2020-04-15 18:05:07 +08:00
|
|
|
default:
|
|
|
|
return false;
|
2020-01-17 10:32:30 +08:00
|
|
|
#define INSTRUCTION(NAME, NARG, ROUND_MODE, INTRINSIC) \
|
2020-04-15 18:05:07 +08:00
|
|
|
case Intrinsic::INTRINSIC: \
|
|
|
|
return NARG == 1;
|
2019-11-05 21:42:16 +08:00
|
|
|
#include "llvm/IR/ConstrainedOps.def"
|
2017-05-26 05:31:00 +08:00
|
|
|
}
|
|
|
|
}
|
2017-08-24 12:18:24 +08:00
|
|
|
|
|
|
|
bool ConstrainedFPIntrinsic::isTernaryOp() const {
|
|
|
|
switch (getIntrinsicID()) {
|
2020-04-15 18:05:07 +08:00
|
|
|
default:
|
|
|
|
return false;
|
2020-01-17 10:32:30 +08:00
|
|
|
#define INSTRUCTION(NAME, NARG, ROUND_MODE, INTRINSIC) \
|
2020-04-15 18:05:07 +08:00
|
|
|
case Intrinsic::INTRINSIC: \
|
|
|
|
return NARG == 3;
|
2019-11-05 21:42:16 +08:00
|
|
|
#include "llvm/IR/ConstrainedOps.def"
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool ConstrainedFPIntrinsic::classof(const IntrinsicInst *I) {
|
|
|
|
switch (I->getIntrinsicID()) {
|
2020-01-17 10:32:30 +08:00
|
|
|
#define INSTRUCTION(NAME, NARGS, ROUND_MODE, INTRINSIC) \
|
2019-11-05 21:42:16 +08:00
|
|
|
case Intrinsic::INTRINSIC:
|
|
|
|
#include "llvm/IR/ConstrainedOps.def"
|
|
|
|
return true;
|
|
|
|
default:
|
|
|
|
return false;
|
2017-08-24 12:18:24 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-03-17 21:52:06 +08:00
|
|
|
ElementCount VPIntrinsic::getStaticVectorLength() const {
|
|
|
|
auto GetVectorLengthOfType = [](const Type *T) -> ElementCount {
|
|
|
|
auto VT = cast<VectorType>(T);
|
|
|
|
auto ElemCount = VT->getElementCount();
|
|
|
|
return ElemCount;
|
|
|
|
};
|
|
|
|
|
|
|
|
auto VPMask = getMaskParam();
|
|
|
|
return GetVectorLengthOfType(VPMask->getType());
|
|
|
|
}
|
|
|
|
|
|
|
|
Value *VPIntrinsic::getMaskParam() const {
|
|
|
|
auto maskPos = GetMaskParamPos(getIntrinsicID());
|
|
|
|
if (maskPos)
|
|
|
|
return getArgOperand(maskPos.getValue());
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
Value *VPIntrinsic::getVectorLengthParam() const {
|
|
|
|
auto vlenPos = GetVectorLengthParamPos(getIntrinsicID());
|
|
|
|
if (vlenPos)
|
|
|
|
return getArgOperand(vlenPos.getValue());
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
Optional<int> VPIntrinsic::GetMaskParamPos(Intrinsic::ID IntrinsicID) {
|
|
|
|
switch (IntrinsicID) {
|
|
|
|
default:
|
|
|
|
return None;
|
|
|
|
|
|
|
|
#define REGISTER_VP_INTRINSIC(VPID, MASKPOS, VLENPOS) \
|
|
|
|
case Intrinsic::VPID: \
|
|
|
|
return MASKPOS;
|
|
|
|
#include "llvm/IR/VPIntrinsics.def"
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Optional<int> VPIntrinsic::GetVectorLengthParamPos(Intrinsic::ID IntrinsicID) {
|
|
|
|
switch (IntrinsicID) {
|
|
|
|
default:
|
|
|
|
return None;
|
|
|
|
|
|
|
|
#define REGISTER_VP_INTRINSIC(VPID, MASKPOS, VLENPOS) \
|
|
|
|
case Intrinsic::VPID: \
|
|
|
|
return VLENPOS;
|
|
|
|
#include "llvm/IR/VPIntrinsics.def"
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool VPIntrinsic::IsVPIntrinsic(Intrinsic::ID ID) {
|
|
|
|
switch (ID) {
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
|
|
|
|
#define REGISTER_VP_INTRINSIC(VPID, MASKPOS, VLENPOS) \
|
|
|
|
case Intrinsic::VPID: \
|
|
|
|
break;
|
|
|
|
#include "llvm/IR/VPIntrinsics.def"
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Equivalent non-predicated opcode
|
|
|
|
unsigned VPIntrinsic::GetFunctionalOpcodeForVP(Intrinsic::ID ID) {
|
|
|
|
switch (ID) {
|
|
|
|
default:
|
|
|
|
return Instruction::Call;
|
|
|
|
|
|
|
|
#define HANDLE_VP_TO_OC(VPID, OC) \
|
|
|
|
case Intrinsic::VPID: \
|
|
|
|
return Instruction::OC;
|
|
|
|
#include "llvm/IR/VPIntrinsics.def"
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
Intrinsic::ID VPIntrinsic::GetForOpcode(unsigned OC) {
|
|
|
|
switch (OC) {
|
|
|
|
default:
|
|
|
|
return Intrinsic::not_intrinsic;
|
|
|
|
|
|
|
|
#define HANDLE_VP_TO_OC(VPID, OC) \
|
|
|
|
case Instruction::OC: \
|
|
|
|
return Intrinsic::VPID;
|
|
|
|
#include "llvm/IR/VPIntrinsics.def"
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool VPIntrinsic::canIgnoreVectorLengthParam() const {
|
|
|
|
using namespace PatternMatch;
|
|
|
|
|
|
|
|
ElementCount EC = getStaticVectorLength();
|
|
|
|
|
|
|
|
// No vlen param - no lanes masked-off by it.
|
|
|
|
auto *VLParam = getVectorLengthParam();
|
|
|
|
if (!VLParam)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
// Note that the VP intrinsic causes undefined behavior if the Explicit Vector
|
|
|
|
// Length parameter is strictly greater-than the number of vector elements of
|
|
|
|
// the operation. This function returns true when this is detected statically
|
|
|
|
// in the IR.
|
|
|
|
|
|
|
|
// Check whether "W == vscale * EC.Min"
|
|
|
|
if (EC.Scalable) {
|
|
|
|
// Undig the DL
|
|
|
|
auto ParMod = this->getModule();
|
|
|
|
if (!ParMod)
|
|
|
|
return false;
|
|
|
|
const auto &DL = ParMod->getDataLayout();
|
|
|
|
|
|
|
|
// Compare vscale patterns
|
2020-06-04 17:09:48 +08:00
|
|
|
uint64_t VScaleFactor;
|
|
|
|
if (match(VLParam, m_c_Mul(m_ConstantInt(VScaleFactor), m_VScale(DL))))
|
|
|
|
return VScaleFactor >= EC.Min;
|
|
|
|
return (EC.Min == 1) && match(VLParam, m_VScale(DL));
|
2020-03-17 21:52:06 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// standard SIMD operation
|
|
|
|
auto VLConst = dyn_cast<ConstantInt>(VLParam);
|
|
|
|
if (!VLConst)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
uint64_t VLNum = VLConst->getZExtValue();
|
|
|
|
if (VLNum >= EC.Min)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2019-05-29 02:08:06 +08:00
|
|
|
Instruction::BinaryOps BinaryOpIntrinsic::getBinaryOp() const {
|
2019-04-17 02:55:16 +08:00
|
|
|
switch (getIntrinsicID()) {
|
2020-04-15 18:05:07 +08:00
|
|
|
case Intrinsic::uadd_with_overflow:
|
|
|
|
case Intrinsic::sadd_with_overflow:
|
|
|
|
case Intrinsic::uadd_sat:
|
|
|
|
case Intrinsic::sadd_sat:
|
|
|
|
return Instruction::Add;
|
|
|
|
case Intrinsic::usub_with_overflow:
|
|
|
|
case Intrinsic::ssub_with_overflow:
|
|
|
|
case Intrinsic::usub_sat:
|
|
|
|
case Intrinsic::ssub_sat:
|
|
|
|
return Instruction::Sub;
|
|
|
|
case Intrinsic::umul_with_overflow:
|
|
|
|
case Intrinsic::smul_with_overflow:
|
|
|
|
return Instruction::Mul;
|
|
|
|
default:
|
|
|
|
llvm_unreachable("Invalid intrinsic");
|
2019-04-17 02:55:16 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-05-29 02:08:06 +08:00
|
|
|
bool BinaryOpIntrinsic::isSigned() const {
|
2019-04-17 02:55:16 +08:00
|
|
|
switch (getIntrinsicID()) {
|
2020-04-15 18:05:07 +08:00
|
|
|
case Intrinsic::sadd_with_overflow:
|
|
|
|
case Intrinsic::ssub_with_overflow:
|
|
|
|
case Intrinsic::smul_with_overflow:
|
|
|
|
case Intrinsic::sadd_sat:
|
|
|
|
case Intrinsic::ssub_sat:
|
|
|
|
return true;
|
|
|
|
default:
|
|
|
|
return false;
|
2019-04-17 02:55:16 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-05-29 02:08:06 +08:00
|
|
|
unsigned BinaryOpIntrinsic::getNoWrapKind() const {
|
2019-04-17 02:55:16 +08:00
|
|
|
if (isSigned())
|
|
|
|
return OverflowingBinaryOperator::NoSignedWrap;
|
|
|
|
else
|
|
|
|
return OverflowingBinaryOperator::NoUnsignedWrap;
|
|
|
|
}
|