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_log_format.h"
21 #include "xfs_shared.h"
22 #include "xfs_trans_resv.h"
25 #include "xfs_mount.h"
26 #include "xfs_error.h"
27 #include "xfs_alloc.h"
28 #include "xfs_extent_busy.h"
29 #include "xfs_discard.h"
30 #include "xfs_trans.h"
31 #include "xfs_trans_priv.h"
33 #include "xfs_log_priv.h"
36 * Allocate a new ticket. Failing to get a new ticket makes it really hard to
37 * recover, so we don't allow failure here. Also, we allocate in a context that
38 * we don't want to be issuing transactions from, so we need to tell the
39 * allocation code this as well.
41 * We don't reserve any space for the ticket - we are going to steal whatever
42 * space we require from transactions as they commit. To ensure we reserve all
43 * the space required, we need to set the current reservation of the ticket to
44 * zero so that we know to steal the initial transaction overhead from the
45 * first transaction commit.
47 static struct xlog_ticket *
48 xlog_cil_ticket_alloc(
51 struct xlog_ticket *tic;
53 tic = xlog_ticket_alloc(log, 0, 1, XFS_TRANSACTION, 0,
55 tic->t_trans_type = XFS_TRANS_CHECKPOINT;
58 * set the current reservation to zero so we know to steal the basic
59 * transaction overhead reservation from the first transaction commit.
66 * After the first stage of log recovery is done, we know where the head and
67 * tail of the log are. We need this log initialisation done before we can
68 * initialise the first CIL checkpoint context.
70 * Here we allocate a log ticket to track space usage during a CIL push. This
71 * ticket is passed to xlog_write() directly so that we don't slowly leak log
72 * space by failing to account for space used by log headers and additional
73 * region headers for split regions.
76 xlog_cil_init_post_recovery(
79 log->l_cilp->xc_ctx->ticket = xlog_cil_ticket_alloc(log);
80 log->l_cilp->xc_ctx->sequence = 1;
81 log->l_cilp->xc_ctx->commit_lsn = xlog_assign_lsn(log->l_curr_cycle,
86 * Prepare the log item for insertion into the CIL. Calculate the difference in
87 * log space and vectors it will consume, and if it is a new item pin it as
93 struct xfs_log_vec *lv,
94 struct xfs_log_vec *old_lv,
98 /* Account for the new LV being passed in */
99 if (lv->lv_buf_len != XFS_LOG_VEC_ORDERED) {
100 *diff_len += lv->lv_buf_len;
101 *diff_iovecs += lv->lv_niovecs;
105 * If there is no old LV, this is the first time we've seen the item in
106 * this CIL context and so we need to pin it. If we are replacing the
107 * old_lv, then remove the space it accounts for and free it.
110 lv->lv_item->li_ops->iop_pin(lv->lv_item);
111 else if (old_lv != lv) {
112 ASSERT(lv->lv_buf_len != XFS_LOG_VEC_ORDERED);
114 *diff_len -= old_lv->lv_buf_len;
115 *diff_iovecs -= old_lv->lv_niovecs;
119 /* attach new log vector to log item */
120 lv->lv_item->li_lv = lv;
123 * If this is the first time the item is being committed to the
124 * CIL, store the sequence number on the log item so we can
125 * tell in future commits whether this is the first checkpoint
126 * the item is being committed into.
128 if (!lv->lv_item->li_seq)
129 lv->lv_item->li_seq = log->l_cilp->xc_ctx->sequence;
133 * Format log item into a flat buffers
135 * For delayed logging, we need to hold a formatted buffer containing all the
136 * changes on the log item. This enables us to relog the item in memory and
137 * write it out asynchronously without needing to relock the object that was
138 * modified at the time it gets written into the iclog.
140 * This function builds a vector for the changes in each log item in the
141 * transaction. It then works out the length of the buffer needed for each log
142 * item, allocates them and formats the vector for the item into the buffer.
143 * The buffer is then attached to the log item are then inserted into the
144 * Committed Item List for tracking until the next checkpoint is written out.
146 * We don't set up region headers during this process; we simply copy the
147 * regions into the flat buffer. We can do this because we still have to do a
148 * formatting step to write the regions into the iclog buffer. Writing the
149 * ophdrs during the iclog write means that we can support splitting large
150 * regions across iclog boundares without needing a change in the format of the
151 * item/region encapsulation.
153 * Hence what we need to do now is change the rewrite the vector array to point
154 * to the copied region inside the buffer we just allocated. This allows us to
155 * format the regions into the iclog as though they are being formatted
156 * directly out of the objects themselves.
159 xlog_cil_insert_format_items(
161 struct xfs_trans *tp,
165 struct xfs_log_item_desc *lidp;
168 /* Bail out if we didn't find a log item. */
169 if (list_empty(&tp->t_items)) {
174 list_for_each_entry(lidp, &tp->t_items, lid_trans) {
175 struct xfs_log_item *lip = lidp->lid_item;
176 struct xfs_log_vec *lv;
177 struct xfs_log_vec *old_lv;
181 bool ordered = false;
183 /* Skip items which aren't dirty in this transaction. */
184 if (!(lidp->lid_flags & XFS_LID_DIRTY))
187 /* get number of vecs and size of data to be stored */
188 lip->li_ops->iop_size(lip, &niovecs, &nbytes);
190 /* Skip items that do not have any vectors for writing */
195 * Ordered items need to be tracked but we do not wish to write
196 * them. We need a logvec to track the object, but we do not
197 * need an iovec or buffer to be allocated for copying data.
199 if (niovecs == XFS_LOG_VEC_ORDERED) {
206 * We 64-bit align the length of each iovec so that the start
207 * of the next one is naturally aligned. We'll need to
208 * account for that slack space here. Then round nbytes up
209 * to 64-bit alignment so that the initial buffer alignment is
210 * easy to calculate and verify.
212 nbytes += niovecs * sizeof(uint64_t);
213 nbytes = round_up(nbytes, sizeof(uint64_t));
215 /* grab the old item if it exists for reservation accounting */
219 * The data buffer needs to start 64-bit aligned, so round up
220 * that space to ensure we can align it appropriately and not
221 * overrun the buffer.
224 round_up((sizeof(struct xfs_log_vec) +
225 niovecs * sizeof(struct xfs_log_iovec)),
228 /* compare to existing item size */
229 if (lip->li_lv && buf_size <= lip->li_lv->lv_size) {
230 /* same or smaller, optimise common overwrite case */
238 * set the item up as though it is a new insertion so
239 * that the space reservation accounting is correct.
241 *diff_iovecs -= lv->lv_niovecs;
242 *diff_len -= lv->lv_buf_len;
244 /* allocate new data chunk */
245 lv = kmem_zalloc(buf_size, KM_SLEEP|KM_NOFS);
247 lv->lv_size = buf_size;
249 /* track as an ordered logvec */
250 ASSERT(lip->li_lv == NULL);
251 lv->lv_buf_len = XFS_LOG_VEC_ORDERED;
254 lv->lv_iovecp = (struct xfs_log_iovec *)&lv[1];
257 /* Ensure the lv is set up according to ->iop_size */
258 lv->lv_niovecs = niovecs;
260 /* The allocated data region lies beyond the iovec region */
262 lv->lv_buf = (char *)lv + buf_size - nbytes;
263 ASSERT(IS_ALIGNED((unsigned long)lv->lv_buf, sizeof(uint64_t)));
265 lip->li_ops->iop_format(lip, lv);
267 ASSERT(lv->lv_buf_len <= nbytes);
268 xfs_cil_prepare_item(log, lv, old_lv, diff_len, diff_iovecs);
273 * Insert the log items into the CIL and calculate the difference in space
274 * consumed by the item. Add the space to the checkpoint ticket and calculate
275 * if the change requires additional log metadata. If it does, take that space
276 * as well. Remove the amount of space we added to the checkpoint ticket from
277 * the current transaction ticket so that the accounting works out correctly.
280 xlog_cil_insert_items(
282 struct xfs_trans *tp)
284 struct xfs_cil *cil = log->l_cilp;
285 struct xfs_cil_ctx *ctx = cil->xc_ctx;
286 struct xfs_log_item_desc *lidp;
294 * We can do this safely because the context can't checkpoint until we
295 * are done so it doesn't matter exactly how we update the CIL.
297 xlog_cil_insert_format_items(log, tp, &len, &diff_iovecs);
300 * Now (re-)position everything modified at the tail of the CIL.
301 * We do this here so we only need to take the CIL lock once during
302 * the transaction commit.
304 spin_lock(&cil->xc_cil_lock);
305 list_for_each_entry(lidp, &tp->t_items, lid_trans) {
306 struct xfs_log_item *lip = lidp->lid_item;
308 /* Skip items which aren't dirty in this transaction. */
309 if (!(lidp->lid_flags & XFS_LID_DIRTY))
312 list_move_tail(&lip->li_cil, &cil->xc_cil);
315 /* account for space used by new iovec headers */
316 len += diff_iovecs * sizeof(xlog_op_header_t);
317 ctx->nvecs += diff_iovecs;
319 /* attach the transaction to the CIL if it has any busy extents */
320 if (!list_empty(&tp->t_busy))
321 list_splice_init(&tp->t_busy, &ctx->busy_extents);
324 * Now transfer enough transaction reservation to the context ticket
325 * for the checkpoint. The context ticket is special - the unit
326 * reservation has to grow as well as the current reservation as we
327 * steal from tickets so we can correctly determine the space used
328 * during the transaction commit.
330 if (ctx->ticket->t_curr_res == 0) {
331 ctx->ticket->t_curr_res = ctx->ticket->t_unit_res;
332 tp->t_ticket->t_curr_res -= ctx->ticket->t_unit_res;
335 /* do we need space for more log record headers? */
336 iclog_space = log->l_iclog_size - log->l_iclog_hsize;
337 if (len > 0 && (ctx->space_used / iclog_space !=
338 (ctx->space_used + len) / iclog_space)) {
341 hdrs = (len + iclog_space - 1) / iclog_space;
342 /* need to take into account split region headers, too */
343 hdrs *= log->l_iclog_hsize + sizeof(struct xlog_op_header);
344 ctx->ticket->t_unit_res += hdrs;
345 ctx->ticket->t_curr_res += hdrs;
346 tp->t_ticket->t_curr_res -= hdrs;
347 ASSERT(tp->t_ticket->t_curr_res >= len);
349 tp->t_ticket->t_curr_res -= len;
350 ctx->space_used += len;
352 spin_unlock(&cil->xc_cil_lock);
356 xlog_cil_free_logvec(
357 struct xfs_log_vec *log_vector)
359 struct xfs_log_vec *lv;
361 for (lv = log_vector; lv; ) {
362 struct xfs_log_vec *next = lv->lv_next;
369 * Mark all items committed and clear busy extents. We free the log vector
370 * chains in a separate pass so that we unpin the log items as quickly as
378 struct xfs_cil_ctx *ctx = args;
379 struct xfs_mount *mp = ctx->cil->xc_log->l_mp;
381 xfs_trans_committed_bulk(ctx->cil->xc_log->l_ailp, ctx->lv_chain,
382 ctx->start_lsn, abort);
384 xfs_extent_busy_sort(&ctx->busy_extents);
385 xfs_extent_busy_clear(mp, &ctx->busy_extents,
386 (mp->m_flags & XFS_MOUNT_DISCARD) && !abort);
388 spin_lock(&ctx->cil->xc_push_lock);
389 list_del(&ctx->committing);
390 spin_unlock(&ctx->cil->xc_push_lock);
392 xlog_cil_free_logvec(ctx->lv_chain);
394 if (!list_empty(&ctx->busy_extents)) {
395 ASSERT(mp->m_flags & XFS_MOUNT_DISCARD);
397 xfs_discard_extents(mp, &ctx->busy_extents);
398 xfs_extent_busy_clear(mp, &ctx->busy_extents, false);
405 * Push the Committed Item List to the log. If @push_seq flag is zero, then it
406 * is a background flush and so we can chose to ignore it. Otherwise, if the
407 * current sequence is the same as @push_seq we need to do a flush. If
408 * @push_seq is less than the current sequence, then it has already been
409 * flushed and we don't need to do anything - the caller will wait for it to
410 * complete if necessary.
412 * @push_seq is a value rather than a flag because that allows us to do an
413 * unlocked check of the sequence number for a match. Hence we can allows log
414 * forces to run racily and not issue pushes for the same sequence twice. If we
415 * get a race between multiple pushes for the same sequence they will block on
416 * the first one and then abort, hence avoiding needless pushes.
422 struct xfs_cil *cil = log->l_cilp;
423 struct xfs_log_vec *lv;
424 struct xfs_cil_ctx *ctx;
425 struct xfs_cil_ctx *new_ctx;
426 struct xlog_in_core *commit_iclog;
427 struct xlog_ticket *tic;
430 struct xfs_trans_header thdr;
431 struct xfs_log_iovec lhdr;
432 struct xfs_log_vec lvhdr = { NULL };
433 xfs_lsn_t commit_lsn;
439 new_ctx = kmem_zalloc(sizeof(*new_ctx), KM_SLEEP|KM_NOFS);
440 new_ctx->ticket = xlog_cil_ticket_alloc(log);
442 down_write(&cil->xc_ctx_lock);
445 spin_lock(&cil->xc_push_lock);
446 push_seq = cil->xc_push_seq;
447 ASSERT(push_seq <= ctx->sequence);
450 * Check if we've anything to push. If there is nothing, then we don't
451 * move on to a new sequence number and so we have to be able to push
452 * this sequence again later.
454 if (list_empty(&cil->xc_cil)) {
455 cil->xc_push_seq = 0;
456 spin_unlock(&cil->xc_push_lock);
459 spin_unlock(&cil->xc_push_lock);
462 /* check for a previously pushed seqeunce */
463 if (push_seq < cil->xc_ctx->sequence)
467 * pull all the log vectors off the items in the CIL, and
468 * remove the items from the CIL. We don't need the CIL lock
469 * here because it's only needed on the transaction commit
470 * side which is currently locked out by the flush lock.
474 while (!list_empty(&cil->xc_cil)) {
475 struct xfs_log_item *item;
477 item = list_first_entry(&cil->xc_cil,
478 struct xfs_log_item, li_cil);
479 list_del_init(&item->li_cil);
481 ctx->lv_chain = item->li_lv;
483 lv->lv_next = item->li_lv;
486 num_iovecs += lv->lv_niovecs;
490 * initialise the new context and attach it to the CIL. Then attach
491 * the current context to the CIL committing lsit so it can be found
492 * during log forces to extract the commit lsn of the sequence that
493 * needs to be forced.
495 INIT_LIST_HEAD(&new_ctx->committing);
496 INIT_LIST_HEAD(&new_ctx->busy_extents);
497 new_ctx->sequence = ctx->sequence + 1;
499 cil->xc_ctx = new_ctx;
502 * mirror the new sequence into the cil structure so that we can do
503 * unlocked checks against the current sequence in log forces without
504 * risking deferencing a freed context pointer.
506 cil->xc_current_sequence = new_ctx->sequence;
509 * The switch is now done, so we can drop the context lock and move out
510 * of a shared context. We can't just go straight to the commit record,
511 * though - we need to synchronise with previous and future commits so
512 * that the commit records are correctly ordered in the log to ensure
513 * that we process items during log IO completion in the correct order.
515 * For example, if we get an EFI in one checkpoint and the EFD in the
516 * next (e.g. due to log forces), we do not want the checkpoint with
517 * the EFD to be committed before the checkpoint with the EFI. Hence
518 * we must strictly order the commit records of the checkpoints so
519 * that: a) the checkpoint callbacks are attached to the iclogs in the
520 * correct order; and b) the checkpoints are replayed in correct order
523 * Hence we need to add this context to the committing context list so
524 * that higher sequences will wait for us to write out a commit record
527 spin_lock(&cil->xc_push_lock);
528 list_add(&ctx->committing, &cil->xc_committing);
529 spin_unlock(&cil->xc_push_lock);
530 up_write(&cil->xc_ctx_lock);
533 * Build a checkpoint transaction header and write it to the log to
534 * begin the transaction. We need to account for the space used by the
535 * transaction header here as it is not accounted for in xlog_write().
537 * The LSN we need to pass to the log items on transaction commit is
538 * the LSN reported by the first log vector write. If we use the commit
539 * record lsn then we can move the tail beyond the grant write head.
542 thdr.th_magic = XFS_TRANS_HEADER_MAGIC;
543 thdr.th_type = XFS_TRANS_CHECKPOINT;
544 thdr.th_tid = tic->t_tid;
545 thdr.th_num_items = num_iovecs;
547 lhdr.i_len = sizeof(xfs_trans_header_t);
548 lhdr.i_type = XLOG_REG_TYPE_TRANSHDR;
549 tic->t_curr_res -= lhdr.i_len + sizeof(xlog_op_header_t);
551 lvhdr.lv_niovecs = 1;
552 lvhdr.lv_iovecp = &lhdr;
553 lvhdr.lv_next = ctx->lv_chain;
555 error = xlog_write(log, &lvhdr, tic, &ctx->start_lsn, NULL, 0);
557 goto out_abort_free_ticket;
560 * now that we've written the checkpoint into the log, strictly
561 * order the commit records so replay will get them in the right order.
564 spin_lock(&cil->xc_push_lock);
565 list_for_each_entry(new_ctx, &cil->xc_committing, committing) {
567 * Higher sequences will wait for this one so skip them.
568 * Don't wait for own own sequence, either.
570 if (new_ctx->sequence >= ctx->sequence)
572 if (!new_ctx->commit_lsn) {
574 * It is still being pushed! Wait for the push to
575 * complete, then start again from the beginning.
577 xlog_wait(&cil->xc_commit_wait, &cil->xc_push_lock);
581 spin_unlock(&cil->xc_push_lock);
583 /* xfs_log_done always frees the ticket on error. */
584 commit_lsn = xfs_log_done(log->l_mp, tic, &commit_iclog, 0);
585 if (commit_lsn == -1)
588 /* attach all the transactions w/ busy extents to iclog */
589 ctx->log_cb.cb_func = xlog_cil_committed;
590 ctx->log_cb.cb_arg = ctx;
591 error = xfs_log_notify(log->l_mp, commit_iclog, &ctx->log_cb);
596 * now the checkpoint commit is complete and we've attached the
597 * callbacks to the iclog we can assign the commit LSN to the context
598 * and wake up anyone who is waiting for the commit to complete.
600 spin_lock(&cil->xc_push_lock);
601 ctx->commit_lsn = commit_lsn;
602 wake_up_all(&cil->xc_commit_wait);
603 spin_unlock(&cil->xc_push_lock);
605 /* release the hounds! */
606 return xfs_log_release_iclog(log->l_mp, commit_iclog);
609 up_write(&cil->xc_ctx_lock);
610 xfs_log_ticket_put(new_ctx->ticket);
614 out_abort_free_ticket:
615 xfs_log_ticket_put(tic);
617 xlog_cil_committed(ctx, XFS_LI_ABORTED);
618 return XFS_ERROR(EIO);
623 struct work_struct *work)
625 struct xfs_cil *cil = container_of(work, struct xfs_cil,
627 xlog_cil_push(cil->xc_log);
631 * We need to push CIL every so often so we don't cache more than we can fit in
632 * the log. The limit really is that a checkpoint can't be more than half the
633 * log (the current checkpoint is not allowed to overwrite the previous
634 * checkpoint), but commit latency and memory usage limit this to a smaller
638 xlog_cil_push_background(
641 struct xfs_cil *cil = log->l_cilp;
644 * The cil won't be empty because we are called while holding the
645 * context lock so whatever we added to the CIL will still be there
647 ASSERT(!list_empty(&cil->xc_cil));
650 * don't do a background push if we haven't used up all the
651 * space available yet.
653 if (cil->xc_ctx->space_used < XLOG_CIL_SPACE_LIMIT(log))
656 spin_lock(&cil->xc_push_lock);
657 if (cil->xc_push_seq < cil->xc_current_sequence) {
658 cil->xc_push_seq = cil->xc_current_sequence;
659 queue_work(log->l_mp->m_cil_workqueue, &cil->xc_push_work);
661 spin_unlock(&cil->xc_push_lock);
666 xlog_cil_push_foreground(
670 struct xfs_cil *cil = log->l_cilp;
675 ASSERT(push_seq && push_seq <= cil->xc_current_sequence);
677 /* start on any pending background push to minimise wait time on it */
678 flush_work(&cil->xc_push_work);
681 * If the CIL is empty or we've already pushed the sequence then
682 * there's no work we need to do.
684 spin_lock(&cil->xc_push_lock);
685 if (list_empty(&cil->xc_cil) || push_seq <= cil->xc_push_seq) {
686 spin_unlock(&cil->xc_push_lock);
690 cil->xc_push_seq = push_seq;
691 spin_unlock(&cil->xc_push_lock);
693 /* do the push now */
701 struct xfs_cil *cil = log->l_cilp;
704 spin_lock(&cil->xc_push_lock);
705 if (list_empty(&cil->xc_cil))
707 spin_unlock(&cil->xc_push_lock);
712 * Commit a transaction with the given vector to the Committed Item List.
714 * To do this, we need to format the item, pin it in memory if required and
715 * account for the space used by the transaction. Once we have done that we
716 * need to release the unused reservation for the transaction, attach the
717 * transaction to the checkpoint context so we carry the busy extents through
718 * to checkpoint completion, and then unlock all the items in the transaction.
720 * Called with the context lock already held in read mode to lock out
721 * background commit, returns without it held once background commits are
726 struct xfs_mount *mp,
727 struct xfs_trans *tp,
728 xfs_lsn_t *commit_lsn,
731 struct xlog *log = mp->m_log;
732 struct xfs_cil *cil = log->l_cilp;
735 if (flags & XFS_TRANS_RELEASE_LOG_RES)
736 log_flags = XFS_LOG_REL_PERM_RESERV;
738 /* lock out background commit */
739 down_read(&cil->xc_ctx_lock);
741 xlog_cil_insert_items(log, tp);
743 /* check we didn't blow the reservation */
744 if (tp->t_ticket->t_curr_res < 0)
745 xlog_print_tic_res(mp, tp->t_ticket);
747 tp->t_commit_lsn = cil->xc_ctx->sequence;
749 *commit_lsn = tp->t_commit_lsn;
751 xfs_log_done(mp, tp->t_ticket, NULL, log_flags);
752 xfs_trans_unreserve_and_mod_sb(tp);
755 * Once all the items of the transaction have been copied to the CIL,
756 * the items can be unlocked and freed.
758 * This needs to be done before we drop the CIL context lock because we
759 * have to update state in the log items and unlock them before they go
760 * to disk. If we don't, then the CIL checkpoint can race with us and
761 * we can run checkpoint completion before we've updated and unlocked
762 * the log items. This affects (at least) processing of stale buffers,
765 xfs_trans_free_items(tp, tp->t_commit_lsn, 0);
767 xlog_cil_push_background(log);
769 up_read(&cil->xc_ctx_lock);
774 * Conditionally push the CIL based on the sequence passed in.
776 * We only need to push if we haven't already pushed the sequence
777 * number given. Hence the only time we will trigger a push here is
778 * if the push sequence is the same as the current context.
780 * We return the current commit lsn to allow the callers to determine if a
781 * iclog flush is necessary following this call.
788 struct xfs_cil *cil = log->l_cilp;
789 struct xfs_cil_ctx *ctx;
790 xfs_lsn_t commit_lsn = NULLCOMMITLSN;
792 ASSERT(sequence <= cil->xc_current_sequence);
795 * check to see if we need to force out the current context.
796 * xlog_cil_push() handles racing pushes for the same sequence,
797 * so no need to deal with it here.
799 xlog_cil_push_foreground(log, sequence);
802 * See if we can find a previous sequence still committing.
803 * We need to wait for all previous sequence commits to complete
804 * before allowing the force of push_seq to go ahead. Hence block
805 * on commits for those as well.
808 spin_lock(&cil->xc_push_lock);
809 list_for_each_entry(ctx, &cil->xc_committing, committing) {
810 if (ctx->sequence > sequence)
812 if (!ctx->commit_lsn) {
814 * It is still being pushed! Wait for the push to
815 * complete, then start again from the beginning.
817 xlog_wait(&cil->xc_commit_wait, &cil->xc_push_lock);
820 if (ctx->sequence != sequence)
823 commit_lsn = ctx->commit_lsn;
825 spin_unlock(&cil->xc_push_lock);
830 * Check if the current log item was first committed in this sequence.
831 * We can't rely on just the log item being in the CIL, we have to check
832 * the recorded commit sequence number.
834 * Note: for this to be used in a non-racy manner, it has to be called with
835 * CIL flushing locked out. As a result, it should only be used during the
836 * transaction commit process when deciding what to format into the item.
839 xfs_log_item_in_current_chkpt(
840 struct xfs_log_item *lip)
842 struct xfs_cil_ctx *ctx;
844 if (list_empty(&lip->li_cil))
847 ctx = lip->li_mountp->m_log->l_cilp->xc_ctx;
850 * li_seq is written on the first commit of a log item to record the
851 * first checkpoint it is written to. Hence if it is different to the
852 * current sequence, we're in a new checkpoint.
854 if (XFS_LSN_CMP(lip->li_seq, ctx->sequence) != 0)
860 * Perform initial CIL structure initialisation.
867 struct xfs_cil_ctx *ctx;
869 cil = kmem_zalloc(sizeof(*cil), KM_SLEEP|KM_MAYFAIL);
873 ctx = kmem_zalloc(sizeof(*ctx), KM_SLEEP|KM_MAYFAIL);
879 INIT_WORK(&cil->xc_push_work, xlog_cil_push_work);
880 INIT_LIST_HEAD(&cil->xc_cil);
881 INIT_LIST_HEAD(&cil->xc_committing);
882 spin_lock_init(&cil->xc_cil_lock);
883 spin_lock_init(&cil->xc_push_lock);
884 init_rwsem(&cil->xc_ctx_lock);
885 init_waitqueue_head(&cil->xc_commit_wait);
887 INIT_LIST_HEAD(&ctx->committing);
888 INIT_LIST_HEAD(&ctx->busy_extents);
892 cil->xc_current_sequence = ctx->sequence;
903 if (log->l_cilp->xc_ctx) {
904 if (log->l_cilp->xc_ctx->ticket)
905 xfs_log_ticket_put(log->l_cilp->xc_ctx->ticket);
906 kmem_free(log->l_cilp->xc_ctx);
909 ASSERT(list_empty(&log->l_cilp->xc_cil));
910 kmem_free(log->l_cilp);