nested labels

✓ Passing This code compiles and runs correctly.

Code

input.kz

Supporting Files

input.kcs

Actual

Starting nested loops...
Outer: 1
  Inner: 1, 1
  Inner: 1, 2
Outer: 2
  Inner: 2, 1
  Inner: 2, 2
Outer: 3

Expected output

✓ Zig✓ C#
Starting nested loops...
Outer: 1
  Inner: 1, 1
  Inner: 1, 2
Outer: 2
  Inner: 2, 1
  Inner: 2, 2
Outer: 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 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 {
    const std = @import("std");
    pub const outer_event = struct {
        pub const Input = struct {
            x: i32,
            max_inner: i32,
        };
        pub const Output = union(enum(u8)) {
            next_outer: struct {
                x: i32,
                max_inner: i32,
            },
            done_outer: struct {
            },
        };
        pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
            return __koru_handler_impl(__koru_event_input.x, __koru_event_input.max_inner);
        }
        fn __koru_handler_impl(__koru_p_0: i32, __koru_p_1: i32) @This().Output {
            const __koru_event_input: @This().Input = .{ .x = __koru_p_0, .max_inner = __koru_p_1 };
            // >>> PROC: outer  [tests/regression/000_CORE_LANGUAGE/040_CONTROL_FLOW/205_nested_labels/input.kz:16]
            const x = __koru_event_input.x;
            const max_inner = __koru_event_input.max_inner;
            _ = &x;
            _ = &max_inner;
            _ = &__koru_event_input;

                std.debug.print("Outer: {}\n", .{x});

                if (x < 3) {
                    return .{ .next_outer = .{ .x = x, .max_inner = max_inner } };
                } else {
                    return .{ .done_outer = .{} };
                }

        }
    };
    pub const inner_event = struct {
        pub const Input = struct {
            x: i32,
            y: i32,
            max_inner: i32,
        };
        pub const Output = union(enum(u8)) {
            next_inner: struct {
                x: i32,
                y: i32,
                max_inner: i32,
            },
            done_inner: struct {
                x: i32,
                max_inner: i32,
            },
        };
        pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
            return __koru_handler_impl(__koru_event_input.x, __koru_event_input.y, __koru_event_input.max_inner);
        }
        fn __koru_handler_impl(__koru_p_0: i32, __koru_p_1: i32, __koru_p_2: i32) @This().Output {
            const __koru_event_input: @This().Input = .{ .x = __koru_p_0, .y = __koru_p_1, .max_inner = __koru_p_2 };
            // >>> PROC: inner  [tests/regression/000_CORE_LANGUAGE/040_CONTROL_FLOW/205_nested_labels/input.kz:31]
            const x = __koru_event_input.x;
            const y = __koru_event_input.y;
            const max_inner = __koru_event_input.max_inner;
            _ = &x;
            _ = &y;
            _ = &max_inner;
            _ = &__koru_event_input;

                std.debug.print("  Inner: {}, {}\n", .{x, y});

                if (y < max_inner) {
                    return .{ .next_inner = .{ .x = x, .y = y + 1, .max_inner = max_inner } };
                } else {
                    return .{ .done_inner = .{ .x = x + 1, .max_inner = max_inner } };
                }

        }
    };
    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/000_CORE_LANGUAGE/040_CONTROL_FLOW/205_nested_labels/input.kz:44]
            _ = &__koru_event_input;

                std.debug.print("Starting nested loops...\n", .{});

        }
    };
    // >>> FLOW: tests/regression/000_CORE_LANGUAGE/040_CONTROL_FLOW/205_nested_labels/input.kz:50  ~input:start()
    pub fn flow0() void {
        _ = main_module.start_event.handler(.{  });
        var outer_loop_x: i32 = 1;
        var outer_loop_max_inner: i32 = 2;
        outer_loop: while (true) {
            const result_1 = main_module.outer_event.handler(.{ .x = outer_loop_x, .max_inner = outer_loop_max_inner });
            switch (result_1) {
                // >>> BRANCH: tests/regression/000_CORE_LANGUAGE/040_CONTROL_FLOW/205_nested_labels/input.kz:54  | done-outer |>
                .done_outer => {
                    break :outer_loop;
                },
                // >>> BRANCH: tests/regression/000_CORE_LANGUAGE/040_CONTROL_FLOW/205_nested_labels/input.kz:51  | next-outer o |>
                .next_outer => |o| {
                    var inner_loop_x: i32 = o.x;
                    var inner_loop_y: i32 = 1;
                    var inner_loop_max_inner: i32 = o.max_inner;
                    inner_loop: while (true) {
                        const result_2 = main_module.inner_event.handler(.{ .x = inner_loop_x, .y = inner_loop_y, .max_inner = inner_loop_max_inner });
                        switch (result_2) {
                            // >>> BRANCH: tests/regression/000_CORE_LANGUAGE/040_CONTROL_FLOW/205_nested_labels/input.kz:53  | done-inner d |>
                            .done_inner => |d| {
                                outer_loop_x = d.x;
                                outer_loop_max_inner = d.max_inner;
                                continue :outer_loop;
                            },
                            // >>> BRANCH: tests/regression/000_CORE_LANGUAGE/040_CONTROL_FLOW/205_nested_labels/input.kz:52  | next-inner i |>
                            .next_inner => |i| {
                                inner_loop_x = i.x;
                                inner_loop_y = i.y;
                                inner_loop_max_inner = i.max_inner;
                                continue :inner_loop;
                            },
                        }
                        break :inner_loop;
                    }
                },
            }
            break :outer_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(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();
  public static class outer_event {
    public struct Input {
      public int x;
      public int max_inner;
    }
    public struct Output {
      public string tag;
      public next_outer_payload next_outer;
      public object done_outer;
    }
    public struct next_outer_payload {
      public int x;
      public int max_inner;
    }
    public static Output handler(Input __koru_input) {
      var x = __koru_input.x;
      var max_inner = __koru_input.max_inner;
      __koru_stdout_write($"Outer: {x}\n");

      if (x < 3) {
      return new Output { tag = "next-outer", next_outer = new next_outer_payload { x = x, max_inner = max_inner } };
      } else {
      return new Output { tag = "done-outer", done_outer = new { } };
      }

      return default;

    }
  }
  public static class inner_event {
    public struct Input {
      public int x;
      public int y;
      public int max_inner;
    }
    public struct Output {
      public string tag;
      public next_inner_payload next_inner;
      public done_inner_payload done_inner;
    }
    public struct next_inner_payload {
      public int x;
      public int y;
      public int max_inner;
    }
    public struct done_inner_payload {
      public int x;
      public int max_inner;
    }
    public static Output handler(Input __koru_input) {
      var x = __koru_input.x;
      var y = __koru_input.y;
      var max_inner = __koru_input.max_inner;
      __koru_stdout_write($"  Inner: {x}, {y}\n");

      if (y < max_inner) {
      return new Output { tag = "next-inner", next_inner = new next_inner_payload { x = x, y = y + 1, max_inner = max_inner } };
      } else {
      return new Output { tag = "done-inner", done_inner = new done_inner_payload { x = x + 1, max_inner = max_inner } };
      }

      return default;

    }
  }
  public static class start_event {
    public struct Input {
    }
    public static object handler(Input __koru_input) {
      __koru_stdout_write("Starting nested loops...\n");

      return default;

    }
  }
  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() {
    {
      __koru_stdout_write("Starting nested loops...\n");
    }
    int outer_loopx = 1;
    int outer_loopmax_inner = 2;
    var result_0 = main_module.outer_event.handler(new outer_event.Input { x = (int)(outer_loopx), max_inner = (int)(outer_loopmax_inner)});
    __fold_outer_loop_check:
    while (result_0.tag == "next-outer") {
      var o = result_0.next_outer;
      int inner_loopx = o.x;
      int inner_loopy = 1;
      int inner_loopmax_inner = o.max_inner;
      var result_1 = main_module.inner_event.handler(new inner_event.Input { x = (int)(inner_loopx), y = (int)(inner_loopy), max_inner = (int)(inner_loopmax_inner)});
      __fold_inner_loop_check:
      while (result_1.tag == "next-inner") {
        var i = result_1.next_inner;
        inner_loopx = i.x;
        inner_loopy = i.y;
        inner_loopmax_inner = i.max_inner;
        result_1 = main_module.inner_event.handler(new inner_event.Input { x = (int)(inner_loopx), y = (int)(inner_loopy), max_inner = (int)(inner_loopmax_inner)});
        goto __fold_inner_loop_check;
      }
      var d = result_1.done_inner;
      outer_loopx = d.x;
      outer_loopmax_inner = d.max_inner;
      result_0 = main_module.outer_event.handler(new outer_event.Input { x = (int)(outer_loopx), max_inner = (int)(outer_loopmax_inner)});
      goto __fold_outer_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 ~start click a branch to expand · @labels scroll to their anchor
start

Test Configuration

MUST_RUN LANGUAGES: zig cs