]>
Commit | Line | Data |
---|---|---|
e3873444 GL |
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 | ||
21 | #include <linux/errno.h> | |
c71a54b0 | 22 | #include <linux/list.h> |
e3873444 GL |
23 | #include <linux/module.h> |
24 | #include <linux/of.h> | |
25 | #include <linux/of_irq.h> | |
26 | #include <linux/string.h> | |
c71a54b0 | 27 | #include <linux/slab.h> |
e3873444 GL |
28 | |
29 | /** | |
30 | * irq_of_parse_and_map - Parse and map an interrupt into linux virq space | |
d84ff46a | 31 | * @dev: Device node of the device whose interrupt is to be mapped |
e3873444 GL |
32 | * @index: Index of the interrupt to map |
33 | * | |
0c02c800 | 34 | * This function is a wrapper that chains of_irq_parse_one() and |
e3873444 GL |
35 | * irq_create_of_mapping() to make things easier to callers |
36 | */ | |
37 | unsigned int irq_of_parse_and_map(struct device_node *dev, int index) | |
38 | { | |
530210c7 | 39 | struct of_phandle_args oirq; |
e3873444 | 40 | |
0c02c800 | 41 | if (of_irq_parse_one(dev, index, &oirq)) |
77a7300a | 42 | return 0; |
e3873444 | 43 | |
e6d30ab1 | 44 | return irq_create_of_mapping(&oirq); |
e3873444 GL |
45 | } |
46 | EXPORT_SYMBOL_GPL(irq_of_parse_and_map); | |
7dc2e113 GL |
47 | |
48 | /** | |
49 | * of_irq_find_parent - Given a device node, find its interrupt parent node | |
50 | * @child: pointer to device node | |
51 | * | |
52 | * Returns a pointer to the interrupt parent node, or NULL if the interrupt | |
53 | * parent could not be determined. | |
54 | */ | |
0b2e9a8e | 55 | struct device_node *of_irq_find_parent(struct device_node *child) |
7dc2e113 | 56 | { |
b4bbb029 | 57 | struct device_node *p; |
9a6b2e58 | 58 | const __be32 *parp; |
7dc2e113 | 59 | |
b4bbb029 | 60 | if (!of_node_get(child)) |
7dc2e113 GL |
61 | return NULL; |
62 | ||
63 | do { | |
b4bbb029 | 64 | parp = of_get_property(child, "interrupt-parent", NULL); |
7dc2e113 | 65 | if (parp == NULL) |
b4bbb029 | 66 | p = of_get_parent(child); |
7dc2e113 GL |
67 | else { |
68 | if (of_irq_workarounds & OF_IMAP_NO_PHANDLE) | |
69 | p = of_node_get(of_irq_dflt_pic); | |
70 | else | |
9a6b2e58 | 71 | p = of_find_node_by_phandle(be32_to_cpup(parp)); |
7dc2e113 | 72 | } |
b4bbb029 LT |
73 | of_node_put(child); |
74 | child = p; | |
7dc2e113 GL |
75 | } while (p && of_get_property(p, "#interrupt-cells", NULL) == NULL); |
76 | ||
b4bbb029 | 77 | return p; |
7dc2e113 GL |
78 | } |
79 | ||
80 | /** | |
0c02c800 | 81 | * of_irq_parse_raw - Low level interrupt tree parsing |
7dc2e113 | 82 | * @parent: the device interrupt parent |
23616132 GL |
83 | * @addr: address specifier (start of "reg" property of the device) in be32 format |
84 | * @out_irq: structure of_irq updated by this function | |
7dc2e113 GL |
85 | * |
86 | * Returns 0 on success and a negative number on error | |
87 | * | |
88 | * This function is a low-level interrupt tree walking function. It | |
89 | * can be used to do a partial walk with synthetized reg and interrupts | |
90 | * properties, for example when resolving PCI interrupts when no device | |
23616132 GL |
91 | * node exist for the parent. It takes an interrupt specifier structure as |
92 | * input, walks the tree looking for any interrupt-map properties, translates | |
93 | * the specifier for each map, and then returns the translated map. | |
7dc2e113 | 94 | */ |
23616132 | 95 | int of_irq_parse_raw(const __be32 *addr, struct of_phandle_args *out_irq) |
7dc2e113 GL |
96 | { |
97 | struct device_node *ipar, *tnode, *old = NULL, *newpar = NULL; | |
355e62f5 | 98 | __be32 initial_match_array[MAX_PHANDLE_ARGS]; |
23616132 | 99 | const __be32 *match_array = initial_match_array; |
355e62f5 | 100 | const __be32 *tmp, *imap, *imask, dummy_imask[] = { [0 ... MAX_PHANDLE_ARGS] = ~0 }; |
7dc2e113 GL |
101 | u32 intsize = 1, addrsize, newintsize = 0, newaddrsize = 0; |
102 | int imaplen, match, i; | |
103 | ||
624cfca5 GL |
104 | #ifdef DEBUG |
105 | of_print_phandle_args("of_irq_parse_raw: ", out_irq); | |
106 | #endif | |
7dc2e113 | 107 | |
23616132 | 108 | ipar = of_node_get(out_irq->np); |
7dc2e113 GL |
109 | |
110 | /* First get the #interrupt-cells property of the current cursor | |
111 | * that tells us how to interpret the passed-in intspec. If there | |
112 | * is none, we are nice and just walk up the tree | |
113 | */ | |
114 | do { | |
115 | tmp = of_get_property(ipar, "#interrupt-cells", NULL); | |
116 | if (tmp != NULL) { | |
a7c194b0 | 117 | intsize = be32_to_cpu(*tmp); |
7dc2e113 GL |
118 | break; |
119 | } | |
120 | tnode = ipar; | |
121 | ipar = of_irq_find_parent(ipar); | |
122 | of_node_put(tnode); | |
123 | } while (ipar); | |
124 | if (ipar == NULL) { | |
125 | pr_debug(" -> no parent found !\n"); | |
126 | goto fail; | |
127 | } | |
128 | ||
0c02c800 | 129 | pr_debug("of_irq_parse_raw: ipar=%s, size=%d\n", of_node_full_name(ipar), intsize); |
7dc2e113 | 130 | |
23616132 | 131 | if (out_irq->args_count != intsize) |
7dc2e113 GL |
132 | return -EINVAL; |
133 | ||
134 | /* Look for this #address-cells. We have to implement the old linux | |
135 | * trick of looking for the parent here as some device-trees rely on it | |
136 | */ | |
137 | old = of_node_get(ipar); | |
138 | do { | |
139 | tmp = of_get_property(old, "#address-cells", NULL); | |
140 | tnode = of_get_parent(old); | |
141 | of_node_put(old); | |
142 | old = tnode; | |
143 | } while (old && tmp == NULL); | |
144 | of_node_put(old); | |
145 | old = NULL; | |
a7c194b0 | 146 | addrsize = (tmp == NULL) ? 2 : be32_to_cpu(*tmp); |
7dc2e113 GL |
147 | |
148 | pr_debug(" -> addrsize=%d\n", addrsize); | |
149 | ||
355e62f5 GL |
150 | /* Range check so that the temporary buffer doesn't overflow */ |
151 | if (WARN_ON(addrsize + intsize > MAX_PHANDLE_ARGS)) | |
152 | goto fail; | |
153 | ||
23616132 GL |
154 | /* Precalculate the match array - this simplifies match loop */ |
155 | for (i = 0; i < addrsize; i++) | |
78119fd1 | 156 | initial_match_array[i] = addr ? addr[i] : 0; |
23616132 GL |
157 | for (i = 0; i < intsize; i++) |
158 | initial_match_array[addrsize + i] = cpu_to_be32(out_irq->args[i]); | |
159 | ||
7dc2e113 GL |
160 | /* Now start the actual "proper" walk of the interrupt tree */ |
161 | while (ipar != NULL) { | |
162 | /* Now check if cursor is an interrupt-controller and if it is | |
163 | * then we are done | |
164 | */ | |
165 | if (of_get_property(ipar, "interrupt-controller", NULL) != | |
166 | NULL) { | |
167 | pr_debug(" -> got it !\n"); | |
7dc2e113 GL |
168 | return 0; |
169 | } | |
170 | ||
78119fd1 GL |
171 | /* |
172 | * interrupt-map parsing does not work without a reg | |
173 | * property when #address-cells != 0 | |
174 | */ | |
175 | if (addrsize && !addr) { | |
176 | pr_debug(" -> no reg passed in when needed !\n"); | |
177 | goto fail; | |
178 | } | |
179 | ||
7dc2e113 GL |
180 | /* Now look for an interrupt-map */ |
181 | imap = of_get_property(ipar, "interrupt-map", &imaplen); | |
182 | /* No interrupt map, check for an interrupt parent */ | |
183 | if (imap == NULL) { | |
184 | pr_debug(" -> no map, getting parent\n"); | |
185 | newpar = of_irq_find_parent(ipar); | |
186 | goto skiplevel; | |
187 | } | |
188 | imaplen /= sizeof(u32); | |
189 | ||
190 | /* Look for a mask */ | |
191 | imask = of_get_property(ipar, "interrupt-map-mask", NULL); | |
23616132 GL |
192 | if (!imask) |
193 | imask = dummy_imask; | |
7dc2e113 GL |
194 | |
195 | /* Parse interrupt-map */ | |
196 | match = 0; | |
197 | while (imaplen > (addrsize + intsize + 1) && !match) { | |
198 | /* Compare specifiers */ | |
199 | match = 1; | |
23616132 | 200 | for (i = 0; i < (addrsize + intsize); i++, imaplen--) |
74dac2ed | 201 | match &= !((match_array[i] ^ *imap++) & imask[i]); |
7dc2e113 GL |
202 | |
203 | pr_debug(" -> match=%d (imaplen=%d)\n", match, imaplen); | |
204 | ||
205 | /* Get the interrupt parent */ | |
206 | if (of_irq_workarounds & OF_IMAP_NO_PHANDLE) | |
207 | newpar = of_node_get(of_irq_dflt_pic); | |
208 | else | |
9a6b2e58 | 209 | newpar = of_find_node_by_phandle(be32_to_cpup(imap)); |
7dc2e113 GL |
210 | imap++; |
211 | --imaplen; | |
212 | ||
213 | /* Check if not found */ | |
214 | if (newpar == NULL) { | |
215 | pr_debug(" -> imap parent not found !\n"); | |
216 | goto fail; | |
217 | } | |
218 | ||
1ca56e7d PC |
219 | if (!of_device_is_available(newpar)) |
220 | match = 0; | |
221 | ||
7dc2e113 GL |
222 | /* Get #interrupt-cells and #address-cells of new |
223 | * parent | |
224 | */ | |
225 | tmp = of_get_property(newpar, "#interrupt-cells", NULL); | |
226 | if (tmp == NULL) { | |
227 | pr_debug(" -> parent lacks #interrupt-cells!\n"); | |
228 | goto fail; | |
229 | } | |
a7c194b0 | 230 | newintsize = be32_to_cpu(*tmp); |
7dc2e113 | 231 | tmp = of_get_property(newpar, "#address-cells", NULL); |
a7c194b0 | 232 | newaddrsize = (tmp == NULL) ? 0 : be32_to_cpu(*tmp); |
7dc2e113 GL |
233 | |
234 | pr_debug(" -> newintsize=%d, newaddrsize=%d\n", | |
235 | newintsize, newaddrsize); | |
236 | ||
237 | /* Check for malformed properties */ | |
355e62f5 GL |
238 | if (WARN_ON(newaddrsize + newintsize > MAX_PHANDLE_ARGS)) |
239 | goto fail; | |
7dc2e113 GL |
240 | if (imaplen < (newaddrsize + newintsize)) |
241 | goto fail; | |
242 | ||
243 | imap += newaddrsize + newintsize; | |
244 | imaplen -= newaddrsize + newintsize; | |
245 | ||
246 | pr_debug(" -> imaplen=%d\n", imaplen); | |
247 | } | |
248 | if (!match) | |
249 | goto fail; | |
250 | ||
23616132 GL |
251 | /* |
252 | * Successfully parsed an interrrupt-map translation; copy new | |
253 | * interrupt specifier into the out_irq structure | |
254 | */ | |
23616132 GL |
255 | match_array = imap - newaddrsize - newintsize; |
256 | for (i = 0; i < newintsize; i++) | |
257 | out_irq->args[i] = be32_to_cpup(imap - newintsize + i); | |
258 | out_irq->args_count = intsize = newintsize; | |
7dc2e113 | 259 | addrsize = newaddrsize; |
7dc2e113 GL |
260 | |
261 | skiplevel: | |
262 | /* Iterate again with new parent */ | |
d23b2516 | 263 | out_irq->np = newpar; |
74a7f084 | 264 | pr_debug(" -> new parent: %s\n", of_node_full_name(newpar)); |
7dc2e113 GL |
265 | of_node_put(ipar); |
266 | ipar = newpar; | |
267 | newpar = NULL; | |
268 | } | |
269 | fail: | |
270 | of_node_put(ipar); | |
7dc2e113 GL |
271 | of_node_put(newpar); |
272 | ||
273 | return -EINVAL; | |
274 | } | |
0c02c800 | 275 | EXPORT_SYMBOL_GPL(of_irq_parse_raw); |
7dc2e113 GL |
276 | |
277 | /** | |
0c02c800 | 278 | * of_irq_parse_one - Resolve an interrupt for a device |
7dc2e113 GL |
279 | * @device: the device whose interrupt is to be resolved |
280 | * @index: index of the interrupt to resolve | |
281 | * @out_irq: structure of_irq filled by this function | |
282 | * | |
23616132 GL |
283 | * This function resolves an interrupt for a node by walking the interrupt tree, |
284 | * finding which interrupt controller node it is attached to, and returning the | |
285 | * interrupt specifier that can be used to retrieve a Linux IRQ number. | |
7dc2e113 | 286 | */ |
530210c7 | 287 | int of_irq_parse_one(struct device_node *device, int index, struct of_phandle_args *out_irq) |
7dc2e113 GL |
288 | { |
289 | struct device_node *p; | |
d2f71839 | 290 | const __be32 *intspec, *tmp, *addr; |
7dc2e113 | 291 | u32 intsize, intlen; |
d7c14605 | 292 | int i, res; |
7dc2e113 | 293 | |
0c02c800 | 294 | pr_debug("of_irq_parse_one: dev=%s, index=%d\n", of_node_full_name(device), index); |
7dc2e113 GL |
295 | |
296 | /* OldWorld mac stuff is "special", handle out of line */ | |
297 | if (of_irq_workarounds & OF_IMAP_OLDWORLD_MAC) | |
0c02c800 | 298 | return of_irq_parse_oldworld(device, index, out_irq); |
7dc2e113 | 299 | |
79d97015 GL |
300 | /* Get the reg property (if any) */ |
301 | addr = of_get_property(device, "reg", NULL); | |
302 | ||
a9ecdc0f FF |
303 | /* Try the new-style interrupts-extended first */ |
304 | res = of_parse_phandle_with_args(device, "interrupts-extended", | |
305 | "#interrupt-cells", index, out_irq); | |
306 | if (!res) | |
307 | return of_irq_parse_raw(addr, out_irq); | |
308 | ||
7dc2e113 GL |
309 | /* Get the interrupts property */ |
310 | intspec = of_get_property(device, "interrupts", &intlen); | |
a9ecdc0f FF |
311 | if (intspec == NULL) |
312 | return -EINVAL; | |
313 | ||
d2f71839 | 314 | intlen /= sizeof(*intspec); |
7dc2e113 | 315 | |
d2f71839 | 316 | pr_debug(" intspec=%d intlen=%d\n", be32_to_cpup(intspec), intlen); |
7dc2e113 | 317 | |
7dc2e113 GL |
318 | /* Look for the interrupt parent. */ |
319 | p = of_irq_find_parent(device); | |
320 | if (p == NULL) | |
321 | return -EINVAL; | |
322 | ||
323 | /* Get size of interrupt specifier */ | |
324 | tmp = of_get_property(p, "#interrupt-cells", NULL); | |
d7c14605 LP |
325 | if (tmp == NULL) { |
326 | res = -EINVAL; | |
7dc2e113 | 327 | goto out; |
d7c14605 | 328 | } |
a7c194b0 | 329 | intsize = be32_to_cpu(*tmp); |
7dc2e113 GL |
330 | |
331 | pr_debug(" intsize=%d intlen=%d\n", intsize, intlen); | |
332 | ||
333 | /* Check index */ | |
d7c14605 LP |
334 | if ((index + 1) * intsize > intlen) { |
335 | res = -EINVAL; | |
7dc2e113 | 336 | goto out; |
d7c14605 | 337 | } |
7dc2e113 | 338 | |
23616132 GL |
339 | /* Copy intspec into irq structure */ |
340 | intspec += index * intsize; | |
341 | out_irq->np = p; | |
342 | out_irq->args_count = intsize; | |
343 | for (i = 0; i < intsize; i++) | |
344 | out_irq->args[i] = be32_to_cpup(intspec++); | |
345 | ||
346 | /* Check if there are any interrupt-map translations to process */ | |
347 | res = of_irq_parse_raw(addr, out_irq); | |
7dc2e113 GL |
348 | out: |
349 | of_node_put(p); | |
350 | return res; | |
351 | } | |
0c02c800 | 352 | EXPORT_SYMBOL_GPL(of_irq_parse_one); |
7dc2e113 GL |
353 | |
354 | /** | |
355 | * of_irq_to_resource - Decode a node's IRQ and return it as a resource | |
356 | * @dev: pointer to device tree node | |
357 | * @index: zero-based index of the irq | |
358 | * @r: pointer to resource structure to return result into. | |
359 | */ | |
360 | int of_irq_to_resource(struct device_node *dev, int index, struct resource *r) | |
361 | { | |
362 | int irq = irq_of_parse_and_map(dev, index); | |
363 | ||
364 | /* Only dereference the resource if both the | |
365 | * resource and the irq are valid. */ | |
77a7300a | 366 | if (r && irq) { |
661db794 BC |
367 | const char *name = NULL; |
368 | ||
cf9e2368 | 369 | memset(r, 0, sizeof(*r)); |
661db794 | 370 | /* |
ae107d06 | 371 | * Get optional "interrupt-names" property to add a name |
661db794 BC |
372 | * to the resource. |
373 | */ | |
374 | of_property_read_string_index(dev, "interrupt-names", index, | |
375 | &name); | |
376 | ||
7dc2e113 | 377 | r->start = r->end = irq; |
4a43d686 | 378 | r->flags = IORESOURCE_IRQ | irqd_get_trigger_type(irq_get_irq_data(irq)); |
8804827b | 379 | r->name = name ? name : of_node_full_name(dev); |
7dc2e113 GL |
380 | } |
381 | ||
382 | return irq; | |
383 | } | |
384 | EXPORT_SYMBOL_GPL(of_irq_to_resource); | |
52f6537c | 385 | |
9ec36caf RH |
386 | /** |
387 | * of_irq_get - Decode a node's IRQ and return it as a Linux irq number | |
388 | * @dev: pointer to device tree node | |
389 | * @index: zero-based index of the irq | |
390 | * | |
391 | * Returns Linux irq number on success, or -EPROBE_DEFER if the irq domain | |
392 | * is not yet created. | |
393 | * | |
394 | */ | |
395 | int of_irq_get(struct device_node *dev, int index) | |
396 | { | |
397 | int rc; | |
398 | struct of_phandle_args oirq; | |
399 | struct irq_domain *domain; | |
400 | ||
401 | rc = of_irq_parse_one(dev, index, &oirq); | |
402 | if (rc) | |
403 | return rc; | |
404 | ||
405 | domain = irq_find_host(oirq.np); | |
406 | if (!domain) | |
407 | return -EPROBE_DEFER; | |
408 | ||
409 | return irq_create_of_mapping(&oirq); | |
410 | } | |
9eb08fb3 | 411 | EXPORT_SYMBOL_GPL(of_irq_get); |
9ec36caf | 412 | |
ad69674e GS |
413 | /** |
414 | * of_irq_get_byname - Decode a node's IRQ and return it as a Linux irq number | |
415 | * @dev: pointer to device tree node | |
416 | * @name: irq name | |
417 | * | |
418 | * Returns Linux irq number on success, or -EPROBE_DEFER if the irq domain | |
419 | * is not yet created, or error code in case of any other failure. | |
420 | */ | |
421 | int of_irq_get_byname(struct device_node *dev, const char *name) | |
422 | { | |
423 | int index; | |
424 | ||
425 | if (unlikely(!name)) | |
426 | return -EINVAL; | |
427 | ||
428 | index = of_property_match_string(dev, "interrupt-names", name); | |
429 | if (index < 0) | |
430 | return index; | |
431 | ||
432 | return of_irq_get(dev, index); | |
433 | } | |
434 | ||
52f6537c AS |
435 | /** |
436 | * of_irq_count - Count the number of IRQs a node uses | |
437 | * @dev: pointer to device tree node | |
438 | */ | |
439 | int of_irq_count(struct device_node *dev) | |
440 | { | |
3da52787 | 441 | struct of_phandle_args irq; |
52f6537c AS |
442 | int nr = 0; |
443 | ||
3da52787 | 444 | while (of_irq_parse_one(dev, nr, &irq) == 0) |
52f6537c AS |
445 | nr++; |
446 | ||
447 | return nr; | |
448 | } | |
449 | ||
450 | /** | |
451 | * of_irq_to_resource_table - Fill in resource table with node's IRQ info | |
452 | * @dev: pointer to device tree node | |
453 | * @res: array of resources to fill in | |
454 | * @nr_irqs: the number of IRQs (and upper bound for num of @res elements) | |
455 | * | |
456 | * Returns the size of the filled in table (up to @nr_irqs). | |
457 | */ | |
458 | int of_irq_to_resource_table(struct device_node *dev, struct resource *res, | |
459 | int nr_irqs) | |
460 | { | |
461 | int i; | |
462 | ||
463 | for (i = 0; i < nr_irqs; i++, res++) | |
77a7300a | 464 | if (!of_irq_to_resource(dev, i, res)) |
52f6537c AS |
465 | break; |
466 | ||
467 | return i; | |
468 | } | |
a4f8bf22 | 469 | EXPORT_SYMBOL_GPL(of_irq_to_resource_table); |
c71a54b0 | 470 | |
48a9b733 | 471 | struct of_intc_desc { |
c71a54b0 RH |
472 | struct list_head list; |
473 | struct device_node *dev; | |
474 | struct device_node *interrupt_parent; | |
475 | }; | |
476 | ||
477 | /** | |
478 | * of_irq_init - Scan and init matching interrupt controllers in DT | |
479 | * @matches: 0 terminated array of nodes to match and init function to call | |
480 | * | |
481 | * This function scans the device tree for matching interrupt controller nodes, | |
482 | * and calls their initialization functions in order with parents first. | |
483 | */ | |
484 | void __init of_irq_init(const struct of_device_id *matches) | |
485 | { | |
486 | struct device_node *np, *parent = NULL; | |
48a9b733 | 487 | struct of_intc_desc *desc, *temp_desc; |
c71a54b0 RH |
488 | struct list_head intc_desc_list, intc_parent_list; |
489 | ||
490 | INIT_LIST_HEAD(&intc_desc_list); | |
491 | INIT_LIST_HEAD(&intc_parent_list); | |
492 | ||
493 | for_each_matching_node(np, matches) { | |
bf49be02 PC |
494 | if (!of_find_property(np, "interrupt-controller", NULL) || |
495 | !of_device_is_available(np)) | |
c71a54b0 RH |
496 | continue; |
497 | /* | |
48a9b733 | 498 | * Here, we allocate and populate an of_intc_desc with the node |
c71a54b0 RH |
499 | * pointer, interrupt-parent device_node etc. |
500 | */ | |
501 | desc = kzalloc(sizeof(*desc), GFP_KERNEL); | |
502 | if (WARN_ON(!desc)) | |
503 | goto err; | |
504 | ||
505 | desc->dev = np; | |
506 | desc->interrupt_parent = of_irq_find_parent(np); | |
d7fb6d0a RH |
507 | if (desc->interrupt_parent == np) |
508 | desc->interrupt_parent = NULL; | |
c71a54b0 RH |
509 | list_add_tail(&desc->list, &intc_desc_list); |
510 | } | |
511 | ||
512 | /* | |
513 | * The root irq controller is the one without an interrupt-parent. | |
514 | * That one goes first, followed by the controllers that reference it, | |
515 | * followed by the ones that reference the 2nd level controllers, etc. | |
516 | */ | |
517 | while (!list_empty(&intc_desc_list)) { | |
518 | /* | |
519 | * Process all controllers with the current 'parent'. | |
520 | * First pass will be looking for NULL as the parent. | |
521 | * The assumption is that NULL parent means a root controller. | |
522 | */ | |
523 | list_for_each_entry_safe(desc, temp_desc, &intc_desc_list, list) { | |
524 | const struct of_device_id *match; | |
525 | int ret; | |
526 | of_irq_init_cb_t irq_init_cb; | |
527 | ||
528 | if (desc->interrupt_parent != parent) | |
529 | continue; | |
530 | ||
531 | list_del(&desc->list); | |
532 | match = of_match_node(matches, desc->dev); | |
533 | if (WARN(!match->data, | |
534 | "of_irq_init: no init function for %s\n", | |
535 | match->compatible)) { | |
536 | kfree(desc); | |
537 | continue; | |
538 | } | |
539 | ||
540 | pr_debug("of_irq_init: init %s @ %p, parent %p\n", | |
541 | match->compatible, | |
542 | desc->dev, desc->interrupt_parent); | |
d2e41518 | 543 | irq_init_cb = (of_irq_init_cb_t)match->data; |
c71a54b0 RH |
544 | ret = irq_init_cb(desc->dev, desc->interrupt_parent); |
545 | if (ret) { | |
546 | kfree(desc); | |
547 | continue; | |
548 | } | |
549 | ||
550 | /* | |
551 | * This one is now set up; add it to the parent list so | |
552 | * its children can get processed in a subsequent pass. | |
553 | */ | |
554 | list_add_tail(&desc->list, &intc_parent_list); | |
555 | } | |
556 | ||
557 | /* Get the next pending parent that might have children */ | |
c0cdfaa0 AL |
558 | desc = list_first_entry_or_null(&intc_parent_list, |
559 | typeof(*desc), list); | |
560 | if (!desc) { | |
c71a54b0 RH |
561 | pr_err("of_irq_init: children remain, but no parents\n"); |
562 | break; | |
563 | } | |
564 | list_del(&desc->list); | |
565 | parent = desc->dev; | |
566 | kfree(desc); | |
567 | } | |
568 | ||
569 | list_for_each_entry_safe(desc, temp_desc, &intc_parent_list, list) { | |
570 | list_del(&desc->list); | |
571 | kfree(desc); | |
572 | } | |
573 | err: | |
574 | list_for_each_entry_safe(desc, temp_desc, &intc_desc_list, list) { | |
575 | list_del(&desc->list); | |
576 | kfree(desc); | |
577 | } | |
578 | } |