2017-09-20 12:25:58 +08:00
|
|
|
//===- AMDGPUInline.cpp - Code to perform simple function inlining --------===//
|
|
|
|
//
|
2019-01-19 16:50:56 +08:00
|
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
2017-09-20 12:25:58 +08:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
/// \file
|
2018-05-01 23:54:18 +08:00
|
|
|
/// This is AMDGPU specific replacement of the standard inliner.
|
2017-09-20 12:25:58 +08:00
|
|
|
/// The main purpose is to account for the fact that calls not only expensive
|
|
|
|
/// on the AMDGPU, but much more expensive if a private memory pointer is
|
|
|
|
/// passed to a function as an argument. In this situation, we are unable to
|
|
|
|
/// eliminate private memory in the caller unless inlined and end up with slow
|
|
|
|
/// and expensive scratch access. Thus, we boost the inline threshold for such
|
|
|
|
/// functions here.
|
|
|
|
///
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
|
|
|
|
#include "AMDGPU.h"
|
|
|
|
#include "llvm/Transforms/IPO.h"
|
|
|
|
#include "llvm/Analysis/AssumptionCache.h"
|
|
|
|
#include "llvm/Analysis/CallGraph.h"
|
|
|
|
#include "llvm/Analysis/InlineCost.h"
|
|
|
|
#include "llvm/Analysis/ValueTracking.h"
|
|
|
|
#include "llvm/Analysis/TargetTransformInfo.h"
|
|
|
|
#include "llvm/IR/CallSite.h"
|
|
|
|
#include "llvm/IR/DataLayout.h"
|
|
|
|
#include "llvm/IR/Instructions.h"
|
|
|
|
#include "llvm/IR/Module.h"
|
|
|
|
#include "llvm/IR/Type.h"
|
|
|
|
#include "llvm/Support/CommandLine.h"
|
|
|
|
#include "llvm/Support/Debug.h"
|
|
|
|
#include "llvm/Transforms/IPO/Inliner.h"
|
|
|
|
|
|
|
|
using namespace llvm;
|
|
|
|
|
|
|
|
#define DEBUG_TYPE "inline"
|
|
|
|
|
|
|
|
static cl::opt<int>
|
|
|
|
ArgAllocaCost("amdgpu-inline-arg-alloca-cost", cl::Hidden, cl::init(2200),
|
|
|
|
cl::desc("Cost of alloca argument"));
|
|
|
|
|
|
|
|
// If the amount of scratch memory to eliminate exceeds our ability to allocate
|
2018-11-07 22:35:36 +08:00
|
|
|
// it into registers we gain nothing by aggressively inlining functions for that
|
2017-09-20 12:25:58 +08:00
|
|
|
// heuristic.
|
|
|
|
static cl::opt<unsigned>
|
|
|
|
ArgAllocaCutoff("amdgpu-inline-arg-alloca-cutoff", cl::Hidden, cl::init(256),
|
|
|
|
cl::desc("Maximum alloca size to use for inline cost"));
|
|
|
|
|
|
|
|
namespace {
|
|
|
|
|
|
|
|
class AMDGPUInliner : public LegacyInlinerBase {
|
|
|
|
|
|
|
|
public:
|
|
|
|
AMDGPUInliner() : LegacyInlinerBase(ID) {
|
|
|
|
initializeAMDGPUInlinerPass(*PassRegistry::getPassRegistry());
|
|
|
|
Params = getInlineParams();
|
|
|
|
}
|
|
|
|
|
|
|
|
static char ID; // Pass identification, replacement for typeid
|
|
|
|
|
|
|
|
unsigned getInlineThreshold(CallSite CS) const;
|
|
|
|
|
|
|
|
InlineCost getInlineCost(CallSite CS) override;
|
|
|
|
|
|
|
|
bool runOnSCC(CallGraphSCC &SCC) override;
|
|
|
|
|
|
|
|
void getAnalysisUsage(AnalysisUsage &AU) const override;
|
|
|
|
|
|
|
|
private:
|
|
|
|
TargetTransformInfoWrapperPass *TTIWP;
|
|
|
|
|
|
|
|
InlineParams Params;
|
|
|
|
};
|
|
|
|
|
|
|
|
} // end anonymous namespace
|
|
|
|
|
|
|
|
char AMDGPUInliner::ID = 0;
|
|
|
|
INITIALIZE_PASS_BEGIN(AMDGPUInliner, "amdgpu-inline",
|
|
|
|
"AMDGPU Function Integration/Inlining", false, false)
|
|
|
|
INITIALIZE_PASS_DEPENDENCY(AssumptionCacheTracker)
|
|
|
|
INITIALIZE_PASS_DEPENDENCY(CallGraphWrapperPass)
|
|
|
|
INITIALIZE_PASS_DEPENDENCY(ProfileSummaryInfoWrapperPass)
|
|
|
|
INITIALIZE_PASS_DEPENDENCY(TargetTransformInfoWrapperPass)
|
|
|
|
INITIALIZE_PASS_DEPENDENCY(TargetLibraryInfoWrapperPass)
|
|
|
|
INITIALIZE_PASS_END(AMDGPUInliner, "amdgpu-inline",
|
|
|
|
"AMDGPU Function Integration/Inlining", false, false)
|
|
|
|
|
|
|
|
Pass *llvm::createAMDGPUFunctionInliningPass() { return new AMDGPUInliner(); }
|
|
|
|
|
|
|
|
bool AMDGPUInliner::runOnSCC(CallGraphSCC &SCC) {
|
|
|
|
TTIWP = &getAnalysis<TargetTransformInfoWrapperPass>();
|
|
|
|
return LegacyInlinerBase::runOnSCC(SCC);
|
|
|
|
}
|
|
|
|
|
|
|
|
void AMDGPUInliner::getAnalysisUsage(AnalysisUsage &AU) const {
|
|
|
|
AU.addRequired<TargetTransformInfoWrapperPass>();
|
|
|
|
LegacyInlinerBase::getAnalysisUsage(AU);
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned AMDGPUInliner::getInlineThreshold(CallSite CS) const {
|
|
|
|
int Thres = Params.DefaultThreshold;
|
|
|
|
|
|
|
|
Function *Caller = CS.getCaller();
|
|
|
|
// Listen to the inlinehint attribute when it would increase the threshold
|
|
|
|
// and the caller does not need to minimize its size.
|
|
|
|
Function *Callee = CS.getCalledFunction();
|
|
|
|
bool InlineHint = Callee && !Callee->isDeclaration() &&
|
|
|
|
Callee->hasFnAttribute(Attribute::InlineHint);
|
|
|
|
if (InlineHint && Params.HintThreshold && Params.HintThreshold > Thres
|
|
|
|
&& !Caller->hasFnAttribute(Attribute::MinSize))
|
|
|
|
Thres = Params.HintThreshold.getValue();
|
|
|
|
|
|
|
|
const DataLayout &DL = Caller->getParent()->getDataLayout();
|
|
|
|
if (!Callee)
|
|
|
|
return (unsigned)Thres;
|
|
|
|
|
|
|
|
// If we have a pointer to private array passed into a function
|
|
|
|
// it will not be optimized out, leaving scratch usage.
|
|
|
|
// Increase the inline threshold to allow inliniting in this case.
|
|
|
|
uint64_t AllocaSize = 0;
|
|
|
|
SmallPtrSet<const AllocaInst *, 8> AIVisited;
|
|
|
|
for (Value *PtrArg : CS.args()) {
|
|
|
|
Type *Ty = PtrArg->getType();
|
|
|
|
if (!Ty->isPointerTy() ||
|
2018-08-31 13:49:54 +08:00
|
|
|
Ty->getPointerAddressSpace() != AMDGPUAS::PRIVATE_ADDRESS)
|
2017-09-20 12:25:58 +08:00
|
|
|
continue;
|
|
|
|
PtrArg = GetUnderlyingObject(PtrArg, DL);
|
|
|
|
if (const AllocaInst *AI = dyn_cast<AllocaInst>(PtrArg)) {
|
|
|
|
if (!AI->isStaticAlloca() || !AIVisited.insert(AI).second)
|
|
|
|
continue;
|
|
|
|
AllocaSize += DL.getTypeAllocSize(AI->getAllocatedType());
|
|
|
|
// If the amount of stack memory is excessive we will not be able
|
|
|
|
// to get rid of the scratch anyway, bail out.
|
|
|
|
if (AllocaSize > ArgAllocaCutoff) {
|
|
|
|
AllocaSize = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (AllocaSize)
|
|
|
|
Thres += ArgAllocaCost;
|
|
|
|
|
|
|
|
return (unsigned)Thres;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check if call is just a wrapper around another call.
|
|
|
|
// In this case we only have call and ret instructions.
|
|
|
|
static bool isWrapperOnlyCall(CallSite CS) {
|
|
|
|
Function *Callee = CS.getCalledFunction();
|
|
|
|
if (!Callee || Callee->size() != 1)
|
|
|
|
return false;
|
|
|
|
const BasicBlock &BB = Callee->getEntryBlock();
|
|
|
|
if (const Instruction *I = BB.getFirstNonPHI()) {
|
|
|
|
if (!isa<CallInst>(I)) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
if (isa<ReturnInst>(*std::next(I->getIterator()))) {
|
2018-05-14 20:53:11 +08:00
|
|
|
LLVM_DEBUG(dbgs() << " Wrapper only call detected: "
|
|
|
|
<< Callee->getName() << '\n');
|
2017-09-20 12:25:58 +08:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
InlineCost AMDGPUInliner::getInlineCost(CallSite CS) {
|
|
|
|
Function *Callee = CS.getCalledFunction();
|
|
|
|
Function *Caller = CS.getCaller();
|
|
|
|
TargetTransformInfo &TTI = TTIWP->getTTI(*Callee);
|
|
|
|
|
Enrich inline messages
Summary:
This patch improves Inliner to provide causes/reasons for negative inline decisions.
1. It adds one new message field to InlineCost to report causes for Always and Never instances. All Never and Always instantiations must provide a simple message.
2. Several functions that used to return the inlining results as boolean are changed to return InlineResult which carries the cause for negative decision.
3. Changed remark priniting and debug output messages to provide the additional messages and related inline cost.
4. Adjusted tests for changed printing.
Patch by: yrouban (Yevgeny Rouban)
Reviewers: craig.topper, sammccall, sgraenitz, NutshellySima, shchenz, chandlerc, apilipenko, javed.absar, tejohnson, dblaikie, sanjoy, eraman, xbolva00
Reviewed By: tejohnson, xbolva00
Subscribers: xbolva00, llvm-commits, arsenm, mehdi_amini, eraman, haicheng, steven_wu, dexonsmith
Differential Revision: https://reviews.llvm.org/D49412
llvm-svn: 338969
2018-08-05 22:53:08 +08:00
|
|
|
if (!Callee || Callee->isDeclaration())
|
|
|
|
return llvm::InlineCost::getNever("undefined callee");
|
|
|
|
|
|
|
|
if (CS.isNoInline())
|
|
|
|
return llvm::InlineCost::getNever("noinline");
|
|
|
|
|
|
|
|
if (!TTI.areInlineCompatible(Caller, Callee))
|
|
|
|
return llvm::InlineCost::getNever("incompatible");
|
2017-09-20 12:25:58 +08:00
|
|
|
|
|
|
|
if (CS.hasFnAttr(Attribute::AlwaysInline)) {
|
2019-02-01 18:44:43 +08:00
|
|
|
auto IsViable = isInlineViable(*Callee);
|
|
|
|
if (IsViable)
|
Enrich inline messages
Summary:
This patch improves Inliner to provide causes/reasons for negative inline decisions.
1. It adds one new message field to InlineCost to report causes for Always and Never instances. All Never and Always instantiations must provide a simple message.
2. Several functions that used to return the inlining results as boolean are changed to return InlineResult which carries the cause for negative decision.
3. Changed remark priniting and debug output messages to provide the additional messages and related inline cost.
4. Adjusted tests for changed printing.
Patch by: yrouban (Yevgeny Rouban)
Reviewers: craig.topper, sammccall, sgraenitz, NutshellySima, shchenz, chandlerc, apilipenko, javed.absar, tejohnson, dblaikie, sanjoy, eraman, xbolva00
Reviewed By: tejohnson, xbolva00
Subscribers: xbolva00, llvm-commits, arsenm, mehdi_amini, eraman, haicheng, steven_wu, dexonsmith
Differential Revision: https://reviews.llvm.org/D49412
llvm-svn: 338969
2018-08-05 22:53:08 +08:00
|
|
|
return llvm::InlineCost::getAlways("alwaysinline viable");
|
2019-02-01 18:44:43 +08:00
|
|
|
return llvm::InlineCost::getNever(IsViable.message);
|
2017-09-20 12:25:58 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
if (isWrapperOnlyCall(CS))
|
Enrich inline messages
Summary:
This patch improves Inliner to provide causes/reasons for negative inline decisions.
1. It adds one new message field to InlineCost to report causes for Always and Never instances. All Never and Always instantiations must provide a simple message.
2. Several functions that used to return the inlining results as boolean are changed to return InlineResult which carries the cause for negative decision.
3. Changed remark priniting and debug output messages to provide the additional messages and related inline cost.
4. Adjusted tests for changed printing.
Patch by: yrouban (Yevgeny Rouban)
Reviewers: craig.topper, sammccall, sgraenitz, NutshellySima, shchenz, chandlerc, apilipenko, javed.absar, tejohnson, dblaikie, sanjoy, eraman, xbolva00
Reviewed By: tejohnson, xbolva00
Subscribers: xbolva00, llvm-commits, arsenm, mehdi_amini, eraman, haicheng, steven_wu, dexonsmith
Differential Revision: https://reviews.llvm.org/D49412
llvm-svn: 338969
2018-08-05 22:53:08 +08:00
|
|
|
return llvm::InlineCost::getAlways("wrapper-only call");
|
2017-09-20 12:25:58 +08:00
|
|
|
|
|
|
|
InlineParams LocalParams = Params;
|
|
|
|
LocalParams.DefaultThreshold = (int)getInlineThreshold(CS);
|
|
|
|
bool RemarksEnabled = false;
|
|
|
|
const auto &BBs = Caller->getBasicBlockList();
|
|
|
|
if (!BBs.empty()) {
|
|
|
|
auto DI = OptimizationRemark(DEBUG_TYPE, "", DebugLoc(), &BBs.front());
|
|
|
|
if (DI.isEnabled())
|
|
|
|
RemarksEnabled = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
OptimizationRemarkEmitter ORE(Caller);
|
|
|
|
std::function<AssumptionCache &(Function &)> GetAssumptionCache =
|
|
|
|
[this](Function &F) -> AssumptionCache & {
|
|
|
|
return ACT->getAssumptionCache(F);
|
|
|
|
};
|
|
|
|
|
|
|
|
return llvm::getInlineCost(CS, Callee, LocalParams, TTI, GetAssumptionCache,
|
|
|
|
None, PSI, RemarksEnabled ? &ORE : nullptr);
|
|
|
|
}
|