Searched refs:bset_u64s (Results 1 – 7 of 7) sorted by relevance
30 u16 bset_u64s[MAX_BSETS]; member718 static inline unsigned bset_u64s(struct bset_tree *t) in bset_u64s() function726 return bset_u64s(t) - b->nr.bset_u64s[t - b->set]; in bset_dead_u64s()
471 n->bset_u64s[bset] += k->u64s * sign; in btree_keys_account_key()486 b->nr.bset_u64s[t - b->set] += delta; in btree_keys_account_val_delta()
76 unsigned total_u64s = bset_u64s(t); in should_compact_bset_lazy()
364 b->nr.bset_u64s[start_idx] += in btree_node_sort()365 b->nr.bset_u64s[i]; in btree_node_sort()370 b->nr.bset_u64s[i] = b->nr.bset_u64s[i + shift]; in btree_node_sort()375 b->nr.bset_u64s[i] = 0; in btree_node_sort()410 dst->nr.bset_u64s[0] += nr.bset_u64s[0]; in bch2_btree_sort_into()468 return bset_u64s(&b->set[1]) > 1U << mid_u64s_bits; in should_compact_all()
289 if (unlikely(bset_u64s(t) * sizeof(u64) > btree_write_set_buffer(b)) && in want_new_bset()
539 unsigned bset_u64s = t->end_offset - btree_bkey_first_offset(t); in rw_aux_tree_bsearch() local540 unsigned idx = bset_u64s ? bset_offs * t->size / bset_u64s : 0; in rw_aux_tree_bsearch()
296 int old_u64s = bset_u64s(t); in bch2_btree_insert_key_leaf()314 u64s_added = (int) bset_u64s(t) - old_u64s; in bch2_btree_insert_key_leaf()
Completed in 24 milliseconds