Lines Matching refs:index
129 static void delete_at(struct btree_node *n, unsigned int index)
132 unsigned int nr_to_copy = nr_entries - (index + 1);
135 BUG_ON(index >= nr_entries);
138 memmove(key_ptr(n, index),
139 key_ptr(n, index + 1),
142 memmove(value_ptr(n, index),
143 value_ptr(n, index + 1),
156 unsigned int index;
163 unsigned int index, struct child *result)
168 result->index = index;
169 root = value64(parent, index);
181 *((__le64 *) value_ptr(parent, index)) =
258 delete_at(parent, r->index);
274 *key_ptr(parent, r->index) = right->keys[0];
339 *key_ptr(parent, r->index) = right->keys[0];
341 delete_at(parent, c->index);
342 r->index--;
413 *key_ptr(parent, c->index) = center->keys[0];
414 *key_ptr(parent, r->index) = right->keys[0];
526 static int do_leaf(struct btree_node *n, uint64_t key, unsigned int *index)
535 *index = i;
542 * call delete_at() to remove the entry at index.
546 uint64_t key, unsigned int *index)
548 int i = *index, r;
571 return do_leaf(n, key, index);
579 return do_leaf(n, key, index);
598 int index = 0, r = 0;
609 root, keys[level], (unsigned int *)&index);
615 root = value64(n, index);
619 BUG_ON(index < 0 || index >= le32_to_cpu(n->header.nr_entries));
623 value_ptr(n, index), 1);
625 delete_at(n, index);
640 uint64_t key, int *index)
642 int i = *index, r;
665 *index = lower_bound(n, key);
675 *index = lower_bound(n, key);
697 int index = 0, r = 0;
707 root, keys[level], (unsigned int *) &index);
712 root = value64(n, index);
716 root, keys[last_level], &index);
722 if (index < 0)
723 index = 0;
725 if (index >= le32_to_cpu(n->header.nr_entries)) {
730 k = le64_to_cpu(n->keys[index]);
734 value_ptr(n, index), 1);
736 delete_at(n, index);