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