Fix CmpIX86/Jmp swap args bug

Some x86 cmp need to swap args, then Set/Jmp both need to swap `bop`.
Fix missing padding in ASM printer.
MergeSort test like brainfuck - runs on arm.

6 files changed, 101 insertions, 76 deletions

diff --git a/chapter21/src/test/java/com/seaofnodes/simple/MergeSortTest.java b/chapter21/src/test/java/com/seaofnodes/simple/MergeSortTest.java
index fb250fc8..5624ee1b 100644
--- a/chapter21/src/test/java/com/seaofnodes/simple/MergeSortTest.java
+++ b/chapter21/src/test/java/com/seaofnodes/simple/MergeSortTest.java
@@ -1,67 +1,44 @@
 package com.seaofnodes.simple;
 
 import com.seaofnodes.simple.codegen.CodeGen;
+import com.seaofnodes.simple.node.cpus.riscv.riscv;
+import java.io.IOException;
+import java.nio.file.Files;
+import java.nio.file.Path;
 import org.junit.Test;
 import static org.junit.Assert.assertEquals;
 import static org.junit.Assert.fail;
 
 public class MergeSortTest {
 
-    @Test
-    public void testMergeSort() {
-        String src =
-"""
-// based on the top-down version from https://en.wikipedia.org/wiki/Merge_sort
-
-val merge_sort = { int[] a, int[] b, int n ->
-    copy_array(a, 0, n, b);
-    split_merge(a, 0, n, b);
-};
-
-val split_merge = { int[] b, int begin, int end, int[] a ->
-    if (end - begin <= 1)
-        return 0;
-    int middle = (end + begin) / 2;
-    split_merge(a, begin, middle, b);
-    split_merge(a, middle, end, b);
-    merge(b, begin, middle, end, a);
-    return 0;
-};
-
-val merge = { int[] b, int begin, int middle, int end, int[] a ->
-    int i = begin, j = middle;
-
-    for (int k = begin; k < end; k++) {
-        // && and ||
-        bool cond = false;
-        if (i < middle) {
-            if (j >= end)          cond = true;
-            else if (a[i] <= a[j]) cond = true;
-        }
-        if (cond) b[k] = a[i++];
-        else      b[k] = a[j++];
+    @Test public void testMergeSort0() throws IOException {
+        int[] primes = new int[] { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, };
+        SB sb = new SB().p(primes.length).p("[");
+        for( int prime : primes )
+            sb.p(prime).p(", ");
+        String sprimes = sb.p("]").toString();
+        TestC.run("sort", sprimes, 40);
+
+
+        EvalRisc5 R5 = TestRisc5.build("sort", 0, 36);
+        // Allocate an array of primes, filled in reverse order
+        int ps = R5._heap;
+        R5._heap += (primes.length+1)*8; // 25 primes, and length
+        R5.st4(ps,primes.length);
+        for( int i=0; i<primes.length; i++ )
+            R5.st8(ps+(primes.length-1-i+1)*8,primes[i]);
+        // Pass array base when calling `merge_sort`
+        R5.regs[riscv.A0] = ps;          // Array base to be sorted
+
+        int trap = R5.step(100000);
+        assertEquals(0,trap);
+
+        assertEquals(primes.length,R5.ld4s(ps));
+        for( int i=0; i<primes.length; i++ )
+            assertEquals(primes[i], R5.ld8(ps+(i+1)*8));
+
+        // TODO: replace with ARM Eval
+        String src = Files.readString(Path.of("src/test/java/com/seaofnodes/simple/progs/sort.smp"));
+        Chapter21Test.testCPU(src,"arm", "SystemV",36,null);
     }
-};
-
-val copy_array = { int[] a, int begin, int end, int[] b ->
-    for (int k = begin; k < end; k++)
-        b[k] = a[k];
-};
-
-int[] !a = new int[arg];
-int[] !b = new int[a#];
-
-for (int i = 0; i < a#; i++)
-    a[i] = a# - i;
-
-merge_sort(a, b, a#);
-
-return a;
-""";
-        Chapter21Test.testCPU(src,"x86_64_v2", "SystemV",54,"Stop[ return mov(mov([int])); return 0; ]");
-        Chapter21Test.testCPU(src,"riscv"    , "SystemV",44,"Stop[ return mov(mov([int])); return 0; ]");
-        Chapter21Test.testCPU(src,"arm"      , "SystemV",44,"Stop[ return mov(mov([int])); return 0; ]");
-//assertEquals("int[ 1,2,3,4,5,6,7,8,9,10,11]", Eval2.eval(code, 11));
-    }
-
 }
