Lines Matching refs:rnum
293 tb->rnum[h] = cur_free / (DC_SIZE + KEY_SIZE);
301 tb->rnum[h] = 0;
318 tb->rnum[h] = vn->vn_nr_item;
329 tb->rnum[0] = 0;
336 tb->rnum[0]++;
352 tb->rnum[0]++;
574 * rnum number of items from S[h] that must be shifted to R[h];
585 int rnum, int blk_num, short *s012, int lb, int rb)
589 tb->rnum[h] = rnum;
603 PROC_INFO_ADD(tb->tb_sb, rnum[h], rnum);
610 neighbor and tb->rnum[0] to the right one. */
621 to_right = tb->rnum[0] - ((tb->rbytes != -1) ? 1 : 0);
709 /* when we do not split item, lnum and rnum are numbers of entire items */
1312 if (h && (tb->rnum[h] + tb->lnum[h] >= vn->vn_nr_item + 1)) {
1322 ((MAX_NR_KEY(Sh) << 1) + 2 - tb->lnum[h] - tb->rnum[h] +
1324 tb->rnum[h]);
1333 tb->rnum[h] >= vn->vn_nr_item + 1),
1336 (tb->rnum[h] >= vn->vn_nr_item && (tb->rbytes == -1))),
1379 rpar = tb->rnum[h];
1492 tb->rnum[h] != 1 ||
1496 set_parameters(tb, h, tb->lnum[h], tb->rnum[h],
1503 tb->rnum[h] -
1625 if (tb->rnum[h] >= vn->vn_nr_item + 1) {
1643 if (tb->rnum[h] + tb->lnum[h] >= vn->vn_nr_item + 1) {
1649 tb->rnum[h] + vn->vn_nr_item + 1) / 2 -
1650 (MAX_NR_KEY(Sh) + 1 - tb->rnum[h]);
1665 || tb->rnum[h] < vn->vn_nr_item + 1 || !tb->FR[h]) {
1681 if (tb->rnum[h] >= vn->vn_nr_item + 1) {
1696 if (tb->rnum[h] + tb->lnum[h] >= vn->vn_nr_item + 1) {
1700 ((MAX_NR_KEY(Sh) << 1) + 2 - tb->lnum[h] - tb->rnum[h] +
1702 tb->rnum[h]);
1723 -((MAX_NR_KEY(Sh) + 1 - tb->rnum[h] + vn->vn_nr_item +
1795 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 */
1807 if (tb->rnum[0] >= vn->vn_nr_item && tb->rbytes == -1) {
1941 /* Using lnum[h] and rnum[h] we should determine what neighbors
1998 if (tb->rnum[h]) { /* We need right neighbor to balance S[path_offset]. */
2227 if (!locked && (tb->rnum[i])) {