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