1 /*
2 * Copyright 2015 Advanced Micro Devices, Inc.
3 *
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:
10 *
11 * The above copyright notice and this permission notice shall be included in
12 * all copies or substantial portions of the Software.
13 *
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.
21 *
22 */
23
24 #include <linux/kthread.h>
25 #include <linux/module.h>
26 #include <linux/sched.h>
27 #include <linux/slab.h>
28 #include <linux/wait.h>
29
30 #include <drm/gpu_scheduler.h>
31
32 #include <sys/pool.h>
33
34 static struct pool sched_fence_slab;
35
drm_sched_fence_slab_init(void)36 int __init drm_sched_fence_slab_init(void)
37 {
38 #ifdef __linux__
39 sched_fence_slab = KMEM_CACHE(drm_sched_fence, SLAB_HWCACHE_ALIGN);
40 if (!sched_fence_slab)
41 return -ENOMEM;
42 #else
43 pool_init(&sched_fence_slab, sizeof(struct drm_sched_fence),
44 CACHELINESIZE, IPL_TTY, 0, "drm_sched_fence", NULL);
45 #endif
46
47 return 0;
48 }
49
drm_sched_fence_slab_fini(void)50 void __exit drm_sched_fence_slab_fini(void)
51 {
52 rcu_barrier();
53 #ifdef __linux__
54 kmem_cache_destroy(sched_fence_slab);
55 #else
56 pool_destroy(&sched_fence_slab);
57 #endif
58 }
59
drm_sched_fence_set_parent(struct drm_sched_fence * s_fence,struct dma_fence * fence)60 static void drm_sched_fence_set_parent(struct drm_sched_fence *s_fence,
61 struct dma_fence *fence)
62 {
63 /*
64 * smp_store_release() to ensure another thread racing us
65 * in drm_sched_fence_set_deadline_finished() sees the
66 * fence's parent set before test_bit()
67 */
68 smp_store_release(&s_fence->parent, dma_fence_get(fence));
69 if (test_bit(DRM_SCHED_FENCE_FLAG_HAS_DEADLINE_BIT,
70 &s_fence->finished.flags))
71 dma_fence_set_deadline(fence, s_fence->deadline);
72 }
73
drm_sched_fence_scheduled(struct drm_sched_fence * fence,struct dma_fence * parent)74 void drm_sched_fence_scheduled(struct drm_sched_fence *fence,
75 struct dma_fence *parent)
76 {
77 /* Set the parent before signaling the scheduled fence, such that,
78 * any waiter expecting the parent to be filled after the job has
79 * been scheduled (which is the case for drivers delegating waits
80 * to some firmware) doesn't have to busy wait for parent to show
81 * up.
82 */
83 if (!IS_ERR_OR_NULL(parent))
84 drm_sched_fence_set_parent(fence, parent);
85
86 dma_fence_signal(&fence->scheduled);
87 }
88
drm_sched_fence_finished(struct drm_sched_fence * fence,int result)89 void drm_sched_fence_finished(struct drm_sched_fence *fence, int result)
90 {
91 if (result)
92 dma_fence_set_error(&fence->finished, result);
93 dma_fence_signal(&fence->finished);
94 }
95
drm_sched_fence_get_driver_name(struct dma_fence * fence)96 static const char *drm_sched_fence_get_driver_name(struct dma_fence *fence)
97 {
98 return "drm_sched";
99 }
100
drm_sched_fence_get_timeline_name(struct dma_fence * f)101 static const char *drm_sched_fence_get_timeline_name(struct dma_fence *f)
102 {
103 struct drm_sched_fence *fence = to_drm_sched_fence(f);
104 return (const char *)fence->sched->name;
105 }
106
drm_sched_fence_free_rcu(struct rcu_head * rcu)107 static void drm_sched_fence_free_rcu(struct rcu_head *rcu)
108 {
109 struct dma_fence *f = container_of(rcu, struct dma_fence, rcu);
110 struct drm_sched_fence *fence = to_drm_sched_fence(f);
111
112 if (!WARN_ON_ONCE(!fence)) {
113 #ifdef __linux__
114 kmem_cache_free(sched_fence_slab, fence);
115 #else
116 pool_put(&sched_fence_slab, fence);
117 #endif
118 }
119 }
120
121 /**
122 * drm_sched_fence_free - free up an uninitialized fence
123 *
124 * @fence: fence to free
125 *
126 * Free up the fence memory. Should only be used if drm_sched_fence_init()
127 * has not been called yet.
128 */
drm_sched_fence_free(struct drm_sched_fence * fence)129 void drm_sched_fence_free(struct drm_sched_fence *fence)
130 {
131 /* This function should not be called if the fence has been initialized. */
132 if (!WARN_ON_ONCE(fence->sched)) {
133 #ifdef __linux__
134 kmem_cache_free(sched_fence_slab, fence);
135 #else
136 pool_put(&sched_fence_slab, fence);
137 #endif
138 }
139 }
140
141 /**
142 * drm_sched_fence_release_scheduled - callback that fence can be freed
143 *
144 * @f: fence
145 *
146 * This function is called when the reference count becomes zero.
147 * It just RCU schedules freeing up the fence.
148 */
drm_sched_fence_release_scheduled(struct dma_fence * f)149 static void drm_sched_fence_release_scheduled(struct dma_fence *f)
150 {
151 struct drm_sched_fence *fence = to_drm_sched_fence(f);
152
153 dma_fence_put(fence->parent);
154 call_rcu(&fence->finished.rcu, drm_sched_fence_free_rcu);
155 }
156
157 /**
158 * drm_sched_fence_release_finished - drop extra reference
159 *
160 * @f: fence
161 *
162 * Drop the extra reference from the scheduled fence to the base fence.
163 */
drm_sched_fence_release_finished(struct dma_fence * f)164 static void drm_sched_fence_release_finished(struct dma_fence *f)
165 {
166 struct drm_sched_fence *fence = to_drm_sched_fence(f);
167
168 dma_fence_put(&fence->scheduled);
169 }
170
drm_sched_fence_set_deadline_finished(struct dma_fence * f,ktime_t deadline)171 static void drm_sched_fence_set_deadline_finished(struct dma_fence *f,
172 ktime_t deadline)
173 {
174 struct drm_sched_fence *fence = to_drm_sched_fence(f);
175 struct dma_fence *parent;
176 unsigned long flags;
177
178 spin_lock_irqsave(&fence->lock, flags);
179
180 /* If we already have an earlier deadline, keep it: */
181 if (test_bit(DRM_SCHED_FENCE_FLAG_HAS_DEADLINE_BIT, &f->flags) &&
182 ktime_before(fence->deadline, deadline)) {
183 spin_unlock_irqrestore(&fence->lock, flags);
184 return;
185 }
186
187 fence->deadline = deadline;
188 set_bit(DRM_SCHED_FENCE_FLAG_HAS_DEADLINE_BIT, &f->flags);
189
190 spin_unlock_irqrestore(&fence->lock, flags);
191
192 /*
193 * smp_load_aquire() to ensure that if we are racing another
194 * thread calling drm_sched_fence_set_parent(), that we see
195 * the parent set before it calls test_bit(HAS_DEADLINE_BIT)
196 */
197 parent = smp_load_acquire(&fence->parent);
198 if (parent)
199 dma_fence_set_deadline(parent, deadline);
200 }
201
202 static const struct dma_fence_ops drm_sched_fence_ops_scheduled = {
203 .get_driver_name = drm_sched_fence_get_driver_name,
204 .get_timeline_name = drm_sched_fence_get_timeline_name,
205 .release = drm_sched_fence_release_scheduled,
206 };
207
208 static const struct dma_fence_ops drm_sched_fence_ops_finished = {
209 .get_driver_name = drm_sched_fence_get_driver_name,
210 .get_timeline_name = drm_sched_fence_get_timeline_name,
211 .release = drm_sched_fence_release_finished,
212 .set_deadline = drm_sched_fence_set_deadline_finished,
213 };
214
to_drm_sched_fence(struct dma_fence * f)215 struct drm_sched_fence *to_drm_sched_fence(struct dma_fence *f)
216 {
217 if (f->ops == &drm_sched_fence_ops_scheduled)
218 return container_of(f, struct drm_sched_fence, scheduled);
219
220 if (f->ops == &drm_sched_fence_ops_finished)
221 return container_of(f, struct drm_sched_fence, finished);
222
223 return NULL;
224 }
225 EXPORT_SYMBOL(to_drm_sched_fence);
226
drm_sched_fence_alloc(struct drm_sched_entity * entity,void * owner)227 struct drm_sched_fence *drm_sched_fence_alloc(struct drm_sched_entity *entity,
228 void *owner)
229 {
230 struct drm_sched_fence *fence = NULL;
231
232 #ifdef __linux__
233 fence = kmem_cache_zalloc(sched_fence_slab, GFP_KERNEL);
234 #else
235 fence = pool_get(&sched_fence_slab, PR_WAITOK | PR_ZERO);
236 #endif
237 if (fence == NULL)
238 return NULL;
239
240 fence->owner = owner;
241 mtx_init(&fence->lock, IPL_TTY);
242
243 return fence;
244 }
245
drm_sched_fence_init(struct drm_sched_fence * fence,struct drm_sched_entity * entity)246 void drm_sched_fence_init(struct drm_sched_fence *fence,
247 struct drm_sched_entity *entity)
248 {
249 unsigned seq;
250
251 fence->sched = entity->rq->sched;
252 seq = atomic_inc_return(&entity->fence_seq);
253 dma_fence_init(&fence->scheduled, &drm_sched_fence_ops_scheduled,
254 &fence->lock, entity->fence_context, seq);
255 dma_fence_init(&fence->finished, &drm_sched_fence_ops_finished,
256 &fence->lock, entity->fence_context + 1, seq);
257 }
258
259 module_init(drm_sched_fence_slab_init);
260 module_exit(drm_sched_fence_slab_fini);
261
262 MODULE_DESCRIPTION("DRM GPU scheduler");
263 MODULE_LICENSE("GPL and additional rights");
264