| /netbsd-src/external/apache2/llvm/dist/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()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Support/ |
| H A D | DAGDeltaAlgorithm.cpp | 74 std::map<change_ty, std::vector<change_ty> > Predecessors; member in __anon1494bb440111::DAGDeltaAlgorithmImpl
82 assert(Predecessors.count(Node) && "Invalid node!"); in pred_begin()
83 return Predecessors[Node].begin(); in pred_begin()
86 assert(Predecessors.count(Node) && "Invalid node!"); in pred_end()
87 return Predecessors[Node].end(); in pred_end()
185 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
190 Predecessors[it->second].push_back(it->first); in DAGDeltaAlgorithmImpl()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| H A D | MustExecute.cpp | 164 SmallPtrSetImpl<const BasicBlock *> &Predecessors) { in collectTransitivePredecessors() argument
165 assert(Predecessors.empty() && "Garbage in predecessors set?"); in collectTransitivePredecessors()
171 Predecessors.insert(Pred); in collectTransitivePredecessors()
187 if (Predecessors.insert(PredPred).second) in collectTransitivePredecessors()
203 SmallPtrSet<const BasicBlock *, 4> Predecessors; in allLoopPathsLeadToBlock() local
204 collectTransitivePredecessors(CurLoop, BB, Predecessors); in allLoopPathsLeadToBlock()
213 for (auto *Pred : Predecessors) { in allLoopPathsLeadToBlock()
225 Succ != BB && !Predecessors.count(Succ)) in allLoopPathsLeadToBlock()
287 SmallPtrSet<const BasicBlock *, 4> Predecessors; in doesNotWriteMemoryBefore() local
288 collectTransitivePredecessors(CurLoop, BB, Predecessors); in doesNotWriteMemoryBefore()
[all …]
|
| H A D | Interval.cpp | 34 for (const BasicBlock *Predecessor : Predecessors) in print()
|
| H A D | IntervalPartition.cpp | 70 getBlockInterval(Successor)->Predecessors.push_back(Header); in updatePredecessors()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanVerifier.cpp | 73 const auto &Predecessors = VPB->getPredecessors(); in verifyBlocksInRegion() local
77 assert(!hasDuplicates(Predecessors) && in verifyBlocksInRegion()
80 for (const VPBlockBase *Pred : Predecessors) { in verifyBlocksInRegion()
|
| H A D | VPlan.h | 394 SmallVector<VPBlockBase *, 1> Predecessors; variable
422 Predecessors.push_back(Predecessor); in appendPredecessor()
427 auto Pos = find(Predecessors, Predecessor); in removePredecessor()
429 Predecessors.erase(Pos); in removePredecessor()
491 const VPBlocksTy &getPredecessors() const { return Predecessors; } in getPredecessors()
492 VPBlocksTy &getPredecessors() { return Predecessors; } in getPredecessors()
503 return (Predecessors.size() == 1 ? *Predecessors.begin() : nullptr); in getSinglePredecessor()
507 size_t getNumPredecessors() const { return Predecessors.size(); } in getNumPredecessors()
591 assert(Predecessors.empty() && "Block predecessors already set."); in setPredecessors()
597 void clearPredecessors() { Predecessors.clear(); } in clearPredecessors()
|
| H A D | VPlan.cpp | 128 auto &Predecessors = Current->getPredecessors(); in getPlanEntry() local
129 WorkList.insert(Predecessors.begin(), Predecessors.end()); in getPlanEntry()
184 if (!Predecessors.empty() || !Parent) in getEnclosingBlockWithPredecessors()
|
| /netbsd-src/external/apache2/llvm/dist/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()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| H A D | MachineBasicBlock.h | 119 std::vector<MachineBasicBlock *> Predecessors;
316 pred_iterator pred_begin() { return Predecessors.begin(); }
317 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
318 pred_iterator pred_end() { return Predecessors.end(); }
319 const_pred_iterator pred_end() const { return Predecessors.end(); }
321 { return Predecessors.rbegin();}
323 { return Predecessors.rbegin();}
325 { return Predecessors.rend(); }
327 { return Predecessors.rend(); }
329 return (unsigned)Predecessors.size();
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| H A D | FixIrreducible.cpp | 169 SetVector<BasicBlock *> Predecessors; in createNaturalLoopInternal() local
172 Predecessors.insert(P); in createNaturalLoopInternal()
178 for (auto P : Predecessors) { in createNaturalLoopInternal()
188 CreateControlFlowHub(&DTU, GuardBlocks, Predecessors, Headers, "irr"); in createNaturalLoopInternal()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/ |
| H A D | SampleProfileLoaderBaseImpl.h | 176 BlockEdgeMap Predecessors;
211 Predecessors.clear();
554 NumTotalEdges = Predecessors[BB].size();
555 for (auto *Pred : Predecessors[BB]) {
562 SingleEdge = std::make_pair(Predecessors[BB][0], BB);
644 for (auto *Pred : Predecessors[BB]) {
690 if (!Predecessors[B1].empty())
694 Predecessors[B1].push_back(B2);
|
| H A D | BasicBlockUtils.h | 594 const SetVector<BasicBlock *> &Predecessors,
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| H A D | SILowerI1Copies.cpp | 133 SmallVector<MachineBasicBlock *, 4> Predecessors; member in __anond5a978c00111::PhiIncomingAnalysis
144 ArrayRef<MachineBasicBlock *> predecessors() const { return Predecessors; } in predecessors()
151 Predecessors.clear(); in analyze()
206 if (!llvm::is_contained(Predecessors, UnreachablePred)) in analyze()
207 Predecessors.push_back(UnreachablePred); in analyze()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
| H A D | README-X86-64.txt | 111 Predecessors according to CFG: 0x203aec0 (#0)
116 Predecessors according to CFG: 0x203af10 (#1) 0x203af60 (#2)
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| H A D | MachineBasicBlock.cpp | 856 Predecessors.push_back(Pred); in addPredecessor()
860 pred_iterator I = find(Predecessors, Pred); in removePredecessor()
861 assert(I != Predecessors.end() && "Pred is not a predecessor of this block!"); in removePredecessor()
862 Predecessors.erase(I); in removePredecessor()
|
| H A D | README.txt | 40 Predecessors according to CFG: 0x8b0c5f0 (#3) 0x8b0a7c0 (#4)
|
| /netbsd-src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/ |
| H A D | ThreadSafetyTIL.h | 1545 size_t numPredecessors() const { return Predecessors.size(); } in numPredecessors()
1563 BlockArray &predecessors() { return Predecessors; } in predecessors()
1564 const BlockArray &predecessors() const { return Predecessors; } in predecessors()
1609 auto I = llvm::find(Predecessors, BB); in findPredecessorIndex()
1610 return std::distance(Predecessors.cbegin(), I); in findPredecessorIndex()
1667 BlockArray Predecessors; variable
|
| /netbsd-src/external/apache2/llvm/dist/clang/docs/ |
| H A D | InternalsManual.rst | 2585 Predecessors (0):
2592 Predecessors (1): B5
2597 Predecessors (1): B4
2603 Predecessors (1): B4
2608 Predecessors (2): B2 B3
2612 Predecessors (1): B1
|