apparmorfs.c 59.5 KB
Newer Older
J
John Johansen 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14
/*
 * AppArmor security module
 *
 * This file contains AppArmor /sys/kernel/security/apparmor interface functions
 *
 * Copyright (C) 1998-2008 Novell/SUSE
 * Copyright 2009-2010 Canonical Ltd.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
 * published by the Free Software Foundation, version 2 of the
 * License.
 */

15
#include <linux/ctype.h>
J
John Johansen 已提交
16 17 18 19 20
#include <linux/security.h>
#include <linux/vmalloc.h>
#include <linux/module.h>
#include <linux/seq_file.h>
#include <linux/uaccess.h>
21
#include <linux/mount.h>
J
John Johansen 已提交
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 28
#include <uapi/linux/major.h>
#include <uapi/linux/magic.h>
J
John Johansen 已提交
29 30 31 32 33

#include "include/apparmor.h"
#include "include/apparmorfs.h"
#include "include/audit.h"
#include "include/context.h"
34
#include "include/crypto.h"
35
#include "include/policy_ns.h"
36
#include "include/label.h"
J
John Johansen 已提交
37
#include "include/policy.h"
38
#include "include/policy_ns.h"
39
#include "include/resource.h"
40
#include "include/policy_unpack.h"
J
John Johansen 已提交
41

42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70
/*
 * The apparmor filesystem interface used for policy load and introspection
 * The interface is split into two main components based on their function
 * a securityfs component:
 *   used for static files that are always available, and which allows
 *   userspace to specificy the location of the security filesystem.
 *
 *   fns and data are prefixed with
 *      aa_sfs_
 *
 * an apparmorfs component:
 *   used loaded policy content and introspection. It is not part of  a
 *   regular mounted filesystem and is available only through the magic
 *   policy symlink in the root of the securityfs apparmor/ directory.
 *   Tasks queries will be magically redirected to the correct portion
 *   of the policy tree based on their confinement.
 *
 *   fns and data are prefixed with
 *      aafs_
 *
 * The aa_fs_ prefix is used to indicate the fn is used by both the
 * securityfs and apparmorfs filesystems.
 */


/*
 * support fns
 */

71 72 73 74 75 76 77
/**
 * aa_mangle_name - mangle a profile name to std profile layout form
 * @name: profile name to mangle  (NOT NULL)
 * @target: buffer to store mangled name, same length as @name (MAYBE NULL)
 *
 * Returns: length of mangled name
 */
78
static int mangle_name(const char *name, char *target)
79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109
{
	char *t = target;

	while (*name == '/' || *name == '.')
		name++;

	if (target) {
		for (; *name; name++) {
			if (*name == '/')
				*(t)++ = '.';
			else if (isspace(*name))
				*(t)++ = '_';
			else if (isalnum(*name) || strchr("._-", *name))
				*(t)++ = *name;
		}

		*t = 0;
	} else {
		int len = 0;
		for (; *name; name++) {
			if (isalnum(*name) || isspace(*name) ||
			    strchr("/._-", *name))
				len++;
		}

		return len;
	}

	return t - target;
}

110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368

/*
 * aafs - core fns and data for the policy tree
 */

#define AAFS_NAME		"apparmorfs"
static struct vfsmount *aafs_mnt;
static int aafs_count;


static int aafs_show_path(struct seq_file *seq, struct dentry *dentry)
{
	struct inode *inode = d_inode(dentry);

	seq_printf(seq, "%s:[%lu]", AAFS_NAME, inode->i_ino);
	return 0;
}

static void aafs_evict_inode(struct inode *inode)
{
	truncate_inode_pages_final(&inode->i_data);
	clear_inode(inode);
	if (S_ISLNK(inode->i_mode))
		kfree(inode->i_link);
}

static const struct super_operations aafs_super_ops = {
	.statfs = simple_statfs,
	.evict_inode = aafs_evict_inode,
	.show_path = aafs_show_path,
};

static int fill_super(struct super_block *sb, void *data, int silent)
{
	static struct tree_descr files[] = { {""} };
	int error;

	error = simple_fill_super(sb, AAFS_MAGIC, files);
	if (error)
		return error;
	sb->s_op = &aafs_super_ops;

	return 0;
}

static struct dentry *aafs_mount(struct file_system_type *fs_type,
				 int flags, const char *dev_name, void *data)
{
	return mount_single(fs_type, flags, data, fill_super);
}

static struct file_system_type aafs_ops = {
	.owner = THIS_MODULE,
	.name = AAFS_NAME,
	.mount = aafs_mount,
	.kill_sb = kill_anon_super,
};

/**
 * __aafs_setup_d_inode - basic inode setup for apparmorfs
 * @dir: parent directory for the dentry
 * @dentry: dentry we are seting the inode up for
 * @mode: permissions the file should have
 * @data: data to store on inode.i_private, available in open()
 * @link: if symlink, symlink target string
 * @fops: struct file_operations that should be used
 * @iops: struct of inode_operations that should be used
 */
static int __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)
{
	struct inode *inode = new_inode(dir->i_sb);

	AA_BUG(!dir);
	AA_BUG(!dentry);

	if (!inode)
		return -ENOMEM;

	inode->i_ino = get_next_ino();
	inode->i_mode = mode;
	inode->i_atime = inode->i_mtime = inode->i_ctime = current_time(inode);
	inode->i_private = data;
	if (S_ISDIR(mode)) {
		inode->i_op = iops ? iops : &simple_dir_inode_operations;
		inode->i_fop = &simple_dir_operations;
		inc_nlink(inode);
		inc_nlink(dir);
	} else if (S_ISLNK(mode)) {
		inode->i_op = iops ? iops : &simple_symlink_inode_operations;
		inode->i_link = link;
	} else {
		inode->i_fop = fops;
	}
	d_instantiate(dentry, inode);
	dget(dentry);

	return 0;
}

/**
 * aafs_create - create a dentry in the apparmorfs filesystem
 *
 * @name: name of dentry to create
 * @mode: permissions the file should have
 * @parent: parent directory for this dentry
 * @data: data to store on inode.i_private, available in open()
 * @link: if symlink, symlink target string
 * @fops: struct file_operations that should be used for
 * @iops: struct of inode_operations that should be used
 *
 * This is the basic "create a xxx" function for apparmorfs.
 *
 * Returns a pointer to a dentry if it succeeds, that must be free with
 * aafs_remove(). Will return ERR_PTR on failure.
 */
static struct dentry *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)
{
	struct dentry *dentry;
	struct inode *dir;
	int error;

	AA_BUG(!name);
	AA_BUG(!parent);

	if (!(mode & S_IFMT))
		mode = (mode & S_IALLUGO) | S_IFREG;

	error = simple_pin_fs(&aafs_ops, &aafs_mnt, &aafs_count);
	if (error)
		return ERR_PTR(error);

	dir = d_inode(parent);

	inode_lock(dir);
	dentry = lookup_one_len(name, parent, strlen(name));
	if (IS_ERR(dentry))
		goto fail_lock;

	if (d_really_is_positive(dentry)) {
		error = -EEXIST;
		goto fail_dentry;
	}

	error = __aafs_setup_d_inode(dir, dentry, mode, data, link, fops, iops);
	if (error)
		goto fail_dentry;
	inode_unlock(dir);

	return dentry;

fail_dentry:
	dput(dentry);

fail_lock:
	inode_unlock(dir);
	simple_release_fs(&aafs_mnt, &aafs_count);

	return ERR_PTR(error);
}

/**
 * aafs_create_file - create a file in the apparmorfs filesystem
 *
 * @name: name of dentry to create
 * @mode: permissions the file should have
 * @parent: parent directory for this dentry
 * @data: data to store on inode.i_private, available in open()
 * @fops: struct file_operations that should be used for
 *
 * see aafs_create
 */
static struct dentry *aafs_create_file(const char *name, umode_t mode,
				       struct dentry *parent, void *data,
				       const struct file_operations *fops)
{
	return aafs_create(name, mode, parent, data, NULL, fops, NULL);
}

/**
 * aafs_create_dir - create a directory in the apparmorfs filesystem
 *
 * @name: name of dentry to create
 * @parent: parent directory for this dentry
 *
 * see aafs_create
 */
static struct dentry *aafs_create_dir(const char *name, struct dentry *parent)
{
	return aafs_create(name, S_IFDIR | 0755, parent, NULL, NULL, NULL,
			   NULL);
}

/**
 * aafs_create_symlink - create a symlink in the apparmorfs filesystem
 * @name: name of dentry to create
 * @parent: parent directory for this dentry
 * @target: if symlink, symlink target string
 * @iops: struct of inode_operations that should be used
 *
 * If @target parameter is %NULL, then the @iops parameter needs to be
 * setup to handle .readlink and .get_link inode_operations.
 */
static struct dentry *aafs_create_symlink(const char *name,
					  struct dentry *parent,
					  const char *target,
					  const struct inode_operations *iops)
{
	struct dentry *dent;
	char *link = NULL;

	if (target) {
		link = kstrdup(target, GFP_KERNEL);
		if (!link)
			return ERR_PTR(-ENOMEM);
	}
	dent = aafs_create(name, S_IFLNK | 0444, parent, NULL, link, NULL,
			   iops);
	if (IS_ERR(dent))
		kfree(link);

	return dent;
}

/**
 * aafs_remove - removes a file or directory from the apparmorfs filesystem
 *
 * @dentry: dentry of the file/directory/symlink to removed.
 */
static void aafs_remove(struct dentry *dentry)
{
	struct inode *dir;

	if (!dentry || IS_ERR(dentry))
		return;

	dir = d_inode(dentry->d_parent);
	inode_lock(dir);
	if (simple_positive(dentry)) {
		if (d_is_dir(dentry))
			simple_rmdir(dir, dentry);
		else
			simple_unlink(dir, dentry);
		dput(dentry);
	}
	inode_unlock(dir);
	simple_release_fs(&aafs_mnt, &aafs_count);
}


/*
 * aa_fs - policy load/replace/remove
 */

J
John Johansen 已提交
369 370 371
/**
 * aa_simple_write_to_buffer - common routine for getting policy from user
 * @userbuf: user buffer to copy data from  (NOT NULL)
372
 * @alloc_size: size of user buffer (REQUIRES: @alloc_size >= @copy_size)
J
John Johansen 已提交
373 374 375 376 377 378
 * @copy_size: size of data to copy from user buffer
 * @pos: position write is at in the file (NOT NULL)
 *
 * Returns: kernel buffer containing copy of user buffer data or an
 *          ERR_PTR on failure.
 */
