contrib/gcc/bb-reorder.c

297   /* Information about the best end (end after rotation) of the loop.  */
302   /* The best edge is preferred when its destination is not visited yet
321 	      /* The best edge is preferred.  */
483 	  /* The probability and frequency of the best edge.  */
547 	  /* If the best destination has multiple predecessors, and can be
843    best edge (details are in function).  The probability of edge E is PROB. The
844    frequency of the successor is FREQ.  The current best probability is
845    BEST_PROB, the best frequency is BEST_FREQ.
855   /* The BEST_* values do not have to be best, but can be a bit smaller than
861     /* The edge has higher probability than the temporary best edge.  */
864     /* The edge has lower probability than the temporary best edge.  */
867     /* The edge and the temporary best edge  have almost equivalent
931       edge e, best;
959 	  best = NULL;
971 		  && (!best
972 		      || e->probability > best->probability
973 		      || (e->probability == best->probability
976 		  best = e;
980 	  if (best)
982 	      best->src->aux = best->dest;
983 	      t2 = bbd[best->src->index].end_of_trace;
989 			   best->src->index, best->dest->index);
1005 	  best = NULL;
1017 		  && (!best
1018 		      || e->probability > best->probability
1019 		      || (e->probability == best->probability
1022 		  best = e;
1027 	  if (best)
1032 			   best->src->index, best->dest->index);
1034 	      t = bbd[best->dest->index].start_of_trace;
1050 		    && (!best || e->probability > best->probability))
1063 			best = e;
1086 			    best = e;
1104 		  && copy_bb_p (best->dest,
1106 				&& EDGE_FREQUENCY (best) >= freq_threshold
1107 				&& best->count >= count_threshold))
1114 			       traces[t].last->index, best->dest->index);
1123 		  new_bb = copy_bb (best->dest, best, traces[t].last, t);