Cleanup & backportclinit

The phase rework, made new phases explicit and add them to the CodeGen driver.  Fix the flag-spilling on X86 and ARM.  Fix the GCM conservative anti-deps and backport.

28 files changed, 445 insertions, 321 deletions

diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Chapter05Test.java b/chapter20/src/test/java/com/seaofnodes/simple/Chapter05Test.java
index 70cc6121..44493d87 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Chapter05Test.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Chapter05Test.java
@@ -20,7 +20,7 @@ else {
 }
 return a;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,(arg+2),(arg-3));", code.print());
     }
 
@@ -36,7 +36,7 @@ if (arg == 1) {
 }
 return c;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,4,3);", code.print());
     }
 
@@ -64,7 +64,7 @@ if( arg==1 )
 else
     b=a+1;
 return a+b;""");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return ((arg<<1)+Phi(Region,2,3));", code.print());
     }
 
@@ -79,7 +79,7 @@ if( arg==1 )
 else
     a=b+1;
 return a+b;""");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return ((Phi(Region,(arg<<1),arg)+arg)+Phi(Region,4,5));", code.print());
     }
 
@@ -99,7 +99,7 @@ else
     a=5;
 return a;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,Phi(Region,2,3),Phi(Region,4,5));", code.print());
     }
 
@@ -115,7 +115,7 @@ if( arg==0 )
     b=2;
 return arg+a+b;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return ((arg+Phi(Region,1,0))+Phi(Region,2,0));", code.print());
     }
 
@@ -130,7 +130,7 @@ if( arg==1 )
 }
 return a;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return (arg==Phi(Region,3,2));", code.print());
     }
 
@@ -145,7 +145,7 @@ else
     a=3;
 return a;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 3;", code.print());
     }
 
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Chapter06Test.java b/chapter20/src/test/java/com/seaofnodes/simple/Chapter06Test.java
index 24d12921..11caf1f5 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Chapter06Test.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Chapter06Test.java
@@ -15,7 +15,7 @@ public class Chapter06Test {
 if( true ) return 2;
 return 1;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 2;", code.print());
         assertTrue(code.ctrl() instanceof FunNode);
     }
@@ -29,7 +29,7 @@ if (arg)
     a = 2;
 return (arg < a) < 3; // Because (arg < a) is a bool/uint1/[0-1], its always less than 3
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 1;", code.print());
     }
 
@@ -44,7 +44,7 @@ else
   a=3;
 return a;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 2;", code.print());
         assertTrue(code.ctrl() instanceof FunNode);
     }
@@ -65,7 +65,7 @@ else
     b=5;
 return b;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,42,5);", code.print());
     }
 
@@ -84,7 +84,7 @@ if( arg==2 )
 else
     b=5;
 return b;""");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,2,5);", code.print());
     }
 
@@ -104,7 +104,7 @@ else if( arg==3 )
 else
     a=5;
 return a;
-""", TypeInteger.constant(2), 123L).parse().opto();
+""", TypeInteger.constant(2), 123L).parse().iter();
         assertEquals("return 5;", code.print());
     }
 
@@ -124,7 +124,7 @@ else if( arg==3 )
 else
     a=5;
 return a;
-""", TypeInteger.constant(1), 123L).parse().opto();
+""", TypeInteger.constant(1), 123L).parse().iter();
         assertEquals("return 3;", code.print());
     }
 
@@ -144,7 +144,7 @@ else
     a=5;
 return a;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,3,Phi(Region,4,5));", code.print());
     }
 
@@ -165,7 +165,7 @@ else
     a=5;
 return a;
 """, TypeInteger.constant(1), 123L);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 3;", code.print());
     }
 
@@ -186,7 +186,7 @@ else
     a=5;
 return a;
 """, TypeInteger.constant(3), 123L);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 4;", code.print());
     }
 
@@ -202,7 +202,7 @@ if( arg ) {
 }
 return a+b;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,4,1);", code.print());
     }
 
@@ -221,7 +221,7 @@ if( arg ) {
 }
 return a+b;
 """, TypeInteger.constant(1), 123L);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 4;", code.print());
     }
 
@@ -239,7 +239,7 @@ if( arg ) {
 }
 return a+b;
 """, TypeInteger.constant(0), 123L);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 1;", code.print());
     }
 
@@ -257,7 +257,7 @@ if( arg ) {
 }
 return a+b+c;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return (Phi(Region,Phi(Region,2,3),0)+Phi(Region,3,1));", code.print());
     }
 
@@ -278,7 +278,7 @@ if( arg ) {
 }
 return a+b+c;
 """, TypeInteger.constant(1), 123L);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 6;", code.print());
     }
 
@@ -298,7 +298,7 @@ if( arg ) {
 }
 return a+b+c;
 """, TypeInteger.constant(2), 123L);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 5;", code.print());
     }
 
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Chapter07Test.java b/chapter20/src/test/java/com/seaofnodes/simple/Chapter07Test.java
index 88554323..b0526eb1 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Chapter07Test.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Chapter07Test.java
@@ -34,7 +34,7 @@ if(arg){}else{
 }
 return a;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,1,Phi(Loop,1,(Phi_a+1)));", code.print());
     }
 
@@ -54,7 +54,7 @@ while(i < arg) {
 }
 return sum;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,0,Phi(Loop,Phi_sum,(Phi_sum+Phi(Loop,0,(Phi_j+1)))));", code.print());
     }
 
@@ -89,7 +89,7 @@ while(a < 10) {
 }
 return b;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,2,(Phi(Region,Phi_b,4)+1));", code.print());
         assertTrue(code.ctrl() instanceof CProjNode);
     }
@@ -122,7 +122,7 @@ while(a < 10) {
 }
 return a;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,1,(Phi_a+3));", code.print());
         assertTrue(code.ctrl() instanceof CProjNode);
     }
@@ -148,7 +148,7 @@ int a = 1;
 while(arg) a = 2;
 return a;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,1,2);", code.print());
         assertTrue(code.ctrl() instanceof CProjNode);
     }
@@ -180,7 +180,7 @@ while(a < 10) {
 }
 return a;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,1,(Phi_a+3));", code.print());
         assertTrue(code.ctrl() instanceof CProjNode);
     }
@@ -214,7 +214,7 @@ while(a < 10) {
 }
 return a;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,1,(Phi_a+3));", code.print());
         assertTrue(code.ctrl() instanceof CProjNode);
     }
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Chapter08Test.java b/chapter20/src/test/java/com/seaofnodes/simple/Chapter08Test.java
index 7e90d484..af378682 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Chapter08Test.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Chapter08Test.java
@@ -22,7 +22,7 @@ while(arg < 10) {
 }
 return arg;
                 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,Phi(Region,Phi(Loop,arg,(Phi_arg+1)),Add),Add);", code.print());
         assertTrue(code.ctrl() instanceof RegionNode);
         Assert.assertEquals( "5", Eval2.eval(code, 1));
@@ -45,7 +45,7 @@ while(arg < 10) {
 }
 return a;
                 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,1,Phi(Region,Phi_a,(Phi_a+1)));", code.print());
         assertTrue(code.ctrl() instanceof CProjNode);
     }
@@ -64,7 +64,7 @@ while(arg < 10) {
 }
 return arg;
                 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,Phi(Loop,arg,(Phi_arg+1)),Add);", code.print());
         assertTrue(code.ctrl() instanceof RegionNode);
     }
@@ -80,7 +80,7 @@ while(arg < 10) {
 }
 return arg;
                 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,Phi(Loop,arg,(Phi_arg+1)),Add);", code.print());
         assertTrue(code.ctrl() instanceof RegionNode);
     }
@@ -99,7 +99,7 @@ while(arg < 10) {
 }
 return arg;
                 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,arg,(Phi_arg+1));", code.print());
         assertTrue(code.ctrl() instanceof CProjNode);
     }
@@ -116,7 +116,7 @@ while(arg < 10) {
 }
 return arg;
                 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,arg,(Phi_arg+1));", code.print());
         assertTrue(code.ctrl() instanceof CProjNode);
     }
@@ -132,14 +132,14 @@ while( arg < 10 ) {
 }
 return arg;
                 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return arg;", code.print());
     }
 
     @Test
     public void testRegress2() {
         CodeGen code = new CodeGen("if(1) return 0;  else while(arg>- -arg) arg=arg+1; return 0;");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 
@@ -167,7 +167,7 @@ while(arg < 10) {
 }
 return arg;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return arg;", code.print());
     }
 
@@ -184,7 +184,7 @@ while(arg < 10) {
 }
 return a;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,Phi(Loop,1,(Phi_a+1)),Add);", code.print());
         assertTrue(code.ctrl() instanceof RegionNode);
     }
@@ -200,7 +200,7 @@ while(1) {
 }
 return a;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return (Phi(Loop,1,Add)+1);", code.print());
         assertTrue(code.ctrl() instanceof CProjNode prj && prj._idx==1 );
     }
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Chapter09Test.java b/chapter20/src/test/java/com/seaofnodes/simple/Chapter09Test.java
index 401f346f..0a3049e6 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Chapter09Test.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Chapter09Test.java
@@ -24,7 +24,7 @@ while(v0) {
 }
 return 0;
                 """);
-        code.parse().opto();
+        code.parse().iter();
     }
 
     @Test
@@ -40,7 +40,7 @@ else {
 }
 return x;
                 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,(arg<<1),(Shl+1));", code.print());
         Assert.assertEquals( "2", Eval2.eval(code,  1));
         Assert.assertEquals("23", Eval2.eval(code, 11));
@@ -49,7 +49,7 @@ return x;
     @Test
     public void testGVN2() {
         CodeGen code = new CodeGen("return arg*arg-arg*arg;");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
         Assert.assertEquals("0", Eval2.eval(code,  1, 1));
     }
@@ -63,7 +63,7 @@ while (arg < 10) {
 }
 return arg;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,arg,(Phi_arg+2));", code.print());
         Assert.assertEquals("11", Eval2.eval(code,  1));
     }
@@ -80,7 +80,7 @@ while (arg < 10) {
 }
 return arg;
                 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,arg,(Phi_arg+4));", code.print());
         Assert.assertEquals("13", Eval2.eval(code,  1));
     }
@@ -109,7 +109,7 @@ while (arg) {
 }
 return arg;
                 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 
@@ -127,14 +127,14 @@ while(v1+arg) {
     v1=v2;
 }
                 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 
     @Test
     public void testWhile0() {
         CodeGen code = new CodeGen("while(0) continue; if(0) arg=0;");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 
@@ -146,7 +146,7 @@ if(0) while(0) {
     while(0) {}
 }
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 
@@ -154,14 +154,14 @@ if(0) while(0) {
     @Test
     public void testPrecedence() {
         CodeGen code = new CodeGen("return 3-1+2;");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 4;", code.print());
     }
 
     @Test
     public void testSwap2() {
         CodeGen code = new CodeGen("return 1+(1+1);");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 3;", code.print());
     }
 
@@ -179,7 +179,7 @@ while(arg) {
 }
 return a;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,0,(-(Phi_a+3)));", code.print());
     }
 
@@ -193,7 +193,7 @@ arg=0;
 int v0=0!=0<-0;
 return -0+0+0;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Top;", code.print());
     }
 
@@ -201,14 +201,14 @@ return -0+0+0;
     @Test
     public void testFuzz2() {
         CodeGen code = new CodeGen("return 0+-0;");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 
     @Test
     public void testFuzz3() {
         CodeGen code = new CodeGen("int v0=0; while(0==69) while(v0) return 0;");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 
@@ -220,7 +220,7 @@ while(1) {
     if(1<0) while(arg==-0) arg=arg-arg;
 }
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Top;", code.print());
     }
 
@@ -242,7 +242,7 @@ while(1) {
 }
 return 0!=0;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Top;", code.print());
     }
 
@@ -254,7 +254,7 @@ int v0=0;
 while(0==1) while(v0)
         v0=1+v0;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 
