root/sys/arch/arm/sa11x0/sa11x0_irqhandler.c
/*      $NetBSD: sa11x0_irqhandler.c,v 1.20 2020/11/20 18:37:30 thorpej Exp $   */

/*-
 * Copyright (c) 1996, 1997, 1998, 2001 The NetBSD Foundation, Inc.
 * All rights reserved.
 *
 * This code is derived from software contributed to the NetBSD Foundation
 * by IWAMOTO Toshihiro.
 *
 * This code is derived from software contributed to The NetBSD Foundation
 * by Charles M. Hannum and by Jason R. Thorpe of the Numerical Aerospace
 * Simulation Facility, NASA Ames Research Center.
 *
 * 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 NETBSD FOUNDATION, INC. 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 FOUNDATION 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) 1991 The Regents of the University of California.
 * All rights reserved.
 *
 * This code is derived from software contributed to Berkeley by
 * William Jolitz.
 *
 * 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. 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.
 *
 *      @(#)isa.c       7.2 (Berkeley) 5/13/91
 */


#include <sys/cdefs.h>
__KERNEL_RCSID(0, "$NetBSD: sa11x0_irqhandler.c,v 1.20 2020/11/20 18:37:30 thorpej Exp $");

#include "opt_irqstats.h"

#include <sys/param.h>
#include <sys/kernel.h>
#include <sys/systm.h>
#include <sys/syslog.h>
#include <sys/cpu.h>
#include <sys/intr.h>
#include <sys/kmem.h>

#include <uvm/uvm_extern.h>

#include <arm/arm32/machdep.h>
#include <arm/sa11x0/sa11x0_reg.h>
#include <arm/sa11x0/sa11x0_var.h>

irqhandler_t *irqhandlers[NIRQS];

u_int actual_mask;
u_int irqmasks[NIPL];

static int fakeintr(void *);
#ifdef INTR_DEBUG
static int dumpirqhandlers(void);
#endif
void intr_calculatemasks(void);

const struct evcnt *sa11x0_intr_evcnt(sa11x0_chipset_tag_t, int);
void stray_irqhandler(void *);

#if IPL_NONE > IPL_HIGH 
#error IPL_NONE must be less than IPL_HIGH
#endif
/*
 * Recalculate the interrupt masks from scratch.
 * We could code special registry and deregistry versions of this function that
 * would be faster, but the code would be nastier, and we don't expect this to
 * happen very much anyway.
 */
void
intr_calculatemasks(void)
{
        int i, irq, ipl;
        struct irqhandler *q;
        int intrlevel[ICU_LEN];

        /* First, figure out which levels each IRQ uses. */
        for (irq = 0; irq < ICU_LEN; irq++) {
                int ipls = 0;
                for (q = irqhandlers[irq]; q; q = q->ih_next)
                        ipls |= 1 << q->ih_level;
                intrlevel[irq] = ipls;
        }

        /* Then figure out which IRQs use each level. */
        for (ipl = 0; ipl < NIPL; ipl++) {
                int irqs = 0;
                for (irq = 0; irq < ICU_LEN; irq++)
                        if (intrlevel[irq] & (1 << ipl))
                                irqs |= 1 << irq;

                /* First enable the interrupt(s) at all lower level(s) */
                for(i = 0; i < ipl; ++i)
                        irqmasks[i] |= irqs;

                /* Then disable the interrupt(s) at all higher level(s) */
                for( ; i < NIPL-1; ++i)
                        irqmasks[i] &= ~irqs;

        }

        /*
         * Enforce a hierarchy that gives slow devices a better chance at not
         * dropping data.
         */
        for (ipl = 0; ipl < NIPL - 1; ipl++)
                irqmasks[ipl + 1] &= irqmasks[ipl];
}


const struct evcnt *
sa11x0_intr_evcnt(sa11x0_chipset_tag_t ic, int irq)
{

        /* XXX for now, no evcnt parent reported */
        return NULL;
}

void *
sa11x0_intr_establish(sa11x0_chipset_tag_t ic, int irq, int type, int level,
    int (*ih_fun)(void *), void *ih_arg)
{
        int saved_cpsr;
        struct irqhandler **p, *q, *ih;
        static struct irqhandler fakehand = {fakeintr};

        ih = kmem_alloc(sizeof *ih, KM_SLEEP);

        if (irq < 0 || irq >= ICU_LEN || type == IST_NONE)
                panic("intr_establish: bogus irq or type");

        /* All interrupts are level intrs. */

        /*
         * Figure out where to put the handler.
         * This is O(N^2), but we want to preserve the order, and N is
         * generally small.
         */
        for (p = &irqhandlers[irq]; (q = *p) != NULL; p = &q->ih_next)
                continue;

        /*
         * Actually install a fake handler momentarily, since we might be doing
         * this with interrupts enabled and don't want the real routine called
         * until masking is set up.
         */
        fakehand.ih_level = level;
        *p = &fakehand;

        intr_calculatemasks();

        /*
         * Poke the real handler in now.
         */
        ih->ih_func = ih_fun;
        ih->ih_arg = ih_arg;
#ifdef hpcarm
        ih->ih_count = 0;
#else
        ih->ih_num = 0;
#endif
        ih->ih_next = NULL;
        ih->ih_level = level;
#ifdef hpcarm
        ih->ih_irq = irq;
#endif
        ih->ih_name = NULL; /* XXX */
        *p = ih;

        saved_cpsr = SetCPSR(I32_bit, I32_bit);
        set_spl_masks();

        irq_setmasks();

        SetCPSR(I32_bit, saved_cpsr & I32_bit);
#ifdef INTR_DEBUG
        dumpirqhandlers();
#endif
        return ih;
}

/*
 * Deregister an interrupt handler.
 */
void
sa11x0_intr_disestablish(sa11x0_chipset_tag_t ic, void *arg)
{
        struct irqhandler *ih = arg;
        int irq = ih->ih_irq;
        int saved_cpsr;
        struct irqhandler **p, *q;

#if DIAGNOSTIC
        if (irq < 0 || irq >= ICU_LEN)
                panic("intr_disestablish: bogus irq");
#endif

        /*
         * Remove the handler from the chain.
         * This is O(n^2), too.
         */
        for (p = &irqhandlers[irq]; (q = *p) != NULL && q != ih;
             p = &q->ih_next)
                continue;
        if (q)
                *p = q->ih_next;
        else
                panic("intr_disestablish: handler not registered");
        kmem_free(ih, sizeof(*ih));

        intr_calculatemasks();
        saved_cpsr = SetCPSR(I32_bit, I32_bit);
        set_spl_masks();

        irq_setmasks();
        SetCPSR(I32_bit, saved_cpsr & I32_bit);

}

void
stray_irqhandler(void *p)
{
        int irq = (int)p;
        printf("stray interrupt %d\n", irq);
}

int
fakeintr(void *p)
{

        return 0;
}

#ifdef INTR_DEBUG
int
dumpirqhandlers(void)
{
        int irq;
        struct irqhandler *p;

        for (irq = 0; irq < ICU_LEN; irq++) {
                printf("irq %d:", irq);
                p = irqhandlers[irq];
                for (; p; p = p->ih_next)
                        printf("ih_func: 0x%lx, ", (unsigned long)p->ih_func);
                printf("\n");
        }
        return 0;
}
#endif