2023-03-31 19:11:10 +00:00
|
|
|
#pragma once
|
gsk: add OpenGL based GskNglRenderer
The primary goal here was to cleanup the current GL renderer to make
maintenance easier going forward. Furthermore, it tracks state to allow
us to implement more advanced renderer features going forward.
Reordering
This renderer will reorder batches by render target to reduce the number
of times render targets are changed.
In the future, we could also reorder by program within the render target
if we can determine that vertices do not overlap.
Uniform Snapshots
To allow for reordering of batches all uniforms need to be tracked for
the programs. This allows us to create the full uniform state when the
batch has been moved into a new position.
Some care was taken as it can be performance sensitive.
Attachment Snapshots
Similar to uniform snapshots, we need to know all of the texture
attachments so that we can rebind them when necessary.
Render Jobs
To help isolate the process of creating GL commands from the renderer
abstraction a render job abstraction was added. This could be extended
in the future if we decided to do tiling.
Command Queue
Render jobs create batches using the command queue. The command queue
will snapshot uniform and attachment state so that it can reorder
batches right before executing them.
Currently, the only reordering done is to ensure that we only visit
each render target once. We could extend this by tracking vertices,
attachments, and others.
This code currently uses an inline array helper to reduce overhead
from GArray which was showing up on profiles. It could be changed to
use GdkArray without too much work, but had roughly double the
instructions. Cycle counts have not yet been determined.
GLSL Programs
This was simplified to use XMACROS so that we can just extend one file
(gskglprograms.defs) instead of multiple places. The programs are added
as fields in the driver for easy access.
Driver
The driver manages textures, render targets, access to atlases,
programs, and more. There is one driver per display, by using the
shared GL context.
Some work could be done here to batch uploads so that we make fewer
calls to upload when sending icon theme data to the GPU. We'd need
to keep a copy of the atlas data for such purposes.
2020-12-19 01:36:59 +00:00
|
|
|
|
|
|
|
|
#define DEFINE_INLINE_ARRAY(Type, prefix, ElementType) \
|
|
|
|
|
typedef struct _##Type { \
|
|
|
|
|
gsize len; \
|
|
|
|
|
gsize allocated; \
|
|
|
|
|
ElementType *items; \
|
|
|
|
|
} Type; \
|
|
|
|
|
\
|
|
|
|
|
static inline void \
|
|
|
|
|
prefix##_init (Type *ar, \
|
|
|
|
|
gsize initial_size) \
|
|
|
|
|
{ \
|
|
|
|
|
ar->len = 0; \
|
|
|
|
|
ar->allocated = initial_size ? initial_size : 16; \
|
|
|
|
|
ar->items = g_new0 (ElementType, ar->allocated); \
|
|
|
|
|
} \
|
|
|
|
|
\
|
|
|
|
|
static inline void \
|
|
|
|
|
prefix##_clear (Type *ar) \
|
|
|
|
|
{ \
|
|
|
|
|
ar->len = 0; \
|
|
|
|
|
ar->allocated = 0; \
|
|
|
|
|
g_clear_pointer (&ar->items, g_free); \
|
|
|
|
|
} \
|
|
|
|
|
\
|
|
|
|
|
static inline ElementType * \
|
|
|
|
|
prefix##_head (Type *ar) \
|
|
|
|
|
{ \
|
|
|
|
|
return &ar->items[0]; \
|
|
|
|
|
} \
|
|
|
|
|
\
|
|
|
|
|
static inline ElementType * \
|
|
|
|
|
prefix##_tail (Type *ar) \
|
|
|
|
|
{ \
|
|
|
|
|
return &ar->items[ar->len-1]; \
|
|
|
|
|
} \
|
|
|
|
|
\
|
|
|
|
|
static inline ElementType * \
|
|
|
|
|
prefix##_append (Type *ar) \
|
|
|
|
|
{ \
|
|
|
|
|
if G_UNLIKELY (ar->len == ar->allocated) \
|
|
|
|
|
{ \
|
|
|
|
|
ar->allocated *= 2; \
|
|
|
|
|
ar->items = g_renew (ElementType, ar->items, ar->allocated);\
|
|
|
|
|
} \
|
|
|
|
|
\
|
|
|
|
|
ar->len++; \
|
|
|
|
|
\
|
|
|
|
|
return prefix##_tail (ar); \
|
|
|
|
|
} \
|
|
|
|
|
\
|
|
|
|
|
static inline ElementType * \
|
|
|
|
|
prefix##_append_n (Type *ar, \
|
|
|
|
|
gsize n) \
|
|
|
|
|
{ \
|
|
|
|
|
if G_UNLIKELY ((ar->len + n) > ar->allocated) \
|
|
|
|
|
{ \
|
|
|
|
|
while ((ar->len + n) > ar->allocated) \
|
|
|
|
|
ar->allocated *= 2; \
|
|
|
|
|
ar->items = g_renew (ElementType, ar->items, ar->allocated);\
|
|
|
|
|
} \
|
|
|
|
|
\
|
|
|
|
|
ar->len += n; \
|
|
|
|
|
\
|
|
|
|
|
return &ar->items[ar->len-n]; \
|
|
|
|
|
} \
|
|
|
|
|
\
|
|
|
|
|
static inline gsize \
|
|
|
|
|
prefix##_index_of (Type *ar, \
|
|
|
|
|
const ElementType *element) \
|
|
|
|
|
{ \
|
|
|
|
|
return element - &ar->items[0]; \
|
|
|
|
|
}
|
|
|
|
|
|
