aboutsummaryrefslogtreecommitdiff
path: root/base/runtime
diff options
context:
space:
mode:
authorgingerBill <gingerBill@users.noreply.github.com>2025-08-26 11:26:15 +0100
committerGitHub <noreply@github.com>2025-08-26 11:26:15 +0100
commit83a78d5d28a02de0d224e5f0f0ba5ba2a17a7467 (patch)
tree2c44d6ee416a2a4fae1b5ea024a3988f226a48f0 /base/runtime
parent18a2980d26602028977da151a0af1a43097b7830 (diff)
parent0a02f5f076a225e47737cbeab35c26751c87fd95 (diff)
Merge branch 'master' into soa-resize-zero-memory
Diffstat (limited to 'base/runtime')
-rw-r--r--base/runtime/core_builtin_soa.odin72
1 files changed, 67 insertions, 5 deletions
diff --git a/base/runtime/core_builtin_soa.odin b/base/runtime/core_builtin_soa.odin
index 3cbf82bdc..a27381613 100644
--- a/base/runtime/core_builtin_soa.odin
+++ b/base/runtime/core_builtin_soa.odin
@@ -273,17 +273,77 @@ _reserve_soa :: proc(array: ^$T/#soa[dynamic]$E, capacity: int, zero_memory: boo
old_data := (^rawptr)(array)^
+ resize: if old_data != nil {
+
+ new_bytes, resize_err := array.allocator.procedure(
+ array.allocator.data, .Resize_Non_Zeroed, new_size, max_align,
+ old_data, old_size, loc,
+ )
+ new_data := raw_data(new_bytes)
+
+ #partial switch resize_err {
+ case .Mode_Not_Implemented: break resize
+ case .None: // continue resizing
+ case: return resize_err
+ }
+
+ footer.cap = capacity
+
+ old_offset := 0
+ new_offset := 0
+
+ // Correct data memory
+ // from: |x x y y z z _ _ _|
+ // to: |x x _ y y _ z z _|
+
+ // move old data to the end of the new allocation to avoid overlap
+ old_data = rawptr(uintptr(new_data) + uintptr(new_size - old_size))
+ mem_copy(old_data, new_data, old_size)
+
+ // now: |_ _ _ x x y y z z|
+
+ for i in 0..<field_count {
+ type := si.types[i].variant.(Type_Info_Multi_Pointer).elem
+
+ old_offset = align_forward_int(old_offset, max_align)
+ new_offset = align_forward_int(new_offset, max_align)
+
+ new_data_elem := rawptr(uintptr(new_data) + uintptr(new_offset))
+ old_data_elem := rawptr(uintptr(old_data) + uintptr(old_offset))
+
+ old_size_elem := type.size * old_cap
+ new_size_elem := type.size * capacity
+
+ mem_copy(new_data_elem, old_data_elem, old_size_elem)
+
+ (^rawptr)(uintptr(array) + i*size_of(rawptr))^ = new_data_elem
+
+ if zero_memory {
+ mem_zero(rawptr(uintptr(new_data_elem) + uintptr(old_size_elem)), new_size_elem - old_size_elem)
+ }
+
+ old_offset += old_size_elem
+ new_offset += new_size_elem
+ }
+
+ return nil
+ }
+
new_bytes := array.allocator.procedure(
array.allocator.data, .Alloc if zero_memory else .Alloc_Non_Zeroed, new_size, max_align,
nil, old_size, loc,
) or_return
new_data := raw_data(new_bytes)
-
footer.cap = capacity
old_offset := 0
new_offset := 0
+
+ // Correct data memory
+ // from: |x x y y z z| ... |_ _ _ _ _ _ _ _ _|
+ // to: |x x _ y y _ z z _|
+
for i in 0..<field_count {
type := si.types[i].variant.(Type_Info_Multi_Pointer).elem
@@ -301,10 +361,12 @@ _reserve_soa :: proc(array: ^$T/#soa[dynamic]$E, capacity: int, zero_memory: boo
new_offset += type.size * capacity
}
- array.allocator.procedure(
- array.allocator.data, .Free, 0, max_align,
- old_data, old_size, loc,
- ) or_return
+ if old_data != nil {
+ array.allocator.procedure(
+ array.allocator.data, .Free, 0, max_align,
+ old_data, old_size, loc,
+ ) or_return
+ }
return nil
}