blob: 4a1758adb22249fcdc11ffba75263367ccde8936 [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
Richard Guy Briggsf952d102014-01-27 17:38:42 -050022#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
23
David Woodhousefe7752b2005-12-15 18:33:52 +000024#include <linux/kernel.h>
25#include <linux/audit.h>
26#include <linux/kthread.h>
Amy Griffisf368c07d2006-04-07 16:55:56 -040027#include <linux/mutex.h>
28#include <linux/fs.h>
29#include <linux/namei.h>
David Woodhousefe7752b2005-12-15 18:33:52 +000030#include <linux/netlink.h>
Amy Griffisf368c07d2006-04-07 16:55:56 -040031#include <linux/sched.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090032#include <linux/slab.h>
Ahmed S. Darwish2a862b32008-03-01 21:54:38 +020033#include <linux/security.h>
Eric W. Biederman48095d92014-02-03 17:25:33 -080034#include <net/net_namespace.h>
Eric W. Biederman6f285b12014-02-28 19:44:55 -080035#include <net/sock.h>
David Woodhousefe7752b2005-12-15 18:33:52 +000036#include "audit.h"
37
Amy Griffisf368c07d2006-04-07 16:55:56 -040038/*
39 * Locking model:
40 *
41 * audit_filter_mutex:
Scott Matheina725131e2015-11-04 08:23:51 -050042 * Synchronizes writes and blocking reads of audit's filterlist
43 * data. Rcu is used to traverse the filterlist and access
44 * contents of structs audit_entry, audit_watch and opaque
45 * LSM rules during filtering. If modified, these structures
46 * must be copied and replace their counterparts in the filterlist.
47 * An audit_parent struct is not accessed during filtering, so may
48 * be written directly provided audit_filter_mutex is held.
Amy Griffisf368c07d2006-04-07 16:55:56 -040049 */
50
Amy Griffisf368c07d2006-04-07 16:55:56 -040051/* Audit filter lists, defined in <linux/audit.h> */
David Woodhousefe7752b2005-12-15 18:33:52 +000052struct list_head audit_filter_list[AUDIT_NR_FILTERS] = {
53 LIST_HEAD_INIT(audit_filter_list[0]),
54 LIST_HEAD_INIT(audit_filter_list[1]),
55 LIST_HEAD_INIT(audit_filter_list[2]),
56 LIST_HEAD_INIT(audit_filter_list[3]),
57 LIST_HEAD_INIT(audit_filter_list[4]),
58 LIST_HEAD_INIT(audit_filter_list[5]),
Richard Guy Briggs42d5e372017-08-23 07:03:39 -040059 LIST_HEAD_INIT(audit_filter_list[6]),
60#if AUDIT_NR_FILTERS != 7
David Woodhousefe7752b2005-12-15 18:33:52 +000061#error Fix audit_filter_list initialiser
62#endif
63};
Al Viroe45aa212008-12-15 01:17:50 -050064static struct list_head audit_rules_list[AUDIT_NR_FILTERS] = {
65 LIST_HEAD_INIT(audit_rules_list[0]),
66 LIST_HEAD_INIT(audit_rules_list[1]),
67 LIST_HEAD_INIT(audit_rules_list[2]),
68 LIST_HEAD_INIT(audit_rules_list[3]),
69 LIST_HEAD_INIT(audit_rules_list[4]),
70 LIST_HEAD_INIT(audit_rules_list[5]),
Richard Guy Briggs42d5e372017-08-23 07:03:39 -040071 LIST_HEAD_INIT(audit_rules_list[6]),
Al Viroe45aa212008-12-15 01:17:50 -050072};
David Woodhousefe7752b2005-12-15 18:33:52 +000073
Al Viro74c3cbe2007-07-22 08:04:18 -040074DEFINE_MUTEX(audit_filter_mutex);
Amy Griffisf368c07d2006-04-07 16:55:56 -040075
Richard Guy Briggs219ca392014-03-26 07:26:47 -040076static void audit_free_lsm_field(struct audit_field *f)
77{
78 switch (f->type) {
79 case AUDIT_SUBJ_USER:
80 case AUDIT_SUBJ_ROLE:
81 case AUDIT_SUBJ_TYPE:
82 case AUDIT_SUBJ_SEN:
83 case AUDIT_SUBJ_CLR:
84 case AUDIT_OBJ_USER:
85 case AUDIT_OBJ_ROLE:
86 case AUDIT_OBJ_TYPE:
87 case AUDIT_OBJ_LEV_LOW:
88 case AUDIT_OBJ_LEV_HIGH:
89 kfree(f->lsm_str);
90 security_audit_rule_free(f->lsm_rule);
91 }
92}
93
Amy Griffis93315ed2006-02-07 12:05:27 -050094static inline void audit_free_rule(struct audit_entry *e)
David Woodhousefe7752b2005-12-15 18:33:52 +000095{
Darrel Goeddel3dc7e312006-03-10 18:14:06 -060096 int i;
Zhenwen Xuc28bb7d2009-03-12 22:16:12 +080097 struct audit_krule *erule = &e->rule;
Eric Parisae7b8f42009-12-17 20:12:04 -050098
Amy Griffisf368c07d2006-04-07 16:55:56 -040099 /* some rules don't have associated watches */
Zhenwen Xuc28bb7d2009-03-12 22:16:12 +0800100 if (erule->watch)
101 audit_put_watch(erule->watch);
102 if (erule->fields)
Richard Guy Briggs219ca392014-03-26 07:26:47 -0400103 for (i = 0; i < erule->field_count; i++)
104 audit_free_lsm_field(&erule->fields[i]);
Zhenwen Xuc28bb7d2009-03-12 22:16:12 +0800105 kfree(erule->fields);
106 kfree(erule->filterkey);
Amy Griffis93315ed2006-02-07 12:05:27 -0500107 kfree(e);
David Woodhousefe7752b2005-12-15 18:33:52 +0000108}
109
Al Viro74c3cbe2007-07-22 08:04:18 -0400110void audit_free_rule_rcu(struct rcu_head *head)
Amy Griffis93315ed2006-02-07 12:05:27 -0500111{
112 struct audit_entry *e = container_of(head, struct audit_entry, rcu);
113 audit_free_rule(e);
114}
115
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600116/* Initialize an audit filterlist entry. */
117static inline struct audit_entry *audit_init_entry(u32 field_count)
118{
119 struct audit_entry *entry;
120 struct audit_field *fields;
121
122 entry = kzalloc(sizeof(*entry), GFP_KERNEL);
123 if (unlikely(!entry))
124 return NULL;
125
Fabian Frederickbab5e2d2014-08-06 16:03:22 -0700126 fields = kcalloc(field_count, sizeof(*fields), GFP_KERNEL);
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600127 if (unlikely(!fields)) {
128 kfree(entry);
129 return NULL;
130 }
131 entry->rule.fields = fields;
132
133 return entry;
134}
135
Amy Griffis93315ed2006-02-07 12:05:27 -0500136/* Unpack a filter field's string representation from user-space
137 * buffer. */
Al Viro74c3cbe2007-07-22 08:04:18 -0400138char *audit_unpack_string(void **bufp, size_t *remain, size_t len)
Amy Griffis93315ed2006-02-07 12:05:27 -0500139{
140 char *str;
141
142 if (!*bufp || (len == 0) || (len > *remain))
143 return ERR_PTR(-EINVAL);
144
145 /* Of the currently implemented string fields, PATH_MAX
146 * defines the longest valid length.
147 */
148 if (len > PATH_MAX)
149 return ERR_PTR(-ENAMETOOLONG);
150
151 str = kmalloc(len + 1, GFP_KERNEL);
152 if (unlikely(!str))
153 return ERR_PTR(-ENOMEM);
154
155 memcpy(str, *bufp, len);
156 str[len] = 0;
157 *bufp += len;
158 *remain -= len;
159
160 return str;
161}
162
Wei Yuanfd976462016-02-06 15:39:47 +0800163/* Translate an inode field to kernel representation. */
Amy Griffisf368c07d2006-04-07 16:55:56 -0400164static inline int audit_to_inode(struct audit_krule *krule,
165 struct audit_field *f)
166{
167 if (krule->listnr != AUDIT_FILTER_EXIT ||
Richard Guy Briggs3639f172014-10-02 22:05:18 -0400168 krule->inode_f || krule->watch || krule->tree ||
Al Viro5af75d82008-12-16 05:59:26 -0500169 (f->op != Audit_equal && f->op != Audit_not_equal))
Amy Griffisf368c07d2006-04-07 16:55:56 -0400170 return -EINVAL;
171
172 krule->inode_f = f;
173 return 0;
174}
175
Al Virob9155432006-07-01 03:56:16 -0400176static __u32 *classes[AUDIT_SYSCALL_CLASSES];
177
178int __init audit_register_class(int class, unsigned *list)
179{
Fabian Frederickbab5e2d2014-08-06 16:03:22 -0700180 __u32 *p = kcalloc(AUDIT_BITMASK_SIZE, sizeof(__u32), GFP_KERNEL);
Al Virob9155432006-07-01 03:56:16 -0400181 if (!p)
182 return -ENOMEM;
183 while (*list != ~0U) {
184 unsigned n = *list++;
185 if (n >= AUDIT_BITMASK_SIZE * 32 - AUDIT_SYSCALL_CLASSES) {
186 kfree(p);
187 return -EINVAL;
188 }
189 p[AUDIT_WORD(n)] |= AUDIT_BIT(n);
190 }
191 if (class >= AUDIT_SYSCALL_CLASSES || classes[class]) {
192 kfree(p);
193 return -EINVAL;
194 }
195 classes[class] = p;
196 return 0;
197}
198
Al Viro55669bf2006-08-31 19:26:40 -0400199int audit_match_class(int class, unsigned syscall)
200{
Klaus Weidnerc926e4f2007-05-16 17:45:42 -0500201 if (unlikely(syscall >= AUDIT_BITMASK_SIZE * 32))
Al Viro55669bf2006-08-31 19:26:40 -0400202 return 0;
203 if (unlikely(class >= AUDIT_SYSCALL_CLASSES || !classes[class]))
204 return 0;
205 return classes[class][AUDIT_WORD(syscall)] & AUDIT_BIT(syscall);
206}
207
Al Viro327b9ee2007-05-15 20:37:10 +0100208#ifdef CONFIG_AUDITSYSCALL
Amy Griffise54dc242007-03-29 18:01:04 -0400209static inline int audit_match_class_bits(int class, u32 *mask)
210{
211 int i;
212
213 if (classes[class]) {
214 for (i = 0; i < AUDIT_BITMASK_SIZE; i++)
215 if (mask[i] & classes[class][i])
216 return 0;
217 }
218 return 1;
219}
220
221static int audit_match_signal(struct audit_entry *entry)
222{
223 struct audit_field *arch = entry->rule.arch_f;
224
225 if (!arch) {
226 /* When arch is unspecified, we must check both masks on biarch
227 * as syscall number alone is ambiguous. */
228 return (audit_match_class_bits(AUDIT_CLASS_SIGNAL,
229 entry->rule.mask) &&
230 audit_match_class_bits(AUDIT_CLASS_SIGNAL_32,
231 entry->rule.mask));
232 }
233
234 switch(audit_classify_arch(arch->val)) {
235 case 0: /* native */
236 return (audit_match_class_bits(AUDIT_CLASS_SIGNAL,
237 entry->rule.mask));
238 case 1: /* 32bit on biarch */
239 return (audit_match_class_bits(AUDIT_CLASS_SIGNAL_32,
240 entry->rule.mask));
241 default:
242 return 1;
243 }
244}
Al Viro327b9ee2007-05-15 20:37:10 +0100245#endif
Amy Griffise54dc242007-03-29 18:01:04 -0400246
Amy Griffis93315ed2006-02-07 12:05:27 -0500247/* Common user-space to kernel rule translation. */
Eric Paris56c49112014-04-02 15:46:42 -0400248static inline struct audit_entry *audit_to_entry_common(struct audit_rule_data *rule)
Amy Griffis93315ed2006-02-07 12:05:27 -0500249{
250 unsigned listnr;
251 struct audit_entry *entry;
Amy Griffis93315ed2006-02-07 12:05:27 -0500252 int i, err;
253
254 err = -EINVAL;
255 listnr = rule->flags & ~AUDIT_FILTER_PREPEND;
256 switch(listnr) {
257 default:
258 goto exit_err;
Amy Griffis93315ed2006-02-07 12:05:27 -0500259#ifdef CONFIG_AUDITSYSCALL
260 case AUDIT_FILTER_ENTRY:
Eric Paris7ff68e52012-01-03 14:23:07 -0500261 if (rule->action == AUDIT_ALWAYS)
262 goto exit_err;
Amy Griffis93315ed2006-02-07 12:05:27 -0500263 case AUDIT_FILTER_EXIT:
264 case AUDIT_FILTER_TASK:
265#endif
Eric Paris7ff68e52012-01-03 14:23:07 -0500266 case AUDIT_FILTER_USER:
267 case AUDIT_FILTER_TYPE:
Richard Guy Briggs42d5e372017-08-23 07:03:39 -0400268 case AUDIT_FILTER_FS:
Amy Griffis93315ed2006-02-07 12:05:27 -0500269 ;
270 }
Al Viro014149c2006-05-23 01:36:13 -0400271 if (unlikely(rule->action == AUDIT_POSSIBLE)) {
Richard Guy Briggsf952d102014-01-27 17:38:42 -0500272 pr_err("AUDIT_POSSIBLE is deprecated\n");
Al Viro014149c2006-05-23 01:36:13 -0400273 goto exit_err;
274 }
275 if (rule->action != AUDIT_NEVER && rule->action != AUDIT_ALWAYS)
Amy Griffis93315ed2006-02-07 12:05:27 -0500276 goto exit_err;
277 if (rule->field_count > AUDIT_MAX_FIELDS)
278 goto exit_err;
279
280 err = -ENOMEM;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600281 entry = audit_init_entry(rule->field_count);
282 if (!entry)
Amy Griffis93315ed2006-02-07 12:05:27 -0500283 goto exit_err;
Amy Griffis93315ed2006-02-07 12:05:27 -0500284
285 entry->rule.flags = rule->flags & AUDIT_FILTER_PREPEND;
286 entry->rule.listnr = listnr;
287 entry->rule.action = rule->action;
288 entry->rule.field_count = rule->field_count;
Amy Griffis93315ed2006-02-07 12:05:27 -0500289
290 for (i = 0; i < AUDIT_BITMASK_SIZE; i++)
291 entry->rule.mask[i] = rule->mask[i];
292
Al Virob9155432006-07-01 03:56:16 -0400293 for (i = 0; i < AUDIT_SYSCALL_CLASSES; i++) {
294 int bit = AUDIT_BITMASK_SIZE * 32 - i - 1;
295 __u32 *p = &entry->rule.mask[AUDIT_WORD(bit)];
296 __u32 *class;
297
298 if (!(*p & AUDIT_BIT(bit)))
299 continue;
300 *p &= ~AUDIT_BIT(bit);
301 class = classes[i];
302 if (class) {
303 int j;
304 for (j = 0; j < AUDIT_BITMASK_SIZE; j++)
305 entry->rule.mask[j] |= class[j];
306 }
307 }
308
Amy Griffis93315ed2006-02-07 12:05:27 -0500309 return entry;
310
311exit_err:
312 return ERR_PTR(err);
313}
314
Al Viro5af75d82008-12-16 05:59:26 -0500315static u32 audit_ops[] =
316{
317 [Audit_equal] = AUDIT_EQUAL,
318 [Audit_not_equal] = AUDIT_NOT_EQUAL,
319 [Audit_bitmask] = AUDIT_BIT_MASK,
320 [Audit_bittest] = AUDIT_BIT_TEST,
321 [Audit_lt] = AUDIT_LESS_THAN,
322 [Audit_gt] = AUDIT_GREATER_THAN,
323 [Audit_le] = AUDIT_LESS_THAN_OR_EQUAL,
324 [Audit_ge] = AUDIT_GREATER_THAN_OR_EQUAL,
325};
326
327static u32 audit_to_op(u32 op)
328{
329 u32 n;
330 for (n = Audit_equal; n < Audit_bad && audit_ops[n] != op; n++)
331 ;
332 return n;
333}
334
Eric Parisab61d382013-04-16 17:26:51 -0400335/* check if an audit field is valid */
Eric Paris62062cf2013-04-16 13:08:43 -0400336static int audit_field_valid(struct audit_entry *entry, struct audit_field *f)
Amy Griffis93315ed2006-02-07 12:05:27 -0500337{
Eric Paris62062cf2013-04-16 13:08:43 -0400338 switch(f->type) {
339 case AUDIT_MSGTYPE:
340 if (entry->rule.listnr != AUDIT_FILTER_TYPE &&
341 entry->rule.listnr != AUDIT_FILTER_USER)
342 return -EINVAL;
343 break;
Richard Guy Briggs42d5e372017-08-23 07:03:39 -0400344 case AUDIT_FSTYPE:
345 if (entry->rule.listnr != AUDIT_FILTER_FS)
346 return -EINVAL;
347 break;
348 }
349
350 switch(entry->rule.listnr) {
351 case AUDIT_FILTER_FS:
352 switch(f->type) {
353 case AUDIT_FSTYPE:
354 case AUDIT_FILTERKEY:
355 break;
356 default:
357 return -EINVAL;
358 }
Nicholas Mc Guireb7a84de2017-05-02 10:16:03 -0400359 }
Amy Griffis93315ed2006-02-07 12:05:27 -0500360
Eric Parisab61d382013-04-16 17:26:51 -0400361 switch(f->type) {
362 default:
363 return -EINVAL;
364 case AUDIT_UID:
365 case AUDIT_EUID:
366 case AUDIT_SUID:
367 case AUDIT_FSUID:
368 case AUDIT_LOGINUID:
369 case AUDIT_OBJ_UID:
370 case AUDIT_GID:
371 case AUDIT_EGID:
372 case AUDIT_SGID:
373 case AUDIT_FSGID:
374 case AUDIT_OBJ_GID:
375 case AUDIT_PID:
376 case AUDIT_PERS:
377 case AUDIT_MSGTYPE:
378 case AUDIT_PPID:
379 case AUDIT_DEVMAJOR:
380 case AUDIT_DEVMINOR:
381 case AUDIT_EXIT:
382 case AUDIT_SUCCESS:
Eric Paris78122032013-09-04 15:01:43 -0400383 case AUDIT_INODE:
Richard Guy Briggs8fae4772016-11-20 16:47:55 -0500384 case AUDIT_SESSIONID:
Eric Parisab61d382013-04-16 17:26:51 -0400385 /* bit ops are only useful on syscall args */
386 if (f->op == Audit_bitmask || f->op == Audit_bittest)
387 return -EINVAL;
388 break;
389 case AUDIT_ARG0:
390 case AUDIT_ARG1:
391 case AUDIT_ARG2:
392 case AUDIT_ARG3:
393 case AUDIT_SUBJ_USER:
394 case AUDIT_SUBJ_ROLE:
395 case AUDIT_SUBJ_TYPE:
396 case AUDIT_SUBJ_SEN:
397 case AUDIT_SUBJ_CLR:
398 case AUDIT_OBJ_USER:
399 case AUDIT_OBJ_ROLE:
400 case AUDIT_OBJ_TYPE:
401 case AUDIT_OBJ_LEV_LOW:
402 case AUDIT_OBJ_LEV_HIGH:
403 case AUDIT_WATCH:
404 case AUDIT_DIR:
405 case AUDIT_FILTERKEY:
406 break;
Eric W. Biederman780a7652013-04-09 02:22:10 -0700407 case AUDIT_LOGINUID_SET:
408 if ((f->val != 0) && (f->val != 1))
409 return -EINVAL;
410 /* FALL THROUGH */
Eric Parisab61d382013-04-16 17:26:51 -0400411 case AUDIT_ARCH:
Richard Guy Briggs42d5e372017-08-23 07:03:39 -0400412 case AUDIT_FSTYPE:
Eric Parisab61d382013-04-16 17:26:51 -0400413 if (f->op != Audit_not_equal && f->op != Audit_equal)
414 return -EINVAL;
415 break;
416 case AUDIT_PERM:
417 if (f->val & ~15)
418 return -EINVAL;
419 break;
420 case AUDIT_FILETYPE:
421 if (f->val & ~S_IFMT)
422 return -EINVAL;
423 break;
424 case AUDIT_FIELD_COMPARE:
425 if (f->val > AUDIT_MAX_FIELD_COMPARE)
426 return -EINVAL;
427 break;
Richard Guy Briggs34d99af52015-08-05 16:29:37 -0400428 case AUDIT_EXE:
429 if (f->op != Audit_equal)
430 return -EINVAL;
431 if (entry->rule.listnr != AUDIT_FILTER_EXIT)
432 return -EINVAL;
433 break;
Nicholas Mc Guireb7a84de2017-05-02 10:16:03 -0400434 }
Eric Paris62062cf2013-04-16 13:08:43 -0400435 return 0;
Amy Griffis93315ed2006-02-07 12:05:27 -0500436}
437
Wei Yuanfd976462016-02-06 15:39:47 +0800438/* Translate struct audit_rule_data to kernel's rule representation. */
Amy Griffis93315ed2006-02-07 12:05:27 -0500439static struct audit_entry *audit_data_to_entry(struct audit_rule_data *data,
440 size_t datasz)
441{
442 int err = 0;
443 struct audit_entry *entry;
444 void *bufp;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600445 size_t remain = datasz - sizeof(struct audit_rule_data);
Amy Griffis93315ed2006-02-07 12:05:27 -0500446 int i;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600447 char *str;
Richard Guy Briggs34d99af52015-08-05 16:29:37 -0400448 struct audit_fsnotify_mark *audit_mark;
Amy Griffis93315ed2006-02-07 12:05:27 -0500449
Eric Paris56c49112014-04-02 15:46:42 -0400450 entry = audit_to_entry_common(data);
Amy Griffis93315ed2006-02-07 12:05:27 -0500451 if (IS_ERR(entry))
452 goto exit_nofree;
453
454 bufp = data->buf;
Amy Griffis93315ed2006-02-07 12:05:27 -0500455 for (i = 0; i < data->field_count; i++) {
456 struct audit_field *f = &entry->rule.fields[i];
457
458 err = -EINVAL;
Al Viro5af75d82008-12-16 05:59:26 -0500459
460 f->op = audit_to_op(data->fieldflags[i]);
461 if (f->op == Audit_bad)
Amy Griffis93315ed2006-02-07 12:05:27 -0500462 goto exit_free;
463
Amy Griffis93315ed2006-02-07 12:05:27 -0500464 f->type = data->fields[i];
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600465 f->val = data->values[i];
Eric Paris62062cf2013-04-16 13:08:43 -0400466
Eric W. Biederman780a7652013-04-09 02:22:10 -0700467 /* Support legacy tests for a valid loginuid */
Richard Guy Briggs42f74462013-05-20 15:08:18 -0400468 if ((f->type == AUDIT_LOGINUID) && (f->val == AUDIT_UID_UNSET)) {
Eric W. Biederman780a7652013-04-09 02:22:10 -0700469 f->type = AUDIT_LOGINUID_SET;
470 f->val = 0;
Richard Guy Briggs041d7b92014-12-23 13:02:04 -0500471 entry->rule.pflags |= AUDIT_LOGINUID_LEGACY;
Richard Guy Briggsf1dc4862013-12-11 13:52:26 -0500472 }
473
Eric Paris62062cf2013-04-16 13:08:43 -0400474 err = audit_field_valid(entry, f);
475 if (err)
476 goto exit_free;
477
478 err = -EINVAL;
Eric Parisab61d382013-04-16 17:26:51 -0400479 switch (f->type) {
Eric W. Biederman780a7652013-04-09 02:22:10 -0700480 case AUDIT_LOGINUID:
Al Viro0a73dcc2006-06-05 08:15:59 -0400481 case AUDIT_UID:
482 case AUDIT_EUID:
483 case AUDIT_SUID:
484 case AUDIT_FSUID:
Eric W. Biedermanca57ec02012-09-11 02:18:08 -0700485 case AUDIT_OBJ_UID:
Eric W. Biedermanca57ec02012-09-11 02:18:08 -0700486 f->uid = make_kuid(current_user_ns(), f->val);
487 if (!uid_valid(f->uid))
488 goto exit_free;
489 break;
Al Viro0a73dcc2006-06-05 08:15:59 -0400490 case AUDIT_GID:
491 case AUDIT_EGID:
492 case AUDIT_SGID:
493 case AUDIT_FSGID:
Eric W. Biedermanca57ec02012-09-11 02:18:08 -0700494 case AUDIT_OBJ_GID:
Eric W. Biedermanca57ec02012-09-11 02:18:08 -0700495 f->gid = make_kgid(current_user_ns(), f->val);
496 if (!gid_valid(f->gid))
497 goto exit_free;
498 break;
Richard Guy Briggs8fae4772016-11-20 16:47:55 -0500499 case AUDIT_SESSIONID:
Amy Griffise54dc242007-03-29 18:01:04 -0400500 case AUDIT_ARCH:
501 entry->rule.arch_f = f;
502 break;
Darrel Goeddel3a6b9f82006-06-29 16:56:39 -0500503 case AUDIT_SUBJ_USER:
504 case AUDIT_SUBJ_ROLE:
505 case AUDIT_SUBJ_TYPE:
506 case AUDIT_SUBJ_SEN:
507 case AUDIT_SUBJ_CLR:
Darrel Goeddel6e5a2d12006-06-29 16:57:08 -0500508 case AUDIT_OBJ_USER:
509 case AUDIT_OBJ_ROLE:
510 case AUDIT_OBJ_TYPE:
511 case AUDIT_OBJ_LEV_LOW:
512 case AUDIT_OBJ_LEV_HIGH:
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600513 str = audit_unpack_string(&bufp, &remain, f->val);
514 if (IS_ERR(str))
515 goto exit_free;
516 entry->rule.buflen += f->val;
517
Ahmed S. Darwishd7a96f32008-03-01 22:01:11 +0200518 err = security_audit_rule_init(f->type, f->op, str,
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000519 (void **)&f->lsm_rule);
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600520 /* Keep currently invalid fields around in case they
521 * become valid after a policy reload. */
522 if (err == -EINVAL) {
Richard Guy Briggsf952d102014-01-27 17:38:42 -0500523 pr_warn("audit rule for LSM \'%s\' is invalid\n",
524 str);
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600525 err = 0;
526 }
527 if (err) {
528 kfree(str);
529 goto exit_free;
530 } else
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000531 f->lsm_str = str;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600532 break;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400533 case AUDIT_WATCH:
534 str = audit_unpack_string(&bufp, &remain, f->val);
535 if (IS_ERR(str))
536 goto exit_free;
537 entry->rule.buflen += f->val;
538
539 err = audit_to_watch(&entry->rule, str, f->val, f->op);
540 if (err) {
541 kfree(str);
542 goto exit_free;
543 }
544 break;
Al Viro74c3cbe2007-07-22 08:04:18 -0400545 case AUDIT_DIR:
546 str = audit_unpack_string(&bufp, &remain, f->val);
547 if (IS_ERR(str))
548 goto exit_free;
549 entry->rule.buflen += f->val;
550
551 err = audit_make_tree(&entry->rule, str, f->op);
552 kfree(str);
553 if (err)
554 goto exit_free;
555 break;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400556 case AUDIT_INODE:
557 err = audit_to_inode(&entry->rule, f);
558 if (err)
559 goto exit_free;
560 break;
Amy Griffis5adc8a62006-06-14 18:45:21 -0400561 case AUDIT_FILTERKEY:
Amy Griffis5adc8a62006-06-14 18:45:21 -0400562 if (entry->rule.filterkey || f->val > AUDIT_MAX_KEY_LEN)
563 goto exit_free;
564 str = audit_unpack_string(&bufp, &remain, f->val);
565 if (IS_ERR(str))
566 goto exit_free;
567 entry->rule.buflen += f->val;
568 entry->rule.filterkey = str;
569 break;
Richard Guy Briggs34d99af52015-08-05 16:29:37 -0400570 case AUDIT_EXE:
571 if (entry->rule.exe || f->val > PATH_MAX)
572 goto exit_free;
573 str = audit_unpack_string(&bufp, &remain, f->val);
574 if (IS_ERR(str)) {
575 err = PTR_ERR(str);
576 goto exit_free;
577 }
578 entry->rule.buflen += f->val;
579
580 audit_mark = audit_alloc_mark(&entry->rule, str, f->val);
581 if (IS_ERR(audit_mark)) {
582 kfree(str);
583 err = PTR_ERR(audit_mark);
584 goto exit_free;
585 }
586 entry->rule.exe = audit_mark;
587 break;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400588 }
589 }
590
Al Viro5af75d82008-12-16 05:59:26 -0500591 if (entry->rule.inode_f && entry->rule.inode_f->op == Audit_not_equal)
592 entry->rule.inode_f = NULL;
Amy Griffis93315ed2006-02-07 12:05:27 -0500593
594exit_nofree:
595 return entry;
596
597exit_free:
Chen Gang373e0f32013-04-29 15:05:18 -0700598 if (entry->rule.tree)
599 audit_put_tree(entry->rule.tree); /* that's the temporary one */
Richard Guy Briggs34d99af52015-08-05 16:29:37 -0400600 if (entry->rule.exe)
601 audit_remove_mark(entry->rule.exe); /* that's the template one */
Amy Griffis93315ed2006-02-07 12:05:27 -0500602 audit_free_rule(entry);
603 return ERR_PTR(err);
604}
605
606/* Pack a filter field's string representation into data block. */
Al Viro74c3cbe2007-07-22 08:04:18 -0400607static inline size_t audit_pack_string(void **bufp, const char *str)
Amy Griffis93315ed2006-02-07 12:05:27 -0500608{
609 size_t len = strlen(str);
610
611 memcpy(*bufp, str, len);
612 *bufp += len;
613
614 return len;
615}
616
Wei Yuanfd976462016-02-06 15:39:47 +0800617/* Translate kernel rule representation to struct audit_rule_data. */
Amy Griffis93315ed2006-02-07 12:05:27 -0500618static struct audit_rule_data *audit_krule_to_data(struct audit_krule *krule)
619{
620 struct audit_rule_data *data;
621 void *bufp;
622 int i;
623
624 data = kmalloc(sizeof(*data) + krule->buflen, GFP_KERNEL);
625 if (unlikely(!data))
Amy Griffis0a3b4832006-05-02 15:06:01 -0400626 return NULL;
Amy Griffis93315ed2006-02-07 12:05:27 -0500627 memset(data, 0, sizeof(*data));
628
629 data->flags = krule->flags | krule->listnr;
630 data->action = krule->action;
631 data->field_count = krule->field_count;
632 bufp = data->buf;
633 for (i = 0; i < data->field_count; i++) {
634 struct audit_field *f = &krule->fields[i];
635
636 data->fields[i] = f->type;
Al Viro5af75d82008-12-16 05:59:26 -0500637 data->fieldflags[i] = audit_ops[f->op];
Amy Griffis93315ed2006-02-07 12:05:27 -0500638 switch(f->type) {
Darrel Goeddel3a6b9f82006-06-29 16:56:39 -0500639 case AUDIT_SUBJ_USER:
640 case AUDIT_SUBJ_ROLE:
641 case AUDIT_SUBJ_TYPE:
642 case AUDIT_SUBJ_SEN:
643 case AUDIT_SUBJ_CLR:
Darrel Goeddel6e5a2d12006-06-29 16:57:08 -0500644 case AUDIT_OBJ_USER:
645 case AUDIT_OBJ_ROLE:
646 case AUDIT_OBJ_TYPE:
647 case AUDIT_OBJ_LEV_LOW:
648 case AUDIT_OBJ_LEV_HIGH:
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600649 data->buflen += data->values[i] =
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000650 audit_pack_string(&bufp, f->lsm_str);
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600651 break;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400652 case AUDIT_WATCH:
653 data->buflen += data->values[i] =
Eric Pariscfcad622009-06-11 14:31:36 -0400654 audit_pack_string(&bufp,
655 audit_watch_path(krule->watch));
Amy Griffisf368c07d2006-04-07 16:55:56 -0400656 break;
Al Viro74c3cbe2007-07-22 08:04:18 -0400657 case AUDIT_DIR:
658 data->buflen += data->values[i] =
659 audit_pack_string(&bufp,
660 audit_tree_path(krule->tree));
661 break;
Amy Griffis5adc8a62006-06-14 18:45:21 -0400662 case AUDIT_FILTERKEY:
663 data->buflen += data->values[i] =
664 audit_pack_string(&bufp, krule->filterkey);
665 break;
Richard Guy Briggs34d99af52015-08-05 16:29:37 -0400666 case AUDIT_EXE:
667 data->buflen += data->values[i] =
668 audit_pack_string(&bufp, audit_mark_path(krule->exe));
669 break;
Richard Guy Briggs041d7b92014-12-23 13:02:04 -0500670 case AUDIT_LOGINUID_SET:
671 if (krule->pflags & AUDIT_LOGINUID_LEGACY && !f->val) {
672 data->fields[i] = AUDIT_LOGINUID;
673 data->values[i] = AUDIT_UID_UNSET;
674 break;
675 }
676 /* fallthrough if set */
Amy Griffis93315ed2006-02-07 12:05:27 -0500677 default:
678 data->values[i] = f->val;
679 }
680 }
681 for (i = 0; i < AUDIT_BITMASK_SIZE; i++) data->mask[i] = krule->mask[i];
682
683 return data;
684}
685
686/* Compare two rules in kernel format. Considered success if rules
687 * don't match. */
688static int audit_compare_rule(struct audit_krule *a, struct audit_krule *b)
David Woodhousefe7752b2005-12-15 18:33:52 +0000689{
690 int i;
691
Amy Griffis93315ed2006-02-07 12:05:27 -0500692 if (a->flags != b->flags ||
Richard Guy Briggs041d7b92014-12-23 13:02:04 -0500693 a->pflags != b->pflags ||
Amy Griffis93315ed2006-02-07 12:05:27 -0500694 a->listnr != b->listnr ||
695 a->action != b->action ||
696 a->field_count != b->field_count)
David Woodhousefe7752b2005-12-15 18:33:52 +0000697 return 1;
698
699 for (i = 0; i < a->field_count; i++) {
Amy Griffis93315ed2006-02-07 12:05:27 -0500700 if (a->fields[i].type != b->fields[i].type ||
701 a->fields[i].op != b->fields[i].op)
David Woodhousefe7752b2005-12-15 18:33:52 +0000702 return 1;
Amy Griffis93315ed2006-02-07 12:05:27 -0500703
704 switch(a->fields[i].type) {
Darrel Goeddel3a6b9f82006-06-29 16:56:39 -0500705 case AUDIT_SUBJ_USER:
706 case AUDIT_SUBJ_ROLE:
707 case AUDIT_SUBJ_TYPE:
708 case AUDIT_SUBJ_SEN:
709 case AUDIT_SUBJ_CLR:
Darrel Goeddel6e5a2d12006-06-29 16:57:08 -0500710 case AUDIT_OBJ_USER:
711 case AUDIT_OBJ_ROLE:
712 case AUDIT_OBJ_TYPE:
713 case AUDIT_OBJ_LEV_LOW:
714 case AUDIT_OBJ_LEV_HIGH:
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000715 if (strcmp(a->fields[i].lsm_str, b->fields[i].lsm_str))
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600716 return 1;
717 break;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400718 case AUDIT_WATCH:
Eric Pariscfcad622009-06-11 14:31:36 -0400719 if (strcmp(audit_watch_path(a->watch),
720 audit_watch_path(b->watch)))
Amy Griffisf368c07d2006-04-07 16:55:56 -0400721 return 1;
722 break;
Al Viro74c3cbe2007-07-22 08:04:18 -0400723 case AUDIT_DIR:
724 if (strcmp(audit_tree_path(a->tree),
725 audit_tree_path(b->tree)))
726 return 1;
727 break;
Amy Griffis5adc8a62006-06-14 18:45:21 -0400728 case AUDIT_FILTERKEY:
729 /* both filterkeys exist based on above type compare */
730 if (strcmp(a->filterkey, b->filterkey))
731 return 1;
732 break;
Richard Guy Briggs34d99af52015-08-05 16:29:37 -0400733 case AUDIT_EXE:
734 /* both paths exist based on above type compare */
735 if (strcmp(audit_mark_path(a->exe),
736 audit_mark_path(b->exe)))
737 return 1;
738 break;
Eric W. Biedermanca57ec02012-09-11 02:18:08 -0700739 case AUDIT_UID:
740 case AUDIT_EUID:
741 case AUDIT_SUID:
742 case AUDIT_FSUID:
743 case AUDIT_LOGINUID:
744 case AUDIT_OBJ_UID:
745 if (!uid_eq(a->fields[i].uid, b->fields[i].uid))
746 return 1;
747 break;
748 case AUDIT_GID:
749 case AUDIT_EGID:
750 case AUDIT_SGID:
751 case AUDIT_FSGID:
752 case AUDIT_OBJ_GID:
753 if (!gid_eq(a->fields[i].gid, b->fields[i].gid))
754 return 1;
755 break;
Amy Griffis93315ed2006-02-07 12:05:27 -0500756 default:
757 if (a->fields[i].val != b->fields[i].val)
758 return 1;
759 }
David Woodhousefe7752b2005-12-15 18:33:52 +0000760 }
761
762 for (i = 0; i < AUDIT_BITMASK_SIZE; i++)
763 if (a->mask[i] != b->mask[i])
764 return 1;
765
766 return 0;
767}
768
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000769/* Duplicate LSM field information. The lsm_rule is opaque, so must be
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600770 * re-initialized. */
Ahmed S. Darwishd7a96f32008-03-01 22:01:11 +0200771static inline int audit_dupe_lsm_field(struct audit_field *df,
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600772 struct audit_field *sf)
773{
774 int ret = 0;
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000775 char *lsm_str;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600776
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000777 /* our own copy of lsm_str */
778 lsm_str = kstrdup(sf->lsm_str, GFP_KERNEL);
779 if (unlikely(!lsm_str))
Akinobu Mita3e1fbd12006-12-22 01:10:02 -0800780 return -ENOMEM;
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000781 df->lsm_str = lsm_str;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600782
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000783 /* our own (refreshed) copy of lsm_rule */
784 ret = security_audit_rule_init(df->type, df->op, df->lsm_str,
785 (void **)&df->lsm_rule);
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600786 /* Keep currently invalid fields around in case they
787 * become valid after a policy reload. */
788 if (ret == -EINVAL) {
Richard Guy Briggsf952d102014-01-27 17:38:42 -0500789 pr_warn("audit rule for LSM \'%s\' is invalid\n",
790 df->lsm_str);
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600791 ret = 0;
792 }
793
794 return ret;
795}
796
797/* Duplicate an audit rule. This will be a deep copy with the exception
Ahmed S. Darwishd7a96f32008-03-01 22:01:11 +0200798 * of the watch - that pointer is carried over. The LSM specific fields
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600799 * will be updated in the copy. The point is to be able to replace the old
Amy Griffisf368c07d2006-04-07 16:55:56 -0400800 * rule with the new rule in the filterlist, then free the old rule.
801 * The rlist element is undefined; list manipulations are handled apart from
802 * the initial copy. */
Eric Parisae7b8f42009-12-17 20:12:04 -0500803struct audit_entry *audit_dupe_rule(struct audit_krule *old)
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600804{
805 u32 fcount = old->field_count;
806 struct audit_entry *entry;
807 struct audit_krule *new;
Amy Griffis5adc8a62006-06-14 18:45:21 -0400808 char *fk;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600809 int i, err = 0;
810
811 entry = audit_init_entry(fcount);
812 if (unlikely(!entry))
813 return ERR_PTR(-ENOMEM);
814
815 new = &entry->rule;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600816 new->flags = old->flags;
Richard Guy Briggs041d7b92014-12-23 13:02:04 -0500817 new->pflags = old->pflags;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600818 new->listnr = old->listnr;
819 new->action = old->action;
820 for (i = 0; i < AUDIT_BITMASK_SIZE; i++)
821 new->mask[i] = old->mask[i];
Al Viro0590b932008-12-14 23:45:27 -0500822 new->prio = old->prio;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600823 new->buflen = old->buflen;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400824 new->inode_f = old->inode_f;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600825 new->field_count = old->field_count;
Eric Parisae7b8f42009-12-17 20:12:04 -0500826
Al Viro74c3cbe2007-07-22 08:04:18 -0400827 /*
828 * note that we are OK with not refcounting here; audit_match_tree()
829 * never dereferences tree and we can't get false positives there
830 * since we'd have to have rule gone from the list *and* removed
831 * before the chunks found by lookup had been allocated, i.e. before
832 * the beginning of list scan.
833 */
834 new->tree = old->tree;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600835 memcpy(new->fields, old->fields, sizeof(struct audit_field) * fcount);
836
Ahmed S. Darwish04305e42008-04-19 09:59:43 +1000837 /* deep copy this information, updating the lsm_rule fields, because
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600838 * the originals will all be freed when the old rule is freed. */
839 for (i = 0; i < fcount; i++) {
840 switch (new->fields[i].type) {
Darrel Goeddel3a6b9f82006-06-29 16:56:39 -0500841 case AUDIT_SUBJ_USER:
842 case AUDIT_SUBJ_ROLE:
843 case AUDIT_SUBJ_TYPE:
844 case AUDIT_SUBJ_SEN:
845 case AUDIT_SUBJ_CLR:
Darrel Goeddel6e5a2d12006-06-29 16:57:08 -0500846 case AUDIT_OBJ_USER:
847 case AUDIT_OBJ_ROLE:
848 case AUDIT_OBJ_TYPE:
849 case AUDIT_OBJ_LEV_LOW:
850 case AUDIT_OBJ_LEV_HIGH:
Ahmed S. Darwishd7a96f32008-03-01 22:01:11 +0200851 err = audit_dupe_lsm_field(&new->fields[i],
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600852 &old->fields[i]);
Amy Griffis5adc8a62006-06-14 18:45:21 -0400853 break;
854 case AUDIT_FILTERKEY:
855 fk = kstrdup(old->filterkey, GFP_KERNEL);
856 if (unlikely(!fk))
857 err = -ENOMEM;
858 else
859 new->filterkey = fk;
Richard Guy Briggs34d99af52015-08-05 16:29:37 -0400860 break;
861 case AUDIT_EXE:
862 err = audit_dupe_exe(new, old);
863 break;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600864 }
865 if (err) {
Richard Guy Briggs34d99af52015-08-05 16:29:37 -0400866 if (new->exe)
867 audit_remove_mark(new->exe);
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600868 audit_free_rule(entry);
869 return ERR_PTR(err);
870 }
871 }
872
Eric Parisae7b8f42009-12-17 20:12:04 -0500873 if (old->watch) {
874 audit_get_watch(old->watch);
875 new->watch = old->watch;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400876 }
877
Darrel Goeddel3dc7e312006-03-10 18:14:06 -0600878 return entry;
879}
880
Amy Griffisf368c07d2006-04-07 16:55:56 -0400881/* Find an existing audit rule.
882 * Caller must hold audit_filter_mutex to prevent stale rule data. */
883static struct audit_entry *audit_find_rule(struct audit_entry *entry,
Al Viro36c4f1b12008-12-15 01:50:28 -0500884 struct list_head **p)
Amy Griffisf368c07d2006-04-07 16:55:56 -0400885{
886 struct audit_entry *e, *found = NULL;
Al Viro36c4f1b12008-12-15 01:50:28 -0500887 struct list_head *list;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400888 int h;
889
Al Viro36c4f1b12008-12-15 01:50:28 -0500890 if (entry->rule.inode_f) {
891 h = audit_hash_ino(entry->rule.inode_f->val);
892 *p = list = &audit_inode_hash[h];
893 } else if (entry->rule.watch) {
Amy Griffisf368c07d2006-04-07 16:55:56 -0400894 /* we don't know the inode number, so must walk entire hash */
895 for (h = 0; h < AUDIT_INODE_BUCKETS; h++) {
896 list = &audit_inode_hash[h];
897 list_for_each_entry(e, list, list)
898 if (!audit_compare_rule(&entry->rule, &e->rule)) {
899 found = e;
900 goto out;
901 }
902 }
903 goto out;
Al Viro36c4f1b12008-12-15 01:50:28 -0500904 } else {
905 *p = list = &audit_filter_list[entry->rule.listnr];
Amy Griffisf368c07d2006-04-07 16:55:56 -0400906 }
907
908 list_for_each_entry(e, list, list)
909 if (!audit_compare_rule(&entry->rule, &e->rule)) {
910 found = e;
911 goto out;
912 }
913
914out:
915 return found;
916}
917
Al Viro0590b932008-12-14 23:45:27 -0500918static u64 prio_low = ~0ULL/2;
919static u64 prio_high = ~0ULL/2 - 1;
920
Amy Griffisf368c07d2006-04-07 16:55:56 -0400921/* Add rule to given filterlist if not a duplicate. */
Al Viro36c4f1b12008-12-15 01:50:28 -0500922static inline int audit_add_rule(struct audit_entry *entry)
Amy Griffisf368c07d2006-04-07 16:55:56 -0400923{
924 struct audit_entry *e;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400925 struct audit_watch *watch = entry->rule.watch;
Al Viro74c3cbe2007-07-22 08:04:18 -0400926 struct audit_tree *tree = entry->rule.tree;
Al Viro36c4f1b12008-12-15 01:50:28 -0500927 struct list_head *list;
Paul Mooreae9d2fb2015-08-05 11:19:45 -0400928 int err = 0;
Al Viro471a5c72006-07-10 08:29:24 -0400929#ifdef CONFIG_AUDITSYSCALL
930 int dont_count = 0;
931
Richard Guy Briggs42d5e372017-08-23 07:03:39 -0400932 /* If any of these, don't count towards total */
933 switch(entry->rule.listnr) {
934 case AUDIT_FILTER_USER:
935 case AUDIT_FILTER_TYPE:
936 case AUDIT_FILTER_FS:
Al Viro471a5c72006-07-10 08:29:24 -0400937 dont_count = 1;
Richard Guy Briggs42d5e372017-08-23 07:03:39 -0400938 }
Al Viro471a5c72006-07-10 08:29:24 -0400939#endif
Amy Griffisf368c07d2006-04-07 16:55:56 -0400940
Amy Griffisf368c07d2006-04-07 16:55:56 -0400941 mutex_lock(&audit_filter_mutex);
Al Viro36c4f1b12008-12-15 01:50:28 -0500942 e = audit_find_rule(entry, &list);
Amy Griffisf368c07d2006-04-07 16:55:56 -0400943 if (e) {
Eric Paris35fe4d02009-06-11 14:31:36 -0400944 mutex_unlock(&audit_filter_mutex);
Amy Griffisf368c07d2006-04-07 16:55:56 -0400945 err = -EEXIST;
Al Viro74c3cbe2007-07-22 08:04:18 -0400946 /* normally audit_add_tree_rule() will free it on failure */
947 if (tree)
948 audit_put_tree(tree);
Richard Guy Briggsf8259b22015-08-01 15:41:12 -0400949 return err;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400950 }
951
Amy Griffisf368c07d2006-04-07 16:55:56 -0400952 if (watch) {
953 /* audit_filter_mutex is dropped and re-taken during this call */
Eric Parisae7b8f42009-12-17 20:12:04 -0500954 err = audit_add_watch(&entry->rule, &list);
Amy Griffisf368c07d2006-04-07 16:55:56 -0400955 if (err) {
956 mutex_unlock(&audit_filter_mutex);
Chen Gang2f992ee2013-07-08 15:59:38 -0700957 /*
958 * normally audit_add_tree_rule() will free it
959 * on failure
960 */
961 if (tree)
962 audit_put_tree(tree);
Richard Guy Briggsf8259b22015-08-01 15:41:12 -0400963 return err;
Amy Griffisf368c07d2006-04-07 16:55:56 -0400964 }
David Woodhousefe7752b2005-12-15 18:33:52 +0000965 }
Al Viro74c3cbe2007-07-22 08:04:18 -0400966 if (tree) {
967 err = audit_add_tree_rule(&entry->rule);
968 if (err) {
969 mutex_unlock(&audit_filter_mutex);
Richard Guy Briggsf8259b22015-08-01 15:41:12 -0400970 return err;
Al Viro74c3cbe2007-07-22 08:04:18 -0400971 }
972 }
David Woodhousefe7752b2005-12-15 18:33:52 +0000973
Al Viro0590b932008-12-14 23:45:27 -0500974 entry->rule.prio = ~0ULL;
975 if (entry->rule.listnr == AUDIT_FILTER_EXIT) {
976 if (entry->rule.flags & AUDIT_FILTER_PREPEND)
977 entry->rule.prio = ++prio_high;
978 else
979 entry->rule.prio = --prio_low;
980 }
981
David Woodhousefe7752b2005-12-15 18:33:52 +0000982 if (entry->rule.flags & AUDIT_FILTER_PREPEND) {
Al Viroe45aa212008-12-15 01:17:50 -0500983 list_add(&entry->rule.list,
984 &audit_rules_list[entry->rule.listnr]);
David Woodhousefe7752b2005-12-15 18:33:52 +0000985 list_add_rcu(&entry->list, list);
Amy Griffis6a2bcee2006-06-02 13:16:01 -0400986 entry->rule.flags &= ~AUDIT_FILTER_PREPEND;
David Woodhousefe7752b2005-12-15 18:33:52 +0000987 } else {
Al Viroe45aa212008-12-15 01:17:50 -0500988 list_add_tail(&entry->rule.list,
989 &audit_rules_list[entry->rule.listnr]);
David Woodhousefe7752b2005-12-15 18:33:52 +0000990 list_add_tail_rcu(&entry->list, list);
991 }
Al Viro471a5c72006-07-10 08:29:24 -0400992#ifdef CONFIG_AUDITSYSCALL
993 if (!dont_count)
994 audit_n_rules++;
Amy Griffise54dc242007-03-29 18:01:04 -0400995
996 if (!audit_match_signal(entry))
997 audit_signals++;
Al Viro471a5c72006-07-10 08:29:24 -0400998#endif
Amy Griffisf368c07d2006-04-07 16:55:56 -0400999 mutex_unlock(&audit_filter_mutex);
David Woodhousefe7752b2005-12-15 18:33:52 +00001000
Amy Griffisf368c07d2006-04-07 16:55:56 -04001001 return err;
David Woodhousefe7752b2005-12-15 18:33:52 +00001002}
1003
Amy Griffisf368c07d2006-04-07 16:55:56 -04001004/* Remove an existing rule from filterlist. */
Richard Guy Briggs7f492942015-08-05 16:29:36 -04001005int audit_del_rule(struct audit_entry *entry)
David Woodhousefe7752b2005-12-15 18:33:52 +00001006{
1007 struct audit_entry *e;
Al Viro74c3cbe2007-07-22 08:04:18 -04001008 struct audit_tree *tree = entry->rule.tree;
Al Viro36c4f1b12008-12-15 01:50:28 -05001009 struct list_head *list;
Al Viro36c4f1b12008-12-15 01:50:28 -05001010 int ret = 0;
Al Viro471a5c72006-07-10 08:29:24 -04001011#ifdef CONFIG_AUDITSYSCALL
1012 int dont_count = 0;
1013
Richard Guy Briggs42d5e372017-08-23 07:03:39 -04001014 /* If any of these, don't count towards total */
1015 switch(entry->rule.listnr) {
1016 case AUDIT_FILTER_USER:
1017 case AUDIT_FILTER_TYPE:
1018 case AUDIT_FILTER_FS:
Al Viro471a5c72006-07-10 08:29:24 -04001019 dont_count = 1;
Richard Guy Briggs42d5e372017-08-23 07:03:39 -04001020 }
Al Viro471a5c72006-07-10 08:29:24 -04001021#endif
David Woodhousefe7752b2005-12-15 18:33:52 +00001022
Amy Griffisf368c07d2006-04-07 16:55:56 -04001023 mutex_lock(&audit_filter_mutex);
Al Viro36c4f1b12008-12-15 01:50:28 -05001024 e = audit_find_rule(entry, &list);
Amy Griffisf368c07d2006-04-07 16:55:56 -04001025 if (!e) {
Amy Griffisf368c07d2006-04-07 16:55:56 -04001026 ret = -ENOENT;
1027 goto out;
1028 }
1029
Eric Pariscfcad622009-06-11 14:31:36 -04001030 if (e->rule.watch)
Eric Parisa05fb6c2009-12-17 20:12:05 -05001031 audit_remove_watch_rule(&e->rule);
Amy Griffisf368c07d2006-04-07 16:55:56 -04001032
Al Viro74c3cbe2007-07-22 08:04:18 -04001033 if (e->rule.tree)
1034 audit_remove_tree_rule(&e->rule);
1035
Richard Guy Briggs34d99af52015-08-05 16:29:37 -04001036 if (e->rule.exe)
1037 audit_remove_mark_rule(&e->rule);
1038
Al Viro471a5c72006-07-10 08:29:24 -04001039#ifdef CONFIG_AUDITSYSCALL
1040 if (!dont_count)
1041 audit_n_rules--;
Amy Griffise54dc242007-03-29 18:01:04 -04001042
1043 if (!audit_match_signal(entry))
1044 audit_signals--;
Al Viro471a5c72006-07-10 08:29:24 -04001045#endif
Richard Guy Briggs8c85fc92015-08-05 15:23:09 -04001046
1047 list_del_rcu(&e->list);
1048 list_del(&e->rule.list);
1049 call_rcu(&e->rcu, audit_free_rule_rcu);
Amy Griffisf368c07d2006-04-07 16:55:56 -04001050
Amy Griffisf368c07d2006-04-07 16:55:56 -04001051out:
Richard Guy Briggs8c85fc92015-08-05 15:23:09 -04001052 mutex_unlock(&audit_filter_mutex);
1053
Al Viro74c3cbe2007-07-22 08:04:18 -04001054 if (tree)
1055 audit_put_tree(tree); /* that's the temporary one */
Amy Griffisf368c07d2006-04-07 16:55:56 -04001056
1057 return ret;
David Woodhousefe7752b2005-12-15 18:33:52 +00001058}
1059
Amy Griffis93315ed2006-02-07 12:05:27 -05001060/* List rules using struct audit_rule_data. */
Paul Moore45a06422017-05-02 10:16:05 -04001061static void audit_list_rules(int seq, struct sk_buff_head *q)
Amy Griffis93315ed2006-02-07 12:05:27 -05001062{
Al Viro9044e6b2006-05-22 01:09:24 -04001063 struct sk_buff *skb;
Al Viroe45aa212008-12-15 01:17:50 -05001064 struct audit_krule *r;
Amy Griffis93315ed2006-02-07 12:05:27 -05001065 int i;
1066
Amy Griffisf368c07d2006-04-07 16:55:56 -04001067 /* This is a blocking read, so use audit_filter_mutex instead of rcu
1068 * iterator to sync with list writers. */
Amy Griffis93315ed2006-02-07 12:05:27 -05001069 for (i=0; i<AUDIT_NR_FILTERS; i++) {
Al Viroe45aa212008-12-15 01:17:50 -05001070 list_for_each_entry(r, &audit_rules_list[i], list) {
Amy Griffis93315ed2006-02-07 12:05:27 -05001071 struct audit_rule_data *data;
1072
Al Viroe45aa212008-12-15 01:17:50 -05001073 data = audit_krule_to_data(r);
Amy Griffisf368c07d2006-04-07 16:55:56 -04001074 if (unlikely(!data))
1075 break;
Paul Moore45a06422017-05-02 10:16:05 -04001076 skb = audit_make_reply(seq, AUDIT_LIST_RULES, 0, 1,
1077 data,
Richard Guy Briggsf9441632013-08-14 11:32:45 -04001078 sizeof(*data) + data->buflen);
Al Viro9044e6b2006-05-22 01:09:24 -04001079 if (skb)
1080 skb_queue_tail(q, skb);
Amy Griffis93315ed2006-02-07 12:05:27 -05001081 kfree(data);
1082 }
1083 }
Paul Moore45a06422017-05-02 10:16:05 -04001084 skb = audit_make_reply(seq, AUDIT_LIST_RULES, 1, 1, NULL, 0);
Al Viro9044e6b2006-05-22 01:09:24 -04001085 if (skb)
1086 skb_queue_tail(q, skb);
Amy Griffis93315ed2006-02-07 12:05:27 -05001087}
1088
Amy Griffis5adc8a62006-06-14 18:45:21 -04001089/* Log rule additions and removals */
Eric Parisdc9eb692013-04-19 13:23:09 -04001090static void audit_log_rule_change(char *action, struct audit_krule *rule, int res)
Amy Griffis5adc8a62006-06-14 18:45:21 -04001091{
1092 struct audit_buffer *ab;
Eric Parisdc9eb692013-04-19 13:23:09 -04001093 uid_t loginuid = from_kuid(&init_user_ns, audit_get_loginuid(current));
Eric Paris4440e852013-11-27 17:35:17 -05001094 unsigned int sessionid = audit_get_sessionid(current);
Amy Griffis5adc8a62006-06-14 18:45:21 -04001095
Eric Paris1a6b9f22008-01-07 17:09:31 -05001096 if (!audit_enabled)
1097 return;
1098
Amy Griffis5adc8a62006-06-14 18:45:21 -04001099 ab = audit_log_start(NULL, GFP_KERNEL, AUDIT_CONFIG_CHANGE);
1100 if (!ab)
1101 return;
Eric Parisdc9eb692013-04-19 13:23:09 -04001102 audit_log_format(ab, "auid=%u ses=%u" ,loginuid, sessionid);
Eric Parisb122c372013-04-19 15:00:33 -04001103 audit_log_task_context(ab);
Steve Grubbc1e8f062016-11-16 16:14:33 -05001104 audit_log_format(ab, " op=%s", action);
Eric Paris9d960982009-06-11 14:31:37 -04001105 audit_log_key(ab, rule->filterkey);
Amy Griffis5adc8a62006-06-14 18:45:21 -04001106 audit_log_format(ab, " list=%d res=%d", rule->listnr, res);
1107 audit_log_end(ab);
1108}
1109
David Woodhousefe7752b2005-12-15 18:33:52 +00001110/**
Richard Guy Briggsce0d9f02013-11-20 14:01:53 -05001111 * audit_rule_change - apply all rules to the specified message type
David Woodhousefe7752b2005-12-15 18:33:52 +00001112 * @type: audit message type
David Woodhousefe7752b2005-12-15 18:33:52 +00001113 * @seq: netlink audit message sequence (serial) number
1114 * @data: payload data
Amy Griffis93315ed2006-02-07 12:05:27 -05001115 * @datasz: size of payload data
David Woodhousefe7752b2005-12-15 18:33:52 +00001116 */
Paul Moore45a06422017-05-02 10:16:05 -04001117int audit_rule_change(int type, int seq, void *data, size_t datasz)
David Woodhousefe7752b2005-12-15 18:33:52 +00001118{
Amy Griffis93315ed2006-02-07 12:05:27 -05001119 int err = 0;
1120 struct audit_entry *entry;
David Woodhousefe7752b2005-12-15 18:33:52 +00001121
Richard Guy Briggse85322d2014-10-02 22:05:19 -04001122 entry = audit_data_to_entry(data, datasz);
1123 if (IS_ERR(entry))
1124 return PTR_ERR(entry);
1125
David Woodhousefe7752b2005-12-15 18:33:52 +00001126 switch (type) {
Amy Griffis93315ed2006-02-07 12:05:27 -05001127 case AUDIT_ADD_RULE:
Al Viro36c4f1b12008-12-15 01:50:28 -05001128 err = audit_add_rule(entry);
Burn Altinge7df61f2014-04-04 16:00:38 +11001129 audit_log_rule_change("add_rule", &entry->rule, !err);
David Woodhousefe7752b2005-12-15 18:33:52 +00001130 break;
Amy Griffis93315ed2006-02-07 12:05:27 -05001131 case AUDIT_DEL_RULE:
Al Viro36c4f1b12008-12-15 01:50:28 -05001132 err = audit_del_rule(entry);
Burn Altinge7df61f2014-04-04 16:00:38 +11001133 audit_log_rule_change("remove_rule", &entry->rule, !err);
David Woodhousefe7752b2005-12-15 18:33:52 +00001134 break;
1135 default:
Eric Paris739c9502014-10-10 15:05:21 -04001136 err = -EINVAL;
1137 WARN_ON(1);
David Woodhousefe7752b2005-12-15 18:33:52 +00001138 }
1139
Richard Guy Briggs34d99af52015-08-05 16:29:37 -04001140 if (err || type == AUDIT_DEL_RULE) {
1141 if (entry->rule.exe)
1142 audit_remove_mark(entry->rule.exe);
Richard Guy Briggse85322d2014-10-02 22:05:19 -04001143 audit_free_rule(entry);
Richard Guy Briggs34d99af52015-08-05 16:29:37 -04001144 }
Richard Guy Briggse85322d2014-10-02 22:05:19 -04001145
David Woodhousefe7752b2005-12-15 18:33:52 +00001146 return err;
1147}
1148
Richard Guy Briggsce0d9f02013-11-20 14:01:53 -05001149/**
1150 * audit_list_rules_send - list the audit rules
Eric W. Biedermand211f1772014-03-08 15:31:54 -08001151 * @request_skb: skb of request we are replying to (used to target the reply)
Richard Guy Briggsce0d9f02013-11-20 14:01:53 -05001152 * @seq: netlink audit message sequence (serial) number
1153 */
Eric W. Biederman6f285b12014-02-28 19:44:55 -08001154int audit_list_rules_send(struct sk_buff *request_skb, int seq)
Richard Guy Briggsce0d9f02013-11-20 14:01:53 -05001155{
Eric W. Biederman6f285b12014-02-28 19:44:55 -08001156 u32 portid = NETLINK_CB(request_skb).portid;
1157 struct net *net = sock_net(NETLINK_CB(request_skb).sk);
Richard Guy Briggsce0d9f02013-11-20 14:01:53 -05001158 struct task_struct *tsk;
1159 struct audit_netlink_list *dest;
1160 int err = 0;
1161
1162 /* We can't just spew out the rules here because we might fill
1163 * the available socket buffer space and deadlock waiting for
1164 * auditctl to read from it... which isn't ever going to
1165 * happen if we're actually running in the context of auditctl
1166 * trying to _send_ the stuff */
1167
1168 dest = kmalloc(sizeof(struct audit_netlink_list), GFP_KERNEL);
1169 if (!dest)
1170 return -ENOMEM;
Eric W. Biederman6f285b12014-02-28 19:44:55 -08001171 dest->net = get_net(net);
Richard Guy Briggsce0d9f02013-11-20 14:01:53 -05001172 dest->portid = portid;
Richard Guy Briggsce0d9f02013-11-20 14:01:53 -05001173 skb_queue_head_init(&dest->q);
1174
1175 mutex_lock(&audit_filter_mutex);
Paul Moore45a06422017-05-02 10:16:05 -04001176 audit_list_rules(seq, &dest->q);
Richard Guy Briggsce0d9f02013-11-20 14:01:53 -05001177 mutex_unlock(&audit_filter_mutex);
1178
1179 tsk = kthread_run(audit_send_list, dest, "audit_send_list");
1180 if (IS_ERR(tsk)) {
1181 skb_queue_purge(&dest->q);
1182 kfree(dest);
1183 err = PTR_ERR(tsk);
1184 }
1185
1186 return err;
1187}
1188
Al Viro5af75d82008-12-16 05:59:26 -05001189int audit_comparator(u32 left, u32 op, u32 right)
David Woodhousefe7752b2005-12-15 18:33:52 +00001190{
1191 switch (op) {
Al Viro5af75d82008-12-16 05:59:26 -05001192 case Audit_equal:
David Woodhousefe7752b2005-12-15 18:33:52 +00001193 return (left == right);
Al Viro5af75d82008-12-16 05:59:26 -05001194 case Audit_not_equal:
David Woodhousefe7752b2005-12-15 18:33:52 +00001195 return (left != right);
Al Viro5af75d82008-12-16 05:59:26 -05001196 case Audit_lt:
David Woodhousefe7752b2005-12-15 18:33:52 +00001197 return (left < right);
Al Viro5af75d82008-12-16 05:59:26 -05001198 case Audit_le:
David Woodhousefe7752b2005-12-15 18:33:52 +00001199 return (left <= right);
Al Viro5af75d82008-12-16 05:59:26 -05001200 case Audit_gt:
David Woodhousefe7752b2005-12-15 18:33:52 +00001201 return (left > right);
Al Viro5af75d82008-12-16 05:59:26 -05001202 case Audit_ge:
David Woodhousefe7752b2005-12-15 18:33:52 +00001203 return (left >= right);
Al Viro5af75d82008-12-16 05:59:26 -05001204 case Audit_bitmask:
Eric Paris74f23452007-06-04 17:00:14 -04001205 return (left & right);
Al Viro5af75d82008-12-16 05:59:26 -05001206 case Audit_bittest:
Eric Paris74f23452007-06-04 17:00:14 -04001207 return ((left & right) == right);
Al Viro5af75d82008-12-16 05:59:26 -05001208 default:
1209 BUG();
1210 return 0;
David Woodhousefe7752b2005-12-15 18:33:52 +00001211 }
1212}
1213
Eric W. Biedermanca57ec02012-09-11 02:18:08 -07001214int audit_uid_comparator(kuid_t left, u32 op, kuid_t right)
1215{
1216 switch (op) {
1217 case Audit_equal:
1218 return uid_eq(left, right);
1219 case Audit_not_equal:
1220 return !uid_eq(left, right);
1221 case Audit_lt:
1222 return uid_lt(left, right);
1223 case Audit_le:
1224 return uid_lte(left, right);
1225 case Audit_gt:
1226 return uid_gt(left, right);
1227 case Audit_ge:
1228 return uid_gte(left, right);
1229 case Audit_bitmask:
1230 case Audit_bittest:
1231 default:
1232 BUG();
1233 return 0;
1234 }
1235}
1236
1237int audit_gid_comparator(kgid_t left, u32 op, kgid_t right)
1238{
1239 switch (op) {
1240 case Audit_equal:
1241 return gid_eq(left, right);
1242 case Audit_not_equal:
1243 return !gid_eq(left, right);
1244 case Audit_lt:
1245 return gid_lt(left, right);
1246 case Audit_le:
1247 return gid_lte(left, right);
1248 case Audit_gt:
1249 return gid_gt(left, right);
1250 case Audit_ge:
1251 return gid_gte(left, right);
1252 case Audit_bitmask:
1253 case Audit_bittest:
1254 default:
1255 BUG();
1256 return 0;
1257 }
1258}
1259
Jeff Laytonbfcec702012-10-10 15:25:23 -04001260/**
1261 * parent_len - find the length of the parent portion of a pathname
1262 * @path: pathname of which to determine length
1263 */
1264int parent_len(const char *path)
1265{
1266 int plen;
1267 const char *p;
1268
1269 plen = strlen(path);
1270
1271 if (plen == 0)
1272 return plen;
1273
1274 /* disregard trailing slashes */
1275 p = path + plen - 1;
1276 while ((*p == '/') && (p > path))
1277 p--;
1278
1279 /* walk backward until we find the next slash or hit beginning */
1280 while ((*p != '/') && (p > path))
1281 p--;
1282
1283 /* did we find a slash? Then increment to include it in path */
1284 if (*p == '/')
1285 p++;
1286
1287 return p - path;
1288}
1289
Jeff Laytone3d6b072012-10-10 15:25:25 -04001290/**
1291 * audit_compare_dname_path - compare given dentry name with last component in
1292 * given path. Return of 0 indicates a match.
1293 * @dname: dentry name that we're comparing
1294 * @path: full pathname that we're comparing
1295 * @parentlen: length of the parent if known. Passing in AUDIT_NAME_FULL
1296 * here indicates that we must compute this value.
1297 */
1298int audit_compare_dname_path(const char *dname, const char *path, int parentlen)
Amy Griffisf368c07d2006-04-07 16:55:56 -04001299{
Jeff Laytone3d6b072012-10-10 15:25:25 -04001300 int dlen, pathlen;
Amy Griffisf368c07d2006-04-07 16:55:56 -04001301 const char *p;
David Woodhousefe7752b2005-12-15 18:33:52 +00001302
Amy Griffisf368c07d2006-04-07 16:55:56 -04001303 dlen = strlen(dname);
Eric Paris29e9a342012-10-10 15:25:24 -04001304 pathlen = strlen(path);
1305 if (pathlen < dlen)
Amy Griffisf368c07d2006-04-07 16:55:56 -04001306 return 1;
1307
Jeff Laytone3d6b072012-10-10 15:25:25 -04001308 parentlen = parentlen == AUDIT_NAME_FULL ? parent_len(path) : parentlen;
Eric Paris29e9a342012-10-10 15:25:24 -04001309 if (pathlen - parentlen != dlen)
Amy Griffisf368c07d2006-04-07 16:55:56 -04001310 return 1;
Eric Paris29e9a342012-10-10 15:25:24 -04001311
1312 p = path + parentlen;
Amy Griffisf368c07d2006-04-07 16:55:56 -04001313
1314 return strncmp(p, dname, dlen);
1315}
David Woodhousefe7752b2005-12-15 18:33:52 +00001316
Richard Guy Briggs86b2efb2016-06-24 16:35:46 -04001317int audit_filter(int msgtype, unsigned int listtype)
David Woodhousefe7752b2005-12-15 18:33:52 +00001318{
David Woodhousefe7752b2005-12-15 18:33:52 +00001319 struct audit_entry *e;
Richard Guy Briggs86b2efb2016-06-24 16:35:46 -04001320 int ret = 1; /* Audit by default */
David Woodhousefe7752b2005-12-15 18:33:52 +00001321
1322 rcu_read_lock();
Richard Guy Briggs86b2efb2016-06-24 16:35:46 -04001323 if (list_empty(&audit_filter_list[listtype]))
1324 goto unlock_and_return;
1325 list_for_each_entry_rcu(e, &audit_filter_list[listtype], list) {
1326 int i, result = 0;
1327
1328 for (i = 0; i < e->rule.field_count; i++) {
1329 struct audit_field *f = &e->rule.fields[i];
1330 pid_t pid;
1331 u32 sid;
1332
1333 switch (f->type) {
1334 case AUDIT_PID:
1335 pid = task_pid_nr(current);
1336 result = audit_comparator(pid, f->op, f->val);
1337 break;
1338 case AUDIT_UID:
1339 result = audit_uid_comparator(current_uid(), f->op, f->uid);
1340 break;
1341 case AUDIT_GID:
1342 result = audit_gid_comparator(current_gid(), f->op, f->gid);
1343 break;
1344 case AUDIT_LOGINUID:
1345 result = audit_uid_comparator(audit_get_loginuid(current),
1346 f->op, f->uid);
1347 break;
1348 case AUDIT_LOGINUID_SET:
1349 result = audit_comparator(audit_loginuid_set(current),
1350 f->op, f->val);
1351 break;
1352 case AUDIT_MSGTYPE:
1353 result = audit_comparator(msgtype, f->op, f->val);
1354 break;
1355 case AUDIT_SUBJ_USER:
1356 case AUDIT_SUBJ_ROLE:
1357 case AUDIT_SUBJ_TYPE:
1358 case AUDIT_SUBJ_SEN:
1359 case AUDIT_SUBJ_CLR:
1360 if (f->lsm_rule) {
1361 security_task_getsecid(current, &sid);
1362 result = security_audit_rule_match(sid,
1363 f->type, f->op, f->lsm_rule, NULL);
1364 }
1365 break;
1366 default:
1367 goto unlock_and_return;
1368 }
1369 if (result < 0) /* error */
1370 goto unlock_and_return;
1371 if (!result)
1372 break;
1373 }
1374 if (result > 0) {
1375 if (e->rule.action == AUDIT_NEVER || listtype == AUDIT_FILTER_TYPE)
David Woodhousefe7752b2005-12-15 18:33:52 +00001376 ret = 0;
1377 break;
1378 }
1379 }
David Woodhousefe7752b2005-12-15 18:33:52 +00001380unlock_and_return:
1381 rcu_read_unlock();
Richard Guy Briggs86b2efb2016-06-24 16:35:46 -04001382 return ret;
David Woodhousefe7752b2005-12-15 18:33:52 +00001383}
Darrel Goeddel3dc7e312006-03-10 18:14:06 -06001384
Al Viroe45aa212008-12-15 01:17:50 -05001385static int update_lsm_rule(struct audit_krule *r)
Al Viro1a9d07972008-12-14 12:04:02 -05001386{
Al Viroe45aa212008-12-15 01:17:50 -05001387 struct audit_entry *entry = container_of(r, struct audit_entry, rule);
Al Viro1a9d07972008-12-14 12:04:02 -05001388 struct audit_entry *nentry;
Al Viro1a9d07972008-12-14 12:04:02 -05001389 int err = 0;
1390
Al Viroe45aa212008-12-15 01:17:50 -05001391 if (!security_audit_rule_known(r))
Al Viro1a9d07972008-12-14 12:04:02 -05001392 return 0;
1393
Eric Parisae7b8f42009-12-17 20:12:04 -05001394 nentry = audit_dupe_rule(r);
Richard Guy Briggs34d99af52015-08-05 16:29:37 -04001395 if (entry->rule.exe)
1396 audit_remove_mark(entry->rule.exe);
Al Viro1a9d07972008-12-14 12:04:02 -05001397 if (IS_ERR(nentry)) {
1398 /* save the first error encountered for the
1399 * return value */
1400 err = PTR_ERR(nentry);
1401 audit_panic("error updating LSM filters");
Eric Parisae7b8f42009-12-17 20:12:04 -05001402 if (r->watch)
Al Viroe45aa212008-12-15 01:17:50 -05001403 list_del(&r->rlist);
Al Viro1a9d07972008-12-14 12:04:02 -05001404 list_del_rcu(&entry->list);
Al Viroe45aa212008-12-15 01:17:50 -05001405 list_del(&r->list);
Al Viro1a9d07972008-12-14 12:04:02 -05001406 } else {
Eric Parisae7b8f42009-12-17 20:12:04 -05001407 if (r->watch || r->tree)
Al Viroe45aa212008-12-15 01:17:50 -05001408 list_replace_init(&r->rlist, &nentry->rule.rlist);
Al Viro1a9d07972008-12-14 12:04:02 -05001409 list_replace_rcu(&entry->list, &nentry->list);
Al Viroe45aa212008-12-15 01:17:50 -05001410 list_replace(&r->list, &nentry->rule.list);
Al Viro1a9d07972008-12-14 12:04:02 -05001411 }
1412 call_rcu(&entry->rcu, audit_free_rule_rcu);
1413
1414 return err;
1415}
1416
Ahmed S. Darwish04305e42008-04-19 09:59:43 +10001417/* This function will re-initialize the lsm_rule field of all applicable rules.
Ahmed S. Darwishd7a96f32008-03-01 22:01:11 +02001418 * It will traverse the filter lists serarching for rules that contain LSM
Darrel Goeddel3dc7e312006-03-10 18:14:06 -06001419 * specific filter fields. When such a rule is found, it is copied, the
Ahmed S. Darwishd7a96f32008-03-01 22:01:11 +02001420 * LSM field is re-initialized, and the old rule is replaced with the
Darrel Goeddel3dc7e312006-03-10 18:14:06 -06001421 * updated rule. */
Ahmed S. Darwishd7a96f32008-03-01 22:01:11 +02001422int audit_update_lsm_rules(void)
Darrel Goeddel3dc7e312006-03-10 18:14:06 -06001423{
Al Viroe45aa212008-12-15 01:17:50 -05001424 struct audit_krule *r, *n;
Darrel Goeddel3dc7e312006-03-10 18:14:06 -06001425 int i, err = 0;
1426
Amy Griffisf368c07d2006-04-07 16:55:56 -04001427 /* audit_filter_mutex synchronizes the writers */
1428 mutex_lock(&audit_filter_mutex);
Darrel Goeddel3dc7e312006-03-10 18:14:06 -06001429
1430 for (i = 0; i < AUDIT_NR_FILTERS; i++) {
Al Viroe45aa212008-12-15 01:17:50 -05001431 list_for_each_entry_safe(r, n, &audit_rules_list[i], list) {
1432 int res = update_lsm_rule(r);
Al Viro1a9d07972008-12-14 12:04:02 -05001433 if (!err)
1434 err = res;
1435 }
1436 }
Amy Griffisf368c07d2006-04-07 16:55:56 -04001437 mutex_unlock(&audit_filter_mutex);
Darrel Goeddel3dc7e312006-03-10 18:14:06 -06001438
1439 return err;
1440}