fs/reiserfs/fix_node.c

291 		tb->rnum[h] = cur_free / (DC_SIZE + KEY_SIZE);
299 		tb->rnum[h] = 0;
316 		tb->rnum[h] = vn->vn_nr_item;
327 	tb->rnum[0] = 0;
334 			tb->rnum[0]++;
358 			tb->rnum[0]++;
610  *	rnum	number of items from S[h] that must be shifted to R[h];
622 			   int rnum, int blk_num, short *s012, int lb, int rb)
626 	tb->rnum[h] = rnum;
642 	PROC_INFO_ADD(tb->tb_sb, rnum[h], rnum);
650  * neighbor and tb->rnum[0] to the right one.
664 	to_right = tb->rnum[0] - ((tb->rbytes != -1) ? 1 : 0);
757 /* when we do not split item, lnum and rnum are numbers of entire items */
1434 	if (h && (tb->rnum[h] + tb->lnum[h] >= vn->vn_nr_item + 1)) {
1446 		    ((MAX_NR_KEY(Sh) << 1) + 2 - tb->lnum[h] - tb->rnum[h] +
1448 						tb->rnum[h]);
1460 		tb->rnum[h] >= vn->vn_nr_item + 1),
1463 		      (tb->rnum[h] >= vn->vn_nr_item && (tb->rbytes == -1))),
1513 		rpar = tb->rnum[h];
1640 				tb->rnum[h] != 1 ||
1644 				set_parameters(tb, h, tb->lnum[h], tb->rnum[h],
1651 					       tb->rnum[h] -
1803 			if (tb->rnum[h] >= vn->vn_nr_item + 1) {
1824 		if (tb->rnum[h] + tb->lnum[h] >= vn->vn_nr_item + 1) {
1829 			     tb->rnum[h] + vn->vn_nr_item + 1) / 2 -
1830 			    (MAX_NR_KEY(Sh) + 1 - tb->rnum[h]);
1848 		    || tb->rnum[h] < vn->vn_nr_item + 1 || !tb->FR[h]) {
1864 	if (tb->rnum[h] >= vn->vn_nr_item + 1) {
1879 	if (tb->rnum[h] + tb->lnum[h] >= vn->vn_nr_item + 1) {
1883 		    ((MAX_NR_KEY(Sh) << 1) + 2 - tb->lnum[h] - tb->rnum[h] +
1885 						tb->rnum[h]);
1906 		       -((MAX_NR_KEY(Sh) + 1 - tb->rnum[h] + vn->vn_nr_item +
1987 		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 */
1999 	if (tb->rnum[0] >= vn->vn_nr_item && tb->rbytes == -1) {
2145  * Using lnum[h] and rnum[h] we should determine what neighbors
2203 	if (tb->rnum[h]) {
2439 			if (!locked && (tb->rnum[i])) {