irqdesc.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643
  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. #else
  56. static inline int
  57. alloc_masks(struct irq_desc *desc, gfp_t gfp, int node) { return 0; }
  58. static inline void desc_smp_init(struct irq_desc *desc, int node) { }
  59. #endif
  60. static void desc_set_defaults(unsigned int irq, struct irq_desc *desc, int node,
  61. struct module *owner)
  62. {
  63. int cpu;
  64. desc->irq_data.common = &desc->irq_common_data;
  65. desc->irq_data.irq = irq;
  66. desc->irq_data.chip = &no_irq_chip;
  67. desc->irq_data.chip_data = NULL;
  68. desc->irq_data.handler_data = NULL;
  69. desc->irq_data.msi_desc = NULL;
  70. irq_settings_clr_and_set(desc, ~0, _IRQ_DEFAULT_INIT_FLAGS);
  71. irqd_set(&desc->irq_data, IRQD_IRQ_DISABLED);
  72. desc->handle_irq = handle_bad_irq;
  73. desc->depth = 1;
  74. desc->irq_count = 0;
  75. desc->irqs_unhandled = 0;
  76. desc->name = NULL;
  77. desc->owner = owner;
  78. for_each_possible_cpu(cpu)
  79. *per_cpu_ptr(desc->kstat_irqs, cpu) = 0;
  80. desc_smp_init(desc, node);
  81. }
  82. int nr_irqs = NR_IRQS;
  83. EXPORT_SYMBOL_GPL(nr_irqs);
  84. static DEFINE_MUTEX(sparse_irq_lock);
  85. static DECLARE_BITMAP(allocated_irqs, IRQ_BITMAP_BITS);
  86. #ifdef CONFIG_SPARSE_IRQ
  87. static RADIX_TREE(irq_desc_tree, GFP_KERNEL);
  88. static void irq_insert_desc(unsigned int irq, struct irq_desc *desc)
  89. {
  90. radix_tree_insert(&irq_desc_tree, irq, desc);
  91. }
  92. struct irq_desc *irq_to_desc(unsigned int irq)
  93. {
  94. return radix_tree_lookup(&irq_desc_tree, irq);
  95. }
  96. EXPORT_SYMBOL(irq_to_desc);
  97. static void delete_irq_desc(unsigned int irq)
  98. {
  99. radix_tree_delete(&irq_desc_tree, irq);
  100. }
  101. #ifdef CONFIG_SMP
  102. static void free_masks(struct irq_desc *desc)
  103. {
  104. #ifdef CONFIG_GENERIC_PENDING_IRQ
  105. free_cpumask_var(desc->pending_mask);
  106. #endif
  107. free_cpumask_var(desc->irq_data.affinity);
  108. }
  109. #else
  110. static inline void free_masks(struct irq_desc *desc) { }
  111. #endif
  112. void irq_lock_sparse(void)
  113. {
  114. mutex_lock(&sparse_irq_lock);
  115. }
  116. void irq_unlock_sparse(void)
  117. {
  118. mutex_unlock(&sparse_irq_lock);
  119. }
  120. static struct irq_desc *alloc_desc(int irq, int node, struct module *owner)
  121. {
  122. struct irq_desc *desc;
  123. gfp_t gfp = GFP_KERNEL;
  124. desc = kzalloc_node(sizeof(*desc), gfp, node);
  125. if (!desc)
  126. return NULL;
  127. /* allocate based on nr_cpu_ids */
  128. desc->kstat_irqs = alloc_percpu(unsigned int);
  129. if (!desc->kstat_irqs)
  130. goto err_desc;
  131. if (alloc_masks(desc, gfp, node))
  132. goto err_kstat;
  133. raw_spin_lock_init(&desc->lock);
  134. lockdep_set_class(&desc->lock, &irq_desc_lock_class);
  135. desc_set_defaults(irq, desc, node, owner);
  136. return desc;
  137. err_kstat:
  138. free_percpu(desc->kstat_irqs);
  139. err_desc:
  140. kfree(desc);
  141. return NULL;
  142. }
  143. static void free_desc(unsigned int irq)
  144. {
  145. struct irq_desc *desc = irq_to_desc(irq);
  146. unregister_irq_proc(irq, desc);
  147. /*
  148. * sparse_irq_lock protects also show_interrupts() and
  149. * kstat_irq_usr(). Once we deleted the descriptor from the
  150. * sparse tree we can free it. Access in proc will fail to
  151. * lookup the descriptor.
  152. */
  153. mutex_lock(&sparse_irq_lock);
  154. delete_irq_desc(irq);
  155. mutex_unlock(&sparse_irq_lock);
  156. free_masks(desc);
  157. free_percpu(desc->kstat_irqs);
  158. kfree(desc);
  159. }
  160. static int alloc_descs(unsigned int start, unsigned int cnt, int node,
  161. struct module *owner)
  162. {
  163. struct irq_desc *desc;
  164. int i;
  165. for (i = 0; i < cnt; i++) {
  166. desc = alloc_desc(start + i, node, owner);
  167. if (!desc)
  168. goto err;
  169. mutex_lock(&sparse_irq_lock);
  170. irq_insert_desc(start + i, desc);
  171. mutex_unlock(&sparse_irq_lock);
  172. }
  173. return start;
  174. err:
  175. for (i--; i >= 0; i--)
  176. free_desc(start + i);
  177. mutex_lock(&sparse_irq_lock);
  178. bitmap_clear(allocated_irqs, start, cnt);
  179. mutex_unlock(&sparse_irq_lock);
  180. return -ENOMEM;
  181. }
  182. static int irq_expand_nr_irqs(unsigned int nr)
  183. {
  184. if (nr > IRQ_BITMAP_BITS)
  185. return -ENOMEM;
  186. nr_irqs = nr;
  187. return 0;
  188. }
  189. int __init early_irq_init(void)
  190. {
  191. int i, initcnt, node = first_online_node;
  192. struct irq_desc *desc;
  193. init_irq_default_affinity();
  194. /* Let arch update nr_irqs and return the nr of preallocated irqs */
  195. initcnt = arch_probe_nr_irqs();
  196. printk(KERN_INFO "NR_IRQS:%d nr_irqs:%d %d\n", NR_IRQS, nr_irqs, initcnt);
  197. if (WARN_ON(nr_irqs > IRQ_BITMAP_BITS))
  198. nr_irqs = IRQ_BITMAP_BITS;
  199. if (WARN_ON(initcnt > IRQ_BITMAP_BITS))
  200. initcnt = IRQ_BITMAP_BITS;
  201. if (initcnt > nr_irqs)
  202. nr_irqs = initcnt;
  203. for (i = 0; i < initcnt; i++) {
  204. desc = alloc_desc(i, node, NULL);
  205. set_bit(i, allocated_irqs);
  206. irq_insert_desc(i, desc);
  207. }
  208. return arch_early_irq_init();
  209. }
  210. #else /* !CONFIG_SPARSE_IRQ */
  211. struct irq_desc irq_desc[NR_IRQS] __cacheline_aligned_in_smp = {
  212. [0 ... NR_IRQS-1] = {
  213. .handle_irq = handle_bad_irq,
  214. .depth = 1,
  215. .lock = __RAW_SPIN_LOCK_UNLOCKED(irq_desc->lock),
  216. }
  217. };
  218. int __init early_irq_init(void)
  219. {
  220. int count, i, node = first_online_node;
  221. struct irq_desc *desc;
  222. init_irq_default_affinity();
  223. printk(KERN_INFO "NR_IRQS:%d\n", NR_IRQS);
  224. desc = irq_desc;
  225. count = ARRAY_SIZE(irq_desc);
  226. for (i = 0; i < count; i++) {
  227. desc[i].kstat_irqs = alloc_percpu(unsigned int);
  228. alloc_masks(&desc[i], GFP_KERNEL, node);
  229. raw_spin_lock_init(&desc[i].lock);
  230. lockdep_set_class(&desc[i].lock, &irq_desc_lock_class);
  231. desc_set_defaults(i, &desc[i], node, NULL);
  232. }
  233. return arch_early_irq_init();
  234. }
  235. struct irq_desc *irq_to_desc(unsigned int irq)
  236. {
  237. return (irq < NR_IRQS) ? irq_desc + irq : NULL;
  238. }
  239. EXPORT_SYMBOL(irq_to_desc);
  240. static void free_desc(unsigned int irq)
  241. {
  242. struct irq_desc *desc = irq_to_desc(irq);
  243. unsigned long flags;
  244. raw_spin_lock_irqsave(&desc->lock, flags);
  245. desc_set_defaults(irq, desc, irq_desc_get_node(desc), NULL);
  246. raw_spin_unlock_irqrestore(&desc->lock, flags);
  247. }
  248. static inline int alloc_descs(unsigned int start, unsigned int cnt, int node,
  249. struct module *owner)
  250. {
  251. u32 i;
  252. for (i = 0; i < cnt; i++) {
  253. struct irq_desc *desc = irq_to_desc(start + i);
  254. desc->owner = owner;
  255. }
  256. return start;
  257. }
  258. static int irq_expand_nr_irqs(unsigned int nr)
  259. {
  260. return -ENOMEM;
  261. }
  262. void irq_mark_irq(unsigned int irq)
  263. {
  264. mutex_lock(&sparse_irq_lock);
  265. bitmap_set(allocated_irqs, irq, 1);
  266. mutex_unlock(&sparse_irq_lock);
  267. }
  268. #ifdef CONFIG_GENERIC_IRQ_LEGACY
  269. void irq_init_desc(unsigned int irq)
  270. {
  271. free_desc(irq);
  272. }
  273. #endif
  274. #endif /* !CONFIG_SPARSE_IRQ */
  275. /**
  276. * generic_handle_irq - Invoke the handler for a particular irq
  277. * @irq: The irq number to handle
  278. *
  279. */
  280. int generic_handle_irq(unsigned int irq)
  281. {
  282. struct irq_desc *desc = irq_to_desc(irq);
  283. if (!desc)
  284. return -EINVAL;
  285. generic_handle_irq_desc(irq, desc);
  286. return 0;
  287. }
  288. EXPORT_SYMBOL_GPL(generic_handle_irq);
  289. #ifdef CONFIG_HANDLE_DOMAIN_IRQ
  290. /**
  291. * __handle_domain_irq - Invoke the handler for a HW irq belonging to a domain
  292. * @domain: The domain where to perform the lookup
  293. * @hwirq: The HW irq number to convert to a logical one
  294. * @lookup: Whether to perform the domain lookup or not
  295. * @regs: Register file coming from the low-level handling code
  296. *
  297. * Returns: 0 on success, or -EINVAL if conversion has failed
  298. */
  299. int __handle_domain_irq(struct irq_domain *domain, unsigned int hwirq,
  300. bool lookup, struct pt_regs *regs)
  301. {
  302. struct pt_regs *old_regs = set_irq_regs(regs);
  303. unsigned int irq = hwirq;
  304. int ret = 0;
  305. irq_enter();
  306. #ifdef CONFIG_IRQ_DOMAIN
  307. if (lookup)
  308. irq = irq_find_mapping(domain, hwirq);
  309. #endif
  310. /*
  311. * Some hardware gives randomly wrong interrupts. Rather
  312. * than crashing, do something sensible.
  313. */
  314. if (unlikely(!irq || irq >= nr_irqs)) {
  315. ack_bad_irq(irq);
  316. ret = -EINVAL;
  317. } else {
  318. generic_handle_irq(irq);
  319. }
  320. irq_exit();
  321. set_irq_regs(old_regs);
  322. return ret;
  323. }
  324. #endif
  325. /* Dynamic interrupt handling */
  326. /**
  327. * irq_free_descs - free irq descriptors
  328. * @from: Start of descriptor range
  329. * @cnt: Number of consecutive irqs to free
  330. */
  331. void irq_free_descs(unsigned int from, unsigned int cnt)
  332. {
  333. int i;
  334. if (from >= nr_irqs || (from + cnt) > nr_irqs)
  335. return;
  336. for (i = 0; i < cnt; i++)
  337. free_desc(from + i);
  338. mutex_lock(&sparse_irq_lock);
  339. bitmap_clear(allocated_irqs, from, cnt);
  340. mutex_unlock(&sparse_irq_lock);
  341. }
  342. EXPORT_SYMBOL_GPL(irq_free_descs);
  343. /**
  344. * irq_alloc_descs - allocate and initialize a range of irq descriptors
  345. * @irq: Allocate for specific irq number if irq >= 0
  346. * @from: Start the search from this irq number
  347. * @cnt: Number of consecutive irqs to allocate.
  348. * @node: Preferred node on which the irq descriptor should be allocated
  349. * @owner: Owning module (can be NULL)
  350. *
  351. * Returns the first irq number or error code
  352. */
  353. int __ref
  354. __irq_alloc_descs(int irq, unsigned int from, unsigned int cnt, int node,
  355. struct module *owner)
  356. {
  357. int start, ret;
  358. if (!cnt)
  359. return -EINVAL;
  360. if (irq >= 0) {
  361. if (from > irq)
  362. return -EINVAL;
  363. from = irq;
  364. } else {
  365. /*
  366. * For interrupts which are freely allocated the
  367. * architecture can force a lower bound to the @from
  368. * argument. x86 uses this to exclude the GSI space.
  369. */
  370. from = arch_dynirq_lower_bound(from);
  371. }
  372. mutex_lock(&sparse_irq_lock);
  373. start = bitmap_find_next_zero_area(allocated_irqs, IRQ_BITMAP_BITS,
  374. from, cnt, 0);
  375. ret = -EEXIST;
  376. if (irq >=0 && start != irq)
  377. goto err;
  378. if (start + cnt > nr_irqs) {
  379. ret = irq_expand_nr_irqs(start + cnt);
  380. if (ret)
  381. goto err;
  382. }
  383. bitmap_set(allocated_irqs, start, cnt);
  384. mutex_unlock(&sparse_irq_lock);
  385. return alloc_descs(start, cnt, node, owner);
  386. err:
  387. mutex_unlock(&sparse_irq_lock);
  388. return ret;
  389. }
  390. EXPORT_SYMBOL_GPL(__irq_alloc_descs);
  391. #ifdef CONFIG_GENERIC_IRQ_LEGACY_ALLOC_HWIRQ
  392. /**
  393. * irq_alloc_hwirqs - Allocate an irq descriptor and initialize the hardware
  394. * @cnt: number of interrupts to allocate
  395. * @node: node on which to allocate
  396. *
  397. * Returns an interrupt number > 0 or 0, if the allocation fails.
  398. */
  399. unsigned int irq_alloc_hwirqs(int cnt, int node)
  400. {
  401. int i, irq = __irq_alloc_descs(-1, 0, cnt, node, NULL);
  402. if (irq < 0)
  403. return 0;
  404. for (i = irq; cnt > 0; i++, cnt--) {
  405. if (arch_setup_hwirq(i, node))
  406. goto err;
  407. irq_clear_status_flags(i, _IRQ_NOREQUEST);
  408. }
  409. return irq;
  410. err:
  411. for (i--; i >= irq; i--) {
  412. irq_set_status_flags(i, _IRQ_NOREQUEST | _IRQ_NOPROBE);
  413. arch_teardown_hwirq(i);
  414. }
  415. irq_free_descs(irq, cnt);
  416. return 0;
  417. }
  418. EXPORT_SYMBOL_GPL(irq_alloc_hwirqs);
  419. /**
  420. * irq_free_hwirqs - Free irq descriptor and cleanup the hardware
  421. * @from: Free from irq number
  422. * @cnt: number of interrupts to free
  423. *
  424. */
  425. void irq_free_hwirqs(unsigned int from, int cnt)
  426. {
  427. int i, j;
  428. for (i = from, j = cnt; j > 0; i++, j--) {
  429. irq_set_status_flags(i, _IRQ_NOREQUEST | _IRQ_NOPROBE);
  430. arch_teardown_hwirq(i);
  431. }
  432. irq_free_descs(from, cnt);
  433. }
  434. EXPORT_SYMBOL_GPL(irq_free_hwirqs);
  435. #endif
  436. /**
  437. * irq_get_next_irq - get next allocated irq number
  438. * @offset: where to start the search
  439. *
  440. * Returns next irq number after offset or nr_irqs if none is found.
  441. */
  442. unsigned int irq_get_next_irq(unsigned int offset)
  443. {
  444. return find_next_bit(allocated_irqs, nr_irqs, offset);
  445. }
  446. struct irq_desc *
  447. __irq_get_desc_lock(unsigned int irq, unsigned long *flags, bool bus,
  448. unsigned int check)
  449. {
  450. struct irq_desc *desc = irq_to_desc(irq);
  451. if (desc) {
  452. if (check & _IRQ_DESC_CHECK) {
  453. if ((check & _IRQ_DESC_PERCPU) &&
  454. !irq_settings_is_per_cpu_devid(desc))
  455. return NULL;
  456. if (!(check & _IRQ_DESC_PERCPU) &&
  457. irq_settings_is_per_cpu_devid(desc))
  458. return NULL;
  459. }
  460. if (bus)
  461. chip_bus_lock(desc);
  462. raw_spin_lock_irqsave(&desc->lock, *flags);
  463. }
  464. return desc;
  465. }
  466. void __irq_put_desc_unlock(struct irq_desc *desc, unsigned long flags, bool bus)
  467. {
  468. raw_spin_unlock_irqrestore(&desc->lock, flags);
  469. if (bus)
  470. chip_bus_sync_unlock(desc);
  471. }
  472. int irq_set_percpu_devid(unsigned int irq)
  473. {
  474. struct irq_desc *desc = irq_to_desc(irq);
  475. if (!desc)
  476. return -EINVAL;
  477. if (desc->percpu_enabled)
  478. return -EINVAL;
  479. desc->percpu_enabled = kzalloc(sizeof(*desc->percpu_enabled), GFP_KERNEL);
  480. if (!desc->percpu_enabled)
  481. return -ENOMEM;
  482. irq_set_percpu_devid_flags(irq);
  483. return 0;
  484. }
  485. void kstat_incr_irq_this_cpu(unsigned int irq)
  486. {
  487. kstat_incr_irqs_this_cpu(irq, irq_to_desc(irq));
  488. }
  489. /**
  490. * kstat_irqs_cpu - Get the statistics for an interrupt on a cpu
  491. * @irq: The interrupt number
  492. * @cpu: The cpu number
  493. *
  494. * Returns the sum of interrupt counts on @cpu since boot for
  495. * @irq. The caller must ensure that the interrupt is not removed
  496. * concurrently.
  497. */
  498. unsigned int kstat_irqs_cpu(unsigned int irq, int cpu)
  499. {
  500. struct irq_desc *desc = irq_to_desc(irq);
  501. return desc && desc->kstat_irqs ?
  502. *per_cpu_ptr(desc->kstat_irqs, cpu) : 0;
  503. }
  504. /**
  505. * kstat_irqs - Get the statistics for an interrupt
  506. * @irq: The interrupt number
  507. *
  508. * Returns the sum of interrupt counts on all cpus since boot for
  509. * @irq. The caller must ensure that the interrupt is not removed
  510. * concurrently.
  511. */
  512. unsigned int kstat_irqs(unsigned int irq)
  513. {
  514. struct irq_desc *desc = irq_to_desc(irq);
  515. int cpu;
  516. unsigned int sum = 0;
  517. if (!desc || !desc->kstat_irqs)
  518. return 0;
  519. for_each_possible_cpu(cpu)
  520. sum += *per_cpu_ptr(desc->kstat_irqs, cpu);
  521. return sum;
  522. }
  523. /**
  524. * kstat_irqs_usr - Get the statistics for an interrupt
  525. * @irq: The interrupt number
  526. *
  527. * Returns the sum of interrupt counts on all cpus since boot for
  528. * @irq. Contrary to kstat_irqs() this can be called from any
  529. * preemptible context. It's protected against concurrent removal of
  530. * an interrupt descriptor when sparse irqs are enabled.
  531. */
  532. unsigned int kstat_irqs_usr(unsigned int irq)
  533. {
  534. unsigned int sum;
  535. irq_lock_sparse();
  536. sum = kstat_irqs(irq);
  537. irq_unlock_sparse();
  538. return sum;
  539. }