]>
Commit | Line | Data |
---|---|---|
09c434b8 | 1 | // SPDX-License-Identifier: GPL-2.0-only |
36f33b56 DL |
2 | |
3 | #include <kunit/test.h> | |
4 | ||
c5adae95 KF |
5 | #include <linux/sort.h> |
6 | #include <linux/slab.h> | |
ebd03a9a | 7 | #include <linux/module.h> |
c5adae95 | 8 | |
ebd03a9a | 9 | /* a simple boot-time regression test */ |
c5adae95 KF |
10 | |
11 | #define TEST_LEN 1000 | |
12 | ||
36f33b56 | 13 | static int cmpint(const void *a, const void *b) |
c5adae95 KF |
14 | { |
15 | return *(int *)a - *(int *)b; | |
16 | } | |
17 | ||
36f33b56 | 18 | static void test_sort(struct kunit *test) |
c5adae95 | 19 | { |
36f33b56 | 20 | int *a, i, r = 1; |
c5adae95 | 21 | |
36f33b56 DL |
22 | a = kunit_kmalloc_array(test, TEST_LEN, sizeof(*a), GFP_KERNEL); |
23 | KUNIT_ASSERT_NOT_ERR_OR_NULL(test, a); | |
c5adae95 KF |
24 | |
25 | for (i = 0; i < TEST_LEN; i++) { | |
26 | r = (r * 725861) % 6599; | |
27 | a[i] = r; | |
28 | } | |
29 | ||
30 | sort(a, TEST_LEN, sizeof(*a), cmpint, NULL); | |
31 | ||
c5adae95 | 32 | for (i = 0; i < TEST_LEN-1; i++) |
36f33b56 | 33 | KUNIT_ASSERT_LE(test, a[i], a[i + 1]); |
c5adae95 | 34 | } |
ebd03a9a | 35 | |
36f33b56 DL |
36 | static struct kunit_case sort_test_cases[] = { |
37 | KUNIT_CASE(test_sort), | |
38 | {} | |
39 | }; | |
40 | ||
41 | static struct kunit_suite sort_test_suite = { | |
42 | .name = "lib_sort", | |
43 | .test_cases = sort_test_cases, | |
44 | }; | |
92fc7cb8 | 45 | |
36f33b56 | 46 | kunit_test_suites(&sort_test_suite); |
92fc7cb8 | 47 | |
ebd03a9a | 48 | MODULE_LICENSE("GPL"); |