LLVM 22.0.0git
ProfileVerify.cpp
Go to the documentation of this file.
1//===- ProfileVerify.cpp - Verify profile info for testing ----------------===//
2//
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
6//
7//===----------------------------------------------------------------------===//
8
11#include "llvm/ADT/STLExtras.h"
13#include "llvm/IR/Analysis.h"
14#include "llvm/IR/Constants.h"
15#include "llvm/IR/Dominators.h"
16#include "llvm/IR/Function.h"
17#include "llvm/IR/GlobalValue.h"
20#include "llvm/IR/LLVMContext.h"
21#include "llvm/IR/MDBuilder.h"
22#include "llvm/IR/Module.h"
23#include "llvm/IR/PassManager.h"
28
29using namespace llvm;
31 DefaultFunctionEntryCount("profcheck-default-function-entry-count",
32 cl::init(1000));
33static cl::opt<bool>
34 AnnotateSelect("profcheck-annotate-select", cl::init(true),
35 cl::desc("Also inject (if missing) and verify MD_prof for "
36 "`select` instructions"));
37static cl::opt<bool>
38 WeightsForTest("profcheck-weights-for-test", cl::init(false),
39 cl::desc("Generate weights with small values for tests."));
40
42 "profcheck-default-select-true-weight", cl::init(2U),
43 cl::desc("When annotating `select` instructions, this value will be used "
44 "for the first ('true') case."));
46 "profcheck-default-select-false-weight", cl::init(3U),
47 cl::desc("When annotating `select` instructions, this value will be used "
48 "for the second ('false') case."));
49namespace {
50class ProfileInjector {
51 Function &F;
53
54public:
55 static const Instruction *
56 getTerminatorBenefitingFromMDProf(const BasicBlock &BB) {
57 if (succ_size(&BB) < 2)
58 return nullptr;
59 auto *Term = BB.getTerminator();
60 return (isa<BranchInst>(Term) || isa<SwitchInst>(Term) ||
62 ? Term
63 : nullptr;
64 }
65
66 static Instruction *getTerminatorBenefitingFromMDProf(BasicBlock &BB) {
67 return const_cast<Instruction *>(
68 getTerminatorBenefitingFromMDProf(const_cast<const BasicBlock &>(BB)));
69 }
70
71 ProfileInjector(Function &F, FunctionAnalysisManager &FAM) : F(F), FAM(FAM) {}
72 bool inject();
73};
74
75bool isAsmOnly(const Function &F) {
76 if (!F.hasFnAttribute(Attribute::AttrKind::Naked))
77 return false;
78 for (const auto &BB : F)
79 for (const auto &I : drop_end(BB.instructionsWithoutDebug())) {
80 const auto *CB = dyn_cast<CallBase>(&I);
81 if (!CB || !CB->isInlineAsm())
82 return false;
83 }
84 return true;
85}
86} // namespace
87
88// FIXME: currently this injects only for terminators. Select isn't yet
89// supported.
90bool ProfileInjector::inject() {
91 // skip purely asm functions
92 if (isAsmOnly(F))
93 return false;
94 // Get whatever branch probability info can be derived from the given IR -
95 // whether it has or not metadata. The main intention for this pass is to
96 // ensure that other passes don't drop or "forget" to update MD_prof. We do
97 // this as a mode in which lit tests would run. We want to avoid changing the
98 // behavior of those tests. A pass may use BPI (or BFI, which is computed from
99 // BPI). If no metadata is present, BPI is guesstimated by
100 // BranchProbabilityAnalysis. The injector (this pass) only persists whatever
101 // information the analysis provides, in other words, the pass being tested
102 // will get the same BPI it does if the injector wasn't running.
103 auto &BPI = FAM.getResult<BranchProbabilityAnalysis>(F);
104
105 // Inject a function count if there's none. It's reasonable for a pass to
106 // want to clear the MD_prof of a function with zero entry count. If the
107 // original profile (iFDO or AFDO) is empty for a function, it's simpler to
108 // require assigning it the 0-entry count explicitly than to mark every branch
109 // as cold (we do want some explicit information in the spirit of what this
110 // verifier wants to achieve - make dropping / corrupting MD_prof
111 // unit-testable)
112 if (!F.getEntryCount(/*AllowSynthetic=*/true))
113 F.setEntryCount(DefaultFunctionEntryCount);
114 // If there is an entry count that's 0, then don't bother injecting. We won't
115 // verify these either.
116 if (F.getEntryCount(/*AllowSynthetic=*/true)->getCount() == 0)
117 return false;
118 bool Changed = false;
119 // Cycle through the weights list. If we didn't, tests with more than (say)
120 // one conditional branch would have the same !prof metadata on all of them,
121 // and numerically that may make for a poor unit test.
122 uint32_t WeightsForTestOffset = 0;
123 for (auto &BB : F) {
124 if (AnnotateSelect) {
125 for (auto &I : BB) {
126 if (auto *SI = dyn_cast<SelectInst>(&I)) {
127 if (SI->getCondition()->getType()->isVectorTy())
128 continue;
129 if (I.getMetadata(LLVMContext::MD_prof))
130 continue;
132 /*IsExpected=*/false);
133 }
134 }
135 }
136 auto *Term = getTerminatorBenefitingFromMDProf(BB);
137 if (!Term || Term->getMetadata(LLVMContext::MD_prof))
138 continue;
139 SmallVector<BranchProbability> Probs;
140
141 SmallVector<uint32_t> Weights;
142 Weights.reserve(Term->getNumSuccessors());
143 if (WeightsForTest) {
144 static const std::array Primes{3, 5, 7, 11, 13, 17, 19, 23, 29, 31,
145 37, 41, 43, 47, 53, 59, 61, 67, 71};
146 for (uint32_t I = 0, E = Term->getNumSuccessors(); I < E; ++I)
147 Weights.emplace_back(
148 Primes[(WeightsForTestOffset + I) % Primes.size()]);
149 ++WeightsForTestOffset;
150 } else {
151 Probs.reserve(Term->getNumSuccessors());
152 for (auto I = 0U, E = Term->getNumSuccessors(); I < E; ++I)
153 Probs.emplace_back(BPI.getEdgeProbability(&BB, Term->getSuccessor(I)));
154
155 assert(llvm::find_if(Probs,
156 [](const BranchProbability &P) {
157 return P.isUnknown();
158 }) == Probs.end() &&
159 "All branch probabilities should be valid");
160 const auto *FirstZeroDenominator =
161 find_if(Probs, [](const BranchProbability &P) {
162 return P.getDenominator() == 0;
163 });
164 (void)FirstZeroDenominator;
165 assert(FirstZeroDenominator == Probs.end());
166 const auto *FirstNonZeroNumerator = find_if(
167 Probs, [](const BranchProbability &P) { return !P.isZero(); });
168 assert(FirstNonZeroNumerator != Probs.end());
169 DynamicAPInt LCM(Probs[0].getDenominator());
170 DynamicAPInt GCD(FirstNonZeroNumerator->getNumerator());
171 for (const auto &Prob : drop_begin(Probs)) {
172 if (!Prob.getNumerator())
173 continue;
174 LCM = llvm::lcm(LCM, DynamicAPInt(Prob.getDenominator()));
175 GCD = llvm::gcd(GCD, DynamicAPInt(Prob.getNumerator()));
176 }
177 for (const auto &Prob : Probs) {
178 DynamicAPInt W =
179 (Prob.getNumerator() * LCM / GCD) / Prob.getDenominator();
180 Weights.emplace_back(static_cast<uint32_t>((int64_t)W));
181 }
182 }
183 setBranchWeights(*Term, Weights, /*IsExpected=*/false);
184 Changed = true;
185 }
186 return Changed;
187}
188
191 ProfileInjector PI(F, FAM);
192 if (!PI.inject())
193 return PreservedAnalyses::all();
194
196}
197
198PreservedAnalyses ProfileVerifierPass::run(Module &M,
200 auto PopulateIgnoreList = [&](StringRef GVName) {
201 if (const auto *CT = M.getGlobalVariable(GVName))
202 if (const auto *CA =
203 dyn_cast_if_present<ConstantArray>(CT->getInitializer()))
204 for (const auto &Elt : CA->operands())
205 if (const auto *CS = dyn_cast<ConstantStruct>(Elt))
206 if (CS->getNumOperands() >= 2 && CS->getOperand(1))
207 if (const auto *F = dyn_cast<Function>(
208 CS->getOperand(1)->stripPointerCasts()))
209 IgnoreList.insert(F);
210 };
211 PopulateIgnoreList("llvm.global_ctors");
212 PopulateIgnoreList("llvm.global_dtors");
213
214 // expose the function-level run as public through a wrapper, so we can use
215 // pass manager mechanisms dealing with declarations and with composing the
216 // returned PreservedAnalyses values.
217 struct Wrapper : PassInfoMixin<Wrapper> {
220 return PVP.run(F, FAM);
221 }
222 explicit Wrapper(ProfileVerifierPass &PVP) : PVP(PVP) {}
223 };
224
226}
227
228PreservedAnalyses ProfileVerifierPass::run(Function &F,
230 // skip purely asm functions
231 if (isAsmOnly(F))
232 return PreservedAnalyses::all();
233 if (IgnoreList.contains(&F))
234 return PreservedAnalyses::all();
235
236 const auto EntryCount = F.getEntryCount(/*AllowSynthetic=*/true);
237 if (!EntryCount) {
238 auto *MD = F.getMetadata(LLVMContext::MD_prof);
239 if (!MD || !isExplicitlyUnknownProfileMetadata(*MD)) {
240 F.getContext().emitError("Profile verification failed: function entry "
241 "count missing (set to 0 if cold)");
242 return PreservedAnalyses::all();
243 }
244 } else if (EntryCount->getCount() == 0) {
245 return PreservedAnalyses::all();
246 }
247 for (const auto &BB : F) {
248 if (AnnotateSelect) {
249 for (const auto &I : BB)
250 if (auto *SI = dyn_cast<SelectInst>(&I)) {
251 if (SI->getCondition()->getType()->isVectorTy())
252 continue;
253 if (I.getMetadata(LLVMContext::MD_prof))
254 continue;
255 F.getContext().emitError(
256 "Profile verification failed: select annotation missing");
257 }
258 }
259 if (const auto *Term =
260 ProfileInjector::getTerminatorBenefitingFromMDProf(BB))
261 if (!Term->getMetadata(LLVMContext::MD_prof))
262 F.getContext().emitError(
263 "Profile verification failed: branch annotation missing");
264 }
265 return PreservedAnalyses::all();
266}
assert(UImm &&(UImm !=~static_cast< T >(0)) &&"Invalid immediate!")
amdgpu aa AMDGPU Address space based Alias Analysis Wrapper
static GCRegistry::Add< CoreCLRGC > E("coreclr", "CoreCLR-compatible GC")
This file contains the declarations for the subclasses of Constant, which represent the different fla...
Module.h This file contains the declarations for the Module class.
This header defines various interfaces for pass management in LLVM.
#define F(x, y, z)
Definition MD5.cpp:54
#define I(x, y, z)
Definition MD5.cpp:57
#define P(N)
FunctionAnalysisManager FAM
ModuleAnalysisManager MAM
This file contains the declarations for profiling metadata utility functions.
static cl::opt< bool > WeightsForTest("profcheck-weights-for-test", cl::init(false), cl::desc("Generate weights with small values for tests."))
static cl::opt< uint32_t > SelectFalseWeight("profcheck-default-select-false-weight", cl::init(3U), cl::desc("When annotating `select` instructions, this value will be used " "for the second ('false') case."))
static cl::opt< int64_t > DefaultFunctionEntryCount("profcheck-default-function-entry-count", cl::init(1000))
static cl::opt< bool > AnnotateSelect("profcheck-annotate-select", cl::init(true), cl::desc("Also inject (if missing) and verify MD_prof for " "`select` instructions"))
static cl::opt< uint32_t > SelectTrueWeight("profcheck-default-select-true-weight", cl::init(2U), cl::desc("When annotating `select` instructions, this value will be used " "for the first ('true') case."))
This file contains some templates that are useful if you are working with the STL at all.
PassT::Result & getResult(IRUnitT &IR, ExtraArgTs... ExtraArgs)
Get the result of an analysis pass for a given IR unit.
LLVM Basic Block Representation.
Definition BasicBlock.h:62
LLVM_ABI iterator_range< filter_iterator< BasicBlock::const_iterator, std::function< bool(const Instruction &)> > > instructionsWithoutDebug(bool SkipPseudoOp=true) const
Return a const iterator range over the instructions in the block, skipping any debug instructions.
const Instruction * getTerminator() const LLVM_READONLY
Returns the terminator instruction if the block is well formed or null if the block is not well forme...
Definition BasicBlock.h:233
LLVM_ABI PreservedAnalyses run(Module &M, ModuleAnalysisManager &AM)
Runs the function pass across every function in the module.
A Module instance is used to store all the information related to an LLVM module.
Definition Module.h:67
A set of analyses that are preserved following a run of a transformation pass.
Definition Analysis.h:112
static PreservedAnalyses none()
Convenience factory function for the empty preserved set.
Definition Analysis.h:115
static PreservedAnalyses all()
Construct a special preserved set that preserves all passes.
Definition Analysis.h:118
LLVM_ABI PreservedAnalyses run(Function &F, FunctionAnalysisManager &FAM)
Checks that MD_prof is present on every instruction that supports it.
reference emplace_back(ArgTypes &&... Args)
void reserve(size_type N)
StringRef - Represent a constant reference to a string, i.e.
Definition StringRef.h:55
Changed
Pass manager infrastructure for declaring and invalidating analyses.
@ BasicBlock
Various leaf nodes.
Definition ISDOpcodes.h:81
initializer< Ty > init(const Ty &Val)
friend class Instruction
Iterator for Instructions in a `BasicBlock.
Definition BasicBlock.h:73
This is an optimization pass for GlobalISel generic memory operations.
auto drop_begin(T &&RangeOrContainer, size_t N=1)
Return a range covering RangeOrContainer with the first N elements excluded.
Definition STLExtras.h:316
LLVM_ATTRIBUTE_ALWAYS_INLINE DynamicAPInt gcd(const DynamicAPInt &A, const DynamicAPInt &B)
decltype(auto) dyn_cast(const From &Val)
dyn_cast<X> - Return the argument parameter cast to the specified type.
Definition Casting.h:643
ModuleToFunctionPassAdaptor createModuleToFunctionPassAdaptor(FunctionPassT &&Pass, bool EagerlyInvalidate=false)
A function to deduce a function pass type and wrap it in the templated adaptor.
LLVM_ABI bool isExplicitlyUnknownProfileMetadata(const MDNode &MD)
auto dyn_cast_if_present(const Y &Val)
dyn_cast_if_present<X> - Functionally identical to dyn_cast, except that a null (or none in the case ...
Definition Casting.h:732
LLVM_ABI void setBranchWeights(Instruction &I, ArrayRef< uint32_t > Weights, bool IsExpected, bool ElideAllZero=false)
Create a new branch_weights metadata node and add or overwrite a prof metadata reference to instructi...
auto succ_size(const MachineBasicBlock *BB)
bool isa(const From &Val)
isa<X> - Return true if the parameter to the template is an instance of one of the template type argu...
Definition Casting.h:547
auto drop_end(T &&RangeOrContainer, size_t N=1)
Return a range covering RangeOrContainer with the last N elements excluded.
Definition STLExtras.h:323
LLVM_ATTRIBUTE_ALWAYS_INLINE DynamicAPInt lcm(const DynamicAPInt &A, const DynamicAPInt &B)
Returns the least common multiple of A and B.
auto find_if(R &&Range, UnaryPredicate P)
Provide wrappers to std::find_if which take ranges instead of having to pass begin/end explicitly.
Definition STLExtras.h:1758
AnalysisManager< Function > FunctionAnalysisManager
Convenience typedef for the Function analysis manager.
AnalysisManager< Module > ModuleAnalysisManager
Convenience typedef for the Module analysis manager.
Definition MIRParser.h:39
A CRTP mix-in to automatically provide informational APIs needed for passes.
Definition PassManager.h:69