✓
Passing This code compiles and runs correctly.
Code
// TEST: `$mod.` in a |js proc body lowers to the bare file-scope name — the
// JS twin of 400_155's Zig-side contract. Two emission paths are covered:
// `spin` (payload effect — decl-site handler) and `pulse` (void effect —
// inline splice into the caller). If `$mod.` passed through verbatim, node
// would refuse the file on `$` — an illegal identifier.
~import std/io
~import app/lib/gadget
~app/lib/gadget:spin(count: 3)
! tick n |> std/io:print.ln("tick {{ n:d }}")
| done total |> std/io:print.ln("total {{ total:d }}")
~app/lib/gadget:pulse(count: 2)
! beat |> std/io:print.ln("beat")
| done n2 |> std/io:print.ln("pulses {{ n2:d }}")
Supporting Files
// JavaScript facet of gadget for 400_158 — the |js half of the $mod. pin.
// These host lines emit at file scope, so `$mod.BASE_JS` below must lower to
// the bare `BASE_JS` — the same sanctioned spelling the |zig twin writes.
const BASE_JS = 10;
function twice_js(v) {
return v * 2;
}
~proc spin|js {
let acc = 0;
for (let i = 0; i < count; i++) {
const n = $mod.twice_js(i) + $mod.BASE_JS;
acc += n;
tick(n);
}
return { tag: "done", done: acc };
}
~proc pulse|js {
for (let i = 0; i < count; i++) {
$mod.twice_js(i);
beat();
}
return { tag: "done", done: count };
}
// Module fixture for 400_158: the JS-target twin of 400_155. An effect-branch
// proc body may splice into the CALLER (KORU112), so module-scope names must
// be spelled `$mod.` — on the Zig lane that rewrites to the emitted module
// namespace; on the JS lane the `.kjs` facet's host lines are file-scope, so
// the sanctioned spelling lowers to the bare name. One spelling, three
// lowerings — this file is the |zig half.
const std = @import("std");
pub const BASE: i32 = 10;
pub fn twice(v: i32) i32 {
return v * 2;
}
// Payload effect — the handler path.
~pub tor spin { count: i32 }
! tick i32
| done i32
~proc spin|zig {
var acc: i32 = 0;
var i: i32 = 0;
while (i < count) : (i += 1) {
const n = $mod.twice(i) + $mod.BASE;
acc += n;
tick(n);
}
return .{ .done = acc };
}
// Void effect — the inline-splice path.
~pub tor pulse { count: i32 }
! beat
| done i32
~proc pulse|zig {
var i: i32 = 0;
while (i < count) : (i += 1) {
_ = $mod.twice(i);
beat();
}
return .{ .done = count };
}
Actual
tick 10
tick 12
tick 14
total 36
beat
beat
pulses 2
Expected output
✓ Zig✓ JavaScripttick 10
tick 12
tick 14
total 36
beat
beat
pulses 2
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 {
// >>> FLOW: tests/regression/400_RUNTIME_FEATURES/400_158_effect_inliner_mod_scope_js/input.kz:11 ~app.lib.gadget:spin()
pub fn flow0() void {
const result_0: koru_app.koru_lib.koru_gadget.spin_event.Output = __koru_proc_0: {
const count = (3); _ = &count;
var acc: i32 = 0;
var i: i32 = 0;
while (i < count) : (i += 1) {
const n = koru_app.koru_lib.koru_gadget.twice(i) + koru_app.koru_lib.koru_gadget.BASE;
acc += n;
{ (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("tick {d}\n", .{n});
}
}
break :__koru_proc_0 .{ .done = acc };
};
const total = result_0.done;
(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("total {d}\n", .{total});
}
// >>> FLOW: tests/regression/400_RUNTIME_FEATURES/400_158_effect_inliner_mod_scope_js/input.kz:15 ~app.lib.gadget:pulse()
pub fn flow1() void {
const result_0: koru_app.koru_lib.koru_gadget.pulse_event.Output = __koru_proc_0: {
const count = (2); _ = &count;
var i: i32 = 0;
while (i < count) : (i += 1) {
_ = koru_app.koru_lib.koru_gadget.twice(i);
{ (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("beat\n", .{});
}
}
break :__koru_proc_0 .{ .done = count };
};
const n2 = result_0.done;
(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("pulses {d}\n", .{n2});
}
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_app = struct {
pub const koru_lib = struct {
pub const koru_gadget = struct {
const std = @import("std");
pub const BASE: i32 = 10;
pub fn twice(v: i32) i32 {
return v * 2;
}
pub const spin_event = struct {
pub const Input = struct {
count: i32,
};
pub const Output = union(enum(u8)) {
done: i32,
};
pub fn handler(__koru_event_input: @This().Input, comptime __H: type) @This().Output {
const tick = __H.tick;
_ = &tick;
// >>> PROC: spin [/Users/larsde/src/koru/tests/regression/400_RUNTIME_FEATURES/400_158_effect_inliner_mod_scope_js/lib/gadget.kz:20]
const count = __koru_event_input.count;
_ = &count;
_ = &__koru_event_input;
var acc: i32 = 0;
var i: i32 = 0;
while (i < count) : (i += 1) {
const n = twice(i) + BASE;
acc += n;
tick(n);
}
return .{ .done = acc };
}
};
pub const pulse_event = struct {
pub const Input = struct {
count: i32,
};
pub const Output = union(enum(u8)) {
done: i32,
};
pub fn handler(__koru_event_input: @This().Input, comptime __H: type) @This().Output {
const beat = __H.beat;
_ = &beat;
// >>> PROC: pulse [/Users/larsde/src/koru/tests/regression/400_RUNTIME_FEATURES/400_158_effect_inliner_mod_scope_js/lib/gadget.kz:36]
const count = __koru_event_input.count;
_ = &count;
_ = &__koru_event_input;
var i: i32 = 0;
while (i < count) : (i += 1) {
_ = twice(i);
beat();
}
return .{ .done = count };
}
};
};
};
};
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.flow1();
main_module.koru_end_flow();
if (comptime @import("builtin").mode == .Debug) koru_leak_check();
}
test {
@import("std").testing.refAllDeclsRecursive(@This());
}
Flows
flow ~spin click a branch to expand · @labels scroll to their anchor
spin (count: 3)
flow ~pulse click a branch to expand · @labels scroll to their anchor
pulse (count: 2)
Test Configuration
MUST_RUN LANGUAGES: zig js