BLKH_SIZE 2031 fs/reiserfs/fix_node.c max_num_of_items = (blocksize - BLKH_SIZE) / (IH_SIZE + MIN_ITEM_LEN); BLKH_SIZE 2032 fs/reiserfs/fix_node.c max_num_of_entries = (blocksize - BLKH_SIZE - IH_SIZE) / BLKH_SIZE 683 fs/reiserfs/prints.c if (nr > (bh->b_size - BLKH_SIZE) / IH_SIZE) BLKH_SIZE 687 fs/reiserfs/prints.c if (blkh_free_space(blkh) > bh->b_size - BLKH_SIZE - IH_SIZE * nr) BLKH_SIZE 704 fs/reiserfs/prints.c if (B_NR_ITEMS(bh) > (bh->b_size - BLKH_SIZE) / IH_SIZE) BLKH_SIZE 710 fs/reiserfs/prints.c bh->b_size - BLKH_SIZE - KEY_SIZE * B_NR_ITEMS(bh) - BLKH_SIZE 453 fs/reiserfs/stree.c if (nr < 1 || nr > ((blocksize - BLKH_SIZE) / (IH_SIZE + MIN_ITEM_LEN))) { BLKH_SIZE 458 fs/reiserfs/stree.c ih = (struct item_head *)(buf + BLKH_SIZE) + nr - 1; BLKH_SIZE 459 fs/reiserfs/stree.c used_space = BLKH_SIZE + IH_SIZE * nr + (blocksize - ih_location(ih)); BLKH_SIZE 470 fs/reiserfs/stree.c ih = (struct item_head *)(buf + BLKH_SIZE); BLKH_SIZE 523 fs/reiserfs/stree.c if (nr > (blocksize - BLKH_SIZE - DC_SIZE) / (KEY_SIZE + DC_SIZE)) { BLKH_SIZE 531 fs/reiserfs/stree.c used_space = BLKH_SIZE + KEY_SIZE * nr + DC_SIZE * (nr + 1); BLKH_SIZE 695 include/linux/reiserfs_fs.h #define MAX_ITEM_LEN(block_size) (block_size - BLKH_SIZE - IH_SIZE) BLKH_SIZE 1116 include/linux/reiserfs_fs.h ((p_s_bh)->b_data+BLKH_SIZE+B_NR_ITEMS(p_s_bh)*KEY_SIZE+DC_SIZE*(n_pos))) BLKH_SIZE 1124 include/linux/reiserfs_fs.h #define MAX_CHILD_SIZE(bh) ((int)( (bh)->b_size - BLKH_SIZE )) BLKH_SIZE 1505 include/linux/reiserfs_fs.h #define B_N_PITEM_HEAD(bh,item_num) ( (struct item_head * )((bh)->b_data + BLKH_SIZE) + (item_num) ) BLKH_SIZE 1508 include/linux/reiserfs_fs.h #define B_N_PDELIM_KEY(bh,item_num) ( (struct reiserfs_key * )((bh)->b_data + BLKH_SIZE) + (item_num) ) BLKH_SIZE 1526 include/linux/reiserfs_fs.h #define MAX_DIRECT_ITEM_LEN(size) ((size) - BLKH_SIZE - 2*IH_SIZE - SD_SIZE - UNFM_P_SIZE)