85a0ddfd0b
user. Kqueue now saves the ucred of the allocating thread, to correctly decrement the counter on close. Under some specific and not real-world use scenario for kqueue, it is possible for the kqueues to consume memory proportional to the square of the number of the filedescriptors available to the process. Limit allows administrator to prevent the abuse. This is kernel-mode side of the change, with the user-mode enabling commit following. Reported and tested by: pho Discussed with: jmg Sponsored by: The FreeBSD Foundation MFC after: 2 weeks
108 lines
3.3 KiB
C
108 lines
3.3 KiB
C
/*-
|
|
* Copyright (c) 2011 Mikolaj Golub
|
|
* All rights reserved.
|
|
*
|
|
* 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.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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.
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/time.h>
|
|
#include <sys/resourcevar.h>
|
|
#include <sys/sysctl.h>
|
|
#include <sys/user.h>
|
|
|
|
#include <err.h>
|
|
#include <errno.h>
|
|
#include <libprocstat.h>
|
|
#include <libutil.h>
|
|
#include <limits.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#include "procstat.h"
|
|
|
|
static struct {
|
|
const char *name;
|
|
const char *suffix;
|
|
} rlimit_param[14] = {
|
|
{"cputime", "sec"},
|
|
{"filesize", "B "},
|
|
{"datasize", "B "},
|
|
{"stacksize", "B "},
|
|
{"coredumpsize", "B "},
|
|
{"memoryuse", "B "},
|
|
{"memorylocked", "B "},
|
|
{"maxprocesses", " "},
|
|
{"openfiles", " "},
|
|
{"sbsize", "B "},
|
|
{"vmemoryuse", "B "},
|
|
{"pseudo-terminals", " "},
|
|
{"swapuse", "B "},
|
|
{"kqueues", " "},
|
|
};
|
|
|
|
#if RLIM_NLIMITS > 14
|
|
#error "Resource limits have grown. Add new entries to rlimit_param[]."
|
|
#endif
|
|
|
|
static const char *
|
|
humanize_rlimit(int indx, rlim_t limit)
|
|
{
|
|
static char buf[14];
|
|
int scale;
|
|
|
|
if (limit == RLIM_INFINITY)
|
|
return ("infinity ");
|
|
|
|
scale = humanize_number(buf, sizeof(buf) - 1, (int64_t)limit,
|
|
rlimit_param[indx].suffix, HN_AUTOSCALE | HN_GETSCALE, HN_DECIMAL);
|
|
(void)humanize_number(buf, sizeof(buf) - 1, (int64_t)limit,
|
|
rlimit_param[indx].suffix, HN_AUTOSCALE, HN_DECIMAL);
|
|
/* Pad with one space if there is no suffix prefix. */
|
|
if (scale == 0)
|
|
sprintf(buf + strlen(buf), " ");
|
|
return (buf);
|
|
}
|
|
|
|
void
|
|
procstat_rlimit(struct procstat *prstat, struct kinfo_proc *kipp)
|
|
{
|
|
struct rlimit rlimit;
|
|
int i;
|
|
|
|
if (!hflag) {
|
|
printf("%5s %-16s %-16s %16s %16s\n",
|
|
"PID", "COMM", "RLIMIT", "SOFT ", "HARD ");
|
|
}
|
|
for (i = 0; i < RLIM_NLIMITS; i++) {
|
|
if (procstat_getrlimit(prstat, kipp, i, &rlimit) == -1)
|
|
return;
|
|
printf("%5d %-16s %-16s ", kipp->ki_pid, kipp->ki_comm,
|
|
rlimit_param[i].name);
|
|
printf("%16s ", humanize_rlimit(i, rlimit.rlim_cur));
|
|
printf("%16s\n", humanize_rlimit(i, rlimit.rlim_max));
|
|
}
|
|
}
|