Lines Matching refs:i
31 int i; in add_range_with_merge() local
37 for (i = 0; i < nr_range; i++) { in add_range_with_merge()
40 if (!range[i].end) in add_range_with_merge()
43 common_start = max(range[i].start, start); in add_range_with_merge()
44 common_end = min(range[i].end, end); in add_range_with_merge()
49 start = min(range[i].start, start); in add_range_with_merge()
50 end = max(range[i].end, end); in add_range_with_merge()
52 memmove(&range[i], &range[i + 1], in add_range_with_merge()
53 (nr_range - (i + 1)) * sizeof(range[i])); in add_range_with_merge()
57 i--; in add_range_with_merge()
66 int i, j; in subtract_range() local
96 for (i = 0; i < az; i++) { in subtract_range()
97 if (range[i].end == 0) in subtract_range()
100 if (i < az) { in subtract_range()
101 range[i].end = range[j].end; in subtract_range()
102 range[i].start = end; in subtract_range()
127 int i, j, k = az - 1, nr_range = az; in clean_sort_range() local
129 for (i = 0; i < k; i++) { in clean_sort_range()
130 if (range[i].end) in clean_sort_range()
132 for (j = k; j > i; j--) { in clean_sort_range()
138 if (j == i) in clean_sort_range()
140 range[i].start = range[k].start; in clean_sort_range()
141 range[i].end = range[k].end; in clean_sort_range()
147 for (i = 0; i < az; i++) { in clean_sort_range()
148 if (!range[i].end) { in clean_sort_range()
149 nr_range = i; in clean_sort_range()