/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | cfganal.cc | 85 stack.quick_push (ei_start (ENTRY_BLOCK_PTR_FOR_FN (fun)->succs)); 106 if (EDGE_COUNT (dest->succs) > 0) 110 stack.quick_push (ei_start (dest->succs)); 158 FOR_EACH_EDGE (e, ei, bb->succs) 170 FOR_EACH_EDGE (e, ei, bb->succs) 202 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs) 216 FOR_EACH_EDGE (e, ei, b->succs) 273 num_edges += EDGE_COUNT (bb->succs); 285 FOR_EACH_EDGE (e, ei, bb->succs) 343 FOR_EACH_EDGE (e, ei, bb->succs) [all...] |
H A D | profile.cc | 124 FOR_EACH_EDGE (e, ei, bb->succs) 217 FOR_EACH_EDGE (e, ei, bb->succs) 267 FOR_EACH_EDGE (e, ei, bb->succs) 287 inconsistent |= is_edge_inconsistent (bb->succs); 315 if (bb_gcov_count (bb) != sum_edge_counts (bb->succs) && 325 sum_edge_counts (bb->succs)); 344 bb_gcov_count (bb) = sum_edge_counts (bb->succs); 366 FOR_EACH_EDGE (e, ei, bb->succs) 452 FOR_EACH_EDGE (e, ei, bb->succs) 503 FOR_EACH_EDGE (e, ei, bb->succs) [all...] |
H A D | cfgbuild.cc | 236 FOR_EACH_EDGE (e, ei, bb->succs) 424 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) 656 if (EDGE_COUNT (b->succs) == 2) 689 FOR_EACH_EDGE (e, ei, b->succs) 720 unsigned int ns = EDGE_COUNT (bb->succs); 723 if (n == last_basic_block_for_fn (cfun) && ns == EDGE_COUNT (bb->succs)) 724 n_succs[bb->index] = EDGE_COUNT (bb->succs); 784 else if (EDGE_COUNT (bb->succs) == n_succs[bb->index]) 791 && EDGE_COUNT (bb->succs) >= 2)
|
H A D | shrink-wrap.cc | 114 FOR_EACH_EDGE (e, ei, bb->succs) 283 if (EDGE_COUNT (bb->succs) == 1) 562 if (EDGE_COUNT (e->src->succs) > 1) 815 FOR_EACH_EDGE (e, ei, bb->succs) 871 FOR_EACH_EDGE (e, ei, bb->succs) 937 if (EDGE_COUNT (dup->succs) == 0) 957 FOR_EACH_EDGE (e, ei, src->succs) 979 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs) 992 FOR_EACH_EDGE (e, ei, bb->succs) 1138 if (EDGE_COUNT (bb->succs) [all...] |
H A D | gimple-ssa-split-paths.cc | 76 && EDGE_COUNT (bb->succs) == 2 166 = EDGE_COUNT (pred1->succs) == 1 ? count_stmts_in_block (pred1) : 0; 168 = EDGE_COUNT (pred2->succs) == 1 ? count_stmts_in_block (pred2) : 0; 505 if (EDGE_COUNT (pred0->succs) != 1)
|
H A D | cfghooks.cc | 173 FOR_EACH_EDGE (e, ei, bb->succs) 264 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs) 409 if (EDGE_COUNT (e->src->succs) != 2) 426 gcc_assert (EDGE_COUNT (e->src->succs) == 2); 559 FOR_EACH_EDGE (e, ei, new_bb->succs) 638 while (EDGE_COUNT (bb->succs) != 0) 852 while (EDGE_COUNT (a->succs) != 0) 856 FOR_EACH_EDGE (e, ei, b->succs) 867 a->succs = b->succs; [all...] |
H A D | cfgloopanal.cc | 96 FOR_EACH_EDGE (e, ei, act->succs) 105 FOR_EACH_EDGE (e, ei, act->succs) 457 FOR_EACH_EDGE (e, ei, bb->succs) 518 FOR_EACH_EDGE (e, ei, bb->succs)
|
H A D | domwalk.cc | 180 FOR_EACH_EDGE (e, ei, bb->succs) 247 FOR_EACH_EDGE (e, ei, bb->succs) 314 FOR_EACH_EDGE (e, ei, bb->succs)
|
H A D | cfg.cc | 104 vec_free (bb->succs); 105 bb->succs = NULL; 123 FOR_EACH_EDGE (e, ei, bb->succs) 221 vec_safe_push (e->src->succs, e); 245 for (ei = ei_start (src->succs); (tmp = ei_safe_edge (ei)); ) 249 src->succs->unordered_remove (ei.index); 444 FOR_EACH_EDGE (e, ei, bb->succs) 710 FOR_EACH_EDGE (e, ei, bb->succs) 728 FOR_EACH_EDGE (e, ei, bb->succs) 883 FOR_EACH_EDGE (e, ei, bb->succs) [all...] |
H A D | function-tests.cc | 373 ASSERT_EQ (1, entry->succs->length ()); 375 edge from_entry_to_bb2 = (*entry->succs)[0]; 381 ASSERT_EQ (1, bb2->succs->length ()); 383 edge from_bb2_to_exit = (*bb2->succs)[0]; 389 ASSERT_EQ (NULL, exit->succs);
|
H A D | basic-block.h | 120 vec<edge, va_gc> *succs; variable 311 #define EDGE_CRITICAL_P(e) (EDGE_COUNT ((e)->src->succs) >= 2 \ 317 #define EDGE_SUCC(bb,i) (*(bb)->succs)[(i)] 324 return EDGE_COUNT (bb->succs) == 1; 487 FOR (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) 622 FOR_EACH_EDGE (e, ei, bb->succs)
|
/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | cfganal.c | 84 stack.quick_push (ei_start (ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs)); 105 if (EDGE_COUNT (dest->succs) > 0) 109 stack.quick_push (ei_start (dest->succs)); 161 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs) 175 FOR_EACH_EDGE (e, ei, b->succs) 232 num_edges += EDGE_COUNT (bb->succs); 244 FOR_EACH_EDGE (e, ei, bb->succs) 302 FOR_EACH_EDGE (e, ei, bb->succs) 331 FOR_EACH_EDGE (e, ei, p->succs) 438 num_edges += EDGE_COUNT (bb->succs); [all...] |
H A D | profile.c | 122 FOR_EACH_EDGE (e, ei, bb->succs) 215 FOR_EACH_EDGE (e, ei, bb->succs) 265 FOR_EACH_EDGE (e, ei, bb->succs) 285 inconsistent |= is_edge_inconsistent (bb->succs); 313 if (bb_gcov_count (bb) != sum_edge_counts (bb->succs) && 323 sum_edge_counts (bb->succs)); 342 bb_gcov_count (bb) = sum_edge_counts (bb->succs); 364 FOR_EACH_EDGE (e, ei, bb->succs) 426 FOR_EACH_EDGE (e, ei, bb->succs) 477 FOR_EACH_EDGE (e, ei, bb->succs) [all...] |
H A D | cfgbuild.c | 236 FOR_EACH_EDGE (e, ei, bb->succs) 424 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) 656 if (EDGE_COUNT (b->succs) == 2) 689 FOR_EACH_EDGE (e, ei, b->succs) 720 unsigned int ns = EDGE_COUNT (bb->succs); 723 if (n == last_basic_block_for_fn (cfun) && ns == EDGE_COUNT (bb->succs)) 724 n_succs[bb->index] = EDGE_COUNT (bb->succs); 784 else if (EDGE_COUNT (bb->succs) == n_succs[bb->index]) 791 && EDGE_COUNT (bb->succs) >= 2)
|
H A D | cfghooks.c | 164 FOR_EACH_EDGE (e, ei, bb->succs) 248 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs) 393 if (EDGE_COUNT (e->src->succs) != 2) 410 gcc_assert (EDGE_COUNT (e->src->succs) == 2); 543 FOR_EACH_EDGE (e, ei, new_bb->succs) 622 while (EDGE_COUNT (bb->succs) != 0) 830 while (EDGE_COUNT (a->succs) != 0) 834 FOR_EACH_EDGE (e, ei, b->succs) 845 a->succs = b->succs; [all...] |
H A D | cfg.c | 110 FOR_EACH_EDGE (e, ei, bb->succs) 112 vec_safe_truncate (bb->succs, 0); 116 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (fn)->succs) 119 vec_safe_truncate (ENTRY_BLOCK_PTR_FOR_FN (fn)->succs, 0); 207 vec_safe_push (e->src->succs, e); 231 for (ei = ei_start (src->succs); (tmp = ei_safe_edge (ei)); ) 235 src->succs->unordered_remove (ei.index); 430 FOR_EACH_EDGE (e, ei, bb->succs) 692 FOR_EACH_EDGE (e, ei, bb->succs) 710 FOR_EACH_EDGE (e, ei, bb->succs) [all...] |
H A D | shrink-wrap.c | 113 FOR_EACH_EDGE (e, ei, bb->succs) 282 if (EDGE_COUNT (bb->succs) == 1) 561 if (EDGE_COUNT (e->src->succs) > 1) 804 FOR_EACH_EDGE (e, ei, bb->succs) 860 FOR_EACH_EDGE (e, ei, bb->succs) 926 if (EDGE_COUNT (dup->succs) == 0) 946 FOR_EACH_EDGE (e, ei, src->succs) 968 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs) 981 FOR_EACH_EDGE (e, ei, bb->succs) 1127 if (EDGE_COUNT (bb->succs) [all...] |
H A D | gimple-ssa-split-paths.c | 75 && EDGE_COUNT (bb->succs) == 2 165 = EDGE_COUNT (pred1->succs) == 1 ? count_stmts_in_block (pred1) : 0; 167 = EDGE_COUNT (pred2->succs) == 1 ? count_stmts_in_block (pred2) : 0; 467 if (EDGE_COUNT (pred0->succs) != 1)
|
H A D | domwalk.c | 180 FOR_EACH_EDGE (e, ei, bb->succs) 247 FOR_EACH_EDGE (e, ei, bb->succs) 314 FOR_EACH_EDGE (e, ei, bb->succs)
|
H A D | basic-block.h | 120 vec<edge, va_gc> *succs; variable 311 #define EDGE_CRITICAL_P(e) (EDGE_COUNT ((e)->src->succs) >= 2 \ 317 #define EDGE_SUCC(bb,i) (*(bb)->succs)[(i)] 324 return EDGE_COUNT (bb->succs) == 1; 487 FOR (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) 622 FOR_EACH_EDGE (e, ei, bb->succs)
|
H A D | function-tests.c | 372 ASSERT_EQ (1, entry->succs->length ()); 374 edge from_entry_to_bb2 = (*entry->succs)[0]; 380 ASSERT_EQ (1, bb2->succs->length ()); 382 edge from_bb2_to_exit = (*bb2->succs)[0]; 388 ASSERT_EQ (NULL, exit->succs);
|
H A D | tree-ssa-tail-merge.c | 212 cached in succs, and the successor edge flags are cached in succ_flags. 223 bitmap succs; member in struct:same_succ 402 bitmap_print (file, e->succs, "succs:", "\n"); 462 inchash::hash hstate (bitmap_hash (e->succs)); 515 EXECUTE_IF_SET_IN_BITMAP (e->succs, 0, s, bs) 578 if (!bitmap_equal_p (e1->succs, e2->succs)) 629 same->succs = BITMAP_ALLOC (NULL); 643 BITMAP_FREE (e->succs); [all...] |
/netbsd-current/external/gpl3/binutils/dist/gas/config/ |
H A D | kvx-parse.c | 40 struct node_list_s *succs; member in struct:node_s 146 new_hd->nxt = base->succs; 160 n->succs = NULL; 183 n->succs = insert_in_succ_list (NULL, n); 198 suf->succs = node->succs; 202 rem->succs = insert_in_succ_list (NULL, rem); 206 node->succs = NULL; 208 node->succs = insert_in_succ_list (suf, node); 209 node->succs [all...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/d/dmd/ |
H A D | ob.d | 108 ObNodes succs; /// successors 128 printf("\n succs: "); 129 foreach (ob; succs) 138 goto_, /// goto one of the succs[] 368 curblock.succs.push(ob); 384 curblock.succs.push(dest); 464 curblock.succs.push(ob); 466 bpre.succs.push(curblock); 468 mystate.contBlock.succs.push(curblock); 469 mystate.contBlock.succs [all...] |
/netbsd-current/external/apache2/llvm/dist/clang/include/clang/Analysis/FlowSensitive/ |
H A D | DataflowWorklist.h | 71 for (auto B : Block->succs())
|