gpu_scheduler.c 18.7 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
/*
 * Copyright 2015 Advanced Micro Devices, Inc.
 *
 * Permission is hereby granted, free of charge, to any person obtaining a
 * copy of this software and associated documentation files (the "Software"),
 * to deal in the Software without restriction, including without limitation
 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
 * and/or sell copies of the Software, and to permit persons to whom the
 * Software is furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL
 * THE COPYRIGHT HOLDER(S) OR AUTHOR(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR
 * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
 * OTHER DEALINGS IN THE SOFTWARE.
 *
 *
 */
#include <linux/kthread.h>
#include <linux/wait.h>
#include <linux/sched.h>
27
#include <uapi/linux/sched/types.h>
28 29 30
#include <drm/drmP.h>
#include "gpu_scheduler.h"

31 32
#include "spsc_queue.h"

33 34 35
#define CREATE_TRACE_POINTS
#include "gpu_sched_trace.h"

36 37 38
#define to_amd_sched_job(sched_job)		\
		container_of((sched_job), struct amd_sched_job, queue_node)

39
static bool amd_sched_entity_is_ready(struct amd_sched_entity *entity);
40
static void amd_sched_wakeup(struct amd_gpu_scheduler *sched);
41
static void amd_sched_process_job(struct dma_fence *f, struct dma_fence_cb *cb);
42

43
/* Initialize a given run queue struct */
44
static void amd_sched_rq_init(struct amd_sched_rq *rq)
45
{
46
	spin_lock_init(&rq->lock);
47 48
	INIT_LIST_HEAD(&rq->entities);
	rq->current_entity = NULL;
49 50
}

51 52
static void amd_sched_rq_add_entity(struct amd_sched_rq *rq,
				    struct amd_sched_entity *entity)
53
{
54 55
	if (!list_empty(&entity->list))
		return;
56
	spin_lock(&rq->lock);
57
	list_add_tail(&entity->list, &rq->entities);
58
	spin_unlock(&rq->lock);
59 60
}

61 62
static void amd_sched_rq_remove_entity(struct amd_sched_rq *rq,
				       struct amd_sched_entity *entity)
63
{
64 65
	if (list_empty(&entity->list))
		return;
66
	spin_lock(&rq->lock);
67 68 69
	list_del_init(&entity->list);
	if (rq->current_entity == entity)
		rq->current_entity = NULL;
70
	spin_unlock(&rq->lock);
71 72 73
}

/**
74 75 76 77 78
 * Select an entity which could provide a job to run
 *
 * @rq		The run queue to check.
 *
 * Try to find a ready entity, returns NULL if none found.
79
 */
80 81
static struct amd_sched_entity *
amd_sched_rq_select_entity(struct amd_sched_rq *rq)
82
{
83
	struct amd_sched_entity *entity;
84

85 86 87
	spin_lock(&rq->lock);

	entity = rq->current_entity;
88 89
	if (entity) {
		list_for_each_entry_continue(entity, &rq->entities, list) {
90
			if (amd_sched_entity_is_ready(entity)) {
91
				rq->current_entity = entity;
92
				spin_unlock(&rq->lock);
93
				return entity;
94
			}
95 96 97
		}
	}

98
	list_for_each_entry(entity, &rq->entities, list) {
99

100
		if (amd_sched_entity_is_ready(entity)) {
101
			rq->current_entity = entity;
102
			spin_unlock(&rq->lock);
103
			return entity;
104
		}
105

106 107 108
		if (entity == rq->current_entity)
			break;
	}
109

110 111
	spin_unlock(&rq->lock);

112
	return NULL;
113 114 115 116 117 118
}

/**
 * Init a context entity used by scheduler when submit to HW ring.
 *
 * @sched	The pointer to the scheduler
119
 * @entity	The pointer to a valid amd_sched_entity
120
 * @rq		The run queue this entity belongs
121
 * @kernel	If this is an entity for the kernel
122
 * @jobs	The max number of jobs in the job queue
123 124 125
 *
 * return 0 if succeed. negative error code on failure
*/
126
int amd_sched_entity_init(struct amd_gpu_scheduler *sched,
127
			  struct amd_sched_entity *entity,
128
			  struct amd_sched_rq *rq,
129
			  uint32_t jobs, atomic_t *guilty)
