Searched refs:lkey (Results 1 - 8 of 8) sorted by relevance
/asus-wl-520gu-7.0.1.45/src/linux/linux/fs/reiserfs/ |
H A D | do_balan.c | 119 replace_key(tb, tb->CFL[0],tb->lkey[0],tbS0,0); 123 replace_key(tb, tb->CFL[0],tb->lkey[0],PATH_H_PPARENT(tb->tb_path, 0),0); 149 replace_key(tb, tb->CFL[0],tb->lkey[0],tbS0,0); 178 replace_key(tb, tb->CFL[0],tb->lkey[0],tb->FR[0],1); 454 version = ih_version (B_N_PITEM_HEAD(tb->CFL[0],tb->lkey[0])); 455 set_le_key_k_offset (version, B_N_PDELIM_KEY(tb->CFL[0],tb->lkey[0]), 456 le_key_k_offset (version, B_N_PDELIM_KEY(tb->CFL[0],tb->lkey[0])) + l_n); 475 (B_N_PDELIM_KEY(tb->CFL[0],tb->lkey[0]), 804 copy_key (B_N_PDELIM_KEY (tb->CFL[0], tb->lkey[0]), B_N_PDELIM_KEY (tb->CFR[0], tb->rkey[0])); 1092 replace_key(tb, tb->CFL[0], tb->lkey[ [all...] |
H A D | ibalance.c | 52 *d_key = tb->lkey[h]; 64 *d_key = tb->lkey[h]; 507 if ( pointer_amount > 0 ) /* insert lkey[h]-th key from CFL[h] to left neighbor L[h] */ 509 /* internal_insert_key (tb->L[h], B_NR_ITEM(tb->L[h]), tb->CFL[h], tb->lkey[h]);*/ 549 replace_key (tb, cf, d_key_position, tb->CFL[h], tb->lkey[h]); 670 /*internal_shift_right (tb, h, tb->L[h], tb->CFL[h], tb->lkey[h], tb->S[h], -tb->lnum[h]);*/ 688 internal_shift_left (INTERNAL_SHIFT_FROM_S_TO_L, tb, h, tb->lnum[h]);/*tb->L[h], tb->CFL[h], tb->lkey[h], tb->S[h], tb->lnum[h]);*/ 714 memcpy (B_N_PDELIM_KEY(tb->CFL[h],tb->lkey[h]), key, KEY_SIZE); 803 /*internal_shift_left (tb->L[h],tb->CFL[h],tb->lkey[h],tbSh,tb->lnum[h]);*/ 808 /* internal_shift_left(tb->L[h],tb->CFL[h],tb->lkey[ [all...] |
H A D | fix_node.c | 919 p_s_tb->lkey[n_h] : B_NR_ITEMS (p_s_tb->FL[n_h]); 1032 (p_s_tb->lkey[n_h - 1] = n_position - 1) : (p_s_tb->rkey[n_h - 1] = n_position))); 1064 * Calculate numbers of left and right delimiting keys position: lkey[n_path_offset], rkey[n_path_offset]. 1096 p_s_tb->lkey[n_h] = n_position - 1; 1102 Calculate lkey[n_path_offset]. */ 1927 n_child_position = ( p_s_bh == p_s_tb->FL[n_h] ) ? p_s_tb->lkey[n_h] : B_NR_ITEMS (p_s_tb->FL[n_h]);
|
H A D | prints.c | 629 tb->s0num, tb->s1num,tb->s1bytes, tb->s2num, tb->s2bytes, tb->cur_blknum, tb->lkey[0], tb->rkey[0]);
|
H A D | lbalance.c | 613 replace_key (tb, tb->CFL[0], tb->lkey[0], PATH_H_PPARENT (tb->tb_path, 0), 0); 616 /* replace lkey in CFL[0] by 0-th key from S[0]; */ 617 replace_key (tb, tb->CFL[0], tb->lkey[0], S0, 0);
|
/asus-wl-520gu-7.0.1.45/src/linux/linux/fs/jfs/ |
H A D | jfs_dtree.c | 3680 struct component_name lkey = { 0, lname }; local 3685 dtGetKey(lp, li, &lkey, flag); 3686 lkey.name[lkey.namlen] = 0; 3689 ciToUpper(&lkey); 3701 namlen = min(lkey.namlen, rkey.namlen); 3702 for (pl = lkey.name, pr = rkey.name; 3712 if (lkey.namlen < rkey.namlen) {
|
/asus-wl-520gu-7.0.1.45/src/router/iproute2/reference/linux/ |
H A D | reiserfs_fs.h | 1305 int lkey[MAX_HEIGHT]; /* array indexed by height h mapping the key delimiting L[h] and member in struct:tree_balance
|
/asus-wl-520gu-7.0.1.45/src/linux/linux/include/linux/ |
H A D | reiserfs_fs.h | 1305 int lkey[MAX_HEIGHT]; /* array indexed by height h mapping the key delimiting L[h] and member in struct:tree_balance
|
Completed in 194 milliseconds