mirror of
https://github.com/torvalds/linux
synced 2024-09-21 03:28:37 +00:00
86d969b425
As mentioned previously, the xrep_extent_list basically implements a bitmap with two functions: set and disjoint union. Rename all these functions to xfs_bitmap to shorten the name and make it more obvious what we're doing. Signed-off-by: Darrick J. Wong <darrick.wong@oracle.com> Reviewed-by: Brian Foster <bfoster@redhat.com>
33 lines
935 B
C
33 lines
935 B
C
// SPDX-License-Identifier: GPL-2.0+
|
|
/*
|
|
* Copyright (C) 2018 Oracle. All Rights Reserved.
|
|
* Author: Darrick J. Wong <darrick.wong@oracle.com>
|
|
*/
|
|
#ifndef __XFS_SCRUB_BITMAP_H__
|
|
#define __XFS_SCRUB_BITMAP_H__
|
|
|
|
struct xfs_bitmap_range {
|
|
struct list_head list;
|
|
uint64_t start;
|
|
uint64_t len;
|
|
};
|
|
|
|
struct xfs_bitmap {
|
|
struct list_head list;
|
|
};
|
|
|
|
void xfs_bitmap_init(struct xfs_bitmap *bitmap);
|
|
void xfs_bitmap_destroy(struct xfs_bitmap *bitmap);
|
|
|
|
#define for_each_xfs_bitmap_extent(bex, n, bitmap) \
|
|
list_for_each_entry_safe((bex), (n), &(bitmap)->list, list)
|
|
|
|
#define for_each_xfs_bitmap_block(b, bex, n, bitmap) \
|
|
list_for_each_entry_safe((bex), (n), &(bitmap)->list, list) \
|
|
for ((b) = bex->start; (b) < bex->start + bex->len; (b)++)
|
|
|
|
int xfs_bitmap_set(struct xfs_bitmap *bitmap, uint64_t start, uint64_t len);
|
|
int xfs_bitmap_disunion(struct xfs_bitmap *bitmap, struct xfs_bitmap *sub);
|
|
|
|
#endif /* __XFS_SCRUB_BITMAP_H__ */
|