Lines Matching defs:leaf
1155 s8 *leaf;
1165 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);
1179 /* check if the starting leaf indicates that anything
1182 if (leaf[word] == NOFREE)
1194 * single leaf may describe the free space of multiple dmap
1227 /* does the leaf describe any free space ?
1229 if (leaf[word] < BUDMIN)
1233 * by this leaf.
1236 min_t(int, leaf[word], NLSTOL2BSZ(nwords));
1260 * starting with the dmap leaf that covers the hint, we'll
1286 s8 *leaf;
1293 leaf = dp->tree.stree + le32_to_cpu(dp->tree.leafidx);
1305 /* does the leaf describe sufficient free space ?
1307 if (leaf[word] < l2nb)
1320 if (leaf[word] < BUDMIN)
1356 * the subtree is searched to find the leftmost leaf that
1357 * has free space. once we have made it to the leaf, we
1359 * corresponding to this leaf. we continue down the dmap control
1484 * the subtree to find the leftmost leaf that describes this
1503 * that corresponds to this leaf.
1785 * dbFindLeaf() returns the index of the leaf at which
1806 * the dmap control page (i.e. the leaf) at which free
2033 * returns the index of the leaf at which free space was found.
2042 * to the leaf at which free space was found.
2211 s8 *leaf;
2214 leaf = dp->tree.stree + LEAFIND;
2230 * updating the leaf corresponding to the dmap word. a single pass
2234 * will be updated. a single leaf may describe the free space of
2254 /* update the leaf for this dmap word. in addition
2255 * to setting the leaf value to the binary buddy max
2280 if (leaf[word] < BUDMIN) {
2282 "leaf page corrupt\n");
2286 /* determine what the leaf value should be
2289 * of bits currently described by this leaf.
2291 size = min_t(int, leaf[word],
2294 /* update the leaf to reflect the allocation.
2295 * in addition to setting the leaf value to
2375 * the leaf corresponding to the dmap word. a single pass will be used
2379 * single leaf may describe the free space of multiple dmap words,
2383 * dbJoin() is used to update leaf values and will join the binary
2384 * buddy system of the leaves if the new leaf values indicate this
2404 /* update the leaf for this dmap word.
2428 /* determine what the leaf value should be
2431 * of bits that can be described by this leaf.
2438 /* update the leaf.
2507 * is respresented by a single leaf of the current dmapctl
2508 * and the leaf will be updated with this value, possibly
2560 /* determine the leaf number corresponding to the block and
2566 /* save the current leaf value and the current root level (i.e.
2573 * if so, update the leaf to reflect the new leaf value using
2575 * the leaf with the new value. in addition to updating the
2576 * leaf, dbSplit() will also split the binary buddy system of
2580 * the dmapctl tree as required by the new leaf value.
2673 * FUNCTION: update the leaf of a dmtree with a new value, splitting
2674 * the leaf from the binary buddy system of the dmtree's
2678 * tp - pointer to the tree containing the leaf.
2679 * leafno - the number of the leaf to be updated.
2680 * splitsz - the size the binary buddy system starting at the leaf
2682 * newval - the new value for the leaf.
2692 s8 *leaf = tp->dmt_stree + le32_to_cpu(tp->dmt_leafidx);
2694 /* check if the leaf needs to be split.
2696 if (leaf[leafno] > tp->dmt_budmin) {
2698 * at the specified leaf until we reach the specified
2702 cursz = leaf[leafno] - 1;
2708 /* update the buddy's leaf with its new value.
2719 /* adjust the dmap tree to reflect the specified leaf's new
2730 * that hold a specified leaf until the specified leaf
2746 * tp - pointer to the tree containing the leaf.
2747 * leafno - the number of the leaf to be updated.
2757 s8 *leaf = tp->dmt_stree + le32_to_cpu(tp->dmt_leafidx);
2759 /* leaf should be part (not first part) of a binary
2762 assert(leaf[leafno] == NOFREE);
2764 /* the back split is accomplished by iteratively finding the leaf
2765 * that starts the buddy system that contains the specified leaf and
2767 * the specified leaf becomes the start of a buddy system.
2769 * determine maximum possible l2 size for the specified leaf.
2777 * the buddy system that contains the specified leaf.
2783 while (leaf[leafno] == NOFREE) {
2784 /* find the leftmost buddy leaf.
2799 if (leaf[bud] != NOFREE) {
2800 /* split the leaf at the start of the
2803 cursz = leaf[bud] - 1;
2810 if (leaf[leafno] != size) {
2811 jfs_err("JFS: wrong leaf value in dbBackSplit");
2821 * FUNCTION: update the leaf of a dmtree with a new value, joining
2822 * the leaf with other leaves of the dmtree into a multi-leaf
2826 * tp - pointer to the tree containing the leaf.
2827 * leafno - the number of the leaf to be updated.
2828 * newval - the new value for the leaf.
2835 s8 *leaf;
2837 /* can the new leaf value require a join with other leaves ?
2842 leaf = tp->dmt_stree + le32_to_cpu(tp->dmt_leafidx);
2844 /* try to join the specified leaf into a large binary
2846 * the specified leafno with its buddy (leaf) at new value.
2847 * if the join occurs, we attempt to join the left leaf
2862 /* get the buddy leaf.
2866 /* if the leaf's new value is greater than its
2869 if (newval > leaf[buddy])
2873 if (newval < leaf[buddy])
2903 /* update the leaf value.
2914 * FUNCTION: update a leaf of a dmtree with a new value, adjusting
2915 * the dmtree, as required, to reflect the new leaf value.
2921 * leafno - the number of the leaf to be updated.
2922 * newval - the new value for the leaf.
2933 /* pick up the index of the leaf for this leafno.
2953 /* get the index of the first leaf of the 4 leaf
2954 * group containing the specified leaf (leafno).
2958 /* get the index of the parent of this 4 leaf group.
2976 /* parent becomes leaf for next go-round.
2987 * the index of a leaf describing the free blocks if
2991 * proceeds down the tree to the leftmost leaf with sufficient
2997 * leafidx - return pointer to be set to the index of the leaf
3020 * starting at the next level for the leftmost leaf that
3044 /* set the return to the leftmost leaf describing sufficient
3329 * updating the leaf corresponding to the dmap word. a single pass
3333 * will be updated. a single leaf may describe the free space of
3590 * initialize corresponding parent L0 leaf
3629 * initialize corresponding parent L1 leaf
3653 * initialize corresponding parent L2 leaf
3751 * at agheight level height (from leaf) with agwidth number of nodes
3902 /* init each leaf from corresponding wmap word:
3903 * note: leaf is set to NOFREE(-1) if all blocks of corresponding
3923 * configure binary buddy system at the leaf level, then
3924 * bubble up the values of the leaf nodes up the tree.
3928 * l2leaves- Number of leaf nodes as a power of 2
3929 * l2min - Number of blocks that can be covered by a leaf
3946 * configure the leaf levevl into binary buddy system
3951 * the combination will result in the left-most buddy leaf having
3979 * Starting at the leaf node level, the four nodes described by
4010 { /* start leaf index not covered by range */