[deliverable/linux.git] / fs / xfs / xfs_trans_priv.h

/*
 * Copyright (c) 2000,2002,2005 Silicon Graphics, Inc.
 * All Rights Reserved.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
 * published by the Free Software Foundation.
 *
 * 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.
 *
 * 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
 */
#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;
struct xfs_ail;
struct xfs_log_vec;

void	xfs_trans_add_item(struct xfs_trans *, struct xfs_log_item *);
void	xfs_trans_del_item(struct xfs_log_item *);
void	xfs_trans_free_items(struct xfs_trans *tp, xfs_lsn_t commit_lsn,
				int flags);
void	xfs_trans_unreserve_and_mod_sb(struct xfs_trans *tp);

void	xfs_trans_committed_bulk(struct xfs_ail *ailp, struct xfs_log_vec *lv,
				xfs_lsn_t commit_lsn, int aborted);
/*
 * 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.
 */
struct xfs_ail_cursor {
	struct xfs_ail_cursor	*next;
	struct xfs_log_item	*item;
};

/*
 * Private AIL structures.
 *
 * Eventually we need to drive the locking in here as well.
 */
struct xfs_ail {
	struct xfs_mount	*xa_mount;
	struct list_head	xa_ail;
	uint			xa_gen;
	struct task_struct	*xa_task;
	xfs_lsn_t		xa_target;
	struct xfs_ail_cursor	xa_cursors;
	spinlock_t		xa_lock;
};

/*
 * From xfs_trans_ail.c
 */
void	xfs_trans_ail_update_bulk(struct xfs_ail *ailp,
				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)
{
	xfs_trans_ail_update_bulk(ailp, &lip, 1, lsn);
}

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

void			xfs_trans_ail_push(struct xfs_ail *, xfs_lsn_t);
void			xfs_trans_unlocked_item(struct xfs_ail *,
					xfs_log_item_t *);

xfs_lsn_t		xfs_trans_ail_tail(struct xfs_ail *ailp);

struct xfs_log_item	*xfs_trans_ail_cursor_first(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,
					struct xfs_ail_cursor *cur);
void			xfs_trans_ail_cursor_done(struct xfs_ail *ailp,
					struct xfs_ail_cursor *cur);

long	xfsaild_push(struct xfs_ail *, xfs_lsn_t *);
void	xfsaild_wakeup(struct xfs_ail *, xfs_lsn_t);
int	xfsaild_start(struct xfs_ail *);
void	xfsaild_stop(struct xfs_ail *);

#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 */
	spin_lock(&ailp->xa_lock);
	*dst = *src;
	spin_unlock(&ailp->xa_lock);
}
#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
#endif	/* __XFS_TRANS_PRIV_H__ */
Commit	Line	Data
1da177e4	1	/*
7b718769 NS	2	* Copyright (c) 2000,2002,2005 Silicon Graphics, Inc.
7b718769 NS	3	* All Rights Reserved.
1da177e4	4	*
7b718769 NS	5	* This program is free software; you can redistribute it and/or
7b718769 NS	6	* modify it under the terms of the GNU General Public License as
1da177e4 LT	7	* published by the Free Software Foundation.
1da177e4 LT	8	*
7b718769 NS	9	* This program is distributed in the hope that it would be useful,
	10	* but WITHOUT ANY WARRANTY; without even the implied warranty of
	11	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	12	* GNU General Public License for more details.
1da177e4	13	*
7b718769 NS	14	* You should have received a copy of the GNU General Public License
	15	* along with this program; if not, write the Free Software Foundation,
	16	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
1da177e4 LT	17	*/
	18	#ifndef __XFS_TRANS_PRIV_H__
	19	#define __XFS_TRANS_PRIV_H__
	20
	21	struct xfs_log_item;
	22	struct xfs_log_item_desc;
	23	struct xfs_mount;
	24	struct xfs_trans;
0e57f6a3 DC	25	struct xfs_ail;
0e57f6a3 DC	26	struct xfs_log_vec;
1da177e4	27
e98c414f CH	28	void xfs_trans_add_item(struct xfs_trans , struct xfs_log_item );
e98c414f CH	29	void xfs_trans_del_item(struct xfs_log_item *);
d17c701c DC	30	void xfs_trans_free_items(struct xfs_trans *tp, xfs_lsn_t commit_lsn,
d17c701c DC	31	int flags);
71e330b5	32	void xfs_trans_unreserve_and_mod_sb(struct xfs_trans *tp);
1da177e4	33
0e57f6a3 DC	34	void xfs_trans_committed_bulk(struct xfs_ail ailp, struct xfs_log_vec lv,
0e57f6a3 DC	35	xfs_lsn_t commit_lsn, int aborted);
1da177e4	36	/*
27d8d5fe DC	37	* AIL traversal cursor.
	38	*
	39	* Rather than using a generation number for detecting changes in the ail, use
	40	* a cursor that is protected by the ail lock. The aild cursor exists in the
	41	* struct xfs_ail, but other traversals can declare it on the stack and link it
	42	* to the ail list.
	43	*
	44	* When an object is deleted from or moved int the AIL, the cursor list is
	45	* searched to see if the object is a designated cursor item. If it is, it is
	46	* deleted from the cursor so that the next time the cursor is used traversal
	47	* will return to the start.
	48	*
	49	* This means a traversal colliding with a removal will cause a restart of the
	50	* list scan, rather than any insertion or deletion anywhere in the list. The
	51	* low bit of the item pointer is set if the cursor has been invalidated so
	52	* that we can tell the difference between invalidation and reaching the end
	53	* of the list to trigger traversal restarts.
1da177e4	54	*/
27d8d5fe DC	55	struct xfs_ail_cursor {
	56	struct xfs_ail_cursor *next;
	57	struct xfs_log_item *item;
	58	};