130 131 132 133
{
	if (!(sched && entity && rq))
		return -EINVAL;

134
	memset(entity, 0, sizeof(struct amd_sched_entity));
135 136 137
	INIT_LIST_HEAD(&entity->list);
	entity->rq = rq;
	entity->sched = sched;
138
	entity->guilty = guilty;
139

140
	spin_lock_init(&entity->rq_lock);
141
	spin_lock_init(&entity->queue_lock);
142
	spsc_queue_init(&entity->job_queue);
143

144
	atomic_set(&entity->fence_seq, 0);
145
	entity->fence_context = dma_fence_context_alloc(2);
146 147 148 149 150 151 152 153 154 155 156 157

	return 0;
}

/**
 * Query if entity is initialized
 *
 * @sched       Pointer to scheduler instance
 * @entity	The pointer to a valid scheduler entity
 *
 * return true if entity is initialized, false otherwise
*/
158 159
static bool amd_sched_entity_is_initialized(struct amd_gpu_scheduler *sched,
					    struct amd_sched_entity *entity)
160
{
161 162
	return entity->sched == sched &&
		entity->rq != NULL;
163 164
}

165 166 167 168 169 170 171 172
/**
 * Check if entity is idle
 *
 * @entity	The pointer to a valid scheduler entity
 *
 * Return true if entity don't has any unscheduled jobs.
 */
static bool amd_sched_entity_is_idle(struct amd_sched_entity *entity)
173
{
174
	rmb();
175
	if (spsc_queue_peek(&entity->job_queue) == NULL)
176 177 178 179 180
		return true;

	return false;
}

181 182 183 184 185 186 187 188 189
/**
 * Check if entity is ready
 *
 * @entity	The pointer to a valid scheduler entity
 *
 * Return true if entity could provide a job.
 */
static bool amd_sched_entity_is_ready(struct amd_sched_entity *entity)
{
190
	if (spsc_queue_peek(&entity->job_queue) == NULL)
191 192
		return false;

193
	if (READ_ONCE(entity->dependency))
194 195 196 197 198
		return false;

	return true;
}

199 200 201 202 203 204
/**
 * Destroy a context entity
 *
 * @sched       Pointer to scheduler instance
 * @entity	The pointer to a valid scheduler entity
 *
205
 * Cleanup and free the allocated resources.
206
 */
207 208
void amd_sched_entity_fini(struct amd_gpu_scheduler *sched,
			   struct amd_sched_entity *entity)
209
{
210
	int r;
211

212
	if (!amd_sched_entity_is_initialized(sched, entity))
213
		return;
214 215
	/**
	 * The client will not queue more IBs during this fini, consume existing
216
	 * queued IBs or discard them on SIGKILL
217
	*/
218 219 220 221 222
	if ((current->flags & PF_SIGNALED) && current->exit_code == SIGKILL)
		r = -ERESTARTSYS;
	else
		r = wait_event_killable(sched->job_scheduled,
					amd_sched_entity_is_idle(entity));
223
	amd_sched_entity_set_rq(entity, NULL);
224 225 226 227 228 229 230 231
	if (r) {
		struct amd_sched_job *job;

		/* Park the kernel for a moment to make sure it isn't processing
		 * our enity.
		 */
		kthread_park(sched->thread);
		kthread_unpark(sched->thread);
232
		while ((job = to_amd_sched_job(spsc_queue_pop(&entity->job_queue)))) {
233 234 235 236 237
			struct amd_sched_fence *s_fence = job->s_fence;
			amd_sched_fence_scheduled(s_fence);
			dma_fence_set_error(&s_fence->finished, -ESRCH);
			amd_sched_fence_finished(s_fence);
			dma_fence_put(&s_fence->finished);
238
			sched->ops->free_job(job);
239
		}
240
	}
241 242
}

243
static void amd_sched_entity_wakeup(struct dma_fence *f, struct dma_fence_cb *cb)
244 245 246 247
{
	struct amd_sched_entity *entity =
		container_of(cb, struct amd_sched_entity, cb);
	entity->dependency = NULL;
248
	dma_fence_put(f);
249
	amd_sched_wakeup(entity->sched);
250 251
}

252
static void amd_sched_entity_clear_dep(struct dma_fence *f, struct dma_fence_cb *cb)
253 254 255 256
{
	struct amd_sched_entity *entity =
		container_of(cb, struct amd_sched_entity, cb);
	entity->dependency = NULL;
257
	dma_fence_put(f);
258 259
}

