blob: 74eb9e19e9dd6d36433fab2e45da8618d39ec7a8 [file] [log] [blame]
Andrew Kayloraa641a52016-04-22 22:06:11 +00001//===------- llvm/IR/OptBisect/Bisect.cpp - LLVM Bisect support --------===//
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/// \file
11/// This file implements support for a bisecting optimizations based on a
12/// command line option.
13///
14//===----------------------------------------------------------------------===//
15
16#include "llvm/Analysis/CallGraphSCCPass.h"
17#include "llvm/Analysis/LazyCallGraph.h"
18#include "llvm/Analysis/LoopInfo.h"
19#include "llvm/IR/Module.h"
20#include "llvm/IR/OptBisect.h"
21#include "llvm/Pass.h"
22#include "llvm/Support/CommandLine.h"
23#include "llvm/Support/raw_ostream.h"
24
25using namespace llvm;
26
27static cl::opt<int> OptBisectLimit("opt-bisect-limit", cl::Hidden,
28 cl::init(INT_MAX), cl::Optional,
29 cl::desc("Maximum optimization to perform"));
30
31OptBisect::OptBisect() {
32 BisectEnabled = OptBisectLimit != INT_MAX;
33}
34
35static void printPassMessage(const StringRef &Name, int PassNum,
36 StringRef TargetDesc, bool Running) {
37 StringRef Status = Running ? "" : "NOT ";
38 errs() << "BISECT: " << Status << "running pass "
39 << "(" << PassNum << ") " << Name << " on " << TargetDesc << "\n";
40}
41
42static void printCaseMessage(int CaseNum, StringRef Msg, bool Running) {
43 if (Running)
44 errs() << "BISECT: running case (";
45 else
46 errs() << "BISECT: NOT running case (";
47 errs() << CaseNum << "): " << Msg << "\n";
48}
49
50static std::string getDescription(const Module &M) {
51 return "module (" + M.getName().str() + ")";
52}
53
54static std::string getDescription(const Function &F) {
55 return "function (" + F.getName().str() + ")";
56}
57
58static std::string getDescription(const BasicBlock &BB) {
59 return "basic block (" + BB.getName().str() + ") in function (" +
60 BB.getParent()->getName().str() + ")";
61}
62
63static std::string getDescription(const Loop &L) {
64 // FIXME: I'd like to be able to provide a better description here, but
65 // calling L->getHeader() would introduce a new dependency on the
66 // LLVMCore library.
67 return "loop";
68}
69
70static std::string getDescription(const CallGraphSCC &SCC) {
71 std::string Desc = "SCC (";
72 bool First = true;
73 for (CallGraphNode *CGN : SCC) {
74 if (First)
75 First = false;
76 else
77 Desc += ", ";
78 Function *F = CGN->getFunction();
79 if (F)
80 Desc += F->getName();
81 else
82 Desc += "<<null function>>";
83 }
84 Desc += ")";
85 return Desc;
86}
87
88static std::string getDescription(const LazyCallGraph::SCC &SCC) {
89 std::string Desc = "SCC (";
90 bool First = true;
91 for (LazyCallGraph::Node &CGN : SCC) {
92 if (First)
93 First = false;
94 else
95 Desc += ", ";
96 Function &F = CGN.getFunction();
97 Desc += F.getName();
98 }
99 Desc += ")";
100 return Desc;
101}
102
103// Force instantiations.
104template bool OptBisect::shouldRunPass(const Pass *, const Module &);
105template bool OptBisect::shouldRunPass(const Pass *, const Function &);
106template bool OptBisect::shouldRunPass(const Pass *, const BasicBlock &);
107template bool OptBisect::shouldRunPass(const Pass *, const Loop &);
108template bool OptBisect::shouldRunPass(const Pass *, const CallGraphSCC &);
109
110template <class UnitT>
111bool OptBisect::shouldRunPass(const Pass *P, const UnitT &U) {
112 if (!BisectEnabled)
113 return true;
114 return checkPass(P->getPassName(), getDescription(U));
115}
116
117bool OptBisect::checkPass(const StringRef PassName,
118 const StringRef TargetDesc) {
119 assert(BisectEnabled);
120
121 int CurBisectNum = ++LastBisectNum;
122 bool ShouldRun = (OptBisectLimit == -1 || CurBisectNum <= OptBisectLimit);
123 printPassMessage(PassName, CurBisectNum, TargetDesc, ShouldRun);
124 return ShouldRun;
125}
126
127bool OptBisect::shouldRunCase(const Twine &Msg) {
128 if (!BisectEnabled)
129 return true;
130 int CurFuelNum = ++LastBisectNum;
131 bool ShouldRun = (OptBisectLimit == -1 || CurFuelNum <= OptBisectLimit);
132 printCaseMessage(CurFuelNum, Msg.str(), ShouldRun);
133 return ShouldRun;
134}
135