2 * Copyright © 2017 Intel Corporation
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the
6 * "Software"), to deal in the Software without restriction, including
7 * without limitation the rights to use, copy, modify, merge, publish,
8 * distribute, sublicense, and/or sell copies of the Software, and to
9 * permit persons to whom the Software is furnished to do so, subject to
10 * the following conditions:
12 * The above copyright notice and this permission notice (including the
13 * next paragraph) shall be included in all copies or substantial portions
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
17 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
18 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
19 * IN NO EVENT SHALL VMWARE AND/OR ITS SUPPLIERS BE LIABLE FOR
20 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
21 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
22 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
25 #include "iris_batch.h"
26 #include "iris_bufmgr.h"
27 #include "iris_context.h"
28 #include "common/gen_decoder.h"
30 #include "drm-uapi/i915_drm.h"
32 #include "util/hash_table.h"
33 #include "main/macros.h"
38 #define FILE_DEBUG_FLAG DEBUG_BUFMGR
41 * Target sizes of the batch and state buffers. We create the initial
42 * buffers at these sizes, and flush when they're nearly full. If we
43 * underestimate how close we are to the end, and suddenly need more space
44 * in the middle of a draw, we can grow the buffers, and finish the draw.
45 * At that point, we'll be over our target size, so the next operation
46 * should flush. Each time we flush the batch, we recreate both buffers
47 * at the original target size, so it doesn't grow without bound.
49 #define BATCH_SZ (20 * 1024)
50 #define STATE_SZ (18 * 1024)
52 static void decode_batch(struct iris_batch
*batch
);
55 iris_batch_reset(struct iris_batch
*batch
);
58 dump_validation_list(struct iris_batch
*batch
)
60 fprintf(stderr
, "Validation list (length %d):\n", batch
->exec_count
);
62 for (int i
= 0; i
< batch
->exec_count
; i
++) {
63 assert(batch
->validation_list
[i
].handle
==
64 batch
->exec_bos
[i
]->gem_handle
);
65 fprintf(stderr
, "[%d] = %d %s %p\n", i
,
66 batch
->validation_list
[i
].handle
,
67 batch
->exec_bos
[i
]->name
,
73 uint_key_compare(const void *a
, const void *b
)
79 uint_key_hash(const void *key
)
81 return (uintptr_t) key
;
85 init_reloc_list(struct iris_reloc_list
*rlist
, int count
)
87 rlist
->reloc_count
= 0;
88 rlist
->reloc_array_size
= count
;
89 rlist
->relocs
= malloc(rlist
->reloc_array_size
*
90 sizeof(struct drm_i915_gem_relocation_entry
));
94 create_batch_buffer(struct iris_bufmgr
*bufmgr
,
95 struct iris_batch_buffer
*buf
,
96 const char *name
, unsigned size
)
98 buf
->bo
= iris_bo_alloc(bufmgr
, name
, size
);
99 buf
->bo
->kflags
|= EXEC_OBJECT_CAPTURE
;
100 buf
->map
= iris_bo_map(NULL
, buf
->bo
, MAP_READ
| MAP_WRITE
);
101 buf
->map_next
= buf
->map
;
105 iris_init_batch(struct iris_batch
*batch
,
106 struct iris_screen
*screen
,
107 struct pipe_debug_callback
*dbg
,
110 batch
->screen
= screen
;
113 /* ring should be one of I915_EXEC_RENDER, I915_EXEC_BLT, etc. */
114 assert((ring
& ~I915_EXEC_RING_MASK
) == 0);
115 assert(util_bitcount(ring
) == 1);
118 init_reloc_list(&batch
->cmdbuf
.relocs
, 256);
119 init_reloc_list(&batch
->statebuf
.relocs
, 256);
121 batch
->exec_count
= 0;
122 batch
->exec_array_size
= 100;
124 malloc(batch
->exec_array_size
* sizeof(batch
->exec_bos
[0]));
125 batch
->validation_list
=
126 malloc(batch
->exec_array_size
* sizeof(batch
->validation_list
[0]));
128 if (unlikely(INTEL_DEBUG
)) {
130 _mesa_hash_table_create(NULL
, uint_key_hash
, uint_key_compare
);
133 iris_batch_reset(batch
);
136 #define READ_ONCE(x) (*(volatile __typeof__(x) *)&(x))
139 add_exec_bo(struct iris_batch
*batch
, struct iris_bo
*bo
)
141 unsigned index
= READ_ONCE(bo
->index
);
143 if (index
< batch
->exec_count
&& batch
->exec_bos
[index
] == bo
)
146 /* May have been shared between multiple active batches */
147 for (index
= 0; index
< batch
->exec_count
; index
++) {
148 if (batch
->exec_bos
[index
] == bo
)
152 iris_bo_reference(bo
);
154 if (batch
->exec_count
== batch
->exec_array_size
) {
155 batch
->exec_array_size
*= 2;
157 realloc(batch
->exec_bos
,
158 batch
->exec_array_size
* sizeof(batch
->exec_bos
[0]));
159 batch
->validation_list
=
160 realloc(batch
->validation_list
,
161 batch
->exec_array_size
* sizeof(batch
->validation_list
[0]));
164 batch
->validation_list
[batch
->exec_count
] =
165 (struct drm_i915_gem_exec_object2
) {
166 .handle
= bo
->gem_handle
,
167 .offset
= bo
->gtt_offset
,
171 bo
->index
= batch
->exec_count
;
172 batch
->exec_bos
[batch
->exec_count
] = bo
;
173 batch
->aperture_space
+= bo
->size
;
175 return batch
->exec_count
++;
179 iris_batch_reset(struct iris_batch
*batch
)
181 struct iris_screen
*screen
= batch
->screen
;
182 struct iris_bufmgr
*bufmgr
= screen
->bufmgr
;
184 if (batch
->last_cmd_bo
!= NULL
) {
185 iris_bo_unreference(batch
->last_cmd_bo
);
186 batch
->last_cmd_bo
= NULL
;
188 batch
->last_cmd_bo
= batch
->cmdbuf
.bo
;
190 create_batch_buffer(bufmgr
, &batch
->cmdbuf
, "command buffer", BATCH_SZ
);
191 create_batch_buffer(bufmgr
, &batch
->statebuf
, "state buffer", STATE_SZ
);
193 /* Avoid making 0 a valid state offset - otherwise the decoder will try
194 * and decode data when we use offset 0 as a null pointer.
196 batch
->statebuf
.map_next
+= 1;
198 add_exec_bo(batch
, batch
->cmdbuf
.bo
);
199 assert(batch
->cmdbuf
.bo
->index
== 0);
201 if (batch
->state_sizes
)
202 _mesa_hash_table_clear(batch
->state_sizes
, NULL
);
204 if (batch
->ring
== I915_EXEC_RENDER
)
205 batch
->emit_state_base_address(batch
);
209 iris_batch_reset_and_clear_render_cache(struct iris_batch
*batch
)
211 iris_batch_reset(batch
);
212 // XXX: iris_render_cache_set_clear(batch);
216 free_batch_buffer(struct iris_batch_buffer
*buf
)
218 iris_bo_unreference(buf
->bo
);
221 buf
->map_next
= NULL
;
223 free(buf
->relocs
.relocs
);
224 buf
->relocs
.relocs
= NULL
;
225 buf
->relocs
.reloc_array_size
= 0;
229 iris_batch_free(struct iris_batch
*batch
)
231 for (int i
= 0; i
< batch
->exec_count
; i
++) {
232 iris_bo_unreference(batch
->exec_bos
[i
]);
234 free(batch
->exec_bos
);
235 free(batch
->validation_list
);
236 free_batch_buffer(&batch
->cmdbuf
);
237 free_batch_buffer(&batch
->statebuf
);
239 iris_bo_unreference(batch
->last_cmd_bo
);
241 if (batch
->state_sizes
)
242 _mesa_hash_table_destroy(batch
->state_sizes
, NULL
);
246 * Finish copying the old batch/state buffer's contents to the new one
247 * after we tried to "grow" the buffer in an earlier operation.
250 finish_growing_bos(struct iris_batch_buffer
*buf
)
252 struct iris_bo
*old_bo
= buf
->partial_bo
;
256 void *old_map
= old_bo
->map_cpu
? old_bo
->map_cpu
: old_bo
->map_wc
;
257 memcpy(buf
->map
, old_map
, buf
->partial_bytes
);
259 buf
->partial_bo
= NULL
;
260 buf
->partial_bytes
= 0;
262 iris_bo_unreference(old_bo
);
266 buffer_bytes_used(struct iris_batch_buffer
*buf
)
268 return buf
->map_next
- buf
->map
;
272 * Grow either the batch or state buffer to a new larger size.
274 * We can't actually grow buffers, so we allocate a new one, copy over
275 * the existing contents, and update our lists to refer to the new one.
277 * Note that this is only temporary - each new batch recreates the buffers
278 * at their original target size (BATCH_SZ or STATE_SZ).
281 grow_buffer(struct iris_batch
*batch
,
282 struct iris_batch_buffer
*buf
,
285 struct iris_bufmgr
*bufmgr
= batch
->screen
->bufmgr
;
286 struct iris_bo
*bo
= buf
->bo
;
288 perf_debug(batch
->dbg
, "Growing %s - ran out of space\n", bo
->name
);
290 if (buf
->partial_bo
) {
291 /* We've already grown once, and now we need to do it again.
292 * Finish our last grow operation so we can start a new one.
293 * This should basically never happen.
295 perf_debug(batch
->dbg
, "Had to grow multiple times");
296 finish_growing_bos(buf
);
299 const unsigned existing_bytes
= buffer_bytes_used(buf
);
301 struct iris_bo
*new_bo
=
302 iris_bo_alloc(bufmgr
, bo
->name
, new_size
);
304 buf
->map
= iris_bo_map(NULL
, new_bo
, MAP_READ
| MAP_WRITE
);
305 buf
->map_next
= buf
->map
+ existing_bytes
;
307 /* Try to put the new BO at the same GTT offset as the old BO (which
308 * we're throwing away, so it doesn't need to be there).
310 * This guarantees that our relocations continue to work: values we've
311 * already written into the buffer, values we're going to write into the
312 * buffer, and the validation/relocation lists all will match.
314 * Also preserve kflags for EXEC_OBJECT_CAPTURE.
316 new_bo
->gtt_offset
= bo
->gtt_offset
;
317 new_bo
->index
= bo
->index
;
318 new_bo
->kflags
= bo
->kflags
;
320 /* Batch/state buffers are per-context, and if we've run out of space,
321 * we must have actually used them before, so...they will be in the list.
323 assert(bo
->index
< batch
->exec_count
);
324 assert(batch
->exec_bos
[bo
->index
] == bo
);
326 /* Update the validation list to use the new BO. */
327 batch
->exec_bos
[bo
->index
] = new_bo
;
328 batch
->validation_list
[bo
->index
].handle
= new_bo
->gem_handle
;
330 /* Exchange the two BOs...without breaking pointers to the old BO.
332 * Consider this scenario:
334 * 1. Somebody calls iris_state_batch() to get a region of memory, and
335 * and then creates a iris_address pointing to iris->batch.state.bo.
336 * 2. They then call iris_state_batch() a second time, which happens to
337 * grow and replace the state buffer. They then try to emit a
338 * relocation to their first section of memory.
340 * If we replace the iris->batch.state.bo pointer at step 2, we would
341 * break the address created in step 1. They'd have a pointer to the
342 * old destroyed BO. Emitting a relocation would add this dead BO to
343 * the validation list...causing /both/ statebuffers to be in the list,
344 * and all kinds of disasters.
346 * This is not a contrived case - BLORP vertex data upload hits this.
348 * There are worse scenarios too. Fences for GL sync objects reference
349 * iris->batch.batch.bo. If we replaced the batch pointer when growing,
350 * we'd need to chase down every fence and update it to point to the
351 * new BO. Otherwise, it would refer to a "batch" that never actually
352 * gets submitted, and would fail to trigger.
354 * To work around both of these issues, we transmutate the buffers in
355 * place, making the existing struct iris_bo represent the new buffer,
356 * and "new_bo" represent the old BO. This is highly unusual, but it
357 * seems like a necessary evil.
359 * We also defer the memcpy of the existing batch's contents. Callers
360 * may make multiple iris_state_batch calls, and retain pointers to the
361 * old BO's map. We'll perform the memcpy in finish_growing_bo() when
362 * we finally submit the batch, at which point we've finished uploading
363 * state, and nobody should have any old references anymore.
365 * To do that, we keep a reference to the old BO in grow->partial_bo,
366 * and store the number of bytes to copy in grow->partial_bytes. We
367 * can monkey with the refcounts directly without atomics because these
368 * are per-context BOs and they can only be touched by this thread.
370 assert(new_bo
->refcount
== 1);
371 new_bo
->refcount
= bo
->refcount
;
375 memcpy(&tmp
, bo
, sizeof(struct iris_bo
));
376 memcpy(bo
, new_bo
, sizeof(struct iris_bo
));
377 memcpy(new_bo
, &tmp
, sizeof(struct iris_bo
));
379 buf
->partial_bo
= new_bo
; /* the one reference of the OLD bo */
380 buf
->partial_bytes
= existing_bytes
;
384 require_buffer_space(struct iris_batch
*batch
,
385 struct iris_batch_buffer
*buf
,
387 unsigned flush_threshold
,
388 unsigned max_buffer_size
)
390 const unsigned required_bytes
= buffer_bytes_used(buf
) + size
;
392 if (!batch
->no_wrap
&& required_bytes
>= flush_threshold
) {
393 iris_batch_flush(batch
);
394 } else if (required_bytes
>= buf
->bo
->size
) {
395 grow_buffer(batch
, buf
,
396 MIN2(buf
->bo
->size
+ buf
->bo
->size
/ 2, max_buffer_size
));
397 assert(required_bytes
< buf
->bo
->size
);
403 iris_require_command_space(struct iris_batch
*batch
, unsigned size
)
405 require_buffer_space(batch
, &batch
->cmdbuf
, size
, BATCH_SZ
, MAX_BATCH_SIZE
);
409 * Reserve some space in the statebuffer, or flush.
411 * This is used to estimate when we're near the end of the batch,
412 * so we can flush early.
415 iris_require_state_space(struct iris_batch
*batch
, unsigned size
)
417 require_buffer_space(batch
, &batch
->statebuf
, size
, STATE_SZ
,
422 iris_batch_emit(struct iris_batch
*batch
, const void *data
, unsigned size
)
424 iris_require_command_space(batch
, size
);
425 memcpy(batch
->cmdbuf
.map_next
, data
, size
);
426 batch
->cmdbuf
.map_next
+= size
;
430 * Called from iris_batch_flush before emitting MI_BATCHBUFFER_END and
433 * This function can emit state (say, to preserve registers that aren't saved
437 iris_finish_batch(struct iris_batch
*batch
)
439 batch
->no_wrap
= true;
443 /* Emit MI_BATCH_BUFFER_END to finish our batch. Note that execbuf2
444 * requires our batch size to be QWord aligned, so we pad it out if
445 * necessary by emitting an extra MI_NOOP after the end.
447 const uint32_t MI_BATCH_BUFFER_END_AND_NOOP
[2] = { (0xA << 23), 0 };
448 const bool qword_aligned
= (buffer_bytes_used(&batch
->cmdbuf
) % 8) == 0;
449 iris_batch_emit(batch
, MI_BATCH_BUFFER_END_AND_NOOP
, qword_aligned
? 8 : 4);
451 batch
->no_wrap
= false;
455 submit_batch(struct iris_batch
*batch
, int in_fence_fd
, int *out_fence_fd
)
457 iris_bo_unmap(batch
->cmdbuf
.bo
);
458 iris_bo_unmap(batch
->statebuf
.bo
);
460 /* The requirement for using I915_EXEC_NO_RELOC are:
462 * The addresses written in the objects must match the corresponding
463 * reloc.gtt_offset which in turn must match the corresponding
466 * Any render targets written to in the batch must be flagged with
469 * To avoid stalling, execobject.offset should match the current
470 * address of that object within the active context.
472 /* Set statebuffer relocations */
473 const unsigned state_index
= batch
->statebuf
.bo
->index
;
474 if (state_index
< batch
->exec_count
&&
475 batch
->exec_bos
[state_index
] == batch
->statebuf
.bo
) {
476 struct drm_i915_gem_exec_object2
*entry
=
477 &batch
->validation_list
[state_index
];
478 assert(entry
->handle
== batch
->statebuf
.bo
->gem_handle
);
479 entry
->relocation_count
= batch
->statebuf
.relocs
.reloc_count
;
480 entry
->relocs_ptr
= (uintptr_t) batch
->statebuf
.relocs
.relocs
;
483 /* Set batchbuffer relocations */
484 struct drm_i915_gem_exec_object2
*entry
= &batch
->validation_list
[0];
485 assert(entry
->handle
== batch
->cmdbuf
.bo
->gem_handle
);
486 entry
->relocation_count
= batch
->cmdbuf
.relocs
.reloc_count
;
487 entry
->relocs_ptr
= (uintptr_t) batch
->cmdbuf
.relocs
.relocs
;
489 struct drm_i915_gem_execbuffer2 execbuf
= {
490 .buffers_ptr
= (uintptr_t) batch
->validation_list
,
491 .buffer_count
= batch
->exec_count
,
492 .batch_start_offset
= 0,
493 .batch_len
= buffer_bytes_used(&batch
->cmdbuf
),
494 .flags
= batch
->ring
|
496 I915_EXEC_BATCH_FIRST
|
497 I915_EXEC_HANDLE_LUT
,
498 .rsvd1
= batch
->hw_ctx_id
, /* rsvd1 is actually the context ID */
501 unsigned long cmd
= DRM_IOCTL_I915_GEM_EXECBUFFER2
;
503 if (in_fence_fd
!= -1) {
504 execbuf
.rsvd2
= in_fence_fd
;
505 execbuf
.flags
|= I915_EXEC_FENCE_IN
;
508 if (out_fence_fd
!= NULL
) {
509 cmd
= DRM_IOCTL_I915_GEM_EXECBUFFER2_WR
;
511 execbuf
.flags
|= I915_EXEC_FENCE_OUT
;
515 int ret
= drm_ioctl(batch
->screen
->fd
, cmd
, &execbuf
);
518 DBG("execbuf FAILED: errno = %d\n", -ret
);
520 DBG("execbuf succeeded\n");
524 fprintf(stderr
, "execbuf disabled for now\n");
527 for (int i
= 0; i
< batch
->exec_count
; i
++) {
528 struct iris_bo
*bo
= batch
->exec_bos
[i
];
533 /* Update iris_bo::gtt_offset */
534 if (batch
->validation_list
[i
].offset
!= bo
->gtt_offset
) {
535 DBG("BO %d migrated: 0x%" PRIx64
" -> 0x%llx\n",
536 bo
->gem_handle
, bo
->gtt_offset
,
537 batch
->validation_list
[i
].offset
);
538 bo
->gtt_offset
= batch
->validation_list
[i
].offset
;
542 if (ret
== 0 && out_fence_fd
!= NULL
)
543 *out_fence_fd
= execbuf
.rsvd2
>> 32;
549 * The in_fence_fd is ignored if -1. Otherwise this function takes ownership
552 * The out_fence_fd is ignored if NULL. Otherwise, the caller takes ownership
553 * of the returned fd.
556 _iris_batch_flush_fence(struct iris_batch
*batch
,
557 int in_fence_fd
, int *out_fence_fd
,
558 const char *file
, int line
)
560 if (buffer_bytes_used(&batch
->cmdbuf
) == 0)
563 /* Check that we didn't just wrap our batchbuffer at a bad time. */
564 assert(!batch
->no_wrap
);
566 iris_finish_batch(batch
);
568 if (unlikely(INTEL_DEBUG
& (DEBUG_BATCH
| DEBUG_SUBMIT
))) {
569 int bytes_for_commands
= buffer_bytes_used(&batch
->cmdbuf
);
570 int bytes_for_state
= buffer_bytes_used(&batch
->statebuf
);
571 fprintf(stderr
, "%19s:%-3d: Batchbuffer flush with %5db (%0.1f%%) (pkt),"
572 " %5db (%0.1f%%) (state), %4d BOs (%0.1fMb aperture),"
573 " %4d batch relocs, %4d state relocs\n", file
, line
,
574 bytes_for_commands
, 100.0f
* bytes_for_commands
/ BATCH_SZ
,
575 bytes_for_state
, 100.0f
* bytes_for_state
/ STATE_SZ
,
577 (float) batch
->aperture_space
/ (1024 * 1024),
578 batch
->cmdbuf
.relocs
.reloc_count
,
579 batch
->statebuf
.relocs
.reloc_count
);
582 int ret
= submit_batch(batch
, in_fence_fd
, out_fence_fd
);
589 if (unlikely(INTEL_DEBUG
& DEBUG_BATCH
))
592 //if (iris->ctx.Const.ResetStrategy == GL_LOSE_CONTEXT_ON_RESET_ARB)
593 //iris_check_for_reset(ice);
595 if (unlikely(INTEL_DEBUG
& DEBUG_SYNC
)) {
596 dbg_printf("waiting for idle\n");
597 iris_bo_wait_rendering(batch
->cmdbuf
.bo
);
600 /* Clean up after the batch we submitted and prepare for a new one. */
601 for (int i
= 0; i
< batch
->exec_count
; i
++) {
602 iris_bo_unreference(batch
->exec_bos
[i
]);
603 batch
->exec_bos
[i
] = NULL
;
605 batch
->cmdbuf
.relocs
.reloc_count
= 0;
606 batch
->statebuf
.relocs
.reloc_count
= 0;
607 batch
->exec_count
= 0;
608 batch
->aperture_space
= 0;
610 iris_bo_unreference(batch
->statebuf
.bo
);
612 /* Start a new batch buffer. */
613 iris_batch_reset_and_clear_render_cache(batch
);
619 iris_batch_references(struct iris_batch
*batch
, struct iris_bo
*bo
)
621 unsigned index
= READ_ONCE(bo
->index
);
622 if (index
< batch
->exec_count
&& batch
->exec_bos
[index
] == bo
)
625 for (int i
= 0; i
< batch
->exec_count
; i
++) {
626 if (batch
->exec_bos
[i
] == bo
)
632 /* This is the only way buffers get added to the validate list.
635 emit_reloc(struct iris_batch
*batch
,
636 struct iris_reloc_list
*rlist
, uint32_t offset
,
637 struct iris_bo
*target
, uint32_t target_offset
,
638 unsigned int reloc_flags
)
640 assert(target
!= NULL
);
642 unsigned int index
= add_exec_bo(batch
, target
);
643 struct drm_i915_gem_exec_object2
*entry
= &batch
->validation_list
[index
];
645 if (target
->kflags
& EXEC_OBJECT_PINNED
) {
646 assert(entry
->offset
== target
->gtt_offset
);
647 return entry
->offset
+ target_offset
;
650 if (rlist
->reloc_count
== rlist
->reloc_array_size
) {
651 rlist
->reloc_array_size
*= 2;
652 rlist
->relocs
= realloc(rlist
->relocs
,
653 rlist
->reloc_array_size
*
654 sizeof(struct drm_i915_gem_relocation_entry
));
657 rlist
->relocs
[rlist
->reloc_count
++] =
658 (struct drm_i915_gem_relocation_entry
) {
660 .delta
= target_offset
,
661 .target_handle
= index
,
662 .presumed_offset
= entry
->offset
,
665 /* Using the old buffer offset, write in what the right data would be, in
666 * case the buffer doesn't move and we can short-circuit the relocation
667 * processing in the kernel
669 return entry
->offset
+ target_offset
;
673 iris_use_pinned_bo(struct iris_batch
*batch
, struct iris_bo
*bo
)
675 assert(bo
->kflags
& EXEC_OBJECT_PINNED
);
676 add_exec_bo(batch
, bo
);
680 iris_batch_reloc(struct iris_batch
*batch
, uint32_t batch_offset
,
681 struct iris_bo
*target
, uint32_t target_offset
,
682 unsigned int reloc_flags
)
684 assert(batch_offset
<= batch
->cmdbuf
.bo
->size
- sizeof(uint32_t));
686 return emit_reloc(batch
, &batch
->cmdbuf
.relocs
, batch_offset
,
687 target
, target_offset
, reloc_flags
);
691 iris_state_reloc(struct iris_batch
*batch
, uint32_t state_offset
,
692 struct iris_bo
*target
, uint32_t target_offset
,
693 unsigned int reloc_flags
)
695 assert(state_offset
<= batch
->statebuf
.bo
->size
- sizeof(uint32_t));
697 return emit_reloc(batch
, &batch
->statebuf
.relocs
, state_offset
,
698 target
, target_offset
, reloc_flags
);
703 iris_state_entry_size(struct iris_batch
*batch
, uint32_t offset
)
705 struct hash_entry
*entry
=
706 _mesa_hash_table_search(batch
->state_sizes
, (void *)(uintptr_t) offset
);
707 return entry
? (uintptr_t) entry
->data
: 0;
711 * Allocates a block of space in the batchbuffer for indirect state.
714 iris_alloc_state(struct iris_batch
*batch
,
715 int size
, int alignment
,
716 uint32_t *out_offset
)
718 assert(size
< batch
->statebuf
.bo
->size
);
720 const unsigned existing_bytes
= buffer_bytes_used(&batch
->statebuf
);
721 unsigned aligned_size
=
722 ALIGN(existing_bytes
, alignment
) - existing_bytes
+ size
;
724 require_buffer_space(batch
, &batch
->statebuf
, aligned_size
,
725 STATE_SZ
, MAX_STATE_SIZE
);
727 unsigned offset
= ALIGN(buffer_bytes_used(&batch
->statebuf
), alignment
);
729 if (unlikely(batch
->state_sizes
)) {
730 _mesa_hash_table_insert(batch
->state_sizes
,
731 (void *) (uintptr_t) offset
,
732 (void *) (uintptr_t) size
);
735 batch
->statebuf
.map_next
+= aligned_size
;
737 *out_offset
= offset
;
738 return batch
->statebuf
.map
+ offset
;
742 iris_emit_state(struct iris_batch
*batch
,
744 int size
, int alignment
)
747 void *dest
= iris_alloc_state(batch
, size
, alignment
, &out_offset
);
748 memcpy(dest
, data
, size
);
753 decode_batch(struct iris_batch
*batch
)
755 // XXX: decode the batch