🎉 Add shapes buffer to improve memory allocation

This commit is contained in:
Alejandro Alonso 2025-05-09 12:36:04 +02:00
parent 23bde76192
commit 03b4fe3558
9 changed files with 122 additions and 36 deletions

View file

@ -79,6 +79,19 @@ function getHeapU32() {
return Module.HEAPU32; return Module.HEAPU32;
} }
export function clearShapeFills() {
Module._clear_shape_fills();
}
export function addShapeSolidFill(argb) {
const ptr = allocBytes(176);
const heap = getHeapU32();
const dv = new DataView(heap.buffer);
dv.setUint8(ptr, 0x00, true);
dv.setUint32(ptr + 4, argb, true);
Module._add_shape_fill();
}
export function setShapeChildren(shapeIds) { export function setShapeChildren(shapeIds) {
const offset = allocBytes(shapeIds.length * 16); const offset = allocBytes(shapeIds.length * 16);
const heap = getHeapU32(); const heap = getHeapU32();

View file

@ -25,43 +25,50 @@
<script type="module"> <script type="module">
import initWasmModule from '/js/render_wasm.js'; import initWasmModule from '/js/render_wasm.js';
import { import {
init, assignCanvas, hexToU32ARGB, getRandomInt, getRandomColor, init, addShapeSolidFill, assignCanvas, hexToU32ARGB, getRandomInt, getRandomColor,
getRandomFloat, useShape, setShapeChildren, setupInteraction getRandomFloat, useShape, setShapeChildren, setupInteraction
} from './js/lib.js'; } from './js/lib.js';
const canvas = document.getElementById("canvas"); const canvas = document.getElementById("canvas");
canvas.width = window.innerWidth; canvas.width = window.innerWidth;
canvas.height = window.innerHeight; canvas.height = window.innerHeight;
const shapes = 1_000;
initWasmModule().then(Module => { initWasmModule().then(Module => {
init(Module); init(Module);
assignCanvas(canvas); assignCanvas(canvas);
Module._set_canvas_background(hexToU32ARGB("#FABADA", 1)); Module._set_canvas_background(hexToU32ARGB("#FABADA", 1));
Module._set_view(1, 0, 0); Module._set_view(1, 0, 0);
Module._init_shapes_pool(shapes + 1);
setupInteraction(canvas); setupInteraction(canvas);
const children = []; const children = [];
for (let i = 0; i < 1000; i++) { for (let i = 0; i < shapes; i++) {
const uuid = crypto.randomUUID(); const uuid = crypto.randomUUID();
children.push(uuid); children.push(uuid);
useShape(uuid); useShape(uuid);
Module._set_parent(0, 0, 0, 0); Module._set_parent(0, 0, 0, 0);
Module._set_shape_type(3); Module._set_shape_type(3);
const x1 = getRandomInt(0, canvas.width); const x1 = getRandomInt(0, canvas.width*3);
const y1 = getRandomInt(0, canvas.height); const y1 = getRandomInt(0, canvas.height*3);
const width = getRandomInt(20, 100); const width = getRandomInt(20, 100);
const height = getRandomInt(20, 100); const height = getRandomInt(20, 100);
Module._set_shape_selrect(x1, y1, x1 + width, y1 + height); Module._set_shape_selrect(x1, y1, x1 + width, y1 + height);
const color = getRandomColor(); const color = getRandomColor();
const argb = hexToU32ARGB(color, getRandomFloat(0.1, 1.0)); const argb = hexToU32ARGB(color, getRandomFloat(0.1, 1.0));
Module._add_shape_solid_fill(argb); addShapeSolidFill(argb)
} }
useShape("00000000-0000-0000-0000-000000000000"); useShape("00000000-0000-0000-0000-000000000000");
setShapeChildren(children); setShapeChildren(children);
performance.mark('render:begin');
Module._render(Date.now()); Module._render(Date.now());
performance.mark('render:end');
const { duration } = performance.measure('render', 'render:begin', 'render:end');
// alert(`render time: ${duration.toFixed(2)}ms`);
}); });
</script> </script>

View file

@ -842,9 +842,12 @@
(defn initialize (defn initialize
[base-objects zoom vbox background] [base-objects zoom vbox background]
(let [rgba (sr-clr/hex->u32argb background 1)] (let [rgba (sr-clr/hex->u32argb background 1)
shapes (into [] (vals base-objects))
total-shapes (count shapes)]
(h/call wasm/internal-module "_set_canvas_background" rgba) (h/call wasm/internal-module "_set_canvas_background" rgba)
(h/call wasm/internal-module "_set_view" zoom (- (:x vbox)) (- (:y vbox))) (h/call wasm/internal-module "_set_view" zoom (- (:x vbox)) (- (:y vbox)))
(h/call wasm/internal-module "_init_shapes_pool" total-shapes)
(set-objects base-objects))) (set-objects base-objects)))
(def ^:private canvas-options (def ^:private canvas-options

View file

@ -150,6 +150,13 @@ pub extern "C" fn set_view(zoom: f32, x: f32, y: f32) {
}); });
} }
#[no_mangle]
pub extern "C" fn init_shapes_pool(capacity: usize) {
with_state!(state, {
state.init_shapes_pool(capacity);
});
}
#[no_mangle] #[no_mangle]
pub extern "C" fn use_shape(a: u32, b: u32, c: u32, d: u32) { pub extern "C" fn use_shape(a: u32, b: u32, c: u32, d: u32) {
with_state!(state, { with_state!(state, {

View file

@ -434,7 +434,7 @@ impl RenderState {
pub fn start_render_loop( pub fn start_render_loop(
&mut self, &mut self,
tree: &mut HashMap<Uuid, Shape>, tree: &mut HashMap<Uuid, &mut Shape>,
modifiers: &HashMap<Uuid, Matrix>, modifiers: &HashMap<Uuid, Matrix>,
structure: &HashMap<Uuid, Vec<StructureEntry>>, structure: &HashMap<Uuid, Vec<StructureEntry>>,
timestamp: i32, timestamp: i32,
@ -501,7 +501,7 @@ impl RenderState {
pub fn process_animation_frame( pub fn process_animation_frame(
&mut self, &mut self,
tree: &mut HashMap<Uuid, Shape>, tree: &mut HashMap<Uuid, &mut Shape>,
modifiers: &HashMap<Uuid, Matrix>, modifiers: &HashMap<Uuid, Matrix>,
structure: &HashMap<Uuid, Vec<StructureEntry>>, structure: &HashMap<Uuid, Vec<StructureEntry>>,
timestamp: i32, timestamp: i32,
@ -600,7 +600,7 @@ impl RenderState {
pub fn render_shape_tree( pub fn render_shape_tree(
&mut self, &mut self,
tree: &mut HashMap<Uuid, Shape>, tree: &mut HashMap<Uuid, &mut Shape>,
modifiers: &HashMap<Uuid, Matrix>, modifiers: &HashMap<Uuid, Matrix>,
structure: &HashMap<Uuid, Vec<StructureEntry>>, structure: &HashMap<Uuid, Vec<StructureEntry>>,
timestamp: i32, timestamp: i32,
@ -855,7 +855,7 @@ impl RenderState {
pub fn rebuild_tiles_shallow( pub fn rebuild_tiles_shallow(
&mut self, &mut self,
tree: &mut HashMap<Uuid, Shape>, tree: &mut HashMap<Uuid, &mut Shape>,
modifiers: &HashMap<Uuid, Matrix>, modifiers: &HashMap<Uuid, Matrix>,
structure: &HashMap<Uuid, Vec<StructureEntry>>, structure: &HashMap<Uuid, Vec<StructureEntry>>,
) { ) {
@ -864,7 +864,7 @@ impl RenderState {
self.surfaces.remove_cached_tiles(); self.surfaces.remove_cached_tiles();
let mut nodes = vec![Uuid::nil()]; let mut nodes = vec![Uuid::nil()];
while let Some(shape_id) = nodes.pop() { while let Some(shape_id) = nodes.pop() {
if let Some(shape) = tree.get(&shape_id) { if let Some(shape) = tree.get_mut(&shape_id) {
let mut shape = shape.clone(); let mut shape = shape.clone();
if shape_id != Uuid::nil() { if shape_id != Uuid::nil() {
if let Some(modifier) = modifiers.get(&shape_id) { if let Some(modifier) = modifiers.get(&shape_id) {
@ -885,7 +885,7 @@ impl RenderState {
pub fn rebuild_tiles( pub fn rebuild_tiles(
&mut self, &mut self,
tree: &mut HashMap<Uuid, Shape>, tree: &mut HashMap<Uuid, &mut Shape>,
modifiers: &HashMap<Uuid, Matrix>, modifiers: &HashMap<Uuid, Matrix>,
structure: &HashMap<Uuid, Vec<StructureEntry>>, structure: &HashMap<Uuid, Vec<StructureEntry>>,
) { ) {
@ -894,7 +894,7 @@ impl RenderState {
self.surfaces.remove_cached_tiles(); self.surfaces.remove_cached_tiles();
let mut nodes = vec![Uuid::nil()]; let mut nodes = vec![Uuid::nil()];
while let Some(shape_id) = nodes.pop() { while let Some(shape_id) = nodes.pop() {
if let Some(shape) = tree.get(&shape_id) { if let Some(shape) = tree.get_mut(&shape_id) {
let mut shape = shape.clone(); let mut shape = shape.clone();
if shape_id != Uuid::nil() { if shape_id != Uuid::nil() {
if let Some(modifier) = modifiers.get(&shape_id) { if let Some(modifier) = modifiers.get(&shape_id) {
@ -914,11 +914,11 @@ impl RenderState {
pub fn rebuild_modifier_tiles( pub fn rebuild_modifier_tiles(
&mut self, &mut self,
tree: &mut HashMap<Uuid, Shape>, tree: &mut HashMap<Uuid, &mut Shape>,
modifiers: &HashMap<Uuid, Matrix>, modifiers: &HashMap<Uuid, Matrix>,
) { ) {
for (uuid, matrix) in modifiers { for (uuid, matrix) in modifiers {
if let Some(shape) = tree.get(uuid) { if let Some(shape) = tree.get_mut(uuid) {
let mut shape: Shape = shape.clone(); let mut shape: Shape = shape.clone();
shape.apply_transform(matrix); shape.apply_transform(matrix);
self.update_tile_for(&shape); self.update_tile_for(&shape);

View file

@ -16,7 +16,7 @@ use crate::uuid::Uuid;
fn propagate_children( fn propagate_children(
shape: &Shape, shape: &Shape,
shapes: &HashMap<Uuid, Shape>, shapes: &HashMap<Uuid, &mut Shape>,
parent_bounds_before: &Bounds, parent_bounds_before: &Bounds,
parent_bounds_after: &Bounds, parent_bounds_after: &Bounds,
transform: Matrix, transform: Matrix,
@ -83,7 +83,7 @@ fn propagate_children(
fn calculate_group_bounds( fn calculate_group_bounds(
shape: &Shape, shape: &Shape,
shapes: &HashMap<Uuid, Shape>, shapes: &HashMap<Uuid, &mut Shape>,
bounds: &HashMap<Uuid, Bounds>, bounds: &HashMap<Uuid, Bounds>,
structure: &HashMap<Uuid, Vec<StructureEntry>>, structure: &HashMap<Uuid, Vec<StructureEntry>>,
) -> Option<Bounds> { ) -> Option<Bounds> {
@ -303,19 +303,20 @@ mod tests {
#[test] #[test]
fn test_propagate_shape() { fn test_propagate_shape() {
let mut shapes = HashMap::<Uuid, Shape>::new(); let mut shapes = HashMap::<Uuid, &mut Shape>::new();
let child_id = Uuid::new_v4(); let child_id = Uuid::new_v4();
let mut child = Shape::new(child_id); let mut child = Shape::new(child_id);
child.set_selrect(3.0, 3.0, 2.0, 2.0); child.set_selrect(3.0, 3.0, 2.0, 2.0);
shapes.insert(child_id, child); shapes.insert(child_id, &mut child);
let parent_id = Uuid::new_v4(); let parent_id = Uuid::new_v4();
let mut parent = Shape::new(parent_id); let mut parent = Shape::new(parent_id);
parent.set_shape_type(Type::Group(Group::default())); parent.set_shape_type(Type::Group(Group::default()));
parent.add_child(child_id); parent.add_child(child_id);
parent.set_selrect(1.0, 1.0, 5.0, 5.0); parent.set_selrect(1.0, 1.0, 5.0, 5.0);
shapes.insert(parent_id, parent.clone()); let mut parent_clone = parent.clone();
shapes.insert(parent_id, &mut parent_clone);
let mut transform = Matrix::scale((2.0, 1.5)); let mut transform = Matrix::scale((2.0, 1.5));
let x = parent.selrect.x(); let x = parent.selrect.x();
@ -341,17 +342,17 @@ mod tests {
#[test] #[test]
fn test_group_bounds() { fn test_group_bounds() {
let mut shapes = HashMap::<Uuid, Shape>::new(); let mut shapes = HashMap::<Uuid, &mut Shape>::new();
let child1_id = Uuid::new_v4(); let child1_id = Uuid::new_v4();
let mut child1 = Shape::new(child1_id); let mut child1 = Shape::new(child1_id);
child1.set_selrect(3.0, 3.0, 2.0, 2.0); child1.set_selrect(3.0, 3.0, 2.0, 2.0);
shapes.insert(child1_id, child1); shapes.insert(child1_id, &mut child1);
let child2_id = Uuid::new_v4(); let child2_id = Uuid::new_v4();
let mut child2 = Shape::new(child2_id); let mut child2 = Shape::new(child2_id);
child2.set_selrect(0.0, 0.0, 1.0, 1.0); child2.set_selrect(0.0, 0.0, 1.0, 1.0);
shapes.insert(child2_id, child2); shapes.insert(child2_id, &mut child2);
let parent_id = Uuid::new_v4(); let parent_id = Uuid::new_v4();
let mut parent = Shape::new(parent_id); let mut parent = Shape::new(parent_id);
@ -359,7 +360,8 @@ mod tests {
parent.add_child(child1_id); parent.add_child(child1_id);
parent.add_child(child2_id); parent.add_child(child2_id);
parent.set_selrect(0.0, 0.0, 3.0, 3.0); parent.set_selrect(0.0, 0.0, 3.0, 3.0);
shapes.insert(parent_id, parent.clone()); let mut parent_clone = parent.clone();
shapes.insert(parent_id, &mut parent_clone);
let bounds = let bounds =
calculate_group_bounds(&parent, &shapes, &HashMap::new(), &HashMap::new()).unwrap(); calculate_group_bounds(&parent, &shapes, &HashMap::new(), &HashMap::new()).unwrap();

View file

@ -178,7 +178,7 @@ fn initialize_tracks(
layout_bounds: &Bounds, layout_bounds: &Bounds,
layout_axis: &LayoutAxis, layout_axis: &LayoutAxis,
flex_data: &FlexData, flex_data: &FlexData,
shapes: &HashMap<Uuid, Shape>, shapes: &HashMap<Uuid, &mut Shape>,
bounds: &HashMap<Uuid, Bounds>, bounds: &HashMap<Uuid, Bounds>,
structure: &HashMap<Uuid, Vec<StructureEntry>>, structure: &HashMap<Uuid, Vec<StructureEntry>>,
) -> Vec<TrackData> { ) -> Vec<TrackData> {
@ -420,7 +420,7 @@ fn calculate_track_data(
layout_data: &LayoutData, layout_data: &LayoutData,
flex_data: &FlexData, flex_data: &FlexData,
layout_bounds: &Bounds, layout_bounds: &Bounds,
shapes: &HashMap<Uuid, Shape>, shapes: &HashMap<Uuid, &mut Shape>,
bounds: &HashMap<Uuid, Bounds>, bounds: &HashMap<Uuid, Bounds>,
structure: &HashMap<Uuid, Vec<StructureEntry>>, structure: &HashMap<Uuid, Vec<StructureEntry>>,
) -> Vec<TrackData> { ) -> Vec<TrackData> {
@ -551,7 +551,7 @@ pub fn reflow_flex_layout(
shape: &Shape, shape: &Shape,
layout_data: &LayoutData, layout_data: &LayoutData,
flex_data: &FlexData, flex_data: &FlexData,
shapes: &HashMap<Uuid, Shape>, shapes: &HashMap<Uuid, &mut Shape>,
bounds: &mut HashMap<Uuid, Bounds>, bounds: &mut HashMap<Uuid, Bounds>,
structure: &HashMap<Uuid, Vec<StructureEntry>>, structure: &HashMap<Uuid, Vec<StructureEntry>>,
) -> VecDeque<Modifier> { ) -> VecDeque<Modifier> {

View file

@ -40,7 +40,7 @@ fn calculate_tracks(
grid_data: &GridData, grid_data: &GridData,
layout_bounds: &Bounds, layout_bounds: &Bounds,
cells: &Vec<GridCell>, cells: &Vec<GridCell>,
shapes: &HashMap<Uuid, Shape>, shapes: &HashMap<Uuid, &mut Shape>,
bounds: &HashMap<Uuid, Bounds>, bounds: &HashMap<Uuid, Bounds>,
) -> Vec<TrackData> { ) -> Vec<TrackData> {
let layout_size = if is_column { let layout_size = if is_column {
@ -105,7 +105,7 @@ fn set_auto_base_size(
column: bool, column: bool,
tracks: &mut Vec<TrackData>, tracks: &mut Vec<TrackData>,
cells: &Vec<GridCell>, cells: &Vec<GridCell>,
shapes: &HashMap<Uuid, Shape>, shapes: &HashMap<Uuid, &mut Shape>,
bounds: &HashMap<Uuid, Bounds>, bounds: &HashMap<Uuid, Bounds>,
) { ) {
for cell in cells { for cell in cells {
@ -156,7 +156,7 @@ fn set_auto_multi_span(
column: bool, column: bool,
tracks: &mut Vec<TrackData>, tracks: &mut Vec<TrackData>,
cells: &Vec<GridCell>, cells: &Vec<GridCell>,
shapes: &HashMap<Uuid, Shape>, shapes: &HashMap<Uuid, &mut Shape>,
bounds: &HashMap<Uuid, Bounds>, bounds: &HashMap<Uuid, Bounds>,
) { ) {
// Remove groups with flex (will be set in flex_multi_span) // Remove groups with flex (will be set in flex_multi_span)
@ -230,7 +230,7 @@ fn set_flex_multi_span(
column: bool, column: bool,
tracks: &mut Vec<TrackData>, tracks: &mut Vec<TrackData>,
cells: &Vec<GridCell>, cells: &Vec<GridCell>,
shapes: &HashMap<Uuid, Shape>, shapes: &HashMap<Uuid, &mut Shape>,
bounds: &HashMap<Uuid, Bounds>, bounds: &HashMap<Uuid, Bounds>,
) { ) {
// Remove groups without flex // Remove groups without flex
@ -509,7 +509,7 @@ fn cell_bounds(
fn create_cell_data<'a>( fn create_cell_data<'a>(
layout_bounds: &Bounds, layout_bounds: &Bounds,
children: &IndexSet<Uuid>, children: &IndexSet<Uuid>,
shapes: &'a HashMap<Uuid, Shape>, shapes: &'a HashMap<Uuid, &mut Shape>,
cells: &Vec<GridCell>, cells: &Vec<GridCell>,
column_tracks: &Vec<TrackData>, column_tracks: &Vec<TrackData>,
row_tracks: &Vec<TrackData>, row_tracks: &Vec<TrackData>,
@ -618,7 +618,7 @@ pub fn reflow_grid_layout<'a>(
shape: &Shape, shape: &Shape,
layout_data: &LayoutData, layout_data: &LayoutData,
grid_data: &GridData, grid_data: &GridData,
shapes: &'a HashMap<Uuid, Shape>, shapes: &'a HashMap<Uuid, &mut Shape>,
bounds: &mut HashMap<Uuid, Bounds>, bounds: &mut HashMap<Uuid, Bounds>,
structure: &HashMap<Uuid, Vec<StructureEntry>>, structure: &HashMap<Uuid, Vec<StructureEntry>>,
) -> VecDeque<Modifier> { ) -> VecDeque<Modifier> {

View file

@ -7,6 +7,54 @@ use crate::shapes::Shape;
use crate::shapes::StructureEntry; use crate::shapes::StructureEntry;
use crate::uuid::Uuid; use crate::uuid::Uuid;
/// A pool allocator for `Shape` objects that attempts to minimize memory reallocations.
///
/// `ShapesPool` pre-allocates a contiguous vector of boxed `Shape` instances,
/// which can be reused and indexed efficiently. This design helps avoid
/// memory reallocation overhead by reserving enough space in advance.
///
/// # Memory Layout
///
/// Shapes are stored in a `Vec<Box<Shape>>`, which keeps the `Box` pointers
/// in a contiguous memory block. The actual `Shape` instances are heap-allocated,
/// and this approach ensures that pushing new shapes does not invalidate
/// previously returned mutable references.
///
/// This is especially important because references to `Shape` are also held in the
/// state shapes attribute
pub(crate) struct ShapesPool {
// We need a box so that pushing here doesn't invalidate state.shapes references
shapes: Vec<Box<Shape>>,
counter: usize,
}
impl ShapesPool {
pub fn new() -> Self {
ShapesPool {
shapes: vec![],
counter: 0,
}
}
pub fn initialize(&mut self, capacity: usize) {
self.counter = 0;
self.shapes = Vec::with_capacity(capacity);
for _ in 0..capacity {
self.shapes.push(Box::new(Shape::new(Uuid::nil())));
}
}
pub fn add_shape(&mut self, id: Uuid) -> &mut Shape {
if self.counter >= self.shapes.len() {
self.shapes.push(Box::new(Shape::new(Uuid::nil())));
}
let new_shape = &mut self.shapes[self.counter];
new_shape.id = id;
self.counter += 1;
new_shape
}
}
/// This struct holds the state of the Rust application between JS calls. /// This struct holds the state of the Rust application between JS calls.
/// ///
/// It is created by [init] and passed to the other exported functions. /// It is created by [init] and passed to the other exported functions.
@ -16,9 +64,10 @@ pub(crate) struct State<'a> {
pub render_state: RenderState, pub render_state: RenderState,
pub current_id: Option<Uuid>, pub current_id: Option<Uuid>,
pub current_shape: Option<&'a mut Shape>, pub current_shape: Option<&'a mut Shape>,
pub shapes: HashMap<Uuid, Shape>, pub shapes: HashMap<Uuid, &'a mut Shape>,
pub modifiers: HashMap<Uuid, skia::Matrix>, pub modifiers: HashMap<Uuid, skia::Matrix>,
pub structure: HashMap<Uuid, Vec<StructureEntry>>, pub structure: HashMap<Uuid, Vec<StructureEntry>>,
pub shapes_pool: ShapesPool,
} }
impl<'a> State<'a> { impl<'a> State<'a> {
@ -30,6 +79,7 @@ impl<'a> State<'a> {
shapes: HashMap::with_capacity(capacity), shapes: HashMap::with_capacity(capacity),
modifiers: HashMap::new(), modifiers: HashMap::new(),
structure: HashMap::new(), structure: HashMap::new(),
shapes_pool: ShapesPool::new(),
} }
} }
@ -61,13 +111,17 @@ impl<'a> State<'a> {
Ok(()) Ok(())
} }
pub fn init_shapes_pool(&mut self, capacity: usize) {
self.shapes_pool.initialize(capacity);
}
pub fn use_shape(&'a mut self, id: Uuid) { pub fn use_shape(&'a mut self, id: Uuid) {
if !self.shapes.contains_key(&id) { if !self.shapes.contains_key(&id) {
let new_shape = Shape::new(id); let new_shape = self.shapes_pool.add_shape(id);
self.shapes.insert(id, new_shape); self.shapes.insert(id, new_shape);
} }
self.current_id = Some(id); self.current_id = Some(id);
self.current_shape = self.shapes.get_mut(&id); self.current_shape = self.shapes.get_mut(&id).map(|r| &mut **r);
} }
pub fn delete_shape(&mut self, id: Uuid) { pub fn delete_shape(&mut self, id: Uuid) {