260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277
void amd_sched_entity_set_rq(struct amd_sched_entity *entity,
			     struct amd_sched_rq *rq)
{
	if (entity->rq == rq)
		return;

	spin_lock(&entity->rq_lock);

	if (entity->rq)
		amd_sched_rq_remove_entity(entity->rq, entity);

	entity->rq = rq;
	if (rq)
		amd_sched_rq_add_entity(rq, entity);

	spin_unlock(&entity->rq_lock);
}

C
Chunming Zhou 已提交
278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294
bool amd_sched_dependency_optimized(struct dma_fence* fence,
				    struct amd_sched_entity *entity)
{
	struct amd_gpu_scheduler *sched = entity->sched;
	struct amd_sched_fence *s_fence;

	if (!fence || dma_fence_is_signaled(fence))
		return false;
	if (fence->context == entity->fence_context)
		return true;
	s_fence = to_amd_sched_fence(fence);
	if (s_fence && s_fence->sched == sched)
		return true;

	return false;
}

295 296 297
static bool amd_sched_entity_add_dependency_cb(struct amd_sched_entity *entity)
{
	struct amd_gpu_scheduler *sched = entity->sched;
298
	struct dma_fence * fence = entity->dependency;
299 300 301 302
	struct amd_sched_fence *s_fence;

	if (fence->context == entity->fence_context) {
		/* We can ignore fences from ourself */
303
		dma_fence_put(entity->dependency);
304 305 306 307 308 309
		return false;
	}

	s_fence = to_amd_sched_fence(fence);
	if (s_fence && s_fence->sched == sched) {

310 311 312 313
		/*
		 * Fence is from the same scheduler, only need to wait for
		 * it to be scheduled
		 */
314 315
		fence = dma_fence_get(&s_fence->scheduled);
		dma_fence_put(entity->dependency);
316
		entity->dependency = fence;
317 318
		if (!dma_fence_add_callback(fence, &entity->cb,
					    amd_sched_entity_clear_dep))
319 320 321
			return true;

		/* Ignore it when it is already scheduled */
322
		dma_fence_put(fence);
323
		return false;
324 325
	}

326 327
	if (!dma_fence_add_callback(entity->dependency, &entity->cb,
				    amd_sched_entity_wakeup))
328 329
		return true;

330
	dma_fence_put(entity->dependency);
331 332 333
	return false;
}

334
static struct amd_sched_job *
335
amd_sched_entity_pop_job(struct amd_sched_entity *entity)
336
{
337
	struct amd_gpu_scheduler *sched = entity->sched;
338 339
	struct amd_sched_job *sched_job = to_amd_sched_job(
						spsc_queue_peek(&entity->job_queue));
340

341
	if (!sched_job)
342 343
		return NULL;

344 345
	while ((entity->dependency = sched->ops->dependency(sched_job)))
		if (amd_sched_entity_add_dependency_cb(entity))
346 347
			return NULL;

348 349
	sched_job->s_entity = NULL;
	spsc_queue_pop(&entity->job_queue);
350
	return sched_job;
351 352
}

353
/**
354
 * Submit a job to the job queue
355
 *
356
 * @sched_job		The pointer to job required to submit
357
 *
358
 * Returns 0 for success, negative error code otherwise.
359
 */
360
void amd_sched_entity_push_job(struct amd_sched_job *sched_job)
361
{
362
	struct amd_gpu_scheduler *sched = sched_job->sched;
363
	struct amd_sched_entity *entity = sched_job->s_entity;
364
	bool first = false;
365

366
	trace_amd_sched_job(sched_job);
367

368 369
	spin_lock(&entity->queue_lock);
	first = spsc_queue_push(&entity->job_queue, &sched_job->queue_node);
370 371 372 373

	spin_unlock(&entity->queue_lock);

	/* first job wakes up scheduler */
374 375
	if (first) {
		/* Add the entity to the run queue */
376
		spin_lock(&entity->rq_lock);
377
		amd_sched_rq_add_entity(entity->rq, entity);
378
		spin_unlock(&entity->rq_lock);
379
		amd_sched_wakeup(sched);
380
	}
381 382
}

383
/* job_finish is called after hw fence signaled
384
 */
