1*5dc8f73eSDave Martin // SPDX-License-Identifier: GPL-2.0
2*5dc8f73eSDave Martin // Copyright (C) 2025 Arm Ltd.
3*5dc8f73eSDave Martin /* This file is intended to be included into mpam_resctrl.c */
4*5dc8f73eSDave Martin
5*5dc8f73eSDave Martin #include <kunit/test.h>
6*5dc8f73eSDave Martin #include <linux/array_size.h>
7*5dc8f73eSDave Martin #include <linux/bits.h>
8*5dc8f73eSDave Martin #include <linux/math.h>
9*5dc8f73eSDave Martin #include <linux/sprintf.h>
10*5dc8f73eSDave Martin
11*5dc8f73eSDave Martin struct percent_value_case {
12*5dc8f73eSDave Martin u8 pc;
13*5dc8f73eSDave Martin u8 width;
14*5dc8f73eSDave Martin u16 value;
15*5dc8f73eSDave Martin };
16*5dc8f73eSDave Martin
17*5dc8f73eSDave Martin /*
18*5dc8f73eSDave Martin * Mysterious inscriptions taken from the union of ARM DDI 0598D.b,
19*5dc8f73eSDave Martin * "Arm Architecture Reference Manual Supplement - Memory System
20*5dc8f73eSDave Martin * Resource Partitioning and Monitoring (MPAM), for A-profile
21*5dc8f73eSDave Martin * architecture", Section 9.8, "About the fixed-point fractional
22*5dc8f73eSDave Martin * format" (exact percentage entries only) and ARM IHI0099B.a
23*5dc8f73eSDave Martin * "MPAM system component specification", Section 9.3,
24*5dc8f73eSDave Martin * "The fixed-point fractional format":
25*5dc8f73eSDave Martin */
26*5dc8f73eSDave Martin static const struct percent_value_case percent_value_cases[] = {
27*5dc8f73eSDave Martin /* Architectural cases: */
28*5dc8f73eSDave Martin { 1, 8, 1 }, { 1, 12, 0x27 }, { 1, 16, 0x28e },
29*5dc8f73eSDave Martin { 25, 8, 0x3f }, { 25, 12, 0x3ff }, { 25, 16, 0x3fff },
30*5dc8f73eSDave Martin { 33, 8, 0x53 }, { 33, 12, 0x546 }, { 33, 16, 0x5479 },
31*5dc8f73eSDave Martin { 35, 8, 0x58 }, { 35, 12, 0x598 }, { 35, 16, 0x5998 },
32*5dc8f73eSDave Martin { 45, 8, 0x72 }, { 45, 12, 0x732 }, { 45, 16, 0x7332 },
33*5dc8f73eSDave Martin { 50, 8, 0x7f }, { 50, 12, 0x7ff }, { 50, 16, 0x7fff },
34*5dc8f73eSDave Martin { 52, 8, 0x84 }, { 52, 12, 0x850 }, { 52, 16, 0x851d },
35*5dc8f73eSDave Martin { 55, 8, 0x8b }, { 55, 12, 0x8cb }, { 55, 16, 0x8ccb },
36*5dc8f73eSDave Martin { 58, 8, 0x93 }, { 58, 12, 0x946 }, { 58, 16, 0x9479 },
37*5dc8f73eSDave Martin { 75, 8, 0xbf }, { 75, 12, 0xbff }, { 75, 16, 0xbfff },
38*5dc8f73eSDave Martin { 80, 8, 0xcb }, { 80, 12, 0xccb }, { 80, 16, 0xcccb },
39*5dc8f73eSDave Martin { 88, 8, 0xe0 }, { 88, 12, 0xe13 }, { 88, 16, 0xe146 },
40*5dc8f73eSDave Martin { 95, 8, 0xf2 }, { 95, 12, 0xf32 }, { 95, 16, 0xf332 },
41*5dc8f73eSDave Martin { 100, 8, 0xff }, { 100, 12, 0xfff }, { 100, 16, 0xffff },
42*5dc8f73eSDave Martin };
43*5dc8f73eSDave Martin
test_percent_value_desc(const struct percent_value_case * param,char * desc)44*5dc8f73eSDave Martin static void test_percent_value_desc(const struct percent_value_case *param,
45*5dc8f73eSDave Martin char *desc)
46*5dc8f73eSDave Martin {
47*5dc8f73eSDave Martin snprintf(desc, KUNIT_PARAM_DESC_SIZE,
48*5dc8f73eSDave Martin "pc=%d, width=%d, value=0x%.*x\n",
49*5dc8f73eSDave Martin param->pc, param->width,
50*5dc8f73eSDave Martin DIV_ROUND_UP(param->width, 4), param->value);
51*5dc8f73eSDave Martin }
52*5dc8f73eSDave Martin
53*5dc8f73eSDave Martin KUNIT_ARRAY_PARAM(test_percent_value, percent_value_cases,
54*5dc8f73eSDave Martin test_percent_value_desc);
55*5dc8f73eSDave Martin
56*5dc8f73eSDave Martin struct percent_value_test_info {
57*5dc8f73eSDave Martin u32 pc; /* result of value-to-percent conversion */
58*5dc8f73eSDave Martin u32 value; /* result of percent-to-value conversion */
59*5dc8f73eSDave Martin u32 max_value; /* maximum raw value allowed by test params */
60*5dc8f73eSDave Martin unsigned int shift; /* promotes raw testcase value to 16 bits */
61*5dc8f73eSDave Martin };
62*5dc8f73eSDave Martin
63*5dc8f73eSDave Martin /*
64*5dc8f73eSDave Martin * Convert a reference percentage to a fixed-point MAX value and
65*5dc8f73eSDave Martin * vice-versa, based on param (not test->param_value!)
66*5dc8f73eSDave Martin */
__prepare_percent_value_test(struct kunit * test,struct percent_value_test_info * res,const struct percent_value_case * param)67*5dc8f73eSDave Martin static void __prepare_percent_value_test(struct kunit *test,
68*5dc8f73eSDave Martin struct percent_value_test_info *res,
69*5dc8f73eSDave Martin const struct percent_value_case *param)
70*5dc8f73eSDave Martin {
71*5dc8f73eSDave Martin struct mpam_props fake_props = { };
72*5dc8f73eSDave Martin
73*5dc8f73eSDave Martin /* Reject bogus test parameters that would break the tests: */
74*5dc8f73eSDave Martin KUNIT_ASSERT_GE(test, param->width, 1);
75*5dc8f73eSDave Martin KUNIT_ASSERT_LE(test, param->width, 16);
76*5dc8f73eSDave Martin KUNIT_ASSERT_LT(test, param->value, 1 << param->width);
77*5dc8f73eSDave Martin
78*5dc8f73eSDave Martin mpam_set_feature(mpam_feat_mbw_max, &fake_props);
79*5dc8f73eSDave Martin fake_props.bwa_wd = param->width;
80*5dc8f73eSDave Martin
81*5dc8f73eSDave Martin res->shift = 16 - param->width;
82*5dc8f73eSDave Martin res->max_value = GENMASK_U32(param->width - 1, 0);
83*5dc8f73eSDave Martin res->value = percent_to_mbw_max(param->pc, &fake_props);
84*5dc8f73eSDave Martin res->pc = mbw_max_to_percent(param->value << res->shift, &fake_props);
85*5dc8f73eSDave Martin }
86*5dc8f73eSDave Martin
test_get_mba_granularity(struct kunit * test)87*5dc8f73eSDave Martin static void test_get_mba_granularity(struct kunit *test)
88*5dc8f73eSDave Martin {
89*5dc8f73eSDave Martin int ret;
90*5dc8f73eSDave Martin struct mpam_props fake_props = { };
91*5dc8f73eSDave Martin
92*5dc8f73eSDave Martin /* Use MBW_MAX */
93*5dc8f73eSDave Martin mpam_set_feature(mpam_feat_mbw_max, &fake_props);
94*5dc8f73eSDave Martin
95*5dc8f73eSDave Martin fake_props.bwa_wd = 0;
96*5dc8f73eSDave Martin KUNIT_EXPECT_FALSE(test, mba_class_use_mbw_max(&fake_props));
97*5dc8f73eSDave Martin
98*5dc8f73eSDave Martin fake_props.bwa_wd = 1;
99*5dc8f73eSDave Martin KUNIT_EXPECT_TRUE(test, mba_class_use_mbw_max(&fake_props));
100*5dc8f73eSDave Martin
101*5dc8f73eSDave Martin /* Architectural maximum: */
102*5dc8f73eSDave Martin fake_props.bwa_wd = 16;
103*5dc8f73eSDave Martin KUNIT_EXPECT_TRUE(test, mba_class_use_mbw_max(&fake_props));
104*5dc8f73eSDave Martin
105*5dc8f73eSDave Martin /* No usable control... */
106*5dc8f73eSDave Martin fake_props.bwa_wd = 0;
107*5dc8f73eSDave Martin ret = get_mba_granularity(&fake_props);
108*5dc8f73eSDave Martin KUNIT_EXPECT_EQ(test, ret, 0);
109*5dc8f73eSDave Martin
110*5dc8f73eSDave Martin fake_props.bwa_wd = 1;
111*5dc8f73eSDave Martin ret = get_mba_granularity(&fake_props);
112*5dc8f73eSDave Martin KUNIT_EXPECT_EQ(test, ret, 50); /* DIV_ROUND_UP(100, 1 << 1)% = 50% */
113*5dc8f73eSDave Martin
114*5dc8f73eSDave Martin fake_props.bwa_wd = 2;
115*5dc8f73eSDave Martin ret = get_mba_granularity(&fake_props);
116*5dc8f73eSDave Martin KUNIT_EXPECT_EQ(test, ret, 25); /* DIV_ROUND_UP(100, 1 << 2)% = 25% */
117*5dc8f73eSDave Martin
118*5dc8f73eSDave Martin fake_props.bwa_wd = 3;
119*5dc8f73eSDave Martin ret = get_mba_granularity(&fake_props);
120*5dc8f73eSDave Martin KUNIT_EXPECT_EQ(test, ret, 13); /* DIV_ROUND_UP(100, 1 << 3)% = 13% */
121*5dc8f73eSDave Martin
122*5dc8f73eSDave Martin fake_props.bwa_wd = 6;
123*5dc8f73eSDave Martin ret = get_mba_granularity(&fake_props);
124*5dc8f73eSDave Martin KUNIT_EXPECT_EQ(test, ret, 2); /* DIV_ROUND_UP(100, 1 << 6)% = 2% */
125*5dc8f73eSDave Martin
126*5dc8f73eSDave Martin fake_props.bwa_wd = 7;
127*5dc8f73eSDave Martin ret = get_mba_granularity(&fake_props);
128*5dc8f73eSDave Martin KUNIT_EXPECT_EQ(test, ret, 1); /* DIV_ROUND_UP(100, 1 << 7)% = 1% */
129*5dc8f73eSDave Martin
130*5dc8f73eSDave Martin /* Granularity saturates at 1% */
131*5dc8f73eSDave Martin fake_props.bwa_wd = 16; /* architectural maximum */
132*5dc8f73eSDave Martin ret = get_mba_granularity(&fake_props);
133*5dc8f73eSDave Martin KUNIT_EXPECT_EQ(test, ret, 1); /* DIV_ROUND_UP(100, 1 << 16)% = 1% */
134*5dc8f73eSDave Martin }
135*5dc8f73eSDave Martin
test_mbw_max_to_percent(struct kunit * test)136*5dc8f73eSDave Martin static void test_mbw_max_to_percent(struct kunit *test)
137*5dc8f73eSDave Martin {
138*5dc8f73eSDave Martin const struct percent_value_case *param = test->param_value;
139*5dc8f73eSDave Martin struct percent_value_test_info res;
140*5dc8f73eSDave Martin
141*5dc8f73eSDave Martin /*
142*5dc8f73eSDave Martin * Since the reference values in percent_value_cases[] all
143*5dc8f73eSDave Martin * correspond to exact percentages, round-to-nearest will
144*5dc8f73eSDave Martin * always give the exact percentage back when the MPAM max
145*5dc8f73eSDave Martin * value has precision of 0.5% or finer. (Always true for the
146*5dc8f73eSDave Martin * reference data, since they all specify 8 bits or more of
147*5dc8f73eSDave Martin * precision.
148*5dc8f73eSDave Martin *
149*5dc8f73eSDave Martin * So, keep it simple and demand an exact match:
150*5dc8f73eSDave Martin */
151*5dc8f73eSDave Martin __prepare_percent_value_test(test, &res, param);
152*5dc8f73eSDave Martin KUNIT_EXPECT_EQ(test, res.pc, param->pc);
153*5dc8f73eSDave Martin }
154*5dc8f73eSDave Martin
test_percent_to_mbw_max(struct kunit * test)155*5dc8f73eSDave Martin static void test_percent_to_mbw_max(struct kunit *test)
156*5dc8f73eSDave Martin {
157*5dc8f73eSDave Martin const struct percent_value_case *param = test->param_value;
158*5dc8f73eSDave Martin struct percent_value_test_info res;
159*5dc8f73eSDave Martin
160*5dc8f73eSDave Martin __prepare_percent_value_test(test, &res, param);
161*5dc8f73eSDave Martin
162*5dc8f73eSDave Martin KUNIT_EXPECT_GE(test, res.value, param->value << res.shift);
163*5dc8f73eSDave Martin KUNIT_EXPECT_LE(test, res.value, (param->value + 1) << res.shift);
164*5dc8f73eSDave Martin KUNIT_EXPECT_LE(test, res.value, res.max_value << res.shift);
165*5dc8f73eSDave Martin
166*5dc8f73eSDave Martin /* No flexibility allowed for 0% and 100%! */
167*5dc8f73eSDave Martin
168*5dc8f73eSDave Martin if (param->pc == 0)
169*5dc8f73eSDave Martin KUNIT_EXPECT_EQ(test, res.value, 0);
170*5dc8f73eSDave Martin
171*5dc8f73eSDave Martin if (param->pc == 100)
172*5dc8f73eSDave Martin KUNIT_EXPECT_EQ(test, res.value, res.max_value << res.shift);
173*5dc8f73eSDave Martin }
174*5dc8f73eSDave Martin
test_all_bwa_wd_gen_params(struct kunit * test,const void * prev,char * desc)175*5dc8f73eSDave Martin static const void *test_all_bwa_wd_gen_params(struct kunit *test, const void *prev,
176*5dc8f73eSDave Martin char *desc)
177*5dc8f73eSDave Martin {
178*5dc8f73eSDave Martin uintptr_t param = (uintptr_t)prev;
179*5dc8f73eSDave Martin
180*5dc8f73eSDave Martin if (param > 15)
181*5dc8f73eSDave Martin return NULL;
182*5dc8f73eSDave Martin
183*5dc8f73eSDave Martin param++;
184*5dc8f73eSDave Martin
185*5dc8f73eSDave Martin snprintf(desc, KUNIT_PARAM_DESC_SIZE, "wd=%u\n", (unsigned int)param);
186*5dc8f73eSDave Martin
187*5dc8f73eSDave Martin return (void *)param;
188*5dc8f73eSDave Martin }
189*5dc8f73eSDave Martin
test_get_bwa_wd(struct kunit * test)190*5dc8f73eSDave Martin static unsigned int test_get_bwa_wd(struct kunit *test)
191*5dc8f73eSDave Martin {
192*5dc8f73eSDave Martin uintptr_t param = (uintptr_t)test->param_value;
193*5dc8f73eSDave Martin
194*5dc8f73eSDave Martin KUNIT_ASSERT_GE(test, param, 1);
195*5dc8f73eSDave Martin KUNIT_ASSERT_LE(test, param, 16);
196*5dc8f73eSDave Martin
197*5dc8f73eSDave Martin return param;
198*5dc8f73eSDave Martin }
199*5dc8f73eSDave Martin
test_mbw_max_to_percent_limits(struct kunit * test)200*5dc8f73eSDave Martin static void test_mbw_max_to_percent_limits(struct kunit *test)
201*5dc8f73eSDave Martin {
202*5dc8f73eSDave Martin struct mpam_props fake_props = {0};
203*5dc8f73eSDave Martin u32 max_value;
204*5dc8f73eSDave Martin
205*5dc8f73eSDave Martin mpam_set_feature(mpam_feat_mbw_max, &fake_props);
206*5dc8f73eSDave Martin fake_props.bwa_wd = test_get_bwa_wd(test);
207*5dc8f73eSDave Martin max_value = GENMASK(15, 16 - fake_props.bwa_wd);
208*5dc8f73eSDave Martin
209*5dc8f73eSDave Martin KUNIT_EXPECT_EQ(test, mbw_max_to_percent(max_value, &fake_props),
210*5dc8f73eSDave Martin MAX_MBA_BW);
211*5dc8f73eSDave Martin KUNIT_EXPECT_EQ(test, mbw_max_to_percent(0, &fake_props),
212*5dc8f73eSDave Martin get_mba_min(&fake_props));
213*5dc8f73eSDave Martin
214*5dc8f73eSDave Martin /*
215*5dc8f73eSDave Martin * Rounding policy dependent 0% sanity-check:
216*5dc8f73eSDave Martin * With round-to-nearest, the minimum mbw_max value really
217*5dc8f73eSDave Martin * should map to 0% if there are at least 200 steps.
218*5dc8f73eSDave Martin * (100 steps may be enough for some other rounding policies.)
219*5dc8f73eSDave Martin */
220*5dc8f73eSDave Martin if (fake_props.bwa_wd >= 8)
221*5dc8f73eSDave Martin KUNIT_EXPECT_EQ(test, mbw_max_to_percent(0, &fake_props), 0);
222*5dc8f73eSDave Martin
223*5dc8f73eSDave Martin if (fake_props.bwa_wd < 8 &&
224*5dc8f73eSDave Martin mbw_max_to_percent(0, &fake_props) == 0)
225*5dc8f73eSDave Martin kunit_warn(test, "wd=%d: Testsuite/driver Rounding policy mismatch?",
226*5dc8f73eSDave Martin fake_props.bwa_wd);
227*5dc8f73eSDave Martin }
228*5dc8f73eSDave Martin
229*5dc8f73eSDave Martin /*
230*5dc8f73eSDave Martin * Check that converting a percentage to mbw_max and back again (or, as
231*5dc8f73eSDave Martin * appropriate, vice-versa) always restores the original value:
232*5dc8f73eSDave Martin */
test_percent_max_roundtrip_stability(struct kunit * test)233*5dc8f73eSDave Martin static void test_percent_max_roundtrip_stability(struct kunit *test)
234*5dc8f73eSDave Martin {
235*5dc8f73eSDave Martin struct mpam_props fake_props = {0};
236*5dc8f73eSDave Martin unsigned int shift;
237*5dc8f73eSDave Martin u32 pc, max, pc2, max2;
238*5dc8f73eSDave Martin
239*5dc8f73eSDave Martin mpam_set_feature(mpam_feat_mbw_max, &fake_props);
240*5dc8f73eSDave Martin fake_props.bwa_wd = test_get_bwa_wd(test);
241*5dc8f73eSDave Martin shift = 16 - fake_props.bwa_wd;
242*5dc8f73eSDave Martin
243*5dc8f73eSDave Martin /*
244*5dc8f73eSDave Martin * Converting a valid value from the coarser scale to the finer
245*5dc8f73eSDave Martin * scale and back again must yield the original value:
246*5dc8f73eSDave Martin */
247*5dc8f73eSDave Martin if (fake_props.bwa_wd >= 7) {
248*5dc8f73eSDave Martin /* More than 100 steps: only test exact pc values: */
249*5dc8f73eSDave Martin for (pc = get_mba_min(&fake_props); pc <= MAX_MBA_BW; pc++) {
250*5dc8f73eSDave Martin max = percent_to_mbw_max(pc, &fake_props);
251*5dc8f73eSDave Martin pc2 = mbw_max_to_percent(max, &fake_props);
252*5dc8f73eSDave Martin KUNIT_EXPECT_EQ(test, pc2, pc);
253*5dc8f73eSDave Martin }
254*5dc8f73eSDave Martin } else {
255*5dc8f73eSDave Martin /* Fewer than 100 steps: only test exact mbw_max values: */
256*5dc8f73eSDave Martin for (max = 0; max < 1 << 16; max += 1 << shift) {
257*5dc8f73eSDave Martin pc = mbw_max_to_percent(max, &fake_props);
258*5dc8f73eSDave Martin max2 = percent_to_mbw_max(pc, &fake_props);
259*5dc8f73eSDave Martin KUNIT_EXPECT_EQ(test, max2, max);
260*5dc8f73eSDave Martin }
261*5dc8f73eSDave Martin }
262*5dc8f73eSDave Martin }
263*5dc8f73eSDave Martin
test_percent_to_max_rounding(struct kunit * test)264*5dc8f73eSDave Martin static void test_percent_to_max_rounding(struct kunit *test)
265*5dc8f73eSDave Martin {
266*5dc8f73eSDave Martin const struct percent_value_case *param = test->param_value;
267*5dc8f73eSDave Martin unsigned int num_rounded_up = 0, total = 0;
268*5dc8f73eSDave Martin struct percent_value_test_info res;
269*5dc8f73eSDave Martin
270*5dc8f73eSDave Martin for (param = percent_value_cases, total = 0;
271*5dc8f73eSDave Martin param < &percent_value_cases[ARRAY_SIZE(percent_value_cases)];
272*5dc8f73eSDave Martin param++, total++) {
273*5dc8f73eSDave Martin __prepare_percent_value_test(test, &res, param);
274*5dc8f73eSDave Martin if (res.value > param->value << res.shift)
275*5dc8f73eSDave Martin num_rounded_up++;
276*5dc8f73eSDave Martin }
277*5dc8f73eSDave Martin
278*5dc8f73eSDave Martin /*
279*5dc8f73eSDave Martin * The MPAM driver applies a round-to-nearest policy, whereas a
280*5dc8f73eSDave Martin * round-down policy seems to have been applied in the
281*5dc8f73eSDave Martin * reference table from which the test vectors were selected.
282*5dc8f73eSDave Martin *
283*5dc8f73eSDave Martin * For a large and well-distributed suite of test vectors,
284*5dc8f73eSDave Martin * about half should be rounded up and half down compared with
285*5dc8f73eSDave Martin * the reference table. The actual test vectors are few in
286*5dc8f73eSDave Martin * number and probably not very well distributed however, so
287*5dc8f73eSDave Martin * tolerate a round-up rate of between 1/4 and 3/4 before
288*5dc8f73eSDave Martin * crying foul:
289*5dc8f73eSDave Martin */
290*5dc8f73eSDave Martin
291*5dc8f73eSDave Martin kunit_info(test, "Round-up rate: %u%% (%u/%u)\n",
292*5dc8f73eSDave Martin DIV_ROUND_CLOSEST(num_rounded_up * 100, total),
293*5dc8f73eSDave Martin num_rounded_up, total);
294*5dc8f73eSDave Martin
295*5dc8f73eSDave Martin KUNIT_EXPECT_GE(test, 4 * num_rounded_up, 1 * total);
296*5dc8f73eSDave Martin KUNIT_EXPECT_LE(test, 4 * num_rounded_up, 3 * total);
297*5dc8f73eSDave Martin }
298*5dc8f73eSDave Martin
299*5dc8f73eSDave Martin static struct kunit_case mpam_resctrl_test_cases[] = {
300*5dc8f73eSDave Martin KUNIT_CASE(test_get_mba_granularity),
301*5dc8f73eSDave Martin KUNIT_CASE_PARAM(test_mbw_max_to_percent, test_percent_value_gen_params),
302*5dc8f73eSDave Martin KUNIT_CASE_PARAM(test_percent_to_mbw_max, test_percent_value_gen_params),
303*5dc8f73eSDave Martin KUNIT_CASE_PARAM(test_mbw_max_to_percent_limits, test_all_bwa_wd_gen_params),
304*5dc8f73eSDave Martin KUNIT_CASE(test_percent_to_max_rounding),
305*5dc8f73eSDave Martin KUNIT_CASE_PARAM(test_percent_max_roundtrip_stability,
306*5dc8f73eSDave Martin test_all_bwa_wd_gen_params),
307*5dc8f73eSDave Martin {}
308*5dc8f73eSDave Martin };
309*5dc8f73eSDave Martin
310*5dc8f73eSDave Martin static struct kunit_suite mpam_resctrl_test_suite = {
311*5dc8f73eSDave Martin .name = "mpam_resctrl_test_suite",
312*5dc8f73eSDave Martin .test_cases = mpam_resctrl_test_cases,
313*5dc8f73eSDave Martin };
314*5dc8f73eSDave Martin
315*5dc8f73eSDave Martin kunit_test_suites(&mpam_resctrl_test_suite);
316