379
static struct aa_loaddata *aa_simple_write_to_buffer(const char __user *userbuf,
380 381 382
						     size_t alloc_size,
						     size_t copy_size,
						     loff_t *pos)
J
John Johansen 已提交
383
{
384
	struct aa_loaddata *data;
J
John Johansen 已提交
385

386
	AA_BUG(copy_size > alloc_size);
387

J
John Johansen 已提交
388 389 390 391 392
	if (*pos != 0)
		/* only writes from pos 0, that is complete writes */
		return ERR_PTR(-ESPIPE);

	/* freed by caller to simple_write_to_buffer */
393 394 395
	data = aa_loaddata_alloc(alloc_size);
	if (IS_ERR(data))
		return data;
J
John Johansen 已提交
396

397
	data->size = copy_size;
398
	if (copy_from_user(data->data, userbuf, copy_size)) {
J
John Johansen 已提交
399 400 401 402 403 404 405
		kvfree(data);
		return ERR_PTR(-EFAULT);
	}

	return data;
}

406
static ssize_t policy_update(u32 mask, const char __user *buf, size_t size,
407
			     loff_t *pos, struct aa_ns *ns)
J
John Johansen 已提交
408
{
409
	struct aa_loaddata *data;
410 411
	struct aa_label *label;
	ssize_t error;
412

413
	label = begin_current_label_crit_section();
414

415 416 417
	/* high level check about policy management - fine grained in
	 * below after unpack
	 */
418
	error = aa_may_manage_policy(label, ns, mask);
419 420
	if (error)
		return error;
J
John Johansen 已提交
421

422
	data = aa_simple_write_to_buffer(buf, size, size, pos);
J
John Johansen 已提交
423 424
	error = PTR_ERR(data);
	if (!IS_ERR(data)) {
425
		error = aa_replace_profiles(ns, label, mask, data);
426
		aa_put_loaddata(data);
J
John Johansen 已提交
427
	}
428
	end_current_label_crit_section(label);
J
John Johansen 已提交
429 430 431 432

	return error;
}

433
/* .load file hook fn to load policy */
434 435 436
static ssize_t profile_load(struct file *f, const char __user *buf, size_t size,
			    loff_t *pos)
{
437
	struct aa_ns *ns = aa_get_ns(f->f_inode->i_private);
438
	int error = policy_update(AA_MAY_LOAD_POLICY, buf, size, pos, ns);
439 440

	aa_put_ns(ns);
441 442 443 444

	return error;
}

J
John Johansen 已提交
445
static const struct file_operations aa_fs_profile_load = {
446 447
	.write = profile_load,
	.llseek = default_llseek,
J
John Johansen 已提交
448 449 450 451 452 453
};

/* .replace file hook fn to load and/or replace policy */
static ssize_t profile_replace(struct file *f, const char __user *buf,
			       size_t size, loff_t *pos)
{
454
	struct aa_ns *ns = aa_get_ns(f->f_inode->i_private);
455 456
	int error = policy_update(AA_MAY_LOAD_POLICY | AA_MAY_REPLACE_POLICY,
				  buf, size, pos, ns);
457
	aa_put_ns(ns);
J
John Johansen 已提交
458 459 460 461 462

	return error;
}

static const struct file_operations aa_fs_profile_replace = {
463 464
	.write = profile_replace,
	.llseek = default_llseek,
J
John Johansen 已提交
465 466
};

467
/* .remove file hook fn to remove loaded policy */
J
John Johansen 已提交
468 469 470
static ssize_t profile_remove(struct file *f, const char __user *buf,
			      size_t size, loff_t *pos)
{
471
	struct aa_loaddata *data;
472
	struct aa_label *label;
J
John Johansen 已提交
473
	ssize_t error;
474
	struct aa_ns *ns = aa_get_ns(f->f_inode->i_private);
J
John Johansen 已提交
475

476
	label = begin_current_label_crit_section();
477 478 479
	/* high level check about policy management - fine grained in
	 * below after unpack
	 */
480
	error = aa_may_manage_policy(label, ns, AA_MAY_REMOVE_POLICY);
481 482 483
	if (error)
		goto out;

J
John Johansen 已提交
484 485 486 487
	/*
	 * aa_remove_profile needs a null terminated string so 1 extra
	 * byte is allocated and the copied data is null terminated.
	 */
488
	data = aa_simple_write_to_buffer(buf, size + 1, size, pos);
J
John Johansen 已提交
489 490 491

	error = PTR_ERR(data);
	if (!IS_ERR(data)) {
492
		data->data[size] = 0;
493
		error = aa_remove_profiles(ns, label, data->data, size);
494
		aa_put_loaddata(data);
J
John Johansen 已提交
495
	}
496
 out:
497
	end_current_label_crit_section(label);
498
	aa_put_ns(ns);
J
John Johansen 已提交
499 500 501 502
	return error;
}

static const struct file_operations aa_fs_profile_remove = {
503 504
	.write = profile_remove,
	.llseek = default_llseek,
J
John Johansen 已提交
505 506
};

507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586
struct aa_revision {
	struct aa_ns *ns;
	long last_read;
};

/* revision file hook fn for policy loads */
static int ns_revision_release(struct inode *inode, struct file *file)
{
	struct aa_revision *rev = file->private_data;

	if (rev) {
		aa_put_ns(rev->ns);
		kfree(rev);
	}

	return 0;
}

static ssize_t ns_revision_read(struct file *file, char __user *buf,
				size_t size, loff_t *ppos)
{
	struct aa_revision *rev = file->private_data;
	char buffer[32];
	long last_read;
	int avail;

	mutex_lock(&rev->ns->lock);
	last_read = rev->last_read;
	if (last_read == rev->ns->revision) {
		mutex_unlock(&rev->ns->lock);
		if (file->f_flags & O_NONBLOCK)
			return -EAGAIN;
		if (wait_event_interruptible(rev->ns->wait,
					     last_read !=
					     READ_ONCE(rev->ns->revision)))
			return -ERESTARTSYS;
		mutex_lock(&rev->ns->lock);
	}

	avail = sprintf(buffer, "%ld\n", rev->ns->revision);
	if (*ppos + size > avail) {
		rev->last_read = rev->ns->revision;
		*ppos = 0;
	}
	mutex_unlock(&rev->ns->lock);

	return simple_read_from_buffer(buf, size, ppos, buffer, avail);
}

static int ns_revision_open(struct inode *inode, struct file *file)
{
	struct aa_revision *rev = kzalloc(sizeof(*rev), GFP_KERNEL);

	if (!rev)
		return -ENOMEM;

	rev->ns = aa_get_ns(inode->i_private);
	if (!rev->ns)
		rev->ns = aa_get_current_ns();
	file->private_data = rev;

	return 0;
}

static unsigned int ns_revision_poll(struct file *file, poll_table *pt)
{
	struct aa_revision *rev = file->private_data;
	unsigned int mask = 0;

	if (rev) {
		mutex_lock(&rev->ns->lock);
		poll_wait(file, &rev->ns->wait, pt);
		if (rev->last_read < rev->ns->revision)
			mask |= POLLIN | POLLRDNORM;
		mutex_unlock(&rev->ns->lock);
	}

	return mask;
}

587 588 589
void __aa_bump_ns_revision(struct aa_ns *ns)
{
	ns->revision++;
590
	wake_up_interruptible(&ns->wait);
591 592
}

593 594 595 596 597 598 599 600 601
static const struct file_operations aa_fs_ns_revision_fops = {
	.owner		= THIS_MODULE,
	.open		= ns_revision_open,
	.poll		= ns_revision_poll,
	.read		= ns_revision_read,
	.llseek		= generic_file_llseek,
	.release	= ns_revision_release,
};

602 603 604 605 606 607 608
static void profile_query_cb(struct aa_profile *profile, struct aa_perms *perms,
			     const char *match_str, size_t match_len)
{
	struct aa_perms tmp;
	struct aa_dfa *dfa;
	unsigned int state = 0;

609
	if (profile_unconfined(profile))
610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632
		return;
	if (profile->file.dfa && *match_str == AA_CLASS_FILE) {
		dfa = profile->file.dfa;
		state = aa_dfa_match_len(dfa, profile->file.start,
					 match_str + 1, match_len - 1);
		tmp = nullperms;
		if (state) {
			struct path_cond cond = { };

			tmp = aa_compute_fperms(dfa, state, &cond);
		}
	} else if (profile->policy.dfa) {
		if (!PROFILE_MEDIATES_SAFE(profile, *match_str))
			return;	/* no change to current perms */
		dfa = profile->policy.dfa;
		state = aa_dfa_match_len(dfa, profile->policy.start[0],
					 match_str, match_len);
		if (state)
			aa_compute_perms(dfa, state, &tmp);
		else
			tmp = nullperms;
	}
	aa_apply_modes_to_perms(profile, &tmp);
633
	aa_perms_accum_raw(perms, &tmp);
634 635 636
}


637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659
/**
 * query_data - queries a policy and writes its data to buf
 * @buf: the resulting data is stored here (NOT NULL)
 * @buf_len: size of buf
 * @query: query string used to retrieve data
 * @query_len: size of query including second NUL byte
 *
 * The buffers pointed to by buf and query may overlap. The query buffer is
 * parsed before buf is written to.
 *
 * The query should look like "<LABEL>\0<KEY>\0", where <LABEL> is the name of
 * the security confinement context and <KEY> is the name of the data to
 * retrieve. <LABEL> and <KEY> must not be NUL-terminated.
 *
 * Don't expect the contents of buf to be preserved on failure.
 *
 * Returns: number of characters written to buf or -errno on failure
 */
