1 /* 2 * Copyright (c) 1993 Jan-Simon Pendry 3 * Copyright (c) 1993 4 * The Regents of the University of California. All rights reserved. 5 * 6 * This code is derived from software contributed to Berkeley by 7 * Jan-Simon Pendry. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 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. 24 * 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 35 * SUCH DAMAGE. 36 * 37 * @(#)procfs_status.c 8.4 (Berkeley) 6/15/94 38 * 39 * From: 40 * $FreeBSD: src/sys/miscfs/procfs/procfs_status.c,v 1.20.2.4 2002/01/22 17:22:59 nectar Exp $ 41 * $DragonFly: src/sys/vfs/procfs/procfs_status.c,v 1.14 2007/02/03 17:05:59 corecode Exp $ 42 */ 43 44 #include <sys/param.h> 45 #include <sys/systm.h> 46 #include <sys/malloc.h> 47 #include <sys/proc.h> 48 #include <sys/jail.h> 49 #include <sys/vnode.h> 50 #include <sys/tty.h> 51 #include <sys/resourcevar.h> 52 #include <vfs/procfs/procfs.h> 53 54 #include <vm/vm.h> 55 #include <vm/pmap.h> 56 #include <vm/vm_param.h> 57 #include <sys/exec.h> 58 59 #define DOCHECK() do { if (ps >= psbuf+sizeof(psbuf)) goto bailout; } while (0) 60 int 61 procfs_dostatus(struct proc *curp, struct proc *p, struct pfsnode *pfs, 62 struct uio *uio) 63 { 64 struct lwp *lp; 65 struct session *sess; 66 struct tty *tp; 67 struct ucred *cr; 68 char *ps; 69 char *sep; 70 int pid, ppid, pgid, sid; 71 int i; 72 int xlen; 73 int error; 74 char psbuf[256]; /* XXX - conservative */ 75 76 if (uio->uio_rw != UIO_READ) 77 return (EOPNOTSUPP); 78 79 pid = p->p_pid; 80 ppid = p->p_pptr ? p->p_pptr->p_pid : 0; 81 pgid = p->p_pgrp->pg_id; 82 sess = p->p_pgrp->pg_session; 83 sid = sess->s_leader ? sess->s_leader->p_pid : 0; 84 85 /* comm pid ppid pgid sid maj,min ctty,sldr start ut st wmsg 86 euid ruid rgid,egid,groups[1 .. NGROUPS] 87 */ 88 KASSERT(sizeof(psbuf) > MAXCOMLEN, 89 ("Too short buffer for new MAXCOMLEN")); 90 91 /* XXX lwp */ 92 lp = FIRST_LWP_IN_PROC(p); 93 ps = psbuf; 94 bcopy(p->p_comm, ps, MAXCOMLEN); 95 ps[MAXCOMLEN] = '\0'; 96 ps += strlen(ps); 97 DOCHECK(); 98 ps += ksnprintf(ps, psbuf + sizeof(psbuf) - ps, 99 " %d %d %d %d ", pid, ppid, pgid, sid); 100 DOCHECK(); 101 if ((p->p_flag&P_CONTROLT) && (tp = sess->s_ttyp)) 102 ps += ksnprintf(ps, psbuf + sizeof(psbuf) - ps, 103 "%d,%d ", major(tp->t_dev), minor(tp->t_dev)); 104 else 105 ps += ksnprintf(ps, psbuf + sizeof(psbuf) - ps, 106 "%d,%d ", -1, -1); 107 DOCHECK(); 108 109 sep = ""; 110 if (sess->s_ttyvp) { 111 ps += ksnprintf(ps, psbuf + sizeof(psbuf) - ps, "%sctty", sep); 112 sep = ","; 113 DOCHECK(); 114 } 115 if (SESS_LEADER(p)) { 116 ps += ksnprintf(ps, psbuf + sizeof(psbuf) - ps, "%ssldr", sep); 117 sep = ","; 118 DOCHECK(); 119 } 120 if (*sep != ',') { 121 ps += ksnprintf(ps, psbuf + sizeof(psbuf) - ps, "noflags"); 122 DOCHECK(); 123 } 124 125 if (p->p_flag & P_SWAPPEDOUT) { 126 ps += ksnprintf(ps, psbuf + sizeof(psbuf) - ps, 127 " -1,-1 -1,-1 -1,-1"); 128 } else { 129 struct rusage ru; 130 131 calcru_proc(p, &ru); 132 ps += ksnprintf(ps, psbuf + sizeof(psbuf) - ps, 133 " %ld,%ld %ld,%ld %ld,%ld", 134 p->p_start.tv_sec, 135 p->p_start.tv_usec, 136 ru.ru_utime.tv_sec, ru.ru_utime.tv_usec, 137 ru.ru_stime.tv_sec, ru.ru_stime.tv_usec); 138 } 139 DOCHECK(); 140 141 ps += ksnprintf(ps, psbuf + sizeof(psbuf) - ps, " %s", 142 (lp->lwp_wchan && lp->lwp_wmesg) ? lp->lwp_wmesg : "nochan"); 143 DOCHECK(); 144 145 cr = p->p_ucred; 146 147 ps += ksnprintf(ps, psbuf + sizeof(psbuf) - ps, " %lu %lu %lu", 148 (u_long)cr->cr_uid, 149 (u_long)p->p_ucred->cr_ruid, 150 (u_long)p->p_ucred->cr_rgid); 151 DOCHECK(); 152 153 /* egid (p->p_ucred->cr_svgid) is equal to cr_ngroups[0] 154 see also getegid(2) in /sys/kern/kern_prot.c */ 155 156 for (i = 0; i < cr->cr_ngroups; i++) { 157 ps += ksnprintf(ps, psbuf + sizeof(psbuf) - ps, 158 ",%lu", (u_long)cr->cr_groups[i]); 159 DOCHECK(); 160 } 161 162 if (p->p_ucred->cr_prison) 163 ps += ksnprintf(ps, psbuf + sizeof(psbuf) - ps, 164 " %s", p->p_ucred->cr_prison->pr_host); 165 else 166 ps += ksnprintf(ps, psbuf + sizeof(psbuf) - ps, " -"); 167 DOCHECK(); 168 ps += ksnprintf(ps, psbuf + sizeof(psbuf) - ps, "\n"); 169 DOCHECK(); 170 171 xlen = ps - psbuf; 172 xlen -= uio->uio_offset; 173 ps = psbuf + uio->uio_offset; 174 xlen = imin(xlen, uio->uio_resid); 175 if (xlen <= 0) 176 error = 0; 177 else 178 error = uiomove_frombuf(ps, xlen, uio); 179 180 return (error); 181 182 bailout: 183 return (ENOMEM); 184 } 185 186 int 187 procfs_docmdline(struct proc *curp, struct proc *p, struct pfsnode *pfs, 188 struct uio *uio) 189 { 190 char *ps; 191 int xlen; 192 int error; 193 char *buf, *bp; 194 int buflen; 195 struct ps_strings pstr; 196 char **ps_argvstr; 197 int i; 198 size_t bytes_left, done; 199 200 if (uio->uio_rw != UIO_READ) 201 return (EOPNOTSUPP); 202 203 /* 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 207 * processes. 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. 211 */ 212 213 if (p->p_args && 214 (ps_argsopen || (CHECKIO(curp, p) && 215 (p->p_flag & P_INEXEC) == 0 && !p_trespass(curp->p_ucred, p->p_ucred))) 216 ) { 217 bp = p->p_args->ar_args; 218 buflen = p->p_args->ar_length; 219 buf = 0; 220 } else if (p != curp) { 221 bp = p->p_comm; 222 buflen = MAXCOMLEN; 223 buf = 0; 224 } else { 225 buflen = 256; 226 MALLOC(buf, char *, buflen + 1, M_TEMP, M_WAITOK); 227 bp = buf; 228 ps = buf; 229 error = copyin((void*)PS_STRINGS, &pstr, sizeof(pstr)); 230 if (error) { 231 FREE(buf, M_TEMP); 232 return (error); 233 } 234 if (pstr.ps_nargvstr > ARG_MAX) { 235 FREE(buf, M_TEMP); 236 return (E2BIG); 237 } 238 MALLOC(ps_argvstr, char **, pstr.ps_nargvstr * sizeof(char *), 239 M_TEMP, M_WAITOK); 240 error = copyin((void *)pstr.ps_argvstr, ps_argvstr, 241 pstr.ps_nargvstr * sizeof(char *)); 242 if (error) { 243 FREE(ps_argvstr, M_TEMP); 244 FREE(buf, M_TEMP); 245 return (error); 246 } 247 bytes_left = buflen; 248 for (i = 0; bytes_left && (i < pstr.ps_nargvstr); i++) { 249 error = copyinstr(ps_argvstr[i], ps, 250 bytes_left, &done); 251 /* If too long or malformed, just truncate */ 252 if (error) { 253 error = 0; 254 break; 255 } 256 ps += done; 257 bytes_left -= done; 258 } 259 buflen = ps - buf; 260 FREE(ps_argvstr, M_TEMP); 261 } 262 263 buflen -= uio->uio_offset; 264 ps = bp + uio->uio_offset; 265 xlen = min(buflen, uio->uio_resid); 266 if (xlen <= 0) 267 error = 0; 268 else 269 error = uiomove_frombuf(bp, buflen, uio); 270 if (buf) 271 FREE(buf, M_TEMP); 272 return (error); 273 } 274