Home
last modified time | relevance | path

Searched refs:lnum (Results 1 – 11 of 11) sorted by relevance

/linux-2.4.37.9/fs/reiserfs/
Dibalance.c610 if ( tb->lnum[h] == 0 && tb->rnum[h] == 0 ) { in balance_internal_when_delete()
644 if ( tb->L[h] && tb->lnum[h] == -B_NR_ITEMS(tb->L[h]) - 1 ) { /* join S[h] with L[h] */ in balance_internal_when_delete()
657 RFALSE( tb->lnum[h] != 0, in balance_internal_when_delete()
659 h, tb->lnum[h]); in balance_internal_when_delete()
667 if ( tb->lnum[h] < 0 ) { /* borrow from left neighbor L[h] */ in balance_internal_when_delete()
671 internal_shift_right (INTERNAL_SHIFT_FROM_L_TO_S, tb, h, -tb->lnum[h]); in balance_internal_when_delete()
676 RFALSE( tb->lnum[h] != 0, in balance_internal_when_delete()
678 h, tb->lnum[h]); in balance_internal_when_delete()
683 if ( tb->lnum[h] > 0 ) { /* split S[h] into two parts and put them into neighbors */ in balance_internal_when_delete()
684 RFALSE( tb->rnum[h] == 0 || tb->lnum[h] + tb->rnum[h] != n + 1, in balance_internal_when_delete()
[all …]
Ddo_balan.c168 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()
[all …]
Dfix_node.c206 tb->lnum[h] = cur_free / (DC_SIZE + KEY_SIZE); in check_left()
214 tb->lnum[h] = 0; in check_left()
229 tb->lnum[0] = vn->vn_nr_item; in check_left()
241 tb->lnum[0] = 0; in check_left()
247 tb->lnum[0] ++; in check_left()
263 tb->lnum[0] ++; in check_left()
557 static void set_parameters (struct tree_balance * tb, int h, int lnum, in set_parameters() argument
561 tb->lnum[h] = lnum; in set_parameters()
578 PROC_INFO_ADD( tb -> tb_sb, lnum[ h ], lnum ); in set_parameters()
598 to_left = tb->lnum[0] - ((tb->lbytes != -1) ? 1 : 0); in is_leaf_removable()
[all …]
Dprints.c635 tb->insert_size[0], tb->lnum[0], tb->lbytes, tb->rnum[0],tb->rbytes, tb->blknum[0], in store_print_tb()
644 h, tb->insert_size[h], tb->lnum[h], tb->rnum[h], tb->blknum[h]); in store_print_tb()
Dprocfs.c289 SFPL( lnum ), in reiserfs_per_level_in_proc()
/linux-2.4.37.9/drivers/media/video/
Dplanb.c484 gbuf->lnum = 0; in planb_prepare_video()
1048 gbuf->l_fr_addr_idx + gbuf->lnum; i++) in vgrab()
1295 gbuf->lnum = 0; in setup_grab_cmd()
1357 pb->l_to_addr[fr][gbuf->lnum] = pb->rawbuf[pagei] in setup_grab_cmd()
1360 pb->l_to_next_idx[fr][gbuf->lnum] = pagei + 1; in setup_grab_cmd()
1362 pb->l_to_next_size[fr][gbuf->lnum] = count - lov0; in setup_grab_cmd()
1365 + gbuf->lnum]), jump); in setup_grab_cmd()
1366 if(++gbuf->lnum > MAX_LNUM) { in setup_grab_cmd()
1368 gbuf->lnum--; in setup_grab_cmd()
1429 pb->l_to_addr[fr][gbuf->lnum] = pb->rawbuf[pagei] in setup_grab_cmd()
[all …]
Dplanb.h280 int lnum; member
/linux-2.4.37.9/include/asm-ia64/sn/ksys/
Dl1.h166 int elsc_display_line(nasid_t nasid, char *line, int lnum);
/linux-2.4.37.9/arch/ia64/sn/io/sn2/
Dl1_command.c35 int elsc_display_line(nasid_t nasid, char *line, int lnum) in elsc_display_line() argument
/linux-2.4.37.9/include/linux/
Dreiserfs_fs_sb.h318 long int lnum[ 5 ]; /* XXX */ member
Dreiserfs_fs.h1427 int lnum[MAX_HEIGHT]; /* array of number of items which must be member