1 /*-
2 * Copyright (c) 1982, 1986, 1989, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Mike Karels at Berkeley Software Design, Inc.
7 *
8 * Quite extensively rewritten by Poul-Henning Kamp of the FreeBSD
9 * project, to make these variables more userfriendly.
10 *
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
13 * are met:
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.
22 *
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
33 * SUCH DAMAGE.
34 *
35 * @(#)kern_sysctl.c 8.4 (Berkeley) 4/14/94
36 */
37
38 #include <sys/cdefs.h>
39 __FBSDID("$FreeBSD: releng/6.3/sys/kern/kern_sysctl.c 173886 2007-11-24 19:45:58Z cvs2svn $");
40
41 #include "opt_compat.h"
42 #include "opt_mac.h"
43
44 #include <sys/param.h>
45 #include <sys/systm.h>
46 #include <sys/kernel.h>
47 #include <sys/sysctl.h>
48 #include <sys/mac.h>
49 #include <sys/malloc.h>
50 #include <sys/proc.h>
51 #include <sys/lock.h>
52 #include <sys/mutex.h>
53 #include <sys/sx.h>
54 #include <sys/sysproto.h>
55 #include <vm/vm.h>
56 #include <vm/vm_extern.h>
57
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");
61
62 /*
63 * Locking - this locks the sysctl tree in memory.
64 */
65 static struct sx sysctllock;
66
67 #define SYSCTL_LOCK() sx_xlock(&sysctllock)
68 #define SYSCTL_UNLOCK() sx_xunlock(&sysctllock)
69 #define SYSCTL_INIT() sx_init(&sysctllock, "sysctl lock")
70
71 static int sysctl_root(SYSCTL_HANDLER_ARGS);
72
73 struct sysctl_oid_list sysctl__children; /* root list */
74
75 static struct sysctl_oid *
76 sysctl_find_oidname(const char *name, struct sysctl_oid_list *list)
77 {
78 struct sysctl_oid *oidp;
79
80 SLIST_FOREACH(oidp, list, oid_link) {
81 if (strcmp(oidp->oid_name, name) == 0) {
82 return (oidp);
83 }
84 }
85 return (NULL);
86 }
87
88 /*
89 * Initialization of the MIB tree.
90 *
91 * Order by number in each list.
92 */
93
94 void
95 sysctl_register_oid(struct sysctl_oid *oidp)
96 {
97 struct sysctl_oid_list *parent = oidp->oid_parent;
98 struct sysctl_oid *p;
99 struct sysctl_oid *q;
100
101 /*
102 * First check if another oid with the same name already
103 * exists in the parent's list.
104 */
105 p = sysctl_find_oidname(oidp->oid_name, parent);
106 if (p != NULL) {
107 if ((p->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
108 p->oid_refcnt++;
109 return;
110 } else {
111 printf("can't re-use a leaf (%s)!\n", p->oid_name);
112 return;
113 }
114 }
115 /*
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.
121 */
122 if (oidp->oid_number == OID_AUTO) {
123 static int newoid = CTL_AUTO_START;
124
125 oidp->oid_number = newoid++;
126 if (newoid == 0x7fffffff)
127 panic("out of oids");
128 }
129 #if 0
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);
133 }
134 #endif
135
136 /*
137 * Insert the oid into the parent's list in order.
138 */
139 q = NULL;
140 SLIST_FOREACH(p, parent, oid_link) {
141 if (oidp->oid_number < p->oid_number)
142 break;
143 q = p;
144 }
145 if (q)
146 SLIST_INSERT_AFTER(q, oidp, oid_link);
147 else
148 SLIST_INSERT_HEAD(parent, oidp, oid_link);
149 }
150
151 void
152 sysctl_unregister_oid(struct sysctl_oid *oidp)
153 {
154 struct sysctl_oid *p;
155 int error;
156
157 error = ENOENT;
158 if (oidp->oid_number == OID_AUTO) {
159 error = EINVAL;
160 } else {
161 SLIST_FOREACH(p, oidp->oid_parent, oid_link) {
162 if (p == oidp) {
163 SLIST_REMOVE(oidp->oid_parent, oidp,
164 sysctl_oid, oid_link);
165 error = 0;
166 break;
167 }
168 }
169 }
170
171 /*
172 * This can happen when a module fails to register and is
173 * being unloaded afterwards. It should not be a panic()
174 * for normal use.
175 */
176 if (error)
177 printf("%s: failed to unregister sysctl\n", __func__);
178 }
179
180 /* Initialize a new context to keep track of dynamically added sysctls. */
181 int
182 sysctl_ctx_init(struct sysctl_ctx_list *c)
183 {
184
185 if (c == NULL) {
186 return (EINVAL);
187 }
188 TAILQ_INIT(c);
189 return (0);
190 }
191
192 /* Free the context, and destroy all dynamic oids registered in this context */
193 int
194 sysctl_ctx_free(struct sysctl_ctx_list *clist)
195 {
196 struct sysctl_ctx_entry *e, *e1;
197 int error;
198
199 error = 0;
200 /*
201 * First perform a "dry run" to check if it's ok to remove oids.
202 * XXX FIXME
203 * XXX This algorithm is a hack. But I don't know any
204 * XXX better solution for now...
205 */
206 TAILQ_FOREACH(e, clist, link) {
207 error = sysctl_remove_oid(e->entry, 0, 0);
208 if (error)
209 break;
210 }
211 /*
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
215 */
216 if (error)
217 e1 = TAILQ_PREV(e, sysctl_ctx_list, link);
218 else
219 e1 = TAILQ_LAST(clist, sysctl_ctx_list);
220 while (e1 != NULL) {
221 sysctl_register_oid(e1->entry);
222 e1 = TAILQ_PREV(e1, sysctl_ctx_list, link);
223 }
224 if (error)
225 return(EBUSY);
226 /* Now really delete the entries */
227 e = TAILQ_FIRST(clist);
228 while (e != NULL) {
229 e1 = TAILQ_NEXT(e, link);
230 error = sysctl_remove_oid(e->entry, 1, 0);
231 if (error)
232 panic("sysctl_remove_oid: corrupt tree, entry: %s",
233 e->entry->oid_name);
234 free(e, M_SYSCTLOID);
235 e = e1;
236 }
237 return (error);
238 }
239
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)
243 {
244 struct sysctl_ctx_entry *e;
245
246 if (clist == NULL || oidp == NULL)
247 return(NULL);
248 e = malloc(sizeof(struct sysctl_ctx_entry), M_SYSCTLOID, M_WAITOK);
249 e->entry = oidp;
250 TAILQ_INSERT_HEAD(clist, e, link);
251 return (e);
252 }
253
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)
257 {
258 struct sysctl_ctx_entry *e;
259
260 if (clist == NULL || oidp == NULL)
261 return(NULL);
262 TAILQ_FOREACH(e, clist, link) {
263 if(e->entry == oidp)
264 return(e);
265 }
266 return (e);
267 }
268
269 /*
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().
273 */
274 int
275 sysctl_ctx_entry_del(struct sysctl_ctx_list *clist, struct sysctl_oid *oidp)
276 {
277 struct sysctl_ctx_entry *e;
278
279 if (clist == NULL || oidp == NULL)
280 return (EINVAL);
281 e = sysctl_ctx_entry_find(clist, oidp);
282 if (e != NULL) {
283 TAILQ_REMOVE(clist, e, link);
284 free(e, M_SYSCTLOID);
285 return (0);
286 } else
287 return (ENOENT);
288 }
289
290 /*
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
295 */
296 int
297 sysctl_remove_oid(struct sysctl_oid *oidp, int del, int recurse)
298 {
299 struct sysctl_oid *p;
300 int error;
301
302 if (oidp == NULL)
303 return(EINVAL);
304 if ((oidp->oid_kind & CTLFLAG_DYN) == 0) {
305 printf("can't remove non-dynamic nodes!\n");
306 return (EINVAL);
307 }
308 /*
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,
313 * it will panic.
314 */
315 if ((oidp->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
316 if (oidp->oid_refcnt == 1) {
317 SLIST_FOREACH(p, SYSCTL_CHILDREN(oidp), oid_link) {
318 if (!recurse)
319 return (ENOTEMPTY);
320 error = sysctl_remove_oid(p, del, recurse);
321 if (error)
322 return (error);
323 }
324 if (del)
325 free(SYSCTL_CHILDREN(oidp), M_SYSCTLOID);
326 }
327 }
328 if (oidp->oid_refcnt > 1 ) {
329 oidp->oid_refcnt--;
330 } else {
331 if (oidp->oid_refcnt == 0) {
332 printf("Warning: bad oid_refcnt=%u (%s)!\n",
333 oidp->oid_refcnt, oidp->oid_name);
334 return (EINVAL);
335 }
336 sysctl_unregister_oid(oidp);
337 if (del) {
338 if (oidp->oid_descr)
339 free((void *)(uintptr_t)(const void *)oidp->oid_descr, M_SYSCTLOID);
340 free((void *)(uintptr_t)(const void *)oidp->oid_name,
341 M_SYSCTLOID);
342 free(oidp, M_SYSCTLOID);
343 }
344 }
345 return (0);
346 }
347
348 /*
349 * Create new sysctls at run time.
350 * clist may point to a valid context initialized with sysctl_ctx_init().
351 */
352 struct sysctl_oid *
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)
356 {
357 struct sysctl_oid *oidp;
358 ssize_t len;
359 char *newname;
360
361 /* You have to hook up somewhere.. */
362 if (parent == NULL)
363 return(NULL);
364 /* Check if the node already exists, otherwise create it */
365 oidp = sysctl_find_oidname(name, parent);
366 if (oidp != NULL) {
367 if ((oidp->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
368 oidp->oid_refcnt++;
369 /* Update the context */
370 if (clist != NULL)
371 sysctl_ctx_entry_add(clist, oidp);
372 return (oidp);
373 } else {
374 printf("can't re-use a leaf (%s)!\n", name);
375 return (NULL);
376 }
377 }
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;
383 len = strlen(name);
384 newname = malloc(len + 1, M_SYSCTLOID, M_WAITOK);
385 bcopy(name, newname, len + 1);
386 newname[len] = '\0';
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));
395 } else {
396 oidp->oid_arg1 = arg1;
397 oidp->oid_arg2 = arg2;
398 }
399 oidp->oid_fmt = fmt;
400 if (descr) {
401 int len = strlen(descr) + 1;
402 oidp->oid_descr = malloc(len, M_SYSCTLOID, M_WAITOK);
403 if (oidp->oid_descr)
404 strcpy((char *)(uintptr_t)(const void *)oidp->oid_descr, descr);
405 }
406 /* Update the context, if used */
407 if (clist != NULL)
408 sysctl_ctx_entry_add(clist, oidp);
409 /* Register this oid */
410 sysctl_register_oid(oidp);
411 return (oidp);
412 }
413
414 /*
415 * Reparent an existing oid.
416 */
417 int
418 sysctl_move_oid(struct sysctl_oid *oid, struct sysctl_oid_list *parent)
419 {
420 struct sysctl_oid *oidp;
421
422 if (oid->oid_parent == parent)
423 return (0);
424 oidp = sysctl_find_oidname(oid->oid_name, parent);
425 if (oidp != NULL)
426 return (EEXIST);
427 sysctl_unregister_oid(oid);
428 oid->oid_parent = parent;
429 oid->oid_number = OID_AUTO;
430 sysctl_register_oid(oid);
431 return (0);
432 }
433
434 /*
435 * Register the kernel's oids on startup.
436 */
437 SET_DECLARE(sysctl_set, struct sysctl_oid);
438
439 static void
440 sysctl_register_all(void *arg)
441 {
442 struct sysctl_oid **oidp;
443
444 SYSCTL_INIT();
445 SET_FOREACH(oidp, sysctl_set)
446 sysctl_register_oid(*oidp);
447 }
448 SYSINIT(sysctl, SI_SUB_KMEM, SI_ORDER_ANY, sysctl_register_all, 0);
449
450 /*
451 * "Staff-functions"
452 *
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.
460 *
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.
467 */
468
469 #ifdef SYSCTL_DEBUG
470 static void
471 sysctl_sysctl_debug_dump_node(struct sysctl_oid_list *l, int i)
472 {
473 int k;
474 struct sysctl_oid *oidp;
475
476 SLIST_FOREACH(oidp, l, oid_link) {
477
478 for (k=0; k<i; k++)
479 printf(" ");
480
481 printf("%d %s ", oidp->oid_number, oidp->oid_name);
482
483 printf("%c%c",
484 oidp->oid_kind & CTLFLAG_RD ? 'R':' ',
485 oidp->oid_kind & CTLFLAG_WR ? 'W':' ');
486
487 if (oidp->oid_handler)
488 printf(" *Handler");
489
490 switch (oidp->oid_kind & CTLTYPE) {
491 case CTLTYPE_NODE:
492 printf(" Node\n");
493 if (!oidp->oid_handler) {
494 sysctl_sysctl_debug_dump_node(
495 oidp->oid_arg1, i+2);
496 }
497 break;
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");
503 }
504
505 }
506 }
507
508 static int
509 sysctl_sysctl_debug(SYSCTL_HANDLER_ARGS)
510 {
511 int error;
512
513 error = suser(req->td);
514 if (error)
515 return (error);
516 sysctl_sysctl_debug_dump_node(&sysctl__children, 0);
517 return (ENOENT);
518 }
519
520 SYSCTL_PROC(_sysctl, 0, debug, CTLTYPE_STRING|CTLFLAG_RD,
521 0, 0, sysctl_sysctl_debug, "-", "");
522 #endif
523
524 static int
525 sysctl_sysctl_name(SYSCTL_HANDLER_ARGS)
526 {
527 int *name = (int *) arg1;
528 u_int namelen = arg2;
529 int error = 0;
530 struct sysctl_oid *oid;
531 struct sysctl_oid_list *lsp = &sysctl__children, *lsp2;
532 char buf[10];
533
534 while (namelen) {
535 if (!lsp) {
536 snprintf(buf,sizeof(buf),"%d",*name);
537 if (req->oldidx)
538 error = SYSCTL_OUT(req, ".", 1);
539 if (!error)
540 error = SYSCTL_OUT(req, buf, strlen(buf));
541 if (error)
542 return (error);
543 namelen--;
544 name++;
545 continue;
546 }
547 lsp2 = 0;
548 SLIST_FOREACH(oid, lsp, oid_link) {
549 if (oid->oid_number != *name)
550 continue;
551
552 if (req->oldidx)
553 error = SYSCTL_OUT(req, ".", 1);
554 if (!error)
555 error = SYSCTL_OUT(req, oid->oid_name,
556 strlen(oid->oid_name));
557 if (error)
558 return (error);
559
560 namelen--;
561 name++;
562
563 if ((oid->oid_kind & CTLTYPE) != CTLTYPE_NODE)
564 break;
565
566 if (oid->oid_handler)
567 break;
568
569 lsp2 = (struct sysctl_oid_list *)oid->oid_arg1;
570 break;
571 }
572 lsp = lsp2;
573 }
574 return (SYSCTL_OUT(req, "", 1));
575 }
576
577 static SYSCTL_NODE(_sysctl, 1, name, CTLFLAG_RD, sysctl_sysctl_name, "");
578
579 static int
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)
582 {
583 struct sysctl_oid *oidp;
584
585 *len = level;
586 SLIST_FOREACH(oidp, lsp, oid_link) {
587 *next = oidp->oid_number;
588 *oidpp = oidp;
589
590 if (oidp->oid_kind & CTLFLAG_SKIP)
591 continue;
592
593 if (!namelen) {
594 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE)
595 return (0);
596 if (oidp->oid_handler)
597 /* We really should call the handler here...*/
598 return (0);
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))
602 return (0);
603 goto emptynode;
604 }
605
606 if (oidp->oid_number < *name)
607 continue;
608
609 if (oidp->oid_number > *name) {
610 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE)
611 return (0);
612 if (oidp->oid_handler)
613 return (0);
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))
617 return (0);
618 goto next;
619 }
620 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE)
621 continue;
622
623 if (oidp->oid_handler)
624 continue;
625
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))
629 return (0);
630 next:
631 namelen = 1;
632 emptynode:
633 *len = level;
634 }
635 return (1);
636 }
637
638 static int
639 sysctl_sysctl_next(SYSCTL_HANDLER_ARGS)
640 {
641 int *name = (int *) arg1;
642 u_int namelen = arg2;
643 int i, j, error;
644 struct sysctl_oid *oid;
645 struct sysctl_oid_list *lsp = &sysctl__children;
646 int newoid[CTL_MAXNAME];
647
648 i = sysctl_sysctl_next_ls(lsp, name, namelen, newoid, &j, 1, &oid);
649 if (i)
650 return (ENOENT);
651 error = SYSCTL_OUT(req, newoid, j * sizeof (int));
652 return (error);
653 }
654
655 static SYSCTL_NODE(_sysctl, 2, next, CTLFLAG_RD, sysctl_sysctl_next, "");
656
657 static int
658 name2oid (char *name, int *oid, int *len, struct sysctl_oid **oidpp)
659 {
660 int i;
661 struct sysctl_oid *oidp;
662 struct sysctl_oid_list *lsp = &sysctl__children;
663 char *p;
664
665 if (!*name)
666 return (ENOENT);
667
668 p = name + strlen(name) - 1 ;
669 if (*p == '.')
670 *p = '\0';
671
672 *len = 0;
673
674 for (p = name; *p && *p != '.'; p++)
675 ;
676 i = *p;
677 if (i == '.')
678 *p = '\0';
679
680 oidp = SLIST_FIRST(lsp);
681
682 while (oidp && *len < CTL_MAXNAME) {
683 if (strcmp(name, oidp->oid_name)) {
684 oidp = SLIST_NEXT(oidp, oid_link);
685 continue;
686 }
687 *oid++ = oidp->oid_number;
688 (*len)++;
689
690 if (!i) {
691 if (oidpp)
692 *oidpp = oidp;
693 return (0);
694 }
695
696 if ((oidp->oid_kind & CTLTYPE) != CTLTYPE_NODE)
697 break;
698
699 if (oidp->oid_handler)
700 break;
701
702 lsp = (struct sysctl_oid_list *)oidp->oid_arg1;
703 oidp = SLIST_FIRST(lsp);
704 name = p+1;
705 for (p = name; *p && *p != '.'; p++)
706 ;
707 i = *p;
708 if (i == '.')
709 *p = '\0';
710 }
711 return (ENOENT);
712 }
713
714 static int
715 sysctl_sysctl_name2oid(SYSCTL_HANDLER_ARGS)
716 {
717 char *p;
718 int error, oid[CTL_MAXNAME], len;
719 struct sysctl_oid *op = 0;
720
721 if (!req->newlen)
722 return (ENOENT);
723 if (req->newlen >= MAXPATHLEN) /* XXX arbitrary, undocumented */
724 return (ENAMETOOLONG);
725
726 p = malloc(req->newlen+1, M_SYSCTL, M_WAITOK);
727
728 error = SYSCTL_IN(req, p, req->newlen);
729 if (error) {
730 free(p, M_SYSCTL);
731 return (error);
732 }
733
734 p [req->newlen] = '\0';
735
736 error = name2oid(p, oid, &len, &op);
737
738 free(p, M_SYSCTL);
739
740 if (error)
741 return (error);
742
743 error = SYSCTL_OUT(req, oid, len * sizeof *oid);
744 return (error);
745 }
746
747 SYSCTL_PROC(_sysctl, 3, name2oid, CTLFLAG_RW|CTLFLAG_ANYBODY, 0, 0,
748 sysctl_sysctl_name2oid, "I", "");
749
750 static int
751 sysctl_sysctl_oidfmt(SYSCTL_HANDLER_ARGS)
752 {
753 struct sysctl_oid *oid;
754 int error;
755
756 error = sysctl_find_oid(arg1, arg2, &oid, NULL, req);
757 if (error)
758 return (error);
759
760 if (!oid->oid_fmt)
761 return (ENOENT);
762 error = SYSCTL_OUT(req, &oid->oid_kind, sizeof(oid->oid_kind));
763 if (error)
764 return (error);
765 error = SYSCTL_OUT(req, oid->oid_fmt, strlen(oid->oid_fmt) + 1);
766 return (error);
767 }
768
769
770 static SYSCTL_NODE(_sysctl, 4, oidfmt, CTLFLAG_RD, sysctl_sysctl_oidfmt, "");
771
772 static int
773 sysctl_sysctl_oiddescr(SYSCTL_HANDLER_ARGS)
774 {
775 struct sysctl_oid *oid;
776 int error;
777
778 error = sysctl_find_oid(arg1, arg2, &oid, NULL, req);
779 if (error)
780 return (error);
781
782 if (!oid->oid_descr)
783 return (ENOENT);
784 error = SYSCTL_OUT(req, oid->oid_descr, strlen(oid->oid_descr) + 1);
785 return (error);
786 }
787
788 static SYSCTL_NODE(_sysctl, 5, oiddescr, CTLFLAG_RD, sysctl_sysctl_oiddescr, "");
789
790 /*
791 * Default "handler" functions.
792 */
793
794 /*
795 * Handle an int, signed or unsigned.
796 * Two cases:
797 * a variable: point arg1 at it.
798 * a constant: pass it in arg2.
799 */
800
801 int
802 sysctl_handle_int(SYSCTL_HANDLER_ARGS)
803 {
804 int tmpout, error = 0;
805
806 /*
807 * Attempt to get a coherent snapshot by making a copy of the data.
808 */
809 if (arg1)
810 tmpout = *(int *)arg1;
811 else
812 tmpout = arg2;
813 error = SYSCTL_OUT(req, &tmpout, sizeof(int));
814
815 if (error || !req->newptr)
816 return (error);
817
818 if (!arg1)
819 error = EPERM;
820 else
821 error = SYSCTL_IN(req, arg1, sizeof(int));
822 return (error);
823 }
824
825
826 /*
827 * Based on on sysctl_handle_int() convert milliseconds into ticks.
828 */
829
830 int
831 sysctl_msec_to_ticks(SYSCTL_HANDLER_ARGS)
832 {
833 int error, s, tt;
834
835 tt = *(int *)oidp->oid_arg1;
836 s = (int)((int64_t)tt * 1000 / hz);
837
838 error = sysctl_handle_int(oidp, &s, 0, req);
839 if (error || !req->newptr)
840 return (error);
841
842 tt = (int)((int64_t)s * hz / 1000);
843 if (tt < 1)
844 return (EINVAL);
845
846 *(int *)oidp->oid_arg1 = tt;
847 return (0);
848 }
849
850
851 /*
852 * Handle a long, signed or unsigned. arg1 points to it.
853 */
854
855 int
856 sysctl_handle_long(SYSCTL_HANDLER_ARGS)
857 {
858 int error = 0;
859 long tmplong;
860 #ifdef SCTL_MASK32
861 int tmpint;
862 #endif
863
864 /*
865 * Attempt to get a coherent snapshot by making a copy of the data.
866 */
867 if (!arg1)
868 return (EINVAL);
869 tmplong = *(long *)arg1;
870 #ifdef SCTL_MASK32
871 if (req->flags & SCTL_MASK32) {
872 tmpint = tmplong;
873 error = SYSCTL_OUT(req, &tmpint, sizeof(int));
874 } else
875 #endif
876 error = SYSCTL_OUT(req, &tmplong, sizeof(long));
877
878 if (error || !req->newptr)
879 return (error);
880
881 #ifdef SCTL_MASK32
882 if (req->flags & SCTL_MASK32) {
883 error = SYSCTL_IN(req, &tmpint, sizeof(int));
884 *(long *)arg1 = (long)tmpint;
885 } else
886 #endif
887 error = SYSCTL_IN(req, arg1, sizeof(long));
888 return (error);
889 }
890
891 /*
892 * Handle our generic '\0' terminated 'C' string.
893 * Two cases:
894 * a variable string: point arg1 at it, arg2 is max length.
895 * a constant string: point arg1 at it, arg2 is zero.
896 */
897
898 int
899 sysctl_handle_string(SYSCTL_HANDLER_ARGS)
900 {
901 int error=0;
902 char *tmparg;
903 size_t outlen;
904
905 /*
906 * Attempt to get a coherent snapshot by copying to a
907 * temporary kernel buffer.
908 */
909 retry:
910 outlen = strlen((char *)arg1)+1;
911 tmparg = malloc(outlen, M_SYSCTLTMP, M_WAITOK);
912
913 if (strlcpy(tmparg, (char *)arg1, outlen) >= outlen) {
914 free(tmparg, M_SYSCTLTMP);
915 goto retry;
916 }
917
918 error = SYSCTL_OUT(req, tmparg, outlen);
919 free(tmparg, M_SYSCTLTMP);
920
921 if (error || !req->newptr)
922 return (error);
923
924 if ((req->newlen - req->newidx) >= arg2) {
925 error = EINVAL;
926 } else {
927 arg2 = (req->newlen - req->newidx);
928 error = SYSCTL_IN(req, arg1, arg2);
929 ((char *)arg1)[arg2] = '\0';
930 }
931
932 return (error);
933 }
934
935 /*
936 * Handle any kind of opaque data.
937 * arg1 points to it, arg2 is the size.
938 */
939
940 int
941 sysctl_handle_opaque(SYSCTL_HANDLER_ARGS)
942 {
943 int error, tries;
944 u_int generation;
945 struct sysctl_req req2;
946
947 /*
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.
953 */
954 tries = 0;
955 req2 = *req;
956 retry:
957 generation = curthread->td_generation;
958 error = SYSCTL_OUT(req, arg1, arg2);
959 if (error)
960 return (error);
961 tries++;
962 if (generation != curthread->td_generation && tries < 3) {
963 *req = req2;
964 goto retry;
965 }
966
967 error = SYSCTL_IN(req, arg1, arg2);
968
969 return (error);
970 }
971
972 /*
973 * Transfer functions to/from kernel space.
974 * XXX: rather untested at this point
975 */
976 static int
977 sysctl_old_kernel(struct sysctl_req *req, const void *p, size_t l)
978 {
979 size_t i = 0;
980
981 if (req->oldptr) {
982 i = l;
983 if (req->oldlen <= req->oldidx)
984 i = 0;
985 else
986 if (i > req->oldlen - req->oldidx)
987 i = req->oldlen - req->oldidx;
988 if (i > 0)
989 bcopy(p, (char *)req->oldptr + req->oldidx, i);
990 }
991 req->oldidx += l;
992 if (req->oldptr && i != l)
993 return (ENOMEM);
994 return (0);
995 }
996
997 static int
998 sysctl_new_kernel(struct sysctl_req *req, void *p, size_t l)
999 {
1000 if (!req->newptr)
1001 return (0);
1002 if (req->newlen - req->newidx < l)
1003 return (EINVAL);
1004 bcopy((char *)req->newptr + req->newidx, p, l);
1005 req->newidx += l;
1006 return (0);
1007 }
1008
1009 int
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)
1012 {
1013 int error = 0;
1014 struct sysctl_req req;
1015
1016 bzero(&req, sizeof req);
1017
1018 req.td = td;
1019 req.flags = flags;
1020
1021 if (oldlenp) {
1022 req.oldlen = *oldlenp;
1023 }
1024 req.validlen = req.oldlen;
1025
1026 if (old) {
1027 req.oldptr= old;
1028 }
1029
1030 if (new != NULL) {
1031 req.newlen = newlen;
1032 req.newptr = new;
1033 }
1034
1035 req.oldfunc = sysctl_old_kernel;
1036 req.newfunc = sysctl_new_kernel;
1037 req.lock = REQ_LOCKED;
1038
1039 SYSCTL_LOCK();
1040
1041 error = sysctl_root(0, name, namelen, &req);
1042
1043 if (req.lock == REQ_WIRED && req.validlen > 0)
1044 vsunlock(req.oldptr, req.validlen);
1045
1046 SYSCTL_UNLOCK();
1047
1048 if (error && error != ENOMEM)
1049 return (error);
1050
1051 if (retval) {
1052 if (req.oldptr && req.oldidx > req.validlen)
1053 *retval = req.validlen;
1054 else
1055 *retval = req.oldidx;
1056 }
1057 return (error);
1058 }
1059
1060 int
1061 kernel_sysctlbyname(struct thread *td, char *name, void *old, size_t *oldlenp,
1062 void *new, size_t newlen, size_t *retval, int flags)
1063 {
1064 int oid[CTL_MAXNAME];
1065 size_t oidlen, plen;
1066 int error;
1067
1068 oid[0] = 0; /* sysctl internal magic */
1069 oid[1] = 3; /* name2oid */
1070 oidlen = sizeof(oid);
1071
1072 error = kernel_sysctl(td, oid, 2, oid, &oidlen,
1073 (void *)name, strlen(name), &plen, flags);
1074 if (error)
1075 return (error);
1076
1077 error = kernel_sysctl(td, oid, plen / sizeof(int), old, oldlenp,
1078 new, newlen, retval, flags);
1079 return (error);
1080 }
1081
1082 /*
1083 * Transfer function to/from user space.
1084 */
1085 static int
1086 sysctl_old_user(struct sysctl_req *req, const void *p, size_t l)
1087 {
1088 int error = 0;
1089 size_t i, len, origidx;
1090
1091 origidx = req->oldidx;
1092 req->oldidx += l;
1093 if (req->oldptr == NULL)
1094 return (0);
1095 /*
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.
1099 */
1100 if (req->lock != REQ_WIRED)
1101 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL,
1102 "sysctl_old_user()");
1103 i = l;
1104 len = req->validlen;
1105 if (len <= origidx)
1106 i = 0;
1107 else {
1108 if (i > len - origidx)
1109 i = len - origidx;
1110 error = copyout(p, (char *)req->oldptr + origidx, i);
1111 }
1112 if (error)
1113 return (error);
1114 if (i < l)
1115 return (ENOMEM);
1116 return (0);
1117 }
1118
1119 static int
1120 sysctl_new_user(struct sysctl_req *req, void *p, size_t l)
1121 {
1122 int error;
1123
1124 if (!req->newptr)
1125 return (0);
1126 if (req->newlen - req->newidx < l)
1127 return (EINVAL);
1128 WITNESS_WARN(WARN_GIANTOK | WARN_SLEEPOK, NULL,
1129 "sysctl_new_user()");
1130 error = copyin((char *)req->newptr + req->newidx, p, l);
1131 req->newidx += l;
1132 return (error);
1133 }
1134
1135 /*
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.
1138 */
1139 int
1140 sysctl_wire_old_buffer(struct sysctl_req *req, size_t len)
1141 {
1142 int ret;
1143 size_t i, wiredlen;
1144 char *cp, dummy;
1145
1146 wiredlen = (len > 0 && len < req->oldlen) ? len : req->oldlen;
1147 ret = 0;
1148 if (req->lock == REQ_LOCKED && req->oldptr &&
1149 req->oldfunc == sysctl_old_user) {
1150 if (wiredlen != 0) {
1151 ret = vslock(req->oldptr, wiredlen);
1152 if (ret != 0) {
1153 if (ret != ENOMEM)
1154 return (ret);
1155 wiredlen = 0;
1156 }
1157 /*
1158 * Touch all the wired pages to avoid PTE modified
1159 * bit emulation traps on Alpha while holding locks
1160 * in the sysctl handler.
1161 */
1162 for (i = (wiredlen + PAGE_SIZE - 1) / PAGE_SIZE,
1163 cp = req->oldptr; i > 0; i--, cp += PAGE_SIZE) {
1164 copyin(cp, &dummy, 1);
1165 copyout(&dummy, cp, 1);
1166 }
1167 }
1168 req->lock = REQ_WIRED;
1169 req->validlen = wiredlen;
1170 }
1171 return (0);
1172 }
1173
1174 int
1175 sysctl_find_oid(int *name, u_int namelen, struct sysctl_oid **noid,
1176 int *nindx, struct sysctl_req *req)
1177 {
1178 struct sysctl_oid *oid;
1179 int indx;
1180
1181 oid = SLIST_FIRST(&sysctl__children);
1182 indx = 0;
1183 while (oid && indx < CTL_MAXNAME) {
1184 if (oid->oid_number == name[indx]) {
1185 indx++;
1186 if (oid->oid_kind & CTLFLAG_NOLOCK)
1187 req->lock = REQ_UNLOCKED;
1188 if ((oid->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
1189 if (oid->oid_handler != NULL ||
1190 indx == namelen) {
1191 *noid = oid;
1192 if (nindx != NULL)
1193 *nindx = indx;
1194 return (0);
1195 }
1196 oid = SLIST_FIRST(
1197 (struct sysctl_oid_list *)oid->oid_arg1);
1198 } else if (indx == namelen) {
1199 *noid = oid;
1200 if (nindx != NULL)
1201 *nindx = indx;
1202 return (0);
1203 } else {
1204 return (ENOTDIR);
1205 }
1206 } else {
1207 oid = SLIST_NEXT(oid, oid_link);
1208 }
1209 }
1210 return (ENOENT);
1211 }
1212
1213 /*
1214 * Traverse our tree, and find the right node, execute whatever it points
1215 * to, and return the resulting error code.
1216 */
1217
1218 static int
1219 sysctl_root(SYSCTL_HANDLER_ARGS)
1220 {
1221 struct sysctl_oid *oid;
1222 int error, indx, lvl;
1223
1224 error = sysctl_find_oid(arg1, arg2, &oid, &indx, req);
1225 if (error)
1226 return (error);
1227
1228 if ((oid->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
1229 /*
1230 * You can't call a sysctl when it's a node, but has
1231 * no handler. Inform the user that it's a node.
1232 * The indx may or may not be the same as namelen.
1233 */
1234 if (oid->oid_handler == NULL)
1235 return (EISDIR);
1236 }
1237
1238 /* Is this sysctl writable? */
1239 if (req->newptr && !(oid->oid_kind & CTLFLAG_WR))
1240 return (EPERM);
1241
1242 KASSERT(req->td != NULL, ("sysctl_root(): req->td == NULL"));
1243
1244 /* Is this sysctl sensitive to securelevels? */
1245 if (req->newptr && (oid->oid_kind & CTLFLAG_SECURE)) {
1246 lvl = (oid->oid_kind & CTLMASK_SECURE) >> CTLSHIFT_SECURE;
1247 error = securelevel_gt(req->td->td_ucred, lvl);
1248 if (error)
1249 return (error);
1250 }
1251
1252 /* Is this sysctl writable by only privileged users? */
1253 if (req->newptr && !(oid->oid_kind & CTLFLAG_ANYBODY)) {
1254 int flags;
1255
1256 if (oid->oid_kind & CTLFLAG_PRISON)
1257 flags = SUSER_ALLOWJAIL;
1258 else
1259 flags = 0;
1260 error = suser_cred(req->td->td_ucred, flags);
1261 if (error)
1262 return (error);
1263 }
1264
1265 if (!oid->oid_handler)
1266 return (EINVAL);
1267
1268 if ((oid->oid_kind & CTLTYPE) == CTLTYPE_NODE) {
1269 arg1 = (int *)arg1 + indx;
1270 arg2 -= indx;
1271 } else {
1272 arg1 = oid->oid_arg1;
1273 arg2 = oid->oid_arg2;
1274 }
1275 #ifdef MAC
1276 error = mac_check_system_sysctl(req->td->td_ucred, oid, arg1, arg2,
1277 req);
1278 if (error != 0)
1279 return (error);
1280 #endif
1281 error = oid->oid_handler(oid, arg1, arg2, req);
1282
1283 return (error);
1284 }
1285
1286 #ifndef _SYS_SYSPROTO_H_
1287 struct sysctl_args {
1288 int *name;
1289 u_int namelen;
1290 void *old;
1291 size_t *oldlenp;
1292 void *new;
1293 size_t newlen;
1294 };
1295 #endif
1296
1297 /*
1298 * MPSAFE
1299 */
1300 int
1301 __sysctl(struct thread *td, struct sysctl_args *uap)
1302 {
1303 int error, name[CTL_MAXNAME];
1304 size_t j;
1305
1306 if (uap->namelen > CTL_MAXNAME || uap->namelen < 2)
1307 return (EINVAL);
1308
1309 error = copyin(uap->name, &name, uap->namelen * sizeof(int));
1310 if (error)
1311 return (error);
1312
1313 mtx_lock(&Giant);
1314
1315 error = userland_sysctl(td, name, uap->namelen,
1316 uap->old, uap->oldlenp, 0,
1317 uap->new, uap->newlen, &j, 0);
1318 if (error && error != ENOMEM)
1319 goto done2;
1320 if (uap->oldlenp) {
1321 int i = copyout(&j, uap->oldlenp, sizeof(j));
1322 if (i)
1323 error = i;
1324 }
1325 done2:
1326 mtx_unlock(&Giant);
1327 return (error);
1328 }
1329
1330 /*
1331 * This is used from various compatibility syscalls too. That's why name
1332 * must be in kernel space.
1333 */
1334 int
1335 userland_sysctl(struct thread *td, int *name, u_int namelen, void *old,
1336 size_t *oldlenp, int inkernel, void *new, size_t newlen, size_t *retval,
1337 int flags)
1338 {
1339 int error = 0;
1340 struct sysctl_req req;
1341
1342 bzero(&req, sizeof req);
1343
1344 req.td = td;
1345 req.flags = flags;
1346
1347 if (oldlenp) {
1348 if (inkernel) {
1349 req.oldlen = *oldlenp;
1350 } else {
1351 error = copyin(oldlenp, &req.oldlen, sizeof(*oldlenp));
1352 if (error)
1353 return (error);
1354 }
1355 }
1356 req.validlen = req.oldlen;
1357
1358 if (old) {
1359 if (!useracc(old, req.oldlen, VM_PROT_WRITE))
1360 return (EFAULT);
1361 req.oldptr= old;
1362 }
1363
1364 if (new != NULL) {
1365 if (!useracc(new, req.newlen, VM_PROT_READ))
1366 return (EFAULT);
1367 req.newlen = newlen;
1368 req.newptr = new;
1369 }
1370
1371 req.oldfunc = sysctl_old_user;
1372 req.newfunc = sysctl_new_user;
1373 req.lock = REQ_LOCKED;
1374
1375 SYSCTL_LOCK();
1376
1377 do {
1378 req.oldidx = 0;
1379 req.newidx = 0;
1380 error = sysctl_root(0, name, namelen, &req);
1381 } while (error == EAGAIN);
1382
1383 if (req.lock == REQ_WIRED && req.validlen > 0)
1384 vsunlock(req.oldptr, req.validlen);
1385
1386 SYSCTL_UNLOCK();
1387
1388 if (error && error != ENOMEM)
1389 return (error);
1390
1391 if (retval) {
1392 if (req.oldptr && req.oldidx > req.validlen)
1393 *retval = req.validlen;
1394 else
1395 *retval = req.oldidx;
1396 }
1397 return (error);
1398 }
1399
1400 #ifdef COMPAT_43
1401 #include <sys/socket.h>
1402 #include <vm/vm_param.h>
1403
1404 #define KINFO_PROC (0<<8)
1405 #define KINFO_RT (1<<8)
1406 #define KINFO_VNODE (2<<8)
1407 #define KINFO_FILE (3<<8)
1408 #define KINFO_METER (4<<8)
1409 #define KINFO_LOADAVG (5<<8)
1410 #define KINFO_CLOCKRATE (6<<8)
1411
1412 /* Non-standard BSDI extension - only present on their 4.3 net-2 releases */
1413 #define KINFO_BSDI_SYSINFO (101<<8)
1414
1415 /*
1416 * XXX this is bloat, but I hope it's better here than on the potentially
1417 * limited kernel stack... -Peter
1418 */
1419
1420 static struct {
1421 int bsdi_machine; /* "i386" on BSD/386 */
1422 /* ^^^ this is an offset to the string, relative to the struct start */
1423 char *pad0;
1424 long pad1;
1425 long pad2;
1426 long pad3;
1427 u_long pad4;
1428 u_long pad5;
1429 u_long pad6;
1430
1431 int bsdi_ostype; /* "BSD/386" on BSD/386 */
1432 int bsdi_osrelease; /* "1.1" on BSD/386 */
1433 long pad7;
1434 long pad8;
1435 char *pad9;
1436
1437 long pad10;
1438 long pad11;
1439 int pad12;
1440 long pad13;
1441 quad_t pad14;
1442 long pad15;
1443
1444 struct timeval pad16;
1445 /* we dont set this, because BSDI's uname used gethostname() instead */
1446 int bsdi_hostname; /* hostname on BSD/386 */
1447
1448 /* the actual string data is appended here */
1449
1450 } bsdi_si;
1451 /*
1452 * this data is appended to the end of the bsdi_si structure during copyout.
1453 * The "char *" offsets are relative to the base of the bsdi_si struct.
1454 * This contains "FreeBSD\02.0-BUILT-nnnnnn\0i386\0", and these strings
1455 * should not exceed the length of the buffer here... (or else!! :-)
1456 */
1457 static char bsdi_strings[80]; /* It had better be less than this! */
1458
1459 #ifndef _SYS_SYSPROTO_H_
1460 struct getkerninfo_args {
1461 int op;
1462 char *where;
1463 size_t *size;
1464 int arg;
1465 };
1466 #endif
1467
1468 /*
1469 * MPSAFE
1470 */
1471 int
1472 ogetkerninfo(struct thread *td, struct getkerninfo_args *uap)
1473 {
1474 int error, name[6];
1475 size_t size;
1476 u_int needed = 0;
1477
1478 mtx_lock(&Giant);
1479
1480 switch (uap->op & 0xff00) {
1481
1482 case KINFO_RT:
1483 name[0] = CTL_NET;
1484 name[1] = PF_ROUTE;
1485 name[2] = 0;
1486 name[3] = (uap->op & 0xff0000) >> 16;
1487 name[4] = uap->op & 0xff;
1488 name[5] = uap->arg;
1489 error = userland_sysctl(td, name, 6, uap->where, uap->size,
1490 0, 0, 0, &size, 0);
1491 break;
1492
1493 case KINFO_VNODE:
1494 name[0] = CTL_KERN;
1495 name[1] = KERN_VNODE;
1496 error = userland_sysctl(td, name, 2, uap->where, uap->size,
1497 0, 0, 0, &size, 0);
1498 break;
1499
1500 case KINFO_PROC:
1501 name[0] = CTL_KERN;
1502 name[1] = KERN_PROC;
1503 name[2] = uap->op & 0xff;
1504 name[3] = uap->arg;
1505 error = userland_sysctl(td, name, 4, uap->where, uap->size,
1506 0, 0, 0, &size, 0);
1507 break;
1508
1509 case KINFO_FILE:
1510 name[0] = CTL_KERN;
1511 name[1] = KERN_FILE;
1512 error = userland_sysctl(td, name, 2, uap->where, uap->size,
1513 0, 0, 0, &size, 0);
1514 break;
1515
1516 case KINFO_METER:
1517 name[0] = CTL_VM;
1518 name[1] = VM_TOTAL;
1519 error = userland_sysctl(td, name, 2, uap->where, uap->size,
1520 0, 0, 0, &size, 0);
1521 break;
1522
1523 case KINFO_LOADAVG:
1524 name[0] = CTL_VM;
1525 name[1] = VM_LOADAVG;
1526 error = userland_sysctl(td, name, 2, uap->where, uap->size,
1527 0, 0, 0, &size, 0);
1528 break;
1529
1530 case KINFO_CLOCKRATE:
1531 name[0] = CTL_KERN;
1532 name[1] = KERN_CLOCKRATE;
1533 error = userland_sysctl(td, name, 2, uap->where, uap->size,
1534 0, 0, 0, &size, 0);
1535 break;
1536
1537 case KINFO_BSDI_SYSINFO: {
1538 /*
1539 * this is pretty crude, but it's just enough for uname()
1540 * from BSDI's 1.x libc to work.
1541 *
1542 * *size gives the size of the buffer before the call, and
1543 * the amount of data copied after a successful call.
1544 * If successful, the return value is the amount of data
1545 * available, which can be larger than *size.
1546 *
1547 * BSDI's 2.x product apparently fails with ENOMEM if *size
1548 * is too small.
1549 */
1550
1551 u_int left;
1552 char *s;
1553
1554 bzero((char *)&bsdi_si, sizeof(bsdi_si));
1555 bzero(bsdi_strings, sizeof(bsdi_strings));
1556
1557 s = bsdi_strings;
1558
1559 bsdi_si.bsdi_ostype = (s - bsdi_strings) + sizeof(bsdi_si);
1560 strcpy(s, ostype);
1561 s += strlen(s) + 1;
1562
1563 bsdi_si.bsdi_osrelease = (s - bsdi_strings) + sizeof(bsdi_si);
1564 strcpy(s, osrelease);
1565 s += strlen(s) + 1;
1566
1567 bsdi_si.bsdi_machine = (s - bsdi_strings) + sizeof(bsdi_si);
1568 strcpy(s, machine);
1569 s += strlen(s) + 1;
1570
1571 needed = sizeof(bsdi_si) + (s - bsdi_strings);
1572
1573 if ((uap->where == NULL) || (uap->size == NULL)) {
1574 /* process is asking how much buffer to supply.. */
1575 size = needed;
1576 error = 0;
1577 break;
1578 }
1579
1580 if ((error = copyin(uap->size, &size, sizeof(size))) != 0)
1581 break;
1582
1583 /* if too much buffer supplied, trim it down */
1584 if (size > needed)
1585 size = needed;
1586
1587 /* how much of the buffer is remaining */
1588 left = size;
1589
1590 if ((error = copyout((char *)&bsdi_si, uap->where, left)) != 0)
1591 break;
1592
1593 /* is there any point in continuing? */
1594 if (left > sizeof(bsdi_si)) {
1595 left -= sizeof(bsdi_si);
1596 error = copyout(&bsdi_strings,
1597 uap->where + sizeof(bsdi_si), left);
1598 }
1599 break;
1600 }
1601
1602 default:
1603 error = EOPNOTSUPP;
1604 break;
1605 }
1606 if (error == 0) {
1607 td->td_retval[0] = needed ? needed : size;
1608 if (uap->size) {
1609 error = copyout(&size, uap->size, sizeof(size));
1610 }
1611 }
1612 mtx_unlock(&Giant);
1613 return (error);
1614 }
1615 #endif /* COMPAT_43 */
Cache object: ba04e8a4f18701dda4ac8a2d9fa28feb
|