2014-02-26 11:10:45 +08:00
|
|
|
//===-- InstrinsicInst.cpp - Intrinsic Instruction Wrappers ---------------===//
|
2006-03-24 02:05:12 +08:00
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-30 04:36:04 +08:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
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.
|
|
|
|
//
|
|
|
|
// 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
|
|
|
|
// cast instruction needs to be stripped away.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
2006-03-24 02:05:12 +08:00
|
|
|
|
2013-01-02 19:36:10 +08:00
|
|
|
#include "llvm/IR/IntrinsicInst.h"
|
|
|
|
#include "llvm/IR/Constants.h"
|
|
|
|
#include "llvm/IR/GlobalVariable.h"
|
|
|
|
#include "llvm/IR/Metadata.h"
|
2016-09-21 03:07:22 +08:00
|
|
|
#include "llvm/IR/Module.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;
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
/// DbgInfoIntrinsic - This is the common base class for debug info intrinsics
|
|
|
|
///
|
|
|
|
|
2016-03-30 02:56:03 +08:00
|
|
|
Value *DbgInfoIntrinsic::getVariableLocation(bool AllowNullOp) const {
|
|
|
|
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.
|
|
|
|
assert(!cast<MDNode>(MD)->getNumOperands() && "Expected an empty MDNode");
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
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 CmpStart = 0;
|
|
|
|
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) {
|
|
|
|
CmpStart = CmpEnd;
|
|
|
|
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);
|
|
|
|
}
|