Lines Matching refs:next
38 #define list_empty(a) ((a)->list_head.next == &(a)->list_head)
43 lnew->next = (node)->next; \
44 (node)->next->prev = lnew; \
45 (node)->next = lnew; \
50 lnew->next = (node); \
52 (node)->prev->next = lnew; \
57 (node)->prev->next = (node)->next; \
58 (node)->next->prev = (node)->prev; \
59 (node)->next = (node)->prev = NULL
70 list->list_head.next = list->list_head.prev = &list->list_head;
79 ASSERT(list->list_head.next == node);
82 node->next = node->prev = NULL;
126 ASSERT(lold->next != NULL);
133 list_node_t *head = list->list_head.next;
155 return (list_object(list, list->list_head.next));
171 if (node->next != &list->list_head)
172 return (list_object(list, node->next));
203 dstnode->prev->next = srcnode->next;
204 srcnode->next->prev = dstnode->prev;
206 srcnode->prev->next = dstnode;
209 srcnode->next = srcnode->prev = srcnode;
218 lnew->next = lold->next;
220 lold->prev->next = lnew;
221 lold->next->prev = lnew;
222 lold->next = lold->prev = NULL;
228 ln->next = NULL;
235 EQUIV(ln->next == NULL, ln->prev == NULL);
236 return (ln->next != NULL);