This source file includes following definitions.
- drm_sched_entity_init
- drm_sched_entity_is_idle
- drm_sched_entity_is_ready
- drm_sched_entity_get_free_sched
- drm_sched_entity_flush
- drm_sched_entity_kill_jobs_cb
- drm_sched_entity_kill_jobs
- drm_sched_entity_fini
- drm_sched_entity_destroy
- drm_sched_entity_clear_dep
- drm_sched_entity_wakeup
- drm_sched_entity_set_rq_priority
- drm_sched_entity_set_priority
- drm_sched_entity_add_dependency_cb
- drm_sched_entity_pop_job
- drm_sched_entity_select_rq
- drm_sched_entity_push_job
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24 #include <linux/kthread.h>
25 #include <linux/slab.h>
26
27 #include <drm/drm_print.h>
28 #include <drm/gpu_scheduler.h>
29
30 #include "gpu_scheduler_trace.h"
31
32 #define to_drm_sched_job(sched_job) \
33 container_of((sched_job), struct drm_sched_job, queue_node)
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51 int drm_sched_entity_init(struct drm_sched_entity *entity,
52 struct drm_sched_rq **rq_list,
53 unsigned int num_rq_list,
54 atomic_t *guilty)
55 {
56 int i;
57
58 if (!(entity && rq_list && (num_rq_list == 0 || rq_list[0])))
59 return -EINVAL;
60
61 memset(entity, 0, sizeof(struct drm_sched_entity));
62 INIT_LIST_HEAD(&entity->list);
63 entity->rq = NULL;
64 entity->guilty = guilty;
65 entity->num_rq_list = num_rq_list;
66 entity->rq_list = kcalloc(num_rq_list, sizeof(struct drm_sched_rq *),
67 GFP_KERNEL);
68 if (!entity->rq_list)
69 return -ENOMEM;
70
71 for (i = 0; i < num_rq_list; ++i)
72 entity->rq_list[i] = rq_list[i];
73
74 if (num_rq_list)
75 entity->rq = rq_list[0];
76
77 entity->last_scheduled = NULL;
78
79 spin_lock_init(&entity->rq_lock);
80 spsc_queue_init(&entity->job_queue);
81
82 atomic_set(&entity->fence_seq, 0);
83 entity->fence_context = dma_fence_context_alloc(2);
84
85 return 0;
86 }
87 EXPORT_SYMBOL(drm_sched_entity_init);
88
89
90
91
92
93
94
95
96 static bool drm_sched_entity_is_idle(struct drm_sched_entity *entity)
97 {
98 rmb();
99
100 if (list_empty(&entity->list) ||
101 spsc_queue_count(&entity->job_queue) == 0)
102 return true;
103
104 return false;
105 }
106
107
108
109
110
111
112
113
114 bool drm_sched_entity_is_ready(struct drm_sched_entity *entity)
115 {
116 if (spsc_queue_peek(&entity->job_queue) == NULL)
117 return false;
118
119 if (READ_ONCE(entity->dependency))
120 return false;
121
122 return true;
123 }
124
125
126
127
128
129
130
131
132 static struct drm_sched_rq *
133 drm_sched_entity_get_free_sched(struct drm_sched_entity *entity)
134 {
135 struct drm_sched_rq *rq = NULL;
136 unsigned int min_jobs = UINT_MAX, num_jobs;
137 int i;
138
139 for (i = 0; i < entity->num_rq_list; ++i) {
140 struct drm_gpu_scheduler *sched = entity->rq_list[i]->sched;
141
142 if (!entity->rq_list[i]->sched->ready) {
143 DRM_WARN("sched%s is not ready, skipping", sched->name);
144 continue;
145 }
146
147 num_jobs = atomic_read(&sched->num_jobs);
148 if (num_jobs < min_jobs) {
149 min_jobs = num_jobs;
150 rq = entity->rq_list[i];
151 }
152 }
153
154 return rq;
155 }
156
157
158
159
160
161
162
163
164
165
166
167
168
169 long drm_sched_entity_flush(struct drm_sched_entity *entity, long timeout)
170 {
171 struct drm_gpu_scheduler *sched;
172 struct task_struct *last_user;
173 long ret = timeout;
174
175 if (!entity->rq)
176 return 0;
177
178 sched = entity->rq->sched;
179
180
181
182
183 if (current->flags & PF_EXITING) {
184 if (timeout)
185 ret = wait_event_timeout(
186 sched->job_scheduled,
187 drm_sched_entity_is_idle(entity),
188 timeout);
189 } else {
190 wait_event_killable(sched->job_scheduled,
191 drm_sched_entity_is_idle(entity));
192 }
193
194
195 last_user = cmpxchg(&entity->last_user, current->group_leader, NULL);
196 if ((!last_user || last_user == current->group_leader) &&
197 (current->flags & PF_EXITING) && (current->exit_code == SIGKILL)) {
198 spin_lock(&entity->rq_lock);
199 entity->stopped = true;
200 drm_sched_rq_remove_entity(entity->rq, entity);
201 spin_unlock(&entity->rq_lock);
202 }
203
204 return ret;
205 }
206 EXPORT_SYMBOL(drm_sched_entity_flush);
207
208
209
210
211
212
213
214
215
216 static void drm_sched_entity_kill_jobs_cb(struct dma_fence *f,
217 struct dma_fence_cb *cb)
218 {
219 struct drm_sched_job *job = container_of(cb, struct drm_sched_job,
220 finish_cb);
221
222 drm_sched_fence_finished(job->s_fence);
223 WARN_ON(job->s_fence->parent);
224 job->sched->ops->free_job(job);
225 }
226
227
228
229
230
231
232
233
234
235 static void drm_sched_entity_kill_jobs(struct drm_sched_entity *entity)
236 {
237 struct drm_sched_job *job;
238 int r;
239
240 while ((job = to_drm_sched_job(spsc_queue_pop(&entity->job_queue)))) {
241 struct drm_sched_fence *s_fence = job->s_fence;
242
243 drm_sched_fence_scheduled(s_fence);
244 dma_fence_set_error(&s_fence->finished, -ESRCH);
245
246
247
248
249
250
251 if (!entity->last_scheduled) {
252 drm_sched_entity_kill_jobs_cb(NULL, &job->finish_cb);
253 continue;
254 }
255
256 r = dma_fence_add_callback(entity->last_scheduled,
257 &job->finish_cb,
258 drm_sched_entity_kill_jobs_cb);
259 if (r == -ENOENT)
260 drm_sched_entity_kill_jobs_cb(NULL, &job->finish_cb);
261 else if (r)
262 DRM_ERROR("fence add callback failed (%d)\n", r);
263 }
264 }
265
266
267
268
269
270
271
272
273
274
275 void drm_sched_entity_fini(struct drm_sched_entity *entity)
276 {
277 struct drm_gpu_scheduler *sched = NULL;
278
279 if (entity->rq) {
280 sched = entity->rq->sched;
281 drm_sched_rq_remove_entity(entity->rq, entity);
282 }
283
284
285
286
287 if (spsc_queue_count(&entity->job_queue)) {
288 if (sched) {
289
290
291
292 kthread_park(sched->thread);
293 kthread_unpark(sched->thread);
294 }
295 if (entity->dependency) {
296 dma_fence_remove_callback(entity->dependency,
297 &entity->cb);
298 dma_fence_put(entity->dependency);
299 entity->dependency = NULL;
300 }
301
302 drm_sched_entity_kill_jobs(entity);
303 }
304
305 dma_fence_put(entity->last_scheduled);
306 entity->last_scheduled = NULL;
307 kfree(entity->rq_list);
308 }
309 EXPORT_SYMBOL(drm_sched_entity_fini);
310
311
312
313
314
315
316
317
318 void drm_sched_entity_destroy(struct drm_sched_entity *entity)
319 {
320 drm_sched_entity_flush(entity, MAX_WAIT_SCHED_ENTITY_Q_EMPTY);
321 drm_sched_entity_fini(entity);
322 }
323 EXPORT_SYMBOL(drm_sched_entity_destroy);
324
325
326
327
328 static void drm_sched_entity_clear_dep(struct dma_fence *f,
329 struct dma_fence_cb *cb)
330 {
331 struct drm_sched_entity *entity =
332 container_of(cb, struct drm_sched_entity, cb);
333
334 entity->dependency = NULL;
335 dma_fence_put(f);
336 }
337
338
339
340
341
342 static void drm_sched_entity_wakeup(struct dma_fence *f,
343 struct dma_fence_cb *cb)
344 {
345 struct drm_sched_entity *entity =
346 container_of(cb, struct drm_sched_entity, cb);
347
348 drm_sched_entity_clear_dep(f, cb);
349 drm_sched_wakeup(entity->rq->sched);
350 }
351
352
353
354
355 static void drm_sched_entity_set_rq_priority(struct drm_sched_rq **rq,
356 enum drm_sched_priority priority)
357 {
358 *rq = &(*rq)->sched->sched_rq[priority];
359 }
360
361
362
363
364
365
366
367
368
369 void drm_sched_entity_set_priority(struct drm_sched_entity *entity,
370 enum drm_sched_priority priority)
371 {
372 unsigned int i;
373
374 spin_lock(&entity->rq_lock);
375
376 for (i = 0; i < entity->num_rq_list; ++i)
377 drm_sched_entity_set_rq_priority(&entity->rq_list[i], priority);
378
379 if (entity->rq) {
380 drm_sched_rq_remove_entity(entity->rq, entity);
381 drm_sched_entity_set_rq_priority(&entity->rq, priority);
382 drm_sched_rq_add_entity(entity->rq, entity);
383 }
384
385 spin_unlock(&entity->rq_lock);
386 }
387 EXPORT_SYMBOL(drm_sched_entity_set_priority);
388
389
390
391
392
393
394
395
396
397 static bool drm_sched_entity_add_dependency_cb(struct drm_sched_entity *entity)
398 {
399 struct drm_gpu_scheduler *sched = entity->rq->sched;
400 struct dma_fence *fence = entity->dependency;
401 struct drm_sched_fence *s_fence;
402
403 if (fence->context == entity->fence_context ||
404 fence->context == entity->fence_context + 1) {
405
406
407
408
409
410 dma_fence_put(entity->dependency);
411 return false;
412 }
413
414 s_fence = to_drm_sched_fence(fence);
415 if (s_fence && s_fence->sched == sched) {
416
417
418
419
420
421 fence = dma_fence_get(&s_fence->scheduled);
422 dma_fence_put(entity->dependency);
423 entity->dependency = fence;
424 if (!dma_fence_add_callback(fence, &entity->cb,
425 drm_sched_entity_clear_dep))
426 return true;
427
428
429 dma_fence_put(fence);
430 return false;
431 }
432
433 if (!dma_fence_add_callback(entity->dependency, &entity->cb,
434 drm_sched_entity_wakeup))
435 return true;
436
437 dma_fence_put(entity->dependency);
438 return false;
439 }
440
441
442
443
444
445
446
447
448 struct drm_sched_job *drm_sched_entity_pop_job(struct drm_sched_entity *entity)
449 {
450 struct drm_gpu_scheduler *sched = entity->rq->sched;
451 struct drm_sched_job *sched_job;
452
453 sched_job = to_drm_sched_job(spsc_queue_peek(&entity->job_queue));
454 if (!sched_job)
455 return NULL;
456
457 while ((entity->dependency =
458 sched->ops->dependency(sched_job, entity))) {
459 trace_drm_sched_job_wait_dep(sched_job, entity->dependency);
460
461 if (drm_sched_entity_add_dependency_cb(entity))
462 return NULL;
463 }
464
465
466 if (entity->guilty && atomic_read(entity->guilty))
467 dma_fence_set_error(&sched_job->s_fence->finished, -ECANCELED);
468
469 dma_fence_put(entity->last_scheduled);
470 entity->last_scheduled = dma_fence_get(&sched_job->s_fence->finished);
471
472 spsc_queue_pop(&entity->job_queue);
473 return sched_job;
474 }
475
476
477
478
479
480
481
482
483
484 void drm_sched_entity_select_rq(struct drm_sched_entity *entity)
485 {
486 struct dma_fence *fence;
487 struct drm_sched_rq *rq;
488
489 if (spsc_queue_count(&entity->job_queue) || entity->num_rq_list <= 1)
490 return;
491
492 fence = READ_ONCE(entity->last_scheduled);
493 if (fence && !dma_fence_is_signaled(fence))
494 return;
495
496 rq = drm_sched_entity_get_free_sched(entity);
497 if (rq == entity->rq)
498 return;
499
500 spin_lock(&entity->rq_lock);
501 drm_sched_rq_remove_entity(entity->rq, entity);
502 entity->rq = rq;
503 spin_unlock(&entity->rq_lock);
504 }
505
506
507
508
509
510
511
512
513
514
515
516
517
518 void drm_sched_entity_push_job(struct drm_sched_job *sched_job,
519 struct drm_sched_entity *entity)
520 {
521 bool first;
522
523 trace_drm_sched_job(sched_job, entity);
524 atomic_inc(&entity->rq->sched->num_jobs);
525 WRITE_ONCE(entity->last_user, current->group_leader);
526 first = spsc_queue_push(&entity->job_queue, &sched_job->queue_node);
527
528
529 if (first) {
530
531 spin_lock(&entity->rq_lock);
532 if (entity->stopped) {
533 spin_unlock(&entity->rq_lock);
534
535 DRM_ERROR("Trying to push to a killed entity\n");
536 return;
537 }
538 drm_sched_rq_add_entity(entity->rq, entity);
539 spin_unlock(&entity->rq_lock);
540 drm_sched_wakeup(entity->rq->sched);
541 }
542 }
543 EXPORT_SYMBOL(drm_sched_entity_push_job);