273 static unsigned long next_index(unsigned long index,  in next_index()  function
1607 		iter->next_index = __radix_tree_iter_add(iter, BITS_PER_LONG);  in set_iter_tags()
1615 	while (iter->index < iter->next_index) {  in skip_siblings()
1638 		unsigned long next_index;  in __radix_tree_next_slot()  local
1670 		next_index = (iter->index | shift_maxindex(iter->shift)) + 1;  in __radix_tree_next_slot()
1671 		if (next_index < iter->next_index)  in __radix_tree_next_slot()
1672 			iter->next_index = next_index;  in __radix_tree_next_slot()
1677 	iter->next_index = 0;  in __radix_tree_next_slot()
1697 	iter->next_index = iter->index;  in radix_tree_iter_resume()
1730 	index = iter->next_index;  in radix_tree_next_chunk()
1744 		iter->next_index = maxindex + 1;  in radix_tree_next_chunk()
1791 	iter->next_index = (index | node_maxindex(node)) + 1;  in radix_tree_next_chunk()
2018 		iter->index = iter->next_index;  in radix_tree_iter_delete()
2136 	unsigned long maxindex, start = iter->next_index;  in idr_get_free()
2174 			start = next_index(start, node, offset);  in idr_get_free()
2191 		iter->next_index = 1 + min(max, (start | node_maxindex(node)));  in idr_get_free()
2193 		iter->next_index = 1;  in idr_get_free()