common/avl/avl.c

470 avl_insert(avl_tree_t *tree, void *new_data, avl_index_t where)
481 	ASSERT(((uintptr_t)new_data & 0x7) == 0);
484 	node = AVL_DATA2NODE(new_data, off);
548  * Insert "new_data" in "tree" in the given "direction" either after or
562 	void *new_data,
573 	ASSERT(new_data != NULL);
584 	diff = tree->avl_compar(new_data, here);
595 			diff = tree->avl_compar(new_data,
604 		diff = tree->avl_compar(new_data,
613 	avl_insert(tree, new_data, AVL_MKINDEX(node, child));