097 if nested step under return switch

// 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 {
    pub const clock_event = struct {
        pub const Input = struct {
            passes: i64,
        };
        pub const Output = i64;
        pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
            return __koru_handler_impl(__koru_event_input.passes);
        }
        fn __koru_handler_impl(__koru_p_0: i64) @This().Output {
            const __koru_event_input: @This().Input = .{ .passes = __koru_p_0 };
            // >>> PROC: clock  [tests/regression/320_CONTROL_FLOW/320_097_if_nested_step_under_return_switch/input.kz:39]
            const passes = __koru_event_input.passes;
            _ = &passes;
            _ = &__koru_event_input;

                return passes;

        }
    };
    pub const tick_event = struct {
        pub const Input = struct {
            limit: i64,
            passes: i64,
        };
        pub const Output = union(enum(u8)) {
            live: struct {
                limit: i64,
                passes: i64,
            },
            expired: i64,
        };
        pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
            return __koru_handler_impl(__koru_event_input.limit, __koru_event_input.passes);
        }
        fn __koru_handler_impl(__koru_p_0: i64, __koru_p_1: i64) @This().Output {
            const __koru_event_input: @This().Input = .{ .limit = __koru_p_0, .passes = __koru_p_1 };
            // >>> SUBFLOW: tests/regression/320_CONTROL_FLOW/320_097_if_nested_step_under_return_switch/input.kz:50
            const limit = __koru_event_input.limit;
            const passes = __koru_event_input.passes;
            _ = &limit;
            _ = &passes;
            _ = &__koru_event_input;
            const result = main_module.clock_event.handler(.{ .passes = passes });
            const n = result;
            _ = &result;

    if (n < limit) {
        { return .{ .live = .{ .limit = limit,  .passes = n + 1 } };
 }
    } else {
        { return .{ .expired = n };
 }
    }
        }
    };
    pub const run_event = struct {
        pub const Input = struct {
            limit: i64,
        };
        pub const Output = i64;
        pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
            return __koru_handler_impl(__koru_event_input.limit);
        }
        fn __koru_handler_impl(__koru_p_0: i64) @This().Output {
            const __koru_event_input: @This().Input = .{ .limit = __koru_p_0 };
            // >>> SUBFLOW: tests/regression/320_CONTROL_FLOW/320_097_if_nested_step_under_return_switch/input.kz:54
            const limit = __koru_event_input.limit;
            _ = &limit;
            _ = &__koru_event_input;
            var L_limit: i64 = limit;
            var L_passes: i64 = 0;
            L: while (true) {
                const result_0 = main_module.tick_event.handler(.{ .limit = L_limit, .passes = L_passes });
                switch (result_0) {
                    // >>> BRANCH: tests/regression/320_CONTROL_FLOW/320_097_if_nested_step_under_return_switch/input.kz:55  | live l |>
                    .live => |l| {
                        L_limit = l.limit;
                        L_passes = l.passes;
                        continue :L;
                    },
                    // >>> BRANCH: tests/regression/320_CONTROL_FLOW/320_097_if_nested_step_under_return_switch/input.kz:56  | expired e |>
                    .expired => |e| {
                        return e;
                    },
                }
                break :L;
            }
            @panic("koru: a #label fold arm in 'run' exited the loop without a continue or a `->` produce — the handler owes a value it never made");
        }
    };
    // >>> FLOW: tests/regression/320_CONTROL_FLOW/320_097_if_nested_step_under_return_switch/input.kz:58  ~input:run()
    pub fn flow0() void {
        const n = main_module.run_event.handler(.{ .limit = 1000000 });
        (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("iterations: {d}\n", .{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;
    }
};

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());
}

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 clock_event {
    public struct Input {
      public long passes;
    }
    public static long handler(Input __koru_input) {
      var passes = __koru_input.passes;
      return passes;

      return default;

    }
  }
  public static class tick_event {
    public struct Input {
      public long limit;
      public long passes;
    }
    public struct Output {
      public string tag;
      public live_payload live;
      public long expired;
    }
    public struct live_payload {
      public long limit;
      public long passes;
    }
    public static Output handler(Input __koru_input) {
      var limit = __koru_input.limit;
      var passes = __koru_input.passes;
      var n = main_module.clock_event.handler(new clock_event.Input { passes = (long)(passes)});
if (n < limit) {
        {         return new Output { tag = "live", live = new live_payload { limit = limit, passes = n + 1 } };
 }
    } else {
        {         return new Output { tag = "expired", expired = n };
 }
    }

      return default;

    }
  }
  public static class run_event {
    public struct Input {
      public long limit;
    }
    public static long handler(Input __koru_input) {
      var limit = __koru_input.limit;
      long Llimit = limit;
      long Lpasses = 0;
      var result_0 = main_module.tick_event.handler(new tick_event.Input { limit = (long)(Llimit), passes = (long)(Lpasses)});
      __fold_L_check:
      while (result_0.tag == "live") {
        var l = result_0.live;
        Llimit = l.limit;
        Lpasses = l.passes;
        result_0 = main_module.tick_event.handler(new tick_event.Input { limit = (long)(Llimit), passes = (long)(Lpasses)});
        goto __fold_L_check;
      }
      var e = result_0.expired;
      return e;

      return default;

    }
  }
  public static class std_control_if_event {
    public struct Input {
      public string expr;
    }
    public struct Output {
      public string tag;
      public object then;
      public object @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 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() {
    var n = main_module.run_event.handler(new run_event.Input { limit = (long)(1000000)});
__koru_stdout_write("iterations: " + __koru_str(n) + "\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();
  }
}