]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blame - security/apparmor/apparmorfs.c
UBUNTU: Ubuntu-4.13.0-45.50
[mirror_ubuntu-artful-kernel.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"
33#include "include/context.h"
f8eb8a13 34#include "include/crypto.h"
84632f19 35#include "include/ipc.h"
d9bf2c26 36#include "include/policy_ns.h"
317d9a05 37#include "include/label.h"
63e2b423 38#include "include/policy.h"
cff281f6 39#include "include/policy_ns.h"
d384b0a1 40#include "include/resource.h"
5ac8c355 41#include "include/policy_unpack.h"
63e2b423 42
c97204ba
JJ
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
0d259f04
JJ
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 */
bbe4a7c8 79static int mangle_name(const char *name, char *target)
0d259f04
JJ
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
a481f4d9
JJ
111
112/*
113 * aafs - core fns and data for the policy tree
114 */
115
116#define AAFS_NAME "apparmorfs"
117static struct vfsmount *aafs_mnt;
118static int aafs_count;
119
120
121static 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
129static 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
137static 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
143static 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
156static 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
162static 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 */
179static 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 */
229static 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));
c806027e
DC
252 if (IS_ERR(dentry)) {
253 error = PTR_ERR(dentry);
a481f4d9 254 goto fail_lock;
c806027e 255 }
a481f4d9
JJ
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
269fail_dentry:
270 dput(dentry);
271
272fail_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 */
290static 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 */
305static 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 */
321static 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 */
347static 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
63e2b423
JJ
372/**
373 * aa_simple_write_to_buffer - common routine for getting policy from user
63e2b423 374 * @userbuf: user buffer to copy data from (NOT NULL)
3ed02ada 375 * @alloc_size: size of user buffer (REQUIRES: @alloc_size >= @copy_size)
63e2b423
JJ
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 */
5ef50d01 382static struct aa_loaddata *aa_simple_write_to_buffer(const char __user *userbuf,
5ac8c355
JJ
383 size_t alloc_size,
384 size_t copy_size,
385 loff_t *pos)
63e2b423 386{
5ac8c355 387 struct aa_loaddata *data;
63e2b423 388
e6bfa25d 389 AA_BUG(copy_size > alloc_size);
3ed02ada 390
63e2b423
JJ
391 if (*pos != 0)
392 /* only writes from pos 0, that is complete writes */
393 return ERR_PTR(-ESPIPE);
394
63e2b423 395 /* freed by caller to simple_write_to_buffer */
5d5182ca
JJ
396 data = aa_loaddata_alloc(alloc_size);
397 if (IS_ERR(data))
398 return data;
63e2b423 399
5d5182ca 400 data->size = copy_size;
5ac8c355 401 if (copy_from_user(data->data, userbuf, copy_size)) {
63e2b423
JJ
402 kvfree(data);
403 return ERR_PTR(-EFAULT);
404 }
405
406 return data;
407}
408
18e99f19 409static ssize_t policy_update(u32 mask, const char __user *buf, size_t size,
b7fd2c03 410 loff_t *pos, struct aa_ns *ns)
63e2b423 411{
5ac8c355 412 struct aa_loaddata *data;
637f688d
JJ
413 struct aa_label *label;
414 ssize_t error;
cf797c0e 415
637f688d 416 label = begin_current_label_crit_section();
cf797c0e 417
5ac8c355
JJ
418 /* high level check about policy management - fine grained in
419 * below after unpack
420 */
637f688d 421 error = aa_may_manage_policy(label, ns, mask);
5ac8c355
JJ
422 if (error)
423 return error;
63e2b423 424
5ef50d01 425 data = aa_simple_write_to_buffer(buf, size, size, pos);
63e2b423
JJ
426 error = PTR_ERR(data);
427 if (!IS_ERR(data)) {
637f688d 428 error = aa_replace_profiles(ns, label, mask, data);
5ac8c355 429 aa_put_loaddata(data);
63e2b423 430 }
637f688d 431 end_current_label_crit_section(label);
63e2b423
JJ
432
433 return error;
434}
435
b7fd2c03 436/* .load file hook fn to load policy */
5ac8c355
JJ
437static ssize_t profile_load(struct file *f, const char __user *buf, size_t size,
438 loff_t *pos)
439{
b7fd2c03 440 struct aa_ns *ns = aa_get_ns(f->f_inode->i_private);
18e99f19 441 int error = policy_update(AA_MAY_LOAD_POLICY, buf, size, pos, ns);
b7fd2c03
JJ
442
443 aa_put_ns(ns);
5ac8c355
JJ
444
445 return error;
446}
447
63e2b423 448static const struct file_operations aa_fs_profile_load = {
6038f373
AB
449 .write = profile_load,
450 .llseek = default_llseek,
63e2b423
JJ
451};
452
453/* .replace file hook fn to load and/or replace policy */
454static ssize_t profile_replace(struct file *f, const char __user *buf,
455 size_t size, loff_t *pos)
456{
b7fd2c03 457 struct aa_ns *ns = aa_get_ns(f->f_inode->i_private);
18e99f19
JJ
458 int error = policy_update(AA_MAY_LOAD_POLICY | AA_MAY_REPLACE_POLICY,
459 buf, size, pos, ns);
b7fd2c03 460 aa_put_ns(ns);
63e2b423
JJ
461
462 return error;
463}
464
465static const struct file_operations aa_fs_profile_replace = {
6038f373
AB
466 .write = profile_replace,
467 .llseek = default_llseek,
63e2b423
JJ
468};
469
b7fd2c03 470/* .remove file hook fn to remove loaded policy */
63e2b423
JJ
471static ssize_t profile_remove(struct file *f, const char __user *buf,
472 size_t size, loff_t *pos)
473{
5ac8c355 474 struct aa_loaddata *data;
637f688d 475 struct aa_label *label;
63e2b423 476 ssize_t error;
b7fd2c03 477 struct aa_ns *ns = aa_get_ns(f->f_inode->i_private);
63e2b423 478
637f688d 479 label = begin_current_label_crit_section();
5ac8c355
JJ
480 /* high level check about policy management - fine grained in
481 * below after unpack
482 */
637f688d 483 error = aa_may_manage_policy(label, ns, AA_MAY_REMOVE_POLICY);
5ac8c355
JJ
484 if (error)
485 goto out;
486
63e2b423
JJ
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 */
5ef50d01 491 data = aa_simple_write_to_buffer(buf, size + 1, size, pos);
63e2b423
JJ
492
493 error = PTR_ERR(data);
494 if (!IS_ERR(data)) {
5ac8c355 495 data->data[size] = 0;
637f688d 496 error = aa_remove_profiles(ns, label, data->data, size);
5ac8c355 497 aa_put_loaddata(data);
63e2b423 498 }
5ac8c355 499 out:
637f688d 500 end_current_label_crit_section(label);
b7fd2c03 501 aa_put_ns(ns);
63e2b423
JJ
502 return error;
503}
504
505static const struct file_operations aa_fs_profile_remove = {
6038f373
AB
506 .write = profile_remove,
507 .llseek = default_llseek,
63e2b423
JJ
508};
509
d9bf2c26
JJ
510struct aa_revision {
511 struct aa_ns *ns;
512 long last_read;
513};
514
515/* revision file hook fn for policy loads */
516static 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
528static 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(&rev->ns->lock);
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(&rev->ns->lock);
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
559static 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
574static unsigned int ns_revision_poll(struct file *file, poll_table *pt)
575{
576 struct aa_revision *rev = file->private_data;
577 unsigned int mask = 0;
578
579 if (rev) {
580 mutex_lock(&rev->ns->lock);
581 poll_wait(file, &rev->ns->wait, pt);
582 if (rev->last_read < rev->ns->revision)
583 mask |= POLLIN | POLLRDNORM;
584 mutex_unlock(&rev->ns->lock);
585 }
586
587 return mask;
588}
589
5d5182ca
JJ
590void __aa_bump_ns_revision(struct aa_ns *ns)
591{
592 ns->revision++;
d9bf2c26 593 wake_up_interruptible(&ns->wait);
5d5182ca
JJ
594}
595
d9bf2c26
JJ
596static 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
4f3b3f2d
JJ
605static 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
637f688d 612 if (profile_unconfined(profile))
4f3b3f2d
JJ
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);
317d9a05 636 aa_perms_accum_raw(perms, &tmp);
4f3b3f2d
JJ
637}
638
639
e025be0f
WH
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 */
658static 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;
317d9a05 663 struct label_it i;
637f688d 664 struct aa_label *label, *curr;
317d9a05 665 struct aa_profile *profile;
e025be0f
WH
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
637f688d
JJ
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);
e025be0f
WH
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;
317d9a05
JJ
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);
e025be0f
WH
706
707 if (data) {
317d9a05
JJ
708 if (out + sizeof(outle32) + data->size > buf +
709 buf_len) {
637f688d 710 aa_put_label(label);
e025be0f 711 return -EINVAL; /* not enough space */
637f688d 712 }
e025be0f
WH
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 }
637f688d 721 aa_put_label(label);
e025be0f
WH
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
4f3b3f2d
JJ
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 */
751static ssize_t query_label(char *buf, size_t buf_len,
752 char *query, size_t query_len, bool view_only)
753{
317d9a05 754 struct aa_profile *profile;
637f688d 755 struct aa_label *label, *curr;
4f3b3f2d
JJ
756 char *label_name, *match_str;
757 size_t label_name_len, match_len;
758 struct aa_perms perms;
317d9a05 759 struct label_it i;
4f3b3f2d
JJ
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
637f688d
JJ
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);
4f3b3f2d
JJ
783
784 perms = allperms;
317d9a05
JJ
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);
4f3b3f2d
JJ
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
1dea3b41
JJ
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 */
808struct 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 */
816static DEFINE_SPINLOCK(multi_transaction_lock);
817
818static 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
826static struct multi_transaction *
827get_multi_transaction(struct multi_transaction *t)
828{
829 if (t)
830 kref_get(&(t->count));
831
832 return t;
833}
834
835static 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 */
842static 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
857static 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
876static 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
894static int multi_transaction_release(struct inode *inode, struct file *file)
895{
896 put_multi_transaction(file->private_data);
897
898 return 0;
899}
900
317d9a05
JJ
901#define QUERY_CMD_LABEL "label\0"
902#define QUERY_CMD_LABEL_LEN 6
4f3b3f2d
JJ
903#define QUERY_CMD_PROFILE "profile\0"
904#define QUERY_CMD_PROFILE_LEN 8
317d9a05
JJ
905#define QUERY_CMD_LABELALL "labelall\0"
906#define QUERY_CMD_LABELALL_LEN 9
e025be0f
WH
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 */
931static ssize_t aa_write_access(struct file *file, const char __user *ubuf,
932 size_t count, loff_t *ppos)
933{
1dea3b41 934 struct multi_transaction *t;
e025be0f
WH
935 ssize_t len;
936
937 if (*ppos)
938 return -ESPIPE;
939
1dea3b41
JJ
940 t = multi_transaction_new(file, ubuf, count);
941 if (IS_ERR(t))
942 return PTR_ERR(t);
e025be0f 943
4f3b3f2d
JJ
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);
317d9a05
JJ
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);
4f3b3f2d 960 } else if (count > QUERY_CMD_DATA_LEN &&
1dea3b41
JJ
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,
e025be0f
WH
964 count - QUERY_CMD_DATA_LEN);
965 } else
966 len = -EINVAL;
967
1dea3b41
JJ
968 if (len < 0) {
969 put_multi_transaction(t);
e025be0f 970 return len;
1dea3b41 971 }
e025be0f 972
1dea3b41 973 multi_transaction_set(file, t, len);
e025be0f
WH
974
975 return count;
976}
977
c97204ba 978static const struct file_operations aa_sfs_access = {
e025be0f 979 .write = aa_write_access,
1dea3b41
JJ
980 .read = multi_transaction_read,
981 .release = multi_transaction_release,
e025be0f
WH
982 .llseek = generic_file_llseek,
983};
984
c97204ba 985static int aa_sfs_seq_show(struct seq_file *seq, void *v)
e74abcf3 986{
c97204ba 987 struct aa_sfs_entry *fs_file = seq->private;
e74abcf3
KC
988
989 if (!fs_file)
990 return 0;
991
992 switch (fs_file->v_type) {
c97204ba 993 case AA_SFS_TYPE_BOOLEAN:
e74abcf3
KC
994 seq_printf(seq, "%s\n", fs_file->v.boolean ? "yes" : "no");
995 break;
c97204ba 996 case AA_SFS_TYPE_STRING:
a9bf8e9f
KC
997 seq_printf(seq, "%s\n", fs_file->v.string);
998 break;
c97204ba 999 case AA_SFS_TYPE_U64:
e74abcf3
KC
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
c97204ba 1010static int aa_sfs_seq_open(struct inode *inode, struct file *file)
e74abcf3 1011{
c97204ba 1012 return single_open(file, aa_sfs_seq_show, inode->i_private);
e74abcf3
KC
1013}
1014
c97204ba 1015const struct file_operations aa_sfs_seq_file_ops = {
e74abcf3 1016 .owner = THIS_MODULE,
c97204ba 1017 .open = aa_sfs_seq_open,
e74abcf3
KC
1018 .read = seq_read,
1019 .llseek = seq_lseek,
1020 .release = single_release,
1021};
1022
52b97de3
JJ
1023/*
1024 * profile based file operations
1025 * policy/profiles/XXXX/profiles/ *
1026 */
1027
1028#define SEQ_PROFILE_FOPS(NAME) \
1029static 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 \
1034static 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
1042static int seq_profile_open(struct inode *inode, struct file *file,
1043 int (*show)(struct seq_file *, void *))
0d259f04 1044{
8399588a
JJ
1045 struct aa_proxy *proxy = aa_get_proxy(inode->i_private);
1046 int error = single_open(file, show, proxy);
0d259f04
JJ
1047
1048 if (error) {
1049 file->private_data = NULL;
8399588a 1050 aa_put_proxy(proxy);
0d259f04
JJ
1051 }
1052
1053 return error;
1054}
1055
52b97de3 1056static int seq_profile_release(struct inode *inode, struct file *file)
0d259f04
JJ
1057{
1058 struct seq_file *seq = (struct seq_file *) file->private_data;
1059 if (seq)
8399588a 1060 aa_put_proxy(seq->private);
0d259f04
JJ
1061 return single_release(inode, file);
1062}
1063
52b97de3 1064static int seq_profile_name_show(struct seq_file *seq, void *v)
0d259f04 1065{
8399588a 1066 struct aa_proxy *proxy = seq->private;
637f688d
JJ
1067 struct aa_label *label = aa_get_label_rcu(&proxy->label);
1068 struct aa_profile *profile = labels_profile(label);
0d259f04 1069 seq_printf(seq, "%s\n", profile->base.name);
637f688d 1070 aa_put_label(label);
0d259f04
JJ
1071
1072 return 0;
1073}
1074
52b97de3 1075static int seq_profile_mode_show(struct seq_file *seq, void *v)
0d259f04 1076{
8399588a 1077 struct aa_proxy *proxy = seq->private;
637f688d
JJ
1078 struct aa_label *label = aa_get_label_rcu(&proxy->label);
1079 struct aa_profile *profile = labels_profile(label);
0d259f04 1080 seq_printf(seq, "%s\n", aa_profile_mode_names[profile->mode]);
637f688d 1081 aa_put_label(label);
0d259f04
JJ
1082
1083 return 0;
1084}
1085
52b97de3 1086static int seq_profile_attach_show(struct seq_file *seq, void *v)
556d0be7 1087{
8399588a 1088 struct aa_proxy *proxy = seq->private;
637f688d
JJ
1089 struct aa_label *label = aa_get_label_rcu(&proxy->label);
1090 struct aa_profile *profile = labels_profile(label);
556d0be7
JJ
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);
637f688d 1097 aa_put_label(label);
556d0be7
JJ
1098
1099 return 0;
1100}
1101
52b97de3 1102static int seq_profile_hash_show(struct seq_file *seq, void *v)
f8eb8a13 1103{
8399588a 1104 struct aa_proxy *proxy = seq->private;
637f688d
JJ
1105 struct aa_label *label = aa_get_label_rcu(&proxy->label);
1106 struct aa_profile *profile = labels_profile(label);
f8eb8a13
JJ
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]);
47dbd1cd 1112 seq_putc(seq, '\n');
f8eb8a13 1113 }
637f688d 1114 aa_put_label(label);
f8eb8a13
JJ
1115
1116 return 0;
1117}
1118
52b97de3
JJ
1119SEQ_PROFILE_FOPS(name);
1120SEQ_PROFILE_FOPS(mode);
1121SEQ_PROFILE_FOPS(attach);
1122SEQ_PROFILE_FOPS(hash);
f8eb8a13 1123
64c86970
JJ
1124/*
1125 * namespace based files
1126 * several root files and
1127 * policy/ *
1128 */
f8eb8a13 1129
64c86970
JJ
1130#define SEQ_NS_FOPS(NAME) \
1131static 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 \
1136static 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} \
3e3e5695 1143
40cde7fc
JJ
1144static 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
1155static 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
64c86970 1178static int seq_ns_level_show(struct seq_file *seq, void *v)
a71ada30 1179{
637f688d 1180 struct aa_label *label;
a71ada30 1181
637f688d
JJ
1182 label = begin_current_label_crit_section();
1183 seq_printf(seq, "%d\n", labels_ns(label)->level);
1184 end_current_label_crit_section(label);
a71ada30
JJ
1185
1186 return 0;
1187}
1188
64c86970 1189static int seq_ns_name_show(struct seq_file *seq, void *v)
3e3e5695 1190{
637f688d 1191 struct aa_label *label = begin_current_label_crit_section();
126a371a 1192 seq_printf(seq, "%s\n", labels_ns(label)->base.name);
637f688d 1193 end_current_label_crit_section(label);
3e3e5695
JJ
1194
1195 return 0;
1196}
1197
40cde7fc
JJ
1198SEQ_NS_FOPS(stacked);
1199SEQ_NS_FOPS(nsstacked);
64c86970
JJ
1200SEQ_NS_FOPS(level);
1201SEQ_NS_FOPS(name);
3e3e5695 1202
5d5182ca
JJ
1203
1204/* policy/raw_data/ * file ops */
1205
1206#define SEQ_RAWDATA_FOPS(NAME) \
1207static 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 \
1212static 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
1220static int seq_rawdata_open(struct inode *inode, struct file *file,
1221 int (*show)(struct seq_file *, void *))
5ac8c355 1222{
5d5182ca
JJ
1223 struct aa_loaddata *data = __aa_get_loaddata(inode->i_private);
1224 int error;
5ac8c355 1225
5d5182ca
JJ
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;
5ac8c355
JJ
1238}
1239
5d5182ca 1240static int seq_rawdata_release(struct inode *inode, struct file *file)
5ac8c355 1241{
5d5182ca 1242 struct seq_file *seq = (struct seq_file *) file->private_data;
5ac8c355 1243
5d5182ca
JJ
1244 if (seq)
1245 aa_put_loaddata(seq->private);
0ff3d97f 1246
5d5182ca
JJ
1247 return single_release(inode, file);
1248}
1249
1250static 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);
5ac8c355
JJ
1255
1256 return 0;
1257}
1258
5d5182ca 1259static int seq_rawdata_revision_show(struct seq_file *seq, void *v)
5ac8c355 1260{
5d5182ca 1261 struct aa_loaddata *data = seq->private;
5ac8c355 1262
5d5182ca
JJ
1263 seq_printf(seq, "%ld\n", data->revision);
1264
1265 return 0;
1266}
5ac8c355 1267
5d5182ca 1268static int seq_rawdata_hash_show(struct seq_file *seq, void *v)
5ac8c355 1269{
5d5182ca 1270 struct aa_loaddata *data = seq->private;
5ac8c355
JJ
1271 unsigned int i, size = aa_hash_size();
1272
5d5182ca 1273 if (data->hash) {
5ac8c355 1274 for (i = 0; i < size; i++)
5d5182ca 1275 seq_printf(seq, "%.2x", data->hash[i]);
47dbd1cd 1276 seq_putc(seq, '\n');
5ac8c355 1277 }
5ac8c355
JJ
1278
1279 return 0;
1280}
1281
5d5182ca
JJ
1282SEQ_RAWDATA_FOPS(abi);
1283SEQ_RAWDATA_FOPS(revision);
1284SEQ_RAWDATA_FOPS(hash);
5ac8c355
JJ
1285
1286static 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
5d5182ca 1295static int rawdata_release(struct inode *inode, struct file *file)
5ac8c355 1296{
5d5182ca
JJ
1297 aa_put_loaddata(file->private_data);
1298
1299 return 0;
1300}
5ac8c355 1301
5d5182ca
JJ
1302static int rawdata_open(struct inode *inode, struct file *file)
1303{
5ac8c355
JJ
1304 if (!policy_view_capable(NULL))
1305 return -EACCES;
5d5182ca
JJ
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;
5ac8c355
JJ
1310
1311 return 0;
1312}
1313
5d5182ca 1314static const struct file_operations rawdata_fops = {
5ac8c355
JJ
1315 .open = rawdata_open,
1316 .read = rawdata_read,
1317 .llseek = generic_file_llseek,
1318 .release = rawdata_release,
1319};
1320
5d5182ca
JJ
1321static 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 */
c961ee5f 1328 aafs_remove(rawdata->dents[i]);
5d5182ca
JJ
1329 rawdata->dents[i] = NULL;
1330 }
1331 }
1332}
1333
1334void __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
1346int __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
c961ee5f 1364 dir = aafs_create_dir(rawdata->name, ns_subdata_dir(ns));
5d5182ca
JJ
1365 if (IS_ERR(dir))
1366 /* ->name freed when rawdata freed */
1367 return PTR_ERR(dir);
1368 rawdata->dents[AAFS_LOADDATA_DIR] = dir;
1369
c961ee5f 1370 dent = aafs_create_file("abi", S_IFREG | 0444, dir, rawdata,
5d5182ca
JJ
1371 &seq_rawdata_abi_fops);
1372 if (IS_ERR(dent))
1373 goto fail;
1374 rawdata->dents[AAFS_LOADDATA_ABI] = dent;
1375
c961ee5f 1376 dent = aafs_create_file("revision", S_IFREG | 0444, dir, rawdata,
5d5182ca
JJ
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) {
c961ee5f 1383 dent = aafs_create_file("sha1", S_IFREG | 0444, dir,
5d5182ca
JJ
1384 rawdata, &seq_rawdata_hash_fops);
1385 if (IS_ERR(dent))
1386 goto fail;
1387 rawdata->dents[AAFS_LOADDATA_HASH] = dent;
1388 }
1389
c961ee5f 1390 dent = aafs_create_file("raw_data", S_IFREG | 0444,
5d5182ca
JJ
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
1403fail:
1404 remove_rawdata_dents(rawdata);
1405
1406 return PTR_ERR(dent);
1407}
1408
0d259f04 1409/** fns to setup dynamic per profile/namespace files **/
c97204ba
JJ
1410
1411/**
1412 *
1413 * Requires: @profile->ns->lock held
1414 */
1415void __aafs_profile_rmdir(struct aa_profile *profile)
0d259f04
JJ
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)
c97204ba 1424 __aafs_profile_rmdir(child);
0d259f04
JJ
1425
1426 for (i = AAFS_PROF_SIZEOF - 1; i >= 0; --i) {
8399588a 1427 struct aa_proxy *proxy;
0d259f04
JJ
1428 if (!profile->dents[i])
1429 continue;
1430
8399588a 1431 proxy = d_inode(profile->dents[i])->i_private;
c961ee5f 1432 aafs_remove(profile->dents[i]);
8399588a 1433 aa_put_proxy(proxy);
0d259f04
JJ
1434 profile->dents[i] = NULL;
1435 }
1436}
1437
c97204ba
JJ
1438/**
1439 *
1440 * Requires: @old->ns->lock held
1441 */
1442void __aafs_profile_migrate_dents(struct aa_profile *old,
1443 struct aa_profile *new)
0d259f04
JJ
1444{
1445 int i;
1446
37e2a995
JJ
1447 AA_BUG(!old);
1448 AA_BUG(!new);
1449 AA_BUG(!mutex_is_locked(&profiles_ns(old)->lock));
1450
0d259f04
JJ
1451 for (i = 0; i < AAFS_PROF_SIZEOF; i++) {
1452 new->dents[i] = old->dents[i];
d671e890 1453 if (new->dents[i])
078cd827 1454 new->dents[i]->d_inode->i_mtime = current_time(new->dents[i]->d_inode);
0d259f04
JJ
1455 old->dents[i] = NULL;
1456 }
1457}
1458
1459static struct dentry *create_profile_file(struct dentry *dir, const char *name,
1460 struct aa_profile *profile,
1461 const struct file_operations *fops)
1462{
637f688d 1463 struct aa_proxy *proxy = aa_get_proxy(profile->label.proxy);
0d259f04
JJ
1464 struct dentry *dent;
1465
c961ee5f 1466 dent = aafs_create_file(name, S_IFREG | 0444, dir, proxy, fops);
0d259f04 1467 if (IS_ERR(dent))
8399588a 1468 aa_put_proxy(proxy);
0d259f04
JJ
1469
1470 return dent;
1471}
1472
5d5182ca
JJ
1473static 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
1485static 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 */
c97204ba 1508int __aafs_profile_mkdir(struct aa_profile *profile, struct dentry *parent)
0d259f04
JJ
1509{
1510 struct aa_profile *child;
1511 struct dentry *dent = NULL, *dir;
1512 int error;
1513
37e2a995
JJ
1514 AA_BUG(!profile);
1515 AA_BUG(!mutex_is_locked(&profiles_ns(profile)->lock));
1516
0d259f04
JJ
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 */
c961ee5f 1522 dent = aafs_create_dir("profiles", dent);
0d259f04
JJ
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);
ffac1de6
DC
1534 if (!profile->dirname) {
1535 error = -ENOMEM;
1536 goto fail2;
1537 }
0d259f04
JJ
1538
1539 mangle_name(profile->base.name, profile->dirname);
1540 sprintf(profile->dirname + len, ".%ld", profile->ns->uniq_id++);
1541 }
1542
c961ee5f 1543 dent = aafs_create_dir(profile->dirname, parent);
0d259f04
JJ
1544 if (IS_ERR(dent))
1545 goto fail;
1546 prof_dir(profile) = dir = dent;
1547
52b97de3
JJ
1548 dent = create_profile_file(dir, "name", profile,
1549 &seq_profile_name_fops);
0d259f04
JJ
1550 if (IS_ERR(dent))
1551 goto fail;
1552 profile->dents[AAFS_PROF_NAME] = dent;
1553
52b97de3
JJ
1554 dent = create_profile_file(dir, "mode", profile,
1555 &seq_profile_mode_fops);
0d259f04
JJ
1556 if (IS_ERR(dent))
1557 goto fail;
1558 profile->dents[AAFS_PROF_MODE] = dent;
1559
556d0be7 1560 dent = create_profile_file(dir, "attach", profile,
52b97de3 1561 &seq_profile_attach_fops);
556d0be7
JJ
1562 if (IS_ERR(dent))
1563 goto fail;
1564 profile->dents[AAFS_PROF_ATTACH] = dent;
1565
f8eb8a13
JJ
1566 if (profile->hash) {
1567 dent = create_profile_file(dir, "sha1", profile,
52b97de3 1568 &seq_profile_hash_fops);
f8eb8a13
JJ
1569 if (IS_ERR(dent))
1570 goto fail;
1571 profile->dents[AAFS_PROF_HASH] = dent;
1572 }
1573
5ac8c355 1574 if (profile->rawdata) {
5d5182ca
JJ
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;
c961ee5f 1582 dent = aafs_create_symlink("raw_sha1", dir, target, NULL);
5ac8c355
JJ
1583 if (IS_ERR(dent))
1584 goto fail;
1585 profile->dents[AAFS_PROF_RAW_HASH] = dent;
1586
5d5182ca
JJ
1587 error = gen_symlink_name(target, sizeof(target), depth,
1588 profile->rawdata->name, "abi");
1589 if (error < 0)
1590 goto fail2;
c961ee5f 1591 dent = aafs_create_symlink("raw_abi", dir, target, NULL);
5ac8c355
JJ
1592 if (IS_ERR(dent))
1593 goto fail;
1594 profile->dents[AAFS_PROF_RAW_ABI] = dent;
1595
5d5182ca
JJ
1596 error = gen_symlink_name(target, sizeof(target), depth,
1597 profile->rawdata->name, "raw_data");
1598 if (error < 0)
1599 goto fail2;
c961ee5f 1600 dent = aafs_create_symlink("raw_data", dir, target, NULL);
5ac8c355
JJ
1601 if (IS_ERR(dent))
1602 goto fail;
1603 profile->dents[AAFS_PROF_RAW_DATA] = dent;
5ac8c355
JJ
1604 }
1605
0d259f04 1606 list_for_each_entry(child, &profile->base.profiles, base.list) {
c97204ba 1607 error = __aafs_profile_mkdir(child, prof_child_dir(profile));
0d259f04
JJ
1608 if (error)
1609 goto fail2;
1610 }
1611
1612 return 0;
1613
1614fail:
1615 error = PTR_ERR(dent);
1616
1617fail2:
c97204ba 1618 __aafs_profile_rmdir(profile);
0d259f04
JJ
1619
1620 return error;
1621}
1622
4ae47f33
JJ
1623static 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 */
637f688d
JJ
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);
4ae47f33
JJ
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(&parent->lock);
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 */
1662out_pin:
1663 if (error)
1664 simple_release_fs(&aafs_mnt, &aafs_count);
1665out:
1666 mutex_unlock(&parent->lock);
1667 aa_put_ns(parent);
1668
1669 return error;
1670}
1671
1672static int ns_rmdir_op(struct inode *dir, struct dentry *dentry)
1673{
1674 struct aa_ns *ns, *parent;
1675 /* TODO: improve permission check */
637f688d
JJ
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);
4ae47f33
JJ
1682 if (error)
1683 return error;
1684
637f688d 1685 parent = aa_get_ns(dir->i_private);
4ae47f33
JJ
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(&parent->lock);
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
1705out:
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
1714static const struct inode_operations ns_dir_inode_operations = {
1715 .lookup = simple_lookup,
1716 .mkdir = ns_mkdir_op,
1717 .rmdir = ns_rmdir_op,
1718};
1719
5d5182ca
JJ
1720static 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
c97204ba
JJ
1730/**
1731 *
1732 * Requires: @ns->lock held
1733 */
1734void __aafs_ns_rmdir(struct aa_ns *ns)
0d259f04 1735{
98849dff 1736 struct aa_ns *sub;
0d259f04
JJ
1737 struct aa_profile *child;
1738 int i;
1739
1740 if (!ns)
1741 return;
37e2a995 1742 AA_BUG(!mutex_is_locked(&ns->lock));
0d259f04
JJ
1743
1744 list_for_each_entry(child, &ns->base.profiles, base.list)
c97204ba 1745 __aafs_profile_rmdir(child);
0d259f04
JJ
1746
1747 list_for_each_entry(sub, &ns->sub_ns, base.list) {
1748 mutex_lock(&sub->lock);
c97204ba 1749 __aafs_ns_rmdir(sub);
0d259f04
JJ
1750 mutex_unlock(&sub->lock);
1751 }
1752
5d5182ca
JJ
1753 __aa_fs_list_remove_rawdata(ns);
1754
b7fd2c03
JJ
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 }
d9bf2c26
JJ
1771 if (ns_subrevision(ns)) {
1772 sub = d_inode(ns_subrevision(ns))->i_private;
1773 aa_put_ns(sub);
1774 }
b7fd2c03 1775
0d259f04 1776 for (i = AAFS_NS_SIZEOF - 1; i >= 0; --i) {
c961ee5f 1777 aafs_remove(ns->dents[i]);
0d259f04
JJ
1778 ns->dents[i] = NULL;
1779 }
1780}
1781
b7fd2c03 1782/* assumes cleanup in caller */
c97204ba 1783static int __aafs_ns_mkdir_entries(struct aa_ns *ns, struct dentry *dir)
b7fd2c03
JJ
1784{
1785 struct dentry *dent;
1786
1787 AA_BUG(!ns);
1788 AA_BUG(!dir);
1789
c961ee5f 1790 dent = aafs_create_dir("profiles", dir);
b7fd2c03
JJ
1791 if (IS_ERR(dent))
1792 return PTR_ERR(dent);
1793 ns_subprofs_dir(ns) = dent;
1794
c961ee5f 1795 dent = aafs_create_dir("raw_data", dir);
b7fd2c03
JJ
1796 if (IS_ERR(dent))
1797 return PTR_ERR(dent);
1798 ns_subdata_dir(ns) = dent;
1799
d9bf2c26
JJ
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
c961ee5f 1807 dent = aafs_create_file(".load", 0640, dir, ns,
b7fd2c03
JJ
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
c961ee5f 1814 dent = aafs_create_file(".replace", 0640, dir, ns,
b7fd2c03
JJ
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
c961ee5f 1821 dent = aafs_create_file(".remove", 0640, dir, ns,
b7fd2c03
JJ
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
4ae47f33
JJ
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);
b7fd2c03
JJ
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
c97204ba
JJ
1839/*
1840 * Requires: @ns->lock held
1841 */
98407f0a
JJ
1842int __aafs_ns_mkdir(struct aa_ns *ns, struct dentry *parent, const char *name,
1843 struct dentry *dent)
0d259f04 1844{
98849dff 1845 struct aa_ns *sub;
0d259f04 1846 struct aa_profile *child;
98407f0a 1847 struct dentry *dir;
0d259f04
JJ
1848 int error;
1849
b7fd2c03
JJ
1850 AA_BUG(!ns);
1851 AA_BUG(!parent);
1852 AA_BUG(!mutex_is_locked(&ns->lock));
1853
0d259f04
JJ
1854 if (!name)
1855 name = ns->base.name;
1856
c961ee5f
JJ
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);
b7fd2c03 1864 ns_dir(ns) = dir = dent;
c97204ba 1865 error = __aafs_ns_mkdir_entries(ns, dir);
b7fd2c03
JJ
1866 if (error)
1867 goto fail2;
0d259f04 1868
b7fd2c03 1869 /* profiles */
0d259f04 1870 list_for_each_entry(child, &ns->base.profiles, base.list) {
c97204ba 1871 error = __aafs_profile_mkdir(child, ns_subprofs_dir(ns));
0d259f04
JJ
1872 if (error)
1873 goto fail2;
1874 }
1875
b7fd2c03 1876 /* subnamespaces */
0d259f04
JJ
1877 list_for_each_entry(sub, &ns->sub_ns, base.list) {
1878 mutex_lock(&sub->lock);
98407f0a 1879 error = __aafs_ns_mkdir(sub, ns_subns_dir(ns), NULL, NULL);
0d259f04
JJ
1880 mutex_unlock(&sub->lock);
1881 if (error)
1882 goto fail2;
1883 }
1884
1885 return 0;
1886
1887fail:
1888 error = PTR_ERR(dent);
1889
1890fail2:
c97204ba 1891 __aafs_ns_rmdir(ns);
0d259f04
JJ
1892
1893 return error;
1894}
1895
1896
29b3822f
JJ
1897#define list_entry_is_head(pos, head, member) (&pos->member == (head))
1898
1899/**
98849dff 1900 * __next_ns - find the next namespace to list
29b3822f
JJ
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 */
98849dff 1911static struct aa_ns *__next_ns(struct aa_ns *root, struct aa_ns *ns)
29b3822f 1912{
98849dff 1913 struct aa_ns *parent, *next;
29b3822f 1914
37e2a995
JJ
1915 AA_BUG(!root);
1916 AA_BUG(!ns);
1917 AA_BUG(ns != root && !mutex_is_locked(&ns->parent->lock));
1918
29b3822f
JJ
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(&next->lock);
1923 return next;
1924 }
1925
1926 /* check if the next ns is a sibling, parent, gp, .. */
1927 parent = ns->parent;
ed2c7da3 1928 while (ns != root) {
29b3822f 1929 mutex_unlock(&ns->lock);
38dbd7d8 1930 next = list_next_entry(ns, base.list);
29b3822f
JJ
1931 if (!list_entry_is_head(next, &parent->sub_ns, base.list)) {
1932 mutex_lock(&next->lock);
1933 return next;
1934 }
29b3822f
JJ
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 */
98849dff
JJ
1950static struct aa_profile *__first_profile(struct aa_ns *root,
1951 struct aa_ns *ns)
29b3822f 1952{
37e2a995
JJ
1953 AA_BUG(!root);
1954 AA_BUG(ns && !mutex_is_locked(&ns->lock));
1955
98849dff 1956 for (; ns; ns = __next_ns(root, ns)) {
29b3822f
JJ
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 */
1973static struct aa_profile *__next_profile(struct aa_profile *p)
1974{
1975 struct aa_profile *parent;
98849dff 1976 struct aa_ns *ns = p->ns;
29b3822f 1977
37e2a995
JJ
1978 AA_BUG(!mutex_is_locked(&profiles_ns(p)->lock));
1979
29b3822f
JJ
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) {
38dbd7d8 1989 p = list_next_entry(p, base.list);
29b3822f
JJ
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 */
38dbd7d8 1998 p = list_next_entry(p, base.list);
29b3822f
JJ
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 */
98849dff 2012static struct aa_profile *next_profile(struct aa_ns *root,
29b3822f
JJ
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 */
98849dff 2020 return __first_profile(root, __next_ns(root, profile->ns));
29b3822f
JJ
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 */
2032static void *p_start(struct seq_file *f, loff_t *pos)
2033{
2034 struct aa_profile *profile = NULL;
cf797c0e 2035 struct aa_ns *root = aa_get_current_ns();
29b3822f 2036 loff_t l = *pos;
cf797c0e 2037 f->private = root;
29b3822f
JJ
2038
2039 /* find the first profile */
2040 mutex_lock(&root->lock);
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 */
2060static void *p_next(struct seq_file *f, void *p, loff_t *pos)
2061{
2062 struct aa_profile *profile = p;
98849dff 2063 struct aa_ns *ns = f->private;
29b3822f
JJ
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 */
2076static void p_stop(struct seq_file *f, void *p)
2077{
2078 struct aa_profile *profile = p;
98849dff 2079 struct aa_ns *root = f->private, *ns;
29b3822f
JJ
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);
98849dff 2086 aa_put_ns(root);
29b3822f
JJ
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 */
2096static int seq_show_profile(struct seq_file *f, void *p)
2097{
2098 struct aa_profile *profile = (struct aa_profile *)p;
98849dff 2099 struct aa_ns *root = f->private;
29b3822f 2100
637f688d
JJ
2101 aa_label_seq_xprint(f, root, &profile->label,
2102 FLAG_SHOW_MODE | FLAG_VIEW_SUBNS, GFP_KERNEL);
2103 seq_putc(f, '\n');
29b3822f
JJ
2104
2105 return 0;
2106}
2107
c97204ba 2108static const struct seq_operations aa_sfs_profiles_op = {
29b3822f
JJ
2109 .start = p_start,
2110 .next = p_next,
2111 .stop = p_stop,
2112 .show = seq_show_profile,
2113};
2114
2115static int profiles_open(struct inode *inode, struct file *file)
2116{
5ac8c355
JJ
2117 if (!policy_view_capable(NULL))
2118 return -EACCES;
2119
c97204ba 2120 return seq_open(file, &aa_sfs_profiles_op);
29b3822f
JJ
2121}
2122
2123static int profiles_release(struct inode *inode, struct file *file)
2124{
2125 return seq_release(inode, file);
2126}
2127
c97204ba 2128static const struct file_operations aa_sfs_profiles_fops = {
29b3822f
JJ
2129 .open = profiles_open,
2130 .read = seq_read,
2131 .llseek = seq_lseek,
2132 .release = profiles_release,
2133};
2134
2135
0d259f04 2136/** Base file system setup **/
c97204ba
JJ
2137static struct aa_sfs_entry aa_sfs_entry_file[] = {
2138 AA_SFS_FILE_STRING("mask",
2139 "create read write exec append mmap_exec link lock"),
a9bf8e9f
KC
2140 { }
2141};
2142
290f458a
JJ
2143static struct aa_sfs_entry aa_sfs_entry_ptrace[] = {
2144 AA_SFS_FILE_STRING("mask", "read trace"),
2145 { }
2146};
2147
84632f19
JJ
2148static struct aa_sfs_entry aa_sfs_entry_signal[] = {
2149 AA_SFS_FILE_STRING("mask", AA_SFS_SIG_MASK),
2150 { }
2151};
2152
c97204ba
JJ
2153static 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),
6c5fc8f1 2158 AA_SFS_FILE_BOOLEAN("stack", 1),
c97204ba
JJ
2159 AA_SFS_FILE_BOOLEAN("fix_binfmt_elf_mmap", 1),
2160 AA_SFS_FILE_STRING("version", "1.2"),
e74abcf3
KC
2161 { }
2162};
2163
c97204ba
JJ
2164static struct aa_sfs_entry aa_sfs_entry_versions[] = {
2165 AA_SFS_FILE_BOOLEAN("v5", 1),
5379a331
JJ
2166 AA_SFS_FILE_BOOLEAN("v6", 1),
2167 AA_SFS_FILE_BOOLEAN("v7", 1),
474d6b75
JJ
2168 { }
2169};
2170
c97204ba
JJ
2171static 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),
474d6b75 2174 { }
9d910a3b
JJ
2175};
2176
21fad8c3
JJ
2177static struct aa_sfs_entry aa_sfs_entry_mount[] = {
2178 AA_SFS_FILE_STRING("mask", "mount umount pivot_root"),
2179 { }
2180};
2181
33f2eada
JJ
2182static struct aa_sfs_entry aa_sfs_entry_ns[] = {
2183 AA_SFS_FILE_BOOLEAN("profile", 1),
21fad8c3 2184 AA_SFS_FILE_BOOLEAN("pivot_root", 0),
33f2eada
JJ
2185 { }
2186};
2187
fd1cafbb
JJ
2188static struct aa_sfs_entry aa_sfs_entry_dbus[] = {
2189 AA_SFS_FILE_STRING("mask", "acquire send receive"),
2190 { }
2191};
2192
a83bd86e 2193static struct aa_sfs_entry aa_sfs_entry_query_label[] = {
4f3b3f2d 2194 AA_SFS_FILE_STRING("perms", "allow deny audit quiet"),
a83bd86e 2195 AA_SFS_FILE_BOOLEAN("data", 1),
1dea3b41 2196 AA_SFS_FILE_BOOLEAN("multi_transaction", 1),
a83bd86e
JJ
2197 { }
2198};
2199
2200static struct aa_sfs_entry aa_sfs_entry_query[] = {
2201 AA_SFS_DIR("label", aa_sfs_entry_query_label),
2202 { }
2203};
c97204ba
JJ
2204static struct aa_sfs_entry aa_sfs_entry_features[] = {
2205 AA_SFS_DIR("policy", aa_sfs_entry_policy),
2206 AA_SFS_DIR("domain", aa_sfs_entry_domain),
2207 AA_SFS_DIR("file", aa_sfs_entry_file),
695b0eb9 2208 AA_SFS_DIR("network", aa_sfs_entry_network),
21fad8c3 2209 AA_SFS_DIR("mount", aa_sfs_entry_mount),
33f2eada 2210 AA_SFS_DIR("namespaces", aa_sfs_entry_ns),
c97204ba
JJ
2211 AA_SFS_FILE_U64("capability", VFS_CAP_FLAGS_MASK),
2212 AA_SFS_DIR("rlimit", aa_sfs_entry_rlimit),
2213 AA_SFS_DIR("caps", aa_sfs_entry_caps),
290f458a 2214 AA_SFS_DIR("ptrace", aa_sfs_entry_ptrace),
84632f19 2215 AA_SFS_DIR("signal", aa_sfs_entry_signal),
fd1cafbb 2216 AA_SFS_DIR("dbus", aa_sfs_entry_dbus),
a83bd86e 2217 AA_SFS_DIR("query", aa_sfs_entry_query),
e74abcf3
KC
2218 { }
2219};
2220
c97204ba 2221static struct aa_sfs_entry aa_sfs_entry_apparmor[] = {
8e65199b 2222 AA_SFS_FILE_FOPS(".access", 0666, &aa_sfs_access),
6c5fc8f1
JJ
2223 AA_SFS_FILE_FOPS(".stacked", 0444, &seq_ns_stacked_fops),
2224 AA_SFS_FILE_FOPS(".ns_stacked", 0444, &seq_ns_nsstacked_fops),
8e65199b
JJ
2225 AA_SFS_FILE_FOPS(".ns_level", 0444, &seq_ns_level_fops),
2226 AA_SFS_FILE_FOPS(".ns_name", 0444, &seq_ns_name_fops),
2227 AA_SFS_FILE_FOPS("profiles", 0444, &aa_sfs_profiles_fops),
c97204ba 2228 AA_SFS_DIR("features", aa_sfs_entry_features),
9acd494b
KC
2229 { }
2230};
63e2b423 2231
c97204ba
JJ
2232static struct aa_sfs_entry aa_sfs_entry =
2233 AA_SFS_DIR("apparmor", aa_sfs_entry_apparmor);
63e2b423 2234
9acd494b 2235/**
a481f4d9 2236 * entry_create_file - create a file entry in the apparmor securityfs
c97204ba 2237 * @fs_file: aa_sfs_entry to build an entry for (NOT NULL)
9acd494b
KC
2238 * @parent: the parent dentry in the securityfs
2239 *
a481f4d9 2240 * Use entry_remove_file to remove entries created with this fn.
9acd494b 2241 */
c97204ba 2242static int __init entry_create_file(struct aa_sfs_entry *fs_file,
a481f4d9 2243 struct dentry *parent)
9acd494b
KC
2244{
2245 int error = 0;
2246
2247 fs_file->dentry = securityfs_create_file(fs_file->name,
2248 S_IFREG | fs_file->mode,
2249 parent, fs_file,
2250 fs_file->file_ops);
2251 if (IS_ERR(fs_file->dentry)) {
2252 error = PTR_ERR(fs_file->dentry);
2253 fs_file->dentry = NULL;
63e2b423 2254 }
9acd494b 2255 return error;
63e2b423
JJ
2256}
2257
c97204ba 2258static void __init entry_remove_dir(struct aa_sfs_entry *fs_dir);
63e2b423 2259/**
a481f4d9 2260 * entry_create_dir - recursively create a directory entry in the securityfs
c97204ba 2261 * @fs_dir: aa_sfs_entry (and all child entries) to build (NOT NULL)
9acd494b 2262 * @parent: the parent dentry in the securityfs
63e2b423 2263 *
a481f4d9 2264 * Use entry_remove_dir to remove entries created with this fn.
63e2b423 2265 */
c97204ba
JJ
2266static int __init entry_create_dir(struct aa_sfs_entry *fs_dir,
2267 struct dentry *parent)
63e2b423 2268{
c97204ba 2269 struct aa_sfs_entry *fs_file;
0d259f04
JJ
2270 struct dentry *dir;
2271 int error;
63e2b423 2272
0d259f04
JJ
2273 dir = securityfs_create_dir(fs_dir->name, parent);
2274 if (IS_ERR(dir))
2275 return PTR_ERR(dir);
2276 fs_dir->dentry = dir;
63e2b423 2277
0d259f04 2278 for (fs_file = fs_dir->v.files; fs_file && fs_file->name; ++fs_file) {
c97204ba 2279 if (fs_file->v_type == AA_SFS_TYPE_DIR)
a481f4d9 2280 error = entry_create_dir(fs_file, fs_dir->dentry);
9acd494b 2281 else
a481f4d9 2282 error = entry_create_file(fs_file, fs_dir->dentry);
9acd494b
KC
2283 if (error)
2284 goto failed;
2285 }
2286
2287 return 0;
2288
2289failed:
a481f4d9 2290 entry_remove_dir(fs_dir);
0d259f04 2291
9acd494b
KC
2292 return error;
2293}
2294
2295/**
c97204ba
JJ
2296 * entry_remove_file - drop a single file entry in the apparmor securityfs
2297 * @fs_file: aa_sfs_entry to detach from the securityfs (NOT NULL)
9acd494b 2298 */
c97204ba 2299static void __init entry_remove_file(struct aa_sfs_entry *fs_file)
9acd494b
KC
2300{
2301 if (!fs_file->dentry)
2302 return;
2303
2304 securityfs_remove(fs_file->dentry);
2305 fs_file->dentry = NULL;
2306}
2307
2308/**
a481f4d9 2309 * entry_remove_dir - recursively drop a directory entry from the securityfs
c97204ba 2310 * @fs_dir: aa_sfs_entry (and all child entries) to detach (NOT NULL)
9acd494b 2311 */
c97204ba 2312static void __init entry_remove_dir(struct aa_sfs_entry *fs_dir)
9acd494b 2313{
c97204ba 2314 struct aa_sfs_entry *fs_file;
9acd494b 2315
0d259f04 2316 for (fs_file = fs_dir->v.files; fs_file && fs_file->name; ++fs_file) {
c97204ba 2317 if (fs_file->v_type == AA_SFS_TYPE_DIR)
a481f4d9 2318 entry_remove_dir(fs_file);
9acd494b 2319 else
c97204ba 2320 entry_remove_file(fs_file);
9acd494b
KC
2321 }
2322
c97204ba 2323 entry_remove_file(fs_dir);
63e2b423
JJ
2324}
2325
2326/**
2327 * aa_destroy_aafs - cleanup and free aafs
2328 *
2329 * releases dentries allocated by aa_create_aafs
2330 */
2331void __init aa_destroy_aafs(void)
2332{
c97204ba 2333 entry_remove_dir(&aa_sfs_entry);
63e2b423
JJ
2334}
2335
a71ada30
JJ
2336
2337#define NULL_FILE_NAME ".null"
2338struct path aa_null;
2339
2340static int aa_mk_null_file(struct dentry *parent)
2341{
2342 struct vfsmount *mount = NULL;
2343 struct dentry *dentry;
2344 struct inode *inode;
2345 int count = 0;
2346 int error = simple_pin_fs(parent->d_sb->s_type, &mount, &count);
2347
2348 if (error)
2349 return error;
2350
2351 inode_lock(d_inode(parent));
2352 dentry = lookup_one_len(NULL_FILE_NAME, parent, strlen(NULL_FILE_NAME));
2353 if (IS_ERR(dentry)) {
2354 error = PTR_ERR(dentry);
2355 goto out;
2356 }
2357 inode = new_inode(parent->d_inode->i_sb);
2358 if (!inode) {
2359 error = -ENOMEM;
2360 goto out1;
2361 }
2362
2363 inode->i_ino = get_next_ino();
2364 inode->i_mode = S_IFCHR | S_IRUGO | S_IWUGO;
24d0d03c 2365 inode->i_atime = inode->i_mtime = inode->i_ctime = current_time(inode);
a71ada30
JJ
2366 init_special_inode(inode, S_IFCHR | S_IRUGO | S_IWUGO,
2367 MKDEV(MEM_MAJOR, 3));
2368 d_instantiate(dentry, inode);
2369 aa_null.dentry = dget(dentry);
2370 aa_null.mnt = mntget(mount);
2371
2372 error = 0;
2373
2374out1:
2375 dput(dentry);
2376out:
2377 inode_unlock(d_inode(parent));
2378 simple_release_fs(&mount, &count);
2379 return error;
2380}
2381
a481f4d9
JJ
2382
2383
2384static const char *policy_get_link(struct dentry *dentry,
2385 struct inode *inode,
2386 struct delayed_call *done)
2387{
2388 struct aa_ns *ns;
2389 struct path path;
2390
2391 if (!dentry)
2392 return ERR_PTR(-ECHILD);
2393 ns = aa_get_current_ns();
2394 path.mnt = mntget(aafs_mnt);
2395 path.dentry = dget(ns_dir(ns));
2396 nd_jump_link(&path);
2397 aa_put_ns(ns);
2398
2399 return NULL;
2400}
2401
2402static int ns_get_name(char *buf, size_t size, struct aa_ns *ns,
2403 struct inode *inode)
2404{
2405 int res = snprintf(buf, size, "%s:[%lu]", AAFS_NAME, inode->i_ino);
2406
2407 if (res < 0 || res >= size)
2408 res = -ENOENT;
2409
2410 return res;
2411}
2412
2413static int policy_readlink(struct dentry *dentry, char __user *buffer,
2414 int buflen)
2415{
2416 struct aa_ns *ns;
2417 char name[32];
2418 int res;
2419
2420 ns = aa_get_current_ns();
2421 res = ns_get_name(name, sizeof(name), ns, d_inode(dentry));
2422 if (res >= 0)
2423 res = readlink_copy(buffer, buflen, name);
2424 aa_put_ns(ns);
2425
2426 return res;
2427}
2428
2429static const struct inode_operations policy_link_iops = {
2430 .readlink = policy_readlink,
2431 .get_link = policy_get_link,
2432};
2433
2434
63e2b423
JJ
2435/**
2436 * aa_create_aafs - create the apparmor security filesystem
2437 *
2438 * dentries created here are released by aa_destroy_aafs
2439 *
2440 * Returns: error on failure
2441 */
3417d8d5 2442static int __init aa_create_aafs(void)
63e2b423 2443{
b7fd2c03 2444 struct dentry *dent;
63e2b423
JJ
2445 int error;
2446
2447 if (!apparmor_initialized)
2448 return 0;
2449
c97204ba 2450 if (aa_sfs_entry.dentry) {
63e2b423
JJ
2451 AA_ERROR("%s: AppArmor securityfs already exists\n", __func__);
2452 return -EEXIST;
2453 }
2454
a481f4d9
JJ
2455 /* setup apparmorfs used to virtualize policy/ */
2456 aafs_mnt = kern_mount(&aafs_ops);
2457 if (IS_ERR(aafs_mnt))
2458 panic("can't set apparmorfs up\n");
2459 aafs_mnt->mnt_sb->s_flags &= ~MS_NOUSER;
2460
9acd494b 2461 /* Populate fs tree. */
c97204ba 2462 error = entry_create_dir(&aa_sfs_entry, NULL);
63e2b423
JJ
2463 if (error)
2464 goto error;
2465
c97204ba 2466 dent = securityfs_create_file(".load", 0666, aa_sfs_entry.dentry,
b7fd2c03
JJ
2467 NULL, &aa_fs_profile_load);
2468 if (IS_ERR(dent)) {
2469 error = PTR_ERR(dent);
2470 goto error;
2471 }
2472 ns_subload(root_ns) = dent;
2473
c97204ba 2474 dent = securityfs_create_file(".replace", 0666, aa_sfs_entry.dentry,
b7fd2c03
JJ
2475 NULL, &aa_fs_profile_replace);
2476 if (IS_ERR(dent)) {
2477 error = PTR_ERR(dent);
2478 goto error;
2479 }
2480 ns_subreplace(root_ns) = dent;
2481
c97204ba 2482 dent = securityfs_create_file(".remove", 0666, aa_sfs_entry.dentry,
b7fd2c03
JJ
2483 NULL, &aa_fs_profile_remove);
2484 if (IS_ERR(dent)) {
2485 error = PTR_ERR(dent);
2486 goto error;
2487 }
2488 ns_subremove(root_ns) = dent;
2489
d9bf2c26
JJ
2490 dent = securityfs_create_file("revision", 0444, aa_sfs_entry.dentry,
2491 NULL, &aa_fs_ns_revision_fops);
2492 if (IS_ERR(dent)) {
2493 error = PTR_ERR(dent);
2494 goto error;
2495 }
2496 ns_subrevision(root_ns) = dent;
2497
2498 /* policy tree referenced by magic policy symlink */
b7fd2c03 2499 mutex_lock(&root_ns->lock);
c961ee5f
JJ
2500 error = __aafs_ns_mkdir(root_ns, aafs_mnt->mnt_root, ".policy",
2501 aafs_mnt->mnt_root);
b7fd2c03 2502 mutex_unlock(&root_ns->lock);
0d259f04
JJ
2503 if (error)
2504 goto error;
2505
c961ee5f
JJ
2506 /* magic symlink similar to nsfs redirects based on task policy */
2507 dent = securityfs_create_symlink("policy", aa_sfs_entry.dentry,
2508 NULL, &policy_link_iops);
2509 if (IS_ERR(dent)) {
2510 error = PTR_ERR(dent);
2511 goto error;
2512 }
2513
c97204ba 2514 error = aa_mk_null_file(aa_sfs_entry.dentry);
a71ada30
JJ
2515 if (error)
2516 goto error;
2517
2518 /* TODO: add default profile to apparmorfs */
63e2b423
JJ
2519
2520 /* Report that AppArmor fs is enabled */
2521 aa_info_message("AppArmor Filesystem Enabled");
2522 return 0;
2523
2524error:
2525 aa_destroy_aafs();
2526 AA_ERROR("Error creating AppArmor securityfs\n");
2527 return error;
2528}
2529
2530fs_initcall(aa_create_aafs);