Lines Matching defs:next
60 #define LST_IsEmpty(l) (((l)->head.next == &(l)->head))
63 struct LST_ELEM *next;
84 * An empty list is indicated by the "next" pointer in the element
95 * "empty" element, because its "next" and "prev" pointers point at
158 * Else, removes the element at the head of the list, making the next
161 * "next" pointer at the next element after the head, and by making the
162 * "prev" pointer of the next element after the head point at the tail
163 * element. So the next element after the head becomes the new head of
177 * Because the tail of the list points forward (its "next" pointer) to
237 * Returns a pointer to the next element of the list, or NULL if the next
262 * Sets next pointer of the previous tail member of the list to point to
264 * Sets new element's next pointer to the address of the head element.
279 * tail's "next" pointer points at the head of the list, and the head's
