contrib/gcc/tree-cfg.c

823 label_to_block_fn (struct function *ifun, tree dest)
825   int uid = LABEL_DECL_UID (dest);
836       stmt = build1 (LABEL_EXPR, void_type_node, dest);
838       uid = LABEL_DECL_UID (dest);
887       tree dest = GOTO_DESTINATION (goto_t);
888       edge e = make_edge (bb, label_to_block (dest), EDGE_FALLTHRU);
1415     return e1->dest;
1417     return e0->dest;
1765   tree dest = GOTO_DESTINATION (*stmt_p);
1771   if (TREE_CODE (dest) == LABEL_DECL)
2156   basic_block dest;
2159   dest = label_to_block (val);
2160   if (dest)
2162       e = find_edge (bb, dest);
2405 	       e->dest->index);
2449 	  if (e->dest == EXIT_BLOCK_PTR)
2452 	    fprintf (file, "edge: { sourcename: \"%d\" targetname: \"%d\"", bb->index, e->dest->index);
2668       if (!e || e->dest == bb->next_bb)
2671       gcc_assert (e->dest != EXIT_BLOCK_PTR);
2672       label = tree_block_label (e->dest);
2987   basic_block dest, src;
2990   dest = e->dest;
3000   if (single_pred_p (dest)
3001       && ! phi_nodes (dest)
3002       && dest != EXIT_BLOCK_PTR)
3004       *bsi = bsi_start (dest);
3020 	  *bsi = bsi_last (dest);
3060   dest = split_edge (e);
3062     *new_bb = dest;
3063   e = single_pred_edge (dest);
3151   for (var = PENDING_STMT (old_edge), phi = phi_nodes (new_edge->dest);
3174   basic_block dest = edge_in->dest;
3176   if (dest->prev_bb && find_edge (dest->prev_bb, dest))
3179     return dest->prev_bb;
3188   basic_block new_bb, after_bb, dest;
3194   dest = edge_in->dest;
3201   new_edge = make_edge (new_bb, dest, EDGE_FALLTHRU);
3832 	    if (!has_label_p (true_edge->dest,
3840 	    if (!has_label_p (false_edge->dest,
3939 		if (!e->dest->aux)
3942 			   bb->index, e->dest->index);
3945 		e->dest->aux = (void *)2;
3970 	      e->dest->aux = (void *)0;
3996   bb = fallthru->dest;
4075       || EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest != target)
4100 tree_redirect_edge_and_branch (edge e, basic_block dest)
4111       && (ret = tree_try_redirect_by_replacing_jump (e, dest)))
4114   if (e->dest == dest)
4117   label = tree_block_label (dest);
4144 	    edge e2 = find_edge (e->src, dest);
4174 		if (label_to_block (CASE_LABEL (elt)) == e->dest)
4197   e = ssa_redirect_edge (e, dest);
4206 tree_redirect_edge_and_branch_force (edge e, basic_block dest)
4208   e = tree_redirect_edge_and_branch (e, dest);
4358   basic_block bb, dest;
4367       if (!phi_nodes (e_copy->dest))
4370       if (e_copy->dest->flags & BB_DUPLICATED)
4371 	dest = get_bb_original (e_copy->dest);
4373 	dest = e_copy->dest;
4375       e = find_edge (bb, dest);
4379 	     In this case we are not looking for edge to dest, but to
4380 	     duplicated block whose original was dest.  */
4382 	    if ((e->dest->flags & BB_DUPLICATED)
4383 		&& get_bb_original (e->dest) == dest)
4389       for (phi = phi_nodes (e->dest), phi_copy = phi_nodes (e_copy->dest);
4422    edges to the region must go to ENTRY->dest.  The edge ENTRY is redirected
4436   struct loop *loop = entry->dest->loop_father;
4457       if (region[i] != entry->dest
4466   if (loop->header == entry->dest)
4495   if (entry->dest->count)
4497       total_count = entry->dest->count;
4506       total_freq = entry->dest->frequency;
4535       loop->header = exit->dest;
4540   redirected = redirect_edge_and_branch (entry, get_bb_copy (entry->dest));
4548   set_immediate_dominator (CDI_DOMINATORS, entry->dest, entry->src);
4549   doms[n_doms++] = get_bb_original (entry->dest);
4911 	  exit_succ[i++] = e->dest;
5172     fprintf (file, "bb_%d ", e->dest->index);
5510   basic_block bb = e->dest;
5517    the edge vector E->dest->preds.  */
5522   if (phi_nodes (e->dest))