824 append_interval(struct interval_list *list, const struct interval *inv)  in append_interval()  argument
826    list->Intervals[list->Num++] = *inv;  in append_interval()
832 insert_interval_by_end(struct interval_list *list, const struct interval *inv)  in insert_interval_by_end()  argument
836    while (i >= 0 && list->Intervals[i].End > inv->End) {  in insert_interval_by_end()
840    list->Intervals[i + 1] = *inv;  in insert_interval_by_end()
856 remove_interval(struct interval_list *list, const struct interval *inv)  in remove_interval()  argument
861       if (list->Intervals[k].Reg == inv->Reg) {  in remove_interval()
863          assert(list->Intervals[k].Start == inv->Start);  in remove_interval()
864          assert(list->Intervals[k].End == inv->End);  in remove_interval()
1046          struct interval inv;  in find_live_intervals()  local
1047          inv.Reg = i;  in find_live_intervals()
1048          inv.Start = intBegin[i];  in find_live_intervals()
1049          inv.End = intEnd[i];  in find_live_intervals()
1050          append_interval(liveIntervals, &inv);  in find_live_intervals()
1060          const struct interval *inv = liveIntervals->Intervals + i;  in find_live_intervals()  local
1062                       inv->Reg, inv->Start, inv->End);  in find_live_intervals()
1065             for (j = 0; j < inv->Start; j++)  in find_live_intervals()
1067             for (j = inv->Start; j <= inv->End; j++)  in find_live_intervals()
1143                const struct interval *inv = activeIntervals.Intervals + j;  in _mesa_reallocate_registers()  local
1144                if (inv->End >= live->Start) {  in _mesa_reallocate_registers()
1152                   const GLint regNew = registerMap[inv->Reg];  in _mesa_reallocate_registers()
1156                      printf("  expire interval for reg %u\n", inv->Reg);  in _mesa_reallocate_registers()
1159                   remove_interval(&activeIntervals, inv);  in _mesa_reallocate_registers()