105 	struct avl_tree	tree;  member
182 	avl_create(&cache->sid2pid.tree, (avl_comp_fn)kidmap_compare_sid,  in kidmap_cache_create()
192 	avl_create(&cache->uid2sid.tree, (avl_comp_fn)kidmap_compare_pid,  in kidmap_cache_create()
199 	avl_create(&cache->gid2sid.tree, (avl_comp_fn)kidmap_compare_pid,  in kidmap_cache_create()
216 	while ((sid2pid = avl_destroy_nodes(&cache->sid2pid.tree, &cookie))  in kidmap_cache_delete()
220 	avl_destroy(&cache->sid2pid.tree);  in kidmap_cache_delete()
225 	while ((pid2sid = avl_destroy_nodes(&cache->uid2sid.tree, &cookie))  in kidmap_cache_delete()
229 	avl_destroy(&cache->uid2sid.tree);  in kidmap_cache_delete()
234 	while ((pid2sid = avl_destroy_nodes(&cache->gid2sid.tree, &cookie))  in kidmap_cache_delete()
238 	avl_destroy(&cache->gid2sid.tree);  in kidmap_cache_delete()
254 	*sidbyuid = avl_numnodes(&cache->uid2sid.tree);  in kidmap_cache_get_data()
258 	*sidbygid = avl_numnodes(&cache->gid2sid.tree);  in kidmap_cache_get_data()
272 	while ((sid2pid = avl_destroy_nodes(&cache->sid2pid.tree, &cookie))  in kidmap_cache_purge()
276 	avl_destroy(&cache->sid2pid.tree);  in kidmap_cache_purge()
277 	avl_create(&cache->sid2pid.tree, (avl_comp_fn)kidmap_compare_sid,  in kidmap_cache_purge()
290 	while ((pid2sid = avl_destroy_nodes(&cache->uid2sid.tree, &cookie))  in kidmap_cache_purge()
294 	avl_destroy(&cache->uid2sid.tree);  in kidmap_cache_purge()
295 	avl_create(&cache->uid2sid.tree, (avl_comp_fn)kidmap_compare_pid,  in kidmap_cache_purge()
305 	while ((pid2sid = avl_destroy_nodes(&cache->gid2sid.tree, &cookie))  in kidmap_cache_purge()
309 	avl_destroy(&cache->gid2sid.tree);  in kidmap_cache_purge()
310 	avl_create(&cache->gid2sid.tree, (avl_comp_fn)kidmap_compare_pid,  in kidmap_cache_purge()
334 	result = avl_find(&cache->sid2pid.tree, &entry, &where);  in kidmap_cache_lookup_uidbysid()
364 	result = avl_find(&cache->sid2pid.tree, &entry, &where);  in kidmap_cache_lookup_gidbysid()
394 	result = avl_find(&cache->sid2pid.tree, &entry, &where);  in kidmap_cache_lookup_pidbysid()
431 	result = avl_find(&cache->uid2sid.tree, &entry, &where);  in kidmap_cache_lookup_sidbyuid()
461 	result = avl_find(&cache->gid2sid.tree, &entry, &where);  in kidmap_cache_lookup_sidbygid()
497 		result = avl_find(&cache->sid2pid.tree, &find, &where);  in kidmap_cache_add_sid2uid()
515 			avl_insert(&cache->sid2pid.tree, new, where);  in kidmap_cache_add_sid2uid()
518 		if ((avl_numnodes(&cache->sid2pid.tree) >  in kidmap_cache_add_sid2uid()
538 		result = avl_find(&cache->uid2sid.tree, &find, &where);  in kidmap_cache_add_sid2uid()
551 			avl_insert(&cache->uid2sid.tree, new, where);  in kidmap_cache_add_sid2uid()
554 		if ((avl_numnodes(&cache->uid2sid.tree) >  in kidmap_cache_add_sid2uid()
586 		result = avl_find(&cache->sid2pid.tree, &find, &where);  in kidmap_cache_add_sid2gid()
604 			avl_insert(&cache->sid2pid.tree, new, where);  in kidmap_cache_add_sid2gid()
607 		if ((avl_numnodes(&cache->sid2pid.tree) >  in kidmap_cache_add_sid2gid()
627 		result = avl_find(&cache->gid2sid.tree, &find, &where);  in kidmap_cache_add_sid2gid()
640 			avl_insert(&cache->gid2sid.tree, new, where);  in kidmap_cache_add_sid2gid()
643 		if ((avl_numnodes(&cache->gid2sid.tree) >  in kidmap_cache_add_sid2gid()
674 		result = avl_find(&cache->sid2pid.tree, &find, &where);  in kidmap_cache_add_sid2pid()
711 			avl_insert(&cache->sid2pid.tree, new, where);  in kidmap_cache_add_sid2pid()
714 		if ((avl_numnodes(&cache->sid2pid.tree) >  in kidmap_cache_add_sid2pid()
734 			result = avl_find(&cache->uid2sid.tree, &find, &where);  in kidmap_cache_add_sid2pid()
747 				avl_insert(&cache->uid2sid.tree, new, where);  in kidmap_cache_add_sid2pid()
750 			if ((avl_numnodes(&cache->uid2sid.tree) >  in kidmap_cache_add_sid2pid()
762 			result = avl_find(&cache->gid2sid.tree, &find, &where);  in kidmap_cache_add_sid2pid()
775 				avl_insert(&cache->gid2sid.tree, new, where);  in kidmap_cache_add_sid2pid()
778 			if ((avl_numnodes(&cache->gid2sid.tree) >  in kidmap_cache_add_sid2pid()
800 	while (avl_numnodes(&cache->tree) > limit) {  in kidmap_purge_sid2pid_cache()
804 		avl_remove(&cache->tree, item);  in kidmap_purge_sid2pid_cache()
823 	while (avl_numnodes(&cache->tree) > limit) {  in kidmap_purge_pid2sid_cache()
827 		avl_remove(&cache->tree, item);  in kidmap_purge_pid2sid_cache()
843 		avl_create(&kidmap_sid_prefix_store->tree,  in kidmap_sid_prefix_store_init()
855 		kidmap_sid_prefix_store->tree.avl_compar =  in kidmap_sid_prefix_store_init()
875 	result = avl_find(&kidmap_sid_prefix_store->tree, &find, &where);  in kidmap_find_sid_prefix()
890 		result = avl_find(&kidmap_sid_prefix_store->tree,  in kidmap_find_sid_prefix()
900 	avl_insert(&kidmap_sid_prefix_store->tree, new, where);  in kidmap_find_sid_prefix()