fs/reiserfs/lbalance.c

36 	 * length of all record to be copied and first byte of
52 	/* when copy last to first, dest buffer can contain 0 items */
59 	 * if there are no items in dest or the first/last item in
128  * Copy the first (if last_first == FIRST_TO_LAST) or last
147 	 * if ( DEST is empty or first item of SOURCE and last item of
174 		 * copy part of the body of the first item of SOURCE
196 		 * merge first item (or its part) of src buffer with the last
217 	 * (DEST is empty or last item of SOURCE and first item of DEST
244 	 * begin of the body of the first item of the DEST; part defined
246 	 * change first item key of the DEST; don't create new item header
261 		/* change first item key of the DEST */
274 		/* change first item key of the DEST */
306  *                             from first-th item in src to tail of dest
308  *                             from first-th item in src to head of dest
312 				     int first, int cpy_num)
324 	RFALSE(B_NR_ITEMS(src) - first < cpy_num,
326 	       B_NR_ITEMS(src), cpy_num, first);
347 	/* location of head of first new item */
358 	memcpy(ih, item_head(src, first), cpy_num * IH_SIZE);
385 	       item_body(src, (first + cpy_num - 1)),
548 		 * copy the first item or it part or nothing to the end of
558 			 * copy first cpy_num items starting from position
565 			 * copy first cpy_num-1 items starting from position
815 				       int first, int del_num);
817  * If del_bytes == -1, starting from position 'first' delete del_num
820  *   If last_first == 0. Starting from position 'first' delete del_num-1
821  *   items in whole. Delete part of body of the first item. Part defined by
822  *   del_bytes. Don't delete first item header
823  *   If last_first == 1. Starting from position 'first+1' delete del_num-1
828 		       int first, int del_num, int del_bytes)
836 	RFALSE(first < 0
837 	       || first + del_num > item_amount,
838 	       "10165: invalid number of first item to be deleted (%d) or "
839 	       "no so much items (%d) to delete (only %d)", first,
840 	       first + del_num, item_amount);
845 	if (first == 0 && del_num == item_amount && del_bytes == -1) {
852 		/* delete del_num items beginning from item in position first */
853 		leaf_delete_items_entirely(cur_bi, first, del_num);
858 			 * item in position first
860 			leaf_delete_items_entirely(cur_bi, first, del_num - 1);
863 			 * delete the part of the first item of the bh
873 			 * item in position first+1
875 			leaf_delete_items_entirely(cur_bi, first + 1,
1094 	/* first byte of item */
1101 	 * first byte of remaining entries, those are BEFORE cut entries
1138  *      pos_in_item - first byte that must be cut
1142  *      pos_in_item - number of first deleted entry
1162 		/* first cut entry () */
1167 			       "when 0-th enrty of item is cut, that item must be first in the node, not %d-th",
1169 			/* change item key by key of first entry in the item */
1239 /* delete del_num items from buffer starting from the first'th item */
1241 				       int first, int del_num)
1259 	RFALSE(first < 0 || first + del_num > nr,
1260 	       "10220: first=%d, number=%d, there is %d items", first, del_num,
1263 	if (first == 0 && del_num == nr) {
1271 	ih = item_head(bh, first);
1274 	j = (first == 0) ? bh->b_size : ih_location(ih - 1);
1277 	last_loc = ih_location(&ih[nr - 1 - first]);
1284 	memmove(ih, ih + del_num, (nr - first - del_num) * IH_SIZE);
1287 	for (i = first; i < nr - del_num; i++)
1288 		put_ih_location(&ih[i - first],
1289 				ih_location(&ih[i - first]) + (j -
1342 	/* first byte of dest item */