254 	int n = ACC_MODE(flags);  in open_arg()  local
256 		n |= AUDIT_PERM_WRITE;  in open_arg()
257 	return n & mask;  in open_arg()
262 	unsigned n;  in audit_match_perm()  local
265 	n = ctx->major;  in audit_match_perm()
267 	switch (audit_classify_syscall(ctx->arch, n)) {  in audit_match_perm()
270 		     audit_match_class(AUDIT_CLASS_WRITE, n))  in audit_match_perm()
273 		     audit_match_class(AUDIT_CLASS_READ, n))  in audit_match_perm()
276 		     audit_match_class(AUDIT_CLASS_CHATTR, n))  in audit_match_perm()
281 		     audit_match_class(AUDIT_CLASS_WRITE_32, n))  in audit_match_perm()
284 		     audit_match_class(AUDIT_CLASS_READ_32, n))  in audit_match_perm()
287 		     audit_match_class(AUDIT_CLASS_CHATTR_32, n))  in audit_match_perm()
374 	int n;  in unroll_tree_refs()  local
383 	n = count;  in unroll_tree_refs()
384 	for (q = p; q != ctx->trees; q = q->next, n = 31) {  in unroll_tree_refs()
385 		while (n--) {  in unroll_tree_refs()
386 			audit_put_chunk(q->c[n]);  in unroll_tree_refs()
387 			q->c[n] = NULL;  in unroll_tree_refs()
390 	while (n-- > ctx->tree_count) {  in unroll_tree_refs()
391 		audit_put_chunk(q->c[n]);  in unroll_tree_refs()
392 		q->c[n] = NULL;  in unroll_tree_refs()
412 	int n;  in match_tree_refs()  local
417 		for (n = 0; n < 31; n++)  in match_tree_refs()
418 			if (audit_tree_match(p->c[n], tree))  in match_tree_refs()
423 		for (n = ctx->tree_count; n < 31; n++)  in match_tree_refs()
424 			if (audit_tree_match(p->c[n], tree))  in match_tree_refs()
725 		struct audit_names *n = &ctx->names[i];  in audit_filter_inodes()  local
726 		int h = audit_hash_ino((u32)n->ino);  in audit_filter_inodes()
734 			    audit_filter_rules(tsk, &e->rule, ctx, n, &state)) {  in audit_filter_inodes()
1463 		struct audit_names *n = &context->names[i];  in audit_log_exit()  local
1471 		if (n->name) {  in audit_log_exit()
1472 			switch(n->name_len) {  in audit_log_exit()
1476 				audit_log_untrustedstring(ab, n->name);  in audit_log_exit()
1486 				audit_log_n_untrustedstring(ab, n->name,  in audit_log_exit()
1487 							    n->name_len);  in audit_log_exit()
1492 		if (n->ino != (unsigned long)-1) {  in audit_log_exit()
1496 					 n->ino,  in audit_log_exit()
1497 					 MAJOR(n->dev),  in audit_log_exit()
1498 					 MINOR(n->dev),  in audit_log_exit()
1499 					 n->mode,  in audit_log_exit()
1500 					 n->uid,  in audit_log_exit()
1501 					 n->gid,  in audit_log_exit()
1502 					 MAJOR(n->rdev),  in audit_log_exit()
1503 					 MINOR(n->rdev));  in audit_log_exit()
1505 		if (n->osid != 0) {  in audit_log_exit()
1509 				n->osid, &ctx, &len)) {  in audit_log_exit()
1510 				audit_log_format(ab, " osid=%u", n->osid);  in audit_log_exit()
1518 		audit_log_fcaps(ab, n);  in audit_log_exit()
2021 		struct audit_names *n = &context->names[idx];  in __audit_inode_child()  local
2023 		if (!n->name)  in __audit_inode_child()
2026 		if (n->ino == parent->i_ino &&  in __audit_inode_child()
2027 		    !audit_compare_dname_path(dname, n->name, &dirlen)) {  in __audit_inode_child()
2028 			n->name_len = dirlen; /* update parent data in place */  in __audit_inode_child()
2029 			found_parent = n->name;  in __audit_inode_child()
2036 		struct audit_names *n = &context->names[idx];  in __audit_inode_child()  local
2038 		if (!n->name)  in __audit_inode_child()
2042 		if (!strcmp(dname, n->name) ||  in __audit_inode_child()
2043 		     !audit_compare_dname_path(dname, n->name, &dirlen)) {  in __audit_inode_child()
2045 				audit_copy_inode(n, NULL, inode);  in __audit_inode_child()
2047 				n->ino = (unsigned long)-1;  in __audit_inode_child()
2048 			found_child = n->name;  in __audit_inode_child()