irqdesc.c 15 KB

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