2 * Copyright (c) 1982, 1986, 1989, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * Mike Karels at Berkeley Software Design, Inc.
8 * Quite extensively rewritten by Poul-Henning Kamp of the FreeBSD
9 * project, to make these variables more userfriendly.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. All advertising materials mentioning features or use of this software
20 * must display the following acknowledgement:
21 * This product includes software developed by the University of
22 * California, Berkeley and its contributors.
23 * 4. Neither the name of the University nor the names of its contributors
24 * may be used to endorse or promote products derived from this software
25 * without specific prior written permission.
27 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
31 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 * @(#)kern_sysctl.c 8.4 (Berkeley) 4/14/94
40 * $FreeBSD: src/sys/kern/kern_sysctl.c,v 1.92.2.9 2003/05/01 22:48:09 trhodes Exp $
41 * $DragonFly: src/sys/kern/kern_sysctl.c,v 1.16 2004/03/29 14:08:09 joerg Exp $
44 #include <sys/param.h>
45 #include <sys/systm.h>
46 #include <sys/kernel.h>
48 #include <sys/sysctl.h>
49 #include <sys/malloc.h>
51 #include <sys/sysproto.h>
54 #include <vm/vm_extern.h>
56 static MALLOC_DEFINE(M_SYSCTL, "sysctl", "sysctl internal magic");
57 static MALLOC_DEFINE(M_SYSCTLOID, "sysctloid", "sysctl dynamic oids");
59 static struct lock sysctl_lkp;
60 static struct lock sysctl_ctx_lkp;
62 static void sysctl_lock(int type);
63 static void sysctl_unlock(void);
64 static void sysctl_ctx_lock(int type);
65 static void sysctl_ctx_unlock(void);
67 static int sysctl_root(SYSCTL_HANDLER_ARGS);
68 static void sysctl_register_oid_int(struct sysctl_oid *oipd);
69 static void sysctl_unregister_oid_int(struct sysctl_oid *oipd);
70 static struct sysctl_ctx_entry* sysctl_ctx_entry_find_int
71 (struct sysctl_ctx_list *, struct sysctl_oid *oidp);
73 struct sysctl_oid_list sysctl__children; /* root list */
75 static struct sysctl_oid *
76 sysctl_find_oidname(const char *name, struct sysctl_oid_list *list, int lock)
78 struct sysctl_oid *oidp;
80 SLIST_FOREACH(oidp, list, oid_link) {
81 if (strcmp(oidp->oid_name, name) == 0) {
89 * Initialization of the MIB tree.
91 * Order by number in each list.
95 sysctl_register_oid(struct sysctl_oid *oidp)
97 sysctl_lock(LK_EXCLUSIVE);
98 sysctl_register_oid_int(oidp);
103 sysctl_register_oid_int(struct sysctl_oid *oidp)
105 struct sysctl_oid_list *parent = oidp->oid_parent;
106 struct sysctl_oid *p;
107 struct sysctl_oid *q;
110 * First check if another oid with the same name already
111 * exists in the parent's list.
113 p = sysctl_find_oidname(oidp->oid_name, parent, 0);
115 if ((p->oid_kind & CTLTYPE) == CTLTYPE_NODE)
118 printf("can't re-use a leaf (%s)!\n", p->oid_name);
123 * If this oid has a number OID_AUTO, give it a number which
124 * is greater than any current oid. Make sure it is at least
125 * 256 to leave space for pre-assigned oid numbers.
127 if (oidp->oid_number == OID_AUTO) {
128 int newoid = 0x100; /* minimum AUTO oid */
131 * Adjust based on highest oid in parent list
133 SLIST_FOREACH(p, parent, oid_link) {
134 if (newoid <= p->oid_number)
135 newoid = p->oid_number + 1;
137 oidp->oid_number = newoid;
141 * Insert the oid into the parent's list in order.
144 SLIST_FOREACH(p, parent, oid_link) {
145 if (oidp->oid_number < p->oid_number)
150 SLIST_INSERT_AFTER(q, oidp, oid_link);
152 SLIST_INSERT_HEAD(parent, oidp, oid_link);
156 sysctl_unregister_oid(struct sysctl_oid *oidp)
158 sysctl_lock(LK_EXCLUSIVE);
159 sysctl_unregister_oid_int(oidp);
164 sysctl_unregister_oid_int(struct sysctl_oid *oidp)
166 struct sysctl_oid *p;
168 if (oidp->oid_number == OID_AUTO)
169 panic("Trying to unregister OID_AUTO entry: %p\n", oidp);
171 SLIST_FOREACH(p, oidp->oid_parent, oid_link) {
174 SLIST_REMOVE(oidp->oid_parent, oidp, sysctl_oid, oid_link);
179 * This can happen when a module fails to register and is
180 * being unloaded afterwards. It should not be a panic()
183 printf("%s: failed to unregister sysctl\n", __func__);
186 /* Initialize a new context to keep track of dynamically added sysctls. */
188 sysctl_ctx_init(struct sysctl_ctx_list *c)
196 /* Free the context, and destroy all dynamic oids registered in this context */
198 sysctl_ctx_free(struct sysctl_ctx_list *clist)
200 struct sysctl_ctx_entry *e, *e1;
204 sysctl_ctx_lock(LK_EXCLUSIVE);
206 * First perform a "dry run" to check if it's ok to remove oids.
208 * XXX This algorithm is a hack. But I don't know any
209 * XXX better solution for now...
211 TAILQ_FOREACH(e, clist, link) {
212 error = sysctl_remove_oid(e->entry, 0, 0);
217 * Restore deregistered entries, either from the end,
218 * or from the place where error occured.
219 * e contains the entry that was not unregistered
222 e1 = TAILQ_PREV(e, sysctl_ctx_list, link);
224 e1 = TAILQ_LAST(clist, sysctl_ctx_list);
226 sysctl_register_oid(e1->entry);
227 e1 = TAILQ_PREV(e1, sysctl_ctx_list, link);
233 /* Now really delete the entries */
234 e = TAILQ_FIRST(clist);
236 e1 = TAILQ_NEXT(e, link);
237 error = sysctl_remove_oid(e->entry, 1, 0);
239 panic("sysctl_remove_oid: corrupt tree, entry: %s",
241 free(e, M_SYSCTLOID);
248 /* Add an entry to the context */
249 struct sysctl_ctx_entry *
250 sysctl_ctx_entry_add(struct sysctl_ctx_list *clist, struct sysctl_oid *oidp)
252 struct sysctl_ctx_entry *e;
254 if (clist == NULL || oidp == NULL)
256 e = malloc(sizeof(struct sysctl_ctx_entry), M_SYSCTLOID, M_WAITOK);
258 sysctl_ctx_lock(LK_EXCLUSIVE);
259 TAILQ_INSERT_HEAD(clist, e, link);
264 /* Find an entry in the context */
265 struct sysctl_ctx_entry *
266 sysctl_ctx_entry_find(struct sysctl_ctx_list *clist, struct sysctl_oid *oidp)
268 struct sysctl_ctx_entry *e;
270 if (clist == NULL || oidp == NULL)
273 sysctl_ctx_lock(LK_SHARED);
274 e = sysctl_ctx_entry_find_int(clist, oidp);
280 struct sysctl_ctx_entry *
281 sysctl_ctx_entry_find_int(struct sysctl_ctx_list *clist, struct sysctl_oid *oidp)
283 struct sysctl_ctx_entry *e;
285 KKASSERT(clist != NULL && oidp != NULL);
287 for (e = TAILQ_FIRST(clist); e != NULL; e = TAILQ_NEXT(e, link)) {
296 * Delete an entry from the context.
297 * NOTE: this function doesn't free oidp! You have to remove it
298 * with sysctl_remove_oid().
301 sysctl_ctx_entry_del(struct sysctl_ctx_list *clist, struct sysctl_oid *oidp)
303 struct sysctl_ctx_entry *e;
305 if (clist == NULL || oidp == NULL)
308 sysctl_ctx_lock(LK_EXCLUSIVE);
309 e = sysctl_ctx_entry_find_int(clist, oidp);
314 TAILQ_REMOVE(clist, e, link);
315 free(e, M_SYSCTLOID);
322 * Remove dynamically created sysctl trees.
323 * oidp - top of the tree to be removed
324 * del - if 0 - just deregister, otherwise free up entries as well
325 * recurse - if != 0 traverse the subtree to be deleted
328 sysctl_remove_oid(struct sysctl_oid *oidp, int del, int recurse)
330 struct sysctl_oid *p;
335 if ((oidp->oid_kind & CTLFLAG_DYN) == 0) {
336 printf("can't remove non-dynamic nodes!\n");
339 sysctl_lock(LK_EXCLUSIVE | LK_CANRECURSE);
341 * WARNING: normal method to do this should be through
342 * sysctl_ctx_free(). Use recursing as the last resort
343 * method to purge your sysctl tree of leftovers...
344 * However, if some other code still references these nodes,
347 if ((oidp->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
348 if (oidp->oid_refcnt == 1) {
349 SLIST_FOREACH(p, SYSCTL_CHILDREN(oidp), oid_link) {
354 error = sysctl_remove_oid(p, del, recurse);
361 free(SYSCTL_CHILDREN(oidp), M_SYSCTLOID);
364 if (oidp->oid_refcnt > 1 ) {
367 if (oidp->oid_refcnt == 0) {
368 printf("Warning: bad oid_refcnt=%u (%s)!\n",
369 oidp->oid_refcnt, oidp->oid_name);
373 sysctl_unregister_oid_int(oidp);
376 free(__DECONST(char *,oidp->oid_descr),
378 free(__DECONST(char *, oidp->oid_name), M_SYSCTLOID);
379 free(oidp, M_SYSCTLOID);
387 * Create new sysctls at run time.
388 * clist may point to a valid context initialized with sysctl_ctx_init().
391 sysctl_add_oid(struct sysctl_ctx_list *clist, struct sysctl_oid_list *parent,
392 int number, const char *name, int kind, void *arg1, int arg2,
393 int (*handler)(SYSCTL_HANDLER_ARGS), const char *fmt, const char *descr)
395 struct sysctl_oid *oidp;
399 /* You have to hook up somewhere.. */
402 sysctl_lock(LK_EXCLUSIVE);
403 /* Check if the node already exists, otherwise create it */
404 oidp = sysctl_find_oidname(name, parent, 0);
406 if ((oidp->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
408 /* Update the context */
410 sysctl_ctx_entry_add(clist, oidp);
414 printf("can't re-use a leaf (%s)!\n", name);
419 oidp = malloc(sizeof(struct sysctl_oid), M_SYSCTLOID, M_WAITOK | M_ZERO);
420 oidp->oid_parent = parent;
421 SLIST_NEXT(oidp, oid_link) = NULL;
422 oidp->oid_number = number;
423 oidp->oid_refcnt = 1;
425 newname = malloc(len + 1, M_SYSCTLOID, M_WAITOK);
426 bcopy(name, newname, len + 1);
428 oidp->oid_name = newname;
429 oidp->oid_handler = handler;
430 oidp->oid_kind = CTLFLAG_DYN | kind;
431 if ((kind & CTLTYPE) == CTLTYPE_NODE) {
432 /* Allocate space for children */
433 SYSCTL_CHILDREN(oidp) = malloc(sizeof(struct sysctl_oid_list),
434 M_SYSCTLOID, M_WAITOK);
435 SLIST_INIT(SYSCTL_CHILDREN(oidp));
437 oidp->oid_arg1 = arg1;
438 oidp->oid_arg2 = arg2;
442 int len = strlen(descr) + 1;
443 oidp->oid_descr = malloc(len, M_SYSCTLOID, M_WAITOK);
445 strcpy((char *)(uintptr_t)(const void *)oidp->oid_descr, descr);
447 /* Update the context, if used */
449 sysctl_ctx_entry_add(clist, oidp);
450 /* Register this oid */
451 sysctl_register_oid_int(oidp);
457 * Register the kernel's oids on startup.
459 SET_DECLARE(sysctl_set, struct sysctl_oid);
461 static void sysctl_register_all(void *arg)
463 struct sysctl_oid **oidp;
465 lockinit(&sysctl_lkp, 0, "sysctl", 0, 0);
466 lockinit(&sysctl_ctx_lkp, 0, "sysctl ctx", 0, 0);
467 SET_FOREACH(oidp, sysctl_set)
468 sysctl_register_oid_int(*oidp);
471 SYSINIT(sysctl, SI_SUB_KMEM, SI_ORDER_ANY, sysctl_register_all, 0);
476 * These functions implement a presently undocumented interface
477 * used by the sysctl program to walk the tree, and get the type
478 * so it can print the value.
479 * This interface is under work and consideration, and should probably
480 * be killed with a big axe by the first person who can find the time.
481 * (be aware though, that the proper interface isn't as obvious as it
482 * may seem, there are various conflicting requirements.
484 * {0,0} printf the entire MIB-tree.
485 * {0,1,...} return the name of the "..." OID.
486 * {0,2,...} return the next OID.
487 * {0,3} return the OID of the name in "new"
488 * {0,4,...} return the kind & format info for the "..." OID.
492 sysctl_sysctl_debug_dump_node(struct sysctl_oid_list *l, int i)
495 struct sysctl_oid *oidp;
497 sysctl_lock(LK_SHARED);
498 SLIST_FOREACH(oidp, l, oid_link) {
503 printf("%d %s ", oidp->oid_number, oidp->oid_name);
506 oidp->oid_kind & CTLFLAG_RD ? 'R':' ',
507 oidp->oid_kind & CTLFLAG_WR ? 'W':' ');
509 if (oidp->oid_handler)
512 switch (oidp->oid_kind & CTLTYPE) {
515 if (!oidp->oid_handler) {
516 sysctl_sysctl_debug_dump_node(
517 oidp->oid_arg1, i+2);
520 case CTLTYPE_INT: printf(" Int\n"); break;
521 case CTLTYPE_STRING: printf(" String\n"); break;
522 case CTLTYPE_QUAD: printf(" Quad\n"); break;
523 case CTLTYPE_OPAQUE: printf(" Opaque/struct\n"); break;
524 default: printf("\n");
532 sysctl_sysctl_debug(SYSCTL_HANDLER_ARGS)
536 error = suser(req->td);
539 sysctl_sysctl_debug_dump_node(&sysctl__children, 0);
543 SYSCTL_PROC(_sysctl, 0, debug, CTLTYPE_STRING|CTLFLAG_RD,
544 0, 0, sysctl_sysctl_debug, "-", "");
547 sysctl_sysctl_name(SYSCTL_HANDLER_ARGS)
549 int *name = (int *) arg1;
550 u_int namelen = arg2;
552 struct sysctl_oid *oid;
553 struct sysctl_oid_list *lsp = &sysctl__children, *lsp2;
556 sysctl_lock(LK_SHARED);
559 snprintf(buf,sizeof(buf),"%d",*name);
561 error = SYSCTL_OUT(req, ".", 1);
563 error = SYSCTL_OUT(req, buf, strlen(buf));
573 SLIST_FOREACH(oid, lsp, oid_link) {
574 if (oid->oid_number != *name)
578 error = SYSCTL_OUT(req, ".", 1);
580 error = SYSCTL_OUT(req, oid->oid_name,
581 strlen(oid->oid_name));
590 if ((oid->oid_kind & CTLTYPE) != CTLTYPE_NODE)
593 if (oid->oid_handler)
596 lsp2 = (struct sysctl_oid_list *)oid->oid_arg1;
602 return (SYSCTL_OUT(req, "", 1));
605 SYSCTL_NODE(_sysctl, 1, name, CTLFLAG_RD, sysctl_sysctl_name, "");
608 sysctl_sysctl_next_ls(struct sysctl_oid_list *lsp, int *name, u_int namelen,
609 int *next, int *len, int level, struct sysctl_oid **oidpp)
611 struct sysctl_oid *oidp;
614 sysctl_lock(LK_SHARED);
615 SLIST_FOREACH(oidp, lsp, oid_link) {
616 *next = oidp->oid_number;
620 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE) {
624 if (oidp->oid_handler) {
625 /* We really should call the handler here...*/
629 lsp = (struct sysctl_oid_list *)oidp->oid_arg1;
630 if (!sysctl_sysctl_next_ls(lsp, 0, 0, next+1,
631 len, level+1, oidpp)) {
638 if (oidp->oid_number < *name)
641 if (oidp->oid_number > *name) {
642 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE) {
646 if (oidp->oid_handler) {
650 lsp = (struct sysctl_oid_list *)oidp->oid_arg1;
651 if (!sysctl_sysctl_next_ls(lsp, name+1, namelen-1,
652 next+1, len, level+1, oidpp)) {
658 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE)
661 if (oidp->oid_handler)
664 lsp = (struct sysctl_oid_list *)oidp->oid_arg1;
665 if (!sysctl_sysctl_next_ls(lsp, name+1, namelen-1, next+1,
666 len, level+1, oidpp)) {
681 sysctl_sysctl_next(SYSCTL_HANDLER_ARGS)
683 int *name = (int *) arg1;
684 u_int namelen = arg2;
686 struct sysctl_oid *oid;
687 struct sysctl_oid_list *lsp = &sysctl__children;
688 int newoid[CTL_MAXNAME];
690 i = sysctl_sysctl_next_ls(lsp, name, namelen, newoid, &j, 1, &oid);
693 error = SYSCTL_OUT(req, newoid, j * sizeof (int));
697 SYSCTL_NODE(_sysctl, 2, next, CTLFLAG_RD, sysctl_sysctl_next, "");
700 name2oid (char *name, int *oid, int *len, struct sysctl_oid **oidpp)
703 struct sysctl_oid *oidp;
704 struct sysctl_oid_list *lsp = &sysctl__children;
710 p = name + strlen(name) - 1 ;
716 for (p = name; *p && *p != '.'; p++)
722 sysctl_lock(LK_SHARED);
723 oidp = SLIST_FIRST(lsp);
725 while (oidp && *len < CTL_MAXNAME) {
726 if (strcmp(name, oidp->oid_name)) {
727 oidp = SLIST_NEXT(oidp, oid_link);
730 *oid++ = oidp->oid_number;
740 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE)
743 if (oidp->oid_handler)
746 lsp = (struct sysctl_oid_list *)oidp->oid_arg1;
747 oidp = SLIST_FIRST(lsp);
749 for (p = name; *p && *p != '.'; p++)
760 sysctl_sysctl_name2oid(SYSCTL_HANDLER_ARGS)
763 int error, oid[CTL_MAXNAME], len;
764 struct sysctl_oid *op = 0;
768 if (req->newlen >= MAXPATHLEN) /* XXX arbitrary, undocumented */
769 return (ENAMETOOLONG);
771 p = malloc(req->newlen+1, M_SYSCTL, M_WAITOK);
773 error = SYSCTL_IN(req, p, req->newlen);
779 p [req->newlen] = '\0';
781 error = name2oid(p, oid, &len, &op);
788 error = SYSCTL_OUT(req, oid, len * sizeof *oid);
792 SYSCTL_PROC(_sysctl, 3, name2oid, CTLFLAG_RW|CTLFLAG_ANYBODY, 0, 0,
793 sysctl_sysctl_name2oid, "I", "");
796 sysctl_sysctl_oidfmt(SYSCTL_HANDLER_ARGS)
798 struct sysctl_oid *oid;
801 error = sysctl_find_oid(arg1, arg2, &oid, NULL, req);
807 error = SYSCTL_OUT(req, &oid->oid_kind, sizeof(oid->oid_kind));
810 error = SYSCTL_OUT(req, oid->oid_fmt, strlen(oid->oid_fmt) + 1);
815 SYSCTL_NODE(_sysctl, 4, oidfmt, CTLFLAG_RD, sysctl_sysctl_oidfmt, "");
818 sysctl_sysctl_oiddescr(SYSCTL_HANDLER_ARGS)
820 struct sysctl_oid *oid;
823 error = sysctl_find_oid(arg1, arg2, &oid, NULL, req);
829 error = SYSCTL_OUT(req, oid->oid_descr, strlen(oid->oid_descr) + 1);
833 SYSCTL_NODE(_sysctl, 5, oiddescr, CTLFLAG_RD, sysctl_sysctl_oiddescr, "");
836 * Default "handler" functions.
840 * Handle an int, signed or unsigned.
842 * a variable: point arg1 at it.
843 * a constant: pass it in arg2.
847 sysctl_handle_int(SYSCTL_HANDLER_ARGS)
852 error = SYSCTL_OUT(req, arg1, sizeof(int));
854 error = SYSCTL_OUT(req, &arg2, sizeof(int));
856 if (error || !req->newptr)
862 error = SYSCTL_IN(req, arg1, sizeof(int));
867 * Handle a long, signed or unsigned. arg1 points to it.
871 sysctl_handle_long(SYSCTL_HANDLER_ARGS)
877 error = SYSCTL_OUT(req, arg1, sizeof(long));
879 if (error || !req->newptr)
882 error = SYSCTL_IN(req, arg1, sizeof(long));
887 * Handle a quad, signed or unsigned. arg1 points to it.
891 sysctl_handle_quad(SYSCTL_HANDLER_ARGS)
897 error = SYSCTL_OUT(req, arg1, sizeof(quad_t));
899 if (error || !req->newptr)
902 error = SYSCTL_IN(req, arg1, sizeof(quad_t));
907 * Handle our generic '\0' terminated 'C' string.
909 * a variable string: point arg1 at it, arg2 is max length.
910 * a constant string: point arg1 at it, arg2 is zero.
914 sysctl_handle_string(SYSCTL_HANDLER_ARGS)
918 error = SYSCTL_OUT(req, arg1, strlen((char *)arg1)+1);
920 if (error || !req->newptr)
923 if ((req->newlen - req->newidx) >= arg2) {
926 arg2 = (req->newlen - req->newidx);
927 error = SYSCTL_IN(req, arg1, arg2);
928 ((char *)arg1)[arg2] = '\0';
935 * Handle any kind of opaque data.
936 * arg1 points to it, arg2 is the size.
940 sysctl_handle_opaque(SYSCTL_HANDLER_ARGS)
944 error = SYSCTL_OUT(req, arg1, arg2);
946 if (error || !req->newptr)
949 error = SYSCTL_IN(req, arg1, arg2);
955 * Transfer functions to/from kernel space.
956 * XXX: rather untested at this point
959 sysctl_old_kernel(struct sysctl_req *req, const void *p, size_t l)
965 if (i > req->oldlen - req->oldidx)
966 i = req->oldlen - req->oldidx;
968 bcopy(p, (char *)req->oldptr + req->oldidx, i);
971 if (req->oldptr && i != l)
977 sysctl_new_kernel(struct sysctl_req *req, void *p, size_t l)
982 if (req->newlen - req->newidx < l)
984 bcopy((char *)req->newptr + req->newidx, p, l);
990 kernel_sysctl(int *name, u_int namelen, void *old, size_t *oldlenp, void *new, size_t newlen, size_t *retval)
993 struct sysctl_req req;
995 bzero(&req, sizeof req);
1000 req.oldlen = *oldlenp;
1008 req.newlen = newlen;
1012 req.oldfunc = sysctl_old_kernel;
1013 req.newfunc = sysctl_new_kernel;
1016 sysctl_lock(LK_SHARED);
1018 error = sysctl_root(0, name, namelen, &req);
1021 vsunlock(req.oldptr, req.oldlen);
1025 if (error && error != ENOMEM)
1029 if (req.oldptr && req.oldidx > req.oldlen)
1030 *retval = req.oldlen;
1032 *retval = req.oldidx;
1038 kernel_sysctlbyname(char *name, void *old, size_t *oldlenp,
1039 void *new, size_t newlen, size_t *retval)
1041 int oid[CTL_MAXNAME];
1042 size_t oidlen, plen;
1045 oid[0] = 0; /* sysctl internal magic */
1046 oid[1] = 3; /* name2oid */
1047 oidlen = sizeof(oid);
1049 error = kernel_sysctl(oid, 2, oid, &oidlen, (void *)name,
1050 strlen(name), &plen);
1054 error = kernel_sysctl(oid, plen / sizeof(int), old, oldlenp,
1055 new, newlen, retval);
1060 * Transfer function to/from user space.
1063 sysctl_old_user(struct sysctl_req *req, const void *p, size_t l)
1068 if (req->lock == 1 && req->oldptr) {
1069 vslock(req->oldptr, req->oldlen);
1074 if (i > req->oldlen - req->oldidx)
1075 i = req->oldlen - req->oldidx;
1077 error = copyout(p, (char *)req->oldptr + req->oldidx,
1083 if (req->oldptr && i < l)
1089 sysctl_new_user(struct sysctl_req *req, void *p, size_t l)
1095 if (req->newlen - req->newidx < l)
1097 error = copyin((char *)req->newptr + req->newidx, p, l);
1103 sysctl_find_oid(int *name, u_int namelen, struct sysctl_oid **noid,
1104 int *nindx, struct sysctl_req *req)
1106 struct sysctl_oid *oid;
1109 sysctl_lock(LK_SHARED);
1110 oid = SLIST_FIRST(&sysctl__children);
1112 while (oid && indx < CTL_MAXNAME) {
1113 if (oid->oid_number == name[indx]) {
1115 if (oid->oid_kind & CTLFLAG_NOLOCK)
1117 if ((oid->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
1118 if (oid->oid_handler != NULL ||
1127 (struct sysctl_oid_list *)oid->oid_arg1);
1128 } else if (indx == namelen) {
1139 oid = SLIST_NEXT(oid, oid_link);
1147 * Traverse our tree, and find the right node, execute whatever it points
1148 * to, and return the resulting error code.
1152 sysctl_root(SYSCTL_HANDLER_ARGS)
1154 struct thread *td = req->td;
1155 struct proc *p = td ? td->td_proc : NULL;
1156 struct sysctl_oid *oid;
1159 error = sysctl_find_oid(arg1, arg2, &oid, &indx, req);
1163 if ((oid->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
1165 * You can't call a sysctl when it's a node, but has
1166 * no handler. Inform the user that it's a node.
1167 * The indx may or may not be the same as namelen.
1169 if (oid->oid_handler == NULL)
1173 /* If writing isn't allowed */
1174 if (req->newptr && (!(oid->oid_kind & CTLFLAG_WR) ||
1175 ((oid->oid_kind & CTLFLAG_SECURE) && securelevel > 0)))
1178 /* Most likely only root can write */
1179 if (!(oid->oid_kind & CTLFLAG_ANYBODY) && req->newptr && p &&
1180 (error = suser_cred(p->p_ucred,
1181 (oid->oid_kind & CTLFLAG_PRISON) ? PRISON_ROOT : 0)))
1184 if (!oid->oid_handler)
1187 if ((oid->oid_kind & CTLTYPE) == CTLTYPE_NODE)
1188 error = oid->oid_handler(oid, (int *)arg1 + indx, arg2 - indx,
1191 error = oid->oid_handler(oid, oid->oid_arg1, oid->oid_arg2,
1197 __sysctl(struct sysctl_args *uap)
1199 int error, i, name[CTL_MAXNAME];
1202 if (uap->namelen > CTL_MAXNAME || uap->namelen < 2)
1205 error = copyin(uap->name, &name, uap->namelen * sizeof(int));
1209 error = userland_sysctl(name, uap->namelen,
1210 uap->old, uap->oldlenp, 0,
1211 uap->new, uap->newlen, &j);
1212 if (error && error != ENOMEM)
1215 i = copyout(&j, uap->oldlenp, sizeof(j));
1223 * This is used from various compatibility syscalls too. That's why name
1224 * must be in kernel space.
1227 userland_sysctl(int *name, u_int namelen, void *old, size_t *oldlenp, int inkernel, void *new, size_t newlen, size_t *retval)
1230 struct sysctl_req req, req2;
1232 bzero(&req, sizeof req);
1236 req.oldlen = *oldlenp;
1238 error = copyin(oldlenp, &req.oldlen, sizeof(*oldlenp));
1245 if (!useracc(old, req.oldlen, VM_PROT_WRITE))
1251 if (!useracc(new, req.newlen, VM_PROT_READ))
1253 req.newlen = newlen;
1257 req.oldfunc = sysctl_old_user;
1258 req.newfunc = sysctl_new_user;
1262 sysctl_lock(LK_SHARED);
1266 error = sysctl_root(0, name, namelen, &req2);
1267 } while (error == EAGAIN);
1271 vsunlock(req.oldptr, req.oldlen);
1275 if (error && error != ENOMEM)
1279 if (req.oldptr && req.oldidx > req.oldlen)
1280 *retval = req.oldlen;
1282 *retval = req.oldidx;
1288 sysctl_lock(int flag)
1290 lockmgr(&sysctl_lkp, flag, NULL, curthread);
1296 lockmgr(&sysctl_lkp, LK_RELEASE, NULL, curthread);
1300 sysctl_ctx_lock(int flag)
1302 lockmgr(&sysctl_ctx_lkp, flag, NULL, curthread);
1306 sysctl_ctx_unlock(void)
1308 lockmgr(&sysctl_ctx_lkp, LK_RELEASE, NULL, curthread);