| blob | a3be7da3e2b9b99e8238a3ba1d8ecaeef6fe6e45 |
1 /*
2 * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README
3 */
5 /**
6 ** old_item_num
7 ** old_entry_num
8 ** set_entry_sizes
9 ** create_virtual_node
10 ** check_left
11 ** check_right
12 ** directory_part_size
13 ** get_num_ver
14 ** set_parameters
15 ** is_leaf_removable
16 ** are_leaves_removable
17 ** get_empty_nodes
18 ** get_lfree
19 ** get_rfree
20 ** is_left_neighbor_in_cache
21 ** decrement_key
22 ** get_far_parent
23 ** get_parents
24 ** can_node_be_removed
25 ** ip_check_balance
26 ** dc_check_balance_internal
27 ** dc_check_balance_leaf
28 ** dc_check_balance
29 ** check_balance
30 ** get_direct_parent
31 ** get_neighbors
32 ** fix_nodes
33 **
34 **
35 **/
37 #include <linux/time.h>
38 #include <linux/string.h>
39 #include <linux/reiserfs_fs.h>
40 #include <linux/buffer_head.h>
42 /* To make any changes in the tree we find a node, that contains item
43 to be changed/deleted or position in the node we insert a new item
44 to. We call this node S. To do balancing we need to decide what we
45 will shift to left/right neighbor, or to a new node, where new item
46 will be etc. To make this analysis simpler we build virtual
47 node. Virtual node is an array of items, that will replace items of
48 node S. (For instance if we are going to delete an item, virtual
49 node does not contain it). Virtual node keeps information about
50 item sizes and types, mergeability of first and last items, sizes
51 of all entries in directory item. We use this array of items when
52 calculating what we can shift to neighbors and how many nodes we
53 have to have if we do not any shiftings, if we shift to left/right
54 neighbor or to both. */
56 /* taking item number in virtual node, returns number of item, that it has in source buffer */
58 {
68 }
72 mode);
73 /* delete mode */
75 }
78 {
86 /* size of changed node */
90 /* for internal nodes array if virtual items is not created */
94 }
96 /* number of items in virtual node */
101 /* first virtual item */
106 /* first item in the node */
109 /* define the mergeability for 0-th item (if it is not being deleted) */
114 /* go through all items those remain in the virtual node (except for the new (inserted) one) */
124 /* get item number in source node */
133 // FIXME: there is no check, that item operation did not
134 // consume too much memory
142 /* this is not being changed */
148 }
149 }
151 /* virtual inserted item is not defined yet */
164 }
166 /* set right merge flag we take right delimiting key and check whether it is a mergeable item */
175 VI_TYPE_RIGHT_MERGEABLE;
177 #ifdef CONFIG_REISERFS_CHECK
181 /* we delete last item and it could be merged with right neighbor's first item */
186 /* node contains more than 1 item, or item is not directory item, or this item contains more than 1 entry */
189 "rdkey %k, affected item==%d "
193 }
194 }
195 #endif
197 }
198 }
200 /* using virtual node check, how many items can be shifted to left
201 neighbor */
203 {
211 /* internal level */
215 }
217 /* leaf level */
220 /* no free space or nothing to move */
224 }
233 /* all contents of S[0] fits into L[0] */
241 }
245 /* first item may be merge with last item in left neighbor */
254 /* the item can be shifted entirely */
258 }
260 /* the item cannot be shifted entirely, try to split it */
261 /* check whether L[0] can hold ih and at least one byte of the item body */
263 /* cannot shift even a part of the current item */
266 }
271 /* count partially shifted item */
275 }
278 }
280 /* using virtual node check, how many items can be shifted to right
281 neighbor */
283 {
291 /* internal level */
295 }
297 /* leaf level */
300 /* no free space */
304 }
313 /* all contents of S[0] fits into R[0] */
321 }
325 /* last item may be merge with first item in right neighbor */
334 /* the item can be shifted entirely */
338 }
340 /* check whether R[0] can hold ih and at least one byte of the item body */
344 }
346 /* R[0] can hold the header of the item and at least one byte of its body */
351 /* count partially shifted item */
355 }
358 }
360 /*
361 * from - number of items, which are shifted to left neighbor entirely
362 * to - number of item, which are shifted to right neighbor entirely
363 * from_bytes - number of bytes of boundary item (or directory entries) which are shifted to left neighbor
364 * to_bytes - number of bytes of boundary item (or directory entries) which are shifted to right neighbor */
368 {
371 // int bytes;
374 // struct virtual_item * vi;
381 we do not include into node that is being filled */
383 we do node include into node that is being filled */
385 items, that are split between S[0] and
386 S1new and S1new and S2new */
391 /* We only create additional nodes if we are in insert or paste mode
392 or we are in replace mode at the internal level. If h is 0 and
393 the mode is M_REPLACE then in fix_nodes we change the mode to
394 paste or insert before we get here in the code. */
400 /* snum012 [0-2] - number of items, that lay
401 to S[0], first new node and second new node */
405 /* internal level */
411 }
413 /* leaf level */
418 // start from 'from'-th item
420 // skip its first 'start_bytes' units
423 // last included item is the 'end_item'-th one
425 // do not count last 'end_bytes' units of 'end_item'-th item
428 /* go through all item beginning from the start_item-th item and ending by
429 the end_item-th item. Do not count first 'start_bytes' units of
430 'start_item'-th item and last 'end_bytes' of 'end_item'-th item */
438 /* get size of current item */
441 /* do not take in calculation head part (from_bytes) of from-th item */
442 current_item_size -=
445 /* do not take in calculation tail part of last item */
446 current_item_size -=
449 /* if item fits into current node entierly */
455 }
458 /* virtual item length is longer, than max size of item in
459 a node. It is impossible for direct item */
461 "vs-8110: "
464 /* we will try to split it */
466 }
469 /* as we do not split items, take new node and continue */
470 needed_nodes++;
471 i--;
474 }
475 // calculate number of item units which fit into node being
476 // filled
477 {
481 units =
483 skip_from_end);
485 /* nothing fits into current node, take new node and continue */
488 }
489 }
491 /* something fits into the current node */
492 //if (snum012[3] != -1 || needed_nodes != 1)
493 // reiserfs_panic (tb->tb_sb, "vs-8115: get_num_ver: too many nodes required");
494 //snum012[needed_nodes - 1 + 3] = op_unit_num (vi) - start_bytes - units;
503 needed_nodes++;
504 /* continue from the same item with start_bytes != -1 */
506 i--;
508 }
510 // sum012[4] (if it is not -1) contains number of units of which
511 // are to be in S1new, snum012[3] - to be in S0. They are supposed
512 // to be S1bytes and S2bytes correspondingly, so recalculate
519 bytes_to_l =
522 bytes_to_r =
525 bytes_to_S1new =
529 // s2bytes
538 }
540 /* now we know S2bytes, calculate S1bytes */
547 bytes_to_l =
550 bytes_to_r =
553 bytes_to_S2new =
557 // s1bytes
561 }
564 }
566 #ifdef CONFIG_REISERFS_CHECK
568 #endif
570 /* Set parameters for balancing.
571 * Performs write of results of analysis of balancing into structure tb,
572 * where it will later be used by the functions that actually do the balancing.
573 * Parameters:
574 * tb tree_balance structure;
575 * h current level of the node;
576 * lnum number of items from S[h] that must be shifted to L[h];
577 * rnum number of items from S[h] that must be shifted to R[h];
578 * blk_num number of blocks that S[h] will be splitted into;
579 * s012 number of items that fall into splitted nodes.
580 * lbytes number of bytes which flow to the left neighbor from the item that is not
581 * not shifted entirely
582 * rbytes number of bytes which flow to the right neighbor from the item that is not
583 * not shifted entirely
584 * s1bytes number of bytes which flow to the first new node when S[0] splits (this number is contained in s012 array)
585 */
589 {
601 }
604 }
610 }
612 /* check, does node disappear if we shift tb->lnum[0] items to left
613 neighbor and tb->rnum[0] to the right one. */
615 {
621 /* number of items, that will be shifted to left (right) neighbor
622 entirely */
627 /* how many items remain in S[0] after shiftings to neighbors */
631 /* all content of node can be shifted to neighbors */
635 }
638 /* S[0] is not removable */
641 /* check, whether we can divide 1 remaining item between neighbors */
643 /* get size of remaining item (in item units) */
650 }
653 }
655 /* check whether L, S, R can be joined in one node */
657 {
673 /* there was only one item and it will be deleted */
686 /* Directory must be in correct state here: that is
687 somewhere at the left side should exist first directory
688 item. But the item being deleted can not be that first
689 one because its right neighbor is item of the same
690 directory. (But first item always gets deleted in last
691 turn). So, neighbors of deleted item can be merged, so
692 we can save ih_size */
695 /* we might check that left neighbor exists and is of the
696 same directory */
699 }
701 }
707 }
710 }
712 /* when we do not split item, lnum and rnum are numbers of entire items */
713 #define SET_PAR_SHIFT_LEFT \
714 if (h)\
715 {\
716 int to_l;\
717 \
718 to_l = (MAX_NR_KEY(Sh)+1 - lpar + vn->vn_nr_item + 1) / 2 -\
719 (MAX_NR_KEY(Sh) + 1 - lpar);\
720 \
721 set_parameters (tb, h, to_l, 0, lnver, NULL, -1, -1);\
722 }\
723 else \
724 {\
725 if (lset==LEFT_SHIFT_FLOW)\
726 set_parameters (tb, h, lpar, 0, lnver, snum012+lset,\
727 tb->lbytes, -1);\
728 else\
729 set_parameters (tb, h, lpar - (tb->lbytes!=-1), 0, lnver, snum012+lset,\
730 -1, -1);\
731 }
733 #define SET_PAR_SHIFT_RIGHT \
734 if (h)\
735 {\
736 int to_r;\
737 \
738 to_r = (MAX_NR_KEY(Sh)+1 - rpar + vn->vn_nr_item + 1) / 2 - (MAX_NR_KEY(Sh) + 1 - rpar);\
739 \
740 set_parameters (tb, h, 0, to_r, rnver, NULL, -1, -1);\
741 }\
742 else \
743 {\
744 if (rset==RIGHT_SHIFT_FLOW)\
745 set_parameters (tb, h, 0, rpar, rnver, snum012+rset,\
746 -1, tb->rbytes);\
747 else\
748 set_parameters (tb, h, 0, rpar - (tb->rbytes!=-1), rnver, snum012+rset,\
749 -1, -1);\
750 }
753 {
772 }
773 }
775 /* Get new buffers for storing new nodes that are created while balancing.
776 * Returns: SCHEDULE_OCCURRED - schedule occurred while the function worked;
777 * CARRY_ON - schedule didn't occur while the function worked;
778 * NO_DISK_SPACE - no disk space.
779 */
780 /* The function is NOT SCHEDULE-SAFE! */
782 {
790 /* number_of_freeblk is the number of empty blocks which have been
791 acquired for use by the balancing algorithm minus the number of
792 empty blocks used in the previous levels of the analysis,
793 number_of_freeblk = tb->cur_blknum can be non-zero if a schedule occurs
794 after empty blocks are acquired, and the balancing analysis is
795 then restarted, amount_needed is the number needed by this level
796 (n_h) of the balancing analysis.
798 Note that for systems with many processes writing, it would be
799 more layout optimal to calculate the total number needed by all
800 levels and then to run reiserfs_new_blocks to get all of them at once. */
802 /* Initiate number_of_freeblk to the amount acquired prior to the restart of
803 the analysis or 0 if not restarted, then subtract the amount needed
804 by all of the levels of the tree below n_h. */
805 /* blknum includes S[n_h], so we subtract 1 in this calculation */
808 n_number_of_freeblk -=
812 /* Allocate missing empty blocks. */
813 /* if p_s_Sh == 0 then we are getting a new root */
815 /* Amount_needed = the amount that we need more than the amount that we have. */
821 /* No need to check quota - is not allocated for blocks used for formatted nodes */
826 /* for each blocknumber we just got, get a buffer and stick it on FEB */
838 p_s_new_bh);
840 /* Put empty buffers into the array. */
846 }
852 }
854 /* Get free space of the left neighbor, which is stored in the parent
855 * node of the left neighbor. */
857 {
870 }
873 }
875 /* Get free space of the right neighbor,
876 * which is stored in the parent node of the right neighbor.
877 */
879 {
892 }
896 }
898 /* Check whether left neighbor is in memory. */
900 {
903 b_blocknr_t n_left_neighbor_blocknr;
909 /* Calculate father of the node to be balanced. */
920 /* Get position of the pointer to the left neighbor into the left father. */
923 /* Get left neighbor block number. */
924 n_left_neighbor_blocknr =
926 /* Look for the left neighbor in the cache. */
934 }
937 }
943 {
944 // call item specific function for this key
946 }
948 /* Calculate far left/right parent of the left/right neighbor of the current node, that
949 * is calculate the left/right (FL[h]/FR[h]) neighbor of the parent F[h].
950 * Calculate left/right common parent of the current node and L[h]/R[h].
951 * Calculate left/right delimiting key position.
952 * Returns: PATH_INCORRECT - path in the tree is not correct;
953 SCHEDULE_OCCURRED - schedule occurred while the function worked;
954 * CARRY_ON - schedule didn't occur while the function worked;
955 */
960 {
970 /* Starting from F[n_h] go upwards in the tree, and look for the common
971 ancestor of F[n_h], and its neighbor l/r, that should be obtained. */
979 /* Check whether parent of the current buffer in the path is really parent in the tree. */
983 /* Check whether position in the parent is correct. */
989 /* Check whether parent at the path really points to the child. */
993 /* Return delimiting key if position in the parent is not equal to first/last one. */
999 /*(*pp_s_com_father = p_s_parent)->b_count++; */
1001 }
1002 }
1004 /* if we are in the root of the tree, then there is no common father */
1006 /* Check whether first buffer in the path is the root of the tree. */
1013 }
1015 }
1021 /* Check whether the common parent is locked. */
1028 }
1029 }
1031 /* So, we got common parent of the current node and its left/right neighbor.
1032 Now we are geting the parent of the left/right neighbor. */
1034 /* Form key to get parent of the left/right neighbor. */
1039 n_position -
1042 n_position)));
1050 // path is released
1057 }
1069 }
1071 /* Get parents of neighbors of node in the path(S[n_path_offset]) and common parents of
1072 * S[n_path_offset] and L[n_path_offset]/R[n_path_offset]: F[n_path_offset], FL[n_path_offset],
1073 * FR[n_path_offset], CFL[n_path_offset], CFR[n_path_offset].
1074 * Calculate numbers of left and right delimiting keys position: lkey[n_path_offset], rkey[n_path_offset].
1075 * Returns: SCHEDULE_OCCURRED - schedule occurred while the function worked;
1076 * CARRY_ON - schedule didn't occur while the function worked;
1077 */
1079 {
1082 n_ret_value,
1086 /* Current node is the root of the tree or will be root of the tree */
1088 /* The root can not have parents.
1089 Release nodes which previously were obtained as parents of the current node neighbors. */
1097 }
1099 /* Get parent FL[n_path_offset] of L[n_path_offset]. */
1101 /* Current node is not the first child of its parent. */
1102 /*(p_s_curf = p_s_curcf = PATH_OFFSET_PBUFFER(p_s_path, n_path_offset - 1))->b_count += 2; */
1109 /* Calculate current parent of L[n_path_offset], which is the left neighbor of the current node.
1110 Calculate current common parent of L[n_path_offset] and the current node. Note that
1111 CFL[n_path_offset] not equal FL[n_path_offset] and CFL[n_path_offset] not equal F[n_path_offset].
1112 Calculate lkey[n_path_offset]. */
1117 }
1128 /* Get parent FR[n_h] of R[n_h]. */
1130 /* Current node is the last child of F[n_h]. FR[n_h] != F[n_h]. */
1132 /* Calculate current parent of R[n_h], which is the right neighbor of F[n_h].
1133 Calculate current common parent of R[n_h] and current node. Note that CFR[n_h]
1134 not equal FR[n_path_offset] and CFR[n_h] not equal F[n_h]. */
1140 /* Current node is not the last child of its parent F[n_h]. */
1141 /*(p_s_curf = p_s_curcf = PATH_OFFSET_PBUFFER(p_s_path, n_path_offset - 1))->b_count += 2; */
1147 }
1160 }
1162 /* it is possible to remove node as result of shiftings to
1163 neighbors even when we insert or paste item. */
1166 {
1177 /* shifting may merge items which might save space */
1178 -
1179 ((!h
1181 -
1185 /* node can not be removed */
1193 }
1194 }
1197 }
1199 /* Check whether current node S[h] is balanced when increasing its size by
1200 * Inserting or Pasting.
1201 * Calculate parameters for balancing for current level h.
1202 * Parameters:
1203 * tb tree_balance structure;
1204 * h current level of the node;
1205 * inum item number in S[h];
1206 * mode i - insert, p - paste;
1207 * Returns: 1 - schedule occurred;
1208 * 0 - balancing for higher levels needed;
1209 * -1 - no balancing for higher levels needed;
1210 * -2 - no disk space.
1211 */
1212 /* ip means Inserting or Pasting */
1214 {
1217 is negative if bytes are deleted) buffer which
1218 contains node being balanced. The mnemonic is
1219 that the attempted change in node space used level
1220 is levbytes bytes. */
1221 n_ret_value;
1225 /* nver is short for number of vertixes, and lnver is the number if
1226 we shift to the left, rnver is the number if we shift to the
1227 right, and lrnver is the number if we shift in both directions.
1228 The goal is to minimize first the number of vertixes, and second,
1229 the number of vertixes whose contents are changed by shifting,
1230 and third the number of uncached vertixes whose contents are
1231 changed by shifting and must be read from disk. */
1234 /* used at leaf level only, S0 = S[0] is the node being balanced,
1235 sInum [ I = 0,1,2 ] is the number of items that will
1236 remain in node SI after balancing. S1 and S2 are new
1237 nodes that might be created. */
1239 /* we perform 8 calls to get_num_ver(). For each call we calculate five parameters.
1240 where 4th parameter is s1bytes and 5th - s2bytes
1241 */
1243 0,1 - do not shift and do not shift but bottle
1244 2 - shift only whole item to left
1245 3 - shift to left and bottle as much as possible
1246 4,5 - shift to right (whole items and as much as possible
1247 6,7 - shift to both directions (whole items and as much as possible)
1248 */
1250 /* Sh is the node whose balance is currently being checked */
1256 /* Calculate balance parameters for creating new root. */
1272 }
1273 }
1280 /* get free space of neighbors */
1285 NO_BALANCING_NEEDED)
1286 /* and new item fits into node S[h] without any shifting */
1291 /*
1292 determine maximal number of items we can shift to the left neighbor (in tb structure)
1293 and the maximal number of bytes that can flow to the left neighbor
1294 from the left most liquid item that cannot be shifted from S[0] entirely (returned value)
1295 */
1298 /*
1299 determine maximal number of items we can shift to the right neighbor (in tb structure)
1300 and the maximal number of bytes that can flow to the right neighbor
1301 from the right most liquid item that cannot be shifted from S[0] entirely (returned value)
1302 */
1305 /* all contents of internal node S[h] can be moved into its
1306 neighbors, S[h] will be removed after balancing */
1310 /* Since we are working on internal nodes, and our internal
1311 nodes have fixed size entries, then we can balance by the
1312 number of items rather than the space they consume. In this
1313 routine we set the left node equal to the right node,
1314 allowing a difference of less than or equal to 1 child
1315 pointer. */
1316 to_r =
1323 }
1325 /* this checks balance condition, that any two neighboring nodes can not fit in one node */
1334 /* all contents of S[0] can be moved into its neighbors
1335 S[0] will be removed after balancing. */
1339 /* why do we perform this check here rather than earlier??
1340 Answer: we can win 1 node in some cases above. Moreover we
1341 checked it above, when we checked, that S[0] is not removable
1342 in principle */
1348 }
1350 {
1352 /*
1353 * regular overflowing of the node
1354 */
1356 /* get_num_ver works in 2 modes (FLOW & NO_FLOW)
1357 lpar, rpar - number of items we can shift to left/right neighbor (including splitting item)
1358 nset, lset, rset, lrset - shows, whether flowing items give better packing
1359 */
1360 #define FLOW 1
1363 /* we choose one the following */
1364 #define NOTHING_SHIFT_NO_FLOW 0
1365 #define NOTHING_SHIFT_FLOW 5
1366 #define LEFT_SHIFT_NO_FLOW 10
1367 #define LEFT_SHIFT_FLOW 15
1368 #define RIGHT_SHIFT_NO_FLOW 20
1369 #define RIGHT_SHIFT_FLOW 25
1370 #define LR_SHIFT_NO_FLOW 30
1371 #define LR_SHIFT_FLOW 35
1376 /* calculate number of blocks S[h] must be split into when
1377 nothing is shifted to the neighbors,
1378 as well as number of items in each part of the split node (s012 numbers),
1379 and number of bytes (s1bytes) of the shared drop which flow to S1 if any */
1388 /* note, that in this case we try to bottle between S[0] and S1 (S1 - the first new node) */
1394 }
1396 /* calculate number of blocks S[h] must be split into when
1397 l_shift_num first items and l_shift_bytes of the right most
1398 liquid item to be shifted are shifted to the left neighbor,
1399 as well as number of items in each part of the splitted node (s012 numbers),
1400 and number of bytes (s1bytes) of the shared drop which flow to S1 if any
1401 */
1411 lpar -
1417 }
1419 /* calculate number of blocks S[h] must be split into when
1420 r_shift_num first items and r_shift_bytes of the left most
1421 liquid item to be shifted are shifted to the right neighbor,
1422 as well as number of items in each part of the splitted node (s012 numbers),
1423 and number of bytes (s1bytes) of the shared drop which flow to S1 if any
1424 */
1430 rbytes !=
1446 }
1448 /* calculate number of blocks S[h] must be split into when
1449 items are shifted in both directions,
1450 as well as number of items in each part of the splitted node (s012 numbers),
1451 and number of bytes (s1bytes) of the shared drop which flow to S1 if any
1452 */
1459 rbytes !=
1467 lpar -
1476 }
1478 /* Our general shifting strategy is:
1479 1) to minimized number of new nodes;
1480 2) to minimized number of neighbors involved in shifting;
1481 3) to minimized number of disk reads; */
1483 /* we can win TWO or ONE nodes by shifting in both directions */
1494 else
1503 }
1505 /* if shifting doesn't lead to better packing then don't shift */
1510 }
1512 /* now we know that for better packing shifting in only one
1513 direction either to the left or to the right is required */
1515 /* if shifting to the left is better than shifting to the right */
1517 SET_PAR_SHIFT_LEFT;
1519 }
1521 /* if shifting to the right is better than shifting to the left */
1523 SET_PAR_SHIFT_RIGHT;
1525 }
1527 /* now shifting in either direction gives the same number
1528 of nodes and we can make use of the cached neighbors */
1530 SET_PAR_SHIFT_LEFT;
1532 }
1534 /* shift to the right independently on whether the right neighbor in cache or not */
1535 SET_PAR_SHIFT_RIGHT;
1537 }
1538 }
1540 /* Check whether current node S[h] is balanced when Decreasing its size by
1541 * Deleting or Cutting for INTERNAL node of S+tree.
1542 * Calculate parameters for balancing for current level h.
1543 * Parameters:
1544 * tb tree_balance structure;
1545 * h current level of the node;
1546 * inum item number in S[h];
1547 * mode i - insert, p - paste;
1548 * Returns: 1 - schedule occurred;
1549 * 0 - balancing for higher levels needed;
1550 * -1 - no balancing for higher levels needed;
1551 * -2 - no disk space.
1552 *
1553 * Note: Items of internal nodes have fixed size, so the balance condition for
1554 * the internal part of S+tree is as for the B-trees.
1555 */
1557 {
1560 /* Sh is the node whose balance is currently being checked,
1561 and Fh is its father. */
1571 /* using tb->insert_size[h], which is negative in this case, create_virtual_node calculates: */
1572 /* new_nr_item = number of items node would have if operation is */
1573 /* performed without balancing (new_nr_item); */
1580 }
1581 /* new_nr_item == 0.
1582 * Current root will be deleted resulting in
1583 * decrementing the tree height. */
1586 }
1591 /* get free space of neighbors */
1595 /* determine maximal number of items we can fit into neighbors */
1600 * In this case we balance only if it leads to better packing. */
1602 * which is impossible with greater values of new_nr_item. */
1604 /* All contents of S[h] can be moved to L[h]. */
1608 order_L =
1611 h)) ==
1618 }
1621 /* All contents of S[h] can be moved to R[h]. */
1625 order_R =
1628 h)) ==
1635 }
1636 }
1639 /* All contents of S[h] can be moved to the neighbors (L[h] & R[h]). */
1642 to_r =
1649 }
1651 /* Balancing does not lead to better packing. */
1654 }
1656 /* Current node contain insufficient number of items. Balancing is required. */
1657 /* Check whether we can merge S[h] with left neighbor. */
1664 order_L =
1667 h)) ==
1670 KEY_SIZE);
1673 }
1675 /* Check whether we can merge S[h] with right neighbor. */
1680 order_R =
1685 KEY_SIZE);
1688 }
1690 /* All contents of S[h] can be moved to the neighbors (L[h] & R[h]). */
1694 to_r =
1701 }
1703 /* For internal nodes try to borrow item from a neighbor */
1706 /* Borrow one or two items from caching neighbor */
1710 from_l =
1715 }
1721 }
1723 /* Check whether current node S[h] is balanced when Decreasing its size by
1724 * Deleting or Truncating for LEAF node of S+tree.
1725 * Calculate parameters for balancing for current level h.
1726 * Parameters:
1727 * tb tree_balance structure;
1728 * h current level of the node;
1729 * inum item number in S[h];
1730 * mode i - insert, p - paste;
1731 * Returns: 1 - schedule occurred;
1732 * 0 - balancing for higher levels needed;
1733 * -1 - no balancing for higher levels needed;
1734 * -2 - no disk space.
1735 */
1737 {
1740 /* Number of bytes that must be deleted from
1741 (value is negative if bytes are deleted) buffer which
1742 contains node being balanced. The mnemonic is that the
1743 attempted change in node space used level is levbytes bytes. */
1745 /* the maximal item size */
1747 /* S0 is the node whose balance is currently being checked,
1748 and F0 is its father. */
1766 }
1771 /* get free space of neighbors */
1777 /* if 3 leaves can be merge to one, set parameters and return */
1781 /* determine maximal number of items we can shift to the left/right neighbor
1782 and the maximal number of bytes that can flow to the left/right neighbor
1783 from the left/right most liquid item that cannot be shifted from S[0] entirely
1784 */
1788 /* check whether we can merge S with left neighbor. */
1790 if (is_left_neighbor_in_cache(tb, h) || ((tb->rnum[0] - ((tb->rbytes == -1) ? 0 : 1)) < vn->vn_nr_item) || /* S can not be merged with R */
1796 /* set parameter to merge S[0] with its left neighbor */
1799 }
1801 /* check whether we can merge S[0] with right neighbor. */
1805 }
1807 /* All contents of S[0] can be moved to the neighbors (L[0] & R[0]). Set parameters and return */
1811 /* Balancing is not required. */
1815 }
1817 /* Check whether current node S[h] is balanced when Decreasing its size by
1818 * Deleting or Cutting.
1819 * Calculate parameters for balancing for current level h.
1820 * Parameters:
1821 * tb tree_balance structure;
1822 * h current level of the node;
1823 * inum item number in S[h];
1824 * mode d - delete, c - cut.
1825 * Returns: 1 - schedule occurred;
1826 * 0 - balancing for higher levels needed;
1827 * -1 - no balancing for higher levels needed;
1828 * -2 - no disk space.
1829 */
1831 {
1837 else
1839 }
1841 /* Check whether current node S[h] is balanced.
1842 * Calculate parameters for balancing for current level h.
1843 * Parameters:
1844 *
1845 * tb tree_balance structure:
1846 *
1847 * tb is a large structure that must be read about in the header file
1848 * at the same time as this procedure if the reader is to successfully
1849 * understand this procedure
1850 *
1851 * h current level of the node;
1852 * inum item number in S[h];
1853 * mode i - insert, p - paste, d - delete, c - cut.
1854 * Returns: 1 - schedule occurred;
1855 * 0 - balancing for higher levels needed;
1856 * -1 - no balancing for higher levels needed;
1857 * -2 - no disk space.
1858 */
1865 {
1880 /* Calculate balance parameters when size of node is increasing. */
1883 /* Calculate balance parameters when size of node is decreasing. */
1885 }
1887 /* Check whether parent at the path is the really parent of the current node.*/
1889 {
1895 /* We are in the root or in the new root. */
1903 /* Root is not changed. */
1907 }
1909 }
1922 /* Parent in the path is not parent of the current node in the tree. */
1929 }
1932 }
1934 /* Using lnum[n_h] and rnum[n_h] we should determine what neighbors
1935 * of S[n_h] we
1936 * need in order to balance S[n_h], and get them if necessary.
1937 * Returns: SCHEDULE_OCCURRED - schedule occurred while the function worked;
1938 * CARRY_ON - schedule didn't occur while the function worked;
1939 */
1941 {
1951 /* We need left neighbor to balance S[n_h]. */
1959 n_child_position =
1971 }
1986 }
1994 n_path_offset) >=
1998 n_child_position =
2008 }
2020 }
2022 }
2025 {
2030 #define MIN_NAME_LEN 1
2040 }
2042 /* maybe we should fail balancing we are going to perform when kmalloc
2043 fails several times. But now it will loop until kmalloc gets
2044 required memory */
2046 {
2054 /* we have to allocate more memory for virtual node */
2056 /* free memory allocated before */
2058 /* this is not needed if kfree is atomic */
2060 }
2062 /* virtual node requires now more memory */
2065 /* get memory for virtual item */
2068 /* getting memory with GFP_KERNEL priority may involve
2069 balancing now (due to indirect_to_direct conversion on
2070 dcache shrinking). So, release path and collected
2071 resources here */
2076 }
2080 }
2083 }
2089 }
2091 #ifdef CONFIG_REISERFS_CHECK
2095 {
2100 "reference counter for buffer %s[%d] "
2102 }
2108 }
2114 }
2120 }
2126 }
2132 }
2133 }
2134 }
2135 #else
2139 {;
2140 }
2141 #endif
2144 {
2146 }
2149 {
2151 #ifdef CONFIG_REISERFS_CHECK
2153 #endif
2163 /* if I understand correctly, we can only be sure the last buffer
2164 ** in the path is in the tree --clm
2165 */
2166 #ifdef CONFIG_REISERFS_CHECK
2170 PATH_OFFSET_PBUFFER
2175 }
2176 #endif
2178 PATH_OFFSET_PBUFFER
2180 i))) {
2181 locked =
2183 i);
2184 }
2185 }
2186 }
2189 i++) {
2200 }
2209 }
2218 }
2220 }
2231 }
2240 }
2249 }
2250 }
2251 }
2252 /* as far as I can tell, this is not required. The FEB list seems
2253 ** to be full of newly allocated nodes, which will never be locked,
2254 ** dirty, or anything else.
2255 ** To be safe, I'm putting in the checks and waits in. For the moment,
2256 ** they are needed to keep the code in journal.c from complaining
2257 ** about the buffer. That code is inside CONFIG_REISERFS_CHECK as well.
2258 ** --clm
2259 */
2265 }
2266 }
2269 #ifdef CONFIG_REISERFS_CHECK
2270 repeat_counter++;
2273 "too many iterations waiting "
2274 "for buffer to unlock "
2277 /* Don't loop forever. Try to recover from possible error. */
2281 }
2282 #endif
2286 }
2287 }
2292 }
2294 /* Prepare for balancing, that is
2295 * get all necessary parents, and neighbors;
2296 * analyze what and where should be moved;
2297 * get sufficient number of new nodes;
2298 * Balancing will start only after all resources will be collected at a time.
2299 *
2300 * When ported to SMP kernels, only at the last moment after all needed nodes
2301 * are collected in cache, will the resources be locked using the usual
2302 * textbook ordered lock acquisition algorithms. Note that ensuring that
2303 * this code neither write locks what it does not need to write lock nor locks out of order
2304 * will be a pain in the butt that could have been avoided. Grumble grumble. -Hans
2305 *
2306 * fix is meant in the sense of render unchanging
2307 *
2308 * Latency might be improved by first gathering a list of what buffers are needed
2309 * and then getting as many of them in parallel as possible? -Hans
2310 *
2311 * Parameters:
2312 * op_mode i - insert, d - delete, c - cut (truncate), p - paste (append)
2313 * tb tree_balance structure;
2314 * inum item number in S[h];
2315 * pos_in_item - comment this if you can
2316 * ins_ih & ins_sd are used when inserting
2317 * Returns: 1 - schedule occurred while the function worked;
2318 * 0 - schedule didn't occur while the function worked;
2319 * -1 - if no_disk_space
2320 */
2322 int fix_nodes(int n_op_mode, struct tree_balance *p_s_tb, struct item_head *p_s_ins_ih, // item head of item being inserted
2324 )
2325 {
2329 /* we set wait_tb_buffers_run when we have to restore any dirty bits cleared
2330 ** during wait_tb_buffers_run
2331 */
2341 /* we prepare and log the super here so it will already be in the
2342 ** transaction when do_balance needs to change it.
2343 ** This way do_balance won't have to schedule when trying to prepare
2344 ** the super for logging
2345 */
2353 /* if it possible in indirect_to_direct conversion */
2358 }
2359 #ifdef CONFIG_REISERFS_CHECK
2364 }
2368 "not uptodate at the beginning of fix_nodes "
2371 }
2373 /* Check parameters. */
2378 "item number %d (in S0 - %d) in case "
2388 "item number(%d); mode = %c "
2392 }
2397 }
2398 #endif
2401 // FIXME: maybe -ENOMEM when tb->vn_buf == 0? Now just repeat
2404 /* Starting from the leaf level; for all levels n_h of the tree. */
2408 }
2415 /* No balancing for higher levels needed. */
2419 }
2422 /* ok, analysis and resource gathering are complete */
2424 }
2426 }
2430 }
2434 analysis may be invalid and needs to be redone. */
2435 }
2438 /* We have a positive insert size but no nodes exist on this
2439 level, this means that we are creating a new root. */
2448 /* The tree needs to be grown, so this node S[n_h]
2449 which is the root node is split into two nodes,
2450 and a new node (S[n_h+1]) will be created to
2451 become the root node. */
2459 DC_SIZE;
2465 }
2474 }
2478 }
2480 repeat:
2481 // fix_nodes was unable to perform its calculation due to
2482 // filesystem got changed under us, lack of free disk space or i/o
2483 // failure. If the first is the case - the search will be
2484 // repeated. For now - free all resources acquired so far except
2485 // for the new allocated nodes
2486 {
2489 /* Release path buffers. */
2494 }
2495 /* brelse all resources collected for balancing */
2507 p_s_tb->
2510 p_s_tb->
2512 }
2527 }
2532 reiserfs_restore_prepared_buffer
2534 }
2535 }
2536 }
2538 }
2540 }
2542 /* Anatoly will probably forgive me renaming p_s_tb to tb. I just
2543 wanted to make lines shorter */
2545 {
2548 /* Release path buffers. */
2551 /* brelse all resources collected for balancing */
2566 }
2568 /* deal with list of allocated (used and unused) nodes */
2572 /* de-allocated block which was not used by balancing and
2573 bforget about buffer for it */
2577 }
2579 /* release used as new nodes including a new root */
2581 }
2582 }
2586 }