Lines Matching refs:next
5 and one to the next node in the list. The head of the list is
49 lp->next = NULL;
57 and the next pointer in the new node is set to NULL.
63 while (lp->next) {
64 lp = lp->next;
66 if ((lp->next = malloc(sizeof(list_item))) == NULL) {
70 lp->next->ptr.item = item;
71 lp->next->next = NULL;
87 lp->next = NULL;
113 new_listp->next = start_at_curr ? lp->ptr.curr : lp->next;
129 while (lp->next) {
131 lp = lp->next;
152 while (lp->next) {
153 if (lp->next->ptr.item == item) {
154 new_next = lp->next->next;
155 free(lp->next);
156 lp->next = new_next;
160 lp = lp->next;
177 while (lp->next) {
178 list_ptr del_node = lp->next;
180 lp->next = del_node->next;
191 while (lp->next) {
192 list_ptr del_node = lp->next;
194 lp->next = del_node->next;
215 lp->ptr.curr = lp->next;
221 Returns a ptr to the next *item* (not list node) in the list.
222 Sets the list head node's curr ptr to the next node in the list.
224 Returns NULL if no next item.
234 lp->ptr.curr = lp->ptr.curr->next;
244 return (lp == NULL || lp->next == NULL);