Donate to e Foundation | Murena handsets with /e/OS | Own a part of Murena! Learn more

Commit e9a2599a authored by Darrick J. Wong's avatar Darrick J. Wong
Browse files

xfs: create a function to query all records in a btree 



Create a helper function that will query all records in a btree.
This will be used by the online repair functions to examine every
record in a btree to rebuild a second btree.

Signed-off-by: default avatarDarrick J. Wong <darrick.wong@oracle.com>
Reviewed-by: default avatarBrian Foster <bfoster@redhat.com>
parent 2d520bfa

fs/xfs/libxfs/xfs_alloc.c

+15 −0
Original line number Diff line number Diff line
@@ -2910,3 +2910,18 @@ xfs_alloc_query_range( 
	return xfs_btree_query_range(cur, &low_brec, &high_brec,

			xfs_alloc_query_range_helper, &query);

}



/* Find all free space records. */

int

xfs_alloc_query_all(

	struct xfs_btree_cur			*cur,

	xfs_alloc_query_range_fn		fn,

	void					*priv)

{

	struct xfs_alloc_query_range_info	query;



	ASSERT(cur->bc_btnum == XFS_BTNUM_BNO);

	query.priv = priv;

	query.fn = fn;

	return xfs_btree_query_all(cur, xfs_alloc_query_range_helper, &query);

}

fs/xfs/libxfs/xfs_alloc.h

+2 −0
Original line number Diff line number Diff line
@@ -228,5 +228,7 @@ int xfs_alloc_query_range(struct xfs_btree_cur *cur, 
		struct xfs_alloc_rec_incore *low_rec,

		struct xfs_alloc_rec_incore *high_rec,

		xfs_alloc_query_range_fn fn, void *priv);

int xfs_alloc_query_all(struct xfs_btree_cur *cur, xfs_alloc_query_range_fn fn,

		void *priv);



#endif	/* __XFS_ALLOC_H__ */

fs/xfs/libxfs/xfs_btree.c

+15 −0
Original line number Diff line number Diff line
@@ -4842,6 +4842,21 @@ xfs_btree_query_range( 
			fn, priv);

}



/* Query a btree for all records. */

int

xfs_btree_query_all(

	struct xfs_btree_cur		*cur,

	xfs_btree_query_range_fn	fn,

	void				*priv)

{

	union xfs_btree_irec		low_rec;

	union xfs_btree_irec		high_rec;



	memset(&low_rec, 0, sizeof(low_rec));

	memset(&high_rec, 0xFF, sizeof(high_rec));

	return xfs_btree_query_range(cur, &low_rec, &high_rec, fn, priv);

}



/*

 * Calculate the number of blocks needed to store a given number of records

 * in a short-format (per-AG metadata) btree.

fs/xfs/libxfs/xfs_btree.h

+2 −0
Original line number Diff line number Diff line
@@ -496,6 +496,8 @@ typedef int (*xfs_btree_query_range_fn)(struct xfs_btree_cur *cur, 
int xfs_btree_query_range(struct xfs_btree_cur *cur,

		union xfs_btree_irec *low_rec, union xfs_btree_irec *high_rec,

		xfs_btree_query_range_fn fn, void *priv);

int xfs_btree_query_all(struct xfs_btree_cur *cur, xfs_btree_query_range_fn fn,

		void *priv);



typedef int (*xfs_btree_visit_blocks_fn)(struct xfs_btree_cur *cur, int level,

		void *data);

fs/xfs/libxfs/xfs_rmap.c

+21 −7
Original line number Diff line number Diff line
@@ -2019,6 +2019,20 @@ xfs_rmap_query_range( 
			xfs_rmap_query_range_helper, &query);

}



/* Find all rmaps. */

int

xfs_rmap_query_all(

	struct xfs_btree_cur			*cur,

	xfs_rmap_query_range_fn			fn,

	void					*priv)

{

	struct xfs_rmap_query_range_info	query;



	query.priv = priv;

	query.fn = fn;

	return xfs_btree_query_all(cur, xfs_rmap_query_range_helper, &query);

}



/* Clean up after calling xfs_rmap_finish_one. */

void

xfs_rmap_finish_one_cleanup(