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 * $FreeBSD: src/sys/miscfs/procfs/procfs_rlimit.c,v 1.5 1999/12/08 08:59:37 phk Exp $ 40 * $DragonFly: src/sys/vfs/procfs/procfs_rlimit.c,v 1.7 2007/02/19 01:14:24 corecode Exp $ 41 */ 42 43 /* 44 * To get resource.h to include our rlimit_ident[] array of rlimit identifiers 45 */ 46 47 #define _RLIMIT_IDENT 48 49 #include <sys/param.h> 50 #include <sys/systm.h> 51 #include <sys/proc.h> 52 #include <sys/vnode.h> 53 #include <sys/resourcevar.h> 54 #include <sys/resource.h> 55 #include <sys/types.h> 56 #include <vfs/procfs/procfs.h> 57 58 59 int 60 procfs_dorlimit(struct proc *curp, struct lwp *lp, struct pfsnode *pfs, 61 struct uio *uio) 62 { 63 struct proc *p = lp->lwp_proc; 64 char *ps; 65 int i; 66 int xlen; 67 int error; 68 char psbuf[512]; /* XXX - conservative */ 69 70 if (uio->uio_rw != UIO_READ) 71 return (EOPNOTSUPP); 72 73 74 ps = psbuf; 75 76 for (i = 0; i < RLIM_NLIMITS; i++) { 77 78 /* 79 * Add the rlimit ident 80 */ 81 82 ps += ksprintf(ps, "%s ", rlimit_ident[i]); 83 84 /* 85 * Replace RLIM_INFINITY with -1 in the string 86 */ 87 88 /* 89 * current limit 90 */ 91 92 if (p->p_rlimit[i].rlim_cur == RLIM_INFINITY) { 93 ps += ksprintf(ps, "-1 "); 94 } else { 95 ps += ksprintf(ps, "%llu ", 96 (unsigned long long)p->p_rlimit[i].rlim_cur); 97 } 98 99 /* 100 * maximum limit 101 */ 102 103 if (p->p_rlimit[i].rlim_max == RLIM_INFINITY) { 104 ps += ksprintf(ps, "-1\n"); 105 } else { 106 ps += ksprintf(ps, "%llu\n", 107 (unsigned long long)p->p_rlimit[i].rlim_max); 108 } 109 } 110 111 /* 112 * This logic is rather tasty - but its from procfs_status.c, so 113 * I guess I'll use it here. 114 */ 115 116 xlen = ps - psbuf; 117 xlen -= uio->uio_offset; 118 ps = psbuf + uio->uio_offset; 119 xlen = imin(xlen, uio->uio_resid); 120 if (xlen <= 0) 121 error = 0; 122 else 123 error = uiomove_frombuf(psbuf, ps - psbuf, uio); 124 return (error); 125 } 126 127