1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-22 10:42:39 +01:00
llvm-mirror/lib/IR/KnowledgeRetention.cpp

349 lines
12 KiB
C++
Raw Normal View History

//===- KnowledgeRetention.h - utilities to preserve informations *- C++ -*-===//
//
// 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
//
//===----------------------------------------------------------------------===//
#include "llvm/IR/KnowledgeRetention.h"
#include "llvm/ADT/DenseSet.h"
#include "llvm/IR/Function.h"
#include "llvm/IR/InstIterator.h"
#include "llvm/IR/IntrinsicInst.h"
#include "llvm/IR/Module.h"
#include "llvm/Support/CommandLine.h"
using namespace llvm;
cl::opt<bool> ShouldPreserveAllAttributes(
"assume-preserve-all", cl::init(false), cl::Hidden,
cl::desc("enable preservation of all attrbitues. even those that are "
"unlikely to be usefull"));
cl::opt<bool> EnableKnowledgeRetention(
"enable-knowledge-retention", cl::init(false), cl::Hidden,
cl::desc(
"enable preservation of attributes throughout code transformation"));
namespace {
struct AssumedKnowledge {
const char *Name;
Value *Argument;
enum {
None,
Empty,
Tombstone,
};
/// Contain the argument and a flag if needed.
llvm::PointerIntPair<Value *, 2> WasOn;
};
} // namespace
namespace llvm {
template <> struct DenseMapInfo<AssumedKnowledge> {
static AssumedKnowledge getEmptyKey() {
return {nullptr, nullptr, {nullptr, AssumedKnowledge::Empty}};
}
static AssumedKnowledge getTombstoneKey() {
return {nullptr, nullptr, {nullptr, AssumedKnowledge::Tombstone}};
}
static unsigned getHashValue(const AssumedKnowledge &AK) {
return hash_combine(AK.Name, AK.Argument, AK.WasOn.getPointer());
}
static bool isEqual(const AssumedKnowledge &LHS,
const AssumedKnowledge &RHS) {
return LHS.WasOn == RHS.WasOn && LHS.Name == RHS.Name &&
LHS.Argument == RHS.Argument;
}
};
} // namespace llvm
namespace {
/// Index of elements in the operand bundle.
/// If the element exist it is guaranteed to be what is specified in this enum
/// but it may not exist.
enum BundleOpInfoElem {
BOIE_WasOn = 0,
BOIE_Argument = 1,
};
/// Deterministically compare OperandBundleDef.
/// The ordering is:
/// - by the attribute's name aka operand bundle tag, (doesn't change)
/// - then by the numeric Value of the argument, (doesn't change)
/// - lastly by the Name of the current Value it WasOn. (may change)
/// This order is deterministic and allows looking for the right kind of
/// attribute with binary search. However finding the right WasOn needs to be
/// done via linear search because values can get replaced.
bool isLowerOpBundle(const OperandBundleDef &LHS, const OperandBundleDef &RHS) {
auto getTuple = [](const OperandBundleDef &Op) {
return std::make_tuple(
Op.getTag(),
Op.input_size() <= BOIE_Argument
? 0
: cast<ConstantInt>(*(Op.input_begin() + BOIE_Argument))
->getZExtValue(),
Op.input_size() <= BOIE_WasOn
? StringRef("")
: (*(Op.input_begin() + BOIE_WasOn))->getName());
};
return getTuple(LHS) < getTuple(RHS);
}
bool isUsefullToPreserve(Attribute::AttrKind Kind) {
switch (Kind) {
case Attribute::NonNull:
case Attribute::Alignment:
case Attribute::Dereferenceable:
case Attribute::DereferenceableOrNull:
case Attribute::Cold:
return true;
default:
return false;
}
}
/// This class contain all knowledge that have been gather while building an
/// llvm.assume and the function to manipulate it.
struct AssumeBuilderState {
Module *M;
SmallDenseSet<AssumedKnowledge, 8> AssumedKnowledgeSet;
AssumeBuilderState(Module *M) : M(M) {}
void addAttribute(Attribute Attr, Value *WasOn) {
if (!ShouldPreserveAllAttributes &&
(Attr.isTypeAttribute() || Attr.isStringAttribute() ||
!isUsefullToPreserve(Attr.getKindAsEnum())))
return;
StringRef Name;
Value *AttrArg = nullptr;
if (Attr.isStringAttribute())
Name = Attr.getKindAsString();
else
Name = Attribute::getNameFromAttrKind(Attr.getKindAsEnum());
if (Attr.isIntAttribute())
AttrArg = ConstantInt::get(Type::getInt64Ty(M->getContext()),
Attr.getValueAsInt());
AssumedKnowledgeSet.insert(
{Name.data(), AttrArg, {WasOn, AssumedKnowledge::None}});
}
void addCall(const CallBase *Call) {
auto addAttrList = [&](AttributeList AttrList) {
for (unsigned Idx = AttributeList::FirstArgIndex;
Idx < AttrList.getNumAttrSets(); Idx++)
for (Attribute Attr : AttrList.getAttributes(Idx))
addAttribute(Attr, Call->getArgOperand(Idx - 1));
for (Attribute Attr : AttrList.getFnAttributes())
addAttribute(Attr, nullptr);
};
addAttrList(Call->getAttributes());
if (Function *Fn = Call->getCalledFunction())
addAttrList(Fn->getAttributes());
}
IntrinsicInst *build() {
if (AssumedKnowledgeSet.empty())
return nullptr;
Function *FnAssume = Intrinsic::getDeclaration(M, Intrinsic::assume);
LLVMContext &C = M->getContext();
SmallVector<OperandBundleDef, 8> OpBundle;
for (const AssumedKnowledge &Elem : AssumedKnowledgeSet) {
SmallVector<Value *, 2> Args;
assert(Attribute::getAttrKindFromName(Elem.Name) ==
Attribute::AttrKind::None ||
static_cast<bool>(Elem.Argument) ==
Attribute::doesAttrKindHaveArgument(
Attribute::getAttrKindFromName(Elem.Name)));
if (Elem.WasOn.getPointer())
Args.push_back(Elem.WasOn.getPointer());
if (Elem.Argument)
Args.push_back(Elem.Argument);
OpBundle.push_back(OperandBundleDefT<Value *>(Elem.Name, Args));
}
llvm::sort(OpBundle, isLowerOpBundle);
return cast<IntrinsicInst>(CallInst::Create(
FnAssume, ArrayRef<Value *>({ConstantInt::getTrue(C)}), OpBundle));
}
void addAttr(Attribute::AttrKind Kind, Value *Ptr, unsigned Argument = 0) {
AssumedKnowledge AK;
AK.Name = Attribute::getNameFromAttrKind(Kind).data();
AK.WasOn.setPointer(Ptr);
if (Attribute::doesAttrKindHaveArgument(Kind)) {
AK.Argument =
ConstantInt::get(Type::getInt64Ty(M->getContext()), Argument);
} else {
AK.Argument = nullptr;
assert(Argument == 0 && "there should be no argument");
}
AssumedKnowledgeSet.insert(AK);
};
void addLoadOrStore(Instruction *I) {
auto Impl = [&](auto *MemInst, Type *T) {
uint64_t DerefSize =
I->getModule()->getDataLayout().getTypeStoreSize(T).getKnownMinSize();
if (DerefSize != 0) {
addAttr(Attribute::Dereferenceable, MemInst->getPointerOperand(),
DerefSize);
if (!NullPointerIsDefined(MemInst->getFunction(),
MemInst->getPointerOperand()
->getType()
->getPointerAddressSpace()))
addAttr(Attribute::NonNull, MemInst->getPointerOperand());
}
MaybeAlign MA = MemInst->getAlign();
if (MA.valueOrOne() > 1)
addAttr(Attribute::Alignment, MemInst->getPointerOperand(),
MA.valueOrOne().value());
};
if (auto *Load = dyn_cast<LoadInst>(I))
Impl(Load, Load->getType());
if (auto *Store = dyn_cast<StoreInst>(I))
Impl(Store, Store->getValueOperand()->getType());
}
void addInstruction(Instruction *I) {
if (auto *Call = dyn_cast<CallBase>(I))
return addCall(Call);
if (isa<LoadInst>(I) || isa<StoreInst>(I))
return addLoadOrStore(I);
// TODO: Add support for the other Instructions.
// TODO: Maybe we should look around and merge with other llvm.assume.
}
};
} // namespace
IntrinsicInst *llvm::buildAssumeFromInst(Instruction *I) {
if (!EnableKnowledgeRetention)
return nullptr;
AssumeBuilderState Builder(I->getModule());
Builder.addInstruction(I);
return Builder.build();
}
static bool bundleHasArgument(const CallBase::BundleOpInfo &BOI,
unsigned Idx) {
return BOI.End - BOI.Begin > Idx;
}
static Value *getValueFromBundleOpInfo(IntrinsicInst &Assume,
const CallBase::BundleOpInfo &BOI,
unsigned Idx) {
assert(bundleHasArgument(BOI, Idx) && "index out of range");
return (Assume.op_begin() + BOI.Begin + Idx)->get();
}
bool llvm::hasAttributeInAssume(CallInst &AssumeCI, Value *IsOn,
StringRef AttrName, uint64_t *ArgVal,
AssumeQuery AQR) {
assert(isa<IntrinsicInst>(AssumeCI) &&
"this function is intended to be used on llvm.assume");
IntrinsicInst &Assume = cast<IntrinsicInst>(AssumeCI);
assert(Assume.getIntrinsicID() == Intrinsic::assume &&
"this function is intended to be used on llvm.assume");
assert(Attribute::isExistingAttribute(AttrName) &&
"this attribute doesn't exist");
assert((ArgVal == nullptr || Attribute::doesAttrKindHaveArgument(
Attribute::getAttrKindFromName(AttrName))) &&
"requested value for an attribute that has no argument");
if (Assume.bundle_op_infos().empty())
return false;
auto Loop = [&](auto &&Range) {
for (auto &BOI : Range) {
if (BOI.Tag->getKey() != AttrName)
continue;
if (IsOn && (BOI.End - BOI.Begin <= BOIE_WasOn ||
IsOn != getValueFromBundleOpInfo(Assume, BOI, BOIE_WasOn)))
continue;
if (ArgVal) {
assert(BOI.End - BOI.Begin > BOIE_Argument);
*ArgVal = cast<ConstantInt>(
getValueFromBundleOpInfo(Assume, BOI, BOIE_Argument))
->getZExtValue();
}
return true;
}
return false;
};
if (AQR == AssumeQuery::Lowest)
return Loop(Assume.bundle_op_infos());
return Loop(reverse(Assume.bundle_op_infos()));
}
void llvm::fillMapFromAssume(CallInst &AssumeCI, RetainedKnowledgeMap &Result) {
IntrinsicInst &Assume = cast<IntrinsicInst>(AssumeCI);
assert(Assume.getIntrinsicID() == Intrinsic::assume &&
"this function is intended to be used on llvm.assume");
for (auto &Bundles : Assume.bundle_op_infos()) {
std::pair<Value *, Attribute::AttrKind> Key{
nullptr, Attribute::getAttrKindFromName(Bundles.Tag->getKey())};
if (bundleHasArgument(Bundles, BOIE_WasOn))
Key.first = getValueFromBundleOpInfo(Assume, Bundles, BOIE_WasOn);
if (Key.first == nullptr && Key.second == Attribute::None)
continue;
if (!bundleHasArgument(Bundles, BOIE_Argument)) {
Result[Key][&Assume] = {0, 0};
continue;
}
unsigned Val = cast<ConstantInt>(
getValueFromBundleOpInfo(Assume, Bundles, BOIE_Argument))
->getZExtValue();
auto Lookup = Result.find(Key);
if (Lookup == Result.end() || !Lookup->second.count(&Assume)) {
Result[Key][&Assume] = {Val, Val};
continue;
}
Lookup->second[&Assume].Min = std::min(Val, Lookup->second[&Assume].Min);
Lookup->second[&Assume].Max = std::max(Val, Lookup->second[&Assume].Max);
}
}
RetainedKnowledge llvm::getKnowledgeFromOperandInAssume(CallInst &AssumeCI,
unsigned Idx) {
IntrinsicInst &Assume = cast<IntrinsicInst>(AssumeCI);
assert(Assume.getIntrinsicID() == Intrinsic::assume &&
"this function is intended to be used on llvm.assume");
CallBase::BundleOpInfo BOI = Assume.getBundleOpInfoForOperand(Idx);
RetainedKnowledge Result;
Result.AttrKind = Attribute::getAttrKindFromName(BOI.Tag->getKey());
Result.WasOn = getValueFromBundleOpInfo(Assume, BOI, BOIE_WasOn);
if (BOI.End - BOI.Begin > BOIE_Argument)
Result.ArgValue =
cast<ConstantInt>(getValueFromBundleOpInfo(Assume, BOI, BOIE_Argument))
->getZExtValue();
return Result;
}
bool llvm::isAssumeWithEmptyBundle(CallInst &CI) {
IntrinsicInst &Assume = cast<IntrinsicInst>(CI);
assert(Assume.getIntrinsicID() == Intrinsic::assume &&
"this function is intended to be used on llvm.assume");
return none_of(Assume.bundle_op_infos(),
[](const CallBase::BundleOpInfo &BOI) {
return BOI.Tag->getKey() != "ignore";
});
}
PreservedAnalyses AssumeBuilderPass::run(Function &F,
FunctionAnalysisManager &AM) {
for (Instruction &I : instructions(F))
if (Instruction *Assume = buildAssumeFromInst(&I))
Assume->insertBefore(&I);
return PreservedAnalyses::all();
}