1
2
3
4
5
6
7
8#include <kunit/test.h>
9
10#include <linux/linear_range.h>
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66#define RANGE1_MIN 10
67#define RANGE1_MIN_SEL 2
68#define RANGE1_STEP 10
69
70
71static const unsigned int range1_sels[] = { RANGE1_MIN_SEL, RANGE1_MIN_SEL + 1,
72 RANGE1_MIN_SEL + 2,
73 RANGE1_MIN_SEL + 3,
74 RANGE1_MIN_SEL + 4 };
75
76static const unsigned int range1_vals[] = { RANGE1_MIN, RANGE1_MIN +
77 RANGE1_STEP,
78 RANGE1_MIN + RANGE1_STEP * 2,
79 RANGE1_MIN + RANGE1_STEP * 3,
80 RANGE1_MIN + RANGE1_STEP * 4 };
81
82#define RANGE2_MIN 100
83#define RANGE2_MIN_SEL 7
84#define RANGE2_STEP 50
85
86
87static const unsigned int range2_sels[] = { RANGE2_MIN_SEL, RANGE2_MIN_SEL + 1,
88 RANGE2_MIN_SEL + 2,
89 RANGE2_MIN_SEL + 3 };
90
91static const unsigned int range2_vals[] = { RANGE2_MIN, RANGE2_MIN +
92 RANGE2_STEP,
93 RANGE2_MIN + RANGE2_STEP * 2,
94 RANGE2_MIN + RANGE2_STEP * 3 };
95
96#define RANGE1_NUM_VALS (ARRAY_SIZE(range1_vals))
97#define RANGE2_NUM_VALS (ARRAY_SIZE(range2_vals))
98#define RANGE_NUM_VALS (RANGE1_NUM_VALS + RANGE2_NUM_VALS)
99
100#define RANGE1_MAX_SEL (RANGE1_MIN_SEL + RANGE1_NUM_VALS - 1)
101#define RANGE1_MAX_VAL (range1_vals[RANGE1_NUM_VALS - 1])
102
103#define RANGE2_MAX_SEL (RANGE2_MIN_SEL + RANGE2_NUM_VALS - 1)
104#define RANGE2_MAX_VAL (range2_vals[RANGE2_NUM_VALS - 1])
105
106#define SMALLEST_SEL RANGE1_MIN_SEL
107#define SMALLEST_VAL RANGE1_MIN
108
109static struct linear_range testr[] = {
110 {
111 .min = RANGE1_MIN,
112 .min_sel = RANGE1_MIN_SEL,
113 .max_sel = RANGE1_MAX_SEL,
114 .step = RANGE1_STEP,
115 }, {
116 .min = RANGE2_MIN,
117 .min_sel = RANGE2_MIN_SEL,
118 .max_sel = RANGE2_MAX_SEL,
119 .step = RANGE2_STEP
120 },
121};
122
123static void range_test_get_value(struct kunit *test)
124{
125 int ret, i;
126 unsigned int sel, val;
127
128 for (i = 0; i < RANGE1_NUM_VALS; i++) {
129 sel = range1_sels[i];
130 ret = linear_range_get_value_array(&testr[0], 2, sel, &val);
131 KUNIT_EXPECT_EQ(test, 0, ret);
132 KUNIT_EXPECT_EQ(test, val, range1_vals[i]);
133 }
134 for (i = 0; i < RANGE2_NUM_VALS; i++) {
135 sel = range2_sels[i];
136 ret = linear_range_get_value_array(&testr[0], 2, sel, &val);
137 KUNIT_EXPECT_EQ(test, 0, ret);
138 KUNIT_EXPECT_EQ(test, val, range2_vals[i]);
139 }
140 ret = linear_range_get_value_array(&testr[0], 2, sel + 1, &val);
141 KUNIT_EXPECT_NE(test, 0, ret);
142}
143
144static void range_test_get_selector_high(struct kunit *test)
145{
146 int ret, i;
147 unsigned int sel;
148 bool found;
149
150 for (i = 0; i < RANGE1_NUM_VALS; i++) {
151 ret = linear_range_get_selector_high(&testr[0], range1_vals[i],
152 &sel, &found);
153 KUNIT_EXPECT_EQ(test, 0, ret);
154 KUNIT_EXPECT_EQ(test, sel, range1_sels[i]);
155 KUNIT_EXPECT_TRUE(test, found);
156 }
157
158 ret = linear_range_get_selector_high(&testr[0], RANGE1_MAX_VAL + 1,
159 &sel, &found);
160 KUNIT_EXPECT_LE(test, ret, 0);
161
162 ret = linear_range_get_selector_high(&testr[0], RANGE1_MIN - 1,
163 &sel, &found);
164 KUNIT_EXPECT_EQ(test, 0, ret);
165 KUNIT_EXPECT_FALSE(test, found);
166 KUNIT_EXPECT_EQ(test, sel, range1_sels[0]);
167}
168
169static void range_test_get_value_amount(struct kunit *test)
170{
171 int ret;
172
173 ret = linear_range_values_in_range_array(&testr[0], 2);
174 KUNIT_EXPECT_EQ(test, (int)RANGE_NUM_VALS, ret);
175}
176
177static void range_test_get_selector_low(struct kunit *test)
178{
179 int i, ret;
180 unsigned int sel;
181 bool found;
182
183 for (i = 0; i < RANGE1_NUM_VALS; i++) {
184 ret = linear_range_get_selector_low_array(&testr[0], 2,
185 range1_vals[i], &sel,
186 &found);
187 KUNIT_EXPECT_EQ(test, 0, ret);
188 KUNIT_EXPECT_EQ(test, sel, range1_sels[i]);
189 KUNIT_EXPECT_TRUE(test, found);
190 }
191 for (i = 0; i < RANGE2_NUM_VALS; i++) {
192 ret = linear_range_get_selector_low_array(&testr[0], 2,
193 range2_vals[i], &sel,
194 &found);
195 KUNIT_EXPECT_EQ(test, 0, ret);
196 KUNIT_EXPECT_EQ(test, sel, range2_sels[i]);
197 KUNIT_EXPECT_TRUE(test, found);
198 }
199
200
201
202
203
204 ret = linear_range_get_selector_low_array(&testr[0], 2,
205 range2_vals[RANGE2_NUM_VALS - 1] + 1,
206 &sel, &found);
207
208 KUNIT_EXPECT_EQ(test, 0, ret);
209 KUNIT_EXPECT_EQ(test, sel, range2_sels[RANGE2_NUM_VALS - 1]);
210 KUNIT_EXPECT_FALSE(test, found);
211}
212
213static struct kunit_case range_test_cases[] = {
214 KUNIT_CASE(range_test_get_value_amount),
215 KUNIT_CASE(range_test_get_selector_high),
216 KUNIT_CASE(range_test_get_selector_low),
217 KUNIT_CASE(range_test_get_value),
218 {},
219};
220
221static struct kunit_suite range_test_module = {
222 .name = "linear-ranges-test",
223 .test_cases = range_test_cases,
224};
225
226kunit_test_suites(&range_test_module);
227
228MODULE_LICENSE("GPL");
229