Home
last modified time | relevance | path

Searched refs:snum (Results 1 – 3 of 3) sorted by relevance

/fs/reiserfs/
Ddo_balan.c287 int snum[2]; /* number of items that will be placed in balance_leaf() local
1158 snum[0] = tb->s1num, snum[1] = tb->s2num; in balance_leaf()
1163 RFALSE(!snum[i], "PAP-12200: snum[%d] == %d. Must be > 0", i, in balance_leaf()
1164 snum[i]); in balance_leaf()
1178 if (n - snum[i] < item_pos) { /* new item or it's part falls to first new node S_new[i] */ in balance_leaf()
1179 if (item_pos == n - snum[i] + 1 && sbytes[i] != -1) { /* part of new item falls into S_new[i] */ in balance_leaf()
1187 snum[i] - 1, -1, in balance_leaf()
1236 snum[i] - 1, sbytes[i], in balance_leaf()
1243 snum[i] - 1, ih, in balance_leaf()
1253 snum[i], sbytes[i], S_new[i]); in balance_leaf()
[all …]
Dibalance.c977 int snum; in balance_internal() local
995 snum = (insert_num + n + 1) / 2; in balance_internal()
996 if (n - snum >= child_pos) { in balance_internal()
1000 memcpy(&new_insert_key, B_N_PDELIM_KEY(tbSh, n - snum), in balance_internal()
1004 LAST_TO_FIRST, snum, 0); in balance_internal()
1006 } else if (n + insert_num - snum < child_pos) { in balance_internal()
1011 B_N_PDELIM_KEY(tbSh, n + insert_num - snum), in balance_internal()
1016 snum - insert_num, 0); in balance_internal()
1023 snum - 1, in balance_internal()
1038 k = snum - n + child_pos - 1; in balance_internal()
/fs/udf/
Dmisc.c279 void udf_new_tag(char *data, uint16_t ident, uint16_t version, uint16_t snum, in udf_new_tag() argument
285 tptr->tagSerialNum = cpu_to_le16(snum); in udf_new_tag()