1 // SPDX-License-Identifier: GPL-2.0 2 /* 3 * /proc/sys support 4 */ 5 #include <linux/init.h> 6 #include <linux/sysctl.h> 7 #include <linux/poll.h> 8 #include <linux/proc_fs.h> 9 #include <linux/printk.h> 10 #include <linux/security.h> 11 #include <linux/sched.h> 12 #include <linux/cred.h> 13 #include <linux/namei.h> 14 #include <linux/mm.h> 15 #include <linux/uio.h> 16 #include <linux/module.h> 17 #include <linux/bpf-cgroup.h> 18 #include <linux/mount.h> 19 #include "internal.h" 20 21 static const struct dentry_operations proc_sys_dentry_operations; 22 static const struct file_operations proc_sys_file_operations; 23 static const struct inode_operations proc_sys_inode_operations; 24 static const struct file_operations proc_sys_dir_file_operations; 25 static const struct inode_operations proc_sys_dir_operations; 26 27 /* shared constants to be used in various sysctls */ 28 const int sysctl_vals[] = { 0, 1, INT_MAX }; 29 EXPORT_SYMBOL(sysctl_vals); 30 31 /* Support for permanently empty directories */ 32 33 struct ctl_table sysctl_mount_point[] = { 34 { } 35 }; 36 37 static bool is_empty_dir(struct ctl_table_header *head) 38 { 39 return head->ctl_table[0].child == sysctl_mount_point; 40 } 41 42 static void set_empty_dir(struct ctl_dir *dir) 43 { 44 dir->header.ctl_table[0].child = sysctl_mount_point; 45 } 46 47 static void clear_empty_dir(struct ctl_dir *dir) 48 49 { 50 dir->header.ctl_table[0].child = NULL; 51 } 52 53 void proc_sys_poll_notify(struct ctl_table_poll *poll) 54 { 55 if (!poll) 56 return; 57 58 atomic_inc(&poll->event); 59 wake_up_interruptible(&poll->wait); 60 } 61 62 static struct ctl_table root_table[] = { 63 { 64 .procname = "", 65 .mode = S_IFDIR|S_IRUGO|S_IXUGO, 66 }, 67 { } 68 }; 69 static struct ctl_table_root sysctl_table_root = { 70 .default_set.dir.header = { 71 {{.count = 1, 72 .nreg = 1, 73 .ctl_table = root_table }}, 74 .ctl_table_arg = root_table, 75 .root = &sysctl_table_root, 76 .set = &sysctl_table_root.default_set, 77 }, 78 }; 79 80 static DEFINE_SPINLOCK(sysctl_lock); 81 82 static void drop_sysctl_table(struct ctl_table_header *header); 83 static int sysctl_follow_link(struct ctl_table_header **phead, 84 struct ctl_table **pentry); 85 static int insert_links(struct ctl_table_header *head); 86 static void put_links(struct ctl_table_header *header); 87 88 static void sysctl_print_dir(struct ctl_dir *dir) 89 { 90 if (dir->header.parent) 91 sysctl_print_dir(dir->header.parent); 92 pr_cont("%s/", dir->header.ctl_table[0].procname); 93 } 94 95 static int namecmp(const char *name1, int len1, const char *name2, int len2) 96 { 97 int cmp; 98 99 cmp = memcmp(name1, name2, min(len1, len2)); 100 if (cmp == 0) 101 cmp = len1 - len2; 102 return cmp; 103 } 104 105 /* Called under sysctl_lock */ 106 static struct ctl_table *find_entry(struct ctl_table_header **phead, 107 struct ctl_dir *dir, const char *name, int namelen) 108 { 109 struct ctl_table_header *head; 110 struct ctl_table *entry; 111 struct rb_node *node = dir->root.rb_node; 112 113 while (node) 114 { 115 struct ctl_node *ctl_node; 116 const char *procname; 117 int cmp; 118 119 ctl_node = rb_entry(node, struct ctl_node, node); 120 head = ctl_node->header; 121 entry = &head->ctl_table[ctl_node - head->node]; 122 procname = entry->procname; 123 124 cmp = namecmp(name, namelen, procname, strlen(procname)); 125 if (cmp < 0) 126 node = node->rb_left; 127 else if (cmp > 0) 128 node = node->rb_right; 129 else { 130 *phead = head; 131 return entry; 132 } 133 } 134 return NULL; 135 } 136 137 static int insert_entry(struct ctl_table_header *head, struct ctl_table *entry) 138 { 139 struct rb_node *node = &head->node[entry - head->ctl_table].node; 140 struct rb_node **p = &head->parent->root.rb_node; 141 struct rb_node *parent = NULL; 142 const char *name = entry->procname; 143 int namelen = strlen(name); 144 145 while (*p) { 146 struct ctl_table_header *parent_head; 147 struct ctl_table *parent_entry; 148 struct ctl_node *parent_node; 149 const char *parent_name; 150 int cmp; 151 152 parent = *p; 153 parent_node = rb_entry(parent, struct ctl_node, node); 154 parent_head = parent_node->header; 155 parent_entry = &parent_head->ctl_table[parent_node - parent_head->node]; 156 parent_name = parent_entry->procname; 157 158 cmp = namecmp(name, namelen, parent_name, strlen(parent_name)); 159 if (cmp < 0) 160 p = &(*p)->rb_left; 161 else if (cmp > 0) 162 p = &(*p)->rb_right; 163 else { 164 pr_err("sysctl duplicate entry: "); 165 sysctl_print_dir(head->parent); 166 pr_cont("/%s\n", entry->procname); 167 return -EEXIST; 168 } 169 } 170 171 rb_link_node(node, parent, p); 172 rb_insert_color(node, &head->parent->root); 173 return 0; 174 } 175 176 static void erase_entry(struct ctl_table_header *head, struct ctl_table *entry) 177 { 178 struct rb_node *node = &head->node[entry - head->ctl_table].node; 179 180 rb_erase(node, &head->parent->root); 181 } 182 183 static void init_header(struct ctl_table_header *head, 184 struct ctl_table_root *root, struct ctl_table_set *set, 185 struct ctl_node *node, struct ctl_table *table) 186 { 187 head->ctl_table = table; 188 head->ctl_table_arg = table; 189 head->used = 0; 190 head->count = 1; 191 head->nreg = 1; 192 head->unregistering = NULL; 193 head->root = root; 194 head->set = set; 195 head->parent = NULL; 196 head->node = node; 197 INIT_HLIST_HEAD(&head->inodes); 198 if (node) { 199 struct ctl_table *entry; 200 for (entry = table; entry->procname; entry++, node++) 201 node->header = head; 202 } 203 } 204 205 static void erase_header(struct ctl_table_header *head) 206 { 207 struct ctl_table *entry; 208 for (entry = head->ctl_table; entry->procname; entry++) 209 erase_entry(head, entry); 210 } 211 212 static int insert_header(struct ctl_dir *dir, struct ctl_table_header *header) 213 { 214 struct ctl_table *entry; 215 int err; 216 217 /* Is this a permanently empty directory? */ 218 if (is_empty_dir(&dir->header)) 219 return -EROFS; 220 221 /* Am I creating a permanently empty directory? */ 222 if (header->ctl_table == sysctl_mount_point) { 223 if (!RB_EMPTY_ROOT(&dir->root)) 224 return -EINVAL; 225 set_empty_dir(dir); 226 } 227 228 dir->header.nreg++; 229 header->parent = dir; 230 err = insert_links(header); 231 if (err) 232 goto fail_links; 233 for (entry = header->ctl_table; entry->procname; entry++) { 234 err = insert_entry(header, entry); 235 if (err) 236 goto fail; 237 } 238 return 0; 239 fail: 240 erase_header(header); 241 put_links(header); 242 fail_links: 243 if (header->ctl_table == sysctl_mount_point) 244 clear_empty_dir(dir); 245 header->parent = NULL; 246 drop_sysctl_table(&dir->header); 247 return err; 248 } 249 250 /* called under sysctl_lock */ 251 static int use_table(struct ctl_table_header *p) 252 { 253 if (unlikely(p->unregistering)) 254 return 0; 255 p->used++; 256 return 1; 257 } 258 259 /* called under sysctl_lock */ 260 static void unuse_table(struct ctl_table_header *p) 261 { 262 if (!--p->used) 263 if (unlikely(p->unregistering)) 264 complete(p->unregistering); 265 } 266 267 static void proc_sys_invalidate_dcache(struct ctl_table_header *head) 268 { 269 proc_invalidate_siblings_dcache(&head->inodes, &sysctl_lock); 270 } 271 272 /* called under sysctl_lock, will reacquire if has to wait */ 273 static void start_unregistering(struct ctl_table_header *p) 274 { 275 /* 276 * if p->used is 0, nobody will ever touch that entry again; 277 * we'll eliminate all paths to it before dropping sysctl_lock 278 */ 279 if (unlikely(p->used)) { 280 struct completion wait; 281 init_completion(&wait); 282 p->unregistering = &wait; 283 spin_unlock(&sysctl_lock); 284 wait_for_completion(&wait); 285 } else { 286 /* anything non-NULL; we'll never dereference it */ 287 p->unregistering = ERR_PTR(-EINVAL); 288 spin_unlock(&sysctl_lock); 289 } 290 /* 291 * Invalidate dentries for unregistered sysctls: namespaced sysctls 292 * can have duplicate names and contaminate dcache very badly. 293 */ 294 proc_sys_invalidate_dcache(p); 295 /* 296 * do not remove from the list until nobody holds it; walking the 297 * list in do_sysctl() relies on that. 298 */ 299 spin_lock(&sysctl_lock); 300 erase_header(p); 301 } 302 303 static struct ctl_table_header *sysctl_head_grab(struct ctl_table_header *head) 304 { 305 BUG_ON(!head); 306 spin_lock(&sysctl_lock); 307 if (!use_table(head)) 308 head = ERR_PTR(-ENOENT); 309 spin_unlock(&sysctl_lock); 310 return head; 311 } 312 313 static void sysctl_head_finish(struct ctl_table_header *head) 314 { 315 if (!head) 316 return; 317 spin_lock(&sysctl_lock); 318 unuse_table(head); 319 spin_unlock(&sysctl_lock); 320 } 321 322 static struct ctl_table_set * 323 lookup_header_set(struct ctl_table_root *root) 324 { 325 struct ctl_table_set *set = &root->default_set; 326 if (root->lookup) 327 set = root->lookup(root); 328 return set; 329 } 330 331 static struct ctl_table *lookup_entry(struct ctl_table_header **phead, 332 struct ctl_dir *dir, 333 const char *name, int namelen) 334 { 335 struct ctl_table_header *head; 336 struct ctl_table *entry; 337 338 spin_lock(&sysctl_lock); 339 entry = find_entry(&head, dir, name, namelen); 340 if (entry && use_table(head)) 341 *phead = head; 342 else 343 entry = NULL; 344 spin_unlock(&sysctl_lock); 345 return entry; 346 } 347 348 static struct ctl_node *first_usable_entry(struct rb_node *node) 349 { 350 struct ctl_node *ctl_node; 351 352 for (;node; node = rb_next(node)) { 353 ctl_node = rb_entry(node, struct ctl_node, node); 354 if (use_table(ctl_node->header)) 355 return ctl_node; 356 } 357 return NULL; 358 } 359 360 static void first_entry(struct ctl_dir *dir, 361 struct ctl_table_header **phead, struct ctl_table **pentry) 362 { 363 struct ctl_table_header *head = NULL; 364 struct ctl_table *entry = NULL; 365 struct ctl_node *ctl_node; 366 367 spin_lock(&sysctl_lock); 368 ctl_node = first_usable_entry(rb_first(&dir->root)); 369 spin_unlock(&sysctl_lock); 370 if (ctl_node) { 371 head = ctl_node->header; 372 entry = &head->ctl_table[ctl_node - head->node]; 373 } 374 *phead = head; 375 *pentry = entry; 376 } 377 378 static void next_entry(struct ctl_table_header **phead, struct ctl_table **pentry) 379 { 380 struct ctl_table_header *head = *phead; 381 struct ctl_table *entry = *pentry; 382 struct ctl_node *ctl_node = &head->node[entry - head->ctl_table]; 383 384 spin_lock(&sysctl_lock); 385 unuse_table(head); 386 387 ctl_node = first_usable_entry(rb_next(&ctl_node->node)); 388 spin_unlock(&sysctl_lock); 389 head = NULL; 390 if (ctl_node) { 391 head = ctl_node->header; 392 entry = &head->ctl_table[ctl_node - head->node]; 393 } 394 *phead = head; 395 *pentry = entry; 396 } 397 398 /* 399 * sysctl_perm does NOT grant the superuser all rights automatically, because 400 * some sysctl variables are readonly even to root. 401 */ 402 403 static int test_perm(int mode, int op) 404 { 405 if (uid_eq(current_euid(), GLOBAL_ROOT_UID)) 406 mode >>= 6; 407 else if (in_egroup_p(GLOBAL_ROOT_GID)) 408 mode >>= 3; 409 if ((op & ~mode & (MAY_READ|MAY_WRITE|MAY_EXEC)) == 0) 410 return 0; 411 return -EACCES; 412 } 413 414 static int sysctl_perm(struct ctl_table_header *head, struct ctl_table *table, int op) 415 { 416 struct ctl_table_root *root = head->root; 417 int mode; 418 419 if (root->permissions) 420 mode = root->permissions(head, table); 421 else 422 mode = table->mode; 423 424 return test_perm(mode, op); 425 } 426 427 static struct inode *proc_sys_make_inode(struct super_block *sb, 428 struct ctl_table_header *head, struct ctl_table *table) 429 { 430 struct ctl_table_root *root = head->root; 431 struct inode *inode; 432 struct proc_inode *ei; 433 434 inode = new_inode(sb); 435 if (!inode) 436 return ERR_PTR(-ENOMEM); 437 438 inode->i_ino = get_next_ino(); 439 440 ei = PROC_I(inode); 441 442 spin_lock(&sysctl_lock); 443 if (unlikely(head->unregistering)) { 444 spin_unlock(&sysctl_lock); 445 iput(inode); 446 return ERR_PTR(-ENOENT); 447 } 448 ei->sysctl = head; 449 ei->sysctl_entry = table; 450 hlist_add_head_rcu(&ei->sibling_inodes, &head->inodes); 451 head->count++; 452 spin_unlock(&sysctl_lock); 453 454 inode->i_mtime = inode->i_atime = inode->i_ctime = current_time(inode); 455 inode->i_mode = table->mode; 456 if (!S_ISDIR(table->mode)) { 457 inode->i_mode |= S_IFREG; 458 inode->i_op = &proc_sys_inode_operations; 459 inode->i_fop = &proc_sys_file_operations; 460 } else { 461 inode->i_mode |= S_IFDIR; 462 inode->i_op = &proc_sys_dir_operations; 463 inode->i_fop = &proc_sys_dir_file_operations; 464 if (is_empty_dir(head)) 465 make_empty_dir_inode(inode); 466 } 467 468 if (root->set_ownership) 469 root->set_ownership(head, table, &inode->i_uid, &inode->i_gid); 470 else { 471 inode->i_uid = GLOBAL_ROOT_UID; 472 inode->i_gid = GLOBAL_ROOT_GID; 473 } 474 475 return inode; 476 } 477 478 void proc_sys_evict_inode(struct inode *inode, struct ctl_table_header *head) 479 { 480 spin_lock(&sysctl_lock); 481 hlist_del_init_rcu(&PROC_I(inode)->sibling_inodes); 482 if (!--head->count) 483 kfree_rcu(head, rcu); 484 spin_unlock(&sysctl_lock); 485 } 486 487 static struct ctl_table_header *grab_header(struct inode *inode) 488 { 489 struct ctl_table_header *head = PROC_I(inode)->sysctl; 490 if (!head) 491 head = &sysctl_table_root.default_set.dir.header; 492 return sysctl_head_grab(head); 493 } 494 495 static struct dentry *proc_sys_lookup(struct inode *dir, struct dentry *dentry, 496 unsigned int flags) 497 { 498 struct ctl_table_header *head = grab_header(dir); 499 struct ctl_table_header *h = NULL; 500 const struct qstr *name = &dentry->d_name; 501 struct ctl_table *p; 502 struct inode *inode; 503 struct dentry *err = ERR_PTR(-ENOENT); 504 struct ctl_dir *ctl_dir; 505 int ret; 506 507 if (IS_ERR(head)) 508 return ERR_CAST(head); 509 510 ctl_dir = container_of(head, struct ctl_dir, header); 511 512 p = lookup_entry(&h, ctl_dir, name->name, name->len); 513 if (!p) 514 goto out; 515 516 if (S_ISLNK(p->mode)) { 517 ret = sysctl_follow_link(&h, &p); 518 err = ERR_PTR(ret); 519 if (ret) 520 goto out; 521 } 522 523 inode = proc_sys_make_inode(dir->i_sb, h ? h : head, p); 524 if (IS_ERR(inode)) { 525 err = ERR_CAST(inode); 526 goto out; 527 } 528 529 d_set_d_op(dentry, &proc_sys_dentry_operations); 530 err = d_splice_alias(inode, dentry); 531 532 out: 533 if (h) 534 sysctl_head_finish(h); 535 sysctl_head_finish(head); 536 return err; 537 } 538 539 static ssize_t proc_sys_call_handler(struct kiocb *iocb, struct iov_iter *iter, 540 int write) 541 { 542 struct inode *inode = file_inode(iocb->ki_filp); 543 struct ctl_table_header *head = grab_header(inode); 544 struct ctl_table *table = PROC_I(inode)->sysctl_entry; 545 size_t count = iov_iter_count(iter); 546 char *kbuf; 547 ssize_t error; 548 549 if (IS_ERR(head)) 550 return PTR_ERR(head); 551 552 /* 553 * At this point we know that the sysctl was not unregistered 554 * and won't be until we finish. 555 */ 556 error = -EPERM; 557 if (sysctl_perm(head, table, write ? MAY_WRITE : MAY_READ)) 558 goto out; 559 560 /* if that can happen at all, it should be -EINVAL, not -EISDIR */ 561 error = -EINVAL; 562 if (!table->proc_handler) 563 goto out; 564 565 /* don't even try if the size is too large */ 566 error = -ENOMEM; 567 if (count >= KMALLOC_MAX_SIZE) 568 goto out; 569 kbuf = kvzalloc(count + 1, GFP_KERNEL); 570 if (!kbuf) 571 goto out; 572 573 if (write) { 574 error = -EFAULT; 575 if (!copy_from_iter_full(kbuf, count, iter)) 576 goto out_free_buf; 577 kbuf[count] = '\0'; 578 } 579 580 error = BPF_CGROUP_RUN_PROG_SYSCTL(head, table, write, &kbuf, &count, 581 &iocb->ki_pos); 582 if (error) 583 goto out_free_buf; 584 585 /* careful: calling conventions are nasty here */ 586 error = table->proc_handler(table, write, kbuf, &count, &iocb->ki_pos); 587 if (error) 588 goto out_free_buf; 589 590 if (!write) { 591 error = -EFAULT; 592 if (copy_to_iter(kbuf, count, iter) < count) 593 goto out_free_buf; 594 } 595 596 error = count; 597 out_free_buf: 598 kvfree(kbuf); 599 out: 600 sysctl_head_finish(head); 601 602 return error; 603 } 604 605 static ssize_t proc_sys_read(struct kiocb *iocb, struct iov_iter *iter) 606 { 607 return proc_sys_call_handler(iocb, iter, 0); 608 } 609 610 static ssize_t proc_sys_write(struct kiocb *iocb, struct iov_iter *iter) 611 { 612 return proc_sys_call_handler(iocb, iter, 1); 613 } 614 615 static int proc_sys_open(struct inode *inode, struct file *filp) 616 { 617 struct ctl_table_header *head = grab_header(inode); 618 struct ctl_table *table = PROC_I(inode)->sysctl_entry; 619 620 /* sysctl was unregistered */ 621 if (IS_ERR(head)) 622 return PTR_ERR(head); 623 624 if (table->poll) 625 filp->private_data = proc_sys_poll_event(table->poll); 626 627 sysctl_head_finish(head); 628 629 return 0; 630 } 631 632 static __poll_t proc_sys_poll(struct file *filp, poll_table *wait) 633 { 634 struct inode *inode = file_inode(filp); 635 struct ctl_table_header *head = grab_header(inode); 636 struct ctl_table *table = PROC_I(inode)->sysctl_entry; 637 __poll_t ret = DEFAULT_POLLMASK; 638 unsigned long event; 639 640 /* sysctl was unregistered */ 641 if (IS_ERR(head)) 642 return EPOLLERR | EPOLLHUP; 643 644 if (!table->proc_handler) 645 goto out; 646 647 if (!table->poll) 648 goto out; 649 650 event = (unsigned long)filp->private_data; 651 poll_wait(filp, &table->poll->wait, wait); 652 653 if (event != atomic_read(&table->poll->event)) { 654 filp->private_data = proc_sys_poll_event(table->poll); 655 ret = EPOLLIN | EPOLLRDNORM | EPOLLERR | EPOLLPRI; 656 } 657 658 out: 659 sysctl_head_finish(head); 660 661 return ret; 662 } 663 664 static bool proc_sys_fill_cache(struct file *file, 665 struct dir_context *ctx, 666 struct ctl_table_header *head, 667 struct ctl_table *table) 668 { 669 struct dentry *child, *dir = file->f_path.dentry; 670 struct inode *inode; 671 struct qstr qname; 672 ino_t ino = 0; 673 unsigned type = DT_UNKNOWN; 674 675 qname.name = table->procname; 676 qname.len = strlen(table->procname); 677 qname.hash = full_name_hash(dir, qname.name, qname.len); 678 679 child = d_lookup(dir, &qname); 680 if (!child) { 681 DECLARE_WAIT_QUEUE_HEAD_ONSTACK(wq); 682 child = d_alloc_parallel(dir, &qname, &wq); 683 if (IS_ERR(child)) 684 return false; 685 if (d_in_lookup(child)) { 686 struct dentry *res; 687 inode = proc_sys_make_inode(dir->d_sb, head, table); 688 if (IS_ERR(inode)) { 689 d_lookup_done(child); 690 dput(child); 691 return false; 692 } 693 d_set_d_op(child, &proc_sys_dentry_operations); 694 res = d_splice_alias(inode, child); 695 d_lookup_done(child); 696 if (unlikely(res)) { 697 if (IS_ERR(res)) { 698 dput(child); 699 return false; 700 } 701 dput(child); 702 child = res; 703 } 704 } 705 } 706 inode = d_inode(child); 707 ino = inode->i_ino; 708 type = inode->i_mode >> 12; 709 dput(child); 710 return dir_emit(ctx, qname.name, qname.len, ino, type); 711 } 712 713 static bool proc_sys_link_fill_cache(struct file *file, 714 struct dir_context *ctx, 715 struct ctl_table_header *head, 716 struct ctl_table *table) 717 { 718 bool ret = true; 719 720 head = sysctl_head_grab(head); 721 if (IS_ERR(head)) 722 return false; 723 724 /* It is not an error if we can not follow the link ignore it */ 725 if (sysctl_follow_link(&head, &table)) 726 goto out; 727 728 ret = proc_sys_fill_cache(file, ctx, head, table); 729 out: 730 sysctl_head_finish(head); 731 return ret; 732 } 733 734 static int scan(struct ctl_table_header *head, struct ctl_table *table, 735 unsigned long *pos, struct file *file, 736 struct dir_context *ctx) 737 { 738 bool res; 739 740 if ((*pos)++ < ctx->pos) 741 return true; 742 743 if (unlikely(S_ISLNK(table->mode))) 744 res = proc_sys_link_fill_cache(file, ctx, head, table); 745 else 746 res = proc_sys_fill_cache(file, ctx, head, table); 747 748 if (res) 749 ctx->pos = *pos; 750 751 return res; 752 } 753 754 static int proc_sys_readdir(struct file *file, struct dir_context *ctx) 755 { 756 struct ctl_table_header *head = grab_header(file_inode(file)); 757 struct ctl_table_header *h = NULL; 758 struct ctl_table *entry; 759 struct ctl_dir *ctl_dir; 760 unsigned long pos; 761 762 if (IS_ERR(head)) 763 return PTR_ERR(head); 764 765 ctl_dir = container_of(head, struct ctl_dir, header); 766 767 if (!dir_emit_dots(file, ctx)) 768 goto out; 769 770 pos = 2; 771 772 for (first_entry(ctl_dir, &h, &entry); h; next_entry(&h, &entry)) { 773 if (!scan(h, entry, &pos, file, ctx)) { 774 sysctl_head_finish(h); 775 break; 776 } 777 } 778 out: 779 sysctl_head_finish(head); 780 return 0; 781 } 782 783 static int proc_sys_permission(struct user_namespace *mnt_userns, 784 struct inode *inode, int mask) 785 { 786 /* 787 * sysctl entries that are not writeable, 788 * are _NOT_ writeable, capabilities or not. 789 */ 790 struct ctl_table_header *head; 791 struct ctl_table *table; 792 int error; 793 794 /* Executable files are not allowed under /proc/sys/ */ 795 if ((mask & MAY_EXEC) && S_ISREG(inode->i_mode)) 796 return -EACCES; 797 798 head = grab_header(inode); 799 if (IS_ERR(head)) 800 return PTR_ERR(head); 801 802 table = PROC_I(inode)->sysctl_entry; 803 if (!table) /* global root - r-xr-xr-x */ 804 error = mask & MAY_WRITE ? -EACCES : 0; 805 else /* Use the permissions on the sysctl table entry */ 806 error = sysctl_perm(head, table, mask & ~MAY_NOT_BLOCK); 807 808 sysctl_head_finish(head); 809 return error; 810 } 811 812 static int proc_sys_setattr(struct user_namespace *mnt_userns, 813 struct dentry *dentry, struct iattr *attr) 814 { 815 struct inode *inode = d_inode(dentry); 816 int error; 817 818 if (attr->ia_valid & (ATTR_MODE | ATTR_UID | ATTR_GID)) 819 return -EPERM; 820 821 error = setattr_prepare(&init_user_ns, dentry, attr); 822 if (error) 823 return error; 824 825 setattr_copy(&init_user_ns, inode, attr); 826 mark_inode_dirty(inode); 827 return 0; 828 } 829 830 static int proc_sys_getattr(struct user_namespace *mnt_userns, 831 const struct path *path, struct kstat *stat, 832 u32 request_mask, unsigned int query_flags) 833 { 834 struct inode *inode = d_inode(path->dentry); 835 struct ctl_table_header *head = grab_header(inode); 836 struct ctl_table *table = PROC_I(inode)->sysctl_entry; 837 838 if (IS_ERR(head)) 839 return PTR_ERR(head); 840 841 generic_fillattr(&init_user_ns, inode, stat); 842 if (table) 843 stat->mode = (stat->mode & S_IFMT) | table->mode; 844 845 sysctl_head_finish(head); 846 return 0; 847 } 848 849 static const struct file_operations proc_sys_file_operations = { 850 .open = proc_sys_open, 851 .poll = proc_sys_poll, 852 .read_iter = proc_sys_read, 853 .write_iter = proc_sys_write, 854 .splice_read = generic_file_splice_read, 855 .splice_write = iter_file_splice_write, 856 .llseek = default_llseek, 857 }; 858 859 static const struct file_operations proc_sys_dir_file_operations = { 860 .read = generic_read_dir, 861 .iterate_shared = proc_sys_readdir, 862 .llseek = generic_file_llseek, 863 }; 864 865 static const struct inode_operations proc_sys_inode_operations = { 866 .permission = proc_sys_permission, 867 .setattr = proc_sys_setattr, 868 .getattr = proc_sys_getattr, 869 }; 870 871 static const struct inode_operations proc_sys_dir_operations = { 872 .lookup = proc_sys_lookup, 873 .permission = proc_sys_permission, 874 .setattr = proc_sys_setattr, 875 .getattr = proc_sys_getattr, 876 }; 877 878 static int proc_sys_revalidate(struct dentry *dentry, unsigned int flags) 879 { 880 if (flags & LOOKUP_RCU) 881 return -ECHILD; 882 return !PROC_I(d_inode(dentry))->sysctl->unregistering; 883 } 884 885 static int proc_sys_delete(const struct dentry *dentry) 886 { 887 return !!PROC_I(d_inode(dentry))->sysctl->unregistering; 888 } 889 890 static int sysctl_is_seen(struct ctl_table_header *p) 891 { 892 struct ctl_table_set *set = p->set; 893 int res; 894 spin_lock(&sysctl_lock); 895 if (p->unregistering) 896 res = 0; 897 else if (!set->is_seen) 898 res = 1; 899 else 900 res = set->is_seen(set); 901 spin_unlock(&sysctl_lock); 902 return res; 903 } 904 905 static int proc_sys_compare(const struct dentry *dentry, 906 unsigned int len, const char *str, const struct qstr *name) 907 { 908 struct ctl_table_header *head; 909 struct inode *inode; 910 911 /* Although proc doesn't have negative dentries, rcu-walk means 912 * that inode here can be NULL */ 913 /* AV: can it, indeed? */ 914 inode = d_inode_rcu(dentry); 915 if (!inode) 916 return 1; 917 if (name->len != len) 918 return 1; 919 if (memcmp(name->name, str, len)) 920 return 1; 921 head = rcu_dereference(PROC_I(inode)->sysctl); 922 return !head || !sysctl_is_seen(head); 923 } 924 925 static const struct dentry_operations proc_sys_dentry_operations = { 926 .d_revalidate = proc_sys_revalidate, 927 .d_delete = proc_sys_delete, 928 .d_compare = proc_sys_compare, 929 }; 930 931 static struct ctl_dir *find_subdir(struct ctl_dir *dir, 932 const char *name, int namelen) 933 { 934 struct ctl_table_header *head; 935 struct ctl_table *entry; 936 937 entry = find_entry(&head, dir, name, namelen); 938 if (!entry) 939 return ERR_PTR(-ENOENT); 940 if (!S_ISDIR(entry->mode)) 941 return ERR_PTR(-ENOTDIR); 942 return container_of(head, struct ctl_dir, header); 943 } 944 945 static struct ctl_dir *new_dir(struct ctl_table_set *set, 946 const char *name, int namelen) 947 { 948 struct ctl_table *table; 949 struct ctl_dir *new; 950 struct ctl_node *node; 951 char *new_name; 952 953 new = kzalloc(sizeof(*new) + sizeof(struct ctl_node) + 954 sizeof(struct ctl_table)*2 + namelen + 1, 955 GFP_KERNEL); 956 if (!new) 957 return NULL; 958 959 node = (struct ctl_node *)(new + 1); 960 table = (struct ctl_table *)(node + 1); 961 new_name = (char *)(table + 2); 962 memcpy(new_name, name, namelen); 963 new_name[namelen] = '\0'; 964 table[0].procname = new_name; 965 table[0].mode = S_IFDIR|S_IRUGO|S_IXUGO; 966 init_header(&new->header, set->dir.header.root, set, node, table); 967 968 return new; 969 } 970 971 /** 972 * get_subdir - find or create a subdir with the specified name. 973 * @dir: Directory to create the subdirectory in 974 * @name: The name of the subdirectory to find or create 975 * @namelen: The length of name 976 * 977 * Takes a directory with an elevated reference count so we know that 978 * if we drop the lock the directory will not go away. Upon success 979 * the reference is moved from @dir to the returned subdirectory. 980 * Upon error an error code is returned and the reference on @dir is 981 * simply dropped. 982 */ 983 static struct ctl_dir *get_subdir(struct ctl_dir *dir, 984 const char *name, int namelen) 985 { 986 struct ctl_table_set *set = dir->header.set; 987 struct ctl_dir *subdir, *new = NULL; 988 int err; 989 990 spin_lock(&sysctl_lock); 991 subdir = find_subdir(dir, name, namelen); 992 if (!IS_ERR(subdir)) 993 goto found; 994 if (PTR_ERR(subdir) != -ENOENT) 995 goto failed; 996 997 spin_unlock(&sysctl_lock); 998 new = new_dir(set, name, namelen); 999 spin_lock(&sysctl_lock); 1000 subdir = ERR_PTR(-ENOMEM); 1001 if (!new) 1002 goto failed; 1003 1004 /* Was the subdir added while we dropped the lock? */ 1005 subdir = find_subdir(dir, name, namelen); 1006 if (!IS_ERR(subdir)) 1007 goto found; 1008 if (PTR_ERR(subdir) != -ENOENT) 1009 goto failed; 1010 1011 /* Nope. Use the our freshly made directory entry. */ 1012 err = insert_header(dir, &new->header); 1013 subdir = ERR_PTR(err); 1014 if (err) 1015 goto failed; 1016 subdir = new; 1017 found: 1018 subdir->header.nreg++; 1019 failed: 1020 if (IS_ERR(subdir)) { 1021 pr_err("sysctl could not get directory: "); 1022 sysctl_print_dir(dir); 1023 pr_cont("/%*.*s %ld\n", 1024 namelen, namelen, name, PTR_ERR(subdir)); 1025 } 1026 drop_sysctl_table(&dir->header); 1027 if (new) 1028 drop_sysctl_table(&new->header); 1029 spin_unlock(&sysctl_lock); 1030 return subdir; 1031 } 1032 1033 static struct ctl_dir *xlate_dir(struct ctl_table_set *set, struct ctl_dir *dir) 1034 { 1035 struct ctl_dir *parent; 1036 const char *procname; 1037 if (!dir->header.parent) 1038 return &set->dir; 1039 parent = xlate_dir(set, dir->header.parent); 1040 if (IS_ERR(parent)) 1041 return parent; 1042 procname = dir->header.ctl_table[0].procname; 1043 return find_subdir(parent, procname, strlen(procname)); 1044 } 1045 1046 static int sysctl_follow_link(struct ctl_table_header **phead, 1047 struct ctl_table **pentry) 1048 { 1049 struct ctl_table_header *head; 1050 struct ctl_table_root *root; 1051 struct ctl_table_set *set; 1052 struct ctl_table *entry; 1053 struct ctl_dir *dir; 1054 int ret; 1055 1056 ret = 0; 1057 spin_lock(&sysctl_lock); 1058 root = (*pentry)->data; 1059 set = lookup_header_set(root); 1060 dir = xlate_dir(set, (*phead)->parent); 1061 if (IS_ERR(dir)) 1062 ret = PTR_ERR(dir); 1063 else { 1064 const char *procname = (*pentry)->procname; 1065 head = NULL; 1066 entry = find_entry(&head, dir, procname, strlen(procname)); 1067 ret = -ENOENT; 1068 if (entry && use_table(head)) { 1069 unuse_table(*phead); 1070 *phead = head; 1071 *pentry = entry; 1072 ret = 0; 1073 } 1074 } 1075 1076 spin_unlock(&sysctl_lock); 1077 return ret; 1078 } 1079 1080 static int sysctl_err(const char *path, struct ctl_table *table, char *fmt, ...) 1081 { 1082 struct va_format vaf; 1083 va_list args; 1084 1085 va_start(args, fmt); 1086 vaf.fmt = fmt; 1087 vaf.va = &args; 1088 1089 pr_err("sysctl table check failed: %s/%s %pV\n", 1090 path, table->procname, &vaf); 1091 1092 va_end(args); 1093 return -EINVAL; 1094 } 1095 1096 static int sysctl_check_table_array(const char *path, struct ctl_table *table) 1097 { 1098 int err = 0; 1099 1100 if ((table->proc_handler == proc_douintvec) || 1101 (table->proc_handler == proc_douintvec_minmax)) { 1102 if (table->maxlen != sizeof(unsigned int)) 1103 err |= sysctl_err(path, table, "array not allowed"); 1104 } 1105 1106 return err; 1107 } 1108 1109 static int sysctl_check_table(const char *path, struct ctl_table *table) 1110 { 1111 int err = 0; 1112 for (; table->procname; table++) { 1113 if (table->child) 1114 err |= sysctl_err(path, table, "Not a file"); 1115 1116 if ((table->proc_handler == proc_dostring) || 1117 (table->proc_handler == proc_dointvec) || 1118 (table->proc_handler == proc_douintvec) || 1119 (table->proc_handler == proc_douintvec_minmax) || 1120 (table->proc_handler == proc_dointvec_minmax) || 1121 (table->proc_handler == proc_dointvec_jiffies) || 1122 (table->proc_handler == proc_dointvec_userhz_jiffies) || 1123 (table->proc_handler == proc_dointvec_ms_jiffies) || 1124 (table->proc_handler == proc_doulongvec_minmax) || 1125 (table->proc_handler == proc_doulongvec_ms_jiffies_minmax)) { 1126 if (!table->data) 1127 err |= sysctl_err(path, table, "No data"); 1128 if (!table->maxlen) 1129 err |= sysctl_err(path, table, "No maxlen"); 1130 else 1131 err |= sysctl_check_table_array(path, table); 1132 } 1133 if (!table->proc_handler) 1134 err |= sysctl_err(path, table, "No proc_handler"); 1135 1136 if ((table->mode & (S_IRUGO|S_IWUGO)) != table->mode) 1137 err |= sysctl_err(path, table, "bogus .mode 0%o", 1138 table->mode); 1139 } 1140 return err; 1141 } 1142 1143 static struct ctl_table_header *new_links(struct ctl_dir *dir, struct ctl_table *table, 1144 struct ctl_table_root *link_root) 1145 { 1146 struct ctl_table *link_table, *entry, *link; 1147 struct ctl_table_header *links; 1148 struct ctl_node *node; 1149 char *link_name; 1150 int nr_entries, name_bytes; 1151 1152 name_bytes = 0; 1153 nr_entries = 0; 1154 for (entry = table; entry->procname; entry++) { 1155 nr_entries++; 1156 name_bytes += strlen(entry->procname) + 1; 1157 } 1158 1159 links = kzalloc(sizeof(struct ctl_table_header) + 1160 sizeof(struct ctl_node)*nr_entries + 1161 sizeof(struct ctl_table)*(nr_entries + 1) + 1162 name_bytes, 1163 GFP_KERNEL); 1164 1165 if (!links) 1166 return NULL; 1167 1168 node = (struct ctl_node *)(links + 1); 1169 link_table = (struct ctl_table *)(node + nr_entries); 1170 link_name = (char *)&link_table[nr_entries + 1]; 1171 1172 for (link = link_table, entry = table; entry->procname; link++, entry++) { 1173 int len = strlen(entry->procname) + 1; 1174 memcpy(link_name, entry->procname, len); 1175 link->procname = link_name; 1176 link->mode = S_IFLNK|S_IRWXUGO; 1177 link->data = link_root; 1178 link_name += len; 1179 } 1180 init_header(links, dir->header.root, dir->header.set, node, link_table); 1181 links->nreg = nr_entries; 1182 1183 return links; 1184 } 1185 1186 static bool get_links(struct ctl_dir *dir, 1187 struct ctl_table *table, struct ctl_table_root *link_root) 1188 { 1189 struct ctl_table_header *head; 1190 struct ctl_table *entry, *link; 1191 1192 /* Are there links available for every entry in table? */ 1193 for (entry = table; entry->procname; entry++) { 1194 const char *procname = entry->procname; 1195 link = find_entry(&head, dir, procname, strlen(procname)); 1196 if (!link) 1197 return false; 1198 if (S_ISDIR(link->mode) && S_ISDIR(entry->mode)) 1199 continue; 1200 if (S_ISLNK(link->mode) && (link->data == link_root)) 1201 continue; 1202 return false; 1203 } 1204 1205 /* The checks passed. Increase the registration count on the links */ 1206 for (entry = table; entry->procname; entry++) { 1207 const char *procname = entry->procname; 1208 link = find_entry(&head, dir, procname, strlen(procname)); 1209 head->nreg++; 1210 } 1211 return true; 1212 } 1213 1214 static int insert_links(struct ctl_table_header *head) 1215 { 1216 struct ctl_table_set *root_set = &sysctl_table_root.default_set; 1217 struct ctl_dir *core_parent = NULL; 1218 struct ctl_table_header *links; 1219 int err; 1220 1221 if (head->set == root_set) 1222 return 0; 1223 1224 core_parent = xlate_dir(root_set, head->parent); 1225 if (IS_ERR(core_parent)) 1226 return 0; 1227 1228 if (get_links(core_parent, head->ctl_table, head->root)) 1229 return 0; 1230 1231 core_parent->header.nreg++; 1232 spin_unlock(&sysctl_lock); 1233 1234 links = new_links(core_parent, head->ctl_table, head->root); 1235 1236 spin_lock(&sysctl_lock); 1237 err = -ENOMEM; 1238 if (!links) 1239 goto out; 1240 1241 err = 0; 1242 if (get_links(core_parent, head->ctl_table, head->root)) { 1243 kfree(links); 1244 goto out; 1245 } 1246 1247 err = insert_header(core_parent, links); 1248 if (err) 1249 kfree(links); 1250 out: 1251 drop_sysctl_table(&core_parent->header); 1252 return err; 1253 } 1254 1255 /** 1256 * __register_sysctl_table - register a leaf sysctl table 1257 * @set: Sysctl tree to register on 1258 * @path: The path to the directory the sysctl table is in. 1259 * @table: the top-level table structure 1260 * 1261 * Register a sysctl table hierarchy. @table should be a filled in ctl_table 1262 * array. A completely 0 filled entry terminates the table. 1263 * 1264 * The members of the &struct ctl_table structure are used as follows: 1265 * 1266 * procname - the name of the sysctl file under /proc/sys. Set to %NULL to not 1267 * enter a sysctl file 1268 * 1269 * data - a pointer to data for use by proc_handler 1270 * 1271 * maxlen - the maximum size in bytes of the data 1272 * 1273 * mode - the file permissions for the /proc/sys file 1274 * 1275 * child - must be %NULL. 1276 * 1277 * proc_handler - the text handler routine (described below) 1278 * 1279 * extra1, extra2 - extra pointers usable by the proc handler routines 1280 * 1281 * Leaf nodes in the sysctl tree will be represented by a single file 1282 * under /proc; non-leaf nodes will be represented by directories. 1283 * 1284 * There must be a proc_handler routine for any terminal nodes. 1285 * Several default handlers are available to cover common cases - 1286 * 1287 * proc_dostring(), proc_dointvec(), proc_dointvec_jiffies(), 1288 * proc_dointvec_userhz_jiffies(), proc_dointvec_minmax(), 1289 * proc_doulongvec_ms_jiffies_minmax(), proc_doulongvec_minmax() 1290 * 1291 * It is the handler's job to read the input buffer from user memory 1292 * and process it. The handler should return 0 on success. 1293 * 1294 * This routine returns %NULL on a failure to register, and a pointer 1295 * to the table header on success. 1296 */ 1297 struct ctl_table_header *__register_sysctl_table( 1298 struct ctl_table_set *set, 1299 const char *path, struct ctl_table *table) 1300 { 1301 struct ctl_table_root *root = set->dir.header.root; 1302 struct ctl_table_header *header; 1303 const char *name, *nextname; 1304 struct ctl_dir *dir; 1305 struct ctl_table *entry; 1306 struct ctl_node *node; 1307 int nr_entries = 0; 1308 1309 for (entry = table; entry->procname; entry++) 1310 nr_entries++; 1311 1312 header = kzalloc(sizeof(struct ctl_table_header) + 1313 sizeof(struct ctl_node)*nr_entries, GFP_KERNEL); 1314 if (!header) 1315 return NULL; 1316 1317 node = (struct ctl_node *)(header + 1); 1318 init_header(header, root, set, node, table); 1319 if (sysctl_check_table(path, table)) 1320 goto fail; 1321 1322 spin_lock(&sysctl_lock); 1323 dir = &set->dir; 1324 /* Reference moved down the diretory tree get_subdir */ 1325 dir->header.nreg++; 1326 spin_unlock(&sysctl_lock); 1327 1328 /* Find the directory for the ctl_table */ 1329 for (name = path; name; name = nextname) { 1330 int namelen; 1331 nextname = strchr(name, '/'); 1332 if (nextname) { 1333 namelen = nextname - name; 1334 nextname++; 1335 } else { 1336 namelen = strlen(name); 1337 } 1338 if (namelen == 0) 1339 continue; 1340 1341 dir = get_subdir(dir, name, namelen); 1342 if (IS_ERR(dir)) 1343 goto fail; 1344 } 1345 1346 spin_lock(&sysctl_lock); 1347 if (insert_header(dir, header)) 1348 goto fail_put_dir_locked; 1349 1350 drop_sysctl_table(&dir->header); 1351 spin_unlock(&sysctl_lock); 1352 1353 return header; 1354 1355 fail_put_dir_locked: 1356 drop_sysctl_table(&dir->header); 1357 spin_unlock(&sysctl_lock); 1358 fail: 1359 kfree(header); 1360 dump_stack(); 1361 return NULL; 1362 } 1363 1364 /** 1365 * register_sysctl - register a sysctl table 1366 * @path: The path to the directory the sysctl table is in. 1367 * @table: the table structure 1368 * 1369 * Register a sysctl table. @table should be a filled in ctl_table 1370 * array. A completely 0 filled entry terminates the table. 1371 * 1372 * See __register_sysctl_table for more details. 1373 */ 1374 struct ctl_table_header *register_sysctl(const char *path, struct ctl_table *table) 1375 { 1376 return __register_sysctl_table(&sysctl_table_root.default_set, 1377 path, table); 1378 } 1379 EXPORT_SYMBOL(register_sysctl); 1380 1381 static char *append_path(const char *path, char *pos, const char *name) 1382 { 1383 int namelen; 1384 namelen = strlen(name); 1385 if (((pos - path) + namelen + 2) >= PATH_MAX) 1386 return NULL; 1387 memcpy(pos, name, namelen); 1388 pos[namelen] = '/'; 1389 pos[namelen + 1] = '\0'; 1390 pos += namelen + 1; 1391 return pos; 1392 } 1393 1394 static int count_subheaders(struct ctl_table *table) 1395 { 1396 int has_files = 0; 1397 int nr_subheaders = 0; 1398 struct ctl_table *entry; 1399 1400 /* special case: no directory and empty directory */ 1401 if (!table || !table->procname) 1402 return 1; 1403 1404 for (entry = table; entry->procname; entry++) { 1405 if (entry->child) 1406 nr_subheaders += count_subheaders(entry->child); 1407 else 1408 has_files = 1; 1409 } 1410 return nr_subheaders + has_files; 1411 } 1412 1413 static int register_leaf_sysctl_tables(const char *path, char *pos, 1414 struct ctl_table_header ***subheader, struct ctl_table_set *set, 1415 struct ctl_table *table) 1416 { 1417 struct ctl_table *ctl_table_arg = NULL; 1418 struct ctl_table *entry, *files; 1419 int nr_files = 0; 1420 int nr_dirs = 0; 1421 int err = -ENOMEM; 1422 1423 for (entry = table; entry->procname; entry++) { 1424 if (entry->child) 1425 nr_dirs++; 1426 else 1427 nr_files++; 1428 } 1429 1430 files = table; 1431 /* If there are mixed files and directories we need a new table */ 1432 if (nr_dirs && nr_files) { 1433 struct ctl_table *new; 1434 files = kcalloc(nr_files + 1, sizeof(struct ctl_table), 1435 GFP_KERNEL); 1436 if (!files) 1437 goto out; 1438 1439 ctl_table_arg = files; 1440 for (new = files, entry = table; entry->procname; entry++) { 1441 if (entry->child) 1442 continue; 1443 *new = *entry; 1444 new++; 1445 } 1446 } 1447 1448 /* Register everything except a directory full of subdirectories */ 1449 if (nr_files || !nr_dirs) { 1450 struct ctl_table_header *header; 1451 header = __register_sysctl_table(set, path, files); 1452 if (!header) { 1453 kfree(ctl_table_arg); 1454 goto out; 1455 } 1456 1457 /* Remember if we need to free the file table */ 1458 header->ctl_table_arg = ctl_table_arg; 1459 **subheader = header; 1460 (*subheader)++; 1461 } 1462 1463 /* Recurse into the subdirectories. */ 1464 for (entry = table; entry->procname; entry++) { 1465 char *child_pos; 1466 1467 if (!entry->child) 1468 continue; 1469 1470 err = -ENAMETOOLONG; 1471 child_pos = append_path(path, pos, entry->procname); 1472 if (!child_pos) 1473 goto out; 1474 1475 err = register_leaf_sysctl_tables(path, child_pos, subheader, 1476 set, entry->child); 1477 pos[0] = '\0'; 1478 if (err) 1479 goto out; 1480 } 1481 err = 0; 1482 out: 1483 /* On failure our caller will unregister all registered subheaders */ 1484 return err; 1485 } 1486 1487 /** 1488 * __register_sysctl_paths - register a sysctl table hierarchy 1489 * @set: Sysctl tree to register on 1490 * @path: The path to the directory the sysctl table is in. 1491 * @table: the top-level table structure 1492 * 1493 * Register a sysctl table hierarchy. @table should be a filled in ctl_table 1494 * array. A completely 0 filled entry terminates the table. 1495 * 1496 * See __register_sysctl_table for more details. 1497 */ 1498 struct ctl_table_header *__register_sysctl_paths( 1499 struct ctl_table_set *set, 1500 const struct ctl_path *path, struct ctl_table *table) 1501 { 1502 struct ctl_table *ctl_table_arg = table; 1503 int nr_subheaders = count_subheaders(table); 1504 struct ctl_table_header *header = NULL, **subheaders, **subheader; 1505 const struct ctl_path *component; 1506 char *new_path, *pos; 1507 1508 pos = new_path = kmalloc(PATH_MAX, GFP_KERNEL); 1509 if (!new_path) 1510 return NULL; 1511 1512 pos[0] = '\0'; 1513 for (component = path; component->procname; component++) { 1514 pos = append_path(new_path, pos, component->procname); 1515 if (!pos) 1516 goto out; 1517 } 1518 while (table->procname && table->child && !table[1].procname) { 1519 pos = append_path(new_path, pos, table->procname); 1520 if (!pos) 1521 goto out; 1522 table = table->child; 1523 } 1524 if (nr_subheaders == 1) { 1525 header = __register_sysctl_table(set, new_path, table); 1526 if (header) 1527 header->ctl_table_arg = ctl_table_arg; 1528 } else { 1529 header = kzalloc(sizeof(*header) + 1530 sizeof(*subheaders)*nr_subheaders, GFP_KERNEL); 1531 if (!header) 1532 goto out; 1533 1534 subheaders = (struct ctl_table_header **) (header + 1); 1535 subheader = subheaders; 1536 header->ctl_table_arg = ctl_table_arg; 1537 1538 if (register_leaf_sysctl_tables(new_path, pos, &subheader, 1539 set, table)) 1540 goto err_register_leaves; 1541 } 1542 1543 out: 1544 kfree(new_path); 1545 return header; 1546 1547 err_register_leaves: 1548 while (subheader > subheaders) { 1549 struct ctl_table_header *subh = *(--subheader); 1550 struct ctl_table *table = subh->ctl_table_arg; 1551 unregister_sysctl_table(subh); 1552 kfree(table); 1553 } 1554 kfree(header); 1555 header = NULL; 1556 goto out; 1557 } 1558 1559 /** 1560 * register_sysctl_table_path - register a sysctl table hierarchy 1561 * @path: The path to the directory the sysctl table is in. 1562 * @table: the top-level table structure 1563 * 1564 * Register a sysctl table hierarchy. @table should be a filled in ctl_table 1565 * array. A completely 0 filled entry terminates the table. 1566 * 1567 * See __register_sysctl_paths for more details. 1568 */ 1569 struct ctl_table_header *register_sysctl_paths(const struct ctl_path *path, 1570 struct ctl_table *table) 1571 { 1572 return __register_sysctl_paths(&sysctl_table_root.default_set, 1573 path, table); 1574 } 1575 EXPORT_SYMBOL(register_sysctl_paths); 1576 1577 /** 1578 * register_sysctl_table - register a sysctl table hierarchy 1579 * @table: the top-level table structure 1580 * 1581 * Register a sysctl table hierarchy. @table should be a filled in ctl_table 1582 * array. A completely 0 filled entry terminates the table. 1583 * 1584 * See register_sysctl_paths for more details. 1585 */ 1586 struct ctl_table_header *register_sysctl_table(struct ctl_table *table) 1587 { 1588 static const struct ctl_path null_path[] = { {} }; 1589 1590 return register_sysctl_paths(null_path, table); 1591 } 1592 EXPORT_SYMBOL(register_sysctl_table); 1593 1594 static void put_links(struct ctl_table_header *header) 1595 { 1596 struct ctl_table_set *root_set = &sysctl_table_root.default_set; 1597 struct ctl_table_root *root = header->root; 1598 struct ctl_dir *parent = header->parent; 1599 struct ctl_dir *core_parent; 1600 struct ctl_table *entry; 1601 1602 if (header->set == root_set) 1603 return; 1604 1605 core_parent = xlate_dir(root_set, parent); 1606 if (IS_ERR(core_parent)) 1607 return; 1608 1609 for (entry = header->ctl_table; entry->procname; entry++) { 1610 struct ctl_table_header *link_head; 1611 struct ctl_table *link; 1612 const char *name = entry->procname; 1613 1614 link = find_entry(&link_head, core_parent, name, strlen(name)); 1615 if (link && 1616 ((S_ISDIR(link->mode) && S_ISDIR(entry->mode)) || 1617 (S_ISLNK(link->mode) && (link->data == root)))) { 1618 drop_sysctl_table(link_head); 1619 } 1620 else { 1621 pr_err("sysctl link missing during unregister: "); 1622 sysctl_print_dir(parent); 1623 pr_cont("/%s\n", name); 1624 } 1625 } 1626 } 1627 1628 static void drop_sysctl_table(struct ctl_table_header *header) 1629 { 1630 struct ctl_dir *parent = header->parent; 1631 1632 if (--header->nreg) 1633 return; 1634 1635 if (parent) { 1636 put_links(header); 1637 start_unregistering(header); 1638 } 1639 1640 if (!--header->count) 1641 kfree_rcu(header, rcu); 1642 1643 if (parent) 1644 drop_sysctl_table(&parent->header); 1645 } 1646 1647 /** 1648 * unregister_sysctl_table - unregister a sysctl table hierarchy 1649 * @header: the header returned from register_sysctl_table 1650 * 1651 * Unregisters the sysctl table and all children. proc entries may not 1652 * actually be removed until they are no longer used by anyone. 1653 */ 1654 void unregister_sysctl_table(struct ctl_table_header * header) 1655 { 1656 int nr_subheaders; 1657 might_sleep(); 1658 1659 if (header == NULL) 1660 return; 1661 1662 nr_subheaders = count_subheaders(header->ctl_table_arg); 1663 if (unlikely(nr_subheaders > 1)) { 1664 struct ctl_table_header **subheaders; 1665 int i; 1666 1667 subheaders = (struct ctl_table_header **)(header + 1); 1668 for (i = nr_subheaders -1; i >= 0; i--) { 1669 struct ctl_table_header *subh = subheaders[i]; 1670 struct ctl_table *table = subh->ctl_table_arg; 1671 unregister_sysctl_table(subh); 1672 kfree(table); 1673 } 1674 kfree(header); 1675 return; 1676 } 1677 1678 spin_lock(&sysctl_lock); 1679 drop_sysctl_table(header); 1680 spin_unlock(&sysctl_lock); 1681 } 1682 EXPORT_SYMBOL(unregister_sysctl_table); 1683 1684 void setup_sysctl_set(struct ctl_table_set *set, 1685 struct ctl_table_root *root, 1686 int (*is_seen)(struct ctl_table_set *)) 1687 { 1688 memset(set, 0, sizeof(*set)); 1689 set->is_seen = is_seen; 1690 init_header(&set->dir.header, root, set, NULL, root_table); 1691 } 1692 1693 void retire_sysctl_set(struct ctl_table_set *set) 1694 { 1695 WARN_ON(!RB_EMPTY_ROOT(&set->dir.root)); 1696 } 1697 1698 int __init proc_sys_init(void) 1699 { 1700 struct proc_dir_entry *proc_sys_root; 1701 1702 proc_sys_root = proc_mkdir("sys", NULL); 1703 proc_sys_root->proc_iops = &proc_sys_dir_operations; 1704 proc_sys_root->proc_dir_ops = &proc_sys_dir_file_operations; 1705 proc_sys_root->nlink = 0; 1706 1707 return sysctl_init(); 1708 } 1709 1710 struct sysctl_alias { 1711 const char *kernel_param; 1712 const char *sysctl_param; 1713 }; 1714 1715 /* 1716 * Historically some settings had both sysctl and a command line parameter. 1717 * With the generic sysctl. parameter support, we can handle them at a single 1718 * place and only keep the historical name for compatibility. This is not meant 1719 * to add brand new aliases. When adding existing aliases, consider whether 1720 * the possibly different moment of changing the value (e.g. from early_param 1721 * to the moment do_sysctl_args() is called) is an issue for the specific 1722 * parameter. 1723 */ 1724 static const struct sysctl_alias sysctl_aliases[] = { 1725 {"hardlockup_all_cpu_backtrace", "kernel.hardlockup_all_cpu_backtrace" }, 1726 {"hung_task_panic", "kernel.hung_task_panic" }, 1727 {"numa_zonelist_order", "vm.numa_zonelist_order" }, 1728 {"softlockup_all_cpu_backtrace", "kernel.softlockup_all_cpu_backtrace" }, 1729 {"softlockup_panic", "kernel.softlockup_panic" }, 1730 { } 1731 }; 1732 1733 static const char *sysctl_find_alias(char *param) 1734 { 1735 const struct sysctl_alias *alias; 1736 1737 for (alias = &sysctl_aliases[0]; alias->kernel_param != NULL; alias++) { 1738 if (strcmp(alias->kernel_param, param) == 0) 1739 return alias->sysctl_param; 1740 } 1741 1742 return NULL; 1743 } 1744 1745 /* Set sysctl value passed on kernel command line. */ 1746 static int process_sysctl_arg(char *param, char *val, 1747 const char *unused, void *arg) 1748 { 1749 char *path; 1750 struct vfsmount **proc_mnt = arg; 1751 struct file_system_type *proc_fs_type; 1752 struct file *file; 1753 int len; 1754 int err; 1755 loff_t pos = 0; 1756 ssize_t wret; 1757 1758 if (strncmp(param, "sysctl", sizeof("sysctl") - 1) == 0) { 1759 param += sizeof("sysctl") - 1; 1760 1761 if (param[0] != '/' && param[0] != '.') 1762 return 0; 1763 1764 param++; 1765 } else { 1766 param = (char *) sysctl_find_alias(param); 1767 if (!param) 1768 return 0; 1769 } 1770 1771 if (!val) 1772 return -EINVAL; 1773 len = strlen(val); 1774 if (len == 0) 1775 return -EINVAL; 1776 1777 /* 1778 * To set sysctl options, we use a temporary mount of proc, look up the 1779 * respective sys/ file and write to it. To avoid mounting it when no 1780 * options were given, we mount it only when the first sysctl option is 1781 * found. Why not a persistent mount? There are problems with a 1782 * persistent mount of proc in that it forces userspace not to use any 1783 * proc mount options. 1784 */ 1785 if (!*proc_mnt) { 1786 proc_fs_type = get_fs_type("proc"); 1787 if (!proc_fs_type) { 1788 pr_err("Failed to find procfs to set sysctl from command line\n"); 1789 return 0; 1790 } 1791 *proc_mnt = kern_mount(proc_fs_type); 1792 put_filesystem(proc_fs_type); 1793 if (IS_ERR(*proc_mnt)) { 1794 pr_err("Failed to mount procfs to set sysctl from command line\n"); 1795 return 0; 1796 } 1797 } 1798 1799 path = kasprintf(GFP_KERNEL, "sys/%s", param); 1800 if (!path) 1801 panic("%s: Failed to allocate path for %s\n", __func__, param); 1802 strreplace(path, '.', '/'); 1803 1804 file = file_open_root((*proc_mnt)->mnt_root, *proc_mnt, path, O_WRONLY, 0); 1805 if (IS_ERR(file)) { 1806 err = PTR_ERR(file); 1807 if (err == -ENOENT) 1808 pr_err("Failed to set sysctl parameter '%s=%s': parameter not found\n", 1809 param, val); 1810 else if (err == -EACCES) 1811 pr_err("Failed to set sysctl parameter '%s=%s': permission denied (read-only?)\n", 1812 param, val); 1813 else 1814 pr_err("Error %pe opening proc file to set sysctl parameter '%s=%s'\n", 1815 file, param, val); 1816 goto out; 1817 } 1818 wret = kernel_write(file, val, len, &pos); 1819 if (wret < 0) { 1820 err = wret; 1821 if (err == -EINVAL) 1822 pr_err("Failed to set sysctl parameter '%s=%s': invalid value\n", 1823 param, val); 1824 else 1825 pr_err("Error %pe writing to proc file to set sysctl parameter '%s=%s'\n", 1826 ERR_PTR(err), param, val); 1827 } else if (wret != len) { 1828 pr_err("Wrote only %zd bytes of %d writing to proc file %s to set sysctl parameter '%s=%s\n", 1829 wret, len, path, param, val); 1830 } 1831 1832 err = filp_close(file, NULL); 1833 if (err) 1834 pr_err("Error %pe closing proc file to set sysctl parameter '%s=%s\n", 1835 ERR_PTR(err), param, val); 1836 out: 1837 kfree(path); 1838 return 0; 1839 } 1840 1841 void do_sysctl_args(void) 1842 { 1843 char *command_line; 1844 struct vfsmount *proc_mnt = NULL; 1845 1846 command_line = kstrdup(saved_command_line, GFP_KERNEL); 1847 if (!command_line) 1848 panic("%s: Failed to allocate copy of command line\n", __func__); 1849 1850 parse_args("Setting sysctl args", command_line, 1851 NULL, 0, -1, -1, &proc_mnt, process_sysctl_arg); 1852 1853 if (proc_mnt) 1854 kern_unmount(proc_mnt); 1855 1856 kfree(command_line); 1857 } 1858