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

/linux-4.1.27/fs/reiserfs/
H A Ddo_balan.c940 /* new item or it part don't falls into S_new[i] */ balance_leaf_new_nodes_insert()
943 tb->snum[i], tb->sbytes[i], tb->S_new[i]); balance_leaf_new_nodes_insert()
947 /* new item or it's part falls to first new node S_new[i] */ balance_leaf_new_nodes_insert()
949 /* part of new item falls into S_new[i] */ balance_leaf_new_nodes_insert()
955 /* Move snum[i]-1 items from S[0] to S_new[i] */ balance_leaf_new_nodes_insert()
957 tb->S_new[i]); balance_leaf_new_nodes_insert()
966 * into S_new[i] balance_leaf_new_nodes_insert()
977 /* Insert part of the item into S_new[i] before 0-th item */ balance_leaf_new_nodes_insert()
978 buffer_info_init_bh(tb, &bi, tb->S_new[i]); balance_leaf_new_nodes_insert()
1001 /* whole new item falls into S_new[i] */ balance_leaf_new_nodes_insert()
1004 * Shift snum[0] - 1 items to S_new[i] balance_leaf_new_nodes_insert()
1008 tb->snum[i] - 1, tb->sbytes[i], tb->S_new[i]); balance_leaf_new_nodes_insert()
1010 /* Insert new item into S_new[i] */ balance_leaf_new_nodes_insert()
1011 buffer_info_init_bh(tb, &bi, tb->S_new[i]); balance_leaf_new_nodes_insert()
1034 /* new directory entry falls into S_new[i] */ balance_leaf_new_nodes_paste_dirent()
1048 tb->sbytes[i] - 1, tb->S_new[i]); balance_leaf_new_nodes_paste_dirent()
1054 buffer_info_init_bh(tb, &bi, tb->S_new[i]); balance_leaf_new_nodes_paste_dirent()
1068 /* new directory entry doesn't fall into S_new[i] */ balance_leaf_new_nodes_paste_dirent()
1070 tb->sbytes[i], tb->S_new[i]); balance_leaf_new_nodes_paste_dirent()
1111 tb->S_new[i]); balance_leaf_new_nodes_paste_shift()
1115 * append to S_new[i] balance_leaf_new_nodes_paste_shift()
1121 /* Append part of body into S_new[0] */ balance_leaf_new_nodes_paste_shift()
1122 buffer_info_init_bh(tb, &bi, tb->S_new[i]); balance_leaf_new_nodes_paste_shift()
1135 tmp = item_head(tb->S_new[i], 0); balance_leaf_new_nodes_paste_shift()
1174 tb->sbytes[i], tb->S_new[i]); balance_leaf_new_nodes_paste_whole()
1181 buffer_info_init_bh(tb, &bi, tb->S_new[i]); balance_leaf_new_nodes_paste_whole()
1186 pasted = item_head(tb->S_new[i], tb->item_pos - n + balance_leaf_new_nodes_paste_whole()
1211 /* pasted item doesn't fall into S_new[i] */ balance_leaf_new_nodes_paste()
1214 tb->snum[i], tb->sbytes[i], tb->S_new[i]); balance_leaf_new_nodes_paste()
1218 /* pasted item or part if it falls to S_new[i] */ balance_leaf_new_nodes_paste()
1225 /* item falls wholly into S_new[i] */ balance_leaf_new_nodes_paste()
1246 /* here we shift from S to S_new nodes */ balance_leaf_new_nodes()
1248 tb->S_new[i] = get_FEB(tb); balance_leaf_new_nodes()
1251 set_blkh_level(B_BLK_HEAD(tb->S_new[i]), DISK_LEAF_NODE_LEVEL); balance_leaf_new_nodes()
1260 memcpy(insert_key + i, leaf_key(tb->S_new[i], 0), KEY_SIZE); balance_leaf_new_nodes()
1261 insert_ptr[i] = tb->S_new[i]; balance_leaf_new_nodes()
1263 RFALSE(!buffer_journaled(tb->S_new[i]) balance_leaf_new_nodes()
1264 || buffer_journal_dirty(tb->S_new[i]) balance_leaf_new_nodes()
1265 || buffer_dirty(tb->S_new[i]), balance_leaf_new_nodes()
1266 "PAP-12247: S_new[%d] : (%b)", balance_leaf_new_nodes()
1267 i, tb->S_new[i]); balance_leaf_new_nodes()
H A Dibalance.c820 struct buffer_head *S_new; balance_internal() local
1045 /* S_new = free buffer from list FEB */ balance_internal()
1046 S_new = get_FEB(tb); balance_internal()
1048 set_blkh_level(B_BLK_HEAD(S_new), h + 1); balance_internal()
1051 dest_bi.bi_bh = S_new; balance_internal()
1062 /* new items don't fall into S_new */ balance_internal()
1071 /* all new items fall into S_new */ balance_internal()
1087 * into S_new balance_internal()
1090 /*S_new,tb->S[h-1]->b_next, */ balance_internal()
1100 /* some items fall into S_new, but some don't fall */ balance_internal()
1105 /* calculate number of new items that fall into S_new */ balance_internal()
1108 internal_insert_childs(&dest_bi, /*S_new, */ 0, k, balance_internal()
1115 * replace first node-ptr in S_new by node-ptr balance_internal()
1119 dc = B_N_CHILD(S_new, 0); balance_internal()
1129 do_balance_mark_internal_dirty(tb, S_new, 0); balance_internal()
1133 /* new_insert_ptr = node_pointer to S_new */ balance_internal()
1134 new_insert_ptr = S_new; balance_internal()
1136 RFALSE(!buffer_journaled(S_new) || buffer_journal_dirty(S_new) balance_internal()
1137 || buffer_dirty(S_new), "cm-00001: bad S_new (%b)", balance_internal()
1138 S_new); balance_internal()
1140 /* S_new is released in unfix_nodes */ balance_internal()
H A Dreiserfs.h2502 struct buffer_head *S_new[2]; member in struct:tree_balance
2505 * number of items that will be placed into nodes in S_new
2511 * number of bytes which flow to nodes in S_new when S[0] splits

Completed in 139 milliseconds