03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Copyright © 2010 Intel Corporation
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Copyright © 2010 Francisco Jerez <currojerez@riseup.net>
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Permission is hereby granted, free of charge, to any person obtaining a
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * copy of this software and associated documentation files (the "Software"),
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * to deal in the Software without restriction, including without limitation
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * the rights to use, copy, modify, merge, publish, distribute, sublicense,
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * and/or sell copies of the Software, and to permit persons to whom the
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Software is furnished to do so, subject to the following conditions:
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * The above copyright notice and this permission notice (including the next
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * paragraph) shall be included in all copies or substantial portions of the
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Software.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * IN THE SOFTWARE.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @file Classic doubly-link circular list implementation.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * For real usage examples of the linked list, see the file test/list.c
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * We need to keep a list of struct foo in the parent struct bar, i.e. what
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * we want is something like this.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct bar {
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct foo *list_of_foos; -----> struct foo {}, struct foo {}, struct foo{}
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * We need one list head in bar and a list element in all list_of_foos (both are of
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * data type 'struct xorg_list').
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct bar {
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct xorg_list list_of_foos;
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct foo {
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct xorg_list entry;
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Now we initialize the list head:
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct bar bar;
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * xorg_list_init(&bar.list_of_foos);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Then we create the first element and add it to this list:
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct foo *foo = malloc(...);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * xorg_list_add(&foo->entry, &bar.list_of_foos);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Repeat the above for each element you want to add to the list. Deleting
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * works with the element itself.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * xorg_list_del(&foo->entry);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * free(foo);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Note: calling xorg_list_del(&bar.list_of_foos) will set bar.list_of_foos to an empty
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * list again.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Looping through the list requires a 'struct foo' as iterator and the
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * name of the field the subnodes use.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct foo *iterator;
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * xorg_list_for_each_entry(iterator, &bar.list_of_foos, entry) {
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * if (iterator->something == ...)
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Note: You must not call xorg_list_del() on the iterator if you continue the
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * loop. You need to run the safe for-each loop instead:
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct foo *iterator, *next;
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * xorg_list_for_each_entry_safe(iterator, next, &bar.list_of_foos, entry) {
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * xorg_list_del(&iterator->entry);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * The linkage struct for list nodes. This struct must be part of your
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * to-be-linked struct. struct xorg_list is required for both the head of the
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * list and for each list node.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Position and name of the struct xorg_list field is irrelevant.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * There are no requirements that elements of a list are of the same type.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * There are no requirements for a list head, any struct xorg_list can be a list
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Initialize the list as an empty list.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * xorg_list_init(&bar->list_of_foos);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param The list to initialized.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsyncstatic inline void
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Insert a new element after the given list head. The new element does not
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * need to be initialised as empty list.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * The list changes from:
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * head → some element → ...
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * head → new element → older element → ...
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct foo *newfoo = malloc(...);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * xorg_list_add(&newfoo->entry, &bar->list_of_foos);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param entry The new element to prepend to the list.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param head The existing list.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsyncstatic inline void
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsyncxorg_list_add(struct xorg_list *entry, struct xorg_list *head)
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Append a new element to the end of the list given with this list head.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * The list changes from:
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * head → some element → ... → lastelement
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * head → some element → ... → lastelement → new element
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct foo *newfoo = malloc(...);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * xorg_list_append(&newfoo->entry, &bar->list_of_foos);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param entry The new element to prepend to the list.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param head The existing list.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsyncstatic inline void
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsyncxorg_list_append(struct xorg_list *entry, struct xorg_list *head)
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsyncstatic inline void
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync__xorg_list_del(struct xorg_list *prev, struct xorg_list *next)
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Remove the element from the list it is in. Using this function will reset
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * the pointers to/from this element so it is removed from the list. It does
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * NOT free the element itself or manipulate it otherwise.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Using xorg_list_del on a pure list head (like in the example at the top of
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * this file) will NOT remove the first element from
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * the list but rather reset the list as empty list.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * xorg_list_del(&foo->entry);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param entry The element to remove.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsyncstatic inline void
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Check if the list is empty.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * xorg_list_is_empty(&bar->list_of_foos);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @return True if the list contains one or more elements or False otherwise.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsyncstatic inline Bool
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Returns a pointer to the container of this list element.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct foo* f;
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * f = container_of(&foo->entry, struct foo, entry);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * assert(f == foo);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param ptr Pointer to the struct xorg_list.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param type Data type of the list element.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param member Member name of the struct xorg_list field in the list element.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @return A pointer to the data struct containing the list head.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Alias of container_of
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Retrieve the first list entry for the given list pointer.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct foo *first;
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * first = xorg_list_first_entry(&bar->list_of_foos, struct foo, list_of_foos);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param ptr The list head
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param type Data type of the list element to retrieve
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param member Member name of the struct xorg_list field in the list element.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @return A pointer to the first list element.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Retrieve the last list entry for the given listpointer.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct foo *first;
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * first = xorg_list_last_entry(&bar->list_of_foos, struct foo, list_of_foos);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param ptr The list head
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param type Data type of the list element to retrieve
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param member Member name of the struct xorg_list field in the list element.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @return A pointer to the last list element.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync/* This implementation of __container_of has undefined behavior according
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * to the C standard, but it works in many cases. If your compiler doesn't
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * support typeof() and fails with this implementation, please try a newer
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * compiler.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync (void *)((char *)(ptr) \
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Loop through the list given by head and set pos to struct in the list.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct foo *iterator;
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * xorg_list_for_each_entry(iterator, &bar->list_of_foos, entry) {
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * [modify iterator]
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * This macro is not safe for node deletion. Use xorg_list_for_each_entry_safe
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param pos Iterator variable of the type of the list elements.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param head List head
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param member Member name of the struct xorg_list in the list elements.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync#define xorg_list_for_each_entry(pos, head, member) \
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync for (pos = __container_of((head)->next, pos, member); \
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync pos = __container_of(pos->member.next, pos, member))
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Loop through the list, keeping a backup pointer to the element. This
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * macro allows for the deletion of a list element while looping through the
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * See xorg_list_for_each_entry for more details.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync#define xorg_list_for_each_entry_safe(pos, tmp, head, member) \
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync for (pos = __container_of((head)->next, pos, member), \
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync tmp = __container_of(pos->member.next, pos, member); \
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync pos = tmp, tmp = __container_of(pos->member.next, tmp, member))
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync/* NULL-Terminated List Interface
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * The interface below does _not_ use the struct xorg_list as described above.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * It is mainly for legacy structures that cannot easily be switched to
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct xorg_list.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * This interface is for structs like
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct foo {
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct foo *next;
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * The position and field name of "next" are arbitrary.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Init the element as null-terminated list.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct foo *list = malloc();
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * nt_list_init(list, next);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param list The list element that will be the start of the list
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param member Member name of the field pointing to next struct
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Returns the next element in the list or NULL on termination.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct foo *element = list;
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * while ((element = nt_list_next(element, next)) { }
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * This macro is not safe for node deletion. Use nt_list_for_each_entry_safe
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param list The list or current element.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param member Member name of the field pointing to next struct.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Iterate through each element in the list.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct foo *iterator;
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * nt_list_for_each_entry(iterator, list, next) {
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * [modify iterator]
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param entry Assigned to the current list element
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param list The list to iterate through.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param member Member name of the field pointing to next struct.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync#define nt_list_for_each_entry(_entry, _list, _member) \
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync for (_entry = _list; _entry; _entry = (_entry)->_member)
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Iterate through each element in the list, keeping a backup pointer to the
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * element. This macro allows for the deletion of a list element while
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * looping through the list.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * See nt_list_for_each_entry for more details.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param entry Assigned to the current list element
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param tmp The pointer to the next element
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param list The list to iterate through.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param member Member name of the field pointing to next struct.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync#define nt_list_for_each_entry_safe(_entry, _tmp, _list, _member) \
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync for (_entry = _list, _tmp = (_entry) ? (_entry)->_member : NULL;\
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync _entry = _tmp, _tmp = (_tmp) ? (_tmp)->_member: NULL)
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Append the element to the end of the list. This macro may be used to
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * merge two lists.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct foo *elem = malloc(...);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * nt_list_init(elem, next)
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * nt_list_append(elem, list, struct foo, next);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Resulting list order:
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * list_item_0 -> list_item_1 -> ... -> elem_item_0 -> elem_item_1 ...
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param entry An entry (or list) to append to the list
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param list The list to append to. This list must be a valid list, not
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param type The list type
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param member Member name of the field pointing to next struct
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync#define nt_list_append(_entry, _list, _type, _member) \
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync while (__iterator->_member) { __iterator = __iterator->_member;}\
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync } while (0)
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Insert the element at the next position in the list. This macro may be
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * used to insert a list into a list.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct foo *elem = malloc(...);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * nt_list_init(elem, next)
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * nt_list_insert(elem, list, struct foo, next);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Resulting list order:
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * list_item_0 -> elem_item_0 -> elem_item_1 ... -> list_item_1 -> ...
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param entry An entry (or list) to append to the list
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param list The list to insert to. This list must be a valid list, not
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param type The list type
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param member Member name of the field pointing to next struct
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync#define nt_list_insert(_entry, _list, _type, _member) \
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync nt_list_append((_list)->_member, _entry, _type, _member); \
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync } while (0)
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * Delete the entry from the list by iterating through the list and
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * removing any reference from the list to the entry.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * struct foo *elem = <assign to right element>
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * nt_list_del(elem, list, struct foo, next);
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param entry The entry to delete from the list. entry is always
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * re-initialized as a null-terminated list.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param list The list containing the entry, set to the new list without
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * the removed entry.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param type The list type
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * @param member Member name of the field pointing to the next entry
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync#define nt_list_del(_entry, _list, _type, _member) \
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync while (__prev->_member && __prev->_member != __e) \
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * DO NOT USE THIS.
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * This is a remainder of the xfree86 DDX attempt of having a set of generic
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * list functions. Unfortunately, the xf86OptionRec uses it and we can't
03532efdc331b598d3dedc8cc7477641c3b0dd12vboxsync * easily get rid of it. Do not use for new code.