Lines Matching defs:keys

40 /* makes the assumption that no two keys are the same. */
47 uint64_t mid_key = le64_to_cpu(n->keys[mid]);
103 array_insert(node->keys, sizeof(*node->keys), nr_entries, index, &key_le);
370 *result_key = le64_to_cpu(ro_node(s)->keys[i]);
378 uint64_t *keys, void *value_le)
400 r = btree_lookup_raw(&spine, root, keys[level],
405 if (rkey != keys[level]) {
465 *rkey = le64_to_cpu(n->keys[i]);
474 uint64_t *keys, uint64_t *rkey, void *value_le)
483 r = btree_lookup_raw(&spine, root, keys[level],
489 if (*rkey != keys[level]) {
497 r = dm_btree_lookup_next_single(info, root, keys[level], rkey, value_le);
563 memcpy(rn->keys, ln->keys + nr_left, nr_right * sizeof(rn->keys[0]));
585 le64_to_cpu(rn->keys[0]), &location);
591 if (key < le64_to_cpu(rn->keys[0])) {
650 memcpy(ln->keys, pn->keys, nr_left * sizeof(pn->keys[0]));
667 memcpy(rn->keys, pn->keys + nr_left, nr_right * sizeof(pn->keys[0]));
682 pn->keys[0] = ln->keys[0];
687 pn->keys[1] = rn->keys[0];
743 node->keys[0] = cpu_to_le64(key);
751 if (i < 0 || le64_to_cpu(node->keys[i]) != key)
758 static bool need_insert(struct btree_node *node, uint64_t *keys,
762 (le64_to_cpu(node->keys[index]) != keys[level]));
766 uint64_t *keys, void *value, dm_block_t *new_root,
781 r = btree_insert_raw(&spine, block, &le64_type, keys[level], &index);
787 if (need_insert(n, keys, level, index)) {
799 keys[level], &new_le);
809 keys[level], &index);
815 if (need_insert(n, keys, level, index)) {
820 keys[level], value);
853 uint64_t *keys, void *value, dm_block_t *new_root)
856 return insert(info, root, keys, value, new_root, NULL);
861 uint64_t *keys, void *value, dm_block_t *new_root,
865 return insert(info, root, keys, value, new_root, inserted);
890 *result_key = le64_to_cpu(ro_node(s)->keys[i]);
892 *result_key = le64_to_cpu(ro_node(s)->keys[0]);
953 int (*fn)(void *context, uint64_t *keys, void *leaf),
960 uint64_t keys;
975 keys = le64_to_cpu(*key_ptr(n, i));
976 r = fn(context, &keys, value_ptr(n, i));
988 int (*fn)(void *context, uint64_t *keys, void *leaf),