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 */ 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/resourcevar.h> 53 #include <sys/resource.h> 54 #include <sys/types.h> 55 #include <miscfs/procfs/procfs.h> 56 57 58 int 59 procfs_dorlimit(curp, p, pfs, uio) 60 struct proc *curp; 61 struct proc *p; 62 struct pfsnode *pfs; 63 struct uio *uio; 64 { 65 char *ps; 66 int i; 67 int xlen; 68 int error; 69 char psbuf[512]; /* XXX - conservative */ 70 71 if (uio->uio_rw != UIO_READ) 72 return (EOPNOTSUPP); 73 74 75 ps = psbuf; 76 77 for (i = 0; i < RLIM_NLIMITS; i++) { 78 79 /* 80 * Add the rlimit ident 81 */ 82 83 ps += sprintf(ps, "%s ", rlimit_ident[i]); 84 85 /* 86 * Replace RLIM_INFINITY with -1 in the string 87 */ 88 89 /* 90 * current limit 91 */ 92 93 if (p->p_rlimit[i].rlim_cur == RLIM_INFINITY) { 94 ps += sprintf(ps, "-1 "); 95 } else { 96 ps += sprintf(ps, "%llu ", 97 (unsigned long long)p->p_rlimit[i].rlim_cur); 98 } 99 100 /* 101 * maximum limit 102 */ 103 104 if (p->p_rlimit[i].rlim_max == RLIM_INFINITY) { 105 ps += sprintf(ps, "-1\n"); 106 } else { 107 ps += sprintf(ps, "%llu\n", 108 (unsigned long long)p->p_rlimit[i].rlim_max); 109 } 110 } 111 112 /* 113 * This logic is rather tasty - but its from procfs_status.c, so 114 * I guess I'll use it here. 115 */ 116 117 xlen = ps - psbuf; 118 xlen -= uio->uio_offset; 119 ps = psbuf + uio->uio_offset; 120 xlen = imin(xlen, uio->uio_resid); 121 if (xlen <= 0) 122 error = 0; 123 else 124 error = uiomove(ps, xlen, uio); 125 126 return (error); 127 } 128 129