Home
last modified time | relevance | path

Searched refs:Predecessors (Results 1 – 25 of 46) sorted by relevance

12

/llvm-project-15.0.7/bolt/test/X86/
H A Djump-table-icp.test38 CHECK: Predecessors: .LBB{{.*}}
43 CHECK: Predecessors: .LFT{{.*}}
52 CHECK: Predecessors: .Ltmp{{.*}}
56 CHECK: Predecessors: .Ltmp{{.*}}
60 CHECK: Predecessors: .Ltmp{{.*}}
64 CHECK: Predecessors: .Ltmp{{.*}}
74 CHECK: Predecessors: .LBB{{.*}}
79 CHECK: Predecessors: .LFT{{.*}}
84 CHECK: Predecessors: .Ltmp{{.*}}
89 CHECK: Predecessors: .Ltmp{{.*}}
[all …]
H A Dblock-reordering.test20 CHECK: Predecessors: .Ltmp{{.*}}, .LFT{{.*}}
26 CHECK: Predecessors: .Ltmp{{.*}}, .LBB{{.*}}
39 CHECK: Predecessors: .Ltmp{{.*}}
46 CHECK: Predecessors: .Ltmp{{.*}}
H A Dsctc-bug4.test9 CHECK-NEXT: Predecessors: .LFT1
18 CHECK-NEXT: Predecessors: .LFT0
25 CHECK-NEXT: Predecessors: .Ltmp2
H A Dbranch-data.test27 CHECK: Predecessors: .Ltmp{{.*}}, .LBB{{.*}}
40 CHECK: Predecessors: .Ltmp{{.*}}
46 CHECK: Predecessors: .Ltmp{{.*}}, .LFT{{.*}}
52 CHECK: Predecessors: .Ltmp{{.*}}
H A Djmpjmp.test21 CHECK: Predecessors: .LBB{{.*}}
25 CHECK: Predecessors: .LFT{{.*}}, .Ltmp{{.*}}
H A Dsctc-bug3.test12 CHECK: Predecessors: .LBB00
/llvm-project-15.0.7/llvm/test/CodeGen/AArch64/
H A Dmisched-fusion-arith-logic.mir21 ; CHECK: Predecessors:
24 ; CHECK: Predecessors:
43 ; CHECK: Predecessors:
46 ; CHECK: Predecessors:
65 ; CHECK: Predecessors:
68 ; CHECK: Predecessors:
107 ; CHECK: Predecessors:
110 ; CHECK: Predecessors:
/llvm-project-15.0.7/lld/test/ELF/
H A Dverdef-dependency.s18 # DSO-NEXT: Predecessors: []
27 # DSO-NEXT: Predecessors: []
36 # DSO-NEXT: Predecessors: []
45 # DSO-NEXT: Predecessors: []
H A Dverdef.s36 # DSO-NEXT: Predecessors: []
45 # DSO-NEXT: Predecessors: []
54 # DSO-NEXT: Predecessors: []
63 # DSO-NEXT: Predecessors: []
H A Dverdef-defaultver.s87 # DSO-NEXT: Predecessors: []
96 # DSO-NEXT: Predecessors: []
105 # DSO-NEXT: Predecessors: []
/llvm-project-15.0.7/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp59 unsigned Idx = Predecessors.size(); in addPredecessor()
60 Predecessors.reserveCheck(1, Arena); in addPredecessor()
61 Predecessors.push_back(Pred); in addPredecessor()
72 Predecessors.reserve(NumPreds, Arena); in reservePredecessors()
197 for (auto *Pred : Predecessors) in topologicalFinalSort()
211 for (auto *Pred : Predecessors) { in computeDominator()
/llvm-project-15.0.7/llvm/lib/Support/
H A DDAGDeltaAlgorithm.cpp73 std::map<change_ty, std::vector<change_ty> > Predecessors; member in __anona2548bc90111::DAGDeltaAlgorithmImpl
81 assert(Predecessors.count(Node) && "Invalid node!"); in pred_begin()
82 return Predecessors[Node].begin(); in pred_begin()
85 assert(Predecessors.count(Node) && "Invalid node!"); in pred_end()
86 return Predecessors[Node].end(); in pred_end()
183 Predecessors.insert(std::make_pair(Change, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
187 Predecessors[Dep.second].push_back(Dep.first); in DAGDeltaAlgorithmImpl()
/llvm-project-15.0.7/bolt/include/bolt/Core/
H A DBinaryBasicBlock.h71 EdgeListType Predecessors; variable
226 pred_iterator pred_begin() { return Predecessors.begin(); } in pred_begin()
227 const_pred_iterator pred_begin() const { return Predecessors.begin(); } in pred_begin()
228 pred_iterator pred_end() { return Predecessors.end(); } in pred_end()
229 const_pred_iterator pred_end() const { return Predecessors.end(); } in pred_end()
231 { return Predecessors.rbegin();} in pred_rbegin()
233 { return Predecessors.rbegin();} in pred_rbegin()
235 { return Predecessors.rend(); } in pred_rend()
239 return Predecessors.size(); in pred_size()
638 return llvm::is_contained(Predecessors, BB); in isPredecessor()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DInterval.h63 std::vector<BasicBlock*> Predecessors; variable
110 return I->Predecessors.begin(); in pred_begin()
113 return I->Predecessors.end(); in pred_end()
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DMustExecute.cpp161 SmallPtrSetImpl<const BasicBlock *> &Predecessors) { in collectTransitivePredecessors() argument
162 assert(Predecessors.empty() && "Garbage in predecessors set?"); in collectTransitivePredecessors()
168 Predecessors.insert(Pred); in collectTransitivePredecessors()
184 if (Predecessors.insert(PredPred).second) in collectTransitivePredecessors()
200 SmallPtrSet<const BasicBlock *, 4> Predecessors; in allLoopPathsLeadToBlock() local
201 collectTransitivePredecessors(CurLoop, BB, Predecessors); in allLoopPathsLeadToBlock()
210 for (const auto *Pred : Predecessors) { in allLoopPathsLeadToBlock()
222 Succ != BB && !Predecessors.count(Succ)) in allLoopPathsLeadToBlock()
284 SmallPtrSet<const BasicBlock *, 4> Predecessors; in doesNotWriteMemoryBefore() local
285 collectTransitivePredecessors(CurLoop, BB, Predecessors); in doesNotWriteMemoryBefore()
[all …]
H A DInterval.cpp33 for (const BasicBlock *Predecessor : Predecessors) in print()
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h118 std::vector<MachineBasicBlock *> Predecessors;
326 pred_iterator pred_begin() { return Predecessors.begin(); }
327 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
328 pred_iterator pred_end() { return Predecessors.end(); }
329 const_pred_iterator pred_end() const { return Predecessors.end(); }
331 { return Predecessors.rbegin();}
333 { return Predecessors.rbegin();}
335 { return Predecessors.rend(); }
337 { return Predecessors.rend(); }
339 return (unsigned)Predecessors.size();
[all …]
/llvm-project-15.0.7/llvm/test/tools/llvm-readobj/ELF/
H A Dversioninfo.test131 # LLVM-NEXT: Predecessors: []
141 # LLVM-NEXT: Predecessors: []
151 # LLVM-NEXT: Predecessors: []
161 # LLVM-NEXT: Predecessors: []
173 # LLVM-NEXT: Predecessors: []
182 # LLVM-NEXT: Predecessors: [VERSION1, VERSION3]
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DFixIrreducible.cpp178 SetVector<BasicBlock *> Predecessors; in createNaturalLoopInternal() local
181 Predecessors.insert(P); in createNaturalLoopInternal()
187 for (auto P : Predecessors) { in createNaturalLoopInternal()
197 CreateControlFlowHub(&DTU, GuardBlocks, Predecessors, Headers, "irr"); in createNaturalLoopInternal()
/llvm-project-15.0.7/bolt/lib/Passes/
H A DCacheMetrics.cpp110 using Predecessors = std::vector<std::pair<BinaryFunction *, uint64_t>>; typedef
114 std::unordered_map<const BinaryFunction *, Predecessors>
116 std::unordered_map<const BinaryFunction *, Predecessors> Calls; in extractFunctionCalls()
166 std::unordered_map<const BinaryFunction *, Predecessors> Calls = in expectedCacheHitRatio()
/llvm-project-15.0.7/llvm/lib/Transforms/Vectorize/
H A DVPlanVerifier.cpp76 const auto &Predecessors = VPB->getPredecessors(); in verifyBlocksInRegion() local
80 assert(!hasDuplicates(Predecessors) && in verifyBlocksInRegion()
83 for (const VPBlockBase *Pred : Predecessors) { in verifyBlocksInRegion()
/llvm-project-15.0.7/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileLoaderBaseImpl.h199 BlockEdgeMap Predecessors;
239 Predecessors.clear();
585 NumTotalEdges = Predecessors[BB].size();
586 for (auto *Pred : Predecessors[BB]) {
593 SingleEdge = std::make_pair(Predecessors[BB][0], BB);
675 for (auto *Pred : Predecessors[BB]) {
721 if (!Predecessors[B1].empty())
725 Predecessors[B1].push_back(B2);
/llvm-project-15.0.7/bolt/lib/Core/
H A DBinaryBasicBlock.cpp265 Succ->Predecessors.push_back(this); in addSuccessor()
313 Predecessors.push_back(Pred); in addPredecessor()
320 for (auto PredI = Predecessors.begin(); PredI != Predecessors.end();) { in removePredecessor()
323 PredI = Predecessors.erase(PredI); in removePredecessor()
/llvm-project-15.0.7/llvm/test/CodeGen/X86/
H A D2010-05-12-FastAllocKills.ll8 ; Predecessors according to CFG: %bb.4 %bb.5
18 ; Predecessors according to CFG: %bb.4 %bb.5
/llvm-project-15.0.7/llvm/test/tools/yaml2obj/ELF/
H A Dverdef-section.yaml25 # CHECK-NEXT: Predecessors: []
35 # CHECK-NEXT: Predecessors: []
45 # CHECK-NEXT: Predecessors: []
57 # CHECK-NEXT: Predecessors: [VERSION_3, VERSION_4]

12