1/*-
2 * Copyright (c) 1989, 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
| 1/*-
2 * Copyright (c) 1989, 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
|
40#endif
41#endif /* LIBC_SCCS and not lint */
42
43/*
44 * File list interface for kvm. pstat, fstat and netstat are
45 * users of this code, so we've factored it out into a separate module.
46 * Thus, we keep this grunge out of the other kvm applications (i.e.,
47 * most other applications are interested only in open/close/read/nlist).
48 */
49
50#include <sys/param.h>
51#include <sys/lock.h>
52#include <sys/mutex.h>
53#include <sys/user.h>
54#include <sys/proc.h>
55#define _KERNEL
56#include <sys/file.h>
57#undef _KERNEL
58#include <sys/stat.h>
59#include <sys/ioctl.h>
60#include <nlist.h>
61#include <kvm.h>
62
63#include <vm/vm.h>
64#include <vm/vm_param.h>
65#include <vm/swap_pager.h>
66
67#include <sys/sysctl.h>
68
69#include <limits.h>
70#include <ndbm.h>
71#include <paths.h>
72
73#include "kvm_private.h"
74
75#define KREAD(kd, addr, obj) \
76 (kvm_read(kd, addr, obj, sizeof(*obj)) != sizeof(*obj))
77
78/*
79 * Get file structures.
80 */
81static int
82kvm_deadfiles(kd, op, arg, filehead_o, nfiles)
83 kvm_t *kd;
84 int op, arg, nfiles;
85 long filehead_o;
86{
87 int buflen = kd->arglen, n = 0;
88 struct file *fp;
89 register char *where = kd->argspc;
90 struct filelist filehead;
91
92 /*
93 * first copyout filehead
94 */
95 if (buflen > sizeof (filehead)) {
96 if (KREAD(kd, filehead_o, &filehead)) {
97 _kvm_err(kd, kd->program, "can't read filehead");
98 return (0);
99 }
100 buflen -= sizeof (filehead);
101 where += sizeof (filehead);
102 *(struct filelist *)kd->argspc = filehead;
103 }
104 /*
105 * followed by an array of file structures
106 */
107 LIST_FOREACH(fp, &filehead, f_list) {
108 if (buflen > sizeof (struct file)) {
109 if (KREAD(kd, (long)fp, ((struct file *)where))) {
110 _kvm_err(kd, kd->program, "can't read kfp");
111 return (0);
112 }
113 buflen -= sizeof (struct file);
114 fp = (struct file *)where;
115 where += sizeof (struct file);
116 n++;
117 }
118 }
119 if (n != nfiles) {
120 _kvm_err(kd, kd->program, "inconsistant nfiles");
121 return (0);
122 }
123 return (nfiles);
124}
125
126char *
127kvm_getfiles(kd, op, arg, cnt)
128 kvm_t *kd;
129 int op, arg;
130 int *cnt;
131{
132 int mib[2], st, nfiles;
133 size_t size;
134 struct file *fp, *fplim;
135 struct filelist filehead;
136
137 if (ISALIVE(kd)) {
138 size = 0;
139 mib[0] = CTL_KERN;
140 mib[1] = KERN_FILE;
141 st = sysctl(mib, 2, NULL, &size, NULL, 0);
142 if (st == -1) {
143 _kvm_syserr(kd, kd->program, "kvm_getfiles");
144 return (0);
145 }
146 if (kd->argspc == 0)
147 kd->argspc = (char *)_kvm_malloc(kd, size);
148 else if (kd->arglen < size)
149 kd->argspc = (char *)_kvm_realloc(kd, kd->argspc, size);
150 if (kd->argspc == 0)
151 return (0);
152 kd->arglen = size;
153 st = sysctl(mib, 2, kd->argspc, &size, NULL, 0);
154 if (st == -1 || size < sizeof(filehead)) {
155 _kvm_syserr(kd, kd->program, "kvm_getfiles");
156 return (0);
157 }
158 filehead = *(struct filelist *)kd->argspc;
159 fp = (struct file *)(kd->argspc + sizeof (filehead));
160 fplim = (struct file *)(kd->argspc + size);
161 for (nfiles = 0; LIST_FIRST(&filehead) && (fp < fplim); nfiles++, fp++)
162 LIST_FIRST(&filehead) = LIST_NEXT(fp, f_list);
163 } else {
164 struct nlist nl[3], *p;
165
166 nl[0].n_name = "_filehead";
167 nl[1].n_name = "_nfiles";
168 nl[2].n_name = 0;
169
170 if (kvm_nlist(kd, nl) != 0) {
171 for (p = nl; p->n_type != 0; ++p)
172 ;
173 _kvm_err(kd, kd->program,
174 "%s: no such symbol", p->n_name);
175 return (0);
176 }
177 if (KREAD(kd, nl[0].n_value, &nfiles)) {
178 _kvm_err(kd, kd->program, "can't read nfiles");
179 return (0);
180 }
181 size = sizeof(filehead) + (nfiles + 10) * sizeof(struct file);
182 if (kd->argspc == 0)
183 kd->argspc = (char *)_kvm_malloc(kd, size);
184 else if (kd->arglen < size)
185 kd->argspc = (char *)_kvm_realloc(kd, kd->argspc, size);
186 if (kd->argspc == 0)
187 return (0);
188 kd->arglen = size;
189 nfiles = kvm_deadfiles(kd, op, arg, nl[1].n_value, nfiles);
190 if (nfiles == 0)
191 return (0);
192 }
193 *cnt = nfiles;
194 return (kd->argspc);
195}
| 40#endif
41#endif /* LIBC_SCCS and not lint */
42
43/*
44 * File list interface for kvm. pstat, fstat and netstat are
45 * users of this code, so we've factored it out into a separate module.
46 * Thus, we keep this grunge out of the other kvm applications (i.e.,
47 * most other applications are interested only in open/close/read/nlist).
48 */
49
50#include <sys/param.h>
51#include <sys/lock.h>
52#include <sys/mutex.h>
53#include <sys/user.h>
54#include <sys/proc.h>
55#define _KERNEL
56#include <sys/file.h>
57#undef _KERNEL
58#include <sys/stat.h>
59#include <sys/ioctl.h>
60#include <nlist.h>
61#include <kvm.h>
62
63#include <vm/vm.h>
64#include <vm/vm_param.h>
65#include <vm/swap_pager.h>
66
67#include <sys/sysctl.h>
68
69#include <limits.h>
70#include <ndbm.h>
71#include <paths.h>
72
73#include "kvm_private.h"
74
75#define KREAD(kd, addr, obj) \
76 (kvm_read(kd, addr, obj, sizeof(*obj)) != sizeof(*obj))
77
78/*
79 * Get file structures.
80 */
81static int
82kvm_deadfiles(kd, op, arg, filehead_o, nfiles)
83 kvm_t *kd;
84 int op, arg, nfiles;
85 long filehead_o;
86{
87 int buflen = kd->arglen, n = 0;
88 struct file *fp;
89 register char *where = kd->argspc;
90 struct filelist filehead;
91
92 /*
93 * first copyout filehead
94 */
95 if (buflen > sizeof (filehead)) {
96 if (KREAD(kd, filehead_o, &filehead)) {
97 _kvm_err(kd, kd->program, "can't read filehead");
98 return (0);
99 }
100 buflen -= sizeof (filehead);
101 where += sizeof (filehead);
102 *(struct filelist *)kd->argspc = filehead;
103 }
104 /*
105 * followed by an array of file structures
106 */
107 LIST_FOREACH(fp, &filehead, f_list) {
108 if (buflen > sizeof (struct file)) {
109 if (KREAD(kd, (long)fp, ((struct file *)where))) {
110 _kvm_err(kd, kd->program, "can't read kfp");
111 return (0);
112 }
113 buflen -= sizeof (struct file);
114 fp = (struct file *)where;
115 where += sizeof (struct file);
116 n++;
117 }
118 }
119 if (n != nfiles) {
120 _kvm_err(kd, kd->program, "inconsistant nfiles");
121 return (0);
122 }
123 return (nfiles);
124}
125
126char *
127kvm_getfiles(kd, op, arg, cnt)
128 kvm_t *kd;
129 int op, arg;
130 int *cnt;
131{
132 int mib[2], st, nfiles;
133 size_t size;
134 struct file *fp, *fplim;
135 struct filelist filehead;
136
137 if (ISALIVE(kd)) {
138 size = 0;
139 mib[0] = CTL_KERN;
140 mib[1] = KERN_FILE;
141 st = sysctl(mib, 2, NULL, &size, NULL, 0);
142 if (st == -1) {
143 _kvm_syserr(kd, kd->program, "kvm_getfiles");
144 return (0);
145 }
146 if (kd->argspc == 0)
147 kd->argspc = (char *)_kvm_malloc(kd, size);
148 else if (kd->arglen < size)
149 kd->argspc = (char *)_kvm_realloc(kd, kd->argspc, size);
150 if (kd->argspc == 0)
151 return (0);
152 kd->arglen = size;
153 st = sysctl(mib, 2, kd->argspc, &size, NULL, 0);
154 if (st == -1 || size < sizeof(filehead)) {
155 _kvm_syserr(kd, kd->program, "kvm_getfiles");
156 return (0);
157 }
158 filehead = *(struct filelist *)kd->argspc;
159 fp = (struct file *)(kd->argspc + sizeof (filehead));
160 fplim = (struct file *)(kd->argspc + size);
161 for (nfiles = 0; LIST_FIRST(&filehead) && (fp < fplim); nfiles++, fp++)
162 LIST_FIRST(&filehead) = LIST_NEXT(fp, f_list);
163 } else {
164 struct nlist nl[3], *p;
165
166 nl[0].n_name = "_filehead";
167 nl[1].n_name = "_nfiles";
168 nl[2].n_name = 0;
169
170 if (kvm_nlist(kd, nl) != 0) {
171 for (p = nl; p->n_type != 0; ++p)
172 ;
173 _kvm_err(kd, kd->program,
174 "%s: no such symbol", p->n_name);
175 return (0);
176 }
177 if (KREAD(kd, nl[0].n_value, &nfiles)) {
178 _kvm_err(kd, kd->program, "can't read nfiles");
179 return (0);
180 }
181 size = sizeof(filehead) + (nfiles + 10) * sizeof(struct file);
182 if (kd->argspc == 0)
183 kd->argspc = (char *)_kvm_malloc(kd, size);
184 else if (kd->arglen < size)
185 kd->argspc = (char *)_kvm_realloc(kd, kd->argspc, size);
186 if (kd->argspc == 0)
187 return (0);
188 kd->arglen = size;
189 nfiles = kvm_deadfiles(kd, op, arg, nl[1].n_value, nfiles);
190 if (nfiles == 0)
191 return (0);
192 }
193 *cnt = nfiles;
194 return (kd->argspc);
195}
|