Eugene Zelenko | 3e56169 | 2017-08-31 22:06:09 +0000 | [diff] [blame] | 1 | //===- llvm/IR/OptBisect/Bisect.cpp - LLVM Bisect support -----------------===// |
Andrew Kaylor | aa641a5 | 2016-04-22 22:06:11 +0000 | [diff] [blame] | 2 | // |
Chandler Carruth | 2946cd7 | 2019-01-19 08:50:56 +0000 | [diff] [blame] | 3 | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. |
| 4 | // See https://llvm.org/LICENSE.txt for license information. |
| 5 | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception |
Andrew Kaylor | aa641a5 | 2016-04-22 22:06:11 +0000 | [diff] [blame] | 6 | // |
| 7 | //===----------------------------------------------------------------------===// |
Eugene Zelenko | 3e56169 | 2017-08-31 22:06:09 +0000 | [diff] [blame] | 8 | // |
Andrew Kaylor | aa641a5 | 2016-04-22 22:06:11 +0000 | [diff] [blame] | 9 | /// \file |
| 10 | /// This file implements support for a bisecting optimizations based on a |
| 11 | /// command line option. |
Eugene Zelenko | 3e56169 | 2017-08-31 22:06:09 +0000 | [diff] [blame] | 12 | // |
Andrew Kaylor | aa641a5 | 2016-04-22 22:06:11 +0000 | [diff] [blame] | 13 | //===----------------------------------------------------------------------===// |
| 14 | |
Chandler Carruth | 6bda14b | 2017-06-06 11:49:48 +0000 | [diff] [blame] | 15 | #include "llvm/IR/OptBisect.h" |
Eugene Zelenko | 3e56169 | 2017-08-31 22:06:09 +0000 | [diff] [blame] | 16 | #include "llvm/ADT/StringRef.h" |
Andrew Kaylor | aa641a5 | 2016-04-22 22:06:11 +0000 | [diff] [blame] | 17 | #include "llvm/Pass.h" |
| 18 | #include "llvm/Support/CommandLine.h" |
| 19 | #include "llvm/Support/raw_ostream.h" |
Eugene Zelenko | 3e56169 | 2017-08-31 22:06:09 +0000 | [diff] [blame] | 20 | #include <cassert> |
| 21 | #include <limits> |
| 22 | #include <string> |
Andrew Kaylor | aa641a5 | 2016-04-22 22:06:11 +0000 | [diff] [blame] | 23 | |
| 24 | using namespace llvm; |
| 25 | |
| 26 | static cl::opt<int> OptBisectLimit("opt-bisect-limit", cl::Hidden, |
Eugene Zelenko | 3e56169 | 2017-08-31 22:06:09 +0000 | [diff] [blame] | 27 | cl::init(std::numeric_limits<int>::max()), |
| 28 | cl::Optional, |
Andrew Kaylor | aa641a5 | 2016-04-22 22:06:11 +0000 | [diff] [blame] | 29 | cl::desc("Maximum optimization to perform")); |
| 30 | |
Fedor Sergeev | 98014e4 | 2018-03-27 16:57:20 +0000 | [diff] [blame] | 31 | OptBisect::OptBisect() : OptPassGate() { |
Eugene Zelenko | 3e56169 | 2017-08-31 22:06:09 +0000 | [diff] [blame] | 32 | BisectEnabled = OptBisectLimit != std::numeric_limits<int>::max(); |
Andrew Kaylor | aa641a5 | 2016-04-22 22:06:11 +0000 | [diff] [blame] | 33 | } |
| 34 | |
| 35 | static 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 | |
Richard Trieu | b37a70f | 2019-02-28 04:00:55 +0000 | [diff] [blame] | 42 | bool OptBisect::shouldRunPass(const Pass *P, StringRef IRDescription) { |
| 43 | assert(BisectEnabled); |
Andrew Kaylor | aa641a5 | 2016-04-22 22:06:11 +0000 | [diff] [blame] | 44 | |
Richard Trieu | b37a70f | 2019-02-28 04:00:55 +0000 | [diff] [blame] | 45 | return checkPass(P->getPassName(), IRDescription); |
Andrew Kaylor | aa641a5 | 2016-04-22 22:06:11 +0000 | [diff] [blame] | 46 | } |
| 47 | |
| 48 | bool OptBisect::checkPass(const StringRef PassName, |
| 49 | const StringRef TargetDesc) { |
| 50 | assert(BisectEnabled); |
| 51 | |
| 52 | int CurBisectNum = ++LastBisectNum; |
| 53 | bool ShouldRun = (OptBisectLimit == -1 || CurBisectNum <= OptBisectLimit); |
| 54 | printPassMessage(PassName, CurBisectNum, TargetDesc, ShouldRun); |
| 55 | return ShouldRun; |
| 56 | } |