385
static void amd_sched_job_finish(struct work_struct *work)
386
{
387 388
	struct amd_sched_job *s_job = container_of(work, struct amd_sched_job,
						   finish_work);
389 390
	struct amd_gpu_scheduler *sched = s_job->sched;

391
	/* remove job from ring_mirror_list */
392
	spin_lock(&sched->job_list_lock);
393
	list_del_init(&s_job->node);
394
	if (sched->timeout != MAX_SCHEDULE_TIMEOUT) {
395 396
		struct amd_sched_job *next;

397
		spin_unlock(&sched->job_list_lock);
398
		cancel_delayed_work_sync(&s_job->work_tdr);
399
		spin_lock(&sched->job_list_lock);
400 401 402 403 404

		/* queue TDR for next job */
		next = list_first_entry_or_null(&sched->ring_mirror_list,
						struct amd_sched_job, node);

405
		if (next)
406 407
			schedule_delayed_work(&next->work_tdr, sched->timeout);
	}
408
	spin_unlock(&sched->job_list_lock);
409
	dma_fence_put(&s_job->s_fence->finished);
410 411 412
	sched->ops->free_job(s_job);
}

413 414
static void amd_sched_job_finish_cb(struct dma_fence *f,
				    struct dma_fence_cb *cb)
415 416 417 418
{
	struct amd_sched_job *job = container_of(cb, struct amd_sched_job,
						 finish_cb);
	schedule_work(&job->finish_work);
419 420
}

421
static void amd_sched_job_begin(struct amd_sched_job *s_job)
422 423 424
{
	struct amd_gpu_scheduler *sched = s_job->sched;

425 426 427
	dma_fence_add_callback(&s_job->s_fence->finished, &s_job->finish_cb,
			       amd_sched_job_finish_cb);

428
	spin_lock(&sched->job_list_lock);
429
	list_add_tail(&s_job->node, &sched->ring_mirror_list);
430
	if (sched->timeout != MAX_SCHEDULE_TIMEOUT &&
431 432
	    list_first_entry_or_null(&sched->ring_mirror_list,
				     struct amd_sched_job, node) == s_job)
433
		schedule_delayed_work(&s_job->work_tdr, sched->timeout);
434
	spin_unlock(&sched->job_list_lock);
435 436
}

437 438 439 440 441 442 443 444
static void amd_sched_job_timedout(struct work_struct *work)
{
	struct amd_sched_job *job = container_of(work, struct amd_sched_job,
						 work_tdr.work);

	job->sched->ops->timedout_job(job);
}

445 446 447 448 449 450 451 452
static void amd_sched_set_guilty(struct amd_sched_job *s_job)
{
	if (atomic_inc_return(&s_job->karma) > s_job->sched->hang_limit)
		if (s_job->s_entity->guilty)
			atomic_set(s_job->s_entity->guilty, 1);
}

void amd_sched_hw_job_reset(struct amd_gpu_scheduler *sched, struct amd_sched_job *bad)
453 454
{
	struct amd_sched_job *s_job;
455 456
	struct amd_sched_entity *entity, *tmp;
	int i;;
457 458 459

	spin_lock(&sched->job_list_lock);
	list_for_each_entry_reverse(s_job, &sched->ring_mirror_list, node) {
460 461 462
		if (s_job->s_fence->parent &&
		    dma_fence_remove_callback(s_job->s_fence->parent,
					      &s_job->s_fence->cb)) {
463
			dma_fence_put(s_job->s_fence->parent);
464
			s_job->s_fence->parent = NULL;
465
			atomic_dec(&sched->hw_rq_count);
466 467
		}
	}
468
	spin_unlock(&sched->job_list_lock);
469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488

	if (bad) {
		bool found = false;

		for (i = AMD_SCHED_PRIORITY_MIN; i < AMD_SCHED_PRIORITY_MAX; i++ ) {
			struct amd_sched_rq *rq = &sched->sched_rq[i];

			spin_lock(&rq->lock);
			list_for_each_entry_safe(entity, tmp, &rq->entities, list) {
				if (bad->s_fence->scheduled.context == entity->fence_context) {
					found = true;
					amd_sched_set_guilty(bad);
					break;
				}
			}
			spin_unlock(&rq->lock);
			if (found)
				break;
		}
	}
489 490 491 492 493 494 495 496
}

void amd_sched_job_kickout(struct amd_sched_job *s_job)
{
	struct amd_gpu_scheduler *sched = s_job->sched;

	spin_lock(&sched->job_list_lock);
	list_del_init(&s_job->node);
497 498 499
	spin_unlock(&sched->job_list_lock);
}

