Lines Matching refs:maxlen
432 * If len hits maxlen it is left alone.
444 ASSERT(rlen <= args->maxlen);
445 if (args->prod <= 1 || rlen < args->mod || rlen == args->maxlen ||
458 ASSERT(rlen >= args->minlen && rlen <= args->maxlen);
818 acur->cur_len = args->maxlen;
828 * Perform an initial cntbt lookup to check for availability of maxlen
835 error = xfs_alloc_lookup_ge(acur->cnt, 0, args->maxlen, &i);
921 args->len = XFS_EXTLEN_MIN(lena, args->maxlen);
959 if (acur->diff == 0 && acur->len == args->maxlen)
1177 * Extent's length (returned in *len) will be between minlen and maxlen,
1253 args->len = XFS_AGBLOCK_MIN(tend, args->agbno + args->maxlen)
1493 * maxlen, go to the start of this block, and skip all those smaller
1533 * Extent's length (returned in len) will be between minlen and maxlen,
1566 * maxlen. If not, pick the last entry in the tree unless the tree is
1648 * Extent's length (returned in len) will be between minlen and maxlen,
1680 * Look for an entry >= maxlen+alignment-1 blocks.
1683 args->maxlen + args->alignment - 1, &i)))
1722 if (rlen >= args->maxlen)
1752 * by-size btree. Now we check to see if the space hits maxlen
1756 rlen = XFS_EXTLEN_MIN(args->maxlen, rlen);
1764 if (rlen < args->maxlen) {
1790 rlen = XFS_EXTLEN_MIN(args->maxlen, rlen);
1803 if (rlen == args->maxlen)
2354 * Clamp maxlen to the amount of free space available for the actual
2357 if (available < (int)args->maxlen && !(flags & XFS_ALLOC_FLAG_CHECK)) {
2358 args->maxlen = available;
2359 ASSERT(args->maxlen > 0);
2360 ASSERT(args->maxlen >= args->minlen);
2761 targs.maxlen = need - pag->pagf_flcount;
3291 if (args->maxlen > agsize)
3292 args->maxlen = agsize;
3297 ASSERT(args->maxlen > 0);
3303 ASSERT(args->minlen <= args->maxlen);
3309 args->minlen > args->maxlen || args->minlen > agsize ||
3413 ASSERT(args->len <= args->maxlen);