12 int add_range(struct range *range, int az, int nr_range, u64 start, u64 end)  in add_range()  argument
14 	if (start >= end)  in add_range()
21 	range[nr_range].start = start;  in add_range()
30 		     u64 start, u64 end)  in add_range_with_merge()  argument
34 	if (start >= end)  in add_range_with_merge()
44 		common_start = max(range[i].start, start);  in add_range_with_merge()
50 		start = min(range[i].start, start);  in add_range_with_merge()
55 		range[nr_range - 1].start = 0;  in add_range_with_merge()
62 	return add_range(range, az, nr_range, start, end);  in add_range_with_merge()
65 void subtract_range(struct range *range, int az, u64 start, u64 end)  in subtract_range()  argument
69 	if (start >= 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()
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()
103 				range[i].start = end;  in subtract_range()
108 			range[j].end = start;  in subtract_range()
119 	if (r1->start < r2->start)  in cmp_range()
121 	if (r1->start > r2->start)  in cmp_range()
141 		range[i].start = range[k].start;  in clean_sort_range()
143 		range[k].start = 0;  in clean_sort_range()