Searched refs:btree_buf_bytes (Results 1 – 9 of 9) sorted by relevance
/linux-6.12.1/fs/bcachefs/ |
D | btree_cache.h | 87 static inline size_t btree_buf_bytes(const struct btree *b) in btree_buf_bytes() function 94 return (btree_buf_bytes(b) - sizeof(struct btree_node)) / sizeof(u64); in btree_buf_max_u64s()
|
D | debug.c | 48 buf_pages(n_sorted, btree_buf_bytes(b)), in bch2_btree_verify_replica() 53 bch2_bio_map(bio, n_sorted, btree_buf_bytes(b)); in bch2_btree_verify_replica() 60 memcpy(n_ondisk, n_sorted, btree_buf_bytes(b)); in bch2_btree_verify_replica() 141 c->verify_ondisk = kvmalloc(btree_buf_bytes(b), GFP_KERNEL); in __bch2_btree_verify() 203 n_ondisk = kvmalloc(btree_buf_bytes(b), GFP_KERNEL); in bch2_btree_node_ondisk_to_text() 210 buf_pages(n_ondisk, btree_buf_bytes(b)), in bch2_btree_node_ondisk_to_text() 215 bch2_bio_map(bio, n_ondisk, btree_buf_bytes(b)); in bch2_btree_node_ondisk_to_text()
|
D | btree_update_interior.h | 208 return (void *) b->data + btree_buf_bytes(b); in btree_data_end() 245 ssize_t total = btree_buf_bytes(b) >> 3; in __bch2_btree_u64s_remaining()
|
D | btree_io.c | 320 ? btree_buf_bytes(b) in btree_node_sort() 345 BUG_ON(bytes != btree_buf_bytes(b)); in btree_node_sort() 1176 bset_byte_offset(b, bne) < btree_buf_bytes(b); in bch2_btree_node_read_done() 1188 sorted = btree_bounce_alloc(c, btree_buf_bytes(b), &used_mempool); in bch2_btree_node_read_done() 1195 btree_buf_bytes(b) - in bch2_btree_node_read_done() 1209 btree_bounce_free(c, btree_buf_bytes(b), used_mempool, sorted); in bch2_btree_node_read_done() 1298 bio->bi_iter.bi_size = btree_buf_bytes(b); in btree_node_read_work() 1529 memcpy(b->data, ra->buf[best], btree_buf_bytes(b)); in CLOSURE_CALLBACK() 1596 buf_pages(ra->buf[i], btree_buf_bytes(b)), in btree_node_read_all_replicas() 1616 bch2_bio_map(&rb->bio, ra->buf[i], btree_buf_bytes(b)); in btree_node_read_all_replicas() [all …]
|
D | sysfs.c | 253 ret += btree_buf_bytes(b); in bch2_btree_cache_size() 255 ret += btree_buf_bytes(b); in bch2_btree_cache_size() 257 ret += btree_buf_bytes(b); in bch2_btree_cache_size()
|
D | btree_cache.c | 102 mm_account_reclaimed_pages(btree_buf_bytes(b) / PAGE_SIZE); in __btree_node_data_free() 153 b->data = kvmalloc(btree_buf_bytes(b), gfp); in btree_node_data_alloc() 1441 btree_buf_bytes(b) - sizeof(struct btree_node), in bch2_btree_node_to_text()
|
D | backpointers.c | 780 mem_may_pin -= btree_buf_bytes(b); in bch2_get_btree_in_memory_pos()
|
D | btree_update_interior.c | 220 return __vstruct_bytes(struct btree_node, u64s) < btree_buf_bytes(b); in bch2_btree_node_format_fits() 1511 if (__vstruct_bytes(struct btree_node, u64s) > btree_buf_bytes(b)) in __btree_split_node()
|
D | bset.c | 803 BUG_ON(bset_byte_offset(b, bne) >= btree_buf_bytes(b)); in bch2_bset_init_next()
|