12be6bb0cSPaul Mundt /*
22be6bb0cSPaul Mundt * Support for virtual IRQ subgroups.
32be6bb0cSPaul Mundt *
42be6bb0cSPaul Mundt * Copyright (C) 2010 Paul Mundt
52be6bb0cSPaul Mundt *
62be6bb0cSPaul Mundt * This file is subject to the terms and conditions of the GNU General Public
72be6bb0cSPaul Mundt * License. See the file "COPYING" in the main directory of this archive
82be6bb0cSPaul Mundt * for more details.
92be6bb0cSPaul Mundt */
102be6bb0cSPaul Mundt #define pr_fmt(fmt) "intc: " fmt
112be6bb0cSPaul Mundt
122be6bb0cSPaul Mundt #include <linux/slab.h>
132be6bb0cSPaul Mundt #include <linux/irq.h>
142be6bb0cSPaul Mundt #include <linux/list.h>
152be6bb0cSPaul Mundt #include <linux/radix-tree.h>
162be6bb0cSPaul Mundt #include <linux/spinlock.h>
1707c92739SPaul Gortmaker #include <linux/export.h>
182be6bb0cSPaul Mundt #include "internals.h"
192be6bb0cSPaul Mundt
200f552393SRob Herring static struct intc_map_entry intc_irq_xlate[INTC_NR_IRQS];
212be6bb0cSPaul Mundt
222be6bb0cSPaul Mundt struct intc_virq_list {
232be6bb0cSPaul Mundt unsigned int irq;
242be6bb0cSPaul Mundt struct intc_virq_list *next;
252be6bb0cSPaul Mundt };
262be6bb0cSPaul Mundt
272be6bb0cSPaul Mundt #define for_each_virq(entry, head) \
282be6bb0cSPaul Mundt for (entry = head; entry; entry = entry->next)
292be6bb0cSPaul Mundt
302be6bb0cSPaul Mundt /*
312be6bb0cSPaul Mundt * Tags for the radix tree
322be6bb0cSPaul Mundt */
332be6bb0cSPaul Mundt #define INTC_TAG_VIRQ_NEEDS_ALLOC 0
342be6bb0cSPaul Mundt
intc_irq_xlate_set(unsigned int irq,intc_enum id,struct intc_desc_int * d)352be6bb0cSPaul Mundt void intc_irq_xlate_set(unsigned int irq, intc_enum id, struct intc_desc_int *d)
362be6bb0cSPaul Mundt {
372be6bb0cSPaul Mundt unsigned long flags;
382be6bb0cSPaul Mundt
392be6bb0cSPaul Mundt raw_spin_lock_irqsave(&intc_big_lock, flags);
402be6bb0cSPaul Mundt intc_irq_xlate[irq].enum_id = id;
412be6bb0cSPaul Mundt intc_irq_xlate[irq].desc = d;
422be6bb0cSPaul Mundt raw_spin_unlock_irqrestore(&intc_big_lock, flags);
432be6bb0cSPaul Mundt }
442be6bb0cSPaul Mundt
intc_irq_xlate_get(unsigned int irq)452be6bb0cSPaul Mundt struct intc_map_entry *intc_irq_xlate_get(unsigned int irq)
462be6bb0cSPaul Mundt {
472be6bb0cSPaul Mundt return intc_irq_xlate + irq;
482be6bb0cSPaul Mundt }
492be6bb0cSPaul Mundt
intc_irq_lookup(const char * chipname,intc_enum enum_id)502be6bb0cSPaul Mundt int intc_irq_lookup(const char *chipname, intc_enum enum_id)
512be6bb0cSPaul Mundt {
522be6bb0cSPaul Mundt struct intc_map_entry *ptr;
532be6bb0cSPaul Mundt struct intc_desc_int *d;
542be6bb0cSPaul Mundt int irq = -1;
552be6bb0cSPaul Mundt
562be6bb0cSPaul Mundt list_for_each_entry(d, &intc_list, list) {
572be6bb0cSPaul Mundt int tagged;
582be6bb0cSPaul Mundt
592be6bb0cSPaul Mundt if (strcmp(d->chip.name, chipname) != 0)
602be6bb0cSPaul Mundt continue;
612be6bb0cSPaul Mundt
622be6bb0cSPaul Mundt /*
632be6bb0cSPaul Mundt * Catch early lookups for subgroup VIRQs that have not
642be6bb0cSPaul Mundt * yet been allocated an IRQ. This already includes a
652be6bb0cSPaul Mundt * fast-path out if the tree is untagged, so there is no
662be6bb0cSPaul Mundt * need to explicitly test the root tree.
672be6bb0cSPaul Mundt */
682be6bb0cSPaul Mundt tagged = radix_tree_tag_get(&d->tree, enum_id,
692be6bb0cSPaul Mundt INTC_TAG_VIRQ_NEEDS_ALLOC);
702be6bb0cSPaul Mundt if (unlikely(tagged))
712be6bb0cSPaul Mundt break;
722be6bb0cSPaul Mundt
732be6bb0cSPaul Mundt ptr = radix_tree_lookup(&d->tree, enum_id);
742be6bb0cSPaul Mundt if (ptr) {
752be6bb0cSPaul Mundt irq = ptr - intc_irq_xlate;
762be6bb0cSPaul Mundt break;
772be6bb0cSPaul Mundt }
782be6bb0cSPaul Mundt }
792be6bb0cSPaul Mundt
802be6bb0cSPaul Mundt return irq;
812be6bb0cSPaul Mundt }
822be6bb0cSPaul Mundt EXPORT_SYMBOL_GPL(intc_irq_lookup);
832be6bb0cSPaul Mundt
add_virq_to_pirq(unsigned int irq,unsigned int virq)842be6bb0cSPaul Mundt static int add_virq_to_pirq(unsigned int irq, unsigned int virq)
852be6bb0cSPaul Mundt {
86d0abe2f3SJiang Liu struct intc_virq_list *entry;
87d0abe2f3SJiang Liu struct intc_virq_list **last = NULL;
882be6bb0cSPaul Mundt
892be6bb0cSPaul Mundt /* scan for duplicates */
90d0abe2f3SJiang Liu for_each_virq(entry, irq_get_handler_data(irq)) {
912be6bb0cSPaul Mundt if (entry->irq == virq)
922be6bb0cSPaul Mundt return 0;
932be6bb0cSPaul Mundt last = &entry->next;
942be6bb0cSPaul Mundt }
952be6bb0cSPaul Mundt
962be6bb0cSPaul Mundt entry = kzalloc(sizeof(struct intc_virq_list), GFP_ATOMIC);
97*c509e05fSSF Markus Elfring if (!entry)
982be6bb0cSPaul Mundt return -ENOMEM;
992be6bb0cSPaul Mundt
1002be6bb0cSPaul Mundt entry->irq = virq;
1012be6bb0cSPaul Mundt
102d0abe2f3SJiang Liu if (last)
1032be6bb0cSPaul Mundt *last = entry;
104d0abe2f3SJiang Liu else
105d0abe2f3SJiang Liu irq_set_handler_data(irq, entry);
1062be6bb0cSPaul Mundt
1072be6bb0cSPaul Mundt return 0;
1082be6bb0cSPaul Mundt }
1092be6bb0cSPaul Mundt
intc_virq_handler(struct irq_desc * desc)110bd0b9ac4SThomas Gleixner static void intc_virq_handler(struct irq_desc *desc)
1112be6bb0cSPaul Mundt {
112c497615cSThomas Gleixner unsigned int irq = irq_desc_get_irq(desc);
1138228a048SJiang Liu struct irq_data *data = irq_desc_get_irq_data(desc);
11426599a94SPaul Mundt struct irq_chip *chip = irq_data_get_irq_chip(data);
115fcb8918fSThomas Gleixner struct intc_virq_list *entry, *vlist = irq_data_get_irq_handler_data(data);
1162be6bb0cSPaul Mundt struct intc_desc_int *d = get_intc_desc(irq);
1172be6bb0cSPaul Mundt
11826599a94SPaul Mundt chip->irq_mask_ack(data);
1192be6bb0cSPaul Mundt
1202be6bb0cSPaul Mundt for_each_virq(entry, vlist) {
1212be6bb0cSPaul Mundt unsigned long addr, handle;
1228228a048SJiang Liu struct irq_desc *vdesc = irq_to_desc(entry->irq);
1232be6bb0cSPaul Mundt
1248228a048SJiang Liu if (vdesc) {
1258228a048SJiang Liu handle = (unsigned long)irq_desc_get_handler_data(vdesc);
1262be6bb0cSPaul Mundt addr = INTC_REG(d, _INTC_ADDR_E(handle), 0);
1272be6bb0cSPaul Mundt if (intc_reg_fns[_INTC_FN(handle)](addr, handle, 0))
128bd0b9ac4SThomas Gleixner generic_handle_irq_desc(vdesc);
1298228a048SJiang Liu }
1302be6bb0cSPaul Mundt }
1312be6bb0cSPaul Mundt
13226599a94SPaul Mundt chip->irq_unmask(data);
1332be6bb0cSPaul Mundt }
1342be6bb0cSPaul Mundt
intc_subgroup_data(struct intc_subgroup * subgroup,struct intc_desc_int * d,unsigned int index)1352be6bb0cSPaul Mundt static unsigned long __init intc_subgroup_data(struct intc_subgroup *subgroup,
1362be6bb0cSPaul Mundt struct intc_desc_int *d,
1372be6bb0cSPaul Mundt unsigned int index)
1382be6bb0cSPaul Mundt {
1392be6bb0cSPaul Mundt unsigned int fn = REG_FN_TEST_BASE + (subgroup->reg_width >> 3) - 1;
1402be6bb0cSPaul Mundt
1412be6bb0cSPaul Mundt return _INTC_MK(fn, MODE_ENABLE_REG, intc_get_reg(d, subgroup->reg),
1422be6bb0cSPaul Mundt 0, 1, (subgroup->reg_width - 1) - index);
1432be6bb0cSPaul Mundt }
1442be6bb0cSPaul Mundt
intc_subgroup_init_one(struct intc_desc * desc,struct intc_desc_int * d,struct intc_subgroup * subgroup)1452be6bb0cSPaul Mundt static void __init intc_subgroup_init_one(struct intc_desc *desc,
1462be6bb0cSPaul Mundt struct intc_desc_int *d,
1472be6bb0cSPaul Mundt struct intc_subgroup *subgroup)
1482be6bb0cSPaul Mundt {
1492be6bb0cSPaul Mundt struct intc_map_entry *mapped;
1502be6bb0cSPaul Mundt unsigned int pirq;
1512be6bb0cSPaul Mundt unsigned long flags;
1522be6bb0cSPaul Mundt int i;
1532be6bb0cSPaul Mundt
1542be6bb0cSPaul Mundt mapped = radix_tree_lookup(&d->tree, subgroup->parent_id);
1552be6bb0cSPaul Mundt if (!mapped) {
1562be6bb0cSPaul Mundt WARN_ON(1);
1572be6bb0cSPaul Mundt return;
1582be6bb0cSPaul Mundt }
1592be6bb0cSPaul Mundt
1602be6bb0cSPaul Mundt pirq = mapped - intc_irq_xlate;
1612be6bb0cSPaul Mundt
1622be6bb0cSPaul Mundt raw_spin_lock_irqsave(&d->lock, flags);
1632be6bb0cSPaul Mundt
1642be6bb0cSPaul Mundt for (i = 0; i < ARRAY_SIZE(subgroup->enum_ids); i++) {
1652be6bb0cSPaul Mundt struct intc_subgroup_entry *entry;
1662be6bb0cSPaul Mundt int err;
1672be6bb0cSPaul Mundt
1682be6bb0cSPaul Mundt if (!subgroup->enum_ids[i])
1692be6bb0cSPaul Mundt continue;
1702be6bb0cSPaul Mundt
1712be6bb0cSPaul Mundt entry = kmalloc(sizeof(*entry), GFP_NOWAIT);
1722be6bb0cSPaul Mundt if (!entry)
1732be6bb0cSPaul Mundt break;
1742be6bb0cSPaul Mundt
1752be6bb0cSPaul Mundt entry->pirq = pirq;
1762be6bb0cSPaul Mundt entry->enum_id = subgroup->enum_ids[i];
1772be6bb0cSPaul Mundt entry->handle = intc_subgroup_data(subgroup, d, i);
1782be6bb0cSPaul Mundt
1792be6bb0cSPaul Mundt err = radix_tree_insert(&d->tree, entry->enum_id, entry);
1802be6bb0cSPaul Mundt if (unlikely(err < 0))
1812be6bb0cSPaul Mundt break;
1822be6bb0cSPaul Mundt
1832be6bb0cSPaul Mundt radix_tree_tag_set(&d->tree, entry->enum_id,
1842be6bb0cSPaul Mundt INTC_TAG_VIRQ_NEEDS_ALLOC);
1852be6bb0cSPaul Mundt }
1862be6bb0cSPaul Mundt
1872be6bb0cSPaul Mundt raw_spin_unlock_irqrestore(&d->lock, flags);
1882be6bb0cSPaul Mundt }
1892be6bb0cSPaul Mundt
intc_subgroup_init(struct intc_desc * desc,struct intc_desc_int * d)1902be6bb0cSPaul Mundt void __init intc_subgroup_init(struct intc_desc *desc, struct intc_desc_int *d)
1912be6bb0cSPaul Mundt {
1922be6bb0cSPaul Mundt int i;
1932be6bb0cSPaul Mundt
1942be6bb0cSPaul Mundt if (!desc->hw.subgroups)
1952be6bb0cSPaul Mundt return;
1962be6bb0cSPaul Mundt
1972be6bb0cSPaul Mundt for (i = 0; i < desc->hw.nr_subgroups; i++)
1982be6bb0cSPaul Mundt intc_subgroup_init_one(desc, d, desc->hw.subgroups + i);
1992be6bb0cSPaul Mundt }
2002be6bb0cSPaul Mundt
intc_subgroup_map(struct intc_desc_int * d)2012be6bb0cSPaul Mundt static void __init intc_subgroup_map(struct intc_desc_int *d)
2022be6bb0cSPaul Mundt {
2032be6bb0cSPaul Mundt struct intc_subgroup_entry *entries[32];
2042be6bb0cSPaul Mundt unsigned long flags;
2052be6bb0cSPaul Mundt unsigned int nr_found;
2062be6bb0cSPaul Mundt int i;
2072be6bb0cSPaul Mundt
2082be6bb0cSPaul Mundt raw_spin_lock_irqsave(&d->lock, flags);
2092be6bb0cSPaul Mundt
2102be6bb0cSPaul Mundt restart:
2112be6bb0cSPaul Mundt nr_found = radix_tree_gang_lookup_tag_slot(&d->tree,
2122be6bb0cSPaul Mundt (void ***)entries, 0, ARRAY_SIZE(entries),
2132be6bb0cSPaul Mundt INTC_TAG_VIRQ_NEEDS_ALLOC);
2142be6bb0cSPaul Mundt
2152be6bb0cSPaul Mundt for (i = 0; i < nr_found; i++) {
2162be6bb0cSPaul Mundt struct intc_subgroup_entry *entry;
2172be6bb0cSPaul Mundt int irq;
2182be6bb0cSPaul Mundt
2192be6bb0cSPaul Mundt entry = radix_tree_deref_slot((void **)entries[i]);
2202be6bb0cSPaul Mundt if (unlikely(!entry))
2212be6bb0cSPaul Mundt continue;
2226318af90SPaul Mundt if (radix_tree_deref_retry(entry))
2232be6bb0cSPaul Mundt goto restart;
2242be6bb0cSPaul Mundt
225123df01eSPaul Mundt irq = irq_alloc_desc(numa_node_id());
2262be6bb0cSPaul Mundt if (unlikely(irq < 0)) {
2272be6bb0cSPaul Mundt pr_err("no more free IRQs, bailing..\n");
2282be6bb0cSPaul Mundt break;
2292be6bb0cSPaul Mundt }
2302be6bb0cSPaul Mundt
231123df01eSPaul Mundt activate_irq(irq);
232123df01eSPaul Mundt
2332be6bb0cSPaul Mundt pr_info("Setting up a chained VIRQ from %d -> %d\n",
2342be6bb0cSPaul Mundt irq, entry->pirq);
2352be6bb0cSPaul Mundt
2362be6bb0cSPaul Mundt intc_irq_xlate_set(irq, entry->enum_id, d);
2372be6bb0cSPaul Mundt
238fcb8918fSThomas Gleixner irq_set_chip_and_handler_name(irq, irq_get_chip(entry->pirq),
2392be6bb0cSPaul Mundt handle_simple_irq, "virq");
240fcb8918fSThomas Gleixner irq_set_chip_data(irq, irq_get_chip_data(entry->pirq));
2412be6bb0cSPaul Mundt
242fcb8918fSThomas Gleixner irq_set_handler_data(irq, (void *)entry->handle);
2432be6bb0cSPaul Mundt
244442f56d9SPaul Mundt /*
245442f56d9SPaul Mundt * Set the virtual IRQ as non-threadable.
246442f56d9SPaul Mundt */
247442f56d9SPaul Mundt irq_set_nothread(irq);
248442f56d9SPaul Mundt
249beab99feSThomas Gleixner /* Set handler data before installing the handler */
2502be6bb0cSPaul Mundt add_virq_to_pirq(entry->pirq, irq);
251beab99feSThomas Gleixner irq_set_chained_handler(entry->pirq, intc_virq_handler);
2522be6bb0cSPaul Mundt
2532be6bb0cSPaul Mundt radix_tree_tag_clear(&d->tree, entry->enum_id,
2542be6bb0cSPaul Mundt INTC_TAG_VIRQ_NEEDS_ALLOC);
2556d75f366SJohannes Weiner radix_tree_replace_slot(&d->tree, (void **)entries[i],
2562be6bb0cSPaul Mundt &intc_irq_xlate[irq]);
2572be6bb0cSPaul Mundt }
2582be6bb0cSPaul Mundt
2592be6bb0cSPaul Mundt raw_spin_unlock_irqrestore(&d->lock, flags);
2602be6bb0cSPaul Mundt }
2612be6bb0cSPaul Mundt
intc_finalize(void)2622be6bb0cSPaul Mundt void __init intc_finalize(void)
2632be6bb0cSPaul Mundt {
2642be6bb0cSPaul Mundt struct intc_desc_int *d;
2652be6bb0cSPaul Mundt
2662be6bb0cSPaul Mundt list_for_each_entry(d, &intc_list, list)
2672be6bb0cSPaul Mundt if (radix_tree_tagged(&d->tree, INTC_TAG_VIRQ_NEEDS_ALLOC))
2682be6bb0cSPaul Mundt intc_subgroup_map(d);
2692be6bb0cSPaul Mundt }
270