2017-05-11 07:41:30 +08:00
|
|
|
//===- Function.cpp - Implement the Global object classes -----------------===//
|
2005-04-22 07:48:37 +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
|
2005-04-22 07:48:37 +08:00
|
|
|
//
|
2003-10-21 03:43:21 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-06-07 04:29:01 +08:00
|
|
|
//
|
2013-01-02 17:10:48 +08:00
|
|
|
// This file implements the Function class for the IR library.
|
2001-06-07 04:29:01 +08:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2017-06-06 19:49:48 +08:00
|
|
|
#include "llvm/IR/Function.h"
|
2012-12-04 00:50:05 +08:00
|
|
|
#include "SymbolTableListTraitsImpl.h"
|
2017-05-11 07:41:30 +08:00
|
|
|
#include "llvm/ADT/ArrayRef.h"
|
|
|
|
#include "llvm/ADT/DenseSet.h"
|
|
|
|
#include "llvm/ADT/None.h"
|
2017-06-06 19:49:48 +08:00
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2017-05-11 07:41:30 +08:00
|
|
|
#include "llvm/ADT/SmallString.h"
|
|
|
|
#include "llvm/ADT/SmallVector.h"
|
2012-12-04 00:50:05 +08:00
|
|
|
#include "llvm/ADT/StringExtras.h"
|
2017-05-11 07:41:30 +08:00
|
|
|
#include "llvm/ADT/StringRef.h"
|
|
|
|
#include "llvm/IR/Argument.h"
|
|
|
|
#include "llvm/IR/Attributes.h"
|
|
|
|
#include "llvm/IR/BasicBlock.h"
|
|
|
|
#include "llvm/IR/Constant.h"
|
2015-05-13 23:13:45 +08:00
|
|
|
#include "llvm/IR/Constants.h"
|
2013-01-02 19:36:10 +08:00
|
|
|
#include "llvm/IR/DerivedTypes.h"
|
2017-05-11 07:41:30 +08:00
|
|
|
#include "llvm/IR/GlobalValue.h"
|
2014-03-04 18:30:26 +08:00
|
|
|
#include "llvm/IR/InstIterator.h"
|
2017-05-11 07:41:30 +08:00
|
|
|
#include "llvm/IR/Instruction.h"
|
|
|
|
#include "llvm/IR/Instructions.h"
|
|
|
|
#include "llvm/IR/Intrinsics.h"
|
2019-12-11 23:55:26 +08:00
|
|
|
#include "llvm/IR/IntrinsicsAArch64.h"
|
|
|
|
#include "llvm/IR/IntrinsicsAMDGPU.h"
|
|
|
|
#include "llvm/IR/IntrinsicsARM.h"
|
|
|
|
#include "llvm/IR/IntrinsicsBPF.h"
|
|
|
|
#include "llvm/IR/IntrinsicsHexagon.h"
|
|
|
|
#include "llvm/IR/IntrinsicsMips.h"
|
|
|
|
#include "llvm/IR/IntrinsicsNVPTX.h"
|
|
|
|
#include "llvm/IR/IntrinsicsPowerPC.h"
|
|
|
|
#include "llvm/IR/IntrinsicsR600.h"
|
|
|
|
#include "llvm/IR/IntrinsicsRISCV.h"
|
|
|
|
#include "llvm/IR/IntrinsicsS390.h"
|
|
|
|
#include "llvm/IR/IntrinsicsWebAssembly.h"
|
|
|
|
#include "llvm/IR/IntrinsicsX86.h"
|
|
|
|
#include "llvm/IR/IntrinsicsXCore.h"
|
2013-01-02 19:36:10 +08:00
|
|
|
#include "llvm/IR/LLVMContext.h"
|
2015-05-13 23:13:45 +08:00
|
|
|
#include "llvm/IR/MDBuilder.h"
|
|
|
|
#include "llvm/IR/Metadata.h"
|
2013-01-02 19:36:10 +08:00
|
|
|
#include "llvm/IR/Module.h"
|
2017-05-11 07:41:30 +08:00
|
|
|
#include "llvm/IR/SymbolTableListTraits.h"
|
|
|
|
#include "llvm/IR/Type.h"
|
|
|
|
#include "llvm/IR/Use.h"
|
|
|
|
#include "llvm/IR/User.h"
|
|
|
|
#include "llvm/IR/Value.h"
|
|
|
|
#include "llvm/IR/ValueSymbolTable.h"
|
|
|
|
#include "llvm/Support/Casting.h"
|
|
|
|
#include "llvm/Support/Compiler.h"
|
|
|
|
#include "llvm/Support/ErrorHandling.h"
|
|
|
|
#include <algorithm>
|
|
|
|
#include <cassert>
|
|
|
|
#include <cstddef>
|
|
|
|
#include <cstdint>
|
|
|
|
#include <cstring>
|
|
|
|
#include <string>
|
|
|
|
|
2003-11-22 04:23:48 +08:00
|
|
|
using namespace llvm;
|
2018-01-18 06:24:23 +08:00
|
|
|
using ProfileCount = Function::ProfileCount;
|
2003-11-12 06:41:34 +08:00
|
|
|
|
2002-06-26 00:13:24 +08:00
|
|
|
// Explicit instantiations of SymbolTableListTraits since some of the methods
|
|
|
|
// are not in the public header file...
|
2015-10-08 04:05:10 +08:00
|
|
|
template class llvm::SymbolTableListTraits<BasicBlock>;
|
2001-06-07 04:29:01 +08:00
|
|
|
|
2002-04-10 03:39:35 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Argument Implementation
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2017-03-18 01:16:39 +08:00
|
|
|
Argument::Argument(Type *Ty, const Twine &Name, Function *Par, unsigned ArgNo)
|
|
|
|
: Value(Ty, Value::ArgumentVal), Parent(Par), ArgNo(ArgNo) {
|
2007-02-12 13:18:08 +08:00
|
|
|
setName(Name);
|
2002-09-07 05:33:15 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void Argument::setParent(Function *parent) {
|
|
|
|
Parent = parent;
|
|
|
|
}
|
|
|
|
|
2014-05-20 09:23:40 +08:00
|
|
|
bool Argument::hasNonNullAttr() const {
|
|
|
|
if (!getType()->isPointerTy()) return false;
|
2017-04-14 07:12:13 +08:00
|
|
|
if (getParent()->hasParamAttribute(getArgNo(), Attribute::NonNull))
|
2014-07-18 23:51:28 +08:00
|
|
|
return true;
|
|
|
|
else if (getDereferenceableBytes() > 0 &&
|
llvm: Add support for "-fno-delete-null-pointer-checks"
Summary:
Support for this option is needed for building Linux kernel.
This is a very frequently requested feature by kernel developers.
More details : https://lkml.org/lkml/2018/4/4/601
GCC option description for -fdelete-null-pointer-checks:
This Assume that programs cannot safely dereference null pointers,
and that no code or data element resides at address zero.
-fno-delete-null-pointer-checks is the inverse of this implying that
null pointer dereferencing is not undefined.
This feature is implemented in LLVM IR in this CL as the function attribute
"null-pointer-is-valid"="true" in IR (Under review at D47894).
The CL updates several passes that assumed null pointer dereferencing is
undefined to not optimize when the "null-pointer-is-valid"="true"
attribute is present.
Reviewers: t.p.northover, efriedma, jyknight, chandlerc, rnk, srhines, void, george.burgess.iv
Reviewed By: efriedma, george.burgess.iv
Subscribers: eraman, haicheng, george.burgess.iv, drinkcat, theraven, reames, sanjoy, xbolva00, llvm-commits
Differential Revision: https://reviews.llvm.org/D47895
llvm-svn: 336613
2018-07-10 06:27:23 +08:00
|
|
|
!NullPointerIsDefined(getParent(),
|
|
|
|
getType()->getPointerAddressSpace()))
|
2014-07-18 23:51:28 +08:00
|
|
|
return true;
|
|
|
|
return false;
|
2014-05-20 09:23:40 +08:00
|
|
|
}
|
|
|
|
|
2008-01-25 01:47:11 +08:00
|
|
|
bool Argument::hasByValAttr() const {
|
2010-02-16 19:11:14 +08:00
|
|
|
if (!getType()->isPointerTy()) return false;
|
2016-03-14 09:37:29 +08:00
|
|
|
return hasAttribute(Attribute::ByVal);
|
2008-01-25 01:47:11 +08:00
|
|
|
}
|
|
|
|
|
2016-03-30 01:37:21 +08:00
|
|
|
bool Argument::hasSwiftSelfAttr() const {
|
2017-04-14 07:12:13 +08:00
|
|
|
return getParent()->hasParamAttribute(getArgNo(), Attribute::SwiftSelf);
|
2016-03-30 01:37:21 +08:00
|
|
|
}
|
|
|
|
|
2016-04-02 05:41:15 +08:00
|
|
|
bool Argument::hasSwiftErrorAttr() const {
|
2017-04-14 07:12:13 +08:00
|
|
|
return getParent()->hasParamAttribute(getArgNo(), Attribute::SwiftError);
|
2016-04-02 05:41:15 +08:00
|
|
|
}
|
|
|
|
|
2013-12-19 10:14:12 +08:00
|
|
|
bool Argument::hasInAllocaAttr() const {
|
|
|
|
if (!getType()->isPointerTy()) return false;
|
2016-03-14 09:37:29 +08:00
|
|
|
return hasAttribute(Attribute::InAlloca);
|
2013-12-19 10:14:12 +08:00
|
|
|
}
|
|
|
|
|
2014-01-18 07:58:17 +08:00
|
|
|
bool Argument::hasByValOrInAllocaAttr() const {
|
|
|
|
if (!getType()->isPointerTy()) return false;
|
Rename AttributeSet to AttributeList
Summary:
This class is a list of AttributeSetNodes corresponding the function
prototype of a call or function declaration. This class used to be
called ParamAttrListPtr, then AttrListPtr, then AttributeSet. It is
typically accessed by parameter and return value index, so
"AttributeList" seems like a more intuitive name.
Rename AttributeSetImpl to AttributeListImpl to follow suit.
It's useful to rename this class so that we can rename AttributeSetNode
to AttributeSet later. AttributeSet is the set of attributes that apply
to a single function, argument, or return value.
Reviewers: sanjoy, javed.absar, chandlerc, pete
Reviewed By: pete
Subscribers: pete, jholewinski, arsenm, dschuff, mehdi_amini, jfb, nhaehnle, sbc100, void, llvm-commits
Differential Revision: https://reviews.llvm.org/D31102
llvm-svn: 298393
2017-03-22 00:57:19 +08:00
|
|
|
AttributeList Attrs = getParent()->getAttributes();
|
2017-04-14 07:12:13 +08:00
|
|
|
return Attrs.hasParamAttribute(getArgNo(), Attribute::ByVal) ||
|
|
|
|
Attrs.hasParamAttribute(getArgNo(), Attribute::InAlloca);
|
2014-01-18 07:58:17 +08:00
|
|
|
}
|
|
|
|
|
2011-05-23 07:57:23 +08:00
|
|
|
unsigned Argument::getParamAlignment() const {
|
|
|
|
assert(getType()->isPointerTy() && "Only pointers have alignments");
|
2017-04-29 04:34:27 +08:00
|
|
|
return getParent()->getParamAlignment(getArgNo());
|
2011-05-23 07:57:23 +08:00
|
|
|
}
|
|
|
|
|
2019-12-16 22:24:13 +08:00
|
|
|
MaybeAlign Argument::getParamAlign() const {
|
|
|
|
assert(getType()->isPointerTy() && "Only pointers have alignments");
|
|
|
|
return getParent()->getParamAlign(getArgNo());
|
|
|
|
}
|
|
|
|
|
2019-05-31 02:48:23 +08:00
|
|
|
Type *Argument::getParamByValType() const {
|
|
|
|
assert(getType()->isPointerTy() && "Only pointers have byval types");
|
|
|
|
return getParent()->getParamByValType(getArgNo());
|
|
|
|
}
|
|
|
|
|
2014-07-18 23:51:28 +08:00
|
|
|
uint64_t Argument::getDereferenceableBytes() const {
|
|
|
|
assert(getType()->isPointerTy() &&
|
|
|
|
"Only pointers have dereferenceable bytes");
|
2017-06-01 03:23:09 +08:00
|
|
|
return getParent()->getParamDereferenceableBytes(getArgNo());
|
2014-07-18 23:51:28 +08:00
|
|
|
}
|
|
|
|
|
2015-05-07 01:41:54 +08:00
|
|
|
uint64_t Argument::getDereferenceableOrNullBytes() const {
|
|
|
|
assert(getType()->isPointerTy() &&
|
|
|
|
"Only pointers have dereferenceable bytes");
|
2017-06-01 03:23:09 +08:00
|
|
|
return getParent()->getParamDereferenceableOrNullBytes(getArgNo());
|
2015-05-07 01:41:54 +08:00
|
|
|
}
|
|
|
|
|
2009-12-11 16:36:17 +08:00
|
|
|
bool Argument::hasNestAttr() const {
|
2010-02-16 19:11:14 +08:00
|
|
|
if (!getType()->isPointerTy()) return false;
|
2016-03-14 09:37:29 +08:00
|
|
|
return hasAttribute(Attribute::Nest);
|
2009-12-11 16:36:17 +08:00
|
|
|
}
|
|
|
|
|
2008-01-25 01:47:11 +08:00
|
|
|
bool Argument::hasNoAliasAttr() const {
|
2010-02-16 19:11:14 +08:00
|
|
|
if (!getType()->isPointerTy()) return false;
|
2016-03-14 09:37:29 +08:00
|
|
|
return hasAttribute(Attribute::NoAlias);
|
2008-01-25 01:47:11 +08:00
|
|
|
}
|
|
|
|
|
2009-01-01 02:08:59 +08:00
|
|
|
bool Argument::hasNoCaptureAttr() const {
|
2010-02-16 19:11:14 +08:00
|
|
|
if (!getType()->isPointerTy()) return false;
|
2016-03-14 09:37:29 +08:00
|
|
|
return hasAttribute(Attribute::NoCapture);
|
2009-01-01 02:08:59 +08:00
|
|
|
}
|
|
|
|
|
2008-02-18 07:22:28 +08:00
|
|
|
bool Argument::hasStructRetAttr() const {
|
2010-02-16 19:11:14 +08:00
|
|
|
if (!getType()->isPointerTy()) return false;
|
2016-03-14 09:37:29 +08:00
|
|
|
return hasAttribute(Attribute::StructRet);
|
2008-02-18 07:22:28 +08:00
|
|
|
}
|
|
|
|
|
2019-05-04 05:12:36 +08:00
|
|
|
bool Argument::hasInRegAttr() const {
|
|
|
|
return hasAttribute(Attribute::InReg);
|
|
|
|
}
|
|
|
|
|
2013-04-20 13:14:40 +08:00
|
|
|
bool Argument::hasReturnedAttr() const {
|
2016-03-14 09:37:29 +08:00
|
|
|
return hasAttribute(Attribute::Returned);
|
2013-04-20 13:14:40 +08:00
|
|
|
}
|
|
|
|
|
2014-08-05 13:43:41 +08:00
|
|
|
bool Argument::hasZExtAttr() const {
|
2016-03-14 09:37:29 +08:00
|
|
|
return hasAttribute(Attribute::ZExt);
|
2014-08-05 13:43:41 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
bool Argument::hasSExtAttr() const {
|
2016-03-14 09:37:29 +08:00
|
|
|
return hasAttribute(Attribute::SExt);
|
2014-08-05 13:43:41 +08:00
|
|
|
}
|
|
|
|
|
2013-07-06 08:29:58 +08:00
|
|
|
bool Argument::onlyReadsMemory() const {
|
2017-04-14 07:12:13 +08:00
|
|
|
AttributeList Attrs = getParent()->getAttributes();
|
|
|
|
return Attrs.hasParamAttribute(getArgNo(), Attribute::ReadOnly) ||
|
|
|
|
Attrs.hasParamAttribute(getArgNo(), Attribute::ReadNone);
|
2013-07-06 08:29:58 +08:00
|
|
|
}
|
|
|
|
|
2017-04-20 01:28:52 +08:00
|
|
|
void Argument::addAttrs(AttrBuilder &B) {
|
|
|
|
AttributeList AL = getParent()->getAttributes();
|
2017-06-01 03:23:09 +08:00
|
|
|
AL = AL.addParamAttributes(Parent->getContext(), getArgNo(), B);
|
2017-04-20 01:28:52 +08:00
|
|
|
getParent()->setAttributes(AL);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Argument::addAttr(Attribute::AttrKind Kind) {
|
2017-06-01 03:23:09 +08:00
|
|
|
getParent()->addParamAttr(getArgNo(), Kind);
|
2017-04-20 01:28:52 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void Argument::addAttr(Attribute Attr) {
|
2017-06-01 03:23:09 +08:00
|
|
|
getParent()->addParamAttr(getArgNo(), Attr);
|
2008-04-29 01:37:06 +08:00
|
|
|
}
|
2008-07-08 17:41:30 +08:00
|
|
|
|
2017-04-20 01:28:52 +08:00
|
|
|
void Argument::removeAttr(Attribute::AttrKind Kind) {
|
2017-06-01 03:23:09 +08:00
|
|
|
getParent()->removeParamAttr(getArgNo(), Kind);
|
2017-04-20 01:28:52 +08:00
|
|
|
}
|
|
|
|
|
2016-03-14 09:37:29 +08:00
|
|
|
bool Argument::hasAttribute(Attribute::AttrKind Kind) const {
|
2017-04-14 07:12:13 +08:00
|
|
|
return getParent()->hasParamAttribute(getArgNo(), Kind);
|
2016-03-14 09:37:29 +08:00
|
|
|
}
|
|
|
|
|
2019-06-06 04:37:47 +08:00
|
|
|
Attribute Argument::getAttribute(Attribute::AttrKind Kind) const {
|
|
|
|
return getParent()->getParamAttribute(getArgNo(), Kind);
|
|
|
|
}
|
|
|
|
|
2007-04-09 23:01:12 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
2008-01-03 07:42:30 +08:00
|
|
|
// Helper Methods in Function
|
2007-04-09 23:01:12 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2009-07-22 08:24:57 +08:00
|
|
|
LLVMContext &Function::getContext() const {
|
|
|
|
return getType()->getContext();
|
2009-07-03 02:03:58 +08:00
|
|
|
}
|
|
|
|
|
2018-10-19 03:49:44 +08:00
|
|
|
unsigned Function::getInstructionCount() const {
|
2018-05-19 01:26:39 +08:00
|
|
|
unsigned NumInstrs = 0;
|
2018-10-19 03:49:44 +08:00
|
|
|
for (const BasicBlock &BB : BasicBlocks)
|
2018-05-19 01:26:39 +08:00
|
|
|
NumInstrs += std::distance(BB.instructionsWithoutDebug().begin(),
|
|
|
|
BB.instructionsWithoutDebug().end());
|
|
|
|
return NumInstrs;
|
|
|
|
}
|
|
|
|
|
2018-08-23 17:25:17 +08:00
|
|
|
Function *Function::Create(FunctionType *Ty, LinkageTypes Linkage,
|
|
|
|
const Twine &N, Module &M) {
|
|
|
|
return Create(Ty, Linkage, M.getDataLayout().getProgramAddressSpace(), N, &M);
|
|
|
|
}
|
|
|
|
|
2008-01-03 07:42:30 +08:00
|
|
|
void Function::removeFromParent() {
|
2015-10-09 07:49:46 +08:00
|
|
|
getParent()->getFunctionList().remove(getIterator());
|
2007-11-25 22:10:56 +08:00
|
|
|
}
|
|
|
|
|
2008-01-03 07:42:30 +08:00
|
|
|
void Function::eraseFromParent() {
|
2015-10-09 07:49:46 +08:00
|
|
|
getParent()->getFunctionList().erase(getIterator());
|
2007-04-09 23:01:12 +08:00
|
|
|
}
|
|
|
|
|
2001-09-10 15:58:01 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
2002-03-27 02:01:55 +08:00
|
|
|
// Function Implementation
|
2001-09-10 15:58:01 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2018-08-23 17:25:17 +08:00
|
|
|
static unsigned computeAddrSpace(unsigned AddrSpace, Module *M) {
|
|
|
|
// If AS == -1 and we are passed a valid module pointer we place the function
|
|
|
|
// in the program address space. Otherwise we default to AS0.
|
|
|
|
if (AddrSpace == static_cast<unsigned>(-1))
|
|
|
|
return M ? M->getDataLayout().getProgramAddressSpace() : 0;
|
|
|
|
return AddrSpace;
|
|
|
|
}
|
|
|
|
|
|
|
|
Function::Function(FunctionType *Ty, LinkageTypes Linkage, unsigned AddrSpace,
|
|
|
|
const Twine &name, Module *ParentModule)
|
2015-08-22 05:35:28 +08:00
|
|
|
: GlobalObject(Ty, Value::FunctionVal,
|
2018-08-23 17:25:17 +08:00
|
|
|
OperandTraits<Function>::op_begin(this), 0, Linkage, name,
|
|
|
|
computeAddrSpace(AddrSpace, ParentModule)),
|
2017-05-11 07:41:30 +08:00
|
|
|
NumArgs(Ty->getNumParams()) {
|
2009-01-05 15:58:59 +08:00
|
|
|
assert(FunctionType::isValidReturnType(getReturnType()) &&
|
Land the long talked about "type system rewrite" patch. This
patch brings numerous advantages to LLVM. One way to look at it
is through diffstat:
109 files changed, 3005 insertions(+), 5906 deletions(-)
Removing almost 3K lines of code is a good thing. Other advantages
include:
1. Value::getType() is a simple load that can be CSE'd, not a mutating
union-find operation.
2. Types a uniqued and never move once created, defining away PATypeHolder.
3. Structs can be "named" now, and their name is part of the identity that
uniques them. This means that the compiler doesn't merge them structurally
which makes the IR much less confusing.
4. Now that there is no way to get a cycle in a type graph without a named
struct type, "upreferences" go away.
5. Type refinement is completely gone, which should make LTO much MUCH faster
in some common cases with C++ code.
6. Types are now generally immutable, so we can use "Type *" instead
"const Type *" everywhere.
Downsides of this patch are that it removes some functions from the C API,
so people using those will have to upgrade to (not yet added) new API.
"LLVM 3.0" is the right time to do this.
There are still some cleanups pending after this, this patch is large enough
as-is.
llvm-svn: 134829
2011-07-10 01:41:24 +08:00
|
|
|
"invalid return type");
|
2015-04-25 04:47:23 +08:00
|
|
|
setGlobalObjectSubClassData(0);
|
2016-09-17 14:00:02 +08:00
|
|
|
|
|
|
|
// We only need a symbol table for a function if the context keeps value names
|
|
|
|
if (!getContext().shouldDiscardValueNames())
|
2019-08-15 23:54:37 +08:00
|
|
|
SymTab = std::make_unique<ValueSymbolTable>();
|
2002-09-07 04:46:32 +08:00
|
|
|
|
2007-08-18 14:14:52 +08:00
|
|
|
// If the function has arguments, mark them as lazily built.
|
|
|
|
if (Ty->getNumParams())
|
2009-12-29 10:14:09 +08:00
|
|
|
setValueSubclassData(1); // Set the "has lazy arguments" bit.
|
2012-12-18 04:37:55 +08:00
|
|
|
|
2002-09-07 04:46:32 +08:00
|
|
|
if (ParentModule)
|
|
|
|
ParentModule->getFunctionList().push_back(this);
|
2008-04-07 21:39:11 +08:00
|
|
|
|
2016-12-29 06:59:45 +08:00
|
|
|
HasLLVMReservedName = getName().startswith("llvm.");
|
2008-04-07 21:39:11 +08:00
|
|
|
// Ensure intrinsics have the right parameter attributes.
|
2015-05-19 08:24:26 +08:00
|
|
|
// Note, the IntID field will have been set in Value::setName if this function
|
|
|
|
// name is a valid intrinsic ID.
|
|
|
|
if (IntID)
|
|
|
|
setAttributes(Intrinsic::getAttributes(getContext(), IntID));
|
2001-06-07 04:29:01 +08:00
|
|
|
}
|
|
|
|
|
2007-12-10 10:14:30 +08:00
|
|
|
Function::~Function() {
|
|
|
|
dropAllReferences(); // After this it is safe to delete instructions.
|
2001-06-07 04:29:01 +08:00
|
|
|
|
|
|
|
// Delete all of the method arguments and unlink from symbol table...
|
2017-03-18 01:16:39 +08:00
|
|
|
if (Arguments)
|
|
|
|
clearArguments();
|
2007-04-23 01:28:03 +08:00
|
|
|
|
2008-08-18 02:44:35 +08:00
|
|
|
// Remove the function from the on-the-side GC table.
|
|
|
|
clearGC();
|
2001-06-07 04:29:01 +08:00
|
|
|
}
|
|
|
|
|
2007-08-18 14:14:52 +08:00
|
|
|
void Function::BuildLazyArguments() const {
|
|
|
|
// Create the arguments vector, all arguments start out unnamed.
|
2017-03-18 01:16:39 +08:00
|
|
|
auto *FT = getFunctionType();
|
|
|
|
if (NumArgs > 0) {
|
|
|
|
Arguments = std::allocator<Argument>().allocate(NumArgs);
|
|
|
|
for (unsigned i = 0, e = NumArgs; i != e; ++i) {
|
|
|
|
Type *ArgTy = FT->getParamType(i);
|
|
|
|
assert(!ArgTy->isVoidTy() && "Cannot have void typed arguments!");
|
|
|
|
new (Arguments + i) Argument(ArgTy, "", const_cast<Function *>(this), i);
|
|
|
|
}
|
2007-08-18 14:14:52 +08:00
|
|
|
}
|
2012-12-18 04:37:55 +08:00
|
|
|
|
2007-08-18 14:14:52 +08:00
|
|
|
// Clear the lazy arguments bit.
|
2009-12-29 10:14:09 +08:00
|
|
|
unsigned SDC = getSubclassDataFromValue();
|
2019-09-23 20:49:39 +08:00
|
|
|
SDC &= ~(1 << 0);
|
|
|
|
const_cast<Function*>(this)->setValueSubclassData(SDC);
|
2017-03-18 01:16:39 +08:00
|
|
|
assert(!hasLazyArguments());
|
|
|
|
}
|
|
|
|
|
|
|
|
static MutableArrayRef<Argument> makeArgArray(Argument *Args, size_t Count) {
|
|
|
|
return MutableArrayRef<Argument>(Args, Count);
|
|
|
|
}
|
|
|
|
|
2020-04-11 00:35:42 +08:00
|
|
|
bool Function::isConstrainedFPIntrinsic() const {
|
|
|
|
switch (getIntrinsicID()) {
|
|
|
|
#define INSTRUCTION(NAME, NARG, ROUND_MODE, INTRINSIC) \
|
|
|
|
case Intrinsic::INTRINSIC:
|
|
|
|
#include "llvm/IR/ConstrainedOps.def"
|
|
|
|
return true;
|
|
|
|
#undef INSTRUCTION
|
|
|
|
default:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-03-18 01:16:39 +08:00
|
|
|
void Function::clearArguments() {
|
|
|
|
for (Argument &A : makeArgArray(Arguments, NumArgs)) {
|
|
|
|
A.setName("");
|
|
|
|
A.~Argument();
|
|
|
|
}
|
|
|
|
std::allocator<Argument>().deallocate(Arguments, NumArgs);
|
|
|
|
Arguments = nullptr;
|
2007-08-18 14:14:52 +08:00
|
|
|
}
|
|
|
|
|
2016-04-06 14:38:15 +08:00
|
|
|
void Function::stealArgumentListFrom(Function &Src) {
|
|
|
|
assert(isDeclaration() && "Expected no references to current arguments");
|
|
|
|
|
|
|
|
// Drop the current arguments, if any, and set the lazy argument bit.
|
|
|
|
if (!hasLazyArguments()) {
|
2017-03-18 01:16:39 +08:00
|
|
|
assert(llvm::all_of(makeArgArray(Arguments, NumArgs),
|
2016-04-06 14:38:15 +08:00
|
|
|
[](const Argument &A) { return A.use_empty(); }) &&
|
|
|
|
"Expected arguments to be unused in declaration");
|
2017-03-18 01:16:39 +08:00
|
|
|
clearArguments();
|
2016-04-06 14:38:15 +08:00
|
|
|
setValueSubclassData(getSubclassDataFromValue() | (1 << 0));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Nothing to steal if Src has lazy arguments.
|
|
|
|
if (Src.hasLazyArguments())
|
|
|
|
return;
|
|
|
|
|
|
|
|
// Steal arguments from Src, and fix the lazy argument bits.
|
2017-03-18 01:16:39 +08:00
|
|
|
assert(arg_size() == Src.arg_size());
|
|
|
|
Arguments = Src.Arguments;
|
|
|
|
Src.Arguments = nullptr;
|
|
|
|
for (Argument &A : makeArgArray(Arguments, NumArgs)) {
|
|
|
|
// FIXME: This does the work of transferNodesFromList inefficiently.
|
|
|
|
SmallString<128> Name;
|
|
|
|
if (A.hasName())
|
|
|
|
Name = A.getName();
|
|
|
|
if (!Name.empty())
|
|
|
|
A.setName("");
|
|
|
|
A.setParent(this);
|
|
|
|
if (!Name.empty())
|
|
|
|
A.setName(Name);
|
|
|
|
}
|
|
|
|
|
2016-04-06 14:38:15 +08:00
|
|
|
setValueSubclassData(getSubclassDataFromValue() & ~(1 << 0));
|
2017-03-18 01:16:39 +08:00
|
|
|
assert(!hasLazyArguments());
|
2016-04-06 14:38:15 +08:00
|
|
|
Src.setValueSubclassData(Src.getSubclassDataFromValue() | (1 << 0));
|
|
|
|
}
|
|
|
|
|
2001-06-07 04:29:01 +08:00
|
|
|
// dropAllReferences() - This function causes all the subinstructions to "let
|
|
|
|
// go" of all references that they are maintaining. This allows one to
|
|
|
|
// 'delete' a whole class at a time, even though there may be circular
|
|
|
|
// references... first all references are dropped, and all use counts go to
|
2003-10-11 01:54:14 +08:00
|
|
|
// zero. Then everything is deleted for real. Note that no operations are
|
2005-04-22 07:48:37 +08:00
|
|
|
// valid on an object that has "dropped all references", except operator
|
2001-06-07 04:29:01 +08:00
|
|
|
// delete.
|
|
|
|
//
|
2002-03-24 06:51:58 +08:00
|
|
|
void Function::dropAllReferences() {
|
2014-10-25 02:13:04 +08:00
|
|
|
setIsMaterializable(false);
|
|
|
|
|
2016-06-26 22:10:56 +08:00
|
|
|
for (BasicBlock &BB : *this)
|
|
|
|
BB.dropAllReferences();
|
2012-12-18 04:37:55 +08:00
|
|
|
|
2010-12-08 03:56:51 +08:00
|
|
|
// Delete all basic blocks. They are now unused, except possibly by
|
|
|
|
// blockaddresses, but BasicBlock's destructor takes care of those.
|
|
|
|
while (!BasicBlocks.empty())
|
|
|
|
BasicBlocks.begin()->eraseFromParent();
|
2013-09-16 09:08:15 +08:00
|
|
|
|
2015-12-19 16:52:49 +08:00
|
|
|
// Drop uses of any optional data (real or placeholder).
|
|
|
|
if (getNumOperands()) {
|
|
|
|
User::dropAllReferences();
|
|
|
|
setNumHungOffUseOperands(0);
|
|
|
|
setValueSubclassData(getSubclassDataFromValue() & ~0xe);
|
|
|
|
}
|
2015-04-25 05:51:02 +08:00
|
|
|
|
|
|
|
// Metadata is stored in a side-table.
|
|
|
|
clearMetadata();
|
2001-06-07 04:29:01 +08:00
|
|
|
}
|
2001-09-10 15:58:01 +08:00
|
|
|
|
2016-06-15 04:27:35 +08:00
|
|
|
void Function::addAttribute(unsigned i, Attribute::AttrKind Kind) {
|
Rename AttributeSet to AttributeList
Summary:
This class is a list of AttributeSetNodes corresponding the function
prototype of a call or function declaration. This class used to be
called ParamAttrListPtr, then AttrListPtr, then AttributeSet. It is
typically accessed by parameter and return value index, so
"AttributeList" seems like a more intuitive name.
Rename AttributeSetImpl to AttributeListImpl to follow suit.
It's useful to rename this class so that we can rename AttributeSetNode
to AttributeSet later. AttributeSet is the set of attributes that apply
to a single function, argument, or return value.
Reviewers: sanjoy, javed.absar, chandlerc, pete
Reviewed By: pete
Subscribers: pete, jholewinski, arsenm, dschuff, mehdi_amini, jfb, nhaehnle, sbc100, void, llvm-commits
Differential Revision: https://reviews.llvm.org/D31102
llvm-svn: 298393
2017-03-22 00:57:19 +08:00
|
|
|
AttributeList PAL = getAttributes();
|
2016-06-15 04:27:35 +08:00
|
|
|
PAL = PAL.addAttribute(getContext(), i, Kind);
|
2013-01-23 08:20:53 +08:00
|
|
|
setAttributes(PAL);
|
|
|
|
}
|
|
|
|
|
2016-06-12 14:17:24 +08:00
|
|
|
void Function::addAttribute(unsigned i, Attribute Attr) {
|
Rename AttributeSet to AttributeList
Summary:
This class is a list of AttributeSetNodes corresponding the function
prototype of a call or function declaration. This class used to be
called ParamAttrListPtr, then AttrListPtr, then AttributeSet. It is
typically accessed by parameter and return value index, so
"AttributeList" seems like a more intuitive name.
Rename AttributeSetImpl to AttributeListImpl to follow suit.
It's useful to rename this class so that we can rename AttributeSetNode
to AttributeSet later. AttributeSet is the set of attributes that apply
to a single function, argument, or return value.
Reviewers: sanjoy, javed.absar, chandlerc, pete
Reviewed By: pete
Subscribers: pete, jholewinski, arsenm, dschuff, mehdi_amini, jfb, nhaehnle, sbc100, void, llvm-commits
Differential Revision: https://reviews.llvm.org/D31102
llvm-svn: 298393
2017-03-22 00:57:19 +08:00
|
|
|
AttributeList PAL = getAttributes();
|
2016-06-12 14:17:24 +08:00
|
|
|
PAL = PAL.addAttribute(getContext(), i, Attr);
|
|
|
|
setAttributes(PAL);
|
|
|
|
}
|
|
|
|
|
2017-05-03 06:07:37 +08:00
|
|
|
void Function::addAttributes(unsigned i, const AttrBuilder &Attrs) {
|
Rename AttributeSet to AttributeList
Summary:
This class is a list of AttributeSetNodes corresponding the function
prototype of a call or function declaration. This class used to be
called ParamAttrListPtr, then AttrListPtr, then AttributeSet. It is
typically accessed by parameter and return value index, so
"AttributeList" seems like a more intuitive name.
Rename AttributeSetImpl to AttributeListImpl to follow suit.
It's useful to rename this class so that we can rename AttributeSetNode
to AttributeSet later. AttributeSet is the set of attributes that apply
to a single function, argument, or return value.
Reviewers: sanjoy, javed.absar, chandlerc, pete
Reviewed By: pete
Subscribers: pete, jholewinski, arsenm, dschuff, mehdi_amini, jfb, nhaehnle, sbc100, void, llvm-commits
Differential Revision: https://reviews.llvm.org/D31102
llvm-svn: 298393
2017-03-22 00:57:19 +08:00
|
|
|
AttributeList PAL = getAttributes();
|
2016-06-15 04:27:35 +08:00
|
|
|
PAL = PAL.addAttributes(getContext(), i, Attrs);
|
2008-09-26 05:00:45 +08:00
|
|
|
setAttributes(PAL);
|
2008-04-08 15:23:58 +08:00
|
|
|
}
|
|
|
|
|
2017-06-01 03:23:09 +08:00
|
|
|
void Function::addParamAttr(unsigned ArgNo, Attribute::AttrKind Kind) {
|
|
|
|
AttributeList PAL = getAttributes();
|
|
|
|
PAL = PAL.addParamAttribute(getContext(), ArgNo, Kind);
|
|
|
|
setAttributes(PAL);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Function::addParamAttr(unsigned ArgNo, Attribute Attr) {
|
|
|
|
AttributeList PAL = getAttributes();
|
|
|
|
PAL = PAL.addParamAttribute(getContext(), ArgNo, Attr);
|
|
|
|
setAttributes(PAL);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Function::addParamAttrs(unsigned ArgNo, const AttrBuilder &Attrs) {
|
|
|
|
AttributeList PAL = getAttributes();
|
|
|
|
PAL = PAL.addParamAttributes(getContext(), ArgNo, Attrs);
|
|
|
|
setAttributes(PAL);
|
|
|
|
}
|
|
|
|
|
2016-06-15 04:27:35 +08:00
|
|
|
void Function::removeAttribute(unsigned i, Attribute::AttrKind Kind) {
|
Rename AttributeSet to AttributeList
Summary:
This class is a list of AttributeSetNodes corresponding the function
prototype of a call or function declaration. This class used to be
called ParamAttrListPtr, then AttrListPtr, then AttributeSet. It is
typically accessed by parameter and return value index, so
"AttributeList" seems like a more intuitive name.
Rename AttributeSetImpl to AttributeListImpl to follow suit.
It's useful to rename this class so that we can rename AttributeSetNode
to AttributeSet later. AttributeSet is the set of attributes that apply
to a single function, argument, or return value.
Reviewers: sanjoy, javed.absar, chandlerc, pete
Reviewed By: pete
Subscribers: pete, jholewinski, arsenm, dschuff, mehdi_amini, jfb, nhaehnle, sbc100, void, llvm-commits
Differential Revision: https://reviews.llvm.org/D31102
llvm-svn: 298393
2017-03-22 00:57:19 +08:00
|
|
|
AttributeList PAL = getAttributes();
|
2016-06-15 04:27:35 +08:00
|
|
|
PAL = PAL.removeAttribute(getContext(), i, Kind);
|
2016-03-14 09:37:29 +08:00
|
|
|
setAttributes(PAL);
|
|
|
|
}
|
|
|
|
|
2016-06-16 01:50:39 +08:00
|
|
|
void Function::removeAttribute(unsigned i, StringRef Kind) {
|
Rename AttributeSet to AttributeList
Summary:
This class is a list of AttributeSetNodes corresponding the function
prototype of a call or function declaration. This class used to be
called ParamAttrListPtr, then AttrListPtr, then AttributeSet. It is
typically accessed by parameter and return value index, so
"AttributeList" seems like a more intuitive name.
Rename AttributeSetImpl to AttributeListImpl to follow suit.
It's useful to rename this class so that we can rename AttributeSetNode
to AttributeSet later. AttributeSet is the set of attributes that apply
to a single function, argument, or return value.
Reviewers: sanjoy, javed.absar, chandlerc, pete
Reviewed By: pete
Subscribers: pete, jholewinski, arsenm, dschuff, mehdi_amini, jfb, nhaehnle, sbc100, void, llvm-commits
Differential Revision: https://reviews.llvm.org/D31102
llvm-svn: 298393
2017-03-22 00:57:19 +08:00
|
|
|
AttributeList PAL = getAttributes();
|
2016-06-16 01:50:39 +08:00
|
|
|
PAL = PAL.removeAttribute(getContext(), i, Kind);
|
|
|
|
setAttributes(PAL);
|
|
|
|
}
|
|
|
|
|
2017-05-03 06:07:37 +08:00
|
|
|
void Function::removeAttributes(unsigned i, const AttrBuilder &Attrs) {
|
Rename AttributeSet to AttributeList
Summary:
This class is a list of AttributeSetNodes corresponding the function
prototype of a call or function declaration. This class used to be
called ParamAttrListPtr, then AttrListPtr, then AttributeSet. It is
typically accessed by parameter and return value index, so
"AttributeList" seems like a more intuitive name.
Rename AttributeSetImpl to AttributeListImpl to follow suit.
It's useful to rename this class so that we can rename AttributeSetNode
to AttributeSet later. AttributeSet is the set of attributes that apply
to a single function, argument, or return value.
Reviewers: sanjoy, javed.absar, chandlerc, pete
Reviewed By: pete
Subscribers: pete, jholewinski, arsenm, dschuff, mehdi_amini, jfb, nhaehnle, sbc100, void, llvm-commits
Differential Revision: https://reviews.llvm.org/D31102
llvm-svn: 298393
2017-03-22 00:57:19 +08:00
|
|
|
AttributeList PAL = getAttributes();
|
2016-06-15 04:27:35 +08:00
|
|
|
PAL = PAL.removeAttributes(getContext(), i, Attrs);
|
2008-09-26 05:00:45 +08:00
|
|
|
setAttributes(PAL);
|
2008-05-17 04:39:43 +08:00
|
|
|
}
|
|
|
|
|
2017-06-01 03:23:09 +08:00
|
|
|
void Function::removeParamAttr(unsigned ArgNo, Attribute::AttrKind Kind) {
|
|
|
|
AttributeList PAL = getAttributes();
|
|
|
|
PAL = PAL.removeParamAttribute(getContext(), ArgNo, Kind);
|
|
|
|
setAttributes(PAL);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Function::removeParamAttr(unsigned ArgNo, StringRef Kind) {
|
|
|
|
AttributeList PAL = getAttributes();
|
|
|
|
PAL = PAL.removeParamAttribute(getContext(), ArgNo, Kind);
|
|
|
|
setAttributes(PAL);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Function::removeParamAttrs(unsigned ArgNo, const AttrBuilder &Attrs) {
|
|
|
|
AttributeList PAL = getAttributes();
|
|
|
|
PAL = PAL.removeParamAttributes(getContext(), ArgNo, Attrs);
|
|
|
|
setAttributes(PAL);
|
|
|
|
}
|
|
|
|
|
2015-02-15 03:37:54 +08:00
|
|
|
void Function::addDereferenceableAttr(unsigned i, uint64_t Bytes) {
|
Rename AttributeSet to AttributeList
Summary:
This class is a list of AttributeSetNodes corresponding the function
prototype of a call or function declaration. This class used to be
called ParamAttrListPtr, then AttrListPtr, then AttributeSet. It is
typically accessed by parameter and return value index, so
"AttributeList" seems like a more intuitive name.
Rename AttributeSetImpl to AttributeListImpl to follow suit.
It's useful to rename this class so that we can rename AttributeSetNode
to AttributeSet later. AttributeSet is the set of attributes that apply
to a single function, argument, or return value.
Reviewers: sanjoy, javed.absar, chandlerc, pete
Reviewed By: pete
Subscribers: pete, jholewinski, arsenm, dschuff, mehdi_amini, jfb, nhaehnle, sbc100, void, llvm-commits
Differential Revision: https://reviews.llvm.org/D31102
llvm-svn: 298393
2017-03-22 00:57:19 +08:00
|
|
|
AttributeList PAL = getAttributes();
|
2015-02-15 03:37:54 +08:00
|
|
|
PAL = PAL.addDereferenceableAttr(getContext(), i, Bytes);
|
|
|
|
setAttributes(PAL);
|
|
|
|
}
|
|
|
|
|
2017-06-01 03:23:09 +08:00
|
|
|
void Function::addDereferenceableParamAttr(unsigned ArgNo, uint64_t Bytes) {
|
|
|
|
AttributeList PAL = getAttributes();
|
|
|
|
PAL = PAL.addDereferenceableParamAttr(getContext(), ArgNo, Bytes);
|
|
|
|
setAttributes(PAL);
|
|
|
|
}
|
|
|
|
|
2015-04-17 04:29:50 +08:00
|
|
|
void Function::addDereferenceableOrNullAttr(unsigned i, uint64_t Bytes) {
|
Rename AttributeSet to AttributeList
Summary:
This class is a list of AttributeSetNodes corresponding the function
prototype of a call or function declaration. This class used to be
called ParamAttrListPtr, then AttrListPtr, then AttributeSet. It is
typically accessed by parameter and return value index, so
"AttributeList" seems like a more intuitive name.
Rename AttributeSetImpl to AttributeListImpl to follow suit.
It's useful to rename this class so that we can rename AttributeSetNode
to AttributeSet later. AttributeSet is the set of attributes that apply
to a single function, argument, or return value.
Reviewers: sanjoy, javed.absar, chandlerc, pete
Reviewed By: pete
Subscribers: pete, jholewinski, arsenm, dschuff, mehdi_amini, jfb, nhaehnle, sbc100, void, llvm-commits
Differential Revision: https://reviews.llvm.org/D31102
llvm-svn: 298393
2017-03-22 00:57:19 +08:00
|
|
|
AttributeList PAL = getAttributes();
|
2015-04-17 04:29:50 +08:00
|
|
|
PAL = PAL.addDereferenceableOrNullAttr(getContext(), i, Bytes);
|
|
|
|
setAttributes(PAL);
|
|
|
|
}
|
|
|
|
|
2017-06-01 03:23:09 +08:00
|
|
|
void Function::addDereferenceableOrNullParamAttr(unsigned ArgNo,
|
|
|
|
uint64_t Bytes) {
|
|
|
|
AttributeList PAL = getAttributes();
|
|
|
|
PAL = PAL.addDereferenceableOrNullParamAttr(getContext(), ArgNo, Bytes);
|
|
|
|
setAttributes(PAL);
|
|
|
|
}
|
|
|
|
|
2016-01-08 10:28:20 +08:00
|
|
|
const std::string &Function::getGC() const {
|
2008-08-18 02:44:35 +08:00
|
|
|
assert(hasGC() && "Function has no collector");
|
2016-01-08 10:28:20 +08:00
|
|
|
return getContext().getGC(*this);
|
2007-12-10 11:18:06 +08:00
|
|
|
}
|
|
|
|
|
2016-05-29 18:46:35 +08:00
|
|
|
void Function::setGC(std::string Str) {
|
2016-01-08 10:28:20 +08:00
|
|
|
setValueSubclassDataBit(14, !Str.empty());
|
|
|
|
getContext().setGC(*this, std::move(Str));
|
2007-12-10 11:18:06 +08:00
|
|
|
}
|
|
|
|
|
2008-08-18 02:44:35 +08:00
|
|
|
void Function::clearGC() {
|
2016-01-08 10:28:20 +08:00
|
|
|
if (!hasGC())
|
|
|
|
return;
|
|
|
|
getContext().deleteGC(*this);
|
|
|
|
setValueSubclassDataBit(14, false);
|
2007-12-10 11:18:06 +08:00
|
|
|
}
|
|
|
|
|
2015-12-03 04:03:17 +08:00
|
|
|
/// Copy all additional attributes (those not needed to create a Function) from
|
|
|
|
/// the Function Src to this one.
|
2017-05-12 05:14:29 +08:00
|
|
|
void Function::copyAttributesFrom(const Function *Src) {
|
2014-05-14 02:45:48 +08:00
|
|
|
GlobalObject::copyAttributesFrom(Src);
|
2017-05-12 05:14:29 +08:00
|
|
|
setCallingConv(Src->getCallingConv());
|
|
|
|
setAttributes(Src->getAttributes());
|
|
|
|
if (Src->hasGC())
|
|
|
|
setGC(Src->getGC());
|
2008-08-18 02:44:35 +08:00
|
|
|
else
|
|
|
|
clearGC();
|
2017-05-12 05:14:29 +08:00
|
|
|
if (Src->hasPersonalityFn())
|
|
|
|
setPersonalityFn(Src->getPersonalityFn());
|
|
|
|
if (Src->hasPrefixData())
|
|
|
|
setPrefixData(Src->getPrefixData());
|
|
|
|
if (Src->hasPrologueData())
|
|
|
|
setPrologueData(Src->getPrologueData());
|
2008-05-27 03:58:59 +08:00
|
|
|
}
|
|
|
|
|
2016-01-26 10:06:41 +08:00
|
|
|
/// Table of string intrinsic names indexed by enum value.
|
|
|
|
static const char * const IntrinsicNameTable[] = {
|
|
|
|
"not_intrinsic",
|
|
|
|
#define GET_INTRINSIC_NAME_TABLE
|
2018-06-23 10:02:38 +08:00
|
|
|
#include "llvm/IR/IntrinsicImpl.inc"
|
2016-01-26 10:06:41 +08:00
|
|
|
#undef GET_INTRINSIC_NAME_TABLE
|
|
|
|
};
|
|
|
|
|
2016-07-16 00:31:37 +08:00
|
|
|
/// Table of per-target intrinsic name tables.
|
|
|
|
#define GET_INTRINSIC_TARGET_DATA
|
2018-06-23 10:02:38 +08:00
|
|
|
#include "llvm/IR/IntrinsicImpl.inc"
|
2016-07-16 00:31:37 +08:00
|
|
|
#undef GET_INTRINSIC_TARGET_DATA
|
|
|
|
|
|
|
|
/// Find the segment of \c IntrinsicNameTable for intrinsics with the same
|
|
|
|
/// target as \c Name, or the generic table if \c Name is not target specific.
|
|
|
|
///
|
|
|
|
/// Returns the relevant slice of \c IntrinsicNameTable
|
|
|
|
static ArrayRef<const char *> findTargetSubtable(StringRef Name) {
|
|
|
|
assert(Name.startswith("llvm."));
|
|
|
|
|
|
|
|
ArrayRef<IntrinsicTargetInfo> Targets(TargetInfos);
|
|
|
|
// Drop "llvm." and take the first dotted component. That will be the target
|
|
|
|
// if this is target specific.
|
|
|
|
StringRef Target = Name.drop_front(5).split('.').first;
|
2019-06-30 19:19:56 +08:00
|
|
|
auto It = partition_point(
|
|
|
|
Targets, [=](const IntrinsicTargetInfo &TI) { return TI.Name < Target; });
|
2016-07-16 00:31:37 +08:00
|
|
|
// We've either found the target or just fall back to the generic set, which
|
|
|
|
// is always first.
|
|
|
|
const auto &TI = It != Targets.end() && It->Name == Target ? *It : Targets[0];
|
|
|
|
return makeArrayRef(&IntrinsicNameTable[1] + TI.Offset, TI.Count);
|
|
|
|
}
|
|
|
|
|
2018-05-01 23:54:18 +08:00
|
|
|
/// This does the actual lookup of an intrinsic ID which
|
2015-05-19 08:02:25 +08:00
|
|
|
/// matches the given function name.
|
2016-07-30 04:32:59 +08:00
|
|
|
Intrinsic::ID Function::lookupIntrinsicID(StringRef Name) {
|
2016-07-16 00:31:37 +08:00
|
|
|
ArrayRef<const char *> NameTable = findTargetSubtable(Name);
|
2016-01-27 06:33:19 +08:00
|
|
|
int Idx = Intrinsic::lookupLLVMIntrinsicByName(NameTable, Name);
|
2016-07-16 00:31:37 +08:00
|
|
|
if (Idx == -1)
|
|
|
|
return Intrinsic::not_intrinsic;
|
|
|
|
|
|
|
|
// Intrinsic IDs correspond to the location in IntrinsicNameTable, but we have
|
|
|
|
// an index into a sub-table.
|
|
|
|
int Adjust = NameTable.data() - IntrinsicNameTable;
|
|
|
|
Intrinsic::ID ID = static_cast<Intrinsic::ID>(Idx + Adjust);
|
2015-05-19 08:02:25 +08:00
|
|
|
|
2016-01-26 10:06:41 +08:00
|
|
|
// If the intrinsic is not overloaded, require an exact match. If it is
|
[MIRParser] Accept overloaded intrinsic names w/o type suffixes
Function::lookupIntrinsicID is somewhat forgiving as it comes to
overloaded intrinsics' names: it returns an ID as soon as the name
provided has a prefix that matches a registered intrinsic's name w/o
actually checking that the rest of the name encodes all the concrete arg
types, let alone that those types are compatible with the intrinsic's
definition.
That's probably fine and comes in handy in MIR serialization: we don't
care about IR types at MIR level and every intrinsic should be
selectable based on its ID and low-level types (LLTs) of its operands,
including the overloaded ones, so there is no point in serializing
mangled IR types as part of the intrinsic's name.
However, lookupIntrinsicID is somewhat inconsistent in its forgiveness:
if the name provided is actually an exact match, it will refuse to
return the ID if the intrinsic is overloaded. There is probably no
real reason for that and it renders MIRParser incapable to deserialize
MIR MIRPrinter serialized.
This commit fixes it.
Reviewers: rnk, aditya_nandakumar, qcolombet, thegameg, dsanders,
marcello.maggioni
Reviewed By: bogner
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D43267
llvm-svn: 326387
2018-03-01 07:51:49 +08:00
|
|
|
// overloaded, require either exact or prefix match.
|
|
|
|
const auto MatchSize = strlen(NameTable[Idx]);
|
|
|
|
assert(Name.size() >= MatchSize && "Expected either exact or prefix match");
|
|
|
|
bool IsExactMatch = Name.size() == MatchSize;
|
2019-12-11 23:55:26 +08:00
|
|
|
return IsExactMatch || Intrinsic::isOverloaded(ID) ? ID
|
|
|
|
: Intrinsic::not_intrinsic;
|
2015-05-19 08:02:25 +08:00
|
|
|
}
|
|
|
|
|
2015-05-19 08:24:26 +08:00
|
|
|
void Function::recalculateIntrinsicID() {
|
2016-12-29 06:59:45 +08:00
|
|
|
StringRef Name = getName();
|
|
|
|
if (!Name.startswith("llvm.")) {
|
|
|
|
HasLLVMReservedName = false;
|
2015-05-19 08:24:26 +08:00
|
|
|
IntID = Intrinsic::not_intrinsic;
|
|
|
|
return;
|
2013-03-02 02:48:54 +08:00
|
|
|
}
|
2016-12-29 06:59:45 +08:00
|
|
|
HasLLVMReservedName = true;
|
|
|
|
IntID = lookupIntrinsicID(Name);
|
2013-03-02 02:48:54 +08:00
|
|
|
}
|
|
|
|
|
2014-11-12 08:21:51 +08:00
|
|
|
/// Returns a stable mangling for the type specified for use in the name
|
2014-11-25 07:24:24 +08:00
|
|
|
/// mangling scheme used by 'any' types in intrinsic signatures. The mangling
|
|
|
|
/// of named types is simply their name. Manglings for unnamed types consist
|
|
|
|
/// of a prefix ('p' for pointers, 'a' for arrays, 'f_' for functions)
|
|
|
|
/// combined with the mangling of their component types. A vararg function
|
|
|
|
/// type will have a suffix of 'vararg'. Since function types can contain
|
|
|
|
/// other function types, we close a function type mangling with suffix 'f'
|
|
|
|
/// which can't be confused with it's prefix. This ensures we don't have
|
|
|
|
/// collisions between two unrelated function types. Otherwise, you might
|
|
|
|
/// parse ffXX as f(fXX) or f(fX)X. (X is a placeholder for any other type.)
|
2018-03-30 01:21:10 +08:00
|
|
|
///
|
2014-11-12 08:21:51 +08:00
|
|
|
static std::string getMangledTypeStr(Type* Ty) {
|
|
|
|
std::string Result;
|
|
|
|
if (PointerType* PTyp = dyn_cast<PointerType>(Ty)) {
|
2017-05-11 07:41:30 +08:00
|
|
|
Result += "p" + utostr(PTyp->getAddressSpace()) +
|
2014-11-12 08:21:51 +08:00
|
|
|
getMangledTypeStr(PTyp->getElementType());
|
|
|
|
} else if (ArrayType* ATyp = dyn_cast<ArrayType>(Ty)) {
|
2017-05-11 07:41:30 +08:00
|
|
|
Result += "a" + utostr(ATyp->getNumElements()) +
|
2014-11-12 08:21:51 +08:00
|
|
|
getMangledTypeStr(ATyp->getElementType());
|
2017-02-16 07:16:20 +08:00
|
|
|
} else if (StructType *STyp = dyn_cast<StructType>(Ty)) {
|
|
|
|
if (!STyp->isLiteral()) {
|
|
|
|
Result += "s_";
|
|
|
|
Result += STyp->getName();
|
|
|
|
} else {
|
|
|
|
Result += "sl_";
|
|
|
|
for (auto Elem : STyp->elements())
|
|
|
|
Result += getMangledTypeStr(Elem);
|
|
|
|
}
|
|
|
|
// Ensure nested structs are distinguishable.
|
|
|
|
Result += "s";
|
|
|
|
} else if (FunctionType *FT = dyn_cast<FunctionType>(Ty)) {
|
2014-11-12 08:21:51 +08:00
|
|
|
Result += "f_" + getMangledTypeStr(FT->getReturnType());
|
|
|
|
for (size_t i = 0; i < FT->getNumParams(); i++)
|
|
|
|
Result += getMangledTypeStr(FT->getParamType(i));
|
|
|
|
if (FT->isVarArg())
|
|
|
|
Result += "vararg";
|
2014-11-25 07:24:24 +08:00
|
|
|
// Ensure nested function types are distinguishable.
|
2018-07-31 03:41:25 +08:00
|
|
|
Result += "f";
|
2019-08-27 20:57:09 +08:00
|
|
|
} else if (VectorType* VTy = dyn_cast<VectorType>(Ty)) {
|
|
|
|
if (VTy->isScalable())
|
|
|
|
Result += "nx";
|
2020-04-11 04:59:26 +08:00
|
|
|
Result += "v" + utostr(VTy->getNumElements()) +
|
|
|
|
getMangledTypeStr(VTy->getElementType());
|
2018-03-30 01:21:10 +08:00
|
|
|
} else if (Ty) {
|
|
|
|
switch (Ty->getTypeID()) {
|
|
|
|
default: llvm_unreachable("Unhandled type");
|
|
|
|
case Type::VoidTyID: Result += "isVoid"; break;
|
|
|
|
case Type::MetadataTyID: Result += "Metadata"; break;
|
|
|
|
case Type::HalfTyID: Result += "f16"; break;
|
|
|
|
case Type::FloatTyID: Result += "f32"; break;
|
|
|
|
case Type::DoubleTyID: Result += "f64"; break;
|
|
|
|
case Type::X86_FP80TyID: Result += "f80"; break;
|
|
|
|
case Type::FP128TyID: Result += "f128"; break;
|
|
|
|
case Type::PPC_FP128TyID: Result += "ppcf128"; break;
|
|
|
|
case Type::X86_MMXTyID: Result += "x86mmx"; break;
|
|
|
|
case Type::IntegerTyID:
|
|
|
|
Result += "i" + utostr(cast<IntegerType>(Ty)->getBitWidth());
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2014-11-12 08:21:51 +08:00
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
2016-08-19 02:30:54 +08:00
|
|
|
StringRef Intrinsic::getName(ID id) {
|
|
|
|
assert(id < num_intrinsics && "Invalid intrinsic ID!");
|
2019-12-11 23:55:26 +08:00
|
|
|
assert(!Intrinsic::isOverloaded(id) &&
|
2016-08-23 04:18:28 +08:00
|
|
|
"This version of getName does not support overloading");
|
2016-08-19 02:30:54 +08:00
|
|
|
return IntrinsicNameTable[id];
|
|
|
|
}
|
|
|
|
|
2011-07-15 01:45:39 +08:00
|
|
|
std::string Intrinsic::getName(ID id, ArrayRef<Type*> Tys) {
|
2006-03-25 14:32:47 +08:00
|
|
|
assert(id < num_intrinsics && "Invalid intrinsic ID!");
|
2016-01-26 10:06:41 +08:00
|
|
|
std::string Result(IntrinsicNameTable[id]);
|
2016-06-26 22:10:56 +08:00
|
|
|
for (Type *Ty : Tys) {
|
|
|
|
Result += "." + getMangledTypeStr(Ty);
|
2008-07-30 12:36:53 +08:00
|
|
|
}
|
2007-04-01 15:25:33 +08:00
|
|
|
return Result;
|
2006-03-25 14:32:47 +08:00
|
|
|
}
|
|
|
|
|
2012-05-28 02:28:35 +08:00
|
|
|
/// IIT_Info - These are enumerators that describe the entries returned by the
|
|
|
|
/// getIntrinsicInfoTableEntries function.
|
|
|
|
///
|
|
|
|
/// NOTE: This must be kept in synch with the copy in TblGen/IntrinsicEmitter!
|
|
|
|
enum IIT_Info {
|
2014-10-21 03:25:05 +08:00
|
|
|
// Common values should be encoded with 0-15.
|
2012-05-28 02:28:35 +08:00
|
|
|
IIT_Done = 0,
|
|
|
|
IIT_I1 = 1,
|
|
|
|
IIT_I8 = 2,
|
|
|
|
IIT_I16 = 3,
|
|
|
|
IIT_I32 = 4,
|
|
|
|
IIT_I64 = 5,
|
2013-01-11 09:45:05 +08:00
|
|
|
IIT_F16 = 6,
|
|
|
|
IIT_F32 = 7,
|
|
|
|
IIT_F64 = 8,
|
|
|
|
IIT_V2 = 9,
|
|
|
|
IIT_V4 = 10,
|
|
|
|
IIT_V8 = 11,
|
|
|
|
IIT_V16 = 12,
|
|
|
|
IIT_V32 = 13,
|
2014-10-21 03:25:05 +08:00
|
|
|
IIT_PTR = 14,
|
|
|
|
IIT_ARG = 15,
|
2014-09-30 19:32:22 +08:00
|
|
|
|
2014-10-21 03:25:05 +08:00
|
|
|
// Values from 16+ are only encodable with the inefficient encoding.
|
|
|
|
IIT_V64 = 16,
|
2014-09-30 19:32:22 +08:00
|
|
|
IIT_MMX = 17,
|
2015-09-02 21:36:25 +08:00
|
|
|
IIT_TOKEN = 18,
|
|
|
|
IIT_METADATA = 19,
|
|
|
|
IIT_EMPTYSTRUCT = 20,
|
|
|
|
IIT_STRUCT2 = 21,
|
|
|
|
IIT_STRUCT3 = 22,
|
|
|
|
IIT_STRUCT4 = 23,
|
|
|
|
IIT_STRUCT5 = 24,
|
|
|
|
IIT_EXTEND_ARG = 25,
|
|
|
|
IIT_TRUNC_ARG = 26,
|
|
|
|
IIT_ANYPTR = 27,
|
|
|
|
IIT_V1 = 28,
|
|
|
|
IIT_VARARG = 29,
|
|
|
|
IIT_HALF_VEC_ARG = 30,
|
|
|
|
IIT_SAME_VEC_WIDTH_ARG = 31,
|
|
|
|
IIT_PTR_TO_ARG = 32,
|
2016-11-03 11:23:55 +08:00
|
|
|
IIT_PTR_TO_ELT = 33,
|
2017-05-03 20:28:54 +08:00
|
|
|
IIT_VEC_OF_ANYPTRS_TO_ELT = 34,
|
2016-11-03 11:23:55 +08:00
|
|
|
IIT_I128 = 35,
|
|
|
|
IIT_V512 = 36,
|
2017-10-13 01:40:00 +08:00
|
|
|
IIT_V1024 = 37,
|
|
|
|
IIT_STRUCT6 = 38,
|
|
|
|
IIT_STRUCT7 = 39,
|
2018-07-10 02:50:06 +08:00
|
|
|
IIT_STRUCT8 = 40,
|
2019-06-13 17:37:38 +08:00
|
|
|
IIT_F128 = 41,
|
2019-08-27 20:57:09 +08:00
|
|
|
IIT_VEC_ELEMENT = 42,
|
2019-09-20 17:48:21 +08:00
|
|
|
IIT_SCALABLE_VEC = 43,
|
|
|
|
IIT_SUBDIVIDE2_ARG = 44,
|
2019-10-02 17:25:02 +08:00
|
|
|
IIT_SUBDIVIDE4_ARG = 45,
|
2020-02-07 23:30:31 +08:00
|
|
|
IIT_VEC_OF_BITCASTS_TO_INT = 46,
|
|
|
|
IIT_V128 = 47
|
2012-05-28 02:28:35 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
static void DecodeIITType(unsigned &NextElt, ArrayRef<unsigned char> Infos,
|
|
|
|
SmallVectorImpl<Intrinsic::IITDescriptor> &OutputTable) {
|
2017-05-11 07:41:30 +08:00
|
|
|
using namespace Intrinsic;
|
|
|
|
|
2012-05-17 13:13:57 +08:00
|
|
|
IIT_Info Info = IIT_Info(Infos[NextElt++]);
|
2012-05-17 13:03:24 +08:00
|
|
|
unsigned StructElts = 2;
|
2012-12-18 04:37:55 +08:00
|
|
|
|
2012-05-17 13:13:57 +08:00
|
|
|
switch (Info) {
|
2012-05-28 02:28:35 +08:00
|
|
|
case IIT_Done:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Void, 0));
|
|
|
|
return;
|
2013-11-01 01:18:11 +08:00
|
|
|
case IIT_VARARG:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::VarArg, 0));
|
|
|
|
return;
|
2012-05-28 02:28:35 +08:00
|
|
|
case IIT_MMX:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::MMX, 0));
|
|
|
|
return;
|
2015-09-02 21:36:25 +08:00
|
|
|
case IIT_TOKEN:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Token, 0));
|
|
|
|
return;
|
2012-05-28 02:28:35 +08:00
|
|
|
case IIT_METADATA:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Metadata, 0));
|
|
|
|
return;
|
2013-01-11 09:45:05 +08:00
|
|
|
case IIT_F16:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Half, 0));
|
|
|
|
return;
|
2012-05-28 02:28:35 +08:00
|
|
|
case IIT_F32:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Float, 0));
|
|
|
|
return;
|
|
|
|
case IIT_F64:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Double, 0));
|
|
|
|
return;
|
2018-07-10 02:50:06 +08:00
|
|
|
case IIT_F128:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Quad, 0));
|
|
|
|
return;
|
2012-05-28 02:28:35 +08:00
|
|
|
case IIT_I1:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Integer, 1));
|
|
|
|
return;
|
|
|
|
case IIT_I8:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Integer, 8));
|
|
|
|
return;
|
|
|
|
case IIT_I16:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Integer,16));
|
|
|
|
return;
|
|
|
|
case IIT_I32:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Integer, 32));
|
|
|
|
return;
|
|
|
|
case IIT_I64:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Integer, 64));
|
|
|
|
return;
|
2015-05-25 23:49:26 +08:00
|
|
|
case IIT_I128:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Integer, 128));
|
|
|
|
return;
|
2013-09-24 10:47:27 +08:00
|
|
|
case IIT_V1:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Vector, 1));
|
|
|
|
DecodeIITType(NextElt, Infos, OutputTable);
|
|
|
|
return;
|
2012-05-17 12:30:58 +08:00
|
|
|
case IIT_V2:
|
2012-05-28 02:28:35 +08:00
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Vector, 2));
|
|
|
|
DecodeIITType(NextElt, Infos, OutputTable);
|
|
|
|
return;
|
2012-05-17 12:30:58 +08:00
|
|
|
case IIT_V4:
|
2012-05-28 02:28:35 +08:00
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Vector, 4));
|
|
|
|
DecodeIITType(NextElt, Infos, OutputTable);
|
|
|
|
return;
|
2012-05-17 12:30:58 +08:00
|
|
|
case IIT_V8:
|
2012-05-28 02:28:35 +08:00
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Vector, 8));
|
|
|
|
DecodeIITType(NextElt, Infos, OutputTable);
|
|
|
|
return;
|
2012-05-17 12:30:58 +08:00
|
|
|
case IIT_V16:
|
2012-05-28 02:28:35 +08:00
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Vector, 16));
|
|
|
|
DecodeIITType(NextElt, Infos, OutputTable);
|
|
|
|
return;
|
2012-05-17 13:03:24 +08:00
|
|
|
case IIT_V32:
|
2012-05-28 02:28:35 +08:00
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Vector, 32));
|
|
|
|
DecodeIITType(NextElt, Infos, OutputTable);
|
|
|
|
return;
|
2014-09-30 19:32:22 +08:00
|
|
|
case IIT_V64:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Vector, 64));
|
|
|
|
DecodeIITType(NextElt, Infos, OutputTable);
|
|
|
|
return;
|
2020-02-07 23:30:31 +08:00
|
|
|
case IIT_V128:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Vector, 128));
|
|
|
|
DecodeIITType(NextElt, Infos, OutputTable);
|
|
|
|
return;
|
2015-11-25 00:28:14 +08:00
|
|
|
case IIT_V512:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Vector, 512));
|
|
|
|
DecodeIITType(NextElt, Infos, OutputTable);
|
|
|
|
return;
|
|
|
|
case IIT_V1024:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Vector, 1024));
|
|
|
|
DecodeIITType(NextElt, Infos, OutputTable);
|
|
|
|
return;
|
2012-05-23 13:19:18 +08:00
|
|
|
case IIT_PTR:
|
2012-05-28 02:28:35 +08:00
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Pointer, 0));
|
|
|
|
DecodeIITType(NextElt, Infos, OutputTable);
|
|
|
|
return;
|
2012-05-23 13:19:18 +08:00
|
|
|
case IIT_ANYPTR: { // [ANYPTR addrspace, subtype]
|
2012-12-18 04:37:55 +08:00
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Pointer,
|
2012-05-28 02:28:35 +08:00
|
|
|
Infos[NextElt++]));
|
|
|
|
DecodeIITType(NextElt, Infos, OutputTable);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
case IIT_ARG: {
|
|
|
|
unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Argument, ArgInfo));
|
|
|
|
return;
|
|
|
|
}
|
2014-03-28 20:31:39 +08:00
|
|
|
case IIT_EXTEND_ARG: {
|
2012-05-28 02:28:35 +08:00
|
|
|
unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
|
2014-03-28 20:31:39 +08:00
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::ExtendArgument,
|
2012-05-28 02:28:35 +08:00
|
|
|
ArgInfo));
|
|
|
|
return;
|
2012-05-22 07:21:28 +08:00
|
|
|
}
|
2014-03-28 20:31:39 +08:00
|
|
|
case IIT_TRUNC_ARG: {
|
2012-05-28 02:28:35 +08:00
|
|
|
unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
|
2014-03-28 20:31:39 +08:00
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::TruncArgument,
|
2012-05-28 02:28:35 +08:00
|
|
|
ArgInfo));
|
|
|
|
return;
|
2012-05-17 13:03:24 +08:00
|
|
|
}
|
2014-03-29 15:04:54 +08:00
|
|
|
case IIT_HALF_VEC_ARG: {
|
|
|
|
unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::HalfVecArgument,
|
|
|
|
ArgInfo));
|
|
|
|
return;
|
|
|
|
}
|
2014-12-04 17:40:44 +08:00
|
|
|
case IIT_SAME_VEC_WIDTH_ARG: {
|
|
|
|
unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::SameVecWidthArgument,
|
|
|
|
ArgInfo));
|
|
|
|
return;
|
|
|
|
}
|
2014-12-25 15:49:20 +08:00
|
|
|
case IIT_PTR_TO_ARG: {
|
|
|
|
unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::PtrToArgument,
|
|
|
|
ArgInfo));
|
|
|
|
return;
|
|
|
|
}
|
2016-11-03 11:23:55 +08:00
|
|
|
case IIT_PTR_TO_ELT: {
|
|
|
|
unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::PtrToElt, ArgInfo));
|
|
|
|
return;
|
|
|
|
}
|
2017-05-03 20:28:54 +08:00
|
|
|
case IIT_VEC_OF_ANYPTRS_TO_ELT: {
|
|
|
|
unsigned short ArgNo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
|
|
|
|
unsigned short RefNo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
|
|
|
|
OutputTable.push_back(
|
|
|
|
IITDescriptor::get(IITDescriptor::VecOfAnyPtrsToElt, ArgNo, RefNo));
|
Masked Gather and Scatter Intrinsics.
Gather and Scatter are new introduced intrinsics, comming after recently implemented masked load and store.
This is the first patch for Gather and Scatter intrinsics. It includes only the syntax, parsing and verification.
Gather and Scatter intrinsics allow to perform multiple memory accesses (read/write) in one vector instruction.
The intrinsics are not target specific and will have the following syntax:
Gather:
declare <16 x i32> @llvm.masked.gather.v16i32(<16 x i32*> <vector of ptrs>, i32 <alignment>, <16 x i1> <mask>, <16 x i32> <passthru>)
declare <8 x float> @llvm.masked.gather.v8f32(<8 x float*><vector of ptrs>, i32 <alignment>, <8 x i1> <mask>, <8 x float><passthru>)
Scatter:
declare void @llvm.masked.scatter.v8i32(<8 x i32><vector value to be stored> , <8 x i32*><vector of ptrs> , i32 <alignment>, <8 x i1> <mask>)
declare void @llvm.masked.scatter.v16i32(<16 x i32> <vector value to be stored> , <16 x i32*> <vector of ptrs>, i32 <alignment>, <16 x i1><mask> )
Vector of ptrs - a set of source/destination addresses, to load/store the value.
Mask - switches on/off vector lanes to prevent memory access for switched-off lanes
vector of ptrs, value and mask should have the same vector width.
These are code examples where gather / scatter should be used and will allow function vectorization
;void foo1(int * restrict A, int * restrict B, int * restrict C) {
; for (int i=0; i<SIZE; i++) {
; A[i] = B[C[i]];
; }
;}
;void foo3(int * restrict A, int * restrict B) {
; for (int i=0; i<SIZE; i++) {
; A[B[i]] = i+5;
; }
;}
Tests will come in the following patches, with CodeGen and Vectorizer.
http://reviews.llvm.org/D7433
llvm-svn: 228521
2015-02-08 16:27:19 +08:00
|
|
|
return;
|
|
|
|
}
|
2012-05-28 02:28:35 +08:00
|
|
|
case IIT_EMPTYSTRUCT:
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Struct, 0));
|
|
|
|
return;
|
2017-10-13 01:40:00 +08:00
|
|
|
case IIT_STRUCT8: ++StructElts; LLVM_FALLTHROUGH;
|
|
|
|
case IIT_STRUCT7: ++StructElts; LLVM_FALLTHROUGH;
|
|
|
|
case IIT_STRUCT6: ++StructElts; LLVM_FALLTHROUGH;
|
2016-08-18 04:30:52 +08:00
|
|
|
case IIT_STRUCT5: ++StructElts; LLVM_FALLTHROUGH;
|
|
|
|
case IIT_STRUCT4: ++StructElts; LLVM_FALLTHROUGH;
|
|
|
|
case IIT_STRUCT3: ++StructElts; LLVM_FALLTHROUGH;
|
2012-05-17 13:03:24 +08:00
|
|
|
case IIT_STRUCT2: {
|
2012-05-28 02:28:35 +08:00
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Struct,StructElts));
|
|
|
|
|
2012-05-17 13:03:24 +08:00
|
|
|
for (unsigned i = 0; i != StructElts; ++i)
|
2012-05-28 02:28:35 +08:00
|
|
|
DecodeIITType(NextElt, Infos, OutputTable);
|
|
|
|
return;
|
2012-05-17 12:30:58 +08:00
|
|
|
}
|
2019-09-20 17:48:21 +08:00
|
|
|
case IIT_SUBDIVIDE2_ARG: {
|
|
|
|
unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Subdivide2Argument,
|
|
|
|
ArgInfo));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
case IIT_SUBDIVIDE4_ARG: {
|
|
|
|
unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::Subdivide4Argument,
|
|
|
|
ArgInfo));
|
|
|
|
return;
|
|
|
|
}
|
2019-06-13 17:37:38 +08:00
|
|
|
case IIT_VEC_ELEMENT: {
|
|
|
|
unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::VecElementArgument,
|
|
|
|
ArgInfo));
|
|
|
|
return;
|
|
|
|
}
|
2019-08-27 20:57:09 +08:00
|
|
|
case IIT_SCALABLE_VEC: {
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::ScalableVecArgument,
|
|
|
|
0));
|
|
|
|
DecodeIITType(NextElt, Infos, OutputTable);
|
|
|
|
return;
|
|
|
|
}
|
2019-10-02 17:25:02 +08:00
|
|
|
case IIT_VEC_OF_BITCASTS_TO_INT: {
|
|
|
|
unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
|
|
|
|
OutputTable.push_back(IITDescriptor::get(IITDescriptor::VecOfBitcastsToInt,
|
|
|
|
ArgInfo));
|
|
|
|
return;
|
|
|
|
}
|
2012-05-16 14:34:44 +08:00
|
|
|
}
|
|
|
|
llvm_unreachable("unhandled");
|
|
|
|
}
|
|
|
|
|
2012-05-28 02:28:35 +08:00
|
|
|
#define GET_INTRINSIC_GENERATOR_GLOBAL
|
2018-06-23 10:02:38 +08:00
|
|
|
#include "llvm/IR/IntrinsicImpl.inc"
|
2012-05-28 02:28:35 +08:00
|
|
|
#undef GET_INTRINSIC_GENERATOR_GLOBAL
|
|
|
|
|
2012-12-18 04:37:55 +08:00
|
|
|
void Intrinsic::getIntrinsicInfoTableEntries(ID id,
|
2012-05-28 02:28:35 +08:00
|
|
|
SmallVectorImpl<IITDescriptor> &T){
|
2012-05-16 14:34:44 +08:00
|
|
|
// Check to see if the intrinsic's type was expressible by the table.
|
|
|
|
unsigned TableVal = IIT_Table[id-1];
|
2012-12-18 04:37:55 +08:00
|
|
|
|
2012-05-17 23:55:41 +08:00
|
|
|
// Decode the TableVal into an array of IITValues.
|
|
|
|
SmallVector<unsigned char, 8> IITValues;
|
|
|
|
ArrayRef<unsigned char> IITEntries;
|
|
|
|
unsigned NextElt = 0;
|
|
|
|
if ((TableVal >> 31) != 0) {
|
|
|
|
// This is an offset into the IIT_LongEncodingTable.
|
|
|
|
IITEntries = IIT_LongEncodingTable;
|
2012-12-18 04:37:55 +08:00
|
|
|
|
2012-05-17 23:55:41 +08:00
|
|
|
// Strip sentinel bit.
|
|
|
|
NextElt = (TableVal << 1) >> 1;
|
|
|
|
} else {
|
2012-05-28 02:28:35 +08:00
|
|
|
// Decode the TableVal into an array of IITValues. If the entry was encoded
|
|
|
|
// into a single word in the table itself, decode it now.
|
2012-05-17 13:13:57 +08:00
|
|
|
do {
|
|
|
|
IITValues.push_back(TableVal & 0xF);
|
|
|
|
TableVal >>= 4;
|
|
|
|
} while (TableVal);
|
2012-12-18 04:37:55 +08:00
|
|
|
|
2012-05-17 23:55:41 +08:00
|
|
|
IITEntries = IITValues;
|
|
|
|
NextElt = 0;
|
2012-05-16 14:34:44 +08:00
|
|
|
}
|
2012-05-28 02:28:35 +08:00
|
|
|
|
|
|
|
// Okay, decode the table into the output vector of IITDescriptors.
|
|
|
|
DecodeIITType(NextElt, IITEntries, T);
|
|
|
|
while (NextElt != IITEntries.size() && IITEntries[NextElt] != 0)
|
|
|
|
DecodeIITType(NextElt, IITEntries, T);
|
|
|
|
}
|
|
|
|
|
|
|
|
static Type *DecodeFixedType(ArrayRef<Intrinsic::IITDescriptor> &Infos,
|
|
|
|
ArrayRef<Type*> Tys, LLVMContext &Context) {
|
|
|
|
using namespace Intrinsic;
|
2017-05-11 07:41:30 +08:00
|
|
|
|
2012-05-28 02:28:35 +08:00
|
|
|
IITDescriptor D = Infos.front();
|
|
|
|
Infos = Infos.slice(1);
|
2012-12-18 04:37:55 +08:00
|
|
|
|
2012-05-28 02:28:35 +08:00
|
|
|
switch (D.Kind) {
|
|
|
|
case IITDescriptor::Void: return Type::getVoidTy(Context);
|
2013-11-01 01:18:11 +08:00
|
|
|
case IITDescriptor::VarArg: return Type::getVoidTy(Context);
|
2012-05-28 02:28:35 +08:00
|
|
|
case IITDescriptor::MMX: return Type::getX86_MMXTy(Context);
|
2015-09-02 21:36:25 +08:00
|
|
|
case IITDescriptor::Token: return Type::getTokenTy(Context);
|
2012-05-28 02:28:35 +08:00
|
|
|
case IITDescriptor::Metadata: return Type::getMetadataTy(Context);
|
2013-01-11 09:45:05 +08:00
|
|
|
case IITDescriptor::Half: return Type::getHalfTy(Context);
|
2012-05-28 02:28:35 +08:00
|
|
|
case IITDescriptor::Float: return Type::getFloatTy(Context);
|
|
|
|
case IITDescriptor::Double: return Type::getDoubleTy(Context);
|
2018-07-10 02:50:06 +08:00
|
|
|
case IITDescriptor::Quad: return Type::getFP128Ty(Context);
|
2012-12-18 04:37:55 +08:00
|
|
|
|
2012-05-28 02:28:35 +08:00
|
|
|
case IITDescriptor::Integer:
|
|
|
|
return IntegerType::get(Context, D.Integer_Width);
|
|
|
|
case IITDescriptor::Vector:
|
|
|
|
return VectorType::get(DecodeFixedType(Infos, Tys, Context),D.Vector_Width);
|
|
|
|
case IITDescriptor::Pointer:
|
|
|
|
return PointerType::get(DecodeFixedType(Infos, Tys, Context),
|
|
|
|
D.Pointer_AddressSpace);
|
|
|
|
case IITDescriptor::Struct: {
|
2017-10-13 01:40:00 +08:00
|
|
|
SmallVector<Type *, 8> Elts;
|
2012-05-28 02:28:35 +08:00
|
|
|
for (unsigned i = 0, e = D.Struct_NumElements; i != e; ++i)
|
2017-10-13 01:40:00 +08:00
|
|
|
Elts.push_back(DecodeFixedType(Infos, Tys, Context));
|
|
|
|
return StructType::get(Context, Elts);
|
2012-05-28 02:28:35 +08:00
|
|
|
}
|
|
|
|
case IITDescriptor::Argument:
|
|
|
|
return Tys[D.getArgumentNumber()];
|
2014-03-28 20:31:39 +08:00
|
|
|
case IITDescriptor::ExtendArgument: {
|
|
|
|
Type *Ty = Tys[D.getArgumentNumber()];
|
|
|
|
if (VectorType *VTy = dyn_cast<VectorType>(Ty))
|
|
|
|
return VectorType::getExtendedElementVectorType(VTy);
|
2012-12-18 04:37:55 +08:00
|
|
|
|
2014-03-28 20:31:39 +08:00
|
|
|
return IntegerType::get(Context, 2 * cast<IntegerType>(Ty)->getBitWidth());
|
|
|
|
}
|
|
|
|
case IITDescriptor::TruncArgument: {
|
|
|
|
Type *Ty = Tys[D.getArgumentNumber()];
|
|
|
|
if (VectorType *VTy = dyn_cast<VectorType>(Ty))
|
|
|
|
return VectorType::getTruncatedElementVectorType(VTy);
|
|
|
|
|
|
|
|
IntegerType *ITy = cast<IntegerType>(Ty);
|
|
|
|
assert(ITy->getBitWidth() % 2 == 0);
|
|
|
|
return IntegerType::get(Context, ITy->getBitWidth() / 2);
|
|
|
|
}
|
2019-09-20 17:48:21 +08:00
|
|
|
case IITDescriptor::Subdivide2Argument:
|
|
|
|
case IITDescriptor::Subdivide4Argument: {
|
|
|
|
Type *Ty = Tys[D.getArgumentNumber()];
|
|
|
|
VectorType *VTy = dyn_cast<VectorType>(Ty);
|
|
|
|
assert(VTy && "Expected an argument of Vector Type");
|
|
|
|
int SubDivs = D.Kind == IITDescriptor::Subdivide2Argument ? 1 : 2;
|
|
|
|
return VectorType::getSubdividedVectorType(VTy, SubDivs);
|
|
|
|
}
|
2014-03-29 15:04:54 +08:00
|
|
|
case IITDescriptor::HalfVecArgument:
|
|
|
|
return VectorType::getHalfElementsVectorType(cast<VectorType>(
|
|
|
|
Tys[D.getArgumentNumber()]));
|
2014-12-25 15:49:20 +08:00
|
|
|
case IITDescriptor::SameVecWidthArgument: {
|
2014-12-04 17:40:44 +08:00
|
|
|
Type *EltTy = DecodeFixedType(Infos, Tys, Context);
|
|
|
|
Type *Ty = Tys[D.getArgumentNumber()];
|
2019-01-24 00:00:22 +08:00
|
|
|
if (auto *VTy = dyn_cast<VectorType>(Ty))
|
2019-08-27 20:57:09 +08:00
|
|
|
return VectorType::get(EltTy, VTy->getElementCount());
|
2019-01-24 00:00:22 +08:00
|
|
|
return EltTy;
|
2014-12-25 15:49:20 +08:00
|
|
|
}
|
|
|
|
case IITDescriptor::PtrToArgument: {
|
|
|
|
Type *Ty = Tys[D.getArgumentNumber()];
|
|
|
|
return PointerType::getUnqual(Ty);
|
|
|
|
}
|
2016-11-03 11:23:55 +08:00
|
|
|
case IITDescriptor::PtrToElt: {
|
|
|
|
Type *Ty = Tys[D.getArgumentNumber()];
|
|
|
|
VectorType *VTy = dyn_cast<VectorType>(Ty);
|
|
|
|
if (!VTy)
|
|
|
|
llvm_unreachable("Expected an argument of Vector Type");
|
2020-04-11 04:59:26 +08:00
|
|
|
Type *EltTy = VTy->getElementType();
|
2016-11-03 11:23:55 +08:00
|
|
|
return PointerType::getUnqual(EltTy);
|
|
|
|
}
|
2019-06-13 17:37:38 +08:00
|
|
|
case IITDescriptor::VecElementArgument: {
|
|
|
|
Type *Ty = Tys[D.getArgumentNumber()];
|
|
|
|
if (VectorType *VTy = dyn_cast<VectorType>(Ty))
|
|
|
|
return VTy->getElementType();
|
|
|
|
llvm_unreachable("Expected an argument of Vector Type");
|
|
|
|
}
|
2019-10-02 17:25:02 +08:00
|
|
|
case IITDescriptor::VecOfBitcastsToInt: {
|
|
|
|
Type *Ty = Tys[D.getArgumentNumber()];
|
|
|
|
VectorType *VTy = dyn_cast<VectorType>(Ty);
|
|
|
|
assert(VTy && "Expected an argument of Vector Type");
|
|
|
|
return VectorType::getInteger(VTy);
|
|
|
|
}
|
2017-05-03 20:28:54 +08:00
|
|
|
case IITDescriptor::VecOfAnyPtrsToElt:
|
|
|
|
// Return the overloaded type (which determines the pointers address space)
|
|
|
|
return Tys[D.getOverloadArgNumber()];
|
2019-08-27 20:57:09 +08:00
|
|
|
case IITDescriptor::ScalableVecArgument: {
|
2020-04-11 04:59:26 +08:00
|
|
|
auto *Ty = cast<VectorType>(DecodeFixedType(Infos, Tys, Context));
|
[SVE] Change return type of getNumElements to unsigned
Reviewers: efriedma, sdesmalen, craig.topper, dexonsmith
Reviewed By: efriedma, sdesmalen
Subscribers: tschuett, hiraditya, rkruppe, psnobl, mehdi_amini, rriddle, jpienaar, burmako, shauheen, antiagainst, nicolasvasilache, arpith-jacob, mgester, lucyrfox, aartbik, liufengdb, Joonsoo, grosul1, frgossen, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D77763
2020-04-14 07:00:10 +08:00
|
|
|
return VectorType::get(Ty->getElementType(), {Ty->getNumElements(), true});
|
2019-08-27 20:57:09 +08:00
|
|
|
}
|
2017-05-11 07:41:30 +08:00
|
|
|
}
|
2012-05-28 02:28:35 +08:00
|
|
|
llvm_unreachable("unhandled");
|
|
|
|
}
|
|
|
|
|
|
|
|
FunctionType *Intrinsic::getType(LLVMContext &Context,
|
|
|
|
ID id, ArrayRef<Type*> Tys) {
|
|
|
|
SmallVector<IITDescriptor, 8> Table;
|
|
|
|
getIntrinsicInfoTableEntries(id, Table);
|
2012-12-18 04:37:55 +08:00
|
|
|
|
2012-05-28 02:28:35 +08:00
|
|
|
ArrayRef<IITDescriptor> TableRef = Table;
|
|
|
|
Type *ResultTy = DecodeFixedType(TableRef, Tys, Context);
|
2012-12-18 04:37:55 +08:00
|
|
|
|
2012-05-17 23:55:41 +08:00
|
|
|
SmallVector<Type*, 8> ArgTys;
|
2012-05-28 02:28:35 +08:00
|
|
|
while (!TableRef.empty())
|
|
|
|
ArgTys.push_back(DecodeFixedType(TableRef, Tys, Context));
|
2007-02-08 04:38:26 +08:00
|
|
|
|
2014-10-20 23:47:24 +08:00
|
|
|
// DecodeFixedType returns Void for IITDescriptor::Void and IITDescriptor::VarArg
|
|
|
|
// If we see void type as the type of the last argument, it is vararg intrinsic
|
|
|
|
if (!ArgTys.empty() && ArgTys.back()->isVoidTy()) {
|
|
|
|
ArgTys.pop_back();
|
|
|
|
return FunctionType::get(ResultTy, ArgTys, true);
|
|
|
|
}
|
2012-12-18 04:37:55 +08:00
|
|
|
return FunctionType::get(ResultTy, ArgTys, false);
|
2007-02-08 04:38:26 +08:00
|
|
|
}
|
|
|
|
|
2009-02-25 07:17:49 +08:00
|
|
|
bool Intrinsic::isOverloaded(ID id) {
|
|
|
|
#define GET_INTRINSIC_OVERLOAD_TABLE
|
2018-06-23 10:02:38 +08:00
|
|
|
#include "llvm/IR/IntrinsicImpl.inc"
|
2009-02-25 07:17:49 +08:00
|
|
|
#undef GET_INTRINSIC_OVERLOAD_TABLE
|
|
|
|
}
|
|
|
|
|
2015-06-19 03:28:26 +08:00
|
|
|
bool Intrinsic::isLeaf(ID id) {
|
|
|
|
switch (id) {
|
|
|
|
default:
|
|
|
|
return true;
|
|
|
|
|
|
|
|
case Intrinsic::experimental_gc_statepoint:
|
|
|
|
case Intrinsic::experimental_patchpoint_void:
|
|
|
|
case Intrinsic::experimental_patchpoint_i64:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-01-12 09:18:58 +08:00
|
|
|
/// This defines the "Intrinsic::getAttributes(ID id)" method.
|
2007-12-04 04:06:50 +08:00
|
|
|
#define GET_INTRINSIC_ATTRIBUTES
|
2018-06-23 10:02:38 +08:00
|
|
|
#include "llvm/IR/IntrinsicImpl.inc"
|
2007-12-04 04:06:50 +08:00
|
|
|
#undef GET_INTRINSIC_ATTRIBUTES
|
|
|
|
|
2011-07-15 01:45:39 +08:00
|
|
|
Function *Intrinsic::getDeclaration(Module *M, ID id, ArrayRef<Type*> Tys) {
|
2007-12-04 04:06:50 +08:00
|
|
|
// There can never be multiple globals with the same name of different types,
|
|
|
|
// because intrinsics must be a specific type.
|
[opaque pointer types] Add a FunctionCallee wrapper type, and use it.
Recommit r352791 after tweaking DerivedTypes.h slightly, so that gcc
doesn't choke on it, hopefully.
Original Message:
The FunctionCallee type is effectively a {FunctionType*,Value*} pair,
and is a useful convenience to enable code to continue passing the
result of getOrInsertFunction() through to EmitCall, even once pointer
types lose their pointee-type.
Then:
- update the CallInst/InvokeInst instruction creation functions to
take a Callee,
- modify getOrInsertFunction to return FunctionCallee, and
- update all callers appropriately.
One area of particular note is the change to the sanitizer
code. Previously, they had been casting the result of
`getOrInsertFunction` to a `Function*` via
`checkSanitizerInterfaceFunction`, and storing that. That would report
an error if someone had already inserted a function declaraction with
a mismatching signature.
However, in general, LLVM allows for such mismatches, as
`getOrInsertFunction` will automatically insert a bitcast if
needed. As part of this cleanup, cause the sanitizer code to do the
same. (It will call its functions using the expected signature,
however they may have been declared.)
Finally, in a small number of locations, callers of
`getOrInsertFunction` actually were expecting/requiring that a brand
new function was being created. In such cases, I've switched them to
Function::Create instead.
Differential Revision: https://reviews.llvm.org/D57315
llvm-svn: 352827
2019-02-01 10:28:03 +08:00
|
|
|
return cast<Function>(
|
|
|
|
M->getOrInsertFunction(getName(id, Tys),
|
|
|
|
getType(M->getContext(), id, Tys))
|
|
|
|
.getCallee());
|
2007-02-08 04:38:26 +08:00
|
|
|
}
|
|
|
|
|
2009-02-05 09:49:45 +08:00
|
|
|
// This defines the "Intrinsic::getIntrinsicForGCCBuiltin()" method.
|
|
|
|
#define GET_LLVM_INTRINSIC_FOR_GCC_BUILTIN
|
2018-06-23 10:02:38 +08:00
|
|
|
#include "llvm/IR/IntrinsicImpl.inc"
|
2009-02-05 09:49:45 +08:00
|
|
|
#undef GET_LLVM_INTRINSIC_FOR_GCC_BUILTIN
|
|
|
|
|
2014-07-05 02:42:25 +08:00
|
|
|
// This defines the "Intrinsic::getIntrinsicForMSBuiltin()" method.
|
|
|
|
#define GET_LLVM_INTRINSIC_FOR_MS_BUILTIN
|
2018-06-23 10:02:38 +08:00
|
|
|
#include "llvm/IR/IntrinsicImpl.inc"
|
2014-07-05 02:42:25 +08:00
|
|
|
#undef GET_LLVM_INTRINSIC_FOR_MS_BUILTIN
|
|
|
|
|
2019-06-13 16:19:33 +08:00
|
|
|
using DeferredIntrinsicMatchPair =
|
|
|
|
std::pair<Type *, ArrayRef<Intrinsic::IITDescriptor>>;
|
|
|
|
|
|
|
|
static bool matchIntrinsicType(
|
|
|
|
Type *Ty, ArrayRef<Intrinsic::IITDescriptor> &Infos,
|
|
|
|
SmallVectorImpl<Type *> &ArgTys,
|
|
|
|
SmallVectorImpl<DeferredIntrinsicMatchPair> &DeferredChecks,
|
|
|
|
bool IsDeferredCheck) {
|
2016-06-22 22:56:33 +08:00
|
|
|
using namespace Intrinsic;
|
|
|
|
|
|
|
|
// If we ran out of descriptors, there are too many arguments.
|
|
|
|
if (Infos.empty()) return true;
|
2019-06-13 16:19:33 +08:00
|
|
|
|
|
|
|
// Do this before slicing off the 'front' part
|
|
|
|
auto InfosRef = Infos;
|
|
|
|
auto DeferCheck = [&DeferredChecks, &InfosRef](Type *T) {
|
|
|
|
DeferredChecks.emplace_back(T, InfosRef);
|
|
|
|
return false;
|
|
|
|
};
|
|
|
|
|
2016-06-22 22:56:33 +08:00
|
|
|
IITDescriptor D = Infos.front();
|
|
|
|
Infos = Infos.slice(1);
|
|
|
|
|
|
|
|
switch (D.Kind) {
|
|
|
|
case IITDescriptor::Void: return !Ty->isVoidTy();
|
|
|
|
case IITDescriptor::VarArg: return true;
|
|
|
|
case IITDescriptor::MMX: return !Ty->isX86_MMXTy();
|
|
|
|
case IITDescriptor::Token: return !Ty->isTokenTy();
|
|
|
|
case IITDescriptor::Metadata: return !Ty->isMetadataTy();
|
|
|
|
case IITDescriptor::Half: return !Ty->isHalfTy();
|
|
|
|
case IITDescriptor::Float: return !Ty->isFloatTy();
|
|
|
|
case IITDescriptor::Double: return !Ty->isDoubleTy();
|
2018-07-10 02:50:06 +08:00
|
|
|
case IITDescriptor::Quad: return !Ty->isFP128Ty();
|
2016-06-22 22:56:33 +08:00
|
|
|
case IITDescriptor::Integer: return !Ty->isIntegerTy(D.Integer_Width);
|
|
|
|
case IITDescriptor::Vector: {
|
|
|
|
VectorType *VT = dyn_cast<VectorType>(Ty);
|
|
|
|
return !VT || VT->getNumElements() != D.Vector_Width ||
|
2019-06-13 16:19:33 +08:00
|
|
|
matchIntrinsicType(VT->getElementType(), Infos, ArgTys,
|
|
|
|
DeferredChecks, IsDeferredCheck);
|
2016-06-22 22:56:33 +08:00
|
|
|
}
|
|
|
|
case IITDescriptor::Pointer: {
|
|
|
|
PointerType *PT = dyn_cast<PointerType>(Ty);
|
|
|
|
return !PT || PT->getAddressSpace() != D.Pointer_AddressSpace ||
|
2019-06-13 16:19:33 +08:00
|
|
|
matchIntrinsicType(PT->getElementType(), Infos, ArgTys,
|
|
|
|
DeferredChecks, IsDeferredCheck);
|
2016-06-22 22:56:33 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
case IITDescriptor::Struct: {
|
|
|
|
StructType *ST = dyn_cast<StructType>(Ty);
|
|
|
|
if (!ST || ST->getNumElements() != D.Struct_NumElements)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
for (unsigned i = 0, e = D.Struct_NumElements; i != e; ++i)
|
2019-06-13 16:19:33 +08:00
|
|
|
if (matchIntrinsicType(ST->getElementType(i), Infos, ArgTys,
|
|
|
|
DeferredChecks, IsDeferredCheck))
|
2016-06-22 22:56:33 +08:00
|
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
case IITDescriptor::Argument:
|
2019-06-13 16:19:33 +08:00
|
|
|
// If this is the second occurrence of an argument,
|
|
|
|
// verify that the later instance matches the previous instance.
|
2016-06-22 22:56:33 +08:00
|
|
|
if (D.getArgumentNumber() < ArgTys.size())
|
|
|
|
return Ty != ArgTys[D.getArgumentNumber()];
|
|
|
|
|
2019-06-13 16:19:33 +08:00
|
|
|
if (D.getArgumentNumber() > ArgTys.size() ||
|
|
|
|
D.getArgumentKind() == IITDescriptor::AK_MatchType)
|
|
|
|
return IsDeferredCheck || DeferCheck(Ty);
|
|
|
|
|
|
|
|
assert(D.getArgumentNumber() == ArgTys.size() && !IsDeferredCheck &&
|
|
|
|
"Table consistency error");
|
2019-01-24 00:01:19 +08:00
|
|
|
ArgTys.push_back(Ty);
|
|
|
|
|
|
|
|
switch (D.getArgumentKind()) {
|
|
|
|
case IITDescriptor::AK_Any: return false; // Success
|
|
|
|
case IITDescriptor::AK_AnyInteger: return !Ty->isIntOrIntVectorTy();
|
|
|
|
case IITDescriptor::AK_AnyFloat: return !Ty->isFPOrFPVectorTy();
|
|
|
|
case IITDescriptor::AK_AnyVector: return !isa<VectorType>(Ty);
|
|
|
|
case IITDescriptor::AK_AnyPointer: return !isa<PointerType>(Ty);
|
2019-06-13 16:19:33 +08:00
|
|
|
default: break;
|
2019-01-24 00:01:19 +08:00
|
|
|
}
|
|
|
|
llvm_unreachable("all argument kinds not covered");
|
2016-06-22 22:56:33 +08:00
|
|
|
|
|
|
|
case IITDescriptor::ExtendArgument: {
|
2019-06-13 16:19:33 +08:00
|
|
|
// If this is a forward reference, defer the check for later.
|
2016-06-22 22:56:33 +08:00
|
|
|
if (D.getArgumentNumber() >= ArgTys.size())
|
2019-06-13 16:19:33 +08:00
|
|
|
return IsDeferredCheck || DeferCheck(Ty);
|
2016-06-22 22:56:33 +08:00
|
|
|
|
|
|
|
Type *NewTy = ArgTys[D.getArgumentNumber()];
|
|
|
|
if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
|
|
|
|
NewTy = VectorType::getExtendedElementVectorType(VTy);
|
|
|
|
else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
|
|
|
|
NewTy = IntegerType::get(ITy->getContext(), 2 * ITy->getBitWidth());
|
|
|
|
else
|
|
|
|
return true;
|
|
|
|
|
|
|
|
return Ty != NewTy;
|
|
|
|
}
|
|
|
|
case IITDescriptor::TruncArgument: {
|
2019-06-13 16:19:33 +08:00
|
|
|
// If this is a forward reference, defer the check for later.
|
2016-06-22 22:56:33 +08:00
|
|
|
if (D.getArgumentNumber() >= ArgTys.size())
|
2019-06-13 16:19:33 +08:00
|
|
|
return IsDeferredCheck || DeferCheck(Ty);
|
2016-06-22 22:56:33 +08:00
|
|
|
|
|
|
|
Type *NewTy = ArgTys[D.getArgumentNumber()];
|
|
|
|
if (VectorType *VTy = dyn_cast<VectorType>(NewTy))
|
|
|
|
NewTy = VectorType::getTruncatedElementVectorType(VTy);
|
|
|
|
else if (IntegerType *ITy = dyn_cast<IntegerType>(NewTy))
|
|
|
|
NewTy = IntegerType::get(ITy->getContext(), ITy->getBitWidth() / 2);
|
|
|
|
else
|
|
|
|
return true;
|
|
|
|
|
|
|
|
return Ty != NewTy;
|
|
|
|
}
|
|
|
|
case IITDescriptor::HalfVecArgument:
|
2019-06-13 16:19:33 +08:00
|
|
|
// If this is a forward reference, defer the check for later.
|
2019-10-01 01:10:21 +08:00
|
|
|
if (D.getArgumentNumber() >= ArgTys.size())
|
|
|
|
return IsDeferredCheck || DeferCheck(Ty);
|
|
|
|
return !isa<VectorType>(ArgTys[D.getArgumentNumber()]) ||
|
2016-06-22 22:56:33 +08:00
|
|
|
VectorType::getHalfElementsVectorType(
|
|
|
|
cast<VectorType>(ArgTys[D.getArgumentNumber()])) != Ty;
|
|
|
|
case IITDescriptor::SameVecWidthArgument: {
|
2019-06-13 16:19:33 +08:00
|
|
|
if (D.getArgumentNumber() >= ArgTys.size()) {
|
|
|
|
// Defer check and subsequent check for the vector element type.
|
|
|
|
Infos = Infos.slice(1);
|
|
|
|
return IsDeferredCheck || DeferCheck(Ty);
|
|
|
|
}
|
2019-01-24 00:00:22 +08:00
|
|
|
auto *ReferenceType = dyn_cast<VectorType>(ArgTys[D.getArgumentNumber()]);
|
|
|
|
auto *ThisArgType = dyn_cast<VectorType>(Ty);
|
|
|
|
// Both must be vectors of the same number of elements or neither.
|
|
|
|
if ((ReferenceType != nullptr) != (ThisArgType != nullptr))
|
2016-06-22 22:56:33 +08:00
|
|
|
return true;
|
2019-01-24 00:00:22 +08:00
|
|
|
Type *EltTy = Ty;
|
|
|
|
if (ThisArgType) {
|
2019-08-27 20:57:09 +08:00
|
|
|
if (ReferenceType->getElementCount() !=
|
|
|
|
ThisArgType->getElementCount())
|
2019-01-24 00:00:22 +08:00
|
|
|
return true;
|
2020-04-11 04:59:26 +08:00
|
|
|
EltTy = ThisArgType->getElementType();
|
2019-01-24 00:00:22 +08:00
|
|
|
}
|
2019-06-13 16:19:33 +08:00
|
|
|
return matchIntrinsicType(EltTy, Infos, ArgTys, DeferredChecks,
|
|
|
|
IsDeferredCheck);
|
2016-06-22 22:56:33 +08:00
|
|
|
}
|
|
|
|
case IITDescriptor::PtrToArgument: {
|
|
|
|
if (D.getArgumentNumber() >= ArgTys.size())
|
2019-06-13 16:19:33 +08:00
|
|
|
return IsDeferredCheck || DeferCheck(Ty);
|
2016-06-22 22:56:33 +08:00
|
|
|
Type * ReferenceType = ArgTys[D.getArgumentNumber()];
|
|
|
|
PointerType *ThisArgType = dyn_cast<PointerType>(Ty);
|
|
|
|
return (!ThisArgType || ThisArgType->getElementType() != ReferenceType);
|
|
|
|
}
|
2016-11-03 11:23:55 +08:00
|
|
|
case IITDescriptor::PtrToElt: {
|
|
|
|
if (D.getArgumentNumber() >= ArgTys.size())
|
2019-06-13 16:19:33 +08:00
|
|
|
return IsDeferredCheck || DeferCheck(Ty);
|
2016-11-03 11:23:55 +08:00
|
|
|
VectorType * ReferenceType =
|
|
|
|
dyn_cast<VectorType> (ArgTys[D.getArgumentNumber()]);
|
|
|
|
PointerType *ThisArgType = dyn_cast<PointerType>(Ty);
|
|
|
|
|
|
|
|
return (!ThisArgType || !ReferenceType ||
|
|
|
|
ThisArgType->getElementType() != ReferenceType->getElementType());
|
|
|
|
}
|
2017-05-03 20:28:54 +08:00
|
|
|
case IITDescriptor::VecOfAnyPtrsToElt: {
|
|
|
|
unsigned RefArgNumber = D.getRefArgNumber();
|
2019-06-13 16:19:33 +08:00
|
|
|
if (RefArgNumber >= ArgTys.size()) {
|
|
|
|
if (IsDeferredCheck)
|
|
|
|
return true;
|
|
|
|
// If forward referencing, already add the pointer-vector type and
|
|
|
|
// defer the checks for later.
|
|
|
|
ArgTys.push_back(Ty);
|
|
|
|
return DeferCheck(Ty);
|
|
|
|
}
|
2017-05-03 20:28:54 +08:00
|
|
|
|
2019-06-13 16:19:33 +08:00
|
|
|
if (!IsDeferredCheck){
|
|
|
|
assert(D.getOverloadArgNumber() == ArgTys.size() &&
|
|
|
|
"Table consistency error");
|
|
|
|
ArgTys.push_back(Ty);
|
|
|
|
}
|
2017-05-03 20:28:54 +08:00
|
|
|
|
|
|
|
// Verify the overloaded type "matches" the Ref type.
|
|
|
|
// i.e. Ty is a vector with the same width as Ref.
|
|
|
|
// Composed of pointers to the same element type as Ref.
|
|
|
|
VectorType *ReferenceType = dyn_cast<VectorType>(ArgTys[RefArgNumber]);
|
2016-06-22 22:56:33 +08:00
|
|
|
VectorType *ThisArgVecTy = dyn_cast<VectorType>(Ty);
|
|
|
|
if (!ThisArgVecTy || !ReferenceType ||
|
2020-04-11 04:59:26 +08:00
|
|
|
(ReferenceType->getNumElements() != ThisArgVecTy->getNumElements()))
|
2016-06-22 22:56:33 +08:00
|
|
|
return true;
|
|
|
|
PointerType *ThisArgEltTy =
|
2020-04-11 04:59:26 +08:00
|
|
|
dyn_cast<PointerType>(ThisArgVecTy->getElementType());
|
2016-06-22 22:56:33 +08:00
|
|
|
if (!ThisArgEltTy)
|
|
|
|
return true;
|
2020-04-11 04:59:26 +08:00
|
|
|
return ThisArgEltTy->getElementType() != ReferenceType->getElementType();
|
2016-06-22 22:56:33 +08:00
|
|
|
}
|
2019-06-13 17:37:38 +08:00
|
|
|
case IITDescriptor::VecElementArgument: {
|
|
|
|
if (D.getArgumentNumber() >= ArgTys.size())
|
|
|
|
return IsDeferredCheck ? true : DeferCheck(Ty);
|
|
|
|
auto *ReferenceType = dyn_cast<VectorType>(ArgTys[D.getArgumentNumber()]);
|
|
|
|
return !ReferenceType || Ty != ReferenceType->getElementType();
|
|
|
|
}
|
2019-09-20 17:48:21 +08:00
|
|
|
case IITDescriptor::Subdivide2Argument:
|
|
|
|
case IITDescriptor::Subdivide4Argument: {
|
|
|
|
// If this is a forward reference, defer the check for later.
|
|
|
|
if (D.getArgumentNumber() >= ArgTys.size())
|
|
|
|
return IsDeferredCheck || DeferCheck(Ty);
|
|
|
|
|
|
|
|
Type *NewTy = ArgTys[D.getArgumentNumber()];
|
|
|
|
if (auto *VTy = dyn_cast<VectorType>(NewTy)) {
|
|
|
|
int SubDivs = D.Kind == IITDescriptor::Subdivide2Argument ? 1 : 2;
|
|
|
|
NewTy = VectorType::getSubdividedVectorType(VTy, SubDivs);
|
|
|
|
return Ty != NewTy;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
2019-08-27 20:57:09 +08:00
|
|
|
case IITDescriptor::ScalableVecArgument: {
|
|
|
|
VectorType *VTy = dyn_cast<VectorType>(Ty);
|
|
|
|
if (!VTy || !VTy->isScalable())
|
|
|
|
return true;
|
|
|
|
return matchIntrinsicType(VTy, Infos, ArgTys, DeferredChecks,
|
|
|
|
IsDeferredCheck);
|
|
|
|
}
|
2019-10-02 17:25:02 +08:00
|
|
|
case IITDescriptor::VecOfBitcastsToInt: {
|
|
|
|
if (D.getArgumentNumber() >= ArgTys.size())
|
|
|
|
return IsDeferredCheck || DeferCheck(Ty);
|
|
|
|
auto *ReferenceType = dyn_cast<VectorType>(ArgTys[D.getArgumentNumber()]);
|
|
|
|
auto *ThisArgVecTy = dyn_cast<VectorType>(Ty);
|
|
|
|
if (!ThisArgVecTy || !ReferenceType)
|
|
|
|
return true;
|
|
|
|
return ThisArgVecTy != VectorType::getInteger(ReferenceType);
|
|
|
|
}
|
2016-06-22 22:56:33 +08:00
|
|
|
}
|
|
|
|
llvm_unreachable("unhandled");
|
|
|
|
}
|
|
|
|
|
2019-06-13 16:19:33 +08:00
|
|
|
Intrinsic::MatchIntrinsicTypesResult
|
|
|
|
Intrinsic::matchIntrinsicSignature(FunctionType *FTy,
|
|
|
|
ArrayRef<Intrinsic::IITDescriptor> &Infos,
|
|
|
|
SmallVectorImpl<Type *> &ArgTys) {
|
|
|
|
SmallVector<DeferredIntrinsicMatchPair, 2> DeferredChecks;
|
|
|
|
if (matchIntrinsicType(FTy->getReturnType(), Infos, ArgTys, DeferredChecks,
|
|
|
|
false))
|
|
|
|
return MatchIntrinsicTypes_NoMatchRet;
|
|
|
|
|
|
|
|
unsigned NumDeferredReturnChecks = DeferredChecks.size();
|
|
|
|
|
|
|
|
for (auto Ty : FTy->params())
|
|
|
|
if (matchIntrinsicType(Ty, Infos, ArgTys, DeferredChecks, false))
|
|
|
|
return MatchIntrinsicTypes_NoMatchArg;
|
|
|
|
|
|
|
|
for (unsigned I = 0, E = DeferredChecks.size(); I != E; ++I) {
|
|
|
|
DeferredIntrinsicMatchPair &Check = DeferredChecks[I];
|
|
|
|
if (matchIntrinsicType(Check.first, Check.second, ArgTys, DeferredChecks,
|
|
|
|
true))
|
|
|
|
return I < NumDeferredReturnChecks ? MatchIntrinsicTypes_NoMatchRet
|
|
|
|
: MatchIntrinsicTypes_NoMatchArg;
|
|
|
|
}
|
|
|
|
|
|
|
|
return MatchIntrinsicTypes_Match;
|
|
|
|
}
|
|
|
|
|
2016-06-24 22:47:27 +08:00
|
|
|
bool
|
|
|
|
Intrinsic::matchIntrinsicVarArg(bool isVarArg,
|
|
|
|
ArrayRef<Intrinsic::IITDescriptor> &Infos) {
|
|
|
|
// If there are no descriptors left, then it can't be a vararg.
|
|
|
|
if (Infos.empty())
|
|
|
|
return isVarArg;
|
|
|
|
|
|
|
|
// There should be only one descriptor remaining at this point.
|
|
|
|
if (Infos.size() != 1)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
// Check and verify the descriptor.
|
|
|
|
IITDescriptor D = Infos.front();
|
|
|
|
Infos = Infos.slice(1);
|
|
|
|
if (D.Kind == IITDescriptor::VarArg)
|
|
|
|
return !isVarArg;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2016-06-24 23:10:29 +08:00
|
|
|
Optional<Function*> Intrinsic::remangleIntrinsicFunction(Function *F) {
|
|
|
|
Intrinsic::ID ID = F->getIntrinsicID();
|
|
|
|
if (!ID)
|
|
|
|
return None;
|
|
|
|
|
|
|
|
FunctionType *FTy = F->getFunctionType();
|
|
|
|
// Accumulate an array of overloaded types for the given intrinsic
|
|
|
|
SmallVector<Type *, 4> ArgTys;
|
|
|
|
{
|
|
|
|
SmallVector<Intrinsic::IITDescriptor, 8> Table;
|
|
|
|
getIntrinsicInfoTableEntries(ID, Table);
|
|
|
|
ArrayRef<Intrinsic::IITDescriptor> TableRef = Table;
|
|
|
|
|
2019-06-13 16:19:33 +08:00
|
|
|
if (Intrinsic::matchIntrinsicSignature(FTy, TableRef, ArgTys))
|
2016-06-24 23:10:29 +08:00
|
|
|
return None;
|
|
|
|
if (Intrinsic::matchIntrinsicVarArg(FTy->isVarArg(), TableRef))
|
|
|
|
return None;
|
|
|
|
}
|
|
|
|
|
|
|
|
StringRef Name = F->getName();
|
|
|
|
if (Name == Intrinsic::getName(ID, ArgTys))
|
|
|
|
return None;
|
|
|
|
|
|
|
|
auto NewDecl = Intrinsic::getDeclaration(F->getParent(), ID, ArgTys);
|
|
|
|
NewDecl->setCallingConv(F->getCallingConv());
|
|
|
|
assert(NewDecl->getFunctionType() == FTy && "Shouldn't change the signature");
|
|
|
|
return NewDecl;
|
|
|
|
}
|
|
|
|
|
2010-03-23 22:40:20 +08:00
|
|
|
/// hasAddressTaken - returns true if there are any uses of this function
|
|
|
|
/// other than direct calls or invokes to it.
|
2010-03-24 21:21:49 +08:00
|
|
|
bool Function::hasAddressTaken(const User* *PutOffender) const {
|
2014-03-09 11:16:01 +08:00
|
|
|
for (const Use &U : uses()) {
|
|
|
|
const User *FU = U.getUser();
|
|
|
|
if (isa<BlockAddress>(FU))
|
2012-05-12 16:30:16 +08:00
|
|
|
continue;
|
2019-01-07 15:31:49 +08:00
|
|
|
const auto *Call = dyn_cast<CallBase>(FU);
|
|
|
|
if (!Call) {
|
2016-02-19 06:09:30 +08:00
|
|
|
if (PutOffender)
|
|
|
|
*PutOffender = FU;
|
|
|
|
return true;
|
|
|
|
}
|
2019-01-07 15:31:49 +08:00
|
|
|
if (!Call->isCallee(&U)) {
|
2016-02-19 06:09:30 +08:00
|
|
|
if (PutOffender)
|
|
|
|
*PutOffender = FU;
|
|
|
|
return true;
|
|
|
|
}
|
2009-06-10 16:41:11 +08:00
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2011-10-20 13:23:42 +08:00
|
|
|
bool Function::isDefTriviallyDead() const {
|
|
|
|
// Check the linkage
|
|
|
|
if (!hasLinkOnceLinkage() && !hasLocalLinkage() &&
|
|
|
|
!hasAvailableExternallyLinkage())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
// Check if the function is used by anything other than a blockaddress.
|
2014-03-09 11:16:01 +08:00
|
|
|
for (const User *U : users())
|
|
|
|
if (!isa<BlockAddress>(U))
|
2011-10-20 13:23:42 +08:00
|
|
|
return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2011-10-18 02:43:40 +08:00
|
|
|
/// callsFunctionThatReturnsTwice - Return true if the function has a call to
|
|
|
|
/// setjmp or other function that gcc recognizes as "returning twice".
|
|
|
|
bool Function::callsFunctionThatReturnsTwice() const {
|
2019-01-07 15:31:49 +08:00
|
|
|
for (const Instruction &I : instructions(this))
|
|
|
|
if (const auto *Call = dyn_cast<CallBase>(&I))
|
|
|
|
if (Call->hasFnAttr(Attribute::ReturnsTwice))
|
|
|
|
return true;
|
2011-10-18 02:43:40 +08:00
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
2013-09-16 09:08:15 +08:00
|
|
|
|
2015-12-19 16:52:49 +08:00
|
|
|
Constant *Function::getPersonalityFn() const {
|
|
|
|
assert(hasPersonalityFn() && getNumOperands());
|
|
|
|
return cast<Constant>(Op<0>());
|
|
|
|
}
|
|
|
|
|
|
|
|
void Function::setPersonalityFn(Constant *Fn) {
|
2015-12-24 02:27:23 +08:00
|
|
|
setHungoffOperand<0>(Fn);
|
2015-12-19 16:52:49 +08:00
|
|
|
setValueSubclassDataBit(3, Fn != nullptr);
|
2015-10-07 04:31:57 +08:00
|
|
|
}
|
|
|
|
|
2013-09-16 09:08:15 +08:00
|
|
|
Constant *Function::getPrefixData() const {
|
2015-12-19 16:52:49 +08:00
|
|
|
assert(hasPrefixData() && getNumOperands());
|
|
|
|
return cast<Constant>(Op<1>());
|
2013-09-16 09:08:15 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void Function::setPrefixData(Constant *PrefixData) {
|
2015-12-24 02:27:23 +08:00
|
|
|
setHungoffOperand<1>(PrefixData);
|
2015-12-19 16:52:49 +08:00
|
|
|
setValueSubclassDataBit(1, PrefixData != nullptr);
|
2013-09-16 09:08:15 +08:00
|
|
|
}
|
2014-12-03 10:08:38 +08:00
|
|
|
|
|
|
|
Constant *Function::getPrologueData() const {
|
2015-12-19 16:52:49 +08:00
|
|
|
assert(hasPrologueData() && getNumOperands());
|
|
|
|
return cast<Constant>(Op<2>());
|
2014-12-03 10:08:38 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void Function::setPrologueData(Constant *PrologueData) {
|
2015-12-24 02:27:23 +08:00
|
|
|
setHungoffOperand<2>(PrologueData);
|
2015-12-19 16:52:49 +08:00
|
|
|
setValueSubclassDataBit(2, PrologueData != nullptr);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Function::allocHungoffUselist() {
|
|
|
|
// If we've already allocated a uselist, stop here.
|
|
|
|
if (getNumOperands())
|
2014-12-03 10:08:38 +08:00
|
|
|
return;
|
|
|
|
|
2015-12-19 16:52:49 +08:00
|
|
|
allocHungoffUses(3, /*IsPhi=*/ false);
|
|
|
|
setNumHungOffUseOperands(3);
|
|
|
|
|
|
|
|
// Initialize the uselist with placeholder operands to allow traversal.
|
|
|
|
auto *CPN = ConstantPointerNull::get(Type::getInt1PtrTy(getContext(), 0));
|
|
|
|
Op<0>().set(CPN);
|
|
|
|
Op<1>().set(CPN);
|
|
|
|
Op<2>().set(CPN);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <int Idx>
|
|
|
|
void Function::setHungoffOperand(Constant *C) {
|
2015-12-24 02:27:23 +08:00
|
|
|
if (C) {
|
|
|
|
allocHungoffUselist();
|
|
|
|
Op<Idx>().set(C);
|
|
|
|
} else if (getNumOperands()) {
|
|
|
|
Op<Idx>().set(
|
|
|
|
ConstantPointerNull::get(Type::getInt1PtrTy(getContext(), 0)));
|
|
|
|
}
|
2015-12-19 16:52:49 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
void Function::setValueSubclassDataBit(unsigned Bit, bool On) {
|
|
|
|
assert(Bit < 16 && "SubclassData contains only 16 bits");
|
|
|
|
if (On)
|
|
|
|
setValueSubclassData(getSubclassDataFromValue() | (1 << Bit));
|
|
|
|
else
|
|
|
|
setValueSubclassData(getSubclassDataFromValue() & ~(1 << Bit));
|
2014-12-03 10:08:38 +08:00
|
|
|
}
|
2015-05-07 07:54:14 +08:00
|
|
|
|
2018-01-18 06:24:23 +08:00
|
|
|
void Function::setEntryCount(ProfileCount Count,
|
2017-03-01 02:09:44 +08:00
|
|
|
const DenseSet<GlobalValue::GUID> *S) {
|
2018-01-18 06:24:23 +08:00
|
|
|
assert(Count.hasValue());
|
|
|
|
#if !defined(NDEBUG)
|
|
|
|
auto PrevCount = getEntryCount();
|
|
|
|
assert(!PrevCount.hasValue() || PrevCount.getType() == Count.getType());
|
|
|
|
#endif
|
2019-11-02 03:57:23 +08:00
|
|
|
|
|
|
|
auto ImportGUIDs = getImportGUIDs();
|
|
|
|
if (S == nullptr && ImportGUIDs.size())
|
|
|
|
S = &ImportGUIDs;
|
|
|
|
|
2015-05-13 23:13:45 +08:00
|
|
|
MDBuilder MDB(getContext());
|
2018-01-18 06:24:23 +08:00
|
|
|
setMetadata(
|
|
|
|
LLVMContext::MD_prof,
|
|
|
|
MDB.createFunctionEntryCount(Count.getCount(), Count.isSynthetic(), S));
|
2015-05-13 23:13:45 +08:00
|
|
|
}
|
|
|
|
|
2018-01-18 06:24:23 +08:00
|
|
|
void Function::setEntryCount(uint64_t Count, Function::ProfileCountType Type,
|
|
|
|
const DenseSet<GlobalValue::GUID> *Imports) {
|
|
|
|
setEntryCount(ProfileCount(Count, Type), Imports);
|
|
|
|
}
|
|
|
|
|
2019-04-25 03:51:16 +08:00
|
|
|
ProfileCount Function::getEntryCount(bool AllowSynthetic) const {
|
2015-05-13 23:13:45 +08:00
|
|
|
MDNode *MD = getMetadata(LLVMContext::MD_prof);
|
|
|
|
if (MD && MD->getOperand(0))
|
2018-01-18 06:24:23 +08:00
|
|
|
if (MDString *MDS = dyn_cast<MDString>(MD->getOperand(0))) {
|
2015-05-13 23:13:45 +08:00
|
|
|
if (MDS->getString().equals("function_entry_count")) {
|
|
|
|
ConstantInt *CI = mdconst::extract<ConstantInt>(MD->getOperand(1));
|
2016-08-06 02:38:19 +08:00
|
|
|
uint64_t Count = CI->getValue().getZExtValue();
|
2017-12-19 04:02:43 +08:00
|
|
|
// A value of -1 is used for SamplePGO when there were no samples.
|
|
|
|
// Treat this the same as unknown.
|
|
|
|
if (Count == (uint64_t)-1)
|
2018-01-18 06:24:23 +08:00
|
|
|
return ProfileCount::getInvalid();
|
|
|
|
return ProfileCount(Count, PCT_Real);
|
2019-04-25 03:51:16 +08:00
|
|
|
} else if (AllowSynthetic &&
|
|
|
|
MDS->getString().equals("synthetic_function_entry_count")) {
|
2018-01-18 06:24:23 +08:00
|
|
|
ConstantInt *CI = mdconst::extract<ConstantInt>(MD->getOperand(1));
|
|
|
|
uint64_t Count = CI->getValue().getZExtValue();
|
|
|
|
return ProfileCount(Count, PCT_Synthetic);
|
2015-05-13 23:13:45 +08:00
|
|
|
}
|
2018-01-18 06:24:23 +08:00
|
|
|
}
|
|
|
|
return ProfileCount::getInvalid();
|
2015-05-13 23:13:45 +08:00
|
|
|
}
|
2016-10-19 04:42:47 +08:00
|
|
|
|
2017-03-01 02:09:44 +08:00
|
|
|
DenseSet<GlobalValue::GUID> Function::getImportGUIDs() const {
|
|
|
|
DenseSet<GlobalValue::GUID> R;
|
|
|
|
if (MDNode *MD = getMetadata(LLVMContext::MD_prof))
|
|
|
|
if (MDString *MDS = dyn_cast<MDString>(MD->getOperand(0)))
|
|
|
|
if (MDS->getString().equals("function_entry_count"))
|
|
|
|
for (unsigned i = 2; i < MD->getNumOperands(); i++)
|
|
|
|
R.insert(mdconst::extract<ConstantInt>(MD->getOperand(i))
|
|
|
|
->getValue()
|
|
|
|
.getZExtValue());
|
|
|
|
return R;
|
|
|
|
}
|
|
|
|
|
2016-10-19 04:42:47 +08:00
|
|
|
void Function::setSectionPrefix(StringRef Prefix) {
|
|
|
|
MDBuilder MDB(getContext());
|
|
|
|
setMetadata(LLVMContext::MD_section_prefix,
|
|
|
|
MDB.createFunctionSectionPrefix(Prefix));
|
|
|
|
}
|
|
|
|
|
|
|
|
Optional<StringRef> Function::getSectionPrefix() const {
|
|
|
|
if (MDNode *MD = getMetadata(LLVMContext::MD_section_prefix)) {
|
2018-05-05 09:57:00 +08:00
|
|
|
assert(cast<MDString>(MD->getOperand(0))
|
2016-10-19 04:42:47 +08:00
|
|
|
->getString()
|
|
|
|
.equals("function_section_prefix") &&
|
|
|
|
"Metadata not match");
|
2018-05-05 09:57:00 +08:00
|
|
|
return cast<MDString>(MD->getOperand(1))->getString();
|
2016-10-19 04:42:47 +08:00
|
|
|
}
|
|
|
|
return None;
|
|
|
|
}
|
llvm: Add support for "-fno-delete-null-pointer-checks"
Summary:
Support for this option is needed for building Linux kernel.
This is a very frequently requested feature by kernel developers.
More details : https://lkml.org/lkml/2018/4/4/601
GCC option description for -fdelete-null-pointer-checks:
This Assume that programs cannot safely dereference null pointers,
and that no code or data element resides at address zero.
-fno-delete-null-pointer-checks is the inverse of this implying that
null pointer dereferencing is not undefined.
This feature is implemented in LLVM IR in this CL as the function attribute
"null-pointer-is-valid"="true" in IR (Under review at D47894).
The CL updates several passes that assumed null pointer dereferencing is
undefined to not optimize when the "null-pointer-is-valid"="true"
attribute is present.
Reviewers: t.p.northover, efriedma, jyknight, chandlerc, rnk, srhines, void, george.burgess.iv
Reviewed By: efriedma, george.burgess.iv
Subscribers: eraman, haicheng, george.burgess.iv, drinkcat, theraven, reames, sanjoy, xbolva00, llvm-commits
Differential Revision: https://reviews.llvm.org/D47895
llvm-svn: 336613
2018-07-10 06:27:23 +08:00
|
|
|
|
|
|
|
bool Function::nullPointerIsDefined() const {
|
|
|
|
return getFnAttribute("null-pointer-is-valid")
|
|
|
|
.getValueAsString()
|
|
|
|
.equals("true");
|
|
|
|
}
|
|
|
|
|
|
|
|
bool llvm::NullPointerIsDefined(const Function *F, unsigned AS) {
|
|
|
|
if (F && F->nullPointerIsDefined())
|
|
|
|
return true;
|
|
|
|
|
|
|
|
if (AS != 0)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|