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