✓
Passing This code compiles and runs correctly.
Code
// A ROW IS REACHABLE BY POSITION, through a grid of handles.
//
// The store's addressing rule is that a row is named by a HANDLE and never by a
// position, and that rule was read for months as "an ECS `Vec<Entity>` is not
// expressible" — the ECS benchmark's `fanout` port carried the sentence "that
// access is not spellable and no amount of cleverness makes it so" as
// justification for diverging from both its anchors.
//
// IT IS SPELLABLE. A `std/grid` IS positionally addressed, so a grid whose cells
// hold handles is exactly the missing index. Position -> handle -> row:
//
// agents[xref[i].h].hp
//
// Nothing new was built to make this work. 690_249 taught a write's row address
// to carry a nested read; a grid read is just another read in that slot, and it
// composes at the second hop. The wall was a habit of spelling, not a limit.
//
// WHAT THIS PINS, three things that must hold together:
// - the two-hop address lowers on the WRITE side (`agents[xref[..].h].hp:`),
// where reads have composed since 690_245 but writes stopped at one hop;
// - the same two-hop address lowers in the VALUE, so a hit ACCUMULATES onto
// the row instead of overwriting it;
// - a computed, COLLIDING index works — the map below is `aid % 3`, so row 0
// is hit three times, row 1 three times, row 2 twice, and rows 3..7 never.
// A permutation would have made every row identical and pinned nothing.
//
// This is the shape every scatter-into-a-neighbour workload needs, and it is
// what let `archetype_churn_world` agree with bevy_ecs bit-for-bit: its attack
// system damages `entities[(target + id*13) % count]`, which is this and only
// this.
import std/io
import std/store
import std/grid
std/store:new(agents, capacity: 8) { aid: i64, hp: i64 }
std/grid:new(xref, size: 8) { h: 0[i64] }
// Build the corpus and its position->handle index in one pass: the insert's
// `row` arm carries the handle, and the loop counter is the position.
for(0..8)
! each i |> std/store:insert(agents) { aid: @as(i64, @intCast(i)), hp: 100 }
| row t |> std/grid:stored { xref[i].h: t }
| full |> _
// Every row damages the row at `aid % 3`. The write's row address reads the
// grid at a computed index; the value reads the SAME address, one hop deeper
// than any previous test goes.
std/store:query(agents)
! query a |> std/store:stored { agents[xref[@as(usize, @intCast(@mod(a.aid, 3)))].h].hp: agents[xref[@as(usize, @intCast(@mod(a.aid, 3)))].h].hp - 35 }
std/store:query(agents)
! query e |> std/io:print.ln("aid {{ e.aid:d }} hp {{ e.hp:d }}")
Actual · Zig
✓ passaid 0 hp -5
aid 1 hp -5
aid 2 hp 30
aid 3 hp 100
aid 4 hp 100
aid 5 hp 100
aid 6 hp 100
aid 7 hp 100
Actual · C#
✗ cs-compileExpected output
✓ Zig✗ C#aid 0 hp -5
aid 1 hp -5
aid 2 hp 30
aid 3 hp 100
aid 4 hp 100
aid 5 hp 100
aid 6 hp 100
aid 7 hp 100
Emitted Zig source
// Access compiler flags via the per-user compiler_env module
const CompilerEnv = @import("compiler_env").CompilerEnv;
pub const panic = if (@import("builtin").mode == .Debug)
@import("std").debug.FullPanic(@import("std").debug.defaultPanic)
else
@import("std").debug.simple_panic;
const __koru_bare = struct {
extern fn posix_memalign(memptr: *?*anyopaque, alignment: usize, size: usize) c_int;
extern fn free(ptr: ?*anyopaque) void;
fn bareAlloc(_: *anyopaque, len: usize, alignment: @import("std").mem.Alignment, _: usize) ?[*]u8 {
var p: ?*anyopaque = null;
const a = @max(alignment.toByteUnits(), @sizeOf(usize));
if (posix_memalign(&p, a, len) != 0) return null;
return @ptrCast(p);
}
fn bareResize(_: *anyopaque, _: []u8, _: @import("std").mem.Alignment, _: usize, _: usize) bool { return false; }
fn bareRemap(_: *anyopaque, _: []u8, _: @import("std").mem.Alignment, _: usize, _: usize) ?[*]u8 { return null; }
fn bareFree(_: *anyopaque, memory: []u8, _: @import("std").mem.Alignment, _: usize) void { free(@ptrCast(memory.ptr)); }
const vtable = @import("std").mem.Allocator.VTable{ .alloc = bareAlloc, .resize = bareResize, .remap = bareRemap, .free = bareFree };
const allocator = @import("std").mem.Allocator{ .ptr = undefined, .vtable = &vtable };
};
const __koru_backing = if (@import("builtin").link_libc) @import("std").heap.c_allocator else if (@import("builtin").os.tag == .freestanding) __koru_bare.allocator else @import("std").heap.page_allocator;
var __koru_leak_count: @import("std").atomic.Value(usize) = .init(0);
fn __koru_alloc(ctx: *anyopaque, len: usize, alignment: @import("std").mem.Alignment, ret_addr: usize) ?[*]u8 {
_ = ctx;
const r = __koru_backing.rawAlloc(len, alignment, ret_addr);
if (comptime @import("builtin").mode == .Debug) {
if (r != null) _ = __koru_leak_count.fetchAdd(1, .monotonic);
}
return r;
}
fn __koru_resize(ctx: *anyopaque, memory: []u8, alignment: @import("std").mem.Alignment, new_len: usize, ret_addr: usize) bool {
_ = ctx;
return __koru_backing.rawResize(memory, alignment, new_len, ret_addr);
}
fn __koru_remap(ctx: *anyopaque, memory: []u8, alignment: @import("std").mem.Alignment, new_len: usize, ret_addr: usize) ?[*]u8 {
_ = ctx;
return __koru_backing.rawRemap(memory, alignment, new_len, ret_addr);
}
fn __koru_free(ctx: *anyopaque, memory: []u8, alignment: @import("std").mem.Alignment, ret_addr: usize) void {
_ = ctx;
__koru_backing.rawFree(memory, alignment, ret_addr);
if (comptime @import("builtin").mode == .Debug) {
_ = __koru_leak_count.fetchSub(1, .monotonic);
}
}
const __koru_vtable = @import("std").mem.Allocator.VTable{ .alloc = __koru_alloc, .resize = __koru_resize, .remap = __koru_remap, .free = __koru_free };
pub fn koru_allocator() @import("std").mem.Allocator {
return .{ .ptr = undefined, .vtable = &__koru_vtable };
}
pub inline fn __koru_intcast(comptime T: type, x: anytype) T {
if (comptime (@import("builtin").mode == .Debug or @import("builtin").mode == .ReleaseSafe))
return @as(T, @intCast(x));
const dst = @typeInfo(T);
const src = @typeInfo(@TypeOf(x));
if (comptime (dst == .int and src == .int and dst.int.bits == src.int.bits and dst.int.signedness != src.int.signedness))
return @as(T, @bitCast(x));
return @as(T, @intCast(x));
}
pub fn koru_leak_check() void {
if (comptime @import("builtin").mode != .Debug) return;
if (__koru_leak_count.load(.acquire) == 0) return;
if (comptime @import("builtin").target.os.tag == .freestanding) {
if (comptime @import("builtin").cpu.arch == .wasm32 or @import("builtin").cpu.arch == .wasm64) {
@panic("KORU LEAK CHECK FAILED: the produced program leaked");
} else {
const __klc = struct { extern var stdout: ?*anyopaque; extern fn fputs(__s: [*:0]const u8, __st: ?*anyopaque) c_int; };
var __lb: [128]u8 = undefined;
const __lm = "KORU LEAK CHECK FAILED: allocations still outstanding at end of run: ";
@memcpy(__lb[0..__lm.len], __lm);
var __ln: usize = __lm.len;
var __lv = __koru_leak_count.load(.acquire);
var __ld: [20]u8 = undefined;
var __lk: usize = 0;
while (__lv > 0) : (__lk += 1) { __ld[__lk] = @intCast('0' + __lv % 10); __lv /= 10; }
for (0..__lk) |__li| { __lb[__ln] = __ld[__lk - 1 - __li]; __ln += 1; }
__lb[__ln] = '\n'; __ln += 1; __lb[__ln] = 0;
_ = __klc.fputs(@as([*:0]const u8, @ptrCast(&__lb)), __klc.stdout);
@trap();
}
} else {
@import("std").debug.print("KORU LEAK CHECK FAILED: the produced program leaked (trace above)\n", .{});
@import("std").process.exit(1);
}
}
pub const main_module = struct {
// std/store: plural store 'agents' created (SoA cell + insert/query/write/take/stripe units); fields aid: i64, hp: i64
const __KoruGridT_xref = struct {
h: [8]i64 = [_]i64{0} ** 8,
const __koru_size: usize = 8;
fn __koru_wide(v: anytype) i64 {
return if (@TypeOf(v) == comptime_int) v else @intCast(v);
}
fn __koru_at(i_raw: anytype) usize {
const i = __koru_wide(i_raw);
if (i < 0 or @as(usize, @intCast(i)) >= 8) @panic("std/grid: index out of range for grid 'xref' (size 8) - a grid is addressed by position, and wrapping is the program's to write as `% 8`");
return @as(usize, @intCast(i));
}
};
var __koru_grid_xref: __KoruGridT_xref = .{};
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_253_positional_row_addressing_through_a_grid/input.k:41 ~std.control:for()
pub fn flow0() void {
for (0..8) |__koru_item2| {
{ const i = __koru_item2; _ = &i; const result_e0_0 = main_module.__store_insertf_agents_event.handler(.{ .aid = __koru_intcast(i64, i), .hp = 100, .__site_line = 42 });
_ = &result_e0_0;
switch (result_e0_0) {
// >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_253_positional_row_addressing_through_a_grid/input.k:43 | row t |>
.row => |t| {
_ = main_module.__grid_write_L43_fba4_event.handler(.{ .__koru_gwx0 = main_module.__KoruGridT_xref.__koru_wide(i), .__koru_gwv0 = t });
},
// >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_253_positional_row_addressing_through_a_grid/input.k:44 | full |>
.full => {
},
}
}
}
{ }
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_253_positional_row_addressing_through_a_grid/input.k:49 ~input:__store_sweeprun_agents_L50_690_253_positional_row_addressing_through_a_grid_input_cecd50()
pub fn flow1() void {
_ = main_module.__store_sweeprun_agents_L50_690_253_positional_row_addressing_through_a_grid_input_cecd50_event.handler(.{ });
}
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_253_positional_row_addressing_through_a_grid/input.k:52 ~input:__store_sweeprun_agents_L53_690_253_positional_row_addressing_through_a_grid_input_cecd50()
pub fn flow2() void {
_ = main_module.__store_sweeprun_agents_L53_690_253_positional_row_addressing_through_a_grid_input_cecd50_event.handler(.{ });
}
pub fn koru_start_flow() void {
const result_0 = koru_koru.start_event.handler(.{ });
const result_0_done = result_0.done;
_ = &result_0_done;
}
pub fn koru_end_flow() void {
const result_0 = koru_koru.end_event.handler(.{ });
const result_0_done = result_0.done;
_ = &result_0_done;
}
const __KoruStoreT_agents = struct {
aid: [8]i64 = undefined,
hp: [8]i64 = undefined,
len: usize = 0,
__koru_hslot_row: [8]usize = undefined,
__koru_hslot_gen: [8]u32 = [_]u32{0} ** 8,
__koru_row_hslot: [8]usize = undefined,
__koru_hslot_free: [8]usize = undefined,
__koru_hslot_free_len: usize = 0,
__koru_hslot_next: usize = 0,
// `__koru_ident` — no removal has run, so slot == dense row
// for every live row; mint/resolve skip both table loads, the
// first take materialises and flips it, drain and clear
// re-arm it by resetting the slot space. `__koru_gen0` — no gen
// bump has ever run; it implies slot == row for every minted
// slot, so resolve sheds the gen load entirely.
__koru_ident: bool = true, __koru_gen0: bool = true,
const __koru_brand: u32 = 1;
fn __koru_materialize(self: *@This()) void {
if (!self.__koru_ident) return;
for (0..self.len) |i| { self.__koru_hslot_row[i] = i; self.__koru_row_hslot[i] = i; }
self.__koru_ident = false;
}
fn __koru_row_of(self: *const @This(), h: i64) ?usize {
if (h < 0) return null;
const u = @as(u64, @bitCast(h));
const slot32 = @as(u32, @truncate(u));
if ((slot32 >> 24) != __koru_brand) return null;
const slot = @as(usize, @intCast(slot32 & 0xFFFFFF));
if (slot >= self.__koru_hslot_next) return null;
if (self.__koru_gen0) { if (u >> 32 != 0) return null; return slot; }
if (@as(u32, @truncate(u >> 32)) != self.__koru_hslot_gen[slot]) return null;
if (self.__koru_ident) return slot;
const __koru_r = self.__koru_hslot_row[slot];
if (__koru_r >= self.len) return null;
return __koru_r;
}
// DO NOT "simplify" into one pass — pre-check + row_of tail
// call keeps resolve under the inline threshold; callers
// inline BOTH and LLVM CSEs the duplicate checks into one
// validation in machine code. A flat single pass crossed
// the threshold: +57% read_handle, +2.6x write_handle
// (007 board, 2026-09-26). Shape, not count.
fn __koru_resolve(self: *const @This(), h: i64) usize {
if (h >= 0) {
const u = @as(u64, @bitCast(h));
const slot32 = @as(u32, @truncate(u));
if ((slot32 >> 24) != __koru_brand) @panic("std/store: 'agents[...]' does not address a row - the value is not a handle this store issued (handles come from `| row` and row cursors)");
const slot = @as(usize, @intCast(slot32 & 0xFFFFFF));
if (self.__koru_gen0) {
if (u >> 32 != 0 and slot < self.__koru_hslot_next) @panic("std/store: stale row handle into store 'agents' - the row it addressed was removed (stale-handle trap pinned at 690_115)");
} else if (slot < self.__koru_hslot_next and @as(u32, @truncate(u >> 32)) != self.__koru_hslot_gen[slot]) @panic("std/store: stale row handle into store 'agents' - the row it addressed was removed (stale-handle trap pinned at 690_115)");
}
return self.__koru_row_of(h) orelse @panic("std/store: 'agents[...]' does not address a row - the value is not a handle this store issued (handles come from `| row` and row cursors)");
}
fn __koru_handle_of(self: *const @This(), dense: usize) i64 {
if (self.__koru_gen0) return @as(i64, @intCast(dense | (@as(usize, __koru_brand) << 24)));
var slot = dense;
if (!self.__koru_ident) slot = self.__koru_row_hslot[dense];
return @as(i64, @intCast(slot | (@as(usize, __koru_brand) << 24))) | (@as(i64, @intCast(self.__koru_hslot_gen[slot])) << 32);
}
};
var __koru_store_agents: __KoruStoreT_agents = .{};
const __KoruStoreRow_agents = struct { aid: i64, hp: i64 };
pub const __store_insertf_agents_event = struct {
pub const Input = struct {
aid: i64,
hp: i64,
__site_line: i64,
};
pub const Output = union(enum(u8)) {
row: i64,
full: struct {
},
};
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.aid, __koru_event_input.hp, __koru_event_input.__site_line);
}
fn __koru_handler_impl(__koru_p_0: i64, __koru_p_1: i64, __koru_p_2: i64) @This().Output {
const __koru_event_input: @This().Input = .{ .aid = __koru_p_0, .hp = __koru_p_1, .__site_line = __koru_p_2 };
// >>> PROC: __store_insertf_agents [tests/regression/600_STDLIB/690_STORE/690_253_positional_row_addressing_through_a_grid/input.k:36]
const aid = __koru_event_input.aid;
const hp = __koru_event_input.hp;
const __site_line = __koru_event_input.__site_line;
_ = &aid;
_ = &hp;
_ = &__site_line;
_ = &__koru_event_input;
if (__koru_store_agents.len >= 8) return .{ .full = .{} };
if (__koru_store_agents.len >= 8) @panic("std/store: store 'agents' is full (capacity 8) - declared capacity and the `| full` branch are pinned at 690_011");
const __koru_new_row = __koru_store_agents.len;
const __koru_hslot = if (__koru_store_agents.__koru_hslot_free_len > 0) blk_hs: {
__koru_store_agents.__koru_hslot_free_len -= 1;
break :blk_hs __koru_store_agents.__koru_hslot_free[__koru_store_agents.__koru_hslot_free_len];
} else blk_hs: {
const __koru_hn = __koru_store_agents.__koru_hslot_next;
__koru_store_agents.__koru_hslot_next += 1;
break :blk_hs __koru_hn;
};
if (!__koru_store_agents.__koru_ident) {
__koru_store_agents.__koru_hslot_row[__koru_hslot] = __koru_new_row;
__koru_store_agents.__koru_row_hslot[__koru_new_row] = __koru_hslot;
}
__koru_store_agents.aid[__koru_new_row] = aid;
__koru_store_agents.hp[__koru_new_row] = hp;
__koru_store_agents.len += 1;
return .{ .row = __koru_store_agents.__koru_handle_of(__koru_new_row) };
}
};
pub const __store_apply_agents_event = struct {
pub const Input = struct {
row: usize,
field: i64,
value_0: i64,
value_1: i64,
};
pub const Output = union(enum(u8)) {
aid: i64,
hp: i64,
};
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> PROC: __store_apply_agents [tests/regression/600_STDLIB/690_STORE/690_253_positional_row_addressing_through_a_grid/input.k:36]
const row = __koru_event_input.row;
const field = __koru_event_input.field;
const value_0 = __koru_event_input.value_0;
const value_1 = __koru_event_input.value_1;
_ = &row;
_ = &field;
_ = &value_0;
_ = &value_1;
_ = &__koru_event_input;
const __koru_r: usize = row;
return switch (field) {
0 => blk: { __koru_store_agents.aid[__koru_r] = value_0; break :blk .{ .aid = value_0 }; },
1 => blk: { __koru_store_agents.hp[__koru_r] = value_1; break :blk .{ .hp = value_1 }; },
else => unreachable,
};
}
};
pub const __store_write_agents_event = struct {
pub const Input = struct {
row: usize,
field: i64,
value_0: i64,
value_1: i64,
};
pub const Output = void;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_253_positional_row_addressing_through_a_grid/input.k:36
const row = __koru_event_input.row;
const field = __koru_event_input.field;
const value_0 = __koru_event_input.value_0;
const value_1 = __koru_event_input.value_1;
_ = &row;
_ = &field;
_ = &value_0;
_ = &value_1;
_ = &__koru_event_input;
const result = main_module.__store_apply_agents_event.handler(.{ .row = row, .field = field, .value_0 = value_0, .value_1 = value_1 });
return switch (result) {
.aid => {},
.hp => {},
};
}
};
pub const __grid_write_L43_fba4_event = struct {
pub const Input = struct {
__koru_gwx0: i64,
__koru_gwv0: i64,
};
pub const Output = void;
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.__koru_gwx0, __koru_event_input.__koru_gwv0);
}
fn __koru_handler_impl(__koru_p_0: i64, __koru_p_1: i64) @This().Output {
const __koru_event_input: @This().Input = .{ .__koru_gwx0 = __koru_p_0, .__koru_gwv0 = __koru_p_1 };
// >>> PROC: __grid_write_L43_fba4 [tests/regression/600_STDLIB/690_STORE/690_253_positional_row_addressing_through_a_grid/input.k:43]
const __koru_gwx0 = __koru_event_input.__koru_gwx0;
const __koru_gwv0 = __koru_event_input.__koru_gwv0;
_ = &__koru_gwx0;
_ = &__koru_gwv0;
_ = &__koru_event_input;
(&main_module.__koru_grid_xref.h)[main_module.__KoruGridT_xref.__koru_at(__koru_gwx0)] = __koru_gwv0;
}
};
pub const __store_sweepbody_agents_L50_690_253_positional_row_addressing_through_a_grid_input_cecd50_event = struct {
pub const Input = struct {
__koru_sdix_a_L50: usize,
};
pub const Output = void;
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.__koru_sdix_a_L50);
}
fn __koru_handler_impl(__koru_p_0: usize) @This().Output {
const __koru_event_input: @This().Input = .{ .__koru_sdix_a_L50 = __koru_p_0 };
// >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_253_positional_row_addressing_through_a_grid/input.k:49
const __koru_sdix_a_L50 = __koru_event_input.__koru_sdix_a_L50;
_ = &__koru_sdix_a_L50;
_ = &__koru_event_input;
const result = main_module.__store_write_agents_event.handler(.{ .row = __koru_store_agents.__koru_resolve((&main_module.__koru_grid_xref.h)[main_module.__KoruGridT_xref.__koru_at(@as(usize, @intCast(@mod(__koru_store_agents.aid[__koru_sdix_a_L50], 3))))]), .field = 1, .value_0 = 0, .value_1 = (&__koru_store_agents.hp)[__koru_store_agents.__koru_resolve((&main_module.__koru_grid_xref.h)[main_module.__KoruGridT_xref.__koru_at(@as(usize, @intCast(@mod(__koru_store_agents.aid[__koru_sdix_a_L50], 3))))])] - 35 });
_ = &result;
}
};
pub const __store_sweeprun_agents_L50_690_253_positional_row_addressing_through_a_grid_input_cecd50_event = struct {
pub const Input = struct {
};
pub const Output = void;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> PROC: __store_sweeprun_agents_L50_690_253_positional_row_addressing_through_a_grid_input_cecd50 [tests/regression/600_STDLIB/690_STORE/690_253_positional_row_addressing_through_a_grid/input.k:49]
_ = &__koru_event_input;
{
for (0..main_module.__koru_store_agents.len) |__koru_si| {
main_module.__store_sweepbody_agents_L50_690_253_positional_row_addressing_through_a_grid_input_cecd50_event.handler(.{ .__koru_sdix_a_L50 = __koru_si });
}
}
return;
}
};
pub const __store_sweepbody_agents_L53_690_253_positional_row_addressing_through_a_grid_input_cecd50_event = struct {
pub const Input = struct {
__koru_srf_e_L53_aid: i64,
__koru_srf_e_L53_hp: i64,
__koru_sdix_e_L53: usize,
};
pub const Output = void;
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.__
... [truncated - 24KB total]Flows
flow ~new click a branch to expand · @labels scroll to their anchor
new (agents, capacity: 8, source: aid: i64, hp: i64)
flow ~new click a branch to expand · @labels scroll to their anchor
new (xref, size: 8, source: h: 0[i64])
flow ~for click a branch to expand · @labels scroll to their anchor
for (0..8)
flow ~query click a branch to expand · @labels scroll to their anchor
query (agents)
flow ~query click a branch to expand · @labels scroll to their anchor
query (agents)
Test Configuration
MUST_RUN