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