diff --git a/chapter21/src/test/java/com/seaofnodes/simple/TestC.java b/chapter21/src/test/java/com/seaofnodes/simple/TestC.java
index 81742cab..5609758b 100644
--- a/chapter21/src/test/java/com/seaofnodes/simple/TestC.java
+++ b/chapter21/src/test/java/com/seaofnodes/simple/TestC.java
@@ -77,7 +77,7 @@ public abstract class TestC {
             System.err.println(result);
         }
         assertEquals( 0, error );
-        assertEquals(expected,result.replace("\r",""));
+        assertEquals(expected,result);
 
         // Allocation quality not degraded
         int delta = spills>>3;
diff --git a/chapter21/src/test/java/com/seaofnodes/simple/progs/HellowWorld.smp b/chapter21/src/test/java/com/seaofnodes/simple/progs/HellowWorld.smp
deleted file mode 100644
index 172dffa0..00000000
--- a/chapter21/src/test/java/com/seaofnodes/simple/progs/HellowWorld.smp
+++ /dev/null
@@ -1,18 +0,0 @@
-
-{ i32 byte[] i64 -> i64 } write = extern;
-byte[] buf = new byte[100];
-buf[ 0] = 'H';
-buf[ 1] = 'e';
-buf[ 2] = 'l';
-buf[ 3] = 'l';
-buf[ 4] = 'o';
-buf[ 5] = ',';
-buf[ 6] = 'W';
-buf[ 7] = 'o';
-buf[ 8] = 'r';
-buf[ 9] = 'l';
-buf[10] = 'd';
-buf[11] = '!';
-buf[12] = '\n';
-
-return write(0,buf,12);
diff --git a/chapter21/src/test/java/com/seaofnodes/simple/progs/brain_fuck.c b/chapter21/src/test/java/com/seaofnodes/simple/progs/brain_fuck.c
index 15de1864..127cbe73 100644
--- a/chapter21/src/test/java/com/seaofnodes/simple/progs/brain_fuck.c
+++ b/chapter21/src/test/java/com/seaofnodes/simple/progs/brain_fuck.c
@@ -15,4 +15,4 @@ int main() {
   printf("%.*s", ps->len, ps->data);
 
   return 0;
-}
\ No newline at end of file
+}
diff --git a/chapter21/src/test/java/com/seaofnodes/simple/progs/sort.c b/chapter21/src/test/java/com/seaofnodes/simple/progs/sort.c
new file mode 100644
index 00000000..ad76cc7f
--- /dev/null
+++ b/chapter21/src/test/java/com/seaofnodes/simple/progs/sort.c
@@ -0,0 +1,28 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+// Test wrapper to call `sort.smp`
+
+typedef struct AryInt {
+    unsigned int len;
+    long long data[];
+} AryInt;
+
+__attribute__ ((CALL_CONV))
+extern AryInt* merge_sort(AryInt*);
+
+
+long long primes[] = { 25, 97, 89, 83, 79, 73, 71, 67, 61, 59, 53, 47, 43, 41, 37, 31, 29, 23, 19, 17, 13, 11, 7, 5, 3, 2 };
+
+int main() {
+  AryInt *as = (AryInt*)primes;
+
+  merge_sort(as);
+
+  printf("%d[",as->len);
+  for( int i=0; i<as->len; i++ )
+    printf("%d, ",as->data[i]);
+  printf("]");
+
+  return 0;
+}
\ No newline at end of file
diff --git a/chapter21/src/test/java/com/seaofnodes/simple/progs/sort.smp b/chapter21/src/test/java/com/seaofnodes/simple/progs/sort.smp
new file mode 100644
index 00000000..ae3f4f23
--- /dev/null
+++ b/chapter21/src/test/java/com/seaofnodes/simple/progs/sort.smp
@@ -0,0 +1,38 @@
+// -*- mode: java;  -*-
+// based on the top-down version from https://en.wikipedia.org/wiki/Merge_sort
+
+val merge_sort = { int[] a ->
+    int[] !b = new int[a#];
+    copy_array (a, 0, a#, b);
+    split_merge(a, 0, a#, b);
+};
+
+val split_merge = { int[] b, int begin, int end, int[] a ->
+    if (end - begin <= 1)
+        return 0;
+    int middle = (end + begin) / 2;
+    split_merge(a, begin, middle, b);
+    split_merge(a, middle, end, b);
+    merge(b, begin, middle, end, a);
+    return 0;
+};
+
+val merge = { int[] b, int begin, int middle, int end, int[] a ->
+    int i = begin, j = middle;
+
+    for (int k = begin; k < end; k++) {
+        // && and ||
+        bool cond = false;
+        if (i < middle) {
+            if (j >= end)          cond = true;
+            else if (a[i] <= a[j]) cond = true;
+        }
+        if (cond) b[k] = a[i++];
+        else      b[k] = a[j++];
+    }
+};
+
+val copy_array = { int[] a, int begin, int end, int[] b ->
+    for (int k = begin; k < end; k++)
+        b[k] = a[k];
+};