[linux.git] / fs / xfs / xfs_extent_busy.h

// 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_mount;
struct xfs_perag;
struct xfs_trans;
struct xfs_alloc_arg;

/*
 * Busy block/extent entry.  Indexed by a rbtree in perag 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;	/* ag by-bno indexed search tree */
	struct list_head list;		/* transaction busy extent list */
	xfs_agnumber_t	agno;
	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 xfs_mount	*mount;
	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_perag *pag,
	xfs_agblock_t bno, xfs_extlen_t len, unsigned int flags);

void
xfs_extent_busy_insert_discard(struct xfs_perag *pag, xfs_agblock_t bno,
	xfs_extlen_t len, struct list_head *busy_list);

void
xfs_extent_busy_clear(struct xfs_mount *mp, struct list_head *list,
	bool do_discard);

int
xfs_extent_busy_search(struct xfs_mount *mp, struct xfs_perag *pag,
	xfs_agblock_t bno, xfs_extlen_t len);

void
xfs_extent_busy_reuse(struct xfs_mount *mp, struct xfs_perag *pag,
	xfs_agblock_t fbno, xfs_extlen_t flen, bool userdata);

bool
xfs_extent_busy_trim(struct xfs_alloc_arg *args, xfs_agblock_t *bno,
		xfs_extlen_t *len, unsigned *busy_gen);

int
xfs_extent_busy_flush(struct xfs_trans *tp, struct xfs_perag *pag,
		unsigned busy_gen, uint32_t alloc_flags);

void
xfs_extent_busy_wait_all(struct xfs_mount *mp);

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);
}

bool xfs_extent_busy_list_empty(struct xfs_perag *pag);

#endif /* __XFS_EXTENT_BUSY_H__ */
Commit	Line	Data
0b61f8a4	1	// SPDX-License-Identifier: GPL-2.0
efc27b52 DC	2	/*
	3	* Copyright (c) 2000-2002,2005 Silicon Graphics, Inc.
	4	* Copyright (c) 2010 David Chinner.
	5	* Copyright (c) 2011 Christoph Hellwig.
	6	* All Rights Reserved.
efc27b52 DC	7	*/
	8	#ifndef __XFS_EXTENT_BUSY_H__
	9	#define __XFS_EXTENT_BUSY_H__
	10
a4fbe6ab	11	struct xfs_mount;
45d06621	12	struct xfs_perag;
a4fbe6ab DC	13	struct xfs_trans;
	14	struct xfs_alloc_arg;
	15
efc27b52 DC	16	/*
	17	* Busy block/extent entry. Indexed by a rbtree in perag to mark blocks that
	18	* have been freed but whose transactions aren't committed to disk yet.
efc27b52	19	*/
4ecbfe63	20	struct xfs_extent_busy {
efc27b52 DC	21	struct rb_node rb_node; /* ag by-bno indexed search tree */
	22	struct list_head list; /* transaction busy extent list */
	23	xfs_agnumber_t agno;
	24	xfs_agblock_t bno;
	25	xfs_extlen_t length;
	26	unsigned int flags;
4ecbfe63 DC	27	#define XFS_EXTENT_BUSY_DISCARDED 0x01 /* undergoing a discard op. */
4ecbfe63 DC	28	#define XFS_EXTENT_BUSY_SKIP_DISCARD 0x02 /* do not discard */
efc27b52 DC	29	};
efc27b52 DC	30
428c4435 DC	31	/*
	32	* List used to track groups of related busy extents all the way through
	33	* to discard completion.
	34	*/
	35	struct xfs_busy_extents {
	36	struct xfs_mount *mount;
	37	struct list_head extent_list;
	38	struct work_struct endio_work;
	39
	40	/*
	41	* Owner is the object containing the struct xfs_busy_extents to free
	42	* once the busy extents have been processed. If only the
	43	* xfs_busy_extents object needs freeing, then point this at itself.
	44	*/
	45	void *owner;
	46	};
	47
efc27b52	48	void
45d06621	49	xfs_extent_busy_insert(struct xfs_trans tp, struct xfs_perag pag,
efc27b52 DC	50	xfs_agblock_t bno, xfs_extlen_t len, unsigned int flags);
efc27b52 DC	51
89cfa899 DC	52	void
	53	xfs_extent_busy_insert_discard(struct xfs_perag *pag, xfs_agblock_t bno,
	54	xfs_extlen_t len, struct list_head *busy_list);
	55
efc27b52	56	void
4ecbfe63	57	xfs_extent_busy_clear(struct xfs_mount mp, struct list_head list,
efc27b52 DC	58	bool do_discard);
	59
	60	int
45d06621	61	xfs_extent_busy_search(struct xfs_mount mp, struct xfs_perag pag,
efc27b52 DC	62	xfs_agblock_t bno, xfs_extlen_t len);
	63
	64	void
45d06621	65	xfs_extent_busy_reuse(struct xfs_mount mp, struct xfs_perag pag,
efc27b52 DC	66	xfs_agblock_t fbno, xfs_extlen_t flen, bool userdata);
efc27b52 DC	67
ebf55872 CH	68	bool
	69	xfs_extent_busy_trim(struct xfs_alloc_arg args, xfs_agblock_t bno,
	70	xfs_extlen_t len, unsigned busy_gen);
	71
8ebbf262 DC	72	int
	73	xfs_extent_busy_flush(struct xfs_trans tp, struct xfs_perag pag,
	74	unsigned busy_gen, uint32_t alloc_flags);
ebf55872	75
e700a06c	76	void
ebf55872	77	xfs_extent_busy_wait_all(struct xfs_mount *mp);
e700a06c	78
efc27b52	79	int
4f0f586b ST	80	xfs_extent_busy_ag_cmp(void priv, const struct list_head a,
4f0f586b ST	81	const struct list_head *b);
efc27b52	82
4ecbfe63	83	static inline void xfs_extent_busy_sort(struct list_head *list)
efc27b52	84	{
4ecbfe63	85	list_sort(NULL, list, xfs_extent_busy_ag_cmp);
efc27b52 DC	86	}
efc27b52 DC	87
4bdfd7d1 DW	88	bool xfs_extent_busy_list_empty(struct xfs_perag *pag);
4bdfd7d1 DW	89
efc27b52	90	#endif /* __XFS_EXTENT_BUSY_H__ */