B_NR_ITEMS 97 fs/reiserfs/dir.c RFALSE(item_num > B_NR_ITEMS(bh) - 1,
B_NR_ITEMS 99 fs/reiserfs/dir.c item_num, B_NR_ITEMS(bh));
B_NR_ITEMS 201 fs/reiserfs/dir.c if (item_num != B_NR_ITEMS(bh) - 1)
B_NR_ITEMS 106 fs/reiserfs/do_balan.c if (B_NR_ITEMS(tbS0)) {
B_NR_ITEMS 165 fs/reiserfs/do_balan.c n = B_NR_ITEMS(tbS0);
B_NR_ITEMS 172 fs/reiserfs/do_balan.c && 1 < B_NR_ITEMS(tb->FR[0]))
B_NR_ITEMS 180 fs/reiserfs/do_balan.c B_NR_ITEMS(tb->R[0]),
B_NR_ITEMS 193 fs/reiserfs/do_balan.c B_NR_ITEMS(tb->L[0]), -1, NULL);
B_NR_ITEMS 300 fs/reiserfs/do_balan.c n = B_NR_ITEMS(tb->L[0]);
B_NR_ITEMS 419 fs/reiserfs/do_balan.c B_NR_ITEMS
B_NR_ITEMS 628 fs/reiserfs/do_balan.c B_NR_ITEMS
B_NR_ITEMS 747 fs/reiserfs/do_balan.c n = B_NR_ITEMS(tbS0);
B_NR_ITEMS 1200 fs/reiserfs/do_balan.c n = B_NR_ITEMS(tbS0);
B_NR_ITEMS 1811 fs/reiserfs/do_balan.c RFALSE(n_dest >= B_NR_ITEMS(dest) || n_src >= B_NR_ITEMS(src),
B_NR_ITEMS 1813 fs/reiserfs/do_balan.c n_src, B_NR_ITEMS(src), n_dest, B_NR_ITEMS(dest));
B_NR_ITEMS 1835 fs/reiserfs/do_balan.c return B_NR_ITEMS(tb->FL[h]);
B_NR_ITEMS 1848 fs/reiserfs/do_balan.c if (Sh_position == B_NR_ITEMS(PATH_H_PPARENT(tb->tb_path, h)))
B_NR_ITEMS 1873 fs/reiserfs/do_balan.c for (i = 0; i <= B_NR_ITEMS(bh); i++, dc++) {
B_NR_ITEMS 98 fs/reiserfs/fix_node.c B_NR_ITEMS(Sh) + ((vn->vn_mode == M_INSERT) ? 1 : 0) -
B_NR_ITEMS 174 fs/reiserfs/fix_node.c || vn->vn_affected_item_num != B_NR_ITEMS(Sh) - 1))
B_NR_ITEMS 181 fs/reiserfs/fix_node.c || vn->vn_affected_item_num != B_NR_ITEMS(Sh) - 1)) {
B_NR_ITEMS 184 fs/reiserfs/fix_node.c (B_NR_ITEMS(Sh) == 1
B_NR_ITEMS 676 fs/reiserfs/fix_node.c RFALSE(B_NR_ITEMS(S0) != 1,
B_NR_ITEMS 678 fs/reiserfs/fix_node.c B_NR_ITEMS(S0));
B_NR_ITEMS 867 fs/reiserfs/fix_node.c order = B_NR_ITEMS(l);
B_NR_ITEMS 921 fs/reiserfs/fix_node.c p_s_tb->lkey[n_h] : B_NR_ITEMS(p_s_tb->FL[n_h]);
B_NR_ITEMS 986 fs/reiserfs/fix_node.c B_NR_ITEMS(p_s_parent))
B_NR_ITEMS 994 fs/reiserfs/fix_node.c n_first_last_position = B_NR_ITEMS(p_s_parent);
B_NR_ITEMS 1130 fs/reiserfs/fix_node.c if (n_position == B_NR_ITEMS(PATH_H_PBUFFER(p_s_path, n_h + 1))) {
B_NR_ITEMS 1188 fs/reiserfs/fix_node.c B_NR_ITEMS(Sh) +
B_NR_ITEMS 1611 fs/reiserfs/fix_node.c 0) ? B_NR_ITEMS(tb->FL[h]) : n - 1;
B_NR_ITEMS 1628 fs/reiserfs/fix_node.c B_NR_ITEMS(Fh)) ? 0 : n + 1;
B_NR_ITEMS 1667 fs/reiserfs/fix_node.c 0) ? B_NR_ITEMS(tb->FL[h]) : n - 1;
B_NR_ITEMS 1682 fs/reiserfs/fix_node.c h)) == B_NR_ITEMS(Fh)) ? 0 : (n + 1);
B_NR_ITEMS 1916 fs/reiserfs/fix_node.c n_path_offset - 1)) > B_NR_ITEMS(p_s_bh))
B_NR_ITEMS 1960 fs/reiserfs/fix_node.c p_s_tb->FL[n_h]) ? p_s_tb->lkey[n_h] : B_NR_ITEMS(p_s_tb->
B_NR_ITEMS 1973 fs/reiserfs/fix_node.c n_child_position > B_NR_ITEMS(p_s_tb->FL[n_h]) ||
B_NR_ITEMS 1994 fs/reiserfs/fix_node.c B_NR_ITEMS(p_s_bh),
B_NR_ITEMS 2375 fs/reiserfs/fix_node.c if (n_item_num <= 0 || n_item_num > B_NR_ITEMS(p_s_tbS0))
B_NR_ITEMS 2378 fs/reiserfs/fix_node.c n_item_num, B_NR_ITEMS(p_s_tbS0));
B_NR_ITEMS 2383 fs/reiserfs/fix_node.c if (n_item_num < 0 || n_item_num >= B_NR_ITEMS(p_s_tbS0)) {
B_NR_ITEMS 208 fs/reiserfs/ibalance.c RFALSE(first_p < 0 || first_p + del_num > B_NR_ITEMS(cur) + 1
B_NR_ITEMS 213 fs/reiserfs/ibalance.c B_NR_ITEMS(cur) + 1, first_i);
B_NR_ITEMS 227 fs/reiserfs/ibalance.c RFALSE(first_i + del_num > B_NR_ITEMS(cur),
B_NR_ITEMS 296 fs/reiserfs/ibalance.c nr_src = B_NR_ITEMS(src);
B_NR_ITEMS 305 fs/reiserfs/ibalance.c RFALSE(cpy_num - 1 + B_NR_ITEMS(dest) > (int)MAX_NR_KEY(dest),
B_NR_ITEMS 307 fs/reiserfs/ibalance.c cpy_num, B_NR_ITEMS(dest), MAX_NR_KEY(dest));
B_NR_ITEMS 397 fs/reiserfs/ibalance.c B_NR_ITEMS(src_bi->bi_bh)) + 1) ? 0 : j - cpy_num +
B_NR_ITEMS 420 fs/reiserfs/ibalance.c RFALSE(dest_position_before > B_NR_ITEMS(dest) ||
B_NR_ITEMS 421 fs/reiserfs/ibalance.c src_position >= B_NR_ITEMS(src),
B_NR_ITEMS 423 fs/reiserfs/ibalance.c dest_position_before, B_NR_ITEMS(dest),
B_NR_ITEMS 424 fs/reiserfs/ibalance.c src_position, B_NR_ITEMS(src));
B_NR_ITEMS 477 fs/reiserfs/ibalance.c internal_insert_key(&dest_bi, B_NR_ITEMS(dest_bi.bi_bh), cf,
B_NR_ITEMS 480 fs/reiserfs/ibalance.c if (B_NR_ITEMS(src_bi.bi_bh) == pointer_amount - 1) {
B_NR_ITEMS 511 fs/reiserfs/ibalance.c internal_insert_key(&dest_bi, B_NR_ITEMS(dest_bi.bi_bh), cf,
B_NR_ITEMS 538 fs/reiserfs/ibalance.c nr = B_NR_ITEMS(src_bi.bi_bh);
B_NR_ITEMS 610 fs/reiserfs/ibalance.c n = B_NR_ITEMS(tbSh);
B_NR_ITEMS 625 fs/reiserfs/ibalance.c if (!tb->L[h - 1] || !B_NR_ITEMS(tb->L[h - 1]))
B_NR_ITEMS 651 fs/reiserfs/ibalance.c if (tb->L[h] && tb->lnum[h] == -B_NR_ITEMS(tb->L[h]) - 1) { /* join S[h] with L[h] */
B_NR_ITEMS 663 fs/reiserfs/ibalance.c if (tb->R[h] && tb->rnum[h] == -B_NR_ITEMS(tb->R[h]) - 1) { /* join S[h] with R[h] */
B_NR_ITEMS 717 fs/reiserfs/ibalance.c if (B_NR_ITEMS(PATH_H_PBUFFER(tb->tb_path, h)) == 0)
B_NR_ITEMS 731 fs/reiserfs/ibalance.c RFALSE(B_NR_ITEMS(tb->R[h]) == 0,
B_NR_ITEMS 733 fs/reiserfs/ibalance.c B_NR_ITEMS(tb->R[h]));
B_NR_ITEMS 800 fs/reiserfs/ibalance.c n = B_NR_ITEMS(tb->L[h]); /* number of items in L[h] */
B_NR_ITEMS 864 fs/reiserfs/ibalance.c n = B_NR_ITEMS(tbSh); /* number of items in S[h] */
B_NR_ITEMS 994 fs/reiserfs/ibalance.c n = B_NR_ITEMS(tbSh); /* number of items in S[h] */
B_NR_ITEMS 1072 fs/reiserfs/ibalance.c n = B_NR_ITEMS(tbSh); /*number of items in S[h] */
B_NR_ITEMS 386 fs/reiserfs/inode.c if (PATH_LAST_POSITION(&path) != (B_NR_ITEMS(bh) - 1))
B_NR_ITEMS 59 fs/reiserfs/lbalance.c LAST_TO_FIRST) ? ((B_NR_ITEMS(dest)) ? 0 : -1) : (B_NR_ITEMS(dest)
B_NR_ITEMS 99 fs/reiserfs/lbalance.c LAST_TO_FIRST) ? 0 : B_NR_ITEMS(dest),
B_NR_ITEMS 105 fs/reiserfs/lbalance.c FIRST_TO_LAST) ? (B_NR_ITEMS(dest) -
B_NR_ITEMS 112 fs/reiserfs/lbalance.c (last_first == FIRST_TO_LAST) ? (B_NR_ITEMS(dest) - 1) : 0;
B_NR_ITEMS 135 fs/reiserfs/lbalance.c dest_nr_item = B_NR_ITEMS(dest);
B_NR_ITEMS 200 fs/reiserfs/lbalance.c src_nr_item = B_NR_ITEMS(src);
B_NR_ITEMS 296 fs/reiserfs/lbalance.c RFALSE(B_NR_ITEMS(src) - first < cpy_num,
B_NR_ITEMS 298 fs/reiserfs/lbalance.c B_NR_ITEMS(src), cpy_num, first);
B_NR_ITEMS 415 fs/reiserfs/lbalance.c leaf_insert_into_buf(dest_bi, B_NR_ITEMS(dest), &n_ih,
B_NR_ITEMS 482 fs/reiserfs/lbalance.c RFALSE(B_NR_ITEMS(src) < cpy_num,
B_NR_ITEMS 483 fs/reiserfs/lbalance.c "vs-10230: No enough items: %d, req. %d", B_NR_ITEMS(src),
B_NR_ITEMS 519 fs/reiserfs/lbalance.c src_nr_item = B_NR_ITEMS(src);
B_NR_ITEMS 652 fs/reiserfs/lbalance.c FIRST_TO_LAST) ? 0 : (B_NR_ITEMS(src_bi.bi_bh) -
B_NR_ITEMS 669 fs/reiserfs/lbalance.c if (B_NR_ITEMS(S0) == 0) { /* number of items in S[0] == 0 */
B_NR_ITEMS 737 fs/reiserfs/lbalance.c int item_amount = B_NR_ITEMS(bh = cur_bi->bi_bh);
B_NR_ITEMS 778 fs/reiserfs/lbalance.c (ih = B_N_PITEM_HEAD(bh, B_NR_ITEMS(bh) - 1)))
B_NR_ITEMS 789 fs/reiserfs/lbalance.c leaf_cut_from_buffer(cur_bi, B_NR_ITEMS(bh) - 1,
B_NR_ITEMS 137 fs/reiserfs/prints.c B_LEVEL(bh), B_NR_ITEMS(bh), B_FREE_SPACE(bh));
B_NR_ITEMS 402 fs/reiserfs/prints.c to = B_NR_ITEMS(bh);
B_NR_ITEMS 405 fs/reiserfs/prints.c to = last < B_NR_ITEMS(bh) ? last : B_NR_ITEMS(bh);
B_NR_ITEMS 704 fs/reiserfs/prints.c if (B_NR_ITEMS(bh) > (bh->b_size - BLKH_SIZE) / IH_SIZE)
B_NR_ITEMS 710 fs/reiserfs/prints.c bh->b_size - BLKH_SIZE - KEY_SIZE * B_NR_ITEMS(bh) -
B_NR_ITEMS 711 fs/reiserfs/prints.c DC_SIZE * (B_NR_ITEMS(bh) + 1))
B_NR_ITEMS 726 fs/reiserfs/prints.c for (i = 0, ih = B_N_PITEM_HEAD(bh, 0); i < B_NR_ITEMS(bh); i++, ih++)
B_NR_ITEMS 273 fs/reiserfs/stree.c B_NR_ITEMS(p_s_parent))
B_NR_ITEMS 316 fs/reiserfs/stree.c B_NR_ITEMS(p_s_parent))
B_NR_ITEMS 324 fs/reiserfs/stree.c if (n_position != B_NR_ITEMS(p_s_parent))
B_NR_ITEMS 741 fs/reiserfs/stree.c B_NR_ITEMS(p_s_bh),
B_NR_ITEMS 769 fs/reiserfs/stree.c int limit = B_NR_ITEMS(p_s_bh);
B_NR_ITEMS 896 fs/reiserfs/stree.c if (PATH_LAST_POSITION(p_s_path) >= B_NR_ITEMS(p_s_bh))
B_NR_ITEMS 204 fs/reiserfs/super.c if (item_pos != B_NR_ITEMS(bh)) {
B_NR_ITEMS 1116 include/linux/reiserfs_fs.h ((p_s_bh)->b_data+BLKH_SIZE+B_NR_ITEMS(p_s_bh)*KEY_SIZE+DC_SIZE*(n_pos)))
B_NR_ITEMS 1951 include/linux/reiserfs_fs.h PROC_INFO_ADD( sb, items_at[ ( level ) ], B_NR_ITEMS( bh ) )