Lines Matching full:interval
839 /** A live register interval */
840 struct interval
851 struct interval Intervals[REG_ALLOCATE_MAX_PROGRAM_TEMPS];
856 append_interval(struct interval_list *list, const struct interval *inv)
862 /** Insert interval inv into list, sorted by interval end */
864 insert_interval_by_end(struct interval_list *list, const struct interval *inv)
886 /** Remove the given interval from the interval list */
888 remove_interval(struct interval_list *list, const struct interval *inv)
912 const struct interval *ia = (const struct interval *) a;
913 const struct interval *ib = (const struct interval *) b;
923 /** sort the interval list according to interval starts */
927 qsort(list->Intervals, list->Num, sizeof(struct interval), compare_start);
944 * Update the intermediate interval info for register 'index' and
968 * interval begin at the start of the outermost loop.
1045 * For register R, the interval [A,B] indicates that R is referenced
1077 struct interval inv;
1085 /* Sort the list according to interval starts */
1089 /* print interval info */
1091 const struct interval *inv = liveIntervals->Intervals + i;
1128 * We compute the "live interval" for all temporary registers then
1142 printf("Optimize: Begin live-interval register reallocation\n");
1163 const struct interval *live = liveIntervals.Intervals + i;
1169 * to the live interval can have their remapped registers freed.
1174 const struct interval *inv = activeIntervals.Intervals + j;
1182 /* Interval 'inv' has expired */
1187 printf(" expire interval for reg %u\n", inv->Reg);
1189 /* remove interval j from active list */
1202 /* find a free register for this live interval */
1215 /* Insert this live interval into the active list which is sorted
1233 printf("Optimize: End live-interval register reallocation\n");
