libuutil/common/uu_list.c

135 	uu_list_node_impl_t *np = (uu_list_node_impl_t *)np_arg;
138 		uintptr_t offset = (uintptr_t)np - (uintptr_t)base;
139 		if (offset + sizeof (*np) > pp->ulp_objsize) {
142 			    base, (void *)np, (void *)pp, pp->ulp_name,
148 			    base, (void *)np, (void *)pp, pp->ulp_name,
152 	np->uln_next = POOL_TO_MARKER(pp);
153 	np->uln_prev = NULL;
159 	uu_list_node_impl_t *np = (uu_list_node_impl_t *)np_arg;
162 		if (np->uln_next == NULL &&
163 		    np->uln_prev == NULL) {
168 		if (np->uln_next != POOL_TO_MARKER(pp) ||
169 		    np->uln_prev != NULL) {
175 	np->uln_next = NULL;
176 	np->uln_prev = NULL;
263 list_insert(uu_list_t *lp, uu_list_node_impl_t *np, uu_list_node_impl_t *prev,
272 		if (np->uln_next != POOL_TO_MARKER(lp->ul_pool) ||
273 		    np->uln_prev != NULL) {
276 			    (void *)lp, NODE_TO_ELEM(lp, np), (void *)np);
283 	np->uln_next = next;
284 	np->uln_prev = prev;
285 	next->uln_prev = np;
286 	prev->uln_next = np;
294 	uu_list_node_impl_t *np;
296 	np = INDEX_TO_NODE(idx);
297 	if (np == NULL)
298 		np = &lp->ul_null_node;
306 		if (np->uln_prev == NULL)
311 	list_insert(lp, ELEM_TO_NODE(lp, elem), np->uln_prev, np);
319 	uu_list_node_impl_t *np;
327 	for (np = lp->ul_null_node.uln_next; np != &lp->ul_null_node;
328 	    np = np->uln_next) {
329 		void *ep = NODE_TO_ELEM(lp, np);
333 				*out = NODE_TO_INDEX(lp, np);
338 				*out = NODE_TO_INDEX(lp, np);
350 	uu_list_node_impl_t *np = INDEX_TO_NODE(idx);
352 	if (np == NULL)
353 		np = &lp->ul_null_node;
361 		if (np->uln_prev == NULL)
366 	if (np == &lp->ul_null_node)
369 		return (NODE_TO_ELEM(lp, np));
375 	uu_list_node_impl_t *np = INDEX_TO_NODE(idx);
377 	if (np == NULL)
378 		np = &lp->ul_null_node;
385 		if (np->uln_prev == NULL)
390 	if ((np = np->uln_prev) == &lp->ul_null_node)
393 		return (NODE_TO_ELEM(lp, np));
429 	uu_list_node_impl_t *np = wp->ulw_next_result;
432 	if (np == &lp->ul_null_node)
435 	next = (wp->ulw_dir > 0)? np->uln_next : np->uln_prev;
438 	return (np);
479 	uu_list_node_impl_t *np = list_walk_advance(wp, lp);
481 	if (np == NULL)
484 	return (NODE_TO_ELEM(lp, np));
497 	uu_list_node_impl_t *np;
520 			for (np = lp->ul_null_node.uln_next;
521 			    status == UU_WALK_NEXT && np != &lp->ul_null_node;
522 			    np = np->uln_next) {
523 				status = (*func)(NODE_TO_ELEM(lp, np), private);
526 			for (np = lp->ul_null_node.uln_prev;
527 			    status == UU_WALK_NEXT && np != &lp->ul_null_node;
528 			    np = np->uln_prev) {
529 				status = (*func)(NODE_TO_ELEM(lp, np), private);
542 	uu_list_node_impl_t *np = ELEM_TO_NODE(lp, elem);
546 		if (np->uln_prev == NULL)
562 			if (np == wp->ulw_next_result)
570 	np->uln_next->uln_prev = np->uln_prev;
571 	np->uln_prev->uln_next = np->uln_next;
575 	np->uln_next = POOL_TO_MARKER(lp->ul_pool);
576 	np->uln_prev = NULL;
600 	uu_list_node_impl_t *np = ELEM_TO_NODE(lp, target);
603 		np = &lp->ul_null_node;
606 		if (np->uln_prev == NULL)
619 	list_insert(lp, ELEM_TO_NODE(lp, elem), np->uln_prev, np);
626 	uu_list_node_impl_t *np = ELEM_TO_NODE(lp, target);
629 		np = &lp->ul_null_node;
632 		if (np->uln_prev == NULL)
645 	list_insert(lp, ELEM_TO_NODE(lp, elem), np, np->uln_next);