blob: c6e4f2c8de6e8049a760b1510eb42beb54a295ae [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
Nathan Scott7b718762005-11-02 14:58:39 +11002 * Copyright (c) 2000,2002,2005 Silicon Graphics, Inc.
3 * All Rights Reserved.
Linus Torvalds1da177e2005-04-16 15:20:36 -07004 *
Nathan Scott7b718762005-11-02 14:58:39 +11005 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
Linus Torvalds1da177e2005-04-16 15:20:36 -07007 * published by the Free Software Foundation.
8 *
Nathan Scott7b718762005-11-02 14:58:39 +11009 * 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.
Linus Torvalds1da177e2005-04-16 15:20:36 -070013 *
Nathan Scott7b718762005-11-02 14:58:39 +110014 * 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
Linus Torvalds1da177e2005-04-16 15:20:36 -070017 */
18#ifndef __XFS_TRANS_PRIV_H__
19#define __XFS_TRANS_PRIV_H__
20
21struct xfs_log_item;
22struct xfs_log_item_desc;
23struct xfs_mount;
24struct xfs_trans;
25
26/*
27 * From xfs_trans_item.c
28 */
29struct xfs_log_item_desc *xfs_trans_add_item(struct xfs_trans *,
30 struct xfs_log_item *);
31void xfs_trans_free_item(struct xfs_trans *,
32 struct xfs_log_item_desc *);
33struct xfs_log_item_desc *xfs_trans_find_item(struct xfs_trans *,
34 struct xfs_log_item *);
35struct xfs_log_item_desc *xfs_trans_first_item(struct xfs_trans *);
36struct xfs_log_item_desc *xfs_trans_next_item(struct xfs_trans *,
37 struct xfs_log_item_desc *);
Dave Chinner71e330b2010-05-21 14:37:18 +100038
39void xfs_trans_unlock_items(struct xfs_trans *tp, xfs_lsn_t commit_lsn);
40void xfs_trans_free_items(struct xfs_trans *tp, xfs_lsn_t commit_lsn,
41 int flags);
42
43void xfs_trans_item_committed(struct xfs_log_item *lip,
44 xfs_lsn_t commit_lsn, int aborted);
45void xfs_trans_unreserve_and_mod_sb(struct xfs_trans *tp);
Linus Torvalds1da177e2005-04-16 15:20:36 -070046
47/*
David Chinner27d8d5f2008-10-30 17:38:39 +110048 * AIL traversal cursor.
49 *
50 * Rather than using a generation number for detecting changes in the ail, use
51 * a cursor that is protected by the ail lock. The aild cursor exists in the
52 * struct xfs_ail, but other traversals can declare it on the stack and link it
53 * to the ail list.
54 *
55 * When an object is deleted from or moved int the AIL, the cursor list is
56 * searched to see if the object is a designated cursor item. If it is, it is
57 * deleted from the cursor so that the next time the cursor is used traversal
58 * will return to the start.
59 *
60 * This means a traversal colliding with a removal will cause a restart of the
61 * list scan, rather than any insertion or deletion anywhere in the list. The
62 * low bit of the item pointer is set if the cursor has been invalidated so
63 * that we can tell the difference between invalidation and reaching the end
64 * of the list to trigger traversal restarts.
65 */
66struct xfs_ail_cursor {
67 struct xfs_ail_cursor *next;
68 struct xfs_log_item *item;
69};
70
71/*
72 * Private AIL structures.
73 *
74 * Eventually we need to drive the locking in here as well.
75 */
76struct xfs_ail {
77 struct xfs_mount *xa_mount;
78 struct list_head xa_ail;
79 uint xa_gen;
80 struct task_struct *xa_task;
81 xfs_lsn_t xa_target;
82 struct xfs_ail_cursor xa_cursors;
David Chinnerc7e8f262008-10-30 17:39:23 +110083 spinlock_t xa_lock;
David Chinner27d8d5f2008-10-30 17:38:39 +110084};
85
86/*
Linus Torvalds1da177e2005-04-16 15:20:36 -070087 * From xfs_trans_ail.c
88 */
David Chinner783a2f62008-10-30 17:39:58 +110089void xfs_trans_ail_update(struct xfs_ail *ailp,
90 struct xfs_log_item *lip, xfs_lsn_t lsn)
91 __releases(ailp->xa_lock);
92void xfs_trans_ail_delete(struct xfs_ail *ailp,
93 struct xfs_log_item *lip)
94 __releases(ailp->xa_lock);
95void xfs_trans_ail_push(struct xfs_ail *, xfs_lsn_t);
96void xfs_trans_unlocked_item(struct xfs_ail *,
97 xfs_log_item_t *);
Linus Torvalds1da177e2005-04-16 15:20:36 -070098
David Chinner5b00f142008-10-30 17:39:00 +110099xfs_lsn_t xfs_trans_ail_tail(struct xfs_ail *ailp);
100
101struct xfs_log_item *xfs_trans_ail_cursor_first(struct xfs_ail *ailp,
102 struct xfs_ail_cursor *cur,
103 xfs_lsn_t lsn);
104struct xfs_log_item *xfs_trans_ail_cursor_next(struct xfs_ail *ailp,
David Chinner27d8d5f2008-10-30 17:38:39 +1100105 struct xfs_ail_cursor *cur);
David Chinner5b00f142008-10-30 17:39:00 +1100106void xfs_trans_ail_cursor_done(struct xfs_ail *ailp,
David Chinner27d8d5f2008-10-30 17:38:39 +1100107 struct xfs_ail_cursor *cur);
David Chinner82fa9012008-10-30 17:38:26 +1100108
109long xfsaild_push(struct xfs_ail *, xfs_lsn_t *);
110void xfsaild_wakeup(struct xfs_ail *, xfs_lsn_t);
111int xfsaild_start(struct xfs_ail *);
112void xfsaild_stop(struct xfs_ail *);
David Chinner249a8c12008-02-05 12:13:32 +1100113
David Chinner7b2e2a32008-10-30 17:39:12 +1100114#if BITS_PER_LONG != 64
115static inline void
116xfs_trans_ail_copy_lsn(
117 struct xfs_ail *ailp,
118 xfs_lsn_t *dst,
119 xfs_lsn_t *src)
120{
121 ASSERT(sizeof(xfs_lsn_t) == 8); /* don't lock if it shrinks */
David Chinnerc7e8f262008-10-30 17:39:23 +1100122 spin_lock(&ailp->xa_lock);
David Chinner7b2e2a32008-10-30 17:39:12 +1100123 *dst = *src;
David Chinnerc7e8f262008-10-30 17:39:23 +1100124 spin_unlock(&ailp->xa_lock);
David Chinner7b2e2a32008-10-30 17:39:12 +1100125}
126#else
127static inline void
128xfs_trans_ail_copy_lsn(
129 struct xfs_ail *ailp,
130 xfs_lsn_t *dst,
131 xfs_lsn_t *src)
132{
133 ASSERT(sizeof(xfs_lsn_t) == 8);
134 *dst = *src;
135}
136#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700137#endif /* __XFS_TRANS_PRIV_H__ */