mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-11-08 04:07:07 +00:00
f7477470d3
The Caller cost info would be reset everytime a callee was inlined. If the caller has lots of calls and there is some mutual recursion going on, the caller cost info could be calculated many times. This patch reduces inliner runtime from 240s to 0.5s for a function with 20000 small function calls. This is a more conservative version of r98089 that doesn't break the clang test CodeGenCXX/temp-order.cpp. That test relies on rather extreme inlining for constant folding. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@98099 91177308-0d34-0410-b5e6-96231b3b80d8
109 lines
3.2 KiB
C++
109 lines
3.2 KiB
C++
//===- InlineSimple.cpp - Code to perform simple function inlining --------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file implements bottom-up inlining of functions into callees.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#define DEBUG_TYPE "inline"
|
|
#include "llvm/CallingConv.h"
|
|
#include "llvm/Instructions.h"
|
|
#include "llvm/IntrinsicInst.h"
|
|
#include "llvm/Module.h"
|
|
#include "llvm/Type.h"
|
|
#include "llvm/Analysis/CallGraph.h"
|
|
#include "llvm/Analysis/InlineCost.h"
|
|
#include "llvm/Support/CallSite.h"
|
|
#include "llvm/Transforms/IPO.h"
|
|
#include "llvm/Transforms/IPO/InlinerPass.h"
|
|
#include "llvm/ADT/SmallPtrSet.h"
|
|
|
|
using namespace llvm;
|
|
|
|
namespace {
|
|
|
|
class SimpleInliner : public Inliner {
|
|
// Functions that are never inlined
|
|
SmallPtrSet<const Function*, 16> NeverInline;
|
|
InlineCostAnalyzer CA;
|
|
public:
|
|
SimpleInliner() : Inliner(&ID) {}
|
|
SimpleInliner(int Threshold) : Inliner(&ID, Threshold) {}
|
|
static char ID; // Pass identification, replacement for typeid
|
|
InlineCost getInlineCost(CallSite CS) {
|
|
return CA.getInlineCost(CS, NeverInline);
|
|
}
|
|
float getInlineFudgeFactor(CallSite CS) {
|
|
return CA.getInlineFudgeFactor(CS);
|
|
}
|
|
void resetCachedCostInfo(Function *Caller) {
|
|
CA.resetCachedCostInfo(Caller);
|
|
}
|
|
void growCachedCostInfo(Function* Caller, Function* Callee) {
|
|
CA.growCachedCostInfo(Caller, Callee);
|
|
}
|
|
virtual bool doInitialization(CallGraph &CG);
|
|
};
|
|
}
|
|
|
|
char SimpleInliner::ID = 0;
|
|
static RegisterPass<SimpleInliner>
|
|
X("inline", "Function Integration/Inlining");
|
|
|
|
Pass *llvm::createFunctionInliningPass() { return new SimpleInliner(); }
|
|
|
|
Pass *llvm::createFunctionInliningPass(int Threshold) {
|
|
return new SimpleInliner(Threshold);
|
|
}
|
|
|
|
// doInitialization - Initializes the vector of functions that have been
|
|
// annotated with the noinline attribute.
|
|
bool SimpleInliner::doInitialization(CallGraph &CG) {
|
|
|
|
Module &M = CG.getModule();
|
|
|
|
for (Module::iterator I = M.begin(), E = M.end();
|
|
I != E; ++I)
|
|
if (!I->isDeclaration() && I->hasFnAttr(Attribute::NoInline))
|
|
NeverInline.insert(I);
|
|
|
|
// Get llvm.noinline
|
|
GlobalVariable *GV = M.getNamedGlobal("llvm.noinline");
|
|
|
|
if (GV == 0)
|
|
return false;
|
|
|
|
// Don't crash on invalid code
|
|
if (!GV->hasDefinitiveInitializer())
|
|
return false;
|
|
|
|
const ConstantArray *InitList = dyn_cast<ConstantArray>(GV->getInitializer());
|
|
|
|
if (InitList == 0)
|
|
return false;
|
|
|
|
// Iterate over each element and add to the NeverInline set
|
|
for (unsigned i = 0, e = InitList->getNumOperands(); i != e; ++i) {
|
|
|
|
// Get Source
|
|
const Constant *Elt = InitList->getOperand(i);
|
|
|
|
if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(Elt))
|
|
if (CE->getOpcode() == Instruction::BitCast)
|
|
Elt = CE->getOperand(0);
|
|
|
|
// Insert into set of functions to never inline
|
|
if (const Function *F = dyn_cast<Function>(Elt))
|
|
NeverInline.insert(F);
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|