Lines Matching defs:key
409 struct dm_btree_value_type *vt, uint64_t key)
432 i = lower_bound(n, key);
451 static int do_leaf(struct btree_node *n, uint64_t key, unsigned *index)
453 int i = lower_bound(n, key);
457 (le64_to_cpu(n->keys[i]) != key))
471 uint64_t key, unsigned *index)
495 return do_leaf(n, key, index);
497 r = rebalance_children(s, info, vt, key);
503 return do_leaf(n, key, index);
505 i = lower_bound(n, key);
508 * We know the key is present, or else
564 uint64_t key, int *index)
588 *index = lower_bound(n, key);
592 r = rebalance_children(s, info, vt, key);
598 *index = lower_bound(n, key);
602 i = lower_bound(n, key);
605 * We know the key is present, or else