mirror of
https://github.com/torvalds/linux.git
synced 2024-11-22 04:02:20 +00:00
e4fd1def30
In the next patch, the rmap btree repair code will need to estimate the size of the new ondisk rmapbt. The size is a function of the number of records that will be written to disk, and the size of the recordset is the number of observations made while scanning the filesystem plus the number of OWN_AG records that will be injected into the rmap btree. OWN_AG rmap records track the free space btrees, the AGFL, and the new rmap btree itself. The repair tool uses a bitmap to record the space used for all four structures, which is why we need a function to count the number of set regions. A reviewer requested that this be pulled into a separate patch with its own justification, so here it is. Signed-off-by: Darrick J. Wong <djwong@kernel.org> Reviewed-by: Christoph Hellwig <hch@lst.de>
74 lines
1.9 KiB
C
74 lines
1.9 KiB
C
// SPDX-License-Identifier: GPL-2.0-or-later
|
|
/*
|
|
* Copyright (C) 2018-2023 Oracle. All Rights Reserved.
|
|
* Author: Darrick J. Wong <djwong@kernel.org>
|
|
*/
|
|
#ifndef __XFS_SCRUB_AGB_BITMAP_H__
|
|
#define __XFS_SCRUB_AGB_BITMAP_H__
|
|
|
|
/* Bitmaps, but for type-checked for xfs_agblock_t */
|
|
|
|
struct xagb_bitmap {
|
|
struct xbitmap32 agbitmap;
|
|
};
|
|
|
|
static inline void xagb_bitmap_init(struct xagb_bitmap *bitmap)
|
|
{
|
|
xbitmap32_init(&bitmap->agbitmap);
|
|
}
|
|
|
|
static inline void xagb_bitmap_destroy(struct xagb_bitmap *bitmap)
|
|
{
|
|
xbitmap32_destroy(&bitmap->agbitmap);
|
|
}
|
|
|
|
static inline int xagb_bitmap_clear(struct xagb_bitmap *bitmap,
|
|
xfs_agblock_t start, xfs_extlen_t len)
|
|
{
|
|
return xbitmap32_clear(&bitmap->agbitmap, start, len);
|
|
}
|
|
static inline int xagb_bitmap_set(struct xagb_bitmap *bitmap,
|
|
xfs_agblock_t start, xfs_extlen_t len)
|
|
{
|
|
return xbitmap32_set(&bitmap->agbitmap, start, len);
|
|
}
|
|
|
|
static inline bool xagb_bitmap_test(struct xagb_bitmap *bitmap,
|
|
xfs_agblock_t start, xfs_extlen_t *len)
|
|
{
|
|
return xbitmap32_test(&bitmap->agbitmap, start, len);
|
|
}
|
|
|
|
static inline int xagb_bitmap_disunion(struct xagb_bitmap *bitmap,
|
|
struct xagb_bitmap *sub)
|
|
{
|
|
return xbitmap32_disunion(&bitmap->agbitmap, &sub->agbitmap);
|
|
}
|
|
|
|
static inline uint32_t xagb_bitmap_hweight(struct xagb_bitmap *bitmap)
|
|
{
|
|
return xbitmap32_hweight(&bitmap->agbitmap);
|
|
}
|
|
static inline bool xagb_bitmap_empty(struct xagb_bitmap *bitmap)
|
|
{
|
|
return xbitmap32_empty(&bitmap->agbitmap);
|
|
}
|
|
|
|
static inline int xagb_bitmap_walk(struct xagb_bitmap *bitmap,
|
|
xbitmap32_walk_fn fn, void *priv)
|
|
{
|
|
return xbitmap32_walk(&bitmap->agbitmap, fn, priv);
|
|
}
|
|
|
|
int xagb_bitmap_set_btblocks(struct xagb_bitmap *bitmap,
|
|
struct xfs_btree_cur *cur);
|
|
int xagb_bitmap_set_btcur_path(struct xagb_bitmap *bitmap,
|
|
struct xfs_btree_cur *cur);
|
|
|
|
static inline uint32_t xagb_bitmap_count_set_regions(struct xagb_bitmap *b)
|
|
{
|
|
return xbitmap32_count_set_regions(&b->agbitmap);
|
|
}
|
|
|
|
#endif /* __XFS_SCRUB_AGB_BITMAP_H__ */
|