2 * SPDX-License-Identifier: BSD-2-Clause
4 * Copyright (c) 2002, Jeffrey Roberson <jeff@freebsd.org>
5 * Copyright (c) 2008-2009, Lawrence Stewart <lstewart@freebsd.org>
6 * Copyright (c) 2009-2010, The FreeBSD Foundation
9 * Portions of this software were developed at the Centre for Advanced
10 * Internet Architectures, Swinburne University of Technology, Melbourne,
11 * Australia by Lawrence Stewart under sponsorship from the FreeBSD Foundation.
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
16 * 1. Redistributions of source code must retain the above copyright
17 * notice unmodified, this list of conditions, and the following
19 * 2. Redistributions in binary form must reproduce the above copyright
20 * notice, this list of conditions and the following disclaimer in the
21 * documentation and/or other materials provided with the distribution.
23 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
24 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
25 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
26 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
27 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
28 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
30 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
32 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
35 #include <sys/cdefs.h>
38 #include <sys/param.h>
39 #include <sys/systm.h>
41 #include <sys/eventhandler.h>
42 #include <sys/fcntl.h>
43 #include <sys/kernel.h>
44 #include <sys/kthread.h>
46 #include <sys/malloc.h>
47 #include <sys/mount.h>
48 #include <sys/mutex.h>
49 #include <sys/namei.h>
51 #include <sys/reboot.h>
52 #include <sys/unistd.h>
53 #include <sys/vnode.h>
55 #include <security/mac/mac_framework.h>
57 /* Async. Logging Queue */
59 char *aq_entbuf; /* Buffer for stored entries */
60 int aq_entmax; /* Max entries */
61 int aq_entlen; /* Entry length */
62 int aq_freebytes; /* Bytes available in buffer */
63 int aq_buflen; /* Total length of our buffer */
64 int aq_writehead; /* Location for next write */
65 int aq_writetail; /* Flush starts at this location */
66 int aq_wrapearly; /* # bytes left blank at end of buf */
67 int aq_flags; /* Queue flags */
68 int aq_waiters; /* Num threads waiting for resources
69 * NB: Used as a wait channel so must
70 * not be first field in the alq struct
72 struct ale aq_getpost; /* ALE for use by get/post */
73 struct mtx aq_mtx; /* Queue lock */
74 struct vnode *aq_vp; /* Open vnode handle */
75 struct ucred *aq_cred; /* Credentials of the opening thread */
76 LIST_ENTRY(alq) aq_act; /* List of active queues */
77 LIST_ENTRY(alq) aq_link; /* List of all queues */
80 #define AQ_WANTED 0x0001 /* Wakeup sleeper when io is done */
81 #define AQ_ACTIVE 0x0002 /* on the active list */
82 #define AQ_FLUSHING 0x0004 /* doing IO */
83 #define AQ_SHUTDOWN 0x0008 /* Queue no longer valid */
84 #define AQ_ORDERED 0x0010 /* Queue enforces ordered writes */
85 #define AQ_LEGACY 0x0020 /* Legacy queue (fixed length writes) */
87 #define ALQ_LOCK(alq) mtx_lock_spin(&(alq)->aq_mtx)
88 #define ALQ_UNLOCK(alq) mtx_unlock_spin(&(alq)->aq_mtx)
90 #define HAS_PENDING_DATA(alq) ((alq)->aq_freebytes != (alq)->aq_buflen)
92 static MALLOC_DEFINE(M_ALD, "ALD", "ALD");
95 * The ald_mtx protects the ald_queues list and the ald_active list.
97 static struct mtx ald_mtx;
98 static LIST_HEAD(, alq) ald_queues;
99 static LIST_HEAD(, alq) ald_active;
100 static int ald_shutingdown = 0;
101 struct thread *ald_thread;
102 static struct proc *ald_proc;
103 static eventhandler_tag alq_eventhandler_tag = NULL;
105 #define ALD_LOCK() mtx_lock(&ald_mtx)
106 #define ALD_UNLOCK() mtx_unlock(&ald_mtx)
108 /* Daemon functions */
109 static int ald_add(struct alq *);
110 static int ald_rem(struct alq *);
111 static void ald_startup(void *);
112 static void ald_daemon(void);
113 static void ald_shutdown(void *, int);
114 static void ald_activate(struct alq *);
115 static void ald_deactivate(struct alq *);
117 /* Internal queue functions */
118 static void alq_shutdown(struct alq *);
119 static void alq_destroy(struct alq *);
120 static int alq_doio(struct alq *);
123 * Add a new queue to the global list. Fail if we're shutting down.
126 ald_add(struct alq *alq)
133 if (ald_shutingdown) {
137 LIST_INSERT_HEAD(&ald_queues, alq, aq_link);
144 * Remove a queue from the global list unless we're shutting down. If so,
145 * the ald will take care of cleaning up it's resources.
148 ald_rem(struct alq *alq)
155 if (ald_shutingdown) {
159 LIST_REMOVE(alq, aq_link);
166 * Put a queue on the active list. This will schedule it for writing.
169 ald_activate(struct alq *alq)
171 LIST_INSERT_HEAD(&ald_active, alq, aq_act);
176 ald_deactivate(struct alq *alq)
178 LIST_REMOVE(alq, aq_act);
179 alq->aq_flags &= ~AQ_ACTIVE;
183 ald_startup(void *unused)
185 mtx_init(&ald_mtx, "ALDmtx", NULL, MTX_DEF|MTX_QUIET);
186 LIST_INIT(&ald_queues);
187 LIST_INIT(&ald_active);
196 ald_thread = FIRST_THREAD_IN_PROC(ald_proc);
198 alq_eventhandler_tag = EVENTHANDLER_REGISTER(shutdown_pre_sync,
199 ald_shutdown, NULL, SHUTDOWN_PRI_FIRST);
204 while ((alq = LIST_FIRST(&ald_active)) == NULL &&
206 mtx_sleep(&ald_active, &ald_mtx, PWAIT, "aldslp", 0);
208 /* Don't shutdown until all active ALQs are flushed. */
209 if (ald_shutingdown && alq == NULL) {
217 needwakeup = alq_doio(alq);
228 ald_shutdown(void *arg, int howto)
232 if ((howto & RB_NOSYNC) != 0 || SCHEDULER_STOPPED())
237 /* Ensure no new queues can be created. */
240 /* Shutdown all ALQs prior to terminating the ald_daemon. */
241 while ((alq = LIST_FIRST(&ald_queues)) != NULL) {
242 LIST_REMOVE(alq, aq_link);
248 /* At this point, all ALQs are flushed and shutdown. */
251 * Wake ald_daemon so that it exits. It won't be able to do
252 * anything until we mtx_sleep because we hold the ald_mtx.
256 /* Wait for ald_daemon to exit. */
257 mtx_sleep(ald_proc, &ald_mtx, PWAIT, "aldslp", 0);
263 alq_shutdown(struct alq *alq)
267 /* Stop any new writers. */
268 alq->aq_flags |= AQ_SHUTDOWN;
271 * If the ALQ isn't active but has unwritten data (possible if
272 * the ALQ_NOACTIVATE flag has been used), explicitly activate the
273 * ALQ here so that the pending data gets flushed by the ald_daemon.
275 if (!(alq->aq_flags & AQ_ACTIVE) && HAS_PENDING_DATA(alq)) {
276 alq->aq_flags |= AQ_ACTIVE;
285 while (alq->aq_flags & AQ_ACTIVE) {
286 alq->aq_flags |= AQ_WANTED;
287 msleep_spin(alq, &alq->aq_mtx, "aldclose", 0);
291 vn_close(alq->aq_vp, FWRITE, alq->aq_cred,
293 crfree(alq->aq_cred);
297 alq_destroy(struct alq *alq)
299 /* Drain all pending IO. */
302 mtx_destroy(&alq->aq_mtx);
303 free(alq->aq_entbuf, M_ALD);
308 * Flush all pending data to disk. This operation will block.
311 alq_doio(struct alq *alq)
317 struct iovec aiov[2];
322 KASSERT((HAS_PENDING_DATA(alq)), ("%s: queue empty!", __func__));
328 wrapearly = alq->aq_wrapearly;
330 bzero(&aiov, sizeof(aiov));
331 bzero(&auio, sizeof(auio));
333 /* Start the write from the location of our buffer tail pointer. */
334 aiov[0].iov_base = alq->aq_entbuf + alq->aq_writetail;
336 if (alq->aq_writetail < alq->aq_writehead) {
337 /* Buffer not wrapped. */
338 totlen = aiov[0].iov_len = alq->aq_writehead - alq->aq_writetail;
339 } else if (alq->aq_writehead == 0) {
340 /* Buffer not wrapped (special case to avoid an empty iov). */
341 totlen = aiov[0].iov_len = alq->aq_buflen - alq->aq_writetail -
345 * Buffer wrapped, requires 2 aiov entries:
346 * - first is from writetail to end of buffer
347 * - second is from start of buffer to writehead
349 aiov[0].iov_len = alq->aq_buflen - alq->aq_writetail -
352 aiov[1].iov_base = alq->aq_entbuf;
353 aiov[1].iov_len = alq->aq_writehead;
354 totlen = aiov[0].iov_len + aiov[1].iov_len;
357 alq->aq_flags |= AQ_FLUSHING;
360 auio.uio_iov = &aiov[0];
362 auio.uio_segflg = UIO_SYSSPACE;
363 auio.uio_rw = UIO_WRITE;
364 auio.uio_iovcnt = iov;
365 auio.uio_resid = totlen;
369 * Do all of the junk required to write now.
371 vn_start_write(vp, &mp, V_WAIT);
372 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
374 * XXX: VOP_WRITE error checks are ignored.
377 if (mac_vnode_check_write(alq->aq_cred, NOCRED, vp) == 0)
379 VOP_WRITE(vp, &auio, IO_UNIT | IO_APPEND, alq->aq_cred);
381 vn_finished_write(mp);
384 alq->aq_flags &= ~AQ_FLUSHING;
386 /* Adjust writetail as required, taking into account wrapping. */
387 alq->aq_writetail = (alq->aq_writetail + totlen + wrapearly) %
389 alq->aq_freebytes += totlen + wrapearly;
392 * If we just flushed part of the buffer which wrapped, reset the
393 * wrapearly indicator.
396 alq->aq_wrapearly = 0;
399 * If we just flushed the buffer completely, reset indexes to 0 to
400 * minimise buffer wraps.
401 * This is also required to ensure alq_getn() can't wedge itself.
403 if (!HAS_PENDING_DATA(alq))
404 alq->aq_writehead = alq->aq_writetail = 0;
406 KASSERT((alq->aq_writetail >= 0 && alq->aq_writetail < alq->aq_buflen),
407 ("%s: aq_writetail < 0 || aq_writetail >= aq_buflen", __func__));
409 if (alq->aq_flags & AQ_WANTED) {
410 alq->aq_flags &= ~AQ_WANTED;
417 static struct kproc_desc ald_kp = {
423 SYSINIT(aldthread, SI_SUB_KTHREAD_IDLE, SI_ORDER_ANY, kproc_start, &ald_kp);
424 SYSINIT(ald, SI_SUB_LOCK, SI_ORDER_ANY, ald_startup, NULL);
426 /* User visible queue functions */
429 * Create the queue data structure, allocate the buffer, and open the file.
433 alq_open_flags(struct alq **alqp, const char *file, struct ucred *cred, int cmode,
441 KASSERT((size > 0), ("%s: size <= 0", __func__));
445 NDINIT(&nd, LOOKUP, NOFOLLOW, UIO_SYSSPACE, file);
446 oflags = FWRITE | O_NOFOLLOW | O_CREAT;
448 error = vn_open_cred(&nd, &oflags, cmode, 0, cred, NULL);
453 /* We just unlock so we hold a reference */
454 VOP_UNLOCK(nd.ni_vp);
456 alq = malloc(sizeof(*alq), M_ALD, M_WAITOK|M_ZERO);
457 alq->aq_vp = nd.ni_vp;
458 alq->aq_cred = crhold(cred);
460 mtx_init(&alq->aq_mtx, "ALD Queue", NULL, MTX_SPIN|MTX_QUIET);
462 alq->aq_buflen = size;
466 alq->aq_freebytes = alq->aq_buflen;
467 alq->aq_entbuf = malloc(alq->aq_buflen, M_ALD, M_WAITOK|M_ZERO);
468 alq->aq_writehead = alq->aq_writetail = 0;
469 if (flags & ALQ_ORDERED)
470 alq->aq_flags |= AQ_ORDERED;
472 if ((error = ald_add(alq)) != 0) {
483 alq_open(struct alq **alqp, const char *file, struct ucred *cred, int cmode,
488 KASSERT((count >= 0), ("%s: count < 0", __func__));
491 if ((ret = alq_open_flags(alqp, file, cred, cmode,
492 size*count, 0)) == 0) {
493 (*alqp)->aq_flags |= AQ_LEGACY;
494 (*alqp)->aq_entmax = count;
495 (*alqp)->aq_entlen = size;
498 ret = alq_open_flags(alqp, file, cred, cmode, size, 0);
504 * Copy a new entry into the queue. If the operation would block either
505 * wait or return an error depending on the value of waitok.
508 alq_writen(struct alq *alq, void *data, int len, int flags)
510 int activate, copy, ret;
513 KASSERT((len > 0 && len <= alq->aq_buflen),
514 ("%s: len <= 0 || len > aq_buflen", __func__));
523 * Fail to perform the write and return EWOULDBLOCK if:
524 * - The message is larger than our underlying buffer.
525 * - The ALQ is being shutdown.
526 * - There is insufficient free space in our underlying buffer
527 * to accept the message and the user can't wait for space.
528 * - There is insufficient free space in our underlying buffer
529 * to accept the message and the alq is inactive due to prior
530 * use of the ALQ_NOACTIVATE flag (which would lead to deadlock).
532 if (len > alq->aq_buflen ||
533 alq->aq_flags & AQ_SHUTDOWN ||
534 (((flags & ALQ_NOWAIT) || (!(alq->aq_flags & AQ_ACTIVE) &&
535 HAS_PENDING_DATA(alq))) && alq->aq_freebytes < len)) {
537 return (EWOULDBLOCK);
541 * If we want ordered writes and there is already at least one thread
542 * waiting for resources to become available, sleep until we're woken.
544 if (alq->aq_flags & AQ_ORDERED && alq->aq_waiters > 0) {
545 KASSERT(!(flags & ALQ_NOWAIT),
546 ("%s: ALQ_NOWAIT set but incorrectly ignored!", __func__));
548 msleep_spin(&alq->aq_waiters, &alq->aq_mtx, "alqwnord", 0);
553 * (ALQ_WAITOK && aq_freebytes < len) or aq_freebytes >= len, either
554 * enter while loop and sleep until we have enough free bytes (former)
555 * or skip (latter). If AQ_ORDERED is set, only 1 thread at a time will
556 * be in this loop. Otherwise, multiple threads may be sleeping here
557 * competing for ALQ resources.
559 while (alq->aq_freebytes < len && !(alq->aq_flags & AQ_SHUTDOWN)) {
560 KASSERT(!(flags & ALQ_NOWAIT),
561 ("%s: ALQ_NOWAIT set but incorrectly ignored!", __func__));
562 alq->aq_flags |= AQ_WANTED;
566 msleep_spin(alq, &alq->aq_mtx, "alqwnres", 0);
570 * If we're the first thread to wake after an AQ_WANTED wakeup
571 * but there isn't enough free space for us, we're going to loop
572 * and sleep again. If there are other threads waiting in this
573 * loop, schedule a wakeup so that they can see if the space
574 * they require is available.
576 if (alq->aq_waiters > 0 && !(alq->aq_flags & AQ_ORDERED) &&
577 alq->aq_freebytes < len && !(alq->aq_flags & AQ_WANTED))
584 * If there are waiters, we need to signal the waiting threads after we
585 * complete our work. The alq ptr is used as a wait channel for threads
586 * requiring resources to be freed up. In the AQ_ORDERED case, threads
587 * are not allowed to concurrently compete for resources in the above
588 * while loop, so we use a different wait channel in this case.
590 if (alq->aq_waiters > 0) {
591 if (alq->aq_flags & AQ_ORDERED)
592 waitchan = &alq->aq_waiters;
598 /* Bail if we're shutting down. */
599 if (alq->aq_flags & AQ_SHUTDOWN) {
605 * If we need to wrap the buffer to accommodate the write,
606 * we'll need 2 calls to bcopy.
608 if ((alq->aq_buflen - alq->aq_writehead) < len)
609 copy = alq->aq_buflen - alq->aq_writehead;
611 /* Copy message (or part thereof if wrap required) to the buffer. */
612 bcopy(data, alq->aq_entbuf + alq->aq_writehead, copy);
613 alq->aq_writehead += copy;
615 if (alq->aq_writehead >= alq->aq_buflen) {
616 KASSERT((alq->aq_writehead == alq->aq_buflen),
617 ("%s: alq->aq_writehead (%d) > alq->aq_buflen (%d)",
621 alq->aq_writehead = 0;
626 * Wrap the buffer by copying the remainder of our message
627 * to the start of the buffer and resetting aq_writehead.
629 bcopy(((uint8_t *)data)+copy, alq->aq_entbuf, len - copy);
630 alq->aq_writehead = len - copy;
633 KASSERT((alq->aq_writehead >= 0 && alq->aq_writehead < alq->aq_buflen),
634 ("%s: aq_writehead < 0 || aq_writehead >= aq_buflen", __func__));
636 alq->aq_freebytes -= len;
638 if (!(alq->aq_flags & AQ_ACTIVE) && !(flags & ALQ_NOACTIVATE)) {
639 alq->aq_flags |= AQ_ACTIVE;
643 KASSERT((HAS_PENDING_DATA(alq)), ("%s: queue empty!", __func__));
654 /* NB: We rely on wakeup_one waking threads in a FIFO manner. */
655 if (waitchan != NULL)
656 wakeup_one(waitchan);
662 alq_write(struct alq *alq, void *data, int flags)
664 /* Should only be called in fixed length message (legacy) mode. */
665 KASSERT((alq->aq_flags & AQ_LEGACY),
666 ("%s: fixed length write on variable length queue", __func__));
667 return (alq_writen(alq, data, alq->aq_entlen, flags));
671 * Retrieve a pointer for the ALQ to write directly into, avoiding bcopy.
674 alq_getn(struct alq *alq, int len, int flags)
679 KASSERT((len > 0 && len <= alq->aq_buflen),
680 ("%s: len <= 0 || len > alq->aq_buflen", __func__));
687 * Determine the number of free contiguous bytes.
688 * We ensure elsewhere that if aq_writehead == aq_writetail because
689 * the buffer is empty, they will both be set to 0 and therefore
690 * aq_freebytes == aq_buflen and is fully contiguous.
691 * If they are equal and the buffer is not empty, aq_freebytes will
692 * be 0 indicating the buffer is full.
694 if (alq->aq_writehead <= alq->aq_writetail)
695 contigbytes = alq->aq_freebytes;
697 contigbytes = alq->aq_buflen - alq->aq_writehead;
699 if (contigbytes < len) {
701 * Insufficient space at end of buffer to handle a
702 * contiguous write. Wrap early if there's space at
703 * the beginning. This will leave a hole at the end
704 * of the buffer which we will have to skip over when
705 * flushing the buffer to disk.
707 if (alq->aq_writetail >= len || flags & ALQ_WAITOK) {
708 /* Keep track of # bytes left blank. */
709 alq->aq_wrapearly = contigbytes;
710 /* Do the wrap and adjust counters. */
711 contigbytes = alq->aq_freebytes =
713 alq->aq_writehead = 0;
719 * Return a NULL ALE if:
720 * - The message is larger than our underlying buffer.
721 * - The ALQ is being shutdown.
722 * - There is insufficient free space in our underlying buffer
723 * to accept the message and the user can't wait for space.
724 * - There is insufficient free space in our underlying buffer
725 * to accept the message and the alq is inactive due to prior
726 * use of the ALQ_NOACTIVATE flag (which would lead to deadlock).
728 if (len > alq->aq_buflen ||
729 alq->aq_flags & AQ_SHUTDOWN ||
730 (((flags & ALQ_NOWAIT) || (!(alq->aq_flags & AQ_ACTIVE) &&
731 HAS_PENDING_DATA(alq))) && contigbytes < len)) {
737 * If we want ordered writes and there is already at least one thread
738 * waiting for resources to become available, sleep until we're woken.
740 if (alq->aq_flags & AQ_ORDERED && alq->aq_waiters > 0) {
741 KASSERT(!(flags & ALQ_NOWAIT),
742 ("%s: ALQ_NOWAIT set but incorrectly ignored!", __func__));
744 msleep_spin(&alq->aq_waiters, &alq->aq_mtx, "alqgnord", 0);
749 * (ALQ_WAITOK && contigbytes < len) or contigbytes >= len, either enter
750 * while loop and sleep until we have enough contiguous free bytes
751 * (former) or skip (latter). If AQ_ORDERED is set, only 1 thread at a
752 * time will be in this loop. Otherwise, multiple threads may be
753 * sleeping here competing for ALQ resources.
755 while (contigbytes < len && !(alq->aq_flags & AQ_SHUTDOWN)) {
756 KASSERT(!(flags & ALQ_NOWAIT),
757 ("%s: ALQ_NOWAIT set but incorrectly ignored!", __func__));
758 alq->aq_flags |= AQ_WANTED;
762 msleep_spin(alq, &alq->aq_mtx, "alqgnres", 0);
765 if (alq->aq_writehead <= alq->aq_writetail)
766 contigbytes = alq->aq_freebytes;
768 contigbytes = alq->aq_buflen - alq->aq_writehead;
771 * If we're the first thread to wake after an AQ_WANTED wakeup
772 * but there isn't enough free space for us, we're going to loop
773 * and sleep again. If there are other threads waiting in this
774 * loop, schedule a wakeup so that they can see if the space
775 * they require is available.
777 if (alq->aq_waiters > 0 && !(alq->aq_flags & AQ_ORDERED) &&
778 contigbytes < len && !(alq->aq_flags & AQ_WANTED))
785 * If there are waiters, we need to signal the waiting threads after we
786 * complete our work. The alq ptr is used as a wait channel for threads
787 * requiring resources to be freed up. In the AQ_ORDERED case, threads
788 * are not allowed to concurrently compete for resources in the above
789 * while loop, so we use a different wait channel in this case.
791 if (alq->aq_waiters > 0) {
792 if (alq->aq_flags & AQ_ORDERED)
793 waitchan = &alq->aq_waiters;
799 /* Bail if we're shutting down. */
800 if (alq->aq_flags & AQ_SHUTDOWN) {
802 if (waitchan != NULL)
803 wakeup_one(waitchan);
808 * If we are here, we have a contiguous number of bytes >= len
809 * available in our buffer starting at aq_writehead.
811 alq->aq_getpost.ae_data = alq->aq_entbuf + alq->aq_writehead;
812 alq->aq_getpost.ae_bytesused = len;
814 return (&alq->aq_getpost);
818 alq_get(struct alq *alq, int flags)
820 /* Should only be called in fixed length message (legacy) mode. */
821 KASSERT((alq->aq_flags & AQ_LEGACY),
822 ("%s: fixed length get on variable length queue", __func__));
823 return (alq_getn(alq, alq->aq_entlen, flags));
827 alq_post_flags(struct alq *alq, struct ale *ale, int flags)
834 if (ale->ae_bytesused > 0) {
835 if (!(alq->aq_flags & AQ_ACTIVE) &&
836 !(flags & ALQ_NOACTIVATE)) {
837 alq->aq_flags |= AQ_ACTIVE;
841 alq->aq_writehead += ale->ae_bytesused;
842 alq->aq_freebytes -= ale->ae_bytesused;
844 /* Wrap aq_writehead if we filled to the end of the buffer. */
845 if (alq->aq_writehead == alq->aq_buflen)
846 alq->aq_writehead = 0;
848 KASSERT((alq->aq_writehead >= 0 &&
849 alq->aq_writehead < alq->aq_buflen),
850 ("%s: aq_writehead < 0 || aq_writehead >= aq_buflen",
853 KASSERT((HAS_PENDING_DATA(alq)), ("%s: queue empty!", __func__));
857 * If there are waiters, we need to signal the waiting threads after we
858 * complete our work. The alq ptr is used as a wait channel for threads
859 * requiring resources to be freed up. In the AQ_ORDERED case, threads
860 * are not allowed to concurrently compete for resources in the
861 * alq_getn() while loop, so we use a different wait channel in this case.
863 if (alq->aq_waiters > 0) {
864 if (alq->aq_flags & AQ_ORDERED)
865 waitchan = &alq->aq_waiters;
879 /* NB: We rely on wakeup_one waking threads in a FIFO manner. */
880 if (waitchan != NULL)
881 wakeup_one(waitchan);
885 alq_flush(struct alq *alq)
893 * Pull the lever iff there is data to flush and we're
894 * not already in the middle of a flush operation.
896 if (HAS_PENDING_DATA(alq) && !(alq->aq_flags & AQ_FLUSHING)) {
897 if (alq->aq_flags & AQ_ACTIVE)
901 needwakeup = alq_doio(alq);
912 * Flush remaining data, close the file and free all resources.
915 alq_close(struct alq *alq)
917 /* Only flush and destroy alq if not already shutting down. */
918 if (ald_rem(alq) == 0)
923 alq_load_handler(module_t mod, int what, void *arg)
936 /* Only allow unload if there are no open queues. */
937 if (LIST_FIRST(&ald_queues) == NULL) {
940 EVENTHANDLER_DEREGISTER(shutdown_pre_sync,
941 alq_eventhandler_tag);
942 ald_shutdown(NULL, 0);
943 mtx_destroy(&ald_mtx);
951 /* If MOD_QUIESCE failed we must fail here too. */
952 if (ald_shutingdown == 0)
964 static moduledata_t alq_mod =
971 DECLARE_MODULE(alq, alq_mod, SI_SUB_LAST, SI_ORDER_ANY);
972 MODULE_VERSION(alq, 1);