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