Home | History | Annotate | Line # | Download | only in procfs
procfs_status.c revision 1.35
      1 /*	$NetBSD: procfs_status.c,v 1.35 2009/01/11 02:45:53 christos Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * This code is derived from software contributed to Berkeley by
      8  * Jan-Simon Pendry.
      9  *
     10  * Redistribution and use in source and binary forms, with or without
     11  * modification, are permitted provided that the following conditions
     12  * are met:
     13  * 1. Redistributions of source code must retain the above copyright
     14  *    notice, this list of conditions and the following disclaimer.
     15  * 2. Redistributions in binary form must reproduce the above copyright
     16  *    notice, this list of conditions and the following disclaimer in the
     17  *    documentation and/or other materials provided with the distribution.
     18  * 3. Neither the name of the University nor the names of its contributors
     19  *    may be used to endorse or promote products derived from this software
     20  *    without specific prior written permission.
     21  *
     22  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     23  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     24  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     25  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     26  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     27  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     28  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     29  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     30  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     31  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     32  * SUCH DAMAGE.
     33  *
     34  *	@(#)procfs_status.c	8.4 (Berkeley) 6/15/94
     35  */
     36 
     37 /*
     38  * Copyright (c) 1993 Jan-Simon Pendry
     39  *
     40  * This code is derived from software contributed to Berkeley by
     41  * Jan-Simon Pendry.
     42  *
     43  * Redistribution and use in source and binary forms, with or without
     44  * modification, are permitted provided that the following conditions
     45  * are met:
     46  * 1. Redistributions of source code must retain the above copyright
     47  *    notice, this list of conditions and the following disclaimer.
     48  * 2. Redistributions in binary form must reproduce the above copyright
     49  *    notice, this list of conditions and the following disclaimer in the
     50  *    documentation and/or other materials provided with the distribution.
     51  * 3. All advertising materials mentioning features or use of this software
     52  *    must display the following acknowledgement:
     53  *	This product includes software developed by the University of
     54  *	California, Berkeley and its contributors.
     55  * 4. Neither the name of the University nor the names of its contributors
     56  *    may be used to endorse or promote products derived from this software
     57  *    without specific prior written permission.
     58  *
     59  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     60  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     61  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     62  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     63  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     64  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     65  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     66  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     67  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     68  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     69  * SUCH DAMAGE.
     70  *
     71  *	@(#)procfs_status.c	8.4 (Berkeley) 6/15/94
     72  */
     73 
     74 #include <sys/cdefs.h>
     75 __KERNEL_RCSID(0, "$NetBSD: procfs_status.c,v 1.35 2009/01/11 02:45:53 christos Exp $");
     76 
     77 #include <sys/param.h>
     78 #include <sys/systm.h>
     79 #include <sys/time.h>
     80 #include <sys/kernel.h>
     81 #include <sys/proc.h>
     82 #include <sys/vnode.h>
     83 #include <sys/ioctl.h>
     84 #include <sys/tty.h>
     85 #include <sys/resource.h>
     86 #include <sys/resourcevar.h>
     87 #include <sys/kauth.h>
     88 
     89 #include <miscfs/procfs/procfs.h>
     90 
     91 int
     92 procfs_dostatus(
     93     struct lwp *curl,
     94     struct lwp *l,
     95     struct pfsnode *pfs,
     96     struct uio *uio
     97 )
     98 {
     99 	struct session *sess;
    100 	struct tty *tp;
    101 	kauth_cred_t cr;
    102 	struct proc *p = l->l_proc;
    103 	char *ps;
    104 	const char *sep;
    105 	int pid, ppid, pgid, sid;
    106 	u_int i;
    107 	char psbuf[256+MAXHOSTNAMELEN];		/* XXX - conservative */
    108 	uint16_t ngroups;
    109 
    110 	if (uio->uio_rw != UIO_READ)
    111 		return (EOPNOTSUPP);
    112 
    113 	mutex_enter(proc_lock);
    114 	mutex_enter(p->p_lock);
    115 
    116 	pid = p->p_pid;
    117 	ppid = p->p_pptr ? p->p_pptr->p_pid : 0,
    118 	pgid = p->p_pgrp->pg_id;
    119 	sess = p->p_pgrp->pg_session;
    120 	sid = sess->s_sid;
    121 
    122 /* comm pid ppid pgid sid maj,min ctty,sldr start ut st wmsg uid gid groups ... */
    123 
    124 	ps = psbuf;
    125 	memcpy(ps, p->p_comm, MAXCOMLEN);
    126 	ps[MAXCOMLEN] = '\0';
    127 	ps += strlen(ps);
    128 	ps += snprintf(ps, sizeof(psbuf) - (ps - psbuf), " %d %d %d %d ",
    129 	    pid, ppid, pgid, sid);
    130 
    131 	if ((p->p_lflag & PL_CONTROLT) && (tp = sess->s_ttyp))
    132 		ps += snprintf(ps, sizeof(psbuf) - (ps - psbuf), "%llu,%llu ",
    133 		    (unsigned long long)major(tp->t_dev),
    134 		    (unsigned long long)minor(tp->t_dev));
    135 	else
    136 		ps += snprintf(ps, sizeof(psbuf) - (ps - psbuf), "%d,%d ",
    137 		    -1, -1);
    138 
    139 	sep = "";
    140 	if (sess->s_ttyvp) {
    141 		ps += snprintf(ps, sizeof(psbuf) - (ps - psbuf), "%sctty", sep);
    142 		sep = ",";
    143 	}
    144 	if (SESS_LEADER(p)) {
    145 		ps += snprintf(ps, sizeof(psbuf) - (ps - psbuf), "%ssldr", sep);
    146 		sep = ",";
    147 	}
    148 	if (*sep != ',')
    149 		ps += snprintf(ps, sizeof(psbuf) - (ps - psbuf), "noflags");
    150 
    151 	if (l->l_flag & LW_INMEM)
    152 		ps += snprintf(ps, sizeof(psbuf) - (ps - psbuf), " %lld,%ld",
    153 		    (long long)p->p_stats->p_start.tv_sec,
    154 		    (long)p->p_stats->p_start.tv_usec);
    155 	else
    156 		ps += snprintf(ps, sizeof(psbuf) - (ps - psbuf), " -1,-1");
    157 
    158 	{
    159 		struct timeval ut, st;
    160 
    161 		calcru(p, &ut, &st, (void *) 0, NULL);
    162 		ps += snprintf(ps, sizeof(psbuf) - (ps - psbuf),
    163 		    " %lld,%ld %lld,%ld", (long long)ut.tv_sec,
    164 		    (long)ut.tv_usec, (long long)st.tv_sec, (long)st.tv_usec);
    165 	}
    166 
    167 	lwp_lock(l);
    168 	ps += snprintf(ps, sizeof(psbuf) - (ps - psbuf), " %s",
    169 	    (l->l_wchan && l->l_wmesg) ? l->l_wmesg : "nochan");
    170 	lwp_unlock(l);
    171 
    172 	cr = p->p_cred;
    173 
    174 	ps += snprintf(ps, sizeof(psbuf) - (ps - psbuf), " %d",
    175 		       kauth_cred_geteuid(cr));
    176 	ps += snprintf(ps, sizeof(psbuf) - (ps - psbuf), " %d",
    177 		       kauth_cred_getegid(cr));
    178 	ngroups = kauth_cred_ngroups(cr);
    179 	for (i = 0; i < ngroups; i++)
    180 		ps += snprintf(ps, sizeof(psbuf) - (ps - psbuf), ",%d",
    181 		    kauth_cred_group(cr, i));
    182 	ps += snprintf(ps, sizeof(psbuf) - (ps - psbuf), "\n");
    183 
    184 	mutex_exit(p->p_lock);
    185 	mutex_exit(proc_lock);
    186 
    187 	return (uiomove_frombuf(psbuf, ps - psbuf, uio));
    188 }
    189