Lines Matching refs:dest
77 E->dest must have exactly one predecessor for this to work (it is
84 gcc_assert (EDGE_COUNT (e->dest->preds) <= 1);
88 return dfs_enumerate_from (e->dest, 0, rpe_enum_p, *bbs,
89 n_basic_blocks, e->dest);
108 if (e->dest == EXIT_BLOCK_PTR)
111 act = e->dest->loop_father;
112 if (act->header == e->dest)
267 fix -- when e->dest has exactly one predecessor, this corresponds
268 to blocks dominated by e->dest, if not, split the edge. */
269 if (!single_pred_p (e->dest))
274 normally. We may assume that e->dest is not a header of any loop,
278 e->src->loop_father->latch, e->dest))
297 if (ae->dest != EXIT_BLOCK_PTR && !TEST_BIT (seen, ae->dest->index))
299 SET_BIT (seen, ae->dest->index);
300 bord_bbs[n_bord_bbs++] = ae->dest;
415 basic_block succ_bb = latch_edge->dest;
427 loop->header = header_edge->dest;
575 if (!flow_bb_inside_loop_p (loop, e->dest))
577 act = find_common_loop (loop, e->dest->loop_father);
688 loop_redirect_edge (edge e, basic_block dest)
690 if (e->dest == dest)
693 redirect_edge_and_branch_force (e, dest);
716 newdest = snd->dest;
807 gcc_assert (e->dest == loop->header);
814 gcc_assert (!flow_bb_inside_loop_p (loop, orig->dest));
973 if ((ae->dest->flags & BB_DUPLICATED)
975 || ae->dest->loop_father == target))
1025 set_immediate_dominator (CDI_DOMINATORS, e->dest, e->src);
1131 loop->header = fallthru->dest;
1134 split_block, it would now move to fallthru->dest. */
1137 ploop->latch = fallthru->dest;
1213 basic_block src, dest, new_bb;
1217 dest = e->dest;
1219 loop_c = find_common_loop (src->loop_father, dest->loop_father);
1230 if (dest->loop_father->latch == src)
1231 dest->loop_father->latch = new_bb;
1260 gcc_assert (e->dest == second_head);
1314 first_head = entry->dest;
1323 second_head = entry->dest;
1348 nloop->single_exit = find_edge (get_bb_copy (exit->src), exit->dest);