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

123

/freebsd-9.3-release/contrib/gcc/
H A Dcfganal.c117 FOR_EACH_EDGE (e, ei, src->succs)
141 FOR_EACH_EDGE (e, ei, src->succs)
186 stack[sp++] = ei_start (ENTRY_BLOCK_PTR->succs);
207 if (EDGE_COUNT (dest->succs) > 0)
211 stack[sp++] = ei_start (dest->succs);
253 FOR_EACH_EDGE (e, ei, bb->succs)
264 if (EDGE_COUNT (bb->succs) != 2)
298 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
312 FOR_EACH_EDGE (e, ei, b->succs)
359 num_edges += EDGE_COUNT (bb->succs);
[all...]
H A Dcfg.c119 FOR_EACH_EDGE (e, ei, bb->succs)
121 VEC_truncate (edge, bb->succs, 0);
125 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
128 VEC_truncate (edge, ENTRY_BLOCK_PTR->succs, 0);
211 VEC_safe_push (edge, gc, e->src->succs, e);
233 for (ei = ei_start (src->succs); (tmp = ei_safe_edge (ei)); )
237 VEC_unordered_remove (edge, src->succs, ei.index);
446 FOR_EACH_EDGE (e, ei, bb->succs)
448 if (EDGE_COUNT (bb->succs) && abs (sum - REG_BR_PROB_BASE) > 100)
452 FOR_EACH_EDGE (e, ei, bb->succs)
[all...]
H A Dprofile.c145 FOR_EACH_EDGE (e, ei, bb->succs)
243 FOR_EACH_EDGE (e, ei, bb->succs)
302 FOR_EACH_EDGE (e, ei, bb->succs)
325 FOR_EACH_EDGE (e, ei, bb->succs)
391 FOR_EACH_EDGE (e, ei, bb->succs)
420 FOR_EACH_EDGE (e, ei, bb->succs)
424 FOR_EACH_EDGE (e, ei, bb->succs)
502 FOR_EACH_EDGE (e, ei, bb->succs)
527 FOR_EACH_EDGE (e, ei, bb->succs)
531 && EDGE_COUNT (bb->succs) >
[all...]
H A Dcfghooks.c123 FOR_EACH_EDGE (e, ei, bb->succs)
204 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
269 FOR_EACH_EDGE (e, ei, bb->succs)
381 while (EDGE_COUNT (bb->succs) != 0)
537 while (EDGE_COUNT (a->succs) != 0)
541 FOR_EACH_EDGE (e, ei, b->succs)
543 a->succs = b->succs;
547 b->preds = b->succs = NULL;
722 FOR_EACH_EDGE (s, ei, bb->succs)
[all...]
H A Dbb-reorder.c243 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
313 FOR_EACH_EDGE (e, ei, bb->succs)
498 FOR_EACH_EDGE (e, ei, bb->succs)
555 FOR_EACH_EDGE (e, ei, bb->succs)
686 FOR_EACH_EDGE (e, ei, bb->succs)
721 FOR_EACH_EDGE (e, ei, bb->succs)
1007 FOR_EACH_EDGE (e, ei, traces[t].last->succs)
1046 FOR_EACH_EDGE (e, ei, traces[t].last->succs)
1068 FOR_EACH_EDGE (e2, ei, e->dest->succs)
1173 if (EDGE_COUNT (bb->succs) >
[all...]
H A Dpredict.c274 if ((e->src != ENTRY_BLOCK_PTR && EDGE_COUNT (e->src->succs) > 1)
313 && EDGE_COUNT (BLOCK_FOR_INSN (insn)->succs) >= 2);
358 FOR_EACH_EDGE (e, ei, bb->succs)
390 FOR_EACH_EDGE (e, ei, bb->succs)
393 FOR_EACH_EDGE (e, ei, bb->succs)
533 FOR_EACH_EDGE (e, ei, bb->succs)
768 FOR_EACH_EDGE (e, ei, bb->succs)
1044 FOR_EACH_EDGE (then_edge, ei, bb->succs)
1316 FOR_EACH_EDGE (e, ei, bb->succs)
1519 FOR_EACH_EDGE (e, ei, BASIC_BLOCK (y)->succs)
[all...]
H A Dlcm.c223 later(ENTRY, succs(ENTRY)) are defined using laterin(ENTRY)
224 laterin(succs(ENTRY)) is defined by later(ENTRY, succs(ENTRY)).
228 succs(bb) to the worklist if they are not already on the worklist.
286 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
320 FOR_EACH_EDGE (e, ei, bb->succs)
508 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
541 FOR_EACH_EDGE (e, ei, bb->succs)
652 FOR_EACH_EDGE (e, ei, bb->succs)
675 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
[all...]
H A Dcfgloop.c67 fprintf (file, ";; %d succs { ", bb->index);
68 FOR_EACH_EDGE (succ, ei, bb->succs)
293 FOR_EACH_EDGE (e, ei, bb->succs)
897 FOR_EACH_EDGE (e, ei, bb->succs)
932 FOR_EACH_EDGE (e, ei, body[i]->succs)
939 FOR_EACH_EDGE (e, ei, body[i]->succs)
960 if (EDGE_COUNT (body[i]->succs) >= 2)
1160 FOR_EACH_EDGE (e, ei, bb->succs)
1185 FOR_EACH_EDGE (e, ei, bb->succs)
1216 FOR_EACH_EDGE (e, ei, bb->succs)
[all...]
H A Dsched-ebb.c142 FOR_EACH_EDGE (e, ei, last_bb->succs)
243 FOR_EACH_EDGE (e, ei, b->succs)
533 && EDGE_COUNT (last_bb->succs) == 0);
592 FOR_EACH_EDGE (e, ei, bb->succs)
H A Dcfgrtl.c455 edge_iterator ei = ei_start (ENTRY_BLOCK_PTR->succs);
513 new_bb->succs = bb->succs;
514 bb->succs = NULL;
515 FOR_EACH_EDGE (e, ei, new_bb->succs)
721 if (EDGE_COUNT (src->succs) >= 3
724 || (EDGE_COUNT (src->succs) == 2
1066 for (ei = ei_start (ENTRY_BLOCK_PTR->succs); (tmp = ei_safe_edge (ei)); )
1070 VEC_unordered_remove (edge, ENTRY_BLOCK_PTR->succs, ei.index);
1080 VEC_safe_push (edge, gc, bb->succs,
[all...]
H A Dcfgcleanup.c115 if (EDGE_COUNT (cbranch_block->succs) != 2)
280 if (EDGE_COUNT (e->src->succs) != 2)
282 if (EDGE_COUNT (b->succs) != 2)
431 for (ei = ei_start (b->succs); (e = ei_safe_edge (ei)); )
807 FOR_EACH_EDGE (tmp_edge, ei, c->succs)
1324 if (EDGE_COUNT (bb1->succs) == 2
1333 if (EDGE_COUNT (bb2->succs) != 2
1517 if (EDGE_COUNT (bb1->succs) != EDGE_COUNT (bb2->succs))
1520 FOR_EACH_EDGE (e1, ei, bb1->succs)
[all...]
H A Dtree-ssa-structalias.c445 bitmap *succs; member in struct:constraint_graph
832 if (graph->succs[node])
833 BITMAP_FREE (graph->succs[node]);
865 if (graph->succs[from])
867 if (!graph->succs[to])
868 graph->succs[to] = BITMAP_ALLOC (&pta_obstack);
869 bitmap_ior_into (graph->succs[to],
870 graph->succs[from]);
927 if (!graph->succs[from])
928 graph->succs[fro
[all...]
H A Dcfgloopanal.c285 FOR_EACH_EDGE (e, ei, act->succs)
293 FOR_EACH_EDGE (e, ei, act->succs)
585 FOR_EACH_EDGE (e, ei, bb->succs)
H A Dtree-cfgcleanup.c114 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
211 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
242 else if (noreturn_call_p (stmt) && remove_fallthru_edge (bb->succs))
H A Dtree-ssa-threadupdate.c191 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
407 FOR_EACH_EDGE (e, ei, bb->succs)
744 redirection_data = htab_create (EDGE_COUNT (bb->succs),
H A Dtree-cfg.c1409 if (EDGE_COUNT (bb->succs) != 2)
1990 while (EDGE_COUNT (bb->succs) > 0)
2354 num_edges += EDGE_COUNT (bb->succs);
2402 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
2447 FOR_EACH_EDGE (e, ei, bb->succs)
2664 FOR_EACH_EDGE (e, ei, bb->succs)
3081 FOR_EACH_EDGE (e, ei, bb->succs)
3783 FOR_EACH_EDGE (e, ei, bb->succs)
3796 FOR_EACH_EDGE (e, ei, bb->succs)
3825 || EDGE_COUNT (bb->succs) >
[all...]
H A Dcfgbuild.c287 FOR_EACH_EDGE (e, ei, bb->succs)
622 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
718 if (EDGE_COUNT (b->succs) == 2)
746 FOR_EACH_EDGE (e, ei, b->succs)
H A Dtree-ssa-loop-ch.c62 gcc_assert (EDGE_COUNT (header->succs) > 0);
H A Dtree-ssa-loop-unswitch.c287 gcc_assert (EDGE_COUNT (unswitch_on->succs) == 2);
H A Dtree-ssa-propagate.c324 FOR_EACH_EDGE (e, ei, bb->succs)
441 FOR_EACH_EDGE (e, ei, block->succs)
498 FOR_EACH_EDGE (e, ei, bb->succs)
504 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
H A Dcfgloopmanip.c106 FOR_EACH_EDGE (e, ei, bb->succs)
194 FOR_EACH_EDGE (e, ei, from->succs)
296 FOR_EACH_EDGE (ae, ei, rem_bbs[i]->succs)
465 FOR_EACH_EDGE (e, ei, switch_bb->succs)
574 FOR_EACH_EDGE (e, ei, body[i]->succs)
706 gcc_assert (EDGE_COUNT (src->succs) > 1);
709 if (EDGE_COUNT (src->succs) > 2)
972 FOR_EACH_EDGE (ae, ei, new_bb->succs)
H A Dtracer.c124 FOR_EACH_EDGE (e, ei, bb->succs)
335 FOR_EACH_EDGE (e, ei, end->succs)
H A Dipa-cp.c453 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (func)->succs)
454 FOR_EACH_EDGE (e_step, ei, ENTRY_BLOCK_PTR_FOR_FUNCTION (func)->succs)
748 if (bb->succs)
749 FOR_EACH_EDGE (e, ei, bb->succs)
766 FOR_EACH_EDGE (e, ei, bb->succs)
965 FOR_EACH_EDGE (e, ei, bb->succs)
H A Dsched-rgn.c562 current_edge = ei_start (single_succ (ENTRY_BLOCK_PTR)->succs);
637 current_edge = ei_start (ei_edge (current_edge)->dest->succs);
645 FOR_EACH_EDGE (e, ei, bb->succs)
754 FOR_EACH_EDGE (e, ei, bb->succs)
903 FOR_EACH_EDGE (e, ei, BASIC_BLOCK (child)->succs)
923 FOR_EACH_EDGE (e, ei, bb->succs)
1188 FOR_EACH_EDGE (e, ei, BASIC_BLOCK (bbn)->succs)
1245 FOR_EACH_EDGE (e, ei, BASIC_BLOCK (succn)->succs)
1322 FOR_EACH_EDGE (out_edge, out_ei, in_edge->src->succs)
1419 FOR_EACH_EDGE (e, ei, block->succs)
[all...]
H A Dcfglayout.c662 if (EDGE_COUNT (bb->succs) == 0)
669 FOR_EACH_EDGE (e, ei, bb->succs)
834 FOR_EACH_EDGE (e, ei, bb->succs)
1186 FOR_EACH_EDGE (e, ei, bbs[i]->succs)
1276 FOR_EACH_EDGE (e, ei, new_bb->succs)

Completed in 190 milliseconds

123