2017-02-17 01:00:09 +01:00
|
|
|
//===- Attributes.cpp - Implement AttributesList --------------------------===//
|
2008-01-03 00:42:30 +01:00
|
|
|
//
|
2019-01-19 09:50:56 +01: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
|
2008-01-03 00:42:30 +01:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2013-01-28 22:55:20 +01:00
|
|
|
// \file
|
2018-05-01 17:54:18 +02:00
|
|
|
// This file implements the Attribute, AttributeImpl, AttrBuilder,
|
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-21 17:57:19 +01:00
|
|
|
// AttributeListImpl, and AttributeList classes.
|
2008-01-03 00:42:30 +01:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2017-06-06 13:49:48 +02:00
|
|
|
#include "llvm/IR/Attributes.h"
|
2012-12-20 02:36:59 +01:00
|
|
|
#include "AttributeImpl.h"
|
2012-09-26 23:07:29 +02:00
|
|
|
#include "LLVMContextImpl.h"
|
2017-02-17 01:00:09 +01:00
|
|
|
#include "llvm/ADT/ArrayRef.h"
|
|
|
|
#include "llvm/ADT/FoldingSet.h"
|
|
|
|
#include "llvm/ADT/Optional.h"
|
2014-04-12 18:15:53 +02:00
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2017-06-06 13:49:48 +02:00
|
|
|
#include "llvm/ADT/SmallVector.h"
|
2012-12-03 17:50:05 +01:00
|
|
|
#include "llvm/ADT/StringExtras.h"
|
2017-02-17 01:00:09 +01:00
|
|
|
#include "llvm/ADT/StringRef.h"
|
2020-02-29 19:23:54 +01:00
|
|
|
#include "llvm/ADT/StringSwitch.h"
|
2020-06-25 13:48:36 +02:00
|
|
|
#include "llvm/ADT/Twine.h"
|
2018-04-30 16:59:11 +02:00
|
|
|
#include "llvm/Config/llvm-config.h"
|
2017-02-17 01:00:09 +01:00
|
|
|
#include "llvm/IR/Function.h"
|
|
|
|
#include "llvm/IR/LLVMContext.h"
|
2013-01-02 12:36:10 +01:00
|
|
|
#include "llvm/IR/Type.h"
|
2017-02-17 01:00:09 +01:00
|
|
|
#include "llvm/Support/Compiler.h"
|
2010-01-05 02:29:58 +01:00
|
|
|
#include "llvm/Support/Debug.h"
|
2017-02-17 01:00:09 +01:00
|
|
|
#include "llvm/Support/ErrorHandling.h"
|
|
|
|
#include "llvm/Support/MathExtras.h"
|
2009-08-23 13:37:21 +02:00
|
|
|
#include "llvm/Support/raw_ostream.h"
|
2013-01-24 01:06:56 +01:00
|
|
|
#include <algorithm>
|
2017-02-17 01:00:09 +01:00
|
|
|
#include <cassert>
|
2017-05-15 23:57:41 +02:00
|
|
|
#include <climits>
|
|
|
|
#include <cstddef>
|
2017-02-17 01:00:09 +01:00
|
|
|
#include <cstdint>
|
|
|
|
#include <limits>
|
|
|
|
#include <string>
|
|
|
|
#include <tuple>
|
|
|
|
#include <utility>
|
|
|
|
|
2008-01-03 00:42:30 +01:00
|
|
|
using namespace llvm;
|
|
|
|
|
2008-03-12 18:45:29 +01:00
|
|
|
//===----------------------------------------------------------------------===//
|
2013-01-29 01:48:16 +01:00
|
|
|
// Attribute Construction Methods
|
2008-03-12 18:45:29 +01:00
|
|
|
//===----------------------------------------------------------------------===//
|
2008-01-14 20:52:09 +01:00
|
|
|
|
2016-04-12 03:05:35 +02:00
|
|
|
// allocsize has two integer arguments, but because they're both 32 bits, we can
|
|
|
|
// pack them into one 64-bit value, at the cost of making said value
|
|
|
|
// nonsensical.
|
|
|
|
//
|
|
|
|
// In order to do this, we need to reserve one value of the second (optional)
|
|
|
|
// allocsize argument to signify "not present."
|
2016-08-25 03:05:08 +02:00
|
|
|
static const unsigned AllocSizeNumElemsNotPresent = -1;
|
2016-04-12 03:05:35 +02:00
|
|
|
|
|
|
|
static uint64_t packAllocSizeArgs(unsigned ElemSizeArg,
|
|
|
|
const Optional<unsigned> &NumElemsArg) {
|
|
|
|
assert((!NumElemsArg.hasValue() ||
|
|
|
|
*NumElemsArg != AllocSizeNumElemsNotPresent) &&
|
|
|
|
"Attempting to pack a reserved value");
|
|
|
|
|
|
|
|
return uint64_t(ElemSizeArg) << 32 |
|
|
|
|
NumElemsArg.getValueOr(AllocSizeNumElemsNotPresent);
|
|
|
|
}
|
|
|
|
|
|
|
|
static std::pair<unsigned, Optional<unsigned>>
|
|
|
|
unpackAllocSizeArgs(uint64_t Num) {
|
|
|
|
unsigned NumElems = Num & std::numeric_limits<unsigned>::max();
|
|
|
|
unsigned ElemSizeArg = Num >> 32;
|
|
|
|
|
|
|
|
Optional<unsigned> NumElemsArg;
|
|
|
|
if (NumElems != AllocSizeNumElemsNotPresent)
|
|
|
|
NumElemsArg = NumElems;
|
|
|
|
return std::make_pair(ElemSizeArg, NumElemsArg);
|
|
|
|
}
|
|
|
|
|
2013-02-05 23:37:24 +01:00
|
|
|
Attribute Attribute::get(LLVMContext &Context, Attribute::AttrKind Kind,
|
|
|
|
uint64_t Val) {
|
2012-10-08 23:47:17 +02:00
|
|
|
LLVMContextImpl *pImpl = Context.pImpl;
|
|
|
|
FoldingSetNodeID ID;
|
2013-02-05 23:37:24 +01:00
|
|
|
ID.AddInteger(Kind);
|
2014-09-04 01:38:05 +02:00
|
|
|
if (Val) ID.AddInteger(Val);
|
2012-10-08 23:47:17 +02:00
|
|
|
|
|
|
|
void *InsertPoint;
|
2012-12-20 02:36:59 +01:00
|
|
|
AttributeImpl *PA = pImpl->AttrsSet.FindNodeOrInsertPos(ID, InsertPoint);
|
2012-10-08 23:47:17 +02:00
|
|
|
|
|
|
|
if (!PA) {
|
|
|
|
// If we didn't find any existing attributes of the same shape then create a
|
|
|
|
// new one and insert it.
|
2014-09-04 01:38:05 +02:00
|
|
|
if (!Val)
|
2020-05-01 14:12:17 +02:00
|
|
|
PA = new (pImpl->Alloc) EnumAttributeImpl(Kind);
|
2014-09-04 01:38:05 +02:00
|
|
|
else
|
2020-05-01 14:12:17 +02:00
|
|
|
PA = new (pImpl->Alloc) IntAttributeImpl(Kind, Val);
|
2012-10-08 23:47:17 +02:00
|
|
|
pImpl->AttrsSet.InsertNode(PA, InsertPoint);
|
|
|
|
}
|
|
|
|
|
2013-02-05 09:09:32 +01:00
|
|
|
// Return the Attribute that we found or created.
|
2012-12-19 08:18:57 +01:00
|
|
|
return Attribute(PA);
|
2012-10-08 23:47:17 +02:00
|
|
|
}
|
|
|
|
|
2013-02-05 23:37:24 +01:00
|
|
|
Attribute Attribute::get(LLVMContext &Context, StringRef Kind, StringRef Val) {
|
|
|
|
LLVMContextImpl *pImpl = Context.pImpl;
|
|
|
|
FoldingSetNodeID ID;
|
|
|
|
ID.AddString(Kind);
|
|
|
|
if (!Val.empty()) ID.AddString(Val);
|
|
|
|
|
|
|
|
void *InsertPoint;
|
|
|
|
AttributeImpl *PA = pImpl->AttrsSet.FindNodeOrInsertPos(ID, InsertPoint);
|
|
|
|
|
|
|
|
if (!PA) {
|
|
|
|
// If we didn't find any existing attributes of the same shape then create a
|
|
|
|
// new one and insert it.
|
2020-05-01 14:12:17 +02:00
|
|
|
void *Mem =
|
|
|
|
pImpl->Alloc.Allocate(StringAttributeImpl::totalSizeToAlloc(Kind, Val),
|
|
|
|
alignof(StringAttributeImpl));
|
|
|
|
PA = new (Mem) StringAttributeImpl(Kind, Val);
|
2013-02-05 23:37:24 +01:00
|
|
|
pImpl->AttrsSet.InsertNode(PA, InsertPoint);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Return the Attribute that we found or created.
|
|
|
|
return Attribute(PA);
|
2013-02-01 00:16:25 +01:00
|
|
|
}
|
|
|
|
|
2019-05-30 20:48:23 +02:00
|
|
|
Attribute Attribute::get(LLVMContext &Context, Attribute::AttrKind Kind,
|
|
|
|
Type *Ty) {
|
|
|
|
LLVMContextImpl *pImpl = Context.pImpl;
|
|
|
|
FoldingSetNodeID ID;
|
|
|
|
ID.AddInteger(Kind);
|
|
|
|
ID.AddPointer(Ty);
|
|
|
|
|
|
|
|
void *InsertPoint;
|
|
|
|
AttributeImpl *PA = pImpl->AttrsSet.FindNodeOrInsertPos(ID, InsertPoint);
|
|
|
|
|
|
|
|
if (!PA) {
|
|
|
|
// If we didn't find any existing attributes of the same shape then create a
|
|
|
|
// new one and insert it.
|
2020-05-01 14:12:17 +02:00
|
|
|
PA = new (pImpl->Alloc) TypeAttributeImpl(Kind, Ty);
|
2019-05-30 20:48:23 +02:00
|
|
|
pImpl->AttrsSet.InsertNode(PA, InsertPoint);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Return the Attribute that we found or created.
|
|
|
|
return Attribute(PA);
|
|
|
|
}
|
|
|
|
|
2019-10-15 14:56:24 +02:00
|
|
|
Attribute Attribute::getWithAlignment(LLVMContext &Context, Align A) {
|
[IR] Attribute/AttrBuilder: use Value::MaximumAlignment magic constant
Summary:
I initially encountered those assertions when trying to create
this IR `alignment` attribute from clang's `__attribute__((assume_aligned(imm)))`,
because until D72994 there is no sanity checking for the value of `imm`.
But even then, we have `llvm::Value::MaximumAlignment` constant (which is `536870912`),
which is enforced for clang attributes, and then there are some other magical constant
(`0x40000000` i.e. `1073741824` i.e. `2 * 536870912`) in
`Attribute::getWithAlignment()`/`AttrBuilder::addAlignmentAttr()`.
I strongly suspect that `0x40000000` is incorrect,
and that also should be `llvm::Value::MaximumAlignment`.
Reviewers: erichkeane, hfinkel, jdoerfert, gchatelet, courbet
Reviewed By: erichkeane
Subscribers: hiraditya, cfe-commits, llvm-commits
Tags: #llvm, #clang
Differential Revision: https://reviews.llvm.org/D72998
2020-01-23 20:50:06 +01:00
|
|
|
assert(A <= llvm::Value::MaximumAlignment && "Alignment too large.");
|
2019-10-15 14:56:24 +02:00
|
|
|
return get(Context, Alignment, A.value());
|
2013-01-27 23:43:04 +01:00
|
|
|
}
|
|
|
|
|
2019-10-15 14:56:24 +02:00
|
|
|
Attribute Attribute::getWithStackAlignment(LLVMContext &Context, Align A) {
|
|
|
|
assert(A <= 0x100 && "Alignment too large.");
|
|
|
|
return get(Context, StackAlignment, A.value());
|
2013-01-27 23:43:04 +01:00
|
|
|
}
|
|
|
|
|
2014-07-18 17:51:28 +02:00
|
|
|
Attribute Attribute::getWithDereferenceableBytes(LLVMContext &Context,
|
|
|
|
uint64_t Bytes) {
|
|
|
|
assert(Bytes && "Bytes must be non-zero.");
|
|
|
|
return get(Context, Dereferenceable, Bytes);
|
|
|
|
}
|
|
|
|
|
2015-04-16 22:29:50 +02:00
|
|
|
Attribute Attribute::getWithDereferenceableOrNullBytes(LLVMContext &Context,
|
|
|
|
uint64_t Bytes) {
|
|
|
|
assert(Bytes && "Bytes must be non-zero.");
|
|
|
|
return get(Context, DereferenceableOrNull, Bytes);
|
|
|
|
}
|
|
|
|
|
2019-05-30 20:48:23 +02:00
|
|
|
Attribute Attribute::getWithByValType(LLVMContext &Context, Type *Ty) {
|
|
|
|
return get(Context, ByVal, Ty);
|
|
|
|
}
|
|
|
|
|
2020-09-29 15:33:55 +02:00
|
|
|
Attribute Attribute::getWithStructRetType(LLVMContext &Context, Type *Ty) {
|
|
|
|
return get(Context, StructRet, Ty);
|
|
|
|
}
|
|
|
|
|
IR: Define byref parameter attribute
This allows tracking the in-memory type of a pointer argument to a
function for ABI purposes. This is essentially a stripped down version
of byval to remove some of the stack-copy implications in its
definition.
This includes the base IR changes, and some tests for places where it
should be treated similarly to byval. Codegen support will be in a
future patch.
My original attempt at solving some of these problems was to repurpose
byval with a different address space from the stack. However, it is
technically permitted for the callee to introduce a write to the
argument, although nothing does this in reality. There is also talk of
removing and replacing the byval attribute, so a new attribute would
need to take its place anyway.
This is intended avoid some optimization issues with the current
handling of aggregate arguments, as well as fixes inflexibilty in how
frontends can specify the kernel ABI. The most honest representation
of the amdgpu_kernel convention is to expose all kernel arguments as
loads from constant memory. Today, these are raw, SSA Argument values
and codegen is responsible for turning these into loads.
Background:
There currently isn't a satisfactory way to represent how arguments
for the amdgpu_kernel calling convention are passed. In reality,
arguments are passed in a single, flat, constant memory buffer
implicitly passed to the function. It is also illegal to call this
function in the IR, and this is only ever invoked by a driver of some
kind.
It does not make sense to have a stack passed parameter in this
context as is implied by byval. It is never valid to write to the
kernel arguments, as this would corrupt the inputs seen by other
dispatches of the kernel. These argumets are also not in the same
address space as the stack, so a copy is needed to an alloca. From a
source C-like language, the kernel parameters are invisible.
Semantically, a copy is always required from the constant argument
memory to a mutable variable.
The current clang calling convention lowering emits raw values,
including aggregates into the function argument list, since using
byval would not make sense. This has some unfortunate consequences for
the optimizer. In the aggregate case, we end up with an aggregate
store to alloca, which both SROA and instcombine turn into a store of
each aggregate field. The optimizer never pieces this back together to
see that this is really just a copy from constant memory, so we end up
stuck with expensive stack usage.
This also means the backend dictates the alignment of arguments, and
arbitrarily picks the LLVM IR ABI type alignment. By allowing an
explicit alignment, frontends can make better decisions. For example,
there's real no advantage to an aligment higher than 4, so a frontend
could choose to compact the argument layout. Similarly, there is a
high penalty to using an alignment lower than 4, so a frontend could
opt into more padding for small arguments.
Another design consideration is when it is appropriate to expose the
fact that these arguments are all really passed in adjacent
memory. Currently we have a late IR optimization pass in codegen to
rewrite the kernel argument values into explicit loads to enable
vectorization. In most programs, unrelated argument loads can be
merged together. However, exposing this property directly from the
frontend has some disadvantages. We still need a way to track the
original argument sizes and alignments to report to the driver. I find
using some side-channel, metadata mechanism to track this
unappealing. If the kernel arguments were exposed as a single buffer
to begin with, alias analysis would be unaware that the padding bits
betewen arguments are meaningless. Another family of problems is there
are still some gaps in replacing all of the available parameter
attributes with metadata equivalents once lowered to loads.
The immediate plan is to start using this new attribute to handle all
aggregate argumets for kernels. Long term, it makes sense to migrate
all kernel arguments, including scalars, to be passed indirectly in
the same manner.
Additional context is in D79744.
2020-06-05 22:58:47 +02:00
|
|
|
Attribute Attribute::getWithByRefType(LLVMContext &Context, Type *Ty) {
|
|
|
|
return get(Context, ByRef, Ty);
|
|
|
|
}
|
|
|
|
|
2020-02-14 23:16:53 +01:00
|
|
|
Attribute Attribute::getWithPreallocatedType(LLVMContext &Context, Type *Ty) {
|
|
|
|
return get(Context, Preallocated, Ty);
|
|
|
|
}
|
|
|
|
|
2016-04-12 03:05:35 +02:00
|
|
|
Attribute
|
|
|
|
Attribute::getWithAllocSizeArgs(LLVMContext &Context, unsigned ElemSizeArg,
|
|
|
|
const Optional<unsigned> &NumElemsArg) {
|
|
|
|
assert(!(ElemSizeArg == 0 && NumElemsArg && *NumElemsArg == 0) &&
|
|
|
|
"Invalid allocsize arguments -- given allocsize(0, 0)");
|
|
|
|
return get(Context, AllocSize, packAllocSizeArgs(ElemSizeArg, NumElemsArg));
|
|
|
|
}
|
|
|
|
|
2020-02-02 14:46:59 +01:00
|
|
|
Attribute::AttrKind Attribute::getAttrKindFromName(StringRef AttrName) {
|
|
|
|
return StringSwitch<Attribute::AttrKind>(AttrName)
|
|
|
|
#define GET_ATTR_NAMES
|
|
|
|
#define ATTRIBUTE_ENUM(ENUM_NAME, DISPLAY_NAME) \
|
|
|
|
.Case(#DISPLAY_NAME, Attribute::ENUM_NAME)
|
|
|
|
#include "llvm/IR/Attributes.inc"
|
|
|
|
.Default(Attribute::None);
|
|
|
|
}
|
|
|
|
|
|
|
|
StringRef Attribute::getNameFromAttrKind(Attribute::AttrKind AttrKind) {
|
|
|
|
switch (AttrKind) {
|
|
|
|
#define GET_ATTR_NAMES
|
|
|
|
#define ATTRIBUTE_ENUM(ENUM_NAME, DISPLAY_NAME) \
|
|
|
|
case Attribute::ENUM_NAME: \
|
|
|
|
return #DISPLAY_NAME;
|
|
|
|
#include "llvm/IR/Attributes.inc"
|
|
|
|
case Attribute::None:
|
|
|
|
return "none";
|
|
|
|
default:
|
|
|
|
llvm_unreachable("invalid Kind");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-02-02 14:47:00 +01:00
|
|
|
bool Attribute::doesAttrKindHaveArgument(Attribute::AttrKind AttrKind) {
|
|
|
|
return AttrKind == Attribute::Alignment ||
|
|
|
|
AttrKind == Attribute::StackAlignment ||
|
|
|
|
AttrKind == Attribute::Dereferenceable ||
|
|
|
|
AttrKind == Attribute::AllocSize ||
|
|
|
|
AttrKind == Attribute::DereferenceableOrNull;
|
|
|
|
}
|
|
|
|
|
2020-03-11 23:21:44 +01:00
|
|
|
bool Attribute::isExistingAttribute(StringRef Name) {
|
|
|
|
return StringSwitch<bool>(Name)
|
|
|
|
#define GET_ATTR_NAMES
|
|
|
|
#define ATTRIBUTE_ALL(ENUM_NAME, DISPLAY_NAME) .Case(#DISPLAY_NAME, true)
|
|
|
|
#include "llvm/IR/Attributes.inc"
|
|
|
|
.Default(false);
|
|
|
|
}
|
|
|
|
|
2013-01-29 01:48:16 +01:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Attribute Accessor Methods
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2013-02-05 23:37:24 +01:00
|
|
|
bool Attribute::isEnumAttribute() const {
|
|
|
|
return pImpl && pImpl->isEnumAttribute();
|
2012-10-05 08:44:41 +02:00
|
|
|
}
|
|
|
|
|
2014-07-18 08:51:55 +02:00
|
|
|
bool Attribute::isIntAttribute() const {
|
|
|
|
return pImpl && pImpl->isIntAttribute();
|
2013-01-29 21:45:34 +01:00
|
|
|
}
|
|
|
|
|
2013-02-05 23:37:24 +01:00
|
|
|
bool Attribute::isStringAttribute() const {
|
|
|
|
return pImpl && pImpl->isStringAttribute();
|
|
|
|
}
|
|
|
|
|
2019-05-30 20:48:23 +02:00
|
|
|
bool Attribute::isTypeAttribute() const {
|
|
|
|
return pImpl && pImpl->isTypeAttribute();
|
|
|
|
}
|
|
|
|
|
2013-02-05 23:37:24 +01:00
|
|
|
Attribute::AttrKind Attribute::getKindAsEnum() const {
|
2013-07-25 02:34:29 +02:00
|
|
|
if (!pImpl) return None;
|
2019-05-30 20:48:23 +02:00
|
|
|
assert((isEnumAttribute() || isIntAttribute() || isTypeAttribute()) &&
|
2013-02-05 23:37:24 +01:00
|
|
|
"Invalid attribute type to get the kind as an enum!");
|
2015-12-16 06:21:02 +01:00
|
|
|
return pImpl->getKindAsEnum();
|
2013-02-05 23:37:24 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t Attribute::getValueAsInt() const {
|
2013-07-25 02:34:29 +02:00
|
|
|
if (!pImpl) return 0;
|
2014-07-18 08:51:55 +02:00
|
|
|
assert(isIntAttribute() &&
|
|
|
|
"Expected the attribute to be an integer attribute!");
|
2015-12-16 06:21:02 +01:00
|
|
|
return pImpl->getValueAsInt();
|
2013-02-05 23:37:24 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
StringRef Attribute::getKindAsString() const {
|
2018-03-30 02:47:31 +02:00
|
|
|
if (!pImpl) return {};
|
2013-02-05 23:37:24 +01:00
|
|
|
assert(isStringAttribute() &&
|
|
|
|
"Invalid attribute type to get the kind as a string!");
|
2015-12-16 06:21:02 +01:00
|
|
|
return pImpl->getKindAsString();
|
2013-02-05 23:37:24 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
StringRef Attribute::getValueAsString() const {
|
2018-03-30 02:47:31 +02:00
|
|
|
if (!pImpl) return {};
|
2013-02-05 23:37:24 +01:00
|
|
|
assert(isStringAttribute() &&
|
|
|
|
"Invalid attribute type to get the value as a string!");
|
2015-12-16 06:21:02 +01:00
|
|
|
return pImpl->getValueAsString();
|
2013-02-05 23:37:24 +01:00
|
|
|
}
|
|
|
|
|
2019-05-30 20:48:23 +02:00
|
|
|
Type *Attribute::getValueAsType() const {
|
|
|
|
if (!pImpl) return {};
|
|
|
|
assert(isTypeAttribute() &&
|
|
|
|
"Invalid attribute type to get the value as a type!");
|
|
|
|
return pImpl->getValueAsType();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-02-06 00:48:36 +01:00
|
|
|
bool Attribute::hasAttribute(AttrKind Kind) const {
|
|
|
|
return (pImpl && pImpl->hasAttribute(Kind)) || (!pImpl && Kind == None);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool Attribute::hasAttribute(StringRef Kind) const {
|
|
|
|
if (!isStringAttribute()) return false;
|
|
|
|
return pImpl && pImpl->hasAttribute(Kind);
|
2013-01-29 21:45:34 +01:00
|
|
|
}
|
|
|
|
|
2019-10-22 11:51:06 +02:00
|
|
|
MaybeAlign Attribute::getAlignment() const {
|
2013-02-01 02:04:27 +01:00
|
|
|
assert(hasAttribute(Attribute::Alignment) &&
|
|
|
|
"Trying to get alignment from non-alignment attribute!");
|
2019-10-22 11:51:06 +02:00
|
|
|
return MaybeAlign(pImpl->getValueAsInt());
|
2012-10-05 08:44:41 +02:00
|
|
|
}
|
|
|
|
|
2019-10-22 11:51:06 +02:00
|
|
|
MaybeAlign Attribute::getStackAlignment() const {
|
2013-02-01 02:04:27 +01:00
|
|
|
assert(hasAttribute(Attribute::StackAlignment) &&
|
|
|
|
"Trying to get alignment from non-alignment attribute!");
|
2019-10-22 11:51:06 +02:00
|
|
|
return MaybeAlign(pImpl->getValueAsInt());
|
2012-10-05 08:44:41 +02:00
|
|
|
}
|
|
|
|
|
2014-07-18 17:51:28 +02:00
|
|
|
uint64_t Attribute::getDereferenceableBytes() const {
|
|
|
|
assert(hasAttribute(Attribute::Dereferenceable) &&
|
|
|
|
"Trying to get dereferenceable bytes from "
|
|
|
|
"non-dereferenceable attribute!");
|
|
|
|
return pImpl->getValueAsInt();
|
|
|
|
}
|
|
|
|
|
2015-04-16 22:29:50 +02:00
|
|
|
uint64_t Attribute::getDereferenceableOrNullBytes() const {
|
|
|
|
assert(hasAttribute(Attribute::DereferenceableOrNull) &&
|
|
|
|
"Trying to get dereferenceable bytes from "
|
|
|
|
"non-dereferenceable attribute!");
|
|
|
|
return pImpl->getValueAsInt();
|
|
|
|
}
|
|
|
|
|
2016-04-12 03:05:35 +02:00
|
|
|
std::pair<unsigned, Optional<unsigned>> Attribute::getAllocSizeArgs() const {
|
|
|
|
assert(hasAttribute(Attribute::AllocSize) &&
|
|
|
|
"Trying to get allocsize args from non-allocsize attribute");
|
|
|
|
return unpackAllocSizeArgs(pImpl->getValueAsInt());
|
|
|
|
}
|
|
|
|
|
2013-02-11 09:43:33 +01:00
|
|
|
std::string Attribute::getAsString(bool InAttrGrp) const {
|
2018-03-30 02:47:31 +02:00
|
|
|
if (!pImpl) return {};
|
2013-01-31 21:59:05 +01:00
|
|
|
|
2013-02-26 07:58:09 +01:00
|
|
|
if (hasAttribute(Attribute::SanitizeAddress))
|
|
|
|
return "sanitize_address";
|
2017-12-09 01:21:41 +01:00
|
|
|
if (hasAttribute(Attribute::SanitizeHWAddress))
|
|
|
|
return "sanitize_hwaddress";
|
ARM MTE stack sanitizer.
Add "memtag" sanitizer that detects and mitigates stack memory issues
using armv8.5 Memory Tagging Extension.
It is similar in principle to HWASan, which is a software implementation
of the same idea, but there are enough differencies to warrant a new
sanitizer type IMHO. It is also expected to have very different
performance properties.
The new sanitizer does not have a runtime library (it may grow one
later, along with a "debugging" mode). Similar to SafeStack and
StackProtector, the instrumentation pass (in a follow up change) will be
inserted in all cases, but will only affect functions marked with the
new sanitize_memtag attribute.
Reviewers: pcc, hctim, vitalybuka, ostannard
Subscribers: srhines, mehdi_amini, javed.absar, kristof.beyls, hiraditya, cryptoad, steven_wu, dexonsmith, cfe-commits, llvm-commits
Tags: #clang, #llvm
Differential Revision: https://reviews.llvm.org/D64169
llvm-svn: 366123
2019-07-15 22:02:23 +02:00
|
|
|
if (hasAttribute(Attribute::SanitizeMemTag))
|
|
|
|
return "sanitize_memtag";
|
2013-01-31 21:59:05 +01:00
|
|
|
if (hasAttribute(Attribute::AlwaysInline))
|
|
|
|
return "alwaysinline";
|
2015-07-11 12:30:36 +02:00
|
|
|
if (hasAttribute(Attribute::ArgMemOnly))
|
|
|
|
return "argmemonly";
|
2013-06-27 02:25:01 +02:00
|
|
|
if (hasAttribute(Attribute::Builtin))
|
|
|
|
return "builtin";
|
2015-05-27 01:48:40 +02:00
|
|
|
if (hasAttribute(Attribute::Convergent))
|
|
|
|
return "convergent";
|
2016-04-01 23:41:15 +02:00
|
|
|
if (hasAttribute(Attribute::SwiftError))
|
|
|
|
return "swifterror";
|
2016-03-29 19:37:21 +02:00
|
|
|
if (hasAttribute(Attribute::SwiftSelf))
|
|
|
|
return "swiftself";
|
2015-12-16 17:16:19 +01:00
|
|
|
if (hasAttribute(Attribute::InaccessibleMemOnly))
|
|
|
|
return "inaccessiblememonly";
|
|
|
|
if (hasAttribute(Attribute::InaccessibleMemOrArgMemOnly))
|
|
|
|
return "inaccessiblemem_or_argmemonly";
|
2013-12-19 03:14:12 +01:00
|
|
|
if (hasAttribute(Attribute::InAlloca))
|
|
|
|
return "inalloca";
|
2013-01-31 21:59:05 +01:00
|
|
|
if (hasAttribute(Attribute::InlineHint))
|
|
|
|
return "inlinehint";
|
2012-12-19 08:18:57 +01:00
|
|
|
if (hasAttribute(Attribute::InReg))
|
2013-01-29 04:20:31 +01:00
|
|
|
return "inreg";
|
2014-06-05 21:29:43 +02:00
|
|
|
if (hasAttribute(Attribute::JumpTable))
|
|
|
|
return "jumptable";
|
2013-01-31 21:59:05 +01:00
|
|
|
if (hasAttribute(Attribute::MinSize))
|
|
|
|
return "minsize";
|
|
|
|
if (hasAttribute(Attribute::Naked))
|
|
|
|
return "naked";
|
|
|
|
if (hasAttribute(Attribute::Nest))
|
|
|
|
return "nest";
|
2012-12-19 08:18:57 +01:00
|
|
|
if (hasAttribute(Attribute::NoAlias))
|
2013-01-29 04:20:31 +01:00
|
|
|
return "noalias";
|
2013-02-22 01:12:35 +01:00
|
|
|
if (hasAttribute(Attribute::NoBuiltin))
|
|
|
|
return "nobuiltin";
|
2020-12-14 22:56:11 +01:00
|
|
|
if (hasAttribute(Attribute::NoCallback))
|
|
|
|
return "nocallback";
|
2012-12-19 08:18:57 +01:00
|
|
|
if (hasAttribute(Attribute::NoCapture))
|
2013-01-29 04:20:31 +01:00
|
|
|
return "nocapture";
|
2013-01-31 21:59:05 +01:00
|
|
|
if (hasAttribute(Attribute::NoDuplicate))
|
|
|
|
return "noduplicate";
|
2019-07-08 17:57:56 +02:00
|
|
|
if (hasAttribute(Attribute::NoFree))
|
|
|
|
return "nofree";
|
2013-01-31 21:59:05 +01:00
|
|
|
if (hasAttribute(Attribute::NoImplicitFloat))
|
|
|
|
return "noimplicitfloat";
|
|
|
|
if (hasAttribute(Attribute::NoInline))
|
|
|
|
return "noinline";
|
|
|
|
if (hasAttribute(Attribute::NonLazyBind))
|
|
|
|
return "nonlazybind";
|
2020-05-12 23:07:50 +02:00
|
|
|
if (hasAttribute(Attribute::NoMerge))
|
|
|
|
return "nomerge";
|
2014-05-20 03:23:40 +02:00
|
|
|
if (hasAttribute(Attribute::NonNull))
|
|
|
|
return "nonnull";
|
2013-01-31 21:59:05 +01:00
|
|
|
if (hasAttribute(Attribute::NoRedZone))
|
|
|
|
return "noredzone";
|
|
|
|
if (hasAttribute(Attribute::NoReturn))
|
|
|
|
return "noreturn";
|
[Attributor] Deduce "nosync" function attribute.
Introduce and deduce "nosync" function attribute to indicate that a function
does not synchronize with another thread in a way that other thread might free memory.
Reviewers: jdoerfert, jfb, nhaehnle, arsenm
Subscribers: wdng, hfinkel, nhaenhle, mehdi_amini, steven_wu,
dexonsmith, arsenm, uenoku, hiraditya, jfb, llvm-commits
Differential Revision: https://reviews.llvm.org/D62766
llvm-svn: 365830
2019-07-11 23:37:40 +02:00
|
|
|
if (hasAttribute(Attribute::NoSync))
|
|
|
|
return "nosync";
|
2020-04-25 12:57:07 +02:00
|
|
|
if (hasAttribute(Attribute::NullPointerIsValid))
|
|
|
|
return "null_pointer_is_valid";
|
2019-06-27 17:51:40 +02:00
|
|
|
if (hasAttribute(Attribute::WillReturn))
|
|
|
|
return "willreturn";
|
2018-03-17 14:29:46 +01:00
|
|
|
if (hasAttribute(Attribute::NoCfCheck))
|
|
|
|
return "nocf_check";
|
2015-11-06 11:32:53 +01:00
|
|
|
if (hasAttribute(Attribute::NoRecurse))
|
|
|
|
return "norecurse";
|
2021-01-15 10:14:37 +01:00
|
|
|
if (hasAttribute(Attribute::NoProfile))
|
|
|
|
return "noprofile";
|
2013-01-31 21:59:05 +01:00
|
|
|
if (hasAttribute(Attribute::NoUnwind))
|
|
|
|
return "nounwind";
|
[SimplifyCFG] Create attribute for fuzzing-specific optimizations.
Summary:
When building with libFuzzer, converting control flow to selects or
obscuring the original operands of CMPs reduces the effectiveness of
libFuzzer's heuristics.
This patch provides an attribute to disable or modify certain optimizations
for optimal fuzzing signal.
Provides a less aggressive alternative to https://reviews.llvm.org/D44057.
Reviewers: vitalybuka, davide, arsenm, hfinkel
Reviewed By: vitalybuka
Subscribers: junbuml, mehdi_amini, wdng, javed.absar, hiraditya, llvm-commits, kcc
Differential Revision: https://reviews.llvm.org/D44232
llvm-svn: 328214
2018-03-22 18:07:51 +01:00
|
|
|
if (hasAttribute(Attribute::OptForFuzzing))
|
|
|
|
return "optforfuzzing";
|
2013-08-23 13:53:55 +02:00
|
|
|
if (hasAttribute(Attribute::OptimizeNone))
|
|
|
|
return "optnone";
|
2013-01-31 21:59:05 +01:00
|
|
|
if (hasAttribute(Attribute::OptimizeForSize))
|
|
|
|
return "optsize";
|
2012-12-19 08:18:57 +01:00
|
|
|
if (hasAttribute(Attribute::ReadNone))
|
2013-01-29 04:20:31 +01:00
|
|
|
return "readnone";
|
2012-12-19 08:18:57 +01:00
|
|
|
if (hasAttribute(Attribute::ReadOnly))
|
2013-01-29 04:20:31 +01:00
|
|
|
return "readonly";
|
2016-07-04 10:01:29 +02:00
|
|
|
if (hasAttribute(Attribute::WriteOnly))
|
|
|
|
return "writeonly";
|
2013-04-20 07:14:40 +02:00
|
|
|
if (hasAttribute(Attribute::Returned))
|
|
|
|
return "returned";
|
2013-01-31 21:59:05 +01:00
|
|
|
if (hasAttribute(Attribute::ReturnsTwice))
|
|
|
|
return "returns_twice";
|
|
|
|
if (hasAttribute(Attribute::SExt))
|
|
|
|
return "signext";
|
2018-09-04 14:38:00 +02:00
|
|
|
if (hasAttribute(Attribute::SpeculativeLoadHardening))
|
|
|
|
return "speculative_load_hardening";
|
2017-04-28 22:25:27 +02:00
|
|
|
if (hasAttribute(Attribute::Speculatable))
|
|
|
|
return "speculatable";
|
2012-12-19 08:18:57 +01:00
|
|
|
if (hasAttribute(Attribute::StackProtect))
|
2013-01-29 04:20:31 +01:00
|
|
|
return "ssp";
|
2012-12-19 08:18:57 +01:00
|
|
|
if (hasAttribute(Attribute::StackProtectReq))
|
2013-01-29 04:20:31 +01:00
|
|
|
return "sspreq";
|
2013-01-23 07:41:41 +01:00
|
|
|
if (hasAttribute(Attribute::StackProtectStrong))
|
2013-01-29 04:20:31 +01:00
|
|
|
return "sspstrong";
|
Protection against stack-based memory corruption errors using SafeStack
This patch adds the safe stack instrumentation pass to LLVM, which separates
the program stack into a safe stack, which stores return addresses, register
spills, and local variables that are statically verified to be accessed
in a safe way, and the unsafe stack, which stores everything else. Such
separation makes it much harder for an attacker to corrupt objects on the
safe stack, including function pointers stored in spilled registers and
return addresses. You can find more information about the safe stack, as
well as other parts of or control-flow hijack protection technique in our
OSDI paper on code-pointer integrity (http://dslab.epfl.ch/pubs/cpi.pdf)
and our project website (http://levee.epfl.ch).
The overhead of our implementation of the safe stack is very close to zero
(0.01% on the Phoronix benchmarks). This is lower than the overhead of
stack cookies, which are supported by LLVM and are commonly used today,
yet the security guarantees of the safe stack are strictly stronger than
stack cookies. In some cases, the safe stack improves performance due to
better cache locality.
Our current implementation of the safe stack is stable and robust, we
used it to recompile multiple projects on Linux including Chromium, and
we also recompiled the entire FreeBSD user-space system and more than 100
packages. We ran unit tests on the FreeBSD system and many of the packages
and observed no errors caused by the safe stack. The safe stack is also fully
binary compatible with non-instrumented code and can be applied to parts of
a program selectively.
This patch is our implementation of the safe stack on top of LLVM. The
patches make the following changes:
- Add the safestack function attribute, similar to the ssp, sspstrong and
sspreq attributes.
- Add the SafeStack instrumentation pass that applies the safe stack to all
functions that have the safestack attribute. This pass moves all unsafe local
variables to the unsafe stack with a separate stack pointer, whereas all
safe variables remain on the regular stack that is managed by LLVM as usual.
- Invoke the pass as the last stage before code generation (at the same time
the existing cookie-based stack protector pass is invoked).
- Add unit tests for the safe stack.
Original patch by Volodymyr Kuznetsov and others at the Dependable Systems
Lab at EPFL; updates and upstreaming by myself.
Differential Revision: http://reviews.llvm.org/D6094
llvm-svn: 239761
2015-06-15 23:07:11 +02:00
|
|
|
if (hasAttribute(Attribute::SafeStack))
|
|
|
|
return "safestack";
|
2018-04-03 22:10:40 +02:00
|
|
|
if (hasAttribute(Attribute::ShadowCallStack))
|
|
|
|
return "shadowcallstack";
|
2017-08-14 23:15:13 +02:00
|
|
|
if (hasAttribute(Attribute::StrictFP))
|
|
|
|
return "strictfp";
|
2013-02-26 07:58:09 +01:00
|
|
|
if (hasAttribute(Attribute::SanitizeThread))
|
|
|
|
return "sanitize_thread";
|
|
|
|
if (hasAttribute(Attribute::SanitizeMemory))
|
|
|
|
return "sanitize_memory";
|
2013-01-31 21:59:05 +01:00
|
|
|
if (hasAttribute(Attribute::UWTable))
|
|
|
|
return "uwtable";
|
|
|
|
if (hasAttribute(Attribute::ZExt))
|
|
|
|
return "zeroext";
|
2013-05-24 14:26:52 +02:00
|
|
|
if (hasAttribute(Attribute::Cold))
|
|
|
|
return "cold";
|
2020-12-18 02:30:41 +01:00
|
|
|
if (hasAttribute(Attribute::Hot))
|
|
|
|
return "hot";
|
2019-03-12 22:02:54 +01:00
|
|
|
if (hasAttribute(Attribute::ImmArg))
|
|
|
|
return "immarg";
|
2020-07-08 19:22:48 +02:00
|
|
|
if (hasAttribute(Attribute::NoUndef))
|
|
|
|
return "noundef";
|
2020-10-20 08:48:18 +02:00
|
|
|
if (hasAttribute(Attribute::MustProgress))
|
|
|
|
return "mustprogress";
|
2013-01-31 21:59:05 +01:00
|
|
|
|
2020-09-29 15:33:55 +02:00
|
|
|
const bool IsByVal = hasAttribute(Attribute::ByVal);
|
|
|
|
if (IsByVal || hasAttribute(Attribute::StructRet)) {
|
2019-05-30 20:48:23 +02:00
|
|
|
std::string Result;
|
2020-09-29 15:33:55 +02:00
|
|
|
Result += IsByVal ? "byval" : "sret";
|
2019-05-30 20:48:23 +02:00
|
|
|
if (Type *Ty = getValueAsType()) {
|
|
|
|
raw_string_ostream OS(Result);
|
|
|
|
Result += '(';
|
|
|
|
Ty->print(OS, false, true);
|
|
|
|
OS.flush();
|
|
|
|
Result += ')';
|
|
|
|
}
|
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
IR: Define byref parameter attribute
This allows tracking the in-memory type of a pointer argument to a
function for ABI purposes. This is essentially a stripped down version
of byval to remove some of the stack-copy implications in its
definition.
This includes the base IR changes, and some tests for places where it
should be treated similarly to byval. Codegen support will be in a
future patch.
My original attempt at solving some of these problems was to repurpose
byval with a different address space from the stack. However, it is
technically permitted for the callee to introduce a write to the
argument, although nothing does this in reality. There is also talk of
removing and replacing the byval attribute, so a new attribute would
need to take its place anyway.
This is intended avoid some optimization issues with the current
handling of aggregate arguments, as well as fixes inflexibilty in how
frontends can specify the kernel ABI. The most honest representation
of the amdgpu_kernel convention is to expose all kernel arguments as
loads from constant memory. Today, these are raw, SSA Argument values
and codegen is responsible for turning these into loads.
Background:
There currently isn't a satisfactory way to represent how arguments
for the amdgpu_kernel calling convention are passed. In reality,
arguments are passed in a single, flat, constant memory buffer
implicitly passed to the function. It is also illegal to call this
function in the IR, and this is only ever invoked by a driver of some
kind.
It does not make sense to have a stack passed parameter in this
context as is implied by byval. It is never valid to write to the
kernel arguments, as this would corrupt the inputs seen by other
dispatches of the kernel. These argumets are also not in the same
address space as the stack, so a copy is needed to an alloca. From a
source C-like language, the kernel parameters are invisible.
Semantically, a copy is always required from the constant argument
memory to a mutable variable.
The current clang calling convention lowering emits raw values,
including aggregates into the function argument list, since using
byval would not make sense. This has some unfortunate consequences for
the optimizer. In the aggregate case, we end up with an aggregate
store to alloca, which both SROA and instcombine turn into a store of
each aggregate field. The optimizer never pieces this back together to
see that this is really just a copy from constant memory, so we end up
stuck with expensive stack usage.
This also means the backend dictates the alignment of arguments, and
arbitrarily picks the LLVM IR ABI type alignment. By allowing an
explicit alignment, frontends can make better decisions. For example,
there's real no advantage to an aligment higher than 4, so a frontend
could choose to compact the argument layout. Similarly, there is a
high penalty to using an alignment lower than 4, so a frontend could
opt into more padding for small arguments.
Another design consideration is when it is appropriate to expose the
fact that these arguments are all really passed in adjacent
memory. Currently we have a late IR optimization pass in codegen to
rewrite the kernel argument values into explicit loads to enable
vectorization. In most programs, unrelated argument loads can be
merged together. However, exposing this property directly from the
frontend has some disadvantages. We still need a way to track the
original argument sizes and alignments to report to the driver. I find
using some side-channel, metadata mechanism to track this
unappealing. If the kernel arguments were exposed as a single buffer
to begin with, alias analysis would be unaware that the padding bits
betewen arguments are meaningless. Another family of problems is there
are still some gaps in replacing all of the available parameter
attributes with metadata equivalents once lowered to loads.
The immediate plan is to start using this new attribute to handle all
aggregate argumets for kernels. Long term, it makes sense to migrate
all kernel arguments, including scalars, to be passed indirectly in
the same manner.
Additional context is in D79744.
2020-06-05 22:58:47 +02:00
|
|
|
const bool IsByRef = hasAttribute(Attribute::ByRef);
|
|
|
|
if (IsByRef || hasAttribute(Attribute::Preallocated)) {
|
|
|
|
std::string Result = IsByRef ? "byref" : "preallocated";
|
2020-02-14 23:16:53 +01:00
|
|
|
raw_string_ostream OS(Result);
|
|
|
|
Result += '(';
|
|
|
|
getValueAsType()->print(OS, false, true);
|
|
|
|
OS.flush();
|
|
|
|
Result += ')';
|
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
2013-01-31 21:59:05 +01:00
|
|
|
// FIXME: These should be output like this:
|
|
|
|
//
|
|
|
|
// align=4
|
|
|
|
// alignstack=8
|
|
|
|
//
|
2013-02-05 23:37:24 +01:00
|
|
|
if (hasAttribute(Attribute::Alignment)) {
|
2013-01-29 04:20:31 +01:00
|
|
|
std::string Result;
|
2013-02-11 09:43:33 +01:00
|
|
|
Result += "align";
|
|
|
|
Result += (InAttrGrp) ? "=" : " ";
|
2013-02-05 23:37:24 +01:00
|
|
|
Result += utostr(getValueAsInt());
|
2013-01-29 04:20:31 +01:00
|
|
|
return Result;
|
2010-02-12 01:31:15 +01:00
|
|
|
}
|
2013-02-11 09:43:33 +01:00
|
|
|
|
2015-04-16 22:29:50 +02:00
|
|
|
auto AttrWithBytesToString = [&](const char *Name) {
|
2013-01-29 04:20:31 +01:00
|
|
|
std::string Result;
|
2015-04-16 22:29:50 +02:00
|
|
|
Result += Name;
|
2013-02-11 09:43:33 +01:00
|
|
|
if (InAttrGrp) {
|
|
|
|
Result += "=";
|
|
|
|
Result += utostr(getValueAsInt());
|
|
|
|
} else {
|
|
|
|
Result += "(";
|
|
|
|
Result += utostr(getValueAsInt());
|
|
|
|
Result += ")";
|
|
|
|
}
|
2013-01-29 04:20:31 +01:00
|
|
|
return Result;
|
2015-04-16 22:29:50 +02:00
|
|
|
};
|
2013-01-31 21:59:05 +01:00
|
|
|
|
2015-04-16 22:29:50 +02:00
|
|
|
if (hasAttribute(Attribute::StackAlignment))
|
|
|
|
return AttrWithBytesToString("alignstack");
|
|
|
|
|
|
|
|
if (hasAttribute(Attribute::Dereferenceable))
|
|
|
|
return AttrWithBytesToString("dereferenceable");
|
|
|
|
|
|
|
|
if (hasAttribute(Attribute::DereferenceableOrNull))
|
|
|
|
return AttrWithBytesToString("dereferenceable_or_null");
|
2014-07-18 17:51:28 +02:00
|
|
|
|
2016-04-12 03:05:35 +02:00
|
|
|
if (hasAttribute(Attribute::AllocSize)) {
|
|
|
|
unsigned ElemSize;
|
|
|
|
Optional<unsigned> NumElems;
|
|
|
|
std::tie(ElemSize, NumElems) = getAllocSizeArgs();
|
|
|
|
|
|
|
|
std::string Result = "allocsize(";
|
|
|
|
Result += utostr(ElemSize);
|
|
|
|
if (NumElems.hasValue()) {
|
|
|
|
Result += ',';
|
|
|
|
Result += utostr(*NumElems);
|
|
|
|
}
|
|
|
|
Result += ')';
|
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
2013-01-31 21:59:05 +01:00
|
|
|
// Convert target-dependent attributes to strings of the form:
|
|
|
|
//
|
|
|
|
// "kind"
|
|
|
|
// "kind" = "value"
|
|
|
|
//
|
2013-02-05 23:37:24 +01:00
|
|
|
if (isStringAttribute()) {
|
2013-01-31 21:59:05 +01:00
|
|
|
std::string Result;
|
[IR] Properly handle escape characters in Attribute::getAsString()
If an attribute name has special characters such as '\01', it is not
properly printed in LLVM assembly language format. Since the format
expects the special characters are printed as it is, it has to contain
escape characters to make it printable.
Before:
attributes #0 = { ... "counting-function"="^A__gnu_mcount_nc" ...
After:
attributes #0 = { ... "counting-function"="\01__gnu_mcount_nc" ...
Reviewers: hfinkel, rengolin, rjmccall, compnerd
Subscribers: nemanjai, mcrosier, hans, shenhan, majnemer, llvm-commits
Differential Revision: https://reviews.llvm.org/D23792
llvm-svn: 280357
2016-09-01 13:44:06 +02:00
|
|
|
{
|
|
|
|
raw_string_ostream OS(Result);
|
2020-04-26 13:06:50 +02:00
|
|
|
OS << '"' << getKindAsString() << '"';
|
|
|
|
|
|
|
|
// Since some attribute strings contain special characters that cannot be
|
|
|
|
// printable, those have to be escaped to make the attribute value
|
|
|
|
// printable as is. e.g. "\01__gnu_mcount_nc"
|
|
|
|
const auto &AttrVal = pImpl->getValueAsString();
|
|
|
|
if (!AttrVal.empty()) {
|
|
|
|
OS << "=\"";
|
|
|
|
printEscapedString(AttrVal, OS);
|
|
|
|
OS << "\"";
|
|
|
|
}
|
[IR] Properly handle escape characters in Attribute::getAsString()
If an attribute name has special characters such as '\01', it is not
properly printed in LLVM assembly language format. Since the format
expects the special characters are printed as it is, it has to contain
escape characters to make it printable.
Before:
attributes #0 = { ... "counting-function"="^A__gnu_mcount_nc" ...
After:
attributes #0 = { ... "counting-function"="\01__gnu_mcount_nc" ...
Reviewers: hfinkel, rengolin, rjmccall, compnerd
Subscribers: nemanjai, mcrosier, hans, shenhan, majnemer, llvm-commits
Differential Revision: https://reviews.llvm.org/D23792
llvm-svn: 280357
2016-09-01 13:44:06 +02:00
|
|
|
}
|
2013-02-01 02:04:27 +01:00
|
|
|
return Result;
|
2013-01-31 21:59:05 +01:00
|
|
|
}
|
2013-01-29 04:20:31 +01:00
|
|
|
|
|
|
|
llvm_unreachable("Unknown attribute");
|
2008-01-03 00:42:30 +01:00
|
|
|
}
|
|
|
|
|
2013-01-29 01:34:06 +01:00
|
|
|
bool Attribute::operator<(Attribute A) const {
|
|
|
|
if (!pImpl && !A.pImpl) return false;
|
|
|
|
if (!pImpl) return true;
|
|
|
|
if (!A.pImpl) return false;
|
|
|
|
return *pImpl < *A.pImpl;
|
2012-10-09 01:27:46 +02:00
|
|
|
}
|
|
|
|
|
2020-01-18 01:04:02 +01:00
|
|
|
void Attribute::Profile(FoldingSetNodeID &ID) const {
|
|
|
|
ID.AddPointer(pImpl);
|
|
|
|
}
|
|
|
|
|
2012-09-26 23:07:29 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// AttributeImpl Definition
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2013-02-05 23:37:24 +01:00
|
|
|
bool AttributeImpl::hasAttribute(Attribute::AttrKind A) const {
|
|
|
|
if (isStringAttribute()) return false;
|
|
|
|
return getKindAsEnum() == A;
|
2012-12-30 02:38:39 +01:00
|
|
|
}
|
2013-01-24 01:06:56 +01:00
|
|
|
|
2013-02-05 23:37:24 +01:00
|
|
|
bool AttributeImpl::hasAttribute(StringRef Kind) const {
|
|
|
|
if (!isStringAttribute()) return false;
|
|
|
|
return getKindAsString() == Kind;
|
2013-01-04 21:54:35 +01:00
|
|
|
}
|
2012-12-30 02:38:39 +01:00
|
|
|
|
2013-02-05 23:37:24 +01:00
|
|
|
Attribute::AttrKind AttributeImpl::getKindAsEnum() const {
|
2019-05-30 20:48:23 +02:00
|
|
|
assert(isEnumAttribute() || isIntAttribute() || isTypeAttribute());
|
2013-07-11 14:13:16 +02:00
|
|
|
return static_cast<const EnumAttributeImpl *>(this)->getEnumKind();
|
2013-02-05 23:37:24 +01:00
|
|
|
}
|
2013-02-01 02:04:27 +01:00
|
|
|
|
2013-02-05 23:37:24 +01:00
|
|
|
uint64_t AttributeImpl::getValueAsInt() const {
|
2014-07-18 08:51:55 +02:00
|
|
|
assert(isIntAttribute());
|
|
|
|
return static_cast<const IntAttributeImpl *>(this)->getValue();
|
2013-02-05 23:37:24 +01:00
|
|
|
}
|
2013-01-24 01:06:56 +01:00
|
|
|
|
2013-02-05 23:37:24 +01:00
|
|
|
StringRef AttributeImpl::getKindAsString() const {
|
2013-07-11 14:13:16 +02:00
|
|
|
assert(isStringAttribute());
|
|
|
|
return static_cast<const StringAttributeImpl *>(this)->getStringKind();
|
2013-02-05 23:37:24 +01:00
|
|
|
}
|
2013-01-24 01:06:56 +01:00
|
|
|
|
2013-02-05 23:37:24 +01:00
|
|
|
StringRef AttributeImpl::getValueAsString() const {
|
2013-07-11 14:13:16 +02:00
|
|
|
assert(isStringAttribute());
|
|
|
|
return static_cast<const StringAttributeImpl *>(this)->getStringValue();
|
2013-02-05 23:37:24 +01:00
|
|
|
}
|
2013-01-24 01:06:56 +01:00
|
|
|
|
2019-05-30 20:48:23 +02:00
|
|
|
Type *AttributeImpl::getValueAsType() const {
|
|
|
|
assert(isTypeAttribute());
|
|
|
|
return static_cast<const TypeAttributeImpl *>(this)->getTypeValue();
|
|
|
|
}
|
|
|
|
|
2013-02-05 23:37:24 +01:00
|
|
|
bool AttributeImpl::operator<(const AttributeImpl &AI) const {
|
2020-06-23 13:43:02 +02:00
|
|
|
if (this == &AI)
|
|
|
|
return false;
|
2013-02-05 23:37:24 +01:00
|
|
|
// This sorts the attributes with Attribute::AttrKinds coming first (sorted
|
|
|
|
// relative to their enum value) and then strings.
|
2013-02-15 06:25:26 +01:00
|
|
|
if (isEnumAttribute()) {
|
|
|
|
if (AI.isEnumAttribute()) return getKindAsEnum() < AI.getKindAsEnum();
|
2014-07-18 08:51:55 +02:00
|
|
|
if (AI.isIntAttribute()) return true;
|
2013-02-15 06:25:26 +01:00
|
|
|
if (AI.isStringAttribute()) return true;
|
2019-05-30 20:48:23 +02:00
|
|
|
if (AI.isTypeAttribute()) return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (isTypeAttribute()) {
|
|
|
|
if (AI.isEnumAttribute()) return false;
|
|
|
|
if (AI.isTypeAttribute()) {
|
|
|
|
assert(getKindAsEnum() != AI.getKindAsEnum() &&
|
|
|
|
"Comparison of types would be unstable");
|
|
|
|
return getKindAsEnum() < AI.getKindAsEnum();
|
|
|
|
}
|
|
|
|
if (AI.isIntAttribute()) return true;
|
|
|
|
if (AI.isStringAttribute()) return true;
|
2013-02-15 05:15:55 +01:00
|
|
|
}
|
|
|
|
|
2014-07-18 08:51:55 +02:00
|
|
|
if (isIntAttribute()) {
|
2013-02-15 06:25:26 +01:00
|
|
|
if (AI.isEnumAttribute()) return false;
|
2019-05-30 20:48:23 +02:00
|
|
|
if (AI.isTypeAttribute()) return false;
|
2016-04-05 01:06:05 +02:00
|
|
|
if (AI.isIntAttribute()) {
|
|
|
|
if (getKindAsEnum() == AI.getKindAsEnum())
|
|
|
|
return getValueAsInt() < AI.getValueAsInt();
|
|
|
|
return getKindAsEnum() < AI.getKindAsEnum();
|
|
|
|
}
|
2013-02-15 06:25:26 +01:00
|
|
|
if (AI.isStringAttribute()) return true;
|
2013-02-05 23:37:24 +01:00
|
|
|
}
|
2013-01-24 01:06:56 +01:00
|
|
|
|
2019-05-30 20:48:23 +02:00
|
|
|
assert(isStringAttribute());
|
2013-02-15 06:25:26 +01:00
|
|
|
if (AI.isEnumAttribute()) return false;
|
2019-05-30 20:48:23 +02:00
|
|
|
if (AI.isTypeAttribute()) return false;
|
2014-07-18 08:51:55 +02:00
|
|
|
if (AI.isIntAttribute()) return false;
|
2013-02-15 06:25:26 +01:00
|
|
|
if (getKindAsString() == AI.getKindAsString())
|
|
|
|
return getValueAsString() < AI.getValueAsString();
|
|
|
|
return getKindAsString() < AI.getKindAsString();
|
2013-01-24 01:06:56 +01:00
|
|
|
}
|
|
|
|
|
2017-04-12 02:38:00 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// AttributeSet Definition
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
AttributeSet AttributeSet::get(LLVMContext &C, const AttrBuilder &B) {
|
|
|
|
return AttributeSet(AttributeSetNode::get(C, B));
|
|
|
|
}
|
|
|
|
|
|
|
|
AttributeSet AttributeSet::get(LLVMContext &C, ArrayRef<Attribute> Attrs) {
|
|
|
|
return AttributeSet(AttributeSetNode::get(C, Attrs));
|
|
|
|
}
|
|
|
|
|
2017-05-11 14:28:08 +02:00
|
|
|
AttributeSet AttributeSet::addAttribute(LLVMContext &C,
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
Attribute::AttrKind Kind) const {
|
2017-05-11 14:28:08 +02:00
|
|
|
if (hasAttribute(Kind)) return *this;
|
|
|
|
AttrBuilder B;
|
|
|
|
B.addAttribute(Kind);
|
|
|
|
return addAttributes(C, AttributeSet::get(C, B));
|
|
|
|
}
|
|
|
|
|
|
|
|
AttributeSet AttributeSet::addAttribute(LLVMContext &C, StringRef Kind,
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
StringRef Value) const {
|
2017-05-11 14:28:08 +02:00
|
|
|
AttrBuilder B;
|
|
|
|
B.addAttribute(Kind, Value);
|
|
|
|
return addAttributes(C, AttributeSet::get(C, B));
|
|
|
|
}
|
|
|
|
|
|
|
|
AttributeSet AttributeSet::addAttributes(LLVMContext &C,
|
|
|
|
const AttributeSet AS) const {
|
|
|
|
if (!hasAttributes())
|
|
|
|
return AS;
|
|
|
|
|
|
|
|
if (!AS.hasAttributes())
|
|
|
|
return *this;
|
|
|
|
|
|
|
|
AttrBuilder B(AS);
|
2019-12-17 21:57:58 +01:00
|
|
|
for (const auto &I : *this)
|
2017-05-11 14:28:08 +02:00
|
|
|
B.addAttribute(I);
|
|
|
|
|
|
|
|
return get(C, B);
|
|
|
|
}
|
|
|
|
|
|
|
|
AttributeSet AttributeSet::removeAttribute(LLVMContext &C,
|
|
|
|
Attribute::AttrKind Kind) const {
|
|
|
|
if (!hasAttribute(Kind)) return *this;
|
2018-01-17 20:15:21 +01:00
|
|
|
AttrBuilder B(*this);
|
|
|
|
B.removeAttribute(Kind);
|
|
|
|
return get(C, B);
|
2017-05-11 14:28:08 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
AttributeSet AttributeSet::removeAttribute(LLVMContext &C,
|
|
|
|
StringRef Kind) const {
|
|
|
|
if (!hasAttribute(Kind)) return *this;
|
2018-01-17 20:15:21 +01:00
|
|
|
AttrBuilder B(*this);
|
|
|
|
B.removeAttribute(Kind);
|
|
|
|
return get(C, B);
|
2017-05-11 14:28:08 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
AttributeSet AttributeSet::removeAttributes(LLVMContext &C,
|
|
|
|
const AttrBuilder &Attrs) const {
|
|
|
|
AttrBuilder B(*this);
|
|
|
|
B.remove(Attrs);
|
|
|
|
return get(C, B);
|
|
|
|
}
|
|
|
|
|
2017-04-12 02:38:00 +02:00
|
|
|
unsigned AttributeSet::getNumAttributes() const {
|
|
|
|
return SetNode ? SetNode->getNumAttributes() : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool AttributeSet::hasAttribute(Attribute::AttrKind Kind) const {
|
2017-05-15 23:57:41 +02:00
|
|
|
return SetNode ? SetNode->hasAttribute(Kind) : false;
|
2017-04-12 02:38:00 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
bool AttributeSet::hasAttribute(StringRef Kind) const {
|
2017-05-15 23:57:41 +02:00
|
|
|
return SetNode ? SetNode->hasAttribute(Kind) : false;
|
2017-04-12 02:38:00 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
Attribute AttributeSet::getAttribute(Attribute::AttrKind Kind) const {
|
|
|
|
return SetNode ? SetNode->getAttribute(Kind) : Attribute();
|
|
|
|
}
|
|
|
|
|
|
|
|
Attribute AttributeSet::getAttribute(StringRef Kind) const {
|
|
|
|
return SetNode ? SetNode->getAttribute(Kind) : Attribute();
|
|
|
|
}
|
|
|
|
|
2019-10-22 11:51:06 +02:00
|
|
|
MaybeAlign AttributeSet::getAlignment() const {
|
|
|
|
return SetNode ? SetNode->getAlignment() : None;
|
2017-04-12 02:38:00 +02:00
|
|
|
}
|
|
|
|
|
2019-10-22 11:51:06 +02:00
|
|
|
MaybeAlign AttributeSet::getStackAlignment() const {
|
|
|
|
return SetNode ? SetNode->getStackAlignment() : None;
|
2017-04-12 02:38:00 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t AttributeSet::getDereferenceableBytes() const {
|
|
|
|
return SetNode ? SetNode->getDereferenceableBytes() : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t AttributeSet::getDereferenceableOrNullBytes() const {
|
|
|
|
return SetNode ? SetNode->getDereferenceableOrNullBytes() : 0;
|
|
|
|
}
|
|
|
|
|
IR: Define byref parameter attribute
This allows tracking the in-memory type of a pointer argument to a
function for ABI purposes. This is essentially a stripped down version
of byval to remove some of the stack-copy implications in its
definition.
This includes the base IR changes, and some tests for places where it
should be treated similarly to byval. Codegen support will be in a
future patch.
My original attempt at solving some of these problems was to repurpose
byval with a different address space from the stack. However, it is
technically permitted for the callee to introduce a write to the
argument, although nothing does this in reality. There is also talk of
removing and replacing the byval attribute, so a new attribute would
need to take its place anyway.
This is intended avoid some optimization issues with the current
handling of aggregate arguments, as well as fixes inflexibilty in how
frontends can specify the kernel ABI. The most honest representation
of the amdgpu_kernel convention is to expose all kernel arguments as
loads from constant memory. Today, these are raw, SSA Argument values
and codegen is responsible for turning these into loads.
Background:
There currently isn't a satisfactory way to represent how arguments
for the amdgpu_kernel calling convention are passed. In reality,
arguments are passed in a single, flat, constant memory buffer
implicitly passed to the function. It is also illegal to call this
function in the IR, and this is only ever invoked by a driver of some
kind.
It does not make sense to have a stack passed parameter in this
context as is implied by byval. It is never valid to write to the
kernel arguments, as this would corrupt the inputs seen by other
dispatches of the kernel. These argumets are also not in the same
address space as the stack, so a copy is needed to an alloca. From a
source C-like language, the kernel parameters are invisible.
Semantically, a copy is always required from the constant argument
memory to a mutable variable.
The current clang calling convention lowering emits raw values,
including aggregates into the function argument list, since using
byval would not make sense. This has some unfortunate consequences for
the optimizer. In the aggregate case, we end up with an aggregate
store to alloca, which both SROA and instcombine turn into a store of
each aggregate field. The optimizer never pieces this back together to
see that this is really just a copy from constant memory, so we end up
stuck with expensive stack usage.
This also means the backend dictates the alignment of arguments, and
arbitrarily picks the LLVM IR ABI type alignment. By allowing an
explicit alignment, frontends can make better decisions. For example,
there's real no advantage to an aligment higher than 4, so a frontend
could choose to compact the argument layout. Similarly, there is a
high penalty to using an alignment lower than 4, so a frontend could
opt into more padding for small arguments.
Another design consideration is when it is appropriate to expose the
fact that these arguments are all really passed in adjacent
memory. Currently we have a late IR optimization pass in codegen to
rewrite the kernel argument values into explicit loads to enable
vectorization. In most programs, unrelated argument loads can be
merged together. However, exposing this property directly from the
frontend has some disadvantages. We still need a way to track the
original argument sizes and alignments to report to the driver. I find
using some side-channel, metadata mechanism to track this
unappealing. If the kernel arguments were exposed as a single buffer
to begin with, alias analysis would be unaware that the padding bits
betewen arguments are meaningless. Another family of problems is there
are still some gaps in replacing all of the available parameter
attributes with metadata equivalents once lowered to loads.
The immediate plan is to start using this new attribute to handle all
aggregate argumets for kernels. Long term, it makes sense to migrate
all kernel arguments, including scalars, to be passed indirectly in
the same manner.
Additional context is in D79744.
2020-06-05 22:58:47 +02:00
|
|
|
Type *AttributeSet::getByRefType() const {
|
|
|
|
return SetNode ? SetNode->getByRefType() : nullptr;
|
|
|
|
}
|
|
|
|
|
2019-05-30 20:48:23 +02:00
|
|
|
Type *AttributeSet::getByValType() const {
|
|
|
|
return SetNode ? SetNode->getByValType() : nullptr;
|
|
|
|
}
|
|
|
|
|
2020-09-29 15:33:55 +02:00
|
|
|
Type *AttributeSet::getStructRetType() const {
|
|
|
|
return SetNode ? SetNode->getStructRetType() : nullptr;
|
|
|
|
}
|
|
|
|
|
2020-02-14 23:16:53 +01:00
|
|
|
Type *AttributeSet::getPreallocatedType() const {
|
|
|
|
return SetNode ? SetNode->getPreallocatedType() : nullptr;
|
|
|
|
}
|
|
|
|
|
2017-04-12 02:38:00 +02:00
|
|
|
std::pair<unsigned, Optional<unsigned>> AttributeSet::getAllocSizeArgs() const {
|
2017-04-13 01:57:37 +02:00
|
|
|
return SetNode ? SetNode->getAllocSizeArgs()
|
|
|
|
: std::pair<unsigned, Optional<unsigned>>(0, 0);
|
2017-04-12 02:38:00 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
std::string AttributeSet::getAsString(bool InAttrGrp) const {
|
|
|
|
return SetNode ? SetNode->getAsString(InAttrGrp) : "";
|
|
|
|
}
|
|
|
|
|
|
|
|
AttributeSet::iterator AttributeSet::begin() const {
|
|
|
|
return SetNode ? SetNode->begin() : nullptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
AttributeSet::iterator AttributeSet::end() const {
|
|
|
|
return SetNode ? SetNode->end() : nullptr;
|
|
|
|
}
|
|
|
|
|
2017-10-15 16:32:27 +02:00
|
|
|
#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
|
2017-05-11 14:28:08 +02:00
|
|
|
LLVM_DUMP_METHOD void AttributeSet::dump() const {
|
|
|
|
dbgs() << "AS =\n";
|
|
|
|
dbgs() << " { ";
|
|
|
|
dbgs() << getAsString(true) << " }\n";
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2013-01-24 01:06:56 +01:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// AttributeSetNode Definition
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2017-04-11 01:46:08 +02:00
|
|
|
AttributeSetNode::AttributeSetNode(ArrayRef<Attribute> Attrs)
|
2019-07-13 02:29:03 +02:00
|
|
|
: NumAttrs(Attrs.size()) {
|
2017-04-11 01:46:08 +02:00
|
|
|
// There's memory after the node where we can store the entries in.
|
2018-11-17 02:44:25 +01:00
|
|
|
llvm::copy(Attrs, getTrailingObjects<Attribute>());
|
2017-04-11 01:46:08 +02:00
|
|
|
|
2019-12-17 21:57:58 +01:00
|
|
|
for (const auto &I : *this) {
|
2020-06-14 23:46:18 +02:00
|
|
|
if (I.isStringAttribute())
|
2020-04-25 12:21:21 +02:00
|
|
|
StringAttrs.insert({ I.getKindAsString(), I });
|
2020-06-14 23:46:18 +02:00
|
|
|
else
|
|
|
|
AvailableAttrs.addAttribute(I.getKindAsEnum());
|
2017-04-11 01:46:08 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-01-24 01:06:56 +01:00
|
|
|
AttributeSetNode *AttributeSetNode::get(LLVMContext &C,
|
|
|
|
ArrayRef<Attribute> Attrs) {
|
2020-04-26 16:52:53 +02:00
|
|
|
SmallVector<Attribute, 8> SortedAttrs(Attrs.begin(), Attrs.end());
|
|
|
|
llvm::sort(SortedAttrs);
|
|
|
|
return getSorted(C, SortedAttrs);
|
|
|
|
}
|
|
|
|
|
|
|
|
AttributeSetNode *AttributeSetNode::getSorted(LLVMContext &C,
|
|
|
|
ArrayRef<Attribute> SortedAttrs) {
|
|
|
|
if (SortedAttrs.empty())
|
2014-04-09 08:08:46 +02:00
|
|
|
return nullptr;
|
2013-01-24 01:06:56 +01:00
|
|
|
|
2020-04-26 16:52:53 +02:00
|
|
|
// Build a key to look up the existing attributes.
|
2013-01-24 01:06:56 +01:00
|
|
|
LLVMContextImpl *pImpl = C.pImpl;
|
|
|
|
FoldingSetNodeID ID;
|
|
|
|
|
2020-04-26 16:52:53 +02:00
|
|
|
assert(llvm::is_sorted(SortedAttrs) && "Expected sorted attributes!");
|
2019-12-17 21:57:58 +01:00
|
|
|
for (const auto &Attr : SortedAttrs)
|
2015-12-16 06:21:02 +01:00
|
|
|
Attr.Profile(ID);
|
2013-01-24 01:06:56 +01:00
|
|
|
|
|
|
|
void *InsertPoint;
|
|
|
|
AttributeSetNode *PA =
|
|
|
|
pImpl->AttrsSetNodes.FindNodeOrInsertPos(ID, InsertPoint);
|
|
|
|
|
|
|
|
// If we didn't find any existing attributes of the same shape then create a
|
|
|
|
// new one and insert it.
|
|
|
|
if (!PA) {
|
2013-07-11 14:13:16 +02:00
|
|
|
// Coallocate entries after the AttributeSetNode itself.
|
2015-08-06 00:57:34 +02:00
|
|
|
void *Mem = ::operator new(totalSizeToAlloc<Attribute>(SortedAttrs.size()));
|
2013-07-11 14:13:16 +02:00
|
|
|
PA = new (Mem) AttributeSetNode(SortedAttrs);
|
2013-01-24 01:06:56 +01:00
|
|
|
pImpl->AttrsSetNodes.InsertNode(PA, InsertPoint);
|
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
// Return the AttributeSetNode that we found or created.
|
2013-01-24 01:06:56 +01:00
|
|
|
return PA;
|
|
|
|
}
|
|
|
|
|
2017-04-11 01:31:05 +02:00
|
|
|
AttributeSetNode *AttributeSetNode::get(LLVMContext &C, const AttrBuilder &B) {
|
|
|
|
// Add target-independent attributes.
|
|
|
|
SmallVector<Attribute, 8> Attrs;
|
|
|
|
for (Attribute::AttrKind Kind = Attribute::None;
|
|
|
|
Kind != Attribute::EndAttrKinds; Kind = Attribute::AttrKind(Kind + 1)) {
|
|
|
|
if (!B.contains(Kind))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
Attribute Attr;
|
|
|
|
switch (Kind) {
|
2019-05-30 20:48:23 +02:00
|
|
|
case Attribute::ByVal:
|
|
|
|
Attr = Attribute::getWithByValType(C, B.getByValType());
|
|
|
|
break;
|
2020-09-29 15:33:55 +02:00
|
|
|
case Attribute::StructRet:
|
|
|
|
Attr = Attribute::getWithStructRetType(C, B.getStructRetType());
|
|
|
|
break;
|
IR: Define byref parameter attribute
This allows tracking the in-memory type of a pointer argument to a
function for ABI purposes. This is essentially a stripped down version
of byval to remove some of the stack-copy implications in its
definition.
This includes the base IR changes, and some tests for places where it
should be treated similarly to byval. Codegen support will be in a
future patch.
My original attempt at solving some of these problems was to repurpose
byval with a different address space from the stack. However, it is
technically permitted for the callee to introduce a write to the
argument, although nothing does this in reality. There is also talk of
removing and replacing the byval attribute, so a new attribute would
need to take its place anyway.
This is intended avoid some optimization issues with the current
handling of aggregate arguments, as well as fixes inflexibilty in how
frontends can specify the kernel ABI. The most honest representation
of the amdgpu_kernel convention is to expose all kernel arguments as
loads from constant memory. Today, these are raw, SSA Argument values
and codegen is responsible for turning these into loads.
Background:
There currently isn't a satisfactory way to represent how arguments
for the amdgpu_kernel calling convention are passed. In reality,
arguments are passed in a single, flat, constant memory buffer
implicitly passed to the function. It is also illegal to call this
function in the IR, and this is only ever invoked by a driver of some
kind.
It does not make sense to have a stack passed parameter in this
context as is implied by byval. It is never valid to write to the
kernel arguments, as this would corrupt the inputs seen by other
dispatches of the kernel. These argumets are also not in the same
address space as the stack, so a copy is needed to an alloca. From a
source C-like language, the kernel parameters are invisible.
Semantically, a copy is always required from the constant argument
memory to a mutable variable.
The current clang calling convention lowering emits raw values,
including aggregates into the function argument list, since using
byval would not make sense. This has some unfortunate consequences for
the optimizer. In the aggregate case, we end up with an aggregate
store to alloca, which both SROA and instcombine turn into a store of
each aggregate field. The optimizer never pieces this back together to
see that this is really just a copy from constant memory, so we end up
stuck with expensive stack usage.
This also means the backend dictates the alignment of arguments, and
arbitrarily picks the LLVM IR ABI type alignment. By allowing an
explicit alignment, frontends can make better decisions. For example,
there's real no advantage to an aligment higher than 4, so a frontend
could choose to compact the argument layout. Similarly, there is a
high penalty to using an alignment lower than 4, so a frontend could
opt into more padding for small arguments.
Another design consideration is when it is appropriate to expose the
fact that these arguments are all really passed in adjacent
memory. Currently we have a late IR optimization pass in codegen to
rewrite the kernel argument values into explicit loads to enable
vectorization. In most programs, unrelated argument loads can be
merged together. However, exposing this property directly from the
frontend has some disadvantages. We still need a way to track the
original argument sizes and alignments to report to the driver. I find
using some side-channel, metadata mechanism to track this
unappealing. If the kernel arguments were exposed as a single buffer
to begin with, alias analysis would be unaware that the padding bits
betewen arguments are meaningless. Another family of problems is there
are still some gaps in replacing all of the available parameter
attributes with metadata equivalents once lowered to loads.
The immediate plan is to start using this new attribute to handle all
aggregate argumets for kernels. Long term, it makes sense to migrate
all kernel arguments, including scalars, to be passed indirectly in
the same manner.
Additional context is in D79744.
2020-06-05 22:58:47 +02:00
|
|
|
case Attribute::ByRef:
|
|
|
|
Attr = Attribute::getWithByRefType(C, B.getByRefType());
|
|
|
|
break;
|
2020-02-14 23:16:53 +01:00
|
|
|
case Attribute::Preallocated:
|
|
|
|
Attr = Attribute::getWithPreallocatedType(C, B.getPreallocatedType());
|
|
|
|
break;
|
2017-04-11 01:31:05 +02:00
|
|
|
case Attribute::Alignment:
|
2019-10-22 13:57:52 +02:00
|
|
|
assert(B.getAlignment() && "Alignment must be set");
|
|
|
|
Attr = Attribute::getWithAlignment(C, *B.getAlignment());
|
2017-04-11 01:31:05 +02:00
|
|
|
break;
|
|
|
|
case Attribute::StackAlignment:
|
2019-10-22 13:57:52 +02:00
|
|
|
assert(B.getStackAlignment() && "StackAlignment must be set");
|
|
|
|
Attr = Attribute::getWithStackAlignment(C, *B.getStackAlignment());
|
2017-04-11 01:31:05 +02:00
|
|
|
break;
|
|
|
|
case Attribute::Dereferenceable:
|
|
|
|
Attr = Attribute::getWithDereferenceableBytes(
|
|
|
|
C, B.getDereferenceableBytes());
|
|
|
|
break;
|
|
|
|
case Attribute::DereferenceableOrNull:
|
|
|
|
Attr = Attribute::getWithDereferenceableOrNullBytes(
|
|
|
|
C, B.getDereferenceableOrNullBytes());
|
|
|
|
break;
|
|
|
|
case Attribute::AllocSize: {
|
|
|
|
auto A = B.getAllocSizeArgs();
|
|
|
|
Attr = Attribute::getWithAllocSizeArgs(C, A.first, A.second);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
Attr = Attribute::get(C, Kind);
|
|
|
|
}
|
|
|
|
Attrs.push_back(Attr);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Add target-dependent (string) attributes.
|
|
|
|
for (const auto &TDA : B.td_attrs())
|
|
|
|
Attrs.emplace_back(Attribute::get(C, TDA.first, TDA.second));
|
|
|
|
|
2020-04-26 16:52:53 +02:00
|
|
|
return getSorted(C, Attrs);
|
2017-04-11 01:31:05 +02:00
|
|
|
}
|
|
|
|
|
2013-02-13 09:42:21 +01:00
|
|
|
bool AttributeSetNode::hasAttribute(StringRef Kind) const {
|
2020-04-25 12:21:21 +02:00
|
|
|
return StringAttrs.count(Kind);
|
2013-02-13 09:42:21 +01:00
|
|
|
}
|
|
|
|
|
2020-04-26 20:03:29 +02:00
|
|
|
Optional<Attribute>
|
|
|
|
AttributeSetNode::findEnumAttribute(Attribute::AttrKind Kind) const {
|
|
|
|
// Do a quick presence check.
|
|
|
|
if (!hasAttribute(Kind))
|
|
|
|
return None;
|
|
|
|
|
|
|
|
// Attributes in a set are sorted by enum value, followed by string
|
|
|
|
// attributes. Binary search the one we want.
|
|
|
|
const Attribute *I =
|
|
|
|
std::lower_bound(begin(), end() - StringAttrs.size(), Kind,
|
|
|
|
[](Attribute A, Attribute::AttrKind Kind) {
|
|
|
|
return A.getKindAsEnum() < Kind;
|
|
|
|
});
|
|
|
|
assert(I != end() && I->hasAttribute(Kind) && "Presence check failed?");
|
|
|
|
return *I;
|
|
|
|
}
|
|
|
|
|
2013-02-13 09:42:21 +01:00
|
|
|
Attribute AttributeSetNode::getAttribute(Attribute::AttrKind Kind) const {
|
2020-04-26 20:03:29 +02:00
|
|
|
if (auto A = findEnumAttribute(Kind))
|
|
|
|
return *A;
|
2018-03-30 02:47:31 +02:00
|
|
|
return {};
|
2013-02-13 09:42:21 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
Attribute AttributeSetNode::getAttribute(StringRef Kind) const {
|
2020-04-25 12:21:21 +02:00
|
|
|
return StringAttrs.lookup(Kind);
|
2013-02-13 09:42:21 +01:00
|
|
|
}
|
|
|
|
|
2019-10-22 11:51:06 +02:00
|
|
|
MaybeAlign AttributeSetNode::getAlignment() const {
|
2020-04-26 20:03:29 +02:00
|
|
|
if (auto A = findEnumAttribute(Attribute::Alignment))
|
|
|
|
return A->getAlignment();
|
2019-10-22 11:51:06 +02:00
|
|
|
return None;
|
2013-01-29 04:20:31 +01:00
|
|
|
}
|
|
|
|
|
2019-10-22 11:51:06 +02:00
|
|
|
MaybeAlign AttributeSetNode::getStackAlignment() const {
|
2020-04-26 20:03:29 +02:00
|
|
|
if (auto A = findEnumAttribute(Attribute::StackAlignment))
|
|
|
|
return A->getStackAlignment();
|
2019-10-22 11:51:06 +02:00
|
|
|
return None;
|
2013-01-29 04:20:31 +01:00
|
|
|
}
|
|
|
|
|
2019-05-30 20:48:23 +02:00
|
|
|
Type *AttributeSetNode::getByValType() const {
|
2020-04-26 20:03:29 +02:00
|
|
|
if (auto A = findEnumAttribute(Attribute::ByVal))
|
|
|
|
return A->getValueAsType();
|
2020-07-10 03:02:25 +02:00
|
|
|
return nullptr;
|
2019-05-30 20:48:23 +02:00
|
|
|
}
|
|
|
|
|
2020-09-29 15:33:55 +02:00
|
|
|
Type *AttributeSetNode::getStructRetType() const {
|
|
|
|
if (auto A = findEnumAttribute(Attribute::StructRet))
|
|
|
|
return A->getValueAsType();
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
IR: Define byref parameter attribute
This allows tracking the in-memory type of a pointer argument to a
function for ABI purposes. This is essentially a stripped down version
of byval to remove some of the stack-copy implications in its
definition.
This includes the base IR changes, and some tests for places where it
should be treated similarly to byval. Codegen support will be in a
future patch.
My original attempt at solving some of these problems was to repurpose
byval with a different address space from the stack. However, it is
technically permitted for the callee to introduce a write to the
argument, although nothing does this in reality. There is also talk of
removing and replacing the byval attribute, so a new attribute would
need to take its place anyway.
This is intended avoid some optimization issues with the current
handling of aggregate arguments, as well as fixes inflexibilty in how
frontends can specify the kernel ABI. The most honest representation
of the amdgpu_kernel convention is to expose all kernel arguments as
loads from constant memory. Today, these are raw, SSA Argument values
and codegen is responsible for turning these into loads.
Background:
There currently isn't a satisfactory way to represent how arguments
for the amdgpu_kernel calling convention are passed. In reality,
arguments are passed in a single, flat, constant memory buffer
implicitly passed to the function. It is also illegal to call this
function in the IR, and this is only ever invoked by a driver of some
kind.
It does not make sense to have a stack passed parameter in this
context as is implied by byval. It is never valid to write to the
kernel arguments, as this would corrupt the inputs seen by other
dispatches of the kernel. These argumets are also not in the same
address space as the stack, so a copy is needed to an alloca. From a
source C-like language, the kernel parameters are invisible.
Semantically, a copy is always required from the constant argument
memory to a mutable variable.
The current clang calling convention lowering emits raw values,
including aggregates into the function argument list, since using
byval would not make sense. This has some unfortunate consequences for
the optimizer. In the aggregate case, we end up with an aggregate
store to alloca, which both SROA and instcombine turn into a store of
each aggregate field. The optimizer never pieces this back together to
see that this is really just a copy from constant memory, so we end up
stuck with expensive stack usage.
This also means the backend dictates the alignment of arguments, and
arbitrarily picks the LLVM IR ABI type alignment. By allowing an
explicit alignment, frontends can make better decisions. For example,
there's real no advantage to an aligment higher than 4, so a frontend
could choose to compact the argument layout. Similarly, there is a
high penalty to using an alignment lower than 4, so a frontend could
opt into more padding for small arguments.
Another design consideration is when it is appropriate to expose the
fact that these arguments are all really passed in adjacent
memory. Currently we have a late IR optimization pass in codegen to
rewrite the kernel argument values into explicit loads to enable
vectorization. In most programs, unrelated argument loads can be
merged together. However, exposing this property directly from the
frontend has some disadvantages. We still need a way to track the
original argument sizes and alignments to report to the driver. I find
using some side-channel, metadata mechanism to track this
unappealing. If the kernel arguments were exposed as a single buffer
to begin with, alias analysis would be unaware that the padding bits
betewen arguments are meaningless. Another family of problems is there
are still some gaps in replacing all of the available parameter
attributes with metadata equivalents once lowered to loads.
The immediate plan is to start using this new attribute to handle all
aggregate argumets for kernels. Long term, it makes sense to migrate
all kernel arguments, including scalars, to be passed indirectly in
the same manner.
Additional context is in D79744.
2020-06-05 22:58:47 +02:00
|
|
|
Type *AttributeSetNode::getByRefType() const {
|
|
|
|
if (auto A = findEnumAttribute(Attribute::ByRef))
|
|
|
|
return A->getValueAsType();
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
2020-02-14 23:16:53 +01:00
|
|
|
Type *AttributeSetNode::getPreallocatedType() const {
|
2020-07-10 03:02:25 +02:00
|
|
|
if (auto A = findEnumAttribute(Attribute::Preallocated))
|
|
|
|
return A->getValueAsType();
|
|
|
|
return nullptr;
|
2020-02-14 23:16:53 +01:00
|
|
|
}
|
|
|
|
|
2014-07-18 17:51:28 +02:00
|
|
|
uint64_t AttributeSetNode::getDereferenceableBytes() const {
|
2020-04-26 20:03:29 +02:00
|
|
|
if (auto A = findEnumAttribute(Attribute::Dereferenceable))
|
|
|
|
return A->getDereferenceableBytes();
|
2014-07-18 17:51:28 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2015-05-06 19:41:54 +02:00
|
|
|
uint64_t AttributeSetNode::getDereferenceableOrNullBytes() const {
|
2020-04-26 20:03:29 +02:00
|
|
|
if (auto A = findEnumAttribute(Attribute::DereferenceableOrNull))
|
|
|
|
return A->getDereferenceableOrNullBytes();
|
2015-05-06 19:41:54 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2016-04-12 03:05:35 +02:00
|
|
|
std::pair<unsigned, Optional<unsigned>>
|
|
|
|
AttributeSetNode::getAllocSizeArgs() const {
|
2020-04-26 20:03:29 +02:00
|
|
|
if (auto A = findEnumAttribute(Attribute::AllocSize))
|
|
|
|
return A->getAllocSizeArgs();
|
2016-04-12 03:05:35 +02:00
|
|
|
return std::make_pair(0, 0);
|
|
|
|
}
|
|
|
|
|
2013-05-01 15:07:03 +02:00
|
|
|
std::string AttributeSetNode::getAsString(bool InAttrGrp) const {
|
2013-04-19 13:43:21 +02:00
|
|
|
std::string Str;
|
2013-07-11 14:13:16 +02:00
|
|
|
for (iterator I = begin(), E = end(); I != E; ++I) {
|
|
|
|
if (I != begin())
|
2013-05-01 15:07:03 +02:00
|
|
|
Str += ' ';
|
|
|
|
Str += I->getAsString(InAttrGrp);
|
2013-01-29 04:20:31 +01:00
|
|
|
}
|
|
|
|
return Str;
|
|
|
|
}
|
|
|
|
|
2008-03-12 18:45:29 +01:00
|
|
|
//===----------------------------------------------------------------------===//
|
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-21 17:57:19 +01:00
|
|
|
// AttributeListImpl Definition
|
2008-03-12 18:45:29 +01:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2017-10-11 03:40:38 +02:00
|
|
|
/// Map from AttributeList index to the internal array index. Adding one happens
|
2020-06-23 22:25:04 +02:00
|
|
|
/// to work, because -1 wraps around to 0.
|
2020-07-17 18:25:56 +02:00
|
|
|
static unsigned attrIdxToArrayIdx(unsigned Index) {
|
2020-06-23 22:25:04 +02:00
|
|
|
return Index + 1;
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
}
|
|
|
|
|
2020-05-01 14:18:29 +02:00
|
|
|
AttributeListImpl::AttributeListImpl(ArrayRef<AttributeSet> Sets)
|
|
|
|
: NumAttrSets(Sets.size()) {
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
assert(!Sets.empty() && "pointless AttributeListImpl");
|
2017-04-11 02:16:00 +02:00
|
|
|
|
|
|
|
// There's memory after the node where we can store the entries in.
|
2018-11-17 02:44:25 +01:00
|
|
|
llvm::copy(Sets, getTrailingObjects<AttributeSet>());
|
2017-04-11 02:16:00 +02:00
|
|
|
|
2020-06-14 22:49:57 +02:00
|
|
|
// Initialize AvailableFunctionAttrs and AvailableSomewhereAttrs
|
|
|
|
// summary bitsets.
|
2020-07-17 18:25:56 +02:00
|
|
|
for (const auto &I : Sets[attrIdxToArrayIdx(AttributeList::FunctionIndex)])
|
2020-06-14 23:46:18 +02:00
|
|
|
if (!I.isStringAttribute())
|
|
|
|
AvailableFunctionAttrs.addAttribute(I.getKindAsEnum());
|
2020-06-14 22:49:57 +02:00
|
|
|
|
|
|
|
for (const auto &Set : Sets)
|
|
|
|
for (const auto &I : Set)
|
|
|
|
if (!I.isStringAttribute())
|
|
|
|
AvailableSomewhereAttrs.addAttribute(I.getKindAsEnum());
|
2017-04-11 02:16:00 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
void AttributeListImpl::Profile(FoldingSetNodeID &ID) const {
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
Profile(ID, makeArrayRef(begin(), end()));
|
2017-04-11 02:16:00 +02:00
|
|
|
}
|
|
|
|
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
void AttributeListImpl::Profile(FoldingSetNodeID &ID,
|
|
|
|
ArrayRef<AttributeSet> Sets) {
|
|
|
|
for (const auto &Set : Sets)
|
|
|
|
ID.AddPointer(Set.SetNode);
|
2017-04-11 02:16:00 +02:00
|
|
|
}
|
|
|
|
|
2020-06-14 22:49:57 +02:00
|
|
|
bool AttributeListImpl::hasAttrSomewhere(Attribute::AttrKind Kind,
|
|
|
|
unsigned *Index) const {
|
|
|
|
if (!AvailableSomewhereAttrs.hasAttribute(Kind))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (Index) {
|
|
|
|
for (unsigned I = 0, E = NumAttrSets; I != E; ++I) {
|
|
|
|
if (begin()[I].hasAttribute(Kind)) {
|
|
|
|
*Index = I - 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2017-10-15 16:32:27 +02:00
|
|
|
#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
|
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-21 17:57:19 +01:00
|
|
|
LLVM_DUMP_METHOD void AttributeListImpl::dump() const {
|
|
|
|
AttributeList(const_cast<AttributeListImpl *>(this)).dump();
|
2013-08-03 00:34:30 +02:00
|
|
|
}
|
2017-01-28 03:02:38 +01:00
|
|
|
#endif
|
2013-08-03 00:34:30 +02:00
|
|
|
|
2013-01-27 13:50:02 +01:00
|
|
|
//===----------------------------------------------------------------------===//
|
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-21 17:57:19 +01:00
|
|
|
// AttributeList Construction and Mutation Methods
|
2013-01-27 13:50:02 +01:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
AttributeList AttributeList::getImpl(LLVMContext &C,
|
|
|
|
ArrayRef<AttributeSet> AttrSets) {
|
|
|
|
assert(!AttrSets.empty() && "pointless AttributeListImpl");
|
2017-04-11 01:31:05 +02:00
|
|
|
|
2013-01-29 01:34:06 +01:00
|
|
|
LLVMContextImpl *pImpl = C.pImpl;
|
|
|
|
FoldingSetNodeID ID;
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
AttributeListImpl::Profile(ID, AttrSets);
|
2012-10-16 08:01:44 +02:00
|
|
|
|
2012-11-20 06:09:20 +01:00
|
|
|
void *InsertPoint;
|
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-21 17:57:19 +01:00
|
|
|
AttributeListImpl *PA =
|
|
|
|
pImpl->AttrsLists.FindNodeOrInsertPos(ID, InsertPoint);
|
2012-10-16 08:01:44 +02:00
|
|
|
|
2008-01-03 00:42:30 +01:00
|
|
|
// If we didn't find any existing attributes of the same shape then
|
|
|
|
// create a new one and insert it.
|
2012-11-20 06:09:20 +01:00
|
|
|
if (!PA) {
|
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-21 17:57:19 +01:00
|
|
|
// Coallocate entries after the AttributeListImpl itself.
|
2020-05-01 14:12:17 +02:00
|
|
|
void *Mem = pImpl->Alloc.Allocate(
|
|
|
|
AttributeListImpl::totalSizeToAlloc<AttributeSet>(AttrSets.size()),
|
|
|
|
alignof(AttributeListImpl));
|
2020-05-01 14:18:29 +02:00
|
|
|
PA = new (Mem) AttributeListImpl(AttrSets);
|
2012-11-20 06:09:20 +01:00
|
|
|
pImpl->AttrsLists.InsertNode(PA, InsertPoint);
|
2008-01-03 00:42:30 +01:00
|
|
|
}
|
2012-10-16 08:01:44 +02:00
|
|
|
|
2008-09-25 23:00:45 +02:00
|
|
|
// Return the AttributesList that we found or created.
|
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-21 17:57:19 +01:00
|
|
|
return AttributeList(PA);
|
2008-01-03 00:42:30 +01:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
AttributeList
|
|
|
|
AttributeList::get(LLVMContext &C,
|
|
|
|
ArrayRef<std::pair<unsigned, Attribute>> Attrs) {
|
2013-01-28 22:55:20 +01:00
|
|
|
// If there are no attributes then return a null AttributesList pointer.
|
|
|
|
if (Attrs.empty())
|
2018-03-30 02:47:31 +02:00
|
|
|
return {};
|
2013-01-28 22:55:20 +01:00
|
|
|
|
2020-04-13 13:46:41 +02:00
|
|
|
assert(llvm::is_sorted(Attrs,
|
|
|
|
[](const std::pair<unsigned, Attribute> &LHS,
|
|
|
|
const std::pair<unsigned, Attribute> &RHS) {
|
|
|
|
return LHS.first < RHS.first;
|
|
|
|
}) &&
|
|
|
|
"Misordered Attributes list!");
|
2020-08-28 22:02:42 +02:00
|
|
|
assert(llvm::all_of(Attrs,
|
|
|
|
[](const std::pair<unsigned, Attribute> &Pair) {
|
|
|
|
return Pair.second.isValid();
|
|
|
|
}) &&
|
2016-08-11 23:15:00 +02:00
|
|
|
"Pointless attribute!");
|
2013-01-28 22:55:20 +01:00
|
|
|
|
2013-01-28 23:33:39 +01:00
|
|
|
// Create a vector if (unsigned, AttributeSetNode*) pairs from the attributes
|
2013-01-28 22:55:20 +01:00
|
|
|
// list.
|
2017-04-12 02:38:00 +02:00
|
|
|
SmallVector<std::pair<unsigned, AttributeSet>, 8> AttrPairVec;
|
2017-02-17 01:00:09 +01:00
|
|
|
for (ArrayRef<std::pair<unsigned, Attribute>>::iterator I = Attrs.begin(),
|
2013-01-28 22:55:20 +01:00
|
|
|
E = Attrs.end(); I != E; ) {
|
2013-01-28 23:33:39 +01:00
|
|
|
unsigned Index = I->first;
|
2013-01-28 22:55:20 +01:00
|
|
|
SmallVector<Attribute, 4> AttrVec;
|
2013-01-29 16:18:16 +01:00
|
|
|
while (I != E && I->first == Index) {
|
2013-01-28 22:55:20 +01:00
|
|
|
AttrVec.push_back(I->second);
|
|
|
|
++I;
|
|
|
|
}
|
|
|
|
|
2017-04-12 02:38:00 +02:00
|
|
|
AttrPairVec.emplace_back(Index, AttributeSet::get(C, AttrVec));
|
2013-01-28 22:55:20 +01:00
|
|
|
}
|
|
|
|
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
return get(C, AttrPairVec);
|
2013-01-28 22:55:20 +01:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
AttributeList
|
|
|
|
AttributeList::get(LLVMContext &C,
|
2017-04-12 02:38:00 +02:00
|
|
|
ArrayRef<std::pair<unsigned, AttributeSet>> Attrs) {
|
2013-01-28 22:55:20 +01:00
|
|
|
// If there are no attributes then return a null AttributesList pointer.
|
|
|
|
if (Attrs.empty())
|
2018-03-30 02:47:31 +02:00
|
|
|
return {};
|
2013-01-28 22:55:20 +01:00
|
|
|
|
2020-04-13 13:46:41 +02:00
|
|
|
assert(llvm::is_sorted(Attrs,
|
|
|
|
[](const std::pair<unsigned, AttributeSet> &LHS,
|
|
|
|
const std::pair<unsigned, AttributeSet> &RHS) {
|
|
|
|
return LHS.first < RHS.first;
|
|
|
|
}) &&
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
"Misordered Attributes list!");
|
2018-03-30 02:47:31 +02:00
|
|
|
assert(llvm::none_of(Attrs,
|
|
|
|
[](const std::pair<unsigned, AttributeSet> &Pair) {
|
|
|
|
return !Pair.second.hasAttributes();
|
|
|
|
}) &&
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
"Pointless attribute!");
|
|
|
|
|
|
|
|
unsigned MaxIndex = Attrs.back().first;
|
2018-04-16 19:05:01 +02:00
|
|
|
// If the MaxIndex is FunctionIndex and there are other indices in front
|
|
|
|
// of it, we need to use the largest of those to get the right size.
|
|
|
|
if (MaxIndex == FunctionIndex && Attrs.size() > 1)
|
|
|
|
MaxIndex = Attrs[Attrs.size() - 2].first;
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
|
|
|
|
SmallVector<AttributeSet, 4> AttrVec(attrIdxToArrayIdx(MaxIndex) + 1);
|
2019-12-17 21:57:58 +01:00
|
|
|
for (const auto &Pair : Attrs)
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
AttrVec[attrIdxToArrayIdx(Pair.first)] = Pair.second;
|
|
|
|
|
|
|
|
return getImpl(C, AttrVec);
|
2013-01-28 22:55:20 +01:00
|
|
|
}
|
|
|
|
|
2017-04-13 02:58:09 +02:00
|
|
|
AttributeList AttributeList::get(LLVMContext &C, AttributeSet FnAttrs,
|
|
|
|
AttributeSet RetAttrs,
|
|
|
|
ArrayRef<AttributeSet> ArgAttrs) {
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
// Scan from the end to find the last argument with attributes. Most
|
|
|
|
// arguments don't have attributes, so it's nice if we can have fewer unique
|
|
|
|
// AttributeListImpls by dropping empty attribute sets at the end of the list.
|
|
|
|
unsigned NumSets = 0;
|
|
|
|
for (size_t I = ArgAttrs.size(); I != 0; --I) {
|
|
|
|
if (ArgAttrs[I - 1].hasAttributes()) {
|
|
|
|
NumSets = I + 2;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (NumSets == 0) {
|
|
|
|
// Check function and return attributes if we didn't have argument
|
|
|
|
// attributes.
|
|
|
|
if (RetAttrs.hasAttributes())
|
|
|
|
NumSets = 2;
|
|
|
|
else if (FnAttrs.hasAttributes())
|
|
|
|
NumSets = 1;
|
2017-04-11 01:31:05 +02:00
|
|
|
}
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
|
|
|
|
// If all attribute sets were empty, we can use the empty attribute list.
|
|
|
|
if (NumSets == 0)
|
2018-03-30 02:47:31 +02:00
|
|
|
return {};
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
|
|
|
|
SmallVector<AttributeSet, 8> AttrSets;
|
|
|
|
AttrSets.reserve(NumSets);
|
|
|
|
// If we have any attributes, we always have function attributes.
|
|
|
|
AttrSets.push_back(FnAttrs);
|
|
|
|
if (NumSets > 1)
|
|
|
|
AttrSets.push_back(RetAttrs);
|
|
|
|
if (NumSets > 2) {
|
|
|
|
// Drop the empty argument attribute sets at the end.
|
|
|
|
ArgAttrs = ArgAttrs.take_front(NumSets - 2);
|
2021-01-07 03:27:33 +01:00
|
|
|
llvm::append_range(AttrSets, ArgAttrs);
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
return getImpl(C, AttrSets);
|
2017-04-11 01:31:05 +02:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
AttributeList AttributeList::get(LLVMContext &C, unsigned Index,
|
|
|
|
const AttrBuilder &B) {
|
2013-01-21 23:44:49 +01:00
|
|
|
if (!B.hasAttributes())
|
2018-03-30 02:47:31 +02:00
|
|
|
return {};
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
Index = attrIdxToArrayIdx(Index);
|
|
|
|
SmallVector<AttributeSet, 8> AttrSets(Index + 1);
|
|
|
|
AttrSets[Index] = AttributeSet::get(C, B);
|
|
|
|
return getImpl(C, AttrSets);
|
2013-01-05 02:36:54 +01:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
AttributeList AttributeList::get(LLVMContext &C, unsigned Index,
|
|
|
|
ArrayRef<Attribute::AttrKind> Kinds) {
|
2013-01-28 23:33:39 +01:00
|
|
|
SmallVector<std::pair<unsigned, Attribute>, 8> Attrs;
|
2018-03-30 02:47:31 +02:00
|
|
|
for (const auto K : Kinds)
|
2016-08-11 23:15:00 +02:00
|
|
|
Attrs.emplace_back(Index, Attribute::get(C, K));
|
2013-01-28 22:55:20 +01:00
|
|
|
return get(C, Attrs);
|
2013-01-23 07:14:59 +01:00
|
|
|
}
|
|
|
|
|
2020-05-27 22:02:15 +02:00
|
|
|
AttributeList AttributeList::get(LLVMContext &C, unsigned Index,
|
|
|
|
ArrayRef<Attribute::AttrKind> Kinds,
|
|
|
|
ArrayRef<uint64_t> Values) {
|
|
|
|
assert(Kinds.size() == Values.size() && "Mismatched attribute values.");
|
|
|
|
SmallVector<std::pair<unsigned, Attribute>, 8> Attrs;
|
|
|
|
auto VI = Values.begin();
|
|
|
|
for (const auto K : Kinds)
|
|
|
|
Attrs.emplace_back(Index, Attribute::get(C, K, *VI++));
|
|
|
|
return get(C, 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-21 17:57:19 +01:00
|
|
|
AttributeList AttributeList::get(LLVMContext &C, unsigned Index,
|
|
|
|
ArrayRef<StringRef> Kinds) {
|
2016-06-15 19:50:39 +02:00
|
|
|
SmallVector<std::pair<unsigned, Attribute>, 8> Attrs;
|
2019-12-17 21:57:58 +01:00
|
|
|
for (const auto &K : Kinds)
|
2016-08-11 23:15:00 +02:00
|
|
|
Attrs.emplace_back(Index, Attribute::get(C, K));
|
2016-06-15 19:50:39 +02:00
|
|
|
return get(C, 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-21 17:57:19 +01:00
|
|
|
AttributeList AttributeList::get(LLVMContext &C,
|
|
|
|
ArrayRef<AttributeList> Attrs) {
|
|
|
|
if (Attrs.empty())
|
2018-03-30 02:47:31 +02:00
|
|
|
return {};
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
if (Attrs.size() == 1)
|
|
|
|
return Attrs[0];
|
|
|
|
|
|
|
|
unsigned MaxSize = 0;
|
2019-12-17 21:57:58 +01:00
|
|
|
for (const auto &List : Attrs)
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
MaxSize = std::max(MaxSize, List.getNumAttrSets());
|
|
|
|
|
2017-05-31 16:24:06 +02:00
|
|
|
// If every list was empty, there is no point in merging the lists.
|
|
|
|
if (MaxSize == 0)
|
2018-03-30 02:47:31 +02:00
|
|
|
return {};
|
2017-05-31 16:24:06 +02:00
|
|
|
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
SmallVector<AttributeSet, 8> NewAttrSets(MaxSize);
|
|
|
|
for (unsigned I = 0; I < MaxSize; ++I) {
|
|
|
|
AttrBuilder CurBuilder;
|
2019-12-17 21:57:58 +01:00
|
|
|
for (const auto &List : Attrs)
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
CurBuilder.merge(List.getAttributes(I - 1));
|
|
|
|
NewAttrSets[I] = AttributeSet::get(C, CurBuilder);
|
2013-01-26 00:09:36 +01:00
|
|
|
}
|
|
|
|
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
return getImpl(C, NewAttrSets);
|
2008-01-03 00:42:30 +01:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
AttributeList AttributeList::addAttribute(LLVMContext &C, unsigned Index,
|
|
|
|
Attribute::AttrKind Kind) const {
|
2016-06-14 22:27:35 +02:00
|
|
|
if (hasAttribute(Index, Kind)) return *this;
|
2021-01-22 10:38:36 +01:00
|
|
|
AttributeSet Attrs = getAttributes(Index);
|
|
|
|
// TODO: Insert at correct position and avoid sort.
|
|
|
|
SmallVector<Attribute, 8> NewAttrs(Attrs.begin(), Attrs.end());
|
|
|
|
NewAttrs.push_back(Attribute::get(C, Kind));
|
|
|
|
return setAttributes(C, Index, AttributeSet::get(C, NewAttrs));
|
2013-03-13 21:20:08 +01:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
AttributeList AttributeList::addAttribute(LLVMContext &C, unsigned Index,
|
|
|
|
StringRef Kind,
|
|
|
|
StringRef Value) const {
|
2017-02-17 01:00:09 +01:00
|
|
|
AttrBuilder B;
|
2013-07-25 20:34:24 +02:00
|
|
|
B.addAttribute(Kind, Value);
|
2017-05-03 00:07:37 +02:00
|
|
|
return addAttributes(C, Index, B);
|
2013-07-25 20:34:24 +02:00
|
|
|
}
|
|
|
|
|
2017-05-31 21:23:09 +02:00
|
|
|
AttributeList AttributeList::addAttribute(LLVMContext &C, unsigned Index,
|
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-21 17:57:19 +01:00
|
|
|
Attribute A) const {
|
2017-05-31 21:23:09 +02:00
|
|
|
AttrBuilder B;
|
|
|
|
B.addAttribute(A);
|
|
|
|
return addAttributes(C, Index, B);
|
2015-12-02 07:58:49 +01:00
|
|
|
}
|
|
|
|
|
2021-01-22 10:38:36 +01:00
|
|
|
AttributeList AttributeList::setAttributes(LLVMContext &C, unsigned Index,
|
|
|
|
AttributeSet Attrs) const {
|
|
|
|
Index = attrIdxToArrayIdx(Index);
|
|
|
|
SmallVector<AttributeSet, 4> AttrSets(this->begin(), this->end());
|
|
|
|
if (Index >= AttrSets.size())
|
|
|
|
AttrSets.resize(Index + 1);
|
|
|
|
AttrSets[Index] = Attrs;
|
|
|
|
return AttributeList::getImpl(C, AttrSets);
|
|
|
|
}
|
|
|
|
|
2017-04-11 01:31:05 +02:00
|
|
|
AttributeList AttributeList::addAttributes(LLVMContext &C, unsigned Index,
|
2017-04-19 03:51:13 +02:00
|
|
|
const AttrBuilder &B) const {
|
|
|
|
if (!B.hasAttributes())
|
2017-04-11 01:31:05 +02:00
|
|
|
return *this;
|
|
|
|
|
2017-04-19 00:10:18 +02:00
|
|
|
if (!pImpl)
|
2017-04-19 03:51:13 +02:00
|
|
|
return AttributeList::get(C, {{Index, AttributeSet::get(C, B)}});
|
2017-04-19 00:10:18 +02:00
|
|
|
|
2008-02-20 00:51:49 +01:00
|
|
|
#ifndef NDEBUG
|
2013-01-28 06:23:28 +01:00
|
|
|
// FIXME it is not obvious how this should work for alignment. For now, say
|
|
|
|
// we can't change a known alignment.
|
2019-10-22 11:51:06 +02:00
|
|
|
const MaybeAlign OldAlign = getAttributes(Index).getAlignment();
|
2019-10-22 13:57:52 +02:00
|
|
|
const MaybeAlign NewAlign = B.getAlignment();
|
2008-02-20 13:07:57 +01:00
|
|
|
assert((!OldAlign || !NewAlign || OldAlign == NewAlign) &&
|
2008-02-20 00:51:49 +01:00
|
|
|
"Attempt to change alignment!");
|
|
|
|
#endif
|
2012-10-16 08:01:44 +02:00
|
|
|
|
2021-01-22 10:38:36 +01:00
|
|
|
AttrBuilder Merged(getAttributes(Index));
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
Merged.merge(B);
|
2021-01-22 10:38:36 +01:00
|
|
|
return setAttributes(C, Index, AttributeSet::get(C, Merged));
|
2017-04-11 01:31:05 +02:00
|
|
|
}
|
|
|
|
|
2017-05-31 21:23:09 +02:00
|
|
|
AttributeList AttributeList::addParamAttribute(LLVMContext &C,
|
|
|
|
ArrayRef<unsigned> ArgNos,
|
|
|
|
Attribute A) const {
|
2020-04-13 13:46:41 +02:00
|
|
|
assert(llvm::is_sorted(ArgNos));
|
2017-05-31 21:23:09 +02:00
|
|
|
|
|
|
|
SmallVector<AttributeSet, 4> AttrSets(this->begin(), this->end());
|
|
|
|
unsigned MaxIndex = attrIdxToArrayIdx(ArgNos.back() + FirstArgIndex);
|
|
|
|
if (MaxIndex >= AttrSets.size())
|
|
|
|
AttrSets.resize(MaxIndex + 1);
|
|
|
|
|
|
|
|
for (unsigned ArgNo : ArgNos) {
|
|
|
|
unsigned Index = attrIdxToArrayIdx(ArgNo + FirstArgIndex);
|
|
|
|
AttrBuilder B(AttrSets[Index]);
|
|
|
|
B.addAttribute(A);
|
|
|
|
AttrSets[Index] = AttributeSet::get(C, B);
|
|
|
|
}
|
|
|
|
|
|
|
|
return getImpl(C, AttrSets);
|
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
AttributeList AttributeList::removeAttribute(LLVMContext &C, unsigned Index,
|
|
|
|
Attribute::AttrKind Kind) const {
|
2016-06-14 22:27:35 +02:00
|
|
|
if (!hasAttribute(Index, Kind)) return *this;
|
2018-01-17 20:15:21 +01:00
|
|
|
|
|
|
|
Index = attrIdxToArrayIdx(Index);
|
|
|
|
SmallVector<AttributeSet, 4> AttrSets(this->begin(), this->end());
|
|
|
|
assert(Index < AttrSets.size());
|
|
|
|
|
|
|
|
AttrSets[Index] = AttrSets[Index].removeAttribute(C, Kind);
|
|
|
|
|
|
|
|
return getImpl(C, AttrSets);
|
2013-01-23 01:45:55 +01:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
AttributeList AttributeList::removeAttribute(LLVMContext &C, unsigned Index,
|
|
|
|
StringRef Kind) const {
|
2016-06-15 19:50:39 +02:00
|
|
|
if (!hasAttribute(Index, Kind)) return *this;
|
2018-01-17 20:15:21 +01:00
|
|
|
|
|
|
|
Index = attrIdxToArrayIdx(Index);
|
|
|
|
SmallVector<AttributeSet, 4> AttrSets(this->begin(), this->end());
|
|
|
|
assert(Index < AttrSets.size());
|
|
|
|
|
|
|
|
AttrSets[Index] = AttrSets[Index].removeAttribute(C, Kind);
|
|
|
|
|
|
|
|
return getImpl(C, AttrSets);
|
2008-01-03 00:42:30 +01:00
|
|
|
}
|
|
|
|
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
AttributeList
|
|
|
|
AttributeList::removeAttributes(LLVMContext &C, unsigned Index,
|
|
|
|
const AttrBuilder &AttrsToRemove) const {
|
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-21 17:57:19 +01:00
|
|
|
if (!pImpl)
|
2018-03-30 02:47:31 +02:00
|
|
|
return {};
|
2015-05-07 01:19:43 +02:00
|
|
|
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
Index = attrIdxToArrayIdx(Index);
|
|
|
|
SmallVector<AttributeSet, 4> AttrSets(this->begin(), this->end());
|
|
|
|
if (Index >= AttrSets.size())
|
|
|
|
AttrSets.resize(Index + 1);
|
2015-05-07 01:19:43 +02:00
|
|
|
|
2018-01-17 20:15:21 +01:00
|
|
|
AttrSets[Index] = AttrSets[Index].removeAttributes(C, AttrsToRemove);
|
2015-05-07 01:19:43 +02:00
|
|
|
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
return getImpl(C, AttrSets);
|
2015-05-07 01:19:43 +02:00
|
|
|
}
|
|
|
|
|
2017-04-11 01:31:05 +02:00
|
|
|
AttributeList AttributeList::removeAttributes(LLVMContext &C,
|
|
|
|
unsigned WithoutIndex) const {
|
|
|
|
if (!pImpl)
|
2018-03-30 02:47:31 +02:00
|
|
|
return {};
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
WithoutIndex = attrIdxToArrayIdx(WithoutIndex);
|
|
|
|
if (WithoutIndex >= getNumAttrSets())
|
|
|
|
return *this;
|
|
|
|
SmallVector<AttributeSet, 4> AttrSets(this->begin(), this->end());
|
|
|
|
AttrSets[WithoutIndex] = AttributeSet();
|
|
|
|
return getImpl(C, AttrSets);
|
2017-04-11 01:31:05 +02:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
AttributeList AttributeList::addDereferenceableAttr(LLVMContext &C,
|
|
|
|
unsigned Index,
|
|
|
|
uint64_t Bytes) const {
|
2017-02-17 01:00:09 +01:00
|
|
|
AttrBuilder B;
|
2015-02-14 20:37:54 +01:00
|
|
|
B.addDereferenceableAttr(Bytes);
|
2017-05-03 00:07:37 +02:00
|
|
|
return addAttributes(C, Index, B);
|
2015-02-14 20:37:54 +01:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
AttributeList
|
|
|
|
AttributeList::addDereferenceableOrNullAttr(LLVMContext &C, unsigned Index,
|
|
|
|
uint64_t Bytes) const {
|
2017-02-17 01:00:09 +01:00
|
|
|
AttrBuilder B;
|
2015-04-16 22:29:50 +02:00
|
|
|
B.addDereferenceableOrNullAttr(Bytes);
|
2017-05-03 00:07:37 +02:00
|
|
|
return addAttributes(C, Index, B);
|
2015-04-16 22:29:50 +02:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
AttributeList
|
|
|
|
AttributeList::addAllocSizeAttr(LLVMContext &C, unsigned Index,
|
|
|
|
unsigned ElemSizeArg,
|
|
|
|
const Optional<unsigned> &NumElemsArg) {
|
2017-02-17 01:00:09 +01:00
|
|
|
AttrBuilder B;
|
2016-04-12 03:05:35 +02:00
|
|
|
B.addAllocSizeAttr(ElemSizeArg, NumElemsArg);
|
2017-05-03 00:07:37 +02:00
|
|
|
return addAttributes(C, Index, B);
|
2016-04-12 03:05:35 +02:00
|
|
|
}
|
|
|
|
|
2013-01-29 01:34:06 +01:00
|
|
|
//===----------------------------------------------------------------------===//
|
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-21 17:57:19 +01:00
|
|
|
// AttributeList Accessor Methods
|
2013-01-29 01:34:06 +01:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2017-04-14 01:12:13 +02:00
|
|
|
AttributeSet AttributeList::getParamAttributes(unsigned ArgNo) const {
|
2017-05-03 20:17:31 +02:00
|
|
|
return getAttributes(ArgNo + FirstArgIndex);
|
2013-01-29 01:34:06 +01:00
|
|
|
}
|
|
|
|
|
2017-04-12 02:38:00 +02:00
|
|
|
AttributeSet AttributeList::getRetAttributes() const {
|
2017-04-11 01:31:05 +02:00
|
|
|
return getAttributes(ReturnIndex);
|
2013-01-29 01:34:06 +01:00
|
|
|
}
|
|
|
|
|
2017-04-12 02:38:00 +02:00
|
|
|
AttributeSet AttributeList::getFnAttributes() const {
|
2017-04-11 01:31:05 +02:00
|
|
|
return getAttributes(FunctionIndex);
|
2013-01-29 01:34:06 +01:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
bool AttributeList::hasAttribute(unsigned Index,
|
|
|
|
Attribute::AttrKind Kind) const {
|
2017-04-12 02:38:00 +02:00
|
|
|
return getAttributes(Index).hasAttribute(Kind);
|
2013-01-29 01:34:06 +01:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
bool AttributeList::hasAttribute(unsigned Index, StringRef Kind) const {
|
2017-04-12 02:38:00 +02:00
|
|
|
return getAttributes(Index).hasAttribute(Kind);
|
2013-02-13 09:42:21 +01:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
bool AttributeList::hasAttributes(unsigned Index) const {
|
2017-04-12 02:38:00 +02:00
|
|
|
return getAttributes(Index).hasAttributes();
|
2013-01-29 01:34:06 +01:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
bool AttributeList::hasFnAttribute(Attribute::AttrKind Kind) const {
|
2016-01-29 23:25:19 +01:00
|
|
|
return pImpl && pImpl->hasFnAttribute(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-21 17:57:19 +01:00
|
|
|
bool AttributeList::hasFnAttribute(StringRef Kind) const {
|
|
|
|
return hasAttribute(AttributeList::FunctionIndex, Kind);
|
2016-09-09 06:50:38 +02:00
|
|
|
}
|
|
|
|
|
2017-04-14 01:12:13 +02:00
|
|
|
bool AttributeList::hasParamAttribute(unsigned ArgNo,
|
|
|
|
Attribute::AttrKind Kind) const {
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
return hasAttribute(ArgNo + FirstArgIndex, Kind);
|
2017-04-14 01:12:13 +02:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
bool AttributeList::hasAttrSomewhere(Attribute::AttrKind Attr,
|
|
|
|
unsigned *Index) const {
|
2020-06-14 22:49:57 +02:00
|
|
|
return pImpl && pImpl->hasAttrSomewhere(Attr, Index);
|
2013-01-29 01:34:06 +01:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
Attribute AttributeList::getAttribute(unsigned Index,
|
|
|
|
Attribute::AttrKind Kind) const {
|
2017-04-12 02:38:00 +02:00
|
|
|
return getAttributes(Index).getAttribute(Kind);
|
2013-02-13 09:42:21 +01:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
Attribute AttributeList::getAttribute(unsigned Index, StringRef Kind) const {
|
2017-04-12 02:38:00 +02:00
|
|
|
return getAttributes(Index).getAttribute(Kind);
|
2013-02-13 09:42:21 +01:00
|
|
|
}
|
|
|
|
|
2019-10-22 11:51:06 +02:00
|
|
|
MaybeAlign AttributeList::getRetAlignment() const {
|
2017-04-28 22:34:27 +02:00
|
|
|
return getAttributes(ReturnIndex).getAlignment();
|
|
|
|
}
|
|
|
|
|
2019-10-22 11:51:06 +02:00
|
|
|
MaybeAlign AttributeList::getParamAlignment(unsigned ArgNo) const {
|
2017-05-03 20:17:31 +02:00
|
|
|
return getAttributes(ArgNo + FirstArgIndex).getAlignment();
|
2013-01-29 01:34:06 +01:00
|
|
|
}
|
|
|
|
|
2019-05-30 20:48:23 +02:00
|
|
|
Type *AttributeList::getParamByValType(unsigned Index) const {
|
|
|
|
return getAttributes(Index+FirstArgIndex).getByValType();
|
|
|
|
}
|
|
|
|
|
2020-09-29 15:33:55 +02:00
|
|
|
Type *AttributeList::getParamStructRetType(unsigned Index) const {
|
|
|
|
return getAttributes(Index + FirstArgIndex).getStructRetType();
|
|
|
|
}
|
|
|
|
|
IR: Define byref parameter attribute
This allows tracking the in-memory type of a pointer argument to a
function for ABI purposes. This is essentially a stripped down version
of byval to remove some of the stack-copy implications in its
definition.
This includes the base IR changes, and some tests for places where it
should be treated similarly to byval. Codegen support will be in a
future patch.
My original attempt at solving some of these problems was to repurpose
byval with a different address space from the stack. However, it is
technically permitted for the callee to introduce a write to the
argument, although nothing does this in reality. There is also talk of
removing and replacing the byval attribute, so a new attribute would
need to take its place anyway.
This is intended avoid some optimization issues with the current
handling of aggregate arguments, as well as fixes inflexibilty in how
frontends can specify the kernel ABI. The most honest representation
of the amdgpu_kernel convention is to expose all kernel arguments as
loads from constant memory. Today, these are raw, SSA Argument values
and codegen is responsible for turning these into loads.
Background:
There currently isn't a satisfactory way to represent how arguments
for the amdgpu_kernel calling convention are passed. In reality,
arguments are passed in a single, flat, constant memory buffer
implicitly passed to the function. It is also illegal to call this
function in the IR, and this is only ever invoked by a driver of some
kind.
It does not make sense to have a stack passed parameter in this
context as is implied by byval. It is never valid to write to the
kernel arguments, as this would corrupt the inputs seen by other
dispatches of the kernel. These argumets are also not in the same
address space as the stack, so a copy is needed to an alloca. From a
source C-like language, the kernel parameters are invisible.
Semantically, a copy is always required from the constant argument
memory to a mutable variable.
The current clang calling convention lowering emits raw values,
including aggregates into the function argument list, since using
byval would not make sense. This has some unfortunate consequences for
the optimizer. In the aggregate case, we end up with an aggregate
store to alloca, which both SROA and instcombine turn into a store of
each aggregate field. The optimizer never pieces this back together to
see that this is really just a copy from constant memory, so we end up
stuck with expensive stack usage.
This also means the backend dictates the alignment of arguments, and
arbitrarily picks the LLVM IR ABI type alignment. By allowing an
explicit alignment, frontends can make better decisions. For example,
there's real no advantage to an aligment higher than 4, so a frontend
could choose to compact the argument layout. Similarly, there is a
high penalty to using an alignment lower than 4, so a frontend could
opt into more padding for small arguments.
Another design consideration is when it is appropriate to expose the
fact that these arguments are all really passed in adjacent
memory. Currently we have a late IR optimization pass in codegen to
rewrite the kernel argument values into explicit loads to enable
vectorization. In most programs, unrelated argument loads can be
merged together. However, exposing this property directly from the
frontend has some disadvantages. We still need a way to track the
original argument sizes and alignments to report to the driver. I find
using some side-channel, metadata mechanism to track this
unappealing. If the kernel arguments were exposed as a single buffer
to begin with, alias analysis would be unaware that the padding bits
betewen arguments are meaningless. Another family of problems is there
are still some gaps in replacing all of the available parameter
attributes with metadata equivalents once lowered to loads.
The immediate plan is to start using this new attribute to handle all
aggregate argumets for kernels. Long term, it makes sense to migrate
all kernel arguments, including scalars, to be passed indirectly in
the same manner.
Additional context is in D79744.
2020-06-05 22:58:47 +02:00
|
|
|
Type *AttributeList::getParamByRefType(unsigned Index) const {
|
|
|
|
return getAttributes(Index + FirstArgIndex).getByRefType();
|
|
|
|
}
|
|
|
|
|
Reland [X86] Codegen for preallocated
See https://reviews.llvm.org/D74651 for the preallocated IR constructs
and LangRef changes.
In X86TargetLowering::LowerCall(), if a call is preallocated, record
each argument's offset from the stack pointer and the total stack
adjustment. Associate the call Value with an integer index. Store the
info in X86MachineFunctionInfo with the integer index as the key.
This adds two new target independent ISDOpcodes and two new target
dependent Opcodes corresponding to @llvm.call.preallocated.{setup,arg}.
The setup ISelDAG node takes in a chain and outputs a chain and a
SrcValue of the preallocated call Value. It is lowered to a target
dependent node with the SrcValue replaced with the integer index key by
looking in X86MachineFunctionInfo. In
X86TargetLowering::EmitInstrWithCustomInserter() this is lowered to an
%esp adjustment, the exact amount determined by looking in
X86MachineFunctionInfo with the integer index key.
The arg ISelDAG node takes in a chain, a SrcValue of the preallocated
call Value, and the arg index int constant. It produces a chain and the
pointer fo the arg. It is lowered to a target dependent node with the
SrcValue replaced with the integer index key by looking in
X86MachineFunctionInfo. In
X86TargetLowering::EmitInstrWithCustomInserter() this is lowered to a
lea of the stack pointer plus an offset determined by looking in
X86MachineFunctionInfo with the integer index key.
Force any function containing a preallocated call to use the frame
pointer.
Does not yet handle a setup without a call, or a conditional call.
Does not yet handle musttail. That requires a LangRef change first.
Tried to look at all references to inalloca and see if they apply to
preallocated. I've made preallocated versions of tests testing inalloca
whenever possible and when they make sense (e.g. not alloca related,
inalloca edge cases).
Aside from the tests added here, I checked that this codegen produces
correct code for something like
```
struct A {
A();
A(A&&);
~A();
};
void bar() {
foo(foo(foo(foo(foo(A(), 4), 5), 6), 7), 8);
}
```
by replacing the inalloca version of the .ll file with the appropriate
preallocated code. Running the executable produces the same results as
using the current inalloca implementation.
Reverted due to unexpectedly passing tests, added REQUIRES: asserts for reland.
Subscribers: hiraditya, llvm-commits
Tags: #llvm
Differential Revision: https://reviews.llvm.org/D77689
2020-03-16 20:32:36 +01:00
|
|
|
Type *AttributeList::getParamPreallocatedType(unsigned Index) const {
|
|
|
|
return getAttributes(Index + FirstArgIndex).getPreallocatedType();
|
|
|
|
}
|
|
|
|
|
2019-10-22 11:51:06 +02:00
|
|
|
MaybeAlign AttributeList::getStackAlignment(unsigned Index) const {
|
2017-04-12 02:38:00 +02:00
|
|
|
return getAttributes(Index).getStackAlignment();
|
2013-01-29 01:34:06 +01:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
uint64_t AttributeList::getDereferenceableBytes(unsigned Index) const {
|
2017-04-12 02:38:00 +02:00
|
|
|
return getAttributes(Index).getDereferenceableBytes();
|
2014-07-18 17:51:28 +02:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
uint64_t AttributeList::getDereferenceableOrNullBytes(unsigned Index) const {
|
2017-04-12 02:38:00 +02:00
|
|
|
return getAttributes(Index).getDereferenceableOrNullBytes();
|
2015-05-06 19:41:54 +02:00
|
|
|
}
|
|
|
|
|
2016-04-12 03:05:35 +02:00
|
|
|
std::pair<unsigned, Optional<unsigned>>
|
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-21 17:57:19 +01:00
|
|
|
AttributeList::getAllocSizeArgs(unsigned Index) const {
|
2017-04-12 02:38:00 +02:00
|
|
|
return getAttributes(Index).getAllocSizeArgs();
|
2016-04-12 03:05:35 +02:00
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
std::string AttributeList::getAsString(unsigned Index, bool InAttrGrp) const {
|
2017-04-12 02:38:00 +02:00
|
|
|
return getAttributes(Index).getAsString(InAttrGrp);
|
2013-01-29 01:34:06 +01:00
|
|
|
}
|
|
|
|
|
2017-04-12 02:38:00 +02:00
|
|
|
AttributeSet AttributeList::getAttributes(unsigned Index) const {
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
Index = attrIdxToArrayIdx(Index);
|
|
|
|
if (!pImpl || Index >= getNumAttrSets())
|
2018-03-30 02:47:31 +02:00
|
|
|
return {};
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
return pImpl->begin()[Index];
|
2013-01-29 01:34:06 +01:00
|
|
|
}
|
|
|
|
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
AttributeList::iterator AttributeList::begin() const {
|
|
|
|
return pImpl ? pImpl->begin() : nullptr;
|
2013-02-01 00:53:05 +01:00
|
|
|
}
|
|
|
|
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
AttributeList::iterator AttributeList::end() const {
|
|
|
|
return pImpl ? pImpl->end() : nullptr;
|
2013-02-01 00:53:05 +01:00
|
|
|
}
|
|
|
|
|
2013-01-29 01:34:06 +01:00
|
|
|
//===----------------------------------------------------------------------===//
|
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-21 17:57:19 +01:00
|
|
|
// AttributeList Introspection Methods
|
2013-01-29 01:34:06 +01:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
unsigned AttributeList::getNumAttrSets() const {
|
|
|
|
return pImpl ? pImpl->NumAttrSets : 0;
|
2013-01-29 01:34:06 +01:00
|
|
|
}
|
|
|
|
|
2017-10-15 16:32:27 +02:00
|
|
|
#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
|
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-21 17:57:19 +01:00
|
|
|
LLVM_DUMP_METHOD void AttributeList::dump() const {
|
2013-01-28 01:21:34 +01:00
|
|
|
dbgs() << "PAL[\n";
|
2013-01-29 01:34:06 +01:00
|
|
|
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
for (unsigned i = index_begin(), e = index_end(); i != e; ++i) {
|
|
|
|
if (getAttributes(i).hasAttributes())
|
|
|
|
dbgs() << " { " << i << " => " << getAsString(i) << " }\n";
|
2008-03-12 18:45:29 +01:00
|
|
|
}
|
2012-10-16 08:01:44 +02:00
|
|
|
|
2010-01-05 02:29:58 +01:00
|
|
|
dbgs() << "]\n";
|
2008-01-06 19:27:01 +01:00
|
|
|
}
|
2017-01-28 03:02:38 +01:00
|
|
|
#endif
|
2013-01-26 00:09:36 +01:00
|
|
|
|
2013-01-29 01:34:06 +01:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// AttrBuilder Method Implementations
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
// FIXME: Remove this ctor, use AttributeSet.
|
2017-04-12 02:38:00 +02:00
|
|
|
AttrBuilder::AttrBuilder(AttributeList AL, unsigned Index) {
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
AttributeSet AS = AL.getAttributes(Index);
|
2018-03-30 02:47:31 +02:00
|
|
|
for (const auto &A : AS)
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
addAttribute(A);
|
2013-01-29 01:34:06 +01:00
|
|
|
}
|
|
|
|
|
2017-04-12 02:38:00 +02:00
|
|
|
AttrBuilder::AttrBuilder(AttributeSet AS) {
|
2018-03-30 02:47:31 +02:00
|
|
|
for (const auto &A : AS)
|
[IR] Switch AttributeList to use an array for O(1) access
Summary:
Before this change, AttributeLists stored a pair of index and
AttributeSet. This is memory efficient if most arguments do not have
attributes. However, it requires doing a search over the pairs to test
an argument or function attribute. Profiling shows that this loop was
0.76% of the time in 'opt -O2' of sqlite3.c, because LLVM constantly
tests values for nullability.
This was worth about 2.5% of mid-level optimization cycles on the
sqlite3 amalgamation. Here are the full perf results:
https://reviews.llvm.org/P7995
Here are just the before and after cycle counts:
```
$ perf stat -r 5 ./opt_before -O2 sqlite3.bc -o /dev/null
13,274,181,184 cycles # 3.047 GHz ( +- 0.28% )
$ perf stat -r 5 ./opt_after -O2 sqlite3.bc -o /dev/null
12,906,927,263 cycles # 3.043 GHz ( +- 0.51% )
```
This patch *does not* change the indices used to query attributes, as
requested by reviewers. Tracking whether an index is usable for array
indexing is a huge pain that affects many of the internal APIs, so it
would be good to come back later and do a cleanup to remove this
internal adjustment.
Reviewers: pete, chandlerc
Subscribers: javed.absar, llvm-commits
Differential Revision: https://reviews.llvm.org/D32819
llvm-svn: 303654
2017-05-23 19:01:48 +02:00
|
|
|
addAttribute(A);
|
2017-04-11 01:31:05 +02:00
|
|
|
}
|
|
|
|
|
2013-01-29 01:34:06 +01:00
|
|
|
void AttrBuilder::clear() {
|
2013-02-18 13:09:51 +01:00
|
|
|
Attrs.reset();
|
2015-09-04 00:27:42 +02:00
|
|
|
TargetDepAttrs.clear();
|
2019-08-06 11:16:33 +02:00
|
|
|
Alignment.reset();
|
|
|
|
StackAlignment.reset();
|
|
|
|
DerefBytes = DerefOrNullBytes = 0;
|
2016-04-12 03:05:35 +02:00
|
|
|
AllocSizeArgs = 0;
|
2019-05-30 20:48:23 +02:00
|
|
|
ByValType = nullptr;
|
2020-09-29 15:33:55 +02:00
|
|
|
StructRetType = nullptr;
|
IR: Define byref parameter attribute
This allows tracking the in-memory type of a pointer argument to a
function for ABI purposes. This is essentially a stripped down version
of byval to remove some of the stack-copy implications in its
definition.
This includes the base IR changes, and some tests for places where it
should be treated similarly to byval. Codegen support will be in a
future patch.
My original attempt at solving some of these problems was to repurpose
byval with a different address space from the stack. However, it is
technically permitted for the callee to introduce a write to the
argument, although nothing does this in reality. There is also talk of
removing and replacing the byval attribute, so a new attribute would
need to take its place anyway.
This is intended avoid some optimization issues with the current
handling of aggregate arguments, as well as fixes inflexibilty in how
frontends can specify the kernel ABI. The most honest representation
of the amdgpu_kernel convention is to expose all kernel arguments as
loads from constant memory. Today, these are raw, SSA Argument values
and codegen is responsible for turning these into loads.
Background:
There currently isn't a satisfactory way to represent how arguments
for the amdgpu_kernel calling convention are passed. In reality,
arguments are passed in a single, flat, constant memory buffer
implicitly passed to the function. It is also illegal to call this
function in the IR, and this is only ever invoked by a driver of some
kind.
It does not make sense to have a stack passed parameter in this
context as is implied by byval. It is never valid to write to the
kernel arguments, as this would corrupt the inputs seen by other
dispatches of the kernel. These argumets are also not in the same
address space as the stack, so a copy is needed to an alloca. From a
source C-like language, the kernel parameters are invisible.
Semantically, a copy is always required from the constant argument
memory to a mutable variable.
The current clang calling convention lowering emits raw values,
including aggregates into the function argument list, since using
byval would not make sense. This has some unfortunate consequences for
the optimizer. In the aggregate case, we end up with an aggregate
store to alloca, which both SROA and instcombine turn into a store of
each aggregate field. The optimizer never pieces this back together to
see that this is really just a copy from constant memory, so we end up
stuck with expensive stack usage.
This also means the backend dictates the alignment of arguments, and
arbitrarily picks the LLVM IR ABI type alignment. By allowing an
explicit alignment, frontends can make better decisions. For example,
there's real no advantage to an aligment higher than 4, so a frontend
could choose to compact the argument layout. Similarly, there is a
high penalty to using an alignment lower than 4, so a frontend could
opt into more padding for small arguments.
Another design consideration is when it is appropriate to expose the
fact that these arguments are all really passed in adjacent
memory. Currently we have a late IR optimization pass in codegen to
rewrite the kernel argument values into explicit loads to enable
vectorization. In most programs, unrelated argument loads can be
merged together. However, exposing this property directly from the
frontend has some disadvantages. We still need a way to track the
original argument sizes and alignments to report to the driver. I find
using some side-channel, metadata mechanism to track this
unappealing. If the kernel arguments were exposed as a single buffer
to begin with, alias analysis would be unaware that the padding bits
betewen arguments are meaningless. Another family of problems is there
are still some gaps in replacing all of the available parameter
attributes with metadata equivalents once lowered to loads.
The immediate plan is to start using this new attribute to handle all
aggregate argumets for kernels. Long term, it makes sense to migrate
all kernel arguments, including scalars, to be passed indirectly in
the same manner.
Additional context is in D79744.
2020-06-05 22:58:47 +02:00
|
|
|
ByRefType = nullptr;
|
2020-02-14 23:16:53 +01:00
|
|
|
PreallocatedType = nullptr;
|
2013-01-29 01:34:06 +01:00
|
|
|
}
|
|
|
|
|
2013-02-01 00:38:01 +01:00
|
|
|
AttrBuilder &AttrBuilder::addAttribute(Attribute Attr) {
|
2013-02-10 11:13:23 +01:00
|
|
|
if (Attr.isStringAttribute()) {
|
|
|
|
addAttribute(Attr.getKindAsString(), Attr.getValueAsString());
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2013-02-05 23:37:24 +01:00
|
|
|
Attribute::AttrKind Kind = Attr.getKindAsEnum();
|
2013-02-18 13:09:51 +01:00
|
|
|
Attrs[Kind] = true;
|
2013-01-29 01:34:06 +01:00
|
|
|
|
2013-02-05 23:37:24 +01:00
|
|
|
if (Kind == Attribute::Alignment)
|
2019-10-22 13:57:52 +02:00
|
|
|
Alignment = Attr.getAlignment();
|
2013-02-05 23:37:24 +01:00
|
|
|
else if (Kind == Attribute::StackAlignment)
|
2019-10-22 13:57:52 +02:00
|
|
|
StackAlignment = Attr.getStackAlignment();
|
2019-05-30 20:48:23 +02:00
|
|
|
else if (Kind == Attribute::ByVal)
|
|
|
|
ByValType = Attr.getValueAsType();
|
2020-09-29 15:33:55 +02:00
|
|
|
else if (Kind == Attribute::StructRet)
|
|
|
|
StructRetType = Attr.getValueAsType();
|
IR: Define byref parameter attribute
This allows tracking the in-memory type of a pointer argument to a
function for ABI purposes. This is essentially a stripped down version
of byval to remove some of the stack-copy implications in its
definition.
This includes the base IR changes, and some tests for places where it
should be treated similarly to byval. Codegen support will be in a
future patch.
My original attempt at solving some of these problems was to repurpose
byval with a different address space from the stack. However, it is
technically permitted for the callee to introduce a write to the
argument, although nothing does this in reality. There is also talk of
removing and replacing the byval attribute, so a new attribute would
need to take its place anyway.
This is intended avoid some optimization issues with the current
handling of aggregate arguments, as well as fixes inflexibilty in how
frontends can specify the kernel ABI. The most honest representation
of the amdgpu_kernel convention is to expose all kernel arguments as
loads from constant memory. Today, these are raw, SSA Argument values
and codegen is responsible for turning these into loads.
Background:
There currently isn't a satisfactory way to represent how arguments
for the amdgpu_kernel calling convention are passed. In reality,
arguments are passed in a single, flat, constant memory buffer
implicitly passed to the function. It is also illegal to call this
function in the IR, and this is only ever invoked by a driver of some
kind.
It does not make sense to have a stack passed parameter in this
context as is implied by byval. It is never valid to write to the
kernel arguments, as this would corrupt the inputs seen by other
dispatches of the kernel. These argumets are also not in the same
address space as the stack, so a copy is needed to an alloca. From a
source C-like language, the kernel parameters are invisible.
Semantically, a copy is always required from the constant argument
memory to a mutable variable.
The current clang calling convention lowering emits raw values,
including aggregates into the function argument list, since using
byval would not make sense. This has some unfortunate consequences for
the optimizer. In the aggregate case, we end up with an aggregate
store to alloca, which both SROA and instcombine turn into a store of
each aggregate field. The optimizer never pieces this back together to
see that this is really just a copy from constant memory, so we end up
stuck with expensive stack usage.
This also means the backend dictates the alignment of arguments, and
arbitrarily picks the LLVM IR ABI type alignment. By allowing an
explicit alignment, frontends can make better decisions. For example,
there's real no advantage to an aligment higher than 4, so a frontend
could choose to compact the argument layout. Similarly, there is a
high penalty to using an alignment lower than 4, so a frontend could
opt into more padding for small arguments.
Another design consideration is when it is appropriate to expose the
fact that these arguments are all really passed in adjacent
memory. Currently we have a late IR optimization pass in codegen to
rewrite the kernel argument values into explicit loads to enable
vectorization. In most programs, unrelated argument loads can be
merged together. However, exposing this property directly from the
frontend has some disadvantages. We still need a way to track the
original argument sizes and alignments to report to the driver. I find
using some side-channel, metadata mechanism to track this
unappealing. If the kernel arguments were exposed as a single buffer
to begin with, alias analysis would be unaware that the padding bits
betewen arguments are meaningless. Another family of problems is there
are still some gaps in replacing all of the available parameter
attributes with metadata equivalents once lowered to loads.
The immediate plan is to start using this new attribute to handle all
aggregate argumets for kernels. Long term, it makes sense to migrate
all kernel arguments, including scalars, to be passed indirectly in
the same manner.
Additional context is in D79744.
2020-06-05 22:58:47 +02:00
|
|
|
else if (Kind == Attribute::ByRef)
|
|
|
|
ByRefType = Attr.getValueAsType();
|
2020-02-14 23:16:53 +01:00
|
|
|
else if (Kind == Attribute::Preallocated)
|
|
|
|
PreallocatedType = Attr.getValueAsType();
|
2014-07-18 17:51:28 +02:00
|
|
|
else if (Kind == Attribute::Dereferenceable)
|
|
|
|
DerefBytes = Attr.getDereferenceableBytes();
|
2015-04-16 22:29:50 +02:00
|
|
|
else if (Kind == Attribute::DereferenceableOrNull)
|
|
|
|
DerefOrNullBytes = Attr.getDereferenceableOrNullBytes();
|
2016-04-12 03:05:35 +02:00
|
|
|
else if (Kind == Attribute::AllocSize)
|
|
|
|
AllocSizeArgs = Attr.getValueAsInt();
|
2013-01-29 01:34:06 +01:00
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2013-02-05 09:09:32 +01:00
|
|
|
AttrBuilder &AttrBuilder::addAttribute(StringRef A, StringRef V) {
|
2021-03-08 17:46:35 +01:00
|
|
|
TargetDepAttrs[A] = V;
|
2013-02-05 09:09:32 +01:00
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2013-02-01 00:38:01 +01:00
|
|
|
AttrBuilder &AttrBuilder::removeAttribute(Attribute::AttrKind Val) {
|
2013-02-18 13:09:51 +01:00
|
|
|
assert((unsigned)Val < Attribute::EndAttrKinds && "Attribute out of range!");
|
|
|
|
Attrs[Val] = false;
|
2013-02-01 00:38:01 +01:00
|
|
|
|
|
|
|
if (Val == Attribute::Alignment)
|
2019-08-06 11:16:33 +02:00
|
|
|
Alignment.reset();
|
2013-02-01 00:38:01 +01:00
|
|
|
else if (Val == Attribute::StackAlignment)
|
2019-08-06 11:16:33 +02:00
|
|
|
StackAlignment.reset();
|
2019-05-30 20:48:23 +02:00
|
|
|
else if (Val == Attribute::ByVal)
|
|
|
|
ByValType = nullptr;
|
2020-09-29 15:33:55 +02:00
|
|
|
else if (Val == Attribute::StructRet)
|
|
|
|
StructRetType = nullptr;
|
IR: Define byref parameter attribute
This allows tracking the in-memory type of a pointer argument to a
function for ABI purposes. This is essentially a stripped down version
of byval to remove some of the stack-copy implications in its
definition.
This includes the base IR changes, and some tests for places where it
should be treated similarly to byval. Codegen support will be in a
future patch.
My original attempt at solving some of these problems was to repurpose
byval with a different address space from the stack. However, it is
technically permitted for the callee to introduce a write to the
argument, although nothing does this in reality. There is also talk of
removing and replacing the byval attribute, so a new attribute would
need to take its place anyway.
This is intended avoid some optimization issues with the current
handling of aggregate arguments, as well as fixes inflexibilty in how
frontends can specify the kernel ABI. The most honest representation
of the amdgpu_kernel convention is to expose all kernel arguments as
loads from constant memory. Today, these are raw, SSA Argument values
and codegen is responsible for turning these into loads.
Background:
There currently isn't a satisfactory way to represent how arguments
for the amdgpu_kernel calling convention are passed. In reality,
arguments are passed in a single, flat, constant memory buffer
implicitly passed to the function. It is also illegal to call this
function in the IR, and this is only ever invoked by a driver of some
kind.
It does not make sense to have a stack passed parameter in this
context as is implied by byval. It is never valid to write to the
kernel arguments, as this would corrupt the inputs seen by other
dispatches of the kernel. These argumets are also not in the same
address space as the stack, so a copy is needed to an alloca. From a
source C-like language, the kernel parameters are invisible.
Semantically, a copy is always required from the constant argument
memory to a mutable variable.
The current clang calling convention lowering emits raw values,
including aggregates into the function argument list, since using
byval would not make sense. This has some unfortunate consequences for
the optimizer. In the aggregate case, we end up with an aggregate
store to alloca, which both SROA and instcombine turn into a store of
each aggregate field. The optimizer never pieces this back together to
see that this is really just a copy from constant memory, so we end up
stuck with expensive stack usage.
This also means the backend dictates the alignment of arguments, and
arbitrarily picks the LLVM IR ABI type alignment. By allowing an
explicit alignment, frontends can make better decisions. For example,
there's real no advantage to an aligment higher than 4, so a frontend
could choose to compact the argument layout. Similarly, there is a
high penalty to using an alignment lower than 4, so a frontend could
opt into more padding for small arguments.
Another design consideration is when it is appropriate to expose the
fact that these arguments are all really passed in adjacent
memory. Currently we have a late IR optimization pass in codegen to
rewrite the kernel argument values into explicit loads to enable
vectorization. In most programs, unrelated argument loads can be
merged together. However, exposing this property directly from the
frontend has some disadvantages. We still need a way to track the
original argument sizes and alignments to report to the driver. I find
using some side-channel, metadata mechanism to track this
unappealing. If the kernel arguments were exposed as a single buffer
to begin with, alias analysis would be unaware that the padding bits
betewen arguments are meaningless. Another family of problems is there
are still some gaps in replacing all of the available parameter
attributes with metadata equivalents once lowered to loads.
The immediate plan is to start using this new attribute to handle all
aggregate argumets for kernels. Long term, it makes sense to migrate
all kernel arguments, including scalars, to be passed indirectly in
the same manner.
Additional context is in D79744.
2020-06-05 22:58:47 +02:00
|
|
|
else if (Val == Attribute::ByRef)
|
|
|
|
ByRefType = nullptr;
|
2020-02-14 23:16:53 +01:00
|
|
|
else if (Val == Attribute::Preallocated)
|
|
|
|
PreallocatedType = nullptr;
|
2014-07-18 17:51:28 +02:00
|
|
|
else if (Val == Attribute::Dereferenceable)
|
|
|
|
DerefBytes = 0;
|
2015-04-16 22:29:50 +02:00
|
|
|
else if (Val == Attribute::DereferenceableOrNull)
|
|
|
|
DerefOrNullBytes = 0;
|
2016-04-12 03:05:35 +02:00
|
|
|
else if (Val == Attribute::AllocSize)
|
|
|
|
AllocSizeArgs = 0;
|
2013-02-01 00:38:01 +01:00
|
|
|
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
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-21 17:57:19 +01:00
|
|
|
AttrBuilder &AttrBuilder::removeAttributes(AttributeList A, uint64_t Index) {
|
2017-04-28 20:37:16 +02:00
|
|
|
remove(A.getAttributes(Index));
|
2013-01-29 01:34:06 +01:00
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2013-02-05 09:09:32 +01:00
|
|
|
AttrBuilder &AttrBuilder::removeAttribute(StringRef A) {
|
2018-03-30 02:47:31 +02:00
|
|
|
auto I = TargetDepAttrs.find(A);
|
2013-02-05 09:09:32 +01:00
|
|
|
if (I != TargetDepAttrs.end())
|
|
|
|
TargetDepAttrs.erase(I);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2016-04-12 03:05:35 +02:00
|
|
|
std::pair<unsigned, Optional<unsigned>> AttrBuilder::getAllocSizeArgs() const {
|
|
|
|
return unpackAllocSizeArgs(AllocSizeArgs);
|
|
|
|
}
|
|
|
|
|
2019-10-22 11:51:06 +02:00
|
|
|
AttrBuilder &AttrBuilder::addAlignmentAttr(MaybeAlign Align) {
|
2019-08-06 11:16:33 +02:00
|
|
|
if (!Align)
|
|
|
|
return *this;
|
2013-01-29 01:34:06 +01:00
|
|
|
|
[IR] Attribute/AttrBuilder: use Value::MaximumAlignment magic constant
Summary:
I initially encountered those assertions when trying to create
this IR `alignment` attribute from clang's `__attribute__((assume_aligned(imm)))`,
because until D72994 there is no sanity checking for the value of `imm`.
But even then, we have `llvm::Value::MaximumAlignment` constant (which is `536870912`),
which is enforced for clang attributes, and then there are some other magical constant
(`0x40000000` i.e. `1073741824` i.e. `2 * 536870912`) in
`Attribute::getWithAlignment()`/`AttrBuilder::addAlignmentAttr()`.
I strongly suspect that `0x40000000` is incorrect,
and that also should be `llvm::Value::MaximumAlignment`.
Reviewers: erichkeane, hfinkel, jdoerfert, gchatelet, courbet
Reviewed By: erichkeane
Subscribers: hiraditya, cfe-commits, llvm-commits
Tags: #llvm, #clang
Differential Revision: https://reviews.llvm.org/D72998
2020-01-23 20:50:06 +01:00
|
|
|
assert(*Align <= llvm::Value::MaximumAlignment && "Alignment too large.");
|
2013-01-29 01:34:06 +01:00
|
|
|
|
2013-02-18 13:09:51 +01:00
|
|
|
Attrs[Attribute::Alignment] = true;
|
2013-01-29 01:34:06 +01:00
|
|
|
Alignment = Align;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2019-10-22 11:51:06 +02:00
|
|
|
AttrBuilder &AttrBuilder::addStackAlignmentAttr(MaybeAlign Align) {
|
2013-01-29 01:34:06 +01:00
|
|
|
// Default alignment, allow the target to define how to align it.
|
2019-08-06 11:16:33 +02:00
|
|
|
if (!Align)
|
|
|
|
return *this;
|
2013-01-29 01:34:06 +01:00
|
|
|
|
2019-08-06 11:16:33 +02:00
|
|
|
assert(*Align <= 0x100 && "Alignment too large.");
|
2013-01-29 01:34:06 +01:00
|
|
|
|
2013-02-18 13:09:51 +01:00
|
|
|
Attrs[Attribute::StackAlignment] = true;
|
2013-01-29 01:34:06 +01:00
|
|
|
StackAlignment = Align;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2014-07-18 17:51:28 +02:00
|
|
|
AttrBuilder &AttrBuilder::addDereferenceableAttr(uint64_t Bytes) {
|
|
|
|
if (Bytes == 0) return *this;
|
|
|
|
|
|
|
|
Attrs[Attribute::Dereferenceable] = true;
|
|
|
|
DerefBytes = Bytes;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2015-04-16 22:29:50 +02:00
|
|
|
AttrBuilder &AttrBuilder::addDereferenceableOrNullAttr(uint64_t Bytes) {
|
|
|
|
if (Bytes == 0)
|
|
|
|
return *this;
|
|
|
|
|
|
|
|
Attrs[Attribute::DereferenceableOrNull] = true;
|
|
|
|
DerefOrNullBytes = Bytes;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2016-04-12 03:05:35 +02:00
|
|
|
AttrBuilder &AttrBuilder::addAllocSizeAttr(unsigned ElemSize,
|
|
|
|
const Optional<unsigned> &NumElems) {
|
|
|
|
return addAllocSizeAttrFromRawRepr(packAllocSizeArgs(ElemSize, NumElems));
|
|
|
|
}
|
|
|
|
|
|
|
|
AttrBuilder &AttrBuilder::addAllocSizeAttrFromRawRepr(uint64_t RawArgs) {
|
|
|
|
// (0, 0) is our "not present" value, so we need to check for it here.
|
|
|
|
assert(RawArgs && "Invalid allocsize arguments -- given allocsize(0, 0)");
|
|
|
|
|
|
|
|
Attrs[Attribute::AllocSize] = true;
|
|
|
|
// Reuse existing machinery to store this as a single 64-bit integer so we can
|
|
|
|
// save a few bytes over using a pair<unsigned, Optional<unsigned>>.
|
|
|
|
AllocSizeArgs = RawArgs;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2019-05-30 20:48:23 +02:00
|
|
|
AttrBuilder &AttrBuilder::addByValAttr(Type *Ty) {
|
|
|
|
Attrs[Attribute::ByVal] = true;
|
|
|
|
ByValType = Ty;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2020-09-29 15:33:55 +02:00
|
|
|
AttrBuilder &AttrBuilder::addStructRetAttr(Type *Ty) {
|
|
|
|
Attrs[Attribute::StructRet] = true;
|
|
|
|
StructRetType = Ty;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
IR: Define byref parameter attribute
This allows tracking the in-memory type of a pointer argument to a
function for ABI purposes. This is essentially a stripped down version
of byval to remove some of the stack-copy implications in its
definition.
This includes the base IR changes, and some tests for places where it
should be treated similarly to byval. Codegen support will be in a
future patch.
My original attempt at solving some of these problems was to repurpose
byval with a different address space from the stack. However, it is
technically permitted for the callee to introduce a write to the
argument, although nothing does this in reality. There is also talk of
removing and replacing the byval attribute, so a new attribute would
need to take its place anyway.
This is intended avoid some optimization issues with the current
handling of aggregate arguments, as well as fixes inflexibilty in how
frontends can specify the kernel ABI. The most honest representation
of the amdgpu_kernel convention is to expose all kernel arguments as
loads from constant memory. Today, these are raw, SSA Argument values
and codegen is responsible for turning these into loads.
Background:
There currently isn't a satisfactory way to represent how arguments
for the amdgpu_kernel calling convention are passed. In reality,
arguments are passed in a single, flat, constant memory buffer
implicitly passed to the function. It is also illegal to call this
function in the IR, and this is only ever invoked by a driver of some
kind.
It does not make sense to have a stack passed parameter in this
context as is implied by byval. It is never valid to write to the
kernel arguments, as this would corrupt the inputs seen by other
dispatches of the kernel. These argumets are also not in the same
address space as the stack, so a copy is needed to an alloca. From a
source C-like language, the kernel parameters are invisible.
Semantically, a copy is always required from the constant argument
memory to a mutable variable.
The current clang calling convention lowering emits raw values,
including aggregates into the function argument list, since using
byval would not make sense. This has some unfortunate consequences for
the optimizer. In the aggregate case, we end up with an aggregate
store to alloca, which both SROA and instcombine turn into a store of
each aggregate field. The optimizer never pieces this back together to
see that this is really just a copy from constant memory, so we end up
stuck with expensive stack usage.
This also means the backend dictates the alignment of arguments, and
arbitrarily picks the LLVM IR ABI type alignment. By allowing an
explicit alignment, frontends can make better decisions. For example,
there's real no advantage to an aligment higher than 4, so a frontend
could choose to compact the argument layout. Similarly, there is a
high penalty to using an alignment lower than 4, so a frontend could
opt into more padding for small arguments.
Another design consideration is when it is appropriate to expose the
fact that these arguments are all really passed in adjacent
memory. Currently we have a late IR optimization pass in codegen to
rewrite the kernel argument values into explicit loads to enable
vectorization. In most programs, unrelated argument loads can be
merged together. However, exposing this property directly from the
frontend has some disadvantages. We still need a way to track the
original argument sizes and alignments to report to the driver. I find
using some side-channel, metadata mechanism to track this
unappealing. If the kernel arguments were exposed as a single buffer
to begin with, alias analysis would be unaware that the padding bits
betewen arguments are meaningless. Another family of problems is there
are still some gaps in replacing all of the available parameter
attributes with metadata equivalents once lowered to loads.
The immediate plan is to start using this new attribute to handle all
aggregate argumets for kernels. Long term, it makes sense to migrate
all kernel arguments, including scalars, to be passed indirectly in
the same manner.
Additional context is in D79744.
2020-06-05 22:58:47 +02:00
|
|
|
AttrBuilder &AttrBuilder::addByRefAttr(Type *Ty) {
|
|
|
|
Attrs[Attribute::ByRef] = true;
|
|
|
|
ByRefType = Ty;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2020-02-14 23:16:53 +01:00
|
|
|
AttrBuilder &AttrBuilder::addPreallocatedAttr(Type *Ty) {
|
|
|
|
Attrs[Attribute::Preallocated] = true;
|
|
|
|
PreallocatedType = Ty;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2013-02-06 02:16:00 +01:00
|
|
|
AttrBuilder &AttrBuilder::merge(const AttrBuilder &B) {
|
|
|
|
// FIXME: What if both have alignments, but they don't match?!
|
|
|
|
if (!Alignment)
|
|
|
|
Alignment = B.Alignment;
|
|
|
|
|
|
|
|
if (!StackAlignment)
|
|
|
|
StackAlignment = B.StackAlignment;
|
|
|
|
|
2014-07-18 17:51:28 +02:00
|
|
|
if (!DerefBytes)
|
|
|
|
DerefBytes = B.DerefBytes;
|
|
|
|
|
2015-05-07 01:19:43 +02:00
|
|
|
if (!DerefOrNullBytes)
|
|
|
|
DerefOrNullBytes = B.DerefOrNullBytes;
|
|
|
|
|
2016-04-12 03:05:35 +02:00
|
|
|
if (!AllocSizeArgs)
|
|
|
|
AllocSizeArgs = B.AllocSizeArgs;
|
|
|
|
|
2019-05-30 20:48:23 +02:00
|
|
|
if (!ByValType)
|
|
|
|
ByValType = B.ByValType;
|
|
|
|
|
2020-09-29 15:33:55 +02:00
|
|
|
if (!StructRetType)
|
|
|
|
StructRetType = B.StructRetType;
|
|
|
|
|
IR: Define byref parameter attribute
This allows tracking the in-memory type of a pointer argument to a
function for ABI purposes. This is essentially a stripped down version
of byval to remove some of the stack-copy implications in its
definition.
This includes the base IR changes, and some tests for places where it
should be treated similarly to byval. Codegen support will be in a
future patch.
My original attempt at solving some of these problems was to repurpose
byval with a different address space from the stack. However, it is
technically permitted for the callee to introduce a write to the
argument, although nothing does this in reality. There is also talk of
removing and replacing the byval attribute, so a new attribute would
need to take its place anyway.
This is intended avoid some optimization issues with the current
handling of aggregate arguments, as well as fixes inflexibilty in how
frontends can specify the kernel ABI. The most honest representation
of the amdgpu_kernel convention is to expose all kernel arguments as
loads from constant memory. Today, these are raw, SSA Argument values
and codegen is responsible for turning these into loads.
Background:
There currently isn't a satisfactory way to represent how arguments
for the amdgpu_kernel calling convention are passed. In reality,
arguments are passed in a single, flat, constant memory buffer
implicitly passed to the function. It is also illegal to call this
function in the IR, and this is only ever invoked by a driver of some
kind.
It does not make sense to have a stack passed parameter in this
context as is implied by byval. It is never valid to write to the
kernel arguments, as this would corrupt the inputs seen by other
dispatches of the kernel. These argumets are also not in the same
address space as the stack, so a copy is needed to an alloca. From a
source C-like language, the kernel parameters are invisible.
Semantically, a copy is always required from the constant argument
memory to a mutable variable.
The current clang calling convention lowering emits raw values,
including aggregates into the function argument list, since using
byval would not make sense. This has some unfortunate consequences for
the optimizer. In the aggregate case, we end up with an aggregate
store to alloca, which both SROA and instcombine turn into a store of
each aggregate field. The optimizer never pieces this back together to
see that this is really just a copy from constant memory, so we end up
stuck with expensive stack usage.
This also means the backend dictates the alignment of arguments, and
arbitrarily picks the LLVM IR ABI type alignment. By allowing an
explicit alignment, frontends can make better decisions. For example,
there's real no advantage to an aligment higher than 4, so a frontend
could choose to compact the argument layout. Similarly, there is a
high penalty to using an alignment lower than 4, so a frontend could
opt into more padding for small arguments.
Another design consideration is when it is appropriate to expose the
fact that these arguments are all really passed in adjacent
memory. Currently we have a late IR optimization pass in codegen to
rewrite the kernel argument values into explicit loads to enable
vectorization. In most programs, unrelated argument loads can be
merged together. However, exposing this property directly from the
frontend has some disadvantages. We still need a way to track the
original argument sizes and alignments to report to the driver. I find
using some side-channel, metadata mechanism to track this
unappealing. If the kernel arguments were exposed as a single buffer
to begin with, alias analysis would be unaware that the padding bits
betewen arguments are meaningless. Another family of problems is there
are still some gaps in replacing all of the available parameter
attributes with metadata equivalents once lowered to loads.
The immediate plan is to start using this new attribute to handle all
aggregate argumets for kernels. Long term, it makes sense to migrate
all kernel arguments, including scalars, to be passed indirectly in
the same manner.
Additional context is in D79744.
2020-06-05 22:58:47 +02:00
|
|
|
if (!ByRefType)
|
|
|
|
ByRefType = B.ByRefType;
|
|
|
|
|
2020-02-14 23:16:53 +01:00
|
|
|
if (!PreallocatedType)
|
|
|
|
PreallocatedType = B.PreallocatedType;
|
|
|
|
|
2013-02-16 20:13:18 +01:00
|
|
|
Attrs |= B.Attrs;
|
2013-02-06 02:16:00 +01:00
|
|
|
|
2020-06-30 19:03:16 +02:00
|
|
|
for (const auto &I : B.td_attrs())
|
2015-05-07 01:19:43 +02:00
|
|
|
TargetDepAttrs[I.first] = I.second;
|
2013-02-06 02:16:00 +01:00
|
|
|
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2015-05-07 01:19:43 +02:00
|
|
|
AttrBuilder &AttrBuilder::remove(const AttrBuilder &B) {
|
|
|
|
// FIXME: What if both have alignments, but they don't match?!
|
|
|
|
if (B.Alignment)
|
2019-08-06 11:16:33 +02:00
|
|
|
Alignment.reset();
|
2015-05-07 01:19:43 +02:00
|
|
|
|
|
|
|
if (B.StackAlignment)
|
2019-08-06 11:16:33 +02:00
|
|
|
StackAlignment.reset();
|
2015-05-07 01:19:43 +02:00
|
|
|
|
|
|
|
if (B.DerefBytes)
|
|
|
|
DerefBytes = 0;
|
|
|
|
|
|
|
|
if (B.DerefOrNullBytes)
|
|
|
|
DerefOrNullBytes = 0;
|
|
|
|
|
2016-04-12 03:05:35 +02:00
|
|
|
if (B.AllocSizeArgs)
|
|
|
|
AllocSizeArgs = 0;
|
|
|
|
|
2019-05-30 20:48:23 +02:00
|
|
|
if (B.ByValType)
|
|
|
|
ByValType = nullptr;
|
|
|
|
|
2020-09-29 15:33:55 +02:00
|
|
|
if (B.StructRetType)
|
|
|
|
StructRetType = nullptr;
|
|
|
|
|
IR: Define byref parameter attribute
This allows tracking the in-memory type of a pointer argument to a
function for ABI purposes. This is essentially a stripped down version
of byval to remove some of the stack-copy implications in its
definition.
This includes the base IR changes, and some tests for places where it
should be treated similarly to byval. Codegen support will be in a
future patch.
My original attempt at solving some of these problems was to repurpose
byval with a different address space from the stack. However, it is
technically permitted for the callee to introduce a write to the
argument, although nothing does this in reality. There is also talk of
removing and replacing the byval attribute, so a new attribute would
need to take its place anyway.
This is intended avoid some optimization issues with the current
handling of aggregate arguments, as well as fixes inflexibilty in how
frontends can specify the kernel ABI. The most honest representation
of the amdgpu_kernel convention is to expose all kernel arguments as
loads from constant memory. Today, these are raw, SSA Argument values
and codegen is responsible for turning these into loads.
Background:
There currently isn't a satisfactory way to represent how arguments
for the amdgpu_kernel calling convention are passed. In reality,
arguments are passed in a single, flat, constant memory buffer
implicitly passed to the function. It is also illegal to call this
function in the IR, and this is only ever invoked by a driver of some
kind.
It does not make sense to have a stack passed parameter in this
context as is implied by byval. It is never valid to write to the
kernel arguments, as this would corrupt the inputs seen by other
dispatches of the kernel. These argumets are also not in the same
address space as the stack, so a copy is needed to an alloca. From a
source C-like language, the kernel parameters are invisible.
Semantically, a copy is always required from the constant argument
memory to a mutable variable.
The current clang calling convention lowering emits raw values,
including aggregates into the function argument list, since using
byval would not make sense. This has some unfortunate consequences for
the optimizer. In the aggregate case, we end up with an aggregate
store to alloca, which both SROA and instcombine turn into a store of
each aggregate field. The optimizer never pieces this back together to
see that this is really just a copy from constant memory, so we end up
stuck with expensive stack usage.
This also means the backend dictates the alignment of arguments, and
arbitrarily picks the LLVM IR ABI type alignment. By allowing an
explicit alignment, frontends can make better decisions. For example,
there's real no advantage to an aligment higher than 4, so a frontend
could choose to compact the argument layout. Similarly, there is a
high penalty to using an alignment lower than 4, so a frontend could
opt into more padding for small arguments.
Another design consideration is when it is appropriate to expose the
fact that these arguments are all really passed in adjacent
memory. Currently we have a late IR optimization pass in codegen to
rewrite the kernel argument values into explicit loads to enable
vectorization. In most programs, unrelated argument loads can be
merged together. However, exposing this property directly from the
frontend has some disadvantages. We still need a way to track the
original argument sizes and alignments to report to the driver. I find
using some side-channel, metadata mechanism to track this
unappealing. If the kernel arguments were exposed as a single buffer
to begin with, alias analysis would be unaware that the padding bits
betewen arguments are meaningless. Another family of problems is there
are still some gaps in replacing all of the available parameter
attributes with metadata equivalents once lowered to loads.
The immediate plan is to start using this new attribute to handle all
aggregate argumets for kernels. Long term, it makes sense to migrate
all kernel arguments, including scalars, to be passed indirectly in
the same manner.
Additional context is in D79744.
2020-06-05 22:58:47 +02:00
|
|
|
if (B.ByRefType)
|
|
|
|
ByRefType = nullptr;
|
|
|
|
|
2020-02-14 23:16:53 +01:00
|
|
|
if (B.PreallocatedType)
|
|
|
|
PreallocatedType = nullptr;
|
|
|
|
|
2015-05-07 01:19:43 +02:00
|
|
|
Attrs &= ~B.Attrs;
|
|
|
|
|
2020-06-30 19:03:16 +02:00
|
|
|
for (const auto &I : B.td_attrs())
|
2015-05-07 01:19:43 +02:00
|
|
|
TargetDepAttrs.erase(I.first);
|
|
|
|
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool AttrBuilder::overlaps(const AttrBuilder &B) const {
|
|
|
|
// First check if any of the target independent attributes overlap.
|
|
|
|
if ((Attrs & B.Attrs).any())
|
|
|
|
return true;
|
|
|
|
|
|
|
|
// Then check if any target dependent ones do.
|
2017-02-22 07:34:04 +01:00
|
|
|
for (const auto &I : td_attrs())
|
2015-05-07 01:19:43 +02:00
|
|
|
if (B.contains(I.first))
|
|
|
|
return true;
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2013-02-06 02:33:42 +01:00
|
|
|
bool AttrBuilder::contains(StringRef A) const {
|
|
|
|
return TargetDepAttrs.find(A) != TargetDepAttrs.end();
|
|
|
|
}
|
|
|
|
|
2013-01-29 01:34:06 +01:00
|
|
|
bool AttrBuilder::hasAttributes() const {
|
2013-02-18 13:09:51 +01:00
|
|
|
return !Attrs.none() || !TargetDepAttrs.empty();
|
2013-01-29 01:34:06 +01:00
|
|
|
}
|
|
|
|
|
2017-04-28 20:37:16 +02:00
|
|
|
bool AttrBuilder::hasAttributes(AttributeList AL, uint64_t Index) const {
|
|
|
|
AttributeSet AS = AL.getAttributes(Index);
|
2013-02-02 01:42:06 +01:00
|
|
|
|
2019-12-17 21:57:58 +01:00
|
|
|
for (const auto &Attr : AS) {
|
2014-07-18 08:51:55 +02:00
|
|
|
if (Attr.isEnumAttribute() || Attr.isIntAttribute()) {
|
2017-04-28 20:37:16 +02:00
|
|
|
if (contains(Attr.getKindAsEnum()))
|
2013-02-12 08:56:49 +01:00
|
|
|
return true;
|
|
|
|
} else {
|
|
|
|
assert(Attr.isStringAttribute() && "Invalid attribute kind!");
|
2017-04-28 20:37:16 +02:00
|
|
|
return contains(Attr.getKindAsString());
|
2013-02-12 08:56:49 +01:00
|
|
|
}
|
|
|
|
}
|
2013-02-02 01:42:06 +01:00
|
|
|
|
|
|
|
return false;
|
2013-01-29 01:34:06 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
bool AttrBuilder::hasAlignmentAttr() const {
|
|
|
|
return Alignment != 0;
|
|
|
|
}
|
|
|
|
|
2020-12-17 11:41:35 +01:00
|
|
|
bool AttrBuilder::operator==(const AttrBuilder &B) const {
|
2013-02-16 20:13:18 +01:00
|
|
|
if (Attrs != B.Attrs)
|
|
|
|
return false;
|
2013-02-06 02:33:42 +01:00
|
|
|
|
2021-02-27 19:09:25 +01:00
|
|
|
for (const auto &TDA : TargetDepAttrs)
|
|
|
|
if (B.TargetDepAttrs.find(TDA.first) == B.TargetDepAttrs.end())
|
2013-02-06 02:33:42 +01:00
|
|
|
return false;
|
|
|
|
|
2014-07-18 17:51:28 +02:00
|
|
|
return Alignment == B.Alignment && StackAlignment == B.StackAlignment &&
|
2020-02-14 23:16:53 +01:00
|
|
|
DerefBytes == B.DerefBytes && ByValType == B.ByValType &&
|
2020-09-29 15:33:55 +02:00
|
|
|
StructRetType == B.StructRetType && ByRefType == B.ByRefType &&
|
|
|
|
PreallocatedType == B.PreallocatedType;
|
2013-01-29 01:34:06 +01:00
|
|
|
}
|
|
|
|
|
2013-01-26 00:09:36 +01:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// AttributeFuncs Function Defintions
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2018-05-01 17:54:18 +02:00
|
|
|
/// Which attributes cannot be applied to a type.
|
2015-08-02 00:20:21 +02:00
|
|
|
AttrBuilder AttributeFuncs::typeIncompatible(Type *Ty) {
|
2013-01-26 00:09:36 +01:00
|
|
|
AttrBuilder Incompatible;
|
|
|
|
|
|
|
|
if (!Ty->isIntegerTy())
|
|
|
|
// Attribute that only apply to integers.
|
|
|
|
Incompatible.addAttribute(Attribute::SExt)
|
|
|
|
.addAttribute(Attribute::ZExt);
|
|
|
|
|
|
|
|
if (!Ty->isPointerTy())
|
|
|
|
// Attribute that only apply to pointers.
|
2020-02-14 23:16:53 +01:00
|
|
|
Incompatible.addAttribute(Attribute::Nest)
|
|
|
|
.addAttribute(Attribute::NoAlias)
|
|
|
|
.addAttribute(Attribute::NoCapture)
|
|
|
|
.addAttribute(Attribute::NonNull)
|
2020-09-08 17:10:36 +02:00
|
|
|
.addAlignmentAttr(1) // the int here is ignored
|
2020-02-14 23:16:53 +01:00
|
|
|
.addDereferenceableAttr(1) // the int here is ignored
|
|
|
|
.addDereferenceableOrNullAttr(1) // the int here is ignored
|
|
|
|
.addAttribute(Attribute::ReadNone)
|
|
|
|
.addAttribute(Attribute::ReadOnly)
|
|
|
|
.addAttribute(Attribute::InAlloca)
|
|
|
|
.addPreallocatedAttr(Ty)
|
IR: Define byref parameter attribute
This allows tracking the in-memory type of a pointer argument to a
function for ABI purposes. This is essentially a stripped down version
of byval to remove some of the stack-copy implications in its
definition.
This includes the base IR changes, and some tests for places where it
should be treated similarly to byval. Codegen support will be in a
future patch.
My original attempt at solving some of these problems was to repurpose
byval with a different address space from the stack. However, it is
technically permitted for the callee to introduce a write to the
argument, although nothing does this in reality. There is also talk of
removing and replacing the byval attribute, so a new attribute would
need to take its place anyway.
This is intended avoid some optimization issues with the current
handling of aggregate arguments, as well as fixes inflexibilty in how
frontends can specify the kernel ABI. The most honest representation
of the amdgpu_kernel convention is to expose all kernel arguments as
loads from constant memory. Today, these are raw, SSA Argument values
and codegen is responsible for turning these into loads.
Background:
There currently isn't a satisfactory way to represent how arguments
for the amdgpu_kernel calling convention are passed. In reality,
arguments are passed in a single, flat, constant memory buffer
implicitly passed to the function. It is also illegal to call this
function in the IR, and this is only ever invoked by a driver of some
kind.
It does not make sense to have a stack passed parameter in this
context as is implied by byval. It is never valid to write to the
kernel arguments, as this would corrupt the inputs seen by other
dispatches of the kernel. These argumets are also not in the same
address space as the stack, so a copy is needed to an alloca. From a
source C-like language, the kernel parameters are invisible.
Semantically, a copy is always required from the constant argument
memory to a mutable variable.
The current clang calling convention lowering emits raw values,
including aggregates into the function argument list, since using
byval would not make sense. This has some unfortunate consequences for
the optimizer. In the aggregate case, we end up with an aggregate
store to alloca, which both SROA and instcombine turn into a store of
each aggregate field. The optimizer never pieces this back together to
see that this is really just a copy from constant memory, so we end up
stuck with expensive stack usage.
This also means the backend dictates the alignment of arguments, and
arbitrarily picks the LLVM IR ABI type alignment. By allowing an
explicit alignment, frontends can make better decisions. For example,
there's real no advantage to an aligment higher than 4, so a frontend
could choose to compact the argument layout. Similarly, there is a
high penalty to using an alignment lower than 4, so a frontend could
opt into more padding for small arguments.
Another design consideration is when it is appropriate to expose the
fact that these arguments are all really passed in adjacent
memory. Currently we have a late IR optimization pass in codegen to
rewrite the kernel argument values into explicit loads to enable
vectorization. In most programs, unrelated argument loads can be
merged together. However, exposing this property directly from the
frontend has some disadvantages. We still need a way to track the
original argument sizes and alignments to report to the driver. I find
using some side-channel, metadata mechanism to track this
unappealing. If the kernel arguments were exposed as a single buffer
to begin with, alias analysis would be unaware that the padding bits
betewen arguments are meaningless. Another family of problems is there
are still some gaps in replacing all of the available parameter
attributes with metadata equivalents once lowered to loads.
The immediate plan is to start using this new attribute to handle all
aggregate argumets for kernels. Long term, it makes sense to migrate
all kernel arguments, including scalars, to be passed indirectly in
the same manner.
Additional context is in D79744.
2020-06-05 22:58:47 +02:00
|
|
|
.addByValAttr(Ty)
|
2020-09-29 15:33:55 +02:00
|
|
|
.addStructRetAttr(Ty)
|
IR: Define byref parameter attribute
This allows tracking the in-memory type of a pointer argument to a
function for ABI purposes. This is essentially a stripped down version
of byval to remove some of the stack-copy implications in its
definition.
This includes the base IR changes, and some tests for places where it
should be treated similarly to byval. Codegen support will be in a
future patch.
My original attempt at solving some of these problems was to repurpose
byval with a different address space from the stack. However, it is
technically permitted for the callee to introduce a write to the
argument, although nothing does this in reality. There is also talk of
removing and replacing the byval attribute, so a new attribute would
need to take its place anyway.
This is intended avoid some optimization issues with the current
handling of aggregate arguments, as well as fixes inflexibilty in how
frontends can specify the kernel ABI. The most honest representation
of the amdgpu_kernel convention is to expose all kernel arguments as
loads from constant memory. Today, these are raw, SSA Argument values
and codegen is responsible for turning these into loads.
Background:
There currently isn't a satisfactory way to represent how arguments
for the amdgpu_kernel calling convention are passed. In reality,
arguments are passed in a single, flat, constant memory buffer
implicitly passed to the function. It is also illegal to call this
function in the IR, and this is only ever invoked by a driver of some
kind.
It does not make sense to have a stack passed parameter in this
context as is implied by byval. It is never valid to write to the
kernel arguments, as this would corrupt the inputs seen by other
dispatches of the kernel. These argumets are also not in the same
address space as the stack, so a copy is needed to an alloca. From a
source C-like language, the kernel parameters are invisible.
Semantically, a copy is always required from the constant argument
memory to a mutable variable.
The current clang calling convention lowering emits raw values,
including aggregates into the function argument list, since using
byval would not make sense. This has some unfortunate consequences for
the optimizer. In the aggregate case, we end up with an aggregate
store to alloca, which both SROA and instcombine turn into a store of
each aggregate field. The optimizer never pieces this back together to
see that this is really just a copy from constant memory, so we end up
stuck with expensive stack usage.
This also means the backend dictates the alignment of arguments, and
arbitrarily picks the LLVM IR ABI type alignment. By allowing an
explicit alignment, frontends can make better decisions. For example,
there's real no advantage to an aligment higher than 4, so a frontend
could choose to compact the argument layout. Similarly, there is a
high penalty to using an alignment lower than 4, so a frontend could
opt into more padding for small arguments.
Another design consideration is when it is appropriate to expose the
fact that these arguments are all really passed in adjacent
memory. Currently we have a late IR optimization pass in codegen to
rewrite the kernel argument values into explicit loads to enable
vectorization. In most programs, unrelated argument loads can be
merged together. However, exposing this property directly from the
frontend has some disadvantages. We still need a way to track the
original argument sizes and alignments to report to the driver. I find
using some side-channel, metadata mechanism to track this
unappealing. If the kernel arguments were exposed as a single buffer
to begin with, alias analysis would be unaware that the padding bits
betewen arguments are meaningless. Another family of problems is there
are still some gaps in replacing all of the available parameter
attributes with metadata equivalents once lowered to loads.
The immediate plan is to start using this new attribute to handle all
aggregate argumets for kernels. Long term, it makes sense to migrate
all kernel arguments, including scalars, to be passed indirectly in
the same manner.
Additional context is in D79744.
2020-06-05 22:58:47 +02:00
|
|
|
.addByRefAttr(Ty);
|
2013-01-26 00:09:36 +01:00
|
|
|
|
2020-09-08 17:13:11 +02:00
|
|
|
// Some attributes can apply to all "values" but there are no `void` values.
|
|
|
|
if (Ty->isVoidTy())
|
|
|
|
Incompatible.addAttribute(Attribute::NoUndef);
|
|
|
|
|
2015-05-07 01:19:56 +02:00
|
|
|
return Incompatible;
|
2013-01-26 00:09:36 +01:00
|
|
|
}
|
2015-12-23 00:57:37 +01:00
|
|
|
|
|
|
|
template<typename AttrClass>
|
|
|
|
static bool isEqual(const Function &Caller, const Function &Callee) {
|
|
|
|
return Caller.getFnAttribute(AttrClass::getKind()) ==
|
|
|
|
Callee.getFnAttribute(AttrClass::getKind());
|
|
|
|
}
|
|
|
|
|
2018-05-01 17:54:18 +02:00
|
|
|
/// Compute the logical AND of the attributes of the caller and the
|
2015-12-23 00:57:37 +01:00
|
|
|
/// callee.
|
|
|
|
///
|
|
|
|
/// This function sets the caller's attribute to false if the callee's attribute
|
|
|
|
/// is false.
|
|
|
|
template<typename AttrClass>
|
|
|
|
static void setAND(Function &Caller, const Function &Callee) {
|
|
|
|
if (AttrClass::isSet(Caller, AttrClass::getKind()) &&
|
|
|
|
!AttrClass::isSet(Callee, AttrClass::getKind()))
|
|
|
|
AttrClass::set(Caller, AttrClass::getKind(), false);
|
|
|
|
}
|
|
|
|
|
2018-05-01 17:54:18 +02:00
|
|
|
/// Compute the logical OR of the attributes of the caller and the
|
2015-12-23 00:57:37 +01:00
|
|
|
/// callee.
|
|
|
|
///
|
|
|
|
/// This function sets the caller's attribute to true if the callee's attribute
|
|
|
|
/// is true.
|
|
|
|
template<typename AttrClass>
|
|
|
|
static void setOR(Function &Caller, const Function &Callee) {
|
|
|
|
if (!AttrClass::isSet(Caller, AttrClass::getKind()) &&
|
|
|
|
AttrClass::isSet(Callee, AttrClass::getKind()))
|
|
|
|
AttrClass::set(Caller, AttrClass::getKind(), true);
|
|
|
|
}
|
|
|
|
|
2018-05-01 17:54:18 +02:00
|
|
|
/// If the inlined function had a higher stack protection level than the
|
2015-12-23 00:57:37 +01:00
|
|
|
/// calling function, then bump up the caller's stack protection level.
|
|
|
|
static void adjustCallerSSPLevel(Function &Caller, const Function &Callee) {
|
2020-12-02 19:44:35 +01:00
|
|
|
#ifndef NDEBUG
|
|
|
|
if (!Callee.hasFnAttribute(Attribute::AlwaysInline)) {
|
|
|
|
assert(!(!Callee.hasStackProtectorFnAttr() &&
|
|
|
|
Caller.hasStackProtectorFnAttr()) &&
|
|
|
|
"stack protected caller but callee requested no stack protector");
|
|
|
|
assert(!(!Caller.hasStackProtectorFnAttr() &&
|
|
|
|
Callee.hasStackProtectorFnAttr()) &&
|
|
|
|
"stack protected callee but caller requested no stack protector");
|
|
|
|
}
|
|
|
|
#endif
|
2015-12-23 00:57:37 +01:00
|
|
|
// If upgrading the SSP attribute, clear out the old SSP Attributes first.
|
2020-11-18 02:17:44 +01:00
|
|
|
// Having multiple SSP attributes doesn't actually hurt, but it adds useless
|
|
|
|
// clutter to the IR.
|
2017-05-03 00:07:37 +02:00
|
|
|
AttrBuilder OldSSPAttr;
|
|
|
|
OldSSPAttr.addAttribute(Attribute::StackProtect)
|
|
|
|
.addAttribute(Attribute::StackProtectStrong)
|
|
|
|
.addAttribute(Attribute::StackProtectReq);
|
2015-12-23 00:57:37 +01:00
|
|
|
|
2016-04-12 00:27:48 +02:00
|
|
|
if (Callee.hasFnAttribute(Attribute::StackProtectReq)) {
|
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-21 17:57:19 +01:00
|
|
|
Caller.removeAttributes(AttributeList::FunctionIndex, OldSSPAttr);
|
2015-12-23 00:57:37 +01:00
|
|
|
Caller.addFnAttr(Attribute::StackProtectReq);
|
|
|
|
} else if (Callee.hasFnAttribute(Attribute::StackProtectStrong) &&
|
|
|
|
!Caller.hasFnAttribute(Attribute::StackProtectReq)) {
|
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-21 17:57:19 +01:00
|
|
|
Caller.removeAttributes(AttributeList::FunctionIndex, OldSSPAttr);
|
2015-12-23 00:57:37 +01:00
|
|
|
Caller.addFnAttr(Attribute::StackProtectStrong);
|
|
|
|
} else if (Callee.hasFnAttribute(Attribute::StackProtect) &&
|
|
|
|
!Caller.hasFnAttribute(Attribute::StackProtectReq) &&
|
|
|
|
!Caller.hasFnAttribute(Attribute::StackProtectStrong))
|
|
|
|
Caller.addFnAttr(Attribute::StackProtect);
|
|
|
|
}
|
|
|
|
|
2018-05-01 17:54:18 +02:00
|
|
|
/// If the inlined function required stack probes, then ensure that
|
2017-06-21 20:46:50 +02:00
|
|
|
/// the calling function has those too.
|
|
|
|
static void adjustCallerStackProbes(Function &Caller, const Function &Callee) {
|
2017-06-23 01:22:36 +02:00
|
|
|
if (!Caller.hasFnAttribute("probe-stack") &&
|
|
|
|
Callee.hasFnAttribute("probe-stack")) {
|
|
|
|
Caller.addFnAttr(Callee.getFnAttribute("probe-stack"));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-05-01 17:54:18 +02:00
|
|
|
/// If the inlined function defines the size of guard region
|
2017-06-23 01:22:36 +02:00
|
|
|
/// on the stack, then ensure that the calling function defines a guard region
|
|
|
|
/// that is no larger.
|
|
|
|
static void
|
|
|
|
adjustCallerStackProbeSize(Function &Caller, const Function &Callee) {
|
2020-08-29 08:15:34 +02:00
|
|
|
Attribute CalleeAttr = Callee.getFnAttribute("stack-probe-size");
|
|
|
|
if (CalleeAttr.isValid()) {
|
|
|
|
Attribute CallerAttr = Caller.getFnAttribute("stack-probe-size");
|
|
|
|
if (CallerAttr.isValid()) {
|
|
|
|
uint64_t CallerStackProbeSize, CalleeStackProbeSize;
|
|
|
|
CallerAttr.getValueAsString().getAsInteger(0, CallerStackProbeSize);
|
|
|
|
CalleeAttr.getValueAsString().getAsInteger(0, CalleeStackProbeSize);
|
|
|
|
|
2017-06-23 01:22:36 +02:00
|
|
|
if (CallerStackProbeSize > CalleeStackProbeSize) {
|
2020-08-29 08:15:34 +02:00
|
|
|
Caller.addFnAttr(CalleeAttr);
|
2017-06-23 01:22:36 +02:00
|
|
|
}
|
|
|
|
} else {
|
2020-08-29 08:15:34 +02:00
|
|
|
Caller.addFnAttr(CalleeAttr);
|
2017-06-23 01:22:36 +02:00
|
|
|
}
|
|
|
|
}
|
2017-06-21 20:46:50 +02:00
|
|
|
}
|
|
|
|
|
2018-07-24 20:49:00 +02:00
|
|
|
/// If the inlined function defines a min legal vector width, then ensure
|
2018-11-29 08:27:38 +01:00
|
|
|
/// the calling function has the same or larger min legal vector width. If the
|
|
|
|
/// caller has the attribute, but the callee doesn't, we need to remove the
|
|
|
|
/// attribute from the caller since we can't make any guarantees about the
|
|
|
|
/// caller's requirements.
|
|
|
|
/// This function is called after the inlining decision has been made so we have
|
|
|
|
/// to merge the attribute this way. Heuristics that would use
|
2018-07-24 20:49:00 +02:00
|
|
|
/// min-legal-vector-width to determine inline compatibility would need to be
|
|
|
|
/// handled as part of inline cost analysis.
|
|
|
|
static void
|
|
|
|
adjustMinLegalVectorWidth(Function &Caller, const Function &Callee) {
|
2020-08-29 08:15:34 +02:00
|
|
|
Attribute CallerAttr = Caller.getFnAttribute("min-legal-vector-width");
|
|
|
|
if (CallerAttr.isValid()) {
|
|
|
|
Attribute CalleeAttr = Callee.getFnAttribute("min-legal-vector-width");
|
|
|
|
if (CalleeAttr.isValid()) {
|
|
|
|
uint64_t CallerVectorWidth, CalleeVectorWidth;
|
|
|
|
CallerAttr.getValueAsString().getAsInteger(0, CallerVectorWidth);
|
|
|
|
CalleeAttr.getValueAsString().getAsInteger(0, CalleeVectorWidth);
|
2018-11-29 08:27:38 +01:00
|
|
|
if (CallerVectorWidth < CalleeVectorWidth)
|
2020-08-29 08:15:34 +02:00
|
|
|
Caller.addFnAttr(CalleeAttr);
|
2018-07-24 20:49:00 +02:00
|
|
|
} else {
|
2018-11-29 08:27:38 +01:00
|
|
|
// If the callee doesn't have the attribute then we don't know anything
|
|
|
|
// and must drop the attribute from the caller.
|
|
|
|
Caller.removeFnAttr("min-legal-vector-width");
|
2018-07-24 20:49:00 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-04-25 12:57:07 +02:00
|
|
|
/// If the inlined function has null_pointer_is_valid attribute,
|
2018-07-30 21:33:53 +02:00
|
|
|
/// set this attribute in the caller post inlining.
|
|
|
|
static void
|
|
|
|
adjustNullPointerValidAttr(Function &Caller, const Function &Callee) {
|
|
|
|
if (Callee.nullPointerIsDefined() && !Caller.nullPointerIsDefined()) {
|
2020-04-25 12:57:07 +02:00
|
|
|
Caller.addFnAttr(Attribute::NullPointerIsValid);
|
2018-07-30 21:33:53 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-02-02 14:46:50 +01:00
|
|
|
struct EnumAttr {
|
|
|
|
static bool isSet(const Function &Fn,
|
|
|
|
Attribute::AttrKind Kind) {
|
|
|
|
return Fn.hasFnAttribute(Kind);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void set(Function &Fn,
|
|
|
|
Attribute::AttrKind Kind, bool Val) {
|
|
|
|
if (Val)
|
|
|
|
Fn.addFnAttr(Kind);
|
|
|
|
else
|
|
|
|
Fn.removeFnAttr(Kind);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
struct StrBoolAttr {
|
|
|
|
static bool isSet(const Function &Fn,
|
|
|
|
StringRef Kind) {
|
|
|
|
auto A = Fn.getFnAttribute(Kind);
|
|
|
|
return A.getValueAsString().equals("true");
|
|
|
|
}
|
|
|
|
|
|
|
|
static void set(Function &Fn,
|
|
|
|
StringRef Kind, bool Val) {
|
|
|
|
Fn.addFnAttr(Kind, Val ? "true" : "false");
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
#define GET_ATTR_NAMES
|
|
|
|
#define ATTRIBUTE_ENUM(ENUM_NAME, DISPLAY_NAME) \
|
|
|
|
struct ENUM_NAME##Attr : EnumAttr { \
|
|
|
|
static enum Attribute::AttrKind getKind() { \
|
|
|
|
return llvm::Attribute::ENUM_NAME; \
|
|
|
|
} \
|
|
|
|
};
|
|
|
|
#define ATTRIBUTE_STRBOOL(ENUM_NAME, DISPLAY_NAME) \
|
|
|
|
struct ENUM_NAME##Attr : StrBoolAttr { \
|
|
|
|
static StringRef getKind() { return #DISPLAY_NAME; } \
|
|
|
|
};
|
|
|
|
#include "llvm/IR/Attributes.inc"
|
|
|
|
|
2015-12-23 00:57:37 +01:00
|
|
|
#define GET_ATTR_COMPAT_FUNC
|
2020-02-02 14:46:50 +01:00
|
|
|
#include "llvm/IR/Attributes.inc"
|
2015-12-23 00:57:37 +01:00
|
|
|
|
|
|
|
bool AttributeFuncs::areInlineCompatible(const Function &Caller,
|
|
|
|
const Function &Callee) {
|
|
|
|
return hasCompatibleFnAttrs(Caller, Callee);
|
|
|
|
}
|
|
|
|
|
2020-08-24 10:24:59 +02:00
|
|
|
bool AttributeFuncs::areOutlineCompatible(const Function &A,
|
|
|
|
const Function &B) {
|
|
|
|
return hasCompatibleFnAttrs(A, B);
|
|
|
|
}
|
|
|
|
|
2015-12-23 00:57:37 +01:00
|
|
|
void AttributeFuncs::mergeAttributesForInlining(Function &Caller,
|
|
|
|
const Function &Callee) {
|
|
|
|
mergeFnAttrs(Caller, Callee);
|
|
|
|
}
|
2020-08-24 10:24:59 +02:00
|
|
|
|
|
|
|
void AttributeFuncs::mergeAttributesForOutlining(Function &Base,
|
|
|
|
const Function &ToMerge) {
|
|
|
|
|
|
|
|
// We merge functions so that they meet the most general case.
|
|
|
|
// For example, if the NoNansFPMathAttr is set in one function, but not in
|
|
|
|
// the other, in the merged function we can say that the NoNansFPMathAttr
|
|
|
|
// is not set.
|
|
|
|
// However if we have the SpeculativeLoadHardeningAttr set true in one
|
|
|
|
// function, but not the other, we make sure that the function retains
|
|
|
|
// that aspect in the merged function.
|
|
|
|
mergeFnAttrs(Base, ToMerge);
|
|
|
|
}
|