events_fifo.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443
  1. /*
  2. * Xen event channels (FIFO-based ABI)
  3. *
  4. * Copyright (C) 2013 Citrix Systems R&D ltd.
  5. *
  6. * This source code is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU General Public License as
  8. * published by the Free Software Foundation; either version 2 of the
  9. * License, or (at your option) any later version.
  10. *
  11. * Or, when distributed separately from the Linux kernel or
  12. * incorporated into other software packages, subject to the following
  13. * license:
  14. *
  15. * Permission is hereby granted, free of charge, to any person obtaining a copy
  16. * of this source file (the "Software"), to deal in the Software without
  17. * restriction, including without limitation the rights to use, copy, modify,
  18. * merge, publish, distribute, sublicense, and/or sell copies of the Software,
  19. * and to permit persons to whom the Software is furnished to do so, subject to
  20. * the following conditions:
  21. *
  22. * The above copyright notice and this permission notice shall be included in
  23. * all copies or substantial portions of the Software.
  24. *
  25. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  26. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  27. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  28. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  29. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  30. * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
  31. * IN THE SOFTWARE.
  32. */
  33. #define pr_fmt(fmt) "xen:" KBUILD_MODNAME ": " fmt
  34. #include <linux/linkage.h>
  35. #include <linux/interrupt.h>
  36. #include <linux/irq.h>
  37. #include <linux/module.h>
  38. #include <linux/smp.h>
  39. #include <linux/percpu.h>
  40. #include <linux/cpu.h>
  41. #include <asm/sync_bitops.h>
  42. #include <asm/xen/hypercall.h>
  43. #include <asm/xen/hypervisor.h>
  44. #include <asm/xen/page.h>
  45. #include <xen/xen.h>
  46. #include <xen/xen-ops.h>
  47. #include <xen/events.h>
  48. #include <xen/interface/xen.h>
  49. #include <xen/interface/event_channel.h>
  50. #include "events_internal.h"
  51. #define EVENT_WORDS_PER_PAGE (PAGE_SIZE / sizeof(event_word_t))
  52. #define MAX_EVENT_ARRAY_PAGES (EVTCHN_FIFO_NR_CHANNELS / EVENT_WORDS_PER_PAGE)
  53. struct evtchn_fifo_queue {
  54. uint32_t head[EVTCHN_FIFO_MAX_QUEUES];
  55. };
  56. static DEFINE_PER_CPU(struct evtchn_fifo_control_block *, cpu_control_block);
  57. static DEFINE_PER_CPU(struct evtchn_fifo_queue, cpu_queue);
  58. static event_word_t *event_array[MAX_EVENT_ARRAY_PAGES] __read_mostly;
  59. static unsigned event_array_pages __read_mostly;
  60. /*
  61. * sync_set_bit() and friends must be unsigned long aligned on non-x86
  62. * platforms.
  63. */
  64. #if !defined(CONFIG_X86) && BITS_PER_LONG > 32
  65. #define BM(w) (unsigned long *)((unsigned long)w & ~0x7UL)
  66. #define EVTCHN_FIFO_BIT(b, w) \
  67. (((unsigned long)w & 0x4UL) ? (EVTCHN_FIFO_ ##b + 32) : EVTCHN_FIFO_ ##b)
  68. #else
  69. #define BM(w) ((unsigned long *)(w))
  70. #define EVTCHN_FIFO_BIT(b, w) EVTCHN_FIFO_ ##b
  71. #endif
  72. static inline event_word_t *event_word_from_port(unsigned port)
  73. {
  74. unsigned i = port / EVENT_WORDS_PER_PAGE;
  75. return event_array[i] + port % EVENT_WORDS_PER_PAGE;
  76. }
  77. static unsigned evtchn_fifo_max_channels(void)
  78. {
  79. return EVTCHN_FIFO_NR_CHANNELS;
  80. }
  81. static unsigned evtchn_fifo_nr_channels(void)
  82. {
  83. return event_array_pages * EVENT_WORDS_PER_PAGE;
  84. }
  85. static void free_unused_array_pages(void)
  86. {
  87. unsigned i;
  88. for (i = event_array_pages; i < MAX_EVENT_ARRAY_PAGES; i++) {
  89. if (!event_array[i])
  90. break;
  91. free_page((unsigned long)event_array[i]);
  92. event_array[i] = NULL;
  93. }
  94. }
  95. static void init_array_page(event_word_t *array_page)
  96. {
  97. unsigned i;
  98. for (i = 0; i < EVENT_WORDS_PER_PAGE; i++)
  99. array_page[i] = 1 << EVTCHN_FIFO_MASKED;
  100. }
  101. static int evtchn_fifo_setup(struct irq_info *info)
  102. {
  103. unsigned port = info->evtchn;
  104. unsigned new_array_pages;
  105. int ret;
  106. new_array_pages = port / EVENT_WORDS_PER_PAGE + 1;
  107. if (new_array_pages > MAX_EVENT_ARRAY_PAGES)
  108. return -EINVAL;
  109. while (event_array_pages < new_array_pages) {
  110. void *array_page;
  111. struct evtchn_expand_array expand_array;
  112. /* Might already have a page if we've resumed. */
  113. array_page = event_array[event_array_pages];
  114. if (!array_page) {
  115. array_page = (void *)__get_free_page(GFP_KERNEL);
  116. if (array_page == NULL) {
  117. ret = -ENOMEM;
  118. goto error;
  119. }
  120. event_array[event_array_pages] = array_page;
  121. }
  122. /* Mask all events in this page before adding it. */
  123. init_array_page(array_page);
  124. expand_array.array_gfn = virt_to_mfn(array_page);
  125. ret = HYPERVISOR_event_channel_op(EVTCHNOP_expand_array, &expand_array);
  126. if (ret < 0)
  127. goto error;
  128. event_array_pages++;
  129. }
  130. return 0;
  131. error:
  132. if (event_array_pages == 0)
  133. panic("xen: unable to expand event array with initial page (%d)\n", ret);
  134. else
  135. pr_err("unable to expand event array (%d)\n", ret);
  136. free_unused_array_pages();
  137. return ret;
  138. }
  139. static void evtchn_fifo_bind_to_cpu(struct irq_info *info, unsigned cpu)
  140. {
  141. /* no-op */
  142. }
  143. static void evtchn_fifo_clear_pending(unsigned port)
  144. {
  145. event_word_t *word = event_word_from_port(port);
  146. sync_clear_bit(EVTCHN_FIFO_BIT(PENDING, word), BM(word));
  147. }
  148. static void evtchn_fifo_set_pending(unsigned port)
  149. {
  150. event_word_t *word = event_word_from_port(port);
  151. sync_set_bit(EVTCHN_FIFO_BIT(PENDING, word), BM(word));
  152. }
  153. static bool evtchn_fifo_is_pending(unsigned port)
  154. {
  155. event_word_t *word = event_word_from_port(port);
  156. return sync_test_bit(EVTCHN_FIFO_BIT(PENDING, word), BM(word));
  157. }
  158. static bool evtchn_fifo_test_and_set_mask(unsigned port)
  159. {
  160. event_word_t *word = event_word_from_port(port);
  161. return sync_test_and_set_bit(EVTCHN_FIFO_BIT(MASKED, word), BM(word));
  162. }
  163. static void evtchn_fifo_mask(unsigned port)
  164. {
  165. event_word_t *word = event_word_from_port(port);
  166. sync_set_bit(EVTCHN_FIFO_BIT(MASKED, word), BM(word));
  167. }
  168. static bool evtchn_fifo_is_masked(unsigned port)
  169. {
  170. event_word_t *word = event_word_from_port(port);
  171. return sync_test_bit(EVTCHN_FIFO_BIT(MASKED, word), BM(word));
  172. }
  173. /*
  174. * Clear MASKED, spinning if BUSY is set.
  175. */
  176. static void clear_masked(volatile event_word_t *word)
  177. {
  178. event_word_t new, old, w;
  179. w = *word;
  180. do {
  181. old = w & ~(1 << EVTCHN_FIFO_BUSY);
  182. new = old & ~(1 << EVTCHN_FIFO_MASKED);
  183. w = sync_cmpxchg(word, old, new);
  184. } while (w != old);
  185. }
  186. static void evtchn_fifo_unmask(unsigned port)
  187. {
  188. event_word_t *word = event_word_from_port(port);
  189. BUG_ON(!irqs_disabled());
  190. clear_masked(word);
  191. if (evtchn_fifo_is_pending(port)) {
  192. struct evtchn_unmask unmask = { .port = port };
  193. (void)HYPERVISOR_event_channel_op(EVTCHNOP_unmask, &unmask);
  194. }
  195. }
  196. static uint32_t clear_linked(volatile event_word_t *word)
  197. {
  198. event_word_t new, old, w;
  199. w = *word;
  200. do {
  201. old = w;
  202. new = (w & ~((1 << EVTCHN_FIFO_LINKED)
  203. | EVTCHN_FIFO_LINK_MASK));
  204. } while ((w = sync_cmpxchg(word, old, new)) != old);
  205. return w & EVTCHN_FIFO_LINK_MASK;
  206. }
  207. static void handle_irq_for_port(unsigned port)
  208. {
  209. int irq;
  210. irq = get_evtchn_to_irq(port);
  211. if (irq != -1)
  212. generic_handle_irq(irq);
  213. }
  214. static void consume_one_event(unsigned cpu,
  215. struct evtchn_fifo_control_block *control_block,
  216. unsigned priority, unsigned long *ready)
  217. {
  218. struct evtchn_fifo_queue *q = &per_cpu(cpu_queue, cpu);
  219. uint32_t head;
  220. unsigned port;
  221. event_word_t *word;
  222. head = q->head[priority];
  223. /*
  224. * Reached the tail last time? Read the new HEAD from the
  225. * control block.
  226. */
  227. if (head == 0) {
  228. rmb(); /* Ensure word is up-to-date before reading head. */
  229. head = control_block->head[priority];
  230. }
  231. port = head;
  232. word = event_word_from_port(port);
  233. head = clear_linked(word);
  234. /*
  235. * If the link is non-zero, there are more events in the
  236. * queue, otherwise the queue is empty.
  237. *
  238. * If the queue is empty, clear this priority from our local
  239. * copy of the ready word.
  240. */
  241. if (head == 0)
  242. clear_bit(priority, ready);
  243. if (evtchn_fifo_is_pending(port) && !evtchn_fifo_is_masked(port))
  244. handle_irq_for_port(port);
  245. q->head[priority] = head;
  246. }
  247. static void evtchn_fifo_handle_events(unsigned cpu)
  248. {
  249. struct evtchn_fifo_control_block *control_block;
  250. unsigned long ready;
  251. unsigned q;
  252. control_block = per_cpu(cpu_control_block, cpu);
  253. ready = xchg(&control_block->ready, 0);
  254. while (ready) {
  255. q = find_first_bit(BM(&ready), EVTCHN_FIFO_MAX_QUEUES);
  256. consume_one_event(cpu, control_block, q, &ready);
  257. ready |= xchg(&control_block->ready, 0);
  258. }
  259. }
  260. static void evtchn_fifo_resume(void)
  261. {
  262. unsigned cpu;
  263. for_each_possible_cpu(cpu) {
  264. void *control_block = per_cpu(cpu_control_block, cpu);
  265. struct evtchn_init_control init_control;
  266. int ret;
  267. if (!control_block)
  268. continue;
  269. /*
  270. * If this CPU is offline, take the opportunity to
  271. * free the control block while it is not being
  272. * used.
  273. */
  274. if (!cpu_online(cpu)) {
  275. free_page((unsigned long)control_block);
  276. per_cpu(cpu_control_block, cpu) = NULL;
  277. continue;
  278. }
  279. init_control.control_gfn = virt_to_mfn(control_block);
  280. init_control.offset = 0;
  281. init_control.vcpu = cpu;
  282. ret = HYPERVISOR_event_channel_op(EVTCHNOP_init_control,
  283. &init_control);
  284. if (ret < 0)
  285. BUG();
  286. }
  287. /*
  288. * The event array starts out as empty again and is extended
  289. * as normal when events are bound. The existing pages will
  290. * be reused.
  291. */
  292. event_array_pages = 0;
  293. }
  294. static const struct evtchn_ops evtchn_ops_fifo = {
  295. .max_channels = evtchn_fifo_max_channels,
  296. .nr_channels = evtchn_fifo_nr_channels,
  297. .setup = evtchn_fifo_setup,
  298. .bind_to_cpu = evtchn_fifo_bind_to_cpu,
  299. .clear_pending = evtchn_fifo_clear_pending,
  300. .set_pending = evtchn_fifo_set_pending,
  301. .is_pending = evtchn_fifo_is_pending,
  302. .test_and_set_mask = evtchn_fifo_test_and_set_mask,
  303. .mask = evtchn_fifo_mask,
  304. .unmask = evtchn_fifo_unmask,
  305. .handle_events = evtchn_fifo_handle_events,
  306. .resume = evtchn_fifo_resume,
  307. };
  308. static int evtchn_fifo_init_control_block(unsigned cpu)
  309. {
  310. struct page *control_block = NULL;
  311. struct evtchn_init_control init_control;
  312. int ret = -ENOMEM;
  313. control_block = alloc_page(GFP_KERNEL|__GFP_ZERO);
  314. if (control_block == NULL)
  315. goto error;
  316. init_control.control_gfn = virt_to_mfn(page_address(control_block));
  317. init_control.offset = 0;
  318. init_control.vcpu = cpu;
  319. ret = HYPERVISOR_event_channel_op(EVTCHNOP_init_control, &init_control);
  320. if (ret < 0)
  321. goto error;
  322. per_cpu(cpu_control_block, cpu) = page_address(control_block);
  323. return 0;
  324. error:
  325. __free_page(control_block);
  326. return ret;
  327. }
  328. static int evtchn_fifo_cpu_notification(struct notifier_block *self,
  329. unsigned long action,
  330. void *hcpu)
  331. {
  332. int cpu = (long)hcpu;
  333. int ret = 0;
  334. switch (action) {
  335. case CPU_UP_PREPARE:
  336. if (!per_cpu(cpu_control_block, cpu))
  337. ret = evtchn_fifo_init_control_block(cpu);
  338. break;
  339. default:
  340. break;
  341. }
  342. return ret < 0 ? NOTIFY_BAD : NOTIFY_OK;
  343. }
  344. static struct notifier_block evtchn_fifo_cpu_notifier = {
  345. .notifier_call = evtchn_fifo_cpu_notification,
  346. };
  347. int __init xen_evtchn_fifo_init(void)
  348. {
  349. int cpu = get_cpu();
  350. int ret;
  351. ret = evtchn_fifo_init_control_block(cpu);
  352. if (ret < 0)
  353. goto out;
  354. pr_info("Using FIFO-based ABI\n");
  355. evtchn_ops = &evtchn_ops_fifo;
  356. register_cpu_notifier(&evtchn_fifo_cpu_notifier);
  357. out:
  358. put_cpu();
  359. return ret;
  360. }