linux-master/kernel/range.c

10 #include <linux/range.h>
12 int add_range(struct range *range, int az, int nr_range, u64 start, u64 end)
21 	range[nr_range].start = start;
22 	range[nr_range].end = end;
29 int add_range_with_merge(struct range *range, int az, int nr_range,
41 		if (!range[i].end)
44 		common_start = max(range[i].start, start);
45 		common_end = min(range[i].end, end);
50 		start = min(range[i].start, start);
51 		end = max(range[i].end, end);
53 		memmove(&range[i], &range[i + 1],
54 			(nr_range - (i + 1)) * sizeof(range[i]));
55 		range[nr_range - 1].start = 0;
56 		range[nr_range - 1].end   = 0;
62 	return add_range(range, az, nr_range, start, end);
65 void subtract_range(struct range *range, int az, u64 start, u64 end)
73 		if (!range[j].end)
76 		if (start <= range[j].start && end >= range[j].end) {
77 			range[j].start = 0;
78 			range[j].end = 0;
82 		if (start <= range[j].start && end < range[j].end &&
83 		    range[j].start < end) {
84 			range[j].start = end;
89 		if (start > range[j].start && end >= range[j].end &&
90 		    range[j].end > start) {
91 			range[j].end = start;
95 		if (start > range[j].start && end < range[j].end) {
98 				if (range[i].end == 0)
102 				range[i].end = range[j].end;
103 				range[i].start = end;
108 			range[j].end = start;
116 	const struct range *r1 = x1;
117 	const struct range *r2 = x2;
126 int clean_sort_range(struct range *range, int az)
131 		if (range[i].end)
134 			if (range[j].end) {
141 		range[i].start = range[k].start;
142 		range[i].end   = range[k].end;
143 		range[k].start = 0;
144 		range[k].end   = 0;
149 		if (!range[i].end) {
156 	sort(range, nr_range, sizeof(struct range), cmp_range, NULL);
161 void sort_range(struct range *range, int nr_range)
164 	sort(range, nr_range, sizeof(struct range), cmp_range, NULL);