@@ -270,14 +270,14 @@ while(1)
         v1=1;
 return v1+v0;
                                    """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Top;", code.print());
     }
 
     @Test
     public void testFuzz8() {
         CodeGen code = new CodeGen("while(arg) arg = arg - 1;  return arg;");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Chapter10Test.java b/chapter20/src/test/java/com/seaofnodes/simple/Chapter10Test.java
index 91505f41..8af1c71d 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Chapter10Test.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Chapter10Test.java
@@ -14,7 +14,7 @@ public class Chapter10Test {
             "if(1) return new S; else return 0;"
         } ) {
             String src = "struct S { int x; }; " + body;
-            var code = new CodeGen(src).parse().opto().typeCheck();
+            var code = new CodeGen(src).parse().iter().typeCheck();
             org.junit.Assert.assertTrue(body,
                 code.expr()._type instanceof com.seaofnodes.simple.type.TypeMemPtr);
         }
@@ -39,7 +39,7 @@ public class Chapter10Test {
             "if (!!!p) return -1; return p.x;",
             "int b = !!p; if (b) return p.x + b - 1; return -1;"
         } ) {
-            CodeGen code = new CodeGen(NULLABLE_POINT_SOURCE+body).parse().opto().typeCheck();
+            CodeGen code = new CodeGen(NULLABLE_POINT_SOURCE+body).parse().iter().typeCheck();
             assertEquals(body,"-1",Eval2.eval(code,0));
             assertEquals(body,"42",Eval2.eval(code,1));
         }
@@ -54,7 +54,7 @@ public class Chapter10Test {
             "if (!!p) { int x = p.x; } return p.x;"
         } ) {
             try {
-                new CodeGen(NULLABLE_POINT_SOURCE+body).parse().opto().typeCheck();
+                new CodeGen(NULLABLE_POINT_SOURCE+body).parse().iter().typeCheck();
                 fail(body);
             } catch( RuntimeException e ) {
                 // Known null is rejected during parsing in these chapters.
@@ -86,7 +86,7 @@ if( (arg/13)==0 ) {
 int r = g+h;
 return p-r;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 
@@ -106,7 +106,7 @@ bar.a = 1;
 bar.a = 2;
 return bar.a;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 2;", code.print());
     }
 
@@ -122,7 +122,7 @@ else
     v.y = 3;
 return v;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Vector2D;", code.print());
     }
 
@@ -160,7 +160,7 @@ while (arg) {
 }
 return bar.a;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,0,(Phi_a+2));", code.print());
     }
 
@@ -173,7 +173,7 @@ if (arg) bar = null;
 bar.a = 1;
 return bar.a;
 """);
-        try { code.parse().opto(); fail(); }
+        try { code.parse().iter(); fail(); }
         catch( Exception e ) { assertEquals("Type null is not of declared type *Bar",e.getMessage()); }
     }
 
@@ -186,7 +186,7 @@ if (arg) bar = new Bar;
 bar.a = 1;
 return bar.a;
 """);
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) { assertEquals("Might be null accessing 'a'",e.getMessage()); }
     }
 
@@ -212,7 +212,7 @@ if (arg) bar = null;
 if( bar ) bar.a = 1;
 return bar;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,null,Bar);", code.print());
     }
 
@@ -228,7 +228,7 @@ if( !bar ) rez=4;
 else bar.a = 1;
 return rez;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,4,3);", code.print());
     }
 
@@ -245,7 +245,7 @@ while(arg) {
 }
 return ret;
 """);
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) {
             assertEquals("Might be null accessing 'v0'", e.getMessage()); }
     }
@@ -282,7 +282,7 @@ while( i.x < i.len ) {
 }
 return sum;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,0,(Phi(Loop,0,(Phi_x+1))+Phi_sum));", code.print());
     }
 
@@ -301,7 +301,7 @@ while(arg) {
 }
 return ret;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,s0,Phi(Region,s0,Phi_ret));", code.print());
     }
 
@@ -319,7 +319,7 @@ while(arg) {
 }
 return ret;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,s0,Phi(Region,s0,Phi_ret));", code.print());
     }
 
@@ -336,7 +336,7 @@ while(arg < 10) {
 }
 return ret;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,s0,Phi(Region,s0,Phi_ret));", code.print());
     }
 
@@ -363,7 +363,7 @@ if(0) {
     }
 }
    """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 
@@ -377,7 +377,7 @@ if(0) return 0;
 else return new s0;
 if(new s0.f0) return 0;
     """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return s0;", code.print());
     }
 
@@ -393,7 +393,7 @@ while(0<arg) {
 }
 return 0;
     """);
-        code.parse().opto();
+        code.parse().iter();
     }
 
     @Test
@@ -405,7 +405,7 @@ while(v0.f0) {}
 s0 v1 = v0;
 return v1;
     """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return (const)s0;", code.print());
     }
 
@@ -437,7 +437,7 @@ while(0) {}
         }    }
 }
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 
@@ -448,7 +448,7 @@ int v0=arg==0;
 while(v0) continue;
 return 0;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 
@@ -462,7 +462,7 @@ return 0;
             a.y = 55; b.y = 66;
             a.x = 33; b.x = 44;
             return before*100 + p.x;
-            """).parse().opto();
+            """).parse().iter();
         StopNode stop = code._stop;
         assertEquals("1133",Eval2.eval(code,0));
         assertEquals("2244",Eval2.eval(code,1));
@@ -488,7 +488,7 @@ return 0;
             """;
 
     @Test public void testMemoryAcrossNestedLoops() {
-        var code = new CodeGen(NESTED_MEMORY).parse().opto();
+        var code = new CodeGen(NESTED_MEMORY).parse().iter();
         StopNode stop = code._stop;
         for (int arg=0; arg<7; arg++) {
             assertEquals("S{x="+(5L+arg)+",y="+(7L+arg*(arg+1)-(arg>=2 ? 2 : 0))+
@@ -504,7 +504,7 @@ return 0;
             if (arg) { s.x = 11; s.z = 13; return s; }
             s.y = 17;
             return s;
-            """).parse().opto();
+            """).parse().iter();
         StopNode stop = code._stop;
         for (int arg=0; arg<2; arg++) {
             assertEquals(arg==0 ? "S{x=3,y=17,z=7}" : "S{x=11,y=5,z=13}",Eval2.eval(code,arg));
@@ -521,7 +521,7 @@ return 0;
             int v;
             if (arg>1) v=p.x; else v=q.x;
             return v;
-            """).parse().opto();
+            """).parse().iter();
         StopNode stop = code._stop;
         // The one-step safety check stops at the memory aggregate.
         assertEquals(2,countMemoryNodes(stop,LoadNode.class,new BitSet()));
@@ -536,7 +536,7 @@ return 0;
             !S !s = new S;
             if (arg) s.x=arg+1; else s.x=arg+2;
             return s;
-            """).parse().opto();
+            """).parse().iter();
         StopNode stop = code._stop;
         assertEquals(1,countMemoryNodes(stop,StoreNode.class,new BitSet()));
         assertEquals("S{x=2}",Eval2.eval(code,0));
@@ -554,7 +554,7 @@ return 0;
             if (arg>1) { v=p.x; p.x=41; p.y=5; }
             else       { v=q.x; q.x=42; }
             return v;
-            """).parse().opto();
+            """).parse().iter();
         StopNode stop = code._stop;
         assertEquals(2,countMemoryNodes(stop,LoadNode.class,new BitSet()));
         assertEquals("-1",Eval2.eval(code,-1));
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Chapter11Test.java b/chapter20/src/test/java/com/seaofnodes/simple/Chapter11Test.java
index 439333ca..a74f8540 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Chapter11Test.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Chapter11Test.java
@@ -13,7 +13,7 @@ public class Chapter11Test {
             s.x = 42;
             while (arg > 0) { s.y = s.y + arg; arg = arg - 1; }
             return s.x;
-            """).parse().opto();
+            """).parse().iter();
         var stop = code._stop;
         assertEquals("return 42;",stop.toString());
         assertEquals("42",Eval2.eval(code,5));
@@ -32,7 +32,7 @@ public class Chapter11Test {
                 arg = arg - 1;
             }
             return a;
-            """).parse().opto();
+            """).parse().iter();
         var stop = code._stop;
         int[] phis = {0};
         stop.walk(n -> {
@@ -54,7 +54,7 @@ public class Chapter11Test {
         // it. Keep both the worklist assertion and the final heap check.
         for (int seed : new int[]{0,97,123,456}) {
             var code = new CodeGen(Chapter10Test.NESTED_MEMORY,com.seaofnodes.simple.type.TypeInteger.BOT,seed).parse();
-            code.opto();
+            code.iter();
             assertEquals("S{x=9,y=25,z=17}",Eval2.eval(code,4));
         }
     }
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Chapter12Test.java b/chapter20/src/test/java/com/seaofnodes/simple/Chapter12Test.java
index 4abc9117..7f340776 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Chapter12Test.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Chapter12Test.java
@@ -14,7 +14,7 @@ public class Chapter12Test {
 """
 return 3.14;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 3.14;", code.print());
         assertEquals("3.14", Eval2.eval(code,  0));
     }
@@ -34,7 +34,7 @@ while( arg ) {
 }
 return head.next.i;
 """);
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) { assertEquals("Might be null accessing 'i'",e.getMessage()); }
     }
 
@@ -56,7 +56,7 @@ LLI? next = head.next;
 if( next==null ) return 1;
 return next.i;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,0,1,.i);", code.print());
         assertEquals("2", Eval2.eval(code,  3));
     }
@@ -75,7 +75,7 @@ i0.f = f0;
 f0.i = i0;
 return f0.i.f.i.i;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 17;", code.print());
     }
 
@@ -87,7 +87,7 @@ struct N { !N? !next; int i; };
 N n = new N;
 return n.next;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return null;", code.print());
     }
 
@@ -100,7 +100,7 @@ struct N { !M !next; int i; };
 N n = new N { next = new M; };
 return n.next;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return (const)M;", code.print());
     }
 
@@ -113,7 +113,7 @@ struct N { !M !next; int i; };
 N n = new N { next = null; }
 return n.next;
 """);
-        try { code.parse().opto(); fail(); }
+        try { code.parse().iter(); fail(); }
         catch( Exception e ) { assertEquals("Type null is not of declared type *M",e.getMessage()); }
     }
 
@@ -126,20 +126,20 @@ struct N { !N? !next; int i; };
 n.i = 3.14;
 return n.i;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("3",Eval2.eval(code,0));
     }
 
     @Test
     public void testNullRef4() {
         CodeGen code = new CodeGen("-null-5/null-5;");
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) { assertEquals("Cannot 'Add' null",e.getMessage()); }
     }
 
     @Test public void testNullRef5() {
         CodeGen code = new CodeGen("return null+42;");
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) { assertEquals("Cannot 'Add' null",e.getMessage()); }
     }
 
@@ -149,7 +149,7 @@ return n.i;
 """
 struct S{};
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
         assertEquals("0", Eval2.eval(code,  0));
     }
@@ -161,7 +161,7 @@ struct S{};
 struct S1 { !S2? !s; };
 return new S2;
 """);
-        try { code.parse().opto(); fail(); }
+        try { code.parse().iter(); fail(); }
         catch( Exception e ) { assertEquals("Unknown struct type 'S2'",e.getMessage()); }
     }
 
@@ -173,7 +173,7 @@ struct S1 { !S2? !s; };
 struct S2 { int x; };
 return new S1.s=new S2;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return S2;", code.print());
     }
 
@@ -190,7 +190,7 @@ p2.pi.i = 2;
 if (arg) p1 = new P;
 return p1.pi.i + 1;
 """);
-        try { code.parse().opto().typeCheck();  fail(); }
+        try { code.parse().iter().typeCheck();  fail(); }
         catch( Exception e ) {  assertEquals("Might be null accessing 'i'",e.getMessage());  }
     }
 
@@ -255,7 +255,7 @@ z.a=k;  z.b=s; z.c=e;
 return a.b.c.a.b.c.a.b.c.a.b.c.a.b.c.a.b.c;
 
 """);
