Lines Matching refs:lsn
41 xfs_lsn_t lsn;
58 lsn = lip->li_lsn;
61 (prev_lsn == NULLCOMMITLSN || XFS_LSN_CMP(prev_lsn, lsn) <= 0) &&
62 (next_lsn == NULLCOMMITLSN || XFS_LSN_CMP(next_lsn, lsn) >= 0))
67 ASSERT(prev_lsn == NULLCOMMITLSN || XFS_LSN_CMP(prev_lsn, lsn) <= 0);
68 ASSERT(next_lsn == NULLCOMMITLSN || XFS_LSN_CMP(next_lsn, lsn) >= 0);
109 * We need the AIL lock in order to get a coherent read of the lsn of the last
127 xfs_lsn_t lsn;
130 lsn = __xfs_ail_min_lsn(ailp);
133 return lsn;
137 * Return the maximum lsn held in the AIL, or zero if the AIL is empty.
143 xfs_lsn_t lsn = 0;
149 lsn = lip->li_lsn;
152 return lsn;
224 * Find the first item in the AIL with the given @lsn by searching in ascending
226 * ascending traversal. Pass a @lsn of zero to initialise the cursor to the
233 xfs_lsn_t lsn)
239 if (lsn == 0) {
245 if (XFS_LSN_CMP(lip->li_lsn, lsn) >= 0)
259 xfs_lsn_t lsn)
264 if (XFS_LSN_CMP(lip->li_lsn, lsn) <= 0)
271 * Find the last item in the AIL with the given @lsn by searching in descending
273 * item with the value of @lsn, then it sets the cursor to the last item with an
274 * LSN lower than @lsn. Returns NULL if the list is empty.
280 xfs_lsn_t lsn)
283 cur->item = __xfs_trans_ail_cursor_last(ailp, lsn);
298 xfs_lsn_t lsn)
311 lip = __xfs_trans_ail_cursor_last(ailp, lsn);
315 * in lsn order, and future items to be spliced in will
423 xfs_lsn_t lsn;
458 lsn = lip->li_lsn;
473 ailp->ail_last_pushed_lsn = lsn;
492 ailp->ail_last_pushed_lsn = lsn;
534 lsn = lip->li_lsn;
544 if (!count || XFS_LSN_CMP(lsn, target) >= 0) {
740 /* if the tail lsn hasn't changed, don't do updates or wakeups. */
783 xfs_lsn_t lsn) __releases(ailp->ail_lock)
797 if (XFS_LSN_CMP(lsn, lip->li_lsn) <= 0)
800 trace_xfs_ail_move(lip, lip->li_lsn, lsn);
806 trace_xfs_ail_insert(lip, 0, lsn);
808 lip->li_lsn = lsn;
813 xfs_ail_splice(ailp, cur, &tmp, lsn);
823 xfs_lsn_t lsn)
826 xfs_trans_ail_update_bulk(ailp, NULL, &lip, 1, lsn);
842 xfs_lsn_t lsn = lip->li_lsn;
850 return lsn;