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 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * @(#)kern_sysctl.c 8.4 (Berkeley) 4/14/94
38 #include <sys/cdefs.h>
39 __FBSDID("$FreeBSD$");
41 #include "opt_compat.h"
44 #include <sys/param.h>
45 #include <sys/systm.h>
46 #include <sys/kernel.h>
47 #include <sys/sysctl.h>
49 #include <sys/malloc.h>
52 #include <sys/mutex.h>
54 #include <sys/sysproto.h>
56 #include <vm/vm_extern.h>
58 static MALLOC_DEFINE(M_SYSCTL, "sysctl", "sysctl internal magic");
59 static MALLOC_DEFINE(M_SYSCTLOID, "sysctloid", "sysctl dynamic oids");
60 static MALLOC_DEFINE(M_SYSCTLTMP, "sysctltmp", "sysctl temp output buffer");
63 * Locking - this locks the sysctl tree in memory.
65 static struct sx sysctllock;
67 #define SYSCTL_LOCK() sx_xlock(&sysctllock)
68 #define SYSCTL_UNLOCK() sx_xunlock(&sysctllock)
69 #define SYSCTL_INIT() sx_init(&sysctllock, "sysctl lock")
71 static int sysctl_root(SYSCTL_HANDLER_ARGS);
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)
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 struct sysctl_oid_list *parent = oidp->oid_parent;
102 * First check if another oid with the same name already
103 * exists in the parent's list.
105 p = sysctl_find_oidname(oidp->oid_name, parent);
107 if ((p->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
111 printf("can't re-use a leaf (%s)!\n", p->oid_name);
116 * If this oid has a number OID_AUTO, give it a number which
117 * is greater than any current oid.
118 * NOTE: DO NOT change the starting value here, change it in
119 * <sys/sysctl.h>, and make sure it is at least 256 to
120 * accomodate e.g. net.inet.raw as a static sysctl node.
122 if (oidp->oid_number == OID_AUTO) {
123 static int newoid = CTL_AUTO_START;
125 oidp->oid_number = newoid++;
126 if (newoid == 0x7fffffff)
127 panic("out of oids");
130 else if (oidp->oid_number >= CTL_AUTO_START) {
131 /* do not panic; this happens when unregistering sysctl sets */
132 printf("static sysctl oid too high: %d", oidp->oid_number);
137 * Insert the oid into the parent's list in order.
140 SLIST_FOREACH(p, parent, oid_link) {
141 if (oidp->oid_number < p->oid_number)
146 SLIST_INSERT_AFTER(q, oidp, oid_link);
148 SLIST_INSERT_HEAD(parent, oidp, oid_link);
152 sysctl_unregister_oid(struct sysctl_oid *oidp)
154 struct sysctl_oid *p;
158 if (oidp->oid_number == OID_AUTO) {
161 SLIST_FOREACH(p, oidp->oid_parent, oid_link) {
163 SLIST_REMOVE(oidp->oid_parent, oidp,
164 sysctl_oid, oid_link);
172 * This can happen when a module fails to register and is
173 * being unloaded afterwards. It should not be a panic()
177 printf("%s: failed to unregister sysctl\n", __func__);
180 /* Initialize a new context to keep track of dynamically added sysctls. */
182 sysctl_ctx_init(struct sysctl_ctx_list *c)
192 /* Free the context, and destroy all dynamic oids registered in this context */
194 sysctl_ctx_free(struct sysctl_ctx_list *clist)
196 struct sysctl_ctx_entry *e, *e1;
201 * First perform a "dry run" to check if it's ok to remove oids.
203 * XXX This algorithm is a hack. But I don't know any
204 * XXX better solution for now...
206 TAILQ_FOREACH(e, clist, link) {
207 error = sysctl_remove_oid(e->entry, 0, 0);
212 * Restore deregistered entries, either from the end,
213 * or from the place where error occured.
214 * e contains the entry that was not unregistered
217 e1 = TAILQ_PREV(e, sysctl_ctx_list, link);
219 e1 = TAILQ_LAST(clist, sysctl_ctx_list);
221 sysctl_register_oid(e1->entry);
222 e1 = TAILQ_PREV(e1, sysctl_ctx_list, link);
226 /* Now really delete the entries */
227 e = TAILQ_FIRST(clist);
229 e1 = TAILQ_NEXT(e, link);
230 error = sysctl_remove_oid(e->entry, 1, 0);
232 panic("sysctl_remove_oid: corrupt tree, entry: %s",
234 free(e, M_SYSCTLOID);
240 /* Add an entry to the context */
241 struct sysctl_ctx_entry *
242 sysctl_ctx_entry_add(struct sysctl_ctx_list *clist, struct sysctl_oid *oidp)
244 struct sysctl_ctx_entry *e;
246 if (clist == NULL || oidp == NULL)
248 e = malloc(sizeof(struct sysctl_ctx_entry), M_SYSCTLOID, M_WAITOK);
250 TAILQ_INSERT_HEAD(clist, e, link);
254 /* Find an entry in the context */
255 struct sysctl_ctx_entry *
256 sysctl_ctx_entry_find(struct sysctl_ctx_list *clist, struct sysctl_oid *oidp)
258 struct sysctl_ctx_entry *e;
260 if (clist == NULL || oidp == NULL)
262 TAILQ_FOREACH(e, clist, link) {
270 * Delete an entry from the context.
271 * NOTE: this function doesn't free oidp! You have to remove it
272 * with sysctl_remove_oid().
275 sysctl_ctx_entry_del(struct sysctl_ctx_list *clist, struct sysctl_oid *oidp)
277 struct sysctl_ctx_entry *e;
279 if (clist == NULL || oidp == NULL)
281 e = sysctl_ctx_entry_find(clist, oidp);
283 TAILQ_REMOVE(clist, e, link);
284 free(e, M_SYSCTLOID);
291 * Remove dynamically created sysctl trees.
292 * oidp - top of the tree to be removed
293 * del - if 0 - just deregister, otherwise free up entries as well
294 * recurse - if != 0 traverse the subtree to be deleted
297 sysctl_remove_oid(struct sysctl_oid *oidp, int del, int recurse)
299 struct sysctl_oid *p;
304 if ((oidp->oid_kind & CTLFLAG_DYN) == 0) {
305 printf("can't remove non-dynamic nodes!\n");
309 * WARNING: normal method to do this should be through
310 * sysctl_ctx_free(). Use recursing as the last resort
311 * method to purge your sysctl tree of leftovers...
312 * However, if some other code still references these nodes,
315 if ((oidp->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
316 if (oidp->oid_refcnt == 1) {
317 SLIST_FOREACH(p, SYSCTL_CHILDREN(oidp), oid_link) {
320 error = sysctl_remove_oid(p, del, recurse);
325 free(SYSCTL_CHILDREN(oidp), M_SYSCTLOID);
328 if (oidp->oid_refcnt > 1 ) {
331 if (oidp->oid_refcnt == 0) {
332 printf("Warning: bad oid_refcnt=%u (%s)!\n",
333 oidp->oid_refcnt, oidp->oid_name);
336 sysctl_unregister_oid(oidp);
339 free((void *)(uintptr_t)(const void *)oidp->oid_descr, M_SYSCTLOID);
340 free((void *)(uintptr_t)(const void *)oidp->oid_name,
342 free(oidp, M_SYSCTLOID);
349 * Create new sysctls at run time.
350 * clist may point to a valid context initialized with sysctl_ctx_init().
353 sysctl_add_oid(struct sysctl_ctx_list *clist, struct sysctl_oid_list *parent,
354 int number, const char *name, int kind, void *arg1, int arg2,
355 int (*handler)(SYSCTL_HANDLER_ARGS), const char *fmt, const char *descr)
357 struct sysctl_oid *oidp;
361 /* You have to hook up somewhere.. */
364 /* Check if the node already exists, otherwise create it */
365 oidp = sysctl_find_oidname(name, parent);
367 if ((oidp->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
369 /* Update the context */
371 sysctl_ctx_entry_add(clist, oidp);
374 printf("can't re-use a leaf (%s)!\n", name);
378 oidp = malloc(sizeof(struct sysctl_oid), M_SYSCTLOID, M_WAITOK|M_ZERO);
379 oidp->oid_parent = parent;
380 SLIST_NEXT(oidp, oid_link) = NULL;
381 oidp->oid_number = number;
382 oidp->oid_refcnt = 1;
384 newname = malloc(len + 1, M_SYSCTLOID, M_WAITOK);
385 bcopy(name, newname, len + 1);
387 oidp->oid_name = newname;
388 oidp->oid_handler = handler;
389 oidp->oid_kind = CTLFLAG_DYN | kind;
390 if ((kind & CTLTYPE) == CTLTYPE_NODE) {
391 /* Allocate space for children */
392 SYSCTL_CHILDREN_SET(oidp, malloc(sizeof(struct sysctl_oid_list),
393 M_SYSCTLOID, M_WAITOK));
394 SLIST_INIT(SYSCTL_CHILDREN(oidp));
396 oidp->oid_arg1 = arg1;
397 oidp->oid_arg2 = arg2;
401 int len = strlen(descr) + 1;
402 oidp->oid_descr = malloc(len, M_SYSCTLOID, M_WAITOK);
404 strcpy((char *)(uintptr_t)(const void *)oidp->oid_descr, descr);
406 /* Update the context, if used */
408 sysctl_ctx_entry_add(clist, oidp);
409 /* Register this oid */
410 sysctl_register_oid(oidp);
415 * Reparent an existing oid.
418 sysctl_move_oid(struct sysctl_oid *oid, struct sysctl_oid_list *parent)
420 struct sysctl_oid *oidp;
422 if (oid->oid_parent == parent)
424 oidp = sysctl_find_oidname(oid->oid_name, parent);
427 sysctl_unregister_oid(oid);
428 oid->oid_parent = parent;
429 oid->oid_number = OID_AUTO;
430 sysctl_register_oid(oid);
435 * Register the kernel's oids on startup.
437 SET_DECLARE(sysctl_set, struct sysctl_oid);
440 sysctl_register_all(void *arg)
442 struct sysctl_oid **oidp;
445 SET_FOREACH(oidp, sysctl_set)
446 sysctl_register_oid(*oidp);
448 SYSINIT(sysctl, SI_SUB_KMEM, SI_ORDER_ANY, sysctl_register_all, 0);
453 * These functions implement a presently undocumented interface
454 * used by the sysctl program to walk the tree, and get the type
455 * so it can print the value.
456 * This interface is under work and consideration, and should probably
457 * be killed with a big axe by the first person who can find the time.
458 * (be aware though, that the proper interface isn't as obvious as it
459 * may seem, there are various conflicting requirements.
461 * {0,0} printf the entire MIB-tree.
462 * {0,1,...} return the name of the "..." OID.
463 * {0,2,...} return the next OID.
464 * {0,3} return the OID of the name in "new"
465 * {0,4,...} return the kind & format info for the "..." OID.
466 * {0,5,...} return the description the "..." OID.
471 sysctl_sysctl_debug_dump_node(struct sysctl_oid_list *l, int i)
474 struct sysctl_oid *oidp;
476 SLIST_FOREACH(oidp, l, oid_link) {
481 printf("%d %s ", oidp->oid_number, oidp->oid_name);
484 oidp->oid_kind & CTLFLAG_RD ? 'R':' ',
485 oidp->oid_kind & CTLFLAG_WR ? 'W':' ');
487 if (oidp->oid_handler)
490 switch (oidp->oid_kind & CTLTYPE) {
493 if (!oidp->oid_handler) {
494 sysctl_sysctl_debug_dump_node(
495 oidp->oid_arg1, i+2);
498 case CTLTYPE_INT: printf(" Int\n"); break;
499 case CTLTYPE_STRING: printf(" String\n"); break;
500 case CTLTYPE_QUAD: printf(" Quad\n"); break;
501 case CTLTYPE_OPAQUE: printf(" Opaque/struct\n"); break;
502 default: printf("\n");
509 sysctl_sysctl_debug(SYSCTL_HANDLER_ARGS)
513 error = suser(req->td);
516 sysctl_sysctl_debug_dump_node(&sysctl__children, 0);
520 SYSCTL_PROC(_sysctl, 0, debug, CTLTYPE_STRING|CTLFLAG_RD,
521 0, 0, sysctl_sysctl_debug, "-", "");
525 sysctl_sysctl_name(SYSCTL_HANDLER_ARGS)
527 int *name = (int *) arg1;
528 u_int namelen = arg2;
530 struct sysctl_oid *oid;
531 struct sysctl_oid_list *lsp = &sysctl__children, *lsp2;
536 snprintf(buf,sizeof(buf),"%d",*name);
538 error = SYSCTL_OUT(req, ".", 1);
540 error = SYSCTL_OUT(req, buf, strlen(buf));
548 SLIST_FOREACH(oid, lsp, oid_link) {
549 if (oid->oid_number != *name)
553 error = SYSCTL_OUT(req, ".", 1);
555 error = SYSCTL_OUT(req, oid->oid_name,
556 strlen(oid->oid_name));
563 if ((oid->oid_kind & CTLTYPE) != CTLTYPE_NODE)
566 if (oid->oid_handler)
569 lsp2 = (struct sysctl_oid_list *)oid->oid_arg1;
574 return (SYSCTL_OUT(req, "", 1));
577 static SYSCTL_NODE(_sysctl, 1, name, CTLFLAG_RD, sysctl_sysctl_name, "");
580 sysctl_sysctl_next_ls(struct sysctl_oid_list *lsp, int *name, u_int namelen,
581 int *next, int *len, int level, struct sysctl_oid **oidpp)
583 struct sysctl_oid *oidp;
586 SLIST_FOREACH(oidp, lsp, oid_link) {
587 *next = oidp->oid_number;
590 if (oidp->oid_kind & CTLFLAG_SKIP)
594 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE)
596 if (oidp->oid_handler)
597 /* We really should call the handler here...*/
599 lsp = (struct sysctl_oid_list *)oidp->oid_arg1;
600 if (!sysctl_sysctl_next_ls(lsp, 0, 0, next+1,
601 len, level+1, oidpp))
606 if (oidp->oid_number < *name)
609 if (oidp->oid_number > *name) {
610 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE)
612 if (oidp->oid_handler)
614 lsp = (struct sysctl_oid_list *)oidp->oid_arg1;
615 if (!sysctl_sysctl_next_ls(lsp, name+1, namelen-1,
616 next+1, len, level+1, oidpp))
620 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE)
623 if (oidp->oid_handler)
626 lsp = (struct sysctl_oid_list *)oidp->oid_arg1;
627 if (!sysctl_sysctl_next_ls(lsp, name+1, namelen-1, next+1,
628 len, level+1, oidpp))
639 sysctl_sysctl_next(SYSCTL_HANDLER_ARGS)
641 int *name = (int *) arg1;
642 u_int namelen = arg2;
644 struct sysctl_oid *oid;
645 struct sysctl_oid_list *lsp = &sysctl__children;
646 int newoid[CTL_MAXNAME];
648 i = sysctl_sysctl_next_ls(lsp, name, namelen, newoid, &j, 1, &oid);
651 error = SYSCTL_OUT(req, newoid, j * sizeof (int));
655 static SYSCTL_NODE(_sysctl, 2, next, CTLFLAG_RD, sysctl_sysctl_next, "");
658 name2oid (char *name, int *oid, int *len, struct sysctl_oid **oidpp)
661 struct sysctl_oid *oidp;
662 struct sysctl_oid_list *lsp = &sysctl__children;
668 p = name + strlen(name) - 1 ;
674 for (p = name; *p && *p != '.'; p++)
680 oidp = SLIST_FIRST(lsp);
682 while (oidp && *len < CTL_MAXNAME) {
683 if (strcmp(name, oidp->oid_name)) {
684 oidp = SLIST_NEXT(oidp, oid_link);
687 *oid++ = oidp->oid_number;
696 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE)
699 if (oidp->oid_handler)
702 lsp = (struct sysctl_oid_list *)oidp->oid_arg1;
703 oidp = SLIST_FIRST(lsp);
705 for (p = name; *p && *p != '.'; p++)
715 sysctl_sysctl_name2oid(SYSCTL_HANDLER_ARGS)
718 int error, oid[CTL_MAXNAME], len;
719 struct sysctl_oid *op = 0;
723 if (req->newlen >= MAXPATHLEN) /* XXX arbitrary, undocumented */
724 return (ENAMETOOLONG);
726 p = malloc(req->newlen+1, M_SYSCTL, M_WAITOK);
728 error = SYSCTL_IN(req, p, req->newlen);
734 p [req->newlen] = '\0';
736 error = name2oid(p, oid, &len, &op);
743 error = SYSCTL_OUT(req, oid, len * sizeof *oid);
747 SYSCTL_PROC(_sysctl, 3, name2oid, CTLFLAG_RW|CTLFLAG_ANYBODY, 0, 0,
748 sysctl_sysctl_name2oid, "I", "");
751 sysctl_sysctl_oidfmt(SYSCTL_HANDLER_ARGS)
753 struct sysctl_oid *oid;
756 error = sysctl_find_oid(arg1, arg2, &oid, NULL, req);
762 error = SYSCTL_OUT(req, &oid->oid_kind, sizeof(oid->oid_kind));
765 error = SYSCTL_OUT(req, oid->oid_fmt, strlen(oid->oid_fmt) + 1);
770 static SYSCTL_NODE(_sysctl, 4, oidfmt, CTLFLAG_RD, sysctl_sysctl_oidfmt, "");
773 sysctl_sysctl_oiddescr(SYSCTL_HANDLER_ARGS)
775 struct sysctl_oid *oid;
778 error = sysctl_find_oid(arg1, arg2, &oid, NULL, req);
784 error = SYSCTL_OUT(req, oid->oid_descr, strlen(oid->oid_descr) + 1);
788 static SYSCTL_NODE(_sysctl, 5, oiddescr, CTLFLAG_RD, sysctl_sysctl_oiddescr, "");
791 * Default "handler" functions.
795 * Handle an int, signed or unsigned.
797 * a variable: point arg1 at it.
798 * a constant: pass it in arg2.
802 sysctl_handle_int(SYSCTL_HANDLER_ARGS)
804 int tmpout, error = 0;
807 * Attempt to get a coherent snapshot by making a copy of the data.
810 tmpout = *(int *)arg1;
813 error = SYSCTL_OUT(req, &tmpout, sizeof(int));
815 if (error || !req->newptr)
821 error = SYSCTL_IN(req, arg1, sizeof(int));
827 * Based on on sysctl_handle_int() convert milliseconds into ticks.
831 sysctl_msec_to_ticks(SYSCTL_HANDLER_ARGS)
835 tt = *(int *)oidp->oid_arg1;
836 s = (int)((int64_t)tt * 1000 / hz);
838 error = sysctl_handle_int(oidp, &s, 0, req);
839 if (error || !req->newptr)
842 tt = (int)((int64_t)s * hz / 1000);
846 *(int *)oidp->oid_arg1 = tt;
852 * Handle a long, signed or unsigned. arg1 points to it.
856 sysctl_handle_long(SYSCTL_HANDLER_ARGS)
865 * Attempt to get a coherent snapshot by making a copy of the data.
869 tmplong = *(long *)arg1;
871 if (req->flags & SCTL_MASK32) {
873 error = SYSCTL_OUT(req, &tmpint, sizeof(int));
876 error = SYSCTL_OUT(req, &tmplong, sizeof(long));
878 if (error || !req->newptr)
882 if (req->flags & SCTL_MASK32) {
883 error = SYSCTL_IN(req, &tmpint, sizeof(int));
884 *(long *)arg1 = (long)tmpint;
887 error = SYSCTL_IN(req, arg1, sizeof(long));
892 * Handle our generic '\0' terminated 'C' string.
894 * a variable string: point arg1 at it, arg2 is max length.
895 * a constant string: point arg1 at it, arg2 is zero.
899 sysctl_handle_string(SYSCTL_HANDLER_ARGS)
906 * Attempt to get a coherent snapshot by copying to a
907 * temporary kernel buffer.
910 outlen = strlen((char *)arg1)+1;
911 tmparg = malloc(outlen, M_SYSCTLTMP, M_WAITOK);
913 if (strlcpy(tmparg, (char *)arg1, outlen) >= outlen) {
914 free(tmparg, M_SYSCTLTMP);
918 error = SYSCTL_OUT(req, tmparg, outlen);
919 free(tmparg, M_SYSCTLTMP);
921 if (error || !req->newptr)
924 if ((req->newlen - req->newidx) >= arg2) {
927 arg2 = (req->newlen - req->newidx);
928 error = SYSCTL_IN(req, arg1, arg2);
929 ((char *)arg1)[arg2] = '\0';
936 * Handle any kind of opaque data.
937 * arg1 points to it, arg2 is the size.
941 sysctl_handle_opaque(SYSCTL_HANDLER_ARGS)
945 struct sysctl_req req2;
948 * Attempt to get a coherent snapshot, by using the thread
949 * pre-emption counter updated from within mi_switch() to
950 * determine if we were pre-empted during a bcopy() or
951 * copyout(). Make 3 attempts at doing this before giving up.
952 * If we encounter an error, stop immediately.
957 generation = curthread->td_generation;
958 error = SYSCTL_OUT(req, arg1, arg2);
962 if (generation != curthread->td_generation && tries < 3) {
967 error = SYSCTL_IN(req, arg1, arg2);
973 * Transfer functions to/from kernel space.
974 * XXX: rather untested at this point
977 sysctl_old_kernel(struct sysctl_req *req, const void *p, size_t l)
983 if (req->oldlen <= req->oldidx)
986 if (i > req->oldlen - req->oldidx)
987 i = req->oldlen - req->oldidx;
989 bcopy(p, (char *)req->oldptr + req->oldidx, i);
992 if (req->oldptr && i != l)
998 sysctl_new_kernel(struct sysctl_req *req, void *p, size_t l)
1002 if (req->newlen - req->newidx < l)
1004 bcopy((char *)req->newptr + req->newidx, p, l);
1010 kernel_sysctl(struct thread *td, int *name, u_int namelen, void *old,
1011 size_t *oldlenp, void *new, size_t newlen, size_t *retval, int flags)
1014 struct sysctl_req req;
1016 bzero(&req, sizeof req);
1022 req.oldlen = *oldlenp;
1024 req.validlen = req.oldlen;
1031 req.newlen = newlen;
1035 req.oldfunc = sysctl_old_kernel;
1036 req.newfunc = sysctl_new_kernel;
1037 req.lock = REQ_LOCKED;
1041 error = sysctl_root(0, name, namelen, &req);
1043 if (req.lock == REQ_WIRED && req.validlen > 0)
1044 vsunlock(req.oldptr, req.validlen);
1048 if (error && error != ENOMEM)
1052 if (req.oldptr && req.oldidx > req.validlen)
1053 *retval = req.validlen;
1055 *retval = req.oldidx;
1061 kernel_sysctlbyname(struct thread *td, char *name, void *old, size_t *oldlenp,
1062 void *new, size_t newlen, size_t *retval, int flags)
1064 int oid[CTL_MAXNAME];
1065 size_t oidlen, plen;
1068 oid[0] = 0; /* sysctl internal magic */
1069 oid[1] = 3; /* name2oid */
1070 oidlen = sizeof(oid);
1072 error = kernel_sysctl(td, oid, 2, oid, &oidlen,
1073 (void *)name, strlen(name), &plen, flags);
1077 error = kernel_sysctl(td, oid, plen / sizeof(int), old, oldlenp,
1078 new, newlen, retval, flags);
1083 * Transfer function to/from user space.
1086 sysctl_old_user(struct sysctl_req *req, const void *p, size_t l)
1089 size_t i, len, origidx;
1091 origidx = req->oldidx;
1093 if (req->oldptr == NULL)
1096 * If we have not wired the user supplied buffer and we are currently
1097 * holding locks, drop a witness warning, as it's possible that
1098 * write operations to the user page can sleep.
1100 if (req->lock != REQ_WIRED)
1101 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL,
1102 "sysctl_old_user()");
1104 len = req->validlen;
1108 if (i > len - origidx)
1110 error = copyout(p, (char *)req->oldptr + origidx, i);
1120 sysctl_new_user(struct sysctl_req *req, void *p, size_t l)
1126 if (req->newlen - req->newidx < l)
1128 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL,
1129 "sysctl_new_user()");
1130 error = copyin((char *)req->newptr + req->newidx, p, l);
1136 * Wire the user space destination buffer. If set to a value greater than
1137 * zero, the len parameter limits the maximum amount of wired memory.
1139 * XXX - The len parameter is currently ignored due to the lack of
1140 * a place to save it in the sysctl_req structure so that the matching
1141 * amount of memory can be unwired in the sysctl exit code.
1144 sysctl_wire_old_buffer(struct sysctl_req *req, size_t len)
1150 wiredlen = (len > 0 && len < req->oldlen) ? len : req->oldlen;
1152 if (req->lock == REQ_LOCKED && req->oldptr &&
1153 req->oldfunc == sysctl_old_user) {
1154 if (wiredlen != 0) {
1155 ret = vslock(req->oldptr, wiredlen);
1162 * Touch all the wired pages to avoid PTE modified
1163 * bit emulation traps on Alpha while holding locks
1164 * in the sysctl handler.
1166 for (i = (wiredlen + PAGE_SIZE - 1) / PAGE_SIZE,
1167 cp = req->oldptr; i > 0; i--, cp += PAGE_SIZE) {
1168 copyin(cp, &dummy, 1);
1169 copyout(&dummy, cp, 1);
1172 req->lock = REQ_WIRED;
1173 req->validlen = wiredlen;
1179 sysctl_find_oid(int *name, u_int namelen, struct sysctl_oid **noid,
1180 int *nindx, struct sysctl_req *req)
1182 struct sysctl_oid *oid;
1185 oid = SLIST_FIRST(&sysctl__children);
1187 while (oid && indx < CTL_MAXNAME) {
1188 if (oid->oid_number == name[indx]) {
1190 if (oid->oid_kind & CTLFLAG_NOLOCK)
1191 req->lock = REQ_UNLOCKED;
1192 if ((oid->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
1193 if (oid->oid_handler != NULL ||
1201 (struct sysctl_oid_list *)oid->oid_arg1);
1202 } else if (indx == namelen) {
1211 oid = SLIST_NEXT(oid, oid_link);
1218 * Traverse our tree, and find the right node, execute whatever it points
1219 * to, and return the resulting error code.
1223 sysctl_root(SYSCTL_HANDLER_ARGS)
1225 struct sysctl_oid *oid;
1226 int error, indx, lvl;
1228 error = sysctl_find_oid(arg1, arg2, &oid, &indx, req);
1232 if ((oid->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
1234 * You can't call a sysctl when it's a node, but has
1235 * no handler. Inform the user that it's a node.
1236 * The indx may or may not be the same as namelen.
1238 if (oid->oid_handler == NULL)
1242 /* Is this sysctl writable? */
1243 if (req->newptr && !(oid->oid_kind & CTLFLAG_WR))
1246 KASSERT(req->td != NULL, ("sysctl_root(): req->td == NULL"));
1248 /* Is this sysctl sensitive to securelevels? */
1249 if (req->newptr && (oid->oid_kind & CTLFLAG_SECURE)) {
1250 lvl = (oid->oid_kind & CTLMASK_SECURE) >> CTLSHIFT_SECURE;
1251 error = securelevel_gt(req->td->td_ucred, lvl);
1256 /* Is this sysctl writable by only privileged users? */
1257 if (req->newptr && !(oid->oid_kind & CTLFLAG_ANYBODY)) {
1260 if (oid->oid_kind & CTLFLAG_PRISON)
1261 flags = SUSER_ALLOWJAIL;
1264 error = suser_cred(req->td->td_ucred, flags);
1269 if (!oid->oid_handler)
1272 if ((oid->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
1273 arg1 = (int *)arg1 + indx;
1276 arg1 = oid->oid_arg1;
1277 arg2 = oid->oid_arg2;
1280 error = mac_check_system_sysctl(req->td->td_ucred, oid, arg1, arg2,
1285 error = oid->oid_handler(oid, arg1, arg2, req);
1290 #ifndef _SYS_SYSPROTO_H_
1291 struct sysctl_args {
1305 __sysctl(struct thread *td, struct sysctl_args *uap)
1307 int error, name[CTL_MAXNAME];
1310 if (uap->namelen > CTL_MAXNAME || uap->namelen < 2)
1313 error = copyin(uap->name, &name, uap->namelen * sizeof(int));
1319 error = userland_sysctl(td, name, uap->namelen,
1320 uap->old, uap->oldlenp, 0,
1321 uap->new, uap->newlen, &j, 0);
1322 if (error && error != ENOMEM)
1325 int i = copyout(&j, uap->oldlenp, sizeof(j));
1335 * This is used from various compatibility syscalls too. That's why name
1336 * must be in kernel space.
1339 userland_sysctl(struct thread *td, int *name, u_int namelen, void *old,
1340 size_t *oldlenp, int inkernel, void *new, size_t newlen, size_t *retval,
1344 struct sysctl_req req;
1346 bzero(&req, sizeof req);
1353 req.oldlen = *oldlenp;
1355 error = copyin(oldlenp, &req.oldlen, sizeof(*oldlenp));
1360 req.validlen = req.oldlen;
1363 if (!useracc(old, req.oldlen, VM_PROT_WRITE))
1369 if (!useracc(new, req.newlen, VM_PROT_READ))
1371 req.newlen = newlen;
1375 req.oldfunc = sysctl_old_user;
1376 req.newfunc = sysctl_new_user;
1377 req.lock = REQ_LOCKED;
1384 error = sysctl_root(0, name, namelen, &req);
1385 } while (error == EAGAIN);
1387 if (req.lock == REQ_WIRED && req.validlen > 0)
1388 vsunlock(req.oldptr, req.validlen);
1392 if (error && error != ENOMEM)
1396 if (req.oldptr && req.oldidx > req.validlen)
1397 *retval = req.validlen;
1399 *retval = req.oldidx;
1405 #include <sys/socket.h>
1406 #include <vm/vm_param.h>
1408 #define KINFO_PROC (0<<8)
1409 #define KINFO_RT (1<<8)
1410 #define KINFO_VNODE (2<<8)
1411 #define KINFO_FILE (3<<8)
1412 #define KINFO_METER (4<<8)
1413 #define KINFO_LOADAVG (5<<8)
1414 #define KINFO_CLOCKRATE (6<<8)
1416 /* Non-standard BSDI extension - only present on their 4.3 net-2 releases */
1417 #define KINFO_BSDI_SYSINFO (101<<8)
1420 * XXX this is bloat, but I hope it's better here than on the potentially
1421 * limited kernel stack... -Peter
1425 int bsdi_machine; /* "i386" on BSD/386 */
1426 /* ^^^ this is an offset to the string, relative to the struct start */
1435 int bsdi_ostype; /* "BSD/386" on BSD/386 */
1436 int bsdi_osrelease; /* "1.1" on BSD/386 */
1448 struct timeval pad16;
1449 /* we dont set this, because BSDI's uname used gethostname() instead */
1450 int bsdi_hostname; /* hostname on BSD/386 */
1452 /* the actual string data is appended here */
1456 * this data is appended to the end of the bsdi_si structure during copyout.
1457 * The "char *" offsets are relative to the base of the bsdi_si struct.
1458 * This contains "FreeBSD\02.0-BUILT-nnnnnn\0i386\0", and these strings
1459 * should not exceed the length of the buffer here... (or else!! :-)
1461 static char bsdi_strings[80]; /* It had better be less than this! */
1463 #ifndef _SYS_SYSPROTO_H_
1464 struct getkerninfo_args {
1476 ogetkerninfo(struct thread *td, struct getkerninfo_args *uap)
1484 switch (uap->op & 0xff00) {
1490 name[3] = (uap->op & 0xff0000) >> 16;
1491 name[4] = uap->op & 0xff;
1493 error = userland_sysctl(td, name, 6, uap->where, uap->size,
1499 name[1] = KERN_VNODE;
1500 error = userland_sysctl(td, name, 2, uap->where, uap->size,
1506 name[1] = KERN_PROC;
1507 name[2] = uap->op & 0xff;
1509 error = userland_sysctl(td, name, 4, uap->where, uap->size,
1515 name[1] = KERN_FILE;
1516 error = userland_sysctl(td, name, 2, uap->where, uap->size,
1523 error = userland_sysctl(td, name, 2, uap->where, uap->size,
1529 name[1] = VM_LOADAVG;
1530 error = userland_sysctl(td, name, 2, uap->where, uap->size,
1534 case KINFO_CLOCKRATE:
1536 name[1] = KERN_CLOCKRATE;
1537 error = userland_sysctl(td, name, 2, uap->where, uap->size,
1541 case KINFO_BSDI_SYSINFO: {
1543 * this is pretty crude, but it's just enough for uname()
1544 * from BSDI's 1.x libc to work.
1546 * *size gives the size of the buffer before the call, and
1547 * the amount of data copied after a successful call.
1548 * If successful, the return value is the amount of data
1549 * available, which can be larger than *size.
1551 * BSDI's 2.x product apparently fails with ENOMEM if *size
1558 bzero((char *)&bsdi_si, sizeof(bsdi_si));
1559 bzero(bsdi_strings, sizeof(bsdi_strings));
1563 bsdi_si.bsdi_ostype = (s - bsdi_strings) + sizeof(bsdi_si);
1567 bsdi_si.bsdi_osrelease = (s - bsdi_strings) + sizeof(bsdi_si);
1568 strcpy(s, osrelease);
1571 bsdi_si.bsdi_machine = (s - bsdi_strings) + sizeof(bsdi_si);
1575 needed = sizeof(bsdi_si) + (s - bsdi_strings);
1577 if ((uap->where == NULL) || (uap->size == NULL)) {
1578 /* process is asking how much buffer to supply.. */
1584 if ((error = copyin(uap->size, &size, sizeof(size))) != 0)
1587 /* if too much buffer supplied, trim it down */
1591 /* how much of the buffer is remaining */
1594 if ((error = copyout((char *)&bsdi_si, uap->where, left)) != 0)
1597 /* is there any point in continuing? */
1598 if (left > sizeof(bsdi_si)) {
1599 left -= sizeof(bsdi_si);
1600 error = copyout(&bsdi_strings,
1601 uap->where + sizeof(bsdi_si), left);
1611 td->td_retval[0] = needed ? needed : size;
1613 error = copyout(&size, uap->size, sizeof(size));
1619 #endif /* COMPAT_43 */