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.11 2004/10/12 19:21:07 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 <vfs/procfs/procfs.h>
54 #define PFS_HMASK (PFS_HSIZE - 1)
56 static struct pfsnode *pfshead[PFS_HSIZE];
59 #define PFSHASH(pid) &pfshead[(pid) & PFS_HMASK]
62 * Allocate a pfsnode/vnode pair. If no error occurs the returned vnode
63 * will be referenced and exclusively locked.
65 * The pid, pfs_type, and mount point uniquely identify a pfsnode.
66 * The mount point is needed because someone might mount this filesystem
69 * All pfsnodes are maintained on a singly-linked list. new nodes are
70 * only allocated when they cannot be found on this list. entries on
71 * the list are removed when the vfs reclaim entry is called.
73 * A single lock is kept for the entire list. this is needed because the
74 * getnewvnode() function can block waiting for a vnode to become free,
75 * in which case there may be more than one process trying to get the same
76 * vnode. this lock is only taken if we are going to call getnewvnode,
77 * since the kernel itself is single-threaded.
79 * If an entry is found on the list, then call vget() to take a reference
80 * and obtain the lock. This will properly re-reference the vnode if it
81 * had gotten onto the free list.
84 procfs_allocvp(struct mount *mp, struct vnode **vpp, long pid, pfstype pfs_type)
86 struct thread *td = curthread; /* XXX */
94 for (pfs = *pp; pfs; pfs = pfs->pfs_next) {
95 if (pfs->pfs_pid == pid && pfs->pfs_type == pfs_type &&
96 PFSTOV(pfs)->v_mount == mp) {
98 if (vget(vp, LK_EXCLUSIVE, td))
102 * Make sure the vnode is still in the cache after
103 * getting the interlock to avoid racing a free.
105 for (pfs = *pp; pfs; pfs = pfs->pfs_next) {
106 if (PFSTOV(pfs) == vp &&
107 pfs->pfs_pid == pid &&
108 pfs->pfs_type == pfs_type &&
109 PFSTOV(pfs)->v_mount == mp) {
113 if (pfs == NULL || PFSTOV(pfs) != vp) {
124 * otherwise lock the vp list while we call getnewvnode
125 * since that can block.
127 if (pfsvplock & PROCFS_LOCKED) {
128 pfsvplock |= PROCFS_WANT;
129 (void) tsleep((caddr_t) &pfsvplock, 0, "pfsavp", 0);
132 pfsvplock |= PROCFS_LOCKED;
135 * Do the MALLOC before the getnewvnode since doing so afterward
136 * might cause a bogus v_data pointer to get dereferenced
137 * elsewhere if MALLOC should block.
139 * XXX this may not matter anymore since getnewvnode now returns
142 MALLOC(pfs, struct pfsnode *, sizeof(struct pfsnode), M_TEMP, M_WAITOK);
144 error = getnewvnode(VT_PROCFS, mp, mp->mnt_vn_ops, vpp, 0, 0);
154 pfs->pfs_pid = (pid_t) pid;
155 pfs->pfs_type = pfs_type;
158 pfs->pfs_lockowner = 0;
159 pfs->pfs_fileno = PROCFS_FILENO(pid, pfs_type);
162 case Proot: /* /proc = dr-xr-xr-x */
163 pfs->pfs_mode = (VREAD|VEXEC) |
170 case Pcurproc: /* /proc/curproc = lr--r--r-- */
171 pfs->pfs_mode = (VREAD) |
178 pfs->pfs_mode = (VREAD|VEXEC) |
185 pfs->pfs_mode = (VREAD|VEXEC) |
192 pfs->pfs_mode = (VREAD|VWRITE);
199 pfs->pfs_mode = (VREAD|VWRITE);
206 pfs->pfs_mode = (VWRITE);
215 pfs->pfs_mode = (VREAD) |
222 panic("procfs_allocvp");
225 /* add to procfs vnode list */
230 pfsvplock &= ~PROCFS_LOCKED;
232 if (pfsvplock & PROCFS_WANT) {
233 pfsvplock &= ~PROCFS_WANT;
234 wakeup((caddr_t) &pfsvplock);
241 procfs_freevp(struct vnode *vp)
243 struct pfsnode **pfspp;
249 pfspp = PFSHASH(pfs->pfs_pid);
250 while (*pfspp != pfs && *pfspp)
251 pfspp = &(*pfspp)->pfs_next;
253 *pfspp = pfs->pfs_next;
254 pfs->pfs_next = NULL;
260 procfs_rw(struct vop_read_args *ap)
262 struct vnode *vp = ap->a_vp;
263 struct uio *uio = ap->a_uio;
264 struct thread *curtd = uio->uio_td;
266 struct pfsnode *pfs = VTOPFS(vp);
272 if ((curp = curtd->td_proc) == NULL) /* XXX */
275 p = PFIND(pfs->pfs_pid);
278 if (p->p_pid == 1 && securelevel > 0 && uio->uio_rw == UIO_WRITE)
281 while (pfs->pfs_lockowner) {
282 tsleep(&pfs->pfs_lockowner, 0, "pfslck", 0);
284 pfs->pfs_lockowner = curproc->p_pid;
286 switch (pfs->pfs_type) {
289 rtval = procfs_donote(curp, p, pfs, uio);
293 rtval = procfs_doregs(curp, p, pfs, uio);
297 rtval = procfs_dofpregs(curp, p, pfs, uio);
301 rtval = procfs_dodbregs(curp, p, pfs, uio);
305 rtval = procfs_doctl(curp, p, pfs, uio);
309 rtval = procfs_dostatus(curp, p, pfs, uio);
313 rtval = procfs_domap(curp, p, pfs, uio);
317 rtval = procfs_domem(curp, p, pfs, uio);
321 rtval = procfs_dotype(curp, p, pfs, uio);
325 rtval = procfs_docmdline(curp, p, pfs, uio);
329 rtval = procfs_dorlimit(curp, p, pfs, uio);
336 pfs->pfs_lockowner = 0;
337 wakeup(&pfs->pfs_lockowner);
342 * Get a string from userland into (buf). Strip a trailing
343 * nl character (to allow easy access from the shell).
344 * The buffer should be *buflenp + 1 chars long. vfs_getuserstr
345 * will automatically add a nul char at the end.
347 * Returns 0 on success or the following errors
349 * EINVAL: file offset is non-zero.
350 * EMSGSIZE: message is longer than kernel buffer
351 * EFAULT: user i/o buffer is not addressable
354 vfs_getuserstr(struct uio *uio, char *buf, int *buflenp)
359 if (uio->uio_offset != 0)
364 /* must be able to read the whole string in one go */
365 if (xlen < uio->uio_resid)
367 xlen = uio->uio_resid;
369 if ((error = uiomove(buf, xlen, uio)) != 0)
372 /* allow multiple writes without seeks */
375 /* cleanup string and remove trailing newline */
378 if (xlen > 0 && buf[xlen-1] == '\n')
386 vfs_findname(vfs_namemap_t *nm, char *buf, int buflen)
389 for (; nm->nm_name; nm++)
390 if (bcmp(buf, nm->nm_name, buflen+1) == 0)
397 procfs_exit(struct thread *td)
403 KKASSERT(td->td_proc);
404 pid = td->td_proc->p_pid;
407 * The reason for this loop is not obvious -- basicly,
408 * procfs_freevp(), which is called via vgone() (eventually),
409 * removes the specified procfs node from the pfshead list.
410 * It does this by *pfsp = pfs->pfs_next, meaning that it
411 * overwrites the node. So when we do pfs = pfs->next, we
412 * end up skipping the node that replaces the one that was
413 * vgone'd. Since it may have been the last one on the list,
414 * it may also have been set to null -- but *our* pfs pointer,
415 * here, doesn't see this. So the loop starts from the beginning
418 * This is not a for() loop because the final event
419 * would be "pfs = pfs->pfs_next"; in the case where
420 * pfs is set to pfshead again, that would mean that
421 * pfshead is skipped over.
427 if (pfs->pfs_pid == pid) {
429 if (vx_lock(vp) == 0) {