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