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