Lines Matching refs:np
136 uu_list_node_impl_t *np = (uu_list_node_impl_t *)np_arg; in uu_list_node_init() local
139 uintptr_t offset = (uintptr_t)np - (uintptr_t)base; in uu_list_node_init()
140 if (offset + sizeof (*np) > pp->ulp_objsize) { in uu_list_node_init()
143 base, (void *)np, (void *)pp, pp->ulp_name, in uu_list_node_init()
149 base, (void *)np, (void *)pp, pp->ulp_name, in uu_list_node_init()
153 np->uln_next = POOL_TO_MARKER(pp); in uu_list_node_init()
154 np->uln_prev = NULL; in uu_list_node_init()
160 uu_list_node_impl_t *np = (uu_list_node_impl_t *)np_arg; in uu_list_node_fini() local
163 if (np->uln_next == NULL && in uu_list_node_fini()
164 np->uln_prev == NULL) { in uu_list_node_fini()
169 if (np->uln_next != POOL_TO_MARKER(pp) || in uu_list_node_fini()
170 np->uln_prev != NULL) { in uu_list_node_fini()
176 np->uln_next = NULL; in uu_list_node_fini()
177 np->uln_prev = NULL; in uu_list_node_fini()
264 list_insert(uu_list_t *lp, uu_list_node_impl_t *np, uu_list_node_impl_t *prev, in list_insert() argument
273 if (np->uln_next != POOL_TO_MARKER(lp->ul_pool) || in list_insert()
274 np->uln_prev != NULL) { in list_insert()
277 (void *)lp, NODE_TO_ELEM(lp, np), (void *)np); in list_insert()
284 np->uln_next = next; in list_insert()
285 np->uln_prev = prev; in list_insert()
286 next->uln_prev = np; in list_insert()
287 prev->uln_next = np; in list_insert()
295 uu_list_node_impl_t *np; in uu_list_insert() local
297 np = INDEX_TO_NODE(idx); in uu_list_insert()
298 if (np == NULL) in uu_list_insert()
299 np = &lp->ul_null_node; in uu_list_insert()
307 if (np->uln_prev == NULL) in uu_list_insert()
312 list_insert(lp, ELEM_TO_NODE(lp, elem), np->uln_prev, np); in uu_list_insert()
320 uu_list_node_impl_t *np; in uu_list_find() local
330 for (np = lp->ul_null_node.uln_next; np != &lp->ul_null_node; in uu_list_find()
331 np = np->uln_next) { in uu_list_find()
332 void *ep = NODE_TO_ELEM(lp, np); in uu_list_find()
336 *out = NODE_TO_INDEX(lp, np); in uu_list_find()
341 *out = NODE_TO_INDEX(lp, np); in uu_list_find()
353 uu_list_node_impl_t *np = INDEX_TO_NODE(idx); in uu_list_nearest_next() local
355 if (np == NULL) in uu_list_nearest_next()
356 np = &lp->ul_null_node; in uu_list_nearest_next()
364 if (np->uln_prev == NULL) in uu_list_nearest_next()
369 if (np == &lp->ul_null_node) in uu_list_nearest_next()
372 return (NODE_TO_ELEM(lp, np)); in uu_list_nearest_next()
378 uu_list_node_impl_t *np = INDEX_TO_NODE(idx); in uu_list_nearest_prev() local
380 if (np == NULL) in uu_list_nearest_prev()
381 np = &lp->ul_null_node; in uu_list_nearest_prev()
388 if (np->uln_prev == NULL) in uu_list_nearest_prev()
393 if ((np = np->uln_prev) == &lp->ul_null_node) in uu_list_nearest_prev()
396 return (NODE_TO_ELEM(lp, np)); in uu_list_nearest_prev()
432 uu_list_node_impl_t *np = wp->ulw_next_result; in list_walk_advance() local
435 if (np == &lp->ul_null_node) in list_walk_advance()
438 next = (wp->ulw_dir > 0)? np->uln_next : np->uln_prev; in list_walk_advance()
441 return (np); in list_walk_advance()
482 uu_list_node_impl_t *np = list_walk_advance(wp, lp); in uu_list_walk_next() local
484 if (np == NULL) in uu_list_walk_next()
487 return (NODE_TO_ELEM(lp, np)); in uu_list_walk_next()
500 uu_list_node_impl_t *np; in uu_list_walk() local
523 for (np = lp->ul_null_node.uln_next; in uu_list_walk()
524 status == UU_WALK_NEXT && np != &lp->ul_null_node; in uu_list_walk()
525 np = np->uln_next) { in uu_list_walk()
526 status = (*func)(NODE_TO_ELEM(lp, np), private); in uu_list_walk()
529 for (np = lp->ul_null_node.uln_prev; in uu_list_walk()
530 status == UU_WALK_NEXT && np != &lp->ul_null_node; in uu_list_walk()
531 np = np->uln_prev) { in uu_list_walk()
532 status = (*func)(NODE_TO_ELEM(lp, np), private); in uu_list_walk()
545 uu_list_node_impl_t *np = ELEM_TO_NODE(lp, elem); in uu_list_remove() local
549 if (np->uln_prev == NULL) in uu_list_remove()
565 if (np == wp->ulw_next_result) in uu_list_remove()
573 np->uln_next->uln_prev = np->uln_prev; in uu_list_remove()
574 np->uln_prev->uln_next = np->uln_next; in uu_list_remove()
578 np->uln_next = POOL_TO_MARKER(lp->ul_pool); in uu_list_remove()
579 np->uln_prev = NULL; in uu_list_remove()
603 uu_list_node_impl_t *np = ELEM_TO_NODE(lp, target); in uu_list_insert_before() local
606 np = &lp->ul_null_node; in uu_list_insert_before()
609 if (np->uln_prev == NULL) in uu_list_insert_before()
622 list_insert(lp, ELEM_TO_NODE(lp, elem), np->uln_prev, np); in uu_list_insert_before()
629 uu_list_node_impl_t *np = ELEM_TO_NODE(lp, target); in uu_list_insert_after() local
632 np = &lp->ul_null_node; in uu_list_insert_after()
635 if (np->uln_prev == NULL) in uu_list_insert_after()
648 list_insert(lp, ELEM_TO_NODE(lp, elem), np, np->uln_next); in uu_list_insert_after()