mirror of
https://github.com/freebsd/freebsd-src
synced 2024-11-05 18:22:52 +00:00
0dbb100b9b
data structure called kse_upcall to manage UPCALL. All KSE binding and loaning code are gone. A thread owns an upcall can collect all completed syscall contexts in its ksegrp, turn itself into UPCALL mode, and takes those contexts back to userland. Any thread without upcall structure has to export their contexts and exit at user boundary. Any thread running in user mode owns an upcall structure, when it enters kernel, if the kse mailbox's current thread pointer is not NULL, then when the thread is blocked in kernel, a new UPCALL thread is created and the upcall structure is transfered to the new UPCALL thread. if the kse mailbox's current thread pointer is NULL, then when a thread is blocked in kernel, no UPCALL thread will be created. Each upcall always has an owner thread. Userland can remove an upcall by calling kse_exit, when all upcalls in ksegrp are removed, the group is atomatically shutdown. An upcall owner thread also exits when process is in exiting state. when an owner thread exits, the upcall it owns is also removed. KSE is a pure scheduler entity. it represents a virtual cpu. when a thread is running, it always has a KSE associated with it. scheduler is free to assign a KSE to thread according thread priority, if thread priority is changed, KSE can be moved from one thread to another. When a ksegrp is created, there is always N KSEs created in the group. the N is the number of physical cpu in the current system. This makes it is possible that even an userland UTS is single CPU safe, threads in kernel still can execute on different cpu in parallel. Userland calls kse_create to add more upcall structures into ksegrp to increase concurrent in userland itself, kernel is not restricted by number of upcalls userland provides. The code hasn't been tested under SMP by author due to lack of hardware. Reviewed by: julian
218 lines
5.5 KiB
C
218 lines
5.5 KiB
C
/*-
|
|
* 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.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 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.
|
|
*
|
|
* $FreeBSD$
|
|
*/
|
|
#include <sys/param.h>
|
|
#include <sys/systm.h>
|
|
#include <sys/lock.h>
|
|
#include <sys/mutex.h>
|
|
#include <sys/proc.h>
|
|
#include <sys/cons.h>
|
|
#include <vm/vm.h>
|
|
#include <vm/vm_param.h>
|
|
#include <vm/pmap.h>
|
|
|
|
#include <ddb/ddb.h>
|
|
static void
|
|
dumpthread(volatile struct proc *p, volatile struct thread *td);
|
|
|
|
void
|
|
db_ps(dummy1, dummy2, dummy3, dummy4)
|
|
db_expr_t dummy1;
|
|
boolean_t dummy2;
|
|
db_expr_t dummy3;
|
|
char * dummy4;
|
|
{
|
|
int np;
|
|
int nl = 0;
|
|
volatile struct proc *p, *pp;
|
|
volatile struct thread *td;
|
|
char *state;
|
|
|
|
np = nprocs;
|
|
|
|
/* sx_slock(&allproc_lock); */
|
|
if (!LIST_EMPTY(&allproc))
|
|
p = LIST_FIRST(&allproc);
|
|
else
|
|
p = &proc0;
|
|
|
|
db_printf(" pid proc addr uid ppid pgrp flag stat wmesg wchan cmd\n");
|
|
while (--np >= 0) {
|
|
/*
|
|
* XXX just take 20 for now...
|
|
*/
|
|
if (nl++ == 20) {
|
|
int c;
|
|
|
|
db_printf("--More--");
|
|
c = cngetc();
|
|
db_printf("\r");
|
|
/*
|
|
* A whole screenfull or just one line?
|
|
*/
|
|
switch (c) {
|
|
case '\n': /* just one line */
|
|
nl = 20;
|
|
break;
|
|
case ' ':
|
|
nl = 0; /* another screenfull */
|
|
break;
|
|
default: /* exit */
|
|
db_printf("\n");
|
|
return;
|
|
}
|
|
}
|
|
if (p == NULL) {
|
|
printf("oops, ran out of processes early!\n");
|
|
break;
|
|
}
|
|
/* PROC_LOCK(p); */
|
|
pp = p->p_pptr;
|
|
if (pp == NULL)
|
|
pp = p;
|
|
|
|
|
|
switch(p->p_state) {
|
|
case PRS_NORMAL:
|
|
if (P_SHOULDSTOP(p))
|
|
state = "stop";
|
|
else
|
|
state = "norm";
|
|
break;
|
|
case PRS_NEW:
|
|
state = "new ";
|
|
break;
|
|
case PRS_ZOMBIE:
|
|
state = "zomb";
|
|
break;
|
|
default:
|
|
state = "Unkn";
|
|
break;
|
|
}
|
|
db_printf("%5d %8p %8p %4d %5d %5d %07x %-4s",
|
|
p->p_pid, (volatile void *)p, (void *)p->p_uarea,
|
|
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);
|
|
if (p->p_flag & P_KSES)
|
|
db_printf("(threaded) %s\n", p->p_comm);
|
|
FOREACH_THREAD_IN_PROC(p, td) {
|
|
dumpthread(p, td);
|
|
}
|
|
/* PROC_UNLOCK(p); */
|
|
|
|
p = LIST_NEXT(p, p_list);
|
|
if (p == NULL && np > 0)
|
|
p = LIST_FIRST(&zombproc);
|
|
}
|
|
/* sx_sunlock(&allproc_lock); */
|
|
}
|
|
static void
|
|
dumpthread(volatile struct proc *p, volatile struct thread *td)
|
|
{
|
|
if (p->p_flag & P_KSES)
|
|
db_printf( " thread %p ksegrp %p ", td, td->td_ksegrp);
|
|
if (TD_ON_SLEEPQ(td)) {
|
|
if (td->td_flags & TDF_CVWAITQ)
|
|
db_printf("[CVQ ");
|
|
else
|
|
db_printf("[SLPQ ");
|
|
db_printf(" %6s %8p]", td->td_wmesg,
|
|
(void *)td->td_wchan);
|
|
}
|
|
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:
|
|
db_printf("[CPU %d]", td->td_kse->ke_oncpu);
|
|
break;
|
|
default:
|
|
panic("unknown thread state");
|
|
}
|
|
if (p->p_flag & P_KSES) {
|
|
if (td->td_kse)
|
|
db_printf("[kse %p]", td->td_kse);
|
|
db_printf("\n");
|
|
} else
|
|
db_printf(" %s\n", p->p_comm);
|
|
}
|
|
|
|
|
|
#define INKERNEL(va) (((vm_offset_t)(va)) >= USRSTACK)
|
|
void
|
|
db_show_one_thread(db_expr_t addr, boolean_t have_addr,
|
|
db_expr_t count, char *modif)
|
|
{
|
|
struct proc *p;
|
|
struct thread *td;
|
|
|
|
if (!have_addr)
|
|
td = curthread;
|
|
else if (!INKERNEL(addr)) {
|
|
printf("bad thread address");
|
|
return;
|
|
} else
|
|
td = (struct thread *)addr;
|
|
/* quick sanity check */
|
|
if ((p = td->td_proc) != td->td_ksegrp->kg_proc)
|
|
return;
|
|
printf("Proc %p ",p);
|
|
dumpthread(p, td);
|
|
#ifdef __i386__
|
|
db_stack_thread((db_expr_t)td, 1, count, modif);
|
|
#endif
|
|
}
|