irqdesc.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596
  1. /*
  2. * Copyright (C) 1992, 1998-2006 Linus Torvalds, Ingo Molnar
  3. * Copyright (C) 2005-2006, Thomas Gleixner, Russell King
  4. *
  5. * This file contains the interrupt descriptor management code
  6. *
  7. * Detailed information is available in Documentation/DocBook/genericirq
  8. *
  9. */
  10. #include <linux/irq.h>
  11. #include <linux/slab.h>
  12. #include <linux/export.h>
  13. #include <linux/interrupt.h>
  14. #include <linux/kernel_stat.h>
  15. #include <linux/radix-tree.h>
  16. #include <linux/bitmap.h>
  17. #include <linux/irqdomain.h>
  18. #include "internals.h"
  19. /*
  20. * lockdep: we want to handle all irq_desc locks as a single lock-class:
  21. */
  22. static struct lock_class_key irq_desc_lock_class;
  23. #if defined(CONFIG_SMP)
  24. static void __init init_irq_default_affinity(void)
  25. {
  26. alloc_cpumask_var(&irq_default_affinity, GFP_NOWAIT);
  27. cpumask_setall(irq_default_affinity);
  28. }
  29. #else
  30. static void __init init_irq_default_affinity(void)
  31. {
  32. }
  33. #endif
  34. #ifdef CONFIG_SMP
  35. static int alloc_masks(struct irq_desc *desc, gfp_t gfp, int node)
  36. {
  37. if (!zalloc_cpumask_var_node(&desc->irq_data.affinity, gfp, node))
  38. return -ENOMEM;
  39. #ifdef CONFIG_GENERIC_PENDING_IRQ
  40. if (!zalloc_cpumask_var_node(&desc->pending_mask, gfp, node)) {
  41. free_cpumask_var(desc->irq_data.affinity);
  42. return -ENOMEM;
  43. }
  44. #endif
  45. return 0;
  46. }
  47. static void desc_smp_init(struct irq_desc *desc, int node)
  48. {
  49. desc->irq_data.node = node;
  50. cpumask_copy(desc->irq_data.affinity, irq_default_affinity);
  51. #ifdef CONFIG_GENERIC_PENDING_IRQ
  52. cpumask_clear(desc->pending_mask);
  53. #endif
  54. }
  55. static inline int desc_node(struct irq_desc *desc)
  56. {
  57. return desc->irq_data.node;
  58. }
  59. #else
  60. static inline int
  61. alloc_masks(struct irq_desc *desc, gfp_t gfp, int node) { return 0; }
  62. static inline void desc_smp_init(struct irq_desc *desc, int node) { }
  63. static inline int desc_node(struct irq_desc *desc) { return 0; }
  64. #endif
  65. static void desc_set_defaults(unsigned int irq, struct irq_desc *desc, int node,
  66. struct module *owner)
  67. {
  68. int cpu;
  69. desc->irq_data.irq = irq;
  70. desc->irq_data.chip = &no_irq_chip;
  71. desc->irq_data.chip_data = NULL;
  72. desc->irq_data.handler_data = NULL;
  73. desc->irq_data.msi_desc = NULL;
  74. irq_settings_clr_and_set(desc, ~0, _IRQ_DEFAULT_INIT_FLAGS);
  75. irqd_set(&desc->irq_data, IRQD_IRQ_DISABLED);
  76. desc->handle_irq = handle_bad_irq;
  77. desc->depth = 1;
  78. desc->irq_count = 0;
  79. desc->irqs_unhandled = 0;
  80. desc->name = NULL;
  81. desc->owner = owner;
  82. for_each_possible_cpu(cpu)
  83. *per_cpu_ptr(desc->kstat_irqs, cpu) = 0;
  84. desc_smp_init(desc, node);
  85. }
  86. int nr_irqs = NR_IRQS;
  87. EXPORT_SYMBOL_GPL(nr_irqs);
  88. static DEFINE_MUTEX(sparse_irq_lock);
  89. static DECLARE_BITMAP(allocated_irqs, IRQ_BITMAP_BITS);
  90. #ifdef CONFIG_SPARSE_IRQ
  91. static RADIX_TREE(irq_desc_tree, GFP_KERNEL);
  92. static void irq_insert_desc(unsigned int irq, struct irq_desc *desc)
  93. {
  94. radix_tree_insert(&irq_desc_tree, irq, desc);
  95. }
  96. struct irq_desc *irq_to_desc(unsigned int irq)
  97. {
  98. return radix_tree_lookup(&irq_desc_tree, irq);
  99. }
  100. EXPORT_SYMBOL(irq_to_desc);
  101. static void delete_irq_desc(unsigned int irq)
  102. {
  103. radix_tree_delete(&irq_desc_tree, irq);
  104. }
  105. #ifdef CONFIG_SMP
  106. static void free_masks(struct irq_desc *desc)
  107. {
  108. #ifdef CONFIG_GENERIC_PENDING_IRQ
  109. free_cpumask_var(desc->pending_mask);
  110. #endif
  111. free_cpumask_var(desc->irq_data.affinity);
  112. }
  113. #else
  114. static inline void free_masks(struct irq_desc *desc) { }
  115. #endif
  116. static struct irq_desc *alloc_desc(int irq, int node, struct module *owner)
  117. {
  118. struct irq_desc *desc;
  119. gfp_t gfp = GFP_KERNEL;
  120. desc = kzalloc_node(sizeof(*desc), gfp, node);
  121. if (!desc)
  122. return NULL;
  123. /* allocate based on nr_cpu_ids */
  124. desc->kstat_irqs = alloc_percpu(unsigned int);
  125. if (!desc->kstat_irqs)
  126. goto err_desc;
  127. if (alloc_masks(desc, gfp, node))
  128. goto err_kstat;
  129. raw_spin_lock_init(&desc->lock);
  130. lockdep_set_class(&desc->lock, &irq_desc_lock_class);
  131. desc_set_defaults(irq, desc, node, owner);
  132. return desc;
  133. err_kstat:
  134. free_percpu(desc->kstat_irqs);
  135. err_desc:
  136. kfree(desc);
  137. return NULL;
  138. }
  139. static void free_desc(unsigned int irq)
  140. {
  141. struct irq_desc *desc = irq_to_desc(irq);
  142. unregister_irq_proc(irq, desc);
  143. mutex_lock(&sparse_irq_lock);
  144. delete_irq_desc(irq);
  145. mutex_unlock(&sparse_irq_lock);
  146. free_masks(desc);
  147. free_percpu(desc->kstat_irqs);
  148. kfree(desc);
  149. }
  150. static int alloc_descs(unsigned int start, unsigned int cnt, int node,
  151. struct module *owner)
  152. {
  153. struct irq_desc *desc;
  154. int i;
  155. for (i = 0; i < cnt; i++) {
  156. desc = alloc_desc(start + i, node, owner);
  157. if (!desc)
  158. goto err;
  159. mutex_lock(&sparse_irq_lock);
  160. irq_insert_desc(start + i, desc);
  161. mutex_unlock(&sparse_irq_lock);
  162. }
  163. return start;
  164. err:
  165. for (i--; i >= 0; i--)
  166. free_desc(start + i);
  167. mutex_lock(&sparse_irq_lock);
  168. bitmap_clear(allocated_irqs, start, cnt);
  169. mutex_unlock(&sparse_irq_lock);
  170. return -ENOMEM;
  171. }
  172. static int irq_expand_nr_irqs(unsigned int nr)
  173. {
  174. if (nr > IRQ_BITMAP_BITS)
  175. return -ENOMEM;
  176. nr_irqs = nr;
  177. return 0;
  178. }
  179. int __init early_irq_init(void)
  180. {
  181. int i, initcnt, node = first_online_node;
  182. struct irq_desc *desc;
  183. init_irq_default_affinity();
  184. /* Let arch update nr_irqs and return the nr of preallocated irqs */
  185. initcnt = arch_probe_nr_irqs();
  186. printk(KERN_INFO "NR_IRQS:%d nr_irqs:%d %d\n", NR_IRQS, nr_irqs, initcnt);
  187. if (WARN_ON(nr_irqs > IRQ_BITMAP_BITS))
  188. nr_irqs = IRQ_BITMAP_BITS;
  189. if (WARN_ON(initcnt > IRQ_BITMAP_BITS))
  190. initcnt = IRQ_BITMAP_BITS;
  191. if (initcnt > nr_irqs)
  192. nr_irqs = initcnt;
  193. for (i = 0; i < initcnt; i++) {
  194. desc = alloc_desc(i, node, NULL);
  195. set_bit(i, allocated_irqs);
  196. irq_insert_desc(i, desc);
  197. }
  198. return arch_early_irq_init();
  199. }
  200. #else /* !CONFIG_SPARSE_IRQ */
  201. struct irq_desc irq_desc[NR_IRQS] __cacheline_aligned_in_smp = {
  202. [0 ... NR_IRQS-1] = {
  203. .handle_irq = handle_bad_irq,
  204. .depth = 1,
  205. .lock = __RAW_SPIN_LOCK_UNLOCKED(irq_desc->lock),
  206. }
  207. };
  208. int __init early_irq_init(void)
  209. {
  210. int count, i, node = first_online_node;
  211. struct irq_desc *desc;
  212. init_irq_default_affinity();
  213. printk(KERN_INFO "NR_IRQS:%d\n", NR_IRQS);
  214. desc = irq_desc;
  215. count = ARRAY_SIZE(irq_desc);
  216. for (i = 0; i < count; i++) {
  217. desc[i].kstat_irqs = alloc_percpu(unsigned int);
  218. alloc_masks(&desc[i], GFP_KERNEL, node);
  219. raw_spin_lock_init(&desc[i].lock);
  220. lockdep_set_class(&desc[i].lock, &irq_desc_lock_class);
  221. desc_set_defaults(i, &desc[i], node, NULL);
  222. }
  223. return arch_early_irq_init();
  224. }
  225. struct irq_desc *irq_to_desc(unsigned int irq)
  226. {
  227. return (irq < NR_IRQS) ? irq_desc + irq : NULL;
  228. }
  229. EXPORT_SYMBOL(irq_to_desc);
  230. static void free_desc(unsigned int irq)
  231. {
  232. struct irq_desc *desc = irq_to_desc(irq);
  233. unsigned long flags;
  234. raw_spin_lock_irqsave(&desc->lock, flags);
  235. desc_set_defaults(irq, desc, desc_node(desc), NULL);
  236. raw_spin_unlock_irqrestore(&desc->lock, flags);
  237. }
  238. static inline int alloc_descs(unsigned int start, unsigned int cnt, int node,
  239. struct module *owner)
  240. {
  241. u32 i;
  242. for (i = 0; i < cnt; i++) {
  243. struct irq_desc *desc = irq_to_desc(start + i);
  244. desc->owner = owner;
  245. }
  246. return start;
  247. }
  248. static int irq_expand_nr_irqs(unsigned int nr)
  249. {
  250. return -ENOMEM;
  251. }
  252. void irq_mark_irq(unsigned int irq)
  253. {
  254. mutex_lock(&sparse_irq_lock);
  255. bitmap_set(allocated_irqs, irq, 1);
  256. mutex_unlock(&sparse_irq_lock);
  257. }
  258. #ifdef CONFIG_GENERIC_IRQ_LEGACY
  259. void irq_init_desc(unsigned int irq)
  260. {
  261. free_desc(irq);
  262. }
  263. #endif
  264. #endif /* !CONFIG_SPARSE_IRQ */
  265. /**
  266. * generic_handle_irq - Invoke the handler for a particular irq
  267. * @irq: The irq number to handle
  268. *
  269. */
  270. int generic_handle_irq(unsigned int irq)
  271. {
  272. struct irq_desc *desc = irq_to_desc(irq);
  273. if (!desc)
  274. return -EINVAL;
  275. generic_handle_irq_desc(irq, desc);
  276. return 0;
  277. }
  278. EXPORT_SYMBOL_GPL(generic_handle_irq);
  279. #ifdef CONFIG_HANDLE_DOMAIN_IRQ
  280. /**
  281. * __handle_domain_irq - Invoke the handler for a HW irq belonging to a domain
  282. * @domain: The domain where to perform the lookup
  283. * @hwirq: The HW irq number to convert to a logical one
  284. * @lookup: Whether to perform the domain lookup or not
  285. * @regs: Register file coming from the low-level handling code
  286. *
  287. * Returns: 0 on success, or -EINVAL if conversion has failed
  288. */
  289. int __handle_domain_irq(struct irq_domain *domain, unsigned int hwirq,
  290. bool lookup, struct pt_regs *regs)
  291. {
  292. struct pt_regs *old_regs = set_irq_regs(regs);
  293. unsigned int irq = hwirq;
  294. int ret = 0;
  295. irq_enter();
  296. #ifdef CONFIG_IRQ_DOMAIN
  297. if (lookup)
  298. irq = irq_find_mapping(domain, hwirq);
  299. #endif
  300. /*
  301. * Some hardware gives randomly wrong interrupts. Rather
  302. * than crashing, do something sensible.
  303. */
  304. if (unlikely(!irq || irq >= nr_irqs)) {
  305. ack_bad_irq(irq);
  306. ret = -EINVAL;
  307. } else {
  308. generic_handle_irq(irq);
  309. }
  310. irq_exit();
  311. set_irq_regs(old_regs);
  312. return ret;
  313. }
  314. #endif
  315. /* Dynamic interrupt handling */
  316. /**
  317. * irq_free_descs - free irq descriptors
  318. * @from: Start of descriptor range
  319. * @cnt: Number of consecutive irqs to free
  320. */
  321. void irq_free_descs(unsigned int from, unsigned int cnt)
  322. {
  323. int i;
  324. if (from >= nr_irqs || (from + cnt) > nr_irqs)
  325. return;
  326. for (i = 0; i < cnt; i++)
  327. free_desc(from + i);
  328. mutex_lock(&sparse_irq_lock);
  329. bitmap_clear(allocated_irqs, from, cnt);
  330. mutex_unlock(&sparse_irq_lock);
  331. }
  332. EXPORT_SYMBOL_GPL(irq_free_descs);
  333. /**
  334. * irq_alloc_descs - allocate and initialize a range of irq descriptors
  335. * @irq: Allocate for specific irq number if irq >= 0
  336. * @from: Start the search from this irq number
  337. * @cnt: Number of consecutive irqs to allocate.
  338. * @node: Preferred node on which the irq descriptor should be allocated
  339. * @owner: Owning module (can be NULL)
  340. *
  341. * Returns the first irq number or error code
  342. */
  343. int __ref
  344. __irq_alloc_descs(int irq, unsigned int from, unsigned int cnt, int node,
  345. struct module *owner)
  346. {
  347. int start, ret;
  348. if (!cnt)
  349. return -EINVAL;
  350. if (irq >= 0) {
  351. if (from > irq)
  352. return -EINVAL;
  353. from = irq;
  354. } else {
  355. /*
  356. * For interrupts which are freely allocated the
  357. * architecture can force a lower bound to the @from
  358. * argument. x86 uses this to exclude the GSI space.
  359. */
  360. from = arch_dynirq_lower_bound(from);
  361. }
  362. mutex_lock(&sparse_irq_lock);
  363. start = bitmap_find_next_zero_area(allocated_irqs, IRQ_BITMAP_BITS,
  364. from, cnt, 0);
  365. ret = -EEXIST;
  366. if (irq >=0 && start != irq)
  367. goto err;
  368. if (start + cnt > nr_irqs) {
  369. ret = irq_expand_nr_irqs(start + cnt);
  370. if (ret)
  371. goto err;
  372. }
  373. bitmap_set(allocated_irqs, start, cnt);
  374. mutex_unlock(&sparse_irq_lock);
  375. return alloc_descs(start, cnt, node, owner);
  376. err:
  377. mutex_unlock(&sparse_irq_lock);
  378. return ret;
  379. }
  380. EXPORT_SYMBOL_GPL(__irq_alloc_descs);
  381. #ifdef CONFIG_GENERIC_IRQ_LEGACY_ALLOC_HWIRQ
  382. /**
  383. * irq_alloc_hwirqs - Allocate an irq descriptor and initialize the hardware
  384. * @cnt: number of interrupts to allocate
  385. * @node: node on which to allocate
  386. *
  387. * Returns an interrupt number > 0 or 0, if the allocation fails.
  388. */
  389. unsigned int irq_alloc_hwirqs(int cnt, int node)
  390. {
  391. int i, irq = __irq_alloc_descs(-1, 0, cnt, node, NULL);
  392. if (irq < 0)
  393. return 0;
  394. for (i = irq; cnt > 0; i++, cnt--) {
  395. if (arch_setup_hwirq(i, node))
  396. goto err;
  397. irq_clear_status_flags(i, _IRQ_NOREQUEST);
  398. }
  399. return irq;
  400. err:
  401. for (i--; i >= irq; i--) {
  402. irq_set_status_flags(i, _IRQ_NOREQUEST | _IRQ_NOPROBE);
  403. arch_teardown_hwirq(i);
  404. }
  405. irq_free_descs(irq, cnt);
  406. return 0;
  407. }
  408. EXPORT_SYMBOL_GPL(irq_alloc_hwirqs);
  409. /**
  410. * irq_free_hwirqs - Free irq descriptor and cleanup the hardware
  411. * @from: Free from irq number
  412. * @cnt: number of interrupts to free
  413. *
  414. */
  415. void irq_free_hwirqs(unsigned int from, int cnt)
  416. {
  417. int i, j;
  418. for (i = from, j = cnt; j > 0; i++, j--) {
  419. irq_set_status_flags(i, _IRQ_NOREQUEST | _IRQ_NOPROBE);
  420. arch_teardown_hwirq(i);
  421. }
  422. irq_free_descs(from, cnt);
  423. }
  424. EXPORT_SYMBOL_GPL(irq_free_hwirqs);
  425. #endif
  426. /**
  427. * irq_get_next_irq - get next allocated irq number
  428. * @offset: where to start the search
  429. *
  430. * Returns next irq number after offset or nr_irqs if none is found.
  431. */
  432. unsigned int irq_get_next_irq(unsigned int offset)
  433. {
  434. return find_next_bit(allocated_irqs, nr_irqs, offset);
  435. }
  436. struct irq_desc *
  437. __irq_get_desc_lock(unsigned int irq, unsigned long *flags, bool bus,
  438. unsigned int check)
  439. {
  440. struct irq_desc *desc = irq_to_desc(irq);
  441. if (desc) {
  442. if (check & _IRQ_DESC_CHECK) {
  443. if ((check & _IRQ_DESC_PERCPU) &&
  444. !irq_settings_is_per_cpu_devid(desc))
  445. return NULL;
  446. if (!(check & _IRQ_DESC_PERCPU) &&
  447. irq_settings_is_per_cpu_devid(desc))
  448. return NULL;
  449. }
  450. if (bus)
  451. chip_bus_lock(desc);
  452. raw_spin_lock_irqsave(&desc->lock, *flags);
  453. }
  454. return desc;
  455. }
  456. void __irq_put_desc_unlock(struct irq_desc *desc, unsigned long flags, bool bus)
  457. {
  458. raw_spin_unlock_irqrestore(&desc->lock, flags);
  459. if (bus)
  460. chip_bus_sync_unlock(desc);
  461. }
  462. int irq_set_percpu_devid(unsigned int irq)
  463. {
  464. struct irq_desc *desc = irq_to_desc(irq);
  465. if (!desc)
  466. return -EINVAL;
  467. if (desc->percpu_enabled)
  468. return -EINVAL;
  469. desc->percpu_enabled = kzalloc(sizeof(*desc->percpu_enabled), GFP_KERNEL);
  470. if (!desc->percpu_enabled)
  471. return -ENOMEM;
  472. irq_set_percpu_devid_flags(irq);
  473. return 0;
  474. }
  475. void kstat_incr_irq_this_cpu(unsigned int irq)
  476. {
  477. kstat_incr_irqs_this_cpu(irq, irq_to_desc(irq));
  478. }
  479. unsigned int kstat_irqs_cpu(unsigned int irq, int cpu)
  480. {
  481. struct irq_desc *desc = irq_to_desc(irq);
  482. return desc && desc->kstat_irqs ?
  483. *per_cpu_ptr(desc->kstat_irqs, cpu) : 0;
  484. }
  485. unsigned int kstat_irqs(unsigned int irq)
  486. {
  487. struct irq_desc *desc = irq_to_desc(irq);
  488. int cpu;
  489. int sum = 0;
  490. if (!desc || !desc->kstat_irqs)
  491. return 0;
  492. for_each_possible_cpu(cpu)
  493. sum += *per_cpu_ptr(desc->kstat_irqs, cpu);
  494. return sum;
  495. }