2 * Copyright 2014 Advanced Micro Devices, Inc.
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
11 * The above copyright notice and this permission notice shall be included in
12 * all copies or substantial portions of the Software.
14 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
17 * THE COPYRIGHT HOLDER(S) OR AUTHOR(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR
18 * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
19 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
20 * OTHER DEALINGS IN THE SOFTWARE.
26 * AMD GPUs deliver interrupts by pushing an interrupt description onto the
27 * interrupt ring and then sending an interrupt. KGD receives the interrupt
28 * in ISR and sends us a pointer to each new entry on the interrupt ring.
30 * We generally can't process interrupt-signaled events from ISR, so we call
31 * out to each interrupt client module (currently only the scheduler) to ask if
32 * each interrupt is interesting. If they return true, then it requires further
33 * processing so we copy it to an internal interrupt ring and call each
34 * interrupt client again from a work-queue.
36 * There's no acknowledgment for the interrupts we use. The hardware simply
37 * queues a new interrupt each time without waiting.
39 * The fixed-size internal queue means that it's possible for us to lose
40 * interrupts because we have no back-pressure to the hardware.
43 #include <linux/slab.h>
44 #include <linux/device.h>
47 #define KFD_INTERRUPT_RING_SIZE 1024
49 static void interrupt_wq(struct work_struct
*);
51 int kfd_interrupt_init(struct kfd_dev
*kfd
)
53 void *interrupt_ring
= kmalloc_array(KFD_INTERRUPT_RING_SIZE
,
54 kfd
->device_info
->ih_ring_entry_size
,
59 kfd
->interrupt_ring
= interrupt_ring
;
60 kfd
->interrupt_ring_size
=
61 KFD_INTERRUPT_RING_SIZE
* kfd
->device_info
->ih_ring_entry_size
;
62 atomic_set(&kfd
->interrupt_ring_wptr
, 0);
63 atomic_set(&kfd
->interrupt_ring_rptr
, 0);
65 spin_lock_init(&kfd
->interrupt_lock
);
67 INIT_WORK(&kfd
->interrupt_work
, interrupt_wq
);
69 kfd
->interrupts_active
= true;
72 * After this function returns, the interrupt will be enabled. This
73 * barrier ensures that the interrupt running on a different processor
74 * sees all the above writes.
81 void kfd_interrupt_exit(struct kfd_dev
*kfd
)
84 * Stop the interrupt handler from writing to the ring and scheduling
85 * workqueue items. The spinlock ensures that any interrupt running
86 * after we have unlocked sees interrupts_active = false.
90 spin_lock_irqsave(&kfd
->interrupt_lock
, flags
);
91 kfd
->interrupts_active
= false;
92 spin_unlock_irqrestore(&kfd
->interrupt_lock
, flags
);
95 * Flush_scheduled_work ensures that there are no outstanding
96 * work-queue items that will access interrupt_ring. New work items
97 * can't be created because we stopped interrupt handling above.
99 flush_scheduled_work();
101 kfree(kfd
->interrupt_ring
);
105 * This assumes that it can't be called concurrently with itself
106 * but only with dequeue_ih_ring_entry.
108 bool enqueue_ih_ring_entry(struct kfd_dev
*kfd
, const void *ih_ring_entry
)
110 unsigned int rptr
= atomic_read(&kfd
->interrupt_ring_rptr
);
111 unsigned int wptr
= atomic_read(&kfd
->interrupt_ring_wptr
);
113 if ((rptr
- wptr
) % kfd
->interrupt_ring_size
==
114 kfd
->device_info
->ih_ring_entry_size
) {
115 /* This is very bad, the system is likely to hang. */
116 dev_err_ratelimited(kfd_chardev(),
117 "Interrupt ring overflow, dropping interrupt.\n");
121 memcpy(kfd
->interrupt_ring
+ wptr
, ih_ring_entry
,
122 kfd
->device_info
->ih_ring_entry_size
);
124 wptr
= (wptr
+ kfd
->device_info
->ih_ring_entry_size
) %
125 kfd
->interrupt_ring_size
;
126 smp_wmb(); /* Ensure memcpy'd data is visible before wptr update. */
127 atomic_set(&kfd
->interrupt_ring_wptr
, wptr
);
133 * This assumes that it can't be called concurrently with itself
134 * but only with enqueue_ih_ring_entry.
136 static bool dequeue_ih_ring_entry(struct kfd_dev
*kfd
, void *ih_ring_entry
)
139 * Assume that wait queues have an implicit barrier, i.e. anything that
140 * happened in the ISR before it queued work is visible.
143 unsigned int wptr
= atomic_read(&kfd
->interrupt_ring_wptr
);
144 unsigned int rptr
= atomic_read(&kfd
->interrupt_ring_rptr
);
149 memcpy(ih_ring_entry
, kfd
->interrupt_ring
+ rptr
,
150 kfd
->device_info
->ih_ring_entry_size
);
152 rptr
= (rptr
+ kfd
->device_info
->ih_ring_entry_size
) %
153 kfd
->interrupt_ring_size
;
156 * Ensure the rptr write update is not visible until
157 * memcpy has finished reading.
160 atomic_set(&kfd
->interrupt_ring_rptr
, rptr
);
165 static void interrupt_wq(struct work_struct
*work
)
167 struct kfd_dev
*dev
= container_of(work
, struct kfd_dev
,
170 uint32_t ih_ring_entry
[DIV_ROUND_UP(
171 dev
->device_info
->ih_ring_entry_size
,
174 while (dequeue_ih_ring_entry(dev
, ih_ring_entry
))
175 dev
->device_info
->event_interrupt_class
->interrupt_wq(dev
,
179 bool interrupt_is_wanted(struct kfd_dev
*dev
, const uint32_t *ih_ring_entry
)
181 /* integer and bitwise OR so there is no boolean short-circuiting */
184 wanted
|= dev
->device_info
->event_interrupt_class
->interrupt_isr(dev
,