| /freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | MustExecute.cpp | 162 SmallPtrSetImpl<const BasicBlock *> &Predecessors) { in collectTransitivePredecessors() argument
169 Predecessors.insert(Pred); in collectTransitivePredecessors()
185 if (Predecessors.insert(PredPred).second) in collectTransitivePredecessors()
201 SmallPtrSet<const BasicBlock *, 4> Predecessors; in allLoopPathsLeadToBlock() local
202 collectTransitivePredecessors(CurLoop, BB, Predecessors); in allLoopPathsLeadToBlock()
210 if (Predecessors.contains(Pred)) in allLoopPathsLeadToBlock()
220 for (const auto *Pred : Predecessors) { in allLoopPathsLeadToBlock()
232 Succ != BB && !Predecessors.count(Succ)) in allLoopPathsLeadToBlock()
294 SmallPtrSet<const BasicBlock *, 4> Predecessors; in doesNotWriteMemoryBefore() local
295 collectTransitivePredecessors(CurLoop, BB, Predecessors); in doesNotWriteMemoryBefore()
[all …]
|
| H A D | Interval.cpp | 33 for (const BasicBlock *Predecessor : Predecessors) in print()
|
| H A D | IntervalPartition.cpp | 70 getBlockInterval(Successor)->Predecessors.push_back(Header); in updatePredecessors()
|
| /freebsd-14.2/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | ThreadSafetyTIL.cpp | 59 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()
|
| H A D | IntervalPartition.cpp | 188 && N->Predecessors.insert(Pred).second) in partitionIntoIntervalsImpl()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Support/ |
| H A D | DAGDeltaAlgorithm.cpp | 73 std::map<change_ty, std::vector<change_ty> > Predecessors; member in __anon6b5ff60f0111::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()
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | Interval.h | 63 std::vector<BasicBlock*> Predecessors; variable
110 return I->Predecessors.begin(); in pred_begin()
113 return I->Predecessors.end(); in pred_end()
|
| /freebsd-14.2/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
| H A D | IntervalPartition.h | 83 return Predecessors; in preds()
98 llvm::SmallDenseSet<const CFGIntervalNode *> Predecessors; member
|
| H A D | ThreadSafetyTIL.h | 1552 size_t numPredecessors() const { return Predecessors.size(); } in numPredecessors()
1570 BlockArray &predecessors() { return Predecessors; } in predecessors()
1571 const BlockArray &predecessors() const { return Predecessors; } in predecessors()
1616 auto I = llvm::find(Predecessors, BB); in findPredecessorIndex()
1617 return std::distance(Predecessors.cbegin(), I); in findPredecessorIndex()
1674 BlockArray Predecessors; variable
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | MachineBasicBlock.h | 138 std::vector<MachineBasicBlock *> Predecessors;
377 pred_iterator pred_begin() { return Predecessors.begin(); }
378 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
379 pred_iterator pred_end() { return Predecessors.end(); }
380 const_pred_iterator pred_end() const { return Predecessors.end(); }
382 { return Predecessors.rbegin();}
384 { return Predecessors.rbegin();}
386 { return Predecessors.rend(); }
388 { return Predecessors.rend(); }
390 return (unsigned)Predecessors.size();
[all …]
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | FixIrreducible.cpp | 175 SetVector<BasicBlock *> Predecessors; in createNaturalLoopInternal() local
178 Predecessors.insert(P); in createNaturalLoopInternal()
184 for (auto P : Predecessors) { in createNaturalLoopInternal()
194 CreateControlFlowHub(&DTU, GuardBlocks, Predecessors, Headers, "irr"); in createNaturalLoopInternal()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanVerifier.cpp | 76 const auto &Predecessors = VPB->getPredecessors(); in verifyBlocksInRegion() local
80 assert(!hasDuplicates(Predecessors) && in verifyBlocksInRegion()
83 for (const VPBlockBase *Pred : Predecessors) { in verifyBlocksInRegion()
|
| H A D | VPlan.h | 435 SmallVector<VPBlockBase *, 1> Predecessors; variable
453 Predecessors.push_back(Predecessor); in appendPredecessor()
458 auto Pos = find(Predecessors, Predecessor); in removePredecessor()
460 Predecessors.erase(Pos); in removePredecessor()
524 const VPBlocksTy &getPredecessors() const { return Predecessors; } in getPredecessors()
525 VPBlocksTy &getPredecessors() { return Predecessors; } in getPredecessors()
536 return (Predecessors.size() == 1 ? *Predecessors.begin() : nullptr); in getSinglePredecessor()
540 size_t getNumPredecessors() const { return Predecessors.size(); } in getNumPredecessors()
609 assert(Predecessors.empty() && "Block predecessors already set."); in setPredecessors()
615 void clearPredecessors() { Predecessors.clear(); } in clearPredecessors()
|
| H A D | VPlan.cpp | 139 auto &Predecessors = Current->getPredecessors(); in getPlanEntry() local
140 WorkList.insert(Predecessors.begin(), Predecessors.end()); in getPlanEntry()
196 if (!Predecessors.empty() || !Parent) in getEnclosingBlockWithPredecessors()
|
| /freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | SampleProfileLoaderBaseImpl.h | 269 BlockEdgeMap Predecessors;
320 Predecessors.clear();
727 NumTotalEdges = Predecessors[BB].size();
728 for (auto *Pred : Predecessors[BB]) {
735 SingleEdge = std::make_pair(Predecessors[BB][0], BB);
817 for (auto *Pred : Predecessors[BB]) {
863 if (!Predecessors[B1].empty())
867 Predecessors[B1].push_back(B2);
|
| H A D | BasicBlockUtils.h | 676 const SetVector<BasicBlock *> &Predecessors,
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SILowerI1Copies.cpp | 136 SmallVector<MachineBasicBlock *, 4> Predecessors; member in __anonc1db210b0111::PhiIncomingAnalysis
148 ArrayRef<MachineBasicBlock *> predecessors() const { return Predecessors; } in predecessors()
154 Predecessors.clear(); in analyze()
199 if (!llvm::is_contained(Predecessors, UnreachablePred)) in analyze()
200 Predecessors.push_back(UnreachablePred); in analyze()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | MachineBasicBlock.cpp | 900 Predecessors.push_back(Pred); in addPredecessor()
904 pred_iterator I = find(Predecessors, Pred); in removePredecessor()
905 assert(I != Predecessors.end() && "Pred is not a predecessor of this block!"); in removePredecessor()
906 Predecessors.erase(I); in removePredecessor()
966 return Predecessors.size() == 1 ? Predecessors[0] : nullptr; in getSinglePredecessor()
|
| /freebsd-14.2/contrib/llvm-project/llvm/lib/IR/ |
| H A D | BasicBlock.cpp | 661 SmallVector<BasicBlock *, 4> Predecessors; in splitBasicBlockBefore() local
663 Predecessors.push_back(Pred); in splitBasicBlockBefore()
664 for (BasicBlock *Pred : Predecessors) { in splitBasicBlockBefore()
|