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