2009-01-11 05:45:45 +03:00
|
|
|
/* $NetBSD: kern_info_43.c,v 1.34 2009/01/11 02:45:46 christos Exp $ */
|
1995-06-25 00:15:55 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (c) 1982, 1986, 1991, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
2003-08-07 20:26:28 +04:00
|
|
|
* 3. Neither the name of the University nor the names of its contributors
|
1995-06-25 00:15:55 +04:00
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* @(#)subr_xxx.c 8.1 (Berkeley) 6/10/93
|
|
|
|
*/
|
|
|
|
|
2001-11-13 05:07:52 +03:00
|
|
|
#include <sys/cdefs.h>
|
2009-01-11 05:45:45 +03:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: kern_info_43.c,v 1.34 2009/01/11 02:45:46 christos Exp $");
|
2001-11-13 05:07:52 +03:00
|
|
|
|
1995-06-25 00:15:55 +04:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/filedesc.h>
|
|
|
|
#include <sys/kernel.h>
|
|
|
|
#include <sys/vnode.h>
|
|
|
|
#include <sys/proc.h>
|
|
|
|
#include <sys/file.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/socketvar.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <sys/ioctl.h>
|
|
|
|
#include <sys/fcntl.h>
|
|
|
|
#include <sys/syslog.h>
|
|
|
|
#include <sys/unistd.h>
|
|
|
|
#include <sys/resourcevar.h>
|
2006-05-15 01:19:33 +04:00
|
|
|
#include <sys/kauth.h>
|
1999-03-24 08:50:49 +03:00
|
|
|
|
1998-02-05 10:59:28 +03:00
|
|
|
#include <uvm/uvm_extern.h>
|
2000-06-28 19:39:24 +04:00
|
|
|
#include <sys/sysctl.h>
|
1998-02-05 10:59:28 +03:00
|
|
|
|
1995-06-25 00:15:55 +04:00
|
|
|
#include <sys/mount.h>
|
|
|
|
#include <sys/syscallargs.h>
|
2009-01-11 05:45:45 +03:00
|
|
|
#include <compat/sys/time.h>
|
1995-06-25 00:15:55 +04:00
|
|
|
|
|
|
|
int
|
2007-12-21 02:02:38 +03:00
|
|
|
compat_43_sys_getdtablesize(struct lwp *l, const void *v, register_t *retval)
|
1995-06-25 00:15:55 +04:00
|
|
|
{
|
2003-01-18 10:28:34 +03:00
|
|
|
struct proc *p = l->l_proc;
|
1995-06-25 00:15:55 +04:00
|
|
|
|
2008-04-24 22:39:20 +04:00
|
|
|
mutex_enter(p->p_lock);
|
1995-06-25 00:15:55 +04:00
|
|
|
*retval = min((int)p->p_rlimit[RLIMIT_NOFILE].rlim_cur, maxfiles);
|
2008-04-24 22:39:20 +04:00
|
|
|
mutex_exit(p->p_lock);
|
1995-06-25 00:15:55 +04:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* ARGSUSED */
|
|
|
|
int
|
2007-12-21 02:02:38 +03:00
|
|
|
compat_43_sys_gethostid(struct lwp *l, const void *v, register_t *retval)
|
1995-06-25 00:15:55 +04:00
|
|
|
{
|
|
|
|
|
|
|
|
*(int32_t *)retval = hostid;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*ARGSUSED*/
|
|
|
|
int
|
2007-12-21 02:02:38 +03:00
|
|
|
compat_43_sys_gethostname(struct lwp *l, const struct compat_43_sys_gethostname_args *uap, register_t *retval)
|
1995-09-20 01:57:36 +04:00
|
|
|
{
|
2007-12-21 02:02:38 +03:00
|
|
|
/* {
|
1995-06-25 00:15:55 +04:00
|
|
|
syscallarg(char *) hostname;
|
|
|
|
syscallarg(u_int) len;
|
2007-12-21 02:02:38 +03:00
|
|
|
} */
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
int name[2];
|
1996-02-21 03:10:59 +03:00
|
|
|
size_t sz;
|
1995-06-25 00:15:55 +04:00
|
|
|
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
name[0] = CTL_KERN;
|
|
|
|
name[1] = KERN_HOSTNAME;
|
1996-02-21 03:10:59 +03:00
|
|
|
sz = SCARG(uap, len);
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
return (old_sysctl(&name[0], 2, SCARG(uap, hostname), &sz, 0, 0, l));
|
1995-06-25 00:15:55 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
#define KINFO_PROC (0<<8)
|
|
|
|
#define KINFO_RT (1<<8)
|
|
|
|
#define KINFO_VNODE (2<<8)
|
|
|
|
#define KINFO_FILE (3<<8)
|
|
|
|
#define KINFO_METER (4<<8)
|
|
|
|
#define KINFO_LOADAVG (5<<8)
|
|
|
|
#define KINFO_CLOCKRATE (6<<8)
|
1996-05-18 05:24:34 +04:00
|
|
|
#define KINFO_BSDI_SYSINFO (101<<8)
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* The string data is appended to the end of the bsdi_si structure during
|
|
|
|
* copyout. The "char *" offsets in the bsdi_si struct are relative to the
|
2005-02-27 01:58:54 +03:00
|
|
|
* base of the bsdi_si struct.
|
1996-05-18 05:24:34 +04:00
|
|
|
*/
|
|
|
|
struct bsdi_si {
|
|
|
|
char *machine;
|
|
|
|
char *cpu_model;
|
|
|
|
long ncpu;
|
|
|
|
long cpuspeed;
|
|
|
|
long hwflags;
|
|
|
|
u_long physmem;
|
|
|
|
u_long usermem;
|
|
|
|
u_long pagesize;
|
|
|
|
|
|
|
|
char *ostype;
|
|
|
|
char *osrelease;
|
|
|
|
long os_revision;
|
|
|
|
long posix1_version;
|
|
|
|
char *version;
|
|
|
|
|
|
|
|
long hz;
|
|
|
|
long profhz;
|
|
|
|
int ngroups_max;
|
|
|
|
long arg_max;
|
|
|
|
long open_max;
|
|
|
|
long child_max;
|
|
|
|
|
2009-01-11 05:45:45 +03:00
|
|
|
struct timeval50 boottime;
|
1996-05-18 05:24:34 +04:00
|
|
|
char *hostname;
|
|
|
|
};
|
1995-06-25 00:15:55 +04:00
|
|
|
|
|
|
|
int
|
2007-12-21 02:02:38 +03:00
|
|
|
compat_43_sys_getkerninfo(struct lwp *l, const struct compat_43_sys_getkerninfo_args *uap, register_t *retval)
|
1995-09-20 01:57:36 +04:00
|
|
|
{
|
2007-12-21 02:02:38 +03:00
|
|
|
/* {
|
1995-06-25 00:15:55 +04:00
|
|
|
syscallarg(int) op;
|
|
|
|
syscallarg(char *) where;
|
|
|
|
syscallarg(int *) size;
|
|
|
|
syscallarg(int) arg;
|
2007-12-21 02:02:38 +03:00
|
|
|
} */
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
int error, name[6];
|
1995-06-25 00:15:55 +04:00
|
|
|
size_t size;
|
|
|
|
|
2007-03-04 08:59:00 +03:00
|
|
|
if (SCARG(uap, size) && (error = copyin((void *)SCARG(uap, size),
|
|
|
|
(void *)&size, sizeof(size))))
|
1995-06-25 00:15:55 +04:00
|
|
|
return (error);
|
|
|
|
|
|
|
|
switch (SCARG(uap, op) & 0xff00) {
|
|
|
|
|
|
|
|
case KINFO_RT:
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
name[0] = CTL_NET;
|
|
|
|
name[1] = PF_ROUTE;
|
|
|
|
name[2] = 0;
|
|
|
|
name[3] = (SCARG(uap, op) & 0xff0000) >> 16;
|
|
|
|
name[4] = SCARG(uap, op) & 0xff;
|
|
|
|
name[5] = SCARG(uap, arg);
|
|
|
|
error = old_sysctl(&name[0], 6, SCARG(uap, where), &size,
|
|
|
|
NULL, 0, l);
|
1995-06-25 00:15:55 +04:00
|
|
|
break;
|
|
|
|
|
|
|
|
case KINFO_VNODE:
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
name[0] = CTL_KERN;
|
|
|
|
name[1] = KERN_VNODE;
|
|
|
|
error = old_sysctl(&name[0], 2, SCARG(uap, where), &size,
|
|
|
|
NULL, 0, l);
|
1995-06-25 00:15:55 +04:00
|
|
|
break;
|
|
|
|
|
|
|
|
case KINFO_PROC:
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
name[0] = CTL_KERN;
|
|
|
|
name[1] = KERN_PROC;
|
|
|
|
name[2] = SCARG(uap, op) & 0xff;
|
|
|
|
name[3] = SCARG(uap, arg);
|
|
|
|
error = old_sysctl(&name[0], 4, SCARG(uap, where), &size,
|
|
|
|
NULL, 0, l);
|
1995-06-25 00:15:55 +04:00
|
|
|
break;
|
|
|
|
|
|
|
|
case KINFO_FILE:
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
name[0] = CTL_KERN;
|
|
|
|
name[1] = KERN_FILE;
|
|
|
|
error = old_sysctl(&name[0], 2, SCARG(uap, where), &size,
|
|
|
|
NULL, 0, l);
|
1995-06-25 00:15:55 +04:00
|
|
|
break;
|
|
|
|
|
|
|
|
case KINFO_METER:
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
name[0] = CTL_VM;
|
|
|
|
name[1] = VM_METER;
|
|
|
|
error = old_sysctl(&name[0], 2, SCARG(uap, where), &size,
|
|
|
|
NULL, 0, l);
|
1995-06-25 00:15:55 +04:00
|
|
|
break;
|
|
|
|
|
|
|
|
case KINFO_LOADAVG:
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
name[0] = CTL_VM;
|
|
|
|
name[1] = VM_LOADAVG;
|
|
|
|
error = old_sysctl(&name[0], 2, SCARG(uap, where), &size,
|
|
|
|
NULL, 0, l);
|
1995-06-25 00:15:55 +04:00
|
|
|
break;
|
|
|
|
|
|
|
|
case KINFO_CLOCKRATE:
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
name[0] = CTL_KERN;
|
|
|
|
name[1] = KERN_CLOCKRATE;
|
|
|
|
error = old_sysctl(&name[0], 2, SCARG(uap, where), &size,
|
|
|
|
NULL, 0, l);
|
1995-06-25 00:15:55 +04:00
|
|
|
break;
|
|
|
|
|
1996-05-18 05:24:34 +04:00
|
|
|
|
|
|
|
case KINFO_BSDI_SYSINFO:
|
|
|
|
{
|
|
|
|
size_t len;
|
|
|
|
struct bsdi_si *usi =
|
|
|
|
(struct bsdi_si *) SCARG(uap, where);
|
|
|
|
struct bsdi_si ksi;
|
2009-01-11 05:45:45 +03:00
|
|
|
struct timeval tv;
|
1996-05-18 05:24:34 +04:00
|
|
|
char *us = (char *) &usi[1];
|
|
|
|
|
|
|
|
if (usi == NULL) {
|
|
|
|
size = sizeof(ksi) +
|
|
|
|
strlen(ostype) + strlen(cpu_model) +
|
|
|
|
strlen(osrelease) + strlen(machine) +
|
|
|
|
strlen(version) + strlen(hostname) + 6;
|
|
|
|
error = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
#define COPY(fld) \
|
|
|
|
ksi.fld = us - (u_long) usi; \
|
|
|
|
if ((error = copyoutstr(fld, us, 1024, &len)) != 0)\
|
|
|
|
return error; \
|
|
|
|
us += len
|
|
|
|
|
|
|
|
COPY(machine);
|
|
|
|
COPY(cpu_model);
|
2007-02-15 23:32:47 +03:00
|
|
|
ksi.ncpu = ncpu; /* XXX */
|
1996-05-18 05:24:34 +04:00
|
|
|
ksi.cpuspeed = 40; /* XXX */
|
|
|
|
ksi.hwflags = 0; /* XXX */
|
|
|
|
ksi.physmem = ctob(physmem);
|
|
|
|
ksi.usermem = ctob(physmem); /* XXX */
|
|
|
|
ksi.pagesize = PAGE_SIZE;
|
|
|
|
|
|
|
|
COPY(ostype);
|
|
|
|
COPY(osrelease);
|
|
|
|
ksi.os_revision = NetBSD; /* XXX */
|
|
|
|
ksi.posix1_version = _POSIX_VERSION;
|
|
|
|
COPY(version); /* XXX */
|
|
|
|
|
|
|
|
ksi.hz = hz;
|
|
|
|
ksi.profhz = profhz;
|
|
|
|
ksi.ngroups_max = NGROUPS_MAX;
|
|
|
|
ksi.arg_max = ARG_MAX;
|
|
|
|
ksi.open_max = OPEN_MAX;
|
|
|
|
ksi.child_max = CHILD_MAX;
|
|
|
|
|
2009-01-11 05:45:45 +03:00
|
|
|
TIMESPEC_TO_TIMEVAL(&tv, &boottime);
|
|
|
|
timeval_to_timeval50(&tv, &ksi.boottime);
|
1996-05-18 05:24:34 +04:00
|
|
|
COPY(hostname);
|
|
|
|
|
|
|
|
size = (us - (char *) &usi[1]) + sizeof(ksi);
|
|
|
|
|
|
|
|
if ((error = copyout(&ksi, usi, sizeof(ksi))) != 0)
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
1995-06-25 00:15:55 +04:00
|
|
|
default:
|
|
|
|
return (EOPNOTSUPP);
|
|
|
|
}
|
|
|
|
if (error)
|
|
|
|
return (error);
|
|
|
|
*retval = size;
|
|
|
|
if (SCARG(uap, size))
|
2007-03-04 08:59:00 +03:00
|
|
|
error = copyout((void *)&size, (void *)SCARG(uap, size),
|
1995-06-25 00:15:55 +04:00
|
|
|
sizeof(size));
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* ARGSUSED */
|
|
|
|
int
|
2007-12-21 02:02:38 +03:00
|
|
|
compat_43_sys_sethostid(struct lwp *l, const struct compat_43_sys_sethostid_args *uap, register_t *retval)
|
1995-06-25 00:15:55 +04:00
|
|
|
{
|
2008-01-09 01:08:45 +03:00
|
|
|
long uhostid;
|
|
|
|
int name[2];
|
1995-06-25 00:15:55 +04:00
|
|
|
|
2008-01-09 01:08:45 +03:00
|
|
|
uhostid = SCARG(uap, hostid);
|
|
|
|
name[0] = CTL_KERN;
|
|
|
|
name[1] = KERN_HOSTID;
|
|
|
|
|
|
|
|
return (old_sysctl(&name[0], 2, 0, 0, &uhostid, sizeof(long), l));
|
1995-06-25 00:15:55 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* ARGSUSED */
|
|
|
|
int
|
2007-12-21 02:02:38 +03:00
|
|
|
compat_43_sys_sethostname(struct lwp *l, const struct compat_43_sys_sethostname_args *uap, register_t *retval)
|
1995-06-25 00:15:55 +04:00
|
|
|
{
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
int name[2];
|
1995-06-25 00:15:55 +04:00
|
|
|
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
name[0] = CTL_KERN;
|
|
|
|
name[1] = KERN_HOSTNAME;
|
|
|
|
return (old_sysctl(&name[0], 2, 0, 0, SCARG(uap, hostname),
|
|
|
|
SCARG(uap, len), l));
|
1995-06-25 00:15:55 +04:00
|
|
|
}
|