Searched refs:succs (Results 1 - 25 of 124) sorted by relevance

12345

/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/
H A Dvrp56.c27 VEC_edge_gc *succs; member in struct:basic_block_def
35 switch (VEC_edge_base_length (&bb->succs->base))
H A Dloadpre8.c38 VEC_edge_gc *succs; member in struct:basic_block_def
88 for ((ei) = ei_start_1 (&((bb->succs))); ei_cond ((ei), &(e));
H A Dcoalesce-1.c72 VEC_edge_gc *succs; member in struct:basic_block_def
78 ((((bb)->succs) ? &((bb)->succs)->base : 0), (0),
/haiku-buildtools/gcc/gcc/
H A Dcfganal.c101 stack[sp++] = ei_start (ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs);
123 if (EDGE_COUNT (dest->succs) > 0)
127 stack[sp++] = ei_start (dest->succs);
181 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs)
195 FOR_EACH_EDGE (e, ei, b->succs)
239 num_edges += EDGE_COUNT (bb->succs);
251 FOR_EACH_EDGE (e, ei, bb->succs)
309 FOR_EACH_EDGE (e, ei, bb->succs)
338 FOR_EACH_EDGE (e, ei, p->succs)
488 if (EDGE_COUNT (pred->succs) <
[all...]
H A Dprofile.c167 FOR_EACH_EDGE (e, ei, bb->succs)
325 FOR_EACH_EDGE (e, ei, bb->succs)
382 FOR_EACH_EDGE (e, ei, bb->succs)
402 inconsistent |= is_edge_inconsistent (bb->succs);
430 if (bb->count != sum_edge_counts (bb->succs) &&
440 sum_edge_counts (bb->succs));
459 bb->count = sum_edge_counts (bb->succs);
481 FOR_EACH_EDGE (e, ei, bb->succs)
591 FOR_EACH_EDGE (e, ei, bb->succs)
642 FOR_EACH_EDGE (e, ei, bb->succs)
[all...]
H A Dcfg.c131 FOR_EACH_EDGE (e, ei, bb->succs)
133 vec_safe_truncate (bb->succs, 0);
137 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs)
140 vec_safe_truncate (ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs, 0);
227 vec_safe_push (e->src->succs, e);
251 for (ei = ei_start (src->succs); (tmp = ei_safe_edge (ei)); )
255 src->succs->unordered_remove (ei.index);
444 FOR_EACH_EDGE (e, ei, bb->succs)
446 if (EDGE_COUNT (bb->succs) && abs (sum - REG_BR_PROB_BASE) > 100)
451 FOR_EACH_EDGE (e, ei, bb->succs)
[all...]
H A Dcfghooks.c176 FOR_EACH_EDGE (e, ei, bb->succs)
257 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs)
396 if (EDGE_COUNT (e->src->succs) != 2)
413 gcc_assert (EDGE_COUNT (e->src->succs) == 2);
537 FOR_EACH_EDGE (e, ei, new_bb->succs)
604 while (EDGE_COUNT (bb->succs) != 0)
802 while (EDGE_COUNT (a->succs) != 0)
806 FOR_EACH_EDGE (e, ei, b->succs)
817 a->succs = b->succs;
[all...]
H A Dbb-reorder.c321 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs)
392 FOR_EACH_EDGE (e, ei, bb->succs)
564 FOR_EACH_EDGE (e, ei, bb->succs)
641 && (EDGE_COUNT (best_edge->dest->succs) > 1
646 FOR_EACH_EDGE (e, ei, bb->succs)
782 FOR_EACH_EDGE (e, ei, bb->succs)
818 FOR_EACH_EDGE (e, ei, trace->last->succs)
826 FOR_EACH_EDGE (e, ei, bb->succs)
1196 FOR_EACH_EDGE (e, ei, traces[t].last->succs)
1270 FOR_EACH_EDGE (e, ei, traces[t].last->succs)
[all...]
H A Dcfgloopanal.c119 FOR_EACH_EDGE (e, ei, act->succs)
128 FOR_EACH_EDGE (e, ei, act->succs)
446 FOR_EACH_EDGE (e, ei, bb->succs)
515 FOR_EACH_EDGE (e, ei, bb->succs)
H A Dtree-ssa-loop-unswitch.c333 if (EDGE_COUNT (b->succs) == 2)
347 FOR_EACH_EDGE (e, ei, b->succs)
414 gcc_assert (EDGE_COUNT (unswitch_on->succs) == 2);
H A Dtree-ssa-tail-merge.c242 cached in succs, and the successor edge flags are cached in succ_flags.
253 bitmap succs; member in struct:same_succ_def
415 bitmap_print (file, e->succs, "succs:", "\n");
475 inchash::hash hstate (bitmap_hash (e->succs));
526 EXECUTE_IF_SET_IN_BITMAP (e->succs, 0, s, bs)
586 if (!bitmap_equal_p (e1->succs, e2->succs))
634 same->succs = BITMAP_ALLOC (NULL);
648 BITMAP_FREE (e->succs);
[all...]
H A Dbasic-block.h123 vec<edge, va_gc> *succs; variable
322 #define EDGE_CRITICAL_P(e) (EDGE_COUNT ((e)->src->succs) >= 2 \
328 #define EDGE_SUCC(bb,i) (*(bb)->succs)[(i)]
335 return EDGE_COUNT (bb->succs) == 1;
498 FOR (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
632 FOR_EACH_EDGE (e, ei, bb->succs)
H A Dcfgbuild.c265 FOR_EACH_EDGE (e, ei, bb->succs)
451 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
566 if (EDGE_COUNT (b->succs) == 2)
601 FOR_EACH_EDGE (e, ei, b->succs)
612 FOR_EACH_EDGE (e, ei, b->succs)
H A Dmcf.c546 FOR_EACH_EDGE (e, ei, bb->succs)
1181 FOR_EACH_EDGE (e, ei, bb->succs)
1254 sum_edge_counts (ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs);
1263 FOR_EACH_EDGE (e, ei, bb->succs)
1269 FOR_EACH_EDGE (e, ei, bb->succs)
1274 FOR_EACH_EDGE (e, ei, bb->succs)
1284 total += EDGE_COUNT (bb->succs);
1285 FOR_EACH_EDGE (e, ei, bb->succs)
1298 || (bb->count != sum_edge_counts (bb->succs)))
1309 sum_edge_counts (bb->succs));
[all...]
H A Dhw-doloop.c129 FOR_EACH_EDGE (e, ei, bb->succs)
274 if (EDGE_COUNT (tail_bb->succs) != 2)
313 FOR_EACH_EDGE (e, ei, bb->succs)
543 FOR_EACH_EDGE (e, ei, loop->head->succs)
H A Dsched-ebb.c179 e = find_fallthru_edge (last_bb->succs);
284 FOR_EACH_EDGE (e, ei, b->succs)
582 && EDGE_COUNT (last_bb->succs) == 0);
669 e = find_fallthru_edge (bb->succs);
H A Dcfgloop.c71 fprintf (file, ";; %d succs { ", bb->index);
72 FOR_EACH_EDGE (succ, ei, bb->succs)
954 FOR_EACH_EDGE (e, ei, bb->succs)
1093 FOR_EACH_EDGE (e, ei, bb->succs)
1166 FOR_EACH_EDGE (e, ei, body[i]->succs)
1190 if (EDGE_COUNT (body[i]->succs) >= 2)
1212 FOR_EACH_EDGE (e, ei, bb->succs)
1238 FOR_EACH_EDGE (e, ei, bb->succs)
1495 FOR_EACH_EDGE (e, ei, bb->succs)
1520 FOR_EACH_EDGE (e, ei, bb->succs)
[all...]
H A Dcfgcleanup.c150 if (EDGE_COUNT (cbranch_block->succs) != 2)
314 if (EDGE_COUNT (e->src->succs) != 2)
316 if (EDGE_COUNT (b->succs) != 2)
460 for (ei = ei_start (b->succs); (e = ei_safe_edge (ei)); )
856 tmp_edge = find_fallthru_edge (c->succs);
1477 FOR_EACH_EDGE (e, ei, bb1->succs)
1480 FOR_EACH_EDGE (e, ei, bb2->succs)
1602 if (EDGE_COUNT (bb1->succs) == 2
1611 if (EDGE_COUNT (bb2->succs) != 2
1803 if (EDGE_COUNT (bb1->succs) !
[all...]
H A Dgraphite.c125 if (EDGE_COUNT (bb->succs) > 1)
177 if (EDGE_COUNT (bb->succs) > 1)
H A Dgimple-ssa-isolate-paths.c184 for (ei = ei_start (duplicate->succs); (e2 = ei_safe_edge (ei)); )
417 for (edge_iterator ei = ei_start (bb->succs);
H A Dcfgrtl.c548 edge_iterator ei = ei_start (ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs);
669 FOR_EACH_EDGE (e, ei, src->succs)
692 FOR_EACH_EDGE (e, ei, src->succs)
786 new_bb->succs = bb->succs;
787 bb->succs = NULL;
788 FOR_EACH_EDGE (e, ei, new_bb->succs)
1055 if (EDGE_COUNT (src->succs) >= 3
1058 || (EDGE_COUNT (src->succs) == 2
1390 FOR_EACH_EDGE (e2, ei, e->src->succs)
[all...]
H A Dsel-sched-dump.c545 dump_insn_vector (rtx_vec_t succs)
550 FOR_EACH_VEC_ELT (succs, i, succ)
899 FOR_EACH_EDGE (e, ei, bb->succs)
1031 debug_insn_vector (rtx_vec_t succs)
1034 dump_insn_vector (succs);
542 dump_insn_vector(rtx_vec_t succs) argument
1026 debug_insn_vector(rtx_vec_t succs) argument
H A Dcfgloopmanip.c111 FOR_EACH_EDGE (e, ei, bb->succs)
266 FOR_EACH_EDGE (e, ei, from->succs)
372 FOR_EACH_EDGE (ae, ei, e->src->succs)
384 FOR_EACH_EDGE (ae, ei, rem_bbs[i]->succs)
500 FOR_EACH_EDGE (e, ei, bbs[i]->succs)
556 FOR_EACH_EDGE (other_e, ei, e->src->succs)
928 FOR_EACH_EDGE (e, ei, switch_bb->succs)
1124 unsigned n = EDGE_COUNT (bb->succs);
1132 FOR_EACH_EDGE (ae, ei, bb->succs)
1362 FOR_EACH_EDGE (ae, ei, new_bb->succs)
[all...]
H A Dtree-ssa-threadupdate.c310 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
335 FOR_EACH_EDGE (e, ei, rd->dup_blocks[count]->succs)
525 FOR_EACH_EDGE (e, ei, orig_bb->succs)
905 FOR_EACH_EDGE (esucc, ei, bb->succs)
949 FOR_EACH_EDGE (enonpath, ei, epath->src->succs)
964 FOR_EACH_EDGE (enonpath, ei, epath->src->succs)
1023 FOR_EACH_EDGE (esucc, ei, epath->src->succs)
1068 FOR_EACH_EDGE (esucc, ei, epath->src->succs)
1096 FOR_EACH_EDGE (esucc, ei, epath->src->succs)
1106 FOR_EACH_EDGE (esucc, ei, dup->succs)
[all...]
H A Dsched-rgn.c463 FOR_EACH_EDGE (e, ei, bb->succs)
520 e = find_fallthru_edge (bb->succs);
686 current_edge = ei_start (single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun))->succs);
761 current_edge = ei_start (ei_edge (current_edge)->dest->succs);
769 FOR_EACH_EDGE (e, ei, bb->succs)
880 FOR_EACH_EDGE (e, ei, bb->succs)
1031 child)->succs)
1051 FOR_EACH_EDGE (e, ei, bb->succs)
1330 FOR_EACH_EDGE (e, ei, BASIC_BLOCK_FOR_FN (cfun, bbn)->succs)
1388 BASIC_BLOCK_FOR_FN (cfun, succn)->succs)
[all...]

Completed in 490 milliseconds

12345