Move Roc CLI testing examples to crates/

crates/cli_testing_examples/algorithms/.gitignore

@@ -0,0 +1,2 @@
+fibonacci
+quicksort

crates/cli_testing_examples/algorithms/README.md

@@ -0,0 +1,15 @@
+# Algorithm examples
+
+To run:
+
+```bash
+cargo run fibonacci.roc
+cargo run quicksort.roc
+```
+
+To run in release mode instead, do:
+
+```bash
+cargo run --release fibonacci.roc
+cargo run --release quicksort.roc
+```

crates/cli_testing_examples/algorithms/fibonacci-platform/host.zig

@@ -0,0 +1,109 @@
+const std = @import("std");
+const testing = std.testing;
+const expectEqual = testing.expectEqual;
+const expect = testing.expect;
+const maxInt = std.math.maxInt;
+
+comptime {
+    // This is a workaround for https://github.com/ziglang/zig/issues/8218
+    // which is only necessary on macOS.
+    //
+    // Once that issue is fixed, we can undo the changes in
+    // 177cf12e0555147faa4d436e52fc15175c2c4ff0 and go back to passing
+    // -fcompiler-rt in link.rs instead of doing this. Note that this
+    // workaround is present in many host.zig files, so make sure to undo
+    // it everywhere!
+    const builtin = @import("builtin");
+    if (builtin.os.tag == .macos) {
+        _ = @import("compiler_rt");
+    }
+}
+
+const mem = std.mem;
+const Allocator = mem.Allocator;
+
+// NOTE the LLVM backend expects this signature
+// extern fn roc__mainForHost_1_exposed(i64, *i64) void;
+extern fn roc__mainForHost_1_exposed(i64) i64;
+
+const Align = 2 * @alignOf(usize);
+extern fn malloc(size: usize) callconv(.C) ?*align(Align) anyopaque;
+extern fn realloc(c_ptr: [*]align(Align) u8, size: usize) callconv(.C) ?*anyopaque;
+extern fn free(c_ptr: [*]align(Align) u8) callconv(.C) void;
+extern fn memcpy(dst: [*]u8, src: [*]u8, size: usize) callconv(.C) void;
+extern fn memset(dst: [*]u8, value: i32, size: usize) callconv(.C) void;
+
+const DEBUG: bool = false;
+
+export fn roc_alloc(size: usize, alignment: u32) callconv(.C) ?*anyopaque {
+    if (DEBUG) {
+        var ptr = malloc(size);
+        const stdout = std.io.getStdOut().writer();
+        stdout.print("alloc:   {d} (alignment {d}, size {d})\n", .{ ptr, alignment, size }) catch unreachable;
+        return ptr;
+    } else {
+        return malloc(size);
+    }
+}
+
+export fn roc_realloc(c_ptr: *anyopaque, new_size: usize, old_size: usize, alignment: u32) callconv(.C) ?*anyopaque {
+    if (DEBUG) {
+        const stdout = std.io.getStdOut().writer();
+        stdout.print("realloc: {d} (alignment {d}, old_size {d})\n", .{ c_ptr, alignment, old_size }) catch unreachable;
+    }
+
+    return realloc(@alignCast(Align, @ptrCast([*]u8, c_ptr)), new_size);
+}
+
+export fn roc_dealloc(c_ptr: *anyopaque, alignment: u32) callconv(.C) void {
+    if (DEBUG) {
+        const stdout = std.io.getStdOut().writer();
+        stdout.print("dealloc: {d} (alignment {d})\n", .{ c_ptr, alignment }) catch unreachable;
+    }
+
+    free(@alignCast(Align, @ptrCast([*]u8, c_ptr)));
+}
+
+export fn roc_panic(c_ptr: *anyopaque, tag_id: u32) callconv(.C) void {
+    _ = tag_id;
+
+    const stderr = std.io.getStdErr().writer();
+    const msg = @ptrCast([*:0]const u8, c_ptr);
+    stderr.print("Application crashed with message\n\n    {s}\n\nShutting down\n", .{msg}) catch unreachable;
+    std.process.exit(0);
+}
+
+export fn roc_memcpy(dst: [*]u8, src: [*]u8, size: usize) callconv(.C) void {
+    return memcpy(dst, src, size);
+}
+
+export fn roc_memset(dst: [*]u8, value: i32, size: usize) callconv(.C) void {
+    return memset(dst, value, size);
+}
+
+pub export fn main() u8 {
+    const stdout = std.io.getStdOut().writer();
+    const stderr = std.io.getStdErr().writer();
+
+    // start time
+    var ts1: std.os.timespec = undefined;
+    std.os.clock_gettime(std.os.CLOCK.REALTIME, &ts1) catch unreachable;
+
+    const result = roc__mainForHost_1_exposed(10);
+
+    // end time
+    var ts2: std.os.timespec = undefined;
+    std.os.clock_gettime(std.os.CLOCK.REALTIME, &ts2) catch unreachable;
+
+    stdout.print("{d}\n", .{result}) catch unreachable;
+
+    const delta = to_seconds(ts2) - to_seconds(ts1);
+
+    stderr.print("runtime: {d:.3}ms\n", .{delta * 1000}) catch unreachable;
+
+    return 0;
+}
+
+fn to_seconds(tms: std.os.timespec) f64 {
+    return @intToFloat(f64, tms.tv_sec) + (@intToFloat(f64, tms.tv_nsec) / 1_000_000_000.0);
+}

