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