i915_request.h 13.6 KB
Newer Older
1
/*
2
 * Copyright © 2008-2018 Intel Corporation
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
 *
 * 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 (including the next
 * paragraph) 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 AUTHORS OR COPYRIGHT HOLDERS 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.
 *
 */

25 26
#ifndef I915_REQUEST_H
#define I915_REQUEST_H
27

28
#include <linux/dma-fence.h>
29
#include <linux/lockdep.h>
30 31

#include "i915_gem.h"
32
#include "i915_scheduler.h"
33
#include "i915_selftest.h"
34
#include "i915_sw_fence.h"
35

36 37
#include <uapi/drm/i915_drm.h>

J
Joonas Lahtinen 已提交
38 39
struct drm_file;
struct drm_i915_gem_object;
40
struct i915_request;
41
struct i915_timeline;
42
struct i915_timeline_cacheline;
J
Joonas Lahtinen 已提交
43

44 45
struct i915_capture_list {
	struct i915_capture_list *next;
46 47 48
	struct i915_vma *vma;
};

49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71
enum {
	/*
	 * I915_FENCE_FLAG_ACTIVE - this request is currently submitted to HW.
	 *
	 * Set by __i915_request_submit() on handing over to HW, and cleared
	 * by __i915_request_unsubmit() if we preempt this request.
	 *
	 * Finally cleared for consistency on retiring the request, when
	 * we know the HW is no longer running this request.
	 *
	 * See i915_request_is_active()
	 */
	I915_FENCE_FLAG_ACTIVE = DMA_FENCE_FLAG_USER_BITS,

	/*
	 * I915_FENCE_FLAG_SIGNAL - this request is currently on signal_list
	 *
	 * Internal bookkeeping used by the breadcrumb code to track when
	 * a request is on the various signal_list.
	 */
	I915_FENCE_FLAG_SIGNAL,
};

72 73 74 75 76 77 78 79 80 81 82
/**
 * Request queue structure.
 *
 * The request queue allows us to note sequence numbers that have been emitted
 * and may be associated with active buffers to be retired.
 *
 * By keeping this list, we can avoid having to do questionable sequence
 * number comparisons on buffer last_read|write_seqno. It also allows an
 * emission time to be associated with the request for tracking how far ahead
 * of the GPU the submission is.
 *
83 84 85 86 87 88 89
 * When modifying this structure be very aware that we perform a lockless
 * RCU lookup of it that may race against reallocation of the struct
 * from the slab freelist. We intentionally do not zero the structure on
 * allocation so that the lookup can use the dangling pointers (and is
 * cogniscent that those pointers may be wrong). Instead, everything that
 * needs to be initialised must be done so explicitly.
 *
90
 * The requests are reference counted.
91
 */
92
struct i915_request {
93
	struct dma_fence fence;
94
	spinlock_t lock;
95 96 97 98 99 100 101 102 103 104 105

	/** On Which ring this request was generated */
	struct drm_i915_private *i915;

	/**
	 * Context and ring buffer related to this request
	 * Contexts are refcounted, so when this request is associated with a
	 * context, we must increment the context's refcount, to guarantee that
	 * it persists while any request is linked to it. Requests themselves
	 * are also refcounted, so the request will only be freed when the last
	 * reference to it is dismissed, and the code in
106
	 * i915_request_free() will then decrement the refcount on the
107 108
	 * context.
	 */
C
Chris Wilson 已提交
109
	struct i915_gem_context *gem_context;
110
	struct intel_engine_cs *engine;
111
	struct intel_context *hw_context;
112
	struct intel_ring *ring;
113
	struct i915_timeline *timeline;
114
	struct list_head signal_link;
115

116 117 118 119 120 121 122 123
	/*
	 * The rcu epoch of when this request was allocated. Used to judiciously
	 * apply backpressure on future allocations to ensure that under
	 * mempressure there is sufficient RCU ticks for us to reclaim our
	 * RCU protected slabs.
	 */
	unsigned long rcustate;

124 125 126 127 128 129 130 131 132
	/*
	 * We pin the timeline->mutex while constructing the request to
	 * ensure that no caller accidentally drops it during construction.
	 * The timeline->mutex must be held to ensure that only this caller
	 * can use the ring and manipulate the associated timeline during
	 * construction.
	 */
	struct pin_cookie cookie;

133 134
	/*
	 * Fences for the various phases in the request's lifetime.
135 136 137 138 139
	 *
	 * The submit fence is used to await upon all of the request's
	 * dependencies. When it is signaled, the request is ready to run.
	 * It is used by the driver to then queue the request for execution.
	 */
140
	struct i915_sw_fence submit;
141 142 143 144
	union {
		wait_queue_entry_t submitq;
		struct i915_sw_dma_fence_cb dmaq;
	};
145
	struct list_head execute_cb;
146
	struct i915_sw_fence semaphore;
147

148 149
	/*
	 * A list of everyone we wait upon, and everyone who waits upon us.
150 151 152 153 154 155 156
	 * Even though we will not be submitted to the hardware before the
	 * submit fence is signaled (it waits for all external events as well
	 * as our own requests), the scheduler still needs to know the
	 * dependency tree for the lifetime of the request (from execbuf
	 * to retirement), i.e. bidirectional dependency information for the
	 * request not tied to individual fences.
	 */
157
	struct i915_sched_node sched;
158 159
	struct i915_dependency dep;

160 161 162 163 164 165 166
	/*
	 * A convenience pointer to the current breadcrumb value stored in
	 * the HW status page (or our timeline's local equivalent). The full
	 * path would be rq->hw_context->ring->timeline->hwsp_seqno.
	 */
	const u32 *hwsp_seqno;

167 168 169 170 171 172 173 174 175 176
	/*
	 * If we need to access the timeline's seqno for this request in
	 * another request, we need to keep a read reference to this associated
	 * cacheline, so that we do not free and recycle it before the foreign
	 * observers have completed. Hence, we keep a pointer to the cacheline
	 * inside the timeline's HWSP vma, but it is only valid while this
	 * request has not completed and guarded by the timeline mutex.
	 */
	struct i915_timeline_cacheline *hwsp_cacheline;

177
	/** Position in the ring of the start of the request */
178 179
	u32 head;

180 181 182
	/** Position in the ring of the start of the user packets */
	u32 infix;

183
	/**
184 185 186
	 * Position in the ring of the start of the postfix.
	 * This is required to calculate the maximum available ring space
	 * without overwriting the postfix.
187 188 189
	 */
	u32 postfix;

190
	/** Position in the ring of the end of the whole request */
191 192
	u32 tail;

193 194 195 196
	/** Position in the ring of the end of any workarounds after the tail */
	u32 wa_tail;

