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