Home | History | Annotate | Download | only in program

Lines Matching defs:interval

807 /** A live register interval */
808 struct interval
819    struct interval Intervals[REG_ALLOCATE_MAX_PROGRAM_TEMPS];
824 append_interval(struct interval_list *list, const struct interval *inv)
830 /** Insert interval inv into list, sorted by interval end */
832 insert_interval_by_end(struct interval_list *list, const struct interval *inv)
854 /** Remove the given interval from the interval list */
856 remove_interval(struct interval_list *list, const struct interval *inv)
880    const struct interval *ia = (const struct interval *) a;
881    const struct interval *ib = (const struct interval *) b;
891 /** sort the interval list according to interval starts */
895    qsort(list->Intervals, list->Num, sizeof(struct interval), compare_start);
912  * Update the intermediate interval info for register 'index' and
936     * interval begin at the start of the outermost loop.
1013  * For register R, the interval [A,B] indicates that R is referenced
1046          struct interval inv;
1054    /* Sort the list according to interval starts */
1058       /* print interval info */
1060          const struct interval *inv = liveIntervals->Intervals + i;
1097  * We compute the "live interval" for all temporary registers then
1111       printf("Optimize: Begin live-interval register reallocation\n");
1132          const struct interval *live = liveIntervals.Intervals + i;
1138           * to the live interval can have their remapped registers freed.
1143                const struct interval *inv = activeIntervals.Intervals + j;
1151                   /* Interval 'inv' has expired */
1156                      printf("  expire interval for reg %u\n", inv->Reg);
1158                   /* remove interval j from active list */
1171          /* find a free register for this live interval */
1184          /* Insert this live interval into the active list which is sorted
1202       printf("Optimize: End live-interval register reallocation\n");