| blob | 430e0658704c3f1c19d903e78d03e80f4c305484 |
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/slab.h>
39 #include <linux/string.h>
41 #include <linux/buffer_head.h>
43 /* To make any changes in the tree we find a node, that contains item
44 to be changed/deleted or position in the node we insert a new item
45 to. We call this node S. To do balancing we need to decide what we
46 will shift to left/right neighbor, or to a new node, where new item
47 will be etc. To make this analysis simpler we build virtual
48 node. Virtual node is an array of items, that will replace items of
49 node S. (For instance if we are going to delete an item, virtual
50 node does not contain it). Virtual node keeps information about
51 item sizes and types, mergeability of first and last items, sizes
52 of all entries in directory item. We use this array of items when
53 calculating what we can shift to neighbors and how many nodes we
54 have to have if we do not any shiftings, if we shift to left/right
55 neighbor or to both. */
57 /* taking item number in virtual node, returns number of item, that it has in source buffer */
59 {
69 }
73 mode);
74 /* delete mode */
76 }
79 {
87 /* size of changed node */
91 /* for internal nodes array if virtual items is not created */
95 }
97 /* number of items in virtual node */
102 /* first virtual item */
107 /* first item in the node */
110 /* define the mergeability for 0-th item (if it is not being deleted) */
115 /* go through all items those remain in the virtual node (except for the new (inserted) one) */
125 /* get item number in source node */
134 // FIXME: there is no check, that item operation did not
135 // consume too much memory
143 /* this is not being changed */
149 }
150 }
152 /* virtual inserted item is not defined yet */
165 }
167 /* set right merge flag we take right delimiting key and check whether it is a mergeable item */
176 VI_TYPE_RIGHT_MERGEABLE;
178 #ifdef CONFIG_REISERFS_CHECK
182 /* we delete last item and it could be merged with right neighbor's first item */
187 /* node contains more than 1 item, or item is not directory item, or this item contains more than 1 entry */
190 "rdkey %k, affected item==%d "
194 }
195 }
196 #endif
198 }
199 }
201 /* using virtual node check, how many items can be shifted to left
202 neighbor */
204 {
212 /* internal level */
216 }
218 /* leaf level */
221 /* no free space or nothing to move */
225 }
234 /* all contents of S[0] fits into L[0] */
242 }
246 /* first item may be merge with last item in left neighbor */
255 /* the item can be shifted entirely */
259 }
261 /* the item cannot be shifted entirely, try to split it */
262 /* check whether L[0] can hold ih and at least one byte of the item body */
264 /* cannot shift even a part of the current item */
267 }
272 /* count partially shifted item */
276 }
279 }
281 /* using virtual node check, how many items can be shifted to right
282 neighbor */
284 {
292 /* internal level */
296 }
298 /* leaf level */
301 /* no free space */
305 }
314 /* all contents of S[0] fits into R[0] */
322 }
326 /* last item may be merge with first item in right neighbor */
335 /* the item can be shifted entirely */
339 }
341 /* check whether R[0] can hold ih and at least one byte of the item body */
345 }
347 /* R[0] can hold the header of the item and at least one byte of its body */
352 /* count partially shifted item */
356 }
359 }
361 /*
362 * from - number of items, which are shifted to left neighbor entirely
363 * to - number of item, which are shifted to right neighbor entirely
364 * from_bytes - number of bytes of boundary item (or directory entries) which are shifted to left neighbor
365 * to_bytes - number of bytes of boundary item (or directory entries) which are shifted to right neighbor */
369 {
372 // int bytes;
375 // struct virtual_item * vi;
382 we do not include into node that is being filled */
384 we do node include into node that is being filled */
386 items, that are split between S[0] and
387 S1new and S1new and S2new */
392 /* We only create additional nodes if we are in insert or paste mode
393 or we are in replace mode at the internal level. If h is 0 and
394 the mode is M_REPLACE then in fix_nodes we change the mode to
395 paste or insert before we get here in the code. */
401 /* snum012 [0-2] - number of items, that lay
402 to S[0], first new node and second new node */
406 /* internal level */
412 }
414 /* leaf level */
419 // start from 'from'-th item
421 // skip its first 'start_bytes' units
424 // last included item is the 'end_item'-th one
426 // do not count last 'end_bytes' units of 'end_item'-th item
429 /* go through all item beginning from the start_item-th item and ending by
430 the end_item-th item. Do not count first 'start_bytes' units of
431 'start_item'-th item and last 'end_bytes' of 'end_item'-th item */
439 /* get size of current item */
442 /* do not take in calculation head part (from_bytes) of from-th item */
443 current_item_size -=
446 /* do not take in calculation tail part of last item */
447 current_item_size -=
450 /* if item fits into current node entierly */
456 }
459 /* virtual item length is longer, than max size of item in
460 a node. It is impossible for direct item */
462 "vs-8110: "
465 /* we will try to split it */
467 }
470 /* as we do not split items, take new node and continue */
471 needed_nodes++;
472 i--;
475 }
476 // calculate number of item units which fit into node being
477 // filled
478 {
482 units =
484 skip_from_end);
486 /* nothing fits into current node, take new node and continue */
489 }
490 }
492 /* something fits into the current node */
493 //if (snum012[3] != -1 || needed_nodes != 1)
494 // reiserfs_panic (tb->tb_sb, "vs-8115: get_num_ver: too many nodes required");
495 //snum012[needed_nodes - 1 + 3] = op_unit_num (vi) - start_bytes - units;
504 needed_nodes++;
505 /* continue from the same item with start_bytes != -1 */
507 i--;
509 }
511 // sum012[4] (if it is not -1) contains number of units of which
512 // are to be in S1new, snum012[3] - to be in S0. They are supposed
513 // to be S1bytes and S2bytes correspondingly, so recalculate
520 bytes_to_l =
523 bytes_to_r =
526 bytes_to_S1new =
530 // s2bytes
539 }
541 /* now we know S2bytes, calculate S1bytes */
548 bytes_to_l =
551 bytes_to_r =
554 bytes_to_S2new =
558 // s1bytes
562 }
565 }
568 /* Set parameters for balancing.
569 * Performs write of results of analysis of balancing into structure tb,
570 * where it will later be used by the functions that actually do the balancing.
571 * Parameters:
572 * tb tree_balance structure;
573 * h current level of the node;
574 * lnum number of items from S[h] that must be shifted to L[h];
575 * rnum number of items from S[h] that must be shifted to R[h];
576 * blk_num number of blocks that S[h] will be splitted into;
577 * s012 number of items that fall into splitted nodes.
578 * lbytes number of bytes which flow to the left neighbor from the item that is not
579 * not shifted entirely
580 * rbytes number of bytes which flow to the right neighbor from the item that is not
581 * not shifted entirely
582 * s1bytes number of bytes which flow to the first new node when S[0] splits (this number is contained in s012 array)
583 */
587 {
599 }
602 }
608 }
610 /* check, does node disappear if we shift tb->lnum[0] items to left
611 neighbor and tb->rnum[0] to the right one. */
613 {
619 /* number of items, that will be shifted to left (right) neighbor
620 entirely */
625 /* how many items remain in S[0] after shiftings to neighbors */
629 /* all content of node can be shifted to neighbors */
633 }
636 /* S[0] is not removable */
639 /* check, whether we can divide 1 remaining item between neighbors */
641 /* get size of remaining item (in item units) */
648 }
651 }
653 /* check whether L, S, R can be joined in one node */
655 {
671 /* there was only one item and it will be deleted */
684 /* Directory must be in correct state here: that is
685 somewhere at the left side should exist first directory
686 item. But the item being deleted can not be that first
687 one because its right neighbor is item of the same
688 directory. (But first item always gets deleted in last
689 turn). So, neighbors of deleted item can be merged, so
690 we can save ih_size */
693 /* we might check that left neighbor exists and is of the
694 same directory */
697 }
699 }
705 }
708 }
710 /* when we do not split item, lnum and rnum are numbers of entire items */
711 #define SET_PAR_SHIFT_LEFT \
712 if (h)\
713 {\
714 int to_l;\
715 \
716 to_l = (MAX_NR_KEY(Sh)+1 - lpar + vn->vn_nr_item + 1) / 2 -\
717 (MAX_NR_KEY(Sh) + 1 - lpar);\
718 \
719 set_parameters (tb, h, to_l, 0, lnver, NULL, -1, -1);\
720 }\
721 else \
722 {\
723 if (lset==LEFT_SHIFT_FLOW)\
724 set_parameters (tb, h, lpar, 0, lnver, snum012+lset,\
725 tb->lbytes, -1);\
726 else\
727 set_parameters (tb, h, lpar - (tb->lbytes!=-1), 0, lnver, snum012+lset,\
728 -1, -1);\
729 }
731 #define SET_PAR_SHIFT_RIGHT \
732 if (h)\
733 {\
734 int to_r;\
735 \
736 to_r = (MAX_NR_KEY(Sh)+1 - rpar + vn->vn_nr_item + 1) / 2 - (MAX_NR_KEY(Sh) + 1 - rpar);\
737 \
738 set_parameters (tb, h, 0, to_r, rnver, NULL, -1, -1);\
739 }\
740 else \
741 {\
742 if (rset==RIGHT_SHIFT_FLOW)\
743 set_parameters (tb, h, 0, rpar, rnver, snum012+rset,\
744 -1, tb->rbytes);\
745 else\
746 set_parameters (tb, h, 0, rpar - (tb->rbytes!=-1), rnver, snum012+rset,\
747 -1, -1);\
748 }
751 {
770 }
771 }
773 /* Get new buffers for storing new nodes that are created while balancing.
774 * Returns: SCHEDULE_OCCURRED - schedule occurred while the function worked;
775 * CARRY_ON - schedule didn't occur while the function worked;
776 * NO_DISK_SPACE - no disk space.
777 */
778 /* The function is NOT SCHEDULE-SAFE! */
780 {
788 /* number_of_freeblk is the number of empty blocks which have been
789 acquired for use by the balancing algorithm minus the number of
790 empty blocks used in the previous levels of the analysis,
791 number_of_freeblk = tb->cur_blknum can be non-zero if a schedule occurs
792 after empty blocks are acquired, and the balancing analysis is
793 then restarted, amount_needed is the number needed by this level
794 (h) of the balancing analysis.
796 Note that for systems with many processes writing, it would be
797 more layout optimal to calculate the total number needed by all
798 levels and then to run reiserfs_new_blocks to get all of them at once. */
800 /* Initiate number_of_freeblk to the amount acquired prior to the restart of
801 the analysis or 0 if not restarted, then subtract the amount needed
802 by all of the levels of the tree below h. */
803 /* blknum includes S[h], so we subtract 1 in this calculation */
806 number_of_freeblk -=
810 /* Allocate missing empty blocks. */
811 /* if Sh == 0 then we are getting a new root */
813 /* Amount_needed = the amount that we need more than the amount that we have. */
819 /* No need to check quota - is not allocated for blocks used for formatted nodes */
824 /* for each blocknumber we just got, get a buffer and stick it on FEB */
836 new_bh);
838 /* Put empty buffers into the array. */
844 }
850 }
852 /* Get free space of the left neighbor, which is stored in the parent
853 * node of the left neighbor. */
855 {
868 }
871 }
873 /* Get free space of the right neighbor,
874 * which is stored in the parent node of the right neighbor.
875 */
877 {
890 }
894 }
896 /* Check whether left neighbor is in memory. */
898 {
901 b_blocknr_t left_neighbor_blocknr;
904 /* Father of the left neighbor does not exist. */
908 /* Calculate father of the node to be balanced. */
919 /* Get position of the pointer to the left neighbor into the left father. */
922 /* Get left neighbor block number. */
923 left_neighbor_blocknr =
925 /* Look for the left neighbor in the cache. */
933 }
936 }
942 {
943 // call item specific function for this key
945 }
947 /* Calculate far left/right parent of the left/right neighbor of the current node, that
948 * is calculate the left/right (FL[h]/FR[h]) neighbor of the parent F[h].
949 * Calculate left/right common parent of the current node and L[h]/R[h].
950 * Calculate left/right delimiting key position.
951 * Returns: PATH_INCORRECT - path in the tree is not correct;
952 SCHEDULE_OCCURRED - schedule occurred while the function worked;
953 * CARRY_ON - schedule didn't occur while the function worked;
954 */
959 {
969 /* Starting from F[h] go upwards in the tree, and look for the common
970 ancestor of F[h], and its neighbor l/r, that should be obtained. */
978 /* Check whether parent of the current buffer in the path is really parent in the tree. */
982 /* Check whether position in the parent is correct. */
988 /* Check whether parent at the path really points to the child. */
992 /* Return delimiting key if position in the parent is not equal to first/last one. */
998 /*(*pcom_father = parent)->b_count++; */
1000 }
1001 }
1003 /* if we are in the root of the tree, then there is no common father */
1005 /* Check whether first buffer in the path is the root of the tree. */
1012 }
1014 }
1020 /* Check whether the common parent is locked. */
1024 /* Release the write lock while the buffer is busy */
1031 }
1032 }
1034 /* So, we got common parent of the current node and its left/right neighbor.
1035 Now we are geting the parent of the left/right neighbor. */
1037 /* Form key to get parent of the left/right neighbor. */
1042 position -
1045 position)));
1053 // path is released
1060 }
1072 }
1074 /* Get parents of neighbors of node in the path(S[path_offset]) and common parents of
1075 * S[path_offset] and L[path_offset]/R[path_offset]: F[path_offset], FL[path_offset],
1076 * FR[path_offset], CFL[path_offset], CFR[path_offset].
1077 * Calculate numbers of left and right delimiting keys position: lkey[path_offset], rkey[path_offset].
1078 * Returns: SCHEDULE_OCCURRED - schedule occurred while the function worked;
1079 * CARRY_ON - schedule didn't occur while the function worked;
1080 */
1082 {
1085 ret,
1089 /* Current node is the root of the tree or will be root of the tree */
1091 /* The root can not have parents.
1092 Release nodes which previously were obtained as parents of the current node neighbors. */
1102 }
1104 /* Get parent FL[path_offset] of L[path_offset]. */
1107 /* Current node is not the first child of its parent. */
1114 /* Calculate current parent of L[path_offset], which is the left neighbor of the current node.
1115 Calculate current common parent of L[path_offset] and the current node. Note that
1116 CFL[path_offset] not equal FL[path_offset] and CFL[path_offset] not equal F[path_offset].
1117 Calculate lkey[path_offset]. */
1122 }
1133 /* Get parent FR[h] of R[h]. */
1135 /* Current node is the last child of F[h]. FR[h] != F[h]. */
1137 /* Calculate current parent of R[h], which is the right neighbor of F[h].
1138 Calculate current common parent of R[h] and current node. Note that CFR[h]
1139 not equal FR[path_offset] and CFR[h] not equal F[h]. */
1145 /* Current node is not the last child of its parent F[h]. */
1151 }
1154 /* New initialization of FR[path_offset]. */
1158 /* New initialization of CFR[path_offset]. */
1166 }
1168 /* it is possible to remove node as result of shiftings to
1169 neighbors even when we insert or paste item. */
1172 {
1183 /* shifting may merge items which might save space */
1184 -
1185 ((!h
1187 -
1191 /* node can not be removed */
1199 }
1200 }
1203 }
1205 /* Check whether current node S[h] is balanced when increasing its size by
1206 * Inserting or Pasting.
1207 * Calculate parameters for balancing for current level h.
1208 * Parameters:
1209 * tb tree_balance structure;
1210 * h current level of the node;
1211 * inum item number in S[h];
1212 * mode i - insert, p - paste;
1213 * Returns: 1 - schedule occurred;
1214 * 0 - balancing for higher levels needed;
1215 * -1 - no balancing for higher levels needed;
1216 * -2 - no disk space.
1217 */
1218 /* ip means Inserting or Pasting */
1220 {
1223 is negative if bytes are deleted) buffer which
1224 contains node being balanced. The mnemonic is
1225 that the attempted change in node space used level
1226 is levbytes bytes. */
1227 ret;
1231 /* nver is short for number of vertixes, and lnver is the number if
1232 we shift to the left, rnver is the number if we shift to the
1233 right, and lrnver is the number if we shift in both directions.
1234 The goal is to minimize first the number of vertixes, and second,
1235 the number of vertixes whose contents are changed by shifting,
1236 and third the number of uncached vertixes whose contents are
1237 changed by shifting and must be read from disk. */
1240 /* used at leaf level only, S0 = S[0] is the node being balanced,
1241 sInum [ I = 0,1,2 ] is the number of items that will
1242 remain in node SI after balancing. S1 and S2 are new
1243 nodes that might be created. */
1245 /* we perform 8 calls to get_num_ver(). For each call we calculate five parameters.
1246 where 4th parameter is s1bytes and 5th - s2bytes
1247 */
1249 0,1 - do not shift and do not shift but bottle
1250 2 - shift only whole item to left
1251 3 - shift to left and bottle as much as possible
1252 4,5 - shift to right (whole items and as much as possible
1253 6,7 - shift to both directions (whole items and as much as possible)
1254 */
1256 /* Sh is the node whose balance is currently being checked */
1262 /* Calculate balance parameters for creating new root. */
1278 }
1279 }
1286 /* get free space of neighbors */
1291 NO_BALANCING_NEEDED)
1292 /* and new item fits into node S[h] without any shifting */
1297 /*
1298 determine maximal number of items we can shift to the left neighbor (in tb structure)
1299 and the maximal number of bytes that can flow to the left neighbor
1300 from the left most liquid item that cannot be shifted from S[0] entirely (returned value)
1301 */
1304 /*
1305 determine maximal number of items we can shift to the right neighbor (in tb structure)
1306 and the maximal number of bytes that can flow to the right neighbor
1307 from the right most liquid item that cannot be shifted from S[0] entirely (returned value)
1308 */
1311 /* all contents of internal node S[h] can be moved into its
1312 neighbors, S[h] will be removed after balancing */
1316 /* Since we are working on internal nodes, and our internal
1317 nodes have fixed size entries, then we can balance by the
1318 number of items rather than the space they consume. In this
1319 routine we set the left node equal to the right node,
1320 allowing a difference of less than or equal to 1 child
1321 pointer. */
1322 to_r =
1329 }
1331 /* this checks balance condition, that any two neighboring nodes can not fit in one node */
1340 /* all contents of S[0] can be moved into its neighbors
1341 S[0] will be removed after balancing. */
1345 /* why do we perform this check here rather than earlier??
1346 Answer: we can win 1 node in some cases above. Moreover we
1347 checked it above, when we checked, that S[0] is not removable
1348 in principle */
1354 }
1356 {
1358 /*
1359 * regular overflowing of the node
1360 */
1362 /* get_num_ver works in 2 modes (FLOW & NO_FLOW)
1363 lpar, rpar - number of items we can shift to left/right neighbor (including splitting item)
1364 nset, lset, rset, lrset - shows, whether flowing items give better packing
1365 */
1366 #define FLOW 1
1369 /* we choose one the following */
1370 #define NOTHING_SHIFT_NO_FLOW 0
1371 #define NOTHING_SHIFT_FLOW 5
1372 #define LEFT_SHIFT_NO_FLOW 10
1373 #define LEFT_SHIFT_FLOW 15
1374 #define RIGHT_SHIFT_NO_FLOW 20
1375 #define RIGHT_SHIFT_FLOW 25
1376 #define LR_SHIFT_NO_FLOW 30
1377 #define LR_SHIFT_FLOW 35
1382 /* calculate number of blocks S[h] must be split into when
1383 nothing is shifted to the neighbors,
1384 as well as number of items in each part of the split node (s012 numbers),
1385 and number of bytes (s1bytes) of the shared drop which flow to S1 if any */
1394 /* note, that in this case we try to bottle between S[0] and S1 (S1 - the first new node) */
1400 }
1402 /* calculate number of blocks S[h] must be split into when
1403 l_shift_num first items and l_shift_bytes of the right most
1404 liquid item to be shifted are shifted to the left neighbor,
1405 as well as number of items in each part of the splitted node (s012 numbers),
1406 and number of bytes (s1bytes) of the shared drop which flow to S1 if any
1407 */
1417 lpar -
1423 }
1425 /* calculate number of blocks S[h] must be split into when
1426 r_shift_num first items and r_shift_bytes of the left most
1427 liquid item to be shifted are shifted to the right neighbor,
1428 as well as number of items in each part of the splitted node (s012 numbers),
1429 and number of bytes (s1bytes) of the shared drop which flow to S1 if any
1430 */
1436 rbytes !=
1452 }
1454 /* calculate number of blocks S[h] must be split into when
1455 items are shifted in both directions,
1456 as well as number of items in each part of the splitted node (s012 numbers),
1457 and number of bytes (s1bytes) of the shared drop which flow to S1 if any
1458 */
1465 rbytes !=
1473 lpar -
1482 }
1484 /* Our general shifting strategy is:
1485 1) to minimized number of new nodes;
1486 2) to minimized number of neighbors involved in shifting;
1487 3) to minimized number of disk reads; */
1489 /* we can win TWO or ONE nodes by shifting in both directions */
1500 else
1509 }
1511 /* if shifting doesn't lead to better packing then don't shift */
1516 }
1518 /* now we know that for better packing shifting in only one
1519 direction either to the left or to the right is required */
1521 /* if shifting to the left is better than shifting to the right */
1523 SET_PAR_SHIFT_LEFT;
1525 }
1527 /* if shifting to the right is better than shifting to the left */
1529 SET_PAR_SHIFT_RIGHT;
1531 }
1533 /* now shifting in either direction gives the same number
1534 of nodes and we can make use of the cached neighbors */
1536 SET_PAR_SHIFT_LEFT;
1538 }
1540 /* shift to the right independently on whether the right neighbor in cache or not */
1541 SET_PAR_SHIFT_RIGHT;
1543 }
1544 }
1546 /* Check whether current node S[h] is balanced when Decreasing its size by
1547 * Deleting or Cutting for INTERNAL node of S+tree.
1548 * Calculate parameters for balancing for current level h.
1549 * Parameters:
1550 * tb tree_balance structure;
1551 * h current level of the node;
1552 * inum item number in S[h];
1553 * mode i - insert, p - paste;
1554 * Returns: 1 - schedule occurred;
1555 * 0 - balancing for higher levels needed;
1556 * -1 - no balancing for higher levels needed;
1557 * -2 - no disk space.
1558 *
1559 * Note: Items of internal nodes have fixed size, so the balance condition for
1560 * the internal part of S+tree is as for the B-trees.
1561 */
1563 {
1566 /* Sh is the node whose balance is currently being checked,
1567 and Fh is its father. */
1577 /* using tb->insert_size[h], which is negative in this case, create_virtual_node calculates: */
1578 /* new_nr_item = number of items node would have if operation is */
1579 /* performed without balancing (new_nr_item); */
1586 }
1587 /* new_nr_item == 0.
1588 * Current root will be deleted resulting in
1589 * decrementing the tree height. */
1592 }
1597 /* get free space of neighbors */
1601 /* determine maximal number of items we can fit into neighbors */
1606 * In this case we balance only if it leads to better packing. */
1608 * which is impossible with greater values of new_nr_item. */
1610 /* All contents of S[h] can be moved to L[h]. */
1614 order_L =
1617 h)) ==
1624 }
1627 /* All contents of S[h] can be moved to R[h]. */
1631 order_R =
1634 h)) ==
1641 }
1642 }
1645 /* All contents of S[h] can be moved to the neighbors (L[h] & R[h]). */
1648 to_r =
1655 }
1657 /* Balancing does not lead to better packing. */
1660 }
1662 /* Current node contain insufficient number of items. Balancing is required. */
1663 /* Check whether we can merge S[h] with left neighbor. */
1670 order_L =
1673 h)) ==
1676 KEY_SIZE);
1679 }
1681 /* Check whether we can merge S[h] with right neighbor. */
1686 order_R =
1691 KEY_SIZE);
1694 }
1696 /* All contents of S[h] can be moved to the neighbors (L[h] & R[h]). */
1700 to_r =
1707 }
1709 /* For internal nodes try to borrow item from a neighbor */
1712 /* Borrow one or two items from caching neighbor */
1716 from_l =
1721 }
1727 }
1729 /* Check whether current node S[h] is balanced when Decreasing its size by
1730 * Deleting or Truncating for LEAF node of S+tree.
1731 * Calculate parameters for balancing for current level h.
1732 * Parameters:
1733 * tb tree_balance structure;
1734 * h current level of the node;
1735 * inum item number in S[h];
1736 * mode i - insert, p - paste;
1737 * Returns: 1 - schedule occurred;
1738 * 0 - balancing for higher levels needed;
1739 * -1 - no balancing for higher levels needed;
1740 * -2 - no disk space.
1741 */
1743 {
1746 /* Number of bytes that must be deleted from
1747 (value is negative if bytes are deleted) buffer which
1748 contains node being balanced. The mnemonic is that the
1749 attempted change in node space used level is levbytes bytes. */
1751 /* the maximal item size */
1753 /* S0 is the node whose balance is currently being checked,
1754 and F0 is its father. */
1772 }
1777 /* get free space of neighbors */
1783 /* if 3 leaves can be merge to one, set parameters and return */
1787 /* determine maximal number of items we can shift to the left/right neighbor
1788 and the maximal number of bytes that can flow to the left/right neighbor
1789 from the left/right most liquid item that cannot be shifted from S[0] entirely
1790 */
1794 /* check whether we can merge S with left neighbor. */
1796 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 */
1802 /* set parameter to merge S[0] with its left neighbor */
1805 }
1807 /* check whether we can merge S[0] with right neighbor. */
1811 }
1813 /* All contents of S[0] can be moved to the neighbors (L[0] & R[0]). Set parameters and return */
1817 /* Balancing is not required. */
1821 }
1823 /* Check whether current node S[h] is balanced when Decreasing its size by
1824 * Deleting or Cutting.
1825 * Calculate parameters for balancing for current level h.
1826 * Parameters:
1827 * tb tree_balance structure;
1828 * h current level of the node;
1829 * inum item number in S[h];
1830 * mode d - delete, c - cut.
1831 * Returns: 1 - schedule occurred;
1832 * 0 - balancing for higher levels needed;
1833 * -1 - no balancing for higher levels needed;
1834 * -2 - no disk space.
1835 */
1837 {
1843 else
1845 }
1847 /* Check whether current node S[h] is balanced.
1848 * Calculate parameters for balancing for current level h.
1849 * Parameters:
1850 *
1851 * tb tree_balance structure:
1852 *
1853 * tb is a large structure that must be read about in the header file
1854 * at the same time as this procedure if the reader is to successfully
1855 * understand this procedure
1856 *
1857 * h current level of the node;
1858 * inum item number in S[h];
1859 * mode i - insert, p - paste, d - delete, c - cut.
1860 * Returns: 1 - schedule occurred;
1861 * 0 - balancing for higher levels needed;
1862 * -1 - no balancing for higher levels needed;
1863 * -2 - no disk space.
1864 */
1871 {
1886 /* Calculate balance parameters when size of node is increasing. */
1889 /* Calculate balance parameters when size of node is decreasing. */
1891 }
1893 /* Check whether parent at the path is the really parent of the current node.*/
1895 {
1901 /* We are in the root or in the new root. */
1909 /* Root is not changed. */
1913 }
1915 }
1928 /* Parent in the path is not parent of the current node in the tree. */
1937 }
1940 }
1942 /* Using lnum[h] and rnum[h] we should determine what neighbors
1943 * of S[h] we
1944 * need in order to balance S[h], and get them if necessary.
1945 * Returns: SCHEDULE_OCCURRED - schedule occurred while the function worked;
1946 * CARRY_ON - schedule didn't occur while the function worked;
1947 */
1949 {
1959 /* We need left neighbor to balance S[h]. */
1967 child_position =
1981 }
1996 }
1998 /* We need right neighbor to balance S[path_offset]. */
2005 path_offset) >=
2009 child_position =
2021 }
2033 }
2035 }
2038 {
2043 #define MIN_NAME_LEN 1
2053 }
2055 /* maybe we should fail balancing we are going to perform when kmalloc
2056 fails several times. But now it will loop until kmalloc gets
2057 required memory */
2059 {
2067 /* we have to allocate more memory for virtual node */
2069 /* free memory allocated before */
2071 /* this is not needed if kfree is atomic */
2073 }
2075 /* virtual node requires now more memory */
2078 /* get memory for virtual item */
2081 /* getting memory with GFP_KERNEL priority may involve
2082 balancing now (due to indirect_to_direct conversion on
2083 dcache shrinking). So, release path and collected
2084 resources here */
2089 }
2093 }
2096 }
2102 }
2104 #ifdef CONFIG_REISERFS_CHECK
2108 {
2113 "reference counter for buffer %s[%d] "
2140 }
2141 }
2142 #else
2146 {;
2147 }
2148 #endif
2151 {
2153 }
2156 {
2158 #ifdef CONFIG_REISERFS_CHECK
2160 #endif
2170 /* if I understand correctly, we can only be sure the last buffer
2171 ** in the path is in the tree --clm
2172 */
2173 #ifdef CONFIG_REISERFS_CHECK
2177 PATH_OFFSET_PBUFFER
2182 #endif
2184 PATH_OFFSET_PBUFFER
2186 i))) {
2187 locked =
2189 i);
2190 }
2191 }
2192 }
2195 i++) {
2206 }
2215 }
2224 }
2226 }
2237 }
2246 }
2255 }
2256 }
2257 }
2258 /* as far as I can tell, this is not required. The FEB list seems
2259 ** to be full of newly allocated nodes, which will never be locked,
2260 ** dirty, or anything else.
2261 ** To be safe, I'm putting in the checks and waits in. For the moment,
2262 ** they are needed to keep the code in journal.c from complaining
2263 ** about the buffer. That code is inside CONFIG_REISERFS_CHECK as well.
2264 ** --clm
2265 */
2271 }
2272 }
2275 #ifdef CONFIG_REISERFS_CHECK
2276 repeat_counter++;
2279 "too many iterations waiting "
2280 "for buffer to unlock "
2283 /* Don't loop forever. Try to recover from possible error. */
2287 }
2288 #endif
2294 }
2299 }
2301 /* Prepare for balancing, that is
2302 * get all necessary parents, and neighbors;
2303 * analyze what and where should be moved;
2304 * get sufficient number of new nodes;
2305 * Balancing will start only after all resources will be collected at a time.
2306 *
2307 * When ported to SMP kernels, only at the last moment after all needed nodes
2308 * are collected in cache, will the resources be locked using the usual
2309 * textbook ordered lock acquisition algorithms. Note that ensuring that
2310 * this code neither write locks what it does not need to write lock nor locks out of order
2311 * will be a pain in the butt that could have been avoided. Grumble grumble. -Hans
2312 *
2313 * fix is meant in the sense of render unchanging
2314 *
2315 * Latency might be improved by first gathering a list of what buffers are needed
2316 * and then getting as many of them in parallel as possible? -Hans
2317 *
2318 * Parameters:
2319 * op_mode i - insert, d - delete, c - cut (truncate), p - paste (append)
2320 * tb tree_balance structure;
2321 * inum item number in S[h];
2322 * pos_in_item - comment this if you can
2323 * ins_ih item head of item being inserted
2324 * data inserted item or data to be pasted
2325 * Returns: 1 - schedule occurred while the function worked;
2326 * 0 - schedule didn't occur while the function worked;
2327 * -1 - if no_disk_space
2328 */
2332 {
2336 /* we set wait_tb_buffers_run when we have to restore any dirty bits cleared
2337 ** during wait_tb_buffers_run
2338 */
2348 /* we prepare and log the super here so it will already be in the
2349 ** transaction when do_balance needs to change it.
2350 ** This way do_balance won't have to schedule when trying to prepare
2351 ** the super for logging
2352 */
2360 /* if it possible in indirect_to_direct conversion */
2367 }
2368 #ifdef CONFIG_REISERFS_CHECK
2373 }
2377 "not uptodate at the beginning of fix_nodes "
2381 /* Check parameters. */
2386 "item number %d (in S0 - %d) in case "
2396 "item number(%d); mode = %c "
2400 }
2405 }
2406 #endif
2409 // FIXME: maybe -ENOMEM when tb->vn_buf == 0? Now just repeat
2412 /* Starting from the leaf level; for all levels h of the tree. */
2422 /* No balancing for higher levels needed. */
2428 /* ok, analysis and resource gathering are complete */
2430 }
2432 }
2438 /* No disk space, or schedule occurred and analysis may be
2439 * invalid and needs to be redone. */
2445 /* We have a positive insert size but no nodes exist on this
2446 level, this means that we are creating a new root. */
2455 /* The tree needs to be grown, so this node S[h]
2456 which is the root node is split into two nodes,
2457 and a new node (S[h+1]) will be created to
2458 become the root node. */
2466 DC_SIZE;
2472 }
2482 }
2486 }
2488 repeat:
2489 // fix_nodes was unable to perform its calculation due to
2490 // filesystem got changed under us, lack of free disk space or i/o
2491 // failure. If the first is the case - the search will be
2492 // repeated. For now - free all resources acquired so far except
2493 // for the new allocated nodes
2494 {
2497 /* Release path buffers. */
2502 }
2503 /* brelse all resources collected for balancing */
2515 tb->
2518 tb->
2520 }
2535 }
2540 reiserfs_restore_prepared_buffer
2542 }
2543 }
2545 }
2547 }
2549 /* Anatoly will probably forgive me renaming tb to tb. I just
2550 wanted to make lines shorter */
2552 {
2555 /* Release path buffers. */
2558 /* brelse all resources collected for balancing */
2573 }
2575 /* deal with list of allocated (used and unused) nodes */
2579 /* de-allocated block which was not used by balancing and
2580 bforget about buffer for it */
2584 }
2586 /* release used as new nodes including a new root */
2588 }
2589 }
2593 }