2 * Copyright (c) 2000,2002,2005 Silicon Graphics, Inc.
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation.
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.
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
18 #ifndef __XFS_TRANS_PRIV_H__
19 #define __XFS_TRANS_PRIV_H__
22 struct xfs_log_item_desc;
27 * From xfs_trans_item.c
29 struct xfs_log_item_desc *xfs_trans_add_item(struct xfs_trans *,
30 struct xfs_log_item *);
31 void xfs_trans_free_item(struct xfs_trans *,
32 struct xfs_log_item_desc *);
33 struct xfs_log_item_desc *xfs_trans_find_item(struct xfs_trans *,
34 struct xfs_log_item *);
35 struct xfs_log_item_desc *xfs_trans_first_item(struct xfs_trans *);
36 struct xfs_log_item_desc *xfs_trans_next_item(struct xfs_trans *,
37 struct xfs_log_item_desc *);
38 void xfs_trans_free_items(struct xfs_trans *, int);
39 void xfs_trans_unlock_items(struct xfs_trans *,
43 * AIL traversal cursor.
45 * Rather than using a generation number for detecting changes in the ail, use
46 * a cursor that is protected by the ail lock. The aild cursor exists in the
47 * struct xfs_ail, but other traversals can declare it on the stack and link it
50 * When an object is deleted from or moved int the AIL, the cursor list is
51 * searched to see if the object is a designated cursor item. If it is, it is
52 * deleted from the cursor so that the next time the cursor is used traversal
53 * will return to the start.
55 * This means a traversal colliding with a removal will cause a restart of the
56 * list scan, rather than any insertion or deletion anywhere in the list. The
57 * low bit of the item pointer is set if the cursor has been invalidated so
58 * that we can tell the difference between invalidation and reaching the end
59 * of the list to trigger traversal restarts.
61 struct xfs_ail_cursor {
62 struct xfs_ail_cursor *next;
63 struct xfs_log_item *item;
67 * Private AIL structures.
69 * Eventually we need to drive the locking in here as well.
72 struct xfs_mount *xa_mount;
73 struct list_head xa_ail;
75 struct task_struct *xa_task;
77 struct xfs_ail_cursor xa_cursors;
82 * From xfs_trans_ail.c
84 void xfs_trans_ail_update(struct xfs_ail *ailp,
85 struct xfs_log_item *lip, xfs_lsn_t lsn)
86 __releases(ailp->xa_lock);
87 void xfs_trans_ail_delete(struct xfs_ail *ailp,
88 struct xfs_log_item *lip)
89 __releases(ailp->xa_lock);
90 void xfs_trans_ail_push(struct xfs_ail *, xfs_lsn_t);
91 void xfs_trans_unlocked_item(struct xfs_ail *,
94 xfs_lsn_t xfs_trans_ail_tail(struct xfs_ail *ailp);
96 struct xfs_log_item *xfs_trans_ail_cursor_first(struct xfs_ail *ailp,
97 struct xfs_ail_cursor *cur,
99 struct xfs_log_item *xfs_trans_ail_cursor_next(struct xfs_ail *ailp,
100 struct xfs_ail_cursor *cur);
101 void xfs_trans_ail_cursor_done(struct xfs_ail *ailp,
102 struct xfs_ail_cursor *cur);
104 long xfsaild_push(struct xfs_ail *, xfs_lsn_t *);
105 void xfsaild_wakeup(struct xfs_ail *, xfs_lsn_t);
106 int xfsaild_start(struct xfs_ail *);
107 void xfsaild_stop(struct xfs_ail *);
109 #if BITS_PER_LONG != 64
111 xfs_trans_ail_copy_lsn(
112 struct xfs_ail *ailp,
116 ASSERT(sizeof(xfs_lsn_t) == 8); /* don't lock if it shrinks */
117 spin_lock(&ailp->xa_lock);
119 spin_unlock(&ailp->xa_lock);
123 xfs_trans_ail_copy_lsn(
124 struct xfs_ail *ailp,
128 ASSERT(sizeof(xfs_lsn_t) == 8);
132 #endif /* __XFS_TRANS_PRIV_H__ */