✓
Passing This code compiles and runs correctly.
Code
// PIN: the frontend (koruc, src/main.zig generateTransformHandlersToEmitter)
// collected transform handlers into a FIXED [16]TransformEvent array and
// silently stopped wiring at `transform_count < 16` — no error, no warning.
// A handful of always-present implicit transforms (capture/assert/test/...)
// eat 3 slots, so a program with 14+ user transforms silently lost handlers.
// A dropped handler leaves its invocation un-transformed, so the event's
// `transformed` branch can't be satisfied -> KORU022 at the call site, even
// though every transform here is correctly defined.
//
// There is NO legitimate reason to cap the NUMBER of distinct transforms; the
// only principled guard against runaway transformation is the fixpoint
// circuit-breaker (transform_pass_runner.zig MAX_ITERATIONS = 1000), which
// catches a transform that never reaches a fixpoint. This test exercises 20
// distinct transforms (well over the old 16-handler ceiling): it must compile
// and run clean once the array becomes an unbounded ArrayList.
//
// Each transform replaces its invocation with a comment (no output); success
// is a clean compile + run with empty output (same shape as 700_002).
~[comptime|transform]pub tor t1.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t1.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t1 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
~[comptime|transform]pub tor t2.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t2.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t2 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
~[comptime|transform]pub tor t3.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t3.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t3 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
~[comptime|transform]pub tor t4.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t4.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t4 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
~[comptime|transform]pub tor t5.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t5.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t5 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
~[comptime|transform]pub tor t6.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t6.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t6 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
~[comptime|transform]pub tor t7.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t7.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t7 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
~[comptime|transform]pub tor t8.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t8.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t8 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
~[comptime|transform]pub tor t9.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t9.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t9 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
~[comptime|transform]pub tor t10.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t10.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t10 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
~[comptime|transform]pub tor t11.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t11.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t11 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
~[comptime|transform]pub tor t12.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t12.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t12 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
~[comptime|transform]pub tor t13.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t13.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t13 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
~[comptime|transform]pub tor t14.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t14.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t14 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
~[comptime|transform]pub tor t15.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t15.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t15 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
~[comptime|transform]pub tor t16.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t16.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t16 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
~[comptime|transform]pub tor t17.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t17.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t17 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
~[comptime|transform]pub tor t18.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t18.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t18 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
~[comptime|transform]pub tor t19.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t19.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t19 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
~[comptime|transform]pub tor t20.* { expr: Expression, item: *const std/compiler:Item, program: *const std/compiler:Program } -> SiteResult
~proc t20.*|zig {
const ast = @import("ast");
const allocator = @import("std").heap.page_allocator;
const flow = if (item.* == .flow) &item.flow else return .{};
return .{ .replacement = ast.Item{ .inline_code = .{ .code = "// t20 ran", .location = flow.location, .module = allocator.dupe(u8, flow.module) catch return .{} } } };
}
// Invoke all 20 — each must find its wired handler.
~t1.fire("x")
~t2.fire("x")
~t3.fire("x")
~t4.fire("x")
~t5.fire("x")
~t6.fire("x")
~t7.fire("x")
~t8.fire("x")
~t9.fire("x")
~t10.fire("x")
~t11.fire("x")
~t12.fire("x")
~t13.fire("x")
~t14.fire("x")
~t15.fire("x")
~t16.fire("x")
~t17.fire("x")
~t18.fire("x")
~t19.fire("x")
~t20.fire("x")
Actual
Expected output
✓ Zig✓ C#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 and !@import("builtin").cpu.arch.isWasm()) __koru_bare.allocator else @import("std").heap.page_allocator;
var __koru_leak_count: @import("std").atomic.Value(usize) = .init(0);
var __koru_par_tasks: @import("std").atomic.Value(usize) = .init(0);
const __koru_par_CAP: usize = 128;
threadlocal var __koru_par_depth: usize = 0;
const __koru_par_DEPTH_CAP: usize = 7;
var __koru_par_pool: @import("std").Thread.Pool = undefined;
var __koru_par_pool_ready: bool = false;
var __koru_par_pool_mtx: @import("std").Thread.Mutex = .{};
fn __koru_par_pool_ensure() *@import("std").Thread.Pool {
__koru_par_pool_mtx.lock();
defer __koru_par_pool_mtx.unlock();
if (!__koru_par_pool_ready) {
@import("std").Thread.Pool.init(&__koru_par_pool, .{ .allocator = @import("std").heap.smp_allocator }) catch @panic("koru: thread pool init failed");
__koru_par_pool_ready = true;
}
return &__koru_par_pool;
}
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));
}
fn __KoruPadI(comptime T: type) type {
const V = switch (@typeInfo(T)) { .comptime_int => i64, .comptime_float => f64, else => T };
return struct {
v: V,
width: usize,
pub fn format(self: @This(), w: *@import("std").Io.Writer) @import("std").Io.Writer.Error!void {
const rendered = @import("std").fmt.count("{d}", .{self.v});
const pad = self.width -| rendered;
for (0..pad) |_| try w.writeByte(' ');
try w.print("{d}", .{self.v});
}
};
}
pub fn __koru_pad_i(width: usize, value: anytype) __KoruPadI(@TypeOf(value)) {
return .{ .v = value, .width = width };
}
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 {
// t1 ran
// t2 ran
// t3 ran
// t4 ran
// t5 ran
// t6 ran
// t7 ran
// t8 ran
// t9 ran
// t10 ran
// t11 ran
// t12 ran
// t13 ran
// t14 ran
// t15 ran
// t16 ran
// t17 ran
// t18 ran
// t19 ran
// t20 ran
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.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(object s) => global::System.Console.Out.Write(s);
public static void __koru_stderr_write(object 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. `object`, not
// `dynamic`: the field is storage — every `x.data` read reaches
// it through a dynamic-typed handle (`*T` Input fields, the
// `dynamic` borrow locals below), so the member itself only
// needs to hold the value, and `object` keeps the DLR out of
// the store/load path.
public class __KoruBox { public object 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();
// t1 ran
// t2 ran
// t3 ran
// t4 ran
// t5 ran
// t6 ran
// t7 ran
// t8 ran
// t9 ran
// t10 ran
// t11 ran
// t12 ran
// t13 ran
// t14 ran
// t15 ran
// t16 ran
// t17 ran
// t18 ran
// t19 ran
// t20 ran
public static class koru_start_event {
public struct Input {
}
public struct Output {
public string tag;
public object 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 object done;
}
public static Output handler(Input __koru_input) => new Output { tag = "done" };
}
public static void flow0() {
main_module.koru_start_event.handler(new koru_start_event.Input { });
}
public static void flow1() {
main_module.koru_end_event.handler(new koru_end_event.Input { });
}
}
static class Program {
static void Main() {
main_module.flow0();
main_module.flow1();
}
}
Flows
flow ~t1.fire click a branch to expand · @labels scroll to their anchor
t1.fire ("x")
flow ~t2.fire click a branch to expand · @labels scroll to their anchor
t2.fire ("x")
flow ~t3.fire click a branch to expand · @labels scroll to their anchor
t3.fire ("x")
flow ~t4.fire click a branch to expand · @labels scroll to their anchor
t4.fire ("x")
flow ~t5.fire click a branch to expand · @labels scroll to their anchor
t5.fire ("x")
flow ~t6.fire click a branch to expand · @labels scroll to their anchor
t6.fire ("x")
flow ~t7.fire click a branch to expand · @labels scroll to their anchor
t7.fire ("x")
flow ~t8.fire click a branch to expand · @labels scroll to their anchor
t8.fire ("x")
flow ~t9.fire click a branch to expand · @labels scroll to their anchor
t9.fire ("x")
flow ~t10.fire click a branch to expand · @labels scroll to their anchor
t10.fire ("x")
flow ~t11.fire click a branch to expand · @labels scroll to their anchor
t11.fire ("x")
flow ~t12.fire click a branch to expand · @labels scroll to their anchor
t12.fire ("x")
flow ~t13.fire click a branch to expand · @labels scroll to their anchor
t13.fire ("x")
flow ~t14.fire click a branch to expand · @labels scroll to their anchor
t14.fire ("x")
flow ~t15.fire click a branch to expand · @labels scroll to their anchor
t15.fire ("x")
flow ~t16.fire click a branch to expand · @labels scroll to their anchor
t16.fire ("x")
flow ~t17.fire click a branch to expand · @labels scroll to their anchor
t17.fire ("x")
flow ~t18.fire click a branch to expand · @labels scroll to their anchor
t18.fire ("x")
flow ~t19.fire click a branch to expand · @labels scroll to their anchor
t19.fire ("x")
flow ~t20.fire click a branch to expand · @labels scroll to their anchor
t20.fire ("x")
Test Configuration
MUST_RUN LANGUAGES: zig cs