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