dist/gcc/bb-reorder.c

177 static bbro_basic_block_data *bbd;
219   return bbd[bb->index].visited;
227   bbd[bb->index].visited = trace;
228   if (bbd[bb->index].heap)
230       bbd[bb->index].heap->delete_node (bbd[bb->index].node);
231       bbd[bb->index].heap = NULL;
232       bbd[bb->index].node = NULL;
286       bbd[e->dest->index].heap = heap;
287       bbd[e->dest->index].node = heap->insert (bb_to_key (e->dest), e->dest);
364 		  || bbd[e->dest->index].start_of_trace >= 0)
378 		  || bbd[e->dest->index].start_of_trace >= 0)
468       bbd[bb->index].heap = NULL;
469       bbd[bb->index].node = NULL;
484 	  bbd[bb->index].heap = new_heap;
485 	  bbd[bb->index].node = new_heap->insert (key, bb);
498       bbd[bb->index].in_trace = *n_traces;
627 	      if (bbd[e->dest->index].heap)
630 		  if (key != bbd[e->dest->index].node->get_key ())
637 				   (long) bbd[e->dest->index].node->get_key (),
640 		      bbd[e->dest->index].heap->replace_key
641 		        (bbd[e->dest->index].node, key);
667 		  bbd[e->dest->index].heap = which_heap;
668 		  bbd[e->dest->index].node = which_heap->insert (key, e->dest);
705 			      bbd[best_edge->dest->index].in_trace =
776 		  bbd[best_edge->dest->index].in_trace = (*n_traces) - 1;
783       bbd[trace->first->index].start_of_trace = *n_traces - 1;
784       if (bbd[trace->last->index].end_of_trace != *n_traces - 1)
786 	  bbd[trace->last->index].end_of_trace = *n_traces - 1;
790 	    if (EDGE_FREQUENCY (e) > bbd[e->dest->index].priority)
791 	      bbd[e->dest->index].priority = EDGE_FREQUENCY (e);
803 	  if (bbd[e->dest->index].heap)
806 	      if (key != bbd[e->dest->index].node->get_key ())
813 			       (long) bbd[e->dest->index].node->get_key (), key);
815 		  bbd[e->dest->index].heap->replace_key
816 		    (bbd[e->dest->index].node, key);
855       bbd = XRESIZEVEC (bbro_basic_block_data, bbd, new_size);
858 	  bbd[i].start_of_trace = -1;
859 	  bbd[i].end_of_trace = -1;
860 	  bbd[i].in_trace = -1;
861 	  bbd[i].visited = 0;
862 	  bbd[i].priority = -1;
863 	  bbd[i].heap = NULL;
864 	  bbd[i].node = NULL;
881   bbd[new_bb->index].in_trace = trace;
906   int priority = bbd[bb->index].priority;
913 	       && bbd[e->src->index].end_of_trace >= 0)
922       bbd[bb->index].priority = priority;
1042       else if (traces[bbd[e_index].end_of_trace].length > best_len)
1059       else if (traces[bbd[e_index].start_of_trace].length > best_len)
1139 		  && bbd[si].end_of_trace >= 0
1140 		  && !connected[bbd[si].end_of_trace]
1145 		  best_len = traces[bbd[si].end_of_trace].length;
1151 	      t2 = bbd[best->src->index].end_of_trace;
1182 		  && bbd[di].start_of_trace >= 0
1183 		  && !connected[bbd[di].start_of_trace]
1188 		  best_len = traces[bbd[di].start_of_trace].length;
1218 	      if (last_trace != bbd[best->dest->index].start_of_trace - 1)
1225 	      t = bbd[best->dest->index].start_of_trace;
1237 	      t = bbd[best->dest->index].start_of_trace;
1262 		    if (bbd[e->dest->index].start_of_trace >= 0
1263 			&& traces[bbd[e->dest->index].start_of_trace].length
1278 				&& bbd[di].start_of_trace >= 0
1279 				&& !connected[bbd[di].start_of_trace]
1285 					&& traces[bbd[di].start_of_trace].length
1291 			      best2_len = traces[bbd[di].start_of_trace].length;
1327 		      t = bbd[next_bb->index].start_of_trace;
2360   bbd = XNEWVEC (bbro_basic_block_data, array_size);
2363       bbd[i].start_of_trace = -1;
2364       bbd[i].end_of_trace = -1;
2365       bbd[i].in_trace = -1;
2366       bbd[i].visited = 0;
2367       bbd[i].priority = -1;
2368       bbd[i].heap = NULL;
2369       bbd[i].node = NULL;
2377   FREE (bbd);