-        code.parse().opto().typeCheck().GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched);
         assertEquals("return R;", code._stop.toString());
         assertEquals("R{a=C{a=N{a=Y{a=J{a=U{a=F{a=Q{a=B{a=M{a=X{a=I{a=T{a=E{a=P{a=A{a=L{a=W{a=H{a=S{a=D{a=O{a=Z{a=K{a=V{a=G{a=$cyclic,b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic},b=$cyclic,c=$cyclic}", Eval2.eval(code,  0));
     }
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Chapter13Test.java b/chapter20/src/test/java/com/seaofnodes/simple/Chapter13Test.java
index 975946da..3dbc9b41 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Chapter13Test.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Chapter13Test.java
@@ -290,7 +290,7 @@ else {
         }
 }
 """);
-        code.parse().opto().typeCheck().GCM();
+        code.driver(CodeGen.Phase.Schedule);
         assertEquals("return Phi(Region,9,Top,Top,Top,Top);", code.print());
     }
 
@@ -322,7 +322,7 @@ while( prime <= arg ) {
 }
 return primeCount;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,0,Phi(Loop,1,Phi(Region,Phi_primeCount,Phi(Region,(Phi_primeCount+1),Phi_primeCount))));", code.print());
         assertEquals("0", Eval2.eval(code,  1)); // No primes 1 or below
         assertEquals("1", Eval2.eval(code,  2)); // 2
@@ -344,7 +344,7 @@ i=v.f;
 if (arg) v.f=1;
 return i;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 2;", code.print());
         assertEquals("2", Eval2.eval(code, 0));
         assertEquals("2", Eval2.eval(code, 1));
@@ -367,7 +367,7 @@ if (arg) {
 }
 return i;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,.f,0);", code.print());
     }
 
@@ -386,7 +386,7 @@ if (v1) {
 }
 return v0;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return S;", code.print());
     }
 
@@ -404,7 +404,7 @@ if (arg+1) arg= 0;
 while (arg) v.f = 2;
 return i;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return arg;", code.print());
     }
 
@@ -421,7 +421,7 @@ while(1) {
 }
 return v;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return S;", code.print());
     }
 
@@ -436,7 +436,7 @@ while( -arg )
 while(1)
   arg = arg+ptr.v;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Top;", code.print());
     }
 
@@ -454,7 +454,7 @@ while (arg) {
 }
 return i;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 
@@ -474,7 +474,7 @@ while(arg) {
 }
 return arg;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 
@@ -492,7 +492,7 @@ if (arg) {
 }
 return v;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return S;", code.print());
     }
 
@@ -511,7 +511,7 @@ while (arg > 0) {
 }
 return v;
                 """);
-        code.parse().opto();
+        code.parse().iter();
         //assertEquals("return new S;", code.print());
     }
 
@@ -528,7 +528,7 @@ while(0>=0) {
 }
 return 0;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Top;", code.print());
     }
 
@@ -546,7 +546,7 @@ u32 v0=0;
     return v1;
 }
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Chapter14FloatTest.java b/chapter20/src/test/java/com/seaofnodes/simple/Chapter14FloatTest.java
index 6377bc14..cf7d3481 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Chapter14FloatTest.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Chapter14FloatTest.java
@@ -20,7 +20,7 @@ public class Chapter14FloatTest {
             {"f32 rounded=arg+16777216.0; return rounded;", "1.6777232E7", "1.6777199E7"}
         };
         for( String[] test : tests ) {
-            var code = new CodeGen(test[0]).parse().opto().typeCheck();
+            var code = new CodeGen(test[0]).parse().iter().typeCheck();
             assertEquals(test[0],test[1],Eval2.eval(code,17));
             assertEquals(test[0],test[2],Eval2.eval(code,-17));
         }
@@ -28,7 +28,7 @@ public class Chapter14FloatTest {
 
 
     @Test public void testSubZeroFloat() {
-        var code = new CodeGen("flt x = arg; return 0-x;").parse().opto().typeCheck();
+        var code = new CodeGen("flt x = arg; return 0-x;").parse().iter().typeCheck();
         // Compare strings so +0.0 and -0.0 remain distinct.
         assertEquals("0.0", Eval2.eval(code,0));
         assertEquals("-1.0", Eval2.eval(code,1));
@@ -42,7 +42,7 @@ public class Chapter14FloatTest {
             {"return 2.5; return 7;", "2.5"}
         } ) {
             String src = test[0];
-            var code = new CodeGen(src).parse().opto().typeCheck();
+            var code = new CodeGen(src).parse().iter().typeCheck();
             assertEquals(src,test[1],Eval2.eval(code,0));
         }
     }
@@ -55,7 +55,7 @@ public class Chapter14FloatTest {
 """
 return 3.14;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 3.14;", code.print());
         assertEquals("3.14", Eval2.eval(code,  0));
     }
@@ -66,7 +66,7 @@ return 3.14;
 """
 return 3.14;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 3.14;", code.print());
         assertEquals("3.14", Eval2.eval(code,  0));
     }
@@ -83,7 +83,7 @@ while( 1 ) {
 }
 return guess;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,(flt)arg,(((ToFloat/Phi_guess)+Phi_guess)*0.5f));", code.print());
         assertEquals("3.0", Eval2.eval(code,  9));
         assertEquals("1.414213562373095", Eval2.eval(code,  2));
@@ -96,7 +96,7 @@ return guess;
 flt x = arg;
 return x+1==x;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return ((flt)arg==(ToFloat+1.0f));", code.print());
         assertEquals("0", Eval2.eval(code, 1));
     }
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Chapter14Test.java b/chapter20/src/test/java/com/seaofnodes/simple/Chapter14Test.java
index f0fe7dcd..ebc94d21 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Chapter14Test.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Chapter14Test.java
@@ -16,7 +16,7 @@ public class Chapter14Test {
 """
 return 3.14;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 3.14;", code.print());
         assertEquals("3.14", Eval2.eval(code,  0));
     }
@@ -32,7 +32,7 @@ if( b < 0 ) c = -1;
 if( b > 2 ) c =  1;
 return c;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 99;", code.print());
         assertEquals("99", Eval2.eval(code,  0));
     }
@@ -45,7 +45,7 @@ u8 b = 123;
 b = b + 456;// Truncate
 return b;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 67;", code.print());
         assertEquals("67", Eval2.eval(code,  0));
     }
@@ -59,7 +59,7 @@ u8 b = 123;
 while( b ) b = b + 456;// Truncate
 return b;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 
@@ -72,7 +72,7 @@ b = b + 456;// Truncate
 u1 c = b;   // No more truncate needed
 return c;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 1;", code.print());
         assertEquals("1", Eval2.eval(code,  0));
     }
@@ -85,7 +85,7 @@ int b = 123;
 b = b+456 & 31;                 // Precedence
 return b;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 3;", code.print());
         assertEquals("3", Eval2.eval(code,  0));
     }
@@ -99,7 +99,7 @@ struct Foo { u1 b; };
 f.b = 123;
 return f.b;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 1;", code.print());
         assertEquals("1", Eval2.eval(code,  0));
     }
@@ -111,7 +111,7 @@ return f.b;
 i8 b = 255;                     // Chopped
 return b;                       // Sign extend
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return -1;", code.print());
         assertEquals("-1", Eval2.eval(code,  0));
     }
@@ -124,7 +124,7 @@ i8 b = arg;
 b = b + 1;// Truncate
 return b;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return (((((arg<<56)>>56)+1)<<56)>>56);", code.print());
         assertEquals("1", Eval2.eval(code, 0));
         assertEquals("-128", Eval2.eval(code, 127));
@@ -138,7 +138,7 @@ u16 mask = (1<<16)-1;           // AND mask
 int c = 123456789 & mask;
 return c;                       //
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 52501;", code.print());
         assertEquals("52501", Eval2.eval(code,  0));
     }
@@ -149,7 +149,7 @@ return c;                       //
 """
 return (arg | 123 ^ 456) >>> 1;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return (((arg|123)^456)>>>1);", code.print());
         assertEquals("217", Eval2.eval(code,  0));
     }
@@ -162,7 +162,7 @@ flt f = arg;
 arg = f & 1;
 return arg;
 """);
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) { assertEquals("Cannot '&' flt",e.getMessage()); }
     }
 
@@ -175,7 +175,7 @@ while(arg) v1=-v0;
 while(v1) break;
 return v1;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return (Phi(Loop,((1<<arg)&1),0)&Phi(Loop,Shl,4294967295));", code.print());
         assertEquals("1", Eval2.eval(code,  0));
     }
@@ -194,7 +194,7 @@ if(0&0>>>0) {
 }
 return v0;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
         assertEquals("0", Eval2.eval(code,  0));
     }
@@ -220,7 +220,7 @@ f32 ff32 = 3.141592653589793;  if( ff32 != 3.1415927410125732) return 5;
 
 return 0;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
         assertEquals("0", Eval2.eval(code,  0));
     }
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Chapter15Test.java b/chapter20/src/test/java/com/seaofnodes/simple/Chapter15Test.java
index 6a22ff97..7da8fe0f 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Chapter15Test.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Chapter15Test.java
@@ -14,7 +14,7 @@ public class Chapter15Test {
 """
 return 3.14;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 3.14;", code.print());
         assertEquals("3.14", Eval2.eval(code,  0));
     }
@@ -28,7 +28,7 @@ struct C { !C? !l; };
 c.l = c;
 return c;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return C;", code.print());
         assertEquals("C{l=$cyclic}", Eval2.eval(code,  0));
     }
@@ -47,7 +47,7 @@ while (i < old#) {
 output[i] = 1;
 return output;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return [u8];", code.print());
         assertEquals("\u0001", Eval2.eval(code,  0));
     }
@@ -59,7 +59,7 @@ return output;
 int[] is = new int[2];
 return is[1];
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
         assertEquals("0", Eval2.eval(code,  0));
     }
@@ -72,7 +72,7 @@ int[] is = new int[2];
 int[] is2 = new int[2];
 return is[1];
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
         assertEquals("0", Eval2.eval(code,  0));
     }
@@ -86,7 +86,7 @@ a[0] = 1;
 a[1] = 2;
 return a[0];
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 1;", code.print());
         assertEquals("1", Eval2.eval(code,  0));
     }
@@ -99,7 +99,7 @@ struct A { int i; };
 !A?[] !a = new !A?[2];
 return a;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return [*A?];", code.print());
         assertEquals("*A {int !i; }?[ null,null]", Eval2.eval(code, 0));
     }
@@ -128,7 +128,7 @@ else {
 }
 return rez;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,1.2,Phi(Region,2.3,.y));", code.print());
         assertEquals("3.14", Eval2.eval(code, 0));
         assertEquals("1.2", Eval2.eval(code, 1));
@@ -153,7 +153,7 @@ if( iss[arg] )
     if( iss[arg][2] )
         rez = iss[arg][2].y;
 return rez;""");
-        code.parse().opto().typeCheck();
+        code.parse().iter().typeCheck();
         assertEquals("return Phi(Region,Phi(Region,.y,1.2),1.2);", code.print());
         assertEquals("3.14", Eval2.eval(code,  0));
         try { Eval2.eval(code, 10); fail(); } // Fails AIOOBE in Eval2, no range checks
@@ -171,7 +171,7 @@ root._kids = new !Tree?[2]; // NO BANG SO ARRAY IS OF IMMUTABLE TREES????
 root._kids[0] = new Tree;
 return root;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Tree;", code.print());
         assertEquals("Tree{_kids=*Tree?[ Tree{_kids=null},null]}", Eval2.eval(code,  0));
     }
@@ -183,7 +183,7 @@ return root;
 struct S { int a; int[] !b; };
 return 0;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 
@@ -206,7 +206,7 @@ while( i < ary# - 1 ) {
 }
 return ary[1] * 1000 + ary[3]; // 1 * 1000 + 6
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return (.[]+(.[]*1000));", code.print());
         assertEquals("1006", Eval2.eval(code,  4));
     }
@@ -247,7 +247,7 @@ while( j < nprimes ) {
 }
 return rez;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return [int];", code.print());
         assertEquals("int[ 2,3,5,7,11,13,17,19]",Eval2.eval(code, 20));
     }
@@ -264,7 +264,7 @@ s2.f = 2.0;
 if (arg) s1 = new S;
 return s1.i + s1.f;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return ((flt).i+.f);", code.print());
         assertEquals("0.0", Eval2.eval(code,  0));
     }
@@ -276,7 +276,7 @@ return s1.i + s1.f;
 """
 return new flt;
 """);
-        try { code.parse().opto(); fail(); }
+        try { code.parse().iter(); fail(); }
         catch( Exception e ) { assertEquals("Cannot allocate a flt",e.getMessage()); }
     }
 
@@ -286,7 +286,7 @@ return new flt;
 """
 int is = new int[2];
 """);
-        try { code.parse().opto(); fail(); }
+        try { code.parse().iter(); fail(); }
         catch( Exception e ) { assertEquals("Type *[int] is not of declared type int",e.getMessage()); }
     }
 
@@ -297,7 +297,7 @@ int is = new int[2];
 int[] is = new int[3.14];
 return is[1];
 """);
