df57947f08
The Software Package Data Exchange (SPDX) group provides a specification to make it easier for automated tools to detect and summarize well known opensource licenses. We are gradually adopting the specification, noting that the tags are considered only advisory and do not, in any way, superceed or replace the license texts. Special thanks to Wind River for providing access to "The Duke of Highlander" tool: an older (2014) run over FreeBSD tree was useful as a starting point. Initially, only tag files that use BSD 4-Clause "Original" license. RelNotes: yes Differential Revision: https://reviews.freebsd.org/D13133
117 lines
3.2 KiB
C
117 lines
3.2 KiB
C
/*-
|
|
* SPDX-License-Identifier: BSD-4-Clause
|
|
*
|
|
* 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
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
/*
|
|
* To get resource.h to include our rlimit_ident[] array of rlimit identifiers
|
|
*/
|
|
|
|
#define _RLIMIT_IDENT
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/lock.h>
|
|
#include <sys/mutex.h>
|
|
#include <sys/systm.h>
|
|
#include <sys/proc.h>
|
|
#include <sys/resourcevar.h>
|
|
#include <sys/resource.h>
|
|
#include <sys/sbuf.h>
|
|
#include <sys/types.h>
|
|
#include <sys/malloc.h>
|
|
|
|
#include <fs/pseudofs/pseudofs.h>
|
|
#include <fs/procfs/procfs.h>
|
|
|
|
|
|
int
|
|
procfs_doprocrlimit(PFS_FILL_ARGS)
|
|
{
|
|
struct plimit *limp;
|
|
int i;
|
|
|
|
/*
|
|
* Obtain a private reference to resource limits
|
|
*/
|
|
|
|
PROC_LOCK(p);
|
|
limp = lim_hold(p->p_limit);
|
|
PROC_UNLOCK(p);
|
|
|
|
for (i = 0; i < RLIM_NLIMITS; i++) {
|
|
|
|
/*
|
|
* Add the rlimit ident
|
|
*/
|
|
|
|
sbuf_printf(sb, "%s ", rlimit_ident[i]);
|
|
|
|
/*
|
|
* Replace RLIM_INFINITY with -1 in the string
|
|
*/
|
|
|
|
/*
|
|
* current limit
|
|
*/
|
|
|
|
if (limp->pl_rlimit[i].rlim_cur == RLIM_INFINITY) {
|
|
sbuf_printf(sb, "-1 ");
|
|
} else {
|
|
sbuf_printf(sb, "%llu ",
|
|
(unsigned long long)limp->pl_rlimit[i].rlim_cur);
|
|
}
|
|
|
|
/*
|
|
* maximum limit
|
|
*/
|
|
|
|
if (limp->pl_rlimit[i].rlim_max == RLIM_INFINITY) {
|
|
sbuf_printf(sb, "-1\n");
|
|
} else {
|
|
sbuf_printf(sb, "%llu\n",
|
|
(unsigned long long)limp->pl_rlimit[i].rlim_max);
|
|
}
|
|
}
|
|
|
|
lim_free(limp);
|
|
return (0);
|
|
}
|