Home
last modified time | relevance | path

Searched refs:btree_buf_bytes (Results 1 – 8 of 8) sorted by relevance

/linux/fs/bcachefs/
H A Dbtree_cache.h88 static inline size_t btree_buf_bytes(const struct btree *b) in btree_buf_bytes() function
95 return (btree_buf_bytes(b) - sizeof(struct btree_node)) / sizeof(u64); in btree_buf_max_u64s()
H A Ddebug.c53 buf_pages(n_sorted, btree_buf_bytes(b)), in bch2_btree_verify_replica()
58 bch2_bio_map(bio, n_sorted, btree_buf_bytes(b)); in bch2_btree_verify_replica()
66 memcpy(n_ondisk, n_sorted, btree_buf_bytes(b)); in bch2_btree_verify_replica()
147 c->verify_ondisk = kvmalloc(btree_buf_bytes(b), GFP_KERNEL); in __bch2_btree_verify()
208 n_ondisk = kvmalloc(btree_buf_bytes(b), GFP_KERNEL); in bch2_btree_node_ondisk_to_text()
215 buf_pages(n_ondisk, btree_buf_bytes(b)), in bch2_btree_node_ondisk_to_text()
220 bch2_bio_map(bio, n_ondisk, btree_buf_bytes(b)); in bch2_btree_node_ondisk_to_text()
H A Dbtree_update_interior.h225 return (void *) b->data + btree_buf_bytes(b); in btree_data_end()
262 ssize_t total = btree_buf_bytes(b) >> 3; in __bch2_btree_u64s_remaining()
H A Dbtree_io.c323 ? btree_buf_bytes(b) in btree_node_sort()
348 BUG_ON(bytes != btree_buf_bytes(b)); in btree_node_sort()
1266 bset_byte_offset(b, bne) < btree_buf_bytes(b); in bch2_btree_node_read_done()
1278 sorted = btree_bounce_alloc(c, btree_buf_bytes(b), &used_mempool); in bch2_btree_node_read_done()
1283 btree_buf_bytes(b) - in bch2_btree_node_read_done()
1296 btree_bounce_free(c, btree_buf_bytes(b), used_mempool, sorted); in bch2_btree_node_read_done()
1419 bio->bi_iter.bi_size = btree_buf_bytes(b); in btree_node_read_work()
1666 memcpy(b->data, ra->buf[best], btree_buf_bytes(b)); in CLOSURE_CALLBACK()
1741 buf_pages(ra->buf[i], btree_buf_bytes(b)), in btree_node_read_all_replicas()
1762 bch2_bio_map(&rb->bio, ra->buf[i], btree_buf_bytes(b)); in btree_node_read_all_replicas()
[all …]
H A Dsysfs.c236 ret += btree_buf_bytes(b); in BCH_TIME_STATS()
238 ret += btree_buf_bytes(b); in BCH_TIME_STATS()
240 ret += btree_buf_bytes(b); in BCH_TIME_STATS()
H A Dbtree_cache.c99 mm_account_reclaimed_pages(btree_buf_bytes(b) / PAGE_SIZE); in __btree_node_data_free()
151 b->data = kvmalloc(btree_buf_bytes(b), gfp); in btree_node_data_alloc()
1460 btree_buf_bytes(b) - sizeof(struct btree_node), in bch2_btree_node_to_text()
H A Dbtree_update_interior.c211 return __vstruct_bytes(struct btree_node, u64s) < btree_buf_bytes(b); in bch2_btree_node_format_fits()
1247 as->node_sectors = btree_buf_bytes(b) >> 9; in bch2_btree_update_start()
1557 if (__vstruct_bytes(struct btree_node, u64s) > btree_buf_bytes(b)) in __btree_split_node()
H A Dbackpointers.c792 mem_may_pin -= btree_buf_bytes(b); in bch2_get_btree_in_memory_pos()