-        try { code.parse().opto(); fail(); }
+        try { code.parse().iter(); fail(); }
         catch( Exception e ) { assertEquals("Cannot allocate an array with length 3.14",e.getMessage()); }
     }
 
@@ -307,7 +307,7 @@ return is[1];
 int[] is = new int[arg];
 return is[1];
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
         assertEquals("0", Eval2.eval(code,  4));
         try { Eval2.eval(code,-1); fail(); }
@@ -340,7 +340,7 @@ while(v5+(0&0)) {
 }
 return v1;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
         assertEquals("0", Eval2.eval(code,  0));
     }
@@ -355,7 +355,7 @@ u32 v7=0;
 int v8=0;
 while(0<--1>>>---(v7*0==v8)) {}
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 
@@ -379,7 +379,7 @@ else {
         }
 }
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
     }
 }
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Chapter16Test.java b/chapter20/src/test/java/com/seaofnodes/simple/Chapter16Test.java
index 362388d6..78e468cd 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Chapter16Test.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Chapter16Test.java
@@ -17,7 +17,7 @@ public class Chapter16Test {
 """
 return 3.14;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 3.14;", code.print());
         assertEquals("3.14", Eval2.eval(code,  0));
     }
@@ -30,7 +30,7 @@ return 3.14;
 int x, y;
 return x+y;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
         assertEquals("0", Eval2.eval(code,  0));
     }
@@ -41,7 +41,7 @@ return x+y;
 int x=2, y=x+1;
 return x+y;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 5;", code.print());
         assertEquals("5", Eval2.eval(code,  0));
     }
@@ -54,7 +54,7 @@ struct X { int x=3; };
 X z = new X;
 return z.x;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 3;", code.print());
         assertEquals("3", Eval2.eval(code,  0));
     }
@@ -66,7 +66,7 @@ struct X { int x=3; };
 X z = new X { x = 4; };
 return z.x;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 4;", code.print());
         assertEquals("4", Eval2.eval(code,  0));
     }
@@ -87,7 +87,7 @@ LLI? next = head.next;
 if( !next ) return 1;
 return next.i;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,0,1,.i);", code.print());
         assertEquals("0", Eval2.eval(code,  0));
         assertEquals("1", Eval2.eval(code,  1));
@@ -118,7 +118,7 @@ LLI? next = head.next;
 if( !next ) return 1;
 return next.i;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,0,1,.i);", code.print());
         assertEquals("0", Eval2.eval(code,  0));
         assertEquals("1", Eval2.eval(code,  1));
@@ -143,7 +143,7 @@ struct Square {
 };
 return new Square;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Square;", code.print());
         assertEquals("Square{side=3.0,diag=1.7320508075688772}", Eval2.eval(code,  3));
         assertEquals("Square{side=4.0,diag=2.0}", Eval2.eval(code, 4));
@@ -167,7 +167,7 @@ return new Square;
         """;
 
     @Test public void testConstructorMemory() {
-        var code = new CodeGen(CONSTRUCTOR_MEMORY).parse().opto();
+        var code = new CodeGen(CONSTRUCTOR_MEMORY).parse().iter();
         assertEquals("111249",Eval2.eval(code,0));
         assertEquals("222352",Eval2.eval(code,1));
     }
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Chapter17aTest.java b/chapter20/src/test/java/com/seaofnodes/simple/Chapter17aTest.java
index 16ffe967..4a69c33d 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Chapter17aTest.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Chapter17aTest.java
@@ -17,7 +17,7 @@ int x=2, y=3;
 if( arg ) { int x = y; x = x*x; y=x; } // Shadow final x
 return y;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,9,3);", code.print());
         assertEquals("3", Eval2.eval(code, 0));
         assertEquals("9", Eval2.eval(code, 1));
@@ -30,7 +30,7 @@ struct X { int ~x; };
 X z = new X { x=3; };
 return z.x;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 3;", code.print());
         assertEquals("3", Eval2.eval(code,  0));
     }
@@ -42,7 +42,7 @@ struct Point { int ~x, ~y; };
 Point p = new Point { x=3; y=4; };
 return p;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return (const)Point;", code.print());
         assertEquals("Point{x=3,y=4}", Eval2.eval(code,  0));
     }
@@ -55,7 +55,7 @@ Point p = new Point { x=5; y=6; };
 p.x++;
 return p;
 """);
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) { assertEquals("Cannot modify final field 'x'",e.getMessage()); }
     }
 
@@ -67,7 +67,7 @@ Point p = new Point;
 p.x++;
 return p;
 """);
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) { assertEquals("Cannot modify final field 'x'",e.getMessage()); }
     }
 
@@ -75,7 +75,7 @@ return p;
     public void testStructFinal3() {
         for( String fields : new String[] { "var x; var y;", "int[] !x;", "int[] !x;" } ) {
             String src = "struct Point { "+fields+" }; Point p = new Point; p.x++; return p;";
-            try { new CodeGen(src).parse().opto(); fail(fields); }
+            try { new CodeGen(src).parse().iter(); fail(fields); }
             catch( Exception e ) { assertEquals("'Point' is not fully initialized, field 'x' needs to be set in a constructor",e.getMessage()); }
         }
     }
@@ -88,7 +88,7 @@ Point p = new Point;
 p.x++;
 return p;
 """);
-        try { code.parse().opto(); fail(); }
+        try { code.parse().iter(); fail(); }
         catch( Exception e ) { assertEquals("Cannot reassign final 'x'",e.getMessage()); }
     }
 
@@ -100,7 +100,7 @@ struct Point { var x=3; var y=4; };
 p.x++;
 return p;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Point;", code.print());
         assertEquals("Point{x=4,y=4}", Eval2.eval(code,  0));
     }
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Chapter17bTest.java b/chapter20/src/test/java/com/seaofnodes/simple/Chapter17bTest.java
index da619ed3..f6eb0190 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Chapter17bTest.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Chapter17bTest.java
@@ -15,7 +15,7 @@ public class Chapter17bTest {
 """
 return 1;
 """);
-        code.parse().opto().typeCheck();
+        code.parse().iter().typeCheck();
         assertEquals("return 1;", code.print());
         assertEquals("1", Eval2.eval(code,  0));
     }
@@ -27,7 +27,7 @@ return 1;
         CodeGen code = new CodeGen("""
 return arg++;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return arg;", code.print());
         assertEquals("0", Eval2.eval(code, 0));
     }
@@ -37,7 +37,7 @@ return arg++;
         CodeGen code = new CodeGen("""
 return arg+++arg++;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return ((arg<<1)+1);", code.print());
         assertEquals("1", Eval2.eval(code, 0));
     }
@@ -48,7 +48,7 @@ return arg+++arg++;
 //   -(arg--)-(arg--)
 return -arg---arg--;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return (-((arg<<1)+-1));", code.print());
         assertEquals("1", Eval2.eval(code, 0));
     }
@@ -61,7 +61,7 @@ xs[0]++;
 xs[1]++;
 return xs[0];
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 1;", code.print());
         assertEquals("1", Eval2.eval(code, 2));
     }
@@ -73,7 +73,7 @@ u8[] !xs = new u8[1];
 xs[0]--;
 return xs[0];
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 255;", code.print());
         assertEquals("255", Eval2.eval(code, 2));
     }
@@ -86,7 +86,7 @@ struct S { u16 x; };
 s.x--;
 return s.x;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 65535;", code.print());
         assertEquals("65535", Eval2.eval(code, 2));
     }
@@ -94,7 +94,7 @@ return s.x;
     @Test
     public void testInc6() {
         CodeGen code = new CodeGen("return --arg;");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return (arg+-1);", code.print());
         assertEquals("-1", Eval2.eval(code, 0));
     }
@@ -102,7 +102,7 @@ return s.x;
     @Test
     public void testInc7() {
         CodeGen code = new CodeGen("u8 x=0; return --x;");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 255;", code.print());
         assertEquals("255", Eval2.eval(code, 0));
     }
@@ -110,7 +110,7 @@ return s.x;
     @Test
     public void testInc8() {
         CodeGen code = new CodeGen("int x; x+=2; return x+=3;");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 5;", code.print());
         assertEquals("5", Eval2.eval(code, 0));
     }
@@ -118,14 +118,14 @@ return s.x;
     @Test
     public void testInc9() {
         CodeGen code = new CodeGen("flt x = 1.5; x++; return x;");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 2.5f;", code.print());
         assertEquals("2.5", Eval2.eval(code, 0));
     }
 
     @Test public void testInt10() {
         CodeGen code = new CodeGen("flt x = 1.5; x++; int i = x; return i;");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("2",Eval2.eval(code,0));
     }
 
@@ -133,73 +133,73 @@ return s.x;
     // ---------------------------------------------------------------
     @Test public void testVar0() {
         CodeGen code = new CodeGen("var d; return d;");
-        try { code.parse().opto(); fail(); }
+        try { code.parse().iter(); fail(); }
         catch( Exception e ) { assertEquals("Syntax error, expected =expression: ;",e.getMessage()); }
     }
 
     @Test public void testVar1() {
         CodeGen code = new CodeGen("val d; return d;");
-        try { code.parse().opto(); fail(); }
+        try { code.parse().iter(); fail(); }
         catch( Exception e ) { assertEquals("Syntax error, expected =expression: ;",e.getMessage()); }
     }
 
     @Test public void testVar2() {
         CodeGen code = new CodeGen("int x; x=3; x++; return x; // Ok, no initializer so x is mutable ");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 4;", code.print());
         assertEquals("4", Eval2.eval(code, 0));
     }
 
     @Test public void testVar3() {
         CodeGen code = new CodeGen("int x=3; x++; return x; // Ok, primitive so x is mutable despite initializer ");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 4;", code.print());
         assertEquals("4", Eval2.eval(code, 0));
     }
 
     @Test public void testVar4() {
         CodeGen code = new CodeGen("struct S{int x;}; !S? !s; s=new S; s.x++; return s.x; // Ok, no initializer so x is mutable ");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 1;", code.print());
         assertEquals("1", Eval2.eval(code, 0));
     }
 
     @Test public void testVar5() {
         CodeGen code = new CodeGen("struct S{int x;}; !S? !s; s=new S{x=3;}; s.x++; return s.x; // Ok, no initializer so x is mutable ");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 4;", code.print());
         assertEquals("4", Eval2.eval(code, 0));
     }
 
     @Test public void testVar6() {
         CodeGen code = new CodeGen("struct S{int x;}; S s=new S; s.x++; return s.x; // Error initializer so x is immutable ");
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) { assertEquals("Cannot modify final field 'x'",e.getMessage()); }
     }
 
     @Test public void testVar7() {
         CodeGen code = new CodeGen("struct S{int x;}; S s=new S{x=3;}; s.x++; return s.x; // Error initializer so x is immutable ");
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) { assertEquals("Cannot modify final field 'x'",e.getMessage()); }
     }
 
     @Test public void testVar8() {
         CodeGen code = new CodeGen("struct S{int x;}; !S !s=new S; s.x++; return s.x; // Ok, has '!' so s.x is mutable ");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 1;", code.print());
         assertEquals("1", Eval2.eval(code, 0));
     }
 
     @Test public void testVar9() {
         CodeGen code = new CodeGen("struct S{int x;}; var s=new S; s.x++; return s.x; // Ok, has var so s.x is mutable ");
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 1;", code.print());
         assertEquals("1", Eval2.eval(code, 0));
     }
 
     @Test public void testVar10() {
         CodeGen code = new CodeGen("struct S{int x;}; ~S s=new S; s.x++; return s.x; // Error, has val so x is immutable ");
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) { assertEquals("Cannot modify final field 'x'",e.getMessage()); }
     }
 
@@ -217,7 +217,7 @@ foo.bar.x++;   // Ok foo and foo.bar and foo.bar.x are all mutable
 ~Foo xfoo = foo; // Throw away mutability
 xfoo.bar.x++;   // Error, cannot mutate through xfoo
  """);
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) { assertEquals("Cannot modify final field 'x'",e.getMessage()); }
     }
 
