20d06f6b17
the most "officially looking" is IEC 60027-2, ie "Ki", "Mi", ..., which is not too popular, and which would require more code changes. So stick with the traditional capital "K" for (divisor==1024), and use the SI "k" otherwise (ie (divisor==1000)).
1270 lines
28 KiB
C
1270 lines
28 KiB
C
/* $NetBSD: kern_subr.c,v 1.91 2002/09/27 18:37:43 drochner Exp $ */
|
|
|
|
/*-
|
|
* Copyright (c) 1997, 1998, 1999, 2002 The NetBSD Foundation, Inc.
|
|
* All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to The NetBSD Foundation
|
|
* by Jason R. Thorpe of the Numerical Aerospace Simulation Facility,
|
|
* NASA Ames Research Center, and by Luke Mewburn.
|
|
*
|
|
* 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.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the NetBSD
|
|
* Foundation, Inc. and its contributors.
|
|
* 4. Neither the name of The NetBSD Foundation nor the names of its
|
|
* contributors may be used to endorse or promote products derived
|
|
* from this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. 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 FOUNDATION 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.
|
|
*/
|
|
|
|
/*
|
|
* Copyright (c) 1982, 1986, 1991, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
* (c) UNIX System Laboratories, Inc.
|
|
* All or some portions of this file are derived from material licensed
|
|
* to the University of California by American Telephone and Telegraph
|
|
* Co. or Unix System Laboratories, Inc. and are reproduced herein with
|
|
* the permission of UNIX System Laboratories, Inc.
|
|
*
|
|
* Copyright (c) 1992, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* This software was developed by the Computer Systems Engineering group
|
|
* at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
|
|
* contributed to Berkeley.
|
|
*
|
|
* All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Lawrence Berkeley Laboratory.
|
|
*
|
|
* 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.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* 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.
|
|
*
|
|
* @(#)kern_subr.c 8.4 (Berkeley) 2/14/95
|
|
*/
|
|
|
|
#include <sys/cdefs.h>
|
|
__KERNEL_RCSID(0, "$NetBSD: kern_subr.c,v 1.91 2002/09/27 18:37:43 drochner Exp $");
|
|
|
|
#include "opt_ddb.h"
|
|
#include "opt_md.h"
|
|
#include "opt_syscall_debug.h"
|
|
#include "opt_ktrace.h"
|
|
#include "opt_systrace.h"
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/systm.h>
|
|
#include <sys/proc.h>
|
|
#include <sys/malloc.h>
|
|
#include <sys/mount.h>
|
|
#include <sys/device.h>
|
|
#include <sys/reboot.h>
|
|
#include <sys/conf.h>
|
|
#include <sys/disklabel.h>
|
|
#include <sys/queue.h>
|
|
#include <sys/systrace.h>
|
|
#include <sys/ktrace.h>
|
|
|
|
#include <uvm/uvm_extern.h>
|
|
|
|
#include <dev/cons.h>
|
|
|
|
#include <net/if.h>
|
|
|
|
/* XXX these should eventually move to subr_autoconf.c */
|
|
static struct device *finddevice __P((const char *));
|
|
static struct device *getdisk __P((char *, int, int, dev_t *, int));
|
|
static struct device *parsedisk __P((char *, int, int, dev_t *));
|
|
|
|
/*
|
|
* A generic linear hook.
|
|
*/
|
|
struct hook_desc {
|
|
LIST_ENTRY(hook_desc) hk_list;
|
|
void (*hk_fn) __P((void *));
|
|
void *hk_arg;
|
|
};
|
|
typedef LIST_HEAD(, hook_desc) hook_list_t;
|
|
|
|
static void *hook_establish __P((hook_list_t *, void (*)(void *), void *));
|
|
static void hook_disestablish __P((hook_list_t *, void *));
|
|
static void hook_destroy __P((hook_list_t *));
|
|
static void hook_proc_run __P((hook_list_t *, struct proc *));
|
|
|
|
int
|
|
uiomove(buf, n, uio)
|
|
void *buf;
|
|
size_t n;
|
|
struct uio *uio;
|
|
{
|
|
struct iovec *iov;
|
|
u_int cnt;
|
|
int error = 0;
|
|
char *cp = buf;
|
|
struct proc *p = uio->uio_procp;
|
|
|
|
#ifdef DIAGNOSTIC
|
|
if (uio->uio_rw != UIO_READ && uio->uio_rw != UIO_WRITE)
|
|
panic("uiomove: mode");
|
|
#endif
|
|
while (n > 0 && uio->uio_resid) {
|
|
iov = uio->uio_iov;
|
|
cnt = iov->iov_len;
|
|
if (cnt == 0) {
|
|
uio->uio_iov++;
|
|
uio->uio_iovcnt--;
|
|
continue;
|
|
}
|
|
if (cnt > n)
|
|
cnt = n;
|
|
switch (uio->uio_segflg) {
|
|
|
|
case UIO_USERSPACE:
|
|
if (curproc->p_cpu->ci_schedstate.spc_flags &
|
|
SPCF_SHOULDYIELD)
|
|
preempt(NULL);
|
|
if (__predict_true(p == curproc)) {
|
|
if (uio->uio_rw == UIO_READ)
|
|
error = copyout(cp, iov->iov_base, cnt);
|
|
else
|
|
error = copyin(iov->iov_base, cp, cnt);
|
|
} else {
|
|
if (uio->uio_rw == UIO_READ)
|
|
error = copyout_proc(p, cp,
|
|
iov->iov_base, cnt);
|
|
else
|
|
error = copyin_proc(p, iov->iov_base,
|
|
cp, cnt);
|
|
}
|
|
if (error)
|
|
return (error);
|
|
break;
|
|
|
|
case UIO_SYSSPACE:
|
|
if (uio->uio_rw == UIO_READ)
|
|
error = kcopy(cp, iov->iov_base, cnt);
|
|
else
|
|
error = kcopy(iov->iov_base, cp, cnt);
|
|
if (error)
|
|
return (error);
|
|
break;
|
|
}
|
|
iov->iov_base = (caddr_t)iov->iov_base + cnt;
|
|
iov->iov_len -= cnt;
|
|
uio->uio_resid -= cnt;
|
|
uio->uio_offset += cnt;
|
|
cp += cnt;
|
|
KDASSERT(cnt <= n);
|
|
n -= cnt;
|
|
}
|
|
return (error);
|
|
}
|
|
|
|
/*
|
|
* Give next character to user as result of read.
|
|
*/
|
|
int
|
|
ureadc(c, uio)
|
|
int c;
|
|
struct uio *uio;
|
|
{
|
|
struct iovec *iov;
|
|
|
|
if (uio->uio_resid <= 0)
|
|
panic("ureadc: non-positive resid");
|
|
again:
|
|
if (uio->uio_iovcnt <= 0)
|
|
panic("ureadc: non-positive iovcnt");
|
|
iov = uio->uio_iov;
|
|
if (iov->iov_len <= 0) {
|
|
uio->uio_iovcnt--;
|
|
uio->uio_iov++;
|
|
goto again;
|
|
}
|
|
switch (uio->uio_segflg) {
|
|
|
|
case UIO_USERSPACE:
|
|
if (subyte(iov->iov_base, c) < 0)
|
|
return (EFAULT);
|
|
break;
|
|
|
|
case UIO_SYSSPACE:
|
|
*(char *)iov->iov_base = c;
|
|
break;
|
|
}
|
|
iov->iov_base = (caddr_t)iov->iov_base + 1;
|
|
iov->iov_len--;
|
|
uio->uio_resid--;
|
|
uio->uio_offset++;
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* Like copyin(), but operates on an arbitrary process.
|
|
*/
|
|
int
|
|
copyin_proc(struct proc *p, const void *uaddr, void *kaddr, size_t len)
|
|
{
|
|
struct iovec iov;
|
|
struct uio uio;
|
|
int error;
|
|
|
|
if (len == 0)
|
|
return (0);
|
|
|
|
iov.iov_base = kaddr;
|
|
iov.iov_len = len;
|
|
uio.uio_iov = &iov;
|
|
uio.uio_iovcnt = 1;
|
|
uio.uio_offset = (off_t)(intptr_t)uaddr;
|
|
uio.uio_resid = len;
|
|
uio.uio_segflg = UIO_SYSSPACE;
|
|
uio.uio_rw = UIO_READ;
|
|
uio.uio_procp = NULL;
|
|
|
|
/* XXXCDC: how should locking work here? */
|
|
if ((p->p_flag & P_WEXIT) || (p->p_vmspace->vm_refcnt < 1))
|
|
return (EFAULT);
|
|
p->p_vmspace->vm_refcnt++; /* XXX */
|
|
error = uvm_io(&p->p_vmspace->vm_map, &uio);
|
|
uvmspace_free(p->p_vmspace);
|
|
|
|
return (error);
|
|
}
|
|
|
|
/*
|
|
* Like copyout(), but operates on an arbitrary process.
|
|
*/
|
|
int
|
|
copyout_proc(struct proc *p, const void *kaddr, void *uaddr, size_t len)
|
|
{
|
|
struct iovec iov;
|
|
struct uio uio;
|
|
int error;
|
|
|
|
if (len == 0)
|
|
return (0);
|
|
|
|
iov.iov_base = (void *) kaddr; /* XXX cast away const */
|
|
iov.iov_len = len;
|
|
uio.uio_iov = &iov;
|
|
uio.uio_iovcnt = 1;
|
|
uio.uio_offset = (off_t)(intptr_t)uaddr;
|
|
uio.uio_resid = len;
|
|
uio.uio_segflg = UIO_SYSSPACE;
|
|
uio.uio_rw = UIO_WRITE;
|
|
uio.uio_procp = NULL;
|
|
|
|
/* XXXCDC: how should locking work here? */
|
|
if ((p->p_flag & P_WEXIT) || (p->p_vmspace->vm_refcnt < 1))
|
|
return (EFAULT);
|
|
p->p_vmspace->vm_refcnt++; /* XXX */
|
|
error = uvm_io(&p->p_vmspace->vm_map, &uio);
|
|
uvmspace_free(p->p_vmspace);
|
|
|
|
return (error);
|
|
}
|
|
|
|
/*
|
|
* General routine to allocate a hash table.
|
|
* Allocate enough memory to hold at least `elements' list-head pointers.
|
|
* Return a pointer to the allocated space and set *hashmask to a pattern
|
|
* suitable for masking a value to use as an index into the returned array.
|
|
*/
|
|
void *
|
|
hashinit(elements, htype, mtype, mflags, hashmask)
|
|
u_int elements;
|
|
enum hashtype htype;
|
|
int mtype, mflags;
|
|
u_long *hashmask;
|
|
{
|
|
u_long hashsize, i;
|
|
LIST_HEAD(, generic) *hashtbl_list;
|
|
TAILQ_HEAD(, generic) *hashtbl_tailq;
|
|
size_t esize;
|
|
void *p;
|
|
|
|
if (elements == 0)
|
|
panic("hashinit: bad cnt");
|
|
for (hashsize = 1; hashsize < elements; hashsize <<= 1)
|
|
continue;
|
|
|
|
switch (htype) {
|
|
case HASH_LIST:
|
|
esize = sizeof(*hashtbl_list);
|
|
break;
|
|
case HASH_TAILQ:
|
|
esize = sizeof(*hashtbl_tailq);
|
|
break;
|
|
#ifdef DIAGNOSTIC
|
|
default:
|
|
panic("hashinit: invalid table type");
|
|
#endif
|
|
}
|
|
|
|
if ((p = malloc(hashsize * esize, mtype, mflags)) == NULL)
|
|
return (NULL);
|
|
|
|
switch (htype) {
|
|
case HASH_LIST:
|
|
hashtbl_list = p;
|
|
for (i = 0; i < hashsize; i++)
|
|
LIST_INIT(&hashtbl_list[i]);
|
|
break;
|
|
case HASH_TAILQ:
|
|
hashtbl_tailq = p;
|
|
for (i = 0; i < hashsize; i++)
|
|
TAILQ_INIT(&hashtbl_tailq[i]);
|
|
break;
|
|
}
|
|
*hashmask = hashsize - 1;
|
|
return (p);
|
|
}
|
|
|
|
/*
|
|
* Free memory from hash table previosly allocated via hashinit().
|
|
*/
|
|
void
|
|
hashdone(hashtbl, mtype)
|
|
void *hashtbl;
|
|
int mtype;
|
|
{
|
|
|
|
free(hashtbl, mtype);
|
|
}
|
|
|
|
|
|
static void *
|
|
hook_establish(list, fn, arg)
|
|
hook_list_t *list;
|
|
void (*fn) __P((void *));
|
|
void *arg;
|
|
{
|
|
struct hook_desc *hd;
|
|
|
|
hd = malloc(sizeof(*hd), M_DEVBUF, M_NOWAIT);
|
|
if (hd == NULL)
|
|
return (NULL);
|
|
|
|
hd->hk_fn = fn;
|
|
hd->hk_arg = arg;
|
|
LIST_INSERT_HEAD(list, hd, hk_list);
|
|
|
|
return (hd);
|
|
}
|
|
|
|
static void
|
|
hook_disestablish(list, vhook)
|
|
hook_list_t *list;
|
|
void *vhook;
|
|
{
|
|
#ifdef DIAGNOSTIC
|
|
struct hook_desc *hd;
|
|
|
|
LIST_FOREACH(hd, list, hk_list) {
|
|
if (hd == vhook)
|
|
break;
|
|
}
|
|
|
|
if (hd == NULL)
|
|
panic("hook_disestablish: hook %p not established", vhook);
|
|
#endif
|
|
LIST_REMOVE((struct hook_desc *)vhook, hk_list);
|
|
free(vhook, M_DEVBUF);
|
|
}
|
|
|
|
static void
|
|
hook_destroy(list)
|
|
hook_list_t *list;
|
|
{
|
|
struct hook_desc *hd;
|
|
|
|
while ((hd = LIST_FIRST(list)) != NULL) {
|
|
LIST_REMOVE(hd, hk_list);
|
|
free(hd, M_DEVBUF);
|
|
}
|
|
}
|
|
|
|
static void
|
|
hook_proc_run(list, p)
|
|
hook_list_t *list;
|
|
struct proc *p;
|
|
{
|
|
struct hook_desc *hd;
|
|
|
|
for (hd = LIST_FIRST(list); hd != NULL; hd = LIST_NEXT(hd, hk_list)) {
|
|
((void (*) __P((struct proc *, void *)))*hd->hk_fn)(p,
|
|
hd->hk_arg);
|
|
}
|
|
}
|
|
|
|
/*
|
|
* "Shutdown hook" types, functions, and variables.
|
|
*
|
|
* Should be invoked immediately before the
|
|
* system is halted or rebooted, i.e. after file systems unmounted,
|
|
* after crash dump done, etc.
|
|
*
|
|
* Each shutdown hook is removed from the list before it's run, so that
|
|
* it won't be run again.
|
|
*/
|
|
|
|
hook_list_t shutdownhook_list;
|
|
|
|
void *
|
|
shutdownhook_establish(fn, arg)
|
|
void (*fn) __P((void *));
|
|
void *arg;
|
|
{
|
|
return hook_establish(&shutdownhook_list, fn, arg);
|
|
}
|
|
|
|
void
|
|
shutdownhook_disestablish(vhook)
|
|
void *vhook;
|
|
{
|
|
hook_disestablish(&shutdownhook_list, vhook);
|
|
}
|
|
|
|
/*
|
|
* Run shutdown hooks. Should be invoked immediately before the
|
|
* system is halted or rebooted, i.e. after file systems unmounted,
|
|
* after crash dump done, etc.
|
|
*
|
|
* Each shutdown hook is removed from the list before it's run, so that
|
|
* it won't be run again.
|
|
*/
|
|
void
|
|
doshutdownhooks()
|
|
{
|
|
struct hook_desc *dp;
|
|
|
|
while ((dp = LIST_FIRST(&shutdownhook_list)) != NULL) {
|
|
LIST_REMOVE(dp, hk_list);
|
|
(*dp->hk_fn)(dp->hk_arg);
|
|
#if 0
|
|
/*
|
|
* Don't bother freeing the hook structure,, since we may
|
|
* be rebooting because of a memory corruption problem,
|
|
* and this might only make things worse. It doesn't
|
|
* matter, anyway, since the system is just about to
|
|
* reboot.
|
|
*/
|
|
free(dp, M_DEVBUF);
|
|
#endif
|
|
}
|
|
}
|
|
|
|
/*
|
|
* "Mountroot hook" types, functions, and variables.
|
|
*/
|
|
|
|
hook_list_t mountroothook_list;
|
|
|
|
void *
|
|
mountroothook_establish(fn, dev)
|
|
void (*fn) __P((struct device *));
|
|
struct device *dev;
|
|
{
|
|
return hook_establish(&mountroothook_list, (void (*)__P((void *)))fn,
|
|
dev);
|
|
}
|
|
|
|
void
|
|
mountroothook_disestablish(vhook)
|
|
void *vhook;
|
|
{
|
|
hook_disestablish(&mountroothook_list, vhook);
|
|
}
|
|
|
|
void
|
|
mountroothook_destroy()
|
|
{
|
|
hook_destroy(&mountroothook_list);
|
|
}
|
|
|
|
void
|
|
domountroothook()
|
|
{
|
|
struct hook_desc *hd;
|
|
|
|
LIST_FOREACH(hd, &mountroothook_list, hk_list) {
|
|
if (hd->hk_arg == (void *)root_device) {
|
|
(*hd->hk_fn)(hd->hk_arg);
|
|
return;
|
|
}
|
|
}
|
|
}
|
|
|
|
hook_list_t exechook_list;
|
|
|
|
void *
|
|
exechook_establish(fn, arg)
|
|
void (*fn) __P((struct proc *, void *));
|
|
void *arg;
|
|
{
|
|
return hook_establish(&exechook_list, (void (*) __P((void *)))fn, arg);
|
|
}
|
|
|
|
void
|
|
exechook_disestablish(vhook)
|
|
void *vhook;
|
|
{
|
|
hook_disestablish(&exechook_list, vhook);
|
|
}
|
|
|
|
/*
|
|
* Run exec hooks.
|
|
*/
|
|
void
|
|
doexechooks(p)
|
|
struct proc *p;
|
|
{
|
|
hook_proc_run(&exechook_list, p);
|
|
}
|
|
|
|
hook_list_t exithook_list;
|
|
|
|
void *
|
|
exithook_establish(fn, arg)
|
|
void (*fn) __P((struct proc *, void *));
|
|
void *arg;
|
|
{
|
|
return hook_establish(&exithook_list, (void (*) __P((void *)))fn, arg);
|
|
}
|
|
|
|
void
|
|
exithook_disestablish(vhook)
|
|
void *vhook;
|
|
{
|
|
hook_disestablish(&exithook_list, vhook);
|
|
}
|
|
|
|
/*
|
|
* Run exit hooks.
|
|
*/
|
|
void
|
|
doexithooks(p)
|
|
struct proc *p;
|
|
{
|
|
hook_proc_run(&exithook_list, p);
|
|
}
|
|
|
|
/*
|
|
* "Power hook" types, functions, and variables.
|
|
* The list of power hooks is kept ordered with the last registered hook
|
|
* first.
|
|
* When running the hooks on power down the hooks are called in reverse
|
|
* registration order, when powering up in registration order.
|
|
*/
|
|
struct powerhook_desc {
|
|
CIRCLEQ_ENTRY(powerhook_desc) sfd_list;
|
|
void (*sfd_fn) __P((int, void *));
|
|
void *sfd_arg;
|
|
};
|
|
|
|
CIRCLEQ_HEAD(, powerhook_desc) powerhook_list =
|
|
CIRCLEQ_HEAD_INITIALIZER(powerhook_list);
|
|
|
|
void *
|
|
powerhook_establish(fn, arg)
|
|
void (*fn) __P((int, void *));
|
|
void *arg;
|
|
{
|
|
struct powerhook_desc *ndp;
|
|
|
|
ndp = (struct powerhook_desc *)
|
|
malloc(sizeof(*ndp), M_DEVBUF, M_NOWAIT);
|
|
if (ndp == NULL)
|
|
return (NULL);
|
|
|
|
ndp->sfd_fn = fn;
|
|
ndp->sfd_arg = arg;
|
|
CIRCLEQ_INSERT_HEAD(&powerhook_list, ndp, sfd_list);
|
|
|
|
return (ndp);
|
|
}
|
|
|
|
void
|
|
powerhook_disestablish(vhook)
|
|
void *vhook;
|
|
{
|
|
#ifdef DIAGNOSTIC
|
|
struct powerhook_desc *dp;
|
|
|
|
CIRCLEQ_FOREACH(dp, &powerhook_list, sfd_list)
|
|
if (dp == vhook)
|
|
goto found;
|
|
panic("powerhook_disestablish: hook %p not established", vhook);
|
|
found:
|
|
#endif
|
|
|
|
CIRCLEQ_REMOVE(&powerhook_list, (struct powerhook_desc *)vhook,
|
|
sfd_list);
|
|
free(vhook, M_DEVBUF);
|
|
}
|
|
|
|
/*
|
|
* Run power hooks.
|
|
*/
|
|
void
|
|
dopowerhooks(why)
|
|
int why;
|
|
{
|
|
struct powerhook_desc *dp;
|
|
|
|
if (why == PWR_RESUME || why == PWR_SOFTRESUME) {
|
|
CIRCLEQ_FOREACH_REVERSE(dp, &powerhook_list, sfd_list) {
|
|
(*dp->sfd_fn)(why, dp->sfd_arg);
|
|
}
|
|
} else {
|
|
CIRCLEQ_FOREACH(dp, &powerhook_list, sfd_list) {
|
|
(*dp->sfd_fn)(why, dp->sfd_arg);
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Determine the root device and, if instructed to, the root file system.
|
|
*/
|
|
|
|
#include "md.h"
|
|
#if NMD == 0
|
|
#undef MEMORY_DISK_HOOKS
|
|
#endif
|
|
|
|
#ifdef MEMORY_DISK_HOOKS
|
|
static struct device fakemdrootdev[NMD];
|
|
#endif
|
|
|
|
#include "raid.h"
|
|
#if NRAID == 1
|
|
#define BOOT_FROM_RAID_HOOKS 1
|
|
#endif
|
|
|
|
#ifdef BOOT_FROM_RAID_HOOKS
|
|
extern int numraid;
|
|
extern struct device *raidrootdev;
|
|
#endif
|
|
|
|
void
|
|
setroot(bootdv, bootpartition)
|
|
struct device *bootdv;
|
|
int bootpartition;
|
|
{
|
|
struct device *dv;
|
|
int len;
|
|
#ifdef MEMORY_DISK_HOOKS
|
|
int i;
|
|
#endif
|
|
dev_t nrootdev;
|
|
dev_t ndumpdev = NODEV;
|
|
char buf[128];
|
|
const char *rootdevname;
|
|
const char *dumpdevname;
|
|
struct device *rootdv = NULL; /* XXX gcc -Wuninitialized */
|
|
struct device *dumpdv = NULL;
|
|
struct ifnet *ifp;
|
|
const char *deffsname;
|
|
struct vfsops *vops;
|
|
|
|
#ifdef MEMORY_DISK_HOOKS
|
|
for (i = 0; i < NMD; i++) {
|
|
fakemdrootdev[i].dv_class = DV_DISK;
|
|
fakemdrootdev[i].dv_cfdata = NULL;
|
|
fakemdrootdev[i].dv_unit = i;
|
|
fakemdrootdev[i].dv_parent = NULL;
|
|
sprintf(fakemdrootdev[i].dv_xname, "md%d", i);
|
|
}
|
|
#endif /* MEMORY_DISK_HOOKS */
|
|
|
|
#ifdef MEMORY_DISK_IS_ROOT
|
|
bootdv = &fakemdrootdev[0];
|
|
bootpartition = 0;
|
|
#endif
|
|
|
|
/*
|
|
* If NFS is specified as the file system, and we found
|
|
* a DV_DISK boot device (or no boot device at all), then
|
|
* find a reasonable network interface for "rootspec".
|
|
*/
|
|
vops = vfs_getopsbyname("nfs");
|
|
if (vops != NULL && vops->vfs_mountroot == mountroot &&
|
|
rootspec == NULL &&
|
|
(bootdv == NULL || bootdv->dv_class != DV_IFNET)) {
|
|
TAILQ_FOREACH(ifp, &ifnet, if_list) {
|
|
if ((ifp->if_flags &
|
|
(IFF_LOOPBACK|IFF_POINTOPOINT)) == 0)
|
|
break;
|
|
}
|
|
if (ifp == NULL) {
|
|
/*
|
|
* Can't find a suitable interface; ask the
|
|
* user.
|
|
*/
|
|
boothowto |= RB_ASKNAME;
|
|
} else {
|
|
/*
|
|
* Have a suitable interface; behave as if
|
|
* the user specified this interface.
|
|
*/
|
|
rootspec = (const char *)ifp->if_xname;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* If wildcarded root and we the boot device wasn't determined,
|
|
* ask the user.
|
|
*/
|
|
if (rootspec == NULL && bootdv == NULL)
|
|
boothowto |= RB_ASKNAME;
|
|
|
|
top:
|
|
if (boothowto & RB_ASKNAME) {
|
|
struct device *defdumpdv;
|
|
|
|
for (;;) {
|
|
printf("root device");
|
|
if (bootdv != NULL) {
|
|
printf(" (default %s", bootdv->dv_xname);
|
|
if (bootdv->dv_class == DV_DISK)
|
|
printf("%c", bootpartition + 'a');
|
|
printf(")");
|
|
}
|
|
printf(": ");
|
|
len = cngetsn(buf, sizeof(buf));
|
|
if (len == 0 && bootdv != NULL) {
|
|
strcpy(buf, bootdv->dv_xname);
|
|
len = strlen(buf);
|
|
}
|
|
if (len > 0 && buf[len - 1] == '*') {
|
|
buf[--len] = '\0';
|
|
dv = getdisk(buf, len, 1, &nrootdev, 0);
|
|
if (dv != NULL) {
|
|
rootdv = dv;
|
|
break;
|
|
}
|
|
}
|
|
dv = getdisk(buf, len, bootpartition, &nrootdev, 0);
|
|
if (dv != NULL) {
|
|
rootdv = dv;
|
|
break;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Set up the default dump device. If root is on
|
|
* a network device, there is no default dump
|
|
* device, since we don't support dumps to the
|
|
* network.
|
|
*/
|
|
if (rootdv->dv_class == DV_IFNET)
|
|
defdumpdv = NULL;
|
|
else
|
|
defdumpdv = rootdv;
|
|
|
|
for (;;) {
|
|
printf("dump device");
|
|
if (defdumpdv != NULL) {
|
|
/*
|
|
* Note, we know it's a disk if we get here.
|
|
*/
|
|
printf(" (default %sb)", defdumpdv->dv_xname);
|
|
}
|
|
printf(": ");
|
|
len = cngetsn(buf, sizeof(buf));
|
|
if (len == 0) {
|
|
if (defdumpdv != NULL) {
|
|
ndumpdev = MAKEDISKDEV(major(nrootdev),
|
|
DISKUNIT(nrootdev), 1);
|
|
}
|
|
dumpdv = defdumpdv;
|
|
break;
|
|
}
|
|
if (len == 4 && strcmp(buf, "none") == 0) {
|
|
dumpdv = NULL;
|
|
break;
|
|
}
|
|
dv = getdisk(buf, len, 1, &ndumpdev, 1);
|
|
if (dv != NULL) {
|
|
dumpdv = dv;
|
|
break;
|
|
}
|
|
}
|
|
|
|
rootdev = nrootdev;
|
|
dumpdev = ndumpdev;
|
|
|
|
for (vops = LIST_FIRST(&vfs_list); vops != NULL;
|
|
vops = LIST_NEXT(vops, vfs_list)) {
|
|
if (vops->vfs_mountroot != NULL &&
|
|
vops->vfs_mountroot == mountroot)
|
|
break;
|
|
}
|
|
|
|
if (vops == NULL) {
|
|
mountroot = NULL;
|
|
deffsname = "generic";
|
|
} else
|
|
deffsname = vops->vfs_name;
|
|
|
|
for (;;) {
|
|
printf("file system (default %s): ", deffsname);
|
|
len = cngetsn(buf, sizeof(buf));
|
|
if (len == 0)
|
|
break;
|
|
if (len == 4 && strcmp(buf, "halt") == 0)
|
|
cpu_reboot(RB_HALT, NULL);
|
|
else if (len == 6 && strcmp(buf, "reboot") == 0)
|
|
cpu_reboot(0, NULL);
|
|
#if defined(DDB)
|
|
else if (len == 3 && strcmp(buf, "ddb") == 0) {
|
|
console_debugger();
|
|
}
|
|
#endif
|
|
else if (len == 7 && strcmp(buf, "generic") == 0) {
|
|
mountroot = NULL;
|
|
break;
|
|
}
|
|
vops = vfs_getopsbyname(buf);
|
|
if (vops == NULL || vops->vfs_mountroot == NULL) {
|
|
printf("use one of: generic");
|
|
for (vops = LIST_FIRST(&vfs_list);
|
|
vops != NULL;
|
|
vops = LIST_NEXT(vops, vfs_list)) {
|
|
if (vops->vfs_mountroot != NULL)
|
|
printf(" %s", vops->vfs_name);
|
|
}
|
|
#if defined(DDB)
|
|
printf(" ddb");
|
|
#endif
|
|
printf(" halt reboot\n");
|
|
} else {
|
|
mountroot = vops->vfs_mountroot;
|
|
break;
|
|
}
|
|
}
|
|
|
|
} else if (rootspec == NULL) {
|
|
int majdev;
|
|
|
|
/*
|
|
* Wildcarded root; use the boot device.
|
|
*/
|
|
rootdv = bootdv;
|
|
|
|
majdev = devsw_name2blk(bootdv->dv_xname, NULL, 0);
|
|
if (majdev >= 0) {
|
|
/*
|
|
* Root is on a disk. `bootpartition' is root.
|
|
*/
|
|
rootdev = MAKEDISKDEV(majdev, bootdv->dv_unit,
|
|
bootpartition);
|
|
}
|
|
} else {
|
|
|
|
/*
|
|
* `root on <dev> ...'
|
|
*/
|
|
|
|
/*
|
|
* If it's a network interface, we can bail out
|
|
* early.
|
|
*/
|
|
dv = finddevice(rootspec);
|
|
if (dv != NULL && dv->dv_class == DV_IFNET) {
|
|
rootdv = dv;
|
|
goto haveroot;
|
|
}
|
|
|
|
rootdevname = devsw_blk2name(major(rootdev));
|
|
if (rootdevname == NULL) {
|
|
printf("unknown device major 0x%x\n", rootdev);
|
|
boothowto |= RB_ASKNAME;
|
|
goto top;
|
|
}
|
|
memset(buf, 0, sizeof(buf));
|
|
sprintf(buf, "%s%d", rootdevname, DISKUNIT(rootdev));
|
|
|
|
rootdv = finddevice(buf);
|
|
if (rootdv == NULL) {
|
|
printf("device %s (0x%x) not configured\n",
|
|
buf, rootdev);
|
|
boothowto |= RB_ASKNAME;
|
|
goto top;
|
|
}
|
|
}
|
|
|
|
haveroot:
|
|
|
|
root_device = rootdv;
|
|
|
|
switch (rootdv->dv_class) {
|
|
case DV_IFNET:
|
|
printf("root on %s", rootdv->dv_xname);
|
|
break;
|
|
|
|
case DV_DISK:
|
|
printf("root on %s%c", rootdv->dv_xname,
|
|
DISKPART(rootdev) + 'a');
|
|
break;
|
|
|
|
default:
|
|
printf("can't determine root device\n");
|
|
boothowto |= RB_ASKNAME;
|
|
goto top;
|
|
}
|
|
|
|
/*
|
|
* Now configure the dump device.
|
|
*
|
|
* If we haven't figured out the dump device, do so, with
|
|
* the following rules:
|
|
*
|
|
* (a) We already know dumpdv in the RB_ASKNAME case.
|
|
*
|
|
* (b) If dumpspec is set, try to use it. If the device
|
|
* is not available, punt.
|
|
*
|
|
* (c) If dumpspec is not set, the dump device is
|
|
* wildcarded or unspecified. If the root device
|
|
* is DV_IFNET, punt. Otherwise, use partition b
|
|
* of the root device.
|
|
*/
|
|
|
|
if (boothowto & RB_ASKNAME) { /* (a) */
|
|
if (dumpdv == NULL)
|
|
goto nodumpdev;
|
|
} else if (dumpspec != NULL) { /* (b) */
|
|
if (strcmp(dumpspec, "none") == 0 || dumpdev == NODEV) {
|
|
/*
|
|
* Operator doesn't want a dump device.
|
|
* Or looks like they tried to pick a network
|
|
* device. Oops.
|
|
*/
|
|
goto nodumpdev;
|
|
}
|
|
|
|
dumpdevname = devsw_blk2name(major(dumpdev));
|
|
if (dumpdevname == NULL)
|
|
goto nodumpdev;
|
|
memset(buf, 0, sizeof(buf));
|
|
sprintf(buf, "%s%d", dumpdevname, DISKUNIT(dumpdev));
|
|
|
|
dumpdv = finddevice(buf);
|
|
if (dumpdv == NULL) {
|
|
/*
|
|
* Device not configured.
|
|
*/
|
|
goto nodumpdev;
|
|
}
|
|
} else { /* (c) */
|
|
if (rootdv->dv_class == DV_IFNET)
|
|
goto nodumpdev;
|
|
else {
|
|
dumpdv = rootdv;
|
|
dumpdev = MAKEDISKDEV(major(rootdev),
|
|
dumpdv->dv_unit, 1);
|
|
}
|
|
}
|
|
|
|
printf(" dumps on %s%c\n", dumpdv->dv_xname, DISKPART(dumpdev) + 'a');
|
|
return;
|
|
|
|
nodumpdev:
|
|
dumpdev = NODEV;
|
|
printf("\n");
|
|
}
|
|
|
|
static struct device *
|
|
finddevice(name)
|
|
const char *name;
|
|
{
|
|
struct device *dv;
|
|
#ifdef BOOT_FROM_RAID_HOOKS
|
|
int j;
|
|
|
|
for (j = 0; j < numraid; j++) {
|
|
if (strcmp(name, raidrootdev[j].dv_xname) == 0) {
|
|
dv = &raidrootdev[j];
|
|
return (dv);
|
|
}
|
|
}
|
|
#endif
|
|
|
|
for (dv = TAILQ_FIRST(&alldevs); dv != NULL;
|
|
dv = TAILQ_NEXT(dv, dv_list))
|
|
if (strcmp(dv->dv_xname, name) == 0)
|
|
break;
|
|
return (dv);
|
|
}
|
|
|
|
static struct device *
|
|
getdisk(str, len, defpart, devp, isdump)
|
|
char *str;
|
|
int len, defpart;
|
|
dev_t *devp;
|
|
int isdump;
|
|
{
|
|
struct device *dv;
|
|
#ifdef MEMORY_DISK_HOOKS
|
|
int i;
|
|
#endif
|
|
#ifdef BOOT_FROM_RAID_HOOKS
|
|
int j;
|
|
#endif
|
|
|
|
if ((dv = parsedisk(str, len, defpart, devp)) == NULL) {
|
|
printf("use one of:");
|
|
#ifdef MEMORY_DISK_HOOKS
|
|
if (isdump == 0)
|
|
for (i = 0; i < NMD; i++)
|
|
printf(" %s[a-%c]", fakemdrootdev[i].dv_xname,
|
|
'a' + MAXPARTITIONS - 1);
|
|
#endif
|
|
#ifdef BOOT_FROM_RAID_HOOKS
|
|
if (isdump == 0)
|
|
for (j = 0; j < numraid; j++)
|
|
printf(" %s[a-%c]", raidrootdev[j].dv_xname,
|
|
'a' + MAXPARTITIONS - 1);
|
|
#endif
|
|
TAILQ_FOREACH(dv, &alldevs, dv_list) {
|
|
if (dv->dv_class == DV_DISK)
|
|
printf(" %s[a-%c]", dv->dv_xname,
|
|
'a' + MAXPARTITIONS - 1);
|
|
if (isdump == 0 && dv->dv_class == DV_IFNET)
|
|
printf(" %s", dv->dv_xname);
|
|
}
|
|
if (isdump)
|
|
printf(" none");
|
|
#if defined(DDB)
|
|
printf(" ddb");
|
|
#endif
|
|
printf(" halt reboot\n");
|
|
}
|
|
return (dv);
|
|
}
|
|
|
|
static struct device *
|
|
parsedisk(str, len, defpart, devp)
|
|
char *str;
|
|
int len, defpart;
|
|
dev_t *devp;
|
|
{
|
|
struct device *dv;
|
|
char *cp, c;
|
|
int majdev, part;
|
|
#ifdef MEMORY_DISK_HOOKS
|
|
int i;
|
|
#endif
|
|
if (len == 0)
|
|
return (NULL);
|
|
|
|
if (len == 4 && strcmp(str, "halt") == 0)
|
|
cpu_reboot(RB_HALT, NULL);
|
|
else if (len == 6 && strcmp(str, "reboot") == 0)
|
|
cpu_reboot(0, NULL);
|
|
#if defined(DDB)
|
|
else if (len == 3 && strcmp(str, "ddb") == 0)
|
|
console_debugger();
|
|
#endif
|
|
|
|
cp = str + len - 1;
|
|
c = *cp;
|
|
if (c >= 'a' && c <= ('a' + MAXPARTITIONS - 1)) {
|
|
part = c - 'a';
|
|
*cp = '\0';
|
|
} else
|
|
part = defpart;
|
|
|
|
#ifdef MEMORY_DISK_HOOKS
|
|
for (i = 0; i < NMD; i++)
|
|
if (strcmp(str, fakemdrootdev[i].dv_xname) == 0) {
|
|
dv = &fakemdrootdev[i];
|
|
goto gotdisk;
|
|
}
|
|
#endif
|
|
|
|
dv = finddevice(str);
|
|
if (dv != NULL) {
|
|
if (dv->dv_class == DV_DISK) {
|
|
#ifdef MEMORY_DISK_HOOKS
|
|
gotdisk:
|
|
#endif
|
|
majdev = devsw_name2blk(dv->dv_xname, NULL, 0);
|
|
if (majdev < 0)
|
|
panic("parsedisk");
|
|
*devp = MAKEDISKDEV(majdev, dv->dv_unit, part);
|
|
}
|
|
|
|
if (dv->dv_class == DV_IFNET)
|
|
*devp = NODEV;
|
|
}
|
|
|
|
*cp = c;
|
|
return (dv);
|
|
}
|
|
|
|
/*
|
|
* snprintf() `bytes' into `buf', reformatting it so that the number,
|
|
* plus a possible `x' + suffix extension) fits into len bytes (including
|
|
* the terminating NUL).
|
|
* Returns the number of bytes stored in buf, or -1 if there was a problem.
|
|
* E.g, given a len of 9 and a suffix of `B':
|
|
* bytes result
|
|
* ----- ------
|
|
* 99999 `99999 B'
|
|
* 100000 `97 kB'
|
|
* 66715648 `65152 kB'
|
|
* 252215296 `240 MB'
|
|
*/
|
|
int
|
|
humanize_number(buf, len, bytes, suffix, divisor)
|
|
char *buf;
|
|
size_t len;
|
|
u_int64_t bytes;
|
|
const char *suffix;
|
|
int divisor;
|
|
{
|
|
/* prefixes are: (none), kilo, Mega, Giga, Tera, Peta, Exa */
|
|
const char *prefixes;
|
|
int r;
|
|
u_int64_t max;
|
|
size_t i, suffixlen;
|
|
|
|
if (buf == NULL || suffix == NULL)
|
|
return (-1);
|
|
if (len > 0)
|
|
buf[0] = '\0';
|
|
suffixlen = strlen(suffix);
|
|
/* check if enough room for `x y' + suffix + `\0' */
|
|
if (len < 4 + suffixlen)
|
|
return (-1);
|
|
|
|
if (divisor == 1024) {
|
|
/*
|
|
* binary multiplies
|
|
* XXX IEC 60027-2 recommends Ki, Mi, Gi...
|
|
*/
|
|
prefixes = " KMGTPE";
|
|
} else
|
|
prefixes = " kMGTPE"; /* SI for decimal multiplies */
|
|
|
|
max = 1;
|
|
for (i = 0; i < len - suffixlen - 3; i++)
|
|
max *= 10;
|
|
for (i = 0; bytes >= max && prefixes[i + 1]; i++)
|
|
bytes /= divisor;
|
|
|
|
r = snprintf(buf, len, "%qu%s%c%s", (unsigned long long)bytes,
|
|
i == 0 ? "" : " ", prefixes[i], suffix);
|
|
|
|
return (r);
|
|
}
|
|
|
|
int
|
|
format_bytes(buf, len, bytes)
|
|
char *buf;
|
|
size_t len;
|
|
u_int64_t bytes;
|
|
{
|
|
int rv;
|
|
size_t nlen;
|
|
|
|
rv = humanize_number(buf, len, bytes, "B", 1024);
|
|
if (rv != -1) {
|
|
/* nuke the trailing ` B' if it exists */
|
|
nlen = strlen(buf) - 2;
|
|
if (strcmp(&buf[nlen], " B") == 0)
|
|
buf[nlen] = '\0';
|
|
}
|
|
return (rv);
|
|
}
|
|
|
|
int
|
|
trace_enter(struct proc *p, register_t code, void *args, register_t rval[])
|
|
{
|
|
#ifdef SYSCALL_DEBUG
|
|
scdebug_call(p, code, args);
|
|
#endif /* SYSCALL_DEBUG */
|
|
|
|
#ifdef KTRACE
|
|
if (KTRPOINT(p, KTR_SYSCALL))
|
|
ktrsyscall(p, code, args);
|
|
#endif /* KTRACE */
|
|
|
|
#ifdef SYSTRACE
|
|
if (ISSET(p->p_flag, P_SYSTRACE))
|
|
return systrace_enter(p, code, args, rval);
|
|
#endif
|
|
return 0;
|
|
}
|
|
|
|
void
|
|
trace_exit(struct proc *p, register_t code, void *args, register_t rval[],
|
|
int error)
|
|
{
|
|
#ifdef SYSCALL_DEBUG
|
|
scdebug_ret(p, code, error, rval);
|
|
#endif /* SYSCALL_DEBUG */
|
|
|
|
#ifdef KTRACE
|
|
if (KTRPOINT(p, KTR_SYSRET)) {
|
|
KERNEL_PROC_LOCK(p);
|
|
ktrsysret(p, code, error, rval[0]);
|
|
KERNEL_PROC_UNLOCK(p);
|
|
}
|
|
#endif /* KTRACE */
|
|
|
|
#ifdef SYSTRACE
|
|
if (ISSET(p->p_flag, P_SYSTRACE))
|
|
systrace_exit(p, code, args, rval, error);
|
|
#endif
|
|
}
|