NetBSD/sys/miscfs/procfs/procfs_subr.c

328 lines
8.2 KiB
C
Raw Normal View History

1997-10-30 12:14:07 +03:00
/* $NetBSD: procfs_subr.c,v 1.22 1997/10/30 09:14:07 mycroft Exp $ */
1993-08-24 16:59:09 +04:00
/*
* Copyright (c) 1994 Christopher G. Demetriou. All rights reserved.
* Copyright (c) 1993 Jan-Simon Pendry
* Copyright (c) 1993
* The Regents of the University of California. All rights reserved.
1993-08-24 20:25:07 +04:00
*
* This code is derived from software contributed to Berkeley by
* Jan-Simon Pendry.
*
1993-08-24 20:25:07 +04:00
* 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.
1993-08-24 20:25:07 +04:00
*
* @(#)procfs_subr.c 8.5 (Berkeley) 6/15/94
1993-08-24 16:59:09 +04:00
*/
1993-12-18 06:48:27 +03:00
#include <sys/param.h>
#include <sys/systm.h>
#include <sys/time.h>
#include <sys/kernel.h>
#include <sys/proc.h>
#include <sys/vnode.h>
#include <sys/malloc.h>
1997-05-05 11:34:09 +04:00
#include <sys/stat.h>
#include <miscfs/procfs/procfs.h>
1993-08-24 16:59:09 +04:00
static struct pfsnode *pfshead;
static int pfsvplock;
1993-08-24 16:59:09 +04:00
#define ISSET(t, f) ((t) & (f))
1993-08-24 16:59:09 +04:00
/*
* allocate a pfsnode/vnode pair. the vnode is
* referenced, but not locked.
*
* the pid, pfs_type, and mount point uniquely
* identify a pfsnode. the mount point is needed
* because someone might mount this filesystem
* twice.
*
* all pfsnodes are maintained on a singly-linked
* list. new nodes are only allocated when they cannot
* be found on this list. entries on the list are
* removed when the vfs reclaim entry is called.
*
* a single lock is kept for the entire list. this is
* needed because the getnewvnode() function can block
* waiting for a vnode to become free, in which case there
* may be more than one process trying to get the same
* vnode. this lock is only taken if we are going to
* call getnewvnode, since the kernel itself is single-threaded.
*
* if an entry is found on the list, then call vget() to
* take a reference. this is done because there may be
* zero references to it and so it needs to removed from
* the vnode free list.
1993-08-24 16:59:09 +04:00
*/
int
procfs_allocvp(mp, vpp, pid, pfs_type)
struct mount *mp;
struct vnode **vpp;
long pid;
pfstype pfs_type;
1993-08-24 16:59:09 +04:00
{
struct pfsnode *pfs;
struct vnode *vp;
struct pfsnode **pp;
int error;
loop:
for (pfs = pfshead; pfs != 0; pfs = pfs->pfs_next) {
vp = PFSTOV(pfs);
if (pfs->pfs_pid == pid &&
pfs->pfs_type == pfs_type &&
vp->v_mount == mp) {
if (vget(vp, 0))
goto loop;
*vpp = vp;
return (0);
1993-08-24 16:59:09 +04:00
}
}
/*
* otherwise lock the vp list while we call getnewvnode
* since that can block.
*/
if (pfsvplock & PROCFS_LOCKED) {
pfsvplock |= PROCFS_WANT;
sleep((caddr_t) &pfsvplock, PINOD);
goto loop;
}
pfsvplock |= PROCFS_LOCKED;
1993-08-24 16:59:09 +04:00
1996-02-10 01:39:56 +03:00
if ((error = getnewvnode(VT_PROCFS, mp, procfs_vnodeop_p, vpp)) != 0)
goto out;
vp = *vpp;
MALLOC(pfs, void *, sizeof(struct pfsnode), M_TEMP, M_WAITOK);
vp->v_data = pfs;
pfs->pfs_next = 0;
pfs->pfs_pid = (pid_t) pid;
pfs->pfs_type = pfs_type;
pfs->pfs_vnode = vp;
pfs->pfs_flags = 0;
pfs->pfs_fileno = PROCFS_FILENO(pid, pfs_type);
switch (pfs_type) {
case Proot: /* /proc = dr-xr-xr-x */
pfs->pfs_mode = S_IRUSR|S_IXUSR|S_IRGRP|S_IXGRP|S_IROTH|S_IXOTH;
vp->v_type = VDIR;
vp->v_flag = VROOT;
break;
1997-10-30 12:14:07 +03:00
case Pcurproc: /* /proc/curproc = lr-xr-xr-x */
pfs->pfs_mode = S_IRUSR|S_IXUSR|S_IRGRP|S_IXGRP|S_IROTH|S_IXOTH;
vp->v_type = VLNK;
break;
case Pproc: /* /proc/N = dr-xr-xr-x */
pfs->pfs_mode = S_IRUSR|S_IXUSR|S_IRGRP|S_IXGRP|S_IROTH|S_IXOTH;
vp->v_type = VDIR;
break;
case Pfile: /* /proc/N/file = -rw------- */
case Pmem: /* /proc/N/mem = -rw------- */
case Pregs: /* /proc/N/regs = -rw------- */
case Pfpregs: /* /proc/N/fpregs = -rw------- */
pfs->pfs_mode = S_IRUSR|S_IWUSR;
1994-01-28 10:03:16 +03:00
vp->v_type = VREG;
break;
case Pctl: /* /proc/N/ctl = --w------ */
case Pnote: /* /proc/N/note = --w------ */
case Pnotepg: /* /proc/N/notepg = --w------ */
pfs->pfs_mode = S_IWUSR;
vp->v_type = VREG;
break;
case Pstatus: /* /proc/N/status = -r--r--r-- */
pfs->pfs_mode = S_IRUSR|S_IRGRP|S_IROTH;
vp->v_type = VREG;
break;
default:
panic("procfs_allocvp");
1993-08-24 16:59:09 +04:00
}
/* add to procfs vnode list */
for (pp = &pfshead; *pp; pp = &(*pp)->pfs_next)
continue;
*pp = pfs;
out:
pfsvplock &= ~PROCFS_LOCKED;
if (pfsvplock & PROCFS_WANT) {
pfsvplock &= ~PROCFS_WANT;
wakeup((caddr_t) &pfsvplock);
}
return (error);
1993-08-24 16:59:09 +04:00
}
int
procfs_freevp(vp)
struct vnode *vp;
1993-08-24 16:59:09 +04:00
{
struct pfsnode **pfspp;
struct pfsnode *pfs = VTOPFS(vp);
1993-08-24 16:59:09 +04:00
for (pfspp = &pfshead; *pfspp != 0; pfspp = &(*pfspp)->pfs_next) {
if (*pfspp == pfs) {
*pfspp = pfs->pfs_next;
break;
}
}
FREE(vp->v_data, M_TEMP);
vp->v_data = 0;
return (0);
1993-08-24 16:59:09 +04:00
}
int
procfs_rw(v)
void *v;
1993-08-24 16:59:09 +04:00
{
struct vop_read_args *ap = v;
struct vnode *vp = ap->a_vp;
struct uio *uio = ap->a_uio;
struct proc *curp = uio->uio_procp;
struct pfsnode *pfs = VTOPFS(vp);
struct proc *p;
p = PFIND(pfs->pfs_pid);
if (p == 0)
1993-08-24 16:59:09 +04:00
return (EINVAL);
switch (pfs->pfs_type) {
case Pregs:
case Pfpregs:
case Pmem:
/*
* Do not allow init to be modified while in secure mode; it
* could be duped into changing the security level.
*/
if (uio->uio_rw == UIO_WRITE &&
p == initproc && securelevel > -1)
return (EPERM);
break;
default:
break;
}
switch (pfs->pfs_type) {
case Pnote:
case Pnotepg:
return (procfs_donote(curp, p, pfs, uio));
1993-08-24 16:59:09 +04:00
case Pregs:
return (procfs_doregs(curp, p, pfs, uio));
1993-08-24 16:59:09 +04:00
1994-01-28 10:03:16 +03:00
case Pfpregs:
return (procfs_dofpregs(curp, p, pfs, uio));
1994-01-28 10:03:16 +03:00
case Pctl:
return (procfs_doctl(curp, p, pfs, uio));
case Pstatus:
return (procfs_dostatus(curp, p, pfs, uio));
case Pmem:
return (procfs_domem(curp, p, pfs, uio));
default:
return (EOPNOTSUPP);
}
1993-08-24 16:59:09 +04:00
}
/*
* Get a string from userland into (buf). Strip a trailing
* nl character (to allow easy access from the shell).
* The buffer should be *buflenp + 1 chars long. vfs_getuserstr
* will automatically add a nul char at the end.
*
* Returns 0 on success or the following errors
*
* EINVAL: file offset is non-zero.
* EMSGSIZE: message is longer than kernel buffer
* EFAULT: user i/o buffer is not addressable
*/
int
vfs_getuserstr(uio, buf, buflenp)
struct uio *uio;
char *buf;
int *buflenp;
1993-08-24 16:59:09 +04:00
{
int xlen;
int error;
if (uio->uio_offset != 0)
return (EINVAL);
xlen = *buflenp;
1993-08-24 16:59:09 +04:00
/* must be able to read the whole string in one go */
if (xlen < uio->uio_resid)
return (EMSGSIZE);
xlen = uio->uio_resid;
1993-08-24 16:59:09 +04:00
1996-02-10 01:39:56 +03:00
if ((error = uiomove(buf, xlen, uio)) != 0)
return (error);
1993-08-24 16:59:09 +04:00
/* allow multiple writes without seeks */
uio->uio_offset = 0;
/* cleanup string and remove trailing newline */
buf[xlen] = '\0';
xlen = strlen(buf);
if (xlen > 0 && buf[xlen-1] == '\n')
buf[--xlen] = '\0';
*buflenp = xlen;
1993-08-24 16:59:09 +04:00
return (0);
1993-08-24 16:59:09 +04:00
}
vfs_namemap_t *
vfs_findname(nm, buf, buflen)
vfs_namemap_t *nm;
char *buf;
int buflen;
1993-08-24 16:59:09 +04:00
{
for (; nm->nm_name; nm++)
if (bcmp(buf, nm->nm_name, buflen+1) == 0)
return (nm);
return (0);
1993-08-24 16:59:09 +04:00
}