IH_SIZE            86 fs/reiserfs/do_balan.c 	RFALSE(ih_item_len(ih) + IH_SIZE != -tb->insert_size[0],
IH_SIZE           105 fs/reiserfs/fix_node.c 		vi->vi_item_len += ih_item_len(ih + j) + IH_SIZE;
IH_SIZE           224 fs/reiserfs/fix_node.c 	     ((vi->vi_type & VI_TYPE_LEFT_MERGEABLE) ? IH_SIZE : 0))) {
IH_SIZE           235 fs/reiserfs/fix_node.c 	d_size = 0, ih_size = IH_SIZE;
IH_SIZE           239 fs/reiserfs/fix_node.c 		d_size = -((int)IH_SIZE), ih_size = 0;
IH_SIZE           243 fs/reiserfs/fix_node.c 	     i++, ih_size = IH_SIZE, d_size = 0, vi++) {
IH_SIZE           310 fs/reiserfs/fix_node.c 	     ((vi->vi_type & VI_TYPE_RIGHT_MERGEABLE) ? IH_SIZE : 0))) {
IH_SIZE           321 fs/reiserfs/fix_node.c 	d_size = 0, ih_size = IH_SIZE;
IH_SIZE           325 fs/reiserfs/fix_node.c 		d_size = -(int)IH_SIZE, ih_size = 0;
IH_SIZE           329 fs/reiserfs/fix_node.c 	     i--, d_size = 0, ih_size = IH_SIZE, vi--) {
IH_SIZE           513 fs/reiserfs/fix_node.c 			free_space = max_node_size - total_node_size - IH_SIZE;
IH_SIZE           707 fs/reiserfs/fix_node.c 			ih_size += IH_SIZE;
IH_SIZE           711 fs/reiserfs/fix_node.c 			ih_size += IH_SIZE;
IH_SIZE           736 fs/reiserfs/fix_node.c 				ih_size = IH_SIZE;
IH_SIZE          1289 fs/reiserfs/fix_node.c 	      && op_is_left_mergeable(&ih->ih_key, Sh->b_size)) ? IH_SIZE : 0)
IH_SIZE          1292 fs/reiserfs/fix_node.c 	      && op_is_left_mergeable(r_key, Sh->b_size)) ? IH_SIZE : 0)
IH_SIZE          2249 fs/reiserfs/fix_node.c 	max_num_of_items = (blocksize - BLKH_SIZE) / (IH_SIZE + MIN_ITEM_LEN);
IH_SIZE          2250 fs/reiserfs/fix_node.c 	max_num_of_entries = (blocksize - BLKH_SIZE - IH_SIZE) /
IH_SIZE            88 fs/reiserfs/item_ops.c 	return vi->vi_item_len - IH_SIZE;
IH_SIZE           179 fs/reiserfs/item_ops.c 	return vi->vi_item_len - IH_SIZE;
IH_SIZE           323 fs/reiserfs/item_ops.c 	return vi->vi_item_len - IH_SIZE;
IH_SIZE           505 fs/reiserfs/item_ops.c 		if (l + IH_SIZE != vi->vi_item_len +
IH_SIZE           350 fs/reiserfs/lbalance.c 	RFALSE(blkh_free_space(blkh) < cpy_num * IH_SIZE,
IH_SIZE           352 fs/reiserfs/lbalance.c 	       B_FREE_SPACE(dest), cpy_num * IH_SIZE);
IH_SIZE           355 fs/reiserfs/lbalance.c 	memmove(ih + cpy_num, ih, (nr - dest_before) * IH_SIZE);
IH_SIZE           358 fs/reiserfs/lbalance.c 	memcpy(ih, item_head(src, first), cpy_num * IH_SIZE);
IH_SIZE           360 fs/reiserfs/lbalance.c 	free_space -= (IH_SIZE * cpy_num);
IH_SIZE           403 fs/reiserfs/lbalance.c 					     IH_SIZE * cpy_num));
IH_SIZE           442 fs/reiserfs/lbalance.c 			memcpy(&n_ih, ih, IH_SIZE);
IH_SIZE           919 fs/reiserfs/lbalance.c 	RFALSE(free_space < ih_item_len(inserted_item_ih) + IH_SIZE,
IH_SIZE           948 fs/reiserfs/lbalance.c 	memmove(ih + 1, ih, IH_SIZE * (nr - before));
IH_SIZE           949 fs/reiserfs/lbalance.c 	memmove(ih, inserted_item_ih, IH_SIZE);
IH_SIZE           960 fs/reiserfs/lbalance.c 			    free_space - (IH_SIZE +
IH_SIZE           968 fs/reiserfs/lbalance.c 			    dc_size(t_dc) + (IH_SIZE +
IH_SIZE          1284 fs/reiserfs/lbalance.c 	memmove(ih, ih + del_num, (nr - first - del_num) * IH_SIZE);
IH_SIZE          1296 fs/reiserfs/lbalance.c 						     IH_SIZE * del_num));
IH_SIZE          1305 fs/reiserfs/lbalance.c 					     IH_SIZE * del_num));
IH_SIZE           738 fs/reiserfs/prints.c 	if (nr > (bh->b_size - BLKH_SIZE) / IH_SIZE)
IH_SIZE           741 fs/reiserfs/prints.c 	if (blkh_free_space(blkh) > bh->b_size - BLKH_SIZE - IH_SIZE * nr)
IH_SIZE           752 fs/reiserfs/prints.c 	if (B_NR_ITEMS(bh) > (bh->b_size - BLKH_SIZE) / IH_SIZE)
IH_SIZE          1625 fs/reiserfs/reiserfs.h #define MAX_ITEM_LEN(block_size) (block_size - BLKH_SIZE - IH_SIZE)
IH_SIZE          2681 fs/reiserfs/reiserfs.h #define MAX_DIRECT_ITEM_LEN(size) ((size) - BLKH_SIZE - 2*IH_SIZE - SD_SIZE - UNFM_P_SIZE)
IH_SIZE            33 fs/reiserfs/stree.c 	memcpy(to, from, IH_SIZE);
IH_SIZE           407 fs/reiserfs/stree.c 	if (nr < 1 || nr > ((blocksize - BLKH_SIZE) / (IH_SIZE + MIN_ITEM_LEN))) {
IH_SIZE           414 fs/reiserfs/stree.c 	used_space = BLKH_SIZE + IH_SIZE * nr + (blocksize - ih_location(ih));
IH_SIZE           438 fs/reiserfs/stree.c 		    || ih_location(ih) < IH_SIZE * nr) {
IH_SIZE           746 fs/reiserfs/stree.c 				       DISK_LEAF_NODE_LEVEL) ? IH_SIZE :
IH_SIZE           918 fs/reiserfs/stree.c 	return memcmp(stored_ih, ih, IH_SIZE);
IH_SIZE           937 fs/reiserfs/stree.c 		*cut_size = -(IH_SIZE + ih_item_len(le_ih));
IH_SIZE           945 fs/reiserfs/stree.c 			*cut_size = -(IH_SIZE + ih_item_len(le_ih));
IH_SIZE           958 fs/reiserfs/stree.c 		*cut_size = -(IH_SIZE + ih_item_len(le_ih));
IH_SIZE           979 fs/reiserfs/stree.c 		*cut_size = -(IH_SIZE + ih_item_len(le_ih));
IH_SIZE           989 fs/reiserfs/stree.c 		*cut_size = -(IH_SIZE + ih_item_len(le_ih));
IH_SIZE          1040 fs/reiserfs/stree.c 		*cut_size = -(IH_SIZE + ih_item_len(p_le_ih));
IH_SIZE          1116 fs/reiserfs/stree.c 			(*cut_size) -= IH_SIZE;
IH_SIZE          1430 fs/reiserfs/stree.c 				       -(IH_SIZE + item_len));
IH_SIZE          2206 fs/reiserfs/stree.c 		       IH_SIZE + ih_item_len(ih));