@@ -238,7 +238,7 @@ foo.bar.x++;           // Bumps to 5
 int x5 = xfoo.bar.x;   // Ok to read through xfoo, gets 5
 return x4*10+x5;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 45;", code.print());
         assertEquals("45", Eval2.eval(code, 0));
     }
@@ -248,7 +248,7 @@ return x4*10+x5;
         CodeGen code = new CodeGen("""
 int i,i++;
 """);
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) { assertEquals("Redefining name 'i'",e.getMessage()); }
     }
 
@@ -263,7 +263,7 @@ A x = new A {
     b = new B;
 };
 """);
-        try { code.parse().opto(); fail(); }
+        try { code.parse().iter(); fail(); }
         catch( Exception e ) { assertEquals("Cannot read uninitialized field 'b'",e.getMessage()); }
     }
 
@@ -276,7 +276,7 @@ return new A {
     if (arg) b = new B; // Constructor ends with partial init of b
 }.b;
 """);
-        try { code.parse().opto(); fail(); }
+        try { code.parse().iter(); fail(); }
         catch( Exception e ) { assertEquals("'A' is not fully initialized, field 'b' needs to be set in a constructor",e.getMessage()); }
     }
 
@@ -290,7 +290,7 @@ val s = new S{x = 2;};
 return x;
 """
 );
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) { assertEquals("Cannot reassign final 'x'",e.getMessage()); }
     }
 
@@ -309,7 +309,7 @@ focus(me);
 return me;
 """
 );
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) { assertEquals("Syntax error, expected =expression: ;",e.getMessage()); }
     }
 
@@ -319,7 +319,7 @@ return me;
         CodeGen code = new CodeGen("""
 return arg ? 1 : 2;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,1,2);", code.print());
         assertEquals("2", Eval2.eval(code, 0));
         assertEquals("1", Eval2.eval(code, 1));
@@ -330,7 +330,7 @@ return arg ? 1 : 2;
         CodeGen code = new CodeGen("""
 return arg ? 0 : arg;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 0;", code.print());
         assertEquals("0", Eval2.eval(code, 0));
     }
@@ -342,7 +342,7 @@ struct Bar { int x; };
 var b = arg ? new Bar : null;
 return b ? b.x++ + b.x++ : -1;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,((.x<<1)+1),-1);", code.print());
         assertEquals("-1", Eval2.eval(code, 0));
         assertEquals("1", Eval2.eval(code, 1));
@@ -355,7 +355,7 @@ struct Bar { int x; };
 var b = arg ? new Bar;
 return b ? b.x++ + b.x++ : -1;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,((.x<<1)+1),-1);", code.print());
         assertEquals("-1", Eval2.eval(code, 0));
         assertEquals("1", Eval2.eval(code, 1));
@@ -369,7 +369,7 @@ struct Bar { !Bar? !next; int x; };
 var b = arg ? new Bar { next = (arg==2) ? new Bar{x=2;}; x=1; };
 return b ? b.next ? b.next.x : b.x; // parses "b ? (b.next ? b.next.x : b.x) : 0"
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,Phi(Region,.x,.x),0);", code.print());
         assertEquals("0", Eval2.eval(code, 0));
         assertEquals("1", Eval2.eval(code, 1));
@@ -382,7 +382,7 @@ return b ? b.next ? b.next.x : b.x; // parses "b ? (b.next ? b.next.x : b.x) : 0
 flt f=arg?1:1.2;
 return f;   // missing widening
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Region,1.0f,1.2);", code.print());
         assertEquals("1.2", Eval2.eval(code,  0));
     }
@@ -394,7 +394,7 @@ return f;   // missing widening
 struct S{};
 return arg ? 7 : new S;
 """);
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) { assertEquals("No common type amongst int and reference",e.getMessage()); }
     }
 
@@ -407,7 +407,7 @@ for( int i=0; i<arg; i++ )
     sum += i;
 return sum;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,0,(Phi_sum+Phi(Loop,0,(Phi_i+1))));", code.print());
         assertEquals("3", Eval2.eval(code, 3));
         assertEquals("45", Eval2.eval(code, 10));
@@ -420,7 +420,7 @@ for( ; i<arg; i++ )
     sum += i;
 return sum;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,0,(Phi_sum+Phi(Loop,0,(Phi_i+1))));", code.print());
         assertEquals("3", Eval2.eval(code, 3));
         assertEquals("45", Eval2.eval(code, 10));
@@ -435,7 +435,7 @@ for( int i=0; ; i++ ) {
 }
 return sum;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,0,(Phi_sum+Phi(Loop,0,(Phi_i+1))));", code.print());
         assertEquals("3", Eval2.eval(code, 3));
         assertEquals("45", Eval2.eval(code, 10));
@@ -448,7 +448,7 @@ for( int i=0; i<arg; )
     sum += i++;
 return sum;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,0,(Phi_sum+Phi(Loop,0,(Phi_i+1))));", code.print());
         assertEquals("3", Eval2.eval(code, 3));
         assertEquals("45", Eval2.eval(code, 10));
@@ -461,7 +461,7 @@ for( int i=0; i<arg; i++ )
     sum += i;
 return i;
 """);
-        try { code.parse().opto(); fail(); }
+        try { code.parse().iter(); fail(); }
         catch( Exception e ) { assertEquals("Undefined name 'i'",e.getMessage()); }
     }
     @Test
@@ -469,7 +469,7 @@ return i;
         CodeGen code = new CodeGen("""
 for(;;arg++;) {}
 """);
-        try { code.parse().opto(); fail(); }
+        try { code.parse().iter(); fail(); }
         catch( Exception e ) { assertEquals("Syntax error, expected Unexpected code after expression: ;",e.getMessage()); }
     }
 
@@ -485,7 +485,7 @@ struct A{
 };
 return new A;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return A;", code.print());
         assertEquals("A{f1=null,f2=null}", Eval2.eval(code,0));
     }
@@ -499,7 +499,7 @@ struct A{
 };
 return new A.not_array_of_b;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return [*B?];", code.print());
         assertEquals("*B?[]", Eval2.eval(code,0));
     }
@@ -518,7 +518,7 @@ for( ; ptr; ptr = ptr.next )
     sum += ptr.i;
 return sum;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return Phi(Loop,0,(Phi_sum+.i));", code.print());
         assertEquals("45", Eval2.eval(code, 10));
     }
@@ -549,7 +549,7 @@ for( int j=0; j<nprimes; j++ )
     rez[j] = primes[j];
 return rez;
 """);
-        code.parse().opto().typeCheck().GCM();
+        code.driver(CodeGen.Phase.Schedule);
         assertEquals("return [int];", code.print());
         assertEquals("int[ 2,3,5,7,11,13,17,19]",Eval2.eval(code, 20));
     }
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Chapter18Test.java b/chapter20/src/test/java/com/seaofnodes/simple/Chapter18Test.java
index dafd2f3a..26ae7bf2 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Chapter18Test.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Chapter18Test.java
@@ -18,7 +18,7 @@ public class Chapter18Test {
             "int x=0; while(arg) { if(arg==2) while(1) { x++; } x++; arg--; } return x;"
         };
         for( String src : sources ) {
-            CodeGen code = new CodeGen(src).parse().opto().typeCheck();
+            CodeGen code = new CodeGen(src).parse().iter().typeCheck();
             code._start.buildLoopTree(code._stop);
             int[] nevers = {0};
             code._stop.walk(n -> {
@@ -51,7 +51,7 @@ public class Chapter18Test {
                      "val g = { int x -> x ? g(x-1)/305420988+x*305420988 : 1; }; "+
                      "return f(arg)+g(arg);";
         CodeGen code = new CodeGen(src);
-        code.parse().opto().typeCheck();
+        code.parse().iter().typeCheck();
         Node con = code._stop.walk(n -> n instanceof ConstantNode &&
                                   n._type==TypeInteger.constant(305420988) ? n : null);
         assertNotNull(con);
@@ -62,7 +62,7 @@ public class Chapter18Test {
         for( Node use : uses )
             for( int i=1; i<use.nIns(); i++ )
                 if( use.in(i)==con ) use.setDef(i,cast);
-        code.GCM();
+        code.driver(CodeGen.Phase.Schedule);
         var owners = new java.util.IdentityHashMap<CFGNode,Boolean>();
         code._stop.walk(n -> {
             if( !(n instanceof CastNode) || !(n.in(1) instanceof CastNode) ) return null;
@@ -99,7 +99,7 @@ public class Chapter18Test {
              "No common type amongst int and reference"}
         } ) {
             try {
-                new CodeGen(test[0]).parse().opto().typeCheck();
+                new CodeGen(test[0]).parse().iter().typeCheck();
                 fail("Expected incompatible return types: " + test[0]);
             } catch( Parser.ParseException e ) {
                 assertEquals(test[1],e.getMessage());
@@ -130,7 +130,7 @@ public class Chapter18Test {
 """
 return 0;
 """);
-        code.parse().opto().typeCheck().GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched);
         assertEquals("return 0;", code._stop.toString());
         assertEquals("0", Eval2.eval(code,  2));
     }
@@ -148,7 +148,7 @@ while(arg--) {
 }
 return a;
 """);
-        code.parse().opto().typeCheck().GCM();
+        code.driver(CodeGen.Phase.Schedule);
         assertEquals("return Phi(Loop,1,Phi(Loop,2,Phi_a));", code._stop.toString());
         assertEquals("1", Eval2.eval(code,  0));
         assertEquals("2", Eval2.eval(code,  1));
@@ -165,7 +165,7 @@ return a;
 {int -> int}? x2 = null; // null function ptr
 return x2;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return null;", code._stop.toString());
         assertEquals("null", Eval2.eval(code, 0 ) );
     }
@@ -179,7 +179,7 @@ return x2;
 };
 return sq;
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("Stop[ return { sq}; return (Parm_x(sq,int)*x); ]", code._stop.toString());
         assertEquals("{ int -> int #1}", Eval2.eval(code, 3));
     }
@@ -193,7 +193,7 @@ var sq = { int x ->
 };
 return sq(arg)+sq(3);
 """);
-        code.parse().opto().typeCheck().GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched);
         assertEquals("Stop[ return (#2+#2); return (Parm_x(sq,int)*x); ]", code._stop.toString());
         assertEquals("13", Eval2.eval(code, 2));
     }
@@ -206,7 +206,7 @@ return sq(arg)+sq(3);
 int cnt=1;
 return { -> cnt; };
 """);
-        try { code.parse().opto(); fail(); }
+        try { code.parse().iter(); fail(); }
         catch( Exception e ) { assertEquals("Variable 'cnt' is out of function scope and must be a final constant",e.getMessage()); }
     }
 
@@ -218,7 +218,7 @@ return { -> cnt; };
 val cnt=2;
 return { -> cnt; }();
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("return 2;", code._stop.toString());
         assertEquals("2", Eval2.eval(code, 0));
     }
