Commit | Line | Data |
---|---|---|
85c8721f | 1 | /* audit.c -- Auditing support |
1da177e4 LT |
2 | * Gateway between the kernel (e.g., selinux) and the user-space audit daemon. |
3 | * System-call specific features have moved to auditsc.c | |
4 | * | |
6a01b07f | 5 | * Copyright 2003-2007 Red Hat Inc., Durham, North Carolina. |
1da177e4 LT |
6 | * All Rights Reserved. |
7 | * | |
8 | * This program is free software; you can redistribute it and/or modify | |
9 | * it under the terms of the GNU General Public License as published by | |
10 | * the Free Software Foundation; either version 2 of the License, or | |
11 | * (at your option) any later version. | |
12 | * | |
13 | * This program is distributed in the hope that it will be useful, | |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | * GNU General Public License for more details. | |
17 | * | |
18 | * You should have received a copy of the GNU General Public License | |
19 | * along with this program; if not, write to the Free Software | |
20 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | |
21 | * | |
22 | * Written by Rickard E. (Rik) Faith <faith@redhat.com> | |
23 | * | |
d7a96f3a | 24 | * Goals: 1) Integrate fully with Security Modules. |
1da177e4 LT |
25 | * 2) Minimal run-time overhead: |
26 | * a) Minimal when syscall auditing is disabled (audit_enable=0). | |
27 | * b) Small when syscall auditing is enabled and no audit record | |
28 | * is generated (defer as much work as possible to record | |
29 | * generation time): | |
30 | * i) context is allocated, | |
31 | * ii) names from getname are stored without a copy, and | |
32 | * iii) inode information stored from path_lookup. | |
33 | * 3) Ability to disable syscall auditing at boot time (audit=0). | |
34 | * 4) Usable by other parts of the kernel (if audit_log* is called, | |
35 | * then a syscall record will be generated automatically for the | |
36 | * current syscall). | |
37 | * 5) Netlink interface to user-space. | |
38 | * 6) Support low-overhead kernel-based filtering to minimize the | |
39 | * information that must be passed to user-space. | |
40 | * | |
85c8721f | 41 | * Example user-space utilities: http://people.redhat.com/sgrubb/audit/ |
1da177e4 LT |
42 | */ |
43 | ||
44 | #include <linux/init.h> | |
1da177e4 | 45 | #include <asm/types.h> |
60063497 | 46 | #include <linux/atomic.h> |
1da177e4 | 47 | #include <linux/mm.h> |
9984de1a | 48 | #include <linux/export.h> |
5a0e3ad6 | 49 | #include <linux/slab.h> |
b7d11258 DW |
50 | #include <linux/err.h> |
51 | #include <linux/kthread.h> | |
46e959ea | 52 | #include <linux/kernel.h> |
b24a30a7 | 53 | #include <linux/syscalls.h> |
1da177e4 LT |
54 | |
55 | #include <linux/audit.h> | |
56 | ||
57 | #include <net/sock.h> | |
93315ed6 | 58 | #include <net/netlink.h> |
1da177e4 | 59 | #include <linux/skbuff.h> |
131ad62d MDF |
60 | #ifdef CONFIG_SECURITY |
61 | #include <linux/security.h> | |
62 | #endif | |
94191213 | 63 | #include <net/netlink.h> |
7dfb7103 | 64 | #include <linux/freezer.h> |
522ed776 | 65 | #include <linux/tty.h> |
34e36d8e | 66 | #include <linux/pid_namespace.h> |
3dc7e315 DG |
67 | |
68 | #include "audit.h" | |
1da177e4 | 69 | |
a3f07114 | 70 | /* No auditing will take place until audit_initialized == AUDIT_INITIALIZED. |
1da177e4 | 71 | * (Initialization happens after skb_init is called.) */ |
a3f07114 EP |
72 | #define AUDIT_DISABLED -1 |
73 | #define AUDIT_UNINITIALIZED 0 | |
74 | #define AUDIT_INITIALIZED 1 | |
1da177e4 LT |
75 | static int audit_initialized; |
76 | ||
1a6b9f23 EP |
77 | #define AUDIT_OFF 0 |
78 | #define AUDIT_ON 1 | |
79 | #define AUDIT_LOCKED 2 | |
1da177e4 | 80 | int audit_enabled; |
b593d384 | 81 | int audit_ever_enabled; |
1da177e4 | 82 | |
ae9d67af JE |
83 | EXPORT_SYMBOL_GPL(audit_enabled); |
84 | ||
1da177e4 LT |
85 | /* Default state when kernel boots without any parameters. */ |
86 | static int audit_default; | |
87 | ||
88 | /* If auditing cannot proceed, audit_failure selects what happens. */ | |
89 | static int audit_failure = AUDIT_FAIL_PRINTK; | |
90 | ||
75c0371a PE |
91 | /* |
92 | * If audit records are to be written to the netlink socket, audit_pid | |
15e47304 EB |
93 | * contains the pid of the auditd process and audit_nlk_portid contains |
94 | * the portid to use to send netlink messages to that process. | |
75c0371a | 95 | */ |
c2f0c7c3 | 96 | int audit_pid; |
15e47304 | 97 | static int audit_nlk_portid; |
1da177e4 | 98 | |
b0dd25a8 | 99 | /* If audit_rate_limit is non-zero, limit the rate of sending audit records |
1da177e4 LT |
100 | * to that number per second. This prevents DoS attacks, but results in |
101 | * audit records being dropped. */ | |
102 | static int audit_rate_limit; | |
103 | ||
104 | /* Number of outstanding audit_buffers allowed. */ | |
105 | static int audit_backlog_limit = 64; | |
34210bee RGB |
106 | #define AUDIT_BACKLOG_WAIT_TIME (60 * HZ) |
107 | static int audit_backlog_wait_time = AUDIT_BACKLOG_WAIT_TIME; | |
ac4cec44 | 108 | static int audit_backlog_wait_overflow = 0; |
1da177e4 | 109 | |
c2f0c7c3 | 110 | /* The identity of the user shutting down the audit system. */ |
cca080d9 | 111 | kuid_t audit_sig_uid = INVALID_UID; |
c2f0c7c3 | 112 | pid_t audit_sig_pid = -1; |
e1396065 | 113 | u32 audit_sig_sid = 0; |
c2f0c7c3 | 114 | |
1da177e4 LT |
115 | /* Records can be lost in several ways: |
116 | 0) [suppressed in audit_alloc] | |
117 | 1) out of memory in audit_log_start [kmalloc of struct audit_buffer] | |
118 | 2) out of memory in audit_log_move [alloc_skb] | |
119 | 3) suppressed due to audit_rate_limit | |
120 | 4) suppressed due to audit_backlog_limit | |
121 | */ | |
122 | static atomic_t audit_lost = ATOMIC_INIT(0); | |
123 | ||
124 | /* The netlink socket. */ | |
125 | static struct sock *audit_sock; | |
126 | ||
f368c07d AG |
127 | /* Hash for inode-based rules */ |
128 | struct list_head audit_inode_hash[AUDIT_INODE_BUCKETS]; | |
129 | ||
b7d11258 | 130 | /* The audit_freelist is a list of pre-allocated audit buffers (if more |
1da177e4 LT |
131 | * than AUDIT_MAXFREE are in use, the audit buffer is freed instead of |
132 | * being placed on the freelist). */ | |
1da177e4 | 133 | static DEFINE_SPINLOCK(audit_freelist_lock); |
b0dd25a8 | 134 | static int audit_freelist_count; |
1da177e4 LT |
135 | static LIST_HEAD(audit_freelist); |
136 | ||
b7d11258 | 137 | static struct sk_buff_head audit_skb_queue; |
f3d357b0 EP |
138 | /* queue of skbs to send to auditd when/if it comes back */ |
139 | static struct sk_buff_head audit_skb_hold_queue; | |
b7d11258 DW |
140 | static struct task_struct *kauditd_task; |
141 | static DECLARE_WAIT_QUEUE_HEAD(kauditd_wait); | |
9ad9ad38 | 142 | static DECLARE_WAIT_QUEUE_HEAD(audit_backlog_wait); |
1da177e4 | 143 | |
f368c07d | 144 | /* Serialize requests from userspace. */ |
916d7576 | 145 | DEFINE_MUTEX(audit_cmd_mutex); |
1da177e4 LT |
146 | |
147 | /* AUDIT_BUFSIZ is the size of the temporary buffer used for formatting | |
148 | * audit records. Since printk uses a 1024 byte buffer, this buffer | |
149 | * should be at least that large. */ | |
150 | #define AUDIT_BUFSIZ 1024 | |
151 | ||
152 | /* AUDIT_MAXFREE is the number of empty audit_buffers we keep on the | |
153 | * audit_freelist. Doing so eliminates many kmalloc/kfree calls. */ | |
154 | #define AUDIT_MAXFREE (2*NR_CPUS) | |
155 | ||
156 | /* The audit_buffer is used when formatting an audit record. The caller | |
157 | * locks briefly to get the record off the freelist or to allocate the | |
158 | * buffer, and locks briefly to send the buffer to the netlink layer or | |
159 | * to place it on a transmit queue. Multiple audit_buffers can be in | |
160 | * use simultaneously. */ | |
161 | struct audit_buffer { | |
162 | struct list_head list; | |
8fc6115c | 163 | struct sk_buff *skb; /* formatted skb ready to send */ |
1da177e4 | 164 | struct audit_context *ctx; /* NULL or associated context */ |
9796fdd8 | 165 | gfp_t gfp_mask; |
1da177e4 LT |
166 | }; |
167 | ||
f09ac9db EP |
168 | struct audit_reply { |
169 | int pid; | |
170 | struct sk_buff *skb; | |
171 | }; | |
172 | ||
c0404993 SG |
173 | static void audit_set_pid(struct audit_buffer *ab, pid_t pid) |
174 | { | |
50397bd1 EP |
175 | if (ab) { |
176 | struct nlmsghdr *nlh = nlmsg_hdr(ab->skb); | |
177 | nlh->nlmsg_pid = pid; | |
178 | } | |
c0404993 SG |
179 | } |
180 | ||
8c8570fb | 181 | void audit_panic(const char *message) |
1da177e4 LT |
182 | { |
183 | switch (audit_failure) | |
184 | { | |
185 | case AUDIT_FAIL_SILENT: | |
186 | break; | |
187 | case AUDIT_FAIL_PRINTK: | |
320f1b1e EP |
188 | if (printk_ratelimit()) |
189 | printk(KERN_ERR "audit: %s\n", message); | |
1da177e4 LT |
190 | break; |
191 | case AUDIT_FAIL_PANIC: | |
b29ee87e EP |
192 | /* test audit_pid since printk is always losey, why bother? */ |
193 | if (audit_pid) | |
194 | panic("audit: %s\n", message); | |
1da177e4 LT |
195 | break; |
196 | } | |
197 | } | |
198 | ||
199 | static inline int audit_rate_check(void) | |
200 | { | |
201 | static unsigned long last_check = 0; | |
202 | static int messages = 0; | |
203 | static DEFINE_SPINLOCK(lock); | |
204 | unsigned long flags; | |
205 | unsigned long now; | |
206 | unsigned long elapsed; | |
207 | int retval = 0; | |
208 | ||
209 | if (!audit_rate_limit) return 1; | |
210 | ||
211 | spin_lock_irqsave(&lock, flags); | |
212 | if (++messages < audit_rate_limit) { | |
213 | retval = 1; | |
214 | } else { | |
215 | now = jiffies; | |
216 | elapsed = now - last_check; | |
217 | if (elapsed > HZ) { | |
218 | last_check = now; | |
219 | messages = 0; | |
220 | retval = 1; | |
221 | } | |
222 | } | |
223 | spin_unlock_irqrestore(&lock, flags); | |
224 | ||
225 | return retval; | |
226 | } | |
227 | ||
b0dd25a8 RD |
228 | /** |
229 | * audit_log_lost - conditionally log lost audit message event | |
230 | * @message: the message stating reason for lost audit message | |
231 | * | |
232 | * Emit at least 1 message per second, even if audit_rate_check is | |
233 | * throttling. | |
234 | * Always increment the lost messages counter. | |
235 | */ | |
1da177e4 LT |
236 | void audit_log_lost(const char *message) |
237 | { | |
238 | static unsigned long last_msg = 0; | |
239 | static DEFINE_SPINLOCK(lock); | |
240 | unsigned long flags; | |
241 | unsigned long now; | |
242 | int print; | |
243 | ||
244 | atomic_inc(&audit_lost); | |
245 | ||
246 | print = (audit_failure == AUDIT_FAIL_PANIC || !audit_rate_limit); | |
247 | ||
248 | if (!print) { | |
249 | spin_lock_irqsave(&lock, flags); | |
250 | now = jiffies; | |
251 | if (now - last_msg > HZ) { | |
252 | print = 1; | |
253 | last_msg = now; | |
254 | } | |
255 | spin_unlock_irqrestore(&lock, flags); | |
256 | } | |
257 | ||
258 | if (print) { | |
320f1b1e EP |
259 | if (printk_ratelimit()) |
260 | printk(KERN_WARNING | |
261 | "audit: audit_lost=%d audit_rate_limit=%d " | |
262 | "audit_backlog_limit=%d\n", | |
263 | atomic_read(&audit_lost), | |
264 | audit_rate_limit, | |
265 | audit_backlog_limit); | |
1da177e4 LT |
266 | audit_panic(message); |
267 | } | |
1da177e4 LT |
268 | } |
269 | ||
1a6b9f23 | 270 | static int audit_log_config_change(char *function_name, int new, int old, |
2532386f | 271 | int allow_changes) |
1da177e4 | 272 | { |
1a6b9f23 EP |
273 | struct audit_buffer *ab; |
274 | int rc = 0; | |
ce29b682 | 275 | |
1a6b9f23 | 276 | ab = audit_log_start(NULL, GFP_KERNEL, AUDIT_CONFIG_CHANGE); |
0644ec0c KC |
277 | if (unlikely(!ab)) |
278 | return rc; | |
4d3fb709 EP |
279 | audit_log_format(ab, "%s=%d old=%d", function_name, new, old); |
280 | audit_log_session_info(ab); | |
b122c376 EP |
281 | rc = audit_log_task_context(ab); |
282 | if (rc) | |
283 | allow_changes = 0; /* Something weird, deny request */ | |
1a6b9f23 EP |
284 | audit_log_format(ab, " res=%d", allow_changes); |
285 | audit_log_end(ab); | |
6a01b07f | 286 | return rc; |
1da177e4 LT |
287 | } |
288 | ||
dc9eb698 | 289 | static int audit_do_config_change(char *function_name, int *to_change, int new) |
1da177e4 | 290 | { |
1a6b9f23 | 291 | int allow_changes, rc = 0, old = *to_change; |
6a01b07f SG |
292 | |
293 | /* check if we are locked */ | |
1a6b9f23 EP |
294 | if (audit_enabled == AUDIT_LOCKED) |
295 | allow_changes = 0; | |
6a01b07f | 296 | else |
1a6b9f23 | 297 | allow_changes = 1; |
ce29b682 | 298 | |
1a6b9f23 | 299 | if (audit_enabled != AUDIT_OFF) { |
dc9eb698 | 300 | rc = audit_log_config_change(function_name, new, old, allow_changes); |
1a6b9f23 EP |
301 | if (rc) |
302 | allow_changes = 0; | |
6a01b07f | 303 | } |
6a01b07f SG |
304 | |
305 | /* If we are allowed, make the change */ | |
1a6b9f23 EP |
306 | if (allow_changes == 1) |
307 | *to_change = new; | |
6a01b07f SG |
308 | /* Not allowed, update reason */ |
309 | else if (rc == 0) | |
310 | rc = -EPERM; | |
311 | return rc; | |
1da177e4 LT |
312 | } |
313 | ||
dc9eb698 | 314 | static int audit_set_rate_limit(int limit) |
1da177e4 | 315 | { |
dc9eb698 | 316 | return audit_do_config_change("audit_rate_limit", &audit_rate_limit, limit); |
1a6b9f23 | 317 | } |
ce29b682 | 318 | |
dc9eb698 | 319 | static int audit_set_backlog_limit(int limit) |
1a6b9f23 | 320 | { |
dc9eb698 | 321 | return audit_do_config_change("audit_backlog_limit", &audit_backlog_limit, limit); |
1a6b9f23 | 322 | } |
6a01b07f | 323 | |
dc9eb698 | 324 | static int audit_set_enabled(int state) |
1a6b9f23 | 325 | { |
b593d384 | 326 | int rc; |
1a6b9f23 EP |
327 | if (state < AUDIT_OFF || state > AUDIT_LOCKED) |
328 | return -EINVAL; | |
6a01b07f | 329 | |
dc9eb698 | 330 | rc = audit_do_config_change("audit_enabled", &audit_enabled, state); |
b593d384 EP |
331 | if (!rc) |
332 | audit_ever_enabled |= !!state; | |
333 | ||
334 | return rc; | |
1da177e4 LT |
335 | } |
336 | ||
dc9eb698 | 337 | static int audit_set_failure(int state) |
1da177e4 | 338 | { |
1da177e4 LT |
339 | if (state != AUDIT_FAIL_SILENT |
340 | && state != AUDIT_FAIL_PRINTK | |
341 | && state != AUDIT_FAIL_PANIC) | |
342 | return -EINVAL; | |
ce29b682 | 343 | |
dc9eb698 | 344 | return audit_do_config_change("audit_failure", &audit_failure, state); |
1da177e4 LT |
345 | } |
346 | ||
f3d357b0 EP |
347 | /* |
348 | * Queue skbs to be sent to auditd when/if it comes back. These skbs should | |
349 | * already have been sent via prink/syslog and so if these messages are dropped | |
350 | * it is not a huge concern since we already passed the audit_log_lost() | |
351 | * notification and stuff. This is just nice to get audit messages during | |
352 | * boot before auditd is running or messages generated while auditd is stopped. | |
353 | * This only holds messages is audit_default is set, aka booting with audit=1 | |
354 | * or building your kernel that way. | |
355 | */ | |
356 | static void audit_hold_skb(struct sk_buff *skb) | |
357 | { | |
358 | if (audit_default && | |
359 | skb_queue_len(&audit_skb_hold_queue) < audit_backlog_limit) | |
360 | skb_queue_tail(&audit_skb_hold_queue, skb); | |
361 | else | |
362 | kfree_skb(skb); | |
363 | } | |
364 | ||
038cbcf6 EP |
365 | /* |
366 | * For one reason or another this nlh isn't getting delivered to the userspace | |
367 | * audit daemon, just send it to printk. | |
368 | */ | |
369 | static void audit_printk_skb(struct sk_buff *skb) | |
370 | { | |
371 | struct nlmsghdr *nlh = nlmsg_hdr(skb); | |
c64e66c6 | 372 | char *data = nlmsg_data(nlh); |
038cbcf6 EP |
373 | |
374 | if (nlh->nlmsg_type != AUDIT_EOE) { | |
375 | if (printk_ratelimit()) | |
376 | printk(KERN_NOTICE "type=%d %s\n", nlh->nlmsg_type, data); | |
377 | else | |
378 | audit_log_lost("printk limit exceeded\n"); | |
379 | } | |
380 | ||
381 | audit_hold_skb(skb); | |
382 | } | |
383 | ||
f3d357b0 EP |
384 | static void kauditd_send_skb(struct sk_buff *skb) |
385 | { | |
386 | int err; | |
387 | /* take a reference in case we can't send it and we want to hold it */ | |
388 | skb_get(skb); | |
15e47304 | 389 | err = netlink_unicast(audit_sock, skb, audit_nlk_portid, 0); |
f3d357b0 | 390 | if (err < 0) { |
c9404c9c | 391 | BUG_ON(err != -ECONNREFUSED); /* Shouldn't happen */ |
f3d357b0 | 392 | printk(KERN_ERR "audit: *NO* daemon at audit_pid=%d\n", audit_pid); |
9db3b9bc | 393 | audit_log_lost("auditd disappeared\n"); |
f3d357b0 EP |
394 | audit_pid = 0; |
395 | /* we might get lucky and get this in the next auditd */ | |
396 | audit_hold_skb(skb); | |
397 | } else | |
398 | /* drop the extra reference if sent ok */ | |
70d4bf6d | 399 | consume_skb(skb); |
f3d357b0 EP |
400 | } |
401 | ||
b551d1d9 RGB |
402 | /* |
403 | * flush_hold_queue - empty the hold queue if auditd appears | |
404 | * | |
405 | * If auditd just started, drain the queue of messages already | |
406 | * sent to syslog/printk. Remember loss here is ok. We already | |
407 | * called audit_log_lost() if it didn't go out normally. so the | |
408 | * race between the skb_dequeue and the next check for audit_pid | |
409 | * doesn't matter. | |
410 | * | |
411 | * If you ever find kauditd to be too slow we can get a perf win | |
412 | * by doing our own locking and keeping better track if there | |
413 | * are messages in this queue. I don't see the need now, but | |
414 | * in 5 years when I want to play with this again I'll see this | |
415 | * note and still have no friggin idea what i'm thinking today. | |
416 | */ | |
417 | static void flush_hold_queue(void) | |
b7d11258 DW |
418 | { |
419 | struct sk_buff *skb; | |
420 | ||
b551d1d9 RGB |
421 | if (!audit_default || !audit_pid) |
422 | return; | |
423 | ||
424 | skb = skb_dequeue(&audit_skb_hold_queue); | |
425 | if (likely(!skb)) | |
426 | return; | |
427 | ||
428 | while (skb && audit_pid) { | |
429 | kauditd_send_skb(skb); | |
430 | skb = skb_dequeue(&audit_skb_hold_queue); | |
431 | } | |
432 | ||
433 | /* | |
434 | * if auditd just disappeared but we | |
435 | * dequeued an skb we need to drop ref | |
436 | */ | |
437 | if (skb) | |
438 | consume_skb(skb); | |
439 | } | |
440 | ||
97a41e26 | 441 | static int kauditd_thread(void *dummy) |
b7d11258 | 442 | { |
83144186 | 443 | set_freezable(); |
4899b8b1 | 444 | while (!kthread_should_stop()) { |
3320c513 RGB |
445 | struct sk_buff *skb; |
446 | DECLARE_WAITQUEUE(wait, current); | |
447 | ||
b551d1d9 | 448 | flush_hold_queue(); |
f3d357b0 | 449 | |
b7d11258 | 450 | skb = skb_dequeue(&audit_skb_queue); |
9ad9ad38 | 451 | wake_up(&audit_backlog_wait); |
b7d11258 | 452 | if (skb) { |
f3d357b0 EP |
453 | if (audit_pid) |
454 | kauditd_send_skb(skb); | |
038cbcf6 EP |
455 | else |
456 | audit_printk_skb(skb); | |
3320c513 RGB |
457 | continue; |
458 | } | |
459 | set_current_state(TASK_INTERRUPTIBLE); | |
460 | add_wait_queue(&kauditd_wait, &wait); | |
b7d11258 | 461 | |
3320c513 RGB |
462 | if (!skb_queue_len(&audit_skb_queue)) { |
463 | try_to_freeze(); | |
464 | schedule(); | |
b7d11258 | 465 | } |
3320c513 RGB |
466 | |
467 | __set_current_state(TASK_RUNNING); | |
468 | remove_wait_queue(&kauditd_wait, &wait); | |
b7d11258 | 469 | } |
4899b8b1 | 470 | return 0; |
b7d11258 DW |
471 | } |
472 | ||
9044e6bc AV |
473 | int audit_send_list(void *_dest) |
474 | { | |
475 | struct audit_netlink_list *dest = _dest; | |
476 | int pid = dest->pid; | |
477 | struct sk_buff *skb; | |
478 | ||
479 | /* wait for parent to finish and send an ACK */ | |
f368c07d AG |
480 | mutex_lock(&audit_cmd_mutex); |
481 | mutex_unlock(&audit_cmd_mutex); | |
9044e6bc AV |
482 | |
483 | while ((skb = __skb_dequeue(&dest->q)) != NULL) | |
484 | netlink_unicast(audit_sock, skb, pid, 0); | |
485 | ||
486 | kfree(dest); | |
487 | ||
488 | return 0; | |
489 | } | |
490 | ||
491 | struct sk_buff *audit_make_reply(int pid, int seq, int type, int done, | |
b8800aa5 | 492 | int multi, const void *payload, int size) |
9044e6bc AV |
493 | { |
494 | struct sk_buff *skb; | |
495 | struct nlmsghdr *nlh; | |
9044e6bc AV |
496 | void *data; |
497 | int flags = multi ? NLM_F_MULTI : 0; | |
498 | int t = done ? NLMSG_DONE : type; | |
499 | ||
ee080e6c | 500 | skb = nlmsg_new(size, GFP_KERNEL); |
9044e6bc AV |
501 | if (!skb) |
502 | return NULL; | |
503 | ||
c64e66c6 DM |
504 | nlh = nlmsg_put(skb, pid, seq, t, size, flags); |
505 | if (!nlh) | |
506 | goto out_kfree_skb; | |
507 | data = nlmsg_data(nlh); | |
9044e6bc AV |
508 | memcpy(data, payload, size); |
509 | return skb; | |
510 | ||
c64e66c6 DM |
511 | out_kfree_skb: |
512 | kfree_skb(skb); | |
9044e6bc AV |
513 | return NULL; |
514 | } | |
515 | ||
f09ac9db EP |
516 | static int audit_send_reply_thread(void *arg) |
517 | { | |
518 | struct audit_reply *reply = (struct audit_reply *)arg; | |
519 | ||
520 | mutex_lock(&audit_cmd_mutex); | |
521 | mutex_unlock(&audit_cmd_mutex); | |
522 | ||
523 | /* Ignore failure. It'll only happen if the sender goes away, | |
524 | because our timeout is set to infinite. */ | |
525 | netlink_unicast(audit_sock, reply->skb, reply->pid, 0); | |
526 | kfree(reply); | |
527 | return 0; | |
528 | } | |
b0dd25a8 RD |
529 | /** |
530 | * audit_send_reply - send an audit reply message via netlink | |
531 | * @pid: process id to send reply to | |
532 | * @seq: sequence number | |
533 | * @type: audit message type | |
534 | * @done: done (last) flag | |
535 | * @multi: multi-part message flag | |
536 | * @payload: payload data | |
537 | * @size: payload size | |
538 | * | |
539 | * Allocates an skb, builds the netlink message, and sends it to the pid. | |
540 | * No failure notifications. | |
541 | */ | |
b8800aa5 SH |
542 | static void audit_send_reply(int pid, int seq, int type, int done, int multi, |
543 | const void *payload, int size) | |
1da177e4 | 544 | { |
f09ac9db EP |
545 | struct sk_buff *skb; |
546 | struct task_struct *tsk; | |
547 | struct audit_reply *reply = kmalloc(sizeof(struct audit_reply), | |
548 | GFP_KERNEL); | |
549 | ||
550 | if (!reply) | |
551 | return; | |
552 | ||
9044e6bc | 553 | skb = audit_make_reply(pid, seq, type, done, multi, payload, size); |
1da177e4 | 554 | if (!skb) |
fcaf1eb8 | 555 | goto out; |
f09ac9db EP |
556 | |
557 | reply->pid = pid; | |
558 | reply->skb = skb; | |
559 | ||
560 | tsk = kthread_run(audit_send_reply_thread, reply, "audit_send_reply"); | |
fcaf1eb8 AM |
561 | if (!IS_ERR(tsk)) |
562 | return; | |
563 | kfree_skb(skb); | |
564 | out: | |
565 | kfree(reply); | |
1da177e4 LT |
566 | } |
567 | ||
568 | /* | |
569 | * Check for appropriate CAP_AUDIT_ capabilities on incoming audit | |
570 | * control messages. | |
571 | */ | |
c7bdb545 | 572 | static int audit_netlink_ok(struct sk_buff *skb, u16 msg_type) |
1da177e4 LT |
573 | { |
574 | int err = 0; | |
575 | ||
34e36d8e EB |
576 | /* Only support the initial namespaces for now. */ |
577 | if ((current_user_ns() != &init_user_ns) || | |
578 | (task_active_pid_ns(current) != &init_pid_ns)) | |
579 | return -EPERM; | |
580 | ||
1da177e4 | 581 | switch (msg_type) { |
1da177e4 | 582 | case AUDIT_LIST: |
1da177e4 LT |
583 | case AUDIT_ADD: |
584 | case AUDIT_DEL: | |
18900909 EP |
585 | return -EOPNOTSUPP; |
586 | case AUDIT_GET: | |
587 | case AUDIT_SET: | |
588 | case AUDIT_LIST_RULES: | |
589 | case AUDIT_ADD_RULE: | |
93315ed6 | 590 | case AUDIT_DEL_RULE: |
c2f0c7c3 | 591 | case AUDIT_SIGNAL_INFO: |
522ed776 MT |
592 | case AUDIT_TTY_GET: |
593 | case AUDIT_TTY_SET: | |
74c3cbe3 AV |
594 | case AUDIT_TRIM: |
595 | case AUDIT_MAKE_EQUIV: | |
1141a455 | 596 | if (!netlink_capable(skb, CAP_AUDIT_CONTROL)) |
1da177e4 LT |
597 | err = -EPERM; |
598 | break; | |
05474106 | 599 | case AUDIT_USER: |
039b6b3e RD |
600 | case AUDIT_FIRST_USER_MSG ... AUDIT_LAST_USER_MSG: |
601 | case AUDIT_FIRST_USER_MSG2 ... AUDIT_LAST_USER_MSG2: | |
1141a455 | 602 | if (!netlink_capable(skb, CAP_AUDIT_WRITE)) |
1da177e4 LT |
603 | err = -EPERM; |
604 | break; | |
605 | default: /* bad msg */ | |
606 | err = -EINVAL; | |
607 | } | |
608 | ||
609 | return err; | |
610 | } | |
611 | ||
dc9eb698 | 612 | static int audit_log_common_recv_msg(struct audit_buffer **ab, u16 msg_type) |
50397bd1 EP |
613 | { |
614 | int rc = 0; | |
dc9eb698 | 615 | uid_t uid = from_kuid(&init_user_ns, current_uid()); |
50397bd1 | 616 | |
b1427212 | 617 | if (!audit_enabled && msg_type != AUDIT_USER_AVC) { |
50397bd1 EP |
618 | *ab = NULL; |
619 | return rc; | |
620 | } | |
621 | ||
622 | *ab = audit_log_start(NULL, GFP_KERNEL, msg_type); | |
0644ec0c KC |
623 | if (unlikely(!*ab)) |
624 | return rc; | |
4d3fb709 EP |
625 | audit_log_format(*ab, "pid=%d uid=%u", task_tgid_vnr(current), uid); |
626 | audit_log_session_info(*ab); | |
b122c376 | 627 | audit_log_task_context(*ab); |
50397bd1 EP |
628 | |
629 | return rc; | |
630 | } | |
631 | ||
1da177e4 LT |
632 | static int audit_receive_msg(struct sk_buff *skb, struct nlmsghdr *nlh) |
633 | { | |
dc9eb698 | 634 | u32 seq; |
1da177e4 LT |
635 | void *data; |
636 | struct audit_status *status_get, status_set; | |
637 | int err; | |
c0404993 | 638 | struct audit_buffer *ab; |
1da177e4 | 639 | u16 msg_type = nlh->nlmsg_type; |
e1396065 | 640 | struct audit_sig_info *sig_data; |
50397bd1 | 641 | char *ctx = NULL; |
e1396065 | 642 | u32 len; |
1da177e4 | 643 | |
c7bdb545 | 644 | err = audit_netlink_ok(skb, msg_type); |
1da177e4 LT |
645 | if (err) |
646 | return err; | |
647 | ||
b0dd25a8 RD |
648 | /* As soon as there's any sign of userspace auditd, |
649 | * start kauditd to talk to it */ | |
13f51e1c | 650 | if (!kauditd_task) { |
b7d11258 | 651 | kauditd_task = kthread_run(kauditd_thread, NULL, "kauditd"); |
13f51e1c G |
652 | if (IS_ERR(kauditd_task)) { |
653 | err = PTR_ERR(kauditd_task); | |
654 | kauditd_task = NULL; | |
655 | return err; | |
656 | } | |
b7d11258 | 657 | } |
1da177e4 | 658 | seq = nlh->nlmsg_seq; |
c64e66c6 | 659 | data = nlmsg_data(nlh); |
1da177e4 LT |
660 | |
661 | switch (msg_type) { | |
662 | case AUDIT_GET: | |
3dc7095c | 663 | status_set.mask = 0; |
1da177e4 LT |
664 | status_set.enabled = audit_enabled; |
665 | status_set.failure = audit_failure; | |
666 | status_set.pid = audit_pid; | |
667 | status_set.rate_limit = audit_rate_limit; | |
668 | status_set.backlog_limit = audit_backlog_limit; | |
669 | status_set.lost = atomic_read(&audit_lost); | |
b7d11258 | 670 | status_set.backlog = skb_queue_len(&audit_skb_queue); |
15e47304 | 671 | audit_send_reply(NETLINK_CB(skb).portid, seq, AUDIT_GET, 0, 0, |
1da177e4 LT |
672 | &status_set, sizeof(status_set)); |
673 | break; | |
674 | case AUDIT_SET: | |
d6770065 | 675 | if (nlmsg_len(nlh) < sizeof(struct audit_status)) |
1da177e4 LT |
676 | return -EINVAL; |
677 | status_get = (struct audit_status *)data; | |
678 | if (status_get->mask & AUDIT_STATUS_ENABLED) { | |
dc9eb698 | 679 | err = audit_set_enabled(status_get->enabled); |
20c6aaa3 | 680 | if (err < 0) |
681 | return err; | |
1da177e4 LT |
682 | } |
683 | if (status_get->mask & AUDIT_STATUS_FAILURE) { | |
dc9eb698 | 684 | err = audit_set_failure(status_get->failure); |
20c6aaa3 | 685 | if (err < 0) |
686 | return err; | |
1da177e4 LT |
687 | } |
688 | if (status_get->mask & AUDIT_STATUS_PID) { | |
1a6b9f23 EP |
689 | int new_pid = status_get->pid; |
690 | ||
691 | if (audit_enabled != AUDIT_OFF) | |
dc9eb698 | 692 | audit_log_config_change("audit_pid", new_pid, audit_pid, 1); |
1a6b9f23 | 693 | audit_pid = new_pid; |
15e47304 | 694 | audit_nlk_portid = NETLINK_CB(skb).portid; |
1da177e4 | 695 | } |
20c6aaa3 | 696 | if (status_get->mask & AUDIT_STATUS_RATE_LIMIT) { |
dc9eb698 | 697 | err = audit_set_rate_limit(status_get->rate_limit); |
20c6aaa3 | 698 | if (err < 0) |
699 | return err; | |
700 | } | |
1da177e4 | 701 | if (status_get->mask & AUDIT_STATUS_BACKLOG_LIMIT) |
dc9eb698 | 702 | err = audit_set_backlog_limit(status_get->backlog_limit); |
1da177e4 | 703 | break; |
05474106 | 704 | case AUDIT_USER: |
039b6b3e RD |
705 | case AUDIT_FIRST_USER_MSG ... AUDIT_LAST_USER_MSG: |
706 | case AUDIT_FIRST_USER_MSG2 ... AUDIT_LAST_USER_MSG2: | |
4a4cd633 DW |
707 | if (!audit_enabled && msg_type != AUDIT_USER_AVC) |
708 | return 0; | |
709 | ||
62062cf8 | 710 | err = audit_filter_user(msg_type); |
4a4cd633 DW |
711 | if (err == 1) { |
712 | err = 0; | |
522ed776 | 713 | if (msg_type == AUDIT_USER_TTY) { |
152f497b | 714 | err = tty_audit_push_current(); |
522ed776 MT |
715 | if (err) |
716 | break; | |
717 | } | |
dc9eb698 | 718 | audit_log_common_recv_msg(&ab, msg_type); |
50397bd1 EP |
719 | if (msg_type != AUDIT_USER_TTY) |
720 | audit_log_format(ab, " msg='%.1024s'", | |
721 | (char *)data); | |
722 | else { | |
723 | int size; | |
724 | ||
f7616102 | 725 | audit_log_format(ab, " data="); |
50397bd1 | 726 | size = nlmsg_len(nlh); |
55ad2f8d MT |
727 | if (size > 0 && |
728 | ((unsigned char *)data)[size - 1] == '\0') | |
729 | size--; | |
b556f8ad | 730 | audit_log_n_untrustedstring(ab, data, size); |
4a4cd633 | 731 | } |
aecdc33e | 732 | audit_set_pid(ab, NETLINK_CB(skb).portid); |
50397bd1 | 733 | audit_log_end(ab); |
0f45aa18 | 734 | } |
1da177e4 | 735 | break; |
93315ed6 AG |
736 | case AUDIT_ADD_RULE: |
737 | case AUDIT_DEL_RULE: | |
738 | if (nlmsg_len(nlh) < sizeof(struct audit_rule_data)) | |
739 | return -EINVAL; | |
1a6b9f23 | 740 | if (audit_enabled == AUDIT_LOCKED) { |
dc9eb698 EP |
741 | audit_log_common_recv_msg(&ab, AUDIT_CONFIG_CHANGE); |
742 | audit_log_format(ab, " audit_enabled=%d res=0", audit_enabled); | |
50397bd1 | 743 | audit_log_end(ab); |
6a01b07f SG |
744 | return -EPERM; |
745 | } | |
93315ed6 AG |
746 | /* fallthrough */ |
747 | case AUDIT_LIST_RULES: | |
15e47304 | 748 | err = audit_receive_filter(msg_type, NETLINK_CB(skb).portid, |
dc9eb698 | 749 | seq, data, nlmsg_len(nlh)); |
1da177e4 | 750 | break; |
74c3cbe3 AV |
751 | case AUDIT_TRIM: |
752 | audit_trim_trees(); | |
dc9eb698 | 753 | audit_log_common_recv_msg(&ab, AUDIT_CONFIG_CHANGE); |
74c3cbe3 AV |
754 | audit_log_format(ab, " op=trim res=1"); |
755 | audit_log_end(ab); | |
756 | break; | |
757 | case AUDIT_MAKE_EQUIV: { | |
758 | void *bufp = data; | |
759 | u32 sizes[2]; | |
7719e437 | 760 | size_t msglen = nlmsg_len(nlh); |
74c3cbe3 AV |
761 | char *old, *new; |
762 | ||
763 | err = -EINVAL; | |
7719e437 | 764 | if (msglen < 2 * sizeof(u32)) |
74c3cbe3 AV |
765 | break; |
766 | memcpy(sizes, bufp, 2 * sizeof(u32)); | |
767 | bufp += 2 * sizeof(u32); | |
7719e437 HH |
768 | msglen -= 2 * sizeof(u32); |
769 | old = audit_unpack_string(&bufp, &msglen, sizes[0]); | |
74c3cbe3 AV |
770 | if (IS_ERR(old)) { |
771 | err = PTR_ERR(old); | |
772 | break; | |
773 | } | |
7719e437 | 774 | new = audit_unpack_string(&bufp, &msglen, sizes[1]); |
74c3cbe3 AV |
775 | if (IS_ERR(new)) { |
776 | err = PTR_ERR(new); | |
777 | kfree(old); | |
778 | break; | |
779 | } | |
780 | /* OK, here comes... */ | |
781 | err = audit_tag_tree(old, new); | |
782 | ||
dc9eb698 | 783 | audit_log_common_recv_msg(&ab, AUDIT_CONFIG_CHANGE); |
50397bd1 | 784 | |
74c3cbe3 AV |
785 | audit_log_format(ab, " op=make_equiv old="); |
786 | audit_log_untrustedstring(ab, old); | |
787 | audit_log_format(ab, " new="); | |
788 | audit_log_untrustedstring(ab, new); | |
789 | audit_log_format(ab, " res=%d", !err); | |
790 | audit_log_end(ab); | |
791 | kfree(old); | |
792 | kfree(new); | |
793 | break; | |
794 | } | |
c2f0c7c3 | 795 | case AUDIT_SIGNAL_INFO: |
939cbf26 EP |
796 | len = 0; |
797 | if (audit_sig_sid) { | |
798 | err = security_secid_to_secctx(audit_sig_sid, &ctx, &len); | |
799 | if (err) | |
800 | return err; | |
801 | } | |
e1396065 AV |
802 | sig_data = kmalloc(sizeof(*sig_data) + len, GFP_KERNEL); |
803 | if (!sig_data) { | |
939cbf26 EP |
804 | if (audit_sig_sid) |
805 | security_release_secctx(ctx, len); | |
e1396065 AV |
806 | return -ENOMEM; |
807 | } | |
cca080d9 | 808 | sig_data->uid = from_kuid(&init_user_ns, audit_sig_uid); |
e1396065 | 809 | sig_data->pid = audit_sig_pid; |
939cbf26 EP |
810 | if (audit_sig_sid) { |
811 | memcpy(sig_data->ctx, ctx, len); | |
812 | security_release_secctx(ctx, len); | |
813 | } | |
15e47304 | 814 | audit_send_reply(NETLINK_CB(skb).portid, seq, AUDIT_SIGNAL_INFO, |
e1396065 AV |
815 | 0, 0, sig_data, sizeof(*sig_data) + len); |
816 | kfree(sig_data); | |
c2f0c7c3 | 817 | break; |
522ed776 MT |
818 | case AUDIT_TTY_GET: { |
819 | struct audit_tty_status s; | |
8aa14b64 EB |
820 | struct task_struct *tsk = current; |
821 | ||
7173c54e | 822 | spin_lock(&tsk->sighand->siglock); |
8aa14b64 | 823 | s.enabled = tsk->signal->audit_tty != 0; |
46e959ea | 824 | s.log_passwd = tsk->signal->audit_tty_log_passwd; |
7173c54e | 825 | spin_unlock(&tsk->sighand->siglock); |
8aa14b64 | 826 | |
aecdc33e | 827 | audit_send_reply(NETLINK_CB(skb).portid, seq, |
8aa14b64 | 828 | AUDIT_TTY_GET, 0, 0, &s, sizeof(s)); |
522ed776 MT |
829 | break; |
830 | } | |
831 | case AUDIT_TTY_SET: { | |
46e959ea | 832 | struct audit_tty_status s; |
8aa14b64 | 833 | struct task_struct *tsk = current; |
522ed776 | 834 | |
46e959ea RGB |
835 | memset(&s, 0, sizeof(s)); |
836 | /* guard against past and future API changes */ | |
d6770065 | 837 | memcpy(&s, data, min_t(size_t, sizeof(s), nlmsg_len(nlh))); |
46e959ea RGB |
838 | if ((s.enabled != 0 && s.enabled != 1) || |
839 | (s.log_passwd != 0 && s.log_passwd != 1)) | |
522ed776 | 840 | return -EINVAL; |
8aa14b64 | 841 | |
7173c54e | 842 | spin_lock(&tsk->sighand->siglock); |
46e959ea RGB |
843 | tsk->signal->audit_tty = s.enabled; |
844 | tsk->signal->audit_tty_log_passwd = s.log_passwd; | |
7173c54e | 845 | spin_unlock(&tsk->sighand->siglock); |
522ed776 MT |
846 | break; |
847 | } | |
1da177e4 LT |
848 | default: |
849 | err = -EINVAL; | |
850 | break; | |
851 | } | |
852 | ||
853 | return err < 0 ? err : 0; | |
854 | } | |
855 | ||
b0dd25a8 | 856 | /* |
ea7ae60b EP |
857 | * Get message from skb. Each message is processed by audit_receive_msg. |
858 | * Malformed skbs with wrong length are discarded silently. | |
b0dd25a8 | 859 | */ |
2a0a6ebe | 860 | static void audit_receive_skb(struct sk_buff *skb) |
1da177e4 | 861 | { |
ea7ae60b EP |
862 | struct nlmsghdr *nlh; |
863 | /* | |
94191213 | 864 | * len MUST be signed for nlmsg_next to be able to dec it below 0 |
ea7ae60b EP |
865 | * if the nlmsg_len was not aligned |
866 | */ | |
867 | int len; | |
868 | int err; | |
869 | ||
870 | nlh = nlmsg_hdr(skb); | |
871 | len = skb->len; | |
872 | ||
94191213 | 873 | while (nlmsg_ok(nlh, len)) { |
ea7ae60b EP |
874 | err = audit_receive_msg(skb, nlh); |
875 | /* if err or if this message says it wants a response */ | |
876 | if (err || (nlh->nlmsg_flags & NLM_F_ACK)) | |
1da177e4 | 877 | netlink_ack(skb, nlh, err); |
ea7ae60b | 878 | |
2851da57 | 879 | nlh = nlmsg_next(nlh, &len); |
1da177e4 | 880 | } |
1da177e4 LT |
881 | } |
882 | ||
883 | /* Receive messages from netlink socket. */ | |
cd40b7d3 | 884 | static void audit_receive(struct sk_buff *skb) |
1da177e4 | 885 | { |
f368c07d | 886 | mutex_lock(&audit_cmd_mutex); |
cd40b7d3 | 887 | audit_receive_skb(skb); |
f368c07d | 888 | mutex_unlock(&audit_cmd_mutex); |
1da177e4 LT |
889 | } |
890 | ||
1da177e4 LT |
891 | /* Initialize audit support at boot time. */ |
892 | static int __init audit_init(void) | |
893 | { | |
f368c07d | 894 | int i; |
a31f2d17 PNA |
895 | struct netlink_kernel_cfg cfg = { |
896 | .input = audit_receive, | |
897 | }; | |
f368c07d | 898 | |
a3f07114 EP |
899 | if (audit_initialized == AUDIT_DISABLED) |
900 | return 0; | |
901 | ||
1da177e4 LT |
902 | printk(KERN_INFO "audit: initializing netlink socket (%s)\n", |
903 | audit_default ? "enabled" : "disabled"); | |
9f00d977 | 904 | audit_sock = netlink_kernel_create(&init_net, NETLINK_AUDIT, &cfg); |
1da177e4 LT |
905 | if (!audit_sock) |
906 | audit_panic("cannot initialize netlink socket"); | |
71e1c784 AG |
907 | else |
908 | audit_sock->sk_sndtimeo = MAX_SCHEDULE_TIMEOUT; | |
1da177e4 | 909 | |
b7d11258 | 910 | skb_queue_head_init(&audit_skb_queue); |
f3d357b0 | 911 | skb_queue_head_init(&audit_skb_hold_queue); |
a3f07114 | 912 | audit_initialized = AUDIT_INITIALIZED; |
1da177e4 | 913 | audit_enabled = audit_default; |
b593d384 | 914 | audit_ever_enabled |= !!audit_default; |
3dc7e315 | 915 | |
9ad9ad38 | 916 | audit_log(NULL, GFP_KERNEL, AUDIT_KERNEL, "initialized"); |
f368c07d | 917 | |
f368c07d AG |
918 | for (i = 0; i < AUDIT_INODE_BUCKETS; i++) |
919 | INIT_LIST_HEAD(&audit_inode_hash[i]); | |
f368c07d | 920 | |
1da177e4 LT |
921 | return 0; |
922 | } | |
1da177e4 LT |
923 | __initcall(audit_init); |
924 | ||
925 | /* Process kernel command-line parameter at boot time. audit=0 or audit=1. */ | |
926 | static int __init audit_enable(char *str) | |
927 | { | |
928 | audit_default = !!simple_strtol(str, NULL, 0); | |
a3f07114 EP |
929 | if (!audit_default) |
930 | audit_initialized = AUDIT_DISABLED; | |
931 | ||
932 | printk(KERN_INFO "audit: %s", audit_default ? "enabled" : "disabled"); | |
933 | ||
934 | if (audit_initialized == AUDIT_INITIALIZED) { | |
1da177e4 | 935 | audit_enabled = audit_default; |
b593d384 | 936 | audit_ever_enabled |= !!audit_default; |
a3f07114 EP |
937 | } else if (audit_initialized == AUDIT_UNINITIALIZED) { |
938 | printk(" (after initialization)"); | |
939 | } else { | |
940 | printk(" (until reboot)"); | |
b593d384 | 941 | } |
a3f07114 EP |
942 | printk("\n"); |
943 | ||
9b41046c | 944 | return 1; |
1da177e4 LT |
945 | } |
946 | ||
947 | __setup("audit=", audit_enable); | |
948 | ||
16e1904e CW |
949 | static void audit_buffer_free(struct audit_buffer *ab) |
950 | { | |
951 | unsigned long flags; | |
952 | ||
8fc6115c CW |
953 | if (!ab) |
954 | return; | |
955 | ||
5ac52f33 CW |
956 | if (ab->skb) |
957 | kfree_skb(ab->skb); | |
b7d11258 | 958 | |
16e1904e | 959 | spin_lock_irqsave(&audit_freelist_lock, flags); |
5d136a01 | 960 | if (audit_freelist_count > AUDIT_MAXFREE) |
16e1904e | 961 | kfree(ab); |
5d136a01 SH |
962 | else { |
963 | audit_freelist_count++; | |
16e1904e | 964 | list_add(&ab->list, &audit_freelist); |
5d136a01 | 965 | } |
16e1904e CW |
966 | spin_unlock_irqrestore(&audit_freelist_lock, flags); |
967 | } | |
968 | ||
c0404993 | 969 | static struct audit_buffer * audit_buffer_alloc(struct audit_context *ctx, |
dd0fc66f | 970 | gfp_t gfp_mask, int type) |
16e1904e CW |
971 | { |
972 | unsigned long flags; | |
973 | struct audit_buffer *ab = NULL; | |
c0404993 | 974 | struct nlmsghdr *nlh; |
16e1904e CW |
975 | |
976 | spin_lock_irqsave(&audit_freelist_lock, flags); | |
977 | if (!list_empty(&audit_freelist)) { | |
978 | ab = list_entry(audit_freelist.next, | |
979 | struct audit_buffer, list); | |
980 | list_del(&ab->list); | |
981 | --audit_freelist_count; | |
982 | } | |
983 | spin_unlock_irqrestore(&audit_freelist_lock, flags); | |
984 | ||
985 | if (!ab) { | |
4332bdd3 | 986 | ab = kmalloc(sizeof(*ab), gfp_mask); |
16e1904e | 987 | if (!ab) |
8fc6115c | 988 | goto err; |
16e1904e | 989 | } |
8fc6115c | 990 | |
b7d11258 | 991 | ab->ctx = ctx; |
9ad9ad38 | 992 | ab->gfp_mask = gfp_mask; |
ee080e6c EP |
993 | |
994 | ab->skb = nlmsg_new(AUDIT_BUFSIZ, gfp_mask); | |
995 | if (!ab->skb) | |
c64e66c6 | 996 | goto err; |
ee080e6c | 997 | |
c64e66c6 DM |
998 | nlh = nlmsg_put(ab->skb, 0, 0, type, 0, 0); |
999 | if (!nlh) | |
1000 | goto out_kfree_skb; | |
ee080e6c | 1001 | |
16e1904e | 1002 | return ab; |
ee080e6c | 1003 | |
c64e66c6 | 1004 | out_kfree_skb: |
ee080e6c EP |
1005 | kfree_skb(ab->skb); |
1006 | ab->skb = NULL; | |
8fc6115c CW |
1007 | err: |
1008 | audit_buffer_free(ab); | |
1009 | return NULL; | |
16e1904e | 1010 | } |
1da177e4 | 1011 | |
b0dd25a8 RD |
1012 | /** |
1013 | * audit_serial - compute a serial number for the audit record | |
1014 | * | |
1015 | * Compute a serial number for the audit record. Audit records are | |
bfb4496e DW |
1016 | * written to user-space as soon as they are generated, so a complete |
1017 | * audit record may be written in several pieces. The timestamp of the | |
1018 | * record and this serial number are used by the user-space tools to | |
1019 | * determine which pieces belong to the same audit record. The | |
1020 | * (timestamp,serial) tuple is unique for each syscall and is live from | |
1021 | * syscall entry to syscall exit. | |
1022 | * | |
bfb4496e DW |
1023 | * NOTE: Another possibility is to store the formatted records off the |
1024 | * audit context (for those records that have a context), and emit them | |
1025 | * all at syscall exit. However, this could delay the reporting of | |
1026 | * significant errors until syscall exit (or never, if the system | |
b0dd25a8 RD |
1027 | * halts). |
1028 | */ | |
bfb4496e DW |
1029 | unsigned int audit_serial(void) |
1030 | { | |
34af946a | 1031 | static DEFINE_SPINLOCK(serial_lock); |
d5b454f2 DW |
1032 | static unsigned int serial = 0; |
1033 | ||
1034 | unsigned long flags; | |
1035 | unsigned int ret; | |
bfb4496e | 1036 | |
d5b454f2 | 1037 | spin_lock_irqsave(&serial_lock, flags); |
bfb4496e | 1038 | do { |
ce625a80 DW |
1039 | ret = ++serial; |
1040 | } while (unlikely(!ret)); | |
d5b454f2 | 1041 | spin_unlock_irqrestore(&serial_lock, flags); |
bfb4496e | 1042 | |
d5b454f2 | 1043 | return ret; |
bfb4496e DW |
1044 | } |
1045 | ||
5600b892 | 1046 | static inline void audit_get_stamp(struct audit_context *ctx, |
bfb4496e DW |
1047 | struct timespec *t, unsigned int *serial) |
1048 | { | |
48887e63 | 1049 | if (!ctx || !auditsc_get_stamp(ctx, t, serial)) { |
bfb4496e DW |
1050 | *t = CURRENT_TIME; |
1051 | *serial = audit_serial(); | |
1052 | } | |
1053 | } | |
1054 | ||
82919919 AM |
1055 | /* |
1056 | * Wait for auditd to drain the queue a little | |
1057 | */ | |
1058 | static void wait_for_auditd(unsigned long sleep_time) | |
1059 | { | |
1060 | DECLARE_WAITQUEUE(wait, current); | |
f000cfdd | 1061 | set_current_state(TASK_UNINTERRUPTIBLE); |
82919919 AM |
1062 | add_wait_queue(&audit_backlog_wait, &wait); |
1063 | ||
1064 | if (audit_backlog_limit && | |
1065 | skb_queue_len(&audit_skb_queue) > audit_backlog_limit) | |
1066 | schedule_timeout(sleep_time); | |
1067 | ||
1068 | __set_current_state(TASK_RUNNING); | |
1069 | remove_wait_queue(&audit_backlog_wait, &wait); | |
1070 | } | |
1071 | ||
1da177e4 LT |
1072 | /* Obtain an audit buffer. This routine does locking to obtain the |
1073 | * audit buffer, but then no locking is required for calls to | |
1074 | * audit_log_*format. If the tsk is a task that is currently in a | |
1075 | * syscall, then the syscall is marked as auditable and an audit record | |
1076 | * will be written at syscall exit. If there is no associated task, tsk | |
1077 | * should be NULL. */ | |
9ad9ad38 | 1078 | |
b0dd25a8 RD |
1079 | /** |
1080 | * audit_log_start - obtain an audit buffer | |
1081 | * @ctx: audit_context (may be NULL) | |
1082 | * @gfp_mask: type of allocation | |
1083 | * @type: audit message type | |
1084 | * | |
1085 | * Returns audit_buffer pointer on success or NULL on error. | |
1086 | * | |
1087 | * Obtain an audit buffer. This routine does locking to obtain the | |
1088 | * audit buffer, but then no locking is required for calls to | |
1089 | * audit_log_*format. If the task (ctx) is a task that is currently in a | |
1090 | * syscall, then the syscall is marked as auditable and an audit record | |
1091 | * will be written at syscall exit. If there is no associated task, then | |
1092 | * task context (ctx) should be NULL. | |
1093 | */ | |
9796fdd8 | 1094 | struct audit_buffer *audit_log_start(struct audit_context *ctx, gfp_t gfp_mask, |
9ad9ad38 | 1095 | int type) |
1da177e4 LT |
1096 | { |
1097 | struct audit_buffer *ab = NULL; | |
1da177e4 | 1098 | struct timespec t; |
ef00be05 | 1099 | unsigned int uninitialized_var(serial); |
9ad9ad38 | 1100 | int reserve; |
ac4cec44 | 1101 | unsigned long timeout_start = jiffies; |
1da177e4 | 1102 | |
a3f07114 | 1103 | if (audit_initialized != AUDIT_INITIALIZED) |
1da177e4 LT |
1104 | return NULL; |
1105 | ||
c8edc80c DK |
1106 | if (unlikely(audit_filter_type(type))) |
1107 | return NULL; | |
1108 | ||
9ad9ad38 DW |
1109 | if (gfp_mask & __GFP_WAIT) |
1110 | reserve = 0; | |
1111 | else | |
5600b892 | 1112 | reserve = 5; /* Allow atomic callers to go up to five |
9ad9ad38 DW |
1113 | entries over the normal backlog limit */ |
1114 | ||
1115 | while (audit_backlog_limit | |
1116 | && skb_queue_len(&audit_skb_queue) > audit_backlog_limit + reserve) { | |
82919919 AM |
1117 | if (gfp_mask & __GFP_WAIT && audit_backlog_wait_time) { |
1118 | unsigned long sleep_time; | |
9ad9ad38 | 1119 | |
82919919 AM |
1120 | sleep_time = timeout_start + audit_backlog_wait_time - |
1121 | jiffies; | |
3ed3690e | 1122 | if ((long)sleep_time > 0) { |
82919919 | 1123 | wait_for_auditd(sleep_time); |
3ed3690e KK |
1124 | continue; |
1125 | } | |
9ad9ad38 | 1126 | } |
320f1b1e | 1127 | if (audit_rate_check() && printk_ratelimit()) |
fb19b4c6 DW |
1128 | printk(KERN_WARNING |
1129 | "audit: audit_backlog=%d > " | |
1130 | "audit_backlog_limit=%d\n", | |
1131 | skb_queue_len(&audit_skb_queue), | |
1132 | audit_backlog_limit); | |
1133 | audit_log_lost("backlog limit exceeded"); | |
ac4cec44 DW |
1134 | audit_backlog_wait_time = audit_backlog_wait_overflow; |
1135 | wake_up(&audit_backlog_wait); | |
fb19b4c6 DW |
1136 | return NULL; |
1137 | } | |
1138 | ||
34210bee RGB |
1139 | audit_backlog_wait_time = AUDIT_BACKLOG_WAIT_TIME; |
1140 | ||
9ad9ad38 | 1141 | ab = audit_buffer_alloc(ctx, gfp_mask, type); |
1da177e4 LT |
1142 | if (!ab) { |
1143 | audit_log_lost("out of memory in audit_log_start"); | |
1144 | return NULL; | |
1145 | } | |
1146 | ||
bfb4496e | 1147 | audit_get_stamp(ab->ctx, &t, &serial); |
197c69c6 | 1148 | |
1da177e4 LT |
1149 | audit_log_format(ab, "audit(%lu.%03lu:%u): ", |
1150 | t.tv_sec, t.tv_nsec/1000000, serial); | |
1151 | return ab; | |
1152 | } | |
1153 | ||
8fc6115c | 1154 | /** |
5ac52f33 | 1155 | * audit_expand - expand skb in the audit buffer |
8fc6115c | 1156 | * @ab: audit_buffer |
b0dd25a8 | 1157 | * @extra: space to add at tail of the skb |
8fc6115c CW |
1158 | * |
1159 | * Returns 0 (no space) on failed expansion, or available space if | |
1160 | * successful. | |
1161 | */ | |
e3b926b4 | 1162 | static inline int audit_expand(struct audit_buffer *ab, int extra) |
8fc6115c | 1163 | { |
5ac52f33 | 1164 | struct sk_buff *skb = ab->skb; |
406a1d86 HX |
1165 | int oldtail = skb_tailroom(skb); |
1166 | int ret = pskb_expand_head(skb, 0, extra, ab->gfp_mask); | |
1167 | int newtail = skb_tailroom(skb); | |
1168 | ||
5ac52f33 CW |
1169 | if (ret < 0) { |
1170 | audit_log_lost("out of memory in audit_expand"); | |
8fc6115c | 1171 | return 0; |
5ac52f33 | 1172 | } |
406a1d86 HX |
1173 | |
1174 | skb->truesize += newtail - oldtail; | |
1175 | return newtail; | |
8fc6115c | 1176 | } |
1da177e4 | 1177 | |
b0dd25a8 RD |
1178 | /* |
1179 | * Format an audit message into the audit buffer. If there isn't enough | |
1da177e4 LT |
1180 | * room in the audit buffer, more room will be allocated and vsnprint |
1181 | * will be called a second time. Currently, we assume that a printk | |
b0dd25a8 RD |
1182 | * can't format message larger than 1024 bytes, so we don't either. |
1183 | */ | |
1da177e4 LT |
1184 | static void audit_log_vformat(struct audit_buffer *ab, const char *fmt, |
1185 | va_list args) | |
1186 | { | |
1187 | int len, avail; | |
5ac52f33 | 1188 | struct sk_buff *skb; |
eecb0a73 | 1189 | va_list args2; |
1da177e4 LT |
1190 | |
1191 | if (!ab) | |
1192 | return; | |
1193 | ||
5ac52f33 CW |
1194 | BUG_ON(!ab->skb); |
1195 | skb = ab->skb; | |
1196 | avail = skb_tailroom(skb); | |
1197 | if (avail == 0) { | |
e3b926b4 | 1198 | avail = audit_expand(ab, AUDIT_BUFSIZ); |
8fc6115c CW |
1199 | if (!avail) |
1200 | goto out; | |
1da177e4 | 1201 | } |
eecb0a73 | 1202 | va_copy(args2, args); |
27a884dc | 1203 | len = vsnprintf(skb_tail_pointer(skb), avail, fmt, args); |
1da177e4 LT |
1204 | if (len >= avail) { |
1205 | /* The printk buffer is 1024 bytes long, so if we get | |
1206 | * here and AUDIT_BUFSIZ is at least 1024, then we can | |
1207 | * log everything that printk could have logged. */ | |
b0dd25a8 RD |
1208 | avail = audit_expand(ab, |
1209 | max_t(unsigned, AUDIT_BUFSIZ, 1+len-avail)); | |
8fc6115c | 1210 | if (!avail) |
a0e86bd4 | 1211 | goto out_va_end; |
27a884dc | 1212 | len = vsnprintf(skb_tail_pointer(skb), avail, fmt, args2); |
1da177e4 | 1213 | } |
168b7173 SG |
1214 | if (len > 0) |
1215 | skb_put(skb, len); | |
a0e86bd4 JJ |
1216 | out_va_end: |
1217 | va_end(args2); | |
8fc6115c CW |
1218 | out: |
1219 | return; | |
1da177e4 LT |
1220 | } |
1221 | ||
b0dd25a8 RD |
1222 | /** |
1223 | * audit_log_format - format a message into the audit buffer. | |
1224 | * @ab: audit_buffer | |
1225 | * @fmt: format string | |
1226 | * @...: optional parameters matching @fmt string | |
1227 | * | |
1228 | * All the work is done in audit_log_vformat. | |
1229 | */ | |
1da177e4 LT |
1230 | void audit_log_format(struct audit_buffer *ab, const char *fmt, ...) |
1231 | { | |
1232 | va_list args; | |
1233 | ||
1234 | if (!ab) | |
1235 | return; | |
1236 | va_start(args, fmt); | |
1237 | audit_log_vformat(ab, fmt, args); | |
1238 | va_end(args); | |
1239 | } | |
1240 | ||
b0dd25a8 RD |
1241 | /** |
1242 | * audit_log_hex - convert a buffer to hex and append it to the audit skb | |
1243 | * @ab: the audit_buffer | |
1244 | * @buf: buffer to convert to hex | |
1245 | * @len: length of @buf to be converted | |
1246 | * | |
1247 | * No return value; failure to expand is silently ignored. | |
1248 | * | |
1249 | * This function will take the passed buf and convert it into a string of | |
1250 | * ascii hex digits. The new string is placed onto the skb. | |
1251 | */ | |
b556f8ad | 1252 | void audit_log_n_hex(struct audit_buffer *ab, const unsigned char *buf, |
168b7173 | 1253 | size_t len) |
83c7d091 | 1254 | { |
168b7173 SG |
1255 | int i, avail, new_len; |
1256 | unsigned char *ptr; | |
1257 | struct sk_buff *skb; | |
1258 | static const unsigned char *hex = "0123456789ABCDEF"; | |
1259 | ||
8ef2d304 AG |
1260 | if (!ab) |
1261 | return; | |
1262 | ||
168b7173 SG |
1263 | BUG_ON(!ab->skb); |
1264 | skb = ab->skb; | |
1265 | avail = skb_tailroom(skb); | |
1266 | new_len = len<<1; | |
1267 | if (new_len >= avail) { | |
1268 | /* Round the buffer request up to the next multiple */ | |
1269 | new_len = AUDIT_BUFSIZ*(((new_len-avail)/AUDIT_BUFSIZ) + 1); | |
1270 | avail = audit_expand(ab, new_len); | |
1271 | if (!avail) | |
1272 | return; | |
1273 | } | |
83c7d091 | 1274 | |
27a884dc | 1275 | ptr = skb_tail_pointer(skb); |
168b7173 SG |
1276 | for (i=0; i<len; i++) { |
1277 | *ptr++ = hex[(buf[i] & 0xF0)>>4]; /* Upper nibble */ | |
1278 | *ptr++ = hex[buf[i] & 0x0F]; /* Lower nibble */ | |
1279 | } | |
1280 | *ptr = 0; | |
1281 | skb_put(skb, len << 1); /* new string is twice the old string */ | |
83c7d091 DW |
1282 | } |
1283 | ||
9c937dcc AG |
1284 | /* |
1285 | * Format a string of no more than slen characters into the audit buffer, | |
1286 | * enclosed in quote marks. | |
1287 | */ | |
b556f8ad EP |
1288 | void audit_log_n_string(struct audit_buffer *ab, const char *string, |
1289 | size_t slen) | |
9c937dcc AG |
1290 | { |
1291 | int avail, new_len; | |
1292 | unsigned char *ptr; | |
1293 | struct sk_buff *skb; | |
1294 | ||
8ef2d304 AG |
1295 | if (!ab) |
1296 | return; | |
1297 | ||
9c937dcc AG |
1298 | BUG_ON(!ab->skb); |
1299 | skb = ab->skb; | |
1300 | avail = skb_tailroom(skb); | |
1301 | new_len = slen + 3; /* enclosing quotes + null terminator */ | |
1302 | if (new_len > avail) { | |
1303 | avail = audit_expand(ab, new_len); | |
1304 | if (!avail) | |
1305 | return; | |
1306 | } | |
27a884dc | 1307 | ptr = skb_tail_pointer(skb); |
9c937dcc AG |
1308 | *ptr++ = '"'; |
1309 | memcpy(ptr, string, slen); | |
1310 | ptr += slen; | |
1311 | *ptr++ = '"'; | |
1312 | *ptr = 0; | |
1313 | skb_put(skb, slen + 2); /* don't include null terminator */ | |
1314 | } | |
1315 | ||
de6bbd1d EP |
1316 | /** |
1317 | * audit_string_contains_control - does a string need to be logged in hex | |
f706d5d2 DJ |
1318 | * @string: string to be checked |
1319 | * @len: max length of the string to check | |
de6bbd1d EP |
1320 | */ |
1321 | int audit_string_contains_control(const char *string, size_t len) | |
1322 | { | |
1323 | const unsigned char *p; | |
b3897f56 | 1324 | for (p = string; p < (const unsigned char *)string + len; p++) { |
1d6c9649 | 1325 | if (*p == '"' || *p < 0x21 || *p > 0x7e) |
de6bbd1d EP |
1326 | return 1; |
1327 | } | |
1328 | return 0; | |
1329 | } | |
1330 | ||
b0dd25a8 | 1331 | /** |
522ed776 | 1332 | * audit_log_n_untrustedstring - log a string that may contain random characters |
b0dd25a8 | 1333 | * @ab: audit_buffer |
f706d5d2 | 1334 | * @len: length of string (not including trailing null) |
b0dd25a8 RD |
1335 | * @string: string to be logged |
1336 | * | |
1337 | * This code will escape a string that is passed to it if the string | |
1338 | * contains a control character, unprintable character, double quote mark, | |
168b7173 | 1339 | * or a space. Unescaped strings will start and end with a double quote mark. |
b0dd25a8 | 1340 | * Strings that are escaped are printed in hex (2 digits per char). |
9c937dcc AG |
1341 | * |
1342 | * The caller specifies the number of characters in the string to log, which may | |
1343 | * or may not be the entire string. | |
b0dd25a8 | 1344 | */ |
b556f8ad EP |
1345 | void audit_log_n_untrustedstring(struct audit_buffer *ab, const char *string, |
1346 | size_t len) | |
83c7d091 | 1347 | { |
de6bbd1d | 1348 | if (audit_string_contains_control(string, len)) |
b556f8ad | 1349 | audit_log_n_hex(ab, string, len); |
de6bbd1d | 1350 | else |
b556f8ad | 1351 | audit_log_n_string(ab, string, len); |
83c7d091 DW |
1352 | } |
1353 | ||
9c937dcc | 1354 | /** |
522ed776 | 1355 | * audit_log_untrustedstring - log a string that may contain random characters |
9c937dcc AG |
1356 | * @ab: audit_buffer |
1357 | * @string: string to be logged | |
1358 | * | |
522ed776 | 1359 | * Same as audit_log_n_untrustedstring(), except that strlen is used to |
9c937dcc AG |
1360 | * determine string length. |
1361 | */ | |
de6bbd1d | 1362 | void audit_log_untrustedstring(struct audit_buffer *ab, const char *string) |
9c937dcc | 1363 | { |
b556f8ad | 1364 | audit_log_n_untrustedstring(ab, string, strlen(string)); |
9c937dcc AG |
1365 | } |
1366 | ||
168b7173 | 1367 | /* This is a helper-function to print the escaped d_path */ |
1da177e4 | 1368 | void audit_log_d_path(struct audit_buffer *ab, const char *prefix, |
66b3fad3 | 1369 | const struct path *path) |
1da177e4 | 1370 | { |
44707fdf | 1371 | char *p, *pathname; |
1da177e4 | 1372 | |
8fc6115c | 1373 | if (prefix) |
c158a35c | 1374 | audit_log_format(ab, "%s", prefix); |
1da177e4 | 1375 | |
168b7173 | 1376 | /* We will allow 11 spaces for ' (deleted)' to be appended */ |
44707fdf JB |
1377 | pathname = kmalloc(PATH_MAX+11, ab->gfp_mask); |
1378 | if (!pathname) { | |
def57543 | 1379 | audit_log_string(ab, "<no_memory>"); |
168b7173 | 1380 | return; |
1da177e4 | 1381 | } |
cf28b486 | 1382 | p = d_path(path, pathname, PATH_MAX+11); |
168b7173 SG |
1383 | if (IS_ERR(p)) { /* Should never happen since we send PATH_MAX */ |
1384 | /* FIXME: can we save some information here? */ | |
def57543 | 1385 | audit_log_string(ab, "<too_long>"); |
5600b892 | 1386 | } else |
168b7173 | 1387 | audit_log_untrustedstring(ab, p); |
44707fdf | 1388 | kfree(pathname); |
1da177e4 LT |
1389 | } |
1390 | ||
4d3fb709 EP |
1391 | void audit_log_session_info(struct audit_buffer *ab) |
1392 | { | |
1393 | u32 sessionid = audit_get_sessionid(current); | |
1394 | uid_t auid = from_kuid(&init_user_ns, audit_get_loginuid(current)); | |
1395 | ||
2a0b4be6 | 1396 | audit_log_format(ab, " auid=%u ses=%u\n", auid, sessionid); |
4d3fb709 EP |
1397 | } |
1398 | ||
9d960985 EP |
1399 | void audit_log_key(struct audit_buffer *ab, char *key) |
1400 | { | |
1401 | audit_log_format(ab, " key="); | |
1402 | if (key) | |
1403 | audit_log_untrustedstring(ab, key); | |
1404 | else | |
1405 | audit_log_format(ab, "(null)"); | |
1406 | } | |
1407 | ||
b24a30a7 EP |
1408 | void audit_log_cap(struct audit_buffer *ab, char *prefix, kernel_cap_t *cap) |
1409 | { | |
1410 | int i; | |
1411 | ||
1412 | audit_log_format(ab, " %s=", prefix); | |
1413 | CAP_FOR_EACH_U32(i) { | |
1414 | audit_log_format(ab, "%08x", | |
76f01555 | 1415 | cap->cap[CAP_LAST_U32 - i]); |
b24a30a7 EP |
1416 | } |
1417 | } | |
1418 | ||
1419 | void audit_log_fcaps(struct audit_buffer *ab, struct audit_names *name) | |
1420 | { | |
1421 | kernel_cap_t *perm = &name->fcap.permitted; | |
1422 | kernel_cap_t *inh = &name->fcap.inheritable; | |
1423 | int log = 0; | |
1424 | ||
1425 | if (!cap_isclear(*perm)) { | |
1426 | audit_log_cap(ab, "cap_fp", perm); | |
1427 | log = 1; | |
1428 | } | |
1429 | if (!cap_isclear(*inh)) { | |
1430 | audit_log_cap(ab, "cap_fi", inh); | |
1431 | log = 1; | |
1432 | } | |
1433 | ||
1434 | if (log) | |
1435 | audit_log_format(ab, " cap_fe=%d cap_fver=%x", | |
1436 | name->fcap.fE, name->fcap_ver); | |
1437 | } | |
1438 | ||
1439 | static inline int audit_copy_fcaps(struct audit_names *name, | |
1440 | const struct dentry *dentry) | |
1441 | { | |
1442 | struct cpu_vfs_cap_data caps; | |
1443 | int rc; | |
1444 | ||
1445 | if (!dentry) | |
1446 | return 0; | |
1447 | ||
1448 | rc = get_vfs_caps_from_disk(dentry, &caps); | |
1449 | if (rc) | |
1450 | return rc; | |
1451 | ||
1452 | name->fcap.permitted = caps.permitted; | |
1453 | name->fcap.inheritable = caps.inheritable; | |
1454 | name->fcap.fE = !!(caps.magic_etc & VFS_CAP_FLAGS_EFFECTIVE); | |
1455 | name->fcap_ver = (caps.magic_etc & VFS_CAP_REVISION_MASK) >> | |
1456 | VFS_CAP_REVISION_SHIFT; | |
1457 | ||
1458 | return 0; | |
1459 | } | |
1460 | ||
1461 | /* Copy inode data into an audit_names. */ | |
1462 | void audit_copy_inode(struct audit_names *name, const struct dentry *dentry, | |
1463 | const struct inode *inode) | |
1464 | { | |
1465 | name->ino = inode->i_ino; | |
1466 | name->dev = inode->i_sb->s_dev; | |
1467 | name->mode = inode->i_mode; | |
1468 | name->uid = inode->i_uid; | |
1469 | name->gid = inode->i_gid; | |
1470 | name->rdev = inode->i_rdev; | |
1471 | security_inode_getsecid(inode, &name->osid); | |
1472 | audit_copy_fcaps(name, dentry); | |
1473 | } | |
1474 | ||
1475 | /** | |
1476 | * audit_log_name - produce AUDIT_PATH record from struct audit_names | |
1477 | * @context: audit_context for the task | |
1478 | * @n: audit_names structure with reportable details | |
1479 | * @path: optional path to report instead of audit_names->name | |
1480 | * @record_num: record number to report when handling a list of names | |
1481 | * @call_panic: optional pointer to int that will be updated if secid fails | |
1482 | */ | |
1483 | void audit_log_name(struct audit_context *context, struct audit_names *n, | |
1484 | struct path *path, int record_num, int *call_panic) | |
1485 | { | |
1486 | struct audit_buffer *ab; | |
1487 | ab = audit_log_start(context, GFP_KERNEL, AUDIT_PATH); | |
1488 | if (!ab) | |
1489 | return; | |
1490 | ||
1491 | audit_log_format(ab, "item=%d", record_num); | |
1492 | ||
1493 | if (path) | |
1494 | audit_log_d_path(ab, " name=", path); | |
1495 | else if (n->name) { | |
1496 | switch (n->name_len) { | |
1497 | case AUDIT_NAME_FULL: | |
1498 | /* log the full path */ | |
1499 | audit_log_format(ab, " name="); | |
1500 | audit_log_untrustedstring(ab, n->name->name); | |
1501 | break; | |
1502 | case 0: | |
1503 | /* name was specified as a relative path and the | |
1504 | * directory component is the cwd */ | |
1505 | audit_log_d_path(ab, " name=", &context->pwd); | |
1506 | break; | |
1507 | default: | |
1508 | /* log the name's directory component */ | |
1509 | audit_log_format(ab, " name="); | |
1510 | audit_log_n_untrustedstring(ab, n->name->name, | |
1511 | n->name_len); | |
1512 | } | |
1513 | } else | |
1514 | audit_log_format(ab, " name=(null)"); | |
1515 | ||
1516 | if (n->ino != (unsigned long)-1) { | |
1517 | audit_log_format(ab, " inode=%lu" | |
1518 | " dev=%02x:%02x mode=%#ho" | |
1519 | " ouid=%u ogid=%u rdev=%02x:%02x", | |
1520 | n->ino, | |
1521 | MAJOR(n->dev), | |
1522 | MINOR(n->dev), | |
1523 | n->mode, | |
1524 | from_kuid(&init_user_ns, n->uid), | |
1525 | from_kgid(&init_user_ns, n->gid), | |
1526 | MAJOR(n->rdev), | |
1527 | MINOR(n->rdev)); | |
1528 | } | |
1529 | if (n->osid != 0) { | |
1530 | char *ctx = NULL; | |
1531 | u32 len; | |
1532 | if (security_secid_to_secctx( | |
1533 | n->osid, &ctx, &len)) { | |
1534 | audit_log_format(ab, " osid=%u", n->osid); | |
1535 | if (call_panic) | |
1536 | *call_panic = 2; | |
1537 | } else { | |
1538 | audit_log_format(ab, " obj=%s", ctx); | |
1539 | security_release_secctx(ctx, len); | |
1540 | } | |
1541 | } | |
1542 | ||
3733596c JL |
1543 | /* log the audit_names record type */ |
1544 | audit_log_format(ab, " nametype="); | |
1545 | switch(n->type) { | |
1546 | case AUDIT_TYPE_NORMAL: | |
1547 | audit_log_format(ab, "NORMAL"); | |
1548 | break; | |
1549 | case AUDIT_TYPE_PARENT: | |
1550 | audit_log_format(ab, "PARENT"); | |
1551 | break; | |
1552 | case AUDIT_TYPE_CHILD_DELETE: | |
1553 | audit_log_format(ab, "DELETE"); | |
1554 | break; | |
1555 | case AUDIT_TYPE_CHILD_CREATE: | |
1556 | audit_log_format(ab, "CREATE"); | |
1557 | break; | |
1558 | default: | |
1559 | audit_log_format(ab, "UNKNOWN"); | |
1560 | break; | |
1561 | } | |
1562 | ||
b24a30a7 EP |
1563 | audit_log_fcaps(ab, n); |
1564 | audit_log_end(ab); | |
1565 | } | |
1566 | ||
1567 | int audit_log_task_context(struct audit_buffer *ab) | |
1568 | { | |
1569 | char *ctx = NULL; | |
1570 | unsigned len; | |
1571 | int error; | |
1572 | u32 sid; | |
1573 | ||
1574 | security_task_getsecid(current, &sid); | |
1575 | if (!sid) | |
1576 | return 0; | |
1577 | ||
1578 | error = security_secid_to_secctx(sid, &ctx, &len); | |
1579 | if (error) { | |
1580 | if (error != -EINVAL) | |
1581 | goto error_path; | |
1582 | return 0; | |
1583 | } | |
1584 | ||
1585 | audit_log_format(ab, " subj=%s", ctx); | |
1586 | security_release_secctx(ctx, len); | |
1587 | return 0; | |
1588 | ||
1589 | error_path: | |
1590 | audit_panic("error in audit_log_task_context"); | |
1591 | return error; | |
1592 | } | |
1593 | EXPORT_SYMBOL(audit_log_task_context); | |
1594 | ||
1595 | void audit_log_task_info(struct audit_buffer *ab, struct task_struct *tsk) | |
1596 | { | |
1597 | const struct cred *cred; | |
1598 | char name[sizeof(tsk->comm)]; | |
1599 | struct mm_struct *mm = tsk->mm; | |
1600 | char *tty; | |
1601 | ||
1602 | if (!ab) | |
1603 | return; | |
1604 | ||
1605 | /* tsk == current */ | |
1606 | cred = current_cred(); | |
1607 | ||
1608 | spin_lock_irq(&tsk->sighand->siglock); | |
1609 | if (tsk->signal && tsk->signal->tty && tsk->signal->tty->name) | |
1610 | tty = tsk->signal->tty->name; | |
1611 | else | |
1612 | tty = "(none)"; | |
1613 | spin_unlock_irq(&tsk->sighand->siglock); | |
1614 | ||
1615 | audit_log_format(ab, | |
1616 | " ppid=%ld pid=%d auid=%u uid=%u gid=%u" | |
1617 | " euid=%u suid=%u fsuid=%u" | |
1618 | " egid=%u sgid=%u fsgid=%u ses=%u tty=%s", | |
1619 | sys_getppid(), | |
1620 | tsk->pid, | |
1621 | from_kuid(&init_user_ns, audit_get_loginuid(tsk)), | |
1622 | from_kuid(&init_user_ns, cred->uid), | |
1623 | from_kgid(&init_user_ns, cred->gid), | |
1624 | from_kuid(&init_user_ns, cred->euid), | |
1625 | from_kuid(&init_user_ns, cred->suid), | |
1626 | from_kuid(&init_user_ns, cred->fsuid), | |
1627 | from_kgid(&init_user_ns, cred->egid), | |
1628 | from_kgid(&init_user_ns, cred->sgid), | |
1629 | from_kgid(&init_user_ns, cred->fsgid), | |
1630 | audit_get_sessionid(tsk), tty); | |
1631 | ||
1632 | get_task_comm(name, tsk); | |
1633 | audit_log_format(ab, " comm="); | |
1634 | audit_log_untrustedstring(ab, name); | |
1635 | ||
1636 | if (mm) { | |
1637 | down_read(&mm->mmap_sem); | |
1638 | if (mm->exe_file) | |
1639 | audit_log_d_path(ab, " exe=", &mm->exe_file->f_path); | |
1640 | up_read(&mm->mmap_sem); | |
1641 | } | |
1642 | audit_log_task_context(ab); | |
1643 | } | |
1644 | EXPORT_SYMBOL(audit_log_task_info); | |
1645 | ||
a51d9eaa KC |
1646 | /** |
1647 | * audit_log_link_denied - report a link restriction denial | |
1648 | * @operation: specific link opreation | |
1649 | * @link: the path that triggered the restriction | |
1650 | */ | |
1651 | void audit_log_link_denied(const char *operation, struct path *link) | |
1652 | { | |
1653 | struct audit_buffer *ab; | |
b24a30a7 EP |
1654 | struct audit_names *name; |
1655 | ||
1656 | name = kzalloc(sizeof(*name), GFP_NOFS); | |
1657 | if (!name) | |
1658 | return; | |
a51d9eaa | 1659 | |
b24a30a7 | 1660 | /* Generate AUDIT_ANOM_LINK with subject, operation, outcome. */ |
a51d9eaa KC |
1661 | ab = audit_log_start(current->audit_context, GFP_KERNEL, |
1662 | AUDIT_ANOM_LINK); | |
d1c7d97a | 1663 | if (!ab) |
b24a30a7 EP |
1664 | goto out; |
1665 | audit_log_format(ab, "op=%s", operation); | |
1666 | audit_log_task_info(ab, current); | |
1667 | audit_log_format(ab, " res=0"); | |
a51d9eaa | 1668 | audit_log_end(ab); |
b24a30a7 EP |
1669 | |
1670 | /* Generate AUDIT_PATH record with object. */ | |
1671 | name->type = AUDIT_TYPE_NORMAL; | |
1672 | audit_copy_inode(name, link->dentry, link->dentry->d_inode); | |
1673 | audit_log_name(current->audit_context, name, link, 0, NULL); | |
1674 | out: | |
1675 | kfree(name); | |
a51d9eaa KC |
1676 | } |
1677 | ||
b0dd25a8 RD |
1678 | /** |
1679 | * audit_log_end - end one audit record | |
1680 | * @ab: the audit_buffer | |
1681 | * | |
1682 | * The netlink_* functions cannot be called inside an irq context, so | |
1683 | * the audit buffer is placed on a queue and a tasklet is scheduled to | |
1da177e4 | 1684 | * remove them from the queue outside the irq context. May be called in |
b0dd25a8 RD |
1685 | * any context. |
1686 | */ | |
b7d11258 | 1687 | void audit_log_end(struct audit_buffer *ab) |
1da177e4 | 1688 | { |
1da177e4 LT |
1689 | if (!ab) |
1690 | return; | |
1691 | if (!audit_rate_check()) { | |
1692 | audit_log_lost("rate limit exceeded"); | |
1693 | } else { | |
8d07a67c | 1694 | struct nlmsghdr *nlh = nlmsg_hdr(ab->skb); |
94191213 | 1695 | nlh->nlmsg_len = ab->skb->len - NLMSG_HDRLEN; |
f3d357b0 | 1696 | |
b7d11258 | 1697 | if (audit_pid) { |
b7d11258 | 1698 | skb_queue_tail(&audit_skb_queue, ab->skb); |
b7d11258 | 1699 | wake_up_interruptible(&kauditd_wait); |
f3d357b0 | 1700 | } else { |
038cbcf6 | 1701 | audit_printk_skb(ab->skb); |
b7d11258 | 1702 | } |
f3d357b0 | 1703 | ab->skb = NULL; |
1da177e4 | 1704 | } |
16e1904e | 1705 | audit_buffer_free(ab); |
1da177e4 LT |
1706 | } |
1707 | ||
b0dd25a8 RD |
1708 | /** |
1709 | * audit_log - Log an audit record | |
1710 | * @ctx: audit context | |
1711 | * @gfp_mask: type of allocation | |
1712 | * @type: audit message type | |
1713 | * @fmt: format string to use | |
1714 | * @...: variable parameters matching the format string | |
1715 | * | |
1716 | * This is a convenience function that calls audit_log_start, | |
1717 | * audit_log_vformat, and audit_log_end. It may be called | |
1718 | * in any context. | |
1719 | */ | |
5600b892 | 1720 | void audit_log(struct audit_context *ctx, gfp_t gfp_mask, int type, |
9ad9ad38 | 1721 | const char *fmt, ...) |
1da177e4 LT |
1722 | { |
1723 | struct audit_buffer *ab; | |
1724 | va_list args; | |
1725 | ||
9ad9ad38 | 1726 | ab = audit_log_start(ctx, gfp_mask, type); |
1da177e4 LT |
1727 | if (ab) { |
1728 | va_start(args, fmt); | |
1729 | audit_log_vformat(ab, fmt, args); | |
1730 | va_end(args); | |
1731 | audit_log_end(ab); | |
1732 | } | |
1733 | } | |
bf45da97 | 1734 | |
131ad62d MDF |
1735 | #ifdef CONFIG_SECURITY |
1736 | /** | |
1737 | * audit_log_secctx - Converts and logs SELinux context | |
1738 | * @ab: audit_buffer | |
1739 | * @secid: security number | |
1740 | * | |
1741 | * This is a helper function that calls security_secid_to_secctx to convert | |
1742 | * secid to secctx and then adds the (converted) SELinux context to the audit | |
1743 | * log by calling audit_log_format, thus also preventing leak of internal secid | |
1744 | * to userspace. If secid cannot be converted audit_panic is called. | |
1745 | */ | |
1746 | void audit_log_secctx(struct audit_buffer *ab, u32 secid) | |
1747 | { | |
1748 | u32 len; | |
1749 | char *secctx; | |
1750 | ||
1751 | if (security_secid_to_secctx(secid, &secctx, &len)) { | |
1752 | audit_panic("Cannot convert secid to context"); | |
1753 | } else { | |
1754 | audit_log_format(ab, " obj=%s", secctx); | |
1755 | security_release_secctx(secctx, len); | |
1756 | } | |
1757 | } | |
1758 | EXPORT_SYMBOL(audit_log_secctx); | |
1759 | #endif | |
1760 | ||
bf45da97 | 1761 | EXPORT_SYMBOL(audit_log_start); |
1762 | EXPORT_SYMBOL(audit_log_end); | |
1763 | EXPORT_SYMBOL(audit_log_format); | |
1764 | EXPORT_SYMBOL(audit_log); |