500 501
void amd_sched_job_recovery(struct amd_gpu_scheduler *sched)
{
502
	struct amd_sched_job *s_job, *tmp;
503 504 505 506 507
	int r;

	spin_lock(&sched->job_list_lock);
	s_job = list_first_entry_or_null(&sched->ring_mirror_list,
					 struct amd_sched_job, node);
508
	if (s_job && sched->timeout != MAX_SCHEDULE_TIMEOUT)
509 510
		schedule_delayed_work(&s_job->work_tdr, sched->timeout);

511
	list_for_each_entry_safe(s_job, tmp, &sched->ring_mirror_list, node) {
512
		struct amd_sched_fence *s_fence = s_job->s_fence;
513
		struct dma_fence *fence;
514

515 516
		spin_unlock(&sched->job_list_lock);
		fence = sched->ops->run_job(s_job);
517
		atomic_inc(&sched->hw_rq_count);
518
		if (fence) {
519 520 521
			s_fence->parent = dma_fence_get(fence);
			r = dma_fence_add_callback(fence, &s_fence->cb,
						   amd_sched_process_job);
522 523 524 525 526
			if (r == -ENOENT)
				amd_sched_process_job(fence, &s_fence->cb);
			else if (r)
				DRM_ERROR("fence add callback failed (%d)\n",
					  r);
527
			dma_fence_put(fence);
528 529 530 531
		} else {
			DRM_ERROR("Failed to run job!\n");
			amd_sched_process_job(NULL, &s_fence->cb);
		}
532
		spin_lock(&sched->job_list_lock);
533 534 535 536
	}
	spin_unlock(&sched->job_list_lock);
}

537 538
/* init a sched_job with basic field */
int amd_sched_job_init(struct amd_sched_job *job,
539 540
		       struct amd_gpu_scheduler *sched,
		       struct amd_sched_entity *entity,
541
		       void *owner)
542 543 544
{
	job->sched = sched;
	job->s_entity = entity;
545
	job->s_priority = entity->rq - sched->sched_rq;
546 547 548
	job->s_fence = amd_sched_fence_create(entity, owner);
	if (!job->s_fence)
		return -ENOMEM;
549
	job->id = atomic64_inc_return(&sched->job_id_count);
550

551 552
	INIT_WORK(&job->finish_work, amd_sched_job_finish);
	INIT_LIST_HEAD(&job->node);
553
	INIT_DELAYED_WORK(&job->work_tdr, amd_sched_job_timedout);
554

555 556 557
	return 0;
}

558 559 560 561 562 563 564 565 566
/**
 * Return ture if we can push more jobs to the hw.
 */
static bool amd_sched_ready(struct amd_gpu_scheduler *sched)
{
	return atomic_read(&sched->hw_rq_count) <
		sched->hw_submission_limit;
}

567 568 569 570 571 572
/**
 * Wake up the scheduler when it is ready
 */
static void amd_sched_wakeup(struct amd_gpu_scheduler *sched)
{
	if (amd_sched_ready(sched))
573
		wake_up_interruptible(&sched->wake_up_worker);
574 575
}

576
/**
577
 * Select next entity to process
578
*/
579 580
static struct amd_sched_entity *
amd_sched_select_entity(struct amd_gpu_scheduler *sched)
581
{
582
	struct amd_sched_entity *entity;
583
	int i;
584 585 586 587 588

	if (!amd_sched_ready(sched))
		return NULL;

	/* Kernel run queue has higher priority than normal run queue*/
589
	for (i = AMD_SCHED_PRIORITY_MAX - 1; i >= AMD_SCHED_PRIORITY_MIN; i--) {
590 591 592 593
		entity = amd_sched_rq_select_entity(&sched->sched_rq[i]);
		if (entity)
			break;
	}
594

595
	return entity;
596 597
}

598
static void amd_sched_process_job(struct dma_fence *f, struct dma_fence_cb *cb)
599
{
600 601
	struct amd_sched_fence *s_fence =
		container_of(cb, struct amd_sched_fence, cb);
602
	struct amd_gpu_scheduler *sched = s_fence->sched;
603

604
	dma_fence_get(&s_fence->finished);
605
	atomic_dec(&sched->hw_rq_count);
606
	amd_sched_fence_finished(s_fence);
M
Monk Liu 已提交
607

608
	trace_amd_sched_process_job(s_fence);
609
	dma_fence_put(&s_fence->finished);
610
	wake_up_interruptible(&sched->wake_up_worker);
611 612
}