crates/cli_testing_examples/algorithms/fibonacci-platform/main.roc

@@ -0,0 +1,9 @@
+platform "fibonacci"
+    requires {} { main : I64 -> I64 }
+    exposes []
+    packages {}
+    imports []
+    provides [mainForHost]
+
+mainForHost : I64 -> I64
+mainForHost = \a -> main a

crates/cli_testing_examples/algorithms/fibonacci.roc

@@ -0,0 +1,13 @@
+app "fibonacci"
+    packages { pf: "fibonacci-platform/main.roc" }
+    imports []
+    provides [main] to pf
+
+main = \n -> fib n 0 1
+
+# the clever implementation requires join points
+fib = \n, a, b ->
+    if n == 0 then
+        a
+    else
+        fib (n - 1) b (a + b)

crates/cli_testing_examples/algorithms/quicksort-platform/host.zig

@@ -0,0 +1,140 @@
+const std = @import("std");
+const builtin = @import("builtin");
+const str = @import("str");
+const RocStr = str.RocStr;
+const testing = std.testing;
+const expectEqual = testing.expectEqual;
+const expect = testing.expect;
+
+comptime {
+    // This is a workaround for https://github.com/ziglang/zig/issues/8218
+    // which is only necessary on macOS.
+    //
+    // Once that issue is fixed, we can undo the changes in
+    // 177cf12e0555147faa4d436e52fc15175c2c4ff0 and go back to passing
+    // -fcompiler-rt in link.rs instead of doing this. Note that this
+    // workaround is present in many host.zig files, so make sure to undo
+    // it everywhere!
+    if (builtin.os.tag == .macos) {
+        _ = @import("compiler_rt");
+    }
+}
+
+const mem = std.mem;
+const Allocator = mem.Allocator;
+
+extern fn roc__mainForHost_1_exposed(input: RocList) callconv(.C) RocList;
+
+const Align = 2 * @alignOf(usize);
+extern fn malloc(size: usize) callconv(.C) ?*align(Align) anyopaque;
+extern fn realloc(c_ptr: [*]align(Align) u8, size: usize) callconv(.C) ?*anyopaque;
+extern fn free(c_ptr: [*]align(Align) u8) callconv(.C) void;
+extern fn memcpy(dst: [*]u8, src: [*]u8, size: usize) callconv(.C) void;
+extern fn memset(dst: [*]u8, value: i32, size: usize) callconv(.C) void;
+
+const DEBUG: bool = false;
+
+export fn roc_alloc(size: usize, alignment: u32) callconv(.C) ?*anyopaque {
+    if (DEBUG) {
+        var ptr = malloc(size);
+        const stdout = std.io.getStdOut().writer();
+        stdout.print("alloc:   {d} (alignment {d}, size {d})\n", .{ ptr, alignment, size }) catch unreachable;
+        return ptr;
+    } else {
+        return malloc(size);
+    }
+}
+
+export fn roc_realloc(c_ptr: *anyopaque, new_size: usize, old_size: usize, alignment: u32) callconv(.C) ?*anyopaque {
+    if (DEBUG) {
+        const stdout = std.io.getStdOut().writer();
+        stdout.print("realloc: {d} (alignment {d}, old_size {d})\n", .{ c_ptr, alignment, old_size }) catch unreachable;
+    }
+
+    return realloc(@alignCast(Align, @ptrCast([*]u8, c_ptr)), new_size);
+}
+
+export fn roc_dealloc(c_ptr: *anyopaque, alignment: u32) callconv(.C) void {
+    if (DEBUG) {
+        const stdout = std.io.getStdOut().writer();
+        stdout.print("dealloc: {d} (alignment {d})\n", .{ c_ptr, alignment }) catch unreachable;
+    }
+
+    free(@alignCast(Align, @ptrCast([*]u8, c_ptr)));
+}
+
+export fn roc_panic(c_ptr: *anyopaque, tag_id: u32) callconv(.C) void {
+    _ = tag_id;
+
+    const stderr = std.io.getStdErr().writer();
+    const msg = @ptrCast([*:0]const u8, c_ptr);
+    stderr.print("Application crashed with message\n\n    {s}\n\nShutting down\n", .{msg}) catch unreachable;
+    std.process.exit(0);
+}
+
+export fn roc_memcpy(dst: [*]u8, src: [*]u8, size: usize) callconv(.C) void {
+    return memcpy(dst, src, size);
+}
+
+export fn roc_memset(dst: [*]u8, value: i32, size: usize) callconv(.C) void {
+    return memset(dst, value, size);
+}
+
+// warning! the array is currently stack-allocated so don't make this too big
+const NUM_NUMS = 100;
+
+const RocList = extern struct { elements: [*]i64, length: usize, capacity: usize };
+
+const Unit = extern struct {};
+
+pub export fn main() u8 {
+    const stdout = std.io.getStdOut().writer();
+
+    var raw_numbers: [NUM_NUMS + 1]i64 = undefined;
+
+    // set refcount to one
+    raw_numbers[0] = -9223372036854775808;
+
+    var numbers = raw_numbers[1..];
+
+    for (numbers) |_, i| {
+        numbers[i] = @mod(@intCast(i64, i), 12);
+    }
+
+    var roc_list = RocList{ .elements = numbers, .length = NUM_NUMS, .capacity = NUM_NUMS };
+
+    // start time
+    var ts1: std.os.timespec = undefined;
+    std.os.clock_gettime(std.os.CLOCK.REALTIME, &ts1) catch unreachable;
+
+    // actually call roc to populate the callresult
+    const callresult: RocList = roc__mainForHost_1_exposed(roc_list);
+
+    // stdout the result
+    const length = std.math.min(20, callresult.length);
+    var result = callresult.elements[0..length];
+
+    // end time
+    var ts2: std.os.timespec = undefined;
+    std.os.clock_gettime(std.os.CLOCK.REALTIME, &ts2) catch unreachable;
+
+    for (result) |x, i| {
+        if (i == 0) {
+            stdout.print("[{}, ", .{x}) catch unreachable;
+        } else if (i == length - 1) {
+            stdout.print("{}]\n", .{x}) catch unreachable;
+        } else {
+            stdout.print("{}, ", .{x}) catch unreachable;
+        }
+    }
+
+    // TODO apparently the typestamps are still (partially) undefined?
+    // const delta = to_seconds(ts2) - to_seconds(ts1);
+    // stderr.print("runtime: {d:.3}ms\n", .{delta * 1000}) catch unreachable;
+
+    return 0;
+}
+
+fn to_seconds(tms: std.os.timespec) f64 {
+    return @intToFloat(f64, tms.tv_sec) + (@intToFloat(f64, tms.tv_nsec) / 1_000_000_000.0);
+}

