blob: 27c9f52f9eaa1826167b95ab6a3912dbcd285e39 [file] [log] [blame]
Chris Lattnerd075cc22003-08-31 19:10:30 +00001//===- InlineSimple.cpp - Code to perform simple function inlining --------===//
Misha Brukmanb1c93172005-04-21 23:48:37 +00002//
John Criswell482202a2003-10-20 19:43:21 +00003// The LLVM Compiler Infrastructure
4//
Chris Lattnerf3ebc3f2007-12-29 20:36:04 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Misha Brukmanb1c93172005-04-21 23:48:37 +00007//
John Criswell482202a2003-10-20 19:43:21 +00008//===----------------------------------------------------------------------===//
Chris Lattner2f7c9632001-06-06 20:29:01 +00009//
Chris Lattner530d4bf2003-05-29 15:11:31 +000010// This file implements bottom-up inlining of functions into callees.
Chris Lattner1c8d3f82002-04-18 18:52:03 +000011//
Chris Lattner2f7c9632001-06-06 20:29:01 +000012//===----------------------------------------------------------------------===//
13
Chandler Carruthed0881b2012-12-03 16:50:05 +000014#include "llvm/Transforms/IPO.h"
15#include "llvm/Analysis/CallGraph.h"
16#include "llvm/Analysis/InlineCost.h"
Chandler Carruth219b89b2014-03-04 11:01:28 +000017#include "llvm/IR/CallSite.h"
Chandler Carruth9fb823b2013-01-02 11:36:10 +000018#include "llvm/IR/CallingConv.h"
19#include "llvm/IR/DataLayout.h"
20#include "llvm/IR/Instructions.h"
21#include "llvm/IR/IntrinsicInst.h"
22#include "llvm/IR/Module.h"
23#include "llvm/IR/Type.h"
Tanya Lattnerab11b1c2007-06-19 22:29:50 +000024#include "llvm/Transforms/IPO/InlinerPass.h"
Tanya Lattnercb90f1d2007-06-06 21:59:26 +000025
Chris Lattner51c28a52003-11-21 21:46:09 +000026using namespace llvm;
Brian Gaeke960707c2003-11-11 22:41:34 +000027
Chandler Carruth964daaa2014-04-22 02:55:47 +000028#define DEBUG_TYPE "inline"
29
Chris Lattner04805fa2002-02-26 21:46:54 +000030namespace {
Chris Lattner6dc0ae22003-10-06 15:52:43 +000031
David Majnemer927df852013-11-03 11:09:39 +000032/// \brief Actual inliner pass implementation.
Chandler Carruth0df3e532013-01-21 11:39:14 +000033///
34/// The common implementation of the inlining logic is shared between this
35/// inliner pass and the always inliner pass. The two passes use different cost
36/// analyses to determine when to inline.
37class SimpleInliner : public Inliner {
Chandler Carruth4319e292013-01-21 11:39:18 +000038 InlineCostAnalysis *ICA;
Chandler Carruth0df3e532013-01-21 11:39:14 +000039
40public:
Chandler Carruth4319e292013-01-21 11:39:18 +000041 SimpleInliner() : Inliner(ID), ICA(0) {
Chandler Carruth0df3e532013-01-21 11:39:14 +000042 initializeSimpleInlinerPass(*PassRegistry::getPassRegistry());
43 }
44
45 SimpleInliner(int Threshold)
Chandler Carruth4319e292013-01-21 11:39:18 +000046 : Inliner(ID, Threshold, /*InsertLifetime*/ true), ICA(0) {
Chandler Carruth0df3e532013-01-21 11:39:14 +000047 initializeSimpleInlinerPass(*PassRegistry::getPassRegistry());
48 }
49
50 static char ID; // Pass identification, replacement for typeid
51
Craig Topper3e4c6972014-03-05 09:10:37 +000052 InlineCost getInlineCost(CallSite CS) override {
Chandler Carruth4319e292013-01-21 11:39:18 +000053 return ICA->getInlineCost(CS, getInlineThreshold(CS));
Chandler Carruth0df3e532013-01-21 11:39:14 +000054 }
55
Craig Topper3e4c6972014-03-05 09:10:37 +000056 bool runOnSCC(CallGraphSCC &SCC) override;
57 void getAnalysisUsage(AnalysisUsage &AU) const override;
Chandler Carruth0df3e532013-01-21 11:39:14 +000058};
59
Eli Bendersky49f65652014-03-12 16:12:36 +000060static int computeThresholdFromOptLevels(unsigned OptLevel,
61 unsigned SizeOptLevel) {
62 if (OptLevel > 2)
63 return 275;
Eli Bendersky95b540f2014-03-12 16:44:17 +000064 if (SizeOptLevel == 1) // -Os
Eli Bendersky49f65652014-03-12 16:12:36 +000065 return 75;
Eli Bendersky95b540f2014-03-12 16:44:17 +000066 if (SizeOptLevel == 2) // -Oz
Eli Bendersky49f65652014-03-12 16:12:36 +000067 return 25;
68 return 225;
69}
70
Chandler Carruth0df3e532013-01-21 11:39:14 +000071} // end anonymous namespace
Chris Lattner04805fa2002-02-26 21:46:54 +000072
Dan Gohmand78c4002008-05-13 00:00:25 +000073char SimpleInliner::ID = 0;
Owen Anderson071cee02010-10-13 22:00:45 +000074INITIALIZE_PASS_BEGIN(SimpleInliner, "inline",
75 "Function Integration/Inlining", false, false)
Chandler Carruth6378cf52013-11-26 04:19:30 +000076INITIALIZE_PASS_DEPENDENCY(CallGraphWrapperPass)
Chandler Carruth4319e292013-01-21 11:39:18 +000077INITIALIZE_PASS_DEPENDENCY(InlineCostAnalysis)
Owen Anderson071cee02010-10-13 22:00:45 +000078INITIALIZE_PASS_END(SimpleInliner, "inline",
Owen Andersondf7a4f22010-10-07 22:25:06 +000079 "Function Integration/Inlining", false, false)
Dan Gohmand78c4002008-05-13 00:00:25 +000080
Devang Patel13058a52007-01-26 00:47:38 +000081Pass *llvm::createFunctionInliningPass() { return new SimpleInliner(); }
Chris Lattner51c28a52003-11-21 21:46:09 +000082
Andrew Trickcaa500b2011-10-01 01:27:56 +000083Pass *llvm::createFunctionInliningPass(int Threshold) {
Chris Lattner22ad7ab2008-01-12 06:49:13 +000084 return new SimpleInliner(Threshold);
85}
86
Eli Bendersky49f65652014-03-12 16:12:36 +000087Pass *llvm::createFunctionInliningPass(unsigned OptLevel,
88 unsigned SizeOptLevel) {
89 return new SimpleInliner(
90 computeThresholdFromOptLevels(OptLevel, SizeOptLevel));
91}
92
Chandler Carruth4319e292013-01-21 11:39:18 +000093bool SimpleInliner::runOnSCC(CallGraphSCC &SCC) {
94 ICA = &getAnalysis<InlineCostAnalysis>();
95 return Inliner::runOnSCC(SCC);
Tanya Lattnercb90f1d2007-06-06 21:59:26 +000096}
Devang Patel33227112007-07-25 18:00:25 +000097
Chandler Carruth4319e292013-01-21 11:39:18 +000098void SimpleInliner::getAnalysisUsage(AnalysisUsage &AU) const {
99 AU.addRequired<InlineCostAnalysis>();
100 Inliner::getAnalysisUsage(AU);
101}