static ssize_t query_data(char *buf, size_t buf_len,
			  char *query, size_t query_len)
{
	char *out;
	const char *key;
660
	struct label_it i;
661
	struct aa_label *label, *curr;
662
	struct aa_profile *profile;
663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678
	struct aa_data *data;
	u32 bytes, blocks;
	__le32 outle32;

	if (!query_len)
		return -EINVAL; /* need a query */

	key = query + strnlen(query, query_len) + 1;
	if (key + 1 >= query + query_len)
		return -EINVAL; /* not enough space for a non-empty key */
	if (key + strnlen(key, query + query_len - key) >= query + query_len)
		return -EINVAL; /* must end with NUL */

	if (buf_len < sizeof(bytes) + sizeof(blocks))
		return -EINVAL; /* not enough space */

679 680 681 682 683
	curr = begin_current_label_crit_section();
	label = aa_label_parse(curr, query, GFP_KERNEL, false, false);
	end_current_label_crit_section(curr);
	if (IS_ERR(label))
		return PTR_ERR(label);
684 685 686 687 688 689 690 691 692 693 694 695 696

	/* We are going to leave space for two numbers. The first is the total
	 * number of bytes we are writing after the first number. This is so
	 * users can read the full output without reallocation.
	 *
	 * The second number is the number of data blocks we're writing. An
	 * application might be confined by multiple policies having data in
	 * the same key.
	 */
	memset(buf, 0, sizeof(bytes) + sizeof(blocks));
	out = buf + sizeof(bytes) + sizeof(blocks);

	blocks = 0;
697 698 699 700 701 702
	label_for_each_confined(i, label, profile) {
		if (!profile->data)
			continue;

		data = rhashtable_lookup_fast(profile->data, &key,
					      profile->data->p);
703 704

		if (data) {
705 706
			if (out + sizeof(outle32) + data->size > buf +
			    buf_len) {
707
				aa_put_label(label);
708
				return -EINVAL; /* not enough space */
709
			}
710 711 712 713 714 715 716 717
			outle32 = __cpu_to_le32(data->size);
			memcpy(out, &outle32, sizeof(outle32));
			out += sizeof(outle32);
			memcpy(out, data->data, data->size);
			out += data->size;
			blocks++;
		}
	}
718
	aa_put_label(label);
719 720 721 722 723 724 725 726 727

	outle32 = __cpu_to_le32(out - buf - sizeof(bytes));
	memcpy(buf, &outle32, sizeof(outle32));
	outle32 = __cpu_to_le32(blocks);
	memcpy(buf + sizeof(bytes), &outle32, sizeof(outle32));

	return out - buf;
}

728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750
/**
 * query_label - queries a label and writes permissions to buf
 * @buf: the resulting permissions string is stored here (NOT NULL)
 * @buf_len: size of buf
 * @query: binary query string to match against the dfa
 * @query_len: size of query
 * @view_only: only compute for querier's view
 *
 * The buffers pointed to by buf and query may overlap. The query buffer is
 * parsed before buf is written to.
 *
 * The query should look like "LABEL_NAME\0DFA_STRING" where LABEL_NAME is
 * the name of the label, in the current namespace, that is to be queried and
 * DFA_STRING is a binary string to match against the label(s)'s DFA.
 *
 * LABEL_NAME must be NUL terminated. DFA_STRING may contain NUL characters
 * but must *not* be NUL terminated.
 *
 * Returns: number of characters written to buf or -errno on failure
 */
static ssize_t query_label(char *buf, size_t buf_len,
			   char *query, size_t query_len, bool view_only)
{
751
	struct aa_profile *profile;
752
	struct aa_label *label, *curr;
753 754 755
	char *label_name, *match_str;
	size_t label_name_len, match_len;
	struct aa_perms perms;
756
	struct label_it i;
757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774

	if (!query_len)
		return -EINVAL;

	label_name = query;
	label_name_len = strnlen(query, query_len);
	if (!label_name_len || label_name_len == query_len)
		return -EINVAL;

	/**
	 * The extra byte is to account for the null byte between the
	 * profile name and dfa string. profile_name_len is greater
	 * than zero and less than query_len, so a byte can be safely
	 * added or subtracted.
	 */
	match_str = label_name + label_name_len + 1;
	match_len = query_len - label_name_len - 1;

775 776 777 778 779
	curr = begin_current_label_crit_section();
	label = aa_label_parse(curr, label_name, GFP_KERNEL, false, false);
	end_current_label_crit_section(curr);
	if (IS_ERR(label))
		return PTR_ERR(label);
780 781

	perms = allperms;
782 783 784 785 786 787 788 789 790 791
	if (view_only) {
		label_for_each_in_ns(i, labels_ns(label), label, profile) {
			profile_query_cb(profile, &perms, match_str, match_len);
		}
	} else {
		label_for_each(i, label, profile) {
			profile_query_cb(profile, &perms, match_str, match_len);
		}
	}
	aa_put_label(label);
792 793 794 795 796 797

	return scnprintf(buf, buf_len,
		      "allow 0x%08x\ndeny 0x%08x\naudit 0x%08x\nquiet 0x%08x\n",
		      perms.allow, perms.deny, perms.audit, perms.quiet);
}

798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897
/*
 * Transaction based IO.
 * The file expects a write which triggers the transaction, and then
 * possibly a read(s) which collects the result - which is stored in a
 * file-local buffer. Once a new write is performed, a new set of results
 * are stored in the file-local buffer.
 */
struct multi_transaction {
	struct kref count;
	ssize_t size;
	char data[0];
};

#define MULTI_TRANSACTION_LIMIT (PAGE_SIZE - sizeof(struct multi_transaction))
/* TODO: replace with per file lock */
static DEFINE_SPINLOCK(multi_transaction_lock);

static void multi_transaction_kref(struct kref *kref)
{
	struct multi_transaction *t;

	t = container_of(kref, struct multi_transaction, count);
	free_page((unsigned long) t);
}

static struct multi_transaction *
get_multi_transaction(struct multi_transaction *t)
{
	if  (t)
		kref_get(&(t->count));

	return t;
}

static void put_multi_transaction(struct multi_transaction *t)
{
	if (t)
		kref_put(&(t->count), multi_transaction_kref);
}

/* does not increment @new's count */
static void multi_transaction_set(struct file *file,
				  struct multi_transaction *new, size_t n)
{
	struct multi_transaction *old;

	AA_BUG(n > MULTI_TRANSACTION_LIMIT);

	new->size = n;
	spin_lock(&multi_transaction_lock);
	old = (struct multi_transaction *) file->private_data;
	file->private_data = new;
	spin_unlock(&multi_transaction_lock);
	put_multi_transaction(old);
}

static struct multi_transaction *multi_transaction_new(struct file *file,
						       const char __user *buf,
						       size_t size)
{
	struct multi_transaction *t;

	if (size > MULTI_TRANSACTION_LIMIT - 1)
		return ERR_PTR(-EFBIG);

	t = (struct multi_transaction *)get_zeroed_page(GFP_KERNEL);
	if (!t)
		return ERR_PTR(-ENOMEM);
	kref_init(&t->count);
	if (copy_from_user(t->data, buf, size))
		return ERR_PTR(-EFAULT);

	return t;
}

static ssize_t multi_transaction_read(struct file *file, char __user *buf,
				       size_t size, loff_t *pos)
{
	struct multi_transaction *t;
	ssize_t ret;

	spin_lock(&multi_transaction_lock);
	t = get_multi_transaction(file->private_data);
	spin_unlock(&multi_transaction_lock);
	if (!t)
		return 0;

	ret = simple_read_from_buffer(buf, size, pos, t->data, t->size);
	put_multi_transaction(t);

	return ret;
}

static int multi_transaction_release(struct inode *inode, struct file *file)
{
	put_multi_transaction(file->private_data);

	return 0;
}

898 899
#define QUERY_CMD_LABEL		"label\0"
#define QUERY_CMD_LABEL_LEN	6
900 901
#define QUERY_CMD_PROFILE	"profile\0"
#define QUERY_CMD_PROFILE_LEN	8
902 903
#define QUERY_CMD_LABELALL	"labelall\0"
#define QUERY_CMD_LABELALL_LEN	9
904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930
#define QUERY_CMD_DATA		"data\0"
#define QUERY_CMD_DATA_LEN	5

/**
 * aa_write_access - generic permissions and data query
 * @file: pointer to open apparmorfs/access file
 * @ubuf: user buffer containing the complete query string (NOT NULL)
 * @count: size of ubuf
 * @ppos: position in the file (MUST BE ZERO)
 *
 * Allows for one permissions or data query per open(), write(), and read()
 * sequence. The only queries currently supported are label-based queries for
 * permissions or data.
 *
 * For permissions queries, ubuf must begin with "label\0", followed by the
 * profile query specific format described in the query_label() function
 * documentation.
 *
 * For data queries, ubuf must have the form "data\0<LABEL>\0<KEY>\0", where
 * <LABEL> is the name of the security confinement context and <KEY> is the
 * name of the data to retrieve.
 *
 * Returns: number of bytes written or -errno on failure
 */
static ssize_t aa_write_access(struct file *file, const char __user *ubuf,
			       size_t count, loff_t *ppos)
{
931
	struct multi_transaction *t;
932 933 934 935 936
	ssize_t len;

	if (*ppos)
		return -ESPIPE;

937 938 939
	t = multi_transaction_new(file, ubuf, count);
	if (IS_ERR(t))
		return PTR_ERR(t);
940

941 942 943 944 945
	if (count > QUERY_CMD_PROFILE_LEN &&
	    !memcmp(t->data, QUERY_CMD_PROFILE, QUERY_CMD_PROFILE_LEN)) {
		len = query_label(t->data, MULTI_TRANSACTION_LIMIT,
				  t->data + QUERY_CMD_PROFILE_LEN,
				  count - QUERY_CMD_PROFILE_LEN, true);
946 947 948 949 950 951 952 953 954 955 956
	} else if (count > QUERY_CMD_LABEL_LEN &&
		   !memcmp(t->data, QUERY_CMD_LABEL, QUERY_CMD_LABEL_LEN)) {
		len = query_label(t->data, MULTI_TRANSACTION_LIMIT,
				  t->data + QUERY_CMD_LABEL_LEN,
				  count - QUERY_CMD_LABEL_LEN, true);
	} else if (count > QUERY_CMD_LABELALL_LEN &&
		   !memcmp(t->data, QUERY_CMD_LABELALL,
			   QUERY_CMD_LABELALL_LEN)) {
		len = query_label(t->data, MULTI_TRANSACTION_LIMIT,
				  t->data + QUERY_CMD_LABELALL_LEN,
				  count - QUERY_CMD_LABELALL_LEN, false);
957
	} else if (count > QUERY_CMD_DATA_LEN &&
958 959 960
		   !memcmp(t->data, QUERY_CMD_DATA, QUERY_CMD_DATA_LEN)) {
		len = query_data(t->data, MULTI_TRANSACTION_LIMIT,
				 t->data + QUERY_CMD_DATA_LEN,
961 962 963 964
				 count - QUERY_CMD_DATA_LEN);
	} else
		len = -EINVAL;

965 966
	if (len < 0) {
		put_multi_transaction(t);
967
		return len;
968
	}
969

970
	multi_transaction_set(file, t, len);
971 972 973 974

	return count;
}

