113   struct item_head * dih;  in leaf_copy_boundary_item()  local
122     dih = B_N_PITEM_HEAD (dest, dest_nr_item - 1);  in leaf_copy_boundary_item()
156 			  dest_nr_item - 1, ih_item_len(dih), bytes_or_entries, B_I_PITEM(src,ih), 0  in leaf_copy_boundary_item()
159     if (is_indirect_le_ih (dih)) {  in leaf_copy_boundary_item()
160       RFALSE( get_ih_free_space (dih),  in leaf_copy_boundary_item()
164 	set_ih_free_space (dih, get_ih_free_space (ih));  in leaf_copy_boundary_item()
178   dih = B_N_PITEM_HEAD (dest, 0);  in leaf_copy_boundary_item()
180   if (!dest_nr_item || !op_is_left_mergeable (&(dih->ih_key), src->b_size))  in leaf_copy_boundary_item()
205     RFALSE( le_ih_k_offset (dih) !=  in leaf_copy_boundary_item()
207             "vs-10050: items %h and %h do not match", ih, dih);  in leaf_copy_boundary_item()
210     set_le_ih_k_offset (dih, le_ih_k_offset (ih));  in leaf_copy_boundary_item()
214     set_le_ih_k_type (dih, le_ih_k_type (ih));  in leaf_copy_boundary_item()
222     if ( is_direct_le_ih (dih) ) {  in leaf_copy_boundary_item()
223       RFALSE( le_ih_k_offset (dih) <= (unsigned long)bytes_or_entries,  in leaf_copy_boundary_item()
224 	      "vs-10070: dih %h, bytes_or_entries(%d)", dih, bytes_or_entries);  in leaf_copy_boundary_item()
225       set_le_ih_k_offset (dih, le_ih_k_offset (dih) - bytes_or_entries);  in leaf_copy_boundary_item()
227       RFALSE( le_ih_k_offset (dih) <=  in leaf_copy_boundary_item()
230               dih, (bytes_or_entries/UNFM_P_SIZE)*dest->b_size);  in leaf_copy_boundary_item()
231 …set_le_ih_k_offset (dih, le_ih_k_offset (dih) - ((bytes_or_entries / UNFM_P_SIZE) * dest->b_size));  in leaf_copy_boundary_item()