Sh 56 fs/reiserfs/fix_node.c struct buffer_head *Sh; /* this comes from tb->S[h] */ Sh 58 fs/reiserfs/fix_node.c Sh = PATH_H_PBUFFER(tb->tb_path, h); Sh 62 fs/reiserfs/fix_node.c MAX_CHILD_SIZE(Sh) - B_FREE_SPACE(Sh) + tb->insert_size[h]; Sh 72 fs/reiserfs/fix_node.c B_NR_ITEMS(Sh) + ((vn->vn_mode == M_INSERT) ? 1 : 0) - Sh 81 fs/reiserfs/fix_node.c ih = item_head(Sh, 0); Sh 84 fs/reiserfs/fix_node.c if (op_is_left_mergeable(&ih->ih_key, Sh->b_size) Sh 107 fs/reiserfs/fix_node.c vi->vi_item = ih_item_body(Sh, ih + j); Sh 154 fs/reiserfs/fix_node.c if (op_is_left_mergeable(key, Sh->b_size) Sh 156 fs/reiserfs/fix_node.c || vn->vn_affected_item_num != B_NR_ITEMS(Sh) - 1)) Sh 161 fs/reiserfs/fix_node.c if (op_is_left_mergeable(key, Sh->b_size) && Sh 163 fs/reiserfs/fix_node.c || vn->vn_affected_item_num != B_NR_ITEMS(Sh) - 1)) { Sh 169 fs/reiserfs/fix_node.c (B_NR_ITEMS(Sh) == 1 Sh 170 fs/reiserfs/fix_node.c && is_direntry_le_ih(item_head(Sh, 0)) Sh 171 fs/reiserfs/fix_node.c && ih_entry_count(item_head(Sh, 0)) == 1)) { Sh 177 fs/reiserfs/fix_node.c print_block(Sh, 0, -1, -1); Sh 763 fs/reiserfs/fix_node.c to_l = (MAX_NR_KEY(Sh)+1 - lpar + vn->vn_nr_item + 1) / 2 -\ Sh 764 fs/reiserfs/fix_node.c (MAX_NR_KEY(Sh) + 1 - lpar);\ Sh 783 fs/reiserfs/fix_node.c to_r = (MAX_NR_KEY(Sh)+1 - rpar + vn->vn_nr_item + 1) / 2 - (MAX_NR_KEY(Sh) + 1 - rpar);\ Sh 829 fs/reiserfs/fix_node.c struct buffer_head *new_bh, *Sh = PATH_H_PBUFFER(tb->tb_path, h); Sh 865 fs/reiserfs/fix_node.c amount_needed = (Sh) ? (tb->blknum[h] - 1) : 1; Sh 1276 fs/reiserfs/fix_node.c struct buffer_head *Sh = PATH_H_PBUFFER(tb->tb_path, h); Sh 1281 fs/reiserfs/fix_node.c ih = item_head(Sh, 0); Sh 1285 fs/reiserfs/fix_node.c if (lfree + rfree + sfree < MAX_CHILD_SIZE(Sh) + levbytes Sh 1289 fs/reiserfs/fix_node.c && op_is_left_mergeable(&ih->ih_key, Sh->b_size)) ? IH_SIZE : 0) Sh 1292 fs/reiserfs/fix_node.c && op_is_left_mergeable(r_key, Sh->b_size)) ? IH_SIZE : 0) Sh 1299 fs/reiserfs/fix_node.c B_NR_ITEMS(Sh) + Sh 1371 fs/reiserfs/fix_node.c struct buffer_head *Sh; Sh 1373 fs/reiserfs/fix_node.c Sh = PATH_H_PBUFFER(tb->tb_path, h); Sh 1377 fs/reiserfs/fix_node.c if (!Sh) { Sh 1401 fs/reiserfs/fix_node.c sfree = B_FREE_SPACE(Sh); Sh 1446 fs/reiserfs/fix_node.c ((MAX_NR_KEY(Sh) << 1) + 2 - tb->lnum[h] - tb->rnum[h] + Sh 1447 fs/reiserfs/fix_node.c vn->vn_nr_item + 1) / 2 - (MAX_NR_KEY(Sh) + 1 - Sh 1734 fs/reiserfs/fix_node.c struct buffer_head *Sh, *Fh; Sh 1738 fs/reiserfs/fix_node.c Sh = PATH_H_PBUFFER(tb->tb_path, h); Sh 1779 fs/reiserfs/fix_node.c if (vn->vn_nr_item >= MIN_NR_KEY(Sh)) { Sh 1784 fs/reiserfs/fix_node.c if (vn->vn_nr_item == MIN_NR_KEY(Sh)) { Sh 1828 fs/reiserfs/fix_node.c ((MAX_NR_KEY(Sh) << 1) + 2 - tb->lnum[h] - Sh 1830 fs/reiserfs/fix_node.c (MAX_NR_KEY(Sh) + 1 - tb->rnum[h]); Sh 1883 fs/reiserfs/fix_node.c ((MAX_NR_KEY(Sh) << 1) + 2 - tb->lnum[h] - tb->rnum[h] + Sh 1884 fs/reiserfs/fix_node.c vn->vn_nr_item + 1) / 2 - (MAX_NR_KEY(Sh) + 1 - Sh 1899 fs/reiserfs/fix_node.c (MAX_NR_KEY(Sh) + 1 - tb->lnum[h] + vn->vn_nr_item + Sh 1906 fs/reiserfs/fix_node.c -((MAX_NR_KEY(Sh) + 1 - tb->rnum[h] + vn->vn_nr_item +