LLVM 24.0.0git
MLInlineAdvisor.cpp
Go to the documentation of this file.
1//===- MLInlineAdvisor.cpp - machine learned InlineAdvisor ----------------===//
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//
9// This file implements the interface between the inliner and a learned model.
10// It delegates model evaluation to either the AOT compiled model (the
11// 'release' mode) or a runtime-loaded model (the 'development' case).
12//
13//===----------------------------------------------------------------------===//
31#include "llvm/IR/Dominators.h"
33#include "llvm/IR/Module.h"
34#include "llvm/IR/PassManager.h"
36
37using namespace llvm;
38
40 "inliner-interactive-channel-base", cl::Hidden,
42 "Base file path for the interactive mode. The incoming filename should "
43 "have the name <inliner-interactive-channel-base>.in, while the "
44 "outgoing name should be <inliner-interactive-channel-base>.out"));
45static const std::string InclDefaultMsg =
46 (Twine("In interactive mode, also send the default policy decision: ") +
48 .str();
49static cl::opt<bool>
50 InteractiveIncludeDefault("inliner-interactive-include-default", cl::Hidden,
52
54
56 "ml-inliner-skip-policy", cl::Hidden, cl::init(SkipMLPolicyCriteria::Never),
59 "if-caller-not-cold", "if the caller is not cold")));
60
61static cl::opt<std::string> ModelSelector("ml-inliner-model-selector",
62 cl::Hidden, cl::init(""));
63
64static cl::opt<bool> StopImmediatelyForTest("ml-inliner-stop-immediately",
66
67#if defined(LLVM_HAVE_TF_AOT_INLINERSIZEMODEL)
68// codegen-ed file
69#include "InlinerSizeModel.h" // NOLINT
70using CompiledModelType = llvm::InlinerSizeModel;
71#else
73#endif
74
76#include "llvm/Analysis/InlinerModels.h"
77
78enum class EmitCModelChoice {
80#define MLGO_MODEL(CLASS_NAME, CLI_FLAG) CLASS_NAME,
81#include "llvm/Analysis/InlinerModels.def"
82};
83
85 "mlgo-model", llvm::cl::desc("Select the MLGO model to execute:"),
88 "Use standard heuristic")
89#define MLGO_MODEL(CLASS_NAME, CLI_FLAG) \
90 , clEnumValN(EmitCModelChoice::CLASS_NAME, CLI_FLAG, \
91 "Use the " CLI_FLAG " MLGO model")
92#include "llvm/Analysis/InlinerModels.def"
93 ));
94
95static std::unique_ptr<MLModelRunner>
97 const std::vector<TensorSpec> &InputFeatures) {
98 switch (SelectedMLGOModel) {
100 return nullptr;
101#define MLGO_MODEL(CLASS_NAME, CLI_FLAG) \
102 case EmitCModelChoice::CLASS_NAME: \
103 return std::make_unique<EmitCModelRunner<CLASS_NAME>>(Ctx, InputFeatures);
104#include "llvm/Analysis/InlinerModels.def"
105 }
106 llvm_unreachable("Unknown MLGO model type!");
107}
108
109std::unique_ptr<InlineAdvisor>
111 std::function<bool(CallBase &)> GetDefaultAdvice) {
114 return nullptr;
115 auto RunnerFactory = [&](const std::vector<TensorSpec> &InputFeatures)
116 -> std::unique_ptr<MLModelRunner> {
120 EmbeddedModelRunnerOptions().setModelSelector(ModelSelector));
121 };
122 return std::make_unique<MLInlineAdvisor>(M, MAM, RunnerFactory,
123 GetDefaultAdvice);
124}
125
126#define DEBUG_TYPE "inline-ml"
127
129 "ml-advisor-size-increase-threshold", cl::Hidden,
130 cl::desc("Maximum factor by which expected native size may increase before "
131 "blocking any further inlining."),
132 cl::init(2.0));
133
135 "ml-advisor-keep-fpi-cache", cl::Hidden,
136 cl::desc(
137 "For test - keep the ML Inline advisor's FunctionPropertiesInfo cache"),
138 cl::init(false));
139
140const std::vector<TensorSpec> &MLInlineAdvisor::getInitialFeatureMap() {
141 // clang-format off
142static std::vector<TensorSpec> FeatureMap{
143#define POPULATE_NAMES(DTYPE, SHAPE, NAME, __) TensorSpec::createSpec<DTYPE>(#NAME, SHAPE),
144// InlineCost features - these must come first
146
147// Non-cost features
149#undef POPULATE_NAMES
150};
151 // clang-format on
152 return FeatureMap;
153}
154
155const char *const llvm::DecisionName = "inlining_decision";
158const char *const llvm::DefaultDecisionName = "inlining_default";
161const char *const llvm::RewardName = "delta_size";
162
164 if (auto *CS = dyn_cast<CallBase>(&I))
165 if (Function *Callee = CS->getCalledFunction()) {
166 if (!Callee->isDeclaration()) {
167 return CS;
168 }
169 }
170 return nullptr;
171}
172
175 std::function<
176 std::unique_ptr<MLModelRunner>(const std::vector<TensorSpec> &)>
177 GetModelRunner,
178 std::function<bool(CallBase &)> GetDefaultAdvice)
180 M, MAM.getResult<FunctionAnalysisManagerModuleProxy>(M).getManager()),
182 CG(MAM.getResult<LazyCallGraphAnalysis>(M)),
183 UseIR2Vec(MAM.getCachedResult<IR2VecVocabAnalysis>(M) != nullptr),
184 InitialIRSize(getModuleIRSize()), CurrentIRSize(InitialIRSize),
185 PSI(MAM.getResult<ProfileSummaryAnalysis>(M)) {
186 // Extract the 'call site height' feature - the position of a call site
187 // relative to the farthest statically reachable SCC node. We don't mutate
188 // this value while inlining happens. Empirically, this feature proved
189 // critical in behavioral cloning - i.e. training a model to mimic the manual
190 // heuristic's decisions - and, thus, equally important for training for
191 // improvement.
192 CallGraph CGraph(M);
193 for (auto I = scc_begin(&CGraph); !I.isAtEnd(); ++I) {
194 const std::vector<CallGraphNode *> &CGNodes = *I;
195 unsigned Level = 0;
196 for (auto *CGNode : CGNodes) {
197 Function *F = CGNode->getFunction();
198 if (!F || F->isDeclaration())
199 continue;
200 for (auto &I : instructions(F)) {
201 if (auto *CS = getInlinableCS(I)) {
202 auto *Called = CS->getCalledFunction();
203 auto Pos = FunctionLevels.find(&CG.get(*Called));
204 // In bottom up traversal, an inlinable callee is either in the
205 // same SCC, or to a function in a visited SCC. So not finding its
206 // level means we haven't visited it yet, meaning it's in this SCC.
207 if (Pos == FunctionLevels.end())
208 continue;
209 Level = std::max(Level, Pos->second + 1);
210 }
211 }
212 }
213 for (auto *CGNode : CGNodes) {
214 Function *F = CGNode->getFunction();
215 if (F && !F->isDeclaration())
216 FunctionLevels[&CG.get(*F)] = Level;
217 }
218 }
219 for (auto KVP : FunctionLevels) {
220 AllNodes.insert(KVP.first);
221 EdgeCount += getLocalCalls(KVP.first->getFunction());
222 }
223 NodeCount = AllNodes.size();
224
225 if (auto *IR2VecVocabResult = MAM.getCachedResult<IR2VecVocabAnalysis>(M)) {
226 if (!IR2VecVocabResult->isValid()) {
227 M.getContext().emitError("IR2VecVocabAnalysis is not valid");
228 return;
229 }
230 // Add the IR2Vec features to the feature map
231 auto IR2VecDim = IR2VecVocabResult->getDimension();
232 FeatureMap.push_back(
233 TensorSpec::createSpec<float>("callee_embedding", {IR2VecDim}));
234 FeatureMap.push_back(
235 TensorSpec::createSpec<float>("caller_embedding", {IR2VecDim}));
236 }
239
240 ModelRunner = GetModelRunner(getFeatureMap());
241 if (!ModelRunner) {
242 M.getContext().emitError("Could not create model runner");
243 return;
244 }
245 ModelRunner->switchContext("");
246 ForceStop = StopImmediatelyForTest;
247}
248
250 return CG.lookup(F) ? FunctionLevels.at(CG.lookup(F)) : 0;
251}
252
254 if (!CurSCC || ForceStop)
255 return;
256 FPICache.clear();
257 // Function passes executed between InlinerPass runs may have changed the
258 // module-wide features.
259 // The cgscc pass manager rules are such that:
260 // - if a pass leads to merging SCCs, then the pipeline is restarted on the
261 // merged SCC
262 // - if a pass leads to splitting the SCC, then we continue with one of the
263 // splits
264 // This means that the NodesInLastSCC is a superset (not strict) of the nodes
265 // that subsequent passes would have processed
266 // - in addition, if new Nodes were created by a pass (e.g. CoroSplit),
267 // they'd be adjacent to Nodes in the last SCC. So we just need to check the
268 // boundary of Nodes in NodesInLastSCC for Nodes we haven't seen. We don't
269 // care about the nature of the Edge (call or ref). `FunctionLevels`-wise, we
270 // record them at the same level as the original node (this is a choice, may
271 // need revisiting).
272 // - nodes are only deleted at the end of a call graph walk where they are
273 // batch deleted, so we shouldn't see any dead nodes here.
274 while (!NodesInLastSCC.empty()) {
275 const auto *N = *NodesInLastSCC.begin();
276 assert(!N->isDead());
277 NodesInLastSCC.erase(N);
278 EdgeCount += getLocalCalls(N->getFunction());
279 const auto NLevel = FunctionLevels.at(N);
280 for (const auto &E : *(*N)) {
281 const auto *AdjNode = &E.getNode();
282 assert(!AdjNode->isDead() && !AdjNode->getFunction().isDeclaration());
283 auto I = AllNodes.insert(AdjNode);
284 // We've discovered a new function.
285 if (I.second) {
286 ++NodeCount;
287 NodesInLastSCC.insert(AdjNode);
288 FunctionLevels[AdjNode] = NLevel;
289 }
290 }
291 }
292
293 EdgeCount -= EdgesOfLastSeenNodes;
294 EdgesOfLastSeenNodes = 0;
295
296 // (Re)use NodesInLastSCC to remember the nodes in the SCC right now,
297 // in case the SCC is split before onPassExit and some nodes are split out
298 assert(NodesInLastSCC.empty());
299 for (const auto &N : *CurSCC)
300 NodesInLastSCC.insert(&N);
301}
302
304 // No need to keep this around - function passes will invalidate it.
305 if (!KeepFPICache)
306 FPICache.clear();
307 if (!CurSCC || ForceStop)
308 return;
309 // Keep track of the nodes and edges we last saw. Then, in onPassEntry,
310 // we update the node count and edge count from the subset of these nodes that
311 // survived.
312 EdgesOfLastSeenNodes = 0;
313
314 // Check on nodes that were in SCC onPassEntry
315 for (const LazyCallGraph::Node *N : NodesInLastSCC) {
316 assert(!N->isDead());
317 EdgesOfLastSeenNodes += getLocalCalls(N->getFunction());
318 }
319
320 // Check on nodes that may have got added to SCC
321 for (const auto &N : *CurSCC) {
322 assert(!N.isDead());
323 auto I = NodesInLastSCC.insert(&N);
324 if (I.second)
325 EdgesOfLastSeenNodes += getLocalCalls(N.getFunction());
326 }
327 assert(NodeCount >= NodesInLastSCC.size());
328 assert(EdgeCount >= EdgesOfLastSeenNodes);
329}
330
334
335// Update the internal state of the advisor, and force invalidate feature
336// analysis. Currently, we maintain minimal (and very simple) global state - the
337// number of functions and the number of static calls. We also keep track of the
338// total IR size in this module, to stop misbehaving policies at a certain bloat
339// factor (SizeIncreaseThreshold)
341 bool CalleeWasDeleted) {
342 assert(!ForceStop);
343 Function *Caller = Advice.getCaller();
344 Function *Callee = Advice.getCallee();
345 // The caller features aren't valid anymore.
346 {
349 PA.abandon<LoopAnalysis>();
350 FAM.invalidate(*Caller, PA);
351 }
353 if (Caller == Callee) {
354 assert(!CalleeWasDeleted);
355 // We double-counted CallerAndCalleeEdges - since the caller and callee
356 // would be the same
357 assert(Advice.CallerAndCalleeEdges % 2 == 0);
358 CurrentIRSize += getIRSize(*Caller) - Advice.CallerIRSize;
359 EdgeCount += getCachedFPI(*Caller).DirectCallsToDefinedFunctions -
360 Advice.CallerAndCalleeEdges / 2;
361 // The NodeCount would stay the same.
362 } else {
363 int64_t IRSizeAfter =
364 getIRSize(*Caller) + (CalleeWasDeleted ? 0 : Advice.CalleeIRSize);
365 CurrentIRSize += IRSizeAfter - (Advice.CallerIRSize + Advice.CalleeIRSize);
366
367 // We can delta-update module-wide features. We know the inlining only
368 // changed the caller, and maybe the callee (by deleting the latter). Nodes
369 // are simple to update. For edges, we 'forget' the edges that the caller
370 // and callee used to have before inlining, and add back what they currently
371 // have together.
372 int64_t NewCallerAndCalleeEdges =
374
375 // A dead function's node is not actually removed from the call graph until
376 // the end of the call graph walk, but the node no longer belongs to any
377 // valid SCC.
378 if (CalleeWasDeleted) {
379 --NodeCount;
380 NodesInLastSCC.erase(CG.lookup(*Callee));
381 DeadFunctions.insert(Callee);
382 } else {
383 NewCallerAndCalleeEdges +=
385 }
386 EdgeCount += (NewCallerAndCalleeEdges - Advice.CallerAndCalleeEdges);
387 }
388 if (CurrentIRSize > SizeIncreaseThreshold * InitialIRSize)
389 ForceStop = true;
390
391 assert(CurrentIRSize >= 0 && EdgeCount >= 0 && NodeCount >= 0);
392}
393
394int64_t MLInlineAdvisor::getModuleIRSize() const {
395 int64_t Ret = 0;
396 for (auto &F : M)
397 if (!F.isDeclaration())
398 Ret += getIRSize(F);
399 return Ret;
400}
401
403 auto InsertPair = FPICache.try_emplace(&F);
404 if (!InsertPair.second)
405 return InsertPair.first->second;
406 InsertPair.first->second = FAM.getResult<FunctionPropertiesAnalysis>(F);
407 return InsertPair.first->second;
408}
409
410std::unique_ptr<InlineAdvice> MLInlineAdvisor::getAdviceImpl(CallBase &CB) {
411 if (auto Skip = getSkipAdviceIfUnreachableCallsite(CB))
412 return Skip;
413
414 auto &Caller = *CB.getCaller();
415 auto &Callee = *CB.getCalledFunction();
416
417 auto GetAssumptionCache = [&](Function &F) -> AssumptionCache & {
418 return FAM.getResult<AssumptionAnalysis>(F);
419 };
420 auto &TIR = FAM.getResult<TargetIRAnalysis>(Callee);
421 auto &ORE = FAM.getResult<OptimizationRemarkEmitterAnalysis>(Caller);
422
424 if (!PSI.isFunctionEntryCold(&Caller)) {
425 // Return a MLInlineAdvice, despite delegating to the default advice,
426 // because we need to keep track of the internal state. This is different
427 // from the other instances where we return a "default" InlineAdvice,
428 // which happen at points we won't come back to the MLAdvisor for
429 // decisions requiring that state.
430 return ForceStop ? std::make_unique<InlineAdvice>(this, CB, ORE,
432 : std::make_unique<MLInlineAdvice>(this, CB, ORE,
433 GetDefaultAdvice(CB));
434 }
435 }
436 auto MandatoryKind = InlineAdvisor::getMandatoryKind(CB, FAM, ORE);
437 // If this is a "never inline" case, there won't be any changes to internal
438 // state we need to track, so we can just return the base InlineAdvice, which
439 // will do nothing interesting.
440 // Same thing if this is a recursive case.
441 if (MandatoryKind == InlineAdvisor::MandatoryInliningKind::Never ||
442 &Caller == &Callee)
443 return getMandatoryAdvice(CB, false);
444
445 bool Mandatory =
447
448 // If we need to stop, we won't want to track anymore any state changes, so
449 // we just return the base InlineAdvice, which acts as a noop.
450 if (ForceStop) {
451 ORE.emit([&] {
452 return OptimizationRemarkMissed(DEBUG_TYPE, "ForceStop", &CB)
453 << "Won't attempt inlining because module size grew too much.";
454 });
455 return std::make_unique<InlineAdvice>(this, CB, ORE, Mandatory);
456 }
457
458 int CostEstimate = 0;
459 if (!Mandatory) {
460 auto IsCallSiteInlinable =
461 llvm::getInliningCostEstimate(CB, TIR, GetAssumptionCache);
462 if (!IsCallSiteInlinable) {
463 // We can't inline this for correctness reasons, so return the base
464 // InlineAdvice, as we don't care about tracking any state changes (which
465 // won't happen).
466 return std::make_unique<InlineAdvice>(this, CB, ORE, false);
467 }
468 CostEstimate = *IsCallSiteInlinable;
469 }
470
471 const auto CostFeatures =
472 llvm::getInliningCostFeatures(CB, TIR, GetAssumptionCache);
473 if (!CostFeatures) {
474 return std::make_unique<InlineAdvice>(this, CB, ORE, false);
475 }
476
477 if (Mandatory)
478 return getMandatoryAdvice(CB, true);
479
480 auto NumCtantParams = 0;
481 for (auto I = CB.arg_begin(), E = CB.arg_end(); I != E; ++I) {
482 NumCtantParams += (isa<Constant>(*I));
483 }
484
485 auto &CallerBefore = getCachedFPI(Caller);
486 auto &CalleeBefore = getCachedFPI(Callee);
487
488 *ModelRunner->getTensor<int64_t>(FeatureIndex::callee_basic_block_count) =
489 CalleeBefore.BasicBlockCount;
490 *ModelRunner->getTensor<int64_t>(FeatureIndex::callsite_height) =
492 *ModelRunner->getTensor<int64_t>(FeatureIndex::node_count) = NodeCount;
493 *ModelRunner->getTensor<int64_t>(FeatureIndex::nr_ctant_params) =
494 NumCtantParams;
495 *ModelRunner->getTensor<int64_t>(FeatureIndex::edge_count) = EdgeCount;
496 *ModelRunner->getTensor<int64_t>(FeatureIndex::caller_users) =
497 CallerBefore.Uses;
498 *ModelRunner->getTensor<int64_t>(
499 FeatureIndex::caller_conditionally_executed_blocks) =
500 CallerBefore.BlocksReachedFromConditionalInstruction;
501 *ModelRunner->getTensor<int64_t>(FeatureIndex::caller_basic_block_count) =
502 CallerBefore.BasicBlockCount;
503 *ModelRunner->getTensor<int64_t>(
504 FeatureIndex::callee_conditionally_executed_blocks) =
505 CalleeBefore.BlocksReachedFromConditionalInstruction;
506 *ModelRunner->getTensor<int64_t>(FeatureIndex::callee_users) =
507 CalleeBefore.Uses;
508 *ModelRunner->getTensor<int64_t>(FeatureIndex::cost_estimate) = CostEstimate;
509 *ModelRunner->getTensor<int64_t>(FeatureIndex::is_callee_avail_external) =
510 Callee.hasAvailableExternallyLinkage();
511 *ModelRunner->getTensor<int64_t>(FeatureIndex::is_caller_avail_external) =
512 Caller.hasAvailableExternallyLinkage();
513
514 if (UseIR2Vec) {
515 // Python side expects float embeddings. The IR2Vec embeddings are doubles
516 // as of now due to the restriction of fromJSON method used by the
517 // readVocabulary method in ir2vec::Embeddings.
518 auto setEmbedding = [&](const ir2vec::Embedding &Embedding,
519 FeatureIndex Index) {
520 llvm::transform(Embedding, ModelRunner->getTensor<float>(Index),
521 [](double Val) { return static_cast<float>(Val); });
522 };
523
524 setEmbedding(CalleeBefore.getFunctionEmbedding(),
526 setEmbedding(CallerBefore.getFunctionEmbedding(),
528 }
529
530 // Add the cost features
531 for (size_t I = 0;
533 *ModelRunner->getTensor<int64_t>(inlineCostFeatureToMlFeature(
534 static_cast<InlineCostFeatureIndex>(I))) = CostFeatures->at(I);
535 }
536 // This one would have been set up to be right at the end.
538 *ModelRunner->getTensor<int64_t>(getFeatureMap().size() - 1) =
540 return getAdviceFromModel(CB, ORE);
541}
542
543std::unique_ptr<MLInlineAdvice>
546 return std::make_unique<MLInlineAdvice>(
547 this, CB, ORE, static_cast<bool>(ModelRunner->evaluate<int64_t>()));
548}
549
550std::unique_ptr<InlineAdvice>
551MLInlineAdvisor::getSkipAdviceIfUnreachableCallsite(CallBase &CB) {
552 if (!FAM.getResult<DominatorTreeAnalysis>(*CB.getCaller())
553 .isReachableFromEntry(CB.getParent()))
554 return std::make_unique<InlineAdvice>(this, CB, getCallerORE(CB), false);
555 return nullptr;
556}
557
558std::unique_ptr<InlineAdvice> MLInlineAdvisor::getMandatoryAdvice(CallBase &CB,
559 bool Advice) {
560 // Make sure we track inlinings in all cases - mandatory or not.
561 if (auto Skip = getSkipAdviceIfUnreachableCallsite(CB))
562 return Skip;
563 if (Advice && !ForceStop)
564 return getMandatoryAdviceImpl(CB);
565
566 // If this is a "never inline" case, there won't be any changes to internal
567 // state we need to track, so we can just return the base InlineAdvice, which
568 // will do nothing interesting.
569 // Same if we are forced to stop - we don't track anymore.
570 return std::make_unique<InlineAdvice>(this, CB, getCallerORE(CB), Advice);
571}
572
573std::unique_ptr<MLInlineAdvice>
575 return std::make_unique<MLInlineAdvice>(this, CB, getCallerORE(CB), true);
576}
577
578void MLInlineAdvisor::print(raw_ostream &OS) const {
579 OS << "[MLInlineAdvisor] Nodes: " << NodeCount << " Edges: " << EdgeCount
580 << " EdgesOfLastSeenNodes: " << EdgesOfLastSeenNodes << "\n";
581 OS << "[MLInlineAdvisor] FPI:\n";
582 for (auto I : FPICache) {
583 OS << I.first->getName() << ":\n";
584 I.second.print(OS);
585 OS << "\n";
586 }
587 OS << "\n";
588 OS << "[MLInlineAdvisor] FuncLevels:\n";
589 for (auto I : FunctionLevels)
590 OS << (DeadFunctions.contains(&I.first->getFunction())
591 ? "<deleted>"
592 : I.first->getFunction().getName())
593 << " : " << I.second << "\n";
594
595 OS << "\n";
596}
597
600 bool Recommendation)
601 : InlineAdvice(Advisor, CB, ORE, Recommendation),
602 CallerIRSize(Advisor->isForcedToStop() ? 0 : Advisor->getIRSize(*Caller)),
603 CalleeIRSize(Advisor->isForcedToStop() ? 0 : Advisor->getIRSize(*Callee)),
604 CallerAndCalleeEdges(Advisor->isForcedToStop()
605 ? 0
606 : (Advisor->getLocalCalls(*Caller) +
607 Advisor->getLocalCalls(*Callee))),
608 PreInlineCallerFPI(Advisor->getCachedFPI(*Caller)) {
609 if (Recommendation)
610 FPU.emplace(Advisor->getCachedFPI(*getCaller()), CB);
611}
612
613void MLInlineAdvice::reportContextForRemark(
615 using namespace ore;
616 OR << NV("Callee", Callee->getName());
617 for (size_t I = 0; I < getAdvisor()->getFeatureMap().size(); ++I)
618 OR << NV(getAdvisor()->getFeatureMap()[I].name(),
619 *getAdvisor()->getModelRunner().getTensor<int64_t>(I));
620 OR << NV("ShouldInline", isInliningRecommended());
621}
622
626
628 ORE.emit([&]() {
629 OptimizationRemark R(DEBUG_TYPE, "InliningSuccess", DLoc, Block);
630 reportContextForRemark(R);
631 return R;
632 });
633 getAdvisor()->onSuccessfulInlining(*this, /*CalleeWasDeleted*/ false);
634}
635
637 ORE.emit([&]() {
638 OptimizationRemark R(DEBUG_TYPE, "InliningSuccessWithCalleeDeleted", DLoc,
639 Block);
640 reportContextForRemark(R);
641 return R;
642 });
643 getAdvisor()->onSuccessfulInlining(*this, /*CalleeWasDeleted*/ true);
644}
645
647 const InlineResult &Result) {
648 getAdvisor()->getCachedFPI(*Caller) = PreInlineCallerFPI;
649 ORE.emit([&]() {
650 OptimizationRemarkMissed R(DEBUG_TYPE, "InliningAttemptedAndUnsuccessful",
651 DLoc, Block);
652 reportContextForRemark(R);
653 return R;
654 });
655}
657 assert(!FPU);
658 ORE.emit([&]() {
659 OptimizationRemarkMissed R(DEBUG_TYPE, "IniningNotAttempted", DLoc, Block);
660 reportContextForRemark(R);
661 return R;
662 });
663}
assert(UImm &&(UImm !=~static_cast< T >(0)) &&"Invalid immediate!")
Expand Atomic instructions
This file provides interfaces used to build and manipulate a call graph, which is a very useful tool ...
#define clEnumValN(ENUMVAL, FLAGNAME, DESC)
@ Default
This file implements a model runner wrapping an EmitC compiled ML model.
#define DEBUG_TYPE
Module.h This file contains the declarations for the Module class.
This header defines various interfaces for pass management in LLVM.
#define INLINE_COST_FEATURE_ITERATOR(M)
#define INLINE_FEATURE_ITERATOR(M)
Implements a lazy call graph analysis and related passes for the new pass manager.
#define F(x, y, z)
Definition MD5.cpp:54
#define I(x, y, z)
Definition MD5.cpp:57
This file provides helper functions for creating MLModelRunners and checking model validity in releas...
static std::unique_ptr< MLModelRunner > createEmitCModelRunner(LLVMContext &Ctx, const std::vector< TensorSpec > &InputFeatures)
static cl::opt< bool > KeepFPICache("ml-advisor-keep-fpi-cache", cl::Hidden, cl::desc("For test - keep the ML Inline advisor's FunctionPropertiesInfo cache"), cl::init(false))
#define MLGO_MODEL(CLASS_NAME, CLI_FLAG)
static cl::opt< std::string > ModelSelector("ml-inliner-model-selector", cl::Hidden, cl::init(""))
CallBase * getInlinableCS(Instruction &I)
NoopSavedModelImpl CompiledModelType
SkipMLPolicyCriteria
EmitCModelChoice
static cl::opt< std::string > InteractiveChannelBaseName("inliner-interactive-channel-base", cl::Hidden, cl::desc("Base file path for the interactive mode. The incoming filename should " "have the name <inliner-interactive-channel-base>.in, while the " "outgoing name should be <inliner-interactive-channel-base>.out"))
#define POPULATE_NAMES(DTYPE, SHAPE, NAME, __)
static cl::opt< bool > StopImmediatelyForTest("ml-inliner-stop-immediately", cl::Hidden)
static cl::opt< float > SizeIncreaseThreshold("ml-advisor-size-increase-threshold", cl::Hidden, cl::desc("Maximum factor by which expected native size may increase before " "blocking any further inlining."), cl::init(2.0))
static const std::string InclDefaultMsg
static cl::opt< SkipMLPolicyCriteria > SkipPolicy("ml-inliner-skip-policy", cl::Hidden, cl::init(SkipMLPolicyCriteria::Never), cl::values(clEnumValN(SkipMLPolicyCriteria::Never, "never", "never"), clEnumValN(SkipMLPolicyCriteria::IfCallerIsNotCold, "if-caller-not-cold", "if the caller is not cold")))
static cl::opt< bool > InteractiveIncludeDefault("inliner-interactive-include-default", cl::Hidden, cl::desc(InclDefaultMsg))
static llvm::cl::opt< EmitCModelChoice > SelectedMLGOModel("mlgo-model", llvm::cl::desc("Select the MLGO model to execute:"), llvm::cl::init(EmitCModelChoice::Default), llvm::cl::values(clEnumValN(EmitCModelChoice::Default, "default", "Use standard heuristic") #define MLGO_MODEL(CLASS_NAME, CLI_FLAG) \ \‍))
FunctionAnalysisManager FAM
ModuleAnalysisManager MAM
This builds on the llvm/ADT/GraphTraits.h file to find the strongly connected components (SCCs) of a ...
static const char * name
This pass exposes codegen information to IR-level passes.
A function analysis which provides an AssumptionCache.
A cache of @llvm.assume calls within a function.
Base class for all callable instructions (InvokeInst and CallInst) Holds everything related to callin...
Function * getCalledFunction() const
Returns the function called, or null if this is an indirect function invocation or the function signa...
User::op_iterator arg_begin()
Return the iterator pointing to the beginning of the argument list.
User::op_iterator arg_end()
Return the iterator pointing to the end of the argument list.
LLVM_ABI Function * getCaller()
Helper to get the caller (the parent function).
The basic data container for the call graph of a Module of IR.
Definition CallGraph.h:72
Common features for diagnostics dealing with optimization remarks that are used by both IR and MIR pa...
Analysis pass which computes a DominatorTree.
Definition Dominators.h:241
int64_t DirectCallsToDefinedFunctions
Number of direct calls made from this function to other functions defined in this module.
This analysis provides the vocabulary for IR2Vec.
Definition IR2Vec.h:637
Function *const Callee
Function *const Caller
Caller and Callee are pre-inlining.
const BasicBlock *const Block
OptimizationRemarkEmitter & ORE
InlineAdvisor *const Advisor
LLVM_ABI InlineAdvice(InlineAdvisor *Advisor, CallBase &CB, OptimizationRemarkEmitter &ORE, bool IsInliningRecommended)
const DebugLoc DLoc
bool isInliningRecommended() const
Get the inlining recommendation.
OptimizationRemarkEmitter & getCallerORE(CallBase &CB)
FunctionAnalysisManager & FAM
static MandatoryInliningKind getMandatoryKind(CallBase &CB, FunctionAnalysisManager &FAM, OptimizationRemarkEmitter &ORE)
InlineAdvisor(InlineAdvisor &&)=delete
InlineResult is basically true or false.
Definition InlineCost.h:181
This is an important class for using LLVM in a threaded context.
Definition LLVMContext.h:68
An analysis pass which computes the call graph for a module.
A node in the call graph.
An SCC of the call graph.
Analysis pass that exposes the LoopInfo for a function.
Definition LoopInfo.h:594
InlineAdvice that tracks changes post inlining.
void updateCachedCallerFPI(FunctionAnalysisManager &FAM) const
const int64_t CallerIRSize
MLInlineAdvice(MLInlineAdvisor *Advisor, CallBase &CB, OptimizationRemarkEmitter &ORE, bool Recommendation)
const int64_t CalleeIRSize
void recordInliningImpl() override
Function * getCaller() const
const int64_t CallerAndCalleeEdges
void recordUnsuccessfulInliningImpl(const InlineResult &Result) override
Function * getCallee() const
void recordInliningWithCalleeDeletedImpl() override
void recordUnattemptedInliningImpl() override
const std::vector< TensorSpec > & getFeatureMap() const
std::unique_ptr< MLModelRunner > ModelRunner
FunctionPropertiesInfo & getCachedFPI(Function &) const
void onPassExit(LazyCallGraph::SCC *SCC) override
This must be called when the Inliner pass is exited, as function passes may be run subsequently.
void onSuccessfulInlining(const MLInlineAdvice &Advice, bool CalleeWasDeleted)
static const std::vector< TensorSpec > & getInitialFeatureMap()
virtual std::unique_ptr< MLInlineAdvice > getMandatoryAdviceImpl(CallBase &CB)
void onPassEntry(LazyCallGraph::SCC *SCC) override
This must be called when the Inliner pass is entered, to allow the InlineAdvisor update internal stat...
MLInlineAdvisor(Module &M, ModuleAnalysisManager &MAM, std::function< std::unique_ptr< MLModelRunner >(const std::vector< TensorSpec > &)> GetModelRunner, std::function< bool(CallBase &)> GetDefaultAdvice)
int64_t getLocalCalls(Function &F)
std::vector< TensorSpec > FeatureMap
virtual std::unique_ptr< MLInlineAdvice > getAdviceFromModel(CallBase &CB, OptimizationRemarkEmitter &ORE)
int64_t getIRSize(Function &F) const
std::function< bool(CallBase &)> GetDefaultAdvice
std::unique_ptr< InlineAdvice > getAdviceImpl(CallBase &CB) override
std::unique_ptr< InlineAdvice > getMandatoryAdvice(CallBase &CB, bool Advice) override
unsigned getInitialFunctionLevel(const Function &F) const
A Module instance is used to store all the information related to an LLVM module.
Definition Module.h:68
A mock class satisfying the interface expected by ReleaseModeModelRunner for its TGen parameter.
The optimization diagnostic interface.
Diagnostic information for missed-optimization remarks.
Diagnostic information for applied optimization remarks.
A set of analyses that are preserved following a run of a transformation pass.
Definition Analysis.h:112
static PreservedAnalyses all()
Construct a special preserved set that preserves all passes.
Definition Analysis.h:118
PreservedAnalyses & abandon()
Mark an analysis as abandoned.
Definition Analysis.h:171
An analysis pass based on the new PM to deliver ProfileSummaryInfo.
Analysis pass providing the TargetTransformInfo.
static TensorSpec createSpec(const std::string &Name, const std::vector< int64_t > &Shape, int Port=0)
Definition TensorSpec.h:65
Twine - A lightweight data structure for efficiently representing the concatenation of temporary valu...
Definition Twine.h:82
LLVM_ABI StringRef getName() const
Return a constant reference to the value's name.
Definition Value.cpp:319
bool contains(const_arg_type_t< ValueT > V) const
Check if the set contains the given element.
Definition DenseSet.h:182
const ParentTy * getParent() const
Definition ilist_node.h:34
This class implements an extremely fast bulk output stream that can only output to a stream.
Definition raw_ostream.h:53
#define llvm_unreachable(msg)
Marks that the current location is not supposed to be reachable.
ValuesClass values(OptsTy... Options)
Helper to build a ValuesClass by forwarding a variable number of arguments as an initializer list to ...
initializer< Ty > init(const Ty &Val)
Add a small namespace to avoid name clashes with the classes used in the streaming interface.
This is an optimization pass for GlobalISel generic memory operations.
constexpr FeatureIndex inlineCostFeatureToMlFeature(InlineCostFeatureIndex Feature)
LLVM_ABI const char *const DefaultDecisionName
decltype(auto) dyn_cast(const From &Val)
dyn_cast<X> - Return the argument parameter cast to the specified type.
Definition Casting.h:643
scc_iterator< T > scc_begin(const T &G)
Construct the begin iterator for a deduced graph type T.
LLVM_ABI std::unique_ptr< InlineAdvisor > getReleaseModeAdvisor(Module &M, ModuleAnalysisManager &MAM, std::function< bool(CallBase &)> GetDefaultAdvice)
InnerAnalysisManagerProxy< FunctionAnalysisManager, Module > FunctionAnalysisManagerModuleProxy
Provide the FunctionAnalysisManager to Module proxy.
bool isReleaseModelValid(StringRef InteractiveChannelBaseName, const cl::opt< EnumType, ExternalStorage, ParserClass > &SelectedModel, EnumType DefaultModelVal=EnumType::Default)
Helper to check if a release-mode ML advisor has a valid model to execute.
Definition MLGOUtils.h:35
OutputIt transform(R &&Range, OutputIt d_first, UnaryFunction F)
Wrapper function around std::transform to apply a function to a range and store the result elsewhere.
Definition STLExtras.h:2042
LLVM_ABI const TensorSpec DefaultDecisionSpec
std::unique_ptr< MLModelRunner > createReleaseModeModelRunner(LLVMContext &Ctx, const std::vector< TensorSpec > &InputFeatures, StringRef DecisionName, const std::string &InteractiveChannelBaseName, const TensorSpec &InteractiveDecisionSpec, CreateEmitCFunc &&CreateEmitCModelRunner, const EmbeddedModelRunnerOptions &Options={})
Helper to construct the appropriate MLModelRunner in release mode:
Definition MLGOUtils.h:61
LLVM_ABI const char *const DecisionName
static const std::vector< TensorSpec > InputFeatures
LLVM_ABI std::optional< InlineCostFeatures > getInliningCostFeatures(CallBase &Call, TargetTransformInfo &CalleeTTI, function_ref< AssumptionCache &(Function &)> GetAssumptionCache, function_ref< BlockFrequencyInfo &(Function &)> GetBFI=nullptr, function_ref< const TargetLibraryInfo &(Function &)> GetTLI=nullptr, ProfileSummaryInfo *PSI=nullptr, OptimizationRemarkEmitter *ORE=nullptr)
Get the expanded cost features.
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
LLVM_ABI const TensorSpec InlineDecisionSpec
LLVM_ABI const char *const RewardName
LLVM_ABI std::optional< int > getInliningCostEstimate(CallBase &Call, TargetTransformInfo &CalleeTTI, function_ref< AssumptionCache &(Function &)> GetAssumptionCache, function_ref< BlockFrequencyInfo &(Function &)> GetBFI=nullptr, function_ref< const TargetLibraryInfo &(Function &)> GetTLI=nullptr, ProfileSummaryInfo *PSI=nullptr, OptimizationRemarkEmitter *ORE=nullptr)
Get the cost estimate ignoring thresholds.
AnalysisManager< Function > FunctionAnalysisManager
Convenience typedef for the Function analysis manager.
AnalysisManager< Module > ModuleAnalysisManager
Convenience typedef for the Module analysis manager.
Definition MIRParser.h:39
#define N
ReleaseModeModelRunner - production mode implementation of the MLModelRunner.
Embedding is a datatype that wraps std::vector<double>.
Definition IR2Vec.h:88