1 /*-
2 * Copyright (c) 1982, 1986, 1989, 1991, 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 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 *
29 * @(#)kern_proc.c 8.7 (Berkeley) 2/14/95
30 */
31
32 #include <sys/cdefs.h>
33 __FBSDID("$FreeBSD$");
34
35 #include "opt_compat.h"
36 #include "opt_ddb.h"
37 #include "opt_ktrace.h"
38 #include "opt_kstack_pages.h"
39 #include "opt_stack.h"
40 #include "opt_thrworkq.h"
41
42 #include <sys/param.h>
43 #include <sys/systm.h>
44 #include <sys/elf.h>
45 #include <sys/eventhandler.h>
46 #include <sys/exec.h>
47 #include <sys/jail.h>
48 #include <sys/kernel.h>
49 #include <sys/limits.h>
50 #include <sys/lock.h>
51 #include <sys/loginclass.h>
52 #include <sys/malloc.h>
53 #include <sys/mman.h>
54 #include <sys/mount.h>
55 #include <sys/mutex.h>
56 #include <sys/proc.h>
57 #include <sys/ptrace.h>
58 #include <sys/refcount.h>
59 #include <sys/resourcevar.h>
60 #include <sys/rwlock.h>
61 #include <sys/sbuf.h>
62 #include <sys/sysent.h>
63 #include <sys/sched.h>
64 #include <sys/smp.h>
65 #include <sys/stack.h>
66 #include <sys/stat.h>
67 #include <sys/sysctl.h>
68 #include <sys/filedesc.h>
69 #include <sys/tty.h>
70 #include <sys/signalvar.h>
71 #include <sys/sdt.h>
72 #include <sys/sx.h>
73 #include <sys/user.h>
74 #include <sys/vnode.h>
75 #include <sys/wait.h>
76
77 #ifdef DDB
78 #include <ddb/ddb.h>
79 #endif
80
81 #include <vm/vm.h>
82 #include <vm/vm_param.h>
83 #include <vm/vm_extern.h>
84 #include <vm/pmap.h>
85 #include <vm/vm_map.h>
86 #include <vm/vm_object.h>
87 #include <vm/vm_page.h>
88 #include <vm/uma.h>
89
90 #ifdef COMPAT_FREEBSD32
91 #include <compat/freebsd32/freebsd32.h>
92 #include <compat/freebsd32/freebsd32_util.h>
93 #endif
94
95 SDT_PROVIDER_DEFINE(proc);
96 SDT_PROBE_DEFINE4(proc, , ctor, entry, "struct proc *", "int", "void *",
97 "int");
98 SDT_PROBE_DEFINE4(proc, , ctor, return, "struct proc *", "int", "void *",
99 "int");
100 SDT_PROBE_DEFINE4(proc, , dtor, entry, "struct proc *", "int", "void *",
101 "struct thread *");
102 SDT_PROBE_DEFINE3(proc, , dtor, return, "struct proc *", "int", "void *");
103 SDT_PROBE_DEFINE3(proc, , init, entry, "struct proc *", "int", "int");
104 SDT_PROBE_DEFINE3(proc, , init, return, "struct proc *", "int", "int");
105
106 MALLOC_DEFINE(M_PGRP, "pgrp", "process group header");
107 MALLOC_DEFINE(M_SESSION, "session", "session header");
108 static MALLOC_DEFINE(M_PROC, "proc", "Proc structures");
109 MALLOC_DEFINE(M_SUBPROC, "subproc", "Proc sub-structures");
110
111 static void doenterpgrp(struct proc *, struct pgrp *);
112 static void orphanpg(struct pgrp *pg);
113 static void fill_kinfo_aggregate(struct proc *p, struct kinfo_proc *kp);
114 static void fill_kinfo_proc_only(struct proc *p, struct kinfo_proc *kp);
115 static void fill_kinfo_thread(struct thread *td, struct kinfo_proc *kp,
116 int preferthread);
117 static void pgadjustjobc(struct pgrp *pgrp, int entering);
118 static void pgdelete(struct pgrp *);
119 static int proc_ctor(void *mem, int size, void *arg, int flags);
120 static void proc_dtor(void *mem, int size, void *arg);
121 static int proc_init(void *mem, int size, int flags);
122 static void proc_fini(void *mem, int size);
123 static void pargs_free(struct pargs *pa);
124 static struct proc *zpfind_locked(pid_t pid);
125
126 /*
127 * Other process lists
128 */
129 struct pidhashhead *pidhashtbl;
130 u_long pidhash;
131 struct pgrphashhead *pgrphashtbl;
132 u_long pgrphash;
133 struct proclist allproc;
134 struct proclist zombproc;
135 struct sx allproc_lock;
136 struct sx proctree_lock;
137 struct mtx ppeers_lock;
138 uma_zone_t proc_zone;
139
140 /*
141 * The offset of various fields in struct proc and struct thread.
142 * These are used by kernel debuggers to enumerate kernel threads and
143 * processes.
144 */
145 const int proc_off_p_pid = offsetof(struct proc, p_pid);
146 const int proc_off_p_comm = offsetof(struct proc, p_comm);
147 const int proc_off_p_list = offsetof(struct proc, p_list);
148 const int proc_off_p_threads = offsetof(struct proc, p_threads);
149 const int thread_off_td_tid = offsetof(struct thread, td_tid);
150 const int thread_off_td_name = offsetof(struct thread, td_name);
151 const int thread_off_td_oncpu = offsetof(struct thread, td_oncpu);
152 const int thread_off_td_pcb = offsetof(struct thread, td_pcb);
153 const int thread_off_td_plist = offsetof(struct thread, td_plist);
154
155 int kstack_pages = KSTACK_PAGES;
156 SYSCTL_INT(_kern, OID_AUTO, kstack_pages, CTLFLAG_RD, &kstack_pages, 0,
157 "Kernel stack size in pages");
158 static int vmmap_skip_res_cnt = 0;
159 SYSCTL_INT(_kern, OID_AUTO, proc_vmmap_skip_resident_count, CTLFLAG_RW,
160 &vmmap_skip_res_cnt, 0,
161 "Skip calculation of the pages resident count in kern.proc.vmmap");
162
163 CTASSERT(sizeof(struct kinfo_proc) == KINFO_PROC_SIZE);
164 #ifdef COMPAT_FREEBSD32
165 CTASSERT(sizeof(struct kinfo_proc32) == KINFO_PROC32_SIZE);
166 #endif
167
168 /*
169 * Initialize global process hashing structures.
170 */
171 void
procinit()172 procinit()
173 {
174
175 sx_init(&allproc_lock, "allproc");
176 sx_init(&proctree_lock, "proctree");
177 mtx_init(&ppeers_lock, "p_peers", NULL, MTX_DEF);
178 LIST_INIT(&allproc);
179 LIST_INIT(&zombproc);
180 pidhashtbl = hashinit(maxproc / 4, M_PROC, &pidhash);
181 pgrphashtbl = hashinit(maxproc / 4, M_PROC, &pgrphash);
182 proc_zone = uma_zcreate("PROC", sched_sizeof_proc(),
183 proc_ctor, proc_dtor, proc_init, proc_fini,
184 UMA_ALIGN_PTR, UMA_ZONE_NOFREE);
185 uihashinit();
186 }
187
188 /*
189 * Prepare a proc for use.
190 */
191 static int
proc_ctor(void * mem,int size,void * arg,int flags)192 proc_ctor(void *mem, int size, void *arg, int flags)
193 {
194 struct proc *p;
195
196 p = (struct proc *)mem;
197 SDT_PROBE4(proc, , ctor , entry, p, size, arg, flags);
198 EVENTHANDLER_INVOKE(process_ctor, p);
199 SDT_PROBE4(proc, , ctor , return, p, size, arg, flags);
200 return (0);
201 }
202
203 /*
204 * Reclaim a proc after use.
205 */
206 static void
proc_dtor(void * mem,int size,void * arg)207 proc_dtor(void *mem, int size, void *arg)
208 {
209 struct proc *p;
210 struct thread *td;
211
212 /* INVARIANTS checks go here */
213 p = (struct proc *)mem;
214 td = FIRST_THREAD_IN_PROC(p);
215 SDT_PROBE4(proc, , dtor, entry, p, size, arg, td);
216 if (td != NULL) {
217 #ifdef INVARIANTS
218 KASSERT((p->p_numthreads == 1),
219 ("bad number of threads in exiting process"));
220 KASSERT(STAILQ_EMPTY(&p->p_ktr), ("proc_dtor: non-empty p_ktr"));
221 #endif
222 /* Free all OSD associated to this thread. */
223 osd_thread_exit(td);
224 }
225 EVENTHANDLER_INVOKE(process_dtor, p);
226 if (p->p_ksi != NULL)
227 KASSERT(! KSI_ONQ(p->p_ksi), ("SIGCHLD queue"));
228 SDT_PROBE3(proc, , dtor, return, p, size, arg);
229 }
230
231 /*
232 * Initialize type-stable parts of a proc (when newly created).
233 */
234 static int
proc_init(void * mem,int size,int flags)235 proc_init(void *mem, int size, int flags)
236 {
237 struct proc *p;
238
239 p = (struct proc *)mem;
240 SDT_PROBE3(proc, , init, entry, p, size, flags);
241 p->p_sched = (struct p_sched *)&p[1];
242 mtx_init(&p->p_mtx, "process lock", NULL, MTX_DEF | MTX_DUPOK | MTX_NEW);
243 mtx_init(&p->p_slock, "process slock", NULL, MTX_SPIN | MTX_NEW);
244 mtx_init(&p->p_statmtx, "pstatl", NULL, MTX_SPIN | MTX_NEW);
245 mtx_init(&p->p_itimmtx, "pitiml", NULL, MTX_SPIN | MTX_NEW);
246 mtx_init(&p->p_profmtx, "pprofl", NULL, MTX_SPIN | MTX_NEW);
247 cv_init(&p->p_pwait, "ppwait");
248 cv_init(&p->p_dbgwait, "dbgwait");
249 TAILQ_INIT(&p->p_threads); /* all threads in proc */
250 #ifdef THRWORKQ
251 mtx_init(&p->p_twqlock, "thr workq lock", NULL, MTX_DEF | MTX_DUPOK);
252 p->p_twq = NULL;
253 #endif /* THRQORKQ */
254 EVENTHANDLER_INVOKE(process_init, p);
255 p->p_stats = pstats_alloc();
256 p->p_pgrp = NULL;
257 SDT_PROBE3(proc, , init, return, p, size, flags);
258 return (0);
259 }
260
261 /*
262 * UMA should ensure that this function is never called.
263 * Freeing a proc structure would violate type stability.
264 */
265 static void
proc_fini(void * mem,int size)266 proc_fini(void *mem, int size)
267 {
268 #ifdef notnow
269 struct proc *p;
270
271 p = (struct proc *)mem;
272 EVENTHANDLER_INVOKE(process_fini, p);
273 pstats_free(p->p_stats);
274 thread_free(FIRST_THREAD_IN_PROC(p));
275 mtx_destroy(&p->p_mtx);
276 if (p->p_ksi != NULL)
277 ksiginfo_free(p->p_ksi);
278 #else
279 panic("proc reclaimed");
280 #endif
281 }
282
283 /*
284 * Is p an inferior of the current process?
285 */
286 int
inferior(struct proc * p)287 inferior(struct proc *p)
288 {
289
290 sx_assert(&proctree_lock, SX_LOCKED);
291 PROC_LOCK_ASSERT(p, MA_OWNED);
292 for (; p != curproc; p = proc_realparent(p)) {
293 if (p->p_pid == 0)
294 return (0);
295 }
296 return (1);
297 }
298
299 struct proc *
pfind_locked(pid_t pid)300 pfind_locked(pid_t pid)
301 {
302 struct proc *p;
303
304 sx_assert(&allproc_lock, SX_LOCKED);
305 LIST_FOREACH(p, PIDHASH(pid), p_hash) {
306 if (p->p_pid == pid) {
307 PROC_LOCK(p);
308 if (p->p_state == PRS_NEW) {
309 PROC_UNLOCK(p);
310 p = NULL;
311 }
312 break;
313 }
314 }
315 return (p);
316 }
317
318 /*
319 * Locate a process by number; return only "live" processes -- i.e., neither
320 * zombies nor newly born but incompletely initialized processes. By not
321 * returning processes in the PRS_NEW state, we allow callers to avoid
322 * testing for that condition to avoid dereferencing p_ucred, et al.
323 */
324 struct proc *
pfind(pid_t pid)325 pfind(pid_t pid)
326 {
327 struct proc *p;
328
329 sx_slock(&allproc_lock);
330 p = pfind_locked(pid);
331 sx_sunlock(&allproc_lock);
332 return (p);
333 }
334
335 static struct proc *
pfind_tid_locked(pid_t tid)336 pfind_tid_locked(pid_t tid)
337 {
338 struct proc *p;
339 struct thread *td;
340
341 sx_assert(&allproc_lock, SX_LOCKED);
342 FOREACH_PROC_IN_SYSTEM(p) {
343 PROC_LOCK(p);
344 if (p->p_state == PRS_NEW) {
345 PROC_UNLOCK(p);
346 continue;
347 }
348 FOREACH_THREAD_IN_PROC(p, td) {
349 if (td->td_tid == tid)
350 goto found;
351 }
352 PROC_UNLOCK(p);
353 }
354 found:
355 return (p);
356 }
357
358 /*
359 * Locate a process group by number.
360 * The caller must hold proctree_lock.
361 */
362 struct pgrp *
pgfind(pgid)363 pgfind(pgid)
364 register pid_t pgid;
365 {
366 register struct pgrp *pgrp;
367
368 sx_assert(&proctree_lock, SX_LOCKED);
369
370 LIST_FOREACH(pgrp, PGRPHASH(pgid), pg_hash) {
371 if (pgrp->pg_id == pgid) {
372 PGRP_LOCK(pgrp);
373 return (pgrp);
374 }
375 }
376 return (NULL);
377 }
378
379 /*
380 * Locate process and do additional manipulations, depending on flags.
381 */
382 int
pget(pid_t pid,int flags,struct proc ** pp)383 pget(pid_t pid, int flags, struct proc **pp)
384 {
385 struct proc *p;
386 int error;
387
388 sx_slock(&allproc_lock);
389 if (pid <= PID_MAX) {
390 p = pfind_locked(pid);
391 if (p == NULL && (flags & PGET_NOTWEXIT) == 0)
392 p = zpfind_locked(pid);
393 } else if ((flags & PGET_NOTID) == 0) {
394 p = pfind_tid_locked(pid);
395 } else {
396 p = NULL;
397 }
398 sx_sunlock(&allproc_lock);
399 if (p == NULL)
400 return (ESRCH);
401 if ((flags & PGET_CANSEE) != 0) {
402 error = p_cansee(curthread, p);
403 if (error != 0)
404 goto errout;
405 }
406 if ((flags & PGET_CANDEBUG) != 0) {
407 error = p_candebug(curthread, p);
408 if (error != 0)
409 goto errout;
410 }
411 if ((flags & PGET_ISCURRENT) != 0 && curproc != p) {
412 error = EPERM;
413 goto errout;
414 }
415 if ((flags & PGET_NOTWEXIT) != 0 && (p->p_flag & P_WEXIT) != 0) {
416 error = ESRCH;
417 goto errout;
418 }
419 if ((flags & PGET_NOTINEXEC) != 0 && (p->p_flag & P_INEXEC) != 0) {
420 /*
421 * XXXRW: Not clear ESRCH is the right error during proc
422 * execve().
423 */
424 error = ESRCH;
425 goto errout;
426 }
427 if ((flags & PGET_HOLD) != 0) {
428 _PHOLD(p);
429 PROC_UNLOCK(p);
430 }
431 *pp = p;
432 return (0);
433 errout:
434 PROC_UNLOCK(p);
435 return (error);
436 }
437
438 /*
439 * Create a new process group.
440 * pgid must be equal to the pid of p.
441 * Begin a new session if required.
442 */
443 int
enterpgrp(p,pgid,pgrp,sess)444 enterpgrp(p, pgid, pgrp, sess)
445 register struct proc *p;
446 pid_t pgid;
447 struct pgrp *pgrp;
448 struct session *sess;
449 {
450
451 sx_assert(&proctree_lock, SX_XLOCKED);
452
453 KASSERT(pgrp != NULL, ("enterpgrp: pgrp == NULL"));
454 KASSERT(p->p_pid == pgid,
455 ("enterpgrp: new pgrp and pid != pgid"));
456 KASSERT(pgfind(pgid) == NULL,
457 ("enterpgrp: pgrp with pgid exists"));
458 KASSERT(!SESS_LEADER(p),
459 ("enterpgrp: session leader attempted setpgrp"));
460
461 mtx_init(&pgrp->pg_mtx, "process group", NULL, MTX_DEF | MTX_DUPOK);
462
463 if (sess != NULL) {
464 /*
465 * new session
466 */
467 mtx_init(&sess->s_mtx, "session", NULL, MTX_DEF);
468 PROC_LOCK(p);
469 p->p_flag &= ~P_CONTROLT;
470 PROC_UNLOCK(p);
471 PGRP_LOCK(pgrp);
472 sess->s_leader = p;
473 sess->s_sid = p->p_pid;
474 refcount_init(&sess->s_count, 1);
475 sess->s_ttyvp = NULL;
476 sess->s_ttydp = NULL;
477 sess->s_ttyp = NULL;
478 bcopy(p->p_session->s_login, sess->s_login,
479 sizeof(sess->s_login));
480 pgrp->pg_session = sess;
481 KASSERT(p == curproc,
482 ("enterpgrp: mksession and p != curproc"));
483 } else {
484 pgrp->pg_session = p->p_session;
485 sess_hold(pgrp->pg_session);
486 PGRP_LOCK(pgrp);
487 }
488 pgrp->pg_id = pgid;
489 LIST_INIT(&pgrp->pg_members);
490
491 /*
492 * As we have an exclusive lock of proctree_lock,
493 * this should not deadlock.
494 */
495 LIST_INSERT_HEAD(PGRPHASH(pgid), pgrp, pg_hash);
496 pgrp->pg_jobc = 0;
497 SLIST_INIT(&pgrp->pg_sigiolst);
498 PGRP_UNLOCK(pgrp);
499
500 doenterpgrp(p, pgrp);
501 return (0);
502 }
503
504 /*
505 * Move p to an existing process group
506 */
507 int
enterthispgrp(p,pgrp)508 enterthispgrp(p, pgrp)
509 register struct proc *p;
510 struct pgrp *pgrp;
511 {
512
513 sx_assert(&proctree_lock, SX_XLOCKED);
514 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
515 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
516 PGRP_LOCK_ASSERT(p->p_pgrp, MA_NOTOWNED);
517 SESS_LOCK_ASSERT(p->p_session, MA_NOTOWNED);
518 KASSERT(pgrp->pg_session == p->p_session,
519 ("%s: pgrp's session %p, p->p_session %p.\n",
520 __func__,
521 pgrp->pg_session,
522 p->p_session));
523 KASSERT(pgrp != p->p_pgrp,
524 ("%s: p belongs to pgrp.", __func__));
525
526 doenterpgrp(p, pgrp);
527
528 return (0);
529 }
530
531 /*
532 * Move p to a process group
533 */
534 static void
doenterpgrp(p,pgrp)535 doenterpgrp(p, pgrp)
536 struct proc *p;
537 struct pgrp *pgrp;
538 {
539 struct pgrp *savepgrp;
540
541 sx_assert(&proctree_lock, SX_XLOCKED);
542 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
543 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
544 PGRP_LOCK_ASSERT(p->p_pgrp, MA_NOTOWNED);
545 SESS_LOCK_ASSERT(p->p_session, MA_NOTOWNED);
546
547 savepgrp = p->p_pgrp;
548
549 /*
550 * Adjust eligibility of affected pgrps to participate in job control.
551 * Increment eligibility counts before decrementing, otherwise we
552 * could reach 0 spuriously during the first call.
553 */
554 fixjobc(p, pgrp, 1);
555 fixjobc(p, p->p_pgrp, 0);
556
557 PGRP_LOCK(pgrp);
558 PGRP_LOCK(savepgrp);
559 PROC_LOCK(p);
560 LIST_REMOVE(p, p_pglist);
561 p->p_pgrp = pgrp;
562 PROC_UNLOCK(p);
563 LIST_INSERT_HEAD(&pgrp->pg_members, p, p_pglist);
564 PGRP_UNLOCK(savepgrp);
565 PGRP_UNLOCK(pgrp);
566 if (LIST_EMPTY(&savepgrp->pg_members))
567 pgdelete(savepgrp);
568 }
569
570 /*
571 * remove process from process group
572 */
573 int
leavepgrp(p)574 leavepgrp(p)
575 register struct proc *p;
576 {
577 struct pgrp *savepgrp;
578
579 sx_assert(&proctree_lock, SX_XLOCKED);
580 savepgrp = p->p_pgrp;
581 PGRP_LOCK(savepgrp);
582 PROC_LOCK(p);
583 LIST_REMOVE(p, p_pglist);
584 p->p_pgrp = NULL;
585 PROC_UNLOCK(p);
586 PGRP_UNLOCK(savepgrp);
587 if (LIST_EMPTY(&savepgrp->pg_members))
588 pgdelete(savepgrp);
589 return (0);
590 }
591
592 /*
593 * delete a process group
594 */
595 static void
pgdelete(pgrp)596 pgdelete(pgrp)
597 register struct pgrp *pgrp;
598 {
599 struct session *savesess;
600 struct tty *tp;
601
602 sx_assert(&proctree_lock, SX_XLOCKED);
603 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
604 SESS_LOCK_ASSERT(pgrp->pg_session, MA_NOTOWNED);
605
606 /*
607 * Reset any sigio structures pointing to us as a result of
608 * F_SETOWN with our pgid.
609 */
610 funsetownlst(&pgrp->pg_sigiolst);
611
612 PGRP_LOCK(pgrp);
613 tp = pgrp->pg_session->s_ttyp;
614 LIST_REMOVE(pgrp, pg_hash);
615 savesess = pgrp->pg_session;
616 PGRP_UNLOCK(pgrp);
617
618 /* Remove the reference to the pgrp before deallocating it. */
619 if (tp != NULL) {
620 tty_lock(tp);
621 tty_rel_pgrp(tp, pgrp);
622 }
623
624 mtx_destroy(&pgrp->pg_mtx);
625 free(pgrp, M_PGRP);
626 sess_release(savesess);
627 }
628
629 static void
pgadjustjobc(pgrp,entering)630 pgadjustjobc(pgrp, entering)
631 struct pgrp *pgrp;
632 int entering;
633 {
634
635 PGRP_LOCK(pgrp);
636 if (entering)
637 pgrp->pg_jobc++;
638 else {
639 --pgrp->pg_jobc;
640 if (pgrp->pg_jobc == 0)
641 orphanpg(pgrp);
642 }
643 PGRP_UNLOCK(pgrp);
644 }
645
646 /*
647 * Adjust pgrp jobc counters when specified process changes process group.
648 * We count the number of processes in each process group that "qualify"
649 * the group for terminal job control (those with a parent in a different
650 * process group of the same session). If that count reaches zero, the
651 * process group becomes orphaned. Check both the specified process'
652 * process group and that of its children.
653 * entering == 0 => p is leaving specified group.
654 * entering == 1 => p is entering specified group.
655 */
656 void
fixjobc(p,pgrp,entering)657 fixjobc(p, pgrp, entering)
658 register struct proc *p;
659 register struct pgrp *pgrp;
660 int entering;
661 {
662 register struct pgrp *hispgrp;
663 register struct session *mysession;
664
665 sx_assert(&proctree_lock, SX_LOCKED);
666 PROC_LOCK_ASSERT(p, MA_NOTOWNED);
667 PGRP_LOCK_ASSERT(pgrp, MA_NOTOWNED);
668 SESS_LOCK_ASSERT(pgrp->pg_session, MA_NOTOWNED);
669
670 /*
671 * Check p's parent to see whether p qualifies its own process
672 * group; if so, adjust count for p's process group.
673 */
674 mysession = pgrp->pg_session;
675 if ((hispgrp = p->p_pptr->p_pgrp) != pgrp &&
676 hispgrp->pg_session == mysession)
677 pgadjustjobc(pgrp, entering);
678
679 /*
680 * Check this process' children to see whether they qualify
681 * their process groups; if so, adjust counts for children's
682 * process groups.
683 */
684 LIST_FOREACH(p, &p->p_children, p_sibling) {
685 hispgrp = p->p_pgrp;
686 if (hispgrp == pgrp ||
687 hispgrp->pg_session != mysession)
688 continue;
689 PROC_LOCK(p);
690 if (p->p_state == PRS_ZOMBIE) {
691 PROC_UNLOCK(p);
692 continue;
693 }
694 PROC_UNLOCK(p);
695 pgadjustjobc(hispgrp, entering);
696 }
697 }
698
699 /*
700 * A process group has become orphaned;
701 * if there are any stopped processes in the group,
702 * hang-up all process in that group.
703 */
704 static void
orphanpg(pg)705 orphanpg(pg)
706 struct pgrp *pg;
707 {
708 register struct proc *p;
709
710 PGRP_LOCK_ASSERT(pg, MA_OWNED);
711
712 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
713 PROC_LOCK(p);
714 if (P_SHOULDSTOP(p) == P_STOPPED_SIG) {
715 PROC_UNLOCK(p);
716 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
717 PROC_LOCK(p);
718 kern_psignal(p, SIGHUP);
719 kern_psignal(p, SIGCONT);
720 PROC_UNLOCK(p);
721 }
722 return;
723 }
724 PROC_UNLOCK(p);
725 }
726 }
727
728 void
sess_hold(struct session * s)729 sess_hold(struct session *s)
730 {
731
732 refcount_acquire(&s->s_count);
733 }
734
735 void
sess_release(struct session * s)736 sess_release(struct session *s)
737 {
738
739 if (refcount_release(&s->s_count)) {
740 if (s->s_ttyp != NULL) {
741 tty_lock(s->s_ttyp);
742 tty_rel_sess(s->s_ttyp, s);
743 }
744 mtx_destroy(&s->s_mtx);
745 free(s, M_SESSION);
746 }
747 }
748
749 #ifdef DDB
750
DB_SHOW_COMMAND(pgrpdump,pgrpdump)751 DB_SHOW_COMMAND(pgrpdump, pgrpdump)
752 {
753 register struct pgrp *pgrp;
754 register struct proc *p;
755 register int i;
756
757 for (i = 0; i <= pgrphash; i++) {
758 if (!LIST_EMPTY(&pgrphashtbl[i])) {
759 printf("\tindx %d\n", i);
760 LIST_FOREACH(pgrp, &pgrphashtbl[i], pg_hash) {
761 printf(
762 "\tpgrp %p, pgid %ld, sess %p, sesscnt %d, mem %p\n",
763 (void *)pgrp, (long)pgrp->pg_id,
764 (void *)pgrp->pg_session,
765 pgrp->pg_session->s_count,
766 (void *)LIST_FIRST(&pgrp->pg_members));
767 LIST_FOREACH(p, &pgrp->pg_members, p_pglist) {
768 printf("\t\tpid %ld addr %p pgrp %p\n",
769 (long)p->p_pid, (void *)p,
770 (void *)p->p_pgrp);
771 }
772 }
773 }
774 }
775 }
776 #endif /* DDB */
777
778 /*
779 * Calculate the kinfo_proc members which contain process-wide
780 * informations.
781 * Must be called with the target process locked.
782 */
783 static void
fill_kinfo_aggregate(struct proc * p,struct kinfo_proc * kp)784 fill_kinfo_aggregate(struct proc *p, struct kinfo_proc *kp)
785 {
786 struct thread *td;
787
788 PROC_LOCK_ASSERT(p, MA_OWNED);
789
790 kp->ki_estcpu = 0;
791 kp->ki_pctcpu = 0;
792 FOREACH_THREAD_IN_PROC(p, td) {
793 thread_lock(td);
794 kp->ki_pctcpu += sched_pctcpu(td);
795 kp->ki_estcpu += td->td_estcpu;
796 thread_unlock(td);
797 }
798 }
799
800 /*
801 * Clear kinfo_proc and fill in any information that is common
802 * to all threads in the process.
803 * Must be called with the target process locked.
804 */
805 static void
fill_kinfo_proc_only(struct proc * p,struct kinfo_proc * kp)806 fill_kinfo_proc_only(struct proc *p, struct kinfo_proc *kp)
807 {
808 struct thread *td0;
809 struct tty *tp;
810 struct session *sp;
811 struct ucred *cred;
812 struct sigacts *ps;
813
814 /* For proc_realparent. */
815 sx_assert(&proctree_lock, SX_LOCKED);
816 PROC_LOCK_ASSERT(p, MA_OWNED);
817 bzero(kp, sizeof(*kp));
818
819 kp->ki_structsize = sizeof(*kp);
820 kp->ki_paddr = p;
821 kp->ki_addr =/* p->p_addr; */0; /* XXX */
822 kp->ki_args = p->p_args;
823 kp->ki_textvp = p->p_textvp;
824 #ifdef KTRACE
825 kp->ki_tracep = p->p_tracevp;
826 kp->ki_traceflag = p->p_traceflag;
827 #endif
828 kp->ki_fd = p->p_fd;
829 kp->ki_vmspace = p->p_vmspace;
830 kp->ki_flag = p->p_flag;
831 kp->ki_flag2 = p->p_flag2;
832 cred = p->p_ucred;
833 if (cred) {
834 kp->ki_uid = cred->cr_uid;
835 kp->ki_ruid = cred->cr_ruid;
836 kp->ki_svuid = cred->cr_svuid;
837 kp->ki_cr_flags = 0;
838 if (cred->cr_flags & CRED_FLAG_CAPMODE)
839 kp->ki_cr_flags |= KI_CRF_CAPABILITY_MODE;
840 /* XXX bde doesn't like KI_NGROUPS */
841 if (cred->cr_ngroups > KI_NGROUPS) {
842 kp->ki_ngroups = KI_NGROUPS;
843 kp->ki_cr_flags |= KI_CRF_GRP_OVERFLOW;
844 } else
845 kp->ki_ngroups = cred->cr_ngroups;
846 bcopy(cred->cr_groups, kp->ki_groups,
847 kp->ki_ngroups * sizeof(gid_t));
848 kp->ki_rgid = cred->cr_rgid;
849 kp->ki_svgid = cred->cr_svgid;
850 /* If jailed(cred), emulate the old P_JAILED flag. */
851 if (jailed(cred)) {
852 kp->ki_flag |= P_JAILED;
853 /* If inside the jail, use 0 as a jail ID. */
854 if (cred->cr_prison != curthread->td_ucred->cr_prison)
855 kp->ki_jid = cred->cr_prison->pr_id;
856 }
857 strlcpy(kp->ki_loginclass, cred->cr_loginclass->lc_name,
858 sizeof(kp->ki_loginclass));
859 }
860 ps = p->p_sigacts;
861 if (ps) {
862 mtx_lock(&ps->ps_mtx);
863 kp->ki_sigignore = ps->ps_sigignore;
864 kp->ki_sigcatch = ps->ps_sigcatch;
865 mtx_unlock(&ps->ps_mtx);
866 }
867 if (p->p_state != PRS_NEW &&
868 p->p_state != PRS_ZOMBIE &&
869 p->p_vmspace != NULL) {
870 struct vmspace *vm = p->p_vmspace;
871
872 kp->ki_size = vm->vm_map.size;
873 kp->ki_rssize = vmspace_resident_count(vm); /*XXX*/
874 FOREACH_THREAD_IN_PROC(p, td0) {
875 if (!TD_IS_SWAPPED(td0))
876 kp->ki_rssize += td0->td_kstack_pages;
877 }
878 kp->ki_swrss = vm->vm_swrss;
879 kp->ki_tsize = vm->vm_tsize;
880 kp->ki_dsize = vm->vm_dsize;
881 kp->ki_ssize = vm->vm_ssize;
882 } else if (p->p_state == PRS_ZOMBIE)
883 kp->ki_stat = SZOMB;
884 if (kp->ki_flag & P_INMEM)
885 kp->ki_sflag = PS_INMEM;
886 else
887 kp->ki_sflag = 0;
888 /* Calculate legacy swtime as seconds since 'swtick'. */
889 kp->ki_swtime = (ticks - p->p_swtick) / hz;
890 kp->ki_pid = p->p_pid;
891 kp->ki_nice = p->p_nice;
892 kp->ki_fibnum = p->p_fibnum;
893 kp->ki_start = p->p_stats->p_start;
894 timevaladd(&kp->ki_start, &boottime);
895 PROC_STATLOCK(p);
896 rufetch(p, &kp->ki_rusage);
897 kp->ki_runtime = cputick2usec(p->p_rux.rux_runtime);
898 calcru(p, &kp->ki_rusage.ru_utime, &kp->ki_rusage.ru_stime);
899 PROC_STATUNLOCK(p);
900 calccru(p, &kp->ki_childutime, &kp->ki_childstime);
901 /* Some callers want child times in a single value. */
902 kp->ki_childtime = kp->ki_childstime;
903 timevaladd(&kp->ki_childtime, &kp->ki_childutime);
904
905 FOREACH_THREAD_IN_PROC(p, td0)
906 kp->ki_cow += td0->td_cow;
907
908 tp = NULL;
909 if (p->p_pgrp) {
910 kp->ki_pgid = p->p_pgrp->pg_id;
911 kp->ki_jobc = p->p_pgrp->pg_jobc;
912 sp = p->p_pgrp->pg_session;
913
914 if (sp != NULL) {
915 kp->ki_sid = sp->s_sid;
916 SESS_LOCK(sp);
917 strlcpy(kp->ki_login, sp->s_login,
918 sizeof(kp->ki_login));
919 if (sp->s_ttyvp)
920 kp->ki_kiflag |= KI_CTTY;
921 if (SESS_LEADER(p))
922 kp->ki_kiflag |= KI_SLEADER;
923 /* XXX proctree_lock */
924 tp = sp->s_ttyp;
925 SESS_UNLOCK(sp);
926 }
927 }
928 if ((p->p_flag & P_CONTROLT) && tp != NULL) {
929 kp->ki_tdev = tty_udev(tp);
930 kp->ki_tpgid = tp->t_pgrp ? tp->t_pgrp->pg_id : NO_PID;
931 if (tp->t_session)
932 kp->ki_tsid = tp->t_session->s_sid;
933 } else
934 kp->ki_tdev = NODEV;
935 if (p->p_comm[0] != '\0')
936 strlcpy(kp->ki_comm, p->p_comm, sizeof(kp->ki_comm));
937 if (p->p_sysent && p->p_sysent->sv_name != NULL &&
938 p->p_sysent->sv_name[0] != '\0')
939 strlcpy(kp->ki_emul, p->p_sysent->sv_name, sizeof(kp->ki_emul));
940 kp->ki_siglist = p->p_siglist;
941 kp->ki_xstat = KW_EXITCODE(p->p_xexit, p->p_xsig);
942 kp->ki_acflag = p->p_acflag;
943 kp->ki_lock = p->p_lock;
944 if (p->p_pptr) {
945 kp->ki_ppid = proc_realparent(p)->p_pid;
946 if (p->p_flag & P_TRACED)
947 kp->ki_tracer = p->p_pptr->p_pid;
948 }
949 }
950
951 /*
952 * Fill in information that is thread specific. Must be called with
953 * target process locked. If 'preferthread' is set, overwrite certain
954 * process-related fields that are maintained for both threads and
955 * processes.
956 */
957 static void
fill_kinfo_thread(struct thread * td,struct kinfo_proc * kp,int preferthread)958 fill_kinfo_thread(struct thread *td, struct kinfo_proc *kp, int preferthread)
959 {
960 struct proc *p;
961
962 p = td->td_proc;
963 kp->ki_tdaddr = td;
964 PROC_LOCK_ASSERT(p, MA_OWNED);
965
966 if (preferthread)
967 PROC_STATLOCK(p);
968 thread_lock(td);
969 if (td->td_wmesg != NULL)
970 strlcpy(kp->ki_wmesg, td->td_wmesg, sizeof(kp->ki_wmesg));
971 else
972 bzero(kp->ki_wmesg, sizeof(kp->ki_wmesg));
973 strlcpy(kp->ki_tdname, td->td_name, sizeof(kp->ki_tdname));
974 if (TD_ON_LOCK(td)) {
975 kp->ki_kiflag |= KI_LOCKBLOCK;
976 strlcpy(kp->ki_lockname, td->td_lockname,
977 sizeof(kp->ki_lockname));
978 } else {
979 kp->ki_kiflag &= ~KI_LOCKBLOCK;
980 bzero(kp->ki_lockname, sizeof(kp->ki_lockname));
981 }
982
983 if (p->p_state == PRS_NORMAL) { /* approximate. */
984 if (TD_ON_RUNQ(td) ||
985 TD_CAN_RUN(td) ||
986 TD_IS_RUNNING(td)) {
987 kp->ki_stat = SRUN;
988 } else if (P_SHOULDSTOP(p)) {
989 kp->ki_stat = SSTOP;
990 } else if (TD_IS_SLEEPING(td)) {
991 kp->ki_stat = SSLEEP;
992 } else if (TD_ON_LOCK(td)) {
993 kp->ki_stat = SLOCK;
994 } else {
995 kp->ki_stat = SWAIT;
996 }
997 } else if (p->p_state == PRS_ZOMBIE) {
998 kp->ki_stat = SZOMB;
999 } else {
1000 kp->ki_stat = SIDL;
1001 }
1002
1003 /* Things in the thread */
1004 kp->ki_wchan = td->td_wchan;
1005 kp->ki_pri.pri_level = td->td_priority;
1006 kp->ki_pri.pri_native = td->td_base_pri;
1007
1008 /*
1009 * Note: legacy fields; clamp at the old NOCPU value and/or
1010 * the maximum u_char CPU value.
1011 */
1012 if (td->td_lastcpu == NOCPU)
1013 kp->ki_lastcpu_old = NOCPU_OLD;
1014 else if (td->td_lastcpu > MAXCPU_OLD)
1015 kp->ki_lastcpu_old = MAXCPU_OLD;
1016 else
1017 kp->ki_lastcpu_old = td->td_lastcpu;
1018
1019 if (td->td_oncpu == NOCPU)
1020 kp->ki_oncpu_old = NOCPU_OLD;
1021 else if (td->td_oncpu > MAXCPU_OLD)
1022 kp->ki_oncpu_old = MAXCPU_OLD;
1023 else
1024 kp->ki_oncpu_old = td->td_oncpu;
1025
1026 kp->ki_lastcpu = td->td_lastcpu;
1027 kp->ki_oncpu = td->td_oncpu;
1028 kp->ki_tdflags = td->td_flags;
1029 kp->ki_tid = td->td_tid;
1030 kp->ki_numthreads = p->p_numthreads;
1031 kp->ki_pcb = td->td_pcb;
1032 kp->ki_kstack = (void *)td->td_kstack;
1033 kp->ki_slptime = (ticks - td->td_slptick) / hz;
1034 kp->ki_pri.pri_class = td->td_pri_class;
1035 kp->ki_pri.pri_user = td->td_user_pri;
1036
1037 if (preferthread) {
1038 rufetchtd(td, &kp->ki_rusage);
1039 kp->ki_runtime = cputick2usec(td->td_rux.rux_runtime);
1040 kp->ki_pctcpu = sched_pctcpu(td);
1041 kp->ki_estcpu = td->td_estcpu;
1042 kp->ki_cow = td->td_cow;
1043 }
1044
1045 /* We can't get this anymore but ps etc never used it anyway. */
1046 kp->ki_rqindex = 0;
1047
1048 if (preferthread)
1049 kp->ki_siglist = td->td_siglist;
1050 kp->ki_sigmask = td->td_sigmask;
1051 thread_unlock(td);
1052 if (preferthread)
1053 PROC_STATUNLOCK(p);
1054 }
1055
1056 /*
1057 * Fill in a kinfo_proc structure for the specified process.
1058 * Must be called with the target process locked.
1059 */
1060 void
fill_kinfo_proc(struct proc * p,struct kinfo_proc * kp)1061 fill_kinfo_proc(struct proc *p, struct kinfo_proc *kp)
1062 {
1063
1064 MPASS(FIRST_THREAD_IN_PROC(p) != NULL);
1065
1066 fill_kinfo_proc_only(p, kp);
1067 fill_kinfo_thread(FIRST_THREAD_IN_PROC(p), kp, 0);
1068 fill_kinfo_aggregate(p, kp);
1069 }
1070
1071 struct pstats *
pstats_alloc(void)1072 pstats_alloc(void)
1073 {
1074
1075 return (malloc(sizeof(struct pstats), M_SUBPROC, M_ZERO|M_WAITOK));
1076 }
1077
1078 /*
1079 * Copy parts of p_stats; zero the rest of p_stats (statistics).
1080 */
1081 void
pstats_fork(struct pstats * src,struct pstats * dst)1082 pstats_fork(struct pstats *src, struct pstats *dst)
1083 {
1084
1085 bzero(&dst->pstat_startzero,
1086 __rangeof(struct pstats, pstat_startzero, pstat_endzero));
1087 bcopy(&src->pstat_startcopy, &dst->pstat_startcopy,
1088 __rangeof(struct pstats, pstat_startcopy, pstat_endcopy));
1089 }
1090
1091 void
pstats_free(struct pstats * ps)1092 pstats_free(struct pstats *ps)
1093 {
1094
1095 free(ps, M_SUBPROC);
1096 }
1097
1098 static struct proc *
zpfind_locked(pid_t pid)1099 zpfind_locked(pid_t pid)
1100 {
1101 struct proc *p;
1102
1103 sx_assert(&allproc_lock, SX_LOCKED);
1104 LIST_FOREACH(p, &zombproc, p_list) {
1105 if (p->p_pid == pid) {
1106 PROC_LOCK(p);
1107 break;
1108 }
1109 }
1110 return (p);
1111 }
1112
1113 /*
1114 * Locate a zombie process by number
1115 */
1116 struct proc *
zpfind(pid_t pid)1117 zpfind(pid_t pid)
1118 {
1119 struct proc *p;
1120
1121 sx_slock(&allproc_lock);
1122 p = zpfind_locked(pid);
1123 sx_sunlock(&allproc_lock);
1124 return (p);
1125 }
1126
1127 #ifdef COMPAT_FREEBSD32
1128
1129 /*
1130 * This function is typically used to copy out the kernel address, so
1131 * it can be replaced by assignment of zero.
1132 */
1133 static inline uint32_t
ptr32_trim(void * ptr)1134 ptr32_trim(void *ptr)
1135 {
1136 uintptr_t uptr;
1137
1138 uptr = (uintptr_t)ptr;
1139 return ((uptr > UINT_MAX) ? 0 : uptr);
1140 }
1141
1142 #define PTRTRIM_CP(src,dst,fld) \
1143 do { (dst).fld = ptr32_trim((src).fld); } while (0)
1144
1145 static void
freebsd32_kinfo_proc_out(const struct kinfo_proc * ki,struct kinfo_proc32 * ki32)1146 freebsd32_kinfo_proc_out(const struct kinfo_proc *ki, struct kinfo_proc32 *ki32)
1147 {
1148 int i;
1149
1150 bzero(ki32, sizeof(struct kinfo_proc32));
1151 ki32->ki_structsize = sizeof(struct kinfo_proc32);
1152 CP(*ki, *ki32, ki_layout);
1153 PTRTRIM_CP(*ki, *ki32, ki_args);
1154 PTRTRIM_CP(*ki, *ki32, ki_paddr);
1155 PTRTRIM_CP(*ki, *ki32, ki_addr);
1156 PTRTRIM_CP(*ki, *ki32, ki_tracep);
1157 PTRTRIM_CP(*ki, *ki32, ki_textvp);
1158 PTRTRIM_CP(*ki, *ki32, ki_fd);
1159 PTRTRIM_CP(*ki, *ki32, ki_vmspace);
1160 PTRTRIM_CP(*ki, *ki32, ki_wchan);
1161 CP(*ki, *ki32, ki_pid);
1162 CP(*ki, *ki32, ki_ppid);
1163 CP(*ki, *ki32, ki_pgid);
1164 CP(*ki, *ki32, ki_tpgid);
1165 CP(*ki, *ki32, ki_sid);
1166 CP(*ki, *ki32, ki_tsid);
1167 CP(*ki, *ki32, ki_jobc);
1168 CP(*ki, *ki32, ki_tdev);
1169 CP(*ki, *ki32, ki_siglist);
1170 CP(*ki, *ki32, ki_sigmask);
1171 CP(*ki, *ki32, ki_sigignore);
1172 CP(*ki, *ki32, ki_sigcatch);
1173 CP(*ki, *ki32, ki_uid);
1174 CP(*ki, *ki32, ki_ruid);
1175 CP(*ki, *ki32, ki_svuid);
1176 CP(*ki, *ki32, ki_rgid);
1177 CP(*ki, *ki32, ki_svgid);
1178 CP(*ki, *ki32, ki_ngroups);
1179 for (i = 0; i < KI_NGROUPS; i++)
1180 CP(*ki, *ki32, ki_groups[i]);
1181 CP(*ki, *ki32, ki_size);
1182 CP(*ki, *ki32, ki_rssize);
1183 CP(*ki, *ki32, ki_swrss);
1184 CP(*ki, *ki32, ki_tsize);
1185 CP(*ki, *ki32, ki_dsize);
1186 CP(*ki, *ki32, ki_ssize);
1187 CP(*ki, *ki32, ki_xstat);
1188 CP(*ki, *ki32, ki_acflag);
1189 CP(*ki, *ki32, ki_pctcpu);
1190 CP(*ki, *ki32, ki_estcpu);
1191 CP(*ki, *ki32, ki_slptime);
1192 CP(*ki, *ki32, ki_swtime);
1193 CP(*ki, *ki32, ki_cow);
1194 CP(*ki, *ki32, ki_runtime);
1195 TV_CP(*ki, *ki32, ki_start);
1196 TV_CP(*ki, *ki32, ki_childtime);
1197 CP(*ki, *ki32, ki_flag);
1198 CP(*ki, *ki32, ki_kiflag);
1199 CP(*ki, *ki32, ki_traceflag);
1200 CP(*ki, *ki32, ki_stat);
1201 CP(*ki, *ki32, ki_nice);
1202 CP(*ki, *ki32, ki_lock);
1203 CP(*ki, *ki32, ki_rqindex);
1204 CP(*ki, *ki32, ki_oncpu);
1205 CP(*ki, *ki32, ki_lastcpu);
1206
1207 /* XXX TODO: wrap cpu value as appropriate */
1208 CP(*ki, *ki32, ki_oncpu_old);
1209 CP(*ki, *ki32, ki_lastcpu_old);
1210
1211 bcopy(ki->ki_tdname, ki32->ki_tdname, TDNAMLEN + 1);
1212 bcopy(ki->ki_wmesg, ki32->ki_wmesg, WMESGLEN + 1);
1213 bcopy(ki->ki_login, ki32->ki_login, LOGNAMELEN + 1);
1214 bcopy(ki->ki_lockname, ki32->ki_lockname, LOCKNAMELEN + 1);
1215 bcopy(ki->ki_comm, ki32->ki_comm, COMMLEN + 1);
1216 bcopy(ki->ki_emul, ki32->ki_emul, KI_EMULNAMELEN + 1);
1217 bcopy(ki->ki_loginclass, ki32->ki_loginclass, LOGINCLASSLEN + 1);
1218 CP(*ki, *ki32, ki_tracer);
1219 CP(*ki, *ki32, ki_flag2);
1220 CP(*ki, *ki32, ki_fibnum);
1221 CP(*ki, *ki32, ki_cr_flags);
1222 CP(*ki, *ki32, ki_jid);
1223 CP(*ki, *ki32, ki_numthreads);
1224 CP(*ki, *ki32, ki_tid);
1225 CP(*ki, *ki32, ki_pri);
1226 freebsd32_rusage_out(&ki->ki_rusage, &ki32->ki_rusage);
1227 freebsd32_rusage_out(&ki->ki_rusage_ch, &ki32->ki_rusage_ch);
1228 PTRTRIM_CP(*ki, *ki32, ki_pcb);
1229 PTRTRIM_CP(*ki, *ki32, ki_kstack);
1230 PTRTRIM_CP(*ki, *ki32, ki_udata);
1231 CP(*ki, *ki32, ki_sflag);
1232 CP(*ki, *ki32, ki_tdflags);
1233 }
1234 #endif
1235
1236 int
kern_proc_out(struct proc * p,struct sbuf * sb,int flags)1237 kern_proc_out(struct proc *p, struct sbuf *sb, int flags)
1238 {
1239 struct thread *td;
1240 struct kinfo_proc ki;
1241 #ifdef COMPAT_FREEBSD32
1242 struct kinfo_proc32 ki32;
1243 #endif
1244 int error;
1245
1246 PROC_LOCK_ASSERT(p, MA_OWNED);
1247 MPASS(FIRST_THREAD_IN_PROC(p) != NULL);
1248
1249 error = 0;
1250 fill_kinfo_proc(p, &ki);
1251 if ((flags & KERN_PROC_NOTHREADS) != 0) {
1252 #ifdef COMPAT_FREEBSD32
1253 if ((flags & KERN_PROC_MASK32) != 0) {
1254 freebsd32_kinfo_proc_out(&ki, &ki32);
1255 if (sbuf_bcat(sb, &ki32, sizeof(ki32)) != 0)
1256 error = ENOMEM;
1257 } else
1258 #endif
1259 if (sbuf_bcat(sb, &ki, sizeof(ki)) != 0)
1260 error = ENOMEM;
1261 } else {
1262 FOREACH_THREAD_IN_PROC(p, td) {
1263 fill_kinfo_thread(td, &ki, 1);
1264 #ifdef COMPAT_FREEBSD32
1265 if ((flags & KERN_PROC_MASK32) != 0) {
1266 freebsd32_kinfo_proc_out(&ki, &ki32);
1267 if (sbuf_bcat(sb, &ki32, sizeof(ki32)) != 0)
1268 error = ENOMEM;
1269 } else
1270 #endif
1271 if (sbuf_bcat(sb, &ki, sizeof(ki)) != 0)
1272 error = ENOMEM;
1273 if (error != 0)
1274 break;
1275 }
1276 }
1277 PROC_UNLOCK(p);
1278 return (error);
1279 }
1280
1281 static int
sysctl_out_proc(struct proc * p,struct sysctl_req * req,int flags,int doingzomb)1282 sysctl_out_proc(struct proc *p, struct sysctl_req *req, int flags,
1283 int doingzomb)
1284 {
1285 struct sbuf sb;
1286 struct kinfo_proc ki;
1287 struct proc *np;
1288 int error, error2;
1289 pid_t pid;
1290
1291 pid = p->p_pid;
1292 sbuf_new_for_sysctl(&sb, (char *)&ki, sizeof(ki), req);
1293 sbuf_clear_flags(&sb, SBUF_INCLUDENUL);
1294 error = kern_proc_out(p, &sb, flags);
1295 error2 = sbuf_finish(&sb);
1296 sbuf_delete(&sb);
1297 if (error != 0)
1298 return (error);
1299 else if (error2 != 0)
1300 return (error2);
1301 if (doingzomb)
1302 np = zpfind(pid);
1303 else {
1304 if (pid == 0)
1305 return (0);
1306 np = pfind(pid);
1307 }
1308 if (np == NULL)
1309 return (ESRCH);
1310 if (np != p) {
1311 PROC_UNLOCK(np);
1312 return (ESRCH);
1313 }
1314 PROC_UNLOCK(np);
1315 return (0);
1316 }
1317
1318 static int
sysctl_kern_proc(SYSCTL_HANDLER_ARGS)1319 sysctl_kern_proc(SYSCTL_HANDLER_ARGS)
1320 {
1321 int *name = (int *)arg1;
1322 u_int namelen = arg2;
1323 struct proc *p;
1324 int flags, doingzomb, oid_number;
1325 int error = 0;
1326
1327 oid_number = oidp->oid_number;
1328 if (oid_number != KERN_PROC_ALL &&
1329 (oid_number & KERN_PROC_INC_THREAD) == 0)
1330 flags = KERN_PROC_NOTHREADS;
1331 else {
1332 flags = 0;
1333 oid_number &= ~KERN_PROC_INC_THREAD;
1334 }
1335 #ifdef COMPAT_FREEBSD32
1336 if (req->flags & SCTL_MASK32)
1337 flags |= KERN_PROC_MASK32;
1338 #endif
1339 if (oid_number == KERN_PROC_PID) {
1340 if (namelen != 1)
1341 return (EINVAL);
1342 error = sysctl_wire_old_buffer(req, 0);
1343 if (error)
1344 return (error);
1345 sx_slock(&proctree_lock);
1346 error = pget((pid_t)name[0], PGET_CANSEE, &p);
1347 if (error == 0)
1348 error = sysctl_out_proc(p, req, flags, 0);
1349 sx_sunlock(&proctree_lock);
1350 return (error);
1351 }
1352
1353 switch (oid_number) {
1354 case KERN_PROC_ALL:
1355 if (namelen != 0)
1356 return (EINVAL);
1357 break;
1358 case KERN_PROC_PROC:
1359 if (namelen != 0 && namelen != 1)
1360 return (EINVAL);
1361 break;
1362 default:
1363 if (namelen != 1)
1364 return (EINVAL);
1365 break;
1366 }
1367
1368 if (!req->oldptr) {
1369 /* overestimate by 5 procs */
1370 error = SYSCTL_OUT(req, 0, sizeof (struct kinfo_proc) * 5);
1371 if (error)
1372 return (error);
1373 }
1374 error = sysctl_wire_old_buffer(req, 0);
1375 if (error != 0)
1376 return (error);
1377 sx_slock(&proctree_lock);
1378 sx_slock(&allproc_lock);
1379 for (doingzomb=0 ; doingzomb < 2 ; doingzomb++) {
1380 if (!doingzomb)
1381 p = LIST_FIRST(&allproc);
1382 else
1383 p = LIST_FIRST(&zombproc);
1384 for (; p != 0; p = LIST_NEXT(p, p_list)) {
1385 /*
1386 * Skip embryonic processes.
1387 */
1388 PROC_LOCK(p);
1389 if (p->p_state == PRS_NEW) {
1390 PROC_UNLOCK(p);
1391 continue;
1392 }
1393 KASSERT(p->p_ucred != NULL,
1394 ("process credential is NULL for non-NEW proc"));
1395 /*
1396 * Show a user only appropriate processes.
1397 */
1398 if (p_cansee(curthread, p)) {
1399 PROC_UNLOCK(p);
1400 continue;
1401 }
1402 /*
1403 * TODO - make more efficient (see notes below).
1404 * do by session.
1405 */
1406 switch (oid_number) {
1407
1408 case KERN_PROC_GID:
1409 if (p->p_ucred->cr_gid != (gid_t)name[0]) {
1410 PROC_UNLOCK(p);
1411 continue;
1412 }
1413 break;
1414
1415 case KERN_PROC_PGRP:
1416 /* could do this by traversing pgrp */
1417 if (p->p_pgrp == NULL ||
1418 p->p_pgrp->pg_id != (pid_t)name[0]) {
1419 PROC_UNLOCK(p);
1420 continue;
1421 }
1422 break;
1423
1424 case KERN_PROC_RGID:
1425 if (p->p_ucred->cr_rgid != (gid_t)name[0]) {
1426 PROC_UNLOCK(p);
1427 continue;
1428 }
1429 break;
1430
1431 case KERN_PROC_SESSION:
1432 if (p->p_session == NULL ||
1433 p->p_session->s_sid != (pid_t)name[0]) {
1434 PROC_UNLOCK(p);
1435 continue;
1436 }
1437 break;
1438
1439 case KERN_PROC_TTY:
1440 if ((p->p_flag & P_CONTROLT) == 0 ||
1441 p->p_session == NULL) {
1442 PROC_UNLOCK(p);
1443 continue;
1444 }
1445 /* XXX proctree_lock */
1446 SESS_LOCK(p->p_session);
1447 if (p->p_session->s_ttyp == NULL ||
1448 tty_udev(p->p_session->s_ttyp) !=
1449 (dev_t)name[0]) {
1450 SESS_UNLOCK(p->p_session);
1451 PROC_UNLOCK(p);
1452 continue;
1453 }
1454 SESS_UNLOCK(p->p_session);
1455 break;
1456
1457 case KERN_PROC_UID:
1458 if (p->p_ucred->cr_uid != (uid_t)name[0]) {
1459 PROC_UNLOCK(p);
1460 continue;
1461 }
1462 break;
1463
1464 case KERN_PROC_RUID:
1465 if (p->p_ucred->cr_ruid != (uid_t)name[0]) {
1466 PROC_UNLOCK(p);
1467 continue;
1468 }
1469 break;
1470
1471 case KERN_PROC_PROC:
1472 break;
1473
1474 default:
1475 break;
1476
1477 }
1478
1479 error = sysctl_out_proc(p, req, flags, doingzomb);
1480 if (error) {
1481 sx_sunlock(&allproc_lock);
1482 sx_sunlock(&proctree_lock);
1483 return (error);
1484 }
1485 }
1486 }
1487 sx_sunlock(&allproc_lock);
1488 sx_sunlock(&proctree_lock);
1489 return (0);
1490 }
1491
1492 struct pargs *
pargs_alloc(int len)1493 pargs_alloc(int len)
1494 {
1495 struct pargs *pa;
1496
1497 pa = malloc(sizeof(struct pargs) + len, M_PARGS,
1498 M_WAITOK);
1499 refcount_init(&pa->ar_ref, 1);
1500 pa->ar_length = len;
1501 return (pa);
1502 }
1503
1504 static void
pargs_free(struct pargs * pa)1505 pargs_free(struct pargs *pa)
1506 {
1507
1508 free(pa, M_PARGS);
1509 }
1510
1511 void
pargs_hold(struct pargs * pa)1512 pargs_hold(struct pargs *pa)
1513 {
1514
1515 if (pa == NULL)
1516 return;
1517 refcount_acquire(&pa->ar_ref);
1518 }
1519
1520 void
pargs_drop(struct pargs * pa)1521 pargs_drop(struct pargs *pa)
1522 {
1523
1524 if (pa == NULL)
1525 return;
1526 if (refcount_release(&pa->ar_ref))
1527 pargs_free(pa);
1528 }
1529
1530 static int
proc_read_string(struct thread * td,struct proc * p,const char * sptr,char * buf,size_t len)1531 proc_read_string(struct thread *td, struct proc *p, const char *sptr, char *buf,
1532 size_t len)
1533 {
1534 ssize_t n;
1535
1536 /*
1537 * This may return a short read if the string is shorter than the chunk
1538 * and is aligned at the end of the page, and the following page is not
1539 * mapped.
1540 */
1541 n = proc_readmem(td, p, (vm_offset_t)sptr, buf, len);
1542 if (n <= 0)
1543 return (ENOMEM);
1544 return (0);
1545 }
1546
1547 #define PROC_AUXV_MAX 256 /* Safety limit on auxv size. */
1548
1549 enum proc_vector_type {
1550 PROC_ARG,
1551 PROC_ENV,
1552 PROC_AUX,
1553 };
1554
1555 #ifdef COMPAT_FREEBSD32
1556 static int
get_proc_vector32(struct thread * td,struct proc * p,char *** proc_vectorp,size_t * vsizep,enum proc_vector_type type)1557 get_proc_vector32(struct thread *td, struct proc *p, char ***proc_vectorp,
1558 size_t *vsizep, enum proc_vector_type type)
1559 {
1560 struct freebsd32_ps_strings pss;
1561 Elf32_Auxinfo aux;
1562 vm_offset_t vptr, ptr;
1563 uint32_t *proc_vector32;
1564 char **proc_vector;
1565 size_t vsize, size;
1566 int i, error;
1567
1568 error = 0;
1569 if (proc_readmem(td, p, (vm_offset_t)p->p_sysent->sv_psstrings, &pss,
1570 sizeof(pss)) != sizeof(pss))
1571 return (ENOMEM);
1572 switch (type) {
1573 case PROC_ARG:
1574 vptr = (vm_offset_t)PTRIN(pss.ps_argvstr);
1575 vsize = pss.ps_nargvstr;
1576 if (vsize > ARG_MAX)
1577 return (ENOEXEC);
1578 size = vsize * sizeof(int32_t);
1579 break;
1580 case PROC_ENV:
1581 vptr = (vm_offset_t)PTRIN(pss.ps_envstr);
1582 vsize = pss.ps_nenvstr;
1583 if (vsize > ARG_MAX)
1584 return (ENOEXEC);
1585 size = vsize * sizeof(int32_t);
1586 break;
1587 case PROC_AUX:
1588 vptr = (vm_offset_t)PTRIN(pss.ps_envstr) +
1589 (pss.ps_nenvstr + 1) * sizeof(int32_t);
1590 if (vptr % 4 != 0)
1591 return (ENOEXEC);
1592 for (ptr = vptr, i = 0; i < PROC_AUXV_MAX; i++) {
1593 if (proc_readmem(td, p, ptr, &aux, sizeof(aux)) !=
1594 sizeof(aux))
1595 return (ENOMEM);
1596 if (aux.a_type == AT_NULL)
1597 break;
1598 ptr += sizeof(aux);
1599 }
1600 if (aux.a_type != AT_NULL)
1601 return (ENOEXEC);
1602 vsize = i + 1;
1603 size = vsize * sizeof(aux);
1604 break;
1605 default:
1606 KASSERT(0, ("Wrong proc vector type: %d", type));
1607 return (EINVAL);
1608 }
1609 proc_vector32 = malloc(size, M_TEMP, M_WAITOK);
1610 if (proc_readmem(td, p, vptr, proc_vector32, size) != size) {
1611 error = ENOMEM;
1612 goto done;
1613 }
1614 if (type == PROC_AUX) {
1615 *proc_vectorp = (char **)proc_vector32;
1616 *vsizep = vsize;
1617 return (0);
1618 }
1619 proc_vector = malloc(vsize * sizeof(char *), M_TEMP, M_WAITOK);
1620 for (i = 0; i < (int)vsize; i++)
1621 proc_vector[i] = PTRIN(proc_vector32[i]);
1622 *proc_vectorp = proc_vector;
1623 *vsizep = vsize;
1624 done:
1625 free(proc_vector32, M_TEMP);
1626 return (error);
1627 }
1628 #endif
1629
1630 static int
get_proc_vector(struct thread * td,struct proc * p,char *** proc_vectorp,size_t * vsizep,enum proc_vector_type type)1631 get_proc_vector(struct thread *td, struct proc *p, char ***proc_vectorp,
1632 size_t *vsizep, enum proc_vector_type type)
1633 {
1634 struct ps_strings pss;
1635 Elf_Auxinfo aux;
1636 vm_offset_t vptr, ptr;
1637 char **proc_vector;
1638 size_t vsize, size;
1639 int i;
1640
1641 #ifdef COMPAT_FREEBSD32
1642 if (SV_PROC_FLAG(p, SV_ILP32) != 0)
1643 return (get_proc_vector32(td, p, proc_vectorp, vsizep, type));
1644 #endif
1645 if (proc_readmem(td, p, (vm_offset_t)p->p_sysent->sv_psstrings, &pss,
1646 sizeof(pss)) != sizeof(pss))
1647 return (ENOMEM);
1648 switch (type) {
1649 case PROC_ARG:
1650 vptr = (vm_offset_t)pss.ps_argvstr;
1651 vsize = pss.ps_nargvstr;
1652 if (vsize > ARG_MAX)
1653 return (ENOEXEC);
1654 size = vsize * sizeof(char *);
1655 break;
1656 case PROC_ENV:
1657 vptr = (vm_offset_t)pss.ps_envstr;
1658 vsize = pss.ps_nenvstr;
1659 if (vsize > ARG_MAX)
1660 return (ENOEXEC);
1661 size = vsize * sizeof(char *);
1662 break;
1663 case PROC_AUX:
1664 /*
1665 * The aux array is just above env array on the stack. Check
1666 * that the address is naturally aligned.
1667 */
1668 vptr = (vm_offset_t)pss.ps_envstr + (pss.ps_nenvstr + 1)
1669 * sizeof(char *);
1670 #if __ELF_WORD_SIZE == 64
1671 if (vptr % sizeof(uint64_t) != 0)
1672 #else
1673 if (vptr % sizeof(uint32_t) != 0)
1674 #endif
1675 return (ENOEXEC);
1676 /*
1677 * We count the array size reading the aux vectors from the
1678 * stack until AT_NULL vector is returned. So (to keep the code
1679 * simple) we read the process stack twice: the first time here
1680 * to find the size and the second time when copying the vectors
1681 * to the allocated proc_vector.
1682 */
1683 for (ptr = vptr, i = 0; i < PROC_AUXV_MAX; i++) {
1684 if (proc_readmem(td, p, ptr, &aux, sizeof(aux)) !=
1685 sizeof(aux))
1686 return (ENOMEM);
1687 if (aux.a_type == AT_NULL)
1688 break;
1689 ptr += sizeof(aux);
1690 }
1691 /*
1692 * If the PROC_AUXV_MAX entries are iterated over, and we have
1693 * not reached AT_NULL, it is most likely we are reading wrong
1694 * data: either the process doesn't have auxv array or data has
1695 * been modified. Return the error in this case.
1696 */
1697 if (aux.a_type != AT_NULL)
1698 return (ENOEXEC);
1699 vsize = i + 1;
1700 size = vsize * sizeof(aux);
1701 break;
1702 default:
1703 KASSERT(0, ("Wrong proc vector type: %d", type));
1704 return (EINVAL); /* In case we are built without INVARIANTS. */
1705 }
1706 proc_vector = malloc(size, M_TEMP, M_WAITOK);
1707 if (proc_readmem(td, p, vptr, proc_vector, size) != size) {
1708 free(proc_vector, M_TEMP);
1709 return (ENOMEM);
1710 }
1711 *proc_vectorp = proc_vector;
1712 *vsizep = vsize;
1713
1714 return (0);
1715 }
1716
1717 #define GET_PS_STRINGS_CHUNK_SZ 256 /* Chunk size (bytes) for ps_strings operations. */
1718
1719 static int
get_ps_strings(struct thread * td,struct proc * p,struct sbuf * sb,enum proc_vector_type type)1720 get_ps_strings(struct thread *td, struct proc *p, struct sbuf *sb,
1721 enum proc_vector_type type)
1722 {
1723 size_t done, len, nchr, vsize;
1724 int error, i;
1725 char **proc_vector, *sptr;
1726 char pss_string[GET_PS_STRINGS_CHUNK_SZ];
1727
1728 PROC_ASSERT_HELD(p);
1729
1730 /*
1731 * We are not going to read more than 2 * (PATH_MAX + ARG_MAX) bytes.
1732 */
1733 nchr = 2 * (PATH_MAX + ARG_MAX);
1734
1735 error = get_proc_vector(td, p, &proc_vector, &vsize, type);
1736 if (error != 0)
1737 return (error);
1738 for (done = 0, i = 0; i < (int)vsize && done < nchr; i++) {
1739 /*
1740 * The program may have scribbled into its argv array, e.g. to
1741 * remove some arguments. If that has happened, break out
1742 * before trying to read from NULL.
1743 */
1744 if (proc_vector[i] == NULL)
1745 break;
1746 for (sptr = proc_vector[i]; ; sptr += GET_PS_STRINGS_CHUNK_SZ) {
1747 error = proc_read_string(td, p, sptr, pss_string,
1748 sizeof(pss_string));
1749 if (error != 0)
1750 goto done;
1751 len = strnlen(pss_string, GET_PS_STRINGS_CHUNK_SZ);
1752 if (done + len >= nchr)
1753 len = nchr - done - 1;
1754 sbuf_bcat(sb, pss_string, len);
1755 if (len != GET_PS_STRINGS_CHUNK_SZ)
1756 break;
1757 done += GET_PS_STRINGS_CHUNK_SZ;
1758 }
1759 sbuf_bcat(sb, "", 1);
1760 done += len + 1;
1761 }
1762 done:
1763 free(proc_vector, M_TEMP);
1764 return (error);
1765 }
1766
1767 int
proc_getargv(struct thread * td,struct proc * p,struct sbuf * sb)1768 proc_getargv(struct thread *td, struct proc *p, struct sbuf *sb)
1769 {
1770
1771 return (get_ps_strings(curthread, p, sb, PROC_ARG));
1772 }
1773
1774 int
proc_getenvv(struct thread * td,struct proc * p,struct sbuf * sb)1775 proc_getenvv(struct thread *td, struct proc *p, struct sbuf *sb)
1776 {
1777
1778 return (get_ps_strings(curthread, p, sb, PROC_ENV));
1779 }
1780
1781 int
proc_getauxv(struct thread * td,struct proc * p,struct sbuf * sb)1782 proc_getauxv(struct thread *td, struct proc *p, struct sbuf *sb)
1783 {
1784 size_t vsize, size;
1785 char **auxv;
1786 int error;
1787
1788 error = get_proc_vector(td, p, &auxv, &vsize, PROC_AUX);
1789 if (error == 0) {
1790 #ifdef COMPAT_FREEBSD32
1791 if (SV_PROC_FLAG(p, SV_ILP32) != 0)
1792 size = vsize * sizeof(Elf32_Auxinfo);
1793 else
1794 #endif
1795 size = vsize * sizeof(Elf_Auxinfo);
1796 if (sbuf_bcat(sb, auxv, size) != 0)
1797 error = ENOMEM;
1798 free(auxv, M_TEMP);
1799 }
1800 return (error);
1801 }
1802
1803 /*
1804 * This sysctl allows a process to retrieve the argument list or process
1805 * title for another process without groping around in the address space
1806 * of the other process. It also allow a process to set its own "process
1807 * title to a string of its own choice.
1808 */
1809 static int
sysctl_kern_proc_args(SYSCTL_HANDLER_ARGS)1810 sysctl_kern_proc_args(SYSCTL_HANDLER_ARGS)
1811 {
1812 int *name = (int *)arg1;
1813 u_int namelen = arg2;
1814 struct pargs *newpa, *pa;
1815 struct proc *p;
1816 struct sbuf sb;
1817 int flags, error = 0, error2;
1818
1819 if (namelen != 1)
1820 return (EINVAL);
1821
1822 flags = PGET_CANSEE;
1823 if (req->newptr != NULL)
1824 flags |= PGET_ISCURRENT;
1825 error = pget((pid_t)name[0], flags, &p);
1826 if (error)
1827 return (error);
1828
1829 pa = p->p_args;
1830 if (pa != NULL) {
1831 pargs_hold(pa);
1832 PROC_UNLOCK(p);
1833 error = SYSCTL_OUT(req, pa->ar_args, pa->ar_length);
1834 pargs_drop(pa);
1835 } else if ((p->p_flag & (P_WEXIT | P_SYSTEM)) == 0) {
1836 _PHOLD(p);
1837 PROC_UNLOCK(p);
1838 sbuf_new_for_sysctl(&sb, NULL, GET_PS_STRINGS_CHUNK_SZ, req);
1839 sbuf_clear_flags(&sb, SBUF_INCLUDENUL);
1840 error = proc_getargv(curthread, p, &sb);
1841 error2 = sbuf_finish(&sb);
1842 PRELE(p);
1843 sbuf_delete(&sb);
1844 if (error == 0 && error2 != 0)
1845 error = error2;
1846 } else {
1847 PROC_UNLOCK(p);
1848 }
1849 if (error != 0 || req->newptr == NULL)
1850 return (error);
1851
1852 if (req->newlen + sizeof(struct pargs) > ps_arg_cache_limit)
1853 return (ENOMEM);
1854 newpa = pargs_alloc(req->newlen);
1855 error = SYSCTL_IN(req, newpa->ar_args, req->newlen);
1856 if (error != 0) {
1857 pargs_free(newpa);
1858 return (error);
1859 }
1860 PROC_LOCK(p);
1861 pa = p->p_args;
1862 p->p_args = newpa;
1863 PROC_UNLOCK(p);
1864 pargs_drop(pa);
1865 return (0);
1866 }
1867
1868 /*
1869 * This sysctl allows a process to retrieve environment of another process.
1870 */
1871 static int
sysctl_kern_proc_env(SYSCTL_HANDLER_ARGS)1872 sysctl_kern_proc_env(SYSCTL_HANDLER_ARGS)
1873 {
1874 int *name = (int *)arg1;
1875 u_int namelen = arg2;
1876 struct proc *p;
1877 struct sbuf sb;
1878 int error, error2;
1879
1880 if (namelen != 1)
1881 return (EINVAL);
1882
1883 error = pget((pid_t)name[0], PGET_WANTREAD, &p);
1884 if (error != 0)
1885 return (error);
1886 if ((p->p_flag & P_SYSTEM) != 0) {
1887 PRELE(p);
1888 return (0);
1889 }
1890
1891 sbuf_new_for_sysctl(&sb, NULL, GET_PS_STRINGS_CHUNK_SZ, req);
1892 sbuf_clear_flags(&sb, SBUF_INCLUDENUL);
1893 error = proc_getenvv(curthread, p, &sb);
1894 error2 = sbuf_finish(&sb);
1895 PRELE(p);
1896 sbuf_delete(&sb);
1897 return (error != 0 ? error : error2);
1898 }
1899
1900 /*
1901 * This sysctl allows a process to retrieve ELF auxiliary vector of
1902 * another process.
1903 */
1904 static int
sysctl_kern_proc_auxv(SYSCTL_HANDLER_ARGS)1905 sysctl_kern_proc_auxv(SYSCTL_HANDLER_ARGS)
1906 {
1907 int *name = (int *)arg1;
1908 u_int namelen = arg2;
1909 struct proc *p;
1910 struct sbuf sb;
1911 int error, error2;
1912
1913 if (namelen != 1)
1914 return (EINVAL);
1915
1916 error = pget((pid_t)name[0], PGET_WANTREAD, &p);
1917 if (error != 0)
1918 return (error);
1919 if ((p->p_flag & P_SYSTEM) != 0) {
1920 PRELE(p);
1921 return (0);
1922 }
1923 sbuf_new_for_sysctl(&sb, NULL, GET_PS_STRINGS_CHUNK_SZ, req);
1924 sbuf_clear_flags(&sb, SBUF_INCLUDENUL);
1925 error = proc_getauxv(curthread, p, &sb);
1926 error2 = sbuf_finish(&sb);
1927 PRELE(p);
1928 sbuf_delete(&sb);
1929 return (error != 0 ? error : error2);
1930 }
1931
1932 /*
1933 * This sysctl allows a process to retrieve the path of the executable for
1934 * itself or another process.
1935 */
1936 static int
sysctl_kern_proc_pathname(SYSCTL_HANDLER_ARGS)1937 sysctl_kern_proc_pathname(SYSCTL_HANDLER_ARGS)
1938 {
1939 pid_t *pidp = (pid_t *)arg1;
1940 unsigned int arglen = arg2;
1941 struct proc *p;
1942 struct vnode *vp;
1943 char *retbuf, *freebuf;
1944 int error;
1945
1946 if (arglen != 1)
1947 return (EINVAL);
1948 if (*pidp == -1) { /* -1 means this process */
1949 p = req->td->td_proc;
1950 } else {
1951 error = pget(*pidp, PGET_CANSEE, &p);
1952 if (error != 0)
1953 return (error);
1954 }
1955
1956 vp = p->p_textvp;
1957 if (vp == NULL) {
1958 if (*pidp != -1)
1959 PROC_UNLOCK(p);
1960 return (0);
1961 }
1962 vref(vp);
1963 if (*pidp != -1)
1964 PROC_UNLOCK(p);
1965 error = vn_fullpath(req->td, vp, &retbuf, &freebuf);
1966 vrele(vp);
1967 if (error)
1968 return (error);
1969 error = SYSCTL_OUT(req, retbuf, strlen(retbuf) + 1);
1970 free(freebuf, M_TEMP);
1971 return (error);
1972 }
1973
1974 static int
sysctl_kern_proc_sv_name(SYSCTL_HANDLER_ARGS)1975 sysctl_kern_proc_sv_name(SYSCTL_HANDLER_ARGS)
1976 {
1977 struct proc *p;
1978 char *sv_name;
1979 int *name;
1980 int namelen;
1981 int error;
1982
1983 namelen = arg2;
1984 if (namelen != 1)
1985 return (EINVAL);
1986
1987 name = (int *)arg1;
1988 error = pget((pid_t)name[0], PGET_CANSEE, &p);
1989 if (error != 0)
1990 return (error);
1991 sv_name = p->p_sysent->sv_name;
1992 PROC_UNLOCK(p);
1993 return (sysctl_handle_string(oidp, sv_name, 0, req));
1994 }
1995
1996 #ifdef KINFO_OVMENTRY_SIZE
1997 CTASSERT(sizeof(struct kinfo_ovmentry) == KINFO_OVMENTRY_SIZE);
1998 #endif
1999
2000 #ifdef COMPAT_FREEBSD7
2001 static int
sysctl_kern_proc_ovmmap(SYSCTL_HANDLER_ARGS)2002 sysctl_kern_proc_ovmmap(SYSCTL_HANDLER_ARGS)
2003 {
2004 vm_map_entry_t entry, tmp_entry;
2005 unsigned int last_timestamp;
2006 char *fullpath, *freepath;
2007 struct kinfo_ovmentry *kve;
2008 struct vattr va;
2009 struct ucred *cred;
2010 int error, *name;
2011 struct vnode *vp;
2012 struct proc *p;
2013 vm_map_t map;
2014 struct vmspace *vm;
2015
2016 name = (int *)arg1;
2017 error = pget((pid_t)name[0], PGET_WANTREAD, &p);
2018 if (error != 0)
2019 return (error);
2020 vm = vmspace_acquire_ref(p);
2021 if (vm == NULL) {
2022 PRELE(p);
2023 return (ESRCH);
2024 }
2025 kve = malloc(sizeof(*kve), M_TEMP, M_WAITOK);
2026
2027 map = &vm->vm_map;
2028 vm_map_lock_read(map);
2029 for (entry = map->header.next; entry != &map->header;
2030 entry = entry->next) {
2031 vm_object_t obj, tobj, lobj;
2032 vm_offset_t addr;
2033
2034 if (entry->eflags & MAP_ENTRY_IS_SUB_MAP)
2035 continue;
2036
2037 bzero(kve, sizeof(*kve));
2038 kve->kve_structsize = sizeof(*kve);
2039
2040 kve->kve_private_resident = 0;
2041 obj = entry->object.vm_object;
2042 if (obj != NULL) {
2043 VM_OBJECT_RLOCK(obj);
2044 if (obj->shadow_count == 1)
2045 kve->kve_private_resident =
2046 obj->resident_page_count;
2047 }
2048 kve->kve_resident = 0;
2049 addr = entry->start;
2050 while (addr < entry->end) {
2051 if (pmap_extract(map->pmap, addr))
2052 kve->kve_resident++;
2053 addr += PAGE_SIZE;
2054 }
2055
2056 for (lobj = tobj = obj; tobj; tobj = tobj->backing_object) {
2057 if (tobj != obj)
2058 VM_OBJECT_RLOCK(tobj);
2059 if (lobj != obj)
2060 VM_OBJECT_RUNLOCK(lobj);
2061 lobj = tobj;
2062 }
2063
2064 kve->kve_start = (void*)entry->start;
2065 kve->kve_end = (void*)entry->end;
2066 kve->kve_offset = (off_t)entry->offset;
2067
2068 if (entry->protection & VM_PROT_READ)
2069 kve->kve_protection |= KVME_PROT_READ;
2070 if (entry->protection & VM_PROT_WRITE)
2071 kve->kve_protection |= KVME_PROT_WRITE;
2072 if (entry->protection & VM_PROT_EXECUTE)
2073 kve->kve_protection |= KVME_PROT_EXEC;
2074
2075 if (entry->eflags & MAP_ENTRY_COW)
2076 kve->kve_flags |= KVME_FLAG_COW;
2077 if (entry->eflags & MAP_ENTRY_NEEDS_COPY)
2078 kve->kve_flags |= KVME_FLAG_NEEDS_COPY;
2079 if (entry->eflags & MAP_ENTRY_NOCOREDUMP)
2080 kve->kve_flags |= KVME_FLAG_NOCOREDUMP;
2081
2082 last_timestamp = map->timestamp;
2083 vm_map_unlock_read(map);
2084
2085 kve->kve_fileid = 0;
2086 kve->kve_fsid = 0;
2087 freepath = NULL;
2088 fullpath = "";
2089 if (lobj) {
2090 vp = NULL;
2091 switch (lobj->type) {
2092 case OBJT_DEFAULT:
2093 kve->kve_type = KVME_TYPE_DEFAULT;
2094 break;
2095 case OBJT_VNODE:
2096 kve->kve_type = KVME_TYPE_VNODE;
2097 vp = lobj->handle;
2098 vref(vp);
2099 break;
2100 case OBJT_SWAP:
2101 if ((lobj->flags & OBJ_TMPFS_NODE) != 0) {
2102 kve->kve_type = KVME_TYPE_VNODE;
2103 if ((lobj->flags & OBJ_TMPFS) != 0) {
2104 vp = lobj->un_pager.swp.swp_tmpfs;
2105 vref(vp);
2106 }
2107 } else {
2108 kve->kve_type = KVME_TYPE_SWAP;
2109 }
2110 break;
2111 case OBJT_DEVICE:
2112 kve->kve_type = KVME_TYPE_DEVICE;
2113 break;
2114 case OBJT_PHYS:
2115 kve->kve_type = KVME_TYPE_PHYS;
2116 break;
2117 case OBJT_DEAD:
2118 kve->kve_type = KVME_TYPE_DEAD;
2119 break;
2120 case OBJT_SG:
2121 kve->kve_type = KVME_TYPE_SG;
2122 break;
2123 default:
2124 kve->kve_type = KVME_TYPE_UNKNOWN;
2125 break;
2126 }
2127 if (lobj != obj)
2128 VM_OBJECT_RUNLOCK(lobj);
2129
2130 kve->kve_ref_count = obj->ref_count;
2131 kve->kve_shadow_count = obj->shadow_count;
2132 VM_OBJECT_RUNLOCK(obj);
2133 if (vp != NULL) {
2134 vn_fullpath(curthread, vp, &fullpath,
2135 &freepath);
2136 cred = curthread->td_ucred;
2137 vn_lock(vp, LK_SHARED | LK_RETRY);
2138 if (VOP_GETATTR(vp, &va, cred) == 0) {
2139 kve->kve_fileid = va.va_fileid;
2140 kve->kve_fsid = va.va_fsid;
2141 }
2142 vput(vp);
2143 }
2144 } else {
2145 kve->kve_type = KVME_TYPE_NONE;
2146 kve->kve_ref_count = 0;
2147 kve->kve_shadow_count = 0;
2148 }
2149
2150 strlcpy(kve->kve_path, fullpath, sizeof(kve->kve_path));
2151 if (freepath != NULL)
2152 free(freepath, M_TEMP);
2153
2154 error = SYSCTL_OUT(req, kve, sizeof(*kve));
2155 vm_map_lock_read(map);
2156 if (error)
2157 break;
2158 if (last_timestamp != map->timestamp) {
2159 vm_map_lookup_entry(map, addr - 1, &tmp_entry);
2160 entry = tmp_entry;
2161 }
2162 }
2163 vm_map_unlock_read(map);
2164 vmspace_free(vm);
2165 PRELE(p);
2166 free(kve, M_TEMP);
2167 return (error);
2168 }
2169 #endif /* COMPAT_FREEBSD7 */
2170
2171 #ifdef KINFO_VMENTRY_SIZE
2172 CTASSERT(sizeof(struct kinfo_vmentry) == KINFO_VMENTRY_SIZE);
2173 #endif
2174
2175 static void
kern_proc_vmmap_resident(vm_map_t map,vm_map_entry_t entry,struct kinfo_vmentry * kve)2176 kern_proc_vmmap_resident(vm_map_t map, vm_map_entry_t entry,
2177 struct kinfo_vmentry *kve)
2178 {
2179 vm_object_t obj, tobj;
2180 vm_page_t m, m_adv;
2181 vm_offset_t addr;
2182 vm_paddr_t locked_pa;
2183 vm_pindex_t pi, pi_adv, pindex;
2184
2185 locked_pa = 0;
2186 obj = entry->object.vm_object;
2187 addr = entry->start;
2188 m_adv = NULL;
2189 pi = OFF_TO_IDX(entry->offset);
2190 for (; addr < entry->end; addr += IDX_TO_OFF(pi_adv), pi += pi_adv) {
2191 if (m_adv != NULL) {
2192 m = m_adv;
2193 } else {
2194 pi_adv = OFF_TO_IDX(entry->end - addr);
2195 pindex = pi;
2196 for (tobj = obj;; tobj = tobj->backing_object) {
2197 m = vm_page_find_least(tobj, pindex);
2198 if (m != NULL) {
2199 if (m->pindex == pindex)
2200 break;
2201 if (pi_adv > m->pindex - pindex) {
2202 pi_adv = m->pindex - pindex;
2203 m_adv = m;
2204 }
2205 }
2206 if (tobj->backing_object == NULL)
2207 goto next;
2208 pindex += OFF_TO_IDX(tobj->
2209 backing_object_offset);
2210 }
2211 }
2212 m_adv = NULL;
2213 if (m->psind != 0 && addr + pagesizes[1] <= entry->end &&
2214 (addr & (pagesizes[1] - 1)) == 0 &&
2215 (pmap_mincore(map->pmap, addr, &locked_pa) &
2216 MINCORE_SUPER) != 0) {
2217 kve->kve_flags |= KVME_FLAG_SUPER;
2218 pi_adv = OFF_TO_IDX(pagesizes[1]);
2219 } else {
2220 /*
2221 * We do not test the found page on validity.
2222 * Either the page is busy and being paged in,
2223 * or it was invalidated. The first case
2224 * should be counted as resident, the second
2225 * is not so clear; we do account both.
2226 */
2227 pi_adv = 1;
2228 }
2229 kve->kve_resident += pi_adv;
2230 next:;
2231 }
2232 PA_UNLOCK_COND(locked_pa);
2233 }
2234
2235 /*
2236 * Must be called with the process locked and will return unlocked.
2237 */
2238 int
kern_proc_vmmap_out(struct proc * p,struct sbuf * sb,ssize_t maxlen,int flags)2239 kern_proc_vmmap_out(struct proc *p, struct sbuf *sb, ssize_t maxlen, int flags)
2240 {
2241 vm_map_entry_t entry, tmp_entry;
2242 struct vattr va;
2243 vm_map_t map;
2244 vm_object_t obj, tobj, lobj;
2245 char *fullpath, *freepath;
2246 struct kinfo_vmentry *kve;
2247 struct ucred *cred;
2248 struct vnode *vp;
2249 struct vmspace *vm;
2250 vm_offset_t addr;
2251 unsigned int last_timestamp;
2252 int error;
2253
2254 PROC_LOCK_ASSERT(p, MA_OWNED);
2255
2256 _PHOLD(p);
2257 PROC_UNLOCK(p);
2258 vm = vmspace_acquire_ref(p);
2259 if (vm == NULL) {
2260 PRELE(p);
2261 return (ESRCH);
2262 }
2263 kve = malloc(sizeof(*kve), M_TEMP, M_WAITOK | M_ZERO);
2264
2265 error = 0;
2266 map = &vm->vm_map;
2267 vm_map_lock_read(map);
2268 for (entry = map->header.next; entry != &map->header;
2269 entry = entry->next) {
2270 if (entry->eflags & MAP_ENTRY_IS_SUB_MAP)
2271 continue;
2272
2273 addr = entry->end;
2274 bzero(kve, sizeof(*kve));
2275 obj = entry->object.vm_object;
2276 if (obj != NULL) {
2277 for (tobj = obj; tobj != NULL;
2278 tobj = tobj->backing_object) {
2279 VM_OBJECT_RLOCK(tobj);
2280 lobj = tobj;
2281 }
2282 if (obj->backing_object == NULL)
2283 kve->kve_private_resident =
2284 obj->resident_page_count;
2285 if (!vmmap_skip_res_cnt)
2286 kern_proc_vmmap_resident(map, entry, kve);
2287 for (tobj = obj; tobj != NULL;
2288 tobj = tobj->backing_object) {
2289 if (tobj != obj && tobj != lobj)
2290 VM_OBJECT_RUNLOCK(tobj);
2291 }
2292 } else {
2293 lobj = NULL;
2294 }
2295
2296 kve->kve_start = entry->start;
2297 kve->kve_end = entry->end;
2298 kve->kve_offset = entry->offset;
2299
2300 if (entry->protection & VM_PROT_READ)
2301 kve->kve_protection |= KVME_PROT_READ;
2302 if (entry->protection & VM_PROT_WRITE)
2303 kve->kve_protection |= KVME_PROT_WRITE;
2304 if (entry->protection & VM_PROT_EXECUTE)
2305 kve->kve_protection |= KVME_PROT_EXEC;
2306
2307 if (entry->eflags & MAP_ENTRY_COW)
2308 kve->kve_flags |= KVME_FLAG_COW;
2309 if (entry->eflags & MAP_ENTRY_NEEDS_COPY)
2310 kve->kve_flags |= KVME_FLAG_NEEDS_COPY;
2311 if (entry->eflags & MAP_ENTRY_NOCOREDUMP)
2312 kve->kve_flags |= KVME_FLAG_NOCOREDUMP;
2313 if (entry->eflags & MAP_ENTRY_GROWS_UP)
2314 kve->kve_flags |= KVME_FLAG_GROWS_UP;
2315 if (entry->eflags & MAP_ENTRY_GROWS_DOWN)
2316 kve->kve_flags |= KVME_FLAG_GROWS_DOWN;
2317
2318 last_timestamp = map->timestamp;
2319 vm_map_unlock_read(map);
2320
2321 freepath = NULL;
2322 fullpath = "";
2323 if (lobj != NULL) {
2324 vp = NULL;
2325 switch (lobj->type) {
2326 case OBJT_DEFAULT:
2327 kve->kve_type = KVME_TYPE_DEFAULT;
2328 break;
2329 case OBJT_VNODE:
2330 kve->kve_type = KVME_TYPE_VNODE;
2331 vp = lobj->handle;
2332 vref(vp);
2333 break;
2334 case OBJT_SWAP:
2335 if ((lobj->flags & OBJ_TMPFS_NODE) != 0) {
2336 kve->kve_type = KVME_TYPE_VNODE;
2337 if ((lobj->flags & OBJ_TMPFS) != 0) {
2338 vp = lobj->un_pager.swp.swp_tmpfs;
2339 vref(vp);
2340 }
2341 } else {
2342 kve->kve_type = KVME_TYPE_SWAP;
2343 }
2344 break;
2345 case OBJT_DEVICE:
2346 kve->kve_type = KVME_TYPE_DEVICE;
2347 break;
2348 case OBJT_PHYS:
2349 kve->kve_type = KVME_TYPE_PHYS;
2350 break;
2351 case OBJT_DEAD:
2352 kve->kve_type = KVME_TYPE_DEAD;
2353 break;
2354 case OBJT_SG:
2355 kve->kve_type = KVME_TYPE_SG;
2356 break;
2357 case OBJT_MGTDEVICE:
2358 kve->kve_type = KVME_TYPE_MGTDEVICE;
2359 break;
2360 default:
2361 kve->kve_type = KVME_TYPE_UNKNOWN;
2362 break;
2363 }
2364 if (lobj != obj)
2365 VM_OBJECT_RUNLOCK(lobj);
2366
2367 kve->kve_ref_count = obj->ref_count;
2368 kve->kve_shadow_count = obj->shadow_count;
2369 VM_OBJECT_RUNLOCK(obj);
2370 if (vp != NULL) {
2371 vn_fullpath(curthread, vp, &fullpath,
2372 &freepath);
2373 kve->kve_vn_type = vntype_to_kinfo(vp->v_type);
2374 cred = curthread->td_ucred;
2375 vn_lock(vp, LK_SHARED | LK_RETRY);
2376 if (VOP_GETATTR(vp, &va, cred) == 0) {
2377 kve->kve_vn_fileid = va.va_fileid;
2378 kve->kve_vn_fsid = va.va_fsid;
2379 kve->kve_vn_mode =
2380 MAKEIMODE(va.va_type, va.va_mode);
2381 kve->kve_vn_size = va.va_size;
2382 kve->kve_vn_rdev = va.va_rdev;
2383 kve->kve_status = KF_ATTR_VALID;
2384 }
2385 vput(vp);
2386 }
2387 } else {
2388 kve->kve_type = KVME_TYPE_NONE;
2389 kve->kve_ref_count = 0;
2390 kve->kve_shadow_count = 0;
2391 }
2392
2393 strlcpy(kve->kve_path, fullpath, sizeof(kve->kve_path));
2394 if (freepath != NULL)
2395 free(freepath, M_TEMP);
2396
2397 /* Pack record size down */
2398 if ((flags & KERN_VMMAP_PACK_KINFO) != 0)
2399 kve->kve_structsize =
2400 offsetof(struct kinfo_vmentry, kve_path) +
2401 strlen(kve->kve_path) + 1;
2402 else
2403 kve->kve_structsize = sizeof(*kve);
2404 kve->kve_structsize = roundup(kve->kve_structsize,
2405 sizeof(uint64_t));
2406
2407 /* Halt filling and truncate rather than exceeding maxlen */
2408 if (maxlen != -1 && maxlen < kve->kve_structsize) {
2409 error = 0;
2410 vm_map_lock_read(map);
2411 break;
2412 } else if (maxlen != -1)
2413 maxlen -= kve->kve_structsize;
2414
2415 if (sbuf_bcat(sb, kve, kve->kve_structsize) != 0)
2416 error = ENOMEM;
2417 vm_map_lock_read(map);
2418 if (error != 0)
2419 break;
2420 if (last_timestamp != map->timestamp) {
2421 vm_map_lookup_entry(map, addr - 1, &tmp_entry);
2422 entry = tmp_entry;
2423 }
2424 }
2425 vm_map_unlock_read(map);
2426 vmspace_free(vm);
2427 PRELE(p);
2428 free(kve, M_TEMP);
2429 return (error);
2430 }
2431
2432 static int
sysctl_kern_proc_vmmap(SYSCTL_HANDLER_ARGS)2433 sysctl_kern_proc_vmmap(SYSCTL_HANDLER_ARGS)
2434 {
2435 struct proc *p;
2436 struct sbuf sb;
2437 int error, error2, *name;
2438
2439 name = (int *)arg1;
2440 sbuf_new_for_sysctl(&sb, NULL, sizeof(struct kinfo_vmentry), req);
2441 sbuf_clear_flags(&sb, SBUF_INCLUDENUL);
2442 error = pget((pid_t)name[0], PGET_CANDEBUG | PGET_NOTWEXIT, &p);
2443 if (error != 0) {
2444 sbuf_delete(&sb);
2445 return (error);
2446 }
2447 error = kern_proc_vmmap_out(p, &sb, -1, KERN_VMMAP_PACK_KINFO);
2448 error2 = sbuf_finish(&sb);
2449 sbuf_delete(&sb);
2450 return (error != 0 ? error : error2);
2451 }
2452
2453 #if defined(STACK) || defined(DDB)
2454 static int
sysctl_kern_proc_kstack(SYSCTL_HANDLER_ARGS)2455 sysctl_kern_proc_kstack(SYSCTL_HANDLER_ARGS)
2456 {
2457 struct kinfo_kstack *kkstp;
2458 int error, i, *name, numthreads;
2459 lwpid_t *lwpidarray;
2460 struct thread *td;
2461 struct stack *st;
2462 struct sbuf sb;
2463 struct proc *p;
2464
2465 name = (int *)arg1;
2466 error = pget((pid_t)name[0], PGET_NOTINEXEC | PGET_WANTREAD, &p);
2467 if (error != 0)
2468 return (error);
2469
2470 kkstp = malloc(sizeof(*kkstp), M_TEMP, M_WAITOK);
2471 st = stack_create();
2472
2473 lwpidarray = NULL;
2474 numthreads = 0;
2475 PROC_LOCK(p);
2476 repeat:
2477 if (numthreads < p->p_numthreads) {
2478 if (lwpidarray != NULL) {
2479 free(lwpidarray, M_TEMP);
2480 lwpidarray = NULL;
2481 }
2482 numthreads = p->p_numthreads;
2483 PROC_UNLOCK(p);
2484 lwpidarray = malloc(sizeof(*lwpidarray) * numthreads, M_TEMP,
2485 M_WAITOK | M_ZERO);
2486 PROC_LOCK(p);
2487 goto repeat;
2488 }
2489 i = 0;
2490
2491 /*
2492 * XXXRW: During the below loop, execve(2) and countless other sorts
2493 * of changes could have taken place. Should we check to see if the
2494 * vmspace has been replaced, or the like, in order to prevent
2495 * giving a snapshot that spans, say, execve(2), with some threads
2496 * before and some after? Among other things, the credentials could
2497 * have changed, in which case the right to extract debug info might
2498 * no longer be assured.
2499 */
2500 FOREACH_THREAD_IN_PROC(p, td) {
2501 KASSERT(i < numthreads,
2502 ("sysctl_kern_proc_kstack: numthreads"));
2503 lwpidarray[i] = td->td_tid;
2504 i++;
2505 }
2506 numthreads = i;
2507 for (i = 0; i < numthreads; i++) {
2508 td = thread_find(p, lwpidarray[i]);
2509 if (td == NULL) {
2510 continue;
2511 }
2512 bzero(kkstp, sizeof(*kkstp));
2513 (void)sbuf_new(&sb, kkstp->kkst_trace,
2514 sizeof(kkstp->kkst_trace), SBUF_FIXEDLEN);
2515 thread_lock(td);
2516 kkstp->kkst_tid = td->td_tid;
2517 if (TD_IS_SWAPPED(td)) {
2518 kkstp->kkst_state = KKST_STATE_SWAPPED;
2519 } else if (TD_IS_RUNNING(td)) {
2520 if (stack_save_td_running(st, td) == 0)
2521 kkstp->kkst_state = KKST_STATE_STACKOK;
2522 else
2523 kkstp->kkst_state = KKST_STATE_RUNNING;
2524 } else {
2525 kkstp->kkst_state = KKST_STATE_STACKOK;
2526 stack_save_td(st, td);
2527 }
2528 thread_unlock(td);
2529 PROC_UNLOCK(p);
2530 stack_sbuf_print(&sb, st);
2531 sbuf_finish(&sb);
2532 sbuf_delete(&sb);
2533 error = SYSCTL_OUT(req, kkstp, sizeof(*kkstp));
2534 PROC_LOCK(p);
2535 if (error)
2536 break;
2537 }
2538 _PRELE(p);
2539 PROC_UNLOCK(p);
2540 if (lwpidarray != NULL)
2541 free(lwpidarray, M_TEMP);
2542 stack_destroy(st);
2543 free(kkstp, M_TEMP);
2544 return (error);
2545 }
2546 #endif
2547
2548 /*
2549 * This sysctl allows a process to retrieve the full list of groups from
2550 * itself or another process.
2551 */
2552 static int
sysctl_kern_proc_groups(SYSCTL_HANDLER_ARGS)2553 sysctl_kern_proc_groups(SYSCTL_HANDLER_ARGS)
2554 {
2555 pid_t *pidp = (pid_t *)arg1;
2556 unsigned int arglen = arg2;
2557 struct proc *p;
2558 struct ucred *cred;
2559 int error;
2560
2561 if (arglen != 1)
2562 return (EINVAL);
2563 if (*pidp == -1) { /* -1 means this process */
2564 p = req->td->td_proc;
2565 PROC_LOCK(p);
2566 } else {
2567 error = pget(*pidp, PGET_CANSEE, &p);
2568 if (error != 0)
2569 return (error);
2570 }
2571
2572 cred = crhold(p->p_ucred);
2573 PROC_UNLOCK(p);
2574
2575 error = SYSCTL_OUT(req, cred->cr_groups,
2576 cred->cr_ngroups * sizeof(gid_t));
2577 crfree(cred);
2578 return (error);
2579 }
2580
2581 /*
2582 * This sysctl allows a process to retrieve or/and set the resource limit for
2583 * another process.
2584 */
2585 static int
sysctl_kern_proc_rlimit(SYSCTL_HANDLER_ARGS)2586 sysctl_kern_proc_rlimit(SYSCTL_HANDLER_ARGS)
2587 {
2588 int *name = (int *)arg1;
2589 u_int namelen = arg2;
2590 struct rlimit rlim;
2591 struct proc *p;
2592 u_int which;
2593 int flags, error;
2594
2595 if (namelen != 2)
2596 return (EINVAL);
2597
2598 which = (u_int)name[1];
2599 if (which >= RLIM_NLIMITS)
2600 return (EINVAL);
2601
2602 if (req->newptr != NULL && req->newlen != sizeof(rlim))
2603 return (EINVAL);
2604
2605 flags = PGET_HOLD | PGET_NOTWEXIT;
2606 if (req->newptr != NULL)
2607 flags |= PGET_CANDEBUG;
2608 else
2609 flags |= PGET_CANSEE;
2610 error = pget((pid_t)name[0], flags, &p);
2611 if (error != 0)
2612 return (error);
2613
2614 /*
2615 * Retrieve limit.
2616 */
2617 if (req->oldptr != NULL) {
2618 PROC_LOCK(p);
2619 lim_rlimit_proc(p, which, &rlim);
2620 PROC_UNLOCK(p);
2621 }
2622 error = SYSCTL_OUT(req, &rlim, sizeof(rlim));
2623 if (error != 0)
2624 goto errout;
2625
2626 /*
2627 * Set limit.
2628 */
2629 if (req->newptr != NULL) {
2630 error = SYSCTL_IN(req, &rlim, sizeof(rlim));
2631 if (error == 0)
2632 error = kern_proc_setrlimit(curthread, p, which, &rlim);
2633 }
2634
2635 errout:
2636 PRELE(p);
2637 return (error);
2638 }
2639
2640 /*
2641 * This sysctl allows a process to retrieve ps_strings structure location of
2642 * another process.
2643 */
2644 static int
sysctl_kern_proc_ps_strings(SYSCTL_HANDLER_ARGS)2645 sysctl_kern_proc_ps_strings(SYSCTL_HANDLER_ARGS)
2646 {
2647 int *name = (int *)arg1;
2648 u_int namelen = arg2;
2649 struct proc *p;
2650 vm_offset_t ps_strings;
2651 int error;
2652 #ifdef COMPAT_FREEBSD32
2653 uint32_t ps_strings32;
2654 #endif
2655
2656 if (namelen != 1)
2657 return (EINVAL);
2658
2659 error = pget((pid_t)name[0], PGET_CANDEBUG, &p);
2660 if (error != 0)
2661 return (error);
2662 #ifdef COMPAT_FREEBSD32
2663 if ((req->flags & SCTL_MASK32) != 0) {
2664 /*
2665 * We return 0 if the 32 bit emulation request is for a 64 bit
2666 * process.
2667 */
2668 ps_strings32 = SV_PROC_FLAG(p, SV_ILP32) != 0 ?
2669 PTROUT(p->p_sysent->sv_psstrings) : 0;
2670 PROC_UNLOCK(p);
2671 error = SYSCTL_OUT(req, &ps_strings32, sizeof(ps_strings32));
2672 return (error);
2673 }
2674 #endif
2675 ps_strings = p->p_sysent->sv_psstrings;
2676 PROC_UNLOCK(p);
2677 error = SYSCTL_OUT(req, &ps_strings, sizeof(ps_strings));
2678 return (error);
2679 }
2680
2681 /*
2682 * This sysctl allows a process to retrieve umask of another process.
2683 */
2684 static int
sysctl_kern_proc_umask(SYSCTL_HANDLER_ARGS)2685 sysctl_kern_proc_umask(SYSCTL_HANDLER_ARGS)
2686 {
2687 int *name = (int *)arg1;
2688 u_int namelen = arg2;
2689 struct proc *p;
2690 int error;
2691 u_short fd_cmask;
2692
2693 if (namelen != 1)
2694 return (EINVAL);
2695
2696 error = pget((pid_t)name[0], PGET_WANTREAD, &p);
2697 if (error != 0)
2698 return (error);
2699
2700 FILEDESC_SLOCK(p->p_fd);
2701 fd_cmask = p->p_fd->fd_cmask;
2702 FILEDESC_SUNLOCK(p->p_fd);
2703 PRELE(p);
2704 error = SYSCTL_OUT(req, &fd_cmask, sizeof(fd_cmask));
2705 return (error);
2706 }
2707
2708 /*
2709 * This sysctl allows a process to set and retrieve binary osreldate of
2710 * another process.
2711 */
2712 static int
sysctl_kern_proc_osrel(SYSCTL_HANDLER_ARGS)2713 sysctl_kern_proc_osrel(SYSCTL_HANDLER_ARGS)
2714 {
2715 int *name = (int *)arg1;
2716 u_int namelen = arg2;
2717 struct proc *p;
2718 int flags, error, osrel;
2719
2720 if (namelen != 1)
2721 return (EINVAL);
2722
2723 if (req->newptr != NULL && req->newlen != sizeof(osrel))
2724 return (EINVAL);
2725
2726 flags = PGET_HOLD | PGET_NOTWEXIT;
2727 if (req->newptr != NULL)
2728 flags |= PGET_CANDEBUG;
2729 else
2730 flags |= PGET_CANSEE;
2731 error = pget((pid_t)name[0], flags, &p);
2732 if (error != 0)
2733 return (error);
2734
2735 error = SYSCTL_OUT(req, &p->p_osrel, sizeof(p->p_osrel));
2736 if (error != 0)
2737 goto errout;
2738
2739 if (req->newptr != NULL) {
2740 error = SYSCTL_IN(req, &osrel, sizeof(osrel));
2741 if (error != 0)
2742 goto errout;
2743 if (osrel < 0) {
2744 error = EINVAL;
2745 goto errout;
2746 }
2747 p->p_osrel = osrel;
2748 }
2749 errout:
2750 PRELE(p);
2751 return (error);
2752 }
2753
2754 static int
sysctl_kern_proc_sigtramp(SYSCTL_HANDLER_ARGS)2755 sysctl_kern_proc_sigtramp(SYSCTL_HANDLER_ARGS)
2756 {
2757 int *name = (int *)arg1;
2758 u_int namelen = arg2;
2759 struct proc *p;
2760 struct kinfo_sigtramp kst;
2761 const struct sysentvec *sv;
2762 int error;
2763 #ifdef COMPAT_FREEBSD32
2764 struct kinfo_sigtramp32 kst32;
2765 #endif
2766
2767 if (namelen != 1)
2768 return (EINVAL);
2769
2770 error = pget((pid_t)name[0], PGET_CANDEBUG, &p);
2771 if (error != 0)
2772 return (error);
2773 sv = p->p_sysent;
2774 #ifdef COMPAT_FREEBSD32
2775 if ((req->flags & SCTL_MASK32) != 0) {
2776 bzero(&kst32, sizeof(kst32));
2777 if (SV_PROC_FLAG(p, SV_ILP32)) {
2778 if (sv->sv_sigcode_base != 0) {
2779 kst32.ksigtramp_start = sv->sv_sigcode_base;
2780 kst32.ksigtramp_end = sv->sv_sigcode_base +
2781 *sv->sv_szsigcode;
2782 } else {
2783 kst32.ksigtramp_start = sv->sv_psstrings -
2784 *sv->sv_szsigcode;
2785 kst32.ksigtramp_end = sv->sv_psstrings;
2786 }
2787 }
2788 PROC_UNLOCK(p);
2789 error = SYSCTL_OUT(req, &kst32, sizeof(kst32));
2790 return (error);
2791 }
2792 #endif
2793 bzero(&kst, sizeof(kst));
2794 if (sv->sv_sigcode_base != 0) {
2795 kst.ksigtramp_start = (char *)sv->sv_sigcode_base;
2796 kst.ksigtramp_end = (char *)sv->sv_sigcode_base +
2797 *sv->sv_szsigcode;
2798 } else {
2799 kst.ksigtramp_start = (char *)sv->sv_psstrings -
2800 *sv->sv_szsigcode;
2801 kst.ksigtramp_end = (char *)sv->sv_psstrings;
2802 }
2803 PROC_UNLOCK(p);
2804 error = SYSCTL_OUT(req, &kst, sizeof(kst));
2805 return (error);
2806 }
2807
2808 SYSCTL_NODE(_kern, KERN_PROC, proc, CTLFLAG_RD, 0, "Process table");
2809
2810 SYSCTL_PROC(_kern_proc, KERN_PROC_ALL, all, CTLFLAG_RD|CTLTYPE_STRUCT|
2811 CTLFLAG_MPSAFE, 0, 0, sysctl_kern_proc, "S,proc",
2812 "Return entire process table");
2813
2814 static SYSCTL_NODE(_kern_proc, KERN_PROC_GID, gid, CTLFLAG_RD | CTLFLAG_MPSAFE,
2815 sysctl_kern_proc, "Process table");
2816
2817 static SYSCTL_NODE(_kern_proc, KERN_PROC_PGRP, pgrp, CTLFLAG_RD | CTLFLAG_MPSAFE,
2818 sysctl_kern_proc, "Process table");
2819
2820 static SYSCTL_NODE(_kern_proc, KERN_PROC_RGID, rgid, CTLFLAG_RD | CTLFLAG_MPSAFE,
2821 sysctl_kern_proc, "Process table");
2822
2823 static SYSCTL_NODE(_kern_proc, KERN_PROC_SESSION, sid, CTLFLAG_RD |
2824 CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2825
2826 static SYSCTL_NODE(_kern_proc, KERN_PROC_TTY, tty, CTLFLAG_RD | CTLFLAG_MPSAFE,
2827 sysctl_kern_proc, "Process table");
2828
2829 static SYSCTL_NODE(_kern_proc, KERN_PROC_UID, uid, CTLFLAG_RD | CTLFLAG_MPSAFE,
2830 sysctl_kern_proc, "Process table");
2831
2832 static SYSCTL_NODE(_kern_proc, KERN_PROC_RUID, ruid, CTLFLAG_RD | CTLFLAG_MPSAFE,
2833 sysctl_kern_proc, "Process table");
2834
2835 static SYSCTL_NODE(_kern_proc, KERN_PROC_PID, pid, CTLFLAG_RD | CTLFLAG_MPSAFE,
2836 sysctl_kern_proc, "Process table");
2837
2838 static SYSCTL_NODE(_kern_proc, KERN_PROC_PROC, proc, CTLFLAG_RD | CTLFLAG_MPSAFE,
2839 sysctl_kern_proc, "Return process table, no threads");
2840
2841 static SYSCTL_NODE(_kern_proc, KERN_PROC_ARGS, args,
2842 CTLFLAG_RW | CTLFLAG_CAPWR | CTLFLAG_ANYBODY | CTLFLAG_MPSAFE,
2843 sysctl_kern_proc_args, "Process argument list");
2844
2845 static SYSCTL_NODE(_kern_proc, KERN_PROC_ENV, env, CTLFLAG_RD | CTLFLAG_MPSAFE,
2846 sysctl_kern_proc_env, "Process environment");
2847
2848 static SYSCTL_NODE(_kern_proc, KERN_PROC_AUXV, auxv, CTLFLAG_RD |
2849 CTLFLAG_MPSAFE, sysctl_kern_proc_auxv, "Process ELF auxiliary vector");
2850
2851 static SYSCTL_NODE(_kern_proc, KERN_PROC_PATHNAME, pathname, CTLFLAG_RD |
2852 CTLFLAG_MPSAFE, sysctl_kern_proc_pathname, "Process executable path");
2853
2854 static SYSCTL_NODE(_kern_proc, KERN_PROC_SV_NAME, sv_name, CTLFLAG_RD |
2855 CTLFLAG_MPSAFE, sysctl_kern_proc_sv_name,
2856 "Process syscall vector name (ABI type)");
2857
2858 static SYSCTL_NODE(_kern_proc, (KERN_PROC_GID | KERN_PROC_INC_THREAD), gid_td,
2859 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2860
2861 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PGRP | KERN_PROC_INC_THREAD), pgrp_td,
2862 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2863
2864 static SYSCTL_NODE(_kern_proc, (KERN_PROC_RGID | KERN_PROC_INC_THREAD), rgid_td,
2865 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2866
2867 static SYSCTL_NODE(_kern_proc, (KERN_PROC_SESSION | KERN_PROC_INC_THREAD),
2868 sid_td, CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2869
2870 static SYSCTL_NODE(_kern_proc, (KERN_PROC_TTY | KERN_PROC_INC_THREAD), tty_td,
2871 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2872
2873 static SYSCTL_NODE(_kern_proc, (KERN_PROC_UID | KERN_PROC_INC_THREAD), uid_td,
2874 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2875
2876 static SYSCTL_NODE(_kern_proc, (KERN_PROC_RUID | KERN_PROC_INC_THREAD), ruid_td,
2877 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2878
2879 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PID | KERN_PROC_INC_THREAD), pid_td,
2880 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc, "Process table");
2881
2882 static SYSCTL_NODE(_kern_proc, (KERN_PROC_PROC | KERN_PROC_INC_THREAD), proc_td,
2883 CTLFLAG_RD | CTLFLAG_MPSAFE, sysctl_kern_proc,
2884 "Return process table, no threads");
2885
2886 #ifdef COMPAT_FREEBSD7
2887 static SYSCTL_NODE(_kern_proc, KERN_PROC_OVMMAP, ovmmap, CTLFLAG_RD |
2888 CTLFLAG_MPSAFE, sysctl_kern_proc_ovmmap, "Old Process vm map entries");
2889 #endif
2890
2891 static SYSCTL_NODE(_kern_proc, KERN_PROC_VMMAP, vmmap, CTLFLAG_RD |
2892 CTLFLAG_MPSAFE, sysctl_kern_proc_vmmap, "Process vm map entries");
2893
2894 #if defined(STACK) || defined(DDB)
2895 static SYSCTL_NODE(_kern_proc, KERN_PROC_KSTACK, kstack, CTLFLAG_RD |
2896 CTLFLAG_MPSAFE, sysctl_kern_proc_kstack, "Process kernel stacks");
2897 #endif
2898
2899 static SYSCTL_NODE(_kern_proc, KERN_PROC_GROUPS, groups, CTLFLAG_RD |
2900 CTLFLAG_MPSAFE, sysctl_kern_proc_groups, "Process groups");
2901
2902 static SYSCTL_NODE(_kern_proc, KERN_PROC_RLIMIT, rlimit, CTLFLAG_RW |
2903 CTLFLAG_ANYBODY | CTLFLAG_MPSAFE, sysctl_kern_proc_rlimit,
2904 "Process resource limits");
2905
2906 static SYSCTL_NODE(_kern_proc, KERN_PROC_PS_STRINGS, ps_strings, CTLFLAG_RD |
2907 CTLFLAG_MPSAFE, sysctl_kern_proc_ps_strings,
2908 "Process ps_strings location");
2909
2910 static SYSCTL_NODE(_kern_proc, KERN_PROC_UMASK, umask, CTLFLAG_RD |
2911 CTLFLAG_MPSAFE, sysctl_kern_proc_umask, "Process umask");
2912
2913 static SYSCTL_NODE(_kern_proc, KERN_PROC_OSREL, osrel, CTLFLAG_RW |
2914 CTLFLAG_ANYBODY | CTLFLAG_MPSAFE, sysctl_kern_proc_osrel,
2915 "Process binary osreldate");
2916
2917 static SYSCTL_NODE(_kern_proc, KERN_PROC_SIGTRAMP, sigtramp, CTLFLAG_RD |
2918 CTLFLAG_MPSAFE, sysctl_kern_proc_sigtramp,
2919 "Process signal trampoline location");
2920
2921 int allproc_gen;
2922
2923 void
stop_all_proc(void)2924 stop_all_proc(void)
2925 {
2926 struct proc *cp, *p;
2927 int r, gen;
2928 bool restart, seen_stopped, seen_exiting, stopped_some;
2929
2930 cp = curproc;
2931 /*
2932 * stop_all_proc() assumes that all process which have
2933 * usermode must be stopped, except current process, for
2934 * obvious reasons. Since other threads in the process
2935 * establishing global stop could unstop something, disable
2936 * calls from multithreaded processes as precaution. The
2937 * service must not be user-callable anyway.
2938 */
2939 KASSERT((cp->p_flag & P_HADTHREADS) == 0 ||
2940 (cp->p_flag & P_KTHREAD) != 0, ("mt stop_all_proc"));
2941
2942 allproc_loop:
2943 sx_xlock(&allproc_lock);
2944 gen = allproc_gen;
2945 seen_exiting = seen_stopped = stopped_some = restart = false;
2946 LIST_REMOVE(cp, p_list);
2947 LIST_INSERT_HEAD(&allproc, cp, p_list);
2948 for (;;) {
2949 p = LIST_NEXT(cp, p_list);
2950 if (p == NULL)
2951 break;
2952 LIST_REMOVE(cp, p_list);
2953 LIST_INSERT_AFTER(p, cp, p_list);
2954 PROC_LOCK(p);
2955 if ((p->p_flag & (P_KTHREAD | P_SYSTEM |
2956 P_TOTAL_STOP)) != 0) {
2957 PROC_UNLOCK(p);
2958 continue;
2959 }
2960 if ((p->p_flag & P_WEXIT) != 0) {
2961 seen_exiting = true;
2962 PROC_UNLOCK(p);
2963 continue;
2964 }
2965 if (P_SHOULDSTOP(p) == P_STOPPED_SINGLE) {
2966 /*
2967 * Stopped processes are tolerated when there
2968 * are no other processes which might continue
2969 * them. P_STOPPED_SINGLE but not
2970 * P_TOTAL_STOP process still has at least one
2971 * thread running.
2972 */
2973 seen_stopped = true;
2974 PROC_UNLOCK(p);
2975 continue;
2976 }
2977 _PHOLD(p);
2978 sx_xunlock(&allproc_lock);
2979 r = thread_single(p, SINGLE_ALLPROC);
2980 if (r != 0)
2981 restart = true;
2982 else
2983 stopped_some = true;
2984 _PRELE(p);
2985 PROC_UNLOCK(p);
2986 sx_xlock(&allproc_lock);
2987 }
2988 /* Catch forked children we did not see in iteration. */
2989 if (gen != allproc_gen)
2990 restart = true;
2991 sx_xunlock(&allproc_lock);
2992 if (restart || stopped_some || seen_exiting || seen_stopped) {
2993 kern_yield(PRI_USER);
2994 goto allproc_loop;
2995 }
2996 }
2997
2998 void
resume_all_proc(void)2999 resume_all_proc(void)
3000 {
3001 struct proc *cp, *p;
3002
3003 cp = curproc;
3004 sx_xlock(&allproc_lock);
3005 LIST_REMOVE(cp, p_list);
3006 LIST_INSERT_HEAD(&allproc, cp, p_list);
3007 for (;;) {
3008 p = LIST_NEXT(cp, p_list);
3009 if (p == NULL)
3010 break;
3011 LIST_REMOVE(cp, p_list);
3012 LIST_INSERT_AFTER(p, cp, p_list);
3013 PROC_LOCK(p);
3014 if ((p->p_flag & P_TOTAL_STOP) != 0) {
3015 sx_xunlock(&allproc_lock);
3016 _PHOLD(p);
3017 thread_single_end(p, SINGLE_ALLPROC);
3018 _PRELE(p);
3019 PROC_UNLOCK(p);
3020 sx_xlock(&allproc_lock);
3021 } else {
3022 PROC_UNLOCK(p);
3023 }
3024 }
3025 sx_xunlock(&allproc_lock);
3026 }
3027
3028 #define TOTAL_STOP_DEBUG 1
3029 #ifdef TOTAL_STOP_DEBUG
3030 volatile static int ap_resume;
3031 #include <sys/mount.h>
3032
3033 static int
sysctl_debug_stop_all_proc(SYSCTL_HANDLER_ARGS)3034 sysctl_debug_stop_all_proc(SYSCTL_HANDLER_ARGS)
3035 {
3036 int error, val;
3037
3038 val = 0;
3039 ap_resume = 0;
3040 error = sysctl_handle_int(oidp, &val, 0, req);
3041 if (error != 0 || req->newptr == NULL)
3042 return (error);
3043 if (val != 0) {
3044 stop_all_proc();
3045 syncer_suspend();
3046 while (ap_resume == 0)
3047 ;
3048 syncer_resume();
3049 resume_all_proc();
3050 }
3051 return (0);
3052 }
3053
3054 SYSCTL_PROC(_debug, OID_AUTO, stop_all_proc, CTLTYPE_INT | CTLFLAG_RW |
3055 CTLFLAG_MPSAFE, __DEVOLATILE(int *, &ap_resume), 0,
3056 sysctl_debug_stop_all_proc, "I",
3057 "");
3058 #endif
3059