diff options
| author | Al Viro <viro@zeniv.linux.org.uk> | 2008-12-16 05:59:26 -0500 |
|---|---|---|
| committer | Al Viro <viro@zeniv.linux.org.uk> | 2009-01-04 15:14:42 -0500 |
| commit | 5af75d8d58d0f9f7b7c0515b35786b22892d5f12 (patch) | |
| tree | 65707c5309133a33140c39145ae91b7c1679a877 /kernel | |
| parent | 36c4f1b18c8a7d0adb4085e7f531860b837bb6b0 (diff) | |
audit: validate comparison operations, store them in sane form
Don't store the field->op in the messy (and very inconvenient for e.g.
audit_comparator()) form; translate to dense set of values and do full
validation of userland-submitted value while we are at it.
->audit_init_rule() and ->audit_match_rule() get new values now; in-tree
instances updated.
Signed-off-by: Al Viro <viro@zeniv.linux.org.uk>
Diffstat (limited to 'kernel')
| -rw-r--r-- | kernel/audit_tree.c | 2 | ||||
| -rw-r--r-- | kernel/auditfilter.c | 132 |
2 files changed, 66 insertions, 68 deletions
diff --git a/kernel/audit_tree.c b/kernel/audit_tree.c index 48bddad2a3dc..8ad9545b8db9 100644 --- a/kernel/audit_tree.c +++ b/kernel/audit_tree.c | |||
| @@ -618,7 +618,7 @@ int audit_make_tree(struct audit_krule *rule, char *pathname, u32 op) | |||
| 618 | 618 | ||
| 619 | if (pathname[0] != '/' || | 619 | if (pathname[0] != '/' || |
| 620 | rule->listnr != AUDIT_FILTER_EXIT || | 620 | rule->listnr != AUDIT_FILTER_EXIT || |
| 621 | op & ~AUDIT_EQUAL || | 621 | op != Audit_equal || |
| 622 | rule->inode_f || rule->watch || rule->tree) | 622 | rule->inode_f || rule->watch || rule->tree) |
| 623 | return -EINVAL; | 623 | return -EINVAL; |
| 624 | rule->tree = alloc_tree(pathname); | 624 | rule->tree = alloc_tree(pathname); |
diff --git a/kernel/auditfilter.c b/kernel/auditfilter.c index e6e3829cadd1..fbf24d121d97 100644 --- a/kernel/auditfilter.c +++ b/kernel/auditfilter.c | |||
| @@ -252,7 +252,8 @@ static inline int audit_to_inode(struct audit_krule *krule, | |||
| 252 | struct audit_field *f) | 252 | struct audit_field *f) |
| 253 | { | 253 | { |
| 254 | if (krule->listnr != AUDIT_FILTER_EXIT || | 254 | if (krule->listnr != AUDIT_FILTER_EXIT || |
| 255 | krule->watch || krule->inode_f || krule->tree) | 255 | krule->watch || krule->inode_f || krule->tree || |
| 256 | (f->op != Audit_equal && f->op != Audit_not_equal)) | ||
| 256 | return -EINVAL; | 257 | return -EINVAL; |
| 257 | 258 | ||
| 258 | krule->inode_f = f; | 259 | krule->inode_f = f; |
| @@ -270,7 +271,7 @@ static int audit_to_watch(struct audit_krule *krule, char *path, int len, | |||
| 270 | 271 | ||
| 271 | if (path[0] != '/' || path[len-1] == '/' || | 272 | if (path[0] != '/' || path[len-1] == '/' || |
| 272 | krule->listnr != AUDIT_FILTER_EXIT || | 273 | krule->listnr != AUDIT_FILTER_EXIT || |
| 273 | op & ~AUDIT_EQUAL || | 274 | op != Audit_equal || |
| 274 | krule->inode_f || krule->watch || krule->tree) | 275 | krule->inode_f || krule->watch || krule->tree) |
| 275 | return -EINVAL; | 276 | return -EINVAL; |
| 276 | 277 | ||
| @@ -420,12 +421,32 @@ exit_err: | |||
| 420 | return ERR_PTR(err); | 421 | return ERR_PTR(err); |
| 421 | } | 422 | } |
| 422 | 423 | ||
| 424 | static u32 audit_ops[] = | ||
| 425 | { | ||
| 426 | [Audit_equal] = AUDIT_EQUAL, | ||
| 427 | [Audit_not_equal] = AUDIT_NOT_EQUAL, | ||
| 428 | [Audit_bitmask] = AUDIT_BIT_MASK, | ||
| 429 | [Audit_bittest] = AUDIT_BIT_TEST, | ||
| 430 | [Audit_lt] = AUDIT_LESS_THAN, | ||
| 431 | [Audit_gt] = AUDIT_GREATER_THAN, | ||
| 432 | [Audit_le] = AUDIT_LESS_THAN_OR_EQUAL, | ||
| 433 | [Audit_ge] = AUDIT_GREATER_THAN_OR_EQUAL, | ||
| 434 | }; | ||
| 435 | |||
| 436 | static u32 audit_to_op(u32 op) | ||
| 437 | { | ||
| 438 | u32 n; | ||
| 439 | for (n = Audit_equal; n < Audit_bad && audit_ops[n] != op; n++) | ||
| 440 | ; | ||
| 441 | return n; | ||
| 442 | } | ||
| 443 | |||
| 444 | |||
| 423 | /* Translate struct audit_rule to kernel's rule respresentation. | 445 | /* Translate struct audit_rule to kernel's rule respresentation. |
| 424 | * Exists for backward compatibility with userspace. */ | 446 | * Exists for backward compatibility with userspace. */ |
| 425 | static struct audit_entry *audit_rule_to_entry(struct audit_rule *rule) | 447 | static struct audit_entry *audit_rule_to_entry(struct audit_rule *rule) |
| 426 | { | 448 | { |
| 427 | struct audit_entry *entry; | 449 | struct audit_entry *entry; |
| 428 | struct audit_field *ino_f; | ||
| 429 | int err = 0; | 450 | int err = 0; |
| 430 | int i; | 451 | int i; |
| 431 | 452 | ||
| @@ -435,12 +456,28 @@ static struct audit_entry *audit_rule_to_entry(struct audit_rule *rule) | |||
| 435 | 456 | ||
| 436 | for (i = 0; i < rule->field_count; i++) { | 457 | for (i = 0; i < rule->field_count; i++) { |
| 437 | struct audit_field *f = &entry->rule.fields[i]; | 458 | struct audit_field *f = &entry->rule.fields[i]; |
| 459 | u32 n; | ||
| 460 | |||
| 461 | n = rule->fields[i] & (AUDIT_NEGATE|AUDIT_OPERATORS); | ||
| 462 | |||
| 463 | /* Support for legacy operators where | ||
| 464 | * AUDIT_NEGATE bit signifies != and otherwise assumes == */ | ||
| 465 | if (n & AUDIT_NEGATE) | ||
| 466 | f->op = Audit_not_equal; | ||
| 467 | else if (!n) | ||
| 468 | f->op = Audit_equal; | ||
| 469 | else | ||
| 470 | f->op = audit_to_op(n); | ||
| 471 | |||
| 472 | entry->rule.vers_ops = (n & AUDIT_OPERATORS) ? 2 : 1; | ||
| 438 | 473 | ||
| 439 | f->op = rule->fields[i] & (AUDIT_NEGATE|AUDIT_OPERATORS); | ||
| 440 | f->type = rule->fields[i] & ~(AUDIT_NEGATE|AUDIT_OPERATORS); | 474 | f->type = rule->fields[i] & ~(AUDIT_NEGATE|AUDIT_OPERATORS); |
| 441 | f->val = rule->values[i]; | 475 | f->val = rule->values[i]; |
| 442 | 476 | ||
| 443 | err = -EINVAL; | 477 | err = -EINVAL; |
| 478 | if (f->op == Audit_bad) | ||
| 479 | goto exit_free; | ||
| 480 | |||
| 444 | switch(f->type) { | 481 | switch(f->type) { |
| 445 | default: | 482 | default: |
| 446 | goto exit_free; | 483 | goto exit_free; |
| @@ -462,11 +499,8 @@ static struct audit_entry *audit_rule_to_entry(struct audit_rule *rule) | |||
| 462 | case AUDIT_EXIT: | 499 | case AUDIT_EXIT: |
| 463 | case AUDIT_SUCCESS: | 500 | case AUDIT_SUCCESS: |
| 464 | /* bit ops are only useful on syscall args */ | 501 | /* bit ops are only useful on syscall args */ |
| 465 | if (f->op == AUDIT_BIT_MASK || | 502 | if (f->op == Audit_bitmask || f->op == Audit_bittest) |
| 466 | f->op == AUDIT_BIT_TEST) { | ||
| 467 | err = -EINVAL; | ||
| 468 | goto exit_free; | 503 | goto exit_free; |
| 469 | } | ||
| 470 | break; | 504 | break; |
| 471 | case AUDIT_ARG0: | 505 | case AUDIT_ARG0: |
| 472 | case AUDIT_ARG1: | 506 | case AUDIT_ARG1: |
| @@ -475,11 +509,8 @@ static struct audit_entry *audit_rule_to_entry(struct audit_rule *rule) | |||
| 475 | break; | 509 | break; |
| 476 | /* arch is only allowed to be = or != */ | 510 | /* arch is only allowed to be = or != */ |
| 477 | case AUDIT_ARCH: | 511 | case AUDIT_ARCH: |
| 478 | if ((f->op != AUDIT_NOT_EQUAL) && (f->op != AUDIT_EQUAL) | 512 | if (f->op != Audit_not_equal && f->op != Audit_equal) |
| 479 | && (f->op != AUDIT_NEGATE) && (f->op)) { | ||
| 480 | err = -EINVAL; | ||
| 481 | goto exit_free; | 513 | goto exit_free; |
| 482 | } | ||
| 483 | entry->rule.arch_f = f; | 514 | entry->rule.arch_f = f; |
| 484 | break; | 515 | break; |
| 485 | case AUDIT_PERM: | 516 | case AUDIT_PERM: |
| @@ -496,33 +527,10 @@ static struct audit_entry *audit_rule_to_entry(struct audit_rule *rule) | |||
| 496 | goto exit_free; | 527 | goto exit_free; |
| 497 | break; | 528 | break; |
| 498 | } | 529 | } |
| 499 | |||
| 500 | entry->rule.vers_ops = (f->op & AUDIT_OPERATORS) ? 2 : 1; | ||
| 501 | |||
| 502 | /* Support for legacy operators where | ||
| 503 | * AUDIT_NEGATE bit signifies != and otherwise assumes == */ | ||
| 504 | if (f->op & AUDIT_NEGATE) | ||
| 505 | f->op = AUDIT_NOT_EQUAL; | ||
| 506 | else if (!f->op) | ||
| 507 | f->op = AUDIT_EQUAL; | ||
| 508 | else if (f->op == AUDIT_OPERATORS) { | ||
| 509 | err = -EINVAL; | ||
| 510 | goto exit_free; | ||
| 511 | } | ||
| 512 | } | 530 | } |
| 513 | 531 | ||
| 514 | ino_f = entry->rule.inode_f; | 532 | if (entry->rule.inode_f && entry->rule.inode_f->op == Audit_not_equal) |
| 515 | if (ino_f) { | 533 | entry->rule.inode_f = NULL; |
| 516 | switch(ino_f->op) { | ||
| 517 | case AUDIT_NOT_EQUAL: | ||
| 518 | entry->rule.inode_f = NULL; | ||
| 519 | case AUDIT_EQUAL: | ||
| 520 | break; | ||
| 521 | default: | ||
| 522 | err = -EINVAL; | ||
| 523 | goto exit_free; | ||
| 524 | } | ||
| 525 | } | ||
| 526 | 534 | ||
| 527 | exit_nofree: | 535 | exit_nofree: |
| 528 | return entry; | 536 | return entry; |
| @@ -538,7 +546,6 @@ static struct audit_entry *audit_data_to_entry(struct audit_rule_data *data, | |||
| 538 | { | 546 | { |
| 539 | int err = 0; | 547 | int err = 0; |
| 540 | struct audit_entry *entry; | 548 | struct audit_entry *entry; |
| 541 | struct audit_field *ino_f; | ||
| 542 | void *bufp; | 549 | void *bufp; |
| 543 | size_t remain = datasz - sizeof(struct audit_rule_data); | 550 | size_t remain = datasz - sizeof(struct audit_rule_data); |
| 544 | int i; | 551 | int i; |
