Lines Matching refs:n
139 int n = ACC_MODE(flags); in open_arg() local
141 n |= AUDIT_PERM_WRITE; in open_arg()
142 return n & mask; in open_arg()
147 unsigned n; in audit_match_perm() local
150 n = ctx->major; in audit_match_perm()
152 switch (audit_classify_syscall(ctx->arch, n)) { in audit_match_perm()
155 audit_match_class(AUDIT_CLASS_WRITE, n)) in audit_match_perm()
158 audit_match_class(AUDIT_CLASS_READ, n)) in audit_match_perm()
161 audit_match_class(AUDIT_CLASS_CHATTR, n)) in audit_match_perm()
166 audit_match_class(AUDIT_CLASS_WRITE_32, n)) in audit_match_perm()
169 audit_match_class(AUDIT_CLASS_READ_32, n)) in audit_match_perm()
172 audit_match_class(AUDIT_CLASS_CHATTR_32, n)) in audit_match_perm()
190 struct audit_names *n; in audit_match_filetype() local
196 list_for_each_entry(n, &ctx->names_list, list) { in audit_match_filetype()
197 if ((n->ino != -1) && in audit_match_filetype()
198 ((n->mode & S_IFMT) == mode)) in audit_match_filetype()
267 int n; in unroll_tree_refs() local
276 n = count; in unroll_tree_refs()
277 for (q = p; q != ctx->trees; q = q->next, n = 31) { in unroll_tree_refs()
278 while (n--) { in unroll_tree_refs()
279 audit_put_chunk(q->c[n]); in unroll_tree_refs()
280 q->c[n] = NULL; in unroll_tree_refs()
283 while (n-- > ctx->tree_count) { in unroll_tree_refs()
284 audit_put_chunk(q->c[n]); in unroll_tree_refs()
285 q->c[n] = NULL; in unroll_tree_refs()
305 int n; in match_tree_refs() local
310 for (n = 0; n < 31; n++) in match_tree_refs()
311 if (audit_tree_match(p->c[n], tree)) in match_tree_refs()
316 for (n = ctx->tree_count; n < 31; n++) in match_tree_refs()
317 if (audit_tree_match(p->c[n], tree)) in match_tree_refs()
329 struct audit_names *n; in audit_compare_uid() local
339 list_for_each_entry(n, &ctx->names_list, list) { in audit_compare_uid()
340 rc = audit_uid_comparator(uid, f->op, n->uid); in audit_compare_uid()
353 struct audit_names *n; in audit_compare_gid() local
363 list_for_each_entry(n, &ctx->names_list, list) { in audit_compare_gid()
364 rc = audit_gid_comparator(gid, f->op, n->gid); in audit_compare_gid()
467 struct audit_names *n; in audit_filter_rules() local
545 list_for_each_entry(n, &ctx->names_list, list) { in audit_filter_rules()
546 if (audit_comparator(MAJOR(n->dev), f->op, f->val) || in audit_filter_rules()
547 audit_comparator(MAJOR(n->rdev), f->op, f->val)) { in audit_filter_rules()
560 list_for_each_entry(n, &ctx->names_list, list) { in audit_filter_rules()
561 if (audit_comparator(MINOR(n->dev), f->op, f->val) || in audit_filter_rules()
562 audit_comparator(MINOR(n->rdev), f->op, f->val)) { in audit_filter_rules()
573 list_for_each_entry(n, &ctx->names_list, list) { in audit_filter_rules()
574 if (audit_comparator(n->ino, f->op, f->val)) { in audit_filter_rules()
585 list_for_each_entry(n, &ctx->names_list, list) { in audit_filter_rules()
586 if (audit_uid_comparator(n->uid, f->op, f->uid)) { in audit_filter_rules()
597 list_for_each_entry(n, &ctx->names_list, list) { in audit_filter_rules()
598 if (audit_gid_comparator(n->gid, f->op, f->gid)) { in audit_filter_rules()
656 list_for_each_entry(n, &ctx->names_list, list) { in audit_filter_rules()
657 if (security_audit_rule_match(n->osid, f->type, in audit_filter_rules()
777 struct audit_names *n, in audit_filter_inode_name() argument
780 int h = audit_hash_ino((u32)n->ino); in audit_filter_inode_name()
793 audit_filter_rules(tsk, &e->rule, ctx, n, &state, false)) { in audit_filter_inode_name()
809 struct audit_names *n; in audit_filter_inodes() local
816 list_for_each_entry(n, &ctx->names_list, list) { in audit_filter_inodes()
817 if (audit_filter_inode_name(tsk, n, ctx)) in audit_filter_inodes()
862 struct audit_names *n, *next; in audit_free_names() local
875 list_for_each_entry(n, &context->names_list, list) { in audit_free_names()
877 n->name, n->name->name ?: "(null)"); in audit_free_names()
888 list_for_each_entry_safe(n, next, &context->names_list, list) { in audit_free_names()
889 list_del(&n->list); in audit_free_names()
890 if (n->name && n->name_put) in audit_free_names()
891 final_putname(n->name); in audit_free_names()
892 if (n->should_free) in audit_free_names()
893 kfree(n); in audit_free_names()
1288 struct audit_names *n; in audit_log_exit() local
1399 list_for_each_entry(n, &context->names_list, list) in audit_log_exit()
1400 audit_log_name(context, n, NULL, i++, &call_panic); in audit_log_exit()
1671 struct audit_names *n; in __audit_reusename() local
1673 list_for_each_entry(n, &context->names_list, list) { in __audit_reusename()
1674 if (!n->name) in __audit_reusename()
1676 if (n->name->uptr == uptr) in __audit_reusename()
1677 return n->name; in __audit_reusename()
1692 struct audit_names *n; in __audit_getname() local
1708 n = audit_alloc_name(context, AUDIT_TYPE_UNKNOWN); in __audit_getname()
1709 if (!n) in __audit_getname()
1712 n->name = name; in __audit_getname()
1713 n->name_len = AUDIT_NAME_FULL; in __audit_getname()
1714 n->name_put = true; in __audit_getname()
1715 name->aname = n; in __audit_getname()
1738 struct audit_names *n; in audit_putname() local
1741 list_for_each_entry(n, &context->names_list, list) in audit_putname()
1743 n->name, n->name->name ?: "(null)"); in audit_putname()
1776 struct audit_names *n; in __audit_inode() local
1792 n = name->aname; in __audit_inode()
1793 if (n) { in __audit_inode()
1795 if (n->type == AUDIT_TYPE_PARENT || in __audit_inode()
1796 n->type == AUDIT_TYPE_UNKNOWN) in __audit_inode()
1799 if (n->type != AUDIT_TYPE_PARENT) in __audit_inode()
1804 list_for_each_entry_reverse(n, &context->names_list, list) { in __audit_inode()
1806 if (!n->name || n->name->name != name->name) in __audit_inode()
1811 if (n->type == AUDIT_TYPE_PARENT || in __audit_inode()
1812 n->type == AUDIT_TYPE_UNKNOWN) in __audit_inode()
1815 if (n->type != AUDIT_TYPE_PARENT) in __audit_inode()
1824 n = audit_alloc_name(context, AUDIT_TYPE_NORMAL); in __audit_inode()
1825 if (!n) in __audit_inode()
1829 n->name_len = n->name ? parent_len(n->name->name) : AUDIT_NAME_FULL; in __audit_inode()
1830 n->type = AUDIT_TYPE_PARENT; in __audit_inode()
1832 n->name_len = AUDIT_NAME_FULL; in __audit_inode()
1833 n->type = AUDIT_TYPE_NORMAL; in __audit_inode()
1836 audit_copy_inode(n, dentry, inode); in __audit_inode()
1860 struct audit_names *n, *found_parent = NULL, *found_child = NULL; in __audit_inode_child() local
1869 list_for_each_entry(n, &context->names_list, list) { in __audit_inode_child()
1870 if (!n->name || n->type != AUDIT_TYPE_PARENT) in __audit_inode_child()
1873 if (n->ino == parent->i_ino && in __audit_inode_child()
1874 !audit_compare_dname_path(dname, n->name->name, n->name_len)) { in __audit_inode_child()
1875 found_parent = n; in __audit_inode_child()
1881 list_for_each_entry(n, &context->names_list, list) { in __audit_inode_child()
1883 if (!n->name || n->type != type) in __audit_inode_child()
1887 if (found_parent && (n->name != found_parent->name)) in __audit_inode_child()
1890 if (!strcmp(dname, n->name->name) || in __audit_inode_child()
1891 !audit_compare_dname_path(dname, n->name->name, in __audit_inode_child()
1895 found_child = n; in __audit_inode_child()
1902 n = audit_alloc_name(context, AUDIT_TYPE_PARENT); in __audit_inode_child()
1903 if (!n) in __audit_inode_child()
1905 audit_copy_inode(n, NULL, parent); in __audit_inode_child()