| 1 |
# Copyright (c) 2022, Oracle and/or its affiliates. |
| 2 |
# SPDX-License-Identifier: LGPL-2.1-or-later |
| 3 |
|
| 4 |
from drgn import NULL |
| 5 |
from drgn.helpers.linux.llist import ( |
| 6 |
llist_empty, |
| 7 |
llist_first_entry, |
| 8 |
llist_first_entry_or_null, |
| 9 |
llist_for_each, |
| 10 |
llist_for_each_entry, |
| 11 |
llist_is_singular, |
| 12 |
llist_next_entry, |
| 13 |
) |
| 14 |
from tests.linux_kernel import LinuxKernelTestCase, skip_unless_have_test_kmod |
| 15 |
|
| 16 |
|
| 17 |
@skip_unless_have_test_kmod |
| 18 |
class TestLlist(LinuxKernelTestCase): |
| 19 |
@classmethod |
| 20 |
def setUpClass(cls): |
| 21 |
super().setUpClass() |
| 22 |
cls.empty = cls.prog["drgn_test_empty_llist"].address_of_() |
| 23 |
cls.full = cls.prog["drgn_test_full_llist"].address_of_() |
| 24 |
cls.entries = cls.prog["drgn_test_llist_entries"] |
| 25 |
cls.num_entries = 3 |
| 26 |
cls.singular = cls.prog["drgn_test_singular_llist"].address_of_() |
| 27 |
cls.singular_entry = cls.prog["drgn_test_singular_llist_entry"].address_of_() |
| 28 |
cls.singular_node = cls.singular_entry.node.address_of_() |
| 29 |
|
| 30 |
def node(self, n): |
| 31 |
return self.entries[n].node.address_of_() |
| 32 |
|
| 33 |
def entry(self, n): |
| 34 |
return self.entries[n].address_of_() |
| 35 |
|
| 36 |
def test_llist_empty(self): |
| 37 |
self.assertTrue(llist_empty(self.empty)) |
| 38 |
self.assertFalse(llist_empty(self.full)) |
| 39 |
self.assertFalse(llist_empty(self.singular)) |
| 40 |
|
| 41 |
def test_llist_is_singular(self): |
| 42 |
self.assertFalse(llist_is_singular(self.empty)) |
| 43 |
self.assertFalse(llist_is_singular(self.full)) |
| 44 |
self.assertTrue(llist_is_singular(self.singular)) |
| 45 |
|
| 46 |
def test_llist_first_entry(self): |
| 47 |
self.assertEqual( |
| 48 |
llist_first_entry(self.full, "struct drgn_test_llist_entry", "node"), |
| 49 |
self.entry(2), |
| 50 |
) |
| 51 |
self.assertEqual( |
| 52 |
llist_first_entry(self.singular, "struct drgn_test_llist_entry", "node"), |
| 53 |
self.singular_entry, |
| 54 |
) |
| 55 |
|
| 56 |
def test_llist_first_entry_or_null(self): |
| 57 |
self.assertEqual( |
| 58 |
llist_first_entry_or_null( |
| 59 |
self.empty, "struct drgn_test_llist_entry", "node" |
| 60 |
), |
| 61 |
NULL(self.prog, "struct drgn_test_llist_entry *"), |
| 62 |
) |
| 63 |
self.assertEqual( |
| 64 |
llist_first_entry_or_null( |
| 65 |
self.full, "struct drgn_test_llist_entry", "node" |
| 66 |
), |
| 67 |
self.entry(2), |
| 68 |
) |
| 69 |
self.assertEqual( |
| 70 |
llist_first_entry_or_null( |
| 71 |
self.singular, "struct drgn_test_llist_entry", "node" |
| 72 |
), |
| 73 |
self.singular_entry, |
| 74 |
) |
| 75 |
|
| 76 |
def test_llist_next_entry(self): |
| 77 |
for i in reversed(range(1, self.num_entries)): |
| 78 |
self.assertEqual(llist_next_entry(self.entry(i), "node"), self.entry(i - 1)) |
| 79 |
|
| 80 |
def test_llist_for_each(self): |
| 81 |
self.assertEqual(list(llist_for_each(self.empty.first)), []) |
| 82 |
self.assertEqual( |
| 83 |
list(llist_for_each(self.full.first)), |
| 84 |
[self.node(i) for i in reversed(range(self.num_entries))], |
| 85 |
) |
| 86 |
self.assertEqual( |
| 87 |
list(llist_for_each(self.singular.first)), [self.singular_node] |
| 88 |
) |
| 89 |
|
| 90 |
def test_llist_for_each_entry(self): |
| 91 |
self.assertEqual( |
| 92 |
list( |
| 93 |
llist_for_each_entry( |
| 94 |
"struct drgn_test_llist_entry", self.empty.first, "node" |
| 95 |
) |
| 96 |
), |
| 97 |
[], |
| 98 |
) |
| 99 |
self.assertEqual( |
| 100 |
list( |
| 101 |
llist_for_each_entry( |
| 102 |
"struct drgn_test_llist_entry", self.full.first, "node" |
| 103 |
) |
| 104 |
), |
| 105 |
[self.entry(i) for i in reversed(range(self.num_entries))], |
| 106 |
) |
| 107 |
self.assertEqual( |
| 108 |
list( |
| 109 |
llist_for_each_entry( |
| 110 |
"struct drgn_test_llist_entry", self.singular.first, "node" |
| 111 |
) |
| 112 |
), |
| 113 |
[self.singular_entry], |
| 114 |
) |