@@ -231,7 +231,7 @@ return { -> cnt; }();
 var fcn = arg ? { int x -> x*x; } : { int x -> x+x; };
 return fcn(3);
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("Stop[ return #2; return (Parm_x($fun1,int,3)*x); return (Parm_x($fun2,int,3)<<1); ]", code._stop.toString());
         assertEquals("6", Eval2.eval(code, 0));
         assertEquals("9", Eval2.eval(code, 1));
@@ -241,7 +241,7 @@ return fcn(3);
     @Test
     public void testFcn5() {
         CodeGen code = new CodeGen("val fact = { int x -> x <= 1 ? 1 : x*fact(x-1); }; return fact(arg);");
-        code.parse().opto().typeCheck();
+        code.parse().iter().typeCheck();
         assertEquals("Stop[ return #2; return Phi(Region,1,(Parm_x(fact,int,arg,(x-1))*#2)); ]", code._stop.toString());
         assertEquals( "1", Eval2.eval(code, 0));
         assertEquals( "1", Eval2.eval(code, 1));
@@ -258,7 +258,7 @@ struct S { int i; };
 val newS = { int x -> return new S { i=x; }; };
 return newS(1).i;
 """);
-        code.parse().opto().typeCheck().GCM();
+        code.driver(CodeGen.Phase.Schedule);
         assertEquals("return 1;", code._stop.toString());
         assertEquals("1", Eval2.eval(code,  0));
     }
@@ -273,7 +273,7 @@ val f = {->1;};
 val g = {->2;};
 return 2;
 """);
-        code.parse().opto().typeCheck().GCM();
+        code.driver(CodeGen.Phase.Schedule);
         assertEquals("Stop[ return 1; return 1; return 2; ]", code._stop.toString());
         assertEquals("1", Eval2.eval(code,  0));
     }
@@ -291,7 +291,7 @@ for(;;) {
     i2i = id(x);
 }
 """);
-        code.parse().opto().typeCheck().GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched);
         assertEquals("Stop[ return #2; return Parm_i(x,int); ]", code._stop.toString());
         assertEquals("3", Eval2.eval(code,  0));
     }
@@ -307,7 +307,7 @@ for(;;) {
     arg = x(3);
 }
 """);
-        code.parse().opto().typeCheck().GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched);
         assertEquals("return Top;", code._stop.toString());
         assertEquals(null, Eval2.eval(code,  0));
     }
@@ -332,7 +332,7 @@ ps[0] = new Person;
 ps[1] = new Person;
 fcn(ps,1);
 """);
-        code.parse().opto().typeCheck().GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched);
         assertEquals("return 0;", code._stop.toString());
         assertEquals("0", Eval2.eval(code,  0));
     }
@@ -351,7 +351,7 @@ for(;;) {
 }
 return 1;
 """);
-        try { code.parse().opto(); fail(); }
+        try { code.parse().iter(); fail(); }
         catch( Exception e ) { assertEquals("No active loop for a break or continue",e.getMessage()); }
     }
 
@@ -366,7 +366,7 @@ for(;;) {
     i2i = null;
 }
 """);
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) { assertEquals("Might be null calling { int -> int #1}?",e.getMessage()); }
     }
 
@@ -378,7 +378,7 @@ for(;;) {
 val f = { int i, int j -> return i+j; };
 return f();
 """);
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) { assertEquals("Expecting 2 arguments, but found 0",e.getMessage()); }
     }
 
@@ -396,7 +396,7 @@ for(;;) {
     if (s) return s.x;
 }
 """);
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) { assertEquals("Accessing unknown field 'x' from '*S'",e.getMessage()); }
     }
 
@@ -409,7 +409,7 @@ val g = { ->
 };
 return 0;
 """);
-        try { code.parse().opto().typeCheck(); fail(); }
+        try { code.parse().iter().typeCheck(); fail(); }
         catch( Exception e ) { assertEquals("No defined return type",e.getMessage()); }
     }
 
@@ -423,7 +423,7 @@ val is_even = { int x -> x ? is_odd (x-1) : true ; };
 val is_odd  = { int x -> x ? is_even(x-1) : false; };
 return is_even(arg);
 """);
-        code.parse().opto();
+        code.parse().iter();
         assertEquals("Stop[ return is_even( arg); return Phi(Region,Phi(Region,is_even( ((Parm_x(is_even,int,arg,Sub)-1)-1)),0),1); ]", code._stop.toString());
         assertEquals("1", Eval2.eval(code, 0));
         assertEquals("0", Eval2.eval(code, 1));
@@ -445,7 +445,7 @@ for(;;) {
     if (s) return s.f;
 }
 """);
-        code.parse().opto().typeCheck().GCM();
+        code.driver(CodeGen.Phase.Schedule);
         assertEquals("return 0;", code._stop.toString());
         assertEquals("0", Eval2.eval(code,  0));
     }
@@ -462,7 +462,7 @@ if (arg) i2i = null;
 if (i2i) return i2i(arg);
 return f2f(o)(1);
 """);
-        code.parse().opto().typeCheck().GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched);
         assertEquals("Stop[ return Phi(Region,#2,1); return Parm_i(o,int); ]", code._stop.toString());
         assertEquals("1", Eval2.eval(code,  2));
     }
@@ -478,7 +478,7 @@ struct Person {
 p.coffee_count += 1;
 return p.coffee_count;
 """);
-        code.parse().opto().typeCheck().GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched);
         assertEquals("return 1;", code._stop.toString());
         assertEquals("1", Eval2.eval(code,  2));
     }
@@ -497,7 +497,7 @@ return p.coffee_count;
         """;
 
     @Test public void testCallMemory() {
-        var code = new CodeGen(CALL_MEMORY).parse().opto();
+        var code = new CodeGen(CALL_MEMORY).parse().iter();
         int[] calls={0};
         code._stop.walk(n -> { if(n instanceof CallNode) calls[0]++; return null; });
         assertEquals(2,calls[0]); // Keep real calls so this checks scheduling across them.
@@ -526,7 +526,7 @@ return p.coffee_count;
         """;
 
     @Test public void testRecursiveMemory() {
-        var code = new CodeGen(RECURSIVE_MEMORY).parse().opto();
+        var code = new CodeGen(RECURSIVE_MEMORY).parse().iter();
         for(int n=0; n<7; n++)
             assertEquals(Long.toString((10L*(n+1)+n*(n+1)/2)*100+10+n),Eval2.eval(code,n));
     }
@@ -544,7 +544,7 @@ return p.coffee_count;
         """;
 
     @Test public void testInlineAllocationMemory() {
-        var code = new CodeGen(INLINE_MEMORY).parse().opto();
+        var code = new CodeGen(INLINE_MEMORY).parse().iter();
         assertNull(code._stop.walk(n -> n instanceof CallNode ? n : null));
         assertEquals("400944",Eval2.eval(code,0));
         assertEquals("420946",Eval2.eval(code,2));
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Chapter19Test.java b/chapter20/src/test/java/com/seaofnodes/simple/Chapter19Test.java
index 9bd75207..f93e79a9 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Chapter19Test.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Chapter19Test.java
@@ -37,7 +37,7 @@ public class Chapter19Test {
         CodeGen code = new CodeGen("""
 return 0;
 """);
-        code.parse().opto().typeCheck();
+        code.parse().iter().typeCheck();
         assertEquals("return 0;", code._stop.toString());
         assertEquals("0", Eval2.eval(code,  2));
     }
@@ -81,105 +81,105 @@ val _hashCodeString = { !String self ->
 s.cs[0] =  67; // C
 s.cs[1] = 108; // l
 hashCode(s)+hashCode(s);""");
-        code.parse().opto().typeCheck().GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched);
         assertEquals("Stop[ return (#2+#2); return Phi(Region,1,0,0,1); return Phi(Region,._hashCode,Phi(Region,123456789,Phi(Loop,0,(.[]+((Phi_hash<<5)-Phi_hash))))); ]", code._stop.toString());
         assertEquals("-4898613127354160978", Eval2.eval(code,  2));
     }
 
     @Test
     public void testBasic0() {
-        CodeGen code = new CodeGen("return 0;").parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        CodeGen code = new CodeGen("return 0;").driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return 0;", code._stop.toString());
     }
 
     @Test
     public void testBasic1() {
-        CodeGen code = new CodeGen("return arg+1;").parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        CodeGen code = new CodeGen("return arg+1;").driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (inc,arg);", code._stop.toString());
     }
 
     @Test
     public void testBasic2() {
-        CodeGen code = new CodeGen("return -17;").parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        CodeGen code = new CodeGen("return -17;").driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return -17;", code._stop.toString());
     }
 
 
     @Test
     public void testBasic3() {
-        CodeGen code = new CodeGen("return arg==1;").parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        CodeGen code = new CodeGen("return arg==1;").driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (set==,(cmp,arg));", code._stop.toString());
     }
 
     @Test
     public void testBasic4() {
-        CodeGen code = new CodeGen("return arg<<1;").parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        CodeGen code = new CodeGen("return arg<<1;").driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (shli,arg);", code._stop.toString());
     }
 
     @Test
     public void testBasic5() {
-        CodeGen code = new CodeGen("return arg >> 1;").parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        CodeGen code = new CodeGen("return arg >> 1;").driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (sari,arg);", code._stop.toString());
     }
 
     @Test
     public void testBasic6() {
-        CodeGen code = new CodeGen("return arg >>> 1;").parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        CodeGen code = new CodeGen("return arg >>> 1;").driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (shri,arg);", code._stop.toString());
     }
 
     @Test
     public void testBasic7() {
-        CodeGen code = new CodeGen("return arg / 2;").parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        CodeGen code = new CodeGen("return arg / 2;").driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (div,arg,2);", code._stop.toString());
     }
 
     @Test
     public void testBasic8() {
-        CodeGen code = new CodeGen("return arg * 6;").parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        CodeGen code = new CodeGen("return arg * 6;").driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (muli,arg);", code._stop.toString());
     }
 
     @Test
     public void testBasic9() {
-        CodeGen code = new CodeGen("return arg & 2;").parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        CodeGen code = new CodeGen("return arg & 2;").driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (andi,arg);", code._stop.toString());
     }
 
     @Test
     public void testBasic10() {
-        CodeGen code = new CodeGen("return arg | 2;").parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        CodeGen code = new CodeGen("return arg | 2;").driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (ori,arg);", code._stop.toString());
     }
 
     @Test
     public void testBasic11() {
-        CodeGen code = new CodeGen("return arg ^ 2;").parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        CodeGen code = new CodeGen("return arg ^ 2;").driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (xori,arg);", code._stop.toString());
     }
 
     @Test
     public void testBasic12() {
-        CodeGen code = new CodeGen("return arg + 2.0;").parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        CodeGen code = new CodeGen("return arg + 2.0;").driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (addf,(i2f8,arg),2.0f);", code._stop.toString());
     }
 
     @Test
     public void testBasic13() {
-        CodeGen code = new CodeGen("return arg - 2.0;").parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        CodeGen code = new CodeGen("return arg - 2.0;").driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (subf,(i2f8,arg),2.0f);", code._stop.toString());
     }
 
     @Test
     public void testBasic14() {
-        CodeGen code = new CodeGen("return arg * 2.0;").parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        CodeGen code = new CodeGen("return arg * 2.0;").driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (mulf,(i2f8,arg),2.0f);", code._stop.toString());
     }
 
     @Test
     public void testBasic15() {
-        CodeGen code = new CodeGen("return arg / 2.0;").parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        CodeGen code = new CodeGen("return arg / 2.0;").driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (mulf,(i2f8,arg),0.5f);", code._stop.toString());
     }
 
@@ -189,7 +189,7 @@ hashCode(s)+hashCode(s);""");
 """
 int arg1 =  arg + 1;
 return arg1 / arg;""");
-        code.parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (div,(inc,arg),arg);", code._stop.toString());
     }
 
@@ -200,7 +200,7 @@ return arg1 / arg;""");
 int arg1 =  arg + 1;
 return arg1 * arg;
 """);
-        code.parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (mul,(inc,arg),arg);", code._stop.toString());
     }
 
@@ -210,7 +210,7 @@ return arg1 * arg;
                 int a = arg;
                 return a + 2.0;
                 """
