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