irqdesc.c 9.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448
  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/module.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) && defined(CONFIG_GENERIC_HARDIRQS)
  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. {
  66. int cpu;
  67. desc->irq_data.irq = irq;
  68. desc->irq_data.chip = &no_irq_chip;
  69. desc->irq_data.chip_data = NULL;
  70. desc->irq_data.handler_data = NULL;
  71. desc->irq_data.msi_desc = NULL;
  72. irq_settings_clr_and_set(desc, ~0, _IRQ_DEFAULT_INIT_FLAGS);
  73. irqd_set(&desc->irq_data, IRQD_IRQ_DISABLED);
  74. desc->istate = IRQS_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. for_each_possible_cpu(cpu)
  81. *per_cpu_ptr(desc->kstat_irqs, cpu) = 0;
  82. desc_smp_init(desc, node);
  83. }
  84. int nr_irqs = NR_IRQS;
  85. EXPORT_SYMBOL_GPL(nr_irqs);
  86. static DEFINE_MUTEX(sparse_irq_lock);
  87. static DECLARE_BITMAP(allocated_irqs, IRQ_BITMAP_BITS);
  88. #ifdef CONFIG_SPARSE_IRQ
  89. static RADIX_TREE(irq_desc_tree, GFP_KERNEL);
  90. static void irq_insert_desc(unsigned int irq, struct irq_desc *desc)
  91. {
  92. radix_tree_insert(&irq_desc_tree, irq, desc);
  93. }
  94. struct irq_desc *irq_to_desc(unsigned int irq)
  95. {
  96. return radix_tree_lookup(&irq_desc_tree, irq);
  97. }
  98. static void delete_irq_desc(unsigned int irq)
  99. {
  100. radix_tree_delete(&irq_desc_tree, irq);
  101. }
  102. #ifdef CONFIG_SMP
  103. static void free_masks(struct irq_desc *desc)
  104. {
  105. #ifdef CONFIG_GENERIC_PENDING_IRQ
  106. free_cpumask_var(desc->pending_mask);
  107. #endif
  108. free_cpumask_var(desc->irq_data.affinity);
  109. }
  110. #else
  111. static inline void free_masks(struct irq_desc *desc) { }
  112. #endif
  113. static struct irq_desc *alloc_desc(int irq, int node)
  114. {
  115. struct irq_desc *desc;
  116. gfp_t gfp = GFP_KERNEL;
  117. desc = kzalloc_node(sizeof(*desc), gfp, node);
  118. if (!desc)
  119. return NULL;
  120. /* allocate based on nr_cpu_ids */
  121. desc->kstat_irqs = alloc_percpu(unsigned int);
  122. if (!desc->kstat_irqs)
  123. goto err_desc;
  124. if (alloc_masks(desc, gfp, node))
  125. goto err_kstat;
  126. raw_spin_lock_init(&desc->lock);
  127. lockdep_set_class(&desc->lock, &irq_desc_lock_class);
  128. desc_set_defaults(irq, desc, node);
  129. return desc;
  130. err_kstat:
  131. free_percpu(desc->kstat_irqs);
  132. err_desc:
  133. kfree(desc);
  134. return NULL;
  135. }
  136. static void free_desc(unsigned int irq)
  137. {
  138. struct irq_desc *desc = irq_to_desc(irq);
  139. unregister_irq_proc(irq, desc);
  140. mutex_lock(&sparse_irq_lock);
  141. delete_irq_desc(irq);
  142. mutex_unlock(&sparse_irq_lock);
  143. free_masks(desc);
  144. free_percpu(desc->kstat_irqs);
  145. kfree(desc);
  146. }
  147. static int alloc_descs(unsigned int start, unsigned int cnt, int node)
  148. {
  149. struct irq_desc *desc;
  150. int i;
  151. for (i = 0; i < cnt; i++) {
  152. desc = alloc_desc(start + i, node);
  153. if (!desc)
  154. goto err;
  155. mutex_lock(&sparse_irq_lock);
  156. irq_insert_desc(start + i, desc);
  157. mutex_unlock(&sparse_irq_lock);
  158. }
  159. return start;
  160. err:
  161. for (i--; i >= 0; i--)
  162. free_desc(start + i);
  163. mutex_lock(&sparse_irq_lock);
  164. bitmap_clear(allocated_irqs, start, cnt);
  165. mutex_unlock(&sparse_irq_lock);
  166. return -ENOMEM;
  167. }
  168. static int irq_expand_nr_irqs(unsigned int nr)
  169. {
  170. if (nr > IRQ_BITMAP_BITS)
  171. return -ENOMEM;
  172. nr_irqs = nr;
  173. return 0;
  174. }
  175. int __init early_irq_init(void)
  176. {
  177. int i, initcnt, node = first_online_node;
  178. struct irq_desc *desc;
  179. init_irq_default_affinity();
  180. /* Let arch update nr_irqs and return the nr of preallocated irqs */
  181. initcnt = arch_probe_nr_irqs();
  182. printk(KERN_INFO "NR_IRQS:%d nr_irqs:%d %d\n", NR_IRQS, nr_irqs, initcnt);
  183. if (WARN_ON(nr_irqs > IRQ_BITMAP_BITS))
  184. nr_irqs = IRQ_BITMAP_BITS;
  185. if (WARN_ON(initcnt > IRQ_BITMAP_BITS))
  186. initcnt = IRQ_BITMAP_BITS;
  187. if (initcnt > nr_irqs)
  188. nr_irqs = initcnt;
  189. for (i = 0; i < initcnt; i++) {
  190. desc = alloc_desc(i, node);
  191. set_bit(i, allocated_irqs);
  192. irq_insert_desc(i, desc);
  193. }
  194. return arch_early_irq_init();
  195. }
  196. #else /* !CONFIG_SPARSE_IRQ */
  197. struct irq_desc irq_desc[NR_IRQS] __cacheline_aligned_in_smp = {
  198. [0 ... NR_IRQS-1] = {
  199. .istate = IRQS_DISABLED,
  200. .handle_irq = handle_bad_irq,
  201. .depth = 1,
  202. .lock = __RAW_SPIN_LOCK_UNLOCKED(irq_desc->lock),
  203. }
  204. };
  205. int __init early_irq_init(void)
  206. {
  207. int count, i, node = first_online_node;
  208. struct irq_desc *desc;
  209. init_irq_default_affinity();
  210. printk(KERN_INFO "NR_IRQS:%d\n", NR_IRQS);
  211. desc = irq_desc;
  212. count = ARRAY_SIZE(irq_desc);
  213. for (i = 0; i < count; i++) {
  214. desc[i].irq_data.irq = i;
  215. desc[i].irq_data.chip = &no_irq_chip;
  216. desc[i].kstat_irqs = alloc_percpu(unsigned int);
  217. irq_settings_clr_and_set(desc, ~0, _IRQ_DEFAULT_INIT_FLAGS);
  218. alloc_masks(desc + i, GFP_KERNEL, node);
  219. desc_smp_init(desc + i, node);
  220. lockdep_set_class(&desc[i].lock, &irq_desc_lock_class);
  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. static void free_desc(unsigned int irq)
  229. {
  230. dynamic_irq_cleanup(irq);
  231. }
  232. static inline int alloc_descs(unsigned int start, unsigned int cnt, int node)
  233. {
  234. return start;
  235. }
  236. static int irq_expand_nr_irqs(unsigned int nr)
  237. {
  238. return -ENOMEM;
  239. }
  240. #endif /* !CONFIG_SPARSE_IRQ */
  241. /* Dynamic interrupt handling */
  242. /**
  243. * irq_free_descs - free irq descriptors
  244. * @from: Start of descriptor range
  245. * @cnt: Number of consecutive irqs to free
  246. */
  247. void irq_free_descs(unsigned int from, unsigned int cnt)
  248. {
  249. int i;
  250. if (from >= nr_irqs || (from + cnt) > nr_irqs)
  251. return;
  252. for (i = 0; i < cnt; i++)
  253. free_desc(from + i);
  254. mutex_lock(&sparse_irq_lock);
  255. bitmap_clear(allocated_irqs, from, cnt);
  256. mutex_unlock(&sparse_irq_lock);
  257. }
  258. /**
  259. * irq_alloc_descs - allocate and initialize a range of irq descriptors
  260. * @irq: Allocate for specific irq number if irq >= 0
  261. * @from: Start the search from this irq number
  262. * @cnt: Number of consecutive irqs to allocate.
  263. * @node: Preferred node on which the irq descriptor should be allocated
  264. *
  265. * Returns the first irq number or error code
  266. */
  267. int __ref
  268. irq_alloc_descs(int irq, unsigned int from, unsigned int cnt, int node)
  269. {
  270. int start, ret;
  271. if (!cnt)
  272. return -EINVAL;
  273. mutex_lock(&sparse_irq_lock);
  274. start = bitmap_find_next_zero_area(allocated_irqs, IRQ_BITMAP_BITS,
  275. from, cnt, 0);
  276. ret = -EEXIST;
  277. if (irq >=0 && start != irq)
  278. goto err;
  279. if (start + cnt > nr_irqs) {
  280. ret = irq_expand_nr_irqs(start + cnt);
  281. if (ret)
  282. goto err;
  283. }
  284. bitmap_set(allocated_irqs, start, cnt);
  285. mutex_unlock(&sparse_irq_lock);
  286. return alloc_descs(start, cnt, node);
  287. err:
  288. mutex_unlock(&sparse_irq_lock);
  289. return ret;
  290. }
  291. /**
  292. * irq_reserve_irqs - mark irqs allocated
  293. * @from: mark from irq number
  294. * @cnt: number of irqs to mark
  295. *
  296. * Returns 0 on success or an appropriate error code
  297. */
  298. int irq_reserve_irqs(unsigned int from, unsigned int cnt)
  299. {
  300. unsigned int start;
  301. int ret = 0;
  302. if (!cnt || (from + cnt) > nr_irqs)
  303. return -EINVAL;
  304. mutex_lock(&sparse_irq_lock);
  305. start = bitmap_find_next_zero_area(allocated_irqs, nr_irqs, from, cnt, 0);
  306. if (start == from)
  307. bitmap_set(allocated_irqs, start, cnt);
  308. else
  309. ret = -EEXIST;
  310. mutex_unlock(&sparse_irq_lock);
  311. return ret;
  312. }
  313. /**
  314. * irq_get_next_irq - get next allocated irq number
  315. * @offset: where to start the search
  316. *
  317. * Returns next irq number after offset or nr_irqs if none is found.
  318. */
  319. unsigned int irq_get_next_irq(unsigned int offset)
  320. {
  321. return find_next_bit(allocated_irqs, nr_irqs, offset);
  322. }
  323. struct irq_desc *
  324. __irq_get_desc_lock(unsigned int irq, unsigned long *flags, bool bus)
  325. {
  326. struct irq_desc *desc = irq_to_desc(irq);
  327. if (desc) {
  328. if (bus)
  329. chip_bus_lock(desc);
  330. raw_spin_lock_irqsave(&desc->lock, *flags);
  331. }
  332. return desc;
  333. }
  334. void __irq_put_desc_unlock(struct irq_desc *desc, unsigned long flags, bool bus)
  335. {
  336. raw_spin_unlock_irqrestore(&desc->lock, flags);
  337. if (bus)
  338. chip_bus_sync_unlock(desc);
  339. }
  340. /**
  341. * dynamic_irq_cleanup - cleanup a dynamically allocated irq
  342. * @irq: irq number to initialize
  343. */
  344. void dynamic_irq_cleanup(unsigned int irq)
  345. {
  346. struct irq_desc *desc = irq_to_desc(irq);
  347. unsigned long flags;
  348. raw_spin_lock_irqsave(&desc->lock, flags);
  349. desc_set_defaults(irq, desc, desc_node(desc));
  350. raw_spin_unlock_irqrestore(&desc->lock, flags);
  351. }
  352. unsigned int kstat_irqs_cpu(unsigned int irq, int cpu)
  353. {
  354. struct irq_desc *desc = irq_to_desc(irq);
  355. return desc && desc->kstat_irqs ?
  356. *per_cpu_ptr(desc->kstat_irqs, cpu) : 0;
  357. }
  358. #ifdef CONFIG_GENERIC_HARDIRQS
  359. unsigned int kstat_irqs(unsigned int irq)
  360. {
  361. struct irq_desc *desc = irq_to_desc(irq);
  362. int cpu;
  363. int sum = 0;
  364. if (!desc || !desc->kstat_irqs)
  365. return 0;
  366. for_each_possible_cpu(cpu)
  367. sum += *per_cpu_ptr(desc->kstat_irqs, cpu);
  368. return sum;
  369. }
  370. #endif /* CONFIG_GENERIC_HARDIRQS */