mbufs.c revision 1.1.1.1       1 /*-
      2  * Copyright (c) 1980, 1992, 1993
      3  *	The Regents of the University of California.  All rights reserved.
      4  *
      5  * Redistribution and use in source and binary forms, with or without
      6  * modification, are permitted provided that the following conditions
      7  * are met:
      8  * 1. Redistributions of source code must retain the above copyright
      9  *    notice, this list of conditions and the following disclaimer.
     10  * 2. Redistributions in binary form must reproduce the above copyright
     11  *    notice, this list of conditions and the following disclaimer in the
     12  *    documentation and/or other materials provided with the distribution.
     13  * 3. All advertising materials mentioning features or use of this software
     14  *    must display the following acknowledgement:
     15  *	This product includes software developed by the University of
     16  *	California, Berkeley and its contributors.
     17  * 4. Neither the name of the University nor the names of its contributors
     18  *    may be used to endorse or promote products derived from this software
     19  *    without specific prior written permission.
     20  *
     21  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  * SUCH DAMAGE.
     32  */
     33 
     34 #ifndef lint
     35 static char sccsid[] = "@(#)mbufs.c	8.1 (Berkeley) 6/6/93";
     36 #endif /* not lint */
     37 
     38 #include <sys/param.h>
     39 #include <sys/types.h>
     40 #include <sys/mbuf.h>
     41 
     42 #include <stdlib.h>
     43 #include <string.h>
     44 #include <nlist.h>
     45 #include <paths.h>
     46 #include "systat.h"
     47 #include "extern.h"
     48 
     49 static struct mbstat *mb;
     50 
     51 char *mtnames[] = {
     52 	"free",
     53 	"data",
     54 	"headers",
     55 	"sockets",
     56 	"pcbs",
     57 	"routes",
     58 	"hosts",
     59 	"arps",
     60 	"socknames",
     61 	"zombies",
     62 	"sockopts",
     63 	"frags",
     64 	"rights",
     65 	"ifaddrs",
     66 };
     67 
     68 #define	NNAMES	(sizeof (mtnames) / sizeof (mtnames[0]))
     69 
     70 WINDOW *
     71 openmbufs()
     72 {
     73 	return (subwin(stdscr, LINES-5-1, 0, 5, 0));
     74 }
     75 
     76 void
     77 closembufs(w)
     78 	WINDOW *w;
     79 {
     80 	if (w == NULL)
     81 		return;
     82 	wclear(w);
     83 	wrefresh(w);
     84 	delwin(w);
     85 }
     86 
     87 void
     88 labelmbufs()
     89 {
     90 	wmove(wnd, 0, 0); wclrtoeol(wnd);
     91 	mvwaddstr(wnd, 0, 10,
     92 	    "/0   /5   /10  /15  /20  /25  /30  /35  /40  /45  /50  /55  /60");
     93 }
     94 
     95 void
     96 showmbufs()
     97 {
     98 	register int i, j, max, index;
     99 	char buf[10];
    100 
    101 	if (mb == 0)
    102 		return;
    103 	for (j = 0; j < wnd->maxy; j++) {
    104 		max = 0, index = -1;
    105 		for (i = 0; i < wnd->maxy; i++)
    106 			if (mb->m_mtypes[i] > max) {
    107 				max = mb->m_mtypes[i];
    108 				index = i;
    109 			}
    110 		if (max == 0)
    111 			break;
    112 		if (j > NNAMES)
    113 			mvwprintw(wnd, 1+j, 0, "%10d", index);
    114 		else
    115 			mvwprintw(wnd, 1+j, 0, "%-10.10s", mtnames[index]);
    116 		wmove(wnd, 1 + j, 10);
    117 		if (max > 60) {
    118 			sprintf(buf, " %d", max);
    119 			max = 60;
    120 			while (max--)
    121 				waddch(wnd, 'X');
    122 			waddstr(wnd, buf);
    123 		} else {
    124 			while (max--)
    125 				waddch(wnd, 'X');
    126 			wclrtoeol(wnd);
    127 		}
    128 		mb->m_mtypes[index] = 0;
    129 	}
    130 	wmove(wnd, 1+j, 0); wclrtobot(wnd);
    131 }
    132 
    133 static struct nlist namelist[] = {
    134 #define	X_MBSTAT	0
    135 	{ "_mbstat" },
    136 	{ "" }
    137 };
    138 
    139 int
    140 initmbufs()
    141 {
    142 	if (namelist[X_MBSTAT].n_type == 0) {
    143 		if (kvm_nlist(kd, namelist)) {
    144 			nlisterr(namelist);
    145 			return(0);
    146 		}
    147 		if (namelist[X_MBSTAT].n_type == 0) {
    148 			error("namelist on %s failed", _PATH_UNIX);
    149 			return(0);
    150 		}
    151 	}
    152 	if (mb == 0)
    153 		mb = (struct mbstat *)calloc(1, sizeof (*mb));
    154 	return(1);
    155 }
    156 
    157 void
    158 fetchmbufs()
    159 {
    160 	if (namelist[X_MBSTAT].n_type == 0)
    161 		return;
    162 	NREAD(X_MBSTAT, mb, sizeof (*mb));
    163 }
    164