10 int add_range(struct range *range, int az, int nr_range, u64 start, u64 end)  in add_range()  argument
12 	if (start >= end)  in add_range()
20 	range[nr_range].end = end;  in add_range()
28 		     u64 start, u64 end)  in add_range_with_merge()  argument
32 	if (start >= end)  in add_range_with_merge()
39 		if (!range[i].end)  in add_range_with_merge()
43 		common_end = min(range[i].end, end);  in add_range_with_merge()
49 		end = max(range[i].end, end);  in add_range_with_merge()
54 		range[nr_range - 1].end   = 0;  in add_range_with_merge()
60 	return add_range(range, az, nr_range, start, end);  in add_range_with_merge()
63 void subtract_range(struct range *range, int az, u64 start, u64 end)  in subtract_range()  argument
67 	if (start >= end)  in subtract_range()
71 		if (!range[j].end)  in subtract_range()
74 		if (start <= range[j].start && end >= range[j].end) {  in subtract_range()
76 			range[j].end = 0;  in subtract_range()
80 		if (start <= range[j].start && end < range[j].end &&  in subtract_range()
81 		    range[j].start < end) {  in subtract_range()
82 			range[j].start = end;  in subtract_range()
87 		if (start > range[j].start && end >= range[j].end &&  in subtract_range()
88 		    range[j].end > start) {  in subtract_range()
89 			range[j].end = start;  in subtract_range()
93 		if (start > range[j].start && end < range[j].end) {  in subtract_range()
96 				if (range[i].end == 0)  in subtract_range()
100 				range[i].end = range[j].end;  in subtract_range()
101 				range[i].start = end;  in subtract_range()
106 			range[j].end = start;  in subtract_range()
129 		if (range[i].end)  in clean_sort_range()
132 			if (range[j].end) {  in clean_sort_range()
140 		range[i].end   = range[k].end;  in clean_sort_range()
142 		range[k].end   = 0;  in clean_sort_range()
147 		if (!range[i].end) {  in clean_sort_range()