Lines Matching refs:next
49 return lst->head.next;
59 * Else, removes the element at the head of the list, making the next
62 * "next" pointer at the next element after the head, and by making the
63 * "prev" pointer of the next element after the head point at the tail
64 * element. So the next element after the head becomes the new head of
77 * Because the tail of the list points forward (its "next" pointer) to
88 elem_list = lst->head.next;
89 lst->head.next = elem_list->next;
90 elem_list->next->prev = &lst->head;
114 elem_list->next = NULL;
146 * Returns a pointer to the next element of the list, or NULL if the next
163 (cur_elem->next != &lst->head))
164 return cur_elem->next;
177 * Sets next pointer of the previous tail member of the list to point to
179 * Sets new element's next pointer to the address of the head element.
193 * tail's "next" pointer points at the head of the list, and the head's