472 			      struct audit_krule *rule,  in audit_filter_rules()  argument
485 	for (i = 0; i < rule->field_count; i++) {  in audit_filter_rules()
486 		struct audit_field *f = &rule->fields[i];  in audit_filter_rules()
504 			result = audit_exe_compare(tsk, rule->exe);  in audit_filter_rules()
638 				result = audit_watch_compare(rule->watch,  in audit_filter_rules()
647 				result = match_tree_refs(ctx, rule->tree);  in audit_filter_rules()
750 		if (rule->prio <= ctx->prio)  in audit_filter_rules()
752 		if (rule->filterkey) {  in audit_filter_rules()
754 			ctx->filterkey = kstrdup(rule->filterkey, GFP_ATOMIC);  in audit_filter_rules()
756 		ctx->prio = rule->prio;  in audit_filter_rules()
758 	switch (rule->action) {  in audit_filter_rules()
780 		if (audit_filter_rules(tsk, &e->rule, NULL, NULL,  in audit_filter_task()
783 				*key = kstrdup(e->rule.filterkey, GFP_ATOMIC);  in audit_filter_task()
792 static int audit_in_mask(const struct audit_krule *rule, unsigned long val)  in audit_in_mask()  argument
805 	return rule->mask[word] & bit;  in audit_in_mask()
824 		if (audit_in_mask(&e->rule, ctx->major) &&  in audit_filter_syscall()
825 		    audit_filter_rules(tsk, &e->rule, ctx, NULL,  in audit_filter_syscall()
849 		if (audit_in_mask(&e->rule, ctx->major) &&  in audit_filter_inode_name()
850 		    audit_filter_rules(tsk, &e->rule, ctx, n, &state, false)) {  in audit_filter_inode_name()
2051 		for (i = 0; i < e->rule.field_count; i++) {  in __audit_inode()
2052 			struct audit_field *f = &e->rule.fields[i];  in __audit_inode()
2057 			    && e->rule.action == AUDIT_NEVER) {  in __audit_inode()
2169 		for (i = 0; i < e->rule.field_count; i++) {  in __audit_inode_child()
2170 			struct audit_field *f = &e->rule.fields[i];  in __audit_inode_child()
2175 			    && e->rule.action == AUDIT_NEVER) {  in __audit_inode_child()