//==========================================================================
|
//==========================================================================
|
//
|
//
|
// sys/kern/kern_subr.c
|
// sys/kern/kern_subr.c
|
//
|
//
|
//
|
//
|
//
|
//
|
//==========================================================================
|
//==========================================================================
|
//####BSDCOPYRIGHTBEGIN####
|
//####BSDCOPYRIGHTBEGIN####
|
//
|
//
|
// -------------------------------------------
|
// -------------------------------------------
|
//
|
//
|
// Portions of this software may have been derived from OpenBSD or other sources,
|
// Portions of this software may have been derived from OpenBSD or other sources,
|
// and are covered by the appropriate copyright disclaimers included herein.
|
// and are covered by the appropriate copyright disclaimers included herein.
|
//
|
//
|
// -------------------------------------------
|
// -------------------------------------------
|
//
|
//
|
//####BSDCOPYRIGHTEND####
|
//####BSDCOPYRIGHTEND####
|
//==========================================================================
|
//==========================================================================
|
//#####DESCRIPTIONBEGIN####
|
//#####DESCRIPTIONBEGIN####
|
//
|
//
|
// Author(s): gthomas
|
// Author(s): gthomas
|
// Contributors: gthomas
|
// Contributors: gthomas
|
// Date: 2000-01-10
|
// Date: 2000-01-10
|
// Purpose:
|
// Purpose:
|
// Description:
|
// Description:
|
//
|
//
|
//
|
//
|
//####DESCRIPTIONEND####
|
//####DESCRIPTIONEND####
|
//
|
//
|
//==========================================================================
|
//==========================================================================
|
|
|
|
|
/* $OpenBSD: kern_subr.c,v 1.10 1999/11/07 17:39:14 provos Exp $ */
|
/* $OpenBSD: kern_subr.c,v 1.10 1999/11/07 17:39:14 provos Exp $ */
|
/* $NetBSD: kern_subr.c,v 1.15 1996/04/09 17:21:56 ragge Exp $ */
|
/* $NetBSD: kern_subr.c,v 1.15 1996/04/09 17:21:56 ragge Exp $ */
|
|
|
/*
|
/*
|
* Copyright (c) 1982, 1986, 1991, 1993
|
* Copyright (c) 1982, 1986, 1991, 1993
|
* The Regents of the University of California. All rights reserved.
|
* The Regents of the University of California. All rights reserved.
|
* (c) UNIX System Laboratories, Inc.
|
* (c) UNIX System Laboratories, Inc.
|
* All or some portions of this file are derived from material licensed
|
* All or some portions of this file are derived from material licensed
|
* to the University of California by American Telephone and Telegraph
|
* to the University of California by American Telephone and Telegraph
|
* Co. or Unix System Laboratories, Inc. and are reproduced herein with
|
* Co. or Unix System Laboratories, Inc. and are reproduced herein with
|
* the permission of UNIX System Laboratories, Inc.
|
* the permission of UNIX System Laboratories, Inc.
|
*
|
*
|
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
* modification, are permitted provided that the following conditions
|
* modification, are permitted provided that the following conditions
|
* are met:
|
* are met:
|
* 1. Redistributions of source code must retain the above copyright
|
* 1. Redistributions of source code must retain the above copyright
|
* notice, this list of conditions and the following disclaimer.
|
* notice, this list of conditions and the following disclaimer.
|
* 2. Redistributions in binary form must reproduce the above copyright
|
* 2. Redistributions in binary form must reproduce the above copyright
|
* notice, this list of conditions and the following disclaimer in the
|
* notice, this list of conditions and the following disclaimer in the
|
* documentation and/or other materials provided with the distribution.
|
* documentation and/or other materials provided with the distribution.
|
* 3. All advertising materials mentioning features or use of this software
|
* 3. All advertising materials mentioning features or use of this software
|
* must display the following acknowledgement:
|
* must display the following acknowledgement:
|
* This product includes software developed by the University of
|
* This product includes software developed by the University of
|
* California, Berkeley and its contributors.
|
* California, Berkeley and its contributors.
|
* 4. Neither the name of the University nor the names of 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
|
* may be used to endorse or promote products derived from this software
|
* without specific prior written permission.
|
* without specific prior written permission.
|
*
|
*
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
* 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
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
* SUCH DAMAGE.
|
* SUCH DAMAGE.
|
*
|
*
|
* @(#)kern_subr.c 8.3 (Berkeley) 1/21/94
|
* @(#)kern_subr.c 8.3 (Berkeley) 1/21/94
|
*/
|
*/
|
|
|
#include <sys/param.h>
|
#include <sys/param.h>
|
#ifndef __ECOS
|
#ifndef __ECOS
|
#include <sys/systm.h>
|
#include <sys/systm.h>
|
#include <sys/proc.h>
|
#include <sys/proc.h>
|
#endif // __ECOS
|
#endif // __ECOS
|
#include <sys/malloc.h>
|
#include <sys/malloc.h>
|
#include <sys/queue.h>
|
#include <sys/queue.h>
|
|
|
int
|
int
|
uiomove(cp, n, uio)
|
uiomove(cp, n, uio)
|
register caddr_t cp;
|
register caddr_t cp;
|
register int n;
|
register int n;
|
register struct uio *uio;
|
register struct uio *uio;
|
{
|
{
|
register struct iovec *iov;
|
register struct iovec *iov;
|
u_int cnt;
|
u_int cnt;
|
int error = 0;
|
int error = 0;
|
|
|
#ifdef DIAGNOSTIC
|
#ifdef DIAGNOSTIC
|
if (uio->uio_rw != UIO_READ && uio->uio_rw != UIO_WRITE)
|
if (uio->uio_rw != UIO_READ && uio->uio_rw != UIO_WRITE)
|
panic("uiomove: mode");
|
panic("uiomove: mode");
|
if (uio->uio_segflg == UIO_USERSPACE && uio->uio_procp != curproc)
|
if (uio->uio_segflg == UIO_USERSPACE && uio->uio_procp != curproc)
|
panic("uiomove proc");
|
panic("uiomove proc");
|
#endif
|
#endif
|
while (n > 0 && uio->uio_resid) {
|
while (n > 0 && uio->uio_resid) {
|
iov = uio->uio_iov;
|
iov = uio->uio_iov;
|
cnt = iov->iov_len;
|
cnt = iov->iov_len;
|
if (cnt == 0) {
|
if (cnt == 0) {
|
uio->uio_iov++;
|
uio->uio_iov++;
|
uio->uio_iovcnt--;
|
uio->uio_iovcnt--;
|
continue;
|
continue;
|
}
|
}
|
if (cnt > n)
|
if (cnt > n)
|
cnt = n;
|
cnt = n;
|
switch (uio->uio_segflg) {
|
switch (uio->uio_segflg) {
|
|
|
case UIO_USERSPACE:
|
case UIO_USERSPACE:
|
if (uio->uio_rw == UIO_READ)
|
if (uio->uio_rw == UIO_READ)
|
error = copyout(cp, iov->iov_base, cnt);
|
error = copyout(cp, iov->iov_base, cnt);
|
else
|
else
|
error = copyin(iov->iov_base, cp, cnt);
|
error = copyin(iov->iov_base, cp, cnt);
|
if (error)
|
if (error)
|
return (error);
|
return (error);
|
break;
|
break;
|
|
|
case UIO_SYSSPACE:
|
case UIO_SYSSPACE:
|
#if defined(UVM)
|
#if defined(UVM)
|
if (uio->uio_rw == UIO_READ)
|
if (uio->uio_rw == UIO_READ)
|
error = kcopy(cp, iov->iov_base, cnt);
|
error = kcopy(cp, iov->iov_base, cnt);
|
else
|
else
|
error = kcopy(iov->iov_base, cp, cnt);
|
error = kcopy(iov->iov_base, cp, cnt);
|
if (error)
|
if (error)
|
return(error);
|
return(error);
|
#else
|
#else
|
if (uio->uio_rw == UIO_READ)
|
if (uio->uio_rw == UIO_READ)
|
bcopy((caddr_t)cp, iov->iov_base, cnt);
|
bcopy((caddr_t)cp, iov->iov_base, cnt);
|
else
|
else
|
bcopy(iov->iov_base, (caddr_t)cp, cnt);
|
bcopy(iov->iov_base, (caddr_t)cp, cnt);
|
break;
|
break;
|
#endif
|
#endif
|
}
|
}
|
(char *)(iov->iov_base) += cnt;
|
(char *)(iov->iov_base) += cnt;
|
iov->iov_len -= cnt;
|
iov->iov_len -= cnt;
|
uio->uio_resid -= cnt;
|
uio->uio_resid -= cnt;
|
uio->uio_offset += cnt;
|
uio->uio_offset += cnt;
|
cp += cnt;
|
cp += cnt;
|
n -= cnt;
|
n -= cnt;
|
}
|
}
|
return (error);
|
return (error);
|
}
|
}
|
|
|
#ifndef __ECOS
|
#ifndef __ECOS
|
/*
|
/*
|
* Give next character to user as result of read.
|
* Give next character to user as result of read.
|
*/
|
*/
|
int
|
int
|
ureadc(c, uio)
|
ureadc(c, uio)
|
register int c;
|
register int c;
|
register struct uio *uio;
|
register struct uio *uio;
|
{
|
{
|
register struct iovec *iov;
|
register struct iovec *iov;
|
|
|
if (uio->uio_resid == 0)
|
if (uio->uio_resid == 0)
|
#ifdef DIAGNOSTIC
|
#ifdef DIAGNOSTIC
|
panic("ureadc: zero resid");
|
panic("ureadc: zero resid");
|
#else
|
#else
|
return (EINVAL);
|
return (EINVAL);
|
#endif
|
#endif
|
again:
|
again:
|
if (uio->uio_iovcnt <= 0)
|
if (uio->uio_iovcnt <= 0)
|
#ifdef DIAGNOSTIC
|
#ifdef DIAGNOSTIC
|
panic("ureadc: non-positive iovcnt");
|
panic("ureadc: non-positive iovcnt");
|
#else
|
#else
|
return (EINVAL);
|
return (EINVAL);
|
#endif
|
#endif
|
iov = uio->uio_iov;
|
iov = uio->uio_iov;
|
if (iov->iov_len <= 0) {
|
if (iov->iov_len <= 0) {
|
uio->uio_iovcnt--;
|
uio->uio_iovcnt--;
|
uio->uio_iov++;
|
uio->uio_iov++;
|
goto again;
|
goto again;
|
}
|
}
|
switch (uio->uio_segflg) {
|
switch (uio->uio_segflg) {
|
|
|
case UIO_USERSPACE:
|
case UIO_USERSPACE:
|
if (subyte(iov->iov_base, c) < 0)
|
if (subyte(iov->iov_base, c) < 0)
|
return (EFAULT);
|
return (EFAULT);
|
break;
|
break;
|
|
|
case UIO_SYSSPACE:
|
case UIO_SYSSPACE:
|
*(char *)iov->iov_base = c;
|
*(char *)iov->iov_base = c;
|
break;
|
break;
|
}
|
}
|
iov->iov_base++;
|
iov->iov_base++;
|
iov->iov_len--;
|
iov->iov_len--;
|
uio->uio_resid--;
|
uio->uio_resid--;
|
uio->uio_offset++;
|
uio->uio_offset++;
|
return (0);
|
return (0);
|
}
|
}
|
#endif // __ECOS
|
#endif // __ECOS
|
|
|
/*
|
/*
|
* General routine to allocate a hash table.
|
* General routine to allocate a hash table.
|
*/
|
*/
|
#ifdef __ECOS
|
#ifdef __ECOS
|
void *
|
void *
|
hashinit(int elements, int type, int flags, u_long *hashmask)
|
hashinit(int elements, int type, int flags, u_long *hashmask)
|
#else
|
#else
|
void *
|
void *
|
hashinit(elements, type, flags, hashmask)
|
hashinit(elements, type, flags, hashmask)
|
int elements, type, flags;
|
int elements, type, flags;
|
u_long *hashmask;
|
u_long *hashmask;
|
#endif
|
#endif
|
{
|
{
|
long hashsize;
|
long hashsize;
|
LIST_HEAD(generic, generic) *hashtbl;
|
LIST_HEAD(generic, generic) *hashtbl;
|
int i;
|
int i;
|
|
|
if (elements <= 0)
|
if (elements <= 0)
|
panic("hashinit: bad cnt");
|
panic("hashinit: bad cnt");
|
for (hashsize = 1; hashsize <= elements; hashsize <<= 1)
|
for (hashsize = 1; hashsize <= elements; hashsize <<= 1)
|
continue;
|
continue;
|
hashsize >>= 1;
|
hashsize >>= 1;
|
hashtbl = malloc((u_long)hashsize * sizeof(*hashtbl), type, flags);
|
hashtbl = malloc((u_long)hashsize * sizeof(*hashtbl), type, flags);
|
for (i = 0; i < hashsize; i++)
|
for (i = 0; i < hashsize; i++)
|
LIST_INIT(&hashtbl[i]);
|
LIST_INIT(&hashtbl[i]);
|
*hashmask = hashsize - 1;
|
*hashmask = hashsize - 1;
|
return (hashtbl);
|
return (hashtbl);
|
}
|
}
|
|
|
#ifndef __ECOS
|
#ifndef __ECOS
|
/*
|
/*
|
* "Shutdown hook" types, functions, and variables.
|
* "Shutdown hook" types, functions, and variables.
|
*/
|
*/
|
|
|
struct shutdownhook_desc {
|
struct shutdownhook_desc {
|
LIST_ENTRY(shutdownhook_desc) sfd_list;
|
LIST_ENTRY(shutdownhook_desc) sfd_list;
|
void (*sfd_fn) __P((void *));
|
void (*sfd_fn) __P((void *));
|
void *sfd_arg;
|
void *sfd_arg;
|
};
|
};
|
|
|
LIST_HEAD(, shutdownhook_desc) shutdownhook_list;
|
LIST_HEAD(, shutdownhook_desc) shutdownhook_list;
|
|
|
int shutdownhooks_done;
|
int shutdownhooks_done;
|
|
|
void *
|
void *
|
shutdownhook_establish(fn, arg)
|
shutdownhook_establish(fn, arg)
|
void (*fn) __P((void *));
|
void (*fn) __P((void *));
|
void *arg;
|
void *arg;
|
{
|
{
|
struct shutdownhook_desc *ndp;
|
struct shutdownhook_desc *ndp;
|
|
|
ndp = (struct shutdownhook_desc *)
|
ndp = (struct shutdownhook_desc *)
|
malloc(sizeof (*ndp), M_DEVBUF, M_NOWAIT);
|
malloc(sizeof (*ndp), M_DEVBUF, M_NOWAIT);
|
if (ndp == NULL)
|
if (ndp == NULL)
|
return NULL;
|
return NULL;
|
|
|
ndp->sfd_fn = fn;
|
ndp->sfd_fn = fn;
|
ndp->sfd_arg = arg;
|
ndp->sfd_arg = arg;
|
LIST_INSERT_HEAD(&shutdownhook_list, ndp, sfd_list);
|
LIST_INSERT_HEAD(&shutdownhook_list, ndp, sfd_list);
|
|
|
return (ndp);
|
return (ndp);
|
}
|
}
|
|
|
void
|
void
|
shutdownhook_disestablish(vhook)
|
shutdownhook_disestablish(vhook)
|
void *vhook;
|
void *vhook;
|
{
|
{
|
#ifdef DIAGNOSTIC
|
#ifdef DIAGNOSTIC
|
struct shutdownhook_desc *dp;
|
struct shutdownhook_desc *dp;
|
|
|
for (dp = shutdownhook_list.lh_first; dp != NULL;
|
for (dp = shutdownhook_list.lh_first; dp != NULL;
|
dp = dp->sfd_list.le_next)
|
dp = dp->sfd_list.le_next)
|
if (dp == vhook)
|
if (dp == vhook)
|
break;
|
break;
|
if (dp == NULL)
|
if (dp == NULL)
|
panic("shutdownhook_disestablish: hook not established");
|
panic("shutdownhook_disestablish: hook not established");
|
#endif
|
#endif
|
|
|
LIST_REMOVE((struct shutdownhook_desc *)vhook, sfd_list);
|
LIST_REMOVE((struct shutdownhook_desc *)vhook, sfd_list);
|
}
|
}
|
|
|
/*
|
/*
|
* Run shutdown hooks. Should be invoked immediately before the
|
* Run shutdown hooks. Should be invoked immediately before the
|
* system is halted or rebooted, i.e. after file systems unmounted,
|
* system is halted or rebooted, i.e. after file systems unmounted,
|
* after crash dump done, etc.
|
* after crash dump done, etc.
|
*/
|
*/
|
void
|
void
|
doshutdownhooks()
|
doshutdownhooks()
|
{
|
{
|
struct shutdownhook_desc *dp;
|
struct shutdownhook_desc *dp;
|
|
|
if (shutdownhooks_done)
|
if (shutdownhooks_done)
|
return;
|
return;
|
|
|
for (dp = shutdownhook_list.lh_first; dp != NULL; dp =
|
for (dp = shutdownhook_list.lh_first; dp != NULL; dp =
|
dp->sfd_list.le_next)
|
dp->sfd_list.le_next)
|
(*dp->sfd_fn)(dp->sfd_arg);
|
(*dp->sfd_fn)(dp->sfd_arg);
|
}
|
}
|
|
|
/*
|
/*
|
* "Power hook" types, functions, and variables.
|
* "Power hook" types, functions, and variables.
|
*/
|
*/
|
|
|
struct powerhook_desc {
|
struct powerhook_desc {
|
LIST_ENTRY(powerhook_desc) sfd_list;
|
LIST_ENTRY(powerhook_desc) sfd_list;
|
void (*sfd_fn) __P((int, void *));
|
void (*sfd_fn) __P((int, void *));
|
void *sfd_arg;
|
void *sfd_arg;
|
};
|
};
|
|
|
LIST_HEAD(, powerhook_desc) powerhook_list;
|
LIST_HEAD(, powerhook_desc) powerhook_list;
|
|
|
void *
|
void *
|
powerhook_establish(fn, arg)
|
powerhook_establish(fn, arg)
|
void (*fn) __P((int, void *));
|
void (*fn) __P((int, void *));
|
void *arg;
|
void *arg;
|
{
|
{
|
struct powerhook_desc *ndp;
|
struct powerhook_desc *ndp;
|
|
|
ndp = (struct powerhook_desc *)
|
ndp = (struct powerhook_desc *)
|
malloc(sizeof(*ndp), M_DEVBUF, M_NOWAIT);
|
malloc(sizeof(*ndp), M_DEVBUF, M_NOWAIT);
|
if (ndp == NULL)
|
if (ndp == NULL)
|
return NULL;
|
return NULL;
|
|
|
ndp->sfd_fn = fn;
|
ndp->sfd_fn = fn;
|
ndp->sfd_arg = arg;
|
ndp->sfd_arg = arg;
|
LIST_INSERT_HEAD(&powerhook_list, ndp, sfd_list);
|
LIST_INSERT_HEAD(&powerhook_list, ndp, sfd_list);
|
|
|
return (ndp);
|
return (ndp);
|
}
|
}
|
|
|
void
|
void
|
powerhook_disestablish(vhook)
|
powerhook_disestablish(vhook)
|
void *vhook;
|
void *vhook;
|
{
|
{
|
#ifdef DIAGNOSTIC
|
#ifdef DIAGNOSTIC
|
struct powerhook_desc *dp;
|
struct powerhook_desc *dp;
|
|
|
for (dp = powerhook_list.lh_first; dp != NULL;
|
for (dp = powerhook_list.lh_first; dp != NULL;
|
dp = dp->sfd_list.le_next)
|
dp = dp->sfd_list.le_next)
|
if (dp == vhook)
|
if (dp == vhook)
|
break;
|
break;
|
if (dp == NULL)
|
if (dp == NULL)
|
panic("powerhook_disestablish: hook not established");
|
panic("powerhook_disestablish: hook not established");
|
#endif
|
#endif
|
|
|
LIST_REMOVE((struct powerhook_desc *)vhook, sfd_list);
|
LIST_REMOVE((struct powerhook_desc *)vhook, sfd_list);
|
free(vhook, M_DEVBUF);
|
free(vhook, M_DEVBUF);
|
}
|
}
|
|
|
/*
|
/*
|
* Run power hooks.
|
* Run power hooks.
|
*/
|
*/
|
void
|
void
|
dopowerhooks(why)
|
dopowerhooks(why)
|
int why;
|
int why;
|
{
|
{
|
struct powerhook_desc *dp;
|
struct powerhook_desc *dp;
|
|
|
for (dp = LIST_FIRST(&powerhook_list);
|
for (dp = LIST_FIRST(&powerhook_list);
|
dp != NULL;
|
dp != NULL;
|
dp = LIST_NEXT(dp, sfd_list)) {
|
dp = LIST_NEXT(dp, sfd_list)) {
|
(*dp->sfd_fn)(why, dp->sfd_arg);
|
(*dp->sfd_fn)(why, dp->sfd_arg);
|
}
|
}
|
}
|
}
|
#endif // __ECOS
|
#endif // __ECOS
|
|
|
