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