✓
Passing This code compiles and runs correctly.
Code
// 690_256's twin, and the ONLY program that discriminates between store.kz's
// two copies of the whole-program cell-path walk.
//
// The walk that rewrites `<store>.<field>` into `__koru_store_<store>.<field>`
// exists twice: once on `std/store:new`'s singleton road and once on its plural
// road, in separate scopes, each enumerating the expression positions it visits
// by hand. Both enumerate over EVERY store name visible in the program, not
// just their own — so whichever `new` transform runs FIRST does the rewriting
// and the later one is a no-op.
//
// 690_256 declares only a singleton, so its singleton copy always wins and the
// plural copy is never asked. Declaring a plural store ABOVE the singleton
// flips the order: the plural walk reaches the branch payload first, and the
// singleton walk that fixes 690_256 arrives to find nothing left to do. That is
// the whole difference between the two files, and it is why the plural line is
// here rather than folded into its neighbour.
//
// MEASURED, not assumed — each arm was made inert in turn:
// singleton arm off, this program -> still compiles (plural arm carried it)
// plural arm only, 690_256 -> still `use of undeclared identifier 's'`
//
// A rule spelled twice in two scopes is the standing hazard here: 690_250's
// note already records `indexedFieldRefs` being complete in one copy and absent
// from another, which is the same disease one position over. Two tests is the
// cheapest way to notice when only one copy gets widened next time.
import std/io
import std/store
std/store:new(p, capacity: 2) { v: i64 }
std/store:new(s, capacity: 1) { n: 7[i64] }
pub tor pick {}
| got i64
| none
pick = if(s.n > 0)
| then => got s.n
| else => none
pick()
| got v |> std/io:print.ln("{{ v:d }}")
| none |> std/io:print.ln("none")
Actual
7
Expected output
✓ Zig✓ C#7
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 'p' created (SoA cell + insert/query/write/take/stripe units); fields v: i64
// std/store: 's' created (cell + write-subflow at module scope); fields n: i64
pub const pick_event = struct {
pub const Input = struct {
};
pub const Output = union(enum(u8)) {
got: i64,
none: struct {
},
};
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> SUBFLOW: tests/regression/600_STDLIB/690_STORE/690_257_branch_payload_when_a_plural_store_walks_first/input.k:37
_ = &__koru_event_input;
if (__koru_store_s.n > 0) {
{ return .{ .got = __koru_store_s.n };
}
} else {
{ return .{ .none = .{ } };
}
}
}
};
// >>> FLOW: tests/regression/600_STDLIB/690_STORE/690_257_branch_payload_when_a_plural_store_walks_first/input.k:41 ~input:pick()
pub fn flow0() void {
const result_0 = main_module.pick_event.handler(.{ });
switch (result_0) {
// >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_257_branch_payload_when_a_plural_store_walks_first/input.k:42 | got v |>
.got => |v| {
(struct { fn __kout(__fd: i32, __b: []const u8) void { if (@import("builtin").os.tag == .freestanding) { const __kc = struct { extern var stdout: ?*anyopaque; extern var stderr: ?*anyopaque; extern fn fputs(__s: [*:0]const u8, __st: ?*anyopaque) c_int; }; var __kt: [4096]u8 = undefined; for (0..(__b.len + __kt.len - 2) / (__kt.len - 1)) |__ki| { const __kn = @min(__kt.len - 1, __b.len - __ki * (__kt.len - 1)); @memcpy(__kt[0..__kn], __b[__ki * (__kt.len - 1)..][0..__kn]); __kt[__kn] = 0; @import("std").mem.doNotOptimizeAway(__kc.fputs(@as([*:0]const u8, @ptrCast(&__kt)), if (__fd == 2) __kc.stderr else __kc.stdout)); } } else { @import("std").mem.doNotOptimizeAway(@import("std").posix.write(__fd, __b) catch @as(usize, 0)); } } fn __kw(comptime __f: []const u8, __a: anytype) void { var __kb: [65536]u8 = undefined; const __ks = @import("std").fmt.bufPrint(&__kb, __f, __a) catch __kb[0..0]; __kout(1, __ks); } }).__kw("{d}\n", .{v});
},
// >>> BRANCH: tests/regression/600_STDLIB/690_STORE/690_257_branch_payload_when_a_plural_store_walks_first/input.k:43 | none |>
.none => {
(struct { fn __kout(__fd: i32, __b: []const u8) void { if (@import("builtin").os.tag == .freestanding) { const __kc = struct { extern var stdout: ?*anyopaque; extern var stderr: ?*anyopaque; extern fn fputs(__s: [*:0]const u8, __st: ?*anyopaque) c_int; }; var __kt: [4096]u8 = undefined; for (0..(__b.len + __kt.len - 2) / (__kt.len - 1)) |__ki| { const __kn = @min(__kt.len - 1, __b.len - __ki * (__kt.len - 1)); @memcpy(__kt[0..__kn], __b[__ki * (__kt.len - 1)..][0..__kn]); __kt[__kn] = 0; @import("std").mem.doNotOptimizeAway(__kc.fputs(@as([*:0]const u8, @ptrCast(&__kt)), if (__fd == 2) __kc.stderr else __kc.stdout)); } } else { @import("std").mem.doNotOptimizeAway(@import("std").posix.write(__fd, __b) catch @as(usize, 0)); } } fn __kw(comptime __f: []const u8, __a: anytype) void { var __kb: [65536]u8 = undefined; const __ks = @import("std").fmt.bufPrint(&__kb, __f, __a) catch __kb[0..0]; __kout(1, __ks); } }).__kw("none\n", .{});
},
}
}
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_p = struct {
v: [2]i64 = undefined,
len: usize = 0,
};
var __koru_store_p: __KoruStoreT_p = .{};
const __KoruStoreRow_p = struct { v: i64 };
pub const __store_apply_p_event = struct {
pub const Input = struct {
row: usize,
field: i64,
value_0: i64,
};
pub const Output = union(enum(u8)) {
v: i64,
};
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> PROC: __store_apply_p [tests/regression/600_STDLIB/690_STORE/690_257_branch_payload_when_a_plural_store_walks_first/input.k:30]
const row = __koru_event_input.row;
const field = __koru_event_input.field;
const value_0 = __koru_event_input.value_0;
_ = &row;
_ = &field;
_ = &value_0;
_ = &__koru_event_input;
const __koru_r: usize = row;
return switch (field) {
0 => blk: { __koru_store_p.v[__koru_r] = value_0; break :blk .{ .v = value_0 }; },
else => unreachable,
};
}
};
const __KoruStoreT_s = blk: {
const __info = @typeInfo(@TypeOf(.{ .n = @as(i64, 7) }));
var __fields: [__info.@"struct".fields.len]@import("std").builtin.Type.StructField = undefined;
for (__info.@"struct".fields, 0..) |__f, __i| {
__fields[__i] = .{ .name = __f.name, .type = __f.type, .default_value_ptr = null, .is_comptime = false, .alignment = __f.alignment };
}
break :blk @Type(.{ .@"struct" = .{ .layout = .auto, .fields = &__fields, .decls = &.{}, .is_tuple = false } });
};
var __koru_store_s: __KoruStoreT_s = .{ .n = @as(i64, 7) };
pub const __store_apply_s_event = struct {
pub const Input = struct {
field: i64,
value: i64,
};
pub const Output = union(enum(u8)) {
n: i64,
};
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> PROC: __store_apply_s [tests/regression/600_STDLIB/690_STORE/690_257_branch_payload_when_a_plural_store_walks_first/input.k:31]
const field = __koru_event_input.field;
const value = __koru_event_input.value;
_ = &field;
_ = &value;
_ = &__koru_event_input;
return switch (field) {
0 => blk: { __koru_store_s.n = value; break :blk .{ .n = value }; },
else => unreachable,
};
}
};
pub const __store_announce_s_event = struct {
pub const Input = struct {
field: i64,
};
pub const Output = void;
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.field);
}
fn __koru_handler_impl(__koru_p_0: i64) @This().Output {
const __koru_event_input: @This().Input = .{ .field = __koru_p_0 };
// >>> PROC: __store_announce_s [tests/regression/600_STDLIB/690_STORE/690_257_branch_payload_when_a_plural_store_walks_first/input.k:31]
const field = __koru_event_input.field;
_ = &field;
_ = &__koru_event_input;
return;
}
};
};
pub const koru_koru = struct {
pub const start_event = struct {
pub const Input = struct {
};
pub const Output = union(enum(u8)) {
done: struct {
},
};
pub fn handler(__koru_event_input: @This().Input) @This().Output {
_ = &__koru_event_input;
return .{ .done = .{} };
}
};
pub const end_event = struct {
pub const Input = struct {
};
pub const Output = union(enum(u8)) {
done: struct {
},
};
pub fn handler(__koru_event_input: @This().Input) @This().Output {
_ = &__koru_event_input;
return .{ .done = .{} };
}
};
};
pub fn main() void {
main_module.koru_start_flow();
main_module.flow0();
main_module.koru_end_flow();
if (comptime @import("builtin").mode == .Debug) koru_leak_check();
}
test {
@import("std").testing.refAllDeclsRecursive(@This());
}
Emitted C# source
static class main_module {
public static void __koru_stdout_write(dynamic s) => global::System.Console.Out.Write(s);
public static void __koru_stderr_write(dynamic s) => global::System.Console.Error.Write(s);
// The mutable handle carrier — `*String`-style resources are
// `new __KoruBox { data = … }` because C# anonymous types are
// read-only: `s.data = …` (std/string append/clear, handle
// mutation generally) needs a settable member.
public class __KoruBox { public dynamic data; }
// Textification for `{{ … }}` operands: C# bool ToStrings as
// `True` where Koru prints `true`, and the operand's static type
// is unknown at this boundary — a `(x) is bool` inline test would
// be a compile error on statically-typed operands instead. Generic
// on purpose: `dynamic` boxed every value-type operand — measured
// ~1s/10M elements on 012_threat_scanner — while T specializes to
// the operand's own ToString() with no box.
public static string __koru_str<T>(T v) => v is bool b ? (b ? "true" : "false") : v?.ToString();
// std/store: plural store 'p' created (SoA cell + insert/query/write/take/stripe units); fields v: i64
// std/store: 's' created (cell + write-subflow at module scope); fields n: i64
static class __koru_store_p {
public static long[] v = new long[2];
public static long len = 0;
public static long __koru_brand = -1;
}
static class __koru_store_s {
public static long n = 7;
public static long __koru_brand = -1;
}
public static class pick_event {
public struct Input {
}
public struct Output {
public string tag;
public long got;
public dynamic none;
}
public static Output handler(Input __koru_input) {
if (__koru_store_s.n > 0) {
{ return new Output { tag = "got", got = __koru_store_s.n };
}
} else {
{ return new Output { tag = "none" };
}
}
return default;
}
}
public static class __store_apply_p_event {
public struct Input {
public long row;
public long field;
public long value_0;
}
public struct Output {
public string tag;
public long v;
}
public static Output handler(Input __koru_input) {
var row = __koru_input.row;
var field = __koru_input.field;
var value_0 = __koru_input.value_0;
var __koru_r = row;
switch (field) {
case 0: { __koru_store_p.v[__koru_r] = value_0; return new Output { tag = "v", v = value_0 }; }
}
throw new global::System.Exception("__store_apply_p: field index " + field + " is not a column of store 'p'");
return default;
}
}
public static class __store_apply_s_event {
public struct Input {
public long field;
public long value;
}
public struct Output {
public string tag;
public long n;
}
public static Output handler(Input __koru_input) {
var field = __koru_input.field;
var value = __koru_input.value;
switch (field) {
case 0: { __koru_store_s.n = value; return new Output { tag = "n", n = value }; }
}
throw new global::System.Exception("__store_apply_s: field index " + field + " is not a column of store 's'");
return default;
}
}
public static class __store_announce_s_event {
public struct Input {
public long field;
}
public static dynamic handler(Input __koru_input) {
var field = __koru_input.field;
return default;
}
}
public static class std_control_if_event {
public struct Input {
public dynamic expr;
}
public struct Output {
public string tag;
public dynamic then;
public dynamic @else;
}
public static Output handler(Input __koru_input) {
var expr = __koru_input.expr;
throw new global::System.Exception("if: |template| proc is inlined at call sites and must never be called");
}
}
public static class koru_start_event {
public struct Input {
}
public struct Output {
public string tag;
public dynamic done;
}
public static Output handler(Input __koru_input) => new Output { tag = "done" };
}
public static class koru_end_event {
public struct Input {
}
public struct Output {
public string tag;
public dynamic done;
}
public static Output handler(Input __koru_input) => new Output { tag = "done" };
}
public static void flow0() {
var result_0 = main_module.pick_event.handler(new pick_event.Input { });
if (result_0.tag == "got") {
var v = result_0.got;
__koru_stdout_write("" + __koru_str(v) + "\n");
}
if (result_0.tag == "none") {
__koru_stdout_write("none" + "\n");
}
}
public static void flow1() {
main_module.koru_start_event.handler(new koru_start_event.Input { });
}
public static void flow2() {
main_module.koru_end_event.handler(new koru_end_event.Input { });
}
}
static class Program {
static void Main() {
main_module.flow1();
main_module.flow0();
main_module.flow2();
}
}
Flows
flow ~new click a branch to expand · @labels scroll to their anchor
new (p, capacity: 2, source: v: i64)
flow ~new click a branch to expand · @labels scroll to their anchor
new (s, capacity: 1, source: n: 7[i64])
subflow ~pick click a branch to expand · @labels scroll to their anchor
if (s.n > 0)
flow ~pick click a branch to expand · @labels scroll to their anchor
pick
Test Configuration
MUST_RUN LANGUAGES: zig cs