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