Lines Matching refs:h
51 static void create_virtual_node(struct tree_balance *tb, int h) in create_virtual_node() argument
58 Sh = PATH_H_PBUFFER(tb->tb_path, h); in create_virtual_node()
62 MAX_CHILD_SIZE(Sh) - B_FREE_SPACE(Sh) + tb->insert_size[h]; in create_virtual_node()
65 if (h) { in create_virtual_node()
194 static void check_left(struct tree_balance *tb, int h, int cur_free) in check_left() argument
204 if (h > 0) { in check_left()
205 tb->lnum[h] = cur_free / (DC_SIZE + KEY_SIZE); in check_left()
213 tb->lnum[h] = 0; in check_left()
280 static void check_right(struct tree_balance *tb, int h, int cur_free) in check_right() argument
290 if (h > 0) { in check_right()
291 tb->rnum[h] = cur_free / (DC_SIZE + KEY_SIZE); in check_right()
299 tb->rnum[h] = 0; in check_right()
316 tb->rnum[h] = vn->vn_nr_item; in check_right()
374 static int get_num_ver(int mode, struct tree_balance *tb, int h, in get_num_ver() argument
418 RFALSE(tb->insert_size[h] < 0 || (mode != M_INSERT && mode != M_PASTE), in get_num_ver()
421 max_node_size = MAX_CHILD_SIZE(PATH_H_PBUFFER(tb->tb_path, h)); in get_num_ver()
431 if (h > 0) { in get_num_ver()
623 static void set_parameters(struct tree_balance *tb, int h, int lnum, in set_parameters() argument
627 tb->lnum[h] = lnum; in set_parameters()
628 tb->rnum[h] = rnum; in set_parameters()
629 tb->blknum[h] = blk_num; in set_parameters()
632 if (h == 0) { in set_parameters()
643 PROC_INFO_ADD(tb->tb_sb, lnum[h], lnum); in set_parameters()
644 PROC_INFO_ADD(tb->tb_sb, rnum[h], rnum); in set_parameters()
646 PROC_INFO_ADD(tb->tb_sb, lbytes[h], lb); in set_parameters()
647 PROC_INFO_ADD(tb->tb_sb, rbytes[h], rb); in set_parameters()
761 if (h)\
768 set_parameters (tb, h, to_l, 0, lnver, NULL, -1, -1);\
773 set_parameters (tb, h, lpar, 0, lnver, snum012+lset,\
776 set_parameters (tb, h, lpar - (tb->lbytes!=-1), 0, lnver, snum012+lset,\
781 if (h)\
787 set_parameters (tb, h, 0, to_r, rnver, NULL, -1, -1);\
792 set_parameters (tb, h, 0, rpar, rnver, snum012+rset,\
795 set_parameters (tb, h, 0, rpar - (tb->rbytes!=-1), rnver, snum012+rset,\
829 static int get_empty_nodes(struct tree_balance *tb, int h) in get_empty_nodes() argument
831 struct buffer_head *new_bh, *Sh = PATH_H_PBUFFER(tb->tb_path, h); in get_empty_nodes()
860 counter < h; counter++) in get_empty_nodes()
867 amount_needed = (Sh) ? (tb->blknum[h] - 1) : 1; in get_empty_nodes()
917 static int get_lfree(struct tree_balance *tb, int h) in get_lfree() argument
922 if ((f = PATH_H_PPARENT(tb->tb_path, h)) == NULL || in get_lfree()
923 (l = tb->FL[h]) == NULL) in get_lfree()
927 order = PATH_H_B_ITEM_ORDER(tb->tb_path, h) - 1; in get_lfree()
940 static int get_rfree(struct tree_balance *tb, int h) in get_rfree() argument
945 if ((f = PATH_H_PPARENT(tb->tb_path, h)) == NULL || in get_rfree()
946 (r = tb->FR[h]) == NULL) in get_rfree()
950 order = PATH_H_B_ITEM_ORDER(tb->tb_path, h) + 1; in get_rfree()
961 static int is_left_neighbor_in_cache(struct tree_balance *tb, int h) in is_left_neighbor_in_cache() argument
969 if (!tb->FL[h]) in is_left_neighbor_in_cache()
973 father = PATH_H_PBUFFER(tb->tb_path, h + 1); in is_left_neighbor_in_cache()
977 !B_IS_IN_TREE(tb->FL[h]) || in is_left_neighbor_in_cache()
979 !buffer_uptodate(tb->FL[h]), in is_left_neighbor_in_cache()
981 father, tb->FL[h]); in is_left_neighbor_in_cache()
987 left_neighbor_position = (father == tb->FL[h]) ? in is_left_neighbor_in_cache()
988 tb->lkey[h] : B_NR_ITEMS(tb->FL[h]); in is_left_neighbor_in_cache()
991 B_N_CHILD_NUM(tb->FL[h], left_neighbor_position); in is_left_neighbor_in_cache()
1026 int h, in get_far_parent() argument
1037 path_offset = PATH_H_PATH_OFFSET(path, h); in get_far_parent()
1131 LEFT_PARENTS) ? (tb->lkey[h - 1] = in get_far_parent()
1133 1) : (tb->rkey[h - in get_far_parent()
1142 h + 1) == IO_ERROR) in get_far_parent()
1154 RFALSE(B_LEVEL(*pfather) != h + 1, in get_far_parent()
1174 static int get_parents(struct tree_balance *tb, int h) in get_parents() argument
1179 path_offset = PATH_H_PATH_OFFSET(tb->tb_path, h); in get_parents()
1189 brelse(tb->FL[h]); in get_parents()
1190 brelse(tb->CFL[h]); in get_parents()
1191 brelse(tb->FR[h]); in get_parents()
1192 brelse(tb->CFR[h]); in get_parents()
1193 tb->FL[h] = NULL; in get_parents()
1194 tb->CFL[h] = NULL; in get_parents()
1195 tb->FR[h] = NULL; in get_parents()
1196 tb->CFR[h] = NULL; in get_parents()
1208 tb->lkey[h] = position - 1; in get_parents()
1218 if ((ret = get_far_parent(tb, h + 1, &curf, in get_parents()
1224 brelse(tb->FL[h]); in get_parents()
1225 tb->FL[h] = curf; /* New initialization of FL[h]. */ in get_parents()
1226 brelse(tb->CFL[h]); in get_parents()
1227 tb->CFL[h] = curcf; /* New initialization of CFL[h]. */ in get_parents()
1236 if (position == B_NR_ITEMS(PATH_H_PBUFFER(path, h + 1))) { in get_parents()
1244 get_far_parent(tb, h + 1, &curf, &curcf, in get_parents()
1253 tb->rkey[h] = position; in get_parents()
1256 brelse(tb->FR[h]); in get_parents()
1258 tb->FR[h] = curf; in get_parents()
1260 brelse(tb->CFR[h]); in get_parents()
1262 tb->CFR[h] = curcf; in get_parents()
1276 struct tree_balance *tb, int h) in can_node_be_removed() argument
1278 struct buffer_head *Sh = PATH_H_PBUFFER(tb->tb_path, h); in can_node_be_removed()
1279 int levbytes = tb->insert_size[h]; in can_node_be_removed()
1284 if (tb->CFR[h]) in can_node_be_removed()
1285 r_key = internal_key(tb->CFR[h], tb->rkey[h]); in can_node_be_removed()
1290 ((!h in can_node_be_removed()
1293 ((!h && r_key in can_node_be_removed()
1295 + ((h) ? KEY_SIZE : 0)) { in can_node_be_removed()
1299 if (!h) in can_node_be_removed()
1303 set_parameters(tb, h, 0, 0, 1, NULL, -1, -1); in can_node_be_removed()
1307 PROC_INFO_INC(tb->tb_sb, can_node_be_removed[h]); in can_node_be_removed()
1326 static int ip_check_balance(struct tree_balance *tb, int h) in ip_check_balance() argument
1375 Sh = PATH_H_PBUFFER(tb->tb_path, h); in ip_check_balance()
1376 levbytes = tb->insert_size[h]; in ip_check_balance()
1380 if (!h) in ip_check_balance()
1383 switch (ret = get_empty_nodes(tb, h)) { in ip_check_balance()
1386 set_parameters(tb, h, 0, 0, 1, NULL, -1, -1); in ip_check_balance()
1399 ret = get_parents(tb, h); in ip_check_balance()
1406 rfree = get_rfree(tb, h); in ip_check_balance()
1407 lfree = get_lfree(tb, h); in ip_check_balance()
1410 if (can_node_be_removed(vn->vn_mode, lfree, sfree, rfree, tb, h) == in ip_check_balance()
1414 create_virtual_node(tb, h); in ip_check_balance()
1422 check_left(tb, h, lfree); in ip_check_balance()
1430 check_right(tb, h, rfree); in ip_check_balance()
1436 if (h && (tb->rnum[h] + tb->lnum[h] >= vn->vn_nr_item + 1)) { in ip_check_balance()
1448 ((MAX_NR_KEY(Sh) << 1) + 2 - tb->lnum[h] - tb->rnum[h] + in ip_check_balance()
1450 tb->rnum[h]); in ip_check_balance()
1451 set_parameters(tb, h, vn->vn_nr_item + 1 - to_r, to_r, 0, NULL, in ip_check_balance()
1460 RFALSE(h && in ip_check_balance()
1461 (tb->lnum[h] >= vn->vn_nr_item + 1 || in ip_check_balance()
1462 tb->rnum[h] >= vn->vn_nr_item + 1), in ip_check_balance()
1464 RFALSE(!h && ((tb->lnum[h] >= vn->vn_nr_item && (tb->lbytes == -1)) || in ip_check_balance()
1465 (tb->rnum[h] >= vn->vn_nr_item && (tb->rbytes == -1))), in ip_check_balance()
1472 if (!h && is_leaf_removable(tb)) in ip_check_balance()
1484 if (!h) in ip_check_balance()
1486 set_parameters(tb, h, 0, 0, 1, NULL, -1, -1); in ip_check_balance()
1514 lpar = tb->lnum[h]; in ip_check_balance()
1515 rpar = tb->rnum[h]; in ip_check_balance()
1525 nver = get_num_ver(vn->vn_mode, tb, h, in ip_check_balance()
1526 0, -1, h ? vn->vn_nr_item : 0, -1, in ip_check_balance()
1529 if (!h) { in ip_check_balance()
1536 nver1 = get_num_ver(vn->vn_mode, tb, h, in ip_check_balance()
1552 lnver = get_num_ver(vn->vn_mode, tb, h, in ip_check_balance()
1553 lpar - ((h || tb->lbytes == -1) ? 0 : 1), in ip_check_balance()
1554 -1, h ? vn->vn_nr_item : 0, -1, in ip_check_balance()
1556 if (!h) { in ip_check_balance()
1559 lnver1 = get_num_ver(vn->vn_mode, tb, h, in ip_check_balance()
1577 rnver = get_num_ver(vn->vn_mode, tb, h, in ip_check_balance()
1579 h ? (vn->vn_nr_item - rpar) : (rpar - in ip_check_balance()
1585 if (!h) { in ip_check_balance()
1588 rnver1 = get_num_ver(vn->vn_mode, tb, h, in ip_check_balance()
1607 lrnver = get_num_ver(vn->vn_mode, tb, h, in ip_check_balance()
1608 lpar - ((h || tb->lbytes == -1) ? 0 : 1), in ip_check_balance()
1610 h ? (vn->vn_nr_item - rpar) : (rpar - in ip_check_balance()
1616 if (!h) { in ip_check_balance()
1619 lrnver1 = get_num_ver(vn->vn_mode, tb, h, in ip_check_balance()
1640 RFALSE(h && in ip_check_balance()
1641 (tb->lnum[h] != 1 || in ip_check_balance()
1642 tb->rnum[h] != 1 || in ip_check_balance()
1644 || h != 1), "vs-8230: bad h"); in ip_check_balance()
1646 set_parameters(tb, h, tb->lnum[h], tb->rnum[h], in ip_check_balance()
1650 set_parameters(tb, h, in ip_check_balance()
1651 tb->lnum[h] - in ip_check_balance()
1653 tb->rnum[h] - in ip_check_balance()
1665 set_parameters(tb, h, 0, 0, nver, snum012 + nset, -1, in ip_check_balance()
1697 if (is_left_neighbor_in_cache(tb, h)) { in ip_check_balance()
1728 static int dc_check_balance_internal(struct tree_balance *tb, int h) in dc_check_balance_internal() argument
1740 Sh = PATH_H_PBUFFER(tb->tb_path, h); in dc_check_balance_internal()
1741 Fh = PATH_H_PPARENT(tb->tb_path, h); in dc_check_balance_internal()
1751 create_virtual_node(tb, h); in dc_check_balance_internal()
1756 set_parameters(tb, h, 0, 0, 1, NULL, -1, -1); in dc_check_balance_internal()
1764 set_parameters(tb, h, 0, 0, 0, NULL, -1, -1); in dc_check_balance_internal()
1768 if ((ret = get_parents(tb, h)) != CARRY_ON) in dc_check_balance_internal()
1772 rfree = get_rfree(tb, h); in dc_check_balance_internal()
1773 lfree = get_lfree(tb, h); in dc_check_balance_internal()
1776 check_left(tb, h, lfree); in dc_check_balance_internal()
1777 check_right(tb, h, rfree); in dc_check_balance_internal()
1790 if (tb->lnum[h] >= vn->vn_nr_item + 1) { in dc_check_balance_internal()
1797 h)) == in dc_check_balance_internal()
1798 0) ? B_NR_ITEMS(tb->FL[h]) : n - 1; in dc_check_balance_internal()
1799 n = dc_size(B_N_CHILD(tb->FL[h], order_L)) / in dc_check_balance_internal()
1801 set_parameters(tb, h, -n - 1, 0, 0, NULL, -1, in dc_check_balance_internal()
1807 if (tb->rnum[h] >= vn->vn_nr_item + 1) { in dc_check_balance_internal()
1814 h)) == in dc_check_balance_internal()
1816 n = dc_size(B_N_CHILD(tb->FR[h], order_R)) / in dc_check_balance_internal()
1818 set_parameters(tb, h, 0, -n - 1, 0, NULL, -1, in dc_check_balance_internal()
1828 if (tb->rnum[h] + tb->lnum[h] >= vn->vn_nr_item + 1) { in dc_check_balance_internal()
1832 ((MAX_NR_KEY(Sh) << 1) + 2 - tb->lnum[h] - in dc_check_balance_internal()
1833 tb->rnum[h] + vn->vn_nr_item + 1) / 2 - in dc_check_balance_internal()
1834 (MAX_NR_KEY(Sh) + 1 - tb->rnum[h]); in dc_check_balance_internal()
1835 set_parameters(tb, h, vn->vn_nr_item + 1 - to_r, to_r, in dc_check_balance_internal()
1841 set_parameters(tb, h, 0, 0, 1, NULL, -1, -1); in dc_check_balance_internal()
1850 if (tb->lnum[h] >= vn->vn_nr_item + 1) in dc_check_balance_internal()
1851 if (is_left_neighbor_in_cache(tb, h) in dc_check_balance_internal()
1852 || tb->rnum[h] < vn->vn_nr_item + 1 || !tb->FR[h]) { in dc_check_balance_internal()
1859 h)) == in dc_check_balance_internal()
1860 0) ? B_NR_ITEMS(tb->FL[h]) : n - 1; in dc_check_balance_internal()
1861 n = dc_size(B_N_CHILD(tb->FL[h], order_L)) / (DC_SIZE + in dc_check_balance_internal()
1863 set_parameters(tb, h, -n - 1, 0, 0, NULL, -1, -1); in dc_check_balance_internal()
1868 if (tb->rnum[h] >= vn->vn_nr_item + 1) { in dc_check_balance_internal()
1875 h)) == B_NR_ITEMS(Fh)) ? 0 : (n + 1); in dc_check_balance_internal()
1876 n = dc_size(B_N_CHILD(tb->FR[h], order_R)) / (DC_SIZE + in dc_check_balance_internal()
1878 set_parameters(tb, h, 0, -n - 1, 0, NULL, -1, -1); in dc_check_balance_internal()
1883 if (tb->rnum[h] + tb->lnum[h] >= vn->vn_nr_item + 1) { in dc_check_balance_internal()
1887 ((MAX_NR_KEY(Sh) << 1) + 2 - tb->lnum[h] - tb->rnum[h] + in dc_check_balance_internal()
1889 tb->rnum[h]); in dc_check_balance_internal()
1890 set_parameters(tb, h, vn->vn_nr_item + 1 - to_r, to_r, 0, NULL, in dc_check_balance_internal()
1896 RFALSE(!tb->FL[h] && !tb->FR[h], "vs-8235: trying to borrow for root"); in dc_check_balance_internal()
1899 if (is_left_neighbor_in_cache(tb, h) || !tb->FR[h]) { in dc_check_balance_internal()
1903 (MAX_NR_KEY(Sh) + 1 - tb->lnum[h] + vn->vn_nr_item + in dc_check_balance_internal()
1905 set_parameters(tb, h, -from_l, 0, 1, NULL, -1, -1); in dc_check_balance_internal()
1909 set_parameters(tb, h, 0, in dc_check_balance_internal()
1910 -((MAX_NR_KEY(Sh) + 1 - tb->rnum[h] + vn->vn_nr_item + in dc_check_balance_internal()
1929 static int dc_check_balance_leaf(struct tree_balance *tb, int h) in dc_check_balance_leaf() argument
1954 levbytes = tb->insert_size[h]; in dc_check_balance_leaf()
1963 set_parameters(tb, h, 0, 0, 1, NULL, -1, -1); in dc_check_balance_leaf()
1967 if ((ret = get_parents(tb, h)) != CARRY_ON) in dc_check_balance_leaf()
1971 rfree = get_rfree(tb, h); in dc_check_balance_leaf()
1972 lfree = get_lfree(tb, h); in dc_check_balance_leaf()
1974 create_virtual_node(tb, h); in dc_check_balance_leaf()
1986 check_left(tb, h, lfree); in dc_check_balance_leaf()
1987 check_right(tb, h, rfree); in dc_check_balance_leaf()
1991 …if (is_left_neighbor_in_cache(tb, h) || ((tb->rnum[0] - ((tb->rbytes == -1) ? 0 : 1)) < vn->vn_nr_… in dc_check_balance_leaf()
1992 !tb->FR[h]) { in dc_check_balance_leaf()
1994 RFALSE(!tb->FL[h], in dc_check_balance_leaf()
1998 set_parameters(tb, h, -1, 0, 0, NULL, -1, -1); in dc_check_balance_leaf()
2004 set_parameters(tb, h, 0, -1, 0, NULL, -1, -1); in dc_check_balance_leaf()
2017 set_parameters(tb, h, 0, 0, 1, NULL, -1, -1); in dc_check_balance_leaf()
2035 static int dc_check_balance(struct tree_balance *tb, int h) in dc_check_balance() argument
2037 RFALSE(!(PATH_H_PBUFFER(tb->tb_path, h)), in dc_check_balance()
2040 if (h) in dc_check_balance()
2041 return dc_check_balance_internal(tb, h); in dc_check_balance()
2043 return dc_check_balance_leaf(tb, h); in dc_check_balance()
2067 int h, in check_balance() argument
2086 if (tb->insert_size[h] > 0) in check_balance()
2087 return ip_check_balance(tb, h); in check_balance()
2090 return dc_check_balance(tb, h); in check_balance()
2094 static int get_direct_parent(struct tree_balance *tb, int h) in get_direct_parent() argument
2099 path_offset = PATH_H_PATH_OFFSET(tb->tb_path, h); in get_direct_parent()
2155 static int get_neighbors(struct tree_balance *tb, int h) in get_neighbors() argument
2158 path_offset = PATH_H_PATH_OFFSET(tb->tb_path, h + 1); in get_neighbors()
2164 PROC_INFO_INC(sb, get_neighbors[h]); in get_neighbors()
2166 if (tb->lnum[h]) { in get_neighbors()
2168 PROC_INFO_INC(sb, need_l_neighbor[h]); in get_neighbors()
2171 RFALSE(bh == tb->FL[h] && in get_neighbors()
2177 tb->FL[h]) ? tb->lkey[h] : B_NR_ITEMS(tb-> in get_neighbors()
2178 FL[h]); in get_neighbors()
2179 son_number = B_N_CHILD_NUM(tb->FL[h], child_position); in get_neighbors()
2187 PROC_INFO_INC(sb, get_neighbors_restart[h]); in get_neighbors()
2191 RFALSE(!B_IS_IN_TREE(tb->FL[h]) || in get_neighbors()
2192 child_position > B_NR_ITEMS(tb->FL[h]) || in get_neighbors()
2193 B_N_CHILD_NUM(tb->FL[h], child_position) != in get_neighbors()
2196 RFALSE(!h && in get_neighbors()
2202 brelse(tb->L[h]); in get_neighbors()
2203 tb->L[h] = bh; in get_neighbors()
2207 if (tb->rnum[h]) { in get_neighbors()
2208 PROC_INFO_INC(sb, need_r_neighbor[h]); in get_neighbors()
2211 RFALSE(bh == tb->FR[h] && in get_neighbors()
2218 (bh == tb->FR[h]) ? tb->rkey[h] + 1 : 0; in get_neighbors()
2219 son_number = B_N_CHILD_NUM(tb->FR[h], child_position); in get_neighbors()
2227 PROC_INFO_INC(sb, get_neighbors_restart[h]); in get_neighbors()
2230 brelse(tb->R[h]); in get_neighbors()
2231 tb->R[h] = bh; in get_neighbors()
2233 RFALSE(!h in get_neighbors()
2552 int ret, h, item_num = PATH_LAST_POSITION(tb->tb_path); in fix_nodes() local
2634 for (h = 0; h < MAX_HEIGHT && tb->insert_size[h]; h++) { in fix_nodes()
2635 ret = get_direct_parent(tb, h); in fix_nodes()
2639 ret = check_balance(op_mode, tb, h, item_num, in fix_nodes()
2644 ret = get_neighbors(tb, h); in fix_nodes()
2647 if (h != MAX_HEIGHT - 1) in fix_nodes()
2648 tb->insert_size[h + 1] = 0; in fix_nodes()
2658 ret = get_neighbors(tb, h); in fix_nodes()
2666 ret = get_empty_nodes(tb, h); in fix_nodes()
2674 if (!PATH_H_PBUFFER(tb->tb_path, h)) { in fix_nodes()
2676 RFALSE(tb->blknum[h] != 1, in fix_nodes()
2679 if (h < MAX_HEIGHT - 1) in fix_nodes()
2680 tb->insert_size[h + 1] = 0; in fix_nodes()
2681 } else if (!PATH_H_PBUFFER(tb->tb_path, h + 1)) { in fix_nodes()
2688 if (tb->blknum[h] > 1) { in fix_nodes()
2690 RFALSE(h == MAX_HEIGHT - 1, in fix_nodes()
2693 tb->insert_size[h + 1] = in fix_nodes()
2695 KEY_SIZE) * (tb->blknum[h] - 1) + in fix_nodes()
2697 } else if (h < MAX_HEIGHT - 1) in fix_nodes()
2698 tb->insert_size[h + 1] = 0; in fix_nodes()
2700 tb->insert_size[h + 1] = in fix_nodes()
2701 (DC_SIZE + KEY_SIZE) * (tb->blknum[h] - 1); in fix_nodes()