11 int add_range(struct range *range, int az, int nr_range, u64 start, u64 end)  in add_range()  argument
13 	if (start >= end)  in add_range()
21 	range[nr_range].end = end;  in add_range()
29 		     u64 start, u64 end)  in add_range_with_merge()  argument
33 	if (start >= end)  in add_range_with_merge()
40 		if (!range[i].end)  in add_range_with_merge()
44 		common_end = min(range[i].end, end);  in add_range_with_merge()
50 		end = max(range[i].end, end);  in add_range_with_merge()
55 		range[nr_range - 1].end   = 0;  in add_range_with_merge()
61 	return add_range(range, az, nr_range, start, end);  in add_range_with_merge()
64 void subtract_range(struct range *range, int az, u64 start, u64 end)  in subtract_range()  argument
68 	if (start >= end)  in subtract_range()
72 		if (!range[j].end)  in subtract_range()
75 		if (start <= range[j].start && end >= range[j].end) {  in subtract_range()
77 			range[j].end = 0;  in subtract_range()
81 		if (start <= range[j].start && end < range[j].end &&  in subtract_range()
82 		    range[j].start < end) {  in subtract_range()
83 			range[j].start = end;  in subtract_range()
88 		if (start > range[j].start && end >= range[j].end &&  in subtract_range()
89 		    range[j].end > start) {  in subtract_range()
90 			range[j].end = start;  in subtract_range()
94 		if (start > range[j].start && end < range[j].end) {  in subtract_range()
97 				if (range[i].end == 0)  in subtract_range()
101 				range[i].end = range[j].end;  in subtract_range()
102 				range[i].start = end;  in subtract_range()
107 			range[j].end = start;  in subtract_range()
130 		if (range[i].end)  in clean_sort_range()
133 			if (range[j].end) {  in clean_sort_range()
141 		range[i].end   = range[k].end;  in clean_sort_range()
143 		range[k].end   = 0;  in clean_sort_range()
148 		if (!range[i].end) {  in clean_sort_range()