Go to the source code of this file.
Defines | |
#define | AVAHI_LLIST_FIELDS(t, name) t *name##_next, *name##_prev |
#define | AVAHI_LLIST_HEAD(t, name) t *name |
#define | AVAHI_LLIST_HEAD_INIT(t, head) do { (head) = NULL; } while(0) |
#define | AVAHI_LLIST_INIT(t, name, item) |
#define | AVAHI_LLIST_PREPEND(t, name, head, item) |
#define | AVAHI_LLIST_REMOVE(t, name, head, item) |
A simple macro based linked list implementation
Definition in file llist.h.
#define AVAHI_LLIST_FIELDS | ( | t, | |
name | |||
) | t *name##_next, *name##_prev |
#define AVAHI_LLIST_HEAD | ( | t, | |
name | |||
) | t *name |
#define AVAHI_LLIST_HEAD_INIT | ( | t, | |
head | |||
) | do { (head) = NULL; } while(0) |
#define AVAHI_LLIST_INIT | ( | t, | |
name, | |||
item | |||
) |
#define AVAHI_LLIST_PREPEND | ( | t, | |
name, | |||
head, | |||
item | |||
) |
#define AVAHI_LLIST_REMOVE | ( | t, | |
name, | |||
head, | |||
item | |||
) |
do { \ t **_head = &(head), *_item = (item); \ 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 {\ assert(*_head == _item); \ *_head = _item->name##_next; \ } \ _item->name##_next = _item->name##_prev = NULL; \ } while(0)
Remove an item from the list