Return to procfs_status.c CVS log

Up to [Apple XNU] / XNU / bsd / miscfs / procfs

Annotation of XNU/bsd/miscfs/procfs/procfs_status.c, revision 1.1

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

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.