1e3873444SGrant Likely /* 2e3873444SGrant Likely * Derived from arch/i386/kernel/irq.c 3e3873444SGrant Likely * Copyright (C) 1992 Linus Torvalds 4e3873444SGrant Likely * Adapted from arch/i386 by Gary Thomas 5e3873444SGrant Likely * Copyright (C) 1995-1996 Gary Thomas (gdt@linuxppc.org) 6e3873444SGrant Likely * Updated and modified by Cort Dougan <cort@fsmlabs.com> 7e3873444SGrant Likely * Copyright (C) 1996-2001 Cort Dougan 8e3873444SGrant Likely * Adapted for Power Macintosh by Paul Mackerras 9e3873444SGrant Likely * Copyright (C) 1996 Paul Mackerras (paulus@cs.anu.edu.au) 10e3873444SGrant Likely * 11e3873444SGrant Likely * This program is free software; you can redistribute it and/or 12e3873444SGrant Likely * modify it under the terms of the GNU General Public License 13e3873444SGrant Likely * as published by the Free Software Foundation; either version 14e3873444SGrant Likely * 2 of the License, or (at your option) any later version. 15e3873444SGrant Likely * 16e3873444SGrant Likely * This file contains the code used to make IRQ descriptions in the 17e3873444SGrant Likely * device tree to actual irq numbers on an interrupt controller 18e3873444SGrant Likely * driver. 19e3873444SGrant Likely */ 20e3873444SGrant Likely 21e3873444SGrant Likely #include <linux/errno.h> 22c71a54b0SRob Herring #include <linux/list.h> 23e3873444SGrant Likely #include <linux/module.h> 24e3873444SGrant Likely #include <linux/of.h> 25e3873444SGrant Likely #include <linux/of_irq.h> 26e3873444SGrant Likely #include <linux/string.h> 27c71a54b0SRob Herring #include <linux/slab.h> 28e3873444SGrant Likely 29e3873444SGrant Likely /** 30e3873444SGrant Likely * irq_of_parse_and_map - Parse and map an interrupt into linux virq space 31d84ff46aSYijing Wang * @dev: Device node of the device whose interrupt is to be mapped 32e3873444SGrant Likely * @index: Index of the interrupt to map 33e3873444SGrant Likely * 340c02c800SGrant Likely * This function is a wrapper that chains of_irq_parse_one() and 35e3873444SGrant Likely * irq_create_of_mapping() to make things easier to callers 36e3873444SGrant Likely */ 37e3873444SGrant Likely unsigned int irq_of_parse_and_map(struct device_node *dev, int index) 38e3873444SGrant Likely { 39530210c7SGrant Likely struct of_phandle_args oirq; 40e3873444SGrant Likely 410c02c800SGrant Likely if (of_irq_parse_one(dev, index, &oirq)) 4277a7300aSAnton Vorontsov return 0; 43e3873444SGrant Likely 44*e6d30ab1SGrant Likely return irq_create_of_mapping(&oirq); 45e3873444SGrant Likely } 46e3873444SGrant Likely EXPORT_SYMBOL_GPL(irq_of_parse_and_map); 477dc2e113SGrant Likely 487dc2e113SGrant Likely /** 497dc2e113SGrant Likely * of_irq_find_parent - Given a device node, find its interrupt parent node 507dc2e113SGrant Likely * @child: pointer to device node 517dc2e113SGrant Likely * 527dc2e113SGrant Likely * Returns a pointer to the interrupt parent node, or NULL if the interrupt 537dc2e113SGrant Likely * parent could not be determined. 547dc2e113SGrant Likely */ 550b2e9a8eSMichael Ellerman struct device_node *of_irq_find_parent(struct device_node *child) 567dc2e113SGrant Likely { 57b4bbb029SLinus Torvalds struct device_node *p; 589a6b2e58SGrant Likely const __be32 *parp; 597dc2e113SGrant Likely 60b4bbb029SLinus Torvalds if (!of_node_get(child)) 617dc2e113SGrant Likely return NULL; 627dc2e113SGrant Likely 637dc2e113SGrant Likely do { 64b4bbb029SLinus Torvalds parp = of_get_property(child, "interrupt-parent", NULL); 657dc2e113SGrant Likely if (parp == NULL) 66b4bbb029SLinus Torvalds p = of_get_parent(child); 677dc2e113SGrant Likely else { 687dc2e113SGrant Likely if (of_irq_workarounds & OF_IMAP_NO_PHANDLE) 697dc2e113SGrant Likely p = of_node_get(of_irq_dflt_pic); 707dc2e113SGrant Likely else 719a6b2e58SGrant Likely p = of_find_node_by_phandle(be32_to_cpup(parp)); 727dc2e113SGrant Likely } 73b4bbb029SLinus Torvalds of_node_put(child); 74b4bbb029SLinus Torvalds child = p; 757dc2e113SGrant Likely } while (p && of_get_property(p, "#interrupt-cells", NULL) == NULL); 767dc2e113SGrant Likely 77b4bbb029SLinus Torvalds return p; 787dc2e113SGrant Likely } 797dc2e113SGrant Likely 807dc2e113SGrant Likely /** 810c02c800SGrant Likely * of_irq_parse_raw - Low level interrupt tree parsing 827dc2e113SGrant Likely * @parent: the device interrupt parent 837dc2e113SGrant Likely * @intspec: interrupt specifier ("interrupts" property of the device) 847dc2e113SGrant Likely * @ointsize: size of the passed in interrupt specifier 857dc2e113SGrant Likely * @addr: address specifier (start of "reg" property of the device) 867dc2e113SGrant Likely * @out_irq: structure of_irq filled by this function 877dc2e113SGrant Likely * 887dc2e113SGrant Likely * Returns 0 on success and a negative number on error 897dc2e113SGrant Likely * 907dc2e113SGrant Likely * This function is a low-level interrupt tree walking function. It 917dc2e113SGrant Likely * can be used to do a partial walk with synthetized reg and interrupts 927dc2e113SGrant Likely * properties, for example when resolving PCI interrupts when no device 937dc2e113SGrant Likely * node exist for the parent. 947dc2e113SGrant Likely */ 950c02c800SGrant Likely int of_irq_parse_raw(struct device_node *parent, const __be32 *intspec, 96530210c7SGrant Likely u32 ointsize, const __be32 *addr, struct of_phandle_args *out_irq) 977dc2e113SGrant Likely { 987dc2e113SGrant Likely struct device_node *ipar, *tnode, *old = NULL, *newpar = NULL; 99a7c194b0SRob Herring const __be32 *tmp, *imap, *imask; 1007dc2e113SGrant Likely u32 intsize = 1, addrsize, newintsize = 0, newaddrsize = 0; 1017dc2e113SGrant Likely int imaplen, match, i; 1027dc2e113SGrant Likely 1030c02c800SGrant Likely pr_debug("of_irq_parse_raw: par=%s,intspec=[0x%08x 0x%08x...],ointsize=%d\n", 1048804827bSGrant Likely of_node_full_name(parent), be32_to_cpup(intspec), 105d2f71839SGrant Likely be32_to_cpup(intspec + 1), ointsize); 1067dc2e113SGrant Likely 1077dc2e113SGrant Likely ipar = of_node_get(parent); 1087dc2e113SGrant Likely 1097dc2e113SGrant Likely /* First get the #interrupt-cells property of the current cursor 1107dc2e113SGrant Likely * that tells us how to interpret the passed-in intspec. If there 1117dc2e113SGrant Likely * is none, we are nice and just walk up the tree 1127dc2e113SGrant Likely */ 1137dc2e113SGrant Likely do { 1147dc2e113SGrant Likely tmp = of_get_property(ipar, "#interrupt-cells", NULL); 1157dc2e113SGrant Likely if (tmp != NULL) { 116a7c194b0SRob Herring intsize = be32_to_cpu(*tmp); 1177dc2e113SGrant Likely break; 1187dc2e113SGrant Likely } 1197dc2e113SGrant Likely tnode = ipar; 1207dc2e113SGrant Likely ipar = of_irq_find_parent(ipar); 1217dc2e113SGrant Likely of_node_put(tnode); 1227dc2e113SGrant Likely } while (ipar); 1237dc2e113SGrant Likely if (ipar == NULL) { 1247dc2e113SGrant Likely pr_debug(" -> no parent found !\n"); 1257dc2e113SGrant Likely goto fail; 1267dc2e113SGrant Likely } 1277dc2e113SGrant Likely 1280c02c800SGrant Likely pr_debug("of_irq_parse_raw: ipar=%s, size=%d\n", of_node_full_name(ipar), intsize); 1297dc2e113SGrant Likely 1307dc2e113SGrant Likely if (ointsize != intsize) 1317dc2e113SGrant Likely return -EINVAL; 1327dc2e113SGrant Likely 1337dc2e113SGrant Likely /* Look for this #address-cells. We have to implement the old linux 1347dc2e113SGrant Likely * trick of looking for the parent here as some device-trees rely on it 1357dc2e113SGrant Likely */ 1367dc2e113SGrant Likely old = of_node_get(ipar); 1377dc2e113SGrant Likely do { 1387dc2e113SGrant Likely tmp = of_get_property(old, "#address-cells", NULL); 1397dc2e113SGrant Likely tnode = of_get_parent(old); 1407dc2e113SGrant Likely of_node_put(old); 1417dc2e113SGrant Likely old = tnode; 1427dc2e113SGrant Likely } while (old && tmp == NULL); 1437dc2e113SGrant Likely of_node_put(old); 1447dc2e113SGrant Likely old = NULL; 145a7c194b0SRob Herring addrsize = (tmp == NULL) ? 2 : be32_to_cpu(*tmp); 1467dc2e113SGrant Likely 1477dc2e113SGrant Likely pr_debug(" -> addrsize=%d\n", addrsize); 1487dc2e113SGrant Likely 1497dc2e113SGrant Likely /* Now start the actual "proper" walk of the interrupt tree */ 1507dc2e113SGrant Likely while (ipar != NULL) { 1517dc2e113SGrant Likely /* Now check if cursor is an interrupt-controller and if it is 1527dc2e113SGrant Likely * then we are done 1537dc2e113SGrant Likely */ 1547dc2e113SGrant Likely if (of_get_property(ipar, "interrupt-controller", NULL) != 1557dc2e113SGrant Likely NULL) { 1567dc2e113SGrant Likely pr_debug(" -> got it !\n"); 157a7c194b0SRob Herring for (i = 0; i < intsize; i++) 158530210c7SGrant Likely out_irq->args[i] = 159a7c194b0SRob Herring of_read_number(intspec +i, 1); 160530210c7SGrant Likely out_irq->args_count = intsize; 161530210c7SGrant Likely out_irq->np = ipar; 1627dc2e113SGrant Likely of_node_put(old); 1637dc2e113SGrant Likely return 0; 1647dc2e113SGrant Likely } 1657dc2e113SGrant Likely 1667dc2e113SGrant Likely /* Now look for an interrupt-map */ 1677dc2e113SGrant Likely imap = of_get_property(ipar, "interrupt-map", &imaplen); 1687dc2e113SGrant Likely /* No interrupt map, check for an interrupt parent */ 1697dc2e113SGrant Likely if (imap == NULL) { 1707dc2e113SGrant Likely pr_debug(" -> no map, getting parent\n"); 1717dc2e113SGrant Likely newpar = of_irq_find_parent(ipar); 1727dc2e113SGrant Likely goto skiplevel; 1737dc2e113SGrant Likely } 1747dc2e113SGrant Likely imaplen /= sizeof(u32); 1757dc2e113SGrant Likely 1767dc2e113SGrant Likely /* Look for a mask */ 1777dc2e113SGrant Likely imask = of_get_property(ipar, "interrupt-map-mask", NULL); 1787dc2e113SGrant Likely 1797dc2e113SGrant Likely /* If we were passed no "reg" property and we attempt to parse 1807dc2e113SGrant Likely * an interrupt-map, then #address-cells must be 0. 1817dc2e113SGrant Likely * Fail if it's not. 1827dc2e113SGrant Likely */ 1837dc2e113SGrant Likely if (addr == NULL && addrsize != 0) { 1847dc2e113SGrant Likely pr_debug(" -> no reg passed in when needed !\n"); 1857dc2e113SGrant Likely goto fail; 1867dc2e113SGrant Likely } 1877dc2e113SGrant Likely 1887dc2e113SGrant Likely /* Parse interrupt-map */ 1897dc2e113SGrant Likely match = 0; 1907dc2e113SGrant Likely while (imaplen > (addrsize + intsize + 1) && !match) { 1917dc2e113SGrant Likely /* Compare specifiers */ 1927dc2e113SGrant Likely match = 1; 1937dc2e113SGrant Likely for (i = 0; i < addrsize && match; ++i) { 194d2e41518SKim Phillips __be32 mask = imask ? imask[i] 195d2e41518SKim Phillips : cpu_to_be32(0xffffffffu); 1967dc2e113SGrant Likely match = ((addr[i] ^ imap[i]) & mask) == 0; 1977dc2e113SGrant Likely } 1987dc2e113SGrant Likely for (; i < (addrsize + intsize) && match; ++i) { 199d2e41518SKim Phillips __be32 mask = imask ? imask[i] 200d2e41518SKim Phillips : cpu_to_be32(0xffffffffu); 2017dc2e113SGrant Likely match = 2027dc2e113SGrant Likely ((intspec[i-addrsize] ^ imap[i]) & mask) == 0; 2037dc2e113SGrant Likely } 2047dc2e113SGrant Likely imap += addrsize + intsize; 2057dc2e113SGrant Likely imaplen -= addrsize + intsize; 2067dc2e113SGrant Likely 2077dc2e113SGrant Likely pr_debug(" -> match=%d (imaplen=%d)\n", match, imaplen); 2087dc2e113SGrant Likely 2097dc2e113SGrant Likely /* Get the interrupt parent */ 2107dc2e113SGrant Likely if (of_irq_workarounds & OF_IMAP_NO_PHANDLE) 2117dc2e113SGrant Likely newpar = of_node_get(of_irq_dflt_pic); 2127dc2e113SGrant Likely else 2139a6b2e58SGrant Likely newpar = of_find_node_by_phandle(be32_to_cpup(imap)); 2147dc2e113SGrant Likely imap++; 2157dc2e113SGrant Likely --imaplen; 2167dc2e113SGrant Likely 2177dc2e113SGrant Likely /* Check if not found */ 2187dc2e113SGrant Likely if (newpar == NULL) { 2197dc2e113SGrant Likely pr_debug(" -> imap parent not found !\n"); 2207dc2e113SGrant Likely goto fail; 2217dc2e113SGrant Likely } 2227dc2e113SGrant Likely 2237dc2e113SGrant Likely /* Get #interrupt-cells and #address-cells of new 2247dc2e113SGrant Likely * parent 2257dc2e113SGrant Likely */ 2267dc2e113SGrant Likely tmp = of_get_property(newpar, "#interrupt-cells", NULL); 2277dc2e113SGrant Likely if (tmp == NULL) { 2287dc2e113SGrant Likely pr_debug(" -> parent lacks #interrupt-cells!\n"); 2297dc2e113SGrant Likely goto fail; 2307dc2e113SGrant Likely } 231a7c194b0SRob Herring newintsize = be32_to_cpu(*tmp); 2327dc2e113SGrant Likely tmp = of_get_property(newpar, "#address-cells", NULL); 233a7c194b0SRob Herring newaddrsize = (tmp == NULL) ? 0 : be32_to_cpu(*tmp); 2347dc2e113SGrant Likely 2357dc2e113SGrant Likely pr_debug(" -> newintsize=%d, newaddrsize=%d\n", 2367dc2e113SGrant Likely newintsize, newaddrsize); 2377dc2e113SGrant Likely 2387dc2e113SGrant Likely /* Check for malformed properties */ 2397dc2e113SGrant Likely if (imaplen < (newaddrsize + newintsize)) 2407dc2e113SGrant Likely goto fail; 2417dc2e113SGrant Likely 2427dc2e113SGrant Likely imap += newaddrsize + newintsize; 2437dc2e113SGrant Likely imaplen -= newaddrsize + newintsize; 2447dc2e113SGrant Likely 2457dc2e113SGrant Likely pr_debug(" -> imaplen=%d\n", imaplen); 2467dc2e113SGrant Likely } 2477dc2e113SGrant Likely if (!match) 2487dc2e113SGrant Likely goto fail; 2497dc2e113SGrant Likely 2507dc2e113SGrant Likely of_node_put(old); 2517dc2e113SGrant Likely old = of_node_get(newpar); 2527dc2e113SGrant Likely addrsize = newaddrsize; 2537dc2e113SGrant Likely intsize = newintsize; 2547dc2e113SGrant Likely intspec = imap - intsize; 2557dc2e113SGrant Likely addr = intspec - addrsize; 2567dc2e113SGrant Likely 2577dc2e113SGrant Likely skiplevel: 2587dc2e113SGrant Likely /* Iterate again with new parent */ 25974a7f084SGrant Likely pr_debug(" -> new parent: %s\n", of_node_full_name(newpar)); 2607dc2e113SGrant Likely of_node_put(ipar); 2617dc2e113SGrant Likely ipar = newpar; 2627dc2e113SGrant Likely newpar = NULL; 2637dc2e113SGrant Likely } 2647dc2e113SGrant Likely fail: 2657dc2e113SGrant Likely of_node_put(ipar); 2667dc2e113SGrant Likely of_node_put(old); 2677dc2e113SGrant Likely of_node_put(newpar); 2687dc2e113SGrant Likely 2697dc2e113SGrant Likely return -EINVAL; 2707dc2e113SGrant Likely } 2710c02c800SGrant Likely EXPORT_SYMBOL_GPL(of_irq_parse_raw); 2727dc2e113SGrant Likely 2737dc2e113SGrant Likely /** 2740c02c800SGrant Likely * of_irq_parse_one - Resolve an interrupt for a device 2757dc2e113SGrant Likely * @device: the device whose interrupt is to be resolved 2767dc2e113SGrant Likely * @index: index of the interrupt to resolve 2777dc2e113SGrant Likely * @out_irq: structure of_irq filled by this function 2787dc2e113SGrant Likely * 2797dc2e113SGrant Likely * This function resolves an interrupt, walking the tree, for a given 2800c02c800SGrant Likely * device-tree node. It's the high level pendant to of_irq_parse_raw(). 2817dc2e113SGrant Likely */ 282530210c7SGrant Likely int of_irq_parse_one(struct device_node *device, int index, struct of_phandle_args *out_irq) 2837dc2e113SGrant Likely { 2847dc2e113SGrant Likely struct device_node *p; 285d2f71839SGrant Likely const __be32 *intspec, *tmp, *addr; 2867dc2e113SGrant Likely u32 intsize, intlen; 2877dc2e113SGrant Likely int res = -EINVAL; 2887dc2e113SGrant Likely 2890c02c800SGrant Likely pr_debug("of_irq_parse_one: dev=%s, index=%d\n", of_node_full_name(device), index); 2907dc2e113SGrant Likely 2917dc2e113SGrant Likely /* OldWorld mac stuff is "special", handle out of line */ 2927dc2e113SGrant Likely if (of_irq_workarounds & OF_IMAP_OLDWORLD_MAC) 2930c02c800SGrant Likely return of_irq_parse_oldworld(device, index, out_irq); 2947dc2e113SGrant Likely 2957dc2e113SGrant Likely /* Get the interrupts property */ 2967dc2e113SGrant Likely intspec = of_get_property(device, "interrupts", &intlen); 2977dc2e113SGrant Likely if (intspec == NULL) 2987dc2e113SGrant Likely return -EINVAL; 299d2f71839SGrant Likely intlen /= sizeof(*intspec); 3007dc2e113SGrant Likely 301d2f71839SGrant Likely pr_debug(" intspec=%d intlen=%d\n", be32_to_cpup(intspec), intlen); 3027dc2e113SGrant Likely 3037dc2e113SGrant Likely /* Get the reg property (if any) */ 3047dc2e113SGrant Likely addr = of_get_property(device, "reg", NULL); 3057dc2e113SGrant Likely 3067dc2e113SGrant Likely /* Look for the interrupt parent. */ 3077dc2e113SGrant Likely p = of_irq_find_parent(device); 3087dc2e113SGrant Likely if (p == NULL) 3097dc2e113SGrant Likely return -EINVAL; 3107dc2e113SGrant Likely 3117dc2e113SGrant Likely /* Get size of interrupt specifier */ 3127dc2e113SGrant Likely tmp = of_get_property(p, "#interrupt-cells", NULL); 3137dc2e113SGrant Likely if (tmp == NULL) 3147dc2e113SGrant Likely goto out; 315a7c194b0SRob Herring intsize = be32_to_cpu(*tmp); 3167dc2e113SGrant Likely 3177dc2e113SGrant Likely pr_debug(" intsize=%d intlen=%d\n", intsize, intlen); 3187dc2e113SGrant Likely 3197dc2e113SGrant Likely /* Check index */ 3207dc2e113SGrant Likely if ((index + 1) * intsize > intlen) 3217dc2e113SGrant Likely goto out; 3227dc2e113SGrant Likely 3237dc2e113SGrant Likely /* Get new specifier and map it */ 3240c02c800SGrant Likely res = of_irq_parse_raw(p, intspec + index * intsize, intsize, 3257dc2e113SGrant Likely addr, out_irq); 3267dc2e113SGrant Likely out: 3277dc2e113SGrant Likely of_node_put(p); 3287dc2e113SGrant Likely return res; 3297dc2e113SGrant Likely } 3300c02c800SGrant Likely EXPORT_SYMBOL_GPL(of_irq_parse_one); 3317dc2e113SGrant Likely 3327dc2e113SGrant Likely /** 3337dc2e113SGrant Likely * of_irq_to_resource - Decode a node's IRQ and return it as a resource 3347dc2e113SGrant Likely * @dev: pointer to device tree node 3357dc2e113SGrant Likely * @index: zero-based index of the irq 3367dc2e113SGrant Likely * @r: pointer to resource structure to return result into. 3377dc2e113SGrant Likely */ 3387dc2e113SGrant Likely int of_irq_to_resource(struct device_node *dev, int index, struct resource *r) 3397dc2e113SGrant Likely { 3407dc2e113SGrant Likely int irq = irq_of_parse_and_map(dev, index); 3417dc2e113SGrant Likely 3427dc2e113SGrant Likely /* Only dereference the resource if both the 3437dc2e113SGrant Likely * resource and the irq are valid. */ 34477a7300aSAnton Vorontsov if (r && irq) { 345661db794SBenoit Cousson const char *name = NULL; 346661db794SBenoit Cousson 347cf9e2368SSebastian Andrzej Siewior memset(r, 0, sizeof(*r)); 348661db794SBenoit Cousson /* 349661db794SBenoit Cousson * Get optional "interrupts-names" property to add a name 350661db794SBenoit Cousson * to the resource. 351661db794SBenoit Cousson */ 352661db794SBenoit Cousson of_property_read_string_index(dev, "interrupt-names", index, 353661db794SBenoit Cousson &name); 354661db794SBenoit Cousson 3557dc2e113SGrant Likely r->start = r->end = irq; 3564a43d686STomasz Figa r->flags = IORESOURCE_IRQ | irqd_get_trigger_type(irq_get_irq_data(irq)); 3578804827bSGrant Likely r->name = name ? name : of_node_full_name(dev); 3587dc2e113SGrant Likely } 3597dc2e113SGrant Likely 3607dc2e113SGrant Likely return irq; 3617dc2e113SGrant Likely } 3627dc2e113SGrant Likely EXPORT_SYMBOL_GPL(of_irq_to_resource); 36352f6537cSAndres Salomon 36452f6537cSAndres Salomon /** 36552f6537cSAndres Salomon * of_irq_count - Count the number of IRQs a node uses 36652f6537cSAndres Salomon * @dev: pointer to device tree node 36752f6537cSAndres Salomon */ 36852f6537cSAndres Salomon int of_irq_count(struct device_node *dev) 36952f6537cSAndres Salomon { 37052f6537cSAndres Salomon int nr = 0; 37152f6537cSAndres Salomon 37277a7300aSAnton Vorontsov while (of_irq_to_resource(dev, nr, NULL)) 37352f6537cSAndres Salomon nr++; 37452f6537cSAndres Salomon 37552f6537cSAndres Salomon return nr; 37652f6537cSAndres Salomon } 37752f6537cSAndres Salomon 37852f6537cSAndres Salomon /** 37952f6537cSAndres Salomon * of_irq_to_resource_table - Fill in resource table with node's IRQ info 38052f6537cSAndres Salomon * @dev: pointer to device tree node 38152f6537cSAndres Salomon * @res: array of resources to fill in 38252f6537cSAndres Salomon * @nr_irqs: the number of IRQs (and upper bound for num of @res elements) 38352f6537cSAndres Salomon * 38452f6537cSAndres Salomon * Returns the size of the filled in table (up to @nr_irqs). 38552f6537cSAndres Salomon */ 38652f6537cSAndres Salomon int of_irq_to_resource_table(struct device_node *dev, struct resource *res, 38752f6537cSAndres Salomon int nr_irqs) 38852f6537cSAndres Salomon { 38952f6537cSAndres Salomon int i; 39052f6537cSAndres Salomon 39152f6537cSAndres Salomon for (i = 0; i < nr_irqs; i++, res++) 39277a7300aSAnton Vorontsov if (!of_irq_to_resource(dev, i, res)) 39352f6537cSAndres Salomon break; 39452f6537cSAndres Salomon 39552f6537cSAndres Salomon return i; 39652f6537cSAndres Salomon } 397a4f8bf22SJohn Crispin EXPORT_SYMBOL_GPL(of_irq_to_resource_table); 398c71a54b0SRob Herring 399c71a54b0SRob Herring struct intc_desc { 400c71a54b0SRob Herring struct list_head list; 401c71a54b0SRob Herring struct device_node *dev; 402c71a54b0SRob Herring struct device_node *interrupt_parent; 403c71a54b0SRob Herring }; 404c71a54b0SRob Herring 405c71a54b0SRob Herring /** 406c71a54b0SRob Herring * of_irq_init - Scan and init matching interrupt controllers in DT 407c71a54b0SRob Herring * @matches: 0 terminated array of nodes to match and init function to call 408c71a54b0SRob Herring * 409c71a54b0SRob Herring * This function scans the device tree for matching interrupt controller nodes, 410c71a54b0SRob Herring * and calls their initialization functions in order with parents first. 411c71a54b0SRob Herring */ 412c71a54b0SRob Herring void __init of_irq_init(const struct of_device_id *matches) 413c71a54b0SRob Herring { 414c71a54b0SRob Herring struct device_node *np, *parent = NULL; 415c71a54b0SRob Herring struct intc_desc *desc, *temp_desc; 416c71a54b0SRob Herring struct list_head intc_desc_list, intc_parent_list; 417c71a54b0SRob Herring 418c71a54b0SRob Herring INIT_LIST_HEAD(&intc_desc_list); 419c71a54b0SRob Herring INIT_LIST_HEAD(&intc_parent_list); 420c71a54b0SRob Herring 421c71a54b0SRob Herring for_each_matching_node(np, matches) { 422c71a54b0SRob Herring if (!of_find_property(np, "interrupt-controller", NULL)) 423c71a54b0SRob Herring continue; 424c71a54b0SRob Herring /* 425c71a54b0SRob Herring * Here, we allocate and populate an intc_desc with the node 426c71a54b0SRob Herring * pointer, interrupt-parent device_node etc. 427c71a54b0SRob Herring */ 428c71a54b0SRob Herring desc = kzalloc(sizeof(*desc), GFP_KERNEL); 429c71a54b0SRob Herring if (WARN_ON(!desc)) 430c71a54b0SRob Herring goto err; 431c71a54b0SRob Herring 432c71a54b0SRob Herring desc->dev = np; 433c71a54b0SRob Herring desc->interrupt_parent = of_irq_find_parent(np); 434d7fb6d0aSRob Herring if (desc->interrupt_parent == np) 435d7fb6d0aSRob Herring desc->interrupt_parent = NULL; 436c71a54b0SRob Herring list_add_tail(&desc->list, &intc_desc_list); 437c71a54b0SRob Herring } 438c71a54b0SRob Herring 439c71a54b0SRob Herring /* 440c71a54b0SRob Herring * The root irq controller is the one without an interrupt-parent. 441c71a54b0SRob Herring * That one goes first, followed by the controllers that reference it, 442c71a54b0SRob Herring * followed by the ones that reference the 2nd level controllers, etc. 443c71a54b0SRob Herring */ 444c71a54b0SRob Herring while (!list_empty(&intc_desc_list)) { 445c71a54b0SRob Herring /* 446c71a54b0SRob Herring * Process all controllers with the current 'parent'. 447c71a54b0SRob Herring * First pass will be looking for NULL as the parent. 448c71a54b0SRob Herring * The assumption is that NULL parent means a root controller. 449c71a54b0SRob Herring */ 450c71a54b0SRob Herring list_for_each_entry_safe(desc, temp_desc, &intc_desc_list, list) { 451c71a54b0SRob Herring const struct of_device_id *match; 452c71a54b0SRob Herring int ret; 453c71a54b0SRob Herring of_irq_init_cb_t irq_init_cb; 454c71a54b0SRob Herring 455c71a54b0SRob Herring if (desc->interrupt_parent != parent) 456c71a54b0SRob Herring continue; 457c71a54b0SRob Herring 458c71a54b0SRob Herring list_del(&desc->list); 459c71a54b0SRob Herring match = of_match_node(matches, desc->dev); 460c71a54b0SRob Herring if (WARN(!match->data, 461c71a54b0SRob Herring "of_irq_init: no init function for %s\n", 462c71a54b0SRob Herring match->compatible)) { 463c71a54b0SRob Herring kfree(desc); 464c71a54b0SRob Herring continue; 465c71a54b0SRob Herring } 466c71a54b0SRob Herring 467c71a54b0SRob Herring pr_debug("of_irq_init: init %s @ %p, parent %p\n", 468c71a54b0SRob Herring match->compatible, 469c71a54b0SRob Herring desc->dev, desc->interrupt_parent); 470d2e41518SKim Phillips irq_init_cb = (of_irq_init_cb_t)match->data; 471c71a54b0SRob Herring ret = irq_init_cb(desc->dev, desc->interrupt_parent); 472c71a54b0SRob Herring if (ret) { 473c71a54b0SRob Herring kfree(desc); 474c71a54b0SRob Herring continue; 475c71a54b0SRob Herring } 476c71a54b0SRob Herring 477c71a54b0SRob Herring /* 478c71a54b0SRob Herring * This one is now set up; add it to the parent list so 479c71a54b0SRob Herring * its children can get processed in a subsequent pass. 480c71a54b0SRob Herring */ 481c71a54b0SRob Herring list_add_tail(&desc->list, &intc_parent_list); 482c71a54b0SRob Herring } 483c71a54b0SRob Herring 484c71a54b0SRob Herring /* Get the next pending parent that might have children */ 485c0cdfaa0SAxel Lin desc = list_first_entry_or_null(&intc_parent_list, 486c0cdfaa0SAxel Lin typeof(*desc), list); 487c0cdfaa0SAxel Lin if (!desc) { 488c71a54b0SRob Herring pr_err("of_irq_init: children remain, but no parents\n"); 489c71a54b0SRob Herring break; 490c71a54b0SRob Herring } 491c71a54b0SRob Herring list_del(&desc->list); 492c71a54b0SRob Herring parent = desc->dev; 493c71a54b0SRob Herring kfree(desc); 494c71a54b0SRob Herring } 495c71a54b0SRob Herring 496c71a54b0SRob Herring list_for_each_entry_safe(desc, temp_desc, &intc_parent_list, list) { 497c71a54b0SRob Herring list_del(&desc->list); 498c71a54b0SRob Herring kfree(desc); 499c71a54b0SRob Herring } 500c71a54b0SRob Herring err: 501c71a54b0SRob Herring list_for_each_entry_safe(desc, temp_desc, &intc_desc_list, list) { 502c71a54b0SRob Herring list_del(&desc->list); 503c71a54b0SRob Herring kfree(desc); 504c71a54b0SRob Herring } 505c71a54b0SRob Herring } 506