Lines Matching refs:value
98 static int cntlz(u32 value);
711 * size or requests that specify no hint value.
1318 * value.
1639 * minlen - minimum value of contiguous blocks
2048 * bits and adjust the block number with this value.
2070 * the dmap to change (i.e. the value of the root of the dmap's
2094 /* save the current value of the root (i.e. maximum free string)
2126 * change (i.e. the value of the root of the dmap's dmtree), this
2149 /* save the current value of the root (i.e. maximum free string)
2255 * to setting the leaf value to the binary buddy max
2286 /* determine what the leaf value should be
2295 * in addition to setting the leaf value to
2428 /* determine what the leaf value should be
2503 * on entry, this routine is provided with the new value of
2508 * and the leaf will be updated with this value, possibly
2516 * the new root value and the next dmap control page level to
2523 * newval - the new value of the lower level dmap or dmap control
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
2580 * the dmapctl tree as required by the new leaf value.
2623 * root value, so backout the changes to the
2673 * FUNCTION: update the leaf of a dmtree with a new value, splitting
2682 * newval - the new value for the leaf.
2708 /* update the buddy's leaf with its new value.
2720 * value.
2811 jfs_err("JFS: wrong leaf value in dbBackSplit");
2821 * FUNCTION: update the leaf of a dmtree with a new value, joining
2828 * newval - the new value for the leaf.
2837 /* can the new leaf value require a join with other leaves ?
2846 * the specified leafno with its buddy (leaf) at new value.
2848 * of the joined buddies with its buddy at new value + 1.
2850 * joined (does not have a value equal to the size of the
2855 * the new value.
2866 /* if the leaf's new value is greater than its
2867 * buddy's value, we join no more.
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.
2922 * newval - the new value for the leaf.
2940 /* is the current value the same as the old value ? if so,
2946 /* set the new value.
2950 /* bubble the new value up the tree as required.
2967 * parent's value, we're done.
2972 /* parent gets new value.
3057 * dmap bitmap word value.
3059 * this routine searches the bitmap value for (1 << l2nb) free
3060 * bits at (1 << l2nb) alignments within the value.
3063 * word - dmap bitmap word value.
3107 * cp - pointer to the 32-bit value.
3141 * value.
3144 * value - 32-bit value to be examined.
3163 * NAME: cntlz(u32 value)
3166 * value.
3169 * value - 32-bit value to be examined.
3174 static int cntlz(u32 value)
3178 for (n = 0; n < 32; n++, value <<= 1) {
3179 if (value & HIGHORDER)
3189 * FUNCTION: convert a block count to its log2 value. if the block
3212 /* determine the l2 value.
3310 /* save the current value of the root (i.e. maximum free string)
3981 * this maximum becomes the value of the parent node.
3992 /* set the value of the parent node as the maximum