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