Lines Matching defs:shift
236 * >0 means to shift entirely or partly the specified number of items
297 int new_item_len, shift;
320 shift = 0;
322 shift = tb->tb_sb->s_blocksize_bits - UNFM_P_SHIFT;
324 add_le_ih_k_offset(ih, tb->lbytes << shift);
428 "PAP-12095: there is nothing to shift to L[0]. "
482 int shift = tb->tb_sb->s_blocksize_bits - UNFM_P_SHIFT;
483 temp_l = l_n << shift;
590 /* we must shift the part of the appended item */
606 /* new item or it part falls to L[0], shift it too */
642 int shift;
655 shift = 0;
657 shift = tb->tb_sb->s_blocksize_bits - UNFM_P_SHIFT;
658 offset = le_ih_k_offset(ih) + ((old_len - tb->rbytes) << shift);
724 "PAP-12150: no enough of entries to shift to R[0]: "
804 int shift = tb->tb_sb->s_blocksize_bits - UNFM_P_SHIFT;
805 temp_rem = n_rem << shift;
896 /* we must shift the part of the appended item */
903 /* shift rnum[0] items from S[0] to the right neighbor R[0] */
929 int shift;
957 shift = 0;
959 shift = tb->tb_sb->s_blocksize_bits - UNFM_P_SHIFT;
962 ((old_len - tb->sbytes[i]) << shift));
1073 int n_shift, n_rem, r_zeroes_number, shift;
1125 shift = 0;
1128 shift = tb->tb_sb->s_blocksize_bits - UNFM_P_SHIFT;
1130 add_le_ih_k_offset(tmp, n_rem << shift);
1210 /* we must shift part of the appended item */
1235 /* here we shift from S to S_new nodes */
1691 "shift to left was incorrect");
1701 "shift to right was incorrect");
1773 * if we shift leaves then we shift as much as we can: this is a
1779 * if we shift internal nodes we try to evenly balance the node