Adding upstream version 0.37.0.upstream/0.37.0

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>

1 files changed, 160 insertions, 0 deletions

diff --git a/test/linked_list.c b/test/linked_list.c
new file mode 100644
index 0000000..691de35
--- /dev/null
+++ b/test/linked_list.c
@@ -0,0 +1,160 @@
+#include "common/common.h"
+#include "misc/linked_list.h"
+#include "test_utils.h"
+
+struct list_item {
+    int v;
+    struct {
+        struct list_item *prev, *next;
+    } list_node;
+};
+
+struct the_list {
+    struct list_item *head, *tail;
+};
+
+// This serves to remove some -Waddress "always true" warnings.
+static struct list_item *STUPID_SHIT(struct list_item *item)
+{
+    return item;
+}
+
+static bool do_check_list(struct the_list *lst, int *c, int num_c)
+{
+    if (!lst->head)
+        assert_true(!lst->tail);
+    if (!lst->tail)
+        assert_true(!lst->head);
+
+    for (struct list_item *cur = lst->head; cur; cur = cur->list_node.next) {
+        if (cur->list_node.prev) {
+            assert_true(cur->list_node.prev->list_node.next == cur);
+            assert_true(lst->head != cur);
+        } else {
+            assert_true(lst->head == cur);
+        }
+        if (cur->list_node.next) {
+            assert_true(cur->list_node.next->list_node.prev == cur);
+            assert_true(lst->tail != cur);
+        } else {
+            assert_true(lst->tail == cur);
+        }
+
+        if (num_c < 1)
+            return false;
+        if (c[0] != cur->v)
+            return false;
+
+        num_c--;
+        c++;
+    }
+
+    if (num_c)
+        return false;
+
+    return true;
+}
+
+int main(void)
+{
+    struct the_list lst = {0};
+    struct list_item e1 = {1};
+    struct list_item e2 = {2};
+    struct list_item e3 = {3};
+    struct list_item e4 = {4};
+    struct list_item e5 = {5};
+    struct list_item e6 = {6};
+
+#define check_list(...) \
+        assert_true(do_check_list(&lst, (int[]){__VA_ARGS__}, \
+                        sizeof((int[]){__VA_ARGS__}) / sizeof(int)));
+#define check_list_empty() \
+        assert_true(do_check_list(&lst, NULL, 0));
+
+    check_list_empty();
+    LL_APPEND(list_node, &lst, &e1);
+
+    check_list(1);
+    LL_APPEND(list_node, &lst, &e2);
+
+    check_list(1, 2);
+    LL_APPEND(list_node, &lst, &e4);
+
+    check_list(1, 2, 4);
+    LL_CLEAR(list_node, &lst);
+
+    check_list_empty();
+    LL_PREPEND(list_node, &lst, &e4);
+
+    check_list(4);
+    LL_PREPEND(list_node, &lst, &e2);
+
+    check_list(2, 4);
+    LL_PREPEND(list_node, &lst, &e1);
+
+    check_list(1, 2, 4);
+    LL_CLEAR(list_node, &lst);
+
+    check_list_empty();
+    LL_INSERT_BEFORE(list_node, &lst, (struct list_item *)NULL, &e6);
+
+    check_list(6);
+    LL_INSERT_BEFORE(list_node, &lst, (struct list_item *)NULL, &e1);
+
+    check_list(6, 1);
+    LL_INSERT_BEFORE(list_node, &lst, (struct list_item *)NULL, &e2);
+
+    check_list(6, 1, 2);
+    LL_INSERT_BEFORE(list_node, &lst, STUPID_SHIT(&e6), &e3);
+
+    check_list(3, 6, 1, 2);
+    LL_INSERT_BEFORE(list_node, &lst, STUPID_SHIT(&e6), &e5);
+
+    check_list(3, 5, 6, 1, 2);
+    LL_INSERT_BEFORE(list_node, &lst, STUPID_SHIT(&e2), &e4);
+
+    check_list(3, 5, 6, 1, 4, 2);
+    LL_REMOVE(list_node, &lst, &e6);
+
+    check_list(3, 5, 1, 4, 2);
+    LL_REMOVE(list_node, &lst, &e3);
+
+    check_list(5, 1, 4, 2);
+    LL_REMOVE(list_node, &lst, &e2);
+
+    check_list(5, 1, 4);
+    LL_REMOVE(list_node, &lst, &e4);
+
+    check_list(5, 1);
+    LL_REMOVE(list_node, &lst, &e5);
+
+    check_list(1);
+    LL_REMOVE(list_node, &lst, &e1);
+
+    check_list_empty();
+    LL_APPEND(list_node, &lst, &e2);
+
+    check_list(2);
+    LL_REMOVE(list_node, &lst, &e2);
+
+    check_list_empty();
+    LL_INSERT_AFTER(list_node, &lst, (struct list_item *)NULL, &e1);
+
+    check_list(1);
+    LL_INSERT_AFTER(list_node, &lst, (struct list_item *)NULL, &e2);
+
+    check_list(2, 1);
+    LL_INSERT_AFTER(list_node, &lst, (struct list_item *)NULL, &e3);
+
+    check_list(3, 2, 1);
+    LL_INSERT_AFTER(list_node, &lst, STUPID_SHIT(&e3), &e4);
+
+    check_list(3, 4, 2, 1);
+    LL_INSERT_AFTER(list_node, &lst, STUPID_SHIT(&e4), &e5);
+
+    check_list(3, 4, 5, 2, 1);
+    LL_INSERT_AFTER(list_node, &lst, STUPID_SHIT(&e1), &e6);
+
+    check_list(3, 4, 5, 2, 1, 6);
+    return 0;
+}