Kernel - Fix numerous procfs/ptrace issues (2)
[dragonfly.git] / sys / kern / kern_proc.c
CommitLineData
984263bc 1/*
99ad9bc4
MD
2 * (MPSAFE)
3 *
984263bc
MD
4 * Copyright (c) 1982, 1986, 1989, 1991, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 *
35 * @(#)kern_proc.c 8.7 (Berkeley) 2/14/95
36 * $FreeBSD: src/sys/kern/kern_proc.c,v 1.63.2.9 2003/05/08 07:47:16 kbyanc Exp $
37 */
38
39#include <sys/param.h>
40#include <sys/systm.h>
41#include <sys/kernel.h>
42#include <sys/sysctl.h>
43#include <sys/malloc.h>
44#include <sys/proc.h>
56c703bd 45#include <sys/jail.h>
984263bc
MD
46#include <sys/filedesc.h>
47#include <sys/tty.h>
8c72e3d5 48#include <sys/dsched.h>
984263bc 49#include <sys/signalvar.h>
5bf0d9b5 50#include <sys/spinlock.h>
984263bc
MD
51#include <vm/vm.h>
52#include <sys/lock.h>
53#include <vm/pmap.h>
54#include <vm/vm_map.h>
55#include <sys/user.h>
630ccdeb 56#include <machine/smp.h>
984263bc 57
58c2553a 58#include <sys/refcount.h>
5bf0d9b5 59#include <sys/spinlock2.h>
684a93c4 60#include <sys/mplock2.h>
5bf0d9b5 61
984263bc
MD
62static MALLOC_DEFINE(M_PGRP, "pgrp", "process group header");
63MALLOC_DEFINE(M_SESSION, "session", "session header");
fb2a331e 64MALLOC_DEFINE(M_PROC, "proc", "Proc structures");
f6c36234 65MALLOC_DEFINE(M_LWP, "lwp", "lwp structures");
984263bc
MD
66MALLOC_DEFINE(M_SUBPROC, "subproc", "Proc sub-structures");
67
28c57d20 68int ps_showallprocs = 1;
73e4f7b9 69static int ps_showallthreads = 1;
43a0f7ae
MS
70SYSCTL_INT(_security, OID_AUTO, ps_showallprocs, CTLFLAG_RW,
71 &ps_showallprocs, 0,
72 "Unprivileged processes can see proccesses with different UID/GID");
73SYSCTL_INT(_security, OID_AUTO, ps_showallthreads, CTLFLAG_RW,
74 &ps_showallthreads, 0,
75 "Unprivileged processes can see kernel threads");
984263bc 76
51e64ff2
MD
77static void pgdelete(struct pgrp *);
78static void orphanpg(struct pgrp *pg);
79static pid_t proc_getnewpid_locked(int random_offset);
984263bc
MD
80
81/*
82 * Other process lists
83 */
84struct pidhashhead *pidhashtbl;
85u_long pidhash;
86struct pgrphashhead *pgrphashtbl;
87u_long pgrphash;
88struct proclist allproc;
89struct proclist zombproc;
984263bc
MD
90
91/*
51e64ff2
MD
92 * Random component to nextpid generation. We mix in a random factor to make
93 * it a little harder to predict. We sanity check the modulus value to avoid
94 * doing it in critical paths. Don't let it be too small or we pointlessly
95 * waste randomness entropy, and don't let it be impossibly large. Using a
96 * modulus that is too big causes a LOT more process table scans and slows
97 * down fork processing as the pidchecked caching is defeated.
98 */
99static int randompid = 0;
100
99ad9bc4
MD
101/*
102 * No requirements.
103 */
51e64ff2
MD
104static int
105sysctl_kern_randompid(SYSCTL_HANDLER_ARGS)
106{
107 int error, pid;
108
109 pid = randompid;
110 error = sysctl_handle_int(oidp, &pid, 0, req);
111 if (error || !req->newptr)
112 return (error);
113 if (pid < 0 || pid > PID_MAX - 100) /* out of range */
114 pid = PID_MAX - 100;
115 else if (pid < 2) /* NOP */
116 pid = 0;
117 else if (pid < 100) /* Make it reasonable */
118 pid = 100;
119 randompid = pid;
120 return (error);
121}
122
123SYSCTL_PROC(_kern, OID_AUTO, randompid, CTLTYPE_INT|CTLFLAG_RW,
124 0, 0, sysctl_kern_randompid, "I", "Random PID modulus");
125
126/*
984263bc 127 * Initialize global process hashing structures.
99ad9bc4
MD
128 *
129 * Called from the low level boot code only.
984263bc
MD
130 */
131void
77153250 132procinit(void)
984263bc 133{
984263bc
MD
134 LIST_INIT(&allproc);
135 LIST_INIT(&zombproc);
40aaf5fc 136 lwkt_init();
984263bc
MD
137 pidhashtbl = hashinit(maxproc / 4, M_PROC, &pidhash);
138 pgrphashtbl = hashinit(maxproc / 4, M_PROC, &pgrphash);
984263bc
MD
139 uihashinit();
140}
141
142/*
82354ad8
MD
143 * Process hold/release support functions. These functions must be MPSAFE.
144 * Called via the PHOLD(), PRELE(), and PSTALL() macros.
145 *
146 * p->p_lock is a simple hold count with a waiting interlock. No wakeup()
147 * is issued unless someone is actually waiting for the process.
148 *
149 * Most holds are short-term, allowing a process scan or other similar
150 * operation to access a proc structure without it getting ripped out from
151 * under us. procfs and process-list sysctl ops also use the hold function
152 * interlocked with various p_flags to keep the vmspace intact when reading
153 * or writing a user process's address space.
154 *
155 * There are two situations where a hold count can be longer. Exiting lwps
156 * hold the process until the lwp is reaped, and the parent will hold the
157 * child during vfork()/exec() sequences while the child is marked P_PPWAIT.
158 *
159 * The kernel waits for the hold count to drop to 0 (or 1 in some cases) at
160 * various critical points in the fork/exec and exit paths before proceeding.
161 */
162#define PLOCK_WAITING 0x40000000
163#define PLOCK_MASK 0x3FFFFFFF
164
165void
166pstall(struct proc *p, const char *wmesg, int count)
167{
168 int o;
169 int n;
170
171 for (;;) {
172 o = p->p_lock;
173 cpu_ccfence();
174 if ((o & PLOCK_MASK) <= count)
175 break;
176 n = o | PLOCK_WAITING;
177 tsleep_interlock(&p->p_lock, 0);
7c37ea07
MD
178
179 /*
2fe8ae78
MD
180 * If someone is trying to single-step the process during
181 * an exec or an exit they can deadlock us because procfs
182 * sleeps with the process held.
7c37ea07 183 */
2fe8ae78
MD
184 if (p->p_stops) {
185 if (p->p_flags & P_INEXEC) {
186 wakeup(&p->p_stype);
187 } else if (p->p_flags & P_POSTEXIT) {
188 spin_lock(&p->p_spin);
189 p->p_stops = 0;
190 p->p_step = 0;
191 spin_unlock(&p->p_spin);
192 wakeup(&p->p_stype);
193 }
7c37ea07
MD
194 }
195
82354ad8
MD
196 if (atomic_cmpset_int(&p->p_lock, o, n)) {
197 tsleep(&p->p_lock, PINTERLOCKED, wmesg, 0);
198 }
199 }
200}
201
202void
203phold(struct proc *p)
204{
205 int o;
206 int n;
207
208 for (;;) {
209 o = p->p_lock;
210 cpu_ccfence();
211 n = o + 1;
212 if (atomic_cmpset_int(&p->p_lock, o, n))
213 break;
214 }
215}
216
217void
218prele(struct proc *p)
219{
220 int o;
221 int n;
222
223 /*
224 * Fast path
225 */
226 if (atomic_cmpset_int(&p->p_lock, 1, 0))
227 return;
228
229 /*
230 * Slow path
231 */
232 for (;;) {
233 o = p->p_lock;
234 KKASSERT((o & PLOCK_MASK) > 0);
235 cpu_ccfence();
236 n = (o - 1) & ~PLOCK_WAITING;
237 if (atomic_cmpset_int(&p->p_lock, o, n)) {
238 if (o & PLOCK_WAITING)
239 wakeup(&p->p_lock);
240 break;
241 }
242 }
243}
244
245/*
984263bc 246 * Is p an inferior of the current process?
99ad9bc4
MD
247 *
248 * No requirements.
249 * The caller must hold proc_token if the caller wishes a stable result.
984263bc
MD
250 */
251int
77153250 252inferior(struct proc *p)
984263bc 253{
99ad9bc4
MD
254 lwkt_gettoken(&proc_token);
255 while (p != curproc) {
256 if (p->p_pid == 0) {
257 lwkt_reltoken(&proc_token);
984263bc 258 return (0);
99ad9bc4
MD
259 }
260 p = p->p_pptr;
261 }
262 lwkt_reltoken(&proc_token);
984263bc
MD
263 return (1);
264}
265
266/*
58c2553a
MD
267 * Locate a process by number. The returned process will be referenced and
268 * must be released with PRELE().
99ad9bc4
MD
269 *
270 * No requirements.
984263bc
MD
271 */
272struct proc *
77153250 273pfind(pid_t pid)
984263bc 274{
1fd87d54 275 struct proc *p;
984263bc 276
99ad9bc4 277 lwkt_gettoken(&proc_token);
5bf0d9b5 278 LIST_FOREACH(p, PIDHASH(pid), p_hash) {
99ad9bc4 279 if (p->p_pid == pid) {
58c2553a 280 PHOLD(p);
99ad9bc4 281 lwkt_reltoken(&proc_token);
984263bc 282 return (p);
99ad9bc4 283 }
5bf0d9b5 284 }
99ad9bc4 285 lwkt_reltoken(&proc_token);
984263bc
MD
286 return (NULL);
287}
288
289/*
58c2553a
MD
290 * Locate a process by number. The returned process is NOT referenced.
291 * The caller should hold proc_token if the caller wishes a stable result.
292 *
293 * No requirements.
294 */
295struct proc *
296pfindn(pid_t pid)
297{
298 struct proc *p;
299
300 lwkt_gettoken(&proc_token);
301 LIST_FOREACH(p, PIDHASH(pid), p_hash) {
302 if (p->p_pid == pid) {
303 lwkt_reltoken(&proc_token);
304 return (p);
305 }
306 }
307 lwkt_reltoken(&proc_token);
308 return (NULL);
309}
310
311void
312pgref(struct pgrp *pgrp)
313{
314 refcount_acquire(&pgrp->pg_refs);
315}
316
317void
318pgrel(struct pgrp *pgrp)
319{
320 if (refcount_release(&pgrp->pg_refs))
321 pgdelete(pgrp);
322}
323
324/*
325 * Locate a process group by number. The returned process group will be
326 * referenced w/pgref() and must be released with pgrel() (or assigned
327 * somewhere if you wish to keep the reference).
99ad9bc4
MD
328 *
329 * No requirements.
984263bc
MD
330 */
331struct pgrp *
77153250 332pgfind(pid_t pgid)
984263bc 333{
1fd87d54 334 struct pgrp *pgrp;
984263bc 335
99ad9bc4 336 lwkt_gettoken(&proc_token);
5bf0d9b5 337 LIST_FOREACH(pgrp, PGRPHASH(pgid), pg_hash) {
46270ec6 338 if (pgrp->pg_id == pgid) {
58c2553a 339 refcount_acquire(&pgrp->pg_refs);
46270ec6 340 lwkt_reltoken(&proc_token);
984263bc 341 return (pgrp);
46270ec6 342 }
5bf0d9b5 343 }
99ad9bc4 344 lwkt_reltoken(&proc_token);
984263bc
MD
345 return (NULL);
346}
347
348/*
349 * Move p to a new or existing process group (and session)
99ad9bc4
MD
350 *
351 * No requirements.
984263bc
MD
352 */
353int
77153250 354enterpgrp(struct proc *p, pid_t pgid, int mksess)
984263bc 355{
99ad9bc4 356 struct pgrp *pgrp;
58c2553a 357 struct pgrp *opgrp;
99ad9bc4
MD
358 int error;
359
99ad9bc4 360 pgrp = pgfind(pgid);
984263bc
MD
361
362 KASSERT(pgrp == NULL || !mksess,
99ad9bc4 363 ("enterpgrp: setsid into non-empty pgrp"));
984263bc 364 KASSERT(!SESS_LEADER(p),
99ad9bc4 365 ("enterpgrp: session leader attempted setpgrp"));
984263bc
MD
366
367 if (pgrp == NULL) {
368 pid_t savepid = p->p_pid;
369 struct proc *np;
370 /*
371 * new process group
372 */
373 KASSERT(p->p_pid == pgid,
99ad9bc4 374 ("enterpgrp: new pgrp and pid != pgid"));
58c2553a 375 if ((np = pfindn(savepid)) == NULL || np != p) {
99ad9bc4
MD
376 error = ESRCH;
377 goto fatal;
378 }
884717e1 379 pgrp = kmalloc(sizeof(struct pgrp), M_PGRP, M_WAITOK);
984263bc 380 if (mksess) {
1fd87d54 381 struct session *sess;
984263bc
MD
382
383 /*
384 * new session
385 */
884717e1
SW
386 sess = kmalloc(sizeof(struct session), M_SESSION,
387 M_WAITOK);
984263bc
MD
388 sess->s_leader = p;
389 sess->s_sid = p->p_pid;
390 sess->s_count = 1;
391 sess->s_ttyvp = NULL;
392 sess->s_ttyp = NULL;
393 bcopy(p->p_session->s_login, sess->s_login,
99ad9bc4 394 sizeof(sess->s_login));
984263bc
MD
395 pgrp->pg_session = sess;
396 KASSERT(p == curproc,
99ad9bc4 397 ("enterpgrp: mksession and p != curproc"));
616516c8 398 lwkt_gettoken(&p->p_token);
4643740a 399 p->p_flags &= ~P_CONTROLT;
616516c8 400 lwkt_reltoken(&p->p_token);
984263bc
MD
401 } else {
402 pgrp->pg_session = p->p_session;
8b90699b 403 sess_hold(pgrp->pg_session);
984263bc
MD
404 }
405 pgrp->pg_id = pgid;
406 LIST_INIT(&pgrp->pg_members);
407 LIST_INSERT_HEAD(PGRPHASH(pgid), pgrp, pg_hash);
408 pgrp->pg_jobc = 0;
409 SLIST_INIT(&pgrp->pg_sigiolst);
58c2553a
MD
410 lwkt_token_init(&pgrp->pg_token, "pgrp_token");
411 refcount_init(&pgrp->pg_refs, 1);
167e6ecb 412 lockinit(&pgrp->pg_lock, "pgwt", 0, 0);
99ad9bc4 413 } else if (pgrp == p->p_pgrp) {
58c2553a 414 pgrel(pgrp);
99ad9bc4 415 goto done;
58c2553a 416 } /* else pgfind() referenced the pgrp */
984263bc
MD
417
418 /*
419 * Adjust eligibility of affected pgrps to participate in job control.
420 * Increment eligibility counts before decrementing, otherwise we
421 * could reach 0 spuriously during the first call.
422 */
58c2553a
MD
423 lwkt_gettoken(&pgrp->pg_token);
424 lwkt_gettoken(&p->p_token);
984263bc
MD
425 fixjobc(p, pgrp, 1);
426 fixjobc(p, p->p_pgrp, 0);
58c2553a
MD
427 while ((opgrp = p->p_pgrp) != NULL) {
428 opgrp = p->p_pgrp;
429 lwkt_gettoken(&opgrp->pg_token);
430 LIST_REMOVE(p, p_pglist);
431 p->p_pgrp = NULL;
432 lwkt_reltoken(&opgrp->pg_token);
433 pgrel(opgrp);
434 }
984263bc
MD
435 p->p_pgrp = pgrp;
436 LIST_INSERT_HEAD(&pgrp->pg_members, p, p_pglist);
58c2553a
MD
437 lwkt_reltoken(&p->p_token);
438 lwkt_reltoken(&pgrp->pg_token);
99ad9bc4
MD
439done:
440 error = 0;
441fatal:
99ad9bc4 442 return (error);
984263bc
MD
443}
444
445/*
99ad9bc4
MD
446 * Remove process from process group
447 *
448 * No requirements.
984263bc
MD
449 */
450int
77153250 451leavepgrp(struct proc *p)
984263bc 452{
58c2553a
MD
453 struct pgrp *pg = p->p_pgrp;
454
455 lwkt_gettoken(&p->p_token);
456 pg = p->p_pgrp;
457 if (pg) {
458 pgref(pg);
459 lwkt_gettoken(&pg->pg_token);
460 if (p->p_pgrp == pg) {
461 p->p_pgrp = NULL;
462 LIST_REMOVE(p, p_pglist);
463 pgrel(pg);
464 }
465 lwkt_reltoken(&pg->pg_token);
466 lwkt_reltoken(&p->p_token); /* avoid chaining on rel */
467 pgrel(pg);
468 } else {
469 lwkt_reltoken(&p->p_token);
470 }
984263bc
MD
471 return (0);
472}
473
474/*
58c2553a
MD
475 * Delete a process group. Must be called only after the last ref has been
476 * released.
984263bc
MD
477 */
478static void
77153250 479pgdelete(struct pgrp *pgrp)
984263bc 480{
984263bc
MD
481 /*
482 * Reset any sigio structures pointing to us as a result of
483 * F_SETOWN with our pgid.
484 */
485 funsetownlst(&pgrp->pg_sigiolst);
486
487 if (pgrp->pg_session->s_ttyp != NULL &&
488 pgrp->pg_session->s_ttyp->t_pgrp == pgrp)
489 pgrp->pg_session->s_ttyp->t_pgrp = NULL;
490 LIST_REMOVE(pgrp, pg_hash);
8b90699b 491 sess_rele(pgrp->pg_session);
efda3bd0 492 kfree(pgrp, M_PGRP);
8b90699b
MD
493}
494
495/*
496 * Adjust the ref count on a session structure. When the ref count falls to
497 * zero the tty is disassociated from the session and the session structure
498 * is freed. Note that tty assocation is not itself ref-counted.
99ad9bc4
MD
499 *
500 * No requirements.
8b90699b
MD
501 */
502void
503sess_hold(struct session *sp)
504{
99ad9bc4 505 lwkt_gettoken(&tty_token);
8b90699b 506 ++sp->s_count;
99ad9bc4 507 lwkt_reltoken(&tty_token);
8b90699b
MD
508}
509
99ad9bc4
MD
510/*
511 * No requirements.
512 */
8b90699b
MD
513void
514sess_rele(struct session *sp)
515{
94a6eea8
MD
516 struct tty *tp;
517
8b90699b 518 KKASSERT(sp->s_count > 0);
99ad9bc4 519 lwkt_gettoken(&tty_token);
8b90699b
MD
520 if (--sp->s_count == 0) {
521 if (sp->s_ttyp && sp->s_ttyp->t_session) {
522#ifdef TTY_DO_FULL_CLOSE
523 /* FULL CLOSE, see ttyclearsession() */
524 KKASSERT(sp->s_ttyp->t_session == sp);
525 sp->s_ttyp->t_session = NULL;
526#else
527 /* HALF CLOSE, see ttyclearsession() */
528 if (sp->s_ttyp->t_session == sp)
529 sp->s_ttyp->t_session = NULL;
530#endif
531 }
94a6eea8
MD
532 if ((tp = sp->s_ttyp) != NULL) {
533 sp->s_ttyp = NULL;
534 ttyunhold(tp);
535 }
efda3bd0 536 kfree(sp, M_SESSION);
8b90699b 537 }
99ad9bc4 538 lwkt_reltoken(&tty_token);
984263bc
MD
539}
540
541/*
542 * Adjust pgrp jobc counters when specified process changes process group.
543 * We count the number of processes in each process group that "qualify"
544 * the group for terminal job control (those with a parent in a different
545 * process group of the same session). If that count reaches zero, the
546 * process group becomes orphaned. Check both the specified process'
547 * process group and that of its children.
548 * entering == 0 => p is leaving specified group.
549 * entering == 1 => p is entering specified group.
99ad9bc4
MD
550 *
551 * No requirements.
984263bc
MD
552 */
553void
77153250 554fixjobc(struct proc *p, struct pgrp *pgrp, int entering)
984263bc 555{
1fd87d54 556 struct pgrp *hispgrp;
99ad9bc4 557 struct session *mysession;
b5c4d81f 558 struct proc *np;
984263bc
MD
559
560 /*
561 * Check p's parent to see whether p qualifies its own process
562 * group; if so, adjust count for p's process group.
563 */
b5c4d81f 564 lwkt_gettoken(&p->p_token); /* p_children scan */
58c2553a 565 lwkt_gettoken(&pgrp->pg_token);
b5c4d81f 566
99ad9bc4 567 mysession = pgrp->pg_session;
984263bc
MD
568 if ((hispgrp = p->p_pptr->p_pgrp) != pgrp &&
569 hispgrp->pg_session == mysession) {
570 if (entering)
571 pgrp->pg_jobc++;
572 else if (--pgrp->pg_jobc == 0)
573 orphanpg(pgrp);
574 }
575
576 /*
577 * Check this process' children to see whether they qualify
578 * their process groups; if so, adjust counts for children's
579 * process groups.
580 */
b5c4d81f 581 LIST_FOREACH(np, &p->p_children, p_sibling) {
58c2553a
MD
582 PHOLD(np);
583 lwkt_gettoken(&np->p_token);
b5c4d81f 584 if ((hispgrp = np->p_pgrp) != pgrp &&
984263bc 585 hispgrp->pg_session == mysession &&
b5c4d81f 586 np->p_stat != SZOMB) {
58c2553a
MD
587 pgref(hispgrp);
588 lwkt_gettoken(&hispgrp->pg_token);
984263bc
MD
589 if (entering)
590 hispgrp->pg_jobc++;
591 else if (--hispgrp->pg_jobc == 0)
592 orphanpg(hispgrp);
58c2553a
MD
593 lwkt_reltoken(&hispgrp->pg_token);
594 pgrel(hispgrp);
984263bc 595 }
58c2553a
MD
596 lwkt_reltoken(&np->p_token);
597 PRELE(np);
99ad9bc4 598 }
58c2553a
MD
599 KKASSERT(pgrp->pg_refs > 0);
600 lwkt_reltoken(&pgrp->pg_token);
b5c4d81f 601 lwkt_reltoken(&p->p_token);
984263bc
MD
602}
603
604/*
605 * A process group has become orphaned;
606 * if there are any stopped processes in the group,
607 * hang-up all process in that group.
99ad9bc4 608 *
58c2553a 609 * The caller must hold pg_token.
984263bc
MD
610 */
611static void
77153250 612orphanpg(struct pgrp *pg)
984263bc 613{
1fd87d54 614 struct proc *p;
984263bc
MD
615
616 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
164b8401 617 if (p->p_stat == SSTOP) {
984263bc 618 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
84204577
MD
619 ksignal(p, SIGHUP);
620 ksignal(p, SIGCONT);
984263bc
MD
621 }
622 return;
623 }
624 }
625}
626
5bf0d9b5 627/*
51e64ff2
MD
628 * Add a new process to the allproc list and the PID hash. This
629 * also assigns a pid to the new process.
630 *
99ad9bc4 631 * No requirements.
51e64ff2
MD
632 */
633void
634proc_add_allproc(struct proc *p)
635{
636 int random_offset;
637
638 if ((random_offset = randompid) != 0) {
639 get_mplock();
0ced1954 640 random_offset = karc4random() % random_offset;
51e64ff2
MD
641 rel_mplock();
642 }
643
99ad9bc4 644 lwkt_gettoken(&proc_token);
51e64ff2
MD
645 p->p_pid = proc_getnewpid_locked(random_offset);
646 LIST_INSERT_HEAD(&allproc, p, p_list);
647 LIST_INSERT_HEAD(PIDHASH(p->p_pid), p, p_hash);
99ad9bc4 648 lwkt_reltoken(&proc_token);
51e64ff2
MD
649}
650
651/*
652 * Calculate a new process pid. This function is integrated into
653 * proc_add_allproc() to guarentee that the new pid is not reused before
654 * the new process can be added to the allproc list.
655 *
99ad9bc4 656 * The caller must hold proc_token.
51e64ff2
MD
657 */
658static
659pid_t
660proc_getnewpid_locked(int random_offset)
661{
662 static pid_t nextpid;
663 static pid_t pidchecked;
664 struct proc *p;
665
666 /*
667 * Find an unused process ID. We remember a range of unused IDs
668 * ready to use (from nextpid+1 through pidchecked-1).
669 */
670 nextpid = nextpid + 1 + random_offset;
671retry:
672 /*
673 * If the process ID prototype has wrapped around,
674 * restart somewhat above 0, as the low-numbered procs
675 * tend to include daemons that don't exit.
676 */
677 if (nextpid >= PID_MAX) {
678 nextpid = nextpid % PID_MAX;
679 if (nextpid < 100)
680 nextpid += 100;
681 pidchecked = 0;
682 }
683 if (nextpid >= pidchecked) {
684 int doingzomb = 0;
685
686 pidchecked = PID_MAX;
0d78b86e 687
51e64ff2
MD
688 /*
689 * Scan the active and zombie procs to check whether this pid
690 * is in use. Remember the lowest pid that's greater
691 * than nextpid, so we can avoid checking for a while.
0d78b86e
MD
692 *
693 * NOTE: Processes in the midst of being forked may not
694 * yet have p_pgrp and p_pgrp->pg_session set up
695 * yet, so we have to check for NULL.
696 *
697 * Processes being torn down should be interlocked
698 * with proc_token prior to the clearing of their
699 * p_pgrp.
51e64ff2
MD
700 */
701 p = LIST_FIRST(&allproc);
702again:
0d78b86e 703 for (; p != NULL; p = LIST_NEXT(p, p_list)) {
51e64ff2 704 while (p->p_pid == nextpid ||
0d78b86e
MD
705 (p->p_pgrp && p->p_pgrp->pg_id == nextpid) ||
706 (p->p_pgrp && p->p_session &&
707 p->p_session->s_sid == nextpid)) {
51e64ff2
MD
708 nextpid++;
709 if (nextpid >= pidchecked)
710 goto retry;
711 }
712 if (p->p_pid > nextpid && pidchecked > p->p_pid)
713 pidchecked = p->p_pid;
0d78b86e
MD
714 if (p->p_pgrp &&
715 p->p_pgrp->pg_id > nextpid &&
716 pidchecked > p->p_pgrp->pg_id) {
51e64ff2 717 pidchecked = p->p_pgrp->pg_id;
0d78b86e
MD
718 }
719 if (p->p_pgrp && p->p_session &&
720 p->p_session->s_sid > nextpid &&
721 pidchecked > p->p_session->s_sid) {
51e64ff2 722 pidchecked = p->p_session->s_sid;
0d78b86e 723 }
51e64ff2
MD
724 }
725 if (!doingzomb) {
726 doingzomb = 1;
727 p = LIST_FIRST(&zombproc);
728 goto again;
729 }
730 }
731 return(nextpid);
732}
733
734/*
5bf0d9b5
MD
735 * Called from exit1 to remove a process from the allproc
736 * list and move it to the zombie list.
737 *
eb2adbf5
MD
738 * Caller must hold p->p_token. We are required to wait until p_lock
739 * becomes zero before we can manipulate the list, allowing allproc
740 * scans to guarantee consistency during a list scan.
5bf0d9b5
MD
741 */
742void
743proc_move_allproc_zombie(struct proc *p)
744{
99ad9bc4 745 lwkt_gettoken(&proc_token);
82354ad8 746 PSTALL(p, "reap1", 0);
5bf0d9b5
MD
747 LIST_REMOVE(p, p_list);
748 LIST_INSERT_HEAD(&zombproc, p, p_list);
749 LIST_REMOVE(p, p_hash);
416d05d7 750 p->p_stat = SZOMB;
99ad9bc4 751 lwkt_reltoken(&proc_token);
8c72e3d5 752 dsched_exit_proc(p);
5bf0d9b5
MD
753}
754
755/*
756 * This routine is called from kern_wait() and will remove the process
757 * from the zombie list and the sibling list. This routine will block
758 * if someone has a lock on the proces (p_lock).
759 *
eb2adbf5
MD
760 * Caller must hold p->p_token. We are required to wait until p_lock
761 * becomes zero before we can manipulate the list, allowing allproc
762 * scans to guarantee consistency during a list scan.
5bf0d9b5
MD
763 */
764void
765proc_remove_zombie(struct proc *p)
766{
99ad9bc4 767 lwkt_gettoken(&proc_token);
82354ad8 768 PSTALL(p, "reap2", 0);
5bf0d9b5
MD
769 LIST_REMOVE(p, p_list); /* off zombproc */
770 LIST_REMOVE(p, p_sibling);
99ad9bc4 771 lwkt_reltoken(&proc_token);
5bf0d9b5
MD
772}
773
774/*
775 * Scan all processes on the allproc list. The process is automatically
776 * held for the callback. A return value of -1 terminates the loop.
777 *
99ad9bc4 778 * The callback is made with the process held and proc_token held.
c5d9d575
MD
779 *
780 * We limit the scan to the number of processes as-of the start of
781 * the scan so as not to get caught up in an endless loop if new processes
782 * are created more quickly than we can scan the old ones. Add a little
783 * slop to try to catch edge cases since nprocs can race.
784 *
785 * No requirements.
5bf0d9b5
MD
786 */
787void
788allproc_scan(int (*callback)(struct proc *, void *), void *data)
789{
790 struct proc *p;
791 int r;
c5d9d575 792 int limit = nprocs + ncpus;
5bf0d9b5 793
eb2adbf5
MD
794 /*
795 * proc_token protects the allproc list and PHOLD() prevents the
796 * process from being removed from the allproc list or the zombproc
797 * list.
798 */
99ad9bc4 799 lwkt_gettoken(&proc_token);
5bf0d9b5
MD
800 LIST_FOREACH(p, &allproc, p_list) {
801 PHOLD(p);
5bf0d9b5 802 r = callback(p, data);
5bf0d9b5
MD
803 PRELE(p);
804 if (r < 0)
805 break;
c5d9d575
MD
806 if (--limit < 0)
807 break;
5bf0d9b5 808 }
99ad9bc4 809 lwkt_reltoken(&proc_token);
5bf0d9b5
MD
810}
811
812/*
c7e98b2f
SS
813 * Scan all lwps of processes on the allproc list. The lwp is automatically
814 * held for the callback. A return value of -1 terminates the loop.
815 *
99ad9bc4 816 * The callback is made with the proces and lwp both held, and proc_token held.
eb2adbf5
MD
817 *
818 * No requirements.
c7e98b2f
SS
819 */
820void
821alllwp_scan(int (*callback)(struct lwp *, void *), void *data)
822{
823 struct proc *p;
824 struct lwp *lp;
825 int r = 0;
826
eb2adbf5
MD
827 /*
828 * proc_token protects the allproc list and PHOLD() prevents the
829 * process from being removed from the allproc list or the zombproc
830 * list.
831 */
99ad9bc4 832 lwkt_gettoken(&proc_token);
c7e98b2f
SS
833 LIST_FOREACH(p, &allproc, p_list) {
834 PHOLD(p);
c7e98b2f
SS
835 FOREACH_LWP_IN_PROC(lp, p) {
836 LWPHOLD(lp);
837 r = callback(lp, data);
838 LWPRELE(lp);
839 }
c7e98b2f
SS
840 PRELE(p);
841 if (r < 0)
842 break;
843 }
99ad9bc4 844 lwkt_reltoken(&proc_token);
c7e98b2f
SS
845}
846
847/*
5bf0d9b5
MD
848 * Scan all processes on the zombproc list. The process is automatically
849 * held for the callback. A return value of -1 terminates the loop.
850 *
99ad9bc4
MD
851 * No requirements.
852 * The callback is made with the proces held and proc_token held.
5bf0d9b5
MD
853 */
854void
855zombproc_scan(int (*callback)(struct proc *, void *), void *data)
856{
857 struct proc *p;
858 int r;
859
99ad9bc4 860 lwkt_gettoken(&proc_token);
5bf0d9b5
MD
861 LIST_FOREACH(p, &zombproc, p_list) {
862 PHOLD(p);
5bf0d9b5 863 r = callback(p, data);
5bf0d9b5
MD
864 PRELE(p);
865 if (r < 0)
866 break;
867 }
99ad9bc4 868 lwkt_reltoken(&proc_token);
5bf0d9b5
MD
869}
870
984263bc
MD
871#include "opt_ddb.h"
872#ifdef DDB
873#include <ddb/ddb.h>
874
99ad9bc4
MD
875/*
876 * Debugging only
877 */
984263bc
MD
878DB_SHOW_COMMAND(pgrpdump, pgrpdump)
879{
1fd87d54
RG
880 struct pgrp *pgrp;
881 struct proc *p;
882 int i;
984263bc
MD
883
884 for (i = 0; i <= pgrphash; i++) {
885 if (!LIST_EMPTY(&pgrphashtbl[i])) {
6ea70f76 886 kprintf("\tindx %d\n", i);
984263bc 887 LIST_FOREACH(pgrp, &pgrphashtbl[i], pg_hash) {
6ea70f76 888 kprintf(
984263bc
MD
889 "\tpgrp %p, pgid %ld, sess %p, sesscnt %d, mem %p\n",
890 (void *)pgrp, (long)pgrp->pg_id,
891 (void *)pgrp->pg_session,
892 pgrp->pg_session->s_count,
893 (void *)LIST_FIRST(&pgrp->pg_members));
894 LIST_FOREACH(p, &pgrp->pg_members, p_pglist) {
6ea70f76 895 kprintf("\t\tpid %ld addr %p pgrp %p\n",
984263bc
MD
896 (long)p->p_pid, (void *)p,
897 (void *)p->p_pgrp);
898 }
899 }
900 }
901 }
902}
903#endif /* DDB */
904
5bf0d9b5 905/*
6f9db615 906 * Locate a process on the zombie list. Return a process or NULL.
58c2553a
MD
907 * The returned process will be referenced and the caller must release
908 * it with PRELE().
99ad9bc4 909 *
99ad9bc4 910 * No other requirements.
5bf0d9b5 911 */
984263bc
MD
912struct proc *
913zpfind(pid_t pid)
914{
915 struct proc *p;
916
99ad9bc4
MD
917 lwkt_gettoken(&proc_token);
918 LIST_FOREACH(p, &zombproc, p_list) {
46270ec6 919 if (p->p_pid == pid) {
58c2553a 920 PHOLD(p);
46270ec6 921 lwkt_reltoken(&proc_token);
984263bc 922 return (p);
46270ec6 923 }
99ad9bc4
MD
924 }
925 lwkt_reltoken(&proc_token);
984263bc
MD
926 return (NULL);
927}
928
99ad9bc4
MD
929/*
930 * The caller must hold proc_token.
931 */
984263bc 932static int
5dfd06ac 933sysctl_out_proc(struct proc *p, struct sysctl_req *req, int flags)
984263bc 934{
5dfd06ac
SS
935 struct kinfo_proc ki;
936 struct lwp *lp;
fe14f34e 937 int skp = 0, had_output = 0;
984263bc 938 int error;
d9d6cb99 939
fa2217dc 940 bzero(&ki, sizeof(ki));
b0c15cdf 941 lwkt_gettoken(&p->p_token);
5dfd06ac
SS
942 fill_kinfo_proc(p, &ki);
943 if ((flags & KERN_PROC_FLAG_LWP) == 0)
944 skp = 1;
fa2217dc 945 error = 0;
5dfd06ac 946 FOREACH_LWP_IN_PROC(lp, p) {
fa2217dc 947 LWPHOLD(lp);
5dfd06ac 948 fill_kinfo_lwp(lp, &ki.kp_lwp);
5dfd06ac
SS
949 had_output = 1;
950 error = SYSCTL_OUT(req, &ki, sizeof(ki));
fa2217dc 951 LWPRELE(lp);
5dfd06ac 952 if (error)
fa2217dc 953 break;
5dfd06ac
SS
954 if (skp)
955 break;
73e4f7b9 956 }
b0c15cdf 957 lwkt_reltoken(&p->p_token);
5dfd06ac 958 /* We need to output at least the proc, even if there is no lwp. */
fa2217dc
MD
959 if (had_output == 0) {
960 error = SYSCTL_OUT(req, &ki, sizeof(ki));
961 }
962 return (error);
984263bc
MD
963}
964
99ad9bc4
MD
965/*
966 * The caller must hold proc_token.
967 */
984263bc 968static int
ef02d0e1
TS
969sysctl_out_proc_kthread(struct thread *td, struct sysctl_req *req, int flags)
970{
971 struct kinfo_proc ki;
972 int error;
973
974 fill_kinfo_proc_kthread(td, &ki);
975 error = SYSCTL_OUT(req, &ki, sizeof(ki));
976 if (error)
977 return error;
978 return(0);
979}
980
99ad9bc4
MD
981/*
982 * No requirements.
983 */
ef02d0e1 984static int
984263bc
MD
985sysctl_kern_proc(SYSCTL_HANDLER_ARGS)
986{
987 int *name = (int*) arg1;
5dfd06ac 988 int oid = oidp->oid_number;
984263bc 989 u_int namelen = arg2;
7cd8fd20 990 struct proc *p;
5dfd06ac 991 struct proclist *plist;
ef02d0e1 992 struct thread *td;
eb2adbf5 993 struct thread *marker;
5dfd06ac 994 int doingzomb, flags = 0;
984263bc 995 int error = 0;
ef02d0e1 996 int n;
630ccdeb 997 int origcpu;
41c20dac 998 struct ucred *cr1 = curproc->p_ucred;
984263bc 999
5dfd06ac
SS
1000 flags = oid & KERN_PROC_FLAGMASK;
1001 oid &= ~KERN_PROC_FLAGMASK;
1002
1003 if ((oid == KERN_PROC_ALL && namelen != 0) ||
eb2adbf5 1004 (oid != KERN_PROC_ALL && namelen != 1)) {
5dfd06ac 1005 return (EINVAL);
eb2adbf5 1006 }
5dfd06ac 1007
eb2adbf5
MD
1008 /*
1009 * proc_token protects the allproc list and PHOLD() prevents the
1010 * process from being removed from the allproc list or the zombproc
1011 * list.
1012 */
99ad9bc4 1013 lwkt_gettoken(&proc_token);
5dfd06ac 1014 if (oid == KERN_PROC_PID) {
58c2553a 1015 p = pfindn((pid_t)name[0]);
99ad9bc4
MD
1016 if (p == NULL)
1017 goto post_threads;
41c20dac 1018 if (!PRISON_CHECK(cr1, p->p_ucred))
99ad9bc4 1019 goto post_threads;
e7093b07 1020 PHOLD(p);
5dfd06ac 1021 error = sysctl_out_proc(p, req, flags);
e7093b07 1022 PRELE(p);
99ad9bc4 1023 goto post_threads;
984263bc 1024 }
5dfd06ac 1025
984263bc
MD
1026 if (!req->oldptr) {
1027 /* overestimate by 5 procs */
1028 error = SYSCTL_OUT(req, 0, sizeof (struct kinfo_proc) * 5);
1029 if (error)
99ad9bc4 1030 goto post_threads;
984263bc 1031 }
5dfd06ac
SS
1032 for (doingzomb = 0; doingzomb <= 1; doingzomb++) {
1033 if (doingzomb)
1034 plist = &zombproc;
984263bc 1035 else
5dfd06ac 1036 plist = &allproc;
7cd8fd20 1037 LIST_FOREACH(p, plist, p_list) {
984263bc
MD
1038 /*
1039 * Show a user only their processes.
1040 */
41c20dac 1041 if ((!ps_showallprocs) && p_trespass(cr1, p->p_ucred))
984263bc
MD
1042 continue;
1043 /*
1044 * Skip embryonic processes.
1045 */
1046 if (p->p_stat == SIDL)
1047 continue;
1048 /*
1049 * TODO - make more efficient (see notes below).
1050 * do by session.
1051 */
5dfd06ac 1052 switch (oid) {
984263bc
MD
1053 case KERN_PROC_PGRP:
1054 /* could do this by traversing pgrp */
1055 if (p->p_pgrp == NULL ||
1056 p->p_pgrp->pg_id != (pid_t)name[0])
1057 continue;
1058 break;
1059
1060 case KERN_PROC_TTY:
4643740a 1061 if ((p->p_flags & P_CONTROLT) == 0 ||
984263bc
MD
1062 p->p_session == NULL ||
1063 p->p_session->s_ttyp == NULL ||
1064 dev2udev(p->p_session->s_ttyp->t_dev) !=
1065 (udev_t)name[0])
1066 continue;
1067 break;
1068
1069 case KERN_PROC_UID:
1070 if (p->p_ucred == NULL ||
1071 p->p_ucred->cr_uid != (uid_t)name[0])
1072 continue;
1073 break;
1074
1075 case KERN_PROC_RUID:
1076 if (p->p_ucred == NULL ||
41c20dac 1077 p->p_ucred->cr_ruid != (uid_t)name[0])
984263bc
MD
1078 continue;
1079 break;
1080 }
1081
41c20dac 1082 if (!PRISON_CHECK(cr1, p->p_ucred))
984263bc 1083 continue;
c008d3ad 1084 PHOLD(p);
5dfd06ac 1085 error = sysctl_out_proc(p, req, flags);
c008d3ad 1086 PRELE(p);
984263bc 1087 if (error)
99ad9bc4 1088 goto post_threads;
984263bc
MD
1089 }
1090 }
630ccdeb
MD
1091
1092 /*
1093 * Iterate over all active cpus and scan their thread list. Start
1094 * with the next logical cpu and end with our original cpu. We
1095 * migrate our own thread to each target cpu in order to safely scan
1096 * its thread list. In the last loop we migrate back to our original
1097 * cpu.
1098 */
1099 origcpu = mycpu->gd_cpuid;
56c703bd
JS
1100 if (!ps_showallthreads || jailed(cr1))
1101 goto post_threads;
99ad9bc4 1102
eb2adbf5 1103 marker = kmalloc(sizeof(struct thread), M_TEMP, M_WAITOK|M_ZERO);
42b33868 1104 marker->td_flags = TDF_MARKER;
eb2adbf5
MD
1105 error = 0;
1106
56c703bd 1107 for (n = 1; n <= ncpus; ++n) {
630ccdeb
MD
1108 globaldata_t rgd;
1109 int nid;
1110
1111 nid = (origcpu + n) % ncpus;
da23a592 1112 if ((smp_active_mask & CPUMASK(nid)) == 0)
630ccdeb
MD
1113 continue;
1114 rgd = globaldata_find(nid);
1115 lwkt_setcpu_self(rgd);
630ccdeb 1116
eb2adbf5
MD
1117 crit_enter();
1118 TAILQ_INSERT_TAIL(&rgd->gd_tdallq, marker, td_allq);
eb2adbf5
MD
1119
1120 while ((td = TAILQ_PREV(marker, lwkt_queue, td_allq)) != NULL) {
eb2adbf5
MD
1121 TAILQ_REMOVE(&rgd->gd_tdallq, marker, td_allq);
1122 TAILQ_INSERT_BEFORE(td, marker, td_allq);
42b33868 1123 if (td->td_flags & TDF_MARKER)
eb2adbf5 1124 continue;
42b33868 1125 if (td->td_proc)
eb2adbf5 1126 continue;
42b33868
MD
1127
1128 lwkt_hold(td);
1129 crit_exit();
eb2adbf5 1130
ef02d0e1 1131 switch (oid) {
73e4f7b9
MD
1132 case KERN_PROC_PGRP:
1133 case KERN_PROC_TTY:
1134 case KERN_PROC_UID:
1135 case KERN_PROC_RUID:
eb2adbf5 1136 break;
73e4f7b9 1137 default:
eb2adbf5
MD
1138 error = sysctl_out_proc_kthread(td, req,
1139 doingzomb);
73e4f7b9
MD
1140 break;
1141 }
73e4f7b9 1142 lwkt_rele(td);
42b33868 1143 crit_enter();
73e4f7b9 1144 if (error)
eb2adbf5 1145 break;
73e4f7b9 1146 }
eb2adbf5
MD
1147 TAILQ_REMOVE(&rgd->gd_tdallq, marker, td_allq);
1148 crit_exit();
1149
1150 if (error)
1151 break;
73e4f7b9 1152 }
eb2adbf5
MD
1153 kfree(marker, M_TEMP);
1154
56c703bd 1155post_threads:
99ad9bc4
MD
1156 lwkt_reltoken(&proc_token);
1157 return (error);
984263bc
MD
1158}
1159
1160/*
1161 * This sysctl allows a process to retrieve the argument list or process
1162 * title for another process without groping around in the address space
1163 * of the other process. It also allow a process to set its own "process
1164 * title to a string of its own choice.
99ad9bc4
MD
1165 *
1166 * No requirements.
984263bc
MD
1167 */
1168static int
1169sysctl_kern_proc_args(SYSCTL_HANDLER_ARGS)
1170{
1171 int *name = (int*) arg1;
1172 u_int namelen = arg2;
1173 struct proc *p;
19bfc8ab 1174 struct pargs *opa;
984263bc
MD
1175 struct pargs *pa;
1176 int error = 0;
41c20dac 1177 struct ucred *cr1 = curproc->p_ucred;
984263bc
MD
1178
1179 if (namelen != 1)
1180 return (EINVAL);
1181
46fb7ae4 1182 p = pfind((pid_t)name[0]);
99ad9bc4 1183 if (p == NULL)
46fb7ae4 1184 goto done;
19bfc8ab 1185 lwkt_gettoken(&p->p_token);
984263bc 1186
41c20dac 1187 if ((!ps_argsopen) && p_trespass(cr1, p->p_ucred))
99ad9bc4 1188 goto done;
984263bc 1189
99ad9bc4
MD
1190 if (req->newptr && curproc != p) {
1191 error = EPERM;
1192 goto done;
1193 }
46fb7ae4
MD
1194 if (req->oldptr && (pa = p->p_args) != NULL) {
1195 refcount_acquire(&pa->ar_ref);
1196 error = SYSCTL_OUT(req, pa->ar_args, pa->ar_length);
1197 if (refcount_release(&pa->ar_ref))
1198 kfree(pa, M_PARGS);
99ad9bc4 1199 }
19bfc8ab 1200 if (req->newptr == NULL)
99ad9bc4 1201 goto done;
984263bc 1202
99ad9bc4 1203 if (req->newlen + sizeof(struct pargs) > ps_arg_cache_limit) {
99ad9bc4
MD
1204 goto done;
1205 }
984263bc 1206
19bfc8ab
MD
1207 pa = kmalloc(sizeof(struct pargs) + req->newlen, M_PARGS, M_WAITOK);
1208 refcount_init(&pa->ar_ref, 1);
984263bc
MD
1209 pa->ar_length = req->newlen;
1210 error = SYSCTL_IN(req, pa->ar_args, req->newlen);
19bfc8ab
MD
1211 if (error) {
1212 kfree(pa, M_PARGS);
1213 goto done;
1214 }
1215
c7506e9d
MD
1216
1217 /*
1218 * Replace p_args with the new pa. p_args may have previously
1219 * been NULL.
1220 */
19bfc8ab
MD
1221 opa = p->p_args;
1222 p->p_args = pa;
1223
c7506e9d
MD
1224 if (opa) {
1225 KKASSERT(opa->ar_ref > 0);
1226 if (refcount_release(&opa->ar_ref)) {
1227 kfree(opa, M_PARGS);
1228 /* opa = NULL; */
1229 }
19bfc8ab 1230 }
99ad9bc4 1231done:
46fb7ae4
MD
1232 if (p) {
1233 lwkt_reltoken(&p->p_token);
1234 PRELE(p);
1235 }
984263bc
MD
1236 return (error);
1237}
1238
a45611c5
AH
1239static int
1240sysctl_kern_proc_cwd(SYSCTL_HANDLER_ARGS)
1241{
1242 int *name = (int*) arg1;
1243 u_int namelen = arg2;
1244 struct proc *p;
1245 int error = 0;
1246 char *fullpath, *freepath;
1247 struct ucred *cr1 = curproc->p_ucred;
1248
1249 if (namelen != 1)
1250 return (EINVAL);
1251
46fb7ae4 1252 p = pfind((pid_t)name[0]);
a45611c5
AH
1253 if (p == NULL)
1254 goto done;
46fb7ae4 1255 lwkt_gettoken(&p->p_token);
a45611c5
AH
1256
1257 /*
1258 * If we are not allowed to see other args, we certainly shouldn't
1259 * get the cwd either. Also check the usual trespassing.
1260 */
1261 if ((!ps_argsopen) && p_trespass(cr1, p->p_ucred))
1262 goto done;
1263
46fb7ae4
MD
1264 if (req->oldptr && p->p_fd != NULL && p->p_fd->fd_ncdir.ncp) {
1265 struct nchandle nch;
1266
1267 cache_copy(&p->p_fd->fd_ncdir, &nch);
1268 error = cache_fullpath(p, &nch, &fullpath, &freepath, 0);
1269 cache_drop(&nch);
a45611c5
AH
1270 if (error)
1271 goto done;
1272 error = SYSCTL_OUT(req, fullpath, strlen(fullpath) + 1);
1273 kfree(freepath, M_TEMP);
1274 }
1275
a45611c5 1276done:
46fb7ae4
MD
1277 if (p) {
1278 lwkt_reltoken(&p->p_token);
1279 PRELE(p);
1280 }
a45611c5
AH
1281 return (error);
1282}
1283
984263bc
MD
1284SYSCTL_NODE(_kern, KERN_PROC, proc, CTLFLAG_RD, 0, "Process table");
1285
1286SYSCTL_PROC(_kern_proc, KERN_PROC_ALL, all, CTLFLAG_RD|CTLTYPE_STRUCT,
1287 0, 0, sysctl_kern_proc, "S,proc", "Return entire process table");
1288
1289SYSCTL_NODE(_kern_proc, KERN_PROC_PGRP, pgrp, CTLFLAG_RD,
1290 sysctl_kern_proc, "Process table");
1291
1292SYSCTL_NODE(_kern_proc, KERN_PROC_TTY, tty, CTLFLAG_RD,
1293 sysctl_kern_proc, "Process table");
1294
1295SYSCTL_NODE(_kern_proc, KERN_PROC_UID, uid, CTLFLAG_RD,
1296 sysctl_kern_proc, "Process table");
1297
1298SYSCTL_NODE(_kern_proc, KERN_PROC_RUID, ruid, CTLFLAG_RD,
1299 sysctl_kern_proc, "Process table");
1300
1301SYSCTL_NODE(_kern_proc, KERN_PROC_PID, pid, CTLFLAG_RD,
1302 sysctl_kern_proc, "Process table");
1303
5dfd06ac
SS
1304SYSCTL_NODE(_kern_proc, (KERN_PROC_ALL | KERN_PROC_FLAG_LWP), all_lwp, CTLFLAG_RD,
1305 sysctl_kern_proc, "Process table");
1306
1307SYSCTL_NODE(_kern_proc, (KERN_PROC_PGRP | KERN_PROC_FLAG_LWP), pgrp_lwp, CTLFLAG_RD,
1308 sysctl_kern_proc, "Process table");
1309
1310SYSCTL_NODE(_kern_proc, (KERN_PROC_TTY | KERN_PROC_FLAG_LWP), tty_lwp, CTLFLAG_RD,
1311 sysctl_kern_proc, "Process table");
1312
1313SYSCTL_NODE(_kern_proc, (KERN_PROC_UID | KERN_PROC_FLAG_LWP), uid_lwp, CTLFLAG_RD,
1314 sysctl_kern_proc, "Process table");
1315
1316SYSCTL_NODE(_kern_proc, (KERN_PROC_RUID | KERN_PROC_FLAG_LWP), ruid_lwp, CTLFLAG_RD,
1317 sysctl_kern_proc, "Process table");
1318
1319SYSCTL_NODE(_kern_proc, (KERN_PROC_PID | KERN_PROC_FLAG_LWP), pid_lwp, CTLFLAG_RD,
1320 sysctl_kern_proc, "Process table");
1321
984263bc
MD
1322SYSCTL_NODE(_kern_proc, KERN_PROC_ARGS, args, CTLFLAG_RW | CTLFLAG_ANYBODY,
1323 sysctl_kern_proc_args, "Process argument list");
a45611c5
AH
1324
1325SYSCTL_NODE(_kern_proc, KERN_PROC_CWD, cwd, CTLFLAG_RD | CTLFLAG_ANYBODY,
1326 sysctl_kern_proc_cwd, "Process argument list");