kvm_proc.c revision 136195
1/*- 2 * Copyright (c) 1989, 1992, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software developed by the Computer Systems 6 * Engineering group at Lawrence Berkeley Laboratory under DARPA contract 7 * BG 91-66 and contributed to Berkeley. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in the 16 * documentation and/or other materials provided with the distribution. 17 * 3. All advertising materials mentioning features or use of this software 18 * must display the following acknowledgement: 19 * This product includes software developed by the University of 20 * California, Berkeley and its contributors. 21 * 4. Neither the name of the University nor the names of its contributors 22 * may be used to endorse or promote products derived from this software 23 * without specific prior written permission. 24 * 25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 35 * SUCH DAMAGE. 36 */ 37 38#if 0 39#if defined(LIBC_SCCS) && !defined(lint) 40static char sccsid[] = "@(#)kvm_proc.c 8.3 (Berkeley) 9/23/93"; 41#endif /* LIBC_SCCS and not lint */ 42#endif 43 44#include <sys/cdefs.h> 45__FBSDID("$FreeBSD: head/lib/libkvm/kvm_proc.c 136195 2004-10-06 17:10:56Z jhb $"); 46 47/* 48 * Proc traversal interface for kvm. ps and w are (probably) the exclusive 49 * users of this code, so we've factored it out into a separate module. 50 * Thus, we keep this grunge out of the other kvm applications (i.e., 51 * most other applications are interested only in open/close/read/nlist). 52 */ 53 54#include <sys/param.h> 55#define _WANT_UCRED /* make ucred.h give us 'struct ucred' */ 56#include <sys/ucred.h> 57#include <sys/user.h> 58#include <sys/proc.h> 59#include <sys/exec.h> 60#include <sys/stat.h> 61#include <sys/sysent.h> 62#include <sys/ioctl.h> 63#include <sys/tty.h> 64#include <sys/file.h> 65#include <stdio.h> 66#include <stdlib.h> 67#include <unistd.h> 68#include <nlist.h> 69#include <kvm.h> 70 71#include <vm/vm.h> 72#include <vm/vm_param.h> 73 74#include <sys/sysctl.h> 75 76#include <limits.h> 77#include <memory.h> 78#include <paths.h> 79 80#include "kvm_private.h" 81 82#define KREAD(kd, addr, obj) \ 83 (kvm_read(kd, addr, (char *)(obj), sizeof(*obj)) != sizeof(*obj)) 84 85/* 86 * Read proc's from memory file into buffer bp, which has space to hold 87 * at most maxcnt procs. 88 */ 89static int 90kvm_proclist(kd, what, arg, p, bp, maxcnt) 91 kvm_t *kd; 92 int what, arg; 93 struct proc *p; 94 struct kinfo_proc *bp; 95 int maxcnt; 96{ 97 int cnt = 0; 98 struct kinfo_proc kinfo_proc, *kp; 99 struct pgrp pgrp; 100 struct session sess; 101 struct tty tty; 102 struct vmspace vmspace; 103 struct sigacts sigacts; 104 struct pstats pstats; 105 struct ucred ucred; 106 struct thread mtd; 107 /*struct kse mke;*/ 108 struct ksegrp mkg; 109 struct proc proc; 110 struct proc pproc; 111 struct timeval tv; 112 struct sysentvec sysent; 113 char svname[KI_EMULNAMELEN]; 114 115 kp = &kinfo_proc; 116 kp->ki_structsize = sizeof(kinfo_proc); 117 for (; cnt < maxcnt && p != NULL; p = LIST_NEXT(&proc, p_list)) { 118 memset(kp, 0, sizeof *kp); 119 if (KREAD(kd, (u_long)p, &proc)) { 120 _kvm_err(kd, kd->program, "can't read proc at %x", p); 121 return (-1); 122 } 123 if (proc.p_state != PRS_ZOMBIE) { 124 if (KREAD(kd, (u_long)TAILQ_FIRST(&proc.p_threads), 125 &mtd)) { 126 _kvm_err(kd, kd->program, 127 "can't read thread at %x", 128 TAILQ_FIRST(&proc.p_threads)); 129 return (-1); 130 } 131 if ((proc.p_flag & P_SA) == 0) { 132 if (KREAD(kd, 133 (u_long)TAILQ_FIRST(&proc.p_ksegrps), 134 &mkg)) { 135 _kvm_err(kd, kd->program, 136 "can't read ksegrp at %x", 137 TAILQ_FIRST(&proc.p_ksegrps)); 138 return (-1); 139 } 140#if 0 141 if (KREAD(kd, 142 (u_long)TAILQ_FIRST(&mkg.kg_kseq), &mke)) { 143 _kvm_err(kd, kd->program, 144 "can't read kse at %x", 145 TAILQ_FIRST(&mkg.kg_kseq)); 146 return (-1); 147 } 148#endif 149 } 150 } 151 if (KREAD(kd, (u_long)proc.p_ucred, &ucred) == 0) { 152 kp->ki_ruid = ucred.cr_ruid; 153 kp->ki_svuid = ucred.cr_svuid; 154 kp->ki_rgid = ucred.cr_rgid; 155 kp->ki_svgid = ucred.cr_svgid; 156 kp->ki_ngroups = ucred.cr_ngroups; 157 bcopy(ucred.cr_groups, kp->ki_groups, 158 NGROUPS * sizeof(gid_t)); 159 kp->ki_uid = ucred.cr_uid; 160 } 161 162 switch(what & ~KERN_PROC_INC_THREAD) { 163 164 case KERN_PROC_GID: 165 if (kp->ki_groups[0] != (gid_t)arg) 166 continue; 167 break; 168 169 case KERN_PROC_PID: 170 if (proc.p_pid != (pid_t)arg) 171 continue; 172 break; 173 174 case KERN_PROC_RGID: 175 if (kp->ki_rgid != (gid_t)arg) 176 continue; 177 break; 178 179 case KERN_PROC_UID: 180 if (kp->ki_uid != (uid_t)arg) 181 continue; 182 break; 183 184 case KERN_PROC_RUID: 185 if (kp->ki_ruid != (uid_t)arg) 186 continue; 187 break; 188 } 189 /* 190 * We're going to add another proc to the set. If this 191 * will overflow the buffer, assume the reason is because 192 * nprocs (or the proc list) is corrupt and declare an error. 193 */ 194 if (cnt >= maxcnt) { 195 _kvm_err(kd, kd->program, "nprocs corrupt"); 196 return (-1); 197 } 198 /* 199 * gather kinfo_proc 200 */ 201 kp->ki_paddr = p; 202 kp->ki_addr = proc.p_uarea; 203 /* kp->ki_kstack = proc.p_thread.td_kstack; XXXKSE */ 204 kp->ki_args = proc.p_args; 205 kp->ki_tracep = proc.p_tracevp; 206 kp->ki_textvp = proc.p_textvp; 207 kp->ki_fd = proc.p_fd; 208 kp->ki_vmspace = proc.p_vmspace; 209 if (proc.p_sigacts != NULL) { 210 if (KREAD(kd, (u_long)proc.p_sigacts, &sigacts)) { 211 _kvm_err(kd, kd->program, 212 "can't read sigacts at %x", proc.p_sigacts); 213 return (-1); 214 } 215 kp->ki_sigignore = sigacts.ps_sigignore; 216 kp->ki_sigcatch = sigacts.ps_sigcatch; 217 } 218 if ((proc.p_sflag & PS_INMEM) && proc.p_stats != NULL) { 219 if (KREAD(kd, (u_long)proc.p_stats, &pstats)) { 220 _kvm_err(kd, kd->program, 221 "can't read stats at %x", proc.p_stats); 222 return (-1); 223 } 224 kp->ki_start = pstats.p_start; 225 226 /* 227 * XXX: The times here are probably zero and need 228 * to be calculated from the raw data in p_rux and 229 * p_crux. 230 */ 231 kp->ki_rusage = pstats.p_ru; 232 kp->ki_childstime = pstats.p_cru.ru_stime; 233 kp->ki_childutime = pstats.p_cru.ru_utime; 234 /* Some callers want child-times in a single value */ 235 timeradd(&kp->ki_childstime, &kp->ki_childutime, 236 &kp->ki_childtime); 237 } 238 if (proc.p_oppid) 239 kp->ki_ppid = proc.p_oppid; 240 else if (proc.p_pptr) { 241 if (KREAD(kd, (u_long)proc.p_pptr, &pproc)) { 242 _kvm_err(kd, kd->program, 243 "can't read pproc at %x", proc.p_pptr); 244 return (-1); 245 } 246 kp->ki_ppid = pproc.p_pid; 247 } else 248 kp->ki_ppid = 0; 249 if (proc.p_pgrp == NULL) 250 goto nopgrp; 251 if (KREAD(kd, (u_long)proc.p_pgrp, &pgrp)) { 252 _kvm_err(kd, kd->program, "can't read pgrp at %x", 253 proc.p_pgrp); 254 return (-1); 255 } 256 kp->ki_pgid = pgrp.pg_id; 257 kp->ki_jobc = pgrp.pg_jobc; 258 if (KREAD(kd, (u_long)pgrp.pg_session, &sess)) { 259 _kvm_err(kd, kd->program, "can't read session at %x", 260 pgrp.pg_session); 261 return (-1); 262 } 263 kp->ki_sid = sess.s_sid; 264 (void)memcpy(kp->ki_login, sess.s_login, 265 sizeof(kp->ki_login)); 266 kp->ki_kiflag = sess.s_ttyvp ? KI_CTTY : 0; 267 if (sess.s_leader == p) 268 kp->ki_kiflag |= KI_SLEADER; 269 if ((proc.p_flag & P_CONTROLT) && sess.s_ttyp != NULL) { 270 if (KREAD(kd, (u_long)sess.s_ttyp, &tty)) { 271 _kvm_err(kd, kd->program, 272 "can't read tty at %x", sess.s_ttyp); 273 return (-1); 274 } 275 kp->ki_tdev = tty.t_dev; /* XXX: wrong */ 276 if (tty.t_pgrp != NULL) { 277 if (KREAD(kd, (u_long)tty.t_pgrp, &pgrp)) { 278 _kvm_err(kd, kd->program, 279 "can't read tpgrp at %x", 280 tty.t_pgrp); 281 return (-1); 282 } 283 kp->ki_tpgid = pgrp.pg_id; 284 } else 285 kp->ki_tpgid = -1; 286 if (tty.t_session != NULL) { 287 if (KREAD(kd, (u_long)tty.t_session, &sess)) { 288 _kvm_err(kd, kd->program, 289 "can't read session at %x", 290 tty.t_session); 291 return (-1); 292 } 293 kp->ki_tsid = sess.s_sid; 294 } 295 } else { 296nopgrp: 297 kp->ki_tdev = NODEV; 298 } 299 if ((proc.p_state != PRS_ZOMBIE) && mtd.td_wmesg) 300 (void)kvm_read(kd, (u_long)mtd.td_wmesg, 301 kp->ki_wmesg, WMESGLEN); 302 303 (void)kvm_read(kd, (u_long)proc.p_vmspace, 304 (char *)&vmspace, sizeof(vmspace)); 305 kp->ki_size = vmspace.vm_map.size; 306 kp->ki_rssize = vmspace.vm_swrss; /* XXX */ 307 kp->ki_swrss = vmspace.vm_swrss; 308 kp->ki_tsize = vmspace.vm_tsize; 309 kp->ki_dsize = vmspace.vm_dsize; 310 kp->ki_ssize = vmspace.vm_ssize; 311 312 switch (what & ~KERN_PROC_INC_THREAD) { 313 314 case KERN_PROC_PGRP: 315 if (kp->ki_pgid != (pid_t)arg) 316 continue; 317 break; 318 319 case KERN_PROC_SESSION: 320 if (kp->ki_sid != (pid_t)arg) 321 continue; 322 break; 323 324 case KERN_PROC_TTY: 325 if ((proc.p_flag & P_CONTROLT) == 0 || 326 kp->ki_tdev != (dev_t)arg) 327 continue; 328 break; 329 } 330 if (proc.p_comm[0] != 0) 331 strlcpy(kp->ki_comm, proc.p_comm, MAXCOMLEN); 332 (void)kvm_read(kd, (u_long)proc.p_sysent, (char *)&sysent, 333 sizeof(sysent)); 334 (void)kvm_read(kd, (u_long)sysent.sv_name, (char *)&svname, 335 sizeof(svname)); 336 if (svname[0] != 0) 337 strlcpy(kp->ki_emul, svname, KI_EMULNAMELEN); 338 if ((proc.p_state != PRS_ZOMBIE) && 339 (mtd.td_blocked != 0)) { 340 kp->ki_kiflag |= KI_LOCKBLOCK; 341 if (mtd.td_lockname) 342 (void)kvm_read(kd, 343 (u_long)mtd.td_lockname, 344 kp->ki_lockname, LOCKNAMELEN); 345 kp->ki_lockname[LOCKNAMELEN] = 0; 346 } 347 bintime2timeval(&proc.p_rux.rux_runtime, &tv); 348 kp->ki_runtime = (u_int64_t)tv.tv_sec * 1000000 + tv.tv_usec; 349 kp->ki_pid = proc.p_pid; 350 kp->ki_siglist = proc.p_siglist; 351 SIGSETOR(kp->ki_siglist, mtd.td_siglist); 352 kp->ki_sigmask = mtd.td_sigmask; 353 kp->ki_xstat = proc.p_xstat; 354 kp->ki_acflag = proc.p_acflag; 355 kp->ki_lock = proc.p_lock; 356 if (proc.p_state != PRS_ZOMBIE) { 357 kp->ki_swtime = proc.p_swtime; 358 kp->ki_flag = proc.p_flag; 359 kp->ki_sflag = proc.p_sflag; 360 kp->ki_nice = proc.p_nice; 361 kp->ki_traceflag = proc.p_traceflag; 362 if (proc.p_state == PRS_NORMAL) { 363 if (TD_ON_RUNQ(&mtd) || 364 TD_CAN_RUN(&mtd) || 365 TD_IS_RUNNING(&mtd)) { 366 kp->ki_stat = SRUN; 367 } else if (mtd.td_state == 368 TDS_INHIBITED) { 369 if (P_SHOULDSTOP(&proc)) { 370 kp->ki_stat = SSTOP; 371 } else if ( 372 TD_IS_SLEEPING(&mtd)) { 373 kp->ki_stat = SSLEEP; 374 } else if (TD_ON_LOCK(&mtd)) { 375 kp->ki_stat = SLOCK; 376 } else { 377 kp->ki_stat = SWAIT; 378 } 379 } 380 } else { 381 kp->ki_stat = SIDL; 382 } 383 /* Stuff from the thread */ 384 kp->ki_pri.pri_level = mtd.td_priority; 385 kp->ki_pri.pri_native = mtd.td_base_pri; 386 kp->ki_lastcpu = mtd.td_lastcpu; 387 kp->ki_wchan = mtd.td_wchan; 388 kp->ki_oncpu = mtd.td_oncpu; 389 390 if (!(proc.p_flag & P_SA)) { 391 /* stuff from the ksegrp */ 392 kp->ki_slptime = mkg.kg_slptime; 393 kp->ki_pri.pri_class = mkg.kg_pri_class; 394 kp->ki_pri.pri_user = mkg.kg_user_pri; 395 kp->ki_estcpu = mkg.kg_estcpu; 396 397#if 0 398 /* Stuff from the kse */ 399 kp->ki_pctcpu = mke.ke_pctcpu; 400 kp->ki_rqindex = mke.ke_rqindex; 401#else 402 kp->ki_pctcpu = 0; 403 kp->ki_rqindex = 0; 404#endif 405 } else { 406 kp->ki_tdflags = -1; 407 /* All the rest are 0 for now */ 408 } 409 } else { 410 kp->ki_stat = SZOMB; 411 } 412 bcopy(&kinfo_proc, bp, sizeof(kinfo_proc)); 413 ++bp; 414 ++cnt; 415 } 416 return (cnt); 417} 418 419/* 420 * Build proc info array by reading in proc list from a crash dump. 421 * Return number of procs read. maxcnt is the max we will read. 422 */ 423static int 424kvm_deadprocs(kd, what, arg, a_allproc, a_zombproc, maxcnt) 425 kvm_t *kd; 426 int what, arg; 427 u_long a_allproc; 428 u_long a_zombproc; 429 int maxcnt; 430{ 431 struct kinfo_proc *bp = kd->procbase; 432 int acnt, zcnt; 433 struct proc *p; 434 435 if (KREAD(kd, a_allproc, &p)) { 436 _kvm_err(kd, kd->program, "cannot read allproc"); 437 return (-1); 438 } 439 acnt = kvm_proclist(kd, what, arg, p, bp, maxcnt); 440 if (acnt < 0) 441 return (acnt); 442 443 if (KREAD(kd, a_zombproc, &p)) { 444 _kvm_err(kd, kd->program, "cannot read zombproc"); 445 return (-1); 446 } 447 zcnt = kvm_proclist(kd, what, arg, p, bp + acnt, maxcnt - acnt); 448 if (zcnt < 0) 449 zcnt = 0; 450 451 return (acnt + zcnt); 452} 453 454struct kinfo_proc * 455kvm_getprocs(kd, op, arg, cnt) 456 kvm_t *kd; 457 int op, arg; 458 int *cnt; 459{ 460 int mib[4], st, nprocs; 461 size_t size; 462 int temp_op; 463 464 if (kd->procbase != 0) { 465 free((void *)kd->procbase); 466 /* 467 * Clear this pointer in case this call fails. Otherwise, 468 * kvm_close() will free it again. 469 */ 470 kd->procbase = 0; 471 } 472 if (ISALIVE(kd)) { 473 size = 0; 474 mib[0] = CTL_KERN; 475 mib[1] = KERN_PROC; 476 mib[2] = op; 477 mib[3] = arg; 478 temp_op = op & ~KERN_PROC_INC_THREAD; 479 st = sysctl(mib, 480 temp_op == KERN_PROC_ALL || temp_op == KERN_PROC_PROC ? 481 3 : 4, NULL, &size, NULL, 0); 482 if (st == -1) { 483 _kvm_syserr(kd, kd->program, "kvm_getprocs"); 484 return (0); 485 } 486 /* 487 * We can't continue with a size of 0 because we pass 488 * it to realloc() (via _kvm_realloc()), and passing 0 489 * to realloc() results in undefined behavior. 490 */ 491 if (size == 0) { 492 /* 493 * XXX: We should probably return an invalid, 494 * but non-NULL, pointer here so any client 495 * program trying to dereference it will 496 * crash. However, _kvm_freeprocs() calls 497 * free() on kd->procbase if it isn't NULL, 498 * and free()'ing a junk pointer isn't good. 499 * Then again, _kvm_freeprocs() isn't used 500 * anywhere . . . 501 */ 502 kd->procbase = _kvm_malloc(kd, 1); 503 goto liveout; 504 } 505 do { 506 size += size / 10; 507 kd->procbase = (struct kinfo_proc *) 508 _kvm_realloc(kd, kd->procbase, size); 509 if (kd->procbase == 0) 510 return (0); 511 st = sysctl(mib, temp_op == KERN_PROC_ALL || 512 temp_op == KERN_PROC_PROC ? 3 : 4, 513 kd->procbase, &size, NULL, 0); 514 } while (st == -1 && errno == ENOMEM); 515 if (st == -1) { 516 _kvm_syserr(kd, kd->program, "kvm_getprocs"); 517 return (0); 518 } 519 /* 520 * We have to check the size again because sysctl() 521 * may "round up" oldlenp if oldp is NULL; hence it 522 * might've told us that there was data to get when 523 * there really isn't any. 524 */ 525 if (size > 0 && 526 kd->procbase->ki_structsize != sizeof(struct kinfo_proc)) { 527 _kvm_err(kd, kd->program, 528 "kinfo_proc size mismatch (expected %d, got %d)", 529 sizeof(struct kinfo_proc), 530 kd->procbase->ki_structsize); 531 return (0); 532 } 533liveout: 534 nprocs = size == 0 ? 0 : size / kd->procbase->ki_structsize; 535 } else { 536 struct nlist nl[4], *p; 537 538 nl[0].n_name = "_nprocs"; 539 nl[1].n_name = "_allproc"; 540 nl[2].n_name = "_zombproc"; 541 nl[3].n_name = 0; 542 543 if (kvm_nlist(kd, nl) != 0) { 544 for (p = nl; p->n_type != 0; ++p) 545 ; 546 _kvm_err(kd, kd->program, 547 "%s: no such symbol", p->n_name); 548 return (0); 549 } 550 if (KREAD(kd, nl[0].n_value, &nprocs)) { 551 _kvm_err(kd, kd->program, "can't read nprocs"); 552 return (0); 553 } 554 size = nprocs * sizeof(struct kinfo_proc); 555 kd->procbase = (struct kinfo_proc *)_kvm_malloc(kd, size); 556 if (kd->procbase == 0) 557 return (0); 558 559 nprocs = kvm_deadprocs(kd, op, arg, nl[1].n_value, 560 nl[2].n_value, nprocs); 561#ifdef notdef 562 size = nprocs * sizeof(struct kinfo_proc); 563 (void)realloc(kd->procbase, size); 564#endif 565 } 566 *cnt = nprocs; 567 return (kd->procbase); 568} 569 570void 571_kvm_freeprocs(kd) 572 kvm_t *kd; 573{ 574 if (kd->procbase) { 575 free(kd->procbase); 576 kd->procbase = 0; 577 } 578} 579 580void * 581_kvm_realloc(kd, p, n) 582 kvm_t *kd; 583 void *p; 584 size_t n; 585{ 586 void *np = (void *)realloc(p, n); 587 588 if (np == 0) { 589 free(p); 590 _kvm_err(kd, kd->program, "out of memory"); 591 } 592 return (np); 593} 594 595#ifndef MAX 596#define MAX(a, b) ((a) > (b) ? (a) : (b)) 597#endif 598 599/* 600 * Read in an argument vector from the user address space of process kp. 601 * addr if the user-space base address of narg null-terminated contiguous 602 * strings. This is used to read in both the command arguments and 603 * environment strings. Read at most maxcnt characters of strings. 604 */ 605static char ** 606kvm_argv(kd, kp, addr, narg, maxcnt) 607 kvm_t *kd; 608 struct kinfo_proc *kp; 609 u_long addr; 610 int narg; 611 int maxcnt; 612{ 613 char *np, *cp, *ep, *ap; 614 u_long oaddr = -1; 615 int len, cc; 616 char **argv; 617 618 /* 619 * Check that there aren't an unreasonable number of agruments, 620 * and that the address is in user space. 621 */ 622 if (narg > 512 || addr < VM_MIN_ADDRESS || addr >= VM_MAXUSER_ADDRESS) 623 return (0); 624 625 /* 626 * kd->argv : work space for fetching the strings from the target 627 * process's space, and is converted for returning to caller 628 */ 629 if (kd->argv == 0) { 630 /* 631 * Try to avoid reallocs. 632 */ 633 kd->argc = MAX(narg + 1, 32); 634 kd->argv = (char **)_kvm_malloc(kd, kd->argc * 635 sizeof(*kd->argv)); 636 if (kd->argv == 0) 637 return (0); 638 } else if (narg + 1 > kd->argc) { 639 kd->argc = MAX(2 * kd->argc, narg + 1); 640 kd->argv = (char **)_kvm_realloc(kd, kd->argv, kd->argc * 641 sizeof(*kd->argv)); 642 if (kd->argv == 0) 643 return (0); 644 } 645 /* 646 * kd->argspc : returned to user, this is where the kd->argv 647 * arrays are left pointing to the collected strings. 648 */ 649 if (kd->argspc == 0) { 650 kd->argspc = (char *)_kvm_malloc(kd, PAGE_SIZE); 651 if (kd->argspc == 0) 652 return (0); 653 kd->arglen = PAGE_SIZE; 654 } 655 /* 656 * kd->argbuf : used to pull in pages from the target process. 657 * the strings are copied out of here. 658 */ 659 if (kd->argbuf == 0) { 660 kd->argbuf = (char *)_kvm_malloc(kd, PAGE_SIZE); 661 if (kd->argbuf == 0) 662 return (0); 663 } 664 665 /* Pull in the target process'es argv vector */ 666 cc = sizeof(char *) * narg; 667 if (kvm_uread(kd, kp, addr, (char *)kd->argv, cc) != cc) 668 return (0); 669 /* 670 * ap : saved start address of string we're working on in kd->argspc 671 * np : pointer to next place to write in kd->argspc 672 * len: length of data in kd->argspc 673 * argv: pointer to the argv vector that we are hunting around the 674 * target process space for, and converting to addresses in 675 * our address space (kd->argspc). 676 */ 677 ap = np = kd->argspc; 678 argv = kd->argv; 679 len = 0; 680 /* 681 * Loop over pages, filling in the argument vector. 682 * Note that the argv strings could be pointing *anywhere* in 683 * the user address space and are no longer contiguous. 684 * Note that *argv is modified when we are going to fetch a string 685 * that crosses a page boundary. We copy the next part of the string 686 * into to "np" and eventually convert the pointer. 687 */ 688 while (argv < kd->argv + narg && *argv != 0) { 689 690 /* get the address that the current argv string is on */ 691 addr = (u_long)*argv & ~(PAGE_SIZE - 1); 692 693 /* is it the same page as the last one? */ 694 if (addr != oaddr) { 695 if (kvm_uread(kd, kp, addr, kd->argbuf, PAGE_SIZE) != 696 PAGE_SIZE) 697 return (0); 698 oaddr = addr; 699 } 700 701 /* offset within the page... kd->argbuf */ 702 addr = (u_long)*argv & (PAGE_SIZE - 1); 703 704 /* cp = start of string, cc = count of chars in this chunk */ 705 cp = kd->argbuf + addr; 706 cc = PAGE_SIZE - addr; 707 708 /* dont get more than asked for by user process */ 709 if (maxcnt > 0 && cc > maxcnt - len) 710 cc = maxcnt - len; 711 712 /* pointer to end of string if we found it in this page */ 713 ep = memchr(cp, '\0', cc); 714 if (ep != 0) 715 cc = ep - cp + 1; 716 /* 717 * at this point, cc is the count of the chars that we are 718 * going to retrieve this time. we may or may not have found 719 * the end of it. (ep points to the null if the end is known) 720 */ 721 722 /* will we exceed the malloc/realloced buffer? */ 723 if (len + cc > kd->arglen) { 724 int off; 725 char **pp; 726 char *op = kd->argspc; 727 728 kd->arglen *= 2; 729 kd->argspc = (char *)_kvm_realloc(kd, kd->argspc, 730 kd->arglen); 731 if (kd->argspc == 0) 732 return (0); 733 /* 734 * Adjust argv pointers in case realloc moved 735 * the string space. 736 */ 737 off = kd->argspc - op; 738 for (pp = kd->argv; pp < argv; pp++) 739 *pp += off; 740 ap += off; 741 np += off; 742 } 743 /* np = where to put the next part of the string in kd->argspc*/ 744 /* np is kinda redundant.. could use "kd->argspc + len" */ 745 memcpy(np, cp, cc); 746 np += cc; /* inc counters */ 747 len += cc; 748 749 /* 750 * if end of string found, set the *argv pointer to the 751 * saved beginning of string, and advance. argv points to 752 * somewhere in kd->argv.. This is initially relative 753 * to the target process, but when we close it off, we set 754 * it to point in our address space. 755 */ 756 if (ep != 0) { 757 *argv++ = ap; 758 ap = np; 759 } else { 760 /* update the address relative to the target process */ 761 *argv += cc; 762 } 763 764 if (maxcnt > 0 && len >= maxcnt) { 765 /* 766 * We're stopping prematurely. Terminate the 767 * current string. 768 */ 769 if (ep == 0) { 770 *np = '\0'; 771 *argv++ = ap; 772 } 773 break; 774 } 775 } 776 /* Make sure argv is terminated. */ 777 *argv = 0; 778 return (kd->argv); 779} 780 781static void 782ps_str_a(p, addr, n) 783 struct ps_strings *p; 784 u_long *addr; 785 int *n; 786{ 787 *addr = (u_long)p->ps_argvstr; 788 *n = p->ps_nargvstr; 789} 790 791static void 792ps_str_e(p, addr, n) 793 struct ps_strings *p; 794 u_long *addr; 795 int *n; 796{ 797 *addr = (u_long)p->ps_envstr; 798 *n = p->ps_nenvstr; 799} 800 801/* 802 * Determine if the proc indicated by p is still active. 803 * This test is not 100% foolproof in theory, but chances of 804 * being wrong are very low. 805 */ 806static int 807proc_verify(curkp) 808 struct kinfo_proc *curkp; 809{ 810 struct kinfo_proc newkp; 811 int mib[4]; 812 size_t len; 813 814 mib[0] = CTL_KERN; 815 mib[1] = KERN_PROC; 816 mib[2] = KERN_PROC_PID; 817 mib[3] = curkp->ki_pid; 818 len = sizeof(newkp); 819 if (sysctl(mib, 4, &newkp, &len, NULL, 0) == -1) 820 return (0); 821 return (curkp->ki_pid == newkp.ki_pid && 822 (newkp.ki_stat != SZOMB || curkp->ki_stat == SZOMB)); 823} 824 825static char ** 826kvm_doargv(kd, kp, nchr, info) 827 kvm_t *kd; 828 struct kinfo_proc *kp; 829 int nchr; 830 void (*info)(struct ps_strings *, u_long *, int *); 831{ 832 char **ap; 833 u_long addr; 834 int cnt; 835 static struct ps_strings arginfo; 836 static u_long ps_strings; 837 size_t len; 838 839 if (ps_strings == 0) { 840 len = sizeof(ps_strings); 841 if (sysctlbyname("kern.ps_strings", &ps_strings, &len, NULL, 842 0) == -1) 843 ps_strings = PS_STRINGS; 844 } 845 846 /* 847 * Pointers are stored at the top of the user stack. 848 */ 849 if (kp->ki_stat == SZOMB || 850 kvm_uread(kd, kp, ps_strings, (char *)&arginfo, 851 sizeof(arginfo)) != sizeof(arginfo)) 852 return (0); 853 854 (*info)(&arginfo, &addr, &cnt); 855 if (cnt == 0) 856 return (0); 857 ap = kvm_argv(kd, kp, addr, cnt, nchr); 858 /* 859 * For live kernels, make sure this process didn't go away. 860 */ 861 if (ap != 0 && ISALIVE(kd) && !proc_verify(kp)) 862 ap = 0; 863 return (ap); 864} 865 866/* 867 * Get the command args. This code is now machine independent. 868 */ 869char ** 870kvm_getargv(kd, kp, nchr) 871 kvm_t *kd; 872 const struct kinfo_proc *kp; 873 int nchr; 874{ 875 int oid[4]; 876 int i; 877 size_t bufsz; 878 static unsigned long buflen; 879 static char *buf, *p; 880 static char **bufp; 881 static int argc; 882 883 if (!ISALIVE(kd)) { 884 _kvm_err(kd, kd->program, 885 "cannot read user space from dead kernel"); 886 return (0); 887 } 888 889 if (!buflen) { 890 bufsz = sizeof(buflen); 891 i = sysctlbyname("kern.ps_arg_cache_limit", 892 &buflen, &bufsz, NULL, 0); 893 if (i == -1) { 894 buflen = 0; 895 } else { 896 buf = malloc(buflen); 897 if (buf == NULL) 898 buflen = 0; 899 argc = 32; 900 bufp = malloc(sizeof(char *) * argc); 901 } 902 } 903 if (buf != NULL) { 904 oid[0] = CTL_KERN; 905 oid[1] = KERN_PROC; 906 oid[2] = KERN_PROC_ARGS; 907 oid[3] = kp->ki_pid; 908 bufsz = buflen; 909 i = sysctl(oid, 4, buf, &bufsz, 0, 0); 910 if (i == 0 && bufsz > 0) { 911 i = 0; 912 p = buf; 913 do { 914 bufp[i++] = p; 915 p += strlen(p) + 1; 916 if (i >= argc) { 917 argc += argc; 918 bufp = realloc(bufp, 919 sizeof(char *) * argc); 920 } 921 } while (p < buf + bufsz); 922 bufp[i++] = 0; 923 return (bufp); 924 } 925 } 926 if (kp->ki_flag & P_SYSTEM) 927 return (NULL); 928 return (kvm_doargv(kd, kp, nchr, ps_str_a)); 929} 930 931char ** 932kvm_getenvv(kd, kp, nchr) 933 kvm_t *kd; 934 const struct kinfo_proc *kp; 935 int nchr; 936{ 937 return (kvm_doargv(kd, kp, nchr, ps_str_e)); 938} 939 940/* 941 * Read from user space. The user context is given by p. 942 */ 943ssize_t 944kvm_uread(kd, kp, uva, buf, len) 945 kvm_t *kd; 946 struct kinfo_proc *kp; 947 u_long uva; 948 char *buf; 949 size_t len; 950{ 951 char *cp; 952 char procfile[MAXPATHLEN]; 953 ssize_t amount; 954 int fd; 955 956 if (!ISALIVE(kd)) { 957 _kvm_err(kd, kd->program, 958 "cannot read user space from dead kernel"); 959 return (0); 960 } 961 962 sprintf(procfile, "/proc/%d/mem", kp->ki_pid); 963 fd = open(procfile, O_RDONLY, 0); 964 if (fd < 0) { 965 _kvm_err(kd, kd->program, "cannot open %s", procfile); 966 close(fd); 967 return (0); 968 } 969 970 cp = buf; 971 while (len > 0) { 972 errno = 0; 973 if (lseek(fd, (off_t)uva, 0) == -1 && errno != 0) { 974 _kvm_err(kd, kd->program, "invalid address (%x) in %s", 975 uva, procfile); 976 break; 977 } 978 amount = read(fd, cp, len); 979 if (amount < 0) { 980 _kvm_syserr(kd, kd->program, "error reading %s", 981 procfile); 982 break; 983 } 984 if (amount == 0) { 985 _kvm_err(kd, kd->program, "EOF reading %s", procfile); 986 break; 987 } 988 cp += amount; 989 uva += amount; 990 len -= amount; 991 } 992 993 close(fd); 994 return ((ssize_t)(cp - buf)); 995} 996