Lines Matching defs:buddy
121 * buddy table
123 * table used for determining buddy sizes within characters of
126 * binary buddy of free bits within the character.
1351 * part) of a larger binary buddy system, causing the dmap
1409 * part) of a larger binary buddy system.
2042 * the freed blocks to become part of a larger binary buddy
2063 * of the binary buddy system described by the dmap's dmtree
2127 * to setting the leaf value to the binary buddy max
2210 * of the binary buddy system described by the dmap's dmtree
2256 * buddy system of the leaves if the new leaf values indicate this
2381 * causing a binary buddy system within the leaves to be
2449 * leaf, dbSplit() will also split the binary buddy system of
2452 * the binary buddy system of leaves and bubble new values up
2456 /* check if we are in the middle of a binary buddy
2460 * buddy system. if we are in the middle, back split
2462 * that it is at the front of a binary buddy system.
2504 * caused a larger binary buddy system
2524 * of the maximum free buddy system.
2529 "dbAdjCtl: the maximum free buddy is "
2548 * the leaf from the binary buddy system of the dmtree's
2554 * splitsz - the size the binary buddy system starting at the leaf
2571 /* the split occurs by cutting the buddy system in half
2574 * - 1 in l2) and the corresponding buddy size.
2582 /* update the buddy's leaf with its new value.
2586 /* on to the next size and buddy.
2603 * FUNCTION: back split the binary buddy system of dmtree leaves
2605 * starts its own binary buddy system.
2608 * of binary buddy systems and dbSplit() is used to accomplish
2616 * of a larger binary buddy system and a few exception cases
2634 * buddy system.
2639 * that starts the buddy system that contains the specified leaf and
2641 * the specified leaf becomes the start of a buddy system.
2650 * is the buddy size that we will start with as we search for
2651 * the buddy system that contains the specified leaf.
2658 /* find the leftmost buddy leaf.
2667 /* determine the buddy.
2671 /* check if this buddy is the start of the system.
2697 * binary buddy system, as required.
2708 int budsz, buddy;
2719 * buddy system. the join proceeds by attempting to join
2720 * the specified leafno with its buddy (leaf) at new value.
2722 * of the joined buddies with its buddy at new value + 1.
2723 * we continue to join until we find a buddy that cannot be
2728 * get the buddy size (number of words covered) of
2736 /* get the buddy leaf.
2738 buddy = leafno ^ budsz;
2741 * buddy's value, we join no more.
2743 if (newval > leaf[buddy])
2747 if (newval < leaf[buddy])
2750 /* check which (leafno or buddy) is the left buddy.
2751 * the left buddy gets to claim the blocks resulting
2753 * the left buddy is also eligable to participate in
2758 if (leafno < buddy) {
2759 /* leafno is the left buddy.
2761 dbAdjTree(tp, buddy, NOFREE);
2763 /* buddy is the left buddy and becomes
2767 leafno = buddy;
2919 * FUNCTION: find a specified number of binary buddy free bits within a
2966 * FUNCTION: determine the largest binary buddy string of free
2973 * largest binary buddy of free bits within a dmap word.
2980 * free buddy size is BUDMIN.
2986 * free buddy size is BUDMIN-1.
2991 /* not all free or half free. determine the free buddy
3778 /* build the dmap's binary buddy summary tree */
3786 * FUNCTION: initialize binary buddy summary tree of a dmap or dmapctl.
3791 * configure binary buddy system at the leaf level, then
3814 * configure the leaf levevl into binary buddy system
3816 * Try to combine buddies starting with a buddy size of 1
3817 * (i.e. two leaves). At a buddy size of 1 two buddy leaves
3819 * the combination will result in the left-most buddy leaf having
3822 * at the next higher buddy size (i.e. current size * 2) and
3824 * This continues until the maximum possible buddy combination
3829 /* get next buddy size == current buddy pair size */
3832 /* scan each adjacent buddy pair at current buddy size */
3896 /* build the dmap's binary buddy summary tree */