LLVM  8.0.0svn
Go to the documentation of this file.
1 //===- InlineAlways.cpp - Code to inline always_inline functions ----------===//
2 //
3 // The LLVM Compiler Infrastructure
4 //
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 //
10 // This file implements a custom inliner that handles only functions that
11 // are marked as "always inline".
12 //
13 //===----------------------------------------------------------------------===//
16 #include "llvm/ADT/SetVector.h"
20 #include "llvm/IR/CallSite.h"
21 #include "llvm/IR/CallingConv.h"
22 #include "llvm/IR/DataLayout.h"
23 #include "llvm/IR/Instructions.h"
24 #include "llvm/IR/Module.h"
25 #include "llvm/IR/Type.h"
26 #include "llvm/Transforms/IPO.h"
31 using namespace llvm;
33 #define DEBUG_TYPE "inline"
38  bool Changed = false;
39  SmallVector<Function *, 16> InlinedFunctions;
40  for (Function &F : M)
41  if (!F.isDeclaration() && F.hasFnAttribute(Attribute::AlwaysInline) &&
42  isInlineViable(F)) {
43  Calls.clear();
45  for (User *U : F.users())
46  if (auto CS = CallSite(U))
47  if (CS.getCalledFunction() == &F)
48  Calls.insert(CS);
50  for (CallSite CS : Calls)
51  // FIXME: We really shouldn't be able to fail to inline at this point!
52  // We should do something to log or check the inline failures here.
53  Changed |=
54  InlineFunction(CS, IFI, /*CalleeAAR=*/nullptr, InsertLifetime);
56  // Remember to try and delete this function afterward. This both avoids
57  // re-walking the rest of the module and avoids dealing with any iterator
58  // invalidation issues while deleting functions.
59  InlinedFunctions.push_back(&F);
60  }
62  // Remove any live functions.
63  erase_if(InlinedFunctions, [&](Function *F) {
65  return !F->isDefTriviallyDead();
66  });
68  // Delete the non-comdat ones from the module and also from our vector.
69  auto NonComdatBegin = partition(
70  InlinedFunctions, [&](Function *F) { return F->hasComdat(); });
71  for (Function *F : make_range(NonComdatBegin, InlinedFunctions.end()))
72  M.getFunctionList().erase(F);
73  InlinedFunctions.erase(NonComdatBegin, InlinedFunctions.end());
75  if (!InlinedFunctions.empty()) {
76  // Now we just have the comdat functions. Filter out the ones whose comdats
77  // are not actually dead.
78  filterDeadComdatFunctions(M, InlinedFunctions);
79  // The remaining functions are actually dead.
80  for (Function *F : InlinedFunctions)
81  M.getFunctionList().erase(F);
82  }
84  return Changed ? PreservedAnalyses::none() : PreservedAnalyses::all();
85 }
87 namespace {
89 /// Inliner pass which only handles "always inline" functions.
90 ///
91 /// Unlike the \c AlwaysInlinerPass, this uses the more heavyweight \c Inliner
92 /// base class to provide several facilities such as array alloca merging.
93 class AlwaysInlinerLegacyPass : public LegacyInlinerBase {
95 public:
96  AlwaysInlinerLegacyPass() : LegacyInlinerBase(ID, /*InsertLifetime*/ true) {
98  }
100  AlwaysInlinerLegacyPass(bool InsertLifetime)
101  : LegacyInlinerBase(ID, InsertLifetime) {
103  }
105  /// Main run interface method. We override here to avoid calling skipSCC().
106  bool runOnSCC(CallGraphSCC &SCC) override { return inlineCalls(SCC); }
108  static char ID; // Pass identification, replacement for typeid
110  InlineCost getInlineCost(CallSite CS) override;
113  bool doFinalization(CallGraph &CG) override {
114  return removeDeadFunctions(CG, /*AlwaysInlineOnly=*/true);
115  }
116 };
117 }
120 INITIALIZE_PASS_BEGIN(AlwaysInlinerLegacyPass, "always-inline",
121  "Inliner for always_inline functions", false, false)
126 INITIALIZE_PASS_END(AlwaysInlinerLegacyPass, "always-inline",
127  "Inliner for always_inline functions", false, false)
129 Pass *llvm::createAlwaysInlinerLegacyPass(bool InsertLifetime) {
130  return new AlwaysInlinerLegacyPass(InsertLifetime);
131 }
133 /// Get the inline cost for the always-inliner.
134 ///
135 /// The always inliner *only* handles functions which are marked with the
136 /// attribute to force inlining. As such, it is dramatically simpler and avoids
137 /// using the powerful (but expensive) inline cost analysis. Instead it uses
138 /// a very simple and boring direct walk of the instructions looking for
139 /// impossible-to-inline constructs.
140 ///
141 /// Note, it would be possible to go to some lengths to cache the information
142 /// computed here, but as we only expect to do this for relatively few and
143 /// small functions which have the explicit attribute to force inlining, it is
144 /// likely not worth it in practice.
148  // Only inline direct calls to functions with always-inline attributes
149  // that are viable for inlining. FIXME: We shouldn't even get here for
150  // declarations.
151  if (Callee && !Callee->isDeclaration() &&
152  CS.hasFnAttr(Attribute::AlwaysInline) && isInlineViable(*Callee))
153  return InlineCost::getAlways("always inliner");
155  return InlineCost::getNever("always inliner");
156 }
Pass interface - Implemented by all &#39;passes&#39;.
Definition: Pass.h:81
static PassRegistry * getPassRegistry()
getPassRegistry - Access the global registry object, which is automatically initialized at applicatio...
partial Partial Inliner
Compute iterated dominance frontiers using a linear time algorithm.
Definition: AllocatorList.h:24
A Module instance is used to store all the information related to an LLVM module. ...
Definition: Module.h:64
INITIALIZE_PASS_BEGIN(AlwaysInlinerLegacyPass, "always-inline", "Inliner for always_inline functions", false, false) INITIALIZE_PASS_END(AlwaysInlinerLegacyPass
An immutable pass that tracks lazily created AssumptionCache objects.
InlineResult InlineFunction(CallInst *C, InlineFunctionInfo &IFI, AAResults *CalleeAAR=nullptr, bool InsertLifetime=true)
InlineFunction - This function inlines the called function into the basic block of the caller...
InlineFunctionInfo - This class captures the data input to the InlineFunction call, and records the auxiliary results produced by it.
Definition: Cloning.h:177
Represents the cost of inlining a function.
Definition: InlineCost.h:65
Definition: PassSupport.h:51
An analysis pass based on legacy pass manager to deliver ProfileSummaryInfo.
This class contains all of the helper code which is used to perform the inlining operations that do n...
Definition: Inliner.h:31
bool isInlineViable(Function &Callee)
Minimal filter to detect invalid constructs for inlining.
virtual bool doFinalization(Module &)
doFinalization - Virtual method overriden by subclasses to do any necessary clean up after all passes...
Definition: Pass.h:110
always Inliner for always_inline functions
bool insert(const value_type &X)
Insert a new element into the SetVector.
Definition: SetVector.h:142
auto partition(R &&Range, UnaryPredicate P) -> decltype(adl_begin(Range))
Provide wrappers to std::partition which take ranges instead of having to pass begin/end explicitly...
Definition: STLExtras.h:1131
static InlineCost getAlways(const char *Reason)
Definition: InlineCost.h:93
amdgpu Simplify well known AMD library false Value * Callee
void removeDeadConstantUsers() const
If there are any dead constant users dangling off of this constant, remove them.
Definition: Constants.cpp:536
static PreservedAnalyses none()
Convenience factory function for the empty preserved set.
Definition: PassManager.h:157
A set of analyses that are preserved following a run of a transformation pass.
Definition: PassManager.h:154
The ModulePass which wraps up a CallGraph and the logic to build it.
Definition: CallGraph.h:324
bool hasFnAttr(Attribute::AttrKind Kind) const
Return true if this function has the given attribute.
Definition: CallSite.h:362
Pass * createAlwaysInlinerLegacyPass(bool InsertLifetime=true)
Create a legacy pass manager instance of a pass to inline and remove functions marked as "always_inli...
void initializeAlwaysInlinerLegacyPassPass(PassRegistry &)
iterator erase(const_iterator CI)
Definition: SmallVector.h:445
static PreservedAnalyses all()
Construct a special preserved set that preserves all passes.
Definition: PassManager.h:160
INITIALIZE_PASS_END(RegBankSelect, DEBUG_TYPE, "Assign register bank of generic virtual registers", false, false) RegBankSelect
InlineCost getInlineCost(CallSite CS, const InlineParams &Params, TargetTransformInfo &CalleeTTI, std::function< AssumptionCache &(Function &)> &GetAssumptionCache, Optional< function_ref< BlockFrequencyInfo &(Function &)>> GetBFI, ProfileSummaryInfo *PSI, OptimizationRemarkEmitter *ORE=nullptr)
Get an InlineCost object representing the cost of inlining this callsite.
Provides passes to inlining "always_inline" functions.
iterator_range< T > make_range(T x, T y)
Convenience function for iterating over sub-ranges.
A SetVector that performs no allocations if smaller than a certain size.
Definition: SetVector.h:298
This is a &#39;vector&#39; (really, a variable-sized array), optimized for the case when the array is small...
Definition: SmallVector.h:847
Module.h This file contains the declarations for the Module class.
always inline
PreservedAnalyses run(Module &M, ModuleAnalysisManager &)
void erase_if(Container &C, UnaryPredicate P)
Provide a container algorithm similar to C++ Library Fundamentals v2&#39;s erase_if which is equivalent t...
Definition: STLExtras.h:1186
bool hasComdat() const
Definition: GlobalObject.h:100
void filterDeadComdatFunctions(Module &M, SmallVectorImpl< Function *> &DeadComdatFunctions)
Filter out potentially dead comdat functions where other entries keep the entire comdat group alive...
The basic data container for the call graph of a Module of IR.
Definition: CallGraph.h:74
Definition: SmallVector.h:133
static InlineCost getNever(const char *Reason)
Definition: InlineCost.h:96
LLVM_NODISCARD bool empty() const
Definition: SmallVector.h:56
bool isDeclaration() const
Return true if the primary definition of this global value is outside of the current translation unit...
Definition: Globals.cpp:206
FunTy * getCalledFunction() const
Return the function being called if this is a direct call, otherwise return null (if it&#39;s an indirect...
Definition: CallSite.h:107
CallGraphSCC - This is a single SCC that a CallGraphSCCPass is run on.
A container for analyses that lazily runs them and caches their results.
for(unsigned i=Desc.getNumOperands(), e=OldMI.getNumOperands();i !=e;++i)
bool isDefTriviallyDead() const
isDefTriviallyDead - Return true if it is trivially safe to remove this function definition from the ...
Definition: Function.cpp:1275