✓
Passing This code compiles and runs correctly.
Code
// Test 608: Event Taps with Label Jumps
// Validates that taps fire when continuations use label jumps (@label)
//
// BUG: Tap function __tap0 is generated but never called in label loops
// Expected: __tap0(v) should be invoked after .next branch binding
// Actual: Tap invocation is missing, so no output is produced
const std = @import("std");
~import std/taps
~tor counter { n: i32 }
| next i32
| done i32
~proc counter|zig {
if (n < 3) {
return .{ .next = n + 1 };
}
return .{ .done = n };
}
~tor log-iteration { value: i32 }
~proc log-iteration|zig {
std.debug.print("Iteration: {}\n", .{value});
}
// Tap that should fire on every counter -> * transition with 'next' branch
~tap(counter -> *)
| next v |> log-iteration(value: v)
// Recursive label using counter - tap should fire on each loop iteration
~tor start {}
~proc start|zig {
}
~start() |> #loop counter(n: 1)
| next v |> @loop(n: v)
| done |> _
Supporting Files
~proc counter|cs {
if (n < 3) {
return new Output { tag = "next", next = n + 1 };
}
return new Output { tag = "done", done = n };
}
~proc log-iteration|cs {
__koru_stdout_write($"Iteration: {value}\n");
}
~proc start|cs {
}Actual
Iteration: 2
Iteration: 3
Expected output
✓ Zig✓ C#Iteration: 2
Iteration: 3
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");
pub const counter_event = struct {
pub const Input = struct {
n: i32,
};
pub const Output = union(enum(u8)) {
next: i32,
done: i32,
};
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.n);
}
fn __koru_handler_impl(__koru_p_0: i32) @This().Output {
const __koru_event_input: @This().Input = .{ .n = __koru_p_0 };
// >>> PROC: counter [tests/regression/300_ADVANCED_FEATURES/310_COMPTIME/310_014_taps_with_labels/input.kz:16]
const n = __koru_event_input.n;
_ = &n;
_ = &__koru_event_input;
if (n < 3) {
return .{ .next = n + 1 };
}
return .{ .done = n };
}
};
pub const log_iteration_event = struct {
pub const Input = struct {
value: i32,
};
pub const Output = void;
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.value);
}
fn __koru_handler_impl(__koru_p_0: i32) @This().Output {
const __koru_event_input: @This().Input = .{ .value = __koru_p_0 };
// >>> PROC: log_iteration [tests/regression/300_ADVANCED_FEATURES/310_COMPTIME/310_014_taps_with_labels/input.kz:25]
const value = __koru_event_input.value;
_ = &value;
_ = &__koru_event_input;
std.debug.print("Iteration: {}\n", .{value});
}
};
pub const start_event = struct {
pub const Input = struct {
};
pub const Output = void;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> PROC: start [tests/regression/300_ADVANCED_FEATURES/310_COMPTIME/310_014_taps_with_labels/input.kz:36]
_ = &__koru_event_input;
}
};
// >>> FLOW: tests/regression/300_ADVANCED_FEATURES/310_COMPTIME/310_014_taps_with_labels/input.kz:39 ~input:start()
pub fn flow0() void {
_ = main_module.start_event.handler(.{ });
var loop_n: i32 = 1;
loop: while (true) {
const result_1 = main_module.counter_event.handler(.{ .n = loop_n });
switch (result_1) {
// >>> BRANCH: tests/regression/300_ADVANCED_FEATURES/310_COMPTIME/310_014_taps_with_labels/input.kz:41 | done |>
.done => |_| {
},
.next => |v| {
const result_2 = main_module.log_iteration_event.handler(.{ .value = v });
_ = &result_2;
loop_n = v;
continue :loop;
},
}
break :loop;
}
}
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
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 counter_event {
public struct Input {
public int n;
}
public struct Output {
public string tag;
public int next;
public int done;
}
public static Output handler(Input __koru_input) {
var n = __koru_input.n;
if (n < 3) {
return new Output { tag = "next", next = n + 1 };
}
return new Output { tag = "done", done = n };
return default;
}
}
public static class log_iteration_event {
public struct Input {
public int value;
}
public static dynamic handler(Input __koru_input) {
var value = __koru_input.value;
__koru_stdout_write($"Iteration: {value}\n");
return default;
}
}
public static class start_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
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() {
{
}
int loopn = 1;
var result_0 = main_module.counter_event.handler(new counter_event.Input { n = (int)(loopn)});
__fold_loop_check:
while (result_0.tag == "next") {
var v = result_0.next;
{
var __koru_p_value = (int)(v);
__koru_stdout_write($"Iteration: {__koru_p_value}\n");
}
loopn = v;
result_0 = main_module.counter_event.handler(new counter_event.Input { n = (int)(loopn)});
goto __fold_loop_check;
}
}
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 ~tap click a branch to expand · @labels scroll to their anchor
tap (counter -> *)
flow ~start click a branch to expand · @labels scroll to their anchor
start
Test Configuration
MUST_RUN LANGUAGES: zig cs