summaryrefslogtreecommitdiff
path: root/test
diff options
context:
space:
mode:
authorRichard Braun <rbraun@sceen.net>2017-07-24 21:42:56 +0200
committerRichard Braun <rbraun@sceen.net>2017-07-24 21:42:56 +0200
commit3e5bd919e167c0d3ae4ca407fe3d88829d0261b5 (patch)
tree24cb8b2c304cdfece15639e3466463afd12db58e /test
parent10a647cb57a145c6b6eb91747869b26ff4f2a94a (diff)
hlist: new module
Diffstat (limited to 'test')
-rw-r--r--test/test_hlist.c232
1 files changed, 232 insertions, 0 deletions
diff --git a/test/test_hlist.c b/test/test_hlist.c
new file mode 100644
index 0000000..559a750
--- /dev/null
+++ b/test/test_hlist.c
@@ -0,0 +1,232 @@
+/*
+ * Copyright (c) 2017 Richard Braun.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ * notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ * notice, this list of conditions and the following disclaimer in the
+ * documentation and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
+ * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
+ * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
+ * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
+ * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
+ * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "../check.h"
+#include "../macros.h"
+#include "../hlist.h"
+
+struct obj {
+ struct hlist_node node;
+};
+
+static struct obj *
+obj_create(void)
+{
+ struct obj *obj;
+
+ obj = malloc(sizeof(struct obj));
+ hlist_node_init(&obj->node);
+ return obj;
+}
+
+static void
+obj_destroy(struct obj *obj)
+{
+ free(obj);
+}
+
+static void
+add_obj_head(struct hlist *list)
+{
+ struct obj *obj;
+
+ obj = obj_create();
+ check(hlist_node_unlinked(&obj->node));
+ hlist_insert_head(list, &obj->node);
+}
+
+static void
+add_obj_head2(struct hlist *list)
+{
+ struct hlist_node *node;
+ struct obj *obj;
+
+ obj = obj_create();
+ check(hlist_node_unlinked(&obj->node));
+ node = hlist_first(list);
+ hlist_insert_before(node, &obj->node);
+}
+
+static void
+add_obj_second(struct hlist *list)
+{
+ struct hlist_node *node;
+ struct obj *obj;
+
+ obj = obj_create();
+ check(hlist_node_unlinked(&obj->node));
+ node = hlist_first(list);
+ hlist_insert_after(node, &obj->node);
+}
+
+static void
+add_obj_head_llsync(struct hlist *list)
+{
+ struct obj *obj;
+
+ obj = obj_create();
+ hlist_llsync_insert_head(list, &obj->node);
+}
+
+static void
+add_obj_head2_llsync(struct hlist *list)
+{
+ struct hlist_node *node;
+ struct obj *obj;
+
+ obj = obj_create();
+ check(hlist_node_unlinked(&obj->node));
+ node = hlist_first(list);
+ hlist_llsync_insert_before(node, &obj->node);
+}
+
+static void
+add_obj_second_llsync(struct hlist *list)
+{
+ struct hlist_node *node;
+ struct obj *obj;
+
+ obj = obj_create();
+ check(hlist_node_unlinked(&obj->node));
+ node = hlist_first(list);
+ hlist_llsync_insert_after(node, &obj->node);
+}
+
+static void
+walk_all_objs1(struct hlist *list)
+{
+ struct hlist_node *node;
+
+ hlist_for_each(list, node);
+}
+
+static void
+walk_all_objs1_llsync(struct hlist *list)
+{
+ struct hlist_node *node;
+
+ hlist_llsync_for_each(list, node);
+}
+
+static void
+walk_all_objs2(struct hlist *list)
+{
+ struct hlist_node *node, *tmp;
+
+ hlist_for_each_safe(list, node, tmp);
+}
+
+static void
+walk_all_objs3(struct hlist *list)
+{
+ struct obj *obj;
+
+ hlist_for_each_entry(list, obj, node);
+}
+
+static void
+walk_all_objs3_llsync(struct hlist *list)
+{
+ struct obj *obj;
+
+ hlist_llsync_for_each_entry(list, obj, node);
+}
+
+static void
+walk_all_objs4(struct hlist *list)
+{
+ struct obj *obj, *tmp;
+
+ hlist_for_each_entry_safe(list, obj, tmp, node);
+}
+
+static void
+del_all_objs(struct hlist *list)
+{
+ struct obj *obj;
+
+ while (!hlist_empty(list)) {
+ obj = hlist_first_entry(list, struct obj, node);
+ hlist_remove(&obj->node);
+ obj_destroy(obj);
+ }
+}
+
+static void
+del_all_objs_llsync(struct hlist *list)
+{
+ struct obj *obj;
+
+ while (!hlist_empty(list)) {
+ obj = hlist_first_entry(list, struct obj, node);
+ hlist_llsync_remove(&obj->node);
+ obj_destroy(obj);
+ }
+}
+
+int
+main(void)
+{
+ struct hlist list, list2;
+
+ hlist_init(&list);
+ hlist_init(&list2);
+
+ check(!hlist_llsync_first_entry(&list, struct obj, node));
+
+ check(!hlist_singular(&list));
+ add_obj_head(&list);
+ check(hlist_singular(&list));
+ add_obj_head(&list);
+ check(!hlist_singular(&list));
+
+ walk_all_objs1(&list);
+ walk_all_objs1_llsync(&list);
+ walk_all_objs2(&list);
+ walk_all_objs3(&list);
+ walk_all_objs3_llsync(&list);
+ walk_all_objs4(&list);
+
+ del_all_objs(&list);
+
+ add_obj_head(&list);
+ add_obj_head2(&list);
+ add_obj_second(&list);
+ add_obj_head_llsync(&list);
+ add_obj_head2_llsync(&list);
+ add_obj_second_llsync(&list);
+ add_obj_head(&list);
+ add_obj_head(&list);
+ hlist_set_head(&list2, &list);
+ hlist_set_head(&list, &list2);
+
+ del_all_objs_llsync(&list);
+
+ return 0;
+}