Lines Matching full:list
19 * ======== list.h ========
22 * Declarations of list management control structures and definitions
23 * of inline list management functions.
79 * Allocates and initializes a circular list.
81 * Uses portable MEM_Calloc() function to allocate a list containing
83 * is the "end of the list" (i.e., the list is empty).
84 * An empty list is indicated by the "next" pointer in the element
85 * at the head of the list pointing to the head of the list, itself.
88 * Pointer to beginning of created list (success)
94 * The created list contains a single element. This element is the
103 * Removes a list by freeing its control structure's memory space.
108 * pList: Pointer to list control structure of list to be deleted
117 * chain of list elements. Calling this function on a non-empty list
139 * Returns a pointer to the first element of the list, or NULL if the list
142 * pList: Pointer to list control structure.
144 * Pointer to first list element, or NULL.
155 * Pops the head off the list and returns a pointer to it.
157 * If the list is empty, returns NULL.
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
164 * the list.
166 * pList: Pointer to list control structure of list whose head
169 * Pointer to element that was at the head of the list (success)
170 * NULL No elements in list
177 * Because the tail of the list points forward (its "next" pointer) to
178 * the head of the list, and the head of the list points backward (its
179 * "prev" pointer) to the tail of the list, this list is circular.
199 * Initializes a list element to default (cleared) values
202 * pElem: Pointer to list element to be reset
209 * of a list chain -- that would break the chain.
219 * pList: Pointer to list control structure.
220 * pElem: Pointer to element in list to insert.
221 * pElemExisting: Pointer to existing list element.
237 * Returns a pointer to the next element of the list, or NULL if the next
238 * element is the head of the list or the list is empty.
240 * pList: Pointer to list control structure.
241 * pCurElem: Pointer to element in list to remove.
243 * Pointer to list element, or NULL.
256 * Adds the specified element to the tail of the list
260 * the list.
262 * Sets next pointer of the previous tail member of the list to point to
267 * pList: Pointer to list control structure to which *pElem will be
269 * pElem: Pointer to list element to be added
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
280 * "prev" pointer points at the tail of the list), the list is circular.
290 * Removes (unlinks) the given element from the list, if the list is not
291 * empty. Does not free the list element.
293 * pList: Pointer to list control structure.
294 * pCurElem: Pointer to element in list to remove.
