Lines Matching refs:rnum
292 tb->rnum[h] = cur_free / (DC_SIZE + KEY_SIZE);
300 tb->rnum[h] = 0;
317 tb->rnum[h] = vn->vn_nr_item;
328 tb->rnum[0] = 0;
335 tb->rnum[0]++;
351 tb->rnum[0]++;
576 * rnum number of items from S[h] that must be shifted to R[h];
587 int rnum, int blk_num, short *s012, int lb, int rb)
591 tb->rnum[h] = rnum;
605 PROC_INFO_ADD(tb->tb_sb, rnum[h], rnum);
612 neighbor and tb->rnum[0] to the right one. */
623 to_right = tb->rnum[0] - ((tb->rbytes != -1) ? 1 : 0);
711 /* when we do not split item, lnum and rnum are numbers of entire items */
1303 if (h && (tb->rnum[h] + tb->lnum[h] >= vn->vn_nr_item + 1)) {
1313 ((MAX_NR_KEY(Sh) << 1) + 2 - tb->lnum[h] - tb->rnum[h] +
1315 tb->rnum[h]);
1324 tb->rnum[h] >= vn->vn_nr_item + 1),
1327 (tb->rnum[h] >= vn->vn_nr_item && (tb->rbytes == -1))),
1370 rpar = tb->rnum[h];
1483 tb->rnum[h] != 1 ||
1487 set_parameters(tb, h, tb->lnum[h], tb->rnum[h],
1494 tb->rnum[h] -
1616 if (tb->rnum[h] >= vn->vn_nr_item + 1) {
1634 if (tb->rnum[h] + tb->lnum[h] >= vn->vn_nr_item + 1) {
1640 tb->rnum[h] + vn->vn_nr_item + 1) / 2 -
1641 (MAX_NR_KEY(Sh) + 1 - tb->rnum[h]);
1656 || tb->rnum[h] < vn->vn_nr_item + 1 || !tb->FR[h]) {
1672 if (tb->rnum[h] >= vn->vn_nr_item + 1) {
1687 if (tb->rnum[h] + tb->lnum[h] >= vn->vn_nr_item + 1) {
1691 ((MAX_NR_KEY(Sh) << 1) + 2 - tb->lnum[h] - tb->rnum[h] +
1693 tb->rnum[h]);
1714 -((MAX_NR_KEY(Sh) + 1 - tb->rnum[h] + vn->vn_nr_item +
1786 if (is_left_neighbor_in_cache(tb, h) || ((tb->rnum[0] - ((tb->rbytes == -1) ? 0 : 1)) < vn->vn_nr_item) || /* S can not be merged with R */
1798 if (tb->rnum[0] >= vn->vn_nr_item && tb->rbytes == -1) {
1930 /* Using lnum[n_h] and rnum[n_h] we should determine what neighbors
1984 if (p_s_tb->rnum[n_h]) { /* We need right neighbor to balance S[n_path_offset]. */
2218 if (!locked && (p_s_tb->rnum[i])) {