Lines Matching full:first
56 for (ln = list->first; ln != NULL; ln = next) { in Lst_Done()
67 for (ln = list->first; ln != NULL; ln = next) { in Lst_DoneFree()
88 if (ln == list->first) in Lst_InsertBefore()
89 list->first = newNode; in Lst_InsertBefore()
100 ln = LstNodeNew(NULL, list->first, datum); in Lst_Prepend()
102 if (list->first == NULL) { in Lst_Prepend()
103 list->first = ln; in Lst_Prepend()
106 list->first->prev = ln; in Lst_Prepend()
107 list->first = ln; in Lst_Prepend()
122 list->first = ln; in Lst_Append()
144 if (list->first == ln) in Lst_Remove()
145 list->first = ln->next; in Lst_Remove()
172 * Return the first node that contains the given datum, or NULL.
183 for (ln = list->first; ln != NULL; ln = ln->next) in Lst_FindDatum()
197 if (src->first != NULL) { in Lst_MoveAll()
198 src->first->prev = dst->last; in Lst_MoveAll()
200 dst->last->next = src->first; in Lst_MoveAll()
202 dst->first = src->first; in Lst_MoveAll()
207 src->first = NULL; in Lst_MoveAll()
228 for (ln = src->first; ln != NULL; ln = ln->next) in Lst_AppendAll()
236 void *datum = list->first->datum; in Lst_Dequeue()
237 Lst_Remove(list, list->first); in Lst_Dequeue()