1/*
 2 * Copyright (c) 2000-2002,2005 Silicon Graphics, Inc.
 3 * Copyright (c) 2010 David Chinner.
 4 * Copyright (c) 2011 Christoph Hellwig.
 5 * All Rights Reserved.
 6 *
 7 * This program is free software; you can redistribute it and/or
 8 * modify it under the terms of the GNU General Public License as
 9 * published by the Free Software Foundation.
10 *
11 * This program is distributed in the hope that it would be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write the Free Software Foundation,
18 * Inc.,  51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
19 */
20#ifndef __XFS_EXTENT_BUSY_H__
21#define	__XFS_EXTENT_BUSY_H__
22
 
 
 
 
23/*
24 * Busy block/extent entry.  Indexed by a rbtree in perag to mark blocks that
25 * have been freed but whose transactions aren't committed to disk yet.
26 *
27 * Note that we use the transaction ID to record the transaction, not the
28 * transaction structure itself. See xfs_extent_busy_insert() for details.
29 */
30struct xfs_extent_busy {
31	struct rb_node	rb_node;	/* ag by-bno indexed search tree */
32	struct list_head list;		/* transaction busy extent list */
33	xfs_agnumber_t	agno;
34	xfs_agblock_t	bno;
35	xfs_extlen_t	length;
36	unsigned int	flags;
37#define XFS_EXTENT_BUSY_DISCARDED	0x01	/* undergoing a discard op. */
38#define XFS_EXTENT_BUSY_SKIP_DISCARD	0x02	/* do not discard */
39};
40
41void
42xfs_extent_busy_insert(struct xfs_trans *tp, xfs_agnumber_t agno,
43	xfs_agblock_t bno, xfs_extlen_t len, unsigned int flags);
44
45void
46xfs_extent_busy_clear(struct xfs_mount *mp, struct list_head *list,
47	bool do_discard);
48
49int
50xfs_extent_busy_search(struct xfs_mount *mp, xfs_agnumber_t agno,
51	xfs_agblock_t bno, xfs_extlen_t len);
52
53void
54xfs_extent_busy_reuse(struct xfs_mount *mp, xfs_agnumber_t agno,
55	xfs_agblock_t fbno, xfs_extlen_t flen, bool userdata);
56
57void
58xfs_extent_busy_trim(struct xfs_alloc_arg *args, xfs_agblock_t bno,
59	xfs_extlen_t len, xfs_agblock_t *rbno, xfs_extlen_t *rlen);
60
61int
62xfs_extent_busy_ag_cmp(void *priv, struct list_head *a, struct list_head *b);
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
63
 
 
64static inline void xfs_extent_busy_sort(struct list_head *list)
65{
66	list_sort(NULL, list, xfs_extent_busy_ag_cmp);
67}
68
69#endif /* __XFS_EXTENT_BUSY_H__ */

 1// SPDX-License-Identifier: GPL-2.0
 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.
 
 
 
 
 
 
 
 
 
 
 
 
 
 7 */
 8#ifndef __XFS_EXTENT_BUSY_H__
 9#define	__XFS_EXTENT_BUSY_H__
10
11struct xfs_group;
12struct xfs_mount;
13struct xfs_trans;
14
15/*
16 * Busy block/extent entry.  Indexed by a rbtree in the group to mark blocks
17 * that have been freed but whose transactions aren't committed to disk yet.
 
 
 
18 */
19struct xfs_extent_busy {
20	struct rb_node	rb_node;	/* group by-bno indexed search tree */
21	struct list_head list;		/* transaction busy extent list */
22	struct xfs_group *group;
23	xfs_agblock_t	bno;
24	xfs_extlen_t	length;
25	unsigned int	flags;
26#define XFS_EXTENT_BUSY_DISCARDED	0x01	/* undergoing a discard op. */
27#define XFS_EXTENT_BUSY_SKIP_DISCARD	0x02	/* do not discard */
28};
29
30/*
31 * List used to track groups of related busy extents all the way through
32 * to discard completion.
33 */
34struct xfs_busy_extents {
35	struct list_head	extent_list;
36	struct work_struct	endio_work;
37
38	/*
39	 * Owner is the object containing the struct xfs_busy_extents to free
40	 * once the busy extents have been processed. If only the
41	 * xfs_busy_extents object needs freeing, then point this at itself.
42	 */
43	void			*owner;
44};
 
 
 
 
45
46void xfs_extent_busy_insert(struct xfs_trans *tp, struct xfs_group *xg,
47		xfs_agblock_t bno, xfs_extlen_t len, unsigned int flags);
48void xfs_extent_busy_insert_discard(struct xfs_group *xg, xfs_agblock_t bno,
49		xfs_extlen_t len, struct list_head *busy_list);
50void xfs_extent_busy_clear(struct list_head *list, bool do_discard);
51int xfs_extent_busy_search(struct xfs_group *xg, xfs_agblock_t bno,
52		xfs_extlen_t len);
53void xfs_extent_busy_reuse(struct xfs_group *xg, xfs_agblock_t fbno,
54		xfs_extlen_t flen, bool userdata);
55bool xfs_extent_busy_trim(struct xfs_group *xg, xfs_extlen_t minlen,
56		xfs_extlen_t maxlen, xfs_agblock_t *bno, xfs_extlen_t *len,
57		unsigned *busy_gen);
58int xfs_extent_busy_flush(struct xfs_trans *tp, struct xfs_group *xg,
59		unsigned busy_gen, uint32_t alloc_flags);
60void xfs_extent_busy_wait_all(struct xfs_mount *mp);
61bool xfs_extent_busy_list_empty(struct xfs_group *xg, unsigned int *busy_gen);
62struct xfs_extent_busy_tree *xfs_extent_busy_alloc(void);
63
64int xfs_extent_busy_ag_cmp(void *priv, const struct list_head *a,
65		const struct list_head *b);
66static inline void xfs_extent_busy_sort(struct list_head *list)
67{
68	list_sort(NULL, list, xfs_extent_busy_ag_cmp);
69}
70
71#endif /* __XFS_EXTENT_BUSY_H__ */