| /openbsd-src/gnu/llvm/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()
|
| /openbsd-src/gnu/llvm/llvm/lib/Support/ |
| H A D | DAGDeltaAlgorithm.cpp | 73 std::map<change_ty, std::vector<change_ty> > Predecessors; member in __anonba60a7900111::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()
|
| /openbsd-src/gnu/llvm/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 …]
|
| 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()
|
| /openbsd-src/gnu/llvm/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()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/ |
| H A D | MachineBasicBlock.h | 118 std::vector<MachineBasicBlock *> Predecessors;
357 pred_iterator pred_begin() { return Predecessors.begin(); }
358 const_pred_iterator pred_begin() const { return Predecessors.begin(); }
359 pred_iterator pred_end() { return Predecessors.end(); }
360 const_pred_iterator pred_end() const { return Predecessors.end(); }
362 { return Predecessors.rbegin();}
364 { return Predecessors.rbegin();}
366 { return Predecessors.rend(); }
368 { return Predecessors.rend(); }
370 return (unsigned)Predecessors.size();
[all …]
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Utils/ |
| H A D | FixIrreducible.cpp | 178 SetVector<BasicBlock *> Predecessors; in createNaturalLoopInternal() local
181 Predecessors.insert(P); in createNaturalLoopInternal()
187 for (auto P : Predecessors) { in createNaturalLoopInternal()
197 CreateControlFlowHub(&DTU, GuardBlocks, Predecessors, Headers, "irr"); in createNaturalLoopInternal()
|
| /openbsd-src/gnu/llvm/llvm/lib/Transforms/Vectorize/ |
| H A D | VPlanVerifier.cpp | 75 const auto &Predecessors = VPB->getPredecessors(); in verifyBlocksInRegion() local
79 assert(!hasDuplicates(Predecessors) && in verifyBlocksInRegion()
82 for (const VPBlockBase *Pred : Predecessors) { in verifyBlocksInRegion()
|
| H A D | VPlan.h | 403 SmallVector<VPBlockBase *, 1> Predecessors; variable
421 Predecessors.push_back(Predecessor); in appendPredecessor()
426 auto Pos = find(Predecessors, Predecessor); in removePredecessor()
428 Predecessors.erase(Pos); in removePredecessor()
492 const VPBlocksTy &getPredecessors() const { return Predecessors; } in getPredecessors()
493 VPBlocksTy &getPredecessors() { return Predecessors; } in getPredecessors()
504 return (Predecessors.size() == 1 ? *Predecessors.begin() : nullptr); in getSinglePredecessor()
508 size_t getNumPredecessors() const { return Predecessors.size(); } in getNumPredecessors()
575 assert(Predecessors.empty() && "Block predecessors already set."); in setPredecessors()
581 void clearPredecessors() { Predecessors.clear(); } in clearPredecessors()
|
| H A D | VPlan.cpp | 136 auto &Predecessors = Current->getPredecessors(); in getPlanEntry() local
137 WorkList.insert(Predecessors.begin(), Predecessors.end()); in getPlanEntry()
192 if (!Predecessors.empty() || !Parent) in getEnclosingBlockWithPredecessors()
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/Transforms/Utils/ |
| H A D | SampleProfileLoaderBaseImpl.h | 198 BlockEdgeMap Predecessors;
238 Predecessors.clear();
584 NumTotalEdges = Predecessors[BB].size();
585 for (auto *Pred : Predecessors[BB]) {
592 SingleEdge = std::make_pair(Predecessors[BB][0], BB);
674 for (auto *Pred : Predecessors[BB]) {
720 if (!Predecessors[B1].empty())
724 Predecessors[B1].push_back(B2);
|
| H A D | BasicBlockUtils.h | 584 const SetVector<BasicBlock *> &Predecessors,
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/AMDGPU/ |
| H A D | SILowerI1Copies.cpp | 134 SmallVector<MachineBasicBlock *, 4> Predecessors; member in __anon1ceaab0c0111::PhiIncomingAnalysis
146 ArrayRef<MachineBasicBlock *> predecessors() const { return Predecessors; } in predecessors()
153 Predecessors.clear(); in analyze()
197 if (!llvm::is_contained(Predecessors, UnreachablePred)) in analyze()
198 Predecessors.push_back(UnreachablePred); in analyze()
|
| /openbsd-src/gnu/llvm/llvm/lib/IR/ |
| H A D | BasicBlock.cpp | 455 SmallVector<BasicBlock *, 4> Predecessors; in splitBasicBlockBefore() local
457 Predecessors.push_back(Pred); in splitBasicBlockBefore()
458 for (BasicBlock *Pred : Predecessors) { in splitBasicBlockBefore()
|
| /openbsd-src/gnu/llvm/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)
|
| /openbsd-src/gnu/llvm/llvm/lib/CodeGen/ |
| H A D | MachineBasicBlock.cpp | 882 Predecessors.push_back(Pred); in addPredecessor()
886 pred_iterator I = find(Predecessors, Pred); in removePredecessor()
887 assert(I != Predecessors.end() && "Pred is not a predecessor of this block!"); in removePredecessor()
888 Predecessors.erase(I); in removePredecessor()
|
| H A D | README.txt | 40 Predecessors according to CFG: 0x8b0c5f0 (#3) 0x8b0a7c0 (#4)
|
| /openbsd-src/gnu/llvm/clang/include/clang/Analysis/Analyses/ |
| H A D | ThreadSafetyTIL.h | 1543 size_t numPredecessors() const { return Predecessors.size(); } in numPredecessors()
1561 BlockArray &predecessors() { return Predecessors; } in predecessors()
1562 const BlockArray &predecessors() const { return Predecessors; } in predecessors()
1607 auto I = llvm::find(Predecessors, BB); in findPredecessorIndex()
1608 return std::distance(Predecessors.cbegin(), I); in findPredecessorIndex()
1665 BlockArray Predecessors; variable
|
| /openbsd-src/gnu/llvm/clang/docs/ |
| H A D | InternalsManual.rst | 2588 Predecessors (0):
2595 Predecessors (1): B5
2600 Predecessors (1): B4
2606 Predecessors (1): B4
2611 Predecessors (2): B2 B3
2615 Predecessors (1): B1
|