1 // SPDX-License-Identifier: GPL-2.0
54 			(nr_range - (i + 1)) * sizeof(range[i]));  in add_range_with_merge()
55 		range[nr_range - 1].start = 0;  in add_range_with_merge()
56 		range[nr_range - 1].end   = 0;  in add_range_with_merge()
57 		nr_range--;  in add_range_with_merge()
58 		i--;  in add_range_with_merge()
61 	/* Need to add it: */  in add_range_with_merge()
67 	int i, j;  in subtract_range()  local
72 	for (j = 0; j < az; j++) {  in subtract_range()
73 		if (!range[j].end)  in subtract_range()
76 		if (start <= range[j].start && end >= range[j].end) {  in subtract_range()
77 			range[j].start = 0;  in subtract_range()
78 			range[j].end = 0;  in subtract_range()
82 		if (start <= range[j].start && end < range[j].end &&  in subtract_range()
83 		    range[j].start < end) {  in subtract_range()
84 			range[j].start = end;  in subtract_range()
89 		if (start > range[j].start && end >= range[j].end &&  in subtract_range()
90 		    range[j].end > start) {  in subtract_range()
91 			range[j].end = start;  in subtract_range()
95 		if (start > range[j].start && end < range[j].end) {  in subtract_range()
102 				range[i].end = range[j].end;  in subtract_range()
108 			range[j].end = start;  in subtract_range()
119 	if (r1->start < r2->start)  in cmp_range()
120 		return -1;  in cmp_range()
121 	if (r1->start > r2->start)  in cmp_range()
128 	int i, j, k = az - 1, nr_range = az;  in clean_sort_range()  local
130 	for (i = 0; i < k; i++) {  in clean_sort_range()
133 		for (j = k; j > i; j--) {  in clean_sort_range()
134 			if (range[j].end) {  in clean_sort_range()
135 				k = j;  in clean_sort_range()
139 		if (j == i)  in clean_sort_range()
141 		range[i].start = range[k].start;  in clean_sort_range()
142 		range[i].end   = range[k].end;  in clean_sort_range()
143 		range[k].start = 0;  in clean_sort_range()
144 		range[k].end   = 0;  in clean_sort_range()
145 		k--;  in clean_sort_range()