2018-06-06 02:42:14 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2007-07-11 01:09:12 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2006-2007 Silicon Graphics, Inc.
|
2014-04-22 21:11:51 +00:00
|
|
|
* Copyright (c) 2014 Christoph Hellwig.
|
2007-07-11 01:09:12 +00:00
|
|
|
* All Rights Reserved.
|
|
|
|
*/
|
|
|
|
#include "xfs.h"
|
2019-06-29 02:25:35 +00:00
|
|
|
#include "xfs_shared.h"
|
2013-10-22 23:51:50 +00:00
|
|
|
#include "xfs_format.h"
|
2013-10-22 23:50:10 +00:00
|
|
|
#include "xfs_log_format.h"
|
|
|
|
#include "xfs_trans_resv.h"
|
|
|
|
#include "xfs_mount.h"
|
2007-07-11 01:09:12 +00:00
|
|
|
#include "xfs_inode.h"
|
|
|
|
#include "xfs_bmap.h"
|
2023-02-12 22:14:55 +00:00
|
|
|
#include "xfs_bmap_util.h"
|
2007-07-11 01:09:12 +00:00
|
|
|
#include "xfs_alloc.h"
|
|
|
|
#include "xfs_mru_cache.h"
|
2009-12-14 23:14:59 +00:00
|
|
|
#include "xfs_trace.h"
|
2021-06-02 00:48:24 +00:00
|
|
|
#include "xfs_ag.h"
|
xfs: set up per-AG free space reservations
One unfortunate quirk of the reference count and reverse mapping
btrees -- they can expand in size when blocks are written to *other*
allocation groups if, say, one large extent becomes a lot of tiny
extents. Since we don't want to start throwing errors in the middle
of CoWing, we need to reserve some blocks to handle future expansion.
The transaction block reservation counters aren't sufficient here
because we have to have a reserve of blocks in every AG, not just
somewhere in the filesystem.
Therefore, create two per-AG block reservation pools. One feeds the
AGFL so that rmapbt expansion always succeeds, and the other feeds all
other metadata so that refcountbt expansion never fails.
Use the count of how many reserved blocks we need to have on hand to
create a virtual reservation in the AG. Through selective clamping of
the maximum length of allocation requests and of the length of the
longest free extent, we can make it look like there's less free space
in the AG unless the reservation owner is asking for blocks.
In other words, play some accounting tricks in-core to make sure that
we always have blocks available. On the plus side, there's nothing to
clean up if we crash, which is contrast to the strategy that the rough
draft used (actually removing extents from the freespace btrees).
Signed-off-by: Darrick J. Wong <darrick.wong@oracle.com>
Reviewed-by: Dave Chinner <dchinner@redhat.com>
Signed-off-by: Dave Chinner <david@fromorbit.com>
2016-09-19 00:30:52 +00:00
|
|
|
#include "xfs_ag_resv.h"
|
2018-07-12 05:26:14 +00:00
|
|
|
#include "xfs_trans.h"
|
2019-11-13 04:40:00 +00:00
|
|
|
#include "xfs_filestream.h"
|
2007-07-11 01:09:12 +00:00
|
|
|
|
2014-04-22 21:11:51 +00:00
|
|
|
struct xfs_fstrm_item {
|
|
|
|
struct xfs_mru_cache_elem mru;
|
2023-02-12 22:14:55 +00:00
|
|
|
struct xfs_perag *pag; /* AG in use for this directory */
|
2014-04-22 21:11:51 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
enum xfs_fstrm_alloc {
|
|
|
|
XFS_PICK_USERDATA = 1,
|
|
|
|
XFS_PICK_LOWSPACE = 2,
|
|
|
|
};
|
2007-07-11 01:09:12 +00:00
|
|
|
|
2014-04-22 21:11:51 +00:00
|
|
|
static void
|
|
|
|
xfs_fstrm_free_func(
|
2018-04-09 17:23:39 +00:00
|
|
|
void *data,
|
2014-04-22 21:11:51 +00:00
|
|
|
struct xfs_mru_cache_elem *mru)
|
|
|
|
{
|
|
|
|
struct xfs_fstrm_item *item =
|
|
|
|
container_of(mru, struct xfs_fstrm_item, mru);
|
2023-02-12 22:14:55 +00:00
|
|
|
struct xfs_perag *pag = item->pag;
|
2014-04-22 21:11:51 +00:00
|
|
|
|
2023-02-12 22:14:56 +00:00
|
|
|
trace_xfs_filestream_free(pag, mru->key);
|
2023-02-12 22:14:55 +00:00
|
|
|
atomic_dec(&pag->pagf_fstrms);
|
|
|
|
xfs_perag_rele(pag);
|
2014-04-22 21:11:51 +00:00
|
|
|
|
2024-01-15 22:59:43 +00:00
|
|
|
kfree(item);
|
2014-04-22 21:11:51 +00:00
|
|
|
}
|
|
|
|
|
2007-07-11 01:09:12 +00:00
|
|
|
/*
|
2023-02-12 22:14:56 +00:00
|
|
|
* Scan the AGs starting at start_agno looking for an AG that isn't in use and
|
|
|
|
* has at least minlen blocks free. If no AG is found to match the allocation
|
|
|
|
* requirements, pick the AG with the most free space in it.
|
2007-07-11 01:09:12 +00:00
|
|
|
*/
|
|
|
|
static int
|
2014-04-22 21:11:51 +00:00
|
|
|
xfs_filestream_pick_ag(
|
2023-02-12 22:14:56 +00:00
|
|
|
struct xfs_alloc_arg *args,
|
2023-02-12 22:14:56 +00:00
|
|
|
xfs_ino_t pino,
|
2023-02-12 22:14:56 +00:00
|
|
|
xfs_agnumber_t start_agno,
|
2014-04-22 21:11:51 +00:00
|
|
|
int flags,
|
2023-02-12 22:14:55 +00:00
|
|
|
xfs_extlen_t *longest)
|
2007-07-11 01:09:12 +00:00
|
|
|
{
|
2023-02-12 22:14:56 +00:00
|
|
|
struct xfs_mount *mp = args->mp;
|
2014-04-22 21:11:51 +00:00
|
|
|
struct xfs_perag *pag;
|
2023-02-12 22:14:55 +00:00
|
|
|
struct xfs_perag *max_pag = NULL;
|
2023-02-12 22:14:55 +00:00
|
|
|
xfs_extlen_t minlen = *longest;
|
2024-10-23 13:37:22 +00:00
|
|
|
xfs_extlen_t minfree, maxfree = 0;
|
2023-02-12 22:14:55 +00:00
|
|
|
xfs_agnumber_t agno;
|
2023-02-12 22:14:56 +00:00
|
|
|
bool first_pass = true;
|
2007-07-11 01:09:12 +00:00
|
|
|
|
|
|
|
/* 2% of an AG's blocks must be free for it to be chosen. */
|
|
|
|
minfree = mp->m_sb.sb_agblocks / 50;
|
|
|
|
|
2023-02-12 22:14:55 +00:00
|
|
|
restart:
|
|
|
|
for_each_perag_wrap(mp, start_agno, agno, pag) {
|
2024-10-23 13:37:23 +00:00
|
|
|
int err;
|
|
|
|
|
2023-02-12 22:14:56 +00:00
|
|
|
trace_xfs_filestream_scan(pag, pino);
|
2024-10-23 13:37:23 +00:00
|
|
|
|
2023-02-12 22:14:55 +00:00
|
|
|
*longest = 0;
|
|
|
|
err = xfs_bmap_longest_free_extent(pag, NULL, longest);
|
2023-02-12 22:14:55 +00:00
|
|
|
if (err) {
|
2024-10-23 13:37:23 +00:00
|
|
|
if (err == -EAGAIN) {
|
|
|
|
/* Couldn't lock the AGF, skip this AG. */
|
|
|
|
err = 0;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
xfs_perag_rele(pag);
|
|
|
|
if (max_pag)
|
|
|
|
xfs_perag_rele(max_pag);
|
|
|
|
return err;
|
2007-07-11 01:09:12 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Keep track of the AG with the most free blocks. */
|
|
|
|
if (pag->pagf_freeblks > maxfree) {
|
|
|
|
maxfree = pag->pagf_freeblks;
|
2023-02-12 22:14:55 +00:00
|
|
|
if (max_pag)
|
|
|
|
xfs_perag_rele(max_pag);
|
|
|
|
atomic_inc(&pag->pag_active_ref);
|
|
|
|
max_pag = pag;
|
2007-07-11 01:09:12 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The AG reference count does two things: it enforces mutual
|
|
|
|
* exclusion when examining the suitability of an AG in this
|
|
|
|
* loop, and it guards against two filestreams being established
|
|
|
|
* in the same AG as each other.
|
|
|
|
*/
|
2023-02-12 22:14:55 +00:00
|
|
|
if (atomic_inc_return(&pag->pagf_fstrms) <= 1) {
|
|
|
|
if (((minlen && *longest >= minlen) ||
|
|
|
|
(!minlen && pag->pagf_freeblks >= minfree)) &&
|
|
|
|
(!xfs_perag_prefers_metadata(pag) ||
|
|
|
|
!(flags & XFS_PICK_USERDATA) ||
|
|
|
|
(flags & XFS_PICK_LOWSPACE))) {
|
|
|
|
/* Break out, retaining the reference on the AG. */
|
2024-10-23 13:37:23 +00:00
|
|
|
if (max_pag)
|
|
|
|
xfs_perag_rele(max_pag);
|
|
|
|
goto done;
|
2023-02-12 22:14:55 +00:00
|
|
|
}
|
2007-07-11 01:09:12 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Drop the reference on this AG, it's not usable. */
|
2023-02-12 22:14:55 +00:00
|
|
|
atomic_dec(&pag->pagf_fstrms);
|
2023-02-12 22:14:55 +00:00
|
|
|
}
|
2007-07-11 01:09:12 +00:00
|
|
|
|
2024-10-23 13:37:23 +00:00
|
|
|
/*
|
|
|
|
* Allow a second pass to give xfs_bmap_longest_free_extent() another
|
|
|
|
* attempt at locking AGFs that it might have skipped over before we
|
|
|
|
* fail.
|
|
|
|
*/
|
|
|
|
if (first_pass) {
|
|
|
|
first_pass = false;
|
|
|
|
goto restart;
|
2023-02-12 22:14:55 +00:00
|
|
|
}
|
2007-07-11 01:09:12 +00:00
|
|
|
|
2024-10-23 13:37:23 +00:00
|
|
|
/*
|
|
|
|
* We must be low on data space, so run a final lowspace optimised
|
|
|
|
* selection pass if we haven't already.
|
|
|
|
*/
|
|
|
|
if (!(flags & XFS_PICK_LOWSPACE)) {
|
|
|
|
flags |= XFS_PICK_LOWSPACE;
|
|
|
|
goto restart;
|
|
|
|
}
|
2024-10-23 13:37:22 +00:00
|
|
|
|
2024-10-23 13:37:23 +00:00
|
|
|
/*
|
|
|
|
* No unassociated AGs are available, so select the AG with the most
|
|
|
|
* free space, regardless of whether it's already in use by another
|
|
|
|
* filestream. It none suit, just use whatever AG we can grab.
|
|
|
|
*/
|
|
|
|
if (!max_pag) {
|
|
|
|
for_each_perag_wrap(args->mp, 0, start_agno, pag) {
|
|
|
|
max_pag = pag;
|
|
|
|
break;
|
2007-07-11 01:09:12 +00:00
|
|
|
}
|
2024-10-23 13:37:22 +00:00
|
|
|
|
2024-10-23 13:37:23 +00:00
|
|
|
/* Bail if there are no AGs at all to select from. */
|
|
|
|
if (!max_pag)
|
|
|
|
return -ENOSPC;
|
2023-02-12 22:14:55 +00:00
|
|
|
}
|
2007-07-11 01:09:12 +00:00
|
|
|
|
2024-10-23 13:37:23 +00:00
|
|
|
pag = max_pag;
|
|
|
|
atomic_inc(&pag->pagf_fstrms);
|
|
|
|
done:
|
2024-10-23 13:37:22 +00:00
|
|
|
trace_xfs_filestream_pick(pag, pino);
|
2023-02-12 22:14:56 +00:00
|
|
|
args->pag = pag;
|
2007-07-11 01:09:12 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-04-22 21:11:51 +00:00
|
|
|
static struct xfs_inode *
|
|
|
|
xfs_filestream_get_parent(
|
|
|
|
struct xfs_inode *ip)
|
2007-07-11 01:09:12 +00:00
|
|
|
{
|
2014-04-22 21:11:51 +00:00
|
|
|
struct inode *inode = VFS_I(ip), *dir = NULL;
|
|
|
|
struct dentry *dentry, *parent;
|
2007-07-11 01:09:12 +00:00
|
|
|
|
2014-04-22 21:11:51 +00:00
|
|
|
dentry = d_find_alias(inode);
|
|
|
|
if (!dentry)
|
|
|
|
goto out;
|
2007-07-11 01:09:12 +00:00
|
|
|
|
2014-04-22 21:11:51 +00:00
|
|
|
parent = dget_parent(dentry);
|
|
|
|
if (!parent)
|
|
|
|
goto out_dput;
|
2007-07-11 01:09:12 +00:00
|
|
|
|
2015-03-17 22:25:59 +00:00
|
|
|
dir = igrab(d_inode(parent));
|
2014-04-22 21:11:51 +00:00
|
|
|
dput(parent);
|
2007-07-11 01:09:12 +00:00
|
|
|
|
2014-04-22 21:11:51 +00:00
|
|
|
out_dput:
|
|
|
|
dput(dentry);
|
|
|
|
out:
|
|
|
|
return dir ? XFS_I(dir) : NULL;
|
2007-07-11 01:09:12 +00:00
|
|
|
}
|
|
|
|
|
2023-02-12 22:14:55 +00:00
|
|
|
/*
|
|
|
|
* Lookup the mru cache for an existing association. If one exists and we can
|
2023-02-12 22:14:56 +00:00
|
|
|
* use it, return with an active perag reference indicating that the allocation
|
|
|
|
* will proceed with that association.
|
2023-02-12 22:14:55 +00:00
|
|
|
*
|
|
|
|
* If we have no association, or we cannot use the current one and have to
|
2023-02-12 22:14:56 +00:00
|
|
|
* destroy it, return with longest = 0 to tell the caller to create a new
|
|
|
|
* association.
|
2023-02-12 22:14:55 +00:00
|
|
|
*/
|
2023-02-12 22:14:56 +00:00
|
|
|
static int
|
|
|
|
xfs_filestream_lookup_association(
|
2023-02-12 22:14:55 +00:00
|
|
|
struct xfs_bmalloca *ap,
|
|
|
|
struct xfs_alloc_arg *args,
|
2023-02-12 22:14:56 +00:00
|
|
|
xfs_ino_t pino,
|
|
|
|
xfs_extlen_t *longest)
|
2023-02-12 22:14:55 +00:00
|
|
|
{
|
2023-02-12 22:14:56 +00:00
|
|
|
struct xfs_mount *mp = args->mp;
|
2023-02-12 22:14:55 +00:00
|
|
|
struct xfs_perag *pag;
|
|
|
|
struct xfs_mru_cache_elem *mru;
|
2023-02-12 22:14:56 +00:00
|
|
|
int error = 0;
|
2023-02-12 22:14:55 +00:00
|
|
|
|
2023-02-12 22:14:56 +00:00
|
|
|
*longest = 0;
|
|
|
|
mru = xfs_mru_cache_lookup(mp->m_filestream, pino);
|
2023-02-12 22:14:55 +00:00
|
|
|
if (!mru)
|
2023-02-12 22:14:56 +00:00
|
|
|
return 0;
|
2023-02-12 22:14:56 +00:00
|
|
|
/*
|
|
|
|
* Grab the pag and take an extra active reference for the caller whilst
|
|
|
|
* the mru item cannot go away. This means we'll pin the perag with
|
|
|
|
* the reference we get here even if the filestreams association is torn
|
|
|
|
* down immediately after we mark the lookup as done.
|
|
|
|
*/
|
2023-02-12 22:14:55 +00:00
|
|
|
pag = container_of(mru, struct xfs_fstrm_item, mru)->pag;
|
2023-02-12 22:14:56 +00:00
|
|
|
atomic_inc(&pag->pag_active_ref);
|
2023-02-12 22:14:55 +00:00
|
|
|
xfs_mru_cache_done(mp->m_filestream);
|
|
|
|
|
2023-02-12 22:14:56 +00:00
|
|
|
trace_xfs_filestream_lookup(pag, ap->ip->i_ino);
|
2023-02-12 22:14:55 +00:00
|
|
|
|
2023-02-12 22:14:55 +00:00
|
|
|
ap->blkno = XFS_AGB_TO_FSB(args->mp, pag->pag_agno, 0);
|
2023-02-12 22:14:55 +00:00
|
|
|
xfs_bmap_adjacent(ap);
|
|
|
|
|
|
|
|
/*
|
2023-02-12 22:14:56 +00:00
|
|
|
* If there is very little free space before we start a filestreams
|
2023-02-12 22:14:56 +00:00
|
|
|
* allocation, we're almost guaranteed to fail to find a large enough
|
|
|
|
* free space available so just use the cached AG.
|
2023-02-12 22:14:55 +00:00
|
|
|
*/
|
2023-02-12 22:14:56 +00:00
|
|
|
if (ap->tp->t_flags & XFS_TRANS_LOWMODE) {
|
|
|
|
*longest = 1;
|
|
|
|
goto out_done;
|
2023-02-12 22:14:56 +00:00
|
|
|
}
|
2023-02-12 22:14:55 +00:00
|
|
|
|
2023-02-12 22:14:56 +00:00
|
|
|
error = xfs_bmap_longest_free_extent(pag, args->tp, longest);
|
|
|
|
if (error == -EAGAIN)
|
|
|
|
error = 0;
|
|
|
|
if (error || *longest < args->maxlen) {
|
|
|
|
/* We aren't going to use this perag */
|
|
|
|
*longest = 0;
|
|
|
|
xfs_perag_rele(pag);
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
out_done:
|
|
|
|
args->pag = pag;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
xfs_filestream_create_association(
|
|
|
|
struct xfs_bmalloca *ap,
|
|
|
|
struct xfs_alloc_arg *args,
|
|
|
|
xfs_ino_t pino,
|
|
|
|
xfs_extlen_t *longest)
|
|
|
|
{
|
|
|
|
struct xfs_mount *mp = args->mp;
|
|
|
|
struct xfs_mru_cache_elem *mru;
|
|
|
|
struct xfs_fstrm_item *item;
|
|
|
|
xfs_agnumber_t agno = XFS_INO_TO_AGNO(mp, pino);
|
|
|
|
int flags = 0;
|
|
|
|
int error;
|
|
|
|
|
2023-02-12 22:14:55 +00:00
|
|
|
/* Changing parent AG association now, so remove the existing one. */
|
2023-02-12 22:14:56 +00:00
|
|
|
mru = xfs_mru_cache_remove(mp->m_filestream, pino);
|
2023-02-12 22:14:55 +00:00
|
|
|
if (mru) {
|
|
|
|
struct xfs_fstrm_item *item =
|
|
|
|
container_of(mru, struct xfs_fstrm_item, mru);
|
|
|
|
|
2023-02-12 22:14:56 +00:00
|
|
|
agno = (item->pag->pag_agno + 1) % mp->m_sb.sb_agcount;
|
|
|
|
xfs_fstrm_free_func(mp, mru);
|
|
|
|
} else if (xfs_is_inode32(mp)) {
|
2023-02-12 22:14:55 +00:00
|
|
|
xfs_agnumber_t rotorstep = xfs_rotorstep;
|
2023-02-12 22:14:56 +00:00
|
|
|
|
|
|
|
agno = (mp->m_agfrotor / rotorstep) % mp->m_sb.sb_agcount;
|
2023-02-12 22:14:55 +00:00
|
|
|
mp->m_agfrotor = (mp->m_agfrotor + 1) %
|
|
|
|
(mp->m_sb.sb_agcount * rotorstep);
|
|
|
|
}
|
2023-02-12 22:14:56 +00:00
|
|
|
|
|
|
|
ap->blkno = XFS_AGB_TO_FSB(args->mp, agno, 0);
|
|
|
|
xfs_bmap_adjacent(ap);
|
|
|
|
|
|
|
|
if (ap->datatype & XFS_ALLOC_USERDATA)
|
|
|
|
flags |= XFS_PICK_USERDATA;
|
|
|
|
if (ap->tp->t_flags & XFS_TRANS_LOWMODE)
|
|
|
|
flags |= XFS_PICK_LOWSPACE;
|
|
|
|
|
|
|
|
*longest = ap->length;
|
|
|
|
error = xfs_filestream_pick_ag(args, pino, agno, flags, longest);
|
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We are going to use this perag now, so create an assoication for it.
|
|
|
|
* xfs_filestream_pick_ag() has already bumped the perag fstrms counter
|
|
|
|
* for us, so all we need to do here is take another active reference to
|
|
|
|
* the perag for the cached association.
|
|
|
|
*
|
|
|
|
* If we fail to store the association, we need to drop the fstrms
|
|
|
|
* counter as well as drop the perag reference we take here for the
|
|
|
|
* item. We do not need to return an error for this failure - as long as
|
|
|
|
* we return a referenced AG, the allocation can still go ahead just
|
|
|
|
* fine.
|
|
|
|
*/
|
2024-01-15 22:59:40 +00:00
|
|
|
item = kmalloc(sizeof(*item), GFP_KERNEL | __GFP_RETRY_MAYFAIL);
|
2023-02-12 22:14:56 +00:00
|
|
|
if (!item)
|
|
|
|
goto out_put_fstrms;
|
|
|
|
|
|
|
|
atomic_inc(&args->pag->pag_active_ref);
|
|
|
|
item->pag = args->pag;
|
|
|
|
error = xfs_mru_cache_insert(mp->m_filestream, pino, &item->mru);
|
|
|
|
if (error)
|
|
|
|
goto out_free_item;
|
2023-02-12 22:14:55 +00:00
|
|
|
return 0;
|
|
|
|
|
2023-02-12 22:14:56 +00:00
|
|
|
out_free_item:
|
|
|
|
xfs_perag_rele(item->pag);
|
2024-01-15 22:59:43 +00:00
|
|
|
kfree(item);
|
2023-02-12 22:14:56 +00:00
|
|
|
out_put_fstrms:
|
|
|
|
atomic_dec(&args->pag->pagf_fstrms);
|
|
|
|
return 0;
|
2023-02-12 22:14:55 +00:00
|
|
|
}
|
|
|
|
|
2023-02-12 22:14:55 +00:00
|
|
|
/*
|
|
|
|
* Search for an allocation group with a single extent large enough for
|
2023-02-12 22:14:56 +00:00
|
|
|
* the request. First we look for an existing association and use that if it
|
|
|
|
* is found. Otherwise, we create a new association by selecting an AG that fits
|
|
|
|
* the allocation criteria.
|
|
|
|
*
|
|
|
|
* We return with a referenced perag in args->pag to indicate which AG we are
|
|
|
|
* allocating into or an error with no references held.
|
2023-02-12 22:14:55 +00:00
|
|
|
*/
|
|
|
|
int
|
|
|
|
xfs_filestream_select_ag(
|
2023-02-12 22:14:55 +00:00
|
|
|
struct xfs_bmalloca *ap,
|
|
|
|
struct xfs_alloc_arg *args,
|
2023-02-12 22:14:56 +00:00
|
|
|
xfs_extlen_t *longest)
|
2023-02-12 22:14:55 +00:00
|
|
|
{
|
2023-02-12 22:14:56 +00:00
|
|
|
struct xfs_mount *mp = args->mp;
|
|
|
|
struct xfs_inode *pip;
|
|
|
|
xfs_ino_t ino = 0;
|
2023-02-12 22:14:56 +00:00
|
|
|
int error = 0;
|
2023-02-12 22:14:55 +00:00
|
|
|
|
2023-02-12 22:14:56 +00:00
|
|
|
*longest = 0;
|
2023-02-12 22:14:55 +00:00
|
|
|
args->total = ap->total;
|
2023-02-12 22:14:55 +00:00
|
|
|
pip = xfs_filestream_get_parent(ap->ip);
|
2023-02-12 22:14:56 +00:00
|
|
|
if (pip) {
|
|
|
|
ino = pip->i_ino;
|
|
|
|
error = xfs_filestream_lookup_association(ap, args, ino,
|
|
|
|
longest);
|
|
|
|
xfs_irele(pip);
|
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
if (*longest >= args->maxlen)
|
|
|
|
goto out_select;
|
|
|
|
if (ap->tp->t_flags & XFS_TRANS_LOWMODE)
|
|
|
|
goto out_select;
|
2023-02-12 22:14:55 +00:00
|
|
|
}
|
|
|
|
|
2023-02-12 22:14:56 +00:00
|
|
|
error = xfs_filestream_create_association(ap, args, ino, longest);
|
2023-02-12 22:14:56 +00:00
|
|
|
if (error)
|
2023-02-12 22:14:56 +00:00
|
|
|
return error;
|
2023-02-12 22:14:55 +00:00
|
|
|
|
2023-02-12 22:14:55 +00:00
|
|
|
out_select:
|
2023-02-12 22:14:56 +00:00
|
|
|
ap->blkno = XFS_AGB_TO_FSB(mp, args->pag->pag_agno, 0);
|
2023-02-12 22:14:56 +00:00
|
|
|
return 0;
|
2023-02-12 22:14:55 +00:00
|
|
|
}
|
2023-02-12 22:14:55 +00:00
|
|
|
|
2014-04-22 21:11:51 +00:00
|
|
|
void
|
|
|
|
xfs_filestream_deassociate(
|
|
|
|
struct xfs_inode *ip)
|
|
|
|
{
|
|
|
|
xfs_mru_cache_delete(ip->i_mount->m_filestream, ip->i_ino);
|
|
|
|
}
|
2007-07-11 01:09:12 +00:00
|
|
|
|
2014-04-22 21:11:51 +00:00
|
|
|
int
|
|
|
|
xfs_filestream_mount(
|
|
|
|
xfs_mount_t *mp)
|
|
|
|
{
|
2007-07-11 01:09:12 +00:00
|
|
|
/*
|
2014-04-22 21:11:51 +00:00
|
|
|
* The filestream timer tunable is currently fixed within the range of
|
|
|
|
* one second to four minutes, with five seconds being the default. The
|
|
|
|
* group count is somewhat arbitrary, but it'd be nice to adhere to the
|
|
|
|
* timer tunable to within about 10 percent. This requires at least 10
|
|
|
|
* groups.
|
2007-07-11 01:09:12 +00:00
|
|
|
*/
|
2018-04-09 17:23:39 +00:00
|
|
|
return xfs_mru_cache_create(&mp->m_filestream, mp,
|
|
|
|
xfs_fstrm_centisecs * 10, 10, xfs_fstrm_free_func);
|
2014-04-22 21:11:51 +00:00
|
|
|
}
|
2007-07-11 01:09:12 +00:00
|
|
|
|
2014-04-22 21:11:51 +00:00
|
|
|
void
|
|
|
|
xfs_filestream_unmount(
|
|
|
|
xfs_mount_t *mp)
|
|
|
|
{
|
|
|
|
xfs_mru_cache_destroy(mp->m_filestream);
|
|
|
|
}
|