Lines Matching defs:list_next
46 #define list_empty(a) ((a)->list_head.list_next == &(a)->list_head)
51 lnew->list_next = (node)->list_next; \
52 (node)->list_next->list_prev = lnew; \
53 (node)->list_next = lnew; \
58 lnew->list_next = (node); \
60 (node)->list_prev->list_next = lnew; \
65 (node)->list_prev->list_next = (node)->list_next; \
66 (node)->list_next->list_prev = (node)->list_prev; \
67 (node)->list_next = (node)->list_prev = NULL
78 list->list_head.list_next = list->list_head.list_prev =
88 ASSERT(list->list_head.list_next == node);
91 node->list_next = node->list_prev = NULL;
135 ASSERT(lold->list_next != NULL);
142 list_node_t *head = list->list_head.list_next;
164 return (list_object(list, list->list_head.list_next));
176 list_next(list_t *list, void *object)
180 if (node->list_next != &list->list_head)
181 return (list_object(list, node->list_next));
212 dstnode->list_prev->list_next = srcnode->list_next;
213 srcnode->list_next->list_prev = dstnode->list_prev;
215 srcnode->list_prev->list_next = dstnode;
218 srcnode->list_next = srcnode->list_prev = srcnode;
227 lnew->list_next = lold->list_next;
229 lold->list_prev->list_next = lnew;
230 lold->list_next->list_prev = lnew;
231 lold->list_next = lold->list_prev = NULL;
237 link->list_next = NULL;
244 return (link->list_next != NULL);