Lines Matching defs:from
202 * Delete del_num items and node pointers from buffer cur starting from
276 /* delete n node pointers and items starting from given position */
277 static void internal_delete_childs(struct buffer_info *cur_bi, int from, int n)
281 i_from = (from == 0) ? from : from - 1;
284 * delete n pointers starting from `from' position in CUR;
285 * delete n keys starting from 'i_from' position in CUR;
287 internal_delete_pointers_items(cur_bi, from, i_from, n);
291 * copy cpy_num node pointers and cpy_num - 1 items from buffer src to buffer
294 * from src to tail of dest
296 * from src to head of dest
388 * Copy cpy_num node pointers and cpy_num - 1 items from buffer src to
390 * Delete cpy_num - del_par items and node pointers from buffer src.
391 * last_first == FIRST_TO_LAST means, that we copy/delete first items from src.
392 * last_first == LAST_TO_FIRST means, that we copy/delete last items from src.
481 * Insert d_key'th (delimiting) key from buffer cfl to tail of dest.
482 * Copy pointer_amount node pointers and pointer_amount - 1 items from
485 * Delete pointer_amount items and node pointers from buffer src.
487 /* this can be invoked both to shift from S to L and from R to S */
507 * insert delimiting key from common father of dest and
530 * Copy n node pointers and n - 1 items from buffer S[h] to L[h].
531 * Delete n - 1 items and node pointers from buffer S[h].
533 /* it always shifts from S[h] to L[h] */
544 /* insert lkey[h]-th key from CFL[h] to left neighbor L[h] */
555 * Insert d_key'th (delimiting) key from buffer cfr to head of dest.
556 * Copy n node pointers and n - 1 items from buffer src to buffer dest.
558 * Delete n items and node pointers from buffer src.
580 * insert delimiting key from common father of dest
605 * Copy n node pointers and n - 1 items from buffer S[h] to R[h].
606 * Delete n - 1 items and node pointers from buffer S[h].
608 /* it always shift from S[h] to R[h] */
619 /* insert rkey from CFR[h] to right neighbor R[h] */
689 /* do what is needed for buffer thrown from tree */
721 /* borrow from left neighbor L[h] */
724 "wrong tb->rnum[%d]==%d when borrow from L[h]", h,
731 /* borrow from right neighbor R[h] */
734 "invalid tb->lnum[%d]==%d when borrow from R[h]",
835 * that must be inserted to or deleted from S[h].
856 * shift lnum[h] items from S[h] to the left neighbor L[h].
924 /*shift rnum[h] items from S[h] to the right neighbor R[h] */
996 /* do what is needed for buffer thrown from tree */
1010 /* S[h] = empty buffer from the list FEB. */
1045 /* S_new = free buffer from list FEB */