Lines Matching defs:S_new
820 struct buffer_head *S_new;
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, but some don't fall */
1105 /* calculate number of new items that fall into S_new */
1108 internal_insert_childs(&dest_bi, /*S_new, */ 0, k,
1115 * replace first node-ptr in S_new by node-ptr
1119 dc = B_N_CHILD(S_new, 0);
1129 do_balance_mark_internal_dirty(tb, S_new, 0);
1133 /* new_insert_ptr = node_pointer to S_new */
1134 new_insert_ptr = S_new;
1136 RFALSE(!buffer_journaled(S_new) || buffer_journal_dirty(S_new)
1137 || buffer_dirty(S_new), "cm-00001: bad S_new (%b)",
1138 S_new);
1140 /* S_new is released in unfix_nodes */