irqdesc.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554
  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 "internals.h"
  18. /*
  19. * lockdep: we want to handle all irq_desc locks as a single lock-class:
  20. */
  21. static struct lock_class_key irq_desc_lock_class;
  22. #if defined(CONFIG_SMP)
  23. static void __init init_irq_default_affinity(void)
  24. {
  25. alloc_cpumask_var(&irq_default_affinity, GFP_NOWAIT);
  26. cpumask_setall(irq_default_affinity);
  27. }
  28. #else
  29. static void __init init_irq_default_affinity(void)
  30. {
  31. }
  32. #endif
  33. #ifdef CONFIG_SMP
  34. static int alloc_masks(struct irq_desc *desc, gfp_t gfp, int node)
  35. {
  36. if (!zalloc_cpumask_var_node(&desc->irq_data.affinity, gfp, node))
  37. return -ENOMEM;
  38. #ifdef CONFIG_GENERIC_PENDING_IRQ
  39. if (!zalloc_cpumask_var_node(&desc->pending_mask, gfp, node)) {
  40. free_cpumask_var(desc->irq_data.affinity);
  41. return -ENOMEM;
  42. }
  43. #endif
  44. return 0;
  45. }
  46. static void desc_smp_init(struct irq_desc *desc, int node)
  47. {
  48. desc->irq_data.node = node;
  49. cpumask_copy(desc->irq_data.affinity, irq_default_affinity);
  50. #ifdef CONFIG_GENERIC_PENDING_IRQ
  51. cpumask_clear(desc->pending_mask);
  52. #endif
  53. }
  54. static inline int desc_node(struct irq_desc *desc)
  55. {
  56. return desc->irq_data.node;
  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. static inline int desc_node(struct irq_desc *desc) { return 0; }
  63. #endif
  64. static void desc_set_defaults(unsigned int irq, struct irq_desc *desc, int node,
  65. struct module *owner)
  66. {
  67. int cpu;
  68. desc->irq_data.irq = irq;
  69. desc->irq_data.chip = &no_irq_chip;
  70. desc->irq_data.chip_data = NULL;
  71. desc->irq_data.handler_data = NULL;
  72. desc->irq_data.msi_desc = 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_data.affinity);
  111. }
  112. #else
  113. static inline void free_masks(struct irq_desc *desc) { }
  114. #endif
  115. static struct irq_desc *alloc_desc(int irq, int node, struct module *owner)
  116. {
  117. struct irq_desc *desc;
  118. gfp_t gfp = GFP_KERNEL;
  119. desc = kzalloc_node(sizeof(*desc), gfp, node);
  120. if (!desc)
  121. return NULL;
  122. /* allocate based on nr_cpu_ids */
  123. desc->kstat_irqs = alloc_percpu(unsigned int);
  124. if (!desc->kstat_irqs)
  125. goto err_desc;
  126. if (alloc_masks(desc, gfp, node))
  127. goto err_kstat;
  128. raw_spin_lock_init(&desc->lock);
  129. lockdep_set_class(&desc->lock, &irq_desc_lock_class);
  130. desc_set_defaults(irq, desc, node, owner);
  131. return desc;
  132. err_kstat:
  133. free_percpu(desc->kstat_irqs);
  134. err_desc:
  135. kfree(desc);
  136. return NULL;
  137. }
  138. static void free_desc(unsigned int irq)
  139. {
  140. struct irq_desc *desc = irq_to_desc(irq);
  141. unregister_irq_proc(irq, desc);
  142. mutex_lock(&sparse_irq_lock);
  143. delete_irq_desc(irq);
  144. mutex_unlock(&sparse_irq_lock);
  145. free_masks(desc);
  146. free_percpu(desc->kstat_irqs);
  147. kfree(desc);
  148. }
  149. static int alloc_descs(unsigned int start, unsigned int cnt, int node,
  150. struct module *owner)
  151. {
  152. struct irq_desc *desc;
  153. int i;
  154. for (i = 0; i < cnt; i++) {
  155. desc = alloc_desc(start + i, node, owner);
  156. if (!desc)
  157. goto err;
  158. mutex_lock(&sparse_irq_lock);
  159. irq_insert_desc(start + i, desc);
  160. mutex_unlock(&sparse_irq_lock);
  161. }
  162. return start;
  163. err:
  164. for (i--; i >= 0; i--)
  165. free_desc(start + i);
  166. mutex_lock(&sparse_irq_lock);
  167. bitmap_clear(allocated_irqs, start, cnt);
  168. mutex_unlock(&sparse_irq_lock);
  169. return -ENOMEM;
  170. }
  171. static int irq_expand_nr_irqs(unsigned int nr)
  172. {
  173. if (nr > IRQ_BITMAP_BITS)
  174. return -ENOMEM;
  175. nr_irqs = nr;
  176. return 0;
  177. }
  178. int __init early_irq_init(void)
  179. {
  180. int i, initcnt, node = first_online_node;
  181. struct irq_desc *desc;
  182. init_irq_default_affinity();
  183. /* Let arch update nr_irqs and return the nr of preallocated irqs */
  184. initcnt = arch_probe_nr_irqs();
  185. printk(KERN_INFO "NR_IRQS:%d nr_irqs:%d %d\n", NR_IRQS, nr_irqs, initcnt);
  186. if (WARN_ON(nr_irqs > IRQ_BITMAP_BITS))
  187. nr_irqs = IRQ_BITMAP_BITS;
  188. if (WARN_ON(initcnt > IRQ_BITMAP_BITS))
  189. initcnt = IRQ_BITMAP_BITS;
  190. if (initcnt > nr_irqs)
  191. nr_irqs = initcnt;
  192. for (i = 0; i < initcnt; i++) {
  193. desc = alloc_desc(i, node, NULL);
  194. set_bit(i, allocated_irqs);
  195. irq_insert_desc(i, desc);
  196. }
  197. return arch_early_irq_init();
  198. }
  199. #else /* !CONFIG_SPARSE_IRQ */
  200. struct irq_desc irq_desc[NR_IRQS] __cacheline_aligned_in_smp = {
  201. [0 ... NR_IRQS-1] = {
  202. .handle_irq = handle_bad_irq,
  203. .depth = 1,
  204. .lock = __RAW_SPIN_LOCK_UNLOCKED(irq_desc->lock),
  205. }
  206. };
  207. int __init early_irq_init(void)
  208. {
  209. int count, i, node = first_online_node;
  210. struct irq_desc *desc;
  211. init_irq_default_affinity();
  212. printk(KERN_INFO "NR_IRQS:%d\n", NR_IRQS);
  213. desc = irq_desc;
  214. count = ARRAY_SIZE(irq_desc);
  215. for (i = 0; i < count; i++) {
  216. desc[i].kstat_irqs = alloc_percpu(unsigned int);
  217. alloc_masks(&desc[i], GFP_KERNEL, node);
  218. raw_spin_lock_init(&desc[i].lock);
  219. lockdep_set_class(&desc[i].lock, &irq_desc_lock_class);
  220. desc_set_defaults(i, &desc[i], node, NULL);
  221. }
  222. return arch_early_irq_init();
  223. }
  224. struct irq_desc *irq_to_desc(unsigned int irq)
  225. {
  226. return (irq < NR_IRQS) ? irq_desc + irq : NULL;
  227. }
  228. EXPORT_SYMBOL(irq_to_desc);
  229. static void free_desc(unsigned int irq)
  230. {
  231. struct irq_desc *desc = irq_to_desc(irq);
  232. unsigned long flags;
  233. raw_spin_lock_irqsave(&desc->lock, flags);
  234. desc_set_defaults(irq, desc, desc_node(desc), NULL);
  235. raw_spin_unlock_irqrestore(&desc->lock, flags);
  236. }
  237. static inline int alloc_descs(unsigned int start, unsigned int cnt, int node,
  238. struct module *owner)
  239. {
  240. u32 i;
  241. for (i = 0; i < cnt; i++) {
  242. struct irq_desc *desc = irq_to_desc(start + i);
  243. desc->owner = owner;
  244. }
  245. return start;
  246. }
  247. static int irq_expand_nr_irqs(unsigned int nr)
  248. {
  249. return -ENOMEM;
  250. }
  251. void irq_mark_irq(unsigned int irq)
  252. {
  253. mutex_lock(&sparse_irq_lock);
  254. bitmap_set(allocated_irqs, irq, 1);
  255. mutex_unlock(&sparse_irq_lock);
  256. }
  257. #ifdef CONFIG_GENERIC_IRQ_LEGACY
  258. void irq_init_desc(unsigned int irq)
  259. {
  260. free_desc(irq);
  261. }
  262. #endif
  263. #endif /* !CONFIG_SPARSE_IRQ */
  264. /**
  265. * generic_handle_irq - Invoke the handler for a particular irq
  266. * @irq: The irq number to handle
  267. *
  268. */
  269. int generic_handle_irq(unsigned int irq)
  270. {
  271. struct irq_desc *desc = irq_to_desc(irq);
  272. if (!desc)
  273. return -EINVAL;
  274. generic_handle_irq_desc(irq, desc);
  275. return 0;
  276. }
  277. EXPORT_SYMBOL_GPL(generic_handle_irq);
  278. /* Dynamic interrupt handling */
  279. /**
  280. * irq_free_descs - free irq descriptors
  281. * @from: Start of descriptor range
  282. * @cnt: Number of consecutive irqs to free
  283. */
  284. void irq_free_descs(unsigned int from, unsigned int cnt)
  285. {
  286. int i;
  287. if (from >= nr_irqs || (from + cnt) > nr_irqs)
  288. return;
  289. for (i = 0; i < cnt; i++)
  290. free_desc(from + i);
  291. mutex_lock(&sparse_irq_lock);
  292. bitmap_clear(allocated_irqs, from, cnt);
  293. mutex_unlock(&sparse_irq_lock);
  294. }
  295. EXPORT_SYMBOL_GPL(irq_free_descs);
  296. /**
  297. * irq_alloc_descs - allocate and initialize a range of irq descriptors
  298. * @irq: Allocate for specific irq number if irq >= 0
  299. * @from: Start the search from this irq number
  300. * @cnt: Number of consecutive irqs to allocate.
  301. * @node: Preferred node on which the irq descriptor should be allocated
  302. * @owner: Owning module (can be NULL)
  303. *
  304. * Returns the first irq number or error code
  305. */
  306. int __ref
  307. __irq_alloc_descs(int irq, unsigned int from, unsigned int cnt, int node,
  308. struct module *owner)
  309. {
  310. int start, ret;
  311. if (!cnt)
  312. return -EINVAL;
  313. if (irq >= 0) {
  314. if (from > irq)
  315. return -EINVAL;
  316. from = irq;
  317. } else {
  318. /*
  319. * For interrupts which are freely allocated the
  320. * architecture can force a lower bound to the @from
  321. * argument. x86 uses this to exclude the GSI space.
  322. */
  323. from = arch_dynirq_lower_bound(from);
  324. }
  325. mutex_lock(&sparse_irq_lock);
  326. start = bitmap_find_next_zero_area(allocated_irqs, IRQ_BITMAP_BITS,
  327. from, cnt, 0);
  328. ret = -EEXIST;
  329. if (irq >=0 && start != irq)
  330. goto err;
  331. if (start + cnt > nr_irqs) {
  332. ret = irq_expand_nr_irqs(start + cnt);
  333. if (ret)
  334. goto err;
  335. }
  336. bitmap_set(allocated_irqs, start, cnt);
  337. mutex_unlock(&sparse_irq_lock);
  338. return alloc_descs(start, cnt, node, owner);
  339. err:
  340. mutex_unlock(&sparse_irq_lock);
  341. return ret;
  342. }
  343. EXPORT_SYMBOL_GPL(__irq_alloc_descs);
  344. #ifdef CONFIG_GENERIC_IRQ_LEGACY_ALLOC_HWIRQ
  345. /**
  346. * irq_alloc_hwirqs - Allocate an irq descriptor and initialize the hardware
  347. * @cnt: number of interrupts to allocate
  348. * @node: node on which to allocate
  349. *
  350. * Returns an interrupt number > 0 or 0, if the allocation fails.
  351. */
  352. unsigned int irq_alloc_hwirqs(int cnt, int node)
  353. {
  354. int i, irq = __irq_alloc_descs(-1, 0, cnt, node, NULL);
  355. if (irq < 0)
  356. return 0;
  357. for (i = irq; cnt > 0; i++, cnt--) {
  358. if (arch_setup_hwirq(i, node))
  359. goto err;
  360. irq_clear_status_flags(i, _IRQ_NOREQUEST);
  361. }
  362. return irq;
  363. err:
  364. for (i--; i >= irq; i--) {
  365. irq_set_status_flags(i, _IRQ_NOREQUEST | _IRQ_NOPROBE);
  366. arch_teardown_hwirq(i);
  367. }
  368. irq_free_descs(irq, cnt);
  369. return 0;
  370. }
  371. EXPORT_SYMBOL_GPL(irq_alloc_hwirqs);
  372. /**
  373. * irq_free_hwirqs - Free irq descriptor and cleanup the hardware
  374. * @from: Free from irq number
  375. * @cnt: number of interrupts to free
  376. *
  377. */
  378. void irq_free_hwirqs(unsigned int from, int cnt)
  379. {
  380. int i, j;
  381. for (i = from, j = cnt; j > 0; i++, j--) {
  382. irq_set_status_flags(i, _IRQ_NOREQUEST | _IRQ_NOPROBE);
  383. arch_teardown_hwirq(i);
  384. }
  385. irq_free_descs(from, cnt);
  386. }
  387. EXPORT_SYMBOL_GPL(irq_free_hwirqs);
  388. #endif
  389. /**
  390. * irq_get_next_irq - get next allocated irq number
  391. * @offset: where to start the search
  392. *
  393. * Returns next irq number after offset or nr_irqs if none is found.
  394. */
  395. unsigned int irq_get_next_irq(unsigned int offset)
  396. {
  397. return find_next_bit(allocated_irqs, nr_irqs, offset);
  398. }
  399. struct irq_desc *
  400. __irq_get_desc_lock(unsigned int irq, unsigned long *flags, bool bus,
  401. unsigned int check)
  402. {
  403. struct irq_desc *desc = irq_to_desc(irq);
  404. if (desc) {
  405. if (check & _IRQ_DESC_CHECK) {
  406. if ((check & _IRQ_DESC_PERCPU) &&
  407. !irq_settings_is_per_cpu_devid(desc))
  408. return NULL;
  409. if (!(check & _IRQ_DESC_PERCPU) &&
  410. irq_settings_is_per_cpu_devid(desc))
  411. return NULL;
  412. }
  413. if (bus)
  414. chip_bus_lock(desc);
  415. raw_spin_lock_irqsave(&desc->lock, *flags);
  416. }
  417. return desc;
  418. }
  419. void __irq_put_desc_unlock(struct irq_desc *desc, unsigned long flags, bool bus)
  420. {
  421. raw_spin_unlock_irqrestore(&desc->lock, flags);
  422. if (bus)
  423. chip_bus_sync_unlock(desc);
  424. }
  425. int irq_set_percpu_devid(unsigned int irq)
  426. {
  427. struct irq_desc *desc = irq_to_desc(irq);
  428. if (!desc)
  429. return -EINVAL;
  430. if (desc->percpu_enabled)
  431. return -EINVAL;
  432. desc->percpu_enabled = kzalloc(sizeof(*desc->percpu_enabled), GFP_KERNEL);
  433. if (!desc->percpu_enabled)
  434. return -ENOMEM;
  435. irq_set_percpu_devid_flags(irq);
  436. return 0;
  437. }
  438. void kstat_incr_irq_this_cpu(unsigned int irq)
  439. {
  440. kstat_incr_irqs_this_cpu(irq, irq_to_desc(irq));
  441. }
  442. unsigned int kstat_irqs_cpu(unsigned int irq, int cpu)
  443. {
  444. struct irq_desc *desc = irq_to_desc(irq);
  445. return desc && desc->kstat_irqs ?
  446. *per_cpu_ptr(desc->kstat_irqs, cpu) : 0;
  447. }
  448. unsigned int kstat_irqs(unsigned int irq)
  449. {
  450. struct irq_desc *desc = irq_to_desc(irq);
  451. int cpu;
  452. int sum = 0;
  453. if (!desc || !desc->kstat_irqs)
  454. return 0;
  455. for_each_possible_cpu(cpu)
  456. sum += *per_cpu_ptr(desc->kstat_irqs, cpu);
  457. return sum;
  458. }