summaryrefslogtreecommitdiffstats
path: root/libavahi-core/llist.h
diff options
context:
space:
mode:
authorLennart Poettering <lennart@poettering.net>2005-05-06 15:31:30 +0000
committerLennart Poettering <lennart@poettering.net>2005-05-06 15:31:30 +0000
commitf93eca3530bef2cc23ffe6c3a04493ad171c2aed (patch)
treeb1053873411a868b751d7471cd4cb02fa54ed29a /libavahi-core/llist.h
parent42c9b99f2bb21d0ff1f1918314f9d5dd82a62763 (diff)
move the sources to libavahi-core/
git-svn-id: file:///home/lennart/svn/public/avahi/trunk@50 941a03a8-eaeb-0310-b9a0-b1bbd8fe43fe
Diffstat (limited to 'libavahi-core/llist.h')
-rw-r--r--libavahi-core/llist.h50
1 files changed, 50 insertions, 0 deletions
diff --git a/libavahi-core/llist.h b/libavahi-core/llist.h
new file mode 100644
index 0000000..16a16b6
--- /dev/null
+++ b/libavahi-core/llist.h
@@ -0,0 +1,50 @@
+#ifndef foollistfoo
+#define foollistfoo
+
+#include <glib.h>
+
+/* Some macros for maintaining doubly linked lists */
+
+/* The head of the linked list. Use this in the structure that shall
+ * contain the head of the linked list */
+#define AVAHI_LLIST_HEAD(t,name) t *name
+
+/* The pointers in the linked list's items. Use this in the item structure */
+#define AVAHI_LLIST_FIELDS(t,name) t *name##_next, *name##_prev
+
+/* Initialize the list's head */
+#define AVAHI_LLIST_HEAD_INIT(t,head) do { (head) = NULL; } while(0)
+
+/* Initialize a list item */
+#define AVAHI_LLIST_INIT(t,name,item) do { \
+ t *_item = (item); \
+ g_assert(_item); \
+ _item->name##_prev = _item->name##_next = NULL; \
+ } while(0)
+
+/* Prepend an item to the list */
+#define AVAHI_LLIST_PREPEND(t,name,head,item) do { \
+ t **_head = &(head), *_item = (item); \
+ g_assert(_item); \
+ if ((_item->name##_next = *_head)) \
+ _item->name##_next->name##_prev = _item; \
+ _item->name##_prev = NULL; \
+ *_head = _item; \
+ } while (0)
+
+/* Remove an item from the list */
+#define AVAHI_LLIST_REMOVE(t,name,head,item) do { \
+ t **_head = &(head), *_item = (item); \
+ g_assert(_item); \
+ if (_item->name##_next) \
+ _item->name##_next->name##_prev = _item->name##_prev; \
+ if (_item->name##_prev) \
+ _item->name##_prev->name##_next = _item->name##_next; \
+ else {\
+ g_assert(*_head == _item); \
+ *_head = _item->name##_next; \
+ } \
+ _item->name##_next = _item->name##_prev = NULL; \
+ } while(0)
+
+#endif