-        ).parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        ).driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (addf,(i2f8,arg),2.0f);", code._stop.toString());
     }
 
@@ -225,7 +225,7 @@ else {
     a = arg-3;
 }
 return a;""");
-        code.parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return Phi(Region,(addi,arg),(addi,arg));", code.print());
     }
 
@@ -240,7 +240,7 @@ if( arg==1 )
 else
     a=b+1;
 return a+b;""");
-        code.parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (add,(add,Phi(Region,(shli,arg),arg),arg),Phi(Region,4,5));", code.print());
     }
 
@@ -252,7 +252,7 @@ int sum=0;
 for( int i=0; i<arg; i++ )
     sum += i;
 return sum;""");
-        code.parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return Phi(Loop,0,(add,Phi_sum,Phi(Loop,0,(inc,Phi_i))));", code.print());
     }
 
@@ -262,42 +262,42 @@ return sum;""");
 """
 struct S { int a; !S? !c; };
 return new S;""");
-        code.parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return S;", code.print());
     }
 
     @Test
     public void testLea1() {
         CodeGen code = new CodeGen("int x = arg/3; return arg+x+7;");
-        code.parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2",  "SystemV").GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (lea,arg,(div,arg,3));", code.print());
     }
 
     @Test
     public void testLea2() {
         CodeGen code = new CodeGen("int x = arg/3; return arg+x*4+7;");
-        code.parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (lea,arg,(div,arg,3));", code.print());
     }
 
     @Test
     public void testLea3() {
         CodeGen code = new CodeGen("int x = arg/3; return x*4+arg;");
-        code.parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2",  "SystemV").GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return (lea,arg,(div,arg,3));", code.print());
     }
 
     @Test
     public void testAlloc2() {
         CodeGen code = new CodeGen("int[] !xs = new int[3]; xs[arg]=1; return xs[arg&1];");
-        code.parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return .[];", code.print());
     }
 
     @Test
     public void testAlloc3() {
         CodeGen code = new CodeGen("int[] !xs = new int[3]; xs[arg]=1; return xs[arg&1]+3;");
-        code.parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return .[];", code.print());
     }
 
@@ -314,7 +314,7 @@ for( int i=0; i<ary#-1; i++ )
     ary[i+1] += ary[i];
 return ary[1] * 1000 + ary[3]; // 1 * 1000 + 6
 """);
-        code.parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return .[];", code.print());
     }
 
@@ -329,7 +329,7 @@ for( int i=0; i<A#; i++ )
 for( int i=0; i<A#; i++ )
     B[i] += A[i];
 """);
-        code.parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return 0;", code.print());
     }
 
@@ -342,7 +342,7 @@ for( int i=0; i<A#; i++ )
     A[i]++;
 return A[1];
 """);
-        code.parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return .[];", code.print());
     }
 
@@ -362,7 +362,7 @@ val sqrt = { flt x ->
 flt farg = arg;
 return sqrt(farg);
 """);
-        code.parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return Phi(Loop,(i2f8,arg),(mulf,(addf,(divf,i2f8,Phi_guess),Phi_guess),0.5f));", code.print());
     };
 
@@ -393,7 +393,7 @@ for( int j=0; j<nprimes; j++ )
     rez[j] = primes[j];
 return rez;
 """);
-        code.parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("return [int];", code.print());
         //assertEquals("int[ 2,3,5,7,11,13,17,19]",Eval2.eval(code, 20));
     }
@@ -406,7 +406,7 @@ return rez;
 val fcn = arg ? { int x -> x*x; } : { int x -> x+x; };
 return fcn(2)*10 + fcn(3);
 """);
-        code.parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("Stop[ return (add,#2,(muli,#2)); return (mul,Parm_x($fun1,int),x); return (shli,Parm_x($fun2,int)); ]", code.print());
     }
 
@@ -417,7 +417,7 @@ return fcn(2)*10 + fcn(3);
 val sq = { int x -> x*x; };
 return sq(arg) + sq(3);
 """);
-        code.parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2", "SystemV").GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         assertEquals("Stop[ return (add,#2,#2); return (mul,Parm_x(sq,int),x); ]", code.print());
     }
 
@@ -425,11 +425,11 @@ return sq(arg) + sq(3);
         for( String cpu : new String[]{"x86_64_v2","riscv","arm"} )
             for( String src : new String[]{Chapter10Test.NESTED_MEMORY,Chapter16Test.CONSTRUCTOR_MEMORY,
                                           Chapter18Test.CALL_MEMORY,Chapter18Test.RECURSIVE_MEMORY} ) {
-                var code = new CodeGen(src).parse().opto().typeCheck();
+                var code = new CodeGen(src).parse().iter().typeCheck();
                 var aliases = memoryPhis(code._stop);
-                code.instSelect(PORTS,cpu,"SystemV");
+                code.driver(CodeGen.Phase.InstSelect,cpu,"SystemV");
                 assertEquals(aliases,memoryPhis(code._stop));
-                code.GCM().localSched();
+                code.driver(CodeGen.Phase.Schedule).localSched();
                 code._stop.walk(n -> {
                     if( !(n instanceof CFGNode) && !(n instanceof ProjNode) )
                         assertTrue(n.in(0) instanceof CFGNode);
@@ -480,7 +480,7 @@ return sq(arg) + sq(3);
             int before = p.x + arg;
             a.x=33; b.x=44;
             return before;
-            """).parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2","SystemV").GCM().localSched();
+            """).driver(CodeGen.Phase.LocalSched,"x86_64_v2","SystemV");
         var read = (MemOpNode)code._stop.walk(n ->
             n instanceof com.seaofnodes.simple.node.cpus.x86_64_v2.AddMemX86 ? n : null);
         assertNotNull(read);
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Chapter20Test.java b/chapter20/src/test/java/com/seaofnodes/simple/Chapter20Test.java
index 104be01e..e6a01826 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Chapter20Test.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Chapter20Test.java
@@ -10,6 +10,10 @@ import static com.seaofnodes.simple.Main.PORTS;
 import static org.junit.Assert.*;
 
 public class Chapter20Test {
+    @Test public void testFlagSpills() throws Exception {
+        com.seaofnodes.simple.codegen.FlagSpillTestSupport.run();
+    }
+
     @Test public void testAllocatorTopPhi() { com.seaofnodes.simple.codegen.RegAllocTestSupport.topPhi(); }
 
     @Test public void testAllocatorFixedNeighbor() throws Exception { com.seaofnodes.simple.codegen.RegAllocTestSupport.uncoloredFixedNeighbor(); }
@@ -17,7 +21,7 @@ public class Chapter20Test {
     @Test public void testNarrowStoreMasks() {
         for( String type : new String[]{"i8","u8","i16","u16"} ) {
             CodeGen code = new CodeGen("struct S { "+type+" x; }; !S !s=new S; s.x=arg; return 0;")
-                .parse().opto().typeCheck().instSelect(PORTS,"x86_64_v2","SystemV").GCM().localSched().regAlloc();
+                .driver(CodeGen.Phase.RegAlloc,"x86_64_v2","SystemV");
             int stores=0;
             for( var bb : code._cfg )
                 for( var node : bb.outs() )
@@ -40,7 +44,7 @@ return f(s);
         // The entry of g can disappear before its Return is folded into f.
         // Exercise both worklist orders; deleting the entry does not kill 123.
         for( int seed=0; seed<64; seed++ ) {
-            CodeGen code = new CodeGen(src,com.seaofnodes.simple.type.TypeInteger.BOT,seed).parse().opto().typeCheck();
+            CodeGen code = new CodeGen(src,com.seaofnodes.simple.type.TypeInteger.BOT,seed).parse().iter().typeCheck();
             assertEquals("seed "+seed, "123", Eval2.eval(code,0));
         }
     }
@@ -64,7 +68,7 @@ return f(s);
     @Test
     public void testJig() {
         CodeGen code = new CodeGen("return 0;");
-        code.parse().opto().typeCheck();
+        code.parse().iter().typeCheck();
         assertEquals("return 0;", code._stop.toString());
         assertEquals("0", Eval2.eval(code,  2));
     }
@@ -76,7 +80,7 @@ return f(s);
 
     static void testCPU(String src, String cpu, String os, int spills, String stop) {
         CodeGen code = new CodeGen(src);
-        code.parse().opto().typeCheck().instSelect(PORTS,cpu,os).GCM().localSched().regAlloc().encode();
+        code.driver(CodeGen.Phase.RegAlloc,cpu,os);
         com.seaofnodes.simple.codegen.RegAllocTestSupport.checkRegisters(code);
         SpillStats.record(code,"Chapter20",cpu,os);
         assertEquals("Expect spills: "+cpu,spills,code._regAlloc._spillScaled,Math.max(1,spills>>3));
@@ -254,8 +258,7 @@ return arg;
             for( String src : new String[]{Chapter10Test.NESTED_MEMORY,Chapter16Test.CONSTRUCTOR_MEMORY,
                                           Chapter18Test.CALL_MEMORY,Chapter18Test.RECURSIVE_MEMORY,
                                           "int[] !a = new int[3]; a[arg]=arg; return a[0]+1;"} ) {
-                var code = new CodeGen(src).parse().opto().typeCheck()
-                    .instSelect(PORTS,cpu,"SystemV").GCM().localSched().regAlloc();
+                var code = new CodeGen(src).driver(CodeGen.Phase.RegAlloc,cpu,"SystemV");
                 com.seaofnodes.simple.codegen.RegAllocTestSupport.checkRegisters(code);
                 code._stop.walk(n -> {
                     // Whole memory, precise Phis, and memory projections need no register.
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/CompoundAssignmentTest.java b/chapter20/src/test/java/com/seaofnodes/simple/CompoundAssignmentTest.java
index 48f739cf..8131c95f 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/CompoundAssignmentTest.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/CompoundAssignmentTest.java
@@ -88,7 +88,7 @@ public class CompoundAssignmentTest {
     }
 
     private static void check(String src, long arg, long expected) {
-        var code = new CodeGen(src).parse().opto().typeCheck();
+        var code = new CodeGen(src).parse().iter().typeCheck();
         assertEquals(src, Long.toString(expected), Eval2.eval(code, arg));
     }
 }
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Eval2.java b/chapter20/src/test/java/com/seaofnodes/simple/Eval2.java
index 3312ec6b..83827319 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Eval2.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Eval2.java
@@ -116,9 +116,7 @@ public abstract class Eval2 {
     public static String eval( CodeGen code, long arg, int timeout ) {
         SB trace = null; // new SB(); // TRACE, set to null for off, new SB() for on
         // Force local scheduling phase
-        if( code._phase.ordinal() < CodeGen.Phase.TypeCheck .ordinal() )  code.typeCheck();
-        if( code._phase.ordinal() < CodeGen.Phase.Schedule  .ordinal() )  code.GCM();
-        if( code._phase.ordinal() < CodeGen.Phase.LocalSched.ordinal() )  code.localSched();
+        code.driver(CodeGen.Phase.LocalSched);
         // Set global, so don't have to pass everywhere
         CODE = code;
 
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/Main.java b/chapter20/src/test/java/com/seaofnodes/simple/Main.java
index f3a6784c..5f58542b 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/Main.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/Main.java
@@ -12,7 +12,7 @@ public class Main {
         String src = Files.readString(Path.of(args[0]));
         int arg = Integer.valueOf(args[1]);
         CodeGen code = new CodeGen(src);
-        code.parse().opto().typeCheck().GCM().localSched();
+        code.driver(CodeGen.Phase.LocalSched);
         System.out.println(code._stop);
         System.out.println(Eval2.eval(code,arg,100000));
     }
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/MutabilityTest.java b/chapter20/src/test/java/com/seaofnodes/simple/MutabilityTest.java
index 7ae80314..baf4e252 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/MutabilityTest.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/MutabilityTest.java
@@ -6,12 +6,12 @@ import com.seaofnodes.simple.codegen.CodeGen;
 
 public class MutabilityTest {
     private static void ok(String src, String result) {
-        var code = new CodeGen(src).parse().opto().typeCheck();
+        var code = new CodeGen(src).parse().iter().typeCheck();
         assertEquals(result,Eval2.eval(code,0));
     }
     private static void bad(String src) {
         try {
-            new CodeGen(src).parse().opto().typeCheck();
+            new CodeGen(src).parse().iter().typeCheck();
         } catch( RuntimeException expected ) {
             String msg = expected.getMessage();
             assertTrue("Expected a permission error, got: "+expected,
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/PhaseTest.java b/chapter20/src/test/java/com/seaofnodes/simple/PhaseTest.java
new file mode 100644
index 00000000..1214ffeb
--- /dev/null
+++ b/chapter20/src/test/java/com/seaofnodes/simple/PhaseTest.java
@@ -0,0 +1,41 @@
+package com.seaofnodes.simple;
+
+import com.seaofnodes.graph.GraphObserver;
+import com.seaofnodes.simple.codegen.CodeGen;
+import com.seaofnodes.simple.codegen.CodeGen.Phase;
+import com.seaofnodes.simple.node.Node;
+import java.util.ArrayList;
+import org.junit.Test;
+import static org.junit.Assert.*;
+
+public class PhaseTest {
+    private static final String SRC = "int sum=0; for(int i=0; i<arg; i++) sum+=i; return sum;";
+
+    @Test public void testStopAndResume() {
+        ArrayList<String> phases = new ArrayList<>();
+        CodeGen code = new CodeGen(SRC);
+        code._obs = new GraphObserver<Node>() {
+            @Override public void before(Node n) {}
+            @Override public void after(Node n, Node repl, boolean applied) {}
+            @Override public void phase(String phase) { phases.add(phase); }
+        };
+        code.driver(Phase.Iter);
+        assertEquals(Phase.Iter,code._phase);
+        assertEquals("Parse Iter",String.join(" ",phases));
+        code.driver(Phase.TypeCheck);
+        code.driver(Phase.TypeCheck); // Repeated requests do not rerun phases.
+        code.driver(Phase.LoopTree);
+        assertEquals(Phase.LoopTree,code._phase);
+        code.driver(Phase.LocalSched);
+        assertEquals("Parse Iter TypeCheck LoopTree Schedule LocalSched",String.join(" ",phases));
+        assertEquals("45",Eval2.eval(code,10));
+    }
+
+    @Test public void testResumeMachineCompilation() {
+        CodeGen staged = new CodeGen(SRC).driver(Phase.TypeCheck);
+        staged.driver(Phase.InstSelect,"x86_64_v2","SystemV");
+        staged.driver(Phase.RegAlloc,"x86_64_v2","SystemV");
+        assertEquals(Phase.RegAlloc,staged._phase);
+        assertNotNull(staged._mach);
+    }
+}
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/SchedulerTest.java b/chapter20/src/test/java/com/seaofnodes/simple/SchedulerTest.java
index 3b19857a..a388d8c3 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/SchedulerTest.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/SchedulerTest.java
@@ -11,6 +11,26 @@ import static org.junit.Assert.assertEquals;
 
 public class SchedulerTest {
 
+    @Test public void testMemoryPhiAcrossSiblingBranch() {
+        // The inner memory Phi defines the load's memory. The outer Phi's
+        // other input comes from a branch not dominated by that definition.
+        String src = """
+            struct S { int x; }; !S !a=new S; !S !b=new S;
+            a.x=10; b.x=20; !S !p=a; if(arg>3) p=b;
+            int result=0;
+            if(arg>0) {
+                if(arg>2) p.x=30; else p.x=40;
+                result=a.x;
+            }
+            return result;
+            """;
+        var code = new CodeGen(src).driver(CodeGen.Phase.LocalSched);
+        long[] expected = {0,40,40,30,10,10};
+        for( int arg=0; arg<expected.length; arg++ )
+            assertEquals(Long.toString(expected[arg]),Eval2.eval(code,arg));
+    }
+
+
     private static void assertObj(Object obj, String name, Object... fields) {
         assertEquals(Evaluator.Obj.class, obj.getClass());
         var o = (Evaluator.Obj)obj;
@@ -31,7 +51,7 @@ int i=v.f;
 if (arg) v.f=1;
 return i;
 """);
