Lines Matching refs:keys
47 uint64_t mid_key = le64_to_cpu(n->keys[mid]); in bsearch()
99 array_insert(node->keys, sizeof(*node->keys), nr_entries, index, &key_le); in insert_at()
362 *result_key = le64_to_cpu(ro_node(s)->keys[i]); in btree_lookup_raw()
370 uint64_t *keys, void *value_le) in dm_btree_lookup() argument
392 r = btree_lookup_raw(&spine, root, keys[level], in dm_btree_lookup()
397 if (rkey != keys[level]) { in dm_btree_lookup()
457 *rkey = le64_to_cpu(n->keys[i]); in dm_btree_lookup_next_single()
466 uint64_t *keys, uint64_t *rkey, void *value_le) in dm_btree_lookup_next() argument
475 r = btree_lookup_raw(&spine, root, keys[level], in dm_btree_lookup_next()
481 if (*rkey != keys[level]) { in dm_btree_lookup_next()
489 r = dm_btree_lookup_next_single(info, root, keys[level], rkey, value_le); in dm_btree_lookup_next()
508 memcpy(dest->keys + dest_offset, src->keys + src_offset, count * sizeof(uint64_t)); in copy_entries()
521 memmove(dest->keys + dest_offset, src->keys + src_offset, count * sizeof(uint64_t)); in move_entries()
673 le64_to_cpu(rn->keys[0]), &location); in split_one_into_two()
680 if (key < le64_to_cpu(rn->keys[0])) { in split_one_into_two()
768 pn->keys[middle_index] = rn->keys[0]; in split_two_into_three()
772 le64_to_cpu(mn->keys[0]), &location); in split_two_into_three()
787 if (key < le64_to_cpu(mn->keys[0])) { in split_two_into_three()
791 } else if (key < le64_to_cpu(rn->keys[0])) { in split_two_into_three()
854 memcpy(ln->keys, pn->keys, nr_left * sizeof(pn->keys[0])); in btree_split_beneath()
871 memcpy(rn->keys, pn->keys + nr_left, nr_right * sizeof(pn->keys[0])); in btree_split_beneath()
886 pn->keys[0] = ln->keys[0]; in btree_split_beneath()
891 pn->keys[1] = rn->keys[0]; in btree_split_beneath()
918 *key_ptr(parent, parent_index) = right->keys[0]; in rebalance_left()
920 if (key < le64_to_cpu(right->keys[0])) { in rebalance_left()
947 *key_ptr(parent, parent_index + 1) = right->keys[0]; in rebalance_right()
949 if (key < le64_to_cpu(right->keys[0])) { in rebalance_right()
1054 if (i >= 0 && le64_to_cpu(node->keys[i]) == key) in contains_key()
1128 node->keys[0] = cpu_to_le64(key); in btree_insert_raw()
1136 if (i < 0 || le64_to_cpu(node->keys[i]) != key) in btree_insert_raw()
1177 if (key != le64_to_cpu(node->keys[i])) in __btree_get_overwrite_leaf()
1214 static bool need_insert(struct btree_node *node, uint64_t *keys, in need_insert() argument
1218 (le64_to_cpu(node->keys[index]) != keys[level])); in need_insert()
1222 uint64_t *keys, void *value, dm_block_t *new_root, in insert() argument
1237 r = btree_insert_raw(&spine, block, &le64_type, keys[level], &index); in insert()
1243 if (need_insert(n, keys, level, index)) { in insert()
1255 keys[level], &new_le); in insert()
1265 keys[level], &index); in insert()
1271 if (need_insert(n, keys, level, index)) { in insert()
1276 keys[level], value); in insert()
1309 uint64_t *keys, void *value, dm_block_t *new_root) in dm_btree_insert() argument
1312 return insert(info, root, keys, value, new_root, NULL); in dm_btree_insert()
1317 uint64_t *keys, void *value, dm_block_t *new_root, in dm_btree_insert_notify() argument
1321 return insert(info, root, keys, value, new_root, inserted); in dm_btree_insert_notify()
1346 *result_key = le64_to_cpu(ro_node(s)->keys[i]); in find_key()
1348 *result_key = le64_to_cpu(ro_node(s)->keys[0]); in find_key()
1409 int (*fn)(void *context, uint64_t *keys, void *leaf), in walk_node() argument
1416 uint64_t keys; in walk_node() local
1431 keys = le64_to_cpu(*key_ptr(n, i)); in walk_node()
1432 r = fn(context, &keys, value_ptr(n, i)); in walk_node()
1444 int (*fn)(void *context, uint64_t *keys, void *leaf), in dm_btree_walk() argument