2 * Copyright (c) 2008 The DragonFly Project. All rights reserved.
4 * This code is derived from software contributed to The DragonFly Project
5 * by Matthew Dillon <dillon@backplane.com>
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
17 * 3. Neither the name of The DragonFly Project nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific, prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
25 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
29 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
30 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
31 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * $DragonFly: src/sys/vfs/hammer/hammer_flusher.c,v 1.45 2008/07/31 04:42:04 dillon Exp $
37 * HAMMER dependancy flusher thread
39 * Meta data updates create buffer dependancies which are arranged as a
45 static void hammer_flusher_master_thread(void *arg
);
46 static void hammer_flusher_slave_thread(void *arg
);
47 static void hammer_flusher_flush(hammer_mount_t hmp
);
48 static void hammer_flusher_flush_inode(hammer_inode_t ip
,
49 hammer_transaction_t trans
);
52 * Support structures for the flusher threads.
54 struct hammer_flusher_info
{
55 TAILQ_ENTRY(hammer_flusher_info
) entry
;
56 struct hammer_mount
*hmp
;
60 hammer_flush_group_t flg
;
61 hammer_inode_t work_array
[HAMMER_FLUSH_GROUP_SIZE
];
64 typedef struct hammer_flusher_info
*hammer_flusher_info_t
;
67 * Sync all inodes pending on the flusher.
69 * All flush groups will be flushed. This does not queue dirty inodes
70 * to the flush groups, it just flushes out what has already been queued!
73 hammer_flusher_sync(hammer_mount_t hmp
)
77 seq
= hammer_flusher_async(hmp
, NULL
);
78 hammer_flusher_wait(hmp
, seq
);
82 * Sync all inodes pending on the flusher - return immediately.
84 * All flush groups will be flushed.
87 hammer_flusher_async(hammer_mount_t hmp
, hammer_flush_group_t close_flg
)
89 hammer_flush_group_t flg
;
90 int seq
= hmp
->flusher
.next
;
92 TAILQ_FOREACH(flg
, &hmp
->flush_group_list
, flush_entry
) {
93 if (flg
->running
== 0)
99 if (hmp
->flusher
.td
) {
100 if (hmp
->flusher
.signal
++ == 0)
101 wakeup(&hmp
->flusher
.signal
);
103 seq
= hmp
->flusher
.done
;
109 hammer_flusher_async_one(hammer_mount_t hmp
)
113 if (hmp
->flusher
.td
) {
114 seq
= hmp
->flusher
.next
;
115 if (hmp
->flusher
.signal
++ == 0)
116 wakeup(&hmp
->flusher
.signal
);
118 seq
= hmp
->flusher
.done
;
124 * Wait for the flusher to get to the specified sequence number.
125 * Signal the flusher as often as necessary to keep it going.
128 hammer_flusher_wait(hammer_mount_t hmp
, int seq
)
130 while ((int)(seq
- hmp
->flusher
.done
) > 0) {
131 if (hmp
->flusher
.act
!= seq
) {
132 if (hmp
->flusher
.signal
++ == 0)
133 wakeup(&hmp
->flusher
.signal
);
135 tsleep(&hmp
->flusher
.done
, 0, "hmrfls", 0);
140 hammer_flusher_create(hammer_mount_t hmp
)
142 hammer_flusher_info_t info
;
145 hmp
->flusher
.signal
= 0;
146 hmp
->flusher
.act
= 0;
147 hmp
->flusher
.done
= 0;
148 hmp
->flusher
.next
= 1;
149 hammer_ref(&hmp
->flusher
.finalize_lock
);
150 TAILQ_INIT(&hmp
->flusher
.run_list
);
151 TAILQ_INIT(&hmp
->flusher
.ready_list
);
153 lwkt_create(hammer_flusher_master_thread
, hmp
,
154 &hmp
->flusher
.td
, NULL
, 0, -1, "hammer-M");
155 for (i
= 0; i
< HAMMER_MAX_FLUSHERS
; ++i
) {
156 info
= kmalloc(sizeof(*info
), M_HAMMER
, M_WAITOK
|M_ZERO
);
158 TAILQ_INSERT_TAIL(&hmp
->flusher
.ready_list
, info
, entry
);
159 lwkt_create(hammer_flusher_slave_thread
, info
,
160 &info
->td
, NULL
, 0, -1, "hammer-S%d", i
);
165 hammer_flusher_destroy(hammer_mount_t hmp
)
167 hammer_flusher_info_t info
;
172 hmp
->flusher
.exiting
= 1;
173 while (hmp
->flusher
.td
) {
174 ++hmp
->flusher
.signal
;
175 wakeup(&hmp
->flusher
.signal
);
176 tsleep(&hmp
->flusher
.exiting
, 0, "hmrwex", hz
);
182 while ((info
= TAILQ_FIRST(&hmp
->flusher
.ready_list
)) != NULL
) {
183 KKASSERT(info
->runstate
== 0);
184 TAILQ_REMOVE(&hmp
->flusher
.ready_list
, info
, entry
);
186 wakeup(&info
->runstate
);
188 tsleep(&info
->td
, 0, "hmrwwc", 0);
189 TAILQ_REMOVE(&hmp
->flusher
.ready_list
, info
, entry
);
190 kfree(info
, M_HAMMER
);
195 * The master flusher thread manages the flusher sequence id and
196 * synchronization with the slave work threads.
199 hammer_flusher_master_thread(void *arg
)
201 hammer_flush_group_t flg
;
208 * Do at least one flush cycle. We may have to update the
209 * UNDO FIFO even if no inodes are queued.
212 while (hmp
->flusher
.group_lock
)
213 tsleep(&hmp
->flusher
.group_lock
, 0, "hmrhld", 0);
214 hmp
->flusher
.act
= hmp
->flusher
.next
;
216 hammer_flusher_clean_loose_ios(hmp
);
217 hammer_flusher_flush(hmp
);
218 hmp
->flusher
.done
= hmp
->flusher
.act
;
219 wakeup(&hmp
->flusher
.done
);
220 flg
= TAILQ_FIRST(&hmp
->flush_group_list
);
221 if (flg
== NULL
|| flg
->closed
== 0)
223 if (hmp
->flags
& HAMMER_MOUNT_CRITICAL_ERROR
)
230 if (hmp
->flusher
.exiting
&& TAILQ_EMPTY(&hmp
->flush_group_list
))
232 while (hmp
->flusher
.signal
== 0)
233 tsleep(&hmp
->flusher
.signal
, 0, "hmrwwa", 0);
236 * Flush for each count on signal but only allow one extra
237 * flush request to build up.
239 if (--hmp
->flusher
.signal
!= 0)
240 hmp
->flusher
.signal
= 1;
246 hmp
->flusher
.td
= NULL
;
247 wakeup(&hmp
->flusher
.exiting
);
252 * Flush all inodes in the current flush group.
255 hammer_flusher_flush(hammer_mount_t hmp
)
257 hammer_flusher_info_t info
;
258 hammer_flush_group_t flg
;
259 hammer_reserve_t resv
;
261 hammer_inode_t next_ip
;
266 * Just in-case there's a flush race on mount
268 if (TAILQ_FIRST(&hmp
->flusher
.ready_list
) == NULL
)
272 * We only do one flg but we may have to loop/retry.
275 while ((flg
= TAILQ_FIRST(&hmp
->flush_group_list
)) != NULL
) {
277 if (hammer_debug_general
& 0x0001) {
278 kprintf("hammer_flush %d ttl=%d recs=%d\n",
280 flg
->total_count
, flg
->refs
);
282 if (hmp
->flags
& HAMMER_MOUNT_CRITICAL_ERROR
)
284 hammer_start_transaction_fls(&hmp
->flusher
.trans
, hmp
);
287 * If the previous flush cycle just about exhausted our
288 * UNDO space we may have to do a dummy cycle to move the
289 * first_offset up before actually digging into a new cycle,
290 * or the new cycle will not have sufficient undo space.
292 if (hammer_flusher_undo_exhausted(&hmp
->flusher
.trans
, 3))
293 hammer_flusher_finalize(&hmp
->flusher
.trans
, 0);
296 * Ok, we are running this flush group now (this prevents new
300 if (hmp
->next_flush_group
== flg
)
301 hmp
->next_flush_group
= TAILQ_NEXT(flg
, flush_entry
);
304 * Iterate the inodes in the flg's flush_list and assign
308 info
= TAILQ_FIRST(&hmp
->flusher
.ready_list
);
309 next_ip
= TAILQ_FIRST(&flg
->flush_list
);
311 while ((ip
= next_ip
) != NULL
) {
312 next_ip
= TAILQ_NEXT(ip
, flush_entry
);
315 * Add ip to the slave's work array. The slave is
316 * not currently running.
318 info
->work_array
[info
->count
++] = ip
;
319 if (info
->count
!= HAMMER_FLUSH_GROUP_SIZE
)
323 * Get the slave running
325 TAILQ_REMOVE(&hmp
->flusher
.ready_list
, info
, entry
);
326 TAILQ_INSERT_TAIL(&hmp
->flusher
.run_list
, info
, entry
);
329 wakeup(&info
->runstate
);
332 * Get a new slave. We may have to wait for one to
335 while ((info
= TAILQ_FIRST(&hmp
->flusher
.ready_list
)) == NULL
) {
336 tsleep(&hmp
->flusher
.ready_list
, 0, "hmrfcc", 0);
341 * Run the current slave if necessary
344 TAILQ_REMOVE(&hmp
->flusher
.ready_list
, info
, entry
);
345 TAILQ_INSERT_TAIL(&hmp
->flusher
.run_list
, info
, entry
);
348 wakeup(&info
->runstate
);
352 * Wait for all slaves to finish running
354 while (TAILQ_FIRST(&hmp
->flusher
.run_list
) != NULL
)
355 tsleep(&hmp
->flusher
.ready_list
, 0, "hmrfcc", 0);
358 * Do the final finalization, clean up
360 hammer_flusher_finalize(&hmp
->flusher
.trans
, 1);
361 hmp
->flusher
.tid
= hmp
->flusher
.trans
.tid
;
363 hammer_done_transaction(&hmp
->flusher
.trans
);
366 * Loop up on the same flg. If the flg is done clean it up
367 * and break out. We only flush one flg.
369 if (TAILQ_FIRST(&flg
->flush_list
) == NULL
) {
370 KKASSERT(TAILQ_EMPTY(&flg
->flush_list
));
371 KKASSERT(flg
->refs
== 0);
372 TAILQ_REMOVE(&hmp
->flush_group_list
, flg
, flush_entry
);
373 kfree(flg
, M_HAMMER
);
379 * We may have pure meta-data to flush, or we may have to finish
380 * cycling the UNDO FIFO, even if there were no flush groups.
382 if (count
== 0 && hammer_flusher_haswork(hmp
)) {
383 hammer_start_transaction_fls(&hmp
->flusher
.trans
, hmp
);
384 hammer_flusher_finalize(&hmp
->flusher
.trans
, 1);
385 hammer_done_transaction(&hmp
->flusher
.trans
);
389 * Clean up any freed big-blocks (typically zone-2).
390 * resv->flush_group is typically set several flush groups ahead
391 * of the free to ensure that the freed block is not reused until
392 * it can no longer be reused.
394 while ((resv
= TAILQ_FIRST(&hmp
->delay_list
)) != NULL
) {
395 if (resv
->flush_group
!= hmp
->flusher
.act
)
397 hammer_reserve_clrdelay(hmp
, resv
);
403 * The slave flusher thread pulls work off the master flush_list until no
407 hammer_flusher_slave_thread(void *arg
)
409 hammer_flush_group_t flg
;
410 hammer_flusher_info_t info
;
419 while (info
->runstate
== 0)
420 tsleep(&info
->runstate
, 0, "hmrssw", 0);
421 if (info
->runstate
< 0)
425 for (i
= 0; i
< info
->count
; ++i
) {
426 ip
= info
->work_array
[i
];
427 hammer_flusher_flush_inode(ip
, &hmp
->flusher
.trans
);
428 ++hammer_stats_inode_flushes
;
432 TAILQ_REMOVE(&hmp
->flusher
.run_list
, info
, entry
);
433 TAILQ_INSERT_TAIL(&hmp
->flusher
.ready_list
, info
, entry
);
434 wakeup(&hmp
->flusher
.ready_list
);
442 hammer_flusher_clean_loose_ios(hammer_mount_t hmp
)
444 hammer_buffer_t buffer
;
448 * loose ends - buffers without bp's aren't tracked by the kernel
449 * and can build up, so clean them out. This can occur when an
450 * IO completes on a buffer with no references left.
452 if ((io
= TAILQ_FIRST(&hmp
->lose_list
)) != NULL
) {
453 crit_enter(); /* biodone() race */
454 while ((io
= TAILQ_FIRST(&hmp
->lose_list
)) != NULL
) {
455 KKASSERT(io
->mod_list
== &hmp
->lose_list
);
456 TAILQ_REMOVE(&hmp
->lose_list
, io
, mod_entry
);
458 if (io
->lock
.refs
== 0)
459 ++hammer_count_refedbufs
;
460 hammer_ref(&io
->lock
);
462 hammer_rel_buffer(buffer
, 0);
469 * Flush a single inode that is part of a flush group.
471 * Flusher errors are extremely serious, even ENOSPC shouldn't occur because
472 * the front-end should have reserved sufficient space on the media. Any
473 * error other then EWOULDBLOCK will force the mount to be read-only.
477 hammer_flusher_flush_inode(hammer_inode_t ip
, hammer_transaction_t trans
)
479 hammer_mount_t hmp
= ip
->hmp
;
482 hammer_flusher_clean_loose_ios(hmp
);
483 error
= hammer_sync_inode(trans
, ip
);
486 * EWOULDBLOCK can happen under normal operation, all other errors
487 * are considered extremely serious. We must set WOULDBLOCK
488 * mechanics to deal with the mess left over from the abort of the
492 ip
->flags
|= HAMMER_INODE_WOULDBLOCK
;
493 if (error
== EWOULDBLOCK
)
496 hammer_flush_inode_done(ip
, error
);
497 while (hmp
->flusher
.finalize_want
)
498 tsleep(&hmp
->flusher
.finalize_want
, 0, "hmrsxx", 0);
499 if (hammer_flusher_undo_exhausted(trans
, 1)) {
500 kprintf("HAMMER: Warning: UNDO area too small!\n");
501 hammer_flusher_finalize(trans
, 1);
502 } else if (hammer_flusher_meta_limit(trans
->hmp
)) {
503 hammer_flusher_finalize(trans
, 0);
508 * Return non-zero if the UNDO area has less then (QUARTER / 4) of its
511 * 1/4 - Emergency free undo space level. Below this point the flusher
512 * will finalize even if directory dependancies have not been resolved.
514 * 2/4 - Used by the pruning and reblocking code. These functions may be
515 * running in parallel with a flush and cannot be allowed to drop
516 * available undo space to emergency levels.
518 * 3/4 - Used at the beginning of a flush to force-sync the volume header
519 * to give the flush plenty of runway to work in.
522 hammer_flusher_undo_exhausted(hammer_transaction_t trans
, int quarter
)
524 if (hammer_undo_space(trans
) <
525 hammer_undo_max(trans
->hmp
) * quarter
/ 4) {
533 * Flush all pending UNDOs, wait for write completion, update the volume
534 * header with the new UNDO end position, and flush it. Then
535 * asynchronously flush the meta-data.
537 * If this is the last finalization in a flush group we also synchronize
538 * our cached blockmap and set hmp->flusher_undo_start and our cached undo
539 * fifo first_offset so the next flush resets the FIFO pointers.
541 * If this is not final it is being called because too many dirty meta-data
542 * buffers have built up and must be flushed with UNDO synchronization to
543 * avoid a buffer cache deadlock.
546 hammer_flusher_finalize(hammer_transaction_t trans
, int final
)
548 hammer_volume_t root_volume
;
549 hammer_blockmap_t cundomap
, dundomap
;
556 root_volume
= trans
->rootvol
;
559 * Exclusively lock the flusher. This guarantees that all dirty
560 * buffers will be idled (have a mod-count of 0).
562 ++hmp
->flusher
.finalize_want
;
563 hammer_lock_ex(&hmp
->flusher
.finalize_lock
);
566 * If this isn't the final sync several threads may have hit the
567 * meta-limit at the same time and raced. Only sync if we really
568 * have to, after acquiring the lock.
570 if (final
== 0 && !hammer_flusher_meta_limit(hmp
))
573 if (hmp
->flags
& HAMMER_MOUNT_CRITICAL_ERROR
)
577 * Flush data buffers. This can occur asynchronously and at any
578 * time. We must interlock against the frontend direct-data write
579 * but do not have to acquire the sync-lock yet.
582 while ((io
= TAILQ_FIRST(&hmp
->data_list
)) != NULL
) {
585 if (io
->lock
.refs
== 0)
586 ++hammer_count_refedbufs
;
587 hammer_ref(&io
->lock
);
588 hammer_io_write_interlock(io
);
589 KKASSERT(io
->type
!= HAMMER_STRUCTURE_VOLUME
);
591 hammer_io_done_interlock(io
);
592 hammer_rel_buffer((hammer_buffer_t
)io
, 0);
597 * The sync-lock is required for the remaining sequence. This lock
598 * prevents meta-data from being modified.
600 hammer_sync_lock_ex(trans
);
603 * If we have been asked to finalize the volume header sync the
604 * cached blockmap to the on-disk blockmap. Generate an UNDO
605 * record for the update.
608 cundomap
= &hmp
->blockmap
[0];
609 dundomap
= &root_volume
->ondisk
->vol0_blockmap
[0];
610 if (root_volume
->io
.modified
) {
611 hammer_modify_volume(trans
, root_volume
,
612 dundomap
, sizeof(hmp
->blockmap
));
613 for (i
= 0; i
< HAMMER_MAX_ZONES
; ++i
)
614 hammer_crc_set_blockmap(&cundomap
[i
]);
615 bcopy(cundomap
, dundomap
, sizeof(hmp
->blockmap
));
616 hammer_modify_volume_done(root_volume
);
624 while ((io
= TAILQ_FIRST(&hmp
->undo_list
)) != NULL
) {
627 KKASSERT(io
->modify_refs
== 0);
628 if (io
->lock
.refs
== 0)
629 ++hammer_count_refedbufs
;
630 hammer_ref(&io
->lock
);
631 KKASSERT(io
->type
!= HAMMER_STRUCTURE_VOLUME
);
633 hammer_rel_buffer((hammer_buffer_t
)io
, 0);
638 * Wait for I/Os to complete
640 hammer_flusher_clean_loose_ios(hmp
);
641 hammer_io_wait_all(hmp
, "hmrfl1");
643 if (hmp
->flags
& HAMMER_MOUNT_CRITICAL_ERROR
)
647 * Update the on-disk volume header with new UNDO FIFO end position
648 * (do not generate new UNDO records for this change). We have to
649 * do this for the UNDO FIFO whether (final) is set or not.
651 * Also update the on-disk next_tid field. This does not require
652 * an UNDO. However, because our TID is generated before we get
653 * the sync lock another sync may have beat us to the punch.
655 * This also has the side effect of updating first_offset based on
656 * a prior finalization when the first finalization of the next flush
657 * cycle occurs, removing any undo info from the prior finalization
658 * from consideration.
660 * The volume header will be flushed out synchronously.
662 dundomap
= &root_volume
->ondisk
->vol0_blockmap
[HAMMER_ZONE_UNDO_INDEX
];
663 cundomap
= &hmp
->blockmap
[HAMMER_ZONE_UNDO_INDEX
];
665 if (dundomap
->first_offset
!= cundomap
->first_offset
||
666 dundomap
->next_offset
!= cundomap
->next_offset
) {
667 hammer_modify_volume(NULL
, root_volume
, NULL
, 0);
668 dundomap
->first_offset
= cundomap
->first_offset
;
669 dundomap
->next_offset
= cundomap
->next_offset
;
670 hammer_crc_set_blockmap(dundomap
);
671 hammer_modify_volume_done(root_volume
);
675 * vol0_next_tid is used for TID selection and is updated without
676 * an UNDO so we do not reuse a TID that may have been rolled-back.
678 * vol0_last_tid is the highest fully-synchronized TID. It is
679 * set-up when the UNDO fifo is fully synced, later on (not here).
681 if (root_volume
->io
.modified
) {
682 hammer_modify_volume(NULL
, root_volume
, NULL
, 0);
683 if (root_volume
->ondisk
->vol0_next_tid
< trans
->tid
)
684 root_volume
->ondisk
->vol0_next_tid
= trans
->tid
;
685 hammer_crc_set_volume(root_volume
->ondisk
);
686 hammer_modify_volume_done(root_volume
);
687 hammer_io_flush(&root_volume
->io
);
691 * Wait for I/Os to complete
693 hammer_flusher_clean_loose_ios(hmp
);
694 hammer_io_wait_all(hmp
, "hmrfl2");
696 if (hmp
->flags
& HAMMER_MOUNT_CRITICAL_ERROR
)
700 * Flush meta-data. The meta-data will be undone if we crash
701 * so we can safely flush it asynchronously.
703 * Repeated catchups will wind up flushing this update's meta-data
704 * and the UNDO buffers for the next update simultaniously. This
708 while ((io
= TAILQ_FIRST(&hmp
->meta_list
)) != NULL
) {
711 KKASSERT(io
->modify_refs
== 0);
712 if (io
->lock
.refs
== 0)
713 ++hammer_count_refedbufs
;
714 hammer_ref(&io
->lock
);
715 KKASSERT(io
->type
!= HAMMER_STRUCTURE_VOLUME
);
717 hammer_rel_buffer((hammer_buffer_t
)io
, 0);
722 * If this is the final finalization for the flush group set
723 * up for the next sequence by setting a new first_offset in
724 * our cached blockmap and clearing the undo history.
726 * Even though we have updated our cached first_offset, the on-disk
727 * first_offset still governs available-undo-space calculations.
730 cundomap
= &hmp
->blockmap
[HAMMER_ZONE_UNDO_INDEX
];
731 if (cundomap
->first_offset
== cundomap
->next_offset
) {
732 hmp
->hflags
&= ~HMNT_UNDO_DIRTY
;
734 cundomap
->first_offset
= cundomap
->next_offset
;
735 hmp
->hflags
|= HMNT_UNDO_DIRTY
;
737 hammer_clear_undo_history(hmp
);
740 * Flush tid sequencing. flush_tid1 is fully synchronized,
741 * meaning a crash will not roll it back. flush_tid2 has
742 * been written out asynchronously and a crash will roll
743 * it back. flush_tid1 is used for all mirroring masters.
745 if (hmp
->flush_tid1
!= hmp
->flush_tid2
) {
746 hmp
->flush_tid1
= hmp
->flush_tid2
;
747 wakeup(&hmp
->flush_tid1
);
749 hmp
->flush_tid2
= trans
->tid
;
753 * Cleanup. Report any critical errors.
756 hammer_sync_unlock(trans
);
758 if (hmp
->flags
& HAMMER_MOUNT_CRITICAL_ERROR
) {
759 kprintf("HAMMER(%s): Critical write error during flush, "
760 "refusing to sync UNDO FIFO\n",
761 root_volume
->ondisk
->vol_name
);
765 hammer_unlock(&hmp
->flusher
.finalize_lock
);
767 if (--hmp
->flusher
.finalize_want
== 0)
768 wakeup(&hmp
->flusher
.finalize_want
);
769 hammer_stats_commits
+= final
;
773 * Return non-zero if too many dirty meta-data buffers have built up.
775 * Since we cannot allow such buffers to flush until we have dealt with
776 * the UNDOs, we risk deadlocking the kernel's buffer cache.
779 hammer_flusher_meta_limit(hammer_mount_t hmp
)
781 if (hmp
->locked_dirty_space
+ hmp
->io_running_space
>
782 hammer_limit_dirtybufspace
) {
789 * Return non-zero if too many dirty meta-data buffers have built up.
791 * This version is used by background operations (mirror, prune, reblock)
792 * to leave room for foreground operations.
795 hammer_flusher_meta_halflimit(hammer_mount_t hmp
)
797 if (hmp
->locked_dirty_space
+ hmp
->io_running_space
>
798 hammer_limit_dirtybufspace
/ 2) {
805 * Return non-zero if the flusher still has something to flush.
808 hammer_flusher_haswork(hammer_mount_t hmp
)
810 if (hmp
->flags
& HAMMER_MOUNT_CRITICAL_ERROR
)
812 if (TAILQ_FIRST(&hmp
->flush_group_list
) || /* dirty inodes */
813 TAILQ_FIRST(&hmp
->volu_list
) || /* dirty bufffers */
814 TAILQ_FIRST(&hmp
->undo_list
) ||
815 TAILQ_FIRST(&hmp
->data_list
) ||
816 TAILQ_FIRST(&hmp
->meta_list
) ||
817 (hmp
->hflags
& HMNT_UNDO_DIRTY
) /* UNDO FIFO sync */