2 * Copyright (C) 2017-2019 Alyssa Rosenzweig
3 * Copyright (C) 2017-2019 Connor Abbott
4 * Copyright (C) 2019 Collabora, Ltd.
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * copy of this software and associated documentation files (the "Software"),
8 * to deal in the Software without restriction, including without limitation
9 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
10 * and/or sell copies of the Software, and to permit persons to whom the
11 * Software is furnished to do so, subject to the following conditions:
13 * The above copyright notice and this permission notice (including the next
14 * paragraph) shall be included in all copies or substantial portions of the
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
18 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
20 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
21 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
22 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
26 #include <panfrost-job.h>
33 #include "util/macros.h"
34 #include "util/u_math.h"
36 #include "pan_pretty_print.h"
37 #include "midgard/disassemble.h"
38 #include "bifrost/disassemble.h"
40 #include "pan_encoder.h"
42 int pandecode_jc(mali_ptr jc_gpu_va
, bool bifrost
);
44 #define MEMORY_PROP(obj, p) {\
46 char *a = pointer_as_memory_reference(obj->p); \
47 pandecode_prop("%s = %s", #p, a); \
52 #define MEMORY_PROP_DIR(obj, p) {\
54 char *a = pointer_as_memory_reference(obj.p); \
55 pandecode_prop("%s = %s", #p, a); \
60 /* Semantic logging type.
62 * Raw: for raw messages to be printed as is.
63 * Message: for helpful information to be commented out in replays.
64 * Property: for properties of a struct
66 * Use one of pandecode_log, pandecode_msg, or pandecode_prop as syntax sugar.
69 enum pandecode_log_type
{
75 #define pandecode_log(...) pandecode_log_typed(PANDECODE_RAW, __VA_ARGS__)
76 #define pandecode_msg(...) pandecode_log_typed(PANDECODE_MESSAGE, __VA_ARGS__)
77 #define pandecode_prop(...) pandecode_log_typed(PANDECODE_PROPERTY, __VA_ARGS__)
79 unsigned pandecode_indent
= 0;
82 pandecode_make_indent(void)
84 for (unsigned i
= 0; i
< pandecode_indent
; ++i
)
89 pandecode_log_typed(enum pandecode_log_type type
, const char *format
, ...)
93 pandecode_make_indent();
95 if (type
== PANDECODE_MESSAGE
)
97 else if (type
== PANDECODE_PROPERTY
)
100 va_start(ap
, format
);
104 if (type
== PANDECODE_PROPERTY
)
109 pandecode_log_cont(const char *format
, ...)
113 va_start(ap
, format
);
118 /* To check for memory safety issues, validates that the given pointer in GPU
119 * memory is valid, containing at least sz bytes. The goal is to eliminate
120 * GPU-side memory bugs (NULL pointer dereferences, buffer overflows, or buffer
121 * overruns) by statically validating pointers.
125 pandecode_validate_buffer(mali_ptr addr
, size_t sz
)
128 pandecode_msg("XXX: null pointer deref");
134 struct pandecode_mapped_memory
*bo
=
135 pandecode_find_mapped_gpu_mem_containing(addr
);
138 pandecode_msg("XXX: invalid memory dereference\n");
144 unsigned offset
= addr
- bo
->gpu_va
;
145 unsigned total
= offset
+ sz
;
147 if (total
> bo
->length
) {
148 pandecode_msg("XXX: buffer overrun."
149 "Chunk of size %d at offset %d in buffer of size %d. "
150 "Overrun by %d bytes.",
151 sz
, offset
, bo
->length
, total
- bo
->length
);
156 struct pandecode_flag_info
{
162 pandecode_log_decoded_flags(const struct pandecode_flag_info
*flag_info
,
165 bool decodable_flags_found
= false;
167 for (int i
= 0; flag_info
[i
].name
; i
++) {
168 if ((flags
& flag_info
[i
].flag
) != flag_info
[i
].flag
)
171 if (!decodable_flags_found
) {
172 decodable_flags_found
= true;
174 pandecode_log_cont(" | ");
177 pandecode_log_cont("%s", flag_info
[i
].name
);
179 flags
&= ~flag_info
[i
].flag
;
182 if (decodable_flags_found
) {
184 pandecode_log_cont(" | 0x%" PRIx64
, flags
);
186 pandecode_log_cont("0x%" PRIx64
, flags
);
190 #define FLAG_INFO(flag) { MALI_##flag, "MALI_" #flag }
191 static const struct pandecode_flag_info gl_enable_flag_info
[] = {
192 FLAG_INFO(OCCLUSION_QUERY
),
193 FLAG_INFO(OCCLUSION_PRECISE
),
194 FLAG_INFO(FRONT_CCW_TOP
),
195 FLAG_INFO(CULL_FACE_FRONT
),
196 FLAG_INFO(CULL_FACE_BACK
),
201 #define FLAG_INFO(flag) { MALI_CLEAR_##flag, "MALI_CLEAR_" #flag }
202 static const struct pandecode_flag_info clear_flag_info
[] = {
205 FLAG_INFO(SLOW_STENCIL
),
210 #define FLAG_INFO(flag) { MALI_MASK_##flag, "MALI_MASK_" #flag }
211 static const struct pandecode_flag_info mask_flag_info
[] = {
220 #define FLAG_INFO(flag) { MALI_##flag, "MALI_" #flag }
221 static const struct pandecode_flag_info u3_flag_info
[] = {
223 FLAG_INFO(CAN_DISCARD
),
224 FLAG_INFO(HAS_BLEND_SHADER
),
225 FLAG_INFO(DEPTH_TEST
),
229 static const struct pandecode_flag_info u4_flag_info
[] = {
231 FLAG_INFO(NO_DITHER
),
232 FLAG_INFO(DEPTH_RANGE_A
),
233 FLAG_INFO(DEPTH_RANGE_B
),
234 FLAG_INFO(STENCIL_TEST
),
235 FLAG_INFO(SAMPLE_ALPHA_TO_COVERAGE_NO_BLEND_SHADER
),
240 #define FLAG_INFO(flag) { MALI_FRAMEBUFFER_##flag, "MALI_FRAMEBUFFER_" #flag }
241 static const struct pandecode_flag_info fb_fmt_flag_info
[] = {
249 #define FLAG_INFO(flag) { MALI_MFBD_FORMAT_##flag, "MALI_MFBD_FORMAT_" #flag }
250 static const struct pandecode_flag_info mfbd_fmt_flag_info
[] = {
257 #define FLAG_INFO(flag) { MALI_EXTRA_##flag, "MALI_EXTRA_" #flag }
258 static const struct pandecode_flag_info mfbd_extra_flag_info
[] = {
266 #define FLAG_INFO(flag) { MALI_##flag, "MALI_" #flag }
267 static const struct pandecode_flag_info shader_midgard1_flag_info
[] = {
269 FLAG_INFO(HELPER_INVOCATIONS
),
270 FLAG_INFO(READS_TILEBUFFER
),
276 #define FLAG_INFO(flag) { MALI_MFBD_##flag, "MALI_MFBD_" #flag }
277 static const struct pandecode_flag_info mfbd_flag_info
[] = {
278 FLAG_INFO(DEPTH_WRITE
),
284 #define FLAG_INFO(flag) { MALI_SAMP_##flag, "MALI_SAMP_" #flag }
285 static const struct pandecode_flag_info sampler_flag_info
[] = {
286 FLAG_INFO(MAG_NEAREST
),
287 FLAG_INFO(MIN_NEAREST
),
288 FLAG_INFO(MIP_LINEAR_1
),
289 FLAG_INFO(MIP_LINEAR_2
),
290 FLAG_INFO(NORM_COORDS
),
295 extern char *replace_fragment
;
296 extern char *replace_vertex
;
299 pandecode_job_type(enum mali_job_type type
)
301 #define DEFINE_CASE(name) case JOB_TYPE_ ## name: return "JOB_TYPE_" #name
305 DEFINE_CASE(SET_VALUE
);
306 DEFINE_CASE(CACHE_FLUSH
);
307 DEFINE_CASE(COMPUTE
);
311 DEFINE_CASE(FRAGMENT
);
313 case JOB_NOT_STARTED
:
314 return "NOT_STARTED";
317 pandecode_log("Warning! Unknown job type %x\n", type
);
325 pandecode_draw_mode(enum mali_draw_mode mode
)
327 #define DEFINE_CASE(name) case MALI_ ## name: return "MALI_" #name
330 DEFINE_CASE(DRAW_NONE
);
333 DEFINE_CASE(TRIANGLES
);
334 DEFINE_CASE(TRIANGLE_STRIP
);
335 DEFINE_CASE(TRIANGLE_FAN
);
336 DEFINE_CASE(LINE_STRIP
);
337 DEFINE_CASE(LINE_LOOP
);
338 DEFINE_CASE(POLYGON
);
340 DEFINE_CASE(QUAD_STRIP
);
343 pandecode_msg("XXX: invalid draw mode %X\n", mode
);
350 #define DEFINE_CASE(name) case MALI_FUNC_ ## name: return "MALI_FUNC_" #name
352 pandecode_func(enum mali_func mode
)
359 DEFINE_CASE(GREATER
);
360 DEFINE_CASE(NOTEQUAL
);
365 pandecode_msg("XXX: invalid func %X\n", mode
);
371 /* Why is this duplicated? Who knows... */
372 #define DEFINE_CASE(name) case MALI_ALT_FUNC_ ## name: return "MALI_ALT_FUNC_" #name
374 pandecode_alt_func(enum mali_alt_func mode
)
381 DEFINE_CASE(GREATER
);
382 DEFINE_CASE(NOTEQUAL
);
387 pandecode_msg("XXX: invalid alt func %X\n", mode
);
393 #define DEFINE_CASE(name) case MALI_STENCIL_ ## name: return "MALI_STENCIL_" #name
395 pandecode_stencil_op(enum mali_stencil_op op
)
399 DEFINE_CASE(REPLACE
);
402 DEFINE_CASE(INCR_WRAP
);
403 DEFINE_CASE(DECR_WRAP
);
408 pandecode_msg("XXX: invalid stencil op %X\n", op
);
415 #define DEFINE_CASE(name) case MALI_ATTR_ ## name: return "MALI_ATTR_" #name
416 static char *pandecode_attr_mode(enum mali_attr_mode mode
)
421 DEFINE_CASE(POT_DIVIDE
);
423 DEFINE_CASE(NPOT_DIVIDE
);
425 DEFINE_CASE(INTERNAL
);
427 pandecode_msg("XXX: invalid attribute mode %X\n", mode
);
434 #define DEFINE_CASE(name) case MALI_CHANNEL_## name: return "MALI_CHANNEL_" #name
436 pandecode_channel(enum mali_channel channel
)
447 pandecode_msg("XXX: invalid channel %X\n", channel
);
453 #define DEFINE_CASE(name) case MALI_WRAP_## name: return "MALI_WRAP_" #name
455 pandecode_wrap_mode(enum mali_wrap_mode op
)
459 DEFINE_CASE(CLAMP_TO_EDGE
);
460 DEFINE_CASE(CLAMP_TO_BORDER
);
461 DEFINE_CASE(MIRRORED_REPEAT
);
464 pandecode_msg("XXX: invalid wrap mode %X\n", op
);
470 #define DEFINE_CASE(name) case MALI_TEX_## name: return "MALI_TEX_" #name
472 pandecode_texture_type(enum mali_texture_type type
)
481 unreachable("Unknown case");
486 #define DEFINE_CASE(name) case MALI_MFBD_BLOCK_## name: return "MALI_MFBD_BLOCK_" #name
488 pandecode_mfbd_block_format(enum mali_mfbd_block_format fmt
)
492 DEFINE_CASE(UNKNOWN
);
497 unreachable("Invalid case");
502 #define DEFINE_CASE(name) case MALI_EXCEPTION_ACCESS_## name: return ""#name
504 pandecode_exception_access(enum mali_exception_access access
)
508 DEFINE_CASE(EXECUTE
);
513 unreachable("Invalid case");
518 /* Midgard's tiler descriptor is embedded within the
522 pandecode_midgard_tiler_descriptor(
523 const struct midgard_tiler_descriptor
*t
,
528 pandecode_log(".tiler = {\n");
531 if (t
->hierarchy_mask
== MALI_TILER_DISABLED
)
532 pandecode_prop("hierarchy_mask = MALI_TILER_DISABLED");
534 pandecode_prop("hierarchy_mask = 0x%" PRIx16
, t
->hierarchy_mask
);
536 /* We know this name from the kernel, but we never see it nonzero */
539 pandecode_msg("XXX: unexpected tiler flags 0x%" PRIx16
, t
->flags
);
541 MEMORY_PROP(t
, polygon_list
);
543 /* The body is offset from the base of the polygon list */
544 assert(t
->polygon_list_body
> t
->polygon_list
);
545 unsigned body_offset
= t
->polygon_list_body
- t
->polygon_list
;
547 /* It needs to fit inside the reported size */
548 assert(t
->polygon_list_size
>= body_offset
);
550 /* Check that we fit */
551 struct pandecode_mapped_memory
*plist
=
552 pandecode_find_mapped_gpu_mem_containing(t
->polygon_list
);
554 assert(t
->polygon_list_size
<= plist
->length
);
556 /* Now that we've sanity checked, we'll try to calculate the sizes
557 * ourselves for comparison */
559 unsigned ref_header
= panfrost_tiler_header_size(width
, height
, t
->hierarchy_mask
);
560 unsigned ref_size
= panfrost_tiler_full_size(width
, height
, t
->hierarchy_mask
);
562 if (!((ref_header
== body_offset
) && (ref_size
== t
->polygon_list_size
))) {
563 pandecode_msg("XXX: bad polygon list size (expected %d / 0x%x)\n",
564 ref_header
, ref_size
);
565 pandecode_prop("polygon_list_size = 0x%x", t
->polygon_list_size
);
566 pandecode_msg("body offset %d\n", body_offset
);
569 /* The tiler heap has a start and end specified -- it should be
570 * identical to what we have in the BO. The exception is if tiling is
573 MEMORY_PROP(t
, heap_start
);
574 assert(t
->heap_end
>= t
->heap_start
);
576 struct pandecode_mapped_memory
*heap
=
577 pandecode_find_mapped_gpu_mem_containing(t
->heap_start
);
579 unsigned heap_size
= t
->heap_end
- t
->heap_start
;
581 /* Tiling is enabled with a special flag */
582 unsigned hierarchy_mask
= t
->hierarchy_mask
& MALI_HIERARCHY_MASK
;
583 unsigned tiler_flags
= t
->hierarchy_mask
^ hierarchy_mask
;
585 bool tiling_enabled
= hierarchy_mask
;
587 if (tiling_enabled
) {
588 /* When tiling is enabled, the heap should be a tight fit */
589 unsigned heap_offset
= t
->heap_start
- heap
->gpu_va
;
590 if ((heap_offset
+ heap_size
) != heap
->length
) {
591 pandecode_msg("XXX: heap size %d (expected %d)\n",
592 heap_size
, heap
->length
- heap_offset
);
595 /* We should also have no other flags */
597 pandecode_msg("XXX: unexpected tiler %X\n", tiler_flags
);
599 /* When tiling is disabled, we should have that flag and no others */
601 if (tiler_flags
!= MALI_TILER_DISABLED
) {
602 pandecode_msg("XXX: unexpected tiler flag %X, expected MALI_TILER_DISABLED\n",
606 /* We should also have an empty heap */
608 pandecode_msg("XXX: tiler heap size %d given, expected empty\n",
612 /* Disabled tiling is used only for clear-only jobs, which are
613 * purely FRAGMENT, so we should never see this for
614 * non-FRAGMENT descriptors. */
617 pandecode_msg("XXX: tiler disabled for non-FRAGMENT job\n");
620 /* We've never seen weights used in practice, but we know from the
621 * kernel these fields is there */
623 bool nonzero_weights
= false;
625 for (unsigned w
= 0; w
< ARRAY_SIZE(t
->weights
); ++w
) {
626 nonzero_weights
|= t
->weights
[w
] != 0x0;
629 if (nonzero_weights
) {
630 pandecode_log(".weights = {");
632 for (unsigned w
= 0; w
< ARRAY_SIZE(t
->weights
); ++w
) {
633 pandecode_log("%d, ", t
->weights
[w
]);
640 pandecode_log("}\n");
644 pandecode_sfbd(uint64_t gpu_va
, int job_no
, bool is_fragment
)
646 struct pandecode_mapped_memory
*mem
= pandecode_find_mapped_gpu_mem_containing(gpu_va
);
647 const struct mali_single_framebuffer
*PANDECODE_PTR_VAR(s
, mem
, (mali_ptr
) gpu_va
);
649 pandecode_log("struct mali_single_framebuffer framebuffer_%"PRIx64
"_%d = {\n", gpu_va
, job_no
);
652 pandecode_prop("unknown1 = 0x%" PRIx32
, s
->unknown1
);
653 pandecode_prop("unknown2 = 0x%" PRIx32
, s
->unknown2
);
655 pandecode_log(".format = ");
656 pandecode_log_decoded_flags(fb_fmt_flag_info
, s
->format
);
657 pandecode_log_cont(",\n");
659 pandecode_prop("width = MALI_POSITIVE(%" PRId16
")", s
->width
+ 1);
660 pandecode_prop("height = MALI_POSITIVE(%" PRId16
")", s
->height
+ 1);
662 MEMORY_PROP(s
, framebuffer
);
663 pandecode_prop("stride = %d", s
->stride
);
665 /* Earlier in the actual commandstream -- right before width -- but we
666 * delay to flow nicer */
668 pandecode_log(".clear_flags = ");
669 pandecode_log_decoded_flags(clear_flag_info
, s
->clear_flags
);
670 pandecode_log_cont(",\n");
672 if (s
->depth_buffer
| s
->depth_buffer_enable
) {
673 MEMORY_PROP(s
, depth_buffer
);
674 pandecode_prop("depth_buffer_enable = %s", DS_ENABLE(s
->depth_buffer_enable
));
677 if (s
->stencil_buffer
| s
->stencil_buffer_enable
) {
678 MEMORY_PROP(s
, stencil_buffer
);
679 pandecode_prop("stencil_buffer_enable = %s", DS_ENABLE(s
->stencil_buffer_enable
));
682 if (s
->clear_color_1
| s
->clear_color_2
| s
->clear_color_3
| s
->clear_color_4
) {
683 pandecode_prop("clear_color_1 = 0x%" PRIx32
, s
->clear_color_1
);
684 pandecode_prop("clear_color_2 = 0x%" PRIx32
, s
->clear_color_2
);
685 pandecode_prop("clear_color_3 = 0x%" PRIx32
, s
->clear_color_3
);
686 pandecode_prop("clear_color_4 = 0x%" PRIx32
, s
->clear_color_4
);
689 if (s
->clear_depth_1
!= 0 || s
->clear_depth_2
!= 0 || s
->clear_depth_3
!= 0 || s
->clear_depth_4
!= 0) {
690 pandecode_prop("clear_depth_1 = %f", s
->clear_depth_1
);
691 pandecode_prop("clear_depth_2 = %f", s
->clear_depth_2
);
692 pandecode_prop("clear_depth_3 = %f", s
->clear_depth_3
);
693 pandecode_prop("clear_depth_4 = %f", s
->clear_depth_4
);
696 if (s
->clear_stencil
) {
697 pandecode_prop("clear_stencil = 0x%x", s
->clear_stencil
);
700 MEMORY_PROP(s
, unknown_address_0
);
701 const struct midgard_tiler_descriptor t
= s
->tiler
;
702 pandecode_midgard_tiler_descriptor(&t
, s
->width
+ 1, s
->height
+ 1, is_fragment
);
705 pandecode_log("};\n");
707 pandecode_prop("zero0 = 0x%" PRIx64
, s
->zero0
);
708 pandecode_prop("zero1 = 0x%" PRIx64
, s
->zero1
);
709 pandecode_prop("zero2 = 0x%" PRIx32
, s
->zero2
);
710 pandecode_prop("zero4 = 0x%" PRIx32
, s
->zero4
);
712 printf(".zero3 = {");
714 for (int i
= 0; i
< sizeof(s
->zero3
) / sizeof(s
->zero3
[0]); ++i
)
715 printf("%X, ", s
->zero3
[i
]);
719 printf(".zero6 = {");
721 for (int i
= 0; i
< sizeof(s
->zero6
) / sizeof(s
->zero6
[0]); ++i
)
722 printf("%X, ", s
->zero6
[i
]);
728 pandecode_u32_slide(unsigned name
, const u32
*slide
, unsigned count
)
730 pandecode_log(".unknown%d = {", name
);
732 for (int i
= 0; i
< count
; ++i
)
733 printf("%X, ", slide
[i
]);
735 pandecode_log("},\n");
738 #define SHORT_SLIDE(num) \
739 pandecode_u32_slide(num, s->unknown ## num, ARRAY_SIZE(s->unknown ## num))
742 pandecode_compute_fbd(uint64_t gpu_va
, int job_no
)
744 struct pandecode_mapped_memory
*mem
= pandecode_find_mapped_gpu_mem_containing(gpu_va
);
745 const struct mali_compute_fbd
*PANDECODE_PTR_VAR(s
, mem
, (mali_ptr
) gpu_va
);
747 pandecode_log("struct mali_compute_fbd framebuffer_%"PRIx64
"_%d = {\n", gpu_va
, job_no
);
757 pandecode_swizzle(unsigned swizzle
)
759 pandecode_prop("swizzle = %s | (%s << 3) | (%s << 6) | (%s << 9)",
760 pandecode_channel((swizzle
>> 0) & 0x7),
761 pandecode_channel((swizzle
>> 3) & 0x7),
762 pandecode_channel((swizzle
>> 6) & 0x7),
763 pandecode_channel((swizzle
>> 9) & 0x7));
767 pandecode_rt_format(struct mali_rt_format format
)
769 pandecode_log(".format = {\n");
772 pandecode_prop("unk1 = 0x%" PRIx32
, format
.unk1
);
773 pandecode_prop("unk2 = 0x%" PRIx32
, format
.unk2
);
774 pandecode_prop("unk3 = 0x%" PRIx32
, format
.unk3
);
776 pandecode_prop("block = %s",
777 pandecode_mfbd_block_format(format
.block
));
779 pandecode_prop("nr_channels = MALI_POSITIVE(%d)",
780 MALI_NEGATIVE(format
.nr_channels
));
782 pandecode_log(".flags = ");
783 pandecode_log_decoded_flags(mfbd_fmt_flag_info
, format
.flags
);
784 pandecode_log_cont(",\n");
786 pandecode_swizzle(format
.swizzle
);
788 /* In theory, the no_preload bit can be cleared to enable MFBD preload,
789 * which is a faster hardware-based alternative to the wallpaper method
790 * to preserve framebuffer contents across frames. In practice, MFBD
791 * preload is buggy on Midgard, and so this is a chicken bit. If this
792 * bit isn't set, most likely something broke unrelated to preload */
794 if (!format
.no_preload
) {
795 pandecode_msg("XXX: buggy MFBD preload enabled - chicken bit should be clear\n");
796 pandecode_prop("no_preload = 0x%" PRIx32
, format
.no_preload
);
800 pandecode_prop("zero = 0x%" PRIx32
, format
.zero
);
803 pandecode_log("},\n");
807 pandecode_render_target(uint64_t gpu_va
, unsigned job_no
, const struct bifrost_framebuffer
*fb
)
809 pandecode_log("struct bifrost_render_target rts_list_%"PRIx64
"_%d[] = {\n", gpu_va
, job_no
);
812 for (int i
= 0; i
< MALI_NEGATIVE(fb
->rt_count_1
); i
++) {
813 mali_ptr rt_va
= gpu_va
+ i
* sizeof(struct bifrost_render_target
);
814 struct pandecode_mapped_memory
*mem
=
815 pandecode_find_mapped_gpu_mem_containing(rt_va
);
816 const struct bifrost_render_target
*PANDECODE_PTR_VAR(rt
, mem
, (mali_ptr
) rt_va
);
818 pandecode_log("{\n");
821 pandecode_rt_format(rt
->format
);
823 if (rt
->format
.block
== MALI_MFBD_BLOCK_AFBC
) {
824 pandecode_log(".afbc = {\n");
827 char *a
= pointer_as_memory_reference(rt
->afbc
.metadata
);
828 pandecode_prop("metadata = %s", a
);
831 pandecode_prop("stride = %d", rt
->afbc
.stride
);
832 pandecode_prop("unk = 0x%" PRIx32
, rt
->afbc
.unk
);
835 pandecode_log("},\n");
836 } else if (rt
->afbc
.metadata
|| rt
->afbc
.stride
|| rt
->afbc
.unk
) {
837 pandecode_msg("XXX: AFBC disabled but AFBC field set (0x%lX, 0x%x, 0x%x)\n",
843 MEMORY_PROP(rt
, framebuffer
);
844 pandecode_prop("framebuffer_stride = %d", rt
->framebuffer_stride
);
846 if (rt
->clear_color_1
| rt
->clear_color_2
| rt
->clear_color_3
| rt
->clear_color_4
) {
847 pandecode_prop("clear_color_1 = 0x%" PRIx32
, rt
->clear_color_1
);
848 pandecode_prop("clear_color_2 = 0x%" PRIx32
, rt
->clear_color_2
);
849 pandecode_prop("clear_color_3 = 0x%" PRIx32
, rt
->clear_color_3
);
850 pandecode_prop("clear_color_4 = 0x%" PRIx32
, rt
->clear_color_4
);
853 if (rt
->zero1
|| rt
->zero2
|| rt
->zero3
) {
854 pandecode_msg("XXX: render target zeros tripped\n");
855 pandecode_prop("zero1 = 0x%" PRIx64
, rt
->zero1
);
856 pandecode_prop("zero2 = 0x%" PRIx32
, rt
->zero2
);
857 pandecode_prop("zero3 = 0x%" PRIx32
, rt
->zero3
);
861 pandecode_log("},\n");
865 pandecode_log("};\n");
869 pandecode_mfbd_bfr(uint64_t gpu_va
, int job_no
, bool is_fragment
)
871 struct pandecode_mapped_memory
*mem
= pandecode_find_mapped_gpu_mem_containing(gpu_va
);
872 const struct bifrost_framebuffer
*PANDECODE_PTR_VAR(fb
, mem
, (mali_ptr
) gpu_va
);
874 if (fb
->sample_locations
) {
875 /* The blob stores all possible sample locations in a single buffer
876 * allocated on startup, and just switches the pointer when switching
877 * MSAA state. For now, we just put the data into the cmdstream, but we
878 * should do something like what the blob does with a real driver.
880 * There seem to be 32 slots for sample locations, followed by another
881 * 16. The second 16 is just the center location followed by 15 zeros
882 * in all the cases I've identified (maybe shader vs. depth/color
886 struct pandecode_mapped_memory
*smem
= pandecode_find_mapped_gpu_mem_containing(fb
->sample_locations
);
888 const u16
*PANDECODE_PTR_VAR(samples
, smem
, fb
->sample_locations
);
890 pandecode_log("uint16_t sample_locations_%d[] = {\n", job_no
);
893 for (int i
= 0; i
< 32 + 16; i
++) {
894 pandecode_log("%d, %d,\n", samples
[2 * i
], samples
[2 * i
+ 1]);
898 pandecode_log("};\n");
901 pandecode_log("struct bifrost_framebuffer framebuffer_%"PRIx64
"_%d = {\n", gpu_va
, job_no
);
904 pandecode_prop("unk0 = 0x%x", fb
->unk0
);
906 if (fb
->sample_locations
)
907 pandecode_prop("sample_locations = sample_locations_%d", job_no
);
909 /* Assume that unknown1 was emitted in the last job for
911 MEMORY_PROP(fb
, unknown1
);
913 pandecode_prop("width1 = MALI_POSITIVE(%d)", fb
->width1
+ 1);
914 pandecode_prop("height1 = MALI_POSITIVE(%d)", fb
->height1
+ 1);
915 pandecode_prop("width2 = MALI_POSITIVE(%d)", fb
->width2
+ 1);
916 pandecode_prop("height2 = MALI_POSITIVE(%d)", fb
->height2
+ 1);
918 pandecode_prop("unk1 = 0x%x", fb
->unk1
);
919 pandecode_prop("unk2 = 0x%x", fb
->unk2
);
920 pandecode_prop("rt_count_1 = MALI_POSITIVE(%d)", fb
->rt_count_1
+ 1);
921 pandecode_prop("rt_count_2 = %d", fb
->rt_count_2
);
923 pandecode_log(".mfbd_flags = ");
924 pandecode_log_decoded_flags(mfbd_flag_info
, fb
->mfbd_flags
);
925 pandecode_log_cont(",\n");
927 if (fb
->clear_stencil
)
928 pandecode_prop("clear_stencil = 0x%x", fb
->clear_stencil
);
931 pandecode_prop("clear_depth = %f", fb
->clear_depth
);
933 /* TODO: What is this? Let's not blow up.. */
934 if (fb
->unknown2
!= 0x1F)
935 pandecode_prop("unknown2 = 0x%x", fb
->unknown2
);
937 pandecode_prop("unknown2 = 0x%x", fb
->unknown2
);
938 MEMORY_PROP(fb
, scratchpad
);
939 const struct midgard_tiler_descriptor t
= fb
->tiler
;
940 pandecode_midgard_tiler_descriptor(&t
, fb
->width1
+ 1, fb
->height1
+ 1, is_fragment
);
942 if (fb
->zero3
|| fb
->zero4
) {
943 pandecode_msg("XXX: framebuffer zeros tripped\n");
944 pandecode_prop("zero3 = 0x%" PRIx32
, fb
->zero3
);
945 pandecode_prop("zero4 = 0x%" PRIx32
, fb
->zero4
);
949 pandecode_log("};\n");
951 gpu_va
+= sizeof(struct bifrost_framebuffer
);
953 if ((fb
->mfbd_flags
& MALI_MFBD_EXTRA
) && is_fragment
) {
954 mem
= pandecode_find_mapped_gpu_mem_containing(gpu_va
);
955 const struct bifrost_fb_extra
*PANDECODE_PTR_VAR(fbx
, mem
, (mali_ptr
) gpu_va
);
957 pandecode_log("struct bifrost_fb_extra fb_extra_%"PRIx64
"_%d = {\n", gpu_va
, job_no
);
960 MEMORY_PROP(fbx
, checksum
);
962 if (fbx
->checksum_stride
)
963 pandecode_prop("checksum_stride = %d", fbx
->checksum_stride
);
965 pandecode_log(".flags = ");
966 pandecode_log_decoded_flags(mfbd_extra_flag_info
, fbx
->flags
);
967 pandecode_log_cont(",\n");
969 if (fbx
->flags
& MALI_EXTRA_AFBC_ZS
) {
970 pandecode_log(".ds_afbc = {\n");
973 MEMORY_PROP_DIR(fbx
->ds_afbc
, depth_stencil_afbc_metadata
);
974 pandecode_prop("depth_stencil_afbc_stride = %d",
975 fbx
->ds_afbc
.depth_stencil_afbc_stride
);
976 MEMORY_PROP_DIR(fbx
->ds_afbc
, depth_stencil
);
978 if (fbx
->ds_afbc
.zero1
|| fbx
->ds_afbc
.padding
) {
979 pandecode_msg("XXX: Depth/stencil AFBC zeros tripped\n");
980 pandecode_prop("zero1 = 0x%" PRIx32
,
982 pandecode_prop("padding = 0x%" PRIx64
,
983 fbx
->ds_afbc
.padding
);
987 pandecode_log("},\n");
989 pandecode_log(".ds_linear = {\n");
992 if (fbx
->ds_linear
.depth
) {
993 MEMORY_PROP_DIR(fbx
->ds_linear
, depth
);
994 pandecode_prop("depth_stride = %d",
995 fbx
->ds_linear
.depth_stride
);
998 if (fbx
->ds_linear
.stencil
) {
999 MEMORY_PROP_DIR(fbx
->ds_linear
, stencil
);
1000 pandecode_prop("stencil_stride = %d",
1001 fbx
->ds_linear
.stencil_stride
);
1004 if (fbx
->ds_linear
.depth_stride_zero
||
1005 fbx
->ds_linear
.stencil_stride_zero
||
1006 fbx
->ds_linear
.zero1
|| fbx
->ds_linear
.zero2
) {
1007 pandecode_msg("XXX: Depth/stencil zeros tripped\n");
1008 pandecode_prop("depth_stride_zero = 0x%x",
1009 fbx
->ds_linear
.depth_stride_zero
);
1010 pandecode_prop("stencil_stride_zero = 0x%x",
1011 fbx
->ds_linear
.stencil_stride_zero
);
1012 pandecode_prop("zero1 = 0x%" PRIx32
,
1013 fbx
->ds_linear
.zero1
);
1014 pandecode_prop("zero2 = 0x%" PRIx32
,
1015 fbx
->ds_linear
.zero2
);
1019 pandecode_log("},\n");
1022 if (fbx
->zero3
|| fbx
->zero4
) {
1023 pandecode_msg("XXX: fb_extra zeros tripped\n");
1024 pandecode_prop("zero3 = 0x%" PRIx64
, fbx
->zero3
);
1025 pandecode_prop("zero4 = 0x%" PRIx64
, fbx
->zero4
);
1029 pandecode_log("};\n");
1031 gpu_va
+= sizeof(struct bifrost_fb_extra
);
1035 pandecode_render_target(gpu_va
, job_no
, fb
);
1037 /* Passback the render target count */
1038 return MALI_NEGATIVE(fb
->rt_count_1
);
1041 /* Just add a comment decoding the shift/odd fields forming the padded vertices
1045 pandecode_padded_vertices(unsigned shift
, unsigned k
)
1047 unsigned odd
= 2*k
+ 1;
1048 unsigned pot
= 1 << shift
;
1049 pandecode_msg("padded_num_vertices = %d\n", odd
* pot
);
1052 /* Given a magic divisor, recover what we were trying to divide by.
1054 * Let m represent the magic divisor. By definition, m is an element on Z, whre
1055 * 0 <= m < 2^N, for N bits in m.
1057 * Let q represent the number we would like to divide by.
1059 * By definition of a magic divisor for N-bit unsigned integers (a number you
1060 * multiply by to magically get division), m is a number such that:
1062 * (m * x) & (2^N - 1) = floor(x/q).
1063 * for all x on Z where 0 <= x < 2^N
1065 * Ignore the case where any of the above values equals zero; it is irrelevant
1066 * for our purposes (instanced arrays).
1068 * Choose x = q. Then:
1070 * (m * x) & (2^N - 1) = floor(x/q).
1071 * (m * q) & (2^N - 1) = floor(q/q).
1073 * floor(q/q) = floor(1) = 1, therefore:
1075 * (m * q) & (2^N - 1) = 1
1077 * Recall the identity that the bitwise AND of one less than a power-of-two
1078 * equals the modulo with that power of two, i.e. for all x:
1080 * x & (2^N - 1) = x % N
1086 * By definition, a modular multiplicative inverse of a number m is the number
1087 * q such that with respect to a modulos M:
1091 * Therefore, q is the modular multiplicative inverse of m with modulus 2^N.
1096 pandecode_magic_divisor(uint32_t magic
, unsigned shift
, unsigned orig_divisor
, unsigned extra
)
1099 /* Compute the modular inverse of `magic` with respect to 2^(32 -
1100 * shift) the most lame way possible... just repeatedly add.
1101 * Asymptoptically slow but nobody cares in practice, unless you have
1102 * massive numbers of vertices or high divisors. */
1104 unsigned inverse
= 0;
1106 /* Magic implicitly has the highest bit set */
1109 /* Depending on rounding direction */
1114 uint32_t product
= magic
* inverse
;
1126 pandecode_msg("dividing by %d (maybe off by two)\n", inverse
);
1128 /* Recall we're supposed to divide by (gl_level_divisor *
1129 * padded_num_vertices) */
1131 unsigned padded_num_vertices
= inverse
/ orig_divisor
;
1133 pandecode_msg("padded_num_vertices = %d\n", padded_num_vertices
);
1138 pandecode_attributes(const struct pandecode_mapped_memory
*mem
,
1139 mali_ptr addr
, int job_no
, char *suffix
,
1140 int count
, bool varying
)
1142 char *prefix
= varying
? "varyings" : "attributes";
1145 pandecode_msg("no %s\n", prefix
);
1149 union mali_attr
*attr
= pandecode_fetch_gpu_mem(mem
, addr
, sizeof(union mali_attr
) * count
);
1152 snprintf(base
, sizeof(base
), "%s_data_%d%s", prefix
, job_no
, suffix
);
1154 for (int i
= 0; i
< count
; ++i
) {
1155 enum mali_attr_mode mode
= attr
[i
].elements
& 7;
1157 if (mode
== MALI_ATTR_UNUSED
)
1160 mali_ptr raw_elements
= attr
[i
].elements
& ~7;
1162 /* TODO: Do we maybe want to dump the attribute values
1163 * themselves given the specified format? Or is that too hard?
1166 char *a
= pointer_as_memory_reference(raw_elements
);
1167 pandecode_log("mali_ptr %s_%d_p = %s;\n", base
, i
, a
);
1171 pandecode_log("union mali_attr %s_%d[] = {\n", prefix
, job_no
);
1174 for (int i
= 0; i
< count
; ++i
) {
1175 pandecode_log("{\n");
1178 unsigned mode
= attr
[i
].elements
& 7;
1179 pandecode_prop("elements = (%s_%d_p) | %s", base
, i
, pandecode_attr_mode(mode
));
1180 pandecode_prop("shift = %d", attr
[i
].shift
);
1181 pandecode_prop("extra_flags = %d", attr
[i
].extra_flags
);
1182 pandecode_prop("stride = 0x%" PRIx32
, attr
[i
].stride
);
1183 pandecode_prop("size = 0x%" PRIx32
, attr
[i
].size
);
1185 /* Decode further where possible */
1187 if (mode
== MALI_ATTR_MODULO
) {
1188 pandecode_padded_vertices(
1190 attr
[i
].extra_flags
);
1194 pandecode_log("}, \n");
1196 if (mode
== MALI_ATTR_NPOT_DIVIDE
) {
1198 pandecode_log("{\n");
1200 pandecode_prop("unk = 0x%x", attr
[i
].unk
);
1201 pandecode_prop("magic_divisor = 0x%08x", attr
[i
].magic_divisor
);
1202 if (attr
[i
].zero
!= 0)
1203 pandecode_prop("XXX: zero tripped (0x%x)\n", attr
[i
].zero
);
1204 pandecode_prop("divisor = %d", attr
[i
].divisor
);
1205 pandecode_magic_divisor(attr
[i
].magic_divisor
, attr
[i
- 1].shift
, attr
[i
].divisor
, attr
[i
- 1].extra_flags
);
1207 pandecode_log("}, \n");
1213 pandecode_log("};\n");
1217 pandecode_shader_address(const char *name
, mali_ptr ptr
)
1219 /* TODO: Decode flags */
1220 mali_ptr shader_ptr
= ptr
& ~15;
1222 char *a
= pointer_as_memory_reference(shader_ptr
);
1223 pandecode_prop("%s = (%s) | %d", name
, a
, (int) (ptr
& 15));
1230 all_zero(unsigned *buffer
, unsigned count
)
1232 for (unsigned i
= 0; i
< count
; ++i
) {
1241 pandecode_stencil(const char *name
, const struct mali_stencil_test
*stencil
)
1243 if (all_zero((unsigned *) stencil
, sizeof(stencil
) / sizeof(unsigned)))
1246 const char *func
= pandecode_func(stencil
->func
);
1247 const char *sfail
= pandecode_stencil_op(stencil
->sfail
);
1248 const char *dpfail
= pandecode_stencil_op(stencil
->dpfail
);
1249 const char *dppass
= pandecode_stencil_op(stencil
->dppass
);
1252 pandecode_msg("XXX: stencil zero tripped: %X\n", stencil
->zero
);
1254 pandecode_log(".stencil_%s = {\n", name
);
1256 pandecode_prop("ref = %d", stencil
->ref
);
1257 pandecode_prop("mask = 0x%02X", stencil
->mask
);
1258 pandecode_prop("func = %s", func
);
1259 pandecode_prop("sfail = %s", sfail
);
1260 pandecode_prop("dpfail = %s", dpfail
);
1261 pandecode_prop("dppass = %s", dppass
);
1263 pandecode_log("},\n");
1267 pandecode_blend_equation(const struct mali_blend_equation
*blend
)
1270 pandecode_msg("XXX: blend zero tripped: %X\n", blend
->zero1
);
1272 pandecode_log(".equation = {\n");
1275 pandecode_prop("rgb_mode = 0x%X", blend
->rgb_mode
);
1276 pandecode_prop("alpha_mode = 0x%X", blend
->alpha_mode
);
1278 pandecode_log(".color_mask = ");
1279 pandecode_log_decoded_flags(mask_flag_info
, blend
->color_mask
);
1280 pandecode_log_cont(",\n");
1283 pandecode_log("},\n");
1286 /* Decodes a Bifrost blend constant. See the notes in bifrost_blend_rt */
1289 decode_bifrost_constant(u16 constant
)
1291 float lo
= (float) (constant
& 0xFF);
1292 float hi
= (float) (constant
>> 8);
1294 return (hi
/ 255.0) + (lo
/ 65535.0);
1298 pandecode_bifrost_blend(void *descs
, int job_no
, int rt_no
)
1300 struct bifrost_blend_rt
*b
=
1301 ((struct bifrost_blend_rt
*) descs
) + rt_no
;
1303 pandecode_log("struct bifrost_blend_rt blend_rt_%d_%d = {\n", job_no
, rt_no
);
1306 pandecode_prop("flags = 0x%" PRIx16
, b
->flags
);
1307 pandecode_prop("constant = 0x%" PRIx8
" /* %f */",
1308 b
->constant
, decode_bifrost_constant(b
->constant
));
1310 /* TODO figure out blend shader enable bit */
1311 pandecode_blend_equation(&b
->equation
);
1312 pandecode_prop("unk2 = 0x%" PRIx16
, b
->unk2
);
1313 pandecode_prop("index = 0x%" PRIx16
, b
->index
);
1314 pandecode_prop("shader = 0x%" PRIx32
, b
->shader
);
1317 pandecode_log("},\n");
1323 pandecode_midgard_blend(union midgard_blend
*blend
, bool is_shader
)
1325 if (all_zero((unsigned *) blend
, sizeof(blend
) / sizeof(unsigned)))
1328 pandecode_log(".blend = {\n");
1332 pandecode_shader_address("shader", blend
->shader
);
1334 pandecode_blend_equation(&blend
->equation
);
1335 pandecode_prop("constant = %f", blend
->constant
);
1339 pandecode_log("},\n");
1341 /* Return blend shader to disassemble if present */
1342 return is_shader
? (blend
->shader
& ~0xF) : 0;
1346 pandecode_midgard_blend_mrt(void *descs
, int job_no
, int rt_no
)
1348 struct midgard_blend_rt
*b
=
1349 ((struct midgard_blend_rt
*) descs
) + rt_no
;
1351 /* Flags determine presence of blend shader */
1352 bool is_shader
= (b
->flags
& 0xF) >= 0x2;
1354 pandecode_log("struct midgard_blend_rt blend_rt_%d_%d = {\n", job_no
, rt_no
);
1357 pandecode_prop("flags = 0x%" PRIx64
, b
->flags
);
1359 union midgard_blend blend
= b
->blend
;
1360 mali_ptr shader
= pandecode_midgard_blend(&blend
, is_shader
);
1363 pandecode_log("};\n");
1368 /* Attributes and varyings have descriptor records, which contain information
1369 * about their format and ordering with the attribute/varying buffers. We'll
1370 * want to validate that the combinations specified are self-consistent.
1373 /* Extracts the number of components associated with a Mali format */
1376 pandecode_format_component_count(enum mali_format fmt
)
1378 /* Mask out the format class */
1379 unsigned top
= fmt
& 0b11100000;
1382 case MALI_FORMAT_SNORM
:
1383 case MALI_FORMAT_UINT
:
1384 case MALI_FORMAT_UNORM
:
1385 case MALI_FORMAT_SINT
:
1386 return ((fmt
>> 3) & 3) + 1;
1388 /* TODO: Validate */
1393 /* Extracts a mask of accessed components from a 12-bit Mali swizzle */
1396 pandecode_access_mask_from_channel_swizzle(unsigned swizzle
)
1399 assert(MALI_CHANNEL_RED
== 0);
1401 for (unsigned c
= 0; c
< 4; ++c
) {
1402 enum mali_channel chan
= (swizzle
>> (3*c
)) & 0x7;
1404 if (chan
<= MALI_CHANNEL_ALPHA
)
1405 mask
|= (1 << chan
);
1411 /* Validates that a (format, swizzle) pair is valid, in the sense that the
1412 * swizzle doesn't access any components that are undefined in the format.
1413 * Returns whether the swizzle is trivial (doesn't do any swizzling) and can be
1417 pandecode_validate_format_swizzle(enum mali_format fmt
, unsigned swizzle
)
1419 unsigned nr_comp
= pandecode_format_component_count(fmt
);
1420 unsigned access_mask
= pandecode_access_mask_from_channel_swizzle(swizzle
);
1421 unsigned valid_mask
= (1 << nr_comp
) - 1;
1422 unsigned invalid_mask
= ~valid_mask
;
1424 if (access_mask
& invalid_mask
) {
1425 pandecode_msg("XXX: invalid components accessed\n");
1429 /* TODO: Trivial swizzle check */
1434 pandecode_attribute_meta(int job_no
, int count
, const struct mali_vertex_tiler_postfix
*v
, bool varying
, char *suffix
)
1437 char *prefix
= varying
? "varying" : "attribute";
1438 unsigned max_index
= 0;
1439 snprintf(base
, sizeof(base
), "%s_meta", prefix
);
1441 pandecode_log("struct mali_attr_meta %s_%d%s[] = {\n", base
, job_no
, suffix
);
1444 struct mali_attr_meta
*attr_meta
;
1445 mali_ptr p
= varying
? (v
->varying_meta
& ~0xF) : v
->attribute_meta
;
1447 struct pandecode_mapped_memory
*attr_mem
= pandecode_find_mapped_gpu_mem_containing(p
);
1449 for (int i
= 0; i
< count
; ++i
, p
+= sizeof(struct mali_attr_meta
)) {
1450 attr_meta
= pandecode_fetch_gpu_mem(attr_mem
, p
,
1453 /* If the record is discard, it should be zero for everything else */
1455 if (attr_meta
->format
== MALI_VARYING_DISCARD
) {
1458 attr_meta
->unknown1
|
1459 attr_meta
->unknown3
|
1460 attr_meta
->src_offset
;
1463 pandecode_msg("XXX: expected empty record for varying discard\n");
1465 /* We want to look for a literal 0000 swizzle -- this
1466 * is not encoded with all zeroes, however */
1468 enum mali_channel z
= MALI_CHANNEL_ZERO
;
1469 unsigned zero_swizzle
= z
| (z
<< 3) | (z
<< 6) | (z
<< 9);
1470 bool good_swizzle
= attr_meta
->swizzle
== zero_swizzle
;
1473 pandecode_msg("XXX: expected zero swizzle for discard\n");
1476 pandecode_msg("XXX: cannot discard attribute\n");
1478 /* If we're all good, omit the record */
1479 if (!zero
&& varying
&& good_swizzle
) {
1480 pandecode_log("/* discarded varying */\n");
1485 pandecode_log("{\n");
1487 pandecode_prop("index = %d", attr_meta
->index
);
1489 if (attr_meta
->index
> max_index
)
1490 max_index
= attr_meta
->index
;
1492 /* Check the swizzle/format, and if they match and the swizzle
1493 * is simple enough, we can avoid printing the swizzle since
1494 * it's just noise */
1496 bool trivial_swizzle
= pandecode_validate_format_swizzle(
1497 attr_meta
->format
, attr_meta
->swizzle
);
1499 if (!trivial_swizzle
)
1500 pandecode_swizzle(attr_meta
->swizzle
);
1502 pandecode_prop("format = %s", pandecode_format(attr_meta
->format
));
1504 if (attr_meta
->unknown1
!= 0x2) {
1505 pandecode_msg("XXX: expected unknown1 = 0x2\n");
1506 pandecode_prop("unknown1 = 0x%" PRIx64
, (u64
) attr_meta
->unknown1
);
1509 if (attr_meta
->unknown3
) {
1510 pandecode_msg("XXX: unexpected unknown3 set\n");
1511 pandecode_prop("unknown3 = 0x%" PRIx64
, (u64
) attr_meta
->unknown3
);
1514 pandecode_prop("src_offset = %d", attr_meta
->src_offset
);
1516 pandecode_log("},\n");
1521 pandecode_log("};\n");
1523 return count
? (max_index
+ 1) : 0;
1527 pandecode_indices(uintptr_t pindices
, uint32_t index_count
, int job_no
)
1529 struct pandecode_mapped_memory
*imem
= pandecode_find_mapped_gpu_mem_containing(pindices
);
1532 /* Indices are literally just a u32 array :) */
1534 uint32_t *PANDECODE_PTR_VAR(indices
, imem
, pindices
);
1536 pandecode_log("uint32_t indices_%d[] = {\n", job_no
);
1539 for (unsigned i
= 0; i
< (index_count
+ 1); i
+= 3)
1540 pandecode_log("%d, %d, %d,\n",
1546 pandecode_log("};\n");
1550 /* return bits [lo, hi) of word */
1552 bits(u32 word
, u32 lo
, u32 hi
)
1555 return word
; // avoid undefined behavior with the shift
1557 return (word
>> lo
) & ((1 << (hi
- lo
)) - 1);
1561 pandecode_vertex_tiler_prefix(struct mali_vertex_tiler_prefix
*p
, int job_no
, bool noninstanced
)
1563 pandecode_log_cont("{\n");
1566 /* Decode invocation_count. See the comment before the definition of
1567 * invocation_count for an explanation.
1570 unsigned size_x
= bits(p
->invocation_count
, 0, p
->size_y_shift
) + 1;
1571 unsigned size_y
= bits(p
->invocation_count
, p
->size_y_shift
, p
->size_z_shift
) + 1;
1572 unsigned size_z
= bits(p
->invocation_count
, p
->size_z_shift
, p
->workgroups_x_shift
) + 1;
1574 unsigned groups_x
= bits(p
->invocation_count
, p
->workgroups_x_shift
, p
->workgroups_y_shift
) + 1;
1575 unsigned groups_y
= bits(p
->invocation_count
, p
->workgroups_y_shift
, p
->workgroups_z_shift
) + 1;
1576 unsigned groups_z
= bits(p
->invocation_count
, p
->workgroups_z_shift
, 32) + 1;
1578 /* Even though we have this decoded, we want to ensure that the
1579 * representation is "unique" so we don't lose anything by printing only
1580 * the final result. More specifically, we need to check that we were
1581 * passed something in canonical form, since the definition per the
1582 * hardware is inherently not unique. How? Well, take the resulting
1583 * decode and pack it ourselves! If it is bit exact with what we
1584 * decoded, we're good to go. */
1586 struct mali_vertex_tiler_prefix ref
;
1587 panfrost_pack_work_groups_compute(&ref
, groups_x
, groups_y
, groups_z
, size_x
, size_y
, size_z
, noninstanced
);
1590 (p
->invocation_count
== ref
.invocation_count
) &&
1591 (p
->size_y_shift
== ref
.size_y_shift
) &&
1592 (p
->size_z_shift
== ref
.size_z_shift
) &&
1593 (p
->workgroups_x_shift
== ref
.workgroups_x_shift
) &&
1594 (p
->workgroups_y_shift
== ref
.workgroups_y_shift
) &&
1595 (p
->workgroups_z_shift
== ref
.workgroups_z_shift
) &&
1596 (p
->workgroups_x_shift_2
== ref
.workgroups_x_shift_2
);
1599 pandecode_msg("XXX: non-canonical workgroups packing\n");
1600 pandecode_msg("expected: %X, %d, %d, %d, %d, %d\n",
1601 ref
.invocation_count
,
1604 ref
.workgroups_x_shift
,
1605 ref
.workgroups_y_shift
,
1606 ref
.workgroups_z_shift
,
1607 ref
.workgroups_x_shift_2
);
1609 pandecode_prop("invocation_count = 0x%" PRIx32
, p
->invocation_count
);
1610 pandecode_prop("size_y_shift = %d", p
->size_y_shift
);
1611 pandecode_prop("size_z_shift = %d", p
->size_z_shift
);
1612 pandecode_prop("workgroups_x_shift = %d", p
->workgroups_x_shift
);
1613 pandecode_prop("workgroups_y_shift = %d", p
->workgroups_y_shift
);
1614 pandecode_prop("workgroups_z_shift = %d", p
->workgroups_z_shift
);
1615 pandecode_prop("workgroups_x_shift_2 = %d", p
->workgroups_x_shift_2
);
1618 /* Regardless, print the decode */
1619 pandecode_msg("size (%d, %d, %d), count (%d, %d, %d)\n",
1620 size_x
, size_y
, size_z
,
1621 groups_x
, groups_y
, groups_z
);
1624 if (p
->unknown_draw
)
1625 pandecode_prop("unknown_draw = 0x%" PRIx32
, p
->unknown_draw
);
1627 pandecode_prop("workgroups_x_shift_3 = 0x%" PRIx32
, p
->workgroups_x_shift_3
);
1629 if (p
->draw_mode
!= MALI_DRAW_NONE
)
1630 pandecode_prop("draw_mode = %s", pandecode_draw_mode(p
->draw_mode
));
1632 /* Index count only exists for tiler jobs anyway */
1635 pandecode_prop("index_count = MALI_POSITIVE(%" PRId32
")", p
->index_count
+ 1);
1637 if (p
->offset_bias_correction
)
1638 pandecode_prop("offset_bias_correction = %d", p
->offset_bias_correction
);
1640 /* TODO: Figure out what this is. It's not zero */
1641 pandecode_prop("zero1 = 0x%" PRIx32
, p
->zero1
);
1644 pandecode_log("},\n");
1648 pandecode_uniform_buffers(mali_ptr pubufs
, int ubufs_count
, int job_no
)
1650 struct pandecode_mapped_memory
*umem
= pandecode_find_mapped_gpu_mem_containing(pubufs
);
1651 struct mali_uniform_buffer_meta
*PANDECODE_PTR_VAR(ubufs
, umem
, pubufs
);
1653 pandecode_log("struct mali_uniform_buffer_meta uniform_buffers_%"PRIx64
"_%d[] = {\n",
1657 for (int i
= 0; i
< ubufs_count
; i
++) {
1658 pandecode_log("{\n");
1661 unsigned size
= (ubufs
[i
].size
+ 1) * 16;
1662 mali_ptr addr
= ubufs
[i
].ptr
<< 2;
1664 pandecode_validate_buffer(addr
, size
);
1666 char *ptr
= pointer_as_memory_reference(ubufs
[i
].ptr
<< 2);
1667 pandecode_prop("size = %u", size
);
1668 pandecode_prop("ptr = (%s) >> 2", ptr
);
1670 pandecode_log("},\n");
1675 pandecode_log("};\n");
1679 pandecode_scratchpad(uintptr_t pscratchpad
, int job_no
, char *suffix
)
1682 struct pandecode_mapped_memory
*mem
= pandecode_find_mapped_gpu_mem_containing(pscratchpad
);
1684 struct bifrost_scratchpad
*PANDECODE_PTR_VAR(scratchpad
, mem
, pscratchpad
);
1686 if (scratchpad
->zero
) {
1687 pandecode_msg("XXX: scratchpad zero tripped");
1688 pandecode_prop("zero = 0x%x\n", scratchpad
->zero
);
1691 pandecode_log("struct bifrost_scratchpad scratchpad_%"PRIx64
"_%d%s = {\n", pscratchpad
, job_no
, suffix
);
1694 pandecode_prop("flags = 0x%x", scratchpad
->flags
);
1695 MEMORY_PROP(scratchpad
, gpu_scratchpad
);
1698 pandecode_log("};\n");
1701 static unsigned shader_id
= 0;
1704 pandecode_shader_disassemble(mali_ptr shader_ptr
, int shader_no
, int type
,
1705 bool is_bifrost
, unsigned nr_regs
)
1707 struct pandecode_mapped_memory
*mem
= pandecode_find_mapped_gpu_mem_containing(shader_ptr
);
1708 uint8_t *PANDECODE_PTR_VAR(code
, mem
, shader_ptr
);
1710 /* Compute maximum possible size */
1711 size_t sz
= mem
->length
- (shader_ptr
- mem
->gpu_va
);
1713 /* Print some boilerplate to clearly denote the assembly (which doesn't
1714 * obey indentation rules), and actually do the disassembly! */
1720 snprintf(prefix
, sizeof(prefix
) - 1, "shader%d - %s shader: ",
1722 (type
== JOB_TYPE_TILER
) ? "FRAGMENT" : "VERTEX");
1725 disassemble_bifrost(code
, sz
, false);
1727 disassemble_midgard(code
, sz
, true, nr_regs
, prefix
);
1734 pandecode_vertex_tiler_postfix_pre(const struct mali_vertex_tiler_postfix
*p
,
1735 int job_no
, enum mali_job_type job_type
,
1736 char *suffix
, bool is_bifrost
)
1738 mali_ptr shader_meta_ptr
= (u64
) (uintptr_t) (p
->_shader_upper
<< 4);
1739 struct pandecode_mapped_memory
*attr_mem
;
1741 unsigned rt_count
= 1;
1743 /* On Bifrost, since the tiler heap (for tiler jobs) and the scratchpad
1744 * are the only things actually needed from the FBD, vertex/tiler jobs
1745 * no longer reference the FBD -- instead, this field points to some
1746 * info about the scratchpad.
1749 pandecode_scratchpad(p
->framebuffer
& ~FBD_TYPE
, job_no
, suffix
);
1750 else if (p
->framebuffer
& MALI_MFBD
)
1751 rt_count
= pandecode_mfbd_bfr((u64
) ((uintptr_t) p
->framebuffer
) & FBD_MASK
, job_no
, false);
1752 else if (job_type
== JOB_TYPE_COMPUTE
)
1753 pandecode_compute_fbd((u64
) (uintptr_t) p
->framebuffer
, job_no
);
1755 pandecode_sfbd((u64
) (uintptr_t) p
->framebuffer
, job_no
, false);
1757 int varying_count
= 0, attribute_count
= 0, uniform_count
= 0, uniform_buffer_count
= 0;
1758 int texture_count
= 0, sampler_count
= 0;
1760 if (shader_meta_ptr
) {
1761 struct pandecode_mapped_memory
*smem
= pandecode_find_mapped_gpu_mem_containing(shader_meta_ptr
);
1762 struct mali_shader_meta
*PANDECODE_PTR_VAR(s
, smem
, shader_meta_ptr
);
1764 pandecode_log("struct mali_shader_meta shader_meta_%"PRIx64
"_%d%s = {\n", shader_meta_ptr
, job_no
, suffix
);
1767 /* Save for dumps */
1768 attribute_count
= s
->attribute_count
;
1769 varying_count
= s
->varying_count
;
1770 texture_count
= s
->texture_count
;
1771 sampler_count
= s
->sampler_count
;
1774 uniform_count
= s
->bifrost2
.uniform_count
;
1775 uniform_buffer_count
= s
->bifrost1
.uniform_buffer_count
;
1777 uniform_count
= s
->midgard1
.uniform_buffer_count
;
1778 uniform_buffer_count
= s
->midgard1
.uniform_buffer_count
;
1781 mali_ptr shader_ptr
= pandecode_shader_address("shader", s
->shader
);
1783 pandecode_prop("texture_count = %" PRId16
, s
->texture_count
);
1784 pandecode_prop("sampler_count = %" PRId16
, s
->sampler_count
);
1785 pandecode_prop("attribute_count = %" PRId16
, s
->attribute_count
);
1786 pandecode_prop("varying_count = %" PRId16
, s
->varying_count
);
1788 unsigned nr_registers
= 0;
1791 pandecode_log(".bifrost1 = {\n");
1794 pandecode_prop("uniform_buffer_count = %" PRId32
, s
->bifrost1
.uniform_buffer_count
);
1795 pandecode_prop("unk1 = 0x%" PRIx32
, s
->bifrost1
.unk1
);
1798 pandecode_log("},\n");
1800 pandecode_log(".midgard1 = {\n");
1803 pandecode_prop("uniform_count = %" PRId16
, s
->midgard1
.uniform_count
);
1804 pandecode_prop("uniform_buffer_count = %" PRId16
, s
->midgard1
.uniform_buffer_count
);
1805 pandecode_prop("work_count = %" PRId16
, s
->midgard1
.work_count
);
1806 nr_registers
= s
->midgard1
.work_count
;
1808 pandecode_log(".flags = ");
1809 pandecode_log_decoded_flags(shader_midgard1_flag_info
, s
->midgard1
.flags
);
1810 pandecode_log_cont(",\n");
1812 pandecode_prop("unknown2 = 0x%" PRIx32
, s
->midgard1
.unknown2
);
1815 pandecode_log("},\n");
1818 if (s
->depth_units
|| s
->depth_factor
) {
1819 pandecode_prop("depth_factor = %f", s
->depth_factor
);
1820 pandecode_prop("depth_units = %f", s
->depth_units
);
1823 if (s
->alpha_coverage
) {
1824 bool invert_alpha_coverage
= s
->alpha_coverage
& 0xFFF0;
1825 uint16_t inverted_coverage
= invert_alpha_coverage
? ~s
->alpha_coverage
: s
->alpha_coverage
;
1827 pandecode_prop("alpha_coverage = %sMALI_ALPHA_COVERAGE(%f)",
1828 invert_alpha_coverage
? "~" : "",
1829 MALI_GET_ALPHA_COVERAGE(inverted_coverage
));
1832 if (s
->unknown2_3
|| s
->unknown2_4
) {
1833 pandecode_log(".unknown2_3 = ");
1835 int unknown2_3
= s
->unknown2_3
;
1836 int unknown2_4
= s
->unknown2_4
;
1838 /* We're not quite sure what these flags mean without the depth test, if anything */
1840 if (unknown2_3
& (MALI_DEPTH_TEST
| MALI_DEPTH_FUNC_MASK
)) {
1841 const char *func
= pandecode_func(MALI_GET_DEPTH_FUNC(unknown2_3
));
1842 unknown2_3
&= ~MALI_DEPTH_FUNC_MASK
;
1844 pandecode_log_cont("MALI_DEPTH_FUNC(%s) | ", func
);
1847 pandecode_log_decoded_flags(u3_flag_info
, unknown2_3
);
1848 pandecode_log_cont(",\n");
1850 pandecode_log(".unknown2_4 = ");
1851 pandecode_log_decoded_flags(u4_flag_info
, unknown2_4
);
1852 pandecode_log_cont(",\n");
1855 if (s
->stencil_mask_front
|| s
->stencil_mask_back
) {
1856 pandecode_prop("stencil_mask_front = 0x%02X", s
->stencil_mask_front
);
1857 pandecode_prop("stencil_mask_back = 0x%02X", s
->stencil_mask_back
);
1860 pandecode_stencil("front", &s
->stencil_front
);
1861 pandecode_stencil("back", &s
->stencil_back
);
1864 pandecode_log(".bifrost2 = {\n");
1867 pandecode_prop("unk3 = 0x%" PRIx32
, s
->bifrost2
.unk3
);
1868 pandecode_prop("preload_regs = 0x%" PRIx32
, s
->bifrost2
.preload_regs
);
1869 pandecode_prop("uniform_count = %" PRId32
, s
->bifrost2
.uniform_count
);
1870 pandecode_prop("unk4 = 0x%" PRIx32
, s
->bifrost2
.unk4
);
1873 pandecode_log("},\n");
1874 } else if (s
->midgard2
.unknown2_7
) {
1875 pandecode_log(".midgard2 = {\n");
1878 pandecode_prop("unknown2_7 = 0x%" PRIx32
, s
->midgard2
.unknown2_7
);
1880 pandecode_log("},\n");
1884 pandecode_prop("unknown2_8 = 0x%" PRIx32
, s
->unknown2_8
);
1887 /* TODO: Blend shaders routing/disasm */
1889 union midgard_blend blend
= s
->blend
;
1890 pandecode_midgard_blend(&blend
, false);
1894 pandecode_log("};\n");
1896 /* MRT blend fields are used whenever MFBD is used, with
1897 * per-RT descriptors */
1899 if (job_type
== JOB_TYPE_TILER
) {
1900 void* blend_base
= (void *) (s
+ 1);
1902 for (unsigned i
= 0; i
< rt_count
; i
++) {
1903 mali_ptr shader
= 0;
1906 shader
= pandecode_bifrost_blend(blend_base
, job_no
, i
);
1908 shader
= pandecode_midgard_blend_mrt(blend_base
, job_no
, i
);
1911 pandecode_shader_disassemble(shader
, job_no
, job_type
, false, 0);
1915 if (shader_ptr
& ~0xF)
1916 pandecode_shader_disassemble(shader_ptr
, job_no
, job_type
, is_bifrost
, nr_registers
);
1918 pandecode_msg("<no shader>\n");
1921 struct pandecode_mapped_memory
*fmem
= pandecode_find_mapped_gpu_mem_containing(p
->viewport
);
1922 struct mali_viewport
*PANDECODE_PTR_VAR(f
, fmem
, p
->viewport
);
1924 pandecode_log("struct mali_viewport viewport_%"PRIx64
"_%d%s = {\n", p
->viewport
, job_no
, suffix
);
1927 pandecode_prop("clip_minx = %f", f
->clip_minx
);
1928 pandecode_prop("clip_miny = %f", f
->clip_miny
);
1929 pandecode_prop("clip_minz = %f", f
->clip_minz
);
1930 pandecode_prop("clip_maxx = %f", f
->clip_maxx
);
1931 pandecode_prop("clip_maxy = %f", f
->clip_maxy
);
1932 pandecode_prop("clip_maxz = %f", f
->clip_maxz
);
1934 /* Only the higher coordinates are MALI_POSITIVE scaled */
1936 pandecode_prop("viewport0 = { %d, %d }",
1937 f
->viewport0
[0], f
->viewport0
[1]);
1939 pandecode_prop("viewport1 = { MALI_POSITIVE(%d), MALI_POSITIVE(%d) }",
1940 f
->viewport1
[0] + 1, f
->viewport1
[1] + 1);
1943 pandecode_log("};\n");
1946 if (p
->attribute_meta
) {
1947 unsigned max_attr_index
= pandecode_attribute_meta(job_no
, attribute_count
, p
, false, suffix
);
1949 attr_mem
= pandecode_find_mapped_gpu_mem_containing(p
->attributes
);
1950 pandecode_attributes(attr_mem
, p
->attributes
, job_no
, suffix
, max_attr_index
, false);
1953 /* Varyings are encoded like attributes but not actually sent; we just
1954 * pass a zero buffer with the right stride/size set, (or whatever)
1955 * since the GPU will write to it itself */
1957 if (p
->varying_meta
) {
1958 varying_count
= pandecode_attribute_meta(job_no
, varying_count
, p
, true, suffix
);
1962 attr_mem
= pandecode_find_mapped_gpu_mem_containing(p
->varyings
);
1964 /* Number of descriptors depends on whether there are
1965 * non-internal varyings */
1967 pandecode_attributes(attr_mem
, p
->varyings
, job_no
, suffix
, varying_count
, true);
1970 if (p
->uniform_buffers
) {
1971 if (uniform_buffer_count
)
1972 pandecode_uniform_buffers(p
->uniform_buffers
, uniform_buffer_count
, job_no
);
1974 pandecode_msg("XXX: UBOs specified but not referenced\n");
1975 } else if (uniform_buffer_count
)
1976 pandecode_msg("XXX: UBOs referenced but not specified\n");
1978 /* We don't want to actually dump uniforms, but we do need to validate
1979 * that the counts we were given are sane */
1983 pandecode_validate_buffer(p
->uniforms
, uniform_count
* 16);
1985 pandecode_msg("XXX: Uniforms specified but not referenced");
1986 } else if (uniform_count
)
1987 pandecode_msg("XXX: UBOs referenced but not specified\n");
1989 if (p
->texture_trampoline
) {
1990 struct pandecode_mapped_memory
*mmem
= pandecode_find_mapped_gpu_mem_containing(p
->texture_trampoline
);
1993 mali_ptr
*PANDECODE_PTR_VAR(u
, mmem
, p
->texture_trampoline
);
1995 pandecode_log("uint64_t texture_trampoline_%"PRIx64
"_%d[] = {\n", p
->texture_trampoline
, job_no
);
1998 for (int tex
= 0; tex
< texture_count
; ++tex
) {
1999 mali_ptr
*PANDECODE_PTR_VAR(u
, mmem
, p
->texture_trampoline
+ tex
* sizeof(mali_ptr
));
2000 char *a
= pointer_as_memory_reference(*u
);
2001 pandecode_log("%s,\n", a
);
2006 pandecode_log("};\n");
2008 /* Now, finally, descend down into the texture descriptor */
2009 for (int tex
= 0; tex
< texture_count
; ++tex
) {
2010 mali_ptr
*PANDECODE_PTR_VAR(u
, mmem
, p
->texture_trampoline
+ tex
* sizeof(mali_ptr
));
2011 struct pandecode_mapped_memory
*tmem
= pandecode_find_mapped_gpu_mem_containing(*u
);
2014 struct mali_texture_descriptor
*PANDECODE_PTR_VAR(t
, tmem
, *u
);
2016 pandecode_log("struct mali_texture_descriptor texture_descriptor_%"PRIx64
"_%d_%d = {\n", *u
, job_no
, tex
);
2019 pandecode_prop("width = MALI_POSITIVE(%" PRId16
")", t
->width
+ 1);
2020 pandecode_prop("height = MALI_POSITIVE(%" PRId16
")", t
->height
+ 1);
2021 pandecode_prop("depth = MALI_POSITIVE(%" PRId16
")", t
->depth
+ 1);
2022 pandecode_prop("array_size = MALI_POSITIVE(%" PRId16
")", t
->array_size
+ 1);
2023 pandecode_prop("unknown3 = %" PRId16
, t
->unknown3
);
2024 pandecode_prop("unknown3A = %" PRId8
, t
->unknown3A
);
2025 pandecode_prop("nr_mipmap_levels = %" PRId8
, t
->nr_mipmap_levels
);
2027 struct mali_texture_format f
= t
->format
;
2029 pandecode_log(".format = {\n");
2032 pandecode_swizzle(f
.swizzle
);
2033 pandecode_prop("format = %s", pandecode_format(f
.format
));
2034 pandecode_prop("type = %s", pandecode_texture_type(f
.type
));
2035 pandecode_prop("srgb = %" PRId32
, f
.srgb
);
2036 pandecode_prop("unknown1 = %" PRId32
, f
.unknown1
);
2037 pandecode_prop("usage2 = 0x%" PRIx32
, f
.usage2
);
2040 pandecode_log("},\n");
2042 pandecode_swizzle(t
->swizzle
);
2044 if (t
->swizzle_zero
) {
2045 /* Shouldn't happen */
2046 pandecode_msg("XXX: swizzle zero tripped\n");
2047 pandecode_prop("swizzle_zero = %d", t
->swizzle_zero
);
2050 pandecode_prop("unknown3 = 0x%" PRIx32
, t
->unknown3
);
2052 pandecode_prop("unknown5 = 0x%" PRIx32
, t
->unknown5
);
2053 pandecode_prop("unknown6 = 0x%" PRIx32
, t
->unknown6
);
2054 pandecode_prop("unknown7 = 0x%" PRIx32
, t
->unknown7
);
2056 pandecode_log(".payload = {\n");
2059 /* A bunch of bitmap pointers follow.
2060 * We work out the correct number,
2061 * based on the mipmap/cubemap
2062 * properties, but dump extra
2063 * possibilities to futureproof */
2065 int bitmap_count
= MALI_NEGATIVE(t
->nr_mipmap_levels
);
2066 bool manual_stride
= f
.usage2
& MALI_TEX_MANUAL_STRIDE
;
2068 /* Miptree for each face */
2069 if (f
.type
== MALI_TEX_CUBE
)
2072 /* Array of textures */
2073 bitmap_count
*= MALI_NEGATIVE(t
->array_size
);
2075 /* Stride for each element */
2079 /* Sanity check the size */
2080 int max_count
= sizeof(t
->payload
) / sizeof(t
->payload
[0]);
2081 assert (bitmap_count
<= max_count
);
2083 for (int i
= 0; i
< bitmap_count
; ++i
) {
2084 /* How we dump depends if this is a stride or a pointer */
2086 if ((f
.usage2
& MALI_TEX_MANUAL_STRIDE
) && (i
& 1)) {
2087 /* signed 32-bit snuck in as a 64-bit pointer */
2088 uint64_t stride_set
= t
->payload
[i
];
2089 uint32_t clamped_stride
= stride_set
;
2090 int32_t stride
= clamped_stride
;
2091 assert(stride_set
== clamped_stride
);
2092 pandecode_log("(mali_ptr) %d /* stride */, \n", stride
);
2094 char *a
= pointer_as_memory_reference(t
->payload
[i
]);
2095 pandecode_log("%s, \n", a
);
2101 pandecode_log("},\n");
2104 pandecode_log("};\n");
2110 if (p
->sampler_descriptor
) {
2111 struct pandecode_mapped_memory
*smem
= pandecode_find_mapped_gpu_mem_containing(p
->sampler_descriptor
);
2114 struct mali_sampler_descriptor
*s
;
2116 mali_ptr d
= p
->sampler_descriptor
;
2118 for (int i
= 0; i
< sampler_count
; ++i
) {
2119 s
= pandecode_fetch_gpu_mem(smem
, d
+ sizeof(*s
) * i
, sizeof(*s
));
2121 pandecode_log("struct mali_sampler_descriptor sampler_descriptor_%"PRIx64
"_%d_%d = {\n", d
+ sizeof(*s
) * i
, job_no
, i
);
2124 pandecode_log(".filter_mode = ");
2125 pandecode_log_decoded_flags(sampler_flag_info
, s
->filter_mode
);
2126 pandecode_log_cont(",\n");
2128 pandecode_prop("min_lod = FIXED_16(%f)", DECODE_FIXED_16(s
->min_lod
));
2129 pandecode_prop("max_lod = FIXED_16(%f)", DECODE_FIXED_16(s
->max_lod
));
2131 pandecode_prop("wrap_s = %s", pandecode_wrap_mode(s
->wrap_s
));
2132 pandecode_prop("wrap_t = %s", pandecode_wrap_mode(s
->wrap_t
));
2133 pandecode_prop("wrap_r = %s", pandecode_wrap_mode(s
->wrap_r
));
2135 pandecode_prop("compare_func = %s", pandecode_alt_func(s
->compare_func
));
2137 if (s
->zero
|| s
->zero2
) {
2138 pandecode_msg("XXX: sampler zero tripped\n");
2139 pandecode_prop("zero = 0x%X, 0x%X\n", s
->zero
, s
->zero2
);
2142 pandecode_prop("seamless_cube_map = %d", s
->seamless_cube_map
);
2144 pandecode_prop("border_color = { %f, %f, %f, %f }",
2148 s
->border_color
[3]);
2151 pandecode_log("};\n");
2158 pandecode_vertex_tiler_postfix(const struct mali_vertex_tiler_postfix
*p
, int job_no
, bool is_bifrost
)
2160 if (!(p
->position_varying
|| p
->occlusion_counter
|| p
->flags
))
2163 pandecode_log(".postfix = {\n");
2166 MEMORY_PROP(p
, position_varying
);
2167 MEMORY_PROP(p
, occlusion_counter
);
2170 pandecode_prop("flags = %d", p
->flags
);
2173 pandecode_log("},\n");
2177 pandecode_vertex_only_bfr(struct bifrost_vertex_only
*v
)
2179 pandecode_log_cont("{\n");
2182 pandecode_prop("unk2 = 0x%x", v
->unk2
);
2184 if (v
->zero0
|| v
->zero1
) {
2185 pandecode_msg("XXX: vertex only zero tripped");
2186 pandecode_prop("zero0 = 0x%" PRIx32
, v
->zero0
);
2187 pandecode_prop("zero1 = 0x%" PRIx64
, v
->zero1
);
2191 pandecode_log("}\n");
2195 pandecode_tiler_heap_meta(mali_ptr gpu_va
, int job_no
)
2198 struct pandecode_mapped_memory
*mem
= pandecode_find_mapped_gpu_mem_containing(gpu_va
);
2199 const struct bifrost_tiler_heap_meta
*PANDECODE_PTR_VAR(h
, mem
, gpu_va
);
2201 pandecode_log("struct mali_tiler_heap_meta tiler_heap_meta_%d = {\n", job_no
);
2205 pandecode_msg("XXX: tiler heap zero tripped\n");
2206 pandecode_prop("zero = 0x%x", h
->zero
);
2209 for (int i
= 0; i
< 12; i
++) {
2210 if (h
->zeros
[i
] != 0) {
2211 pandecode_msg("XXX: tiler heap zero %d tripped, value %x\n",
2216 pandecode_prop("heap_size = 0x%x", h
->heap_size
);
2217 MEMORY_PROP(h
, tiler_heap_start
);
2218 MEMORY_PROP(h
, tiler_heap_free
);
2220 /* this might point to the beginning of another buffer, when it's
2221 * really the end of the tiler heap buffer, so we have to be careful
2222 * here. but for zero length, we need the same pointer.
2225 if (h
->tiler_heap_end
== h
->tiler_heap_start
) {
2226 MEMORY_PROP(h
, tiler_heap_start
);
2228 char *a
= pointer_as_memory_reference(h
->tiler_heap_end
- 1);
2229 pandecode_prop("tiler_heap_end = %s + 1", a
);
2234 pandecode_log("};\n");
2238 pandecode_tiler_meta(mali_ptr gpu_va
, int job_no
)
2240 struct pandecode_mapped_memory
*mem
= pandecode_find_mapped_gpu_mem_containing(gpu_va
);
2241 const struct bifrost_tiler_meta
*PANDECODE_PTR_VAR(t
, mem
, gpu_va
);
2243 pandecode_tiler_heap_meta(t
->tiler_heap_meta
, job_no
);
2245 pandecode_log("struct bifrost_tiler_meta tiler_meta_%d = {\n", job_no
);
2248 if (t
->zero0
|| t
->zero1
) {
2249 pandecode_msg("XXX: tiler meta zero tripped\n");
2250 pandecode_prop("zero0 = 0x%" PRIx64
, t
->zero0
);
2251 pandecode_prop("zero1 = 0x%" PRIx64
, t
->zero1
);
2254 pandecode_prop("hierarchy_mask = 0x%" PRIx16
, t
->hierarchy_mask
);
2255 pandecode_prop("flags = 0x%" PRIx16
, t
->flags
);
2257 pandecode_prop("width = MALI_POSITIVE(%d)", t
->width
+ 1);
2258 pandecode_prop("height = MALI_POSITIVE(%d)", t
->height
+ 1);
2260 for (int i
= 0; i
< 12; i
++) {
2261 if (t
->zeros
[i
] != 0) {
2262 pandecode_msg("XXX: tiler heap zero %d tripped, value %" PRIx64
"\n",
2268 pandecode_log("};\n");
2272 pandecode_gl_enables(uint32_t gl_enables
, int job_type
)
2274 pandecode_log(".gl_enables = ");
2276 pandecode_log_decoded_flags(gl_enable_flag_info
, gl_enables
);
2278 pandecode_log_cont(",\n");
2282 pandecode_primitive_size(union midgard_primitive_size u
, bool constant
)
2284 if (u
.pointer
== 0x0)
2287 pandecode_log(".primitive_size = {\n");
2291 pandecode_prop("constant = %f", u
.constant
);
2293 MEMORY_PROP((&u
), pointer
);
2297 pandecode_log("},\n");
2301 pandecode_tiler_only_bfr(const struct bifrost_tiler_only
*t
, int job_no
)
2303 pandecode_log_cont("{\n");
2306 /* TODO: gl_PointSize on Bifrost */
2307 pandecode_primitive_size(t
->primitive_size
, true);
2309 pandecode_gl_enables(t
->gl_enables
, JOB_TYPE_TILER
);
2311 if (t
->zero1
|| t
->zero2
|| t
->zero3
|| t
->zero4
|| t
->zero5
2312 || t
->zero6
|| t
->zero7
|| t
->zero8
) {
2313 pandecode_msg("XXX: tiler only zero tripped\n");
2314 pandecode_prop("zero1 = 0x%" PRIx64
, t
->zero1
);
2315 pandecode_prop("zero2 = 0x%" PRIx64
, t
->zero2
);
2316 pandecode_prop("zero3 = 0x%" PRIx64
, t
->zero3
);
2317 pandecode_prop("zero4 = 0x%" PRIx64
, t
->zero4
);
2318 pandecode_prop("zero5 = 0x%" PRIx64
, t
->zero5
);
2319 pandecode_prop("zero6 = 0x%" PRIx64
, t
->zero6
);
2320 pandecode_prop("zero7 = 0x%" PRIx32
, t
->zero7
);
2321 pandecode_prop("zero8 = 0x%" PRIx64
, t
->zero8
);
2325 pandecode_log("},\n");
2329 pandecode_vertex_job_bfr(const struct mali_job_descriptor_header
*h
,
2330 const struct pandecode_mapped_memory
*mem
,
2331 mali_ptr payload
, int job_no
)
2333 struct bifrost_payload_vertex
*PANDECODE_PTR_VAR(v
, mem
, payload
);
2335 pandecode_vertex_tiler_postfix_pre(&v
->postfix
, job_no
, h
->job_type
, "", true);
2337 pandecode_log("struct bifrost_payload_vertex payload_%d = {\n", job_no
);
2340 pandecode_log(".prefix = ");
2341 pandecode_vertex_tiler_prefix(&v
->prefix
, job_no
, false);
2343 pandecode_log(".vertex = ");
2344 pandecode_vertex_only_bfr(&v
->vertex
);
2346 pandecode_vertex_tiler_postfix(&v
->postfix
, job_no
, true);
2349 pandecode_log("};\n");
2355 pandecode_tiler_job_bfr(const struct mali_job_descriptor_header
*h
,
2356 const struct pandecode_mapped_memory
*mem
,
2357 mali_ptr payload
, int job_no
)
2359 struct bifrost_payload_tiler
*PANDECODE_PTR_VAR(t
, mem
, payload
);
2361 pandecode_vertex_tiler_postfix_pre(&t
->postfix
, job_no
, h
->job_type
, "", true);
2363 pandecode_indices(t
->prefix
.indices
, t
->prefix
.index_count
, job_no
);
2364 pandecode_tiler_meta(t
->tiler
.tiler_meta
, job_no
);
2366 pandecode_log("struct bifrost_payload_tiler payload_%d = {\n", job_no
);
2369 pandecode_log(".prefix = ");
2370 pandecode_vertex_tiler_prefix(&t
->prefix
, job_no
, false);
2372 pandecode_log(".tiler = ");
2373 pandecode_tiler_only_bfr(&t
->tiler
, job_no
);
2375 pandecode_vertex_tiler_postfix(&t
->postfix
, job_no
, true);
2378 pandecode_log("};\n");
2384 pandecode_vertex_or_tiler_job_mdg(const struct mali_job_descriptor_header
*h
,
2385 const struct pandecode_mapped_memory
*mem
,
2386 mali_ptr payload
, int job_no
)
2388 struct midgard_payload_vertex_tiler
*PANDECODE_PTR_VAR(v
, mem
, payload
);
2390 pandecode_vertex_tiler_postfix_pre(&v
->postfix
, job_no
, h
->job_type
, "", false);
2392 pandecode_indices(v
->prefix
.indices
, v
->prefix
.index_count
, job_no
);
2394 pandecode_log("struct midgard_payload_vertex_tiler payload_%d = {\n", job_no
);
2397 bool has_primitive_pointer
= v
->prefix
.unknown_draw
& MALI_DRAW_VARYING_SIZE
;
2398 pandecode_primitive_size(v
->primitive_size
, !has_primitive_pointer
);
2400 bool instanced
= v
->instance_shift
|| v
->instance_odd
;
2401 bool is_graphics
= (h
->job_type
== JOB_TYPE_VERTEX
) || (h
->job_type
== JOB_TYPE_TILER
);
2403 pandecode_log(".prefix = ");
2404 pandecode_vertex_tiler_prefix(&v
->prefix
, job_no
, !instanced
&& is_graphics
);
2406 pandecode_gl_enables(v
->gl_enables
, h
->job_type
);
2408 if (v
->instance_shift
|| v
->instance_odd
) {
2409 pandecode_prop("instance_shift = 0x%d /* %d */",
2410 v
->instance_shift
, 1 << v
->instance_shift
);
2411 pandecode_prop("instance_odd = 0x%X /* %d */",
2412 v
->instance_odd
, (2 * v
->instance_odd
) + 1);
2414 pandecode_padded_vertices(v
->instance_shift
, v
->instance_odd
);
2417 if (v
->offset_start
)
2418 pandecode_prop("offset_start = %d", v
->offset_start
);
2421 pandecode_msg("XXX: midgard payload zero tripped\n");
2422 pandecode_prop("zero5 = 0x%" PRIx64
, v
->zero5
);
2425 pandecode_vertex_tiler_postfix(&v
->postfix
, job_no
, false);
2428 pandecode_log("};\n");
2434 pandecode_fragment_job(const struct pandecode_mapped_memory
*mem
,
2435 mali_ptr payload
, int job_no
,
2438 const struct mali_payload_fragment
*PANDECODE_PTR_VAR(s
, mem
, payload
);
2440 bool fbd_dumped
= false;
2442 if (!is_bifrost
&& (s
->framebuffer
& FBD_TYPE
) == MALI_SFBD
) {
2443 /* Only SFBDs are understood, not MFBDs. We're speculating,
2444 * based on the versioning, kernel code, etc, that the
2445 * difference is between Single FrameBuffer Descriptor and
2446 * Multiple FrmaeBuffer Descriptor; the change apparently lines
2447 * up with multi-framebuffer support being added (T7xx onwards,
2448 * including Gxx). In any event, there's some field shuffling
2449 * that we haven't looked into yet. */
2451 pandecode_sfbd(s
->framebuffer
& FBD_MASK
, job_no
, true);
2453 } else if ((s
->framebuffer
& FBD_TYPE
) == MALI_MFBD
) {
2454 /* We don't know if Bifrost supports SFBD's at all, since the
2455 * driver never uses them. And the format is different from
2456 * Midgard anyways, due to the tiler heap and scratchpad being
2457 * moved out into separate structures, so it's not clear what a
2458 * Bifrost SFBD would even look like without getting an actual
2459 * trace, which appears impossible.
2462 pandecode_mfbd_bfr(s
->framebuffer
& FBD_MASK
, job_no
, true);
2466 uintptr_t p
= (uintptr_t) s
->framebuffer
& FBD_MASK
;
2467 pandecode_log("struct mali_payload_fragment payload_%"PRIx64
"_%d = {\n", payload
, job_no
);
2470 /* See the comments by the macro definitions for mathematical context
2471 * on why this is so weird */
2473 if (MALI_TILE_COORD_FLAGS(s
->max_tile_coord
) || MALI_TILE_COORD_FLAGS(s
->min_tile_coord
))
2474 pandecode_msg("Tile coordinate flag missed, replay wrong\n");
2476 pandecode_prop("min_tile_coord = MALI_COORDINATE_TO_TILE_MIN(%d, %d)",
2477 MALI_TILE_COORD_X(s
->min_tile_coord
) << MALI_TILE_SHIFT
,
2478 MALI_TILE_COORD_Y(s
->min_tile_coord
) << MALI_TILE_SHIFT
);
2480 pandecode_prop("max_tile_coord = MALI_COORDINATE_TO_TILE_MAX(%d, %d)",
2481 (MALI_TILE_COORD_X(s
->max_tile_coord
) + 1) << MALI_TILE_SHIFT
,
2482 (MALI_TILE_COORD_Y(s
->max_tile_coord
) + 1) << MALI_TILE_SHIFT
);
2484 /* If the FBD was just decoded, we can refer to it by pointer. If not,
2485 * we have to fallback on offsets. */
2487 const char *fbd_type
= s
->framebuffer
& MALI_MFBD
? "MALI_MFBD" : "MALI_SFBD";
2490 unsigned extra_flags
= (s
->framebuffer
& ~FBD_MASK
) & ~MALI_MFBD
;
2493 pandecode_prop("framebuffer = framebuffer_%d_p | %s | 0x%X", job_no
,
2494 fbd_type
, extra_flags
);
2496 pandecode_prop("framebuffer = %s | %s | 0x%X", pointer_as_memory_reference(p
),
2497 fbd_type
, extra_flags
);
2500 pandecode_log("};\n");
2505 static int job_descriptor_number
= 0;
2508 pandecode_jc(mali_ptr jc_gpu_va
, bool bifrost
)
2510 struct mali_job_descriptor_header
*h
;
2512 int start_number
= 0;
2518 struct pandecode_mapped_memory
*mem
=
2519 pandecode_find_mapped_gpu_mem_containing(jc_gpu_va
);
2523 h
= PANDECODE_PTR(mem
, jc_gpu_va
, struct mali_job_descriptor_header
);
2525 /* On Midgard, for 32-bit jobs except for fragment jobs, the
2526 * high 32-bits of the 64-bit pointer are reused to store
2529 int offset
= h
->job_descriptor_size
== MALI_JOB_32
&&
2530 h
->job_type
!= JOB_TYPE_FRAGMENT
? 4 : 0;
2531 mali_ptr payload_ptr
= jc_gpu_va
+ sizeof(*h
) - offset
;
2533 payload
= pandecode_fetch_gpu_mem(mem
, payload_ptr
,
2536 int job_no
= job_descriptor_number
++;
2539 start_number
= job_no
;
2541 pandecode_log("struct mali_job_descriptor_header job_%"PRIx64
"_%d = {\n", jc_gpu_va
, job_no
);
2544 pandecode_prop("job_type = %s", pandecode_job_type(h
->job_type
));
2546 /* Save for next job fixing */
2547 last_size
= h
->job_descriptor_size
;
2549 if (h
->job_descriptor_size
)
2550 pandecode_prop("job_descriptor_size = %d", h
->job_descriptor_size
);
2552 if (h
->exception_status
&& h
->exception_status
!= 0x1)
2553 pandecode_prop("exception_status = %x (source ID: 0x%x access: %s exception: 0x%x)",
2554 h
->exception_status
,
2555 (h
->exception_status
>> 16) & 0xFFFF,
2556 pandecode_exception_access((h
->exception_status
>> 8) & 0x3),
2557 h
->exception_status
& 0xFF);
2559 if (h
->first_incomplete_task
)
2560 pandecode_prop("first_incomplete_task = %d", h
->first_incomplete_task
);
2562 if (h
->fault_pointer
)
2563 pandecode_prop("fault_pointer = 0x%" PRIx64
, h
->fault_pointer
);
2566 pandecode_prop("job_barrier = %d", h
->job_barrier
);
2568 pandecode_prop("job_index = %d", h
->job_index
);
2570 if (h
->unknown_flags
)
2571 pandecode_prop("unknown_flags = %d", h
->unknown_flags
);
2573 if (h
->job_dependency_index_1
)
2574 pandecode_prop("job_dependency_index_1 = %d", h
->job_dependency_index_1
);
2576 if (h
->job_dependency_index_2
)
2577 pandecode_prop("job_dependency_index_2 = %d", h
->job_dependency_index_2
);
2580 pandecode_log("};\n");
2582 /* Do not touch the field yet -- decode the payload first, and
2583 * don't touch that either. This is essential for the uploads
2584 * to occur in sequence and therefore be dynamically allocated
2585 * correctly. Do note the size, however, for that related
2588 switch (h
->job_type
) {
2589 case JOB_TYPE_SET_VALUE
: {
2590 struct mali_payload_set_value
*s
= payload
;
2591 pandecode_log("struct mali_payload_set_value payload_%"PRIx64
"_%d = {\n", payload_ptr
, job_no
);
2593 MEMORY_PROP(s
, out
);
2594 pandecode_prop("unknown = 0x%" PRIX64
, s
->unknown
);
2596 pandecode_log("};\n");
2601 case JOB_TYPE_TILER
:
2602 case JOB_TYPE_VERTEX
:
2603 case JOB_TYPE_COMPUTE
:
2605 if (h
->job_type
== JOB_TYPE_TILER
)
2606 pandecode_tiler_job_bfr(h
, mem
, payload_ptr
, job_no
);
2608 pandecode_vertex_job_bfr(h
, mem
, payload_ptr
, job_no
);
2610 pandecode_vertex_or_tiler_job_mdg(h
, mem
, payload_ptr
, job_no
);
2614 case JOB_TYPE_FRAGMENT
:
2615 pandecode_fragment_job(mem
, payload_ptr
, job_no
, bifrost
);
2622 /* Handle linkage */
2625 pandecode_log("((struct mali_job_descriptor_header *) (uintptr_t) job_%d_p)->", job_no
- 1);
2628 pandecode_log_cont("next_job_64 = job_%d_p;\n\n", job_no
);
2630 pandecode_log_cont("next_job_32 = (u32) (uintptr_t) job_%d_p;\n\n", job_no
);
2635 } while ((jc_gpu_va
= h
->job_descriptor_size
? h
->next_job_64
: h
->next_job_32
));
2637 return start_number
;