| 1 |
/* |
| 2 |
* Tests for embedded CList members |
| 3 |
*/ |
| 4 |
|
| 5 |
#undef NDEBUG |
| 6 |
#include <assert.h> |
| 7 |
#include <stdio.h> |
| 8 |
#include <stdlib.h> |
| 9 |
#include <string.h> |
| 10 |
#include "c-list.h" |
| 11 |
|
| 12 |
typedef struct Entry Entry; |
| 13 |
|
| 14 |
struct Entry { |
| 15 |
short foo; |
| 16 |
CList link; |
| 17 |
short bar; |
| 18 |
}; |
| 19 |
|
| 20 |
static void test_entry(void) { |
| 21 |
CList list = C_LIST_INIT(list); |
| 22 |
Entry e1 = { .foo = 1 * 7, .bar = 1 * 11 }; |
| 23 |
Entry e2 = { .foo = 2 * 7, .bar = 2 * 11 }; |
| 24 |
Entry e3 = { .foo = 3 * 7, .bar = 3 * 11 }; |
| 25 |
Entry e4 = { .foo = 4 * 7, .bar = 4 * 11 }; |
| 26 |
Entry *e; |
| 27 |
CList *iter, *safe; |
| 28 |
size_t i; |
| 29 |
|
| 30 |
/* verify c_list_entry() works as expected (even with NULL) */ |
| 31 |
|
| 32 |
assert(!c_list_entry(NULL, Entry, link)); |
| 33 |
assert(&e1 == c_list_entry(&e1.link, Entry, link)); |
| 34 |
|
| 35 |
/* verify @list is empty */ |
| 36 |
|
| 37 |
assert(!c_list_first_entry(&list, Entry, link)); |
| 38 |
assert(!c_list_last_entry(&list, Entry, link)); |
| 39 |
|
| 40 |
/* link 2 entries and verify list state */ |
| 41 |
|
| 42 |
c_list_link_tail(&list, &e1.link); |
| 43 |
c_list_link_tail(&list, &e2.link); |
| 44 |
|
| 45 |
assert(c_list_first_entry(&list, Entry, link)->foo == 1 * 7); |
| 46 |
assert(c_list_first_entry(&list, Entry, link)->bar == 1 * 11); |
| 47 |
assert(c_list_last_entry(&list, Entry, link)->foo == 2 * 7); |
| 48 |
assert(c_list_last_entry(&list, Entry, link)->bar == 2 * 11); |
| 49 |
|
| 50 |
i = 0; |
| 51 |
c_list_for_each(iter, &list) { |
| 52 |
e = c_list_entry(iter, Entry, link); |
| 53 |
assert(i != 0 || e == &e1); |
| 54 |
assert(i != 1 || e == &e2); |
| 55 |
assert(i < 2); |
| 56 |
++i; |
| 57 |
} |
| 58 |
assert(i == 2); |
| 59 |
|
| 60 |
/* link 2 more entries */ |
| 61 |
|
| 62 |
c_list_link_tail(&list, &e3.link); |
| 63 |
c_list_link_tail(&list, &e4.link); |
| 64 |
|
| 65 |
assert(c_list_first_entry(&list, Entry, link)->foo == 1 * 7); |
| 66 |
assert(c_list_first_entry(&list, Entry, link)->bar == 1 * 11); |
| 67 |
assert(c_list_last_entry(&list, Entry, link)->foo == 4 * 7); |
| 68 |
assert(c_list_last_entry(&list, Entry, link)->bar == 4 * 11); |
| 69 |
|
| 70 |
i = 0; |
| 71 |
c_list_for_each(iter, &list) { |
| 72 |
e = c_list_entry(iter, Entry, link); |
| 73 |
assert(i != 0 || e == &e1); |
| 74 |
assert(i != 1 || e == &e2); |
| 75 |
assert(i != 2 || e == &e3); |
| 76 |
assert(i != 3 || e == &e4); |
| 77 |
assert(i < 4); |
| 78 |
++i; |
| 79 |
} |
| 80 |
assert(i == 4); |
| 81 |
|
| 82 |
assert(!c_list_is_empty(&list)); |
| 83 |
assert(c_list_is_linked(&e1.link)); |
| 84 |
assert(c_list_is_linked(&e2.link)); |
| 85 |
assert(c_list_is_linked(&e3.link)); |
| 86 |
assert(c_list_is_linked(&e4.link)); |
| 87 |
|
| 88 |
/* remove via safe iterator */ |
| 89 |
|
| 90 |
i = 0; |
| 91 |
c_list_for_each_safe(iter, safe, &list) { |
| 92 |
e = c_list_entry(iter, Entry, link); |
| 93 |
assert(i != 0 || e == &e1); |
| 94 |
assert(i != 1 || e == &e2); |
| 95 |
assert(i != 2 || e == &e3); |
| 96 |
assert(i != 3 || e == &e4); |
| 97 |
assert(i < 4); |
| 98 |
++i; |
| 99 |
c_list_unlink(&e->link); |
| 100 |
} |
| 101 |
assert(i == 4); |
| 102 |
|
| 103 |
assert(c_list_is_empty(&list)); |
| 104 |
assert(!c_list_is_linked(&e1.link)); |
| 105 |
assert(!c_list_is_linked(&e2.link)); |
| 106 |
assert(!c_list_is_linked(&e3.link)); |
| 107 |
assert(!c_list_is_linked(&e4.link)); |
| 108 |
} |
| 109 |
|
| 110 |
#if defined(__GNUC__) || defined(__clang__) |
| 111 |
static void test_entry_gnu(void) { |
| 112 |
CList list = C_LIST_INIT(list); |
| 113 |
Entry e1 = { .foo = 1 * 7, .bar = 1 * 11 }; |
| 114 |
Entry e2 = { .foo = 2 * 7, .bar = 2 * 11 }; |
| 115 |
Entry e3 = { .foo = 3 * 7, .bar = 3 * 11 }; |
| 116 |
Entry e4 = { .foo = 4 * 7, .bar = 4 * 11 }; |
| 117 |
Entry *e, *safe; |
| 118 |
size_t i; |
| 119 |
|
| 120 |
/* link entries and verify list state */ |
| 121 |
|
| 122 |
c_list_link_tail(&list, &e1.link); |
| 123 |
c_list_link_tail(&list, &e2.link); |
| 124 |
c_list_link_tail(&list, &e3.link); |
| 125 |
c_list_link_tail(&list, &e4.link); |
| 126 |
|
| 127 |
i = 0; |
| 128 |
c_list_for_each_entry(e, &list, link) { |
| 129 |
assert(i != 0 || e == &e1); |
| 130 |
assert(i != 1 || e == &e2); |
| 131 |
assert(i != 2 || e == &e3); |
| 132 |
assert(i != 3 || e == &e4); |
| 133 |
assert(i < 4); |
| 134 |
++i; |
| 135 |
} |
| 136 |
assert(i == 4); |
| 137 |
|
| 138 |
assert(!c_list_is_empty(&list)); |
| 139 |
assert(c_list_is_linked(&e1.link)); |
| 140 |
assert(c_list_is_linked(&e2.link)); |
| 141 |
assert(c_list_is_linked(&e3.link)); |
| 142 |
assert(c_list_is_linked(&e4.link)); |
| 143 |
|
| 144 |
/* remove via safe iterator */ |
| 145 |
|
| 146 |
i = 0; |
| 147 |
c_list_for_each_entry_safe(e, safe, &list, link) { |
| 148 |
assert(i != 0 || e == &e1); |
| 149 |
assert(i != 1 || e == &e2); |
| 150 |
assert(i != 2 || e == &e3); |
| 151 |
assert(i != 3 || e == &e4); |
| 152 |
assert(i < 4); |
| 153 |
++i; |
| 154 |
c_list_unlink(&e->link); |
| 155 |
} |
| 156 |
assert(i == 4); |
| 157 |
|
| 158 |
assert(c_list_is_empty(&list)); |
| 159 |
assert(!c_list_is_linked(&e1.link)); |
| 160 |
assert(!c_list_is_linked(&e2.link)); |
| 161 |
assert(!c_list_is_linked(&e3.link)); |
| 162 |
assert(!c_list_is_linked(&e4.link)); |
| 163 |
} |
| 164 |
#else |
| 165 |
static void test_entry_gnu(void) { |
| 166 |
} |
| 167 |
#endif |
| 168 |
|
| 169 |
int main(void) { |
| 170 |
test_entry(); |
| 171 |
test_entry_gnu(); |
| 172 |
return 0; |
| 173 |
} |