130 		int nfound;  in item_gang_check_present()  local
137 		nfound = radix_tree_gang_lookup(root, (void **)items,  in item_gang_check_present()
139 		assert(nfound == nr_to_find);  in item_gang_check_present()
140 		for (i = 0; i < nfound; i++)  in item_gang_check_present()
155 	int nfound;  in item_full_scan()  local
160 	while ((nfound = radix_tree_gang_lookup(root, (void **)items, into,  in item_full_scan()
163 		for (i = 0; i < nfound; i++) {  in item_full_scan()
173 	nfound = radix_tree_gang_lookup(root, (void **)items,  in item_full_scan()
175 	assert(nfound == 0);  in item_full_scan()
295 	int nfound;  in item_kill_tree()  local
302 	while ((nfound = radix_tree_gang_lookup(root, (void **)items, 0, 32))) {  in item_kill_tree()
305 		for (i = 0; i < nfound; i++) {  in item_kill_tree()