Lines Matching refs:n
153 unsigned n; in audit_match_perm() local
157 n = ctx->major; in audit_match_perm()
159 switch (audit_classify_syscall(ctx->arch, n)) { in audit_match_perm()
162 audit_match_class(AUDIT_CLASS_WRITE, n)) in audit_match_perm()
165 audit_match_class(AUDIT_CLASS_READ, n)) in audit_match_perm()
168 audit_match_class(AUDIT_CLASS_CHATTR, n)) in audit_match_perm()
173 audit_match_class(AUDIT_CLASS_WRITE_32, n)) in audit_match_perm()
176 audit_match_class(AUDIT_CLASS_READ_32, n)) in audit_match_perm()
179 audit_match_class(AUDIT_CLASS_CHATTR_32, n)) in audit_match_perm()
199 struct audit_names *n; in audit_match_filetype() local
205 list_for_each_entry(n, &ctx->names_list, list) { in audit_match_filetype()
206 if ((n->ino != AUDIT_INO_UNSET) && in audit_match_filetype()
207 ((n->mode & S_IFMT) == mode)) in audit_match_filetype()
275 int n; in unroll_tree_refs() local
285 n = count; in unroll_tree_refs()
286 for (q = p; q != ctx->trees; q = q->next, n = 31) { in unroll_tree_refs()
287 while (n--) { in unroll_tree_refs()
288 audit_put_chunk(q->c[n]); in unroll_tree_refs()
289 q->c[n] = NULL; in unroll_tree_refs()
292 while (n-- > ctx->tree_count) { in unroll_tree_refs()
293 audit_put_chunk(q->c[n]); in unroll_tree_refs()
294 q->c[n] = NULL; in unroll_tree_refs()
313 int n; in match_tree_refs() local
319 for (n = 0; n < 31; n++) in match_tree_refs()
320 if (audit_tree_match(p->c[n], tree)) in match_tree_refs()
325 for (n = ctx->tree_count; n < 31; n++) in match_tree_refs()
326 if (audit_tree_match(p->c[n], tree)) in match_tree_refs()
337 struct audit_names *n; in audit_compare_uid() local
347 list_for_each_entry(n, &ctx->names_list, list) { in audit_compare_uid()
348 rc = audit_uid_comparator(uid, f->op, n->uid); in audit_compare_uid()
361 struct audit_names *n; in audit_compare_gid() local
371 list_for_each_entry(n, &ctx->names_list, list) { in audit_compare_gid()
372 rc = audit_gid_comparator(gid, f->op, n->gid); in audit_compare_gid()
483 struct audit_names *n; in audit_filter_rules() local
572 list_for_each_entry(n, &ctx->names_list, list) { in audit_filter_rules()
573 if (audit_comparator(MAJOR(n->dev), f->op, f->val) || in audit_filter_rules()
574 audit_comparator(MAJOR(n->rdev), f->op, f->val)) { in audit_filter_rules()
587 list_for_each_entry(n, &ctx->names_list, list) { in audit_filter_rules()
588 if (audit_comparator(MINOR(n->dev), f->op, f->val) || in audit_filter_rules()
589 audit_comparator(MINOR(n->rdev), f->op, f->val)) { in audit_filter_rules()
600 list_for_each_entry(n, &ctx->names_list, list) { in audit_filter_rules()
601 if (audit_comparator(n->ino, f->op, f->val)) { in audit_filter_rules()
612 list_for_each_entry(n, &ctx->names_list, list) { in audit_filter_rules()
613 if (audit_uid_comparator(n->uid, f->op, f->uid)) { in audit_filter_rules()
624 list_for_each_entry(n, &ctx->names_list, list) { in audit_filter_rules()
625 if (audit_gid_comparator(n->gid, f->op, f->gid)) { in audit_filter_rules()
707 list_for_each_entry(n, &ctx->names_list, list) { in audit_filter_rules()
709 &n->oprop, in audit_filter_rules()
886 struct audit_names *n, in audit_filter_inode_name() argument
889 int h = audit_hash_ino((u32)n->ino); in audit_filter_inode_name()
892 return __audit_filter_op(tsk, ctx, list, n, ctx->major); in audit_filter_inode_name()
902 struct audit_names *n; in audit_filter_inodes() local
909 list_for_each_entry(n, &ctx->names_list, list) { in audit_filter_inodes()
910 if (audit_filter_inode_name(tsk, n, ctx)) in audit_filter_inodes()
932 struct audit_names *n, *next; in audit_free_names() local
934 list_for_each_entry_safe(n, next, &context->names_list, list) { in audit_free_names()
935 list_del(&n->list); in audit_free_names()
936 if (n->name) in audit_free_names()
937 putname(n->name); in audit_free_names()
938 if (n->should_free) in audit_free_names()
939 kfree(n); in audit_free_names()
1512 static void audit_log_name(struct audit_context *context, struct audit_names *n, in audit_log_name() argument
1525 else if (n->name) { in audit_log_name()
1526 switch (n->name_len) { in audit_log_name()
1530 audit_log_untrustedstring(ab, n->name->name); in audit_log_name()
1544 audit_log_n_untrustedstring(ab, n->name->name, in audit_log_name()
1545 n->name_len); in audit_log_name()
1550 if (n->ino != AUDIT_INO_UNSET) in audit_log_name()
1552 n->ino, in audit_log_name()
1553 MAJOR(n->dev), in audit_log_name()
1554 MINOR(n->dev), in audit_log_name()
1555 n->mode, in audit_log_name()
1556 from_kuid(&init_user_ns, n->uid), in audit_log_name()
1557 from_kgid(&init_user_ns, n->gid), in audit_log_name()
1558 MAJOR(n->rdev), in audit_log_name()
1559 MINOR(n->rdev)); in audit_log_name()
1560 if (lsmprop_is_set(&n->oprop)) { in audit_log_name()
1563 if (security_lsmprop_to_secctx(&n->oprop, &ctx) < 0) { in audit_log_name()
1573 switch (n->type) { in audit_log_name()
1591 audit_log_fcaps(ab, n); in audit_log_name()
1680 struct audit_names *n; in audit_log_exit() local
1800 list_for_each_entry(n, &context->names_list, list) { in audit_log_exit()
1801 if (n->hidden) in audit_log_exit()
1803 audit_log_name(context, n, NULL, i++, &call_panic); in audit_log_exit()
2205 struct audit_names *n; in __audit_reusename() local
2207 list_for_each_entry(n, &context->names_list, list) { in __audit_reusename()
2208 if (!n->name) in __audit_reusename()
2210 if (n->name->uptr == uptr) in __audit_reusename()
2211 return refname(n->name); in __audit_reusename()
2226 struct audit_names *n; in __audit_getname() local
2231 n = audit_alloc_name(context, AUDIT_TYPE_UNKNOWN); in __audit_getname()
2232 if (!n) in __audit_getname()
2235 n->name = name; in __audit_getname()
2236 n->name_len = AUDIT_NAME_FULL; in __audit_getname()
2237 name->aname = n; in __audit_getname()
2294 struct audit_names *n; in __audit_inode() local
2326 n = name->aname; in __audit_inode()
2327 if (n) { in __audit_inode()
2329 if (n->type == AUDIT_TYPE_PARENT || in __audit_inode()
2330 n->type == AUDIT_TYPE_UNKNOWN) in __audit_inode()
2333 if (n->type != AUDIT_TYPE_PARENT) in __audit_inode()
2338 list_for_each_entry_reverse(n, &context->names_list, list) { in __audit_inode()
2339 if (n->ino) { in __audit_inode()
2341 if (n->ino != inode->i_ino || in __audit_inode()
2342 n->dev != inode->i_sb->s_dev) in __audit_inode()
2344 } else if (n->name) { in __audit_inode()
2346 if (strcmp(n->name->name, name->name)) in __audit_inode()
2354 if (n->type == AUDIT_TYPE_PARENT || in __audit_inode()
2355 n->type == AUDIT_TYPE_UNKNOWN) in __audit_inode()
2358 if (n->type != AUDIT_TYPE_PARENT) in __audit_inode()
2365 n = audit_alloc_name(context, AUDIT_TYPE_UNKNOWN); in __audit_inode()
2366 if (!n) in __audit_inode()
2369 n->name = name; in __audit_inode()
2375 n->name_len = n->name ? parent_len(n->name->name) : AUDIT_NAME_FULL; in __audit_inode()
2376 n->type = AUDIT_TYPE_PARENT; in __audit_inode()
2378 n->hidden = true; in __audit_inode()
2380 n->name_len = AUDIT_NAME_FULL; in __audit_inode()
2381 n->type = AUDIT_TYPE_NORMAL; in __audit_inode()
2384 audit_copy_inode(n, dentry, inode, flags & AUDIT_INODE_NOEVAL); in __audit_inode()
2413 struct audit_names *n, *found_parent = NULL, *found_child = NULL; in __audit_inode_child() local
2441 list_for_each_entry(n, &context->names_list, list) { in __audit_inode_child()
2442 if (!n->name || in __audit_inode_child()
2443 (n->type != AUDIT_TYPE_PARENT && in __audit_inode_child()
2444 n->type != AUDIT_TYPE_UNKNOWN)) in __audit_inode_child()
2447 if (n->ino == parent->i_ino && n->dev == parent->i_sb->s_dev && in __audit_inode_child()
2449 n->name->name, n->name_len)) { in __audit_inode_child()
2450 if (n->type == AUDIT_TYPE_UNKNOWN) in __audit_inode_child()
2451 n->type = AUDIT_TYPE_PARENT; in __audit_inode_child()
2452 found_parent = n; in __audit_inode_child()
2460 list_for_each_entry(n, &context->names_list, list) { in __audit_inode_child()
2462 if (!n->name || in __audit_inode_child()
2463 (n->type != type && n->type != AUDIT_TYPE_UNKNOWN)) in __audit_inode_child()
2466 if (!strcmp(dname->name, n->name->name) || in __audit_inode_child()
2467 !audit_compare_dname_path(dname, n->name->name, in __audit_inode_child()
2471 if (n->type == AUDIT_TYPE_UNKNOWN) in __audit_inode_child()
2472 n->type = type; in __audit_inode_child()
2473 found_child = n; in __audit_inode_child()
2480 n = audit_alloc_name(context, AUDIT_TYPE_PARENT); in __audit_inode_child()
2481 if (!n) in __audit_inode_child()
2483 audit_copy_inode(n, NULL, parent, 0); in __audit_inode_child()