975
static const struct file_operations aa_sfs_access = {
976
	.write		= aa_write_access,
977 978
	.read		= multi_transaction_read,
	.release	= multi_transaction_release,
979 980 981
	.llseek		= generic_file_llseek,
};

982
static int aa_sfs_seq_show(struct seq_file *seq, void *v)
983
{
984
	struct aa_sfs_entry *fs_file = seq->private;
985 986 987 988 989

	if (!fs_file)
		return 0;

	switch (fs_file->v_type) {
990
	case AA_SFS_TYPE_BOOLEAN:
991 992
		seq_printf(seq, "%s\n", fs_file->v.boolean ? "yes" : "no");
		break;
993
	case AA_SFS_TYPE_STRING:
994 995
		seq_printf(seq, "%s\n", fs_file->v.string);
		break;
996
	case AA_SFS_TYPE_U64:
997 998 999 1000 1001 1002 1003 1004 1005 1006
		seq_printf(seq, "%#08lx\n", fs_file->v.u64);
		break;
	default:
		/* Ignore unpritable entry types. */
		break;
	}

	return 0;
}

1007
static int aa_sfs_seq_open(struct inode *inode, struct file *file)
1008
{
1009
	return single_open(file, aa_sfs_seq_show, inode->i_private);
1010 1011
}

1012
const struct file_operations aa_sfs_seq_file_ops = {
1013
	.owner		= THIS_MODULE,
1014
	.open		= aa_sfs_seq_open,
1015 1016 1017 1018 1019
	.read		= seq_read,
	.llseek		= seq_lseek,
	.release	= single_release,
};

1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040
/*
 * profile based file operations
 *     policy/profiles/XXXX/profiles/ *
 */

#define SEQ_PROFILE_FOPS(NAME)						      \
static int seq_profile_ ##NAME ##_open(struct inode *inode, struct file *file)\
{									      \
	return seq_profile_open(inode, file, seq_profile_ ##NAME ##_show);    \
}									      \
									      \
static const struct file_operations seq_profile_ ##NAME ##_fops = {	      \
	.owner		= THIS_MODULE,					      \
	.open		= seq_profile_ ##NAME ##_open,			      \
	.read		= seq_read,					      \
	.llseek		= seq_lseek,					      \
	.release	= seq_profile_release,				      \
}									      \

static int seq_profile_open(struct inode *inode, struct file *file,
			    int (*show)(struct seq_file *, void *))
1041
{
1042 1043
	struct aa_proxy *proxy = aa_get_proxy(inode->i_private);
	int error = single_open(file, show, proxy);
1044 1045 1046

	if (error) {
		file->private_data = NULL;
1047
		aa_put_proxy(proxy);
1048 1049 1050 1051 1052
	}

	return error;
}

1053
static int seq_profile_release(struct inode *inode, struct file *file)
1054 1055 1056
{
	struct seq_file *seq = (struct seq_file *) file->private_data;
	if (seq)
1057
		aa_put_proxy(seq->private);
1058 1059 1060
	return single_release(inode, file);
}

1061
static int seq_profile_name_show(struct seq_file *seq, void *v)
1062
{
1063
	struct aa_proxy *proxy = seq->private;
1064 1065
	struct aa_label *label = aa_get_label_rcu(&proxy->label);
	struct aa_profile *profile = labels_profile(label);
1066
	seq_printf(seq, "%s\n", profile->base.name);
1067
	aa_put_label(label);
1068 1069 1070 1071

	return 0;
}

1072
static int seq_profile_mode_show(struct seq_file *seq, void *v)
1073
{
1074
	struct aa_proxy *proxy = seq->private;
1075 1076
	struct aa_label *label = aa_get_label_rcu(&proxy->label);
	struct aa_profile *profile = labels_profile(label);
1077
	seq_printf(seq, "%s\n", aa_profile_mode_names[profile->mode]);
1078
	aa_put_label(label);
1079 1080 1081 1082

	return 0;
}

1083
static int seq_profile_attach_show(struct seq_file *seq, void *v)
1084
{
1085
	struct aa_proxy *proxy = seq->private;
1086 1087
	struct aa_label *label = aa_get_label_rcu(&proxy->label);
	struct aa_profile *profile = labels_profile(label);
1088 1089 1090 1091 1092 1093
	if (profile->attach)
		seq_printf(seq, "%s\n", profile->attach);
	else if (profile->xmatch)
		seq_puts(seq, "<unknown>\n");
	else
		seq_printf(seq, "%s\n", profile->base.name);
1094
	aa_put_label(label);
1095 1096 1097 1098

	return 0;
}

1099
static int seq_profile_hash_show(struct seq_file *seq, void *v)
1100
{
1101
	struct aa_proxy *proxy = seq->private;
1102 1103
	struct aa_label *label = aa_get_label_rcu(&proxy->label);
	struct aa_profile *profile = labels_profile(label);
1104 1105 1106 1107 1108
	unsigned int i, size = aa_hash_size();

	if (profile->hash) {
		for (i = 0; i < size; i++)
			seq_printf(seq, "%.2x", profile->hash[i]);
1109
		seq_putc(seq, '\n');
1110
	}
1111
	aa_put_label(label);
1112 1113 1114 1115

	return 0;
}

1116 1117 1118 1119
SEQ_PROFILE_FOPS(name);
SEQ_PROFILE_FOPS(mode);
SEQ_PROFILE_FOPS(attach);
SEQ_PROFILE_FOPS(hash);
1120

1121 1122 1123 1124 1125
/*
 * namespace based files
 *     several root files and
 *     policy/ *
 */
1126

1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139
#define SEQ_NS_FOPS(NAME)						      \
static int seq_ns_ ##NAME ##_open(struct inode *inode, struct file *file)     \
{									      \
	return single_open(file, seq_ns_ ##NAME ##_show, inode->i_private);   \
}									      \
									      \
static const struct file_operations seq_ns_ ##NAME ##_fops = {	      \
	.owner		= THIS_MODULE,					      \
	.open		= seq_ns_ ##NAME ##_open,			      \
	.read		= seq_read,					      \
	.llseek		= seq_lseek,					      \
	.release	= single_release,				      \
}									      \
1140

1141
static int seq_ns_level_show(struct seq_file *seq, void *v)
1142
{
1143
	struct aa_label *label;
1144

1145 1146 1147
	label = begin_current_label_crit_section();
	seq_printf(seq, "%d\n", labels_ns(label)->level);
	end_current_label_crit_section(label);
1148 1149 1150 1151

	return 0;
}

1152
static int seq_ns_name_show(struct seq_file *seq, void *v)
1153
{
1154
	struct aa_label *label = begin_current_label_crit_section();
1155

1156 1157 1158
	seq_printf(seq, "%s\n", aa_ns_name(labels_ns(label),
					   labels_ns(label), true));
	end_current_label_crit_section(label);
1159 1160 1161 1162

	return 0;
}

1163 1164
SEQ_NS_FOPS(level);
SEQ_NS_FOPS(name);
1165

1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184

/* policy/raw_data/ * file ops */

#define SEQ_RAWDATA_FOPS(NAME)						      \
static int seq_rawdata_ ##NAME ##_open(struct inode *inode, struct file *file)\
{									      \
	return seq_rawdata_open(inode, file, seq_rawdata_ ##NAME ##_show);    \
}									      \
									      \
static const struct file_operations seq_rawdata_ ##NAME ##_fops = {	      \
	.owner		= THIS_MODULE,					      \
	.open		= seq_rawdata_ ##NAME ##_open,			      \
	.read		= seq_read,					      \
	.llseek		= seq_lseek,					      \
	.release	= seq_rawdata_release,				      \
}									      \

static int seq_rawdata_open(struct inode *inode, struct file *file,
			    int (*show)(struct seq_file *, void *))
1185
{
1186 1187
	struct aa_loaddata *data = __aa_get_loaddata(inode->i_private);
	int error;
1188

1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200
	if (!data)
		/* lost race this ent is being reaped */
		return -ENOENT;

	error = single_open(file, show, data);
	if (error) {
		AA_BUG(file->private_data &&
		       ((struct seq_file *)file->private_data)->private);
		aa_put_loaddata(data);
	}

	return error;
1201 1202
}

1203
static int seq_rawdata_release(struct inode *inode, struct file *file)
1204
{
1205
	struct seq_file *seq = (struct seq_file *) file->private_data;
1206

1207 1208
	if (seq)
		aa_put_loaddata(seq->private);
1209

1210 1211 1212 1213 1214 1215 1216 1217
	return single_release(inode, file);
}

static int seq_rawdata_abi_show(struct seq_file *seq, void *v)
{
	struct aa_loaddata *data = seq->private;

	seq_printf(seq, "v%d\n", data->abi);
1218 1219 1220 1221

	return 0;
}

1222
static int seq_rawdata_revision_show(struct seq_file *seq, void *v)
1223
{
1224
	struct aa_loaddata *data = seq->private;
1225

1226 1227 1228 1229
	seq_printf(seq, "%ld\n", data->revision);

	return 0;
}
1230

1231
static int seq_rawdata_hash_show(struct seq_file *seq, void *v)
1232
{
1233
	struct aa_loaddata *data = seq->private;
1234 1235
	unsigned int i, size = aa_hash_size();

1236
	if (data->hash) {
1237
		for (i = 0; i < size; i++)
1238
			seq_printf(seq, "%.2x", data->hash[i]);
1239
		seq_putc(seq, '\n');
1240 1241 1242 1243 1244
	}

	return 0;
}

1245 1246 1247
SEQ_RAWDATA_FOPS(abi);
SEQ_RAWDATA_FOPS(revision);
SEQ_RAWDATA_FOPS(hash);
1248 1249 1250 1251 1252 1253 1254 1255 1256 1257

static ssize_t rawdata_read(struct file *file, char __user *buf, size_t size,
			    loff_t *ppos)
{
	struct aa_loaddata *rawdata = file->private_data;

	return simple_read_from_buffer(buf, size, ppos, rawdata->data,
				       rawdata->size);
}

1258
static int rawdata_release(struct inode *inode, struct file *file)
1259
{
1260 1261 1262 1263
	aa_put_loaddata(file->private_data);

	return 0;
}
1264

1265 1266
static int rawdata_open(struct inode *inode, struct file *file)
{
1267 1268
	if (!policy_view_capable(NULL))
		return -EACCES;
1269 1270 1271 1272
	file->private_data = __aa_get_loaddata(inode->i_private);
	if (!file->private_data)
		/* lost race: this entry is being reaped */
		return -ENOENT;
1273 1274 1275 1276

	return 0;
}

