90bb57afd9
fixes some namespace pollution in general and breakage of modules that aren't in the sys tree in particular (<machine/ipl.h> includes further headers that aren't installed under /usr/include). Reimplemented SPLASSERT() so that it is more machine independent and less bloated and doesn't require the <machine/ipl.h> include spam. In particular, don't assume that `cpl' can be printed using %08x format. The alpha arch doesn't even have `cpl'. SPLASSERT() was harmless on alphas because it isn't actually used.
359 lines
8.2 KiB
C
359 lines
8.2 KiB
C
/*-
|
|
* Copyright (c) 1997 Bruce Evans.
|
|
* 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.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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 <machine/ipl.h>
|
|
#include <machine/globals.h>
|
|
#include <i386/isa/intr_machdep.h>
|
|
|
|
/*
|
|
* The volatile bitmap variables must be set atomically. This normally
|
|
* involves using a machine-dependent bit-set or `or' instruction.
|
|
*
|
|
* Note: setbits uses a locked or, making simple cases MP safe.
|
|
*/
|
|
#define DO_SETBITS(name, var, bits) \
|
|
void name(void) \
|
|
{ \
|
|
atomic_set_int(var, bits); \
|
|
}
|
|
|
|
DO_SETBITS(setdelayed, &ipending, loadandclear(&idelayed))
|
|
|
|
DO_SETBITS(setsoftcamnet,&ipending, SWI_CAMNET_PENDING)
|
|
DO_SETBITS(setsoftcambio,&ipending, SWI_CAMBIO_PENDING)
|
|
DO_SETBITS(setsoftclock, &ipending, SWI_CLOCK_PENDING)
|
|
DO_SETBITS(setsoftnet, &ipending, SWI_NET_PENDING)
|
|
DO_SETBITS(setsofttty, &ipending, SWI_TTY_PENDING)
|
|
DO_SETBITS(setsoftvm, &ipending, SWI_VM_PENDING)
|
|
|
|
DO_SETBITS(schedsoftcamnet, &idelayed, SWI_CAMNET_PENDING)
|
|
DO_SETBITS(schedsoftcambio, &idelayed, SWI_CAMBIO_PENDING)
|
|
DO_SETBITS(schedsoftnet, &idelayed, SWI_NET_PENDING)
|
|
DO_SETBITS(schedsofttty, &idelayed, SWI_TTY_PENDING)
|
|
DO_SETBITS(schedsoftvm, &idelayed, SWI_VM_PENDING)
|
|
|
|
unsigned
|
|
softclockpending(void)
|
|
{
|
|
return (ipending & SWI_CLOCK_PENDING);
|
|
}
|
|
|
|
#ifdef INVARIANT_SUPPORT
|
|
#define GENSPLASSERT(NAME, MODIFIER) \
|
|
void \
|
|
NAME##assert(const char *msg) \
|
|
{ \
|
|
if ((cpl & (MODIFIER)) != (MODIFIER)) \
|
|
panic("%s: not %s, cpl == %#x", \
|
|
msg, __XSTRING(NAME) + 3, cpl); \
|
|
}
|
|
#else
|
|
#define GENSPLASSERT(NAME, MODIFIER)
|
|
#endif
|
|
|
|
#ifndef SMP
|
|
|
|
#define GENSPL(NAME, OP, MODIFIER, PC) \
|
|
GENSPLASSERT(NAME, MODIFIER) \
|
|
unsigned NAME(void) \
|
|
{ \
|
|
unsigned x; \
|
|
\
|
|
x = cpl; \
|
|
cpl OP MODIFIER; \
|
|
return (x); \
|
|
}
|
|
|
|
void
|
|
spl0(void)
|
|
{
|
|
cpl = 0;
|
|
if (ipending)
|
|
splz();
|
|
}
|
|
|
|
void
|
|
splx(unsigned ipl)
|
|
{
|
|
cpl = ipl;
|
|
if (ipending & ~ipl)
|
|
splz();
|
|
}
|
|
|
|
intrmask_t
|
|
splq(intrmask_t mask)
|
|
{
|
|
intrmask_t tmp = cpl;
|
|
cpl |= mask;
|
|
return (tmp);
|
|
}
|
|
|
|
#else /* !SMP */
|
|
|
|
#include <machine/smp.h>
|
|
#include <machine/smptests.h>
|
|
|
|
#ifndef SPL_DEBUG_POSTCODE
|
|
#undef POSTCODE
|
|
#undef POSTCODE_LO
|
|
#undef POSTCODE_HI
|
|
#define POSTCODE(X)
|
|
#define POSTCODE_LO(X)
|
|
#define POSTCODE_HI(X)
|
|
#endif /* SPL_DEBUG_POSTCODE */
|
|
|
|
|
|
/*
|
|
* This version has to check for bsp_apic_ready,
|
|
* as calling simple_lock() (ie ss_lock) before then deadlocks the system.
|
|
* A sample count of GENSPL calls before bsp_apic_ready was set: 2193
|
|
*/
|
|
|
|
#ifdef INTR_SPL
|
|
|
|
#ifdef SPL_DEBUG
|
|
#define MAXZ 100000000
|
|
#define SPIN_VAR unsigned z;
|
|
#define SPIN_RESET z = 0;
|
|
#if 0
|
|
#define SPIN_SPL \
|
|
if (++z >= MAXZ) { \
|
|
/* XXX allow lock-free panic */ \
|
|
bsp_apic_ready = 0; \
|
|
panic("\ncil: 0x%08x", cil); \
|
|
}
|
|
#else
|
|
#define SPIN_SPL \
|
|
if (++z >= MAXZ) { \
|
|
/* XXX allow lock-free panic */ \
|
|
bsp_apic_ready = 0; \
|
|
printf("\ncil: 0x%08x", cil); \
|
|
breakpoint(); \
|
|
}
|
|
#endif /* 0/1 */
|
|
#else /* SPL_DEBUG */
|
|
#define SPIN_VAR
|
|
#define SPIN_RESET
|
|
#define SPIN_SPL
|
|
#endif /* SPL_DEBUG */
|
|
|
|
#endif
|
|
|
|
#ifdef INTR_SPL
|
|
|
|
#define GENSPL(NAME, OP, MODIFIER, PC) \
|
|
GENSPLASSERT(NAME, MODIFIER) \
|
|
unsigned NAME(void) \
|
|
{ \
|
|
unsigned x, y; \
|
|
SPIN_VAR; \
|
|
\
|
|
if (!bsp_apic_ready) { \
|
|
x = cpl; \
|
|
cpl OP MODIFIER; \
|
|
return (x); \
|
|
} \
|
|
\
|
|
for (;;) { \
|
|
IFCPL_LOCK(); /* MP-safe */ \
|
|
x = y = cpl; /* current value */ \
|
|
POSTCODE(0x20 | PC); \
|
|
if (inside_intr) \
|
|
break; /* XXX only 1 INT allowed */ \
|
|
y OP MODIFIER; /* desired value */ \
|
|
if (cil & y) { /* not now */ \
|
|
IFCPL_UNLOCK(); /* allow cil to change */ \
|
|
SPIN_RESET; \
|
|
while (cil & y) \
|
|
SPIN_SPL \
|
|
continue; /* try again */ \
|
|
} \
|
|
break; \
|
|
} \
|
|
cpl OP MODIFIER; /* make the change */ \
|
|
IFCPL_UNLOCK(); \
|
|
\
|
|
return (x); \
|
|
}
|
|
|
|
#else /* INTR_SPL */
|
|
|
|
#define GENSPL(NAME, OP, MODIFIER, PC) \
|
|
GENSPLASSERT(NAME, MODIFIER) \
|
|
unsigned NAME(void) \
|
|
{ \
|
|
unsigned x; \
|
|
\
|
|
IFCPL_LOCK(); \
|
|
x = cpl; \
|
|
cpl OP MODIFIER; \
|
|
IFCPL_UNLOCK(); \
|
|
\
|
|
return (x); \
|
|
}
|
|
|
|
#endif /* INTR_SPL */
|
|
|
|
|
|
void
|
|
spl0(void)
|
|
{
|
|
int unpend;
|
|
#ifdef INTR_SPL
|
|
SPIN_VAR;
|
|
|
|
for (;;) {
|
|
IFCPL_LOCK();
|
|
POSTCODE_HI(0xc);
|
|
/*
|
|
* XXX SWI_AST_MASK in ipending has moved to 1 in astpending,
|
|
* so the following code is dead, but just removing it may
|
|
* not be right.
|
|
*/
|
|
#if 0
|
|
if (cil & SWI_AST_MASK) { /* not now */
|
|
IFCPL_UNLOCK(); /* allow cil to change */
|
|
SPIN_RESET;
|
|
while (cil & SWI_AST_MASK)
|
|
SPIN_SPL
|
|
continue; /* try again */
|
|
}
|
|
#endif
|
|
break;
|
|
}
|
|
#else /* INTR_SPL */
|
|
IFCPL_LOCK();
|
|
#endif /* INTR_SPL */
|
|
|
|
cpl = 0;
|
|
unpend = ipending;
|
|
IFCPL_UNLOCK();
|
|
|
|
if (unpend && !inside_intr)
|
|
splz();
|
|
}
|
|
|
|
void
|
|
splx(unsigned ipl)
|
|
{
|
|
int unpend;
|
|
#ifdef INTR_SPL
|
|
SPIN_VAR;
|
|
|
|
for (;;) {
|
|
IFCPL_LOCK();
|
|
POSTCODE_HI(0xe);
|
|
if (inside_intr)
|
|
break; /* XXX only 1 INT allowed */
|
|
POSTCODE_HI(0xf);
|
|
if (cil & ipl) { /* not now */
|
|
IFCPL_UNLOCK(); /* allow cil to change */
|
|
SPIN_RESET;
|
|
while (cil & ipl)
|
|
SPIN_SPL
|
|
continue; /* try again */
|
|
}
|
|
break;
|
|
}
|
|
#else /* INTR_SPL */
|
|
IFCPL_LOCK();
|
|
#endif /* INTR_SPL */
|
|
|
|
cpl = ipl;
|
|
unpend = ipending & ~ipl;
|
|
IFCPL_UNLOCK();
|
|
|
|
if (unpend && !inside_intr)
|
|
splz();
|
|
}
|
|
|
|
|
|
/*
|
|
* Replaces UP specific inline found in (?) pci/pci_support.c.
|
|
*
|
|
* Stefan said:
|
|
* You know, that splq() is used in the shared interrupt multiplexer, and that
|
|
* the SMP version should not have too much overhead. If it is significantly
|
|
* slower, then moving the splq() out of the loop in intr_mux() and passing in
|
|
* the logical OR of all mask values might be a better solution than the
|
|
* current code. (This logical OR could of course be pre-calculated whenever
|
|
* another shared interrupt is registered ...)
|
|
*/
|
|
intrmask_t
|
|
splq(intrmask_t mask)
|
|
{
|
|
intrmask_t tmp;
|
|
#ifdef INTR_SPL
|
|
intrmask_t tmp2;
|
|
|
|
for (;;) {
|
|
IFCPL_LOCK();
|
|
tmp = tmp2 = cpl;
|
|
tmp2 |= mask;
|
|
if (cil & tmp2) { /* not now */
|
|
IFCPL_UNLOCK(); /* allow cil to change */
|
|
while (cil & tmp2)
|
|
/* spin */ ;
|
|
continue; /* try again */
|
|
}
|
|
break;
|
|
}
|
|
cpl = tmp2;
|
|
#else /* INTR_SPL */
|
|
IFCPL_LOCK();
|
|
tmp = cpl;
|
|
cpl |= mask;
|
|
#endif /* INTR_SPL */
|
|
|
|
IFCPL_UNLOCK();
|
|
return (tmp);
|
|
}
|
|
|
|
#endif /* !SMP */
|
|
|
|
/* Finally, generate the actual spl*() functions */
|
|
|
|
/* NAME: OP: MODIFIER: PC: */
|
|
GENSPL(splbio, |=, bio_imask, 2)
|
|
GENSPL(splcam, |=, cam_imask, 7)
|
|
GENSPL(splclock, =, HWI_MASK | SWI_MASK, 3)
|
|
GENSPL(splhigh, =, HWI_MASK | SWI_MASK, 4)
|
|
GENSPL(splimp, |=, net_imask, 5)
|
|
GENSPL(splnet, |=, SWI_NET_MASK, 6)
|
|
GENSPL(splsoftcam, |=, SWI_CAMBIO_MASK | SWI_CAMNET_MASK, 8)
|
|
GENSPL(splsoftcambio, |=, SWI_CAMBIO_MASK, 9)
|
|
GENSPL(splsoftcamnet, |=, SWI_CAMNET_MASK, 10)
|
|
GENSPL(splsoftclock, =, SWI_CLOCK_MASK, 11)
|
|
GENSPL(splsofttty, |=, SWI_TTY_MASK, 12)
|
|
GENSPL(splsoftvm, |=, SWI_VM_MASK, 16)
|
|
GENSPL(splstatclock, |=, stat_imask, 13)
|
|
GENSPL(spltty, |=, tty_imask, 14)
|
|
GENSPL(splvm, |=, net_imask | bio_imask | cam_imask, 15)
|