c2dedaa0a9
should call uma_zfree() with various spinlock helds. Rearranging the code would not help here because we cannot break atomicity respect prcess spinlock, so the only one choice we have is to defer the operation. In order to do this use a global queue synchronized through the kse_lock spinlock which is freed at any thread_alloc() / thread_wait() through a call to thread_reap(). Note that this approach is not ideal as we should want a per-process list of zombie upcalls, but it follows initial guidelines of KSE authors. Tested by: jkim, pav Approved by: jeff, julian Approved by: re
1428 lines
34 KiB
C
1428 lines
34 KiB
C
/*-
|
|
* Copyright (C) 2001 Julian Elischer <julian@freebsd.org>.
|
|
* 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(s), this list of conditions and the following disclaimer as
|
|
* the first lines of this file unmodified other than the possible
|
|
* addition of one or more copyright notices.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice(s), this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER(S) ``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 COPYRIGHT HOLDER(S) 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.
|
|
*/
|
|
|
|
#include <sys/cdefs.h>
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/systm.h>
|
|
#include <sys/kernel.h>
|
|
#include <sys/imgact.h>
|
|
#include <sys/lock.h>
|
|
#include <sys/mutex.h>
|
|
#include <sys/proc.h>
|
|
#include <sys/ptrace.h>
|
|
#include <sys/smp.h>
|
|
#include <sys/syscallsubr.h>
|
|
#include <sys/sysproto.h>
|
|
#include <sys/sched.h>
|
|
#include <sys/signalvar.h>
|
|
#include <sys/sleepqueue.h>
|
|
#include <sys/kse.h>
|
|
#include <sys/ktr.h>
|
|
#include <vm/uma.h>
|
|
|
|
#ifdef KSE
|
|
static uma_zone_t upcall_zone;
|
|
|
|
/* DEBUG ONLY */
|
|
extern int virtual_cpu;
|
|
extern int thread_debug;
|
|
|
|
extern int max_threads_per_proc;
|
|
extern int max_groups_per_proc;
|
|
extern int max_threads_hits;
|
|
extern struct mtx kse_lock;
|
|
|
|
|
|
TAILQ_HEAD(, kse_upcall) zombie_upcalls =
|
|
TAILQ_HEAD_INITIALIZER(zombie_upcalls);
|
|
|
|
static int thread_update_usr_ticks(struct thread *td);
|
|
static void thread_alloc_spare(struct thread *td);
|
|
static struct thread *thread_schedule_upcall(struct thread *td, struct kse_upcall *ku);
|
|
static struct kse_upcall *upcall_alloc(void);
|
|
|
|
|
|
struct mtx kse_lock;
|
|
MTX_SYSINIT(kse_lock, &kse_lock, "kse lock", MTX_SPIN);
|
|
|
|
struct kse_upcall *
|
|
upcall_alloc(void)
|
|
{
|
|
struct kse_upcall *ku;
|
|
|
|
ku = uma_zalloc(upcall_zone, M_WAITOK | M_ZERO);
|
|
return (ku);
|
|
}
|
|
|
|
void
|
|
upcall_reap(void)
|
|
{
|
|
TAILQ_HEAD(, kse_upcall) zupcalls;
|
|
struct kse_upcall *ku_item, *ku_tmp;
|
|
|
|
TAILQ_INIT(&zupcalls);
|
|
mtx_lock_spin(&kse_lock);
|
|
if (!TAILQ_EMPTY(&zombie_upcalls)) {
|
|
TAILQ_CONCAT(&zupcalls, &zombie_upcalls, ku_link);
|
|
TAILQ_INIT(&zombie_upcalls);
|
|
}
|
|
mtx_unlock_spin(&kse_lock);
|
|
TAILQ_FOREACH_SAFE(ku_item, &zupcalls, ku_link, ku_tmp)
|
|
uma_zfree(upcall_zone, ku_item);
|
|
}
|
|
|
|
void
|
|
upcall_remove(struct thread *td)
|
|
{
|
|
|
|
PROC_SLOCK_ASSERT(td->td_proc, MA_OWNED);
|
|
THREAD_LOCK_ASSERT(td, MA_OWNED);
|
|
if (td->td_upcall != NULL) {
|
|
/*
|
|
* If we are not a bound thread then decrement the count of
|
|
* possible upcall sources
|
|
*/
|
|
if (td->td_pflags & TDP_SA)
|
|
td->td_proc->p_numupcalls--;
|
|
mtx_lock_spin(&kse_lock);
|
|
td->td_upcall->ku_owner = NULL;
|
|
TAILQ_REMOVE(&td->td_upcall->ku_proc->p_upcalls, td->td_upcall,
|
|
ku_link);
|
|
TAILQ_INSERT_HEAD(&zombie_upcalls, td->td_upcall, ku_link);
|
|
mtx_unlock_spin(&kse_lock);
|
|
td->td_upcall = NULL;
|
|
}
|
|
}
|
|
#endif
|
|
|
|
#ifndef _SYS_SYSPROTO_H_
|
|
struct kse_switchin_args {
|
|
struct kse_thr_mailbox *tmbx;
|
|
int flags;
|
|
};
|
|
#endif
|
|
|
|
#ifdef KSE
|
|
void
|
|
kse_unlink(struct thread *td)
|
|
{
|
|
mtx_lock_spin(&kse_lock);
|
|
thread_unlink(td);
|
|
mtx_unlock_spin(&kse_lock);
|
|
upcall_remove(td);
|
|
}
|
|
#endif
|
|
|
|
int
|
|
kse_switchin(struct thread *td, struct kse_switchin_args *uap)
|
|
{
|
|
#ifdef KSE
|
|
struct kse_thr_mailbox tmbx;
|
|
struct kse_upcall *ku;
|
|
int error;
|
|
|
|
thread_lock(td);
|
|
if ((ku = td->td_upcall) == NULL || TD_CAN_UNBIND(td)) {
|
|
thread_unlock(td);
|
|
return (EINVAL);
|
|
}
|
|
thread_unlock(td);
|
|
error = (uap->tmbx == NULL) ? EINVAL : 0;
|
|
if (!error)
|
|
error = copyin(uap->tmbx, &tmbx, sizeof(tmbx));
|
|
if (!error && (uap->flags & KSE_SWITCHIN_SETTMBX))
|
|
error = (suword(&ku->ku_mailbox->km_curthread,
|
|
(long)uap->tmbx) != 0 ? EINVAL : 0);
|
|
if (!error)
|
|
error = set_mcontext(td, &tmbx.tm_context.uc_mcontext);
|
|
if (!error) {
|
|
suword32(&uap->tmbx->tm_lwp, td->td_tid);
|
|
if (uap->flags & KSE_SWITCHIN_SETTMBX) {
|
|
td->td_mailbox = uap->tmbx;
|
|
td->td_pflags |= TDP_CAN_UNBIND;
|
|
}
|
|
PROC_LOCK(td->td_proc);
|
|
if (td->td_proc->p_flag & P_TRACED) {
|
|
_PHOLD(td->td_proc);
|
|
if (tmbx.tm_dflags & TMDF_SSTEP)
|
|
ptrace_single_step(td);
|
|
else
|
|
ptrace_clear_single_step(td);
|
|
if (tmbx.tm_dflags & TMDF_SUSPEND) {
|
|
thread_lock(td);
|
|
/* fuword can block, check again */
|
|
if (td->td_upcall)
|
|
ku->ku_flags |= KUF_DOUPCALL;
|
|
thread_unlock(td);
|
|
}
|
|
_PRELE(td->td_proc);
|
|
}
|
|
PROC_UNLOCK(td->td_proc);
|
|
}
|
|
return ((error == 0) ? EJUSTRETURN : error);
|
|
#else /* !KSE */
|
|
return (EOPNOTSUPP);
|
|
#endif
|
|
}
|
|
|
|
/*
|
|
struct kse_thr_interrupt_args {
|
|
struct kse_thr_mailbox * tmbx;
|
|
int cmd;
|
|
long data;
|
|
};
|
|
*/
|
|
int
|
|
kse_thr_interrupt(struct thread *td, struct kse_thr_interrupt_args *uap)
|
|
{
|
|
#ifdef KSE
|
|
struct kse_execve_args args;
|
|
struct image_args iargs;
|
|
struct proc *p;
|
|
struct thread *td2;
|
|
struct kse_upcall *ku;
|
|
struct kse_thr_mailbox *tmbx;
|
|
uint32_t flags;
|
|
int error;
|
|
|
|
p = td->td_proc;
|
|
|
|
PROC_LOCK(p);
|
|
if (!(p->p_flag & P_SA)) {
|
|
PROC_UNLOCK(p);
|
|
return (EINVAL);
|
|
}
|
|
PROC_UNLOCK(p);
|
|
|
|
switch (uap->cmd) {
|
|
case KSE_INTR_SENDSIG:
|
|
if (uap->data < 0 || uap->data > _SIG_MAXSIG)
|
|
return (EINVAL);
|
|
case KSE_INTR_INTERRUPT:
|
|
case KSE_INTR_RESTART:
|
|
PROC_LOCK(p);
|
|
PROC_SLOCK(p);
|
|
FOREACH_THREAD_IN_PROC(p, td2) {
|
|
if (td2->td_mailbox == uap->tmbx)
|
|
break;
|
|
}
|
|
if (td2 == NULL) {
|
|
PROC_SUNLOCK(p);
|
|
PROC_UNLOCK(p);
|
|
return (ESRCH);
|
|
}
|
|
thread_lock(td2);
|
|
PROC_SUNLOCK(p);
|
|
if (uap->cmd == KSE_INTR_SENDSIG) {
|
|
if (uap->data > 0) {
|
|
td2->td_flags &= ~TDF_INTERRUPT;
|
|
thread_unlock(td2);
|
|
tdsignal(p, td2, (int)uap->data, NULL);
|
|
} else {
|
|
thread_unlock(td2);
|
|
}
|
|
} else {
|
|
td2->td_flags |= TDF_INTERRUPT | TDF_ASTPENDING;
|
|
if (TD_CAN_UNBIND(td2))
|
|
td2->td_upcall->ku_flags |= KUF_DOUPCALL;
|
|
if (uap->cmd == KSE_INTR_INTERRUPT)
|
|
td2->td_intrval = EINTR;
|
|
else
|
|
td2->td_intrval = ERESTART;
|
|
if (TD_ON_SLEEPQ(td2) && (td2->td_flags & TDF_SINTR))
|
|
sleepq_abort(td2, td2->td_intrval);
|
|
thread_unlock(td2);
|
|
}
|
|
PROC_UNLOCK(p);
|
|
break;
|
|
case KSE_INTR_SIGEXIT:
|
|
if (uap->data < 1 || uap->data > _SIG_MAXSIG)
|
|
return (EINVAL);
|
|
PROC_LOCK(p);
|
|
sigexit(td, (int)uap->data);
|
|
break;
|
|
|
|
case KSE_INTR_DBSUSPEND:
|
|
/* this sub-function is only for bound thread */
|
|
if (td->td_pflags & TDP_SA)
|
|
return (EINVAL);
|
|
thread_lock(td);
|
|
ku = td->td_upcall;
|
|
thread_unlock(td);
|
|
tmbx = (void *)fuword((void *)&ku->ku_mailbox->km_curthread);
|
|
if (tmbx == NULL || tmbx == (void *)-1)
|
|
return (EINVAL);
|
|
flags = 0;
|
|
PROC_LOCK(p);
|
|
while ((p->p_flag & P_TRACED) && !(p->p_flag & P_SINGLE_EXIT)) {
|
|
flags = fuword32(&tmbx->tm_dflags);
|
|
if (!(flags & TMDF_SUSPEND))
|
|
break;
|
|
PROC_SLOCK(p);
|
|
thread_stopped(p);
|
|
PROC_UNLOCK(p);
|
|
thread_lock(td);
|
|
thread_suspend_one(td);
|
|
PROC_SUNLOCK(p);
|
|
mi_switch(SW_VOL, NULL);
|
|
thread_unlock(td);
|
|
PROC_LOCK(p);
|
|
}
|
|
PROC_UNLOCK(p);
|
|
return (0);
|
|
|
|
case KSE_INTR_EXECVE:
|
|
error = copyin((void *)uap->data, &args, sizeof(args));
|
|
if (error)
|
|
return (error);
|
|
error = exec_copyin_args(&iargs, args.path, UIO_USERSPACE,
|
|
args.argv, args.envp);
|
|
if (error == 0)
|
|
error = kern_execve(td, &iargs, NULL);
|
|
if (error == 0) {
|
|
PROC_LOCK(p);
|
|
SIGSETOR(td->td_siglist, args.sigpend);
|
|
PROC_UNLOCK(p);
|
|
kern_sigprocmask(td, SIG_SETMASK, &args.sigmask, NULL,
|
|
0);
|
|
}
|
|
return (error);
|
|
|
|
default:
|
|
return (EINVAL);
|
|
}
|
|
return (0);
|
|
#else /* !KSE */
|
|
return (EOPNOTSUPP);
|
|
#endif
|
|
}
|
|
|
|
/*
|
|
struct kse_exit_args {
|
|
register_t dummy;
|
|
};
|
|
*/
|
|
int
|
|
kse_exit(struct thread *td, struct kse_exit_args *uap)
|
|
{
|
|
#ifdef KSE
|
|
struct proc *p;
|
|
struct kse_upcall *ku, *ku2;
|
|
int error, count;
|
|
|
|
p = td->td_proc;
|
|
/*
|
|
* Ensure that this is only called from the UTS
|
|
*/
|
|
thread_lock(td);
|
|
if ((ku = td->td_upcall) == NULL || TD_CAN_UNBIND(td)) {
|
|
thread_unlock(td);
|
|
return (EINVAL);
|
|
}
|
|
thread_unlock(td);
|
|
|
|
/*
|
|
* Calculate the existing non-exiting upcalls in this process.
|
|
* If we are the last upcall but there are still other threads,
|
|
* then do not exit. We need the other threads to be able to
|
|
* complete whatever they are doing.
|
|
* XXX This relies on the userland knowing what to do if we return.
|
|
* It may be a better choice to convert ourselves into a kse_release
|
|
* ( or similar) and wait in the kernel to be needed.
|
|
* XXX Where are those other threads? I suppose they are waiting in
|
|
* the kernel. We should wait for them all at the user boundary after
|
|
* turning into an exit.
|
|
*/
|
|
count = 0;
|
|
PROC_LOCK(p);
|
|
PROC_SLOCK(p);
|
|
FOREACH_UPCALL_IN_PROC(p, ku2) {
|
|
if ((ku2->ku_flags & KUF_EXITING) == 0)
|
|
count++;
|
|
}
|
|
if (count == 1 && (p->p_numthreads > 1)) {
|
|
PROC_SUNLOCK(p);
|
|
PROC_UNLOCK(p);
|
|
return (EDEADLK);
|
|
}
|
|
ku->ku_flags |= KUF_EXITING;
|
|
PROC_SUNLOCK(p);
|
|
PROC_UNLOCK(p);
|
|
|
|
/*
|
|
* Mark the UTS mailbox as having been finished with.
|
|
* If that fails then just go for a segfault.
|
|
* XXX need to check it that can be deliverred without a mailbox.
|
|
*/
|
|
error = suword32(&ku->ku_mailbox->km_flags, ku->ku_mflags|KMF_DONE);
|
|
if (!(td->td_pflags & TDP_SA))
|
|
if (suword32(&td->td_mailbox->tm_lwp, 0))
|
|
error = EFAULT;
|
|
PROC_LOCK(p);
|
|
if (error)
|
|
psignal(p, SIGSEGV);
|
|
sigqueue_flush(&td->td_sigqueue);
|
|
PROC_SLOCK(p);
|
|
thread_lock(td);
|
|
upcall_remove(td);
|
|
thread_unlock(td);
|
|
if (p->p_numthreads != 1) {
|
|
thread_stopped(p);
|
|
thread_exit();
|
|
/* NOTREACHED */
|
|
}
|
|
/*
|
|
* This is the last thread. Just return to the user.
|
|
* Effectively we have left threading mode..
|
|
* The only real thing left to do is ensure that the
|
|
* scheduler sets out concurrency back to 1 as that may be a
|
|
* resource leak otherwise.
|
|
* This is an A[PB]I issue.. what SHOULD we do?
|
|
* One possibility is to return to the user. It may not cope well.
|
|
* The other possibility would be to let the process exit.
|
|
*/
|
|
thread_unthread(td);
|
|
PROC_SUNLOCK(p);
|
|
PROC_UNLOCK(p);
|
|
#if 0
|
|
return (0);
|
|
#else
|
|
printf("kse_exit: called on last thread. Calling exit1()");
|
|
exit1(td, 0);
|
|
#endif
|
|
#else /* !KSE */
|
|
return (EOPNOTSUPP);
|
|
#endif
|
|
}
|
|
|
|
/*
|
|
* Either becomes an upcall or waits for an awakening event and
|
|
* then becomes an upcall. Only error cases return.
|
|
*/
|
|
/*
|
|
struct kse_release_args {
|
|
struct timespec *timeout;
|
|
};
|
|
*/
|
|
int
|
|
kse_release(struct thread *td, struct kse_release_args *uap)
|
|
{
|
|
#ifdef KSE
|
|
struct proc *p;
|
|
struct kse_upcall *ku;
|
|
struct timespec timeout;
|
|
struct timeval tv;
|
|
sigset_t sigset;
|
|
int error;
|
|
|
|
p = td->td_proc;
|
|
thread_lock(td);
|
|
if ((ku = td->td_upcall) == NULL || TD_CAN_UNBIND(td)) {
|
|
thread_unlock(td);
|
|
printf("kse_release: called outside of threading. exiting");
|
|
exit1(td, 0);
|
|
}
|
|
thread_unlock(td);
|
|
if (uap->timeout != NULL) {
|
|
if ((error = copyin(uap->timeout, &timeout, sizeof(timeout))))
|
|
return (error);
|
|
TIMESPEC_TO_TIMEVAL(&tv, &timeout);
|
|
}
|
|
if (td->td_pflags & TDP_SA)
|
|
td->td_pflags |= TDP_UPCALLING;
|
|
else {
|
|
ku->ku_mflags = fuword32(&ku->ku_mailbox->km_flags);
|
|
if (ku->ku_mflags == -1) {
|
|
PROC_LOCK(p);
|
|
sigexit(td, SIGSEGV);
|
|
}
|
|
}
|
|
PROC_LOCK(p);
|
|
if (ku->ku_mflags & KMF_WAITSIGEVENT) {
|
|
/* UTS wants to wait for signal event */
|
|
if (!(p->p_flag & P_SIGEVENT) &&
|
|
!(ku->ku_flags & KUF_DOUPCALL)) {
|
|
td->td_kflags |= TDK_KSERELSIG;
|
|
error = msleep(&p->p_siglist, &p->p_mtx, PPAUSE|PCATCH,
|
|
"ksesigwait", (uap->timeout ? tvtohz(&tv) : 0));
|
|
td->td_kflags &= ~(TDK_KSERELSIG | TDK_WAKEUP);
|
|
}
|
|
p->p_flag &= ~P_SIGEVENT;
|
|
sigset = p->p_siglist;
|
|
PROC_UNLOCK(p);
|
|
error = copyout(&sigset, &ku->ku_mailbox->km_sigscaught,
|
|
sizeof(sigset));
|
|
} else {
|
|
if ((ku->ku_flags & KUF_DOUPCALL) == 0 &&
|
|
((ku->ku_mflags & KMF_NOCOMPLETED) ||
|
|
(p->p_completed == NULL))) {
|
|
p->p_upsleeps++;
|
|
td->td_kflags |= TDK_KSEREL;
|
|
error = msleep(&p->p_completed, &p->p_mtx,
|
|
PPAUSE|PCATCH, "kserel",
|
|
(uap->timeout ? tvtohz(&tv) : 0));
|
|
td->td_kflags &= ~(TDK_KSEREL | TDK_WAKEUP);
|
|
p->p_upsleeps--;
|
|
}
|
|
PROC_UNLOCK(p);
|
|
}
|
|
if (ku->ku_flags & KUF_DOUPCALL) {
|
|
PROC_SLOCK(p);
|
|
ku->ku_flags &= ~KUF_DOUPCALL;
|
|
PROC_SUNLOCK(p);
|
|
}
|
|
return (0);
|
|
#else /* !KSE */
|
|
return (EOPNOTSUPP);
|
|
#endif
|
|
}
|
|
|
|
/* struct kse_wakeup_args {
|
|
struct kse_mailbox *mbx;
|
|
}; */
|
|
int
|
|
kse_wakeup(struct thread *td, struct kse_wakeup_args *uap)
|
|
{
|
|
#ifdef KSE
|
|
struct proc *p;
|
|
struct kse_upcall *ku;
|
|
struct thread *td2;
|
|
|
|
p = td->td_proc;
|
|
td2 = NULL;
|
|
ku = NULL;
|
|
/* KSE-enabled processes only, please. */
|
|
PROC_LOCK(p);
|
|
if (!(p->p_flag & P_SA)) {
|
|
PROC_UNLOCK(p);
|
|
return (EINVAL);
|
|
}
|
|
PROC_SLOCK(p);
|
|
if (uap->mbx) {
|
|
FOREACH_UPCALL_IN_PROC(p, ku) {
|
|
if (ku->ku_mailbox == uap->mbx)
|
|
break;
|
|
}
|
|
} else {
|
|
if (p->p_upsleeps) {
|
|
PROC_SUNLOCK(p);
|
|
wakeup(&p->p_completed);
|
|
PROC_UNLOCK(p);
|
|
return (0);
|
|
}
|
|
ku = TAILQ_FIRST(&p->p_upcalls);
|
|
}
|
|
if (ku == NULL) {
|
|
PROC_SUNLOCK(p);
|
|
PROC_UNLOCK(p);
|
|
return (ESRCH);
|
|
}
|
|
mtx_lock_spin(&kse_lock);
|
|
if ((td2 = ku->ku_owner) == NULL) {
|
|
mtx_unlock_spin(&kse_lock);
|
|
PROC_SUNLOCK(p);
|
|
PROC_UNLOCK(p);
|
|
panic("%s: no owner", __func__);
|
|
} else if (td2->td_kflags & (TDK_KSEREL | TDK_KSERELSIG)) {
|
|
mtx_unlock_spin(&kse_lock);
|
|
if (!(td2->td_kflags & TDK_WAKEUP)) {
|
|
td2->td_kflags |= TDK_WAKEUP;
|
|
if (td2->td_kflags & TDK_KSEREL)
|
|
sleepq_remove(td2, &p->p_completed);
|
|
else
|
|
sleepq_remove(td2, &p->p_siglist);
|
|
}
|
|
} else {
|
|
ku->ku_flags |= KUF_DOUPCALL;
|
|
mtx_unlock_spin(&kse_lock);
|
|
}
|
|
PROC_SUNLOCK(p);
|
|
PROC_UNLOCK(p);
|
|
return (0);
|
|
#else /* !KSE */
|
|
return (EOPNOTSUPP);
|
|
#endif
|
|
}
|
|
|
|
/*
|
|
* newgroup == 0: first call: use current KSE, don't schedule an upcall
|
|
* All other situations, do allocate max new KSEs and schedule an upcall.
|
|
*
|
|
* XXX should be changed so that 'first' behaviour lasts for as long
|
|
* as you have not made a thread in this proc. i.e. as long as we do not have
|
|
* a mailbox..
|
|
*/
|
|
/* struct kse_create_args {
|
|
struct kse_mailbox *mbx;
|
|
int newgroup;
|
|
}; */
|
|
int
|
|
kse_create(struct thread *td, struct kse_create_args *uap)
|
|
{
|
|
#ifdef KSE
|
|
struct proc *p;
|
|
struct kse_mailbox mbx;
|
|
struct kse_upcall *newku;
|
|
int err, ncpus, sa = 0, first = 0;
|
|
struct thread *newtd;
|
|
|
|
p = td->td_proc;
|
|
|
|
/*
|
|
* Processes using the other threading model can't
|
|
* suddenly start calling this one
|
|
* XXX maybe...
|
|
*/
|
|
PROC_LOCK(p);
|
|
if ((p->p_flag & (P_SA|P_HADTHREADS)) == P_HADTHREADS) {
|
|
PROC_UNLOCK(p);
|
|
return (EINVAL);
|
|
}
|
|
if (!(p->p_flag & P_SA)) {
|
|
first = 1;
|
|
p->p_flag |= P_SA|P_HADTHREADS;
|
|
}
|
|
PROC_UNLOCK(p);
|
|
|
|
if ((err = copyin(uap->mbx, &mbx, sizeof(mbx))))
|
|
return (err);
|
|
|
|
ncpus = mp_ncpus;
|
|
if (virtual_cpu != 0)
|
|
ncpus = virtual_cpu;
|
|
/*
|
|
* If the new UTS mailbox says that this
|
|
* will be a BOUND lwp, then it had better
|
|
* have its thread mailbox already there.
|
|
*/
|
|
if ((mbx.km_flags & KMF_BOUND) || uap->newgroup) {
|
|
/* It's a bound thread (1:1) */
|
|
if (mbx.km_curthread == NULL)
|
|
return (EINVAL);
|
|
ncpus = 1;
|
|
if (!(uap->newgroup || first))
|
|
return (EINVAL);
|
|
} else {
|
|
/* It's an upcall capable thread */
|
|
sa = TDP_SA;
|
|
PROC_LOCK(p);
|
|
/*
|
|
* Limit it to NCPU upcall contexts per proc in any case.
|
|
* numupcalls will soon be numkse or something
|
|
* as it will represent the number of
|
|
* non-bound upcalls available. (i.e. ones that can
|
|
* actually call up).
|
|
*/
|
|
if (p->p_numupcalls >= ncpus) {
|
|
PROC_UNLOCK(p);
|
|
return (EPROCLIM);
|
|
}
|
|
p->p_numupcalls++;
|
|
PROC_UNLOCK(p);
|
|
}
|
|
|
|
/*
|
|
* Even bound LWPs get a mailbox and an upcall to hold it.
|
|
* XXX This should change.
|
|
*/
|
|
newku = upcall_alloc();
|
|
newku->ku_mailbox = uap->mbx;
|
|
newku->ku_func = mbx.km_func;
|
|
bcopy(&mbx.km_stack, &newku->ku_stack, sizeof(stack_t));
|
|
|
|
/*
|
|
* For the first call this may not have been set.
|
|
* Of course nor may it actually be needed.
|
|
* thread_schedule_upcall() will look for it.
|
|
*/
|
|
if (td->td_standin == NULL)
|
|
thread_alloc_spare(td);
|
|
PROC_LOCK(p);
|
|
PROC_SLOCK(p);
|
|
/*
|
|
* If we are the first time, and a normal thread,
|
|
* then transfer all the signals back to the 'process'.
|
|
* SA threading will make a special thread to handle them.
|
|
*/
|
|
if (first) {
|
|
sigqueue_move_set(&td->td_sigqueue, &p->p_sigqueue,
|
|
&td->td_sigqueue.sq_signals);
|
|
SIGFILLSET(td->td_sigmask);
|
|
SIG_CANTMASK(td->td_sigmask);
|
|
}
|
|
|
|
/*
|
|
* Make the new upcall available to the process.
|
|
* It may or may not use it, but it's available.
|
|
*/
|
|
TAILQ_INSERT_TAIL(&p->p_upcalls, newku, ku_link);
|
|
newku->ku_proc = p;
|
|
PROC_UNLOCK(p);
|
|
if (mbx.km_quantum)
|
|
/* XXX should this be in the thread? */
|
|
p->p_upquantum = max(1, mbx.km_quantum / tick);
|
|
|
|
/*
|
|
* Each upcall structure has an owner thread, find which
|
|
* one owns it.
|
|
*/
|
|
thread_lock(td);
|
|
mtx_lock_spin(&kse_lock);
|
|
if (uap->newgroup) {
|
|
/*
|
|
* The newgroup parameter now means
|
|
* "bound, non SA, system scope"
|
|
* It is only used for the interrupt thread at the
|
|
* moment I think.. (or system scope threads dopey).
|
|
* We'll rename it later.
|
|
*/
|
|
newtd = thread_schedule_upcall(td, newku);
|
|
} else {
|
|
/*
|
|
* If the current thread hasn't an upcall structure,
|
|
* just assign the upcall to it.
|
|
* It'll just return.
|
|
*/
|
|
if (td->td_upcall == NULL) {
|
|
newku->ku_owner = td;
|
|
td->td_upcall = newku;
|
|
newtd = td;
|
|
} else {
|
|
/*
|
|
* Create a new upcall thread to own it.
|
|
*/
|
|
newtd = thread_schedule_upcall(td, newku);
|
|
}
|
|
}
|
|
mtx_unlock_spin(&kse_lock);
|
|
thread_unlock(td);
|
|
PROC_SUNLOCK(p);
|
|
|
|
/*
|
|
* Let the UTS instance know its LWPID.
|
|
* It doesn't really care. But the debugger will.
|
|
* XXX warning.. remember that this moves.
|
|
*/
|
|
suword32(&newku->ku_mailbox->km_lwp, newtd->td_tid);
|
|
|
|
/*
|
|
* In the same manner, if the UTS has a current user thread,
|
|
* then it is also running on this LWP so set it as well.
|
|
* The library could do that of course.. but why not..
|
|
* XXX I'm not sure this can ever happen but ...
|
|
* XXX does the UTS ever set this in the mailbox before calling this?
|
|
*/
|
|
if (mbx.km_curthread)
|
|
suword32(&mbx.km_curthread->tm_lwp, newtd->td_tid);
|
|
|
|
if (sa) {
|
|
newtd->td_pflags |= TDP_SA;
|
|
/*
|
|
* If we are starting a new thread, kick it off.
|
|
*/
|
|
if (newtd != td) {
|
|
thread_lock(newtd);
|
|
sched_add(newtd, SRQ_BORING);
|
|
thread_unlock(newtd);
|
|
}
|
|
} else {
|
|
newtd->td_pflags &= ~TDP_SA;
|
|
|
|
/*
|
|
* Since a library will use the mailbox pointer to
|
|
* identify even a bound thread, and the mailbox pointer
|
|
* will never be allowed to change after this syscall
|
|
* for a bound thread, set it here so the library can
|
|
* find the thread after the syscall returns.
|
|
*/
|
|
newtd->td_mailbox = mbx.km_curthread;
|
|
|
|
if (newtd != td) {
|
|
/*
|
|
* If we did create a new thread then
|
|
* make sure it goes to the right place
|
|
* when it starts up, and make sure that it runs
|
|
* at full speed when it gets there.
|
|
* thread_schedule_upcall() copies all cpu state
|
|
* to the new thread, so we should clear single step
|
|
* flag here.
|
|
*/
|
|
cpu_set_upcall_kse(newtd, newku->ku_func,
|
|
newku->ku_mailbox, &newku->ku_stack);
|
|
PROC_LOCK(p);
|
|
if (p->p_flag & P_TRACED) {
|
|
_PHOLD(p);
|
|
ptrace_clear_single_step(newtd);
|
|
_PRELE(p);
|
|
}
|
|
PROC_UNLOCK(p);
|
|
thread_lock(newtd);
|
|
sched_add(newtd, SRQ_BORING);
|
|
thread_unlock(newtd);
|
|
}
|
|
}
|
|
return (0);
|
|
#else /* !KSE */
|
|
return (EOPNOTSUPP);
|
|
#endif
|
|
}
|
|
|
|
#ifdef KSE
|
|
/*
|
|
* Initialize global thread allocation resources.
|
|
*/
|
|
void
|
|
kseinit(void)
|
|
{
|
|
|
|
upcall_zone = uma_zcreate("UPCALL", sizeof(struct kse_upcall),
|
|
NULL, NULL, NULL, NULL, UMA_ALIGN_CACHE, 0);
|
|
}
|
|
|
|
/*
|
|
* Store the thread context in the UTS's mailbox.
|
|
* then add the mailbox at the head of a list we are building in user space.
|
|
* The list is anchored in the proc structure.
|
|
*/
|
|
int
|
|
thread_export_context(struct thread *td, int willexit)
|
|
{
|
|
struct proc *p;
|
|
uintptr_t mbx;
|
|
void *addr;
|
|
int error = 0, sig;
|
|
mcontext_t mc;
|
|
|
|
p = td->td_proc;
|
|
|
|
/*
|
|
* Post sync signal, or process SIGKILL and SIGSTOP.
|
|
* For sync signal, it is only possible when the signal is not
|
|
* caught by userland or process is being debugged.
|
|
*/
|
|
PROC_LOCK(p);
|
|
if (td->td_flags & TDF_NEEDSIGCHK) {
|
|
thread_lock(td);
|
|
td->td_flags &= ~TDF_NEEDSIGCHK;
|
|
thread_unlock(td);
|
|
mtx_lock(&p->p_sigacts->ps_mtx);
|
|
while ((sig = cursig(td)) != 0)
|
|
postsig(sig);
|
|
mtx_unlock(&p->p_sigacts->ps_mtx);
|
|
}
|
|
if (willexit)
|
|
SIGFILLSET(td->td_sigmask);
|
|
PROC_UNLOCK(p);
|
|
|
|
/* Export the user/machine context. */
|
|
get_mcontext(td, &mc, 0);
|
|
addr = (void *)(&td->td_mailbox->tm_context.uc_mcontext);
|
|
error = copyout(&mc, addr, sizeof(mcontext_t));
|
|
if (error)
|
|
goto bad;
|
|
|
|
addr = (caddr_t)(&td->td_mailbox->tm_lwp);
|
|
if (suword32(addr, 0)) {
|
|
error = EFAULT;
|
|
goto bad;
|
|
}
|
|
|
|
/* Get address in latest mbox of list pointer */
|
|
addr = (void *)(&td->td_mailbox->tm_next);
|
|
/*
|
|
* Put the saved address of the previous first
|
|
* entry into this one
|
|
*/
|
|
for (;;) {
|
|
mbx = (uintptr_t)p->p_completed;
|
|
if (suword(addr, mbx)) {
|
|
error = EFAULT;
|
|
goto bad;
|
|
}
|
|
PROC_LOCK(p);
|
|
if (mbx == (uintptr_t)p->p_completed) {
|
|
thread_lock(td);
|
|
p->p_completed = td->td_mailbox;
|
|
/*
|
|
* The thread context may be taken away by
|
|
* other upcall threads when we unlock
|
|
* process lock. it's no longer valid to
|
|
* use it again in any other places.
|
|
*/
|
|
td->td_mailbox = NULL;
|
|
thread_unlock(td);
|
|
PROC_UNLOCK(p);
|
|
break;
|
|
}
|
|
PROC_UNLOCK(p);
|
|
}
|
|
td->td_usticks = 0;
|
|
return (0);
|
|
|
|
bad:
|
|
PROC_LOCK(p);
|
|
sigexit(td, SIGILL);
|
|
return (error);
|
|
}
|
|
|
|
/*
|
|
* Take the list of completed mailboxes for this Process and put them on this
|
|
* upcall's mailbox as it's the next one going up.
|
|
*/
|
|
static int
|
|
thread_link_mboxes(struct proc *p, struct kse_upcall *ku)
|
|
{
|
|
void *addr;
|
|
uintptr_t mbx;
|
|
|
|
addr = (void *)(&ku->ku_mailbox->km_completed);
|
|
for (;;) {
|
|
mbx = (uintptr_t)p->p_completed;
|
|
if (suword(addr, mbx)) {
|
|
PROC_LOCK(p);
|
|
psignal(p, SIGSEGV);
|
|
PROC_UNLOCK(p);
|
|
return (EFAULT);
|
|
}
|
|
PROC_LOCK(p);
|
|
if (mbx == (uintptr_t)p->p_completed) {
|
|
p->p_completed = NULL;
|
|
PROC_UNLOCK(p);
|
|
break;
|
|
}
|
|
PROC_UNLOCK(p);
|
|
}
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* This function should be called at statclock interrupt time
|
|
*/
|
|
int
|
|
thread_statclock(int user)
|
|
{
|
|
struct thread *td = curthread;
|
|
|
|
if (!(td->td_pflags & TDP_SA))
|
|
return (0);
|
|
if (user) {
|
|
/* Current always do via ast() */
|
|
thread_lock(td);
|
|
td->td_flags |= TDF_ASTPENDING;
|
|
thread_unlock(td);
|
|
td->td_uuticks++;
|
|
} else if (td->td_mailbox != NULL)
|
|
td->td_usticks++;
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* Export state clock ticks for userland
|
|
*/
|
|
static int
|
|
thread_update_usr_ticks(struct thread *td)
|
|
{
|
|
struct proc *p = td->td_proc;
|
|
caddr_t addr;
|
|
u_int uticks;
|
|
|
|
thread_lock(td);
|
|
if (td->td_mailbox == NULL) {
|
|
thread_unlock(td);
|
|
return (-1);
|
|
}
|
|
thread_unlock(td);
|
|
|
|
if ((uticks = td->td_uuticks) != 0) {
|
|
td->td_uuticks = 0;
|
|
addr = (caddr_t)&td->td_mailbox->tm_uticks;
|
|
if (suword32(addr, uticks+fuword32(addr)))
|
|
goto error;
|
|
}
|
|
if ((uticks = td->td_usticks) != 0) {
|
|
td->td_usticks = 0;
|
|
addr = (caddr_t)&td->td_mailbox->tm_sticks;
|
|
if (suword32(addr, uticks+fuword32(addr)))
|
|
goto error;
|
|
}
|
|
return (0);
|
|
|
|
error:
|
|
PROC_LOCK(p);
|
|
psignal(p, SIGSEGV);
|
|
PROC_UNLOCK(p);
|
|
return (-2);
|
|
}
|
|
|
|
/*
|
|
* This function is intended to be used to initialize a spare thread
|
|
* for upcall. Initialize thread's large data area outside the thread lock
|
|
* for thread_schedule_upcall(). The crhold is also here to get it out
|
|
* from the schedlock as it has a mutex op itself.
|
|
* XXX BUG.. we need to get the cr ref after the thread has
|
|
* checked and chenged its own, not 6 months before...
|
|
*/
|
|
void
|
|
thread_alloc_spare(struct thread *td)
|
|
{
|
|
struct thread *spare;
|
|
|
|
if (td->td_standin)
|
|
return;
|
|
spare = thread_alloc();
|
|
td->td_standin = spare;
|
|
bzero(&spare->td_startzero,
|
|
__rangeof(struct thread, td_startzero, td_endzero));
|
|
spare->td_proc = td->td_proc;
|
|
spare->td_ucred = crhold(td->td_ucred);
|
|
}
|
|
|
|
/*
|
|
* Create a thread and schedule it for upcall on the KSE given.
|
|
* Use our thread's standin so that we don't have to allocate one.
|
|
*/
|
|
struct thread *
|
|
thread_schedule_upcall(struct thread *td, struct kse_upcall *ku)
|
|
{
|
|
struct thread *td2;
|
|
|
|
THREAD_LOCK_ASSERT(td, MA_OWNED);
|
|
mtx_assert(&kse_lock, MA_OWNED);
|
|
/*
|
|
* Schedule an upcall thread on specified kse_upcall,
|
|
* the kse_upcall must be free.
|
|
* td must have a spare thread.
|
|
*/
|
|
KASSERT(ku->ku_owner == NULL, ("%s: upcall has owner", __func__));
|
|
if ((td2 = td->td_standin) != NULL) {
|
|
td->td_standin = NULL;
|
|
} else {
|
|
panic("no reserve thread when scheduling an upcall");
|
|
return (NULL);
|
|
}
|
|
CTR3(KTR_PROC, "thread_schedule_upcall: thread %p (pid %d, %s)",
|
|
td2, td->td_proc->p_pid, td->td_proc->p_comm);
|
|
/*
|
|
* Bzero already done in thread_alloc_spare() because we can't
|
|
* do the crhold here because we are in schedlock already.
|
|
*/
|
|
bcopy(&td->td_startcopy, &td2->td_startcopy,
|
|
__rangeof(struct thread, td_startcopy, td_endcopy));
|
|
sched_fork_thread(td, td2);
|
|
thread_link(td2, ku->ku_proc);
|
|
/* inherit parts of blocked thread's context as a good template */
|
|
cpu_set_upcall(td2, td);
|
|
/* Let the new thread become owner of the upcall */
|
|
ku->ku_owner = td2;
|
|
td2->td_upcall = ku;
|
|
td2->td_flags = 0;
|
|
td2->td_pflags = TDP_SA|TDP_UPCALLING;
|
|
td2->td_state = TDS_CAN_RUN;
|
|
td2->td_inhibitors = 0;
|
|
SIGFILLSET(td2->td_sigmask);
|
|
SIG_CANTMASK(td2->td_sigmask);
|
|
return (td2); /* bogus.. should be a void function */
|
|
}
|
|
|
|
/*
|
|
* It is only used when thread generated a trap and process is being
|
|
* debugged.
|
|
*/
|
|
void
|
|
thread_signal_add(struct thread *td, ksiginfo_t *ksi)
|
|
{
|
|
struct proc *p;
|
|
struct sigacts *ps;
|
|
int error;
|
|
|
|
p = td->td_proc;
|
|
PROC_LOCK_ASSERT(p, MA_OWNED);
|
|
ps = p->p_sigacts;
|
|
mtx_assert(&ps->ps_mtx, MA_OWNED);
|
|
|
|
mtx_unlock(&ps->ps_mtx);
|
|
SIGADDSET(td->td_sigmask, ksi->ksi_signo);
|
|
PROC_UNLOCK(p);
|
|
error = copyout(&ksi->ksi_info, &td->td_mailbox->tm_syncsig,
|
|
sizeof(siginfo_t));
|
|
if (error) {
|
|
PROC_LOCK(p);
|
|
sigexit(td, SIGSEGV);
|
|
}
|
|
PROC_LOCK(p);
|
|
mtx_lock(&ps->ps_mtx);
|
|
}
|
|
#include "opt_sched.h"
|
|
struct thread *
|
|
thread_switchout(struct thread *td, int flags, struct thread *nextthread)
|
|
{
|
|
struct kse_upcall *ku;
|
|
struct thread *td2;
|
|
|
|
THREAD_LOCK_ASSERT(td, MA_OWNED);
|
|
|
|
/*
|
|
* If the outgoing thread is in threaded group and has never
|
|
* scheduled an upcall, decide whether this is a short
|
|
* or long term event and thus whether or not to schedule
|
|
* an upcall.
|
|
* If it is a short term event, just suspend it in
|
|
* a way that takes its KSE with it.
|
|
* Select the events for which we want to schedule upcalls.
|
|
* For now it's just sleep or if thread is suspended but
|
|
* process wide suspending flag is not set (debugger
|
|
* suspends thread).
|
|
* XXXKSE eventually almost any inhibition could do.
|
|
*/
|
|
if (TD_CAN_UNBIND(td) && (td->td_standin) &&
|
|
(TD_ON_SLEEPQ(td) || (TD_IS_SUSPENDED(td) &&
|
|
!P_SHOULDSTOP(td->td_proc)))) {
|
|
/*
|
|
* Release ownership of upcall, and schedule an upcall
|
|
* thread, this new upcall thread becomes the owner of
|
|
* the upcall structure. It will be ahead of us in the
|
|
* run queue, so as we are stopping, it should either
|
|
* start up immediatly, or at least before us if
|
|
* we release our slot.
|
|
*/
|
|
mtx_lock_spin(&kse_lock);
|
|
ku = td->td_upcall;
|
|
ku->ku_owner = NULL;
|
|
td->td_upcall = NULL;
|
|
td->td_pflags &= ~TDP_CAN_UNBIND;
|
|
td2 = thread_schedule_upcall(td, ku);
|
|
mtx_unlock_spin(&kse_lock);
|
|
if (flags & SW_INVOL || nextthread) {
|
|
thread_lock(td2);
|
|
sched_add(td2, SRQ_YIELDING);
|
|
thread_unlock(td2);
|
|
} else {
|
|
/* Keep up with reality.. we have one extra thread
|
|
* in the picture.. and it's 'running'.
|
|
*/
|
|
return td2;
|
|
}
|
|
}
|
|
return (nextthread);
|
|
}
|
|
|
|
/*
|
|
* Setup done on the thread when it enters the kernel.
|
|
*/
|
|
void
|
|
thread_user_enter(struct thread *td)
|
|
{
|
|
struct proc *p = td->td_proc;
|
|
struct kse_upcall *ku;
|
|
struct kse_thr_mailbox *tmbx;
|
|
uint32_t flags;
|
|
|
|
/*
|
|
* First check that we shouldn't just abort. we
|
|
* can suspend it here or just exit.
|
|
*/
|
|
if (__predict_false(P_SHOULDSTOP(p))) {
|
|
PROC_LOCK(p);
|
|
thread_suspend_check(0);
|
|
PROC_UNLOCK(p);
|
|
}
|
|
|
|
if (!(td->td_pflags & TDP_SA))
|
|
return;
|
|
|
|
/*
|
|
* If we are doing a syscall in a KSE environment,
|
|
* note where our mailbox is.
|
|
*/
|
|
|
|
thread_lock(td);
|
|
ku = td->td_upcall;
|
|
thread_unlock(td);
|
|
|
|
KASSERT(ku != NULL, ("no upcall owned"));
|
|
KASSERT(ku->ku_owner == td, ("wrong owner"));
|
|
KASSERT(!TD_CAN_UNBIND(td), ("can unbind"));
|
|
|
|
if (td->td_standin == NULL)
|
|
thread_alloc_spare(td);
|
|
ku->ku_mflags = fuword32((void *)&ku->ku_mailbox->km_flags);
|
|
tmbx = (void *)fuword((void *)&ku->ku_mailbox->km_curthread);
|
|
if ((tmbx == NULL) || (tmbx == (void *)-1L) ||
|
|
(ku->ku_mflags & KMF_NOUPCALL)) {
|
|
td->td_mailbox = NULL;
|
|
} else {
|
|
flags = fuword32(&tmbx->tm_flags);
|
|
/*
|
|
* On some architectures, TP register points to thread
|
|
* mailbox but not points to kse mailbox, and userland
|
|
* can not atomically clear km_curthread, but can
|
|
* use TP register, and set TMF_NOUPCALL in thread
|
|
* flag to indicate a critical region.
|
|
*/
|
|
if (flags & TMF_NOUPCALL) {
|
|
td->td_mailbox = NULL;
|
|
} else {
|
|
td->td_mailbox = tmbx;
|
|
td->td_pflags |= TDP_CAN_UNBIND;
|
|
PROC_LOCK(p);
|
|
if (__predict_false(p->p_flag & P_TRACED)) {
|
|
flags = fuword32(&tmbx->tm_dflags);
|
|
if (flags & TMDF_SUSPEND) {
|
|
thread_lock(td);
|
|
/* fuword can block, check again */
|
|
if (td->td_upcall)
|
|
ku->ku_flags |= KUF_DOUPCALL;
|
|
thread_unlock(td);
|
|
}
|
|
}
|
|
PROC_UNLOCK(p);
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* The extra work we go through if we are a threaded process when we
|
|
* return to userland.
|
|
*
|
|
* If we are a KSE process and returning to user mode, check for
|
|
* extra work to do before we return (e.g. for more syscalls
|
|
* to complete first). If we were in a critical section, we should
|
|
* just return to let it finish. Same if we were in the UTS (in
|
|
* which case the mailbox's context's busy indicator will be set).
|
|
* The only traps we suport will have set the mailbox.
|
|
* We will clear it here.
|
|
*/
|
|
int
|
|
thread_userret(struct thread *td, struct trapframe *frame)
|
|
{
|
|
struct kse_upcall *ku;
|
|
struct proc *p;
|
|
struct timespec ts;
|
|
int error = 0, uts_crit;
|
|
|
|
/* Nothing to do with bound thread */
|
|
if (!(td->td_pflags & TDP_SA))
|
|
return (0);
|
|
|
|
/*
|
|
* Update stat clock count for userland
|
|
*/
|
|
if (td->td_mailbox != NULL) {
|
|
thread_update_usr_ticks(td);
|
|
uts_crit = 0;
|
|
} else {
|
|
uts_crit = 1;
|
|
}
|
|
|
|
p = td->td_proc;
|
|
thread_lock(td);
|
|
ku = td->td_upcall;
|
|
|
|
/*
|
|
* Optimisation:
|
|
* This thread has not started any upcall.
|
|
* If there is no work to report other than ourself,
|
|
* then it can return direct to userland.
|
|
*/
|
|
if (TD_CAN_UNBIND(td)) {
|
|
thread_unlock(td);
|
|
td->td_pflags &= ~TDP_CAN_UNBIND;
|
|
if ((td->td_flags & TDF_NEEDSIGCHK) == 0 &&
|
|
(p->p_completed == NULL) &&
|
|
(ku->ku_flags & KUF_DOUPCALL) == 0 &&
|
|
(p->p_upquantum && ticks < p->p_nextupcall)) {
|
|
nanotime(&ts);
|
|
error = copyout(&ts,
|
|
(caddr_t)&ku->ku_mailbox->km_timeofday,
|
|
sizeof(ts));
|
|
td->td_mailbox = 0;
|
|
ku->ku_mflags = 0;
|
|
if (error)
|
|
goto out;
|
|
return (0);
|
|
}
|
|
thread_export_context(td, 0);
|
|
/*
|
|
* There is something to report, and we own an upcall
|
|
* structure, we can go to userland.
|
|
* Turn ourself into an upcall thread.
|
|
*/
|
|
td->td_pflags |= TDP_UPCALLING;
|
|
} else if (td->td_mailbox && (ku == NULL)) {
|
|
thread_unlock(td);
|
|
thread_export_context(td, 1);
|
|
PROC_LOCK(p);
|
|
if (p->p_upsleeps)
|
|
wakeup(&p->p_completed);
|
|
WITNESS_WARN(WARN_PANIC, &p->p_mtx.lock_object,
|
|
"thread exiting in userret");
|
|
sigqueue_flush(&td->td_sigqueue);
|
|
PROC_SLOCK(p);
|
|
thread_stopped(p);
|
|
thread_exit();
|
|
/* NOTREACHED */
|
|
} else
|
|
thread_unlock(td);
|
|
|
|
KASSERT(ku != NULL, ("upcall is NULL"));
|
|
KASSERT(TD_CAN_UNBIND(td) == 0, ("can unbind"));
|
|
|
|
PROC_LOCK(p);
|
|
PROC_SLOCK(p);
|
|
if (p->p_numthreads > max_threads_per_proc) {
|
|
max_threads_hits++;
|
|
while (p->p_numthreads > max_threads_per_proc) {
|
|
if (p->p_numupcalls >= max_threads_per_proc)
|
|
break;
|
|
PROC_SUNLOCK(p);
|
|
if (msleep(&p->p_numthreads, &p->p_mtx, PPAUSE|PCATCH,
|
|
"maxthreads", hz/10) != EWOULDBLOCK) {
|
|
PROC_SLOCK(p);
|
|
break;
|
|
} else
|
|
PROC_SLOCK(p);
|
|
}
|
|
}
|
|
PROC_SUNLOCK(p);
|
|
PROC_UNLOCK(p);
|
|
|
|
if (td->td_pflags & TDP_UPCALLING) {
|
|
uts_crit = 0;
|
|
p->p_nextupcall = ticks + p->p_upquantum;
|
|
/*
|
|
* There is no more work to do and we are going to ride
|
|
* this thread up to userland as an upcall.
|
|
* Do the last parts of the setup needed for the upcall.
|
|
*/
|
|
CTR3(KTR_PROC, "userret: upcall thread %p (pid %d, %s)",
|
|
td, td->td_proc->p_pid, td->td_proc->p_comm);
|
|
|
|
td->td_pflags &= ~TDP_UPCALLING;
|
|
if (ku->ku_flags & KUF_DOUPCALL) {
|
|
PROC_SLOCK(p);
|
|
ku->ku_flags &= ~KUF_DOUPCALL;
|
|
PROC_SUNLOCK(p);
|
|
}
|
|
/*
|
|
* Set user context to the UTS
|
|
*/
|
|
if (!(ku->ku_mflags & KMF_NOUPCALL)) {
|
|
cpu_set_upcall_kse(td, ku->ku_func, ku->ku_mailbox,
|
|
&ku->ku_stack);
|
|
PROC_LOCK(p);
|
|
if (p->p_flag & P_TRACED) {
|
|
_PHOLD(p);
|
|
ptrace_clear_single_step(td);
|
|
_PRELE(p);
|
|
}
|
|
PROC_UNLOCK(p);
|
|
error = suword32(&ku->ku_mailbox->km_lwp,
|
|
td->td_tid);
|
|
if (error)
|
|
goto out;
|
|
error = suword(&ku->ku_mailbox->km_curthread, 0);
|
|
if (error)
|
|
goto out;
|
|
}
|
|
|
|
/*
|
|
* Unhook the list of completed threads.
|
|
* anything that completes after this gets to
|
|
* come in next time.
|
|
* Put the list of completed thread mailboxes on
|
|
* this KSE's mailbox.
|
|
*/
|
|
if (!(ku->ku_mflags & KMF_NOCOMPLETED) &&
|
|
(error = thread_link_mboxes(p, ku)) != 0)
|
|
goto out;
|
|
}
|
|
if (!uts_crit) {
|
|
nanotime(&ts);
|
|
error = copyout(&ts, &ku->ku_mailbox->km_timeofday, sizeof(ts));
|
|
}
|
|
|
|
out:
|
|
if (error) {
|
|
/*
|
|
* Things are going to be so screwed we should just kill
|
|
* the process.
|
|
* how do we do that?
|
|
*/
|
|
PROC_LOCK(p);
|
|
psignal(p, SIGSEGV);
|
|
PROC_UNLOCK(p);
|
|
} else {
|
|
/*
|
|
* Optimisation:
|
|
* Ensure that we have a spare thread available,
|
|
* for when we re-enter the kernel.
|
|
*/
|
|
if (td->td_standin == NULL)
|
|
thread_alloc_spare(td);
|
|
}
|
|
|
|
ku->ku_mflags = 0;
|
|
td->td_mailbox = NULL;
|
|
td->td_usticks = 0;
|
|
return (error); /* go sync */
|
|
}
|
|
|
|
/*
|
|
* called after ptrace resumed a process, force all
|
|
* virtual CPUs to schedule upcall for SA process,
|
|
* because debugger may have changed something in userland,
|
|
* we should notice UTS as soon as possible.
|
|
*/
|
|
void
|
|
thread_continued(struct proc *p)
|
|
{
|
|
struct kse_upcall *ku;
|
|
struct thread *td;
|
|
|
|
PROC_LOCK_ASSERT(p, MA_OWNED);
|
|
KASSERT(P_SHOULDSTOP(p), ("process not stopped"));
|
|
|
|
if (!(p->p_flag & P_SA))
|
|
return;
|
|
|
|
if (p->p_flag & P_TRACED) {
|
|
td = TAILQ_FIRST(&p->p_threads);
|
|
if (td && (td->td_pflags & TDP_SA)) {
|
|
FOREACH_UPCALL_IN_PROC(p, ku) {
|
|
PROC_SLOCK(p);
|
|
ku->ku_flags |= KUF_DOUPCALL;
|
|
PROC_SUNLOCK(p);
|
|
wakeup(&p->p_completed);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
#endif
|