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