crates/cli_testing_examples/algorithms/quicksort-platform/main.roc

@@ -0,0 +1,9 @@
+platform "quicksort"
+    requires {} { quicksort : List I64 -> List I64 }
+    exposes []
+    packages {}
+    imports []
+    provides [mainForHost]
+
+mainForHost : List I64 -> List I64
+mainForHost = \list -> quicksort list

crates/cli_testing_examples/algorithms/quicksort.roc

@@ -0,0 +1,59 @@
+app "quicksort"
+    packages { pf: "quicksort-platform/main.roc" }
+    imports []
+    provides [quicksort] to pf
+
+quicksort = \originalList ->
+    n = List.len originalList
+
+    quicksortHelp originalList 0 (n - 1)
+
+quicksortHelp : List (Num a), Nat, Nat -> List (Num a)
+quicksortHelp = \list, low, high ->
+    if low < high then
+        when partition low high list is
+            Pair partitionIndex partitioned ->
+                partitioned
+                |> quicksortHelp low (partitionIndex - 1)
+                |> quicksortHelp (partitionIndex + 1) high
+    else
+        list
+
+partition : Nat, Nat, List (Num a) -> [Pair Nat (List (Num a))]
+partition = \low, high, initialList ->
+    when List.get initialList high is
+        Ok pivot ->
+            when partitionHelp low low initialList high pivot is
+                Pair newI newList ->
+                    Pair newI (swap newI high newList)
+
+        Err _ ->
+            Pair low initialList
+
+partitionHelp : Nat, Nat, List (Num c), Nat, Num c -> [Pair Nat (List (Num c))]
+partitionHelp = \i, j, list, high, pivot ->
+    if j < high then
+        when List.get list j is
+            Ok value ->
+                if value <= pivot then
+                    partitionHelp (i + 1) (j + 1) (swap i j list) high pivot
+                else
+                    partitionHelp i (j + 1) list high pivot
+
+            Err _ ->
+                Pair i list
+    else
+        Pair i list
+
+swap : Nat, Nat, List a -> List a
+swap = \i, j, list ->
+    when Pair (List.get list i) (List.get list j) is
+        Pair (Ok atI) (Ok atJ) ->
+            list
+            |> List.set i atJ
+            |> List.set j atI
+
+        _ ->
+            # to prevent a decrement on list
+            # turns out this is very important for optimizations
+            list