Home | History | Annotate | Download | only in gcc

Lines Matching defs:best_edge

341   edge best_edge = NULL;
370 		      best_edge = e;
383 		  best_edge = e;
388 		  if (!best_edge || e->count () > best_count)
391 		      best_edge = e;
403       /* Rotate the loop so that the BEST_EDGE goes out from the last block of
463       edge best_edge, e;
509 	  best_edge = NULL;
545 		      best_edge = e;
562 				 best_edge))
564 		  best_edge = e;
576 	  if (best_edge
577 	      && EDGE_COUNT (best_edge->dest->preds) >= 2
578 	      && copy_bb_p (best_edge->dest, 0))
583 	      FOR_EACH_EDGE (e, ei, best_edge->dest->preds)
584 		if (e != best_edge && !(e->flags & EDGE_CROSSING))
590 		best_edge = NULL;
612 	  if (best_edge && for_size
613 	      && (EDGE_COUNT (best_edge->dest->succs) > 1
614 		 || EDGE_COUNT (best_edge->dest->preds) > 1))
615 	    best_edge = NULL;
620 	      if (e == best_edge
681 	  if (best_edge) /* Suitable successor was found.  */
683 	      if (bb_visited_trace (best_edge->dest) == *n_traces)
686 		  if (best_edge->dest != bb)
688 		      if (best_edge->count ()
689 			  > best_edge->dest->count.apply_scale (4, 5))
695 			  if (best_edge->dest
702 					   best_edge->dest->index, bb->index);
704 			      bb->aux = best_edge->dest;
705 			      bbd[best_edge->dest->index].in_trace =
707 			      bb = rotate_loop (best_edge, trace, *n_traces);
715 			      && copy_bb_p (best_edge->dest,
717 			      		    (best_edge)))
719 			      bb = copy_bb (best_edge->dest, best_edge, bb,
754 		    if (e != best_edge
764 			&& single_succ (e->dest) == best_edge->dest
766 			    >= best_edge->count () || for_size))
768 			best_edge = e;
771 				   best_edge->dest->index);
775 		  bb->aux = best_edge->dest;
776 		  bbd[best_edge->dest->index].in_trace = (*n_traces) - 1;
777 		  bb = best_edge->dest;
781       while (best_edge);