mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/next/linux-next.git
synced 2024-12-29 17:22:07 +00:00
5a3c9366cb
Check the total number of elements in both resultant lists are correct within list_cut_position*(). Previously, only the first list's size was checked. so additional elements in the second list would not have been caught. Link: https://lkml.kernel.org/r/20241008065253.26673-1-richard120310@gmail.com Signed-off-by: I Hsin Cheng <richard120310@gmail.com> Cc: David Gow <davidgow@google.com> Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
1506 lines
35 KiB
C
1506 lines
35 KiB
C
// SPDX-License-Identifier: GPL-2.0
|
|
/*
|
|
* KUnit test for the Kernel Linked-list structures.
|
|
*
|
|
* Copyright (C) 2019, Google LLC.
|
|
* Author: David Gow <davidgow@google.com>
|
|
*/
|
|
#include <kunit/test.h>
|
|
|
|
#include <linux/list.h>
|
|
#include <linux/klist.h>
|
|
|
|
struct list_test_struct {
|
|
int data;
|
|
struct list_head list;
|
|
};
|
|
|
|
static void list_test_list_init(struct kunit *test)
|
|
{
|
|
/* Test the different ways of initialising a list. */
|
|
struct list_head list1 = LIST_HEAD_INIT(list1);
|
|
struct list_head list2;
|
|
LIST_HEAD(list3);
|
|
struct list_head *list4;
|
|
struct list_head *list5;
|
|
|
|
INIT_LIST_HEAD(&list2);
|
|
|
|
list4 = kzalloc(sizeof(*list4), GFP_KERNEL | __GFP_NOFAIL);
|
|
INIT_LIST_HEAD(list4);
|
|
|
|
list5 = kmalloc(sizeof(*list5), GFP_KERNEL | __GFP_NOFAIL);
|
|
memset(list5, 0xFF, sizeof(*list5));
|
|
INIT_LIST_HEAD(list5);
|
|
|
|
/* list_empty_careful() checks both next and prev. */
|
|
KUNIT_EXPECT_TRUE(test, list_empty_careful(&list1));
|
|
KUNIT_EXPECT_TRUE(test, list_empty_careful(&list2));
|
|
KUNIT_EXPECT_TRUE(test, list_empty_careful(&list3));
|
|
KUNIT_EXPECT_TRUE(test, list_empty_careful(list4));
|
|
KUNIT_EXPECT_TRUE(test, list_empty_careful(list5));
|
|
|
|
kfree(list4);
|
|
kfree(list5);
|
|
}
|
|
|
|
static void list_test_list_add(struct kunit *test)
|
|
{
|
|
struct list_head a, b;
|
|
LIST_HEAD(list);
|
|
|
|
list_add(&a, &list);
|
|
list_add(&b, &list);
|
|
|
|
/* should be [list] -> b -> a */
|
|
KUNIT_EXPECT_PTR_EQ(test, list.next, &b);
|
|
KUNIT_EXPECT_PTR_EQ(test, b.prev, &list);
|
|
KUNIT_EXPECT_PTR_EQ(test, b.next, &a);
|
|
}
|
|
|
|
static void list_test_list_add_tail(struct kunit *test)
|
|
{
|
|
struct list_head a, b;
|
|
LIST_HEAD(list);
|
|
|
|
list_add_tail(&a, &list);
|
|
list_add_tail(&b, &list);
|
|
|
|
/* should be [list] -> a -> b */
|
|
KUNIT_EXPECT_PTR_EQ(test, list.next, &a);
|
|
KUNIT_EXPECT_PTR_EQ(test, a.prev, &list);
|
|
KUNIT_EXPECT_PTR_EQ(test, a.next, &b);
|
|
}
|
|
|
|
static void list_test_list_del(struct kunit *test)
|
|
{
|
|
struct list_head a, b;
|
|
LIST_HEAD(list);
|
|
|
|
list_add_tail(&a, &list);
|
|
list_add_tail(&b, &list);
|
|
|
|
/* before: [list] -> a -> b */
|
|
list_del(&a);
|
|
|
|
/* now: [list] -> b */
|
|
KUNIT_EXPECT_PTR_EQ(test, list.next, &b);
|
|
KUNIT_EXPECT_PTR_EQ(test, b.prev, &list);
|
|
}
|
|
|
|
static void list_test_list_replace(struct kunit *test)
|
|
{
|
|
struct list_head a_old, a_new, b;
|
|
LIST_HEAD(list);
|
|
|
|
list_add_tail(&a_old, &list);
|
|
list_add_tail(&b, &list);
|
|
|
|
/* before: [list] -> a_old -> b */
|
|
list_replace(&a_old, &a_new);
|
|
|
|
/* now: [list] -> a_new -> b */
|
|
KUNIT_EXPECT_PTR_EQ(test, list.next, &a_new);
|
|
KUNIT_EXPECT_PTR_EQ(test, b.prev, &a_new);
|
|
KUNIT_EXPECT_PTR_EQ(test, a_new.next, &b);
|
|
KUNIT_EXPECT_PTR_EQ(test, a_new.prev, &list);
|
|
}
|
|
|
|
static void list_test_list_replace_init(struct kunit *test)
|
|
{
|
|
struct list_head a_old, a_new, b;
|
|
LIST_HEAD(list);
|
|
|
|
list_add_tail(&a_old, &list);
|
|
list_add_tail(&b, &list);
|
|
|
|
/* before: [list] -> a_old -> b */
|
|
list_replace_init(&a_old, &a_new);
|
|
|
|
/* now: [list] -> a_new -> b */
|
|
KUNIT_EXPECT_PTR_EQ(test, list.next, &a_new);
|
|
KUNIT_EXPECT_PTR_EQ(test, b.prev, &a_new);
|
|
KUNIT_EXPECT_PTR_EQ(test, a_new.next, &b);
|
|
KUNIT_EXPECT_PTR_EQ(test, a_new.prev, &list);
|
|
|
|
/* check a_old is empty (initialized) */
|
|
KUNIT_EXPECT_TRUE(test, list_empty_careful(&a_old));
|
|
}
|
|
|
|
static void list_test_list_swap(struct kunit *test)
|
|
{
|
|
struct list_head a, b;
|
|
LIST_HEAD(list);
|
|
|
|
list_add_tail(&a, &list);
|
|
list_add_tail(&b, &list);
|
|
|
|
/* before: [list] -> a -> b */
|
|
list_swap(&a, &b);
|
|
|
|
/* after: [list] -> b -> a */
|
|
KUNIT_EXPECT_PTR_EQ(test, &b, list.next);
|
|
KUNIT_EXPECT_PTR_EQ(test, &a, list.prev);
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, &a, b.next);
|
|
KUNIT_EXPECT_PTR_EQ(test, &list, b.prev);
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, &list, a.next);
|
|
KUNIT_EXPECT_PTR_EQ(test, &b, a.prev);
|
|
}
|
|
|
|
static void list_test_list_del_init(struct kunit *test)
|
|
{
|
|
struct list_head a, b;
|
|
LIST_HEAD(list);
|
|
|
|
list_add_tail(&a, &list);
|
|
list_add_tail(&b, &list);
|
|
|
|
/* before: [list] -> a -> b */
|
|
list_del_init(&a);
|
|
/* after: [list] -> b, a initialised */
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, list.next, &b);
|
|
KUNIT_EXPECT_PTR_EQ(test, b.prev, &list);
|
|
KUNIT_EXPECT_TRUE(test, list_empty_careful(&a));
|
|
}
|
|
|
|
static void list_test_list_del_init_careful(struct kunit *test)
|
|
{
|
|
/* NOTE: This test only checks the behaviour of this function in
|
|
* isolation. It does not verify memory model guarantees.
|
|
*/
|
|
struct list_head a, b;
|
|
LIST_HEAD(list);
|
|
|
|
list_add_tail(&a, &list);
|
|
list_add_tail(&b, &list);
|
|
|
|
/* before: [list] -> a -> b */
|
|
list_del_init_careful(&a);
|
|
/* after: [list] -> b, a initialised */
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, list.next, &b);
|
|
KUNIT_EXPECT_PTR_EQ(test, b.prev, &list);
|
|
KUNIT_EXPECT_TRUE(test, list_empty_careful(&a));
|
|
}
|
|
|
|
static void list_test_list_move(struct kunit *test)
|
|
{
|
|
struct list_head a, b;
|
|
LIST_HEAD(list1);
|
|
LIST_HEAD(list2);
|
|
|
|
list_add_tail(&a, &list1);
|
|
list_add_tail(&b, &list2);
|
|
|
|
/* before: [list1] -> a, [list2] -> b */
|
|
list_move(&a, &list2);
|
|
/* after: [list1] empty, [list2] -> a -> b */
|
|
|
|
KUNIT_EXPECT_TRUE(test, list_empty(&list1));
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, &a, list2.next);
|
|
KUNIT_EXPECT_PTR_EQ(test, &b, a.next);
|
|
}
|
|
|
|
static void list_test_list_move_tail(struct kunit *test)
|
|
{
|
|
struct list_head a, b;
|
|
LIST_HEAD(list1);
|
|
LIST_HEAD(list2);
|
|
|
|
list_add_tail(&a, &list1);
|
|
list_add_tail(&b, &list2);
|
|
|
|
/* before: [list1] -> a, [list2] -> b */
|
|
list_move_tail(&a, &list2);
|
|
/* after: [list1] empty, [list2] -> b -> a */
|
|
|
|
KUNIT_EXPECT_TRUE(test, list_empty(&list1));
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, &b, list2.next);
|
|
KUNIT_EXPECT_PTR_EQ(test, &a, b.next);
|
|
}
|
|
|
|
static void list_test_list_bulk_move_tail(struct kunit *test)
|
|
{
|
|
struct list_head a, b, c, d, x, y;
|
|
struct list_head *list1_values[] = { &x, &b, &c, &y };
|
|
struct list_head *list2_values[] = { &a, &d };
|
|
struct list_head *ptr;
|
|
LIST_HEAD(list1);
|
|
LIST_HEAD(list2);
|
|
int i = 0;
|
|
|
|
list_add_tail(&x, &list1);
|
|
list_add_tail(&y, &list1);
|
|
|
|
list_add_tail(&a, &list2);
|
|
list_add_tail(&b, &list2);
|
|
list_add_tail(&c, &list2);
|
|
list_add_tail(&d, &list2);
|
|
|
|
/* before: [list1] -> x -> y, [list2] -> a -> b -> c -> d */
|
|
list_bulk_move_tail(&y, &b, &c);
|
|
/* after: [list1] -> x -> b -> c -> y, [list2] -> a -> d */
|
|
|
|
list_for_each(ptr, &list1) {
|
|
KUNIT_EXPECT_PTR_EQ(test, ptr, list1_values[i]);
|
|
i++;
|
|
}
|
|
KUNIT_EXPECT_EQ(test, i, 4);
|
|
i = 0;
|
|
list_for_each(ptr, &list2) {
|
|
KUNIT_EXPECT_PTR_EQ(test, ptr, list2_values[i]);
|
|
i++;
|
|
}
|
|
KUNIT_EXPECT_EQ(test, i, 2);
|
|
}
|
|
|
|
static void list_test_list_is_head(struct kunit *test)
|
|
{
|
|
struct list_head a, b, c;
|
|
|
|
/* Two lists: [a] -> b, [c] */
|
|
INIT_LIST_HEAD(&a);
|
|
INIT_LIST_HEAD(&c);
|
|
list_add_tail(&b, &a);
|
|
|
|
KUNIT_EXPECT_TRUE_MSG(test, list_is_head(&a, &a),
|
|
"Head element of same list");
|
|
KUNIT_EXPECT_FALSE_MSG(test, list_is_head(&a, &b),
|
|
"Non-head element of same list");
|
|
KUNIT_EXPECT_FALSE_MSG(test, list_is_head(&a, &c),
|
|
"Head element of different list");
|
|
}
|
|
|
|
|
|
static void list_test_list_is_first(struct kunit *test)
|
|
{
|
|
struct list_head a, b;
|
|
LIST_HEAD(list);
|
|
|
|
list_add_tail(&a, &list);
|
|
list_add_tail(&b, &list);
|
|
|
|
KUNIT_EXPECT_TRUE(test, list_is_first(&a, &list));
|
|
KUNIT_EXPECT_FALSE(test, list_is_first(&b, &list));
|
|
}
|
|
|
|
static void list_test_list_is_last(struct kunit *test)
|
|
{
|
|
struct list_head a, b;
|
|
LIST_HEAD(list);
|
|
|
|
list_add_tail(&a, &list);
|
|
list_add_tail(&b, &list);
|
|
|
|
KUNIT_EXPECT_FALSE(test, list_is_last(&a, &list));
|
|
KUNIT_EXPECT_TRUE(test, list_is_last(&b, &list));
|
|
}
|
|
|
|
static void list_test_list_empty(struct kunit *test)
|
|
{
|
|
struct list_head a;
|
|
LIST_HEAD(list1);
|
|
LIST_HEAD(list2);
|
|
|
|
list_add_tail(&a, &list1);
|
|
|
|
KUNIT_EXPECT_FALSE(test, list_empty(&list1));
|
|
KUNIT_EXPECT_TRUE(test, list_empty(&list2));
|
|
}
|
|
|
|
static void list_test_list_empty_careful(struct kunit *test)
|
|
{
|
|
/* This test doesn't check correctness under concurrent access */
|
|
struct list_head a;
|
|
LIST_HEAD(list1);
|
|
LIST_HEAD(list2);
|
|
|
|
list_add_tail(&a, &list1);
|
|
|
|
KUNIT_EXPECT_FALSE(test, list_empty_careful(&list1));
|
|
KUNIT_EXPECT_TRUE(test, list_empty_careful(&list2));
|
|
}
|
|
|
|
static void list_test_list_rotate_left(struct kunit *test)
|
|
{
|
|
struct list_head a, b;
|
|
LIST_HEAD(list);
|
|
|
|
list_add_tail(&a, &list);
|
|
list_add_tail(&b, &list);
|
|
|
|
/* before: [list] -> a -> b */
|
|
list_rotate_left(&list);
|
|
/* after: [list] -> b -> a */
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, list.next, &b);
|
|
KUNIT_EXPECT_PTR_EQ(test, b.prev, &list);
|
|
KUNIT_EXPECT_PTR_EQ(test, b.next, &a);
|
|
}
|
|
|
|
static void list_test_list_rotate_to_front(struct kunit *test)
|
|
{
|
|
struct list_head a, b, c, d;
|
|
struct list_head *list_values[] = { &c, &d, &a, &b };
|
|
struct list_head *ptr;
|
|
LIST_HEAD(list);
|
|
int i = 0;
|
|
|
|
list_add_tail(&a, &list);
|
|
list_add_tail(&b, &list);
|
|
list_add_tail(&c, &list);
|
|
list_add_tail(&d, &list);
|
|
|
|
/* before: [list] -> a -> b -> c -> d */
|
|
list_rotate_to_front(&c, &list);
|
|
/* after: [list] -> c -> d -> a -> b */
|
|
|
|
list_for_each(ptr, &list) {
|
|
KUNIT_EXPECT_PTR_EQ(test, ptr, list_values[i]);
|
|
i++;
|
|
}
|
|
KUNIT_EXPECT_EQ(test, i, 4);
|
|
}
|
|
|
|
static void list_test_list_is_singular(struct kunit *test)
|
|
{
|
|
struct list_head a, b;
|
|
LIST_HEAD(list);
|
|
|
|
/* [list] empty */
|
|
KUNIT_EXPECT_FALSE(test, list_is_singular(&list));
|
|
|
|
list_add_tail(&a, &list);
|
|
|
|
/* [list] -> a */
|
|
KUNIT_EXPECT_TRUE(test, list_is_singular(&list));
|
|
|
|
list_add_tail(&b, &list);
|
|
|
|
/* [list] -> a -> b */
|
|
KUNIT_EXPECT_FALSE(test, list_is_singular(&list));
|
|
}
|
|
|
|
static void list_test_list_cut_position(struct kunit *test)
|
|
{
|
|
struct list_head entries[3], *cur;
|
|
LIST_HEAD(list1);
|
|
LIST_HEAD(list2);
|
|
int i = 0;
|
|
|
|
list_add_tail(&entries[0], &list1);
|
|
list_add_tail(&entries[1], &list1);
|
|
list_add_tail(&entries[2], &list1);
|
|
|
|
/* before: [list1] -> entries[0] -> entries[1] -> entries[2] */
|
|
list_cut_position(&list2, &list1, &entries[1]);
|
|
/* after: [list2] -> entries[0] -> entries[1], [list1] -> entries[2] */
|
|
|
|
list_for_each(cur, &list2) {
|
|
KUNIT_EXPECT_PTR_EQ(test, cur, &entries[i]);
|
|
i++;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, 2);
|
|
|
|
list_for_each(cur, &list1) {
|
|
KUNIT_EXPECT_PTR_EQ(test, cur, &entries[i]);
|
|
i++;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, 3);
|
|
}
|
|
|
|
static void list_test_list_cut_before(struct kunit *test)
|
|
{
|
|
struct list_head entries[3], *cur;
|
|
LIST_HEAD(list1);
|
|
LIST_HEAD(list2);
|
|
int i = 0;
|
|
|
|
list_add_tail(&entries[0], &list1);
|
|
list_add_tail(&entries[1], &list1);
|
|
list_add_tail(&entries[2], &list1);
|
|
|
|
/* before: [list1] -> entries[0] -> entries[1] -> entries[2] */
|
|
list_cut_before(&list2, &list1, &entries[1]);
|
|
/* after: [list2] -> entries[0], [list1] -> entries[1] -> entries[2] */
|
|
|
|
list_for_each(cur, &list2) {
|
|
KUNIT_EXPECT_PTR_EQ(test, cur, &entries[i]);
|
|
i++;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, 1);
|
|
|
|
list_for_each(cur, &list1) {
|
|
KUNIT_EXPECT_PTR_EQ(test, cur, &entries[i]);
|
|
i++;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, 3);
|
|
}
|
|
|
|
static void list_test_list_splice(struct kunit *test)
|
|
{
|
|
struct list_head entries[5], *cur;
|
|
LIST_HEAD(list1);
|
|
LIST_HEAD(list2);
|
|
int i = 0;
|
|
|
|
list_add_tail(&entries[0], &list1);
|
|
list_add_tail(&entries[1], &list1);
|
|
list_add_tail(&entries[2], &list2);
|
|
list_add_tail(&entries[3], &list2);
|
|
list_add_tail(&entries[4], &list1);
|
|
|
|
/* before: [list1]->e[0]->e[1]->e[4], [list2]->e[2]->e[3] */
|
|
list_splice(&list2, &entries[1]);
|
|
/* after: [list1]->e[0]->e[1]->e[2]->e[3]->e[4], [list2] uninit */
|
|
|
|
list_for_each(cur, &list1) {
|
|
KUNIT_EXPECT_PTR_EQ(test, cur, &entries[i]);
|
|
i++;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, 5);
|
|
}
|
|
|
|
static void list_test_list_splice_tail(struct kunit *test)
|
|
{
|
|
struct list_head entries[5], *cur;
|
|
LIST_HEAD(list1);
|
|
LIST_HEAD(list2);
|
|
int i = 0;
|
|
|
|
list_add_tail(&entries[0], &list1);
|
|
list_add_tail(&entries[1], &list1);
|
|
list_add_tail(&entries[2], &list2);
|
|
list_add_tail(&entries[3], &list2);
|
|
list_add_tail(&entries[4], &list1);
|
|
|
|
/* before: [list1]->e[0]->e[1]->e[4], [list2]->e[2]->e[3] */
|
|
list_splice_tail(&list2, &entries[4]);
|
|
/* after: [list1]->e[0]->e[1]->e[2]->e[3]->e[4], [list2] uninit */
|
|
|
|
list_for_each(cur, &list1) {
|
|
KUNIT_EXPECT_PTR_EQ(test, cur, &entries[i]);
|
|
i++;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, 5);
|
|
}
|
|
|
|
static void list_test_list_splice_init(struct kunit *test)
|
|
{
|
|
struct list_head entries[5], *cur;
|
|
LIST_HEAD(list1);
|
|
LIST_HEAD(list2);
|
|
int i = 0;
|
|
|
|
list_add_tail(&entries[0], &list1);
|
|
list_add_tail(&entries[1], &list1);
|
|
list_add_tail(&entries[2], &list2);
|
|
list_add_tail(&entries[3], &list2);
|
|
list_add_tail(&entries[4], &list1);
|
|
|
|
/* before: [list1]->e[0]->e[1]->e[4], [list2]->e[2]->e[3] */
|
|
list_splice_init(&list2, &entries[1]);
|
|
/* after: [list1]->e[0]->e[1]->e[2]->e[3]->e[4], [list2] empty */
|
|
|
|
list_for_each(cur, &list1) {
|
|
KUNIT_EXPECT_PTR_EQ(test, cur, &entries[i]);
|
|
i++;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, 5);
|
|
|
|
KUNIT_EXPECT_TRUE(test, list_empty_careful(&list2));
|
|
}
|
|
|
|
static void list_test_list_splice_tail_init(struct kunit *test)
|
|
{
|
|
struct list_head entries[5], *cur;
|
|
LIST_HEAD(list1);
|
|
LIST_HEAD(list2);
|
|
int i = 0;
|
|
|
|
list_add_tail(&entries[0], &list1);
|
|
list_add_tail(&entries[1], &list1);
|
|
list_add_tail(&entries[2], &list2);
|
|
list_add_tail(&entries[3], &list2);
|
|
list_add_tail(&entries[4], &list1);
|
|
|
|
/* before: [list1]->e[0]->e[1]->e[4], [list2]->e[2]->e[3] */
|
|
list_splice_tail_init(&list2, &entries[4]);
|
|
/* after: [list1]->e[0]->e[1]->e[2]->e[3]->e[4], [list2] empty */
|
|
|
|
list_for_each(cur, &list1) {
|
|
KUNIT_EXPECT_PTR_EQ(test, cur, &entries[i]);
|
|
i++;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, 5);
|
|
|
|
KUNIT_EXPECT_TRUE(test, list_empty_careful(&list2));
|
|
}
|
|
|
|
static void list_test_list_entry(struct kunit *test)
|
|
{
|
|
struct list_test_struct test_struct;
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, &test_struct, list_entry(&(test_struct.list),
|
|
struct list_test_struct, list));
|
|
}
|
|
|
|
static void list_test_list_entry_is_head(struct kunit *test)
|
|
{
|
|
struct list_test_struct test_struct1, test_struct2, test_struct3;
|
|
|
|
INIT_LIST_HEAD(&test_struct1.list);
|
|
INIT_LIST_HEAD(&test_struct3.list);
|
|
|
|
list_add_tail(&test_struct2.list, &test_struct1.list);
|
|
|
|
KUNIT_EXPECT_TRUE_MSG(test,
|
|
list_entry_is_head((&test_struct1), &test_struct1.list, list),
|
|
"Head element of same list");
|
|
KUNIT_EXPECT_FALSE_MSG(test,
|
|
list_entry_is_head((&test_struct2), &test_struct1.list, list),
|
|
"Non-head element of same list");
|
|
KUNIT_EXPECT_FALSE_MSG(test,
|
|
list_entry_is_head((&test_struct3), &test_struct1.list, list),
|
|
"Head element of different list");
|
|
}
|
|
|
|
static void list_test_list_first_entry(struct kunit *test)
|
|
{
|
|
struct list_test_struct test_struct1, test_struct2;
|
|
LIST_HEAD(list);
|
|
|
|
list_add_tail(&test_struct1.list, &list);
|
|
list_add_tail(&test_struct2.list, &list);
|
|
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, &test_struct1, list_first_entry(&list,
|
|
struct list_test_struct, list));
|
|
}
|
|
|
|
static void list_test_list_last_entry(struct kunit *test)
|
|
{
|
|
struct list_test_struct test_struct1, test_struct2;
|
|
LIST_HEAD(list);
|
|
|
|
list_add_tail(&test_struct1.list, &list);
|
|
list_add_tail(&test_struct2.list, &list);
|
|
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, &test_struct2, list_last_entry(&list,
|
|
struct list_test_struct, list));
|
|
}
|
|
|
|
static void list_test_list_first_entry_or_null(struct kunit *test)
|
|
{
|
|
struct list_test_struct test_struct1, test_struct2;
|
|
LIST_HEAD(list);
|
|
|
|
KUNIT_EXPECT_FALSE(test, list_first_entry_or_null(&list,
|
|
struct list_test_struct, list));
|
|
|
|
list_add_tail(&test_struct1.list, &list);
|
|
list_add_tail(&test_struct2.list, &list);
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, &test_struct1,
|
|
list_first_entry_or_null(&list,
|
|
struct list_test_struct, list));
|
|
}
|
|
|
|
static void list_test_list_next_entry(struct kunit *test)
|
|
{
|
|
struct list_test_struct test_struct1, test_struct2;
|
|
LIST_HEAD(list);
|
|
|
|
list_add_tail(&test_struct1.list, &list);
|
|
list_add_tail(&test_struct2.list, &list);
|
|
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, &test_struct2, list_next_entry(&test_struct1,
|
|
list));
|
|
}
|
|
|
|
static void list_test_list_prev_entry(struct kunit *test)
|
|
{
|
|
struct list_test_struct test_struct1, test_struct2;
|
|
LIST_HEAD(list);
|
|
|
|
list_add_tail(&test_struct1.list, &list);
|
|
list_add_tail(&test_struct2.list, &list);
|
|
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, &test_struct1, list_prev_entry(&test_struct2,
|
|
list));
|
|
}
|
|
|
|
static void list_test_list_for_each(struct kunit *test)
|
|
{
|
|
struct list_head entries[3], *cur;
|
|
LIST_HEAD(list);
|
|
int i = 0;
|
|
|
|
list_add_tail(&entries[0], &list);
|
|
list_add_tail(&entries[1], &list);
|
|
list_add_tail(&entries[2], &list);
|
|
|
|
list_for_each(cur, &list) {
|
|
KUNIT_EXPECT_PTR_EQ(test, cur, &entries[i]);
|
|
i++;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, 3);
|
|
}
|
|
|
|
static void list_test_list_for_each_prev(struct kunit *test)
|
|
{
|
|
struct list_head entries[3], *cur;
|
|
LIST_HEAD(list);
|
|
int i = 2;
|
|
|
|
list_add_tail(&entries[0], &list);
|
|
list_add_tail(&entries[1], &list);
|
|
list_add_tail(&entries[2], &list);
|
|
|
|
list_for_each_prev(cur, &list) {
|
|
KUNIT_EXPECT_PTR_EQ(test, cur, &entries[i]);
|
|
i--;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, -1);
|
|
}
|
|
|
|
static void list_test_list_for_each_safe(struct kunit *test)
|
|
{
|
|
struct list_head entries[3], *cur, *n;
|
|
LIST_HEAD(list);
|
|
int i = 0;
|
|
|
|
|
|
list_add_tail(&entries[0], &list);
|
|
list_add_tail(&entries[1], &list);
|
|
list_add_tail(&entries[2], &list);
|
|
|
|
list_for_each_safe(cur, n, &list) {
|
|
KUNIT_EXPECT_PTR_EQ(test, cur, &entries[i]);
|
|
list_del(&entries[i]);
|
|
i++;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, 3);
|
|
KUNIT_EXPECT_TRUE(test, list_empty(&list));
|
|
}
|
|
|
|
static void list_test_list_for_each_prev_safe(struct kunit *test)
|
|
{
|
|
struct list_head entries[3], *cur, *n;
|
|
LIST_HEAD(list);
|
|
int i = 2;
|
|
|
|
list_add_tail(&entries[0], &list);
|
|
list_add_tail(&entries[1], &list);
|
|
list_add_tail(&entries[2], &list);
|
|
|
|
list_for_each_prev_safe(cur, n, &list) {
|
|
KUNIT_EXPECT_PTR_EQ(test, cur, &entries[i]);
|
|
list_del(&entries[i]);
|
|
i--;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, -1);
|
|
KUNIT_EXPECT_TRUE(test, list_empty(&list));
|
|
}
|
|
|
|
static void list_test_list_for_each_entry(struct kunit *test)
|
|
{
|
|
struct list_test_struct entries[5], *cur;
|
|
LIST_HEAD(list);
|
|
int i = 0;
|
|
|
|
for (i = 0; i < 5; ++i) {
|
|
entries[i].data = i;
|
|
list_add_tail(&entries[i].list, &list);
|
|
}
|
|
|
|
i = 0;
|
|
|
|
list_for_each_entry(cur, &list, list) {
|
|
KUNIT_EXPECT_EQ(test, cur->data, i);
|
|
i++;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, 5);
|
|
}
|
|
|
|
static void list_test_list_for_each_entry_reverse(struct kunit *test)
|
|
{
|
|
struct list_test_struct entries[5], *cur;
|
|
LIST_HEAD(list);
|
|
int i = 0;
|
|
|
|
for (i = 0; i < 5; ++i) {
|
|
entries[i].data = i;
|
|
list_add_tail(&entries[i].list, &list);
|
|
}
|
|
|
|
i = 4;
|
|
|
|
list_for_each_entry_reverse(cur, &list, list) {
|
|
KUNIT_EXPECT_EQ(test, cur->data, i);
|
|
i--;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, -1);
|
|
}
|
|
|
|
static struct kunit_case list_test_cases[] = {
|
|
KUNIT_CASE(list_test_list_init),
|
|
KUNIT_CASE(list_test_list_add),
|
|
KUNIT_CASE(list_test_list_add_tail),
|
|
KUNIT_CASE(list_test_list_del),
|
|
KUNIT_CASE(list_test_list_replace),
|
|
KUNIT_CASE(list_test_list_replace_init),
|
|
KUNIT_CASE(list_test_list_swap),
|
|
KUNIT_CASE(list_test_list_del_init),
|
|
KUNIT_CASE(list_test_list_del_init_careful),
|
|
KUNIT_CASE(list_test_list_move),
|
|
KUNIT_CASE(list_test_list_move_tail),
|
|
KUNIT_CASE(list_test_list_bulk_move_tail),
|
|
KUNIT_CASE(list_test_list_is_head),
|
|
KUNIT_CASE(list_test_list_is_first),
|
|
KUNIT_CASE(list_test_list_is_last),
|
|
KUNIT_CASE(list_test_list_empty),
|
|
KUNIT_CASE(list_test_list_empty_careful),
|
|
KUNIT_CASE(list_test_list_rotate_left),
|
|
KUNIT_CASE(list_test_list_rotate_to_front),
|
|
KUNIT_CASE(list_test_list_is_singular),
|
|
KUNIT_CASE(list_test_list_cut_position),
|
|
KUNIT_CASE(list_test_list_cut_before),
|
|
KUNIT_CASE(list_test_list_splice),
|
|
KUNIT_CASE(list_test_list_splice_tail),
|
|
KUNIT_CASE(list_test_list_splice_init),
|
|
KUNIT_CASE(list_test_list_splice_tail_init),
|
|
KUNIT_CASE(list_test_list_entry),
|
|
KUNIT_CASE(list_test_list_entry_is_head),
|
|
KUNIT_CASE(list_test_list_first_entry),
|
|
KUNIT_CASE(list_test_list_last_entry),
|
|
KUNIT_CASE(list_test_list_first_entry_or_null),
|
|
KUNIT_CASE(list_test_list_next_entry),
|
|
KUNIT_CASE(list_test_list_prev_entry),
|
|
KUNIT_CASE(list_test_list_for_each),
|
|
KUNIT_CASE(list_test_list_for_each_prev),
|
|
KUNIT_CASE(list_test_list_for_each_safe),
|
|
KUNIT_CASE(list_test_list_for_each_prev_safe),
|
|
KUNIT_CASE(list_test_list_for_each_entry),
|
|
KUNIT_CASE(list_test_list_for_each_entry_reverse),
|
|
{},
|
|
};
|
|
|
|
static struct kunit_suite list_test_module = {
|
|
.name = "list-kunit-test",
|
|
.test_cases = list_test_cases,
|
|
};
|
|
|
|
struct hlist_test_struct {
|
|
int data;
|
|
struct hlist_node list;
|
|
};
|
|
|
|
static void hlist_test_init(struct kunit *test)
|
|
{
|
|
/* Test the different ways of initialising a list. */
|
|
struct hlist_head list1 = HLIST_HEAD_INIT;
|
|
struct hlist_head list2;
|
|
HLIST_HEAD(list3);
|
|
struct hlist_head *list4;
|
|
struct hlist_head *list5;
|
|
|
|
INIT_HLIST_HEAD(&list2);
|
|
|
|
list4 = kzalloc(sizeof(*list4), GFP_KERNEL | __GFP_NOFAIL);
|
|
INIT_HLIST_HEAD(list4);
|
|
|
|
list5 = kmalloc(sizeof(*list5), GFP_KERNEL | __GFP_NOFAIL);
|
|
memset(list5, 0xFF, sizeof(*list5));
|
|
INIT_HLIST_HEAD(list5);
|
|
|
|
KUNIT_EXPECT_TRUE(test, hlist_empty(&list1));
|
|
KUNIT_EXPECT_TRUE(test, hlist_empty(&list2));
|
|
KUNIT_EXPECT_TRUE(test, hlist_empty(&list3));
|
|
KUNIT_EXPECT_TRUE(test, hlist_empty(list4));
|
|
KUNIT_EXPECT_TRUE(test, hlist_empty(list5));
|
|
|
|
kfree(list4);
|
|
kfree(list5);
|
|
}
|
|
|
|
static void hlist_test_unhashed(struct kunit *test)
|
|
{
|
|
struct hlist_node a;
|
|
HLIST_HEAD(list);
|
|
|
|
INIT_HLIST_NODE(&a);
|
|
|
|
/* is unhashed by default */
|
|
KUNIT_EXPECT_TRUE(test, hlist_unhashed(&a));
|
|
|
|
hlist_add_head(&a, &list);
|
|
|
|
/* is hashed once added to list */
|
|
KUNIT_EXPECT_FALSE(test, hlist_unhashed(&a));
|
|
|
|
hlist_del_init(&a);
|
|
|
|
/* is again unhashed after del_init */
|
|
KUNIT_EXPECT_TRUE(test, hlist_unhashed(&a));
|
|
}
|
|
|
|
/* Doesn't test concurrency guarantees */
|
|
static void hlist_test_unhashed_lockless(struct kunit *test)
|
|
{
|
|
struct hlist_node a;
|
|
HLIST_HEAD(list);
|
|
|
|
INIT_HLIST_NODE(&a);
|
|
|
|
/* is unhashed by default */
|
|
KUNIT_EXPECT_TRUE(test, hlist_unhashed_lockless(&a));
|
|
|
|
hlist_add_head(&a, &list);
|
|
|
|
/* is hashed once added to list */
|
|
KUNIT_EXPECT_FALSE(test, hlist_unhashed_lockless(&a));
|
|
|
|
hlist_del_init(&a);
|
|
|
|
/* is again unhashed after del_init */
|
|
KUNIT_EXPECT_TRUE(test, hlist_unhashed_lockless(&a));
|
|
}
|
|
|
|
static void hlist_test_del(struct kunit *test)
|
|
{
|
|
struct hlist_node a, b;
|
|
HLIST_HEAD(list);
|
|
|
|
hlist_add_head(&a, &list);
|
|
hlist_add_behind(&b, &a);
|
|
|
|
/* before: [list] -> a -> b */
|
|
hlist_del(&a);
|
|
|
|
/* now: [list] -> b */
|
|
KUNIT_EXPECT_PTR_EQ(test, list.first, &b);
|
|
KUNIT_EXPECT_PTR_EQ(test, b.pprev, &list.first);
|
|
}
|
|
|
|
static void hlist_test_del_init(struct kunit *test)
|
|
{
|
|
struct hlist_node a, b;
|
|
HLIST_HEAD(list);
|
|
|
|
hlist_add_head(&a, &list);
|
|
hlist_add_behind(&b, &a);
|
|
|
|
/* before: [list] -> a -> b */
|
|
hlist_del_init(&a);
|
|
|
|
/* now: [list] -> b */
|
|
KUNIT_EXPECT_PTR_EQ(test, list.first, &b);
|
|
KUNIT_EXPECT_PTR_EQ(test, b.pprev, &list.first);
|
|
|
|
/* a is now initialised */
|
|
KUNIT_EXPECT_PTR_EQ(test, a.next, NULL);
|
|
KUNIT_EXPECT_PTR_EQ(test, a.pprev, NULL);
|
|
}
|
|
|
|
/* Tests all three hlist_add_* functions */
|
|
static void hlist_test_add(struct kunit *test)
|
|
{
|
|
struct hlist_node a, b, c, d;
|
|
HLIST_HEAD(list);
|
|
|
|
hlist_add_head(&a, &list);
|
|
hlist_add_head(&b, &list);
|
|
hlist_add_before(&c, &a);
|
|
hlist_add_behind(&d, &a);
|
|
|
|
/* should be [list] -> b -> c -> a -> d */
|
|
KUNIT_EXPECT_PTR_EQ(test, list.first, &b);
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, c.pprev, &(b.next));
|
|
KUNIT_EXPECT_PTR_EQ(test, b.next, &c);
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, a.pprev, &(c.next));
|
|
KUNIT_EXPECT_PTR_EQ(test, c.next, &a);
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, d.pprev, &(a.next));
|
|
KUNIT_EXPECT_PTR_EQ(test, a.next, &d);
|
|
}
|
|
|
|
/* Tests both hlist_fake() and hlist_add_fake() */
|
|
static void hlist_test_fake(struct kunit *test)
|
|
{
|
|
struct hlist_node a;
|
|
|
|
INIT_HLIST_NODE(&a);
|
|
|
|
/* not fake after init */
|
|
KUNIT_EXPECT_FALSE(test, hlist_fake(&a));
|
|
|
|
hlist_add_fake(&a);
|
|
|
|
/* is now fake */
|
|
KUNIT_EXPECT_TRUE(test, hlist_fake(&a));
|
|
}
|
|
|
|
static void hlist_test_is_singular_node(struct kunit *test)
|
|
{
|
|
struct hlist_node a, b;
|
|
HLIST_HEAD(list);
|
|
|
|
INIT_HLIST_NODE(&a);
|
|
KUNIT_EXPECT_FALSE(test, hlist_is_singular_node(&a, &list));
|
|
|
|
hlist_add_head(&a, &list);
|
|
KUNIT_EXPECT_TRUE(test, hlist_is_singular_node(&a, &list));
|
|
|
|
hlist_add_head(&b, &list);
|
|
KUNIT_EXPECT_FALSE(test, hlist_is_singular_node(&a, &list));
|
|
KUNIT_EXPECT_FALSE(test, hlist_is_singular_node(&b, &list));
|
|
}
|
|
|
|
static void hlist_test_empty(struct kunit *test)
|
|
{
|
|
struct hlist_node a;
|
|
HLIST_HEAD(list);
|
|
|
|
/* list starts off empty */
|
|
KUNIT_EXPECT_TRUE(test, hlist_empty(&list));
|
|
|
|
hlist_add_head(&a, &list);
|
|
|
|
/* list is no longer empty */
|
|
KUNIT_EXPECT_FALSE(test, hlist_empty(&list));
|
|
}
|
|
|
|
static void hlist_test_move_list(struct kunit *test)
|
|
{
|
|
struct hlist_node a;
|
|
HLIST_HEAD(list1);
|
|
HLIST_HEAD(list2);
|
|
|
|
hlist_add_head(&a, &list1);
|
|
|
|
KUNIT_EXPECT_FALSE(test, hlist_empty(&list1));
|
|
KUNIT_EXPECT_TRUE(test, hlist_empty(&list2));
|
|
hlist_move_list(&list1, &list2);
|
|
KUNIT_EXPECT_TRUE(test, hlist_empty(&list1));
|
|
KUNIT_EXPECT_FALSE(test, hlist_empty(&list2));
|
|
|
|
}
|
|
|
|
static void hlist_test_entry(struct kunit *test)
|
|
{
|
|
struct hlist_test_struct test_struct;
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, &test_struct,
|
|
hlist_entry(&(test_struct.list),
|
|
struct hlist_test_struct, list));
|
|
}
|
|
|
|
static void hlist_test_entry_safe(struct kunit *test)
|
|
{
|
|
struct hlist_test_struct test_struct;
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, &test_struct,
|
|
hlist_entry_safe(&(test_struct.list),
|
|
struct hlist_test_struct, list));
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, NULL,
|
|
hlist_entry_safe((struct hlist_node *)NULL,
|
|
struct hlist_test_struct, list));
|
|
}
|
|
|
|
static void hlist_test_for_each(struct kunit *test)
|
|
{
|
|
struct hlist_node entries[3], *cur;
|
|
HLIST_HEAD(list);
|
|
int i = 0;
|
|
|
|
hlist_add_head(&entries[0], &list);
|
|
hlist_add_behind(&entries[1], &entries[0]);
|
|
hlist_add_behind(&entries[2], &entries[1]);
|
|
|
|
hlist_for_each(cur, &list) {
|
|
KUNIT_EXPECT_PTR_EQ(test, cur, &entries[i]);
|
|
i++;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, 3);
|
|
}
|
|
|
|
|
|
static void hlist_test_for_each_safe(struct kunit *test)
|
|
{
|
|
struct hlist_node entries[3], *cur, *n;
|
|
HLIST_HEAD(list);
|
|
int i = 0;
|
|
|
|
hlist_add_head(&entries[0], &list);
|
|
hlist_add_behind(&entries[1], &entries[0]);
|
|
hlist_add_behind(&entries[2], &entries[1]);
|
|
|
|
hlist_for_each_safe(cur, n, &list) {
|
|
KUNIT_EXPECT_PTR_EQ(test, cur, &entries[i]);
|
|
hlist_del(&entries[i]);
|
|
i++;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, 3);
|
|
KUNIT_EXPECT_TRUE(test, hlist_empty(&list));
|
|
}
|
|
|
|
static void hlist_test_for_each_entry(struct kunit *test)
|
|
{
|
|
struct hlist_test_struct entries[5], *cur;
|
|
HLIST_HEAD(list);
|
|
int i = 0;
|
|
|
|
entries[0].data = 0;
|
|
hlist_add_head(&entries[0].list, &list);
|
|
for (i = 1; i < 5; ++i) {
|
|
entries[i].data = i;
|
|
hlist_add_behind(&entries[i].list, &entries[i-1].list);
|
|
}
|
|
|
|
i = 0;
|
|
|
|
hlist_for_each_entry(cur, &list, list) {
|
|
KUNIT_EXPECT_EQ(test, cur->data, i);
|
|
i++;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, 5);
|
|
}
|
|
|
|
static void hlist_test_for_each_entry_continue(struct kunit *test)
|
|
{
|
|
struct hlist_test_struct entries[5], *cur;
|
|
HLIST_HEAD(list);
|
|
int i = 0;
|
|
|
|
entries[0].data = 0;
|
|
hlist_add_head(&entries[0].list, &list);
|
|
for (i = 1; i < 5; ++i) {
|
|
entries[i].data = i;
|
|
hlist_add_behind(&entries[i].list, &entries[i-1].list);
|
|
}
|
|
|
|
/* We skip the first (zero-th) entry. */
|
|
i = 1;
|
|
|
|
cur = &entries[0];
|
|
hlist_for_each_entry_continue(cur, list) {
|
|
KUNIT_EXPECT_EQ(test, cur->data, i);
|
|
/* Stamp over the entry. */
|
|
cur->data = 42;
|
|
i++;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, 5);
|
|
/* The first entry was not visited. */
|
|
KUNIT_EXPECT_EQ(test, entries[0].data, 0);
|
|
/* The second (and presumably others), were. */
|
|
KUNIT_EXPECT_EQ(test, entries[1].data, 42);
|
|
}
|
|
|
|
static void hlist_test_for_each_entry_from(struct kunit *test)
|
|
{
|
|
struct hlist_test_struct entries[5], *cur;
|
|
HLIST_HEAD(list);
|
|
int i = 0;
|
|
|
|
entries[0].data = 0;
|
|
hlist_add_head(&entries[0].list, &list);
|
|
for (i = 1; i < 5; ++i) {
|
|
entries[i].data = i;
|
|
hlist_add_behind(&entries[i].list, &entries[i-1].list);
|
|
}
|
|
|
|
i = 0;
|
|
|
|
cur = &entries[0];
|
|
hlist_for_each_entry_from(cur, list) {
|
|
KUNIT_EXPECT_EQ(test, cur->data, i);
|
|
/* Stamp over the entry. */
|
|
cur->data = 42;
|
|
i++;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, 5);
|
|
/* The first entry was visited. */
|
|
KUNIT_EXPECT_EQ(test, entries[0].data, 42);
|
|
}
|
|
|
|
static void hlist_test_for_each_entry_safe(struct kunit *test)
|
|
{
|
|
struct hlist_test_struct entries[5], *cur;
|
|
struct hlist_node *tmp_node;
|
|
HLIST_HEAD(list);
|
|
int i = 0;
|
|
|
|
entries[0].data = 0;
|
|
hlist_add_head(&entries[0].list, &list);
|
|
for (i = 1; i < 5; ++i) {
|
|
entries[i].data = i;
|
|
hlist_add_behind(&entries[i].list, &entries[i-1].list);
|
|
}
|
|
|
|
i = 0;
|
|
|
|
hlist_for_each_entry_safe(cur, tmp_node, &list, list) {
|
|
KUNIT_EXPECT_EQ(test, cur->data, i);
|
|
hlist_del(&cur->list);
|
|
i++;
|
|
}
|
|
|
|
KUNIT_EXPECT_EQ(test, i, 5);
|
|
KUNIT_EXPECT_TRUE(test, hlist_empty(&list));
|
|
}
|
|
|
|
|
|
static struct kunit_case hlist_test_cases[] = {
|
|
KUNIT_CASE(hlist_test_init),
|
|
KUNIT_CASE(hlist_test_unhashed),
|
|
KUNIT_CASE(hlist_test_unhashed_lockless),
|
|
KUNIT_CASE(hlist_test_del),
|
|
KUNIT_CASE(hlist_test_del_init),
|
|
KUNIT_CASE(hlist_test_add),
|
|
KUNIT_CASE(hlist_test_fake),
|
|
KUNIT_CASE(hlist_test_is_singular_node),
|
|
KUNIT_CASE(hlist_test_empty),
|
|
KUNIT_CASE(hlist_test_move_list),
|
|
KUNIT_CASE(hlist_test_entry),
|
|
KUNIT_CASE(hlist_test_entry_safe),
|
|
KUNIT_CASE(hlist_test_for_each),
|
|
KUNIT_CASE(hlist_test_for_each_safe),
|
|
KUNIT_CASE(hlist_test_for_each_entry),
|
|
KUNIT_CASE(hlist_test_for_each_entry_continue),
|
|
KUNIT_CASE(hlist_test_for_each_entry_from),
|
|
KUNIT_CASE(hlist_test_for_each_entry_safe),
|
|
{},
|
|
};
|
|
|
|
static struct kunit_suite hlist_test_module = {
|
|
.name = "hlist",
|
|
.test_cases = hlist_test_cases,
|
|
};
|
|
|
|
|
|
static int node_count;
|
|
static struct klist_node *last_node;
|
|
|
|
static void check_node(struct klist_node *node_ptr)
|
|
{
|
|
node_count++;
|
|
last_node = node_ptr;
|
|
}
|
|
|
|
static void check_delete_node(struct klist_node *node_ptr)
|
|
{
|
|
node_count--;
|
|
last_node = node_ptr;
|
|
}
|
|
|
|
static void klist_test_add_tail(struct kunit *test)
|
|
{
|
|
struct klist_node a, b;
|
|
struct klist mylist;
|
|
struct klist_iter i;
|
|
|
|
node_count = 0;
|
|
klist_init(&mylist, &check_node, NULL);
|
|
|
|
klist_add_tail(&a, &mylist);
|
|
KUNIT_EXPECT_EQ(test, node_count, 1);
|
|
KUNIT_EXPECT_PTR_EQ(test, last_node, &a);
|
|
|
|
klist_add_tail(&b, &mylist);
|
|
KUNIT_EXPECT_EQ(test, node_count, 2);
|
|
KUNIT_EXPECT_PTR_EQ(test, last_node, &b);
|
|
|
|
/* should be [list] -> a -> b */
|
|
klist_iter_init(&mylist, &i);
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &a);
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &b);
|
|
KUNIT_EXPECT_NULL(test, klist_next(&i));
|
|
|
|
klist_iter_exit(&i);
|
|
|
|
}
|
|
|
|
static void klist_test_add_head(struct kunit *test)
|
|
{
|
|
struct klist_node a, b;
|
|
struct klist mylist;
|
|
struct klist_iter i;
|
|
|
|
node_count = 0;
|
|
klist_init(&mylist, &check_node, NULL);
|
|
|
|
klist_add_head(&a, &mylist);
|
|
KUNIT_EXPECT_EQ(test, node_count, 1);
|
|
KUNIT_EXPECT_PTR_EQ(test, last_node, &a);
|
|
|
|
klist_add_head(&b, &mylist);
|
|
KUNIT_EXPECT_EQ(test, node_count, 2);
|
|
KUNIT_EXPECT_PTR_EQ(test, last_node, &b);
|
|
|
|
/* should be [list] -> b -> a */
|
|
klist_iter_init(&mylist, &i);
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &b);
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &a);
|
|
KUNIT_EXPECT_NULL(test, klist_next(&i));
|
|
|
|
klist_iter_exit(&i);
|
|
|
|
}
|
|
|
|
static void klist_test_add_behind(struct kunit *test)
|
|
{
|
|
struct klist_node a, b, c, d;
|
|
struct klist mylist;
|
|
struct klist_iter i;
|
|
|
|
node_count = 0;
|
|
klist_init(&mylist, &check_node, NULL);
|
|
|
|
klist_add_head(&a, &mylist);
|
|
klist_add_head(&b, &mylist);
|
|
|
|
klist_add_behind(&c, &a);
|
|
KUNIT_EXPECT_EQ(test, node_count, 3);
|
|
KUNIT_EXPECT_PTR_EQ(test, last_node, &c);
|
|
|
|
klist_add_behind(&d, &b);
|
|
KUNIT_EXPECT_EQ(test, node_count, 4);
|
|
KUNIT_EXPECT_PTR_EQ(test, last_node, &d);
|
|
|
|
klist_iter_init(&mylist, &i);
|
|
|
|
/* should be [list] -> b -> d -> a -> c*/
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &b);
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &d);
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &a);
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &c);
|
|
KUNIT_EXPECT_NULL(test, klist_next(&i));
|
|
|
|
klist_iter_exit(&i);
|
|
|
|
}
|
|
|
|
static void klist_test_add_before(struct kunit *test)
|
|
{
|
|
struct klist_node a, b, c, d;
|
|
struct klist mylist;
|
|
struct klist_iter i;
|
|
|
|
node_count = 0;
|
|
klist_init(&mylist, &check_node, NULL);
|
|
|
|
klist_add_head(&a, &mylist);
|
|
klist_add_head(&b, &mylist);
|
|
klist_add_before(&c, &a);
|
|
KUNIT_EXPECT_EQ(test, node_count, 3);
|
|
KUNIT_EXPECT_PTR_EQ(test, last_node, &c);
|
|
|
|
klist_add_before(&d, &b);
|
|
KUNIT_EXPECT_EQ(test, node_count, 4);
|
|
KUNIT_EXPECT_PTR_EQ(test, last_node, &d);
|
|
|
|
klist_iter_init(&mylist, &i);
|
|
|
|
/* should be [list] -> b -> d -> a -> c*/
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &d);
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &b);
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &c);
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &a);
|
|
KUNIT_EXPECT_NULL(test, klist_next(&i));
|
|
|
|
klist_iter_exit(&i);
|
|
|
|
}
|
|
|
|
/*
|
|
* Verify that klist_del() delays the deletion of a node until there
|
|
* are no other references to it
|
|
*/
|
|
static void klist_test_del_refcount_greater_than_zero(struct kunit *test)
|
|
{
|
|
struct klist_node a, b, c, d;
|
|
struct klist mylist;
|
|
struct klist_iter i;
|
|
|
|
node_count = 0;
|
|
klist_init(&mylist, &check_node, &check_delete_node);
|
|
|
|
/* Add nodes a,b,c,d to the list*/
|
|
klist_add_tail(&a, &mylist);
|
|
klist_add_tail(&b, &mylist);
|
|
klist_add_tail(&c, &mylist);
|
|
klist_add_tail(&d, &mylist);
|
|
|
|
klist_iter_init(&mylist, &i);
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &a);
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &b);
|
|
/* Advance the iterator to point to node c*/
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &c);
|
|
|
|
/* Try to delete node c while there is a reference to it*/
|
|
klist_del(&c);
|
|
|
|
/*
|
|
* Verify that node c is still attached to the list even after being
|
|
* deleted. Since the iterator still points to c, the reference count is not
|
|
* decreased to 0
|
|
*/
|
|
KUNIT_EXPECT_TRUE(test, klist_node_attached(&c));
|
|
|
|
/* Check that node c has not been removed yet*/
|
|
KUNIT_EXPECT_EQ(test, node_count, 4);
|
|
KUNIT_EXPECT_PTR_EQ(test, last_node, &d);
|
|
|
|
klist_iter_exit(&i);
|
|
|
|
/*
|
|
* Since the iterator is no longer pointing to node c, node c is removed
|
|
* from the list
|
|
*/
|
|
KUNIT_EXPECT_EQ(test, node_count, 3);
|
|
KUNIT_EXPECT_PTR_EQ(test, last_node, &c);
|
|
|
|
}
|
|
|
|
/*
|
|
* Verify that klist_del() deletes a node immediately when there are no
|
|
* other references to it.
|
|
*/
|
|
static void klist_test_del_refcount_zero(struct kunit *test)
|
|
{
|
|
struct klist_node a, b, c, d;
|
|
struct klist mylist;
|
|
struct klist_iter i;
|
|
|
|
node_count = 0;
|
|
klist_init(&mylist, &check_node, &check_delete_node);
|
|
|
|
/* Add nodes a,b,c,d to the list*/
|
|
klist_add_tail(&a, &mylist);
|
|
klist_add_tail(&b, &mylist);
|
|
klist_add_tail(&c, &mylist);
|
|
klist_add_tail(&d, &mylist);
|
|
/* Delete node c*/
|
|
klist_del(&c);
|
|
|
|
/* Check that node c is deleted from the list*/
|
|
KUNIT_EXPECT_EQ(test, node_count, 3);
|
|
KUNIT_EXPECT_PTR_EQ(test, last_node, &c);
|
|
|
|
/* Should be [list] -> a -> b -> d*/
|
|
klist_iter_init(&mylist, &i);
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &a);
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &b);
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &d);
|
|
KUNIT_EXPECT_NULL(test, klist_next(&i));
|
|
|
|
klist_iter_exit(&i);
|
|
|
|
}
|
|
|
|
static void klist_test_remove(struct kunit *test)
|
|
{
|
|
/* This test doesn't check correctness under concurrent access */
|
|
struct klist_node a, b, c, d;
|
|
struct klist mylist;
|
|
struct klist_iter i;
|
|
|
|
node_count = 0;
|
|
klist_init(&mylist, &check_node, &check_delete_node);
|
|
|
|
/* Add nodes a,b,c,d to the list*/
|
|
klist_add_tail(&a, &mylist);
|
|
klist_add_tail(&b, &mylist);
|
|
klist_add_tail(&c, &mylist);
|
|
klist_add_tail(&d, &mylist);
|
|
/* Delete node c*/
|
|
klist_remove(&c);
|
|
|
|
/* Check the nodes in the list*/
|
|
KUNIT_EXPECT_EQ(test, node_count, 3);
|
|
KUNIT_EXPECT_PTR_EQ(test, last_node, &c);
|
|
|
|
/* should be [list] -> a -> b -> d*/
|
|
klist_iter_init(&mylist, &i);
|
|
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &a);
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &b);
|
|
KUNIT_EXPECT_PTR_EQ(test, klist_next(&i), &d);
|
|
KUNIT_EXPECT_NULL(test, klist_next(&i));
|
|
|
|
klist_iter_exit(&i);
|
|
|
|
}
|
|
|
|
static void klist_test_node_attached(struct kunit *test)
|
|
{
|
|
struct klist_node a = {};
|
|
struct klist mylist;
|
|
|
|
klist_init(&mylist, NULL, NULL);
|
|
|
|
KUNIT_EXPECT_FALSE(test, klist_node_attached(&a));
|
|
klist_add_head(&a, &mylist);
|
|
KUNIT_EXPECT_TRUE(test, klist_node_attached(&a));
|
|
klist_del(&a);
|
|
KUNIT_EXPECT_FALSE(test, klist_node_attached(&a));
|
|
|
|
}
|
|
|
|
static struct kunit_case klist_test_cases[] = {
|
|
KUNIT_CASE(klist_test_add_tail),
|
|
KUNIT_CASE(klist_test_add_head),
|
|
KUNIT_CASE(klist_test_add_behind),
|
|
KUNIT_CASE(klist_test_add_before),
|
|
KUNIT_CASE(klist_test_del_refcount_greater_than_zero),
|
|
KUNIT_CASE(klist_test_del_refcount_zero),
|
|
KUNIT_CASE(klist_test_remove),
|
|
KUNIT_CASE(klist_test_node_attached),
|
|
{},
|
|
};
|
|
|
|
static struct kunit_suite klist_test_module = {
|
|
.name = "klist",
|
|
.test_cases = klist_test_cases,
|
|
};
|
|
|
|
kunit_test_suites(&list_test_module, &hlist_test_module, &klist_test_module);
|
|
|
|
MODULE_DESCRIPTION("KUnit test for the Kernel Linked-list structures");
|
|
MODULE_LICENSE("GPL v2");
|