✓
Passing This code compiles and runs correctly.
Code
// Test: ARGS passthrough — the harness feeds argv from the ARGS file.
// ARGS = "hello\nworld" → argv = [program, hello, world].
import std/args
import std/io
std/args:count(): n |> std/io:print.ln("count: {{ n:d }}")
std/args:get(index: 1)
| arg a |> std/io:print.ln("argv1: {{ a:s }}")
| out-of-bounds |> std/io:print.ln("argv1: <none>")
std/args:rest(): r |> std/io:print.ln("rest: {{ r.len:d }}")
Actual
count: 3
argv1: hello
rest: 2
Expected output
✓ Zig✓ C#count: 3
argv1: hello
rest: 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/200_COMPILER_FEATURES/240_STD_LIBRARY/240_021_args_passthrough/input.k:7 ~std.args:count()
pub fn flow0() void {
const n = koru_std.koru_args.count_event.handler(.{ });
(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("count: {d}\n", .{n});
}
// >>> FLOW: tests/regression/200_COMPILER_FEATURES/240_STD_LIBRARY/240_021_args_passthrough/input.k:9 ~std.args:get()
pub fn flow1() void {
const result_0 = koru_std.koru_args.get_event.handler(.{ .index = 1 });
switch (result_0) {
// >>> BRANCH: tests/regression/200_COMPILER_FEATURES/240_STD_LIBRARY/240_021_args_passthrough/input.k:10 | arg a |>
.arg => |a| {
(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("argv1: {s}\n", .{a});
},
// >>> BRANCH: tests/regression/200_COMPILER_FEATURES/240_STD_LIBRARY/240_021_args_passthrough/input.k:11 | out-of-bounds |>
.out_of_bounds => {
(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("argv1: <none>\n", .{});
},
}
}
// >>> FLOW: tests/regression/200_COMPILER_FEATURES/240_STD_LIBRARY/240_021_args_passthrough/input.k:13 ~std.args:rest()
pub fn flow2() void {
const r = koru_std.koru_args.rest_event.handler(.{ });
(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("rest: {d}\n", .{r.len});
}
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_std = struct {
pub const koru_args = struct {
const std = @import("std");
var _argv_buf: [64][:0]u8 = undefined;
var _argv_len: usize = 0;
var _argv_init: bool = false;
fn _get_argv() [][:0]u8 {
if (!_argv_init) {
if (std.os.argv.len > _argv_buf.len) @panic("std/args: more than 64 argv entries - raise the cap");
for (std.os.argv, 0..) |p, i| _argv_buf[i] = std.mem.span(p);
_argv_len = std.os.argv.len;
_argv_init = true;
}
return _argv_buf[0.._argv_len];
}
pub const count_event = struct {
pub const Input = struct {
};
pub const Output = usize;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> PROC: count [/Users/larsde/src/koru/koru_std/args.kz:34]
_ = &__koru_event_input;
return _get_argv().len;
}
};
pub const get_event = struct {
pub const Input = struct {
index: usize,
};
pub const Output = union(enum(u8)) {
arg: [:0]u8,
out_of_bounds: struct {
},
};
pub inline fn handler(__koru_event_input: @This().Input) @This().Output {
return __koru_handler_impl(__koru_event_input.index);
}
fn __koru_handler_impl(__koru_p_0: usize) @This().Output {
const __koru_event_input: @This().Input = .{ .index = __koru_p_0 };
// >>> PROC: get [/Users/larsde/src/koru/koru_std/args.kz:38]
const index = __koru_event_input.index;
_ = &index;
_ = &__koru_event_input;
const argv = _get_argv();
if (index >= argv.len) {
return .{ .out_of_bounds = .{} };
}
return .{ .arg = argv[index] };
}
};
pub const rest_event = struct {
pub const Input = struct {
};
pub const Output = [][:0]u8;
pub fn handler(__koru_event_input: @This().Input) @This().Output {
// >>> PROC: rest [/Users/larsde/src/koru/koru_std/args.kz:46]
_ = &__koru_event_input;
const argv = _get_argv();
if (argv.len <= 1) {
return &.{};
}
return argv[1..];
}
};
};
};
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.flow2();
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 std_args_count_event {
public struct Input {
}
public static long handler(Input __koru_input) {
return (long)global::System.Environment.GetCommandLineArgs().Length;
return default;
}
}
public static class std_args_get_event {
public struct Input {
public long index;
}
public struct Output {
public string tag;
public dynamic arg;
public dynamic out_of_bounds;
}
public static Output handler(Input __koru_input) {
var index = __koru_input.index;
var __koru_argv = global::System.Environment.GetCommandLineArgs();
if (index >= __koru_argv.Length) {
return new Output { tag = "out-of-bounds", out_of_bounds = new { } };
}
return new Output { tag = "arg", arg = __koru_argv[(int)index] };
return default;
}
}
public static class std_args_rest_event {
public struct Input {
}
public static dynamic handler(Input __koru_input) {
var __koru_argv = global::System.Environment.GetCommandLineArgs();
if (__koru_argv.Length <= 1) {
return new string[] { };
}
return global::System.Linq.Enumerable.ToArray(global::System.Linq.Enumerable.Skip(__koru_argv, 1));
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() {
var n = main_module.std_args_count_event.handler(new std_args_count_event.Input { });
__koru_stdout_write("count: " + __koru_str(n) + "\n");
}
public static void flow1() {
var result_0 = main_module.std_args_get_event.handler(new std_args_get_event.Input { index = (long)(1)});
if (result_0.tag == "arg") {
var a = result_0.arg;
__koru_stdout_write("argv1: " + __koru_str(a) + "\n");
}
if (result_0.tag == "out-of-bounds") {
__koru_stdout_write("argv1: <none>" + "\n");
}
}
public static void flow2() {
var r = main_module.std_args_rest_event.handler(new std_args_rest_event.Input { });
__koru_stdout_write("rest: " + __koru_str(r.Length) + "\n");
}
public static void flow3() {
main_module.koru_start_event.handler(new koru_start_event.Input { });
}
public static void flow4() {
main_module.koru_end_event.handler(new koru_end_event.Input { });
}
}
static class Program {
static void Main() {
main_module.flow3();
main_module.flow0();
main_module.flow1();
main_module.flow2();
main_module.flow4();
}
}
Flows
flow ~count click a branch to expand · @labels scroll to their anchor
count
flow ~get click a branch to expand · @labels scroll to their anchor
get (index: 1)
flow ~rest click a branch to expand · @labels scroll to their anchor
rest
Test Configuration
MUST_RUN LANGUAGES: zig cs
argv (one per line):
hello world