1 // SPDX-License-Identifier: GPL-2.0-only
3 * AppArmor security module
5 * This file contains AppArmor /sys/kernel/security/apparmor interface functions
7 * Copyright (C) 1998-2008 Novell/SUSE
8 * Copyright 2009-2010 Canonical Ltd.
11 #include <linux/ctype.h>
12 #include <linux/security.h>
13 #include <linux/vmalloc.h>
14 #include <linux/init.h>
15 #include <linux/seq_file.h>
16 #include <linux/uaccess.h>
17 #include <linux/mount.h>
18 #include <linux/namei.h>
19 #include <linux/capability.h>
20 #include <linux/rcupdate.h>
22 #include <linux/fs_context.h>
23 #include <linux/poll.h>
24 #include <uapi/linux/major.h>
25 #include <uapi/linux/magic.h>
27 #include "include/apparmor.h"
28 #include "include/apparmorfs.h"
29 #include "include/audit.h"
30 #include "include/cred.h"
31 #include "include/crypto.h"
32 #include "include/ipc.h"
33 #include "include/label.h"
34 #include "include/policy.h"
35 #include "include/policy_ns.h"
36 #include "include/resource.h"
37 #include "include/policy_unpack.h"
40 * The apparmor filesystem interface used for policy load and introspection
41 * The interface is split into two main components based on their function
42 * a securityfs component:
43 * used for static files that are always available, and which allows
44 * userspace to specificy the location of the security filesystem.
46 * fns and data are prefixed with
49 * an apparmorfs component:
50 * used loaded policy content and introspection. It is not part of a
51 * regular mounted filesystem and is available only through the magic
52 * policy symlink in the root of the securityfs apparmor/ directory.
53 * Tasks queries will be magically redirected to the correct portion
54 * of the policy tree based on their confinement.
56 * fns and data are prefixed with
59 * The aa_fs_ prefix is used to indicate the fn is used by both the
60 * securityfs and apparmorfs filesystems.
69 * aa_mangle_name - mangle a profile name to std profile layout form
70 * @name: profile name to mangle (NOT NULL)
71 * @target: buffer to store mangled name, same length as @name (MAYBE NULL)
73 * Returns: length of mangled name
75 static int mangle_name(const char *name, char *target)
79 while (*name == '/' || *name == '.')
83 for (; *name; name++) {
86 else if (isspace(*name))
88 else if (isalnum(*name) || strchr("._-", *name))
95 for (; *name; name++) {
96 if (isalnum(*name) || isspace(*name) ||
97 strchr("/._-", *name))
109 * aafs - core fns and data for the policy tree
112 #define AAFS_NAME "apparmorfs"
113 static struct vfsmount *aafs_mnt;
114 static int aafs_count;
117 static int aafs_show_path(struct seq_file *seq, struct dentry *dentry)
119 seq_printf(seq, "%s:[%lu]", AAFS_NAME, d_inode(dentry)->i_ino);
123 static void aafs_free_inode(struct inode *inode)
125 if (S_ISLNK(inode->i_mode))
126 kfree(inode->i_link);
127 free_inode_nonrcu(inode);
130 static const struct super_operations aafs_super_ops = {
131 .statfs = simple_statfs,
132 .free_inode = aafs_free_inode,
133 .show_path = aafs_show_path,
136 static int apparmorfs_fill_super(struct super_block *sb, struct fs_context *fc)
138 static struct tree_descr files[] = { {""} };
141 error = simple_fill_super(sb, AAFS_MAGIC, files);
144 sb->s_op = &aafs_super_ops;
149 static int apparmorfs_get_tree(struct fs_context *fc)
151 return get_tree_single(fc, apparmorfs_fill_super);
154 static const struct fs_context_operations apparmorfs_context_ops = {
155 .get_tree = apparmorfs_get_tree,
158 static int apparmorfs_init_fs_context(struct fs_context *fc)
160 fc->ops = &apparmorfs_context_ops;
164 static struct file_system_type aafs_ops = {
165 .owner = THIS_MODULE,
167 .init_fs_context = apparmorfs_init_fs_context,
168 .kill_sb = kill_anon_super,
172 * __aafs_setup_d_inode - basic inode setup for apparmorfs
173 * @dir: parent directory for the dentry
174 * @dentry: dentry we are seting the inode up for
175 * @mode: permissions the file should have
176 * @data: data to store on inode.i_private, available in open()
177 * @link: if symlink, symlink target string
178 * @fops: struct file_operations that should be used
179 * @iops: struct of inode_operations that should be used
181 static int __aafs_setup_d_inode(struct inode *dir, struct dentry *dentry,
182 umode_t mode, void *data, char *link,
183 const struct file_operations *fops,
184 const struct inode_operations *iops)
186 struct inode *inode = new_inode(dir->i_sb);
194 inode->i_ino = get_next_ino();
195 inode->i_mode = mode;
196 inode->i_atime = inode->i_mtime = inode->i_ctime = current_time(inode);
197 inode->i_private = data;
199 inode->i_op = iops ? iops : &simple_dir_inode_operations;
200 inode->i_fop = &simple_dir_operations;
203 } else if (S_ISLNK(mode)) {
204 inode->i_op = iops ? iops : &simple_symlink_inode_operations;
205 inode->i_link = link;
209 d_instantiate(dentry, inode);
216 * aafs_create - create a dentry in the apparmorfs filesystem
218 * @name: name of dentry to create
219 * @mode: permissions the file should have
220 * @parent: parent directory for this dentry
221 * @data: data to store on inode.i_private, available in open()
222 * @link: if symlink, symlink target string
223 * @fops: struct file_operations that should be used for
224 * @iops: struct of inode_operations that should be used
226 * This is the basic "create a xxx" function for apparmorfs.
228 * Returns a pointer to a dentry if it succeeds, that must be free with
229 * aafs_remove(). Will return ERR_PTR on failure.
231 static struct dentry *aafs_create(const char *name, umode_t mode,
232 struct dentry *parent, void *data, void *link,
233 const struct file_operations *fops,
234 const struct inode_operations *iops)
236 struct dentry *dentry;
243 if (!(mode & S_IFMT))
244 mode = (mode & S_IALLUGO) | S_IFREG;
246 error = simple_pin_fs(&aafs_ops, &aafs_mnt, &aafs_count);
248 return ERR_PTR(error);
250 dir = d_inode(parent);
253 dentry = lookup_one_len(name, parent, strlen(name));
254 if (IS_ERR(dentry)) {
255 error = PTR_ERR(dentry);
259 if (d_really_is_positive(dentry)) {
264 error = __aafs_setup_d_inode(dir, dentry, mode, data, link, fops, iops);
276 simple_release_fs(&aafs_mnt, &aafs_count);
278 return ERR_PTR(error);
282 * aafs_create_file - create a file in the apparmorfs filesystem
284 * @name: name of dentry to create
285 * @mode: permissions the file should have
286 * @parent: parent directory for this dentry
287 * @data: data to store on inode.i_private, available in open()
288 * @fops: struct file_operations that should be used for
292 static struct dentry *aafs_create_file(const char *name, umode_t mode,
293 struct dentry *parent, void *data,
294 const struct file_operations *fops)
296 return aafs_create(name, mode, parent, data, NULL, fops, NULL);
300 * aafs_create_dir - create a directory in the apparmorfs filesystem
302 * @name: name of dentry to create
303 * @parent: parent directory for this dentry
307 static struct dentry *aafs_create_dir(const char *name, struct dentry *parent)
309 return aafs_create(name, S_IFDIR | 0755, parent, NULL, NULL, NULL,
314 * aafs_create_symlink - create a symlink in the apparmorfs filesystem
315 * @name: name of dentry to create
316 * @parent: parent directory for this dentry
317 * @target: if symlink, symlink target string
318 * @private: private data
319 * @iops: struct of inode_operations that should be used
321 * If @target parameter is %NULL, then the @iops parameter needs to be
322 * setup to handle .readlink and .get_link inode_operations.
324 static struct dentry *aafs_create_symlink(const char *name,
325 struct dentry *parent,
328 const struct inode_operations *iops)
335 return ERR_PTR(-ENOMEM);
337 dent = aafs_create(name, S_IFLNK | 0444, parent, private, link, NULL,
346 * aafs_remove - removes a file or directory from the apparmorfs filesystem
348 * @dentry: dentry of the file/directory/symlink to removed.
350 static void aafs_remove(struct dentry *dentry)
354 if (!dentry || IS_ERR(dentry))
357 dir = d_inode(dentry->d_parent);
359 if (simple_positive(dentry)) {
360 if (d_is_dir(dentry))
361 simple_rmdir(dir, dentry);
363 simple_unlink(dir, dentry);
368 simple_release_fs(&aafs_mnt, &aafs_count);
373 * aa_fs - policy load/replace/remove
377 * aa_simple_write_to_buffer - common routine for getting policy from user
378 * @userbuf: user buffer to copy data from (NOT NULL)
379 * @alloc_size: size of user buffer (REQUIRES: @alloc_size >= @copy_size)
380 * @copy_size: size of data to copy from user buffer
381 * @pos: position write is at in the file (NOT NULL)
383 * Returns: kernel buffer containing copy of user buffer data or an
384 * ERR_PTR on failure.
386 static struct aa_loaddata *aa_simple_write_to_buffer(const char __user *userbuf,
391 struct aa_loaddata *data;
393 AA_BUG(copy_size > alloc_size);
396 /* only writes from pos 0, that is complete writes */
397 return ERR_PTR(-ESPIPE);
399 /* freed by caller to simple_write_to_buffer */
400 data = aa_loaddata_alloc(alloc_size);
404 data->size = copy_size;
405 if (copy_from_user(data->data, userbuf, copy_size)) {
406 aa_put_loaddata(data);
407 return ERR_PTR(-EFAULT);
413 static ssize_t policy_update(u32 mask, const char __user *buf, size_t size,
414 loff_t *pos, struct aa_ns *ns)
416 struct aa_loaddata *data;
417 struct aa_label *label;
420 label = begin_current_label_crit_section();
422 /* high level check about policy management - fine grained in
425 error = aa_may_manage_policy(label, ns, mask);
429 data = aa_simple_write_to_buffer(buf, size, size, pos);
430 error = PTR_ERR(data);
432 error = aa_replace_profiles(ns, label, mask, data);
433 aa_put_loaddata(data);
436 end_current_label_crit_section(label);
441 /* .load file hook fn to load policy */
442 static ssize_t profile_load(struct file *f, const char __user *buf, size_t size,
445 struct aa_ns *ns = aa_get_ns(f->f_inode->i_private);
446 int error = policy_update(AA_MAY_LOAD_POLICY, buf, size, pos, ns);
453 static const struct file_operations aa_fs_profile_load = {
454 .write = profile_load,
455 .llseek = default_llseek,
458 /* .replace file hook fn to load and/or replace policy */
459 static ssize_t profile_replace(struct file *f, const char __user *buf,
460 size_t size, loff_t *pos)
462 struct aa_ns *ns = aa_get_ns(f->f_inode->i_private);
463 int error = policy_update(AA_MAY_LOAD_POLICY | AA_MAY_REPLACE_POLICY,
470 static const struct file_operations aa_fs_profile_replace = {
471 .write = profile_replace,
472 .llseek = default_llseek,
475 /* .remove file hook fn to remove loaded policy */
476 static ssize_t profile_remove(struct file *f, const char __user *buf,
477 size_t size, loff_t *pos)
479 struct aa_loaddata *data;
480 struct aa_label *label;
482 struct aa_ns *ns = aa_get_ns(f->f_inode->i_private);
484 label = begin_current_label_crit_section();
485 /* high level check about policy management - fine grained in
488 error = aa_may_manage_policy(label, ns, AA_MAY_REMOVE_POLICY);
493 * aa_remove_profile needs a null terminated string so 1 extra
494 * byte is allocated and the copied data is null terminated.
496 data = aa_simple_write_to_buffer(buf, size + 1, size, pos);
498 error = PTR_ERR(data);
500 data->data[size] = 0;
501 error = aa_remove_profiles(ns, label, data->data, size);
502 aa_put_loaddata(data);
505 end_current_label_crit_section(label);
510 static const struct file_operations aa_fs_profile_remove = {
511 .write = profile_remove,
512 .llseek = default_llseek,
520 /* revision file hook fn for policy loads */
521 static int ns_revision_release(struct inode *inode, struct file *file)
523 struct aa_revision *rev = file->private_data;
533 static ssize_t ns_revision_read(struct file *file, char __user *buf,
534 size_t size, loff_t *ppos)
536 struct aa_revision *rev = file->private_data;
541 mutex_lock_nested(&rev->ns->lock, rev->ns->level);
542 last_read = rev->last_read;
543 if (last_read == rev->ns->revision) {
544 mutex_unlock(&rev->ns->lock);
545 if (file->f_flags & O_NONBLOCK)
547 if (wait_event_interruptible(rev->ns->wait,
549 READ_ONCE(rev->ns->revision)))
551 mutex_lock_nested(&rev->ns->lock, rev->ns->level);
554 avail = sprintf(buffer, "%ld\n", rev->ns->revision);
555 if (*ppos + size > avail) {
556 rev->last_read = rev->ns->revision;
559 mutex_unlock(&rev->ns->lock);
561 return simple_read_from_buffer(buf, size, ppos, buffer, avail);
564 static int ns_revision_open(struct inode *inode, struct file *file)
566 struct aa_revision *rev = kzalloc(sizeof(*rev), GFP_KERNEL);
571 rev->ns = aa_get_ns(inode->i_private);
573 rev->ns = aa_get_current_ns();
574 file->private_data = rev;
579 static __poll_t ns_revision_poll(struct file *file, poll_table *pt)
581 struct aa_revision *rev = file->private_data;
585 mutex_lock_nested(&rev->ns->lock, rev->ns->level);
586 poll_wait(file, &rev->ns->wait, pt);
587 if (rev->last_read < rev->ns->revision)
588 mask |= EPOLLIN | EPOLLRDNORM;
589 mutex_unlock(&rev->ns->lock);
595 void __aa_bump_ns_revision(struct aa_ns *ns)
597 WRITE_ONCE(ns->revision, ns->revision + 1);
598 wake_up_interruptible(&ns->wait);
601 static const struct file_operations aa_fs_ns_revision_fops = {
602 .owner = THIS_MODULE,
603 .open = ns_revision_open,
604 .poll = ns_revision_poll,
605 .read = ns_revision_read,
606 .llseek = generic_file_llseek,
607 .release = ns_revision_release,
610 static void profile_query_cb(struct aa_profile *profile, struct aa_perms *perms,
611 const char *match_str, size_t match_len)
613 struct aa_perms tmp = { };
615 unsigned int state = 0;
617 if (profile_unconfined(profile))
619 if (profile->file.dfa && *match_str == AA_CLASS_FILE) {
620 dfa = profile->file.dfa;
621 state = aa_dfa_match_len(dfa, profile->file.start,
622 match_str + 1, match_len - 1);
624 struct path_cond cond = { };
626 tmp = aa_compute_fperms(dfa, state, &cond);
628 } else if (profile->policy.dfa) {
629 if (!PROFILE_MEDIATES(profile, *match_str))
630 return; /* no change to current perms */
631 dfa = profile->policy.dfa;
632 state = aa_dfa_match_len(dfa, profile->policy.start[0],
633 match_str, match_len);
635 aa_compute_perms(dfa, state, &tmp);
637 aa_apply_modes_to_perms(profile, &tmp);
638 aa_perms_accum_raw(perms, &tmp);
643 * query_data - queries a policy and writes its data to buf
644 * @buf: the resulting data is stored here (NOT NULL)
645 * @buf_len: size of buf
646 * @query: query string used to retrieve data
647 * @query_len: size of query including second NUL byte
649 * The buffers pointed to by buf and query may overlap. The query buffer is
650 * parsed before buf is written to.
652 * The query should look like "<LABEL>\0<KEY>\0", where <LABEL> is the name of
653 * the security confinement context and <KEY> is the name of the data to
654 * retrieve. <LABEL> and <KEY> must not be NUL-terminated.
656 * Don't expect the contents of buf to be preserved on failure.
658 * Returns: number of characters written to buf or -errno on failure
660 static ssize_t query_data(char *buf, size_t buf_len,
661 char *query, size_t query_len)
666 struct aa_label *label, *curr;
667 struct aa_profile *profile;
668 struct aa_data *data;
673 return -EINVAL; /* need a query */
675 key = query + strnlen(query, query_len) + 1;
676 if (key + 1 >= query + query_len)
677 return -EINVAL; /* not enough space for a non-empty key */
678 if (key + strnlen(key, query + query_len - key) >= query + query_len)
679 return -EINVAL; /* must end with NUL */
681 if (buf_len < sizeof(bytes) + sizeof(blocks))
682 return -EINVAL; /* not enough space */
684 curr = begin_current_label_crit_section();
685 label = aa_label_parse(curr, query, GFP_KERNEL, false, false);
686 end_current_label_crit_section(curr);
688 return PTR_ERR(label);
690 /* We are going to leave space for two numbers. The first is the total
691 * number of bytes we are writing after the first number. This is so
692 * users can read the full output without reallocation.
694 * The second number is the number of data blocks we're writing. An
695 * application might be confined by multiple policies having data in
698 memset(buf, 0, sizeof(bytes) + sizeof(blocks));
699 out = buf + sizeof(bytes) + sizeof(blocks);
702 label_for_each_confined(i, label, profile) {
706 data = rhashtable_lookup_fast(profile->data, &key,
710 if (out + sizeof(outle32) + data->size > buf +
713 return -EINVAL; /* not enough space */
715 outle32 = __cpu_to_le32(data->size);
716 memcpy(out, &outle32, sizeof(outle32));
717 out += sizeof(outle32);
718 memcpy(out, data->data, data->size);
725 outle32 = __cpu_to_le32(out - buf - sizeof(bytes));
726 memcpy(buf, &outle32, sizeof(outle32));
727 outle32 = __cpu_to_le32(blocks);
728 memcpy(buf + sizeof(bytes), &outle32, sizeof(outle32));
734 * query_label - queries a label and writes permissions to buf
735 * @buf: the resulting permissions string is stored here (NOT NULL)
736 * @buf_len: size of buf
737 * @query: binary query string to match against the dfa
738 * @query_len: size of query
739 * @view_only: only compute for querier's view
741 * The buffers pointed to by buf and query may overlap. The query buffer is
742 * parsed before buf is written to.
744 * The query should look like "LABEL_NAME\0DFA_STRING" where LABEL_NAME is
745 * the name of the label, in the current namespace, that is to be queried and
746 * DFA_STRING is a binary string to match against the label(s)'s DFA.
748 * LABEL_NAME must be NUL terminated. DFA_STRING may contain NUL characters
749 * but must *not* be NUL terminated.
751 * Returns: number of characters written to buf or -errno on failure
753 static ssize_t query_label(char *buf, size_t buf_len,
754 char *query, size_t query_len, bool view_only)
756 struct aa_profile *profile;
757 struct aa_label *label, *curr;
758 char *label_name, *match_str;
759 size_t label_name_len, match_len;
760 struct aa_perms perms;
767 label_name_len = strnlen(query, query_len);
768 if (!label_name_len || label_name_len == query_len)
772 * The extra byte is to account for the null byte between the
773 * profile name and dfa string. profile_name_len is greater
774 * than zero and less than query_len, so a byte can be safely
775 * added or subtracted.
777 match_str = label_name + label_name_len + 1;
778 match_len = query_len - label_name_len - 1;
780 curr = begin_current_label_crit_section();
781 label = aa_label_parse(curr, label_name, GFP_KERNEL, false, false);
782 end_current_label_crit_section(curr);
784 return PTR_ERR(label);
788 label_for_each_in_ns(i, labels_ns(label), label, profile) {
789 profile_query_cb(profile, &perms, match_str, match_len);
792 label_for_each(i, label, profile) {
793 profile_query_cb(profile, &perms, match_str, match_len);
798 return scnprintf(buf, buf_len,
799 "allow 0x%08x\ndeny 0x%08x\naudit 0x%08x\nquiet 0x%08x\n",
800 perms.allow, perms.deny, perms.audit, perms.quiet);
804 * Transaction based IO.
805 * The file expects a write which triggers the transaction, and then
806 * possibly a read(s) which collects the result - which is stored in a
807 * file-local buffer. Once a new write is performed, a new set of results
808 * are stored in the file-local buffer.
810 struct multi_transaction {
816 #define MULTI_TRANSACTION_LIMIT (PAGE_SIZE - sizeof(struct multi_transaction))
817 /* TODO: replace with per file lock */
818 static DEFINE_SPINLOCK(multi_transaction_lock);
820 static void multi_transaction_kref(struct kref *kref)
822 struct multi_transaction *t;
824 t = container_of(kref, struct multi_transaction, count);
825 free_page((unsigned long) t);
828 static struct multi_transaction *
829 get_multi_transaction(struct multi_transaction *t)
832 kref_get(&(t->count));
837 static void put_multi_transaction(struct multi_transaction *t)
840 kref_put(&(t->count), multi_transaction_kref);
843 /* does not increment @new's count */
844 static void multi_transaction_set(struct file *file,
845 struct multi_transaction *new, size_t n)
847 struct multi_transaction *old;
849 AA_BUG(n > MULTI_TRANSACTION_LIMIT);
852 spin_lock(&multi_transaction_lock);
853 old = (struct multi_transaction *) file->private_data;
854 file->private_data = new;
855 spin_unlock(&multi_transaction_lock);
856 put_multi_transaction(old);
859 static struct multi_transaction *multi_transaction_new(struct file *file,
860 const char __user *buf,
863 struct multi_transaction *t;
865 if (size > MULTI_TRANSACTION_LIMIT - 1)
866 return ERR_PTR(-EFBIG);
868 t = (struct multi_transaction *)get_zeroed_page(GFP_KERNEL);
870 return ERR_PTR(-ENOMEM);
871 kref_init(&t->count);
872 if (copy_from_user(t->data, buf, size)) {
873 put_multi_transaction(t);
874 return ERR_PTR(-EFAULT);
880 static ssize_t multi_transaction_read(struct file *file, char __user *buf,
881 size_t size, loff_t *pos)
883 struct multi_transaction *t;
886 spin_lock(&multi_transaction_lock);
887 t = get_multi_transaction(file->private_data);
888 spin_unlock(&multi_transaction_lock);
892 ret = simple_read_from_buffer(buf, size, pos, t->data, t->size);
893 put_multi_transaction(t);
898 static int multi_transaction_release(struct inode *inode, struct file *file)
900 put_multi_transaction(file->private_data);
905 #define QUERY_CMD_LABEL "label\0"
906 #define QUERY_CMD_LABEL_LEN 6
907 #define QUERY_CMD_PROFILE "profile\0"
908 #define QUERY_CMD_PROFILE_LEN 8
909 #define QUERY_CMD_LABELALL "labelall\0"
910 #define QUERY_CMD_LABELALL_LEN 9
911 #define QUERY_CMD_DATA "data\0"
912 #define QUERY_CMD_DATA_LEN 5
915 * aa_write_access - generic permissions and data query
916 * @file: pointer to open apparmorfs/access file
917 * @ubuf: user buffer containing the complete query string (NOT NULL)
918 * @count: size of ubuf
919 * @ppos: position in the file (MUST BE ZERO)
921 * Allows for one permissions or data query per open(), write(), and read()
922 * sequence. The only queries currently supported are label-based queries for
923 * permissions or data.
925 * For permissions queries, ubuf must begin with "label\0", followed by the
926 * profile query specific format described in the query_label() function
929 * For data queries, ubuf must have the form "data\0<LABEL>\0<KEY>\0", where
930 * <LABEL> is the name of the security confinement context and <KEY> is the
931 * name of the data to retrieve.
933 * Returns: number of bytes written or -errno on failure
935 static ssize_t aa_write_access(struct file *file, const char __user *ubuf,
936 size_t count, loff_t *ppos)
938 struct multi_transaction *t;
944 t = multi_transaction_new(file, ubuf, count);
948 if (count > QUERY_CMD_PROFILE_LEN &&
949 !memcmp(t->data, QUERY_CMD_PROFILE, QUERY_CMD_PROFILE_LEN)) {
950 len = query_label(t->data, MULTI_TRANSACTION_LIMIT,
951 t->data + QUERY_CMD_PROFILE_LEN,
952 count - QUERY_CMD_PROFILE_LEN, true);
953 } else if (count > QUERY_CMD_LABEL_LEN &&
954 !memcmp(t->data, QUERY_CMD_LABEL, QUERY_CMD_LABEL_LEN)) {
955 len = query_label(t->data, MULTI_TRANSACTION_LIMIT,
956 t->data + QUERY_CMD_LABEL_LEN,
957 count - QUERY_CMD_LABEL_LEN, true);
958 } else if (count > QUERY_CMD_LABELALL_LEN &&
959 !memcmp(t->data, QUERY_CMD_LABELALL,
960 QUERY_CMD_LABELALL_LEN)) {
961 len = query_label(t->data, MULTI_TRANSACTION_LIMIT,
962 t->data + QUERY_CMD_LABELALL_LEN,
963 count - QUERY_CMD_LABELALL_LEN, false);
964 } else if (count > QUERY_CMD_DATA_LEN &&
965 !memcmp(t->data, QUERY_CMD_DATA, QUERY_CMD_DATA_LEN)) {
966 len = query_data(t->data, MULTI_TRANSACTION_LIMIT,
967 t->data + QUERY_CMD_DATA_LEN,
968 count - QUERY_CMD_DATA_LEN);
973 put_multi_transaction(t);
977 multi_transaction_set(file, t, len);
982 static const struct file_operations aa_sfs_access = {
983 .write = aa_write_access,
984 .read = multi_transaction_read,
985 .release = multi_transaction_release,
986 .llseek = generic_file_llseek,
989 static int aa_sfs_seq_show(struct seq_file *seq, void *v)
991 struct aa_sfs_entry *fs_file = seq->private;
996 switch (fs_file->v_type) {
997 case AA_SFS_TYPE_BOOLEAN:
998 seq_printf(seq, "%s\n", fs_file->v.boolean ? "yes" : "no");
1000 case AA_SFS_TYPE_STRING:
1001 seq_printf(seq, "%s\n", fs_file->v.string);
1003 case AA_SFS_TYPE_U64:
1004 seq_printf(seq, "%#08lx\n", fs_file->v.u64);
1007 /* Ignore unpritable entry types. */
1014 static int aa_sfs_seq_open(struct inode *inode, struct file *file)
1016 return single_open(file, aa_sfs_seq_show, inode->i_private);
1019 const struct file_operations aa_sfs_seq_file_ops = {
1020 .owner = THIS_MODULE,
1021 .open = aa_sfs_seq_open,
1023 .llseek = seq_lseek,
1024 .release = single_release,
1028 * profile based file operations
1029 * policy/profiles/XXXX/profiles/ *
1032 #define SEQ_PROFILE_FOPS(NAME) \
1033 static int seq_profile_ ##NAME ##_open(struct inode *inode, struct file *file)\
1035 return seq_profile_open(inode, file, seq_profile_ ##NAME ##_show); \
1038 static const struct file_operations seq_profile_ ##NAME ##_fops = { \
1039 .owner = THIS_MODULE, \
1040 .open = seq_profile_ ##NAME ##_open, \
1042 .llseek = seq_lseek, \
1043 .release = seq_profile_release, \
1046 static int seq_profile_open(struct inode *inode, struct file *file,
1047 int (*show)(struct seq_file *, void *))
1049 struct aa_proxy *proxy = aa_get_proxy(inode->i_private);
1050 int error = single_open(file, show, proxy);
1053 file->private_data = NULL;
1054 aa_put_proxy(proxy);
1060 static int seq_profile_release(struct inode *inode, struct file *file)
1062 struct seq_file *seq = (struct seq_file *) file->private_data;
1064 aa_put_proxy(seq->private);
1065 return single_release(inode, file);
1068 static int seq_profile_name_show(struct seq_file *seq, void *v)
1070 struct aa_proxy *proxy = seq->private;
1071 struct aa_label *label = aa_get_label_rcu(&proxy->label);
1072 struct aa_profile *profile = labels_profile(label);
1073 seq_printf(seq, "%s\n", profile->base.name);
1074 aa_put_label(label);
1079 static int seq_profile_mode_show(struct seq_file *seq, void *v)
1081 struct aa_proxy *proxy = seq->private;
1082 struct aa_label *label = aa_get_label_rcu(&proxy->label);
1083 struct aa_profile *profile = labels_profile(label);
1084 seq_printf(seq, "%s\n", aa_profile_mode_names[profile->mode]);
1085 aa_put_label(label);
1090 static int seq_profile_attach_show(struct seq_file *seq, void *v)
1092 struct aa_proxy *proxy = seq->private;
1093 struct aa_label *label = aa_get_label_rcu(&proxy->label);
1094 struct aa_profile *profile = labels_profile(label);
1095 if (profile->attach)
1096 seq_printf(seq, "%s\n", profile->attach);
1097 else if (profile->xmatch)
1098 seq_puts(seq, "<unknown>\n");
1100 seq_printf(seq, "%s\n", profile->base.name);
1101 aa_put_label(label);
1106 static int seq_profile_hash_show(struct seq_file *seq, void *v)
1108 struct aa_proxy *proxy = seq->private;
1109 struct aa_label *label = aa_get_label_rcu(&proxy->label);
1110 struct aa_profile *profile = labels_profile(label);
1111 unsigned int i, size = aa_hash_size();
1113 if (profile->hash) {
1114 for (i = 0; i < size; i++)
1115 seq_printf(seq, "%.2x", profile->hash[i]);
1116 seq_putc(seq, '\n');
1118 aa_put_label(label);
1123 SEQ_PROFILE_FOPS(name);
1124 SEQ_PROFILE_FOPS(mode);
1125 SEQ_PROFILE_FOPS(attach);
1126 SEQ_PROFILE_FOPS(hash);
1129 * namespace based files
1130 * several root files and
1134 #define SEQ_NS_FOPS(NAME) \
1135 static int seq_ns_ ##NAME ##_open(struct inode *inode, struct file *file) \
1137 return single_open(file, seq_ns_ ##NAME ##_show, inode->i_private); \
1140 static const struct file_operations seq_ns_ ##NAME ##_fops = { \
1141 .owner = THIS_MODULE, \
1142 .open = seq_ns_ ##NAME ##_open, \
1144 .llseek = seq_lseek, \
1145 .release = single_release, \
1148 static int seq_ns_stacked_show(struct seq_file *seq, void *v)
1150 struct aa_label *label;
1152 label = begin_current_label_crit_section();
1153 seq_printf(seq, "%s\n", label->size > 1 ? "yes" : "no");
1154 end_current_label_crit_section(label);
1159 static int seq_ns_nsstacked_show(struct seq_file *seq, void *v)
1161 struct aa_label *label;
1162 struct aa_profile *profile;
1166 label = begin_current_label_crit_section();
1168 if (label->size > 1) {
1169 label_for_each(it, label, profile)
1170 if (profile->ns != labels_ns(label)) {
1176 seq_printf(seq, "%s\n", count > 1 ? "yes" : "no");
1177 end_current_label_crit_section(label);
1182 static int seq_ns_level_show(struct seq_file *seq, void *v)
1184 struct aa_label *label;
1186 label = begin_current_label_crit_section();
1187 seq_printf(seq, "%d\n", labels_ns(label)->level);
1188 end_current_label_crit_section(label);
1193 static int seq_ns_name_show(struct seq_file *seq, void *v)
1195 struct aa_label *label = begin_current_label_crit_section();
1196 seq_printf(seq, "%s\n", labels_ns(label)->base.name);
1197 end_current_label_crit_section(label);
1202 SEQ_NS_FOPS(stacked);
1203 SEQ_NS_FOPS(nsstacked);
1208 /* policy/raw_data/ * file ops */
1210 #define SEQ_RAWDATA_FOPS(NAME) \
1211 static int seq_rawdata_ ##NAME ##_open(struct inode *inode, struct file *file)\
1213 return seq_rawdata_open(inode, file, seq_rawdata_ ##NAME ##_show); \
1216 static const struct file_operations seq_rawdata_ ##NAME ##_fops = { \
1217 .owner = THIS_MODULE, \
1218 .open = seq_rawdata_ ##NAME ##_open, \
1220 .llseek = seq_lseek, \
1221 .release = seq_rawdata_release, \
1224 static int seq_rawdata_open(struct inode *inode, struct file *file,
1225 int (*show)(struct seq_file *, void *))
1227 struct aa_loaddata *data = __aa_get_loaddata(inode->i_private);
1231 /* lost race this ent is being reaped */
1234 error = single_open(file, show, data);
1236 AA_BUG(file->private_data &&
1237 ((struct seq_file *)file->private_data)->private);
1238 aa_put_loaddata(data);
1244 static int seq_rawdata_release(struct inode *inode, struct file *file)
1246 struct seq_file *seq = (struct seq_file *) file->private_data;
1249 aa_put_loaddata(seq->private);
1251 return single_release(inode, file);
1254 static int seq_rawdata_abi_show(struct seq_file *seq, void *v)
1256 struct aa_loaddata *data = seq->private;
1258 seq_printf(seq, "v%d\n", data->abi);
1263 static int seq_rawdata_revision_show(struct seq_file *seq, void *v)
1265 struct aa_loaddata *data = seq->private;
1267 seq_printf(seq, "%ld\n", data->revision);
1272 static int seq_rawdata_hash_show(struct seq_file *seq, void *v)
1274 struct aa_loaddata *data = seq->private;
1275 unsigned int i, size = aa_hash_size();
1278 for (i = 0; i < size; i++)
1279 seq_printf(seq, "%.2x", data->hash[i]);
1280 seq_putc(seq, '\n');
1286 SEQ_RAWDATA_FOPS(abi);
1287 SEQ_RAWDATA_FOPS(revision);
1288 SEQ_RAWDATA_FOPS(hash);
1290 static ssize_t rawdata_read(struct file *file, char __user *buf, size_t size,
1293 struct aa_loaddata *rawdata = file->private_data;
1295 return simple_read_from_buffer(buf, size, ppos, rawdata->data,
1299 static int rawdata_release(struct inode *inode, struct file *file)
1301 aa_put_loaddata(file->private_data);
1306 static int rawdata_open(struct inode *inode, struct file *file)
1308 if (!policy_view_capable(NULL))
1310 file->private_data = __aa_get_loaddata(inode->i_private);
1311 if (!file->private_data)
1312 /* lost race: this entry is being reaped */
1318 static const struct file_operations rawdata_fops = {
1319 .open = rawdata_open,
1320 .read = rawdata_read,
1321 .llseek = generic_file_llseek,
1322 .release = rawdata_release,
1325 static void remove_rawdata_dents(struct aa_loaddata *rawdata)
1329 for (i = 0; i < AAFS_LOADDATA_NDENTS; i++) {
1330 if (!IS_ERR_OR_NULL(rawdata->dents[i])) {
1331 /* no refcounts on i_private */
1332 aafs_remove(rawdata->dents[i]);
1333 rawdata->dents[i] = NULL;
1338 void __aa_fs_remove_rawdata(struct aa_loaddata *rawdata)
1340 AA_BUG(rawdata->ns && !mutex_is_locked(&rawdata->ns->lock));
1343 remove_rawdata_dents(rawdata);
1344 list_del_init(&rawdata->list);
1345 aa_put_ns(rawdata->ns);
1350 int __aa_fs_create_rawdata(struct aa_ns *ns, struct aa_loaddata *rawdata)
1352 struct dentry *dent, *dir;
1356 AA_BUG(!mutex_is_locked(&ns->lock));
1357 AA_BUG(!ns_subdata_dir(ns));
1360 * just use ns revision dir was originally created at. This is
1361 * under ns->lock and if load is successful revision will be
1362 * bumped and is guaranteed to be unique
1364 rawdata->name = kasprintf(GFP_KERNEL, "%ld", ns->revision);
1368 dir = aafs_create_dir(rawdata->name, ns_subdata_dir(ns));
1370 /* ->name freed when rawdata freed */
1371 return PTR_ERR(dir);
1372 rawdata->dents[AAFS_LOADDATA_DIR] = dir;
1374 dent = aafs_create_file("abi", S_IFREG | 0444, dir, rawdata,
1375 &seq_rawdata_abi_fops);
1378 rawdata->dents[AAFS_LOADDATA_ABI] = dent;
1380 dent = aafs_create_file("revision", S_IFREG | 0444, dir, rawdata,
1381 &seq_rawdata_revision_fops);
1384 rawdata->dents[AAFS_LOADDATA_REVISION] = dent;
1386 if (aa_g_hash_policy) {
1387 dent = aafs_create_file("sha1", S_IFREG | 0444, dir,
1388 rawdata, &seq_rawdata_hash_fops);
1391 rawdata->dents[AAFS_LOADDATA_HASH] = dent;
1394 dent = aafs_create_file("raw_data", S_IFREG | 0444,
1395 dir, rawdata, &rawdata_fops);
1398 rawdata->dents[AAFS_LOADDATA_DATA] = dent;
1399 d_inode(dent)->i_size = rawdata->size;
1401 rawdata->ns = aa_get_ns(ns);
1402 list_add(&rawdata->list, &ns->rawdata_list);
1403 /* no refcount on inode rawdata */
1408 remove_rawdata_dents(rawdata);
1410 return PTR_ERR(dent);
1413 /** fns to setup dynamic per profile/namespace files **/
1417 * Requires: @profile->ns->lock held
1419 void __aafs_profile_rmdir(struct aa_profile *profile)
1421 struct aa_profile *child;
1427 list_for_each_entry(child, &profile->base.profiles, base.list)
1428 __aafs_profile_rmdir(child);
1430 for (i = AAFS_PROF_SIZEOF - 1; i >= 0; --i) {
1431 struct aa_proxy *proxy;
1432 if (!profile->dents[i])
1435 proxy = d_inode(profile->dents[i])->i_private;
1436 aafs_remove(profile->dents[i]);
1437 aa_put_proxy(proxy);
1438 profile->dents[i] = NULL;
1444 * Requires: @old->ns->lock held
1446 void __aafs_profile_migrate_dents(struct aa_profile *old,
1447 struct aa_profile *new)
1453 AA_BUG(!mutex_is_locked(&profiles_ns(old)->lock));
1455 for (i = 0; i < AAFS_PROF_SIZEOF; i++) {
1456 new->dents[i] = old->dents[i];
1458 new->dents[i]->d_inode->i_mtime = current_time(new->dents[i]->d_inode);
1459 old->dents[i] = NULL;
1463 static struct dentry *create_profile_file(struct dentry *dir, const char *name,
1464 struct aa_profile *profile,
1465 const struct file_operations *fops)
1467 struct aa_proxy *proxy = aa_get_proxy(profile->label.proxy);
1468 struct dentry *dent;
1470 dent = aafs_create_file(name, S_IFREG | 0444, dir, proxy, fops);
1472 aa_put_proxy(proxy);
1477 static int profile_depth(struct aa_profile *profile)
1482 for (depth = 0; profile; profile = rcu_access_pointer(profile->parent))
1489 static char *gen_symlink_name(int depth, const char *dirname, const char *fname)
1493 int size = depth * 6 + strlen(dirname) + strlen(fname) + 11;
1495 s = buffer = kmalloc(size, GFP_KERNEL);
1497 return ERR_PTR(-ENOMEM);
1499 for (; depth > 0; depth--) {
1500 strcpy(s, "../../");
1505 error = snprintf(s, size, "raw_data/%s/%s", dirname, fname);
1506 if (error >= size || error < 0) {
1508 return ERR_PTR(-ENAMETOOLONG);
1514 static void rawdata_link_cb(void *arg)
1519 static const char *rawdata_get_link_base(struct dentry *dentry,
1520 struct inode *inode,
1521 struct delayed_call *done,
1524 struct aa_proxy *proxy = inode->i_private;
1525 struct aa_label *label;
1526 struct aa_profile *profile;
1531 return ERR_PTR(-ECHILD);
1533 label = aa_get_label_rcu(&proxy->label);
1534 profile = labels_profile(label);
1535 depth = profile_depth(profile);
1536 target = gen_symlink_name(depth, profile->rawdata->name, name);
1537 aa_put_label(label);
1542 set_delayed_call(done, rawdata_link_cb, target);
1547 static const char *rawdata_get_link_sha1(struct dentry *dentry,
1548 struct inode *inode,
1549 struct delayed_call *done)
1551 return rawdata_get_link_base(dentry, inode, done, "sha1");
1554 static const char *rawdata_get_link_abi(struct dentry *dentry,
1555 struct inode *inode,
1556 struct delayed_call *done)
1558 return rawdata_get_link_base(dentry, inode, done, "abi");
1561 static const char *rawdata_get_link_data(struct dentry *dentry,
1562 struct inode *inode,
1563 struct delayed_call *done)
1565 return rawdata_get_link_base(dentry, inode, done, "raw_data");
1568 static const struct inode_operations rawdata_link_sha1_iops = {
1569 .get_link = rawdata_get_link_sha1,
1572 static const struct inode_operations rawdata_link_abi_iops = {
1573 .get_link = rawdata_get_link_abi,
1575 static const struct inode_operations rawdata_link_data_iops = {
1576 .get_link = rawdata_get_link_data,
1581 * Requires: @profile->ns->lock held
1583 int __aafs_profile_mkdir(struct aa_profile *profile, struct dentry *parent)
1585 struct aa_profile *child;
1586 struct dentry *dent = NULL, *dir;
1590 AA_BUG(!mutex_is_locked(&profiles_ns(profile)->lock));
1593 struct aa_profile *p;
1594 p = aa_deref_parent(profile);
1596 /* adding to parent that previously didn't have children */
1597 dent = aafs_create_dir("profiles", dent);
1600 prof_child_dir(p) = parent = dent;
1603 if (!profile->dirname) {
1605 len = mangle_name(profile->base.name, NULL);
1606 id_len = snprintf(NULL, 0, ".%ld", profile->ns->uniq_id);
1608 profile->dirname = kmalloc(len + id_len + 1, GFP_KERNEL);
1609 if (!profile->dirname) {
1614 mangle_name(profile->base.name, profile->dirname);
1615 sprintf(profile->dirname + len, ".%ld", profile->ns->uniq_id++);
1618 dent = aafs_create_dir(profile->dirname, parent);
1621 prof_dir(profile) = dir = dent;
1623 dent = create_profile_file(dir, "name", profile,
1624 &seq_profile_name_fops);
1627 profile->dents[AAFS_PROF_NAME] = dent;
1629 dent = create_profile_file(dir, "mode", profile,
1630 &seq_profile_mode_fops);
1633 profile->dents[AAFS_PROF_MODE] = dent;
1635 dent = create_profile_file(dir, "attach", profile,
1636 &seq_profile_attach_fops);
1639 profile->dents[AAFS_PROF_ATTACH] = dent;
1641 if (profile->hash) {
1642 dent = create_profile_file(dir, "sha1", profile,
1643 &seq_profile_hash_fops);
1646 profile->dents[AAFS_PROF_HASH] = dent;
1649 if (profile->rawdata) {
1650 dent = aafs_create_symlink("raw_sha1", dir, NULL,
1651 profile->label.proxy,
1652 &rawdata_link_sha1_iops);
1655 aa_get_proxy(profile->label.proxy);
1656 profile->dents[AAFS_PROF_RAW_HASH] = dent;
1658 dent = aafs_create_symlink("raw_abi", dir, NULL,
1659 profile->label.proxy,
1660 &rawdata_link_abi_iops);
1663 aa_get_proxy(profile->label.proxy);
1664 profile->dents[AAFS_PROF_RAW_ABI] = dent;
1666 dent = aafs_create_symlink("raw_data", dir, NULL,
1667 profile->label.proxy,
1668 &rawdata_link_data_iops);
1671 aa_get_proxy(profile->label.proxy);
1672 profile->dents[AAFS_PROF_RAW_DATA] = dent;
1675 list_for_each_entry(child, &profile->base.profiles, base.list) {
1676 error = __aafs_profile_mkdir(child, prof_child_dir(profile));
1684 error = PTR_ERR(dent);
1687 __aafs_profile_rmdir(profile);
1692 static int ns_mkdir_op(struct inode *dir, struct dentry *dentry, umode_t mode)
1694 struct aa_ns *ns, *parent;
1695 /* TODO: improve permission check */
1696 struct aa_label *label;
1699 label = begin_current_label_crit_section();
1700 error = aa_may_manage_policy(label, NULL, AA_MAY_LOAD_POLICY);
1701 end_current_label_crit_section(label);
1705 parent = aa_get_ns(dir->i_private);
1706 AA_BUG(d_inode(ns_subns_dir(parent)) != dir);
1708 /* we have to unlock and then relock to get locking order right
1712 error = simple_pin_fs(&aafs_ops, &aafs_mnt, &aafs_count);
1713 mutex_lock_nested(&parent->lock, parent->level);
1714 inode_lock_nested(dir, I_MUTEX_PARENT);
1718 error = __aafs_setup_d_inode(dir, dentry, mode | S_IFDIR, NULL,
1723 ns = __aa_find_or_create_ns(parent, READ_ONCE(dentry->d_name.name),
1726 error = PTR_ERR(ns);
1730 aa_put_ns(ns); /* list ref remains */
1733 simple_release_fs(&aafs_mnt, &aafs_count);
1735 mutex_unlock(&parent->lock);
1741 static int ns_rmdir_op(struct inode *dir, struct dentry *dentry)
1743 struct aa_ns *ns, *parent;
1744 /* TODO: improve permission check */
1745 struct aa_label *label;
1748 label = begin_current_label_crit_section();
1749 error = aa_may_manage_policy(label, NULL, AA_MAY_LOAD_POLICY);
1750 end_current_label_crit_section(label);
1754 parent = aa_get_ns(dir->i_private);
1755 /* rmdir calls the generic securityfs functions to remove files
1756 * from the apparmor dir. It is up to the apparmor ns locking
1760 inode_unlock(dentry->d_inode);
1762 mutex_lock_nested(&parent->lock, parent->level);
1763 ns = aa_get_ns(__aa_findn_ns(&parent->sub_ns, dentry->d_name.name,
1764 dentry->d_name.len));
1769 AA_BUG(ns_dir(ns) != dentry);
1775 mutex_unlock(&parent->lock);
1776 inode_lock_nested(dir, I_MUTEX_PARENT);
1777 inode_lock(dentry->d_inode);
1783 static const struct inode_operations ns_dir_inode_operations = {
1784 .lookup = simple_lookup,
1785 .mkdir = ns_mkdir_op,
1786 .rmdir = ns_rmdir_op,
1789 static void __aa_fs_list_remove_rawdata(struct aa_ns *ns)
1791 struct aa_loaddata *ent, *tmp;
1793 AA_BUG(!mutex_is_locked(&ns->lock));
1795 list_for_each_entry_safe(ent, tmp, &ns->rawdata_list, list)
1796 __aa_fs_remove_rawdata(ent);
1801 * Requires: @ns->lock held
1803 void __aafs_ns_rmdir(struct aa_ns *ns)
1806 struct aa_profile *child;
1811 AA_BUG(!mutex_is_locked(&ns->lock));
1813 list_for_each_entry(child, &ns->base.profiles, base.list)
1814 __aafs_profile_rmdir(child);
1816 list_for_each_entry(sub, &ns->sub_ns, base.list) {
1817 mutex_lock_nested(&sub->lock, sub->level);
1818 __aafs_ns_rmdir(sub);
1819 mutex_unlock(&sub->lock);
1822 __aa_fs_list_remove_rawdata(ns);
1824 if (ns_subns_dir(ns)) {
1825 sub = d_inode(ns_subns_dir(ns))->i_private;
1828 if (ns_subload(ns)) {
1829 sub = d_inode(ns_subload(ns))->i_private;
1832 if (ns_subreplace(ns)) {
1833 sub = d_inode(ns_subreplace(ns))->i_private;
1836 if (ns_subremove(ns)) {
1837 sub = d_inode(ns_subremove(ns))->i_private;
1840 if (ns_subrevision(ns)) {
1841 sub = d_inode(ns_subrevision(ns))->i_private;
1845 for (i = AAFS_NS_SIZEOF - 1; i >= 0; --i) {
1846 aafs_remove(ns->dents[i]);
1847 ns->dents[i] = NULL;
1851 /* assumes cleanup in caller */
1852 static int __aafs_ns_mkdir_entries(struct aa_ns *ns, struct dentry *dir)
1854 struct dentry *dent;
1859 dent = aafs_create_dir("profiles", dir);
1861 return PTR_ERR(dent);
1862 ns_subprofs_dir(ns) = dent;
1864 dent = aafs_create_dir("raw_data", dir);
1866 return PTR_ERR(dent);
1867 ns_subdata_dir(ns) = dent;
1869 dent = aafs_create_file("revision", 0444, dir, ns,
1870 &aa_fs_ns_revision_fops);
1872 return PTR_ERR(dent);
1874 ns_subrevision(ns) = dent;
1876 dent = aafs_create_file(".load", 0640, dir, ns,
1877 &aa_fs_profile_load);
1879 return PTR_ERR(dent);
1881 ns_subload(ns) = dent;
1883 dent = aafs_create_file(".replace", 0640, dir, ns,
1884 &aa_fs_profile_replace);
1886 return PTR_ERR(dent);
1888 ns_subreplace(ns) = dent;
1890 dent = aafs_create_file(".remove", 0640, dir, ns,
1891 &aa_fs_profile_remove);
1893 return PTR_ERR(dent);
1895 ns_subremove(ns) = dent;
1897 /* use create_dentry so we can supply private data */
1898 dent = aafs_create("namespaces", S_IFDIR | 0755, dir, ns, NULL, NULL,
1899 &ns_dir_inode_operations);
1901 return PTR_ERR(dent);
1903 ns_subns_dir(ns) = dent;
1909 * Requires: @ns->lock held
1911 int __aafs_ns_mkdir(struct aa_ns *ns, struct dentry *parent, const char *name,
1912 struct dentry *dent)
1915 struct aa_profile *child;
1921 AA_BUG(!mutex_is_locked(&ns->lock));
1924 name = ns->base.name;
1927 /* create ns dir if it doesn't already exist */
1928 dent = aafs_create_dir(name, parent);
1933 ns_dir(ns) = dir = dent;
1934 error = __aafs_ns_mkdir_entries(ns, dir);
1939 list_for_each_entry(child, &ns->base.profiles, base.list) {
1940 error = __aafs_profile_mkdir(child, ns_subprofs_dir(ns));
1946 list_for_each_entry(sub, &ns->sub_ns, base.list) {
1947 mutex_lock_nested(&sub->lock, sub->level);
1948 error = __aafs_ns_mkdir(sub, ns_subns_dir(ns), NULL, NULL);
1949 mutex_unlock(&sub->lock);
1957 error = PTR_ERR(dent);
1960 __aafs_ns_rmdir(ns);
1966 * __next_ns - find the next namespace to list
1967 * @root: root namespace to stop search at (NOT NULL)
1968 * @ns: current ns position (NOT NULL)
1970 * Find the next namespace from @ns under @root and handle all locking needed
1971 * while switching current namespace.
1973 * Returns: next namespace or NULL if at last namespace under @root
1974 * Requires: ns->parent->lock to be held
1975 * NOTE: will not unlock root->lock
1977 static struct aa_ns *__next_ns(struct aa_ns *root, struct aa_ns *ns)
1979 struct aa_ns *parent, *next;
1983 AA_BUG(ns != root && !mutex_is_locked(&ns->parent->lock));
1985 /* is next namespace a child */
1986 if (!list_empty(&ns->sub_ns)) {
1987 next = list_first_entry(&ns->sub_ns, typeof(*ns), base.list);
1988 mutex_lock_nested(&next->lock, next->level);
1992 /* check if the next ns is a sibling, parent, gp, .. */
1993 parent = ns->parent;
1994 while (ns != root) {
1995 mutex_unlock(&ns->lock);
1996 next = list_next_entry(ns, base.list);
1997 if (!list_entry_is_head(next, &parent->sub_ns, base.list)) {
1998 mutex_lock_nested(&next->lock, next->level);
2002 parent = parent->parent;
2009 * __first_profile - find the first profile in a namespace
2010 * @root: namespace that is root of profiles being displayed (NOT NULL)
2011 * @ns: namespace to start in (NOT NULL)
2013 * Returns: unrefcounted profile or NULL if no profile
2014 * Requires: profile->ns.lock to be held
2016 static struct aa_profile *__first_profile(struct aa_ns *root,
2020 AA_BUG(ns && !mutex_is_locked(&ns->lock));
2022 for (; ns; ns = __next_ns(root, ns)) {
2023 if (!list_empty(&ns->base.profiles))
2024 return list_first_entry(&ns->base.profiles,
2025 struct aa_profile, base.list);
2031 * __next_profile - step to the next profile in a profile tree
2032 * @profile: current profile in tree (NOT NULL)
2034 * Perform a depth first traversal on the profile tree in a namespace
2036 * Returns: next profile or NULL if done
2037 * Requires: profile->ns.lock to be held
2039 static struct aa_profile *__next_profile(struct aa_profile *p)
2041 struct aa_profile *parent;
2042 struct aa_ns *ns = p->ns;
2044 AA_BUG(!mutex_is_locked(&profiles_ns(p)->lock));
2046 /* is next profile a child */
2047 if (!list_empty(&p->base.profiles))
2048 return list_first_entry(&p->base.profiles, typeof(*p),
2051 /* is next profile a sibling, parent sibling, gp, sibling, .. */
2052 parent = rcu_dereference_protected(p->parent,
2053 mutex_is_locked(&p->ns->lock));
2055 p = list_next_entry(p, base.list);
2056 if (!list_entry_is_head(p, &parent->base.profiles, base.list))
2059 parent = rcu_dereference_protected(parent->parent,
2060 mutex_is_locked(&parent->ns->lock));
2063 /* is next another profile in the namespace */
2064 p = list_next_entry(p, base.list);
2065 if (!list_entry_is_head(p, &ns->base.profiles, base.list))
2072 * next_profile - step to the next profile in where ever it may be
2073 * @root: root namespace (NOT NULL)
2074 * @profile: current profile (NOT NULL)
2076 * Returns: next profile or NULL if there isn't one
2078 static struct aa_profile *next_profile(struct aa_ns *root,
2079 struct aa_profile *profile)
2081 struct aa_profile *next = __next_profile(profile);
2085 /* finished all profiles in namespace move to next namespace */
2086 return __first_profile(root, __next_ns(root, profile->ns));
2090 * p_start - start a depth first traversal of profile tree
2091 * @f: seq_file to fill
2092 * @pos: current position
2094 * Returns: first profile under current namespace or NULL if none found
2096 * acquires first ns->lock
2098 static void *p_start(struct seq_file *f, loff_t *pos)
2100 struct aa_profile *profile = NULL;
2101 struct aa_ns *root = aa_get_current_ns();
2105 /* find the first profile */
2106 mutex_lock_nested(&root->lock, root->level);
2107 profile = __first_profile(root, root);
2109 /* skip to position */
2110 for (; profile && l > 0; l--)
2111 profile = next_profile(root, profile);
2117 * p_next - read the next profile entry
2118 * @f: seq_file to fill
2119 * @p: profile previously returned
2120 * @pos: current position
2122 * Returns: next profile after @p or NULL if none
2124 * may acquire/release locks in namespace tree as necessary
2126 static void *p_next(struct seq_file *f, void *p, loff_t *pos)
2128 struct aa_profile *profile = p;
2129 struct aa_ns *ns = f->private;
2132 return next_profile(ns, profile);
2136 * p_stop - stop depth first traversal
2137 * @f: seq_file we are filling
2138 * @p: the last profile writen
2140 * Release all locking done by p_start/p_next on namespace tree
2142 static void p_stop(struct seq_file *f, void *p)
2144 struct aa_profile *profile = p;
2145 struct aa_ns *root = f->private, *ns;
2148 for (ns = profile->ns; ns && ns != root; ns = ns->parent)
2149 mutex_unlock(&ns->lock);
2151 mutex_unlock(&root->lock);
2156 * seq_show_profile - show a profile entry
2157 * @f: seq_file to file
2158 * @p: current position (profile) (NOT NULL)
2160 * Returns: error on failure
2162 static int seq_show_profile(struct seq_file *f, void *p)
2164 struct aa_profile *profile = (struct aa_profile *)p;
2165 struct aa_ns *root = f->private;
2167 aa_label_seq_xprint(f, root, &profile->label,
2168 FLAG_SHOW_MODE | FLAG_VIEW_SUBNS, GFP_KERNEL);
2174 static const struct seq_operations aa_sfs_profiles_op = {
2178 .show = seq_show_profile,
2181 static int profiles_open(struct inode *inode, struct file *file)
2183 if (!policy_view_capable(NULL))
2186 return seq_open(file, &aa_sfs_profiles_op);
2189 static int profiles_release(struct inode *inode, struct file *file)
2191 return seq_release(inode, file);
2194 static const struct file_operations aa_sfs_profiles_fops = {
2195 .open = profiles_open,
2197 .llseek = seq_lseek,
2198 .release = profiles_release,
2202 /** Base file system setup **/
2203 static struct aa_sfs_entry aa_sfs_entry_file[] = {
2204 AA_SFS_FILE_STRING("mask",
2205 "create read write exec append mmap_exec link lock"),
2209 static struct aa_sfs_entry aa_sfs_entry_ptrace[] = {
2210 AA_SFS_FILE_STRING("mask", "read trace"),
2214 static struct aa_sfs_entry aa_sfs_entry_signal[] = {
2215 AA_SFS_FILE_STRING("mask", AA_SFS_SIG_MASK),
2219 static struct aa_sfs_entry aa_sfs_entry_attach[] = {
2220 AA_SFS_FILE_BOOLEAN("xattr", 1),
2223 static struct aa_sfs_entry aa_sfs_entry_domain[] = {
2224 AA_SFS_FILE_BOOLEAN("change_hat", 1),
2225 AA_SFS_FILE_BOOLEAN("change_hatv", 1),
2226 AA_SFS_FILE_BOOLEAN("change_onexec", 1),
2227 AA_SFS_FILE_BOOLEAN("change_profile", 1),
2228 AA_SFS_FILE_BOOLEAN("stack", 1),
2229 AA_SFS_FILE_BOOLEAN("fix_binfmt_elf_mmap", 1),
2230 AA_SFS_FILE_BOOLEAN("post_nnp_subset", 1),
2231 AA_SFS_FILE_BOOLEAN("computed_longest_left", 1),
2232 AA_SFS_DIR("attach_conditions", aa_sfs_entry_attach),
2233 AA_SFS_FILE_STRING("version", "1.2"),
2237 static struct aa_sfs_entry aa_sfs_entry_versions[] = {
2238 AA_SFS_FILE_BOOLEAN("v5", 1),
2239 AA_SFS_FILE_BOOLEAN("v6", 1),
2240 AA_SFS_FILE_BOOLEAN("v7", 1),
2241 AA_SFS_FILE_BOOLEAN("v8", 1),
2245 static struct aa_sfs_entry aa_sfs_entry_policy[] = {
2246 AA_SFS_DIR("versions", aa_sfs_entry_versions),
2247 AA_SFS_FILE_BOOLEAN("set_load", 1),
2251 static struct aa_sfs_entry aa_sfs_entry_mount[] = {
2252 AA_SFS_FILE_STRING("mask", "mount umount pivot_root"),
2256 static struct aa_sfs_entry aa_sfs_entry_ns[] = {
2257 AA_SFS_FILE_BOOLEAN("profile", 1),
2258 AA_SFS_FILE_BOOLEAN("pivot_root", 0),
2262 static struct aa_sfs_entry aa_sfs_entry_query_label[] = {
2263 AA_SFS_FILE_STRING("perms", "allow deny audit quiet"),
2264 AA_SFS_FILE_BOOLEAN("data", 1),
2265 AA_SFS_FILE_BOOLEAN("multi_transaction", 1),
2269 static struct aa_sfs_entry aa_sfs_entry_query[] = {
2270 AA_SFS_DIR("label", aa_sfs_entry_query_label),
2273 static struct aa_sfs_entry aa_sfs_entry_features[] = {
2274 AA_SFS_DIR("policy", aa_sfs_entry_policy),
2275 AA_SFS_DIR("domain", aa_sfs_entry_domain),
2276 AA_SFS_DIR("file", aa_sfs_entry_file),
2277 AA_SFS_DIR("network_v8", aa_sfs_entry_network),
2278 AA_SFS_DIR("mount", aa_sfs_entry_mount),
2279 AA_SFS_DIR("namespaces", aa_sfs_entry_ns),
2280 AA_SFS_FILE_U64("capability", VFS_CAP_FLAGS_MASK),
2281 AA_SFS_DIR("rlimit", aa_sfs_entry_rlimit),
2282 AA_SFS_DIR("caps", aa_sfs_entry_caps),
2283 AA_SFS_DIR("ptrace", aa_sfs_entry_ptrace),
2284 AA_SFS_DIR("signal", aa_sfs_entry_signal),
2285 AA_SFS_DIR("query", aa_sfs_entry_query),
2289 static struct aa_sfs_entry aa_sfs_entry_apparmor[] = {
2290 AA_SFS_FILE_FOPS(".access", 0666, &aa_sfs_access),
2291 AA_SFS_FILE_FOPS(".stacked", 0444, &seq_ns_stacked_fops),
2292 AA_SFS_FILE_FOPS(".ns_stacked", 0444, &seq_ns_nsstacked_fops),
2293 AA_SFS_FILE_FOPS(".ns_level", 0444, &seq_ns_level_fops),
2294 AA_SFS_FILE_FOPS(".ns_name", 0444, &seq_ns_name_fops),
2295 AA_SFS_FILE_FOPS("profiles", 0444, &aa_sfs_profiles_fops),
2296 AA_SFS_DIR("features", aa_sfs_entry_features),
2300 static struct aa_sfs_entry aa_sfs_entry =
2301 AA_SFS_DIR("apparmor", aa_sfs_entry_apparmor);
2304 * entry_create_file - create a file entry in the apparmor securityfs
2305 * @fs_file: aa_sfs_entry to build an entry for (NOT NULL)
2306 * @parent: the parent dentry in the securityfs
2308 * Use entry_remove_file to remove entries created with this fn.
2310 static int __init entry_create_file(struct aa_sfs_entry *fs_file,
2311 struct dentry *parent)
2315 fs_file->dentry = securityfs_create_file(fs_file->name,
2316 S_IFREG | fs_file->mode,
2319 if (IS_ERR(fs_file->dentry)) {
2320 error = PTR_ERR(fs_file->dentry);
2321 fs_file->dentry = NULL;
2326 static void __init entry_remove_dir(struct aa_sfs_entry *fs_dir);
2328 * entry_create_dir - recursively create a directory entry in the securityfs
2329 * @fs_dir: aa_sfs_entry (and all child entries) to build (NOT NULL)
2330 * @parent: the parent dentry in the securityfs
2332 * Use entry_remove_dir to remove entries created with this fn.
2334 static int __init entry_create_dir(struct aa_sfs_entry *fs_dir,
2335 struct dentry *parent)
2337 struct aa_sfs_entry *fs_file;
2341 dir = securityfs_create_dir(fs_dir->name, parent);
2343 return PTR_ERR(dir);
2344 fs_dir->dentry = dir;
2346 for (fs_file = fs_dir->v.files; fs_file && fs_file->name; ++fs_file) {
2347 if (fs_file->v_type == AA_SFS_TYPE_DIR)
2348 error = entry_create_dir(fs_file, fs_dir->dentry);
2350 error = entry_create_file(fs_file, fs_dir->dentry);
2358 entry_remove_dir(fs_dir);
2364 * entry_remove_file - drop a single file entry in the apparmor securityfs
2365 * @fs_file: aa_sfs_entry to detach from the securityfs (NOT NULL)
2367 static void __init entry_remove_file(struct aa_sfs_entry *fs_file)
2369 if (!fs_file->dentry)
2372 securityfs_remove(fs_file->dentry);
2373 fs_file->dentry = NULL;
2377 * entry_remove_dir - recursively drop a directory entry from the securityfs
2378 * @fs_dir: aa_sfs_entry (and all child entries) to detach (NOT NULL)
2380 static void __init entry_remove_dir(struct aa_sfs_entry *fs_dir)
2382 struct aa_sfs_entry *fs_file;
2384 for (fs_file = fs_dir->v.files; fs_file && fs_file->name; ++fs_file) {
2385 if (fs_file->v_type == AA_SFS_TYPE_DIR)
2386 entry_remove_dir(fs_file);
2388 entry_remove_file(fs_file);
2391 entry_remove_file(fs_dir);
2395 * aa_destroy_aafs - cleanup and free aafs
2397 * releases dentries allocated by aa_create_aafs
2399 void __init aa_destroy_aafs(void)
2401 entry_remove_dir(&aa_sfs_entry);
2405 #define NULL_FILE_NAME ".null"
2406 struct path aa_null;
2408 static int aa_mk_null_file(struct dentry *parent)
2410 struct vfsmount *mount = NULL;
2411 struct dentry *dentry;
2412 struct inode *inode;
2414 int error = simple_pin_fs(parent->d_sb->s_type, &mount, &count);
2419 inode_lock(d_inode(parent));
2420 dentry = lookup_one_len(NULL_FILE_NAME, parent, strlen(NULL_FILE_NAME));
2421 if (IS_ERR(dentry)) {
2422 error = PTR_ERR(dentry);
2425 inode = new_inode(parent->d_inode->i_sb);
2431 inode->i_ino = get_next_ino();
2432 inode->i_mode = S_IFCHR | S_IRUGO | S_IWUGO;
2433 inode->i_atime = inode->i_mtime = inode->i_ctime = current_time(inode);
2434 init_special_inode(inode, S_IFCHR | S_IRUGO | S_IWUGO,
2435 MKDEV(MEM_MAJOR, 3));
2436 d_instantiate(dentry, inode);
2437 aa_null.dentry = dget(dentry);
2438 aa_null.mnt = mntget(mount);
2445 inode_unlock(d_inode(parent));
2446 simple_release_fs(&mount, &count);
2452 static const char *policy_get_link(struct dentry *dentry,
2453 struct inode *inode,
2454 struct delayed_call *done)
2460 return ERR_PTR(-ECHILD);
2461 ns = aa_get_current_ns();
2462 path.mnt = mntget(aafs_mnt);
2463 path.dentry = dget(ns_dir(ns));
2464 nd_jump_link(&path);
2470 static int policy_readlink(struct dentry *dentry, char __user *buffer,
2476 res = snprintf(name, sizeof(name), "%s:[%lu]", AAFS_NAME,
2477 d_inode(dentry)->i_ino);
2478 if (res > 0 && res < sizeof(name))
2479 res = readlink_copy(buffer, buflen, name);
2486 static const struct inode_operations policy_link_iops = {
2487 .readlink = policy_readlink,
2488 .get_link = policy_get_link,
2493 * aa_create_aafs - create the apparmor security filesystem
2495 * dentries created here are released by aa_destroy_aafs
2497 * Returns: error on failure
2499 static int __init aa_create_aafs(void)
2501 struct dentry *dent;
2504 if (!apparmor_initialized)
2507 if (aa_sfs_entry.dentry) {
2508 AA_ERROR("%s: AppArmor securityfs already exists\n", __func__);
2512 /* setup apparmorfs used to virtualize policy/ */
2513 aafs_mnt = kern_mount(&aafs_ops);
2514 if (IS_ERR(aafs_mnt))
2515 panic("can't set apparmorfs up\n");
2516 aafs_mnt->mnt_sb->s_flags &= ~SB_NOUSER;
2518 /* Populate fs tree. */
2519 error = entry_create_dir(&aa_sfs_entry, NULL);
2523 dent = securityfs_create_file(".load", 0666, aa_sfs_entry.dentry,
2524 NULL, &aa_fs_profile_load);
2527 ns_subload(root_ns) = dent;
2529 dent = securityfs_create_file(".replace", 0666, aa_sfs_entry.dentry,
2530 NULL, &aa_fs_profile_replace);
2533 ns_subreplace(root_ns) = dent;
2535 dent = securityfs_create_file(".remove", 0666, aa_sfs_entry.dentry,
2536 NULL, &aa_fs_profile_remove);
2539 ns_subremove(root_ns) = dent;
2541 dent = securityfs_create_file("revision", 0444, aa_sfs_entry.dentry,
2542 NULL, &aa_fs_ns_revision_fops);
2545 ns_subrevision(root_ns) = dent;
2547 /* policy tree referenced by magic policy symlink */
2548 mutex_lock_nested(&root_ns->lock, root_ns->level);
2549 error = __aafs_ns_mkdir(root_ns, aafs_mnt->mnt_root, ".policy",
2550 aafs_mnt->mnt_root);
2551 mutex_unlock(&root_ns->lock);
2555 /* magic symlink similar to nsfs redirects based on task policy */
2556 dent = securityfs_create_symlink("policy", aa_sfs_entry.dentry,
2557 NULL, &policy_link_iops);
2561 error = aa_mk_null_file(aa_sfs_entry.dentry);
2565 /* TODO: add default profile to apparmorfs */
2567 /* Report that AppArmor fs is enabled */
2568 aa_info_message("AppArmor Filesystem Enabled");
2572 error = PTR_ERR(dent);
2575 AA_ERROR("Error creating AppArmor securityfs\n");
2579 fs_initcall(aa_create_aafs);