gpu_scheduler.c 10.6 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 27 28 29 30
/*
 * 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>
#include <drm/drmP.h>
#include "gpu_scheduler.h"

/* Initialize a given run queue struct */
31
static void amd_sched_rq_init(struct amd_sched_rq *rq)
32
{
33
	spin_lock_init(&rq->lock);
34 35
	INIT_LIST_HEAD(&rq->entities);
	rq->current_entity = NULL;
36 37
}

38 39
static void amd_sched_rq_add_entity(struct amd_sched_rq *rq,
				    struct amd_sched_entity *entity)
40
{
41
	spin_lock(&rq->lock);
42
	list_add_tail(&entity->list, &rq->entities);
43
	spin_unlock(&rq->lock);
44 45
}

46 47
static void amd_sched_rq_remove_entity(struct amd_sched_rq *rq,
				       struct amd_sched_entity *entity)
48
{
49
	spin_lock(&rq->lock);
50 51 52
	list_del_init(&entity->list);
	if (rq->current_entity == entity)
		rq->current_entity = NULL;
53
	spin_unlock(&rq->lock);
54 55 56 57 58 59 60
}

/**
 * Select next entity from a specified run queue with round robin policy.
 * It could return the same entity as current one if current is the only
 * available one in the queue. Return NULL if nothing available.
 */
61 62
static struct amd_sched_entity *
amd_sched_rq_select_entity(struct amd_sched_rq *rq)
63
{
64
	struct amd_sched_entity *entity;
65

66 67 68
	spin_lock(&rq->lock);

	entity = rq->current_entity;
69 70 71 72
	if (entity) {
		list_for_each_entry_continue(entity, &rq->entities, list) {
			if (!kfifo_is_empty(&entity->job_queue)) {
				rq->current_entity = entity;
73
				spin_unlock(&rq->lock);
74 75
				return rq->current_entity;
			}
76 77 78
		}
	}

79
	list_for_each_entry(entity, &rq->entities, list) {
80

81 82
		if (!kfifo_is_empty(&entity->job_queue)) {
			rq->current_entity = entity;
83
			spin_unlock(&rq->lock);
84 85
			return rq->current_entity;
		}
86

87 88 89
		if (entity == rq->current_entity)
			break;
	}
90

91 92
	spin_unlock(&rq->lock);

93
	return NULL;
94 95 96
}

/**
97 98 99
 * Return ture if we can push more jobs to the hw.
 */
static bool amd_sched_ready(struct amd_gpu_scheduler *sched)
100
{
101 102
	return atomic_read(&sched->hw_rq_count) <
		sched->hw_submission_limit;
103 104 105 106 107
}

/**
 * Select next entity containing real IB submissions
*/
108
static struct amd_sched_entity *
109
select_context(struct amd_gpu_scheduler *sched)
110
{
111 112
	struct amd_sched_entity *wake_entity = NULL;
	struct amd_sched_entity *tmp;
113

114
	if (!amd_sched_ready(sched))
115 116 117
		return NULL;

	/* Kernel run queue has higher priority than normal run queue*/
118 119 120 121
	tmp = amd_sched_rq_select_entity(&sched->kernel_rq);
	if (tmp == NULL)
		tmp = amd_sched_rq_select_entity(&sched->sched_rq);

122 123 124
	if (sched->current_entity && (sched->current_entity != tmp))
		wake_entity = sched->current_entity;
	sched->current_entity = tmp;
125
	if (wake_entity && wake_entity->need_wakeup)
126 127 128 129 130 131 132 133
		wake_up(&wake_entity->wait_queue);
	return tmp;
}

/**
 * Init a context entity used by scheduler when submit to HW ring.
 *
 * @sched	The pointer to the scheduler
134
 * @entity	The pointer to a valid amd_sched_entity
135
 * @rq		The run queue this entity belongs
136
 * @kernel	If this is an entity for the kernel
137
 * @jobs	The max number of jobs in the job queue
138 139 140
 *
 * return 0 if succeed. negative error code on failure
*/
141
int amd_sched_entity_init(struct amd_gpu_scheduler *sched,
142
			  struct amd_sched_entity *entity,
143
			  struct amd_sched_rq *rq,
144
			  uint32_t jobs)
