Lines Matching defs:need
107 * extents need to be actually allocated. To get around this, we explicitly set
110 * For each AG, we need to reserve enough blocks to replenish a totally empty
617 * 2 resulting free entries, need to add one.
1145 * free space, we need to clear out the OWN_AG rmap.
2163 * In all cases we need to insert the new freespace in the by-size tree.
2222 * Find the length of the longest extent in an AG. The 'need' parameter
2223 * specifies how much space we're going to need for the AGFL and the
2230 xfs_extlen_t need,
2239 if (need > pag->pagf_flcount)
2240 delta = need - pag->pagf_flcount;
2400 * However, we need to use these same checks to catch agfl count corruptions
2402 * way, we need to reset the agfl and warn the user.
2641 xfs_extlen_t need; /* total blocks needed in freelist */
2669 need = xfs_alloc_min_freelist(mp, pag);
2670 if (!xfs_alloc_space_available(args, need, alloc_flags |
2693 need = xfs_alloc_min_freelist(mp, pag);
2694 if (!xfs_alloc_space_available(args, need, alloc_flags))
2712 * and hence need to be released manually. If they have been joined to
2718 * anything other than extra overhead when we need to put more blocks
2737 pag->pagf_flcount > need) {
2759 while (pag->pagf_flcount < need) {
2761 targs.maxlen = need - pag->pagf_flcount;
3058 * Both agf_seqno and agf_length need to validated before anything else
3452 * you need an exact sized allocation without locality constraints, this is the