1277
static const struct file_operations rawdata_fops = {
1278 1279 1280 1281 1282 1283
	.open = rawdata_open,
	.read = rawdata_read,
	.llseek = generic_file_llseek,
	.release = rawdata_release,
};

1284 1285 1286 1287 1288 1289 1290
static void remove_rawdata_dents(struct aa_loaddata *rawdata)
{
	int i;

	for (i = 0; i < AAFS_LOADDATA_NDENTS; i++) {
		if (!IS_ERR_OR_NULL(rawdata->dents[i])) {
			/* no refcounts on i_private */
1291
			aafs_remove(rawdata->dents[i]);
1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326
			rawdata->dents[i] = NULL;
		}
	}
}

void __aa_fs_remove_rawdata(struct aa_loaddata *rawdata)
{
	AA_BUG(rawdata->ns && !mutex_is_locked(&rawdata->ns->lock));

	if (rawdata->ns) {
		remove_rawdata_dents(rawdata);
		list_del_init(&rawdata->list);
		aa_put_ns(rawdata->ns);
		rawdata->ns = NULL;
	}
}

int __aa_fs_create_rawdata(struct aa_ns *ns, struct aa_loaddata *rawdata)
{
	struct dentry *dent, *dir;

	AA_BUG(!ns);
	AA_BUG(!rawdata);
	AA_BUG(!mutex_is_locked(&ns->lock));
	AA_BUG(!ns_subdata_dir(ns));

	/*
	 * just use ns revision dir was originally created at. This is
	 * under ns->lock and if load is successful revision will be
	 * bumped and is guaranteed to be unique
	 */
	rawdata->name = kasprintf(GFP_KERNEL, "%ld", ns->revision);
	if (!rawdata->name)
		return -ENOMEM;

1327
	dir = aafs_create_dir(rawdata->name, ns_subdata_dir(ns));
1328 1329 1330 1331 1332
	if (IS_ERR(dir))
		/* ->name freed when rawdata freed */
		return PTR_ERR(dir);
	rawdata->dents[AAFS_LOADDATA_DIR] = dir;

1333
	dent = aafs_create_file("abi", S_IFREG | 0444, dir, rawdata,
1334 1335 1336 1337 1338
				      &seq_rawdata_abi_fops);
	if (IS_ERR(dent))
		goto fail;
	rawdata->dents[AAFS_LOADDATA_ABI] = dent;

1339
	dent = aafs_create_file("revision", S_IFREG | 0444, dir, rawdata,
1340 1341 1342 1343 1344 1345
				      &seq_rawdata_revision_fops);
	if (IS_ERR(dent))
		goto fail;
	rawdata->dents[AAFS_LOADDATA_REVISION] = dent;

	if (aa_g_hash_policy) {
1346
		dent = aafs_create_file("sha1", S_IFREG | 0444, dir,
1347 1348 1349 1350 1351 1352
					      rawdata, &seq_rawdata_hash_fops);
		if (IS_ERR(dent))
			goto fail;
		rawdata->dents[AAFS_LOADDATA_HASH] = dent;
	}

1353
	dent = aafs_create_file("raw_data", S_IFREG | 0444,
1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371
				      dir, rawdata, &rawdata_fops);
	if (IS_ERR(dent))
		goto fail;
	rawdata->dents[AAFS_LOADDATA_DATA] = dent;
	d_inode(dent)->i_size = rawdata->size;

	rawdata->ns = aa_get_ns(ns);
	list_add(&rawdata->list, &ns->rawdata_list);
	/* no refcount on inode rawdata */

	return 0;

fail:
	remove_rawdata_dents(rawdata);

	return PTR_ERR(dent);
}

1372
/** fns to setup dynamic per profile/namespace files **/
1373 1374 1375 1376 1377 1378

/**
 *
 * Requires: @profile->ns->lock held
 */
void __aafs_profile_rmdir(struct aa_profile *profile)
1379 1380 1381 1382 1383 1384 1385 1386
{
	struct aa_profile *child;
	int i;

	if (!profile)
		return;

	list_for_each_entry(child, &profile->base.profiles, base.list)
1387
		__aafs_profile_rmdir(child);
1388 1389

	for (i = AAFS_PROF_SIZEOF - 1; i >= 0; --i) {
1390
		struct aa_proxy *proxy;
1391 1392 1393
		if (!profile->dents[i])
			continue;

1394
		proxy = d_inode(profile->dents[i])->i_private;
1395
		aafs_remove(profile->dents[i]);
1396
		aa_put_proxy(proxy);
1397 1398 1399 1400
		profile->dents[i] = NULL;
	}
}

1401 1402 1403 1404 1405 1406
/**
 *
 * Requires: @old->ns->lock held
 */
void __aafs_profile_migrate_dents(struct aa_profile *old,
				  struct aa_profile *new)
1407 1408 1409 1410 1411
{
	int i;

	for (i = 0; i < AAFS_PROF_SIZEOF; i++) {
		new->dents[i] = old->dents[i];
1412
		if (new->dents[i])
1413
			new->dents[i]->d_inode->i_mtime = current_time(new->dents[i]->d_inode);
1414 1415 1416 1417 1418 1419 1420 1421
		old->dents[i] = NULL;
	}
}

static struct dentry *create_profile_file(struct dentry *dir, const char *name,
					  struct aa_profile *profile,
					  const struct file_operations *fops)
{
1422
	struct aa_proxy *proxy = aa_get_proxy(profile->label.proxy);
1423 1424
	struct dentry *dent;

1425
	dent = aafs_create_file(name, S_IFREG | 0444, dir, proxy, fops);
1426
	if (IS_ERR(dent))
1427
		aa_put_proxy(proxy);
1428 1429 1430 1431

	return dent;
}

1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466
static int profile_depth(struct aa_profile *profile)
{
	int depth = 0;

	rcu_read_lock();
	for (depth = 0; profile; profile = rcu_access_pointer(profile->parent))
		depth++;
	rcu_read_unlock();

	return depth;
}

static int gen_symlink_name(char *buffer, size_t bsize, int depth,
			    const char *dirname, const char *fname)
{
	int error;

	for (; depth > 0; depth--) {
		if (bsize < 7)
			return -ENAMETOOLONG;
		strcpy(buffer, "../../");
		buffer += 6;
		bsize -= 6;
	}

	error = snprintf(buffer, bsize, "raw_data/%s/%s", dirname, fname);
	if (error >= bsize || error < 0)
		return -ENAMETOOLONG;

	return 0;
}

/*
 * Requires: @profile->ns->lock held
 */
1467
int __aafs_profile_mkdir(struct aa_profile *profile, struct dentry *parent)
1468 1469 1470 1471 1472 1473 1474 1475 1476 1477
{
	struct aa_profile *child;
	struct dentry *dent = NULL, *dir;
	int error;

	if (!parent) {
		struct aa_profile *p;
		p = aa_deref_parent(profile);
		dent = prof_dir(p);
		/* adding to parent that previously didn't have children */
1478
		dent = aafs_create_dir("profiles", dent);
1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489
		if (IS_ERR(dent))
			goto fail;
		prof_child_dir(p) = parent = dent;
	}

	if (!profile->dirname) {
		int len, id_len;
		len = mangle_name(profile->base.name, NULL);
		id_len = snprintf(NULL, 0, ".%ld", profile->ns->uniq_id);

		profile->dirname = kmalloc(len + id_len + 1, GFP_KERNEL);
1490 1491 1492 1493
		if (!profile->dirname) {
			error = -ENOMEM;
			goto fail2;
		}
1494 1495 1496 1497 1498

		mangle_name(profile->base.name, profile->dirname);
		sprintf(profile->dirname + len, ".%ld", profile->ns->uniq_id++);
	}

1499
	dent = aafs_create_dir(profile->dirname, parent);
1500 1501 1502 1503
	if (IS_ERR(dent))
		goto fail;
	prof_dir(profile) = dir = dent;

1504 1505
	dent = create_profile_file(dir, "name", profile,
				   &seq_profile_name_fops);
1506 1507 1508 1509
	if (IS_ERR(dent))
		goto fail;
	profile->dents[AAFS_PROF_NAME] = dent;

1510 1511
	dent = create_profile_file(dir, "mode", profile,
				   &seq_profile_mode_fops);
1512 1513 1514 1515
	if (IS_ERR(dent))
		goto fail;
	profile->dents[AAFS_PROF_MODE] = dent;

1516
	dent = create_profile_file(dir, "attach", profile,
1517
				   &seq_profile_attach_fops);
1518 1519 1520 1521
	if (IS_ERR(dent))
		goto fail;
	profile->dents[AAFS_PROF_ATTACH] = dent;

1522 1523
	if (profile->hash) {
		dent = create_profile_file(dir, "sha1", profile,
1524
					   &seq_profile_hash_fops);
1525 1526 1527 1528 1529
		if (IS_ERR(dent))
			goto fail;
		profile->dents[AAFS_PROF_HASH] = dent;
	}

1530
	if (profile->rawdata) {
1531 1532 1533 1534 1535 1536 1537
		char target[64];
		int depth = profile_depth(profile);

		error = gen_symlink_name(target, sizeof(target), depth,
					 profile->rawdata->name, "sha1");
		if (error < 0)
			goto fail2;
1538
		dent = aafs_create_symlink("raw_sha1", dir, target, NULL);
1539 1540 1541 1542
		if (IS_ERR(dent))
			goto fail;
		profile->dents[AAFS_PROF_RAW_HASH] = dent;

1543 1544 1545 1546
		error = gen_symlink_name(target, sizeof(target), depth,
					 profile->rawdata->name, "abi");
		if (error < 0)
			goto fail2;
1547
		dent = aafs_create_symlink("raw_abi", dir, target, NULL);
1548 1549 1550 1551
		if (IS_ERR(dent))
			goto fail;
		profile->dents[AAFS_PROF_RAW_ABI] = dent;

1552 1553 1554 1555
		error = gen_symlink_name(target, sizeof(target), depth,
					 profile->rawdata->name, "raw_data");
		if (error < 0)
			goto fail2;
1556
		dent = aafs_create_symlink("raw_data", dir, target, NULL);
1557 1558 1559 1560 1561
		if (IS_ERR(dent))
			goto fail;
		profile->dents[AAFS_PROF_RAW_DATA] = dent;
	}

1562
	list_for_each_entry(child, &profile->base.profiles, base.list) {
1563
		error = __aafs_profile_mkdir(child, prof_child_dir(profile));
1564 1565 1566 1567 1568 1569 1570 1571 1572 1573
		if (error)
			goto fail2;
	}

	return 0;

fail:
	error = PTR_ERR(dent);

fail2:
1574
	__aafs_profile_rmdir(profile);
1575 1576 1577 1578

	return error;
}

