126 	struct item *items[chunk];  in item_gang_check_present()  local
137 		nfound = radix_tree_gang_lookup(root, (void **)items,  in item_gang_check_present()
141 			assert(items[i]->index == start + into + i);  in item_gang_check_present()
152 	struct item *items[chunk];  in item_full_scan()  local
160 	while ((nfound = radix_tree_gang_lookup(root, (void **)items, into,  in item_full_scan()
164 			assert(items[i]->index == this_index);  in item_full_scan()
173 	nfound = radix_tree_gang_lookup(root, (void **)items,  in item_full_scan()
294 	struct item *items[32];  in item_kill_tree()  local
302 	while ((nfound = radix_tree_gang_lookup(root, (void **)items, 0, 32))) {  in item_kill_tree()
308 			ret = radix_tree_delete(root, items[i]->index);  in item_kill_tree()
309 			assert(ret == items[i]);  in item_kill_tree()
310 			free(items[i]);  in item_kill_tree()
313 	assert(radix_tree_gang_lookup(root, (void **)items, 0, 32) == 0);  in item_kill_tree()