1 /* auditfilter.c -- filtering of audit events
3 * Copyright 2003-2004 Red Hat, Inc.
4 * Copyright 2005 Hewlett-Packard Development Company, L.P.
5 * Copyright 2005 IBM Corporation
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.
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.
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
22 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
24 #include <linux/kernel.h>
25 #include <linux/audit.h>
26 #include <linux/kthread.h>
27 #include <linux/mutex.h>
29 #include <linux/namei.h>
30 #include <linux/netlink.h>
31 #include <linux/sched.h>
32 #include <linux/slab.h>
33 #include <linux/security.h>
34 #include <net/net_namespace.h>
42 * 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.
51 /* Audit filter lists, defined in <linux/audit.h> */
52 struct 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]),
59 #if AUDIT_NR_FILTERS != 6
60 #error Fix audit_filter_list initialiser
63 static struct list_head audit_rules_list[AUDIT_NR_FILTERS] = {
64 LIST_HEAD_INIT(audit_rules_list[0]),
65 LIST_HEAD_INIT(audit_rules_list[1]),
66 LIST_HEAD_INIT(audit_rules_list[2]),
67 LIST_HEAD_INIT(audit_rules_list[3]),
68 LIST_HEAD_INIT(audit_rules_list[4]),
69 LIST_HEAD_INIT(audit_rules_list[5]),
72 DEFINE_MUTEX(audit_filter_mutex);
74 static void audit_free_lsm_field(struct audit_field *f)
85 case AUDIT_OBJ_LEV_LOW:
86 case AUDIT_OBJ_LEV_HIGH:
88 security_audit_rule_free(f->lsm_rule);
92 static inline void audit_free_rule(struct audit_entry *e)
95 struct audit_krule *erule = &e->rule;
97 /* some rules don't have associated watches */
99 audit_put_watch(erule->watch);
101 for (i = 0; i < erule->field_count; i++)
102 audit_free_lsm_field(&erule->fields[i]);
103 kfree(erule->fields);
104 kfree(erule->filterkey);
108 void audit_free_rule_rcu(struct rcu_head *head)
110 struct audit_entry *e = container_of(head, struct audit_entry, rcu);
114 /* Initialize an audit filterlist entry. */
115 static inline struct audit_entry *audit_init_entry(u32 field_count)
117 struct audit_entry *entry;
118 struct audit_field *fields;
120 entry = kzalloc(sizeof(*entry), GFP_KERNEL);
121 if (unlikely(!entry))
124 fields = kzalloc(sizeof(*fields) * field_count, GFP_KERNEL);
125 if (unlikely(!fields)) {
129 entry->rule.fields = fields;
134 /* Unpack a filter field's string representation from user-space
136 char *audit_unpack_string(void **bufp, size_t *remain, size_t len)
140 if (!*bufp || (len == 0) || (len > *remain))
141 return ERR_PTR(-EINVAL);
143 /* Of the currently implemented string fields, PATH_MAX
144 * defines the longest valid length.
147 return ERR_PTR(-ENAMETOOLONG);
149 str = kmalloc(len + 1, GFP_KERNEL);
151 return ERR_PTR(-ENOMEM);
153 memcpy(str, *bufp, len);
161 /* Translate an inode field to kernel respresentation. */
162 static inline int audit_to_inode(struct audit_krule *krule,
163 struct audit_field *f)
165 if (krule->listnr != AUDIT_FILTER_EXIT ||
166 krule->watch || krule->inode_f || krule->tree ||
167 (f->op != Audit_equal && f->op != Audit_not_equal))
174 static __u32 *classes[AUDIT_SYSCALL_CLASSES];
176 int __init audit_register_class(int class, unsigned *list)
178 __u32 *p = kzalloc(AUDIT_BITMASK_SIZE * sizeof(__u32), GFP_KERNEL);
181 while (*list != ~0U) {
182 unsigned n = *list++;
183 if (n >= AUDIT_BITMASK_SIZE * 32 - AUDIT_SYSCALL_CLASSES) {
187 p[AUDIT_WORD(n)] |= AUDIT_BIT(n);
189 if (class >= AUDIT_SYSCALL_CLASSES || classes[class]) {
197 int audit_match_class(int class, unsigned syscall)
199 if (unlikely(syscall >= AUDIT_BITMASK_SIZE * 32))
201 if (unlikely(class >= AUDIT_SYSCALL_CLASSES || !classes[class]))
203 return classes[class][AUDIT_WORD(syscall)] & AUDIT_BIT(syscall);
206 #ifdef CONFIG_AUDITSYSCALL
207 static inline int audit_match_class_bits(int class, u32 *mask)
211 if (classes[class]) {
212 for (i = 0; i < AUDIT_BITMASK_SIZE; i++)
213 if (mask[i] & classes[class][i])
219 static int audit_match_signal(struct audit_entry *entry)
221 struct audit_field *arch = entry->rule.arch_f;
224 /* When arch is unspecified, we must check both masks on biarch
225 * as syscall number alone is ambiguous. */
226 return (audit_match_class_bits(AUDIT_CLASS_SIGNAL,
228 audit_match_class_bits(AUDIT_CLASS_SIGNAL_32,
232 switch(audit_classify_arch(arch->val)) {
234 return (audit_match_class_bits(AUDIT_CLASS_SIGNAL,
236 case 1: /* 32bit on biarch */
237 return (audit_match_class_bits(AUDIT_CLASS_SIGNAL_32,
245 /* Common user-space to kernel rule translation. */
246 static inline struct audit_entry *audit_to_entry_common(struct audit_rule_data *rule)
249 struct audit_entry *entry;
253 listnr = rule->flags & ~AUDIT_FILTER_PREPEND;
257 #ifdef CONFIG_AUDITSYSCALL
258 case AUDIT_FILTER_ENTRY:
259 if (rule->action == AUDIT_ALWAYS)
261 case AUDIT_FILTER_EXIT:
262 case AUDIT_FILTER_TASK:
264 case AUDIT_FILTER_USER:
265 case AUDIT_FILTER_TYPE:
268 if (unlikely(rule->action == AUDIT_POSSIBLE)) {
269 pr_err("AUDIT_POSSIBLE is deprecated\n");
272 if (rule->action != AUDIT_NEVER && rule->action != AUDIT_ALWAYS)
274 if (rule->field_count > AUDIT_MAX_FIELDS)
278 entry = audit_init_entry(rule->field_count);
282 entry->rule.flags = rule->flags & AUDIT_FILTER_PREPEND;
283 entry->rule.listnr = listnr;
284 entry->rule.action = rule->action;
285 entry->rule.field_count = rule->field_count;
287 for (i = 0; i < AUDIT_BITMASK_SIZE; i++)
288 entry->rule.mask[i] = rule->mask[i];
290 for (i = 0; i < AUDIT_SYSCALL_CLASSES; i++) {
291 int bit = AUDIT_BITMASK_SIZE * 32 - i - 1;
292 __u32 *p = &entry->rule.mask[AUDIT_WORD(bit)];
295 if (!(*p & AUDIT_BIT(bit)))
297 *p &= ~AUDIT_BIT(bit);
301 for (j = 0; j < AUDIT_BITMASK_SIZE; j++)
302 entry->rule.mask[j] |= class[j];
312 static u32 audit_ops[] =
314 [Audit_equal] = AUDIT_EQUAL,
315 [Audit_not_equal] = AUDIT_NOT_EQUAL,
316 [Audit_bitmask] = AUDIT_BIT_MASK,
317 [Audit_bittest] = AUDIT_BIT_TEST,
318 [Audit_lt] = AUDIT_LESS_THAN,
319 [Audit_gt] = AUDIT_GREATER_THAN,
320 [Audit_le] = AUDIT_LESS_THAN_OR_EQUAL,
321 [Audit_ge] = AUDIT_GREATER_THAN_OR_EQUAL,
324 static u32 audit_to_op(u32 op)
327 for (n = Audit_equal; n < Audit_bad && audit_ops[n] != op; n++)
332 /* check if an audit field is valid */
333 static int audit_field_valid(struct audit_entry *entry, struct audit_field *f)
337 if (entry->rule.listnr != AUDIT_FILTER_TYPE &&
338 entry->rule.listnr != AUDIT_FILTER_USER)
366 /* bit ops are only useful on syscall args */
367 if (f->op == Audit_bitmask || f->op == Audit_bittest)
374 case AUDIT_SUBJ_USER:
375 case AUDIT_SUBJ_ROLE:
376 case AUDIT_SUBJ_TYPE:
382 case AUDIT_OBJ_LEV_LOW:
383 case AUDIT_OBJ_LEV_HIGH:
386 case AUDIT_FILTERKEY:
388 case AUDIT_LOGINUID_SET:
389 if ((f->val != 0) && (f->val != 1))
393 if (f->op != Audit_not_equal && f->op != Audit_equal)
401 if (f->val & ~S_IFMT)
404 case AUDIT_FIELD_COMPARE:
405 if (f->val > AUDIT_MAX_FIELD_COMPARE)
412 /* Translate struct audit_rule_data to kernel's rule respresentation. */
413 static struct audit_entry *audit_data_to_entry(struct audit_rule_data *data,
417 struct audit_entry *entry;
419 size_t remain = datasz - sizeof(struct audit_rule_data);
423 entry = audit_to_entry_common(data);
428 entry->rule.vers_ops = 2;
429 for (i = 0; i < data->field_count; i++) {
430 struct audit_field *f = &entry->rule.fields[i];
434 f->op = audit_to_op(data->fieldflags[i]);
435 if (f->op == Audit_bad)
438 f->type = data->fields[i];
439 f->val = data->values[i];
441 /* Support legacy tests for a valid loginuid */
442 if ((f->type == AUDIT_LOGINUID) && (f->val == AUDIT_UID_UNSET)) {
443 f->type = AUDIT_LOGINUID_SET;
447 if ((f->type == AUDIT_PID) || (f->type == AUDIT_PPID)) {
450 pid = find_vpid(f->val);
456 f->val = pid_nr(pid);
460 err = audit_field_valid(entry, f);
472 f->uid = make_kuid(current_user_ns(), f->val);
473 if (!uid_valid(f->uid))
481 f->gid = make_kgid(current_user_ns(), f->val);
482 if (!gid_valid(f->gid))
486 entry->rule.arch_f = f;
488 case AUDIT_SUBJ_USER:
489 case AUDIT_SUBJ_ROLE:
490 case AUDIT_SUBJ_TYPE:
496 case AUDIT_OBJ_LEV_LOW:
497 case AUDIT_OBJ_LEV_HIGH:
498 str = audit_unpack_string(&bufp, &remain, f->val);
501 entry->rule.buflen += f->val;
503 err = security_audit_rule_init(f->type, f->op, str,
504 (void **)&f->lsm_rule);
505 /* Keep currently invalid fields around in case they
506 * become valid after a policy reload. */
507 if (err == -EINVAL) {
508 pr_warn("audit rule for LSM \'%s\' is invalid\n",
519 str = audit_unpack_string(&bufp, &remain, f->val);
522 entry->rule.buflen += f->val;
524 err = audit_to_watch(&entry->rule, str, f->val, f->op);
531 str = audit_unpack_string(&bufp, &remain, f->val);
534 entry->rule.buflen += f->val;
536 err = audit_make_tree(&entry->rule, str, f->op);
542 err = audit_to_inode(&entry->rule, f);
546 case AUDIT_FILTERKEY:
547 if (entry->rule.filterkey || f->val > AUDIT_MAX_KEY_LEN)
549 str = audit_unpack_string(&bufp, &remain, f->val);
552 entry->rule.buflen += f->val;
553 entry->rule.filterkey = str;
558 if (entry->rule.inode_f && entry->rule.inode_f->op == Audit_not_equal)
559 entry->rule.inode_f = NULL;
565 if (entry->rule.watch)
566 audit_put_watch(entry->rule.watch); /* matches initial get */
567 if (entry->rule.tree)
568 audit_put_tree(entry->rule.tree); /* that's the temporary one */
569 audit_free_rule(entry);
573 /* Pack a filter field's string representation into data block. */
574 static inline size_t audit_pack_string(void **bufp, const char *str)
576 size_t len = strlen(str);
578 memcpy(*bufp, str, len);
584 /* Translate kernel rule respresentation to struct audit_rule_data. */
585 static struct audit_rule_data *audit_krule_to_data(struct audit_krule *krule)
587 struct audit_rule_data *data;
591 data = kmalloc(sizeof(*data) + krule->buflen, GFP_KERNEL);
594 memset(data, 0, sizeof(*data));
596 data->flags = krule->flags | krule->listnr;
597 data->action = krule->action;
598 data->field_count = krule->field_count;
600 for (i = 0; i < data->field_count; i++) {
601 struct audit_field *f = &krule->fields[i];
603 data->fields[i] = f->type;
604 data->fieldflags[i] = audit_ops[f->op];
606 case AUDIT_SUBJ_USER:
607 case AUDIT_SUBJ_ROLE:
608 case AUDIT_SUBJ_TYPE:
614 case AUDIT_OBJ_LEV_LOW:
615 case AUDIT_OBJ_LEV_HIGH:
616 data->buflen += data->values[i] =
617 audit_pack_string(&bufp, f->lsm_str);
620 data->buflen += data->values[i] =
621 audit_pack_string(&bufp,
622 audit_watch_path(krule->watch));
625 data->buflen += data->values[i] =
626 audit_pack_string(&bufp,
627 audit_tree_path(krule->tree));
629 case AUDIT_FILTERKEY:
630 data->buflen += data->values[i] =
631 audit_pack_string(&bufp, krule->filterkey);
634 data->values[i] = f->val;
637 for (i = 0; i < AUDIT_BITMASK_SIZE; i++) data->mask[i] = krule->mask[i];
642 /* Compare two rules in kernel format. Considered success if rules
644 static int audit_compare_rule(struct audit_krule *a, struct audit_krule *b)
648 if (a->flags != b->flags ||
649 a->listnr != b->listnr ||
650 a->action != b->action ||
651 a->field_count != b->field_count)
654 for (i = 0; i < a->field_count; i++) {
655 if (a->fields[i].type != b->fields[i].type ||
656 a->fields[i].op != b->fields[i].op)
659 switch(a->fields[i].type) {
660 case AUDIT_SUBJ_USER:
661 case AUDIT_SUBJ_ROLE:
662 case AUDIT_SUBJ_TYPE:
668 case AUDIT_OBJ_LEV_LOW:
669 case AUDIT_OBJ_LEV_HIGH:
670 if (strcmp(a->fields[i].lsm_str, b->fields[i].lsm_str))
674 if (strcmp(audit_watch_path(a->watch),
675 audit_watch_path(b->watch)))
679 if (strcmp(audit_tree_path(a->tree),
680 audit_tree_path(b->tree)))
683 case AUDIT_FILTERKEY:
684 /* both filterkeys exist based on above type compare */
685 if (strcmp(a->filterkey, b->filterkey))
694 if (!uid_eq(a->fields[i].uid, b->fields[i].uid))
702 if (!gid_eq(a->fields[i].gid, b->fields[i].gid))
706 if (a->fields[i].val != b->fields[i].val)
711 for (i = 0; i < AUDIT_BITMASK_SIZE; i++)
712 if (a->mask[i] != b->mask[i])
718 /* Duplicate LSM field information. The lsm_rule is opaque, so must be
720 static inline int audit_dupe_lsm_field(struct audit_field *df,
721 struct audit_field *sf)
726 /* our own copy of lsm_str */
727 lsm_str = kstrdup(sf->lsm_str, GFP_KERNEL);
728 if (unlikely(!lsm_str))
730 df->lsm_str = lsm_str;
732 /* our own (refreshed) copy of lsm_rule */
733 ret = security_audit_rule_init(df->type, df->op, df->lsm_str,
734 (void **)&df->lsm_rule);
735 /* Keep currently invalid fields around in case they
736 * become valid after a policy reload. */
737 if (ret == -EINVAL) {
738 pr_warn("audit rule for LSM \'%s\' is invalid\n",
746 /* Duplicate an audit rule. This will be a deep copy with the exception
747 * of the watch - that pointer is carried over. The LSM specific fields
748 * will be updated in the copy. The point is to be able to replace the old
749 * rule with the new rule in the filterlist, then free the old rule.
750 * The rlist element is undefined; list manipulations are handled apart from
751 * the initial copy. */
752 struct audit_entry *audit_dupe_rule(struct audit_krule *old)
754 u32 fcount = old->field_count;
755 struct audit_entry *entry;
756 struct audit_krule *new;
760 entry = audit_init_entry(fcount);
761 if (unlikely(!entry))
762 return ERR_PTR(-ENOMEM);
765 new->vers_ops = old->vers_ops;
766 new->flags = old->flags;
767 new->listnr = old->listnr;
768 new->action = old->action;
769 for (i = 0; i < AUDIT_BITMASK_SIZE; i++)
770 new->mask[i] = old->mask[i];
771 new->prio = old->prio;
772 new->buflen = old->buflen;
773 new->inode_f = old->inode_f;
774 new->field_count = old->field_count;
777 * note that we are OK with not refcounting here; audit_match_tree()
778 * never dereferences tree and we can't get false positives there
779 * since we'd have to have rule gone from the list *and* removed
780 * before the chunks found by lookup had been allocated, i.e. before
781 * the beginning of list scan.
783 new->tree = old->tree;
784 memcpy(new->fields, old->fields, sizeof(struct audit_field) * fcount);
786 /* deep copy this information, updating the lsm_rule fields, because
787 * the originals will all be freed when the old rule is freed. */
788 for (i = 0; i < fcount; i++) {
789 switch (new->fields[i].type) {
790 case AUDIT_SUBJ_USER:
791 case AUDIT_SUBJ_ROLE:
792 case AUDIT_SUBJ_TYPE:
798 case AUDIT_OBJ_LEV_LOW:
799 case AUDIT_OBJ_LEV_HIGH:
800 err = audit_dupe_lsm_field(&new->fields[i],
803 case AUDIT_FILTERKEY:
804 fk = kstrdup(old->filterkey, GFP_KERNEL);
811 audit_free_rule(entry);
817 audit_get_watch(old->watch);
818 new->watch = old->watch;
824 /* Find an existing audit rule.
825 * Caller must hold audit_filter_mutex to prevent stale rule data. */
826 static struct audit_entry *audit_find_rule(struct audit_entry *entry,
827 struct list_head **p)
829 struct audit_entry *e, *found = NULL;
830 struct list_head *list;
833 if (entry->rule.inode_f) {
834 h = audit_hash_ino(entry->rule.inode_f->val);
835 *p = list = &audit_inode_hash[h];
836 } else if (entry->rule.watch) {
837 /* we don't know the inode number, so must walk entire hash */
838 for (h = 0; h < AUDIT_INODE_BUCKETS; h++) {
839 list = &audit_inode_hash[h];
840 list_for_each_entry(e, list, list)
841 if (!audit_compare_rule(&entry->rule, &e->rule)) {
848 *p = list = &audit_filter_list[entry->rule.listnr];
851 list_for_each_entry(e, list, list)
852 if (!audit_compare_rule(&entry->rule, &e->rule)) {
861 static u64 prio_low = ~0ULL/2;
862 static u64 prio_high = ~0ULL/2 - 1;
864 /* Add rule to given filterlist if not a duplicate. */
865 static inline int audit_add_rule(struct audit_entry *entry)
867 struct audit_entry *e;
868 struct audit_watch *watch = entry->rule.watch;
869 struct audit_tree *tree = entry->rule.tree;
870 struct list_head *list;
872 #ifdef CONFIG_AUDITSYSCALL
875 /* If either of these, don't count towards total */
876 if (entry->rule.listnr == AUDIT_FILTER_USER ||
877 entry->rule.listnr == AUDIT_FILTER_TYPE)
881 mutex_lock(&audit_filter_mutex);
882 e = audit_find_rule(entry, &list);
884 mutex_unlock(&audit_filter_mutex);
886 /* normally audit_add_tree_rule() will free it on failure */
888 audit_put_tree(tree);
893 /* audit_filter_mutex is dropped and re-taken during this call */
894 err = audit_add_watch(&entry->rule, &list);
896 mutex_unlock(&audit_filter_mutex);
898 * normally audit_add_tree_rule() will free it
902 audit_put_tree(tree);
907 err = audit_add_tree_rule(&entry->rule);
909 mutex_unlock(&audit_filter_mutex);
914 entry->rule.prio = ~0ULL;
915 if (entry->rule.listnr == AUDIT_FILTER_EXIT) {
916 if (entry->rule.flags & AUDIT_FILTER_PREPEND)
917 entry->rule.prio = ++prio_high;
919 entry->rule.prio = --prio_low;
922 if (entry->rule.flags & AUDIT_FILTER_PREPEND) {
923 list_add(&entry->rule.list,
924 &audit_rules_list[entry->rule.listnr]);
925 list_add_rcu(&entry->list, list);
926 entry->rule.flags &= ~AUDIT_FILTER_PREPEND;
928 list_add_tail(&entry->rule.list,
929 &audit_rules_list[entry->rule.listnr]);
930 list_add_tail_rcu(&entry->list, list);
932 #ifdef CONFIG_AUDITSYSCALL
936 if (!audit_match_signal(entry))
939 mutex_unlock(&audit_filter_mutex);
945 audit_put_watch(watch); /* tmp watch, matches initial get */
949 /* Remove an existing rule from filterlist. */
950 static inline int audit_del_rule(struct audit_entry *entry)
952 struct audit_entry *e;
953 struct audit_watch *watch = entry->rule.watch;
954 struct audit_tree *tree = entry->rule.tree;
955 struct list_head *list;
957 #ifdef CONFIG_AUDITSYSCALL
960 /* If either of these, don't count towards total */
961 if (entry->rule.listnr == AUDIT_FILTER_USER ||
962 entry->rule.listnr == AUDIT_FILTER_TYPE)
966 mutex_lock(&audit_filter_mutex);
967 e = audit_find_rule(entry, &list);
969 mutex_unlock(&audit_filter_mutex);
975 audit_remove_watch_rule(&e->rule);
978 audit_remove_tree_rule(&e->rule);
980 list_del_rcu(&e->list);
981 list_del(&e->rule.list);
982 call_rcu(&e->rcu, audit_free_rule_rcu);
984 #ifdef CONFIG_AUDITSYSCALL
988 if (!audit_match_signal(entry))
991 mutex_unlock(&audit_filter_mutex);
995 audit_put_watch(watch); /* match initial get */
997 audit_put_tree(tree); /* that's the temporary one */
1002 /* List rules using struct audit_rule_data. */
1003 static void audit_list_rules(__u32 portid, int seq, struct sk_buff_head *q)
1005 struct sk_buff *skb;
1006 struct audit_krule *r;
1009 /* This is a blocking read, so use audit_filter_mutex instead of rcu
1010 * iterator to sync with list writers. */
1011 for (i=0; i<AUDIT_NR_FILTERS; i++) {
1012 list_for_each_entry(r, &audit_rules_list[i], list) {
1013 struct audit_rule_data *data;
1015 data = audit_krule_to_data(r);
1016 if (unlikely(!data))
1018 skb = audit_make_reply(portid, seq, AUDIT_LIST_RULES,
1020 sizeof(*data) + data->buflen);
1022 skb_queue_tail(q, skb);
1026 skb = audit_make_reply(portid, seq, AUDIT_LIST_RULES, 1, 1, NULL, 0);
1028 skb_queue_tail(q, skb);
1031 /* Log rule additions and removals */
1032 static void audit_log_rule_change(char *action, struct audit_krule *rule, int res)
1034 struct audit_buffer *ab;
1035 uid_t loginuid = from_kuid(&init_user_ns, audit_get_loginuid(current));
1036 unsigned int sessionid = audit_get_sessionid(current);
1041 ab = audit_log_start(NULL, GFP_KERNEL, AUDIT_CONFIG_CHANGE);
1044 audit_log_format(ab, "auid=%u ses=%u" ,loginuid, sessionid);
1045 audit_log_task_context(ab);
1046 audit_log_format(ab, " op=");
1047 audit_log_string(ab, action);
1048 audit_log_key(ab, rule->filterkey);
1049 audit_log_format(ab, " list=%d res=%d", rule->listnr, res);
1054 * audit_rule_change - apply all rules to the specified message type
1055 * @type: audit message type
1056 * @portid: target port id for netlink audit messages
1057 * @seq: netlink audit message sequence (serial) number
1058 * @data: payload data
1059 * @datasz: size of payload data
1061 int audit_rule_change(int type, __u32 portid, int seq, void *data,
1065 struct audit_entry *entry;
1068 case AUDIT_ADD_RULE:
1069 entry = audit_data_to_entry(data, datasz);
1071 return PTR_ERR(entry);
1073 err = audit_add_rule(entry);
1074 audit_log_rule_change("add_rule", &entry->rule, !err);
1076 audit_free_rule(entry);
1078 case AUDIT_DEL_RULE:
1079 entry = audit_data_to_entry(data, datasz);
1081 return PTR_ERR(entry);
1083 err = audit_del_rule(entry);
1084 audit_log_rule_change("remove_rule", &entry->rule, !err);
1085 audit_free_rule(entry);
1095 * audit_list_rules_send - list the audit rules
1096 * @request_skb: skb of request we are replying to (used to target the reply)
1097 * @seq: netlink audit message sequence (serial) number
1099 int audit_list_rules_send(struct sk_buff *request_skb, int seq)
1101 u32 portid = NETLINK_CB(request_skb).portid;
1102 struct net *net = sock_net(NETLINK_CB(request_skb).sk);
1103 struct task_struct *tsk;
1104 struct audit_netlink_list *dest;
1107 /* We can't just spew out the rules here because we might fill
1108 * the available socket buffer space and deadlock waiting for
1109 * auditctl to read from it... which isn't ever going to
1110 * happen if we're actually running in the context of auditctl
1111 * trying to _send_ the stuff */
1113 dest = kmalloc(sizeof(struct audit_netlink_list), GFP_KERNEL);
1116 dest->net = get_net(net);
1117 dest->portid = portid;
1118 skb_queue_head_init(&dest->q);
1120 mutex_lock(&audit_filter_mutex);
1121 audit_list_rules(portid, seq, &dest->q);
1122 mutex_unlock(&audit_filter_mutex);
1124 tsk = kthread_run(audit_send_list, dest, "audit_send_list");
1126 skb_queue_purge(&dest->q);
1134 int audit_comparator(u32 left, u32 op, u32 right)
1138 return (left == right);
1139 case Audit_not_equal:
1140 return (left != right);
1142 return (left < right);
1144 return (left <= right);
1146 return (left > right);
1148 return (left >= right);
1150 return (left & right);
1152 return ((left & right) == right);
1159 int audit_uid_comparator(kuid_t left, u32 op, kuid_t right)
1163 return uid_eq(left, right);
1164 case Audit_not_equal:
1165 return !uid_eq(left, right);
1167 return uid_lt(left, right);
1169 return uid_lte(left, right);
1171 return uid_gt(left, right);
1173 return uid_gte(left, right);
1182 int audit_gid_comparator(kgid_t left, u32 op, kgid_t right)
1186 return gid_eq(left, right);
1187 case Audit_not_equal:
1188 return !gid_eq(left, right);
1190 return gid_lt(left, right);
1192 return gid_lte(left, right);
1194 return gid_gt(left, right);
1196 return gid_gte(left, right);
1206 * parent_len - find the length of the parent portion of a pathname
1207 * @path: pathname of which to determine length
1209 int parent_len(const char *path)
1214 plen = strlen(path);
1219 /* disregard trailing slashes */
1220 p = path + plen - 1;
1221 while ((*p == '/') && (p > path))
1224 /* walk backward until we find the next slash or hit beginning */
1225 while ((*p != '/') && (p > path))
1228 /* did we find a slash? Then increment to include it in path */
1236 * audit_compare_dname_path - compare given dentry name with last component in
1237 * given path. Return of 0 indicates a match.
1238 * @dname: dentry name that we're comparing
1239 * @path: full pathname that we're comparing
1240 * @parentlen: length of the parent if known. Passing in AUDIT_NAME_FULL
1241 * here indicates that we must compute this value.
1243 int audit_compare_dname_path(const char *dname, const char *path, int parentlen)
1248 dlen = strlen(dname);
1249 pathlen = strlen(path);
1253 parentlen = parentlen == AUDIT_NAME_FULL ? parent_len(path) : parentlen;
1254 if (pathlen - parentlen != dlen)
1257 p = path + parentlen;
1259 return strncmp(p, dname, dlen);
1262 static int audit_filter_user_rules(struct audit_krule *rule, int type,
1263 enum audit_state *state)
1267 for (i = 0; i < rule->field_count; i++) {
1268 struct audit_field *f = &rule->fields[i];
1275 pid = task_pid_nr(current);
1276 result = audit_comparator(pid, f->op, f->val);
1279 result = audit_uid_comparator(current_uid(), f->op, f->uid);
1282 result = audit_gid_comparator(current_gid(), f->op, f->gid);
1284 case AUDIT_LOGINUID:
1285 result = audit_uid_comparator(audit_get_loginuid(current),
1288 case AUDIT_LOGINUID_SET:
1289 result = audit_comparator(audit_loginuid_set(current),
1293 result = audit_comparator(type, f->op, f->val);
1295 case AUDIT_SUBJ_USER:
1296 case AUDIT_SUBJ_ROLE:
1297 case AUDIT_SUBJ_TYPE:
1298 case AUDIT_SUBJ_SEN:
1299 case AUDIT_SUBJ_CLR:
1301 security_task_getsecid(current, &sid);
1302 result = security_audit_rule_match(sid,
1314 switch (rule->action) {
1315 case AUDIT_NEVER: *state = AUDIT_DISABLED; break;
1316 case AUDIT_ALWAYS: *state = AUDIT_RECORD_CONTEXT; break;
1321 int audit_filter_user(int type)
1323 enum audit_state state = AUDIT_DISABLED;
1324 struct audit_entry *e;
1327 ret = 1; /* Audit by default */
1330 list_for_each_entry_rcu(e, &audit_filter_list[AUDIT_FILTER_USER], list) {
1331 rc = audit_filter_user_rules(&e->rule, type, &state);
1333 if (rc > 0 && state == AUDIT_DISABLED)
1343 int audit_filter_type(int type)
1345 struct audit_entry *e;
1349 if (list_empty(&audit_filter_list[AUDIT_FILTER_TYPE]))
1350 goto unlock_and_return;
1352 list_for_each_entry_rcu(e, &audit_filter_list[AUDIT_FILTER_TYPE],
1355 for (i = 0; i < e->rule.field_count; i++) {
1356 struct audit_field *f = &e->rule.fields[i];
1357 if (f->type == AUDIT_MSGTYPE) {
1358 result = audit_comparator(type, f->op, f->val);
1364 goto unlock_and_return;
1371 static int update_lsm_rule(struct audit_krule *r)
1373 struct audit_entry *entry = container_of(r, struct audit_entry, rule);
1374 struct audit_entry *nentry;
1377 if (!security_audit_rule_known(r))
1380 nentry = audit_dupe_rule(r);
1381 if (IS_ERR(nentry)) {
1382 /* save the first error encountered for the
1384 err = PTR_ERR(nentry);
1385 audit_panic("error updating LSM filters");
1387 list_del(&r->rlist);
1388 list_del_rcu(&entry->list);
1391 if (r->watch || r->tree)
1392 list_replace_init(&r->rlist, &nentry->rule.rlist);
1393 list_replace_rcu(&entry->list, &nentry->list);
1394 list_replace(&r->list, &nentry->rule.list);
1396 call_rcu(&entry->rcu, audit_free_rule_rcu);
1401 /* This function will re-initialize the lsm_rule field of all applicable rules.
1402 * It will traverse the filter lists serarching for rules that contain LSM
1403 * specific filter fields. When such a rule is found, it is copied, the
1404 * LSM field is re-initialized, and the old rule is replaced with the
1406 int audit_update_lsm_rules(void)
1408 struct audit_krule *r, *n;
1411 /* audit_filter_mutex synchronizes the writers */
1412 mutex_lock(&audit_filter_mutex);
1414 for (i = 0; i < AUDIT_NR_FILTERS; i++) {
1415 list_for_each_entry_safe(r, n, &audit_rules_list[i], list) {
1416 int res = update_lsm_rule(r);
1421 mutex_unlock(&audit_filter_mutex);