Home
last modified time | relevance | path

Searched refs:p_s_bh (Results 1 – 3 of 3) sorted by relevance

/linux-2.4.37.9/fs/reiserfs/
Dstree.c65 inline int B_IS_IN_TREE (const struct buffer_head * p_s_bh) in B_IS_IN_TREE() argument
68 RFALSE( B_LEVEL (p_s_bh) > MAX_HEIGHT, in B_IS_IN_TREE()
69 "PAP-1010: block (%b) has too big level (%z)", p_s_bh, p_s_bh); in B_IS_IN_TREE()
71 return ( B_LEVEL (p_s_bh) != FREE_LEVEL ); in B_IS_IN_TREE()
413 struct buffer_head * p_s_bh in decrement_bcount() argument
415 if ( p_s_bh ) { in decrement_bcount()
416 if ( atomic_read (&(p_s_bh->b_count)) ) { in decrement_bcount()
417 put_bh(p_s_bh) ; in decrement_bcount()
420 reiserfs_panic(NULL, "PAP-5070: decrement_bcount: trying to free free buffer %b", p_s_bh); in decrement_bcount()
658 struct buffer_head * p_s_bh; in search_by_key() local
[all …]
Dfix_node.c1858 struct buffer_head * p_s_bh; in get_direct_parent() local
1879 if ( ! B_IS_IN_TREE(p_s_bh = PATH_OFFSET_PBUFFER(p_s_path, n_path_offset - 1)) ) in get_direct_parent()
1882 if ( (n_position = PATH_OFFSET_POSITION(p_s_path, n_path_offset - 1)) > B_NR_ITEMS(p_s_bh) ) in get_direct_parent()
1885 …if ( B_N_CHILD_NUM(p_s_bh, n_position) != PATH_OFFSET_PBUFFER(p_s_path, n_path_offset)->b_blocknr ) in get_direct_parent()
1889 if ( buffer_locked(p_s_bh) ) { in get_direct_parent()
1890 __wait_on_buffer(p_s_bh); in get_direct_parent()
1913 struct buffer_head * p_s_bh; in get_neighbors() local
1921 p_s_bh = PATH_OFFSET_PBUFFER(p_s_tb->tb_path, n_path_offset); in get_neighbors()
1923 RFALSE( p_s_bh == p_s_tb->FL[n_h] && in get_neighbors()
1927 …n_child_position = ( p_s_bh == p_s_tb->FL[n_h] ) ? p_s_tb->lkey[n_h] : B_NR_ITEMS (p_s_tb->FL[n_h]… in get_neighbors()
[all …]
/linux-2.4.37.9/include/linux/
Dreiserfs_fs.h778 #define B_BLK_HEAD(p_s_bh) ((struct block_head *)((p_s_bh)->b_data)) argument
780 #define B_NR_ITEMS(p_s_bh) (blkh_nr_item(B_BLK_HEAD(p_s_bh))) argument
781 #define B_LEVEL(p_s_bh) (blkh_level(B_BLK_HEAD(p_s_bh))) argument
782 #define B_FREE_SPACE(p_s_bh) (blkh_free_space(B_BLK_HEAD(p_s_bh))) argument
784 #define PUT_B_NR_ITEMS(p_s_bh,val) do { set_blkh_nr_item(B_BLK_HEAD(p_s_bh),val); } while (0) argument
785 #define PUT_B_LEVEL(p_s_bh,val) do { set_blkh_level(B_BLK_HEAD(p_s_bh),val); } while (0) argument
786 #define PUT_B_FREE_SPACE(p_s_bh,val) do { set_blkh_free_space(B_BLK_HEAD(p_s_bh),val); } while (0) argument
790 #define B_PRIGHT_DELIM_KEY(p_s_bh) (&(blk_right_delim_key(B_BLK_HEAD(p_s_bh)))) argument
793 #define B_IS_ITEMS_LEVEL(p_s_bh) (B_LEVEL(p_s_bh) == DISK_LEAF_NODE_LEVEL) argument
796 #define B_IS_KEYS_LEVEL(p_s_bh) (B_LEVEL(p_s_bh) > DISK_LEAF_NODE_LEVEL \ argument
[all …]