1997-05-26 14:37:43 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1997, Stefan Esser <se@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 unmodified, 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.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
|
|
|
|
*
|
1999-08-28 01:08:13 +00:00
|
|
|
* $FreeBSD$
|
1997-05-26 14:37:43 +00:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
1998-06-11 07:23:59 +00:00
|
|
|
|
1998-11-10 09:16:29 +00:00
|
|
|
#include <sys/param.h>
|
2000-09-13 18:33:25 +00:00
|
|
|
#include <sys/bus.h>
|
|
|
|
#include <sys/rtprio.h>
|
1997-05-26 14:37:43 +00:00
|
|
|
#include <sys/systm.h>
|
2000-10-05 23:09:57 +00:00
|
|
|
#include <sys/ipl.h>
|
1997-06-02 08:19:06 +00:00
|
|
|
#include <sys/interrupt.h>
|
2000-10-05 23:09:57 +00:00
|
|
|
#include <sys/kernel.h>
|
|
|
|
#include <sys/kthread.h>
|
|
|
|
#include <sys/ktr.h>
|
|
|
|
#include <sys/malloc.h>
|
2000-10-20 07:58:15 +00:00
|
|
|
#include <sys/mutex.h>
|
2000-10-05 23:09:57 +00:00
|
|
|
#include <sys/proc.h>
|
2001-02-20 10:25:29 +00:00
|
|
|
#include <sys/random.h>
|
2001-02-09 17:42:43 +00:00
|
|
|
#include <sys/resourcevar.h>
|
2000-10-05 23:09:57 +00:00
|
|
|
#include <sys/unistd.h>
|
|
|
|
#include <sys/vmmeter.h>
|
|
|
|
#include <machine/atomic.h>
|
|
|
|
#include <machine/cpu.h>
|
2000-10-25 05:19:40 +00:00
|
|
|
#include <machine/md_var.h>
|
2001-02-09 17:42:43 +00:00
|
|
|
#include <machine/stdarg.h>
|
1997-05-26 14:37:43 +00:00
|
|
|
|
2000-10-25 05:19:40 +00:00
|
|
|
#include <net/netisr.h> /* prototype for legacy_setsoftnet */
|
1998-08-11 15:08:13 +00:00
|
|
|
|
2001-02-20 10:25:29 +00:00
|
|
|
struct int_entropy {
|
|
|
|
struct proc *proc;
|
|
|
|
int vector;
|
|
|
|
};
|
|
|
|
|
2001-02-09 17:42:43 +00:00
|
|
|
void *net_ih;
|
|
|
|
void *vm_ih;
|
|
|
|
void *softclock_ih;
|
|
|
|
struct ithd *clk_ithd;
|
|
|
|
struct ithd *tty_ithd;
|
2000-10-05 23:09:57 +00:00
|
|
|
|
2001-02-09 17:42:43 +00:00
|
|
|
static struct mtx ithread_list_lock;
|
1998-08-11 15:08:13 +00:00
|
|
|
|
2001-02-09 17:42:43 +00:00
|
|
|
static MALLOC_DEFINE(M_ITHREAD, "ithread", "Interrupt Threads");
|
|
|
|
|
|
|
|
static void ithread_update(struct ithd *);
|
|
|
|
static void ithread_loop(void *);
|
|
|
|
static void ithread_init(void *);
|
|
|
|
static void start_softintr(void *);
|
|
|
|
static void swi_net(void *);
|
|
|
|
|
|
|
|
u_char
|
|
|
|
ithread_priority(enum intr_type flags)
|
2000-09-13 18:33:25 +00:00
|
|
|
{
|
2001-02-09 17:42:43 +00:00
|
|
|
u_char pri;
|
2000-09-13 18:33:25 +00:00
|
|
|
|
2001-02-09 17:42:43 +00:00
|
|
|
flags &= (INTR_TYPE_TTY | INTR_TYPE_BIO | INTR_TYPE_NET |
|
|
|
|
INTR_TYPE_CAM | INTR_TYPE_MISC | INTR_TYPE_CLK);
|
2000-09-13 18:33:25 +00:00
|
|
|
switch (flags) {
|
2001-02-09 17:42:43 +00:00
|
|
|
case INTR_TYPE_TTY:
|
2000-09-13 18:33:25 +00:00
|
|
|
pri = PI_TTYLOW;
|
|
|
|
break;
|
|
|
|
case INTR_TYPE_BIO:
|
|
|
|
/*
|
|
|
|
* XXX We need to refine this. BSD/OS distinguishes
|
|
|
|
* between tape and disk priorities.
|
|
|
|
*/
|
|
|
|
pri = PI_DISK;
|
|
|
|
break;
|
|
|
|
case INTR_TYPE_NET:
|
|
|
|
pri = PI_NET;
|
|
|
|
break;
|
|
|
|
case INTR_TYPE_CAM:
|
|
|
|
pri = PI_DISK; /* XXX or PI_CAM? */
|
|
|
|
break;
|
2001-02-09 17:42:43 +00:00
|
|
|
case INTR_TYPE_CLK:
|
|
|
|
pri = PI_REALTIME;
|
|
|
|
break;
|
2000-09-13 18:33:25 +00:00
|
|
|
case INTR_TYPE_MISC:
|
|
|
|
pri = PI_DULL; /* don't care */
|
|
|
|
break;
|
|
|
|
default:
|
2001-02-09 17:42:43 +00:00
|
|
|
/* We didn't specify an interrupt level. */
|
2000-09-13 18:33:25 +00:00
|
|
|
panic("ithread_priority: no interrupt type in flags");
|
|
|
|
}
|
|
|
|
|
|
|
|
return pri;
|
|
|
|
}
|
|
|
|
|
2001-02-09 17:42:43 +00:00
|
|
|
/*
|
|
|
|
* Regenerate the name (p_comm) and priority for a threaded interrupt thread.
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
ithread_update(struct ithd *ithd)
|
|
|
|
{
|
|
|
|
struct intrhand *ih;
|
|
|
|
struct proc *p;
|
|
|
|
int entropy;
|
|
|
|
|
|
|
|
p = ithd->it_proc;
|
|
|
|
if (p == NULL)
|
|
|
|
return;
|
|
|
|
|
|
|
|
strncpy(p->p_comm, ithd->it_name, sizeof(ithd->it_name));
|
|
|
|
ih = TAILQ_FIRST(&ithd->it_handlers);
|
|
|
|
if (ih == NULL) {
|
2001-02-12 00:20:08 +00:00
|
|
|
p->p_pri.pri_level = PRI_MAX_ITHD;
|
2001-02-09 17:42:43 +00:00
|
|
|
ithd->it_flags &= ~IT_ENTROPY;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
entropy = 0;
|
2001-02-12 00:20:08 +00:00
|
|
|
p->p_pri.pri_level = ih->ih_pri;
|
2001-02-09 17:42:43 +00:00
|
|
|
TAILQ_FOREACH(ih, &ithd->it_handlers, ih_next) {
|
|
|
|
if (strlen(p->p_comm) + strlen(ih->ih_name) + 1 <
|
|
|
|
sizeof(p->p_comm)) {
|
|
|
|
strcat(p->p_comm, " ");
|
|
|
|
strcat(p->p_comm, ih->ih_name);
|
|
|
|
} else if (strlen(p->p_comm) + 1 == sizeof(p->p_comm)) {
|
|
|
|
if (p->p_comm[sizeof(p->p_comm) - 2] == '+')
|
|
|
|
p->p_comm[sizeof(p->p_comm) - 2] = '*';
|
|
|
|
else
|
|
|
|
p->p_comm[sizeof(p->p_comm) - 2] = '+';
|
|
|
|
} else
|
|
|
|
strcat(p->p_comm, "+");
|
|
|
|
if (ih->ih_flags & IH_ENTROPY)
|
|
|
|
entropy++;
|
|
|
|
}
|
|
|
|
|
2001-02-20 10:25:29 +00:00
|
|
|
if (entropy)
|
2001-02-09 17:42:43 +00:00
|
|
|
ithd->it_flags |= IT_ENTROPY;
|
|
|
|
else
|
|
|
|
ithd->it_flags &= ~IT_ENTROPY;
|
2001-02-22 02:14:08 +00:00
|
|
|
|
|
|
|
CTR1(KTR_INTR, __func__ ": updated %s\n", p->p_comm);
|
2001-02-09 17:42:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
ithread_create(struct ithd **ithread, int vector, int flags,
|
|
|
|
void (*disable)(int), void (*enable)(int), const char *fmt, ...)
|
|
|
|
{
|
|
|
|
struct ithd *ithd;
|
|
|
|
struct proc *p;
|
|
|
|
int error;
|
|
|
|
va_list ap;
|
|
|
|
|
2001-02-20 10:25:29 +00:00
|
|
|
/* The only valid flag during creation is IT_SOFT. */
|
|
|
|
if ((flags & ~IT_SOFT) != 0)
|
|
|
|
return (EINVAL);
|
|
|
|
|
2001-02-09 17:42:43 +00:00
|
|
|
ithd = malloc(sizeof(struct ithd), M_ITHREAD, M_WAITOK | M_ZERO);
|
|
|
|
ithd->it_vector = vector;
|
|
|
|
ithd->it_disable = disable;
|
|
|
|
ithd->it_enable = enable;
|
|
|
|
ithd->it_flags = flags;
|
|
|
|
TAILQ_INIT(&ithd->it_handlers);
|
|
|
|
|
|
|
|
va_start(ap, fmt);
|
|
|
|
vsnprintf(ithd->it_name, sizeof(ithd->it_name), fmt, ap);
|
|
|
|
va_end(ap);
|
|
|
|
|
|
|
|
error = kthread_create(ithread_loop, ithd, &p, RFSTOPPED | RFHIGHPID,
|
|
|
|
ithd->it_name);
|
|
|
|
if (error) {
|
|
|
|
free(ithd, M_ITHREAD);
|
|
|
|
return (error);
|
|
|
|
}
|
2001-02-12 00:20:08 +00:00
|
|
|
p->p_pri.pri_class = PRI_ITHD;
|
|
|
|
p->p_pri.pri_level = PRI_MAX_ITHD;
|
2001-02-09 17:42:43 +00:00
|
|
|
p->p_stat = SWAIT;
|
|
|
|
ithd->it_proc = p;
|
|
|
|
p->p_ithd = ithd;
|
|
|
|
if (ithread != NULL)
|
|
|
|
*ithread = ithd;
|
|
|
|
|
2001-02-22 02:14:08 +00:00
|
|
|
CTR1(KTR_INTR, __func__ ": created %s", ithd->it_name);
|
2001-02-09 17:42:43 +00:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
ithread_destroy(struct ithd *ithread)
|
|
|
|
{
|
|
|
|
|
|
|
|
if (ithread == NULL || !TAILQ_EMPTY(&ithread->it_handlers))
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
mtx_lock_spin(&sched_lock);
|
|
|
|
ithread->it_flags |= IT_DEAD;
|
|
|
|
if (ithread->it_proc->p_stat == SWAIT) {
|
|
|
|
ithread->it_proc->p_stat = SRUN;
|
|
|
|
setrunqueue(ithread->it_proc);
|
|
|
|
}
|
|
|
|
mtx_unlock_spin(&sched_lock);
|
2001-02-22 02:14:08 +00:00
|
|
|
CTR1(KTR_INTR, __func__ ": killing %s", ithread->it_name);
|
2001-02-09 17:42:43 +00:00
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
ithread_add_handler(struct ithd* ithread, const char *name,
|
|
|
|
driver_intr_t handler, void *arg, u_char pri, enum intr_type flags,
|
|
|
|
void **cookiep)
|
|
|
|
{
|
|
|
|
struct intrhand *ih, *temp_ih;
|
|
|
|
|
|
|
|
if (ithread == NULL || name == NULL || handler == NULL)
|
|
|
|
return (EINVAL);
|
|
|
|
if ((flags & INTR_FAST) !=0)
|
|
|
|
flags |= INTR_EXCL;
|
|
|
|
|
|
|
|
ih = malloc(sizeof(struct intrhand), M_ITHREAD, M_WAITOK | M_ZERO);
|
|
|
|
ih->ih_handler = handler;
|
|
|
|
ih->ih_argument = arg;
|
|
|
|
ih->ih_name = name;
|
|
|
|
ih->ih_ithread = ithread;
|
|
|
|
ih->ih_pri = pri;
|
|
|
|
if (flags & INTR_FAST)
|
|
|
|
ih->ih_flags = IH_FAST | IH_EXCLUSIVE;
|
|
|
|
else if (flags & INTR_EXCL)
|
|
|
|
ih->ih_flags = IH_EXCLUSIVE;
|
|
|
|
if (flags & INTR_MPSAFE)
|
|
|
|
ih->ih_flags |= IH_MPSAFE;
|
|
|
|
if (flags & INTR_ENTROPY)
|
|
|
|
ih->ih_flags |= IH_ENTROPY;
|
|
|
|
|
|
|
|
mtx_lock_spin(&ithread_list_lock);
|
|
|
|
if ((flags & INTR_EXCL) !=0 && !TAILQ_EMPTY(&ithread->it_handlers))
|
|
|
|
goto fail;
|
|
|
|
if (!TAILQ_EMPTY(&ithread->it_handlers) &&
|
|
|
|
(TAILQ_FIRST(&ithread->it_handlers)->ih_flags & IH_EXCLUSIVE) != 0)
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
TAILQ_FOREACH(temp_ih, &ithread->it_handlers, ih_next)
|
|
|
|
if (temp_ih->ih_pri > ih->ih_pri)
|
|
|
|
break;
|
|
|
|
if (temp_ih == NULL)
|
|
|
|
TAILQ_INSERT_TAIL(&ithread->it_handlers, ih, ih_next);
|
|
|
|
else
|
|
|
|
TAILQ_INSERT_BEFORE(temp_ih, ih, ih_next);
|
|
|
|
ithread_update(ithread);
|
|
|
|
mtx_unlock_spin(&ithread_list_lock);
|
|
|
|
|
|
|
|
if (cookiep != NULL)
|
|
|
|
*cookiep = ih;
|
2001-02-22 02:14:08 +00:00
|
|
|
CTR2(KTR_INTR, __func__ ": added %s to %s", ih->ih_name,
|
|
|
|
ithread->it_name);
|
2001-02-09 17:42:43 +00:00
|
|
|
return (0);
|
|
|
|
|
|
|
|
fail:
|
|
|
|
mtx_unlock_spin(&ithread_list_lock);
|
|
|
|
free(ih, M_ITHREAD);
|
|
|
|
return (EINVAL);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
ithread_remove_handler(void *cookie)
|
|
|
|
{
|
|
|
|
struct intrhand *handler = (struct intrhand *)cookie;
|
|
|
|
struct ithd *ithread;
|
|
|
|
#ifdef INVARIANTS
|
|
|
|
struct intrhand *ih;
|
|
|
|
#endif
|
|
|
|
|
2001-02-20 10:25:29 +00:00
|
|
|
if (handler == NULL)
|
2001-02-09 17:42:43 +00:00
|
|
|
return (EINVAL);
|
2001-02-22 00:23:56 +00:00
|
|
|
ithread = handler->ih_ithread;
|
|
|
|
KASSERT(ithread != NULL,
|
2001-02-20 10:25:29 +00:00
|
|
|
("interrupt handler \"%s\" has a NULL interrupt thread",
|
|
|
|
handler->ih_name));
|
2001-02-22 02:14:08 +00:00
|
|
|
CTR2(KTR_INTR, __func__ ": removing %s from %s", handler->ih_name,
|
|
|
|
ithread->it_name);
|
2001-02-09 17:42:43 +00:00
|
|
|
mtx_lock_spin(&ithread_list_lock);
|
|
|
|
#ifdef INVARIANTS
|
|
|
|
TAILQ_FOREACH(ih, &ithread->it_handlers, ih_next)
|
2001-02-20 10:25:29 +00:00
|
|
|
if (ih == handler)
|
|
|
|
goto ok;
|
|
|
|
mtx_unlock_spin(&ithread_list_lock);
|
|
|
|
panic("interrupt handler \"%s\" not found in interrupt thread \"%s\"",
|
|
|
|
ih->ih_name, ithread->it_name);
|
|
|
|
ok:
|
2001-02-09 17:42:43 +00:00
|
|
|
#endif
|
|
|
|
TAILQ_REMOVE(&ithread->it_handlers, handler, ih_next);
|
|
|
|
ithread_update(ithread);
|
|
|
|
mtx_unlock_spin(&ithread_list_lock);
|
2000-10-05 23:09:57 +00:00
|
|
|
|
2001-02-09 17:42:43 +00:00
|
|
|
free(handler, M_ITHREAD);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
2001-02-20 10:25:29 +00:00
|
|
|
int
|
|
|
|
ithread_schedule(struct ithd *ithread, int do_switch)
|
|
|
|
{
|
|
|
|
struct int_entropy entropy;
|
|
|
|
struct proc *p;
|
|
|
|
intrmask_t saveintr;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If no ithread or no handlers, then we have a stray interrupt.
|
|
|
|
*/
|
|
|
|
if ((ithread == NULL) || TAILQ_EMPTY(&ithread->it_handlers))
|
|
|
|
return (EINVAL);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If any of the handlers for this ithread claim to be good
|
|
|
|
* sources of entropy, then gather some.
|
|
|
|
*/
|
|
|
|
if (harvest.interrupt && ithread->it_flags & IT_ENTROPY) {
|
|
|
|
entropy.vector = ithread->it_vector;
|
|
|
|
entropy.proc = CURPROC;
|
|
|
|
random_harvest(&entropy, sizeof(entropy), 2, 0,
|
|
|
|
RANDOM_INTERRUPT);
|
|
|
|
}
|
|
|
|
|
|
|
|
p = ithread->it_proc;
|
|
|
|
CTR3(KTR_INTR, __func__ ": pid %d: (%s) need = %d", p->p_pid, p->p_comm,
|
|
|
|
ithread->it_need);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Set it_need to tell the thread to keep running if it is already
|
|
|
|
* running. Then, grab sched_lock and see if we actually need to
|
|
|
|
* put this thread on the runqueue. If so and the do_switch flag is
|
|
|
|
* true, then switch to the ithread immediately. Otherwise, use
|
|
|
|
* need_resched() to guarantee that this ithread will run before any
|
|
|
|
* userland processes.
|
|
|
|
*/
|
|
|
|
ithread->it_need = 1;
|
|
|
|
mtx_lock_spin(&sched_lock);
|
|
|
|
if (p->p_stat == SWAIT) {
|
|
|
|
CTR1(KTR_INTR, __func__ ": setrunqueue %d", p->p_pid);
|
|
|
|
p->p_stat = SRUN;
|
|
|
|
setrunqueue(p);
|
|
|
|
if (do_switch) {
|
|
|
|
saveintr = sched_lock.mtx_saveintr;
|
|
|
|
mtx_intr_enable(&sched_lock);
|
|
|
|
if (curproc != PCPU_GET(idleproc))
|
|
|
|
setrunqueue(curproc);
|
|
|
|
curproc->p_stats->p_ru.ru_nvcsw++;
|
|
|
|
mi_switch();
|
|
|
|
sched_lock.mtx_saveintr = saveintr;
|
|
|
|
} else
|
|
|
|
need_resched();
|
|
|
|
} else {
|
|
|
|
CTR3(KTR_INTR, __func__ ": pid %d: it_need %d, state %d",
|
|
|
|
p->p_pid, ithread->it_need, p->p_stat);
|
|
|
|
}
|
|
|
|
mtx_unlock_spin(&sched_lock);
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
2001-02-09 17:42:43 +00:00
|
|
|
int
|
|
|
|
swi_add(struct ithd **ithdp, const char *name, driver_intr_t handler,
|
|
|
|
void *arg, int pri, enum intr_type flags, void **cookiep)
|
2000-10-25 05:19:40 +00:00
|
|
|
{
|
|
|
|
struct ithd *ithd;
|
2001-02-09 17:42:43 +00:00
|
|
|
int error;
|
2000-10-25 05:19:40 +00:00
|
|
|
|
2001-02-20 10:25:29 +00:00
|
|
|
if (flags & (INTR_FAST | INTR_ENTROPY))
|
|
|
|
return (EINVAL);
|
|
|
|
|
2000-10-25 05:19:40 +00:00
|
|
|
ithd = (ithdp != NULL) ? *ithdp : NULL;
|
|
|
|
|
2001-02-20 10:25:29 +00:00
|
|
|
if (ithd != NULL) {
|
|
|
|
if ((ithd->it_flags & IT_SOFT) == 0)
|
|
|
|
return(EINVAL);
|
|
|
|
} else {
|
2001-02-09 17:42:43 +00:00
|
|
|
error = ithread_create(&ithd, pri, IT_SOFT, NULL, NULL,
|
|
|
|
"swi%d:", pri);
|
2000-10-25 05:19:40 +00:00
|
|
|
if (error)
|
2001-02-09 17:42:43 +00:00
|
|
|
return (error);
|
|
|
|
|
2000-10-25 05:19:40 +00:00
|
|
|
if (ithdp != NULL)
|
|
|
|
*ithdp = ithd;
|
2000-10-05 23:09:57 +00:00
|
|
|
}
|
2001-02-12 00:20:08 +00:00
|
|
|
return (ithread_add_handler(ithd, name, handler, arg,
|
|
|
|
(pri * RQ_PPQ) + PI_SOFT, flags, cookiep));
|
2000-10-05 23:09:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
2000-10-25 05:19:40 +00:00
|
|
|
* Schedule a heavyweight software interrupt process.
|
2000-10-05 23:09:57 +00:00
|
|
|
*/
|
2000-10-25 05:19:40 +00:00
|
|
|
void
|
2001-02-09 17:42:43 +00:00
|
|
|
swi_sched(void *cookie, int flags)
|
2000-10-05 23:09:57 +00:00
|
|
|
{
|
2001-02-09 17:42:43 +00:00
|
|
|
struct intrhand *ih = (struct intrhand *)cookie;
|
|
|
|
struct ithd *it = ih->ih_ithread;
|
2000-10-25 05:19:40 +00:00
|
|
|
struct proc *p = it->it_proc;
|
2001-02-20 10:25:29 +00:00
|
|
|
int error;
|
2000-10-05 23:09:57 +00:00
|
|
|
|
2000-10-25 05:19:40 +00:00
|
|
|
atomic_add_int(&cnt.v_intr, 1); /* one more global interrupt */
|
|
|
|
|
2001-02-09 17:42:43 +00:00
|
|
|
CTR3(KTR_INTR, "swi_sched pid %d(%s) need=%d",
|
2000-10-25 05:19:40 +00:00
|
|
|
p->p_pid, p->p_comm, it->it_need);
|
2000-10-05 23:09:57 +00:00
|
|
|
|
2000-10-25 05:19:40 +00:00
|
|
|
/*
|
2001-02-20 10:25:29 +00:00
|
|
|
* Set ih_need for this handler so that if the ithread is already
|
|
|
|
* running it will execute this handler on the next pass. Otherwise,
|
|
|
|
* it will execute it the next time it runs.
|
2000-10-25 05:19:40 +00:00
|
|
|
*/
|
2001-02-09 17:42:43 +00:00
|
|
|
atomic_store_rel_int(&ih->ih_need, 1);
|
|
|
|
if (!(flags & SWI_DELAY)) {
|
2001-02-20 10:25:29 +00:00
|
|
|
error = ithread_schedule(it, !cold && flags & SWI_SWITCH);
|
|
|
|
KASSERT(error == 0, ("stray software interrupt"));
|
2000-10-25 05:19:40 +00:00
|
|
|
}
|
2000-10-05 23:09:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2001-02-09 17:42:43 +00:00
|
|
|
* This is the main code for interrupt threads.
|
2000-10-05 23:09:57 +00:00
|
|
|
*/
|
2000-10-25 05:19:40 +00:00
|
|
|
void
|
2001-02-09 17:42:43 +00:00
|
|
|
ithread_loop(void *arg)
|
2000-10-05 23:09:57 +00:00
|
|
|
{
|
2001-02-09 17:42:43 +00:00
|
|
|
struct ithd *ithd; /* our thread context */
|
2000-10-25 05:19:40 +00:00
|
|
|
struct intrhand *ih; /* and our interrupt handler chain */
|
2001-02-09 17:42:43 +00:00
|
|
|
struct proc *p;
|
2000-10-25 05:19:40 +00:00
|
|
|
|
2001-02-09 17:42:43 +00:00
|
|
|
p = curproc;
|
|
|
|
ithd = (struct ithd *)arg; /* point to myself */
|
|
|
|
KASSERT(ithd->it_proc == p && p->p_ithd == ithd,
|
|
|
|
(__func__ ": ithread and proc linkage out of sync"));
|
2000-10-05 23:09:57 +00:00
|
|
|
|
2000-10-25 05:19:40 +00:00
|
|
|
/*
|
|
|
|
* As long as we have interrupts outstanding, go through the
|
|
|
|
* list of handlers, giving each one a go at it.
|
|
|
|
*/
|
2000-10-05 23:09:57 +00:00
|
|
|
for (;;) {
|
2001-02-09 17:42:43 +00:00
|
|
|
/*
|
|
|
|
* If we are an orphaned thread, then just die.
|
|
|
|
*/
|
|
|
|
if (ithd->it_flags & IT_DEAD) {
|
|
|
|
CTR2(KTR_INTR, __func__ ": pid %d: (%s) exiting",
|
|
|
|
p->p_pid, p->p_comm);
|
|
|
|
p->p_ithd = NULL;
|
|
|
|
mtx_lock(&Giant);
|
|
|
|
free(ithd, M_ITHREAD);
|
|
|
|
kthread_exit(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
CTR3(KTR_INTR, __func__ ": pid %d: (%s) need=%d",
|
|
|
|
p->p_pid, p->p_comm, ithd->it_need);
|
|
|
|
while (ithd->it_need) {
|
2000-10-25 05:19:40 +00:00
|
|
|
/*
|
|
|
|
* Service interrupts. If another interrupt
|
|
|
|
* arrives while we are running, they will set
|
|
|
|
* it_need to denote that we should make
|
|
|
|
* another pass.
|
|
|
|
*/
|
2001-02-09 17:42:43 +00:00
|
|
|
atomic_store_rel_int(&ithd->it_need, 0);
|
|
|
|
TAILQ_FOREACH(ih, &ithd->it_handlers, ih_next) {
|
|
|
|
if (ithd->it_flags & IT_SOFT && !ih->ih_need)
|
2000-10-25 05:19:40 +00:00
|
|
|
continue;
|
2001-02-09 17:42:43 +00:00
|
|
|
atomic_store_rel_int(&ih->ih_need, 0);
|
2000-10-25 05:19:40 +00:00
|
|
|
CTR5(KTR_INTR,
|
2001-02-09 17:42:43 +00:00
|
|
|
__func__ ": pid %d ih=%p: %p(%p) flg=%x",
|
2000-10-25 05:19:40 +00:00
|
|
|
p->p_pid, (void *)ih,
|
|
|
|
(void *)ih->ih_handler, ih->ih_argument,
|
|
|
|
ih->ih_flags);
|
|
|
|
|
2001-02-09 17:42:43 +00:00
|
|
|
if ((ih->ih_flags & IH_MPSAFE) == 0)
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_lock(&Giant);
|
2000-10-25 05:19:40 +00:00
|
|
|
ih->ih_handler(ih->ih_argument);
|
2001-02-09 17:42:43 +00:00
|
|
|
if ((ih->ih_flags & IH_MPSAFE) == 0)
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_unlock(&Giant);
|
2000-10-25 05:19:40 +00:00
|
|
|
}
|
2000-10-05 23:09:57 +00:00
|
|
|
}
|
2000-10-25 05:19:40 +00:00
|
|
|
|
2000-10-05 23:09:57 +00:00
|
|
|
/*
|
|
|
|
* Processed all our interrupts. Now get the sched
|
2000-10-25 05:19:40 +00:00
|
|
|
* lock. This may take a while and it_need may get
|
2000-10-05 23:09:57 +00:00
|
|
|
* set again, so we have to check it again.
|
|
|
|
*/
|
2000-11-15 22:05:23 +00:00
|
|
|
mtx_assert(&Giant, MA_NOTOWNED);
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_lock_spin(&sched_lock);
|
2001-02-09 17:42:43 +00:00
|
|
|
if (!ithd->it_need) {
|
|
|
|
/*
|
|
|
|
* Should we call this earlier in the loop above?
|
|
|
|
*/
|
|
|
|
if (ithd->it_enable != NULL)
|
|
|
|
ithd->it_enable(ithd->it_vector);
|
2000-10-25 05:19:40 +00:00
|
|
|
p->p_stat = SWAIT; /* we're idle */
|
2001-02-09 17:42:43 +00:00
|
|
|
CTR1(KTR_INTR, __func__ ": pid %d: done", p->p_pid);
|
2000-10-05 23:09:57 +00:00
|
|
|
mi_switch();
|
2001-02-09 17:42:43 +00:00
|
|
|
CTR1(KTR_INTR, __func__ ": pid %d: resumed", p->p_pid);
|
2000-10-05 23:09:57 +00:00
|
|
|
}
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_unlock_spin(&sched_lock);
|
2000-10-05 23:09:57 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2001-02-09 17:42:43 +00:00
|
|
|
/*
|
|
|
|
* Initialize mutex used to protect ithread handler lists.
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
ithread_init(void *dummy)
|
|
|
|
{
|
|
|
|
|
|
|
|
mtx_init(&ithread_list_lock, "ithread list lock", MTX_SPIN);
|
|
|
|
}
|
|
|
|
SYSINIT(ithread_init, SI_SUB_INTR, SI_ORDER_FIRST, ithread_init, NULL);
|
2000-10-25 05:19:40 +00:00
|
|
|
|
2000-10-05 23:09:57 +00:00
|
|
|
/*
|
2000-10-25 05:19:40 +00:00
|
|
|
* Start standard software interrupt threads
|
2000-10-05 23:09:57 +00:00
|
|
|
*/
|
2000-10-25 05:19:40 +00:00
|
|
|
static void
|
2001-02-09 17:42:43 +00:00
|
|
|
start_softintr(void *dummy)
|
2000-10-25 05:19:40 +00:00
|
|
|
{
|
2001-02-09 17:42:43 +00:00
|
|
|
|
|
|
|
if (swi_add(NULL, "net", swi_net, NULL, SWI_NET, 0, &net_ih) ||
|
|
|
|
swi_add(&clk_ithd, "clock", softclock, NULL, SWI_CLOCK,
|
|
|
|
INTR_MPSAFE, &softclock_ih) ||
|
|
|
|
swi_add(NULL, "vm", swi_vm, NULL, SWI_VM, 0, &vm_ih))
|
|
|
|
panic("died while creating standard software ithreads");
|
2001-02-20 10:25:29 +00:00
|
|
|
|
|
|
|
PROC_LOCK(clk_ithd->it_proc);
|
|
|
|
clk_ithd->it_proc->p_flag |= P_NOLOAD;
|
|
|
|
PROC_UNLOCK(clk_ithd->it_proc);
|
2000-10-05 23:09:57 +00:00
|
|
|
}
|
2001-02-09 17:42:43 +00:00
|
|
|
SYSINIT(start_softintr, SI_SUB_SOFTINTR, SI_ORDER_FIRST, start_softintr, NULL)
|
2000-10-05 23:09:57 +00:00
|
|
|
|
2000-10-25 05:19:40 +00:00
|
|
|
void
|
2001-02-09 17:42:43 +00:00
|
|
|
legacy_setsoftnet(void)
|
2000-10-25 05:19:40 +00:00
|
|
|
{
|
2001-02-09 17:42:43 +00:00
|
|
|
swi_sched(net_ih, SWI_NOSWITCH);
|
2000-10-05 23:09:57 +00:00
|
|
|
}
|
|
|
|
|
2000-10-25 05:19:40 +00:00
|
|
|
/*
|
|
|
|
* XXX: This should really be in the network code somewhere and installed
|
|
|
|
* via a SI_SUB_SOFINTR, SI_ORDER_MIDDLE sysinit.
|
|
|
|
*/
|
|
|
|
void (*netisrs[32]) __P((void));
|
|
|
|
u_int netisr;
|
2000-10-05 23:09:57 +00:00
|
|
|
|
2000-12-05 00:36:00 +00:00
|
|
|
int
|
|
|
|
register_netisr(num, handler)
|
|
|
|
int num;
|
|
|
|
netisr_t *handler;
|
|
|
|
{
|
|
|
|
|
|
|
|
if (num < 0 || num >= (sizeof(netisrs)/sizeof(*netisrs)) ) {
|
|
|
|
printf("register_netisr: bad isr number: %d\n", num);
|
|
|
|
return (EINVAL);
|
|
|
|
}
|
|
|
|
netisrs[num] = handler;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
unregister_netisr(num)
|
|
|
|
int num;
|
|
|
|
{
|
|
|
|
|
|
|
|
if (num < 0 || num >= (sizeof(netisrs)/sizeof(*netisrs)) ) {
|
|
|
|
printf("unregister_netisr: bad isr number: %d\n", num);
|
|
|
|
return (EINVAL);
|
|
|
|
}
|
|
|
|
netisrs[num] = NULL;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
2000-10-25 05:19:40 +00:00
|
|
|
static void
|
|
|
|
swi_net(void *dummy)
|
2000-10-05 23:09:57 +00:00
|
|
|
{
|
2000-10-25 05:19:40 +00:00
|
|
|
u_int bits;
|
|
|
|
int i;
|
2000-10-05 23:09:57 +00:00
|
|
|
|
2000-10-25 05:19:40 +00:00
|
|
|
bits = atomic_readandclear_int(&netisr);
|
|
|
|
while ((i = ffs(bits)) != 0) {
|
|
|
|
i--;
|
2000-12-31 01:31:55 +00:00
|
|
|
if (netisrs[i] != NULL)
|
|
|
|
netisrs[i]();
|
|
|
|
else
|
|
|
|
printf("swi_net: unregistered isr number: %d.\n", i);
|
2000-10-25 05:19:40 +00:00
|
|
|
bits &= ~(1 << i);
|
2000-10-05 23:09:57 +00:00
|
|
|
}
|
|
|
|
}
|