kvm.c revision 1.36 1 1.1 cgd /*-
2 1.35 cgd * Copyright (c) 1989, 1992, 1993
3 1.35 cgd * The Regents of the University of California. All rights reserved.
4 1.35 cgd *
5 1.35 cgd * This code is derived from software developed by the Computer Systems
6 1.35 cgd * Engineering group at Lawrence Berkeley Laboratory under DARPA contract
7 1.35 cgd * BG 91-66 and contributed to Berkeley.
8 1.1 cgd *
9 1.1 cgd * Redistribution and use in source and binary forms, with or without
10 1.1 cgd * modification, are permitted provided that the following conditions
11 1.1 cgd * are met:
12 1.1 cgd * 1. Redistributions of source code must retain the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer.
14 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
15 1.1 cgd * notice, this list of conditions and the following disclaimer in the
16 1.1 cgd * documentation and/or other materials provided with the distribution.
17 1.1 cgd * 3. All advertising materials mentioning features or use of this software
18 1.1 cgd * must display the following acknowledgement:
19 1.1 cgd * This product includes software developed by the University of
20 1.1 cgd * California, Berkeley and its contributors.
21 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
22 1.1 cgd * may be used to endorse or promote products derived from this software
23 1.1 cgd * without specific prior written permission.
24 1.1 cgd *
25 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 1.1 cgd * SUCH DAMAGE.
36 1.1 cgd */
37 1.1 cgd
38 1.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
39 1.35 cgd static char sccsid[] = "@(#)kvm.c 8.2 (Berkeley) 2/13/94";
40 1.1 cgd #endif /* LIBC_SCCS and not lint */
41 1.1 cgd
42 1.1 cgd #include <sys/param.h>
43 1.1 cgd #include <sys/user.h>
44 1.1 cgd #include <sys/proc.h>
45 1.1 cgd #include <sys/ioctl.h>
46 1.35 cgd #include <sys/stat.h>
47 1.35 cgd #include <sys/sysctl.h>
48 1.35 cgd
49 1.35 cgd #include <vm/vm.h>
50 1.35 cgd #include <vm/vm_param.h>
51 1.35 cgd #include <vm/swap_pager.h>
52 1.35 cgd
53 1.1 cgd #include <machine/vmparam.h>
54 1.35 cgd
55 1.35 cgd #include <ctype.h>
56 1.35 cgd #include <db.h>
57 1.1 cgd #include <fcntl.h>
58 1.1 cgd #include <kvm.h>
59 1.1 cgd #include <limits.h>
60 1.35 cgd #include <nlist.h>
61 1.1 cgd #include <paths.h>
62 1.1 cgd #include <stdio.h>
63 1.35 cgd #include <stdlib.h>
64 1.1 cgd #include <string.h>
65 1.35 cgd #include <unistd.h>
66 1.1 cgd
67 1.35 cgd #include "kvm_private.h"
68 1.1 cgd
69 1.35 cgd static int kvm_dbopen __P((kvm_t *, const char *));
70 1.19 mycroft
71 1.35 cgd char *
72 1.35 cgd kvm_geterr(kd)
73 1.35 cgd kvm_t *kd;
74 1.35 cgd {
75 1.35 cgd return (kd->errbuf);
76 1.35 cgd }
77 1.1 cgd
78 1.35 cgd #if __STDC__
79 1.35 cgd #include <stdarg.h>
80 1.35 cgd #else
81 1.35 cgd #include <varargs.h>
82 1.26 pk #endif
83 1.26 pk
84 1.35 cgd /*
85 1.35 cgd * Report an error using printf style arguments. "program" is kd->program
86 1.35 cgd * on hard errors, and 0 on soft errors, so that under sun error emulation,
87 1.35 cgd * only hard errors are printed out (otherwise, programs like gdb will
88 1.35 cgd * generate tons of error messages when trying to access bogus pointers).
89 1.35 cgd */
90 1.35 cgd void
91 1.35 cgd #if __STDC__
92 1.35 cgd _kvm_err(kvm_t *kd, const char *program, const char *fmt, ...)
93 1.35 cgd #else
94 1.35 cgd _kvm_err(kd, program, fmt, va_alist)
95 1.35 cgd kvm_t *kd;
96 1.35 cgd char *program, *fmt;
97 1.35 cgd va_dcl
98 1.27 phil #endif
99 1.35 cgd {
100 1.35 cgd va_list ap;
101 1.27 phil
102 1.35 cgd #ifdef __STDC__
103 1.35 cgd va_start(ap, fmt);
104 1.35 cgd #else
105 1.35 cgd va_start(ap);
106 1.26 pk #endif
107 1.35 cgd if (program != NULL) {
108 1.35 cgd (void)fprintf(stderr, "%s: ", program);
109 1.35 cgd (void)vfprintf(stderr, fmt, ap);
110 1.35 cgd (void)fputc('\n', stderr);
111 1.35 cgd } else
112 1.35 cgd (void)vsnprintf(kd->errbuf,
113 1.35 cgd sizeof(kd->errbuf), (char *)fmt, ap);
114 1.26 pk
115 1.35 cgd va_end(ap);
116 1.35 cgd }
117 1.26 pk
118 1.35 cgd void
119 1.35 cgd #if __STDC__
120 1.35 cgd _kvm_syserr(kvm_t *kd, const char *program, const char *fmt, ...)
121 1.35 cgd #else
122 1.35 cgd _kvm_syserr(kd, program, fmt, va_alist)
123 1.35 cgd kvm_t *kd;
124 1.35 cgd char *program, *fmt;
125 1.35 cgd va_dcl
126 1.1 cgd #endif
127 1.35 cgd {
128 1.35 cgd va_list ap;
129 1.35 cgd register int n;
130 1.26 pk
131 1.35 cgd #if __STDC__
132 1.35 cgd va_start(ap, fmt);
133 1.35 cgd #else
134 1.35 cgd va_start(ap);
135 1.1 cgd #endif
136 1.35 cgd if (program != NULL) {
137 1.35 cgd (void)fprintf(stderr, "%s: ", program);
138 1.35 cgd (void)vfprintf(stderr, fmt, ap);
139 1.35 cgd (void)fprintf(stderr, ": %s\n", strerror(errno));
140 1.35 cgd } else {
141 1.35 cgd register char *cp = kd->errbuf;
142 1.26 pk
143 1.35 cgd (void)vsnprintf(cp, sizeof(kd->errbuf), (char *)fmt, ap);
144 1.35 cgd n = strlen(cp);
145 1.35 cgd (void)snprintf(&cp[n], sizeof(kd->errbuf) - n, ": %s",
146 1.35 cgd strerror(errno));
147 1.35 cgd }
148 1.35 cgd va_end(ap);
149 1.35 cgd }
150 1.1 cgd
151 1.35 cgd void *
152 1.35 cgd _kvm_malloc(kd, n)
153 1.35 cgd register kvm_t *kd;
154 1.35 cgd register size_t n;
155 1.35 cgd {
156 1.35 cgd void *p;
157 1.35 cgd
158 1.35 cgd if ((p = malloc(n)) == NULL)
159 1.35 cgd _kvm_err(kd, kd->program, strerror(errno));
160 1.35 cgd return (p);
161 1.35 cgd }
162 1.35 cgd
163 1.35 cgd static kvm_t *
164 1.35 cgd _kvm_open(kd, uf, mf, sf, flag, errout)
165 1.35 cgd register kvm_t *kd;
166 1.35 cgd const char *uf;
167 1.35 cgd const char *mf;
168 1.35 cgd const char *sf;
169 1.35 cgd int flag;
170 1.35 cgd char *errout;
171 1.35 cgd {
172 1.35 cgd struct stat st;
173 1.35 cgd
174 1.35 cgd kd->vmfd = -1;
175 1.35 cgd kd->pmfd = -1;
176 1.35 cgd kd->swfd = -1;
177 1.35 cgd kd->nlfd = -1;
178 1.35 cgd kd->vmst = 0;
179 1.35 cgd kd->db = 0;
180 1.35 cgd kd->procbase = 0;
181 1.36 mycroft kd->nbpg = getpagesize();
182 1.36 mycroft kd->swapspc = 0;
183 1.35 cgd kd->argspc = 0;
184 1.35 cgd kd->argv = 0;
185 1.35 cgd
186 1.35 cgd if (uf == 0)
187 1.35 cgd uf = _PATH_UNIX;
188 1.35 cgd else if (strlen(uf) >= MAXPATHLEN) {
189 1.35 cgd _kvm_err(kd, kd->program, "exec file name too long");
190 1.1 cgd goto failed;
191 1.1 cgd }
192 1.35 cgd if (flag & ~O_RDWR) {
193 1.35 cgd _kvm_err(kd, kd->program, "bad flags arg");
194 1.1 cgd goto failed;
195 1.1 cgd }
196 1.35 cgd if (mf == 0)
197 1.35 cgd mf = _PATH_MEM;
198 1.35 cgd if (sf == 0)
199 1.35 cgd sf = _PATH_DRUM;
200 1.35 cgd
201 1.35 cgd if ((kd->pmfd = open(mf, flag, 0)) < 0) {
202 1.35 cgd _kvm_syserr(kd, kd->program, "%s", mf);
203 1.35 cgd goto failed;
204 1.1 cgd }
205 1.35 cgd if (fstat(kd->pmfd, &st) < 0) {
206 1.35 cgd _kvm_syserr(kd, kd->program, "%s", mf);
207 1.1 cgd goto failed;
208 1.1 cgd }
209 1.35 cgd if (S_ISCHR(st.st_mode)) {
210 1.1 cgd /*
211 1.35 cgd * If this is a character special device, then check that
212 1.35 cgd * it's /dev/mem. If so, open kmem too. (Maybe we should
213 1.35 cgd * make it work for either /dev/mem or /dev/kmem -- in either
214 1.35 cgd * case you're working with a live kernel.)
215 1.1 cgd */
216 1.35 cgd if (strcmp(mf, _PATH_MEM) != 0) { /* XXX */
217 1.35 cgd _kvm_err(kd, kd->program,
218 1.35 cgd "%s: not physical memory device", mf);
219 1.35 cgd goto failed;
220 1.1 cgd }
221 1.35 cgd if ((kd->vmfd = open(_PATH_KMEM, flag)) < 0) {
222 1.35 cgd _kvm_syserr(kd, kd->program, "%s", _PATH_KMEM);
223 1.35 cgd goto failed;
224 1.1 cgd }
225 1.35 cgd if ((kd->swfd = open(sf, flag, 0)) < 0) {
226 1.35 cgd _kvm_syserr(kd, kd->program, "%s", sf);
227 1.35 cgd goto failed;
228 1.1 cgd }
229 1.1 cgd /*
230 1.35 cgd * Open kvm nlist database. We go ahead and do this
231 1.35 cgd * here so that we don't have to hold on to the vmunix
232 1.35 cgd * path name. Since a kvm application will surely do
233 1.35 cgd * a kvm_nlist(), this probably won't be a wasted effort.
234 1.35 cgd * If the database cannot be opened, open the namelist
235 1.35 cgd * argument so we revert to slow nlist() calls.
236 1.1 cgd */
237 1.35 cgd if (kvm_dbopen(kd, uf) < 0 &&
238 1.35 cgd (kd->nlfd = open(uf, O_RDONLY, 0)) < 0) {
239 1.35 cgd _kvm_syserr(kd, kd->program, "%s", uf);
240 1.35 cgd goto failed;
241 1.3 cgd }
242 1.35 cgd } else {
243 1.3 cgd /*
244 1.35 cgd * This is a crash dump.
245 1.35 cgd * Initalize the virtual address translation machinery,
246 1.35 cgd * but first setup the namelist fd.
247 1.3 cgd */
248 1.35 cgd if ((kd->nlfd = open(uf, O_RDONLY, 0)) < 0) {
249 1.35 cgd _kvm_syserr(kd, kd->program, "%s", uf);
250 1.35 cgd goto failed;
251 1.3 cgd }
252 1.35 cgd if (_kvm_initvtop(kd) < 0)
253 1.35 cgd goto failed;
254 1.3 cgd }
255 1.35 cgd return (kd);
256 1.35 cgd failed:
257 1.1 cgd /*
258 1.35 cgd * Copy out the error if doing sane error semantics.
259 1.1 cgd */
260 1.35 cgd if (errout != 0)
261 1.35 cgd strcpy(errout, kd->errbuf);
262 1.35 cgd (void)kvm_close(kd);
263 1.35 cgd return (0);
264 1.1 cgd }
265 1.1 cgd
266 1.35 cgd kvm_t *
267 1.35 cgd kvm_openfiles(uf, mf, sf, flag, errout)
268 1.35 cgd const char *uf;
269 1.35 cgd const char *mf;
270 1.35 cgd const char *sf;
271 1.35 cgd int flag;
272 1.35 cgd char *errout;
273 1.35 cgd {
274 1.35 cgd register kvm_t *kd;
275 1.35 cgd
276 1.35 cgd if ((kd = malloc(sizeof(*kd))) == NULL) {
277 1.35 cgd (void)strcpy(errout, strerror(errno));
278 1.35 cgd return (0);
279 1.35 cgd }
280 1.35 cgd kd->program = 0;
281 1.35 cgd return (_kvm_open(kd, uf, mf, sf, flag, errout));
282 1.35 cgd }
283 1.35 cgd
284 1.35 cgd kvm_t *
285 1.35 cgd kvm_open(uf, mf, sf, flag, program)
286 1.35 cgd const char *uf;
287 1.35 cgd const char *mf;
288 1.35 cgd const char *sf;
289 1.35 cgd int flag;
290 1.35 cgd const char *program;
291 1.35 cgd {
292 1.35 cgd register kvm_t *kd;
293 1.35 cgd
294 1.35 cgd if ((kd = malloc(sizeof(*kd))) == NULL && program != NULL) {
295 1.35 cgd (void)fprintf(stderr, "%s: %s\n", strerror(errno));
296 1.35 cgd return (0);
297 1.19 mycroft }
298 1.35 cgd kd->program = program;
299 1.35 cgd return (_kvm_open(kd, uf, mf, sf, flag, NULL));
300 1.8 cgd }
301 1.8 cgd
302 1.8 cgd int
303 1.35 cgd kvm_close(kd)
304 1.35 cgd kvm_t *kd;
305 1.1 cgd {
306 1.35 cgd register int error = 0;
307 1.24 mycroft
308 1.35 cgd if (kd->pmfd >= 0)
309 1.35 cgd error |= close(kd->pmfd);
310 1.35 cgd if (kd->vmfd >= 0)
311 1.35 cgd error |= close(kd->vmfd);
312 1.35 cgd if (kd->nlfd >= 0)
313 1.35 cgd error |= close(kd->nlfd);
314 1.35 cgd if (kd->swfd >= 0)
315 1.35 cgd error |= close(kd->swfd);
316 1.35 cgd if (kd->db != 0)
317 1.35 cgd error |= (kd->db->close)(kd->db);
318 1.35 cgd if (kd->vmst)
319 1.35 cgd _kvm_freevtop(kd);
320 1.35 cgd if (kd->procbase != 0)
321 1.35 cgd free((void *)kd->procbase);
322 1.36 mycroft if (kd->swapspc != 0)
323 1.36 mycroft free((void *)kd->swapspc);
324 1.36 mycroft if (kd->argspc != 0)
325 1.36 mycroft free((void *)kd->argspc);
326 1.35 cgd if (kd->argv != 0)
327 1.35 cgd free((void *)kd->argv);
328 1.35 cgd free((void *)kd);
329 1.19 mycroft
330 1.1 cgd return (0);
331 1.1 cgd }
332 1.1 cgd
333 1.3 cgd /*
334 1.35 cgd * Set up state necessary to do queries on the kernel namelist
335 1.35 cgd * data base. If the data base is out-of-data/incompatible with
336 1.35 cgd * given executable, set up things so we revert to standard nlist call.
337 1.35 cgd * Only called for live kernels. Return 0 on success, -1 on failure.
338 1.3 cgd */
339 1.3 cgd static int
340 1.35 cgd kvm_dbopen(kd, uf)
341 1.35 cgd kvm_t *kd;
342 1.35 cgd const char *uf;
343 1.3 cgd {
344 1.35 cgd char *cp;
345 1.35 cgd DBT rec;
346 1.35 cgd int dbversionlen;
347 1.35 cgd struct nlist nitem;
348 1.35 cgd char dbversion[_POSIX2_LINE_MAX];
349 1.35 cgd char kversion[_POSIX2_LINE_MAX];
350 1.35 cgd char dbname[MAXPATHLEN];
351 1.3 cgd
352 1.35 cgd if ((cp = rindex(uf, '/')) != 0)
353 1.35 cgd uf = cp + 1;
354 1.19 mycroft
355 1.35 cgd (void)snprintf(dbname, sizeof(dbname), "%skvm_%s.db", _PATH_VARDB, uf);
356 1.35 cgd kd->db = dbopen(dbname, O_RDONLY, 0, DB_HASH, NULL);
357 1.35 cgd if (kd->db == 0)
358 1.35 cgd return (-1);
359 1.35 cgd /*
360 1.35 cgd * read version out of database
361 1.35 cgd */
362 1.35 cgd rec.data = VRS_KEY;
363 1.35 cgd rec.size = sizeof(VRS_KEY) - 1;
364 1.35 cgd if ((kd->db->get)(kd->db, (DBT *)&rec, (DBT *)&rec, 0))
365 1.35 cgd goto close;
366 1.35 cgd if (rec.data == 0 || rec.size > sizeof(dbversion))
367 1.35 cgd goto close;
368 1.3 cgd
369 1.35 cgd bcopy(rec.data, dbversion, rec.size);
370 1.35 cgd dbversionlen = rec.size;
371 1.35 cgd /*
372 1.35 cgd * Read version string from kernel memory.
373 1.35 cgd * Since we are dealing with a live kernel, we can call kvm_read()
374 1.35 cgd * at this point.
375 1.35 cgd */
376 1.35 cgd rec.data = VRS_SYM;
377 1.35 cgd rec.size = sizeof(VRS_SYM) - 1;
378 1.35 cgd if ((kd->db->get)(kd->db, (DBT *)&rec, (DBT *)&rec, 0))
379 1.35 cgd goto close;
380 1.35 cgd if (rec.data == 0 || rec.size != sizeof(struct nlist))
381 1.35 cgd goto close;
382 1.35 cgd bcopy((char *)rec.data, (char *)&nitem, sizeof(nitem));
383 1.35 cgd if (kvm_read(kd, (u_long)nitem.n_value, kversion, dbversionlen) !=
384 1.35 cgd dbversionlen)
385 1.35 cgd goto close;
386 1.35 cgd /*
387 1.35 cgd * If they match, we win - otherwise clear out kd->db so
388 1.35 cgd * we revert to slow nlist().
389 1.35 cgd */
390 1.35 cgd if (bcmp(dbversion, kversion, dbversionlen) == 0)
391 1.35 cgd return (0);
392 1.35 cgd close:
393 1.35 cgd (void)(kd->db->close)(kd->db);
394 1.35 cgd kd->db = 0;
395 1.3 cgd
396 1.35 cgd return (-1);
397 1.18 mycroft }
398 1.18 mycroft
399 1.18 mycroft int
400 1.35 cgd kvm_nlist(kd, nl)
401 1.35 cgd kvm_t *kd;
402 1.35 cgd struct nlist *nl;
403 1.18 mycroft {
404 1.35 cgd register struct nlist *p;
405 1.35 cgd register int nvalid;
406 1.3 cgd
407 1.35 cgd /*
408 1.35 cgd * If we can't use the data base, revert to the
409 1.35 cgd * slow library call.
410 1.35 cgd */
411 1.35 cgd if (kd->db == 0)
412 1.35 cgd return (__fdnlist(kd->nlfd, nl));
413 1.3 cgd
414 1.35 cgd /*
415 1.35 cgd * We can use the kvm data base. Go through each nlist entry
416 1.35 cgd * and look it up with a db query.
417 1.35 cgd */
418 1.35 cgd nvalid = 0;
419 1.35 cgd for (p = nl; p->n_name && p->n_name[0]; ++p) {
420 1.35 cgd register int len;
421 1.35 cgd DBT rec;
422 1.35 cgd
423 1.35 cgd if ((len = strlen(p->n_name)) > 4096) {
424 1.35 cgd /* sanity */
425 1.35 cgd _kvm_err(kd, kd->program, "symbol too large");
426 1.35 cgd return (-1);
427 1.35 cgd }
428 1.35 cgd rec.data = p->n_name;
429 1.35 cgd rec.size = len;
430 1.35 cgd if ((kd->db->get)(kd->db, (DBT *)&rec, (DBT *)&rec, 0))
431 1.35 cgd continue;
432 1.35 cgd if (rec.data == 0 || rec.size != sizeof(struct nlist))
433 1.35 cgd continue;
434 1.35 cgd ++nvalid;
435 1.35 cgd /*
436 1.35 cgd * Avoid alignment issues.
437 1.35 cgd */
438 1.35 cgd bcopy((char *)&((struct nlist *)rec.data)->n_type,
439 1.35 cgd (char *)&p->n_type,
440 1.35 cgd sizeof(p->n_type));
441 1.35 cgd bcopy((char *)&((struct nlist *)rec.data)->n_value,
442 1.35 cgd (char *)&p->n_value,
443 1.35 cgd sizeof(p->n_value));
444 1.3 cgd }
445 1.35 cgd /*
446 1.35 cgd * Return the number of entries that weren't found.
447 1.35 cgd */
448 1.35 cgd return ((p - nl) - nvalid);
449 1.18 mycroft }
450 1.3 cgd
451 1.35 cgd ssize_t
452 1.35 cgd kvm_read(kd, kva, buf, len)
453 1.35 cgd kvm_t *kd;
454 1.35 cgd register u_long kva;
455 1.35 cgd register void *buf;
456 1.35 cgd register size_t len;
457 1.3 cgd {
458 1.35 cgd register int cc;
459 1.35 cgd register void *cp;
460 1.3 cgd
461 1.35 cgd if (ISALIVE(kd)) {
462 1.35 cgd /*
463 1.35 cgd * We're using /dev/kmem. Just read straight from the
464 1.35 cgd * device and let the active kernel do the address translation.
465 1.35 cgd */
466 1.35 cgd errno = 0;
467 1.35 cgd if (lseek(kd->vmfd, (off_t)kva, 0) == -1 && errno != 0) {
468 1.35 cgd _kvm_err(kd, 0, "invalid address (%x)", kva);
469 1.35 cgd return (0);
470 1.35 cgd }
471 1.35 cgd cc = read(kd->vmfd, buf, len);
472 1.35 cgd if (cc < 0) {
473 1.35 cgd _kvm_syserr(kd, 0, "kvm_read");
474 1.35 cgd return (0);
475 1.35 cgd } else if (cc < len)
476 1.35 cgd _kvm_err(kd, kd->program, "short read");
477 1.35 cgd return (cc);
478 1.35 cgd } else {
479 1.35 cgd cp = buf;
480 1.35 cgd while (len > 0) {
481 1.35 cgd u_long pa;
482 1.35 cgd
483 1.35 cgd cc = _kvm_kvatop(kd, kva, &pa);
484 1.35 cgd if (cc == 0)
485 1.35 cgd return (0);
486 1.35 cgd if (cc > len)
487 1.35 cgd cc = len;
488 1.35 cgd errno = 0;
489 1.35 cgd if (lseek(kd->pmfd, (off_t)pa, 0) == -1 && errno != 0) {
490 1.35 cgd _kvm_syserr(kd, 0, _PATH_MEM);
491 1.35 cgd break;
492 1.35 cgd }
493 1.35 cgd cc = read(kd->pmfd, cp, cc);
494 1.35 cgd if (cc < 0) {
495 1.35 cgd _kvm_syserr(kd, kd->program, "kvm_read");
496 1.35 cgd break;
497 1.35 cgd }
498 1.35 cgd /*
499 1.35 cgd * If kvm_kvatop returns a bogus value or our core
500 1.35 cgd * file is truncated, we might wind up seeking beyond
501 1.35 cgd * the end of the core file in which case the read will
502 1.35 cgd * return 0 (EOF).
503 1.35 cgd */
504 1.35 cgd if (cc == 0)
505 1.35 cgd break;
506 1.35 cgd (char *)cp += cc;
507 1.35 cgd kva += cc;
508 1.35 cgd len -= cc;
509 1.3 cgd }
510 1.35 cgd return ((char *)cp - (char *)buf);
511 1.3 cgd }
512 1.35 cgd /* NOTREACHED */
513 1.3 cgd }
514 1.3 cgd
515 1.35 cgd ssize_t
516 1.35 cgd kvm_write(kd, kva, buf, len)
517 1.35 cgd kvm_t *kd;
518 1.35 cgd register u_long kva;
519 1.35 cgd register const void *buf;
520 1.35 cgd register size_t len;
521 1.35 cgd {
522 1.35 cgd register int cc;
523 1.26 pk
524 1.35 cgd if (ISALIVE(kd)) {
525 1.35 cgd /*
526 1.35 cgd * Just like kvm_read, only we write.
527 1.35 cgd */
528 1.35 cgd errno = 0;
529 1.35 cgd if (lseek(kd->vmfd, (off_t)kva, 0) == -1 && errno != 0) {
530 1.35 cgd _kvm_err(kd, 0, "invalid address (%x)", kva);
531 1.35 cgd return (0);
532 1.35 cgd }
533 1.35 cgd cc = write(kd->vmfd, buf, len);
534 1.35 cgd if (cc < 0) {
535 1.35 cgd _kvm_syserr(kd, 0, "kvm_write");
536 1.35 cgd return (0);
537 1.35 cgd } else if (cc < len)
538 1.35 cgd _kvm_err(kd, kd->program, "short write");
539 1.35 cgd return (cc);
540 1.35 cgd } else {
541 1.35 cgd _kvm_err(kd, kd->program,
542 1.35 cgd "kvm_write not implemented for dead kernels");
543 1.35 cgd return (0);
544 1.26 pk }
545 1.35 cgd /* NOTREACHED */
546 1.1 cgd }
547