f1465ed355636fbb72ae4a6ae893af58851da9c9
[mesa.git] / src / mesa / drivers / dri / i965 / intel_batchbuffer.c
1 /*
2 * Copyright 2006 VMware, Inc.
3 * All Rights Reserved.
4 *
5 * Permission is hereby granted, free of charge, to any person obtaining a
6 * copy of this software and associated documentation files (the
7 * "Software"), to deal in the Software without restriction, including
8 * without limitation the rights to use, copy, modify, merge, publish,
9 * distribute, sublicense, and/or sell copies of the Software, and to
10 * permit persons to whom the Software is furnished to do so, subject to
11 * the following conditions:
12 *
13 * The above copyright notice and this permission notice (including the
14 * next paragraph) shall be included in all copies or substantial portions
15 * of the Software.
16 *
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
18 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
19 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
20 * IN NO EVENT SHALL VMWARE AND/OR ITS SUPPLIERS BE LIABLE FOR
21 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
22 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
23 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
24 */
25
26 #include "intel_batchbuffer.h"
27 #include "intel_buffer_objects.h"
28 #include "brw_bufmgr.h"
29 #include "intel_buffers.h"
30 #include "intel_fbo.h"
31 #include "brw_context.h"
32 #include "brw_defines.h"
33 #include "brw_state.h"
34 #include "common/gen_decoder.h"
35 #include "common/gen_gem.h"
36
37 #include "util/hash_table.h"
38
39 #include <xf86drm.h>
40 #include "drm-uapi/i915_drm.h"
41
42 #define FILE_DEBUG_FLAG DEBUG_BUFMGR
43
44 /**
45 * Target sizes of the batch and state buffers. We create the initial
46 * buffers at these sizes, and flush when they're nearly full. If we
47 * underestimate how close we are to the end, and suddenly need more space
48 * in the middle of a draw, we can grow the buffers, and finish the draw.
49 * At that point, we'll be over our target size, so the next operation
50 * should flush. Each time we flush the batch, we recreate both buffers
51 * at the original target size, so it doesn't grow without bound.
52 */
53 #define BATCH_SZ (20 * 1024)
54 #define STATE_SZ (16 * 1024)
55
56 static void
57 intel_batchbuffer_reset(struct brw_context *brw);
58 static void
59 brw_new_batch(struct brw_context *brw);
60
61 static void
62 dump_validation_list(struct intel_batchbuffer *batch)
63 {
64 fprintf(stderr, "Validation list (length %d):\n", batch->exec_count);
65
66 for (int i = 0; i < batch->exec_count; i++) {
67 uint64_t flags = batch->validation_list[i].flags;
68 assert(batch->validation_list[i].handle ==
69 batch->exec_bos[i]->gem_handle);
70 fprintf(stderr, "[%2d]: %2d %-14s %p %s%-7s @ 0x%016llx%s (%"PRIu64"B)\n",
71 i,
72 batch->validation_list[i].handle,
73 batch->exec_bos[i]->name,
74 batch->exec_bos[i],
75 (flags & EXEC_OBJECT_SUPPORTS_48B_ADDRESS) ? "(48b" : "(32b",
76 (flags & EXEC_OBJECT_WRITE) ? " write)" : ")",
77 batch->validation_list[i].offset,
78 (flags & EXEC_OBJECT_PINNED) ? " (pinned)" : "",
79 batch->exec_bos[i]->size);
80 }
81 }
82
83 static struct gen_batch_decode_bo
84 decode_get_bo(void *v_brw, bool ppgtt, uint64_t address)
85 {
86 struct brw_context *brw = v_brw;
87 struct intel_batchbuffer *batch = &brw->batch;
88
89 for (int i = 0; i < batch->exec_count; i++) {
90 struct brw_bo *bo = batch->exec_bos[i];
91 /* The decoder zeroes out the top 16 bits, so we need to as well */
92 uint64_t bo_address = bo->gtt_offset & (~0ull >> 16);
93
94 if (address >= bo_address && address < bo_address + bo->size) {
95 return (struct gen_batch_decode_bo) {
96 .addr = address,
97 .size = bo->size,
98 .map = brw_bo_map(brw, bo, MAP_READ) + (address - bo_address),
99 };
100 }
101 }
102
103 return (struct gen_batch_decode_bo) { };
104 }
105
106 static unsigned
107 decode_get_state_size(void *v_brw, uint64_t address, uint64_t base_address)
108 {
109 struct brw_context *brw = v_brw;
110 struct intel_batchbuffer *batch = &brw->batch;
111 unsigned size = (uintptr_t)
112 _mesa_hash_table_u64_search(batch->state_batch_sizes,
113 address - base_address);
114 return size;
115 }
116
117 static void
118 init_reloc_list(struct brw_reloc_list *rlist, int count)
119 {
120 rlist->reloc_count = 0;
121 rlist->reloc_array_size = count;
122 rlist->relocs = malloc(rlist->reloc_array_size *
123 sizeof(struct drm_i915_gem_relocation_entry));
124 }
125
126 void
127 intel_batchbuffer_init(struct brw_context *brw)
128 {
129 struct intel_screen *screen = brw->screen;
130 struct intel_batchbuffer *batch = &brw->batch;
131 const struct gen_device_info *devinfo = &screen->devinfo;
132
133 batch->use_shadow_copy = !devinfo->has_llc;
134
135 init_reloc_list(&batch->batch_relocs, 250);
136 init_reloc_list(&batch->state_relocs, 250);
137
138 batch->batch.map = NULL;
139 batch->state.map = NULL;
140 batch->exec_count = 0;
141 batch->exec_array_size = 100;
142 batch->exec_bos =
143 malloc(batch->exec_array_size * sizeof(batch->exec_bos[0]));
144 batch->validation_list =
145 malloc(batch->exec_array_size * sizeof(batch->validation_list[0]));
146
147 if (INTEL_DEBUG & DEBUG_BATCH) {
148 batch->state_batch_sizes =
149 _mesa_hash_table_u64_create(NULL);
150
151 const unsigned decode_flags =
152 GEN_BATCH_DECODE_FULL |
153 ((INTEL_DEBUG & DEBUG_COLOR) ? GEN_BATCH_DECODE_IN_COLOR : 0) |
154 GEN_BATCH_DECODE_OFFSETS |
155 GEN_BATCH_DECODE_FLOATS;
156
157 gen_batch_decode_ctx_init(&batch->decoder, devinfo, stderr,
158 decode_flags, NULL, decode_get_bo,
159 decode_get_state_size, brw);
160 batch->decoder.max_vbo_decoded_lines = 100;
161 }
162
163 batch->use_batch_first =
164 screen->kernel_features & KERNEL_ALLOWS_EXEC_BATCH_FIRST;
165
166 /* PIPE_CONTROL needs a w/a but only on gen6 */
167 batch->valid_reloc_flags = EXEC_OBJECT_WRITE;
168 if (devinfo->gen == 6)
169 batch->valid_reloc_flags |= EXEC_OBJECT_NEEDS_GTT;
170
171 intel_batchbuffer_reset(brw);
172 }
173
174 #define READ_ONCE(x) (*(volatile __typeof__(x) *)&(x))
175
176 static unsigned
177 add_exec_bo(struct intel_batchbuffer *batch, struct brw_bo *bo)
178 {
179 assert(bo->bufmgr == batch->batch.bo->bufmgr);
180
181 unsigned index = READ_ONCE(bo->index);
182
183 if (index < batch->exec_count && batch->exec_bos[index] == bo)
184 return index;
185
186 /* May have been shared between multiple active batches */
187 for (index = 0; index < batch->exec_count; index++) {
188 if (batch->exec_bos[index] == bo)
189 return index;
190 }
191
192 brw_bo_reference(bo);
193
194 if (batch->exec_count == batch->exec_array_size) {
195 batch->exec_array_size *= 2;
196 batch->exec_bos =
197 realloc(batch->exec_bos,
198 batch->exec_array_size * sizeof(batch->exec_bos[0]));
199 batch->validation_list =
200 realloc(batch->validation_list,
201 batch->exec_array_size * sizeof(batch->validation_list[0]));
202 }
203
204 batch->validation_list[batch->exec_count] =
205 (struct drm_i915_gem_exec_object2) {
206 .handle = bo->gem_handle,
207 .offset = bo->gtt_offset,
208 .flags = bo->kflags,
209 };
210
211 bo->index = batch->exec_count;
212 batch->exec_bos[batch->exec_count] = bo;
213 batch->aperture_space += bo->size;
214
215 return batch->exec_count++;
216 }
217
218 static void
219 recreate_growing_buffer(struct brw_context *brw,
220 struct brw_growing_bo *grow,
221 const char *name, unsigned size,
222 enum brw_memory_zone memzone)
223 {
224 struct intel_screen *screen = brw->screen;
225 struct intel_batchbuffer *batch = &brw->batch;
226 struct brw_bufmgr *bufmgr = screen->bufmgr;
227
228 /* We can't grow buffers when using softpin, so just overallocate them. */
229 if (brw_using_softpin(bufmgr))
230 size *= 2;
231
232 grow->bo = brw_bo_alloc(bufmgr, name, size, memzone);
233 grow->bo->kflags |= can_do_exec_capture(screen) ? EXEC_OBJECT_CAPTURE : 0;
234 grow->partial_bo = NULL;
235 grow->partial_bo_map = NULL;
236 grow->partial_bytes = 0;
237 grow->memzone = memzone;
238
239 if (batch->use_shadow_copy)
240 grow->map = realloc(grow->map, grow->bo->size);
241 else
242 grow->map = brw_bo_map(brw, grow->bo, MAP_READ | MAP_WRITE);
243 }
244
245 static void
246 intel_batchbuffer_reset(struct brw_context *brw)
247 {
248 struct intel_batchbuffer *batch = &brw->batch;
249
250 if (batch->last_bo != NULL) {
251 brw_bo_unreference(batch->last_bo);
252 batch->last_bo = NULL;
253 }
254 batch->last_bo = batch->batch.bo;
255
256 recreate_growing_buffer(brw, &batch->batch, "batchbuffer", BATCH_SZ,
257 BRW_MEMZONE_OTHER);
258 batch->map_next = batch->batch.map;
259
260 recreate_growing_buffer(brw, &batch->state, "statebuffer", STATE_SZ,
261 BRW_MEMZONE_DYNAMIC);
262
263 /* Avoid making 0 a valid state offset - otherwise the decoder will try
264 * and decode data when we use offset 0 as a null pointer.
265 */
266 batch->state_used = 1;
267
268 add_exec_bo(batch, batch->batch.bo);
269 assert(batch->batch.bo->index == 0);
270
271 batch->needs_sol_reset = false;
272 batch->state_base_address_emitted = false;
273
274 if (batch->state_batch_sizes)
275 _mesa_hash_table_u64_clear(batch->state_batch_sizes, NULL);
276 }
277
278 static void
279 intel_batchbuffer_reset_and_clear_render_cache(struct brw_context *brw)
280 {
281 intel_batchbuffer_reset(brw);
282 brw_cache_sets_clear(brw);
283 }
284
285 void
286 intel_batchbuffer_save_state(struct brw_context *brw)
287 {
288 brw->batch.saved.map_next = brw->batch.map_next;
289 brw->batch.saved.batch_reloc_count = brw->batch.batch_relocs.reloc_count;
290 brw->batch.saved.state_reloc_count = brw->batch.state_relocs.reloc_count;
291 brw->batch.saved.exec_count = brw->batch.exec_count;
292 }
293
294 bool
295 intel_batchbuffer_saved_state_is_empty(struct brw_context *brw)
296 {
297 struct intel_batchbuffer *batch = &brw->batch;
298 return (batch->saved.map_next == batch->batch.map);
299 }
300
301 void
302 intel_batchbuffer_reset_to_saved(struct brw_context *brw)
303 {
304 for (int i = brw->batch.saved.exec_count;
305 i < brw->batch.exec_count; i++) {
306 brw_bo_unreference(brw->batch.exec_bos[i]);
307 }
308 brw->batch.batch_relocs.reloc_count = brw->batch.saved.batch_reloc_count;
309 brw->batch.state_relocs.reloc_count = brw->batch.saved.state_reloc_count;
310 brw->batch.exec_count = brw->batch.saved.exec_count;
311
312 brw->batch.map_next = brw->batch.saved.map_next;
313 if (USED_BATCH(brw->batch) == 0)
314 brw_new_batch(brw);
315 }
316
317 void
318 intel_batchbuffer_free(struct intel_batchbuffer *batch)
319 {
320 if (batch->use_shadow_copy) {
321 free(batch->batch.map);
322 free(batch->state.map);
323 }
324
325 for (int i = 0; i < batch->exec_count; i++) {
326 brw_bo_unreference(batch->exec_bos[i]);
327 }
328 free(batch->batch_relocs.relocs);
329 free(batch->state_relocs.relocs);
330 free(batch->exec_bos);
331 free(batch->validation_list);
332
333 brw_bo_unreference(batch->last_bo);
334 brw_bo_unreference(batch->batch.bo);
335 brw_bo_unreference(batch->state.bo);
336 if (batch->state_batch_sizes) {
337 _mesa_hash_table_u64_destroy(batch->state_batch_sizes, NULL);
338 gen_batch_decode_ctx_finish(&batch->decoder);
339 }
340 }
341
342 /**
343 * Finish copying the old batch/state buffer's contents to the new one
344 * after we tried to "grow" the buffer in an earlier operation.
345 */
346 static void
347 finish_growing_bos(struct brw_growing_bo *grow)
348 {
349 struct brw_bo *old_bo = grow->partial_bo;
350 if (!old_bo)
351 return;
352
353 memcpy(grow->map, grow->partial_bo_map, grow->partial_bytes);
354
355 grow->partial_bo = NULL;
356 grow->partial_bo_map = NULL;
357 grow->partial_bytes = 0;
358
359 brw_bo_unreference(old_bo);
360 }
361
362 static void
363 replace_bo_in_reloc_list(struct brw_reloc_list *rlist,
364 uint32_t old_handle, uint32_t new_handle)
365 {
366 for (int i = 0; i < rlist->reloc_count; i++) {
367 if (rlist->relocs[i].target_handle == old_handle)
368 rlist->relocs[i].target_handle = new_handle;
369 }
370 }
371
372 /**
373 * Grow either the batch or state buffer to a new larger size.
374 *
375 * We can't actually grow buffers, so we allocate a new one, copy over
376 * the existing contents, and update our lists to refer to the new one.
377 *
378 * Note that this is only temporary - each new batch recreates the buffers
379 * at their original target size (BATCH_SZ or STATE_SZ).
380 */
381 static void
382 grow_buffer(struct brw_context *brw,
383 struct brw_growing_bo *grow,
384 unsigned existing_bytes,
385 unsigned new_size)
386 {
387 struct intel_batchbuffer *batch = &brw->batch;
388 struct brw_bufmgr *bufmgr = brw->bufmgr;
389 struct brw_bo *bo = grow->bo;
390
391 /* We can't grow buffers that are softpinned, as the growing mechanism
392 * involves putting a larger buffer at the same gtt_offset...and we've
393 * only allocated the smaller amount of VMA. Without relocations, this
394 * simply won't work. This should never happen, however.
395 */
396 assert(!(bo->kflags & EXEC_OBJECT_PINNED));
397
398 perf_debug("Growing %s - ran out of space\n", bo->name);
399
400 if (grow->partial_bo) {
401 /* We've already grown once, and now we need to do it again.
402 * Finish our last grow operation so we can start a new one.
403 * This should basically never happen.
404 */
405 perf_debug("Had to grow multiple times");
406 finish_growing_bos(grow);
407 }
408
409 struct brw_bo *new_bo =
410 brw_bo_alloc(bufmgr, bo->name, new_size, grow->memzone);
411
412 /* Copy existing data to the new larger buffer */
413 grow->partial_bo_map = grow->map;
414
415 if (batch->use_shadow_copy) {
416 /* We can't safely use realloc, as it may move the existing buffer,
417 * breaking existing pointers the caller may still be using. Just
418 * malloc a new copy and memcpy it like the normal BO path.
419 *
420 * Use bo->size rather than new_size because the bufmgr may have
421 * rounded up the size, and we want the shadow size to match.
422 */
423 grow->map = malloc(new_bo->size);
424 } else {
425 grow->map = brw_bo_map(brw, new_bo, MAP_READ | MAP_WRITE);
426 }
427
428 /* Try to put the new BO at the same GTT offset as the old BO (which
429 * we're throwing away, so it doesn't need to be there).
430 *
431 * This guarantees that our relocations continue to work: values we've
432 * already written into the buffer, values we're going to write into the
433 * buffer, and the validation/relocation lists all will match.
434 *
435 * Also preserve kflags for EXEC_OBJECT_CAPTURE.
436 */
437 new_bo->gtt_offset = bo->gtt_offset;
438 new_bo->index = bo->index;
439 new_bo->kflags = bo->kflags;
440
441 /* Batch/state buffers are per-context, and if we've run out of space,
442 * we must have actually used them before, so...they will be in the list.
443 */
444 assert(bo->index < batch->exec_count);
445 assert(batch->exec_bos[bo->index] == bo);
446
447 /* Update the validation list to use the new BO. */
448 batch->validation_list[bo->index].handle = new_bo->gem_handle;
449
450 if (!batch->use_batch_first) {
451 /* We're not using I915_EXEC_HANDLE_LUT, which means we need to go
452 * update the relocation list entries to point at the new BO as well.
453 * (With newer kernels, the "handle" is an offset into the validation
454 * list, which remains unchanged, so we can skip this.)
455 */
456 replace_bo_in_reloc_list(&batch->batch_relocs,
457 bo->gem_handle, new_bo->gem_handle);
458 replace_bo_in_reloc_list(&batch->state_relocs,
459 bo->gem_handle, new_bo->gem_handle);
460 }
461
462 /* Exchange the two BOs...without breaking pointers to the old BO.
463 *
464 * Consider this scenario:
465 *
466 * 1. Somebody calls brw_state_batch() to get a region of memory, and
467 * and then creates a brw_address pointing to brw->batch.state.bo.
468 * 2. They then call brw_state_batch() a second time, which happens to
469 * grow and replace the state buffer. They then try to emit a
470 * relocation to their first section of memory.
471 *
472 * If we replace the brw->batch.state.bo pointer at step 2, we would
473 * break the address created in step 1. They'd have a pointer to the
474 * old destroyed BO. Emitting a relocation would add this dead BO to
475 * the validation list...causing /both/ statebuffers to be in the list,
476 * and all kinds of disasters.
477 *
478 * This is not a contrived case - BLORP vertex data upload hits this.
479 *
480 * There are worse scenarios too. Fences for GL sync objects reference
481 * brw->batch.batch.bo. If we replaced the batch pointer when growing,
482 * we'd need to chase down every fence and update it to point to the
483 * new BO. Otherwise, it would refer to a "batch" that never actually
484 * gets submitted, and would fail to trigger.
485 *
486 * To work around both of these issues, we transmutate the buffers in
487 * place, making the existing struct brw_bo represent the new buffer,
488 * and "new_bo" represent the old BO. This is highly unusual, but it
489 * seems like a necessary evil.
490 *
491 * We also defer the memcpy of the existing batch's contents. Callers
492 * may make multiple brw_state_batch calls, and retain pointers to the
493 * old BO's map. We'll perform the memcpy in finish_growing_bo() when
494 * we finally submit the batch, at which point we've finished uploading
495 * state, and nobody should have any old references anymore.
496 *
497 * To do that, we keep a reference to the old BO in grow->partial_bo,
498 * and store the number of bytes to copy in grow->partial_bytes. We
499 * can monkey with the refcounts directly without atomics because these
500 * are per-context BOs and they can only be touched by this thread.
501 */
502 assert(new_bo->refcount == 1);
503 new_bo->refcount = bo->refcount;
504 bo->refcount = 1;
505
506 struct brw_bo tmp;
507 memcpy(&tmp, bo, sizeof(struct brw_bo));
508 memcpy(bo, new_bo, sizeof(struct brw_bo));
509 memcpy(new_bo, &tmp, sizeof(struct brw_bo));
510
511 grow->partial_bo = new_bo; /* the one reference of the OLD bo */
512 grow->partial_bytes = existing_bytes;
513 }
514
515 void
516 intel_batchbuffer_require_space(struct brw_context *brw, GLuint sz)
517 {
518 struct intel_batchbuffer *batch = &brw->batch;
519
520 const unsigned batch_used = USED_BATCH(*batch) * 4;
521 if (batch_used + sz >= BATCH_SZ && !batch->no_wrap) {
522 intel_batchbuffer_flush(brw);
523 } else if (batch_used + sz >= batch->batch.bo->size) {
524 const unsigned new_size =
525 MIN2(batch->batch.bo->size + batch->batch.bo->size / 2,
526 MAX_BATCH_SIZE);
527 grow_buffer(brw, &batch->batch, batch_used, new_size);
528 batch->map_next = (void *) batch->batch.map + batch_used;
529 assert(batch_used + sz < batch->batch.bo->size);
530 }
531 }
532
533 /**
534 * Called when starting a new batch buffer.
535 */
536 static void
537 brw_new_batch(struct brw_context *brw)
538 {
539 /* Unreference any BOs held by the previous batch, and reset counts. */
540 for (int i = 0; i < brw->batch.exec_count; i++) {
541 brw_bo_unreference(brw->batch.exec_bos[i]);
542 brw->batch.exec_bos[i] = NULL;
543 }
544 brw->batch.batch_relocs.reloc_count = 0;
545 brw->batch.state_relocs.reloc_count = 0;
546 brw->batch.exec_count = 0;
547 brw->batch.aperture_space = 0;
548
549 brw_bo_unreference(brw->batch.state.bo);
550
551 /* Create a new batchbuffer and reset the associated state: */
552 intel_batchbuffer_reset_and_clear_render_cache(brw);
553
554 /* If the kernel supports hardware contexts, then most hardware state is
555 * preserved between batches; we only need to re-emit state that is required
556 * to be in every batch. Otherwise we need to re-emit all the state that
557 * would otherwise be stored in the context (which for all intents and
558 * purposes means everything).
559 */
560 if (brw->hw_ctx == 0) {
561 brw->ctx.NewDriverState |= BRW_NEW_CONTEXT;
562 brw_upload_invariant_state(brw);
563 }
564
565 brw->ctx.NewDriverState |= BRW_NEW_BATCH;
566
567 brw->ib.index_size = -1;
568
569 /* We need to periodically reap the shader time results, because rollover
570 * happens every few seconds. We also want to see results every once in a
571 * while, because many programs won't cleanly destroy our context, so the
572 * end-of-run printout may not happen.
573 */
574 if (INTEL_DEBUG & DEBUG_SHADER_TIME)
575 brw_collect_and_report_shader_time(brw);
576
577 intel_batchbuffer_maybe_noop(brw);
578 }
579
580 /**
581 * Called from intel_batchbuffer_flush before emitting MI_BATCHBUFFER_END and
582 * sending it off.
583 *
584 * This function can emit state (say, to preserve registers that aren't saved
585 * between batches).
586 */
587 static void
588 brw_finish_batch(struct brw_context *brw)
589 {
590 const struct gen_device_info *devinfo = &brw->screen->devinfo;
591
592 brw->batch.no_wrap = true;
593
594 /* Capture the closing pipeline statistics register values necessary to
595 * support query objects (in the non-hardware context world).
596 */
597 brw_emit_query_end(brw);
598
599 /* Work around L3 state leaks into contexts set MI_RESTORE_INHIBIT which
600 * assume that the L3 cache is configured according to the hardware
601 * defaults. On Kernel 4.16+, we no longer need to do this.
602 */
603 if (devinfo->gen >= 7 &&
604 !(brw->screen->kernel_features & KERNEL_ALLOWS_CONTEXT_ISOLATION))
605 gen7_restore_default_l3_config(brw);
606
607 if (devinfo->is_haswell) {
608 /* From the Haswell PRM, Volume 2b, Command Reference: Instructions,
609 * 3DSTATE_CC_STATE_POINTERS > "Note":
610 *
611 * "SW must program 3DSTATE_CC_STATE_POINTERS command at the end of every
612 * 3D batch buffer followed by a PIPE_CONTROL with RC flush and CS stall."
613 *
614 * From the example in the docs, it seems to expect a regular pipe control
615 * flush here as well. We may have done it already, but meh.
616 *
617 * See also WaAvoidRCZCounterRollover.
618 */
619 brw_emit_mi_flush(brw);
620 BEGIN_BATCH(2);
621 OUT_BATCH(_3DSTATE_CC_STATE_POINTERS << 16 | (2 - 2));
622 OUT_BATCH(brw->cc.state_offset | 1);
623 ADVANCE_BATCH();
624 brw_emit_pipe_control_flush(brw, PIPE_CONTROL_RENDER_TARGET_FLUSH |
625 PIPE_CONTROL_CS_STALL);
626 }
627
628 /* Do not restore push constant packets during context restore. */
629 if (devinfo->gen >= 7)
630 gen10_emit_isp_disable(brw);
631
632 /* Emit MI_BATCH_BUFFER_END to finish our batch. Note that execbuf2
633 * requires our batch size to be QWord aligned, so we pad it out if
634 * necessary by emitting an extra MI_NOOP after the end.
635 */
636 intel_batchbuffer_require_space(brw, 8);
637 *brw->batch.map_next++ = MI_BATCH_BUFFER_END;
638 if (USED_BATCH(brw->batch) & 1) {
639 *brw->batch.map_next++ = MI_NOOP;
640 }
641
642 brw->batch.no_wrap = false;
643 }
644
645 static void
646 throttle(struct brw_context *brw)
647 {
648 /* Wait for the swapbuffers before the one we just emitted, so we
649 * don't get too many swaps outstanding for apps that are GPU-heavy
650 * but not CPU-heavy.
651 *
652 * We're using intelDRI2Flush (called from the loader before
653 * swapbuffer) and glFlush (for front buffer rendering) as the
654 * indicator that a frame is done and then throttle when we get
655 * here as we prepare to render the next frame. At this point for
656 * round trips for swap/copy and getting new buffers are done and
657 * we'll spend less time waiting on the GPU.
658 *
659 * Unfortunately, we don't have a handle to the batch containing
660 * the swap, and getting our hands on that doesn't seem worth it,
661 * so we just use the first batch we emitted after the last swap.
662 */
663 if (brw->need_swap_throttle && brw->throttle_batch[0]) {
664 if (brw->throttle_batch[1]) {
665 if (!brw->disable_throttling) {
666 brw_bo_wait_rendering(brw->throttle_batch[1]);
667 }
668 brw_bo_unreference(brw->throttle_batch[1]);
669 }
670 brw->throttle_batch[1] = brw->throttle_batch[0];
671 brw->throttle_batch[0] = NULL;
672 brw->need_swap_throttle = false;
673 /* Throttling here is more precise than the throttle ioctl, so skip it */
674 brw->need_flush_throttle = false;
675 }
676
677 if (brw->need_flush_throttle) {
678 __DRIscreen *dri_screen = brw->screen->driScrnPriv;
679 drmCommandNone(dri_screen->fd, DRM_I915_GEM_THROTTLE);
680 brw->need_flush_throttle = false;
681 }
682 }
683
684 static int
685 execbuffer(int fd,
686 struct intel_batchbuffer *batch,
687 uint32_t ctx_id,
688 int used,
689 int in_fence,
690 int *out_fence,
691 int flags)
692 {
693 struct drm_i915_gem_execbuffer2 execbuf = {
694 .buffers_ptr = (uintptr_t) batch->validation_list,
695 .buffer_count = batch->exec_count,
696 .batch_start_offset = 0,
697 .batch_len = used,
698 .flags = flags,
699 .rsvd1 = ctx_id, /* rsvd1 is actually the context ID */
700 };
701
702 unsigned long cmd = DRM_IOCTL_I915_GEM_EXECBUFFER2;
703
704 if (in_fence != -1) {
705 execbuf.rsvd2 = in_fence;
706 execbuf.flags |= I915_EXEC_FENCE_IN;
707 }
708
709 if (out_fence != NULL) {
710 cmd = DRM_IOCTL_I915_GEM_EXECBUFFER2_WR;
711 *out_fence = -1;
712 execbuf.flags |= I915_EXEC_FENCE_OUT;
713 }
714
715 int ret = drmIoctl(fd, cmd, &execbuf);
716 if (ret != 0)
717 ret = -errno;
718
719 for (int i = 0; i < batch->exec_count; i++) {
720 struct brw_bo *bo = batch->exec_bos[i];
721
722 bo->idle = false;
723 bo->index = -1;
724
725 /* Update brw_bo::gtt_offset */
726 if (batch->validation_list[i].offset != bo->gtt_offset) {
727 DBG("BO %d migrated: 0x%" PRIx64 " -> 0x%llx\n",
728 bo->gem_handle, bo->gtt_offset,
729 batch->validation_list[i].offset);
730 assert(!(bo->kflags & EXEC_OBJECT_PINNED));
731 bo->gtt_offset = batch->validation_list[i].offset;
732 }
733 }
734
735 if (ret == 0 && out_fence != NULL)
736 *out_fence = execbuf.rsvd2 >> 32;
737
738 return ret;
739 }
740
741 static int
742 submit_batch(struct brw_context *brw, int in_fence_fd, int *out_fence_fd)
743 {
744 __DRIscreen *dri_screen = brw->screen->driScrnPriv;
745 struct intel_batchbuffer *batch = &brw->batch;
746 int ret = 0;
747
748 if (batch->use_shadow_copy) {
749 void *bo_map = brw_bo_map(brw, batch->batch.bo, MAP_WRITE);
750 memcpy(bo_map, batch->batch.map, 4 * USED_BATCH(*batch));
751
752 bo_map = brw_bo_map(brw, batch->state.bo, MAP_WRITE);
753 memcpy(bo_map, batch->state.map, batch->state_used);
754 }
755
756 brw_bo_unmap(batch->batch.bo);
757 brw_bo_unmap(batch->state.bo);
758
759 if (!brw->screen->no_hw) {
760 /* The requirement for using I915_EXEC_NO_RELOC are:
761 *
762 * The addresses written in the objects must match the corresponding
763 * reloc.gtt_offset which in turn must match the corresponding
764 * execobject.offset.
765 *
766 * Any render targets written to in the batch must be flagged with
767 * EXEC_OBJECT_WRITE.
768 *
769 * To avoid stalling, execobject.offset should match the current
770 * address of that object within the active context.
771 */
772 int flags = I915_EXEC_NO_RELOC | I915_EXEC_RENDER;
773
774 if (batch->needs_sol_reset)
775 flags |= I915_EXEC_GEN7_SOL_RESET;
776
777 /* Set statebuffer relocations */
778 const unsigned state_index = batch->state.bo->index;
779 if (state_index < batch->exec_count &&
780 batch->exec_bos[state_index] == batch->state.bo) {
781 struct drm_i915_gem_exec_object2 *entry =
782 &batch->validation_list[state_index];
783 assert(entry->handle == batch->state.bo->gem_handle);
784 entry->relocation_count = batch->state_relocs.reloc_count;
785 entry->relocs_ptr = (uintptr_t) batch->state_relocs.relocs;
786 }
787
788 /* Set batchbuffer relocations */
789 struct drm_i915_gem_exec_object2 *entry = &batch->validation_list[0];
790 assert(entry->handle == batch->batch.bo->gem_handle);
791 entry->relocation_count = batch->batch_relocs.reloc_count;
792 entry->relocs_ptr = (uintptr_t) batch->batch_relocs.relocs;
793
794 if (batch->use_batch_first) {
795 flags |= I915_EXEC_BATCH_FIRST | I915_EXEC_HANDLE_LUT;
796 } else {
797 /* Move the batch to the end of the validation list */
798 struct drm_i915_gem_exec_object2 tmp;
799 struct brw_bo *tmp_bo;
800 const unsigned index = batch->exec_count - 1;
801
802 tmp = *entry;
803 *entry = batch->validation_list[index];
804 batch->validation_list[index] = tmp;
805
806 tmp_bo = batch->exec_bos[0];
807 batch->exec_bos[0] = batch->exec_bos[index];
808 batch->exec_bos[index] = tmp_bo;
809 }
810
811 ret = execbuffer(dri_screen->fd, batch, brw->hw_ctx,
812 4 * USED_BATCH(*batch),
813 in_fence_fd, out_fence_fd, flags);
814
815 throttle(brw);
816 }
817
818 if (unlikely(INTEL_DEBUG & DEBUG_BATCH)) {
819 gen_print_batch(&batch->decoder, batch->batch.map,
820 4 * USED_BATCH(*batch),
821 batch->batch.bo->gtt_offset, false);
822 }
823
824 if (brw->ctx.Const.ResetStrategy == GL_LOSE_CONTEXT_ON_RESET_ARB)
825 brw_check_for_reset(brw);
826
827 if (ret != 0) {
828 fprintf(stderr, "i965: Failed to submit batchbuffer: %s\n",
829 strerror(-ret));
830 exit(1);
831 }
832
833 return ret;
834 }
835
836 /**
837 * The in_fence_fd is ignored if -1. Otherwise this function takes ownership
838 * of the fd.
839 *
840 * The out_fence_fd is ignored if NULL. Otherwise, the caller takes ownership
841 * of the returned fd.
842 */
843 int
844 _intel_batchbuffer_flush_fence(struct brw_context *brw,
845 int in_fence_fd, int *out_fence_fd,
846 const char *file, int line)
847 {
848 int ret;
849
850 if (USED_BATCH(brw->batch) == 0)
851 return 0;
852
853 /* Check that we didn't just wrap our batchbuffer at a bad time. */
854 assert(!brw->batch.no_wrap);
855
856 brw_finish_batch(brw);
857 brw_upload_finish(&brw->upload);
858
859 finish_growing_bos(&brw->batch.batch);
860 finish_growing_bos(&brw->batch.state);
861
862 if (brw->throttle_batch[0] == NULL) {
863 brw->throttle_batch[0] = brw->batch.batch.bo;
864 brw_bo_reference(brw->throttle_batch[0]);
865 }
866
867 if (unlikely(INTEL_DEBUG & (DEBUG_BATCH | DEBUG_SUBMIT))) {
868 int bytes_for_commands = 4 * USED_BATCH(brw->batch);
869 int bytes_for_state = brw->batch.state_used;
870 fprintf(stderr, "%19s:%-3d: Batchbuffer flush with %5db (%0.1f%%) (pkt),"
871 " %5db (%0.1f%%) (state), %4d BOs (%0.1fMb aperture),"
872 " %4d batch relocs, %4d state relocs\n", file, line,
873 bytes_for_commands, 100.0f * bytes_for_commands / BATCH_SZ,
874 bytes_for_state, 100.0f * bytes_for_state / STATE_SZ,
875 brw->batch.exec_count,
876 (float) (brw->batch.aperture_space / (1024 * 1024)),
877 brw->batch.batch_relocs.reloc_count,
878 brw->batch.state_relocs.reloc_count);
879
880 dump_validation_list(&brw->batch);
881 }
882
883 ret = submit_batch(brw, in_fence_fd, out_fence_fd);
884
885 if (unlikely(INTEL_DEBUG & DEBUG_SYNC)) {
886 fprintf(stderr, "waiting for idle\n");
887 brw_bo_wait_rendering(brw->batch.batch.bo);
888 }
889
890 /* Start a new batch buffer. */
891 brw_new_batch(brw);
892
893 return ret;
894 }
895
896 void
897 intel_batchbuffer_maybe_noop(struct brw_context *brw)
898 {
899 if (!brw->frontend_noop || USED_BATCH(brw->batch) != 0)
900 return;
901
902 BEGIN_BATCH(1);
903 OUT_BATCH(MI_BATCH_BUFFER_END);
904 ADVANCE_BATCH();
905 }
906
907 bool
908 brw_batch_references(struct intel_batchbuffer *batch, struct brw_bo *bo)
909 {
910 unsigned index = READ_ONCE(bo->index);
911 if (index < batch->exec_count && batch->exec_bos[index] == bo)
912 return true;
913
914 for (int i = 0; i < batch->exec_count; i++) {
915 if (batch->exec_bos[i] == bo)
916 return true;
917 }
918 return false;
919 }
920
921 /* This is the only way buffers get added to the validate list.
922 */
923 static uint64_t
924 emit_reloc(struct intel_batchbuffer *batch,
925 struct brw_reloc_list *rlist, uint32_t offset,
926 struct brw_bo *target, int32_t target_offset,
927 unsigned int reloc_flags)
928 {
929 assert(target != NULL);
930
931 if (target->kflags & EXEC_OBJECT_PINNED) {
932 brw_use_pinned_bo(batch, target, reloc_flags & RELOC_WRITE);
933 return gen_canonical_address(target->gtt_offset + target_offset);
934 }
935
936 unsigned int index = add_exec_bo(batch, target);
937 struct drm_i915_gem_exec_object2 *entry = &batch->validation_list[index];
938
939 if (rlist->reloc_count == rlist->reloc_array_size) {
940 rlist->reloc_array_size *= 2;
941 rlist->relocs = realloc(rlist->relocs,
942 rlist->reloc_array_size *
943 sizeof(struct drm_i915_gem_relocation_entry));
944 }
945
946 if (reloc_flags & RELOC_32BIT) {
947 /* Restrict this buffer to the low 32 bits of the address space.
948 *
949 * Altering the validation list flags restricts it for this batch,
950 * but we also alter the BO's kflags to restrict it permanently
951 * (until the BO is destroyed and put back in the cache). Buffers
952 * may stay bound across batches, and we want keep it constrained.
953 */
954 target->kflags &= ~EXEC_OBJECT_SUPPORTS_48B_ADDRESS;
955 entry->flags &= ~EXEC_OBJECT_SUPPORTS_48B_ADDRESS;
956
957 /* RELOC_32BIT is not an EXEC_OBJECT_* flag, so get rid of it. */
958 reloc_flags &= ~RELOC_32BIT;
959 }
960
961 if (reloc_flags)
962 entry->flags |= reloc_flags & batch->valid_reloc_flags;
963
964 rlist->relocs[rlist->reloc_count++] =
965 (struct drm_i915_gem_relocation_entry) {
966 .offset = offset,
967 .delta = target_offset,
968 .target_handle = batch->use_batch_first ? index : target->gem_handle,
969 .presumed_offset = entry->offset,
970 };
971
972 /* Using the old buffer offset, write in what the right data would be, in
973 * case the buffer doesn't move and we can short-circuit the relocation
974 * processing in the kernel
975 */
976 return entry->offset + target_offset;
977 }
978
979 void
980 brw_use_pinned_bo(struct intel_batchbuffer *batch, struct brw_bo *bo,
981 unsigned writable_flag)
982 {
983 assert(bo->kflags & EXEC_OBJECT_PINNED);
984 assert((writable_flag & ~EXEC_OBJECT_WRITE) == 0);
985
986 unsigned int index = add_exec_bo(batch, bo);
987 struct drm_i915_gem_exec_object2 *entry = &batch->validation_list[index];
988 assert(entry->offset == bo->gtt_offset);
989
990 if (writable_flag)
991 entry->flags |= EXEC_OBJECT_WRITE;
992 }
993
994 uint64_t
995 brw_batch_reloc(struct intel_batchbuffer *batch, uint32_t batch_offset,
996 struct brw_bo *target, uint32_t target_offset,
997 unsigned int reloc_flags)
998 {
999 assert(batch_offset <= batch->batch.bo->size - sizeof(uint32_t));
1000
1001 return emit_reloc(batch, &batch->batch_relocs, batch_offset,
1002 target, target_offset, reloc_flags);
1003 }
1004
1005 uint64_t
1006 brw_state_reloc(struct intel_batchbuffer *batch, uint32_t state_offset,
1007 struct brw_bo *target, uint32_t target_offset,
1008 unsigned int reloc_flags)
1009 {
1010 assert(state_offset <= batch->state.bo->size - sizeof(uint32_t));
1011
1012 return emit_reloc(batch, &batch->state_relocs, state_offset,
1013 target, target_offset, reloc_flags);
1014 }
1015
1016 /**
1017 * Reserve some space in the statebuffer, or flush.
1018 *
1019 * This is used to estimate when we're near the end of the batch,
1020 * so we can flush early.
1021 */
1022 void
1023 brw_require_statebuffer_space(struct brw_context *brw, int size)
1024 {
1025 if (brw->batch.state_used + size >= STATE_SZ)
1026 intel_batchbuffer_flush(brw);
1027 }
1028
1029 /**
1030 * Allocates a block of space in the batchbuffer for indirect state.
1031 */
1032 void *
1033 brw_state_batch(struct brw_context *brw,
1034 int size,
1035 int alignment,
1036 uint32_t *out_offset)
1037 {
1038 struct intel_batchbuffer *batch = &brw->batch;
1039
1040 assert(size < batch->state.bo->size);
1041
1042 uint32_t offset = ALIGN(batch->state_used, alignment);
1043
1044 if (offset + size >= STATE_SZ && !batch->no_wrap) {
1045 intel_batchbuffer_flush(brw);
1046 offset = ALIGN(batch->state_used, alignment);
1047 } else if (offset + size >= batch->state.bo->size) {
1048 const unsigned new_size =
1049 MIN2(batch->state.bo->size + batch->state.bo->size / 2,
1050 MAX_STATE_SIZE);
1051 grow_buffer(brw, &batch->state, batch->state_used, new_size);
1052 assert(offset + size < batch->state.bo->size);
1053 }
1054
1055 if (unlikely(INTEL_DEBUG & DEBUG_BATCH)) {
1056 _mesa_hash_table_u64_insert(batch->state_batch_sizes,
1057 offset, (void *) (uintptr_t) size);
1058 }
1059
1060 batch->state_used = offset + size;
1061
1062 *out_offset = offset;
1063 return batch->state.map + (offset >> 2);
1064 }
1065
1066 void
1067 intel_batchbuffer_data(struct brw_context *brw,
1068 const void *data, GLuint bytes)
1069 {
1070 assert((bytes & 3) == 0);
1071 intel_batchbuffer_require_space(brw, bytes);
1072 memcpy(brw->batch.map_next, data, bytes);
1073 brw->batch.map_next += bytes >> 2;
1074 }
1075
1076 static void
1077 load_sized_register_mem(struct brw_context *brw,
1078 uint32_t reg,
1079 struct brw_bo *bo,
1080 uint32_t offset,
1081 int size)
1082 {
1083 const struct gen_device_info *devinfo = &brw->screen->devinfo;
1084 int i;
1085
1086 /* MI_LOAD_REGISTER_MEM only exists on Gen7+. */
1087 assert(devinfo->gen >= 7);
1088
1089 if (devinfo->gen >= 8) {
1090 BEGIN_BATCH(4 * size);
1091 for (i = 0; i < size; i++) {
1092 OUT_BATCH(GEN7_MI_LOAD_REGISTER_MEM | (4 - 2));
1093 OUT_BATCH(reg + i * 4);
1094 OUT_RELOC64(bo, 0, offset + i * 4);
1095 }
1096 ADVANCE_BATCH();
1097 } else {
1098 BEGIN_BATCH(3 * size);
1099 for (i = 0; i < size; i++) {
1100 OUT_BATCH(GEN7_MI_LOAD_REGISTER_MEM | (3 - 2));
1101 OUT_BATCH(reg + i * 4);
1102 OUT_RELOC(bo, 0, offset + i * 4);
1103 }
1104 ADVANCE_BATCH();
1105 }
1106 }
1107
1108 void
1109 brw_load_register_mem(struct brw_context *brw,
1110 uint32_t reg,
1111 struct brw_bo *bo,
1112 uint32_t offset)
1113 {
1114 load_sized_register_mem(brw, reg, bo, offset, 1);
1115 }
1116
1117 void
1118 brw_load_register_mem64(struct brw_context *brw,
1119 uint32_t reg,
1120 struct brw_bo *bo,
1121 uint32_t offset)
1122 {
1123 load_sized_register_mem(brw, reg, bo, offset, 2);
1124 }
1125
1126 /*
1127 * Write an arbitrary 32-bit register to a buffer via MI_STORE_REGISTER_MEM.
1128 */
1129 void
1130 brw_store_register_mem32(struct brw_context *brw,
1131 struct brw_bo *bo, uint32_t reg, uint32_t offset)
1132 {
1133 const struct gen_device_info *devinfo = &brw->screen->devinfo;
1134
1135 assert(devinfo->gen >= 6);
1136
1137 if (devinfo->gen >= 8) {
1138 BEGIN_BATCH(4);
1139 OUT_BATCH(MI_STORE_REGISTER_MEM | (4 - 2));
1140 OUT_BATCH(reg);
1141 OUT_RELOC64(bo, RELOC_WRITE, offset);
1142 ADVANCE_BATCH();
1143 } else {
1144 BEGIN_BATCH(3);
1145 OUT_BATCH(MI_STORE_REGISTER_MEM | (3 - 2));
1146 OUT_BATCH(reg);
1147 OUT_RELOC(bo, RELOC_WRITE | RELOC_NEEDS_GGTT, offset);
1148 ADVANCE_BATCH();
1149 }
1150 }
1151
1152 /*
1153 * Write an arbitrary 64-bit register to a buffer via MI_STORE_REGISTER_MEM.
1154 */
1155 void
1156 brw_store_register_mem64(struct brw_context *brw,
1157 struct brw_bo *bo, uint32_t reg, uint32_t offset)
1158 {
1159 const struct gen_device_info *devinfo = &brw->screen->devinfo;
1160
1161 assert(devinfo->gen >= 6);
1162
1163 /* MI_STORE_REGISTER_MEM only stores a single 32-bit value, so to
1164 * read a full 64-bit register, we need to do two of them.
1165 */
1166 if (devinfo->gen >= 8) {
1167 BEGIN_BATCH(8);
1168 OUT_BATCH(MI_STORE_REGISTER_MEM | (4 - 2));
1169 OUT_BATCH(reg);
1170 OUT_RELOC64(bo, RELOC_WRITE, offset);
1171 OUT_BATCH(MI_STORE_REGISTER_MEM | (4 - 2));
1172 OUT_BATCH(reg + sizeof(uint32_t));
1173 OUT_RELOC64(bo, RELOC_WRITE, offset + sizeof(uint32_t));
1174 ADVANCE_BATCH();
1175 } else {
1176 BEGIN_BATCH(6);
1177 OUT_BATCH(MI_STORE_REGISTER_MEM | (3 - 2));
1178 OUT_BATCH(reg);
1179 OUT_RELOC(bo, RELOC_WRITE | RELOC_NEEDS_GGTT, offset);
1180 OUT_BATCH(MI_STORE_REGISTER_MEM | (3 - 2));
1181 OUT_BATCH(reg + sizeof(uint32_t));
1182 OUT_RELOC(bo, RELOC_WRITE | RELOC_NEEDS_GGTT, offset + sizeof(uint32_t));
1183 ADVANCE_BATCH();
1184 }
1185 }
1186
1187 /*
1188 * Write a 32-bit register using immediate data.
1189 */
1190 void
1191 brw_load_register_imm32(struct brw_context *brw, uint32_t reg, uint32_t imm)
1192 {
1193 assert(brw->screen->devinfo.gen >= 6);
1194
1195 BEGIN_BATCH(3);
1196 OUT_BATCH(MI_LOAD_REGISTER_IMM | (3 - 2));
1197 OUT_BATCH(reg);
1198 OUT_BATCH(imm);
1199 ADVANCE_BATCH();
1200 }
1201
1202 /*
1203 * Write a 64-bit register using immediate data.
1204 */
1205 void
1206 brw_load_register_imm64(struct brw_context *brw, uint32_t reg, uint64_t imm)
1207 {
1208 assert(brw->screen->devinfo.gen >= 6);
1209
1210 BEGIN_BATCH(5);
1211 OUT_BATCH(MI_LOAD_REGISTER_IMM | (5 - 2));
1212 OUT_BATCH(reg);
1213 OUT_BATCH(imm & 0xffffffff);
1214 OUT_BATCH(reg + 4);
1215 OUT_BATCH(imm >> 32);
1216 ADVANCE_BATCH();
1217 }
1218
1219 /*
1220 * Copies a 32-bit register.
1221 */
1222 void
1223 brw_load_register_reg(struct brw_context *brw, uint32_t dest, uint32_t src)
1224 {
1225 assert(brw->screen->devinfo.gen >= 8 || brw->screen->devinfo.is_haswell);
1226
1227 BEGIN_BATCH(3);
1228 OUT_BATCH(MI_LOAD_REGISTER_REG | (3 - 2));
1229 OUT_BATCH(src);
1230 OUT_BATCH(dest);
1231 ADVANCE_BATCH();
1232 }
1233
1234 /*
1235 * Copies a 64-bit register.
1236 */
1237 void
1238 brw_load_register_reg64(struct brw_context *brw, uint32_t dest, uint32_t src)
1239 {
1240 assert(brw->screen->devinfo.gen >= 8 || brw->screen->devinfo.is_haswell);
1241
1242 BEGIN_BATCH(6);
1243 OUT_BATCH(MI_LOAD_REGISTER_REG | (3 - 2));
1244 OUT_BATCH(src);
1245 OUT_BATCH(dest);
1246 OUT_BATCH(MI_LOAD_REGISTER_REG | (3 - 2));
1247 OUT_BATCH(src + sizeof(uint32_t));
1248 OUT_BATCH(dest + sizeof(uint32_t));
1249 ADVANCE_BATCH();
1250 }
1251
1252 /*
1253 * Write 32-bits of immediate data to a GPU memory buffer.
1254 */
1255 void
1256 brw_store_data_imm32(struct brw_context *brw, struct brw_bo *bo,
1257 uint32_t offset, uint32_t imm)
1258 {
1259 const struct gen_device_info *devinfo = &brw->screen->devinfo;
1260
1261 assert(devinfo->gen >= 6);
1262
1263 BEGIN_BATCH(4);
1264 OUT_BATCH(MI_STORE_DATA_IMM | (4 - 2));
1265 if (devinfo->gen >= 8)
1266 OUT_RELOC64(bo, RELOC_WRITE, offset);
1267 else {
1268 OUT_BATCH(0); /* MBZ */
1269 OUT_RELOC(bo, RELOC_WRITE, offset);
1270 }
1271 OUT_BATCH(imm);
1272 ADVANCE_BATCH();
1273 }
1274
1275 /*
1276 * Write 64-bits of immediate data to a GPU memory buffer.
1277 */
1278 void
1279 brw_store_data_imm64(struct brw_context *brw, struct brw_bo *bo,
1280 uint32_t offset, uint64_t imm)
1281 {
1282 const struct gen_device_info *devinfo = &brw->screen->devinfo;
1283
1284 assert(devinfo->gen >= 6);
1285
1286 BEGIN_BATCH(5);
1287 OUT_BATCH(MI_STORE_DATA_IMM | (5 - 2));
1288 if (devinfo->gen >= 8)
1289 OUT_RELOC64(bo, RELOC_WRITE, offset);
1290 else {
1291 OUT_BATCH(0); /* MBZ */
1292 OUT_RELOC(bo, RELOC_WRITE, offset);
1293 }
1294 OUT_BATCH(imm & 0xffffffffu);
1295 OUT_BATCH(imm >> 32);
1296 ADVANCE_BATCH();
1297 }