IH_SIZE 95 fs/reiserfs/do_balan.c RFALSE(ih_item_len(ih) + IH_SIZE != -tb->insert_size[0], IH_SIZE 128 fs/reiserfs/fix_node.c vi->vi_item_len += ih_item_len(ih + j) + IH_SIZE; IH_SIZE 232 fs/reiserfs/fix_node.c ((vi->vi_type & VI_TYPE_LEFT_MERGEABLE) ? IH_SIZE : 0))) { IH_SIZE 243 fs/reiserfs/fix_node.c d_size = 0, ih_size = IH_SIZE; IH_SIZE 247 fs/reiserfs/fix_node.c d_size = -((int)IH_SIZE), ih_size = 0; IH_SIZE 251 fs/reiserfs/fix_node.c i++, ih_size = IH_SIZE, d_size = 0, vi++) { IH_SIZE 312 fs/reiserfs/fix_node.c ((vi->vi_type & VI_TYPE_RIGHT_MERGEABLE) ? IH_SIZE : 0))) { IH_SIZE 323 fs/reiserfs/fix_node.c d_size = 0, ih_size = IH_SIZE; IH_SIZE 327 fs/reiserfs/fix_node.c d_size = -(int)IH_SIZE, ih_size = 0; IH_SIZE 331 fs/reiserfs/fix_node.c i--, d_size = 0, ih_size = IH_SIZE, vi--) { IH_SIZE 480 fs/reiserfs/fix_node.c free_space = max_node_size - total_node_size - IH_SIZE; IH_SIZE 667 fs/reiserfs/fix_node.c ih_size += IH_SIZE; IH_SIZE 671 fs/reiserfs/fix_node.c ih_size += IH_SIZE; IH_SIZE 693 fs/reiserfs/fix_node.c ih_size = IH_SIZE; IH_SIZE 1179 fs/reiserfs/fix_node.c && op_is_left_mergeable(&(ih->ih_key), Sh->b_size)) ? IH_SIZE : 0) IH_SIZE 1182 fs/reiserfs/fix_node.c && op_is_left_mergeable(r_key, Sh->b_size)) ? IH_SIZE : 0) IH_SIZE 2031 fs/reiserfs/fix_node.c max_num_of_items = (blocksize - BLKH_SIZE) / (IH_SIZE + MIN_ITEM_LEN); IH_SIZE 2032 fs/reiserfs/fix_node.c max_num_of_entries = (blocksize - BLKH_SIZE - IH_SIZE) / IH_SIZE 95 fs/reiserfs/item_ops.c return vi->vi_item_len - IH_SIZE; IH_SIZE 188 fs/reiserfs/item_ops.c return vi->vi_item_len - IH_SIZE; IH_SIZE 332 fs/reiserfs/item_ops.c return vi->vi_item_len - IH_SIZE; IH_SIZE 513 fs/reiserfs/item_ops.c if (l + IH_SIZE != vi->vi_item_len + IH_SIZE 319 fs/reiserfs/lbalance.c RFALSE(blkh_free_space(blkh) < cpy_num * IH_SIZE, IH_SIZE 321 fs/reiserfs/lbalance.c B_FREE_SPACE(dest), cpy_num * IH_SIZE); IH_SIZE 324 fs/reiserfs/lbalance.c memmove(ih + cpy_num, ih, (nr - dest_before) * IH_SIZE); IH_SIZE 327 fs/reiserfs/lbalance.c memcpy(ih, B_N_PITEM_HEAD(src, first), cpy_num * IH_SIZE); IH_SIZE 329 fs/reiserfs/lbalance.c free_space -= (IH_SIZE * cpy_num); IH_SIZE 371 fs/reiserfs/lbalance.c IH_SIZE * cpy_num)); IH_SIZE 402 fs/reiserfs/lbalance.c memcpy(&n_ih, ih, IH_SIZE); IH_SIZE 813 fs/reiserfs/lbalance.c RFALSE(free_space < ih_item_len(inserted_item_ih) + IH_SIZE, IH_SIZE 842 fs/reiserfs/lbalance.c memmove(ih + 1, ih, IH_SIZE * (nr - before)); IH_SIZE 843 fs/reiserfs/lbalance.c memmove(ih, inserted_item_ih, IH_SIZE); IH_SIZE 854 fs/reiserfs/lbalance.c free_space - (IH_SIZE + IH_SIZE 862 fs/reiserfs/lbalance.c dc_size(t_dc) + (IH_SIZE + IH_SIZE 1167 fs/reiserfs/lbalance.c memmove(ih, ih + del_num, (nr - first - del_num) * IH_SIZE); IH_SIZE 1179 fs/reiserfs/lbalance.c IH_SIZE * del_num)); IH_SIZE 1188 fs/reiserfs/lbalance.c IH_SIZE * del_num)); IH_SIZE 683 fs/reiserfs/prints.c if (nr > (bh->b_size - BLKH_SIZE) / IH_SIZE) IH_SIZE 687 fs/reiserfs/prints.c if (blkh_free_space(blkh) > bh->b_size - BLKH_SIZE - IH_SIZE * nr) IH_SIZE 704 fs/reiserfs/prints.c if (B_NR_ITEMS(bh) > (bh->b_size - BLKH_SIZE) / IH_SIZE) IH_SIZE 75 fs/reiserfs/stree.c memcpy(p_v_to, p_v_from, IH_SIZE); IH_SIZE 453 fs/reiserfs/stree.c if (nr < 1 || nr > ((blocksize - BLKH_SIZE) / (IH_SIZE + MIN_ITEM_LEN))) { IH_SIZE 459 fs/reiserfs/stree.c used_space = BLKH_SIZE + IH_SIZE * nr + (blocksize - ih_location(ih)); IH_SIZE 480 fs/reiserfs/stree.c || ih_location(ih) < IH_SIZE * nr) { IH_SIZE 743 fs/reiserfs/stree.c DISK_LEAF_NODE_LEVEL) ? IH_SIZE : IH_SIZE 901 fs/reiserfs/stree.c return memcmp(stored_ih, ih, IH_SIZE); IH_SIZE 922 fs/reiserfs/stree.c *cut_size = -(IH_SIZE + ih_item_len(le_ih)); IH_SIZE 931 fs/reiserfs/stree.c *cut_size = -(IH_SIZE + ih_item_len(le_ih)); IH_SIZE 944 fs/reiserfs/stree.c *cut_size = -(IH_SIZE + ih_item_len(le_ih)); IH_SIZE 964 fs/reiserfs/stree.c *cut_size = -(IH_SIZE + ih_item_len(le_ih)); IH_SIZE 971 fs/reiserfs/stree.c *cut_size = -(IH_SIZE + ih_item_len(le_ih)); IH_SIZE 1006 fs/reiserfs/stree.c *p_n_cut_size = -(IH_SIZE + ih_item_len(p_le_ih)); IH_SIZE 1078 fs/reiserfs/stree.c (*p_n_cut_size) -= IH_SIZE; IH_SIZE 1367 fs/reiserfs/stree.c -(IH_SIZE + item_len)); IH_SIZE 2069 fs/reiserfs/stree.c IH_SIZE + ih_item_len(p_s_ih)); IH_SIZE 695 include/linux/reiserfs_fs.h #define MAX_ITEM_LEN(block_size) (block_size - BLKH_SIZE - IH_SIZE) IH_SIZE 1526 include/linux/reiserfs_fs.h #define MAX_DIRECT_ITEM_LEN(size) ((size) - BLKH_SIZE - 2*IH_SIZE - SD_SIZE - UNFM_P_SIZE)