Home | History | Annotate | Line # | Download | only in sa11x0
      1 /*	$NetBSD: sa11x0_irqhandler.c,v 1.20 2020/11/20 18:37:30 thorpej Exp $	*/
      2 
      3 /*-
      4  * Copyright (c) 1996, 1997, 1998, 2001 The NetBSD Foundation, Inc.
      5  * All rights reserved.
      6  *
      7  * This code is derived from software contributed to the NetBSD Foundation
      8  * by IWAMOTO Toshihiro.
      9  *
     10  * This code is derived from software contributed to The NetBSD Foundation
     11  * by Charles M. Hannum and by Jason R. Thorpe of the Numerical Aerospace
     12  * Simulation Facility, NASA Ames Research Center.
     13  *
     14  * Redistribution and use in source and binary forms, with or without
     15  * modification, are permitted provided that the following conditions
     16  * are met:
     17  * 1. Redistributions of source code must retain the above copyright
     18  *    notice, this list of conditions and the following disclaimer.
     19  * 2. Redistributions in binary form must reproduce the above copyright
     20  *    notice, this list of conditions and the following disclaimer in the
     21  *    documentation and/or other materials provided with the distribution.
     22  *
     23  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     24  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     25  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     26  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     27  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     28  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     29  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     30  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     31  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     32  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     33  * POSSIBILITY OF SUCH DAMAGE.
     34  */
     35 
     36 /*-
     37  * Copyright (c) 1991 The Regents of the University of California.
     38  * All rights reserved.
     39  *
     40  * This code is derived from software contributed to Berkeley by
     41  * William Jolitz.
     42  *
     43  * Redistribution and use in source and binary forms, with or without
     44  * modification, are permitted provided that the following conditions
     45  * are met:
     46  * 1. Redistributions of source code must retain the above copyright
     47  *    notice, this list of conditions and the following disclaimer.
     48  * 2. Redistributions in binary form must reproduce the above copyright
     49  *    notice, this list of conditions and the following disclaimer in the
     50  *    documentation and/or other materials provided with the distribution.
     51  * 3. Neither the name of the University nor the names of its contributors
     52  *    may be used to endorse or promote products derived from this software
     53  *    without specific prior written permission.
     54  *
     55  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     56  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     57  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     58  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     59  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     60  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     61  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     62  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     63  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     64  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     65  * SUCH DAMAGE.
     66  *
     67  *	@(#)isa.c	7.2 (Berkeley) 5/13/91
     68  */
     69 
     70 
     71 #include <sys/cdefs.h>
     72 __KERNEL_RCSID(0, "$NetBSD: sa11x0_irqhandler.c,v 1.20 2020/11/20 18:37:30 thorpej Exp $");
     73 
     74 #include "opt_irqstats.h"
     75 
     76 #include <sys/param.h>
     77 #include <sys/kernel.h>
     78 #include <sys/systm.h>
     79 #include <sys/syslog.h>
     80 #include <sys/cpu.h>
     81 #include <sys/intr.h>
     82 #include <sys/kmem.h>
     83 
     84 #include <uvm/uvm_extern.h>
     85 
     86 #include <arm/arm32/machdep.h>
     87 #include <arm/sa11x0/sa11x0_reg.h>
     88 #include <arm/sa11x0/sa11x0_var.h>
     89 
     90 irqhandler_t *irqhandlers[NIRQS];
     91 
     92 u_int actual_mask;
     93 u_int irqmasks[NIPL];
     94 
     95 static int fakeintr(void *);
     96 #ifdef INTR_DEBUG
     97 static int dumpirqhandlers(void);
     98 #endif
     99 void intr_calculatemasks(void);
    100 
    101 const struct evcnt *sa11x0_intr_evcnt(sa11x0_chipset_tag_t, int);
    102 void stray_irqhandler(void *);
    103 
    104 #if IPL_NONE > IPL_HIGH
    105 #error IPL_NONE must be less than IPL_HIGH
    106 #endif
    107 /*
    108  * Recalculate the interrupt masks from scratch.
    109  * We could code special registry and deregistry versions of this function that
    110  * would be faster, but the code would be nastier, and we don't expect this to
    111  * happen very much anyway.
    112  */
    113 void
    114 intr_calculatemasks(void)
    115 {
    116 	int i, irq, ipl;
    117 	struct irqhandler *q;
    118 	int intrlevel[ICU_LEN];
    119 
    120 	/* First, figure out which levels each IRQ uses. */
    121 	for (irq = 0; irq < ICU_LEN; irq++) {
    122 		int ipls = 0;
    123 		for (q = irqhandlers[irq]; q; q = q->ih_next)
    124 			ipls |= 1 << q->ih_level;
    125 		intrlevel[irq] = ipls;
    126 	}
    127 
    128 	/* Then figure out which IRQs use each level. */
    129 	for (ipl = 0; ipl < NIPL; ipl++) {
    130 		int irqs = 0;
    131 		for (irq = 0; irq < ICU_LEN; irq++)
    132 			if (intrlevel[irq] & (1 << ipl))
    133 				irqs |= 1 << irq;
    134 
    135 		/* First enable the interrupt(s) at all lower level(s) */
    136 		for(i = 0; i < ipl; ++i)
    137 			irqmasks[i] |= irqs;
    138 
    139 		/* Then disable the interrupt(s) at all higher level(s) */
    140 		for( ; i < NIPL-1; ++i)
    141 			irqmasks[i] &= ~irqs;
    142 
    143 	}
    144 
    145 	/*
    146 	 * Enforce a hierarchy that gives slow devices a better chance at not
    147 	 * dropping data.
    148 	 */
    149 	for (ipl = 0; ipl < NIPL - 1; ipl++)
    150 		irqmasks[ipl + 1] &= irqmasks[ipl];
    151 }
    152 
    153 
    154 const struct evcnt *
    155 sa11x0_intr_evcnt(sa11x0_chipset_tag_t ic, int irq)
    156 {
    157 
    158 	/* XXX for now, no evcnt parent reported */
    159 	return NULL;
    160 }
    161 
    162 void *
    163 sa11x0_intr_establish(sa11x0_chipset_tag_t ic, int irq, int type, int level,
    164     int (*ih_fun)(void *), void *ih_arg)
    165 {
    166 	int saved_cpsr;
    167 	struct irqhandler **p, *q, *ih;
    168 	static struct irqhandler fakehand = {fakeintr};
    169 
    170 	ih = kmem_alloc(sizeof *ih, KM_SLEEP);
    171 
    172 	if (irq < 0 || irq >= ICU_LEN || type == IST_NONE)
    173 		panic("intr_establish: bogus irq or type");
    174 
    175 	/* All interrupts are level intrs. */
    176 
    177 	/*
    178 	 * Figure out where to put the handler.
    179 	 * This is O(N^2), but we want to preserve the order, and N is
    180 	 * generally small.
    181 	 */
    182 	for (p = &irqhandlers[irq]; (q = *p) != NULL; p = &q->ih_next)
    183 		continue;
    184 
    185 	/*
    186 	 * Actually install a fake handler momentarily, since we might be doing
    187 	 * this with interrupts enabled and don't want the real routine called
    188 	 * until masking is set up.
    189 	 */
    190 	fakehand.ih_level = level;
    191 	*p = &fakehand;
    192 
    193 	intr_calculatemasks();
    194 
    195 	/*
    196 	 * Poke the real handler in now.
    197 	 */
    198 	ih->ih_func = ih_fun;
    199 	ih->ih_arg = ih_arg;
    200 #ifdef hpcarm
    201 	ih->ih_count = 0;
    202 #else
    203 	ih->ih_num = 0;
    204 #endif
    205 	ih->ih_next = NULL;
    206 	ih->ih_level = level;
    207 #ifdef hpcarm
    208 	ih->ih_irq = irq;
    209 #endif
    210 	ih->ih_name = NULL; /* XXX */
    211 	*p = ih;
    212 
    213 	saved_cpsr = SetCPSR(I32_bit, I32_bit);
    214 	set_spl_masks();
    215 
    216 	irq_setmasks();
    217 
    218 	SetCPSR(I32_bit, saved_cpsr & I32_bit);
    219 #ifdef INTR_DEBUG
    220 	dumpirqhandlers();
    221 #endif
    222 	return ih;
    223 }
    224 
    225 /*
    226  * Deregister an interrupt handler.
    227  */
    228 void
    229 sa11x0_intr_disestablish(sa11x0_chipset_tag_t ic, void *arg)
    230 {
    231 	struct irqhandler *ih = arg;
    232 	int irq = ih->ih_irq;
    233 	int saved_cpsr;
    234 	struct irqhandler **p, *q;
    235 
    236 #if DIAGNOSTIC
    237 	if (irq < 0 || irq >= ICU_LEN)
    238 		panic("intr_disestablish: bogus irq");
    239 #endif
    240 
    241 	/*
    242 	 * Remove the handler from the chain.
    243 	 * This is O(n^2), too.
    244 	 */
    245 	for (p = &irqhandlers[irq]; (q = *p) != NULL && q != ih;
    246 	     p = &q->ih_next)
    247 		continue;
    248 	if (q)
    249 		*p = q->ih_next;
    250 	else
    251 		panic("intr_disestablish: handler not registered");
    252 	kmem_free(ih, sizeof(*ih));
    253 
    254 	intr_calculatemasks();
    255 	saved_cpsr = SetCPSR(I32_bit, I32_bit);
    256 	set_spl_masks();
    257 
    258 	irq_setmasks();
    259 	SetCPSR(I32_bit, saved_cpsr & I32_bit);
    260 
    261 }
    262 
    263 void
    264 stray_irqhandler(void *p)
    265 {
    266 	int irq = (int)p;
    267 	printf("stray interrupt %d\n", irq);
    268 }
    269 
    270 int
    271 fakeintr(void *p)
    272 {
    273 
    274 	return 0;
    275 }
    276 
    277 #ifdef INTR_DEBUG
    278 int
    279 dumpirqhandlers(void)
    280 {
    281 	int irq;
    282 	struct irqhandler *p;
    283 
    284 	for (irq = 0; irq < ICU_LEN; irq++) {
    285 		printf("irq %d:", irq);
    286 		p = irqhandlers[irq];
    287 		for (; p; p = p->ih_next)
    288 			printf("ih_func: 0x%lx, ", (unsigned long)p->ih_func);
    289 		printf("\n");
    290 	}
    291 	return 0;
    292 }
    293 #endif
    294