Lines Matching refs:S_new
764 struct buffer_head *S_new;
980 /* S_new = free buffer from list FEB */
981 S_new = get_FEB(tb);
983 set_blkh_level(B_BLK_HEAD(S_new), h + 1);
986 dest_bi.bi_bh = S_new;
997 /* new items don't fall into S_new */
1005 /* internal_move_pointers_items(S_new, tbSh, LAST_TO_FIRST, snum, 0); */
1007 /* all new items fall into S_new */
1017 /* internal_move_pointers_items(S_new,tbSh,1,snum - insert_num,0); */
1019 /* insert insert_num keys and node-pointers into S_new */
1021 /*S_new,tb->S[h-1]->b_next, */
1031 /* some items fall into S_new, but some don't fall */
1036 /* internal_move_pointers_items(S_new,tbSh,1,n - child_pos + 1,1); */
1037 /* calculate number of new items that fall into S_new */
1040 internal_insert_childs(&dest_bi, /*S_new, */ 0, k,
1046 /* replace first node-ptr in S_new by node-ptr to insert_ptr[insert_num-k-1] */
1048 dc = B_N_CHILD(S_new, 0);
1058 do_balance_mark_internal_dirty(tb, S_new, 0);
1062 /* new_insert_ptr = node_pointer to S_new */
1063 new_insert_ptr = S_new;
1065 RFALSE(!buffer_journaled(S_new) || buffer_journal_dirty(S_new)
1066 || buffer_dirty(S_new), "cm-00001: bad S_new (%b)",
1067 S_new);
1069 // S_new is released in unfix_nodes