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;
28 void xfs_trans_add_item(struct xfs_trans *, struct xfs_log_item *);
29 void xfs_trans_del_item(struct xfs_log_item *);
30 void xfs_trans_free_items(struct xfs_trans *tp, xfs_lsn_t commit_lsn,
32 void xfs_trans_unreserve_and_mod_sb(struct xfs_trans *tp);
34 void xfs_trans_committed_bulk(struct xfs_ail *ailp, struct xfs_log_vec *lv,
35 xfs_lsn_t commit_lsn, int aborted);
37 * AIL traversal cursor.
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
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.
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.
55 struct xfs_ail_cursor {
56 struct xfs_ail_cursor *next;
57 struct xfs_log_item *item;
61 * Private AIL structures.
63 * Eventually we need to drive the locking in here as well.
66 struct xfs_mount *xa_mount;
67 struct list_head xa_ail;
69 struct task_struct *xa_task;
71 struct xfs_ail_cursor xa_cursors;
76 * From xfs_trans_ail.c
78 void xfs_trans_ail_update(struct xfs_ail *ailp,
79 struct xfs_log_item *lip, xfs_lsn_t lsn)
80 __releases(ailp->xa_lock);
81 void xfs_trans_ail_update_bulk(struct xfs_ail *ailp,
82 struct xfs_log_item **log_items,
83 int nr_items, xfs_lsn_t lsn)
84 __releases(ailp->xa_lock);
85 void xfs_trans_ail_delete(struct xfs_ail *ailp,
86 struct xfs_log_item *lip)
87 __releases(ailp->xa_lock);
88 void xfs_trans_ail_push(struct xfs_ail *, xfs_lsn_t);
89 void xfs_trans_unlocked_item(struct xfs_ail *,
92 xfs_lsn_t xfs_trans_ail_tail(struct xfs_ail *ailp);
94 struct xfs_log_item *xfs_trans_ail_cursor_first(struct xfs_ail *ailp,
95 struct xfs_ail_cursor *cur,
97 struct xfs_log_item *xfs_trans_ail_cursor_next(struct xfs_ail *ailp,
98 struct xfs_ail_cursor *cur);
99 void xfs_trans_ail_cursor_done(struct xfs_ail *ailp,
100 struct xfs_ail_cursor *cur);
102 long xfsaild_push(struct xfs_ail *, xfs_lsn_t *);
103 void xfsaild_wakeup(struct xfs_ail *, xfs_lsn_t);
104 int xfsaild_start(struct xfs_ail *);
105 void xfsaild_stop(struct xfs_ail *);
107 #if BITS_PER_LONG != 64
109 xfs_trans_ail_copy_lsn(
110 struct xfs_ail *ailp,
114 ASSERT(sizeof(xfs_lsn_t) == 8); /* don't lock if it shrinks */
115 spin_lock(&ailp->xa_lock);
117 spin_unlock(&ailp->xa_lock);
121 xfs_trans_ail_copy_lsn(
122 struct xfs_ail *ailp,
126 ASSERT(sizeof(xfs_lsn_t) == 8);
130 #endif /* __XFS_TRANS_PRIV_H__ */