Lines Matching refs:index
46 * the tree for this index (no matter what level of the tree it is found at).
92 * @index: index of current slot
93 * @next_index: one beyond the last index for this chunk
105 unsigned long index;
217 int radix_tree_insert(struct radix_tree_root *, unsigned long index,
219 void *__radix_tree_lookup(const struct radix_tree_root *, unsigned long index,
223 unsigned long index);
241 unsigned long index, unsigned int tag);
243 unsigned long index, unsigned int tag);
245 unsigned long index, unsigned int tag);
266 RADIX_TREE_ITER_TAG_MASK = 0x0f, /* tag index in lower nybble */
275 * @start: iteration starting index
286 * Set index to zero to bypass next_index overflow protection.
289 iter->index = 0;
299 * @flags: RADIX_TREE_ITER_* flags and tag index
304 * Also it fills @iter with data about chunk: position in the tree (index),
311 * radix_tree_iter_lookup - look up an index in the radix tree
314 * @index: key to look up
316 * If @index is present in the radix tree, this function returns the slot
317 * containing it and updates @iter to describe the entry. If @index is not
322 struct radix_tree_iter *iter, unsigned long index)
324 radix_tree_iter_init(iter, index);
340 iter->next_index = iter->index;
348 return iter->index + slots;
359 * before releasing the lock to continue the iteration from the next index.
373 return iter->next_index - iter->index;
384 * This function updates @iter->index in the case of a successful lookup.
392 * b) we are doing non-tagged iteration, and iter->index and iter->next_index
403 iter->index = __radix_tree_iter_add(iter, 1);
411 iter->index = __radix_tree_iter_add(iter, offset);
420 iter->index = __radix_tree_iter_add(iter, 1);
443 * @start: iteration starting index
445 * @slot points to radix tree slot, @iter->index contains its index.
458 * @start: iteration starting index
459 * @tag: tag index
461 * @slot points to radix tree slot, @iter->index contains its index.