1994-08-27 16:28:45 +00:00
|
|
|
/*-
|
|
|
|
* Copyright (c) 1993 The Regents of the University of California.
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*/
|
2003-06-10 22:09:23 +00:00
|
|
|
|
|
|
|
#include <sys/cdefs.h>
|
|
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
|
1994-08-27 16:28:45 +00:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
2001-03-28 09:17:56 +00:00
|
|
|
#include <sys/lock.h>
|
|
|
|
#include <sys/mutex.h>
|
1994-08-27 16:28:45 +00:00
|
|
|
#include <sys/proc.h>
|
1999-08-09 10:35:05 +00:00
|
|
|
#include <sys/cons.h>
|
2002-12-28 01:23:07 +00:00
|
|
|
#include <vm/vm.h>
|
|
|
|
#include <vm/vm_param.h>
|
|
|
|
#include <vm/pmap.h>
|
1994-08-27 16:28:45 +00:00
|
|
|
|
1995-12-10 19:08:32 +00:00
|
|
|
#include <ddb/ddb.h>
|
2003-06-06 17:19:27 +00:00
|
|
|
|
|
|
|
static void dumpthread(volatile struct proc *p, volatile struct thread *td);
|
1995-12-10 19:08:32 +00:00
|
|
|
|
1994-08-27 16:28:45 +00:00
|
|
|
void
|
1995-08-27 02:40:39 +00:00
|
|
|
db_ps(dummy1, dummy2, dummy3, dummy4)
|
|
|
|
db_expr_t dummy1;
|
|
|
|
boolean_t dummy2;
|
|
|
|
db_expr_t dummy3;
|
|
|
|
char * dummy4;
|
|
|
|
{
|
1995-08-20 05:25:11 +00:00
|
|
|
volatile struct proc *p, *pp;
|
2001-10-20 03:22:23 +00:00
|
|
|
volatile struct thread *td;
|
Part 1 of KSE-III
The ability to schedule multiple threads per process
(one one cpu) by making ALL system calls optionally asynchronous.
to come: ia64 and power-pc patches, patches for gdb, test program (in tools)
Reviewed by: Almost everyone who counts
(at various times, peter, jhb, matt, alfred, mini, bernd,
and a cast of thousands)
NOTE: this is still Beta code, and contains lots of debugging stuff.
expect slight instability in signals..
2002-06-29 17:26:22 +00:00
|
|
|
char *state;
|
2003-07-31 17:29:42 +00:00
|
|
|
int np, quit;
|
1995-08-20 05:25:11 +00:00
|
|
|
|
1994-08-27 16:28:45 +00:00
|
|
|
np = nprocs;
|
2003-07-31 17:29:42 +00:00
|
|
|
quit = 0;
|
1995-08-20 05:25:11 +00:00
|
|
|
|
2002-04-11 21:01:34 +00:00
|
|
|
/* sx_slock(&allproc_lock); */
|
2000-12-30 22:06:19 +00:00
|
|
|
if (!LIST_EMPTY(&allproc))
|
|
|
|
p = LIST_FIRST(&allproc);
|
1995-08-20 05:25:11 +00:00
|
|
|
else
|
|
|
|
p = &proc0;
|
1994-08-27 16:28:45 +00:00
|
|
|
|
2004-11-01 22:15:15 +00:00
|
|
|
db_setup_paging(db_simple_pager, &quit, db_lines_per_page);
|
2004-11-20 02:32:42 +00:00
|
|
|
db_printf(" pid proc uid ppid pgrp flag stat wmesg wchan cmd\n");
|
2003-07-31 17:29:42 +00:00
|
|
|
while (--np >= 0 && !quit) {
|
1996-06-15 07:08:02 +00:00
|
|
|
if (p == NULL) {
|
|
|
|
printf("oops, ran out of processes early!\n");
|
|
|
|
break;
|
|
|
|
}
|
2002-04-11 21:01:34 +00:00
|
|
|
/* PROC_LOCK(p); */
|
1994-08-27 16:28:45 +00:00
|
|
|
pp = p->p_pptr;
|
1995-08-20 05:25:11 +00:00
|
|
|
if (pp == NULL)
|
1994-08-27 16:28:45 +00:00
|
|
|
pp = p;
|
1995-08-20 05:25:11 +00:00
|
|
|
|
Part 1 of KSE-III
The ability to schedule multiple threads per process
(one one cpu) by making ALL system calls optionally asynchronous.
to come: ia64 and power-pc patches, patches for gdb, test program (in tools)
Reviewed by: Almost everyone who counts
(at various times, peter, jhb, matt, alfred, mini, bernd,
and a cast of thousands)
NOTE: this is still Beta code, and contains lots of debugging stuff.
expect slight instability in signals..
2002-06-29 17:26:22 +00:00
|
|
|
|
|
|
|
switch(p->p_state) {
|
|
|
|
case PRS_NORMAL:
|
|
|
|
if (P_SHOULDSTOP(p))
|
2002-08-13 11:06:54 +00:00
|
|
|
state = "stop";
|
Part 1 of KSE-III
The ability to schedule multiple threads per process
(one one cpu) by making ALL system calls optionally asynchronous.
to come: ia64 and power-pc patches, patches for gdb, test program (in tools)
Reviewed by: Almost everyone who counts
(at various times, peter, jhb, matt, alfred, mini, bernd,
and a cast of thousands)
NOTE: this is still Beta code, and contains lots of debugging stuff.
expect slight instability in signals..
2002-06-29 17:26:22 +00:00
|
|
|
else
|
2003-06-06 20:28:11 +00:00
|
|
|
state = "";
|
Part 1 of KSE-III
The ability to schedule multiple threads per process
(one one cpu) by making ALL system calls optionally asynchronous.
to come: ia64 and power-pc patches, patches for gdb, test program (in tools)
Reviewed by: Almost everyone who counts
(at various times, peter, jhb, matt, alfred, mini, bernd,
and a cast of thousands)
NOTE: this is still Beta code, and contains lots of debugging stuff.
expect slight instability in signals..
2002-06-29 17:26:22 +00:00
|
|
|
break;
|
|
|
|
case PRS_NEW:
|
2002-08-13 11:06:54 +00:00
|
|
|
state = "new ";
|
Part 1 of KSE-III
The ability to schedule multiple threads per process
(one one cpu) by making ALL system calls optionally asynchronous.
to come: ia64 and power-pc patches, patches for gdb, test program (in tools)
Reviewed by: Almost everyone who counts
(at various times, peter, jhb, matt, alfred, mini, bernd,
and a cast of thousands)
NOTE: this is still Beta code, and contains lots of debugging stuff.
expect slight instability in signals..
2002-06-29 17:26:22 +00:00
|
|
|
break;
|
|
|
|
case PRS_ZOMBIE:
|
2002-09-11 08:13:56 +00:00
|
|
|
state = "zomb";
|
Part 1 of KSE-III
The ability to schedule multiple threads per process
(one one cpu) by making ALL system calls optionally asynchronous.
to come: ia64 and power-pc patches, patches for gdb, test program (in tools)
Reviewed by: Almost everyone who counts
(at various times, peter, jhb, matt, alfred, mini, bernd,
and a cast of thousands)
NOTE: this is still Beta code, and contains lots of debugging stuff.
expect slight instability in signals..
2002-06-29 17:26:22 +00:00
|
|
|
break;
|
|
|
|
default:
|
2002-08-13 11:06:54 +00:00
|
|
|
state = "Unkn";
|
Part 1 of KSE-III
The ability to schedule multiple threads per process
(one one cpu) by making ALL system calls optionally asynchronous.
to come: ia64 and power-pc patches, patches for gdb, test program (in tools)
Reviewed by: Almost everyone who counts
(at various times, peter, jhb, matt, alfred, mini, bernd,
and a cast of thousands)
NOTE: this is still Beta code, and contains lots of debugging stuff.
expect slight instability in signals..
2002-06-29 17:26:22 +00:00
|
|
|
break;
|
|
|
|
}
|
2004-11-20 02:32:42 +00:00
|
|
|
db_printf("%5d %8p %4d %5d %5d %07x %s",
|
|
|
|
p->p_pid, (volatile void *)p,
|
2002-08-31 04:25:44 +00:00
|
|
|
p->p_ucred != NULL ? p->p_ucred->cr_ruid : 0, pp->p_pid,
|
|
|
|
p->p_pgrp != NULL ? p->p_pgrp->pg_id : 0, p->p_flag,
|
|
|
|
state);
|
2004-09-05 02:09:54 +00:00
|
|
|
if (p->p_flag & P_HADTHREADS)
|
2001-09-12 22:32:03 +00:00
|
|
|
db_printf("(threaded) %s\n", p->p_comm);
|
2002-09-11 08:13:56 +00:00
|
|
|
FOREACH_THREAD_IN_PROC(p, td) {
|
2002-12-28 01:23:07 +00:00
|
|
|
dumpthread(p, td);
|
2003-07-31 17:29:42 +00:00
|
|
|
if (quit)
|
|
|
|
break;
|
1994-08-27 16:28:45 +00:00
|
|
|
}
|
2002-04-11 21:01:34 +00:00
|
|
|
/* PROC_UNLOCK(p); */
|
|
|
|
|
2000-12-30 22:06:19 +00:00
|
|
|
p = LIST_NEXT(p, p_list);
|
1995-08-20 05:25:11 +00:00
|
|
|
if (p == NULL && np > 0)
|
2000-12-30 22:06:19 +00:00
|
|
|
p = LIST_FIRST(&zombproc);
|
1994-08-27 16:28:45 +00:00
|
|
|
}
|
2002-04-11 21:01:34 +00:00
|
|
|
/* sx_sunlock(&allproc_lock); */
|
1994-08-27 16:28:45 +00:00
|
|
|
}
|
2003-06-06 17:19:27 +00:00
|
|
|
|
2002-12-28 01:23:07 +00:00
|
|
|
static void
|
|
|
|
dumpthread(volatile struct proc *p, volatile struct thread *td)
|
|
|
|
{
|
2003-07-30 20:59:36 +00:00
|
|
|
|
2004-09-05 02:09:54 +00:00
|
|
|
if (p->p_flag & P_HADTHREADS)
|
2002-12-28 01:23:07 +00:00
|
|
|
db_printf( " thread %p ksegrp %p ", td, td->td_ksegrp);
|
Switch the sleep/wakeup and condition variable implementations to use the
sleep queue interface:
- Sleep queues attempt to merge some of the benefits of both sleep queues
and condition variables. Having sleep qeueus in a hash table avoids
having to allocate a queue head for each wait channel. Thus, struct cv
has shrunk down to just a single char * pointer now. However, the
hash table does not hold threads directly, but queue heads. This means
that once you have located a queue in the hash bucket, you no longer have
to walk the rest of the hash chain looking for threads. Instead, you have
a list of all the threads sleeping on that wait channel.
- Outside of the sleepq code and the sleep/cv code the kernel no longer
differentiates between cv's and sleep/wakeup. For example, calls to
abortsleep() and cv_abort() are replaced with a call to sleepq_abort().
Thus, the TDF_CVWAITQ flag is removed. Also, calls to unsleep() and
cv_waitq_remove() have been replaced with calls to sleepq_remove().
- The sched_sleep() function no longer accepts a priority argument as
sleep's no longer inherently bump the priority. Instead, this is soley
a propery of msleep() which explicitly calls sched_prio() before
blocking.
- The TDF_ONSLEEPQ flag has been dropped as it was never used. The
associated TDF_SET_ONSLEEPQ and TDF_CLR_ON_SLEEPQ macros have also been
dropped and replaced with a single explicit clearing of td_wchan.
TD_SET_ONSLEEPQ() would really have only made sense if it had taken
the wait channel and message as arguments anyway. Now that that only
happens in one place, a macro would be overkill.
2004-02-27 18:52:44 +00:00
|
|
|
if (TD_ON_SLEEPQ(td))
|
|
|
|
db_printf("[SLPQ %s %p]", td->td_wmesg, (void *)td->td_wchan);
|
2002-12-28 01:23:07 +00:00
|
|
|
switch (td->td_state) {
|
|
|
|
case TDS_INHIBITED:
|
|
|
|
if (TD_ON_LOCK(td)) {
|
|
|
|
db_printf("[LOCK %6s %8p]",
|
|
|
|
td->td_lockname,
|
|
|
|
(void *)td->td_blocked);
|
|
|
|
}
|
|
|
|
if (TD_IS_SLEEPING(td)) {
|
|
|
|
db_printf("[SLP]");
|
|
|
|
}
|
|
|
|
if (TD_IS_SWAPPED(td)) {
|
|
|
|
db_printf("[SWAP]");
|
|
|
|
}
|
|
|
|
if (TD_IS_SUSPENDED(td)) {
|
|
|
|
db_printf("[SUSP]");
|
|
|
|
}
|
|
|
|
if (TD_AWAITING_INTR(td)) {
|
|
|
|
db_printf("[IWAIT]");
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case TDS_CAN_RUN:
|
|
|
|
db_printf("[Can run]");
|
|
|
|
break;
|
|
|
|
case TDS_RUNQ:
|
|
|
|
db_printf("[RUNQ]");
|
|
|
|
break;
|
|
|
|
case TDS_RUNNING:
|
2003-04-10 17:35:44 +00:00
|
|
|
db_printf("[CPU %d]", td->td_oncpu);
|
2002-12-28 01:23:07 +00:00
|
|
|
break;
|
2003-06-06 17:20:47 +00:00
|
|
|
case TDS_INACTIVE:
|
|
|
|
db_printf("[INACTIVE]");
|
|
|
|
break;
|
2002-12-28 01:23:07 +00:00
|
|
|
default:
|
2003-06-06 17:20:47 +00:00
|
|
|
db_printf("[UNK: %#x]", td->td_state);
|
2002-12-28 01:23:07 +00:00
|
|
|
}
|
2004-09-05 02:09:54 +00:00
|
|
|
if (p->p_flag & P_HADTHREADS) {
|
|
|
|
#ifdef KEF_DIDRUN
|
2002-12-28 01:23:07 +00:00
|
|
|
if (td->td_kse)
|
|
|
|
db_printf("[kse %p]", td->td_kse);
|
2004-09-05 02:09:54 +00:00
|
|
|
#endif
|
2002-12-28 01:23:07 +00:00
|
|
|
db_printf("\n");
|
|
|
|
} else
|
|
|
|
db_printf(" %s\n", p->p_comm);
|
|
|
|
}
|