1164d324ea
overflow was breaking a bunch of the stats, specifically the percentage displayed for wired memory. Fix the output for current/peak/max lines, I forgot to output the types. 161/320/51200 (current/peak/max): -to- 639/25696/51200 mbufs in use (current/peak/max):
361 lines
11 KiB
C
361 lines
11 KiB
C
/*
|
|
* Copyright (c) 1983, 1988, 1993
|
|
* The Regents of the University of California. 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.
|
|
* 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.
|
|
*/
|
|
|
|
#ifndef lint
|
|
#if 0
|
|
static char sccsid[] = "@(#)mbuf.c 8.1 (Berkeley) 6/6/93";
|
|
#endif
|
|
static const char rcsid[] =
|
|
"$FreeBSD$";
|
|
#endif /* not lint */
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/mbuf.h>
|
|
#include <sys/protosw.h>
|
|
#include <sys/socket.h>
|
|
#include <sys/sysctl.h>
|
|
|
|
#include <err.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include "netstat.h"
|
|
|
|
#define YES 1
|
|
typedef int bool;
|
|
|
|
static struct mbtypenames {
|
|
short mt_type;
|
|
const char *mt_name;
|
|
} mbtypenames[] = {
|
|
{ MT_DATA, "data" },
|
|
{ MT_OOBDATA, "oob data" },
|
|
{ MT_CONTROL, "ancillary data" },
|
|
{ MT_HEADER, "packet headers" },
|
|
#ifdef MT_SOCKET
|
|
{ MT_SOCKET, "socket structures" }, /* XXX */
|
|
#endif
|
|
#ifdef MT_PCB
|
|
{ MT_PCB, "protocol control blocks" }, /* XXX */
|
|
#endif
|
|
#ifdef MT_RTABLE
|
|
{ MT_RTABLE, "routing table entries" }, /* XXX */
|
|
#endif
|
|
#ifdef MT_HTABLE
|
|
{ MT_HTABLE, "IMP host table entries" }, /* XXX */
|
|
#endif
|
|
#ifdef MT_ATABLE
|
|
{ MT_ATABLE, "address resolution tables" },
|
|
#endif
|
|
{ MT_FTABLE, "fragment reassembly queue headers" }, /* XXX */
|
|
{ MT_SONAME, "socket names and addresses" },
|
|
#ifdef MT_SOOPTS
|
|
{ MT_SOOPTS, "socket options" },
|
|
#endif
|
|
#ifdef MT_RIGHTS
|
|
{ MT_RIGHTS, "access rights" },
|
|
#endif
|
|
#ifdef MT_IFADDR
|
|
{ MT_IFADDR, "interface addresses" }, /* XXX */
|
|
#endif
|
|
{ 0, 0 }
|
|
};
|
|
|
|
/*
|
|
* Print mbuf statistics.
|
|
*/
|
|
void
|
|
mbpr(u_long mbaddr, u_long mbtaddr __unused, u_long nmbcaddr, u_long nmbufaddr,
|
|
u_long mbhiaddr, u_long clhiaddr, u_long mbloaddr, u_long clloaddr,
|
|
u_long cpusaddr __unused, u_long pgsaddr, u_long mbpaddr)
|
|
{
|
|
int i, j, nmbufs, nmbclusters, page_size, num_objs;
|
|
u_int mbuf_hiwm, clust_hiwm, mbuf_lowm, clust_lowm;
|
|
unsigned long long totspace[2];
|
|
u_long totused[2];
|
|
u_long gentotnum, gentotfree, totnum, totfree;
|
|
short nmbtypes;
|
|
size_t mlen;
|
|
long *mbtypes = NULL;
|
|
struct mbstat *mbstat = NULL;
|
|
struct mbpstat **mbpstat = NULL;
|
|
struct mbtypenames *mp;
|
|
bool *seen = NULL;
|
|
|
|
mlen = sizeof *mbstat;
|
|
if ((mbstat = malloc(mlen)) == NULL) {
|
|
warn("malloc: cannot allocate memory for mbstat");
|
|
goto err;
|
|
}
|
|
|
|
/*
|
|
* XXX: Unfortunately, for the time being, we have to fetch
|
|
* the total length of the per-CPU stats area via sysctl
|
|
* (regardless of whether we're looking at a core or not.
|
|
*/
|
|
if (sysctlbyname("kern.ipc.mb_statpcpu", NULL, &mlen, NULL, 0) < 0) {
|
|
warn("sysctl: retrieving mb_statpcpu len");
|
|
goto err;
|
|
}
|
|
num_objs = (int)(mlen / sizeof(struct mbpstat));
|
|
if ((mbpstat = calloc(num_objs, sizeof(struct mbpstat *))) == NULL) {
|
|
warn("calloc: cannot allocate memory for mbpstats pointers");
|
|
goto err;
|
|
}
|
|
if ((mbpstat[0] = calloc(num_objs, sizeof(struct mbpstat))) == NULL) {
|
|
warn("calloc: cannot allocate memory for mbpstats");
|
|
goto err;
|
|
}
|
|
|
|
if (mbaddr) {
|
|
if (kread(mbpaddr, (char *)mbpstat[0], mlen))
|
|
goto err;
|
|
if (kread(mbaddr, (char *)mbstat, sizeof mbstat))
|
|
goto err;
|
|
if (kread(nmbcaddr, (char *)&nmbclusters, sizeof(int)))
|
|
goto err;
|
|
if (kread(nmbufaddr, (char *)&nmbufs, sizeof(int)))
|
|
goto err;
|
|
if (kread(mbhiaddr, (char *)&mbuf_hiwm, sizeof(u_int)))
|
|
goto err;
|
|
if (kread(clhiaddr, (char *)&clust_hiwm, sizeof(u_int)))
|
|
goto err;
|
|
if (kread(mbloaddr, (char *)&mbuf_lowm, sizeof(u_int)))
|
|
goto err;
|
|
if (kread(clloaddr, (char *)&clust_lowm, sizeof(u_int)))
|
|
goto err;
|
|
if (kread(pgsaddr, (char *)&page_size, sizeof(int)))
|
|
goto err;
|
|
} else {
|
|
if (sysctlbyname("kern.ipc.mb_statpcpu", mbpstat[0], &mlen,
|
|
NULL, 0) < 0) {
|
|
warn("sysctl: retrieving mb_statpcpu");
|
|
goto err;
|
|
}
|
|
mlen = sizeof *mbstat;
|
|
if (sysctlbyname("kern.ipc.mbstat", mbstat, &mlen, NULL, 0)
|
|
< 0) {
|
|
warn("sysctl: retrieving mbstat");
|
|
goto err;
|
|
}
|
|
mlen = sizeof(int);
|
|
if (sysctlbyname("kern.ipc.nmbclusters", &nmbclusters, &mlen,
|
|
NULL, 0) < 0) {
|
|
warn("sysctl: retrieving nmbclusters");
|
|
goto err;
|
|
}
|
|
mlen = sizeof(int);
|
|
if (sysctlbyname("kern.ipc.nmbufs", &nmbufs, &mlen, NULL, 0)
|
|
< 0) {
|
|
warn("sysctl: retrieving nmbufs");
|
|
goto err;
|
|
}
|
|
mlen = sizeof(u_int);
|
|
if (sysctlbyname("kern.ipc.mbuf_hiwm", &mbuf_hiwm, &mlen,
|
|
NULL, 0) < 0) {
|
|
warn("sysctl: retrieving mbuf_hiwm");
|
|
goto err;
|
|
}
|
|
mlen = sizeof(u_int);
|
|
if (sysctlbyname("kern.ipc.clust_hiwm", &clust_hiwm, &mlen,
|
|
NULL, 0) < 0) {
|
|
warn("sysctl: retrieving clust_hiwm");
|
|
goto err;
|
|
}
|
|
mlen = sizeof(u_int);
|
|
if (sysctlbyname("kern.ipc.mbuf_lowm", &mbuf_lowm, &mlen,
|
|
NULL, 0) < 0) {
|
|
warn("sysctl: retrieving mbuf_lowm");
|
|
goto err;
|
|
}
|
|
mlen = sizeof(u_int);
|
|
if (sysctlbyname("kern.ipc.clust_lowm", &clust_lowm, &mlen,
|
|
NULL, 0) < 0) {
|
|
warn("sysctl: retrieving clust_lowm");
|
|
goto err;
|
|
}
|
|
mlen = sizeof(int);
|
|
if (sysctlbyname("hw.pagesize", &page_size, &mlen, NULL, 0)
|
|
< 0) {
|
|
warn("sysctl: retrieving hw.pagesize");
|
|
goto err;
|
|
}
|
|
}
|
|
|
|
nmbtypes = mbstat->m_numtypes;
|
|
if ((seen = calloc(nmbtypes, sizeof(*seen))) == NULL) {
|
|
warn("calloc: cannot allocate memory for mbtypes seen flag");
|
|
goto err;
|
|
}
|
|
if ((mbtypes = calloc(nmbtypes, sizeof(long *))) == NULL) {
|
|
warn("calloc: cannot allocate memory for mbtypes");
|
|
goto err;
|
|
}
|
|
|
|
for (i = 0; i < num_objs; i++)
|
|
mbpstat[i] = mbpstat[0] + i;
|
|
|
|
#undef MSIZE
|
|
#define MSIZE (mbstat->m_msize)
|
|
#undef MCLBYTES
|
|
#define MCLBYTES (mbstat->m_mclbytes)
|
|
#define GENLST (num_objs - 1)
|
|
|
|
totnum = mbpstat[GENLST]->mb_mbbucks * mbstat->m_mbperbuck;
|
|
totfree = mbpstat[GENLST]->mb_mbfree;
|
|
for (j = 1; j < nmbtypes; j++)
|
|
mbtypes[j] += mbpstat[GENLST]->mb_mbtypes[j];
|
|
totspace[0] = mbpstat[GENLST]->mb_mbbucks * mbstat->m_mbperbuck * MSIZE;
|
|
for (i = 0; i < (num_objs - 1); i++) {
|
|
if (mbpstat[i]->mb_active == 0)
|
|
continue;
|
|
totspace[0] += mbpstat[i]->mb_mbbucks*mbstat->m_mbperbuck*MSIZE;
|
|
totnum += mbpstat[i]->mb_mbbucks * mbstat->m_mbperbuck;
|
|
totfree += mbpstat[i]->mb_mbfree;
|
|
for (j = 1; j < nmbtypes; j++)
|
|
mbtypes[j] += mbpstat[i]->mb_mbtypes[j];
|
|
}
|
|
totused[0] = totnum - totfree;
|
|
if (cflag) {
|
|
printf("mbuf usage:\n"
|
|
"\tTotal:\t\t%lu/%lu/%d (in use/in pool/max)\n",
|
|
totused[0], totnum, nmbufs);
|
|
gentotnum = mbpstat[GENLST]->mb_mbbucks * mbstat->m_mbperbuck;
|
|
gentotfree = mbpstat[GENLST]->mb_mbfree;
|
|
printf("\tGEN cache:\t%lu/%lu (in use/in pool)\n",
|
|
gentotnum - gentotfree, gentotnum);
|
|
} else {
|
|
/* XXX: peak is now wrong. */
|
|
printf("%lu/%lu/%d mbufs in use (current/peak/max):\n",
|
|
totused[0], totnum, nmbufs);
|
|
}
|
|
|
|
for (i = 0; cflag && i < (num_objs - 1); i++) {
|
|
if (mbpstat[i]->mb_active == 0)
|
|
continue;
|
|
printf("\tCPU #%d cache:\t%lu/%lu (in use/in pool)\n",
|
|
i,
|
|
(mbpstat[i]->mb_mbbucks * mbstat->m_mbperbuck -
|
|
mbpstat[i]->mb_mbfree),
|
|
(mbpstat[i]->mb_mbbucks * mbstat->m_mbperbuck));
|
|
}
|
|
if (cflag) {
|
|
printf("\tMbuf cache high watermark: %d\n", mbuf_hiwm);
|
|
#ifdef NOTYET
|
|
printf("\tMbuf cache low watermark: %d\n", mbuf_lowm);
|
|
#endif
|
|
}
|
|
for (mp = mbtypenames; mp->mt_name; mp++) {
|
|
if (mbtypes[mp->mt_type]) {
|
|
seen[mp->mt_type] = YES;
|
|
printf("\t %lu mbufs allocated to %s\n",
|
|
mbtypes[mp->mt_type], mp->mt_name);
|
|
}
|
|
}
|
|
for (i = 1; i < nmbtypes; i++) {
|
|
if (!seen[i] && mbtypes[i])
|
|
printf("\t %lu mbufs allocated to <mbuf type: %d>\n",
|
|
mbtypes[i], i);
|
|
}
|
|
if (cflag)
|
|
printf("\t%llu%% of mbuf map consumed\n",
|
|
((totspace[0] * 100) / (nmbufs * MSIZE)));
|
|
|
|
totnum = mbpstat[GENLST]->mb_clbucks * mbstat->m_clperbuck;
|
|
totfree = mbpstat[GENLST]->mb_clfree;
|
|
totspace[1] = mbpstat[GENLST]->mb_clbucks*mbstat->m_clperbuck*MCLBYTES;
|
|
for (i = 0; i < (num_objs - 1); i++) {
|
|
if (mbpstat[i]->mb_active == 0)
|
|
continue;
|
|
totspace[1] += mbpstat[i]->mb_clbucks * mbstat->m_clperbuck
|
|
* MCLBYTES;
|
|
totnum += mbpstat[i]->mb_clbucks * mbstat->m_clperbuck;
|
|
totfree += mbpstat[i]->mb_clfree;
|
|
}
|
|
totused[1] = totnum - totfree;
|
|
if (cflag) {
|
|
printf("mbuf cluster usage:\n"
|
|
"\tTotal:\t\t%lu/%lu/%d (in use/in pool/max)\n",
|
|
totused[1], totnum, nmbclusters);
|
|
gentotnum = mbpstat[GENLST]->mb_clbucks * mbstat->m_clperbuck;
|
|
gentotfree = mbpstat[GENLST]->mb_clfree;
|
|
printf("\tGEN cache:\t%lu/%lu (in use/in pool)\n",
|
|
gentotnum - gentotfree, gentotnum);
|
|
} else {
|
|
/* XXX: peak is now wrong. */
|
|
printf("%lu/%lu/%d mbuf clusters in use (current/peak/max)\n",
|
|
totused[1], totnum, nmbclusters);
|
|
}
|
|
for (i = 0; cflag && i < (num_objs - 1); i++) {
|
|
if (mbpstat[i]->mb_active == 0)
|
|
continue;
|
|
printf("\tCPU #%d cache:\t%lu/%lu (in use/in pool)\n",
|
|
i,
|
|
(mbpstat[i]->mb_clbucks * mbstat->m_clperbuck -
|
|
mbpstat[i]->mb_clfree),
|
|
(mbpstat[i]->mb_clbucks * mbstat->m_clperbuck));
|
|
}
|
|
if (cflag) {
|
|
printf("\tCluster cache high watermark: %d\n", clust_hiwm);
|
|
#ifdef NOTYET
|
|
printf("\tCluster cache low watermark: %d\n", clust_lowm);
|
|
#endif
|
|
}
|
|
if (cflag)
|
|
printf("\t%llu%% of cluster map consumed\n",
|
|
((totspace[1] * 100) / (nmbclusters * MCLBYTES)));
|
|
printf("%llu KBytes allocated to network "
|
|
"(%lluK mbuf, %lluK mbuf cluster)\n",
|
|
(totspace[0] + totspace[1]) / 1024,
|
|
totspace[0] / 1024,
|
|
totspace[1] / 1024);
|
|
printf("%lu requests for memory denied\n", mbstat->m_drops);
|
|
printf("%lu requests for memory delayed\n", mbstat->m_wait);
|
|
printf("%lu calls to protocol drain routines\n", mbstat->m_drain);
|
|
|
|
err:
|
|
if (mbtypes != NULL)
|
|
free(mbtypes);
|
|
if (seen != NULL)
|
|
free(seen);
|
|
if (mbstat != NULL)
|
|
free(mbstat);
|
|
if (mbpstat != NULL) {
|
|
if (mbpstat[0] != NULL)
|
|
free(mbpstat[0]);
|
|
free(mbpstat);
|
|
}
|
|
|
|
return;
|
|
}
|