]>
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 | * | |
5 | * Copyright 2003-2004 Red Hat Inc., Durham, North Carolina. | |
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 | * | |
24 | * Goals: 1) Integrate fully with SELinux. | |
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> | |
45 | #include <asm/atomic.h> | |
46 | #include <asm/types.h> | |
47 | #include <linux/mm.h> | |
48 | #include <linux/module.h> | |
b7d11258 DW |
49 | #include <linux/err.h> |
50 | #include <linux/kthread.h> | |
1da177e4 LT |
51 | |
52 | #include <linux/audit.h> | |
53 | ||
54 | #include <net/sock.h> | |
55 | #include <linux/skbuff.h> | |
56 | #include <linux/netlink.h> | |
57 | ||
58 | /* No auditing will take place until audit_initialized != 0. | |
59 | * (Initialization happens after skb_init is called.) */ | |
60 | static int audit_initialized; | |
61 | ||
62 | /* No syscall auditing will take place unless audit_enabled != 0. */ | |
63 | int audit_enabled; | |
64 | ||
65 | /* Default state when kernel boots without any parameters. */ | |
66 | static int audit_default; | |
67 | ||
68 | /* If auditing cannot proceed, audit_failure selects what happens. */ | |
69 | static int audit_failure = AUDIT_FAIL_PRINTK; | |
70 | ||
71 | /* If audit records are to be written to the netlink socket, audit_pid | |
72 | * contains the (non-zero) pid. */ | |
c2f0c7c3 | 73 | int audit_pid; |
1da177e4 LT |
74 | |
75 | /* If audit_limit is non-zero, limit the rate of sending audit records | |
76 | * to that number per second. This prevents DoS attacks, but results in | |
77 | * audit records being dropped. */ | |
78 | static int audit_rate_limit; | |
79 | ||
80 | /* Number of outstanding audit_buffers allowed. */ | |
81 | static int audit_backlog_limit = 64; | |
1da177e4 | 82 | |
c2f0c7c3 SG |
83 | /* The identity of the user shutting down the audit system. */ |
84 | uid_t audit_sig_uid = -1; | |
85 | pid_t audit_sig_pid = -1; | |
86 | ||
1da177e4 LT |
87 | /* Records can be lost in several ways: |
88 | 0) [suppressed in audit_alloc] | |
89 | 1) out of memory in audit_log_start [kmalloc of struct audit_buffer] | |
90 | 2) out of memory in audit_log_move [alloc_skb] | |
91 | 3) suppressed due to audit_rate_limit | |
92 | 4) suppressed due to audit_backlog_limit | |
93 | */ | |
94 | static atomic_t audit_lost = ATOMIC_INIT(0); | |
95 | ||
96 | /* The netlink socket. */ | |
97 | static struct sock *audit_sock; | |
98 | ||
b7d11258 | 99 | /* The audit_freelist is a list of pre-allocated audit buffers (if more |
1da177e4 LT |
100 | * than AUDIT_MAXFREE are in use, the audit buffer is freed instead of |
101 | * being placed on the freelist). */ | |
1da177e4 LT |
102 | static DEFINE_SPINLOCK(audit_freelist_lock); |
103 | static int audit_freelist_count = 0; | |
1da177e4 LT |
104 | static LIST_HEAD(audit_freelist); |
105 | ||
b7d11258 DW |
106 | static struct sk_buff_head audit_skb_queue; |
107 | static struct task_struct *kauditd_task; | |
108 | static DECLARE_WAIT_QUEUE_HEAD(kauditd_wait); | |
9ad9ad38 | 109 | static DECLARE_WAIT_QUEUE_HEAD(audit_backlog_wait); |
b7d11258 | 110 | |
1da177e4 | 111 | /* The netlink socket is only to be read by 1 CPU, which lets us assume |
23f32d18 | 112 | * that list additions and deletions never happen simultaneously in |
1da177e4 | 113 | * auditsc.c */ |
f6a789d1 | 114 | DECLARE_MUTEX(audit_netlink_sem); |
1da177e4 LT |
115 | |
116 | /* AUDIT_BUFSIZ is the size of the temporary buffer used for formatting | |
117 | * audit records. Since printk uses a 1024 byte buffer, this buffer | |
118 | * should be at least that large. */ | |
119 | #define AUDIT_BUFSIZ 1024 | |
120 | ||
121 | /* AUDIT_MAXFREE is the number of empty audit_buffers we keep on the | |
122 | * audit_freelist. Doing so eliminates many kmalloc/kfree calls. */ | |
123 | #define AUDIT_MAXFREE (2*NR_CPUS) | |
124 | ||
125 | /* The audit_buffer is used when formatting an audit record. The caller | |
126 | * locks briefly to get the record off the freelist or to allocate the | |
127 | * buffer, and locks briefly to send the buffer to the netlink layer or | |
128 | * to place it on a transmit queue. Multiple audit_buffers can be in | |
129 | * use simultaneously. */ | |
130 | struct audit_buffer { | |
131 | struct list_head list; | |
8fc6115c | 132 | struct sk_buff *skb; /* formatted skb ready to send */ |
1da177e4 | 133 | struct audit_context *ctx; /* NULL or associated context */ |
9ad9ad38 | 134 | int gfp_mask; |
1da177e4 LT |
135 | }; |
136 | ||
c0404993 SG |
137 | static void audit_set_pid(struct audit_buffer *ab, pid_t pid) |
138 | { | |
139 | struct nlmsghdr *nlh = (struct nlmsghdr *)ab->skb->data; | |
140 | nlh->nlmsg_pid = pid; | |
141 | } | |
142 | ||
1da177e4 LT |
143 | struct audit_entry { |
144 | struct list_head list; | |
145 | struct audit_rule rule; | |
146 | }; | |
147 | ||
1da177e4 LT |
148 | static void audit_panic(const char *message) |
149 | { | |
150 | switch (audit_failure) | |
151 | { | |
152 | case AUDIT_FAIL_SILENT: | |
153 | break; | |
154 | case AUDIT_FAIL_PRINTK: | |
155 | printk(KERN_ERR "audit: %s\n", message); | |
156 | break; | |
157 | case AUDIT_FAIL_PANIC: | |
158 | panic("audit: %s\n", message); | |
159 | break; | |
160 | } | |
161 | } | |
162 | ||
163 | static inline int audit_rate_check(void) | |
164 | { | |
165 | static unsigned long last_check = 0; | |
166 | static int messages = 0; | |
167 | static DEFINE_SPINLOCK(lock); | |
168 | unsigned long flags; | |
169 | unsigned long now; | |
170 | unsigned long elapsed; | |
171 | int retval = 0; | |
172 | ||
173 | if (!audit_rate_limit) return 1; | |
174 | ||
175 | spin_lock_irqsave(&lock, flags); | |
176 | if (++messages < audit_rate_limit) { | |
177 | retval = 1; | |
178 | } else { | |
179 | now = jiffies; | |
180 | elapsed = now - last_check; | |
181 | if (elapsed > HZ) { | |
182 | last_check = now; | |
183 | messages = 0; | |
184 | retval = 1; | |
185 | } | |
186 | } | |
187 | spin_unlock_irqrestore(&lock, flags); | |
188 | ||
189 | return retval; | |
190 | } | |
191 | ||
192 | /* Emit at least 1 message per second, even if audit_rate_check is | |
193 | * throttling. */ | |
194 | void audit_log_lost(const char *message) | |
195 | { | |
196 | static unsigned long last_msg = 0; | |
197 | static DEFINE_SPINLOCK(lock); | |
198 | unsigned long flags; | |
199 | unsigned long now; | |
200 | int print; | |
201 | ||
202 | atomic_inc(&audit_lost); | |
203 | ||
204 | print = (audit_failure == AUDIT_FAIL_PANIC || !audit_rate_limit); | |
205 | ||
206 | if (!print) { | |
207 | spin_lock_irqsave(&lock, flags); | |
208 | now = jiffies; | |
209 | if (now - last_msg > HZ) { | |
210 | print = 1; | |
211 | last_msg = now; | |
212 | } | |
213 | spin_unlock_irqrestore(&lock, flags); | |
214 | } | |
215 | ||
216 | if (print) { | |
217 | printk(KERN_WARNING | |
b7d11258 | 218 | "audit: audit_lost=%d audit_rate_limit=%d audit_backlog_limit=%d\n", |
1da177e4 | 219 | atomic_read(&audit_lost), |
1da177e4 LT |
220 | audit_rate_limit, |
221 | audit_backlog_limit); | |
222 | audit_panic(message); | |
223 | } | |
224 | ||
225 | } | |
226 | ||
c94c257c | 227 | static int audit_set_rate_limit(int limit, uid_t loginuid) |
1da177e4 LT |
228 | { |
229 | int old = audit_rate_limit; | |
230 | audit_rate_limit = limit; | |
9ad9ad38 | 231 | audit_log(NULL, GFP_KERNEL, AUDIT_CONFIG_CHANGE, |
bccf6ae0 | 232 | "audit_rate_limit=%d old=%d by auid=%u", |
c94c257c | 233 | audit_rate_limit, old, loginuid); |
1da177e4 LT |
234 | return old; |
235 | } | |
236 | ||
c94c257c | 237 | static int audit_set_backlog_limit(int limit, uid_t loginuid) |
1da177e4 LT |
238 | { |
239 | int old = audit_backlog_limit; | |
240 | audit_backlog_limit = limit; | |
9ad9ad38 | 241 | audit_log(NULL, GFP_KERNEL, AUDIT_CONFIG_CHANGE, |
bccf6ae0 | 242 | "audit_backlog_limit=%d old=%d by auid=%u", |
c94c257c | 243 | audit_backlog_limit, old, loginuid); |
1da177e4 LT |
244 | return old; |
245 | } | |
246 | ||
c94c257c | 247 | static int audit_set_enabled(int state, uid_t loginuid) |
1da177e4 LT |
248 | { |
249 | int old = audit_enabled; | |
250 | if (state != 0 && state != 1) | |
251 | return -EINVAL; | |
252 | audit_enabled = state; | |
9ad9ad38 | 253 | audit_log(NULL, GFP_KERNEL, AUDIT_CONFIG_CHANGE, |
bccf6ae0 | 254 | "audit_enabled=%d old=%d by auid=%u", |
c0404993 | 255 | audit_enabled, old, loginuid); |
1da177e4 LT |
256 | return old; |
257 | } | |
258 | ||
c94c257c | 259 | static int audit_set_failure(int state, uid_t loginuid) |
1da177e4 LT |
260 | { |
261 | int old = audit_failure; | |
262 | if (state != AUDIT_FAIL_SILENT | |
263 | && state != AUDIT_FAIL_PRINTK | |
264 | && state != AUDIT_FAIL_PANIC) | |
265 | return -EINVAL; | |
266 | audit_failure = state; | |
9ad9ad38 | 267 | audit_log(NULL, GFP_KERNEL, AUDIT_CONFIG_CHANGE, |
bccf6ae0 | 268 | "audit_failure=%d old=%d by auid=%u", |
c0404993 | 269 | audit_failure, old, loginuid); |
1da177e4 LT |
270 | return old; |
271 | } | |
272 | ||
b7d11258 DW |
273 | int kauditd_thread(void *dummy) |
274 | { | |
275 | struct sk_buff *skb; | |
276 | ||
277 | while (1) { | |
278 | skb = skb_dequeue(&audit_skb_queue); | |
9ad9ad38 | 279 | wake_up(&audit_backlog_wait); |
b7d11258 DW |
280 | if (skb) { |
281 | if (audit_pid) { | |
282 | int err = netlink_unicast(audit_sock, skb, audit_pid, 0); | |
283 | if (err < 0) { | |
284 | BUG_ON(err != -ECONNREFUSED); /* Shoudn't happen */ | |
285 | printk(KERN_ERR "audit: *NO* daemon at audit_pid=%d\n", audit_pid); | |
286 | audit_pid = 0; | |
287 | } | |
288 | } else { | |
289 | printk(KERN_ERR "%s\n", skb->data + NLMSG_SPACE(0)); | |
290 | kfree_skb(skb); | |
291 | } | |
292 | } else { | |
293 | DECLARE_WAITQUEUE(wait, current); | |
294 | set_current_state(TASK_INTERRUPTIBLE); | |
295 | add_wait_queue(&kauditd_wait, &wait); | |
296 | ||
297 | if (!skb_queue_len(&audit_skb_queue)) | |
298 | schedule(); | |
299 | ||
300 | __set_current_state(TASK_RUNNING); | |
301 | remove_wait_queue(&kauditd_wait, &wait); | |
302 | } | |
303 | } | |
304 | } | |
305 | ||
1da177e4 LT |
306 | void audit_send_reply(int pid, int seq, int type, int done, int multi, |
307 | void *payload, int size) | |
308 | { | |
309 | struct sk_buff *skb; | |
310 | struct nlmsghdr *nlh; | |
311 | int len = NLMSG_SPACE(size); | |
312 | void *data; | |
313 | int flags = multi ? NLM_F_MULTI : 0; | |
314 | int t = done ? NLMSG_DONE : type; | |
315 | ||
316 | skb = alloc_skb(len, GFP_KERNEL); | |
317 | if (!skb) | |
b7d11258 | 318 | return; |
1da177e4 | 319 | |
b7d11258 | 320 | nlh = NLMSG_PUT(skb, pid, seq, t, size); |
1da177e4 LT |
321 | nlh->nlmsg_flags = flags; |
322 | data = NLMSG_DATA(nlh); | |
323 | memcpy(data, payload, size); | |
b7d11258 DW |
324 | |
325 | /* Ignore failure. It'll only happen if the sender goes away, | |
326 | because our timeout is set to infinite. */ | |
327 | netlink_unicast(audit_sock, skb, pid, 0); | |
1da177e4 LT |
328 | return; |
329 | ||
330 | nlmsg_failure: /* Used by NLMSG_PUT */ | |
331 | if (skb) | |
332 | kfree_skb(skb); | |
333 | } | |
334 | ||
335 | /* | |
336 | * Check for appropriate CAP_AUDIT_ capabilities on incoming audit | |
337 | * control messages. | |
338 | */ | |
339 | static int audit_netlink_ok(kernel_cap_t eff_cap, u16 msg_type) | |
340 | { | |
341 | int err = 0; | |
342 | ||
343 | switch (msg_type) { | |
344 | case AUDIT_GET: | |
345 | case AUDIT_LIST: | |
346 | case AUDIT_SET: | |
347 | case AUDIT_ADD: | |
348 | case AUDIT_DEL: | |
c2f0c7c3 | 349 | case AUDIT_SIGNAL_INFO: |
1da177e4 LT |
350 | if (!cap_raised(eff_cap, CAP_AUDIT_CONTROL)) |
351 | err = -EPERM; | |
352 | break; | |
05474106 | 353 | case AUDIT_USER: |
209aba03 | 354 | case AUDIT_FIRST_USER_MSG...AUDIT_LAST_USER_MSG: |
1da177e4 LT |
355 | if (!cap_raised(eff_cap, CAP_AUDIT_WRITE)) |
356 | err = -EPERM; | |
357 | break; | |
358 | default: /* bad msg */ | |
359 | err = -EINVAL; | |
360 | } | |
361 | ||
362 | return err; | |
363 | } | |
364 | ||
365 | static int audit_receive_msg(struct sk_buff *skb, struct nlmsghdr *nlh) | |
366 | { | |
367 | u32 uid, pid, seq; | |
368 | void *data; | |
369 | struct audit_status *status_get, status_set; | |
370 | int err; | |
c0404993 | 371 | struct audit_buffer *ab; |
1da177e4 | 372 | u16 msg_type = nlh->nlmsg_type; |
c94c257c | 373 | uid_t loginuid; /* loginuid of sender */ |
c2f0c7c3 | 374 | struct audit_sig_info sig_data; |
1da177e4 LT |
375 | |
376 | err = audit_netlink_ok(NETLINK_CB(skb).eff_cap, msg_type); | |
377 | if (err) | |
378 | return err; | |
379 | ||
b7d11258 DW |
380 | /* As soon as there's any sign of userspace auditd, start kauditd to talk to it */ |
381 | if (!kauditd_task) | |
382 | kauditd_task = kthread_run(kauditd_thread, NULL, "kauditd"); | |
383 | if (IS_ERR(kauditd_task)) { | |
384 | err = PTR_ERR(kauditd_task); | |
385 | kauditd_task = NULL; | |
386 | return err; | |
387 | } | |
388 | ||
1da177e4 LT |
389 | pid = NETLINK_CREDS(skb)->pid; |
390 | uid = NETLINK_CREDS(skb)->uid; | |
c94c257c | 391 | loginuid = NETLINK_CB(skb).loginuid; |
1da177e4 LT |
392 | seq = nlh->nlmsg_seq; |
393 | data = NLMSG_DATA(nlh); | |
394 | ||
395 | switch (msg_type) { | |
396 | case AUDIT_GET: | |
397 | status_set.enabled = audit_enabled; | |
398 | status_set.failure = audit_failure; | |
399 | status_set.pid = audit_pid; | |
400 | status_set.rate_limit = audit_rate_limit; | |
401 | status_set.backlog_limit = audit_backlog_limit; | |
402 | status_set.lost = atomic_read(&audit_lost); | |
b7d11258 | 403 | status_set.backlog = skb_queue_len(&audit_skb_queue); |
1da177e4 LT |
404 | audit_send_reply(NETLINK_CB(skb).pid, seq, AUDIT_GET, 0, 0, |
405 | &status_set, sizeof(status_set)); | |
406 | break; | |
407 | case AUDIT_SET: | |
408 | if (nlh->nlmsg_len < sizeof(struct audit_status)) | |
409 | return -EINVAL; | |
410 | status_get = (struct audit_status *)data; | |
411 | if (status_get->mask & AUDIT_STATUS_ENABLED) { | |
c94c257c | 412 | err = audit_set_enabled(status_get->enabled, loginuid); |
1da177e4 LT |
413 | if (err < 0) return err; |
414 | } | |
415 | if (status_get->mask & AUDIT_STATUS_FAILURE) { | |
c94c257c | 416 | err = audit_set_failure(status_get->failure, loginuid); |
1da177e4 LT |
417 | if (err < 0) return err; |
418 | } | |
419 | if (status_get->mask & AUDIT_STATUS_PID) { | |
420 | int old = audit_pid; | |
421 | audit_pid = status_get->pid; | |
9ad9ad38 | 422 | audit_log(NULL, GFP_KERNEL, AUDIT_CONFIG_CHANGE, |
bccf6ae0 | 423 | "audit_pid=%d old=%d by auid=%u", |
c94c257c | 424 | audit_pid, old, loginuid); |
1da177e4 LT |
425 | } |
426 | if (status_get->mask & AUDIT_STATUS_RATE_LIMIT) | |
c94c257c | 427 | audit_set_rate_limit(status_get->rate_limit, loginuid); |
1da177e4 | 428 | if (status_get->mask & AUDIT_STATUS_BACKLOG_LIMIT) |
c94c257c SH |
429 | audit_set_backlog_limit(status_get->backlog_limit, |
430 | loginuid); | |
1da177e4 | 431 | break; |
05474106 | 432 | case AUDIT_USER: |
209aba03 | 433 | case AUDIT_FIRST_USER_MSG...AUDIT_LAST_USER_MSG: |
4a4cd633 DW |
434 | if (!audit_enabled && msg_type != AUDIT_USER_AVC) |
435 | return 0; | |
436 | ||
5bb289b5 | 437 | err = audit_filter_user(&NETLINK_CB(skb), msg_type); |
4a4cd633 DW |
438 | if (err == 1) { |
439 | err = 0; | |
9ad9ad38 | 440 | ab = audit_log_start(NULL, GFP_KERNEL, msg_type); |
4a4cd633 DW |
441 | if (ab) { |
442 | audit_log_format(ab, | |
443 | "user pid=%d uid=%u auid=%u msg='%.1024s'", | |
444 | pid, uid, loginuid, (char *)data); | |
445 | audit_set_pid(ab, pid); | |
446 | audit_log_end(ab); | |
447 | } | |
0f45aa18 | 448 | } |
1da177e4 LT |
449 | break; |
450 | case AUDIT_ADD: | |
451 | case AUDIT_DEL: | |
452 | if (nlh->nlmsg_len < sizeof(struct audit_rule)) | |
453 | return -EINVAL; | |
454 | /* fallthrough */ | |
455 | case AUDIT_LIST: | |
1da177e4 | 456 | err = audit_receive_filter(nlh->nlmsg_type, NETLINK_CB(skb).pid, |
c94c257c | 457 | uid, seq, data, loginuid); |
1da177e4 | 458 | break; |
c2f0c7c3 SG |
459 | case AUDIT_SIGNAL_INFO: |
460 | sig_data.uid = audit_sig_uid; | |
461 | sig_data.pid = audit_sig_pid; | |
462 | audit_send_reply(NETLINK_CB(skb).pid, seq, AUDIT_SIGNAL_INFO, | |
463 | 0, 0, &sig_data, sizeof(sig_data)); | |
464 | break; | |
1da177e4 LT |
465 | default: |
466 | err = -EINVAL; | |
467 | break; | |
468 | } | |
469 | ||
470 | return err < 0 ? err : 0; | |
471 | } | |
472 | ||
473 | /* Get message from skb (based on rtnetlink_rcv_skb). Each message is | |
474 | * processed by audit_receive_msg. Malformed skbs with wrong length are | |
475 | * discarded silently. */ | |
2a0a6ebe | 476 | static void audit_receive_skb(struct sk_buff *skb) |
1da177e4 LT |
477 | { |
478 | int err; | |
479 | struct nlmsghdr *nlh; | |
480 | u32 rlen; | |
481 | ||
482 | while (skb->len >= NLMSG_SPACE(0)) { | |
483 | nlh = (struct nlmsghdr *)skb->data; | |
484 | if (nlh->nlmsg_len < sizeof(*nlh) || skb->len < nlh->nlmsg_len) | |
2a0a6ebe | 485 | return; |
1da177e4 LT |
486 | rlen = NLMSG_ALIGN(nlh->nlmsg_len); |
487 | if (rlen > skb->len) | |
488 | rlen = skb->len; | |
489 | if ((err = audit_receive_msg(skb, nlh))) { | |
490 | netlink_ack(skb, nlh, err); | |
491 | } else if (nlh->nlmsg_flags & NLM_F_ACK) | |
492 | netlink_ack(skb, nlh, 0); | |
493 | skb_pull(skb, rlen); | |
494 | } | |
1da177e4 LT |
495 | } |
496 | ||
497 | /* Receive messages from netlink socket. */ | |
498 | static void audit_receive(struct sock *sk, int length) | |
499 | { | |
500 | struct sk_buff *skb; | |
2a0a6ebe | 501 | unsigned int qlen; |
1da177e4 | 502 | |
2a0a6ebe | 503 | down(&audit_netlink_sem); |
1da177e4 | 504 | |
2a0a6ebe HX |
505 | for (qlen = skb_queue_len(&sk->sk_receive_queue); qlen; qlen--) { |
506 | skb = skb_dequeue(&sk->sk_receive_queue); | |
507 | audit_receive_skb(skb); | |
508 | kfree_skb(skb); | |
1da177e4 LT |
509 | } |
510 | up(&audit_netlink_sem); | |
511 | } | |
512 | ||
1da177e4 LT |
513 | |
514 | /* Initialize audit support at boot time. */ | |
515 | static int __init audit_init(void) | |
516 | { | |
517 | printk(KERN_INFO "audit: initializing netlink socket (%s)\n", | |
518 | audit_default ? "enabled" : "disabled"); | |
519 | audit_sock = netlink_kernel_create(NETLINK_AUDIT, audit_receive); | |
520 | if (!audit_sock) | |
521 | audit_panic("cannot initialize netlink socket"); | |
522 | ||
b7d11258 DW |
523 | audit_sock->sk_sndtimeo = MAX_SCHEDULE_TIMEOUT; |
524 | skb_queue_head_init(&audit_skb_queue); | |
1da177e4 LT |
525 | audit_initialized = 1; |
526 | audit_enabled = audit_default; | |
9ad9ad38 | 527 | audit_log(NULL, GFP_KERNEL, AUDIT_KERNEL, "initialized"); |
1da177e4 LT |
528 | return 0; |
529 | } | |
1da177e4 LT |
530 | __initcall(audit_init); |
531 | ||
532 | /* Process kernel command-line parameter at boot time. audit=0 or audit=1. */ | |
533 | static int __init audit_enable(char *str) | |
534 | { | |
535 | audit_default = !!simple_strtol(str, NULL, 0); | |
536 | printk(KERN_INFO "audit: %s%s\n", | |
537 | audit_default ? "enabled" : "disabled", | |
538 | audit_initialized ? "" : " (after initialization)"); | |
539 | if (audit_initialized) | |
540 | audit_enabled = audit_default; | |
541 | return 0; | |
542 | } | |
543 | ||
544 | __setup("audit=", audit_enable); | |
545 | ||
16e1904e CW |
546 | static void audit_buffer_free(struct audit_buffer *ab) |
547 | { | |
548 | unsigned long flags; | |
549 | ||
8fc6115c CW |
550 | if (!ab) |
551 | return; | |
552 | ||
5ac52f33 CW |
553 | if (ab->skb) |
554 | kfree_skb(ab->skb); | |
b7d11258 | 555 | |
16e1904e CW |
556 | spin_lock_irqsave(&audit_freelist_lock, flags); |
557 | if (++audit_freelist_count > AUDIT_MAXFREE) | |
558 | kfree(ab); | |
559 | else | |
560 | list_add(&ab->list, &audit_freelist); | |
561 | spin_unlock_irqrestore(&audit_freelist_lock, flags); | |
562 | } | |
563 | ||
c0404993 SG |
564 | static struct audit_buffer * audit_buffer_alloc(struct audit_context *ctx, |
565 | int gfp_mask, int type) | |
16e1904e CW |
566 | { |
567 | unsigned long flags; | |
568 | struct audit_buffer *ab = NULL; | |
c0404993 | 569 | struct nlmsghdr *nlh; |
16e1904e CW |
570 | |
571 | spin_lock_irqsave(&audit_freelist_lock, flags); | |
572 | if (!list_empty(&audit_freelist)) { | |
573 | ab = list_entry(audit_freelist.next, | |
574 | struct audit_buffer, list); | |
575 | list_del(&ab->list); | |
576 | --audit_freelist_count; | |
577 | } | |
578 | spin_unlock_irqrestore(&audit_freelist_lock, flags); | |
579 | ||
580 | if (!ab) { | |
4332bdd3 | 581 | ab = kmalloc(sizeof(*ab), gfp_mask); |
16e1904e | 582 | if (!ab) |
8fc6115c | 583 | goto err; |
16e1904e | 584 | } |
8fc6115c | 585 | |
4332bdd3 | 586 | ab->skb = alloc_skb(AUDIT_BUFSIZ, gfp_mask); |
5ac52f33 | 587 | if (!ab->skb) |
8fc6115c CW |
588 | goto err; |
589 | ||
b7d11258 | 590 | ab->ctx = ctx; |
9ad9ad38 | 591 | ab->gfp_mask = gfp_mask; |
c0404993 SG |
592 | nlh = (struct nlmsghdr *)skb_put(ab->skb, NLMSG_SPACE(0)); |
593 | nlh->nlmsg_type = type; | |
594 | nlh->nlmsg_flags = 0; | |
595 | nlh->nlmsg_pid = 0; | |
596 | nlh->nlmsg_seq = 0; | |
16e1904e | 597 | return ab; |
8fc6115c CW |
598 | err: |
599 | audit_buffer_free(ab); | |
600 | return NULL; | |
16e1904e | 601 | } |
1da177e4 | 602 | |
bfb4496e DW |
603 | /* Compute a serial number for the audit record. Audit records are |
604 | * written to user-space as soon as they are generated, so a complete | |
605 | * audit record may be written in several pieces. The timestamp of the | |
606 | * record and this serial number are used by the user-space tools to | |
607 | * determine which pieces belong to the same audit record. The | |
608 | * (timestamp,serial) tuple is unique for each syscall and is live from | |
609 | * syscall entry to syscall exit. | |
610 | * | |
611 | * Atomic values are only guaranteed to be 24-bit, so we count down. | |
612 | * | |
613 | * NOTE: Another possibility is to store the formatted records off the | |
614 | * audit context (for those records that have a context), and emit them | |
615 | * all at syscall exit. However, this could delay the reporting of | |
616 | * significant errors until syscall exit (or never, if the system | |
617 | * halts). */ | |
618 | unsigned int audit_serial(void) | |
619 | { | |
620 | static atomic_t serial = ATOMIC_INIT(0xffffff); | |
621 | unsigned int a, b; | |
622 | ||
623 | do { | |
624 | a = atomic_read(&serial); | |
625 | if (atomic_dec_and_test(&serial)) | |
626 | atomic_set(&serial, 0xffffff); | |
627 | b = atomic_read(&serial); | |
628 | } while (b != a - 1); | |
629 | ||
630 | return 0xffffff - b; | |
631 | } | |
632 | ||
633 | static inline void audit_get_stamp(struct audit_context *ctx, | |
634 | struct timespec *t, unsigned int *serial) | |
635 | { | |
636 | if (ctx) | |
637 | auditsc_get_stamp(ctx, t, serial); | |
638 | else { | |
639 | *t = CURRENT_TIME; | |
640 | *serial = audit_serial(); | |
641 | } | |
642 | } | |
643 | ||
1da177e4 LT |
644 | /* Obtain an audit buffer. This routine does locking to obtain the |
645 | * audit buffer, but then no locking is required for calls to | |
646 | * audit_log_*format. If the tsk is a task that is currently in a | |
647 | * syscall, then the syscall is marked as auditable and an audit record | |
648 | * will be written at syscall exit. If there is no associated task, tsk | |
649 | * should be NULL. */ | |
9ad9ad38 DW |
650 | |
651 | struct audit_buffer *audit_log_start(struct audit_context *ctx, int gfp_mask, | |
652 | int type) | |
1da177e4 LT |
653 | { |
654 | struct audit_buffer *ab = NULL; | |
1da177e4 | 655 | struct timespec t; |
d812ddbb | 656 | unsigned int serial; |
9ad9ad38 | 657 | int reserve; |
1da177e4 LT |
658 | |
659 | if (!audit_initialized) | |
660 | return NULL; | |
661 | ||
9ad9ad38 DW |
662 | if (gfp_mask & __GFP_WAIT) |
663 | reserve = 0; | |
664 | else | |
665 | reserve = 5; /* Allow atomic callers to go up to five | |
666 | entries over the normal backlog limit */ | |
667 | ||
668 | while (audit_backlog_limit | |
669 | && skb_queue_len(&audit_skb_queue) > audit_backlog_limit + reserve) { | |
670 | if (gfp_mask & __GFP_WAIT) { | |
671 | int ret = 1; | |
672 | /* Wait for auditd to drain the queue a little */ | |
673 | DECLARE_WAITQUEUE(wait, current); | |
674 | set_current_state(TASK_INTERRUPTIBLE); | |
675 | add_wait_queue(&audit_backlog_wait, &wait); | |
676 | ||
677 | if (audit_backlog_limit && | |
678 | skb_queue_len(&audit_skb_queue) > audit_backlog_limit) | |
679 | ret = schedule_timeout(HZ * 60); | |
680 | ||
681 | __set_current_state(TASK_RUNNING); | |
682 | remove_wait_queue(&audit_backlog_wait, &wait); | |
683 | if (ret) | |
684 | continue; | |
685 | } | |
fb19b4c6 DW |
686 | if (audit_rate_check()) |
687 | printk(KERN_WARNING | |
688 | "audit: audit_backlog=%d > " | |
689 | "audit_backlog_limit=%d\n", | |
690 | skb_queue_len(&audit_skb_queue), | |
691 | audit_backlog_limit); | |
692 | audit_log_lost("backlog limit exceeded"); | |
693 | return NULL; | |
694 | } | |
695 | ||
9ad9ad38 | 696 | ab = audit_buffer_alloc(ctx, gfp_mask, type); |
1da177e4 LT |
697 | if (!ab) { |
698 | audit_log_lost("out of memory in audit_log_start"); | |
699 | return NULL; | |
700 | } | |
701 | ||
bfb4496e | 702 | audit_get_stamp(ab->ctx, &t, &serial); |
197c69c6 | 703 | |
1da177e4 LT |
704 | audit_log_format(ab, "audit(%lu.%03lu:%u): ", |
705 | t.tv_sec, t.tv_nsec/1000000, serial); | |
706 | return ab; | |
707 | } | |
708 | ||
8fc6115c | 709 | /** |
5ac52f33 | 710 | * audit_expand - expand skb in the audit buffer |
8fc6115c CW |
711 | * @ab: audit_buffer |
712 | * | |
713 | * Returns 0 (no space) on failed expansion, or available space if | |
714 | * successful. | |
715 | */ | |
e3b926b4 | 716 | static inline int audit_expand(struct audit_buffer *ab, int extra) |
8fc6115c | 717 | { |
5ac52f33 | 718 | struct sk_buff *skb = ab->skb; |
e3b926b4 | 719 | int ret = pskb_expand_head(skb, skb_headroom(skb), extra, |
9ad9ad38 | 720 | ab->gfp_mask); |
5ac52f33 CW |
721 | if (ret < 0) { |
722 | audit_log_lost("out of memory in audit_expand"); | |
8fc6115c | 723 | return 0; |
5ac52f33 CW |
724 | } |
725 | return skb_tailroom(skb); | |
8fc6115c | 726 | } |
1da177e4 LT |
727 | |
728 | /* Format an audit message into the audit buffer. If there isn't enough | |
729 | * room in the audit buffer, more room will be allocated and vsnprint | |
730 | * will be called a second time. Currently, we assume that a printk | |
731 | * can't format message larger than 1024 bytes, so we don't either. */ | |
732 | static void audit_log_vformat(struct audit_buffer *ab, const char *fmt, | |
733 | va_list args) | |
734 | { | |
735 | int len, avail; | |
5ac52f33 | 736 | struct sk_buff *skb; |
eecb0a73 | 737 | va_list args2; |
1da177e4 LT |
738 | |
739 | if (!ab) | |
740 | return; | |
741 | ||
5ac52f33 CW |
742 | BUG_ON(!ab->skb); |
743 | skb = ab->skb; | |
744 | avail = skb_tailroom(skb); | |
745 | if (avail == 0) { | |
e3b926b4 | 746 | avail = audit_expand(ab, AUDIT_BUFSIZ); |
8fc6115c CW |
747 | if (!avail) |
748 | goto out; | |
1da177e4 | 749 | } |
eecb0a73 | 750 | va_copy(args2, args); |
5ac52f33 | 751 | len = vsnprintf(skb->tail, avail, fmt, args); |
1da177e4 LT |
752 | if (len >= avail) { |
753 | /* The printk buffer is 1024 bytes long, so if we get | |
754 | * here and AUDIT_BUFSIZ is at least 1024, then we can | |
755 | * log everything that printk could have logged. */ | |
5e014b10 | 756 | avail = audit_expand(ab, max_t(unsigned, AUDIT_BUFSIZ, 1+len-avail)); |
8fc6115c CW |
757 | if (!avail) |
758 | goto out; | |
eecb0a73 | 759 | len = vsnprintf(skb->tail, avail, fmt, args2); |
1da177e4 | 760 | } |
168b7173 SG |
761 | if (len > 0) |
762 | skb_put(skb, len); | |
8fc6115c CW |
763 | out: |
764 | return; | |
1da177e4 LT |
765 | } |
766 | ||
767 | /* Format a message into the audit buffer. All the work is done in | |
768 | * audit_log_vformat. */ | |
769 | void audit_log_format(struct audit_buffer *ab, const char *fmt, ...) | |
770 | { | |
771 | va_list args; | |
772 | ||
773 | if (!ab) | |
774 | return; | |
775 | va_start(args, fmt); | |
776 | audit_log_vformat(ab, fmt, args); | |
777 | va_end(args); | |
778 | } | |
779 | ||
168b7173 SG |
780 | /* This function will take the passed buf and convert it into a string of |
781 | * ascii hex digits. The new string is placed onto the skb. */ | |
782 | void audit_log_hex(struct audit_buffer *ab, const unsigned char *buf, | |
783 | size_t len) | |
83c7d091 | 784 | { |
168b7173 SG |
785 | int i, avail, new_len; |
786 | unsigned char *ptr; | |
787 | struct sk_buff *skb; | |
788 | static const unsigned char *hex = "0123456789ABCDEF"; | |
789 | ||
790 | BUG_ON(!ab->skb); | |
791 | skb = ab->skb; | |
792 | avail = skb_tailroom(skb); | |
793 | new_len = len<<1; | |
794 | if (new_len >= avail) { | |
795 | /* Round the buffer request up to the next multiple */ | |
796 | new_len = AUDIT_BUFSIZ*(((new_len-avail)/AUDIT_BUFSIZ) + 1); | |
797 | avail = audit_expand(ab, new_len); | |
798 | if (!avail) | |
799 | return; | |
800 | } | |
83c7d091 | 801 | |
168b7173 SG |
802 | ptr = skb->tail; |
803 | for (i=0; i<len; i++) { | |
804 | *ptr++ = hex[(buf[i] & 0xF0)>>4]; /* Upper nibble */ | |
805 | *ptr++ = hex[buf[i] & 0x0F]; /* Lower nibble */ | |
806 | } | |
807 | *ptr = 0; | |
808 | skb_put(skb, len << 1); /* new string is twice the old string */ | |
83c7d091 DW |
809 | } |
810 | ||
168b7173 SG |
811 | /* This code will escape a string that is passed to it if the string |
812 | * contains a control character, unprintable character, double quote mark, | |
813 | * or a space. Unescaped strings will start and end with a double quote mark. | |
814 | * Strings that are escaped are printed in hex (2 digits per char). */ | |
83c7d091 DW |
815 | void audit_log_untrustedstring(struct audit_buffer *ab, const char *string) |
816 | { | |
81b7854d | 817 | const unsigned char *p = string; |
83c7d091 DW |
818 | |
819 | while (*p) { | |
168b7173 | 820 | if (*p == '"' || *p < 0x21 || *p > 0x7f) { |
83c7d091 DW |
821 | audit_log_hex(ab, string, strlen(string)); |
822 | return; | |
823 | } | |
824 | p++; | |
825 | } | |
826 | audit_log_format(ab, "\"%s\"", string); | |
827 | } | |
828 | ||
168b7173 | 829 | /* This is a helper-function to print the escaped d_path */ |
1da177e4 LT |
830 | void audit_log_d_path(struct audit_buffer *ab, const char *prefix, |
831 | struct dentry *dentry, struct vfsmount *vfsmnt) | |
832 | { | |
168b7173 | 833 | char *p, *path; |
1da177e4 | 834 | |
8fc6115c CW |
835 | if (prefix) |
836 | audit_log_format(ab, " %s", prefix); | |
1da177e4 | 837 | |
168b7173 | 838 | /* We will allow 11 spaces for ' (deleted)' to be appended */ |
9ad9ad38 | 839 | path = kmalloc(PATH_MAX+11, ab->gfp_mask); |
168b7173 SG |
840 | if (!path) { |
841 | audit_log_format(ab, "<no memory>"); | |
842 | return; | |
1da177e4 | 843 | } |
168b7173 SG |
844 | p = d_path(dentry, vfsmnt, path, PATH_MAX+11); |
845 | if (IS_ERR(p)) { /* Should never happen since we send PATH_MAX */ | |
846 | /* FIXME: can we save some information here? */ | |
847 | audit_log_format(ab, "<too long>"); | |
848 | } else | |
849 | audit_log_untrustedstring(ab, p); | |
850 | kfree(path); | |
1da177e4 LT |
851 | } |
852 | ||
1da177e4 LT |
853 | /* The netlink_* functions cannot be called inside an irq context, so |
854 | * the audit buffer is places on a queue and a tasklet is scheduled to | |
855 | * remove them from the queue outside the irq context. May be called in | |
856 | * any context. */ | |
b7d11258 | 857 | void audit_log_end(struct audit_buffer *ab) |
1da177e4 | 858 | { |
1da177e4 LT |
859 | if (!ab) |
860 | return; | |
861 | if (!audit_rate_check()) { | |
862 | audit_log_lost("rate limit exceeded"); | |
863 | } else { | |
b7d11258 DW |
864 | if (audit_pid) { |
865 | struct nlmsghdr *nlh = (struct nlmsghdr *)ab->skb->data; | |
866 | nlh->nlmsg_len = ab->skb->len - NLMSG_SPACE(0); | |
867 | skb_queue_tail(&audit_skb_queue, ab->skb); | |
868 | ab->skb = NULL; | |
869 | wake_up_interruptible(&kauditd_wait); | |
870 | } else { | |
871 | printk("%s\n", ab->skb->data + NLMSG_SPACE(0)); | |
872 | } | |
1da177e4 | 873 | } |
16e1904e | 874 | audit_buffer_free(ab); |
1da177e4 LT |
875 | } |
876 | ||
1da177e4 LT |
877 | /* Log an audit record. This is a convenience function that calls |
878 | * audit_log_start, audit_log_vformat, and audit_log_end. It may be | |
879 | * called in any context. */ | |
9ad9ad38 DW |
880 | void audit_log(struct audit_context *ctx, int gfp_mask, int type, |
881 | const char *fmt, ...) | |
1da177e4 LT |
882 | { |
883 | struct audit_buffer *ab; | |
884 | va_list args; | |
885 | ||
9ad9ad38 | 886 | ab = audit_log_start(ctx, gfp_mask, type); |
1da177e4 LT |
887 | if (ab) { |
888 | va_start(args, fmt); | |
889 | audit_log_vformat(ab, fmt, args); | |
890 | va_end(args); | |
891 | audit_log_end(ab); | |
892 | } | |
893 | } |