blob: efe04f54be9edf243d7f96794a8bddc448c02af4 [file] [log] [blame]
b.liue9582032025-04-17 19:18:16 +08001// SPDX-License-Identifier: GPL-2.0-only
2/*
3 * AppArmor security module
4 *
5 * This file contains AppArmor /sys/kernel/security/apparmor interface functions
6 *
7 * Copyright (C) 1998-2008 Novell/SUSE
8 * Copyright 2009-2010 Canonical Ltd.
9 */
10
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>
21#include <linux/fs.h>
22#include <linux/fs_context.h>
23#include <linux/poll.h>
24#include <uapi/linux/major.h>
25#include <uapi/linux/magic.h>
26
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"
38
39/*
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.
45 *
46 * fns and data are prefixed with
47 * aa_sfs_
48 *
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.
55 *
56 * fns and data are prefixed with
57 * aafs_
58 *
59 * The aa_fs_ prefix is used to indicate the fn is used by both the
60 * securityfs and apparmorfs filesystems.
61 */
62
63
64/*
65 * support fns
66 */
67
68/**
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)
72 *
73 * Returns: length of mangled name
74 */
75static int mangle_name(const char *name, char *target)
76{
77 char *t = target;
78
79 while (*name == '/' || *name == '.')
80 name++;
81
82 if (target) {
83 for (; *name; name++) {
84 if (*name == '/')
85 *(t)++ = '.';
86 else if (isspace(*name))
87 *(t)++ = '_';
88 else if (isalnum(*name) || strchr("._-", *name))
89 *(t)++ = *name;
90 }
91
92 *t = 0;
93 } else {
94 int len = 0;
95 for (; *name; name++) {
96 if (isalnum(*name) || isspace(*name) ||
97 strchr("/._-", *name))
98 len++;
99 }
100
101 return len;
102 }
103
104 return t - target;
105}
106
107
108/*
109 * aafs - core fns and data for the policy tree
110 */
111
112#define AAFS_NAME "apparmorfs"
113static struct vfsmount *aafs_mnt;
114static int aafs_count;
115
116
117static int aafs_show_path(struct seq_file *seq, struct dentry *dentry)
118{
119 seq_printf(seq, "%s:[%lu]", AAFS_NAME, d_inode(dentry)->i_ino);
120 return 0;
121}
122
123static void aafs_free_inode(struct inode *inode)
124{
125 if (S_ISLNK(inode->i_mode))
126 kfree(inode->i_link);
127 free_inode_nonrcu(inode);
128}
129
130static const struct super_operations aafs_super_ops = {
131 .statfs = simple_statfs,
132 .free_inode = aafs_free_inode,
133 .show_path = aafs_show_path,
134};
135
136static int apparmorfs_fill_super(struct super_block *sb, struct fs_context *fc)
137{
138 static struct tree_descr files[] = { {""} };
139 int error;
140
141 error = simple_fill_super(sb, AAFS_MAGIC, files);
142 if (error)
143 return error;
144 sb->s_op = &aafs_super_ops;
145
146 return 0;
147}
148
149static int apparmorfs_get_tree(struct fs_context *fc)
150{
151 return get_tree_single(fc, apparmorfs_fill_super);
152}
153
154static const struct fs_context_operations apparmorfs_context_ops = {
155 .get_tree = apparmorfs_get_tree,
156};
157
158static int apparmorfs_init_fs_context(struct fs_context *fc)
159{
160 fc->ops = &apparmorfs_context_ops;
161 return 0;
162}
163
164static struct file_system_type aafs_ops = {
165 .owner = THIS_MODULE,
166 .name = AAFS_NAME,
167 .init_fs_context = apparmorfs_init_fs_context,
168 .kill_sb = kill_anon_super,
169};
170
171/**
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
180 */
181static 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)
185{
186 struct inode *inode = new_inode(dir->i_sb);
187
188 AA_BUG(!dir);
189 AA_BUG(!dentry);
190
191 if (!inode)
192 return -ENOMEM;
193
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;
198 if (S_ISDIR(mode)) {
199 inode->i_op = iops ? iops : &simple_dir_inode_operations;
200 inode->i_fop = &simple_dir_operations;
201 inc_nlink(inode);
202 inc_nlink(dir);
203 } else if (S_ISLNK(mode)) {
204 inode->i_op = iops ? iops : &simple_symlink_inode_operations;
205 inode->i_link = link;
206 } else {
207 inode->i_fop = fops;
208 }
209 d_instantiate(dentry, inode);
210 dget(dentry);
211
212 return 0;
213}
214
215/**
216 * aafs_create - create a dentry in the apparmorfs filesystem
217 *
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
225 *
226 * This is the basic "create a xxx" function for apparmorfs.
227 *
228 * Returns a pointer to a dentry if it succeeds, that must be free with
229 * aafs_remove(). Will return ERR_PTR on failure.
230 */
231static 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)
235{
236 struct dentry *dentry;
237 struct inode *dir;
238 int error;
239
240 AA_BUG(!name);
241 AA_BUG(!parent);
242
243 if (!(mode & S_IFMT))
244 mode = (mode & S_IALLUGO) | S_IFREG;
245
246 error = simple_pin_fs(&aafs_ops, &aafs_mnt, &aafs_count);
247 if (error)
248 return ERR_PTR(error);
249
250 dir = d_inode(parent);
251
252 inode_lock(dir);
253 dentry = lookup_one_len(name, parent, strlen(name));
254 if (IS_ERR(dentry)) {
255 error = PTR_ERR(dentry);
256 goto fail_lock;
257 }
258
259 if (d_really_is_positive(dentry)) {
260 error = -EEXIST;
261 goto fail_dentry;
262 }
263
264 error = __aafs_setup_d_inode(dir, dentry, mode, data, link, fops, iops);
265 if (error)
266 goto fail_dentry;
267 inode_unlock(dir);
268
269 return dentry;
270
271fail_dentry:
272 dput(dentry);
273
274fail_lock:
275 inode_unlock(dir);
276 simple_release_fs(&aafs_mnt, &aafs_count);
277
278 return ERR_PTR(error);
279}
280
281/**
282 * aafs_create_file - create a file in the apparmorfs filesystem
283 *
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
289 *
290 * see aafs_create
291 */
292static struct dentry *aafs_create_file(const char *name, umode_t mode,
293 struct dentry *parent, void *data,
294 const struct file_operations *fops)
295{
296 return aafs_create(name, mode, parent, data, NULL, fops, NULL);
297}
298
299/**
300 * aafs_create_dir - create a directory in the apparmorfs filesystem
301 *
302 * @name: name of dentry to create
303 * @parent: parent directory for this dentry
304 *
305 * see aafs_create
306 */
307static struct dentry *aafs_create_dir(const char *name, struct dentry *parent)
308{
309 return aafs_create(name, S_IFDIR | 0755, parent, NULL, NULL, NULL,
310 NULL);
311}
312
313/**
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
320 *
321 * If @target parameter is %NULL, then the @iops parameter needs to be
322 * setup to handle .readlink and .get_link inode_operations.
323 */
324static struct dentry *aafs_create_symlink(const char *name,
325 struct dentry *parent,
326 const char *target,
327 void *private,
328 const struct inode_operations *iops)
329{
330 struct dentry *dent;
331 char *link = NULL;
332
333 if (target) {
334 if (!link)
335 return ERR_PTR(-ENOMEM);
336 }
337 dent = aafs_create(name, S_IFLNK | 0444, parent, private, link, NULL,
338 iops);
339 if (IS_ERR(dent))
340 kfree(link);
341
342 return dent;
343}
344
345/**
346 * aafs_remove - removes a file or directory from the apparmorfs filesystem
347 *
348 * @dentry: dentry of the file/directory/symlink to removed.
349 */
350static void aafs_remove(struct dentry *dentry)
351{
352 struct inode *dir;
353
354 if (!dentry || IS_ERR(dentry))
355 return;
356
357 dir = d_inode(dentry->d_parent);
358 inode_lock(dir);
359 if (simple_positive(dentry)) {
360 if (d_is_dir(dentry))
361 simple_rmdir(dir, dentry);
362 else
363 simple_unlink(dir, dentry);
364 d_delete(dentry);
365 dput(dentry);
366 }
367 inode_unlock(dir);
368 simple_release_fs(&aafs_mnt, &aafs_count);
369}
370
371
372/*
373 * aa_fs - policy load/replace/remove
374 */
375
376/**
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)
382 *
383 * Returns: kernel buffer containing copy of user buffer data or an
384 * ERR_PTR on failure.
385 */
386static struct aa_loaddata *aa_simple_write_to_buffer(const char __user *userbuf,
387 size_t alloc_size,
388 size_t copy_size,
389 loff_t *pos)
390{
391 struct aa_loaddata *data;
392
393 AA_BUG(copy_size > alloc_size);
394
395 if (*pos != 0)
396 /* only writes from pos 0, that is complete writes */
397 return ERR_PTR(-ESPIPE);
398
399 /* freed by caller to simple_write_to_buffer */
400 data = aa_loaddata_alloc(alloc_size);
401 if (IS_ERR(data))
402 return data;
403
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);
408 }
409
410 return data;
411}
412
413static ssize_t policy_update(u32 mask, const char __user *buf, size_t size,
414 loff_t *pos, struct aa_ns *ns)
415{
416 struct aa_loaddata *data;
417 struct aa_label *label;
418 ssize_t error;
419
420 label = begin_current_label_crit_section();
421
422 /* high level check about policy management - fine grained in
423 * below after unpack
424 */
425 error = aa_may_manage_policy(label, ns, mask);
426 if (error)
427 goto end_section;
428
429 data = aa_simple_write_to_buffer(buf, size, size, pos);
430 error = PTR_ERR(data);
431 if (!IS_ERR(data)) {
432 error = aa_replace_profiles(ns, label, mask, data);
433 aa_put_loaddata(data);
434 }
435end_section:
436 end_current_label_crit_section(label);
437
438 return error;
439}
440
441/* .load file hook fn to load policy */
442static ssize_t profile_load(struct file *f, const char __user *buf, size_t size,
443 loff_t *pos)
444{
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);
447
448 aa_put_ns(ns);
449
450 return error;
451}
452
453static const struct file_operations aa_fs_profile_load = {
454 .write = profile_load,
455 .llseek = default_llseek,
456};
457
458/* .replace file hook fn to load and/or replace policy */
459static ssize_t profile_replace(struct file *f, const char __user *buf,
460 size_t size, loff_t *pos)
461{
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,
464 buf, size, pos, ns);
465 aa_put_ns(ns);
466
467 return error;
468}
469
470static const struct file_operations aa_fs_profile_replace = {
471 .write = profile_replace,
472 .llseek = default_llseek,
473};
474
475/* .remove file hook fn to remove loaded policy */
476static ssize_t profile_remove(struct file *f, const char __user *buf,
477 size_t size, loff_t *pos)
478{
479 struct aa_loaddata *data;
480 struct aa_label *label;
481 ssize_t error;
482 struct aa_ns *ns = aa_get_ns(f->f_inode->i_private);
483
484 label = begin_current_label_crit_section();
485 /* high level check about policy management - fine grained in
486 * below after unpack
487 */
488 error = aa_may_manage_policy(label, ns, AA_MAY_REMOVE_POLICY);
489 if (error)
490 goto out;
491
492 /*
493 * aa_remove_profile needs a null terminated string so 1 extra
494 * byte is allocated and the copied data is null terminated.
495 */
496 data = aa_simple_write_to_buffer(buf, size + 1, size, pos);
497
498 error = PTR_ERR(data);
499 if (!IS_ERR(data)) {
500 data->data[size] = 0;
501 error = aa_remove_profiles(ns, label, data->data, size);
502 aa_put_loaddata(data);
503 }
504 out:
505 end_current_label_crit_section(label);
506 aa_put_ns(ns);
507 return error;
508}
509
510static const struct file_operations aa_fs_profile_remove = {
511 .write = profile_remove,
512 .llseek = default_llseek,
513};
514
515struct aa_revision {
516 struct aa_ns *ns;
517 long last_read;
518};
519
520/* revision file hook fn for policy loads */
521static int ns_revision_release(struct inode *inode, struct file *file)
522{
523 struct aa_revision *rev = file->private_data;
524
525 if (rev) {
526 aa_put_ns(rev->ns);
527 kfree(rev);
528 }
529
530 return 0;
531}
532
533static ssize_t ns_revision_read(struct file *file, char __user *buf,
534 size_t size, loff_t *ppos)
535{
536 struct aa_revision *rev = file->private_data;
537 char buffer[32];
538 long last_read;
539 int avail;
540
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)
546 return -EAGAIN;
547 if (wait_event_interruptible(rev->ns->wait,
548 last_read !=
549 READ_ONCE(rev->ns->revision)))
550 return -ERESTARTSYS;
551 mutex_lock_nested(&rev->ns->lock, rev->ns->level);
552 }
553
554 avail = sprintf(buffer, "%ld\n", rev->ns->revision);
555 if (*ppos + size > avail) {
556 rev->last_read = rev->ns->revision;
557 *ppos = 0;
558 }
559 mutex_unlock(&rev->ns->lock);
560
561 return simple_read_from_buffer(buf, size, ppos, buffer, avail);
562}
563
564static int ns_revision_open(struct inode *inode, struct file *file)
565{
566 struct aa_revision *rev = kzalloc(sizeof(*rev), GFP_KERNEL);
567
568 if (!rev)
569 return -ENOMEM;
570
571 rev->ns = aa_get_ns(inode->i_private);
572 if (!rev->ns)
573 rev->ns = aa_get_current_ns();
574 file->private_data = rev;
575
576 return 0;
577}
578
579static __poll_t ns_revision_poll(struct file *file, poll_table *pt)
580{
581 struct aa_revision *rev = file->private_data;
582 __poll_t mask = 0;
583
584 if (rev) {
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);
590 }
591
592 return mask;
593}
594
595void __aa_bump_ns_revision(struct aa_ns *ns)
596{
597 WRITE_ONCE(ns->revision, ns->revision + 1);
598 wake_up_interruptible(&ns->wait);
599}
600
601static 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,
608};
609
610static void profile_query_cb(struct aa_profile *profile, struct aa_perms *perms,
611 const char *match_str, size_t match_len)
612{
613 struct aa_perms tmp = { };
614 struct aa_dfa *dfa;
615 unsigned int state = 0;
616
617 if (profile_unconfined(profile))
618 return;
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);
623 if (state) {
624 struct path_cond cond = { };
625
626 tmp = aa_compute_fperms(dfa, state, &cond);
627 }
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);
634 if (state)
635 aa_compute_perms(dfa, state, &tmp);
636 }
637 aa_apply_modes_to_perms(profile, &tmp);
638 aa_perms_accum_raw(perms, &tmp);
639}
640
641
642/**
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
648 *
649 * The buffers pointed to by buf and query may overlap. The query buffer is
650 * parsed before buf is written to.
651 *
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.
655 *
656 * Don't expect the contents of buf to be preserved on failure.
657 *
658 * Returns: number of characters written to buf or -errno on failure
659 */
660static ssize_t query_data(char *buf, size_t buf_len,
661 char *query, size_t query_len)
662{
663 char *out;
664 const char *key;
665 struct label_it i;
666 struct aa_label *label, *curr;
667 struct aa_profile *profile;
668 struct aa_data *data;
669 u32 bytes, blocks;
670 __le32 outle32;
671
672 if (!query_len)
673 return -EINVAL; /* need a query */
674
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 */
680
681 if (buf_len < sizeof(bytes) + sizeof(blocks))
682 return -EINVAL; /* not enough space */
683
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);
687 if (IS_ERR(label))
688 return PTR_ERR(label);
689
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.
693 *
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
696 * the same key.
697 */
698 memset(buf, 0, sizeof(bytes) + sizeof(blocks));
699 out = buf + sizeof(bytes) + sizeof(blocks);
700
701 blocks = 0;
702 label_for_each_confined(i, label, profile) {
703 if (!profile->data)
704 continue;
705
706 data = rhashtable_lookup_fast(profile->data, &key,
707 profile->data->p);
708
709 if (data) {
710 if (out + sizeof(outle32) + data->size > buf +
711 buf_len) {
712 aa_put_label(label);
713 return -EINVAL; /* not enough space */
714 }
715 outle32 = __cpu_to_le32(data->size);
716 memcpy(out, &outle32, sizeof(outle32));
717 out += sizeof(outle32);
718 memcpy(out, data->data, data->size);
719 out += data->size;
720 blocks++;
721 }
722 }
723 aa_put_label(label);
724
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));
729
730 return out - buf;
731}
732
733/**
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
740 *
741 * The buffers pointed to by buf and query may overlap. The query buffer is
742 * parsed before buf is written to.
743 *
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.
747 *
748 * LABEL_NAME must be NUL terminated. DFA_STRING may contain NUL characters
749 * but must *not* be NUL terminated.
750 *
751 * Returns: number of characters written to buf or -errno on failure
752 */
753static ssize_t query_label(char *buf, size_t buf_len,
754 char *query, size_t query_len, bool view_only)
755{
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;
761 struct label_it i;
762
763 if (!query_len)
764 return -EINVAL;
765
766 label_name = query;
767 label_name_len = strnlen(query, query_len);
768 if (!label_name_len || label_name_len == query_len)
769 return -EINVAL;
770
771 /**
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.
776 */
777 match_str = label_name + label_name_len + 1;
778 match_len = query_len - label_name_len - 1;
779
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);
783 if (IS_ERR(label))
784 return PTR_ERR(label);
785
786 perms = allperms;
787 if (view_only) {
788 label_for_each_in_ns(i, labels_ns(label), label, profile) {
789 profile_query_cb(profile, &perms, match_str, match_len);
790 }
791 } else {
792 label_for_each(i, label, profile) {
793 profile_query_cb(profile, &perms, match_str, match_len);
794 }
795 }
796 aa_put_label(label);
797
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);
801}
802
803/*
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.
809 */
810struct multi_transaction {
811 struct kref count;
812 ssize_t size;
813 char data[0];
814};
815
816#define MULTI_TRANSACTION_LIMIT (PAGE_SIZE - sizeof(struct multi_transaction))
817/* TODO: replace with per file lock */
818static DEFINE_SPINLOCK(multi_transaction_lock);
819
820static void multi_transaction_kref(struct kref *kref)
821{
822 struct multi_transaction *t;
823
824 t = container_of(kref, struct multi_transaction, count);
825 free_page((unsigned long) t);
826}
827
828static struct multi_transaction *
829get_multi_transaction(struct multi_transaction *t)
830{
831 if (t)
832 kref_get(&(t->count));
833
834 return t;
835}
836
837static void put_multi_transaction(struct multi_transaction *t)
838{
839 if (t)
840 kref_put(&(t->count), multi_transaction_kref);
841}
842
843/* does not increment @new's count */
844static void multi_transaction_set(struct file *file,
845 struct multi_transaction *new, size_t n)
846{
847 struct multi_transaction *old;
848
849 AA_BUG(n > MULTI_TRANSACTION_LIMIT);
850
851 new->size = n;
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);
857}
858
859static struct multi_transaction *multi_transaction_new(struct file *file,
860 const char __user *buf,
861 size_t size)
862{
863 struct multi_transaction *t;
864
865 if (size > MULTI_TRANSACTION_LIMIT - 1)
866 return ERR_PTR(-EFBIG);
867
868 t = (struct multi_transaction *)get_zeroed_page(GFP_KERNEL);
869 if (!t)
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);
875 }
876
877 return t;
878}
879
880static ssize_t multi_transaction_read(struct file *file, char __user *buf,
881 size_t size, loff_t *pos)
882{
883 struct multi_transaction *t;
884 ssize_t ret;
885
886 spin_lock(&multi_transaction_lock);
887 t = get_multi_transaction(file->private_data);
888 spin_unlock(&multi_transaction_lock);
889 if (!t)
890 return 0;
891
892 ret = simple_read_from_buffer(buf, size, pos, t->data, t->size);
893 put_multi_transaction(t);
894
895 return ret;
896}
897
898static int multi_transaction_release(struct inode *inode, struct file *file)
899{
900 put_multi_transaction(file->private_data);
901
902 return 0;
903}
904
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
913
914/**
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)
920 *
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.
924 *
925 * For permissions queries, ubuf must begin with "label\0", followed by the
926 * profile query specific format described in the query_label() function
927 * documentation.
928 *
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.
932 *
933 * Returns: number of bytes written or -errno on failure
934 */
935static ssize_t aa_write_access(struct file *file, const char __user *ubuf,
936 size_t count, loff_t *ppos)
937{
938 struct multi_transaction *t;
939 ssize_t len;
940
941 if (*ppos)
942 return -ESPIPE;
943
944 t = multi_transaction_new(file, ubuf, count);
945 if (IS_ERR(t))
946 return PTR_ERR(t);
947
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);
969 } else
970 len = -EINVAL;
971
972 if (len < 0) {
973 put_multi_transaction(t);
974 return len;
975 }
976
977 multi_transaction_set(file, t, len);
978
979 return count;
980}
981
982static 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,
987};
988
989static int aa_sfs_seq_show(struct seq_file *seq, void *v)
990{
991 struct aa_sfs_entry *fs_file = seq->private;
992
993 if (!fs_file)
994 return 0;
995
996 switch (fs_file->v_type) {
997 case AA_SFS_TYPE_BOOLEAN:
998 seq_printf(seq, "%s\n", fs_file->v.boolean ? "yes" : "no");
999 break;
1000 case AA_SFS_TYPE_STRING:
1001 seq_printf(seq, "%s\n", fs_file->v.string);
1002 break;
1003 case AA_SFS_TYPE_U64:
1004 seq_printf(seq, "%#08lx\n", fs_file->v.u64);
1005 break;
1006 default:
1007 /* Ignore unpritable entry types. */
1008 break;
1009 }
1010
1011 return 0;
1012}
1013
1014static int aa_sfs_seq_open(struct inode *inode, struct file *file)
1015{
1016 return single_open(file, aa_sfs_seq_show, inode->i_private);
1017}
1018
1019const struct file_operations aa_sfs_seq_file_ops = {
1020 .owner = THIS_MODULE,
1021 .open = aa_sfs_seq_open,
1022 .read = seq_read,
1023 .llseek = seq_lseek,
1024 .release = single_release,
1025};
1026
1027/*
1028 * profile based file operations
1029 * policy/profiles/XXXX/profiles/ *
1030 */
1031
1032#define SEQ_PROFILE_FOPS(NAME) \
1033static int seq_profile_ ##NAME ##_open(struct inode *inode, struct file *file)\
1034{ \
1035 return seq_profile_open(inode, file, seq_profile_ ##NAME ##_show); \
1036} \
1037 \
1038static const struct file_operations seq_profile_ ##NAME ##_fops = { \
1039 .owner = THIS_MODULE, \
1040 .open = seq_profile_ ##NAME ##_open, \
1041 .read = seq_read, \
1042 .llseek = seq_lseek, \
1043 .release = seq_profile_release, \
1044} \
1045
1046static int seq_profile_open(struct inode *inode, struct file *file,
1047 int (*show)(struct seq_file *, void *))
1048{
1049 struct aa_proxy *proxy = aa_get_proxy(inode->i_private);
1050 int error = single_open(file, show, proxy);
1051
1052 if (error) {
1053 file->private_data = NULL;
1054 aa_put_proxy(proxy);
1055 }
1056
1057 return error;
1058}
1059
1060static int seq_profile_release(struct inode *inode, struct file *file)
1061{
1062 struct seq_file *seq = (struct seq_file *) file->private_data;
1063 if (seq)
1064 aa_put_proxy(seq->private);
1065 return single_release(inode, file);
1066}
1067
1068static int seq_profile_name_show(struct seq_file *seq, void *v)
1069{
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);
1075
1076 return 0;
1077}
1078
1079static int seq_profile_mode_show(struct seq_file *seq, void *v)
1080{
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);
1086
1087 return 0;
1088}
1089
1090static int seq_profile_attach_show(struct seq_file *seq, void *v)
1091{
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");
1099 else
1100 seq_printf(seq, "%s\n", profile->base.name);
1101 aa_put_label(label);
1102
1103 return 0;
1104}
1105
1106static int seq_profile_hash_show(struct seq_file *seq, void *v)
1107{
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();
1112
1113 if (profile->hash) {
1114 for (i = 0; i < size; i++)
1115 seq_printf(seq, "%.2x", profile->hash[i]);
1116 seq_putc(seq, '\n');
1117 }
1118 aa_put_label(label);
1119
1120 return 0;
1121}
1122
1123SEQ_PROFILE_FOPS(name);
1124SEQ_PROFILE_FOPS(mode);
1125SEQ_PROFILE_FOPS(attach);
1126SEQ_PROFILE_FOPS(hash);
1127
1128/*
1129 * namespace based files
1130 * several root files and
1131 * policy/ *
1132 */
1133
1134#define SEQ_NS_FOPS(NAME) \
1135static int seq_ns_ ##NAME ##_open(struct inode *inode, struct file *file) \
1136{ \
1137 return single_open(file, seq_ns_ ##NAME ##_show, inode->i_private); \
1138} \
1139 \
1140static const struct file_operations seq_ns_ ##NAME ##_fops = { \
1141 .owner = THIS_MODULE, \
1142 .open = seq_ns_ ##NAME ##_open, \
1143 .read = seq_read, \
1144 .llseek = seq_lseek, \
1145 .release = single_release, \
1146} \
1147
1148static int seq_ns_stacked_show(struct seq_file *seq, void *v)
1149{
1150 struct aa_label *label;
1151
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);
1155
1156 return 0;
1157}
1158
1159static int seq_ns_nsstacked_show(struct seq_file *seq, void *v)
1160{
1161 struct aa_label *label;
1162 struct aa_profile *profile;
1163 struct label_it it;
1164 int count = 1;
1165
1166 label = begin_current_label_crit_section();
1167
1168 if (label->size > 1) {
1169 label_for_each(it, label, profile)
1170 if (profile->ns != labels_ns(label)) {
1171 count++;
1172 break;
1173 }
1174 }
1175
1176 seq_printf(seq, "%s\n", count > 1 ? "yes" : "no");
1177 end_current_label_crit_section(label);
1178
1179 return 0;
1180}
1181
1182static int seq_ns_level_show(struct seq_file *seq, void *v)
1183{
1184 struct aa_label *label;
1185
1186 label = begin_current_label_crit_section();
1187 seq_printf(seq, "%d\n", labels_ns(label)->level);
1188 end_current_label_crit_section(label);
1189
1190 return 0;
1191}
1192
1193static int seq_ns_name_show(struct seq_file *seq, void *v)
1194{
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);
1198
1199 return 0;
1200}
1201
1202SEQ_NS_FOPS(stacked);
1203SEQ_NS_FOPS(nsstacked);
1204SEQ_NS_FOPS(level);
1205SEQ_NS_FOPS(name);
1206
1207
1208/* policy/raw_data/ * file ops */
1209
1210#define SEQ_RAWDATA_FOPS(NAME) \
1211static int seq_rawdata_ ##NAME ##_open(struct inode *inode, struct file *file)\
1212{ \
1213 return seq_rawdata_open(inode, file, seq_rawdata_ ##NAME ##_show); \
1214} \
1215 \
1216static const struct file_operations seq_rawdata_ ##NAME ##_fops = { \
1217 .owner = THIS_MODULE, \
1218 .open = seq_rawdata_ ##NAME ##_open, \
1219 .read = seq_read, \
1220 .llseek = seq_lseek, \
1221 .release = seq_rawdata_release, \
1222} \
1223
1224static int seq_rawdata_open(struct inode *inode, struct file *file,
1225 int (*show)(struct seq_file *, void *))
1226{
1227 struct aa_loaddata *data = __aa_get_loaddata(inode->i_private);
1228 int error;
1229
1230 if (!data)
1231 /* lost race this ent is being reaped */
1232 return -ENOENT;
1233
1234 error = single_open(file, show, data);
1235 if (error) {
1236 AA_BUG(file->private_data &&
1237 ((struct seq_file *)file->private_data)->private);
1238 aa_put_loaddata(data);
1239 }
1240
1241 return error;
1242}
1243
1244static int seq_rawdata_release(struct inode *inode, struct file *file)
1245{
1246 struct seq_file *seq = (struct seq_file *) file->private_data;
1247
1248 if (seq)
1249 aa_put_loaddata(seq->private);
1250
1251 return single_release(inode, file);
1252}
1253
1254static int seq_rawdata_abi_show(struct seq_file *seq, void *v)
1255{
1256 struct aa_loaddata *data = seq->private;
1257
1258 seq_printf(seq, "v%d\n", data->abi);
1259
1260 return 0;
1261}
1262
1263static int seq_rawdata_revision_show(struct seq_file *seq, void *v)
1264{
1265 struct aa_loaddata *data = seq->private;
1266
1267 seq_printf(seq, "%ld\n", data->revision);
1268
1269 return 0;
1270}
1271
1272static int seq_rawdata_hash_show(struct seq_file *seq, void *v)
1273{
1274 struct aa_loaddata *data = seq->private;
1275 unsigned int i, size = aa_hash_size();
1276
1277 if (data->hash) {
1278 for (i = 0; i < size; i++)
1279 seq_printf(seq, "%.2x", data->hash[i]);
1280 seq_putc(seq, '\n');
1281 }
1282
1283 return 0;
1284}
1285
1286SEQ_RAWDATA_FOPS(abi);
1287SEQ_RAWDATA_FOPS(revision);
1288SEQ_RAWDATA_FOPS(hash);
1289
1290static ssize_t rawdata_read(struct file *file, char __user *buf, size_t size,
1291 loff_t *ppos)
1292{
1293 struct aa_loaddata *rawdata = file->private_data;
1294
1295 return simple_read_from_buffer(buf, size, ppos, rawdata->data,
1296 rawdata->size);
1297}
1298
1299static int rawdata_release(struct inode *inode, struct file *file)
1300{
1301 aa_put_loaddata(file->private_data);
1302
1303 return 0;
1304}
1305
1306static int rawdata_open(struct inode *inode, struct file *file)
1307{
1308 if (!policy_view_capable(NULL))
1309 return -EACCES;
1310 file->private_data = __aa_get_loaddata(inode->i_private);
1311 if (!file->private_data)
1312 /* lost race: this entry is being reaped */
1313 return -ENOENT;
1314
1315 return 0;
1316}
1317
1318static const struct file_operations rawdata_fops = {
1319 .open = rawdata_open,
1320 .read = rawdata_read,
1321 .llseek = generic_file_llseek,
1322 .release = rawdata_release,
1323};
1324
1325static void remove_rawdata_dents(struct aa_loaddata *rawdata)
1326{
1327 int i;
1328
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;
1334 }
1335 }
1336}
1337
1338void __aa_fs_remove_rawdata(struct aa_loaddata *rawdata)
1339{
1340 AA_BUG(rawdata->ns && !mutex_is_locked(&rawdata->ns->lock));
1341
1342 if (rawdata->ns) {
1343 remove_rawdata_dents(rawdata);
1344 list_del_init(&rawdata->list);
1345 aa_put_ns(rawdata->ns);
1346 rawdata->ns = NULL;
1347 }
1348}
1349
1350int __aa_fs_create_rawdata(struct aa_ns *ns, struct aa_loaddata *rawdata)
1351{
1352 struct dentry *dent, *dir;
1353
1354 AA_BUG(!ns);
1355 AA_BUG(!rawdata);
1356 AA_BUG(!mutex_is_locked(&ns->lock));
1357 AA_BUG(!ns_subdata_dir(ns));
1358
1359 /*
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
1363 */
1364 rawdata->name = kasprintf(GFP_KERNEL, "%ld", ns->revision);
1365 if (!rawdata->name)
1366 return -ENOMEM;
1367
1368 dir = aafs_create_dir(rawdata->name, ns_subdata_dir(ns));
1369 if (IS_ERR(dir))
1370 /* ->name freed when rawdata freed */
1371 return PTR_ERR(dir);
1372 rawdata->dents[AAFS_LOADDATA_DIR] = dir;
1373
1374 dent = aafs_create_file("abi", S_IFREG | 0444, dir, rawdata,
1375 &seq_rawdata_abi_fops);
1376 if (IS_ERR(dent))
1377 goto fail;
1378 rawdata->dents[AAFS_LOADDATA_ABI] = dent;
1379
1380 dent = aafs_create_file("revision", S_IFREG | 0444, dir, rawdata,
1381 &seq_rawdata_revision_fops);
1382 if (IS_ERR(dent))
1383 goto fail;
1384 rawdata->dents[AAFS_LOADDATA_REVISION] = dent;
1385
1386 if (aa_g_hash_policy) {
1387 dent = aafs_create_file("sha1", S_IFREG | 0444, dir,
1388 rawdata, &seq_rawdata_hash_fops);
1389 if (IS_ERR(dent))
1390 goto fail;
1391 rawdata->dents[AAFS_LOADDATA_HASH] = dent;
1392 }
1393
1394 dent = aafs_create_file("raw_data", S_IFREG | 0444,
1395 dir, rawdata, &rawdata_fops);
1396 if (IS_ERR(dent))
1397 goto fail;
1398 rawdata->dents[AAFS_LOADDATA_DATA] = dent;
1399 d_inode(dent)->i_size = rawdata->size;
1400
1401 rawdata->ns = aa_get_ns(ns);
1402 list_add(&rawdata->list, &ns->rawdata_list);
1403 /* no refcount on inode rawdata */
1404
1405 return 0;
1406
1407fail:
1408 remove_rawdata_dents(rawdata);
1409
1410 return PTR_ERR(dent);
1411}
1412
1413/** fns to setup dynamic per profile/namespace files **/
1414
1415/**
1416 *
1417 * Requires: @profile->ns->lock held
1418 */
1419void __aafs_profile_rmdir(struct aa_profile *profile)
1420{
1421 struct aa_profile *child;
1422 int i;
1423
1424 if (!profile)
1425 return;
1426
1427 list_for_each_entry(child, &profile->base.profiles, base.list)
1428 __aafs_profile_rmdir(child);
1429
1430 for (i = AAFS_PROF_SIZEOF - 1; i >= 0; --i) {
1431 struct aa_proxy *proxy;
1432 if (!profile->dents[i])
1433 continue;
1434
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;
1439 }
1440}
1441
1442/**
1443 *
1444 * Requires: @old->ns->lock held
1445 */
1446void __aafs_profile_migrate_dents(struct aa_profile *old,
1447 struct aa_profile *new)
1448{
1449 int i;
1450
1451 AA_BUG(!old);
1452 AA_BUG(!new);
1453 AA_BUG(!mutex_is_locked(&profiles_ns(old)->lock));
1454
1455 for (i = 0; i < AAFS_PROF_SIZEOF; i++) {
1456 new->dents[i] = old->dents[i];
1457 if (new->dents[i])
1458 new->dents[i]->d_inode->i_mtime = current_time(new->dents[i]->d_inode);
1459 old->dents[i] = NULL;
1460 }
1461}
1462
1463static struct dentry *create_profile_file(struct dentry *dir, const char *name,
1464 struct aa_profile *profile,
1465 const struct file_operations *fops)
1466{
1467 struct aa_proxy *proxy = aa_get_proxy(profile->label.proxy);
1468 struct dentry *dent;
1469
1470 dent = aafs_create_file(name, S_IFREG | 0444, dir, proxy, fops);
1471 if (IS_ERR(dent))
1472 aa_put_proxy(proxy);
1473
1474 return dent;
1475}
1476
1477static int profile_depth(struct aa_profile *profile)
1478{
1479 int depth = 0;
1480
1481 rcu_read_lock();
1482 for (depth = 0; profile; profile = rcu_access_pointer(profile->parent))
1483 depth++;
1484 rcu_read_unlock();
1485
1486 return depth;
1487}
1488
1489static char *gen_symlink_name(int depth, const char *dirname, const char *fname)
1490{
1491 char *buffer, *s;
1492 int error;
1493 int size = depth * 6 + strlen(dirname) + strlen(fname) + 11;
1494
1495 s = buffer = kmalloc(size, GFP_KERNEL);
1496 if (!buffer)
1497 return ERR_PTR(-ENOMEM);
1498
1499 for (; depth > 0; depth--) {
1500 strcpy(s, "../../");
1501 s += 6;
1502 size -= 6;
1503 }
1504
1505 error = snprintf(s, size, "raw_data/%s/%s", dirname, fname);
1506 if (error >= size || error < 0) {
1507 kfree(buffer);
1508 return ERR_PTR(-ENAMETOOLONG);
1509 }
1510
1511 return buffer;
1512}
1513
1514static void rawdata_link_cb(void *arg)
1515{
1516 kfree(arg);
1517}
1518
1519static const char *rawdata_get_link_base(struct dentry *dentry,
1520 struct inode *inode,
1521 struct delayed_call *done,
1522 const char *name)
1523{
1524 struct aa_proxy *proxy = inode->i_private;
1525 struct aa_label *label;
1526 struct aa_profile *profile;
1527 char *target;
1528 int depth;
1529
1530 if (!dentry)
1531 return ERR_PTR(-ECHILD);
1532
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);
1538
1539 if (IS_ERR(target))
1540 return target;
1541
1542 set_delayed_call(done, rawdata_link_cb, target);
1543
1544 return target;
1545}
1546
1547static const char *rawdata_get_link_sha1(struct dentry *dentry,
1548 struct inode *inode,
1549 struct delayed_call *done)
1550{
1551 return rawdata_get_link_base(dentry, inode, done, "sha1");
1552}
1553
1554static const char *rawdata_get_link_abi(struct dentry *dentry,
1555 struct inode *inode,
1556 struct delayed_call *done)
1557{
1558 return rawdata_get_link_base(dentry, inode, done, "abi");
1559}
1560
1561static const char *rawdata_get_link_data(struct dentry *dentry,
1562 struct inode *inode,
1563 struct delayed_call *done)
1564{
1565 return rawdata_get_link_base(dentry, inode, done, "raw_data");
1566}
1567
1568static const struct inode_operations rawdata_link_sha1_iops = {
1569 .get_link = rawdata_get_link_sha1,
1570};
1571
1572static const struct inode_operations rawdata_link_abi_iops = {
1573 .get_link = rawdata_get_link_abi,
1574};
1575static const struct inode_operations rawdata_link_data_iops = {
1576 .get_link = rawdata_get_link_data,
1577};
1578
1579
1580/*
1581 * Requires: @profile->ns->lock held
1582 */
1583int __aafs_profile_mkdir(struct aa_profile *profile, struct dentry *parent)
1584{
1585 struct aa_profile *child;
1586 struct dentry *dent = NULL, *dir;
1587 int error;
1588
1589 AA_BUG(!profile);
1590 AA_BUG(!mutex_is_locked(&profiles_ns(profile)->lock));
1591
1592 if (!parent) {
1593 struct aa_profile *p;
1594 p = aa_deref_parent(profile);
1595 dent = prof_dir(p);
1596 if (!dent) {
1597 error = -ENOENT;
1598 goto fail2;
1599 }
1600 /* adding to parent that previously didn't have children */
1601 dent = aafs_create_dir("profiles", dent);
1602 if (IS_ERR(dent))
1603 goto fail;
1604 prof_child_dir(p) = parent = dent;
1605 }
1606
1607 if (!profile->dirname) {
1608 int len, id_len;
1609 len = mangle_name(profile->base.name, NULL);
1610 id_len = snprintf(NULL, 0, ".%ld", profile->ns->uniq_id);
1611
1612 profile->dirname = kmalloc(len + id_len + 1, GFP_KERNEL);
1613 if (!profile->dirname) {
1614 error = -ENOMEM;
1615 goto fail2;
1616 }
1617
1618 mangle_name(profile->base.name, profile->dirname);
1619 sprintf(profile->dirname + len, ".%ld", profile->ns->uniq_id++);
1620 }
1621
1622 dent = aafs_create_dir(profile->dirname, parent);
1623 if (IS_ERR(dent))
1624 goto fail;
1625 prof_dir(profile) = dir = dent;
1626
1627 dent = create_profile_file(dir, "name", profile,
1628 &seq_profile_name_fops);
1629 if (IS_ERR(dent))
1630 goto fail;
1631 profile->dents[AAFS_PROF_NAME] = dent;
1632
1633 dent = create_profile_file(dir, "mode", profile,
1634 &seq_profile_mode_fops);
1635 if (IS_ERR(dent))
1636 goto fail;
1637 profile->dents[AAFS_PROF_MODE] = dent;
1638
1639 dent = create_profile_file(dir, "attach", profile,
1640 &seq_profile_attach_fops);
1641 if (IS_ERR(dent))
1642 goto fail;
1643 profile->dents[AAFS_PROF_ATTACH] = dent;
1644
1645 if (profile->hash) {
1646 dent = create_profile_file(dir, "sha1", profile,
1647 &seq_profile_hash_fops);
1648 if (IS_ERR(dent))
1649 goto fail;
1650 profile->dents[AAFS_PROF_HASH] = dent;
1651 }
1652
1653 if (profile->rawdata) {
1654 dent = aafs_create_symlink("raw_sha1", dir, NULL,
1655 profile->label.proxy,
1656 &rawdata_link_sha1_iops);
1657 if (IS_ERR(dent))
1658 goto fail;
1659 aa_get_proxy(profile->label.proxy);
1660 profile->dents[AAFS_PROF_RAW_HASH] = dent;
1661
1662 dent = aafs_create_symlink("raw_abi", dir, NULL,
1663 profile->label.proxy,
1664 &rawdata_link_abi_iops);
1665 if (IS_ERR(dent))
1666 goto fail;
1667 aa_get_proxy(profile->label.proxy);
1668 profile->dents[AAFS_PROF_RAW_ABI] = dent;
1669
1670 dent = aafs_create_symlink("raw_data", dir, NULL,
1671 profile->label.proxy,
1672 &rawdata_link_data_iops);
1673 if (IS_ERR(dent))
1674 goto fail;
1675 aa_get_proxy(profile->label.proxy);
1676 profile->dents[AAFS_PROF_RAW_DATA] = dent;
1677 }
1678
1679 list_for_each_entry(child, &profile->base.profiles, base.list) {
1680 error = __aafs_profile_mkdir(child, prof_child_dir(profile));
1681 if (error)
1682 goto fail2;
1683 }
1684
1685 return 0;
1686
1687fail:
1688 error = PTR_ERR(dent);
1689
1690fail2:
1691 __aafs_profile_rmdir(profile);
1692
1693 return error;
1694}
1695
1696static int ns_mkdir_op(struct inode *dir, struct dentry *dentry, umode_t mode)
1697{
1698 struct aa_ns *ns, *parent;
1699 /* TODO: improve permission check */
1700 struct aa_label *label;
1701 int error;
1702
1703 label = begin_current_label_crit_section();
1704 error = aa_may_manage_policy(label, NULL, AA_MAY_LOAD_POLICY);
1705 end_current_label_crit_section(label);
1706 if (error)
1707 return error;
1708
1709 parent = aa_get_ns(dir->i_private);
1710 AA_BUG(d_inode(ns_subns_dir(parent)) != dir);
1711
1712 /* we have to unlock and then relock to get locking order right
1713 * for pin_fs
1714 */
1715 inode_unlock(dir);
1716 error = simple_pin_fs(&aafs_ops, &aafs_mnt, &aafs_count);
1717 mutex_lock_nested(&parent->lock, parent->level);
1718 inode_lock_nested(dir, I_MUTEX_PARENT);
1719 if (error)
1720 goto out;
1721
1722 error = __aafs_setup_d_inode(dir, dentry, mode | S_IFDIR, NULL,
1723 NULL, NULL, NULL);
1724 if (error)
1725 goto out_pin;
1726
1727 ns = __aa_find_or_create_ns(parent, READ_ONCE(dentry->d_name.name),
1728 dentry);
1729 if (IS_ERR(ns)) {
1730 error = PTR_ERR(ns);
1731 ns = NULL;
1732 }
1733
1734 aa_put_ns(ns); /* list ref remains */
1735out_pin:
1736 if (error)
1737 simple_release_fs(&aafs_mnt, &aafs_count);
1738out:
1739 mutex_unlock(&parent->lock);
1740 aa_put_ns(parent);
1741
1742 return error;
1743}
1744
1745static int ns_rmdir_op(struct inode *dir, struct dentry *dentry)
1746{
1747 struct aa_ns *ns, *parent;
1748 /* TODO: improve permission check */
1749 struct aa_label *label;
1750 int error;
1751
1752 label = begin_current_label_crit_section();
1753 error = aa_may_manage_policy(label, NULL, AA_MAY_LOAD_POLICY);
1754 end_current_label_crit_section(label);
1755 if (error)
1756 return error;
1757
1758 parent = aa_get_ns(dir->i_private);
1759 /* rmdir calls the generic securityfs functions to remove files
1760 * from the apparmor dir. It is up to the apparmor ns locking
1761 * to avoid races.
1762 */
1763 inode_unlock(dir);
1764 inode_unlock(dentry->d_inode);
1765
1766 mutex_lock_nested(&parent->lock, parent->level);
1767 ns = aa_get_ns(__aa_findn_ns(&parent->sub_ns, dentry->d_name.name,
1768 dentry->d_name.len));
1769 if (!ns) {
1770 error = -ENOENT;
1771 goto out;
1772 }
1773 AA_BUG(ns_dir(ns) != dentry);
1774
1775 __aa_remove_ns(ns);
1776 aa_put_ns(ns);
1777
1778out:
1779 mutex_unlock(&parent->lock);
1780 inode_lock_nested(dir, I_MUTEX_PARENT);
1781 inode_lock(dentry->d_inode);
1782 aa_put_ns(parent);
1783
1784 return error;
1785}
1786
1787static const struct inode_operations ns_dir_inode_operations = {
1788 .lookup = simple_lookup,
1789 .mkdir = ns_mkdir_op,
1790 .rmdir = ns_rmdir_op,
1791};
1792
1793static void __aa_fs_list_remove_rawdata(struct aa_ns *ns)
1794{
1795 struct aa_loaddata *ent, *tmp;
1796
1797 AA_BUG(!mutex_is_locked(&ns->lock));
1798
1799 list_for_each_entry_safe(ent, tmp, &ns->rawdata_list, list)
1800 __aa_fs_remove_rawdata(ent);
1801}
1802
1803/**
1804 *
1805 * Requires: @ns->lock held
1806 */
1807void __aafs_ns_rmdir(struct aa_ns *ns)
1808{
1809 struct aa_ns *sub;
1810 struct aa_profile *child;
1811 int i;
1812
1813 if (!ns)
1814 return;
1815 AA_BUG(!mutex_is_locked(&ns->lock));
1816
1817 list_for_each_entry(child, &ns->base.profiles, base.list)
1818 __aafs_profile_rmdir(child);
1819
1820 list_for_each_entry(sub, &ns->sub_ns, base.list) {
1821 mutex_lock_nested(&sub->lock, sub->level);
1822 __aafs_ns_rmdir(sub);
1823 mutex_unlock(&sub->lock);
1824 }
1825
1826 __aa_fs_list_remove_rawdata(ns);
1827
1828 if (ns_subns_dir(ns)) {
1829 sub = d_inode(ns_subns_dir(ns))->i_private;
1830 aa_put_ns(sub);
1831 }
1832 if (ns_subload(ns)) {
1833 sub = d_inode(ns_subload(ns))->i_private;
1834 aa_put_ns(sub);
1835 }
1836 if (ns_subreplace(ns)) {
1837 sub = d_inode(ns_subreplace(ns))->i_private;
1838 aa_put_ns(sub);
1839 }
1840 if (ns_subremove(ns)) {
1841 sub = d_inode(ns_subremove(ns))->i_private;
1842 aa_put_ns(sub);
1843 }
1844 if (ns_subrevision(ns)) {
1845 sub = d_inode(ns_subrevision(ns))->i_private;
1846 aa_put_ns(sub);
1847 }
1848
1849 for (i = AAFS_NS_SIZEOF - 1; i >= 0; --i) {
1850 aafs_remove(ns->dents[i]);
1851 ns->dents[i] = NULL;
1852 }
1853}
1854
1855/* assumes cleanup in caller */
1856static int __aafs_ns_mkdir_entries(struct aa_ns *ns, struct dentry *dir)
1857{
1858 struct dentry *dent;
1859
1860 AA_BUG(!ns);
1861 AA_BUG(!dir);
1862
1863 dent = aafs_create_dir("profiles", dir);
1864 if (IS_ERR(dent))
1865 return PTR_ERR(dent);
1866 ns_subprofs_dir(ns) = dent;
1867
1868 dent = aafs_create_dir("raw_data", dir);
1869 if (IS_ERR(dent))
1870 return PTR_ERR(dent);
1871 ns_subdata_dir(ns) = dent;
1872
1873 dent = aafs_create_file("revision", 0444, dir, ns,
1874 &aa_fs_ns_revision_fops);
1875 if (IS_ERR(dent))
1876 return PTR_ERR(dent);
1877 aa_get_ns(ns);
1878 ns_subrevision(ns) = dent;
1879
1880 dent = aafs_create_file(".load", 0640, dir, ns,
1881 &aa_fs_profile_load);
1882 if (IS_ERR(dent))
1883 return PTR_ERR(dent);
1884 aa_get_ns(ns);
1885 ns_subload(ns) = dent;
1886
1887 dent = aafs_create_file(".replace", 0640, dir, ns,
1888 &aa_fs_profile_replace);
1889 if (IS_ERR(dent))
1890 return PTR_ERR(dent);
1891 aa_get_ns(ns);
1892 ns_subreplace(ns) = dent;
1893
1894 dent = aafs_create_file(".remove", 0640, dir, ns,
1895 &aa_fs_profile_remove);
1896 if (IS_ERR(dent))
1897 return PTR_ERR(dent);
1898 aa_get_ns(ns);
1899 ns_subremove(ns) = dent;
1900
1901 /* use create_dentry so we can supply private data */
1902 dent = aafs_create("namespaces", S_IFDIR | 0755, dir, ns, NULL, NULL,
1903 &ns_dir_inode_operations);
1904 if (IS_ERR(dent))
1905 return PTR_ERR(dent);
1906 aa_get_ns(ns);
1907 ns_subns_dir(ns) = dent;
1908
1909 return 0;
1910}
1911
1912/*
1913 * Requires: @ns->lock held
1914 */
1915int __aafs_ns_mkdir(struct aa_ns *ns, struct dentry *parent, const char *name,
1916 struct dentry *dent)
1917{
1918 struct aa_ns *sub;
1919 struct aa_profile *child;
1920 struct dentry *dir;
1921 int error;
1922
1923 AA_BUG(!ns);
1924 AA_BUG(!parent);
1925 AA_BUG(!mutex_is_locked(&ns->lock));
1926
1927 if (!name)
1928 name = ns->base.name;
1929
1930 if (!dent) {
1931 /* create ns dir if it doesn't already exist */
1932 dent = aafs_create_dir(name, parent);
1933 if (IS_ERR(dent))
1934 goto fail;
1935 } else
1936 dget(dent);
1937 ns_dir(ns) = dir = dent;
1938 error = __aafs_ns_mkdir_entries(ns, dir);
1939 if (error)
1940 goto fail2;
1941
1942 /* profiles */
1943 list_for_each_entry(child, &ns->base.profiles, base.list) {
1944 error = __aafs_profile_mkdir(child, ns_subprofs_dir(ns));
1945 if (error)
1946 goto fail2;
1947 }
1948
1949 /* subnamespaces */
1950 list_for_each_entry(sub, &ns->sub_ns, base.list) {
1951 mutex_lock_nested(&sub->lock, sub->level);
1952 error = __aafs_ns_mkdir(sub, ns_subns_dir(ns), NULL, NULL);
1953 mutex_unlock(&sub->lock);
1954 if (error)
1955 goto fail2;
1956 }
1957
1958 return 0;
1959
1960fail:
1961 error = PTR_ERR(dent);
1962
1963fail2:
1964 __aafs_ns_rmdir(ns);
1965
1966 return error;
1967}
1968
1969/**
1970 * __next_ns - find the next namespace to list
1971 * @root: root namespace to stop search at (NOT NULL)
1972 * @ns: current ns position (NOT NULL)
1973 *
1974 * Find the next namespace from @ns under @root and handle all locking needed
1975 * while switching current namespace.
1976 *
1977 * Returns: next namespace or NULL if at last namespace under @root
1978 * Requires: ns->parent->lock to be held
1979 * NOTE: will not unlock root->lock
1980 */
1981static struct aa_ns *__next_ns(struct aa_ns *root, struct aa_ns *ns)
1982{
1983 struct aa_ns *parent, *next;
1984
1985 AA_BUG(!root);
1986 AA_BUG(!ns);
1987 AA_BUG(ns != root && !mutex_is_locked(&ns->parent->lock));
1988
1989 /* is next namespace a child */
1990 if (!list_empty(&ns->sub_ns)) {
1991 next = list_first_entry(&ns->sub_ns, typeof(*ns), base.list);
1992 mutex_lock_nested(&next->lock, next->level);
1993 return next;
1994 }
1995
1996 /* check if the next ns is a sibling, parent, gp, .. */
1997 parent = ns->parent;
1998 while (ns != root) {
1999 mutex_unlock(&ns->lock);
2000 next = list_next_entry(ns, base.list);
2001 if (!list_entry_is_head(next, &parent->sub_ns, base.list)) {
2002 mutex_lock_nested(&next->lock, next->level);
2003 return next;
2004 }
2005 ns = parent;
2006 parent = parent->parent;
2007 }
2008
2009 return NULL;
2010}
2011
2012/**
2013 * __first_profile - find the first profile in a namespace
2014 * @root: namespace that is root of profiles being displayed (NOT NULL)
2015 * @ns: namespace to start in (NOT NULL)
2016 *
2017 * Returns: unrefcounted profile or NULL if no profile
2018 * Requires: profile->ns.lock to be held
2019 */
2020static struct aa_profile *__first_profile(struct aa_ns *root,
2021 struct aa_ns *ns)
2022{
2023 AA_BUG(!root);
2024 AA_BUG(ns && !mutex_is_locked(&ns->lock));
2025
2026 for (; ns; ns = __next_ns(root, ns)) {
2027 if (!list_empty(&ns->base.profiles))
2028 return list_first_entry(&ns->base.profiles,
2029 struct aa_profile, base.list);
2030 }
2031 return NULL;
2032}
2033
2034/**
2035 * __next_profile - step to the next profile in a profile tree
2036 * @profile: current profile in tree (NOT NULL)
2037 *
2038 * Perform a depth first traversal on the profile tree in a namespace
2039 *
2040 * Returns: next profile or NULL if done
2041 * Requires: profile->ns.lock to be held
2042 */
2043static struct aa_profile *__next_profile(struct aa_profile *p)
2044{
2045 struct aa_profile *parent;
2046 struct aa_ns *ns = p->ns;
2047
2048 AA_BUG(!mutex_is_locked(&profiles_ns(p)->lock));
2049
2050 /* is next profile a child */
2051 if (!list_empty(&p->base.profiles))
2052 return list_first_entry(&p->base.profiles, typeof(*p),
2053 base.list);
2054
2055 /* is next profile a sibling, parent sibling, gp, sibling, .. */
2056 parent = rcu_dereference_protected(p->parent,
2057 mutex_is_locked(&p->ns->lock));
2058 while (parent) {
2059 p = list_next_entry(p, base.list);
2060 if (!list_entry_is_head(p, &parent->base.profiles, base.list))
2061 return p;
2062 p = parent;
2063 parent = rcu_dereference_protected(parent->parent,
2064 mutex_is_locked(&parent->ns->lock));
2065 }
2066
2067 /* is next another profile in the namespace */
2068 p = list_next_entry(p, base.list);
2069 if (!list_entry_is_head(p, &ns->base.profiles, base.list))
2070 return p;
2071
2072 return NULL;
2073}
2074
2075/**
2076 * next_profile - step to the next profile in where ever it may be
2077 * @root: root namespace (NOT NULL)
2078 * @profile: current profile (NOT NULL)
2079 *
2080 * Returns: next profile or NULL if there isn't one
2081 */
2082static struct aa_profile *next_profile(struct aa_ns *root,
2083 struct aa_profile *profile)
2084{
2085 struct aa_profile *next = __next_profile(profile);
2086 if (next)
2087 return next;
2088
2089 /* finished all profiles in namespace move to next namespace */
2090 return __first_profile(root, __next_ns(root, profile->ns));
2091}
2092
2093/**
2094 * p_start - start a depth first traversal of profile tree
2095 * @f: seq_file to fill
2096 * @pos: current position
2097 *
2098 * Returns: first profile under current namespace or NULL if none found
2099 *
2100 * acquires first ns->lock
2101 */
2102static void *p_start(struct seq_file *f, loff_t *pos)
2103{
2104 struct aa_profile *profile = NULL;
2105 struct aa_ns *root = aa_get_current_ns();
2106 loff_t l = *pos;
2107 f->private = root;
2108
2109 /* find the first profile */
2110 mutex_lock_nested(&root->lock, root->level);
2111 profile = __first_profile(root, root);
2112
2113 /* skip to position */
2114 for (; profile && l > 0; l--)
2115 profile = next_profile(root, profile);
2116
2117 return profile;
2118}
2119
2120/**
2121 * p_next - read the next profile entry
2122 * @f: seq_file to fill
2123 * @p: profile previously returned
2124 * @pos: current position
2125 *
2126 * Returns: next profile after @p or NULL if none
2127 *
2128 * may acquire/release locks in namespace tree as necessary
2129 */
2130static void *p_next(struct seq_file *f, void *p, loff_t *pos)
2131{
2132 struct aa_profile *profile = p;
2133 struct aa_ns *ns = f->private;
2134 (*pos)++;
2135
2136 return next_profile(ns, profile);
2137}
2138
2139/**
2140 * p_stop - stop depth first traversal
2141 * @f: seq_file we are filling
2142 * @p: the last profile writen
2143 *
2144 * Release all locking done by p_start/p_next on namespace tree
2145 */
2146static void p_stop(struct seq_file *f, void *p)
2147{
2148 struct aa_profile *profile = p;
2149 struct aa_ns *root = f->private, *ns;
2150
2151 if (profile) {
2152 for (ns = profile->ns; ns && ns != root; ns = ns->parent)
2153 mutex_unlock(&ns->lock);
2154 }
2155 mutex_unlock(&root->lock);
2156 aa_put_ns(root);
2157}
2158
2159/**
2160 * seq_show_profile - show a profile entry
2161 * @f: seq_file to file
2162 * @p: current position (profile) (NOT NULL)
2163 *
2164 * Returns: error on failure
2165 */
2166static int seq_show_profile(struct seq_file *f, void *p)
2167{
2168 struct aa_profile *profile = (struct aa_profile *)p;
2169 struct aa_ns *root = f->private;
2170
2171 aa_label_seq_xprint(f, root, &profile->label,
2172 FLAG_SHOW_MODE | FLAG_VIEW_SUBNS, GFP_KERNEL);
2173 seq_putc(f, '\n');
2174
2175 return 0;
2176}
2177
2178static const struct seq_operations aa_sfs_profiles_op = {
2179 .start = p_start,
2180 .next = p_next,
2181 .stop = p_stop,
2182 .show = seq_show_profile,
2183};
2184
2185static int profiles_open(struct inode *inode, struct file *file)
2186{
2187 if (!policy_view_capable(NULL))
2188 return -EACCES;
2189
2190 return seq_open(file, &aa_sfs_profiles_op);
2191}
2192
2193static int profiles_release(struct inode *inode, struct file *file)
2194{
2195 return seq_release(inode, file);
2196}
2197
2198static const struct file_operations aa_sfs_profiles_fops = {
2199 .open = profiles_open,
2200 .read = seq_read,
2201 .llseek = seq_lseek,
2202 .release = profiles_release,
2203};
2204
2205
2206/** Base file system setup **/
2207static struct aa_sfs_entry aa_sfs_entry_file[] = {
2208 AA_SFS_FILE_STRING("mask",
2209 "create read write exec append mmap_exec link lock"),
2210 { }
2211};
2212
2213static struct aa_sfs_entry aa_sfs_entry_ptrace[] = {
2214 AA_SFS_FILE_STRING("mask", "read trace"),
2215 { }
2216};
2217
2218static struct aa_sfs_entry aa_sfs_entry_signal[] = {
2219 AA_SFS_FILE_STRING("mask", AA_SFS_SIG_MASK),
2220 { }
2221};
2222
2223static struct aa_sfs_entry aa_sfs_entry_attach[] = {
2224 AA_SFS_FILE_BOOLEAN("xattr", 1),
2225 { }
2226};
2227static struct aa_sfs_entry aa_sfs_entry_domain[] = {
2228 AA_SFS_FILE_BOOLEAN("change_hat", 1),
2229 AA_SFS_FILE_BOOLEAN("change_hatv", 1),
2230 AA_SFS_FILE_BOOLEAN("change_onexec", 1),
2231 AA_SFS_FILE_BOOLEAN("change_profile", 1),
2232 AA_SFS_FILE_BOOLEAN("stack", 1),
2233 AA_SFS_FILE_BOOLEAN("fix_binfmt_elf_mmap", 1),
2234 AA_SFS_FILE_BOOLEAN("post_nnp_subset", 1),
2235 AA_SFS_FILE_BOOLEAN("computed_longest_left", 1),
2236 AA_SFS_DIR("attach_conditions", aa_sfs_entry_attach),
2237 AA_SFS_FILE_STRING("version", "1.2"),
2238 { }
2239};
2240
2241static struct aa_sfs_entry aa_sfs_entry_versions[] = {
2242 AA_SFS_FILE_BOOLEAN("v5", 1),
2243 AA_SFS_FILE_BOOLEAN("v6", 1),
2244 AA_SFS_FILE_BOOLEAN("v7", 1),
2245 AA_SFS_FILE_BOOLEAN("v8", 1),
2246 { }
2247};
2248
2249static struct aa_sfs_entry aa_sfs_entry_policy[] = {
2250 AA_SFS_DIR("versions", aa_sfs_entry_versions),
2251 AA_SFS_FILE_BOOLEAN("set_load", 1),
2252 { }
2253};
2254
2255static struct aa_sfs_entry aa_sfs_entry_mount[] = {
2256 AA_SFS_FILE_STRING("mask", "mount umount pivot_root"),
2257 { }
2258};
2259
2260static struct aa_sfs_entry aa_sfs_entry_ns[] = {
2261 AA_SFS_FILE_BOOLEAN("profile", 1),
2262 AA_SFS_FILE_BOOLEAN("pivot_root", 0),
2263 { }
2264};
2265
2266static struct aa_sfs_entry aa_sfs_entry_query_label[] = {
2267 AA_SFS_FILE_STRING("perms", "allow deny audit quiet"),
2268 AA_SFS_FILE_BOOLEAN("data", 1),
2269 AA_SFS_FILE_BOOLEAN("multi_transaction", 1),
2270 { }
2271};
2272
2273static struct aa_sfs_entry aa_sfs_entry_query[] = {
2274 AA_SFS_DIR("label", aa_sfs_entry_query_label),
2275 { }
2276};
2277static struct aa_sfs_entry aa_sfs_entry_features[] = {
2278 AA_SFS_DIR("policy", aa_sfs_entry_policy),
2279 AA_SFS_DIR("domain", aa_sfs_entry_domain),
2280 AA_SFS_DIR("file", aa_sfs_entry_file),
2281 AA_SFS_DIR("network_v8", aa_sfs_entry_network),
2282 AA_SFS_DIR("mount", aa_sfs_entry_mount),
2283 AA_SFS_DIR("namespaces", aa_sfs_entry_ns),
2284 AA_SFS_FILE_U64("capability", VFS_CAP_FLAGS_MASK),
2285 AA_SFS_DIR("rlimit", aa_sfs_entry_rlimit),
2286 AA_SFS_DIR("caps", aa_sfs_entry_caps),
2287 AA_SFS_DIR("ptrace", aa_sfs_entry_ptrace),
2288 AA_SFS_DIR("signal", aa_sfs_entry_signal),
2289 AA_SFS_DIR("query", aa_sfs_entry_query),
2290 { }
2291};
2292
2293static struct aa_sfs_entry aa_sfs_entry_apparmor[] = {
2294 AA_SFS_FILE_FOPS(".access", 0666, &aa_sfs_access),
2295 AA_SFS_FILE_FOPS(".stacked", 0444, &seq_ns_stacked_fops),
2296 AA_SFS_FILE_FOPS(".ns_stacked", 0444, &seq_ns_nsstacked_fops),
2297 AA_SFS_FILE_FOPS(".ns_level", 0444, &seq_ns_level_fops),
2298 AA_SFS_FILE_FOPS(".ns_name", 0444, &seq_ns_name_fops),
2299 AA_SFS_FILE_FOPS("profiles", 0444, &aa_sfs_profiles_fops),
2300 AA_SFS_DIR("features", aa_sfs_entry_features),
2301 { }
2302};
2303
2304static struct aa_sfs_entry aa_sfs_entry =
2305 AA_SFS_DIR("apparmor", aa_sfs_entry_apparmor);
2306
2307/**
2308 * entry_create_file - create a file entry in the apparmor securityfs
2309 * @fs_file: aa_sfs_entry to build an entry for (NOT NULL)
2310 * @parent: the parent dentry in the securityfs
2311 *
2312 * Use entry_remove_file to remove entries created with this fn.
2313 */
2314static int __init entry_create_file(struct aa_sfs_entry *fs_file,
2315 struct dentry *parent)
2316{
2317 int error = 0;
2318
2319 fs_file->dentry = securityfs_create_file(fs_file->name,
2320 S_IFREG | fs_file->mode,
2321 parent, fs_file,
2322 fs_file->file_ops);
2323 if (IS_ERR(fs_file->dentry)) {
2324 error = PTR_ERR(fs_file->dentry);
2325 fs_file->dentry = NULL;
2326 }
2327 return error;
2328}
2329
2330static void __init entry_remove_dir(struct aa_sfs_entry *fs_dir);
2331/**
2332 * entry_create_dir - recursively create a directory entry in the securityfs
2333 * @fs_dir: aa_sfs_entry (and all child entries) to build (NOT NULL)
2334 * @parent: the parent dentry in the securityfs
2335 *
2336 * Use entry_remove_dir to remove entries created with this fn.
2337 */
2338static int __init entry_create_dir(struct aa_sfs_entry *fs_dir,
2339 struct dentry *parent)
2340{
2341 struct aa_sfs_entry *fs_file;
2342 struct dentry *dir;
2343 int error;
2344
2345 dir = securityfs_create_dir(fs_dir->name, parent);
2346 if (IS_ERR(dir))
2347 return PTR_ERR(dir);
2348 fs_dir->dentry = dir;
2349
2350 for (fs_file = fs_dir->v.files; fs_file && fs_file->name; ++fs_file) {
2351 if (fs_file->v_type == AA_SFS_TYPE_DIR)
2352 error = entry_create_dir(fs_file, fs_dir->dentry);
2353 else
2354 error = entry_create_file(fs_file, fs_dir->dentry);
2355 if (error)
2356 goto failed;
2357 }
2358
2359 return 0;
2360
2361failed:
2362 entry_remove_dir(fs_dir);
2363
2364 return error;
2365}
2366
2367/**
2368 * entry_remove_file - drop a single file entry in the apparmor securityfs
2369 * @fs_file: aa_sfs_entry to detach from the securityfs (NOT NULL)
2370 */
2371static void __init entry_remove_file(struct aa_sfs_entry *fs_file)
2372{
2373 if (!fs_file->dentry)
2374 return;
2375
2376 securityfs_remove(fs_file->dentry);
2377 fs_file->dentry = NULL;
2378}
2379
2380/**
2381 * entry_remove_dir - recursively drop a directory entry from the securityfs
2382 * @fs_dir: aa_sfs_entry (and all child entries) to detach (NOT NULL)
2383 */
2384static void __init entry_remove_dir(struct aa_sfs_entry *fs_dir)
2385{
2386 struct aa_sfs_entry *fs_file;
2387
2388 for (fs_file = fs_dir->v.files; fs_file && fs_file->name; ++fs_file) {
2389 if (fs_file->v_type == AA_SFS_TYPE_DIR)
2390 entry_remove_dir(fs_file);
2391 else
2392 entry_remove_file(fs_file);
2393 }
2394
2395 entry_remove_file(fs_dir);
2396}
2397
2398/**
2399 * aa_destroy_aafs - cleanup and free aafs
2400 *
2401 * releases dentries allocated by aa_create_aafs
2402 */
2403void __init aa_destroy_aafs(void)
2404{
2405 entry_remove_dir(&aa_sfs_entry);
2406}
2407
2408
2409#define NULL_FILE_NAME ".null"
2410struct path aa_null;
2411
2412static int aa_mk_null_file(struct dentry *parent)
2413{
2414 struct vfsmount *mount = NULL;
2415 struct dentry *dentry;
2416 struct inode *inode;
2417 int count = 0;
2418 int error = simple_pin_fs(parent->d_sb->s_type, &mount, &count);
2419
2420 if (error)
2421 return error;
2422
2423 inode_lock(d_inode(parent));
2424 dentry = lookup_one_len(NULL_FILE_NAME, parent, strlen(NULL_FILE_NAME));
2425 if (IS_ERR(dentry)) {
2426 error = PTR_ERR(dentry);
2427 goto out;
2428 }
2429 inode = new_inode(parent->d_inode->i_sb);
2430 if (!inode) {
2431 error = -ENOMEM;
2432 goto out1;
2433 }
2434
2435 inode->i_ino = get_next_ino();
2436 inode->i_mode = S_IFCHR | S_IRUGO | S_IWUGO;
2437 inode->i_atime = inode->i_mtime = inode->i_ctime = current_time(inode);
2438 init_special_inode(inode, S_IFCHR | S_IRUGO | S_IWUGO,
2439 MKDEV(MEM_MAJOR, 3));
2440 d_instantiate(dentry, inode);
2441 aa_null.dentry = dget(dentry);
2442 aa_null.mnt = mntget(mount);
2443
2444 error = 0;
2445
2446out1:
2447 dput(dentry);
2448out:
2449 inode_unlock(d_inode(parent));
2450 simple_release_fs(&mount, &count);
2451 return error;
2452}
2453
2454
2455
2456static const char *policy_get_link(struct dentry *dentry,
2457 struct inode *inode,
2458 struct delayed_call *done)
2459{
2460 struct aa_ns *ns;
2461 struct path path;
2462
2463 if (!dentry)
2464 return ERR_PTR(-ECHILD);
2465 ns = aa_get_current_ns();
2466 path.mnt = mntget(aafs_mnt);
2467 path.dentry = dget(ns_dir(ns));
2468 nd_jump_link(&path);
2469 aa_put_ns(ns);
2470
2471 return NULL;
2472}
2473
2474static int policy_readlink(struct dentry *dentry, char __user *buffer,
2475 int buflen)
2476{
2477 char name[32];
2478 int res;
2479
2480 res = snprintf(name, sizeof(name), "%s:[%lu]", AAFS_NAME,
2481 d_inode(dentry)->i_ino);
2482 if (res > 0 && res < sizeof(name))
2483 res = readlink_copy(buffer, buflen, name);
2484 else
2485 res = -ENOENT;
2486
2487 return res;
2488}
2489
2490static const struct inode_operations policy_link_iops = {
2491 .readlink = policy_readlink,
2492 .get_link = policy_get_link,
2493};
2494
2495
2496/**
2497 * aa_create_aafs - create the apparmor security filesystem
2498 *
2499 * dentries created here are released by aa_destroy_aafs
2500 *
2501 * Returns: error on failure
2502 */
2503static int __init aa_create_aafs(void)
2504{
2505 struct dentry *dent;
2506 int error;
2507
2508 if (!apparmor_initialized)
2509 return 0;
2510
2511 if (aa_sfs_entry.dentry) {
2512 AA_ERROR("%s: AppArmor securityfs already exists\n", __func__);
2513 return -EEXIST;
2514 }
2515
2516 /* setup apparmorfs used to virtualize policy/ */
2517 aafs_mnt = kern_mount(&aafs_ops);
2518 if (IS_ERR(aafs_mnt))
2519 panic("can't set apparmorfs up\n");
2520 aafs_mnt->mnt_sb->s_flags &= ~SB_NOUSER;
2521
2522 /* Populate fs tree. */
2523 error = entry_create_dir(&aa_sfs_entry, NULL);
2524 if (error)
2525 goto error;
2526
2527 dent = securityfs_create_file(".load", 0666, aa_sfs_entry.dentry,
2528 NULL, &aa_fs_profile_load);
2529 if (IS_ERR(dent))
2530 goto dent_error;
2531 ns_subload(root_ns) = dent;
2532
2533 dent = securityfs_create_file(".replace", 0666, aa_sfs_entry.dentry,
2534 NULL, &aa_fs_profile_replace);
2535 if (IS_ERR(dent))
2536 goto dent_error;
2537 ns_subreplace(root_ns) = dent;
2538
2539 dent = securityfs_create_file(".remove", 0666, aa_sfs_entry.dentry,
2540 NULL, &aa_fs_profile_remove);
2541 if (IS_ERR(dent))
2542 goto dent_error;
2543 ns_subremove(root_ns) = dent;
2544
2545 dent = securityfs_create_file("revision", 0444, aa_sfs_entry.dentry,
2546 NULL, &aa_fs_ns_revision_fops);
2547 if (IS_ERR(dent))
2548 goto dent_error;
2549 ns_subrevision(root_ns) = dent;
2550
2551 /* policy tree referenced by magic policy symlink */
2552 mutex_lock_nested(&root_ns->lock, root_ns->level);
2553 error = __aafs_ns_mkdir(root_ns, aafs_mnt->mnt_root, ".policy",
2554 aafs_mnt->mnt_root);
2555 mutex_unlock(&root_ns->lock);
2556 if (error)
2557 goto error;
2558
2559 /* magic symlink similar to nsfs redirects based on task policy */
2560 dent = securityfs_create_symlink("policy", aa_sfs_entry.dentry,
2561 NULL, &policy_link_iops);
2562 if (IS_ERR(dent))
2563 goto dent_error;
2564
2565 error = aa_mk_null_file(aa_sfs_entry.dentry);
2566 if (error)
2567 goto error;
2568
2569 /* TODO: add default profile to apparmorfs */
2570
2571 /* Report that AppArmor fs is enabled */
2572 aa_info_message("AppArmor Filesystem Enabled");
2573 return 0;
2574
2575dent_error:
2576 error = PTR_ERR(dent);
2577error:
2578 aa_destroy_aafs();
2579 AA_ERROR("Error creating AppArmor securityfs\n");
2580 return error;
2581}
2582
2583fs_initcall(aa_create_aafs);