| 1 | |
| 2 |
|
| 3 | #include <kunit/test.h>
|
| 4 |
|
| 5 | #include <linux/sort.h>
|
| 6 | #include <linux/slab.h>
|
| 7 | #include <linux/module.h>
|
| 8 |
|
| 9 |
|
| 10 |
|
| 11 | #define TEST_LEN 1000
|
| 12 |
|
| 13 | static int cmpint(const void *a, const void *b)
|
| 14 | {
|
| 15 | return *(int *)a - *(int *)b;
|
| 16 | }
|
| 17 |
|
| 18 | static void test_sort(struct kunit *test)
|
| 19 | {
|
| 20 | int *a, i, r = 1;
|
| 21 |
|
| 22 | a = kunit_kmalloc_array(test, TEST_LEN, sizeof(*a), GFP_KERNEL);
|
| 23 | KUNIT_ASSERT_NOT_ERR_OR_NULL(test, a);
|
| 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 |
|
| 32 | for (i = 0; i < TEST_LEN - 1; i++)
|
| 33 | KUNIT_ASSERT_LE(test, a[i], a[i + 1]);
|
| 34 |
|
| 35 | r = 48;
|
| 36 |
|
| 37 | for (i = 0; i < TEST_LEN - 1; i++) {
|
| 38 | r = (r * 725861) % 6599;
|
| 39 | a[i] = r;
|
| 40 | }
|
| 41 |
|
| 42 | sort(a, TEST_LEN - 1, sizeof(*a), cmpint, NULL);
|
| 43 |
|
| 44 | for (i = 0; i < TEST_LEN - 2; i++)
|
| 45 | KUNIT_ASSERT_LE(test, a[i], a[i + 1]);
|
| 46 | }
|
| 47 |
|
| 48 | static struct kunit_case sort_test_cases[] = {
|
| 49 | KUNIT_CASE(test_sort),
|
| 50 | {}
|
| 51 | };
|
| 52 |
|
| 53 | static struct kunit_suite sort_test_suite = {
|
| 54 | .name = "lib_sort",
|
| 55 | .test_cases = sort_test_cases,
|
| 56 | };
|
| 57 |
|
| 58 | kunit_test_suites(&sort_test_suite);
|
| 59 |
|
| 60 | MODULE_DESCRIPTION("sort() KUnit test suite");
|
| 61 | MODULE_LICENSE("GPL");
|