Searched refs:S_new (Results 1 - 3 of 3) sorted by relevance

/linux-master/fs/reiserfs/
H A Ddo_balan.c931 /* new item or it part don't falls into S_new[i] */
934 tb->snum[i], tb->sbytes[i], tb->S_new[i]);
938 /* new item or it's part falls to first new node S_new[i] */
940 /* part of new item falls into S_new[i] */
945 /* Move snum[i]-1 items from S[0] to S_new[i] */
947 tb->S_new[i]);
955 * into S_new[i]
966 /* Insert part of the item into S_new[i] before 0-th item */
967 buffer_info_init_bh(tb, &bi, tb->S_new[i]);
990 /* whole new item falls into S_new[
[all...]
H A Dibalance.c820 struct buffer_head *S_new; local
1045 /* S_new = free buffer from list FEB */
1046 S_new = get_FEB(tb);
1048 set_blkh_level(B_BLK_HEAD(S_new), h + 1);
1051 dest_bi.bi_bh = S_new;
1062 /* new items don't fall into S_new */
1071 /* all new items fall into S_new */
1087 * into S_new
1090 /*S_new,tb->S[h-1]->b_next, */
1100 /* some items fall into S_new, bu
[all...]
H A Dreiserfs.h2501 struct buffer_head *S_new[2]; member in struct:tree_balance
2504 * number of items that will be placed into nodes in S_new
2510 * number of bytes which flow to nodes in S_new when S[0] splits

Completed in 290 milliseconds