xfs_trans_priv.h 4.4 KB
Newer Older
L
Linus Torvalds 已提交
1
/*
2 3
 * Copyright (c) 2000,2002,2005 Silicon Graphics, Inc.
 * All Rights Reserved.
L
Linus Torvalds 已提交
4
 *
5 6
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
L
Linus Torvalds 已提交
7 8
 * published by the Free Software Foundation.
 *
9 10 11 12
 * This program is distributed in the hope that it would be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
L
Linus Torvalds 已提交
13
 *
14 15 16
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write the Free Software Foundation,
 * Inc.,  51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
L
Linus Torvalds 已提交
17 18 19 20 21 22 23 24
 */
#ifndef __XFS_TRANS_PRIV_H__
#define	__XFS_TRANS_PRIV_H__

struct xfs_log_item;
struct xfs_log_item_desc;
struct xfs_mount;
struct xfs_trans;
25 26
struct xfs_ail;
struct xfs_log_vec;
L
Linus Torvalds 已提交
27

28 29
void	xfs_trans_add_item(struct xfs_trans *, struct xfs_log_item *);
void	xfs_trans_del_item(struct xfs_log_item *);
30 31
void	xfs_trans_free_items(struct xfs_trans *tp, xfs_lsn_t commit_lsn,
				int flags);
32
void	xfs_trans_unreserve_and_mod_sb(struct xfs_trans *tp);
L
Linus Torvalds 已提交
33

34 35
void	xfs_trans_committed_bulk(struct xfs_ail *ailp, struct xfs_log_vec *lv,
				xfs_lsn_t commit_lsn, int aborted);
L
Linus Torvalds 已提交
36
/*
37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53
 * AIL traversal cursor.
 *
 * Rather than using a generation number for detecting changes in the ail, use
 * a cursor that is protected by the ail lock. The aild cursor exists in the
 * struct xfs_ail, but other traversals can declare it on the stack and link it
 * to the ail list.
 *
 * When an object is deleted from or moved int the AIL, the cursor list is
 * searched to see if the object is a designated cursor item. If it is, it is
 * deleted from the cursor so that the next time the cursor is used traversal
 * will return to the start.
 *
 * This means a traversal colliding with a removal will cause a restart of the
 * list scan, rather than any insertion or deletion anywhere in the list. The
 * low bit of the item pointer is set if the cursor has been invalidated so
 * that we can tell the difference between invalidation and reaching the end
 * of the list to trigger traversal restarts.
L
Linus Torvalds 已提交
54
 */
55
struct xfs_ail_cursor {
56
	struct list_head	list;
57 58
	struct xfs_log_item	*item;
};
L
Linus Torvalds 已提交
59

60
/*
61 62 63
 * Private AIL structures.
 *
 * Eventually we need to drive the locking in here as well.
64
 */
D
David Chinner 已提交
65 66
struct xfs_ail {
	struct xfs_mount	*xa_mount;
67
	struct task_struct	*xa_task;
D
David Chinner 已提交
68 69
	struct list_head	xa_ail;
	xfs_lsn_t		xa_target;
70
	struct list_head	xa_cursors;
71
	spinlock_t		xa_lock;
72
	xfs_lsn_t		xa_last_pushed_lsn;
73
	int			xa_log_flush;
74
	wait_queue_head_t	xa_empty;
D
David Chinner 已提交
75 76
};

77 78 79
/*
 * From xfs_trans_ail.c
 */
80
void	xfs_trans_ail_update_bulk(struct xfs_ail *ailp,
81
				struct xfs_ail_cursor *cur,
82 83 84 85 86 87 88 89
				struct xfs_log_item **log_items, int nr_items,
				xfs_lsn_t lsn) __releases(ailp->xa_lock);
static inline void
xfs_trans_ail_update(
	struct xfs_ail		*ailp,
	struct xfs_log_item	*lip,
	xfs_lsn_t		lsn) __releases(ailp->xa_lock)
{
90
	xfs_trans_ail_update_bulk(ailp, NULL, &lip, 1, lsn);
91 92
}

93 94 95 96 97 98 99 100 101 102 103
void	xfs_trans_ail_delete_bulk(struct xfs_ail *ailp,
				struct xfs_log_item **log_items, int nr_items)
				__releases(ailp->xa_lock);
static inline void
xfs_trans_ail_delete(
	struct xfs_ail	*ailp,
	xfs_log_item_t	*lip) __releases(ailp->xa_lock)
{
	xfs_trans_ail_delete_bulk(ailp, &lip, 1);
}

104 105
void			xfs_ail_push(struct xfs_ail *, xfs_lsn_t);
void			xfs_ail_push_all(struct xfs_ail *);
106
void			xfs_ail_push_all_sync(struct xfs_ail *);
107
struct xfs_log_item	*xfs_ail_min(struct xfs_ail  *ailp);
108 109
xfs_lsn_t		xfs_ail_min_lsn(struct xfs_ail *ailp);

110
struct xfs_log_item *	xfs_trans_ail_cursor_first(struct xfs_ail *ailp,
111 112
					struct xfs_ail_cursor *cur,
					xfs_lsn_t lsn);
113 114 115 116
struct xfs_log_item *	xfs_trans_ail_cursor_last(struct xfs_ail *ailp,
					struct xfs_ail_cursor *cur,
					xfs_lsn_t lsn);
struct xfs_log_item *	xfs_trans_ail_cursor_next(struct xfs_ail *ailp,
117
					struct xfs_ail_cursor *cur);
118
void			xfs_trans_ail_cursor_done(struct xfs_ail *ailp,
119 120
					struct xfs_ail_cursor *cur);

121 122 123 124 125 126 127 128
#if BITS_PER_LONG != 64
static inline void
xfs_trans_ail_copy_lsn(
	struct xfs_ail	*ailp,
	xfs_lsn_t	*dst,
	xfs_lsn_t	*src)
{
	ASSERT(sizeof(xfs_lsn_t) == 8);	/* don't lock if it shrinks */
129
	spin_lock(&ailp->xa_lock);
130
	*dst = *src;
131
	spin_unlock(&ailp->xa_lock);
132 133 134 135 136 137 138 139 140 141 142 143
}
#else
static inline void
xfs_trans_ail_copy_lsn(
	struct xfs_ail	*ailp,
	xfs_lsn_t	*dst,
	xfs_lsn_t	*src)
{
	ASSERT(sizeof(xfs_lsn_t) == 8);
	*dst = *src;
}
#endif
L
Linus Torvalds 已提交
144
#endif	/* __XFS_TRANS_PRIV_H__ */