2 * Copyright (c) 1993 Jan-Simon Pendry
4 * The Regents of the University of California. All rights reserved.
6 * This code is derived from software contributed to Berkeley by
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * @(#)procfs_subr.c 8.6 (Berkeley) 5/14/95
39 * $FreeBSD: src/sys/miscfs/procfs/procfs_subr.c,v 1.26.2.3 2002/02/18 21:28:04 des Exp $
40 * $DragonFly: src/sys/vfs/procfs/procfs_subr.c,v 1.2 2003/06/17 04:28:42 dillon Exp $
43 #include <sys/param.h>
44 #include <sys/systm.h>
45 #include <sys/sysctl.h>
47 #include <sys/mount.h>
48 #include <sys/vnode.h>
49 #include <sys/malloc.h>
51 #include <miscfs/procfs/procfs.h>
53 static struct pfsnode *pfshead;
57 * allocate a pfsnode/vnode pair. the vnode is
58 * referenced, but not locked.
60 * the pid, pfs_type, and mount point uniquely
61 * identify a pfsnode. the mount point is needed
62 * because someone might mount this filesystem
65 * all pfsnodes are maintained on a singly-linked
66 * list. new nodes are only allocated when they cannot
67 * be found on this list. entries on the list are
68 * removed when the vfs reclaim entry is called.
70 * a single lock is kept for the entire list. this is
71 * needed because the getnewvnode() function can block
72 * waiting for a vnode to become free, in which case there
73 * may be more than one process trying to get the same
74 * vnode. this lock is only taken if we are going to
75 * call getnewvnode, since the kernel itself is single-threaded.
77 * if an entry is found on the list, then call vget() to
78 * take a reference. this is done because there may be
79 * zero references to it and so it needs to removed from
80 * the vnode free list.
83 procfs_allocvp(mp, vpp, pid, pfs_type)
89 struct proc *p = curproc; /* XXX */
96 for (pfs = pfshead; pfs != 0; pfs = pfs->pfs_next) {
98 if (pfs->pfs_pid == pid &&
99 pfs->pfs_type == pfs_type &&
109 * otherwise lock the vp list while we call getnewvnode
110 * since that can block.
112 if (pfsvplock & PROCFS_LOCKED) {
113 pfsvplock |= PROCFS_WANT;
114 (void) tsleep((caddr_t) &pfsvplock, PINOD, "pfsavp", 0);
117 pfsvplock |= PROCFS_LOCKED;
120 * Do the MALLOC before the getnewvnode since doing so afterward
121 * might cause a bogus v_data pointer to get dereferenced
122 * elsewhere if MALLOC should block.
124 MALLOC(pfs, struct pfsnode *, sizeof(struct pfsnode), M_TEMP, M_WAITOK);
126 if ((error = getnewvnode(VT_PROCFS, mp, procfs_vnodeop_p, vpp)) != 0) {
135 pfs->pfs_pid = (pid_t) pid;
136 pfs->pfs_type = pfs_type;
139 pfs->pfs_lockowner = 0;
140 pfs->pfs_fileno = PROCFS_FILENO(pid, pfs_type);
143 case Proot: /* /proc = dr-xr-xr-x */
144 pfs->pfs_mode = (VREAD|VEXEC) |
151 case Pcurproc: /* /proc/curproc = lr--r--r-- */
152 pfs->pfs_mode = (VREAD) |
159 pfs->pfs_mode = (VREAD|VEXEC) |
166 pfs->pfs_mode = (VREAD|VEXEC) |
173 pfs->pfs_mode = (VREAD|VWRITE);
180 pfs->pfs_mode = (VREAD|VWRITE);
187 pfs->pfs_mode = (VWRITE);
196 pfs->pfs_mode = (VREAD) |
203 panic("procfs_allocvp");
206 /* add to procfs vnode list */
207 for (pp = &pfshead; *pp; pp = &(*pp)->pfs_next)
212 pfsvplock &= ~PROCFS_LOCKED;
214 if (pfsvplock & PROCFS_WANT) {
215 pfsvplock &= ~PROCFS_WANT;
216 wakeup((caddr_t) &pfsvplock);
226 struct pfsnode **pfspp;
227 struct pfsnode *pfs = VTOPFS(vp);
229 for (pfspp = &pfshead; *pfspp != 0; pfspp = &(*pfspp)->pfs_next) {
231 *pfspp = pfs->pfs_next;
236 FREE(vp->v_data, M_TEMP);
243 struct vop_read_args *ap;
245 struct vnode *vp = ap->a_vp;
246 struct uio *uio = ap->a_uio;
247 struct proc *curp = uio->uio_procp;
248 struct pfsnode *pfs = VTOPFS(vp);
252 p = PFIND(pfs->pfs_pid);
255 if (p->p_pid == 1 && securelevel > 0 && uio->uio_rw == UIO_WRITE)
258 while (pfs->pfs_lockowner) {
259 tsleep(&pfs->pfs_lockowner, PRIBIO, "pfslck", 0);
261 pfs->pfs_lockowner = curproc->p_pid;
263 switch (pfs->pfs_type) {
266 rtval = procfs_donote(curp, p, pfs, uio);
270 rtval = procfs_doregs(curp, p, pfs, uio);
274 rtval = procfs_dofpregs(curp, p, pfs, uio);
278 rtval = procfs_dodbregs(curp, p, pfs, uio);
282 rtval = procfs_doctl(curp, p, pfs, uio);
286 rtval = procfs_dostatus(curp, p, pfs, uio);
290 rtval = procfs_domap(curp, p, pfs, uio);
294 rtval = procfs_domem(curp, p, pfs, uio);
298 rtval = procfs_dotype(curp, p, pfs, uio);
302 rtval = procfs_docmdline(curp, p, pfs, uio);
306 rtval = procfs_dorlimit(curp, p, pfs, uio);
313 pfs->pfs_lockowner = 0;
314 wakeup(&pfs->pfs_lockowner);
319 * Get a string from userland into (buf). Strip a trailing
320 * nl character (to allow easy access from the shell).
321 * The buffer should be *buflenp + 1 chars long. vfs_getuserstr
322 * will automatically add a nul char at the end.
324 * Returns 0 on success or the following errors
326 * EINVAL: file offset is non-zero.
327 * EMSGSIZE: message is longer than kernel buffer
328 * EFAULT: user i/o buffer is not addressable
331 vfs_getuserstr(uio, buf, buflenp)
339 if (uio->uio_offset != 0)
344 /* must be able to read the whole string in one go */
345 if (xlen < uio->uio_resid)
347 xlen = uio->uio_resid;
349 if ((error = uiomove(buf, xlen, uio)) != 0)
352 /* allow multiple writes without seeks */
355 /* cleanup string and remove trailing newline */
358 if (xlen > 0 && buf[xlen-1] == '\n')
366 vfs_findname(nm, buf, buflen)
372 for (; nm->nm_name; nm++)
373 if (bcmp(buf, nm->nm_name, buflen+1) == 0)
380 procfs_exit(struct proc *p)
383 pid_t pid = p->p_pid;
386 * The reason for this loop is not obvious -- basicly,
387 * procfs_freevp(), which is called via vgone() (eventually),
388 * removes the specified procfs node from the pfshead list.
389 * It does this by *pfsp = pfs->pfs_next, meaning that it
390 * overwrites the node. So when we do pfs = pfs->next, we
391 * end up skipping the node that replaces the one that was
392 * vgone'd. Since it may have been the last one on the list,
393 * it may also have been set to null -- but *our* pfs pointer,
394 * here, doesn't see this. So the loop starts from the beginning
397 * This is not a for() loop because the final event
398 * would be "pfs = pfs->pfs_next"; in the case where
399 * pfs is set to pfshead again, that would mean that
400 * pfshead is skipped over.
405 if (pfs->pfs_pid == pid) {