Home
last modified time | relevance | path

Searched refs:Successors (Results 1 – 25 of 80) sorted by relevance

1234

/llvm-project-15.0.7/llvm/test/CodeGen/ARM/
H A Dcortex-a57-misched-vfma.ll13 ; CHECK: Successors:
22 ; CHECK: Successors:
30 ; CHECK: Successors:
52 ; CHECK: Successors:
61 ; CHECK: Successors:
69 ; CHECK: Successors:
90 ; CHECK: Successors:
99 ; CHECK: Successors:
107 ; CHECK: Successors:
129 ; CHECK: Successors:
[all …]
H A D2012-06-12-SchedMemLatency.ll16 ; CHECK: Successors:
26 ; CHECK: Successors:
/llvm-project-15.0.7/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileInference.h93 SampleProfileInference(FunctionT &F, BlockEdgeMap &Successors,
95 : F(F), Successors(Successors), SampleBlockWeights(SampleBlockWeights) {}
105 BlockEdgeMap &Successors, FlowFunction &Func);
114 BlockEdgeMap &Successors;
185 for (auto *Succ : Successors[BB]) {
203 findUnlikelyJumps(BasicBlocks, Successors, Func);
245 BlockEdgeMap &Successors, FlowFunction &Func) {}
250 BlockEdgeMap &Successors, FlowFunction &Func) {
257 if (Successors[BB].size() == 2 && Successors[BB].back() == Succ) {
H A DSampleProfileLoaderBaseImpl.h149 void applyProfi(FunctionT &F, BlockEdgeMap &Successors,
202 BlockEdgeMap Successors;
240 Successors.clear();
597 NumTotalEdges = Successors[BB].size();
598 for (auto *Succ : Successors[BB]) {
603 SingleEdge = std::make_pair(BB, Successors[BB][0]);
681 for (auto *Succ : Successors[BB]) {
729 if (!Successors[B1].empty())
733 Successors[B1].push_back(B2);
767 applyProfi(F, Successors, SampleBlockWeights, BlockWeights, EdgeWeights);
[all …]
/llvm-project-15.0.7/bolt/test/X86/
H A Djump-table-icp.test34 CHECK: Successors: .Ltmp{{.*}} (mispreds: 189, count: 189), .LFT{{.*}} (mispreds: 0, count: 881)
39 CHECK: Successors: .Ltmp{{.*}} (mispreds: 138, count: 155), .Ltmp{{.*}} (mispreds: 0, count: 726)
44 CHECK: Successors: .L{{.*}} (mispreds: 126, count: 157), .L{{.*}} (mispreds: 140, count: 156), .L…
70 CHECK: Successors: .Ltmp{{.*}} (mispreds: 143, count: 144), .LFT{{.*}} (mispreds: 0, count: 777)
75 CHECK: Successors: .Ltmp{{.*}} (mispreds: 120, count: 138), .Ltmp{{.*}} (mispreds: 0, count: 639)
80 CHECK: Successors: .L{{.*}} (mispreds: 130, count: 137), .L{{.*}} (mispreds: 126, count: 136), .L…
85 CHECK: Successors: .Ltmp{{.*}} (mispreds: 0, count: 106)
90 CHECK: Successors: .Ltmp{{.*}} (mispreds: 0, count: 113)
95 CHECK: Successors: .Ltmp{{.*}} (mispreds: 0, count: 97)
100 CHECK: Successors: .Ltmp{{.*}} (mispreds: 0, count: 105)
[all …]
H A Dblock-reordering.test17 CHECK: Successors: .Ltmp{{.*}} (mispreds: 0, count: 0)
23 CHECK: Successors: .LFT{{.*}} (mispreds: 0, count: 0), .Ltmp{{.*}} (mispreds: 33, count: 4711)
36 CHECK: Successors: .Ltmp{{.*}} (mispreds: 171, count: 2886), .LFT{{.*}} (mispreds: 0, count: 0)
43 CHECK: Successors: .Ltmp{{.*}} (mispreds: 0, count: 0)
H A Djmpjmp.test16 CHECK: Successors: .Ltmp{{.*}}
19 CHECK: Successors: .Ltmp{{.*}}
23 CHECK: Successors: .Ltmp{{.*}}
H A Dbranch-data.test24 CHECK: Successors: .Ltmp{{.*}} (mispreds: 0, count: 0)
37 CHECK: Successors: .Ltmp{{.*}} (mispreds: 171, count: 2886), .LFT{{.*}} (mispreds: 0, count: 0)
43 CHECK: Successors: .Ltmp{{.*}} (mispreds: 0, count: 0)
49 CHECK: Successors: .Ltmp{{.*}} (mispreds: 33, count: 4711), .LFT{{.*}} (mispreds: 0, count: 0)
H A Dfallthrough-to-noop.test23 CHECK: Successors: .Ltmp[[#BB1:]] (mispreds: 0, count: 18), .LFT[[#BB2:]] (mispreds: 0, coun…
27 CHECK: Successors: .Ltmp[[#]] (mispreds: 0, count: 0)
/llvm-project-15.0.7/llvm/test/CodeGen/AArch64/
H A Dmisched-fusion-arith-logic.mir15 ; CHECK: Successors:
18 ; CHECK: Successors:
37 ; CHECK: Successors:
40 ; CHECK: Successors:
59 ; CHECK: Successors:
62 ; CHECK: Successors:
79 ; CHECK: Successors:
89 ; CHECK: Successors:
101 ; CHECK: Successors:
104 ; CHECK: Successors:
H A Dmisched-fusion-crypto-eor.mir10 ; CHECK: Successors:
18 ; CHECK: Successors:
26 ; CHECK: Successors:
35 ; CHECK: Successors:
43 ; CHECK: Successors:
51 ; CHECK: Successors:
60 ; CHECK: Successors:
69 ; CHECK: Successors:
H A Dscheduledag-constreg.mir12 # CHECK-NOT: Successors:
15 # CHECK-NOT: Successors:
18 # CHECK-NOT: Successors:
21 # CHECK-NOT: Successors:
H A Darm64-misched-memdep-bug.ll9 ; CHECK: Successors:
13 ; CHECK: Successors:
H A Dmisched-predicate-virtreg.mir12 # CHECK-NEXT: Successors:
24 # CHECK-NEXT: Successors:
/llvm-project-15.0.7/bolt/lib/Core/
H A DBinaryBasicBlock.cpp88 for (BinaryBasicBlock *Succ : Successors) { in validateSuccessorInvariants()
123 switch (Successors.size()) { in validateSuccessorInvariants()
263 Successors.push_back(Succ); in addSuccessor()
292 Successors.clear(); in removeAllSuccessors()
308 Successors.erase(I); in removeSuccessor()
335 assert(succ_size() == 2 && Successors[0] == Successors[1] && in removeDuplicateConditionalSuccessor()
338 BinaryBasicBlock *Succ = Successors[0]; in removeDuplicateConditionalSuccessor()
344 Successors.clear(); in removeDuplicateConditionalSuccessor()
347 Successors.push_back(Succ); in removeDuplicateConditionalSuccessor()
485 std::swap(Successors[0], Successors[1]); in swapConditionalSuccessors()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DInterval.h59 std::vector<BasicBlock*> Successors; variable
77 for (BasicBlock *Successor : Successors) in isSuccessor()
100 return I->Successors.begin(); in succ_begin()
103 return I->Successors.end(); in succ_end()
H A DIntervalIterator.h210 Int->Successors.push_back(NodeHeader); in ProcessNode()
217 Int->Successors.push_back(NodeHeader); in ProcessNode()
229 llvm::erase_value(Int->Successors, NodeHeader); in ProcessNode()
/llvm-project-15.0.7/bolt/include/bolt/Core/
H A DBinaryBasicBlock.h72 EdgeListType Successors; variable
243 succ_iterator succ_begin() { return Successors.begin(); } in succ_begin()
244 const_succ_iterator succ_begin() const { return Successors.begin(); } in succ_begin()
245 succ_iterator succ_end() { return Successors.end(); } in succ_end()
246 const_succ_iterator succ_end() const { return Successors.end(); } in succ_end()
248 { return Successors.rbegin(); } in succ_rbegin()
250 { return Successors.rbegin(); } in succ_rbegin()
256 return Successors.size(); in succ_size()
389 return Successors[Condition == true ? 0 : 1]; in getConditionalSuccessor()
643 return llvm::is_contained(Successors, BB); in isSuccessor()
[all …]
/llvm-project-15.0.7/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp74 std::map<change_ty, std::vector<change_ty> > Successors; member in __anona2548bc90111::DAGDeltaAlgorithmImpl
99 assert(Successors.count(Node) && "Invalid node!"); in succ_begin()
100 return Successors[Node].begin(); in succ_begin()
103 assert(Successors.count(Node) && "Invalid node!"); in succ_end()
104 return Successors[Node].end(); in succ_end()
184 Successors.insert(std::make_pair(Change, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
188 Successors[Dep.first].push_back(Dep.second); in DAGDeltaAlgorithmImpl()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DFunctionPropertiesAnalysis.cpp147 Successors.insert(succ_begin(&CallSiteBB), succ_end(&CallSiteBB)); in FunctionPropertiesUpdater()
158 Successors.insert(succ_begin(UnwindDest), succ_end(UnwindDest)); in FunctionPropertiesUpdater()
166 Successors.erase(&CallSiteBB); in FunctionPropertiesUpdater()
168 for (const auto *BB : Successors) in FunctionPropertiesUpdater()
213 for (const auto *Succ : Successors) in finish()
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h119 std::vector<MachineBasicBlock *> Successors;
342 succ_iterator succ_begin() { return Successors.begin(); }
343 const_succ_iterator succ_begin() const { return Successors.begin(); }
344 succ_iterator succ_end() { return Successors.end(); }
345 const_succ_iterator succ_end() const { return Successors.end(); }
347 { return Successors.rbegin(); }
349 { return Successors.rbegin(); }
351 { return Successors.rend(); }
353 { return Successors.rend(); }
355 return (unsigned)Successors.size();
[all …]
/llvm-project-15.0.7/bolt/test/runtime/X86/
H A Dthree-way-branch-pass.s16 # CHECK: Successors: .Ltmp1 (mispreds: 0, count: 40), .Ltmp0 (mispreds: 0, count: 52)
17 # CHECK: Successors: .LFT0 (mispreds: 0, count: 22), .LFT1 (mispreds: 0, count: 30)
/llvm-project-15.0.7/llvm/include/llvm/Passes/
H A DStandardInstrumentations.h417 return Successors.begin(); in begin()
420 return Successors.end(); in end()
425 assert(Successors.count(S) == 1 && "Expected to find successor."); in getSuccessorLabel()
426 return Successors.find(S)->getValue(); in getSuccessorLabel()
433 Successors.insert(SS); in addSuccessorLabel()
436 StringMap<std::string> Successors; variable
/llvm-project-15.0.7/bolt/lib/Passes/
H A DInliner.cpp355 std::vector<BinaryBasicBlock *> Successors(BB.succ_size()); in inlineCall() local
356 llvm::transform(BB.successors(), Successors.begin(), in inlineCall()
362 InlinedBB->addSuccessors(Successors.begin(), Successors.end(), in inlineCall()
365 InlinedBB->addSuccessors(Successors.begin(), Successors.end()); in inlineCall()
/llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/
H A DVPlanVerifier.cpp62 const auto &Successors = VPB->getSuccessors(); in verifyBlocksInRegion() local
65 assert(!hasDuplicates(Successors) && in verifyBlocksInRegion()
68 for (const VPBlockBase *Succ : Successors) { in verifyBlocksInRegion()

1234