Blame view
kernel/auditfilter.c
45.8 KB
fe7752bab
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 |
/* auditfilter.c -- filtering of audit events * * Copyright 2003-2004 Red Hat, Inc. * Copyright 2005 Hewlett-Packard Development Company, L.P. * Copyright 2005 IBM Corporation * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #include <linux/kernel.h> #include <linux/audit.h> #include <linux/kthread.h> |
f368c07d7
|
25 26 27 |
#include <linux/mutex.h> #include <linux/fs.h> #include <linux/namei.h> |
fe7752bab
|
28 |
#include <linux/netlink.h> |
f368c07d7
|
29 30 |
#include <linux/sched.h> #include <linux/inotify.h> |
2a862b32f
|
31 |
#include <linux/security.h> |
fe7752bab
|
32 |
#include "audit.h" |
f368c07d7
|
33 34 35 36 37 38 39 |
/* * Locking model: * * audit_filter_mutex: * Synchronizes writes and blocking reads of audit's filterlist * data. Rcu is used to traverse the filterlist and access * contents of structs audit_entry, audit_watch and opaque |
d7a96f3a1
|
40 |
* LSM rules during filtering. If modified, these structures |
f368c07d7
|
41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 |
* must be copied and replace their counterparts in the filterlist. * An audit_parent struct is not accessed during filtering, so may * be written directly provided audit_filter_mutex is held. */ /* * Reference counting: * * audit_parent: lifetime is from audit_init_parent() to receipt of an IN_IGNORED * event. Each audit_watch holds a reference to its associated parent. * * audit_watch: if added to lists, lifetime is from audit_init_watch() to * audit_remove_watch(). Additionally, an audit_watch may exist * temporarily to assist in searching existing filter data. Each * audit_krule holds a reference to its associated watch. */ struct audit_parent { struct list_head ilist; /* entry in inotify registration list */ struct list_head watches; /* associated watches */ struct inotify_watch wdata; /* inotify watch data */ unsigned flags; /* status flags */ }; /* * audit_parent status flags: * * AUDIT_PARENT_INVALID - set anytime rules/watches are auto-removed due to * a filesystem event to ensure we're adding audit watches to a valid parent. * Technically not needed for IN_DELETE_SELF or IN_UNMOUNT events, as we cannot * receive them while we have nameidata, but must be used for IN_MOVE_SELF which * we can receive while holding nameidata. */ #define AUDIT_PARENT_INVALID 0x001 /* Audit filter lists, defined in <linux/audit.h> */ |
fe7752bab
|
77 78 79 80 81 82 83 84 85 86 87 |
struct list_head audit_filter_list[AUDIT_NR_FILTERS] = { LIST_HEAD_INIT(audit_filter_list[0]), LIST_HEAD_INIT(audit_filter_list[1]), LIST_HEAD_INIT(audit_filter_list[2]), LIST_HEAD_INIT(audit_filter_list[3]), LIST_HEAD_INIT(audit_filter_list[4]), LIST_HEAD_INIT(audit_filter_list[5]), #if AUDIT_NR_FILTERS != 6 #error Fix audit_filter_list initialiser #endif }; |
e45aa212e
|
88 89 90 91 92 93 94 95 |
static struct list_head audit_rules_list[AUDIT_NR_FILTERS] = { LIST_HEAD_INIT(audit_rules_list[0]), LIST_HEAD_INIT(audit_rules_list[1]), LIST_HEAD_INIT(audit_rules_list[2]), LIST_HEAD_INIT(audit_rules_list[3]), LIST_HEAD_INIT(audit_rules_list[4]), LIST_HEAD_INIT(audit_rules_list[5]), }; |
fe7752bab
|
96 |
|
74c3cbe33
|
97 |
DEFINE_MUTEX(audit_filter_mutex); |
f368c07d7
|
98 |
|
f368c07d7
|
99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 |
/* Inotify events we care about. */ #define AUDIT_IN_WATCH IN_MOVE|IN_CREATE|IN_DELETE|IN_DELETE_SELF|IN_MOVE_SELF void audit_free_parent(struct inotify_watch *i_watch) { struct audit_parent *parent; parent = container_of(i_watch, struct audit_parent, wdata); WARN_ON(!list_empty(&parent->watches)); kfree(parent); } static inline void audit_get_watch(struct audit_watch *watch) { atomic_inc(&watch->count); } static void audit_put_watch(struct audit_watch *watch) { if (atomic_dec_and_test(&watch->count)) { WARN_ON(watch->parent); WARN_ON(!list_empty(&watch->rules)); kfree(watch->path); kfree(watch); } } static void audit_remove_watch(struct audit_watch *watch) { list_del(&watch->wlist); put_inotify_watch(&watch->parent->wdata); watch->parent = NULL; audit_put_watch(watch); /* match initial get */ } |
93315ed6d
|
133 |
static inline void audit_free_rule(struct audit_entry *e) |
fe7752bab
|
134 |
{ |
3dc7e3153
|
135 |
int i; |
c28bb7da7
|
136 |
struct audit_krule *erule = &e->rule; |
f368c07d7
|
137 |
/* some rules don't have associated watches */ |
c28bb7da7
|
138 139 140 141 142 |
if (erule->watch) audit_put_watch(erule->watch); if (erule->fields) for (i = 0; i < erule->field_count; i++) { struct audit_field *f = &erule->fields[i]; |
04305e4af
|
143 144 |
kfree(f->lsm_str); security_audit_rule_free(f->lsm_rule); |
3dc7e3153
|
145 |
} |
c28bb7da7
|
146 147 |
kfree(erule->fields); kfree(erule->filterkey); |
93315ed6d
|
148 149 |
kfree(e); } |
74c3cbe33
|
150 |
void audit_free_rule_rcu(struct rcu_head *head) |
93315ed6d
|
151 152 153 154 |
{ struct audit_entry *e = container_of(head, struct audit_entry, rcu); audit_free_rule(e); } |
f368c07d7
|
155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 |
/* Initialize a parent watch entry. */ static struct audit_parent *audit_init_parent(struct nameidata *ndp) { struct audit_parent *parent; s32 wd; parent = kzalloc(sizeof(*parent), GFP_KERNEL); if (unlikely(!parent)) return ERR_PTR(-ENOMEM); INIT_LIST_HEAD(&parent->watches); parent->flags = 0; inotify_init_watch(&parent->wdata); /* grab a ref so inotify watch hangs around until we take audit_filter_mutex */ get_inotify_watch(&parent->wdata); |
4ac913785
|
171 172 |
wd = inotify_add_watch(audit_ih, &parent->wdata, ndp->path.dentry->d_inode, AUDIT_IN_WATCH); |
f368c07d7
|
173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 |
if (wd < 0) { audit_free_parent(&parent->wdata); return ERR_PTR(wd); } return parent; } /* Initialize a watch entry. */ static struct audit_watch *audit_init_watch(char *path) { struct audit_watch *watch; watch = kzalloc(sizeof(*watch), GFP_KERNEL); if (unlikely(!watch)) return ERR_PTR(-ENOMEM); INIT_LIST_HEAD(&watch->rules); atomic_set(&watch->count, 1); watch->path = path; watch->dev = (dev_t)-1; watch->ino = (unsigned long)-1; return watch; } |
3dc7e3153
|
198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 |
/* Initialize an audit filterlist entry. */ static inline struct audit_entry *audit_init_entry(u32 field_count) { struct audit_entry *entry; struct audit_field *fields; entry = kzalloc(sizeof(*entry), GFP_KERNEL); if (unlikely(!entry)) return NULL; fields = kzalloc(sizeof(*fields) * field_count, GFP_KERNEL); if (unlikely(!fields)) { kfree(entry); return NULL; } entry->rule.fields = fields; return entry; } |
93315ed6d
|
217 218 |
/* Unpack a filter field's string representation from user-space * buffer. */ |
74c3cbe33
|
219 |
char *audit_unpack_string(void **bufp, size_t *remain, size_t len) |
93315ed6d
|
220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 |
{ char *str; if (!*bufp || (len == 0) || (len > *remain)) return ERR_PTR(-EINVAL); /* Of the currently implemented string fields, PATH_MAX * defines the longest valid length. */ if (len > PATH_MAX) return ERR_PTR(-ENAMETOOLONG); str = kmalloc(len + 1, GFP_KERNEL); if (unlikely(!str)) return ERR_PTR(-ENOMEM); memcpy(str, *bufp, len); str[len] = 0; *bufp += len; *remain -= len; return str; } |
f368c07d7
|
243 244 245 246 247 |
/* Translate an inode field to kernel respresentation. */ static inline int audit_to_inode(struct audit_krule *krule, struct audit_field *f) { if (krule->listnr != AUDIT_FILTER_EXIT || |
5af75d8d5
|
248 249 |
krule->watch || krule->inode_f || krule->tree || (f->op != Audit_equal && f->op != Audit_not_equal)) |
f368c07d7
|
250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 |
return -EINVAL; krule->inode_f = f; return 0; } /* Translate a watch string to kernel respresentation. */ static int audit_to_watch(struct audit_krule *krule, char *path, int len, u32 op) { struct audit_watch *watch; if (!audit_ih) return -EOPNOTSUPP; if (path[0] != '/' || path[len-1] == '/' || krule->listnr != AUDIT_FILTER_EXIT || |
5af75d8d5
|
267 |
op != Audit_equal || |
74c3cbe33
|
268 |
krule->inode_f || krule->watch || krule->tree) |
f368c07d7
|
269 270 271 |
return -EINVAL; watch = audit_init_watch(path); |
801678c5a
|
272 |
if (IS_ERR(watch)) |
f368c07d7
|
273 274 275 276 277 278 279 |
return PTR_ERR(watch); audit_get_watch(watch); krule->watch = watch; return 0; } |
b915543b4
|
280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 |
static __u32 *classes[AUDIT_SYSCALL_CLASSES]; int __init audit_register_class(int class, unsigned *list) { __u32 *p = kzalloc(AUDIT_BITMASK_SIZE * sizeof(__u32), GFP_KERNEL); if (!p) return -ENOMEM; while (*list != ~0U) { unsigned n = *list++; if (n >= AUDIT_BITMASK_SIZE * 32 - AUDIT_SYSCALL_CLASSES) { kfree(p); return -EINVAL; } p[AUDIT_WORD(n)] |= AUDIT_BIT(n); } if (class >= AUDIT_SYSCALL_CLASSES || classes[class]) { kfree(p); return -EINVAL; } classes[class] = p; return 0; } |
55669bfa1
|
302 303 |
int audit_match_class(int class, unsigned syscall) { |
c926e4f43
|
304 |
if (unlikely(syscall >= AUDIT_BITMASK_SIZE * 32)) |
55669bfa1
|
305 306 307 308 309 |
return 0; if (unlikely(class >= AUDIT_SYSCALL_CLASSES || !classes[class])) return 0; return classes[class][AUDIT_WORD(syscall)] & AUDIT_BIT(syscall); } |
327b9eebb
|
310 |
#ifdef CONFIG_AUDITSYSCALL |
e54dc2431
|
311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 |
static inline int audit_match_class_bits(int class, u32 *mask) { int i; if (classes[class]) { for (i = 0; i < AUDIT_BITMASK_SIZE; i++) if (mask[i] & classes[class][i]) return 0; } return 1; } static int audit_match_signal(struct audit_entry *entry) { struct audit_field *arch = entry->rule.arch_f; if (!arch) { /* When arch is unspecified, we must check both masks on biarch * as syscall number alone is ambiguous. */ return (audit_match_class_bits(AUDIT_CLASS_SIGNAL, entry->rule.mask) && audit_match_class_bits(AUDIT_CLASS_SIGNAL_32, entry->rule.mask)); } switch(audit_classify_arch(arch->val)) { case 0: /* native */ return (audit_match_class_bits(AUDIT_CLASS_SIGNAL, entry->rule.mask)); case 1: /* 32bit on biarch */ return (audit_match_class_bits(AUDIT_CLASS_SIGNAL_32, entry->rule.mask)); default: return 1; } } |
327b9eebb
|
347 |
#endif |
e54dc2431
|
348 |
|
93315ed6d
|
349 350 351 352 353 |
/* Common user-space to kernel rule translation. */ static inline struct audit_entry *audit_to_entry_common(struct audit_rule *rule) { unsigned listnr; struct audit_entry *entry; |
93315ed6d
|
354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 |
int i, err; err = -EINVAL; listnr = rule->flags & ~AUDIT_FILTER_PREPEND; switch(listnr) { default: goto exit_err; case AUDIT_FILTER_USER: case AUDIT_FILTER_TYPE: #ifdef CONFIG_AUDITSYSCALL case AUDIT_FILTER_ENTRY: case AUDIT_FILTER_EXIT: case AUDIT_FILTER_TASK: #endif ; } |
014149cce
|
370 371 372 373 374 375 |
if (unlikely(rule->action == AUDIT_POSSIBLE)) { printk(KERN_ERR "AUDIT_POSSIBLE is deprecated "); goto exit_err; } if (rule->action != AUDIT_NEVER && rule->action != AUDIT_ALWAYS) |
93315ed6d
|
376 377 378 379 380 |
goto exit_err; if (rule->field_count > AUDIT_MAX_FIELDS) goto exit_err; err = -ENOMEM; |
3dc7e3153
|
381 382 |
entry = audit_init_entry(rule->field_count); if (!entry) |
93315ed6d
|
383 |
goto exit_err; |
93315ed6d
|
384 385 386 387 388 |
entry->rule.flags = rule->flags & AUDIT_FILTER_PREPEND; entry->rule.listnr = listnr; entry->rule.action = rule->action; entry->rule.field_count = rule->field_count; |
93315ed6d
|
389 390 391 |
for (i = 0; i < AUDIT_BITMASK_SIZE; i++) entry->rule.mask[i] = rule->mask[i]; |
b915543b4
|
392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 |
for (i = 0; i < AUDIT_SYSCALL_CLASSES; i++) { int bit = AUDIT_BITMASK_SIZE * 32 - i - 1; __u32 *p = &entry->rule.mask[AUDIT_WORD(bit)]; __u32 *class; if (!(*p & AUDIT_BIT(bit))) continue; *p &= ~AUDIT_BIT(bit); class = classes[i]; if (class) { int j; for (j = 0; j < AUDIT_BITMASK_SIZE; j++) entry->rule.mask[j] |= class[j]; } } |
93315ed6d
|
407 408 409 410 411 |
return entry; exit_err: return ERR_PTR(err); } |
5af75d8d5
|
412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 |
static u32 audit_ops[] = { [Audit_equal] = AUDIT_EQUAL, [Audit_not_equal] = AUDIT_NOT_EQUAL, [Audit_bitmask] = AUDIT_BIT_MASK, [Audit_bittest] = AUDIT_BIT_TEST, [Audit_lt] = AUDIT_LESS_THAN, [Audit_gt] = AUDIT_GREATER_THAN, [Audit_le] = AUDIT_LESS_THAN_OR_EQUAL, [Audit_ge] = AUDIT_GREATER_THAN_OR_EQUAL, }; static u32 audit_to_op(u32 op) { u32 n; for (n = Audit_equal; n < Audit_bad && audit_ops[n] != op; n++) ; return n; } |
93315ed6d
|
431 432 433 434 435 436 |
/* Translate struct audit_rule to kernel's rule respresentation. * Exists for backward compatibility with userspace. */ static struct audit_entry *audit_rule_to_entry(struct audit_rule *rule) { struct audit_entry *entry; int err = 0; |
fe7752bab
|
437 |
int i; |
93315ed6d
|
438 439 440 441 442 443 |
entry = audit_to_entry_common(rule); if (IS_ERR(entry)) goto exit_nofree; for (i = 0; i < rule->field_count; i++) { struct audit_field *f = &entry->rule.fields[i]; |
5af75d8d5
|
444 445 446 447 448 449 450 451 452 453 454 455 456 457 |
u32 n; n = rule->fields[i] & (AUDIT_NEGATE|AUDIT_OPERATORS); /* Support for legacy operators where * AUDIT_NEGATE bit signifies != and otherwise assumes == */ if (n & AUDIT_NEGATE) f->op = Audit_not_equal; else if (!n) f->op = Audit_equal; else f->op = audit_to_op(n); entry->rule.vers_ops = (n & AUDIT_OPERATORS) ? 2 : 1; |
93315ed6d
|
458 |
|
93315ed6d
|
459 460 |
f->type = rule->fields[i] & ~(AUDIT_NEGATE|AUDIT_OPERATORS); f->val = rule->values[i]; |
f368c07d7
|
461 |
err = -EINVAL; |
5af75d8d5
|
462 463 |
if (f->op == Audit_bad) goto exit_free; |
f368c07d7
|
464 |
switch(f->type) { |
0a73dccc4
|
465 |
default: |
3dc7e3153
|
466 |
goto exit_free; |
0a73dccc4
|
467 468 469 470 471 472 473 474 475 476 477 |
case AUDIT_PID: case AUDIT_UID: case AUDIT_EUID: case AUDIT_SUID: case AUDIT_FSUID: case AUDIT_GID: case AUDIT_EGID: case AUDIT_SGID: case AUDIT_FSGID: case AUDIT_LOGINUID: case AUDIT_PERS: |
0a73dccc4
|
478 |
case AUDIT_MSGTYPE: |
3b33ac318
|
479 |
case AUDIT_PPID: |
0a73dccc4
|
480 481 482 483 |
case AUDIT_DEVMAJOR: case AUDIT_DEVMINOR: case AUDIT_EXIT: case AUDIT_SUCCESS: |
74f2345b6
|
484 |
/* bit ops are only useful on syscall args */ |
5af75d8d5
|
485 |
if (f->op == Audit_bitmask || f->op == Audit_bittest) |
74f2345b6
|
486 |
goto exit_free; |
74f2345b6
|
487 |
break; |
0a73dccc4
|
488 489 490 491 492 |
case AUDIT_ARG0: case AUDIT_ARG1: case AUDIT_ARG2: case AUDIT_ARG3: break; |
4b8a311bb
|
493 494 |
/* arch is only allowed to be = or != */ case AUDIT_ARCH: |
5af75d8d5
|
495 |
if (f->op != Audit_not_equal && f->op != Audit_equal) |
4b8a311bb
|
496 |
goto exit_free; |
e54dc2431
|
497 |
entry->rule.arch_f = f; |
4b8a311bb
|
498 |
break; |
55669bfa1
|
499 500 501 502 |
case AUDIT_PERM: if (f->val & ~15) goto exit_free; break; |
8b67dca94
|
503 504 505 506 |
case AUDIT_FILETYPE: if ((f->val & ~S_IFMT) > S_IFMT) goto exit_free; break; |
f368c07d7
|
507 508 509 510 511 |
case AUDIT_INODE: err = audit_to_inode(&entry->rule, f); if (err) goto exit_free; break; |
3dc7e3153
|
512 |
} |
fe7752bab
|
513 |
} |
93315ed6d
|
514 |
|
5af75d8d5
|
515 516 |
if (entry->rule.inode_f && entry->rule.inode_f->op == Audit_not_equal) entry->rule.inode_f = NULL; |
f368c07d7
|
517 |
|
93315ed6d
|
518 519 520 521 522 523 |
exit_nofree: return entry; exit_free: audit_free_rule(entry); return ERR_PTR(err); |
fe7752bab
|
524 |
} |
93315ed6d
|
525 526 527 |
/* Translate struct audit_rule_data to kernel's rule respresentation. */ static struct audit_entry *audit_data_to_entry(struct audit_rule_data *data, size_t datasz) |
fe7752bab
|
528 |
{ |
93315ed6d
|
529 530 531 |
int err = 0; struct audit_entry *entry; void *bufp; |
3dc7e3153
|
532 |
size_t remain = datasz - sizeof(struct audit_rule_data); |
fe7752bab
|
533 |
int i; |
3dc7e3153
|
534 |
char *str; |
fe7752bab
|
535 |
|
93315ed6d
|
536 537 538 |
entry = audit_to_entry_common((struct audit_rule *)data); if (IS_ERR(entry)) goto exit_nofree; |
fe7752bab
|
539 |
|
93315ed6d
|
540 541 542 543 544 545 |
bufp = data->buf; entry->rule.vers_ops = 2; for (i = 0; i < data->field_count; i++) { struct audit_field *f = &entry->rule.fields[i]; err = -EINVAL; |
5af75d8d5
|
546 547 548 |
f->op = audit_to_op(data->fieldflags[i]); if (f->op == Audit_bad) |
93315ed6d
|
549 |
goto exit_free; |
93315ed6d
|
550 |
f->type = data->fields[i]; |
3dc7e3153
|
551 |
f->val = data->values[i]; |
04305e4af
|
552 553 |
f->lsm_str = NULL; f->lsm_rule = NULL; |
93315ed6d
|
554 |
switch(f->type) { |
0a73dccc4
|
555 556 557 558 559 560 561 562 563 564 565 |
case AUDIT_PID: case AUDIT_UID: case AUDIT_EUID: case AUDIT_SUID: case AUDIT_FSUID: case AUDIT_GID: case AUDIT_EGID: case AUDIT_SGID: case AUDIT_FSGID: case AUDIT_LOGINUID: case AUDIT_PERS: |
0a73dccc4
|
566 567 568 569 570 571 572 573 574 575 576 |
case AUDIT_MSGTYPE: case AUDIT_PPID: case AUDIT_DEVMAJOR: case AUDIT_DEVMINOR: case AUDIT_EXIT: case AUDIT_SUCCESS: case AUDIT_ARG0: case AUDIT_ARG1: case AUDIT_ARG2: case AUDIT_ARG3: break; |
e54dc2431
|
577 578 579 |
case AUDIT_ARCH: entry->rule.arch_f = f; break; |
3a6b9f85c
|
580 581 582 583 584 |
case AUDIT_SUBJ_USER: case AUDIT_SUBJ_ROLE: case AUDIT_SUBJ_TYPE: case AUDIT_SUBJ_SEN: case AUDIT_SUBJ_CLR: |
6e5a2d1d3
|
585 586 587 588 589 |
case AUDIT_OBJ_USER: case AUDIT_OBJ_ROLE: case AUDIT_OBJ_TYPE: case AUDIT_OBJ_LEV_LOW: case AUDIT_OBJ_LEV_HIGH: |
3dc7e3153
|
590 591 592 593 |
str = audit_unpack_string(&bufp, &remain, f->val); if (IS_ERR(str)) goto exit_free; entry->rule.buflen += f->val; |
d7a96f3a1
|
594 |
err = security_audit_rule_init(f->type, f->op, str, |
04305e4af
|
595 |
(void **)&f->lsm_rule); |
3dc7e3153
|
596 597 598 |
/* Keep currently invalid fields around in case they * become valid after a policy reload. */ if (err == -EINVAL) { |
d7a96f3a1
|
599 |
printk(KERN_WARNING "audit rule for LSM " |
3dc7e3153
|
600 601 602 603 604 605 606 607 |
"\'%s\' is invalid ", str); err = 0; } if (err) { kfree(str); goto exit_free; } else |
04305e4af
|
608 |
f->lsm_str = str; |
3dc7e3153
|
609 |
break; |
f368c07d7
|
610 611 612 613 614 615 616 617 618 619 620 621 |
case AUDIT_WATCH: str = audit_unpack_string(&bufp, &remain, f->val); if (IS_ERR(str)) goto exit_free; entry->rule.buflen += f->val; err = audit_to_watch(&entry->rule, str, f->val, f->op); if (err) { kfree(str); goto exit_free; } break; |
74c3cbe33
|
622 623 624 625 626 627 628 629 630 631 632 |
case AUDIT_DIR: str = audit_unpack_string(&bufp, &remain, f->val); if (IS_ERR(str)) goto exit_free; entry->rule.buflen += f->val; err = audit_make_tree(&entry->rule, str, f->op); kfree(str); if (err) goto exit_free; break; |
f368c07d7
|
633 634 635 636 637 |
case AUDIT_INODE: err = audit_to_inode(&entry->rule, f); if (err) goto exit_free; break; |
5adc8a6ad
|
638 639 640 641 642 643 644 645 646 647 |
case AUDIT_FILTERKEY: err = -EINVAL; if (entry->rule.filterkey || f->val > AUDIT_MAX_KEY_LEN) goto exit_free; str = audit_unpack_string(&bufp, &remain, f->val); if (IS_ERR(str)) goto exit_free; entry->rule.buflen += f->val; entry->rule.filterkey = str; break; |
55669bfa1
|
648 649 650 651 |
case AUDIT_PERM: if (f->val & ~15) goto exit_free; break; |
8b67dca94
|
652 653 654 655 |
case AUDIT_FILETYPE: if ((f->val & ~S_IFMT) > S_IFMT) goto exit_free; break; |
0a73dccc4
|
656 657 |
default: goto exit_free; |
f368c07d7
|
658 659 |
} } |
5af75d8d5
|
660 661 |
if (entry->rule.inode_f && entry->rule.inode_f->op == Audit_not_equal) entry->rule.inode_f = NULL; |
93315ed6d
|
662 663 664 665 666 667 668 669 670 671 |
exit_nofree: return entry; exit_free: audit_free_rule(entry); return ERR_PTR(err); } /* Pack a filter field's string representation into data block. */ |
74c3cbe33
|
672 |
static inline size_t audit_pack_string(void **bufp, const char *str) |
93315ed6d
|
673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 |
{ size_t len = strlen(str); memcpy(*bufp, str, len); *bufp += len; return len; } /* Translate kernel rule respresentation to struct audit_rule. * Exists for backward compatibility with userspace. */ static struct audit_rule *audit_krule_to_rule(struct audit_krule *krule) { struct audit_rule *rule; int i; |
4668edc33
|
688 |
rule = kzalloc(sizeof(*rule), GFP_KERNEL); |
93315ed6d
|
689 |
if (unlikely(!rule)) |
0a3b483e8
|
690 |
return NULL; |
93315ed6d
|
691 692 693 694 695 696 697 698 699 |
rule->flags = krule->flags | krule->listnr; rule->action = krule->action; rule->field_count = krule->field_count; for (i = 0; i < rule->field_count; i++) { rule->values[i] = krule->fields[i].val; rule->fields[i] = krule->fields[i].type; if (krule->vers_ops == 1) { |
5af75d8d5
|
700 |
if (krule->fields[i].op == Audit_not_equal) |
93315ed6d
|
701 702 |
rule->fields[i] |= AUDIT_NEGATE; } else { |
5af75d8d5
|
703 |
rule->fields[i] |= audit_ops[krule->fields[i].op]; |
93315ed6d
|
704 705 706 707 708 709 |
} } for (i = 0; i < AUDIT_BITMASK_SIZE; i++) rule->mask[i] = krule->mask[i]; return rule; } |
fe7752bab
|
710 |
|
93315ed6d
|
711 712 713 714 715 716 717 718 719 |
/* Translate kernel rule respresentation to struct audit_rule_data. */ static struct audit_rule_data *audit_krule_to_data(struct audit_krule *krule) { struct audit_rule_data *data; void *bufp; int i; data = kmalloc(sizeof(*data) + krule->buflen, GFP_KERNEL); if (unlikely(!data)) |
0a3b483e8
|
720 |
return NULL; |
93315ed6d
|
721 722 723 724 725 726 727 728 729 730 |
memset(data, 0, sizeof(*data)); data->flags = krule->flags | krule->listnr; data->action = krule->action; data->field_count = krule->field_count; bufp = data->buf; for (i = 0; i < data->field_count; i++) { struct audit_field *f = &krule->fields[i]; data->fields[i] = f->type; |
5af75d8d5
|
731 |
data->fieldflags[i] = audit_ops[f->op]; |
93315ed6d
|
732 |
switch(f->type) { |
3a6b9f85c
|
733 734 735 736 737 |
case AUDIT_SUBJ_USER: case AUDIT_SUBJ_ROLE: case AUDIT_SUBJ_TYPE: case AUDIT_SUBJ_SEN: case AUDIT_SUBJ_CLR: |
6e5a2d1d3
|
738 739 740 741 742 |
case AUDIT_OBJ_USER: case AUDIT_OBJ_ROLE: case AUDIT_OBJ_TYPE: case AUDIT_OBJ_LEV_LOW: case AUDIT_OBJ_LEV_HIGH: |
3dc7e3153
|
743 |
data->buflen += data->values[i] = |
04305e4af
|
744 |
audit_pack_string(&bufp, f->lsm_str); |
3dc7e3153
|
745 |
break; |
f368c07d7
|
746 747 748 749 |
case AUDIT_WATCH: data->buflen += data->values[i] = audit_pack_string(&bufp, krule->watch->path); break; |
74c3cbe33
|
750 751 752 753 754 |
case AUDIT_DIR: data->buflen += data->values[i] = audit_pack_string(&bufp, audit_tree_path(krule->tree)); break; |
5adc8a6ad
|
755 756 757 758 |
case AUDIT_FILTERKEY: data->buflen += data->values[i] = audit_pack_string(&bufp, krule->filterkey); break; |
93315ed6d
|
759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 |
default: data->values[i] = f->val; } } for (i = 0; i < AUDIT_BITMASK_SIZE; i++) data->mask[i] = krule->mask[i]; return data; } /* Compare two rules in kernel format. Considered success if rules * don't match. */ static int audit_compare_rule(struct audit_krule *a, struct audit_krule *b) { int i; if (a->flags != b->flags || a->listnr != b->listnr || a->action != b->action || a->field_count != b->field_count) |
fe7752bab
|
778 779 780 |
return 1; for (i = 0; i < a->field_count; i++) { |
93315ed6d
|
781 782 |
if (a->fields[i].type != b->fields[i].type || a->fields[i].op != b->fields[i].op) |
fe7752bab
|
783 |
return 1; |
93315ed6d
|
784 785 |
switch(a->fields[i].type) { |
3a6b9f85c
|
786 787 788 789 790 |
case AUDIT_SUBJ_USER: case AUDIT_SUBJ_ROLE: case AUDIT_SUBJ_TYPE: case AUDIT_SUBJ_SEN: case AUDIT_SUBJ_CLR: |
6e5a2d1d3
|
791 792 793 794 795 |
case AUDIT_OBJ_USER: case AUDIT_OBJ_ROLE: case AUDIT_OBJ_TYPE: case AUDIT_OBJ_LEV_LOW: case AUDIT_OBJ_LEV_HIGH: |
04305e4af
|
796 |
if (strcmp(a->fields[i].lsm_str, b->fields[i].lsm_str)) |
3dc7e3153
|
797 798 |
return 1; break; |
f368c07d7
|
799 800 801 802 |
case AUDIT_WATCH: if (strcmp(a->watch->path, b->watch->path)) return 1; break; |
74c3cbe33
|
803 804 805 806 807 |
case AUDIT_DIR: if (strcmp(audit_tree_path(a->tree), audit_tree_path(b->tree))) return 1; break; |
5adc8a6ad
|
808 809 810 811 812 |
case AUDIT_FILTERKEY: /* both filterkeys exist based on above type compare */ if (strcmp(a->filterkey, b->filterkey)) return 1; break; |
93315ed6d
|
813 814 815 816 |
default: if (a->fields[i].val != b->fields[i].val) return 1; } |
fe7752bab
|
817 818 819 820 821 822 823 824 |
} for (i = 0; i < AUDIT_BITMASK_SIZE; i++) if (a->mask[i] != b->mask[i]) return 1; return 0; } |
f368c07d7
|
825 826 827 828 829 830 831 832 833 834 835 836 |
/* Duplicate the given audit watch. The new watch's rules list is initialized * to an empty list and wlist is undefined. */ static struct audit_watch *audit_dupe_watch(struct audit_watch *old) { char *path; struct audit_watch *new; path = kstrdup(old->path, GFP_KERNEL); if (unlikely(!path)) return ERR_PTR(-ENOMEM); new = audit_init_watch(path); |
801678c5a
|
837 |
if (IS_ERR(new)) { |
f368c07d7
|
838 839 840 841 842 843 844 845 846 847 848 849 |
kfree(path); goto out; } new->dev = old->dev; new->ino = old->ino; get_inotify_watch(&old->parent->wdata); new->parent = old->parent; out: return new; } |
04305e4af
|
850 |
/* Duplicate LSM field information. The lsm_rule is opaque, so must be |
3dc7e3153
|
851 |
* re-initialized. */ |
d7a96f3a1
|
852 |
static inline int audit_dupe_lsm_field(struct audit_field *df, |
3dc7e3153
|
853 854 855 |
struct audit_field *sf) { int ret = 0; |
04305e4af
|
856 |
char *lsm_str; |
3dc7e3153
|
857 |
|
04305e4af
|
858 859 860 |
/* our own copy of lsm_str */ lsm_str = kstrdup(sf->lsm_str, GFP_KERNEL); if (unlikely(!lsm_str)) |
3e1fbd12c
|
861 |
return -ENOMEM; |
04305e4af
|
862 |
df->lsm_str = lsm_str; |
3dc7e3153
|
863 |
|
04305e4af
|
864 865 866 |
/* our own (refreshed) copy of lsm_rule */ ret = security_audit_rule_init(df->type, df->op, df->lsm_str, (void **)&df->lsm_rule); |
3dc7e3153
|
867 868 869 |
/* Keep currently invalid fields around in case they * become valid after a policy reload. */ if (ret == -EINVAL) { |
d7a96f3a1
|
870 |
printk(KERN_WARNING "audit rule for LSM \'%s\' is " |
04305e4af
|
871 872 |
"invalid ", df->lsm_str); |
3dc7e3153
|
873 874 875 876 877 878 879 |
ret = 0; } return ret; } /* Duplicate an audit rule. This will be a deep copy with the exception |
d7a96f3a1
|
880 |
* of the watch - that pointer is carried over. The LSM specific fields |
3dc7e3153
|
881 |
* will be updated in the copy. The point is to be able to replace the old |
f368c07d7
|
882 883 884 885 886 |
* rule with the new rule in the filterlist, then free the old rule. * The rlist element is undefined; list manipulations are handled apart from * the initial copy. */ static struct audit_entry *audit_dupe_rule(struct audit_krule *old, struct audit_watch *watch) |
3dc7e3153
|
887 888 889 890 |
{ u32 fcount = old->field_count; struct audit_entry *entry; struct audit_krule *new; |
5adc8a6ad
|
891 |
char *fk; |
3dc7e3153
|
892 893 894 895 896 897 898 899 900 901 902 903 904 |
int i, err = 0; entry = audit_init_entry(fcount); if (unlikely(!entry)) return ERR_PTR(-ENOMEM); new = &entry->rule; new->vers_ops = old->vers_ops; new->flags = old->flags; new->listnr = old->listnr; new->action = old->action; for (i = 0; i < AUDIT_BITMASK_SIZE; i++) new->mask[i] = old->mask[i]; |
0590b9335
|
905 |
new->prio = old->prio; |
3dc7e3153
|
906 |
new->buflen = old->buflen; |
f368c07d7
|
907 908 |
new->inode_f = old->inode_f; new->watch = NULL; |
3dc7e3153
|
909 |
new->field_count = old->field_count; |
74c3cbe33
|
910 911 912 913 914 915 916 917 |
/* * note that we are OK with not refcounting here; audit_match_tree() * never dereferences tree and we can't get false positives there * since we'd have to have rule gone from the list *and* removed * before the chunks found by lookup had been allocated, i.e. before * the beginning of list scan. */ new->tree = old->tree; |
3dc7e3153
|
918 |
memcpy(new->fields, old->fields, sizeof(struct audit_field) * fcount); |
04305e4af
|
919 |
/* deep copy this information, updating the lsm_rule fields, because |
3dc7e3153
|
920 921 922 |
* the originals will all be freed when the old rule is freed. */ for (i = 0; i < fcount; i++) { switch (new->fields[i].type) { |
3a6b9f85c
|
923 924 925 926 927 |
case AUDIT_SUBJ_USER: case AUDIT_SUBJ_ROLE: case AUDIT_SUBJ_TYPE: case AUDIT_SUBJ_SEN: case AUDIT_SUBJ_CLR: |
6e5a2d1d3
|
928 929 930 931 932 |
case AUDIT_OBJ_USER: case AUDIT_OBJ_ROLE: case AUDIT_OBJ_TYPE: case AUDIT_OBJ_LEV_LOW: case AUDIT_OBJ_LEV_HIGH: |
d7a96f3a1
|
933 |
err = audit_dupe_lsm_field(&new->fields[i], |
3dc7e3153
|
934 |
&old->fields[i]); |
5adc8a6ad
|
935 936 937 938 939 940 941 |
break; case AUDIT_FILTERKEY: fk = kstrdup(old->filterkey, GFP_KERNEL); if (unlikely(!fk)) err = -ENOMEM; else new->filterkey = fk; |
3dc7e3153
|
942 943 944 945 946 947 |
} if (err) { audit_free_rule(entry); return ERR_PTR(err); } } |
f368c07d7
|
948 949 950 951 |
if (watch) { audit_get_watch(watch); new->watch = watch; } |
3dc7e3153
|
952 953 |
return entry; } |
f368c07d7
|
954 955 956 957 958 959 960 961 |
/* Update inode info in audit rules based on filesystem event. */ static void audit_update_watch(struct audit_parent *parent, const char *dname, dev_t dev, unsigned long ino, unsigned invalidating) { struct audit_watch *owatch, *nwatch, *nextw; struct audit_krule *r, *nextr; struct audit_entry *oentry, *nentry; |
f368c07d7
|
962 963 964 |
mutex_lock(&audit_filter_mutex); list_for_each_entry_safe(owatch, nextw, &parent->watches, wlist) { |
9c937dcc7
|
965 |
if (audit_compare_dname_path(dname, owatch->path, NULL)) |
f368c07d7
|
966 967 968 969 |
continue; /* If the update involves invalidating rules, do the inode-based * filtering now, so we don't omit records. */ |
0590b9335
|
970 971 |
if (invalidating && current->audit_context) audit_filter_inodes(current, current->audit_context); |
f368c07d7
|
972 973 |
nwatch = audit_dupe_watch(owatch); |
801678c5a
|
974 |
if (IS_ERR(nwatch)) { |
f368c07d7
|
975 976 977 978 979 980 981 982 983 984 985 986 987 988 |
mutex_unlock(&audit_filter_mutex); audit_panic("error updating watch, skipping"); return; } nwatch->dev = dev; nwatch->ino = ino; list_for_each_entry_safe(r, nextr, &owatch->rules, rlist) { oentry = container_of(r, struct audit_entry, rule); list_del(&oentry->rule.rlist); list_del_rcu(&oentry->list); nentry = audit_dupe_rule(&oentry->rule, nwatch); |
e45aa212e
|
989 990 |
if (IS_ERR(nentry)) { list_del(&oentry->rule.list); |
f368c07d7
|
991 |
audit_panic("error updating watch, removing"); |
e45aa212e
|
992 |
} else { |
f368c07d7
|
993 994 995 |
int h = audit_hash_ino((u32)ino); list_add(&nentry->rule.rlist, &nwatch->rules); list_add_rcu(&nentry->list, &audit_inode_hash[h]); |
e45aa212e
|
996 997 |
list_replace(&oentry->rule.list, &nentry->rule.list); |
f368c07d7
|
998 999 1000 1001 |
} call_rcu(&oentry->rcu, audit_free_rule_rcu); } |
1a6b9f231
|
1002 1003 |
if (audit_enabled) { struct audit_buffer *ab; |
381a80e6d
|
1004 |
ab = audit_log_start(NULL, GFP_NOFS, |
1a6b9f231
|
1005 |
AUDIT_CONFIG_CHANGE); |
036bbf76a
|
1006 1007 1008 |
audit_log_format(ab, "auid=%u ses=%u", audit_get_loginuid(current), audit_get_sessionid(current)); |
1a6b9f231
|
1009 |
audit_log_format(ab, |
036bbf76a
|
1010 |
" op=updated rules specifying path="); |
1a6b9f231
|
1011 1012 1013 1014 1015 1016 1017 |
audit_log_untrustedstring(ab, owatch->path); audit_log_format(ab, " with dev=%u ino=%lu ", dev, ino); audit_log_format(ab, " list=%d res=1", r->listnr); audit_log_end(ab); } |
f368c07d7
|
1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 |
audit_remove_watch(owatch); goto add_watch_to_parent; /* event applies to a single watch */ } mutex_unlock(&audit_filter_mutex); return; add_watch_to_parent: list_add(&nwatch->wlist, &parent->watches); mutex_unlock(&audit_filter_mutex); return; } /* Remove all watches & rules associated with a parent that is going away. */ static void audit_remove_parent_watches(struct audit_parent *parent) { struct audit_watch *w, *nextw; struct audit_krule *r, *nextr; struct audit_entry *e; mutex_lock(&audit_filter_mutex); parent->flags |= AUDIT_PARENT_INVALID; list_for_each_entry_safe(w, nextw, &parent->watches, wlist) { list_for_each_entry_safe(r, nextr, &w->rules, rlist) { e = container_of(r, struct audit_entry, rule); |
1a6b9f231
|
1042 1043 |
if (audit_enabled) { struct audit_buffer *ab; |
381a80e6d
|
1044 |
ab = audit_log_start(NULL, GFP_NOFS, |
1a6b9f231
|
1045 |
AUDIT_CONFIG_CHANGE); |
036bbf76a
|
1046 1047 1048 1049 |
audit_log_format(ab, "auid=%u ses=%u", audit_get_loginuid(current), audit_get_sessionid(current)); audit_log_format(ab, " op=remove rule path="); |
1a6b9f231
|
1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 |
audit_log_untrustedstring(ab, w->path); if (r->filterkey) { audit_log_format(ab, " key="); audit_log_untrustedstring(ab, r->filterkey); } else audit_log_format(ab, " key=(null)"); audit_log_format(ab, " list=%d res=1", r->listnr); audit_log_end(ab); } |
f368c07d7
|
1061 |
list_del(&r->rlist); |
e45aa212e
|
1062 |
list_del(&r->list); |
f368c07d7
|
1063 1064 |
list_del_rcu(&e->list); call_rcu(&e->rcu, audit_free_rule_rcu); |
f368c07d7
|
1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 |
} audit_remove_watch(w); } mutex_unlock(&audit_filter_mutex); } /* Unregister inotify watches for parents on in_list. * Generates an IN_IGNORED event. */ static void audit_inotify_unregister(struct list_head *in_list) { struct audit_parent *p, *n; list_for_each_entry_safe(p, n, in_list, ilist) { list_del(&p->ilist); inotify_rm_watch(audit_ih, &p->wdata); |
8f7b0ba1c
|
1080 1081 |
/* the unpin matching the pin in audit_do_del_rule() */ unpin_inotify_watch(&p->wdata); |
f368c07d7
|
1082 1083 1084 1085 1086 1087 |
} } /* Find an existing audit rule. * Caller must hold audit_filter_mutex to prevent stale rule data. */ static struct audit_entry *audit_find_rule(struct audit_entry *entry, |
36c4f1b18
|
1088 |
struct list_head **p) |
f368c07d7
|
1089 1090 |
{ struct audit_entry *e, *found = NULL; |
36c4f1b18
|
1091 |
struct list_head *list; |
f368c07d7
|
1092 |
int h; |
36c4f1b18
|
1093 1094 1095 1096 |
if (entry->rule.inode_f) { h = audit_hash_ino(entry->rule.inode_f->val); *p = list = &audit_inode_hash[h]; } else if (entry->rule.watch) { |
f368c07d7
|
1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 |
/* we don't know the inode number, so must walk entire hash */ for (h = 0; h < AUDIT_INODE_BUCKETS; h++) { list = &audit_inode_hash[h]; list_for_each_entry(e, list, list) if (!audit_compare_rule(&entry->rule, &e->rule)) { found = e; goto out; } } goto out; |
36c4f1b18
|
1107 1108 |
} else { *p = list = &audit_filter_list[entry->rule.listnr]; |
f368c07d7
|
1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 |
} list_for_each_entry(e, list, list) if (!audit_compare_rule(&entry->rule, &e->rule)) { found = e; goto out; } out: return found; } /* Get path information necessary for adding watches. */ static int audit_get_nd(char *path, struct nameidata **ndp, struct nameidata **ndw) { struct nameidata *ndparent, *ndwatch; int err; ndparent = kmalloc(sizeof(*ndparent), GFP_KERNEL); if (unlikely(!ndparent)) return -ENOMEM; ndwatch = kmalloc(sizeof(*ndwatch), GFP_KERNEL); if (unlikely(!ndwatch)) { kfree(ndparent); return -ENOMEM; } err = path_lookup(path, LOOKUP_PARENT, ndparent); if (err) { kfree(ndparent); kfree(ndwatch); return err; } err = path_lookup(path, 0, ndwatch); if (err) { kfree(ndwatch); ndwatch = NULL; } *ndp = ndparent; *ndw = ndwatch; return 0; } /* Release resources used for watch path information. */ static void audit_put_nd(struct nameidata *ndp, struct nameidata *ndw) { if (ndp) { |
1d957f9bf
|
1161 |
path_put(&ndp->path); |
f368c07d7
|
1162 1163 1164 |
kfree(ndp); } if (ndw) { |
1d957f9bf
|
1165 |
path_put(&ndw->path); |
f368c07d7
|
1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 |
kfree(ndw); } } /* Associate the given rule with an existing parent inotify_watch. * Caller must hold audit_filter_mutex. */ static void audit_add_to_parent(struct audit_krule *krule, struct audit_parent *parent) { struct audit_watch *w, *watch = krule->watch; int watch_found = 0; list_for_each_entry(w, &parent->watches, wlist) { if (strcmp(watch->path, w->path)) continue; watch_found = 1; /* put krule's and initial refs to temporary watch */ audit_put_watch(watch); audit_put_watch(watch); audit_get_watch(w); krule->watch = watch = w; break; } if (!watch_found) { get_inotify_watch(&parent->wdata); watch->parent = parent; list_add(&watch->wlist, &parent->watches); } list_add(&krule->rlist, &watch->rules); } /* Find a matching watch entry, or add this one. * Caller must hold audit_filter_mutex. */ static int audit_add_watch(struct audit_krule *krule, struct nameidata *ndp, struct nameidata *ndw) { struct audit_watch *watch = krule->watch; struct inotify_watch *i_watch; struct audit_parent *parent; int ret = 0; /* update watch filter fields */ if (ndw) { |
4ac913785
|
1214 1215 |
watch->dev = ndw->path.dentry->d_inode->i_sb->s_dev; watch->ino = ndw->path.dentry->d_inode->i_ino; |
f368c07d7
|
1216 1217 1218 1219 1220 1221 1222 1223 |
} /* The audit_filter_mutex must not be held during inotify calls because * we hold it during inotify event callback processing. If an existing * inotify watch is found, inotify_find_watch() grabs a reference before * returning. */ mutex_unlock(&audit_filter_mutex); |
4ac913785
|
1224 1225 |
if (inotify_find_watch(audit_ih, ndp->path.dentry->d_inode, &i_watch) < 0) { |
f368c07d7
|
1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 |
parent = audit_init_parent(ndp); if (IS_ERR(parent)) { /* caller expects mutex locked */ mutex_lock(&audit_filter_mutex); return PTR_ERR(parent); } } else parent = container_of(i_watch, struct audit_parent, wdata); mutex_lock(&audit_filter_mutex); /* parent was moved before we took audit_filter_mutex */ if (parent->flags & AUDIT_PARENT_INVALID) ret = -ENOENT; else audit_add_to_parent(krule, parent); /* match get in audit_init_parent or inotify_find_watch */ put_inotify_watch(&parent->wdata); return ret; } |
0590b9335
|
1247 1248 |
static u64 prio_low = ~0ULL/2; static u64 prio_high = ~0ULL/2 - 1; |
f368c07d7
|
1249 |
/* Add rule to given filterlist if not a duplicate. */ |
36c4f1b18
|
1250 |
static inline int audit_add_rule(struct audit_entry *entry) |
fe7752bab
|
1251 |
{ |
93315ed6d
|
1252 |
struct audit_entry *e; |
f368c07d7
|
1253 |
struct audit_watch *watch = entry->rule.watch; |
74c3cbe33
|
1254 |
struct audit_tree *tree = entry->rule.tree; |
6f686d3d1
|
1255 |
struct nameidata *ndp = NULL, *ndw = NULL; |
36c4f1b18
|
1256 |
struct list_head *list; |
6f686d3d1
|
1257 |
int h, err; |
471a5c7c8
|
1258 1259 1260 1261 1262 1263 1264 1265 |
#ifdef CONFIG_AUDITSYSCALL int dont_count = 0; /* If either of these, don't count towards total */ if (entry->rule.listnr == AUDIT_FILTER_USER || entry->rule.listnr == AUDIT_FILTER_TYPE) dont_count = 1; #endif |
f368c07d7
|
1266 |
|
f368c07d7
|
1267 |
mutex_lock(&audit_filter_mutex); |
36c4f1b18
|
1268 |
e = audit_find_rule(entry, &list); |
f368c07d7
|
1269 1270 1271 |
mutex_unlock(&audit_filter_mutex); if (e) { err = -EEXIST; |
74c3cbe33
|
1272 1273 1274 |
/* normally audit_add_tree_rule() will free it on failure */ if (tree) audit_put_tree(tree); |
f368c07d7
|
1275 1276 |
goto error; } |
fe7752bab
|
1277 |
|
f368c07d7
|
1278 1279 1280 1281 1282 |
/* Avoid calling path_lookup under audit_filter_mutex. */ if (watch) { err = audit_get_nd(watch->path, &ndp, &ndw); if (err) goto error; |
f368c07d7
|
1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 |
} mutex_lock(&audit_filter_mutex); if (watch) { /* audit_filter_mutex is dropped and re-taken during this call */ err = audit_add_watch(&entry->rule, ndp, ndw); if (err) { mutex_unlock(&audit_filter_mutex); goto error; } h = audit_hash_ino((u32)watch->ino); list = &audit_inode_hash[h]; |
fe7752bab
|
1295 |
} |
74c3cbe33
|
1296 1297 1298 1299 1300 1301 1302 |
if (tree) { err = audit_add_tree_rule(&entry->rule); if (err) { mutex_unlock(&audit_filter_mutex); goto error; } } |
fe7752bab
|
1303 |
|
0590b9335
|
1304 1305 1306 1307 1308 1309 1310 |
entry->rule.prio = ~0ULL; if (entry->rule.listnr == AUDIT_FILTER_EXIT) { if (entry->rule.flags & AUDIT_FILTER_PREPEND) entry->rule.prio = ++prio_high; else entry->rule.prio = --prio_low; } |
fe7752bab
|
1311 |
if (entry->rule.flags & AUDIT_FILTER_PREPEND) { |
e45aa212e
|
1312 1313 |
list_add(&entry->rule.list, &audit_rules_list[entry->rule.listnr]); |
fe7752bab
|
1314 |
list_add_rcu(&entry->list, list); |
6a2bceec0
|
1315 |
entry->rule.flags &= ~AUDIT_FILTER_PREPEND; |
fe7752bab
|
1316 |
} else { |
e45aa212e
|
1317 1318 |
list_add_tail(&entry->rule.list, &audit_rules_list[entry->rule.listnr]); |
fe7752bab
|
1319 1320 |
list_add_tail_rcu(&entry->list, list); } |
471a5c7c8
|
1321 1322 1323 |
#ifdef CONFIG_AUDITSYSCALL if (!dont_count) audit_n_rules++; |
e54dc2431
|
1324 1325 1326 |
if (!audit_match_signal(entry)) audit_signals++; |
471a5c7c8
|
1327 |
#endif |
f368c07d7
|
1328 |
mutex_unlock(&audit_filter_mutex); |
fe7752bab
|
1329 |
|
6f686d3d1
|
1330 |
audit_put_nd(ndp, ndw); /* NULL args OK */ |
f368c07d7
|
1331 1332 1333 |
return 0; error: |
6f686d3d1
|
1334 |
audit_put_nd(ndp, ndw); /* NULL args OK */ |
f368c07d7
|
1335 1336 1337 |
if (watch) audit_put_watch(watch); /* tmp watch, matches initial get */ return err; |
fe7752bab
|
1338 |
} |
f368c07d7
|
1339 |
/* Remove an existing rule from filterlist. */ |
36c4f1b18
|
1340 |
static inline int audit_del_rule(struct audit_entry *entry) |
fe7752bab
|
1341 1342 |
{ struct audit_entry *e; |
f368c07d7
|
1343 |
struct audit_watch *watch, *tmp_watch = entry->rule.watch; |
74c3cbe33
|
1344 |
struct audit_tree *tree = entry->rule.tree; |
36c4f1b18
|
1345 |
struct list_head *list; |
f368c07d7
|
1346 |
LIST_HEAD(inotify_list); |
36c4f1b18
|
1347 |
int ret = 0; |
471a5c7c8
|
1348 1349 1350 1351 1352 1353 1354 1355 |
#ifdef CONFIG_AUDITSYSCALL int dont_count = 0; /* If either of these, don't count towards total */ if (entry->rule.listnr == AUDIT_FILTER_USER || entry->rule.listnr == AUDIT_FILTER_TYPE) dont_count = 1; #endif |
f368c07d7
|
1356 |
|
f368c07d7
|
1357 |
mutex_lock(&audit_filter_mutex); |
36c4f1b18
|
1358 |
e = audit_find_rule(entry, &list); |
f368c07d7
|
1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 |
if (!e) { mutex_unlock(&audit_filter_mutex); ret = -ENOENT; goto out; } watch = e->rule.watch; if (watch) { struct audit_parent *parent = watch->parent; list_del(&e->rule.rlist); if (list_empty(&watch->rules)) { audit_remove_watch(watch); if (list_empty(&parent->watches)) { /* Put parent on the inotify un-registration * list. Grab a reference before releasing * audit_filter_mutex, to be released in |
8f7b0ba1c
|
1378 1379 1380 1381 1382 1383 1384 |
* audit_inotify_unregister(). * If filesystem is going away, just leave * the sucker alone, eviction will take * care of it. */ if (pin_inotify_watch(&parent->wdata)) list_add(&parent->ilist, &inotify_list); |
f368c07d7
|
1385 |
} |
fe7752bab
|
1386 1387 |
} } |
f368c07d7
|
1388 |
|
74c3cbe33
|
1389 1390 |
if (e->rule.tree) audit_remove_tree_rule(&e->rule); |
f368c07d7
|
1391 |
list_del_rcu(&e->list); |
e45aa212e
|
1392 |
list_del(&e->rule.list); |
f368c07d7
|
1393 |
call_rcu(&e->rcu, audit_free_rule_rcu); |
471a5c7c8
|
1394 1395 1396 |
#ifdef CONFIG_AUDITSYSCALL if (!dont_count) audit_n_rules--; |
e54dc2431
|
1397 1398 1399 |
if (!audit_match_signal(entry)) audit_signals--; |
471a5c7c8
|
1400 |
#endif |
f368c07d7
|
1401 1402 1403 1404 1405 1406 1407 1408 |
mutex_unlock(&audit_filter_mutex); if (!list_empty(&inotify_list)) audit_inotify_unregister(&inotify_list); out: if (tmp_watch) audit_put_watch(tmp_watch); /* match initial get */ |
74c3cbe33
|
1409 1410 |
if (tree) audit_put_tree(tree); /* that's the temporary one */ |
f368c07d7
|
1411 1412 |
return ret; |
fe7752bab
|
1413 |
} |
93315ed6d
|
1414 1415 |
/* List rules using struct audit_rule. Exists for backward * compatibility with userspace. */ |
9044e6bca
|
1416 |
static void audit_list(int pid, int seq, struct sk_buff_head *q) |
fe7752bab
|
1417 |
{ |
9044e6bca
|
1418 |
struct sk_buff *skb; |
e45aa212e
|
1419 |
struct audit_krule *r; |
fe7752bab
|
1420 |
int i; |
f368c07d7
|
1421 1422 |
/* This is a blocking read, so use audit_filter_mutex instead of rcu * iterator to sync with list writers. */ |
fe7752bab
|
1423 |
for (i=0; i<AUDIT_NR_FILTERS; i++) { |
e45aa212e
|
1424 |
list_for_each_entry(r, &audit_rules_list[i], list) { |
f368c07d7
|
1425 |
struct audit_rule *rule; |
e45aa212e
|
1426 |
rule = audit_krule_to_rule(r); |
f368c07d7
|
1427 1428 1429 1430 1431 1432 1433 1434 1435 |
if (unlikely(!rule)) break; skb = audit_make_reply(pid, seq, AUDIT_LIST, 0, 1, rule, sizeof(*rule)); if (skb) skb_queue_tail(q, skb); kfree(rule); } } |
9044e6bca
|
1436 1437 1438 |
skb = audit_make_reply(pid, seq, AUDIT_LIST, 1, 1, NULL, 0); if (skb) skb_queue_tail(q, skb); |
fe7752bab
|
1439 |
} |
93315ed6d
|
1440 |
/* List rules using struct audit_rule_data. */ |
9044e6bca
|
1441 |
static void audit_list_rules(int pid, int seq, struct sk_buff_head *q) |
93315ed6d
|
1442 |
{ |
9044e6bca
|
1443 |
struct sk_buff *skb; |
e45aa212e
|
1444 |
struct audit_krule *r; |
93315ed6d
|
1445 |
int i; |
f368c07d7
|
1446 1447 |
/* This is a blocking read, so use audit_filter_mutex instead of rcu * iterator to sync with list writers. */ |
93315ed6d
|
1448 |
for (i=0; i<AUDIT_NR_FILTERS; i++) { |
e45aa212e
|
1449 |
list_for_each_entry(r, &audit_rules_list[i], list) { |
f368c07d7
|
1450 |
struct audit_rule_data *data; |
e45aa212e
|
1451 |
data = audit_krule_to_data(r); |
f368c07d7
|
1452 1453 1454 1455 |
if (unlikely(!data)) break; skb = audit_make_reply(pid, seq, AUDIT_LIST_RULES, 0, 1, data, sizeof(*data) + data->buflen); |
9044e6bca
|
1456 1457 |
if (skb) skb_queue_tail(q, skb); |
93315ed6d
|
1458 1459 1460 |
kfree(data); } } |
9044e6bca
|
1461 1462 1463 |
skb = audit_make_reply(pid, seq, AUDIT_LIST_RULES, 1, 1, NULL, 0); if (skb) skb_queue_tail(q, skb); |
93315ed6d
|
1464 |
} |
5adc8a6ad
|
1465 |
/* Log rule additions and removals */ |
2532386f4
|
1466 1467 1468 |
static void audit_log_rule_change(uid_t loginuid, u32 sessionid, u32 sid, char *action, struct audit_krule *rule, int res) |
5adc8a6ad
|
1469 1470 |
{ struct audit_buffer *ab; |
1a6b9f231
|
1471 1472 |
if (!audit_enabled) return; |
5adc8a6ad
|
1473 1474 1475 |
ab = audit_log_start(NULL, GFP_KERNEL, AUDIT_CONFIG_CHANGE); if (!ab) return; |
2532386f4
|
1476 |
audit_log_format(ab, "auid=%u ses=%u", loginuid, sessionid); |
5adc8a6ad
|
1477 1478 1479 |
if (sid) { char *ctx = NULL; u32 len; |
2a862b32f
|
1480 |
if (security_secid_to_secctx(sid, &ctx, &len)) |
5adc8a6ad
|
1481 |
audit_log_format(ab, " ssid=%u", sid); |
2a862b32f
|
1482 |
else { |
5adc8a6ad
|
1483 |
audit_log_format(ab, " subj=%s", ctx); |
2a862b32f
|
1484 1485 |
security_release_secctx(ctx, len); } |
5adc8a6ad
|
1486 |
} |
a17b4ad77
|
1487 |
audit_log_format(ab, " op=%s rule key=", action); |
5adc8a6ad
|
1488 1489 1490 1491 1492 1493 1494 |
if (rule->filterkey) audit_log_untrustedstring(ab, rule->filterkey); else audit_log_format(ab, "(null)"); audit_log_format(ab, " list=%d res=%d", rule->listnr, res); audit_log_end(ab); } |
fe7752bab
|
1495 1496 1497 1498 1499 1500 1501 |
/** * audit_receive_filter - apply all rules to the specified message type * @type: audit message type * @pid: target pid for netlink audit messages * @uid: target uid for netlink audit messages * @seq: netlink audit message sequence (serial) number * @data: payload data |
93315ed6d
|
1502 |
* @datasz: size of payload data |
fe7752bab
|
1503 |
* @loginuid: loginuid of sender |
9f0aecdd1
|
1504 |
* @sessionid: sessionid for netlink audit message |
ce29b682e
|
1505 |
* @sid: SE Linux Security ID of sender |
fe7752bab
|
1506 1507 |
*/ int audit_receive_filter(int type, int pid, int uid, int seq, void *data, |
2532386f4
|
1508 |
size_t datasz, uid_t loginuid, u32 sessionid, u32 sid) |
fe7752bab
|
1509 1510 |
{ struct task_struct *tsk; |
9044e6bca
|
1511 |
struct audit_netlink_list *dest; |
93315ed6d
|
1512 1513 |
int err = 0; struct audit_entry *entry; |
fe7752bab
|
1514 1515 1516 |
switch (type) { case AUDIT_LIST: |
93315ed6d
|
1517 |
case AUDIT_LIST_RULES: |
fe7752bab
|
1518 1519 1520 1521 1522 |
/* We can't just spew out the rules here because we might fill * the available socket buffer space and deadlock waiting for * auditctl to read from it... which isn't ever going to * happen if we're actually running in the context of auditctl * trying to _send_ the stuff */ |
9ce34218a
|
1523 |
|
9044e6bca
|
1524 |
dest = kmalloc(sizeof(struct audit_netlink_list), GFP_KERNEL); |
fe7752bab
|
1525 1526 |
if (!dest) return -ENOMEM; |
9044e6bca
|
1527 1528 |
dest->pid = pid; skb_queue_head_init(&dest->q); |
fe7752bab
|
1529 |
|
f368c07d7
|
1530 |
mutex_lock(&audit_filter_mutex); |
93315ed6d
|
1531 |
if (type == AUDIT_LIST) |
9044e6bca
|
1532 |
audit_list(pid, seq, &dest->q); |
93315ed6d
|
1533 |
else |
9044e6bca
|
1534 |
audit_list_rules(pid, seq, &dest->q); |
f368c07d7
|
1535 |
mutex_unlock(&audit_filter_mutex); |
9044e6bca
|
1536 1537 |
tsk = kthread_run(audit_send_list, dest, "audit_send_list"); |
fe7752bab
|
1538 |
if (IS_ERR(tsk)) { |
9044e6bca
|
1539 |
skb_queue_purge(&dest->q); |
fe7752bab
|
1540 1541 1542 1543 1544 |
kfree(dest); err = PTR_ERR(tsk); } break; case AUDIT_ADD: |
93315ed6d
|
1545 1546 1547 1548 1549 1550 1551 |
case AUDIT_ADD_RULE: if (type == AUDIT_ADD) entry = audit_rule_to_entry(data); else entry = audit_data_to_entry(data, datasz); if (IS_ERR(entry)) return PTR_ERR(entry); |
36c4f1b18
|
1552 |
err = audit_add_rule(entry); |
2532386f4
|
1553 1554 |
audit_log_rule_change(loginuid, sessionid, sid, "add", &entry->rule, !err); |
5d3301088
|
1555 1556 |
if (err) |
93315ed6d
|
1557 |
audit_free_rule(entry); |
fe7752bab
|
1558 1559 |
break; case AUDIT_DEL: |
93315ed6d
|
1560 1561 1562 1563 1564 1565 1566 |
case AUDIT_DEL_RULE: if (type == AUDIT_DEL) entry = audit_rule_to_entry(data); else entry = audit_data_to_entry(data, datasz); if (IS_ERR(entry)) return PTR_ERR(entry); |
36c4f1b18
|
1567 |
err = audit_del_rule(entry); |
2532386f4
|
1568 1569 |
audit_log_rule_change(loginuid, sessionid, sid, "remove", &entry->rule, !err); |
5d3301088
|
1570 |
|
93315ed6d
|
1571 |
audit_free_rule(entry); |
fe7752bab
|
1572 1573 1574 1575 1576 1577 1578 |
break; default: return -EINVAL; } return err; } |
5af75d8d5
|
1579 |
int audit_comparator(u32 left, u32 op, u32 right) |
fe7752bab
|
1580 1581 |
{ switch (op) { |
5af75d8d5
|
1582 |
case Audit_equal: |
fe7752bab
|
1583 |
return (left == right); |
5af75d8d5
|
1584 |
case Audit_not_equal: |
fe7752bab
|
1585 |
return (left != right); |
5af75d8d5
|
1586 |
case Audit_lt: |
fe7752bab
|
1587 |
return (left < right); |
5af75d8d5
|
1588 |
case Audit_le: |
fe7752bab
|
1589 |
return (left <= right); |
5af75d8d5
|
1590 |
case Audit_gt: |
fe7752bab
|
1591 |
return (left > right); |
5af75d8d5
|
1592 |
case Audit_ge: |
fe7752bab
|
1593 |
return (left >= right); |
5af75d8d5
|
1594 |
case Audit_bitmask: |
74f2345b6
|
1595 |
return (left & right); |
5af75d8d5
|
1596 |
case Audit_bittest: |
74f2345b6
|
1597 |
return ((left & right) == right); |
5af75d8d5
|
1598 1599 1600 |
default: BUG(); return 0; |
fe7752bab
|
1601 1602 |
} } |
f368c07d7
|
1603 1604 |
/* Compare given dentry name with last component in given path, * return of 0 indicates a match. */ |
9c937dcc7
|
1605 1606 |
int audit_compare_dname_path(const char *dname, const char *path, int *dirlen) |
f368c07d7
|
1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 |
{ int dlen, plen; const char *p; if (!dname || !path) return 1; dlen = strlen(dname); plen = strlen(path); if (plen < dlen) return 1; /* disregard trailing slashes */ p = path + plen - 1; while ((*p == '/') && (p > path)) p--; /* find last path component */ p = p - dlen + 1; if (p < path) return 1; else if (p > path) { if (*--p != '/') return 1; else p++; } |
fe7752bab
|
1634 |
|
9c937dcc7
|
1635 1636 1637 |
/* return length of path's directory component */ if (dirlen) *dirlen = p - path; |
f368c07d7
|
1638 1639 |
return strncmp(p, dname, dlen); } |
fe7752bab
|
1640 1641 |
static int audit_filter_user_rules(struct netlink_skb_parms *cb, |
93315ed6d
|
1642 |
struct audit_krule *rule, |
fe7752bab
|
1643 1644 1645 1646 1647 |
enum audit_state *state) { int i; for (i = 0; i < rule->field_count; i++) { |
93315ed6d
|
1648 |
struct audit_field *f = &rule->fields[i]; |
fe7752bab
|
1649 |
int result = 0; |
93315ed6d
|
1650 |
switch (f->type) { |
fe7752bab
|
1651 |
case AUDIT_PID: |
93315ed6d
|
1652 |
result = audit_comparator(cb->creds.pid, f->op, f->val); |
fe7752bab
|
1653 1654 |
break; case AUDIT_UID: |
93315ed6d
|
1655 |
result = audit_comparator(cb->creds.uid, f->op, f->val); |
fe7752bab
|
1656 1657 |
break; case AUDIT_GID: |
93315ed6d
|
1658 |
result = audit_comparator(cb->creds.gid, f->op, f->val); |
fe7752bab
|
1659 1660 |
break; case AUDIT_LOGINUID: |
93315ed6d
|
1661 |
result = audit_comparator(cb->loginuid, f->op, f->val); |
fe7752bab
|
1662 1663 1664 1665 1666 1667 1668 1669 |
break; } if (!result) return 0; } switch (rule->action) { case AUDIT_NEVER: *state = AUDIT_DISABLED; break; |
fe7752bab
|
1670 1671 1672 1673 |
case AUDIT_ALWAYS: *state = AUDIT_RECORD_CONTEXT; break; } return 1; } |
d8de72473
|
1674 |
int audit_filter_user(struct netlink_skb_parms *cb) |
fe7752bab
|
1675 |
{ |
11f57cedc
|
1676 |
enum audit_state state = AUDIT_DISABLED; |
fe7752bab
|
1677 |
struct audit_entry *e; |
fe7752bab
|
1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 |
int ret = 1; rcu_read_lock(); list_for_each_entry_rcu(e, &audit_filter_list[AUDIT_FILTER_USER], list) { if (audit_filter_user_rules(cb, &e->rule, &state)) { if (state == AUDIT_DISABLED) ret = 0; break; } } rcu_read_unlock(); return ret; /* Audit by default */ } int audit_filter_type(int type) { struct audit_entry *e; int result = 0; |
9ce34218a
|
1697 |
|
fe7752bab
|
1698 1699 1700 1701 1702 1703 |
rcu_read_lock(); if (list_empty(&audit_filter_list[AUDIT_FILTER_TYPE])) goto unlock_and_return; list_for_each_entry_rcu(e, &audit_filter_list[AUDIT_FILTER_TYPE], list) { |
fe7752bab
|
1704 |
int i; |
93315ed6d
|
1705 1706 1707 1708 |
for (i = 0; i < e->rule.field_count; i++) { struct audit_field *f = &e->rule.fields[i]; if (f->type == AUDIT_MSGTYPE) { result = audit_comparator(type, f->op, f->val); |
fe7752bab
|
1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 |
if (!result) break; } } if (result) goto unlock_and_return; } unlock_and_return: rcu_read_unlock(); return result; } |
3dc7e3153
|
1720 |
|
e45aa212e
|
1721 |
static int update_lsm_rule(struct audit_krule *r) |
1a9d0797b
|
1722 |
{ |
e45aa212e
|
1723 |
struct audit_entry *entry = container_of(r, struct audit_entry, rule); |
1a9d0797b
|
1724 1725 1726 1727 |
struct audit_entry *nentry; struct audit_watch *watch; struct audit_tree *tree; int err = 0; |
e45aa212e
|
1728 |
if (!security_audit_rule_known(r)) |
1a9d0797b
|
1729 |
return 0; |
e45aa212e
|
1730 1731 1732 |
watch = r->watch; tree = r->tree; nentry = audit_dupe_rule(r, watch); |
1a9d0797b
|
1733 1734 1735 1736 1737 1738 |
if (IS_ERR(nentry)) { /* save the first error encountered for the * return value */ err = PTR_ERR(nentry); audit_panic("error updating LSM filters"); if (watch) |
e45aa212e
|
1739 |
list_del(&r->rlist); |
1a9d0797b
|
1740 |
list_del_rcu(&entry->list); |
e45aa212e
|
1741 |
list_del(&r->list); |
1a9d0797b
|
1742 1743 1744 |
} else { if (watch) { list_add(&nentry->rule.rlist, &watch->rules); |
e45aa212e
|
1745 |
list_del(&r->rlist); |
1a9d0797b
|
1746 |
} else if (tree) |
e45aa212e
|
1747 |
list_replace_init(&r->rlist, &nentry->rule.rlist); |
1a9d0797b
|
1748 |
list_replace_rcu(&entry->list, &nentry->list); |
e45aa212e
|
1749 |
list_replace(&r->list, &nentry->rule.list); |
1a9d0797b
|
1750 1751 1752 1753 1754 |
} call_rcu(&entry->rcu, audit_free_rule_rcu); return err; } |
04305e4af
|
1755 |
/* This function will re-initialize the lsm_rule field of all applicable rules. |
d7a96f3a1
|
1756 |
* It will traverse the filter lists serarching for rules that contain LSM |
3dc7e3153
|
1757 |
* specific filter fields. When such a rule is found, it is copied, the |
d7a96f3a1
|
1758 |
* LSM field is re-initialized, and the old rule is replaced with the |
3dc7e3153
|
1759 |
* updated rule. */ |
d7a96f3a1
|
1760 |
int audit_update_lsm_rules(void) |
3dc7e3153
|
1761 |
{ |
e45aa212e
|
1762 |
struct audit_krule *r, *n; |
3dc7e3153
|
1763 |
int i, err = 0; |
f368c07d7
|
1764 1765 |
/* audit_filter_mutex synchronizes the writers */ mutex_lock(&audit_filter_mutex); |
3dc7e3153
|
1766 1767 |
for (i = 0; i < AUDIT_NR_FILTERS; i++) { |
e45aa212e
|
1768 1769 |
list_for_each_entry_safe(r, n, &audit_rules_list[i], list) { int res = update_lsm_rule(r); |
1a9d0797b
|
1770 1771 |
if (!err) err = res; |
3dc7e3153
|
1772 1773 |
} } |
f368c07d7
|
1774 |
mutex_unlock(&audit_filter_mutex); |
3dc7e3153
|
1775 1776 1777 |
return err; } |
f368c07d7
|
1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 |
/* Update watch data in audit rules based on inotify events. */ void audit_handle_ievent(struct inotify_watch *i_watch, u32 wd, u32 mask, u32 cookie, const char *dname, struct inode *inode) { struct audit_parent *parent; parent = container_of(i_watch, struct audit_parent, wdata); if (mask & (IN_CREATE|IN_MOVED_TO) && inode) audit_update_watch(parent, dname, inode->i_sb->s_dev, inode->i_ino, 0); else if (mask & (IN_DELETE|IN_MOVED_FROM)) audit_update_watch(parent, dname, (dev_t)-1, (unsigned long)-1, 1); /* inotify automatically removes the watch and sends IN_IGNORED */ else if (mask & (IN_DELETE_SELF|IN_UNMOUNT)) audit_remove_parent_watches(parent); /* inotify does not remove the watch, so remove it manually */ else if(mask & IN_MOVE_SELF) { audit_remove_parent_watches(parent); inotify_remove_watch_locked(audit_ih, i_watch); } else if (mask & IN_IGNORED) put_inotify_watch(i_watch); } |