Searched refs:B_BLK_HEAD (Results 1 - 10 of 10) sorted by relevance
/kernel/linux/linux-5.10/fs/reiserfs/ |
H A D | ibalance.c | 142 blkh = B_BLK_HEAD(cur); in internal_insert_childs() 227 blkh = B_BLK_HEAD(cur); in internal_delete_pointers_items() 331 blkh = B_BLK_HEAD(dest); in internal_copy_pointers_items() 452 blkh = B_BLK_HEAD(dest); in internal_insert_key() 1012 blkh = B_BLK_HEAD(tbSh); in balance_internal() 1048 set_blkh_level(B_BLK_HEAD(S_new), h + 1); in balance_internal()
|
H A D | lbalance.c | 337 blkh = B_BLK_HEAD(dest); in leaf_copy_items_entirely() 914 blkh = B_BLK_HEAD(bh); in leaf_insert_into_buf() 989 blkh = B_BLK_HEAD(bh); in leaf_paste_in_buffer() 1155 blkh = B_BLK_HEAD(bh); in leaf_cut_from_buffer() 1256 blkh = B_BLK_HEAD(bh); in leaf_delete_items_entirely()
|
H A D | reiserfs.h | 1684 #define B_BLK_HEAD(bh) ((struct block_head *)((bh)->b_data)) macro 1686 #define B_NR_ITEMS(bh) (blkh_nr_item(B_BLK_HEAD(bh))) 1687 #define B_LEVEL(bh) (blkh_level(B_BLK_HEAD(bh))) 1688 #define B_FREE_SPACE(bh) (blkh_free_space(B_BLK_HEAD(bh))) 1690 #define PUT_B_NR_ITEMS(bh, val) do { set_blkh_nr_item(B_BLK_HEAD(bh), val); } while (0) 1691 #define PUT_B_LEVEL(bh, val) do { set_blkh_level(B_BLK_HEAD(bh), val); } while (0) 1692 #define PUT_B_FREE_SPACE(bh, val) do { set_blkh_free_space(B_BLK_HEAD(bh), val); } while (0) 1695 #define B_PRIGHT_DELIM_KEY(bh) (&(blk_right_delim_key(B_BLK_HEAD(bh))))
|
H A D | prints.c | 490 blkh = B_BLK_HEAD(bh); in print_leaf() 736 blkh = B_BLK_HEAD(bh); in check_leaf_block_head()
|
H A D | do_balan.c | 1240 set_blkh_level(B_BLK_HEAD(tb->S_new[i]), DISK_LEAF_NODE_LEVEL); in balance_leaf_new_nodes() 1474 blkh = B_BLK_HEAD(bi->bi_bh); in make_empty_node() 1543 blkh = B_BLK_HEAD(bh); in reiserfs_invalidate_buffer()
|
/kernel/linux/linux-6.6/fs/reiserfs/ |
H A D | ibalance.c | 142 blkh = B_BLK_HEAD(cur); in internal_insert_childs() 227 blkh = B_BLK_HEAD(cur); in internal_delete_pointers_items() 331 blkh = B_BLK_HEAD(dest); in internal_copy_pointers_items() 452 blkh = B_BLK_HEAD(dest); in internal_insert_key() 1012 blkh = B_BLK_HEAD(tbSh); in balance_internal() 1048 set_blkh_level(B_BLK_HEAD(S_new), h + 1); in balance_internal()
|
H A D | lbalance.c | 337 blkh = B_BLK_HEAD(dest); in leaf_copy_items_entirely() 914 blkh = B_BLK_HEAD(bh); in leaf_insert_into_buf() 989 blkh = B_BLK_HEAD(bh); in leaf_paste_in_buffer() 1155 blkh = B_BLK_HEAD(bh); in leaf_cut_from_buffer() 1256 blkh = B_BLK_HEAD(bh); in leaf_delete_items_entirely()
|
H A D | reiserfs.h | 1681 #define B_BLK_HEAD(bh) ((struct block_head *)((bh)->b_data)) macro 1683 #define B_NR_ITEMS(bh) (blkh_nr_item(B_BLK_HEAD(bh))) 1684 #define B_LEVEL(bh) (blkh_level(B_BLK_HEAD(bh))) 1685 #define B_FREE_SPACE(bh) (blkh_free_space(B_BLK_HEAD(bh))) 1687 #define PUT_B_NR_ITEMS(bh, val) do { set_blkh_nr_item(B_BLK_HEAD(bh), val); } while (0) 1688 #define PUT_B_LEVEL(bh, val) do { set_blkh_level(B_BLK_HEAD(bh), val); } while (0) 1689 #define PUT_B_FREE_SPACE(bh, val) do { set_blkh_free_space(B_BLK_HEAD(bh), val); } while (0) 1692 #define B_PRIGHT_DELIM_KEY(bh) (&(blk_right_delim_key(B_BLK_HEAD(bh))))
|
H A D | prints.c | 490 blkh = B_BLK_HEAD(bh); in print_leaf() 736 blkh = B_BLK_HEAD(bh); in check_leaf_block_head()
|
H A D | do_balan.c | 1240 set_blkh_level(B_BLK_HEAD(tb->S_new[i]), DISK_LEAF_NODE_LEVEL); in balance_leaf_new_nodes() 1474 blkh = B_BLK_HEAD(bi->bi_bh); in make_empty_node() 1543 blkh = B_BLK_HEAD(bh); in reiserfs_invalidate_buffer()
|
Completed in 26 milliseconds