✓
Passing This code compiles and runs correctly.
Code
// PINS: when an inlined proc's arg name collides with a name already bound
// in the Zig scope, the bound-name rewrite mints `__koru_arg_<name>_<n>` and
// rewrites the spliced body — but `.m` is a MEMBER name, not a reference to
// the in-scope `m`. A struct-literal label (`.{ .m = ... }`), a member
// access (`p.m`), and an enum literal all bind to the left side's namespace;
// rewriting them emits field names the type never declared. Measured live:
// kopium's live.k emitted `p.* = .{ .__koru_arg_m_0 = __koru_arg_m_0 }`
// against koru_curl.Pending — "no field named '__koru_arg_m_0'".
//
// Control inside the same body: `0..m` — the range operator's second dot is
// not member position; the range end IS the reference and must still
// rewrite. A naive "skip when preceded by `.`" passes the compile and ships
// the wrong bound value (7, not 8) — the 44 in expected.txt pins the value,
// not just the shape.
//
// The collision needs the inline path: only an EFFECT branch (`!`) makes the
// invocation splice its proc body at the call site — terminal branches
// alone lower to an ordinary handler call and no mint fires (measured).
//
// Siblings: 230_016 (rewrote inside a string), 230_021 (rewrote a keyword's
// own position) — the same substitution blind to a context class. This is
// the third class: member position.
const std = @import("std");
// Declared at module level, OUTSIDE the spliced body — the way koru_curl's
// Pending lives in library code. A struct decl inside the body would be
// rewritten along with everything else and the corruption self-heals into
// compiling code (measured: decl, label, and access all flip together).
const P = struct { m: usize };
~tor mint {} -> usize
~proc mint|zig {
return 7;
}
~tor boxed { m: usize }
! ?tick usize
| ok usize
| err
~proc boxed|zig {
const p: P = .{ .m = m };
var s: usize = 0;
for (0..m) |i| {
s += i;
}
return .{ .ok = p.m + s + m };
}
~tor show { x: usize }
~proc show|zig {
std.debug.print("{d}\n", .{x});
}
// `: m` binds the name in the Zig scope, so `boxed`'s `m` param collides and
// mints __koru_arg_m_0. The body must keep .m / p.m spelled `m` while the
// reference positions (the init value, the range end, the tail sum) follow
// the mint.
~mint(): m
|> boxed(m: m + 1)
| ok r |> show(x: r)
| err |> show(x: 0)
Supporting Files
using static KoruHost;
static class KoruHost {
public class P {
public long m;
}
}
~proc mint|cs {
return 7;
}
~proc boxed|cs {
var p = new P { m = m };
long s = 0;
for (long i = 0; i < m; i++) {
s += i;
}
return new Output { tag = "ok", ok = p.m + s + m };
}
~proc show|cs {
__koru_stdout_write($"{x}\n");
}Actual
44
Expected output
✓ Zig✓ C#44
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 {
const std = @import("std");
const P = struct { m: usize };
pub const mint_event = struct {
pub const Input = struct {
};
pub const Output = usize;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> PROC: mint [tests/regression/200_COMPILER_FEATURES/230_EMITTER/230_023_member_name_is_not_a_reference/input.kz:34]
_ = &__koru_event_input;
return 7;
}
};
pub const boxed_event = struct {
pub const Input = struct {
m: usize,
};
pub const Output = union(enum(u8)) {
ok: usize,
err: struct {
},
};
pub fn handler(__koru_event_input: @This().Input, comptime __H: type) @This().Output {
const tick = if (@hasDecl(__H, "tick")) __H.tick else struct { fn __koru_noop(_: usize) void {} }.__koru_noop;
_ = &tick;
// >>> PROC: boxed [tests/regression/200_COMPILER_FEATURES/230_EMITTER/230_023_member_name_is_not_a_reference/input.kz:43]
const m = __koru_event_input.m;
_ = &m;
_ = &__koru_event_input;
const p: P = .{ .m = m };
var s: usize = 0;
for (0..m) |i| {
s += i;
}
return .{ .ok = p.m + s + m };
}
};
pub const show_event = struct {
pub const Input = struct {
x: usize,
};
pub const Output = void;
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.x);
}
fn __koru_handler_impl(__koru_p_0: usize) @This().Output {
const __koru_event_input: @This().Input = .{ .x = __koru_p_0 };
// >>> PROC: show [tests/regression/200_COMPILER_FEATURES/230_EMITTER/230_023_member_name_is_not_a_reference/input.kz:53]
const x = __koru_event_input.x;
_ = &x;
_ = &__koru_event_input;
std.debug.print("{d}\n", .{x});
}
};
// >>> FLOW: tests/regression/200_COMPILER_FEATURES/230_EMITTER/230_023_member_name_is_not_a_reference/input.kz:61 ~input:mint()
pub fn flow0() void {
const m = main_module.mint_event.handler(.{ });
const result_1: main_module.boxed_event.Output = __koru_proc_0: {
const __koru_arg_m_0 = (m + 1); _ = &__koru_arg_m_0;
const p: P = .{ .m = __koru_arg_m_0 };
var s: usize = 0;
for (0..__koru_arg_m_0) |i| {
s += i;
}
break :__koru_proc_0 .{ .ok = p.m + s + __koru_arg_m_0 };
};
_ = &result_1;
switch (result_1) {
// >>> BRANCH: tests/regression/200_COMPILER_FEATURES/230_EMITTER/230_023_member_name_is_not_a_reference/input.kz:63 | ok r |>
.ok => |r| {
_ = main_module.show_event.handler(.{ .x = r });
},
// >>> BRANCH: tests/regression/200_COMPILER_FEATURES/230_EMITTER/230_023_member_name_is_not_a_reference/input.kz:64 | err |>
.err => {
_ = main_module.show_event.handler(.{ .x = 0 });
},
}
}
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;
}
};
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
using static KoruHost;
static class KoruHost {
public class P {
public long m;
}
}
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();
public static class mint_event {
public struct Input {
}
public static long handler(Input __koru_input) {
return 7;
return default;
}
}
public static class boxed_event {
public struct Input {
public long m;
}
public struct Output {
public string tag;
public long ok;
public dynamic err;
}
public interface IOps {
void tick(long __koru_arg);
}
public static Output handler<H>(Input __koru_input, H ops) where H : struct, IOps {
void tick(long __koru_arg) => ops.tick(__koru_arg);
var m = __koru_input.m;
var p = new P { m = m };
long s = 0;
for (long i = 0; i < m; i++) {
s += i;
}
return new Output { tag = "ok", ok = p.m + s + m };
return default;
}
}
public static class show_event {
public struct Input {
public long x;
}
public static dynamic handler(Input __koru_input) {
var x = __koru_input.x;
__koru_stdout_write($"{x}\n");
return default;
}
}
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 m = main_module.mint_event.handler(new mint_event.Input { });
var __koru_handlers_0 = new __koru_handlers_0 { };
var result_1 = main_module.boxed_event.handler(new boxed_event.Input { m = (long)(m + 1)}, __koru_handlers_0);
if (result_1.tag == "ok") {
var r = result_1.ok;
{
var __koru_p_x = (long)(r);
__koru_stdout_write($"{__koru_p_x}\n");
}
}
if (result_1.tag == "err") {
{
var __koru_p_x = (long)(0);
__koru_stdout_write($"{__koru_p_x}\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 { });
}
struct __koru_handlers_0 : boxed_event.IOps {
public void tick(long __koru_arg) { }
}
}
static class Program {
static void Main() {
main_module.flow1();
main_module.flow0();
main_module.flow2();
}
}
Flows
flow ~mint click a branch to expand · @labels scroll to their anchor
mint
Test Configuration
MUST_RUN LANGUAGES: zig cs