irqdesc.c 14 KB

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