1f6d4a8a7SRobert Watson /*-
251369649SPedro F. Giffuni * SPDX-License-Identifier: BSD-3-Clause
351369649SPedro F. Giffuni *
4b713bf6eSRobert Watson * Copyright (c) 1999-2008 Apple Inc.
52ddefb6dSRobert Watson * Copyright (c) 2006-2008, 2016, 2018 Robert N. M. Watson
608e57af4SRobert Watson * All rights reserved.
708e57af4SRobert Watson *
81811d6bfSRobert Watson * Portions of this software were developed by BAE Systems, the University of
91811d6bfSRobert Watson * Cambridge Computer Laboratory, and Memorial University under DARPA/AFRL
101811d6bfSRobert Watson * contract FA8650-15-C-7558 ("CADETS"), as part of the DARPA Transparent
111811d6bfSRobert Watson * Computing (TC) research program.
121811d6bfSRobert Watson *
1308e57af4SRobert Watson * Redistribution and use in source and binary forms, with or without
1408e57af4SRobert Watson * modification, are permitted provided that the following conditions
1508e57af4SRobert Watson * are met:
1608e57af4SRobert Watson * 1. Redistributions of source code must retain the above copyright
1708e57af4SRobert Watson * notice, this list of conditions and the following disclaimer.
1808e57af4SRobert Watson * 2. Redistributions in binary form must reproduce the above copyright
1908e57af4SRobert Watson * notice, this list of conditions and the following disclaimer in the
2008e57af4SRobert Watson * documentation and/or other materials provided with the distribution.
21bc9a43d6SRobert Watson * 3. Neither the name of Apple Inc. ("Apple") nor the names of
2208e57af4SRobert Watson * its contributors may be used to endorse or promote products derived
2308e57af4SRobert Watson * from this software without specific prior written permission.
2408e57af4SRobert Watson *
2508e57af4SRobert Watson * THIS SOFTWARE IS PROVIDED BY APPLE AND ITS CONTRIBUTORS "AS IS" AND
2608e57af4SRobert Watson * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
2708e57af4SRobert Watson * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
2808e57af4SRobert Watson * ARE DISCLAIMED. IN NO EVENT SHALL APPLE OR ITS CONTRIBUTORS BE LIABLE FOR
2908e57af4SRobert Watson * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
3008e57af4SRobert Watson * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
3108e57af4SRobert Watson * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
3208e57af4SRobert Watson * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
3308e57af4SRobert Watson * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
3408e57af4SRobert Watson * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
3508e57af4SRobert Watson * POSSIBILITY OF SUCH DAMAGE.
3608e57af4SRobert Watson */
3708e57af4SRobert Watson
3808e57af4SRobert Watson #include <sys/param.h>
3908e57af4SRobert Watson #include <sys/condvar.h>
4008e57af4SRobert Watson #include <sys/conf.h>
4108e57af4SRobert Watson #include <sys/file.h>
4208e57af4SRobert Watson #include <sys/filedesc.h>
4308e57af4SRobert Watson #include <sys/fcntl.h>
4408e57af4SRobert Watson #include <sys/ipc.h>
4508e57af4SRobert Watson #include <sys/kernel.h>
4608e57af4SRobert Watson #include <sys/kthread.h>
4708e57af4SRobert Watson #include <sys/malloc.h>
4808e57af4SRobert Watson #include <sys/mount.h>
4908e57af4SRobert Watson #include <sys/namei.h>
5008e57af4SRobert Watson #include <sys/proc.h>
5108e57af4SRobert Watson #include <sys/queue.h>
5208e57af4SRobert Watson #include <sys/socket.h>
5308e57af4SRobert Watson #include <sys/socketvar.h>
5408e57af4SRobert Watson #include <sys/protosw.h>
5508e57af4SRobert Watson #include <sys/domain.h>
56*e453e498SBrooks Davis #include <sys/stdarg.h>
57ae87be44SRobert Watson #include <sys/sx.h>
5808e57af4SRobert Watson #include <sys/sysproto.h>
5908e57af4SRobert Watson #include <sys/sysent.h>
6008e57af4SRobert Watson #include <sys/systm.h>
6108e57af4SRobert Watson #include <sys/ucred.h>
6208e57af4SRobert Watson #include <sys/uio.h>
6308e57af4SRobert Watson #include <sys/un.h>
6408e57af4SRobert Watson #include <sys/unistd.h>
6508e57af4SRobert Watson #include <sys/vnode.h>
6608e57af4SRobert Watson
6708e57af4SRobert Watson #include <bsm/audit.h>
6808e57af4SRobert Watson #include <bsm/audit_internal.h>
6908e57af4SRobert Watson #include <bsm/audit_kevents.h>
7008e57af4SRobert Watson
7108e57af4SRobert Watson #include <netinet/in.h>
7208e57af4SRobert Watson #include <netinet/in_pcb.h>
7308e57af4SRobert Watson
7408e57af4SRobert Watson #include <security/audit/audit.h>
7508e57af4SRobert Watson #include <security/audit/audit_private.h>
7608e57af4SRobert Watson
7708e57af4SRobert Watson #include <vm/uma.h>
7808e57af4SRobert Watson
7908e57af4SRobert Watson /*
8008e57af4SRobert Watson * Worker thread that will schedule disk I/O, etc.
8108e57af4SRobert Watson */
8208e57af4SRobert Watson static struct proc *audit_thread;
8308e57af4SRobert Watson
8408e57af4SRobert Watson /*
85ae87be44SRobert Watson * audit_cred and audit_vp are the stored credential and vnode to use for
86b713bf6eSRobert Watson * active audit trail. They are protected by the audit worker lock, which
87b713bf6eSRobert Watson * will be held across all I/O and all rotation to prevent them from being
88b713bf6eSRobert Watson * replaced (rotated) while in use. The audit_file_rotate_wait flag is set
89b713bf6eSRobert Watson * when the kernel has delivered a trigger to auditd to rotate the trail, and
90b713bf6eSRobert Watson * is cleared when the next rotation takes place. It is also protected by
91b713bf6eSRobert Watson * the audit worker lock.
9208e57af4SRobert Watson */
9308e57af4SRobert Watson static int audit_file_rotate_wait;
94ae87be44SRobert Watson static struct ucred *audit_cred;
95ae87be44SRobert Watson static struct vnode *audit_vp;
9662931404SPawel Jakub Dawidek static off_t audit_size;
97b713bf6eSRobert Watson static struct sx audit_worker_lock;
98b713bf6eSRobert Watson
99b713bf6eSRobert Watson #define AUDIT_WORKER_LOCK_INIT() sx_init(&audit_worker_lock, \
100b713bf6eSRobert Watson "audit_worker_lock");
101b713bf6eSRobert Watson #define AUDIT_WORKER_LOCK_ASSERT() sx_assert(&audit_worker_lock, \
102b713bf6eSRobert Watson SA_XLOCKED)
103b713bf6eSRobert Watson #define AUDIT_WORKER_LOCK() sx_xlock(&audit_worker_lock)
104b713bf6eSRobert Watson #define AUDIT_WORKER_UNLOCK() sx_xunlock(&audit_worker_lock)
10508e57af4SRobert Watson
10627725229SKonstantin Belousov static void
audit_worker_sync_vp(struct vnode * vp,struct mount * mp,const char * fmt,...)10727725229SKonstantin Belousov audit_worker_sync_vp(struct vnode *vp, struct mount *mp, const char *fmt, ...)
10827725229SKonstantin Belousov {
10927725229SKonstantin Belousov struct mount *mp1;
11027725229SKonstantin Belousov int error;
11127725229SKonstantin Belousov va_list va;
11227725229SKonstantin Belousov
11327725229SKonstantin Belousov va_start(va, fmt);
11427725229SKonstantin Belousov error = vn_start_write(vp, &mp1, 0);
11527725229SKonstantin Belousov if (error == 0) {
11627725229SKonstantin Belousov VOP_LOCK(vp, LK_EXCLUSIVE | LK_RETRY);
11727725229SKonstantin Belousov (void)VOP_FSYNC(vp, MNT_WAIT, curthread);
118b249ce48SMateusz Guzik VOP_UNLOCK(vp);
11927725229SKonstantin Belousov vn_finished_write(mp1);
12027725229SKonstantin Belousov }
12127725229SKonstantin Belousov vfs_unbusy(mp);
12227725229SKonstantin Belousov vpanic(fmt, va);
12327725229SKonstantin Belousov va_end(va);
12427725229SKonstantin Belousov }
12527725229SKonstantin Belousov
12608e57af4SRobert Watson /*
12722b7bca6SRobert Watson * Write an audit record to a file, performed as the last stage after both
12822b7bca6SRobert Watson * preselection and BSM conversion. Both space management and write failures
12922b7bca6SRobert Watson * are handled in this function.
13022b7bca6SRobert Watson *
13122b7bca6SRobert Watson * No attempt is made to deal with possible failure to deliver a trigger to
13222b7bca6SRobert Watson * the audit daemon, since the message is asynchronous anyway.
13308e57af4SRobert Watson */
13422b7bca6SRobert Watson static void
audit_record_write(struct vnode * vp,struct ucred * cred,void * data,size_t len)135ae87be44SRobert Watson audit_record_write(struct vnode *vp, struct ucred *cred, void *data,
136ae87be44SRobert Watson size_t len)
13708e57af4SRobert Watson {
13822b7bca6SRobert Watson static struct timeval last_lowspace_trigger;
13922b7bca6SRobert Watson static struct timeval last_fail;
14022b7bca6SRobert Watson static int cur_lowspace_trigger;
141a7cbec44SRobert Watson struct statfs *mnt_stat;
14227725229SKonstantin Belousov struct mount *mp;
1435050aa86SKonstantin Belousov int error;
14422b7bca6SRobert Watson static int cur_fail;
14522b7bca6SRobert Watson long temp;
14608e57af4SRobert Watson
147b713bf6eSRobert Watson AUDIT_WORKER_LOCK_ASSERT();
148ae87be44SRobert Watson
14932962122SRobert Watson if (vp == NULL)
15022b7bca6SRobert Watson return;
15132962122SRobert Watson
15227725229SKonstantin Belousov mp = vp->v_mount;
15327725229SKonstantin Belousov if (mp == NULL) {
15427725229SKonstantin Belousov error = EINVAL;
15527725229SKonstantin Belousov goto fail;
15627725229SKonstantin Belousov }
15727725229SKonstantin Belousov error = vfs_busy(mp, 0);
15827725229SKonstantin Belousov if (error != 0) {
15927725229SKonstantin Belousov mp = NULL;
16027725229SKonstantin Belousov goto fail;
16127725229SKonstantin Belousov }
16227725229SKonstantin Belousov mnt_stat = &mp->mnt_stat;
16308e57af4SRobert Watson
16408e57af4SRobert Watson /*
165871499feSRobert Watson * First, gather statistics on the audit log file and file system so
16622b7bca6SRobert Watson * that we know how we're doing on space. Consider failure of these
16722b7bca6SRobert Watson * operations to indicate a future inability to write to the file.
16808e57af4SRobert Watson */
16927725229SKonstantin Belousov error = VFS_STATFS(mp, mnt_stat);
17027725229SKonstantin Belousov if (error != 0)
17122b7bca6SRobert Watson goto fail;
17208e57af4SRobert Watson
17308e57af4SRobert Watson /*
17422b7bca6SRobert Watson * We handle four different space-related limits:
17522b7bca6SRobert Watson *
17622b7bca6SRobert Watson * - A fixed (hard) limit on the minimum free blocks we require on
17722b7bca6SRobert Watson * the file system, and results in record loss, a trigger, and
17822b7bca6SRobert Watson * possible fail stop due to violating invariants.
17922b7bca6SRobert Watson *
18022b7bca6SRobert Watson * - An administrative (soft) limit, which when fallen below, results
18122b7bca6SRobert Watson * in the kernel notifying the audit daemon of low space.
18222b7bca6SRobert Watson *
18322b7bca6SRobert Watson * - An audit trail size limit, which when gone above, results in the
18422b7bca6SRobert Watson * kernel notifying the audit daemon that rotation is desired.
18522b7bca6SRobert Watson *
18622b7bca6SRobert Watson * - The total depth of the kernel audit record exceeding free space,
18722b7bca6SRobert Watson * which can lead to possible fail stop (with drain), in order to
18822b7bca6SRobert Watson * prevent violating invariants. Failure here doesn't halt
18922b7bca6SRobert Watson * immediately, but prevents new records from being generated.
19022b7bca6SRobert Watson *
19122b7bca6SRobert Watson * Possibly, the last of these should be handled differently, always
19222b7bca6SRobert Watson * allowing a full queue to be lost, rather than trying to prevent
19322b7bca6SRobert Watson * loss.
19422b7bca6SRobert Watson *
19522b7bca6SRobert Watson * First, handle the hard limit, which generates a trigger and may
19622b7bca6SRobert Watson * fail stop. This is handled in the same manner as ENOSPC from
19722b7bca6SRobert Watson * VOP_WRITE, and results in record loss.
19808e57af4SRobert Watson */
19908e57af4SRobert Watson if (mnt_stat->f_bfree < AUDIT_HARD_LIMIT_FREE_BLOCKS) {
20022b7bca6SRobert Watson error = ENOSPC;
20122b7bca6SRobert Watson goto fail_enospc;
20208e57af4SRobert Watson }
20308e57af4SRobert Watson
204871499feSRobert Watson /*
20522b7bca6SRobert Watson * Second, handle falling below the soft limit, if defined; we send
20622b7bca6SRobert Watson * the daemon a trigger and continue processing the record. Triggers
20722b7bca6SRobert Watson * are limited to 1/sec.
20808e57af4SRobert Watson */
20922b7bca6SRobert Watson if (audit_qctrl.aq_minfree != 0) {
21022b7bca6SRobert Watson temp = mnt_stat->f_blocks / (100 / audit_qctrl.aq_minfree);
21122b7bca6SRobert Watson if (mnt_stat->f_bfree < temp) {
21222b7bca6SRobert Watson if (ppsratecheck(&last_lowspace_trigger,
21322b7bca6SRobert Watson &cur_lowspace_trigger, 1)) {
214fb4ed8c9SRobert Watson (void)audit_send_trigger(
215fb4ed8c9SRobert Watson AUDIT_TRIGGER_LOW_SPACE);
2163bff0167SSimon L. B. Nielsen printf("Warning: disk space low (< %d%% free) "
2173bff0167SSimon L. B. Nielsen "on audit log file-system\n",
2183bff0167SSimon L. B. Nielsen audit_qctrl.aq_minfree);
21922b7bca6SRobert Watson }
22022b7bca6SRobert Watson }
22122b7bca6SRobert Watson }
22222b7bca6SRobert Watson
22322b7bca6SRobert Watson /*
22422b7bca6SRobert Watson * If the current file is getting full, generate a rotation trigger
22522b7bca6SRobert Watson * to the daemon. This is only approximate, which is fine as more
22622b7bca6SRobert Watson * records may be generated before the daemon rotates the file.
22722b7bca6SRobert Watson */
2281d8cd15cSPawel Jakub Dawidek if (audit_fstat.af_filesz != 0 &&
2291d8cd15cSPawel Jakub Dawidek audit_size >= audit_fstat.af_filesz * (audit_file_rotate_wait + 1)) {
230b713bf6eSRobert Watson AUDIT_WORKER_LOCK_ASSERT();
231ae87be44SRobert Watson
2321d8cd15cSPawel Jakub Dawidek audit_file_rotate_wait++;
233fb4ed8c9SRobert Watson (void)audit_send_trigger(AUDIT_TRIGGER_ROTATE_KERNEL);
23408e57af4SRobert Watson }
23508e57af4SRobert Watson
23608e57af4SRobert Watson /*
23708e57af4SRobert Watson * If the estimated amount of audit data in the audit event queue
238871499feSRobert Watson * (plus records allocated but not yet queued) has reached the amount
239871499feSRobert Watson * of free space on the disk, then we need to go into an audit fail
240871499feSRobert Watson * stop state, in which we do not permit the allocation/committing of
24122b7bca6SRobert Watson * any new audit records. We continue to process records but don't
242871499feSRobert Watson * allow any activities that might generate new records. In the
243871499feSRobert Watson * future, we might want to detect when space is available again and
244871499feSRobert Watson * allow operation to continue, but this behavior is sufficient to
245871499feSRobert Watson * meet fail stop requirements in CAPP.
24608e57af4SRobert Watson */
24722b7bca6SRobert Watson if (audit_fail_stop) {
24822b7bca6SRobert Watson if ((unsigned long)((audit_q_len + audit_pre_q_len + 1) *
24922b7bca6SRobert Watson MAX_AUDIT_RECORD_SIZE) / mnt_stat->f_bsize >=
25022b7bca6SRobert Watson (unsigned long)(mnt_stat->f_bfree)) {
25122b7bca6SRobert Watson if (ppsratecheck(&last_fail, &cur_fail, 1))
25222b7bca6SRobert Watson printf("audit_record_write: free space "
25322b7bca6SRobert Watson "below size of audit queue, failing "
25422b7bca6SRobert Watson "stop\n");
25508e57af4SRobert Watson audit_in_failure = 1;
25622b7bca6SRobert Watson } else if (audit_in_failure) {
25722b7bca6SRobert Watson /*
2581afabae4SRobert Watson * Note: if we want to handle recovery, this is the
25922b7bca6SRobert Watson * spot to do it: unset audit_in_failure, and issue a
26022b7bca6SRobert Watson * wakeup on the cv.
26122b7bca6SRobert Watson */
26222b7bca6SRobert Watson }
26308e57af4SRobert Watson }
26408e57af4SRobert Watson
26522b7bca6SRobert Watson error = vn_rdwr(UIO_WRITE, vp, data, len, (off_t)0, UIO_SYSSPACE,
266ae87be44SRobert Watson IO_APPEND|IO_UNIT, cred, NULL, NULL, curthread);
26722b7bca6SRobert Watson if (error == ENOSPC)
26822b7bca6SRobert Watson goto fail_enospc;
26922b7bca6SRobert Watson else if (error)
27022b7bca6SRobert Watson goto fail;
27162931404SPawel Jakub Dawidek AUDIT_WORKER_LOCK_ASSERT();
27262931404SPawel Jakub Dawidek audit_size += len;
27308e57af4SRobert Watson
27408e57af4SRobert Watson /*
27522b7bca6SRobert Watson * Catch completion of a queue drain here; if we're draining and the
27622b7bca6SRobert Watson * queue is now empty, fail stop. That audit_fail_stop is implicitly
27722b7bca6SRobert Watson * true, since audit_in_failure can only be set of audit_fail_stop is
27822b7bca6SRobert Watson * set.
27922b7bca6SRobert Watson *
2801afabae4SRobert Watson * Note: if we handle recovery from audit_in_failure, then we need to
2811afabae4SRobert Watson * make panic here conditional.
28208e57af4SRobert Watson */
28322b7bca6SRobert Watson if (audit_in_failure) {
28422b7bca6SRobert Watson if (audit_q_len == 0 && audit_pre_q_len == 0) {
28527725229SKonstantin Belousov audit_worker_sync_vp(vp, mp,
28627725229SKonstantin Belousov "Audit store overflow; record queue drained.");
28708e57af4SRobert Watson }
28822b7bca6SRobert Watson }
28908e57af4SRobert Watson
29027725229SKonstantin Belousov vfs_unbusy(mp);
29122b7bca6SRobert Watson return;
29208e57af4SRobert Watson
29322b7bca6SRobert Watson fail_enospc:
29422b7bca6SRobert Watson /*
29522b7bca6SRobert Watson * ENOSPC is considered a special case with respect to failures, as
29622b7bca6SRobert Watson * this can reflect either our preemptive detection of insufficient
29722b7bca6SRobert Watson * space, or ENOSPC returned by the vnode write call.
29822b7bca6SRobert Watson */
29922b7bca6SRobert Watson if (audit_fail_stop) {
30027725229SKonstantin Belousov audit_worker_sync_vp(vp, mp,
30127725229SKonstantin Belousov "Audit log space exhausted and fail-stop set.");
30222b7bca6SRobert Watson }
303fb4ed8c9SRobert Watson (void)audit_send_trigger(AUDIT_TRIGGER_NO_SPACE);
3042ddefb6dSRobert Watson audit_trail_suspended = 1;
3052ddefb6dSRobert Watson audit_syscalls_enabled_update();
30622b7bca6SRobert Watson
30722b7bca6SRobert Watson /* FALLTHROUGH */
30822b7bca6SRobert Watson fail:
30922b7bca6SRobert Watson /*
31022b7bca6SRobert Watson * We have failed to write to the file, so the current record is
31122b7bca6SRobert Watson * lost, which may require an immediate system halt.
31222b7bca6SRobert Watson */
31322b7bca6SRobert Watson if (audit_panic_on_write_fail) {
31427725229SKonstantin Belousov audit_worker_sync_vp(vp, mp,
31527725229SKonstantin Belousov "audit_worker: write error %d\n", error);
31622b7bca6SRobert Watson } else if (ppsratecheck(&last_fail, &cur_fail, 1))
31722b7bca6SRobert Watson printf("audit_worker: write error %d\n", error);
31827725229SKonstantin Belousov if (mp != NULL)
31927725229SKonstantin Belousov vfs_unbusy(mp);
32008e57af4SRobert Watson }
32108e57af4SRobert Watson
32208e57af4SRobert Watson /*
32332962122SRobert Watson * Given a kernel audit record, process as required. Kernel audit records
32432962122SRobert Watson * are converted to one, or possibly two, BSM records, depending on whether
32532962122SRobert Watson * there is a user audit record present also. Kernel records need be
32632962122SRobert Watson * converted to BSM before they can be written out. Both types will be
32732962122SRobert Watson * written to disk, and audit pipes.
32862bb2e91SRobert Watson */
32962bb2e91SRobert Watson static void
audit_worker_process_record(struct kaudit_record * ar)330ae87be44SRobert Watson audit_worker_process_record(struct kaudit_record *ar)
33162bb2e91SRobert Watson {
33232962122SRobert Watson struct au_record *bsm;
333e257c20eSRobert Watson au_class_t class;
334e257c20eSRobert Watson au_event_t event;
335e257c20eSRobert Watson au_id_t auid;
33622b7bca6SRobert Watson int error, sorf;
337b713bf6eSRobert Watson int locked;
338ae87be44SRobert Watson
339ae87be44SRobert Watson /*
340b713bf6eSRobert Watson * We hold the audit worker lock over both writes, if there are two,
341b713bf6eSRobert Watson * so that the two records won't be split across a rotation and end
342b713bf6eSRobert Watson * up in two different trail files.
343ae87be44SRobert Watson */
344ae87be44SRobert Watson if (((ar->k_ar_commit & AR_COMMIT_USER) &&
345ae87be44SRobert Watson (ar->k_ar_commit & AR_PRESELECT_USER_TRAIL)) ||
346ae87be44SRobert Watson (ar->k_ar_commit & AR_PRESELECT_TRAIL)) {
347b713bf6eSRobert Watson AUDIT_WORKER_LOCK();
348b713bf6eSRobert Watson locked = 1;
349ae87be44SRobert Watson } else
350b713bf6eSRobert Watson locked = 0;
35162bb2e91SRobert Watson
35222b7bca6SRobert Watson /*
35322b7bca6SRobert Watson * First, handle the user record, if any: commit to the system trail
35422b7bca6SRobert Watson * and audit pipes as selected.
35522b7bca6SRobert Watson */
356e257c20eSRobert Watson if ((ar->k_ar_commit & AR_COMMIT_USER) &&
357ae87be44SRobert Watson (ar->k_ar_commit & AR_PRESELECT_USER_TRAIL)) {
358b713bf6eSRobert Watson AUDIT_WORKER_LOCK_ASSERT();
359ae87be44SRobert Watson audit_record_write(audit_vp, audit_cred, ar->k_udata,
360ae87be44SRobert Watson ar->k_ulen);
361ae87be44SRobert Watson }
362f07b8369SChristian S.J. Peron
363e257c20eSRobert Watson if ((ar->k_ar_commit & AR_COMMIT_USER) &&
364f07b8369SChristian S.J. Peron (ar->k_ar_commit & AR_PRESELECT_USER_PIPE))
365e257c20eSRobert Watson audit_pipe_submit_user(ar->k_udata, ar->k_ulen);
36632962122SRobert Watson
367f07b8369SChristian S.J. Peron if (!(ar->k_ar_commit & AR_COMMIT_KERNEL) ||
368f07b8369SChristian S.J. Peron ((ar->k_ar_commit & AR_PRESELECT_PIPE) == 0 &&
3691811d6bfSRobert Watson (ar->k_ar_commit & AR_PRESELECT_TRAIL) == 0 &&
3701811d6bfSRobert Watson (ar->k_ar_commit & AR_PRESELECT_DTRACE) == 0))
371ae87be44SRobert Watson goto out;
372e257c20eSRobert Watson
373e257c20eSRobert Watson auid = ar->k_ar.ar_subj_auid;
374e257c20eSRobert Watson event = ar->k_ar.ar_event;
375e257c20eSRobert Watson class = au_event_class(event);
376e257c20eSRobert Watson if (ar->k_ar.ar_errno == 0)
377e257c20eSRobert Watson sorf = AU_PRS_SUCCESS;
378e257c20eSRobert Watson else
379e257c20eSRobert Watson sorf = AU_PRS_FAILURE;
380e257c20eSRobert Watson
38122b7bca6SRobert Watson error = kaudit_to_bsm(ar, &bsm);
38222b7bca6SRobert Watson switch (error) {
38332962122SRobert Watson case BSM_NOAUDIT:
384ae87be44SRobert Watson goto out;
38532962122SRobert Watson
38632962122SRobert Watson case BSM_FAILURE:
38732962122SRobert Watson printf("audit_worker_process_record: BSM_FAILURE\n");
388ae87be44SRobert Watson goto out;
38932962122SRobert Watson
39032962122SRobert Watson case BSM_SUCCESS:
391e257c20eSRobert Watson break;
392e257c20eSRobert Watson
393e257c20eSRobert Watson default:
39422b7bca6SRobert Watson panic("kaudit_to_bsm returned %d", error);
395e257c20eSRobert Watson }
396e257c20eSRobert Watson
397ae87be44SRobert Watson if (ar->k_ar_commit & AR_PRESELECT_TRAIL) {
398b713bf6eSRobert Watson AUDIT_WORKER_LOCK_ASSERT();
399ae87be44SRobert Watson audit_record_write(audit_vp, audit_cred, bsm->data, bsm->len);
400ae87be44SRobert Watson }
401f07b8369SChristian S.J. Peron
402e257c20eSRobert Watson if (ar->k_ar_commit & AR_PRESELECT_PIPE)
403e257c20eSRobert Watson audit_pipe_submit(auid, event, class, sorf,
404e257c20eSRobert Watson ar->k_ar_commit & AR_PRESELECT_TRAIL, bsm->data,
405e257c20eSRobert Watson bsm->len);
40622b7bca6SRobert Watson
4071811d6bfSRobert Watson #ifdef KDTRACE_HOOKS
4081811d6bfSRobert Watson /*
4091811d6bfSRobert Watson * Version of the dtaudit commit hook that accepts BSM.
4101811d6bfSRobert Watson */
4111811d6bfSRobert Watson if (ar->k_ar_commit & AR_PRESELECT_DTRACE) {
4121811d6bfSRobert Watson if (dtaudit_hook_bsm != NULL)
4131811d6bfSRobert Watson dtaudit_hook_bsm(ar, auid, event, class, sorf,
4141811d6bfSRobert Watson bsm->data, bsm->len);
4151811d6bfSRobert Watson }
4161811d6bfSRobert Watson #endif
4171811d6bfSRobert Watson
41832962122SRobert Watson kau_free(bsm);
419ae87be44SRobert Watson out:
420b713bf6eSRobert Watson if (locked)
421b713bf6eSRobert Watson AUDIT_WORKER_UNLOCK();
42262bb2e91SRobert Watson }
42362bb2e91SRobert Watson
42462bb2e91SRobert Watson /*
42508e57af4SRobert Watson * The audit_worker thread is responsible for watching the event queue,
42608e57af4SRobert Watson * dequeueing records, converting them to BSM format, and committing them to
42708e57af4SRobert Watson * disk. In order to minimize lock thrashing, records are dequeued in sets
428ae87be44SRobert Watson * to a thread-local work queue.
429ae87be44SRobert Watson *
430ae87be44SRobert Watson * Note: this means that the effect bound on the size of the pending record
431ae87be44SRobert Watson * queue is 2x the length of the global queue.
43208e57af4SRobert Watson */
43308e57af4SRobert Watson static void
audit_worker(void * arg)43408e57af4SRobert Watson audit_worker(void *arg)
43508e57af4SRobert Watson {
436b3ae6323SRobert Watson struct kaudit_queue ar_worklist;
43708e57af4SRobert Watson struct kaudit_record *ar;
43862bb2e91SRobert Watson int lowater_signal;
43908e57af4SRobert Watson
44008e57af4SRobert Watson TAILQ_INIT(&ar_worklist);
44108e57af4SRobert Watson mtx_lock(&audit_mtx);
44208e57af4SRobert Watson while (1) {
44308e57af4SRobert Watson mtx_assert(&audit_mtx, MA_OWNED);
44408e57af4SRobert Watson
44508e57af4SRobert Watson /*
446ae87be44SRobert Watson * Wait for a record.
44708e57af4SRobert Watson */
448ae87be44SRobert Watson while (TAILQ_EMPTY(&audit_q))
44940c96d72SRobert Watson cv_wait(&audit_worker_cv, &audit_mtx);
45008e57af4SRobert Watson
45108e57af4SRobert Watson /*
4522ca38be3SRobert Watson * If there are records in the global audit record queue,
4532ca38be3SRobert Watson * transfer them to a thread-local queue and process them
4542ca38be3SRobert Watson * one by one. If we cross the low watermark threshold,
4552ca38be3SRobert Watson * signal any waiting processes that they may wake up and
4562ca38be3SRobert Watson * continue generating records.
45708e57af4SRobert Watson */
45808e57af4SRobert Watson lowater_signal = 0;
45908e57af4SRobert Watson while ((ar = TAILQ_FIRST(&audit_q))) {
46008e57af4SRobert Watson TAILQ_REMOVE(&audit_q, ar, k_q);
46108e57af4SRobert Watson audit_q_len--;
46208e57af4SRobert Watson if (audit_q_len == audit_qctrl.aq_lowater)
46308e57af4SRobert Watson lowater_signal++;
46408e57af4SRobert Watson TAILQ_INSERT_TAIL(&ar_worklist, ar, k_q);
46508e57af4SRobert Watson }
46608e57af4SRobert Watson if (lowater_signal)
46740c96d72SRobert Watson cv_broadcast(&audit_watermark_cv);
46808e57af4SRobert Watson
46908e57af4SRobert Watson mtx_unlock(&audit_mtx);
47008e57af4SRobert Watson while ((ar = TAILQ_FIRST(&ar_worklist))) {
47108e57af4SRobert Watson TAILQ_REMOVE(&ar_worklist, ar, k_q);
472ae87be44SRobert Watson audit_worker_process_record(ar);
47308e57af4SRobert Watson audit_free(ar);
47408e57af4SRobert Watson }
47508e57af4SRobert Watson mtx_lock(&audit_mtx);
47608e57af4SRobert Watson }
47708e57af4SRobert Watson }
47808e57af4SRobert Watson
47908e57af4SRobert Watson /*
48008e57af4SRobert Watson * audit_rotate_vnode() is called by a user or kernel thread to configure or
48108e57af4SRobert Watson * de-configure auditing on a vnode. The arguments are the replacement
482ae87be44SRobert Watson * credential (referenced) and vnode (referenced and opened) to substitute
483ae87be44SRobert Watson * for the current credential and vnode, if any. If either is set to NULL,
484ae87be44SRobert Watson * both should be NULL, and this is used to indicate that audit is being
485ae87be44SRobert Watson * disabled. Any previous cred/vnode will be closed and freed. We re-enable
486ae87be44SRobert Watson * generating rotation requests to auditd.
48708e57af4SRobert Watson */
48808e57af4SRobert Watson void
audit_rotate_vnode(struct ucred * cred,struct vnode * vp)48908e57af4SRobert Watson audit_rotate_vnode(struct ucred *cred, struct vnode *vp)
49008e57af4SRobert Watson {
491ae87be44SRobert Watson struct ucred *old_audit_cred;
492ae87be44SRobert Watson struct vnode *old_audit_vp;
49362931404SPawel Jakub Dawidek struct vattr vattr;
494ae87be44SRobert Watson
495ae87be44SRobert Watson KASSERT((cred != NULL && vp != NULL) || (cred == NULL && vp == NULL),
496ae87be44SRobert Watson ("audit_rotate_vnode: cred %p vp %p", cred, vp));
49708e57af4SRobert Watson
49862931404SPawel Jakub Dawidek if (vp != NULL) {
49962931404SPawel Jakub Dawidek vn_lock(vp, LK_SHARED | LK_RETRY);
50062931404SPawel Jakub Dawidek if (VOP_GETATTR(vp, &vattr, cred) != 0)
50162931404SPawel Jakub Dawidek vattr.va_size = 0;
502b249ce48SMateusz Guzik VOP_UNLOCK(vp);
50362931404SPawel Jakub Dawidek } else {
50462931404SPawel Jakub Dawidek vattr.va_size = 0;
50562931404SPawel Jakub Dawidek }
50662931404SPawel Jakub Dawidek
50708e57af4SRobert Watson /*
508ae87be44SRobert Watson * Rotate the vnode/cred, and clear the rotate flag so that we will
509ae87be44SRobert Watson * send a rotate trigger if the new file fills.
51008e57af4SRobert Watson */
511b713bf6eSRobert Watson AUDIT_WORKER_LOCK();
512ae87be44SRobert Watson old_audit_cred = audit_cred;
513ae87be44SRobert Watson old_audit_vp = audit_vp;
514ae87be44SRobert Watson audit_cred = cred;
515ae87be44SRobert Watson audit_vp = vp;
51662931404SPawel Jakub Dawidek audit_size = vattr.va_size;
517ae87be44SRobert Watson audit_file_rotate_wait = 0;
5182ddefb6dSRobert Watson audit_trail_enabled = (audit_vp != NULL);
5192ddefb6dSRobert Watson audit_syscalls_enabled_update();
520b713bf6eSRobert Watson AUDIT_WORKER_UNLOCK();
52108e57af4SRobert Watson
52208e57af4SRobert Watson /*
523ae87be44SRobert Watson * If there was an old vnode/credential, close and free.
52408e57af4SRobert Watson */
525ae87be44SRobert Watson if (old_audit_vp != NULL) {
526ae87be44SRobert Watson vn_close(old_audit_vp, AUDIT_CLOSE_FLAGS, old_audit_cred,
527ae87be44SRobert Watson curthread);
528ae87be44SRobert Watson crfree(old_audit_cred);
529ae87be44SRobert Watson }
53008e57af4SRobert Watson }
53108e57af4SRobert Watson
53208e57af4SRobert Watson void
audit_worker_init(void)53308e57af4SRobert Watson audit_worker_init(void)
53408e57af4SRobert Watson {
53508e57af4SRobert Watson int error;
53608e57af4SRobert Watson
537b713bf6eSRobert Watson AUDIT_WORKER_LOCK_INIT();
5383745c395SJulian Elischer error = kproc_create(audit_worker, NULL, &audit_thread, RFHIGHPID,
5395a9f2d6cSRobert Watson 0, "audit");
54008e57af4SRobert Watson if (error)
5413745c395SJulian Elischer panic("audit_worker_init: kproc_create returned %d", error);
54208e57af4SRobert Watson }
543