	/** Preallocate space in the ring for the emitting the request */
197 198 199 200 201
	u32 reserved_space;

	/** Batch buffer related to this request if any (used for
	 * error state dump only).
	 */
C
Chris Wilson 已提交
202
	struct i915_vma *batch;
203 204
	/**
	 * Additional buffers requested by userspace to be captured upon
205 206 207 208
	 * a GPU hang. The vma/obj on this list are protected by their
	 * active reference - all objects on this list must also be
	 * on the active_list (of their final request).
	 */
209
	struct i915_capture_list *capture_list;
210
	struct list_head active_list;
211 212 213 214

	/** Time at which this request was emitted, in jiffies. */
	unsigned long emitted_jiffies;

215 216
	bool waitboost;

217 218
	/** engine->request_list entry for this request */
	struct list_head link;
219

220 221 222
	/** ring->request_list entry for this request */
	struct list_head ring_link;

223 224
	struct drm_i915_file_private *file_priv;
	/** file_priv list entry for this request */
225
	struct list_head client_link;
226 227 228 229 230

	I915_SELFTEST_DECLARE(struct {
		struct list_head link;
		unsigned long delay;
	} mock;)
231 232
};

233 234
#define I915_FENCE_GFP (GFP_KERNEL | __GFP_RETRY_MAYFAIL | __GFP_NOWARN)

235
extern const struct dma_fence_ops i915_fence_ops;
236

237
static inline bool dma_fence_is_i915(const struct dma_fence *fence)
238 239 240 241
{
	return fence->ops == &i915_fence_ops;
}

242 243 244 245 246 247 248
struct i915_request * __must_check
__i915_request_create(struct intel_context *ce, gfp_t gfp);
struct i915_request * __must_check
i915_request_create(struct intel_context *ce);

struct i915_request *__i915_request_commit(struct i915_request *request);

249
void i915_request_retire_upto(struct i915_request *rq);
250

251
static inline struct i915_request *
252
to_request(struct dma_fence *fence)
253 254
{
	/* We assume that NULL fence/request are interoperable */
255
	BUILD_BUG_ON(offsetof(struct i915_request, fence) != 0);
256
	GEM_BUG_ON(fence && !dma_fence_is_i915(fence));
257
	return container_of(fence, struct i915_request, fence);
258 259
}

260 261
static inline struct i915_request *
i915_request_get(struct i915_request *rq)
262
{
263
	return to_request(dma_fence_get(&rq->fence));
264 265
}

266 267
static inline struct i915_request *
i915_request_get_rcu(struct i915_request *rq)
268
{
269
	return to_request(dma_fence_get_rcu(&rq->fence));
270 271
}

272
static inline void
273
i915_request_put(struct i915_request *rq)
274
{
275
	dma_fence_put(&rq->fence);
276 277
}

278
int i915_request_await_object(struct i915_request *to,
279 280
			      struct drm_i915_gem_object *obj,
			      bool write);
281 282
int i915_request_await_dma_fence(struct i915_request *rq,
				 struct dma_fence *fence);
283

284
void i915_request_add(struct i915_request *rq);
285

286 287
void __i915_request_submit(struct i915_request *request);
void i915_request_submit(struct i915_request *request);
288

289 290
void i915_request_skip(struct i915_request *request, int error);

