48 #define	list_insert_after_node(list, node, object) {	\  argument
49 	list_node_t *lnew = list_d2l(list, object);	\
56 #define	list_insert_before_node(list, node, object) {	\  argument
57 	list_node_t *lnew = list_d2l(list, object);	\
95 list_insert_after(list_t *list, void *object, void *nobject)  in list_insert_after()  argument
97 	if (object == NULL) {  in list_insert_after()
100 		list_node_t *lold = list_d2l(list, object);  in list_insert_after()
106 list_insert_before(list_t *list, void *object, void *nobject)  in list_insert_before()  argument
108 	if (object == NULL) {  in list_insert_before()
111 		list_node_t *lold = list_d2l(list, object);  in list_insert_before()
117 list_insert_head(list_t *list, void *object)  in list_insert_head()  argument
120 	list_insert_after_node(list, lold, object);  in list_insert_head()
124 list_insert_tail(list_t *list, void *object)  in list_insert_tail()  argument
127 	list_insert_before_node(list, lold, object);  in list_insert_tail()
131 list_remove(list_t *list, void *object)  in list_remove()  argument
133 	list_node_t *lold = list_d2l(list, object);  in list_remove()
176 list_next(list_t *list, void *object)  in list_next()  argument
178 	list_node_t *node = list_d2l(list, object);  in list_next()
187 list_prev(list_t *list, void *object)  in list_prev()  argument
189 	list_node_t *node = list_d2l(list, object);  in list_prev()