B_NR_ITEMS 118 fs/reiserfs/dir.c RFALSE(item_num > B_NR_ITEMS(bh) - 1, B_NR_ITEMS 120 fs/reiserfs/dir.c item_num, B_NR_ITEMS(bh)); B_NR_ITEMS 235 fs/reiserfs/dir.c if (item_num != B_NR_ITEMS(bh) - 1) B_NR_ITEMS 94 fs/reiserfs/do_balan.c if (B_NR_ITEMS(tbS0)) { B_NR_ITEMS 149 fs/reiserfs/do_balan.c int n = B_NR_ITEMS(tbS0); B_NR_ITEMS 161 fs/reiserfs/do_balan.c 1 < B_NR_ITEMS(tb->FR[0])) B_NR_ITEMS 168 fs/reiserfs/do_balan.c B_NR_ITEMS(tb->R[0]), -1, B_NR_ITEMS 180 fs/reiserfs/do_balan.c B_NR_ITEMS(tb->L[0]), -1, NULL); B_NR_ITEMS 267 fs/reiserfs/do_balan.c n = B_NR_ITEMS(tbS0); B_NR_ITEMS 292 fs/reiserfs/do_balan.c int n = B_NR_ITEMS(tb->L[0]); B_NR_ITEMS 355 fs/reiserfs/do_balan.c int n = B_NR_ITEMS(tb->L[0]); B_NR_ITEMS 373 fs/reiserfs/do_balan.c pasted = item_head(tb->L[0], B_NR_ITEMS(tb->L[0]) - 1); B_NR_ITEMS 418 fs/reiserfs/do_balan.c int n = B_NR_ITEMS(tb->L[0]); B_NR_ITEMS 506 fs/reiserfs/do_balan.c B_NR_ITEMS(tb->L[0]) - 1)) || B_NR_ITEMS 537 fs/reiserfs/do_balan.c int n = B_NR_ITEMS(tb->L[0]); B_NR_ITEMS 627 fs/reiserfs/do_balan.c int n = B_NR_ITEMS(tbS0); B_NR_ITEMS 841 fs/reiserfs/do_balan.c int n = B_NR_ITEMS(tbS0); B_NR_ITEMS 885 fs/reiserfs/do_balan.c int n = B_NR_ITEMS(tbS0); B_NR_ITEMS 927 fs/reiserfs/do_balan.c int n = B_NR_ITEMS(tbS0); B_NR_ITEMS 1146 fs/reiserfs/do_balan.c int n = B_NR_ITEMS(tbS0); B_NR_ITEMS 1198 fs/reiserfs/do_balan.c int n = B_NR_ITEMS(tbS0); B_NR_ITEMS 1564 fs/reiserfs/do_balan.c RFALSE(n_dest >= B_NR_ITEMS(dest) || n_src >= B_NR_ITEMS(src), B_NR_ITEMS 1566 fs/reiserfs/do_balan.c n_src, B_NR_ITEMS(src), n_dest, B_NR_ITEMS(dest)); B_NR_ITEMS 1588 fs/reiserfs/do_balan.c return B_NR_ITEMS(tb->FL[h]); B_NR_ITEMS 1601 fs/reiserfs/do_balan.c if (Sh_position == B_NR_ITEMS(PATH_H_PPARENT(tb->tb_path, h))) B_NR_ITEMS 1626 fs/reiserfs/do_balan.c for (i = 0; i <= B_NR_ITEMS(bh); i++, dc++) { B_NR_ITEMS 72 fs/reiserfs/fix_node.c B_NR_ITEMS(Sh) + ((vn->vn_mode == M_INSERT) ? 1 : 0) - B_NR_ITEMS 156 fs/reiserfs/fix_node.c || vn->vn_affected_item_num != B_NR_ITEMS(Sh) - 1)) B_NR_ITEMS 163 fs/reiserfs/fix_node.c || vn->vn_affected_item_num != B_NR_ITEMS(Sh) - 1)) { B_NR_ITEMS 169 fs/reiserfs/fix_node.c (B_NR_ITEMS(Sh) == 1 B_NR_ITEMS 716 fs/reiserfs/fix_node.c RFALSE(B_NR_ITEMS(S0) != 1, B_NR_ITEMS 718 fs/reiserfs/fix_node.c B_NR_ITEMS(S0)); B_NR_ITEMS 927 fs/reiserfs/fix_node.c order = B_NR_ITEMS(l); B_NR_ITEMS 986 fs/reiserfs/fix_node.c tb->lkey[h] : B_NR_ITEMS(tb->FL[h]); B_NR_ITEMS 1060 fs/reiserfs/fix_node.c B_NR_ITEMS(parent)) B_NR_ITEMS 1076 fs/reiserfs/fix_node.c first_last_position = B_NR_ITEMS(parent); B_NR_ITEMS 1234 fs/reiserfs/fix_node.c if (position == B_NR_ITEMS(PATH_H_PBUFFER(path, h + 1))) { B_NR_ITEMS 1299 fs/reiserfs/fix_node.c B_NR_ITEMS(Sh) + B_NR_ITEMS 1794 fs/reiserfs/fix_node.c 0) ? B_NR_ITEMS(tb->FL[h]) : n - 1; B_NR_ITEMS 1811 fs/reiserfs/fix_node.c B_NR_ITEMS(Fh)) ? 0 : n + 1; B_NR_ITEMS 1856 fs/reiserfs/fix_node.c 0) ? B_NR_ITEMS(tb->FL[h]) : n - 1; B_NR_ITEMS 1871 fs/reiserfs/fix_node.c h)) == B_NR_ITEMS(Fh)) ? 0 : (n + 1); B_NR_ITEMS 2121 fs/reiserfs/fix_node.c path_offset - 1)) > B_NR_ITEMS(bh)) B_NR_ITEMS 2173 fs/reiserfs/fix_node.c tb->FL[h]) ? tb->lkey[h] : B_NR_ITEMS(tb-> B_NR_ITEMS 2188 fs/reiserfs/fix_node.c child_position > B_NR_ITEMS(tb->FL[h]) || B_NR_ITEMS 2210 fs/reiserfs/fix_node.c B_NR_ITEMS(bh), B_NR_ITEMS 2601 fs/reiserfs/fix_node.c if (item_num <= 0 || item_num > B_NR_ITEMS(tbS0)) B_NR_ITEMS 2605 fs/reiserfs/fix_node.c B_NR_ITEMS(tbS0)); B_NR_ITEMS 2610 fs/reiserfs/fix_node.c if (item_num < 0 || item_num >= B_NR_ITEMS(tbS0)) { B_NR_ITEMS 218 fs/reiserfs/ibalance.c RFALSE(first_p < 0 || first_p + del_num > B_NR_ITEMS(cur) + 1 B_NR_ITEMS 223 fs/reiserfs/ibalance.c B_NR_ITEMS(cur) + 1, first_i); B_NR_ITEMS 237 fs/reiserfs/ibalance.c RFALSE(first_i + del_num > B_NR_ITEMS(cur), B_NR_ITEMS 314 fs/reiserfs/ibalance.c nr_src = B_NR_ITEMS(src); B_NR_ITEMS 323 fs/reiserfs/ibalance.c RFALSE(cpy_num - 1 + B_NR_ITEMS(dest) > (int)MAX_NR_KEY(dest), B_NR_ITEMS 325 fs/reiserfs/ibalance.c cpy_num, B_NR_ITEMS(dest), MAX_NR_KEY(dest)); B_NR_ITEMS 419 fs/reiserfs/ibalance.c B_NR_ITEMS(src_bi->bi_bh)) + 1) ? 0 : j - cpy_num + B_NR_ITEMS 444 fs/reiserfs/ibalance.c RFALSE(dest_position_before > B_NR_ITEMS(dest) || B_NR_ITEMS 445 fs/reiserfs/ibalance.c src_position >= B_NR_ITEMS(src), B_NR_ITEMS 447 fs/reiserfs/ibalance.c dest_position_before, B_NR_ITEMS(dest), B_NR_ITEMS 448 fs/reiserfs/ibalance.c src_position, B_NR_ITEMS(src)); B_NR_ITEMS 510 fs/reiserfs/ibalance.c internal_insert_key(&dest_bi, B_NR_ITEMS(dest_bi.bi_bh), cf, B_NR_ITEMS 513 fs/reiserfs/ibalance.c if (B_NR_ITEMS(src_bi.bi_bh) == pointer_amount - 1) { B_NR_ITEMS 546 fs/reiserfs/ibalance.c internal_insert_key(&dest_bi, B_NR_ITEMS(dest_bi.bi_bh), cf, B_NR_ITEMS 576 fs/reiserfs/ibalance.c nr = B_NR_ITEMS(src_bi.bi_bh); B_NR_ITEMS 653 fs/reiserfs/ibalance.c n = B_NR_ITEMS(tbSh); B_NR_ITEMS 668 fs/reiserfs/ibalance.c if (!tb->L[h - 1] || !B_NR_ITEMS(tb->L[h - 1])) B_NR_ITEMS 697 fs/reiserfs/ibalance.c if (tb->L[h] && tb->lnum[h] == -B_NR_ITEMS(tb->L[h]) - 1) { B_NR_ITEMS 710 fs/reiserfs/ibalance.c if (tb->R[h] && tb->rnum[h] == -B_NR_ITEMS(tb->R[h]) - 1) { B_NR_ITEMS 766 fs/reiserfs/ibalance.c if (B_NR_ITEMS(PATH_H_PBUFFER(tb->tb_path, h)) == 0) B_NR_ITEMS 780 fs/reiserfs/ibalance.c RFALSE(B_NR_ITEMS(tb->R[h]) == 0, B_NR_ITEMS 782 fs/reiserfs/ibalance.c B_NR_ITEMS(tb->R[h])); B_NR_ITEMS 860 fs/reiserfs/ibalance.c n = B_NR_ITEMS(tb->L[h]); /* number of items in L[h] */ B_NR_ITEMS 929 fs/reiserfs/ibalance.c n = B_NR_ITEMS(tbSh); /* number of items in S[h] */ B_NR_ITEMS 1059 fs/reiserfs/ibalance.c n = B_NR_ITEMS(tbSh); /* number of items in S[h] */ B_NR_ITEMS 1143 fs/reiserfs/ibalance.c n = B_NR_ITEMS(tbSh); /*number of items in S[h] */ B_NR_ITEMS 437 fs/reiserfs/inode.c if (PATH_LAST_POSITION(&path) != (B_NR_ITEMS(bh) - 1)) B_NR_ITEMS 55 fs/reiserfs/lbalance.c LAST_TO_FIRST) ? ((B_NR_ITEMS(dest)) ? 0 : -1) : (B_NR_ITEMS(dest) B_NR_ITEMS 104 fs/reiserfs/lbalance.c LAST_TO_FIRST) ? 0 : B_NR_ITEMS(dest), B_NR_ITEMS 110 fs/reiserfs/lbalance.c FIRST_TO_LAST) ? (B_NR_ITEMS(dest) - B_NR_ITEMS 117 fs/reiserfs/lbalance.c (last_first == FIRST_TO_LAST) ? (B_NR_ITEMS(dest) - 1) : 0; B_NR_ITEMS 144 fs/reiserfs/lbalance.c dest_nr_item = B_NR_ITEMS(dest); B_NR_ITEMS 220 fs/reiserfs/lbalance.c src_nr_item = B_NR_ITEMS(src); B_NR_ITEMS 324 fs/reiserfs/lbalance.c RFALSE(B_NR_ITEMS(src) - first < cpy_num, B_NR_ITEMS 326 fs/reiserfs/lbalance.c B_NR_ITEMS(src), cpy_num, first); B_NR_ITEMS 455 fs/reiserfs/lbalance.c leaf_insert_into_buf(dest_bi, B_NR_ITEMS(dest), &n_ih, B_NR_ITEMS 531 fs/reiserfs/lbalance.c RFALSE(B_NR_ITEMS(src) < cpy_num, B_NR_ITEMS 532 fs/reiserfs/lbalance.c "vs-10230: No enough items: %d, req. %d", B_NR_ITEMS(src), B_NR_ITEMS 580 fs/reiserfs/lbalance.c src_nr_item = B_NR_ITEMS(src); B_NR_ITEMS 731 fs/reiserfs/lbalance.c FIRST_TO_LAST) ? 0 : (B_NR_ITEMS(src_bi.bi_bh) - B_NR_ITEMS 754 fs/reiserfs/lbalance.c if (B_NR_ITEMS(S0) == 0) { B_NR_ITEMS 831 fs/reiserfs/lbalance.c int item_amount = B_NR_ITEMS(bh = cur_bi->bi_bh); B_NR_ITEMS 878 fs/reiserfs/lbalance.c ih = item_head(bh, B_NR_ITEMS(bh) - 1); B_NR_ITEMS 894 fs/reiserfs/lbalance.c leaf_cut_from_buffer(cur_bi, B_NR_ITEMS(bh) - 1, B_NR_ITEMS 152 fs/reiserfs/prints.c B_LEVEL(bh), B_NR_ITEMS(bh), B_FREE_SPACE(bh)); B_NR_ITEMS 456 fs/reiserfs/prints.c to = B_NR_ITEMS(bh); B_NR_ITEMS 459 fs/reiserfs/prints.c to = last < B_NR_ITEMS(bh) ? last : B_NR_ITEMS(bh); B_NR_ITEMS 752 fs/reiserfs/prints.c if (B_NR_ITEMS(bh) > (bh->b_size - BLKH_SIZE) / IH_SIZE) B_NR_ITEMS 756 fs/reiserfs/prints.c bh->b_size - BLKH_SIZE - KEY_SIZE * B_NR_ITEMS(bh) - B_NR_ITEMS 757 fs/reiserfs/prints.c DC_SIZE * (B_NR_ITEMS(bh) + 1)) B_NR_ITEMS 770 fs/reiserfs/prints.c for (i = 0, ih = item_head(bh, 0); i < B_NR_ITEMS(bh); i++, ih++) B_NR_ITEMS 2051 fs/reiserfs/reiserfs.h ((bh)->b_data + BLKH_SIZE + B_NR_ITEMS(bh) * KEY_SIZE + DC_SIZE * (n_pos))) B_NR_ITEMS 3132 fs/reiserfs/reiserfs.h PROC_INFO_ADD( sb, items_at[ ( level ) ], B_NR_ITEMS( bh ) ) B_NR_ITEMS 240 fs/reiserfs/stree.c B_NR_ITEMS(parent)) B_NR_ITEMS 286 fs/reiserfs/stree.c B_NR_ITEMS(parent)) B_NR_ITEMS 301 fs/reiserfs/stree.c if (position != B_NR_ITEMS(parent)) B_NR_ITEMS 744 fs/reiserfs/stree.c B_NR_ITEMS(bh), B_NR_ITEMS 782 fs/reiserfs/stree.c int limit = B_NR_ITEMS(bh); B_NR_ITEMS 913 fs/reiserfs/stree.c if (PATH_LAST_POSITION(path) >= B_NR_ITEMS(bh)) B_NR_ITEMS 295 fs/reiserfs/super.c if (item_pos != B_NR_ITEMS(bh)) {