irq_work.c 3.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143
  1. /*
  2. * Copyright (C) 2010 Red Hat, Inc., Peter Zijlstra <pzijlstr@redhat.com>
  3. *
  4. * Provides a framework for enqueueing and running callbacks from hardirq
  5. * context. The enqueueing is NMI-safe.
  6. */
  7. #include <linux/kernel.h>
  8. #include <linux/export.h>
  9. #include <linux/irq_work.h>
  10. #include <linux/percpu.h>
  11. #include <linux/hardirq.h>
  12. #include <asm/processor.h>
  13. /*
  14. * An entry can be in one of four states:
  15. *
  16. * free NULL, 0 -> {claimed} : free to be used
  17. * claimed NULL, 3 -> {pending} : claimed to be enqueued
  18. * pending next, 3 -> {busy} : queued, pending callback
  19. * busy NULL, 2 -> {free, claimed} : callback in progress, can be claimed
  20. */
  21. #define IRQ_WORK_PENDING 1UL
  22. #define IRQ_WORK_BUSY 2UL
  23. #define IRQ_WORK_FLAGS 3UL
  24. static DEFINE_PER_CPU(struct llist_head, irq_work_list);
  25. /*
  26. * Claim the entry so that no one else will poke at it.
  27. */
  28. static bool irq_work_claim(struct irq_work *work)
  29. {
  30. unsigned long flags, nflags;
  31. for (;;) {
  32. flags = work->flags;
  33. if (flags & IRQ_WORK_PENDING)
  34. return false;
  35. nflags = flags | IRQ_WORK_FLAGS;
  36. if (cmpxchg(&work->flags, flags, nflags) == flags)
  37. break;
  38. cpu_relax();
  39. }
  40. return true;
  41. }
  42. void __weak arch_irq_work_raise(void)
  43. {
  44. /*
  45. * Lame architectures will get the timer tick callback
  46. */
  47. }
  48. /*
  49. * Queue the entry and raise the IPI if needed.
  50. */
  51. static void __irq_work_queue(struct irq_work *work)
  52. {
  53. bool empty;
  54. preempt_disable();
  55. empty = llist_add(&work->llnode, &__get_cpu_var(irq_work_list));
  56. /* The list was empty, raise self-interrupt to start processing. */
  57. if (empty)
  58. arch_irq_work_raise();
  59. preempt_enable();
  60. }
  61. /*
  62. * Enqueue the irq_work @entry, returns true on success, failure when the
  63. * @entry was already enqueued by someone else.
  64. *
  65. * Can be re-enqueued while the callback is still in progress.
  66. */
  67. bool irq_work_queue(struct irq_work *work)
  68. {
  69. if (!irq_work_claim(work)) {
  70. /*
  71. * Already enqueued, can't do!
  72. */
  73. return false;
  74. }
  75. __irq_work_queue(work);
  76. return true;
  77. }
  78. EXPORT_SYMBOL_GPL(irq_work_queue);
  79. /*
  80. * Run the irq_work entries on this cpu. Requires to be ran from hardirq
  81. * context with local IRQs disabled.
  82. */
  83. void irq_work_run(void)
  84. {
  85. struct irq_work *work;
  86. struct llist_head *this_list;
  87. struct llist_node *llnode;
  88. this_list = &__get_cpu_var(irq_work_list);
  89. if (llist_empty(this_list))
  90. return;
  91. BUG_ON(!in_irq());
  92. BUG_ON(!irqs_disabled());
  93. llnode = llist_del_all(this_list);
  94. while (llnode != NULL) {
  95. work = llist_entry(llnode, struct irq_work, llnode);
  96. llnode = llist_next(llnode);
  97. /*
  98. * Clear the PENDING bit, after this point the @work
  99. * can be re-used.
  100. */
  101. work->flags = IRQ_WORK_BUSY;
  102. work->func(work);
  103. /*
  104. * Clear the BUSY bit and return to the free state if
  105. * no-one else claimed it meanwhile.
  106. */
  107. (void)cmpxchg(&work->flags, IRQ_WORK_BUSY, 0);
  108. }
  109. }
  110. EXPORT_SYMBOL_GPL(irq_work_run);
  111. /*
  112. * Synchronize against the irq_work @entry, ensures the entry is not
  113. * currently in use.
  114. */
  115. void irq_work_sync(struct irq_work *work)
  116. {
  117. WARN_ON_ONCE(irqs_disabled());
  118. while (work->flags & IRQ_WORK_BUSY)
  119. cpu_relax();
  120. }
  121. EXPORT_SYMBOL_GPL(irq_work_sync);