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