906 int comp_items(const struct item_head *stored_ih, const struct treepath *path)  in comp_items()  argument
908 	struct buffer_head *bh = PATH_PLAST_BUFFER(path);  in comp_items()
916 	if (PATH_LAST_POSITION(path) >= B_NR_ITEMS(bh))  in comp_items()
920 	ih = tp_item_head(path);  in comp_items()
931 static inline int prepare_for_direct_item(struct treepath *path,  in prepare_for_direct_item()  argument
952 		pos_in_item(path) = round_len - (le_ih_k_offset(le_ih) - 1);  in prepare_for_direct_item()
953 		*cut_size = -(ih_item_len(le_ih) - pos_in_item(path));  in prepare_for_direct_item()
967 		      (pos_in_item(path) =  in prepare_for_direct_item()
972 static inline int prepare_for_direntry_item(struct treepath *path,  in prepare_for_direntry_item()  argument
999 	      entry_length(get_last_bh(path), le_ih, pos_in_item(path)));  in prepare_for_direntry_item()
1018 				      struct treepath *path,  in prepare_for_delete_or_cut()  argument
1032 	struct item_head *p_le_ih = tp_item_head(path);  in prepare_for_delete_or_cut()
1033 	struct buffer_head *bh = PATH_PLAST_BUFFER(path);  in prepare_for_delete_or_cut()
1049 		return prepare_for_direntry_item(path, p_le_ih, inode,  in prepare_for_delete_or_cut()
1055 		return prepare_for_direct_item(path, p_le_ih, inode,  in prepare_for_delete_or_cut()
1079 		bh = PATH_PLAST_BUFFER(path);  in prepare_for_delete_or_cut()
1080 		copy_item_head(&s_ih, tp_item_head(path));  in prepare_for_delete_or_cut()
1109 		    if (item_moved (&s_ih, path))  {  in prepare_for_delete_or_cut()
1131 		     search_for_position_by_key(sb, item_key, path) == POSITION_FOUND);  in prepare_for_delete_or_cut()
1132 	    pos_in_item(path) = pos * UNFM_P_SIZE;  in prepare_for_delete_or_cut()
1175 			   struct treepath *path, int size)  in init_tb_struct()  argument
1183 	tb->tb_path = path;  in init_tb_struct()
1184 	PATH_OFFSET_PBUFFER(path, ILLEGAL_PATH_ELEMENT_OFFSET) = NULL;  in init_tb_struct()
1185 	PATH_OFFSET_POSITION(path, ILLEGAL_PATH_ELEMENT_OFFSET) = 0;  in init_tb_struct()
1234 			 struct treepath *path, const struct cpu_key *item_key,  in reiserfs_delete_item()  argument
1252 	init_tb_struct(th, &s_del_balance, sb, path,  in reiserfs_delete_item()
1262 		    prepare_for_delete_or_cut(th, inode, path,  in reiserfs_delete_item()
1269 		copy_item_head(&s_ih, tp_item_head(path));  in reiserfs_delete_item()
1280 		    search_for_position_by_key(sb, item_key, path);  in reiserfs_delete_item()
1298 	q_ih = tp_item_head(path);  in reiserfs_delete_item()
1347 		       ih_item_body(PATH_PLAST_BUFFER(path), &s_ih),  in reiserfs_delete_item()
1391 	INITIALIZE_PATH(path);  in reiserfs_delete_solid_item()
1403 		retval = search_item(th->t_super, &cpu_key, &path);  in reiserfs_delete_solid_item()
1411 			pathrelse(&path);  in reiserfs_delete_solid_item()
1431 			item_len = ih_item_len(tp_item_head(&path));  in reiserfs_delete_solid_item()
1432 			init_tb_struct(th, &tb, th->t_super, &path,  in reiserfs_delete_solid_item()
1435 		quota_cut_bytes = ih_item_len(tp_item_head(&path));  in reiserfs_delete_solid_item()
1473 	reiserfs_check_path(&path);  in reiserfs_delete_solid_item()
1542 				    struct treepath *path,  in maybe_indirect_to_direct()  argument
1564 		pathrelse(path);  in maybe_indirect_to_direct()
1569 	return indirect2direct(th, inode, page, path, item_key,  in maybe_indirect_to_direct()
1580 					 struct inode *inode, struct treepath *path)  in indirect_to_direct_roll_back()  argument
1594 		if (search_for_position_by_key(inode->i_sb, &tail_key, path) ==  in indirect_to_direct_roll_back()
1598 		RFALSE(path->pos_in_item !=  in indirect_to_direct_roll_back()
1599 		       ih_item_len(tp_item_head(path)) - 1,  in indirect_to_direct_roll_back()
1601 		PATH_LAST_POSITION(path)--;  in indirect_to_direct_roll_back()
1604 		    reiserfs_delete_item(th, path, &tail_key, inode,  in indirect_to_direct_roll_back()
1622 			   struct treepath *path,  in reiserfs_cut_from_item()  argument
1648 	init_tb_struct(th, &s_cut_balance, inode->i_sb, path,  in reiserfs_cut_from_item()
1664 		    prepare_for_delete_or_cut(th, inode, path,  in reiserfs_cut_from_item()
1677 						     path, item_key,  in reiserfs_cut_from_item()
1707 			     path) == POSITION_NOT_FOUND) {  in reiserfs_cut_from_item()
1708 				print_block(PATH_PLAST_BUFFER(path), 3,  in reiserfs_cut_from_item()
1709 					    PATH_LAST_POSITION(path) - 1,  in reiserfs_cut_from_item()
1710 					    PATH_LAST_POSITION(path) + 1);  in reiserfs_cut_from_item()
1718 			pathrelse(path);  in reiserfs_cut_from_item()
1731 		    search_for_position_by_key(sb, item_key, path);  in reiserfs_cut_from_item()
1748 			indirect_to_direct_roll_back(th, inode, path);  in reiserfs_cut_from_item()
1764 	     M_DELETE) ? ih_item_len(tp_item_head(path)) : -s_cut_balance.  in reiserfs_cut_from_item()
2027 static void check_research_for_paste(struct treepath *path,  in check_research_for_paste()  argument
2030 	struct item_head *found_ih = tp_item_head(path);  in check_research_for_paste()
2035 				    get_last_bh(path)->b_size) !=  in check_research_for_paste()
2038 				       get_last_bh(path)->b_size) !=  in check_research_for_paste()
2039 		    pos_in_item(path))  in check_research_for_paste()
2043 				       pos_in_item(path), key);  in check_research_for_paste()
2048 				    get_last_bh(path)->b_size) !=  in check_research_for_paste()
2050 		    || I_UNFM_NUM(found_ih) != pos_in_item(path)  in check_research_for_paste()
2055 				       found_ih, pos_in_item(path), key);  in check_research_for_paste()
2168 			 struct treepath *path, const struct cpu_key *key,  in reiserfs_insert_item()  argument
2204 			pathrelse(path);  in reiserfs_insert_item()
2208 	init_tb_struct(th, &s_ins_balance, th->t_super, path,  in reiserfs_insert_item()
2227 		retval = search_item(th->t_super, key, path);  in reiserfs_insert_item()