Lines Matching refs:left
15 * will shift to left/right neighbor, or to a new node, where new item
23 * have to have if we do not any shiftings, if we shift to left/right
192 * shifted to left neighbor
237 /* first item may be merge with last item in left neighbor */
367 * from - number of items, which are shifted to left neighbor entirely
370 * which are shifted to left neighbor
613 * lbytes number of bytes which flow to the left neighbor from the
649 * check if node disappears if we shift tb->lnum[0] items to left
660 * number of items that will be shifted to left (right) neighbor
727 * somewhere at the left side should exist first
739 * we might check that left neighbor exists
912 * Get free space of the left neighbor, which is stored in the parent
913 * node of the left neighbor.
958 /* Check whether left neighbor is in memory. */
961 struct buffer_head *father, *left;
966 /* Father of the left neighbor does not exist. */
982 * Get position of the pointer to the left neighbor
983 * into the left father.
987 /* Get left neighbor block number. */
990 /* Look for the left neighbor in the cache. */
991 if ((left = sb_find_get_block(sb, left_neighbor_blocknr))) {
993 RFALSE(buffer_uptodate(left) && !B_IS_IN_TREE(left),
994 "vs-8170: left neighbor (%b %z) is not in the tree",
995 left, left);
996 put_bh(left);
1013 * Calculate far left/right parent of the left/right neighbor of the
1014 * current node, that is calculate the left/right (FL[h]/FR[h]) neighbor
1016 * Calculate left/right common parent of the current node and L[h]/R[h].
1017 * Calculate left/right delimiting key position.
1121 * left/right neighbor. Now we are getting the parent of the
1122 * left/right neighbor.
1125 /* Form key to get parent of the left/right neighbor. */
1167 * Calculate numbers of left and right delimiting keys position:
1210 * left neighbor of the current node. Calculate current
1340 * we shift to the left, rnver is the number if we shift to the
1363 * 2 - shift only whole item to left
1364 * 3 - shift to left and bottle as much as possible
1415 * determine maximal number of items we can shift to the left
1417 * that can flow to the left neighbor from the left most liquid
1441 * routine we set the left node equal to the right node,
1494 * lpar, rpar - number of items we can shift to left/right
1544 * most liquid item to be shifted are shifted to the left
1568 * r_shift_num first items and r_shift_bytes of the left most
1670 * direction either to the left or to the right is required
1674 * if shifting to the left is better than
1684 * shifting to the left
1845 /* Check whether we can merge S[h] with left neighbor. */
1977 * determine maximal number of items we can shift to the left/right
1979 * left/right neighbor from the left/right most liquid item that
1985 /* check whether we can merge S with left neighbor. */
1993 /* set parameter to merge S[0] with its left neighbor */
2163 /* We need left neighbor to balance S[h]. */
2196 "PAP-8290: invalid child size of left neighbor");