Lines Matching refs:lnum
212 tb->lnum[h] = cur_free / (DC_SIZE + KEY_SIZE);
220 tb->lnum[h] = 0;
237 tb->lnum[0] = vn->vn_nr_item;
248 tb->lnum[0] = 0;
255 tb->lnum[0]++;
271 tb->lnum[0]++;
575 * lnum number of items from S[h] that must be shifted to L[h];
586 static void set_parameters(struct tree_balance *tb, int h, int lnum,
590 tb->lnum[h] = lnum;
604 PROC_INFO_ADD(tb->tb_sb, lnum[h], lnum);
611 /* check, does node disappear if we shift tb->lnum[0] items to left
622 to_left = tb->lnum[0] - ((tb->lbytes != -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] +
1323 (tb->lnum[h] >= vn->vn_nr_item + 1 ||
1326 RFALSE(!h && ((tb->lnum[h] >= vn->vn_nr_item && (tb->lbytes == -1)) ||
1369 lpar = tb->lnum[h];
1482 (tb->lnum[h] != 1 ||
1487 set_parameters(tb, h, tb->lnum[h], tb->rnum[h],
1492 tb->lnum[h] -
1599 if (tb->lnum[h] >= vn->vn_nr_item + 1) {
1634 if (tb->rnum[h] + tb->lnum[h] >= vn->vn_nr_item + 1) {
1639 ((MAX_NR_KEY(Sh) << 1) + 2 - tb->lnum[h] -
1654 if (tb->lnum[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] +
1707 (MAX_NR_KEY(Sh) + 1 - tb->lnum[h] + vn->vn_nr_item +
1785 if (tb->lnum[0] >= vn->vn_nr_item && tb->lbytes == -1)
1930 /* Using lnum[n_h] and rnum[n_h] we should determine what neighbors
1946 if (p_s_tb->lnum[n_h]) {
2187 if (p_s_tb->lnum[i]) {