irqdesc.c 15 KB

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