| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | MustExecute.cpp | 168 SmallPtrSetImpl<const BasicBlock *> &Predecessors) { in collectTransitivePredecessors() argument
169 assert(Predecessors.empty() && "Garbage in predecessors set?"); in collectTransitivePredecessors()
177 Predecessors.insert(Pred); in collectTransitivePredecessors()
193 if (CurLoop->contains(PredPred) && Predecessors.insert(PredPred).second) in collectTransitivePredecessors()
209 SmallPtrSet<const BasicBlock *, 4> Predecessors; in allLoopPathsLeadToBlock() local
210 collectTransitivePredecessors(CurLoop, BB, Predecessors); in allLoopPathsLeadToBlock()
218 if (Predecessors.contains(Pred)) in allLoopPathsLeadToBlock()
228 for (const auto *Pred : Predecessors) { in allLoopPathsLeadToBlock()
240 Succ != BB && !Predecessors.count(Succ)) in allLoopPathsLeadToBlock()
302 SmallPtrSet<const BasicBlock *, 4> Predecessors; in doesNotWriteMemoryBefore() local
[all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | ThreadSafetyTIL.cpp | 58 unsigned Idx = Predecessors.size(); in addPredecessor()
59 Predecessors.reserveCheck(1, Arena); in addPredecessor()
60 Predecessors.push_back(Pred); in addPredecessor()
71 Predecessors.reserve(NumPreds, Arena); in reservePredecessors()
196 for (auto *Pred : Predecessors) in topologicalFinalSort()
210 for (auto *Pred : Predecessors) { in computeDominator()
|
| H A D | IntervalPartition.cpp | 188 && N->Predecessors.insert(Pred).second) in partitionIntoIntervalsImpl()
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | DAGDeltaAlgorithm.cpp | 72 std::map<change_ty, std::vector<change_ty> > Predecessors; member in __anoncf29fe990111::DAGDeltaAlgorithmImpl
80 assert(Predecessors.count(Node) && "Invalid node!"); in pred_begin()
81 return Predecessors[Node].begin(); in pred_begin()
84 assert(Predecessors.count(Node) && "Invalid node!"); in pred_end()
85 return Predecessors[Node].end(); in pred_end()
182 Predecessors.try_emplace(Change); in DAGDeltaAlgorithmImpl()
186 Predecessors[Dep.second].push_back(Dep.first); in DAGDeltaAlgorithmImpl()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | FixIrreducible.cpp | 235 SetVector<BasicBlock *> Predecessors; in fixIrreducible() local
241 Predecessors.insert(P); in fixIrreducible()
244 for (BasicBlock *P : Predecessors) { in fixIrreducible()
260 Predecessors.clear(); in fixIrreducible()
264 Predecessors.insert(P); in fixIrreducible()
268 for (BasicBlock *P : Predecessors) { in fixIrreducible()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | MachineBasicBlock.h | 158 SmallVector<MachineBasicBlock *, 4> Predecessors;
427 pred_iterator pred_begin() { return Predecessors.begin(); }
428 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
429 pred_iterator pred_end() { return Predecessors.end(); }
430 const_pred_iterator pred_end() const { return Predecessors.end(); }
432 { return Predecessors.rbegin();}
434 { return Predecessors.rbegin();}
436 { return Predecessors.rend(); }
438 { return Predecessors.rend(); }
440 return (unsigned)Predecessors.size();
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanVerifier.cpp | 363 const auto &Predecessors = VPB->getPredecessors(); in verifyBlock() local
367 if (hasDuplicates(Predecessors)) { in verifyBlock()
372 for (const VPBlockBase *Pred : Predecessors) { in verifyBlock()
|
| H A D | VPlan.h | 94 SmallVector<VPBlockBase *, 1> Predecessors; variable
112 Predecessors.push_back(Predecessor); in appendPredecessor()
117 auto Pos = find(Predecessors, Predecessor); in removePredecessor()
119 Predecessors.erase(Pos); in removePredecessor()
132 auto I = find(Predecessors, Old); in replacePredecessor()
133 assert(I != Predecessors.end()); in replacePredecessor()
202 iterator_range<VPBlockBase **> predecessors() { return Predecessors; } in predecessors()
204 const VPBlocksTy &getPredecessors() const { return Predecessors; } in getPredecessors()
205 VPBlocksTy &getPredecessors() { return Predecessors; } in getPredecessors()
216 return (Predecessors.size() == 1 ? *Predecessors.begin() : nullptr); in getSinglePredecessor()
[all …]
|
| H A D | VPlan.cpp | 148 auto &Predecessors = Current->getPredecessors(); in getPlanEntry() local
149 WorkList.insert_range(Predecessors); in getPlanEntry()
203 if (!Predecessors.empty() || !Parent) in getEnclosingBlockWithPredecessors()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | SampleProfileLoaderBaseImpl.h | 298 BlockEdgeMap Predecessors;
349 Predecessors.clear();
748 auto &Preds = Predecessors[BB];
757 SingleEdge = std::make_pair(Predecessors[BB][0], BB);
840 for (auto *Pred : Predecessors[BB]) {
886 auto &Preds = Predecessors[B1];
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SILowerI1Copies.cpp | 114 SmallVector<MachineBasicBlock *, 4> Predecessors; member in __anon952a5e950111::PhiIncomingAnalysis
126 ArrayRef<MachineBasicBlock *> predecessors() const { return Predecessors; } in predecessors()
131 Predecessors.clear(); in analyze()
171 if (!llvm::is_contained(Predecessors, UnreachablePred)) in analyze()
172 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/clang/include/clang/Analysis/Analyses/ |
| H A D | ThreadSafetyTIL.h | 1549 size_t numPredecessors() const { return Predecessors.size(); } in numPredecessors()
1567 BlockArray &predecessors() { return Predecessors; } in predecessors()
1568 const BlockArray &predecessors() const { return Predecessors; } in predecessors()
1613 auto I = llvm::find(Predecessors, BB); in findPredecessorIndex()
1614 return std::distance(Predecessors.cbegin(), I); in findPredecessorIndex()
1672 BlockArray Predecessors; variable
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | BasicBlock.cpp | 615 SmallVector<BasicBlock *, 4> Predecessors(predecessors(this)); in splitBasicBlockBefore() local
616 for (BasicBlock *Pred : Predecessors) { in splitBasicBlockBefore()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/ |
| H A D | SPIRVStructurizer.cpp | 1019 std::vector<BasicBlock *> Predecessors(predecessors(&BB).begin(), in removeUselessBlocks() local
1021 for (BasicBlock *Predecessor : Predecessors) in removeUselessBlocks()
|