2 * Copyright (c) 2000-2005 Silicon Graphics, Inc.
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation.
9 * This program is distributed in the hope that it would be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
20 #include "xfs_types.h"
24 #include "xfs_trans.h"
27 #include "xfs_mount.h"
28 #include "xfs_error.h"
29 #include "xfs_log_priv.h"
30 #include "xfs_buf_item.h"
31 #include "xfs_bmap_btree.h"
32 #include "xfs_alloc_btree.h"
33 #include "xfs_ialloc_btree.h"
34 #include "xfs_log_recover.h"
35 #include "xfs_trans_priv.h"
36 #include "xfs_dinode.h"
37 #include "xfs_inode.h"
39 #include "xfs_trace.h"
41 kmem_zone_t
*xfs_log_ticket_zone
;
43 /* Local miscellaneous function prototypes */
44 STATIC
int xlog_commit_record(struct log
*log
, struct xlog_ticket
*ticket
,
45 xlog_in_core_t
**, xfs_lsn_t
*);
46 STATIC xlog_t
* xlog_alloc_log(xfs_mount_t
*mp
,
47 xfs_buftarg_t
*log_target
,
48 xfs_daddr_t blk_offset
,
50 STATIC
int xlog_space_left(struct log
*log
, atomic64_t
*head
);
51 STATIC
int xlog_sync(xlog_t
*log
, xlog_in_core_t
*iclog
);
52 STATIC
void xlog_dealloc_log(xlog_t
*log
);
54 /* local state machine functions */
55 STATIC
void xlog_state_done_syncing(xlog_in_core_t
*iclog
, int);
56 STATIC
void xlog_state_do_callback(xlog_t
*log
,int aborted
, xlog_in_core_t
*iclog
);
57 STATIC
int xlog_state_get_iclog_space(xlog_t
*log
,
59 xlog_in_core_t
**iclog
,
60 xlog_ticket_t
*ticket
,
63 STATIC
int xlog_state_release_iclog(xlog_t
*log
,
64 xlog_in_core_t
*iclog
);
65 STATIC
void xlog_state_switch_iclogs(xlog_t
*log
,
66 xlog_in_core_t
*iclog
,
68 STATIC
void xlog_state_want_sync(xlog_t
*log
, xlog_in_core_t
*iclog
);
70 /* local functions to manipulate grant head */
71 STATIC
int xlog_grant_log_space(xlog_t
*log
,
73 STATIC
void xlog_grant_push_ail(struct log
*log
,
75 STATIC
void xlog_regrant_reserve_log_space(xlog_t
*log
,
76 xlog_ticket_t
*ticket
);
77 STATIC
int xlog_regrant_write_log_space(xlog_t
*log
,
78 xlog_ticket_t
*ticket
);
79 STATIC
void xlog_ungrant_log_space(xlog_t
*log
,
80 xlog_ticket_t
*ticket
);
83 STATIC
void xlog_verify_dest_ptr(xlog_t
*log
, char *ptr
);
84 STATIC
void xlog_verify_grant_tail(struct log
*log
);
85 STATIC
void xlog_verify_iclog(xlog_t
*log
, xlog_in_core_t
*iclog
,
86 int count
, boolean_t syncing
);
87 STATIC
void xlog_verify_tail_lsn(xlog_t
*log
, xlog_in_core_t
*iclog
,
90 #define xlog_verify_dest_ptr(a,b)
91 #define xlog_verify_grant_tail(a)
92 #define xlog_verify_iclog(a,b,c,d)
93 #define xlog_verify_tail_lsn(a,b,c)
96 STATIC
int xlog_iclogs_empty(xlog_t
*log
);
104 int64_t head_val
= atomic64_read(head
);
110 xlog_crack_grant_head_val(head_val
, &cycle
, &space
);
114 space
+= log
->l_logsize
;
119 new = xlog_assign_grant_head_val(cycle
, space
);
120 head_val
= atomic64_cmpxchg(head
, old
, new);
121 } while (head_val
!= old
);
125 xlog_grant_add_space(
130 int64_t head_val
= atomic64_read(head
);
137 xlog_crack_grant_head_val(head_val
, &cycle
, &space
);
139 tmp
= log
->l_logsize
- space
;
148 new = xlog_assign_grant_head_val(cycle
, space
);
149 head_val
= atomic64_cmpxchg(head
, old
, new);
150 } while (head_val
!= old
);
154 xlog_tic_reset_res(xlog_ticket_t
*tic
)
157 tic
->t_res_arr_sum
= 0;
158 tic
->t_res_num_ophdrs
= 0;
162 xlog_tic_add_region(xlog_ticket_t
*tic
, uint len
, uint type
)
164 if (tic
->t_res_num
== XLOG_TIC_LEN_MAX
) {
165 /* add to overflow and start again */
166 tic
->t_res_o_flow
+= tic
->t_res_arr_sum
;
168 tic
->t_res_arr_sum
= 0;
171 tic
->t_res_arr
[tic
->t_res_num
].r_len
= len
;
172 tic
->t_res_arr
[tic
->t_res_num
].r_type
= type
;
173 tic
->t_res_arr_sum
+= len
;
180 * 1. currblock field gets updated at startup and after in-core logs
181 * marked as with WANT_SYNC.
185 * This routine is called when a user of a log manager ticket is done with
186 * the reservation. If the ticket was ever used, then a commit record for
187 * the associated transaction is written out as a log operation header with
188 * no data. The flag XLOG_TIC_INITED is set when the first write occurs with
189 * a given ticket. If the ticket was one with a permanent reservation, then
190 * a few operations are done differently. Permanent reservation tickets by
191 * default don't release the reservation. They just commit the current
192 * transaction with the belief that the reservation is still needed. A flag
193 * must be passed in before permanent reservations are actually released.
194 * When these type of tickets are not released, they need to be set into
195 * the inited state again. By doing this, a start record will be written
196 * out when the next write occurs.
200 struct xfs_mount
*mp
,
201 struct xlog_ticket
*ticket
,
202 struct xlog_in_core
**iclog
,
205 struct log
*log
= mp
->m_log
;
208 if (XLOG_FORCED_SHUTDOWN(log
) ||
210 * If nothing was ever written, don't write out commit record.
211 * If we get an error, just continue and give back the log ticket.
213 (((ticket
->t_flags
& XLOG_TIC_INITED
) == 0) &&
214 (xlog_commit_record(log
, ticket
, iclog
, &lsn
)))) {
215 lsn
= (xfs_lsn_t
) -1;
216 if (ticket
->t_flags
& XLOG_TIC_PERM_RESERV
) {
217 flags
|= XFS_LOG_REL_PERM_RESERV
;
222 if ((ticket
->t_flags
& XLOG_TIC_PERM_RESERV
) == 0 ||
223 (flags
& XFS_LOG_REL_PERM_RESERV
)) {
224 trace_xfs_log_done_nonperm(log
, ticket
);
227 * Release ticket if not permanent reservation or a specific
228 * request has been made to release a permanent reservation.
230 xlog_ungrant_log_space(log
, ticket
);
231 xfs_log_ticket_put(ticket
);
233 trace_xfs_log_done_perm(log
, ticket
);
235 xlog_regrant_reserve_log_space(log
, ticket
);
236 /* If this ticket was a permanent reservation and we aren't
237 * trying to release it, reset the inited flags; so next time
238 * we write, a start record will be written out.
240 ticket
->t_flags
|= XLOG_TIC_INITED
;
247 * Attaches a new iclog I/O completion callback routine during
248 * transaction commit. If the log is in error state, a non-zero
249 * return code is handed back and the caller is responsible for
250 * executing the callback at an appropriate time.
254 struct xfs_mount
*mp
,
255 struct xlog_in_core
*iclog
,
256 xfs_log_callback_t
*cb
)
260 spin_lock(&iclog
->ic_callback_lock
);
261 abortflg
= (iclog
->ic_state
& XLOG_STATE_IOERROR
);
263 ASSERT_ALWAYS((iclog
->ic_state
== XLOG_STATE_ACTIVE
) ||
264 (iclog
->ic_state
== XLOG_STATE_WANT_SYNC
));
266 *(iclog
->ic_callback_tail
) = cb
;
267 iclog
->ic_callback_tail
= &(cb
->cb_next
);
269 spin_unlock(&iclog
->ic_callback_lock
);
274 xfs_log_release_iclog(
275 struct xfs_mount
*mp
,
276 struct xlog_in_core
*iclog
)
278 if (xlog_state_release_iclog(mp
->m_log
, iclog
)) {
279 xfs_force_shutdown(mp
, SHUTDOWN_LOG_IO_ERROR
);
287 * 1. Reserve an amount of on-disk log space and return a ticket corresponding
288 * to the reservation.
289 * 2. Potentially, push buffers at tail of log to disk.
291 * Each reservation is going to reserve extra space for a log record header.
292 * When writes happen to the on-disk log, we don't subtract the length of the
293 * log record header from any reservation. By wasting space in each
294 * reservation, we prevent over allocation problems.
298 struct xfs_mount
*mp
,
301 struct xlog_ticket
**ticket
,
306 struct log
*log
= mp
->m_log
;
307 struct xlog_ticket
*internal_ticket
;
310 ASSERT(client
== XFS_TRANSACTION
|| client
== XFS_LOG
);
312 if (XLOG_FORCED_SHUTDOWN(log
))
313 return XFS_ERROR(EIO
);
315 XFS_STATS_INC(xs_try_logspace
);
318 if (*ticket
!= NULL
) {
319 ASSERT(flags
& XFS_LOG_PERM_RESERV
);
320 internal_ticket
= *ticket
;
323 * this is a new transaction on the ticket, so we need to
324 * change the transaction ID so that the next transaction has a
325 * different TID in the log. Just add one to the existing tid
326 * so that we can see chains of rolling transactions in the log
329 internal_ticket
->t_tid
++;
331 trace_xfs_log_reserve(log
, internal_ticket
);
333 xlog_grant_push_ail(log
, internal_ticket
->t_unit_res
);
334 retval
= xlog_regrant_write_log_space(log
, internal_ticket
);
336 /* may sleep if need to allocate more tickets */
337 internal_ticket
= xlog_ticket_alloc(log
, unit_bytes
, cnt
,
339 KM_SLEEP
|KM_MAYFAIL
);
340 if (!internal_ticket
)
341 return XFS_ERROR(ENOMEM
);
342 internal_ticket
->t_trans_type
= t_type
;
343 *ticket
= internal_ticket
;
345 trace_xfs_log_reserve(log
, internal_ticket
);
347 xlog_grant_push_ail(log
,
348 (internal_ticket
->t_unit_res
*
349 internal_ticket
->t_cnt
));
350 retval
= xlog_grant_log_space(log
, internal_ticket
);
354 } /* xfs_log_reserve */
358 * Mount a log filesystem
360 * mp - ubiquitous xfs mount point structure
361 * log_target - buftarg of on-disk log device
362 * blk_offset - Start block # where block size is 512 bytes (BBSIZE)
363 * num_bblocks - Number of BBSIZE blocks in on-disk log
365 * Return error or zero.
370 xfs_buftarg_t
*log_target
,
371 xfs_daddr_t blk_offset
,
376 if (!(mp
->m_flags
& XFS_MOUNT_NORECOVERY
))
377 xfs_notice(mp
, "Mounting Filesystem");
380 "Mounting filesystem in no-recovery mode. Filesystem will be inconsistent.");
381 ASSERT(mp
->m_flags
& XFS_MOUNT_RDONLY
);
384 mp
->m_log
= xlog_alloc_log(mp
, log_target
, blk_offset
, num_bblks
);
385 if (IS_ERR(mp
->m_log
)) {
386 error
= -PTR_ERR(mp
->m_log
);
391 * Initialize the AIL now we have a log.
393 error
= xfs_trans_ail_init(mp
);
395 xfs_warn(mp
, "AIL initialisation failed: error %d", error
);
398 mp
->m_log
->l_ailp
= mp
->m_ail
;
401 * skip log recovery on a norecovery mount. pretend it all
404 if (!(mp
->m_flags
& XFS_MOUNT_NORECOVERY
)) {
405 int readonly
= (mp
->m_flags
& XFS_MOUNT_RDONLY
);
408 mp
->m_flags
&= ~XFS_MOUNT_RDONLY
;
410 error
= xlog_recover(mp
->m_log
);
413 mp
->m_flags
|= XFS_MOUNT_RDONLY
;
415 xfs_warn(mp
, "log mount/recovery failed: error %d",
417 goto out_destroy_ail
;
421 /* Normal transactions can now occur */
422 mp
->m_log
->l_flags
&= ~XLOG_ACTIVE_RECOVERY
;
425 * Now the log has been fully initialised and we know were our
426 * space grant counters are, we can initialise the permanent ticket
427 * needed for delayed logging to work.
429 xlog_cil_init_post_recovery(mp
->m_log
);
434 xfs_trans_ail_destroy(mp
);
436 xlog_dealloc_log(mp
->m_log
);
442 * Finish the recovery of the file system. This is separate from
443 * the xfs_log_mount() call, because it depends on the code in
444 * xfs_mountfs() to read in the root and real-time bitmap inodes
445 * between calling xfs_log_mount() and here.
447 * mp - ubiquitous xfs mount point structure
450 xfs_log_mount_finish(xfs_mount_t
*mp
)
454 if (!(mp
->m_flags
& XFS_MOUNT_NORECOVERY
))
455 error
= xlog_recover_finish(mp
->m_log
);
458 ASSERT(mp
->m_flags
& XFS_MOUNT_RDONLY
);
465 * Final log writes as part of unmount.
467 * Mark the filesystem clean as unmount happens. Note that during relocation
468 * this routine needs to be executed as part of source-bag while the
469 * deallocation must not be done until source-end.
473 * Unmount record used to have a string "Unmount filesystem--" in the
474 * data section where the "Un" was really a magic number (XLOG_UNMOUNT_TYPE).
475 * We just write the magic number now since that particular field isn't
476 * currently architecture converted and "nUmount" is a bit foo.
477 * As far as I know, there weren't any dependencies on the old behaviour.
481 xfs_log_unmount_write(xfs_mount_t
*mp
)
483 xlog_t
*log
= mp
->m_log
;
484 xlog_in_core_t
*iclog
;
486 xlog_in_core_t
*first_iclog
;
488 xlog_ticket_t
*tic
= NULL
;
493 * Don't write out unmount record on read-only mounts.
494 * Or, if we are doing a forced umount (typically because of IO errors).
496 if (mp
->m_flags
& XFS_MOUNT_RDONLY
)
499 error
= _xfs_log_force(mp
, XFS_LOG_SYNC
, NULL
);
500 ASSERT(error
|| !(XLOG_FORCED_SHUTDOWN(log
)));
503 first_iclog
= iclog
= log
->l_iclog
;
505 if (!(iclog
->ic_state
& XLOG_STATE_IOERROR
)) {
506 ASSERT(iclog
->ic_state
& XLOG_STATE_ACTIVE
);
507 ASSERT(iclog
->ic_offset
== 0);
509 iclog
= iclog
->ic_next
;
510 } while (iclog
!= first_iclog
);
512 if (! (XLOG_FORCED_SHUTDOWN(log
))) {
513 error
= xfs_log_reserve(mp
, 600, 1, &tic
,
514 XFS_LOG
, 0, XLOG_UNMOUNT_REC_TYPE
);
516 /* the data section must be 32 bit size aligned */
520 __uint32_t pad2
; /* may as well make it 64 bits */
522 .magic
= XLOG_UNMOUNT_TYPE
,
524 struct xfs_log_iovec reg
= {
526 .i_len
= sizeof(magic
),
527 .i_type
= XLOG_REG_TYPE_UNMOUNT
,
529 struct xfs_log_vec vec
= {
534 /* remove inited flag */
536 error
= xlog_write(log
, &vec
, tic
, &lsn
,
537 NULL
, XLOG_UNMOUNT_TRANS
);
539 * At this point, we're umounting anyway,
540 * so there's no point in transitioning log state
541 * to IOERROR. Just continue...
546 xfs_alert(mp
, "%s: unmount record failed", __func__
);
549 spin_lock(&log
->l_icloglock
);
550 iclog
= log
->l_iclog
;
551 atomic_inc(&iclog
->ic_refcnt
);
552 xlog_state_want_sync(log
, iclog
);
553 spin_unlock(&log
->l_icloglock
);
554 error
= xlog_state_release_iclog(log
, iclog
);
556 spin_lock(&log
->l_icloglock
);
557 if (!(iclog
->ic_state
== XLOG_STATE_ACTIVE
||
558 iclog
->ic_state
== XLOG_STATE_DIRTY
)) {
559 if (!XLOG_FORCED_SHUTDOWN(log
)) {
560 xlog_wait(&iclog
->ic_force_wait
,
563 spin_unlock(&log
->l_icloglock
);
566 spin_unlock(&log
->l_icloglock
);
569 trace_xfs_log_umount_write(log
, tic
);
570 xlog_ungrant_log_space(log
, tic
);
571 xfs_log_ticket_put(tic
);
575 * We're already in forced_shutdown mode, couldn't
576 * even attempt to write out the unmount transaction.
578 * Go through the motions of sync'ing and releasing
579 * the iclog, even though no I/O will actually happen,
580 * we need to wait for other log I/Os that may already
581 * be in progress. Do this as a separate section of
582 * code so we'll know if we ever get stuck here that
583 * we're in this odd situation of trying to unmount
584 * a file system that went into forced_shutdown as
585 * the result of an unmount..
587 spin_lock(&log
->l_icloglock
);
588 iclog
= log
->l_iclog
;
589 atomic_inc(&iclog
->ic_refcnt
);
591 xlog_state_want_sync(log
, iclog
);
592 spin_unlock(&log
->l_icloglock
);
593 error
= xlog_state_release_iclog(log
, iclog
);
595 spin_lock(&log
->l_icloglock
);
597 if ( ! ( iclog
->ic_state
== XLOG_STATE_ACTIVE
598 || iclog
->ic_state
== XLOG_STATE_DIRTY
599 || iclog
->ic_state
== XLOG_STATE_IOERROR
) ) {
601 xlog_wait(&iclog
->ic_force_wait
,
604 spin_unlock(&log
->l_icloglock
);
609 } /* xfs_log_unmount_write */
612 * Deallocate log structures for unmount/relocation.
614 * We need to stop the aild from running before we destroy
615 * and deallocate the log as the aild references the log.
618 xfs_log_unmount(xfs_mount_t
*mp
)
620 xfs_trans_ail_destroy(mp
);
621 xlog_dealloc_log(mp
->m_log
);
626 struct xfs_mount
*mp
,
627 struct xfs_log_item
*item
,
629 struct xfs_item_ops
*ops
)
631 item
->li_mountp
= mp
;
632 item
->li_ailp
= mp
->m_ail
;
633 item
->li_type
= type
;
637 INIT_LIST_HEAD(&item
->li_ail
);
638 INIT_LIST_HEAD(&item
->li_cil
);
642 * Write region vectors to log. The write happens using the space reservation
643 * of the ticket (tic). It is not a requirement that all writes for a given
644 * transaction occur with one call to xfs_log_write(). However, it is important
645 * to note that the transaction reservation code makes an assumption about the
646 * number of log headers a transaction requires that may be violated if you
647 * don't pass all the transaction vectors in one call....
651 struct xfs_mount
*mp
,
652 struct xfs_log_iovec reg
[],
654 struct xlog_ticket
*tic
,
655 xfs_lsn_t
*start_lsn
)
657 struct log
*log
= mp
->m_log
;
659 struct xfs_log_vec vec
= {
660 .lv_niovecs
= nentries
,
664 if (XLOG_FORCED_SHUTDOWN(log
))
665 return XFS_ERROR(EIO
);
667 error
= xlog_write(log
, &vec
, tic
, start_lsn
, NULL
, 0);
669 xfs_force_shutdown(mp
, SHUTDOWN_LOG_IO_ERROR
);
674 xfs_log_move_tail(xfs_mount_t
*mp
,
678 xlog_t
*log
= mp
->m_log
;
679 int need_bytes
, free_bytes
;
681 if (XLOG_FORCED_SHUTDOWN(log
))
685 tail_lsn
= atomic64_read(&log
->l_last_sync_lsn
);
687 /* tail_lsn == 1 implies that we weren't passed a valid value. */
689 atomic64_set(&log
->l_tail_lsn
, tail_lsn
);
691 if (!list_empty_careful(&log
->l_writeq
)) {
693 if (log
->l_flags
& XLOG_ACTIVE_RECOVERY
)
694 panic("Recovery problem");
696 spin_lock(&log
->l_grant_write_lock
);
697 free_bytes
= xlog_space_left(log
, &log
->l_grant_write_head
);
698 list_for_each_entry(tic
, &log
->l_writeq
, t_queue
) {
699 ASSERT(tic
->t_flags
& XLOG_TIC_PERM_RESERV
);
701 if (free_bytes
< tic
->t_unit_res
&& tail_lsn
!= 1)
704 free_bytes
-= tic
->t_unit_res
;
705 trace_xfs_log_regrant_write_wake_up(log
, tic
);
706 wake_up(&tic
->t_wait
);
708 spin_unlock(&log
->l_grant_write_lock
);
711 if (!list_empty_careful(&log
->l_reserveq
)) {
713 if (log
->l_flags
& XLOG_ACTIVE_RECOVERY
)
714 panic("Recovery problem");
716 spin_lock(&log
->l_grant_reserve_lock
);
717 free_bytes
= xlog_space_left(log
, &log
->l_grant_reserve_head
);
718 list_for_each_entry(tic
, &log
->l_reserveq
, t_queue
) {
719 if (tic
->t_flags
& XLOG_TIC_PERM_RESERV
)
720 need_bytes
= tic
->t_unit_res
*tic
->t_cnt
;
722 need_bytes
= tic
->t_unit_res
;
723 if (free_bytes
< need_bytes
&& tail_lsn
!= 1)
726 free_bytes
-= need_bytes
;
727 trace_xfs_log_grant_wake_up(log
, tic
);
728 wake_up(&tic
->t_wait
);
730 spin_unlock(&log
->l_grant_reserve_lock
);
735 * Determine if we have a transaction that has gone to disk
736 * that needs to be covered. To begin the transition to the idle state
737 * firstly the log needs to be idle (no AIL and nothing in the iclogs).
738 * If we are then in a state where covering is needed, the caller is informed
739 * that dummy transactions are required to move the log into the idle state.
741 * Because this is called as part of the sync process, we should also indicate
742 * that dummy transactions should be issued in anything but the covered or
743 * idle states. This ensures that the log tail is accurately reflected in
744 * the log at the end of the sync, hence if a crash occurrs avoids replay
745 * of transactions where the metadata is already on disk.
748 xfs_log_need_covered(xfs_mount_t
*mp
)
751 xlog_t
*log
= mp
->m_log
;
753 if (!xfs_fs_writable(mp
))
756 spin_lock(&log
->l_icloglock
);
757 switch (log
->l_covered_state
) {
758 case XLOG_STATE_COVER_DONE
:
759 case XLOG_STATE_COVER_DONE2
:
760 case XLOG_STATE_COVER_IDLE
:
762 case XLOG_STATE_COVER_NEED
:
763 case XLOG_STATE_COVER_NEED2
:
764 if (!xfs_ail_min_lsn(log
->l_ailp
) &&
765 xlog_iclogs_empty(log
)) {
766 if (log
->l_covered_state
== XLOG_STATE_COVER_NEED
)
767 log
->l_covered_state
= XLOG_STATE_COVER_DONE
;
769 log
->l_covered_state
= XLOG_STATE_COVER_DONE2
;
776 spin_unlock(&log
->l_icloglock
);
780 /******************************************************************************
784 ******************************************************************************
787 /* xfs_trans_tail_ail returns 0 when there is nothing in the list.
788 * The log manager must keep track of the last LR which was committed
789 * to disk. The lsn of this LR will become the new tail_lsn whenever
790 * xfs_trans_tail_ail returns 0. If we don't do this, we run into
791 * the situation where stuff could be written into the log but nothing
792 * was ever in the AIL when asked. Eventually, we panic since the
793 * tail hits the head.
795 * We may be holding the log iclog lock upon entering this routine.
798 xlog_assign_tail_lsn(
799 struct xfs_mount
*mp
)
802 struct log
*log
= mp
->m_log
;
804 tail_lsn
= xfs_ail_min_lsn(mp
->m_ail
);
806 tail_lsn
= atomic64_read(&log
->l_last_sync_lsn
);
808 atomic64_set(&log
->l_tail_lsn
, tail_lsn
);
813 * Return the space in the log between the tail and the head. The head
814 * is passed in the cycle/bytes formal parms. In the special case where
815 * the reserve head has wrapped passed the tail, this calculation is no
816 * longer valid. In this case, just return 0 which means there is no space
817 * in the log. This works for all places where this function is called
818 * with the reserve head. Of course, if the write head were to ever
819 * wrap the tail, we should blow up. Rather than catch this case here,
820 * we depend on other ASSERTions in other parts of the code. XXXmiken
822 * This code also handles the case where the reservation head is behind
823 * the tail. The details of this case are described below, but the end
824 * result is that we return the size of the log as the amount of space left.
837 xlog_crack_grant_head(head
, &head_cycle
, &head_bytes
);
838 xlog_crack_atomic_lsn(&log
->l_tail_lsn
, &tail_cycle
, &tail_bytes
);
839 tail_bytes
= BBTOB(tail_bytes
);
840 if (tail_cycle
== head_cycle
&& head_bytes
>= tail_bytes
)
841 free_bytes
= log
->l_logsize
- (head_bytes
- tail_bytes
);
842 else if (tail_cycle
+ 1 < head_cycle
)
844 else if (tail_cycle
< head_cycle
) {
845 ASSERT(tail_cycle
== (head_cycle
- 1));
846 free_bytes
= tail_bytes
- head_bytes
;
849 * The reservation head is behind the tail.
850 * In this case we just want to return the size of the
851 * log as the amount of space left.
854 "xlog_space_left: head behind tail\n"
855 " tail_cycle = %d, tail_bytes = %d\n"
856 " GH cycle = %d, GH bytes = %d",
857 tail_cycle
, tail_bytes
, head_cycle
, head_bytes
);
859 free_bytes
= log
->l_logsize
;
866 * Log function which is called when an io completes.
868 * The log manager needs its own routine, in order to control what
869 * happens with the buffer after the write completes.
872 xlog_iodone(xfs_buf_t
*bp
)
874 xlog_in_core_t
*iclog
;
878 iclog
= XFS_BUF_FSPRIVATE(bp
, xlog_in_core_t
*);
879 ASSERT(XFS_BUF_FSPRIVATE2(bp
, unsigned long) == (unsigned long) 2);
880 XFS_BUF_SET_FSPRIVATE2(bp
, (unsigned long)1);
885 * Race to shutdown the filesystem if we see an error.
887 if (XFS_TEST_ERROR((XFS_BUF_GETERROR(bp
)), l
->l_mp
,
888 XFS_ERRTAG_IODONE_IOERR
, XFS_RANDOM_IODONE_IOERR
)) {
889 xfs_ioerror_alert("xlog_iodone", l
->l_mp
, bp
, XFS_BUF_ADDR(bp
));
891 xfs_force_shutdown(l
->l_mp
, SHUTDOWN_LOG_IO_ERROR
);
893 * This flag will be propagated to the trans-committed
894 * callback routines to let them know that the log-commit
897 aborted
= XFS_LI_ABORTED
;
898 } else if (iclog
->ic_state
& XLOG_STATE_IOERROR
) {
899 aborted
= XFS_LI_ABORTED
;
902 /* log I/O is always issued ASYNC */
903 ASSERT(XFS_BUF_ISASYNC(bp
));
904 xlog_state_done_syncing(iclog
, aborted
);
906 * do not reference the buffer (bp) here as we could race
907 * with it being freed after writing the unmount record to the
914 * Return size of each in-core log record buffer.
916 * All machines get 8 x 32kB buffers by default, unless tuned otherwise.
918 * If the filesystem blocksize is too large, we may need to choose a
919 * larger size since the directory code currently logs entire blocks.
923 xlog_get_iclog_buffer_size(xfs_mount_t
*mp
,
929 if (mp
->m_logbufs
<= 0)
930 log
->l_iclog_bufs
= XLOG_MAX_ICLOGS
;
932 log
->l_iclog_bufs
= mp
->m_logbufs
;
935 * Buffer size passed in from mount system call.
937 if (mp
->m_logbsize
> 0) {
938 size
= log
->l_iclog_size
= mp
->m_logbsize
;
939 log
->l_iclog_size_log
= 0;
941 log
->l_iclog_size_log
++;
945 if (xfs_sb_version_haslogv2(&mp
->m_sb
)) {
946 /* # headers = size / 32k
947 * one header holds cycles from 32k of data
950 xhdrs
= mp
->m_logbsize
/ XLOG_HEADER_CYCLE_SIZE
;
951 if (mp
->m_logbsize
% XLOG_HEADER_CYCLE_SIZE
)
953 log
->l_iclog_hsize
= xhdrs
<< BBSHIFT
;
954 log
->l_iclog_heads
= xhdrs
;
956 ASSERT(mp
->m_logbsize
<= XLOG_BIG_RECORD_BSIZE
);
957 log
->l_iclog_hsize
= BBSIZE
;
958 log
->l_iclog_heads
= 1;
963 /* All machines use 32kB buffers by default. */
964 log
->l_iclog_size
= XLOG_BIG_RECORD_BSIZE
;
965 log
->l_iclog_size_log
= XLOG_BIG_RECORD_BSHIFT
;
967 /* the default log size is 16k or 32k which is one header sector */
968 log
->l_iclog_hsize
= BBSIZE
;
969 log
->l_iclog_heads
= 1;
972 /* are we being asked to make the sizes selected above visible? */
973 if (mp
->m_logbufs
== 0)
974 mp
->m_logbufs
= log
->l_iclog_bufs
;
975 if (mp
->m_logbsize
== 0)
976 mp
->m_logbsize
= log
->l_iclog_size
;
977 } /* xlog_get_iclog_buffer_size */
981 * This routine initializes some of the log structure for a given mount point.
982 * Its primary purpose is to fill in enough, so recovery can occur. However,
983 * some other stuff may be filled in too.
986 xlog_alloc_log(xfs_mount_t
*mp
,
987 xfs_buftarg_t
*log_target
,
988 xfs_daddr_t blk_offset
,
992 xlog_rec_header_t
*head
;
993 xlog_in_core_t
**iclogp
;
994 xlog_in_core_t
*iclog
, *prev_iclog
=NULL
;
1000 log
= kmem_zalloc(sizeof(xlog_t
), KM_MAYFAIL
);
1002 xfs_warn(mp
, "Log allocation failed: No memory!");
1007 log
->l_targ
= log_target
;
1008 log
->l_logsize
= BBTOB(num_bblks
);
1009 log
->l_logBBstart
= blk_offset
;
1010 log
->l_logBBsize
= num_bblks
;
1011 log
->l_covered_state
= XLOG_STATE_COVER_IDLE
;
1012 log
->l_flags
|= XLOG_ACTIVE_RECOVERY
;
1014 log
->l_prev_block
= -1;
1015 /* log->l_tail_lsn = 0x100000000LL; cycle = 1; current block = 0 */
1016 xlog_assign_atomic_lsn(&log
->l_tail_lsn
, 1, 0);
1017 xlog_assign_atomic_lsn(&log
->l_last_sync_lsn
, 1, 0);
1018 log
->l_curr_cycle
= 1; /* 0 is bad since this is initial value */
1019 xlog_assign_grant_head(&log
->l_grant_reserve_head
, 1, 0);
1020 xlog_assign_grant_head(&log
->l_grant_write_head
, 1, 0);
1021 INIT_LIST_HEAD(&log
->l_reserveq
);
1022 INIT_LIST_HEAD(&log
->l_writeq
);
1023 spin_lock_init(&log
->l_grant_reserve_lock
);
1024 spin_lock_init(&log
->l_grant_write_lock
);
1026 error
= EFSCORRUPTED
;
1027 if (xfs_sb_version_hassector(&mp
->m_sb
)) {
1028 log2_size
= mp
->m_sb
.sb_logsectlog
;
1029 if (log2_size
< BBSHIFT
) {
1030 xfs_warn(mp
, "Log sector size too small (0x%x < 0x%x)",
1031 log2_size
, BBSHIFT
);
1035 log2_size
-= BBSHIFT
;
1036 if (log2_size
> mp
->m_sectbb_log
) {
1037 xfs_warn(mp
, "Log sector size too large (0x%x > 0x%x)",
1038 log2_size
, mp
->m_sectbb_log
);
1042 /* for larger sector sizes, must have v2 or external log */
1043 if (log2_size
&& log
->l_logBBstart
> 0 &&
1044 !xfs_sb_version_haslogv2(&mp
->m_sb
)) {
1046 "log sector size (0x%x) invalid for configuration.",
1051 log
->l_sectBBsize
= 1 << log2_size
;
1053 xlog_get_iclog_buffer_size(mp
, log
);
1056 bp
= xfs_buf_get_empty(log
->l_iclog_size
, mp
->m_logdev_targp
);
1059 XFS_BUF_SET_IODONE_FUNC(bp
, xlog_iodone
);
1060 XFS_BUF_SET_FSPRIVATE2(bp
, (unsigned long)1);
1061 ASSERT(XFS_BUF_ISBUSY(bp
));
1062 ASSERT(XFS_BUF_VALUSEMA(bp
) <= 0);
1065 spin_lock_init(&log
->l_icloglock
);
1066 init_waitqueue_head(&log
->l_flush_wait
);
1068 /* log record size must be multiple of BBSIZE; see xlog_rec_header_t */
1069 ASSERT((XFS_BUF_SIZE(bp
) & BBMASK
) == 0);
1071 iclogp
= &log
->l_iclog
;
1073 * The amount of memory to allocate for the iclog structure is
1074 * rather funky due to the way the structure is defined. It is
1075 * done this way so that we can use different sizes for machines
1076 * with different amounts of memory. See the definition of
1077 * xlog_in_core_t in xfs_log_priv.h for details.
1079 ASSERT(log
->l_iclog_size
>= 4096);
1080 for (i
=0; i
< log
->l_iclog_bufs
; i
++) {
1081 *iclogp
= kmem_zalloc(sizeof(xlog_in_core_t
), KM_MAYFAIL
);
1083 goto out_free_iclog
;
1086 iclog
->ic_prev
= prev_iclog
;
1089 bp
= xfs_buf_get_uncached(mp
->m_logdev_targp
,
1090 log
->l_iclog_size
, 0);
1092 goto out_free_iclog
;
1093 if (!XFS_BUF_CPSEMA(bp
))
1095 XFS_BUF_SET_IODONE_FUNC(bp
, xlog_iodone
);
1096 XFS_BUF_SET_FSPRIVATE2(bp
, (unsigned long)1);
1098 iclog
->ic_data
= bp
->b_addr
;
1100 log
->l_iclog_bak
[i
] = (xfs_caddr_t
)&(iclog
->ic_header
);
1102 head
= &iclog
->ic_header
;
1103 memset(head
, 0, sizeof(xlog_rec_header_t
));
1104 head
->h_magicno
= cpu_to_be32(XLOG_HEADER_MAGIC_NUM
);
1105 head
->h_version
= cpu_to_be32(
1106 xfs_sb_version_haslogv2(&log
->l_mp
->m_sb
) ? 2 : 1);
1107 head
->h_size
= cpu_to_be32(log
->l_iclog_size
);
1109 head
->h_fmt
= cpu_to_be32(XLOG_FMT
);
1110 memcpy(&head
->h_fs_uuid
, &mp
->m_sb
.sb_uuid
, sizeof(uuid_t
));
1112 iclog
->ic_size
= XFS_BUF_SIZE(bp
) - log
->l_iclog_hsize
;
1113 iclog
->ic_state
= XLOG_STATE_ACTIVE
;
1114 iclog
->ic_log
= log
;
1115 atomic_set(&iclog
->ic_refcnt
, 0);
1116 spin_lock_init(&iclog
->ic_callback_lock
);
1117 iclog
->ic_callback_tail
= &(iclog
->ic_callback
);
1118 iclog
->ic_datap
= (char *)iclog
->ic_data
+ log
->l_iclog_hsize
;
1120 ASSERT(XFS_BUF_ISBUSY(iclog
->ic_bp
));
1121 ASSERT(XFS_BUF_VALUSEMA(iclog
->ic_bp
) <= 0);
1122 init_waitqueue_head(&iclog
->ic_force_wait
);
1123 init_waitqueue_head(&iclog
->ic_write_wait
);
1125 iclogp
= &iclog
->ic_next
;
1127 *iclogp
= log
->l_iclog
; /* complete ring */
1128 log
->l_iclog
->ic_prev
= prev_iclog
; /* re-write 1st prev ptr */
1130 error
= xlog_cil_init(log
);
1132 goto out_free_iclog
;
1136 for (iclog
= log
->l_iclog
; iclog
; iclog
= prev_iclog
) {
1137 prev_iclog
= iclog
->ic_next
;
1139 xfs_buf_free(iclog
->ic_bp
);
1142 spinlock_destroy(&log
->l_icloglock
);
1143 xfs_buf_free(log
->l_xbuf
);
1147 return ERR_PTR(-error
);
1148 } /* xlog_alloc_log */
1152 * Write out the commit record of a transaction associated with the given
1153 * ticket. Return the lsn of the commit record.
1158 struct xlog_ticket
*ticket
,
1159 struct xlog_in_core
**iclog
,
1160 xfs_lsn_t
*commitlsnp
)
1162 struct xfs_mount
*mp
= log
->l_mp
;
1164 struct xfs_log_iovec reg
= {
1167 .i_type
= XLOG_REG_TYPE_COMMIT
,
1169 struct xfs_log_vec vec
= {
1174 ASSERT_ALWAYS(iclog
);
1175 error
= xlog_write(log
, &vec
, ticket
, commitlsnp
, iclog
,
1178 xfs_force_shutdown(mp
, SHUTDOWN_LOG_IO_ERROR
);
1183 * Push on the buffer cache code if we ever use more than 75% of the on-disk
1184 * log space. This code pushes on the lsn which would supposedly free up
1185 * the 25% which we want to leave free. We may need to adopt a policy which
1186 * pushes on an lsn which is further along in the log once we reach the high
1187 * water mark. In this manner, we would be creating a low water mark.
1190 xlog_grant_push_ail(
1194 xfs_lsn_t threshold_lsn
= 0;
1195 xfs_lsn_t last_sync_lsn
;
1198 int threshold_block
;
1199 int threshold_cycle
;
1202 ASSERT(BTOBB(need_bytes
) < log
->l_logBBsize
);
1204 free_bytes
= xlog_space_left(log
, &log
->l_grant_reserve_head
);
1205 free_blocks
= BTOBBT(free_bytes
);
1208 * Set the threshold for the minimum number of free blocks in the
1209 * log to the maximum of what the caller needs, one quarter of the
1210 * log, and 256 blocks.
1212 free_threshold
= BTOBB(need_bytes
);
1213 free_threshold
= MAX(free_threshold
, (log
->l_logBBsize
>> 2));
1214 free_threshold
= MAX(free_threshold
, 256);
1215 if (free_blocks
>= free_threshold
)
1218 xlog_crack_atomic_lsn(&log
->l_tail_lsn
, &threshold_cycle
,
1220 threshold_block
+= free_threshold
;
1221 if (threshold_block
>= log
->l_logBBsize
) {
1222 threshold_block
-= log
->l_logBBsize
;
1223 threshold_cycle
+= 1;
1225 threshold_lsn
= xlog_assign_lsn(threshold_cycle
,
1228 * Don't pass in an lsn greater than the lsn of the last
1229 * log record known to be on disk. Use a snapshot of the last sync lsn
1230 * so that it doesn't change between the compare and the set.
1232 last_sync_lsn
= atomic64_read(&log
->l_last_sync_lsn
);
1233 if (XFS_LSN_CMP(threshold_lsn
, last_sync_lsn
) > 0)
1234 threshold_lsn
= last_sync_lsn
;
1237 * Get the transaction layer to kick the dirty buffers out to
1238 * disk asynchronously. No point in trying to do this if
1239 * the filesystem is shutting down.
1241 if (!XLOG_FORCED_SHUTDOWN(log
))
1242 xfs_ail_push(log
->l_ailp
, threshold_lsn
);
1246 * The bdstrat callback function for log bufs. This gives us a central
1247 * place to trap bufs in case we get hit by a log I/O error and need to
1248 * shutdown. Actually, in practice, even when we didn't get a log error,
1249 * we transition the iclogs to IOERROR state *after* flushing all existing
1250 * iclogs to disk. This is because we don't want anymore new transactions to be
1251 * started or completed afterwards.
1257 struct xlog_in_core
*iclog
;
1259 iclog
= XFS_BUF_FSPRIVATE(bp
, xlog_in_core_t
*);
1260 if (iclog
->ic_state
& XLOG_STATE_IOERROR
) {
1261 XFS_BUF_ERROR(bp
, EIO
);
1263 xfs_buf_ioend(bp
, 0);
1265 * It would seem logical to return EIO here, but we rely on
1266 * the log state machine to propagate I/O errors instead of
1272 bp
->b_flags
|= _XBF_RUN_QUEUES
;
1273 xfs_buf_iorequest(bp
);
1278 * Flush out the in-core log (iclog) to the on-disk log in an asynchronous
1279 * fashion. Previously, we should have moved the current iclog
1280 * ptr in the log to point to the next available iclog. This allows further
1281 * write to continue while this code syncs out an iclog ready to go.
1282 * Before an in-core log can be written out, the data section must be scanned
1283 * to save away the 1st word of each BBSIZE block into the header. We replace
1284 * it with the current cycle count. Each BBSIZE block is tagged with the
1285 * cycle count because there in an implicit assumption that drives will
1286 * guarantee that entire 512 byte blocks get written at once. In other words,
1287 * we can't have part of a 512 byte block written and part not written. By
1288 * tagging each block, we will know which blocks are valid when recovering
1289 * after an unclean shutdown.
1291 * This routine is single threaded on the iclog. No other thread can be in
1292 * this routine with the same iclog. Changing contents of iclog can there-
1293 * fore be done without grabbing the state machine lock. Updating the global
1294 * log will require grabbing the lock though.
1296 * The entire log manager uses a logical block numbering scheme. Only
1297 * log_sync (and then only bwrite()) know about the fact that the log may
1298 * not start with block zero on a given device. The log block start offset
1299 * is added immediately before calling bwrite().
1303 xlog_sync(xlog_t
*log
,
1304 xlog_in_core_t
*iclog
)
1306 xfs_caddr_t dptr
; /* pointer to byte sized element */
1309 uint count
; /* byte count of bwrite */
1310 uint count_init
; /* initial count before roundup */
1311 int roundoff
; /* roundoff to BB or stripe */
1312 int split
= 0; /* split write into two regions */
1314 int v2
= xfs_sb_version_haslogv2(&log
->l_mp
->m_sb
);
1316 XFS_STATS_INC(xs_log_writes
);
1317 ASSERT(atomic_read(&iclog
->ic_refcnt
) == 0);
1319 /* Add for LR header */
1320 count_init
= log
->l_iclog_hsize
+ iclog
->ic_offset
;
1322 /* Round out the log write size */
1323 if (v2
&& log
->l_mp
->m_sb
.sb_logsunit
> 1) {
1324 /* we have a v2 stripe unit to use */
1325 count
= XLOG_LSUNITTOB(log
, XLOG_BTOLSUNIT(log
, count_init
));
1327 count
= BBTOB(BTOBB(count_init
));
1329 roundoff
= count
- count_init
;
1330 ASSERT(roundoff
>= 0);
1331 ASSERT((v2
&& log
->l_mp
->m_sb
.sb_logsunit
> 1 &&
1332 roundoff
< log
->l_mp
->m_sb
.sb_logsunit
)
1334 (log
->l_mp
->m_sb
.sb_logsunit
<= 1 &&
1335 roundoff
< BBTOB(1)));
1337 /* move grant heads by roundoff in sync */
1338 xlog_grant_add_space(log
, &log
->l_grant_reserve_head
, roundoff
);
1339 xlog_grant_add_space(log
, &log
->l_grant_write_head
, roundoff
);
1341 /* put cycle number in every block */
1342 xlog_pack_data(log
, iclog
, roundoff
);
1344 /* real byte length */
1346 iclog
->ic_header
.h_len
=
1347 cpu_to_be32(iclog
->ic_offset
+ roundoff
);
1349 iclog
->ic_header
.h_len
=
1350 cpu_to_be32(iclog
->ic_offset
);
1354 ASSERT(XFS_BUF_FSPRIVATE2(bp
, unsigned long) == (unsigned long)1);
1355 XFS_BUF_SET_FSPRIVATE2(bp
, (unsigned long)2);
1356 XFS_BUF_SET_ADDR(bp
, BLOCK_LSN(be64_to_cpu(iclog
->ic_header
.h_lsn
)));
1358 XFS_STATS_ADD(xs_log_blocks
, BTOBB(count
));
1360 /* Do we need to split this write into 2 parts? */
1361 if (XFS_BUF_ADDR(bp
) + BTOBB(count
) > log
->l_logBBsize
) {
1362 split
= count
- (BBTOB(log
->l_logBBsize
- XFS_BUF_ADDR(bp
)));
1363 count
= BBTOB(log
->l_logBBsize
- XFS_BUF_ADDR(bp
));
1364 iclog
->ic_bwritecnt
= 2; /* split into 2 writes */
1366 iclog
->ic_bwritecnt
= 1;
1368 XFS_BUF_SET_COUNT(bp
, count
);
1369 XFS_BUF_SET_FSPRIVATE(bp
, iclog
); /* save for later */
1370 XFS_BUF_ZEROFLAGS(bp
);
1373 bp
->b_flags
|= XBF_LOG_BUFFER
;
1375 if (log
->l_mp
->m_flags
& XFS_MOUNT_BARRIER
)
1376 XFS_BUF_ORDERED(bp
);
1378 ASSERT(XFS_BUF_ADDR(bp
) <= log
->l_logBBsize
-1);
1379 ASSERT(XFS_BUF_ADDR(bp
) + BTOBB(count
) <= log
->l_logBBsize
);
1381 xlog_verify_iclog(log
, iclog
, count
, B_TRUE
);
1383 /* account for log which doesn't start at block #0 */
1384 XFS_BUF_SET_ADDR(bp
, XFS_BUF_ADDR(bp
) + log
->l_logBBstart
);
1386 * Don't call xfs_bwrite here. We do log-syncs even when the filesystem
1391 if ((error
= xlog_bdstrat(bp
))) {
1392 xfs_ioerror_alert("xlog_sync", log
->l_mp
, bp
,
1397 bp
= iclog
->ic_log
->l_xbuf
;
1398 ASSERT(XFS_BUF_FSPRIVATE2(bp
, unsigned long) ==
1400 XFS_BUF_SET_FSPRIVATE2(bp
, (unsigned long)2);
1401 XFS_BUF_SET_ADDR(bp
, 0); /* logical 0 */
1402 XFS_BUF_SET_PTR(bp
, (xfs_caddr_t
)((__psint_t
)&(iclog
->ic_header
)+
1403 (__psint_t
)count
), split
);
1404 XFS_BUF_SET_FSPRIVATE(bp
, iclog
);
1405 XFS_BUF_ZEROFLAGS(bp
);
1408 bp
->b_flags
|= XBF_LOG_BUFFER
;
1409 if (log
->l_mp
->m_flags
& XFS_MOUNT_BARRIER
)
1410 XFS_BUF_ORDERED(bp
);
1411 dptr
= XFS_BUF_PTR(bp
);
1413 * Bump the cycle numbers at the start of each block
1414 * since this part of the buffer is at the start of
1415 * a new cycle. Watch out for the header magic number
1418 for (i
= 0; i
< split
; i
+= BBSIZE
) {
1419 be32_add_cpu((__be32
*)dptr
, 1);
1420 if (be32_to_cpu(*(__be32
*)dptr
) == XLOG_HEADER_MAGIC_NUM
)
1421 be32_add_cpu((__be32
*)dptr
, 1);
1425 ASSERT(XFS_BUF_ADDR(bp
) <= log
->l_logBBsize
-1);
1426 ASSERT(XFS_BUF_ADDR(bp
) + BTOBB(count
) <= log
->l_logBBsize
);
1428 /* account for internal log which doesn't start at block #0 */
1429 XFS_BUF_SET_ADDR(bp
, XFS_BUF_ADDR(bp
) + log
->l_logBBstart
);
1431 if ((error
= xlog_bdstrat(bp
))) {
1432 xfs_ioerror_alert("xlog_sync (split)", log
->l_mp
,
1433 bp
, XFS_BUF_ADDR(bp
));
1442 * Deallocate a log structure
1445 xlog_dealloc_log(xlog_t
*log
)
1447 xlog_in_core_t
*iclog
, *next_iclog
;
1450 xlog_cil_destroy(log
);
1453 * always need to ensure that the extra buffer does not point to memory
1454 * owned by another log buffer before we free it.
1456 xfs_buf_set_empty(log
->l_xbuf
, log
->l_iclog_size
);
1457 xfs_buf_free(log
->l_xbuf
);
1459 iclog
= log
->l_iclog
;
1460 for (i
=0; i
<log
->l_iclog_bufs
; i
++) {
1461 xfs_buf_free(iclog
->ic_bp
);
1462 next_iclog
= iclog
->ic_next
;
1466 spinlock_destroy(&log
->l_icloglock
);
1468 log
->l_mp
->m_log
= NULL
;
1470 } /* xlog_dealloc_log */
1473 * Update counters atomically now that memcpy is done.
1477 xlog_state_finish_copy(xlog_t
*log
,
1478 xlog_in_core_t
*iclog
,
1482 spin_lock(&log
->l_icloglock
);
1484 be32_add_cpu(&iclog
->ic_header
.h_num_logops
, record_cnt
);
1485 iclog
->ic_offset
+= copy_bytes
;
1487 spin_unlock(&log
->l_icloglock
);
1488 } /* xlog_state_finish_copy */
1494 * print out info relating to regions written which consume
1499 struct xfs_mount
*mp
,
1500 struct xlog_ticket
*ticket
)
1503 uint ophdr_spc
= ticket
->t_res_num_ophdrs
* (uint
)sizeof(xlog_op_header_t
);
1505 /* match with XLOG_REG_TYPE_* in xfs_log.h */
1506 static char *res_type_str
[XLOG_REG_TYPE_MAX
] = {
1527 static char *trans_type_str
[XFS_TRANS_TYPE_MAX
] = {
1571 "xfs_log_write: reservation summary:\n"
1572 " trans type = %s (%u)\n"
1573 " unit res = %d bytes\n"
1574 " current res = %d bytes\n"
1575 " total reg = %u bytes (o/flow = %u bytes)\n"
1576 " ophdrs = %u (ophdr space = %u bytes)\n"
1577 " ophdr + reg = %u bytes\n"
1578 " num regions = %u\n",
1579 ((ticket
->t_trans_type
<= 0 ||
1580 ticket
->t_trans_type
> XFS_TRANS_TYPE_MAX
) ?
1581 "bad-trans-type" : trans_type_str
[ticket
->t_trans_type
-1]),
1582 ticket
->t_trans_type
,
1585 ticket
->t_res_arr_sum
, ticket
->t_res_o_flow
,
1586 ticket
->t_res_num_ophdrs
, ophdr_spc
,
1587 ticket
->t_res_arr_sum
+
1588 ticket
->t_res_o_flow
+ ophdr_spc
,
1591 for (i
= 0; i
< ticket
->t_res_num
; i
++) {
1592 uint r_type
= ticket
->t_res_arr
[i
].r_type
;
1593 xfs_warn(mp
, "region[%u]: %s - %u bytes\n", i
,
1594 ((r_type
<= 0 || r_type
> XLOG_REG_TYPE_MAX
) ?
1595 "bad-rtype" : res_type_str
[r_type
-1]),
1596 ticket
->t_res_arr
[i
].r_len
);
1599 xfs_alert_tag(mp
, XFS_PTAG_LOGRES
,
1600 "xfs_log_write: reservation ran out. Need to up reservation");
1601 xfs_force_shutdown(mp
, SHUTDOWN_CORRUPT_INCORE
);
1605 * Calculate the potential space needed by the log vector. Each region gets
1606 * its own xlog_op_header_t and may need to be double word aligned.
1609 xlog_write_calc_vec_length(
1610 struct xlog_ticket
*ticket
,
1611 struct xfs_log_vec
*log_vector
)
1613 struct xfs_log_vec
*lv
;
1618 /* acct for start rec of xact */
1619 if (ticket
->t_flags
& XLOG_TIC_INITED
)
1622 for (lv
= log_vector
; lv
; lv
= lv
->lv_next
) {
1623 headers
+= lv
->lv_niovecs
;
1625 for (i
= 0; i
< lv
->lv_niovecs
; i
++) {
1626 struct xfs_log_iovec
*vecp
= &lv
->lv_iovecp
[i
];
1629 xlog_tic_add_region(ticket
, vecp
->i_len
, vecp
->i_type
);
1633 ticket
->t_res_num_ophdrs
+= headers
;
1634 len
+= headers
* sizeof(struct xlog_op_header
);
1640 * If first write for transaction, insert start record We can't be trying to
1641 * commit if we are inited. We can't have any "partial_copy" if we are inited.
1644 xlog_write_start_rec(
1645 struct xlog_op_header
*ophdr
,
1646 struct xlog_ticket
*ticket
)
1648 if (!(ticket
->t_flags
& XLOG_TIC_INITED
))
1651 ophdr
->oh_tid
= cpu_to_be32(ticket
->t_tid
);
1652 ophdr
->oh_clientid
= ticket
->t_clientid
;
1654 ophdr
->oh_flags
= XLOG_START_TRANS
;
1657 ticket
->t_flags
&= ~XLOG_TIC_INITED
;
1659 return sizeof(struct xlog_op_header
);
1662 static xlog_op_header_t
*
1663 xlog_write_setup_ophdr(
1665 struct xlog_op_header
*ophdr
,
1666 struct xlog_ticket
*ticket
,
1669 ophdr
->oh_tid
= cpu_to_be32(ticket
->t_tid
);
1670 ophdr
->oh_clientid
= ticket
->t_clientid
;
1673 /* are we copying a commit or unmount record? */
1674 ophdr
->oh_flags
= flags
;
1677 * We've seen logs corrupted with bad transaction client ids. This
1678 * makes sure that XFS doesn't generate them on. Turn this into an EIO
1679 * and shut down the filesystem.
1681 switch (ophdr
->oh_clientid
) {
1682 case XFS_TRANSACTION
:
1688 "Bad XFS transaction clientid 0x%x in ticket 0x%p",
1689 ophdr
->oh_clientid
, ticket
);
1697 * Set up the parameters of the region copy into the log. This has
1698 * to handle region write split across multiple log buffers - this
1699 * state is kept external to this function so that this code can
1700 * can be written in an obvious, self documenting manner.
1703 xlog_write_setup_copy(
1704 struct xlog_ticket
*ticket
,
1705 struct xlog_op_header
*ophdr
,
1706 int space_available
,
1710 int *last_was_partial_copy
,
1711 int *bytes_consumed
)
1715 still_to_copy
= space_required
- *bytes_consumed
;
1716 *copy_off
= *bytes_consumed
;
1718 if (still_to_copy
<= space_available
) {
1719 /* write of region completes here */
1720 *copy_len
= still_to_copy
;
1721 ophdr
->oh_len
= cpu_to_be32(*copy_len
);
1722 if (*last_was_partial_copy
)
1723 ophdr
->oh_flags
|= (XLOG_END_TRANS
|XLOG_WAS_CONT_TRANS
);
1724 *last_was_partial_copy
= 0;
1725 *bytes_consumed
= 0;
1729 /* partial write of region, needs extra log op header reservation */
1730 *copy_len
= space_available
;
1731 ophdr
->oh_len
= cpu_to_be32(*copy_len
);
1732 ophdr
->oh_flags
|= XLOG_CONTINUE_TRANS
;
1733 if (*last_was_partial_copy
)
1734 ophdr
->oh_flags
|= XLOG_WAS_CONT_TRANS
;
1735 *bytes_consumed
+= *copy_len
;
1736 (*last_was_partial_copy
)++;
1738 /* account for new log op header */
1739 ticket
->t_curr_res
-= sizeof(struct xlog_op_header
);
1740 ticket
->t_res_num_ophdrs
++;
1742 return sizeof(struct xlog_op_header
);
1746 xlog_write_copy_finish(
1748 struct xlog_in_core
*iclog
,
1753 int *partial_copy_len
,
1755 struct xlog_in_core
**commit_iclog
)
1757 if (*partial_copy
) {
1759 * This iclog has already been marked WANT_SYNC by
1760 * xlog_state_get_iclog_space.
1762 xlog_state_finish_copy(log
, iclog
, *record_cnt
, *data_cnt
);
1765 return xlog_state_release_iclog(log
, iclog
);
1769 *partial_copy_len
= 0;
1771 if (iclog
->ic_size
- log_offset
<= sizeof(xlog_op_header_t
)) {
1772 /* no more space in this iclog - push it. */
1773 xlog_state_finish_copy(log
, iclog
, *record_cnt
, *data_cnt
);
1777 spin_lock(&log
->l_icloglock
);
1778 xlog_state_want_sync(log
, iclog
);
1779 spin_unlock(&log
->l_icloglock
);
1782 return xlog_state_release_iclog(log
, iclog
);
1783 ASSERT(flags
& XLOG_COMMIT_TRANS
);
1784 *commit_iclog
= iclog
;
1791 * Write some region out to in-core log
1793 * This will be called when writing externally provided regions or when
1794 * writing out a commit record for a given transaction.
1796 * General algorithm:
1797 * 1. Find total length of this write. This may include adding to the
1798 * lengths passed in.
1799 * 2. Check whether we violate the tickets reservation.
1800 * 3. While writing to this iclog
1801 * A. Reserve as much space in this iclog as can get
1802 * B. If this is first write, save away start lsn
1803 * C. While writing this region:
1804 * 1. If first write of transaction, write start record
1805 * 2. Write log operation header (header per region)
1806 * 3. Find out if we can fit entire region into this iclog
1807 * 4. Potentially, verify destination memcpy ptr
1808 * 5. Memcpy (partial) region
1809 * 6. If partial copy, release iclog; otherwise, continue
1810 * copying more regions into current iclog
1811 * 4. Mark want sync bit (in simulation mode)
1812 * 5. Release iclog for potential flush to on-disk log.
1815 * 1. Panic if reservation is overrun. This should never happen since
1816 * reservation amounts are generated internal to the filesystem.
1818 * 1. Tickets are single threaded data structures.
1819 * 2. The XLOG_END_TRANS & XLOG_CONTINUE_TRANS flags are passed down to the
1820 * syncing routine. When a single log_write region needs to span
1821 * multiple in-core logs, the XLOG_CONTINUE_TRANS bit should be set
1822 * on all log operation writes which don't contain the end of the
1823 * region. The XLOG_END_TRANS bit is used for the in-core log
1824 * operation which contains the end of the continued log_write region.
1825 * 3. When xlog_state_get_iclog_space() grabs the rest of the current iclog,
1826 * we don't really know exactly how much space will be used. As a result,
1827 * we don't update ic_offset until the end when we know exactly how many
1828 * bytes have been written out.
1833 struct xfs_log_vec
*log_vector
,
1834 struct xlog_ticket
*ticket
,
1835 xfs_lsn_t
*start_lsn
,
1836 struct xlog_in_core
**commit_iclog
,
1839 struct xlog_in_core
*iclog
= NULL
;
1840 struct xfs_log_iovec
*vecp
;
1841 struct xfs_log_vec
*lv
;
1844 int partial_copy
= 0;
1845 int partial_copy_len
= 0;
1853 len
= xlog_write_calc_vec_length(ticket
, log_vector
);
1856 * Region headers and bytes are already accounted for.
1857 * We only need to take into account start records and
1858 * split regions in this function.
1860 if (ticket
->t_flags
& XLOG_TIC_INITED
)
1861 ticket
->t_curr_res
-= sizeof(xlog_op_header_t
);
1864 * Commit record headers need to be accounted for. These
1865 * come in as separate writes so are easy to detect.
1867 if (flags
& (XLOG_COMMIT_TRANS
| XLOG_UNMOUNT_TRANS
))
1868 ticket
->t_curr_res
-= sizeof(xlog_op_header_t
);
1870 ticket
->t_curr_res
-= len
;
1872 if (ticket
->t_curr_res
< 0)
1873 xlog_print_tic_res(log
->l_mp
, ticket
);
1877 vecp
= lv
->lv_iovecp
;
1878 while (lv
&& index
< lv
->lv_niovecs
) {
1882 error
= xlog_state_get_iclog_space(log
, len
, &iclog
, ticket
,
1883 &contwr
, &log_offset
);
1887 ASSERT(log_offset
<= iclog
->ic_size
- 1);
1888 ptr
= iclog
->ic_datap
+ log_offset
;
1890 /* start_lsn is the first lsn written to. That's all we need. */
1892 *start_lsn
= be64_to_cpu(iclog
->ic_header
.h_lsn
);
1895 * This loop writes out as many regions as can fit in the amount
1896 * of space which was allocated by xlog_state_get_iclog_space().
1898 while (lv
&& index
< lv
->lv_niovecs
) {
1899 struct xfs_log_iovec
*reg
= &vecp
[index
];
1900 struct xlog_op_header
*ophdr
;
1905 ASSERT(reg
->i_len
% sizeof(__int32_t
) == 0);
1906 ASSERT((unsigned long)ptr
% sizeof(__int32_t
) == 0);
1908 start_rec_copy
= xlog_write_start_rec(ptr
, ticket
);
1909 if (start_rec_copy
) {
1911 xlog_write_adv_cnt(&ptr
, &len
, &log_offset
,
1915 ophdr
= xlog_write_setup_ophdr(log
, ptr
, ticket
, flags
);
1917 return XFS_ERROR(EIO
);
1919 xlog_write_adv_cnt(&ptr
, &len
, &log_offset
,
1920 sizeof(struct xlog_op_header
));
1922 len
+= xlog_write_setup_copy(ticket
, ophdr
,
1923 iclog
->ic_size
-log_offset
,
1925 ©_off
, ©_len
,
1928 xlog_verify_dest_ptr(log
, ptr
);
1931 ASSERT(copy_len
>= 0);
1932 memcpy(ptr
, reg
->i_addr
+ copy_off
, copy_len
);
1933 xlog_write_adv_cnt(&ptr
, &len
, &log_offset
, copy_len
);
1935 copy_len
+= start_rec_copy
+ sizeof(xlog_op_header_t
);
1937 data_cnt
+= contwr
? copy_len
: 0;
1939 error
= xlog_write_copy_finish(log
, iclog
, flags
,
1940 &record_cnt
, &data_cnt
,
1949 * if we had a partial copy, we need to get more iclog
1950 * space but we don't want to increment the region
1951 * index because there is still more is this region to
1954 * If we completed writing this region, and we flushed
1955 * the iclog (indicated by resetting of the record
1956 * count), then we also need to get more log space. If
1957 * this was the last record, though, we are done and
1963 if (++index
== lv
->lv_niovecs
) {
1967 vecp
= lv
->lv_iovecp
;
1969 if (record_cnt
== 0) {
1979 xlog_state_finish_copy(log
, iclog
, record_cnt
, data_cnt
);
1981 return xlog_state_release_iclog(log
, iclog
);
1983 ASSERT(flags
& XLOG_COMMIT_TRANS
);
1984 *commit_iclog
= iclog
;
1989 /*****************************************************************************
1991 * State Machine functions
1993 *****************************************************************************
1996 /* Clean iclogs starting from the head. This ordering must be
1997 * maintained, so an iclog doesn't become ACTIVE beyond one that
1998 * is SYNCING. This is also required to maintain the notion that we use
1999 * a ordered wait queue to hold off would be writers to the log when every
2000 * iclog is trying to sync to disk.
2002 * State Change: DIRTY -> ACTIVE
2005 xlog_state_clean_log(xlog_t
*log
)
2007 xlog_in_core_t
*iclog
;
2010 iclog
= log
->l_iclog
;
2012 if (iclog
->ic_state
== XLOG_STATE_DIRTY
) {
2013 iclog
->ic_state
= XLOG_STATE_ACTIVE
;
2014 iclog
->ic_offset
= 0;
2015 ASSERT(iclog
->ic_callback
== NULL
);
2017 * If the number of ops in this iclog indicate it just
2018 * contains the dummy transaction, we can
2019 * change state into IDLE (the second time around).
2020 * Otherwise we should change the state into
2022 * We don't need to cover the dummy.
2025 (be32_to_cpu(iclog
->ic_header
.h_num_logops
) ==
2030 * We have two dirty iclogs so start over
2031 * This could also be num of ops indicates
2032 * this is not the dummy going out.
2036 iclog
->ic_header
.h_num_logops
= 0;
2037 memset(iclog
->ic_header
.h_cycle_data
, 0,
2038 sizeof(iclog
->ic_header
.h_cycle_data
));
2039 iclog
->ic_header
.h_lsn
= 0;
2040 } else if (iclog
->ic_state
== XLOG_STATE_ACTIVE
)
2043 break; /* stop cleaning */
2044 iclog
= iclog
->ic_next
;
2045 } while (iclog
!= log
->l_iclog
);
2047 /* log is locked when we are called */
2049 * Change state for the dummy log recording.
2050 * We usually go to NEED. But we go to NEED2 if the changed indicates
2051 * we are done writing the dummy record.
2052 * If we are done with the second dummy recored (DONE2), then
2056 switch (log
->l_covered_state
) {
2057 case XLOG_STATE_COVER_IDLE
:
2058 case XLOG_STATE_COVER_NEED
:
2059 case XLOG_STATE_COVER_NEED2
:
2060 log
->l_covered_state
= XLOG_STATE_COVER_NEED
;
2063 case XLOG_STATE_COVER_DONE
:
2065 log
->l_covered_state
= XLOG_STATE_COVER_NEED2
;
2067 log
->l_covered_state
= XLOG_STATE_COVER_NEED
;
2070 case XLOG_STATE_COVER_DONE2
:
2072 log
->l_covered_state
= XLOG_STATE_COVER_IDLE
;
2074 log
->l_covered_state
= XLOG_STATE_COVER_NEED
;
2081 } /* xlog_state_clean_log */
2084 xlog_get_lowest_lsn(
2087 xlog_in_core_t
*lsn_log
;
2088 xfs_lsn_t lowest_lsn
, lsn
;
2090 lsn_log
= log
->l_iclog
;
2093 if (!(lsn_log
->ic_state
& (XLOG_STATE_ACTIVE
|XLOG_STATE_DIRTY
))) {
2094 lsn
= be64_to_cpu(lsn_log
->ic_header
.h_lsn
);
2095 if ((lsn
&& !lowest_lsn
) ||
2096 (XFS_LSN_CMP(lsn
, lowest_lsn
) < 0)) {
2100 lsn_log
= lsn_log
->ic_next
;
2101 } while (lsn_log
!= log
->l_iclog
);
2107 xlog_state_do_callback(
2110 xlog_in_core_t
*ciclog
)
2112 xlog_in_core_t
*iclog
;
2113 xlog_in_core_t
*first_iclog
; /* used to know when we've
2114 * processed all iclogs once */
2115 xfs_log_callback_t
*cb
, *cb_next
;
2117 xfs_lsn_t lowest_lsn
;
2118 int ioerrors
; /* counter: iclogs with errors */
2119 int loopdidcallbacks
; /* flag: inner loop did callbacks*/
2120 int funcdidcallbacks
; /* flag: function did callbacks */
2121 int repeats
; /* for issuing console warnings if
2122 * looping too many times */
2125 spin_lock(&log
->l_icloglock
);
2126 first_iclog
= iclog
= log
->l_iclog
;
2128 funcdidcallbacks
= 0;
2133 * Scan all iclogs starting with the one pointed to by the
2134 * log. Reset this starting point each time the log is
2135 * unlocked (during callbacks).
2137 * Keep looping through iclogs until one full pass is made
2138 * without running any callbacks.
2140 first_iclog
= log
->l_iclog
;
2141 iclog
= log
->l_iclog
;
2142 loopdidcallbacks
= 0;
2147 /* skip all iclogs in the ACTIVE & DIRTY states */
2148 if (iclog
->ic_state
&
2149 (XLOG_STATE_ACTIVE
|XLOG_STATE_DIRTY
)) {
2150 iclog
= iclog
->ic_next
;
2155 * Between marking a filesystem SHUTDOWN and stopping
2156 * the log, we do flush all iclogs to disk (if there
2157 * wasn't a log I/O error). So, we do want things to
2158 * go smoothly in case of just a SHUTDOWN w/o a
2161 if (!(iclog
->ic_state
& XLOG_STATE_IOERROR
)) {
2163 * Can only perform callbacks in order. Since
2164 * this iclog is not in the DONE_SYNC/
2165 * DO_CALLBACK state, we skip the rest and
2166 * just try to clean up. If we set our iclog
2167 * to DO_CALLBACK, we will not process it when
2168 * we retry since a previous iclog is in the
2169 * CALLBACK and the state cannot change since
2170 * we are holding the l_icloglock.
2172 if (!(iclog
->ic_state
&
2173 (XLOG_STATE_DONE_SYNC
|
2174 XLOG_STATE_DO_CALLBACK
))) {
2175 if (ciclog
&& (ciclog
->ic_state
==
2176 XLOG_STATE_DONE_SYNC
)) {
2177 ciclog
->ic_state
= XLOG_STATE_DO_CALLBACK
;
2182 * We now have an iclog that is in either the
2183 * DO_CALLBACK or DONE_SYNC states. The other
2184 * states (WANT_SYNC, SYNCING, or CALLBACK were
2185 * caught by the above if and are going to
2186 * clean (i.e. we aren't doing their callbacks)
2191 * We will do one more check here to see if we
2192 * have chased our tail around.
2195 lowest_lsn
= xlog_get_lowest_lsn(log
);
2197 XFS_LSN_CMP(lowest_lsn
,
2198 be64_to_cpu(iclog
->ic_header
.h_lsn
)) < 0) {
2199 iclog
= iclog
->ic_next
;
2200 continue; /* Leave this iclog for
2204 iclog
->ic_state
= XLOG_STATE_CALLBACK
;
2208 * update the last_sync_lsn before we drop the
2209 * icloglock to ensure we are the only one that
2212 ASSERT(XFS_LSN_CMP(atomic64_read(&log
->l_last_sync_lsn
),
2213 be64_to_cpu(iclog
->ic_header
.h_lsn
)) <= 0);
2214 atomic64_set(&log
->l_last_sync_lsn
,
2215 be64_to_cpu(iclog
->ic_header
.h_lsn
));
2220 spin_unlock(&log
->l_icloglock
);
2223 * Keep processing entries in the callback list until
2224 * we come around and it is empty. We need to
2225 * atomically see that the list is empty and change the
2226 * state to DIRTY so that we don't miss any more
2227 * callbacks being added.
2229 spin_lock(&iclog
->ic_callback_lock
);
2230 cb
= iclog
->ic_callback
;
2232 iclog
->ic_callback_tail
= &(iclog
->ic_callback
);
2233 iclog
->ic_callback
= NULL
;
2234 spin_unlock(&iclog
->ic_callback_lock
);
2236 /* perform callbacks in the order given */
2237 for (; cb
; cb
= cb_next
) {
2238 cb_next
= cb
->cb_next
;
2239 cb
->cb_func(cb
->cb_arg
, aborted
);
2241 spin_lock(&iclog
->ic_callback_lock
);
2242 cb
= iclog
->ic_callback
;
2248 spin_lock(&log
->l_icloglock
);
2249 ASSERT(iclog
->ic_callback
== NULL
);
2250 spin_unlock(&iclog
->ic_callback_lock
);
2251 if (!(iclog
->ic_state
& XLOG_STATE_IOERROR
))
2252 iclog
->ic_state
= XLOG_STATE_DIRTY
;
2255 * Transition from DIRTY to ACTIVE if applicable.
2256 * NOP if STATE_IOERROR.
2258 xlog_state_clean_log(log
);
2260 /* wake up threads waiting in xfs_log_force() */
2261 wake_up_all(&iclog
->ic_force_wait
);
2263 iclog
= iclog
->ic_next
;
2264 } while (first_iclog
!= iclog
);
2266 if (repeats
> 5000) {
2267 flushcnt
+= repeats
;
2270 "%s: possible infinite loop (%d iterations)",
2271 __func__
, flushcnt
);
2273 } while (!ioerrors
&& loopdidcallbacks
);
2276 * make one last gasp attempt to see if iclogs are being left in
2280 if (funcdidcallbacks
) {
2281 first_iclog
= iclog
= log
->l_iclog
;
2283 ASSERT(iclog
->ic_state
!= XLOG_STATE_DO_CALLBACK
);
2285 * Terminate the loop if iclogs are found in states
2286 * which will cause other threads to clean up iclogs.
2288 * SYNCING - i/o completion will go through logs
2289 * DONE_SYNC - interrupt thread should be waiting for
2291 * IOERROR - give up hope all ye who enter here
2293 if (iclog
->ic_state
== XLOG_STATE_WANT_SYNC
||
2294 iclog
->ic_state
== XLOG_STATE_SYNCING
||
2295 iclog
->ic_state
== XLOG_STATE_DONE_SYNC
||
2296 iclog
->ic_state
== XLOG_STATE_IOERROR
)
2298 iclog
= iclog
->ic_next
;
2299 } while (first_iclog
!= iclog
);
2303 if (log
->l_iclog
->ic_state
& (XLOG_STATE_ACTIVE
|XLOG_STATE_IOERROR
))
2305 spin_unlock(&log
->l_icloglock
);
2308 wake_up_all(&log
->l_flush_wait
);
2313 * Finish transitioning this iclog to the dirty state.
2315 * Make sure that we completely execute this routine only when this is
2316 * the last call to the iclog. There is a good chance that iclog flushes,
2317 * when we reach the end of the physical log, get turned into 2 separate
2318 * calls to bwrite. Hence, one iclog flush could generate two calls to this
2319 * routine. By using the reference count bwritecnt, we guarantee that only
2320 * the second completion goes through.
2322 * Callbacks could take time, so they are done outside the scope of the
2323 * global state machine log lock.
2326 xlog_state_done_syncing(
2327 xlog_in_core_t
*iclog
,
2330 xlog_t
*log
= iclog
->ic_log
;
2332 spin_lock(&log
->l_icloglock
);
2334 ASSERT(iclog
->ic_state
== XLOG_STATE_SYNCING
||
2335 iclog
->ic_state
== XLOG_STATE_IOERROR
);
2336 ASSERT(atomic_read(&iclog
->ic_refcnt
) == 0);
2337 ASSERT(iclog
->ic_bwritecnt
== 1 || iclog
->ic_bwritecnt
== 2);
2341 * If we got an error, either on the first buffer, or in the case of
2342 * split log writes, on the second, we mark ALL iclogs STATE_IOERROR,
2343 * and none should ever be attempted to be written to disk
2346 if (iclog
->ic_state
!= XLOG_STATE_IOERROR
) {
2347 if (--iclog
->ic_bwritecnt
== 1) {
2348 spin_unlock(&log
->l_icloglock
);
2351 iclog
->ic_state
= XLOG_STATE_DONE_SYNC
;
2355 * Someone could be sleeping prior to writing out the next
2356 * iclog buffer, we wake them all, one will get to do the
2357 * I/O, the others get to wait for the result.
2359 wake_up_all(&iclog
->ic_write_wait
);
2360 spin_unlock(&log
->l_icloglock
);
2361 xlog_state_do_callback(log
, aborted
, iclog
); /* also cleans log */
2362 } /* xlog_state_done_syncing */
2366 * If the head of the in-core log ring is not (ACTIVE or DIRTY), then we must
2367 * sleep. We wait on the flush queue on the head iclog as that should be
2368 * the first iclog to complete flushing. Hence if all iclogs are syncing,
2369 * we will wait here and all new writes will sleep until a sync completes.
2371 * The in-core logs are used in a circular fashion. They are not used
2372 * out-of-order even when an iclog past the head is free.
2375 * * log_offset where xlog_write() can start writing into the in-core
2377 * * in-core log pointer to which xlog_write() should write.
2378 * * boolean indicating this is a continued write to an in-core log.
2379 * If this is the last write, then the in-core log's offset field
2380 * needs to be incremented, depending on the amount of data which
2384 xlog_state_get_iclog_space(xlog_t
*log
,
2386 xlog_in_core_t
**iclogp
,
2387 xlog_ticket_t
*ticket
,
2388 int *continued_write
,
2392 xlog_rec_header_t
*head
;
2393 xlog_in_core_t
*iclog
;
2397 spin_lock(&log
->l_icloglock
);
2398 if (XLOG_FORCED_SHUTDOWN(log
)) {
2399 spin_unlock(&log
->l_icloglock
);
2400 return XFS_ERROR(EIO
);
2403 iclog
= log
->l_iclog
;
2404 if (iclog
->ic_state
!= XLOG_STATE_ACTIVE
) {
2405 XFS_STATS_INC(xs_log_noiclogs
);
2407 /* Wait for log writes to have flushed */
2408 xlog_wait(&log
->l_flush_wait
, &log
->l_icloglock
);
2412 head
= &iclog
->ic_header
;
2414 atomic_inc(&iclog
->ic_refcnt
); /* prevents sync */
2415 log_offset
= iclog
->ic_offset
;
2417 /* On the 1st write to an iclog, figure out lsn. This works
2418 * if iclogs marked XLOG_STATE_WANT_SYNC always write out what they are
2419 * committing to. If the offset is set, that's how many blocks
2422 if (log_offset
== 0) {
2423 ticket
->t_curr_res
-= log
->l_iclog_hsize
;
2424 xlog_tic_add_region(ticket
,
2426 XLOG_REG_TYPE_LRHEADER
);
2427 head
->h_cycle
= cpu_to_be32(log
->l_curr_cycle
);
2428 head
->h_lsn
= cpu_to_be64(
2429 xlog_assign_lsn(log
->l_curr_cycle
, log
->l_curr_block
));
2430 ASSERT(log
->l_curr_block
>= 0);
2433 /* If there is enough room to write everything, then do it. Otherwise,
2434 * claim the rest of the region and make sure the XLOG_STATE_WANT_SYNC
2435 * bit is on, so this will get flushed out. Don't update ic_offset
2436 * until you know exactly how many bytes get copied. Therefore, wait
2437 * until later to update ic_offset.
2439 * xlog_write() algorithm assumes that at least 2 xlog_op_header_t's
2440 * can fit into remaining data section.
2442 if (iclog
->ic_size
- iclog
->ic_offset
< 2*sizeof(xlog_op_header_t
)) {
2443 xlog_state_switch_iclogs(log
, iclog
, iclog
->ic_size
);
2446 * If I'm the only one writing to this iclog, sync it to disk.
2447 * We need to do an atomic compare and decrement here to avoid
2448 * racing with concurrent atomic_dec_and_lock() calls in
2449 * xlog_state_release_iclog() when there is more than one
2450 * reference to the iclog.
2452 if (!atomic_add_unless(&iclog
->ic_refcnt
, -1, 1)) {
2453 /* we are the only one */
2454 spin_unlock(&log
->l_icloglock
);
2455 error
= xlog_state_release_iclog(log
, iclog
);
2459 spin_unlock(&log
->l_icloglock
);
2464 /* Do we have enough room to write the full amount in the remainder
2465 * of this iclog? Or must we continue a write on the next iclog and
2466 * mark this iclog as completely taken? In the case where we switch
2467 * iclogs (to mark it taken), this particular iclog will release/sync
2468 * to disk in xlog_write().
2470 if (len
<= iclog
->ic_size
- iclog
->ic_offset
) {
2471 *continued_write
= 0;
2472 iclog
->ic_offset
+= len
;
2474 *continued_write
= 1;
2475 xlog_state_switch_iclogs(log
, iclog
, iclog
->ic_size
);
2479 ASSERT(iclog
->ic_offset
<= iclog
->ic_size
);
2480 spin_unlock(&log
->l_icloglock
);
2482 *logoffsetp
= log_offset
;
2484 } /* xlog_state_get_iclog_space */
2487 * Atomically get the log space required for a log ticket.
2489 * Once a ticket gets put onto the reserveq, it will only return after
2490 * the needed reservation is satisfied.
2492 * This function is structured so that it has a lock free fast path. This is
2493 * necessary because every new transaction reservation will come through this
2494 * path. Hence any lock will be globally hot if we take it unconditionally on
2497 * As tickets are only ever moved on and off the reserveq under the
2498 * l_grant_reserve_lock, we only need to take that lock if we are going
2499 * to add the ticket to the queue and sleep. We can avoid taking the lock if the
2500 * ticket was never added to the reserveq because the t_queue list head will be
2501 * empty and we hold the only reference to it so it can safely be checked
2505 xlog_grant_log_space(xlog_t
*log
,
2512 if (log
->l_flags
& XLOG_ACTIVE_RECOVERY
)
2513 panic("grant Recovery problem");
2516 trace_xfs_log_grant_enter(log
, tic
);
2518 need_bytes
= tic
->t_unit_res
;
2519 if (tic
->t_flags
& XFS_LOG_PERM_RESERV
)
2520 need_bytes
*= tic
->t_ocnt
;
2522 /* something is already sleeping; insert new transaction at end */
2523 if (!list_empty_careful(&log
->l_reserveq
)) {
2524 spin_lock(&log
->l_grant_reserve_lock
);
2525 /* recheck the queue now we are locked */
2526 if (list_empty(&log
->l_reserveq
)) {
2527 spin_unlock(&log
->l_grant_reserve_lock
);
2530 list_add_tail(&tic
->t_queue
, &log
->l_reserveq
);
2532 trace_xfs_log_grant_sleep1(log
, tic
);
2535 * Gotta check this before going to sleep, while we're
2536 * holding the grant lock.
2538 if (XLOG_FORCED_SHUTDOWN(log
))
2541 XFS_STATS_INC(xs_sleep_logspace
);
2542 xlog_wait(&tic
->t_wait
, &log
->l_grant_reserve_lock
);
2545 * If we got an error, and the filesystem is shutting down,
2546 * we'll catch it down below. So just continue...
2548 trace_xfs_log_grant_wake1(log
, tic
);
2552 if (XLOG_FORCED_SHUTDOWN(log
))
2553 goto error_return_unlocked
;
2555 free_bytes
= xlog_space_left(log
, &log
->l_grant_reserve_head
);
2556 if (free_bytes
< need_bytes
) {
2557 spin_lock(&log
->l_grant_reserve_lock
);
2558 if (list_empty(&tic
->t_queue
))
2559 list_add_tail(&tic
->t_queue
, &log
->l_reserveq
);
2561 trace_xfs_log_grant_sleep2(log
, tic
);
2563 if (XLOG_FORCED_SHUTDOWN(log
))
2566 xlog_grant_push_ail(log
, need_bytes
);
2568 XFS_STATS_INC(xs_sleep_logspace
);
2569 xlog_wait(&tic
->t_wait
, &log
->l_grant_reserve_lock
);
2571 trace_xfs_log_grant_wake2(log
, tic
);
2575 if (!list_empty(&tic
->t_queue
)) {
2576 spin_lock(&log
->l_grant_reserve_lock
);
2577 list_del_init(&tic
->t_queue
);
2578 spin_unlock(&log
->l_grant_reserve_lock
);
2581 /* we've got enough space */
2582 xlog_grant_add_space(log
, &log
->l_grant_reserve_head
, need_bytes
);
2583 xlog_grant_add_space(log
, &log
->l_grant_write_head
, need_bytes
);
2584 trace_xfs_log_grant_exit(log
, tic
);
2585 xlog_verify_grant_tail(log
);
2588 error_return_unlocked
:
2589 spin_lock(&log
->l_grant_reserve_lock
);
2591 list_del_init(&tic
->t_queue
);
2592 spin_unlock(&log
->l_grant_reserve_lock
);
2593 trace_xfs_log_grant_error(log
, tic
);
2596 * If we are failing, make sure the ticket doesn't have any
2597 * current reservations. We don't want to add this back when
2598 * the ticket/transaction gets cancelled.
2600 tic
->t_curr_res
= 0;
2601 tic
->t_cnt
= 0; /* ungrant will give back unit_res * t_cnt. */
2602 return XFS_ERROR(EIO
);
2603 } /* xlog_grant_log_space */
2607 * Replenish the byte reservation required by moving the grant write head.
2609 * Similar to xlog_grant_log_space, the function is structured to have a lock
2613 xlog_regrant_write_log_space(xlog_t
*log
,
2616 int free_bytes
, need_bytes
;
2618 tic
->t_curr_res
= tic
->t_unit_res
;
2619 xlog_tic_reset_res(tic
);
2625 if (log
->l_flags
& XLOG_ACTIVE_RECOVERY
)
2626 panic("regrant Recovery problem");
2629 trace_xfs_log_regrant_write_enter(log
, tic
);
2630 if (XLOG_FORCED_SHUTDOWN(log
))
2631 goto error_return_unlocked
;
2633 /* If there are other waiters on the queue then give them a
2634 * chance at logspace before us. Wake up the first waiters,
2635 * if we do not wake up all the waiters then go to sleep waiting
2636 * for more free space, otherwise try to get some space for
2639 need_bytes
= tic
->t_unit_res
;
2640 if (!list_empty_careful(&log
->l_writeq
)) {
2641 struct xlog_ticket
*ntic
;
2643 spin_lock(&log
->l_grant_write_lock
);
2644 free_bytes
= xlog_space_left(log
, &log
->l_grant_write_head
);
2645 list_for_each_entry(ntic
, &log
->l_writeq
, t_queue
) {
2646 ASSERT(ntic
->t_flags
& XLOG_TIC_PERM_RESERV
);
2648 if (free_bytes
< ntic
->t_unit_res
)
2650 free_bytes
-= ntic
->t_unit_res
;
2651 wake_up(&ntic
->t_wait
);
2654 if (ntic
!= list_first_entry(&log
->l_writeq
,
2655 struct xlog_ticket
, t_queue
)) {
2656 if (list_empty(&tic
->t_queue
))
2657 list_add_tail(&tic
->t_queue
, &log
->l_writeq
);
2658 trace_xfs_log_regrant_write_sleep1(log
, tic
);
2660 xlog_grant_push_ail(log
, need_bytes
);
2662 XFS_STATS_INC(xs_sleep_logspace
);
2663 xlog_wait(&tic
->t_wait
, &log
->l_grant_write_lock
);
2664 trace_xfs_log_regrant_write_wake1(log
, tic
);
2666 spin_unlock(&log
->l_grant_write_lock
);
2670 if (XLOG_FORCED_SHUTDOWN(log
))
2671 goto error_return_unlocked
;
2673 free_bytes
= xlog_space_left(log
, &log
->l_grant_write_head
);
2674 if (free_bytes
< need_bytes
) {
2675 spin_lock(&log
->l_grant_write_lock
);
2676 if (list_empty(&tic
->t_queue
))
2677 list_add_tail(&tic
->t_queue
, &log
->l_writeq
);
2679 if (XLOG_FORCED_SHUTDOWN(log
))
2682 xlog_grant_push_ail(log
, need_bytes
);
2684 XFS_STATS_INC(xs_sleep_logspace
);
2685 trace_xfs_log_regrant_write_sleep2(log
, tic
);
2686 xlog_wait(&tic
->t_wait
, &log
->l_grant_write_lock
);
2688 trace_xfs_log_regrant_write_wake2(log
, tic
);
2692 if (!list_empty(&tic
->t_queue
)) {
2693 spin_lock(&log
->l_grant_write_lock
);
2694 list_del_init(&tic
->t_queue
);
2695 spin_unlock(&log
->l_grant_write_lock
);
2698 /* we've got enough space */
2699 xlog_grant_add_space(log
, &log
->l_grant_write_head
, need_bytes
);
2700 trace_xfs_log_regrant_write_exit(log
, tic
);
2701 xlog_verify_grant_tail(log
);
2705 error_return_unlocked
:
2706 spin_lock(&log
->l_grant_write_lock
);
2708 list_del_init(&tic
->t_queue
);
2709 spin_unlock(&log
->l_grant_write_lock
);
2710 trace_xfs_log_regrant_write_error(log
, tic
);
2713 * If we are failing, make sure the ticket doesn't have any
2714 * current reservations. We don't want to add this back when
2715 * the ticket/transaction gets cancelled.
2717 tic
->t_curr_res
= 0;
2718 tic
->t_cnt
= 0; /* ungrant will give back unit_res * t_cnt. */
2719 return XFS_ERROR(EIO
);
2720 } /* xlog_regrant_write_log_space */
2723 /* The first cnt-1 times through here we don't need to
2724 * move the grant write head because the permanent
2725 * reservation has reserved cnt times the unit amount.
2726 * Release part of current permanent unit reservation and
2727 * reset current reservation to be one units worth. Also
2728 * move grant reservation head forward.
2731 xlog_regrant_reserve_log_space(xlog_t
*log
,
2732 xlog_ticket_t
*ticket
)
2734 trace_xfs_log_regrant_reserve_enter(log
, ticket
);
2736 if (ticket
->t_cnt
> 0)
2739 xlog_grant_sub_space(log
, &log
->l_grant_reserve_head
,
2740 ticket
->t_curr_res
);
2741 xlog_grant_sub_space(log
, &log
->l_grant_write_head
,
2742 ticket
->t_curr_res
);
2743 ticket
->t_curr_res
= ticket
->t_unit_res
;
2744 xlog_tic_reset_res(ticket
);
2746 trace_xfs_log_regrant_reserve_sub(log
, ticket
);
2748 /* just return if we still have some of the pre-reserved space */
2749 if (ticket
->t_cnt
> 0)
2752 xlog_grant_add_space(log
, &log
->l_grant_reserve_head
,
2753 ticket
->t_unit_res
);
2755 trace_xfs_log_regrant_reserve_exit(log
, ticket
);
2757 ticket
->t_curr_res
= ticket
->t_unit_res
;
2758 xlog_tic_reset_res(ticket
);
2759 } /* xlog_regrant_reserve_log_space */
2763 * Give back the space left from a reservation.
2765 * All the information we need to make a correct determination of space left
2766 * is present. For non-permanent reservations, things are quite easy. The
2767 * count should have been decremented to zero. We only need to deal with the
2768 * space remaining in the current reservation part of the ticket. If the
2769 * ticket contains a permanent reservation, there may be left over space which
2770 * needs to be released. A count of N means that N-1 refills of the current
2771 * reservation can be done before we need to ask for more space. The first
2772 * one goes to fill up the first current reservation. Once we run out of
2773 * space, the count will stay at zero and the only space remaining will be
2774 * in the current reservation field.
2777 xlog_ungrant_log_space(xlog_t
*log
,
2778 xlog_ticket_t
*ticket
)
2782 if (ticket
->t_cnt
> 0)
2785 trace_xfs_log_ungrant_enter(log
, ticket
);
2786 trace_xfs_log_ungrant_sub(log
, ticket
);
2789 * If this is a permanent reservation ticket, we may be able to free
2790 * up more space based on the remaining count.
2792 bytes
= ticket
->t_curr_res
;
2793 if (ticket
->t_cnt
> 0) {
2794 ASSERT(ticket
->t_flags
& XLOG_TIC_PERM_RESERV
);
2795 bytes
+= ticket
->t_unit_res
*ticket
->t_cnt
;
2798 xlog_grant_sub_space(log
, &log
->l_grant_reserve_head
, bytes
);
2799 xlog_grant_sub_space(log
, &log
->l_grant_write_head
, bytes
);
2801 trace_xfs_log_ungrant_exit(log
, ticket
);
2803 xfs_log_move_tail(log
->l_mp
, 1);
2804 } /* xlog_ungrant_log_space */
2808 * Flush iclog to disk if this is the last reference to the given iclog and
2809 * the WANT_SYNC bit is set.
2811 * When this function is entered, the iclog is not necessarily in the
2812 * WANT_SYNC state. It may be sitting around waiting to get filled.
2817 xlog_state_release_iclog(
2819 xlog_in_core_t
*iclog
)
2821 int sync
= 0; /* do we sync? */
2823 if (iclog
->ic_state
& XLOG_STATE_IOERROR
)
2824 return XFS_ERROR(EIO
);
2826 ASSERT(atomic_read(&iclog
->ic_refcnt
) > 0);
2827 if (!atomic_dec_and_lock(&iclog
->ic_refcnt
, &log
->l_icloglock
))
2830 if (iclog
->ic_state
& XLOG_STATE_IOERROR
) {
2831 spin_unlock(&log
->l_icloglock
);
2832 return XFS_ERROR(EIO
);
2834 ASSERT(iclog
->ic_state
== XLOG_STATE_ACTIVE
||
2835 iclog
->ic_state
== XLOG_STATE_WANT_SYNC
);
2837 if (iclog
->ic_state
== XLOG_STATE_WANT_SYNC
) {
2838 /* update tail before writing to iclog */
2839 xfs_lsn_t tail_lsn
= xlog_assign_tail_lsn(log
->l_mp
);
2841 iclog
->ic_state
= XLOG_STATE_SYNCING
;
2842 iclog
->ic_header
.h_tail_lsn
= cpu_to_be64(tail_lsn
);
2843 xlog_verify_tail_lsn(log
, iclog
, tail_lsn
);
2844 /* cycle incremented when incrementing curr_block */
2846 spin_unlock(&log
->l_icloglock
);
2849 * We let the log lock go, so it's possible that we hit a log I/O
2850 * error or some other SHUTDOWN condition that marks the iclog
2851 * as XLOG_STATE_IOERROR before the bwrite. However, we know that
2852 * this iclog has consistent data, so we ignore IOERROR
2853 * flags after this point.
2856 return xlog_sync(log
, iclog
);
2858 } /* xlog_state_release_iclog */
2862 * This routine will mark the current iclog in the ring as WANT_SYNC
2863 * and move the current iclog pointer to the next iclog in the ring.
2864 * When this routine is called from xlog_state_get_iclog_space(), the
2865 * exact size of the iclog has not yet been determined. All we know is
2866 * that every data block. We have run out of space in this log record.
2869 xlog_state_switch_iclogs(xlog_t
*log
,
2870 xlog_in_core_t
*iclog
,
2873 ASSERT(iclog
->ic_state
== XLOG_STATE_ACTIVE
);
2875 eventual_size
= iclog
->ic_offset
;
2876 iclog
->ic_state
= XLOG_STATE_WANT_SYNC
;
2877 iclog
->ic_header
.h_prev_block
= cpu_to_be32(log
->l_prev_block
);
2878 log
->l_prev_block
= log
->l_curr_block
;
2879 log
->l_prev_cycle
= log
->l_curr_cycle
;
2881 /* roll log?: ic_offset changed later */
2882 log
->l_curr_block
+= BTOBB(eventual_size
)+BTOBB(log
->l_iclog_hsize
);
2884 /* Round up to next log-sunit */
2885 if (xfs_sb_version_haslogv2(&log
->l_mp
->m_sb
) &&
2886 log
->l_mp
->m_sb
.sb_logsunit
> 1) {
2887 __uint32_t sunit_bb
= BTOBB(log
->l_mp
->m_sb
.sb_logsunit
);
2888 log
->l_curr_block
= roundup(log
->l_curr_block
, sunit_bb
);
2891 if (log
->l_curr_block
>= log
->l_logBBsize
) {
2892 log
->l_curr_cycle
++;
2893 if (log
->l_curr_cycle
== XLOG_HEADER_MAGIC_NUM
)
2894 log
->l_curr_cycle
++;
2895 log
->l_curr_block
-= log
->l_logBBsize
;
2896 ASSERT(log
->l_curr_block
>= 0);
2898 ASSERT(iclog
== log
->l_iclog
);
2899 log
->l_iclog
= iclog
->ic_next
;
2900 } /* xlog_state_switch_iclogs */
2903 * Write out all data in the in-core log as of this exact moment in time.
2905 * Data may be written to the in-core log during this call. However,
2906 * we don't guarantee this data will be written out. A change from past
2907 * implementation means this routine will *not* write out zero length LRs.
2909 * Basically, we try and perform an intelligent scan of the in-core logs.
2910 * If we determine there is no flushable data, we just return. There is no
2911 * flushable data if:
2913 * 1. the current iclog is active and has no data; the previous iclog
2914 * is in the active or dirty state.
2915 * 2. the current iclog is drity, and the previous iclog is in the
2916 * active or dirty state.
2920 * 1. the current iclog is not in the active nor dirty state.
2921 * 2. the current iclog dirty, and the previous iclog is not in the
2922 * active nor dirty state.
2923 * 3. the current iclog is active, and there is another thread writing
2924 * to this particular iclog.
2925 * 4. a) the current iclog is active and has no other writers
2926 * b) when we return from flushing out this iclog, it is still
2927 * not in the active nor dirty state.
2931 struct xfs_mount
*mp
,
2935 struct log
*log
= mp
->m_log
;
2936 struct xlog_in_core
*iclog
;
2939 XFS_STATS_INC(xs_log_force
);
2942 xlog_cil_force(log
);
2944 spin_lock(&log
->l_icloglock
);
2946 iclog
= log
->l_iclog
;
2947 if (iclog
->ic_state
& XLOG_STATE_IOERROR
) {
2948 spin_unlock(&log
->l_icloglock
);
2949 return XFS_ERROR(EIO
);
2952 /* If the head iclog is not active nor dirty, we just attach
2953 * ourselves to the head and go to sleep.
2955 if (iclog
->ic_state
== XLOG_STATE_ACTIVE
||
2956 iclog
->ic_state
== XLOG_STATE_DIRTY
) {
2958 * If the head is dirty or (active and empty), then
2959 * we need to look at the previous iclog. If the previous
2960 * iclog is active or dirty we are done. There is nothing
2961 * to sync out. Otherwise, we attach ourselves to the
2962 * previous iclog and go to sleep.
2964 if (iclog
->ic_state
== XLOG_STATE_DIRTY
||
2965 (atomic_read(&iclog
->ic_refcnt
) == 0
2966 && iclog
->ic_offset
== 0)) {
2967 iclog
= iclog
->ic_prev
;
2968 if (iclog
->ic_state
== XLOG_STATE_ACTIVE
||
2969 iclog
->ic_state
== XLOG_STATE_DIRTY
)
2974 if (atomic_read(&iclog
->ic_refcnt
) == 0) {
2975 /* We are the only one with access to this
2976 * iclog. Flush it out now. There should
2977 * be a roundoff of zero to show that someone
2978 * has already taken care of the roundoff from
2979 * the previous sync.
2981 atomic_inc(&iclog
->ic_refcnt
);
2982 lsn
= be64_to_cpu(iclog
->ic_header
.h_lsn
);
2983 xlog_state_switch_iclogs(log
, iclog
, 0);
2984 spin_unlock(&log
->l_icloglock
);
2986 if (xlog_state_release_iclog(log
, iclog
))
2987 return XFS_ERROR(EIO
);
2991 spin_lock(&log
->l_icloglock
);
2992 if (be64_to_cpu(iclog
->ic_header
.h_lsn
) == lsn
&&
2993 iclog
->ic_state
!= XLOG_STATE_DIRTY
)
2998 /* Someone else is writing to this iclog.
2999 * Use its call to flush out the data. However,
3000 * the other thread may not force out this LR,
3001 * so we mark it WANT_SYNC.
3003 xlog_state_switch_iclogs(log
, iclog
, 0);
3009 /* By the time we come around again, the iclog could've been filled
3010 * which would give it another lsn. If we have a new lsn, just
3011 * return because the relevant data has been flushed.
3014 if (flags
& XFS_LOG_SYNC
) {
3016 * We must check if we're shutting down here, before
3017 * we wait, while we're holding the l_icloglock.
3018 * Then we check again after waking up, in case our
3019 * sleep was disturbed by a bad news.
3021 if (iclog
->ic_state
& XLOG_STATE_IOERROR
) {
3022 spin_unlock(&log
->l_icloglock
);
3023 return XFS_ERROR(EIO
);
3025 XFS_STATS_INC(xs_log_force_sleep
);
3026 xlog_wait(&iclog
->ic_force_wait
, &log
->l_icloglock
);
3028 * No need to grab the log lock here since we're
3029 * only deciding whether or not to return EIO
3030 * and the memory read should be atomic.
3032 if (iclog
->ic_state
& XLOG_STATE_IOERROR
)
3033 return XFS_ERROR(EIO
);
3039 spin_unlock(&log
->l_icloglock
);
3045 * Wrapper for _xfs_log_force(), to be used when caller doesn't care
3046 * about errors or whether the log was flushed or not. This is the normal
3047 * interface to use when trying to unpin items or move the log forward.
3056 error
= _xfs_log_force(mp
, flags
, NULL
);
3058 xfs_warn(mp
, "%s: error %d returned.", __func__
, error
);
3062 * Force the in-core log to disk for a specific LSN.
3064 * Find in-core log with lsn.
3065 * If it is in the DIRTY state, just return.
3066 * If it is in the ACTIVE state, move the in-core log into the WANT_SYNC
3067 * state and go to sleep or return.
3068 * If it is in any other state, go to sleep or return.
3070 * Synchronous forces are implemented with a signal variable. All callers
3071 * to force a given lsn to disk will wait on a the sv attached to the
3072 * specific in-core log. When given in-core log finally completes its
3073 * write to disk, that thread will wake up all threads waiting on the
3078 struct xfs_mount
*mp
,
3083 struct log
*log
= mp
->m_log
;
3084 struct xlog_in_core
*iclog
;
3085 int already_slept
= 0;
3089 XFS_STATS_INC(xs_log_force
);
3092 lsn
= xlog_cil_force_lsn(log
, lsn
);
3093 if (lsn
== NULLCOMMITLSN
)
3098 spin_lock(&log
->l_icloglock
);
3099 iclog
= log
->l_iclog
;
3100 if (iclog
->ic_state
& XLOG_STATE_IOERROR
) {
3101 spin_unlock(&log
->l_icloglock
);
3102 return XFS_ERROR(EIO
);
3106 if (be64_to_cpu(iclog
->ic_header
.h_lsn
) != lsn
) {
3107 iclog
= iclog
->ic_next
;
3111 if (iclog
->ic_state
== XLOG_STATE_DIRTY
) {
3112 spin_unlock(&log
->l_icloglock
);
3116 if (iclog
->ic_state
== XLOG_STATE_ACTIVE
) {
3118 * We sleep here if we haven't already slept (e.g.
3119 * this is the first time we've looked at the correct
3120 * iclog buf) and the buffer before us is going to
3121 * be sync'ed. The reason for this is that if we
3122 * are doing sync transactions here, by waiting for
3123 * the previous I/O to complete, we can allow a few
3124 * more transactions into this iclog before we close
3127 * Otherwise, we mark the buffer WANT_SYNC, and bump
3128 * up the refcnt so we can release the log (which
3129 * drops the ref count). The state switch keeps new
3130 * transaction commits from using this buffer. When
3131 * the current commits finish writing into the buffer,
3132 * the refcount will drop to zero and the buffer will
3135 if (!already_slept
&&
3136 (iclog
->ic_prev
->ic_state
&
3137 (XLOG_STATE_WANT_SYNC
| XLOG_STATE_SYNCING
))) {
3138 ASSERT(!(iclog
->ic_state
& XLOG_STATE_IOERROR
));
3140 XFS_STATS_INC(xs_log_force_sleep
);
3142 xlog_wait(&iclog
->ic_prev
->ic_write_wait
,
3149 atomic_inc(&iclog
->ic_refcnt
);
3150 xlog_state_switch_iclogs(log
, iclog
, 0);
3151 spin_unlock(&log
->l_icloglock
);
3152 if (xlog_state_release_iclog(log
, iclog
))
3153 return XFS_ERROR(EIO
);
3156 spin_lock(&log
->l_icloglock
);
3159 if ((flags
& XFS_LOG_SYNC
) && /* sleep */
3161 (XLOG_STATE_ACTIVE
| XLOG_STATE_DIRTY
))) {
3163 * Don't wait on completion if we know that we've
3164 * gotten a log write error.
3166 if (iclog
->ic_state
& XLOG_STATE_IOERROR
) {
3167 spin_unlock(&log
->l_icloglock
);
3168 return XFS_ERROR(EIO
);
3170 XFS_STATS_INC(xs_log_force_sleep
);
3171 xlog_wait(&iclog
->ic_force_wait
, &log
->l_icloglock
);
3173 * No need to grab the log lock here since we're
3174 * only deciding whether or not to return EIO
3175 * and the memory read should be atomic.
3177 if (iclog
->ic_state
& XLOG_STATE_IOERROR
)
3178 return XFS_ERROR(EIO
);
3182 } else { /* just return */
3183 spin_unlock(&log
->l_icloglock
);
3187 } while (iclog
!= log
->l_iclog
);
3189 spin_unlock(&log
->l_icloglock
);
3194 * Wrapper for _xfs_log_force_lsn(), to be used when caller doesn't care
3195 * about errors or whether the log was flushed or not. This is the normal
3196 * interface to use when trying to unpin items or move the log forward.
3206 error
= _xfs_log_force_lsn(mp
, lsn
, flags
, NULL
);
3208 xfs_warn(mp
, "%s: error %d returned.", __func__
, error
);
3212 * Called when we want to mark the current iclog as being ready to sync to
3216 xlog_state_want_sync(xlog_t
*log
, xlog_in_core_t
*iclog
)
3218 assert_spin_locked(&log
->l_icloglock
);
3220 if (iclog
->ic_state
== XLOG_STATE_ACTIVE
) {
3221 xlog_state_switch_iclogs(log
, iclog
, 0);
3223 ASSERT(iclog
->ic_state
&
3224 (XLOG_STATE_WANT_SYNC
|XLOG_STATE_IOERROR
));
3229 /*****************************************************************************
3233 *****************************************************************************
3237 * Free a used ticket when its refcount falls to zero.
3241 xlog_ticket_t
*ticket
)
3243 ASSERT(atomic_read(&ticket
->t_ref
) > 0);
3244 if (atomic_dec_and_test(&ticket
->t_ref
))
3245 kmem_zone_free(xfs_log_ticket_zone
, ticket
);
3250 xlog_ticket_t
*ticket
)
3252 ASSERT(atomic_read(&ticket
->t_ref
) > 0);
3253 atomic_inc(&ticket
->t_ref
);
3258 * Allocate and initialise a new log ticket.
3269 struct xlog_ticket
*tic
;
3273 tic
= kmem_zone_zalloc(xfs_log_ticket_zone
, alloc_flags
);
3278 * Permanent reservations have up to 'cnt'-1 active log operations
3279 * in the log. A unit in this case is the amount of space for one
3280 * of these log operations. Normal reservations have a cnt of 1
3281 * and their unit amount is the total amount of space required.
3283 * The following lines of code account for non-transaction data
3284 * which occupy space in the on-disk log.
3286 * Normal form of a transaction is:
3287 * <oph><trans-hdr><start-oph><reg1-oph><reg1><reg2-oph>...<commit-oph>
3288 * and then there are LR hdrs, split-recs and roundoff at end of syncs.
3290 * We need to account for all the leadup data and trailer data
3291 * around the transaction data.
3292 * And then we need to account for the worst case in terms of using
3294 * The worst case will happen if:
3295 * - the placement of the transaction happens to be such that the
3296 * roundoff is at its maximum
3297 * - the transaction data is synced before the commit record is synced
3298 * i.e. <transaction-data><roundoff> | <commit-rec><roundoff>
3299 * Therefore the commit record is in its own Log Record.
3300 * This can happen as the commit record is called with its
3301 * own region to xlog_write().
3302 * This then means that in the worst case, roundoff can happen for
3303 * the commit-rec as well.
3304 * The commit-rec is smaller than padding in this scenario and so it is
3305 * not added separately.
3308 /* for trans header */
3309 unit_bytes
+= sizeof(xlog_op_header_t
);
3310 unit_bytes
+= sizeof(xfs_trans_header_t
);
3313 unit_bytes
+= sizeof(xlog_op_header_t
);
3316 * for LR headers - the space for data in an iclog is the size minus
3317 * the space used for the headers. If we use the iclog size, then we
3318 * undercalculate the number of headers required.
3320 * Furthermore - the addition of op headers for split-recs might
3321 * increase the space required enough to require more log and op
3322 * headers, so take that into account too.
3324 * IMPORTANT: This reservation makes the assumption that if this
3325 * transaction is the first in an iclog and hence has the LR headers
3326 * accounted to it, then the remaining space in the iclog is
3327 * exclusively for this transaction. i.e. if the transaction is larger
3328 * than the iclog, it will be the only thing in that iclog.
3329 * Fundamentally, this means we must pass the entire log vector to
3330 * xlog_write to guarantee this.
3332 iclog_space
= log
->l_iclog_size
- log
->l_iclog_hsize
;
3333 num_headers
= howmany(unit_bytes
, iclog_space
);
3335 /* for split-recs - ophdrs added when data split over LRs */
3336 unit_bytes
+= sizeof(xlog_op_header_t
) * num_headers
;
3338 /* add extra header reservations if we overrun */
3339 while (!num_headers
||
3340 howmany(unit_bytes
, iclog_space
) > num_headers
) {
3341 unit_bytes
+= sizeof(xlog_op_header_t
);
3344 unit_bytes
+= log
->l_iclog_hsize
* num_headers
;
3346 /* for commit-rec LR header - note: padding will subsume the ophdr */
3347 unit_bytes
+= log
->l_iclog_hsize
;
3349 /* for roundoff padding for transaction data and one for commit record */
3350 if (xfs_sb_version_haslogv2(&log
->l_mp
->m_sb
) &&
3351 log
->l_mp
->m_sb
.sb_logsunit
> 1) {
3352 /* log su roundoff */
3353 unit_bytes
+= 2*log
->l_mp
->m_sb
.sb_logsunit
;
3356 unit_bytes
+= 2*BBSIZE
;
3359 atomic_set(&tic
->t_ref
, 1);
3360 INIT_LIST_HEAD(&tic
->t_queue
);
3361 tic
->t_unit_res
= unit_bytes
;
3362 tic
->t_curr_res
= unit_bytes
;
3365 tic
->t_tid
= random32();
3366 tic
->t_clientid
= client
;
3367 tic
->t_flags
= XLOG_TIC_INITED
;
3368 tic
->t_trans_type
= 0;
3369 if (xflags
& XFS_LOG_PERM_RESERV
)
3370 tic
->t_flags
|= XLOG_TIC_PERM_RESERV
;
3371 init_waitqueue_head(&tic
->t_wait
);
3373 xlog_tic_reset_res(tic
);
3379 /******************************************************************************
3381 * Log debug routines
3383 ******************************************************************************
3387 * Make sure that the destination ptr is within the valid data region of
3388 * one of the iclogs. This uses backup pointers stored in a different
3389 * part of the log in case we trash the log structure.
3392 xlog_verify_dest_ptr(
3399 for (i
= 0; i
< log
->l_iclog_bufs
; i
++) {
3400 if (ptr
>= log
->l_iclog_bak
[i
] &&
3401 ptr
<= log
->l_iclog_bak
[i
] + log
->l_iclog_size
)
3406 xfs_emerg(log
->l_mp
, "%s: invalid ptr", __func__
);
3410 * Check to make sure the grant write head didn't just over lap the tail. If
3411 * the cycles are the same, we can't be overlapping. Otherwise, make sure that
3412 * the cycles differ by exactly one and check the byte count.
3414 * This check is run unlocked, so can give false positives. Rather than assert
3415 * on failures, use a warn-once flag and a panic tag to allow the admin to
3416 * determine if they want to panic the machine when such an error occurs. For
3417 * debug kernels this will have the same effect as using an assert but, unlinke
3418 * an assert, it can be turned off at runtime.
3421 xlog_verify_grant_tail(
3424 int tail_cycle
, tail_blocks
;
3427 xlog_crack_grant_head(&log
->l_grant_write_head
, &cycle
, &space
);
3428 xlog_crack_atomic_lsn(&log
->l_tail_lsn
, &tail_cycle
, &tail_blocks
);
3429 if (tail_cycle
!= cycle
) {
3430 if (cycle
- 1 != tail_cycle
&&
3431 !(log
->l_flags
& XLOG_TAIL_WARN
)) {
3432 xfs_alert_tag(log
->l_mp
, XFS_PTAG_LOGRES
,
3433 "%s: cycle - 1 != tail_cycle", __func__
);
3434 log
->l_flags
|= XLOG_TAIL_WARN
;
3437 if (space
> BBTOB(tail_blocks
) &&
3438 !(log
->l_flags
& XLOG_TAIL_WARN
)) {
3439 xfs_alert_tag(log
->l_mp
, XFS_PTAG_LOGRES
,
3440 "%s: space > BBTOB(tail_blocks)", __func__
);
3441 log
->l_flags
|= XLOG_TAIL_WARN
;
3446 /* check if it will fit */
3448 xlog_verify_tail_lsn(xlog_t
*log
,
3449 xlog_in_core_t
*iclog
,
3454 if (CYCLE_LSN(tail_lsn
) == log
->l_prev_cycle
) {
3456 log
->l_logBBsize
- (log
->l_prev_block
- BLOCK_LSN(tail_lsn
));
3457 if (blocks
< BTOBB(iclog
->ic_offset
)+BTOBB(log
->l_iclog_hsize
))
3458 xfs_emerg(log
->l_mp
, "%s: ran out of log space", __func__
);
3460 ASSERT(CYCLE_LSN(tail_lsn
)+1 == log
->l_prev_cycle
);
3462 if (BLOCK_LSN(tail_lsn
) == log
->l_prev_block
)
3463 xfs_emerg(log
->l_mp
, "%s: tail wrapped", __func__
);
3465 blocks
= BLOCK_LSN(tail_lsn
) - log
->l_prev_block
;
3466 if (blocks
< BTOBB(iclog
->ic_offset
) + 1)
3467 xfs_emerg(log
->l_mp
, "%s: ran out of log space", __func__
);
3469 } /* xlog_verify_tail_lsn */
3472 * Perform a number of checks on the iclog before writing to disk.
3474 * 1. Make sure the iclogs are still circular
3475 * 2. Make sure we have a good magic number
3476 * 3. Make sure we don't have magic numbers in the data
3477 * 4. Check fields of each log operation header for:
3478 * A. Valid client identifier
3479 * B. tid ptr value falls in valid ptr space (user space code)
3480 * C. Length in log record header is correct according to the
3481 * individual operation headers within record.
3482 * 5. When a bwrite will occur within 5 blocks of the front of the physical
3483 * log, check the preceding blocks of the physical log to make sure all
3484 * the cycle numbers agree with the current cycle number.
3487 xlog_verify_iclog(xlog_t
*log
,
3488 xlog_in_core_t
*iclog
,
3492 xlog_op_header_t
*ophead
;
3493 xlog_in_core_t
*icptr
;
3494 xlog_in_core_2_t
*xhdr
;
3496 xfs_caddr_t base_ptr
;
3497 __psint_t field_offset
;
3499 int len
, i
, j
, k
, op_len
;
3502 /* check validity of iclog pointers */
3503 spin_lock(&log
->l_icloglock
);
3504 icptr
= log
->l_iclog
;
3505 for (i
=0; i
< log
->l_iclog_bufs
; i
++) {
3507 xfs_emerg(log
->l_mp
, "%s: invalid ptr", __func__
);
3508 icptr
= icptr
->ic_next
;
3510 if (icptr
!= log
->l_iclog
)
3511 xfs_emerg(log
->l_mp
, "%s: corrupt iclog ring", __func__
);
3512 spin_unlock(&log
->l_icloglock
);
3514 /* check log magic numbers */
3515 if (be32_to_cpu(iclog
->ic_header
.h_magicno
) != XLOG_HEADER_MAGIC_NUM
)
3516 xfs_emerg(log
->l_mp
, "%s: invalid magic num", __func__
);
3518 ptr
= (xfs_caddr_t
) &iclog
->ic_header
;
3519 for (ptr
+= BBSIZE
; ptr
< ((xfs_caddr_t
)&iclog
->ic_header
) + count
;
3521 if (be32_to_cpu(*(__be32
*)ptr
) == XLOG_HEADER_MAGIC_NUM
)
3522 xfs_emerg(log
->l_mp
, "%s: unexpected magic num",
3527 len
= be32_to_cpu(iclog
->ic_header
.h_num_logops
);
3528 ptr
= iclog
->ic_datap
;
3530 ophead
= (xlog_op_header_t
*)ptr
;
3531 xhdr
= iclog
->ic_data
;
3532 for (i
= 0; i
< len
; i
++) {
3533 ophead
= (xlog_op_header_t
*)ptr
;
3535 /* clientid is only 1 byte */
3536 field_offset
= (__psint_t
)
3537 ((xfs_caddr_t
)&(ophead
->oh_clientid
) - base_ptr
);
3538 if (syncing
== B_FALSE
|| (field_offset
& 0x1ff)) {
3539 clientid
= ophead
->oh_clientid
;
3541 idx
= BTOBBT((xfs_caddr_t
)&(ophead
->oh_clientid
) - iclog
->ic_datap
);
3542 if (idx
>= (XLOG_HEADER_CYCLE_SIZE
/ BBSIZE
)) {
3543 j
= idx
/ (XLOG_HEADER_CYCLE_SIZE
/ BBSIZE
);
3544 k
= idx
% (XLOG_HEADER_CYCLE_SIZE
/ BBSIZE
);
3545 clientid
= xlog_get_client_id(
3546 xhdr
[j
].hic_xheader
.xh_cycle_data
[k
]);
3548 clientid
= xlog_get_client_id(
3549 iclog
->ic_header
.h_cycle_data
[idx
]);
3552 if (clientid
!= XFS_TRANSACTION
&& clientid
!= XFS_LOG
)
3554 "%s: invalid clientid %d op 0x%p offset 0x%lx",
3555 __func__
, clientid
, ophead
,
3556 (unsigned long)field_offset
);
3559 field_offset
= (__psint_t
)
3560 ((xfs_caddr_t
)&(ophead
->oh_len
) - base_ptr
);
3561 if (syncing
== B_FALSE
|| (field_offset
& 0x1ff)) {
3562 op_len
= be32_to_cpu(ophead
->oh_len
);
3564 idx
= BTOBBT((__psint_t
)&ophead
->oh_len
-
3565 (__psint_t
)iclog
->ic_datap
);
3566 if (idx
>= (XLOG_HEADER_CYCLE_SIZE
/ BBSIZE
)) {
3567 j
= idx
/ (XLOG_HEADER_CYCLE_SIZE
/ BBSIZE
);
3568 k
= idx
% (XLOG_HEADER_CYCLE_SIZE
/ BBSIZE
);
3569 op_len
= be32_to_cpu(xhdr
[j
].hic_xheader
.xh_cycle_data
[k
]);
3571 op_len
= be32_to_cpu(iclog
->ic_header
.h_cycle_data
[idx
]);
3574 ptr
+= sizeof(xlog_op_header_t
) + op_len
;
3576 } /* xlog_verify_iclog */
3580 * Mark all iclogs IOERROR. l_icloglock is held by the caller.
3586 xlog_in_core_t
*iclog
, *ic
;
3588 iclog
= log
->l_iclog
;
3589 if (! (iclog
->ic_state
& XLOG_STATE_IOERROR
)) {
3591 * Mark all the incore logs IOERROR.
3592 * From now on, no log flushes will result.
3596 ic
->ic_state
= XLOG_STATE_IOERROR
;
3598 } while (ic
!= iclog
);
3602 * Return non-zero, if state transition has already happened.
3608 * This is called from xfs_force_shutdown, when we're forcibly
3609 * shutting down the filesystem, typically because of an IO error.
3610 * Our main objectives here are to make sure that:
3611 * a. the filesystem gets marked 'SHUTDOWN' for all interested
3612 * parties to find out, 'atomically'.
3613 * b. those who're sleeping on log reservations, pinned objects and
3614 * other resources get woken up, and be told the bad news.
3615 * c. nothing new gets queued up after (a) and (b) are done.
3616 * d. if !logerror, flush the iclogs to disk, then seal them off
3619 * Note: for delayed logging the !logerror case needs to flush the regions
3620 * held in memory out to the iclogs before flushing them to disk. This needs
3621 * to be done before the log is marked as shutdown, otherwise the flush to the
3625 xfs_log_force_umount(
3626 struct xfs_mount
*mp
,
3636 * If this happens during log recovery, don't worry about
3637 * locking; the log isn't open for business yet.
3640 log
->l_flags
& XLOG_ACTIVE_RECOVERY
) {
3641 mp
->m_flags
|= XFS_MOUNT_FS_SHUTDOWN
;
3643 XFS_BUF_DONE(mp
->m_sb_bp
);
3648 * Somebody could've already done the hard work for us.
3649 * No need to get locks for this.
3651 if (logerror
&& log
->l_iclog
->ic_state
& XLOG_STATE_IOERROR
) {
3652 ASSERT(XLOG_FORCED_SHUTDOWN(log
));
3658 * Flush the in memory commit item list before marking the log as
3659 * being shut down. We need to do it in this order to ensure all the
3660 * completed transactions are flushed to disk with the xfs_log_force()
3663 if (!logerror
&& (mp
->m_flags
& XFS_MOUNT_DELAYLOG
))
3664 xlog_cil_force(log
);
3667 * mark the filesystem and the as in a shutdown state and wake
3668 * everybody up to tell them the bad news.
3670 spin_lock(&log
->l_icloglock
);
3671 mp
->m_flags
|= XFS_MOUNT_FS_SHUTDOWN
;
3673 XFS_BUF_DONE(mp
->m_sb_bp
);
3676 * This flag is sort of redundant because of the mount flag, but
3677 * it's good to maintain the separation between the log and the rest
3680 log
->l_flags
|= XLOG_IO_ERROR
;
3683 * If we hit a log error, we want to mark all the iclogs IOERROR
3684 * while we're still holding the loglock.
3687 retval
= xlog_state_ioerror(log
);
3688 spin_unlock(&log
->l_icloglock
);
3691 * We don't want anybody waiting for log reservations after this. That
3692 * means we have to wake up everybody queued up on reserveq as well as
3693 * writeq. In addition, we make sure in xlog_{re}grant_log_space that
3694 * we don't enqueue anything once the SHUTDOWN flag is set, and this
3695 * action is protected by the grant locks.
3697 spin_lock(&log
->l_grant_reserve_lock
);
3698 list_for_each_entry(tic
, &log
->l_reserveq
, t_queue
)
3699 wake_up(&tic
->t_wait
);
3700 spin_unlock(&log
->l_grant_reserve_lock
);
3702 spin_lock(&log
->l_grant_write_lock
);
3703 list_for_each_entry(tic
, &log
->l_writeq
, t_queue
)
3704 wake_up(&tic
->t_wait
);
3705 spin_unlock(&log
->l_grant_write_lock
);
3707 if (!(log
->l_iclog
->ic_state
& XLOG_STATE_IOERROR
)) {
3710 * Force the incore logs to disk before shutting the
3711 * log down completely.
3713 _xfs_log_force(mp
, XFS_LOG_SYNC
, NULL
);
3715 spin_lock(&log
->l_icloglock
);
3716 retval
= xlog_state_ioerror(log
);
3717 spin_unlock(&log
->l_icloglock
);
3720 * Wake up everybody waiting on xfs_log_force.
3721 * Callback all log item committed functions as if the
3722 * log writes were completed.
3724 xlog_state_do_callback(log
, XFS_LI_ABORTED
, NULL
);
3726 #ifdef XFSERRORDEBUG
3728 xlog_in_core_t
*iclog
;
3730 spin_lock(&log
->l_icloglock
);
3731 iclog
= log
->l_iclog
;
3733 ASSERT(iclog
->ic_callback
== 0);
3734 iclog
= iclog
->ic_next
;
3735 } while (iclog
!= log
->l_iclog
);
3736 spin_unlock(&log
->l_icloglock
);
3739 /* return non-zero if log IOERROR transition had already happened */
3744 xlog_iclogs_empty(xlog_t
*log
)
3746 xlog_in_core_t
*iclog
;
3748 iclog
= log
->l_iclog
;
3750 /* endianness does not matter here, zero is zero in
3753 if (iclog
->ic_header
.h_num_logops
)
3755 iclog
= iclog
->ic_next
;
3756 } while (iclog
!= log
->l_iclog
);