Lines Matching refs:first
22 The construction starts from "seeds". The seed for the first round
24 that one is selected first that has the lowest key in the heap
50 When connecting traces it first checks whether there is an edge from the
51 last block of one trace to the first block of another trace.
54 and BB is a predecessor of the first block of another trace. In this case,
155 basic_block first, last;
281 for (bb = traces[i].first; bb != traces[i].last; bb = bb->aux)
369 if (back_edge->dest == trace->first)
371 trace->first = best_bb->aux;
377 for (prev_bb = trace->first;
472 trace->first = bb;
629 header is not the first block of the function
715 bbd[trace->first->index].start_of_trace = *n_traces - 1;
918 current_partition = BB_PARTITION (traces[0].first);
923 if (BB_PARTITION (traces[0].first)
924 != BB_PARTITION (traces[i].first))
950 && BB_PARTITION (traces[t].first) != current_partition)
961 FOR_EACH_EDGE (e, ei, traces[t2].first->preds)
997 traces[last_trace].last->aux = traces[t2].first;
1035 traces[last_trace].last->aux = traces[t].first;
1128 traces[last_trace].last->aux = traces[t].first;
1146 for (bb = traces[0].first; bb; bb = bb->aux)
1941 /* Determine which partition the first basic block in the function
1942 belongs to, then find the first basic block in the current function