/*- * 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. */ /* * Copyright (c) 1997, Stefan Esser * 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. * * $FreeBSD: src/sys/sys/interrupt.h,v 1.9.2.1 2001/10/14 20:05:50 luigi Exp $ * $FreeBSD: src/sys/i386/include/ipl.h,v 1.17.2.3 2002/12/17 18:04:02 sam Exp $ * $DragonFly: src/sys/sys/interrupt.h,v 1.19 2008/05/14 11:59:24 sephe Exp $ */ #ifndef _SYS_INTERRUPT_H_ #define _SYS_INTERRUPT_H_ /* * System hard and soft interrupt limits. Note that the architecture may * further limit available hardware and software interrupts. */ #define MAX_HARDINTS 192 #define MAX_SOFTINTS 64 #define FIRST_SOFTINT MAX_HARDINTS #define MAX_INTS (MAX_HARDINTS + MAX_SOFTINTS) typedef void inthand2_t (void *, void *); /* * Software interrupt bit numbers in priority order. The priority only * determines which swi will be dispatched next; a higher priority swi * may be dispatched when a nested h/w interrupt handler returns. */ #define SWI_TTY (FIRST_SOFTINT + 0) #define SWI_UNUSED01 (FIRST_SOFTINT + 1) #define SWI_CAMNET (FIRST_SOFTINT + 2) #define SWI_CRYPTO SWI_CAMNET #define SWI_CAMBIO (FIRST_SOFTINT + 3) #define SWI_VM (FIRST_SOFTINT + 4) #define SWI_TQ (FIRST_SOFTINT + 5) #define SWI_UNUSED02 (FIRST_SOFTINT + 6) /* * Corresponding interrupt-pending bits for spending. NOTE: i386 only * supports 32 software interupts (due to its gd_spending mask). */ #define SWI_TTY_PENDING (1 << (SWI_TTY - FIRST_SOFTINT)) #define SWI_UNUSED01_PENDING (1 << (SWI_UNUSED01 - FIRST_SOFTINT)) #define SWI_CAMNET_PENDING (1 << (SWI_CAMNET - FIRST_SOFTINT)) #define SWI_CRYPTO_PENDING SWI_CAMNET_PENDING #define SWI_CAMBIO_PENDING (1 << (SWI_CAMBIO - FIRST_SOFTINT)) #define SWI_VM_PENDING (1 << (SWI_VM - FIRST_SOFTINT)) #define SWI_TQ_PENDING (1 << (SWI_TQ - FIRST_SOFTINT)) #define SWI_UNUSED02_PENDING (1 << (SWI_UNUSED02 - FIRST_SOFTINT)) #ifdef _KERNEL struct intrframe; struct thread; struct lwkt_serialize; void *register_swi(int intr, inthand2_t *handler, void *arg, const char *name, struct lwkt_serialize *serializer, int cpuid); void *register_swi_mp(int intr, inthand2_t *handler, void *arg, const char *name, struct lwkt_serialize *serializer, int cpuid); void *register_int(int intr, inthand2_t *handler, void *arg, const char *name, struct lwkt_serialize *serializer, int flags, int cpuid); long get_interrupt_counter(int intr, int cpuid); void unregister_swi(void *id, int intr, int cpuid); void unregister_int(void *id, int cpuid); void register_randintr(int intr); void unregister_randintr(int intr); int next_registered_randintr(int intr); void sched_ithd_soft(int intr); /* procedure called from MD */ void sched_ithd_hard(int intr); /* procedure called from MD */ #ifdef _KERNEL_VIRTUAL void *register_int_virtual(int intr, inthand2_t *handler, void *arg, const char *name, struct lwkt_serialize *serializer, int flags); void unregister_int_virtual(void *id); void sched_ithd_hard_virtual(int intr); #endif extern char eintrnames[]; /* end of intrnames[] */ extern char intrnames[]; /* string table containing device names */ #endif #endif