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