Searched defs:p_s_bh (Results 1 – 3 of 3) sorted by relevance
65 inline int B_IS_IN_TREE (const struct buffer_head * p_s_bh) in B_IS_IN_TREE()413 struct buffer_head * p_s_bh in decrement_bcount()658 struct buffer_head * p_s_bh; in search_by_key() local884 struct buffer_head * p_s_bh; in comp_items() local1001 struct buffer_head * p_s_bh = PATH_PLAST_BUFFER(p_s_path); in prepare_for_delete_or_cut() local
1858 struct buffer_head * p_s_bh; in get_direct_parent() local1913 struct buffer_head * p_s_bh; in get_neighbors() local2092 struct buffer_head * p_s_bh, in tb_buffer_sanity_check()2117 struct buffer_head * p_s_bh, in tb_buffer_sanity_check()
778 #define B_BLK_HEAD(p_s_bh) ((struct block_head *)((p_s_bh)->b_data)) argument780 #define B_NR_ITEMS(p_s_bh) (blkh_nr_item(B_BLK_HEAD(p_s_bh))) argument781 #define B_LEVEL(p_s_bh) (blkh_level(B_BLK_HEAD(p_s_bh))) argument782 #define B_FREE_SPACE(p_s_bh) (blkh_free_space(B_BLK_HEAD(p_s_bh))) argument784 #define PUT_B_NR_ITEMS(p_s_bh,val) do { set_blkh_nr_item(B_BLK_HEAD(p_s_bh),val); } while (0) argument785 #define PUT_B_LEVEL(p_s_bh,val) do { set_blkh_level(B_BLK_HEAD(p_s_bh),val); } while (0) argument786 #define PUT_B_FREE_SPACE(p_s_bh,val) do { set_blkh_free_space(B_BLK_HEAD(p_s_bh),val); } while (0) argument790 #define B_PRIGHT_DELIM_KEY(p_s_bh) (&(blk_right_delim_key(B_BLK_HEAD(p_s_bh)))) argument793 #define B_IS_ITEMS_LEVEL(p_s_bh) (B_LEVEL(p_s_bh) == DISK_LEAF_NODE_LEVEL) argument796 #define B_IS_KEYS_LEVEL(p_s_bh) (B_LEVEL(p_s_bh) > DISK_LEAF_NODE_LEVEL \ argument[all …]