Home
last modified time | relevance | path

Searched refs:btree_sectors (Results 1 – 11 of 11) sorted by relevance

/linux-6.15/fs/bcachefs/
H A Dbtree_cache.h102 static inline size_t btree_sectors(const struct bch_fs *c) in btree_sectors() function
109 return btree_sectors(c) >> c->block_bits; in btree_blocks()
H A Dprogress.c24 s->nodes_total += div64_ul(v, btree_sectors(c)); in bch2_progress_init()
H A Dbtree_io.c733 btree_err_on(offset + sectors > (ptr_written ?: btree_sectors(c)), in validate_bset()
738 offset, sectors, ptr_written ?: btree_sectors(c))) in validate_bset()
1075 while (b->written < (ptr_written ?: btree_sectors(c))) { in bch2_btree_node_read_done()
1192 b->written = min(b->written + sectors, btree_sectors(c)); in bch2_btree_node_read_done()
1441 while (offset < btree_sectors(c)) { in btree_node_sectors_written()
1463 while (offset < btree_sectors(c)) { in btree_node_has_extra_bsets()
1540 while (offset < btree_sectors(c)) { in CLOSURE_CALLBACK()
1557 while (offset < btree_sectors(c)) { in CLOSURE_CALLBACK()
1853 while (written < (ptr_written ?: btree_sectors(c))) { in btree_node_scrub_check()
2304 BUG_ON(b->written >= btree_sectors(c)); in __bch2_btree_node_write()
[all …]
H A Dbtree_node_scan.c252 bucket_offset + btree_sectors(c) <= ca->mi.bucket_size; in read_btree_nodes_worker()
253 bucket_offset += btree_sectors(c)) { in read_btree_nodes_worker()
266 !bch2_dev_btree_bitmap_marked_sectors(ca, sector, btree_sectors(c))) in read_btree_nodes_worker()
H A Dbackpointers.h174 .bucket_len = ptr_disk_sectors(level ? btree_sectors(c) : k.k->size, p), in bch2_extent_ptr_to_bp()
H A Dsb-members.c427 if (!bch2_dev_btree_bitmap_marked_sectors(ca, ptr->offset, btree_sectors(c))) { in bch2_dev_btree_bitmap_marked()
475 __bch2_dev_btree_bitmap_mark(mi, ptr->dev, ptr->offset, btree_sectors(c)); in bch2_dev_btree_bitmap_mark()
H A Dbtree_update_interior.h293 if (b->written + block_sectors(c) <= btree_sectors(c)) in want_new_bset()
H A Dbtree_update_interior.c332 if (wp->sectors_free < btree_sectors(c)) { in __bch2_btree_node_alloc()
337 if (ob->sectors_free < btree_sectors(c)) in __bch2_btree_node_alloc()
345 bch2_alloc_sectors_append_ptrs(c, wp, &tmp.k, btree_sectors(c), false); in __bch2_btree_node_alloc()
410 bch2_increment_clock(c, btree_sectors(c), WRITE); in bch2_btree_node_alloc()
1223 (nr_nodes[0] + nr_nodes[1]) * btree_sectors(c), in bch2_btree_update_start()
H A Ddebug.c225 while (offset < btree_sectors(c)) { in bch2_btree_node_ondisk_to_text()
H A Dextents.c1358 size_ondisk = btree_sectors(c); in bch2_bkey_ptrs_validate()
H A Dsuper.c1400 ca->mi.bucket_size / btree_sectors(c)); in __bch2_dev_alloc()