Searched refs:new_edge (Results 1 - 5 of 5) sorted by relevance

/freebsd-9.3-release/contrib/gcc/
H A Dcfgexpand.c1108 edge new_edge; local
1168 new_edge = make_edge (new_bb, dest, 0);
1169 new_edge->probability = REG_BR_PROB_BASE;
1170 new_edge->count = new_bb->count;
H A Dbb-reorder.c1531 edge new_edge;
1666 new_edge = make_edge (new_bb, dest, 0);
1668 new_edge = EDGE_SUCC (new_bb, 0);
1671 new_edge->flags |= EDGE_CROSSING;
1530 edge new_edge; local
H A Dtree-outof-ssa.c2217 edge new_edge; local
2231 new_edge = make_forwarder_block (leader->dest, same_stmt_list_p,
2233 bb = new_edge->dest;
2242 FOR_EACH_EDGE (e, ei, new_edge->src->preds)
H A Dtree-cfg.c3144 reinstall_phi_args (edge new_edge, edge old_edge) argument
3151 for (var = PENDING_STMT (old_edge), phi = phi_nodes (new_edge->dest);
3160 add_phi_arg (phi, arg, new_edge);
3189 edge new_edge, e; local
3201 new_edge = make_edge (new_bb, dest, EDGE_FALLTHRU);
3202 new_edge->probability = REG_BR_PROB_BASE;
3203 new_edge->count = edge_in->count;
3207 reinstall_phi_args (new_edge, e);
H A Dcfgrtl.c1005 edge new_edge;
1126 new_edge = make_edge (e->src, jump_block, EDGE_FALLTHRU);
1127 new_edge->probability = e->probability;
1128 new_edge->count = e->count;
998 edge new_edge; local

Completed in 140 milliseconds