Lines Matching refs:keys
43 /* makes the assumption that no two keys are the same. */
50 uint64_t mid_key = le64_to_cpu(n->keys[mid]);
104 array_insert(node->keys, sizeof(*node->keys), nr_entries, index, &key_le);
367 *result_key = le64_to_cpu(ro_node(s)->keys[i]);
375 uint64_t *keys, void *value_le)
397 r = btree_lookup_raw(&spine, root, keys[level],
402 if (rkey != keys[level]) {
462 *rkey = le64_to_cpu(n->keys[i]);
471 uint64_t *keys, uint64_t *rkey, void *value_le)
480 r = btree_lookup_raw(&spine, root, keys[level],
486 if (*rkey != keys[level]) {
494 r = dm_btree_lookup_next_single(info, root, keys[level], rkey, value_le);
513 memcpy(dest->keys + dest_offset, src->keys + src_offset, count * sizeof(uint64_t));
527 memmove(dest->keys + dest_offset, src->keys + src_offset, count * sizeof(uint64_t));
684 le64_to_cpu(rn->keys[0]), &location);
691 if (key < le64_to_cpu(rn->keys[0])) {
779 pn->keys[middle_index] = rn->keys[0];
783 le64_to_cpu(mn->keys[0]), &location);
798 if (key < le64_to_cpu(mn->keys[0])) {
802 } else if (key < le64_to_cpu(rn->keys[0])) {
865 memcpy(ln->keys, pn->keys, nr_left * sizeof(pn->keys[0]));
882 memcpy(rn->keys, pn->keys + nr_left, nr_right * sizeof(pn->keys[0]));
897 pn->keys[0] = ln->keys[0];
902 pn->keys[1] = rn->keys[0];
929 *key_ptr(parent, parent_index) = right->keys[0];
931 if (key < le64_to_cpu(right->keys[0])) {
958 *key_ptr(parent, parent_index + 1) = right->keys[0];
960 if (key < le64_to_cpu(right->keys[0])) {
1067 if (i >= 0 && le64_to_cpu(node->keys[i]) == key)
1141 node->keys[0] = cpu_to_le64(key);
1149 if (i < 0 || le64_to_cpu(node->keys[i]) != key)
1190 if (key != le64_to_cpu(node->keys[i]))
1227 static bool need_insert(struct btree_node *node, uint64_t *keys,
1231 (le64_to_cpu(node->keys[index]) != keys[level]));
1235 uint64_t *keys, void *value, dm_block_t *new_root,
1250 r = btree_insert_raw(&spine, block, &le64_type, keys[level], &index);
1256 if (need_insert(n, keys, level, index)) {
1268 keys[level], &new_le);
1278 keys[level], &index);
1284 if (need_insert(n, keys, level, index)) {
1289 keys[level], value);
1322 uint64_t *keys, void *value, dm_block_t *new_root)
1325 return insert(info, root, keys, value, new_root, NULL);
1330 uint64_t *keys, void *value, dm_block_t *new_root,
1334 return insert(info, root, keys, value, new_root, inserted);
1359 *result_key = le64_to_cpu(ro_node(s)->keys[i]);
1361 *result_key = le64_to_cpu(ro_node(s)->keys[0]);
1422 int (*fn)(void *context, uint64_t *keys, void *leaf),
1429 uint64_t keys;
1444 keys = le64_to_cpu(*key_ptr(n, i));
1445 r = fn(context, &keys, value_ptr(n, i));
1457 int (*fn)(void *context, uint64_t *keys, void *leaf),