Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (c) 2000,2002,2005 Silicon Graphics, Inc.
4 * All Rights Reserved.
5 */
6#ifndef __XFS_TRANS_PRIV_H__
7#define __XFS_TRANS_PRIV_H__
8
9struct xlog;
10struct xfs_log_item;
11struct xfs_mount;
12struct xfs_trans;
13struct xfs_ail;
14struct xfs_log_vec;
15
16
17void xfs_trans_init(struct xfs_mount *);
18void xfs_trans_add_item(struct xfs_trans *, struct xfs_log_item *);
19void xfs_trans_del_item(struct xfs_log_item *);
20void xfs_trans_unreserve_and_mod_sb(struct xfs_trans *tp);
21
22void xfs_trans_committed_bulk(struct xfs_ail *ailp,
23 struct list_head *lv_chain,
24 xfs_lsn_t commit_lsn, bool aborted);
25/*
26 * AIL traversal cursor.
27 *
28 * Rather than using a generation number for detecting changes in the ail, use
29 * a cursor that is protected by the ail lock. The aild cursor exists in the
30 * struct xfs_ail, but other traversals can declare it on the stack and link it
31 * to the ail list.
32 *
33 * When an object is deleted from or moved int the AIL, the cursor list is
34 * searched to see if the object is a designated cursor item. If it is, it is
35 * deleted from the cursor so that the next time the cursor is used traversal
36 * will return to the start.
37 *
38 * This means a traversal colliding with a removal will cause a restart of the
39 * list scan, rather than any insertion or deletion anywhere in the list. The
40 * low bit of the item pointer is set if the cursor has been invalidated so
41 * that we can tell the difference between invalidation and reaching the end
42 * of the list to trigger traversal restarts.
43 */
44struct xfs_ail_cursor {
45 struct list_head list;
46 struct xfs_log_item *item;
47};
48
49/*
50 * Private AIL structures.
51 *
52 * Eventually we need to drive the locking in here as well.
53 */
54struct xfs_ail {
55 struct xlog *ail_log;
56 struct task_struct *ail_task;
57 struct list_head ail_head;
58 xfs_lsn_t ail_target;
59 xfs_lsn_t ail_target_prev;
60 struct list_head ail_cursors;
61 spinlock_t ail_lock;
62 xfs_lsn_t ail_last_pushed_lsn;
63 int ail_log_flush;
64 struct list_head ail_buf_list;
65 wait_queue_head_t ail_empty;
66};
67
68/*
69 * From xfs_trans_ail.c
70 */
71void xfs_trans_ail_update_bulk(struct xfs_ail *ailp,
72 struct xfs_ail_cursor *cur,
73 struct xfs_log_item **log_items, int nr_items,
74 xfs_lsn_t lsn) __releases(ailp->ail_lock);
75/*
76 * Return a pointer to the first item in the AIL. If the AIL is empty, then
77 * return NULL.
78 */
79static inline struct xfs_log_item *
80xfs_ail_min(
81 struct xfs_ail *ailp)
82{
83 return list_first_entry_or_null(&ailp->ail_head, struct xfs_log_item,
84 li_ail);
85}
86
87static inline void
88xfs_trans_ail_update(
89 struct xfs_ail *ailp,
90 struct xfs_log_item *lip,
91 xfs_lsn_t lsn) __releases(ailp->ail_lock)
92{
93 xfs_trans_ail_update_bulk(ailp, NULL, &lip, 1, lsn);
94}
95
96void xfs_trans_ail_insert(struct xfs_ail *ailp, struct xfs_log_item *lip,
97 xfs_lsn_t lsn);
98
99xfs_lsn_t xfs_ail_delete_one(struct xfs_ail *ailp, struct xfs_log_item *lip);
100void xfs_ail_update_finish(struct xfs_ail *ailp, xfs_lsn_t old_lsn)
101 __releases(ailp->ail_lock);
102void xfs_trans_ail_delete(struct xfs_log_item *lip, int shutdown_type);
103
104void xfs_ail_push(struct xfs_ail *, xfs_lsn_t);
105void xfs_ail_push_all(struct xfs_ail *);
106void xfs_ail_push_all_sync(struct xfs_ail *);
107struct xfs_log_item *xfs_ail_min(struct xfs_ail *ailp);
108xfs_lsn_t xfs_ail_min_lsn(struct xfs_ail *ailp);
109
110struct xfs_log_item * xfs_trans_ail_cursor_first(struct xfs_ail *ailp,
111 struct xfs_ail_cursor *cur,
112 xfs_lsn_t lsn);
113struct xfs_log_item * xfs_trans_ail_cursor_last(struct xfs_ail *ailp,
114 struct xfs_ail_cursor *cur,
115 xfs_lsn_t lsn);
116struct xfs_log_item * xfs_trans_ail_cursor_next(struct xfs_ail *ailp,
117 struct xfs_ail_cursor *cur);
118void xfs_trans_ail_cursor_done(struct xfs_ail_cursor *cur);
119
120#if BITS_PER_LONG != 64
121static inline void
122xfs_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 */
128 spin_lock(&ailp->ail_lock);
129 *dst = *src;
130 spin_unlock(&ailp->ail_lock);
131}
132#else
133static inline void
134xfs_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
143
144static inline void
145xfs_clear_li_failed(
146 struct xfs_log_item *lip)
147{
148 struct xfs_buf *bp = lip->li_buf;
149
150 ASSERT(test_bit(XFS_LI_IN_AIL, &lip->li_flags));
151 lockdep_assert_held(&lip->li_ailp->ail_lock);
152
153 if (test_and_clear_bit(XFS_LI_FAILED, &lip->li_flags)) {
154 lip->li_buf = NULL;
155 xfs_buf_rele(bp);
156 }
157}
158
159static inline void
160xfs_set_li_failed(
161 struct xfs_log_item *lip,
162 struct xfs_buf *bp)
163{
164 lockdep_assert_held(&lip->li_ailp->ail_lock);
165
166 if (!test_and_set_bit(XFS_LI_FAILED, &lip->li_flags)) {
167 xfs_buf_hold(bp);
168 lip->li_buf = bp;
169 }
170}
171
172#endif /* __XFS_TRANS_PRIV_H__ */
1/*
2 * Copyright (c) 2000,2002,2005 Silicon Graphics, Inc.
3 * All Rights Reserved.
4 *
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.
8 *
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.
13 *
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
17 */
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;
25struct xfs_ail;
26struct xfs_log_vec;
27
28
29void xfs_trans_init(struct xfs_mount *);
30void xfs_trans_add_item(struct xfs_trans *, struct xfs_log_item *);
31void xfs_trans_del_item(struct xfs_log_item *);
32void xfs_trans_free_items(struct xfs_trans *tp, xfs_lsn_t commit_lsn,
33 bool abort);
34void xfs_trans_unreserve_and_mod_sb(struct xfs_trans *tp);
35
36void xfs_trans_committed_bulk(struct xfs_ail *ailp, struct xfs_log_vec *lv,
37 xfs_lsn_t commit_lsn, int aborted);
38/*
39 * AIL traversal cursor.
40 *
41 * Rather than using a generation number for detecting changes in the ail, use
42 * a cursor that is protected by the ail lock. The aild cursor exists in the
43 * struct xfs_ail, but other traversals can declare it on the stack and link it
44 * to the ail list.
45 *
46 * When an object is deleted from or moved int the AIL, the cursor list is
47 * searched to see if the object is a designated cursor item. If it is, it is
48 * deleted from the cursor so that the next time the cursor is used traversal
49 * will return to the start.
50 *
51 * This means a traversal colliding with a removal will cause a restart of the
52 * list scan, rather than any insertion or deletion anywhere in the list. The
53 * low bit of the item pointer is set if the cursor has been invalidated so
54 * that we can tell the difference between invalidation and reaching the end
55 * of the list to trigger traversal restarts.
56 */
57struct xfs_ail_cursor {
58 struct list_head list;
59 struct xfs_log_item *item;
60};
61
62/*
63 * Private AIL structures.
64 *
65 * Eventually we need to drive the locking in here as well.
66 */
67struct xfs_ail {
68 struct xfs_mount *xa_mount;
69 struct task_struct *xa_task;
70 struct list_head xa_ail;
71 xfs_lsn_t xa_target;
72 xfs_lsn_t xa_target_prev;
73 struct list_head xa_cursors;
74 spinlock_t xa_lock;
75 xfs_lsn_t xa_last_pushed_lsn;
76 int xa_log_flush;
77 struct list_head xa_buf_list;
78 wait_queue_head_t xa_empty;
79};
80
81/*
82 * From xfs_trans_ail.c
83 */
84void xfs_trans_ail_update_bulk(struct xfs_ail *ailp,
85 struct xfs_ail_cursor *cur,
86 struct xfs_log_item **log_items, int nr_items,
87 xfs_lsn_t lsn) __releases(ailp->xa_lock);
88/*
89 * Return a pointer to the first item in the AIL. If the AIL is empty, then
90 * return NULL.
91 */
92static inline struct xfs_log_item *
93xfs_ail_min(
94 struct xfs_ail *ailp)
95{
96 return list_first_entry_or_null(&ailp->xa_ail, struct xfs_log_item,
97 li_ail);
98}
99
100static inline void
101xfs_trans_ail_update(
102 struct xfs_ail *ailp,
103 struct xfs_log_item *lip,
104 xfs_lsn_t lsn) __releases(ailp->xa_lock)
105{
106 xfs_trans_ail_update_bulk(ailp, NULL, &lip, 1, lsn);
107}
108
109void xfs_trans_ail_delete_bulk(struct xfs_ail *ailp,
110 struct xfs_log_item **log_items, int nr_items,
111 int shutdown_type)
112 __releases(ailp->xa_lock);
113static inline void
114xfs_trans_ail_delete(
115 struct xfs_ail *ailp,
116 xfs_log_item_t *lip,
117 int shutdown_type) __releases(ailp->xa_lock)
118{
119 xfs_trans_ail_delete_bulk(ailp, &lip, 1, shutdown_type);
120}
121
122static inline void
123xfs_trans_ail_remove(
124 struct xfs_log_item *lip,
125 int shutdown_type)
126{
127 struct xfs_ail *ailp = lip->li_ailp;
128
129 spin_lock(&ailp->xa_lock);
130 /* xfs_trans_ail_delete() drops the AIL lock */
131 if (lip->li_flags & XFS_LI_IN_AIL)
132 xfs_trans_ail_delete(ailp, lip, shutdown_type);
133 else
134 spin_unlock(&ailp->xa_lock);
135}
136
137void xfs_ail_push(struct xfs_ail *, xfs_lsn_t);
138void xfs_ail_push_all(struct xfs_ail *);
139void xfs_ail_push_all_sync(struct xfs_ail *);
140struct xfs_log_item *xfs_ail_min(struct xfs_ail *ailp);
141xfs_lsn_t xfs_ail_min_lsn(struct xfs_ail *ailp);
142
143struct xfs_log_item * xfs_trans_ail_cursor_first(struct xfs_ail *ailp,
144 struct xfs_ail_cursor *cur,
145 xfs_lsn_t lsn);
146struct xfs_log_item * xfs_trans_ail_cursor_last(struct xfs_ail *ailp,
147 struct xfs_ail_cursor *cur,
148 xfs_lsn_t lsn);
149struct xfs_log_item * xfs_trans_ail_cursor_next(struct xfs_ail *ailp,
150 struct xfs_ail_cursor *cur);
151void xfs_trans_ail_cursor_done(struct xfs_ail_cursor *cur);
152
153#if BITS_PER_LONG != 64
154static inline void
155xfs_trans_ail_copy_lsn(
156 struct xfs_ail *ailp,
157 xfs_lsn_t *dst,
158 xfs_lsn_t *src)
159{
160 ASSERT(sizeof(xfs_lsn_t) == 8); /* don't lock if it shrinks */
161 spin_lock(&ailp->xa_lock);
162 *dst = *src;
163 spin_unlock(&ailp->xa_lock);
164}
165#else
166static inline void
167xfs_trans_ail_copy_lsn(
168 struct xfs_ail *ailp,
169 xfs_lsn_t *dst,
170 xfs_lsn_t *src)
171{
172 ASSERT(sizeof(xfs_lsn_t) == 8);
173 *dst = *src;
174}
175#endif
176#endif /* __XFS_TRANS_PRIV_H__ */