291 292
void __i915_request_unsubmit(struct i915_request *request);
void i915_request_unsubmit(struct i915_request *request);
293

294 295 296 297
/* Note: part of the intel_breadcrumbs family */
bool i915_request_enable_breadcrumb(struct i915_request *request);
void i915_request_cancel_breadcrumb(struct i915_request *request);

298
long i915_request_wait(struct i915_request *rq,
299 300
		       unsigned int flags,
		       long timeout)
301
	__attribute__((nonnull(1)));
302 303
#define I915_WAIT_INTERRUPTIBLE	BIT(0)
#define I915_WAIT_LOCKED	BIT(1) /* struct_mutex held, handle GPU reset */
304 305 306
#define I915_WAIT_PRIORITY	BIT(2) /* small priority bump for the request */
#define I915_WAIT_ALL		BIT(3) /* used by i915_gem_object_wait() */
#define I915_WAIT_FOR_IDLE_BOOST BIT(4)
307

308 309
static inline bool i915_request_signaled(const struct i915_request *rq)
{
310
	/* The request may live longer than its HWSP, so check flags first! */
311 312 313
	return test_bit(DMA_FENCE_FLAG_SIGNALED_BIT, &rq->fence.flags);
}

314 315 316 317 318
static inline bool i915_request_is_active(const struct i915_request *rq)
{
	return test_bit(I915_FENCE_FLAG_ACTIVE, &rq->fence.flags);
}

319 320 321 322 323 324 325 326
/**
 * Returns true if seq1 is later than seq2.
 */
static inline bool i915_seqno_passed(u32 seq1, u32 seq2)
{
	return (s32)(seq1 - seq2) >= 0;
}

327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355
static inline u32 __hwsp_seqno(const struct i915_request *rq)
{
	return READ_ONCE(*rq->hwsp_seqno);
}

/**
 * hwsp_seqno - the current breadcrumb value in the HW status page
 * @rq: the request, to chase the relevant HW status page
 *
 * The emphasis in naming here is that hwsp_seqno() is not a property of the
 * request, but an indication of the current HW state (associated with this
 * request). Its value will change as the GPU executes more requests.
 *
 * Returns the current breadcrumb value in the associated HW status page (or
 * the local timeline's equivalent) for this request. The request itself
 * has the associated breadcrumb value of rq->fence.seqno, when the HW
 * status page has that breadcrumb or later, this request is complete.
 */
static inline u32 hwsp_seqno(const struct i915_request *rq)
{
	u32 seqno;

	rcu_read_lock(); /* the HWSP may be freed at runtime */
	seqno = __hwsp_seqno(rq);
	rcu_read_unlock();

	return seqno;
}

356 357 358 359 360
static inline bool __i915_request_has_started(const struct i915_request *rq)
{
	return i915_seqno_passed(hwsp_seqno(rq), rq->fence.seqno - 1);
}

361 362 363 364
/**
 * i915_request_started - check if the request has begun being executed
 * @rq: the request
 *
365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385
 * If the timeline is not using initial breadcrumbs, a request is
 * considered started if the previous request on its timeline (i.e.
 * context) has been signaled.
 *
 * If the timeline is using semaphores, it will also be emitting an
 * "initial breadcrumb" after the semaphores are complete and just before
 * it began executing the user payload. A request can therefore be active
 * on the HW and not yet started as it is still busywaiting on its
 * dependencies (via HW semaphores).
 *
 * If the request has started, its dependencies will have been signaled
 * (either by fences or by semaphores) and it will have begun processing
 * the user payload.
 *
 * However, even if a request has started, it may have been preempted and
 * so no longer active, or it may have already completed.
 *
 * See also i915_request_is_active().
 *
 * Returns true if the request has begun executing the user payload, or
 * has completed:
386 387 388
 */
static inline bool i915_request_started(const struct i915_request *rq)
{
389 390
	if (i915_request_signaled(rq))
		return true;
391

392
	/* Remember: started but may have since been preempted! */
393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409
	return __i915_request_has_started(rq);
}

/**
 * i915_request_is_running - check if the request may actually be executing
 * @rq: the request
 *
 * Returns true if the request is currently submitted to hardware, has passed
 * its start point (i.e. the context is setup and not busywaiting). Note that
 * it may no longer be running by the time the function returns!
 */
static inline bool i915_request_is_running(const struct i915_request *rq)
{
	if (!i915_request_is_active(rq))
		return false;

	return __i915_request_has_started(rq);
410 411
}

412
static inline bool i915_request_completed(const struct i915_request *rq)
413
{
414 415
	if (i915_request_signaled(rq))
		return true;
416

417 418
	return i915_seqno_passed(hwsp_seqno(rq), rq->fence.seqno);
}
419

420 421 422
static inline void i915_request_mark_complete(struct i915_request *rq)
{
	rq->hwsp_seqno = (u32 *)&rq->fence.seqno; /* decouple from HWSP */
423 424
}

425
bool i915_retire_requests(struct drm_i915_private *i915);
426 427

#endif /* I915_REQUEST_H */