168     if ( tb->lnum[0] )     /* L[0] takes part in balancing */  in balance_leaf_when_delete()
170 	if ( tb->lnum[0] == -1 )    /* L[0] must be joined with S[0] */  in balance_leaf_when_delete()
212 	RFALSE( ( tb->lnum[0] + tb->rnum[0] < n ) ||   in balance_leaf_when_delete()
213 		( tb->lnum[0] + tb->rnum[0] > n+1 ),  in balance_leaf_when_delete()
215 		tb->rnum[0], tb->lnum[0], n);  in balance_leaf_when_delete()
216 	RFALSE( ( tb->lnum[0] + tb->rnum[0] == n ) &&   in balance_leaf_when_delete()
220 	RFALSE( ( tb->lnum[0] + tb->rnum[0] == n + 1 ) &&   in balance_leaf_when_delete()
225 	leaf_shift_left (tb, tb->lnum[0], tb->lbytes);  in balance_leaf_when_delete()
293     if ( tb->lnum[0] > 0 ) {  in balance_leaf()
295 	if ( item_pos < tb->lnum[0] ) {  in balance_leaf()
302 		if ( item_pos == tb->lnum[0] - 1 && tb->lbytes != -1 ) {  in balance_leaf()
307 		    ret_val = leaf_shift_left (tb, tb->lnum[0]-1, -1);  in balance_leaf()
345 		    ret_val = leaf_shift_left(tb, tb->lnum[0]-1, tb->lbytes);  in balance_leaf()
359 		if ( item_pos == tb->lnum[0] - 1 && tb->lbytes != -1 ) {  in balance_leaf()
372 			    ret_val = leaf_shift_left(tb, tb->lnum[0], tb->lbytes - 1);  in balance_leaf()
399 			    leaf_shift_left (tb, tb->lnum[0], tb->lbytes);  in balance_leaf()
426 			    ret_val =  leaf_shift_left(tb,tb->lnum[0],   in balance_leaf()
491 			    leaf_shift_left(tb,tb->lnum[0],tb->lbytes);  in balance_leaf()
510 		    ret_val = leaf_shift_left(tb,tb->lnum[0],tb->lbytes);  in balance_leaf()
539 	    leaf_shift_left(tb,tb->lnum[0],tb->lbytes);  in balance_leaf()
544     item_pos -= ( tb->lnum[0] - (( tb->lbytes != -1 ) ? 1 : 0));  in balance_leaf()
799 	RFALSE( ! tb->lnum[0] || ! tb->rnum[0],  in balance_leaf()
1379   if ( tb->lnum[0] ) {  in check_before_balancing()
1400     if (tb->lnum[0]) {  in check_after_balance_leaf()
1452     if (tb->lnum[h])  in check_internal_levels()