2006-02-01 20:01:18 +00:00
|
|
|
/*
|
2009-02-08 14:39:35 +00:00
|
|
|
* Copyright (c) 1999-2009 Apple Inc.
|
2006-02-01 20:01:18 +00:00
|
|
|
* Copyright (c) 2005 Robert N. M. Watson
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
2008-07-22 15:29:48 +00:00
|
|
|
* 3. Neither the name of Apple Inc. ("Apple") nor the names of
|
2006-02-01 20:01:18 +00:00
|
|
|
* its contributors may be used to endorse or promote products derived
|
|
|
|
* from this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY APPLE AND ITS CONTRIBUTORS "AS IS" AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL APPLE OR ITS CONTRIBUTORS BE LIABLE FOR
|
|
|
|
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|
|
|
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
|
|
|
|
* IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
2008-04-13 22:06:56 +00:00
|
|
|
#include <sys/cdefs.h>
|
|
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
|
2006-02-01 20:01:18 +00:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/fcntl.h>
|
|
|
|
#include <sys/filedesc.h>
|
|
|
|
#include <sys/libkern.h>
|
|
|
|
#include <sys/malloc.h>
|
|
|
|
#include <sys/mount.h>
|
|
|
|
#include <sys/proc.h>
|
2008-10-30 17:47:57 +00:00
|
|
|
#include <sys/rwlock.h>
|
2006-02-01 20:01:18 +00:00
|
|
|
#include <sys/sem.h>
|
2008-07-31 16:57:41 +00:00
|
|
|
#include <sys/sbuf.h>
|
2006-02-01 20:01:18 +00:00
|
|
|
#include <sys/syscall.h>
|
|
|
|
#include <sys/sysctl.h>
|
|
|
|
#include <sys/sysent.h>
|
|
|
|
#include <sys/vnode.h>
|
|
|
|
|
|
|
|
#include <bsm/audit.h>
|
|
|
|
#include <bsm/audit_kevents.h>
|
|
|
|
#include <security/audit/audit.h>
|
|
|
|
#include <security/audit/audit_private.h>
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Hash table functions for the audit event number to event class mask
|
|
|
|
* mapping.
|
|
|
|
*/
|
2008-07-23 07:42:31 +00:00
|
|
|
#define EVCLASSMAP_HASH_TABLE_SIZE 251
|
2006-02-01 20:01:18 +00:00
|
|
|
struct evclass_elem {
|
|
|
|
au_event_t event;
|
|
|
|
au_class_t class;
|
|
|
|
LIST_ENTRY(evclass_elem) entry;
|
|
|
|
};
|
|
|
|
struct evclass_list {
|
|
|
|
LIST_HEAD(, evclass_elem) head;
|
|
|
|
};
|
|
|
|
|
|
|
|
static MALLOC_DEFINE(M_AUDITEVCLASS, "audit_evclass", "Audit event class");
|
2008-10-30 17:47:57 +00:00
|
|
|
static struct rwlock evclass_lock;
|
2006-03-19 17:34:00 +00:00
|
|
|
static struct evclass_list evclass_hash[EVCLASSMAP_HASH_TABLE_SIZE];
|
2006-02-01 20:01:18 +00:00
|
|
|
|
2008-10-30 17:47:57 +00:00
|
|
|
#define EVCLASS_LOCK_INIT() rw_init(&evclass_lock, "evclass_lock")
|
|
|
|
#define EVCLASS_RLOCK() rw_rlock(&evclass_lock)
|
|
|
|
#define EVCLASS_RUNLOCK() rw_runlock(&evclass_lock)
|
|
|
|
#define EVCLASS_WLOCK() rw_wlock(&evclass_lock)
|
|
|
|
#define EVCLASS_WUNLOCK() rw_wunlock(&evclass_lock)
|
|
|
|
|
2009-07-28 21:39:58 +00:00
|
|
|
struct aue_open_event {
|
|
|
|
int aoe_flags;
|
|
|
|
au_event_t aoe_event;
|
|
|
|
};
|
|
|
|
|
|
|
|
static const struct aue_open_event aue_open[] = {
|
|
|
|
{ O_RDONLY, AUE_OPEN_R },
|
|
|
|
{ (O_RDONLY | O_CREAT), AUE_OPEN_RC },
|
|
|
|
{ (O_RDONLY | O_CREAT | O_TRUNC), AUE_OPEN_RTC },
|
|
|
|
{ (O_RDONLY | O_TRUNC), AUE_OPEN_RT },
|
|
|
|
{ O_RDWR, AUE_OPEN_RW },
|
|
|
|
{ (O_RDWR | O_CREAT), AUE_OPEN_RWC },
|
|
|
|
{ (O_RDWR | O_CREAT | O_TRUNC), AUE_OPEN_RWTC },
|
|
|
|
{ (O_RDWR | O_TRUNC), AUE_OPEN_RWT },
|
|
|
|
{ O_WRONLY, AUE_OPEN_W },
|
|
|
|
{ (O_WRONLY | O_CREAT), AUE_OPEN_WC },
|
|
|
|
{ (O_WRONLY | O_CREAT | O_TRUNC), AUE_OPEN_WTC },
|
|
|
|
{ (O_WRONLY | O_TRUNC), AUE_OPEN_WT },
|
|
|
|
};
|
|
|
|
static const int aue_open_count = sizeof(aue_open) / sizeof(aue_open[0]);
|
|
|
|
|
|
|
|
static const struct aue_open_event aue_openat[] = {
|
|
|
|
{ O_RDONLY, AUE_OPENAT_R },
|
|
|
|
{ (O_RDONLY | O_CREAT), AUE_OPENAT_RC },
|
|
|
|
{ (O_RDONLY | O_CREAT | O_TRUNC), AUE_OPENAT_RTC },
|
|
|
|
{ (O_RDONLY | O_TRUNC), AUE_OPENAT_RT },
|
|
|
|
{ O_RDWR, AUE_OPENAT_RW },
|
|
|
|
{ (O_RDWR | O_CREAT), AUE_OPENAT_RWC },
|
|
|
|
{ (O_RDWR | O_CREAT | O_TRUNC), AUE_OPENAT_RWTC },
|
|
|
|
{ (O_RDWR | O_TRUNC), AUE_OPENAT_RWT },
|
|
|
|
{ O_WRONLY, AUE_OPENAT_W },
|
|
|
|
{ (O_WRONLY | O_CREAT), AUE_OPENAT_WC },
|
|
|
|
{ (O_WRONLY | O_CREAT | O_TRUNC), AUE_OPENAT_WTC },
|
|
|
|
{ (O_WRONLY | O_TRUNC), AUE_OPENAT_WT },
|
|
|
|
};
|
|
|
|
static const int aue_openat_count = sizeof(aue_openat) / sizeof(aue_openat[0]);
|
|
|
|
|
2006-02-01 20:01:18 +00:00
|
|
|
/*
|
|
|
|
* Look up the class for an audit event in the class mapping table.
|
|
|
|
*/
|
|
|
|
au_class_t
|
|
|
|
au_event_class(au_event_t event)
|
|
|
|
{
|
|
|
|
struct evclass_list *evcl;
|
|
|
|
struct evclass_elem *evc;
|
|
|
|
au_class_t class;
|
|
|
|
|
2008-10-30 17:47:57 +00:00
|
|
|
EVCLASS_RLOCK();
|
2006-02-01 20:01:18 +00:00
|
|
|
evcl = &evclass_hash[event % EVCLASSMAP_HASH_TABLE_SIZE];
|
2007-10-29 18:07:48 +00:00
|
|
|
class = 0;
|
2006-02-01 20:01:18 +00:00
|
|
|
LIST_FOREACH(evc, &evcl->head, entry) {
|
|
|
|
if (evc->event == event) {
|
|
|
|
class = evc->class;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
out:
|
2008-10-30 17:47:57 +00:00
|
|
|
EVCLASS_RUNLOCK();
|
2006-02-01 20:01:18 +00:00
|
|
|
return (class);
|
|
|
|
}
|
|
|
|
|
2006-03-19 17:34:00 +00:00
|
|
|
/*
|
2006-02-01 20:01:18 +00:00
|
|
|
* Insert a event to class mapping. If the event already exists in the
|
|
|
|
* mapping, then replace the mapping with the new one.
|
2006-03-19 17:34:00 +00:00
|
|
|
*
|
2006-02-01 20:01:18 +00:00
|
|
|
* XXX There is currently no constraints placed on the number of mappings.
|
2006-03-19 17:34:00 +00:00
|
|
|
* May want to either limit to a number, or in terms of memory usage.
|
2006-02-01 20:01:18 +00:00
|
|
|
*/
|
|
|
|
void
|
2006-03-19 17:34:00 +00:00
|
|
|
au_evclassmap_insert(au_event_t event, au_class_t class)
|
2006-02-01 20:01:18 +00:00
|
|
|
{
|
|
|
|
struct evclass_list *evcl;
|
|
|
|
struct evclass_elem *evc, *evc_new;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Pessimistically, always allocate storage before acquiring mutex.
|
|
|
|
* Free if there is already a mapping for this event.
|
|
|
|
*/
|
|
|
|
evc_new = malloc(sizeof(*evc), M_AUDITEVCLASS, M_WAITOK);
|
|
|
|
|
2008-10-30 17:47:57 +00:00
|
|
|
EVCLASS_WLOCK();
|
2006-02-01 20:01:18 +00:00
|
|
|
evcl = &evclass_hash[event % EVCLASSMAP_HASH_TABLE_SIZE];
|
|
|
|
LIST_FOREACH(evc, &evcl->head, entry) {
|
|
|
|
if (evc->event == event) {
|
|
|
|
evc->class = class;
|
2008-10-30 17:47:57 +00:00
|
|
|
EVCLASS_WUNLOCK();
|
2006-02-01 20:01:18 +00:00
|
|
|
free(evc_new, M_AUDITEVCLASS);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
evc = evc_new;
|
|
|
|
evc->event = event;
|
|
|
|
evc->class = class;
|
|
|
|
LIST_INSERT_HEAD(&evcl->head, evc, entry);
|
2008-10-30 17:47:57 +00:00
|
|
|
EVCLASS_WUNLOCK();
|
2006-02-01 20:01:18 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2006-03-19 17:34:00 +00:00
|
|
|
au_evclassmap_init(void)
|
2006-02-01 20:01:18 +00:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
2008-10-30 17:47:57 +00:00
|
|
|
EVCLASS_LOCK_INIT();
|
2006-02-01 20:01:18 +00:00
|
|
|
for (i = 0; i < EVCLASSMAP_HASH_TABLE_SIZE; i++)
|
|
|
|
LIST_INIT(&evclass_hash[i].head);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Set up the initial event to class mapping for system calls.
|
|
|
|
*
|
|
|
|
* XXXRW: Really, this should walk all possible audit events, not all
|
|
|
|
* native ABI system calls, as there may be audit events reachable
|
|
|
|
* only through non-native system calls. It also seems a shame to
|
|
|
|
* frob the mutex this early.
|
2006-03-19 17:34:00 +00:00
|
|
|
*/
|
2006-02-01 20:01:18 +00:00
|
|
|
for (i = 0; i < SYS_MAXSYSCALL; i++) {
|
|
|
|
if (sysent[i].sy_auevent != AUE_NULL)
|
2007-10-29 18:07:48 +00:00
|
|
|
au_evclassmap_insert(sysent[i].sy_auevent, 0);
|
2006-02-01 20:01:18 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check whether an event is aditable by comparing the mask of classes this
|
|
|
|
* event is part of against the given mask.
|
|
|
|
*/
|
|
|
|
int
|
Introduce support for per-audit pipe preselection independent from the
global audit trail configuration. This allows applications consuming
audit trails to specify parameters for which audit records are of
interest, including selecting records not required by the global trail.
Allowing application interest specification without changing the global
configuration allows intrusion detection systems to run without
interfering with global auditing or each other (if multiple are
present). To implement this:
- Kernel audit records now carry a flag to indicate whether they have
been selected by the global trail or by the audit pipe subsystem,
set during record commit, so that this information is available
after BSM conversion when delivering the BSM to the trail and audit
pipes in the audit worker thread asynchronously. Preselection by
either record target will cause the record to be kept.
- Similar changes to preselection when the audit record is created
when the system call is entering: consult both the global trail and
pipes.
- au_preselect() now accepts the class in order to avoid repeatedly
looking up the mask for each preselection test.
- Define a series of ioctls that allow applications to specify whether
they want to track the global trail, or program their own
preselection parameters: they may specify their own flags and naflags
masks, similar to the global masks of the same name, as well as a set
of per-auid masks. They also set a per-pipe mode specifying whether
they track the global trail, or user their own -- the door is left
open for future additional modes. A new ioctl is defined to allow a
user process to flush the current audit pipe queue, which can be used
after reprogramming pre-selection to make sure that only records of
interest are received in future reads.
- Audit pipe data structures are extended to hold the additional fields
necessary to support preselection. By default, audit pipes track the
global trail, so "praudit /dev/auditpipe" will track the global audit
trail even though praudit doesn't program the audit pipe selection
model.
- Comment about the complexities of potentially adding partial read
support to audit pipes.
By using a set of ioctls, applications can select which records are of
interest, and toggle the preselection mode.
Obtained from: TrustedBSD Project
2006-06-05 14:48:17 +00:00
|
|
|
au_preselect(au_event_t event, au_class_t class, au_mask_t *mask_p, int sorf)
|
2006-02-01 20:01:18 +00:00
|
|
|
{
|
|
|
|
au_class_t effmask = 0;
|
|
|
|
|
|
|
|
if (mask_p == NULL)
|
|
|
|
return (-1);
|
|
|
|
|
2006-03-19 17:34:00 +00:00
|
|
|
/*
|
2006-02-01 20:01:18 +00:00
|
|
|
* Perform the actual check of the masks against the event.
|
|
|
|
*/
|
|
|
|
if (sorf & AU_PRS_SUCCESS)
|
Introduce support for per-audit pipe preselection independent from the
global audit trail configuration. This allows applications consuming
audit trails to specify parameters for which audit records are of
interest, including selecting records not required by the global trail.
Allowing application interest specification without changing the global
configuration allows intrusion detection systems to run without
interfering with global auditing or each other (if multiple are
present). To implement this:
- Kernel audit records now carry a flag to indicate whether they have
been selected by the global trail or by the audit pipe subsystem,
set during record commit, so that this information is available
after BSM conversion when delivering the BSM to the trail and audit
pipes in the audit worker thread asynchronously. Preselection by
either record target will cause the record to be kept.
- Similar changes to preselection when the audit record is created
when the system call is entering: consult both the global trail and
pipes.
- au_preselect() now accepts the class in order to avoid repeatedly
looking up the mask for each preselection test.
- Define a series of ioctls that allow applications to specify whether
they want to track the global trail, or program their own
preselection parameters: they may specify their own flags and naflags
masks, similar to the global masks of the same name, as well as a set
of per-auid masks. They also set a per-pipe mode specifying whether
they track the global trail, or user their own -- the door is left
open for future additional modes. A new ioctl is defined to allow a
user process to flush the current audit pipe queue, which can be used
after reprogramming pre-selection to make sure that only records of
interest are received in future reads.
- Audit pipe data structures are extended to hold the additional fields
necessary to support preselection. By default, audit pipes track the
global trail, so "praudit /dev/auditpipe" will track the global audit
trail even though praudit doesn't program the audit pipe selection
model.
- Comment about the complexities of potentially adding partial read
support to audit pipes.
By using a set of ioctls, applications can select which records are of
interest, and toggle the preselection mode.
Obtained from: TrustedBSD Project
2006-06-05 14:48:17 +00:00
|
|
|
effmask |= (mask_p->am_success & class);
|
2006-03-19 17:34:00 +00:00
|
|
|
|
2006-02-01 20:01:18 +00:00
|
|
|
if (sorf & AU_PRS_FAILURE)
|
Introduce support for per-audit pipe preselection independent from the
global audit trail configuration. This allows applications consuming
audit trails to specify parameters for which audit records are of
interest, including selecting records not required by the global trail.
Allowing application interest specification without changing the global
configuration allows intrusion detection systems to run without
interfering with global auditing or each other (if multiple are
present). To implement this:
- Kernel audit records now carry a flag to indicate whether they have
been selected by the global trail or by the audit pipe subsystem,
set during record commit, so that this information is available
after BSM conversion when delivering the BSM to the trail and audit
pipes in the audit worker thread asynchronously. Preselection by
either record target will cause the record to be kept.
- Similar changes to preselection when the audit record is created
when the system call is entering: consult both the global trail and
pipes.
- au_preselect() now accepts the class in order to avoid repeatedly
looking up the mask for each preselection test.
- Define a series of ioctls that allow applications to specify whether
they want to track the global trail, or program their own
preselection parameters: they may specify their own flags and naflags
masks, similar to the global masks of the same name, as well as a set
of per-auid masks. They also set a per-pipe mode specifying whether
they track the global trail, or user their own -- the door is left
open for future additional modes. A new ioctl is defined to allow a
user process to flush the current audit pipe queue, which can be used
after reprogramming pre-selection to make sure that only records of
interest are received in future reads.
- Audit pipe data structures are extended to hold the additional fields
necessary to support preselection. By default, audit pipes track the
global trail, so "praudit /dev/auditpipe" will track the global audit
trail even though praudit doesn't program the audit pipe selection
model.
- Comment about the complexities of potentially adding partial read
support to audit pipes.
By using a set of ioctls, applications can select which records are of
interest, and toggle the preselection mode.
Obtained from: TrustedBSD Project
2006-06-05 14:48:17 +00:00
|
|
|
effmask |= (mask_p->am_failure & class);
|
2006-03-19 17:34:00 +00:00
|
|
|
|
2006-02-01 20:01:18 +00:00
|
|
|
if (effmask)
|
|
|
|
return (1);
|
2006-03-19 17:34:00 +00:00
|
|
|
else
|
2006-02-01 20:01:18 +00:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2006-03-19 17:34:00 +00:00
|
|
|
* Convert sysctl names and present arguments to events.
|
2006-02-01 20:01:18 +00:00
|
|
|
*/
|
|
|
|
au_event_t
|
2008-03-01 11:40:49 +00:00
|
|
|
audit_ctlname_to_sysctlevent(int name[], uint64_t valid_arg)
|
2006-02-01 20:01:18 +00:00
|
|
|
{
|
|
|
|
|
|
|
|
/* can't parse it - so return the worst case */
|
2006-03-19 17:34:00 +00:00
|
|
|
if ((valid_arg & (ARG_CTLNAME | ARG_LEN)) != (ARG_CTLNAME | ARG_LEN))
|
2006-02-01 20:01:18 +00:00
|
|
|
return (AUE_SYSCTL);
|
|
|
|
|
|
|
|
switch (name[0]) {
|
|
|
|
/* non-admin "lookups" treat them special */
|
|
|
|
case KERN_OSTYPE:
|
|
|
|
case KERN_OSRELEASE:
|
|
|
|
case KERN_OSREV:
|
|
|
|
case KERN_VERSION:
|
|
|
|
case KERN_ARGMAX:
|
|
|
|
case KERN_CLOCKRATE:
|
|
|
|
case KERN_BOOTTIME:
|
|
|
|
case KERN_POSIX1:
|
|
|
|
case KERN_NGROUPS:
|
|
|
|
case KERN_JOB_CONTROL:
|
|
|
|
case KERN_SAVED_IDS:
|
|
|
|
case KERN_OSRELDATE:
|
|
|
|
case KERN_DUMMY:
|
|
|
|
return (AUE_SYSCTL_NONADMIN);
|
|
|
|
|
|
|
|
/* only treat the changeable controls as admin */
|
|
|
|
case KERN_MAXVNODES:
|
|
|
|
case KERN_MAXPROC:
|
|
|
|
case KERN_MAXFILES:
|
|
|
|
case KERN_MAXPROCPERUID:
|
|
|
|
case KERN_MAXFILESPERPROC:
|
|
|
|
case KERN_HOSTID:
|
|
|
|
case KERN_SECURELVL:
|
|
|
|
case KERN_HOSTNAME:
|
|
|
|
case KERN_VNODE:
|
|
|
|
case KERN_PROC:
|
|
|
|
case KERN_FILE:
|
|
|
|
case KERN_PROF:
|
|
|
|
case KERN_NISDOMAINNAME:
|
|
|
|
case KERN_UPDATEINTERVAL:
|
|
|
|
case KERN_NTP_PLL:
|
|
|
|
case KERN_BOOTFILE:
|
|
|
|
case KERN_DUMPDEV:
|
|
|
|
case KERN_IPC:
|
|
|
|
case KERN_PS_STRINGS:
|
|
|
|
case KERN_USRSTACK:
|
|
|
|
case KERN_LOGSIGEXIT:
|
|
|
|
case KERN_IOV_MAX:
|
|
|
|
case KERN_MAXID:
|
|
|
|
return ((valid_arg & ARG_VALUE) ?
|
2008-07-31 09:54:35 +00:00
|
|
|
AUE_SYSCTL : AUE_SYSCTL_NONADMIN);
|
2006-02-01 20:01:18 +00:00
|
|
|
|
|
|
|
default:
|
|
|
|
return (AUE_SYSCTL);
|
|
|
|
}
|
|
|
|
/* NOTREACHED */
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2006-03-19 17:34:00 +00:00
|
|
|
* Convert an open flags specifier into a specific type of open event for
|
2006-02-01 20:01:18 +00:00
|
|
|
* auditing purposes.
|
|
|
|
*/
|
|
|
|
au_event_t
|
2008-03-01 11:40:49 +00:00
|
|
|
audit_flags_and_error_to_openevent(int oflags, int error)
|
2006-03-19 17:34:00 +00:00
|
|
|
{
|
2009-07-28 21:39:58 +00:00
|
|
|
int i;
|
2006-02-01 20:01:18 +00:00
|
|
|
|
2006-03-19 17:34:00 +00:00
|
|
|
/*
|
|
|
|
* Need to check only those flags we care about.
|
|
|
|
*/
|
2006-02-01 20:01:18 +00:00
|
|
|
oflags = oflags & (O_RDONLY | O_CREAT | O_TRUNC | O_RDWR | O_WRONLY);
|
2009-07-28 21:39:58 +00:00
|
|
|
for (i = 0; i < aue_open_count; i++) {
|
|
|
|
if (aue_open[i].aoe_flags == oflags)
|
|
|
|
return (aue_open[i].aoe_event);
|
2006-02-01 20:01:18 +00:00
|
|
|
}
|
2009-07-28 21:39:58 +00:00
|
|
|
return (AUE_OPEN);
|
|
|
|
}
|
|
|
|
|
|
|
|
au_event_t
|
|
|
|
audit_flags_and_error_to_openatevent(int oflags, int error)
|
|
|
|
{
|
|
|
|
int i;
|
2006-02-01 20:01:18 +00:00
|
|
|
|
2006-03-19 17:34:00 +00:00
|
|
|
/*
|
2009-07-28 21:39:58 +00:00
|
|
|
* Need to check only those flags we care about.
|
2006-02-01 20:01:18 +00:00
|
|
|
*/
|
2009-07-28 21:39:58 +00:00
|
|
|
oflags = oflags & (O_RDONLY | O_CREAT | O_TRUNC | O_RDWR | O_WRONLY);
|
|
|
|
for (i = 0; i < aue_openat_count; i++) {
|
|
|
|
if (aue_openat[i].aoe_flags == oflags)
|
|
|
|
return (aue_openat[i].aoe_event);
|
2006-02-01 20:01:18 +00:00
|
|
|
}
|
2009-07-28 21:39:58 +00:00
|
|
|
return (AUE_OPENAT);
|
2006-02-01 20:01:18 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Convert a MSGCTL command to a specific event.
|
|
|
|
*/
|
2009-02-08 14:39:35 +00:00
|
|
|
au_event_t
|
2008-02-25 20:28:00 +00:00
|
|
|
audit_msgctl_to_event(int cmd)
|
2006-02-01 20:01:18 +00:00
|
|
|
{
|
|
|
|
|
|
|
|
switch (cmd) {
|
|
|
|
case IPC_RMID:
|
|
|
|
return (AUE_MSGCTL_RMID);
|
|
|
|
|
|
|
|
case IPC_SET:
|
|
|
|
return (AUE_MSGCTL_SET);
|
|
|
|
|
|
|
|
case IPC_STAT:
|
|
|
|
return (AUE_MSGCTL_STAT);
|
|
|
|
|
|
|
|
default:
|
2007-06-01 21:58:59 +00:00
|
|
|
/* We will audit a bad command. */
|
2006-02-01 20:01:18 +00:00
|
|
|
return (AUE_MSGCTL);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Convert a SEMCTL command to a specific event.
|
|
|
|
*/
|
2009-02-08 14:39:35 +00:00
|
|
|
au_event_t
|
2008-02-25 20:28:00 +00:00
|
|
|
audit_semctl_to_event(int cmd)
|
2006-02-01 20:01:18 +00:00
|
|
|
{
|
|
|
|
|
|
|
|
switch (cmd) {
|
|
|
|
case GETALL:
|
|
|
|
return (AUE_SEMCTL_GETALL);
|
|
|
|
|
|
|
|
case GETNCNT:
|
|
|
|
return (AUE_SEMCTL_GETNCNT);
|
|
|
|
|
|
|
|
case GETPID:
|
|
|
|
return (AUE_SEMCTL_GETPID);
|
|
|
|
|
|
|
|
case GETVAL:
|
|
|
|
return (AUE_SEMCTL_GETVAL);
|
|
|
|
|
|
|
|
case GETZCNT:
|
|
|
|
return (AUE_SEMCTL_GETZCNT);
|
|
|
|
|
|
|
|
case IPC_RMID:
|
|
|
|
return (AUE_SEMCTL_RMID);
|
|
|
|
|
|
|
|
case IPC_SET:
|
|
|
|
return (AUE_SEMCTL_SET);
|
|
|
|
|
|
|
|
case SETALL:
|
|
|
|
return (AUE_SEMCTL_SETALL);
|
|
|
|
|
|
|
|
case SETVAL:
|
|
|
|
return (AUE_SEMCTL_SETVAL);
|
|
|
|
|
|
|
|
case IPC_STAT:
|
|
|
|
return (AUE_SEMCTL_STAT);
|
|
|
|
|
|
|
|
default:
|
2008-07-31 09:54:35 +00:00
|
|
|
/* We will audit a bad command. */
|
2006-02-01 20:01:18 +00:00
|
|
|
return (AUE_SEMCTL);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Convert a command for the auditon() system call to a audit event.
|
|
|
|
*/
|
2009-02-08 14:39:35 +00:00
|
|
|
au_event_t
|
2006-02-01 20:01:18 +00:00
|
|
|
auditon_command_event(int cmd)
|
|
|
|
{
|
|
|
|
|
|
|
|
switch(cmd) {
|
|
|
|
case A_GETPOLICY:
|
|
|
|
return (AUE_AUDITON_GPOLICY);
|
|
|
|
|
|
|
|
case A_SETPOLICY:
|
|
|
|
return (AUE_AUDITON_SPOLICY);
|
|
|
|
|
|
|
|
case A_GETKMASK:
|
|
|
|
return (AUE_AUDITON_GETKMASK);
|
|
|
|
|
|
|
|
case A_SETKMASK:
|
|
|
|
return (AUE_AUDITON_SETKMASK);
|
|
|
|
|
|
|
|
case A_GETQCTRL:
|
|
|
|
return (AUE_AUDITON_GQCTRL);
|
|
|
|
|
|
|
|
case A_SETQCTRL:
|
|
|
|
return (AUE_AUDITON_SQCTRL);
|
|
|
|
|
|
|
|
case A_GETCWD:
|
|
|
|
return (AUE_AUDITON_GETCWD);
|
|
|
|
|
|
|
|
case A_GETCAR:
|
|
|
|
return (AUE_AUDITON_GETCAR);
|
|
|
|
|
|
|
|
case A_GETSTAT:
|
|
|
|
return (AUE_AUDITON_GETSTAT);
|
|
|
|
|
|
|
|
case A_SETSTAT:
|
|
|
|
return (AUE_AUDITON_SETSTAT);
|
|
|
|
|
|
|
|
case A_SETUMASK:
|
|
|
|
return (AUE_AUDITON_SETUMASK);
|
|
|
|
|
|
|
|
case A_SETSMASK:
|
|
|
|
return (AUE_AUDITON_SETSMASK);
|
|
|
|
|
|
|
|
case A_GETCOND:
|
|
|
|
return (AUE_AUDITON_GETCOND);
|
|
|
|
|
|
|
|
case A_SETCOND:
|
|
|
|
return (AUE_AUDITON_SETCOND);
|
|
|
|
|
|
|
|
case A_GETCLASS:
|
|
|
|
return (AUE_AUDITON_GETCLASS);
|
|
|
|
|
|
|
|
case A_SETCLASS:
|
|
|
|
return (AUE_AUDITON_SETCLASS);
|
|
|
|
|
|
|
|
case A_GETPINFO:
|
|
|
|
case A_SETPMASK:
|
|
|
|
case A_SETFSIZE:
|
|
|
|
case A_GETFSIZE:
|
|
|
|
case A_GETPINFO_ADDR:
|
|
|
|
case A_GETKAUDIT:
|
|
|
|
case A_SETKAUDIT:
|
|
|
|
default:
|
|
|
|
return (AUE_AUDITON); /* No special record */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-03-19 17:34:00 +00:00
|
|
|
/*
|
|
|
|
* Create a canonical path from given path by prefixing either the root
|
|
|
|
* directory, or the current working directory. If the process working
|
2007-06-01 21:58:59 +00:00
|
|
|
* directory is NULL, we could use 'rootvnode' to obtain the root directory,
|
2006-03-19 17:34:00 +00:00
|
|
|
* but this results in a volfs name written to the audit log. So we will
|
|
|
|
* leave the filename starting with '/' in the audit log in this case.
|
2006-02-01 20:01:18 +00:00
|
|
|
*/
|
|
|
|
void
|
2012-11-30 23:18:49 +00:00
|
|
|
audit_canon_path(struct thread *td, int dirfd, char *path, char *cpath)
|
2006-02-01 20:01:18 +00:00
|
|
|
{
|
2008-07-31 16:57:41 +00:00
|
|
|
struct vnode *cvnp, *rvnp;
|
|
|
|
char *rbuf, *fbuf, *copy;
|
2006-02-01 20:01:18 +00:00
|
|
|
struct filedesc *fdp;
|
2008-07-31 16:57:41 +00:00
|
|
|
struct sbuf sbf;
|
2012-12-01 08:51:40 +00:00
|
|
|
int error, needslash;
|
2006-02-01 20:01:18 +00:00
|
|
|
|
2008-07-31 16:57:41 +00:00
|
|
|
WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL, "%s: at %s:%d",
|
|
|
|
__func__, __FILE__, __LINE__);
|
2006-12-29 10:37:32 +00:00
|
|
|
|
2008-07-31 16:57:41 +00:00
|
|
|
copy = path;
|
|
|
|
rvnp = cvnp = NULL;
|
2006-02-01 20:01:18 +00:00
|
|
|
fdp = td->td_proc->p_fd;
|
Replace custom file descriptor array sleep lock constructed using a mutex
and flags with an sxlock. This leads to a significant and measurable
performance improvement as a result of access to shared locking for
frequent lookup operations, reduced general overhead, and reduced overhead
in the event of contention. All of these are imported for threaded
applications where simultaneous access to a shared file descriptor array
occurs frequently. Kris has reported 2x-4x transaction rate improvements
on 8-core MySQL benchmarks; smaller improvements can be expected for many
workloads as a result of reduced overhead.
- Generally eliminate the distinction between "fast" and regular
acquisisition of the filedesc lock; the plan is that they will now all
be fast. Change all locking instances to either shared or exclusive
locks.
- Correct a bug (pointed out by kib) in fdfree() where previously msleep()
was called without the mutex held; sx_sleep() is now always called with
the sxlock held exclusively.
- Universally hold the struct file lock over changes to struct file,
rather than the filedesc lock or no lock. Always update the f_ops
field last. A further memory barrier is required here in the future
(discussed with jhb).
- Improve locking and reference management in linux_at(), which fails to
properly acquire vnode references before using vnode pointers. Annotate
improper use of vn_fullpath(), which will be replaced at a future date.
In fcntl(), we conservatively acquire an exclusive lock, even though in
some cases a shared lock may be sufficient, which should be revisited.
The dropping of the filedesc lock in fdgrowtable() is no longer required
as the sxlock can be held over the sleep operation; we should consider
removing that (pointed out by attilio).
Tested by: kris
Discussed with: jhb, kris, attilio, jeff
2007-04-04 09:11:34 +00:00
|
|
|
FILEDESC_SLOCK(fdp);
|
2008-07-31 16:57:41 +00:00
|
|
|
/*
|
|
|
|
* Make sure that we handle the chroot(2) case. If there is an
|
|
|
|
* alternate root directory, prepend it to the audited pathname.
|
|
|
|
*/
|
|
|
|
if (fdp->fd_rdir != NULL && fdp->fd_rdir != rootvnode) {
|
|
|
|
rvnp = fdp->fd_rdir;
|
|
|
|
vhold(rvnp);
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* If the supplied path is relative, make sure we capture the current
|
|
|
|
* working directory so we can prepend it to the supplied relative
|
|
|
|
* path.
|
|
|
|
*/
|
|
|
|
if (*path != '/') {
|
2012-11-30 23:18:49 +00:00
|
|
|
if (dirfd == AT_FDCWD) {
|
|
|
|
cvnp = fdp->fd_cdir;
|
|
|
|
vhold(cvnp);
|
|
|
|
} else {
|
|
|
|
/* XXX: fgetvp() that vhold()s vnode instead of vref()ing it would be better */
|
|
|
|
error = fgetvp(td, dirfd, 0, &cvnp);
|
|
|
|
if (error) {
|
|
|
|
cpath[0] = '\0';
|
|
|
|
if (rvnp != NULL)
|
|
|
|
vdrop(rvnp);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
vhold(cvnp);
|
|
|
|
vrele(cvnp);
|
|
|
|
}
|
|
|
|
needslash = (fdp->fd_rdir != cvnp);
|
|
|
|
} else {
|
|
|
|
needslash = 1;
|
2006-02-01 20:01:18 +00:00
|
|
|
}
|
Replace custom file descriptor array sleep lock constructed using a mutex
and flags with an sxlock. This leads to a significant and measurable
performance improvement as a result of access to shared locking for
frequent lookup operations, reduced general overhead, and reduced overhead
in the event of contention. All of these are imported for threaded
applications where simultaneous access to a shared file descriptor array
occurs frequently. Kris has reported 2x-4x transaction rate improvements
on 8-core MySQL benchmarks; smaller improvements can be expected for many
workloads as a result of reduced overhead.
- Generally eliminate the distinction between "fast" and regular
acquisisition of the filedesc lock; the plan is that they will now all
be fast. Change all locking instances to either shared or exclusive
locks.
- Correct a bug (pointed out by kib) in fdfree() where previously msleep()
was called without the mutex held; sx_sleep() is now always called with
the sxlock held exclusively.
- Universally hold the struct file lock over changes to struct file,
rather than the filedesc lock or no lock. Always update the f_ops
field last. A further memory barrier is required here in the future
(discussed with jhb).
- Improve locking and reference management in linux_at(), which fails to
properly acquire vnode references before using vnode pointers. Annotate
improper use of vn_fullpath(), which will be replaced at a future date.
In fcntl(), we conservatively acquire an exclusive lock, even though in
some cases a shared lock may be sufficient, which should be revisited.
The dropping of the filedesc lock in fdgrowtable() is no longer required
as the sxlock can be held over the sleep operation; we should consider
removing that (pointed out by attilio).
Tested by: kris
Discussed with: jhb, kris, attilio, jeff
2007-04-04 09:11:34 +00:00
|
|
|
FILEDESC_SUNLOCK(fdp);
|
2008-07-31 16:57:41 +00:00
|
|
|
/*
|
|
|
|
* NB: We require that the supplied array be at least MAXPATHLEN bytes
|
|
|
|
* long. If this is not the case, then we can run into serious trouble.
|
|
|
|
*/
|
|
|
|
(void) sbuf_new(&sbf, cpath, MAXPATHLEN, SBUF_FIXEDLEN);
|
|
|
|
/*
|
|
|
|
* Strip leading forward slashes.
|
|
|
|
*/
|
|
|
|
while (*copy == '/')
|
|
|
|
copy++;
|
|
|
|
/*
|
|
|
|
* Make sure we handle chroot(2) and prepend the global path to these
|
|
|
|
* environments.
|
|
|
|
*
|
|
|
|
* NB: vn_fullpath(9) on FreeBSD is less reliable than vn_getpath(9)
|
|
|
|
* on Darwin. As a result, this may need some additional attention
|
|
|
|
* in the future.
|
|
|
|
*/
|
|
|
|
if (rvnp != NULL) {
|
|
|
|
error = vn_fullpath_global(td, rvnp, &rbuf, &fbuf);
|
2008-11-04 22:30:24 +00:00
|
|
|
vdrop(rvnp);
|
2008-07-31 16:57:41 +00:00
|
|
|
if (error) {
|
2006-02-01 20:01:18 +00:00
|
|
|
cpath[0] = '\0';
|
2008-07-31 16:57:41 +00:00
|
|
|
if (cvnp != NULL)
|
|
|
|
vdrop(cvnp);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
(void) sbuf_cat(&sbf, rbuf);
|
|
|
|
free(fbuf, M_TEMP);
|
|
|
|
}
|
|
|
|
if (cvnp != NULL) {
|
|
|
|
error = vn_fullpath(td, cvnp, &rbuf, &fbuf);
|
2008-11-04 22:30:24 +00:00
|
|
|
vdrop(cvnp);
|
2008-07-31 16:57:41 +00:00
|
|
|
if (error) {
|
|
|
|
cpath[0] = '\0';
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
(void) sbuf_cat(&sbf, rbuf);
|
|
|
|
free(fbuf, M_TEMP);
|
|
|
|
}
|
2012-11-30 23:18:49 +00:00
|
|
|
if (needslash)
|
2008-08-24 03:12:17 +00:00
|
|
|
(void) sbuf_putc(&sbf, '/');
|
2008-07-31 16:57:41 +00:00
|
|
|
/*
|
|
|
|
* Now that we have processed any alternate root and relative path
|
|
|
|
* names, add the supplied pathname.
|
|
|
|
*/
|
|
|
|
(void) sbuf_cat(&sbf, copy);
|
|
|
|
/*
|
|
|
|
* One or more of the previous sbuf operations could have resulted in
|
|
|
|
* the supplied buffer being overflowed. Check to see if this is the
|
|
|
|
* case.
|
|
|
|
*/
|
2010-09-10 16:42:16 +00:00
|
|
|
if (sbuf_error(&sbf) != 0) {
|
2008-07-31 16:57:41 +00:00
|
|
|
cpath[0] = '\0';
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
sbuf_finish(&sbf);
|
2006-02-01 20:01:18 +00:00
|
|
|
}
|