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_status.c 8.4 (Berkeley) 6/15/94
40 * $FreeBSD: src/sys/miscfs/procfs/procfs_status.c,v 1.20.2.4 2002/01/22 17:22:59 nectar Exp $
43 #include <sys/param.h>
44 #include <sys/systm.h>
45 #include <sys/malloc.h>
48 #include <sys/vnode.h>
50 #include <sys/resourcevar.h>
51 #include <miscfs/procfs/procfs.h>
55 #include <vm/vm_param.h>
58 #define DOCHECK() do { if (ps >= psbuf+sizeof(psbuf)) goto bailout; } while (0)
60 procfs_dostatus(curp, p, pfs, uio)
71 int pid, ppid, pgid, sid;
75 char psbuf[256]; /* XXX - conservative */
77 if (uio->uio_rw != UIO_READ)
81 ppid = p->p_pptr ? p->p_pptr->p_pid : 0;
82 pgid = p->p_pgrp->pg_id;
83 sess = p->p_pgrp->pg_session;
84 sid = sess->s_leader ? sess->s_leader->p_pid : 0;
86 /* comm pid ppid pgid sid maj,min ctty,sldr start ut st wmsg
87 euid ruid rgid,egid,groups[1 .. NGROUPS]
89 KASSERT(sizeof(psbuf) > MAXCOMLEN,
90 ("Too short buffer for new MAXCOMLEN"));
93 bcopy(p->p_comm, ps, MAXCOMLEN);
97 ps += snprintf(ps, psbuf + sizeof(psbuf) - ps,
98 " %d %d %d %d ", pid, ppid, pgid, sid);
100 if ((p->p_flag&P_CONTROLT) && (tp = sess->s_ttyp))
101 ps += snprintf(ps, psbuf + sizeof(psbuf) - ps,
102 "%d,%d ", major(tp->t_dev), minor(tp->t_dev));
104 ps += snprintf(ps, psbuf + sizeof(psbuf) - ps,
110 ps += snprintf(ps, psbuf + sizeof(psbuf) - ps, "%sctty", sep);
114 if (SESS_LEADER(p)) {
115 ps += snprintf(ps, psbuf + sizeof(psbuf) - ps, "%ssldr", sep);
120 ps += snprintf(ps, psbuf + sizeof(psbuf) - ps, "noflags");
124 if (p->p_flag & P_INMEM) {
125 struct timeval ut, st;
127 calcru(p, &ut, &st, (struct timeval *) NULL);
128 ps += snprintf(ps, psbuf + sizeof(psbuf) - ps,
129 " %ld,%ld %ld,%ld %ld,%ld",
130 p->p_stats->p_start.tv_sec,
131 p->p_stats->p_start.tv_usec,
132 ut.tv_sec, ut.tv_usec,
133 st.tv_sec, st.tv_usec);
135 ps += snprintf(ps, psbuf + sizeof(psbuf) - ps,
136 " -1,-1 -1,-1 -1,-1");
139 ps += snprintf(ps, psbuf + sizeof(psbuf) - ps, " %s",
140 (p->p_wchan && p->p_wmesg) ? p->p_wmesg : "nochan");
145 ps += snprintf(ps, psbuf + sizeof(psbuf) - ps, " %lu %lu %lu",
147 (u_long)p->p_cred->p_ruid,
148 (u_long)p->p_cred->p_rgid);
151 /* egid (p->p_cred->p_svgid) is equal to cr_ngroups[0]
152 see also getegid(2) in /sys/kern/kern_prot.c */
154 for (i = 0; i < cr->cr_ngroups; i++) {
155 ps += snprintf(ps, psbuf + sizeof(psbuf) - ps,
156 ",%lu", (u_long)cr->cr_groups[i]);
161 ps += snprintf(ps, psbuf + sizeof(psbuf) - ps,
162 " %s", p->p_prison->pr_host);
164 ps += snprintf(ps, psbuf + sizeof(psbuf) - ps, " -");
166 ps += snprintf(ps, psbuf + sizeof(psbuf) - ps, "\n");
170 xlen -= uio->uio_offset;
171 ps = psbuf + uio->uio_offset;
172 xlen = imin(xlen, uio->uio_resid);
176 error = uiomove(ps, xlen, uio);
185 procfs_docmdline(curp, p, pfs, uio)
196 struct ps_strings pstr;
198 size_t bytes_left, done;
200 if (uio->uio_rw != UIO_READ)
204 * If we are using the ps/cmdline caching, use that. Otherwise
205 * revert back to the old way which only implements full cmdline
206 * for the currept process and just p->p_comm for all other
208 * Note that if the argv is no longer available, we deliberately
209 * don't fall back on p->p_comm or return an error: the authentic
210 * Linux behaviour is to return zero-length in this case.
214 (ps_argsopen || (CHECKIO(curp, p) &&
215 (p->p_flag & P_INEXEC) == 0 &&
216 !p_trespass(curp, p)))) {
217 bp = p->p_args->ar_args;
218 buflen = p->p_args->ar_length;
220 } else if (p != curp) {
226 MALLOC(buf, char *, buflen + 1, M_TEMP, M_WAITOK);
229 error = copyin((void*)PS_STRINGS, &pstr, sizeof(pstr));
235 for (i = 0; bytes_left && (i < pstr.ps_nargvstr); i++) {
236 error = copyinstr(pstr.ps_argvstr[i], ps,
238 /* If too long or malformed, just truncate */
249 buflen -= uio->uio_offset;
250 ps = bp + uio->uio_offset;
251 xlen = min(buflen, uio->uio_resid);
255 error = uiomove(ps, xlen, uio);