/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyFixIrreducibleControlFlow.cpp | 91 for (auto *Pred : MBB->predecessors()) { 158 for (auto *Pred : MBB->predecessors()) { 177 for (auto *Pred : Looper->predecessors()) { 212 for (auto *Pred : Entry->predecessors()) { 223 for (auto *Pred : MBB->predecessors()) { 395 for (auto *Pred : Entry->predecessors()) { 402 // This set stores predecessors within this loop. 427 // predecessors outside the loop and one for predecessors inside the loop.
|
H A D | WebAssemblyCFGSort.cpp | 262 // Prepare for a topological sort: Record the number of predecessors each 269 for (const MachineBasicBlock *Pred : MBB.predecessors()) 391 // other predecessors should be backedges below. 392 for (auto Pred : MBB.predecessors()) 395 "Loop header predecessors must be loop predecessors or " 398 // Exception header. All predecessors should be sorted above. 399 for (auto Pred : MBB.predecessors()) 401 "Non-loop-header predecessors should be topologically sorted"); 407 // Not a region header. All predecessors shoul [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | MachineDominators.cpp | 106 for (MachineBasicBlock *PredBB : Succ->predecessors()) { 141 // If all the other predecessors of "Succ" are dominated by "Succ" itself
|
H A D | LiveRangeCalc.cpp | 141 // Checking if the entry of MBB is reached by some def: add all predecessors 143 for (MachineBasicBlock *P : MBB.predecessors()) 177 // entry, or it undefines the range, do not process its predecessors. 185 // Still don't know: add all predecessors to the work list. 186 for (MachineBasicBlock *P : B.predecessors()) 234 for (MachineBasicBlock *Pred : MBB->predecessors()) { 353 // IDom dominates all of our predecessors, but it may not be their 366 for (MachineBasicBlock *Pred : MBB->predecessors()) { 450 for (const MachineBasicBlock *P : B->predecessors())
|
H A D | MachineLoopInfo.cpp | 128 for (MachineBasicBlock *P : HB->predecessors()) {
|
H A D | ReachingDefAnalysis.cpp | 75 // Try to coalesce live-out registers from predecessors. 76 for (MachineBasicBlock *pred : MBB->predecessors()) { 153 for (MachineBasicBlock *pred : MBB->predecessors()) { function 157 // Incoming may be empty for dead predecessors. 413 for (auto *Pred : MBB->predecessors()) 426 for (auto *Pred : MI->getParent()->predecessors())
|
H A D | MachineBlockPlacement.cpp | 94 "predecessors (i.e. don't add nops that are executed). In log2 " 306 /// Count of predecessors of any block within the chain which have not 308 /// until those predecessors are scheduled (or we find a sufficiently good 528 /// predecessors. Filters based on loop. 813 for (MachineBasicBlock *SuccPred : Succ->predecessors()) { 904 /// lower part of a trellis if all of the predecessors of S are either in S or 920 // To avoid reviewing the same predecessors twice. 925 for (auto SuccPred : Succ->predecessors()) { 965 // predecessor. If the best incoming predecessors aren't the same, 1024 for (MachineBasicBlock *SuccPred : Succ->predecessors()) { [all...] |
H A D | WinEHPrepare.cpp | 258 for (const BasicBlock *PredBlock : predecessors(BB)) 320 for (const BasicBlock *PredBlock : predecessors(BB)) { 389 for (const BasicBlock *PredBlock : predecessors(BB)) 425 for (const BasicBlock *PredBlock : predecessors(BB)) 837 for (BasicBlock *Pred : predecessors(OldBlock)) 1164 for (BasicBlock *PredBlock : predecessors(EHBlock)) {
|
H A D | ShrinkWrap.cpp | 420 Save = FindIDom<>(*Save, Save->predecessors(), *MDT); 559 Save = FindIDom<>(*Save, Save->predecessors(), *MDT);
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | FixIrreducible.cpp | 14 // 2. Collect the set of predecessors P of these headers. These may be inside as 55 // takes a set of incoming blocks (the predecessors) and outgoing blocks (the 59 // predecessors, every value used in the header (or later) but defined in a 171 for (auto P : predecessors(H)) { 177 dbgs() << "Found predecessors:"; 185 // predecessors to the headers. 283 for (const auto P : predecessors(BB)) { 284 // Skip unreachable predecessors.
|
H A D | LoopUnrollRuntime.cpp | 139 for (BasicBlock *PredBB : predecessors(PrologExit)) 161 SmallVector<BasicBlock *, 4> Preds(predecessors(OriginalLoopLatchExit)); 276 SmallVector<BasicBlock*, 4> Preds(predecessors(Exit)); 673 SmallVector<BasicBlock*, 4> Preds(predecessors(LatchExit));
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUUnifyDivergentExitNodes.cpp | 104 for (BasicBlock *Pred : predecessors(&BB)) 112 for (BasicBlock *Pred : predecessors(Top)) {
|
H A D | AMDGPUAnnotateUniformValues.cpp | 82 for (auto I : predecessors(Root))
|
H A D | SIAnnotateControlFlow.cpp | 274 for (BasicBlock *Pred : predecessors(Target)) { 305 for (BasicBlock *Pred : predecessors(BB)) {
|
H A D | SILowerI1Copies.cpp | 120 /// - If an incoming block has no predecessors in this set, we can take the 152 ArrayRef<MachineBasicBlock *> predecessors() const { return Predecessors; } function in class:__anon3982::PhiIncomingAnalysis 206 for (MachineBasicBlock *Pred : MBB->predecessors()) { 336 // undef value to unreachable predecessors instead. 337 for (MachineBasicBlock *Pred : Dom->predecessors()) { function 636 for (MachineBasicBlock *MBB : PIA.predecessors())
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | CallSiteSplitting.cpp | 16 // on any argument can be found by following the single predecessors of the 17 // all site's predecessors. Currently this pass only handles call-sites with 2 18 // predecessors. For example, in the code below, we try to split the call-site 151 /// single predecessors. If there are conflicting conditions along a path, like 181 SmallVector<BasicBlock *, 2> Preds(predecessors((BB))); 182 assert(Preds.size() == 2 && "Expected exactly 2 predecessors!"); 196 // Need 2 predecessors and cannot split an edge from an IndirectBrInst. 197 SmallVector<BasicBlock *, 2> Preds(predecessors(CallSiteBB)); 263 /// For each (predecessor, conditions from predecessors) pair, it will split the 266 /// constraints based on the conditions from their predecessors [all...] |
H A D | LoopDeletion.cpp | 106 // All predecessors of the preheader should have a constant conditional 108 for (auto *Pred: predecessors(Preheader)) { 120 "Preheader should have predecessors at this point!"); 121 // All the predecessors have the loop preheader as not-taken target.
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonCFGOptimizer.cpp | 109 for (MachineBasicBlock *PB : MBB->predecessors())
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64A53Fix835769.cpp | 143 for (MachineBasicBlock *S : MBB->predecessors())
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | MustExecute.cpp | 162 assert(Predecessors.empty() && "Garbage in predecessors set?"); 167 for (auto *Pred : predecessors(BB)) { 183 for (auto *PredPred : predecessors(Pred)) 198 // Collect all transitive predecessors of BB in the same loop. This set will 203 // Make sure that all successors of, all predecessors of BB which are not 206 // 2) Also predecessors of BB, 227 // iteration the set of predecessors would contain only paths from 242 // All predecessors can only lead us to BB. 282 // Collect all transitive predecessors of BB in the same loop. This set will 658 for (const BasicBlock *PredBB : predecessors(InitB [all...] |
H A D | CFG.cpp | 85 /// with multiple predecessors. 97 assert(find(predecessors(Dest), TI->getParent()) != pred_end(Dest) && 246 // have predecessors.
|
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | CFG.h | 12 /// iterating successors and predecessors of basic blocks, the successors of 120 /// Get the number of predecessors of \p BB. This is a linear time operation. 125 inline pred_range predecessors(BasicBlock *BB) { function in namespace:llvm 128 inline const_pred_range predecessors(const BasicBlock *BB) { function in namespace:llvm
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | VPlanHCFGBuilder.cpp | 81 // Set predecessors of \p VPBB in the same order as they are in \p BB. \p VPBB 82 // must have no predecessors. 85 // Collect VPBB predecessors. 86 for (BasicBlock *Pred : predecessors(BB)) 246 // predecessors must be set in the same order as they are in the incomming IR. 248 // based on predecessors traversal. 259 // Preheader's predecessors will be set during the loop RPO traversal below. 303 // Set VPBB predecessors in the same order as they are in the incoming BB.
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | X86WinAllocaExpander.cpp | 151 for (MachineBasicBlock *Pred : MBB->predecessors())
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | BlockExtractor.cpp | 146 // Look through the landing pad's predecessors. If one of them ends in an 149 for (auto PredBB : predecessors(LPad)) {
|