WIP trying to repro bug

Author: dibyendumajumdar

optvm/src/test/java/com/compilerprogramming/ezlang/compiler/TestIncrementalSSA.java

@@ -719,5 +719,32 @@ func foo(len: Int,val: Int,x: Int,y: Int)->[Int]
 L1:
 """, result);
     }
+    @Test
+    public void testSSA19()
+    {
+        String src = """
+func bug(N: Int)
+{
+    // The main Sieve array
+    //var ary = new [Int]{len=N,value=0}
+    var p=2
+    // Find primes while p^2 < N
+    while( p*p < N ) {
+        // skip marked non-primes
+        //while( ary[p] ) {
+        while (p) {
+            p = p + 1
+        }
+        p = p + 1
+    }
 
+    // Now just collect the remaining primes, no more marking
+    while ( p < N ) {
+        p = p + 1
+    }
+}
+                """;
+        String result = compileSrc(src);
+        System.out.println(result);
+    }
 }

optvm/src/test/java/com/compilerprogramming/ezlang/compiler/TestSSATransform.java

@@ -3059,4 +3059,33 @@ func foo(len: Int, val: Int, x: Int, y: Int)->[Int] {
 L1:
 """, result);
     }
+
+    @Test
+    public void testSSA19()
+    {
+        String src = """
+func bug(N: Int)
+{
+    // The main Sieve array
+    //var ary = new [Int]{len=N,value=0}
+    var p=2
+    // Find primes while p^2 < N
+    while( p*p < N ) {
+        // skip marked non-primes
+        //while( ary[p] ) {
+        while (p) {
+            p = p + 1
+        }
+        p = p + 1
+    }
+
+    // Now just collect the remaining primes, no more marking
+    while ( p < N ) {
+        p = p + 1
+    }
+}
+                """;
+        String result = compileSrc(src);
+        System.out.println(result);
+    }
 }