2 This file is part of systemd
4 Copyright 2013 Jan Janssen
6 systemd is free software; you can redistribute it and/or modify it
7 under the terms of the GNU Lesser General Public License as published by
8 the Free Software Foundation; either version 2.1 of the License, or
9 (at your option) any later version.
11 systemd is distributed in the hope that it will be useful, but
12 WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 Lesser General Public License for more details.
16 You should have received a copy of the GNU Lesser General Public License
17 along with systemd; If not, see <http://www.gnu.org/licenses/>.
23 int main(int argc, const char *argv[]) {
25 typedef struct list_item {
26 LIST_FIELDS(struct list_item, item);
28 LIST_HEAD(list_item, head);
33 assert_se(head == NULL);
35 for (i = 0; i < ELEMENTSOF(items); i++) {
36 LIST_INIT(item, &items[i]);
37 assert_se(LIST_JUST_US(item, &items[i]));
38 LIST_PREPEND(item, head, &items[i]);
42 LIST_FOREACH_OTHERS(item, cursor, &items[2]) {
44 assert_se(cursor != &items[2]);
46 assert_se(i == ELEMENTSOF(items)-1);
48 assert_se(!LIST_JUST_US(item, head));
50 assert_se(items[0].item_next == NULL);
51 assert_se(items[1].item_next == &items[0]);
52 assert_se(items[2].item_next == &items[1]);
53 assert_se(items[3].item_next == &items[2]);
55 assert_se(items[0].item_prev == &items[1]);
56 assert_se(items[1].item_prev == &items[2]);
57 assert_se(items[2].item_prev == &items[3]);
58 assert_se(items[3].item_prev == NULL);
60 LIST_FIND_HEAD(item, &items[0], cursor);
61 assert_se(cursor == &items[3]);
63 LIST_FIND_TAIL(item, &items[3], cursor);
64 assert_se(cursor == &items[0]);
66 LIST_REMOVE(item, head, &items[1]);
67 assert_se(LIST_JUST_US(item, &items[1]));
69 assert_se(items[0].item_next == NULL);
70 assert_se(items[2].item_next == &items[0]);
71 assert_se(items[3].item_next == &items[2]);
73 assert_se(items[0].item_prev == &items[2]);
74 assert_se(items[2].item_prev == &items[3]);
75 assert_se(items[3].item_prev == NULL);
77 LIST_INSERT_AFTER(item, head, &items[3], &items[1]);
78 assert_se(items[0].item_next == NULL);
79 assert_se(items[2].item_next == &items[0]);
80 assert_se(items[1].item_next == &items[2]);
81 assert_se(items[3].item_next == &items[1]);
83 assert_se(items[0].item_prev == &items[2]);
84 assert_se(items[2].item_prev == &items[1]);
85 assert_se(items[1].item_prev == &items[3]);
86 assert_se(items[3].item_prev == NULL);
88 LIST_REMOVE(item, head, &items[0]);
89 assert_se(LIST_JUST_US(item, &items[0]));
91 assert_se(items[2].item_next == NULL);
92 assert_se(items[1].item_next == &items[2]);
93 assert_se(items[3].item_next == &items[1]);
95 assert_se(items[2].item_prev == &items[1]);
96 assert_se(items[1].item_prev == &items[3]);
97 assert_se(items[3].item_prev == NULL);
99 LIST_REMOVE(item, head, &items[1]);
100 assert_se(LIST_JUST_US(item, &items[1]));
102 assert_se(items[2].item_next == NULL);
103 assert_se(items[3].item_next == &items[2]);
105 assert_se(items[2].item_prev == &items[3]);
106 assert_se(items[3].item_prev == NULL);
108 LIST_REMOVE(item, head, &items[2]);
109 assert_se(LIST_JUST_US(item, &items[2]));
110 assert_se(LIST_JUST_US(item, head));
112 LIST_REMOVE(item, head, &items[3]);
113 assert_se(LIST_JUST_US(item, &items[3]));
115 assert_se(head == NULL);
117 for (i = 0; i < ELEMENTSOF(items); i++) {
118 assert_se(LIST_JUST_US(item, &items[i]));
119 LIST_APPEND(item, head, &items[i]);
122 assert_se(!LIST_JUST_US(item, head));
124 assert_se(items[0].item_next == &items[1]);
125 assert_se(items[1].item_next == &items[2]);
126 assert_se(items[2].item_next == &items[3]);
127 assert_se(items[3].item_next == NULL);
129 assert_se(items[0].item_prev == NULL);
130 assert_se(items[1].item_prev == &items[0]);
131 assert_se(items[2].item_prev == &items[1]);
132 assert_se(items[3].item_prev == &items[2]);
134 for (i = 0; i < ELEMENTSOF(items); i++)
135 LIST_REMOVE(item, head, &items[i]);
137 assert_se(head == NULL);