procfs_rlimit.c revision 46201 
1/*
2 * Copyright (c) 1999 Adrian Chadd
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 *	$Id: procfs_status.c,v 1.12 1999/01/05 03:53:06 peter Exp $
40 */
41
42/*
43 * To get resource.h to include our rlimit_ident[] array of rlimit identifiers
44 */
45
46#define _RLIMIT_IDENT
47
48#include <sys/param.h>
49#include <sys/systm.h>
50#include <sys/proc.h>
51#include <sys/vnode.h>
52#include <sys/tty.h>
53#include <sys/resourcevar.h>
54#include <sys/resource.h>
55#include <sys/types.h>
56#include <miscfs/procfs/procfs.h>
57
58
59/*
60 * This converts a quad_t to a string, stored in fin
61 * It is here because there doesn't exist a quad_t entry in the kernel
62 * printf() library.
63 */
64
65static void quadtostring (char *fin, quad_t num)
66{
67	char str[128];
68	char *cp;
69	int i, n;
70
71	cp = str;
72	i = 0;
73
74	/*
75	 * Create the number string.
76	 * The string will be in reverse from the original number.
77	 */
78
79	while (num) {
80		*(cp++) = (num % 10) + '0';
81		num /= 10;
82		i++;
83	}
84
85	/* Null terminate */
86	*cp = '\0';
87
88	/*
89	 * Now, swap the order
90	 */
91
92	for (n = 0; n < i; n++) {
93  		fin[n] = str[(i-1)-n];
94	}
95
96	/* Null terminate */
97	fin[n] = '\0';
98
99	return;
100}
101
102
103
104int
105procfs_dorlimit(curp, p, pfs, uio)
106	struct proc *curp;
107	struct proc *p;
108	struct pfsnode *pfs;
109	struct uio *uio;
110{
111	char *ps;
112	int i;
113	int xlen;
114	int error;
115	char psbuf[512];		/* XXX - conservative */
116	char qstr[64];
117
118	if (uio->uio_rw != UIO_READ)
119		return (EOPNOTSUPP);
120
121
122	ps = psbuf;
123
124	for (i = 0; i < RLIM_NLIMITS; i++) {
125
126		/*
127		 * Add the rlimit ident
128		 */
129
130		ps += sprintf(ps, "%s ", rlimit_ident[i]);
131
132		/*
133		 * Replace RLIM_INFINITY with -1 in the string
134		 */
135
136		/*
137		 * current limit
138		 */
139
140		if (p->p_rlimit[i].rlim_cur == RLIM_INFINITY) {
141			ps += sprintf(ps, "-1 ");
142		} else {
143			quadtostring(qstr, p->p_rlimit[i].rlim_cur);
144			ps += sprintf(ps, "%s ", qstr);
145		}
146
147		/*
148		 * maximum limit
149		 */
150
151		if (p->p_rlimit[i].rlim_max == RLIM_INFINITY) {
152			ps += sprintf(ps, "-1\n");
153		} else {
154			quadtostring(qstr, p->p_rlimit[i].rlim_max);
155			ps += sprintf(ps, "%s\n", qstr);
156		}
157	}
158
159	/*
160	 * This logic is rather tasty - but its from procfs_status.c, so
161	 * I guess I'll use it here.
162	 */
163
164	xlen = ps - psbuf;
165	xlen -= uio->uio_offset;
166	ps = psbuf + uio->uio_offset;
167	xlen = imin(xlen, uio->uio_resid);
168	if (xlen <= 0)
169		error = 0;
170	else
171		error = uiomove(ps, xlen, uio);
172
173	return (error);
174}
175
176