xref: /netbsd-src/bin/ps/nlist.c (revision ae9172d6cd9432a6a1a56760d86b32c57a66c39c)
1 /*-
2  * Copyright (c) 1990, 1993, 1994
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[] = "@(#)nlist.c	8.4 (Berkeley) 4/2/94";
36 #endif /* not lint */
37 
38 #include <sys/param.h>
39 #include <sys/time.h>
40 #include <sys/proc.h>
41 #include <sys/resource.h>
42 
43 #include <err.h>
44 #include <errno.h>
45 #include <kvm.h>
46 #include <nlist.h>
47 #include <stdio.h>
48 #include <string.h>
49 #include <unistd.h>
50 
51 #include "ps.h"
52 
53 #ifdef P_PPWAIT
54 #define NEWVM
55 #endif
56 
57 struct	nlist psnl[] = {
58 	{"_fscale"},
59 #define	X_FSCALE	0
60 	{"_ccpu"},
61 #define	X_CCPU		1
62 #ifdef NEWVM
63 	{"_avail_start"},
64 #define	X_AVAILSTART	2
65 	{"_avail_end"},
66 #define	X_AVAILEND	3
67 #else
68 	{"_ecmx"},
69 #define	X_ECMX		2
70 #endif
71 	{NULL}
72 };
73 
74 fixpt_t	ccpu;				/* kernel _ccpu variable */
75 int	nlistread;			/* if nlist already read. */
76 int	mempages;			/* number of pages of phys. memory */
77 int	fscale;				/* kernel _fscale variable */
78 
79 extern kvm_t *kd;
80 
81 #define kread(x, v) \
82 	kvm_read(kd, psnl[x].n_value, (char *)&v, sizeof v) != sizeof(v)
83 
84 int
85 donlist()
86 {
87 	int rval;
88 #ifdef NEWVM
89 	int tmp;
90 #endif
91 
92 	rval = 0;
93 	nlistread = 1;
94 	if (kvm_nlist(kd, psnl)) {
95 		nlisterr(psnl);
96 		eval = 1;
97 		return (1);
98 	}
99 	if (kread(X_FSCALE, fscale)) {
100 		warnx("fscale: %s", kvm_geterr(kd));
101 		eval = rval = 1;
102 	}
103 #ifdef NEWVM
104 	if (kread(X_AVAILEND, mempages)) {
105 		warnx("avail_start: %s", kvm_geterr(kd));
106 		eval = rval = 1;
107 	}
108 	if (kread(X_AVAILSTART, tmp)) {
109 		warnx("avail_end: %s", kvm_geterr(kd));
110 		eval = rval = 1;
111 	}
112 	mempages -= tmp;
113 	mempages /= getpagesize();
114 #else
115 	if (kread(X_ECMX, mempages)) {
116 		warnx("ecmx: %s", kvm_geterr(kd));
117 		eval = rval = 1;
118 	}
119 #endif
120 	if (kread(X_CCPU, ccpu)) {
121 		warnx("ccpu: %s", kvm_geterr(kd));
122 		eval = rval = 1;
123 	}
124 	return (rval);
125 }
126 
127 void
128 nlisterr(nl)
129 	struct nlist nl[];
130 {
131 	int i;
132 
133 	(void)fprintf(stderr, "ps: nlist: can't find following symbols:");
134 	for (i = 0; nl[i].n_name != NULL; i++)
135 		if (nl[i].n_value == 0)
136 			(void)fprintf(stderr, " %s", nl[i].n_name);
137 	(void)fprintf(stderr, "\n");
138 }
139