Lines Matching refs:list
34 * This list data structure is a verbatim copy from wayland-util.h from the
39 * Doubly linked list implementation. This struct is used for both the list
40 * nodes and the list head. Use like this:
45 * struct list list_of_bars; // the list head
49 * struct list link; // links between the bars
60 struct list {
61 struct list *prev;
62 struct list *next;
66 * Initialize a list head. This function *must* be called once for each list
68 * list.
70 void list_init(struct list *list);
73 * Insert an element at the front of the list
75 void list_insert(struct list *list, struct list *elm);
77 * Append an element to the back of the list
79 void list_append(struct list *list, struct list *elm);
82 * Remove an element from list.
84 * Removing a list element is only possible once, the caller must track
85 * whether the list node has already been removed.
88 void list_remove(struct list *elm);
90 * Returns true if the given list head is an empty list.
92 bool list_empty(const struct list *list);
116 * Given a list 'head', return the first entry of type 'pos' that has a
125 * struct list list_of_bars;
129 * struct list link;
141 * Given a list 'head', return the first entry of type 'container_type' that
146 * struct list list_of_bars;
150 * struct list link;
161 * Iterate through the list.
170 * If a list node needs to be removed during iteration, use
179 * Iterate through the list. Equivalent to list_for_each() but allows