145
{
146
	char name[20];
147 148 149 150

	if (!(sched && entity && rq))
		return -EINVAL;

151 152
	memset(entity, 0, sizeof(struct amd_sched_entity));
	entity->belongto_rq = rq;
153 154
	entity->scheduler = sched;
	init_waitqueue_head(&entity->wait_queue);
155 156 157
	entity->fence_context = fence_context_alloc(1);
	snprintf(name, sizeof(name), "c_entity[%llu]", entity->fence_context);
	memcpy(entity->name, name, 20);
158
	entity->need_wakeup = false;
159
	if(kfifo_alloc(&entity->job_queue,
160
		       jobs * sizeof(void *),
161 162 163 164
		       GFP_KERNEL))
		return -EINVAL;

	spin_lock_init(&entity->queue_lock);
165
	atomic_set(&entity->fence_seq, 0);
166 167

	/* Add the entity to the run queue */
168
	amd_sched_rq_add_entity(rq, entity);
169 170 171 172 173 174 175 176 177 178 179 180
	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
*/
static bool is_context_entity_initialized(struct amd_gpu_scheduler *sched,
181
					  struct amd_sched_entity *entity)
182 183
{
	return entity->scheduler == sched &&
184
		entity->belongto_rq != NULL;
185 186 187
}

static bool is_context_entity_idle(struct amd_gpu_scheduler *sched,
188
				   struct amd_sched_entity *entity)
189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209
{
	/**
	 * Idle means no pending IBs, and the entity is not
	 * currently being used.
	*/
	barrier();
	if ((sched->current_entity != entity) &&
	    kfifo_is_empty(&entity->job_queue))
		return true;

	return false;
}

/**
 * Destroy a context entity
 *
 * @sched       Pointer to scheduler instance
 * @entity	The pointer to a valid scheduler entity
 *
 * return 0 if succeed. negative error code on failure
 */
210 211
int amd_sched_entity_fini(struct amd_gpu_scheduler *sched,
			    struct amd_sched_entity *entity)
212 213
{
	int r = 0;
214
	struct amd_sched_rq *rq = entity->belongto_rq;
215 216 217

	if (!is_context_entity_initialized(sched, entity))
		return 0;
218
	entity->need_wakeup = true;
219 220 221 222 223 224 225 226 227 228
	/**
	 * The client will not queue more IBs during this fini, consume existing
	 * queued IBs
	*/
	r = wait_event_timeout(
		entity->wait_queue,
		is_context_entity_idle(sched, entity),
		msecs_to_jiffies(AMD_GPU_WAIT_IDLE_TIMEOUT_IN_MS)
		) ?  0 : -1;

229 230 231
	if (r)
		DRM_INFO("Entity %p is in waiting state during fini\n",
			 entity);
232

233
	amd_sched_rq_remove_entity(rq, entity);
234 235 236 237 238 239 240 241
	kfifo_free(&entity->job_queue);
	return r;
}

/**
 * Submit a normal job to the job queue
 *
 * @sched	The pointer to the scheduler
242
 * @c_entity    The pointer to amd_sched_entity
243
 * @job		The pointer to job required to submit
244 245 246 247
 * return 0 if succeed. -1 if failed.
 *        -2 indicate queue is full for this client, client should wait untill
 *	     scheduler consum some queued command.
 *	  -1 other fail.
248
*/
249
int amd_sched_push_job(struct amd_sched_job *sched_job)
250
{
251 252
	struct amd_sched_fence 	*fence =
		amd_sched_fence_create(sched_job->s_entity);
253 254
	if (!fence)
		return -EINVAL;
255 256 257 258 259 260
	fence_get(&fence->base);
	sched_job->s_fence = fence;
	while (kfifo_in_spinlocked(&sched_job->s_entity->job_queue,
				   &sched_job, sizeof(void *),
				   &sched_job->s_entity->queue_lock) !=
	       sizeof(void *)) {
261 262 263 264 265 266
		/**
		 * Current context used up all its IB slots
		 * wait here, or need to check whether GPU is hung
		*/
		schedule();
	}
267
	/* first job wake up scheduler */
268 269
	if ((kfifo_len(&sched_job->s_entity->job_queue) / sizeof(void *)) == 1)
		wake_up_interruptible(&sched_job->sched->wait_queue);
270
	return 0;
271 272
}

273 274 275 276 277 278 279
static void amd_sched_process_job(struct fence *f, struct fence_cb *cb)
{
	struct amd_sched_job *sched_job =
		container_of(cb, struct amd_sched_job, cb);
	struct amd_gpu_scheduler *sched;

	sched = sched_job->sched;
280
	amd_sched_fence_signal(sched_job->s_fence);
281
	atomic_dec(&sched->hw_rq_count);
282
	fence_put(&sched_job->s_fence->base);
283
	sched->ops->process_job(sched, sched_job);
284 285 286
	wake_up_interruptible(&sched->wait_queue);
}

287 288 289
static int amd_sched_main(void *param)
{
	int r;
290
	struct amd_sched_job *job;
291
	struct sched_param sparam = {.sched_priority = 1};
292
	struct amd_sched_entity *c_entity = NULL;
293 294 295 296 297
	struct amd_gpu_scheduler *sched = (struct amd_gpu_scheduler *)param;

	sched_setscheduler(current, SCHED_FIFO, &sparam);

	while (!kthread_should_stop()) {
298 299
		struct fence *fence;

300
		wait_event_interruptible(sched->wait_queue,
301
					 amd_sched_ready(sched) &&
302 303 304 305
					 (c_entity = select_context(sched)));
		r = kfifo_out(&c_entity->job_queue, &job, sizeof(void *));
		if (r != sizeof(void *))
			continue;
306 307 308
		r = 0;
		if (sched->ops->prepare_job)
			r = sched->ops->prepare_job(sched, c_entity, job);
309
		if (!r) {
310
			atomic_inc(&sched->hw_rq_count);
311
		}
312
		mutex_lock(&sched->sched_lock);
313
		fence = sched->ops->run_job(sched, c_entity, job);
314
		if (fence) {
315
			r = fence_add_callback(fence, &job->cb,
316 317
					       amd_sched_process_job);
			if (r == -ENOENT)
318
				amd_sched_process_job(fence, &job->cb);
319 320 321 322
			else if (r)
				DRM_ERROR("fence add callback failed (%d)\n", r);
			fence_put(fence);
		}
323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342
		mutex_unlock(&sched->sched_lock);
	}
	return 0;
}

/**
 * Create a gpu scheduler
 *
 * @device	The device context for this scheduler
 * @ops		The backend operations for this scheduler.
 * @id	        The scheduler is per ring, here is ring id.
 * @granularity	The minumum ms unit the scheduler will scheduled.
 * @preemption  Indicate whether this ring support preemption, 0 is no.
 *
 * return the pointer to scheduler for success, otherwise return NULL
*/
struct amd_gpu_scheduler *amd_sched_create(void *device,
					   struct amd_sched_backend_ops *ops,
					   unsigned ring,
					   unsigned granularity,
343 344
					   unsigned preemption,
					   unsigned hw_submission)
345 346
{
	struct amd_gpu_scheduler *sched;
347
	char name[20];
348 349 350 351 352 353 354 355 356 357

	sched = kzalloc(sizeof(struct amd_gpu_scheduler), GFP_KERNEL);
	if (!sched)
		return NULL;

	sched->device = device;
	sched->ops = ops;
	sched->granularity = granularity;
	sched->ring_id = ring;
	sched->preemption = preemption;
358
	sched->hw_submission_limit = hw_submission;
359 360
	snprintf(name, sizeof(name), "gpu_sched[%d]", ring);
	mutex_init(&sched->sched_lock);
361 362
	amd_sched_rq_init(&sched->sched_rq);
	amd_sched_rq_init(&sched->kernel_rq);
363 364

	init_waitqueue_head(&sched->wait_queue);
365
	atomic_set(&sched->hw_rq_count, 0);
366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390
	/* Each scheduler will run on a seperate kernel thread */
	sched->thread = kthread_create(amd_sched_main, sched, name);
	if (sched->thread) {
		wake_up_process(sched->thread);
		return sched;
	}

	DRM_ERROR("Failed to create scheduler for id %d.\n", ring);
	kfree(sched);
	return NULL;
}

/**
 * Destroy a gpu scheduler
 *
 * @sched	The pointer to the scheduler
 *
 * return 0 if succeed. -1 if failed.
 */
int amd_sched_destroy(struct amd_gpu_scheduler *sched)
{
	kthread_stop(sched->thread);
	kfree(sched);
	return  0;
}