LLVM 19.0.0git
Go to the documentation of this file.
1//===- Inliner.cpp - Code common to all inliners --------------------------===//
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
9// This file implements the mechanics required to implement inlining without
10// missing any calls and updating the call graph. The decisions of which calls
11// are profitable to inline are implemented elsewhere.
17#include "llvm/ADT/STLExtras.h"
18#include "llvm/ADT/ScopeExit.h"
19#include "llvm/ADT/SetVector.h"
22#include "llvm/ADT/Statistic.h"
24#include "llvm/ADT/StringRef.h"
37#include "llvm/IR/Attributes.h"
38#include "llvm/IR/BasicBlock.h"
39#include "llvm/IR/DebugLoc.h"
42#include "llvm/IR/Function.h"
44#include "llvm/IR/Instruction.h"
47#include "llvm/IR/Metadata.h"
48#include "llvm/IR/Module.h"
49#include "llvm/IR/PassManager.h"
50#include "llvm/IR/User.h"
51#include "llvm/IR/Value.h"
52#include "llvm/Pass.h"
55#include "llvm/Support/Debug.h"
61#include <algorithm>
62#include <cassert>
63#include <functional>
64#include <utility>
66using namespace llvm;
68#define DEBUG_TYPE "inline"
70STATISTIC(NumInlined, "Number of functions inlined");
71STATISTIC(NumDeleted, "Number of functions deleted because all callers found");
74 "intra-scc-cost-multiplier", cl::init(2), cl::Hidden,
76 "Cost multiplier to multiply onto inlined call sites where the "
77 "new call was previously an intra-SCC call (not relevant when the "
78 "original call was already intra-SCC). This can accumulate over "
79 "multiple inlinings (e.g. if a call site already had a cost "
80 "multiplier and one of its inlined calls was also subject to "
81 "this, the inlined call would have the original multiplier "
82 "multiplied by intra-scc-cost-multiplier). This is to prevent tons of "
83 "inlining through a child SCC which can cause terrible compile times"));
85/// A flag for test, so we can print the content of the advisor when running it
86/// as part of the default (e.g. -O3) pipeline.
87static cl::opt<bool> KeepAdvisorForPrinting("keep-inline-advisor-for-printing",
88 cl::init(false), cl::Hidden);
90/// Allows printing the contents of the advisor after each SCC inliner pass.
91static cl::opt<bool>
92 EnablePostSCCAdvisorPrinting("enable-scc-inline-advisor-printing",
93 cl::init(false), cl::Hidden);
97 "cgscc-inline-replay", cl::init(""), cl::value_desc("filename"),
99 "Optimization remarks file containing inline remarks to be replayed "
100 "by cgscc inlining."),
101 cl::Hidden);
104 "cgscc-inline-replay-scope",
105 cl::init(ReplayInlinerSettings::Scope::Function),
106 cl::values(clEnumValN(ReplayInlinerSettings::Scope::Function, "Function",
107 "Replay on functions that have remarks associated "
108 "with them (default)"),
109 clEnumValN(ReplayInlinerSettings::Scope::Module, "Module",
110 "Replay on the entire module")),
111 cl::desc("Whether inline replay should be applied to the entire "
112 "Module or just the Functions (default) that are present as "
113 "callers in remarks during cgscc inlining."),
114 cl::Hidden);
117 "cgscc-inline-replay-fallback",
118 cl::init(ReplayInlinerSettings::Fallback::Original),
121 ReplayInlinerSettings::Fallback::Original, "Original",
122 "All decisions not in replay send to original advisor (default)"),
123 clEnumValN(ReplayInlinerSettings::Fallback::AlwaysInline,
124 "AlwaysInline", "All decisions not in replay are inlined"),
125 clEnumValN(ReplayInlinerSettings::Fallback::NeverInline, "NeverInline",
126 "All decisions not in replay are not inlined")),
127 cl::desc(
128 "How cgscc inline replay treats sites that don't come from the replay. "
129 "Original: defers to original advisor, AlwaysInline: inline all sites "
130 "not in replay, NeverInline: inline no sites not in replay"),
131 cl::Hidden);
134 "cgscc-inline-replay-format",
135 cl::init(CallSiteFormat::Format::LineColumnDiscriminator),
137 clEnumValN(CallSiteFormat::Format::Line, "Line", "<Line Number>"),
138 clEnumValN(CallSiteFormat::Format::LineColumn, "LineColumn",
139 "<Line Number>:<Column Number>"),
140 clEnumValN(CallSiteFormat::Format::LineDiscriminator,
141 "LineDiscriminator", "<Line Number>.<Discriminator>"),
142 clEnumValN(CallSiteFormat::Format::LineColumnDiscriminator,
143 "LineColumnDiscriminator",
144 "<Line Number>:<Column Number>.<Discriminator> (default)")),
145 cl::desc("How cgscc inline replay file is formatted"), cl::Hidden);
147/// Return true if the specified inline history ID
148/// indicates an inline history that includes the specified function.
150 Function *F, int InlineHistoryID,
151 const SmallVectorImpl<std::pair<Function *, int>> &InlineHistory) {
152 while (InlineHistoryID != -1) {
153 assert(unsigned(InlineHistoryID) < InlineHistory.size() &&
154 "Invalid inline history ID");
155 if (InlineHistory[InlineHistoryID].first == F)
156 return true;
157 InlineHistoryID = InlineHistory[InlineHistoryID].second;
158 }
159 return false;
163InlinerPass::getAdvisor(const ModuleAnalysisManagerCGSCCProxy::Result &MAM,
165 if (OwnedAdvisor)
166 return *OwnedAdvisor;
169 if (!IAA) {
170 // It should still be possible to run the inliner as a stand-alone SCC pass,
171 // for test scenarios. In that case, we default to the
172 // DefaultInlineAdvisor, which doesn't need to keep state between SCC pass
173 // runs. It also uses just the default InlineParams.
174 // In this case, we need to use the provided FAM, which is valid for the
175 // duration of the inliner pass, and thus the lifetime of the owned advisor.
176 // The one we would get from the MAM can be invalidated as a result of the
177 // inliner's activity.
178 OwnedAdvisor = std::make_unique<DefaultInlineAdvisor>(
179 M, FAM, getInlineParams(),
182 if (!CGSCCInlineReplayFile.empty())
183 OwnedAdvisor = getReplayInlineAdvisor(
184 M, FAM, M.getContext(), std::move(OwnedAdvisor),
185 ReplayInlinerSettings{CGSCCInlineReplayFile,
186 CGSCCInlineReplayScope,
187 CGSCCInlineReplayFallback,
188 {CGSCCInlineReplayFormat}},
189 /*EmitRemarks=*/true,
192 return *OwnedAdvisor;
193 }
194 assert(IAA->getAdvisor() &&
195 "Expected a present InlineAdvisorAnalysis also have an "
196 "InlineAdvisor initialized");
197 return *IAA->getAdvisor();
202 CGSCCUpdateResult &UR) {
203 const auto &MAMProxy =
205 bool Changed = false;
207 assert(InitialC.size() > 0 && "Cannot handle an empty SCC!");
208 Module &M = *InitialC.begin()->getFunction().getParent();
209 ProfileSummaryInfo *PSI = MAMProxy.getCachedResult<ProfileSummaryAnalysis>(M);
213 .getManager();
215 InlineAdvisor &Advisor = getAdvisor(MAMProxy, FAM, M);
216 Advisor.onPassEntry(&InitialC);
218 auto AdvisorOnExit = make_scope_exit([&] { Advisor.onPassExit(&InitialC); });
220 // We use a single common worklist for calls across the entire SCC. We
221 // process these in-order and append new calls introduced during inlining to
222 // the end. The PriorityInlineOrder is optional here, in which the smaller
223 // callee would have a higher priority to inline.
224 //
225 // Note that this particular order of processing is actually critical to
226 // avoid very bad behaviors. Consider *highly connected* call graphs where
227 // each function contains a small amount of code and a couple of calls to
228 // other functions. Because the LLVM inliner is fundamentally a bottom-up
229 // inliner, it can handle gracefully the fact that these all appear to be
230 // reasonable inlining candidates as it will flatten things until they become
231 // too big to inline, and then move on and flatten another batch.
232 //
233 // However, when processing call edges *within* an SCC we cannot rely on this
234 // bottom-up behavior. As a consequence, with heavily connected *SCCs* of
235 // functions we can end up incrementally inlining N calls into each of
236 // N functions because each incremental inlining decision looks good and we
237 // don't have a topological ordering to prevent explosions.
238 //
239 // To compensate for this, we don't process transitive edges made immediate
240 // by inlining until we've done one pass of inlining across the entire SCC.
241 // Large, highly connected SCCs still lead to some amount of code bloat in
242 // this model, but it is uniformly spread across all the functions in the SCC
243 // and eventually they all become too large to inline, rather than
244 // incrementally maknig a single function grow in a super linear fashion.
247 // Populate the initial list of calls in this SCC.
248 for (auto &N : InitialC) {
249 auto &ORE =
251 // We want to generally process call sites top-down in order for
252 // simplifications stemming from replacing the call with the returned value
253 // after inlining to be visible to subsequent inlining decisions.
254 // FIXME: Using instructions sequence is a really bad way to do this.
255 // Instead we should do an actual RPO walk of the function body.
256 for (Instruction &I : instructions(N.getFunction()))
257 if (auto *CB = dyn_cast<CallBase>(&I))
258 if (Function *Callee = CB->getCalledFunction()) {
259 if (!Callee->isDeclaration())
260 Calls.push_back({CB, -1});
261 else if (!isa<IntrinsicInst>(I)) {
262 using namespace ore;
263 setInlineRemark(*CB, "unavailable definition");
264 ORE.emit([&]() {
265 return OptimizationRemarkMissed(DEBUG_TYPE, "NoDefinition", &I)
266 << NV("Callee", Callee) << " will not be inlined into "
267 << NV("Caller", CB->getCaller())
268 << " because its definition is unavailable"
269 << setIsVerbose();
270 });
271 }
272 }
273 }
274 if (Calls.empty())
275 return PreservedAnalyses::all();
277 // Capture updatable variable for the current SCC.
278 auto *C = &InitialC;
280 // When inlining a callee produces new call sites, we want to keep track of
281 // the fact that they were inlined from the callee. This allows us to avoid
282 // infinite inlining in some obscure cases. To represent this, we use an
283 // index into the InlineHistory vector.
286 // Track a set vector of inlined callees so that we can augment the caller
287 // with all of their edges in the call graph before pruning out the ones that
288 // got simplified away.
289 SmallSetVector<Function *, 4> InlinedCallees;
291 // Track the dead functions to delete once finished with inlining calls. We
292 // defer deleting these to make it easier to handle the call graph updates.
293 SmallVector<Function *, 4> DeadFunctions;
295 // Track potentially dead non-local functions with comdats to see if they can
296 // be deleted as a batch after inlining.
297 SmallVector<Function *, 4> DeadFunctionsInComdats;
299 // Loop forward over all of the calls. Note that we cannot cache the size as
300 // inlining can introduce new calls that need to be processed.
301 for (int I = 0; I < (int)Calls.size(); ++I) {
302 // We expect the calls to typically be batched with sequences of calls that
303 // have the same caller, so we first set up some shared infrastructure for
304 // this caller. We also do any pruning we can at this layer on the caller
305 // alone.
306 Function &F = *Calls[I].first->getCaller();
307 LazyCallGraph::Node &N = *CG.lookup(F);
308 if (CG.lookupSCC(N) != C)
309 continue;
311 LLVM_DEBUG(dbgs() << "Inlining calls in: " << F.getName() << "\n"
312 << " Function size: " << F.getInstructionCount()
313 << "\n");
315 auto GetAssumptionCache = [&](Function &F) -> AssumptionCache & {
317 };
319 // Now process as many calls as we have within this caller in the sequence.
320 // We bail out as soon as the caller has to change so we can update the
321 // call graph and prepare the context of that new caller.
322 bool DidInline = false;
323 for (; I < (int)Calls.size() && Calls[I].first->getCaller() == &F; ++I) {
324 auto &P = Calls[I];
325 CallBase *CB = P.first;
326 const int InlineHistoryID = P.second;
327 Function &Callee = *CB->getCalledFunction();
329 if (InlineHistoryID != -1 &&
330 inlineHistoryIncludes(&Callee, InlineHistoryID, InlineHistory)) {
331 LLVM_DEBUG(dbgs() << "Skipping inlining due to history: " << F.getName()
332 << " -> " << Callee.getName() << "\n");
333 setInlineRemark(*CB, "recursive");
334 // Set noinline so that we don't forget this decision across CGSCC
335 // iterations.
336 CB->setIsNoInline();
337 continue;
338 }
340 // Check if this inlining may repeat breaking an SCC apart that has
341 // already been split once before. In that case, inlining here may
342 // trigger infinite inlining, much like is prevented within the inliner
343 // itself by the InlineHistory above, but spread across CGSCC iterations
344 // and thus hidden from the full inline history.
345 LazyCallGraph::SCC *CalleeSCC = CG.lookupSCC(*CG.lookup(Callee));
346 if (CalleeSCC == C && UR.InlinedInternalEdges.count({&N, C})) {
347 LLVM_DEBUG(dbgs() << "Skipping inlining internal SCC edge from a node "
348 "previously split out of this SCC by inlining: "
349 << F.getName() << " -> " << Callee.getName() << "\n");
350 setInlineRemark(*CB, "recursive SCC split");
351 continue;
352 }
354 std::unique_ptr<InlineAdvice> Advice =
355 Advisor.getAdvice(*CB, OnlyMandatory);
357 // Check whether we want to inline this callsite.
358 if (!Advice)
359 continue;
361 if (!Advice->isInliningRecommended()) {
362 Advice->recordUnattemptedInlining();
363 continue;
364 }
366 int CBCostMult =
369 .value_or(1);
371 // Setup the data structure used to plumb customization into the
372 // `InlineFunction` routine.
374 GetAssumptionCache, PSI,
379 InlineFunction(*CB, IFI, /*MergeAttributes=*/true,
380 &FAM.getResult<AAManager>(*CB->getCaller()));
381 if (!IR.isSuccess()) {
382 Advice->recordUnsuccessfulInlining(IR);
383 continue;
384 }
386 DidInline = true;
387 InlinedCallees.insert(&Callee);
388 ++NumInlined;
390 LLVM_DEBUG(dbgs() << " Size after inlining: "
391 << F.getInstructionCount() << "\n");
393 // Add any new callsites to defined functions to the worklist.
394 if (!IFI.InlinedCallSites.empty()) {
395 int NewHistoryID = InlineHistory.size();
396 InlineHistory.push_back({&Callee, InlineHistoryID});
398 for (CallBase *ICB : reverse(IFI.InlinedCallSites)) {
399 Function *NewCallee = ICB->getCalledFunction();
400 assert(!(NewCallee && NewCallee->isIntrinsic()) &&
401 "Intrinsic calls should not be tracked.");
402 if (!NewCallee) {
403 // Try to promote an indirect (virtual) call without waiting for
404 // the post-inline cleanup and the next DevirtSCCRepeatedPass
405 // iteration because the next iteration may not happen and we may
406 // miss inlining it.
407 if (tryPromoteCall(*ICB))
408 NewCallee = ICB->getCalledFunction();
409 }
410 if (NewCallee) {
411 if (!NewCallee->isDeclaration()) {
412 Calls.push_back({ICB, NewHistoryID});
413 // Continually inlining through an SCC can result in huge compile
414 // times and bloated code since we arbitrarily stop at some point
415 // when the inliner decides it's not profitable to inline anymore.
416 // We attempt to mitigate this by making these calls exponentially
417 // more expensive.
418 // This doesn't apply to calls in the same SCC since if we do
419 // inline through the SCC the function will end up being
420 // self-recursive which the inliner bails out on, and inlining
421 // within an SCC is necessary for performance.
422 if (CalleeSCC != C &&
423 CalleeSCC == CG.lookupSCC(CG.get(*NewCallee))) {
424 Attribute NewCBCostMult = Attribute::get(
425 M.getContext(),
427 itostr(CBCostMult * IntraSCCCostMultiplier));
428 ICB->addFnAttr(NewCBCostMult);
429 }
430 }
431 }
432 }
433 }
435 // For local functions or discardable functions without comdats, check
436 // whether this makes the callee trivially dead. In that case, we can drop
437 // the body of the function eagerly which may reduce the number of callers
438 // of other functions to one, changing inline cost thresholds. Non-local
439 // discardable functions with comdats are checked later on.
440 bool CalleeWasDeleted = false;
441 if (Callee.isDiscardableIfUnused() && Callee.hasZeroLiveUses() &&
442 !CG.isLibFunction(Callee)) {
443 if (Callee.hasLocalLinkage() || !Callee.hasComdat()) {
444 Calls.erase(
445 std::remove_if(Calls.begin() + I + 1, Calls.end(),
446 [&](const std::pair<CallBase *, int> &Call) {
447 return Call.first->getCaller() == &Callee;
448 }),
449 Calls.end());
451 // Clear the body and queue the function itself for deletion when we
452 // finish inlining and call graph updates.
453 // Note that after this point, it is an error to do anything other
454 // than use the callee's address or delete it.
455 Callee.dropAllReferences();
456 assert(!is_contained(DeadFunctions, &Callee) &&
457 "Cannot put cause a function to become dead twice!");
458 DeadFunctions.push_back(&Callee);
459 CalleeWasDeleted = true;
460 } else {
461 DeadFunctionsInComdats.push_back(&Callee);
462 }
463 }
464 if (CalleeWasDeleted)
465 Advice->recordInliningWithCalleeDeleted();
466 else
467 Advice->recordInlining();
468 }
470 // Back the call index up by one to put us in a good position to go around
471 // the outer loop.
472 --I;
474 if (!DidInline)
475 continue;
476 Changed = true;
478 // At this point, since we have made changes we have at least removed
479 // a call instruction. However, in the process we do some incremental
480 // simplification of the surrounding code. This simplification can
481 // essentially do all of the same things as a function pass and we can
482 // re-use the exact same logic for updating the call graph to reflect the
483 // change.
485 // Inside the update, we also update the FunctionAnalysisManager in the
486 // proxy for this particular SCC. We do this as the SCC may have changed and
487 // as we're going to mutate this particular function we want to make sure
488 // the proxy is in place to forward any invalidation events.
489 LazyCallGraph::SCC *OldC = C;
491 LLVM_DEBUG(dbgs() << "Updated inlining SCC: " << *C << "\n");
493 // If this causes an SCC to split apart into multiple smaller SCCs, there
494 // is a subtle risk we need to prepare for. Other transformations may
495 // expose an "infinite inlining" opportunity later, and because of the SCC
496 // mutation, we will revisit this function and potentially re-inline. If we
497 // do, and that re-inlining also has the potentially to mutate the SCC
498 // structure, the infinite inlining problem can manifest through infinite
499 // SCC splits and merges. To avoid this, we capture the originating caller
500 // node and the SCC containing the call edge. This is a slight over
501 // approximation of the possible inlining decisions that must be avoided,
502 // but is relatively efficient to store. We use C != OldC to know when
503 // a new SCC is generated and the original SCC may be generated via merge
504 // in later iterations.
505 //
506 // It is also possible that even if no new SCC is generated
507 // (i.e., C == OldC), the original SCC could be split and then merged
508 // into the same one as itself. and the original SCC will be added into
509 // UR.CWorklist again, we want to catch such cases too.
510 //
511 // FIXME: This seems like a very heavyweight way of retaining the inline
512 // history, we should look for a more efficient way of tracking it.
513 if ((C != OldC || UR.CWorklist.count(OldC)) &&
514 llvm::any_of(InlinedCallees, [&](Function *Callee) {
515 return CG.lookupSCC(*CG.lookup(*Callee)) == OldC;
516 })) {
517 LLVM_DEBUG(dbgs() << "Inlined an internal call edge and split an SCC, "
518 "retaining this to avoid infinite inlining.\n");
519 UR.InlinedInternalEdges.insert({&N, OldC});
520 }
521 InlinedCallees.clear();
523 // Invalidate analyses for this function now so that we don't have to
524 // invalidate analyses for all functions in this SCC later.
526 }
528 // We must ensure that we only delete functions with comdats if every function
529 // in the comdat is going to be deleted.
530 if (!DeadFunctionsInComdats.empty()) {
531 filterDeadComdatFunctions(DeadFunctionsInComdats);
532 for (auto *Callee : DeadFunctionsInComdats)
533 Callee->dropAllReferences();
534 DeadFunctions.append(DeadFunctionsInComdats);
535 }
537 // Now that we've finished inlining all of the calls across this SCC, delete
538 // all of the trivially dead functions, updating the call graph and the CGSCC
539 // pass manager in the process.
540 //
541 // Note that this walks a pointer set which has non-deterministic order but
542 // that is OK as all we do is delete things and add pointers to unordered
543 // sets.
544 for (Function *DeadF : DeadFunctions) {
545 // Get the necessary information out of the call graph and nuke the
546 // function there. Also, clear out any cached analyses.
547 auto &DeadC = *CG.lookupSCC(*CG.lookup(*DeadF));
548 FAM.clear(*DeadF, DeadF->getName());
549 AM.clear(DeadC, DeadC.getName());
550 auto &DeadRC = DeadC.getOuterRefSCC();
551 CG.removeDeadFunction(*DeadF);
553 // Mark the relevant parts of the call graph as invalid so we don't visit
554 // them.
555 UR.InvalidatedSCCs.insert(&DeadC);
556 UR.InvalidatedRefSCCs.insert(&DeadRC);
558 // If the updated SCC was the one containing the deleted function, clear it.
559 if (&DeadC == UR.UpdatedC)
560 UR.UpdatedC = nullptr;
562 // And delete the actual function from the module.
563 M.getFunctionList().erase(DeadF);
565 ++NumDeleted;
566 }
568 if (!Changed)
569 return PreservedAnalyses::all();
572 // Even if we change the IR, we update the core CGSCC data structures and so
573 // can preserve the proxy to the function analysis manager.
575 // We have already invalidated all analyses on modified functions.
577 return PA;
581 bool MandatoryFirst,
582 InlineContext IC,
584 unsigned MaxDevirtIterations)
585 : Params(Params), IC(IC), Mode(Mode),
587 // Run the inliner first. The theory is that we are walking bottom-up and so
588 // the callees have already been fully optimized, and we want to inline them
589 // into the callers so that our optimizations can reflect that.
590 // For PreLinkThinLTO pass, we disable hot-caller heuristic for sample PGO
591 // because it makes profile annotation in the backend inaccurate.
592 if (MandatoryFirst) {
593 PM.addPass(InlinerPass(/*OnlyMandatory*/ true));
596 }
597 PM.addPass(InlinerPass());
604 auto &IAA = MAM.getResult<InlineAdvisorAnalysis>(M);
605 if (!IAA.tryCreate(Params, Mode,
606 {CGSCCInlineReplayFile,
607 CGSCCInlineReplayScope,
608 CGSCCInlineReplayFallback,
609 {CGSCCInlineReplayFormat}},
610 IC)) {
611 M.getContext().emitError(
612 "Could not setup Inlining Advisor for the requested "
613 "mode and/or options");
614 return PreservedAnalyses::all();
615 }
617 // We wrap the CGSCC pipeline in a devirtualization repeater. This will try
618 // to detect when we devirtualize indirect calls and iterate the SCC passes
619 // in that case to try and catch knock-on inlining or function attrs
620 // opportunities. Then we add it to the module pipeline by walking the SCCs
621 // in postorder (or bottom-up).
622 // If MaxDevirtIterations is 0, we just don't use the devirtualization
623 // wrapper.
624 if (MaxDevirtIterations == 0)
626 else
630 MPM.addPass(std::move(AfterCGMPM));
631 MPM.run(M, MAM);
633 // Discard the InlineAdvisor, a subsequent inlining session should construct
634 // its own.
635 auto PA = PreservedAnalyses::all();
637 PA.abandon<InlineAdvisorAnalysis>();
638 return PA;
642 raw_ostream &OS, function_ref<StringRef(StringRef)> MapClassName2PassName) {
643 static_cast<PassInfoMixin<InlinerPass> *>(this)->printPipeline(
644 OS, MapClassName2PassName);
645 if (OnlyMandatory)
646 OS << "<only-mandatory>";
650 raw_ostream &OS, function_ref<StringRef(StringRef)> MapClassName2PassName) {
651 // Print some info about passes added to the wrapper. This is however
652 // incomplete as InlineAdvisorAnalysis part isn't included (which also depends
653 // on Params and Mode).
654 if (!MPM.isEmpty()) {
655 MPM.printPipeline(OS, MapClassName2PassName);
656 OS << ',';
657 }
658 OS << "cgscc(";
659 if (MaxDevirtIterations != 0)
660 OS << "devirt<" << MaxDevirtIterations << ">(";
661 PM.printPipeline(OS, MapClassName2PassName);
662 if (MaxDevirtIterations != 0)
663 OS << ')';
664 OS << ')';
Expand Atomic instructions
This file contains the simple types necessary to represent the attributes associated with functions a...
This is the interface for LLVM's primary stateless and local alias analysis.
This header provides classes for managing passes over SCCs of the call graph.
Definition: CommandLine.h:693
#define LLVM_DEBUG(X)
Definition: Debug.h:101
#define DEBUG_TYPE
static bool inlineHistoryIncludes(Function *F, int InlineHistoryID, const SmallVectorImpl< std::pair< Function *, int > > &InlineHistory)
Return true if the specified inline history ID indicates an inline history that includes the specifie...
Definition: Inliner.cpp:149
static cl::opt< ReplayInlinerSettings::Scope > CGSCCInlineReplayScope("cgscc-inline-replay-scope", cl::init(ReplayInlinerSettings::Scope::Function), cl::values(clEnumValN(ReplayInlinerSettings::Scope::Function, "Function", "Replay on functions that have remarks associated " "with them (default)"), clEnumValN(ReplayInlinerSettings::Scope::Module, "Module", "Replay on the entire module")), cl::desc("Whether inline replay should be applied to the entire " "Module or just the Functions (default) that are present as " "callers in remarks during cgscc inlining."), cl::Hidden)
static cl::opt< bool > KeepAdvisorForPrinting("keep-inline-advisor-for-printing", cl::init(false), cl::Hidden)
A flag for test, so we can print the content of the advisor when running it as part of the default (e...
static cl::opt< std::string > CGSCCInlineReplayFile("cgscc-inline-replay", cl::init(""), cl::value_desc("filename"), cl::desc("Optimization remarks file containing inline remarks to be replayed " "by cgscc inlining."), cl::Hidden)
static cl::opt< bool > EnablePostSCCAdvisorPrinting("enable-scc-inline-advisor-printing", cl::init(false), cl::Hidden)
Allows printing the contents of the advisor after each SCC inliner pass.
static cl::opt< int > IntraSCCCostMultiplier("intra-scc-cost-multiplier", cl::init(2), cl::Hidden, cl::desc("Cost multiplier to multiply onto inlined call sites where the " "new call was previously an intra-SCC call (not relevant when the " "original call was already intra-SCC). This can accumulate over " "multiple inlinings (e.g. if a call site already had a cost " "multiplier and one of its inlined calls was also subject to " "this, the inlined call would have the original multiplier " "multiplied by intra-scc-cost-multiplier). This is to prevent tons of " "inlining through a child SCC which can cause terrible compile times"))
static cl::opt< CallSiteFormat::Format > CGSCCInlineReplayFormat("cgscc-inline-replay-format", cl::init(CallSiteFormat::Format::LineColumnDiscriminator), cl::values(clEnumValN(CallSiteFormat::Format::Line, "Line", "<Line Number>"), clEnumValN(CallSiteFormat::Format::LineColumn, "LineColumn", "<Line Number>:<Column Number>"), clEnumValN(CallSiteFormat::Format::LineDiscriminator, "LineDiscriminator", "<Line Number>.<Discriminator>"), clEnumValN(CallSiteFormat::Format::LineColumnDiscriminator, "LineColumnDiscriminator", "<Line Number>:<Column Number>.<Discriminator> (default)")), cl::desc("How cgscc inline replay file is formatted"), cl::Hidden)
static cl::opt< ReplayInlinerSettings::Fallback > CGSCCInlineReplayFallback("cgscc-inline-replay-fallback", cl::init(ReplayInlinerSettings::Fallback::Original), cl::values(clEnumValN(ReplayInlinerSettings::Fallback::Original, "Original", "All decisions not in replay send to original advisor (default)"), clEnumValN(ReplayInlinerSettings::Fallback::AlwaysInline, "AlwaysInline", "All decisions not in replay are inlined"), clEnumValN(ReplayInlinerSettings::Fallback::NeverInline, "NeverInline", "All decisions not in replay are not inlined")), cl::desc("How cgscc inline replay treats sites that don't come from the replay. " "Original: defers to original advisor, AlwaysInline: inline all sites " "not in replay, NeverInline: inline no sites not in replay"), cl::Hidden)
Implements a lazy call graph analysis and related passes for the new pass manager.
Legalize the Machine IR a function s Machine IR
Definition: Legalizer.cpp:81
#define F(x, y, z)
Definition: MD5.cpp:55
#define I(x, y, z)
Definition: MD5.cpp:58
This file contains the declarations for metadata subclasses.
Module.h This file contains the declarations for the Module class.
#define P(N)
ModulePassManager MPM
FunctionAnalysisManager FAM
ModuleAnalysisManager MAM
This header defines various interfaces for pass management in LLVM.
This file provides a priority worklist.
assert(ImpDefSCC.getReg()==AMDGPU::SCC &&ImpDefSCC.isDef())
This file contains some templates that are useful if you are working with the STL at all.
raw_pwrite_stream & OS
This file defines the make_scope_exit function, which executes user-defined cleanup logic at scope ex...
This file implements a set that has insertion order iteration characteristics.
This file defines the SmallPtrSet class.
This file defines the SmallVector class.
This file defines the 'Statistic' class, which is designed to be an easy way to expose various metric...
Definition: Statistic.h:167
This file contains some functions that are useful when dealing with strings.
A manager for alias analyses.
This templated class represents "all analyses that operate over <a particular IR unit>" (e....
Definition: Analysis.h:47
A container for analyses that lazily runs them and caches their results.
Definition: PassManager.h:321
void clear(IRUnitT &IR, llvm::StringRef Name)
Clear any cached analysis results for a single unit of IR.
void invalidate(IRUnitT &IR, const PreservedAnalyses &PA)
Invalidate cached analyses for an IR unit.
PassT::Result * getCachedResult(IRUnitT &IR) const
Get the cached result of an analysis pass for a given IR unit.
Definition: PassManager.h:492
PassT::Result & getResult(IRUnitT &IR, ExtraArgTs... ExtraArgs)
Get the result of an analysis pass for a given IR unit.
Definition: PassManager.h:473
A function analysis which provides an AssumptionCache.
A cache of @llvm.assume calls within a function.
static Attribute get(LLVMContext &Context, AttrKind Kind, uint64_t Val=0)
Return a uniquified Attribute object.
Definition: Attributes.cpp:93
Analysis pass which computes BlockFrequencyInfo.
Base class for all callable instructions (InvokeInst and CallInst) Holds everything related to callin...
Definition: InstrTypes.h:1494
Function * getCalledFunction() const
Returns the function called, or null if this is an indirect function invocation or the function signa...
Definition: InstrTypes.h:1742
void setIsNoInline()
Definition: InstrTypes.h:2243
Function * getCaller()
Helper to get the caller (the parent function).
A proxy from a FunctionAnalysisManager to an SCC.
bool isIntrinsic() const
isIntrinsic - Returns true if the function's name starts with "llvm.".
Definition: Function.h:237
bool isDeclaration() const
Return true if the primary definition of this global value is outside of the current translation unit...
Definition: Globals.cpp:286
Printer pass for the InlineAdvisorAnalysis results.
The InlineAdvisorAnalysis is a module pass because the InlineAdvisor needs to capture state right bef...
Interface for deciding whether to inline a call site or not.
virtual void onPassEntry(LazyCallGraph::SCC *SCC=nullptr)
This must be called when the Inliner pass is entered, to allow the InlineAdvisor update internal stat...
virtual void onPassExit(LazyCallGraph::SCC *SCC=nullptr)
This must be called when the Inliner pass is exited, as function passes may be run subsequently.
This class captures the data input to the InlineFunction call, and records the auxiliary results prod...
Definition: Cloning.h:202
InlineResult is basically true or false.
Definition: InlineCost.h:180
The inliner pass for the new pass manager.
Definition: Inliner.h:35
void printPipeline(raw_ostream &OS, function_ref< StringRef(StringRef)> MapClassName2PassName)
Definition: Inliner.cpp:641
PreservedAnalyses run(LazyCallGraph::SCC &C, CGSCCAnalysisManager &AM, LazyCallGraph &CG, CGSCCUpdateResult &UR)
Definition: Inliner.cpp:200
A node in the call graph.
An SCC of the call graph.
iterator begin() const
A lazily constructed view of the call graph of a module.
PreservedAnalyses run(Module &, ModuleAnalysisManager &)
Definition: Inliner.cpp:602
void printPipeline(raw_ostream &OS, function_ref< StringRef(StringRef)> MapClassName2PassName)
Definition: Inliner.cpp:649
ModuleInlinerWrapperPass(InlineParams Params=getInlineParams(), bool MandatoryFirst=true, InlineContext IC={}, InliningAdvisorMode Mode=InliningAdvisorMode::Default, unsigned MaxDevirtIterations=0)
Definition: Inliner.cpp:580
A Module instance is used to store all the information related to an LLVM module.
Definition: Module.h:65
Diagnostic information for missed-optimization remarks.
Result proxy object for OuterAnalysisManagerProxy.
Definition: PassManager.h:759
An analysis over an "inner" IR unit that provides access to an analysis manager over a "outer" IR uni...
Definition: PassManager.h:756
void printPipeline(raw_ostream &OS, function_ref< StringRef(StringRef)> MapClassName2PassName)
Definition: PassManager.h:189
LLVM_ATTRIBUTE_MINSIZE void addPass(PassT &&Pass)
Definition: PassManager.h:249
PreservedAnalyses run(IRUnitT &IR, AnalysisManagerT &AM, ExtraArgTs... ExtraArgs)
Run all of the passes in this manager over the given unit of IR.
Definition: PassManager.h:201
bool isEmpty() const
Returns if the pass manager contains any passes.
Definition: PassManager.h:269
A set of analyses that are preserved following a run of a transformation pass.
Definition: Analysis.h:109
static PreservedAnalyses none()
Convenience factory function for the empty preserved set.
Definition: Analysis.h:112
static PreservedAnalyses all()
Construct a special preserved set that preserves all passes.
Definition: Analysis.h:115
void preserveSet()
Mark an analysis set as preserved.
Definition: Analysis.h:144
void preserve()
Mark an analysis as preserved.
Definition: Analysis.h:129
An analysis pass based on the new PM to deliver ProfileSummaryInfo.
Analysis providing profile information.
void clear()
Completely clear the SetVector.
Definition: SetVector.h:273
bool insert(const value_type &X)
Insert a new element into the SetVector.
Definition: SetVector.h:162
A SetVector that performs no allocations if smaller than a certain size.
Definition: SetVector.h:370
bool empty() const
Definition: SmallVector.h:94
size_t size() const
Definition: SmallVector.h:91
This class consists of common code factored out of the SmallVector class to reduce code duplication b...
Definition: SmallVector.h:586
void append(ItTy in_start, ItTy in_end)
Add the specified range to the end of the SmallVector.
Definition: SmallVector.h:696
void push_back(const T &Elt)
Definition: SmallVector.h:426
This is a 'vector' (really, a variable-sized array), optimized for the case when the array is small.
Definition: SmallVector.h:1209
StringRef - Represent a constant reference to a string, i.e.
Definition: StringRef.h:50
An efficient, type-erasing, non-owning reference to a callable.
This class implements an extremely fast bulk output stream that can only output to a stream.
Definition: raw_ostream.h:52
@ C
The default llvm calling convention, compatible with C.
Definition: CallingConv.h:34
const char FunctionInlineCostMultiplierAttributeName[]
Definition: InlineCost.h:59
ValuesClass values(OptsTy... Options)
Helper to build a ValuesClass by forwarding a variable number of arguments as an initializer list to ...
Definition: CommandLine.h:718
initializer< Ty > init(const Ty &Val)
Definition: CommandLine.h:450
This is an optimization pass for GlobalISel generic memory operations.
Definition: AddressRanges.h:18
detail::scope_exit< std::decay_t< Callable > > make_scope_exit(Callable &&F)
Definition: ScopeExit.h:59
There are 4 scenarios we can use the InlineAdvisor:
Definition: InlineAdvisor.h:43
std::optional< int > getStringFnAttrAsInt(CallBase &CB, StringRef AttrKind)
Definition: InlineCost.cpp:186
DevirtSCCRepeatedPass createDevirtSCCRepeatedPass(CGSCCPassT &&Pass, int MaxIterations)
A function to deduce a function pass type and wrap it in the templated adaptor.
LazyCallGraph::SCC & updateCGAndAnalysisManagerForCGSCCPass(LazyCallGraph &G, LazyCallGraph::SCC &C, LazyCallGraph::Node &N, CGSCCAnalysisManager &AM, CGSCCUpdateResult &UR, FunctionAnalysisManager &FAM)
Helper to update the call graph after running a CGSCC pass.
void setInlineRemark(CallBase &CB, StringRef Message)
Set the inline-remark attribute.
bool any_of(R &&range, UnaryPredicate P)
Provide wrappers to std::any_of which take ranges instead of having to pass begin/end explicitly.
Definition: STLExtras.h:1729
ModuleToPostOrderCGSCCPassAdaptor createModuleToPostOrderCGSCCPassAdaptor(CGSCCPassT &&Pass)
A function to deduce a function pass type and wrap it in the templated adaptor.
auto reverse(ContainerTy &&C)
Definition: STLExtras.h:419
raw_ostream & dbgs()
dbgs() - This returns a reference to a raw_ostream for debugging messages.
Definition: Debug.cpp:163
std::unique_ptr< InlineAdvisor > getReplayInlineAdvisor(Module &M, FunctionAnalysisManager &FAM, LLVMContext &Context, std::unique_ptr< InlineAdvisor > OriginalAdvisor, const ReplayInlinerSettings &ReplaySettings, bool EmitRemarks, InlineContext IC)
InlineResult InlineFunction(CallBase &CB, InlineFunctionInfo &IFI, bool MergeAttributes=false, AAResults *CalleeAAR=nullptr, bool InsertLifetime=true, Function *ForwardVarArgsTo=nullptr)
This function inlines the called function into the basic block of the caller.
InlineParams getInlineParams()
Generate the parameters to tune the inline cost analysis based only on the commandline options.
bool is_contained(R &&Range, const E &Element)
Returns true if Element is found in Range.
Definition: STLExtras.h:1879
void filterDeadComdatFunctions(SmallVectorImpl< Function * > &DeadComdatFunctions)
Filter out potentially dead comdat functions where other entries keep the entire comdat group alive.
bool tryPromoteCall(CallBase &CB)
Try to promote (devirtualize) a virtual call on an Alloca.
cl::opt< unsigned > MaxDevirtIterations("max-devirt-iterations", cl::ReallyHidden, cl::init(4))
#define N
Support structure for SCC passes to communicate updates the call graph back to the CGSCC pass manager...
Provides context on when an inline advisor is constructed in the pipeline (e.g., link phase,...
Definition: InlineAdvisor.h:59
Thresholds to tune inline cost analysis.
Definition: InlineCost.h:206
A CRTP mix-in to automatically provide informational APIs needed for passes.
Definition: PassManager.h:74