Lines Matching defs:index
27 unsigned index, void *elt)
30 if (index < nr_elts)
31 memmove(base + (elt_size * (index + 1)),
32 base + (elt_size * index),
33 (nr_elts - index) * elt_size);
35 memcpy_disk(base + (elt_size * index), elt, elt_size);
85 static int insert_at(size_t value_size, struct btree_node *node, unsigned index,
93 if (index > nr_entries ||
94 index >= max_entries ||
103 array_insert(node->keys, sizeof(*node->keys), nr_entries, index, &key_le);
104 array_insert(value_base(node), value_size, nr_entries, index, value);
697 uint64_t key, unsigned *index)
699 int r, i = *index, top = 1;
754 *index = i;
759 unsigned level, unsigned index)
761 return ((index >= le32_to_cpu(node->header.nr_entries)) ||
762 (le64_to_cpu(node->keys[index]) != keys[level]));
771 unsigned level, index = -1, last_level = info->levels - 1;
781 r = btree_insert_raw(&spine, block, &le64_type, keys[level], &index);
787 if (need_insert(n, keys, level, index)) {
798 r = insert_at(sizeof(uint64_t), n, index,
805 block = value64(n, index);
809 keys[level], &index);
815 if (need_insert(n, keys, level, index)) {
819 r = insert_at(info->value_type.size, n, index,
831 value_ptr(n, index),
834 value_ptr(n, index));
836 memcpy_disk(value_ptr(n, index),
1037 n->index = 0;
1064 n->index++;
1065 if (n->index < le32_to_cpu(bn->header.nr_entries))
1088 memcpy(&value_le, value_ptr(bn, n->index), sizeof(value_le));
1160 *key = le64_to_cpu(*key_ptr(bn, n->index));
1161 memcpy(value_le, value_ptr(bn, n->index), c->info->value_type.size);