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