mesa/src/asahi/libagx/tessellation.cl
Alyssa Rosenzweig 1a36d0b5d7 libagx: use common heap allocs
Signed-off-by: Alyssa Rosenzweig <alyssa@rosenzweig.io>
Part-of: <https://gitlab.freedesktop.org/mesa/mesa/-/merge_requests/34326>
2025-04-01 17:42:51 +00:00

240 lines
6.3 KiB
C

/*
* Copyright 2023 Alyssa Rosenzweig
* SPDX-License-Identifier: MIT
*/
#include "geometry.h"
#include "tessellator.h"
#include <agx_pack.h>
uint
libagx_tcs_patch_vertices_in(constant struct libagx_tess_args *p)
{
return p->input_patch_size;
}
uint
libagx_tes_patch_vertices_in(constant struct libagx_tess_args *p)
{
return p->output_patch_size;
}
uint
libagx_tcs_unrolled_id(constant struct libagx_tess_args *p, uint3 wg_id)
{
return (wg_id.y * p->patches_per_instance) + wg_id.x;
}
uint64_t
libagx_tes_buffer(constant struct libagx_tess_args *p)
{
return p->tes_buffer;
}
/*
* Helper to lower indexing for a tess eval shader ran as a compute shader. This
* handles the tess+geom case. This is simpler than the general input assembly
* lowering, as we know:
*
* 1. the index buffer is U32
* 2. the index is in bounds
*
* Therefore we do a simple load. No bounds checking needed.
*/
uint32_t
libagx_load_tes_index(constant struct libagx_tess_args *p, uint32_t index)
{
/* Swap second and third vertices of each triangle to flip winding order
* dynamically if needed.
*/
if (p->ccw) {
uint id = index % 3;
if (id == 1)
index++;
else if (id == 2)
index--;
}
return p->index_buffer[index];
}
ushort
libagx_tcs_in_offset(uint vtx, gl_varying_slot location,
uint64_t crosslane_vs_out_mask)
{
return libagx_tcs_in_offs(vtx, location, crosslane_vs_out_mask);
}
uintptr_t
libagx_tcs_out_address(constant struct libagx_tess_args *p, uint patch_id,
uint vtx_id, gl_varying_slot location, uint nr_patch_out,
uint out_patch_size, uint64_t vtx_out_mask)
{
uint stride_el =
libagx_tcs_out_stride_el(nr_patch_out, out_patch_size, vtx_out_mask);
uint offs_el =
libagx_tcs_out_offs_el(vtx_id, location, nr_patch_out, vtx_out_mask);
offs_el += patch_id * stride_el;
/* Written to match the AGX addressing mode */
return (uintptr_t)(p->tcs_buffer) + (((uintptr_t)offs_el) << 2);
}
static uint
libagx_tes_unrolled_patch_id(uint raw_id)
{
return raw_id / LIBAGX_TES_PATCH_ID_STRIDE;
}
uint
libagx_tes_patch_id(constant struct libagx_tess_args *p, uint raw_id)
{
return libagx_tes_unrolled_patch_id(raw_id) % p->patches_per_instance;
}
static uint
tes_vertex_id_in_patch(uint raw_id)
{
return raw_id % LIBAGX_TES_PATCH_ID_STRIDE;
}
float2
libagx_load_tess_coord(constant struct libagx_tess_args *p, uint raw_id)
{
uint patch = libagx_tes_unrolled_patch_id(raw_id);
uint vtx = tes_vertex_id_in_patch(raw_id);
global struct libagx_tess_point *t =
&p->patch_coord_buffer[p->coord_allocs[patch] + vtx];
/* Written weirdly because NIR struggles with loads of structs */
uint2 fixed = *((global uint2 *)t);
/* Convert fixed point to float */
return convert_float2(fixed) / (1u << 16);
}
uintptr_t
libagx_tes_in_address(constant struct libagx_tess_args *p, uint raw_id,
uint vtx_id, gl_varying_slot location)
{
uint patch = libagx_tes_unrolled_patch_id(raw_id);
return libagx_tcs_out_address(p, patch, vtx_id, location,
p->tcs_patch_constants, p->output_patch_size,
p->tcs_per_vertex_outputs);
}
float4
libagx_tess_level_outer_default(constant struct libagx_tess_args *p)
{
return vload4(0, p->tess_level_outer_default);
}
float2
libagx_tess_level_inner_default(constant struct libagx_tess_args *p)
{
return vload2(0, p->tess_level_inner_default);
}
KERNEL(1)
libagx_tess_setup_indirect(
global struct libagx_tess_args *p,
global uint32_t *grids /* output: VS then TCS then tess */,
global struct agx_ia_state *ia /* output */, global uint32_t *indirect,
global uint64_t *vertex_output_buffer_ptr, uint64_t in_index_buffer,
uint32_t in_index_buffer_range_el, uint32_t in_index_size_B,
uint64_t vertex_outputs /* bitfield */,
/* Tess control invocation counter if active, else zero */
global uint32_t *tcs_statistic)
{
uint count = indirect[0], instance_count = indirect[1];
unsigned in_patches = count / p->input_patch_size;
/* TCS invocation counter increments once per-patch */
if (tcs_statistic) {
*tcs_statistic += in_patches;
}
size_t draw_stride = 5 * sizeof(uint32_t);
unsigned unrolled_patches = in_patches * instance_count;
uint32_t alloc = 0;
uint32_t tcs_out_offs = alloc;
alloc += unrolled_patches * p->tcs_stride_el * 4;
uint32_t patch_coord_offs = alloc;
alloc += unrolled_patches * 4;
uint32_t count_offs = alloc;
alloc += unrolled_patches * sizeof(uint32_t);
uint vb_offs = alloc;
uint vb_size = libagx_tcs_in_size(count * instance_count, vertex_outputs);
alloc += vb_size;
/* Allocate all patch calculations in one go */
global uchar *blob = agx_heap_alloc_nonatomic(p->heap, alloc);
p->tcs_buffer = (global float *)(blob + tcs_out_offs);
p->patches_per_instance = in_patches;
p->coord_allocs = (global uint *)(blob + patch_coord_offs);
p->nr_patches = unrolled_patches;
*vertex_output_buffer_ptr = (uintptr_t)(blob + vb_offs);
p->counts = (global uint32_t *)(blob + count_offs);
if (ia) {
ia->verts_per_instance = count;
}
/* If indexing is enabled, the third word is the offset into the index buffer
* in elements. Apply that offset now that we have it. For a hardware
* indirect draw, the hardware would do this for us, but for software input
* assembly we need to do it ourselves.
*
* XXX: Deduplicate?
*/
if (in_index_size_B) {
ia->index_buffer =
libagx_index_buffer(in_index_buffer, in_index_buffer_range_el,
indirect[2], in_index_size_B);
ia->index_buffer_range_el =
libagx_index_buffer_range_el(in_index_buffer_range_el, indirect[2]);
}
/* VS grid size */
grids[0] = count;
grids[1] = instance_count;
grids[2] = 1;
/* VS workgroup size */
grids[3] = 64;
grids[4] = 1;
grids[5] = 1;
/* TCS grid size */
grids[6] = in_patches * p->output_patch_size;
grids[7] = instance_count;
grids[8] = 1;
/* TCS workgroup size */
grids[9] = p->output_patch_size;
grids[10] = 1;
grids[11] = 1;
/* Tess grid size */
grids[12] = unrolled_patches;
grids[13] = 1;
grids[14] = 1;
/* Tess workgroup size */
grids[15] = 64;
grids[16] = 1;
grids[17] = 1;
}