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