| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| CFGPrinter.cpp | 59 BranchProbabilityInfo *BPI, uint64_t MaxFreq,
68 DOTFuncInfo CFGInfo(&F, BFI, BPI, MaxFreq);
81 const BranchProbabilityInfo *BPI, uint64_t MaxFreq,
83 DOTFuncInfo CFGInfo(&F, BFI, BPI, MaxFreq);
99 auto *BPI = &getAnalysis<BranchProbabilityInfoWrapperPass>().getBPI();
101 viewCFG(F, BFI, BPI, getMaxFreq(F, BFI));
122 auto *BPI = &AM.getResult<BranchProbabilityAnalysis>(F);
123 viewCFG(F, BFI, BPI, getMaxFreq(F, BFI));
135 auto *BPI = &getAnalysis<BranchProbabilityInfoWrapperPass>().getBPI();
137 viewCFG(F, BFI, BPI, getMaxFreq(F, BFI), /*CFGOnly=*/true)
[all...] |
| BlockFrequencyInfo.cpp | 157 const BranchProbabilityInfo &BPI,
159 calculate(F, BPI, LI);
187 const BranchProbabilityInfo &BPI,
191 BFI->calculate(F, BPI, LI);
327 BranchProbabilityInfo &BPI =
330 BFI.calculate(F, BPI, LI);
|
| OptimizationRemarkEmitter.cpp | 40 BranchProbabilityInfo BPI(*F, LI, nullptr, &DT, nullptr);
43 OwnedBFI = std::make_unique<BlockFrequencyInfo>(*F, BPI, LI);
|
| BranchProbabilityInfo.cpp | 52 "print-bpi", cl::init(false), cl::Hidden,
56 "print-bpi-func-name", cl::Hidden,
157 LLVM_DEBUG(dbgs() << "BPI: SCC " << SccNum << ":");
1329 BPI.calculate(F, LI, &TLI, &DT, &PDT);
1333 void BranchProbabilityInfoWrapperPass::releaseMemory() { BPI.releaseMemory(); }
1337 BPI.print(OS);
1343 BranchProbabilityInfo BPI;
1344 BPI.calculate(F, AM.getResult<LoopAnalysis>(F),
1348 return BPI;
1353 OS << "Printing analysis results of BPI for function
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| LazyBranchProbabilityInfo.h | 11 // computed when the analysis pass is executed but rather when the BPI results
31 /// rather when the BPI results is explicitly requested by the analysis client.
44 /// 3. The computed BPI should be requested with
52 /// Wraps a BPI to allow lazy computation of the branch probabilities.
54 /// A pass that only conditionally uses BPI can uncondtionally require the
55 /// analysis without paying for the overhead if BPI doesn't end up being used.
62 /// Retrieve the BPI with the branch probabilities computed.
66 BPI.calculate(*F, *LI, TLI, nullptr, nullptr);
69 return BPI;
77 BranchProbabilityInfo BPI;
[all...] |
| BranchProbabilityInfo.h | 279 BranchProbabilityInfo *BPI;
282 assert(BPI != nullptr);
283 BPI->eraseBlock(cast<BasicBlock>(getValPtr()));
287 BasicBlockCallbackVH(const Value *V, BranchProbabilityInfo *BPI = nullptr)
288 : CallbackVH(const_cast<Value *>(V)), BPI(BPI) {}
430 /// Run the analysis pass over a function and produce BPI.
447 BranchProbabilityInfo BPI;
454 BranchProbabilityInfo &getBPI() { return BPI; }
455 const BranchProbabilityInfo &getBPI() const { return BPI; }
[all...] |
| CFGPrinter.h | 58 const BranchProbabilityInfo *BPI;
68 const BranchProbabilityInfo *BPI, uint64_t MaxFreq)
69 : F(F), BFI(BFI), BPI(BPI), MaxFreq(MaxFreq) {
71 EdgeWeights = !!BPI; // Print EdgeWeights when BPI is available.
77 const BranchProbabilityInfo *getBPI() { return BPI; }
|
| BlockFrequencyInfo.h | 44 BlockFrequencyInfo(const Function &F, const BranchProbabilityInfo &BPI,
92 void calculate(const Function &F, const BranchProbabilityInfo &BPI,
|
| BlockFrequencyInfoImpl.h | 864 const BranchProbabilityInfoT *BPI = nullptr;
975 void calculate(const FunctionT &F, const BranchProbabilityInfoT &BPI,
1015 const BranchProbabilityInfoT &getBPI() const { return *BPI; }
1072 const BranchProbabilityInfoT &BPI,
1075 this->BPI = &BPI;
1386 getWeightFromBranchProb(BPI->getEdgeProbability(BB, SI))))
1560 const BranchProbabilityInfoT *BPI,
1563 if (!BPI)
1566 BranchProbability BP = BPI->getEdgeProbability(Node, EI)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/ExecutionEngine/Orc/ |
| SpeculateAnalyses.cpp | 151 const BranchProbabilityInfo *BPI,
186 if (BPI->isEdgeHot(*PIt, AtBB) && !PredSkipNodes.count(*PIt))
187 traverseToEntryBlock(*PIt, CallerBlocks, BackEdgesInfo, BPI,
194 const BranchProbabilityInfo *BPI,
225 if (BPI->isEdgeHot(AtBB, *PIt) && !SuccSkipNodes.count(*PIt))
226 traverseToExitBlock(*PIt, CallerBlocks, BackEdgesInfo, BPI,
260 BranchProbabilityInfo *BPI =
268 traverseToEntryBlock(I.first, CallerBlocks, BackEdgesInfo, BPI,
270 traverseToExitBlock(I.first, CallerBlocks, BackEdgesInfo, BPI,
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/ |
| CodeExtractor.h | 92 BranchProbabilityInfo *BPI;
121 BranchProbabilityInfo *BPI = nullptr,
132 BranchProbabilityInfo *BPI = nullptr,
226 BranchProbabilityInfo *BPI);
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-mca/Views/ |
| BottleneckAnalysis.cpp | 299 if (!SeenStallCycles || !BPI.PressureIncreaseCycles)
451 SeenStallCycles(false), BPI() {}
573 ++BPI.PressureIncreaseCycles;
575 ++BPI.RegisterDependencyCycles;
577 ++BPI.MemoryDependencyCycles;
579 ++BPI.DataDependencyCycles;
581 ++BPI.ResourcePressureCycles;
588 if (!SeenStallCycles || !BPI.PressureIncreaseCycles) {
594 (double)BPI.PressureIncreaseCycles * 100 / TotalCycles;
596 (double)BPI.ResourcePressureCycles * 100 / TotalCycles
[all...] |
| BottleneckAnalysis.h | 311 BackPressureInfo BPI;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Scalar/ |
| JumpThreading.h | 85 std::unique_ptr<BranchProbabilityInfo> BPI;
105 std::unique_ptr<BranchProbabilityInfo> BPI);
111 BPI.reset();
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/ |
| CFGMST.h | 141 if (BPI != nullptr)
142 Weight = BPI->getEdgeProbability(&BB, TargetBB).scale(scaleFactor);
278 BranchProbabilityInfo *BPI;
288 : F(Func), BPI(BPI_), BFI(BFI_),
|
| PGOInstrumentation.cpp | 611 bool CreateGlobalVar = false, BranchProbabilityInfo *BPI = nullptr,
616 MST(F, InstrumentFuncEntry, BPI, BFI) {
895 Function &F, Module *M, TargetLibraryInfo &TLI, BranchProbabilityInfo *BPI,
901 SplitIndirectBrCriticalEdges(F, BPI, BFI);
904 F, TLI, ComdatMembers, true, BPI, BFI, IsCS, PGOInstrumentEntry);
1061 BranchProbabilityInfo *BPI, BlockFrequencyInfo *BFIin,
1064 FuncInfo(Func, TLI, ComdatMembers, false, BPI, BFIin, IsCS,
1623 auto *BPI = LookupBPI(F);
1625 instrumentOneFunc(F, &M, TLI, BPI, BFI, ComdatMembers, IsCS);
1853 auto *BPI = LookupBPI(F)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| BreakCriticalEdges.cpp | 352 BranchProbabilityInfo *BPI,
370 bool ShouldUpdateAnalysis = BPI && BFI;
391 EdgeProbabilities.emplace_back(BPI->getEdgeProbability(Target, I));
392 BPI->eraseBlock(Target);
397 // Copy the BFI/BPI from Target to BodyBlock.
398 BPI->setEdgeProbability(BodyBlock, EdgeProbabilities);
420 BPI->getEdgeProbability(Src, DirectSucc);
|
| CodeExtractor.cpp | 249 BranchProbabilityInfo *BPI, AssumptionCache *AC,
253 BPI(BPI), AC(AC), AllowVarArgs(AllowVarArgs),
259 BranchProbabilityInfo *BPI, AssumptionCache *AC,
262 BPI(BPI), AC(AC), AllowVarArgs(false),
1401 BranchProbabilityInfo *BPI) {
1427 BPI->setEdgeProbability(CodeReplacer, EdgeProbabilities);
1443 BPI->setEdgeProbability(CodeReplacer, EdgeProbabilities);
1581 assert(BPI && "Both BPI and BFI are required to preserve profile info")
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| LoopPredication.cpp | 257 BranchProbabilityInfo *BPI;
305 // within the loop. We identify such unprofitable loops through BPI.
313 BranchProbabilityInfo *BPI)
314 : AA(AA), DT(DT), SE(SE), LI(LI), BPI(BPI) {};
336 BranchProbabilityInfo &BPI =
339 LoopPredication LP(AA, DT, SE, LI, &BPI);
364 // but BPI is not preserved, hence a newly built one is needed.
365 BranchProbabilityInfo BPI(*F, AR.LI, &AR.TLI, &AR.DT, nullptr);
366 LoopPredication LP(&AR.AA, &AR.DT, &AR.SE, &AR.LI, &BPI);
[all...] |
| JumpThreading.cpp | 327 std::unique_ptr<BranchProbabilityInfo> BPI;
330 BPI.reset(new BranchProbabilityInfo(F, LI, TLI));
331 BFI.reset(new BlockFrequencyInfo(F, *BPI, LI));
335 std::move(BFI), std::move(BPI));
356 std::unique_ptr<BranchProbabilityInfo> BPI;
359 BPI.reset(new BranchProbabilityInfo(F, LI, &TLI));
360 BFI.reset(new BlockFrequencyInfo(F, *BPI, LI));
364 std::move(BFI), std::move(BPI));
390 BPI.reset();
392 // successful jump threading, which requires both BPI and BFI being available
[all...] |
| InductiveRangeCheckElimination.cpp | 227 BranchProbabilityInfo *BPI,
235 BranchProbabilityInfo *BPI;
249 BranchProbabilityInfo *BPI, DominatorTree &DT,
251 : SE(SE), BPI(BPI), DT(DT), LI(LI), GetBFI(GetBFI) {}
410 BranchInst *BI, Loop *L, ScalarEvolution &SE, BranchProbabilityInfo *BPI,
417 if (!SkipProfitabilityChecks && BPI &&
418 BPI->getEdgeProbability(BI->getParent(), (unsigned)0) < LikelyTaken)
1768 auto &BPI = AM.getResult<BranchProbabilityAnalysis>(F);
1776 InductiveRangeCheckElimination IRCE(SE, &BPI, DT, LI, { getBFI })
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| PartialInlining.cpp | 403 BranchProbabilityInfo BPI(F, LI);
407 ScopedBFI.reset(new BlockFrequencyInfo(F, BPI, LI));
493 BranchProbability SuccProb = BPI.getEdgeProbability(ThisBB, *SI);
967 BranchProbabilityInfo BPI(*Caller, LI);
968 TempBFI.reset(new BlockFrequencyInfo(*Caller, BPI, LI));
1153 BranchProbabilityInfo BPI(*ClonedFunc, LI);
1154 ClonedFuncBFI.reset(new BlockFrequencyInfo(*ClonedFunc, BPI, LI));
1166 ClonedFuncBFI.get(), &BPI,
1225 BranchProbabilityInfo BPI(*ClonedFunc, LI);
1226 ClonedFuncBFI.reset(new BlockFrequencyInfo(*ClonedFunc, BPI, LI))
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Basic/Targets/ |
| AArch64.cpp | 121 BranchProtectionInfo &BPI,
127 BPI.SignReturnAddr =
134 BPI.SignKey = LangOptions::SignReturnAddressKeyKind::AKey;
136 BPI.SignKey = LangOptions::SignReturnAddressKeyKind::BKey;
138 BPI.BranchTargetEnforcement = PBP.BranchTargetEnforcement;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| FunctionLoweringInfo.h | 59 BranchProbabilityInfo *BPI;
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/ |
| IRTranslator.cpp | 650 if (!FuncInfo.BPI) {
664 if (!FuncInfo.BPI) {
665 // If BPI is not available, set the default probability as 1 / N, where N is
670 return FuncInfo.BPI->getEdgeProbability(SrcBB, DstBB);
677 BranchProbabilityInfo *BPI = FuncInfo.BPI;
685 BPI ? BPI->getEdgeProbability(SI.getParent(), I.getSuccessorIndex())
2398 BranchProbabilityInfo *BPI = FuncInfo.BPI;
[all...] |
