| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | MustExecute.cpp | 155 SmallPtrSetImpl<const BasicBlock *> &Predecessors) { in collectTransitivePredecessors() argument
156 assert(Predecessors.empty() && "Garbage in predecessors set?"); in collectTransitivePredecessors()
162 Predecessors.insert(Pred); in collectTransitivePredecessors()
178 if (Predecessors.insert(PredPred).second) in collectTransitivePredecessors()
194 SmallPtrSet<const BasicBlock *, 4> Predecessors; in allLoopPathsLeadToBlock() local
195 collectTransitivePredecessors(CurLoop, BB, Predecessors); in allLoopPathsLeadToBlock()
203 for (auto *Pred : Predecessors) { in allLoopPathsLeadToBlock()
209 Succ != BB && !Predecessors.count(Succ)) in allLoopPathsLeadToBlock()
271 SmallPtrSet<const BasicBlock *, 4> Predecessors; in doesNotWriteMemoryBefore() local
272 collectTransitivePredecessors(CurLoop, BB, Predecessors); in doesNotWriteMemoryBefore()
[all …]
|
| H A D | Interval.cpp | 46 for (const BasicBlock *Predecessor : Predecessors) in print()
|
| H A D | IntervalPartition.cpp | 66 getBlockInterval(Successor)->Predecessors.push_back(Header); in updatePredecessors()
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/Analysis/ |
| H A D | ThreadSafetyTIL.cpp | 60 unsigned Idx = Predecessors.size(); in addPredecessor()
61 Predecessors.reserveCheck(1, Arena); in addPredecessor()
62 Predecessors.push_back(Pred); in addPredecessor()
73 Predecessors.reserve(NumPreds, Arena); in reservePredecessors()
198 for (auto *Pred : Predecessors) in topologicalFinalSort()
212 for (auto *Pred : Predecessors) { in computeDominator()
|
| /freebsd-12.1/contrib/llvm/include/llvm/CodeGen/ |
| H A D | MachineBasicBlock.h | 90 std::vector<MachineBasicBlock *> Predecessors;
254 pred_iterator pred_begin() { return Predecessors.begin(); }
255 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
256 pred_iterator pred_end() { return Predecessors.end(); }
257 const_pred_iterator pred_end() const { return Predecessors.end(); }
259 { return Predecessors.rbegin();}
261 { return Predecessors.rbegin();}
263 { return Predecessors.rend(); }
265 { return Predecessors.rend(); }
267 return (unsigned)Predecessors.size();
[all …]
|
| /freebsd-12.1/contrib/llvm/lib/Support/ |
| H A D | DAGDeltaAlgorithm.cpp | 75 std::map<change_ty, std::vector<change_ty> > Predecessors; member in __anonbc61025e0111::DAGDeltaAlgorithmImpl
83 assert(Predecessors.count(Node) && "Invalid node!"); in pred_begin()
84 return Predecessors[Node].begin(); in pred_begin()
87 assert(Predecessors.count(Node) && "Invalid node!"); in pred_end()
88 return Predecessors[Node].end(); in pred_end()
186 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
191 Predecessors[it->second].push_back(it->first); in DAGDeltaAlgorithmImpl()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanVerifier.cpp | 74 const auto &Predecessors = VPB->getPredecessors(); in verifyBlocksInRegion() local
78 assert(!hasDuplicates(Predecessors) && in verifyBlocksInRegion()
81 for (const VPBlockBase *Pred : Predecessors) { in verifyBlocksInRegion()
|
| H A D | VPlan.h | 348 SmallVector<VPBlockBase *, 1> Predecessors; variable
365 Predecessors.push_back(Predecessor); in appendPredecessor()
370 auto Pos = std::find(Predecessors.begin(), Predecessors.end(), Predecessor); in removePredecessor()
372 Predecessors.erase(Pos); in removePredecessor()
426 const VPBlocksTy &getPredecessors() const { return Predecessors; } in getPredecessors()
427 VPBlocksTy &getPredecessors() { return Predecessors; } in getPredecessors()
438 return (Predecessors.size() == 1 ? *Predecessors.begin() : nullptr); in getSinglePredecessor()
442 size_t getNumPredecessors() const { return Predecessors.size(); } in getNumPredecessors()
519 assert(Predecessors.empty() && "Block predecessors already set."); in setPredecessors()
|
| H A D | VPlan.cpp | 98 if (!Predecessors.empty() || !Parent) in getEnclosingBlockWithPredecessors()
|
| /freebsd-12.1/contrib/llvm/include/llvm/Analysis/ |
| H A D | Interval.h | 64 std::vector<BasicBlock*> Predecessors; variable
114 return I->Predecessors.begin(); in pred_begin()
117 return I->Predecessors.end(); in pred_end()
|
| /freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/ |
| H A D | SILowerI1Copies.cpp | 127 SmallVector<MachineBasicBlock *, 4> Predecessors; member in __anon8a17bcda0111::PhiIncomingAnalysis
138 ArrayRef<MachineBasicBlock *> predecessors() const { return Predecessors; } in predecessors()
145 Predecessors.clear(); in analyze()
203 if (llvm::find(Predecessors, UnreachablePred) == Predecessors.end()) in analyze()
204 Predecessors.push_back(UnreachablePred); in analyze()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/IPO/ |
| H A D | SampleProfile.cpp | 283 BlockEdgeMap Predecessors; member in __anon696b38bd0111::SampleProfileLoader
490 Predecessors.clear(); in clearFunctionData()
1035 NumTotalEdges = Predecessors[BB].size(); in propagateThroughEdges()
1036 for (auto *Pred : Predecessors[BB]) { in propagateThroughEdges()
1043 SingleEdge = std::make_pair(Predecessors[BB][0], BB); in propagateThroughEdges()
1125 for (auto *Pred : Predecessors[BB]) { in propagateThroughEdges()
1170 if (!Predecessors[B1].empty()) in buildEdges()
1175 Predecessors[B1].push_back(B2); in buildEdges()
|
| /freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/ |
| H A D | ThreadSafetyTIL.h | 1544 size_t numPredecessors() const { return Predecessors.size(); } in numPredecessors()
1562 BlockArray &predecessors() { return Predecessors; } in predecessors()
1563 const BlockArray &predecessors() const { return Predecessors; } in predecessors()
1608 auto I = std::find(Predecessors.cbegin(), Predecessors.cend(), BB); in findPredecessorIndex()
1609 return std::distance(Predecessors.cbegin(), I); in findPredecessorIndex()
1666 BlockArray Predecessors; variable
|
| /freebsd-12.1/contrib/llvm/lib/CodeGen/ |
| H A D | MachineBasicBlock.cpp | 756 Predecessors.push_back(Pred); in addPredecessor()
760 pred_iterator I = find(Predecessors, Pred); in removePredecessor()
761 assert(I != Predecessors.end() && "Pred is not a predecessor of this block!"); in removePredecessor()
762 Predecessors.erase(I); in removePredecessor()
|