Merge branch 'fixes-for-3.7' of git://gitorious.org/linux-can/linux-can
[deliverable/linux.git] / kernel / auditsc.c
CommitLineData
85c8721f 1/* auditsc.c -- System-call auditing support
1da177e4
LT
2 * Handles all system-call specific auditing features.
3 *
4 * Copyright 2003-2004 Red Hat Inc., Durham, North Carolina.
73241ccc 5 * Copyright 2005 Hewlett-Packard Development Company, L.P.
20ca73bc 6 * Copyright (C) 2005, 2006 IBM Corporation
1da177e4
LT
7 * All Rights Reserved.
8 *
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
13 *
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
18 *
19 * You should have received a copy of the GNU General Public License
20 * along with this program; if not, write to the Free Software
21 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 *
23 * Written by Rickard E. (Rik) Faith <faith@redhat.com>
24 *
25 * Many of the ideas implemented here are from Stephen C. Tweedie,
26 * especially the idea of avoiding a copy by using getname.
27 *
28 * The method for actual interception of syscall entry and exit (not in
29 * this file -- see entry.S) is based on a GPL'd patch written by
30 * okir@suse.de and Copyright 2003 SuSE Linux AG.
31 *
20ca73bc
GW
32 * POSIX message queue support added by George Wilson <ltcgcw@us.ibm.com>,
33 * 2006.
34 *
b63862f4
DK
35 * The support of additional filter rules compares (>, <, >=, <=) was
36 * added by Dustin Kirkland <dustin.kirkland@us.ibm.com>, 2005.
37 *
73241ccc
AG
38 * Modified by Amy Griffis <amy.griffis@hp.com> to collect additional
39 * filesystem information.
8c8570fb
DK
40 *
41 * Subject and object context labeling support added by <danjones@us.ibm.com>
42 * and <dustin.kirkland@us.ibm.com> for LSPP certification compliance.
1da177e4
LT
43 */
44
45#include <linux/init.h>
1da177e4 46#include <asm/types.h>
60063497 47#include <linux/atomic.h>
73241ccc
AG
48#include <linux/fs.h>
49#include <linux/namei.h>
1da177e4 50#include <linux/mm.h>
9984de1a 51#include <linux/export.h>
5a0e3ad6 52#include <linux/slab.h>
01116105 53#include <linux/mount.h>
3ec3b2fb 54#include <linux/socket.h>
20ca73bc 55#include <linux/mqueue.h>
1da177e4
LT
56#include <linux/audit.h>
57#include <linux/personality.h>
58#include <linux/time.h>
5bb289b5 59#include <linux/netlink.h>
f5561964 60#include <linux/compiler.h>
1da177e4 61#include <asm/unistd.h>
8c8570fb 62#include <linux/security.h>
fe7752ba 63#include <linux/list.h>
a6c043a8 64#include <linux/tty.h>
473ae30b 65#include <linux/binfmts.h>
a1f8e7f7 66#include <linux/highmem.h>
f46038ff 67#include <linux/syscalls.h>
851f7ff5 68#include <linux/capability.h>
5ad4e53b 69#include <linux/fs_struct.h>
3dc1c1b2 70#include <linux/compat.h>
1da177e4 71
fe7752ba 72#include "audit.h"
1da177e4 73
d7e7528b
EP
74/* flags stating the success for a syscall */
75#define AUDITSC_INVALID 0
76#define AUDITSC_SUCCESS 1
77#define AUDITSC_FAILURE 2
78
1da177e4 79/* AUDIT_NAMES is the number of slots we reserve in the audit_context
5195d8e2
EP
80 * for saving names from getname(). If we get more names we will allocate
81 * a name dynamically and also add those to the list anchored by names_list. */
82#define AUDIT_NAMES 5
1da177e4 83
9c937dcc
AG
84/* Indicates that audit should log the full pathname. */
85#define AUDIT_NAME_FULL -1
86
de6bbd1d
EP
87/* no execve audit message should be longer than this (userspace limits) */
88#define MAX_EXECVE_AUDIT_LEN 7500
89
471a5c7c
AV
90/* number of audit rules */
91int audit_n_rules;
92
e54dc243
AG
93/* determines whether we collect data for signals sent */
94int audit_signals;
95
851f7ff5
EP
96struct audit_cap_data {
97 kernel_cap_t permitted;
98 kernel_cap_t inheritable;
99 union {
100 unsigned int fE; /* effective bit of a file capability */
101 kernel_cap_t effective; /* effective set of a process */
102 };
103};
104
1da177e4
LT
105/* When fs/namei.c:getname() is called, we store the pointer in name and
106 * we don't let putname() free it (instead we free all of the saved
107 * pointers at syscall exit time).
108 *
109 * Further, in fs/namei.c:path_lookup() we store the inode and device. */
110struct audit_names {
5195d8e2 111 struct list_head list; /* audit_context->names_list */
1da177e4
LT
112 const char *name;
113 unsigned long ino;
114 dev_t dev;
115 umode_t mode;
ca57ec0f
EB
116 kuid_t uid;
117 kgid_t gid;
1da177e4 118 dev_t rdev;
1b50eed9 119 u32 osid;
851f7ff5
EP
120 struct audit_cap_data fcap;
121 unsigned int fcap_ver;
5195d8e2
EP
122 int name_len; /* number of name's characters to log */
123 bool name_put; /* call __putname() for this name */
124 /*
125 * This was an allocated audit_names and not from the array of
126 * names allocated in the task audit context. Thus this name
127 * should be freed on syscall exit
128 */
129 bool should_free;
1da177e4
LT
130};
131
132struct audit_aux_data {
133 struct audit_aux_data *next;
134 int type;
135};
136
137#define AUDIT_AUX_IPCPERM 0
138
e54dc243
AG
139/* Number of target pids per aux struct. */
140#define AUDIT_AUX_PIDS 16
141
473ae30b
AV
142struct audit_aux_data_execve {
143 struct audit_aux_data d;
144 int argc;
145 int envc;
bdf4c48a 146 struct mm_struct *mm;
473ae30b
AV
147};
148
e54dc243
AG
149struct audit_aux_data_pids {
150 struct audit_aux_data d;
151 pid_t target_pid[AUDIT_AUX_PIDS];
e1760bd5 152 kuid_t target_auid[AUDIT_AUX_PIDS];
cca080d9 153 kuid_t target_uid[AUDIT_AUX_PIDS];
4746ec5b 154 unsigned int target_sessionid[AUDIT_AUX_PIDS];
e54dc243 155 u32 target_sid[AUDIT_AUX_PIDS];
c2a7780e 156 char target_comm[AUDIT_AUX_PIDS][TASK_COMM_LEN];
e54dc243
AG
157 int pid_count;
158};
159
3fc689e9
EP
160struct audit_aux_data_bprm_fcaps {
161 struct audit_aux_data d;
162 struct audit_cap_data fcap;
163 unsigned int fcap_ver;
164 struct audit_cap_data old_pcap;
165 struct audit_cap_data new_pcap;
166};
167
e68b75a0
EP
168struct audit_aux_data_capset {
169 struct audit_aux_data d;
170 pid_t pid;
171 struct audit_cap_data cap;
172};
173
74c3cbe3
AV
174struct audit_tree_refs {
175 struct audit_tree_refs *next;
176 struct audit_chunk *c[31];
177};
178
1da177e4
LT
179/* The per-task audit context. */
180struct audit_context {
d51374ad 181 int dummy; /* must be the first element */
1da177e4 182 int in_syscall; /* 1 if task is in a syscall */
0590b933 183 enum audit_state state, current_state;
1da177e4 184 unsigned int serial; /* serial number for record */
1da177e4 185 int major; /* syscall number */
44e51a1b 186 struct timespec ctime; /* time of syscall entry */
1da177e4 187 unsigned long argv[4]; /* syscall arguments */
2fd6f58b 188 long return_code;/* syscall return code */
0590b933 189 u64 prio;
44e51a1b 190 int return_valid; /* return code is valid */
5195d8e2
EP
191 /*
192 * The names_list is the list of all audit_names collected during this
193 * syscall. The first AUDIT_NAMES entries in the names_list will
194 * actually be from the preallocated_names array for performance
195 * reasons. Except during allocation they should never be referenced
196 * through the preallocated_names array and should only be found/used
197 * by running the names_list.
198 */
199 struct audit_names preallocated_names[AUDIT_NAMES];
200 int name_count; /* total records in names_list */
201 struct list_head names_list; /* anchor for struct audit_names->list */
5adc8a6a 202 char * filterkey; /* key for rule that triggered record */
44707fdf 203 struct path pwd;
1da177e4
LT
204 struct audit_context *previous; /* For nested syscalls */
205 struct audit_aux_data *aux;
e54dc243 206 struct audit_aux_data *aux_pids;
4f6b434f
AV
207 struct sockaddr_storage *sockaddr;
208 size_t sockaddr_len;
1da177e4 209 /* Save things to print about task_struct */
f46038ff 210 pid_t pid, ppid;
cca080d9
EB
211 kuid_t uid, euid, suid, fsuid;
212 kgid_t gid, egid, sgid, fsgid;
1da177e4 213 unsigned long personality;
2fd6f58b 214 int arch;
1da177e4 215
a5cb013d 216 pid_t target_pid;
e1760bd5 217 kuid_t target_auid;
cca080d9 218 kuid_t target_uid;
4746ec5b 219 unsigned int target_sessionid;
a5cb013d 220 u32 target_sid;
c2a7780e 221 char target_comm[TASK_COMM_LEN];
a5cb013d 222
74c3cbe3 223 struct audit_tree_refs *trees, *first_trees;
916d7576 224 struct list_head killed_trees;
44e51a1b 225 int tree_count;
74c3cbe3 226
f3298dc4
AV
227 int type;
228 union {
229 struct {
230 int nargs;
231 long args[6];
232 } socketcall;
a33e6751 233 struct {
cca080d9
EB
234 kuid_t uid;
235 kgid_t gid;
2570ebbd 236 umode_t mode;
a33e6751 237 u32 osid;
e816f370
AV
238 int has_perm;
239 uid_t perm_uid;
240 gid_t perm_gid;
2570ebbd 241 umode_t perm_mode;
e816f370 242 unsigned long qbytes;
a33e6751 243 } ipc;
7392906e
AV
244 struct {
245 mqd_t mqdes;
246 struct mq_attr mqstat;
247 } mq_getsetattr;
20114f71
AV
248 struct {
249 mqd_t mqdes;
250 int sigev_signo;
251 } mq_notify;
c32c8af4
AV
252 struct {
253 mqd_t mqdes;
254 size_t msg_len;
255 unsigned int msg_prio;
256 struct timespec abs_timeout;
257 } mq_sendrecv;
564f6993
AV
258 struct {
259 int oflag;
df0a4283 260 umode_t mode;
564f6993
AV
261 struct mq_attr attr;
262 } mq_open;
57f71a0a
AV
263 struct {
264 pid_t pid;
265 struct audit_cap_data cap;
266 } capset;
120a795d
AV
267 struct {
268 int fd;
269 int flags;
270 } mmap;
f3298dc4 271 };
157cf649 272 int fds[2];
f3298dc4 273
1da177e4
LT
274#if AUDIT_DEBUG
275 int put_count;
276 int ino_count;
277#endif
278};
279
55669bfa
AV
280static inline int open_arg(int flags, int mask)
281{
282 int n = ACC_MODE(flags);
283 if (flags & (O_TRUNC | O_CREAT))
284 n |= AUDIT_PERM_WRITE;
285 return n & mask;
286}
287
288static int audit_match_perm(struct audit_context *ctx, int mask)
289{
c4bacefb 290 unsigned n;
1a61c88d 291 if (unlikely(!ctx))
292 return 0;
c4bacefb 293 n = ctx->major;
dbda4c0b 294
55669bfa
AV
295 switch (audit_classify_syscall(ctx->arch, n)) {
296 case 0: /* native */
297 if ((mask & AUDIT_PERM_WRITE) &&
298 audit_match_class(AUDIT_CLASS_WRITE, n))
299 return 1;
300 if ((mask & AUDIT_PERM_READ) &&
301 audit_match_class(AUDIT_CLASS_READ, n))
302 return 1;
303 if ((mask & AUDIT_PERM_ATTR) &&
304 audit_match_class(AUDIT_CLASS_CHATTR, n))
305 return 1;
306 return 0;
307 case 1: /* 32bit on biarch */
308 if ((mask & AUDIT_PERM_WRITE) &&
309 audit_match_class(AUDIT_CLASS_WRITE_32, n))
310 return 1;
311 if ((mask & AUDIT_PERM_READ) &&
312 audit_match_class(AUDIT_CLASS_READ_32, n))
313 return 1;
314 if ((mask & AUDIT_PERM_ATTR) &&
315 audit_match_class(AUDIT_CLASS_CHATTR_32, n))
316 return 1;
317 return 0;
318 case 2: /* open */
319 return mask & ACC_MODE(ctx->argv[1]);
320 case 3: /* openat */
321 return mask & ACC_MODE(ctx->argv[2]);
322 case 4: /* socketcall */
323 return ((mask & AUDIT_PERM_WRITE) && ctx->argv[0] == SYS_BIND);
324 case 5: /* execve */
325 return mask & AUDIT_PERM_EXEC;
326 default:
327 return 0;
328 }
329}
330
5ef30ee5 331static int audit_match_filetype(struct audit_context *ctx, int val)
8b67dca9 332{
5195d8e2 333 struct audit_names *n;
5ef30ee5 334 umode_t mode = (umode_t)val;
1a61c88d 335
336 if (unlikely(!ctx))
337 return 0;
338
5195d8e2
EP
339 list_for_each_entry(n, &ctx->names_list, list) {
340 if ((n->ino != -1) &&
341 ((n->mode & S_IFMT) == mode))
5ef30ee5
EP
342 return 1;
343 }
5195d8e2 344
5ef30ee5 345 return 0;
8b67dca9
AV
346}
347
74c3cbe3
AV
348/*
349 * We keep a linked list of fixed-sized (31 pointer) arrays of audit_chunk *;
350 * ->first_trees points to its beginning, ->trees - to the current end of data.
351 * ->tree_count is the number of free entries in array pointed to by ->trees.
352 * Original condition is (NULL, NULL, 0); as soon as it grows we never revert to NULL,
353 * "empty" becomes (p, p, 31) afterwards. We don't shrink the list (and seriously,
354 * it's going to remain 1-element for almost any setup) until we free context itself.
355 * References in it _are_ dropped - at the same time we free/drop aux stuff.
356 */
357
358#ifdef CONFIG_AUDIT_TREE
679173b7
EP
359static void audit_set_auditable(struct audit_context *ctx)
360{
361 if (!ctx->prio) {
362 ctx->prio = 1;
363 ctx->current_state = AUDIT_RECORD_CONTEXT;
364 }
365}
366
74c3cbe3
AV
367static int put_tree_ref(struct audit_context *ctx, struct audit_chunk *chunk)
368{
369 struct audit_tree_refs *p = ctx->trees;
370 int left = ctx->tree_count;
371 if (likely(left)) {
372 p->c[--left] = chunk;
373 ctx->tree_count = left;
374 return 1;
375 }
376 if (!p)
377 return 0;
378 p = p->next;
379 if (p) {
380 p->c[30] = chunk;
381 ctx->trees = p;
382 ctx->tree_count = 30;
383 return 1;
384 }
385 return 0;
386}
387
388static int grow_tree_refs(struct audit_context *ctx)
389{
390 struct audit_tree_refs *p = ctx->trees;
391 ctx->trees = kzalloc(sizeof(struct audit_tree_refs), GFP_KERNEL);
392 if (!ctx->trees) {
393 ctx->trees = p;
394 return 0;
395 }
396 if (p)
397 p->next = ctx->trees;
398 else
399 ctx->first_trees = ctx->trees;
400 ctx->tree_count = 31;
401 return 1;
402}
403#endif
404
405static void unroll_tree_refs(struct audit_context *ctx,
406 struct audit_tree_refs *p, int count)
407{
408#ifdef CONFIG_AUDIT_TREE
409 struct audit_tree_refs *q;
410 int n;
411 if (!p) {
412 /* we started with empty chain */
413 p = ctx->first_trees;
414 count = 31;
415 /* if the very first allocation has failed, nothing to do */
416 if (!p)
417 return;
418 }
419 n = count;
420 for (q = p; q != ctx->trees; q = q->next, n = 31) {
421 while (n--) {
422 audit_put_chunk(q->c[n]);
423 q->c[n] = NULL;
424 }
425 }
426 while (n-- > ctx->tree_count) {
427 audit_put_chunk(q->c[n]);
428 q->c[n] = NULL;
429 }
430 ctx->trees = p;
431 ctx->tree_count = count;
432#endif
433}
434
435static void free_tree_refs(struct audit_context *ctx)
436{
437 struct audit_tree_refs *p, *q;
438 for (p = ctx->first_trees; p; p = q) {
439 q = p->next;
440 kfree(p);
441 }
442}
443
444static int match_tree_refs(struct audit_context *ctx, struct audit_tree *tree)
445{
446#ifdef CONFIG_AUDIT_TREE
447 struct audit_tree_refs *p;
448 int n;
449 if (!tree)
450 return 0;
451 /* full ones */
452 for (p = ctx->first_trees; p != ctx->trees; p = p->next) {
453 for (n = 0; n < 31; n++)
454 if (audit_tree_match(p->c[n], tree))
455 return 1;
456 }
457 /* partial */
458 if (p) {
459 for (n = ctx->tree_count; n < 31; n++)
460 if (audit_tree_match(p->c[n], tree))
461 return 1;
462 }
463#endif
464 return 0;
465}
466
ca57ec0f
EB
467static int audit_compare_uid(kuid_t uid,
468 struct audit_names *name,
469 struct audit_field *f,
470 struct audit_context *ctx)
b34b0393
EP
471{
472 struct audit_names *n;
b34b0393 473 int rc;
ca57ec0f 474
b34b0393 475 if (name) {
ca57ec0f 476 rc = audit_uid_comparator(uid, f->op, name->uid);
b34b0393
EP
477 if (rc)
478 return rc;
479 }
ca57ec0f 480
b34b0393
EP
481 if (ctx) {
482 list_for_each_entry(n, &ctx->names_list, list) {
ca57ec0f
EB
483 rc = audit_uid_comparator(uid, f->op, n->uid);
484 if (rc)
485 return rc;
486 }
487 }
488 return 0;
489}
b34b0393 490
ca57ec0f
EB
491static int audit_compare_gid(kgid_t gid,
492 struct audit_names *name,
493 struct audit_field *f,
494 struct audit_context *ctx)
495{
496 struct audit_names *n;
497 int rc;
498
499 if (name) {
500 rc = audit_gid_comparator(gid, f->op, name->gid);
501 if (rc)
502 return rc;
503 }
504
505 if (ctx) {
506 list_for_each_entry(n, &ctx->names_list, list) {
507 rc = audit_gid_comparator(gid, f->op, n->gid);
b34b0393
EP
508 if (rc)
509 return rc;
510 }
511 }
512 return 0;
513}
514
02d86a56
EP
515static int audit_field_compare(struct task_struct *tsk,
516 const struct cred *cred,
517 struct audit_field *f,
518 struct audit_context *ctx,
519 struct audit_names *name)
520{
02d86a56 521 switch (f->val) {
4a6633ed 522 /* process to file object comparisons */
02d86a56 523 case AUDIT_COMPARE_UID_TO_OBJ_UID:
ca57ec0f 524 return audit_compare_uid(cred->uid, name, f, ctx);
c9fe685f 525 case AUDIT_COMPARE_GID_TO_OBJ_GID:
ca57ec0f 526 return audit_compare_gid(cred->gid, name, f, ctx);
4a6633ed 527 case AUDIT_COMPARE_EUID_TO_OBJ_UID:
ca57ec0f 528 return audit_compare_uid(cred->euid, name, f, ctx);
4a6633ed 529 case AUDIT_COMPARE_EGID_TO_OBJ_GID:
ca57ec0f 530 return audit_compare_gid(cred->egid, name, f, ctx);
4a6633ed 531 case AUDIT_COMPARE_AUID_TO_OBJ_UID:
ca57ec0f 532 return audit_compare_uid(tsk->loginuid, name, f, ctx);
4a6633ed 533 case AUDIT_COMPARE_SUID_TO_OBJ_UID:
ca57ec0f 534 return audit_compare_uid(cred->suid, name, f, ctx);
4a6633ed 535 case AUDIT_COMPARE_SGID_TO_OBJ_GID:
ca57ec0f 536 return audit_compare_gid(cred->sgid, name, f, ctx);
4a6633ed 537 case AUDIT_COMPARE_FSUID_TO_OBJ_UID:
ca57ec0f 538 return audit_compare_uid(cred->fsuid, name, f, ctx);
4a6633ed 539 case AUDIT_COMPARE_FSGID_TO_OBJ_GID:
ca57ec0f 540 return audit_compare_gid(cred->fsgid, name, f, ctx);
10d68360
PM
541 /* uid comparisons */
542 case AUDIT_COMPARE_UID_TO_AUID:
ca57ec0f 543 return audit_uid_comparator(cred->uid, f->op, tsk->loginuid);
10d68360 544 case AUDIT_COMPARE_UID_TO_EUID:
ca57ec0f 545 return audit_uid_comparator(cred->uid, f->op, cred->euid);
10d68360 546 case AUDIT_COMPARE_UID_TO_SUID:
ca57ec0f 547 return audit_uid_comparator(cred->uid, f->op, cred->suid);
10d68360 548 case AUDIT_COMPARE_UID_TO_FSUID:
ca57ec0f 549 return audit_uid_comparator(cred->uid, f->op, cred->fsuid);
10d68360
PM
550 /* auid comparisons */
551 case AUDIT_COMPARE_AUID_TO_EUID:
ca57ec0f 552 return audit_uid_comparator(tsk->loginuid, f->op, cred->euid);
10d68360 553 case AUDIT_COMPARE_AUID_TO_SUID:
ca57ec0f 554 return audit_uid_comparator(tsk->loginuid, f->op, cred->suid);
10d68360 555 case AUDIT_COMPARE_AUID_TO_FSUID:
ca57ec0f 556 return audit_uid_comparator(tsk->loginuid, f->op, cred->fsuid);
10d68360
PM
557 /* euid comparisons */
558 case AUDIT_COMPARE_EUID_TO_SUID:
ca57ec0f 559 return audit_uid_comparator(cred->euid, f->op, cred->suid);
10d68360 560 case AUDIT_COMPARE_EUID_TO_FSUID:
ca57ec0f 561 return audit_uid_comparator(cred->euid, f->op, cred->fsuid);
10d68360
PM
562 /* suid comparisons */
563 case AUDIT_COMPARE_SUID_TO_FSUID:
ca57ec0f 564 return audit_uid_comparator(cred->suid, f->op, cred->fsuid);
10d68360
PM
565 /* gid comparisons */
566 case AUDIT_COMPARE_GID_TO_EGID:
ca57ec0f 567 return audit_gid_comparator(cred->gid, f->op, cred->egid);
10d68360 568 case AUDIT_COMPARE_GID_TO_SGID:
ca57ec0f 569 return audit_gid_comparator(cred->gid, f->op, cred->sgid);
10d68360 570 case AUDIT_COMPARE_GID_TO_FSGID:
ca57ec0f 571 return audit_gid_comparator(cred->gid, f->op, cred->fsgid);
10d68360
PM
572 /* egid comparisons */
573 case AUDIT_COMPARE_EGID_TO_SGID:
ca57ec0f 574 return audit_gid_comparator(cred->egid, f->op, cred->sgid);
10d68360 575 case AUDIT_COMPARE_EGID_TO_FSGID:
ca57ec0f 576 return audit_gid_comparator(cred->egid, f->op, cred->fsgid);
10d68360
PM
577 /* sgid comparison */
578 case AUDIT_COMPARE_SGID_TO_FSGID:
ca57ec0f 579 return audit_gid_comparator(cred->sgid, f->op, cred->fsgid);
02d86a56
EP
580 default:
581 WARN(1, "Missing AUDIT_COMPARE define. Report as a bug\n");
582 return 0;
583 }
584 return 0;
585}
586
f368c07d 587/* Determine if any context name data matches a rule's watch data */
1da177e4 588/* Compare a task_struct with an audit_rule. Return 1 on match, 0
f5629883
TJ
589 * otherwise.
590 *
591 * If task_creation is true, this is an explicit indication that we are
592 * filtering a task rule at task creation time. This and tsk == current are
593 * the only situations where tsk->cred may be accessed without an rcu read lock.
594 */
1da177e4 595static int audit_filter_rules(struct task_struct *tsk,
93315ed6 596 struct audit_krule *rule,
1da177e4 597 struct audit_context *ctx,
f368c07d 598 struct audit_names *name,
f5629883
TJ
599 enum audit_state *state,
600 bool task_creation)
1da177e4 601{
f5629883 602 const struct cred *cred;
5195d8e2 603 int i, need_sid = 1;
3dc7e315
DG
604 u32 sid;
605
f5629883
TJ
606 cred = rcu_dereference_check(tsk->cred, tsk == current || task_creation);
607
1da177e4 608 for (i = 0; i < rule->field_count; i++) {
93315ed6 609 struct audit_field *f = &rule->fields[i];
5195d8e2 610 struct audit_names *n;
1da177e4
LT
611 int result = 0;
612
93315ed6 613 switch (f->type) {
1da177e4 614 case AUDIT_PID:
93315ed6 615 result = audit_comparator(tsk->pid, f->op, f->val);
1da177e4 616 break;
3c66251e 617 case AUDIT_PPID:
419c58f1
AV
618 if (ctx) {
619 if (!ctx->ppid)
620 ctx->ppid = sys_getppid();
3c66251e 621 result = audit_comparator(ctx->ppid, f->op, f->val);
419c58f1 622 }
3c66251e 623 break;
1da177e4 624 case AUDIT_UID:
ca57ec0f 625 result = audit_uid_comparator(cred->uid, f->op, f->uid);
1da177e4
LT
626 break;
627 case AUDIT_EUID:
ca57ec0f 628 result = audit_uid_comparator(cred->euid, f->op, f->uid);
1da177e4
LT
629 break;
630 case AUDIT_SUID:
ca57ec0f 631 result = audit_uid_comparator(cred->suid, f->op, f->uid);
1da177e4
LT
632 break;
633 case AUDIT_FSUID:
ca57ec0f 634 result = audit_uid_comparator(cred->fsuid, f->op, f->uid);
1da177e4
LT
635 break;
636 case AUDIT_GID:
ca57ec0f 637 result = audit_gid_comparator(cred->gid, f->op, f->gid);
1da177e4
LT
638 break;
639 case AUDIT_EGID:
ca57ec0f 640 result = audit_gid_comparator(cred->egid, f->op, f->gid);
1da177e4
LT
641 break;
642 case AUDIT_SGID:
ca57ec0f 643 result = audit_gid_comparator(cred->sgid, f->op, f->gid);
1da177e4
LT
644 break;
645 case AUDIT_FSGID:
ca57ec0f 646 result = audit_gid_comparator(cred->fsgid, f->op, f->gid);
1da177e4
LT
647 break;
648 case AUDIT_PERS:
93315ed6 649 result = audit_comparator(tsk->personality, f->op, f->val);
1da177e4 650 break;
2fd6f58b 651 case AUDIT_ARCH:
9f8dbe9c 652 if (ctx)
93315ed6 653 result = audit_comparator(ctx->arch, f->op, f->val);
2fd6f58b 654 break;
1da177e4
LT
655
656 case AUDIT_EXIT:
657 if (ctx && ctx->return_valid)
93315ed6 658 result = audit_comparator(ctx->return_code, f->op, f->val);
1da177e4
LT
659 break;
660 case AUDIT_SUCCESS:
b01f2cc1 661 if (ctx && ctx->return_valid) {
93315ed6
AG
662 if (f->val)
663 result = audit_comparator(ctx->return_valid, f->op, AUDITSC_SUCCESS);
b01f2cc1 664 else
93315ed6 665 result = audit_comparator(ctx->return_valid, f->op, AUDITSC_FAILURE);
b01f2cc1 666 }
1da177e4
LT
667 break;
668 case AUDIT_DEVMAJOR:
16c174bd
EP
669 if (name) {
670 if (audit_comparator(MAJOR(name->dev), f->op, f->val) ||
671 audit_comparator(MAJOR(name->rdev), f->op, f->val))
672 ++result;
673 } else if (ctx) {
5195d8e2 674 list_for_each_entry(n, &ctx->names_list, list) {
16c174bd
EP
675 if (audit_comparator(MAJOR(n->dev), f->op, f->val) ||
676 audit_comparator(MAJOR(n->rdev), f->op, f->val)) {
1da177e4
LT
677 ++result;
678 break;
679 }
680 }
681 }
682 break;
683 case AUDIT_DEVMINOR:
16c174bd
EP
684 if (name) {
685 if (audit_comparator(MINOR(name->dev), f->op, f->val) ||
686 audit_comparator(MINOR(name->rdev), f->op, f->val))
687 ++result;
688 } else if (ctx) {
5195d8e2 689 list_for_each_entry(n, &ctx->names_list, list) {
16c174bd
EP
690 if (audit_comparator(MINOR(n->dev), f->op, f->val) ||
691 audit_comparator(MINOR(n->rdev), f->op, f->val)) {
1da177e4
LT
692 ++result;
693 break;
694 }
695 }
696 }
697 break;
698 case AUDIT_INODE:
f368c07d 699 if (name)
9c937dcc 700 result = (name->ino == f->val);
f368c07d 701 else if (ctx) {
5195d8e2
EP
702 list_for_each_entry(n, &ctx->names_list, list) {
703 if (audit_comparator(n->ino, f->op, f->val)) {
1da177e4
LT
704 ++result;
705 break;
706 }
707 }
708 }
709 break;
efaffd6e
EP
710 case AUDIT_OBJ_UID:
711 if (name) {
ca57ec0f 712 result = audit_uid_comparator(name->uid, f->op, f->uid);
efaffd6e
EP
713 } else if (ctx) {
714 list_for_each_entry(n, &ctx->names_list, list) {
ca57ec0f 715 if (audit_uid_comparator(n->uid, f->op, f->uid)) {
efaffd6e
EP
716 ++result;
717 break;
718 }
719 }
720 }
721 break;
54d3218b
EP
722 case AUDIT_OBJ_GID:
723 if (name) {
ca57ec0f 724 result = audit_gid_comparator(name->gid, f->op, f->gid);
54d3218b
EP
725 } else if (ctx) {
726 list_for_each_entry(n, &ctx->names_list, list) {
ca57ec0f 727 if (audit_gid_comparator(n->gid, f->op, f->gid)) {
54d3218b
EP
728 ++result;
729 break;
730 }
731 }
732 }
733 break;
f368c07d 734 case AUDIT_WATCH:
ae7b8f41
EP
735 if (name)
736 result = audit_watch_compare(rule->watch, name->ino, name->dev);
f368c07d 737 break;
74c3cbe3
AV
738 case AUDIT_DIR:
739 if (ctx)
740 result = match_tree_refs(ctx, rule->tree);
741 break;
1da177e4
LT
742 case AUDIT_LOGINUID:
743 result = 0;
744 if (ctx)
ca57ec0f 745 result = audit_uid_comparator(tsk->loginuid, f->op, f->uid);
1da177e4 746 break;
3a6b9f85
DG
747 case AUDIT_SUBJ_USER:
748 case AUDIT_SUBJ_ROLE:
749 case AUDIT_SUBJ_TYPE:
750 case AUDIT_SUBJ_SEN:
751 case AUDIT_SUBJ_CLR:
3dc7e315
DG
752 /* NOTE: this may return negative values indicating
753 a temporary error. We simply treat this as a
754 match for now to avoid losing information that
755 may be wanted. An error message will also be
756 logged upon error */
04305e4a 757 if (f->lsm_rule) {
2ad312d2 758 if (need_sid) {
2a862b32 759 security_task_getsecid(tsk, &sid);
2ad312d2
SG
760 need_sid = 0;
761 }
d7a96f3a 762 result = security_audit_rule_match(sid, f->type,
3dc7e315 763 f->op,
04305e4a 764 f->lsm_rule,
3dc7e315 765 ctx);
2ad312d2 766 }
3dc7e315 767 break;
6e5a2d1d
DG
768 case AUDIT_OBJ_USER:
769 case AUDIT_OBJ_ROLE:
770 case AUDIT_OBJ_TYPE:
771 case AUDIT_OBJ_LEV_LOW:
772 case AUDIT_OBJ_LEV_HIGH:
773 /* The above note for AUDIT_SUBJ_USER...AUDIT_SUBJ_CLR
774 also applies here */
04305e4a 775 if (f->lsm_rule) {
6e5a2d1d
DG
776 /* Find files that match */
777 if (name) {
d7a96f3a 778 result = security_audit_rule_match(
6e5a2d1d 779 name->osid, f->type, f->op,
04305e4a 780 f->lsm_rule, ctx);
6e5a2d1d 781 } else if (ctx) {
5195d8e2
EP
782 list_for_each_entry(n, &ctx->names_list, list) {
783 if (security_audit_rule_match(n->osid, f->type,
784 f->op, f->lsm_rule,
785 ctx)) {
6e5a2d1d
DG
786 ++result;
787 break;
788 }
789 }
790 }
791 /* Find ipc objects that match */
a33e6751
AV
792 if (!ctx || ctx->type != AUDIT_IPC)
793 break;
794 if (security_audit_rule_match(ctx->ipc.osid,
795 f->type, f->op,
796 f->lsm_rule, ctx))
797 ++result;
6e5a2d1d
DG
798 }
799 break;
1da177e4
LT
800 case AUDIT_ARG0:
801 case AUDIT_ARG1:
802 case AUDIT_ARG2:
803 case AUDIT_ARG3:
804 if (ctx)
93315ed6 805 result = audit_comparator(ctx->argv[f->type-AUDIT_ARG0], f->op, f->val);
1da177e4 806 break;
5adc8a6a
AG
807 case AUDIT_FILTERKEY:
808 /* ignore this field for filtering */
809 result = 1;
810 break;
55669bfa
AV
811 case AUDIT_PERM:
812 result = audit_match_perm(ctx, f->val);
813 break;
8b67dca9
AV
814 case AUDIT_FILETYPE:
815 result = audit_match_filetype(ctx, f->val);
816 break;
02d86a56
EP
817 case AUDIT_FIELD_COMPARE:
818 result = audit_field_compare(tsk, cred, f, ctx, name);
819 break;
1da177e4 820 }
f5629883 821 if (!result)
1da177e4
LT
822 return 0;
823 }
0590b933
AV
824
825 if (ctx) {
826 if (rule->prio <= ctx->prio)
827 return 0;
828 if (rule->filterkey) {
829 kfree(ctx->filterkey);
830 ctx->filterkey = kstrdup(rule->filterkey, GFP_ATOMIC);
831 }
832 ctx->prio = rule->prio;
833 }
1da177e4
LT
834 switch (rule->action) {
835 case AUDIT_NEVER: *state = AUDIT_DISABLED; break;
1da177e4
LT
836 case AUDIT_ALWAYS: *state = AUDIT_RECORD_CONTEXT; break;
837 }
838 return 1;
839}
840
841/* At process creation time, we can determine if system-call auditing is
842 * completely disabled for this task. Since we only have the task
843 * structure at this point, we can only check uid and gid.
844 */
e048e02c 845static enum audit_state audit_filter_task(struct task_struct *tsk, char **key)
1da177e4
LT
846{
847 struct audit_entry *e;
848 enum audit_state state;
849
850 rcu_read_lock();
0f45aa18 851 list_for_each_entry_rcu(e, &audit_filter_list[AUDIT_FILTER_TASK], list) {
f5629883
TJ
852 if (audit_filter_rules(tsk, &e->rule, NULL, NULL,
853 &state, true)) {
e048e02c
AV
854 if (state == AUDIT_RECORD_CONTEXT)
855 *key = kstrdup(e->rule.filterkey, GFP_ATOMIC);
1da177e4
LT
856 rcu_read_unlock();
857 return state;
858 }
859 }
860 rcu_read_unlock();
861 return AUDIT_BUILD_CONTEXT;
862}
863
864/* At syscall entry and exit time, this filter is called if the
865 * audit_state is not low enough that auditing cannot take place, but is
23f32d18 866 * also not high enough that we already know we have to write an audit
b0dd25a8 867 * record (i.e., the state is AUDIT_SETUP_CONTEXT or AUDIT_BUILD_CONTEXT).
1da177e4
LT
868 */
869static enum audit_state audit_filter_syscall(struct task_struct *tsk,
870 struct audit_context *ctx,
871 struct list_head *list)
872{
873 struct audit_entry *e;
c3896495 874 enum audit_state state;
1da177e4 875
351bb722 876 if (audit_pid && tsk->tgid == audit_pid)
f7056d64
DW
877 return AUDIT_DISABLED;
878
1da177e4 879 rcu_read_lock();
c3896495 880 if (!list_empty(list)) {
b63862f4
DK
881 int word = AUDIT_WORD(ctx->major);
882 int bit = AUDIT_BIT(ctx->major);
883
884 list_for_each_entry_rcu(e, list, list) {
f368c07d
AG
885 if ((e->rule.mask[word] & bit) == bit &&
886 audit_filter_rules(tsk, &e->rule, ctx, NULL,
f5629883 887 &state, false)) {
f368c07d 888 rcu_read_unlock();
0590b933 889 ctx->current_state = state;
f368c07d
AG
890 return state;
891 }
892 }
893 }
894 rcu_read_unlock();
895 return AUDIT_BUILD_CONTEXT;
896}
897
5195d8e2
EP
898/*
899 * Given an audit_name check the inode hash table to see if they match.
900 * Called holding the rcu read lock to protect the use of audit_inode_hash
901 */
902static int audit_filter_inode_name(struct task_struct *tsk,
903 struct audit_names *n,
904 struct audit_context *ctx) {
905 int word, bit;
906 int h = audit_hash_ino((u32)n->ino);
907 struct list_head *list = &audit_inode_hash[h];
908 struct audit_entry *e;
909 enum audit_state state;
910
911 word = AUDIT_WORD(ctx->major);
912 bit = AUDIT_BIT(ctx->major);
913
914 if (list_empty(list))
915 return 0;
916
917 list_for_each_entry_rcu(e, list, list) {
918 if ((e->rule.mask[word] & bit) == bit &&
919 audit_filter_rules(tsk, &e->rule, ctx, n, &state, false)) {
920 ctx->current_state = state;
921 return 1;
922 }
923 }
924
925 return 0;
926}
927
928/* At syscall exit time, this filter is called if any audit_names have been
f368c07d 929 * collected during syscall processing. We only check rules in sublists at hash
5195d8e2 930 * buckets applicable to the inode numbers in audit_names.
f368c07d
AG
931 * Regarding audit_state, same rules apply as for audit_filter_syscall().
932 */
0590b933 933void audit_filter_inodes(struct task_struct *tsk, struct audit_context *ctx)
f368c07d 934{
5195d8e2 935 struct audit_names *n;
f368c07d
AG
936
937 if (audit_pid && tsk->tgid == audit_pid)
0590b933 938 return;
f368c07d
AG
939
940 rcu_read_lock();
f368c07d 941
5195d8e2
EP
942 list_for_each_entry(n, &ctx->names_list, list) {
943 if (audit_filter_inode_name(tsk, n, ctx))
944 break;
0f45aa18
DW
945 }
946 rcu_read_unlock();
0f45aa18
DW
947}
948
1da177e4
LT
949static inline struct audit_context *audit_get_context(struct task_struct *tsk,
950 int return_valid,
6d208da8 951 long return_code)
1da177e4
LT
952{
953 struct audit_context *context = tsk->audit_context;
954
56179a6e 955 if (!context)
1da177e4
LT
956 return NULL;
957 context->return_valid = return_valid;
f701b75e
EP
958
959 /*
960 * we need to fix up the return code in the audit logs if the actual
961 * return codes are later going to be fixed up by the arch specific
962 * signal handlers
963 *
964 * This is actually a test for:
965 * (rc == ERESTARTSYS ) || (rc == ERESTARTNOINTR) ||
966 * (rc == ERESTARTNOHAND) || (rc == ERESTART_RESTARTBLOCK)
967 *
968 * but is faster than a bunch of ||
969 */
970 if (unlikely(return_code <= -ERESTARTSYS) &&
971 (return_code >= -ERESTART_RESTARTBLOCK) &&
972 (return_code != -ENOIOCTLCMD))
973 context->return_code = -EINTR;
974 else
975 context->return_code = return_code;
1da177e4 976
0590b933
AV
977 if (context->in_syscall && !context->dummy) {
978 audit_filter_syscall(tsk, context, &audit_filter_list[AUDIT_FILTER_EXIT]);
979 audit_filter_inodes(tsk, context);
1da177e4
LT
980 }
981
1da177e4
LT
982 tsk->audit_context = NULL;
983 return context;
984}
985
986static inline void audit_free_names(struct audit_context *context)
987{
5195d8e2 988 struct audit_names *n, *next;
1da177e4
LT
989
990#if AUDIT_DEBUG == 2
0590b933 991 if (context->put_count + context->ino_count != context->name_count) {
73241ccc 992 printk(KERN_ERR "%s:%d(:%d): major=%d in_syscall=%d"
1da177e4
LT
993 " name_count=%d put_count=%d"
994 " ino_count=%d [NOT freeing]\n",
73241ccc 995 __FILE__, __LINE__,
1da177e4
LT
996 context->serial, context->major, context->in_syscall,
997 context->name_count, context->put_count,
998 context->ino_count);
5195d8e2 999 list_for_each_entry(n, &context->names_list, list) {
1da177e4 1000 printk(KERN_ERR "names[%d] = %p = %s\n", i,
5195d8e2 1001 n->name, n->name ?: "(null)");
8c8570fb 1002 }
1da177e4
LT
1003 dump_stack();
1004 return;
1005 }
1006#endif
1007#if AUDIT_DEBUG
1008 context->put_count = 0;
1009 context->ino_count = 0;
1010#endif
1011
5195d8e2
EP
1012 list_for_each_entry_safe(n, next, &context->names_list, list) {
1013 list_del(&n->list);
1014 if (n->name && n->name_put)
1015 __putname(n->name);
1016 if (n->should_free)
1017 kfree(n);
8c8570fb 1018 }
1da177e4 1019 context->name_count = 0;
44707fdf
JB
1020 path_put(&context->pwd);
1021 context->pwd.dentry = NULL;
1022 context->pwd.mnt = NULL;
1da177e4
LT
1023}
1024
1025static inline void audit_free_aux(struct audit_context *context)
1026{
1027 struct audit_aux_data *aux;
1028
1029 while ((aux = context->aux)) {
1030 context->aux = aux->next;
1031 kfree(aux);
1032 }
e54dc243
AG
1033 while ((aux = context->aux_pids)) {
1034 context->aux_pids = aux->next;
1035 kfree(aux);
1036 }
1da177e4
LT
1037}
1038
1039static inline void audit_zero_context(struct audit_context *context,
1040 enum audit_state state)
1041{
1da177e4
LT
1042 memset(context, 0, sizeof(*context));
1043 context->state = state;
0590b933 1044 context->prio = state == AUDIT_RECORD_CONTEXT ? ~0ULL : 0;
1da177e4
LT
1045}
1046
1047static inline struct audit_context *audit_alloc_context(enum audit_state state)
1048{
1049 struct audit_context *context;
1050
1051 if (!(context = kmalloc(sizeof(*context), GFP_KERNEL)))
1052 return NULL;
1053 audit_zero_context(context, state);
916d7576 1054 INIT_LIST_HEAD(&context->killed_trees);
5195d8e2 1055 INIT_LIST_HEAD(&context->names_list);
1da177e4
LT
1056 return context;
1057}
1058
b0dd25a8
RD
1059/**
1060 * audit_alloc - allocate an audit context block for a task
1061 * @tsk: task
1062 *
1063 * Filter on the task information and allocate a per-task audit context
1da177e4
LT
1064 * if necessary. Doing so turns on system call auditing for the
1065 * specified task. This is called from copy_process, so no lock is
b0dd25a8
RD
1066 * needed.
1067 */
1da177e4
LT
1068int audit_alloc(struct task_struct *tsk)
1069{
1070 struct audit_context *context;
1071 enum audit_state state;
e048e02c 1072 char *key = NULL;
1da177e4 1073
b593d384 1074 if (likely(!audit_ever_enabled))
1da177e4
LT
1075 return 0; /* Return if not auditing. */
1076
e048e02c 1077 state = audit_filter_task(tsk, &key);
56179a6e 1078 if (state == AUDIT_DISABLED)
1da177e4
LT
1079 return 0;
1080
1081 if (!(context = audit_alloc_context(state))) {
e048e02c 1082 kfree(key);
1da177e4
LT
1083 audit_log_lost("out of memory in audit_alloc");
1084 return -ENOMEM;
1085 }
e048e02c 1086 context->filterkey = key;
1da177e4 1087
1da177e4
LT
1088 tsk->audit_context = context;
1089 set_tsk_thread_flag(tsk, TIF_SYSCALL_AUDIT);
1090 return 0;
1091}
1092
1093static inline void audit_free_context(struct audit_context *context)
1094{
1095 struct audit_context *previous;
1096 int count = 0;
1097
1098 do {
1099 previous = context->previous;
1100 if (previous || (count && count < 10)) {
1101 ++count;
1102 printk(KERN_ERR "audit(:%d): major=%d name_count=%d:"
1103 " freeing multiple contexts (%d)\n",
1104 context->serial, context->major,
1105 context->name_count, count);
1106 }
1107 audit_free_names(context);
74c3cbe3
AV
1108 unroll_tree_refs(context, NULL, 0);
1109 free_tree_refs(context);
1da177e4 1110 audit_free_aux(context);
5adc8a6a 1111 kfree(context->filterkey);
4f6b434f 1112 kfree(context->sockaddr);
1da177e4
LT
1113 kfree(context);
1114 context = previous;
1115 } while (context);
1116 if (count >= 10)
1117 printk(KERN_ERR "audit: freed %d contexts\n", count);
1118}
1119
161a09e7 1120void audit_log_task_context(struct audit_buffer *ab)
8c8570fb
DK
1121{
1122 char *ctx = NULL;
c4823bce
AV
1123 unsigned len;
1124 int error;
1125 u32 sid;
1126
2a862b32 1127 security_task_getsecid(current, &sid);
c4823bce
AV
1128 if (!sid)
1129 return;
8c8570fb 1130
2a862b32 1131 error = security_secid_to_secctx(sid, &ctx, &len);
c4823bce
AV
1132 if (error) {
1133 if (error != -EINVAL)
8c8570fb
DK
1134 goto error_path;
1135 return;
1136 }
1137
8c8570fb 1138 audit_log_format(ab, " subj=%s", ctx);
2a862b32 1139 security_release_secctx(ctx, len);
7306a0b9 1140 return;
8c8570fb
DK
1141
1142error_path:
7306a0b9 1143 audit_panic("error in audit_log_task_context");
8c8570fb
DK
1144 return;
1145}
1146
161a09e7
JL
1147EXPORT_SYMBOL(audit_log_task_context);
1148
e495149b 1149static void audit_log_task_info(struct audit_buffer *ab, struct task_struct *tsk)
219f0817 1150{
45d9bb0e
AV
1151 char name[sizeof(tsk->comm)];
1152 struct mm_struct *mm = tsk->mm;
219f0817
SS
1153 struct vm_area_struct *vma;
1154
e495149b
AV
1155 /* tsk == current */
1156
45d9bb0e 1157 get_task_comm(name, tsk);
99e45eea
DW
1158 audit_log_format(ab, " comm=");
1159 audit_log_untrustedstring(ab, name);
219f0817 1160
e495149b
AV
1161 if (mm) {
1162 down_read(&mm->mmap_sem);
1163 vma = mm->mmap;
1164 while (vma) {
1165 if ((vma->vm_flags & VM_EXECUTABLE) &&
1166 vma->vm_file) {
c158a35c 1167 audit_log_d_path(ab, " exe=",
44707fdf 1168 &vma->vm_file->f_path);
e495149b
AV
1169 break;
1170 }
1171 vma = vma->vm_next;
219f0817 1172 }
e495149b 1173 up_read(&mm->mmap_sem);
219f0817 1174 }
e495149b 1175 audit_log_task_context(ab);
219f0817
SS
1176}
1177
e54dc243 1178static int audit_log_pid_context(struct audit_context *context, pid_t pid,
cca080d9 1179 kuid_t auid, kuid_t uid, unsigned int sessionid,
4746ec5b 1180 u32 sid, char *comm)
e54dc243
AG
1181{
1182 struct audit_buffer *ab;
2a862b32 1183 char *ctx = NULL;
e54dc243
AG
1184 u32 len;
1185 int rc = 0;
1186
1187 ab = audit_log_start(context, GFP_KERNEL, AUDIT_OBJ_PID);
1188 if (!ab)
6246ccab 1189 return rc;
e54dc243 1190
e1760bd5
EB
1191 audit_log_format(ab, "opid=%d oauid=%d ouid=%d oses=%d", pid,
1192 from_kuid(&init_user_ns, auid),
cca080d9 1193 from_kuid(&init_user_ns, uid), sessionid);
2a862b32 1194 if (security_secid_to_secctx(sid, &ctx, &len)) {
c2a7780e 1195 audit_log_format(ab, " obj=(none)");
e54dc243 1196 rc = 1;
2a862b32
AD
1197 } else {
1198 audit_log_format(ab, " obj=%s", ctx);
1199 security_release_secctx(ctx, len);
1200 }
c2a7780e
EP
1201 audit_log_format(ab, " ocomm=");
1202 audit_log_untrustedstring(ab, comm);
e54dc243 1203 audit_log_end(ab);
e54dc243
AG
1204
1205 return rc;
1206}
1207
de6bbd1d
EP
1208/*
1209 * to_send and len_sent accounting are very loose estimates. We aren't
1210 * really worried about a hard cap to MAX_EXECVE_AUDIT_LEN so much as being
25985edc 1211 * within about 500 bytes (next page boundary)
de6bbd1d
EP
1212 *
1213 * why snprintf? an int is up to 12 digits long. if we just assumed when
1214 * logging that a[%d]= was going to be 16 characters long we would be wasting
1215 * space in every audit message. In one 7500 byte message we can log up to
1216 * about 1000 min size arguments. That comes down to about 50% waste of space
1217 * if we didn't do the snprintf to find out how long arg_num_len was.
1218 */
1219static int audit_log_single_execve_arg(struct audit_context *context,
1220 struct audit_buffer **ab,
1221 int arg_num,
1222 size_t *len_sent,
1223 const char __user *p,
1224 char *buf)
bdf4c48a 1225{
de6bbd1d
EP
1226 char arg_num_len_buf[12];
1227 const char __user *tmp_p = p;
b87ce6e4
EP
1228 /* how many digits are in arg_num? 5 is the length of ' a=""' */
1229 size_t arg_num_len = snprintf(arg_num_len_buf, 12, "%d", arg_num) + 5;
de6bbd1d
EP
1230 size_t len, len_left, to_send;
1231 size_t max_execve_audit_len = MAX_EXECVE_AUDIT_LEN;
1232 unsigned int i, has_cntl = 0, too_long = 0;
1233 int ret;
1234
1235 /* strnlen_user includes the null we don't want to send */
1236 len_left = len = strnlen_user(p, MAX_ARG_STRLEN) - 1;
bdf4c48a 1237
de6bbd1d
EP
1238 /*
1239 * We just created this mm, if we can't find the strings
1240 * we just copied into it something is _very_ wrong. Similar
1241 * for strings that are too long, we should not have created
1242 * any.
1243 */
b0abcfc1 1244 if (unlikely((len == -1) || len > MAX_ARG_STRLEN - 1)) {
de6bbd1d
EP
1245 WARN_ON(1);
1246 send_sig(SIGKILL, current, 0);
b0abcfc1 1247 return -1;
de6bbd1d 1248 }
040b3a2d 1249
de6bbd1d
EP
1250 /* walk the whole argument looking for non-ascii chars */
1251 do {
1252 if (len_left > MAX_EXECVE_AUDIT_LEN)
1253 to_send = MAX_EXECVE_AUDIT_LEN;
1254 else
1255 to_send = len_left;
1256 ret = copy_from_user(buf, tmp_p, to_send);
bdf4c48a 1257 /*
de6bbd1d
EP
1258 * There is no reason for this copy to be short. We just
1259 * copied them here, and the mm hasn't been exposed to user-
1260 * space yet.
bdf4c48a 1261 */
de6bbd1d 1262 if (ret) {
bdf4c48a
PZ
1263 WARN_ON(1);
1264 send_sig(SIGKILL, current, 0);
b0abcfc1 1265 return -1;
bdf4c48a 1266 }
de6bbd1d
EP
1267 buf[to_send] = '\0';
1268 has_cntl = audit_string_contains_control(buf, to_send);
1269 if (has_cntl) {
1270 /*
1271 * hex messages get logged as 2 bytes, so we can only
1272 * send half as much in each message
1273 */
1274 max_execve_audit_len = MAX_EXECVE_AUDIT_LEN / 2;
bdf4c48a
PZ
1275 break;
1276 }
de6bbd1d
EP
1277 len_left -= to_send;
1278 tmp_p += to_send;
1279 } while (len_left > 0);
1280
1281 len_left = len;
1282
1283 if (len > max_execve_audit_len)
1284 too_long = 1;
1285
1286 /* rewalk the argument actually logging the message */
1287 for (i = 0; len_left > 0; i++) {
1288 int room_left;
1289
1290 if (len_left > max_execve_audit_len)
1291 to_send = max_execve_audit_len;
1292 else
1293 to_send = len_left;
1294
1295 /* do we have space left to send this argument in this ab? */
1296 room_left = MAX_EXECVE_AUDIT_LEN - arg_num_len - *len_sent;
1297 if (has_cntl)
1298 room_left -= (to_send * 2);
1299 else
1300 room_left -= to_send;
1301 if (room_left < 0) {
1302 *len_sent = 0;
1303 audit_log_end(*ab);
1304 *ab = audit_log_start(context, GFP_KERNEL, AUDIT_EXECVE);
1305 if (!*ab)
1306 return 0;
1307 }
bdf4c48a 1308
bdf4c48a 1309 /*
de6bbd1d
EP
1310 * first record needs to say how long the original string was
1311 * so we can be sure nothing was lost.
1312 */
1313 if ((i == 0) && (too_long))
ca96a895 1314 audit_log_format(*ab, " a%d_len=%zu", arg_num,
de6bbd1d
EP
1315 has_cntl ? 2*len : len);
1316
1317 /*
1318 * normally arguments are small enough to fit and we already
1319 * filled buf above when we checked for control characters
1320 * so don't bother with another copy_from_user
bdf4c48a 1321 */
de6bbd1d
EP
1322 if (len >= max_execve_audit_len)
1323 ret = copy_from_user(buf, p, to_send);
1324 else
1325 ret = 0;
040b3a2d 1326 if (ret) {
bdf4c48a
PZ
1327 WARN_ON(1);
1328 send_sig(SIGKILL, current, 0);
b0abcfc1 1329 return -1;
bdf4c48a 1330 }
de6bbd1d
EP
1331 buf[to_send] = '\0';
1332
1333 /* actually log it */
ca96a895 1334 audit_log_format(*ab, " a%d", arg_num);
de6bbd1d
EP
1335 if (too_long)
1336 audit_log_format(*ab, "[%d]", i);
1337 audit_log_format(*ab, "=");
1338 if (has_cntl)
b556f8ad 1339 audit_log_n_hex(*ab, buf, to_send);
de6bbd1d 1340 else
9d960985 1341 audit_log_string(*ab, buf);
de6bbd1d
EP
1342
1343 p += to_send;
1344 len_left -= to_send;
1345 *len_sent += arg_num_len;
1346 if (has_cntl)
1347 *len_sent += to_send * 2;
1348 else
1349 *len_sent += to_send;
1350 }
1351 /* include the null we didn't log */
1352 return len + 1;
1353}
1354
1355static void audit_log_execve_info(struct audit_context *context,
1356 struct audit_buffer **ab,
1357 struct audit_aux_data_execve *axi)
1358{
5afb8a3f
XW
1359 int i, len;
1360 size_t len_sent = 0;
de6bbd1d
EP
1361 const char __user *p;
1362 char *buf;
bdf4c48a 1363
de6bbd1d
EP
1364 if (axi->mm != current->mm)
1365 return; /* execve failed, no additional info */
1366
1367 p = (const char __user *)axi->mm->arg_start;
bdf4c48a 1368
ca96a895 1369 audit_log_format(*ab, "argc=%d", axi->argc);
de6bbd1d
EP
1370
1371 /*
1372 * we need some kernel buffer to hold the userspace args. Just
1373 * allocate one big one rather than allocating one of the right size
1374 * for every single argument inside audit_log_single_execve_arg()
1375 * should be <8k allocation so should be pretty safe.
1376 */
1377 buf = kmalloc(MAX_EXECVE_AUDIT_LEN + 1, GFP_KERNEL);
1378 if (!buf) {
1379 audit_panic("out of memory for argv string\n");
1380 return;
bdf4c48a 1381 }
de6bbd1d
EP
1382
1383 for (i = 0; i < axi->argc; i++) {
1384 len = audit_log_single_execve_arg(context, ab, i,
1385 &len_sent, p, buf);
1386 if (len <= 0)
1387 break;
1388 p += len;
1389 }
1390 kfree(buf);
bdf4c48a
PZ
1391}
1392
851f7ff5
EP
1393static void audit_log_cap(struct audit_buffer *ab, char *prefix, kernel_cap_t *cap)
1394{
1395 int i;
1396
1397 audit_log_format(ab, " %s=", prefix);
1398 CAP_FOR_EACH_U32(i) {
1399 audit_log_format(ab, "%08x", cap->cap[(_KERNEL_CAPABILITY_U32S-1) - i]);
1400 }
1401}
1402
1403static void audit_log_fcaps(struct audit_buffer *ab, struct audit_names *name)
1404{
1405 kernel_cap_t *perm = &name->fcap.permitted;
1406 kernel_cap_t *inh = &name->fcap.inheritable;
1407 int log = 0;
1408
1409 if (!cap_isclear(*perm)) {
1410 audit_log_cap(ab, "cap_fp", perm);
1411 log = 1;
1412 }
1413 if (!cap_isclear(*inh)) {
1414 audit_log_cap(ab, "cap_fi", inh);
1415 log = 1;
1416 }
1417
1418 if (log)
1419 audit_log_format(ab, " cap_fe=%d cap_fver=%x", name->fcap.fE, name->fcap_ver);
1420}
1421
a33e6751 1422static void show_special(struct audit_context *context, int *call_panic)
f3298dc4
AV
1423{
1424 struct audit_buffer *ab;
1425 int i;
1426
1427 ab = audit_log_start(context, GFP_KERNEL, context->type);
1428 if (!ab)
1429 return;
1430
1431 switch (context->type) {
1432 case AUDIT_SOCKETCALL: {
1433 int nargs = context->socketcall.nargs;
1434 audit_log_format(ab, "nargs=%d", nargs);
1435 for (i = 0; i < nargs; i++)
1436 audit_log_format(ab, " a%d=%lx", i,
1437 context->socketcall.args[i]);
1438 break; }
a33e6751
AV
1439 case AUDIT_IPC: {
1440 u32 osid = context->ipc.osid;
1441
2570ebbd 1442 audit_log_format(ab, "ouid=%u ogid=%u mode=%#ho",
cca080d9
EB
1443 from_kuid(&init_user_ns, context->ipc.uid),
1444 from_kgid(&init_user_ns, context->ipc.gid),
1445 context->ipc.mode);
a33e6751
AV
1446 if (osid) {
1447 char *ctx = NULL;
1448 u32 len;
1449 if (security_secid_to_secctx(osid, &ctx, &len)) {
1450 audit_log_format(ab, " osid=%u", osid);
1451 *call_panic = 1;
1452 } else {
1453 audit_log_format(ab, " obj=%s", ctx);
1454 security_release_secctx(ctx, len);
1455 }
1456 }
e816f370
AV
1457 if (context->ipc.has_perm) {
1458 audit_log_end(ab);
1459 ab = audit_log_start(context, GFP_KERNEL,
1460 AUDIT_IPC_SET_PERM);
1461 audit_log_format(ab,
2570ebbd 1462 "qbytes=%lx ouid=%u ogid=%u mode=%#ho",
e816f370
AV
1463 context->ipc.qbytes,
1464 context->ipc.perm_uid,
1465 context->ipc.perm_gid,
1466 context->ipc.perm_mode);
1467 if (!ab)
1468 return;
1469 }
a33e6751 1470 break; }
564f6993
AV
1471 case AUDIT_MQ_OPEN: {
1472 audit_log_format(ab,
df0a4283 1473 "oflag=0x%x mode=%#ho mq_flags=0x%lx mq_maxmsg=%ld "
564f6993
AV
1474 "mq_msgsize=%ld mq_curmsgs=%ld",
1475 context->mq_open.oflag, context->mq_open.mode,
1476 context->mq_open.attr.mq_flags,
1477 context->mq_open.attr.mq_maxmsg,
1478 context->mq_open.attr.mq_msgsize,
1479 context->mq_open.attr.mq_curmsgs);
1480 break; }
c32c8af4
AV
1481 case AUDIT_MQ_SENDRECV: {
1482 audit_log_format(ab,
1483 "mqdes=%d msg_len=%zd msg_prio=%u "
1484 "abs_timeout_sec=%ld abs_timeout_nsec=%ld",
1485 context->mq_sendrecv.mqdes,
1486 context->mq_sendrecv.msg_len,
1487 context->mq_sendrecv.msg_prio,
1488 context->mq_sendrecv.abs_timeout.tv_sec,
1489 context->mq_sendrecv.abs_timeout.tv_nsec);
1490 break; }
20114f71
AV
1491 case AUDIT_MQ_NOTIFY: {
1492 audit_log_format(ab, "mqdes=%d sigev_signo=%d",
1493 context->mq_notify.mqdes,
1494 context->mq_notify.sigev_signo);
1495 break; }
7392906e
AV
1496 case AUDIT_MQ_GETSETATTR: {
1497 struct mq_attr *attr = &context->mq_getsetattr.mqstat;
1498 audit_log_format(ab,
1499 "mqdes=%d mq_flags=0x%lx mq_maxmsg=%ld mq_msgsize=%ld "
1500 "mq_curmsgs=%ld ",
1501 context->mq_getsetattr.mqdes,
1502 attr->mq_flags, attr->mq_maxmsg,
1503 attr->mq_msgsize, attr->mq_curmsgs);
1504 break; }
57f71a0a
AV
1505 case AUDIT_CAPSET: {
1506 audit_log_format(ab, "pid=%d", context->capset.pid);
1507 audit_log_cap(ab, "cap_pi", &context->capset.cap.inheritable);
1508 audit_log_cap(ab, "cap_pp", &context->capset.cap.permitted);
1509 audit_log_cap(ab, "cap_pe", &context->capset.cap.effective);
1510 break; }
120a795d
AV
1511 case AUDIT_MMAP: {
1512 audit_log_format(ab, "fd=%d flags=0x%x", context->mmap.fd,
1513 context->mmap.flags);
1514 break; }
f3298dc4
AV
1515 }
1516 audit_log_end(ab);
1517}
1518
5195d8e2
EP
1519static void audit_log_name(struct audit_context *context, struct audit_names *n,
1520 int record_num, int *call_panic)
1521{
1522 struct audit_buffer *ab;
1523 ab = audit_log_start(context, GFP_KERNEL, AUDIT_PATH);
1524 if (!ab)
1525 return; /* audit_panic has been called */
1526
1527 audit_log_format(ab, "item=%d", record_num);
1528
1529 if (n->name) {
1530 switch (n->name_len) {
1531 case AUDIT_NAME_FULL:
1532 /* log the full path */
1533 audit_log_format(ab, " name=");
1534 audit_log_untrustedstring(ab, n->name);
1535 break;
1536 case 0:
1537 /* name was specified as a relative path and the
1538 * directory component is the cwd */
c158a35c 1539 audit_log_d_path(ab, " name=", &context->pwd);
5195d8e2
EP
1540 break;
1541 default:
1542 /* log the name's directory component */
1543 audit_log_format(ab, " name=");
1544 audit_log_n_untrustedstring(ab, n->name,
1545 n->name_len);
1546 }
1547 } else
1548 audit_log_format(ab, " name=(null)");
1549
1550 if (n->ino != (unsigned long)-1) {
1551 audit_log_format(ab, " inode=%lu"
1552 " dev=%02x:%02x mode=%#ho"
1553 " ouid=%u ogid=%u rdev=%02x:%02x",
1554 n->ino,
1555 MAJOR(n->dev),
1556 MINOR(n->dev),
1557 n->mode,
cca080d9
EB
1558 from_kuid(&init_user_ns, n->uid),
1559 from_kgid(&init_user_ns, n->gid),
5195d8e2
EP
1560 MAJOR(n->rdev),
1561 MINOR(n->rdev));
1562 }
1563 if (n->osid != 0) {
1564 char *ctx = NULL;
1565 u32 len;
1566 if (security_secid_to_secctx(
1567 n->osid, &ctx, &len)) {
1568 audit_log_format(ab, " osid=%u", n->osid);
1569 *call_panic = 2;
1570 } else {
1571 audit_log_format(ab, " obj=%s", ctx);
1572 security_release_secctx(ctx, len);
1573 }
1574 }
1575
1576 audit_log_fcaps(ab, n);
1577
1578 audit_log_end(ab);
1579}
1580
e495149b 1581static void audit_log_exit(struct audit_context *context, struct task_struct *tsk)
1da177e4 1582{
c69e8d9c 1583 const struct cred *cred;
9c7aa6aa 1584 int i, call_panic = 0;
1da177e4 1585 struct audit_buffer *ab;
7551ced3 1586 struct audit_aux_data *aux;
a6c043a8 1587 const char *tty;
5195d8e2 1588 struct audit_names *n;
1da177e4 1589
e495149b 1590 /* tsk == current */
3f2792ff 1591 context->pid = tsk->pid;
419c58f1
AV
1592 if (!context->ppid)
1593 context->ppid = sys_getppid();
c69e8d9c
DH
1594 cred = current_cred();
1595 context->uid = cred->uid;
1596 context->gid = cred->gid;
1597 context->euid = cred->euid;
1598 context->suid = cred->suid;
b6dff3ec 1599 context->fsuid = cred->fsuid;
c69e8d9c
DH
1600 context->egid = cred->egid;
1601 context->sgid = cred->sgid;
b6dff3ec 1602 context->fsgid = cred->fsgid;
3f2792ff 1603 context->personality = tsk->personality;
e495149b
AV
1604
1605 ab = audit_log_start(context, GFP_KERNEL, AUDIT_SYSCALL);
1da177e4
LT
1606 if (!ab)
1607 return; /* audit_panic has been called */
bccf6ae0
DW
1608 audit_log_format(ab, "arch=%x syscall=%d",
1609 context->arch, context->major);
1da177e4
LT
1610 if (context->personality != PER_LINUX)
1611 audit_log_format(ab, " per=%lx", context->personality);
1612 if (context->return_valid)
9f8dbe9c 1613 audit_log_format(ab, " success=%s exit=%ld",
2fd6f58b 1614 (context->return_valid==AUDITSC_SUCCESS)?"yes":"no",
1615 context->return_code);
eb84a20e 1616
dbda4c0b 1617 spin_lock_irq(&tsk->sighand->siglock);
45d9bb0e
AV
1618 if (tsk->signal && tsk->signal->tty && tsk->signal->tty->name)
1619 tty = tsk->signal->tty->name;
a6c043a8
SG
1620 else
1621 tty = "(none)";
dbda4c0b
AC
1622 spin_unlock_irq(&tsk->sighand->siglock);
1623
1da177e4
LT
1624 audit_log_format(ab,
1625 " a0=%lx a1=%lx a2=%lx a3=%lx items=%d"
f46038ff 1626 " ppid=%d pid=%d auid=%u uid=%u gid=%u"
326e9c8b 1627 " euid=%u suid=%u fsuid=%u"
4746ec5b 1628 " egid=%u sgid=%u fsgid=%u tty=%s ses=%u",
1da177e4
LT
1629 context->argv[0],
1630 context->argv[1],
1631 context->argv[2],
1632 context->argv[3],
1633 context->name_count,
f46038ff 1634 context->ppid,
1da177e4 1635 context->pid,
e1760bd5 1636 from_kuid(&init_user_ns, tsk->loginuid),
cca080d9
EB
1637 from_kuid(&init_user_ns, context->uid),
1638 from_kgid(&init_user_ns, context->gid),
1639 from_kuid(&init_user_ns, context->euid),
1640 from_kuid(&init_user_ns, context->suid),
1641 from_kuid(&init_user_ns, context->fsuid),
1642 from_kgid(&init_user_ns, context->egid),
1643 from_kgid(&init_user_ns, context->sgid),
1644 from_kgid(&init_user_ns, context->fsgid),
1645 tty,
4746ec5b 1646 tsk->sessionid);
eb84a20e 1647
eb84a20e 1648
e495149b 1649 audit_log_task_info(ab, tsk);
9d960985 1650 audit_log_key(ab, context->filterkey);
1da177e4 1651 audit_log_end(ab);
1da177e4 1652
7551ced3 1653 for (aux = context->aux; aux; aux = aux->next) {
c0404993 1654
e495149b 1655 ab = audit_log_start(context, GFP_KERNEL, aux->type);
1da177e4
LT
1656 if (!ab)
1657 continue; /* audit_panic has been called */
1658
1da177e4 1659 switch (aux->type) {
20ca73bc 1660
473ae30b
AV
1661 case AUDIT_EXECVE: {
1662 struct audit_aux_data_execve *axi = (void *)aux;
de6bbd1d 1663 audit_log_execve_info(context, &ab, axi);
473ae30b 1664 break; }
073115d6 1665
3fc689e9
EP
1666 case AUDIT_BPRM_FCAPS: {
1667 struct audit_aux_data_bprm_fcaps *axs = (void *)aux;
1668 audit_log_format(ab, "fver=%x", axs->fcap_ver);
1669 audit_log_cap(ab, "fp", &axs->fcap.permitted);
1670 audit_log_cap(ab, "fi", &axs->fcap.inheritable);
1671 audit_log_format(ab, " fe=%d", axs->fcap.fE);
1672 audit_log_cap(ab, "old_pp", &axs->old_pcap.permitted);
1673 audit_log_cap(ab, "old_pi", &axs->old_pcap.inheritable);
1674 audit_log_cap(ab, "old_pe", &axs->old_pcap.effective);
1675 audit_log_cap(ab, "new_pp", &axs->new_pcap.permitted);
1676 audit_log_cap(ab, "new_pi", &axs->new_pcap.inheritable);
1677 audit_log_cap(ab, "new_pe", &axs->new_pcap.effective);
1678 break; }
1679
1da177e4
LT
1680 }
1681 audit_log_end(ab);
1da177e4
LT
1682 }
1683
f3298dc4 1684 if (context->type)
a33e6751 1685 show_special(context, &call_panic);
f3298dc4 1686
157cf649
AV
1687 if (context->fds[0] >= 0) {
1688 ab = audit_log_start(context, GFP_KERNEL, AUDIT_FD_PAIR);
1689 if (ab) {
1690 audit_log_format(ab, "fd0=%d fd1=%d",
1691 context->fds[0], context->fds[1]);
1692 audit_log_end(ab);
1693 }
1694 }
1695
4f6b434f
AV
1696 if (context->sockaddr_len) {
1697 ab = audit_log_start(context, GFP_KERNEL, AUDIT_SOCKADDR);
1698 if (ab) {
1699 audit_log_format(ab, "saddr=");
1700 audit_log_n_hex(ab, (void *)context->sockaddr,
1701 context->sockaddr_len);
1702 audit_log_end(ab);
1703 }
1704 }
1705
e54dc243
AG
1706 for (aux = context->aux_pids; aux; aux = aux->next) {
1707 struct audit_aux_data_pids *axs = (void *)aux;
e54dc243
AG
1708
1709 for (i = 0; i < axs->pid_count; i++)
1710 if (audit_log_pid_context(context, axs->target_pid[i],
c2a7780e
EP
1711 axs->target_auid[i],
1712 axs->target_uid[i],
4746ec5b 1713 axs->target_sessionid[i],
c2a7780e
EP
1714 axs->target_sid[i],
1715 axs->target_comm[i]))
e54dc243 1716 call_panic = 1;
a5cb013d
AV
1717 }
1718
e54dc243
AG
1719 if (context->target_pid &&
1720 audit_log_pid_context(context, context->target_pid,
c2a7780e 1721 context->target_auid, context->target_uid,
4746ec5b 1722 context->target_sessionid,
c2a7780e 1723 context->target_sid, context->target_comm))
e54dc243
AG
1724 call_panic = 1;
1725
44707fdf 1726 if (context->pwd.dentry && context->pwd.mnt) {
e495149b 1727 ab = audit_log_start(context, GFP_KERNEL, AUDIT_CWD);
8f37d47c 1728 if (ab) {
c158a35c 1729 audit_log_d_path(ab, " cwd=", &context->pwd);
8f37d47c
DW
1730 audit_log_end(ab);
1731 }
1732 }
73241ccc 1733
5195d8e2
EP
1734 i = 0;
1735 list_for_each_entry(n, &context->names_list, list)
1736 audit_log_name(context, n, i++, &call_panic);
c0641f28
EP
1737
1738 /* Send end of event record to help user space know we are finished */
1739 ab = audit_log_start(context, GFP_KERNEL, AUDIT_EOE);
1740 if (ab)
1741 audit_log_end(ab);
9c7aa6aa
SG
1742 if (call_panic)
1743 audit_panic("error converting sid to string");
1da177e4
LT
1744}
1745
b0dd25a8
RD
1746/**
1747 * audit_free - free a per-task audit context
1748 * @tsk: task whose audit context block to free
1749 *
fa84cb93 1750 * Called from copy_process and do_exit
b0dd25a8 1751 */
a4ff8dba 1752void __audit_free(struct task_struct *tsk)
1da177e4
LT
1753{
1754 struct audit_context *context;
1755
1da177e4 1756 context = audit_get_context(tsk, 0, 0);
56179a6e 1757 if (!context)
1da177e4
LT
1758 return;
1759
1760 /* Check for system calls that do not go through the exit
9f8dbe9c
DW
1761 * function (e.g., exit_group), then free context block.
1762 * We use GFP_ATOMIC here because we might be doing this
f5561964 1763 * in the context of the idle thread */
e495149b 1764 /* that can happen only if we are called from do_exit() */
0590b933 1765 if (context->in_syscall && context->current_state == AUDIT_RECORD_CONTEXT)
e495149b 1766 audit_log_exit(context, tsk);
916d7576
AV
1767 if (!list_empty(&context->killed_trees))
1768 audit_kill_trees(&context->killed_trees);
1da177e4
LT
1769
1770 audit_free_context(context);
1771}
1772
b0dd25a8
RD
1773/**
1774 * audit_syscall_entry - fill in an audit record at syscall entry
b0dd25a8
RD
1775 * @arch: architecture type
1776 * @major: major syscall type (function)
1777 * @a1: additional syscall register 1
1778 * @a2: additional syscall register 2
1779 * @a3: additional syscall register 3
1780 * @a4: additional syscall register 4
1781 *
1782 * Fill in audit context at syscall entry. This only happens if the
1da177e4
LT
1783 * audit context was created when the task was created and the state or
1784 * filters demand the audit context be built. If the state from the
1785 * per-task filter or from the per-syscall filter is AUDIT_RECORD_CONTEXT,
1786 * then the record will be written at syscall exit time (otherwise, it
1787 * will only be written if another part of the kernel requests that it
b0dd25a8
RD
1788 * be written).
1789 */
b05d8447 1790void __audit_syscall_entry(int arch, int major,
1da177e4
LT
1791 unsigned long a1, unsigned long a2,
1792 unsigned long a3, unsigned long a4)
1793{
5411be59 1794 struct task_struct *tsk = current;
1da177e4
LT
1795 struct audit_context *context = tsk->audit_context;
1796 enum audit_state state;
1797
56179a6e 1798 if (!context)
86a1c34a 1799 return;
1da177e4 1800
b0dd25a8
RD
1801 /*
1802 * This happens only on certain architectures that make system
1da177e4
LT
1803 * calls in kernel_thread via the entry.S interface, instead of
1804 * with direct calls. (If you are porting to a new
1805 * architecture, hitting this condition can indicate that you
1806 * got the _exit/_leave calls backward in entry.S.)
1807 *
1808 * i386 no
1809 * x86_64 no
2ef9481e 1810 * ppc64 yes (see arch/powerpc/platforms/iseries/misc.S)
1da177e4
LT
1811 *
1812 * This also happens with vm86 emulation in a non-nested manner
1813 * (entries without exits), so this case must be caught.
1814 */
1815 if (context->in_syscall) {
1816 struct audit_context *newctx;
1817
1da177e4
LT
1818#if AUDIT_DEBUG
1819 printk(KERN_ERR
1820 "audit(:%d) pid=%d in syscall=%d;"
1821 " entering syscall=%d\n",
1822 context->serial, tsk->pid, context->major, major);
1823#endif
1824 newctx = audit_alloc_context(context->state);
1825 if (newctx) {
1826 newctx->previous = context;
1827 context = newctx;
1828 tsk->audit_context = newctx;
1829 } else {
1830 /* If we can't alloc a new context, the best we
1831 * can do is to leak memory (any pending putname
1832 * will be lost). The only other alternative is
1833 * to abandon auditing. */
1834 audit_zero_context(context, context->state);
1835 }
1836 }
1837 BUG_ON(context->in_syscall || context->name_count);
1838
1839 if (!audit_enabled)
1840 return;
1841
2fd6f58b 1842 context->arch = arch;
1da177e4
LT
1843 context->major = major;
1844 context->argv[0] = a1;
1845 context->argv[1] = a2;
1846 context->argv[2] = a3;
1847 context->argv[3] = a4;
1848
1849 state = context->state;
d51374ad 1850 context->dummy = !audit_n_rules;
0590b933
AV
1851 if (!context->dummy && state == AUDIT_BUILD_CONTEXT) {
1852 context->prio = 0;
0f45aa18 1853 state = audit_filter_syscall(tsk, context, &audit_filter_list[AUDIT_FILTER_ENTRY]);
0590b933 1854 }
56179a6e 1855 if (state == AUDIT_DISABLED)
1da177e4
LT
1856 return;
1857
ce625a80 1858 context->serial = 0;
1da177e4
LT
1859 context->ctime = CURRENT_TIME;
1860 context->in_syscall = 1;
0590b933 1861 context->current_state = state;
419c58f1 1862 context->ppid = 0;
1da177e4
LT
1863}
1864
b0dd25a8
RD
1865/**
1866 * audit_syscall_exit - deallocate audit context after a system call
42ae610c
RD
1867 * @success: success value of the syscall
1868 * @return_code: return value of the syscall
b0dd25a8
RD
1869 *
1870 * Tear down after system call. If the audit context has been marked as
1da177e4 1871 * auditable (either because of the AUDIT_RECORD_CONTEXT state from
42ae610c 1872 * filtering, or because some other part of the kernel wrote an audit
1da177e4 1873 * message), then write out the syscall information. In call cases,
b0dd25a8
RD
1874 * free the names stored from getname().
1875 */
d7e7528b 1876void __audit_syscall_exit(int success, long return_code)
1da177e4 1877{
5411be59 1878 struct task_struct *tsk = current;
1da177e4
LT
1879 struct audit_context *context;
1880
d7e7528b
EP
1881 if (success)
1882 success = AUDITSC_SUCCESS;
1883 else
1884 success = AUDITSC_FAILURE;
1da177e4 1885
d7e7528b 1886 context = audit_get_context(tsk, success, return_code);
56179a6e 1887 if (!context)
97e94c45 1888 return;
1da177e4 1889
0590b933 1890 if (context->in_syscall && context->current_state == AUDIT_RECORD_CONTEXT)
e495149b 1891 audit_log_exit(context, tsk);
1da177e4
LT
1892
1893 context->in_syscall = 0;
0590b933 1894 context->prio = context->state == AUDIT_RECORD_CONTEXT ? ~0ULL : 0;
2fd6f58b 1895
916d7576
AV
1896 if (!list_empty(&context->killed_trees))
1897 audit_kill_trees(&context->killed_trees);
1898
1da177e4
LT
1899 if (context->previous) {
1900 struct audit_context *new_context = context->previous;
1901 context->previous = NULL;
1902 audit_free_context(context);
1903 tsk->audit_context = new_context;
1904 } else {
1905 audit_free_names(context);
74c3cbe3 1906 unroll_tree_refs(context, NULL, 0);
1da177e4 1907 audit_free_aux(context);
e54dc243
AG
1908 context->aux = NULL;
1909 context->aux_pids = NULL;
a5cb013d 1910 context->target_pid = 0;
e54dc243 1911 context->target_sid = 0;
4f6b434f 1912 context->sockaddr_len = 0;
f3298dc4 1913 context->type = 0;
157cf649 1914 context->fds[0] = -1;
e048e02c
AV
1915 if (context->state != AUDIT_RECORD_CONTEXT) {
1916 kfree(context->filterkey);
1917 context->filterkey = NULL;
1918 }
1da177e4
LT
1919 tsk->audit_context = context;
1920 }
1da177e4
LT
1921}
1922
74c3cbe3
AV
1923static inline void handle_one(const struct inode *inode)
1924{
1925#ifdef CONFIG_AUDIT_TREE
1926 struct audit_context *context;
1927 struct audit_tree_refs *p;
1928 struct audit_chunk *chunk;
1929 int count;
e61ce867 1930 if (likely(hlist_empty(&inode->i_fsnotify_marks)))
74c3cbe3
AV
1931 return;
1932 context = current->audit_context;
1933 p = context->trees;
1934 count = context->tree_count;
1935 rcu_read_lock();
1936 chunk = audit_tree_lookup(inode);
1937 rcu_read_unlock();
1938 if (!chunk)
1939 return;
1940 if (likely(put_tree_ref(context, chunk)))
1941 return;
1942 if (unlikely(!grow_tree_refs(context))) {
436c405c 1943 printk(KERN_WARNING "out of memory, audit has lost a tree reference\n");
74c3cbe3
AV
1944 audit_set_auditable(context);
1945 audit_put_chunk(chunk);
1946 unroll_tree_refs(context, p, count);
1947 return;
1948 }
1949 put_tree_ref(context, chunk);
1950#endif
1951}
1952
1953static void handle_path(const struct dentry *dentry)
1954{
1955#ifdef CONFIG_AUDIT_TREE
1956 struct audit_context *context;
1957 struct audit_tree_refs *p;
1958 const struct dentry *d, *parent;
1959 struct audit_chunk *drop;
1960 unsigned long seq;
1961 int count;
1962
1963 context = current->audit_context;
1964 p = context->trees;
1965 count = context->tree_count;
1966retry:
1967 drop = NULL;
1968 d = dentry;
1969 rcu_read_lock();
1970 seq = read_seqbegin(&rename_lock);
1971 for(;;) {
1972 struct inode *inode = d->d_inode;
e61ce867 1973 if (inode && unlikely(!hlist_empty(&inode->i_fsnotify_marks))) {
74c3cbe3
AV
1974 struct audit_chunk *chunk;
1975 chunk = audit_tree_lookup(inode);
1976 if (chunk) {
1977 if (unlikely(!put_tree_ref(context, chunk))) {
1978 drop = chunk;
1979 break;
1980 }
1981 }
1982 }
1983 parent = d->d_parent;
1984 if (parent == d)
1985 break;
1986 d = parent;
1987 }
1988 if (unlikely(read_seqretry(&rename_lock, seq) || drop)) { /* in this order */
1989 rcu_read_unlock();
1990 if (!drop) {
1991 /* just a race with rename */
1992 unroll_tree_refs(context, p, count);
1993 goto retry;
1994 }
1995 audit_put_chunk(drop);
1996 if (grow_tree_refs(context)) {
1997 /* OK, got more space */
1998 unroll_tree_refs(context, p, count);
1999 goto retry;
2000 }
2001 /* too bad */
2002 printk(KERN_WARNING
436c405c 2003 "out of memory, audit has lost a tree reference\n");
74c3cbe3
AV
2004 unroll_tree_refs(context, p, count);
2005 audit_set_auditable(context);
2006 return;
2007 }
2008 rcu_read_unlock();
2009#endif
2010}
2011
5195d8e2
EP
2012static struct audit_names *audit_alloc_name(struct audit_context *context)
2013{
2014 struct audit_names *aname;
2015
2016 if (context->name_count < AUDIT_NAMES) {
2017 aname = &context->preallocated_names[context->name_count];
2018 memset(aname, 0, sizeof(*aname));
2019 } else {
2020 aname = kzalloc(sizeof(*aname), GFP_NOFS);
2021 if (!aname)
2022 return NULL;
2023 aname->should_free = true;
2024 }
2025
2026 aname->ino = (unsigned long)-1;
2027 list_add_tail(&aname->list, &context->names_list);
2028
2029 context->name_count++;
2030#if AUDIT_DEBUG
2031 context->ino_count++;
2032#endif
2033 return aname;
2034}
2035
b0dd25a8
RD
2036/**
2037 * audit_getname - add a name to the list
2038 * @name: name to add
2039 *
2040 * Add a name to the list of audit names for this context.
2041 * Called from fs/namei.c:getname().
2042 */
d8945bb5 2043void __audit_getname(const char *name)
1da177e4
LT
2044{
2045 struct audit_context *context = current->audit_context;
5195d8e2 2046 struct audit_names *n;
1da177e4 2047
1da177e4
LT
2048 if (!context->in_syscall) {
2049#if AUDIT_DEBUG == 2
2050 printk(KERN_ERR "%s:%d(:%d): ignoring getname(%p)\n",
2051 __FILE__, __LINE__, context->serial, name);
2052 dump_stack();
2053#endif
2054 return;
2055 }
5195d8e2
EP
2056
2057 n = audit_alloc_name(context);
2058 if (!n)
2059 return;
2060
2061 n->name = name;
2062 n->name_len = AUDIT_NAME_FULL;
2063 n->name_put = true;
2064
f7ad3c6b
MS
2065 if (!context->pwd.dentry)
2066 get_fs_pwd(current->fs, &context->pwd);
1da177e4
LT
2067}
2068
b0dd25a8
RD
2069/* audit_putname - intercept a putname request
2070 * @name: name to intercept and delay for putname
2071 *
2072 * If we have stored the name from getname in the audit context,
2073 * then we delay the putname until syscall exit.
2074 * Called from include/linux/fs.h:putname().
2075 */
1da177e4
LT
2076void audit_putname(const char *name)
2077{
2078 struct audit_context *context = current->audit_context;
2079
2080 BUG_ON(!context);
2081 if (!context->in_syscall) {
2082#if AUDIT_DEBUG == 2
2083 printk(KERN_ERR "%s:%d(:%d): __putname(%p)\n",
2084 __FILE__, __LINE__, context->serial, name);
2085 if (context->name_count) {
5195d8e2 2086 struct audit_names *n;
1da177e4 2087 int i;
5195d8e2
EP
2088
2089 list_for_each_entry(n, &context->names_list, list)
1da177e4 2090 printk(KERN_ERR "name[%d] = %p = %s\n", i,
5195d8e2
EP
2091 n->name, n->name ?: "(null)");
2092 }
1da177e4
LT
2093#endif
2094 __putname(name);
2095 }
2096#if AUDIT_DEBUG
2097 else {
2098 ++context->put_count;
2099 if (context->put_count > context->name_count) {
2100 printk(KERN_ERR "%s:%d(:%d): major=%d"
2101 " in_syscall=%d putname(%p) name_count=%d"
2102 " put_count=%d\n",
2103 __FILE__, __LINE__,
2104 context->serial, context->major,
2105 context->in_syscall, name, context->name_count,
2106 context->put_count);
2107 dump_stack();
2108 }
2109 }
2110#endif
2111}
2112
851f7ff5
EP
2113static inline int audit_copy_fcaps(struct audit_names *name, const struct dentry *dentry)
2114{
2115 struct cpu_vfs_cap_data caps;
2116 int rc;
2117
851f7ff5
EP
2118 if (!dentry)
2119 return 0;
2120
2121 rc = get_vfs_caps_from_disk(dentry, &caps);
2122 if (rc)
2123 return rc;
2124
2125 name->fcap.permitted = caps.permitted;
2126 name->fcap.inheritable = caps.inheritable;
2127 name->fcap.fE = !!(caps.magic_etc & VFS_CAP_FLAGS_EFFECTIVE);
2128 name->fcap_ver = (caps.magic_etc & VFS_CAP_REVISION_MASK) >> VFS_CAP_REVISION_SHIFT;
2129
2130 return 0;
2131}
2132
2133
3e2efce0 2134/* Copy inode data into an audit_names. */
851f7ff5
EP
2135static void audit_copy_inode(struct audit_names *name, const struct dentry *dentry,
2136 const struct inode *inode)
8c8570fb 2137{
3e2efce0
AG
2138 name->ino = inode->i_ino;
2139 name->dev = inode->i_sb->s_dev;
2140 name->mode = inode->i_mode;
2141 name->uid = inode->i_uid;
2142 name->gid = inode->i_gid;
2143 name->rdev = inode->i_rdev;
2a862b32 2144 security_inode_getsecid(inode, &name->osid);
851f7ff5 2145 audit_copy_fcaps(name, dentry);
8c8570fb
DK
2146}
2147
b0dd25a8
RD
2148/**
2149 * audit_inode - store the inode and device from a lookup
2150 * @name: name being audited
481968f4 2151 * @dentry: dentry being audited
b0dd25a8
RD
2152 *
2153 * Called from fs/namei.c:path_lookup().
2154 */
5a190ae6 2155void __audit_inode(const char *name, const struct dentry *dentry)
1da177e4 2156{
1da177e4 2157 struct audit_context *context = current->audit_context;
74c3cbe3 2158 const struct inode *inode = dentry->d_inode;
5195d8e2 2159 struct audit_names *n;
1da177e4
LT
2160
2161 if (!context->in_syscall)
2162 return;
5195d8e2
EP
2163
2164 list_for_each_entry_reverse(n, &context->names_list, list) {
2165 if (n->name && (n->name == name))
2166 goto out;
1da177e4 2167 }
5195d8e2
EP
2168
2169 /* unable to find the name from a previous getname() */
2170 n = audit_alloc_name(context);
2171 if (!n)
2172 return;
2173out:
74c3cbe3 2174 handle_path(dentry);
5195d8e2 2175 audit_copy_inode(n, dentry, inode);
73241ccc
AG
2176}
2177
2178/**
2179 * audit_inode_child - collect inode info for created/removed objects
481968f4 2180 * @dentry: dentry being audited
73d3ec5a 2181 * @parent: inode of dentry parent
73241ccc
AG
2182 *
2183 * For syscalls that create or remove filesystem objects, audit_inode
2184 * can only collect information for the filesystem object's parent.
2185 * This call updates the audit context with the child's information.
2186 * Syscalls that create a new filesystem object must be hooked after
2187 * the object is created. Syscalls that remove a filesystem object
2188 * must be hooked prior, in order to capture the target inode during
2189 * unsuccessful attempts.
2190 */
cccc6bba 2191void __audit_inode_child(const struct dentry *dentry,
73d3ec5a 2192 const struct inode *parent)
73241ccc 2193{
73241ccc 2194 struct audit_context *context = current->audit_context;
5712e88f 2195 const char *found_parent = NULL, *found_child = NULL;
5a190ae6 2196 const struct inode *inode = dentry->d_inode;
cccc6bba 2197 const char *dname = dentry->d_name.name;
5195d8e2 2198 struct audit_names *n;
9c937dcc 2199 int dirlen = 0;
73241ccc
AG
2200
2201 if (!context->in_syscall)
2202 return;
2203
74c3cbe3
AV
2204 if (inode)
2205 handle_one(inode);
73241ccc 2206
5712e88f 2207 /* parent is more likely, look for it first */
5195d8e2 2208 list_for_each_entry(n, &context->names_list, list) {
5712e88f
AG
2209 if (!n->name)
2210 continue;
2211
2212 if (n->ino == parent->i_ino &&
2213 !audit_compare_dname_path(dname, n->name, &dirlen)) {
2214 n->name_len = dirlen; /* update parent data in place */
2215 found_parent = n->name;
2216 goto add_names;
f368c07d 2217 }
5712e88f 2218 }
73241ccc 2219
5712e88f 2220 /* no matching parent, look for matching child */
5195d8e2 2221 list_for_each_entry(n, &context->names_list, list) {
5712e88f
AG
2222 if (!n->name)
2223 continue;
2224
2225 /* strcmp() is the more likely scenario */
2226 if (!strcmp(dname, n->name) ||
2227 !audit_compare_dname_path(dname, n->name, &dirlen)) {
2228 if (inode)
851f7ff5 2229 audit_copy_inode(n, NULL, inode);
5712e88f
AG
2230 else
2231 n->ino = (unsigned long)-1;
2232 found_child = n->name;
2233 goto add_names;
2234 }
ac9910ce 2235 }
5712e88f
AG
2236
2237add_names:
2238 if (!found_parent) {
5195d8e2
EP
2239 n = audit_alloc_name(context);
2240 if (!n)
ac9910ce 2241 return;
5195d8e2 2242 audit_copy_inode(n, NULL, parent);
73d3ec5a 2243 }
5712e88f
AG
2244
2245 if (!found_child) {
5195d8e2
EP
2246 n = audit_alloc_name(context);
2247 if (!n)
5712e88f 2248 return;
5712e88f
AG
2249
2250 /* Re-use the name belonging to the slot for a matching parent
2251 * directory. All names for this context are relinquished in
2252 * audit_free_names() */
2253 if (found_parent) {
5195d8e2
EP
2254 n->name = found_parent;
2255 n->name_len = AUDIT_NAME_FULL;
5712e88f 2256 /* don't call __putname() */
5195d8e2 2257 n->name_put = false;
5712e88f
AG
2258 }
2259
2260 if (inode)
5195d8e2 2261 audit_copy_inode(n, NULL, inode);
5712e88f 2262 }
3e2efce0 2263}
50e437d5 2264EXPORT_SYMBOL_GPL(__audit_inode_child);
3e2efce0 2265
b0dd25a8
RD
2266/**
2267 * auditsc_get_stamp - get local copies of audit_context values
2268 * @ctx: audit_context for the task
2269 * @t: timespec to store time recorded in the audit_context
2270 * @serial: serial value that is recorded in the audit_context
2271 *
2272 * Also sets the context as auditable.
2273 */
48887e63 2274int auditsc_get_stamp(struct audit_context *ctx,
bfb4496e 2275 struct timespec *t, unsigned int *serial)
1da177e4 2276{
48887e63
AV
2277 if (!ctx->in_syscall)
2278 return 0;
ce625a80
DW
2279 if (!ctx->serial)
2280 ctx->serial = audit_serial();
bfb4496e
DW
2281 t->tv_sec = ctx->ctime.tv_sec;
2282 t->tv_nsec = ctx->ctime.tv_nsec;
2283 *serial = ctx->serial;
0590b933
AV
2284 if (!ctx->prio) {
2285 ctx->prio = 1;
2286 ctx->current_state = AUDIT_RECORD_CONTEXT;
2287 }
48887e63 2288 return 1;
1da177e4
LT
2289}
2290
4746ec5b
EP
2291/* global counter which is incremented every time something logs in */
2292static atomic_t session_id = ATOMIC_INIT(0);
2293
b0dd25a8 2294/**
0a300be6 2295 * audit_set_loginuid - set current task's audit_context loginuid
b0dd25a8
RD
2296 * @loginuid: loginuid value
2297 *
2298 * Returns 0.
2299 *
2300 * Called (set) from fs/proc/base.c::proc_loginuid_write().
2301 */
e1760bd5 2302int audit_set_loginuid(kuid_t loginuid)
1da177e4 2303{
0a300be6 2304 struct task_struct *task = current;
41757106 2305 struct audit_context *context = task->audit_context;
633b4545 2306 unsigned int sessionid;
41757106 2307
633b4545 2308#ifdef CONFIG_AUDIT_LOGINUID_IMMUTABLE
e1760bd5 2309 if (uid_valid(task->loginuid))
633b4545
EP
2310 return -EPERM;
2311#else /* CONFIG_AUDIT_LOGINUID_IMMUTABLE */
2312 if (!capable(CAP_AUDIT_CONTROL))
2313 return -EPERM;
2314#endif /* CONFIG_AUDIT_LOGINUID_IMMUTABLE */
2315
2316 sessionid = atomic_inc_return(&session_id);
bfef93a5
AV
2317 if (context && context->in_syscall) {
2318 struct audit_buffer *ab;
2319
2320 ab = audit_log_start(NULL, GFP_KERNEL, AUDIT_LOGIN);
2321 if (ab) {
2322 audit_log_format(ab, "login pid=%d uid=%u "
4746ec5b
EP
2323 "old auid=%u new auid=%u"
2324 " old ses=%u new ses=%u",
cca080d9
EB
2325 task->pid,
2326 from_kuid(&init_user_ns, task_uid(task)),
e1760bd5
EB
2327 from_kuid(&init_user_ns, task->loginuid),
2328 from_kuid(&init_user_ns, loginuid),
4746ec5b 2329 task->sessionid, sessionid);
bfef93a5 2330 audit_log_end(ab);
c0404993 2331 }
1da177e4 2332 }
4746ec5b 2333 task->sessionid = sessionid;
bfef93a5 2334 task->loginuid = loginuid;
1da177e4
LT
2335 return 0;
2336}
2337
20ca73bc
GW
2338/**
2339 * __audit_mq_open - record audit data for a POSIX MQ open
2340 * @oflag: open flag
2341 * @mode: mode bits
6b962559 2342 * @attr: queue attributes
20ca73bc 2343 *
20ca73bc 2344 */
df0a4283 2345void __audit_mq_open(int oflag, umode_t mode, struct mq_attr *attr)
20ca73bc 2346{
20ca73bc
GW
2347 struct audit_context *context = current->audit_context;
2348
564f6993
AV
2349 if (attr)
2350 memcpy(&context->mq_open.attr, attr, sizeof(struct mq_attr));
2351 else
2352 memset(&context->mq_open.attr, 0, sizeof(struct mq_attr));
20ca73bc 2353
564f6993
AV
2354 context->mq_open.oflag = oflag;
2355 context->mq_open.mode = mode;
20ca73bc 2356
564f6993 2357 context->type = AUDIT_MQ_OPEN;
20ca73bc
GW
2358}
2359
2360/**
c32c8af4 2361 * __audit_mq_sendrecv - record audit data for a POSIX MQ timed send/receive
20ca73bc
GW
2362 * @mqdes: MQ descriptor
2363 * @msg_len: Message length
2364 * @msg_prio: Message priority
c32c8af4 2365 * @abs_timeout: Message timeout in absolute time
20ca73bc 2366 *
20ca73bc 2367 */
c32c8af4
AV
2368void __audit_mq_sendrecv(mqd_t mqdes, size_t msg_len, unsigned int msg_prio,
2369 const struct timespec *abs_timeout)
20ca73bc 2370{
20ca73bc 2371 struct audit_context *context = current->audit_context;
c32c8af4 2372 struct timespec *p = &context->mq_sendrecv.abs_timeout;
20ca73bc 2373
c32c8af4
AV
2374 if (abs_timeout)
2375 memcpy(p, abs_timeout, sizeof(struct timespec));
2376 else
2377 memset(p, 0, sizeof(struct timespec));
20ca73bc 2378
c32c8af4
AV
2379 context->mq_sendrecv.mqdes = mqdes;
2380 context->mq_sendrecv.msg_len = msg_len;
2381 context->mq_sendrecv.msg_prio = msg_prio;
20ca73bc 2382
c32c8af4 2383 context->type = AUDIT_MQ_SENDRECV;
20ca73bc
GW
2384}
2385
2386/**
2387 * __audit_mq_notify - record audit data for a POSIX MQ notify
2388 * @mqdes: MQ descriptor
6b962559 2389 * @notification: Notification event
20ca73bc 2390 *
20ca73bc
GW
2391 */
2392
20114f71 2393void __audit_mq_notify(mqd_t mqdes, const struct sigevent *notification)
20ca73bc 2394{
20ca73bc
GW
2395 struct audit_context *context = current->audit_context;
2396
20114f71
AV
2397 if (notification)
2398 context->mq_notify.sigev_signo = notification->sigev_signo;
2399 else
2400 context->mq_notify.sigev_signo = 0;
20ca73bc 2401
20114f71
AV
2402 context->mq_notify.mqdes = mqdes;
2403 context->type = AUDIT_MQ_NOTIFY;
20ca73bc
GW
2404}
2405
2406/**
2407 * __audit_mq_getsetattr - record audit data for a POSIX MQ get/set attribute
2408 * @mqdes: MQ descriptor
2409 * @mqstat: MQ flags
2410 *
20ca73bc 2411 */
7392906e 2412void __audit_mq_getsetattr(mqd_t mqdes, struct mq_attr *mqstat)
20ca73bc 2413{
20ca73bc 2414 struct audit_context *context = current->audit_context;
7392906e
AV
2415 context->mq_getsetattr.mqdes = mqdes;
2416 context->mq_getsetattr.mqstat = *mqstat;
2417 context->type = AUDIT_MQ_GETSETATTR;
20ca73bc
GW
2418}
2419
b0dd25a8 2420/**
073115d6
SG
2421 * audit_ipc_obj - record audit data for ipc object
2422 * @ipcp: ipc permissions
2423 *
073115d6 2424 */
a33e6751 2425void __audit_ipc_obj(struct kern_ipc_perm *ipcp)
073115d6 2426{
073115d6 2427 struct audit_context *context = current->audit_context;
a33e6751
AV
2428 context->ipc.uid = ipcp->uid;
2429 context->ipc.gid = ipcp->gid;
2430 context->ipc.mode = ipcp->mode;
e816f370 2431 context->ipc.has_perm = 0;
a33e6751
AV
2432 security_ipc_getsecid(ipcp, &context->ipc.osid);
2433 context->type = AUDIT_IPC;
073115d6
SG
2434}
2435
2436/**
2437 * audit_ipc_set_perm - record audit data for new ipc permissions
b0dd25a8
RD
2438 * @qbytes: msgq bytes
2439 * @uid: msgq user id
2440 * @gid: msgq group id
2441 * @mode: msgq mode (permissions)
2442 *
e816f370 2443 * Called only after audit_ipc_obj().
b0dd25a8 2444 */
2570ebbd 2445void __audit_ipc_set_perm(unsigned long qbytes, uid_t uid, gid_t gid, umode_t mode)
1da177e4 2446{
1da177e4
LT
2447 struct audit_context *context = current->audit_context;
2448
e816f370
AV
2449 context->ipc.qbytes = qbytes;
2450 context->ipc.perm_uid = uid;
2451 context->ipc.perm_gid = gid;
2452 context->ipc.perm_mode = mode;
2453 context->ipc.has_perm = 1;
1da177e4 2454}
c2f0c7c3 2455
07c49417 2456int __audit_bprm(struct linux_binprm *bprm)
473ae30b
AV
2457{
2458 struct audit_aux_data_execve *ax;
2459 struct audit_context *context = current->audit_context;
473ae30b 2460
bdf4c48a 2461 ax = kmalloc(sizeof(*ax), GFP_KERNEL);
473ae30b
AV
2462 if (!ax)
2463 return -ENOMEM;
2464
2465 ax->argc = bprm->argc;
2466 ax->envc = bprm->envc;
bdf4c48a 2467 ax->mm = bprm->mm;
473ae30b
AV
2468 ax->d.type = AUDIT_EXECVE;
2469 ax->d.next = context->aux;
2470 context->aux = (void *)ax;
2471 return 0;
2472}
2473
2474
b0dd25a8
RD
2475/**
2476 * audit_socketcall - record audit data for sys_socketcall
2477 * @nargs: number of args
2478 * @args: args array
2479 *
b0dd25a8 2480 */
07c49417 2481void __audit_socketcall(int nargs, unsigned long *args)
3ec3b2fb 2482{
3ec3b2fb
DW
2483 struct audit_context *context = current->audit_context;
2484
f3298dc4
AV
2485 context->type = AUDIT_SOCKETCALL;
2486 context->socketcall.nargs = nargs;
2487 memcpy(context->socketcall.args, args, nargs * sizeof(unsigned long));
3ec3b2fb
DW
2488}
2489
db349509
AV
2490/**
2491 * __audit_fd_pair - record audit data for pipe and socketpair
2492 * @fd1: the first file descriptor
2493 * @fd2: the second file descriptor
2494 *
db349509 2495 */
157cf649 2496void __audit_fd_pair(int fd1, int fd2)
db349509
AV
2497{
2498 struct audit_context *context = current->audit_context;
157cf649
AV
2499 context->fds[0] = fd1;
2500 context->fds[1] = fd2;
db349509
AV
2501}
2502
b0dd25a8
RD
2503/**
2504 * audit_sockaddr - record audit data for sys_bind, sys_connect, sys_sendto
2505 * @len: data length in user space
2506 * @a: data address in kernel space
2507 *
2508 * Returns 0 for success or NULL context or < 0 on error.
2509 */
07c49417 2510int __audit_sockaddr(int len, void *a)
3ec3b2fb 2511{
3ec3b2fb
DW
2512 struct audit_context *context = current->audit_context;
2513
4f6b434f
AV
2514 if (!context->sockaddr) {
2515 void *p = kmalloc(sizeof(struct sockaddr_storage), GFP_KERNEL);
2516 if (!p)
2517 return -ENOMEM;
2518 context->sockaddr = p;
2519 }
3ec3b2fb 2520
4f6b434f
AV
2521 context->sockaddr_len = len;
2522 memcpy(context->sockaddr, a, len);
3ec3b2fb
DW
2523 return 0;
2524}
2525
a5cb013d
AV
2526void __audit_ptrace(struct task_struct *t)
2527{
2528 struct audit_context *context = current->audit_context;
2529
2530 context->target_pid = t->pid;
c2a7780e 2531 context->target_auid = audit_get_loginuid(t);
c69e8d9c 2532 context->target_uid = task_uid(t);
4746ec5b 2533 context->target_sessionid = audit_get_sessionid(t);
2a862b32 2534 security_task_getsecid(t, &context->target_sid);
c2a7780e 2535 memcpy(context->target_comm, t->comm, TASK_COMM_LEN);
a5cb013d
AV
2536}
2537
b0dd25a8
RD
2538/**
2539 * audit_signal_info - record signal info for shutting down audit subsystem
2540 * @sig: signal value
2541 * @t: task being signaled
2542 *
2543 * If the audit subsystem is being terminated, record the task (pid)
2544 * and uid that is doing that.
2545 */
e54dc243 2546int __audit_signal_info(int sig, struct task_struct *t)
c2f0c7c3 2547{
e54dc243
AG
2548 struct audit_aux_data_pids *axp;
2549 struct task_struct *tsk = current;
2550 struct audit_context *ctx = tsk->audit_context;
cca080d9 2551 kuid_t uid = current_uid(), t_uid = task_uid(t);
e1396065 2552
175fc484 2553 if (audit_pid && t->tgid == audit_pid) {
ee1d3156 2554 if (sig == SIGTERM || sig == SIGHUP || sig == SIGUSR1 || sig == SIGUSR2) {
175fc484 2555 audit_sig_pid = tsk->pid;
e1760bd5 2556 if (uid_valid(tsk->loginuid))
bfef93a5 2557 audit_sig_uid = tsk->loginuid;
175fc484 2558 else
c69e8d9c 2559 audit_sig_uid = uid;
2a862b32 2560 security_task_getsecid(tsk, &audit_sig_sid);
175fc484
AV
2561 }
2562 if (!audit_signals || audit_dummy_context())
2563 return 0;
c2f0c7c3 2564 }
e54dc243 2565
e54dc243
AG
2566 /* optimize the common case by putting first signal recipient directly
2567 * in audit_context */
2568 if (!ctx->target_pid) {
2569 ctx->target_pid = t->tgid;
c2a7780e 2570 ctx->target_auid = audit_get_loginuid(t);
c69e8d9c 2571 ctx->target_uid = t_uid;
4746ec5b 2572 ctx->target_sessionid = audit_get_sessionid(t);
2a862b32 2573 security_task_getsecid(t, &ctx->target_sid);
c2a7780e 2574 memcpy(ctx->target_comm, t->comm, TASK_COMM_LEN);
e54dc243
AG
2575 return 0;
2576 }
2577
2578 axp = (void *)ctx->aux_pids;
2579 if (!axp || axp->pid_count == AUDIT_AUX_PIDS) {
2580 axp = kzalloc(sizeof(*axp), GFP_ATOMIC);
2581 if (!axp)
2582 return -ENOMEM;
2583
2584 axp->d.type = AUDIT_OBJ_PID;
2585 axp->d.next = ctx->aux_pids;
2586 ctx->aux_pids = (void *)axp;
2587 }
88ae704c 2588 BUG_ON(axp->pid_count >= AUDIT_AUX_PIDS);
e54dc243
AG
2589
2590 axp->target_pid[axp->pid_count] = t->tgid;
c2a7780e 2591 axp->target_auid[axp->pid_count] = audit_get_loginuid(t);
c69e8d9c 2592 axp->target_uid[axp->pid_count] = t_uid;
4746ec5b 2593 axp->target_sessionid[axp->pid_count] = audit_get_sessionid(t);
2a862b32 2594 security_task_getsecid(t, &axp->target_sid[axp->pid_count]);
c2a7780e 2595 memcpy(axp->target_comm[axp->pid_count], t->comm, TASK_COMM_LEN);
e54dc243
AG
2596 axp->pid_count++;
2597
2598 return 0;
c2f0c7c3 2599}
0a4ff8c2 2600
3fc689e9
EP
2601/**
2602 * __audit_log_bprm_fcaps - store information about a loading bprm and relevant fcaps
d84f4f99
DH
2603 * @bprm: pointer to the bprm being processed
2604 * @new: the proposed new credentials
2605 * @old: the old credentials
3fc689e9
EP
2606 *
2607 * Simply check if the proc already has the caps given by the file and if not
2608 * store the priv escalation info for later auditing at the end of the syscall
2609 *
3fc689e9
EP
2610 * -Eric
2611 */
d84f4f99
DH
2612int __audit_log_bprm_fcaps(struct linux_binprm *bprm,
2613 const struct cred *new, const struct cred *old)
3fc689e9
EP
2614{
2615 struct audit_aux_data_bprm_fcaps *ax;
2616 struct audit_context *context = current->audit_context;
2617 struct cpu_vfs_cap_data vcaps;
2618 struct dentry *dentry;
2619
2620 ax = kmalloc(sizeof(*ax), GFP_KERNEL);
2621 if (!ax)
d84f4f99 2622 return -ENOMEM;
3fc689e9
EP
2623
2624 ax->d.type = AUDIT_BPRM_FCAPS;
2625 ax->d.next = context->aux;
2626 context->aux = (void *)ax;
2627
2628 dentry = dget(bprm->file->f_dentry);
2629 get_vfs_caps_from_disk(dentry, &vcaps);
2630 dput(dentry);
2631
2632 ax->fcap.permitted = vcaps.permitted;
2633 ax->fcap.inheritable = vcaps.inheritable;
2634 ax->fcap.fE = !!(vcaps.magic_etc & VFS_CAP_FLAGS_EFFECTIVE);
2635 ax->fcap_ver = (vcaps.magic_etc & VFS_CAP_REVISION_MASK) >> VFS_CAP_REVISION_SHIFT;
2636
d84f4f99
DH
2637 ax->old_pcap.permitted = old->cap_permitted;
2638 ax->old_pcap.inheritable = old->cap_inheritable;
2639 ax->old_pcap.effective = old->cap_effective;
3fc689e9 2640
d84f4f99
DH
2641 ax->new_pcap.permitted = new->cap_permitted;
2642 ax->new_pcap.inheritable = new->cap_inheritable;
2643 ax->new_pcap.effective = new->cap_effective;
2644 return 0;
3fc689e9
EP
2645}
2646
e68b75a0
EP
2647/**
2648 * __audit_log_capset - store information about the arguments to the capset syscall
d84f4f99
DH
2649 * @pid: target pid of the capset call
2650 * @new: the new credentials
2651 * @old: the old (current) credentials
e68b75a0
EP
2652 *
2653 * Record the aguments userspace sent to sys_capset for later printing by the
2654 * audit system if applicable
2655 */
57f71a0a 2656void __audit_log_capset(pid_t pid,
d84f4f99 2657 const struct cred *new, const struct cred *old)
e68b75a0 2658{
e68b75a0 2659 struct audit_context *context = current->audit_context;
57f71a0a
AV
2660 context->capset.pid = pid;
2661 context->capset.cap.effective = new->cap_effective;
2662 context->capset.cap.inheritable = new->cap_effective;
2663 context->capset.cap.permitted = new->cap_permitted;
2664 context->type = AUDIT_CAPSET;
e68b75a0
EP
2665}
2666
120a795d
AV
2667void __audit_mmap_fd(int fd, int flags)
2668{
2669 struct audit_context *context = current->audit_context;
2670 context->mmap.fd = fd;
2671 context->mmap.flags = flags;
2672 context->type = AUDIT_MMAP;
2673}
2674
85e7bac3
EP
2675static void audit_log_abend(struct audit_buffer *ab, char *reason, long signr)
2676{
cca080d9
EB
2677 kuid_t auid, uid;
2678 kgid_t gid;
85e7bac3
EP
2679 unsigned int sessionid;
2680
2681 auid = audit_get_loginuid(current);
2682 sessionid = audit_get_sessionid(current);
2683 current_uid_gid(&uid, &gid);
2684
2685 audit_log_format(ab, "auid=%u uid=%u gid=%u ses=%u",
cca080d9
EB
2686 from_kuid(&init_user_ns, auid),
2687 from_kuid(&init_user_ns, uid),
2688 from_kgid(&init_user_ns, gid),
2689 sessionid);
85e7bac3
EP
2690 audit_log_task_context(ab);
2691 audit_log_format(ab, " pid=%d comm=", current->pid);
2692 audit_log_untrustedstring(ab, current->comm);
2693 audit_log_format(ab, " reason=");
2694 audit_log_string(ab, reason);
2695 audit_log_format(ab, " sig=%ld", signr);
2696}
0a4ff8c2
SG
2697/**
2698 * audit_core_dumps - record information about processes that end abnormally
6d9525b5 2699 * @signr: signal value
0a4ff8c2
SG
2700 *
2701 * If a process ends with a core dump, something fishy is going on and we
2702 * should record the event for investigation.
2703 */
2704void audit_core_dumps(long signr)
2705{
2706 struct audit_buffer *ab;
0a4ff8c2
SG
2707
2708 if (!audit_enabled)
2709 return;
2710
2711 if (signr == SIGQUIT) /* don't care for those */
2712 return;
2713
2714 ab = audit_log_start(NULL, GFP_KERNEL, AUDIT_ANOM_ABEND);
85e7bac3
EP
2715 audit_log_abend(ab, "memory violation", signr);
2716 audit_log_end(ab);
2717}
0a4ff8c2 2718
3dc1c1b2 2719void __audit_seccomp(unsigned long syscall, long signr, int code)
85e7bac3
EP
2720{
2721 struct audit_buffer *ab;
2722
2723 ab = audit_log_start(NULL, GFP_KERNEL, AUDIT_ANOM_ABEND);
3dc1c1b2 2724 audit_log_abend(ab, "seccomp", signr);
85e7bac3 2725 audit_log_format(ab, " syscall=%ld", syscall);
3dc1c1b2
KC
2726 audit_log_format(ab, " compat=%d", is_compat_task());
2727 audit_log_format(ab, " ip=0x%lx", KSTK_EIP(current));
2728 audit_log_format(ab, " code=0x%x", code);
0a4ff8c2
SG
2729 audit_log_end(ab);
2730}
916d7576
AV
2731
2732struct list_head *audit_killed_trees(void)
2733{
2734 struct audit_context *ctx = current->audit_context;
2735 if (likely(!ctx || !ctx->in_syscall))
2736 return NULL;
2737 return &ctx->killed_trees;
2738}
This page took 0.736945 seconds and 5 git commands to generate.