1579 1580 1581 1582
static int ns_mkdir_op(struct inode *dir, struct dentry *dentry, umode_t mode)
{
	struct aa_ns *ns, *parent;
	/* TODO: improve permission check */
1583 1584 1585 1586 1587 1588
	struct aa_label *label;
	int error;

	label = begin_current_label_crit_section();
	error = aa_may_manage_policy(label, NULL, AA_MAY_LOAD_POLICY);
	end_current_label_crit_section(label);
1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631
	if (error)
		return error;

	parent = aa_get_ns(dir->i_private);
	AA_BUG(d_inode(ns_subns_dir(parent)) != dir);

	/* we have to unlock and then relock to get locking order right
	 * for pin_fs
	 */
	inode_unlock(dir);
	error = simple_pin_fs(&aafs_ops, &aafs_mnt, &aafs_count);
	mutex_lock(&parent->lock);
	inode_lock_nested(dir, I_MUTEX_PARENT);
	if (error)
		goto out;

	error = __aafs_setup_d_inode(dir, dentry, mode | S_IFDIR,  NULL,
				     NULL, NULL, NULL);
	if (error)
		goto out_pin;

	ns = __aa_find_or_create_ns(parent, READ_ONCE(dentry->d_name.name),
				    dentry);
	if (IS_ERR(ns)) {
		error = PTR_ERR(ns);
		ns = NULL;
	}

	aa_put_ns(ns);		/* list ref remains */
out_pin:
	if (error)
		simple_release_fs(&aafs_mnt, &aafs_count);
out:
	mutex_unlock(&parent->lock);
	aa_put_ns(parent);

	return error;
}

static int ns_rmdir_op(struct inode *dir, struct dentry *dentry)
{
	struct aa_ns *ns, *parent;
	/* TODO: improve permission check */
1632 1633 1634 1635 1636 1637
	struct aa_label *label;
	int error;

	label = begin_current_label_crit_section();
	error = aa_may_manage_policy(label, NULL, AA_MAY_LOAD_POLICY);
	end_current_label_crit_section(label);
1638 1639 1640
	if (error)
		return error;

1641
	 parent = aa_get_ns(dir->i_private);
1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675
	/* rmdir calls the generic securityfs functions to remove files
	 * from the apparmor dir. It is up to the apparmor ns locking
	 * to avoid races.
	 */
	inode_unlock(dir);
	inode_unlock(dentry->d_inode);

	mutex_lock(&parent->lock);
	ns = aa_get_ns(__aa_findn_ns(&parent->sub_ns, dentry->d_name.name,
				     dentry->d_name.len));
	if (!ns) {
		error = -ENOENT;
		goto out;
	}
	AA_BUG(ns_dir(ns) != dentry);

	__aa_remove_ns(ns);
	aa_put_ns(ns);

out:
	mutex_unlock(&parent->lock);
	inode_lock_nested(dir, I_MUTEX_PARENT);
	inode_lock(dentry->d_inode);
	aa_put_ns(parent);

	return error;
}

static const struct inode_operations ns_dir_inode_operations = {
	.lookup		= simple_lookup,
	.mkdir		= ns_mkdir_op,
	.rmdir		= ns_rmdir_op,
};

1676 1677 1678 1679 1680 1681 1682 1683 1684 1685
static void __aa_fs_list_remove_rawdata(struct aa_ns *ns)
{
	struct aa_loaddata *ent, *tmp;

	AA_BUG(!mutex_is_locked(&ns->lock));

	list_for_each_entry_safe(ent, tmp, &ns->rawdata_list, list)
		__aa_fs_remove_rawdata(ent);
}

1686 1687 1688 1689 1690
/**
 *
 * Requires: @ns->lock held
 */
void __aafs_ns_rmdir(struct aa_ns *ns)
1691
{
1692
	struct aa_ns *sub;
1693 1694 1695 1696 1697 1698 1699
	struct aa_profile *child;
	int i;

	if (!ns)
		return;

	list_for_each_entry(child, &ns->base.profiles, base.list)
1700
		__aafs_profile_rmdir(child);
1701 1702 1703

	list_for_each_entry(sub, &ns->sub_ns, base.list) {
		mutex_lock(&sub->lock);
1704
		__aafs_ns_rmdir(sub);
1705 1706 1707
		mutex_unlock(&sub->lock);
	}

1708 1709
	__aa_fs_list_remove_rawdata(ns);

1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725
	if (ns_subns_dir(ns)) {
		sub = d_inode(ns_subns_dir(ns))->i_private;
		aa_put_ns(sub);
	}
	if (ns_subload(ns)) {
		sub = d_inode(ns_subload(ns))->i_private;
		aa_put_ns(sub);
	}
	if (ns_subreplace(ns)) {
		sub = d_inode(ns_subreplace(ns))->i_private;
		aa_put_ns(sub);
	}
	if (ns_subremove(ns)) {
		sub = d_inode(ns_subremove(ns))->i_private;
		aa_put_ns(sub);
	}
1726 1727 1728 1729
	if (ns_subrevision(ns)) {
		sub = d_inode(ns_subrevision(ns))->i_private;
		aa_put_ns(sub);
	}
1730

1731
	for (i = AAFS_NS_SIZEOF - 1; i >= 0; --i) {
1732
		aafs_remove(ns->dents[i]);
1733 1734 1735 1736
		ns->dents[i] = NULL;
	}
}

1737
/* assumes cleanup in caller */
1738
static int __aafs_ns_mkdir_entries(struct aa_ns *ns, struct dentry *dir)
1739 1740 1741 1742 1743 1744
{
	struct dentry *dent;

	AA_BUG(!ns);
	AA_BUG(!dir);

1745
	dent = aafs_create_dir("profiles", dir);
1746 1747 1748 1749
	if (IS_ERR(dent))
		return PTR_ERR(dent);
	ns_subprofs_dir(ns) = dent;

1750
	dent = aafs_create_dir("raw_data", dir);
1751 1752 1753 1754
	if (IS_ERR(dent))
		return PTR_ERR(dent);
	ns_subdata_dir(ns) = dent;

1755 1756 1757 1758 1759 1760 1761
	dent = aafs_create_file("revision", 0444, dir, ns,
				&aa_fs_ns_revision_fops);
	if (IS_ERR(dent))
		return PTR_ERR(dent);
	aa_get_ns(ns);
	ns_subrevision(ns) = dent;

1762
	dent = aafs_create_file(".load", 0640, dir, ns,
1763 1764 1765 1766 1767 1768
				      &aa_fs_profile_load);
	if (IS_ERR(dent))
		return PTR_ERR(dent);
	aa_get_ns(ns);
	ns_subload(ns) = dent;

1769
	dent = aafs_create_file(".replace", 0640, dir, ns,
1770 1771 1772 1773 1774 1775
				      &aa_fs_profile_replace);
	if (IS_ERR(dent))
		return PTR_ERR(dent);
	aa_get_ns(ns);
	ns_subreplace(ns) = dent;

1776
	dent = aafs_create_file(".remove", 0640, dir, ns,
1777 1778 1779 1780 1781 1782
				      &aa_fs_profile_remove);
	if (IS_ERR(dent))
		return PTR_ERR(dent);
	aa_get_ns(ns);
	ns_subremove(ns) = dent;

1783 1784 1785
	  /* use create_dentry so we can supply private data */
	dent = aafs_create("namespaces", S_IFDIR | 0755, dir, ns, NULL, NULL,
			   &ns_dir_inode_operations);
1786 1787 1788 1789 1790 1791 1792 1793
	if (IS_ERR(dent))
		return PTR_ERR(dent);
	aa_get_ns(ns);
	ns_subns_dir(ns) = dent;

	return 0;
}

1794 1795 1796
/*
 * Requires: @ns->lock held
 */
1797 1798
int __aafs_ns_mkdir(struct aa_ns *ns, struct dentry *parent, const char *name,
		    struct dentry *dent)
1799
{
1800
	struct aa_ns *sub;
1801
	struct aa_profile *child;
1802
	struct dentry *dir;
1803 1804
	int error;

1805 1806 1807 1808
	AA_BUG(!ns);
	AA_BUG(!parent);
	AA_BUG(!mutex_is_locked(&ns->lock));

1809 1810 1811
	if (!name)
		name = ns->base.name;

1812 1813 1814 1815 1816 1817 1818
	if (!dent) {
		/* create ns dir if it doesn't already exist */
		dent = aafs_create_dir(name, parent);
		if (IS_ERR(dent))
			goto fail;
	} else
		dget(dent);
1819
	ns_dir(ns) = dir = dent;
1820
	error = __aafs_ns_mkdir_entries(ns, dir);
1821 1822
	if (error)
		goto fail2;
1823

1824
	/* profiles */
1825
	list_for_each_entry(child, &ns->base.profiles, base.list) {
1826
		error = __aafs_profile_mkdir(child, ns_subprofs_dir(ns));
1827 1828 1829 1830
		if (error)
			goto fail2;
	}

1831
	/* subnamespaces */
1832 1833
	list_for_each_entry(sub, &ns->sub_ns, base.list) {
		mutex_lock(&sub->lock);
1834
		error = __aafs_ns_mkdir(sub, ns_subns_dir(ns), NULL, NULL);
1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845
		mutex_unlock(&sub->lock);
		if (error)
			goto fail2;
	}

	return 0;

fail:
	error = PTR_ERR(dent);

fail2:
1846
	__aafs_ns_rmdir(ns);
1847 1848 1849 1850 1851

	return error;
}


1852 1853 1854
#define list_entry_is_head(pos, head, member) (&pos->member == (head))

/**
1855
 * __next_ns - find the next namespace to list
1856 1857 1858 1859 1860 1861 1862 1863 1864 1865
 * @root: root namespace to stop search at (NOT NULL)
 * @ns: current ns position (NOT NULL)
 *
 * Find the next namespace from @ns under @root and handle all locking needed
 * while switching current namespace.
 *
 * Returns: next namespace or NULL if at last namespace under @root
 * Requires: ns->parent->lock to be held
 * NOTE: will not unlock root->lock
 */
