2026-03-29 14:27:00 +02:00
|
|
|
#include <assert.h>
|
2026-03-28 09:01:21 -07:00
|
|
|
#include <wlr/types/wlr_scene.h>
|
2026-03-27 20:24:24 -07:00
|
|
|
#include "common/borderset.h"
|
|
|
|
|
#include "common/mem.h"
|
|
|
|
|
#include "common/macros.h"
|
2026-03-28 09:01:21 -07:00
|
|
|
#include "buffer.h"
|
2026-03-27 20:24:24 -07:00
|
|
|
|
2026-03-28 18:49:42 -07:00
|
|
|
|
2026-03-28 09:01:21 -07:00
|
|
|
struct borderset * getBorders(uint32_t id, int size, enum border_type type, int bevelSize) {
|
2026-03-27 20:24:24 -07:00
|
|
|
struct borderset * current = borderCache;
|
|
|
|
|
struct borderset * last;
|
2026-03-28 18:49:42 -07:00
|
|
|
|
|
|
|
|
// Preventing building nonsense borders:
|
|
|
|
|
// If you try for a double bevel but it's so deep they would overlap, convert to a single bevel
|
|
|
|
|
if (type == BORDER_DOUBLE && (bevelSize > size/2)) {
|
|
|
|
|
type = BORDER_SINGLE;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Anything with a size of 0 is converted to a 1-pixel flat border so as to prevent empty allocations
|
|
|
|
|
|
|
|
|
|
if (size < 1) {
|
|
|
|
|
type = BORDER_FLAT;
|
|
|
|
|
size = 1;
|
|
|
|
|
}
|
|
|
|
|
|
2026-03-27 20:24:24 -07:00
|
|
|
while (current != NULL) {
|
2026-04-01 19:43:20 -07:00
|
|
|
if (current->size == size && current->id == id && current->type == type && current->bevelSize == bevelSize) {
|
2026-03-27 20:24:24 -07:00
|
|
|
return current;
|
|
|
|
|
}
|
|
|
|
|
last = current;
|
|
|
|
|
current = current -> next;
|
|
|
|
|
}
|
|
|
|
|
// Fall through, we need to create a buffer.
|
|
|
|
|
|
|
|
|
|
if (borderCache == NULL) {
|
2026-03-27 20:57:28 -07:00
|
|
|
borderCache = createBuffer(id, size, type, bevelSize);
|
2026-03-27 20:24:24 -07:00
|
|
|
return borderCache;
|
|
|
|
|
} else {
|
2026-03-27 20:57:28 -07:00
|
|
|
last->next = createBuffer(id, size, type, bevelSize);
|
2026-03-27 20:24:24 -07:00
|
|
|
return last->next;
|
|
|
|
|
}
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
2026-03-28 09:01:21 -07:00
|
|
|
struct borderset * createBuffer(uint32_t id, int size, enum border_type type, int bevelSize) {
|
2026-03-27 20:24:24 -07:00
|
|
|
struct borderset *newBorderset = znew(*newBorderset);
|
2026-03-29 14:27:00 +02:00
|
|
|
|
2026-03-27 20:24:24 -07:00
|
|
|
|
|
|
|
|
newBorderset->next = NULL;
|
|
|
|
|
newBorderset->id = id;
|
|
|
|
|
newBorderset->size = size;
|
|
|
|
|
newBorderset->type = type;
|
2026-04-01 19:43:20 -07:00
|
|
|
newBorderset->bevelSize = bevelSize;
|
2026-03-27 20:24:24 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
// Use ID as a AARRGGBB colour
|
|
|
|
|
uint8_t a = id >> 24 & 255;
|
|
|
|
|
uint8_t r = id >> 16 & 255;
|
|
|
|
|
uint8_t g = id >> 8 & 255;
|
|
|
|
|
uint8_t b = id & 255;
|
|
|
|
|
|
|
|
|
|
uint32_t r1 = r * 5 / 4;
|
|
|
|
|
if (r1 > a) r1=a;
|
|
|
|
|
uint32_t g1 = g * 5 / 4;
|
|
|
|
|
if (g1 > a) g1=a;
|
|
|
|
|
uint32_t b1 = b * 5 / 4;
|
|
|
|
|
if (b1 > a) b1=a;
|
|
|
|
|
|
|
|
|
|
/* darker outline */
|
|
|
|
|
uint32_t r0 = r / 2;
|
|
|
|
|
uint32_t g0 = g / 2;
|
|
|
|
|
uint32_t b0 = b / 2;
|
|
|
|
|
|
|
|
|
|
uint32_t hl32 = ((uint32_t)a << 24) | ((uint32_t)r1 << 16)
|
|
|
|
|
| ((uint32_t)g1 << 8) | (uint32_t)b1;
|
|
|
|
|
uint32_t ll32 = ((uint32_t)a << 24) | ((uint32_t)r0 << 16)
|
|
|
|
|
| ((uint32_t)g0 << 8) | (uint32_t)b0;
|
2026-04-01 19:39:24 -07:00
|
|
|
uint32_t temp;
|
2026-03-27 20:57:28 -07:00
|
|
|
|
|
|
|
|
// All borders have NxN corners
|
2026-03-29 14:27:00 +02:00
|
|
|
uint32_t *tl = znew_n(uint32_t, size*size);
|
|
|
|
|
uint32_t *tr = znew_n(uint32_t, size*size);
|
|
|
|
|
uint32_t *bl = znew_n(uint32_t, size*size);
|
|
|
|
|
uint32_t *br = znew_n(uint32_t, size*size);
|
|
|
|
|
uint32_t *top = NULL;
|
|
|
|
|
uint32_t *left = NULL;
|
|
|
|
|
uint32_t *right = NULL;
|
|
|
|
|
uint32_t *bottom = NULL;
|
|
|
|
|
size_t side_size = 0;
|
|
|
|
|
|
2026-03-27 20:24:24 -07:00
|
|
|
switch(type) {
|
2026-04-01 19:39:24 -07:00
|
|
|
case BORDER_INSET:
|
|
|
|
|
temp = ll32;
|
|
|
|
|
ll32 = hl32;
|
|
|
|
|
hl32 = temp;
|
|
|
|
|
// Fall throgh intentional
|
2026-03-28 09:01:21 -07:00
|
|
|
case BORDER_SINGLE: // Single bevel borders have 1x1 sides
|
2026-03-29 14:27:00 +02:00
|
|
|
top = znew(uint32_t);
|
|
|
|
|
left = znew(uint32_t);
|
|
|
|
|
right = znew(uint32_t);
|
|
|
|
|
bottom = znew(uint32_t);
|
|
|
|
|
side_size = 1;
|
|
|
|
|
*top = hl32;
|
|
|
|
|
*left = hl32;
|
|
|
|
|
*right = ll32;
|
|
|
|
|
*bottom = ll32;
|
2026-03-27 20:24:24 -07:00
|
|
|
|
|
|
|
|
// Fill with solid
|
|
|
|
|
for (int j=0; j<size;j++) {
|
|
|
|
|
for (int k=0; k<size;k++) {
|
2026-03-29 14:27:00 +02:00
|
|
|
tl[PIXEL(j, k, size)] = hl32;
|
|
|
|
|
tr[PIXEL(size - 1 - j, k, size)] = (j > k) ? hl32 : ll32;
|
|
|
|
|
bl[PIXEL(size - 1 -j, k, size)] = (j > k) ? hl32 : ll32;
|
|
|
|
|
br[PIXEL(j, k, size)] = ll32;
|
2026-03-27 20:24:24 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
break;
|
|
|
|
|
|
2026-04-01 19:39:24 -07:00
|
|
|
case BORDER_DOUBLE_INSET:
|
|
|
|
|
temp = ll32;
|
|
|
|
|
ll32 = hl32;
|
|
|
|
|
hl32 = temp;
|
|
|
|
|
// Fall throgh intentional
|
2026-03-28 09:01:21 -07:00
|
|
|
case BORDER_DOUBLE:
|
2026-03-29 14:27:00 +02:00
|
|
|
top = znew_n(uint32_t, size);
|
|
|
|
|
left = znew_n(uint32_t, size);
|
|
|
|
|
right = znew_n(uint32_t, size);
|
|
|
|
|
bottom = znew_n(uint32_t, size);
|
|
|
|
|
side_size = size;
|
2026-03-27 20:57:28 -07:00
|
|
|
|
|
|
|
|
for (int i = 0; i < size; i++) {
|
|
|
|
|
if (i<bevelSize) {
|
2026-03-29 14:27:00 +02:00
|
|
|
left[i] = hl32;
|
|
|
|
|
top[i] = hl32;
|
|
|
|
|
right[i] = hl32;
|
|
|
|
|
bottom[i] = hl32;
|
2026-03-27 20:57:28 -07:00
|
|
|
|
|
|
|
|
} else if (i > (size-bevelSize-1)) {
|
2026-03-29 14:27:00 +02:00
|
|
|
left[i] = ll32;
|
|
|
|
|
top[i] = ll32;
|
|
|
|
|
right[i] = ll32;
|
|
|
|
|
bottom[i] = ll32;
|
2026-03-27 20:57:28 -07:00
|
|
|
|
|
|
|
|
} else {
|
2026-03-29 14:27:00 +02:00
|
|
|
left[i] = id;
|
|
|
|
|
top[i] = id;
|
|
|
|
|
right[i] = id;
|
|
|
|
|
bottom[i] = id;
|
2026-03-27 20:57:28 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Blank corners...
|
|
|
|
|
for (int i=0; i<size;i++) {
|
|
|
|
|
for (int j=0; j<size;j++) {
|
2026-03-29 14:27:00 +02:00
|
|
|
tl[PIXEL(i, j, size)] = id;
|
|
|
|
|
tr[PIXEL(i, j, size)] = id;
|
|
|
|
|
bl[PIXEL(i, j, size)] = id;
|
|
|
|
|
br[PIXEL(i, j, size)] = id;
|
2026-03-27 20:57:28 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// Main Corners
|
|
|
|
|
for (int i=0; i < bevelSize; i++) {
|
|
|
|
|
|
|
|
|
|
// Solid bar parts
|
|
|
|
|
for (int j=0; j<size; j++) {
|
|
|
|
|
// Top left corner: Entire "bevel size" top rows are highlighted
|
2026-03-29 14:27:00 +02:00
|
|
|
tl[PIXEL(j, i, size)] = hl32;
|
2026-03-27 20:57:28 -07:00
|
|
|
// First "bevel size" top columns are highlighted
|
2026-03-29 14:27:00 +02:00
|
|
|
tl[PIXEL(i, j, size)] = hl32;
|
2026-03-27 20:57:28 -07:00
|
|
|
|
|
|
|
|
// Bottom Right corner: Entire "bevel size" last rows are lowlight
|
2026-03-29 14:27:00 +02:00
|
|
|
br[PIXEL(j, (size-1-i), size)] = ll32;
|
2026-03-27 20:57:28 -07:00
|
|
|
// Last "bevel size" columns are lowlight
|
2026-03-29 14:27:00 +02:00
|
|
|
br[PIXEL((size-1-i), j, size)] = ll32;
|
2026-03-27 20:57:28 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
// Bottom left corner: Entire "bevel size" last rows are lowlight
|
2026-03-29 14:27:00 +02:00
|
|
|
bl[PIXEL(j, (size-1-i), size)] = ll32;
|
2026-03-27 20:57:28 -07:00
|
|
|
// First "bevel size" columns are highlight, except for the bottom right corner
|
2026-03-29 14:27:00 +02:00
|
|
|
bl[PIXEL(i, j, size)] = hl32;
|
2026-03-27 20:57:28 -07:00
|
|
|
|
|
|
|
|
// Top Right corner: Entire "bevel size" first rows are highlight
|
2026-03-29 14:27:00 +02:00
|
|
|
tr[PIXEL(j, i, size)] = hl32;
|
2026-03-27 20:57:28 -07:00
|
|
|
// Last "bevel size" columns are lowlight, except for the top left
|
2026-03-29 14:27:00 +02:00
|
|
|
tr[PIXEL((size-1-i), j, size)] = ll32;
|
2026-03-27 20:57:28 -07:00
|
|
|
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
// Beveled Corner Parts
|
|
|
|
|
for (int i=0; i < bevelSize; i++) {
|
|
|
|
|
|
|
|
|
|
for (int j=0; j<bevelSize; j++) {
|
|
|
|
|
// Outer Corners
|
|
|
|
|
// Bottom left corner:
|
|
|
|
|
// First "bevel size" columns are highlight, except for the bottom right corner
|
2026-03-29 14:27:00 +02:00
|
|
|
bl[PIXEL(i, (size - 1 - j), size)] = (j >= i) ? hl32 : ll32;
|
2026-03-27 20:57:28 -07:00
|
|
|
|
|
|
|
|
// Top Right corner:
|
|
|
|
|
// Last "bevel size" columns are lowlight, except for the top left
|
2026-03-29 14:27:00 +02:00
|
|
|
tr[PIXEL((size-1-i), j, size)] = (j > i) ? ll32 : hl32;
|
2026-03-27 20:57:28 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
// Inner Corners
|
|
|
|
|
// Top left corner: Bottom right is all dark
|
2026-03-29 14:27:00 +02:00
|
|
|
tl[PIXEL((size-1-i), (size - 1 - j), size)] = ll32;
|
2026-03-27 20:57:28 -07:00
|
|
|
|
|
|
|
|
// Bottom Right corner: Top left is all light
|
2026-03-29 14:27:00 +02:00
|
|
|
br[PIXEL(i, j, size)] = hl32;
|
2026-03-27 20:57:28 -07:00
|
|
|
|
|
|
|
|
// Top Right corner:
|
|
|
|
|
// Interior bottom left is dark on top, light on bottom
|
2026-03-29 14:27:00 +02:00
|
|
|
tr[PIXEL(i, (size-1-j), size)] = (i > j) ? hl32 : ll32;
|
2026-03-27 20:57:28 -07:00
|
|
|
|
|
|
|
|
// Bottom Left corner:
|
|
|
|
|
// Interior top right is dark on top, light on bottom
|
2026-03-29 14:27:00 +02:00
|
|
|
bl[PIXEL((size-1-i), j, size)] = (i > j) ? ll32 : hl32;
|
2026-03-27 20:57:28 -07:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2026-03-27 20:24:24 -07:00
|
|
|
|
2026-03-28 00:20:51 -07:00
|
|
|
break;
|
|
|
|
|
|
2026-03-28 09:01:21 -07:00
|
|
|
case BORDER_FLAT: // Placeholder that uses buffers but for a flat colour
|
2026-03-29 14:27:00 +02:00
|
|
|
top = znew(uint32_t);
|
|
|
|
|
left = znew(uint32_t);
|
|
|
|
|
right = znew(uint32_t);
|
|
|
|
|
bottom = znew(uint32_t);
|
|
|
|
|
side_size = 1;
|
|
|
|
|
*top = id;
|
|
|
|
|
*left = id;
|
|
|
|
|
*right = id;
|
|
|
|
|
*bottom = id;
|
2026-03-28 09:01:21 -07:00
|
|
|
|
|
|
|
|
// Fill with solid
|
|
|
|
|
for (int j=0; j<size;j++) {
|
|
|
|
|
for (int k=0; k<size;k++) {
|
2026-03-29 14:27:00 +02:00
|
|
|
tl[PIXEL(j, k, size)] = id;
|
|
|
|
|
tr[PIXEL(size - 1 - j, k, size)] = id;
|
|
|
|
|
bl[PIXEL(size - 1 -j, k, size)] = id;
|
|
|
|
|
br[PIXEL(j, k, size)] = id;
|
2026-03-28 09:01:21 -07:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
break;
|
2026-03-27 20:24:24 -07:00
|
|
|
}
|
2026-03-29 14:27:00 +02:00
|
|
|
assert(side_size > 0);
|
|
|
|
|
|
|
|
|
|
newBorderset->top = buffer_create_from_data(top, 1, side_size, 4);
|
|
|
|
|
newBorderset->left = buffer_create_from_data(left, side_size, 1, side_size * 4);
|
|
|
|
|
newBorderset->right = buffer_create_from_data(right, side_size, 1, side_size * 4);
|
|
|
|
|
newBorderset->bottom = buffer_create_from_data(bottom, 1, side_size, 4);
|
|
|
|
|
|
|
|
|
|
newBorderset->tl = buffer_create_from_data(tl, size, size, size * 4);
|
|
|
|
|
newBorderset->tr = buffer_create_from_data(tr, size, size, size * 4);
|
|
|
|
|
newBorderset->bl = buffer_create_from_data(bl, size, size, size * 4);
|
|
|
|
|
newBorderset->br = buffer_create_from_data(br, size, size, size * 4);
|
|
|
|
|
|
2026-03-27 20:24:24 -07:00
|
|
|
return newBorderset;
|
|
|
|
|
}
|
|
|
|
|
|
2026-03-28 09:01:21 -07:00
|
|
|
|
|
|
|
|
struct bufferset * generateBufferset(struct wlr_scene_tree * tree, struct borderset *borderset, int bw)
|
|
|
|
|
{
|
|
|
|
|
struct bufferset * bufferset = znew(struct bufferset);
|
2026-03-29 14:27:00 +02:00
|
|
|
|
|
|
|
|
bufferset->top = wlr_scene_buffer_create(tree, &borderset->top->base);
|
|
|
|
|
bufferset->left= wlr_scene_buffer_create(tree, &borderset->left->base);
|
|
|
|
|
bufferset->right = wlr_scene_buffer_create(tree, &borderset->right->base);
|
|
|
|
|
bufferset->bottom = wlr_scene_buffer_create(tree, &borderset->bottom->base);
|
|
|
|
|
bufferset->tl = wlr_scene_buffer_create(tree, &borderset->tl->base);
|
|
|
|
|
bufferset->tr = wlr_scene_buffer_create(tree, &borderset->tr->base);
|
|
|
|
|
bufferset->bl = wlr_scene_buffer_create(tree, &borderset->bl->base);
|
|
|
|
|
bufferset->br = wlr_scene_buffer_create(tree, &borderset->br->base);
|
|
|
|
|
|
2026-03-28 09:01:21 -07:00
|
|
|
bufferset->border_width = bw;
|
|
|
|
|
|
2026-03-29 14:27:00 +02:00
|
|
|
wlr_scene_buffer_set_filter_mode(bufferset->top, WLR_SCALE_FILTER_NEAREST);
|
|
|
|
|
wlr_scene_buffer_set_filter_mode(bufferset->left, WLR_SCALE_FILTER_NEAREST);
|
|
|
|
|
wlr_scene_buffer_set_filter_mode(bufferset->right, WLR_SCALE_FILTER_NEAREST);
|
|
|
|
|
wlr_scene_buffer_set_filter_mode(bufferset->bottom, WLR_SCALE_FILTER_NEAREST);
|
|
|
|
|
wlr_scene_buffer_set_filter_mode(bufferset->tl, WLR_SCALE_FILTER_NEAREST);
|
|
|
|
|
wlr_scene_buffer_set_filter_mode(bufferset->tr, WLR_SCALE_FILTER_NEAREST);
|
|
|
|
|
wlr_scene_buffer_set_filter_mode(bufferset->bl, WLR_SCALE_FILTER_NEAREST);
|
|
|
|
|
wlr_scene_buffer_set_filter_mode(bufferset->br, WLR_SCALE_FILTER_NEAREST);
|
2026-03-28 09:01:21 -07:00
|
|
|
|
|
|
|
|
return bufferset;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void renderBufferset(struct bufferset *bufferset, int width, int height, int y)
|
|
|
|
|
{
|
|
|
|
|
|
|
|
|
|
wlr_scene_buffer_set_dest_size(bufferset->top,
|
|
|
|
|
width - 2 * bufferset->border_width, bufferset->border_width);
|
|
|
|
|
wlr_scene_node_set_position(&bufferset->top->node,
|
|
|
|
|
bufferset->border_width,y);
|
|
|
|
|
|
|
|
|
|
wlr_scene_buffer_set_dest_size(bufferset->bottom,
|
|
|
|
|
width - 2 * bufferset->border_width, bufferset->border_width);
|
|
|
|
|
wlr_scene_node_set_position(&bufferset->bottom->node,
|
|
|
|
|
bufferset->border_width, y+height - bufferset->border_width);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
wlr_scene_buffer_set_dest_size(bufferset->left,
|
|
|
|
|
bufferset->border_width, height - bufferset->border_width * 2);
|
|
|
|
|
wlr_scene_node_set_position(&bufferset->left->node,
|
|
|
|
|
0, bufferset->border_width+y);
|
|
|
|
|
|
|
|
|
|
wlr_scene_buffer_set_dest_size(bufferset->right,
|
|
|
|
|
bufferset->border_width, height - bufferset->border_width * 2);
|
|
|
|
|
wlr_scene_node_set_position(&bufferset->right->node,
|
|
|
|
|
width - bufferset->border_width, y+ bufferset->border_width);
|
|
|
|
|
|
|
|
|
|
wlr_scene_buffer_set_dest_size(bufferset->tl,
|
|
|
|
|
bufferset->border_width, bufferset->border_width);
|
|
|
|
|
wlr_scene_node_set_position(&bufferset->tl->node,
|
|
|
|
|
0,y);
|
|
|
|
|
|
|
|
|
|
wlr_scene_buffer_set_dest_size(bufferset->tr,
|
|
|
|
|
bufferset->border_width, bufferset->border_width);
|
|
|
|
|
wlr_scene_node_set_position(&bufferset->tr->node,
|
|
|
|
|
width-bufferset->border_width, y);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
wlr_scene_buffer_set_dest_size(bufferset->br,
|
|
|
|
|
bufferset->border_width, bufferset->border_width);
|
|
|
|
|
wlr_scene_node_set_position(&bufferset->br->node,
|
|
|
|
|
width-bufferset->border_width , y+height-bufferset->border_width);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
wlr_scene_buffer_set_dest_size(bufferset->bl,
|
|
|
|
|
bufferset->border_width, bufferset->border_width);
|
|
|
|
|
wlr_scene_node_set_position(&bufferset->bl->node,
|
|
|
|
|
0, height-bufferset->border_width+y);
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
2026-03-27 20:24:24 -07:00
|
|
|
void clearBorderCache(struct borderset * borderset)
|
|
|
|
|
{
|
|
|
|
|
if (borderset == NULL)
|
|
|
|
|
return;
|
|
|
|
|
if (borderset->next != NULL) {
|
|
|
|
|
clearBorderCache(borderset->next);
|
|
|
|
|
}
|
2026-03-29 14:27:00 +02:00
|
|
|
wlr_buffer_drop(&borderset->top->base);
|
|
|
|
|
wlr_buffer_drop(&borderset->left->base);
|
|
|
|
|
wlr_buffer_drop(&borderset->right->base);
|
|
|
|
|
wlr_buffer_drop(&borderset->bottom->base);
|
|
|
|
|
wlr_buffer_drop(&borderset->tl->base);
|
|
|
|
|
wlr_buffer_drop(&borderset->tr->base);
|
|
|
|
|
wlr_buffer_drop(&borderset->bl->base);
|
|
|
|
|
wlr_buffer_drop(&borderset->br->base);
|
2026-03-27 20:24:24 -07:00
|
|
|
free(borderset);
|
|
|
|
|
}
|