Lines Matching refs:index
70 radix_tree_lookup(struct radix_tree_root *root, unsigned long index)
79 if (index > radix_max(root))
82 node = node->slots[radix_pos(index, height--)];
84 item = node->slots[radix_pos(index, 0)];
95 unsigned long index = iter->index;
103 if (height == -1 || index > radix_max(root))
108 int pos = radix_pos(index, height);
116 index += step;
117 index &= -step;
118 if ((index & mask) == 0)
125 iter->index = index;
130 radix_tree_delete(struct radix_tree_root *root, unsigned long index)
141 if (index > radix_max(root))
148 node = node->slots[radix_pos(index, height--)];
150 idx = radix_pos(index, 0);
170 idx = radix_pos(index, height);
180 radix_tree_delete(root, iter->index);
184 radix_tree_insert(struct radix_tree_root *root, unsigned long index, void *item)
208 while (radix_max(root) < index) {
239 /* get radix tree height index */
244 idx = radix_pos(index, height);
264 idx = radix_pos(index, height);
273 idx = radix_pos(index, 0);
283 radix_tree_store(struct radix_tree_root *root, unsigned long index, void **ppitem)
296 *ppitem = radix_tree_delete(root, index);
313 while (radix_max(root) < index) {
344 /* get radix tree height index */
349 idx = radix_pos(index, height);
369 idx = radix_pos(index, height);
378 idx = radix_pos(index, 0);