1866
static struct aa_ns *__next_ns(struct aa_ns *root, struct aa_ns *ns)
1867
{
1868
	struct aa_ns *parent, *next;
1869 1870 1871 1872 1873 1874 1875 1876 1877 1878

	/* is next namespace a child */
	if (!list_empty(&ns->sub_ns)) {
		next = list_first_entry(&ns->sub_ns, typeof(*ns), base.list);
		mutex_lock(&next->lock);
		return next;
	}

	/* check if the next ns is a sibling, parent, gp, .. */
	parent = ns->parent;
1879
	while (ns != root) {
1880
		mutex_unlock(&ns->lock);
1881
		next = list_next_entry(ns, base.list);
1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900
		if (!list_entry_is_head(next, &parent->sub_ns, base.list)) {
			mutex_lock(&next->lock);
			return next;
		}
		ns = parent;
		parent = parent->parent;
	}

	return NULL;
}

/**
 * __first_profile - find the first profile in a namespace
 * @root: namespace that is root of profiles being displayed (NOT NULL)
 * @ns: namespace to start in   (NOT NULL)
 *
 * Returns: unrefcounted profile or NULL if no profile
 * Requires: profile->ns.lock to be held
 */
1901 1902
static struct aa_profile *__first_profile(struct aa_ns *root,
					  struct aa_ns *ns)
1903
{
1904
	for (; ns; ns = __next_ns(root, ns)) {
1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923
		if (!list_empty(&ns->base.profiles))
			return list_first_entry(&ns->base.profiles,
						struct aa_profile, base.list);
	}
	return NULL;
}

/**
 * __next_profile - step to the next profile in a profile tree
 * @profile: current profile in tree (NOT NULL)
 *
 * Perform a depth first traversal on the profile tree in a namespace
 *
 * Returns: next profile or NULL if done
 * Requires: profile->ns.lock to be held
 */
static struct aa_profile *__next_profile(struct aa_profile *p)
{
	struct aa_profile *parent;
1924
	struct aa_ns *ns = p->ns;
1925 1926 1927 1928 1929 1930 1931 1932 1933 1934

	/* is next profile a child */
	if (!list_empty(&p->base.profiles))
		return list_first_entry(&p->base.profiles, typeof(*p),
					base.list);

	/* is next profile a sibling, parent sibling, gp, sibling, .. */
	parent = rcu_dereference_protected(p->parent,
					   mutex_is_locked(&p->ns->lock));
	while (parent) {
1935
		p = list_next_entry(p, base.list);
1936 1937 1938 1939 1940 1941 1942 1943
		if (!list_entry_is_head(p, &parent->base.profiles, base.list))
			return p;
		p = parent;
		parent = rcu_dereference_protected(parent->parent,
					    mutex_is_locked(&parent->ns->lock));
	}

	/* is next another profile in the namespace */
1944
	p = list_next_entry(p, base.list);
1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957
	if (!list_entry_is_head(p, &ns->base.profiles, base.list))
		return p;

	return NULL;
}

/**
 * next_profile - step to the next profile in where ever it may be
 * @root: root namespace  (NOT NULL)
 * @profile: current profile  (NOT NULL)
 *
 * Returns: next profile or NULL if there isn't one
 */
1958
static struct aa_profile *next_profile(struct aa_ns *root,
1959 1960 1961 1962 1963 1964 1965
				       struct aa_profile *profile)
{
	struct aa_profile *next = __next_profile(profile);
	if (next)
		return next;

	/* finished all profiles in namespace move to next namespace */
1966
	return __first_profile(root, __next_ns(root, profile->ns));
1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980
}

/**
 * p_start - start a depth first traversal of profile tree
 * @f: seq_file to fill
 * @pos: current position
 *
 * Returns: first profile under current namespace or NULL if none found
 *
 * acquires first ns->lock
 */
static void *p_start(struct seq_file *f, loff_t *pos)
{
	struct aa_profile *profile = NULL;
1981
	struct aa_ns *root = aa_get_current_ns();
1982
	loff_t l = *pos;
1983
	f->private = root;
1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008

	/* find the first profile */
	mutex_lock(&root->lock);
	profile = __first_profile(root, root);

	/* skip to position */
	for (; profile && l > 0; l--)
		profile = next_profile(root, profile);

	return profile;
}

/**
 * p_next - read the next profile entry
 * @f: seq_file to fill
 * @p: profile previously returned
 * @pos: current position
 *
 * Returns: next profile after @p or NULL if none
 *
 * may acquire/release locks in namespace tree as necessary
 */
static void *p_next(struct seq_file *f, void *p, loff_t *pos)
{
	struct aa_profile *profile = p;
2009
	struct aa_ns *ns = f->private;
2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024
	(*pos)++;

	return next_profile(ns, profile);
}

/**
 * p_stop - stop depth first traversal
 * @f: seq_file we are filling
 * @p: the last profile writen
 *
 * Release all locking done by p_start/p_next on namespace tree
 */
static void p_stop(struct seq_file *f, void *p)
{
	struct aa_profile *profile = p;
2025
	struct aa_ns *root = f->private, *ns;
2026 2027 2028 2029 2030 2031

	if (profile) {
		for (ns = profile->ns; ns && ns != root; ns = ns->parent)
			mutex_unlock(&ns->lock);
	}
	mutex_unlock(&root->lock);
2032
	aa_put_ns(root);
2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044
}

/**
 * seq_show_profile - show a profile entry
 * @f: seq_file to file
 * @p: current position (profile)    (NOT NULL)
 *
 * Returns: error on failure
 */
static int seq_show_profile(struct seq_file *f, void *p)
{
	struct aa_profile *profile = (struct aa_profile *)p;
2045
	struct aa_ns *root = f->private;
2046

2047 2048 2049
	aa_label_seq_xprint(f, root, &profile->label,
			    FLAG_SHOW_MODE | FLAG_VIEW_SUBNS, GFP_KERNEL);
	seq_putc(f, '\n');
2050 2051 2052 2053

	return 0;
}

2054
static const struct seq_operations aa_sfs_profiles_op = {
2055 2056 2057 2058 2059 2060 2061 2062
	.start = p_start,
	.next = p_next,
	.stop = p_stop,
	.show = seq_show_profile,
};

static int profiles_open(struct inode *inode, struct file *file)
{
2063 2064 2065
	if (!policy_view_capable(NULL))
		return -EACCES;

2066
	return seq_open(file, &aa_sfs_profiles_op);
2067 2068 2069 2070 2071 2072 2073
}

static int profiles_release(struct inode *inode, struct file *file)
{
	return seq_release(inode, file);
}

2074
static const struct file_operations aa_sfs_profiles_fops = {
2075 2076 2077 2078 2079 2080 2081
	.open = profiles_open,
	.read = seq_read,
	.llseek = seq_lseek,
	.release = profiles_release,
};


2082
/** Base file system setup **/
2083 2084 2085
static struct aa_sfs_entry aa_sfs_entry_file[] = {
	AA_SFS_FILE_STRING("mask",
			   "create read write exec append mmap_exec link lock"),
2086 2087 2088
	{ }
};

2089 2090 2091 2092 2093
static struct aa_sfs_entry aa_sfs_entry_ptrace[] = {
	AA_SFS_FILE_STRING("mask", "read trace"),
	{ }
};

2094 2095 2096 2097 2098 2099 2100
static struct aa_sfs_entry aa_sfs_entry_domain[] = {
	AA_SFS_FILE_BOOLEAN("change_hat",	1),
	AA_SFS_FILE_BOOLEAN("change_hatv",	1),
	AA_SFS_FILE_BOOLEAN("change_onexec",	1),
	AA_SFS_FILE_BOOLEAN("change_profile",	1),
	AA_SFS_FILE_BOOLEAN("fix_binfmt_elf_mmap",	1),
	AA_SFS_FILE_STRING("version", "1.2"),
2101 2102 2103
	{ }
};

2104 2105
static struct aa_sfs_entry aa_sfs_entry_versions[] = {
	AA_SFS_FILE_BOOLEAN("v5",	1),
2106 2107
	AA_SFS_FILE_BOOLEAN("v6",	1),
	AA_SFS_FILE_BOOLEAN("v7",	1),
2108 2109 2110
	{ }
};

2111 2112 2113
static struct aa_sfs_entry aa_sfs_entry_policy[] = {
	AA_SFS_DIR("versions",			aa_sfs_entry_versions),
	AA_SFS_FILE_BOOLEAN("set_load",		1),
2114
	{ }
2115 2116
};

2117
static struct aa_sfs_entry aa_sfs_entry_query_label[] = {
2118
	AA_SFS_FILE_STRING("perms", "allow deny audit quiet"),
2119
	AA_SFS_FILE_BOOLEAN("data",		1),
2120
	AA_SFS_FILE_BOOLEAN("multi_transaction",	1),
2121 2122 2123 2124 2125 2126 2127
	{ }
};

static struct aa_sfs_entry aa_sfs_entry_query[] = {
	AA_SFS_DIR("label",			aa_sfs_entry_query_label),
	{ }
};
2128 2129 2130 2131 2132 2133 2134
static struct aa_sfs_entry aa_sfs_entry_features[] = {
	AA_SFS_DIR("policy",			aa_sfs_entry_policy),
	AA_SFS_DIR("domain",			aa_sfs_entry_domain),
	AA_SFS_DIR("file",			aa_sfs_entry_file),
	AA_SFS_FILE_U64("capability",		VFS_CAP_FLAGS_MASK),
	AA_SFS_DIR("rlimit",			aa_sfs_entry_rlimit),
	AA_SFS_DIR("caps",			aa_sfs_entry_caps),
2135
	AA_SFS_DIR("ptrace",			aa_sfs_entry_ptrace),
2136
	AA_SFS_DIR("query",			aa_sfs_entry_query),
2137 2138 2139
	{ }
};

2140 2141 2142 2143 2144 2145
static struct aa_sfs_entry aa_sfs_entry_apparmor[] = {
	AA_SFS_FILE_FOPS(".access", 0640, &aa_sfs_access),
	AA_SFS_FILE_FOPS(".ns_level", 0666, &seq_ns_level_fops),
	AA_SFS_FILE_FOPS(".ns_name", 0640, &seq_ns_name_fops),
	AA_SFS_FILE_FOPS("profiles", 0440, &aa_sfs_profiles_fops),
	AA_SFS_DIR("features", aa_sfs_entry_features),
2146 2147
	{ }
};
J
John Johansen 已提交
2148

2149 2150
static struct aa_sfs_entry aa_sfs_entry =
	AA_SFS_DIR("apparmor", aa_sfs_entry_apparmor);
J
John Johansen 已提交
2151

2152
/**
2153
 * entry_create_file - create a file entry in the apparmor securityfs
2154
 * @fs_file: aa_sfs_entry to build an entry for (NOT NULL)
2155 2156
 * @parent: the parent dentry in the securityfs
 *
2157
 * Use entry_remove_file to remove entries created with this fn.
2158
 */