1da177e4	59
249a8c11	60	/*
27d8d5fe DC	61	* Private AIL structures.
	62	*
	63	* Eventually we need to drive the locking in here as well.
249a8c11	64	*/
82fa9012 DC	65	struct xfs_ail {
	66	struct xfs_mount *xa_mount;
	67	struct list_head xa_ail;
	68	uint xa_gen;
	69	struct task_struct *xa_task;
	70	xfs_lsn_t xa_target;
27d8d5fe	71	struct xfs_ail_cursor xa_cursors;
c7e8f268	72	spinlock_t xa_lock;
82fa9012 DC	73	};
82fa9012 DC	74
27d8d5fe DC	75	/*
	76	* From xfs_trans_ail.c
	77	*/
e6059949 DC	78	void xfs_trans_ail_update_bulk(struct xfs_ail *ailp,
	79	struct xfs_log_item **log_items, int nr_items,
	80	xfs_lsn_t lsn) __releases(ailp->xa_lock);
	81	static inline void
	82	xfs_trans_ail_update(
	83	struct xfs_ail *ailp,
	84	struct xfs_log_item *lip,
	85	xfs_lsn_t lsn) __releases(ailp->xa_lock)
	86	{
	87	xfs_trans_ail_update_bulk(ailp, &lip, 1, lsn);
	88	}
	89
9552e7f2 DC	90	void xfs_trans_ail_delete_bulk(struct xfs_ail *ailp,
	91	struct xfs_log_item **log_items, int nr_items)
	92	__releases(ailp->xa_lock);
	93	static inline void
	94	xfs_trans_ail_delete(
	95	struct xfs_ail *ailp,
	96	xfs_log_item_t *lip) __releases(ailp->xa_lock)
	97	{
	98	xfs_trans_ail_delete_bulk(ailp, &lip, 1);
	99	}
	100
783a2f65 DC	101	void xfs_trans_ail_push(struct xfs_ail *, xfs_lsn_t);
	102	void xfs_trans_unlocked_item(struct xfs_ail *,
	103	xfs_log_item_t *);
27d8d5fe	104
5b00f14f DC	105	xfs_lsn_t xfs_trans_ail_tail(struct xfs_ail *ailp);
	106
	107	struct xfs_log_item xfs_trans_ail_cursor_first(struct xfs_ail ailp,
	108	struct xfs_ail_cursor *cur,
	109	xfs_lsn_t lsn);
	110	struct xfs_log_item xfs_trans_ail_cursor_next(struct xfs_ail ailp,
27d8d5fe	111	struct xfs_ail_cursor *cur);
5b00f14f	112	void xfs_trans_ail_cursor_done(struct xfs_ail *ailp,
27d8d5fe DC	113	struct xfs_ail_cursor *cur);
27d8d5fe DC	114
82fa9012 DC	115	long xfsaild_push(struct xfs_ail , xfs_lsn_t );
	116	void xfsaild_wakeup(struct xfs_ail *, xfs_lsn_t);
	117	int xfsaild_start(struct xfs_ail *);
	118	void xfsaild_stop(struct xfs_ail *);
249a8c11	119
7b2e2a31 DC	120	#if BITS_PER_LONG != 64
	121	static inline void
	122	xfs_trans_ail_copy_lsn(
	123	struct xfs_ail *ailp,
	124	xfs_lsn_t *dst,
	125	xfs_lsn_t *src)
	126	{
	127	ASSERT(sizeof(xfs_lsn_t) == 8); /* don't lock if it shrinks */
c7e8f268	128	spin_lock(&ailp->xa_lock);
7b2e2a31	129	dst = src;
c7e8f268	130	spin_unlock(&ailp->xa_lock);
7b2e2a31 DC	131	}
	132	#else
	133	static inline void
	134	xfs_trans_ail_copy_lsn(
	135	struct xfs_ail *ailp,
	136	xfs_lsn_t *dst,
	137	xfs_lsn_t *src)
	138	{
	139	ASSERT(sizeof(xfs_lsn_t) == 8);
	140	dst = src;
	141	}
	142	#endif
1da177e4	143	#endif /* __XFS_TRANS_PRIV_H__ */