|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1999 Apple Computer, Inc. All rights reserved. ! 3: * ! 4: * @APPLE_LICENSE_HEADER_START@ ! 5: * ! 6: * Portions Copyright (c) 1999 Apple Computer, Inc. All Rights ! 7: * Reserved. This file contains Original Code and/or Modifications of ! 8: * Original Code as defined in and that are subject to the Apple Public ! 9: * Source License Version 1.1 (the "License"). You may not use this file ! 10: * except in compliance with the License. Please obtain a copy of the ! 11: * License at http://www.apple.com/publicsource and read it before using ! 12: * this file. ! 13: * ! 14: * The Original Code and all software distributed under the License are ! 15: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER ! 16: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, ! 17: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, ! 18: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the ! 19: * License for the specific language governing rights and limitations ! 20: * under the License. ! 21: * ! 22: * @APPLE_LICENSE_HEADER_END@ ! 23: */ ! 24: ! 25: /* $NetBSD: procfs_status.c,v 1.9 1994/06/29 06:34:56 cgd Exp $ */ ! 26: ! 27: /* ! 28: * Copyright (c) 1993 Jan-Simon Pendry ! 29: * Copyright (c) 1993 ! 30: * The Regents of the University of California. All rights reserved. ! 31: * ! 32: * This code is derived from software contributed to Berkeley by ! 33: * Jan-Simon Pendry. ! 34: * ! 35: * Redistribution and use in source and binary forms, with or without ! 36: * modification, are permitted provided that the following conditions ! 37: * are met: ! 38: * 1. Redistributions of source code must retain the above copyright ! 39: * notice, this list of conditions and the following disclaimer. ! 40: * 2. Redistributions in binary form must reproduce the above copyright ! 41: * notice, this list of conditions and the following disclaimer in the ! 42: * documentation and/or other materials provided with the distribution. ! 43: * 3. All advertising materials mentioning features or use of this software ! 44: * must display the following acknowledgement: ! 45: * This product includes software developed by the University of ! 46: * California, Berkeley and its contributors. ! 47: * 4. Neither the name of the University nor the names of its contributors ! 48: * may be used to endorse or promote products derived from this software ! 49: * without specific prior written permission. ! 50: * ! 51: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ! 52: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE ! 53: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ! 54: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE ! 55: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL ! 56: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS ! 57: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) ! 58: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT ! 59: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY ! 60: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF ! 61: * SUCH DAMAGE. ! 62: * ! 63: * @(#)procfs_status.c 8.4 (Berkeley) 6/15/94 ! 64: */ ! 65: ! 66: #include <sys/param.h> ! 67: #include <sys/systm.h> ! 68: #include <sys/time.h> ! 69: #include <sys/kernel.h> ! 70: #include <sys/proc.h> ! 71: #include <sys/vnode.h> ! 72: #include <sys/ioctl.h> ! 73: #include <sys/tty.h> ! 74: #include <sys/resource.h> ! 75: #include <sys/resourcevar.h> ! 76: #include <miscfs/procfs/procfs.h> ! 77: ! 78: int ! 79: procfs_dostatus(curp, p, pfs, uio) ! 80: struct proc *curp; ! 81: struct proc *p; ! 82: struct pfsnode *pfs; ! 83: struct uio *uio; ! 84: { ! 85: struct session *sess; ! 86: struct tty *tp; ! 87: struct ucred *cr; ! 88: char *ps; ! 89: char *sep; ! 90: int pid, ppid, pgid, sid; ! 91: int i; ! 92: int xlen; ! 93: int error; ! 94: char psbuf[256]; /* XXX - conservative */ ! 95: ! 96: if (uio->uio_rw != UIO_READ) ! 97: return (EOPNOTSUPP); ! 98: ! 99: pid = p->p_pid; ! 100: ppid = p->p_pptr ? p->p_pptr->p_pid : 0, ! 101: pgid = p->p_pgrp->pg_id; ! 102: sess = p->p_pgrp->pg_session; ! 103: sid = sess->s_leader ? sess->s_leader->p_pid : 0; ! 104: ! 105: /* comm pid ppid pgid sid maj,min ctty,sldr start ut st wmsg uid groups ... */ ! 106: ! 107: ps = psbuf; ! 108: bcopy(p->p_comm, ps, MAXCOMLEN); ! 109: ps[MAXCOMLEN] = '\0'; ! 110: ps += strlen(ps); ! 111: ps += sprintf(ps, " %d %d %d %d ", pid, ppid, pgid, sid); ! 112: ! 113: if ((p->p_flag&P_CONTROLT) && (tp = sess->s_ttyp)) ! 114: ps += sprintf(ps, "%d,%d ", major(tp->t_dev), minor(tp->t_dev)); ! 115: else ! 116: ps += sprintf(ps, "%d,%d ", -1, -1); ! 117: ! 118: sep = ""; ! 119: if (sess->s_ttyvp) { ! 120: ps += sprintf(ps, "%sctty", sep); ! 121: sep = ","; ! 122: } ! 123: if (SESS_LEADER(p)) { ! 124: ps += sprintf(ps, "%ssldr", sep); ! 125: sep = ","; ! 126: } ! 127: if (*sep != ',') ! 128: ps += sprintf(ps, "noflags"); ! 129: ! 130: if (p->p_flag & P_INMEM) ! 131: ps += sprintf(ps, " %d,%d", ! 132: p->p_stats->p_start.tv_sec, ! 133: p->p_stats->p_start.tv_usec); ! 134: else ! 135: ps += sprintf(ps, " -1,-1"); ! 136: ! 137: { ! 138: struct timeval ut, st; ! 139: ! 140: calcru(p, &ut, &st, (void *) 0); ! 141: ps += sprintf(ps, " %d,%d %d,%d", ! 142: ut.tv_sec, ! 143: ut.tv_usec, ! 144: st.tv_sec, ! 145: st.tv_usec); ! 146: } ! 147: ! 148: ps += sprintf(ps, " %s", ! 149: (p->p_wchan && p->p_wmesg) ? p->p_wmesg : "nochan"); ! 150: ! 151: cr = p->p_ucred; ! 152: ! 153: ps += sprintf(ps, " %d", cr->cr_uid); ! 154: for (i = 0; i < cr->cr_ngroups; i++) ! 155: ps += sprintf(ps, ",%d", cr->cr_groups[i]); ! 156: ps += sprintf(ps, "\n"); ! 157: ! 158: xlen = ps - psbuf; ! 159: xlen -= uio->uio_offset; ! 160: ps = psbuf + uio->uio_offset; ! 161: xlen = imin(xlen, uio->uio_resid); ! 162: if (xlen <= 0) ! 163: error = 0; ! 164: else ! 165: error = uiomove(ps, xlen, uio); ! 166: ! 167: return (error); ! 168: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.