contrib/gcc/tree-cfgcleanup.c

213 	      if (e->dest != target_block)
264   basic_block dest;
306       basic_block dest;
310       dest = EDGE_SUCC (bb, 0)->dest;
312       if (dest->loop_father->header == dest)
322   dest = succ->dest;
327 	  if (!single_pred_p (dest))
355 phi_alternatives_equal (basic_block dest, edge e1, edge e2)
361   for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi))
384   basic_block dest = succ->dest;
394   if (dest == bb)
399   label = first_stmt (dest);
406      dest, problems might occur during removal of the phi node at out
420       if (has_abnormal_incoming_edge_p (dest)
421 	  || phi_nodes (dest) != NULL_TREE)
428   if (phi_nodes (dest))
432 	  s = find_edge (e->src, dest);
436 	  if (!phi_alternatives_equal (dest, succ, s))
448 	  s = redirect_edge_succ_nodup (e, dest);
451 	s = redirect_edge_and_branch (e, dest);
457 	  for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi))
476       bsi_to = bsi_start (dest);
492       domdest = get_immediate_dominator (CDI_DOMINATORS, dest);
502       set_immediate_dominator (CDI_DOMINATORS, dest, dom);
635   basic_block dest = succ->dest;
642   if (dest == bb)
647   label = first_stmt (dest);
659       s = find_edge (e->src, dest);
663 	     E->dest's sole successor edge have the same PHI arguments
665 	  if (phi_alternatives_equal (dest, s, succ))
667 	      e = redirect_edge_and_branch (e, dest);
678       s = redirect_edge_and_branch (e, dest);
685       for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi))
717   domdest = get_immediate_dominator (CDI_DOMINATORS, dest);
727   set_immediate_dominator (CDI_DOMINATORS, dest, dom);
771       basic_block dest;
777       dest = single_succ (bb);
781       if (!phi_nodes (dest)
787       if (!dominated_by_p (CDI_DOMINATORS, dest, bb))
818 		  || bb_for_stmt (use_stmt) != dest