2 * Copyright (c) 2010 Red Hat, Inc. All Rights Reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License as
6 * published by the Free Software Foundation.
8 * This program is distributed in the hope that it would be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11 * GNU General Public License for more details.
13 * You should have received a copy of the GNU General Public License
14 * along with this program; if not, write the Free Software Foundation,
15 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
20 #include "xfs_types.h"
24 #include "xfs_trans.h"
25 #include "xfs_trans_priv.h"
26 #include "xfs_log_priv.h"
29 #include "xfs_mount.h"
30 #include "xfs_error.h"
31 #include "xfs_alloc.h"
34 * Perform initial CIL structure initialisation. If the CIL is not
35 * enabled in this filesystem, ensure the log->l_cilp is null so
36 * we can check this conditional to determine if we are doing delayed
44 struct xfs_cil_ctx
*ctx
;
47 if (!(log
->l_mp
->m_flags
& XFS_MOUNT_DELAYLOG
))
50 cil
= kmem_zalloc(sizeof(*cil
), KM_SLEEP
|KM_MAYFAIL
);
54 ctx
= kmem_zalloc(sizeof(*ctx
), KM_SLEEP
|KM_MAYFAIL
);
60 INIT_LIST_HEAD(&cil
->xc_cil
);
61 INIT_LIST_HEAD(&cil
->xc_committing
);
62 spin_lock_init(&cil
->xc_cil_lock
);
63 init_rwsem(&cil
->xc_ctx_lock
);
64 init_waitqueue_head(&cil
->xc_commit_wait
);
66 INIT_LIST_HEAD(&ctx
->committing
);
67 INIT_LIST_HEAD(&ctx
->busy_extents
);
71 cil
->xc_current_sequence
= ctx
->sequence
;
85 if (log
->l_cilp
->xc_ctx
) {
86 if (log
->l_cilp
->xc_ctx
->ticket
)
87 xfs_log_ticket_put(log
->l_cilp
->xc_ctx
->ticket
);
88 kmem_free(log
->l_cilp
->xc_ctx
);
91 ASSERT(list_empty(&log
->l_cilp
->xc_cil
));
92 kmem_free(log
->l_cilp
);
96 * Allocate a new ticket. Failing to get a new ticket makes it really hard to
97 * recover, so we don't allow failure here. Also, we allocate in a context that
98 * we don't want to be issuing transactions from, so we need to tell the
99 * allocation code this as well.
101 * We don't reserve any space for the ticket - we are going to steal whatever
102 * space we require from transactions as they commit. To ensure we reserve all
103 * the space required, we need to set the current reservation of the ticket to
104 * zero so that we know to steal the initial transaction overhead from the
105 * first transaction commit.
107 static struct xlog_ticket
*
108 xlog_cil_ticket_alloc(
111 struct xlog_ticket
*tic
;
113 tic
= xlog_ticket_alloc(log
, 0, 1, XFS_TRANSACTION
, 0,
115 tic
->t_trans_type
= XFS_TRANS_CHECKPOINT
;
118 * set the current reservation to zero so we know to steal the basic
119 * transaction overhead reservation from the first transaction commit.
126 * After the first stage of log recovery is done, we know where the head and
127 * tail of the log are. We need this log initialisation done before we can
128 * initialise the first CIL checkpoint context.
130 * Here we allocate a log ticket to track space usage during a CIL push. This
131 * ticket is passed to xlog_write() directly so that we don't slowly leak log
132 * space by failing to account for space used by log headers and additional
133 * region headers for split regions.
136 xlog_cil_init_post_recovery(
142 log
->l_cilp
->xc_ctx
->ticket
= xlog_cil_ticket_alloc(log
);
143 log
->l_cilp
->xc_ctx
->sequence
= 1;
144 log
->l_cilp
->xc_ctx
->commit_lsn
= xlog_assign_lsn(log
->l_curr_cycle
,
149 * Format log item into a flat buffers
151 * For delayed logging, we need to hold a formatted buffer containing all the
152 * changes on the log item. This enables us to relog the item in memory and
153 * write it out asynchronously without needing to relock the object that was
154 * modified at the time it gets written into the iclog.
156 * This function builds a vector for the changes in each log item in the
157 * transaction. It then works out the length of the buffer needed for each log
158 * item, allocates them and formats the vector for the item into the buffer.
159 * The buffer is then attached to the log item are then inserted into the
160 * Committed Item List for tracking until the next checkpoint is written out.
162 * We don't set up region headers during this process; we simply copy the
163 * regions into the flat buffer. We can do this because we still have to do a
164 * formatting step to write the regions into the iclog buffer. Writing the
165 * ophdrs during the iclog write means that we can support splitting large
166 * regions across iclog boundares without needing a change in the format of the
167 * item/region encapsulation.
169 * Hence what we need to do now is change the rewrite the vector array to point
170 * to the copied region inside the buffer we just allocated. This allows us to
171 * format the regions into the iclog as though they are being formatted
172 * directly out of the objects themselves.
175 xlog_cil_format_items(
177 struct xfs_log_vec
*log_vector
)
179 struct xfs_log_vec
*lv
;
182 for (lv
= log_vector
; lv
; lv
= lv
->lv_next
) {
187 /* build the vector array and calculate it's length */
188 IOP_FORMAT(lv
->lv_item
, lv
->lv_iovecp
);
189 for (index
= 0; index
< lv
->lv_niovecs
; index
++)
190 len
+= lv
->lv_iovecp
[index
].i_len
;
192 lv
->lv_buf_len
= len
;
193 lv
->lv_buf
= kmem_alloc(lv
->lv_buf_len
, KM_SLEEP
|KM_NOFS
);
196 for (index
= 0; index
< lv
->lv_niovecs
; index
++) {
197 struct xfs_log_iovec
*vec
= &lv
->lv_iovecp
[index
];
199 memcpy(ptr
, vec
->i_addr
, vec
->i_len
);
203 ASSERT(ptr
== lv
->lv_buf
+ lv
->lv_buf_len
);
208 * Prepare the log item for insertion into the CIL. Calculate the difference in
209 * log space and vectors it will consume, and if it is a new item pin it as
213 xfs_cil_prepare_item(
215 struct xfs_log_vec
*lv
,
219 struct xfs_log_vec
*old
= lv
->lv_item
->li_lv
;
222 /* existing lv on log item, space used is a delta */
223 ASSERT(!list_empty(&lv
->lv_item
->li_cil
));
224 ASSERT(old
->lv_buf
&& old
->lv_buf_len
&& old
->lv_niovecs
);
226 *len
+= lv
->lv_buf_len
- old
->lv_buf_len
;
227 *diff_iovecs
+= lv
->lv_niovecs
- old
->lv_niovecs
;
228 kmem_free(old
->lv_buf
);
231 /* new lv, must pin the log item */
232 ASSERT(!lv
->lv_item
->li_lv
);
233 ASSERT(list_empty(&lv
->lv_item
->li_cil
));
235 *len
+= lv
->lv_buf_len
;
236 *diff_iovecs
+= lv
->lv_niovecs
;
237 IOP_PIN(lv
->lv_item
);
241 /* attach new log vector to log item */
242 lv
->lv_item
->li_lv
= lv
;
245 * If this is the first time the item is being committed to the
246 * CIL, store the sequence number on the log item so we can
247 * tell in future commits whether this is the first checkpoint
248 * the item is being committed into.
250 if (!lv
->lv_item
->li_seq
)
251 lv
->lv_item
->li_seq
= log
->l_cilp
->xc_ctx
->sequence
;
255 * Insert the log items into the CIL and calculate the difference in space
256 * consumed by the item. Add the space to the checkpoint ticket and calculate
257 * if the change requires additional log metadata. If it does, take that space
258 * as well. Remove the amount of space we addded to the checkpoint ticket from
259 * the current transaction ticket so that the accounting works out correctly.
262 xlog_cil_insert_items(
264 struct xfs_log_vec
*log_vector
,
265 struct xlog_ticket
*ticket
)
267 struct xfs_cil
*cil
= log
->l_cilp
;
268 struct xfs_cil_ctx
*ctx
= cil
->xc_ctx
;
269 struct xfs_log_vec
*lv
;
277 * Do all the accounting aggregation and switching of log vectors
278 * around in a separate loop to the insertion of items into the CIL.
279 * Then we can do a separate loop to update the CIL within a single
280 * lock/unlock pair. This reduces the number of round trips on the CIL
281 * lock from O(nr_logvectors) to O(1) and greatly reduces the overall
282 * hold time for the transaction commit.
284 * If this is the first time the item is being placed into the CIL in
285 * this context, pin it so it can't be written to disk until the CIL is
286 * flushed to the iclog and the iclog written to disk.
288 * We can do this safely because the context can't checkpoint until we
289 * are done so it doesn't matter exactly how we update the CIL.
291 for (lv
= log_vector
; lv
; lv
= lv
->lv_next
)
292 xfs_cil_prepare_item(log
, lv
, &len
, &diff_iovecs
);
294 /* account for space used by new iovec headers */
295 len
+= diff_iovecs
* sizeof(xlog_op_header_t
);
297 spin_lock(&cil
->xc_cil_lock
);
299 /* move the items to the tail of the CIL */
300 for (lv
= log_vector
; lv
; lv
= lv
->lv_next
)
301 list_move_tail(&lv
->lv_item
->li_cil
, &cil
->xc_cil
);
303 ctx
->nvecs
+= diff_iovecs
;
306 * Now transfer enough transaction reservation to the context ticket
307 * for the checkpoint. The context ticket is special - the unit
308 * reservation has to grow as well as the current reservation as we
309 * steal from tickets so we can correctly determine the space used
310 * during the transaction commit.
312 if (ctx
->ticket
->t_curr_res
== 0) {
313 /* first commit in checkpoint, steal the header reservation */
314 ASSERT(ticket
->t_curr_res
>= ctx
->ticket
->t_unit_res
+ len
);
315 ctx
->ticket
->t_curr_res
= ctx
->ticket
->t_unit_res
;
316 ticket
->t_curr_res
-= ctx
->ticket
->t_unit_res
;
319 /* do we need space for more log record headers? */
320 iclog_space
= log
->l_iclog_size
- log
->l_iclog_hsize
;
321 if (len
> 0 && (ctx
->space_used
/ iclog_space
!=
322 (ctx
->space_used
+ len
) / iclog_space
)) {
325 hdrs
= (len
+ iclog_space
- 1) / iclog_space
;
326 /* need to take into account split region headers, too */
327 hdrs
*= log
->l_iclog_hsize
+ sizeof(struct xlog_op_header
);
328 ctx
->ticket
->t_unit_res
+= hdrs
;
329 ctx
->ticket
->t_curr_res
+= hdrs
;
330 ticket
->t_curr_res
-= hdrs
;
331 ASSERT(ticket
->t_curr_res
>= len
);
333 ticket
->t_curr_res
-= len
;
334 ctx
->space_used
+= len
;
336 spin_unlock(&cil
->xc_cil_lock
);
340 xlog_cil_free_logvec(
341 struct xfs_log_vec
*log_vector
)
343 struct xfs_log_vec
*lv
;
345 for (lv
= log_vector
; lv
; ) {
346 struct xfs_log_vec
*next
= lv
->lv_next
;
347 kmem_free(lv
->lv_buf
);
354 * Mark all items committed and clear busy extents. We free the log vector
355 * chains in a separate pass so that we unpin the log items as quickly as
363 struct xfs_cil_ctx
*ctx
= args
;
365 xfs_trans_committed_bulk(ctx
->cil
->xc_log
->l_ailp
, ctx
->lv_chain
,
366 ctx
->start_lsn
, abort
);
368 xfs_alloc_busy_sort(&ctx
->busy_extents
);
369 xfs_alloc_busy_clear(ctx
->cil
->xc_log
->l_mp
, &ctx
->busy_extents
);
371 spin_lock(&ctx
->cil
->xc_cil_lock
);
372 list_del(&ctx
->committing
);
373 spin_unlock(&ctx
->cil
->xc_cil_lock
);
375 xlog_cil_free_logvec(ctx
->lv_chain
);
380 * Push the Committed Item List to the log. If @push_seq flag is zero, then it
381 * is a background flush and so we can chose to ignore it. Otherwise, if the
382 * current sequence is the same as @push_seq we need to do a flush. If
383 * @push_seq is less than the current sequence, then it has already been
384 * flushed and we don't need to do anything - the caller will wait for it to
385 * complete if necessary.
387 * @push_seq is a value rather than a flag because that allows us to do an
388 * unlocked check of the sequence number for a match. Hence we can allows log
389 * forces to run racily and not issue pushes for the same sequence twice. If we
390 * get a race between multiple pushes for the same sequence they will block on
391 * the first one and then abort, hence avoiding needless pushes.
398 struct xfs_cil
*cil
= log
->l_cilp
;
399 struct xfs_log_vec
*lv
;
400 struct xfs_cil_ctx
*ctx
;
401 struct xfs_cil_ctx
*new_ctx
;
402 struct xlog_in_core
*commit_iclog
;
403 struct xlog_ticket
*tic
;
408 struct xfs_trans_header thdr
;
409 struct xfs_log_iovec lhdr
;
410 struct xfs_log_vec lvhdr
= { NULL
};
411 xfs_lsn_t commit_lsn
;
416 ASSERT(!push_seq
|| push_seq
<= cil
->xc_ctx
->sequence
);
418 new_ctx
= kmem_zalloc(sizeof(*new_ctx
), KM_SLEEP
|KM_NOFS
);
419 new_ctx
->ticket
= xlog_cil_ticket_alloc(log
);
422 * Lock out transaction commit, but don't block for background pushes
423 * unless we are well over the CIL space limit. See the definition of
424 * XLOG_CIL_HARD_SPACE_LIMIT() for the full explanation of the logic
427 if (!down_write_trylock(&cil
->xc_ctx_lock
)) {
429 cil
->xc_ctx
->space_used
< XLOG_CIL_HARD_SPACE_LIMIT(log
))
430 goto out_free_ticket
;
431 down_write(&cil
->xc_ctx_lock
);
435 /* check if we've anything to push */
436 if (list_empty(&cil
->xc_cil
))
439 /* check for spurious background flush */
440 if (!push_seq
&& cil
->xc_ctx
->space_used
< XLOG_CIL_SPACE_LIMIT(log
))
443 /* check for a previously pushed seqeunce */
444 if (push_seq
&& push_seq
< cil
->xc_ctx
->sequence
)
448 * pull all the log vectors off the items in the CIL, and
449 * remove the items from the CIL. We don't need the CIL lock
450 * here because it's only needed on the transaction commit
451 * side which is currently locked out by the flush lock.
457 while (!list_empty(&cil
->xc_cil
)) {
458 struct xfs_log_item
*item
;
461 item
= list_first_entry(&cil
->xc_cil
,
462 struct xfs_log_item
, li_cil
);
463 list_del_init(&item
->li_cil
);
465 ctx
->lv_chain
= item
->li_lv
;
467 lv
->lv_next
= item
->li_lv
;
472 num_iovecs
+= lv
->lv_niovecs
;
473 for (i
= 0; i
< lv
->lv_niovecs
; i
++)
474 len
+= lv
->lv_iovecp
[i
].i_len
;
478 * initialise the new context and attach it to the CIL. Then attach
479 * the current context to the CIL committing lsit so it can be found
480 * during log forces to extract the commit lsn of the sequence that
481 * needs to be forced.
483 INIT_LIST_HEAD(&new_ctx
->committing
);
484 INIT_LIST_HEAD(&new_ctx
->busy_extents
);
485 new_ctx
->sequence
= ctx
->sequence
+ 1;
487 cil
->xc_ctx
= new_ctx
;
490 * mirror the new sequence into the cil structure so that we can do
491 * unlocked checks against the current sequence in log forces without
492 * risking deferencing a freed context pointer.
494 cil
->xc_current_sequence
= new_ctx
->sequence
;
497 * The switch is now done, so we can drop the context lock and move out
498 * of a shared context. We can't just go straight to the commit record,
499 * though - we need to synchronise with previous and future commits so
500 * that the commit records are correctly ordered in the log to ensure
501 * that we process items during log IO completion in the correct order.
503 * For example, if we get an EFI in one checkpoint and the EFD in the
504 * next (e.g. due to log forces), we do not want the checkpoint with
505 * the EFD to be committed before the checkpoint with the EFI. Hence
506 * we must strictly order the commit records of the checkpoints so
507 * that: a) the checkpoint callbacks are attached to the iclogs in the
508 * correct order; and b) the checkpoints are replayed in correct order
511 * Hence we need to add this context to the committing context list so
512 * that higher sequences will wait for us to write out a commit record
515 spin_lock(&cil
->xc_cil_lock
);
516 list_add(&ctx
->committing
, &cil
->xc_committing
);
517 spin_unlock(&cil
->xc_cil_lock
);
518 up_write(&cil
->xc_ctx_lock
);
521 * Build a checkpoint transaction header and write it to the log to
522 * begin the transaction. We need to account for the space used by the
523 * transaction header here as it is not accounted for in xlog_write().
525 * The LSN we need to pass to the log items on transaction commit is
526 * the LSN reported by the first log vector write. If we use the commit
527 * record lsn then we can move the tail beyond the grant write head.
530 thdr
.th_magic
= XFS_TRANS_HEADER_MAGIC
;
531 thdr
.th_type
= XFS_TRANS_CHECKPOINT
;
532 thdr
.th_tid
= tic
->t_tid
;
533 thdr
.th_num_items
= num_iovecs
;
535 lhdr
.i_len
= sizeof(xfs_trans_header_t
);
536 lhdr
.i_type
= XLOG_REG_TYPE_TRANSHDR
;
537 tic
->t_curr_res
-= lhdr
.i_len
+ sizeof(xlog_op_header_t
);
539 lvhdr
.lv_niovecs
= 1;
540 lvhdr
.lv_iovecp
= &lhdr
;
541 lvhdr
.lv_next
= ctx
->lv_chain
;
543 error
= xlog_write(log
, &lvhdr
, tic
, &ctx
->start_lsn
, NULL
, 0);
545 goto out_abort_free_ticket
;
548 * now that we've written the checkpoint into the log, strictly
549 * order the commit records so replay will get them in the right order.
552 spin_lock(&cil
->xc_cil_lock
);
553 list_for_each_entry(new_ctx
, &cil
->xc_committing
, committing
) {
555 * Higher sequences will wait for this one so skip them.
556 * Don't wait for own own sequence, either.
558 if (new_ctx
->sequence
>= ctx
->sequence
)
560 if (!new_ctx
->commit_lsn
) {
562 * It is still being pushed! Wait for the push to
563 * complete, then start again from the beginning.
565 xlog_wait(&cil
->xc_commit_wait
, &cil
->xc_cil_lock
);
569 spin_unlock(&cil
->xc_cil_lock
);
571 /* xfs_log_done always frees the ticket on error. */
572 commit_lsn
= xfs_log_done(log
->l_mp
, tic
, &commit_iclog
, 0);
573 if (commit_lsn
== -1)
576 /* attach all the transactions w/ busy extents to iclog */
577 ctx
->log_cb
.cb_func
= xlog_cil_committed
;
578 ctx
->log_cb
.cb_arg
= ctx
;
579 error
= xfs_log_notify(log
->l_mp
, commit_iclog
, &ctx
->log_cb
);
584 * now the checkpoint commit is complete and we've attached the
585 * callbacks to the iclog we can assign the commit LSN to the context
586 * and wake up anyone who is waiting for the commit to complete.
588 spin_lock(&cil
->xc_cil_lock
);
589 ctx
->commit_lsn
= commit_lsn
;
590 wake_up_all(&cil
->xc_commit_wait
);
591 spin_unlock(&cil
->xc_cil_lock
);
593 /* release the hounds! */
594 return xfs_log_release_iclog(log
->l_mp
, commit_iclog
);
597 up_write(&cil
->xc_ctx_lock
);
599 xfs_log_ticket_put(new_ctx
->ticket
);
603 out_abort_free_ticket
:
604 xfs_log_ticket_put(tic
);
606 xlog_cil_committed(ctx
, XFS_LI_ABORTED
);
607 return XFS_ERROR(EIO
);
611 * Commit a transaction with the given vector to the Committed Item List.
613 * To do this, we need to format the item, pin it in memory if required and
614 * account for the space used by the transaction. Once we have done that we
615 * need to release the unused reservation for the transaction, attach the
616 * transaction to the checkpoint context so we carry the busy extents through
617 * to checkpoint completion, and then unlock all the items in the transaction.
619 * For more specific information about the order of operations in
620 * xfs_log_commit_cil() please refer to the comments in
621 * xfs_trans_commit_iclog().
623 * Called with the context lock already held in read mode to lock out
624 * background commit, returns without it held once background commits are
629 struct xfs_mount
*mp
,
630 struct xfs_trans
*tp
,
631 struct xfs_log_vec
*log_vector
,
632 xfs_lsn_t
*commit_lsn
,
635 struct log
*log
= mp
->m_log
;
639 if (flags
& XFS_TRANS_RELEASE_LOG_RES
)
640 log_flags
= XFS_LOG_REL_PERM_RESERV
;
643 * do all the hard work of formatting items (including memory
644 * allocation) outside the CIL context lock. This prevents stalling CIL
645 * pushes when we are low on memory and a transaction commit spends a
646 * lot of time in memory reclaim.
648 xlog_cil_format_items(log
, log_vector
);
650 /* lock out background commit */
651 down_read(&log
->l_cilp
->xc_ctx_lock
);
653 *commit_lsn
= log
->l_cilp
->xc_ctx
->sequence
;
655 xlog_cil_insert_items(log
, log_vector
, tp
->t_ticket
);
657 /* check we didn't blow the reservation */
658 if (tp
->t_ticket
->t_curr_res
< 0)
659 xlog_print_tic_res(log
->l_mp
, tp
->t_ticket
);
661 /* attach the transaction to the CIL if it has any busy extents */
662 if (!list_empty(&tp
->t_busy
)) {
663 spin_lock(&log
->l_cilp
->xc_cil_lock
);
664 list_splice_init(&tp
->t_busy
,
665 &log
->l_cilp
->xc_ctx
->busy_extents
);
666 spin_unlock(&log
->l_cilp
->xc_cil_lock
);
669 tp
->t_commit_lsn
= *commit_lsn
;
670 xfs_log_done(mp
, tp
->t_ticket
, NULL
, log_flags
);
671 xfs_trans_unreserve_and_mod_sb(tp
);
674 * Once all the items of the transaction have been copied to the CIL,
675 * the items can be unlocked and freed.
677 * This needs to be done before we drop the CIL context lock because we
678 * have to update state in the log items and unlock them before they go
679 * to disk. If we don't, then the CIL checkpoint can race with us and
680 * we can run checkpoint completion before we've updated and unlocked
681 * the log items. This affects (at least) processing of stale buffers,
684 xfs_trans_free_items(tp
, *commit_lsn
, 0);
686 /* check for background commit before unlock */
687 if (log
->l_cilp
->xc_ctx
->space_used
> XLOG_CIL_SPACE_LIMIT(log
))
690 up_read(&log
->l_cilp
->xc_ctx_lock
);
693 * We need to push CIL every so often so we don't cache more than we
694 * can fit in the log. The limit really is that a checkpoint can't be
695 * more than half the log (the current checkpoint is not allowed to
696 * overwrite the previous checkpoint), but commit latency and memory
697 * usage limit this to a smaller size in most cases.
700 xlog_cil_push(log
, 0);
704 * Conditionally push the CIL based on the sequence passed in.
706 * We only need to push if we haven't already pushed the sequence
707 * number given. Hence the only time we will trigger a push here is
708 * if the push sequence is the same as the current context.
710 * We return the current commit lsn to allow the callers to determine if a
711 * iclog flush is necessary following this call.
713 * XXX: Initially, just push the CIL unconditionally and return whatever
714 * commit lsn is there. It'll be empty, so this is broken for now.
721 struct xfs_cil
*cil
= log
->l_cilp
;
722 struct xfs_cil_ctx
*ctx
;
723 xfs_lsn_t commit_lsn
= NULLCOMMITLSN
;
725 ASSERT(sequence
<= cil
->xc_current_sequence
);
728 * check to see if we need to force out the current context.
729 * xlog_cil_push() handles racing pushes for the same sequence,
730 * so no need to deal with it here.
732 if (sequence
== cil
->xc_current_sequence
)
733 xlog_cil_push(log
, sequence
);
736 * See if we can find a previous sequence still committing.
737 * We need to wait for all previous sequence commits to complete
738 * before allowing the force of push_seq to go ahead. Hence block
739 * on commits for those as well.
742 spin_lock(&cil
->xc_cil_lock
);
743 list_for_each_entry(ctx
, &cil
->xc_committing
, committing
) {
744 if (ctx
->sequence
> sequence
)
746 if (!ctx
->commit_lsn
) {
748 * It is still being pushed! Wait for the push to
749 * complete, then start again from the beginning.
751 xlog_wait(&cil
->xc_commit_wait
, &cil
->xc_cil_lock
);
754 if (ctx
->sequence
!= sequence
)
757 commit_lsn
= ctx
->commit_lsn
;
759 spin_unlock(&cil
->xc_cil_lock
);
764 * Check if the current log item was first committed in this sequence.
765 * We can't rely on just the log item being in the CIL, we have to check
766 * the recorded commit sequence number.
768 * Note: for this to be used in a non-racy manner, it has to be called with
769 * CIL flushing locked out. As a result, it should only be used during the
770 * transaction commit process when deciding what to format into the item.
773 xfs_log_item_in_current_chkpt(
774 struct xfs_log_item
*lip
)
776 struct xfs_cil_ctx
*ctx
;
778 if (!(lip
->li_mountp
->m_flags
& XFS_MOUNT_DELAYLOG
))
780 if (list_empty(&lip
->li_cil
))
783 ctx
= lip
->li_mountp
->m_log
->l_cilp
->xc_ctx
;
786 * li_seq is written on the first commit of a log item to record the
787 * first checkpoint it is written to. Hence if it is different to the
788 * current sequence, we're in a new checkpoint.
790 if (XFS_LSN_CMP(lip
->li_seq
, ctx
->sequence
) != 0)