613 614 615 616 617 618 619 620 621 622
static bool amd_sched_blocked(struct amd_gpu_scheduler *sched)
{
	if (kthread_should_park()) {
		kthread_parkme();
		return true;
	}

	return false;
}

623 624 625 626
static int amd_sched_main(void *param)
{
	struct sched_param sparam = {.sched_priority = 1};
	struct amd_gpu_scheduler *sched = (struct amd_gpu_scheduler *)param;
627
	int r;
628 629 630 631

	sched_setscheduler(current, SCHED_FIFO, &sparam);

	while (!kthread_should_stop()) {
632
		struct amd_sched_entity *entity = NULL;
633
		struct amd_sched_fence *s_fence;
634
		struct amd_sched_job *sched_job;
635
		struct dma_fence *fence;
636

637
		wait_event_interruptible(sched->wake_up_worker,
638 639 640
					 (!amd_sched_blocked(sched) &&
					  (entity = amd_sched_select_entity(sched))) ||
					 kthread_should_stop());
641

642 643 644
		if (!entity)
			continue;

645
		sched_job = amd_sched_entity_pop_job(entity);
646
		if (!sched_job)
647 648
			continue;

649
		s_fence = sched_job->s_fence;
650

651
		atomic_inc(&sched->hw_rq_count);
652 653
		amd_sched_job_begin(sched_job);

654
		fence = sched->ops->run_job(sched_job);
655
		amd_sched_fence_scheduled(s_fence);
656

657
		if (fence) {
658 659 660
			s_fence->parent = dma_fence_get(fence);
			r = dma_fence_add_callback(fence, &s_fence->cb,
						   amd_sched_process_job);
661
			if (r == -ENOENT)
662
				amd_sched_process_job(fence, &s_fence->cb);
663
			else if (r)
664 665
				DRM_ERROR("fence add callback failed (%d)\n",
					  r);
666
			dma_fence_put(fence);
667 668
		} else {
			DRM_ERROR("Failed to run job!\n");
669
			amd_sched_process_job(NULL, &s_fence->cb);
670
		}
671

672
		wake_up(&sched->job_scheduled);
673 674 675 676 677
	}
	return 0;
}

/**
678
 * Init a gpu scheduler instance
679
 *
680
 * @sched		The pointer to the scheduler
681 682
 * @ops			The backend operations for this scheduler.
 * @hw_submissions	Number of hw submissions to do.
683
 * @name		Name used for debugging
684
 *
685
 * Return 0 on success, otherwise error code.
686
*/
687
int amd_sched_init(struct amd_gpu_scheduler *sched,
688
		   const struct amd_sched_backend_ops *ops,
M
Monk Liu 已提交
689 690 691 692
		   unsigned hw_submission,
		   unsigned hang_limit,
		   long timeout,
		   const char *name)
693
{
694
	int i;
695
	sched->ops = ops;
696
	sched->hw_submission_limit = hw_submission;
697
	sched->name = name;
698
	sched->timeout = timeout;
M
Monk Liu 已提交
699
	sched->hang_limit = hang_limit;
700
	for (i = AMD_SCHED_PRIORITY_MIN; i < AMD_SCHED_PRIORITY_MAX; i++)
701
		amd_sched_rq_init(&sched->sched_rq[i]);
702

703 704
	init_waitqueue_head(&sched->wake_up_worker);
	init_waitqueue_head(&sched->job_scheduled);
705 706
	INIT_LIST_HEAD(&sched->ring_mirror_list);
	spin_lock_init(&sched->job_list_lock);
707
	atomic_set(&sched->hw_rq_count, 0);
708
	atomic64_set(&sched->job_id_count, 0);
709

710
	/* Each scheduler will run on a seperate kernel thread */
711
	sched->thread = kthread_run(amd_sched_main, sched, sched->name);
712
	if (IS_ERR(sched->thread)) {
713 714
		DRM_ERROR("Failed to create scheduler for %s.\n", name);
		return PTR_ERR(sched->thread);
715 716
	}

717
	return 0;
718 719 720 721 722 723 724
}

/**
 * Destroy a gpu scheduler
 *
 * @sched	The pointer to the scheduler
 */
725
void amd_sched_fini(struct amd_gpu_scheduler *sched)
726
{
727 728
	if (sched->thread)
		kthread_stop(sched->thread);
729
}