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 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 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 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 842be6bb0cSPaul Mundt static int add_virq_to_pirq(unsigned int irq, unsigned int virq) 852be6bb0cSPaul Mundt { 862be6bb0cSPaul Mundt struct intc_virq_list **last, *entry; 8726599a94SPaul Mundt struct irq_data *data = irq_get_irq_data(irq); 882be6bb0cSPaul Mundt 892be6bb0cSPaul Mundt /* scan for duplicates */ 9026599a94SPaul Mundt last = (struct intc_virq_list **)&data->handler_data; 9126599a94SPaul Mundt for_each_virq(entry, data->handler_data) { 922be6bb0cSPaul Mundt if (entry->irq == virq) 932be6bb0cSPaul Mundt return 0; 942be6bb0cSPaul Mundt last = &entry->next; 952be6bb0cSPaul Mundt } 962be6bb0cSPaul Mundt 972be6bb0cSPaul Mundt entry = kzalloc(sizeof(struct intc_virq_list), GFP_ATOMIC); 982be6bb0cSPaul Mundt if (!entry) { 992be6bb0cSPaul Mundt pr_err("can't allocate VIRQ mapping for %d\n", virq); 1002be6bb0cSPaul Mundt return -ENOMEM; 1012be6bb0cSPaul Mundt } 1022be6bb0cSPaul Mundt 1032be6bb0cSPaul Mundt entry->irq = virq; 1042be6bb0cSPaul Mundt 1052be6bb0cSPaul Mundt *last = entry; 1062be6bb0cSPaul Mundt 1072be6bb0cSPaul Mundt return 0; 1082be6bb0cSPaul Mundt } 1092be6bb0cSPaul Mundt 1102be6bb0cSPaul Mundt static void intc_virq_handler(unsigned int irq, struct irq_desc *desc) 1112be6bb0cSPaul Mundt { 11226599a94SPaul Mundt struct irq_data *data = irq_get_irq_data(irq); 11326599a94SPaul Mundt struct irq_chip *chip = irq_data_get_irq_chip(data); 114fcb8918fSThomas Gleixner struct intc_virq_list *entry, *vlist = irq_data_get_irq_handler_data(data); 1152be6bb0cSPaul Mundt struct intc_desc_int *d = get_intc_desc(irq); 1162be6bb0cSPaul Mundt 11726599a94SPaul Mundt chip->irq_mask_ack(data); 1182be6bb0cSPaul Mundt 1192be6bb0cSPaul Mundt for_each_virq(entry, vlist) { 1202be6bb0cSPaul Mundt unsigned long addr, handle; 1212be6bb0cSPaul Mundt 122fcb8918fSThomas Gleixner handle = (unsigned long)irq_get_handler_data(entry->irq); 1232be6bb0cSPaul Mundt addr = INTC_REG(d, _INTC_ADDR_E(handle), 0); 1242be6bb0cSPaul Mundt 1252be6bb0cSPaul Mundt if (intc_reg_fns[_INTC_FN(handle)](addr, handle, 0)) 1262be6bb0cSPaul Mundt generic_handle_irq(entry->irq); 1272be6bb0cSPaul Mundt } 1282be6bb0cSPaul Mundt 12926599a94SPaul Mundt chip->irq_unmask(data); 1302be6bb0cSPaul Mundt } 1312be6bb0cSPaul Mundt 1322be6bb0cSPaul Mundt static unsigned long __init intc_subgroup_data(struct intc_subgroup *subgroup, 1332be6bb0cSPaul Mundt struct intc_desc_int *d, 1342be6bb0cSPaul Mundt unsigned int index) 1352be6bb0cSPaul Mundt { 1362be6bb0cSPaul Mundt unsigned int fn = REG_FN_TEST_BASE + (subgroup->reg_width >> 3) - 1; 1372be6bb0cSPaul Mundt 1382be6bb0cSPaul Mundt return _INTC_MK(fn, MODE_ENABLE_REG, intc_get_reg(d, subgroup->reg), 1392be6bb0cSPaul Mundt 0, 1, (subgroup->reg_width - 1) - index); 1402be6bb0cSPaul Mundt } 1412be6bb0cSPaul Mundt 1422be6bb0cSPaul Mundt static void __init intc_subgroup_init_one(struct intc_desc *desc, 1432be6bb0cSPaul Mundt struct intc_desc_int *d, 1442be6bb0cSPaul Mundt struct intc_subgroup *subgroup) 1452be6bb0cSPaul Mundt { 1462be6bb0cSPaul Mundt struct intc_map_entry *mapped; 1472be6bb0cSPaul Mundt unsigned int pirq; 1482be6bb0cSPaul Mundt unsigned long flags; 1492be6bb0cSPaul Mundt int i; 1502be6bb0cSPaul Mundt 1512be6bb0cSPaul Mundt mapped = radix_tree_lookup(&d->tree, subgroup->parent_id); 1522be6bb0cSPaul Mundt if (!mapped) { 1532be6bb0cSPaul Mundt WARN_ON(1); 1542be6bb0cSPaul Mundt return; 1552be6bb0cSPaul Mundt } 1562be6bb0cSPaul Mundt 1572be6bb0cSPaul Mundt pirq = mapped - intc_irq_xlate; 1582be6bb0cSPaul Mundt 1592be6bb0cSPaul Mundt raw_spin_lock_irqsave(&d->lock, flags); 1602be6bb0cSPaul Mundt 1612be6bb0cSPaul Mundt for (i = 0; i < ARRAY_SIZE(subgroup->enum_ids); i++) { 1622be6bb0cSPaul Mundt struct intc_subgroup_entry *entry; 1632be6bb0cSPaul Mundt int err; 1642be6bb0cSPaul Mundt 1652be6bb0cSPaul Mundt if (!subgroup->enum_ids[i]) 1662be6bb0cSPaul Mundt continue; 1672be6bb0cSPaul Mundt 1682be6bb0cSPaul Mundt entry = kmalloc(sizeof(*entry), GFP_NOWAIT); 1692be6bb0cSPaul Mundt if (!entry) 1702be6bb0cSPaul Mundt break; 1712be6bb0cSPaul Mundt 1722be6bb0cSPaul Mundt entry->pirq = pirq; 1732be6bb0cSPaul Mundt entry->enum_id = subgroup->enum_ids[i]; 1742be6bb0cSPaul Mundt entry->handle = intc_subgroup_data(subgroup, d, i); 1752be6bb0cSPaul Mundt 1762be6bb0cSPaul Mundt err = radix_tree_insert(&d->tree, entry->enum_id, entry); 1772be6bb0cSPaul Mundt if (unlikely(err < 0)) 1782be6bb0cSPaul Mundt break; 1792be6bb0cSPaul Mundt 1802be6bb0cSPaul Mundt radix_tree_tag_set(&d->tree, entry->enum_id, 1812be6bb0cSPaul Mundt INTC_TAG_VIRQ_NEEDS_ALLOC); 1822be6bb0cSPaul Mundt } 1832be6bb0cSPaul Mundt 1842be6bb0cSPaul Mundt raw_spin_unlock_irqrestore(&d->lock, flags); 1852be6bb0cSPaul Mundt } 1862be6bb0cSPaul Mundt 1872be6bb0cSPaul Mundt void __init intc_subgroup_init(struct intc_desc *desc, struct intc_desc_int *d) 1882be6bb0cSPaul Mundt { 1892be6bb0cSPaul Mundt int i; 1902be6bb0cSPaul Mundt 1912be6bb0cSPaul Mundt if (!desc->hw.subgroups) 1922be6bb0cSPaul Mundt return; 1932be6bb0cSPaul Mundt 1942be6bb0cSPaul Mundt for (i = 0; i < desc->hw.nr_subgroups; i++) 1952be6bb0cSPaul Mundt intc_subgroup_init_one(desc, d, desc->hw.subgroups + i); 1962be6bb0cSPaul Mundt } 1972be6bb0cSPaul Mundt 1982be6bb0cSPaul Mundt static void __init intc_subgroup_map(struct intc_desc_int *d) 1992be6bb0cSPaul Mundt { 2002be6bb0cSPaul Mundt struct intc_subgroup_entry *entries[32]; 2012be6bb0cSPaul Mundt unsigned long flags; 2022be6bb0cSPaul Mundt unsigned int nr_found; 2032be6bb0cSPaul Mundt int i; 2042be6bb0cSPaul Mundt 2052be6bb0cSPaul Mundt raw_spin_lock_irqsave(&d->lock, flags); 2062be6bb0cSPaul Mundt 2072be6bb0cSPaul Mundt restart: 2082be6bb0cSPaul Mundt nr_found = radix_tree_gang_lookup_tag_slot(&d->tree, 2092be6bb0cSPaul Mundt (void ***)entries, 0, ARRAY_SIZE(entries), 2102be6bb0cSPaul Mundt INTC_TAG_VIRQ_NEEDS_ALLOC); 2112be6bb0cSPaul Mundt 2122be6bb0cSPaul Mundt for (i = 0; i < nr_found; i++) { 2132be6bb0cSPaul Mundt struct intc_subgroup_entry *entry; 2142be6bb0cSPaul Mundt int irq; 2152be6bb0cSPaul Mundt 2162be6bb0cSPaul Mundt entry = radix_tree_deref_slot((void **)entries[i]); 2172be6bb0cSPaul Mundt if (unlikely(!entry)) 2182be6bb0cSPaul Mundt continue; 2196318af90SPaul Mundt if (radix_tree_deref_retry(entry)) 2202be6bb0cSPaul Mundt goto restart; 2212be6bb0cSPaul Mundt 2222be6bb0cSPaul Mundt irq = create_irq(); 2232be6bb0cSPaul Mundt if (unlikely(irq < 0)) { 2242be6bb0cSPaul Mundt pr_err("no more free IRQs, bailing..\n"); 2252be6bb0cSPaul Mundt break; 2262be6bb0cSPaul Mundt } 2272be6bb0cSPaul Mundt 2282be6bb0cSPaul Mundt pr_info("Setting up a chained VIRQ from %d -> %d\n", 2292be6bb0cSPaul Mundt irq, entry->pirq); 2302be6bb0cSPaul Mundt 2312be6bb0cSPaul Mundt intc_irq_xlate_set(irq, entry->enum_id, d); 2322be6bb0cSPaul Mundt 233fcb8918fSThomas Gleixner irq_set_chip_and_handler_name(irq, irq_get_chip(entry->pirq), 2342be6bb0cSPaul Mundt handle_simple_irq, "virq"); 235fcb8918fSThomas Gleixner irq_set_chip_data(irq, irq_get_chip_data(entry->pirq)); 2362be6bb0cSPaul Mundt 237fcb8918fSThomas Gleixner irq_set_handler_data(irq, (void *)entry->handle); 2382be6bb0cSPaul Mundt 239442f56d9SPaul Mundt /* 240442f56d9SPaul Mundt * Set the virtual IRQ as non-threadable. 241442f56d9SPaul Mundt */ 242442f56d9SPaul Mundt irq_set_nothread(irq); 243442f56d9SPaul Mundt 244fcb8918fSThomas Gleixner irq_set_chained_handler(entry->pirq, intc_virq_handler); 2452be6bb0cSPaul Mundt add_virq_to_pirq(entry->pirq, irq); 2462be6bb0cSPaul Mundt 2472be6bb0cSPaul Mundt radix_tree_tag_clear(&d->tree, entry->enum_id, 2482be6bb0cSPaul Mundt INTC_TAG_VIRQ_NEEDS_ALLOC); 2492be6bb0cSPaul Mundt radix_tree_replace_slot((void **)entries[i], 2502be6bb0cSPaul Mundt &intc_irq_xlate[irq]); 2512be6bb0cSPaul Mundt } 2522be6bb0cSPaul Mundt 2532be6bb0cSPaul Mundt raw_spin_unlock_irqrestore(&d->lock, flags); 2542be6bb0cSPaul Mundt } 2552be6bb0cSPaul Mundt 2562be6bb0cSPaul Mundt void __init intc_finalize(void) 2572be6bb0cSPaul Mundt { 2582be6bb0cSPaul Mundt struct intc_desc_int *d; 2592be6bb0cSPaul Mundt 2602be6bb0cSPaul Mundt list_for_each_entry(d, &intc_list, list) 2612be6bb0cSPaul Mundt if (radix_tree_tagged(&d->tree, INTC_TAG_VIRQ_NEEDS_ALLOC)) 2622be6bb0cSPaul Mundt intc_subgroup_map(d); 2632be6bb0cSPaul Mundt } 264