Lines Matching refs:value
98 static int cntlz(u32 value);
711 * size or requests that specify no hint value.
1250 * value.
1571 * minlen - minimum value of contiguous blocks
1980 * bits and adjust the block number with this value.
2002 * the dmap to change (i.e. the value of the root of the dmap's
2026 /* save the current value of the root (i.e. maximum free string)
2058 * change (i.e. the value of the root of the dmap's dmtree), this
2081 /* save the current value of the root (i.e. maximum free string)
2187 * to setting the leaf value to the binary buddy max
2218 /* determine what the leaf value should be
2227 * in addition to setting the leaf value to
2360 /* determine what the leaf value should be
2435 * on entry, this routine is provided with the new value of
2440 * and the leaf will be updated with this value, possibly
2448 * the new root value and the next dmap control page level to
2455 * newval - the new value of the lower level dmap or dmap control
2498 /* save the current leaf value and the current root level (i.e.
2505 * if so, update the leaf to reflect the new leaf value using
2507 * the leaf with the new value. in addition to updating the
2512 * the dmapctl tree as required by the new leaf value.
2559 * root value, so backout the changes to the
2609 * FUNCTION: update the leaf of a dmtree with a new value, splitting
2618 * newval - the new value for the leaf.
2644 /* update the buddy's leaf with its new value.
2656 * value.
2747 jfs_err("JFS: wrong leaf value in dbBackSplit");
2757 * FUNCTION: update the leaf of a dmtree with a new value, joining
2764 * newval - the new value for the leaf.
2773 /* can the new leaf value require a join with other leaves ?
2782 * the specified leafno with its buddy (leaf) at new value.
2784 * of the joined buddies with its buddy at new value + 1.
2786 * joined (does not have a value equal to the size of the
2791 * the new value.
2802 /* if the leaf's new value is greater than its
2803 * buddy's value, we join no more.
2839 /* update the leaf value.
2850 * FUNCTION: update a leaf of a dmtree with a new value, adjusting
2851 * the dmtree, as required, to reflect the new leaf value.
2858 * newval - the new value for the leaf.
2876 /* is the current value the same as the old value ? if so,
2882 /* set the new value.
2886 /* bubble the new value up the tree as required.
2903 * parent's value, we're done.
2908 /* parent gets new value.
2993 * dmap bitmap word value.
2995 * this routine searches the bitmap value for (1 << l2nb) free
2996 * bits at (1 << l2nb) alignments within the value.
2999 * word - dmap bitmap word value.
3043 * cp - pointer to the 32-bit value.
3077 * value.
3080 * value - 32-bit value to be examined.
3099 * NAME: cntlz(u32 value)
3102 * value.
3105 * value - 32-bit value to be examined.
3110 static int cntlz(u32 value)
3114 for (n = 0; n < 32; n++, value <<= 1) {
3115 if (value & HIGHORDER)
3125 * FUNCTION: convert a block count to its log2 value. if the block
3148 /* determine the l2 value.
3246 /* save the current value of the root (i.e. maximum free string)
3917 * this maximum becomes the value of the parent node.
3928 /* set the value of the parent node as the maximum