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