59f0aa7716
allocators/fs/process/socket/log/trace/test move under modules/std/ (allocators.sx becomes std/mem.sx; the Allocator protocol moves into the std.sx prelude, impls stay in mem.sx). New std/xml.sx holds xml_escape as xml.escape. std.sx gains the carried namespace tail — flat-importing std.sx now also provides mem./xml./log. — with the remaining modules (fs/process/socket/json/cli/hash/test) deferred from the tail until the global last-wins maps are fully own-wins (pulling them into every closure collides bare names corpus-wide; they stay direct imports: modules/std/fs.sx etc.). log.sx's internal emit renamed log_emit (it clobbered consumer fns named emit program-wide). bundle.sx uses xml.escape via the carried alias. Consumer import paths swept mechanically; .ir snapshots recaptured for the larger std closure. m3te + game build unchanged.
63 lines
1.6 KiB
Plaintext
Executable File
63 lines
1.6 KiB
Plaintext
Executable File
#import "modules/std.sx";
|
|
#import "modules/std/mem.sx";
|
|
|
|
// --- State(T) — a handle to persistent storage ---
|
|
|
|
State :: struct ($T: Type) {
|
|
ptr: *T;
|
|
|
|
get :: (self: State(T)) -> T { self.ptr.* }
|
|
|
|
set :: (self: State(T), val: T) { self.ptr.* = val; }
|
|
}
|
|
|
|
// --- StateEntry — type-erased storage ---
|
|
|
|
StateEntry :: struct {
|
|
id: s64;
|
|
data: [*]u8;
|
|
size: s64;
|
|
generation: s64;
|
|
}
|
|
|
|
// --- StateStore — manages persistent state ---
|
|
|
|
StateStore :: struct {
|
|
entries: List(StateEntry);
|
|
current_generation: s64;
|
|
parent_allocator: Allocator;
|
|
|
|
init :: (self: *StateStore) {
|
|
self.entries = List(StateEntry).{};
|
|
self.current_generation = 0;
|
|
self.parent_allocator = context.allocator;
|
|
}
|
|
|
|
get_or_create :: (self: *StateStore, id: s64, $T: Type, default: T) -> State(T) {
|
|
// Search for existing entry
|
|
i : s64 = 0;
|
|
while i < self.entries.len {
|
|
if self.entries.items[i].id == id {
|
|
self.entries.items[i].generation = self.current_generation;
|
|
return State(T).{ ptr = xx self.entries.items[i].data };
|
|
}
|
|
i += 1;
|
|
}
|
|
|
|
// Create new entry
|
|
data : [*]u8 = xx self.parent_allocator.alloc(size_of(T));
|
|
memcpy(data, @default, size_of(T));
|
|
self.entries.append(.{
|
|
id = id,
|
|
data = data,
|
|
size = size_of(T),
|
|
generation = self.current_generation
|
|
}, self.parent_allocator);
|
|
State(T).{ ptr = xx data }
|
|
}
|
|
|
|
next_frame :: (self: *StateStore) {
|
|
self.current_generation += 1;
|
|
}
|
|
}
|