2 * Copyright (c) 2002, Jeffrey Roberson <jeff@freebsd.org>
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice unmodified, this list of conditions, and the following
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 #include <sys/cdefs.h>
28 __FBSDID("$FreeBSD$");
32 #include <sys/param.h>
33 #include <sys/systm.h>
34 #include <sys/kernel.h>
35 #include <sys/kthread.h>
38 #include <sys/mutex.h>
39 #include <sys/namei.h>
41 #include <sys/vnode.h>
43 #include <sys/malloc.h>
44 #include <sys/unistd.h>
45 #include <sys/fcntl.h>
46 #include <sys/eventhandler.h>
48 /* Async. Logging Queue */
50 int aq_entmax; /* Max entries */
51 int aq_entlen; /* Entry length */
52 char *aq_entbuf; /* Buffer for stored entries */
53 int aq_flags; /* Queue flags */
54 struct mtx aq_mtx; /* Queue lock */
55 struct vnode *aq_vp; /* Open vnode handle */
56 struct ucred *aq_cred; /* Credentials of the opening thread */
57 struct ale *aq_first; /* First ent */
58 struct ale *aq_entfree; /* First free ent */
59 struct ale *aq_entvalid; /* First ent valid for writing */
60 LIST_ENTRY(alq) aq_act; /* List of active queues */
61 LIST_ENTRY(alq) aq_link; /* List of all queues */
64 #define AQ_WANTED 0x0001 /* Wakeup sleeper when io is done */
65 #define AQ_ACTIVE 0x0002 /* on the active list */
66 #define AQ_FLUSHING 0x0004 /* doing IO */
67 #define AQ_SHUTDOWN 0x0008 /* Queue no longer valid */
69 #define ALQ_LOCK(alq) mtx_lock_spin(&(alq)->aq_mtx)
70 #define ALQ_UNLOCK(alq) mtx_unlock_spin(&(alq)->aq_mtx)
72 static MALLOC_DEFINE(M_ALD, "ALD", "ALD");
75 * The ald_mtx protects the ald_queues list and the ald_active list.
77 static struct mtx ald_mtx;
78 static LIST_HEAD(, alq) ald_queues;
79 static LIST_HEAD(, alq) ald_active;
80 static int ald_shutingdown = 0;
81 struct thread *ald_thread;
82 static struct proc *ald_proc;
84 #define ALD_LOCK() mtx_lock(&ald_mtx)
85 #define ALD_UNLOCK() mtx_unlock(&ald_mtx)
87 /* Daemon functions */
88 static int ald_add(struct alq *);
89 static int ald_rem(struct alq *);
90 static void ald_startup(void *);
91 static void ald_daemon(void);
92 static void ald_shutdown(void *, int);
93 static void ald_activate(struct alq *);
94 static void ald_deactivate(struct alq *);
96 /* Internal queue functions */
97 static void alq_shutdown(struct alq *);
98 static int alq_doio(struct alq *);
102 * Add a new queue to the global list. Fail if we're shutting down.
105 ald_add(struct alq *alq)
112 if (ald_shutingdown) {
116 LIST_INSERT_HEAD(&ald_queues, alq, aq_link);
123 * Remove a queue from the global list unless we're shutting down. If so,
124 * the ald will take care of cleaning up it's resources.
127 ald_rem(struct alq *alq)
134 if (ald_shutingdown) {
138 LIST_REMOVE(alq, aq_link);
145 * Put a queue on the active list. This will schedule it for writing.
148 ald_activate(struct alq *alq)
150 LIST_INSERT_HEAD(&ald_active, alq, aq_act);
155 ald_deactivate(struct alq *alq)
157 LIST_REMOVE(alq, aq_act);
158 alq->aq_flags &= ~AQ_ACTIVE;
162 ald_startup(void *unused)
164 mtx_init(&ald_mtx, "ALDmtx", NULL, MTX_DEF|MTX_QUIET);
165 LIST_INIT(&ald_queues);
166 LIST_INIT(&ald_active);
177 ald_thread = FIRST_THREAD_IN_PROC(ald_proc);
179 EVENTHANDLER_REGISTER(shutdown_pre_sync, ald_shutdown, NULL,
185 while ((alq = LIST_FIRST(&ald_active)) == NULL)
186 msleep(&ald_active, &ald_mtx, PWAIT, "aldslp", 0);
191 needwakeup = alq_doio(alq);
200 ald_shutdown(void *arg, int howto)
207 while ((alq = LIST_FIRST(&ald_queues)) != NULL) {
208 LIST_REMOVE(alq, aq_link);
217 alq_shutdown(struct alq *alq)
221 /* Stop any new writers. */
222 alq->aq_flags |= AQ_SHUTDOWN;
225 while (alq->aq_flags & (AQ_FLUSHING|AQ_ACTIVE)) {
226 alq->aq_flags |= AQ_WANTED;
228 tsleep(alq, PWAIT, "aldclose", 0);
233 vn_close(alq->aq_vp, FWRITE, alq->aq_cred,
235 crfree(alq->aq_cred);
239 * Flush all pending data to disk. This operation will block.
242 alq_doio(struct alq *alq)
248 struct iovec aiov[2];
259 alstart = ale = alq->aq_entvalid;
260 alq->aq_entvalid = NULL;
262 bzero(&aiov, sizeof(aiov));
263 bzero(&auio, sizeof(auio));
266 if (aiov[iov].iov_base == NULL)
267 aiov[iov].iov_base = ale->ae_data;
268 aiov[iov].iov_len += alq->aq_entlen;
269 totlen += alq->aq_entlen;
270 /* Check to see if we're wrapping the buffer */
271 if (ale->ae_data + alq->aq_entlen != ale->ae_next->ae_data)
273 ale->ae_flags &= ~AE_VALID;
275 } while (ale->ae_flags & AE_VALID);
277 alq->aq_flags |= AQ_FLUSHING;
280 if (iov == 2 || aiov[iov].iov_base == NULL)
283 auio.uio_iov = &aiov[0];
285 auio.uio_segflg = UIO_SYSSPACE;
286 auio.uio_rw = UIO_WRITE;
287 auio.uio_iovcnt = iov + 1;
288 auio.uio_resid = totlen;
292 * Do all of the junk required to write now.
294 vn_start_write(vp, &mp, V_WAIT);
295 vn_lock(vp, LK_EXCLUSIVE | LK_RETRY, td);
296 VOP_LEASE(vp, td, alq->aq_cred, LEASE_WRITE);
298 * XXX: VOP_WRITE error checks are ignored.
301 if (mac_check_vnode_write(alq->aq_cred, NOCRED, vp) == 0)
303 VOP_WRITE(vp, &auio, IO_UNIT | IO_APPEND, alq->aq_cred);
304 VOP_UNLOCK(vp, 0, td);
305 vn_finished_write(mp);
308 alq->aq_flags &= ~AQ_FLUSHING;
310 if (alq->aq_entfree == NULL)
311 alq->aq_entfree = alstart;
313 if (alq->aq_flags & AQ_WANTED) {
314 alq->aq_flags &= ~AQ_WANTED;
321 static struct kproc_desc ald_kp = {
327 SYSINIT(aldthread, SI_SUB_KTHREAD_IDLE, SI_ORDER_ANY, kproc_start, &ald_kp)
328 SYSINIT(ald, SI_SUB_LOCK, SI_ORDER_ANY, ald_startup, NULL)
331 /* User visible queue functions */
334 * Create the queue data structure, allocate the buffer, and open the file.
337 alq_open(struct alq **alqp, const char *file, struct ucred *cred, int cmode,
353 NDINIT(&nd, LOOKUP, NOFOLLOW, UIO_SYSSPACE, file, td);
354 flags = FWRITE | O_NOFOLLOW | O_CREAT;
356 error = vn_open_cred(&nd, &flags, cmode, cred, -1);
360 NDFREE(&nd, NDF_ONLY_PNBUF);
361 /* We just unlock so we hold a reference */
362 VOP_UNLOCK(nd.ni_vp, 0, td);
364 alq = malloc(sizeof(*alq), M_ALD, M_WAITOK|M_ZERO);
365 alq->aq_entbuf = malloc(count * size, M_ALD, M_WAITOK|M_ZERO);
366 alq->aq_first = malloc(sizeof(*ale) * count, M_ALD, M_WAITOK|M_ZERO);
367 alq->aq_vp = nd.ni_vp;
368 alq->aq_cred = crhold(cred);
369 alq->aq_entmax = count;
370 alq->aq_entlen = size;
371 alq->aq_entfree = alq->aq_first;
373 mtx_init(&alq->aq_mtx, "ALD Queue", NULL, MTX_SPIN|MTX_QUIET);
375 bufp = alq->aq_entbuf;
379 /* Match up entries with buffers */
380 for (i = 0; i < count; i++) {
389 alp->ae_next = alq->aq_first;
391 if ((error = ald_add(alq)) != 0)
399 * Copy a new entry into the queue. If the operation would block either
400 * wait or return an error depending on the value of waitok.
403 alq_write(struct alq *alq, void *data, int waitok)
407 if ((ale = alq_get(alq, waitok)) == NULL)
408 return (EWOULDBLOCK);
410 bcopy(data, ale->ae_data, alq->aq_entlen);
417 alq_get(struct alq *alq, int waitok)
426 /* Loop until we get an entry or we're shutting down */
427 while ((alq->aq_flags & AQ_SHUTDOWN) == 0 &&
428 (ale = alq->aq_entfree) == NULL &&
429 (waitok & ALQ_WAITOK)) {
430 alq->aq_flags |= AQ_WANTED;
432 tsleep(alq, PWAIT, "alqget", 0);
438 if ((aln->ae_flags & AE_VALID) == 0)
439 alq->aq_entfree = aln;
441 alq->aq_entfree = NULL;
450 alq_post(struct alq *alq, struct ale *ale)
454 ale->ae_flags |= AE_VALID;
456 if (alq->aq_entvalid == NULL)
457 alq->aq_entvalid = ale;
459 if ((alq->aq_flags & AQ_ACTIVE) == 0) {
460 alq->aq_flags |= AQ_ACTIVE;
474 alq_flush(struct alq *alq)
480 if (alq->aq_flags & AQ_ACTIVE) {
483 needwakeup = alq_doio(alq);
493 * Flush remaining data, close the file and free all resources.
496 alq_close(struct alq *alq)
499 * If we're already shuting down someone else will flush and close
502 if (ald_rem(alq) != 0)
506 * Drain all pending IO.
510 mtx_destroy(&alq->aq_mtx);
511 free(alq->aq_first, M_ALD);
512 free(alq->aq_entbuf, M_ALD);