72 lines
2.4 KiB
C
72 lines
2.4 KiB
C
|
// SPDX-License-Identifier: GPL-2.0
|
||
|
|
/*
|
||
|
|
* Copyright (c) 2000-2002,2005 Silicon Graphics, Inc.
|
||
|
|
* Copyright (c) 2010 David Chinner.
|
||
|
|
* Copyright (c) 2011 Christoph Hellwig.
|
||
|
|
* All Rights Reserved.
|
||
|
|
*/
|
||
|
|
#ifndef __XFS_EXTENT_BUSY_H__
|
||
|
|
#define __XFS_EXTENT_BUSY_H__
|
||
|
|
|
||
|
|
struct xfs_group;
|
||
|
|
struct xfs_mount;
|
||
|
|
struct xfs_trans;
|
||
|
|
|
||
|
|
/*
|
||
|
|
* Busy block/extent entry. Indexed by a rbtree in the group to mark blocks
|
||
|
|
* that have been freed but whose transactions aren't committed to disk yet.
|
||
|
|
*/
|
||
|
|
struct xfs_extent_busy {
|
||
|
|
struct rb_node rb_node; /* group by-bno indexed search tree */
|
||
|
|
struct list_head list; /* transaction busy extent list */
|
||
|
|
struct xfs_group *group;
|
||
|
|
xfs_agblock_t bno;
|
||
|
|
xfs_extlen_t length;
|
||
|
|
unsigned int flags;
|
||
|
|
#define XFS_EXTENT_BUSY_DISCARDED 0x01 /* undergoing a discard op. */
|
||
|
|
#define XFS_EXTENT_BUSY_SKIP_DISCARD 0x02 /* do not discard */
|
||
|
|
};
|
||
|
|
|
||
|
|
/*
|
||
|
|
* List used to track groups of related busy extents all the way through
|
||
|
|
* to discard completion.
|
||
|
|
*/
|
||
|
|
struct xfs_busy_extents {
|
||
|
|
struct list_head extent_list;
|
||
|
|
struct work_struct endio_work;
|
||
|
|
|
||
|
|
/*
|
||
|
|
* Owner is the object containing the struct xfs_busy_extents to free
|
||
|
|
* once the busy extents have been processed. If only the
|
||
|
|
* xfs_busy_extents object needs freeing, then point this at itself.
|
||
|
|
*/
|
||
|
|
void *owner;
|
||
|
|
};
|
||
|
|
|
||
|
|
void xfs_extent_busy_insert(struct xfs_trans *tp, struct xfs_group *xg,
|
||
|
|
xfs_agblock_t bno, xfs_extlen_t len, unsigned int flags);
|
||
|
|
void xfs_extent_busy_insert_discard(struct xfs_group *xg, xfs_agblock_t bno,
|
||
|
|
xfs_extlen_t len, struct list_head *busy_list);
|
||
|
|
void xfs_extent_busy_clear(struct list_head *list, bool do_discard);
|
||
|
|
int xfs_extent_busy_search(struct xfs_group *xg, xfs_agblock_t bno,
|
||
|
|
xfs_extlen_t len);
|
||
|
|
void xfs_extent_busy_reuse(struct xfs_group *xg, xfs_agblock_t fbno,
|
||
|
|
xfs_extlen_t flen, bool userdata);
|
||
|
|
bool xfs_extent_busy_trim(struct xfs_group *xg, xfs_extlen_t minlen,
|
||
|
|
xfs_extlen_t maxlen, xfs_agblock_t *bno, xfs_extlen_t *len,
|
||
|
|
unsigned *busy_gen);
|
||
|
|
int xfs_extent_busy_flush(struct xfs_trans *tp, struct xfs_group *xg,
|
||
|
|
unsigned busy_gen, uint32_t alloc_flags);
|
||
|
|
void xfs_extent_busy_wait_all(struct xfs_mount *mp);
|
||
|
|
bool xfs_extent_busy_list_empty(struct xfs_group *xg, unsigned int *busy_gen);
|
||
|
|
struct xfs_extent_busy_tree *xfs_extent_busy_alloc(void);
|
||
|
|
|
||
|
|
int xfs_extent_busy_ag_cmp(void *priv, const struct list_head *a,
|
||
|
|
const struct list_head *b);
|
||
|
|
static inline void xfs_extent_busy_sort(struct list_head *list)
|
||
|
|
{
|
||
|
|
list_sort(NULL, list, xfs_extent_busy_ag_cmp);
|
||
|
|
}
|
||
|
|
|
||
|
|
#endif /* __XFS_EXTENT_BUSY_H__ */
|