2159
static int __init entry_create_file(struct aa_sfs_entry *fs_file,
2160
				    struct dentry *parent)
2161 2162 2163 2164 2165 2166 2167 2168 2169 2170
{
	int error = 0;

	fs_file->dentry = securityfs_create_file(fs_file->name,
						 S_IFREG | fs_file->mode,
						 parent, fs_file,
						 fs_file->file_ops);
	if (IS_ERR(fs_file->dentry)) {
		error = PTR_ERR(fs_file->dentry);
		fs_file->dentry = NULL;
J
John Johansen 已提交
2171
	}
2172
	return error;
J
John Johansen 已提交
2173 2174
}

2175
static void __init entry_remove_dir(struct aa_sfs_entry *fs_dir);
J
John Johansen 已提交
2176
/**
2177
 * entry_create_dir - recursively create a directory entry in the securityfs
2178
 * @fs_dir: aa_sfs_entry (and all child entries) to build (NOT NULL)
2179
 * @parent: the parent dentry in the securityfs
J
John Johansen 已提交
2180
 *
2181
 * Use entry_remove_dir to remove entries created with this fn.
J
John Johansen 已提交
2182
 */
2183 2184
static int __init entry_create_dir(struct aa_sfs_entry *fs_dir,
				   struct dentry *parent)
J
John Johansen 已提交
2185
{
2186
	struct aa_sfs_entry *fs_file;
2187 2188
	struct dentry *dir;
	int error;
J
John Johansen 已提交
2189

2190 2191 2192 2193
	dir = securityfs_create_dir(fs_dir->name, parent);
	if (IS_ERR(dir))
		return PTR_ERR(dir);
	fs_dir->dentry = dir;
J
John Johansen 已提交
2194

2195
	for (fs_file = fs_dir->v.files; fs_file && fs_file->name; ++fs_file) {
2196
		if (fs_file->v_type == AA_SFS_TYPE_DIR)
2197
			error = entry_create_dir(fs_file, fs_dir->dentry);
2198
		else
2199
			error = entry_create_file(fs_file, fs_dir->dentry);
2200 2201 2202 2203 2204 2205 2206
		if (error)
			goto failed;
	}

	return 0;

failed:
2207
	entry_remove_dir(fs_dir);
2208

2209 2210 2211 2212
	return error;
}

/**
2213 2214
 * entry_remove_file - drop a single file entry in the apparmor securityfs
 * @fs_file: aa_sfs_entry to detach from the securityfs (NOT NULL)
2215
 */
2216
static void __init entry_remove_file(struct aa_sfs_entry *fs_file)
2217 2218 2219 2220 2221 2222 2223 2224 2225
{
	if (!fs_file->dentry)
		return;

	securityfs_remove(fs_file->dentry);
	fs_file->dentry = NULL;
}

/**
2226
 * entry_remove_dir - recursively drop a directory entry from the securityfs
2227
 * @fs_dir: aa_sfs_entry (and all child entries) to detach (NOT NULL)
2228
 */
2229
static void __init entry_remove_dir(struct aa_sfs_entry *fs_dir)
2230
{
2231
	struct aa_sfs_entry *fs_file;
2232

2233
	for (fs_file = fs_dir->v.files; fs_file && fs_file->name; ++fs_file) {
2234
		if (fs_file->v_type == AA_SFS_TYPE_DIR)
2235
			entry_remove_dir(fs_file);
2236
		else
2237
			entry_remove_file(fs_file);
2238 2239
	}

2240
	entry_remove_file(fs_dir);
J
John Johansen 已提交
2241 2242 2243 2244 2245 2246 2247 2248 2249
}

/**
 * aa_destroy_aafs - cleanup and free aafs
 *
 * releases dentries allocated by aa_create_aafs
 */
void __init aa_destroy_aafs(void)
{
2250
	entry_remove_dir(&aa_sfs_entry);
J
John Johansen 已提交
2251 2252
}

2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281

#define NULL_FILE_NAME ".null"
struct path aa_null;

static int aa_mk_null_file(struct dentry *parent)
{
	struct vfsmount *mount = NULL;
	struct dentry *dentry;
	struct inode *inode;
	int count = 0;
	int error = simple_pin_fs(parent->d_sb->s_type, &mount, &count);

	if (error)
		return error;

	inode_lock(d_inode(parent));
	dentry = lookup_one_len(NULL_FILE_NAME, parent, strlen(NULL_FILE_NAME));
	if (IS_ERR(dentry)) {
		error = PTR_ERR(dentry);
		goto out;
	}
	inode = new_inode(parent->d_inode->i_sb);
	if (!inode) {
		error = -ENOMEM;
		goto out1;
	}

	inode->i_ino = get_next_ino();
	inode->i_mode = S_IFCHR | S_IRUGO | S_IWUGO;
2282
	inode->i_atime = inode->i_mtime = inode->i_ctime = current_time(inode);
2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298
	init_special_inode(inode, S_IFCHR | S_IRUGO | S_IWUGO,
			   MKDEV(MEM_MAJOR, 3));
	d_instantiate(dentry, inode);
	aa_null.dentry = dget(dentry);
	aa_null.mnt = mntget(mount);

	error = 0;

out1:
	dput(dentry);
out:
	inode_unlock(d_inode(parent));
	simple_release_fs(&mount, &count);
	return error;
}

2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351


static const char *policy_get_link(struct dentry *dentry,
				   struct inode *inode,
				   struct delayed_call *done)
{
	struct aa_ns *ns;
	struct path path;

	if (!dentry)
		return ERR_PTR(-ECHILD);
	ns = aa_get_current_ns();
	path.mnt = mntget(aafs_mnt);
	path.dentry = dget(ns_dir(ns));
	nd_jump_link(&path);
	aa_put_ns(ns);

	return NULL;
}

static int ns_get_name(char *buf, size_t size, struct aa_ns *ns,
		       struct inode *inode)
{
	int res = snprintf(buf, size, "%s:[%lu]", AAFS_NAME, inode->i_ino);

	if (res < 0 || res >= size)
		res = -ENOENT;

	return res;
}

static int policy_readlink(struct dentry *dentry, char __user *buffer,
			   int buflen)
{
	struct aa_ns *ns;
	char name[32];
	int res;

	ns = aa_get_current_ns();
	res = ns_get_name(name, sizeof(name), ns, d_inode(dentry));
	if (res >= 0)
		res = readlink_copy(buffer, buflen, name);
	aa_put_ns(ns);

	return res;
}

static const struct inode_operations policy_link_iops = {
	.readlink	= policy_readlink,
	.get_link	= policy_get_link,
};


J
John Johansen 已提交
2352 2353 2354 2355 2356 2357 2358
/**
 * aa_create_aafs - create the apparmor security filesystem
 *
 * dentries created here are released by aa_destroy_aafs
 *
 * Returns: error on failure
 */
2359
static int __init aa_create_aafs(void)
J
John Johansen 已提交
2360
{
2361
	struct dentry *dent;
J
John Johansen 已提交
2362 2363 2364 2365 2366
	int error;

	if (!apparmor_initialized)
		return 0;

2367
	if (aa_sfs_entry.dentry) {
J
John Johansen 已提交
2368 2369 2370 2371
		AA_ERROR("%s: AppArmor securityfs already exists\n", __func__);
		return -EEXIST;
	}

2372 2373 2374 2375 2376 2377
	/* setup apparmorfs used to virtualize policy/ */
	aafs_mnt = kern_mount(&aafs_ops);
	if (IS_ERR(aafs_mnt))
		panic("can't set apparmorfs up\n");
	aafs_mnt->mnt_sb->s_flags &= ~MS_NOUSER;

2378
	/* Populate fs tree. */
2379
	error = entry_create_dir(&aa_sfs_entry, NULL);
J
John Johansen 已提交
2380 2381 2382
	if (error)
		goto error;

2383
	dent = securityfs_create_file(".load", 0666, aa_sfs_entry.dentry,
2384 2385 2386 2387 2388 2389 2390
				      NULL, &aa_fs_profile_load);
	if (IS_ERR(dent)) {
		error = PTR_ERR(dent);
		goto error;
	}
	ns_subload(root_ns) = dent;

2391
	dent = securityfs_create_file(".replace", 0666, aa_sfs_entry.dentry,
2392 2393 2394 2395 2396 2397 2398
				      NULL, &aa_fs_profile_replace);
	if (IS_ERR(dent)) {
		error = PTR_ERR(dent);
		goto error;
	}
	ns_subreplace(root_ns) = dent;

2399
	dent = securityfs_create_file(".remove", 0666, aa_sfs_entry.dentry,
2400 2401 2402 2403 2404 2405 2406
				      NULL, &aa_fs_profile_remove);
	if (IS_ERR(dent)) {
		error = PTR_ERR(dent);
		goto error;
	}
	ns_subremove(root_ns) = dent;

2407 2408 2409 2410 2411 2412 2413 2414 2415
	dent = securityfs_create_file("revision", 0444, aa_sfs_entry.dentry,
				      NULL, &aa_fs_ns_revision_fops);
	if (IS_ERR(dent)) {
		error = PTR_ERR(dent);
		goto error;
	}
	ns_subrevision(root_ns) = dent;

	/* policy tree referenced by magic policy symlink */
2416
	mutex_lock(&root_ns->lock);
2417 2418
	error = __aafs_ns_mkdir(root_ns, aafs_mnt->mnt_root, ".policy",
				aafs_mnt->mnt_root);
2419
	mutex_unlock(&root_ns->lock);
2420 2421 2422
	if (error)
		goto error;

2423 2424 2425 2426 2427 2428 2429 2430
	/* magic symlink similar to nsfs redirects based on task policy */
	dent = securityfs_create_symlink("policy", aa_sfs_entry.dentry,
					 NULL, &policy_link_iops);
	if (IS_ERR(dent)) {
		error = PTR_ERR(dent);
		goto error;
	}

2431
	error = aa_mk_null_file(aa_sfs_entry.dentry);
2432 2433 2434 2435
	if (error)
		goto error;

	/* TODO: add default profile to apparmorfs */
J
John Johansen 已提交
2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447

	/* Report that AppArmor fs is enabled */
	aa_info_message("AppArmor Filesystem Enabled");
	return 0;

error:
	aa_destroy_aafs();
	AA_ERROR("Error creating AppArmor securityfs\n");
	return error;
}

fs_initcall(aa_create_aafs);