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 $
43 #include "opt_compat.h"
45 #include <sys/param.h>
46 #include <sys/systm.h>
47 #include <sys/kernel.h>
49 #include <sys/sysctl.h>
50 #include <sys/malloc.h>
52 #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");
62 static struct sysctl_lock {
68 static int sysctl_root(SYSCTL_HANDLER_ARGS);
70 struct sysctl_oid_list sysctl__children; /* root list */
72 static struct sysctl_oid *
73 sysctl_find_oidname(const char *name, struct sysctl_oid_list *list)
75 struct sysctl_oid *oidp;
77 SLIST_FOREACH(oidp, list, oid_link) {
78 if (strcmp(oidp->oid_name, name) == 0) {
86 * Initialization of the MIB tree.
88 * Order by number in each list.
91 void sysctl_register_oid(struct sysctl_oid *oidp)
93 struct sysctl_oid_list *parent = oidp->oid_parent;
99 * First check if another oid with the same name already
100 * exists in the parent's list.
102 p = sysctl_find_oidname(oidp->oid_name, parent);
104 if ((p->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
108 printf("can't re-use a leaf (%s)!\n", p->oid_name);
113 * If this oid has a number OID_AUTO, give it a number which
114 * is greater than any current oid. Make sure it is at least
115 * 100 to leave space for pre-assigned oid numbers.
117 if (oidp->oid_number == OID_AUTO) {
118 /* First, find the highest oid in the parent list >99 */
120 SLIST_FOREACH(p, parent, oid_link) {
121 if (p->oid_number > n)
124 oidp->oid_number = n + 1;
128 * Insert the oid into the parent's list in order.
131 SLIST_FOREACH(p, parent, oid_link) {
132 if (oidp->oid_number < p->oid_number)
137 SLIST_INSERT_AFTER(q, oidp, oid_link);
139 SLIST_INSERT_HEAD(parent, oidp, oid_link);
142 void sysctl_unregister_oid(struct sysctl_oid *oidp)
145 SLIST_REMOVE(oidp->oid_parent, oidp, sysctl_oid, oid_link);
148 /* Initialize a new context to keep track of dynamically added sysctls. */
150 sysctl_ctx_init(struct sysctl_ctx_list *c)
160 /* Free the context, and destroy all dynamic oids registered in this context */
162 sysctl_ctx_free(struct sysctl_ctx_list *clist)
164 struct sysctl_ctx_entry *e, *e1;
169 * First perform a "dry run" to check if it's ok to remove oids.
171 * XXX This algorithm is a hack. But I don't know any
172 * XXX better solution for now...
174 TAILQ_FOREACH(e, clist, link) {
175 error = sysctl_remove_oid(e->entry, 0, 0);
180 * Restore deregistered entries, either from the end,
181 * or from the place where error occured.
182 * e contains the entry that was not unregistered
185 e1 = TAILQ_PREV(e, sysctl_ctx_list, link);
187 e1 = TAILQ_LAST(clist, sysctl_ctx_list);
189 sysctl_register_oid(e1->entry);
190 e1 = TAILQ_PREV(e1, sysctl_ctx_list, link);
194 /* Now really delete the entries */
195 e = TAILQ_FIRST(clist);
197 e1 = TAILQ_NEXT(e, link);
198 error = sysctl_remove_oid(e->entry, 1, 0);
200 panic("sysctl_remove_oid: corrupt tree, entry: %s",
202 free(e, M_SYSCTLOID);
208 /* Add an entry to the context */
209 struct sysctl_ctx_entry *
210 sysctl_ctx_entry_add(struct sysctl_ctx_list *clist, struct sysctl_oid *oidp)
212 struct sysctl_ctx_entry *e;
214 if (clist == NULL || oidp == NULL)
216 e = malloc(sizeof(struct sysctl_ctx_entry), M_SYSCTLOID, M_WAITOK);
218 TAILQ_INSERT_HEAD(clist, e, link);
222 /* Find an entry in the context */
223 struct sysctl_ctx_entry *
224 sysctl_ctx_entry_find(struct sysctl_ctx_list *clist, struct sysctl_oid *oidp)
226 struct sysctl_ctx_entry *e;
228 if (clist == NULL || oidp == NULL)
230 for (e = TAILQ_FIRST(clist); e != NULL; e = TAILQ_NEXT(e, link)) {
238 * Delete an entry from the context.
239 * NOTE: this function doesn't free oidp! You have to remove it
240 * with sysctl_remove_oid().
243 sysctl_ctx_entry_del(struct sysctl_ctx_list *clist, struct sysctl_oid *oidp)
245 struct sysctl_ctx_entry *e;
247 if (clist == NULL || oidp == NULL)
249 e = sysctl_ctx_entry_find(clist, oidp);
251 TAILQ_REMOVE(clist, e, link);
252 free(e, M_SYSCTLOID);
259 * Remove dynamically created sysctl trees.
260 * oidp - top of the tree to be removed
261 * del - if 0 - just deregister, otherwise free up entries as well
262 * recurse - if != 0 traverse the subtree to be deleted
265 sysctl_remove_oid(struct sysctl_oid *oidp, int del, int recurse)
267 struct sysctl_oid *p;
272 if ((oidp->oid_kind & CTLFLAG_DYN) == 0) {
273 printf("can't remove non-dynamic nodes!\n");
277 * WARNING: normal method to do this should be through
278 * sysctl_ctx_free(). Use recursing as the last resort
279 * method to purge your sysctl tree of leftovers...
280 * However, if some other code still references these nodes,
283 if ((oidp->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
284 if (oidp->oid_refcnt == 1) {
285 SLIST_FOREACH(p, SYSCTL_CHILDREN(oidp), oid_link) {
288 error = sysctl_remove_oid(p, del, recurse);
293 free(SYSCTL_CHILDREN(oidp), M_SYSCTLOID);
296 if (oidp->oid_refcnt > 1 ) {
299 if (oidp->oid_refcnt == 0) {
300 printf("Warning: bad oid_refcnt=%u (%s)!\n",
301 oidp->oid_refcnt, oidp->oid_name);
304 sysctl_unregister_oid(oidp);
307 free((void *)(uintptr_t)(const void *)oidp->oid_descr, M_SYSCTLOID);
308 free((void *)(uintptr_t)(const void *)oidp->oid_name,
310 free(oidp, M_SYSCTLOID);
317 * Create new sysctls at run time.
318 * clist may point to a valid context initialized with sysctl_ctx_init().
321 sysctl_add_oid(struct sysctl_ctx_list *clist, struct sysctl_oid_list *parent,
322 int number, const char *name, int kind, void *arg1, int arg2,
323 int (*handler)(SYSCTL_HANDLER_ARGS), const char *fmt, const char *descr)
325 struct sysctl_oid *oidp;
329 /* You have to hook up somewhere.. */
332 /* Check if the node already exists, otherwise create it */
333 oidp = sysctl_find_oidname(name, parent);
335 if ((oidp->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
337 /* Update the context */
339 sysctl_ctx_entry_add(clist, oidp);
342 printf("can't re-use a leaf (%s)!\n", name);
346 oidp = malloc(sizeof(struct sysctl_oid), M_SYSCTLOID, M_WAITOK);
347 bzero(oidp, sizeof(struct sysctl_oid));
348 oidp->oid_parent = parent;
349 SLIST_NEXT(oidp, oid_link) = NULL;
350 oidp->oid_number = number;
351 oidp->oid_refcnt = 1;
353 newname = malloc(len + 1, M_SYSCTLOID, M_WAITOK);
354 bcopy(name, newname, len + 1);
356 oidp->oid_name = newname;
357 oidp->oid_handler = handler;
358 oidp->oid_kind = CTLFLAG_DYN | kind;
359 if ((kind & CTLTYPE) == CTLTYPE_NODE) {
360 /* Allocate space for children */
361 SYSCTL_CHILDREN(oidp) = malloc(sizeof(struct sysctl_oid_list),
362 M_SYSCTLOID, M_WAITOK);
363 SLIST_INIT(SYSCTL_CHILDREN(oidp));
365 oidp->oid_arg1 = arg1;
366 oidp->oid_arg2 = arg2;
370 int len = strlen(descr) + 1;
371 oidp->oid_descr = malloc(len, M_SYSCTLOID, M_WAITOK);
373 strcpy((char *)(uintptr_t)(const void *)oidp->oid_descr, descr);
375 /* Update the context, if used */
377 sysctl_ctx_entry_add(clist, oidp);
378 /* Register this oid */
379 sysctl_register_oid(oidp);
384 * Bulk-register all the oids in a linker_set.
386 void sysctl_register_set(struct linker_set *lsp)
388 int count = lsp->ls_length;
390 for (i = 0; i < count; i++)
391 sysctl_register_oid((struct sysctl_oid *) lsp->ls_items[i]);
394 void sysctl_unregister_set(struct linker_set *lsp)
396 int count = lsp->ls_length;
398 for (i = 0; i < count; i++)
399 sysctl_unregister_oid((struct sysctl_oid *) lsp->ls_items[i]);
403 * Register the kernel's oids on startup.
405 extern struct linker_set sysctl_set;
407 static void sysctl_register_all(void *arg)
410 sysctl_register_set(&sysctl_set);
413 SYSINIT(sysctl, SI_SUB_KMEM, SI_ORDER_ANY, sysctl_register_all, 0);
418 * These functions implement a presently undocumented interface
419 * used by the sysctl program to walk the tree, and get the type
420 * so it can print the value.
421 * This interface is under work and consideration, and should probably
422 * be killed with a big axe by the first person who can find the time.
423 * (be aware though, that the proper interface isn't as obvious as it
424 * may seem, there are various conflicting requirements.
426 * {0,0} printf the entire MIB-tree.
427 * {0,1,...} return the name of the "..." OID.
428 * {0,2,...} return the next OID.
429 * {0,3} return the OID of the name in "new"
430 * {0,4,...} return the kind & format info for the "..." OID.
434 sysctl_sysctl_debug_dump_node(struct sysctl_oid_list *l, int i)
437 struct sysctl_oid *oidp;
439 SLIST_FOREACH(oidp, l, oid_link) {
444 printf("%d %s ", oidp->oid_number, oidp->oid_name);
447 oidp->oid_kind & CTLFLAG_RD ? 'R':' ',
448 oidp->oid_kind & CTLFLAG_WR ? 'W':' ');
450 if (oidp->oid_handler)
453 switch (oidp->oid_kind & CTLTYPE) {
456 if (!oidp->oid_handler) {
457 sysctl_sysctl_debug_dump_node(
458 oidp->oid_arg1, i+2);
461 case CTLTYPE_INT: printf(" Int\n"); break;
462 case CTLTYPE_STRING: printf(" String\n"); break;
463 case CTLTYPE_QUAD: printf(" Quad\n"); break;
464 case CTLTYPE_OPAQUE: printf(" Opaque/struct\n"); break;
465 default: printf("\n");
472 sysctl_sysctl_debug(SYSCTL_HANDLER_ARGS)
476 error = suser(req->p);
479 sysctl_sysctl_debug_dump_node(&sysctl__children, 0);
483 SYSCTL_PROC(_sysctl, 0, debug, CTLTYPE_STRING|CTLFLAG_RD,
484 0, 0, sysctl_sysctl_debug, "-", "");
487 sysctl_sysctl_name(SYSCTL_HANDLER_ARGS)
489 int *name = (int *) arg1;
490 u_int namelen = arg2;
492 struct sysctl_oid *oid;
493 struct sysctl_oid_list *lsp = &sysctl__children, *lsp2;
498 snprintf(buf,sizeof(buf),"%d",*name);
500 error = SYSCTL_OUT(req, ".", 1);
502 error = SYSCTL_OUT(req, buf, strlen(buf));
510 SLIST_FOREACH(oid, lsp, oid_link) {
511 if (oid->oid_number != *name)
515 error = SYSCTL_OUT(req, ".", 1);
517 error = SYSCTL_OUT(req, oid->oid_name,
518 strlen(oid->oid_name));
525 if ((oid->oid_kind & CTLTYPE) != CTLTYPE_NODE)
528 if (oid->oid_handler)
531 lsp2 = (struct sysctl_oid_list *)oid->oid_arg1;
536 return (SYSCTL_OUT(req, "", 1));
539 SYSCTL_NODE(_sysctl, 1, name, CTLFLAG_RD, sysctl_sysctl_name, "");
542 sysctl_sysctl_next_ls(struct sysctl_oid_list *lsp, int *name, u_int namelen,
543 int *next, int *len, int level, struct sysctl_oid **oidpp)
545 struct sysctl_oid *oidp;
548 SLIST_FOREACH(oidp, lsp, oid_link) {
549 *next = oidp->oid_number;
553 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE)
555 if (oidp->oid_handler)
556 /* We really should call the handler here...*/
558 lsp = (struct sysctl_oid_list *)oidp->oid_arg1;
559 if (!sysctl_sysctl_next_ls(lsp, 0, 0, next+1,
560 len, level+1, oidpp))
565 if (oidp->oid_number < *name)
568 if (oidp->oid_number > *name) {
569 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE)
571 if (oidp->oid_handler)
573 lsp = (struct sysctl_oid_list *)oidp->oid_arg1;
574 if (!sysctl_sysctl_next_ls(lsp, name+1, namelen-1,
575 next+1, len, level+1, oidpp))
579 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE)
582 if (oidp->oid_handler)
585 lsp = (struct sysctl_oid_list *)oidp->oid_arg1;
586 if (!sysctl_sysctl_next_ls(lsp, name+1, namelen-1, next+1,
587 len, level+1, oidpp))
597 sysctl_sysctl_next(SYSCTL_HANDLER_ARGS)
599 int *name = (int *) arg1;
600 u_int namelen = arg2;
602 struct sysctl_oid *oid;
603 struct sysctl_oid_list *lsp = &sysctl__children;
604 int newoid[CTL_MAXNAME];
606 i = sysctl_sysctl_next_ls(lsp, name, namelen, newoid, &j, 1, &oid);
609 error = SYSCTL_OUT(req, newoid, j * sizeof (int));
613 SYSCTL_NODE(_sysctl, 2, next, CTLFLAG_RD, sysctl_sysctl_next, "");
616 name2oid (char *name, int *oid, int *len, struct sysctl_oid **oidpp)
619 struct sysctl_oid *oidp;
620 struct sysctl_oid_list *lsp = &sysctl__children;
626 p = name + strlen(name) - 1 ;
632 for (p = name; *p && *p != '.'; p++)
638 oidp = SLIST_FIRST(lsp);
640 while (oidp && *len < CTL_MAXNAME) {
641 if (strcmp(name, oidp->oid_name)) {
642 oidp = SLIST_NEXT(oidp, oid_link);
645 *oid++ = oidp->oid_number;
654 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE)
657 if (oidp->oid_handler)
660 lsp = (struct sysctl_oid_list *)oidp->oid_arg1;
661 oidp = SLIST_FIRST(lsp);
663 for (p = name; *p && *p != '.'; p++)
673 sysctl_sysctl_name2oid(SYSCTL_HANDLER_ARGS)
676 int error, oid[CTL_MAXNAME], len;
677 struct sysctl_oid *op = 0;
681 if (req->newlen >= MAXPATHLEN) /* XXX arbitrary, undocumented */
682 return (ENAMETOOLONG);
684 p = malloc(req->newlen+1, M_SYSCTL, M_WAITOK);
686 error = SYSCTL_IN(req, p, req->newlen);
692 p [req->newlen] = '\0';
694 error = name2oid(p, oid, &len, &op);
701 error = SYSCTL_OUT(req, oid, len * sizeof *oid);
705 SYSCTL_PROC(_sysctl, 3, name2oid, CTLFLAG_RW|CTLFLAG_ANYBODY, 0, 0,
706 sysctl_sysctl_name2oid, "I", "");
709 sysctl_sysctl_oidfmt(SYSCTL_HANDLER_ARGS)
711 struct sysctl_oid *oid;
714 error = sysctl_find_oid(arg1, arg2, &oid, NULL, req);
720 error = SYSCTL_OUT(req, &oid->oid_kind, sizeof(oid->oid_kind));
723 error = SYSCTL_OUT(req, oid->oid_fmt, strlen(oid->oid_fmt) + 1);
728 SYSCTL_NODE(_sysctl, 4, oidfmt, CTLFLAG_RD, sysctl_sysctl_oidfmt, "");
731 sysctl_sysctl_oiddescr(SYSCTL_HANDLER_ARGS)
733 struct sysctl_oid *oid;
736 error = sysctl_find_oid(arg1, arg2, &oid, NULL, req);
742 error = SYSCTL_OUT(req, oid->oid_descr, strlen(oid->oid_descr) + 1);
746 SYSCTL_NODE(_sysctl, 5, oiddescr, CTLFLAG_RD, sysctl_sysctl_oiddescr, "");
749 * Default "handler" functions.
753 * Handle an int, signed or unsigned.
755 * a variable: point arg1 at it.
756 * a constant: pass it in arg2.
760 sysctl_handle_int(SYSCTL_HANDLER_ARGS)
765 error = SYSCTL_OUT(req, arg1, sizeof(int));
767 error = SYSCTL_OUT(req, &arg2, sizeof(int));
769 if (error || !req->newptr)
775 error = SYSCTL_IN(req, arg1, sizeof(int));
780 * Handle a long, signed or unsigned. arg1 points to it.
784 sysctl_handle_long(SYSCTL_HANDLER_ARGS)
790 error = SYSCTL_OUT(req, arg1, sizeof(long));
792 if (error || !req->newptr)
795 error = SYSCTL_IN(req, arg1, sizeof(long));
800 * Handle our generic '\0' terminated 'C' string.
802 * a variable string: point arg1 at it, arg2 is max length.
803 * a constant string: point arg1 at it, arg2 is zero.
807 sysctl_handle_string(SYSCTL_HANDLER_ARGS)
811 error = SYSCTL_OUT(req, arg1, strlen((char *)arg1)+1);
813 if (error || !req->newptr)
816 if ((req->newlen - req->newidx) >= arg2) {
819 arg2 = (req->newlen - req->newidx);
820 error = SYSCTL_IN(req, arg1, arg2);
821 ((char *)arg1)[arg2] = '\0';
828 * Handle any kind of opaque data.
829 * arg1 points to it, arg2 is the size.
833 sysctl_handle_opaque(SYSCTL_HANDLER_ARGS)
837 error = SYSCTL_OUT(req, arg1, arg2);
839 if (error || !req->newptr)
842 error = SYSCTL_IN(req, arg1, arg2);
848 * Transfer functions to/from kernel space.
849 * XXX: rather untested at this point
852 sysctl_old_kernel(struct sysctl_req *req, const void *p, size_t l)
858 if (i > req->oldlen - req->oldidx)
859 i = req->oldlen - req->oldidx;
861 bcopy(p, (char *)req->oldptr + req->oldidx, i);
864 if (req->oldptr && i != l)
870 sysctl_new_kernel(struct sysctl_req *req, void *p, size_t l)
875 if (req->newlen - req->newidx < l)
877 bcopy((char *)req->newptr + req->newidx, p, l);
883 kernel_sysctl(struct proc *p, int *name, u_int namelen, void *old, size_t *oldlenp, void *new, size_t newlen, size_t *retval)
886 struct sysctl_req req;
888 bzero(&req, sizeof req);
893 req.oldlen = *oldlenp;
905 req.oldfunc = sysctl_old_kernel;
906 req.newfunc = sysctl_new_kernel;
909 /* XXX this should probably be done in a general way */
910 while (memlock.sl_lock) {
912 (void) tsleep((caddr_t)&memlock, PRIBIO+1, "sysctl", 0);
917 error = sysctl_root(0, name, namelen, &req);
920 vsunlock(req.oldptr, req.oldlen);
924 if (memlock.sl_want) {
926 wakeup((caddr_t)&memlock);
929 if (error && error != ENOMEM)
933 if (req.oldptr && req.oldidx > req.oldlen)
934 *retval = req.oldlen;
936 *retval = req.oldidx;
942 kernel_sysctlbyname(struct proc *p, char *name, void *old, size_t *oldlenp,
943 void *new, size_t newlen, size_t *retval)
945 int oid[CTL_MAXNAME];
949 oid[0] = 0; /* sysctl internal magic */
950 oid[1] = 3; /* name2oid */
951 oidlen = sizeof(oid);
953 error = kernel_sysctl(p, oid, 2, oid, &oidlen,
954 (void *)name, strlen(name), &plen);
958 error = kernel_sysctl(p, oid, plen / sizeof(int), old, oldlenp,
959 new, newlen, retval);
964 * Transfer function to/from user space.
967 sysctl_old_user(struct sysctl_req *req, const void *p, size_t l)
972 if (req->lock == 1 && req->oldptr) {
973 vslock(req->oldptr, req->oldlen);
978 if (i > req->oldlen - req->oldidx)
979 i = req->oldlen - req->oldidx;
981 error = copyout(p, (char *)req->oldptr + req->oldidx,
987 if (req->oldptr && i < l)
993 sysctl_new_user(struct sysctl_req *req, void *p, size_t l)
999 if (req->newlen - req->newidx < l)
1001 error = copyin((char *)req->newptr + req->newidx, p, l);
1007 sysctl_find_oid(int *name, u_int namelen, struct sysctl_oid **noid,
1008 int *nindx, struct sysctl_req *req)
1010 struct sysctl_oid *oid;
1013 oid = SLIST_FIRST(&sysctl__children);
1015 while (oid && indx < CTL_MAXNAME) {
1016 if (oid->oid_number == name[indx]) {
1018 if (oid->oid_kind & CTLFLAG_NOLOCK)
1020 if ((oid->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
1021 if (oid->oid_handler != NULL ||
1029 (struct sysctl_oid_list *)oid->oid_arg1);
1030 } else if (indx == namelen) {
1039 oid = SLIST_NEXT(oid, oid_link);
1046 * Traverse our tree, and find the right node, execute whatever it points
1047 * to, and return the resulting error code.
1051 sysctl_root(SYSCTL_HANDLER_ARGS)
1053 struct sysctl_oid *oid;
1056 error = sysctl_find_oid(arg1, arg2, &oid, &indx, req);
1060 if ((oid->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
1062 * You can't call a sysctl when it's a node, but has
1063 * no handler. Inform the user that it's a node.
1064 * The indx may or may not be the same as namelen.
1066 if (oid->oid_handler == NULL)
1070 /* If writing isn't allowed */
1071 if (req->newptr && (!(oid->oid_kind & CTLFLAG_WR) ||
1072 ((oid->oid_kind & CTLFLAG_SECURE) && securelevel > 0)))
1075 /* Most likely only root can write */
1076 if (!(oid->oid_kind & CTLFLAG_ANYBODY) &&
1077 req->newptr && req->p &&
1078 (error = suser_xxx(0, req->p,
1079 (oid->oid_kind & CTLFLAG_PRISON) ? PRISON_ROOT : 0)))
1082 if (!oid->oid_handler)
1085 if ((oid->oid_kind & CTLTYPE) == CTLTYPE_NODE)
1086 error = oid->oid_handler(oid, (int *)arg1 + indx, arg2 - indx,
1089 error = oid->oid_handler(oid, oid->oid_arg1, oid->oid_arg2,
1094 #ifndef _SYS_SYSPROTO_H_
1095 struct sysctl_args {
1106 __sysctl(struct proc *p, struct sysctl_args *uap)
1108 int error, i, name[CTL_MAXNAME];
1111 if (uap->namelen > CTL_MAXNAME || uap->namelen < 2)
1114 error = copyin(uap->name, &name, uap->namelen * sizeof(int));
1118 error = userland_sysctl(p, name, uap->namelen,
1119 uap->old, uap->oldlenp, 0,
1120 uap->new, uap->newlen, &j);
1121 if (error && error != ENOMEM)
1124 i = copyout(&j, uap->oldlenp, sizeof(j));
1132 * This is used from various compatibility syscalls too. That's why name
1133 * must be in kernel space.
1136 userland_sysctl(struct proc *p, int *name, u_int namelen, void *old, size_t *oldlenp, int inkernel, void *new, size_t newlen, size_t *retval)
1139 struct sysctl_req req, req2;
1141 bzero(&req, sizeof req);
1147 req.oldlen = *oldlenp;
1149 error = copyin(oldlenp, &req.oldlen, sizeof(*oldlenp));
1156 if (!useracc(old, req.oldlen, VM_PROT_WRITE))
1162 if (!useracc(new, req.newlen, VM_PROT_READ))
1164 req.newlen = newlen;
1168 req.oldfunc = sysctl_old_user;
1169 req.newfunc = sysctl_new_user;
1172 /* XXX this should probably be done in a general way */
1173 while (memlock.sl_lock) {
1174 memlock.sl_want = 1;
1175 (void) tsleep((caddr_t)&memlock, PRIBIO+1, "sysctl", 0);
1176 memlock.sl_locked++;
1178 memlock.sl_lock = 1;
1182 error = sysctl_root(0, name, namelen, &req2);
1183 } while (error == EAGAIN);
1187 vsunlock(req.oldptr, req.oldlen);
1189 memlock.sl_lock = 0;
1191 if (memlock.sl_want) {
1192 memlock.sl_want = 0;
1193 wakeup((caddr_t)&memlock);
1196 if (error && error != ENOMEM)
1200 if (req.oldptr && req.oldidx > req.oldlen)
1201 *retval = req.oldlen;
1203 *retval = req.oldidx;
1209 #include <sys/socket.h>
1210 #include <vm/vm_param.h>
1212 #define KINFO_PROC (0<<8)
1213 #define KINFO_RT (1<<8)
1214 #define KINFO_VNODE (2<<8)
1215 #define KINFO_FILE (3<<8)
1216 #define KINFO_METER (4<<8)
1217 #define KINFO_LOADAVG (5<<8)
1218 #define KINFO_CLOCKRATE (6<<8)
1220 /* Non-standard BSDI extension - only present on their 4.3 net-2 releases */
1221 #define KINFO_BSDI_SYSINFO (101<<8)
1224 * XXX this is bloat, but I hope it's better here than on the potentially
1225 * limited kernel stack... -Peter
1229 int bsdi_machine; /* "i386" on BSD/386 */
1230 /* ^^^ this is an offset to the string, relative to the struct start */
1239 int bsdi_ostype; /* "BSD/386" on BSD/386 */
1240 int bsdi_osrelease; /* "1.1" on BSD/386 */
1252 struct timeval pad16;
1253 /* we dont set this, because BSDI's uname used gethostname() instead */
1254 int bsdi_hostname; /* hostname on BSD/386 */
1256 /* the actual string data is appended here */
1260 * this data is appended to the end of the bsdi_si structure during copyout.
1261 * The "char *" offsets are relative to the base of the bsdi_si struct.
1262 * This contains "FreeBSD\02.0-BUILT-nnnnnn\0i386\0", and these strings
1263 * should not exceed the length of the buffer here... (or else!! :-)
1265 static char bsdi_strings[80]; /* It had better be less than this! */
1267 #ifndef _SYS_SYSPROTO_H_
1268 struct getkerninfo_args {
1277 ogetkerninfo(struct proc *p, struct getkerninfo_args *uap)
1282 switch (uap->op & 0xff00) {
1288 name[3] = (uap->op & 0xff0000) >> 16;
1289 name[4] = uap->op & 0xff;
1291 error = userland_sysctl(p, name, 6, uap->where, uap->size,
1297 name[1] = KERN_VNODE;
1298 error = userland_sysctl(p, name, 2, uap->where, uap->size,
1304 name[1] = KERN_PROC;
1305 name[2] = uap->op & 0xff;
1307 error = userland_sysctl(p, name, 4, uap->where, uap->size,
1313 name[1] = KERN_FILE;
1314 error = userland_sysctl(p, name, 2, uap->where, uap->size,
1321 error = userland_sysctl(p, name, 2, uap->where, uap->size,
1327 name[1] = VM_LOADAVG;
1328 error = userland_sysctl(p, name, 2, uap->where, uap->size,
1332 case KINFO_CLOCKRATE:
1334 name[1] = KERN_CLOCKRATE;
1335 error = userland_sysctl(p, name, 2, uap->where, uap->size,
1339 case KINFO_BSDI_SYSINFO: {
1341 * this is pretty crude, but it's just enough for uname()
1342 * from BSDI's 1.x libc to work.
1344 * In particular, it doesn't return the same results when
1345 * the supplied buffer is too small. BSDI's version apparently
1346 * will return the amount copied, and set the *size to how
1347 * much was needed. The emulation framework here isn't capable
1348 * of that, so we just set both to the amount copied.
1349 * BSDI's 2.x product apparently fails with ENOMEM in this
1357 bzero((char *)&bsdi_si, sizeof(bsdi_si));
1358 bzero(bsdi_strings, sizeof(bsdi_strings));
1362 bsdi_si.bsdi_ostype = (s - bsdi_strings) + sizeof(bsdi_si);
1366 bsdi_si.bsdi_osrelease = (s - bsdi_strings) + sizeof(bsdi_si);
1367 strcpy(s, osrelease);
1370 bsdi_si.bsdi_machine = (s - bsdi_strings) + sizeof(bsdi_si);
1374 needed = sizeof(bsdi_si) + (s - bsdi_strings);
1376 if (uap->where == NULL) {
1377 /* process is asking how much buffer to supply.. */
1384 /* if too much buffer supplied, trim it down */
1388 /* how much of the buffer is remaining */
1391 if ((error = copyout((char *)&bsdi_si, uap->where, left)) != 0)
1394 /* is there any point in continuing? */
1395 if (left > sizeof(bsdi_si)) {
1396 left -= sizeof(bsdi_si);
1397 error = copyout(&bsdi_strings,
1398 uap->where + sizeof(bsdi_si), left);
1404 return (EOPNOTSUPP);
1408 p->p_retval[0] = size;
1410 error = copyout((caddr_t)&size, (caddr_t)uap->size,
1414 #endif /* COMPAT_43 */