xref: /dragonfly/sys/vfs/procfs/procfs_rlimit.c (revision 13dd34d80aa1e622804053e295c7590882a7df3e)
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. Neither the name of the University nor the names of its contributors
18  *    may be used to endorse or promote products derived from this software
19  *    without specific prior written permission.
20  *
21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31  * SUCH DAMAGE.
32  *
33  *        @(#)procfs_status.c 8.4 (Berkeley) 6/15/94
34  *
35  * $FreeBSD: src/sys/miscfs/procfs/procfs_rlimit.c,v 1.5 1999/12/08 08:59:37 phk Exp $
36  */
37 
38 /*
39  * To get resource.h to include our rlimit_ident[] array of rlimit identifiers
40  */
41 
42 #define _RLIMIT_IDENT
43 
44 #include <sys/param.h>
45 #include <sys/systm.h>
46 #include <sys/uio.h>
47 #include <sys/proc.h>
48 #include <sys/vnode.h>
49 #include <sys/resourcevar.h>
50 #include <sys/resource.h>
51 #include <sys/types.h>
52 #include <vfs/procfs/procfs.h>
53 
54 
55 int
procfs_dorlimit(struct proc * curp,struct lwp * lp,struct pfsnode * pfs,struct uio * uio)56 procfs_dorlimit(struct proc *curp, struct lwp *lp, struct pfsnode *pfs,
57                     struct uio *uio)
58 {
59           struct proc *p = lp->lwp_proc;
60           size_t xlen;
61           char *ps;
62           int error;
63           int i;
64           char psbuf[512];              /* XXX - conservative */
65 
66           if (uio->uio_rw != UIO_READ)
67                     return (EOPNOTSUPP);
68 
69           ps = psbuf;
70 
71           for (i = 0; i < RLIM_NLIMITS; i++) {
72 
73                     /*
74                      * Add the rlimit ident
75                      */
76 
77                     ps += ksprintf(ps, "%s ", rlimit_ident[i]);
78 
79                     /*
80                      * Replace RLIM_INFINITY with -1 in the string
81                      */
82 
83                     /*
84                      * current limit
85                      */
86 
87                     if (p->p_rlimit[i].rlim_cur == RLIM_INFINITY) {
88                               ps += ksprintf(ps, "-1 ");
89                     } else {
90                               ps += ksprintf(ps, "%llu ",
91                                         (unsigned long long)p->p_rlimit[i].rlim_cur);
92                     }
93 
94                     /*
95                      * maximum limit
96                      */
97 
98                     if (p->p_rlimit[i].rlim_max == RLIM_INFINITY) {
99                               ps += ksprintf(ps, "-1\n");
100                     } else {
101                               ps += ksprintf(ps, "%llu\n",
102                                         (unsigned long long)p->p_rlimit[i].rlim_max);
103                     }
104           }
105 
106           xlen = ps - psbuf;
107           error = uiomove_frombuf(psbuf, xlen, uio);
108 
109           return (error);
110 }
111 
112