]>
Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
7b718769 NS |
2 | * Copyright (c) 2000-2002,2005 Silicon Graphics, Inc. |
3 | * All Rights Reserved. | |
1da177e4 | 4 | * |
7b718769 NS |
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 | |
1da177e4 LT |
7 | * published by the Free Software Foundation. |
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 | 17 | */ |
1da177e4 | 18 | #include "xfs.h" |
a844f451 | 19 | #include "xfs_fs.h" |
1da177e4 | 20 | #include "xfs_types.h" |
1da177e4 | 21 | #include "xfs_log.h" |
a844f451 | 22 | #include "xfs_inum.h" |
1da177e4 LT |
23 | #include "xfs_trans.h" |
24 | #include "xfs_sb.h" | |
da353b0d | 25 | #include "xfs_ag.h" |
1da177e4 LT |
26 | #include "xfs_dmapi.h" |
27 | #include "xfs_mount.h" | |
28 | #include "xfs_trans_priv.h" | |
29 | #include "xfs_error.h" | |
30 | ||
82fa9012 DC |
31 | STATIC void xfs_ail_insert(struct xfs_ail *, xfs_log_item_t *); |
32 | STATIC xfs_log_item_t * xfs_ail_delete(struct xfs_ail *, xfs_log_item_t *); | |
33 | STATIC xfs_log_item_t * xfs_ail_min(struct xfs_ail *); | |
34 | STATIC xfs_log_item_t * xfs_ail_next(struct xfs_ail *, xfs_log_item_t *); | |
1da177e4 LT |
35 | |
36 | #ifdef DEBUG | |
82fa9012 | 37 | STATIC void xfs_ail_check(struct xfs_ail *, xfs_log_item_t *); |
1da177e4 | 38 | #else |
de08dbc1 | 39 | #define xfs_ail_check(a,l) |
1da177e4 LT |
40 | #endif /* DEBUG */ |
41 | ||
42 | ||
43 | /* | |
44 | * This is called by the log manager code to determine the LSN | |
45 | * of the tail of the log. This is exactly the LSN of the first | |
46 | * item in the AIL. If the AIL is empty, then this function | |
47 | * returns 0. | |
48 | * | |
49 | * We need the AIL lock in order to get a coherent read of the | |
50 | * lsn of the last item in the AIL. | |
51 | */ | |
52 | xfs_lsn_t | |
5b00f14f DC |
53 | xfs_trans_ail_tail( |
54 | struct xfs_ail *ailp) | |
1da177e4 LT |
55 | { |
56 | xfs_lsn_t lsn; | |
57 | xfs_log_item_t *lip; | |
1da177e4 | 58 | |
5b00f14f DC |
59 | spin_lock(&ailp->xa_mount->m_ail_lock); |
60 | lip = xfs_ail_min(ailp); | |
1da177e4 LT |
61 | if (lip == NULL) { |
62 | lsn = (xfs_lsn_t)0; | |
63 | } else { | |
64 | lsn = lip->li_lsn; | |
65 | } | |
5b00f14f | 66 | spin_unlock(&ailp->xa_mount->m_ail_lock); |
1da177e4 LT |
67 | |
68 | return lsn; | |
69 | } | |
70 | ||
71 | /* | |
72 | * xfs_trans_push_ail | |
73 | * | |
249a8c11 DC |
74 | * This routine is called to move the tail of the AIL forward. It does this by |
75 | * trying to flush items in the AIL whose lsns are below the given | |
76 | * threshold_lsn. | |
1da177e4 | 77 | * |
249a8c11 DC |
78 | * the push is run asynchronously in a separate thread, so we return the tail |
79 | * of the log right now instead of the tail after the push. This means we will | |
80 | * either continue right away, or we will sleep waiting on the async thread to | |
81 | * do it's work. | |
82 | * | |
83 | * We do this unlocked - we only need to know whether there is anything in the | |
84 | * AIL at the time we are called. We don't need to access the contents of | |
85 | * any of the objects, so the lock is not needed. | |
1da177e4 | 86 | */ |
249a8c11 | 87 | void |
1da177e4 LT |
88 | xfs_trans_push_ail( |
89 | xfs_mount_t *mp, | |
90 | xfs_lsn_t threshold_lsn) | |
91 | { | |
1da177e4 | 92 | xfs_log_item_t *lip; |
1da177e4 | 93 | |
82fa9012 | 94 | lip = xfs_ail_min(mp->m_ail); |
249a8c11 | 95 | if (lip && !XFS_FORCED_SHUTDOWN(mp)) { |
82fa9012 DC |
96 | if (XFS_LSN_CMP(threshold_lsn, mp->m_ail->xa_target) > 0) |
97 | xfsaild_wakeup(mp->m_ail, threshold_lsn); | |
249a8c11 DC |
98 | } |
99 | } | |
100 | ||
27d8d5fe DC |
101 | /* |
102 | * AIL traversal cursor initialisation. | |
103 | * | |
104 | * The cursor keeps track of where our current traversal is up | |
105 | * to by tracking the next ƣtem in the list for us. However, for | |
106 | * this to be safe, removing an object from the AIL needs to invalidate | |
107 | * any cursor that points to it. hence the traversal cursor needs to | |
108 | * be linked to the struct xfs_ail so that deletion can search all the | |
109 | * active cursors for invalidation. | |
110 | * | |
111 | * We don't link the push cursor because it is embedded in the struct | |
112 | * xfs_ail and hence easily findable. | |
113 | */ | |
5b00f14f | 114 | STATIC void |
27d8d5fe DC |
115 | xfs_trans_ail_cursor_init( |
116 | struct xfs_ail *ailp, | |
117 | struct xfs_ail_cursor *cur) | |
118 | { | |
119 | cur->item = NULL; | |
120 | if (cur == &ailp->xa_cursors) | |
121 | return; | |
122 | ||
123 | cur->next = ailp->xa_cursors.next; | |
124 | ailp->xa_cursors.next = cur; | |
125 | } | |
126 | ||
127 | /* | |
128 | * Set the cursor to the next item, because when we look | |
129 | * up the cursor the current item may have been freed. | |
130 | */ | |
131 | STATIC void | |
132 | xfs_trans_ail_cursor_set( | |
133 | struct xfs_ail *ailp, | |
134 | struct xfs_ail_cursor *cur, | |
135 | struct xfs_log_item *lip) | |
136 | { | |
137 | if (lip) | |
138 | cur->item = xfs_ail_next(ailp, lip); | |
139 | } | |
140 | ||
141 | /* | |
142 | * Get the next item in the traversal and advance the cursor. | |
143 | * If the cursor was invalidated (inidicated by a lip of 1), | |
144 | * restart the traversal. | |
145 | */ | |
5b00f14f | 146 | struct xfs_log_item * |
27d8d5fe DC |
147 | xfs_trans_ail_cursor_next( |
148 | struct xfs_ail *ailp, | |
149 | struct xfs_ail_cursor *cur) | |
150 | { | |
151 | struct xfs_log_item *lip = cur->item; | |
152 | ||
153 | if ((__psint_t)lip & 1) | |
154 | lip = xfs_ail_min(ailp); | |
155 | xfs_trans_ail_cursor_set(ailp, cur, lip); | |
156 | return lip; | |
157 | } | |
158 | ||
27d8d5fe DC |
159 | /* |
160 | * Now that the traversal is complete, we need to remove the cursor | |
161 | * from the list of traversing cursors. Avoid removing the embedded | |
162 | * push cursor, but use the fact it is alway present to make the | |
163 | * list deletion simple. | |
164 | */ | |
165 | void | |
166 | xfs_trans_ail_cursor_done( | |
167 | struct xfs_ail *ailp, | |
168 | struct xfs_ail_cursor *done) | |
169 | { | |
170 | struct xfs_ail_cursor *prev = NULL; | |
171 | struct xfs_ail_cursor *cur; | |
172 | ||
173 | done->item = NULL; | |
174 | if (done == &ailp->xa_cursors) | |
175 | return; | |
176 | prev = &ailp->xa_cursors; | |
177 | for (cur = prev->next; cur; prev = cur, cur = prev->next) { | |
178 | if (cur == done) { | |
179 | prev->next = cur->next; | |
180 | break; | |
181 | } | |
182 | } | |
183 | ASSERT(cur); | |
184 | } | |
185 | ||
5b00f14f DC |
186 | /* |
187 | * Invalidate any cursor that is pointing to this item. This is | |
188 | * called when an item is removed from the AIL. Any cursor pointing | |
189 | * to this object is now invalid and the traversal needs to be | |
190 | * terminated so it doesn't reference a freed object. We set the | |
191 | * cursor item to a value of 1 so we can distinguish between an | |
192 | * invalidation and the end of the list when getting the next item | |
193 | * from the cursor. | |
194 | */ | |
195 | STATIC void | |
196 | xfs_trans_ail_cursor_clear( | |
197 | struct xfs_ail *ailp, | |
198 | struct xfs_log_item *lip) | |
199 | { | |
200 | struct xfs_ail_cursor *cur; | |
201 | ||
202 | /* need to search all cursors */ | |
203 | for (cur = &ailp->xa_cursors; cur; cur = cur->next) { | |
204 | if (cur->item == lip) | |
205 | cur->item = (struct xfs_log_item *) | |
206 | ((__psint_t)cur->item | 1); | |
207 | } | |
208 | } | |
209 | ||
249a8c11 DC |
210 | /* |
211 | * Return the item in the AIL with the current lsn. | |
212 | * Return the current tree generation number for use | |
213 | * in calls to xfs_trans_next_ail(). | |
214 | */ | |
5b00f14f DC |
215 | xfs_log_item_t * |
216 | xfs_trans_ail_cursor_first( | |
27d8d5fe DC |
217 | struct xfs_ail *ailp, |
218 | struct xfs_ail_cursor *cur, | |
219 | xfs_lsn_t lsn) | |
249a8c11 | 220 | { |
27d8d5fe | 221 | xfs_log_item_t *lip; |
249a8c11 | 222 | |
5b00f14f | 223 | xfs_trans_ail_cursor_init(ailp, cur); |
27d8d5fe | 224 | lip = xfs_ail_min(ailp); |
249a8c11 | 225 | if (lsn == 0) |
5b00f14f | 226 | goto out; |
249a8c11 | 227 | |
27d8d5fe | 228 | list_for_each_entry(lip, &ailp->xa_ail, li_ail) { |
5b00f14f DC |
229 | if (XFS_LSN_CMP(lip->li_lsn, lsn) >= 0) |
230 | break; | |
535f6b37 | 231 | } |
5b00f14f DC |
232 | lip = NULL; |
233 | out: | |
234 | xfs_trans_ail_cursor_set(ailp, cur, lip); | |
235 | return lip; | |
249a8c11 DC |
236 | } |
237 | ||
238 | /* | |
239 | * Function that does the work of pushing on the AIL | |
240 | */ | |
241 | long | |
242 | xfsaild_push( | |
82fa9012 | 243 | struct xfs_ail *ailp, |
249a8c11 DC |
244 | xfs_lsn_t *last_lsn) |
245 | { | |
246 | long tout = 1000; /* milliseconds */ | |
247 | xfs_lsn_t last_pushed_lsn = *last_lsn; | |
82fa9012 | 248 | xfs_lsn_t target = ailp->xa_target; |
249a8c11 DC |
249 | xfs_lsn_t lsn; |
250 | xfs_log_item_t *lip; | |
249a8c11 | 251 | int flush_log, count, stuck; |
82fa9012 | 252 | xfs_mount_t *mp = ailp->xa_mount; |
27d8d5fe | 253 | struct xfs_ail_cursor *cur = &ailp->xa_cursors; |
1da177e4 | 254 | |
287f3dad | 255 | spin_lock(&mp->m_ail_lock); |
27d8d5fe | 256 | xfs_trans_ail_cursor_init(ailp, cur); |
5b00f14f | 257 | lip = xfs_trans_ail_cursor_first(ailp, cur, *last_lsn); |
249a8c11 | 258 | if (!lip || XFS_FORCED_SHUTDOWN(mp)) { |
1da177e4 | 259 | /* |
249a8c11 | 260 | * AIL is empty or our push has reached the end. |
1da177e4 | 261 | */ |
27d8d5fe | 262 | xfs_trans_ail_cursor_done(ailp, cur); |
287f3dad | 263 | spin_unlock(&mp->m_ail_lock); |
249a8c11 | 264 | last_pushed_lsn = 0; |
27d8d5fe | 265 | return tout; |
1da177e4 LT |
266 | } |
267 | ||
268 | XFS_STATS_INC(xs_push_ail); | |
269 | ||
270 | /* | |
271 | * While the item we are looking at is below the given threshold | |
249a8c11 | 272 | * try to flush it out. We'd like not to stop until we've at least |
1da177e4 | 273 | * tried to push on everything in the AIL with an LSN less than |
249a8c11 DC |
274 | * the given threshold. |
275 | * | |
276 | * However, we will stop after a certain number of pushes and wait | |
277 | * for a reduced timeout to fire before pushing further. This | |
278 | * prevents use from spinning when we can't do anything or there is | |
279 | * lots of contention on the AIL lists. | |
1da177e4 | 280 | */ |
249a8c11 DC |
281 | tout = 10; |
282 | lsn = lip->li_lsn; | |
27d8d5fe | 283 | flush_log = stuck = count = 0; |
249a8c11 DC |
284 | while ((XFS_LSN_CMP(lip->li_lsn, target) < 0)) { |
285 | int lock_result; | |
1da177e4 | 286 | /* |
249a8c11 DC |
287 | * If we can lock the item without sleeping, unlock the AIL |
288 | * lock and flush the item. Then re-grab the AIL lock so we | |
289 | * can look for the next item on the AIL. List changes are | |
290 | * handled by the AIL lookup functions internally | |
1da177e4 | 291 | * |
249a8c11 DC |
292 | * If we can't lock the item, either its holder will flush it |
293 | * or it is already being flushed or it is being relogged. In | |
294 | * any of these case it is being taken care of and we can just | |
295 | * skip to the next item in the list. | |
1da177e4 LT |
296 | */ |
297 | lock_result = IOP_TRYLOCK(lip); | |
249a8c11 | 298 | spin_unlock(&mp->m_ail_lock); |
1da177e4 | 299 | switch (lock_result) { |
249a8c11 | 300 | case XFS_ITEM_SUCCESS: |
1da177e4 LT |
301 | XFS_STATS_INC(xs_push_ail_success); |
302 | IOP_PUSH(lip); | |
249a8c11 | 303 | last_pushed_lsn = lsn; |
1da177e4 LT |
304 | break; |
305 | ||
249a8c11 | 306 | case XFS_ITEM_PUSHBUF: |
1da177e4 | 307 | XFS_STATS_INC(xs_push_ail_pushbuf); |
1da177e4 | 308 | IOP_PUSHBUF(lip); |
249a8c11 | 309 | last_pushed_lsn = lsn; |
1da177e4 LT |
310 | break; |
311 | ||
249a8c11 | 312 | case XFS_ITEM_PINNED: |
1da177e4 | 313 | XFS_STATS_INC(xs_push_ail_pinned); |
249a8c11 | 314 | stuck++; |
1da177e4 LT |
315 | flush_log = 1; |
316 | break; | |
317 | ||
249a8c11 | 318 | case XFS_ITEM_LOCKED: |
1da177e4 | 319 | XFS_STATS_INC(xs_push_ail_locked); |
249a8c11 DC |
320 | last_pushed_lsn = lsn; |
321 | stuck++; | |
1da177e4 LT |
322 | break; |
323 | ||
249a8c11 | 324 | case XFS_ITEM_FLUSHING: |
1da177e4 | 325 | XFS_STATS_INC(xs_push_ail_flushing); |
249a8c11 DC |
326 | last_pushed_lsn = lsn; |
327 | stuck++; | |
1da177e4 LT |
328 | break; |
329 | ||
249a8c11 | 330 | default: |
1da177e4 LT |
331 | ASSERT(0); |
332 | break; | |
333 | } | |
334 | ||
249a8c11 DC |
335 | spin_lock(&mp->m_ail_lock); |
336 | /* should we bother continuing? */ | |
337 | if (XFS_FORCED_SHUTDOWN(mp)) | |
1da177e4 | 338 | break; |
249a8c11 DC |
339 | ASSERT(mp->m_log); |
340 | ||
341 | count++; | |
1da177e4 | 342 | |
249a8c11 DC |
343 | /* |
344 | * Are there too many items we can't do anything with? | |
345 | * If we we are skipping too many items because we can't flush | |
346 | * them or they are already being flushed, we back off and | |
347 | * given them time to complete whatever operation is being | |
348 | * done. i.e. remove pressure from the AIL while we can't make | |
349 | * progress so traversals don't slow down further inserts and | |
350 | * removals to/from the AIL. | |
351 | * | |
352 | * The value of 100 is an arbitrary magic number based on | |
353 | * observation. | |
354 | */ | |
355 | if (stuck > 100) | |
356 | break; | |
357 | ||
27d8d5fe | 358 | lip = xfs_trans_ail_cursor_next(ailp, cur); |
249a8c11 DC |
359 | if (lip == NULL) |
360 | break; | |
249a8c11 | 361 | lsn = lip->li_lsn; |
1da177e4 | 362 | } |
27d8d5fe | 363 | xfs_trans_ail_cursor_done(ailp, cur); |
249a8c11 | 364 | spin_unlock(&mp->m_ail_lock); |
1da177e4 LT |
365 | |
366 | if (flush_log) { | |
367 | /* | |
368 | * If something we need to push out was pinned, then | |
369 | * push out the log so it will become unpinned and | |
370 | * move forward in the AIL. | |
371 | */ | |
1da177e4 LT |
372 | XFS_STATS_INC(xs_push_ail_flush); |
373 | xfs_log_force(mp, (xfs_lsn_t)0, XFS_LOG_FORCE); | |
1da177e4 LT |
374 | } |
375 | ||
92d9cd10 DC |
376 | if (!count) { |
377 | /* We're past our target or empty, so idle */ | |
378 | tout = 1000; | |
379 | } else if (XFS_LSN_CMP(lsn, target) >= 0) { | |
380 | /* | |
381 | * We reached the target so wait a bit longer for I/O to | |
382 | * complete and remove pushed items from the AIL before we | |
383 | * start the next scan from the start of the AIL. | |
384 | */ | |
249a8c11 DC |
385 | tout += 20; |
386 | last_pushed_lsn = 0; | |
27d8d5fe | 387 | } else if ((stuck * 100) / count > 90) { |
249a8c11 DC |
388 | /* |
389 | * Either there is a lot of contention on the AIL or we | |
390 | * are stuck due to operations in progress. "Stuck" in this | |
391 | * case is defined as >90% of the items we tried to push | |
392 | * were stuck. | |
393 | * | |
394 | * Backoff a bit more to allow some I/O to complete before | |
395 | * continuing from where we were. | |
396 | */ | |
397 | tout += 10; | |
1da177e4 | 398 | } |
249a8c11 DC |
399 | *last_lsn = last_pushed_lsn; |
400 | return tout; | |
401 | } /* xfsaild_push */ | |
1da177e4 LT |
402 | |
403 | ||
404 | /* | |
405 | * This is to be called when an item is unlocked that may have | |
406 | * been in the AIL. It will wake up the first member of the AIL | |
407 | * wait list if this item's unlocking might allow it to progress. | |
408 | * If the item is in the AIL, then we need to get the AIL lock | |
409 | * while doing our checking so we don't race with someone going | |
410 | * to sleep waiting for this event in xfs_trans_push_ail(). | |
411 | */ | |
412 | void | |
413 | xfs_trans_unlocked_item( | |
414 | xfs_mount_t *mp, | |
415 | xfs_log_item_t *lip) | |
416 | { | |
417 | xfs_log_item_t *min_lip; | |
418 | ||
419 | /* | |
420 | * If we're forcibly shutting down, we may have | |
421 | * unlocked log items arbitrarily. The last thing | |
422 | * we want to do is to move the tail of the log | |
423 | * over some potentially valid data. | |
424 | */ | |
425 | if (!(lip->li_flags & XFS_LI_IN_AIL) || | |
426 | XFS_FORCED_SHUTDOWN(mp)) { | |
427 | return; | |
428 | } | |
429 | ||
430 | /* | |
431 | * This is the one case where we can call into xfs_ail_min() | |
432 | * without holding the AIL lock because we only care about the | |
433 | * case where we are at the tail of the AIL. If the object isn't | |
434 | * at the tail, it doesn't matter what result we get back. This | |
435 | * is slightly racy because since we were just unlocked, we could | |
436 | * go to sleep between the call to xfs_ail_min and the call to | |
437 | * xfs_log_move_tail, have someone else lock us, commit to us disk, | |
438 | * move us out of the tail of the AIL, and then we wake up. However, | |
439 | * the call to xfs_log_move_tail() doesn't do anything if there's | |
440 | * not enough free space to wake people up so we're safe calling it. | |
441 | */ | |
82fa9012 | 442 | min_lip = xfs_ail_min(mp->m_ail); |
1da177e4 LT |
443 | |
444 | if (min_lip == lip) | |
445 | xfs_log_move_tail(mp, 1); | |
446 | } /* xfs_trans_unlocked_item */ | |
447 | ||
448 | ||
449 | /* | |
450 | * Update the position of the item in the AIL with the new | |
451 | * lsn. If it is not yet in the AIL, add it. Otherwise, move | |
452 | * it to its new position by removing it and re-adding it. | |
453 | * | |
454 | * Wakeup anyone with an lsn less than the item's lsn. If the item | |
455 | * we move in the AIL is the minimum one, update the tail lsn in the | |
456 | * log manager. | |
457 | * | |
1da177e4 | 458 | * This function must be called with the AIL lock held. The lock |
287f3dad | 459 | * is dropped before returning. |
1da177e4 LT |
460 | */ |
461 | void | |
462 | xfs_trans_update_ail( | |
463 | xfs_mount_t *mp, | |
464 | xfs_log_item_t *lip, | |
287f3dad | 465 | xfs_lsn_t lsn) __releases(mp->m_ail_lock) |
1da177e4 | 466 | { |
1da177e4 LT |
467 | xfs_log_item_t *dlip=NULL; |
468 | xfs_log_item_t *mlip; /* ptr to minimum lip */ | |
469 | ||
82fa9012 | 470 | mlip = xfs_ail_min(mp->m_ail); |
1da177e4 LT |
471 | |
472 | if (lip->li_flags & XFS_LI_IN_AIL) { | |
82fa9012 | 473 | dlip = xfs_ail_delete(mp->m_ail, lip); |
1da177e4 | 474 | ASSERT(dlip == lip); |
27d8d5fe | 475 | xfs_trans_ail_cursor_clear(mp->m_ail, dlip); |
1da177e4 LT |
476 | } else { |
477 | lip->li_flags |= XFS_LI_IN_AIL; | |
478 | } | |
479 | ||
480 | lip->li_lsn = lsn; | |
82fa9012 | 481 | xfs_ail_insert(mp->m_ail, lip); |
1da177e4 LT |
482 | |
483 | if (mlip == dlip) { | |
82fa9012 | 484 | mlip = xfs_ail_min(mp->m_ail); |
287f3dad | 485 | spin_unlock(&mp->m_ail_lock); |
1da177e4 LT |
486 | xfs_log_move_tail(mp, mlip->li_lsn); |
487 | } else { | |
287f3dad | 488 | spin_unlock(&mp->m_ail_lock); |
1da177e4 LT |
489 | } |
490 | ||
491 | ||
492 | } /* xfs_trans_update_ail */ | |
493 | ||
494 | /* | |
495 | * Delete the given item from the AIL. It must already be in | |
496 | * the AIL. | |
497 | * | |
498 | * Wakeup anyone with an lsn less than item's lsn. If the item | |
499 | * we delete in the AIL is the minimum one, update the tail lsn in the | |
500 | * log manager. | |
501 | * | |
502 | * Clear the IN_AIL flag from the item, reset its lsn to 0, and | |
503 | * bump the AIL's generation count to indicate that the tree | |
504 | * has changed. | |
505 | * | |
506 | * This function must be called with the AIL lock held. The lock | |
287f3dad | 507 | * is dropped before returning. |
1da177e4 LT |
508 | */ |
509 | void | |
510 | xfs_trans_delete_ail( | |
511 | xfs_mount_t *mp, | |
287f3dad | 512 | xfs_log_item_t *lip) __releases(mp->m_ail_lock) |
1da177e4 | 513 | { |
1da177e4 LT |
514 | xfs_log_item_t *dlip; |
515 | xfs_log_item_t *mlip; | |
516 | ||
517 | if (lip->li_flags & XFS_LI_IN_AIL) { | |
82fa9012 DC |
518 | mlip = xfs_ail_min(mp->m_ail); |
519 | dlip = xfs_ail_delete(mp->m_ail, lip); | |
1da177e4 | 520 | ASSERT(dlip == lip); |
27d8d5fe | 521 | xfs_trans_ail_cursor_clear(mp->m_ail, dlip); |
1da177e4 LT |
522 | |
523 | ||
524 | lip->li_flags &= ~XFS_LI_IN_AIL; | |
525 | lip->li_lsn = 0; | |
1da177e4 LT |
526 | |
527 | if (mlip == dlip) { | |
82fa9012 | 528 | mlip = xfs_ail_min(mp->m_ail); |
287f3dad | 529 | spin_unlock(&mp->m_ail_lock); |
1da177e4 LT |
530 | xfs_log_move_tail(mp, (mlip ? mlip->li_lsn : 0)); |
531 | } else { | |
287f3dad | 532 | spin_unlock(&mp->m_ail_lock); |
1da177e4 LT |
533 | } |
534 | } | |
535 | else { | |
536 | /* | |
537 | * If the file system is not being shutdown, we are in | |
538 | * serious trouble if we get to this stage. | |
539 | */ | |
540 | if (XFS_FORCED_SHUTDOWN(mp)) | |
287f3dad | 541 | spin_unlock(&mp->m_ail_lock); |
1da177e4 LT |
542 | else { |
543 | xfs_cmn_err(XFS_PTAG_AILDELETE, CE_ALERT, mp, | |
7d04a335 | 544 | "%s: attempting to delete a log item that is not in the AIL", |
34a622b2 | 545 | __func__); |
287f3dad | 546 | spin_unlock(&mp->m_ail_lock); |
7d04a335 | 547 | xfs_force_shutdown(mp, SHUTDOWN_CORRUPT_INCORE); |
1da177e4 LT |
548 | } |
549 | } | |
550 | } | |
551 | ||
552 | ||
553 | ||
1da177e4 LT |
554 | /* |
555 | * The active item list (AIL) is a doubly linked list of log | |
556 | * items sorted by ascending lsn. The base of the list is | |
557 | * a forw/back pointer pair embedded in the xfs mount structure. | |
558 | * The base is initialized with both pointers pointing to the | |
559 | * base. This case always needs to be distinguished, because | |
560 | * the base has no lsn to look at. We almost always insert | |
561 | * at the end of the list, so on inserts we search from the | |
562 | * end of the list to find where the new item belongs. | |
563 | */ | |
564 | ||
565 | /* | |
566 | * Initialize the doubly linked list to point only to itself. | |
567 | */ | |
249a8c11 | 568 | int |
1da177e4 LT |
569 | xfs_trans_ail_init( |
570 | xfs_mount_t *mp) | |
571 | { | |
82fa9012 | 572 | struct xfs_ail *ailp; |
27d8d5fe | 573 | int error; |
82fa9012 DC |
574 | |
575 | ailp = kmem_zalloc(sizeof(struct xfs_ail), KM_MAYFAIL); | |
576 | if (!ailp) | |
577 | return ENOMEM; | |
578 | ||
579 | ailp->xa_mount = mp; | |
580 | INIT_LIST_HEAD(&ailp->xa_ail); | |
27d8d5fe DC |
581 | error = xfsaild_start(ailp); |
582 | if (error) | |
583 | goto out_free_ailp; | |
584 | mp->m_ail = ailp; | |
585 | return 0; | |
586 | ||
587 | out_free_ailp: | |
588 | kmem_free(ailp); | |
589 | return error; | |
249a8c11 DC |
590 | } |
591 | ||
592 | void | |
593 | xfs_trans_ail_destroy( | |
594 | xfs_mount_t *mp) | |
595 | { | |
82fa9012 DC |
596 | struct xfs_ail *ailp = mp->m_ail; |
597 | ||
598 | xfsaild_stop(ailp); | |
599 | kmem_free(ailp); | |
1da177e4 LT |
600 | } |
601 | ||
602 | /* | |
603 | * Insert the given log item into the AIL. | |
604 | * We almost always insert at the end of the list, so on inserts | |
605 | * we search from the end of the list to find where the | |
606 | * new item belongs. | |
607 | */ | |
608 | STATIC void | |
609 | xfs_ail_insert( | |
82fa9012 | 610 | struct xfs_ail *ailp, |
1da177e4 LT |
611 | xfs_log_item_t *lip) |
612 | /* ARGSUSED */ | |
613 | { | |
614 | xfs_log_item_t *next_lip; | |
615 | ||
616 | /* | |
617 | * If the list is empty, just insert the item. | |
618 | */ | |
535f6b37 JJS |
619 | if (list_empty(&ailp->xa_ail)) { |
620 | list_add(&lip->li_ail, &ailp->xa_ail); | |
1da177e4 LT |
621 | return; |
622 | } | |
623 | ||
535f6b37 JJS |
624 | list_for_each_entry_reverse(next_lip, &ailp->xa_ail, li_ail) { |
625 | if (XFS_LSN_CMP(next_lip->li_lsn, lip->li_lsn) <= 0) | |
626 | break; | |
1da177e4 | 627 | } |
535f6b37 JJS |
628 | |
629 | ASSERT((&next_lip->li_ail == &ailp->xa_ail) || | |
1da177e4 | 630 | (XFS_LSN_CMP(next_lip->li_lsn, lip->li_lsn) <= 0)); |
1da177e4 | 631 | |
535f6b37 JJS |
632 | list_add(&lip->li_ail, &next_lip->li_ail); |
633 | ||
634 | xfs_ail_check(ailp, lip); | |
1da177e4 LT |
635 | return; |
636 | } | |
637 | ||
638 | /* | |
639 | * Delete the given item from the AIL. Return a pointer to the item. | |
640 | */ | |
641 | /*ARGSUSED*/ | |
642 | STATIC xfs_log_item_t * | |
643 | xfs_ail_delete( | |
82fa9012 | 644 | struct xfs_ail *ailp, |
1da177e4 LT |
645 | xfs_log_item_t *lip) |
646 | /* ARGSUSED */ | |
647 | { | |
535f6b37 JJS |
648 | xfs_ail_check(ailp, lip); |
649 | ||
650 | list_del(&lip->li_ail); | |
1da177e4 | 651 | |
1da177e4 LT |
652 | return lip; |
653 | } | |
654 | ||
655 | /* | |
656 | * Return a pointer to the first item in the AIL. | |
657 | * If the AIL is empty, then return NULL. | |
658 | */ | |
659 | STATIC xfs_log_item_t * | |
660 | xfs_ail_min( | |
82fa9012 | 661 | struct xfs_ail *ailp) |
1da177e4 LT |
662 | /* ARGSUSED */ |
663 | { | |
535f6b37 | 664 | if (list_empty(&ailp->xa_ail)) |
1da177e4 | 665 | return NULL; |
535f6b37 JJS |
666 | |
667 | return list_first_entry(&ailp->xa_ail, xfs_log_item_t, li_ail); | |
1da177e4 LT |
668 | } |
669 | ||
670 | /* | |
671 | * Return a pointer to the item which follows | |
672 | * the given item in the AIL. If the given item | |
673 | * is the last item in the list, then return NULL. | |
674 | */ | |
675 | STATIC xfs_log_item_t * | |
676 | xfs_ail_next( | |
82fa9012 | 677 | struct xfs_ail *ailp, |
1da177e4 LT |
678 | xfs_log_item_t *lip) |
679 | /* ARGSUSED */ | |
680 | { | |
535f6b37 | 681 | if (lip->li_ail.next == &ailp->xa_ail) |
1da177e4 | 682 | return NULL; |
1da177e4 | 683 | |
535f6b37 | 684 | return list_first_entry(&lip->li_ail, xfs_log_item_t, li_ail); |
1da177e4 LT |
685 | } |
686 | ||
687 | #ifdef DEBUG | |
688 | /* | |
689 | * Check that the list is sorted as it should be. | |
690 | */ | |
691 | STATIC void | |
692 | xfs_ail_check( | |
82fa9012 | 693 | struct xfs_ail *ailp, |
de08dbc1 | 694 | xfs_log_item_t *lip) |
1da177e4 | 695 | { |
1da177e4 LT |
696 | xfs_log_item_t *prev_lip; |
697 | ||
535f6b37 | 698 | if (list_empty(&ailp->xa_ail)) |
1da177e4 | 699 | return; |
1da177e4 | 700 | |
de08dbc1 DC |
701 | /* |
702 | * Check the next and previous entries are valid. | |
703 | */ | |
704 | ASSERT((lip->li_flags & XFS_LI_IN_AIL) != 0); | |
535f6b37 JJS |
705 | prev_lip = list_entry(lip->li_ail.prev, xfs_log_item_t, li_ail); |
706 | if (&prev_lip->li_ail != &ailp->xa_ail) | |
de08dbc1 | 707 | ASSERT(XFS_LSN_CMP(prev_lip->li_lsn, lip->li_lsn) <= 0); |
535f6b37 JJS |
708 | |
709 | prev_lip = list_entry(lip->li_ail.next, xfs_log_item_t, li_ail); | |
710 | if (&prev_lip->li_ail != &ailp->xa_ail) | |
de08dbc1 | 711 | ASSERT(XFS_LSN_CMP(prev_lip->li_lsn, lip->li_lsn) >= 0); |
de08dbc1 DC |
712 | |
713 | ||
714 | #ifdef XFS_TRANS_DEBUG | |
1da177e4 | 715 | /* |
535f6b37 JJS |
716 | * Walk the list checking lsn ordering, and that every entry has the |
717 | * XFS_LI_IN_AIL flag set. This is really expensive, so only do it | |
718 | * when specifically debugging the transaction subsystem. | |
1da177e4 | 719 | */ |
535f6b37 JJS |
720 | prev_lip = list_entry(&ailp->xa_ail, xfs_log_item_t, li_ail); |
721 | list_for_each_entry(lip, &ailp->xa_ail, li_ail) { | |
722 | if (&prev_lip->li_ail != &ailp->xa_ail) | |
1da177e4 | 723 | ASSERT(XFS_LSN_CMP(prev_lip->li_lsn, lip->li_lsn) <= 0); |
1da177e4 LT |
724 | ASSERT((lip->li_flags & XFS_LI_IN_AIL) != 0); |
725 | prev_lip = lip; | |
1da177e4 | 726 | } |
de08dbc1 | 727 | #endif /* XFS_TRANS_DEBUG */ |
1da177e4 LT |
728 | } |
729 | #endif /* DEBUG */ |