| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | MustExecute.cpp | 162 SmallPtrSetImpl<const BasicBlock *> &Predecessors) { in collectTransitivePredecessors() argument
163 assert(Predecessors.empty() && "Garbage in predecessors set?"); in collectTransitivePredecessors()
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
[all …]
|
| /freebsd/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()
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | DAGDeltaAlgorithm.cpp | 73 std::map<change_ty, std::vector<change_ty> > Predecessors; member in __anoncf29fe990111::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/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | MachineBasicBlock.h | 160 std::vector<MachineBasicBlock *> Predecessors;
402 pred_iterator pred_begin() { return Predecessors.begin(); }
403 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
404 pred_iterator pred_end() { return Predecessors.end(); }
405 const_pred_iterator pred_end() const { return Predecessors.end(); }
407 { return Predecessors.rbegin();}
409 { return Predecessors.rbegin();}
411 { return Predecessors.rend(); }
413 { return Predecessors.rend(); }
415 return (unsigned)Predecessors.size();
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | FixIrreducible.cpp | 175 SetVector<BasicBlock *> Predecessors; in createNaturalLoopInternal()
178 Predecessors.insert(P); in createNaturalLoopInternal() local
184 for (auto P : Predecessors) { in createNaturalLoopInternal()
194 CreateControlFlowHub(&DTU, GuardBlocks, Predecessors, Headers, "irr"); in createNaturalLoopInternal()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanVerifier.cpp | 224 const auto &Predecessors = VPB->getPredecessors(); in verifyBlock() local
228 if (hasDuplicates(Predecessors)) { in verifyBlock()
233 for (const VPBlockBase *Pred : Predecessors) { in verifyBlock()
|
| H A D | VPlan.h | 450 SmallVector<VPBlockBase *, 1> Predecessors; variable
468 Predecessors.push_back(Predecessor); in appendPredecessor()
473 auto Pos = find(Predecessors, Predecessor); in removePredecessor()
475 Predecessors.erase(Pos); in removePredecessor()
539 const VPBlocksTy &getPredecessors() const { return Predecessors; } in getPredecessors()
540 VPBlocksTy &getPredecessors() { return Predecessors; } in getPredecessors()
551 return (Predecessors.size() == 1 ? *Predecessors.begin() : nullptr); in getSinglePredecessor()
555 size_t getNumPredecessors() const { return Predecessors.size(); } in getNumPredecessors()
624 assert(Predecessors.empty() && "Block predecessors already set."); in setPredecessors()
639 void clearPredecessors() { Predecessors.clear(); } in clearPredecessors()
|
| H A D | VPlan.cpp | 143 auto &Predecessors = Current->getPredecessors(); in getPlanEntry() local
144 WorkList.insert(Predecessors.begin(), Predecessors.end()); in getPlanEntry()
200 if (!Predecessors.empty() || !Parent) in getEnclosingBlockWithPredecessors()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | SampleProfileLoaderBaseImpl.h | 297 BlockEdgeMap Predecessors;
348 Predecessors.clear();
755 NumTotalEdges = Predecessors[BB].size();
756 for (auto *Pred : Predecessors[BB]) {
763 SingleEdge = std::make_pair(Predecessors[BB][0], BB);
845 for (auto *Pred : Predecessors[BB]) {
891 if (!Predecessors[B1].empty())
895 Predecessors[B1].push_back(B2);
|
| H A D | BasicBlockUtils.h | 676 const SetVector<BasicBlock *> &Predecessors,
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SILowerI1Copies.cpp | 136 SmallVector<MachineBasicBlock *, 4> Predecessors; member in __anon952a5e950111::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/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | MachineBasicBlock.cpp | 906 Predecessors.push_back(Pred); in addPredecessor()
910 pred_iterator I = find(Predecessors, Pred); in removePredecessor()
911 assert(I != Predecessors.end() && "Pred is not a predecessor of this block!"); in removePredecessor()
912 Predecessors.erase(I); in removePredecessor()
972 return Predecessors.size() == 1 ? Predecessors[0] : nullptr; in getSinglePredecessor()
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | BasicBlock.cpp | 629 SmallVector<BasicBlock *, 4> Predecessors; in splitBasicBlockBefore() local
631 Predecessors.push_back(Pred); in splitBasicBlockBefore()
632 for (BasicBlock *Pred : Predecessors) { in splitBasicBlockBefore()
|
| /freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
| 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
|