Lines Matching refs:max_key
79 if (!bpos_eq(b->data->max_key, SPOS_MAX)) { in bch2_btree_node_check_topology()
82 bch2_bpos_to_text(&buf, b->data->max_key); in bch2_btree_node_check_topology()
171 bch2_bkey_format_add_pos(&s, b->data->max_key); in bch2_btree_calc_format()
428 b->data->max_key = pos; in btree_set_max()
448 btree_set_max(n, b->data->max_key); in bch2_btree_node_alloc_replacement()
1244 as->node_end = b->data->max_key; in bch2_btree_update_start()
1547 btree_set_max(n[1], b->data->max_key); in __btree_split_node()
1551 bch2_bkey_format_add_pos(&format[i], n[i]->data->max_key); in __btree_split_node()
1618 bpos_le(bch2_keylist_front(keys)->k.p, b->data->max_key)) { in btree_split_insert_keys()
2045 (sib == btree_next_sib && bpos_eq(b->data->max_key, SPOS_MAX))) { in __bch2_foreground_maybe_merge()
2052 : bpos_successor(b->data->max_key); in __bch2_foreground_maybe_merge()
2078 if (!bpos_eq(bpos_successor(prev->data->max_key), next->data->min_key)) { in __bch2_foreground_maybe_merge()
2087 bch2_bpos_to_text(&buf, prev->data->max_key); in __bch2_foreground_maybe_merge()
2102 bch2_bkey_format_add_pos(&new_s, next->data->max_key); in __bch2_foreground_maybe_merge()
2129 as->node_end = next->data->max_key; in __bch2_foreground_maybe_merge()
2140 btree_set_max(n, next->data->max_key); in __bch2_foreground_maybe_merge()