range.c 3.01 KB
Newer Older
1
// SPDX-License-Identifier: GPL-2.0
2 3 4
/*
 * Range add and subtract
 */
5
#include <linux/kernel.h>
6 7
#include <linux/init.h>
#include <linux/sort.h>
8
#include <linux/string.h>
9 10 11 12
#include <linux/range.h>

int add_range(struct range *range, int az, int nr_range, u64 start, u64 end)
{
13
	if (start >= end)
14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
		return nr_range;

	/* Out of slots: */
	if (nr_range >= az)
		return nr_range;

	range[nr_range].start = start;
	range[nr_range].end = end;

	nr_range++;

	return nr_range;
}

int add_range_with_merge(struct range *range, int az, int nr_range,
		     u64 start, u64 end)
{
	int i;

33
	if (start >= end)
34 35
		return nr_range;

36
	/* get new start/end: */
37 38 39 40 41 42 43 44
	for (i = 0; i < nr_range; i++) {
		u64 common_start, common_end;

		if (!range[i].end)
			continue;

		common_start = max(range[i].start, start);
		common_end = min(range[i].end, end);
45
		if (common_start > common_end)
46 47
			continue;

48 49 50
		/* new start/end, will add it back at last */
		start = min(range[i].start, start);
		end = max(range[i].end, end);
51

52 53 54 55 56 57
		memmove(&range[i], &range[i + 1],
			(nr_range - (i + 1)) * sizeof(range[i]));
		range[nr_range - 1].start = 0;
		range[nr_range - 1].end   = 0;
		nr_range--;
		i--;
58 59 60 61 62 63 64 65 66 67
	}

	/* Need to add it: */
	return add_range(range, az, nr_range, start, end);
}

void subtract_range(struct range *range, int az, u64 start, u64 end)
{
	int i, j;

68
	if (start >= end)
69 70 71 72 73 74 75 76 77 78 79 80 81
		return;

	for (j = 0; j < az; j++) {
		if (!range[j].end)
			continue;

		if (start <= range[j].start && end >= range[j].end) {
			range[j].start = 0;
			range[j].end = 0;
			continue;
		}

		if (start <= range[j].start && end < range[j].end &&
82 83
		    range[j].start < end) {
			range[j].start = end;
84 85 86 87 88
			continue;
		}


		if (start > range[j].start && end >= range[j].end &&
89 90
		    range[j].end > start) {
			range[j].end = start;
91 92 93 94 95 96 97 98 99 100 101
			continue;
		}

		if (start > range[j].start && end < range[j].end) {
			/* Find the new spare: */
			for (i = 0; i < az; i++) {
				if (range[i].end == 0)
					break;
			}
			if (i < az) {
				range[i].end = range[j].end;
102
				range[i].start = end;
103
			} else {
104 105
				pr_err("%s: run out of slot in ranges\n",
					__func__);
106
			}
107
			range[j].end = start;
108 109 110 111 112 113 114 115 116 117
			continue;
		}
	}
}

static int cmp_range(const void *x1, const void *x2)
{
	const struct range *r1 = x1;
	const struct range *r2 = x2;

118 119 120 121 122
	if (r1->start < r2->start)
		return -1;
	if (r1->start > r2->start)
		return 1;
	return 0;
123 124 125 126
}

int clean_sort_range(struct range *range, int az)
{
127
	int i, j, k = az - 1, nr_range = az;
128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164

	for (i = 0; i < k; i++) {
		if (range[i].end)
			continue;
		for (j = k; j > i; j--) {
			if (range[j].end) {
				k = j;
				break;
			}
		}
		if (j == i)
			break;
		range[i].start = range[k].start;
		range[i].end   = range[k].end;
		range[k].start = 0;
		range[k].end   = 0;
		k--;
	}
	/* count it */
	for (i = 0; i < az; i++) {
		if (!range[i].end) {
			nr_range = i;
			break;
		}
	}

	/* sort them */
	sort(range, nr_range, sizeof(struct range), cmp_range, NULL);

	return nr_range;
}

void sort_range(struct range *range, int nr_range)
{
	/* sort them */
	sort(range, nr_range, sizeof(struct range), cmp_range, NULL);
}