2 * Copyright (C) 2019 Alyssa Rosenzweig
3 * Copyright (C) 2014-2017 Broadcom
5 * Permission is hereby granted, free of charge, to any person obtaining a
6 * copy of this software and associated documentation files (the "Software"),
7 * to deal in the Software without restriction, including without limitation
8 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
9 * and/or sell copies of the Software, and to permit persons to whom the
10 * Software is furnished to do so, subject to the following conditions:
12 * The above copyright notice and this permission notice (including the next
13 * paragraph) shall be included in all copies or substantial portions of the
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
19 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
28 #include "drm-uapi/panfrost_drm.h"
31 #include "pan_context.h"
32 #include "util/hash_table.h"
33 #include "util/ralloc.h"
34 #include "util/u_format.h"
35 #include "util/u_pack_color.h"
37 #include "pandecode/decode.h"
39 /* panfrost_bo_access is here to help us keep track of batch accesses to BOs
40 * and build a proper dependency graph such that batches can be pipelined for
41 * better GPU utilization.
43 * Each accessed BO has a corresponding entry in the ->accessed_bos hash table.
44 * A BO is either being written or read at any time, that's what the type field
46 * When the last access is a write, the batch writing the BO might have read
47 * dependencies (readers that have not been executed yet and want to read the
48 * previous BO content), and when the last access is a read, all readers might
49 * depend on another batch to push its results to memory. That's what the
50 * readers/writers keep track off.
51 * There can only be one writer at any given time, if a new batch wants to
52 * write to the same BO, a dependency will be added between the new writer and
53 * the old writer (at the batch level), and panfrost_bo_access->writer will be
54 * updated to point to the new writer.
56 struct panfrost_bo_access
{
58 struct util_dynarray readers
;
59 struct panfrost_batch_fence
*writer
;
62 static struct panfrost_batch_fence
*
63 panfrost_create_batch_fence(struct panfrost_batch
*batch
)
65 struct panfrost_batch_fence
*fence
;
68 fence
= rzalloc(NULL
, struct panfrost_batch_fence
);
70 pipe_reference_init(&fence
->reference
, 1);
71 fence
->ctx
= batch
->ctx
;
73 ret
= drmSyncobjCreate(pan_screen(batch
->ctx
->base
.screen
)->fd
, 0,
81 panfrost_free_batch_fence(struct panfrost_batch_fence
*fence
)
83 drmSyncobjDestroy(pan_screen(fence
->ctx
->base
.screen
)->fd
,
89 panfrost_batch_fence_unreference(struct panfrost_batch_fence
*fence
)
91 if (pipe_reference(&fence
->reference
, NULL
))
92 panfrost_free_batch_fence(fence
);
96 panfrost_batch_fence_reference(struct panfrost_batch_fence
*fence
)
98 pipe_reference(NULL
, &fence
->reference
);
101 static struct panfrost_batch
*
102 panfrost_create_batch(struct panfrost_context
*ctx
,
103 const struct pipe_framebuffer_state
*key
)
105 struct panfrost_batch
*batch
= rzalloc(ctx
, struct panfrost_batch
);
109 batch
->bos
= _mesa_hash_table_create(batch
, _mesa_hash_pointer
,
110 _mesa_key_pointer_equal
);
112 batch
->minx
= batch
->miny
= ~0;
113 batch
->maxx
= batch
->maxy
= 0;
114 batch
->transient_offset
= 0;
116 util_dynarray_init(&batch
->headers
, batch
);
117 util_dynarray_init(&batch
->gpu_headers
, batch
);
118 util_dynarray_init(&batch
->dependencies
, batch
);
119 batch
->out_sync
= panfrost_create_batch_fence(batch
);
120 util_copy_framebuffer_state(&batch
->key
, key
);
126 panfrost_freeze_batch(struct panfrost_batch
*batch
)
128 struct panfrost_context
*ctx
= batch
->ctx
;
129 struct hash_entry
*entry
;
131 /* Remove the entry in the FBO -> batch hash table if the batch
132 * matches. This way, next draws/clears targeting this FBO will trigger
133 * the creation of a new batch.
135 entry
= _mesa_hash_table_search(ctx
->batches
, &batch
->key
);
136 if (entry
&& entry
->data
== batch
)
137 _mesa_hash_table_remove(ctx
->batches
, entry
);
139 /* If this is the bound batch, the panfrost_context parameters are
140 * relevant so submitting it invalidates those parameters, but if it's
141 * not bound, the context parameters are for some other batch so we
142 * can't invalidate them.
144 if (ctx
->batch
== batch
) {
145 panfrost_invalidate_frame(ctx
);
151 static bool panfrost_batch_is_frozen(struct panfrost_batch
*batch
)
153 struct panfrost_context
*ctx
= batch
->ctx
;
154 struct hash_entry
*entry
;
156 entry
= _mesa_hash_table_search(ctx
->batches
, &batch
->key
);
157 if (entry
&& entry
->data
== batch
)
160 if (ctx
->batch
== batch
)
168 panfrost_free_batch(struct panfrost_batch
*batch
)
173 assert(panfrost_batch_is_frozen(batch
));
175 hash_table_foreach(batch
->bos
, entry
)
176 panfrost_bo_unreference((struct panfrost_bo
*)entry
->key
);
178 util_dynarray_foreach(&batch
->dependencies
,
179 struct panfrost_batch_fence
*, dep
) {
180 panfrost_batch_fence_unreference(*dep
);
183 /* The out_sync fence lifetime is different from the the batch one
184 * since other batches might want to wait on a fence of already
185 * submitted/signaled batch. All we need to do here is make sure the
186 * fence does not point to an invalid batch, which the core will
187 * interpret as 'batch is already submitted'.
189 batch
->out_sync
->batch
= NULL
;
190 panfrost_batch_fence_unreference(batch
->out_sync
);
192 util_unreference_framebuffer_state(&batch
->key
);
198 panfrost_dep_graph_contains_batch(struct panfrost_batch
*root
,
199 struct panfrost_batch
*batch
)
204 util_dynarray_foreach(&root
->dependencies
,
205 struct panfrost_batch_fence
*, dep
) {
206 if ((*dep
)->batch
== batch
||
207 panfrost_dep_graph_contains_batch((*dep
)->batch
, batch
))
216 panfrost_batch_add_dep(struct panfrost_batch
*batch
,
217 struct panfrost_batch_fence
*newdep
)
219 if (batch
== newdep
->batch
)
222 /* We might want to turn ->dependencies into a set if the number of
223 * deps turns out to be big enough to make this 'is dep already there'
224 * search inefficient.
226 util_dynarray_foreach(&batch
->dependencies
,
227 struct panfrost_batch_fence
*, dep
) {
232 /* Make sure the dependency graph is acyclic. */
233 assert(!panfrost_dep_graph_contains_batch(newdep
->batch
, batch
));
235 panfrost_batch_fence_reference(newdep
);
236 util_dynarray_append(&batch
->dependencies
,
237 struct panfrost_batch_fence
*, newdep
);
239 /* We now have a batch depending on us, let's make sure new draw/clear
240 * calls targeting the same FBO use a new batch object.
243 panfrost_freeze_batch(newdep
->batch
);
246 static struct panfrost_batch
*
247 panfrost_get_batch(struct panfrost_context
*ctx
,
248 const struct pipe_framebuffer_state
*key
)
250 /* Lookup the job first */
251 struct hash_entry
*entry
= _mesa_hash_table_search(ctx
->batches
, key
);
256 /* Otherwise, let's create a job */
258 struct panfrost_batch
*batch
= panfrost_create_batch(ctx
, key
);
260 /* Save the created job */
261 _mesa_hash_table_insert(ctx
->batches
, &batch
->key
, batch
);
266 /* Get the job corresponding to the FBO we're currently rendering into */
268 struct panfrost_batch
*
269 panfrost_get_batch_for_fbo(struct panfrost_context
*ctx
)
271 /* If we're wallpapering, we special case to workaround
274 if (ctx
->wallpaper_batch
)
275 return ctx
->wallpaper_batch
;
277 /* If we already began rendering, use that */
280 assert(util_framebuffer_state_equal(&ctx
->batch
->key
,
281 &ctx
->pipe_framebuffer
));
285 /* If not, look up the job */
286 struct panfrost_batch
*batch
= panfrost_get_batch(ctx
,
287 &ctx
->pipe_framebuffer
);
289 /* Set this job as the current FBO job. Will be reset when updating the
290 * FB state and when submitting or releasing a job.
296 struct panfrost_batch
*
297 panfrost_get_fresh_batch_for_fbo(struct panfrost_context
*ctx
)
299 struct panfrost_batch
*batch
;
301 batch
= panfrost_get_batch(ctx
, &ctx
->pipe_framebuffer
);
303 /* The batch has no draw/clear queued, let's return it directly.
304 * Note that it's perfectly fine to re-use a batch with an
305 * existing clear, we'll just update it with the new clear request.
307 if (!batch
->last_job
.gpu
)
310 /* Otherwise, we need to freeze the existing one and instantiate a new
313 panfrost_freeze_batch(batch
);
314 return panfrost_get_batch(ctx
, &ctx
->pipe_framebuffer
);
318 panfrost_batch_fence_is_signaled(struct panfrost_batch_fence
*fence
)
323 /* Batch has not been submitted yet. */
327 int ret
= drmSyncobjWait(pan_screen(fence
->ctx
->base
.screen
)->fd
,
328 &fence
->syncobj
, 1, 0, 0, NULL
);
330 /* Cache whether the fence was signaled */
331 fence
->signaled
= ret
>= 0;
332 return fence
->signaled
;
336 panfrost_bo_access_gc_fences(struct panfrost_context
*ctx
,
337 struct panfrost_bo_access
*access
,
338 const struct panfrost_bo
*bo
)
340 if (access
->writer
&& panfrost_batch_fence_is_signaled(access
->writer
)) {
341 panfrost_batch_fence_unreference(access
->writer
);
342 access
->writer
= NULL
;
345 unsigned nreaders
= 0;
346 util_dynarray_foreach(&access
->readers
, struct panfrost_batch_fence
*,
351 if (panfrost_batch_fence_is_signaled(*reader
)) {
352 panfrost_batch_fence_unreference(*reader
);
360 util_dynarray_clear(&access
->readers
);
363 /* Collect signaled fences to keep the kernel-side syncobj-map small. The
364 * idea is to collect those signaled fences at the end of each flush_all
365 * call. This function is likely to collect only fences from previous
366 * batch flushes not the one that have just have just been submitted and
367 * are probably still in flight when we trigger the garbage collection.
368 * Anyway, we need to do this garbage collection at some point if we don't
369 * want the BO access map to keep invalid entries around and retain
373 panfrost_gc_fences(struct panfrost_context
*ctx
)
375 hash_table_foreach(ctx
->accessed_bos
, entry
) {
376 struct panfrost_bo_access
*access
= entry
->data
;
379 panfrost_bo_access_gc_fences(ctx
, access
, entry
->key
);
380 if (!util_dynarray_num_elements(&access
->readers
,
381 struct panfrost_batch_fence
*) &&
383 _mesa_hash_table_remove(ctx
->accessed_bos
, entry
);
389 panfrost_batch_in_readers(struct panfrost_batch
*batch
,
390 struct panfrost_bo_access
*access
)
392 util_dynarray_foreach(&access
->readers
, struct panfrost_batch_fence
*,
394 if (*reader
&& (*reader
)->batch
== batch
)
403 panfrost_batch_update_bo_access(struct panfrost_batch
*batch
,
404 struct panfrost_bo
*bo
, uint32_t access_type
,
405 bool already_accessed
)
407 struct panfrost_context
*ctx
= batch
->ctx
;
408 struct panfrost_bo_access
*access
;
409 uint32_t old_access_type
;
410 struct hash_entry
*entry
;
412 assert(access_type
== PAN_BO_ACCESS_WRITE
||
413 access_type
== PAN_BO_ACCESS_READ
);
415 entry
= _mesa_hash_table_search(ctx
->accessed_bos
, bo
);
416 access
= entry
? entry
->data
: NULL
;
418 old_access_type
= access
->type
;
420 access
= rzalloc(ctx
, struct panfrost_bo_access
);
421 util_dynarray_init(&access
->readers
, access
);
422 _mesa_hash_table_insert(ctx
->accessed_bos
, bo
, access
);
423 /* We are the first to access this BO, let's initialize
424 * old_access_type to our own access type in that case.
426 old_access_type
= access_type
;
427 access
->type
= access_type
;
432 if (access_type
== PAN_BO_ACCESS_WRITE
&&
433 old_access_type
== PAN_BO_ACCESS_READ
) {
434 /* Previous access was a read and we want to write this BO.
435 * We first need to add explicit deps between our batch and
436 * the previous readers.
438 util_dynarray_foreach(&access
->readers
,
439 struct panfrost_batch_fence
*, reader
) {
440 /* We were already reading the BO, no need to add a dep
441 * on ourself (the acyclic check would complain about
444 if (!(*reader
) || (*reader
)->batch
== batch
)
447 panfrost_batch_add_dep(batch
, *reader
);
449 panfrost_batch_fence_reference(batch
->out_sync
);
451 /* We now are the new writer. */
452 access
->writer
= batch
->out_sync
;
453 access
->type
= access_type
;
455 /* Release the previous readers and reset the readers array. */
456 util_dynarray_foreach(&access
->readers
,
457 struct panfrost_batch_fence
*,
461 panfrost_batch_fence_unreference(*reader
);
464 util_dynarray_clear(&access
->readers
);
465 } else if (access_type
== PAN_BO_ACCESS_WRITE
&&
466 old_access_type
== PAN_BO_ACCESS_WRITE
) {
467 /* Previous access was a write and we want to write this BO.
468 * First check if we were the previous writer, in that case
469 * there's nothing to do. Otherwise we need to add a
470 * dependency between the new writer and the old one.
472 if (access
->writer
!= batch
->out_sync
) {
473 if (access
->writer
) {
474 panfrost_batch_add_dep(batch
, access
->writer
);
475 panfrost_batch_fence_unreference(access
->writer
);
477 panfrost_batch_fence_reference(batch
->out_sync
);
478 access
->writer
= batch
->out_sync
;
480 } else if (access_type
== PAN_BO_ACCESS_READ
&&
481 old_access_type
== PAN_BO_ACCESS_WRITE
) {
482 /* Previous access was a write and we want to read this BO.
483 * First check if we were the previous writer, in that case
484 * we want to keep the access type unchanged, as a write is
485 * more constraining than a read.
487 if (access
->writer
!= batch
->out_sync
) {
488 /* Add a dependency on the previous writer. */
489 panfrost_batch_add_dep(batch
, access
->writer
);
491 /* The previous access was a write, there's no reason
492 * to have entries in the readers array.
494 assert(!util_dynarray_num_elements(&access
->readers
,
495 struct panfrost_batch_fence
*));
497 /* Add ourselves to the readers array. */
498 panfrost_batch_fence_reference(batch
->out_sync
);
499 util_dynarray_append(&access
->readers
,
500 struct panfrost_batch_fence
*,
502 access
->type
= PAN_BO_ACCESS_READ
;
505 /* We already accessed this BO before, so we should already be
506 * in the reader array.
508 if (already_accessed
) {
509 assert(panfrost_batch_in_readers(batch
, access
));
513 /* Previous access was a read and we want to read this BO.
514 * Add ourselves to the readers array and add a dependency on
515 * the previous writer if any.
517 panfrost_batch_fence_reference(batch
->out_sync
);
518 util_dynarray_append(&access
->readers
,
519 struct panfrost_batch_fence
*,
523 panfrost_batch_add_dep(batch
, access
->writer
);
528 panfrost_batch_add_bo(struct panfrost_batch
*batch
, struct panfrost_bo
*bo
,
534 struct hash_entry
*entry
;
535 uint32_t old_flags
= 0;
537 entry
= _mesa_hash_table_search(batch
->bos
, bo
);
539 entry
= _mesa_hash_table_insert(batch
->bos
, bo
,
540 (void *)(uintptr_t)flags
);
541 panfrost_bo_reference(bo
);
543 old_flags
= (uintptr_t)entry
->data
;
545 /* All batches have to agree on the shared flag. */
546 assert((old_flags
& PAN_BO_ACCESS_SHARED
) ==
547 (flags
& PAN_BO_ACCESS_SHARED
));
552 if (old_flags
== flags
)
556 entry
->data
= (void *)(uintptr_t)flags
;
558 /* If this is not a shared BO, we don't really care about dependency
561 if (!(flags
& PAN_BO_ACCESS_SHARED
))
564 /* All dependencies should have been flushed before we execute the
565 * wallpaper draw, so it should be harmless to skip the
566 * update_bo_access() call.
568 if (batch
== batch
->ctx
->wallpaper_batch
)
571 /* Only pass R/W flags to the dep tracking logic. */
572 assert(flags
& PAN_BO_ACCESS_RW
);
573 flags
= (flags
& PAN_BO_ACCESS_WRITE
) ?
574 PAN_BO_ACCESS_WRITE
: PAN_BO_ACCESS_READ
;
575 panfrost_batch_update_bo_access(batch
, bo
, flags
, old_flags
!= 0);
578 void panfrost_batch_add_fbo_bos(struct panfrost_batch
*batch
)
580 uint32_t flags
= PAN_BO_ACCESS_SHARED
| PAN_BO_ACCESS_WRITE
|
581 PAN_BO_ACCESS_VERTEX_TILER
|
582 PAN_BO_ACCESS_FRAGMENT
;
584 for (unsigned i
= 0; i
< batch
->key
.nr_cbufs
; ++i
) {
585 struct panfrost_resource
*rsrc
= pan_resource(batch
->key
.cbufs
[i
]->texture
);
586 panfrost_batch_add_bo(batch
, rsrc
->bo
, flags
);
589 if (batch
->key
.zsbuf
) {
590 struct panfrost_resource
*rsrc
= pan_resource(batch
->key
.zsbuf
->texture
);
591 panfrost_batch_add_bo(batch
, rsrc
->bo
, flags
);
596 panfrost_batch_create_bo(struct panfrost_batch
*batch
, size_t size
,
597 uint32_t create_flags
, uint32_t access_flags
)
599 struct panfrost_bo
*bo
;
601 bo
= panfrost_bo_create(pan_screen(batch
->ctx
->base
.screen
), size
,
603 panfrost_batch_add_bo(batch
, bo
, access_flags
);
605 /* panfrost_batch_add_bo() has retained a reference and
606 * panfrost_bo_create() initialize the refcnt to 1, so let's
607 * unreference the BO here so it gets released when the batch is
608 * destroyed (unless it's retained by someone else in the meantime).
610 panfrost_bo_unreference(bo
);
614 /* Returns the polygon list's GPU address if available, or otherwise allocates
615 * the polygon list. It's perfectly fast to use allocate/free BO directly,
616 * since we'll hit the BO cache and this is one-per-batch anyway. */
619 panfrost_batch_get_polygon_list(struct panfrost_batch
*batch
, unsigned size
)
621 if (batch
->polygon_list
) {
622 assert(batch
->polygon_list
->size
>= size
);
624 /* Create the BO as invisible, as there's no reason to map */
626 batch
->polygon_list
= panfrost_batch_create_bo(batch
, size
,
628 PAN_BO_ACCESS_PRIVATE
|
630 PAN_BO_ACCESS_VERTEX_TILER
|
631 PAN_BO_ACCESS_FRAGMENT
);
634 return batch
->polygon_list
->gpu
;
638 panfrost_batch_get_scratchpad(struct panfrost_batch
*batch
)
640 if (batch
->scratchpad
)
641 return batch
->scratchpad
;
643 batch
->scratchpad
= panfrost_batch_create_bo(batch
, 64 * 4 * 4096,
645 PAN_BO_ACCESS_PRIVATE
|
647 PAN_BO_ACCESS_VERTEX_TILER
|
648 PAN_BO_ACCESS_FRAGMENT
);
649 assert(batch
->scratchpad
);
650 return batch
->scratchpad
;
654 panfrost_batch_get_tiler_heap(struct panfrost_batch
*batch
)
656 if (batch
->tiler_heap
)
657 return batch
->tiler_heap
;
659 batch
->tiler_heap
= panfrost_batch_create_bo(batch
, 4096 * 4096,
662 PAN_BO_ACCESS_PRIVATE
|
664 PAN_BO_ACCESS_VERTEX_TILER
|
665 PAN_BO_ACCESS_FRAGMENT
);
666 assert(batch
->tiler_heap
);
667 return batch
->tiler_heap
;
671 panfrost_batch_get_tiler_dummy(struct panfrost_batch
*batch
)
673 if (batch
->tiler_dummy
)
674 return batch
->tiler_dummy
;
676 batch
->tiler_dummy
= panfrost_batch_create_bo(batch
, 4096,
678 PAN_BO_ACCESS_PRIVATE
|
680 PAN_BO_ACCESS_VERTEX_TILER
|
681 PAN_BO_ACCESS_FRAGMENT
);
682 assert(batch
->tiler_dummy
);
683 return batch
->tiler_dummy
;
687 panfrost_batch_draw_wallpaper(struct panfrost_batch
*batch
)
689 /* Color 0 is cleared, no need to draw the wallpaper.
690 * TODO: MRT wallpapers.
692 if (batch
->clear
& PIPE_CLEAR_COLOR0
)
695 /* Nothing to reload? TODO: MRT wallpapers */
696 if (batch
->key
.cbufs
[0] == NULL
)
699 /* No draw calls, and no clear on the depth/stencil bufs.
700 * Drawing the wallpaper would be useless.
702 if (!batch
->last_tiler
.gpu
&&
703 !(batch
->clear
& PIPE_CLEAR_DEPTHSTENCIL
))
706 /* Check if the buffer has any content on it worth preserving */
708 struct pipe_surface
*surf
= batch
->key
.cbufs
[0];
709 struct panfrost_resource
*rsrc
= pan_resource(surf
->texture
);
710 unsigned level
= surf
->u
.tex
.level
;
712 if (!rsrc
->slices
[level
].initialized
)
715 batch
->ctx
->wallpaper_batch
= batch
;
717 /* Clamp the rendering area to the damage extent. The
718 * KHR_partial_update() spec states that trying to render outside of
719 * the damage region is "undefined behavior", so we should be safe.
721 unsigned damage_width
= (rsrc
->damage
.extent
.maxx
- rsrc
->damage
.extent
.minx
);
722 unsigned damage_height
= (rsrc
->damage
.extent
.maxy
- rsrc
->damage
.extent
.miny
);
724 if (damage_width
&& damage_height
) {
725 panfrost_batch_intersection_scissor(batch
,
726 rsrc
->damage
.extent
.minx
,
727 rsrc
->damage
.extent
.miny
,
728 rsrc
->damage
.extent
.maxx
,
729 rsrc
->damage
.extent
.maxy
);
732 /* FIXME: Looks like aligning on a tile is not enough, but
733 * aligning on twice the tile size seems to works. We don't
734 * know exactly what happens here but this deserves extra
735 * investigation to figure it out.
737 batch
->minx
= batch
->minx
& ~((MALI_TILE_LENGTH
* 2) - 1);
738 batch
->miny
= batch
->miny
& ~((MALI_TILE_LENGTH
* 2) - 1);
739 batch
->maxx
= MIN2(ALIGN_POT(batch
->maxx
, MALI_TILE_LENGTH
* 2),
741 batch
->maxy
= MIN2(ALIGN_POT(batch
->maxy
, MALI_TILE_LENGTH
* 2),
744 struct pipe_scissor_state damage
;
745 struct pipe_box rects
[4];
747 /* Clamp the damage box to the rendering area. */
748 damage
.minx
= MAX2(batch
->minx
, rsrc
->damage
.biggest_rect
.x
);
749 damage
.miny
= MAX2(batch
->miny
, rsrc
->damage
.biggest_rect
.y
);
750 damage
.maxx
= MIN2(batch
->maxx
,
751 rsrc
->damage
.biggest_rect
.x
+
752 rsrc
->damage
.biggest_rect
.width
);
753 damage
.maxy
= MIN2(batch
->maxy
,
754 rsrc
->damage
.biggest_rect
.y
+
755 rsrc
->damage
.biggest_rect
.height
);
757 /* One damage rectangle means we can end up with at most 4 reload
759 * 1: left region, only exists if damage.x > 0
760 * 2: right region, only exists if damage.x + damage.width < fb->width
761 * 3: top region, only exists if damage.y > 0. The intersection with
762 * the left and right regions are dropped
763 * 4: bottom region, only exists if damage.y + damage.height < fb->height.
764 * The intersection with the left and right regions are dropped
766 * ____________________________
773 * |_______|___________|______|
775 u_box_2d(batch
->minx
, batch
->miny
, damage
.minx
- batch
->minx
,
776 batch
->maxy
- batch
->miny
, &rects
[0]);
777 u_box_2d(damage
.maxx
, batch
->miny
, batch
->maxx
- damage
.maxx
,
778 batch
->maxy
- batch
->miny
, &rects
[1]);
779 u_box_2d(damage
.minx
, batch
->miny
, damage
.maxx
- damage
.minx
,
780 damage
.miny
- batch
->miny
, &rects
[2]);
781 u_box_2d(damage
.minx
, damage
.maxy
, damage
.maxx
- damage
.minx
,
782 batch
->maxy
- damage
.maxy
, &rects
[3]);
784 for (unsigned i
= 0; i
< 4; i
++) {
785 /* Width and height are always >= 0 even if width is declared as a
786 * signed integer: u_box_2d() helper takes unsigned args and
787 * panfrost_set_damage_region() is taking care of clamping
790 if (!rects
[i
].width
|| !rects
[i
].height
)
793 /* Blit the wallpaper in */
794 panfrost_blit_wallpaper(batch
->ctx
, &rects
[i
]);
796 batch
->ctx
->wallpaper_batch
= NULL
;
800 panfrost_batch_submit_ioctl(struct panfrost_batch
*batch
,
801 mali_ptr first_job_desc
,
804 struct panfrost_context
*ctx
= batch
->ctx
;
805 struct pipe_context
*gallium
= (struct pipe_context
*) ctx
;
806 struct panfrost_screen
*screen
= pan_screen(gallium
->screen
);
807 struct drm_panfrost_submit submit
= {0,};
808 uint32_t *bo_handles
, *in_syncs
= NULL
;
809 bool is_fragment_shader
;
812 is_fragment_shader
= (reqs
& PANFROST_JD_REQ_FS
) && batch
->first_job
.gpu
;
813 if (is_fragment_shader
)
814 submit
.in_sync_count
= 1;
816 submit
.in_sync_count
= util_dynarray_num_elements(&batch
->dependencies
,
817 struct panfrost_batch_fence
*);
819 if (submit
.in_sync_count
) {
820 in_syncs
= calloc(submit
.in_sync_count
, sizeof(*in_syncs
));
824 /* The fragment job always depends on the vertex/tiler job if there's
827 if (is_fragment_shader
) {
828 in_syncs
[0] = batch
->out_sync
->syncobj
;
832 util_dynarray_foreach(&batch
->dependencies
,
833 struct panfrost_batch_fence
*, dep
)
834 in_syncs
[i
++] = (*dep
)->syncobj
;
837 submit
.in_syncs
= (uintptr_t)in_syncs
;
838 submit
.out_sync
= batch
->out_sync
->syncobj
;
839 submit
.jc
= first_job_desc
;
840 submit
.requirements
= reqs
;
842 bo_handles
= calloc(batch
->bos
->entries
, sizeof(*bo_handles
));
845 hash_table_foreach(batch
->bos
, entry
) {
846 struct panfrost_bo
*bo
= (struct panfrost_bo
*)entry
->key
;
847 uint32_t flags
= (uintptr_t)entry
->data
;
849 assert(bo
->gem_handle
> 0);
850 bo_handles
[submit
.bo_handle_count
++] = bo
->gem_handle
;
852 /* Update the BO access flags so that panfrost_bo_wait() knows
853 * about all pending accesses.
854 * We only keep the READ/WRITE info since this is all the BO
855 * wait logic cares about.
856 * We also preserve existing flags as this batch might not
857 * be the first one to access the BO.
859 bo
->gpu_access
|= flags
& (PAN_BO_ACCESS_RW
);
862 submit
.bo_handles
= (u64
) (uintptr_t) bo_handles
;
863 ret
= drmIoctl(screen
->fd
, DRM_IOCTL_PANFROST_SUBMIT
, &submit
);
868 fprintf(stderr
, "Error submitting: %m\n");
872 /* Trace the job if we're doing that */
873 if (pan_debug
& PAN_DBG_TRACE
) {
874 /* Wait so we can get errors reported back */
875 drmSyncobjWait(screen
->fd
, &batch
->out_sync
->syncobj
, 1,
877 pandecode_jc(submit
.jc
, FALSE
);
884 panfrost_batch_submit_jobs(struct panfrost_batch
*batch
)
886 bool has_draws
= batch
->first_job
.gpu
;
890 ret
= panfrost_batch_submit_ioctl(batch
, batch
->first_job
.gpu
, 0);
894 if (batch
->first_tiler
.gpu
|| batch
->clear
) {
895 mali_ptr fragjob
= panfrost_fragment_job(batch
, has_draws
);
897 ret
= panfrost_batch_submit_ioctl(batch
, fragjob
, PANFROST_JD_REQ_FS
);
905 panfrost_batch_submit(struct panfrost_batch
*batch
)
909 /* Submit the dependencies first. */
910 util_dynarray_foreach(&batch
->dependencies
,
911 struct panfrost_batch_fence
*, dep
) {
913 panfrost_batch_submit((*dep
)->batch
);
919 if (!batch
->last_job
.gpu
&& !batch
->clear
) {
920 /* Mark the fence as signaled so the fence logic does not try
923 batch
->out_sync
->signaled
= true;
927 panfrost_batch_draw_wallpaper(batch
);
929 panfrost_scoreboard_link_batch(batch
);
931 ret
= panfrost_batch_submit_jobs(batch
);
934 fprintf(stderr
, "panfrost_batch_submit failed: %d\n", ret
);
937 panfrost_freeze_batch(batch
);
938 panfrost_free_batch(batch
);
942 panfrost_flush_all_batches(struct panfrost_context
*ctx
, bool wait
)
944 struct util_dynarray fences
, syncobjs
;
947 util_dynarray_init(&fences
, NULL
);
948 util_dynarray_init(&syncobjs
, NULL
);
951 hash_table_foreach(ctx
->batches
, hentry
) {
952 struct panfrost_batch
*batch
= hentry
->data
;
957 panfrost_batch_fence_reference(batch
->out_sync
);
958 util_dynarray_append(&fences
, struct panfrost_batch_fence
*,
960 util_dynarray_append(&syncobjs
, uint32_t,
961 batch
->out_sync
->syncobj
);
964 panfrost_batch_submit(batch
);
967 assert(!ctx
->batches
->entries
);
969 /* Collect batch fences before returning */
970 panfrost_gc_fences(ctx
);
975 drmSyncobjWait(pan_screen(ctx
->base
.screen
)->fd
,
976 util_dynarray_begin(&syncobjs
),
977 util_dynarray_num_elements(&syncobjs
, uint32_t),
978 INT64_MAX
, DRM_SYNCOBJ_WAIT_FLAGS_WAIT_ALL
, NULL
);
980 util_dynarray_foreach(&fences
, struct panfrost_batch_fence
*, fence
)
981 panfrost_batch_fence_unreference(*fence
);
983 util_dynarray_fini(&fences
);
984 util_dynarray_fini(&syncobjs
);
988 panfrost_flush_batches_accessing_bo(struct panfrost_context
*ctx
,
989 struct panfrost_bo
*bo
,
990 uint32_t access_type
)
992 struct panfrost_bo_access
*access
;
993 struct hash_entry
*hentry
;
995 /* It doesn't make any to flush only the readers. */
996 assert(access_type
== PAN_BO_ACCESS_WRITE
||
997 access_type
== PAN_BO_ACCESS_RW
);
999 hentry
= _mesa_hash_table_search(ctx
->accessed_bos
, bo
);
1000 access
= hentry
? hentry
->data
: NULL
;
1004 if (access_type
& PAN_BO_ACCESS_WRITE
&& access
->writer
&&
1005 access
->writer
->batch
)
1006 panfrost_batch_submit(access
->writer
->batch
);
1008 if (!(access_type
& PAN_BO_ACCESS_READ
))
1011 util_dynarray_foreach(&access
->readers
, struct panfrost_batch_fence
*,
1013 if (*reader
&& (*reader
)->batch
)
1014 panfrost_batch_submit((*reader
)->batch
);
1019 panfrost_batch_set_requirements(struct panfrost_batch
*batch
)
1021 struct panfrost_context
*ctx
= batch
->ctx
;
1023 if (ctx
->rasterizer
&& ctx
->rasterizer
->base
.multisample
)
1024 batch
->requirements
|= PAN_REQ_MSAA
;
1026 if (ctx
->depth_stencil
&& ctx
->depth_stencil
->depth
.writemask
)
1027 batch
->requirements
|= PAN_REQ_DEPTH_WRITE
;
1030 /* Helper to smear a 32-bit color across 128-bit components */
1033 pan_pack_color_32(uint32_t *packed
, uint32_t v
)
1035 for (unsigned i
= 0; i
< 4; ++i
)
1040 pan_pack_color_64(uint32_t *packed
, uint32_t lo
, uint32_t hi
)
1042 for (unsigned i
= 0; i
< 4; i
+= 2) {
1049 pan_pack_color(uint32_t *packed
, const union pipe_color_union
*color
, enum pipe_format format
)
1051 /* Alpha magicked to 1.0 if there is no alpha */
1053 bool has_alpha
= util_format_has_alpha(format
);
1054 float clear_alpha
= has_alpha
? color
->f
[3] : 1.0f
;
1056 /* Packed color depends on the framebuffer format */
1058 const struct util_format_description
*desc
=
1059 util_format_description(format
);
1061 if (util_format_is_rgba8_variant(desc
)) {
1062 pan_pack_color_32(packed
,
1063 (float_to_ubyte(clear_alpha
) << 24) |
1064 (float_to_ubyte(color
->f
[2]) << 16) |
1065 (float_to_ubyte(color
->f
[1]) << 8) |
1066 (float_to_ubyte(color
->f
[0]) << 0));
1067 } else if (format
== PIPE_FORMAT_B5G6R5_UNORM
) {
1068 /* First, we convert the components to R5, G6, B5 separately */
1069 unsigned r5
= CLAMP(color
->f
[0], 0.0, 1.0) * 31.0;
1070 unsigned g6
= CLAMP(color
->f
[1], 0.0, 1.0) * 63.0;
1071 unsigned b5
= CLAMP(color
->f
[2], 0.0, 1.0) * 31.0;
1073 /* Then we pack into a sparse u32. TODO: Why these shifts? */
1074 pan_pack_color_32(packed
, (b5
<< 25) | (g6
<< 14) | (r5
<< 5));
1075 } else if (format
== PIPE_FORMAT_B4G4R4A4_UNORM
) {
1076 /* We scale the components against 0xF0 (=240.0), rather than 0xFF */
1077 unsigned r4
= CLAMP(color
->f
[0], 0.0, 1.0) * 240.0;
1078 unsigned g4
= CLAMP(color
->f
[1], 0.0, 1.0) * 240.0;
1079 unsigned b4
= CLAMP(color
->f
[2], 0.0, 1.0) * 240.0;
1080 unsigned a4
= CLAMP(clear_alpha
, 0.0, 1.0) * 240.0;
1082 /* Pack on *byte* intervals */
1083 pan_pack_color_32(packed
, (a4
<< 24) | (b4
<< 16) | (g4
<< 8) | r4
);
1084 } else if (format
== PIPE_FORMAT_B5G5R5A1_UNORM
) {
1085 /* Scale as expected but shift oddly */
1086 unsigned r5
= round(CLAMP(color
->f
[0], 0.0, 1.0)) * 31.0;
1087 unsigned g5
= round(CLAMP(color
->f
[1], 0.0, 1.0)) * 31.0;
1088 unsigned b5
= round(CLAMP(color
->f
[2], 0.0, 1.0)) * 31.0;
1089 unsigned a1
= round(CLAMP(clear_alpha
, 0.0, 1.0)) * 1.0;
1091 pan_pack_color_32(packed
, (a1
<< 31) | (b5
<< 25) | (g5
<< 15) | (r5
<< 5));
1093 /* Try Gallium's generic default path. Doesn't work for all
1094 * formats but it's a good guess. */
1096 union util_color out
;
1098 if (util_format_is_pure_integer(format
)) {
1099 memcpy(out
.ui
, color
->ui
, 16);
1101 util_pack_color(color
->f
, format
, &out
);
1104 unsigned size
= util_format_get_blocksize(format
);
1107 unsigned b
= out
.ui
[0];
1108 unsigned s
= b
| (b
<< 8);
1109 pan_pack_color_32(packed
, s
| (s
<< 16));
1110 } else if (size
== 2)
1111 pan_pack_color_32(packed
, out
.ui
[0] | (out
.ui
[0] << 16));
1112 else if (size
== 3 || size
== 4)
1113 pan_pack_color_32(packed
, out
.ui
[0]);
1115 pan_pack_color_64(packed
, out
.ui
[0], out
.ui
[1]);
1116 else if (size
== 16)
1117 memcpy(packed
, out
.ui
, 16);
1119 unreachable("Unknown generic format size packing clear colour");
1124 panfrost_batch_clear(struct panfrost_batch
*batch
,
1126 const union pipe_color_union
*color
,
1127 double depth
, unsigned stencil
)
1129 struct panfrost_context
*ctx
= batch
->ctx
;
1131 if (buffers
& PIPE_CLEAR_COLOR
) {
1132 for (unsigned i
= 0; i
< PIPE_MAX_COLOR_BUFS
; ++i
) {
1133 if (!(buffers
& (PIPE_CLEAR_COLOR0
<< i
)))
1136 enum pipe_format format
= ctx
->pipe_framebuffer
.cbufs
[i
]->format
;
1137 pan_pack_color(batch
->clear_color
[i
], color
, format
);
1141 if (buffers
& PIPE_CLEAR_DEPTH
) {
1142 batch
->clear_depth
= depth
;
1145 if (buffers
& PIPE_CLEAR_STENCIL
) {
1146 batch
->clear_stencil
= stencil
;
1149 batch
->clear
|= buffers
;
1151 /* Clearing affects the entire framebuffer (by definition -- this is
1152 * the Gallium clear callback, which clears the whole framebuffer. If
1153 * the scissor test were enabled from the GL side, the state tracker
1154 * would emit a quad instead and we wouldn't go down this code path) */
1156 panfrost_batch_union_scissor(batch
, 0, 0,
1157 ctx
->pipe_framebuffer
.width
,
1158 ctx
->pipe_framebuffer
.height
);
1162 panfrost_batch_compare(const void *a
, const void *b
)
1164 return util_framebuffer_state_equal(a
, b
);
1168 panfrost_batch_hash(const void *key
)
1170 return _mesa_hash_data(key
, sizeof(struct pipe_framebuffer_state
));
1173 /* Given a new bounding rectangle (scissor), let the job cover the union of the
1174 * new and old bounding rectangles */
1177 panfrost_batch_union_scissor(struct panfrost_batch
*batch
,
1178 unsigned minx
, unsigned miny
,
1179 unsigned maxx
, unsigned maxy
)
1181 batch
->minx
= MIN2(batch
->minx
, minx
);
1182 batch
->miny
= MIN2(batch
->miny
, miny
);
1183 batch
->maxx
= MAX2(batch
->maxx
, maxx
);
1184 batch
->maxy
= MAX2(batch
->maxy
, maxy
);
1188 panfrost_batch_intersection_scissor(struct panfrost_batch
*batch
,
1189 unsigned minx
, unsigned miny
,
1190 unsigned maxx
, unsigned maxy
)
1192 batch
->minx
= MAX2(batch
->minx
, minx
);
1193 batch
->miny
= MAX2(batch
->miny
, miny
);
1194 batch
->maxx
= MIN2(batch
->maxx
, maxx
);
1195 batch
->maxy
= MIN2(batch
->maxy
, maxy
);
1198 /* Are we currently rendering to the screen (rather than an FBO)? */
1201 panfrost_batch_is_scanout(struct panfrost_batch
*batch
)
1203 /* If there is no color buffer, it's an FBO */
1204 if (batch
->key
.nr_cbufs
!= 1)
1207 /* If we're too early that no framebuffer was sent, it's scanout */
1208 if (!batch
->key
.cbufs
[0])
1211 return batch
->key
.cbufs
[0]->texture
->bind
& PIPE_BIND_DISPLAY_TARGET
||
1212 batch
->key
.cbufs
[0]->texture
->bind
& PIPE_BIND_SCANOUT
||
1213 batch
->key
.cbufs
[0]->texture
->bind
& PIPE_BIND_SHARED
;
1217 panfrost_batch_init(struct panfrost_context
*ctx
)
1219 ctx
->batches
= _mesa_hash_table_create(ctx
,
1220 panfrost_batch_hash
,
1221 panfrost_batch_compare
);
1222 ctx
->accessed_bos
= _mesa_hash_table_create(ctx
, _mesa_hash_pointer
,
1223 _mesa_key_pointer_equal
);