2005-01-06 18:10:42 +00:00
|
|
|
/*-
|
1999-04-30 13:04:21 +00:00
|
|
|
* Copyright (c) 1999 Adrian Chadd
|
|
|
|
* Copyright (c) 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* This code is derived from software contributed to Berkeley by
|
|
|
|
* Jan-Simon Pendry.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* This product includes software developed by the University of
|
|
|
|
* California, Berkeley and its contributors.
|
|
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* @(#)procfs_status.c 8.4 (Berkeley) 6/15/94
|
|
|
|
*
|
1999-08-28 01:08:13 +00:00
|
|
|
* $FreeBSD$
|
1999-04-30 13:04:21 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* To get resource.h to include our rlimit_ident[] array of rlimit identifiers
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define _RLIMIT_IDENT
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
2004-02-04 21:52:57 +00:00
|
|
|
#include <sys/lock.h>
|
|
|
|
#include <sys/mutex.h>
|
1999-04-30 13:04:21 +00:00
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/proc.h>
|
|
|
|
#include <sys/resourcevar.h>
|
|
|
|
#include <sys/resource.h>
|
2001-12-04 01:35:06 +00:00
|
|
|
#include <sys/sbuf.h>
|
2004-02-04 21:52:57 +00:00
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/malloc.h>
|
2001-12-04 01:35:06 +00:00
|
|
|
|
|
|
|
#include <fs/pseudofs/pseudofs.h>
|
2001-05-23 09:42:29 +00:00
|
|
|
#include <fs/procfs/procfs.h>
|
1999-04-30 13:04:21 +00:00
|
|
|
|
|
|
|
|
|
|
|
int
|
2001-12-04 01:35:06 +00:00
|
|
|
procfs_doprocrlimit(PFS_FILL_ARGS)
|
1999-04-30 13:04:21 +00:00
|
|
|
{
|
2004-02-04 21:52:57 +00:00
|
|
|
struct plimit *limp;
|
1999-04-30 13:04:21 +00:00
|
|
|
int i;
|
|
|
|
|
2004-02-04 21:52:57 +00:00
|
|
|
/*
|
|
|
|
* Obtain a private reference to resource limits
|
|
|
|
*/
|
|
|
|
|
|
|
|
PROC_LOCK(p);
|
|
|
|
limp = lim_hold(p->p_limit);
|
|
|
|
PROC_UNLOCK(p);
|
|
|
|
|
1999-04-30 13:04:21 +00:00
|
|
|
for (i = 0; i < RLIM_NLIMITS; i++) {
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Add the rlimit ident
|
|
|
|
*/
|
|
|
|
|
2001-12-04 01:35:06 +00:00
|
|
|
sbuf_printf(sb, "%s ", rlimit_ident[i]);
|
1999-04-30 13:04:21 +00:00
|
|
|
|
2003-12-07 17:40:00 +00:00
|
|
|
/*
|
1999-04-30 13:04:21 +00:00
|
|
|
* Replace RLIM_INFINITY with -1 in the string
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* current limit
|
|
|
|
*/
|
|
|
|
|
2004-02-04 21:52:57 +00:00
|
|
|
if (limp->pl_rlimit[i].rlim_cur == RLIM_INFINITY) {
|
2001-12-04 01:35:06 +00:00
|
|
|
sbuf_printf(sb, "-1 ");
|
1999-04-30 13:04:21 +00:00
|
|
|
} else {
|
2001-12-04 01:35:06 +00:00
|
|
|
sbuf_printf(sb, "%llu ",
|
2004-02-04 21:52:57 +00:00
|
|
|
(unsigned long long)limp->pl_rlimit[i].rlim_cur);
|
1999-04-30 13:04:21 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* maximum limit
|
|
|
|
*/
|
|
|
|
|
2004-02-04 21:52:57 +00:00
|
|
|
if (limp->pl_rlimit[i].rlim_max == RLIM_INFINITY) {
|
2001-12-04 01:35:06 +00:00
|
|
|
sbuf_printf(sb, "-1\n");
|
1999-04-30 13:04:21 +00:00
|
|
|
} else {
|
2001-12-04 01:35:06 +00:00
|
|
|
sbuf_printf(sb, "%llu\n",
|
2004-02-04 21:52:57 +00:00
|
|
|
(unsigned long long)limp->pl_rlimit[i].rlim_max);
|
1999-04-30 13:04:21 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2004-02-04 21:52:57 +00:00
|
|
|
lim_free(limp);
|
2001-12-04 01:35:06 +00:00
|
|
|
return (0);
|
1999-04-30 13:04:21 +00:00
|
|
|
}
|