Lines Matching refs:next
38 * To use singly-linked lists, your structure must have a "next" pointer.
39 * To use doubly-linked lists, your structure must "prev" and "next" pointers.
45 * struct item *prev, *next;
66 (add)->next = head; \
75 while (_tmp->next) \
76 _tmp = _tmp->next; \
77 _tmp->next = (head2); \
85 (add)->next = NULL; \
88 while (_tmp->next) \
89 _tmp = _tmp->next; \
90 _tmp->next = (add); \
100 (head) = (head)->next; \
103 while (_tmp->next && (_tmp->next != (del))) \
104 _tmp = _tmp->next; \
105 if (_tmp->next) \
106 _tmp->next = ((del)->next); \
111 for (el = head; el; el = el->next)
114 for ((el) = (head); (el) && (tmp = (el)->next, 1); (el) = tmp)
145 (add)->next = head; \
158 (head)->prev->next = (add); \
160 (add)->next = NULL; \
164 (head)->next = NULL; \
176 (next_node)->prev->next = (add); \
177 (add)->next = (next_node); \
189 (head1)->prev->next = (head2); \
202 (del)->next->prev = (del)->prev; \
203 (head) = (del)->next; \
205 (del)->prev->next = (del)->next; \
206 if ((del)->next) \
207 (del)->next->prev = (del)->prev; \
225 for ((el) = (head); (el) && (tmp = (el)->next, 1); (el) = tmp)
