121 	unsigned long into;  in item_gang_check_present()  local
123 	for (into = 0; into < nr; ) {  in item_gang_check_present()
128 		if (nr_to_find > (nr - into))  in item_gang_check_present()
129 			nr_to_find = nr - into;  in item_gang_check_present()
132 						start + into, nr_to_find);  in item_gang_check_present()
135 			assert(items[i]->index == start + into + i);  in item_gang_check_present()
136 		into += hop;  in item_gang_check_present()
147 	unsigned long into = 0;  in item_full_scan()  local
154 	while ((nfound = radix_tree_gang_lookup(root, (void **)items, into,  in item_full_scan()
156 //		printf("At 0x%08lx, nfound=%d\n", into, nfound);  in item_full_scan()
163 		into = this_index;  in item_full_scan()