Home
last modified time | relevance | path

Searched refs:BLKH_SIZE (Results 1 – 4 of 4) sorted by relevance

/fs/reiserfs/
Dprints.c738 if (nr > (bh->b_size - BLKH_SIZE) / IH_SIZE) in check_leaf_block_head()
741 if (blkh_free_space(blkh) > bh->b_size - BLKH_SIZE - IH_SIZE * nr) in check_leaf_block_head()
752 if (B_NR_ITEMS(bh) > (bh->b_size - BLKH_SIZE) / IH_SIZE) in check_internal_block_head()
756 bh->b_size - BLKH_SIZE - KEY_SIZE * B_NR_ITEMS(bh) - in check_internal_block_head()
Dstree.c425 if (nr < 1 || nr > ((blocksize - BLKH_SIZE) / (IH_SIZE + MIN_ITEM_LEN))) { in is_leaf()
431 ih = (struct item_head *)(buf + BLKH_SIZE) + nr - 1; in is_leaf()
432 used_space = BLKH_SIZE + IH_SIZE * nr + (blocksize - ih_location(ih)); in is_leaf()
446 ih = (struct item_head *)(buf + BLKH_SIZE); in is_leaf()
509 if (nr > (blocksize - BLKH_SIZE - DC_SIZE) / (KEY_SIZE + DC_SIZE)) { in is_internal()
515 used_space = BLKH_SIZE + KEY_SIZE * nr + DC_SIZE * (nr + 1); in is_internal()
Dreiserfs.h1625 #define MAX_ITEM_LEN(block_size) (block_size - BLKH_SIZE - IH_SIZE)
1658 #define BLKH_SIZE (sizeof(struct block_head)) macro
2051 ((bh)->b_data + BLKH_SIZE + B_NR_ITEMS(bh) * KEY_SIZE + DC_SIZE * (n_pos)))
2060 #define MAX_CHILD_SIZE(bh) ((int)( (bh)->b_size - BLKH_SIZE ))
2681 #define MAX_DIRECT_ITEM_LEN(size) ((size) - BLKH_SIZE - 2*IH_SIZE - SD_SIZE - UNFM_P_SIZE)
Dfix_node.c2249 max_num_of_items = (blocksize - BLKH_SIZE) / (IH_SIZE + MIN_ITEM_LEN); in get_virtual_node_size()
2250 max_num_of_entries = (blocksize - BLKH_SIZE - IH_SIZE) / in get_virtual_node_size()