11da177e4SLinus Torvalds /* 27b718769SNathan Scott * Copyright (c) 2000-2002,2005 Silicon Graphics, Inc. 3c7e8f268SDavid Chinner * Copyright (c) 2008 Dave Chinner 47b718769SNathan Scott * All Rights Reserved. 51da177e4SLinus Torvalds * 67b718769SNathan Scott * This program is free software; you can redistribute it and/or 77b718769SNathan Scott * modify it under the terms of the GNU General Public License as 81da177e4SLinus Torvalds * published by the Free Software Foundation. 91da177e4SLinus Torvalds * 107b718769SNathan Scott * This program is distributed in the hope that it would be useful, 117b718769SNathan Scott * but WITHOUT ANY WARRANTY; without even the implied warranty of 127b718769SNathan Scott * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 137b718769SNathan Scott * GNU General Public License for more details. 141da177e4SLinus Torvalds * 157b718769SNathan Scott * You should have received a copy of the GNU General Public License 167b718769SNathan Scott * along with this program; if not, write the Free Software Foundation, 177b718769SNathan Scott * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA 181da177e4SLinus Torvalds */ 191da177e4SLinus Torvalds #include "xfs.h" 20a844f451SNathan Scott #include "xfs_fs.h" 21239880efSDave Chinner #include "xfs_log_format.h" 22239880efSDave Chinner #include "xfs_trans_resv.h" 231da177e4SLinus Torvalds #include "xfs_sb.h" 24da353b0dSDavid Chinner #include "xfs_ag.h" 251da177e4SLinus Torvalds #include "xfs_mount.h" 26239880efSDave Chinner #include "xfs_trans.h" 271da177e4SLinus Torvalds #include "xfs_trans_priv.h" 289e4c109aSChristoph Hellwig #include "xfs_trace.h" 291da177e4SLinus Torvalds #include "xfs_error.h" 30239880efSDave Chinner #include "xfs_log.h" 311da177e4SLinus Torvalds 321da177e4SLinus Torvalds #ifdef DEBUG 33cd4a3c50SDave Chinner /* 34cd4a3c50SDave Chinner * Check that the list is sorted as it should be. 35cd4a3c50SDave Chinner */ 36cd4a3c50SDave Chinner STATIC void 37cd4a3c50SDave Chinner xfs_ail_check( 38cd4a3c50SDave Chinner struct xfs_ail *ailp, 39cd4a3c50SDave Chinner xfs_log_item_t *lip) 40cd4a3c50SDave Chinner { 41cd4a3c50SDave Chinner xfs_log_item_t *prev_lip; 42cd4a3c50SDave Chinner 43cd4a3c50SDave Chinner if (list_empty(&ailp->xa_ail)) 44cd4a3c50SDave Chinner return; 45cd4a3c50SDave Chinner 46cd4a3c50SDave Chinner /* 47cd4a3c50SDave Chinner * Check the next and previous entries are valid. 48cd4a3c50SDave Chinner */ 49cd4a3c50SDave Chinner ASSERT((lip->li_flags & XFS_LI_IN_AIL) != 0); 50cd4a3c50SDave Chinner prev_lip = list_entry(lip->li_ail.prev, xfs_log_item_t, li_ail); 51cd4a3c50SDave Chinner if (&prev_lip->li_ail != &ailp->xa_ail) 52cd4a3c50SDave Chinner ASSERT(XFS_LSN_CMP(prev_lip->li_lsn, lip->li_lsn) <= 0); 53cd4a3c50SDave Chinner 54cd4a3c50SDave Chinner prev_lip = list_entry(lip->li_ail.next, xfs_log_item_t, li_ail); 55cd4a3c50SDave Chinner if (&prev_lip->li_ail != &ailp->xa_ail) 56cd4a3c50SDave Chinner ASSERT(XFS_LSN_CMP(prev_lip->li_lsn, lip->li_lsn) >= 0); 57cd4a3c50SDave Chinner 58cd4a3c50SDave Chinner 59cd4a3c50SDave Chinner } 60cd4a3c50SDave Chinner #else /* !DEBUG */ 61de08dbc1SDavid Chinner #define xfs_ail_check(a,l) 621da177e4SLinus Torvalds #endif /* DEBUG */ 631da177e4SLinus Torvalds 64cd4a3c50SDave Chinner /* 65fd074841SDave Chinner * Return a pointer to the last item in the AIL. If the AIL is empty, then 66fd074841SDave Chinner * return NULL. 67fd074841SDave Chinner */ 68fd074841SDave Chinner static xfs_log_item_t * 69fd074841SDave Chinner xfs_ail_max( 70fd074841SDave Chinner struct xfs_ail *ailp) 71fd074841SDave Chinner { 72fd074841SDave Chinner if (list_empty(&ailp->xa_ail)) 73fd074841SDave Chinner return NULL; 74fd074841SDave Chinner 75fd074841SDave Chinner return list_entry(ailp->xa_ail.prev, xfs_log_item_t, li_ail); 76fd074841SDave Chinner } 77fd074841SDave Chinner 78fd074841SDave Chinner /* 79cd4a3c50SDave Chinner * Return a pointer to the item which follows the given item in the AIL. If 80cd4a3c50SDave Chinner * the given item is the last item in the list, then return NULL. 81cd4a3c50SDave Chinner */ 82cd4a3c50SDave Chinner static xfs_log_item_t * 83cd4a3c50SDave Chinner xfs_ail_next( 84cd4a3c50SDave Chinner struct xfs_ail *ailp, 85cd4a3c50SDave Chinner xfs_log_item_t *lip) 86cd4a3c50SDave Chinner { 87cd4a3c50SDave Chinner if (lip->li_ail.next == &ailp->xa_ail) 88cd4a3c50SDave Chinner return NULL; 89cd4a3c50SDave Chinner 90cd4a3c50SDave Chinner return list_first_entry(&lip->li_ail, xfs_log_item_t, li_ail); 91cd4a3c50SDave Chinner } 92cd4a3c50SDave Chinner 93cd4a3c50SDave Chinner /* 94cd4a3c50SDave Chinner * This is called by the log manager code to determine the LSN of the tail of 95cd4a3c50SDave Chinner * the log. This is exactly the LSN of the first item in the AIL. If the AIL 96cd4a3c50SDave Chinner * is empty, then this function returns 0. 971da177e4SLinus Torvalds * 98cd4a3c50SDave Chinner * We need the AIL lock in order to get a coherent read of the lsn of the last 99cd4a3c50SDave Chinner * item in the AIL. 1001da177e4SLinus Torvalds */ 1011da177e4SLinus Torvalds xfs_lsn_t 102fd074841SDave Chinner xfs_ail_min_lsn( 1035b00f14fSDavid Chinner struct xfs_ail *ailp) 1041da177e4SLinus Torvalds { 105cd4a3c50SDave Chinner xfs_lsn_t lsn = 0; 1061da177e4SLinus Torvalds xfs_log_item_t *lip; 1071da177e4SLinus Torvalds 108c7e8f268SDavid Chinner spin_lock(&ailp->xa_lock); 1095b00f14fSDavid Chinner lip = xfs_ail_min(ailp); 110cd4a3c50SDave Chinner if (lip) 1111da177e4SLinus Torvalds lsn = lip->li_lsn; 112c7e8f268SDavid Chinner spin_unlock(&ailp->xa_lock); 1131da177e4SLinus Torvalds 1141da177e4SLinus Torvalds return lsn; 1151da177e4SLinus Torvalds } 1161da177e4SLinus Torvalds 1171da177e4SLinus Torvalds /* 118fd074841SDave Chinner * Return the maximum lsn held in the AIL, or zero if the AIL is empty. 119fd074841SDave Chinner */ 120fd074841SDave Chinner static xfs_lsn_t 121fd074841SDave Chinner xfs_ail_max_lsn( 122fd074841SDave Chinner struct xfs_ail *ailp) 123fd074841SDave Chinner { 124fd074841SDave Chinner xfs_lsn_t lsn = 0; 125fd074841SDave Chinner xfs_log_item_t *lip; 126fd074841SDave Chinner 127fd074841SDave Chinner spin_lock(&ailp->xa_lock); 128fd074841SDave Chinner lip = xfs_ail_max(ailp); 129fd074841SDave Chinner if (lip) 130fd074841SDave Chinner lsn = lip->li_lsn; 131fd074841SDave Chinner spin_unlock(&ailp->xa_lock); 132fd074841SDave Chinner 133fd074841SDave Chinner return lsn; 134fd074841SDave Chinner } 135fd074841SDave Chinner 136fd074841SDave Chinner /* 137af3e4022SDave Chinner * The cursor keeps track of where our current traversal is up to by tracking 138af3e4022SDave Chinner * the next item in the list for us. However, for this to be safe, removing an 139af3e4022SDave Chinner * object from the AIL needs to invalidate any cursor that points to it. hence 140af3e4022SDave Chinner * the traversal cursor needs to be linked to the struct xfs_ail so that 141af3e4022SDave Chinner * deletion can search all the active cursors for invalidation. 14227d8d5feSDavid Chinner */ 1435b00f14fSDavid Chinner STATIC void 14427d8d5feSDavid Chinner xfs_trans_ail_cursor_init( 14527d8d5feSDavid Chinner struct xfs_ail *ailp, 14627d8d5feSDavid Chinner struct xfs_ail_cursor *cur) 14727d8d5feSDavid Chinner { 14827d8d5feSDavid Chinner cur->item = NULL; 149af3e4022SDave Chinner list_add_tail(&cur->list, &ailp->xa_cursors); 15027d8d5feSDavid Chinner } 15127d8d5feSDavid Chinner 15227d8d5feSDavid Chinner /* 153af3e4022SDave Chinner * Get the next item in the traversal and advance the cursor. If the cursor 154af3e4022SDave Chinner * was invalidated (indicated by a lip of 1), restart the traversal. 15527d8d5feSDavid Chinner */ 1565b00f14fSDavid Chinner struct xfs_log_item * 15727d8d5feSDavid Chinner xfs_trans_ail_cursor_next( 15827d8d5feSDavid Chinner struct xfs_ail *ailp, 15927d8d5feSDavid Chinner struct xfs_ail_cursor *cur) 16027d8d5feSDavid Chinner { 16127d8d5feSDavid Chinner struct xfs_log_item *lip = cur->item; 16227d8d5feSDavid Chinner 16327d8d5feSDavid Chinner if ((__psint_t)lip & 1) 16427d8d5feSDavid Chinner lip = xfs_ail_min(ailp); 16516b59029SDave Chinner if (lip) 16616b59029SDave Chinner cur->item = xfs_ail_next(ailp, lip); 16727d8d5feSDavid Chinner return lip; 16827d8d5feSDavid Chinner } 16927d8d5feSDavid Chinner 17027d8d5feSDavid Chinner /* 171af3e4022SDave Chinner * When the traversal is complete, we need to remove the cursor from the list 172af3e4022SDave Chinner * of traversing cursors. 17327d8d5feSDavid Chinner */ 17427d8d5feSDavid Chinner void 17527d8d5feSDavid Chinner xfs_trans_ail_cursor_done( 17627d8d5feSDavid Chinner struct xfs_ail *ailp, 177af3e4022SDave Chinner struct xfs_ail_cursor *cur) 17827d8d5feSDavid Chinner { 179af3e4022SDave Chinner cur->item = NULL; 180af3e4022SDave Chinner list_del_init(&cur->list); 18127d8d5feSDavid Chinner } 18227d8d5feSDavid Chinner 18327d8d5feSDavid Chinner /* 184af3e4022SDave Chinner * Invalidate any cursor that is pointing to this item. This is called when an 185af3e4022SDave Chinner * item is removed from the AIL. Any cursor pointing to this object is now 186af3e4022SDave Chinner * invalid and the traversal needs to be terminated so it doesn't reference a 187af3e4022SDave Chinner * freed object. We set the low bit of the cursor item pointer so we can 188af3e4022SDave Chinner * distinguish between an invalidation and the end of the list when getting the 189af3e4022SDave Chinner * next item from the cursor. 1905b00f14fSDavid Chinner */ 1915b00f14fSDavid Chinner STATIC void 1925b00f14fSDavid Chinner xfs_trans_ail_cursor_clear( 1935b00f14fSDavid Chinner struct xfs_ail *ailp, 1945b00f14fSDavid Chinner struct xfs_log_item *lip) 1955b00f14fSDavid Chinner { 1965b00f14fSDavid Chinner struct xfs_ail_cursor *cur; 1975b00f14fSDavid Chinner 198af3e4022SDave Chinner list_for_each_entry(cur, &ailp->xa_cursors, list) { 1995b00f14fSDavid Chinner if (cur->item == lip) 2005b00f14fSDavid Chinner cur->item = (struct xfs_log_item *) 2015b00f14fSDavid Chinner ((__psint_t)cur->item | 1); 2025b00f14fSDavid Chinner } 2035b00f14fSDavid Chinner } 2045b00f14fSDavid Chinner 2055b00f14fSDavid Chinner /* 20616b59029SDave Chinner * Find the first item in the AIL with the given @lsn by searching in ascending 20716b59029SDave Chinner * LSN order and initialise the cursor to point to the next item for a 20816b59029SDave Chinner * ascending traversal. Pass a @lsn of zero to initialise the cursor to the 20916b59029SDave Chinner * first item in the AIL. Returns NULL if the list is empty. 210249a8c11SDavid Chinner */ 2115b00f14fSDavid Chinner xfs_log_item_t * 2125b00f14fSDavid Chinner xfs_trans_ail_cursor_first( 21327d8d5feSDavid Chinner struct xfs_ail *ailp, 21427d8d5feSDavid Chinner struct xfs_ail_cursor *cur, 215249a8c11SDavid Chinner xfs_lsn_t lsn) 216249a8c11SDavid Chinner { 217249a8c11SDavid Chinner xfs_log_item_t *lip; 218249a8c11SDavid Chinner 2195b00f14fSDavid Chinner xfs_trans_ail_cursor_init(ailp, cur); 22016b59029SDave Chinner 22116b59029SDave Chinner if (lsn == 0) { 22227d8d5feSDavid Chinner lip = xfs_ail_min(ailp); 2235b00f14fSDavid Chinner goto out; 22416b59029SDave Chinner } 225249a8c11SDavid Chinner 22627d8d5feSDavid Chinner list_for_each_entry(lip, &ailp->xa_ail, li_ail) { 2275b00f14fSDavid Chinner if (XFS_LSN_CMP(lip->li_lsn, lsn) >= 0) 2287ee49acfSDavid Chinner goto out; 2295b00f14fSDavid Chinner } 23016b59029SDave Chinner return NULL; 23116b59029SDave Chinner 2325b00f14fSDavid Chinner out: 23316b59029SDave Chinner if (lip) 23416b59029SDave Chinner cur->item = xfs_ail_next(ailp, lip); 235249a8c11SDavid Chinner return lip; 236249a8c11SDavid Chinner } 237535f6b37SJosef 'Jeff' Sipek 2381d8c95a3SDave Chinner static struct xfs_log_item * 2391d8c95a3SDave Chinner __xfs_trans_ail_cursor_last( 2401d8c95a3SDave Chinner struct xfs_ail *ailp, 2411d8c95a3SDave Chinner xfs_lsn_t lsn) 2421d8c95a3SDave Chinner { 2431d8c95a3SDave Chinner xfs_log_item_t *lip; 2441d8c95a3SDave Chinner 2451d8c95a3SDave Chinner list_for_each_entry_reverse(lip, &ailp->xa_ail, li_ail) { 2461d8c95a3SDave Chinner if (XFS_LSN_CMP(lip->li_lsn, lsn) <= 0) 2471d8c95a3SDave Chinner return lip; 2481d8c95a3SDave Chinner } 2491d8c95a3SDave Chinner return NULL; 2501d8c95a3SDave Chinner } 2511d8c95a3SDave Chinner 2521d8c95a3SDave Chinner /* 25316b59029SDave Chinner * Find the last item in the AIL with the given @lsn by searching in descending 25416b59029SDave Chinner * LSN order and initialise the cursor to point to that item. If there is no 25516b59029SDave Chinner * item with the value of @lsn, then it sets the cursor to the last item with an 25616b59029SDave Chinner * LSN lower than @lsn. Returns NULL if the list is empty. 2571d8c95a3SDave Chinner */ 2581d8c95a3SDave Chinner struct xfs_log_item * 2591d8c95a3SDave Chinner xfs_trans_ail_cursor_last( 2601d8c95a3SDave Chinner struct xfs_ail *ailp, 2611d8c95a3SDave Chinner struct xfs_ail_cursor *cur, 2621d8c95a3SDave Chinner xfs_lsn_t lsn) 2631d8c95a3SDave Chinner { 2641d8c95a3SDave Chinner xfs_trans_ail_cursor_init(ailp, cur); 2651d8c95a3SDave Chinner cur->item = __xfs_trans_ail_cursor_last(ailp, lsn); 2661d8c95a3SDave Chinner return cur->item; 2671d8c95a3SDave Chinner } 2681d8c95a3SDave Chinner 2691d8c95a3SDave Chinner /* 27016b59029SDave Chinner * Splice the log item list into the AIL at the given LSN. We splice to the 2711d8c95a3SDave Chinner * tail of the given LSN to maintain insert order for push traversals. The 2721d8c95a3SDave Chinner * cursor is optional, allowing repeated updates to the same LSN to avoid 273e44f4112SAlex Elder * repeated traversals. This should not be called with an empty list. 274cd4a3c50SDave Chinner */ 275cd4a3c50SDave Chinner static void 276cd4a3c50SDave Chinner xfs_ail_splice( 277cd4a3c50SDave Chinner struct xfs_ail *ailp, 2781d8c95a3SDave Chinner struct xfs_ail_cursor *cur, 279cd4a3c50SDave Chinner struct list_head *list, 280cd4a3c50SDave Chinner xfs_lsn_t lsn) 281cd4a3c50SDave Chinner { 282e44f4112SAlex Elder struct xfs_log_item *lip; 283e44f4112SAlex Elder 284e44f4112SAlex Elder ASSERT(!list_empty(list)); 285cd4a3c50SDave Chinner 2861d8c95a3SDave Chinner /* 287e44f4112SAlex Elder * Use the cursor to determine the insertion point if one is 288e44f4112SAlex Elder * provided. If not, or if the one we got is not valid, 289e44f4112SAlex Elder * find the place in the AIL where the items belong. 2901d8c95a3SDave Chinner */ 291e44f4112SAlex Elder lip = cur ? cur->item : NULL; 292e44f4112SAlex Elder if (!lip || (__psint_t) lip & 1) 2931d8c95a3SDave Chinner lip = __xfs_trans_ail_cursor_last(ailp, lsn); 2941d8c95a3SDave Chinner 295e44f4112SAlex Elder /* 296e44f4112SAlex Elder * If a cursor is provided, we know we're processing the AIL 297e44f4112SAlex Elder * in lsn order, and future items to be spliced in will 298e44f4112SAlex Elder * follow the last one being inserted now. Update the 299e44f4112SAlex Elder * cursor to point to that last item, now while we have a 300e44f4112SAlex Elder * reliable pointer to it. 301e44f4112SAlex Elder */ 3021d8c95a3SDave Chinner if (cur) 303e44f4112SAlex Elder cur->item = list_entry(list->prev, struct xfs_log_item, li_ail); 304cd4a3c50SDave Chinner 3051d8c95a3SDave Chinner /* 306e44f4112SAlex Elder * Finally perform the splice. Unless the AIL was empty, 307e44f4112SAlex Elder * lip points to the item in the AIL _after_ which the new 308e44f4112SAlex Elder * items should go. If lip is null the AIL was empty, so 309e44f4112SAlex Elder * the new items go at the head of the AIL. 3101d8c95a3SDave Chinner */ 311e44f4112SAlex Elder if (lip) 3121d8c95a3SDave Chinner list_splice(list, &lip->li_ail); 313e44f4112SAlex Elder else 314e44f4112SAlex Elder list_splice(list, &ailp->xa_ail); 315cd4a3c50SDave Chinner } 316cd4a3c50SDave Chinner 317cd4a3c50SDave Chinner /* 318cd4a3c50SDave Chinner * Delete the given item from the AIL. Return a pointer to the item. 319cd4a3c50SDave Chinner */ 320cd4a3c50SDave Chinner static void 321cd4a3c50SDave Chinner xfs_ail_delete( 322cd4a3c50SDave Chinner struct xfs_ail *ailp, 323cd4a3c50SDave Chinner xfs_log_item_t *lip) 324cd4a3c50SDave Chinner { 325cd4a3c50SDave Chinner xfs_ail_check(ailp, lip); 326cd4a3c50SDave Chinner list_del(&lip->li_ail); 327cd4a3c50SDave Chinner xfs_trans_ail_cursor_clear(ailp, lip); 328cd4a3c50SDave Chinner } 329cd4a3c50SDave Chinner 3300030807cSChristoph Hellwig static long 3310030807cSChristoph Hellwig xfsaild_push( 3320030807cSChristoph Hellwig struct xfs_ail *ailp) 333249a8c11SDavid Chinner { 33482fa9012SDavid Chinner xfs_mount_t *mp = ailp->xa_mount; 335af3e4022SDave Chinner struct xfs_ail_cursor cur; 3369e7004e7SDave Chinner xfs_log_item_t *lip; 3379e7004e7SDave Chinner xfs_lsn_t lsn; 338fe0da767SDave Chinner xfs_lsn_t target; 33943ff2122SChristoph Hellwig long tout; 3409e7004e7SDave Chinner int stuck = 0; 34143ff2122SChristoph Hellwig int flushing = 0; 3429e7004e7SDave Chinner int count = 0; 3431da177e4SLinus Torvalds 344670ce93fSDave Chinner /* 34543ff2122SChristoph Hellwig * If we encountered pinned items or did not finish writing out all 34643ff2122SChristoph Hellwig * buffers the last time we ran, force the log first and wait for it 34743ff2122SChristoph Hellwig * before pushing again. 348670ce93fSDave Chinner */ 34943ff2122SChristoph Hellwig if (ailp->xa_log_flush && ailp->xa_last_pushed_lsn == 0 && 35043ff2122SChristoph Hellwig (!list_empty_careful(&ailp->xa_buf_list) || 35143ff2122SChristoph Hellwig xfs_ail_min_lsn(ailp))) { 352670ce93fSDave Chinner ailp->xa_log_flush = 0; 35343ff2122SChristoph Hellwig 354670ce93fSDave Chinner XFS_STATS_INC(xs_push_ail_flush); 355670ce93fSDave Chinner xfs_log_force(mp, XFS_LOG_SYNC); 356670ce93fSDave Chinner } 357670ce93fSDave Chinner 35843ff2122SChristoph Hellwig spin_lock(&ailp->xa_lock); 3598375f922SBrian Foster 3608375f922SBrian Foster /* barrier matches the xa_target update in xfs_ail_push() */ 3618375f922SBrian Foster smp_rmb(); 3628375f922SBrian Foster target = ailp->xa_target; 3638375f922SBrian Foster ailp->xa_target_prev = target; 3648375f922SBrian Foster 365af3e4022SDave Chinner lip = xfs_trans_ail_cursor_first(ailp, &cur, ailp->xa_last_pushed_lsn); 366211e4d43SChristoph Hellwig if (!lip) { 3671da177e4SLinus Torvalds /* 36843ff2122SChristoph Hellwig * If the AIL is empty or our push has reached the end we are 36943ff2122SChristoph Hellwig * done now. 3701da177e4SLinus Torvalds */ 371af3e4022SDave Chinner xfs_trans_ail_cursor_done(ailp, &cur); 372c7e8f268SDavid Chinner spin_unlock(&ailp->xa_lock); 3739e7004e7SDave Chinner goto out_done; 3741da177e4SLinus Torvalds } 3751da177e4SLinus Torvalds 3761da177e4SLinus Torvalds XFS_STATS_INC(xs_push_ail); 3771da177e4SLinus Torvalds 378249a8c11SDavid Chinner lsn = lip->li_lsn; 37950e86686SDave Chinner while ((XFS_LSN_CMP(lip->li_lsn, target) <= 0)) { 380249a8c11SDavid Chinner int lock_result; 38143ff2122SChristoph Hellwig 382249a8c11SDavid Chinner /* 383904c17e6SDave Chinner * Note that iop_push may unlock and reacquire the AIL lock. We 38443ff2122SChristoph Hellwig * rely on the AIL cursor implementation to be able to deal with 38543ff2122SChristoph Hellwig * the dropped lock. 3861da177e4SLinus Torvalds */ 387904c17e6SDave Chinner lock_result = lip->li_ops->iop_push(lip, &ailp->xa_buf_list); 3881da177e4SLinus Torvalds switch (lock_result) { 3891da177e4SLinus Torvalds case XFS_ITEM_SUCCESS: 3901da177e4SLinus Torvalds XFS_STATS_INC(xs_push_ail_success); 3919e4c109aSChristoph Hellwig trace_xfs_ail_push(lip); 3929e4c109aSChristoph Hellwig 3930bf6a5bdSDave Chinner ailp->xa_last_pushed_lsn = lsn; 3941da177e4SLinus Torvalds break; 3951da177e4SLinus Torvalds 39643ff2122SChristoph Hellwig case XFS_ITEM_FLUSHING: 39743ff2122SChristoph Hellwig /* 39843ff2122SChristoph Hellwig * The item or its backing buffer is already beeing 39943ff2122SChristoph Hellwig * flushed. The typical reason for that is that an 40043ff2122SChristoph Hellwig * inode buffer is locked because we already pushed the 40143ff2122SChristoph Hellwig * updates to it as part of inode clustering. 40243ff2122SChristoph Hellwig * 40343ff2122SChristoph Hellwig * We do not want to to stop flushing just because lots 40443ff2122SChristoph Hellwig * of items are already beeing flushed, but we need to 40543ff2122SChristoph Hellwig * re-try the flushing relatively soon if most of the 40643ff2122SChristoph Hellwig * AIL is beeing flushed. 40743ff2122SChristoph Hellwig */ 40843ff2122SChristoph Hellwig XFS_STATS_INC(xs_push_ail_flushing); 40943ff2122SChristoph Hellwig trace_xfs_ail_flushing(lip); 41017b38471SChristoph Hellwig 41143ff2122SChristoph Hellwig flushing++; 4120bf6a5bdSDave Chinner ailp->xa_last_pushed_lsn = lsn; 4131da177e4SLinus Torvalds break; 4141da177e4SLinus Torvalds 4151da177e4SLinus Torvalds case XFS_ITEM_PINNED: 4161da177e4SLinus Torvalds XFS_STATS_INC(xs_push_ail_pinned); 4179e4c109aSChristoph Hellwig trace_xfs_ail_pinned(lip); 4189e4c109aSChristoph Hellwig 419249a8c11SDavid Chinner stuck++; 420670ce93fSDave Chinner ailp->xa_log_flush++; 4211da177e4SLinus Torvalds break; 4221da177e4SLinus Torvalds case XFS_ITEM_LOCKED: 4231da177e4SLinus Torvalds XFS_STATS_INC(xs_push_ail_locked); 4249e4c109aSChristoph Hellwig trace_xfs_ail_locked(lip); 42543ff2122SChristoph Hellwig 426249a8c11SDavid Chinner stuck++; 4271da177e4SLinus Torvalds break; 4281da177e4SLinus Torvalds default: 4291da177e4SLinus Torvalds ASSERT(0); 4301da177e4SLinus Torvalds break; 4311da177e4SLinus Torvalds } 4321da177e4SLinus Torvalds 433249a8c11SDavid Chinner count++; 434249a8c11SDavid Chinner 435249a8c11SDavid Chinner /* 436249a8c11SDavid Chinner * Are there too many items we can't do anything with? 43743ff2122SChristoph Hellwig * 438249a8c11SDavid Chinner * If we we are skipping too many items because we can't flush 439249a8c11SDavid Chinner * them or they are already being flushed, we back off and 440249a8c11SDavid Chinner * given them time to complete whatever operation is being 441249a8c11SDavid Chinner * done. i.e. remove pressure from the AIL while we can't make 442249a8c11SDavid Chinner * progress so traversals don't slow down further inserts and 443249a8c11SDavid Chinner * removals to/from the AIL. 444249a8c11SDavid Chinner * 445249a8c11SDavid Chinner * The value of 100 is an arbitrary magic number based on 446249a8c11SDavid Chinner * observation. 447249a8c11SDavid Chinner */ 448249a8c11SDavid Chinner if (stuck > 100) 449249a8c11SDavid Chinner break; 450249a8c11SDavid Chinner 451af3e4022SDave Chinner lip = xfs_trans_ail_cursor_next(ailp, &cur); 452249a8c11SDavid Chinner if (lip == NULL) 453249a8c11SDavid Chinner break; 454249a8c11SDavid Chinner lsn = lip->li_lsn; 4551da177e4SLinus Torvalds } 456af3e4022SDave Chinner xfs_trans_ail_cursor_done(ailp, &cur); 457c7e8f268SDavid Chinner spin_unlock(&ailp->xa_lock); 4581da177e4SLinus Torvalds 45943ff2122SChristoph Hellwig if (xfs_buf_delwri_submit_nowait(&ailp->xa_buf_list)) 46043ff2122SChristoph Hellwig ailp->xa_log_flush++; 461d808f617SDave Chinner 46243ff2122SChristoph Hellwig if (!count || XFS_LSN_CMP(lsn, target) >= 0) { 4639e7004e7SDave Chinner out_done: 464249a8c11SDavid Chinner /* 46543ff2122SChristoph Hellwig * We reached the target or the AIL is empty, so wait a bit 46643ff2122SChristoph Hellwig * longer for I/O to complete and remove pushed items from the 46743ff2122SChristoph Hellwig * AIL before we start the next scan from the start of the AIL. 468249a8c11SDavid Chinner */ 469453eac8aSDave Chinner tout = 50; 4700bf6a5bdSDave Chinner ailp->xa_last_pushed_lsn = 0; 47143ff2122SChristoph Hellwig } else if (((stuck + flushing) * 100) / count > 90) { 472249a8c11SDavid Chinner /* 47343ff2122SChristoph Hellwig * Either there is a lot of contention on the AIL or we are 47443ff2122SChristoph Hellwig * stuck due to operations in progress. "Stuck" in this case 47543ff2122SChristoph Hellwig * is defined as >90% of the items we tried to push were stuck. 476249a8c11SDavid Chinner * 477249a8c11SDavid Chinner * Backoff a bit more to allow some I/O to complete before 47843ff2122SChristoph Hellwig * restarting from the start of the AIL. This prevents us from 47943ff2122SChristoph Hellwig * spinning on the same items, and if they are pinned will all 48043ff2122SChristoph Hellwig * the restart to issue a log force to unpin the stuck items. 481249a8c11SDavid Chinner */ 482453eac8aSDave Chinner tout = 20; 483670ce93fSDave Chinner ailp->xa_last_pushed_lsn = 0; 48443ff2122SChristoph Hellwig } else { 48543ff2122SChristoph Hellwig /* 48643ff2122SChristoph Hellwig * Assume we have more work to do in a short while. 48743ff2122SChristoph Hellwig */ 48843ff2122SChristoph Hellwig tout = 10; 489453eac8aSDave Chinner } 4901da177e4SLinus Torvalds 4910030807cSChristoph Hellwig return tout; 4920030807cSChristoph Hellwig } 4930030807cSChristoph Hellwig 4940030807cSChristoph Hellwig static int 4950030807cSChristoph Hellwig xfsaild( 4960030807cSChristoph Hellwig void *data) 4970030807cSChristoph Hellwig { 4980030807cSChristoph Hellwig struct xfs_ail *ailp = data; 4990030807cSChristoph Hellwig long tout = 0; /* milliseconds */ 5000030807cSChristoph Hellwig 50143ff2122SChristoph Hellwig current->flags |= PF_MEMALLOC; 50243ff2122SChristoph Hellwig 5030030807cSChristoph Hellwig while (!kthread_should_stop()) { 5040030807cSChristoph Hellwig if (tout && tout <= 20) 5050030807cSChristoph Hellwig __set_current_state(TASK_KILLABLE); 5060030807cSChristoph Hellwig else 5070030807cSChristoph Hellwig __set_current_state(TASK_INTERRUPTIBLE); 5088375f922SBrian Foster 5098375f922SBrian Foster spin_lock(&ailp->xa_lock); 5108375f922SBrian Foster 5118375f922SBrian Foster /* 5128375f922SBrian Foster * Idle if the AIL is empty and we are not racing with a target 5138375f922SBrian Foster * update. We check the AIL after we set the task to a sleep 5148375f922SBrian Foster * state to guarantee that we either catch an xa_target update 5158375f922SBrian Foster * or that a wake_up resets the state to TASK_RUNNING. 5168375f922SBrian Foster * Otherwise, we run the risk of sleeping indefinitely. 5178375f922SBrian Foster * 5188375f922SBrian Foster * The barrier matches the xa_target update in xfs_ail_push(). 5198375f922SBrian Foster */ 5208375f922SBrian Foster smp_rmb(); 5218375f922SBrian Foster if (!xfs_ail_min(ailp) && 5228375f922SBrian Foster ailp->xa_target == ailp->xa_target_prev) { 5238375f922SBrian Foster spin_unlock(&ailp->xa_lock); 5248375f922SBrian Foster schedule(); 5258375f922SBrian Foster tout = 0; 5268375f922SBrian Foster continue; 5278375f922SBrian Foster } 5288375f922SBrian Foster spin_unlock(&ailp->xa_lock); 5298375f922SBrian Foster 5308375f922SBrian Foster if (tout) 5318375f922SBrian Foster schedule_timeout(msecs_to_jiffies(tout)); 5328375f922SBrian Foster 5338375f922SBrian Foster __set_current_state(TASK_RUNNING); 5340030807cSChristoph Hellwig 5350030807cSChristoph Hellwig try_to_freeze(); 5360030807cSChristoph Hellwig 5370030807cSChristoph Hellwig tout = xfsaild_push(ailp); 5380030807cSChristoph Hellwig } 5390030807cSChristoph Hellwig 5400030807cSChristoph Hellwig return 0; 5410bf6a5bdSDave Chinner } 5420bf6a5bdSDave Chinner 5430bf6a5bdSDave Chinner /* 5440bf6a5bdSDave Chinner * This routine is called to move the tail of the AIL forward. It does this by 5450bf6a5bdSDave Chinner * trying to flush items in the AIL whose lsns are below the given 5460bf6a5bdSDave Chinner * threshold_lsn. 5470bf6a5bdSDave Chinner * 5480bf6a5bdSDave Chinner * The push is run asynchronously in a workqueue, which means the caller needs 5490bf6a5bdSDave Chinner * to handle waiting on the async flush for space to become available. 5500bf6a5bdSDave Chinner * We don't want to interrupt any push that is in progress, hence we only queue 5510bf6a5bdSDave Chinner * work if we set the pushing bit approriately. 5520bf6a5bdSDave Chinner * 5530bf6a5bdSDave Chinner * We do this unlocked - we only need to know whether there is anything in the 5540bf6a5bdSDave Chinner * AIL at the time we are called. We don't need to access the contents of 5550bf6a5bdSDave Chinner * any of the objects, so the lock is not needed. 5560bf6a5bdSDave Chinner */ 5570bf6a5bdSDave Chinner void 558fd074841SDave Chinner xfs_ail_push( 5590bf6a5bdSDave Chinner struct xfs_ail *ailp, 5600bf6a5bdSDave Chinner xfs_lsn_t threshold_lsn) 5610bf6a5bdSDave Chinner { 5620bf6a5bdSDave Chinner xfs_log_item_t *lip; 5630bf6a5bdSDave Chinner 5640bf6a5bdSDave Chinner lip = xfs_ail_min(ailp); 5650bf6a5bdSDave Chinner if (!lip || XFS_FORCED_SHUTDOWN(ailp->xa_mount) || 5660bf6a5bdSDave Chinner XFS_LSN_CMP(threshold_lsn, ailp->xa_target) <= 0) 5670bf6a5bdSDave Chinner return; 5680bf6a5bdSDave Chinner 5690bf6a5bdSDave Chinner /* 5700bf6a5bdSDave Chinner * Ensure that the new target is noticed in push code before it clears 5710bf6a5bdSDave Chinner * the XFS_AIL_PUSHING_BIT. 5720bf6a5bdSDave Chinner */ 5730bf6a5bdSDave Chinner smp_wmb(); 574fe0da767SDave Chinner xfs_trans_ail_copy_lsn(ailp, &ailp->xa_target, &threshold_lsn); 5750030807cSChristoph Hellwig smp_wmb(); 5760030807cSChristoph Hellwig 5770030807cSChristoph Hellwig wake_up_process(ailp->xa_task); 5780bf6a5bdSDave Chinner } 5791da177e4SLinus Torvalds 5801da177e4SLinus Torvalds /* 581fd074841SDave Chinner * Push out all items in the AIL immediately 582fd074841SDave Chinner */ 583fd074841SDave Chinner void 584fd074841SDave Chinner xfs_ail_push_all( 585fd074841SDave Chinner struct xfs_ail *ailp) 586fd074841SDave Chinner { 587fd074841SDave Chinner xfs_lsn_t threshold_lsn = xfs_ail_max_lsn(ailp); 588fd074841SDave Chinner 589fd074841SDave Chinner if (threshold_lsn) 590fd074841SDave Chinner xfs_ail_push(ailp, threshold_lsn); 591fd074841SDave Chinner } 592fd074841SDave Chinner 593fd074841SDave Chinner /* 594211e4d43SChristoph Hellwig * Push out all items in the AIL immediately and wait until the AIL is empty. 595211e4d43SChristoph Hellwig */ 596211e4d43SChristoph Hellwig void 597211e4d43SChristoph Hellwig xfs_ail_push_all_sync( 598211e4d43SChristoph Hellwig struct xfs_ail *ailp) 599211e4d43SChristoph Hellwig { 600211e4d43SChristoph Hellwig struct xfs_log_item *lip; 601211e4d43SChristoph Hellwig DEFINE_WAIT(wait); 602211e4d43SChristoph Hellwig 603211e4d43SChristoph Hellwig spin_lock(&ailp->xa_lock); 604211e4d43SChristoph Hellwig while ((lip = xfs_ail_max(ailp)) != NULL) { 605211e4d43SChristoph Hellwig prepare_to_wait(&ailp->xa_empty, &wait, TASK_UNINTERRUPTIBLE); 606211e4d43SChristoph Hellwig ailp->xa_target = lip->li_lsn; 607211e4d43SChristoph Hellwig wake_up_process(ailp->xa_task); 608211e4d43SChristoph Hellwig spin_unlock(&ailp->xa_lock); 609211e4d43SChristoph Hellwig schedule(); 610211e4d43SChristoph Hellwig spin_lock(&ailp->xa_lock); 611211e4d43SChristoph Hellwig } 612211e4d43SChristoph Hellwig spin_unlock(&ailp->xa_lock); 613211e4d43SChristoph Hellwig 614211e4d43SChristoph Hellwig finish_wait(&ailp->xa_empty, &wait); 615211e4d43SChristoph Hellwig } 616211e4d43SChristoph Hellwig 617211e4d43SChristoph Hellwig /* 6180e57f6a3SDave Chinner * xfs_trans_ail_update - bulk AIL insertion operation. 6190e57f6a3SDave Chinner * 6200e57f6a3SDave Chinner * @xfs_trans_ail_update takes an array of log items that all need to be 6210e57f6a3SDave Chinner * positioned at the same LSN in the AIL. If an item is not in the AIL, it will 6220e57f6a3SDave Chinner * be added. Otherwise, it will be repositioned by removing it and re-adding 6230e57f6a3SDave Chinner * it to the AIL. If we move the first item in the AIL, update the log tail to 6240e57f6a3SDave Chinner * match the new minimum LSN in the AIL. 6250e57f6a3SDave Chinner * 6260e57f6a3SDave Chinner * This function takes the AIL lock once to execute the update operations on 6270e57f6a3SDave Chinner * all the items in the array, and as such should not be called with the AIL 6280e57f6a3SDave Chinner * lock held. As a result, once we have the AIL lock, we need to check each log 6290e57f6a3SDave Chinner * item LSN to confirm it needs to be moved forward in the AIL. 6300e57f6a3SDave Chinner * 6310e57f6a3SDave Chinner * To optimise the insert operation, we delete all the items from the AIL in 6320e57f6a3SDave Chinner * the first pass, moving them into a temporary list, then splice the temporary 6330e57f6a3SDave Chinner * list into the correct position in the AIL. This avoids needing to do an 6340e57f6a3SDave Chinner * insert operation on every item. 6350e57f6a3SDave Chinner * 6360e57f6a3SDave Chinner * This function must be called with the AIL lock held. The lock is dropped 6370e57f6a3SDave Chinner * before returning. 6380e57f6a3SDave Chinner */ 6390e57f6a3SDave Chinner void 6400e57f6a3SDave Chinner xfs_trans_ail_update_bulk( 6410e57f6a3SDave Chinner struct xfs_ail *ailp, 6421d8c95a3SDave Chinner struct xfs_ail_cursor *cur, 6430e57f6a3SDave Chinner struct xfs_log_item **log_items, 6440e57f6a3SDave Chinner int nr_items, 6450e57f6a3SDave Chinner xfs_lsn_t lsn) __releases(ailp->xa_lock) 6460e57f6a3SDave Chinner { 6470e57f6a3SDave Chinner xfs_log_item_t *mlip; 6480e57f6a3SDave Chinner int mlip_changed = 0; 6490e57f6a3SDave Chinner int i; 6500e57f6a3SDave Chinner LIST_HEAD(tmp); 6510e57f6a3SDave Chinner 652e44f4112SAlex Elder ASSERT(nr_items > 0); /* Not required, but true. */ 6530e57f6a3SDave Chinner mlip = xfs_ail_min(ailp); 6540e57f6a3SDave Chinner 6550e57f6a3SDave Chinner for (i = 0; i < nr_items; i++) { 6560e57f6a3SDave Chinner struct xfs_log_item *lip = log_items[i]; 6570e57f6a3SDave Chinner if (lip->li_flags & XFS_LI_IN_AIL) { 6580e57f6a3SDave Chinner /* check if we really need to move the item */ 6590e57f6a3SDave Chinner if (XFS_LSN_CMP(lsn, lip->li_lsn) <= 0) 6600e57f6a3SDave Chinner continue; 6610e57f6a3SDave Chinner 662750b9c90SDave Chinner trace_xfs_ail_move(lip, lip->li_lsn, lsn); 6630e57f6a3SDave Chinner xfs_ail_delete(ailp, lip); 6640e57f6a3SDave Chinner if (mlip == lip) 6650e57f6a3SDave Chinner mlip_changed = 1; 6660e57f6a3SDave Chinner } else { 6670e57f6a3SDave Chinner lip->li_flags |= XFS_LI_IN_AIL; 668750b9c90SDave Chinner trace_xfs_ail_insert(lip, 0, lsn); 6690e57f6a3SDave Chinner } 6700e57f6a3SDave Chinner lip->li_lsn = lsn; 6710e57f6a3SDave Chinner list_add(&lip->li_ail, &tmp); 6720e57f6a3SDave Chinner } 6730e57f6a3SDave Chinner 674e44f4112SAlex Elder if (!list_empty(&tmp)) 6751d8c95a3SDave Chinner xfs_ail_splice(ailp, cur, &tmp, lsn); 6761c304625SChristoph Hellwig 6771c304625SChristoph Hellwig if (mlip_changed) { 6781c304625SChristoph Hellwig if (!XFS_FORCED_SHUTDOWN(ailp->xa_mount)) 6791c304625SChristoph Hellwig xlog_assign_tail_lsn_locked(ailp->xa_mount); 6800e57f6a3SDave Chinner spin_unlock(&ailp->xa_lock); 68109a423a3SChristoph Hellwig 682cfb7cdcaSChristoph Hellwig xfs_log_space_wake(ailp->xa_mount); 6831c304625SChristoph Hellwig } else { 6841c304625SChristoph Hellwig spin_unlock(&ailp->xa_lock); 6850e57f6a3SDave Chinner } 6860e57f6a3SDave Chinner } 6870e57f6a3SDave Chinner 6880e57f6a3SDave Chinner /* 68930136832SDave Chinner * xfs_trans_ail_delete_bulk - remove multiple log items from the AIL 69030136832SDave Chinner * 69130136832SDave Chinner * @xfs_trans_ail_delete_bulk takes an array of log items that all need to 69230136832SDave Chinner * removed from the AIL. The caller is already holding the AIL lock, and done 69330136832SDave Chinner * all the checks necessary to ensure the items passed in via @log_items are 69430136832SDave Chinner * ready for deletion. This includes checking that the items are in the AIL. 69530136832SDave Chinner * 69630136832SDave Chinner * For each log item to be removed, unlink it from the AIL, clear the IN_AIL 69730136832SDave Chinner * flag from the item and reset the item's lsn to 0. If we remove the first 69830136832SDave Chinner * item in the AIL, update the log tail to match the new minimum LSN in the 69930136832SDave Chinner * AIL. 70030136832SDave Chinner * 70130136832SDave Chinner * This function will not drop the AIL lock until all items are removed from 70230136832SDave Chinner * the AIL to minimise the amount of lock traffic on the AIL. This does not 70330136832SDave Chinner * greatly increase the AIL hold time, but does significantly reduce the amount 70430136832SDave Chinner * of traffic on the lock, especially during IO completion. 70530136832SDave Chinner * 70630136832SDave Chinner * This function must be called with the AIL lock held. The lock is dropped 70730136832SDave Chinner * before returning. 70830136832SDave Chinner */ 70930136832SDave Chinner void 71030136832SDave Chinner xfs_trans_ail_delete_bulk( 71130136832SDave Chinner struct xfs_ail *ailp, 71230136832SDave Chinner struct xfs_log_item **log_items, 71304913fddSDave Chinner int nr_items, 71404913fddSDave Chinner int shutdown_type) __releases(ailp->xa_lock) 71530136832SDave Chinner { 71630136832SDave Chinner xfs_log_item_t *mlip; 71730136832SDave Chinner int mlip_changed = 0; 71830136832SDave Chinner int i; 71930136832SDave Chinner 72030136832SDave Chinner mlip = xfs_ail_min(ailp); 72130136832SDave Chinner 72230136832SDave Chinner for (i = 0; i < nr_items; i++) { 72330136832SDave Chinner struct xfs_log_item *lip = log_items[i]; 72430136832SDave Chinner if (!(lip->li_flags & XFS_LI_IN_AIL)) { 72530136832SDave Chinner struct xfs_mount *mp = ailp->xa_mount; 72630136832SDave Chinner 72730136832SDave Chinner spin_unlock(&ailp->xa_lock); 72830136832SDave Chinner if (!XFS_FORCED_SHUTDOWN(mp)) { 7296a19d939SDave Chinner xfs_alert_tag(mp, XFS_PTAG_AILDELETE, 73030136832SDave Chinner "%s: attempting to delete a log item that is not in the AIL", 73130136832SDave Chinner __func__); 73204913fddSDave Chinner xfs_force_shutdown(mp, shutdown_type); 73330136832SDave Chinner } 73430136832SDave Chinner return; 73530136832SDave Chinner } 73630136832SDave Chinner 737750b9c90SDave Chinner trace_xfs_ail_delete(lip, mlip->li_lsn, lip->li_lsn); 73830136832SDave Chinner xfs_ail_delete(ailp, lip); 73930136832SDave Chinner lip->li_flags &= ~XFS_LI_IN_AIL; 74030136832SDave Chinner lip->li_lsn = 0; 74130136832SDave Chinner if (mlip == lip) 74230136832SDave Chinner mlip_changed = 1; 74330136832SDave Chinner } 7441c304625SChristoph Hellwig 7451c304625SChristoph Hellwig if (mlip_changed) { 7461c304625SChristoph Hellwig if (!XFS_FORCED_SHUTDOWN(ailp->xa_mount)) 7471c304625SChristoph Hellwig xlog_assign_tail_lsn_locked(ailp->xa_mount); 748211e4d43SChristoph Hellwig if (list_empty(&ailp->xa_ail)) 749211e4d43SChristoph Hellwig wake_up_all(&ailp->xa_empty); 75030136832SDave Chinner spin_unlock(&ailp->xa_lock); 75109a423a3SChristoph Hellwig 752cfb7cdcaSChristoph Hellwig xfs_log_space_wake(ailp->xa_mount); 7531c304625SChristoph Hellwig } else { 7541c304625SChristoph Hellwig spin_unlock(&ailp->xa_lock); 75530136832SDave Chinner } 75630136832SDave Chinner } 7571da177e4SLinus Torvalds 758249a8c11SDavid Chinner int 7591da177e4SLinus Torvalds xfs_trans_ail_init( 7601da177e4SLinus Torvalds xfs_mount_t *mp) 7611da177e4SLinus Torvalds { 76282fa9012SDavid Chinner struct xfs_ail *ailp; 76382fa9012SDavid Chinner 76482fa9012SDavid Chinner ailp = kmem_zalloc(sizeof(struct xfs_ail), KM_MAYFAIL); 76582fa9012SDavid Chinner if (!ailp) 76682fa9012SDavid Chinner return ENOMEM; 76782fa9012SDavid Chinner 76882fa9012SDavid Chinner ailp->xa_mount = mp; 76982fa9012SDavid Chinner INIT_LIST_HEAD(&ailp->xa_ail); 770af3e4022SDave Chinner INIT_LIST_HEAD(&ailp->xa_cursors); 771c7e8f268SDavid Chinner spin_lock_init(&ailp->xa_lock); 77243ff2122SChristoph Hellwig INIT_LIST_HEAD(&ailp->xa_buf_list); 773211e4d43SChristoph Hellwig init_waitqueue_head(&ailp->xa_empty); 7740030807cSChristoph Hellwig 7750030807cSChristoph Hellwig ailp->xa_task = kthread_run(xfsaild, ailp, "xfsaild/%s", 7760030807cSChristoph Hellwig ailp->xa_mount->m_fsname); 7770030807cSChristoph Hellwig if (IS_ERR(ailp->xa_task)) 7780030807cSChristoph Hellwig goto out_free_ailp; 7790030807cSChristoph Hellwig 78027d8d5feSDavid Chinner mp->m_ail = ailp; 78127d8d5feSDavid Chinner return 0; 7820030807cSChristoph Hellwig 7830030807cSChristoph Hellwig out_free_ailp: 7840030807cSChristoph Hellwig kmem_free(ailp); 7850030807cSChristoph Hellwig return ENOMEM; 786249a8c11SDavid Chinner } 787249a8c11SDavid Chinner 788249a8c11SDavid Chinner void 789249a8c11SDavid Chinner xfs_trans_ail_destroy( 790249a8c11SDavid Chinner xfs_mount_t *mp) 791249a8c11SDavid Chinner { 79282fa9012SDavid Chinner struct xfs_ail *ailp = mp->m_ail; 79382fa9012SDavid Chinner 7940030807cSChristoph Hellwig kthread_stop(ailp->xa_task); 79582fa9012SDavid Chinner kmem_free(ailp); 7961da177e4SLinus Torvalds } 797