-        code.parse();//.opto();
+        code.parse();//.iter();
         var eval = new Evaluator(code._stop);
         assertEquals(2L, eval.evaluate(1, 10));
     }
@@ -46,7 +66,7 @@ struct S {
 if(arg) v0.f=1;
 return v0;
 """);
-        code.parse().opto();
+        code.parse().iter();
         var eval = new Evaluator(code._stop);
         assertObj(eval.evaluate(0, 10), "S", 0L);
         assertObj(eval.evaluate(1, 10), "S", 1L);
@@ -65,7 +85,7 @@ i=v.f;
 if (arg) v.f=1;
 return i;
 """);
-        code.parse().opto();
+        code.parse().iter();
         var eval = new Evaluator(code._stop);
         assertEquals(2L, eval.evaluate(0, 10));
         assertEquals(2L, eval.evaluate(1, 10));
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/codegen/FlagSpillTestSupport.java b/chapter20/src/test/java/com/seaofnodes/simple/codegen/FlagSpillTestSupport.java
new file mode 100644
index 00000000..f5bd9510
--- /dev/null
+++ b/chapter20/src/test/java/com/seaofnodes/simple/codegen/FlagSpillTestSupport.java
@@ -0,0 +1,57 @@
+package com.seaofnodes.simple.codegen;
+
+import com.seaofnodes.simple.node.*;
+import com.seaofnodes.simple.node.cpus.arm.arm;
+import com.seaofnodes.simple.node.cpus.x86_64_v2.x86_64_v2;
+import com.seaofnodes.simple.type.TypeInteger;
+import static org.junit.Assert.*;
+
+// Force overlapping flags, then force every GPR unavailable across the gap.
+public class FlagSpillTestSupport {
+    private static class Op extends MachConcreteNode {
+        final RegMask _def, _use, _kill;
+        Op(RegMask def,RegMask use,RegMask kill,Node... ins) {
+            super(ins); _def=def; _use=use; _kill=kill; _type=TypeInteger.BOT;
+        }
+        @Override public String op() { return "flagsProbe"; }
+        @Override public RegMask outregmap() { return _def; }
+        @Override public RegMask regmap(int i) { return _use; }
+        @Override public RegMask killmap() { return _kill; }
+        @Override public int encoding(java.io.ByteArrayOutputStream enc) { throw new AssertionError(); }
+    }
+
+    public static void run() throws Exception {
+        for( boolean isArm : new boolean[]{false,true} )
+            for( boolean stack : new boolean[]{false,true} ) {
+                CodeGen code = new CodeGen("");
+                code._callingConv="SystemV";
+                code._mach=isArm ? new arm() : new x86_64_v2();
+                RegionNode block = new RegionNode(null,code._start,code._start);
+                code._cfg.add(block);
+                int flagsReg=isArm ? 64 : 32, firstStack=flagsReg+1;
+                RegMask flags = new RegMask(flagsReg);
+                Op def = new Op(flags,null,null,block);
+                RegMask killMask = stack ? (isArm ? new RegMask(0x7fffffffL,1L) : new RegMask(0x1ffffffefL)) : flags;
+                Op kill = new Op(null,null,killMask,block);
+                new Op(null,flags,null,block,def);
+                RegAlloc alloc = new RegAlloc(code);
+                alloc.regAlloc();
+
+                int splits=0, slots=0;
+                for( Node n : block._outputs ) if( n instanceof SplitNode split ) {
+                    int dst=alloc.regnum(n), src=alloc.regnum(n.in(1));
+                    assertTrue(split.outregmap().test(dst));
+                    assertTrue(split.regmap(1).test(src));
+                    for( int fp=isArm ? 32 : 16; fp<flagsReg; fp++ ) {
+                        assertFalse("FP output allowed",split.outregmap().test(fp));
+                        assertFalse("FP input allowed",split.regmap(1).test(fp));
+                    }
+                    if( dst>=firstStack || src>=firstStack ) slots++;
+                    splits++;
+                }
+                assertTrue(splits>=2);
+                assertEquals(stack,slots!=0);
+
+            }
+    }
+}
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/codegen/RegAllocTestSupport.java b/chapter20/src/test/java/com/seaofnodes/simple/codegen/RegAllocTestSupport.java
index 2966cb00..75f8f1fd 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/codegen/RegAllocTestSupport.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/codegen/RegAllocTestSupport.java
@@ -23,6 +23,11 @@ public class RegAllocTestSupport {
         @Override public Node copy() { return new Op(_def,_use,_kill,_clone,(Node)null); }
         @Override public int encoding(ByteArrayOutputStream bytes) { throw new AssertionError(); }
     }
+    private static SplitNode testSplit(CodeGen code, MachNode def) {
+        LRG lrg = new LRG((short)0);
+        lrg._machDef = def;
+        return code._mach.split("test",(byte)0,lrg);
+    }
     private static CodeGen graph() {
         CodeGen code = new CodeGen("");
         code._mach = new x86_64_v2();
@@ -169,11 +174,11 @@ public class RegAllocTestSupport {
             RegAlloc alloc = new RegAlloc(code);
             Op def = new Op(A,null,null,false,code._start);
             alloc.newLRG(def)._reg=0;
-            SplitNode hi = code._mach.split("test",(byte)0,null);
+            SplitNode hi = testSplit(code,def);
             hi.setDef(0,code._start); hi.setDef(1,def);
             alloc.newLRG(hi)._reg=1;
             new Op(null,null,killed ? A : null,false,code._start);
-            SplitNode lo = code._mach.split("test",(byte)0,null);
+            SplitNode lo = testSplit(code,hi);
             lo.setDef(0,code._start); lo.setDef(1,hi);
             alloc.newLRG(lo)._reg=0;
             Op use = new Op(null,A,null,false,code._start,lo);
@@ -187,7 +192,7 @@ public class RegAllocTestSupport {
         uncolored.newLRG(def0)._mask=A;
         Op fixed = new Op(A,null,null,false,pre._start);
         uncolored.newLRG(fixed)._mask=A;
-        SplitNode copy = pre._mach.split("test",(byte)0,null);
+        SplitNode copy = testSplit(pre,def0);
         copy.setDef(0,pre._start); copy.setDef(1,def0);
         assertFalse("A fixed definition clobbers even before coloring",uncolored.sameBlockNoClobber(copy));
     }
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/fuzzer/Fuzzer.java b/chapter20/src/test/java/com/seaofnodes/simple/fuzzer/Fuzzer.java
index 586924b2..7e8bdbf1 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/fuzzer/Fuzzer.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/fuzzer/Fuzzer.java
@@ -133,7 +133,7 @@ public class Fuzzer {
             double parse_nop_ratio = (double)parse_nops/parse_peeps;
             double parse_peeps_per_node = (double)parse_peeps/nids;
 
-            code.opto();
+            code.iter();
             int iter_peeps= code._iter_cnt;
             int iter_nops = code._iter_nop_cnt;
             double iter_nop_ratio = (double)iter_nops/iter_peeps;
diff --git a/chapter20/src/test/java/com/seaofnodes/simple/fuzzer/FuzzerUtils.java b/chapter20/src/test/java/com/seaofnodes/simple/fuzzer/FuzzerUtils.java
index a2137314..b2be5b5f 100644
--- a/chapter20/src/test/java/com/seaofnodes/simple/fuzzer/FuzzerUtils.java
+++ b/chapter20/src/test/java/com/seaofnodes/simple/fuzzer/FuzzerUtils.java
@@ -101,7 +101,7 @@ class FuzzerUtils {
             System.setErr(NULL_PRINT_STREAM);
             System.setOut(NULL_PRINT_STREAM);
             var code = new CodeGen(script, TypeInteger.BOT, workListSeed);
-            return code.parse().opto().typeCheck().GCM().localSched();
+            return code.driver(CodeGen.Phase.LocalSched);
         } finally {
             System.setErr(err);
             System.setOut(out);