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