Lines Matching refs:tree

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