mirror of
https://github.com/edk2-porting/linux-next.git
synced 2024-12-22 20:23:57 +08:00
6ca444cfd6
Split out the btree level information into a separate struct and put it at the end of the cursor structure as a VLA. Files with huge data forks (and in the future, the realtime rmap btree) will require the ability to support many more levels than a per-AG btree cursor, which means that we're going to create per-btree type cursor caches to conserve memory for the more common case. Note that a subsequent patch actually introduces dynamic cursor heights. This one merely rearranges the structure to prepare for that. Signed-off-by: Darrick J. Wong <djwong@kernel.org> Reviewed-by: Chandan Babu R <chandan.babu@oracle.com> Reviewed-by: Christoph Hellwig <hch@lst.de> Reviewed-by: Dave Chinner <dchinner@redhat.com>
41 lines
1.0 KiB
C
41 lines
1.0 KiB
C
// SPDX-License-Identifier: GPL-2.0+
|
|
/*
|
|
* Copyright (C) 2017 Oracle. All Rights Reserved.
|
|
* Author: Darrick J. Wong <darrick.wong@oracle.com>
|
|
*/
|
|
#include "xfs.h"
|
|
#include "xfs_fs.h"
|
|
#include "xfs_shared.h"
|
|
#include "xfs_format.h"
|
|
#include "xfs_log_format.h"
|
|
#include "xfs_trans_resv.h"
|
|
#include "xfs_mount.h"
|
|
#include "xfs_inode.h"
|
|
#include "xfs_btree.h"
|
|
#include "scrub/scrub.h"
|
|
#include "xfs_ag.h"
|
|
|
|
/* Figure out which block the btree cursor was pointing to. */
|
|
static inline xfs_fsblock_t
|
|
xchk_btree_cur_fsbno(
|
|
struct xfs_btree_cur *cur,
|
|
int level)
|
|
{
|
|
if (level < cur->bc_nlevels && cur->bc_levels[level].bp)
|
|
return XFS_DADDR_TO_FSB(cur->bc_mp,
|
|
xfs_buf_daddr(cur->bc_levels[level].bp));
|
|
|
|
if (level == cur->bc_nlevels - 1 &&
|
|
(cur->bc_flags & XFS_BTREE_ROOT_IN_INODE))
|
|
return XFS_INO_TO_FSB(cur->bc_mp, cur->bc_ino.ip->i_ino);
|
|
|
|
return NULLFSBLOCK;
|
|
}
|
|
|
|
/*
|
|
* We include this last to have the helpers above available for the trace
|
|
* event implementations.
|
|
*/
|
|
#define CREATE_TRACE_POINTS
|
|
#include "scrub/trace.h"
|