mirror of
https://mirrors.bfsu.edu.cn/git/linux.git
synced 2024-11-15 08:14:15 +08:00
3a3108ea8c
Strengthen the rmap btree record checker a little more by comparing OWN_AG reverse mappings against the free space btrees, the rmap btree, and the AGFL. Signed-off-by: Darrick J. Wong <djwong@kernel.org> Reviewed-by: Dave Chinner <dchinner@redhat.com>
115 lines
3.1 KiB
C
115 lines
3.1 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_BITMAP_H__
|
|
#define __XFS_SCRUB_BITMAP_H__
|
|
|
|
struct xbitmap {
|
|
struct rb_root_cached xb_root;
|
|
};
|
|
|
|
void xbitmap_init(struct xbitmap *bitmap);
|
|
void xbitmap_destroy(struct xbitmap *bitmap);
|
|
|
|
int xbitmap_clear(struct xbitmap *bitmap, uint64_t start, uint64_t len);
|
|
int xbitmap_set(struct xbitmap *bitmap, uint64_t start, uint64_t len);
|
|
int xbitmap_disunion(struct xbitmap *bitmap, struct xbitmap *sub);
|
|
int xbitmap_set_btcur_path(struct xbitmap *bitmap,
|
|
struct xfs_btree_cur *cur);
|
|
int xbitmap_set_btblocks(struct xbitmap *bitmap,
|
|
struct xfs_btree_cur *cur);
|
|
uint64_t xbitmap_hweight(struct xbitmap *bitmap);
|
|
|
|
/*
|
|
* Return codes for the bitmap iterator functions are 0 to continue iterating,
|
|
* and non-zero to stop iterating. Any non-zero value will be passed up to the
|
|
* iteration caller. The special value -ECANCELED can be used to stop
|
|
* iteration, because neither bitmap iterator ever generates that error code on
|
|
* its own. Callers must not modify the bitmap while walking it.
|
|
*/
|
|
typedef int (*xbitmap_walk_fn)(uint64_t start, uint64_t len, void *priv);
|
|
int xbitmap_walk(struct xbitmap *bitmap, xbitmap_walk_fn fn,
|
|
void *priv);
|
|
|
|
typedef int (*xbitmap_walk_bits_fn)(uint64_t bit, void *priv);
|
|
int xbitmap_walk_bits(struct xbitmap *bitmap, xbitmap_walk_bits_fn fn,
|
|
void *priv);
|
|
|
|
bool xbitmap_empty(struct xbitmap *bitmap);
|
|
bool xbitmap_test(struct xbitmap *bitmap, uint64_t start, uint64_t *len);
|
|
|
|
/* Bitmaps, but for type-checked for xfs_agblock_t */
|
|
|
|
struct xagb_bitmap {
|
|
struct xbitmap agbitmap;
|
|
};
|
|
|
|
static inline void xagb_bitmap_init(struct xagb_bitmap *bitmap)
|
|
{
|
|
xbitmap_init(&bitmap->agbitmap);
|
|
}
|
|
|
|
static inline void xagb_bitmap_destroy(struct xagb_bitmap *bitmap)
|
|
{
|
|
xbitmap_destroy(&bitmap->agbitmap);
|
|
}
|
|
|
|
static inline int xagb_bitmap_clear(struct xagb_bitmap *bitmap,
|
|
xfs_agblock_t start, xfs_extlen_t len)
|
|
{
|
|
return xbitmap_clear(&bitmap->agbitmap, start, len);
|
|
}
|
|
static inline int xagb_bitmap_set(struct xagb_bitmap *bitmap,
|
|
xfs_agblock_t start, xfs_extlen_t len)
|
|
{
|
|
return xbitmap_set(&bitmap->agbitmap, start, len);
|
|
}
|
|
|
|
static inline bool
|
|
xagb_bitmap_test(
|
|
struct xagb_bitmap *bitmap,
|
|
xfs_agblock_t start,
|
|
xfs_extlen_t *len)
|
|
{
|
|
uint64_t biglen = *len;
|
|
bool ret;
|
|
|
|
ret = xbitmap_test(&bitmap->agbitmap, start, &biglen);
|
|
|
|
if (start + biglen >= UINT_MAX) {
|
|
ASSERT(0);
|
|
biglen = UINT_MAX - start;
|
|
}
|
|
|
|
*len = biglen;
|
|
return ret;
|
|
}
|
|
|
|
static inline int xagb_bitmap_disunion(struct xagb_bitmap *bitmap,
|
|
struct xagb_bitmap *sub)
|
|
{
|
|
return xbitmap_disunion(&bitmap->agbitmap, &sub->agbitmap);
|
|
}
|
|
|
|
static inline uint32_t xagb_bitmap_hweight(struct xagb_bitmap *bitmap)
|
|
{
|
|
return xbitmap_hweight(&bitmap->agbitmap);
|
|
}
|
|
static inline bool xagb_bitmap_empty(struct xagb_bitmap *bitmap)
|
|
{
|
|
return xbitmap_empty(&bitmap->agbitmap);
|
|
}
|
|
|
|
static inline int xagb_bitmap_walk(struct xagb_bitmap *bitmap,
|
|
xbitmap_walk_fn fn, void *priv)
|
|
{
|
|
return xbitmap_walk(&bitmap->agbitmap, fn, priv);
|
|
}
|
|
|
|
int xagb_bitmap_set_btblocks(struct xagb_bitmap *bitmap,
|
|
struct xfs_btree_cur *cur);
|
|
|
|
#endif /* __XFS_SCRUB_BITMAP_H__ */
|