blob: ce08041f578d85d0d304fec4f8b28112cd598101 [file] [log] [blame]
David Woodhousefe7752b2005-12-15 18:33:52 +00001/* auditfilter.c -- filtering of audit events
2 *
3 * Copyright 2003-2004 Red Hat, Inc.
4 * Copyright 2005 Hewlett-Packard Development Company, L.P.
5 * Copyright 2005 IBM Corporation
6 *
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (at your option) any later version.
11 *
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with this program; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 */
21
22#include <linux/kernel.h>
23#include <linux/audit.h>
24#include <linux/kthread.h>
Amy Griffisf368c07d2006-04-07 16:55:56 -040025#include <linux/mutex.h>
26#include <linux/fs.h>
27#include <linux/namei.h>
David Woodhousefe7752b2005-12-15 18:33:52 +000028#include <linux/netlink.h>
Amy Griffisf368c07d2006-04-07 16:55:56 -040029#include <linux/sched.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090030#include <linux/slab.h>
Ahmed S. Darwish2a862b32008-03-01 21:54:38 +020031#include <linux/security.h>
David Woodhousefe7752b2005-12-15 18:33:52 +000032#include "audit.h"
33
Amy Griffisf368c07d2006-04-07 16:55:56 -040034/*
35 * Locking model:
36 *
37 * audit_filter_mutex:
38 * Synchronizes writes and blocking reads of audit's filterlist
39 * data. Rcu is used to traverse the filterlist and access
40 * contents of structs audit_entry, audit_watch and opaque
Ahmed S. Darwishd7a96f32008-03-01 22:01:11 +020041 * LSM rules during filtering. If modified, these structures
Amy Griffisf368c07d2006-04-07 16:55:56 -040042 * must be copied and replace their counterparts in the filterlist.
43 * An audit_parent struct is not accessed during filtering, so may
44 * be written directly provided audit_filter_mutex is held.
45 */
46
Amy Griffisf368c07d2006-04-07 16:55:56 -040047/* Audit filter lists, defined in <linux/audit.h> */
David Woodhousefe7752b2005-12-15 18:33:52 +000048struct list_head audit_filter_list[AUDIT_NR_FILTERS] = {
49 LIST_HEAD_INIT(audit_filter_list[0]),
50 LIST_HEAD_INIT(audit_filter_list[1]),
51 LIST_HEAD_INIT(audit_filter_list[2]),
52 LIST_HEAD_INIT(audit_filter_list[3]),
53 LIST_HEAD_INIT(audit_filter_list[4]),
54 LIST_HEAD_INIT(audit_filter_list[5]),
55#if AUDIT_NR_FILTERS != 6
56#error Fix audit_filter_list initialiser
57#endif
58};
Al Viroe45aa212008-12-15 01:17:50 -050059static struct list_head audit_rules_list[AUDIT_NR_FILTERS] = {
60 LIST_HEAD_INIT(audit_rules_list[0]),
61 LIST_HEAD_INIT(audit_rules_list[1]),
62 LIST_HEAD_INIT(audit_rules_list[2]),
63 LIST_HEAD_INIT(audit_rules_list[3]),
64 LIST_HEAD_INIT(audit_rules_list[4]),
65 LIST_HEAD_INIT(audit_rules_list[5]),
66};
David Woodhousefe7752b2005-12-15 18:33:52 +000067
Al Viro74c3cbe2007-07-22 08:04:18 -040068DEFINE_MUTEX(audit_filter_mutex);
Amy Griffisf368c07d2006-04-07 16:55:56 -040069
Amy Griffis93315ed2006-02-07 12:05:27 -050070static inline void audit_free_rule(struct audit_entry *e)
David Woodhousefe7752b2005-12-15 18:33:52 +000071{
Darrel Goeddel3dc7e312006-03-10 18:14:06 -060072 int i;
Zhenwen Xuc28bb7d2009-03-12 22:16:12 +080073 struct audit_krule *erule = &e->rule;
Amy Griffisf368c07d2006-04-07 16:55:56 -040074 /* some rules don't have associated watches */
Zhenwen Xuc28bb7d2009-03-12 22:16:12 +080075 if (erule->watch)
76 audit_put_watch(erule->watch);
77 if (erule->fields)
78 for (i = 0; i < erule->field_count; i++) {
79 struct audit_field *f = &erule->fields[i];
Ahmed S. Darwish04305e42008-04-19 09:59:43 +100080 kfree(f->lsm_str);
81 security_audit_rule_free(f->lsm_rule);
Darrel Goeddel3dc7e312006-03-10 18:14:06 -060082 }
Zhenwen Xuc28bb7d2009-03-12 22:16:12 +080083 kfree(erule->fields);
84 kfree(erule->filterkey);
Amy Griffis93315ed2006-02-07 12:05:27 -050085 kfree(e);
David Woodhousefe7752b2005-12-15 18:33:52 +000086}
87
Al Viro74c3cbe2007-07-22 08:04:18 -040088void audit_free_rule_rcu(struct rcu_head *head)
Amy Griffis93315ed2006-02-07 12:05:27 -050089{
90 struct audit_entry *e = container_of(head, struct audit_entry, rcu);
91 audit_free_rule(e);
92}
93
Darrel Goeddel3dc7e312006-03-10 18:14:06 -060094/* Initialize an audit filterlist entry. */
95static inline struct audit_entry *audit_init_entry(u32 field_count)
96{
97 struct audit_entry *entry;
98 struct audit_field *fields;
99
100 entry = kzalloc(sizeof(*entry), GFP_KERNEL);
101 if (unlikely(!entry))
102 return NULL;
103
104 fields = kzalloc(sizeof(*fields) * field_count, GFP_KERNEL);
105 if (unlikely(!fields)) {
106 kfree(entry);
107 return NULL;
108 }
109 entry->rule.fields = fields;
110
111 return entry;
112}
113
Amy Griffis93315ed2006-02-07 12:05:27 -0500114/* Unpack a filter field's string representation from user-space
115 * buffer. */
Al Viro74c3cbe2007-07-22 08:04:18 -0400116char *audit_unpack_string(void **bufp, size_t *remain, size_t len)
Amy Griffis93315ed2006-02-07 12:05:27 -0500117{
118 char *str;
119
120 if (!*bufp || (len == 0) || (len > *remain))
121 return ERR_PTR(-EINVAL);
122
123 /* Of the currently implemented string fields, PATH_MAX
124 * defines the longest valid length.
125 */
126 if (len > PATH_MAX)
127 return ERR_PTR(-ENAMETOOLONG);
128
129 str = kmalloc(len + 1, GFP_KERNEL);
130 if (unlikely(!str))
131 return ERR_PTR(-ENOMEM);
132
133 memcpy(str, *bufp, len);
134 str[len] = 0;
135 *bufp += len;
136 *remain -= len;
137
138 return str;
139}
140
Amy Griffisf368c07d2006-04-07 16:55:56 -0400141/* Translate an inode field to kernel respresentation. */
142static inline int audit_to_inode(struct audit_krule *krule,
143 struct audit_field *f)
144{
145 if (krule->listnr != AUDIT_FILTER_EXIT ||
Al Viro5af75d82008-12-16 05:59:26 -0500146 krule->watch || krule->inode_f || krule->tree ||
147 (f->op != Audit_equal && f->op != Audit_not_equal))
Amy Griffisf368c07d2006-04-07 16:55:56 -0400148 return -EINVAL;
149
150 krule->inode_f = f;
151 return 0;
152}
153
Al Virob9155432006-07-01 03:56:16 -0400154static __u32 *classes[AUDIT_SYSCALL_CLASSES];
155
156int __init audit_register_class(int class, unsigned *list)
157{
158 __u32 *p = kzalloc(AUDIT_BITMASK_SIZE * sizeof(__u32), GFP_KERNEL);
159 if (!p)
160 return -ENOMEM;
161 while (*list != ~0U) {
162 unsigned n = *list++;
163 if (n >= AUDIT_BITMASK_SIZE * 32 - AUDIT_SYSCALL_CLASSES) {
164 kfree(p);
165 return -EINVAL;
166 }
167 p[AUDIT_WORD(n)] |= AUDIT_BIT(n);
168 }
169 if (class >= AUDIT_SYSCALL_CLASSES || classes[class]) {
170 kfree(p);
171 return -EINVAL;
172 }
173 classes[class] = p;
174 return 0;
175}
176
Al Viro55669bf2006-08-31 19:26:40 -0400177int audit_match_class(int class, unsigned syscall)
178{
Klaus Weidnerc926e4f2007-05-16 17:45:42 -0500179 if (unlikely(syscall >= AUDIT_BITMASK_SIZE * 32))
Al Viro55669bf2006-08-31 19:26:40 -0400180 return 0;
181 if (unlikely(class >= AUDIT_SYSCALL_CLASSES || !classes[class]))
182 return 0;
183 return classes[class][AUDIT_WORD(syscall)] & AUDIT_BIT(syscall);
184}
185
Al Viro327b9ee2007-05-15 20:37:10 +0100186#ifdef CONFIG_AUDITSYSCALL
Amy Griffise54dc242007-03-29 18:01:04 -0400187static inline int audit_match_class_bits(int class, u32 *mask)
188{
189 int i;
190
191 if (classes[class]) {
192 for (i = 0; i < AUDIT_BITMASK_SIZE; i++)
193 if (mask[i] & classes[class][i])
194 return 0;
195 }
196 return 1;
197}
198
199static int audit_match_signal(struct audit_entry *entry)
200{
201 struct audit_field *arch = entry->rule.arch_f;
202
203 if (!arch) {
204 /* When arch is unspecified, we must check both masks on biarch
205 * as syscall number alone is ambiguous. */
206 return (audit_match_class_bits(AUDIT_CLASS_SIGNAL,
207 entry->rule.mask) &&
208 audit_match_class_bits(AUDIT_CLASS_SIGNAL_32,
209 entry->rule.mask));
210 }
211
212 switch(audit_classify_arch(arch->val)) {
213 case 0: /* native */
214 return (audit_match_class_bits(AUDIT_CLASS_SIGNAL,
215 entry->rule.mask));
216 case 1: /* 32bit on biarch */
217 return (audit_match_class_bits(AUDIT_CLASS_SIGNAL_32,
218 entry->rule.mask));
219 default:
220 return 1;
221 }
222}
Al Viro327b9ee2007-05-15 20:37:10 +0100223#endif
Amy Griffise54dc242007-03-29 18:01:04 -0400224
Amy Griffis93315ed2006-02-07 12:05:27 -0500225/* Common user-space to kernel rule translation. */
226static inline struct audit_entry *audit_to_entry_common(struct audit_rule *rule)
227{
228 unsigned listnr;
229 struct audit_entry *entry;
Amy Griffis93315ed2006-02-07 12:05:27 -0500230 int i, err;
231
232 err = -EINVAL;
233 listnr = rule->flags & ~AUDIT_FILTER_PREPEND;
234 switch(listnr) {
235 default:
236 goto exit_err;
237 case AUDIT_FILTER_USER:
238 case AUDIT_FILTER_TYPE:
239#ifdef CONFIG_AUDITSYSCALL
240 case AUDIT_FILTER_ENTRY:
241 case AUDIT_FILTER_EXIT:
242 case AUDIT_FILTER_TASK:
243#endif
244 ;
245 }
Al Viro014149c2006-05-23 01:36:13 -0400246 if (unlikely(rule->action == AUDIT_POSSIBLE)) {
247 printk(KERN_ERR "AUDIT_POSSIBLE is deprecated\n");
248 goto exit_err;
249 }
250 if (rule->action != AUDIT_NEVER && rule->action != AUDIT_ALWAYS)
Amy Griffis93315ed2006-02-07 12:05:27 -0500251 goto exit_err;
252 if (rule->field_count > AUDIT_MAX_FIELDS)
253 goto exit_err;
254
255 err = -ENOMEM;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600256 entry = audit_init_entry(rule->field_count);
257 if (!entry)
Amy Griffis93315ed2006-02-07 12:05:27 -0500258 goto exit_err;
Amy Griffis93315ed2006-02-07 12:05:27 -0500259
260 entry->rule.flags = rule->flags & AUDIT_FILTER_PREPEND;
261 entry->rule.listnr = listnr;
262 entry->rule.action = rule->action;
263 entry->rule.field_count = rule->field_count;
Amy Griffis93315ed2006-02-07 12:05:27 -0500264
265 for (i = 0; i < AUDIT_BITMASK_SIZE; i++)
266 entry->rule.mask[i] = rule->mask[i];
267
Al Virob9155432006-07-01 03:56:16 -0400268 for (i = 0; i < AUDIT_SYSCALL_CLASSES; i++) {
269 int bit = AUDIT_BITMASK_SIZE * 32 - i - 1;
270 __u32 *p = &entry->rule.mask[AUDIT_WORD(bit)];
271 __u32 *class;
272
273 if (!(*p & AUDIT_BIT(bit)))
274 continue;
275 *p &= ~AUDIT_BIT(bit);
276 class = classes[i];
277 if (class) {
278 int j;
279 for (j = 0; j < AUDIT_BITMASK_SIZE; j++)
280 entry->rule.mask[j] |= class[j];
281 }
282 }
283
Amy Griffis93315ed2006-02-07 12:05:27 -0500284 return entry;
285
286exit_err:
287 return ERR_PTR(err);
288}
289
Al Viro5af75d82008-12-16 05:59:26 -0500290static u32 audit_ops[] =
291{
292 [Audit_equal] = AUDIT_EQUAL,
293 [Audit_not_equal] = AUDIT_NOT_EQUAL,
294 [Audit_bitmask] = AUDIT_BIT_MASK,
295 [Audit_bittest] = AUDIT_BIT_TEST,
296 [Audit_lt] = AUDIT_LESS_THAN,
297 [Audit_gt] = AUDIT_GREATER_THAN,
298 [Audit_le] = AUDIT_LESS_THAN_OR_EQUAL,
299 [Audit_ge] = AUDIT_GREATER_THAN_OR_EQUAL,
300};
301
302static u32 audit_to_op(u32 op)
303{
304 u32 n;
305 for (n = Audit_equal; n < Audit_bad && audit_ops[n] != op; n++)
306 ;
307 return n;
308}
309
310
Amy Griffis93315ed2006-02-07 12:05:27 -0500311/* Translate struct audit_rule to kernel's rule respresentation.
312 * Exists for backward compatibility with userspace. */
313static struct audit_entry *audit_rule_to_entry(struct audit_rule *rule)
314{
315 struct audit_entry *entry;
316 int err = 0;
317 int i;
318
319 entry = audit_to_entry_common(rule);
320 if (IS_ERR(entry))
321 goto exit_nofree;
322
323 for (i = 0; i < rule->field_count; i++) {
324 struct audit_field *f = &entry->rule.fields[i];
Al Viro5af75d82008-12-16 05:59:26 -0500325 u32 n;
Amy Griffis93315ed2006-02-07 12:05:27 -0500326
Al Viro5af75d82008-12-16 05:59:26 -0500327 n = rule->fields[i] & (AUDIT_NEGATE|AUDIT_OPERATORS);
328
329 /* Support for legacy operators where
330 * AUDIT_NEGATE bit signifies != and otherwise assumes == */
331 if (n & AUDIT_NEGATE)
332 f->op = Audit_not_equal;
333 else if (!n)
334 f->op = Audit_equal;
335 else
336 f->op = audit_to_op(n);
337
338 entry->rule.vers_ops = (n & AUDIT_OPERATORS) ? 2 : 1;
339
Amy Griffis93315ed2006-02-07 12:05:27 -0500340 f->type = rule->fields[i] & ~(AUDIT_NEGATE|AUDIT_OPERATORS);
341 f->val = rule->values[i];
342
Amy Griffisf368c07d2006-04-07 16:55:56 -0400343 err = -EINVAL;
Al Viro5af75d82008-12-16 05:59:26 -0500344 if (f->op == Audit_bad)
345 goto exit_free;
346
Amy Griffisf368c07d2006-04-07 16:55:56 -0400347 switch(f->type) {
Al Viro0a73dcc2006-06-05 08:15:59 -0400348 default:
Amy Griffisf368c07d2006-04-07 16:55:56 -0400349 goto exit_free;
Al Viro0a73dcc2006-06-05 08:15:59 -0400350 case AUDIT_PID:
351 case AUDIT_UID:
352 case AUDIT_EUID:
353 case AUDIT_SUID:
354 case AUDIT_FSUID:
355 case AUDIT_GID:
356 case AUDIT_EGID:
357 case AUDIT_SGID:
358 case AUDIT_FSGID:
359 case AUDIT_LOGINUID:
360 case AUDIT_PERS:
Al Viro0a73dcc2006-06-05 08:15:59 -0400361 case AUDIT_MSGTYPE:
Steve Grubb3b33ac32006-08-26 14:06:20 -0400362 case AUDIT_PPID:
Al Viro0a73dcc2006-06-05 08:15:59 -0400363 case AUDIT_DEVMAJOR:
364 case AUDIT_DEVMINOR:
365 case AUDIT_EXIT:
366 case AUDIT_SUCCESS:
Eric Paris74f23452007-06-04 17:00:14 -0400367 /* bit ops are only useful on syscall args */
Al Viro5af75d82008-12-16 05:59:26 -0500368 if (f->op == Audit_bitmask || f->op == Audit_bittest)
Eric Paris74f23452007-06-04 17:00:14 -0400369 goto exit_free;
Eric Paris74f23452007-06-04 17:00:14 -0400370 break;
Al Viro0a73dcc2006-06-05 08:15:59 -0400371 case AUDIT_ARG0:
372 case AUDIT_ARG1:
373 case AUDIT_ARG2:
374 case AUDIT_ARG3:
375 break;
Eric Paris4b8a3112006-09-28 17:46:21 -0400376 /* arch is only allowed to be = or != */
377 case AUDIT_ARCH:
Al Viro5af75d82008-12-16 05:59:26 -0500378 if (f->op != Audit_not_equal && f->op != Audit_equal)
Eric Paris4b8a3112006-09-28 17:46:21 -0400379 goto exit_free;
Amy Griffise54dc242007-03-29 18:01:04 -0400380 entry->rule.arch_f = f;
Eric Paris4b8a3112006-09-28 17:46:21 -0400381 break;
Al Viro55669bf2006-08-31 19:26:40 -0400382 case AUDIT_PERM:
383 if (f->val & ~15)
384 goto exit_free;
385 break;
Al Viro8b67dca2008-04-28 04:15:49 -0400386 case AUDIT_FILETYPE:
387 if ((f->val & ~S_IFMT) > S_IFMT)
388 goto exit_free;
389 break;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400390 case AUDIT_INODE:
391 err = audit_to_inode(&entry->rule, f);
392 if (err)
393 goto exit_free;
394 break;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600395 }
Amy Griffis93315ed2006-02-07 12:05:27 -0500396 }
397
Al Viro5af75d82008-12-16 05:59:26 -0500398 if (entry->rule.inode_f && entry->rule.inode_f->op == Audit_not_equal)
399 entry->rule.inode_f = NULL;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400400
Amy Griffis93315ed2006-02-07 12:05:27 -0500401exit_nofree:
402 return entry;
403
404exit_free:
405 audit_free_rule(entry);
406 return ERR_PTR(err);
407}
408
409/* Translate struct audit_rule_data to kernel's rule respresentation. */
410static struct audit_entry *audit_data_to_entry(struct audit_rule_data *data,
411 size_t datasz)
412{
413 int err = 0;
414 struct audit_entry *entry;
415 void *bufp;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600416 size_t remain = datasz - sizeof(struct audit_rule_data);
Amy Griffis93315ed2006-02-07 12:05:27 -0500417 int i;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600418 char *str;
Amy Griffis93315ed2006-02-07 12:05:27 -0500419
420 entry = audit_to_entry_common((struct audit_rule *)data);
421 if (IS_ERR(entry))
422 goto exit_nofree;
423
424 bufp = data->buf;
425 entry->rule.vers_ops = 2;
426 for (i = 0; i < data->field_count; i++) {
427 struct audit_field *f = &entry->rule.fields[i];
428
429 err = -EINVAL;
Al Viro5af75d82008-12-16 05:59:26 -0500430
431 f->op = audit_to_op(data->fieldflags[i]);
432 if (f->op == Audit_bad)
Amy Griffis93315ed2006-02-07 12:05:27 -0500433 goto exit_free;
434
Amy Griffis93315ed2006-02-07 12:05:27 -0500435 f->type = data->fields[i];
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600436 f->val = data->values[i];
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000437 f->lsm_str = NULL;
438 f->lsm_rule = NULL;
Amy Griffis93315ed2006-02-07 12:05:27 -0500439 switch(f->type) {
Al Viro0a73dcc2006-06-05 08:15:59 -0400440 case AUDIT_PID:
441 case AUDIT_UID:
442 case AUDIT_EUID:
443 case AUDIT_SUID:
444 case AUDIT_FSUID:
445 case AUDIT_GID:
446 case AUDIT_EGID:
447 case AUDIT_SGID:
448 case AUDIT_FSGID:
449 case AUDIT_LOGINUID:
450 case AUDIT_PERS:
Al Viro0a73dcc2006-06-05 08:15:59 -0400451 case AUDIT_MSGTYPE:
452 case AUDIT_PPID:
453 case AUDIT_DEVMAJOR:
454 case AUDIT_DEVMINOR:
455 case AUDIT_EXIT:
456 case AUDIT_SUCCESS:
457 case AUDIT_ARG0:
458 case AUDIT_ARG1:
459 case AUDIT_ARG2:
460 case AUDIT_ARG3:
461 break;
Amy Griffise54dc242007-03-29 18:01:04 -0400462 case AUDIT_ARCH:
463 entry->rule.arch_f = f;
464 break;
Darrel Goeddel3a6b9f82006-06-29 16:56:39 -0500465 case AUDIT_SUBJ_USER:
466 case AUDIT_SUBJ_ROLE:
467 case AUDIT_SUBJ_TYPE:
468 case AUDIT_SUBJ_SEN:
469 case AUDIT_SUBJ_CLR:
Darrel Goeddel6e5a2d12006-06-29 16:57:08 -0500470 case AUDIT_OBJ_USER:
471 case AUDIT_OBJ_ROLE:
472 case AUDIT_OBJ_TYPE:
473 case AUDIT_OBJ_LEV_LOW:
474 case AUDIT_OBJ_LEV_HIGH:
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600475 str = audit_unpack_string(&bufp, &remain, f->val);
476 if (IS_ERR(str))
477 goto exit_free;
478 entry->rule.buflen += f->val;
479
Ahmed S. Darwishd7a96f32008-03-01 22:01:11 +0200480 err = security_audit_rule_init(f->type, f->op, str,
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000481 (void **)&f->lsm_rule);
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600482 /* Keep currently invalid fields around in case they
483 * become valid after a policy reload. */
484 if (err == -EINVAL) {
Ahmed S. Darwishd7a96f32008-03-01 22:01:11 +0200485 printk(KERN_WARNING "audit rule for LSM "
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600486 "\'%s\' is invalid\n", str);
487 err = 0;
488 }
489 if (err) {
490 kfree(str);
491 goto exit_free;
492 } else
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000493 f->lsm_str = str;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600494 break;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400495 case AUDIT_WATCH:
496 str = audit_unpack_string(&bufp, &remain, f->val);
497 if (IS_ERR(str))
498 goto exit_free;
499 entry->rule.buflen += f->val;
500
501 err = audit_to_watch(&entry->rule, str, f->val, f->op);
502 if (err) {
503 kfree(str);
504 goto exit_free;
505 }
506 break;
Al Viro74c3cbe2007-07-22 08:04:18 -0400507 case AUDIT_DIR:
508 str = audit_unpack_string(&bufp, &remain, f->val);
509 if (IS_ERR(str))
510 goto exit_free;
511 entry->rule.buflen += f->val;
512
513 err = audit_make_tree(&entry->rule, str, f->op);
514 kfree(str);
515 if (err)
516 goto exit_free;
517 break;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400518 case AUDIT_INODE:
519 err = audit_to_inode(&entry->rule, f);
520 if (err)
521 goto exit_free;
522 break;
Amy Griffis5adc8a62006-06-14 18:45:21 -0400523 case AUDIT_FILTERKEY:
524 err = -EINVAL;
525 if (entry->rule.filterkey || f->val > AUDIT_MAX_KEY_LEN)
526 goto exit_free;
527 str = audit_unpack_string(&bufp, &remain, f->val);
528 if (IS_ERR(str))
529 goto exit_free;
530 entry->rule.buflen += f->val;
531 entry->rule.filterkey = str;
532 break;
Al Viro55669bf2006-08-31 19:26:40 -0400533 case AUDIT_PERM:
534 if (f->val & ~15)
535 goto exit_free;
536 break;
Al Viro8b67dca2008-04-28 04:15:49 -0400537 case AUDIT_FILETYPE:
538 if ((f->val & ~S_IFMT) > S_IFMT)
539 goto exit_free;
540 break;
Al Viro0a73dcc2006-06-05 08:15:59 -0400541 default:
542 goto exit_free;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400543 }
544 }
545
Al Viro5af75d82008-12-16 05:59:26 -0500546 if (entry->rule.inode_f && entry->rule.inode_f->op == Audit_not_equal)
547 entry->rule.inode_f = NULL;
Amy Griffis93315ed2006-02-07 12:05:27 -0500548
549exit_nofree:
550 return entry;
551
552exit_free:
553 audit_free_rule(entry);
554 return ERR_PTR(err);
555}
556
557/* Pack a filter field's string representation into data block. */
Al Viro74c3cbe2007-07-22 08:04:18 -0400558static inline size_t audit_pack_string(void **bufp, const char *str)
Amy Griffis93315ed2006-02-07 12:05:27 -0500559{
560 size_t len = strlen(str);
561
562 memcpy(*bufp, str, len);
563 *bufp += len;
564
565 return len;
566}
567
568/* Translate kernel rule respresentation to struct audit_rule.
569 * Exists for backward compatibility with userspace. */
570static struct audit_rule *audit_krule_to_rule(struct audit_krule *krule)
571{
572 struct audit_rule *rule;
573 int i;
574
Burman Yan4668edc2006-12-06 20:38:51 -0800575 rule = kzalloc(sizeof(*rule), GFP_KERNEL);
Amy Griffis93315ed2006-02-07 12:05:27 -0500576 if (unlikely(!rule))
Amy Griffis0a3b4832006-05-02 15:06:01 -0400577 return NULL;
Amy Griffis93315ed2006-02-07 12:05:27 -0500578
579 rule->flags = krule->flags | krule->listnr;
580 rule->action = krule->action;
581 rule->field_count = krule->field_count;
582 for (i = 0; i < rule->field_count; i++) {
583 rule->values[i] = krule->fields[i].val;
584 rule->fields[i] = krule->fields[i].type;
585
586 if (krule->vers_ops == 1) {
Al Viro5af75d82008-12-16 05:59:26 -0500587 if (krule->fields[i].op == Audit_not_equal)
Amy Griffis93315ed2006-02-07 12:05:27 -0500588 rule->fields[i] |= AUDIT_NEGATE;
589 } else {
Al Viro5af75d82008-12-16 05:59:26 -0500590 rule->fields[i] |= audit_ops[krule->fields[i].op];
Amy Griffis93315ed2006-02-07 12:05:27 -0500591 }
592 }
593 for (i = 0; i < AUDIT_BITMASK_SIZE; i++) rule->mask[i] = krule->mask[i];
594
595 return rule;
596}
597
598/* Translate kernel rule respresentation to struct audit_rule_data. */
599static struct audit_rule_data *audit_krule_to_data(struct audit_krule *krule)
600{
601 struct audit_rule_data *data;
602 void *bufp;
603 int i;
604
605 data = kmalloc(sizeof(*data) + krule->buflen, GFP_KERNEL);
606 if (unlikely(!data))
Amy Griffis0a3b4832006-05-02 15:06:01 -0400607 return NULL;
Amy Griffis93315ed2006-02-07 12:05:27 -0500608 memset(data, 0, sizeof(*data));
609
610 data->flags = krule->flags | krule->listnr;
611 data->action = krule->action;
612 data->field_count = krule->field_count;
613 bufp = data->buf;
614 for (i = 0; i < data->field_count; i++) {
615 struct audit_field *f = &krule->fields[i];
616
617 data->fields[i] = f->type;
Al Viro5af75d82008-12-16 05:59:26 -0500618 data->fieldflags[i] = audit_ops[f->op];
Amy Griffis93315ed2006-02-07 12:05:27 -0500619 switch(f->type) {
Darrel Goeddel3a6b9f82006-06-29 16:56:39 -0500620 case AUDIT_SUBJ_USER:
621 case AUDIT_SUBJ_ROLE:
622 case AUDIT_SUBJ_TYPE:
623 case AUDIT_SUBJ_SEN:
624 case AUDIT_SUBJ_CLR:
Darrel Goeddel6e5a2d12006-06-29 16:57:08 -0500625 case AUDIT_OBJ_USER:
626 case AUDIT_OBJ_ROLE:
627 case AUDIT_OBJ_TYPE:
628 case AUDIT_OBJ_LEV_LOW:
629 case AUDIT_OBJ_LEV_HIGH:
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600630 data->buflen += data->values[i] =
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000631 audit_pack_string(&bufp, f->lsm_str);
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600632 break;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400633 case AUDIT_WATCH:
634 data->buflen += data->values[i] =
Eric Pariscfcad622009-06-11 14:31:36 -0400635 audit_pack_string(&bufp,
636 audit_watch_path(krule->watch));
Amy Griffisf368c07d2006-04-07 16:55:56 -0400637 break;
Al Viro74c3cbe2007-07-22 08:04:18 -0400638 case AUDIT_DIR:
639 data->buflen += data->values[i] =
640 audit_pack_string(&bufp,
641 audit_tree_path(krule->tree));
642 break;
Amy Griffis5adc8a62006-06-14 18:45:21 -0400643 case AUDIT_FILTERKEY:
644 data->buflen += data->values[i] =
645 audit_pack_string(&bufp, krule->filterkey);
646 break;
Amy Griffis93315ed2006-02-07 12:05:27 -0500647 default:
648 data->values[i] = f->val;
649 }
650 }
651 for (i = 0; i < AUDIT_BITMASK_SIZE; i++) data->mask[i] = krule->mask[i];
652
653 return data;
654}
655
656/* Compare two rules in kernel format. Considered success if rules
657 * don't match. */
658static int audit_compare_rule(struct audit_krule *a, struct audit_krule *b)
David Woodhousefe7752b2005-12-15 18:33:52 +0000659{
660 int i;
661
Amy Griffis93315ed2006-02-07 12:05:27 -0500662 if (a->flags != b->flags ||
663 a->listnr != b->listnr ||
664 a->action != b->action ||
665 a->field_count != b->field_count)
David Woodhousefe7752b2005-12-15 18:33:52 +0000666 return 1;
667
668 for (i = 0; i < a->field_count; i++) {
Amy Griffis93315ed2006-02-07 12:05:27 -0500669 if (a->fields[i].type != b->fields[i].type ||
670 a->fields[i].op != b->fields[i].op)
David Woodhousefe7752b2005-12-15 18:33:52 +0000671 return 1;
Amy Griffis93315ed2006-02-07 12:05:27 -0500672
673 switch(a->fields[i].type) {
Darrel Goeddel3a6b9f82006-06-29 16:56:39 -0500674 case AUDIT_SUBJ_USER:
675 case AUDIT_SUBJ_ROLE:
676 case AUDIT_SUBJ_TYPE:
677 case AUDIT_SUBJ_SEN:
678 case AUDIT_SUBJ_CLR:
Darrel Goeddel6e5a2d12006-06-29 16:57:08 -0500679 case AUDIT_OBJ_USER:
680 case AUDIT_OBJ_ROLE:
681 case AUDIT_OBJ_TYPE:
682 case AUDIT_OBJ_LEV_LOW:
683 case AUDIT_OBJ_LEV_HIGH:
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000684 if (strcmp(a->fields[i].lsm_str, b->fields[i].lsm_str))
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600685 return 1;
686 break;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400687 case AUDIT_WATCH:
Eric Pariscfcad622009-06-11 14:31:36 -0400688 if (strcmp(audit_watch_path(a->watch),
689 audit_watch_path(b->watch)))
Amy Griffisf368c07d2006-04-07 16:55:56 -0400690 return 1;
691 break;
Al Viro74c3cbe2007-07-22 08:04:18 -0400692 case AUDIT_DIR:
693 if (strcmp(audit_tree_path(a->tree),
694 audit_tree_path(b->tree)))
695 return 1;
696 break;
Amy Griffis5adc8a62006-06-14 18:45:21 -0400697 case AUDIT_FILTERKEY:
698 /* both filterkeys exist based on above type compare */
699 if (strcmp(a->filterkey, b->filterkey))
700 return 1;
701 break;
Amy Griffis93315ed2006-02-07 12:05:27 -0500702 default:
703 if (a->fields[i].val != b->fields[i].val)
704 return 1;
705 }
David Woodhousefe7752b2005-12-15 18:33:52 +0000706 }
707
708 for (i = 0; i < AUDIT_BITMASK_SIZE; i++)
709 if (a->mask[i] != b->mask[i])
710 return 1;
711
712 return 0;
713}
714
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000715/* Duplicate LSM field information. The lsm_rule is opaque, so must be
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600716 * re-initialized. */
Ahmed S. Darwishd7a96f32008-03-01 22:01:11 +0200717static inline int audit_dupe_lsm_field(struct audit_field *df,
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600718 struct audit_field *sf)
719{
720 int ret = 0;
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000721 char *lsm_str;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600722
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000723 /* our own copy of lsm_str */
724 lsm_str = kstrdup(sf->lsm_str, GFP_KERNEL);
725 if (unlikely(!lsm_str))
Akinobu Mita3e1fbd12006-12-22 01:10:02 -0800726 return -ENOMEM;
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000727 df->lsm_str = lsm_str;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600728
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000729 /* our own (refreshed) copy of lsm_rule */
730 ret = security_audit_rule_init(df->type, df->op, df->lsm_str,
731 (void **)&df->lsm_rule);
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600732 /* Keep currently invalid fields around in case they
733 * become valid after a policy reload. */
734 if (ret == -EINVAL) {
Ahmed S. Darwishd7a96f32008-03-01 22:01:11 +0200735 printk(KERN_WARNING "audit rule for LSM \'%s\' is "
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000736 "invalid\n", df->lsm_str);
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600737 ret = 0;
738 }
739
740 return ret;
741}
742
743/* Duplicate an audit rule. This will be a deep copy with the exception
Ahmed S. Darwishd7a96f32008-03-01 22:01:11 +0200744 * of the watch - that pointer is carried over. The LSM specific fields
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600745 * will be updated in the copy. The point is to be able to replace the old
Amy Griffisf368c07d2006-04-07 16:55:56 -0400746 * rule with the new rule in the filterlist, then free the old rule.
747 * The rlist element is undefined; list manipulations are handled apart from
748 * the initial copy. */
Eric Pariscfcad622009-06-11 14:31:36 -0400749struct audit_entry *audit_dupe_rule(struct audit_krule *old,
750 struct audit_watch *watch)
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600751{
752 u32 fcount = old->field_count;
753 struct audit_entry *entry;
754 struct audit_krule *new;
Amy Griffis5adc8a62006-06-14 18:45:21 -0400755 char *fk;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600756 int i, err = 0;
757
758 entry = audit_init_entry(fcount);
759 if (unlikely(!entry))
760 return ERR_PTR(-ENOMEM);
761
762 new = &entry->rule;
763 new->vers_ops = old->vers_ops;
764 new->flags = old->flags;
765 new->listnr = old->listnr;
766 new->action = old->action;
767 for (i = 0; i < AUDIT_BITMASK_SIZE; i++)
768 new->mask[i] = old->mask[i];
Al Viro0590b932008-12-14 23:45:27 -0500769 new->prio = old->prio;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600770 new->buflen = old->buflen;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400771 new->inode_f = old->inode_f;
772 new->watch = NULL;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600773 new->field_count = old->field_count;
Al Viro74c3cbe2007-07-22 08:04:18 -0400774 /*
775 * note that we are OK with not refcounting here; audit_match_tree()
776 * never dereferences tree and we can't get false positives there
777 * since we'd have to have rule gone from the list *and* removed
778 * before the chunks found by lookup had been allocated, i.e. before
779 * the beginning of list scan.
780 */
781 new->tree = old->tree;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600782 memcpy(new->fields, old->fields, sizeof(struct audit_field) * fcount);
783
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000784 /* deep copy this information, updating the lsm_rule fields, because
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600785 * the originals will all be freed when the old rule is freed. */
786 for (i = 0; i < fcount; i++) {
787 switch (new->fields[i].type) {
Darrel Goeddel3a6b9f82006-06-29 16:56:39 -0500788 case AUDIT_SUBJ_USER:
789 case AUDIT_SUBJ_ROLE:
790 case AUDIT_SUBJ_TYPE:
791 case AUDIT_SUBJ_SEN:
792 case AUDIT_SUBJ_CLR:
Darrel Goeddel6e5a2d12006-06-29 16:57:08 -0500793 case AUDIT_OBJ_USER:
794 case AUDIT_OBJ_ROLE:
795 case AUDIT_OBJ_TYPE:
796 case AUDIT_OBJ_LEV_LOW:
797 case AUDIT_OBJ_LEV_HIGH:
Ahmed S. Darwishd7a96f32008-03-01 22:01:11 +0200798 err = audit_dupe_lsm_field(&new->fields[i],
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600799 &old->fields[i]);
Amy Griffis5adc8a62006-06-14 18:45:21 -0400800 break;
801 case AUDIT_FILTERKEY:
802 fk = kstrdup(old->filterkey, GFP_KERNEL);
803 if (unlikely(!fk))
804 err = -ENOMEM;
805 else
806 new->filterkey = fk;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600807 }
808 if (err) {
809 audit_free_rule(entry);
810 return ERR_PTR(err);
811 }
812 }
813
Amy Griffisf368c07d2006-04-07 16:55:56 -0400814 if (watch) {
815 audit_get_watch(watch);
816 new->watch = watch;
817 }
818
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600819 return entry;
820}
821
Amy Griffisf368c07d2006-04-07 16:55:56 -0400822/* Find an existing audit rule.
823 * Caller must hold audit_filter_mutex to prevent stale rule data. */
824static struct audit_entry *audit_find_rule(struct audit_entry *entry,
Al Viro36c4f1b12008-12-15 01:50:28 -0500825 struct list_head **p)
Amy Griffisf368c07d2006-04-07 16:55:56 -0400826{
827 struct audit_entry *e, *found = NULL;
Al Viro36c4f1b12008-12-15 01:50:28 -0500828 struct list_head *list;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400829 int h;
830
Al Viro36c4f1b12008-12-15 01:50:28 -0500831 if (entry->rule.inode_f) {
832 h = audit_hash_ino(entry->rule.inode_f->val);
833 *p = list = &audit_inode_hash[h];
834 } else if (entry->rule.watch) {
Amy Griffisf368c07d2006-04-07 16:55:56 -0400835 /* we don't know the inode number, so must walk entire hash */
836 for (h = 0; h < AUDIT_INODE_BUCKETS; h++) {
837 list = &audit_inode_hash[h];
838 list_for_each_entry(e, list, list)
839 if (!audit_compare_rule(&entry->rule, &e->rule)) {
840 found = e;
841 goto out;
842 }
843 }
844 goto out;
Al Viro36c4f1b12008-12-15 01:50:28 -0500845 } else {
846 *p = list = &audit_filter_list[entry->rule.listnr];
Amy Griffisf368c07d2006-04-07 16:55:56 -0400847 }
848
849 list_for_each_entry(e, list, list)
850 if (!audit_compare_rule(&entry->rule, &e->rule)) {
851 found = e;
852 goto out;
853 }
854
855out:
856 return found;
857}
858
Al Viro0590b932008-12-14 23:45:27 -0500859static u64 prio_low = ~0ULL/2;
860static u64 prio_high = ~0ULL/2 - 1;
861
Amy Griffisf368c07d2006-04-07 16:55:56 -0400862/* Add rule to given filterlist if not a duplicate. */
Al Viro36c4f1b12008-12-15 01:50:28 -0500863static inline int audit_add_rule(struct audit_entry *entry)
Amy Griffisf368c07d2006-04-07 16:55:56 -0400864{
865 struct audit_entry *e;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400866 struct audit_watch *watch = entry->rule.watch;
Al Viro74c3cbe2007-07-22 08:04:18 -0400867 struct audit_tree *tree = entry->rule.tree;
Al Viro36c4f1b12008-12-15 01:50:28 -0500868 struct list_head *list;
Jeff Garzik6f686d32007-07-16 21:25:01 -0400869 int h, err;
Al Viro471a5c72006-07-10 08:29:24 -0400870#ifdef CONFIG_AUDITSYSCALL
871 int dont_count = 0;
872
873 /* If either of these, don't count towards total */
874 if (entry->rule.listnr == AUDIT_FILTER_USER ||
875 entry->rule.listnr == AUDIT_FILTER_TYPE)
876 dont_count = 1;
877#endif
Amy Griffisf368c07d2006-04-07 16:55:56 -0400878
Amy Griffisf368c07d2006-04-07 16:55:56 -0400879 mutex_lock(&audit_filter_mutex);
Al Viro36c4f1b12008-12-15 01:50:28 -0500880 e = audit_find_rule(entry, &list);
Amy Griffisf368c07d2006-04-07 16:55:56 -0400881 if (e) {
Eric Paris35fe4d02009-06-11 14:31:36 -0400882 mutex_unlock(&audit_filter_mutex);
Amy Griffisf368c07d2006-04-07 16:55:56 -0400883 err = -EEXIST;
Al Viro74c3cbe2007-07-22 08:04:18 -0400884 /* normally audit_add_tree_rule() will free it on failure */
885 if (tree)
886 audit_put_tree(tree);
Amy Griffisf368c07d2006-04-07 16:55:56 -0400887 goto error;
888 }
889
Amy Griffisf368c07d2006-04-07 16:55:56 -0400890 if (watch) {
891 /* audit_filter_mutex is dropped and re-taken during this call */
Eric Paris35fe4d02009-06-11 14:31:36 -0400892 err = audit_add_watch(&entry->rule);
Amy Griffisf368c07d2006-04-07 16:55:56 -0400893 if (err) {
894 mutex_unlock(&audit_filter_mutex);
895 goto error;
896 }
Eric Paris35aa9012009-06-11 14:31:33 -0400897 /* entry->rule.watch may have changed during audit_add_watch() */
898 watch = entry->rule.watch;
Eric Pariscfcad622009-06-11 14:31:36 -0400899 h = audit_hash_ino((u32)audit_watch_inode(watch));
Amy Griffisf368c07d2006-04-07 16:55:56 -0400900 list = &audit_inode_hash[h];
David Woodhousefe7752b2005-12-15 18:33:52 +0000901 }
Al Viro74c3cbe2007-07-22 08:04:18 -0400902 if (tree) {
903 err = audit_add_tree_rule(&entry->rule);
904 if (err) {
905 mutex_unlock(&audit_filter_mutex);
906 goto error;
907 }
908 }
David Woodhousefe7752b2005-12-15 18:33:52 +0000909
Al Viro0590b932008-12-14 23:45:27 -0500910 entry->rule.prio = ~0ULL;
911 if (entry->rule.listnr == AUDIT_FILTER_EXIT) {
912 if (entry->rule.flags & AUDIT_FILTER_PREPEND)
913 entry->rule.prio = ++prio_high;
914 else
915 entry->rule.prio = --prio_low;
916 }
917
David Woodhousefe7752b2005-12-15 18:33:52 +0000918 if (entry->rule.flags & AUDIT_FILTER_PREPEND) {
Al Viroe45aa212008-12-15 01:17:50 -0500919 list_add(&entry->rule.list,
920 &audit_rules_list[entry->rule.listnr]);
David Woodhousefe7752b2005-12-15 18:33:52 +0000921 list_add_rcu(&entry->list, list);
Amy Griffis6a2bcee2006-06-02 13:16:01 -0400922 entry->rule.flags &= ~AUDIT_FILTER_PREPEND;
David Woodhousefe7752b2005-12-15 18:33:52 +0000923 } else {
Al Viroe45aa212008-12-15 01:17:50 -0500924 list_add_tail(&entry->rule.list,
925 &audit_rules_list[entry->rule.listnr]);
David Woodhousefe7752b2005-12-15 18:33:52 +0000926 list_add_tail_rcu(&entry->list, list);
927 }
Al Viro471a5c72006-07-10 08:29:24 -0400928#ifdef CONFIG_AUDITSYSCALL
929 if (!dont_count)
930 audit_n_rules++;
Amy Griffise54dc242007-03-29 18:01:04 -0400931
932 if (!audit_match_signal(entry))
933 audit_signals++;
Al Viro471a5c72006-07-10 08:29:24 -0400934#endif
Amy Griffisf368c07d2006-04-07 16:55:56 -0400935 mutex_unlock(&audit_filter_mutex);
David Woodhousefe7752b2005-12-15 18:33:52 +0000936
Amy Griffisf368c07d2006-04-07 16:55:56 -0400937 return 0;
938
939error:
Amy Griffisf368c07d2006-04-07 16:55:56 -0400940 if (watch)
941 audit_put_watch(watch); /* tmp watch, matches initial get */
942 return err;
David Woodhousefe7752b2005-12-15 18:33:52 +0000943}
944
Amy Griffisf368c07d2006-04-07 16:55:56 -0400945/* Remove an existing rule from filterlist. */
Al Viro36c4f1b12008-12-15 01:50:28 -0500946static inline int audit_del_rule(struct audit_entry *entry)
David Woodhousefe7752b2005-12-15 18:33:52 +0000947{
948 struct audit_entry *e;
Eric Pariscfcad622009-06-11 14:31:36 -0400949 struct audit_watch *watch = entry->rule.watch;
Al Viro74c3cbe2007-07-22 08:04:18 -0400950 struct audit_tree *tree = entry->rule.tree;
Al Viro36c4f1b12008-12-15 01:50:28 -0500951 struct list_head *list;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400952 LIST_HEAD(inotify_list);
Al Viro36c4f1b12008-12-15 01:50:28 -0500953 int ret = 0;
Al Viro471a5c72006-07-10 08:29:24 -0400954#ifdef CONFIG_AUDITSYSCALL
955 int dont_count = 0;
956
957 /* If either of these, don't count towards total */
958 if (entry->rule.listnr == AUDIT_FILTER_USER ||
959 entry->rule.listnr == AUDIT_FILTER_TYPE)
960 dont_count = 1;
961#endif
David Woodhousefe7752b2005-12-15 18:33:52 +0000962
Amy Griffisf368c07d2006-04-07 16:55:56 -0400963 mutex_lock(&audit_filter_mutex);
Al Viro36c4f1b12008-12-15 01:50:28 -0500964 e = audit_find_rule(entry, &list);
Amy Griffisf368c07d2006-04-07 16:55:56 -0400965 if (!e) {
966 mutex_unlock(&audit_filter_mutex);
967 ret = -ENOENT;
968 goto out;
969 }
970
Eric Pariscfcad622009-06-11 14:31:36 -0400971 if (e->rule.watch)
972 audit_remove_watch_rule(&e->rule, &inotify_list);
Amy Griffisf368c07d2006-04-07 16:55:56 -0400973
Al Viro74c3cbe2007-07-22 08:04:18 -0400974 if (e->rule.tree)
975 audit_remove_tree_rule(&e->rule);
976
Amy Griffisf368c07d2006-04-07 16:55:56 -0400977 list_del_rcu(&e->list);
Al Viroe45aa212008-12-15 01:17:50 -0500978 list_del(&e->rule.list);
Amy Griffisf368c07d2006-04-07 16:55:56 -0400979 call_rcu(&e->rcu, audit_free_rule_rcu);
980
Al Viro471a5c72006-07-10 08:29:24 -0400981#ifdef CONFIG_AUDITSYSCALL
982 if (!dont_count)
983 audit_n_rules--;
Amy Griffise54dc242007-03-29 18:01:04 -0400984
985 if (!audit_match_signal(entry))
986 audit_signals--;
Al Viro471a5c72006-07-10 08:29:24 -0400987#endif
Amy Griffisf368c07d2006-04-07 16:55:56 -0400988 mutex_unlock(&audit_filter_mutex);
989
990 if (!list_empty(&inotify_list))
991 audit_inotify_unregister(&inotify_list);
992
993out:
Eric Pariscfcad622009-06-11 14:31:36 -0400994 if (watch)
995 audit_put_watch(watch); /* match initial get */
Al Viro74c3cbe2007-07-22 08:04:18 -0400996 if (tree)
997 audit_put_tree(tree); /* that's the temporary one */
Amy Griffisf368c07d2006-04-07 16:55:56 -0400998
999 return ret;
David Woodhousefe7752b2005-12-15 18:33:52 +00001000}
1001
Amy Griffis93315ed2006-02-07 12:05:27 -05001002/* List rules using struct audit_rule. Exists for backward
1003 * compatibility with userspace. */
Al Viro9044e6b2006-05-22 01:09:24 -04001004static void audit_list(int pid, int seq, struct sk_buff_head *q)
David Woodhousefe7752b2005-12-15 18:33:52 +00001005{
Al Viro9044e6b2006-05-22 01:09:24 -04001006 struct sk_buff *skb;
Al Viroe45aa212008-12-15 01:17:50 -05001007 struct audit_krule *r;
David Woodhousefe7752b2005-12-15 18:33:52 +00001008 int i;
1009
Amy Griffisf368c07d2006-04-07 16:55:56 -04001010 /* This is a blocking read, so use audit_filter_mutex instead of rcu
1011 * iterator to sync with list writers. */
David Woodhousefe7752b2005-12-15 18:33:52 +00001012 for (i=0; i<AUDIT_NR_FILTERS; i++) {
Al Viroe45aa212008-12-15 01:17:50 -05001013 list_for_each_entry(r, &audit_rules_list[i], list) {
Amy Griffis93315ed2006-02-07 12:05:27 -05001014 struct audit_rule *rule;
1015
Al Viroe45aa212008-12-15 01:17:50 -05001016 rule = audit_krule_to_rule(r);
Amy Griffisf368c07d2006-04-07 16:55:56 -04001017 if (unlikely(!rule))
1018 break;
1019 skb = audit_make_reply(pid, seq, AUDIT_LIST, 0, 1,
1020 rule, sizeof(*rule));
1021 if (skb)
1022 skb_queue_tail(q, skb);
1023 kfree(rule);
1024 }
1025 }
Al Viro9044e6b2006-05-22 01:09:24 -04001026 skb = audit_make_reply(pid, seq, AUDIT_LIST, 1, 1, NULL, 0);
1027 if (skb)
1028 skb_queue_tail(q, skb);
David Woodhousefe7752b2005-12-15 18:33:52 +00001029}
1030
Amy Griffis93315ed2006-02-07 12:05:27 -05001031/* List rules using struct audit_rule_data. */
Al Viro9044e6b2006-05-22 01:09:24 -04001032static void audit_list_rules(int pid, int seq, struct sk_buff_head *q)
Amy Griffis93315ed2006-02-07 12:05:27 -05001033{
Al Viro9044e6b2006-05-22 01:09:24 -04001034 struct sk_buff *skb;
Al Viroe45aa212008-12-15 01:17:50 -05001035 struct audit_krule *r;
Amy Griffis93315ed2006-02-07 12:05:27 -05001036 int i;
1037
Amy Griffisf368c07d2006-04-07 16:55:56 -04001038 /* This is a blocking read, so use audit_filter_mutex instead of rcu
1039 * iterator to sync with list writers. */
Amy Griffis93315ed2006-02-07 12:05:27 -05001040 for (i=0; i<AUDIT_NR_FILTERS; i++) {
Al Viroe45aa212008-12-15 01:17:50 -05001041 list_for_each_entry(r, &audit_rules_list[i], list) {
Amy Griffis93315ed2006-02-07 12:05:27 -05001042 struct audit_rule_data *data;
1043
Al Viroe45aa212008-12-15 01:17:50 -05001044 data = audit_krule_to_data(r);
Amy Griffisf368c07d2006-04-07 16:55:56 -04001045 if (unlikely(!data))
1046 break;
1047 skb = audit_make_reply(pid, seq, AUDIT_LIST_RULES, 0, 1,
1048 data, sizeof(*data) + data->buflen);
Al Viro9044e6b2006-05-22 01:09:24 -04001049 if (skb)
1050 skb_queue_tail(q, skb);
Amy Griffis93315ed2006-02-07 12:05:27 -05001051 kfree(data);
1052 }
1053 }
Al Viro9044e6b2006-05-22 01:09:24 -04001054 skb = audit_make_reply(pid, seq, AUDIT_LIST_RULES, 1, 1, NULL, 0);
1055 if (skb)
1056 skb_queue_tail(q, skb);
Amy Griffis93315ed2006-02-07 12:05:27 -05001057}
1058
Amy Griffis5adc8a62006-06-14 18:45:21 -04001059/* Log rule additions and removals */
Eric Paris25323862008-04-18 10:09:25 -04001060static void audit_log_rule_change(uid_t loginuid, u32 sessionid, u32 sid,
1061 char *action, struct audit_krule *rule,
1062 int res)
Amy Griffis5adc8a62006-06-14 18:45:21 -04001063{
1064 struct audit_buffer *ab;
1065
Eric Paris1a6b9f22008-01-07 17:09:31 -05001066 if (!audit_enabled)
1067 return;
1068
Amy Griffis5adc8a62006-06-14 18:45:21 -04001069 ab = audit_log_start(NULL, GFP_KERNEL, AUDIT_CONFIG_CHANGE);
1070 if (!ab)
1071 return;
Eric Paris25323862008-04-18 10:09:25 -04001072 audit_log_format(ab, "auid=%u ses=%u", loginuid, sessionid);
Amy Griffis5adc8a62006-06-14 18:45:21 -04001073 if (sid) {
1074 char *ctx = NULL;
1075 u32 len;
Ahmed S. Darwish2a862b32008-03-01 21:54:38 +02001076 if (security_secid_to_secctx(sid, &ctx, &len))
Amy Griffis5adc8a62006-06-14 18:45:21 -04001077 audit_log_format(ab, " ssid=%u", sid);
Ahmed S. Darwish2a862b32008-03-01 21:54:38 +02001078 else {
Amy Griffis5adc8a62006-06-14 18:45:21 -04001079 audit_log_format(ab, " subj=%s", ctx);
Ahmed S. Darwish2a862b32008-03-01 21:54:38 +02001080 security_release_secctx(ctx, len);
1081 }
Amy Griffis5adc8a62006-06-14 18:45:21 -04001082 }
Eric Paris9d960982009-06-11 14:31:37 -04001083 audit_log_format(ab, " op=");
1084 audit_log_string(ab, action);
1085 audit_log_key(ab, rule->filterkey);
Amy Griffis5adc8a62006-06-14 18:45:21 -04001086 audit_log_format(ab, " list=%d res=%d", rule->listnr, res);
1087 audit_log_end(ab);
1088}
1089
David Woodhousefe7752b2005-12-15 18:33:52 +00001090/**
1091 * audit_receive_filter - apply all rules to the specified message type
1092 * @type: audit message type
1093 * @pid: target pid for netlink audit messages
1094 * @uid: target uid for netlink audit messages
1095 * @seq: netlink audit message sequence (serial) number
1096 * @data: payload data
Amy Griffis93315ed2006-02-07 12:05:27 -05001097 * @datasz: size of payload data
David Woodhousefe7752b2005-12-15 18:33:52 +00001098 * @loginuid: loginuid of sender
Randy Dunlap9f0aecd2008-05-19 15:09:21 -07001099 * @sessionid: sessionid for netlink audit message
Steve Grubbce29b682006-04-01 18:29:34 -05001100 * @sid: SE Linux Security ID of sender
David Woodhousefe7752b2005-12-15 18:33:52 +00001101 */
1102int audit_receive_filter(int type, int pid, int uid, int seq, void *data,
Eric Paris25323862008-04-18 10:09:25 -04001103 size_t datasz, uid_t loginuid, u32 sessionid, u32 sid)
David Woodhousefe7752b2005-12-15 18:33:52 +00001104{
1105 struct task_struct *tsk;
Al Viro9044e6b2006-05-22 01:09:24 -04001106 struct audit_netlink_list *dest;
Amy Griffis93315ed2006-02-07 12:05:27 -05001107 int err = 0;
1108 struct audit_entry *entry;
David Woodhousefe7752b2005-12-15 18:33:52 +00001109
1110 switch (type) {
1111 case AUDIT_LIST:
Amy Griffis93315ed2006-02-07 12:05:27 -05001112 case AUDIT_LIST_RULES:
David Woodhousefe7752b2005-12-15 18:33:52 +00001113 /* We can't just spew out the rules here because we might fill
1114 * the available socket buffer space and deadlock waiting for
1115 * auditctl to read from it... which isn't ever going to
1116 * happen if we're actually running in the context of auditctl
1117 * trying to _send_ the stuff */
Daniel Walker9ce34212007-10-18 03:06:06 -07001118
Al Viro9044e6b2006-05-22 01:09:24 -04001119 dest = kmalloc(sizeof(struct audit_netlink_list), GFP_KERNEL);
David Woodhousefe7752b2005-12-15 18:33:52 +00001120 if (!dest)
1121 return -ENOMEM;
Al Viro9044e6b2006-05-22 01:09:24 -04001122 dest->pid = pid;
1123 skb_queue_head_init(&dest->q);
David Woodhousefe7752b2005-12-15 18:33:52 +00001124
Amy Griffisf368c07d2006-04-07 16:55:56 -04001125 mutex_lock(&audit_filter_mutex);
Amy Griffis93315ed2006-02-07 12:05:27 -05001126 if (type == AUDIT_LIST)
Al Viro9044e6b2006-05-22 01:09:24 -04001127 audit_list(pid, seq, &dest->q);
Amy Griffis93315ed2006-02-07 12:05:27 -05001128 else
Al Viro9044e6b2006-05-22 01:09:24 -04001129 audit_list_rules(pid, seq, &dest->q);
Amy Griffisf368c07d2006-04-07 16:55:56 -04001130 mutex_unlock(&audit_filter_mutex);
Al Viro9044e6b2006-05-22 01:09:24 -04001131
1132 tsk = kthread_run(audit_send_list, dest, "audit_send_list");
David Woodhousefe7752b2005-12-15 18:33:52 +00001133 if (IS_ERR(tsk)) {
Al Viro9044e6b2006-05-22 01:09:24 -04001134 skb_queue_purge(&dest->q);
David Woodhousefe7752b2005-12-15 18:33:52 +00001135 kfree(dest);
1136 err = PTR_ERR(tsk);
1137 }
1138 break;
1139 case AUDIT_ADD:
Amy Griffis93315ed2006-02-07 12:05:27 -05001140 case AUDIT_ADD_RULE:
1141 if (type == AUDIT_ADD)
1142 entry = audit_rule_to_entry(data);
1143 else
1144 entry = audit_data_to_entry(data, datasz);
1145 if (IS_ERR(entry))
1146 return PTR_ERR(entry);
David Woodhousefe7752b2005-12-15 18:33:52 +00001147
Al Viro36c4f1b12008-12-15 01:50:28 -05001148 err = audit_add_rule(entry);
Eric Paris9d960982009-06-11 14:31:37 -04001149 audit_log_rule_change(loginuid, sessionid, sid, "add rule",
Eric Paris25323862008-04-18 10:09:25 -04001150 &entry->rule, !err);
Steve Grubb5d330102006-01-09 09:48:17 -05001151
1152 if (err)
Amy Griffis93315ed2006-02-07 12:05:27 -05001153 audit_free_rule(entry);
David Woodhousefe7752b2005-12-15 18:33:52 +00001154 break;
1155 case AUDIT_DEL:
Amy Griffis93315ed2006-02-07 12:05:27 -05001156 case AUDIT_DEL_RULE:
1157 if (type == AUDIT_DEL)
1158 entry = audit_rule_to_entry(data);
1159 else
1160 entry = audit_data_to_entry(data, datasz);
1161 if (IS_ERR(entry))
1162 return PTR_ERR(entry);
David Woodhousefe7752b2005-12-15 18:33:52 +00001163
Al Viro36c4f1b12008-12-15 01:50:28 -05001164 err = audit_del_rule(entry);
Eric Paris9d960982009-06-11 14:31:37 -04001165 audit_log_rule_change(loginuid, sessionid, sid, "remove rule",
Eric Paris25323862008-04-18 10:09:25 -04001166 &entry->rule, !err);
Steve Grubb5d330102006-01-09 09:48:17 -05001167
Amy Griffis93315ed2006-02-07 12:05:27 -05001168 audit_free_rule(entry);
David Woodhousefe7752b2005-12-15 18:33:52 +00001169 break;
1170 default:
1171 return -EINVAL;
1172 }
1173
1174 return err;
1175}
1176
Al Viro5af75d82008-12-16 05:59:26 -05001177int audit_comparator(u32 left, u32 op, u32 right)
David Woodhousefe7752b2005-12-15 18:33:52 +00001178{
1179 switch (op) {
Al Viro5af75d82008-12-16 05:59:26 -05001180 case Audit_equal:
David Woodhousefe7752b2005-12-15 18:33:52 +00001181 return (left == right);
Al Viro5af75d82008-12-16 05:59:26 -05001182 case Audit_not_equal:
David Woodhousefe7752b2005-12-15 18:33:52 +00001183 return (left != right);
Al Viro5af75d82008-12-16 05:59:26 -05001184 case Audit_lt:
David Woodhousefe7752b2005-12-15 18:33:52 +00001185 return (left < right);
Al Viro5af75d82008-12-16 05:59:26 -05001186 case Audit_le:
David Woodhousefe7752b2005-12-15 18:33:52 +00001187 return (left <= right);
Al Viro5af75d82008-12-16 05:59:26 -05001188 case Audit_gt:
David Woodhousefe7752b2005-12-15 18:33:52 +00001189 return (left > right);
Al Viro5af75d82008-12-16 05:59:26 -05001190 case Audit_ge:
David Woodhousefe7752b2005-12-15 18:33:52 +00001191 return (left >= right);
Al Viro5af75d82008-12-16 05:59:26 -05001192 case Audit_bitmask:
Eric Paris74f23452007-06-04 17:00:14 -04001193 return (left & right);
Al Viro5af75d82008-12-16 05:59:26 -05001194 case Audit_bittest:
Eric Paris74f23452007-06-04 17:00:14 -04001195 return ((left & right) == right);
Al Viro5af75d82008-12-16 05:59:26 -05001196 default:
1197 BUG();
1198 return 0;
David Woodhousefe7752b2005-12-15 18:33:52 +00001199 }
1200}
1201
Amy Griffisf368c07d2006-04-07 16:55:56 -04001202/* Compare given dentry name with last component in given path,
1203 * return of 0 indicates a match. */
Amy Griffis9c937dc2006-06-08 23:19:31 -04001204int audit_compare_dname_path(const char *dname, const char *path,
1205 int *dirlen)
Amy Griffisf368c07d2006-04-07 16:55:56 -04001206{
1207 int dlen, plen;
1208 const char *p;
David Woodhousefe7752b2005-12-15 18:33:52 +00001209
Amy Griffisf368c07d2006-04-07 16:55:56 -04001210 if (!dname || !path)
1211 return 1;
1212
1213 dlen = strlen(dname);
1214 plen = strlen(path);
1215 if (plen < dlen)
1216 return 1;
1217
1218 /* disregard trailing slashes */
1219 p = path + plen - 1;
1220 while ((*p == '/') && (p > path))
1221 p--;
1222
1223 /* find last path component */
1224 p = p - dlen + 1;
1225 if (p < path)
1226 return 1;
1227 else if (p > path) {
1228 if (*--p != '/')
1229 return 1;
1230 else
1231 p++;
1232 }
1233
Amy Griffis9c937dc2006-06-08 23:19:31 -04001234 /* return length of path's directory component */
1235 if (dirlen)
1236 *dirlen = p - path;
Amy Griffisf368c07d2006-04-07 16:55:56 -04001237 return strncmp(p, dname, dlen);
1238}
David Woodhousefe7752b2005-12-15 18:33:52 +00001239
1240static int audit_filter_user_rules(struct netlink_skb_parms *cb,
Amy Griffis93315ed2006-02-07 12:05:27 -05001241 struct audit_krule *rule,
David Woodhousefe7752b2005-12-15 18:33:52 +00001242 enum audit_state *state)
1243{
1244 int i;
1245
1246 for (i = 0; i < rule->field_count; i++) {
Amy Griffis93315ed2006-02-07 12:05:27 -05001247 struct audit_field *f = &rule->fields[i];
David Woodhousefe7752b2005-12-15 18:33:52 +00001248 int result = 0;
1249
Amy Griffis93315ed2006-02-07 12:05:27 -05001250 switch (f->type) {
David Woodhousefe7752b2005-12-15 18:33:52 +00001251 case AUDIT_PID:
Amy Griffis93315ed2006-02-07 12:05:27 -05001252 result = audit_comparator(cb->creds.pid, f->op, f->val);
David Woodhousefe7752b2005-12-15 18:33:52 +00001253 break;
1254 case AUDIT_UID:
Amy Griffis93315ed2006-02-07 12:05:27 -05001255 result = audit_comparator(cb->creds.uid, f->op, f->val);
David Woodhousefe7752b2005-12-15 18:33:52 +00001256 break;
1257 case AUDIT_GID:
Amy Griffis93315ed2006-02-07 12:05:27 -05001258 result = audit_comparator(cb->creds.gid, f->op, f->val);
David Woodhousefe7752b2005-12-15 18:33:52 +00001259 break;
1260 case AUDIT_LOGINUID:
Amy Griffis93315ed2006-02-07 12:05:27 -05001261 result = audit_comparator(cb->loginuid, f->op, f->val);
David Woodhousefe7752b2005-12-15 18:33:52 +00001262 break;
1263 }
1264
1265 if (!result)
1266 return 0;
1267 }
1268 switch (rule->action) {
1269 case AUDIT_NEVER: *state = AUDIT_DISABLED; break;
David Woodhousefe7752b2005-12-15 18:33:52 +00001270 case AUDIT_ALWAYS: *state = AUDIT_RECORD_CONTEXT; break;
1271 }
1272 return 1;
1273}
1274
Peng Haitaod8de7242008-05-20 09:13:02 +08001275int audit_filter_user(struct netlink_skb_parms *cb)
David Woodhousefe7752b2005-12-15 18:33:52 +00001276{
Ingo Molnar11f57ce2007-02-10 01:46:09 -08001277 enum audit_state state = AUDIT_DISABLED;
David Woodhousefe7752b2005-12-15 18:33:52 +00001278 struct audit_entry *e;
David Woodhousefe7752b2005-12-15 18:33:52 +00001279 int ret = 1;
1280
1281 rcu_read_lock();
1282 list_for_each_entry_rcu(e, &audit_filter_list[AUDIT_FILTER_USER], list) {
1283 if (audit_filter_user_rules(cb, &e->rule, &state)) {
1284 if (state == AUDIT_DISABLED)
1285 ret = 0;
1286 break;
1287 }
1288 }
1289 rcu_read_unlock();
1290
1291 return ret; /* Audit by default */
1292}
1293
1294int audit_filter_type(int type)
1295{
1296 struct audit_entry *e;
1297 int result = 0;
Daniel Walker9ce34212007-10-18 03:06:06 -07001298
David Woodhousefe7752b2005-12-15 18:33:52 +00001299 rcu_read_lock();
1300 if (list_empty(&audit_filter_list[AUDIT_FILTER_TYPE]))
1301 goto unlock_and_return;
1302
1303 list_for_each_entry_rcu(e, &audit_filter_list[AUDIT_FILTER_TYPE],
1304 list) {
David Woodhousefe7752b2005-12-15 18:33:52 +00001305 int i;
Amy Griffis93315ed2006-02-07 12:05:27 -05001306 for (i = 0; i < e->rule.field_count; i++) {
1307 struct audit_field *f = &e->rule.fields[i];
1308 if (f->type == AUDIT_MSGTYPE) {
1309 result = audit_comparator(type, f->op, f->val);
David Woodhousefe7752b2005-12-15 18:33:52 +00001310 if (!result)
1311 break;
1312 }
1313 }
1314 if (result)
1315 goto unlock_and_return;
1316 }
1317unlock_and_return:
1318 rcu_read_unlock();
1319 return result;
1320}
Darrel Goeddel3dc7e312006-03-10 18:14:06 -06001321
Al Viroe45aa212008-12-15 01:17:50 -05001322static int update_lsm_rule(struct audit_krule *r)
Al Viro1a9d0792008-12-14 12:04:02 -05001323{
Al Viroe45aa212008-12-15 01:17:50 -05001324 struct audit_entry *entry = container_of(r, struct audit_entry, rule);
Al Viro1a9d0792008-12-14 12:04:02 -05001325 struct audit_entry *nentry;
1326 struct audit_watch *watch;
1327 struct audit_tree *tree;
1328 int err = 0;
1329
Al Viroe45aa212008-12-15 01:17:50 -05001330 if (!security_audit_rule_known(r))
Al Viro1a9d0792008-12-14 12:04:02 -05001331 return 0;
1332
Al Viroe45aa212008-12-15 01:17:50 -05001333 watch = r->watch;
1334 tree = r->tree;
1335 nentry = audit_dupe_rule(r, watch);
Al Viro1a9d0792008-12-14 12:04:02 -05001336 if (IS_ERR(nentry)) {
1337 /* save the first error encountered for the
1338 * return value */
1339 err = PTR_ERR(nentry);
1340 audit_panic("error updating LSM filters");
1341 if (watch)
Al Viroe45aa212008-12-15 01:17:50 -05001342 list_del(&r->rlist);
Al Viro1a9d0792008-12-14 12:04:02 -05001343 list_del_rcu(&entry->list);
Al Viroe45aa212008-12-15 01:17:50 -05001344 list_del(&r->list);
Al Viro1a9d0792008-12-14 12:04:02 -05001345 } else {
1346 if (watch) {
Eric Pariscfcad622009-06-11 14:31:36 -04001347 list_add(&nentry->rule.rlist, audit_watch_rules(watch));
Al Viroe45aa212008-12-15 01:17:50 -05001348 list_del(&r->rlist);
Al Viro1a9d0792008-12-14 12:04:02 -05001349 } else if (tree)
Al Viroe45aa212008-12-15 01:17:50 -05001350 list_replace_init(&r->rlist, &nentry->rule.rlist);
Al Viro1a9d0792008-12-14 12:04:02 -05001351 list_replace_rcu(&entry->list, &nentry->list);
Al Viroe45aa212008-12-15 01:17:50 -05001352 list_replace(&r->list, &nentry->rule.list);
Al Viro1a9d0792008-12-14 12:04:02 -05001353 }
1354 call_rcu(&entry->rcu, audit_free_rule_rcu);
1355
1356 return err;
1357}
1358
Ahmed S. Darwish04305e42008-04-19 09:59:43 +10001359/* This function will re-initialize the lsm_rule field of all applicable rules.
Ahmed S. Darwishd7a96f32008-03-01 22:01:11 +02001360 * It will traverse the filter lists serarching for rules that contain LSM
Darrel Goeddel3dc7e312006-03-10 18:14:06 -06001361 * specific filter fields. When such a rule is found, it is copied, the
Ahmed S. Darwishd7a96f32008-03-01 22:01:11 +02001362 * LSM field is re-initialized, and the old rule is replaced with the
Darrel Goeddel3dc7e312006-03-10 18:14:06 -06001363 * updated rule. */
Ahmed S. Darwishd7a96f32008-03-01 22:01:11 +02001364int audit_update_lsm_rules(void)
Darrel Goeddel3dc7e312006-03-10 18:14:06 -06001365{
Al Viroe45aa212008-12-15 01:17:50 -05001366 struct audit_krule *r, *n;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -06001367 int i, err = 0;
1368
Amy Griffisf368c07d2006-04-07 16:55:56 -04001369 /* audit_filter_mutex synchronizes the writers */
1370 mutex_lock(&audit_filter_mutex);
Darrel Goeddel3dc7e312006-03-10 18:14:06 -06001371
1372 for (i = 0; i < AUDIT_NR_FILTERS; i++) {
Al Viroe45aa212008-12-15 01:17:50 -05001373 list_for_each_entry_safe(r, n, &audit_rules_list[i], list) {
1374 int res = update_lsm_rule(r);
Al Viro1a9d0792008-12-14 12:04:02 -05001375 if (!err)
1376 err = res;
1377 }
1378 }
Amy Griffisf368c07d2006-04-07 16:55:56 -04001379 mutex_unlock(&audit_filter_mutex);
Darrel Goeddel3dc7e312006-03-10 18:14:06 -06001380
1381 return err;
1382}