Lines Matching defs:head
60 #define LST_IsEmpty(l) (((l)->head.next == &(l)->head))
71 struct LST_ELEM head;
85 * at the head of the list pointing to the head of the list, itself.
155 * Pops the head off the list and returns a pointer to it.
158 * Else, removes the element at the head of the list, making the next
159 * element the head of the list.
160 * The head is removed by making the tail element of the list point its
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
166 * pList: Pointer to list control structure of list whose head
169 * Pointer to element that was at the head of the list (success)
172 * - head.self must be correctly set to &head.
178 * the head of the list, and the head of the list points backward (its
238 * element is the head of the list or the list is empty.
259 * the head element's prev pointer. This is the previous tail member of
261 * Sets the new head's prev pointer to the address of the element.
263 * the new element (rather than the head, which it had been pointing at).
264 * Sets new element's next pointer to the address of the head element.
265 * Sets head's prev pointer to the address of the new element.
278 * Because the tail is always "just before" the head of the list (the
279 * tail's "next" pointer points at the head of the list, and the head's
