Lines Matching refs:btree_node
44 static int bsearch(struct btree_node *n, uint64_t key, int want_hi) in bsearch()
64 int lower_bound(struct btree_node *n, uint64_t key) in lower_bound()
69 static int upper_bound(struct btree_node *n, uint64_t key) in upper_bound()
74 void inc_children(struct dm_transaction_manager *tm, struct btree_node *n, in inc_children()
86 static int insert_at(size_t value_size, struct btree_node *node, unsigned int index, in insert_at()
133 struct btree_node *n; in dm_btree_empty()
167 struct btree_node *n;
344 int (*search_fn)(struct btree_node *, uint64_t), in btree_lookup_raw() argument
425 struct btree_node *n; in dm_btree_lookup_next_single()
507 static void copy_entries(struct btree_node *dest, unsigned int dest_offset, in copy_entries()
508 struct btree_node *src, unsigned int src_offset, in copy_entries()
521 static void move_entries(struct btree_node *dest, unsigned int dest_offset, in move_entries()
522 struct btree_node *src, unsigned int src_offset, in move_entries()
535 static void shift_down(struct btree_node *n, unsigned int count) in shift_down()
544 static void shift_up(struct btree_node *n, unsigned int count) in shift_up()
553 static void redistribute2(struct btree_node *left, struct btree_node *right) in redistribute2()
582 static void redistribute3(struct btree_node *left, struct btree_node *center, in redistribute3()
583 struct btree_node *right) in redistribute3()
659 struct btree_node *ln, *rn, *pn; in split_one_into_two()
708 struct btree_node *parent, unsigned int index, in shadow_child()
713 struct btree_node *node; in shadow_child()
743 struct btree_node *ln, *rn, *mn, *pn; in split_two_into_three()
844 struct btree_node *pn, *ln, *rn; in btree_split_beneath()
920 struct btree_node *left, *right, *parent = dm_block_data(shadow_parent(s)); in rebalance_left()
949 struct btree_node *left, *right, *parent = dm_block_data(shadow_parent(s)); in rebalance_right()
978 struct btree_node *node; in get_node_free_space()
1005 struct btree_node *parent = dm_block_data(shadow_parent(s)); in rebalance_or_split()
1063 static bool contains_key(struct btree_node *node, uint64_t key) in contains_key()
1078 static bool has_space_for_insert(struct btree_node *node, uint64_t key) in has_space_for_insert()
1097 struct btree_node *node; in btree_insert_raw()
1160 struct btree_node *node; in __btree_get_overwrite_leaf()
1227 static bool need_insert(struct btree_node *node, uint64_t *keys, in need_insert()
1243 struct btree_node *n; in insert()
1428 struct btree_node *n; in walk_node()
1472 struct btree_node *bn = dm_block_data(n->b); in prefetch_values()
1487 struct btree_node *bn = dm_block_data(n->b); in leaf_node()
1524 struct btree_node *bn; in inc_or_backtrack()
1547 struct btree_node *bn; in find_leaf()
1625 struct btree_node *bn = dm_block_data(n->b); in dm_btree_cursor_get_value()