Searched refs:btree_blocks (Results 1 – 5 of 5) sorted by relevance
120 if (b->written < btree_blocks(b)) in bch_btree_init_next()171 b->written < btree_blocks(b) && i->seq == b->keys.set[0].data->seq; in bch_btree_node_read_done()179 btree_blocks(b)) in bch_btree_node_read_done()222 if (b->written < btree_blocks(b)) in bch_btree_node_read_done()412 BUG_ON(b->written >= btree_blocks(b)); in __bch_btree_node_write()1438 btree_blocks(new_nodes[i])) in btree_gc_coalesce()1447 btree_blocks(new_nodes[i])); in btree_gc_coalesce()2275 block_bytes(n1->c->cache)) > (btree_blocks(b) * 4) / 5; in btree_split()
762 #define btree_blocks(b) \ macro
872 (btree_blocks(c) + 1) * 2 * in bch2_fs_alloc()
985 __entry->blocks = btree_blocks(trans->c);
1001 sort_iter_init(iter, b, (btree_blocks(c) + 1) * 2); in bch2_btree_node_read_done()