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>
56ae87be44SRobert Watson #include <sys/sx.h>
5708e57af4SRobert Watson #include <sys/sysproto.h>
5808e57af4SRobert Watson #include <sys/sysent.h>
5908e57af4SRobert Watson #include <sys/systm.h>
6008e57af4SRobert Watson #include <sys/ucred.h>
6108e57af4SRobert Watson #include <sys/uio.h>
6208e57af4SRobert Watson #include <sys/un.h>
6308e57af4SRobert Watson #include <sys/unistd.h>
6408e57af4SRobert Watson #include <sys/vnode.h>
6508e57af4SRobert Watson
6608e57af4SRobert Watson #include <bsm/audit.h>
6708e57af4SRobert Watson #include <bsm/audit_internal.h>
6808e57af4SRobert Watson #include <bsm/audit_kevents.h>
6908e57af4SRobert Watson
7008e57af4SRobert Watson #include <netinet/in.h>
7108e57af4SRobert Watson #include <netinet/in_pcb.h>
7208e57af4SRobert Watson
7308e57af4SRobert Watson #include <security/audit/audit.h>
7408e57af4SRobert Watson #include <security/audit/audit_private.h>
7508e57af4SRobert Watson
7608e57af4SRobert Watson #include <vm/uma.h>
7708e57af4SRobert Watson
7827725229SKonstantin Belousov #include <machine/stdarg.h>
7927725229SKonstantin Belousov
8008e57af4SRobert Watson /*
8108e57af4SRobert Watson * Worker thread that will schedule disk I/O, etc.
8208e57af4SRobert Watson */
8308e57af4SRobert Watson static struct proc *audit_thread;
8408e57af4SRobert Watson
8508e57af4SRobert Watson /*
86ae87be44SRobert Watson * audit_cred and audit_vp are the stored credential and vnode to use for
87b713bf6eSRobert Watson * active audit trail. They are protected by the audit worker lock, which
88b713bf6eSRobert Watson * will be held across all I/O and all rotation to prevent them from being
89b713bf6eSRobert Watson * replaced (rotated) while in use. The audit_file_rotate_wait flag is set
90b713bf6eSRobert Watson * when the kernel has delivered a trigger to auditd to rotate the trail, and
91b713bf6eSRobert Watson * is cleared when the next rotation takes place. It is also protected by
92b713bf6eSRobert Watson * the audit worker lock.
9308e57af4SRobert Watson */
9408e57af4SRobert Watson static int audit_file_rotate_wait;
95ae87be44SRobert Watson static struct ucred *audit_cred;
96ae87be44SRobert Watson static struct vnode *audit_vp;
9762931404SPawel Jakub Dawidek static off_t audit_size;
98b713bf6eSRobert Watson static struct sx audit_worker_lock;
99b713bf6eSRobert Watson
100b713bf6eSRobert Watson #define AUDIT_WORKER_LOCK_INIT() sx_init(&audit_worker_lock, \
101b713bf6eSRobert Watson "audit_worker_lock");
102b713bf6eSRobert Watson #define AUDIT_WORKER_LOCK_ASSERT() sx_assert(&audit_worker_lock, \
103b713bf6eSRobert Watson SA_XLOCKED)
104b713bf6eSRobert Watson #define AUDIT_WORKER_LOCK() sx_xlock(&audit_worker_lock)
105b713bf6eSRobert Watson #define AUDIT_WORKER_UNLOCK() sx_xunlock(&audit_worker_lock)
10608e57af4SRobert Watson
10727725229SKonstantin Belousov static void
audit_worker_sync_vp(struct vnode * vp,struct mount * mp,const char * fmt,...)10827725229SKonstantin Belousov audit_worker_sync_vp(struct vnode *vp, struct mount *mp, const char *fmt, ...)
10927725229SKonstantin Belousov {
11027725229SKonstantin Belousov struct mount *mp1;
11127725229SKonstantin Belousov int error;
11227725229SKonstantin Belousov va_list va;
11327725229SKonstantin Belousov
11427725229SKonstantin Belousov va_start(va, fmt);
11527725229SKonstantin Belousov error = vn_start_write(vp, &mp1, 0);
11627725229SKonstantin Belousov if (error == 0) {
11727725229SKonstantin Belousov VOP_LOCK(vp, LK_EXCLUSIVE | LK_RETRY);
11827725229SKonstantin Belousov (void)VOP_FSYNC(vp, MNT_WAIT, curthread);
119*b249ce48SMateusz Guzik VOP_UNLOCK(vp);
12027725229SKonstantin Belousov vn_finished_write(mp1);
12127725229SKonstantin Belousov }
12227725229SKonstantin Belousov vfs_unbusy(mp);
12327725229SKonstantin Belousov vpanic(fmt, va);
12427725229SKonstantin Belousov va_end(va);
12527725229SKonstantin Belousov }
12627725229SKonstantin Belousov
12708e57af4SRobert Watson /*
12822b7bca6SRobert Watson * Write an audit record to a file, performed as the last stage after both
12922b7bca6SRobert Watson * preselection and BSM conversion. Both space management and write failures
13022b7bca6SRobert Watson * are handled in this function.
13122b7bca6SRobert Watson *
13222b7bca6SRobert Watson * No attempt is made to deal with possible failure to deliver a trigger to
13322b7bca6SRobert Watson * the audit daemon, since the message is asynchronous anyway.
13408e57af4SRobert Watson */
13522b7bca6SRobert Watson static void
audit_record_write(struct vnode * vp,struct ucred * cred,void * data,size_t len)136ae87be44SRobert Watson audit_record_write(struct vnode *vp, struct ucred *cred, void *data,
137ae87be44SRobert Watson size_t len)
13808e57af4SRobert Watson {
13922b7bca6SRobert Watson static struct timeval last_lowspace_trigger;
14022b7bca6SRobert Watson static struct timeval last_fail;
14122b7bca6SRobert Watson static int cur_lowspace_trigger;
142a7cbec44SRobert Watson struct statfs *mnt_stat;
14327725229SKonstantin Belousov struct mount *mp;
1445050aa86SKonstantin Belousov int error;
14522b7bca6SRobert Watson static int cur_fail;
14622b7bca6SRobert Watson long temp;
14708e57af4SRobert Watson
148b713bf6eSRobert Watson AUDIT_WORKER_LOCK_ASSERT();
149ae87be44SRobert Watson
15032962122SRobert Watson if (vp == NULL)
15122b7bca6SRobert Watson return;
15232962122SRobert Watson
15327725229SKonstantin Belousov mp = vp->v_mount;
15427725229SKonstantin Belousov if (mp == NULL) {
15527725229SKonstantin Belousov error = EINVAL;
15627725229SKonstantin Belousov goto fail;
15727725229SKonstantin Belousov }
15827725229SKonstantin Belousov error = vfs_busy(mp, 0);
15927725229SKonstantin Belousov if (error != 0) {
16027725229SKonstantin Belousov mp = NULL;
16127725229SKonstantin Belousov goto fail;
16227725229SKonstantin Belousov }
16327725229SKonstantin Belousov mnt_stat = &mp->mnt_stat;
16408e57af4SRobert Watson
16508e57af4SRobert Watson /*
166871499feSRobert Watson * First, gather statistics on the audit log file and file system so
16722b7bca6SRobert Watson * that we know how we're doing on space. Consider failure of these
16822b7bca6SRobert Watson * operations to indicate a future inability to write to the file.
16908e57af4SRobert Watson */
17027725229SKonstantin Belousov error = VFS_STATFS(mp, mnt_stat);
17127725229SKonstantin Belousov if (error != 0)
17222b7bca6SRobert Watson goto fail;
17308e57af4SRobert Watson
17408e57af4SRobert Watson /*
17522b7bca6SRobert Watson * We handle four different space-related limits:
17622b7bca6SRobert Watson *
17722b7bca6SRobert Watson * - A fixed (hard) limit on the minimum free blocks we require on
17822b7bca6SRobert Watson * the file system, and results in record loss, a trigger, and
17922b7bca6SRobert Watson * possible fail stop due to violating invariants.
18022b7bca6SRobert Watson *
18122b7bca6SRobert Watson * - An administrative (soft) limit, which when fallen below, results
18222b7bca6SRobert Watson * in the kernel notifying the audit daemon of low space.
18322b7bca6SRobert Watson *
18422b7bca6SRobert Watson * - An audit trail size limit, which when gone above, results in the
18522b7bca6SRobert Watson * kernel notifying the audit daemon that rotation is desired.
18622b7bca6SRobert Watson *
18722b7bca6SRobert Watson * - The total depth of the kernel audit record exceeding free space,
18822b7bca6SRobert Watson * which can lead to possible fail stop (with drain), in order to
18922b7bca6SRobert Watson * prevent violating invariants. Failure here doesn't halt
19022b7bca6SRobert Watson * immediately, but prevents new records from being generated.
19122b7bca6SRobert Watson *
19222b7bca6SRobert Watson * Possibly, the last of these should be handled differently, always
19322b7bca6SRobert Watson * allowing a full queue to be lost, rather than trying to prevent
19422b7bca6SRobert Watson * loss.
19522b7bca6SRobert Watson *
19622b7bca6SRobert Watson * First, handle the hard limit, which generates a trigger and may
19722b7bca6SRobert Watson * fail stop. This is handled in the same manner as ENOSPC from
19822b7bca6SRobert Watson * VOP_WRITE, and results in record loss.
19908e57af4SRobert Watson */
20008e57af4SRobert Watson if (mnt_stat->f_bfree < AUDIT_HARD_LIMIT_FREE_BLOCKS) {
20122b7bca6SRobert Watson error = ENOSPC;
20222b7bca6SRobert Watson goto fail_enospc;
20308e57af4SRobert Watson }
20408e57af4SRobert Watson
205871499feSRobert Watson /*
20622b7bca6SRobert Watson * Second, handle falling below the soft limit, if defined; we send
20722b7bca6SRobert Watson * the daemon a trigger and continue processing the record. Triggers
20822b7bca6SRobert Watson * are limited to 1/sec.
20908e57af4SRobert Watson */
21022b7bca6SRobert Watson if (audit_qctrl.aq_minfree != 0) {
21122b7bca6SRobert Watson temp = mnt_stat->f_blocks / (100 / audit_qctrl.aq_minfree);
21222b7bca6SRobert Watson if (mnt_stat->f_bfree < temp) {
21322b7bca6SRobert Watson if (ppsratecheck(&last_lowspace_trigger,
21422b7bca6SRobert Watson &cur_lowspace_trigger, 1)) {
215fb4ed8c9SRobert Watson (void)audit_send_trigger(
216fb4ed8c9SRobert Watson AUDIT_TRIGGER_LOW_SPACE);
2173bff0167SSimon L. B. Nielsen printf("Warning: disk space low (< %d%% free) "
2183bff0167SSimon L. B. Nielsen "on audit log file-system\n",
2193bff0167SSimon L. B. Nielsen audit_qctrl.aq_minfree);
22022b7bca6SRobert Watson }
22122b7bca6SRobert Watson }
22222b7bca6SRobert Watson }
22322b7bca6SRobert Watson
22422b7bca6SRobert Watson /*
22522b7bca6SRobert Watson * If the current file is getting full, generate a rotation trigger
22622b7bca6SRobert Watson * to the daemon. This is only approximate, which is fine as more
22722b7bca6SRobert Watson * records may be generated before the daemon rotates the file.
22822b7bca6SRobert Watson */
2291d8cd15cSPawel Jakub Dawidek if (audit_fstat.af_filesz != 0 &&
2301d8cd15cSPawel Jakub Dawidek audit_size >= audit_fstat.af_filesz * (audit_file_rotate_wait + 1)) {
231b713bf6eSRobert Watson AUDIT_WORKER_LOCK_ASSERT();
232ae87be44SRobert Watson
2331d8cd15cSPawel Jakub Dawidek audit_file_rotate_wait++;
234fb4ed8c9SRobert Watson (void)audit_send_trigger(AUDIT_TRIGGER_ROTATE_KERNEL);
23508e57af4SRobert Watson }
23608e57af4SRobert Watson
23708e57af4SRobert Watson /*
23808e57af4SRobert Watson * If the estimated amount of audit data in the audit event queue
239871499feSRobert Watson * (plus records allocated but not yet queued) has reached the amount
240871499feSRobert Watson * of free space on the disk, then we need to go into an audit fail
241871499feSRobert Watson * stop state, in which we do not permit the allocation/committing of
24222b7bca6SRobert Watson * any new audit records. We continue to process records but don't
243871499feSRobert Watson * allow any activities that might generate new records. In the
244871499feSRobert Watson * future, we might want to detect when space is available again and
245871499feSRobert Watson * allow operation to continue, but this behavior is sufficient to
246871499feSRobert Watson * meet fail stop requirements in CAPP.
24708e57af4SRobert Watson */
24822b7bca6SRobert Watson if (audit_fail_stop) {
24922b7bca6SRobert Watson if ((unsigned long)((audit_q_len + audit_pre_q_len + 1) *
25022b7bca6SRobert Watson MAX_AUDIT_RECORD_SIZE) / mnt_stat->f_bsize >=
25122b7bca6SRobert Watson (unsigned long)(mnt_stat->f_bfree)) {
25222b7bca6SRobert Watson if (ppsratecheck(&last_fail, &cur_fail, 1))
25322b7bca6SRobert Watson printf("audit_record_write: free space "
25422b7bca6SRobert Watson "below size of audit queue, failing "
25522b7bca6SRobert Watson "stop\n");
25608e57af4SRobert Watson audit_in_failure = 1;
25722b7bca6SRobert Watson } else if (audit_in_failure) {
25822b7bca6SRobert Watson /*
2591afabae4SRobert Watson * Note: if we want to handle recovery, this is the
26022b7bca6SRobert Watson * spot to do it: unset audit_in_failure, and issue a
26122b7bca6SRobert Watson * wakeup on the cv.
26222b7bca6SRobert Watson */
26322b7bca6SRobert Watson }
26408e57af4SRobert Watson }
26508e57af4SRobert Watson
26622b7bca6SRobert Watson error = vn_rdwr(UIO_WRITE, vp, data, len, (off_t)0, UIO_SYSSPACE,
267ae87be44SRobert Watson IO_APPEND|IO_UNIT, cred, NULL, NULL, curthread);
26822b7bca6SRobert Watson if (error == ENOSPC)
26922b7bca6SRobert Watson goto fail_enospc;
27022b7bca6SRobert Watson else if (error)
27122b7bca6SRobert Watson goto fail;
27262931404SPawel Jakub Dawidek AUDIT_WORKER_LOCK_ASSERT();
27362931404SPawel Jakub Dawidek audit_size += len;
27408e57af4SRobert Watson
27508e57af4SRobert Watson /*
27622b7bca6SRobert Watson * Catch completion of a queue drain here; if we're draining and the
27722b7bca6SRobert Watson * queue is now empty, fail stop. That audit_fail_stop is implicitly
27822b7bca6SRobert Watson * true, since audit_in_failure can only be set of audit_fail_stop is
27922b7bca6SRobert Watson * set.
28022b7bca6SRobert Watson *
2811afabae4SRobert Watson * Note: if we handle recovery from audit_in_failure, then we need to
2821afabae4SRobert Watson * make panic here conditional.
28308e57af4SRobert Watson */
28422b7bca6SRobert Watson if (audit_in_failure) {
28522b7bca6SRobert Watson if (audit_q_len == 0 && audit_pre_q_len == 0) {
28627725229SKonstantin Belousov audit_worker_sync_vp(vp, mp,
28727725229SKonstantin Belousov "Audit store overflow; record queue drained.");
28808e57af4SRobert Watson }
28922b7bca6SRobert Watson }
29008e57af4SRobert Watson
29127725229SKonstantin Belousov vfs_unbusy(mp);
29222b7bca6SRobert Watson return;
29308e57af4SRobert Watson
29422b7bca6SRobert Watson fail_enospc:
29522b7bca6SRobert Watson /*
29622b7bca6SRobert Watson * ENOSPC is considered a special case with respect to failures, as
29722b7bca6SRobert Watson * this can reflect either our preemptive detection of insufficient
29822b7bca6SRobert Watson * space, or ENOSPC returned by the vnode write call.
29922b7bca6SRobert Watson */
30022b7bca6SRobert Watson if (audit_fail_stop) {
30127725229SKonstantin Belousov audit_worker_sync_vp(vp, mp,
30227725229SKonstantin Belousov "Audit log space exhausted and fail-stop set.");
30322b7bca6SRobert Watson }
304fb4ed8c9SRobert Watson (void)audit_send_trigger(AUDIT_TRIGGER_NO_SPACE);
3052ddefb6dSRobert Watson audit_trail_suspended = 1;
3062ddefb6dSRobert Watson audit_syscalls_enabled_update();
30722b7bca6SRobert Watson
30822b7bca6SRobert Watson /* FALLTHROUGH */
30922b7bca6SRobert Watson fail:
31022b7bca6SRobert Watson /*
31122b7bca6SRobert Watson * We have failed to write to the file, so the current record is
31222b7bca6SRobert Watson * lost, which may require an immediate system halt.
31322b7bca6SRobert Watson */
31422b7bca6SRobert Watson if (audit_panic_on_write_fail) {
31527725229SKonstantin Belousov audit_worker_sync_vp(vp, mp,
31627725229SKonstantin Belousov "audit_worker: write error %d\n", error);
31722b7bca6SRobert Watson } else if (ppsratecheck(&last_fail, &cur_fail, 1))
31822b7bca6SRobert Watson printf("audit_worker: write error %d\n", error);
31927725229SKonstantin Belousov if (mp != NULL)
32027725229SKonstantin Belousov vfs_unbusy(mp);
32108e57af4SRobert Watson }
32208e57af4SRobert Watson
32308e57af4SRobert Watson /*
32432962122SRobert Watson * Given a kernel audit record, process as required. Kernel audit records
32532962122SRobert Watson * are converted to one, or possibly two, BSM records, depending on whether
32632962122SRobert Watson * there is a user audit record present also. Kernel records need be
32732962122SRobert Watson * converted to BSM before they can be written out. Both types will be
32832962122SRobert Watson * written to disk, and audit pipes.
32962bb2e91SRobert Watson */
33062bb2e91SRobert Watson static void
audit_worker_process_record(struct kaudit_record * ar)331ae87be44SRobert Watson audit_worker_process_record(struct kaudit_record *ar)
33262bb2e91SRobert Watson {
33332962122SRobert Watson struct au_record *bsm;
334e257c20eSRobert Watson au_class_t class;
335e257c20eSRobert Watson au_event_t event;
336e257c20eSRobert Watson au_id_t auid;
33722b7bca6SRobert Watson int error, sorf;
338b713bf6eSRobert Watson int locked;
339ae87be44SRobert Watson
340ae87be44SRobert Watson /*
341b713bf6eSRobert Watson * We hold the audit worker lock over both writes, if there are two,
342b713bf6eSRobert Watson * so that the two records won't be split across a rotation and end
343b713bf6eSRobert Watson * up in two different trail files.
344ae87be44SRobert Watson */
345ae87be44SRobert Watson if (((ar->k_ar_commit & AR_COMMIT_USER) &&
346ae87be44SRobert Watson (ar->k_ar_commit & AR_PRESELECT_USER_TRAIL)) ||
347ae87be44SRobert Watson (ar->k_ar_commit & AR_PRESELECT_TRAIL)) {
348b713bf6eSRobert Watson AUDIT_WORKER_LOCK();
349b713bf6eSRobert Watson locked = 1;
350ae87be44SRobert Watson } else
351b713bf6eSRobert Watson locked = 0;
35262bb2e91SRobert Watson
35322b7bca6SRobert Watson /*
35422b7bca6SRobert Watson * First, handle the user record, if any: commit to the system trail
35522b7bca6SRobert Watson * and audit pipes as selected.
35622b7bca6SRobert Watson */
357e257c20eSRobert Watson if ((ar->k_ar_commit & AR_COMMIT_USER) &&
358ae87be44SRobert Watson (ar->k_ar_commit & AR_PRESELECT_USER_TRAIL)) {
359b713bf6eSRobert Watson AUDIT_WORKER_LOCK_ASSERT();
360ae87be44SRobert Watson audit_record_write(audit_vp, audit_cred, ar->k_udata,
361ae87be44SRobert Watson ar->k_ulen);
362ae87be44SRobert Watson }
363f07b8369SChristian S.J. Peron
364e257c20eSRobert Watson if ((ar->k_ar_commit & AR_COMMIT_USER) &&
365f07b8369SChristian S.J. Peron (ar->k_ar_commit & AR_PRESELECT_USER_PIPE))
366e257c20eSRobert Watson audit_pipe_submit_user(ar->k_udata, ar->k_ulen);
36732962122SRobert Watson
368f07b8369SChristian S.J. Peron if (!(ar->k_ar_commit & AR_COMMIT_KERNEL) ||
369f07b8369SChristian S.J. Peron ((ar->k_ar_commit & AR_PRESELECT_PIPE) == 0 &&
3701811d6bfSRobert Watson (ar->k_ar_commit & AR_PRESELECT_TRAIL) == 0 &&
3711811d6bfSRobert Watson (ar->k_ar_commit & AR_PRESELECT_DTRACE) == 0))
372ae87be44SRobert Watson goto out;
373e257c20eSRobert Watson
374e257c20eSRobert Watson auid = ar->k_ar.ar_subj_auid;
375e257c20eSRobert Watson event = ar->k_ar.ar_event;
376e257c20eSRobert Watson class = au_event_class(event);
377e257c20eSRobert Watson if (ar->k_ar.ar_errno == 0)
378e257c20eSRobert Watson sorf = AU_PRS_SUCCESS;
379e257c20eSRobert Watson else
380e257c20eSRobert Watson sorf = AU_PRS_FAILURE;
381e257c20eSRobert Watson
38222b7bca6SRobert Watson error = kaudit_to_bsm(ar, &bsm);
38322b7bca6SRobert Watson switch (error) {
38432962122SRobert Watson case BSM_NOAUDIT:
385ae87be44SRobert Watson goto out;
38632962122SRobert Watson
38732962122SRobert Watson case BSM_FAILURE:
38832962122SRobert Watson printf("audit_worker_process_record: BSM_FAILURE\n");
389ae87be44SRobert Watson goto out;
39032962122SRobert Watson
39132962122SRobert Watson case BSM_SUCCESS:
392e257c20eSRobert Watson break;
393e257c20eSRobert Watson
394e257c20eSRobert Watson default:
39522b7bca6SRobert Watson panic("kaudit_to_bsm returned %d", error);
396e257c20eSRobert Watson }
397e257c20eSRobert Watson
398ae87be44SRobert Watson if (ar->k_ar_commit & AR_PRESELECT_TRAIL) {
399b713bf6eSRobert Watson AUDIT_WORKER_LOCK_ASSERT();
400ae87be44SRobert Watson audit_record_write(audit_vp, audit_cred, bsm->data, bsm->len);
401ae87be44SRobert Watson }
402f07b8369SChristian S.J. Peron
403e257c20eSRobert Watson if (ar->k_ar_commit & AR_PRESELECT_PIPE)
404e257c20eSRobert Watson audit_pipe_submit(auid, event, class, sorf,
405e257c20eSRobert Watson ar->k_ar_commit & AR_PRESELECT_TRAIL, bsm->data,
406e257c20eSRobert Watson bsm->len);
40722b7bca6SRobert Watson
4081811d6bfSRobert Watson #ifdef KDTRACE_HOOKS
4091811d6bfSRobert Watson /*
4101811d6bfSRobert Watson * Version of the dtaudit commit hook that accepts BSM.
4111811d6bfSRobert Watson */
4121811d6bfSRobert Watson if (ar->k_ar_commit & AR_PRESELECT_DTRACE) {
4131811d6bfSRobert Watson if (dtaudit_hook_bsm != NULL)
4141811d6bfSRobert Watson dtaudit_hook_bsm(ar, auid, event, class, sorf,
4151811d6bfSRobert Watson bsm->data, bsm->len);
4161811d6bfSRobert Watson }
4171811d6bfSRobert Watson #endif
4181811d6bfSRobert Watson
41932962122SRobert Watson kau_free(bsm);
420ae87be44SRobert Watson out:
421b713bf6eSRobert Watson if (locked)
422b713bf6eSRobert Watson AUDIT_WORKER_UNLOCK();
42362bb2e91SRobert Watson }
42462bb2e91SRobert Watson
42562bb2e91SRobert Watson /*
42608e57af4SRobert Watson * The audit_worker thread is responsible for watching the event queue,
42708e57af4SRobert Watson * dequeueing records, converting them to BSM format, and committing them to
42808e57af4SRobert Watson * disk. In order to minimize lock thrashing, records are dequeued in sets
429ae87be44SRobert Watson * to a thread-local work queue.
430ae87be44SRobert Watson *
431ae87be44SRobert Watson * Note: this means that the effect bound on the size of the pending record
432ae87be44SRobert Watson * queue is 2x the length of the global queue.
43308e57af4SRobert Watson */
43408e57af4SRobert Watson static void
audit_worker(void * arg)43508e57af4SRobert Watson audit_worker(void *arg)
43608e57af4SRobert Watson {
437b3ae6323SRobert Watson struct kaudit_queue ar_worklist;
43808e57af4SRobert Watson struct kaudit_record *ar;
43962bb2e91SRobert Watson int lowater_signal;
44008e57af4SRobert Watson
44108e57af4SRobert Watson TAILQ_INIT(&ar_worklist);
44208e57af4SRobert Watson mtx_lock(&audit_mtx);
44308e57af4SRobert Watson while (1) {
44408e57af4SRobert Watson mtx_assert(&audit_mtx, MA_OWNED);
44508e57af4SRobert Watson
44608e57af4SRobert Watson /*
447ae87be44SRobert Watson * Wait for a record.
44808e57af4SRobert Watson */
449ae87be44SRobert Watson while (TAILQ_EMPTY(&audit_q))
45040c96d72SRobert Watson cv_wait(&audit_worker_cv, &audit_mtx);
45108e57af4SRobert Watson
45208e57af4SRobert Watson /*
4532ca38be3SRobert Watson * If there are records in the global audit record queue,
4542ca38be3SRobert Watson * transfer them to a thread-local queue and process them
4552ca38be3SRobert Watson * one by one. If we cross the low watermark threshold,
4562ca38be3SRobert Watson * signal any waiting processes that they may wake up and
4572ca38be3SRobert Watson * continue generating records.
45808e57af4SRobert Watson */
45908e57af4SRobert Watson lowater_signal = 0;
46008e57af4SRobert Watson while ((ar = TAILQ_FIRST(&audit_q))) {
46108e57af4SRobert Watson TAILQ_REMOVE(&audit_q, ar, k_q);
46208e57af4SRobert Watson audit_q_len--;
46308e57af4SRobert Watson if (audit_q_len == audit_qctrl.aq_lowater)
46408e57af4SRobert Watson lowater_signal++;
46508e57af4SRobert Watson TAILQ_INSERT_TAIL(&ar_worklist, ar, k_q);
46608e57af4SRobert Watson }
46708e57af4SRobert Watson if (lowater_signal)
46840c96d72SRobert Watson cv_broadcast(&audit_watermark_cv);
46908e57af4SRobert Watson
47008e57af4SRobert Watson mtx_unlock(&audit_mtx);
47108e57af4SRobert Watson while ((ar = TAILQ_FIRST(&ar_worklist))) {
47208e57af4SRobert Watson TAILQ_REMOVE(&ar_worklist, ar, k_q);
473ae87be44SRobert Watson audit_worker_process_record(ar);
47408e57af4SRobert Watson audit_free(ar);
47508e57af4SRobert Watson }
47608e57af4SRobert Watson mtx_lock(&audit_mtx);
47708e57af4SRobert Watson }
47808e57af4SRobert Watson }
47908e57af4SRobert Watson
48008e57af4SRobert Watson /*
48108e57af4SRobert Watson * audit_rotate_vnode() is called by a user or kernel thread to configure or
48208e57af4SRobert Watson * de-configure auditing on a vnode. The arguments are the replacement
483ae87be44SRobert Watson * credential (referenced) and vnode (referenced and opened) to substitute
484ae87be44SRobert Watson * for the current credential and vnode, if any. If either is set to NULL,
485ae87be44SRobert Watson * both should be NULL, and this is used to indicate that audit is being
486ae87be44SRobert Watson * disabled. Any previous cred/vnode will be closed and freed. We re-enable
487ae87be44SRobert Watson * generating rotation requests to auditd.
48808e57af4SRobert Watson */
48908e57af4SRobert Watson void
audit_rotate_vnode(struct ucred * cred,struct vnode * vp)49008e57af4SRobert Watson audit_rotate_vnode(struct ucred *cred, struct vnode *vp)
49108e57af4SRobert Watson {
492ae87be44SRobert Watson struct ucred *old_audit_cred;
493ae87be44SRobert Watson struct vnode *old_audit_vp;
49462931404SPawel Jakub Dawidek struct vattr vattr;
495ae87be44SRobert Watson
496ae87be44SRobert Watson KASSERT((cred != NULL && vp != NULL) || (cred == NULL && vp == NULL),
497ae87be44SRobert Watson ("audit_rotate_vnode: cred %p vp %p", cred, vp));
49808e57af4SRobert Watson
49962931404SPawel Jakub Dawidek if (vp != NULL) {
50062931404SPawel Jakub Dawidek vn_lock(vp, LK_SHARED | LK_RETRY);
50162931404SPawel Jakub Dawidek if (VOP_GETATTR(vp, &vattr, cred) != 0)
50262931404SPawel Jakub Dawidek vattr.va_size = 0;
503*b249ce48SMateusz Guzik VOP_UNLOCK(vp);
50462931404SPawel Jakub Dawidek } else {
50562931404SPawel Jakub Dawidek vattr.va_size = 0;
50662931404SPawel Jakub Dawidek }
50762931404SPawel Jakub Dawidek
50808e57af4SRobert Watson /*
509ae87be44SRobert Watson * Rotate the vnode/cred, and clear the rotate flag so that we will
510ae87be44SRobert Watson * send a rotate trigger if the new file fills.
51108e57af4SRobert Watson */
512b713bf6eSRobert Watson AUDIT_WORKER_LOCK();
513ae87be44SRobert Watson old_audit_cred = audit_cred;
514ae87be44SRobert Watson old_audit_vp = audit_vp;
515ae87be44SRobert Watson audit_cred = cred;
516ae87be44SRobert Watson audit_vp = vp;
51762931404SPawel Jakub Dawidek audit_size = vattr.va_size;
518ae87be44SRobert Watson audit_file_rotate_wait = 0;
5192ddefb6dSRobert Watson audit_trail_enabled = (audit_vp != NULL);
5202ddefb6dSRobert Watson audit_syscalls_enabled_update();
521b713bf6eSRobert Watson AUDIT_WORKER_UNLOCK();
52208e57af4SRobert Watson
52308e57af4SRobert Watson /*
524ae87be44SRobert Watson * If there was an old vnode/credential, close and free.
52508e57af4SRobert Watson */
526ae87be44SRobert Watson if (old_audit_vp != NULL) {
527ae87be44SRobert Watson vn_close(old_audit_vp, AUDIT_CLOSE_FLAGS, old_audit_cred,
528ae87be44SRobert Watson curthread);
529ae87be44SRobert Watson crfree(old_audit_cred);
530ae87be44SRobert Watson }
53108e57af4SRobert Watson }
53208e57af4SRobert Watson
53308e57af4SRobert Watson void
audit_worker_init(void)53408e57af4SRobert Watson audit_worker_init(void)
53508e57af4SRobert Watson {
53608e57af4SRobert Watson int error;
53708e57af4SRobert Watson
538b713bf6eSRobert Watson AUDIT_WORKER_LOCK_INIT();
5393745c395SJulian Elischer error = kproc_create(audit_worker, NULL, &audit_thread, RFHIGHPID,
5405a9f2d6cSRobert Watson 0, "audit");
54108e57af4SRobert Watson if (error)
5423745c395SJulian Elischer panic("audit_worker_init: kproc_create returned %d", error);
54308e57af4SRobert Watson }
544