blob: c79e1fc2b0b4f039f375ed379a3f6f550a2762fa [file] [log] [blame]
Eugene Zelenko3df2f4a2017-08-31 22:06:09 +00001//===- llvm/IR/OptBisect/Bisect.cpp - LLVM Bisect support -----------------===//
Andrew Kaylor1e455c52016-04-22 22:06:11 +00002//
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//===----------------------------------------------------------------------===//
Eugene Zelenko3df2f4a2017-08-31 22:06:09 +00009//
Andrew Kaylor1e455c52016-04-22 22:06:11 +000010/// \file
11/// This file implements support for a bisecting optimizations based on a
12/// command line option.
Eugene Zelenko3df2f4a2017-08-31 22:06:09 +000013//
Andrew Kaylor1e455c52016-04-22 22:06:11 +000014//===----------------------------------------------------------------------===//
15
Chandler Carruthe3e43d92017-06-06 11:49:48 +000016#include "llvm/IR/OptBisect.h"
Eugene Zelenko3df2f4a2017-08-31 22:06:09 +000017#include "llvm/ADT/StringRef.h"
18#include "llvm/Analysis/CallGraph.h"
Andrew Kaylor1e455c52016-04-22 22:06:11 +000019#include "llvm/Analysis/CallGraphSCCPass.h"
Andrew Kaylor1e455c52016-04-22 22:06:11 +000020#include "llvm/Analysis/LoopInfo.h"
Eli Friedmandca42382017-06-01 21:22:26 +000021#include "llvm/Analysis/RegionInfo.h"
Eugene Zelenko3df2f4a2017-08-31 22:06:09 +000022#include "llvm/IR/BasicBlock.h"
23#include "llvm/IR/Function.h"
Andrew Kaylor1e455c52016-04-22 22:06:11 +000024#include "llvm/IR/Module.h"
Andrew Kaylor1e455c52016-04-22 22:06:11 +000025#include "llvm/Pass.h"
26#include "llvm/Support/CommandLine.h"
27#include "llvm/Support/raw_ostream.h"
Eugene Zelenko3df2f4a2017-08-31 22:06:09 +000028#include <cassert>
29#include <limits>
30#include <string>
Andrew Kaylor1e455c52016-04-22 22:06:11 +000031
32using namespace llvm;
33
34static cl::opt<int> OptBisectLimit("opt-bisect-limit", cl::Hidden,
Eugene Zelenko3df2f4a2017-08-31 22:06:09 +000035 cl::init(std::numeric_limits<int>::max()),
36 cl::Optional,
Andrew Kaylor1e455c52016-04-22 22:06:11 +000037 cl::desc("Maximum optimization to perform"));
38
Fedor Sergeev558f76f2018-03-27 16:57:20 +000039OptBisect::OptBisect() : OptPassGate() {
Eugene Zelenko3df2f4a2017-08-31 22:06:09 +000040 BisectEnabled = OptBisectLimit != std::numeric_limits<int>::max();
Andrew Kaylor1e455c52016-04-22 22:06:11 +000041}
42
43static void printPassMessage(const StringRef &Name, int PassNum,
44 StringRef TargetDesc, bool Running) {
45 StringRef Status = Running ? "" : "NOT ";
46 errs() << "BISECT: " << Status << "running pass "
47 << "(" << PassNum << ") " << Name << " on " << TargetDesc << "\n";
48}
49
Andrew Kaylor1e455c52016-04-22 22:06:11 +000050static 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) {
Eli Friedmandca42382017-06-01 21:22:26 +000064 // FIXME: Move into LoopInfo so we can get a better description
65 // (and avoid a circular dependency between IR and Analysis).
Andrew Kaylor1e455c52016-04-22 22:06:11 +000066 return "loop";
67}
68
Eli Friedmandca42382017-06-01 21:22:26 +000069static std::string getDescription(const Region &R) {
70 // FIXME: Move into RegionInfo so we can get a better description
71 // (and avoid a circular dependency between IR and Analysis).
72 return "region";
73}
74
Andrew Kaylor1e455c52016-04-22 22:06:11 +000075static std::string getDescription(const CallGraphSCC &SCC) {
Eli Friedmandca42382017-06-01 21:22:26 +000076 // FIXME: Move into CallGraphSCCPass to avoid circular dependency between
77 // IR and Analysis.
Andrew Kaylor1e455c52016-04-22 22:06:11 +000078 std::string Desc = "SCC (";
79 bool First = true;
80 for (CallGraphNode *CGN : SCC) {
81 if (First)
82 First = false;
83 else
84 Desc += ", ";
85 Function *F = CGN->getFunction();
86 if (F)
87 Desc += F->getName();
88 else
89 Desc += "<<null function>>";
90 }
91 Desc += ")";
92 return Desc;
93}
94
Fedor Sergeev558f76f2018-03-27 16:57:20 +000095bool OptBisect::shouldRunPass(const Pass *P, const Module &U) {
96 return !BisectEnabled || checkPass(P->getPassName(), getDescription(U));
97}
Andrew Kaylor1e455c52016-04-22 22:06:11 +000098
Fedor Sergeev558f76f2018-03-27 16:57:20 +000099bool OptBisect::shouldRunPass(const Pass *P, const Function &U) {
100 return !BisectEnabled || checkPass(P->getPassName(), getDescription(U));
101}
102
103bool OptBisect::shouldRunPass(const Pass *P, const BasicBlock &U) {
104 return !BisectEnabled || checkPass(P->getPassName(), getDescription(U));
105}
106
107bool OptBisect::shouldRunPass(const Pass *P, const Region &U) {
108 return !BisectEnabled || checkPass(P->getPassName(), getDescription(U));
109}
110
111bool OptBisect::shouldRunPass(const Pass *P, const Loop &U) {
112 return !BisectEnabled || checkPass(P->getPassName(), getDescription(U));
113}
114
115bool OptBisect::shouldRunPass(const Pass *P, const CallGraphSCC &U) {
116 return !BisectEnabled || checkPass(P->getPassName(), getDescription(U));
Andrew Kaylor1e455c52016-04-22 22:06:11 +0000117}
118
119bool OptBisect::checkPass(const StringRef PassName,
120 const StringRef TargetDesc) {
121 assert(BisectEnabled);
122
123 int CurBisectNum = ++LastBisectNum;
124 bool ShouldRun = (OptBisectLimit == -1 || CurBisectNum <= OptBisectLimit);
125 printPassMessage(PassName, CurBisectNum, TargetDesc, ShouldRun);
126 return ShouldRun;
127}