fs/xfs/xfs_trans_ail.c

42 	xfs_lsn_t		lsn;
59 	lsn = lip->li_lsn;
62 	    (prev_lsn == NULLCOMMITLSN || XFS_LSN_CMP(prev_lsn, lsn) <= 0) &&
63 	    (next_lsn == NULLCOMMITLSN || XFS_LSN_CMP(next_lsn, lsn) >= 0))
68 	ASSERT(prev_lsn == NULLCOMMITLSN || XFS_LSN_CMP(prev_lsn, lsn) <= 0);
69 	ASSERT(next_lsn == NULLCOMMITLSN || XFS_LSN_CMP(next_lsn, lsn) >= 0);
110  * We need the AIL lock in order to get a coherent read of the lsn of the last
128 	xfs_lsn_t		lsn;
131 	lsn = __xfs_ail_min_lsn(ailp);
134 	return lsn;
138  * Return the maximum lsn held in the AIL, or zero if the AIL is empty.
144 	xfs_lsn_t       	lsn = 0;
150 		lsn = lip->li_lsn;
153 	return lsn;
225  * Find the first item in the AIL with the given @lsn by searching in ascending
227  * ascending traversal.  Pass a @lsn of zero to initialise the cursor to the
234 	xfs_lsn_t		lsn)
240 	if (lsn == 0) {
246 		if (XFS_LSN_CMP(lip->li_lsn, lsn) >= 0)
260 	xfs_lsn_t		lsn)
265 		if (XFS_LSN_CMP(lip->li_lsn, lsn) <= 0)
272  * Find the last item in the AIL with the given @lsn by searching in descending
274  * item with the value of @lsn, then it sets the cursor to the last item with an
275  * LSN lower than @lsn.  Returns NULL if the list is empty.
281 	xfs_lsn_t		lsn)
284 	cur->item = __xfs_trans_ail_cursor_last(ailp, lsn);
299 	xfs_lsn_t		lsn)
312 		lip = __xfs_trans_ail_cursor_last(ailp, lsn);
316 	 * in lsn order, and future items to be spliced in will
424 	xfs_lsn_t		lsn;
477 	lsn = lip->li_lsn;
492 			ailp->ail_last_pushed_lsn = lsn;
511 			ailp->ail_last_pushed_lsn = lsn;
553 		lsn = lip->li_lsn;
563 	if (!count || XFS_LSN_CMP(lsn, target) >= 0) {
757 	/* if the tail lsn hasn't changed, don't do updates or wakeups. */
800 	xfs_lsn_t		lsn) __releases(ailp->ail_lock)
814 			if (XFS_LSN_CMP(lsn, lip->li_lsn) <= 0)
817 			trace_xfs_ail_move(lip, lip->li_lsn, lsn);
823 			trace_xfs_ail_insert(lip, 0, lsn);
825 		lip->li_lsn = lsn;
830 		xfs_ail_splice(ailp, cur, &tmp, lsn);
840 	xfs_lsn_t		lsn)
843 	xfs_trans_ail_update_bulk(ailp, NULL, &lip, 1, lsn);
859 	xfs_lsn_t		lsn = lip->li_lsn;
867 		return lsn;