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.2 2003/06/17 04:28:41 dillon Exp $
44 #include "opt_compat.h"
46 #include <sys/param.h>
47 #include <sys/systm.h>
48 #include <sys/kernel.h>
50 #include <sys/sysctl.h>
51 #include <sys/malloc.h>
53 #include <sys/sysproto.h>
55 #include <vm/vm_extern.h>
57 static MALLOC_DEFINE(M_SYSCTL, "sysctl", "sysctl internal magic");
58 static MALLOC_DEFINE(M_SYSCTLOID, "sysctloid", "sysctl dynamic oids");
63 static struct sysctl_lock {
69 static int sysctl_root(SYSCTL_HANDLER_ARGS);
71 struct sysctl_oid_list sysctl__children; /* root list */
73 static struct sysctl_oid *
74 sysctl_find_oidname(const char *name, struct sysctl_oid_list *list)
76 struct sysctl_oid *oidp;
78 SLIST_FOREACH(oidp, list, oid_link) {
79 if (strcmp(oidp->oid_name, name) == 0) {
87 * Initialization of the MIB tree.
89 * Order by number in each list.
92 void sysctl_register_oid(struct sysctl_oid *oidp)
94 struct sysctl_oid_list *parent = oidp->oid_parent;
100 * First check if another oid with the same name already
101 * exists in the parent's list.
103 p = sysctl_find_oidname(oidp->oid_name, parent);
105 if ((p->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
109 printf("can't re-use a leaf (%s)!\n", p->oid_name);
114 * If this oid has a number OID_AUTO, give it a number which
115 * is greater than any current oid. Make sure it is at least
116 * 100 to leave space for pre-assigned oid numbers.
118 if (oidp->oid_number == OID_AUTO) {
119 /* First, find the highest oid in the parent list >99 */
121 SLIST_FOREACH(p, parent, oid_link) {
122 if (p->oid_number > n)
125 oidp->oid_number = n + 1;
129 * Insert the oid into the parent's list in order.
132 SLIST_FOREACH(p, parent, oid_link) {
133 if (oidp->oid_number < p->oid_number)
138 SLIST_INSERT_AFTER(q, oidp, oid_link);
140 SLIST_INSERT_HEAD(parent, oidp, oid_link);
143 void sysctl_unregister_oid(struct sysctl_oid *oidp)
146 SLIST_REMOVE(oidp->oid_parent, oidp, sysctl_oid, oid_link);
149 /* Initialize a new context to keep track of dynamically added sysctls. */
151 sysctl_ctx_init(struct sysctl_ctx_list *c)
161 /* Free the context, and destroy all dynamic oids registered in this context */
163 sysctl_ctx_free(struct sysctl_ctx_list *clist)
165 struct sysctl_ctx_entry *e, *e1;
170 * First perform a "dry run" to check if it's ok to remove oids.
172 * XXX This algorithm is a hack. But I don't know any
173 * XXX better solution for now...
175 TAILQ_FOREACH(e, clist, link) {
176 error = sysctl_remove_oid(e->entry, 0, 0);
181 * Restore deregistered entries, either from the end,
182 * or from the place where error occured.
183 * e contains the entry that was not unregistered
186 e1 = TAILQ_PREV(e, sysctl_ctx_list, link);
188 e1 = TAILQ_LAST(clist, sysctl_ctx_list);
190 sysctl_register_oid(e1->entry);
191 e1 = TAILQ_PREV(e1, sysctl_ctx_list, link);
195 /* Now really delete the entries */
196 e = TAILQ_FIRST(clist);
198 e1 = TAILQ_NEXT(e, link);
199 error = sysctl_remove_oid(e->entry, 1, 0);
201 panic("sysctl_remove_oid: corrupt tree, entry: %s",
203 free(e, M_SYSCTLOID);
209 /* Add an entry to the context */
210 struct sysctl_ctx_entry *
211 sysctl_ctx_entry_add(struct sysctl_ctx_list *clist, struct sysctl_oid *oidp)
213 struct sysctl_ctx_entry *e;
215 if (clist == NULL || oidp == NULL)
217 e = malloc(sizeof(struct sysctl_ctx_entry), M_SYSCTLOID, M_WAITOK);
219 TAILQ_INSERT_HEAD(clist, e, link);
223 /* Find an entry in the context */
224 struct sysctl_ctx_entry *
225 sysctl_ctx_entry_find(struct sysctl_ctx_list *clist, struct sysctl_oid *oidp)
227 struct sysctl_ctx_entry *e;
229 if (clist == NULL || oidp == NULL)
231 for (e = TAILQ_FIRST(clist); e != NULL; e = TAILQ_NEXT(e, link)) {
239 * Delete an entry from the context.
240 * NOTE: this function doesn't free oidp! You have to remove it
241 * with sysctl_remove_oid().
244 sysctl_ctx_entry_del(struct sysctl_ctx_list *clist, struct sysctl_oid *oidp)
246 struct sysctl_ctx_entry *e;
248 if (clist == NULL || oidp == NULL)
250 e = sysctl_ctx_entry_find(clist, oidp);
252 TAILQ_REMOVE(clist, e, link);
253 free(e, M_SYSCTLOID);
260 * Remove dynamically created sysctl trees.
261 * oidp - top of the tree to be removed
262 * del - if 0 - just deregister, otherwise free up entries as well
263 * recurse - if != 0 traverse the subtree to be deleted
266 sysctl_remove_oid(struct sysctl_oid *oidp, int del, int recurse)
268 struct sysctl_oid *p;
273 if ((oidp->oid_kind & CTLFLAG_DYN) == 0) {
274 printf("can't remove non-dynamic nodes!\n");
278 * WARNING: normal method to do this should be through
279 * sysctl_ctx_free(). Use recursing as the last resort
280 * method to purge your sysctl tree of leftovers...
281 * However, if some other code still references these nodes,
284 if ((oidp->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
285 if (oidp->oid_refcnt == 1) {
286 SLIST_FOREACH(p, SYSCTL_CHILDREN(oidp), oid_link) {
289 error = sysctl_remove_oid(p, del, recurse);
294 free(SYSCTL_CHILDREN(oidp), M_SYSCTLOID);
297 if (oidp->oid_refcnt > 1 ) {
300 if (oidp->oid_refcnt == 0) {
301 printf("Warning: bad oid_refcnt=%u (%s)!\n",
302 oidp->oid_refcnt, oidp->oid_name);
305 sysctl_unregister_oid(oidp);
308 free((void *)(uintptr_t)(const void *)oidp->oid_descr, M_SYSCTLOID);
309 free((void *)(uintptr_t)(const void *)oidp->oid_name,
311 free(oidp, M_SYSCTLOID);
318 * Create new sysctls at run time.
319 * clist may point to a valid context initialized with sysctl_ctx_init().
322 sysctl_add_oid(struct sysctl_ctx_list *clist, struct sysctl_oid_list *parent,
323 int number, const char *name, int kind, void *arg1, int arg2,
324 int (*handler)(SYSCTL_HANDLER_ARGS), const char *fmt, const char *descr)
326 struct sysctl_oid *oidp;
330 /* You have to hook up somewhere.. */
333 /* Check if the node already exists, otherwise create it */
334 oidp = sysctl_find_oidname(name, parent);
336 if ((oidp->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
338 /* Update the context */
340 sysctl_ctx_entry_add(clist, oidp);
343 printf("can't re-use a leaf (%s)!\n", name);
347 oidp = malloc(sizeof(struct sysctl_oid), M_SYSCTLOID, M_WAITOK);
348 bzero(oidp, sizeof(struct sysctl_oid));
349 oidp->oid_parent = parent;
350 SLIST_NEXT(oidp, oid_link) = NULL;
351 oidp->oid_number = number;
352 oidp->oid_refcnt = 1;
354 newname = malloc(len + 1, M_SYSCTLOID, M_WAITOK);
355 bcopy(name, newname, len + 1);
357 oidp->oid_name = newname;
358 oidp->oid_handler = handler;
359 oidp->oid_kind = CTLFLAG_DYN | kind;
360 if ((kind & CTLTYPE) == CTLTYPE_NODE) {
361 /* Allocate space for children */
362 SYSCTL_CHILDREN(oidp) = malloc(sizeof(struct sysctl_oid_list),
363 M_SYSCTLOID, M_WAITOK);
364 SLIST_INIT(SYSCTL_CHILDREN(oidp));
366 oidp->oid_arg1 = arg1;
367 oidp->oid_arg2 = arg2;
371 int len = strlen(descr) + 1;
372 oidp->oid_descr = malloc(len, M_SYSCTLOID, M_WAITOK);
374 strcpy((char *)(uintptr_t)(const void *)oidp->oid_descr, descr);
376 /* Update the context, if used */
378 sysctl_ctx_entry_add(clist, oidp);
379 /* Register this oid */
380 sysctl_register_oid(oidp);
385 * Bulk-register all the oids in a linker_set.
387 void sysctl_register_set(struct linker_set *lsp)
389 int count = lsp->ls_length;
391 for (i = 0; i < count; i++)
392 sysctl_register_oid((struct sysctl_oid *) lsp->ls_items[i]);
395 void sysctl_unregister_set(struct linker_set *lsp)
397 int count = lsp->ls_length;
399 for (i = 0; i < count; i++)
400 sysctl_unregister_oid((struct sysctl_oid *) lsp->ls_items[i]);
404 * Register the kernel's oids on startup.
406 extern struct linker_set sysctl_set;
408 static void sysctl_register_all(void *arg)
411 sysctl_register_set(&sysctl_set);
414 SYSINIT(sysctl, SI_SUB_KMEM, SI_ORDER_ANY, sysctl_register_all, 0);
419 * These functions implement a presently undocumented interface
420 * used by the sysctl program to walk the tree, and get the type
421 * so it can print the value.
422 * This interface is under work and consideration, and should probably
423 * be killed with a big axe by the first person who can find the time.
424 * (be aware though, that the proper interface isn't as obvious as it
425 * may seem, there are various conflicting requirements.
427 * {0,0} printf the entire MIB-tree.
428 * {0,1,...} return the name of the "..." OID.
429 * {0,2,...} return the next OID.
430 * {0,3} return the OID of the name in "new"
431 * {0,4,...} return the kind & format info for the "..." OID.
435 sysctl_sysctl_debug_dump_node(struct sysctl_oid_list *l, int i)
438 struct sysctl_oid *oidp;
440 SLIST_FOREACH(oidp, l, oid_link) {
445 printf("%d %s ", oidp->oid_number, oidp->oid_name);
448 oidp->oid_kind & CTLFLAG_RD ? 'R':' ',
449 oidp->oid_kind & CTLFLAG_WR ? 'W':' ');
451 if (oidp->oid_handler)
454 switch (oidp->oid_kind & CTLTYPE) {
457 if (!oidp->oid_handler) {
458 sysctl_sysctl_debug_dump_node(
459 oidp->oid_arg1, i+2);
462 case CTLTYPE_INT: printf(" Int\n"); break;
463 case CTLTYPE_STRING: printf(" String\n"); break;
464 case CTLTYPE_QUAD: printf(" Quad\n"); break;
465 case CTLTYPE_OPAQUE: printf(" Opaque/struct\n"); break;
466 default: printf("\n");
473 sysctl_sysctl_debug(SYSCTL_HANDLER_ARGS)
477 error = suser(req->p);
480 sysctl_sysctl_debug_dump_node(&sysctl__children, 0);
484 SYSCTL_PROC(_sysctl, 0, debug, CTLTYPE_STRING|CTLFLAG_RD,
485 0, 0, sysctl_sysctl_debug, "-", "");
488 sysctl_sysctl_name(SYSCTL_HANDLER_ARGS)
490 int *name = (int *) arg1;
491 u_int namelen = arg2;
493 struct sysctl_oid *oid;
494 struct sysctl_oid_list *lsp = &sysctl__children, *lsp2;
499 snprintf(buf,sizeof(buf),"%d",*name);
501 error = SYSCTL_OUT(req, ".", 1);
503 error = SYSCTL_OUT(req, buf, strlen(buf));
511 SLIST_FOREACH(oid, lsp, oid_link) {
512 if (oid->oid_number != *name)
516 error = SYSCTL_OUT(req, ".", 1);
518 error = SYSCTL_OUT(req, oid->oid_name,
519 strlen(oid->oid_name));
526 if ((oid->oid_kind & CTLTYPE) != CTLTYPE_NODE)
529 if (oid->oid_handler)
532 lsp2 = (struct sysctl_oid_list *)oid->oid_arg1;
537 return (SYSCTL_OUT(req, "", 1));
540 SYSCTL_NODE(_sysctl, 1, name, CTLFLAG_RD, sysctl_sysctl_name, "");
543 sysctl_sysctl_next_ls(struct sysctl_oid_list *lsp, int *name, u_int namelen,
544 int *next, int *len, int level, struct sysctl_oid **oidpp)
546 struct sysctl_oid *oidp;
549 SLIST_FOREACH(oidp, lsp, oid_link) {
550 *next = oidp->oid_number;
554 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE)
556 if (oidp->oid_handler)
557 /* We really should call the handler here...*/
559 lsp = (struct sysctl_oid_list *)oidp->oid_arg1;
560 if (!sysctl_sysctl_next_ls(lsp, 0, 0, next+1,
561 len, level+1, oidpp))
566 if (oidp->oid_number < *name)
569 if (oidp->oid_number > *name) {
570 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE)
572 if (oidp->oid_handler)
574 lsp = (struct sysctl_oid_list *)oidp->oid_arg1;
575 if (!sysctl_sysctl_next_ls(lsp, name+1, namelen-1,
576 next+1, len, level+1, oidpp))
580 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE)
583 if (oidp->oid_handler)
586 lsp = (struct sysctl_oid_list *)oidp->oid_arg1;
587 if (!sysctl_sysctl_next_ls(lsp, name+1, namelen-1, next+1,
588 len, level+1, oidpp))
598 sysctl_sysctl_next(SYSCTL_HANDLER_ARGS)
600 int *name = (int *) arg1;
601 u_int namelen = arg2;
603 struct sysctl_oid *oid;
604 struct sysctl_oid_list *lsp = &sysctl__children;
605 int newoid[CTL_MAXNAME];
607 i = sysctl_sysctl_next_ls(lsp, name, namelen, newoid, &j, 1, &oid);
610 error = SYSCTL_OUT(req, newoid, j * sizeof (int));
614 SYSCTL_NODE(_sysctl, 2, next, CTLFLAG_RD, sysctl_sysctl_next, "");
617 name2oid (char *name, int *oid, int *len, struct sysctl_oid **oidpp)
620 struct sysctl_oid *oidp;
621 struct sysctl_oid_list *lsp = &sysctl__children;
627 p = name + strlen(name) - 1 ;
633 for (p = name; *p && *p != '.'; p++)
639 oidp = SLIST_FIRST(lsp);
641 while (oidp && *len < CTL_MAXNAME) {
642 if (strcmp(name, oidp->oid_name)) {
643 oidp = SLIST_NEXT(oidp, oid_link);
646 *oid++ = oidp->oid_number;
655 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE)
658 if (oidp->oid_handler)
661 lsp = (struct sysctl_oid_list *)oidp->oid_arg1;
662 oidp = SLIST_FIRST(lsp);
664 for (p = name; *p && *p != '.'; p++)
674 sysctl_sysctl_name2oid(SYSCTL_HANDLER_ARGS)
677 int error, oid[CTL_MAXNAME], len;
678 struct sysctl_oid *op = 0;
682 if (req->newlen >= MAXPATHLEN) /* XXX arbitrary, undocumented */
683 return (ENAMETOOLONG);
685 p = malloc(req->newlen+1, M_SYSCTL, M_WAITOK);
687 error = SYSCTL_IN(req, p, req->newlen);
693 p [req->newlen] = '\0';
695 error = name2oid(p, oid, &len, &op);
702 error = SYSCTL_OUT(req, oid, len * sizeof *oid);
706 SYSCTL_PROC(_sysctl, 3, name2oid, CTLFLAG_RW|CTLFLAG_ANYBODY, 0, 0,
707 sysctl_sysctl_name2oid, "I", "");
710 sysctl_sysctl_oidfmt(SYSCTL_HANDLER_ARGS)
712 struct sysctl_oid *oid;
715 error = sysctl_find_oid(arg1, arg2, &oid, NULL, req);
721 error = SYSCTL_OUT(req, &oid->oid_kind, sizeof(oid->oid_kind));
724 error = SYSCTL_OUT(req, oid->oid_fmt, strlen(oid->oid_fmt) + 1);
729 SYSCTL_NODE(_sysctl, 4, oidfmt, CTLFLAG_RD, sysctl_sysctl_oidfmt, "");
732 sysctl_sysctl_oiddescr(SYSCTL_HANDLER_ARGS)
734 struct sysctl_oid *oid;
737 error = sysctl_find_oid(arg1, arg2, &oid, NULL, req);
743 error = SYSCTL_OUT(req, oid->oid_descr, strlen(oid->oid_descr) + 1);
747 SYSCTL_NODE(_sysctl, 5, oiddescr, CTLFLAG_RD, sysctl_sysctl_oiddescr, "");
750 * Default "handler" functions.
754 * Handle an int, signed or unsigned.
756 * a variable: point arg1 at it.
757 * a constant: pass it in arg2.
761 sysctl_handle_int(SYSCTL_HANDLER_ARGS)
766 error = SYSCTL_OUT(req, arg1, sizeof(int));
768 error = SYSCTL_OUT(req, &arg2, sizeof(int));
770 if (error || !req->newptr)
776 error = SYSCTL_IN(req, arg1, sizeof(int));
781 * Handle a long, signed or unsigned. arg1 points to it.
785 sysctl_handle_long(SYSCTL_HANDLER_ARGS)
791 error = SYSCTL_OUT(req, arg1, sizeof(long));
793 if (error || !req->newptr)
796 error = SYSCTL_IN(req, arg1, sizeof(long));
801 * Handle our generic '\0' terminated 'C' string.
803 * a variable string: point arg1 at it, arg2 is max length.
804 * a constant string: point arg1 at it, arg2 is zero.
808 sysctl_handle_string(SYSCTL_HANDLER_ARGS)
812 error = SYSCTL_OUT(req, arg1, strlen((char *)arg1)+1);
814 if (error || !req->newptr)
817 if ((req->newlen - req->newidx) >= arg2) {
820 arg2 = (req->newlen - req->newidx);
821 error = SYSCTL_IN(req, arg1, arg2);
822 ((char *)arg1)[arg2] = '\0';
829 * Handle any kind of opaque data.
830 * arg1 points to it, arg2 is the size.
834 sysctl_handle_opaque(SYSCTL_HANDLER_ARGS)
838 error = SYSCTL_OUT(req, arg1, arg2);
840 if (error || !req->newptr)
843 error = SYSCTL_IN(req, arg1, arg2);
849 * Transfer functions to/from kernel space.
850 * XXX: rather untested at this point
853 sysctl_old_kernel(struct sysctl_req *req, const void *p, size_t l)
859 if (i > req->oldlen - req->oldidx)
860 i = req->oldlen - req->oldidx;
862 bcopy(p, (char *)req->oldptr + req->oldidx, i);
865 if (req->oldptr && i != l)
871 sysctl_new_kernel(struct sysctl_req *req, void *p, size_t l)
876 if (req->newlen - req->newidx < l)
878 bcopy((char *)req->newptr + req->newidx, p, l);
884 kernel_sysctl(struct proc *p, int *name, u_int namelen, void *old, size_t *oldlenp, void *new, size_t newlen, size_t *retval)
887 struct sysctl_req req;
889 bzero(&req, sizeof req);
894 req.oldlen = *oldlenp;
906 req.oldfunc = sysctl_old_kernel;
907 req.newfunc = sysctl_new_kernel;
910 /* XXX this should probably be done in a general way */
911 while (memlock.sl_lock) {
913 (void) tsleep((caddr_t)&memlock, PRIBIO+1, "sysctl", 0);
918 error = sysctl_root(0, name, namelen, &req);
921 vsunlock(req.oldptr, req.oldlen);
925 if (memlock.sl_want) {
927 wakeup((caddr_t)&memlock);
930 if (error && error != ENOMEM)
934 if (req.oldptr && req.oldidx > req.oldlen)
935 *retval = req.oldlen;
937 *retval = req.oldidx;
943 kernel_sysctlbyname(struct proc *p, char *name, void *old, size_t *oldlenp,
944 void *new, size_t newlen, size_t *retval)
946 int oid[CTL_MAXNAME];
950 oid[0] = 0; /* sysctl internal magic */
951 oid[1] = 3; /* name2oid */
952 oidlen = sizeof(oid);
954 error = kernel_sysctl(p, oid, 2, oid, &oidlen,
955 (void *)name, strlen(name), &plen);
959 error = kernel_sysctl(p, oid, plen / sizeof(int), old, oldlenp,
960 new, newlen, retval);
965 * Transfer function to/from user space.
968 sysctl_old_user(struct sysctl_req *req, const void *p, size_t l)
973 if (req->lock == 1 && req->oldptr) {
974 vslock(req->oldptr, req->oldlen);
979 if (i > req->oldlen - req->oldidx)
980 i = req->oldlen - req->oldidx;
982 error = copyout(p, (char *)req->oldptr + req->oldidx,
988 if (req->oldptr && i < l)
994 sysctl_new_user(struct sysctl_req *req, void *p, size_t l)
1000 if (req->newlen - req->newidx < l)
1002 error = copyin((char *)req->newptr + req->newidx, p, l);
1008 sysctl_find_oid(int *name, u_int namelen, struct sysctl_oid **noid,
1009 int *nindx, struct sysctl_req *req)
1011 struct sysctl_oid *oid;
1014 oid = SLIST_FIRST(&sysctl__children);
1016 while (oid && indx < CTL_MAXNAME) {
1017 if (oid->oid_number == name[indx]) {
1019 if (oid->oid_kind & CTLFLAG_NOLOCK)
1021 if ((oid->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
1022 if (oid->oid_handler != NULL ||
1030 (struct sysctl_oid_list *)oid->oid_arg1);
1031 } else if (indx == namelen) {
1040 oid = SLIST_NEXT(oid, oid_link);
1047 * Traverse our tree, and find the right node, execute whatever it points
1048 * to, and return the resulting error code.
1052 sysctl_root(SYSCTL_HANDLER_ARGS)
1054 struct sysctl_oid *oid;
1057 error = sysctl_find_oid(arg1, arg2, &oid, &indx, req);
1061 if ((oid->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
1063 * You can't call a sysctl when it's a node, but has
1064 * no handler. Inform the user that it's a node.
1065 * The indx may or may not be the same as namelen.
1067 if (oid->oid_handler == NULL)
1071 /* If writing isn't allowed */
1072 if (req->newptr && (!(oid->oid_kind & CTLFLAG_WR) ||
1073 ((oid->oid_kind & CTLFLAG_SECURE) && securelevel > 0)))
1076 /* Most likely only root can write */
1077 if (!(oid->oid_kind & CTLFLAG_ANYBODY) &&
1078 req->newptr && req->p &&
1079 (error = suser_xxx(0, req->p,
1080 (oid->oid_kind & CTLFLAG_PRISON) ? PRISON_ROOT : 0)))
1083 if (!oid->oid_handler)
1086 if ((oid->oid_kind & CTLTYPE) == CTLTYPE_NODE)
1087 error = oid->oid_handler(oid, (int *)arg1 + indx, arg2 - indx,
1090 error = oid->oid_handler(oid, oid->oid_arg1, oid->oid_arg2,
1095 #ifndef _SYS_SYSPROTO_H_
1096 struct sysctl_args {
1107 __sysctl(struct proc *p, struct sysctl_args *uap)
1109 int error, i, name[CTL_MAXNAME];
1112 if (uap->namelen > CTL_MAXNAME || uap->namelen < 2)
1115 error = copyin(uap->name, &name, uap->namelen * sizeof(int));
1119 error = userland_sysctl(p, name, uap->namelen,
1120 uap->old, uap->oldlenp, 0,
1121 uap->new, uap->newlen, &j);
1122 if (error && error != ENOMEM)
1125 i = copyout(&j, uap->oldlenp, sizeof(j));
1133 * This is used from various compatibility syscalls too. That's why name
1134 * must be in kernel space.
1137 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)
1140 struct sysctl_req req, req2;
1142 bzero(&req, sizeof req);
1148 req.oldlen = *oldlenp;
1150 error = copyin(oldlenp, &req.oldlen, sizeof(*oldlenp));
1157 if (!useracc(old, req.oldlen, VM_PROT_WRITE))
1163 if (!useracc(new, req.newlen, VM_PROT_READ))
1165 req.newlen = newlen;
1169 req.oldfunc = sysctl_old_user;
1170 req.newfunc = sysctl_new_user;
1173 /* XXX this should probably be done in a general way */
1174 while (memlock.sl_lock) {
1175 memlock.sl_want = 1;
1176 (void) tsleep((caddr_t)&memlock, PRIBIO+1, "sysctl", 0);
1177 memlock.sl_locked++;
1179 memlock.sl_lock = 1;
1183 error = sysctl_root(0, name, namelen, &req2);
1184 } while (error == EAGAIN);
1188 vsunlock(req.oldptr, req.oldlen);
1190 memlock.sl_lock = 0;
1192 if (memlock.sl_want) {
1193 memlock.sl_want = 0;
1194 wakeup((caddr_t)&memlock);
1197 if (error && error != ENOMEM)
1201 if (req.oldptr && req.oldidx > req.oldlen)
1202 *retval = req.oldlen;
1204 *retval = req.oldidx;
1210 #include <sys/socket.h>
1211 #include <vm/vm_param.h>
1213 #define KINFO_PROC (0<<8)
1214 #define KINFO_RT (1<<8)
1215 #define KINFO_VNODE (2<<8)
1216 #define KINFO_FILE (3<<8)
1217 #define KINFO_METER (4<<8)
1218 #define KINFO_LOADAVG (5<<8)
1219 #define KINFO_CLOCKRATE (6<<8)
1221 /* Non-standard BSDI extension - only present on their 4.3 net-2 releases */
1222 #define KINFO_BSDI_SYSINFO (101<<8)
1225 * XXX this is bloat, but I hope it's better here than on the potentially
1226 * limited kernel stack... -Peter
1230 int bsdi_machine; /* "i386" on BSD/386 */
1231 /* ^^^ this is an offset to the string, relative to the struct start */
1240 int bsdi_ostype; /* "BSD/386" on BSD/386 */
1241 int bsdi_osrelease; /* "1.1" on BSD/386 */
1253 struct timeval pad16;
1254 /* we dont set this, because BSDI's uname used gethostname() instead */
1255 int bsdi_hostname; /* hostname on BSD/386 */
1257 /* the actual string data is appended here */
1261 * this data is appended to the end of the bsdi_si structure during copyout.
1262 * The "char *" offsets are relative to the base of the bsdi_si struct.
1263 * This contains "FreeBSD\02.0-BUILT-nnnnnn\0i386\0", and these strings
1264 * should not exceed the length of the buffer here... (or else!! :-)
1266 static char bsdi_strings[80]; /* It had better be less than this! */
1268 #ifndef _SYS_SYSPROTO_H_
1269 struct getkerninfo_args {
1278 ogetkerninfo(struct proc *p, struct getkerninfo_args *uap)
1283 switch (uap->op & 0xff00) {
1289 name[3] = (uap->op & 0xff0000) >> 16;
1290 name[4] = uap->op & 0xff;
1292 error = userland_sysctl(p, name, 6, uap->where, uap->size,
1298 name[1] = KERN_VNODE;
1299 error = userland_sysctl(p, name, 2, uap->where, uap->size,
1305 name[1] = KERN_PROC;
1306 name[2] = uap->op & 0xff;
1308 error = userland_sysctl(p, name, 4, uap->where, uap->size,
1314 name[1] = KERN_FILE;
1315 error = userland_sysctl(p, name, 2, uap->where, uap->size,
1322 error = userland_sysctl(p, name, 2, uap->where, uap->size,
1328 name[1] = VM_LOADAVG;
1329 error = userland_sysctl(p, name, 2, uap->where, uap->size,
1333 case KINFO_CLOCKRATE:
1335 name[1] = KERN_CLOCKRATE;
1336 error = userland_sysctl(p, name, 2, uap->where, uap->size,
1340 case KINFO_BSDI_SYSINFO: {
1342 * this is pretty crude, but it's just enough for uname()
1343 * from BSDI's 1.x libc to work.
1345 * In particular, it doesn't return the same results when
1346 * the supplied buffer is too small. BSDI's version apparently
1347 * will return the amount copied, and set the *size to how
1348 * much was needed. The emulation framework here isn't capable
1349 * of that, so we just set both to the amount copied.
1350 * BSDI's 2.x product apparently fails with ENOMEM in this
1358 bzero((char *)&bsdi_si, sizeof(bsdi_si));
1359 bzero(bsdi_strings, sizeof(bsdi_strings));
1363 bsdi_si.bsdi_ostype = (s - bsdi_strings) + sizeof(bsdi_si);
1367 bsdi_si.bsdi_osrelease = (s - bsdi_strings) + sizeof(bsdi_si);
1368 strcpy(s, osrelease);
1371 bsdi_si.bsdi_machine = (s - bsdi_strings) + sizeof(bsdi_si);
1375 needed = sizeof(bsdi_si) + (s - bsdi_strings);
1377 if (uap->where == NULL) {
1378 /* process is asking how much buffer to supply.. */
1385 /* if too much buffer supplied, trim it down */
1389 /* how much of the buffer is remaining */
1392 if ((error = copyout((char *)&bsdi_si, uap->where, left)) != 0)
1395 /* is there any point in continuing? */
1396 if (left > sizeof(bsdi_si)) {
1397 left -= sizeof(bsdi_si);
1398 error = copyout(&bsdi_strings,
1399 uap->where + sizeof(bsdi_si), left);
1405 return (EOPNOTSUPP);
1409 p->p_retval[0] = size;
1411 error = copyout((caddr_t)&size, (caddr_t)uap->size,
1415 #endif /* COMPAT_43 */