/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | ddg.h | 36 predecessors bitmaps held in each ddg_node. Do not make changes to 39 #define NODE_PREDECESSORS(x) ((x)->predecessors) 65 sbitmap predecessors; member in struct:ddg_node
|
H A D | hsa-regalloc.c | 46 naive_process_phi (hsa_insn_phi *phi, const vec<edge> &predecessors) argument 59 e = predecessors[i]; 96 auto_vec<edge, 8> predecessors; local 99 predecessors.safe_push (EDGE_PRED (bb, i)); 104 naive_process_phi (phi, predecessors);
|
H A D | ddg.c | 499 && !bitmap_bit_p (dest_node->predecessors, j)) 584 g->nodes[i].predecessors = sbitmap_alloc (num_nodes); 585 bitmap_clear (g->nodes[i].predecessors); 631 sbitmap_free (g->nodes[i].predecessors); 769 gcc_assert (src->successors && dest->predecessors); 772 bitmap_set_bit (dest->predecessors, src->cuid); 920 /* Given a set OPS of nodes in the DDG, find the set of their predecessors
|
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | ddg.h | 36 predecessors bitmaps held in each ddg_node. Do not make changes to 39 #define NODE_PREDECESSORS(x) ((x)->predecessors) 65 sbitmap predecessors; member in struct:ddg_node
|
H A D | ddg.cc | 499 && !bitmap_bit_p (dest_node->predecessors, j)) 584 g->nodes[i].predecessors = sbitmap_alloc (num_nodes); 585 bitmap_clear (g->nodes[i].predecessors); 631 sbitmap_free (g->nodes[i].predecessors); 769 gcc_assert (src->successors && dest->predecessors); 772 bitmap_set_bit (dest->predecessors, src->cuid); 920 /* Given a set OPS of nodes in the DDG, find the set of their predecessors
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyCFGSort.cpp | 194 // Prepare for a topological sort: Record the number of predecessors each 201 for (const MachineBasicBlock *Pred : MBB.predecessors()) 350 // other predecessors should be backedges below. 351 for (auto Pred : MBB.predecessors()) 354 "Loop header predecessors must be loop predecessors or " 357 // Exception header. All predecessors should be sorted above. 358 for (auto Pred : MBB.predecessors()) 360 "Non-loop-header predecessors should be topologically sorted"); 366 // Not a region header. All predecessors shoul [all...] |
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.
|
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
H A D | PredIteratorCache.h | 47 SmallVector<BasicBlock *, 32> PredCache(predecessors(BB));
|
H A D | CFG.h | 12 /// iterating successors and predecessors of basic blocks, the successors of 122 /// Get the number of predecessors of \p BB. This is a linear time operation. 127 inline pred_range predecessors(BasicBlock *BB) { function in namespace:llvm 130 inline const_pred_range predecessors(const BasicBlock *BB) { function in namespace:llvm
|
/netbsd-current/external/apache2/llvm/dist/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()) 176 // entry, or it undefines the range, do not process its predecessors. 184 // Still don't know: add all predecessors to the work list. 185 for (MachineBasicBlock *P : B.predecessors()) 233 for (MachineBasicBlock *Pred : MBB->predecessors()) { 352 // IDom dominates all of our predecessors, but it may not be their 365 for (MachineBasicBlock *Pred : MBB->predecessors()) { 449 for (const MachineBasicBlock *P : B->predecessors())
|
H A D | ReachingDefAnalysis.cpp | 76 // Try to coalesce live-out registers from predecessors. 77 for (MachineBasicBlock *pred : MBB->predecessors()) { 154 for (MachineBasicBlock *pred : MBB->predecessors()) { 158 // Incoming may be empty for dead predecessors. 403 for (auto *MBB : MI->getParent()->predecessors()) 428 for (auto *Pred : MBB->predecessors()) 442 for (auto *Pred : Parent->predecessors())
|
H A D | MachineLoopInfo.cpp | 131 for (MachineBasicBlock *P : HB->predecessors()) {
|
H A D | MachineSSAUpdater.cpp | 152 // If there are no predecessors, just return undef. 167 for (MachineBasicBlock *PredBB : BB->predecessors()) { 193 // Fill in all the predecessors of the PHI. 281 /// FindPredecessorBlocks - Put the predecessors of BB into the Preds 285 append_range(*Preds, BB->predecessors());
|
H A D | MachineBlockPlacement.cpp | 94 "predecessors (i.e. don't add nops that are executed). In log2 " 316 /// Count of predecessors of any block within the chain which have not 318 /// until those predecessors are scheduled (or we find a sufficiently good 551 /// predecessors. Filters based on loop. 836 for (MachineBasicBlock *SuccPred : Succ->predecessors()) { 927 /// lower part of a trellis if all of the predecessors of S are either in S or 943 // To avoid reviewing the same predecessors twice. 948 for (auto SuccPred : Succ->predecessors()) { 988 // predecessor. If the best incoming predecessors aren't the same, 1047 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)) 831 for (BasicBlock *Pred : predecessors(OldBlock)) 1155 for (BasicBlock *PredBlock : predecessors(EHBlock)) {
|
/netbsd-current/external/apache2/llvm/dist/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 | LoopSimplify.cpp | 18 // (blocks which are outside of the loop that have predecessors inside of the 19 // loop) only have predecessors from inside of the loop (and are thus dominated 128 // Compute the set of predecessors of the loop that are not in the loop. 130 for (BasicBlock *P : predecessors(Header)) { 160 /// Add the specified block, and all of its predecessors, to the specified set, 172 append_range(Worklist, predecessors(BB)); 256 // Pull out all predecessors that have varying values in the loop. This 307 for (BasicBlock *P : predecessors(Header)) { 382 for (BasicBlock *P : predecessors(Header)) { 496 // predecessors tha [all...] |
/netbsd-current/external/apache2/llvm/dist/clang/utils/analyzer/ |
H A D | exploded-graph-rewriter.py | 305 # and in this moment we already need a room for predecessors and successors. 308 self.predecessors = [] 361 self.nodes[succ].predecessors.append(pred) 829 if self._do_diffs and len(node.predecessors) == 1 \ 831 prev_s = self._graph.nodes[node.predecessors[0]].state 921 succ.predecessors = [node_id] 963 for pred_id in node.predecessors: 972 node.predecessors = [succ_id for succ_id in node.predecessors
|
/netbsd-current/external/apache2/llvm/dist/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...] |
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Target/AArch64/ |
H A D | AArch64A53Fix835769.cpp | 143 for (MachineBasicBlock *S : MBB->predecessors())
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
H A D | HexagonCFGOptimizer.cpp | 110 for (MachineBasicBlock *PB : MBB->predecessors())
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
H A D | PPCCTRLoops.cpp | 151 append_range(Preds, MBB->predecessors());
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUUnifyDivergentExitNodes.cpp | 119 SmallVector<BasicBlock *, 8> Stack(predecessors(&BB)); 127 for (BasicBlock *Pred : predecessors(Top)) {
|
H A D | SIAnnotateControlFlow.cpp | 267 for (BasicBlock *Pred : predecessors(Target)) { 298 for (BasicBlock *Pred : predecessors(BB)) {
|