irq.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524
  1. /*
  2. * Derived from arch/i386/kernel/irq.c
  3. * Copyright (C) 1992 Linus Torvalds
  4. * Adapted from arch/i386 by Gary Thomas
  5. * Copyright (C) 1995-1996 Gary Thomas (gdt@linuxppc.org)
  6. * Updated and modified by Cort Dougan <cort@fsmlabs.com>
  7. * Copyright (C) 1996-2001 Cort Dougan
  8. * Adapted for Power Macintosh by Paul Mackerras
  9. * Copyright (C) 1996 Paul Mackerras (paulus@cs.anu.edu.au)
  10. *
  11. * This program is free software; you can redistribute it and/or
  12. * modify it under the terms of the GNU General Public License
  13. * as published by the Free Software Foundation; either version
  14. * 2 of the License, or (at your option) any later version.
  15. *
  16. * This file contains the code used to make IRQ descriptions in the
  17. * device tree to actual irq numbers on an interrupt controller
  18. * driver.
  19. */
  20. #include <linux/errno.h>
  21. #include <linux/list.h>
  22. #include <linux/module.h>
  23. #include <linux/of.h>
  24. #include <linux/of_irq.h>
  25. #include <linux/string.h>
  26. #include <linux/slab.h>
  27. /**
  28. * irq_of_parse_and_map - Parse and map an interrupt into linux virq space
  29. * @dev: Device node of the device whose interrupt is to be mapped
  30. * @index: Index of the interrupt to map
  31. *
  32. * This function is a wrapper that chains of_irq_parse_one() and
  33. * irq_create_of_mapping() to make things easier to callers
  34. */
  35. unsigned int irq_of_parse_and_map(struct device_node *dev, int index)
  36. {
  37. struct of_phandle_args oirq;
  38. if (of_irq_parse_one(dev, index, &oirq))
  39. return 0;
  40. return irq_create_of_mapping(&oirq);
  41. }
  42. EXPORT_SYMBOL_GPL(irq_of_parse_and_map);
  43. /**
  44. * of_irq_find_parent - Given a device node, find its interrupt parent node
  45. * @child: pointer to device node
  46. *
  47. * Returns a pointer to the interrupt parent node, or NULL if the interrupt
  48. * parent could not be determined.
  49. */
  50. struct device_node *of_irq_find_parent(struct device_node *child)
  51. {
  52. struct device_node *p;
  53. const __be32 *parp;
  54. if (!of_node_get(child))
  55. return NULL;
  56. do {
  57. parp = of_get_property(child, "interrupt-parent", NULL);
  58. if (parp == NULL)
  59. p = of_get_parent(child);
  60. else {
  61. if (of_irq_workarounds & OF_IMAP_NO_PHANDLE)
  62. p = of_node_get(of_irq_dflt_pic);
  63. else
  64. p = of_find_node_by_phandle(be32_to_cpup(parp));
  65. }
  66. of_node_put(child);
  67. child = p;
  68. } while (p && of_get_property(p, "#interrupt-cells", NULL) == NULL);
  69. return p;
  70. }
  71. /**
  72. * of_irq_parse_raw - Low level interrupt tree parsing
  73. * @parent: the device interrupt parent
  74. * @addr: address specifier (start of "reg" property of the device) in be32 format
  75. * @out_irq: structure of_irq updated by this function
  76. *
  77. * Returns 0 on success and a negative number on error
  78. *
  79. * This function is a low-level interrupt tree walking function. It
  80. * can be used to do a partial walk with synthetized reg and interrupts
  81. * properties, for example when resolving PCI interrupts when no device
  82. * node exist for the parent. It takes an interrupt specifier structure as
  83. * input, walks the tree looking for any interrupt-map properties, translates
  84. * the specifier for each map, and then returns the translated map.
  85. */
  86. int of_irq_parse_raw(const __be32 *addr, struct of_phandle_args *out_irq)
  87. {
  88. struct device_node *ipar, *tnode, *old = NULL, *newpar = NULL;
  89. __be32 initial_match_array[MAX_PHANDLE_ARGS];
  90. const __be32 *match_array = initial_match_array;
  91. const __be32 *tmp, *imap, *imask, dummy_imask[] = { [0 ... MAX_PHANDLE_ARGS] = ~0 };
  92. u32 intsize = 1, addrsize, newintsize = 0, newaddrsize = 0;
  93. int imaplen, match, i;
  94. #ifdef DEBUG
  95. of_print_phandle_args("of_irq_parse_raw: ", out_irq);
  96. #endif
  97. ipar = of_node_get(out_irq->np);
  98. /* First get the #interrupt-cells property of the current cursor
  99. * that tells us how to interpret the passed-in intspec. If there
  100. * is none, we are nice and just walk up the tree
  101. */
  102. do {
  103. tmp = of_get_property(ipar, "#interrupt-cells", NULL);
  104. if (tmp != NULL) {
  105. intsize = be32_to_cpu(*tmp);
  106. break;
  107. }
  108. tnode = ipar;
  109. ipar = of_irq_find_parent(ipar);
  110. of_node_put(tnode);
  111. } while (ipar);
  112. if (ipar == NULL) {
  113. pr_debug(" -> no parent found !\n");
  114. goto fail;
  115. }
  116. pr_debug("of_irq_parse_raw: ipar=%s, size=%d\n", of_node_full_name(ipar), intsize);
  117. if (out_irq->args_count != intsize)
  118. return -EINVAL;
  119. /* Look for this #address-cells. We have to implement the old linux
  120. * trick of looking for the parent here as some device-trees rely on it
  121. */
  122. old = of_node_get(ipar);
  123. do {
  124. tmp = of_get_property(old, "#address-cells", NULL);
  125. tnode = of_get_parent(old);
  126. of_node_put(old);
  127. old = tnode;
  128. } while (old && tmp == NULL);
  129. of_node_put(old);
  130. old = NULL;
  131. addrsize = (tmp == NULL) ? 2 : be32_to_cpu(*tmp);
  132. pr_debug(" -> addrsize=%d\n", addrsize);
  133. /* Range check so that the temporary buffer doesn't overflow */
  134. if (WARN_ON(addrsize + intsize > MAX_PHANDLE_ARGS))
  135. goto fail;
  136. /* Precalculate the match array - this simplifies match loop */
  137. for (i = 0; i < addrsize; i++)
  138. initial_match_array[i] = addr ? addr[i] : 0;
  139. for (i = 0; i < intsize; i++)
  140. initial_match_array[addrsize + i] = cpu_to_be32(out_irq->args[i]);
  141. /* Now start the actual "proper" walk of the interrupt tree */
  142. while (ipar != NULL) {
  143. /* Now check if cursor is an interrupt-controller and if it is
  144. * then we are done
  145. */
  146. if (of_get_property(ipar, "interrupt-controller", NULL) !=
  147. NULL) {
  148. pr_debug(" -> got it !\n");
  149. of_node_put(old);
  150. return 0;
  151. }
  152. /*
  153. * interrupt-map parsing does not work without a reg
  154. * property when #address-cells != 0
  155. */
  156. if (addrsize && !addr) {
  157. pr_debug(" -> no reg passed in when needed !\n");
  158. goto fail;
  159. }
  160. /* Now look for an interrupt-map */
  161. imap = of_get_property(ipar, "interrupt-map", &imaplen);
  162. /* No interrupt map, check for an interrupt parent */
  163. if (imap == NULL) {
  164. pr_debug(" -> no map, getting parent\n");
  165. newpar = of_irq_find_parent(ipar);
  166. goto skiplevel;
  167. }
  168. imaplen /= sizeof(u32);
  169. /* Look for a mask */
  170. imask = of_get_property(ipar, "interrupt-map-mask", NULL);
  171. if (!imask)
  172. imask = dummy_imask;
  173. /* Parse interrupt-map */
  174. match = 0;
  175. while (imaplen > (addrsize + intsize + 1) && !match) {
  176. /* Compare specifiers */
  177. match = 1;
  178. for (i = 0; i < (addrsize + intsize); i++, imaplen--)
  179. match &= !((match_array[i] ^ *imap++) & imask[i]);
  180. pr_debug(" -> match=%d (imaplen=%d)\n", match, imaplen);
  181. /* Get the interrupt parent */
  182. if (of_irq_workarounds & OF_IMAP_NO_PHANDLE)
  183. newpar = of_node_get(of_irq_dflt_pic);
  184. else
  185. newpar = of_find_node_by_phandle(be32_to_cpup(imap));
  186. imap++;
  187. --imaplen;
  188. /* Check if not found */
  189. if (newpar == NULL) {
  190. pr_debug(" -> imap parent not found !\n");
  191. goto fail;
  192. }
  193. /* Get #interrupt-cells and #address-cells of new
  194. * parent
  195. */
  196. tmp = of_get_property(newpar, "#interrupt-cells", NULL);
  197. if (tmp == NULL) {
  198. pr_debug(" -> parent lacks #interrupt-cells!\n");
  199. goto fail;
  200. }
  201. newintsize = be32_to_cpu(*tmp);
  202. tmp = of_get_property(newpar, "#address-cells", NULL);
  203. newaddrsize = (tmp == NULL) ? 0 : be32_to_cpu(*tmp);
  204. pr_debug(" -> newintsize=%d, newaddrsize=%d\n",
  205. newintsize, newaddrsize);
  206. /* Check for malformed properties */
  207. if (WARN_ON(newaddrsize + newintsize > MAX_PHANDLE_ARGS))
  208. goto fail;
  209. if (imaplen < (newaddrsize + newintsize))
  210. goto fail;
  211. imap += newaddrsize + newintsize;
  212. imaplen -= newaddrsize + newintsize;
  213. pr_debug(" -> imaplen=%d\n", imaplen);
  214. }
  215. if (!match)
  216. goto fail;
  217. /*
  218. * Successfully parsed an interrrupt-map translation; copy new
  219. * interrupt specifier into the out_irq structure
  220. */
  221. of_node_put(out_irq->np);
  222. out_irq->np = of_node_get(newpar);
  223. match_array = imap - newaddrsize - newintsize;
  224. for (i = 0; i < newintsize; i++)
  225. out_irq->args[i] = be32_to_cpup(imap - newintsize + i);
  226. out_irq->args_count = intsize = newintsize;
  227. addrsize = newaddrsize;
  228. skiplevel:
  229. /* Iterate again with new parent */
  230. pr_debug(" -> new parent: %s\n", of_node_full_name(newpar));
  231. of_node_put(ipar);
  232. ipar = newpar;
  233. newpar = NULL;
  234. }
  235. fail:
  236. of_node_put(ipar);
  237. of_node_put(out_irq->np);
  238. of_node_put(newpar);
  239. return -EINVAL;
  240. }
  241. EXPORT_SYMBOL_GPL(of_irq_parse_raw);
  242. /**
  243. * of_irq_parse_one - Resolve an interrupt for a device
  244. * @device: the device whose interrupt is to be resolved
  245. * @index: index of the interrupt to resolve
  246. * @out_irq: structure of_irq filled by this function
  247. *
  248. * This function resolves an interrupt for a node by walking the interrupt tree,
  249. * finding which interrupt controller node it is attached to, and returning the
  250. * interrupt specifier that can be used to retrieve a Linux IRQ number.
  251. */
  252. int of_irq_parse_one(struct device_node *device, int index, struct of_phandle_args *out_irq)
  253. {
  254. struct device_node *p;
  255. const __be32 *intspec, *tmp, *addr;
  256. u32 intsize, intlen;
  257. int i, res = -EINVAL;
  258. pr_debug("of_irq_parse_one: dev=%s, index=%d\n", of_node_full_name(device), index);
  259. /* OldWorld mac stuff is "special", handle out of line */
  260. if (of_irq_workarounds & OF_IMAP_OLDWORLD_MAC)
  261. return of_irq_parse_oldworld(device, index, out_irq);
  262. /* Get the reg property (if any) */
  263. addr = of_get_property(device, "reg", NULL);
  264. /* Get the interrupts property */
  265. intspec = of_get_property(device, "interrupts", &intlen);
  266. if (intspec == NULL) {
  267. /* Try the new-style interrupts-extended */
  268. res = of_parse_phandle_with_args(device, "interrupts-extended",
  269. "#interrupt-cells", index, out_irq);
  270. if (res)
  271. return -EINVAL;
  272. return of_irq_parse_raw(addr, out_irq);
  273. }
  274. intlen /= sizeof(*intspec);
  275. pr_debug(" intspec=%d intlen=%d\n", be32_to_cpup(intspec), intlen);
  276. /* Look for the interrupt parent. */
  277. p = of_irq_find_parent(device);
  278. if (p == NULL)
  279. return -EINVAL;
  280. /* Get size of interrupt specifier */
  281. tmp = of_get_property(p, "#interrupt-cells", NULL);
  282. if (tmp == NULL)
  283. goto out;
  284. intsize = be32_to_cpu(*tmp);
  285. pr_debug(" intsize=%d intlen=%d\n", intsize, intlen);
  286. /* Check index */
  287. if ((index + 1) * intsize > intlen)
  288. goto out;
  289. /* Copy intspec into irq structure */
  290. intspec += index * intsize;
  291. out_irq->np = p;
  292. out_irq->args_count = intsize;
  293. for (i = 0; i < intsize; i++)
  294. out_irq->args[i] = be32_to_cpup(intspec++);
  295. /* Check if there are any interrupt-map translations to process */
  296. res = of_irq_parse_raw(addr, out_irq);
  297. out:
  298. of_node_put(p);
  299. return res;
  300. }
  301. EXPORT_SYMBOL_GPL(of_irq_parse_one);
  302. /**
  303. * of_irq_to_resource - Decode a node's IRQ and return it as a resource
  304. * @dev: pointer to device tree node
  305. * @index: zero-based index of the irq
  306. * @r: pointer to resource structure to return result into.
  307. */
  308. int of_irq_to_resource(struct device_node *dev, int index, struct resource *r)
  309. {
  310. int irq = irq_of_parse_and_map(dev, index);
  311. /* Only dereference the resource if both the
  312. * resource and the irq are valid. */
  313. if (r && irq) {
  314. const char *name = NULL;
  315. memset(r, 0, sizeof(*r));
  316. /*
  317. * Get optional "interrupts-names" property to add a name
  318. * to the resource.
  319. */
  320. of_property_read_string_index(dev, "interrupt-names", index,
  321. &name);
  322. r->start = r->end = irq;
  323. r->flags = IORESOURCE_IRQ | irqd_get_trigger_type(irq_get_irq_data(irq));
  324. r->name = name ? name : of_node_full_name(dev);
  325. }
  326. return irq;
  327. }
  328. EXPORT_SYMBOL_GPL(of_irq_to_resource);
  329. /**
  330. * of_irq_count - Count the number of IRQs a node uses
  331. * @dev: pointer to device tree node
  332. */
  333. int of_irq_count(struct device_node *dev)
  334. {
  335. struct of_phandle_args irq;
  336. int nr = 0;
  337. while (of_irq_parse_one(dev, nr, &irq) == 0)
  338. nr++;
  339. return nr;
  340. }
  341. /**
  342. * of_irq_to_resource_table - Fill in resource table with node's IRQ info
  343. * @dev: pointer to device tree node
  344. * @res: array of resources to fill in
  345. * @nr_irqs: the number of IRQs (and upper bound for num of @res elements)
  346. *
  347. * Returns the size of the filled in table (up to @nr_irqs).
  348. */
  349. int of_irq_to_resource_table(struct device_node *dev, struct resource *res,
  350. int nr_irqs)
  351. {
  352. int i;
  353. for (i = 0; i < nr_irqs; i++, res++)
  354. if (!of_irq_to_resource(dev, i, res))
  355. break;
  356. return i;
  357. }
  358. EXPORT_SYMBOL_GPL(of_irq_to_resource_table);
  359. struct intc_desc {
  360. struct list_head list;
  361. struct device_node *dev;
  362. struct device_node *interrupt_parent;
  363. };
  364. /**
  365. * of_irq_init - Scan and init matching interrupt controllers in DT
  366. * @matches: 0 terminated array of nodes to match and init function to call
  367. *
  368. * This function scans the device tree for matching interrupt controller nodes,
  369. * and calls their initialization functions in order with parents first.
  370. */
  371. void __init of_irq_init(const struct of_device_id *matches)
  372. {
  373. struct device_node *np, *parent = NULL;
  374. struct intc_desc *desc, *temp_desc;
  375. struct list_head intc_desc_list, intc_parent_list;
  376. INIT_LIST_HEAD(&intc_desc_list);
  377. INIT_LIST_HEAD(&intc_parent_list);
  378. for_each_matching_node(np, matches) {
  379. if (!of_find_property(np, "interrupt-controller", NULL))
  380. continue;
  381. /*
  382. * Here, we allocate and populate an intc_desc with the node
  383. * pointer, interrupt-parent device_node etc.
  384. */
  385. desc = kzalloc(sizeof(*desc), GFP_KERNEL);
  386. if (WARN_ON(!desc))
  387. goto err;
  388. desc->dev = np;
  389. desc->interrupt_parent = of_irq_find_parent(np);
  390. if (desc->interrupt_parent == np)
  391. desc->interrupt_parent = NULL;
  392. list_add_tail(&desc->list, &intc_desc_list);
  393. }
  394. /*
  395. * The root irq controller is the one without an interrupt-parent.
  396. * That one goes first, followed by the controllers that reference it,
  397. * followed by the ones that reference the 2nd level controllers, etc.
  398. */
  399. while (!list_empty(&intc_desc_list)) {
  400. /*
  401. * Process all controllers with the current 'parent'.
  402. * First pass will be looking for NULL as the parent.
  403. * The assumption is that NULL parent means a root controller.
  404. */
  405. list_for_each_entry_safe(desc, temp_desc, &intc_desc_list, list) {
  406. const struct of_device_id *match;
  407. int ret;
  408. of_irq_init_cb_t irq_init_cb;
  409. if (desc->interrupt_parent != parent)
  410. continue;
  411. list_del(&desc->list);
  412. match = of_match_node(matches, desc->dev);
  413. if (WARN(!match->data,
  414. "of_irq_init: no init function for %s\n",
  415. match->compatible)) {
  416. kfree(desc);
  417. continue;
  418. }
  419. pr_debug("of_irq_init: init %s @ %p, parent %p\n",
  420. match->compatible,
  421. desc->dev, desc->interrupt_parent);
  422. irq_init_cb = (of_irq_init_cb_t)match->data;
  423. ret = irq_init_cb(desc->dev, desc->interrupt_parent);
  424. if (ret) {
  425. kfree(desc);
  426. continue;
  427. }
  428. /*
  429. * This one is now set up; add it to the parent list so
  430. * its children can get processed in a subsequent pass.
  431. */
  432. list_add_tail(&desc->list, &intc_parent_list);
  433. }
  434. /* Get the next pending parent that might have children */
  435. desc = list_first_entry_or_null(&intc_parent_list,
  436. typeof(*desc), list);
  437. if (!desc) {
  438. pr_err("of_irq_init: children remain, but no parents\n");
  439. break;
  440. }
  441. list_del(&desc->list);
  442. parent = desc->dev;
  443. kfree(desc);
  444. }
  445. list_for_each_entry_safe(desc, temp_desc, &intc_parent_list, list) {
  446. list_del(&desc->list);
  447. kfree(desc);
  448. }
  449. err:
  450. list_for_each_entry_safe(desc, temp_desc, &intc_desc_list, list) {
  451. list_del(&desc->list);
  452. kfree(desc);
  453. }
  454. }