diff --git a/src/dk/camelot64/kickc/Compiler.java b/src/dk/camelot64/kickc/Compiler.java
index 744cc0008..5e994cdc2 100644
--- a/src/dk/camelot64/kickc/Compiler.java
+++ b/src/dk/camelot64/kickc/Compiler.java
@@ -114,7 +114,7 @@ public class Compiler {
          for (Pass2SsaOptimization optimization : optimizations) {
             boolean stepOptimized = optimization.optimize();
             if (stepOptimized) {
-               log.append("Succesful SSA optimization "+optimization+"");
+               log.append("Succesful SSA optimization "+optimization.getClass().getSimpleName()+"");
                ssaOptimized = true;
                log.append("CONTROL FLOW GRAPH");
                log.append(controlFlowGraph.toString());
@@ -141,7 +141,7 @@ public class Compiler {
          for (Pass4AsmOptimization optimization : pass4Optimizations) {
             boolean stepOtimized = optimization.optimize();
             if(stepOtimized) {
-               log.append("Succesful ASM optimization "+optimization);
+               log.append("Succesful ASM optimization "+optimization.getClass().getSimpleName());
                asmOptimized = true;
                log.append("ASSEMBLER");
                log.append(asmProgram.toString());
diff --git a/src/dk/camelot64/kickc/icl/Scope.java b/src/dk/camelot64/kickc/icl/Scope.java
index d3dbb9d81..c0b3ab533 100644
--- a/src/dk/camelot64/kickc/icl/Scope.java
+++ b/src/dk/camelot64/kickc/icl/Scope.java
@@ -108,7 +108,8 @@ public class Scope implements Symbol {
          if (scopeSym instanceof Scope) {
             return ((Scope) scopeSym).getSymbol(rest);
          } else {
-            throw new RuntimeException("Error looking up symbol " + name);
+            return null;
+            //throw new RuntimeException("Error looking up symbol " + name);
          }
       } else {
          Symbol symbol = symbols.get(name);
diff --git a/src/dk/camelot64/kickc/test/TestCompilationOutput.java b/src/dk/camelot64/kickc/test/TestCompilationOutput.java
index f1bfd4349..e164bed60 100644
--- a/src/dk/camelot64/kickc/test/TestCompilationOutput.java
+++ b/src/dk/camelot64/kickc/test/TestCompilationOutput.java
@@ -1,7 +1,5 @@
 package dk.camelot64.kickc.test;
 
-import com.sun.org.apache.xpath.internal.SourceTree;
-import com.sun.xml.internal.ws.policy.privateutil.PolicyUtils;
 import dk.camelot64.kickc.Compiler;
 import org.antlr.v4.runtime.CharStream;
 import org.antlr.v4.runtime.CharStreams;
@@ -33,6 +31,7 @@ public class TestCompilationOutput {
    public static void main(String[] args) throws IOException, URISyntaxException {
       TestCompilationOutput tester = new TestCompilationOutput();
       tester.testFile("flipper-rex2");
+      tester.testFile("bresenham");
    }
 
    private void testFile(String fileName) throws IOException, URISyntaxException {
diff --git a/src/dk/camelot64/kickc/test/ref/bresenham.asm b/src/dk/camelot64/kickc/test/ref/bresenham.asm
new file mode 100644
index 000000000..7ca8f8117
--- /dev/null
+++ b/src/dk/camelot64/kickc/test/ref/bresenham.asm
@@ -0,0 +1,109 @@
+BBEGIN:
+B1_from_BBEGIN:
+  // (byte) y#2 = (byte) 0  // zpby1=coby1
+  lda #0
+  sta 14
+  // (byte) e#3 = (byte) 12  // zpby1=coby1
+  lda #12
+  sta 13
+  // (byte) x#2 = (byte) 0  // zpby1=coby1
+  lda #0
+  sta 12
+  // (byte*) cursor#3 = (word) 1024  // zpptrby1=cowo1
+  lda #<1024
+  sta 10
+  lda #>1024
+  sta 10+1
+  jmp B1
+B1_from_B3:
+  // (byte) y#2 = (byte) y#5  // zpby1=zpby2
+  lda 18
+  sta 14
+  // (byte) e#3 = (byte) e#5  // zpby1=zpby2
+  lda 15
+  sta 13
+  // (byte) x#2 = (byte) x#1  // zpby1=zpby2
+  lda 2
+  sta 12
+  // (byte*) cursor#3 = (byte*) cursor#5  // zpptrby1=zpptrby2
+  lda 16
+  sta 10
+  lda 16+1
+  sta 10+1
+B1:
+  // *((byte*) cursor#3) ← (byte) 81  //  zpiby1=coby1
+  ldy #0
+  lda #81
+  sta (10),y
+  // (byte) x#1 ← (byte) x#2 + (byte) 1  //  zpby1=zpby2_plus_1
+  lda 12
+  clc
+  adc #1
+  sta 2
+  // (byte*) cursor#1 ← (byte*) cursor#3 + (byte) 1  //  zpptrby1=zpptrby2_plus_1
+  lda 10
+  clc
+  adc #1
+  sta 3
+  lda 10+1
+  adc #0
+  sta 3+1
+  // (byte) e#1 ← (byte) e#3 + (byte) 24  //  zpby1=zpby2_plus_coby1
+  lda 13
+  clc
+  adc #24
+  sta 5
+  // if((byte) 39<(byte) e#1) goto @2  //  coby1_lt_zpby1_then_la1
+  lda #39
+  cmp 5
+  bcc B2
+B3_from_B1:
+  // (byte) y#5 = (byte) y#2  // zpby1=zpby2
+  lda 14
+  sta 18
+  // (byte*) cursor#5 = (byte*) cursor#1  // zpptrby1=zpptrby2
+  lda 3
+  sta 16
+  lda 3+1
+  sta 16+1
+  // (byte) e#5 = (byte) e#1  // zpby1=zpby2
+  lda 5
+  sta 15
+B3:
+  // if((byte) x#1<(byte) 40) goto @1  //  zpby1_lt_coby1_then_la1
+  lda 2
+  cmp #40
+  bcc B1_from_B3
+BEND:
+B2:
+  // (byte) y#1 ← (byte) y#2 + (byte) 1  //  zpby1=zpby2_plus_1
+  lda 14
+  clc
+  adc #1
+  sta 6
+  // (byte*) cursor#2 ← (byte*) cursor#1 + (byte) 40  //  zpptrby1=zpptrby2_plus_coby1
+  lda #40
+  clc
+  adc 3
+  sta 7
+  lda #0
+  adc 3+1
+  sta 7+1
+  // (byte) e#2 ← (byte) e#1 - (byte) 39  //  zpby1=zpby2_minus_coby1
+  lda 5
+  sec
+  sbc #39
+  sta 9
+B3_from_B2:
+  // (byte) y#5 = (byte) y#1  // zpby1=zpby2
+  lda 6
+  sta 18
+  // (byte*) cursor#5 = (byte*) cursor#2  // zpptrby1=zpptrby2
+  lda 7
+  sta 16
+  lda 7+1
+  sta 16+1
+  // (byte) e#5 = (byte) e#2  // zpby1=zpby2
+  lda 9
+  sta 15
+  jmp B3
diff --git a/src/dk/camelot64/kickc/test/ref/bresenham.cfg b/src/dk/camelot64/kickc/test/ref/bresenham.cfg
new file mode 100644
index 000000000..250b37365
--- /dev/null
+++ b/src/dk/camelot64/kickc/test/ref/bresenham.cfg
@@ -0,0 +1,25 @@
+@BEGIN: from
+  to:@1
+@1: from @3 @BEGIN
+  (byte) y#2 ← phi( @3/(byte) y#5 @BEGIN/(byte) 0 )
+  (byte) e#3 ← phi( @3/(byte) e#5 @BEGIN/(byte) 12 )
+  (byte) x#2 ← phi( @3/(byte) x#1 @BEGIN/(byte) 0 )
+  (byte*) cursor#3 ← phi( @3/(byte*) cursor#5 @BEGIN/(word) 1024 )
+  *((byte*) cursor#3) ← (byte) 81
+  (byte) x#1 ← (byte) x#2 + (byte) 1
+  (byte*) cursor#1 ← (byte*) cursor#3 + (byte) 1
+  (byte) e#1 ← (byte) e#3 + (byte) 24
+  if((byte) 39<(byte) e#1) goto @2
+  to:@3
+@2: from @1
+  (byte) y#1 ← (byte) y#2 + (byte) 1
+  (byte*) cursor#2 ← (byte*) cursor#1 + (byte) 40
+  (byte) e#2 ← (byte) e#1 - (byte) 39
+  to:@3
+@3: from @1 @2
+  (byte) y#5 ← phi( @2/(byte) y#1 @1/(byte) y#2 )
+  (byte*) cursor#5 ← phi( @2/(byte*) cursor#2 @1/(byte*) cursor#1 )
+  (byte) e#5 ← phi( @2/(byte) e#2 @1/(byte) e#1 )
+  if((byte) x#1<(byte) 40) goto @1
+  to:@END
+@END: from @3
diff --git a/src/dk/camelot64/kickc/test/ref/bresenham.log b/src/dk/camelot64/kickc/test/ref/bresenham.log
new file mode 100644
index 000000000..308007c0b
--- /dev/null
+++ b/src/dk/camelot64/kickc/test/ref/bresenham.log
@@ -0,0 +1,1385 @@
+byte STAR = 81;
+byte[40*25] SCREEN = $0400;
+byte x0 = 0;
+byte y0 = 0;
+byte x1 = 39;
+byte y1 = 24;
+byte xd = x1-x0;
+byte yd = y1-y0;
+byte x = x0;
+byte y = y0;
+byte e = yd/2;
+byte *cursor = SCREEN+y*40+x;
+do  {
+    *cursor = STAR;
+    x = x + 1;
+    cursor = cursor + 1;
+    e = e+yd;
+    if(xd<e) {
+        y = y+1;
+        cursor = cursor + 40;
+        e = e - xd;
+    }
+}  while (x<(x1+1))
+
+PROGRAM
+  (byte) STAR ← (byte) 81
+  (byte[1000]) SCREEN ← (word) 1024
+  (byte) x0 ← (byte) 0
+  (byte) y0 ← (byte) 0
+  (byte) x1 ← (byte) 39
+  (byte) y1 ← (byte) 24
+  (byte~) $0 ← (byte) x1 - (byte) x0
+  (byte) xd ← (byte~) $0
+  (byte~) $1 ← (byte) y1 - (byte) y0
+  (byte) yd ← (byte~) $1
+  (byte) x ← (byte) x0
+  (byte) y ← (byte) y0
+  (byte~) $2 ← (byte) yd / (byte) 2
+  (byte) e ← (byte~) $2
+  (byte~) $3 ← (byte) y * (byte) 40
+  (byte*~) $4 ← (byte[1000]) SCREEN + (byte~) $3
+  (byte*~) $5 ← (byte*~) $4 + (byte) x
+  (byte*) cursor ← (byte*~) $5
+@1:
+  *((byte*) cursor) ← (byte) STAR
+  (byte~) $6 ← (byte) x + (byte) 1
+  (byte) x ← (byte~) $6
+  (byte*~) $7 ← (byte*) cursor + (byte) 1
+  (byte*) cursor ← (byte*~) $7
+  (byte~) $8 ← (byte) e + (byte) yd
+  (byte) e ← (byte~) $8
+  (boolean~) $9 ← (byte) xd < (byte) e
+  if((boolean~) $9) goto @2
+  goto @3
+@2:
+  (byte~) $10 ← (byte) y + (byte) 1
+  (byte) y ← (byte~) $10
+  (byte*~) $11 ← (byte*) cursor + (byte) 40
+  (byte*) cursor ← (byte*~) $11
+  (byte~) $12 ← (byte) e - (byte) xd
+  (byte) e ← (byte~) $12
+@3:
+  (byte~) $13 ← (byte) x1 + (byte) 1
+  (boolean~) $14 ← (byte) x < (byte~) $13
+  if((boolean~) $14) goto @1
+
+SYMBOLS
+(byte~) $0
+(byte~) $1
+(byte~) $10
+(byte*~) $11
+(byte~) $12
+(byte~) $13
+(boolean~) $14
+(byte~) $2
+(byte~) $3
+(byte*~) $4
+(byte*~) $5
+(byte~) $6
+(byte*~) $7
+(byte~) $8
+(boolean~) $9
+(label) @1
+(label) @2
+(label) @3
+(byte[1000]) SCREEN
+(byte) STAR
+(byte*) cursor
+(byte) e
+(byte) x
+(byte) x0
+(byte) x1
+(byte) xd
+(byte) y
+(byte) y0
+(byte) y1
+(byte) yd
+
+INITIAL CONTROL FLOW GRAPH
+@BEGIN: from
+  (byte) STAR ← (byte) 81
+  (byte[1000]) SCREEN ← (word) 1024
+  (byte) x0 ← (byte) 0
+  (byte) y0 ← (byte) 0
+  (byte) x1 ← (byte) 39
+  (byte) y1 ← (byte) 24
+  (byte~) $0 ← (byte) x1 - (byte) x0
+  (byte) xd ← (byte~) $0
+  (byte~) $1 ← (byte) y1 - (byte) y0
+  (byte) yd ← (byte~) $1
+  (byte) x ← (byte) x0
+  (byte) y ← (byte) y0
+  (byte~) $2 ← (byte) yd / (byte) 2
+  (byte) e ← (byte~) $2
+  (byte~) $3 ← (byte) y * (byte) 40
+  (byte*~) $4 ← (byte[1000]) SCREEN + (byte~) $3
+  (byte*~) $5 ← (byte*~) $4 + (byte) x
+  (byte*) cursor ← (byte*~) $5
+  to:@1
+@1: from @3 @BEGIN
+  *((byte*) cursor) ← (byte) STAR
+  (byte~) $6 ← (byte) x + (byte) 1
+  (byte) x ← (byte~) $6
+  (byte*~) $7 ← (byte*) cursor + (byte) 1
+  (byte*) cursor ← (byte*~) $7
+  (byte~) $8 ← (byte) e + (byte) yd
+  (byte) e ← (byte~) $8
+  (boolean~) $9 ← (byte) xd < (byte) e
+  if((boolean~) $9) goto @2
+  to:@4
+@2: from @1 @5
+  (byte~) $10 ← (byte) y + (byte) 1
+  (byte) y ← (byte~) $10
+  (byte*~) $11 ← (byte*) cursor + (byte) 40
+  (byte*) cursor ← (byte*~) $11
+  (byte~) $12 ← (byte) e - (byte) xd
+  (byte) e ← (byte~) $12
+  to:@3
+@4: from @1
+  to:@3
+@3: from @2 @4
+  (byte~) $13 ← (byte) x1 + (byte) 1
+  (boolean~) $14 ← (byte) x < (byte~) $13
+  if((boolean~) $14) goto @1
+  to:@6
+@5: from
+  to:@2
+@6: from @3
+  to:@END
+@END: from @6
+
+CONTROL FLOW GRAPH WITH ASSIGNMENT CALL
+@BEGIN: from
+  (byte) STAR ← (byte) 81
+  (byte[1000]) SCREEN ← (word) 1024
+  (byte) x0 ← (byte) 0
+  (byte) y0 ← (byte) 0
+  (byte) x1 ← (byte) 39
+  (byte) y1 ← (byte) 24
+  (byte~) $0 ← (byte) x1 - (byte) x0
+  (byte) xd ← (byte~) $0
+  (byte~) $1 ← (byte) y1 - (byte) y0
+  (byte) yd ← (byte~) $1
+  (byte) x ← (byte) x0
+  (byte) y ← (byte) y0
+  (byte~) $2 ← (byte) yd / (byte) 2
+  (byte) e ← (byte~) $2
+  (byte~) $3 ← (byte) y * (byte) 40
+  (byte*~) $4 ← (byte[1000]) SCREEN + (byte~) $3
+  (byte*~) $5 ← (byte*~) $4 + (byte) x
+  (byte*) cursor ← (byte*~) $5
+  to:@1
+@1: from @3 @BEGIN
+  *((byte*) cursor) ← (byte) STAR
+  (byte~) $6 ← (byte) x + (byte) 1
+  (byte) x ← (byte~) $6
+  (byte*~) $7 ← (byte*) cursor + (byte) 1
+  (byte*) cursor ← (byte*~) $7
+  (byte~) $8 ← (byte) e + (byte) yd
+  (byte) e ← (byte~) $8
+  (boolean~) $9 ← (byte) xd < (byte) e
+  if((boolean~) $9) goto @2
+  to:@4
+@2: from @1 @5
+  (byte~) $10 ← (byte) y + (byte) 1
+  (byte) y ← (byte~) $10
+  (byte*~) $11 ← (byte*) cursor + (byte) 40
+  (byte*) cursor ← (byte*~) $11
+  (byte~) $12 ← (byte) e - (byte) xd
+  (byte) e ← (byte~) $12
+  to:@3
+@4: from @1
+  to:@3
+@3: from @2 @4
+  (byte~) $13 ← (byte) x1 + (byte) 1
+  (boolean~) $14 ← (byte) x < (byte~) $13
+  if((boolean~) $14) goto @1
+  to:@6
+@5: from
+  to:@2
+@6: from @3
+  to:@END
+@END: from @6
+
+Completing Phi functions...
+Completing Phi functions...
+Completing Phi functions...
+Completing Phi functions...
+CONTROL FLOW GRAPH SSA
+@BEGIN: from
+  (byte) STAR#0 ← (byte) 81
+  (byte[1000]) SCREEN#0 ← (word) 1024
+  (byte) x0#0 ← (byte) 0
+  (byte) y0#0 ← (byte) 0
+  (byte) x1#0 ← (byte) 39
+  (byte) y1#0 ← (byte) 24
+  (byte~) $0 ← (byte) x1#0 - (byte) x0#0
+  (byte) xd#0 ← (byte~) $0
+  (byte~) $1 ← (byte) y1#0 - (byte) y0#0
+  (byte) yd#0 ← (byte~) $1
+  (byte) x#0 ← (byte) x0#0
+  (byte) y#0 ← (byte) y0#0
+  (byte~) $2 ← (byte) yd#0 / (byte) 2
+  (byte) e#0 ← (byte~) $2
+  (byte~) $3 ← (byte) y#0 * (byte) 40
+  (byte*~) $4 ← (byte[1000]) SCREEN#0 + (byte~) $3
+  (byte*~) $5 ← (byte*~) $4 + (byte) x#0
+  (byte*) cursor#0 ← (byte*~) $5
+  to:@1
+@1: from @3 @BEGIN
+  (byte) x1#4 ← phi( @3/(byte) x1#1 @BEGIN/(byte) x1#0 )
+  (byte) y#3 ← phi( @3/(byte) y#5 @BEGIN/(byte) y#0 )
+  (byte) xd#1 ← phi( @3/(byte) xd#3 @BEGIN/(byte) xd#0 )
+  (byte) yd#1 ← phi( @3/(byte) yd#2 @BEGIN/(byte) yd#0 )
+  (byte) e#3 ← phi( @3/(byte) e#5 @BEGIN/(byte) e#0 )
+  (byte) x#2 ← phi( @3/(byte) x#3 @BEGIN/(byte) x#0 )
+  (byte*) cursor#3 ← phi( @3/(byte*) cursor#5 @BEGIN/(byte*) cursor#0 )
+  (byte) STAR#1 ← phi( @3/(byte) STAR#2 @BEGIN/(byte) STAR#0 )
+  *((byte*) cursor#3) ← (byte) STAR#1
+  (byte~) $6 ← (byte) x#2 + (byte) 1
+  (byte) x#1 ← (byte~) $6
+  (byte*~) $7 ← (byte*) cursor#3 + (byte) 1
+  (byte*) cursor#1 ← (byte*~) $7
+  (byte~) $8 ← (byte) e#3 + (byte) yd#1
+  (byte) e#1 ← (byte~) $8
+  (boolean~) $9 ← (byte) xd#1 < (byte) e#1
+  if((boolean~) $9) goto @2
+  to:@4
+@2: from @1 @5
+  (byte) yd#3 ← phi( @1/(byte) yd#1 @5/(byte) yd#5 )
+  (byte) STAR#3 ← phi( @1/(byte) STAR#1 @5/(byte) STAR#5 )
+  (byte) x1#2 ← phi( @1/(byte) x1#4 @5/(byte) x1#5 )
+  (byte) x#4 ← phi( @1/(byte) x#1 @5/(byte) x#6 )
+  (byte) xd#2 ← phi( @1/(byte) xd#1 @5/(byte) xd#4 )
+  (byte) e#4 ← phi( @1/(byte) e#1 @5/(byte) e#6 )
+  (byte*) cursor#4 ← phi( @1/(byte*) cursor#1 @5/(byte*) cursor#6 )
+  (byte) y#2 ← phi( @1/(byte) y#3 @5/(byte) y#4 )
+  (byte~) $10 ← (byte) y#2 + (byte) 1
+  (byte) y#1 ← (byte~) $10
+  (byte*~) $11 ← (byte*) cursor#4 + (byte) 40
+  (byte*) cursor#2 ← (byte*~) $11
+  (byte~) $12 ← (byte) e#4 - (byte) xd#2
+  (byte) e#2 ← (byte~) $12
+  to:@3
+@4: from @1
+  (byte) y#6 ← phi( @1/(byte) y#3 )
+  (byte) xd#5 ← phi( @1/(byte) xd#1 )
+  (byte) yd#4 ← phi( @1/(byte) yd#1 )
+  (byte) e#7 ← phi( @1/(byte) e#1 )
+  (byte*) cursor#7 ← phi( @1/(byte*) cursor#1 )
+  (byte) STAR#4 ← phi( @1/(byte) STAR#1 )
+  (byte) x1#3 ← phi( @1/(byte) x1#4 )
+  (byte) x#5 ← phi( @1/(byte) x#1 )
+  to:@3
+@3: from @2 @4
+  (byte) y#5 ← phi( @2/(byte) y#1 @4/(byte) y#6 )
+  (byte) STAR#2 ← phi( @2/(byte) STAR#3 @4/(byte) STAR#4 )
+  (byte*) cursor#5 ← phi( @2/(byte*) cursor#2 @4/(byte*) cursor#7 )
+  (byte) e#5 ← phi( @2/(byte) e#2 @4/(byte) e#7 )
+  (byte) yd#2 ← phi( @2/(byte) yd#3 @4/(byte) yd#4 )
+  (byte) xd#3 ← phi( @2/(byte) xd#2 @4/(byte) xd#5 )
+  (byte) x#3 ← phi( @2/(byte) x#4 @4/(byte) x#5 )
+  (byte) x1#1 ← phi( @2/(byte) x1#2 @4/(byte) x1#3 )
+  (byte~) $13 ← (byte) x1#1 + (byte) 1
+  (boolean~) $14 ← (byte) x#3 < (byte~) $13
+  if((boolean~) $14) goto @1
+  to:@6
+@5: from
+  (byte) STAR#5 ← phi( )
+  (byte) yd#5 ← phi( )
+  (byte) x#6 ← phi( )
+  (byte) x1#5 ← phi( )
+  (byte) y#4 ← phi( )
+  (byte*) cursor#6 ← phi( )
+  (byte) e#6 ← phi( )
+  (byte) xd#4 ← phi( )
+  to:@2
+@6: from @3
+  to:@END
+@END: from @6
+
+CONTROL FLOW GRAPH WITH ASSIGNMENT CALL & RETURN
+@BEGIN: from
+  (byte) STAR#0 ← (byte) 81
+  (byte[1000]) SCREEN#0 ← (word) 1024
+  (byte) x0#0 ← (byte) 0
+  (byte) y0#0 ← (byte) 0
+  (byte) x1#0 ← (byte) 39
+  (byte) y1#0 ← (byte) 24
+  (byte~) $0 ← (byte) x1#0 - (byte) x0#0
+  (byte) xd#0 ← (byte~) $0
+  (byte~) $1 ← (byte) y1#0 - (byte) y0#0
+  (byte) yd#0 ← (byte~) $1
+  (byte) x#0 ← (byte) x0#0
+  (byte) y#0 ← (byte) y0#0
+  (byte~) $2 ← (byte) yd#0 / (byte) 2
+  (byte) e#0 ← (byte~) $2
+  (byte~) $3 ← (byte) y#0 * (byte) 40
+  (byte*~) $4 ← (byte[1000]) SCREEN#0 + (byte~) $3
+  (byte*~) $5 ← (byte*~) $4 + (byte) x#0
+  (byte*) cursor#0 ← (byte*~) $5
+  to:@1
+@1: from @3 @BEGIN
+  (byte) x1#4 ← phi( @3/(byte) x1#1 @BEGIN/(byte) x1#0 )
+  (byte) y#3 ← phi( @3/(byte) y#5 @BEGIN/(byte) y#0 )
+  (byte) xd#1 ← phi( @3/(byte) xd#3 @BEGIN/(byte) xd#0 )
+  (byte) yd#1 ← phi( @3/(byte) yd#2 @BEGIN/(byte) yd#0 )
+  (byte) e#3 ← phi( @3/(byte) e#5 @BEGIN/(byte) e#0 )
+  (byte) x#2 ← phi( @3/(byte) x#3 @BEGIN/(byte) x#0 )
+  (byte*) cursor#3 ← phi( @3/(byte*) cursor#5 @BEGIN/(byte*) cursor#0 )
+  (byte) STAR#1 ← phi( @3/(byte) STAR#2 @BEGIN/(byte) STAR#0 )
+  *((byte*) cursor#3) ← (byte) STAR#1
+  (byte~) $6 ← (byte) x#2 + (byte) 1
+  (byte) x#1 ← (byte~) $6
+  (byte*~) $7 ← (byte*) cursor#3 + (byte) 1
+  (byte*) cursor#1 ← (byte*~) $7
+  (byte~) $8 ← (byte) e#3 + (byte) yd#1
+  (byte) e#1 ← (byte~) $8
+  (boolean~) $9 ← (byte) xd#1 < (byte) e#1
+  if((boolean~) $9) goto @2
+  to:@4
+@2: from @1 @5
+  (byte) yd#3 ← phi( @1/(byte) yd#1 @5/(byte) yd#5 )
+  (byte) STAR#3 ← phi( @1/(byte) STAR#1 @5/(byte) STAR#5 )
+  (byte) x1#2 ← phi( @1/(byte) x1#4 @5/(byte) x1#5 )
+  (byte) x#4 ← phi( @1/(byte) x#1 @5/(byte) x#6 )
+  (byte) xd#2 ← phi( @1/(byte) xd#1 @5/(byte) xd#4 )
+  (byte) e#4 ← phi( @1/(byte) e#1 @5/(byte) e#6 )
+  (byte*) cursor#4 ← phi( @1/(byte*) cursor#1 @5/(byte*) cursor#6 )
+  (byte) y#2 ← phi( @1/(byte) y#3 @5/(byte) y#4 )
+  (byte~) $10 ← (byte) y#2 + (byte) 1
+  (byte) y#1 ← (byte~) $10
+  (byte*~) $11 ← (byte*) cursor#4 + (byte) 40
+  (byte*) cursor#2 ← (byte*~) $11
+  (byte~) $12 ← (byte) e#4 - (byte) xd#2
+  (byte) e#2 ← (byte~) $12
+  to:@3
+@4: from @1
+  (byte) y#6 ← phi( @1/(byte) y#3 )
+  (byte) xd#5 ← phi( @1/(byte) xd#1 )
+  (byte) yd#4 ← phi( @1/(byte) yd#1 )
+  (byte) e#7 ← phi( @1/(byte) e#1 )
+  (byte*) cursor#7 ← phi( @1/(byte*) cursor#1 )
+  (byte) STAR#4 ← phi( @1/(byte) STAR#1 )
+  (byte) x1#3 ← phi( @1/(byte) x1#4 )
+  (byte) x#5 ← phi( @1/(byte) x#1 )
+  to:@3
+@3: from @2 @4
+  (byte) y#5 ← phi( @2/(byte) y#1 @4/(byte) y#6 )
+  (byte) STAR#2 ← phi( @2/(byte) STAR#3 @4/(byte) STAR#4 )
+  (byte*) cursor#5 ← phi( @2/(byte*) cursor#2 @4/(byte*) cursor#7 )
+  (byte) e#5 ← phi( @2/(byte) e#2 @4/(byte) e#7 )
+  (byte) yd#2 ← phi( @2/(byte) yd#3 @4/(byte) yd#4 )
+  (byte) xd#3 ← phi( @2/(byte) xd#2 @4/(byte) xd#5 )
+  (byte) x#3 ← phi( @2/(byte) x#4 @4/(byte) x#5 )
+  (byte) x1#1 ← phi( @2/(byte) x1#2 @4/(byte) x1#3 )
+  (byte~) $13 ← (byte) x1#1 + (byte) 1
+  (boolean~) $14 ← (byte) x#3 < (byte~) $13
+  if((boolean~) $14) goto @1
+  to:@6
+@5: from
+  (byte) STAR#5 ← phi( )
+  (byte) yd#5 ← phi( )
+  (byte) x#6 ← phi( )
+  (byte) x1#5 ← phi( )
+  (byte) y#4 ← phi( )
+  (byte*) cursor#6 ← phi( )
+  (byte) e#6 ← phi( )
+  (byte) xd#4 ← phi( )
+  to:@2
+@6: from @3
+  to:@END
+@END: from @6
+
+Culled Empty Block (label) @6
+Succesful SSA optimization Pass2CullEmptyBlocks
+CONTROL FLOW GRAPH
+@BEGIN: from
+  (byte) STAR#0 ← (byte) 81
+  (byte[1000]) SCREEN#0 ← (word) 1024
+  (byte) x0#0 ← (byte) 0
+  (byte) y0#0 ← (byte) 0
+  (byte) x1#0 ← (byte) 39
+  (byte) y1#0 ← (byte) 24
+  (byte~) $0 ← (byte) x1#0 - (byte) x0#0
+  (byte) xd#0 ← (byte~) $0
+  (byte~) $1 ← (byte) y1#0 - (byte) y0#0
+  (byte) yd#0 ← (byte~) $1
+  (byte) x#0 ← (byte) x0#0
+  (byte) y#0 ← (byte) y0#0
+  (byte~) $2 ← (byte) yd#0 / (byte) 2
+  (byte) e#0 ← (byte~) $2
+  (byte~) $3 ← (byte) y#0 * (byte) 40
+  (byte*~) $4 ← (byte[1000]) SCREEN#0 + (byte~) $3
+  (byte*~) $5 ← (byte*~) $4 + (byte) x#0
+  (byte*) cursor#0 ← (byte*~) $5
+  to:@1
+@1: from @3 @BEGIN
+  (byte) x1#4 ← phi( @3/(byte) x1#1 @BEGIN/(byte) x1#0 )
+  (byte) y#3 ← phi( @3/(byte) y#5 @BEGIN/(byte) y#0 )
+  (byte) xd#1 ← phi( @3/(byte) xd#3 @BEGIN/(byte) xd#0 )
+  (byte) yd#1 ← phi( @3/(byte) yd#2 @BEGIN/(byte) yd#0 )
+  (byte) e#3 ← phi( @3/(byte) e#5 @BEGIN/(byte) e#0 )
+  (byte) x#2 ← phi( @3/(byte) x#3 @BEGIN/(byte) x#0 )
+  (byte*) cursor#3 ← phi( @3/(byte*) cursor#5 @BEGIN/(byte*) cursor#0 )
+  (byte) STAR#1 ← phi( @3/(byte) STAR#2 @BEGIN/(byte) STAR#0 )
+  *((byte*) cursor#3) ← (byte) STAR#1
+  (byte~) $6 ← (byte) x#2 + (byte) 1
+  (byte) x#1 ← (byte~) $6
+  (byte*~) $7 ← (byte*) cursor#3 + (byte) 1
+  (byte*) cursor#1 ← (byte*~) $7
+  (byte~) $8 ← (byte) e#3 + (byte) yd#1
+  (byte) e#1 ← (byte~) $8
+  (boolean~) $9 ← (byte) xd#1 < (byte) e#1
+  if((boolean~) $9) goto @2
+  to:@4
+@2: from @1 @5
+  (byte) yd#3 ← phi( @1/(byte) yd#1 @5/(byte) yd#5 )
+  (byte) STAR#3 ← phi( @1/(byte) STAR#1 @5/(byte) STAR#5 )
+  (byte) x1#2 ← phi( @1/(byte) x1#4 @5/(byte) x1#5 )
+  (byte) x#4 ← phi( @1/(byte) x#1 @5/(byte) x#6 )
+  (byte) xd#2 ← phi( @1/(byte) xd#1 @5/(byte) xd#4 )
+  (byte) e#4 ← phi( @1/(byte) e#1 @5/(byte) e#6 )
+  (byte*) cursor#4 ← phi( @1/(byte*) cursor#1 @5/(byte*) cursor#6 )
+  (byte) y#2 ← phi( @1/(byte) y#3 @5/(byte) y#4 )
+  (byte~) $10 ← (byte) y#2 + (byte) 1
+  (byte) y#1 ← (byte~) $10
+  (byte*~) $11 ← (byte*) cursor#4 + (byte) 40
+  (byte*) cursor#2 ← (byte*~) $11
+  (byte~) $12 ← (byte) e#4 - (byte) xd#2
+  (byte) e#2 ← (byte~) $12
+  to:@3
+@4: from @1
+  (byte) y#6 ← phi( @1/(byte) y#3 )
+  (byte) xd#5 ← phi( @1/(byte) xd#1 )
+  (byte) yd#4 ← phi( @1/(byte) yd#1 )
+  (byte) e#7 ← phi( @1/(byte) e#1 )
+  (byte*) cursor#7 ← phi( @1/(byte*) cursor#1 )
+  (byte) STAR#4 ← phi( @1/(byte) STAR#1 )
+  (byte) x1#3 ← phi( @1/(byte) x1#4 )
+  (byte) x#5 ← phi( @1/(byte) x#1 )
+  to:@3
+@3: from @2 @4
+  (byte) y#5 ← phi( @2/(byte) y#1 @4/(byte) y#6 )
+  (byte) STAR#2 ← phi( @2/(byte) STAR#3 @4/(byte) STAR#4 )
+  (byte*) cursor#5 ← phi( @2/(byte*) cursor#2 @4/(byte*) cursor#7 )
+  (byte) e#5 ← phi( @2/(byte) e#2 @4/(byte) e#7 )
+  (byte) yd#2 ← phi( @2/(byte) yd#3 @4/(byte) yd#4 )
+  (byte) xd#3 ← phi( @2/(byte) xd#2 @4/(byte) xd#5 )
+  (byte) x#3 ← phi( @2/(byte) x#4 @4/(byte) x#5 )
+  (byte) x1#1 ← phi( @2/(byte) x1#2 @4/(byte) x1#3 )
+  (byte~) $13 ← (byte) x1#1 + (byte) 1
+  (boolean~) $14 ← (byte) x#3 < (byte~) $13
+  if((boolean~) $14) goto @1
+  to:@END
+@5: from
+  (byte) STAR#5 ← phi( )
+  (byte) yd#5 ← phi( )
+  (byte) x#6 ← phi( )
+  (byte) x1#5 ← phi( )
+  (byte) y#4 ← phi( )
+  (byte*) cursor#6 ← phi( )
+  (byte) e#6 ← phi( )
+  (byte) xd#4 ← phi( )
+  to:@2
+@END: from @3
+
+Constant (byte) STAR#0 (byte) 81
+Constant (byte[1000]) SCREEN#0 (word) 1024
+Constant (byte) x0#0 (byte) 0
+Constant (byte) y0#0 (byte) 0
+Constant (byte) x1#0 (byte) 39
+Constant (byte) y1#0 (byte) 24
+Succesful SSA optimization Pass2ConstantPropagation
+CONTROL FLOW GRAPH
+@BEGIN: from
+  (byte~) $0 ← (byte) 39 - (byte) 0
+  (byte) xd#0 ← (byte~) $0
+  (byte~) $1 ← (byte) 24 - (byte) 0
+  (byte) yd#0 ← (byte~) $1
+  (byte) x#0 ← (byte) 0
+  (byte) y#0 ← (byte) 0
+  (byte~) $2 ← (byte) yd#0 / (byte) 2
+  (byte) e#0 ← (byte~) $2
+  (byte~) $3 ← (byte) y#0 * (byte) 40
+  (byte*~) $4 ← (word) 1024 + (byte~) $3
+  (byte*~) $5 ← (byte*~) $4 + (byte) x#0
+  (byte*) cursor#0 ← (byte*~) $5
+  to:@1
+@1: from @3 @BEGIN
+  (byte) x1#4 ← phi( @3/(byte) x1#1 @BEGIN/(byte) 39 )
+  (byte) y#3 ← phi( @3/(byte) y#5 @BEGIN/(byte) y#0 )
+  (byte) xd#1 ← phi( @3/(byte) xd#3 @BEGIN/(byte) xd#0 )
+  (byte) yd#1 ← phi( @3/(byte) yd#2 @BEGIN/(byte) yd#0 )
+  (byte) e#3 ← phi( @3/(byte) e#5 @BEGIN/(byte) e#0 )
+  (byte) x#2 ← phi( @3/(byte) x#3 @BEGIN/(byte) x#0 )
+  (byte*) cursor#3 ← phi( @3/(byte*) cursor#5 @BEGIN/(byte*) cursor#0 )
+  (byte) STAR#1 ← phi( @3/(byte) STAR#2 @BEGIN/(byte) 81 )
+  *((byte*) cursor#3) ← (byte) STAR#1
+  (byte~) $6 ← (byte) x#2 + (byte) 1
+  (byte) x#1 ← (byte~) $6
+  (byte*~) $7 ← (byte*) cursor#3 + (byte) 1
+  (byte*) cursor#1 ← (byte*~) $7
+  (byte~) $8 ← (byte) e#3 + (byte) yd#1
+  (byte) e#1 ← (byte~) $8
+  (boolean~) $9 ← (byte) xd#1 < (byte) e#1
+  if((boolean~) $9) goto @2
+  to:@4
+@2: from @1 @5
+  (byte) yd#3 ← phi( @1/(byte) yd#1 @5/(byte) yd#5 )
+  (byte) STAR#3 ← phi( @1/(byte) STAR#1 @5/(byte) STAR#5 )
+  (byte) x1#2 ← phi( @1/(byte) x1#4 @5/(byte) x1#5 )
+  (byte) x#4 ← phi( @1/(byte) x#1 @5/(byte) x#6 )
+  (byte) xd#2 ← phi( @1/(byte) xd#1 @5/(byte) xd#4 )
+  (byte) e#4 ← phi( @1/(byte) e#1 @5/(byte) e#6 )
+  (byte*) cursor#4 ← phi( @1/(byte*) cursor#1 @5/(byte*) cursor#6 )
+  (byte) y#2 ← phi( @1/(byte) y#3 @5/(byte) y#4 )
+  (byte~) $10 ← (byte) y#2 + (byte) 1
+  (byte) y#1 ← (byte~) $10
+  (byte*~) $11 ← (byte*) cursor#4 + (byte) 40
+  (byte*) cursor#2 ← (byte*~) $11
+  (byte~) $12 ← (byte) e#4 - (byte) xd#2
+  (byte) e#2 ← (byte~) $12
+  to:@3
+@4: from @1
+  (byte) y#6 ← phi( @1/(byte) y#3 )
+  (byte) xd#5 ← phi( @1/(byte) xd#1 )
+  (byte) yd#4 ← phi( @1/(byte) yd#1 )
+  (byte) e#7 ← phi( @1/(byte) e#1 )
+  (byte*) cursor#7 ← phi( @1/(byte*) cursor#1 )
+  (byte) STAR#4 ← phi( @1/(byte) STAR#1 )
+  (byte) x1#3 ← phi( @1/(byte) x1#4 )
+  (byte) x#5 ← phi( @1/(byte) x#1 )
+  to:@3
+@3: from @2 @4
+  (byte) y#5 ← phi( @2/(byte) y#1 @4/(byte) y#6 )
+  (byte) STAR#2 ← phi( @2/(byte) STAR#3 @4/(byte) STAR#4 )
+  (byte*) cursor#5 ← phi( @2/(byte*) cursor#2 @4/(byte*) cursor#7 )
+  (byte) e#5 ← phi( @2/(byte) e#2 @4/(byte) e#7 )
+  (byte) yd#2 ← phi( @2/(byte) yd#3 @4/(byte) yd#4 )
+  (byte) xd#3 ← phi( @2/(byte) xd#2 @4/(byte) xd#5 )
+  (byte) x#3 ← phi( @2/(byte) x#4 @4/(byte) x#5 )
+  (byte) x1#1 ← phi( @2/(byte) x1#2 @4/(byte) x1#3 )
+  (byte~) $13 ← (byte) x1#1 + (byte) 1
+  (boolean~) $14 ← (byte) x#3 < (byte~) $13
+  if((boolean~) $14) goto @1
+  to:@END
+@5: from
+  (byte) STAR#5 ← phi( )
+  (byte) yd#5 ← phi( )
+  (byte) x#6 ← phi( )
+  (byte) x1#5 ← phi( )
+  (byte) y#4 ← phi( )
+  (byte*) cursor#6 ← phi( )
+  (byte) e#6 ← phi( )
+  (byte) xd#4 ← phi( )
+  to:@2
+@END: from @3
+
+Multiple usages for variable. Not optimizing sub-constant (byte) x1#1
+Alias (byte) xd#0 = (byte~) $0 
+Alias (byte) yd#0 = (byte~) $1 
+Alias (byte) e#0 = (byte~) $2 
+Alias (byte*) cursor#0 = (byte*~) $5 
+Alias (byte) x#1 = (byte~) $6 (byte) x#5 
+Alias (byte*) cursor#1 = (byte*~) $7 (byte*) cursor#7 
+Alias (byte) e#1 = (byte~) $8 (byte) e#7 
+Alias (byte) y#1 = (byte~) $10 
+Alias (byte*) cursor#2 = (byte*~) $11 
+Alias (byte) e#2 = (byte~) $12 
+Alias (byte) y#3 = (byte) y#6 
+Alias (byte) xd#1 = (byte) xd#5 
+Alias (byte) yd#1 = (byte) yd#4 
+Alias (byte) STAR#1 = (byte) STAR#4 
+Alias (byte) x1#3 = (byte) x1#4 
+Succesful SSA optimization Pass2AliasElimination
+CONTROL FLOW GRAPH
+@BEGIN: from
+  (byte) xd#0 ← (byte) 39 - (byte) 0
+  (byte) yd#0 ← (byte) 24 - (byte) 0
+  (byte) x#0 ← (byte) 0
+  (byte) y#0 ← (byte) 0
+  (byte) e#0 ← (byte) yd#0 / (byte) 2
+  (byte~) $3 ← (byte) y#0 * (byte) 40
+  (byte*~) $4 ← (word) 1024 + (byte~) $3
+  (byte*) cursor#0 ← (byte*~) $4 + (byte) x#0
+  to:@1
+@1: from @3 @BEGIN
+  (byte) x1#3 ← phi( @3/(byte) x1#1 @BEGIN/(byte) 39 )
+  (byte) y#3 ← phi( @3/(byte) y#5 @BEGIN/(byte) y#0 )
+  (byte) xd#1 ← phi( @3/(byte) xd#3 @BEGIN/(byte) xd#0 )
+  (byte) yd#1 ← phi( @3/(byte) yd#2 @BEGIN/(byte) yd#0 )
+  (byte) e#3 ← phi( @3/(byte) e#5 @BEGIN/(byte) e#0 )
+  (byte) x#2 ← phi( @3/(byte) x#3 @BEGIN/(byte) x#0 )
+  (byte*) cursor#3 ← phi( @3/(byte*) cursor#5 @BEGIN/(byte*) cursor#0 )
+  (byte) STAR#1 ← phi( @3/(byte) STAR#2 @BEGIN/(byte) 81 )
+  *((byte*) cursor#3) ← (byte) STAR#1
+  (byte) x#1 ← (byte) x#2 + (byte) 1
+  (byte*) cursor#1 ← (byte*) cursor#3 + (byte) 1
+  (byte) e#1 ← (byte) e#3 + (byte) yd#1
+  (boolean~) $9 ← (byte) xd#1 < (byte) e#1
+  if((boolean~) $9) goto @2
+  to:@4
+@2: from @1 @5
+  (byte) yd#3 ← phi( @1/(byte) yd#1 @5/(byte) yd#5 )
+  (byte) STAR#3 ← phi( @1/(byte) STAR#1 @5/(byte) STAR#5 )
+  (byte) x1#2 ← phi( @1/(byte) x1#3 @5/(byte) x1#5 )
+  (byte) x#4 ← phi( @1/(byte) x#1 @5/(byte) x#6 )
+  (byte) xd#2 ← phi( @1/(byte) xd#1 @5/(byte) xd#4 )
+  (byte) e#4 ← phi( @1/(byte) e#1 @5/(byte) e#6 )
+  (byte*) cursor#4 ← phi( @1/(byte*) cursor#1 @5/(byte*) cursor#6 )
+  (byte) y#2 ← phi( @1/(byte) y#3 @5/(byte) y#4 )
+  (byte) y#1 ← (byte) y#2 + (byte) 1
+  (byte*) cursor#2 ← (byte*) cursor#4 + (byte) 40
+  (byte) e#2 ← (byte) e#4 - (byte) xd#2
+  to:@3
+@4: from @1
+  to:@3
+@3: from @2 @4
+  (byte) y#5 ← phi( @2/(byte) y#1 @4/(byte) y#3 )
+  (byte) STAR#2 ← phi( @2/(byte) STAR#3 @4/(byte) STAR#1 )
+  (byte*) cursor#5 ← phi( @2/(byte*) cursor#2 @4/(byte*) cursor#1 )
+  (byte) e#5 ← phi( @2/(byte) e#2 @4/(byte) e#1 )
+  (byte) yd#2 ← phi( @2/(byte) yd#3 @4/(byte) yd#1 )
+  (byte) xd#3 ← phi( @2/(byte) xd#2 @4/(byte) xd#1 )
+  (byte) x#3 ← phi( @2/(byte) x#4 @4/(byte) x#1 )
+  (byte) x1#1 ← phi( @2/(byte) x1#2 @4/(byte) x1#3 )
+  (byte~) $13 ← (byte) x1#1 + (byte) 1
+  (boolean~) $14 ← (byte) x#3 < (byte~) $13
+  if((boolean~) $14) goto @1
+  to:@END
+@5: from
+  (byte) STAR#5 ← phi( )
+  (byte) yd#5 ← phi( )
+  (byte) x#6 ← phi( )
+  (byte) x1#5 ← phi( )
+  (byte) y#4 ← phi( )
+  (byte*) cursor#6 ← phi( )
+  (byte) e#6 ← phi( )
+  (byte) xd#4 ← phi( )
+  to:@2
+@END: from @3
+
+Redundant Phi (byte) STAR#5 VOID
+Redundant Phi (byte) yd#5 VOID
+Redundant Phi (byte) x#6 VOID
+Redundant Phi (byte) x1#5 VOID
+Redundant Phi (byte) y#4 VOID
+Redundant Phi (byte*) cursor#6 VOID
+Redundant Phi (byte) e#6 VOID
+Redundant Phi (byte) xd#4 VOID
+Succesful SSA optimization Pass2RedundantPhiElimination
+CONTROL FLOW GRAPH
+@BEGIN: from
+  (byte) xd#0 ← (byte) 39 - (byte) 0
+  (byte) yd#0 ← (byte) 24 - (byte) 0
+  (byte) x#0 ← (byte) 0
+  (byte) y#0 ← (byte) 0
+  (byte) e#0 ← (byte) yd#0 / (byte) 2
+  (byte~) $3 ← (byte) y#0 * (byte) 40
+  (byte*~) $4 ← (word) 1024 + (byte~) $3
+  (byte*) cursor#0 ← (byte*~) $4 + (byte) x#0
+  to:@1
+@1: from @3 @BEGIN
+  (byte) x1#3 ← phi( @3/(byte) x1#1 @BEGIN/(byte) 39 )
+  (byte) y#3 ← phi( @3/(byte) y#5 @BEGIN/(byte) y#0 )
+  (byte) xd#1 ← phi( @3/(byte) xd#3 @BEGIN/(byte) xd#0 )
+  (byte) yd#1 ← phi( @3/(byte) yd#2 @BEGIN/(byte) yd#0 )
+  (byte) e#3 ← phi( @3/(byte) e#5 @BEGIN/(byte) e#0 )
+  (byte) x#2 ← phi( @3/(byte) x#3 @BEGIN/(byte) x#0 )
+  (byte*) cursor#3 ← phi( @3/(byte*) cursor#5 @BEGIN/(byte*) cursor#0 )
+  (byte) STAR#1 ← phi( @3/(byte) STAR#2 @BEGIN/(byte) 81 )
+  *((byte*) cursor#3) ← (byte) STAR#1
+  (byte) x#1 ← (byte) x#2 + (byte) 1
+  (byte*) cursor#1 ← (byte*) cursor#3 + (byte) 1
+  (byte) e#1 ← (byte) e#3 + (byte) yd#1
+  (boolean~) $9 ← (byte) xd#1 < (byte) e#1
+  if((boolean~) $9) goto @2
+  to:@4
+@2: from @1 @5
+  (byte) yd#3 ← phi( @1/(byte) yd#1 )
+  (byte) STAR#3 ← phi( @1/(byte) STAR#1 )
+  (byte) x1#2 ← phi( @1/(byte) x1#3 )
+  (byte) x#4 ← phi( @1/(byte) x#1 )
+  (byte) xd#2 ← phi( @1/(byte) xd#1 )
+  (byte) e#4 ← phi( @1/(byte) e#1 )
+  (byte*) cursor#4 ← phi( @1/(byte*) cursor#1 )
+  (byte) y#2 ← phi( @1/(byte) y#3 )
+  (byte) y#1 ← (byte) y#2 + (byte) 1
+  (byte*) cursor#2 ← (byte*) cursor#4 + (byte) 40
+  (byte) e#2 ← (byte) e#4 - (byte) xd#2
+  to:@3
+@4: from @1
+  to:@3
+@3: from @2 @4
+  (byte) y#5 ← phi( @2/(byte) y#1 @4/(byte) y#3 )
+  (byte) STAR#2 ← phi( @2/(byte) STAR#3 @4/(byte) STAR#1 )
+  (byte*) cursor#5 ← phi( @2/(byte*) cursor#2 @4/(byte*) cursor#1 )
+  (byte) e#5 ← phi( @2/(byte) e#2 @4/(byte) e#1 )
+  (byte) yd#2 ← phi( @2/(byte) yd#3 @4/(byte) yd#1 )
+  (byte) xd#3 ← phi( @2/(byte) xd#2 @4/(byte) xd#1 )
+  (byte) x#3 ← phi( @2/(byte) x#4 @4/(byte) x#1 )
+  (byte) x1#1 ← phi( @2/(byte) x1#2 @4/(byte) x1#3 )
+  (byte~) $13 ← (byte) x1#1 + (byte) 1
+  (boolean~) $14 ← (byte) x#3 < (byte~) $13
+  if((boolean~) $14) goto @1
+  to:@END
+@5: from
+  to:@2
+@END: from @3
+
+Simple Condition (boolean~) $9 if((byte) xd#1<(byte) e#1) goto @2
+Simple Condition (boolean~) $14 if((byte) x#3<(byte~) $13) goto @1
+Succesful SSA optimization Pass2ConditionalJumpSimplification
+CONTROL FLOW GRAPH
+@BEGIN: from
+  (byte) xd#0 ← (byte) 39 - (byte) 0
+  (byte) yd#0 ← (byte) 24 - (byte) 0
+  (byte) x#0 ← (byte) 0
+  (byte) y#0 ← (byte) 0
+  (byte) e#0 ← (byte) yd#0 / (byte) 2
+  (byte~) $3 ← (byte) y#0 * (byte) 40
+  (byte*~) $4 ← (word) 1024 + (byte~) $3
+  (byte*) cursor#0 ← (byte*~) $4 + (byte) x#0
+  to:@1
+@1: from @3 @BEGIN
+  (byte) x1#3 ← phi( @3/(byte) x1#1 @BEGIN/(byte) 39 )
+  (byte) y#3 ← phi( @3/(byte) y#5 @BEGIN/(byte) y#0 )
+  (byte) xd#1 ← phi( @3/(byte) xd#3 @BEGIN/(byte) xd#0 )
+  (byte) yd#1 ← phi( @3/(byte) yd#2 @BEGIN/(byte) yd#0 )
+  (byte) e#3 ← phi( @3/(byte) e#5 @BEGIN/(byte) e#0 )
+  (byte) x#2 ← phi( @3/(byte) x#3 @BEGIN/(byte) x#0 )
+  (byte*) cursor#3 ← phi( @3/(byte*) cursor#5 @BEGIN/(byte*) cursor#0 )
+  (byte) STAR#1 ← phi( @3/(byte) STAR#2 @BEGIN/(byte) 81 )
+  *((byte*) cursor#3) ← (byte) STAR#1
+  (byte) x#1 ← (byte) x#2 + (byte) 1
+  (byte*) cursor#1 ← (byte*) cursor#3 + (byte) 1
+  (byte) e#1 ← (byte) e#3 + (byte) yd#1
+  if((byte) xd#1<(byte) e#1) goto @2
+  to:@4
+@2: from @1 @5
+  (byte) yd#3 ← phi( @1/(byte) yd#1 )
+  (byte) STAR#3 ← phi( @1/(byte) STAR#1 )
+  (byte) x1#2 ← phi( @1/(byte) x1#3 )
+  (byte) x#4 ← phi( @1/(byte) x#1 )
+  (byte) xd#2 ← phi( @1/(byte) xd#1 )
+  (byte) e#4 ← phi( @1/(byte) e#1 )
+  (byte*) cursor#4 ← phi( @1/(byte*) cursor#1 )
+  (byte) y#2 ← phi( @1/(byte) y#3 )
+  (byte) y#1 ← (byte) y#2 + (byte) 1
+  (byte*) cursor#2 ← (byte*) cursor#4 + (byte) 40
+  (byte) e#2 ← (byte) e#4 - (byte) xd#2
+  to:@3
+@4: from @1
+  to:@3
+@3: from @2 @4
+  (byte) y#5 ← phi( @2/(byte) y#1 @4/(byte) y#3 )
+  (byte) STAR#2 ← phi( @2/(byte) STAR#3 @4/(byte) STAR#1 )
+  (byte*) cursor#5 ← phi( @2/(byte*) cursor#2 @4/(byte*) cursor#1 )
+  (byte) e#5 ← phi( @2/(byte) e#2 @4/(byte) e#1 )
+  (byte) yd#2 ← phi( @2/(byte) yd#3 @4/(byte) yd#1 )
+  (byte) xd#3 ← phi( @2/(byte) xd#2 @4/(byte) xd#1 )
+  (byte) x#3 ← phi( @2/(byte) x#4 @4/(byte) x#1 )
+  (byte) x1#1 ← phi( @2/(byte) x1#2 @4/(byte) x1#3 )
+  (byte~) $13 ← (byte) x1#1 + (byte) 1
+  if((byte) x#3<(byte~) $13) goto @1
+  to:@END
+@5: from
+  to:@2
+@END: from @3
+
+Culled Empty Block (label) @4
+Culled Empty Block (label) @5
+Succesful SSA optimization Pass2CullEmptyBlocks
+CONTROL FLOW GRAPH
+@BEGIN: from
+  (byte) xd#0 ← (byte) 39 - (byte) 0
+  (byte) yd#0 ← (byte) 24 - (byte) 0
+  (byte) x#0 ← (byte) 0
+  (byte) y#0 ← (byte) 0
+  (byte) e#0 ← (byte) yd#0 / (byte) 2
+  (byte~) $3 ← (byte) y#0 * (byte) 40
+  (byte*~) $4 ← (word) 1024 + (byte~) $3
+  (byte*) cursor#0 ← (byte*~) $4 + (byte) x#0
+  to:@1
+@1: from @3 @BEGIN
+  (byte) x1#3 ← phi( @3/(byte) x1#1 @BEGIN/(byte) 39 )
+  (byte) y#3 ← phi( @3/(byte) y#5 @BEGIN/(byte) y#0 )
+  (byte) xd#1 ← phi( @3/(byte) xd#3 @BEGIN/(byte) xd#0 )
+  (byte) yd#1 ← phi( @3/(byte) yd#2 @BEGIN/(byte) yd#0 )
+  (byte) e#3 ← phi( @3/(byte) e#5 @BEGIN/(byte) e#0 )
+  (byte) x#2 ← phi( @3/(byte) x#3 @BEGIN/(byte) x#0 )
+  (byte*) cursor#3 ← phi( @3/(byte*) cursor#5 @BEGIN/(byte*) cursor#0 )
+  (byte) STAR#1 ← phi( @3/(byte) STAR#2 @BEGIN/(byte) 81 )
+  *((byte*) cursor#3) ← (byte) STAR#1
+  (byte) x#1 ← (byte) x#2 + (byte) 1
+  (byte*) cursor#1 ← (byte*) cursor#3 + (byte) 1
+  (byte) e#1 ← (byte) e#3 + (byte) yd#1
+  if((byte) xd#1<(byte) e#1) goto @2
+  to:@3
+@2: from @1
+  (byte) yd#3 ← phi( @1/(byte) yd#1 )
+  (byte) STAR#3 ← phi( @1/(byte) STAR#1 )
+  (byte) x1#2 ← phi( @1/(byte) x1#3 )
+  (byte) x#4 ← phi( @1/(byte) x#1 )
+  (byte) xd#2 ← phi( @1/(byte) xd#1 )
+  (byte) e#4 ← phi( @1/(byte) e#1 )
+  (byte*) cursor#4 ← phi( @1/(byte*) cursor#1 )
+  (byte) y#2 ← phi( @1/(byte) y#3 )
+  (byte) y#1 ← (byte) y#2 + (byte) 1
+  (byte*) cursor#2 ← (byte*) cursor#4 + (byte) 40
+  (byte) e#2 ← (byte) e#4 - (byte) xd#2
+  to:@3
+@3: from @1 @2
+  (byte) y#5 ← phi( @2/(byte) y#1 @1/(byte) y#3 )
+  (byte) STAR#2 ← phi( @2/(byte) STAR#3 @1/(byte) STAR#1 )
+  (byte*) cursor#5 ← phi( @2/(byte*) cursor#2 @1/(byte*) cursor#1 )
+  (byte) e#5 ← phi( @2/(byte) e#2 @1/(byte) e#1 )
+  (byte) yd#2 ← phi( @2/(byte) yd#3 @1/(byte) yd#1 )
+  (byte) xd#3 ← phi( @2/(byte) xd#2 @1/(byte) xd#1 )
+  (byte) x#3 ← phi( @2/(byte) x#4 @1/(byte) x#1 )
+  (byte) x1#1 ← phi( @2/(byte) x1#2 @1/(byte) x1#3 )
+  (byte~) $13 ← (byte) x1#1 + (byte) 1
+  if((byte) x#3<(byte~) $13) goto @1
+  to:@END
+@END: from @3
+
+Constant (byte) xd#0 (byte) 39
+Constant (byte) yd#0 (byte) 24
+Constant (byte) x#0 (byte) 0
+Constant (byte) y#0 (byte) 0
+Succesful SSA optimization Pass2ConstantPropagation
+CONTROL FLOW GRAPH
+@BEGIN: from
+  (byte) e#0 ← (byte) 24 / (byte) 2
+  (byte~) $3 ← (byte) 0 * (byte) 40
+  (byte*~) $4 ← (word) 1024 + (byte~) $3
+  (byte*) cursor#0 ← (byte*~) $4 + (byte) 0
+  to:@1
+@1: from @3 @BEGIN
+  (byte) x1#3 ← phi( @3/(byte) x1#1 @BEGIN/(byte) 39 )
+  (byte) y#3 ← phi( @3/(byte) y#5 @BEGIN/(byte) 0 )
+  (byte) xd#1 ← phi( @3/(byte) xd#3 @BEGIN/(byte) 39 )
+  (byte) yd#1 ← phi( @3/(byte) yd#2 @BEGIN/(byte) 24 )
+  (byte) e#3 ← phi( @3/(byte) e#5 @BEGIN/(byte) e#0 )
+  (byte) x#2 ← phi( @3/(byte) x#3 @BEGIN/(byte) 0 )
+  (byte*) cursor#3 ← phi( @3/(byte*) cursor#5 @BEGIN/(byte*) cursor#0 )
+  (byte) STAR#1 ← phi( @3/(byte) STAR#2 @BEGIN/(byte) 81 )
+  *((byte*) cursor#3) ← (byte) STAR#1
+  (byte) x#1 ← (byte) x#2 + (byte) 1
+  (byte*) cursor#1 ← (byte*) cursor#3 + (byte) 1
+  (byte) e#1 ← (byte) e#3 + (byte) yd#1
+  if((byte) xd#1<(byte) e#1) goto @2
+  to:@3
+@2: from @1
+  (byte) yd#3 ← phi( @1/(byte) yd#1 )
+  (byte) STAR#3 ← phi( @1/(byte) STAR#1 )
+  (byte) x1#2 ← phi( @1/(byte) x1#3 )
+  (byte) x#4 ← phi( @1/(byte) x#1 )
+  (byte) xd#2 ← phi( @1/(byte) xd#1 )
+  (byte) e#4 ← phi( @1/(byte) e#1 )
+  (byte*) cursor#4 ← phi( @1/(byte*) cursor#1 )
+  (byte) y#2 ← phi( @1/(byte) y#3 )
+  (byte) y#1 ← (byte) y#2 + (byte) 1
+  (byte*) cursor#2 ← (byte*) cursor#4 + (byte) 40
+  (byte) e#2 ← (byte) e#4 - (byte) xd#2
+  to:@3
+@3: from @1 @2
+  (byte) y#5 ← phi( @2/(byte) y#1 @1/(byte) y#3 )
+  (byte) STAR#2 ← phi( @2/(byte) STAR#3 @1/(byte) STAR#1 )
+  (byte*) cursor#5 ← phi( @2/(byte*) cursor#2 @1/(byte*) cursor#1 )
+  (byte) e#5 ← phi( @2/(byte) e#2 @1/(byte) e#1 )
+  (byte) yd#2 ← phi( @2/(byte) yd#3 @1/(byte) yd#1 )
+  (byte) xd#3 ← phi( @2/(byte) xd#2 @1/(byte) xd#1 )
+  (byte) x#3 ← phi( @2/(byte) x#4 @1/(byte) x#1 )
+  (byte) x1#1 ← phi( @2/(byte) x1#2 @1/(byte) x1#3 )
+  (byte~) $13 ← (byte) x1#1 + (byte) 1
+  if((byte) x#3<(byte~) $13) goto @1
+  to:@END
+@END: from @3
+
+Consolidated constant in assignment (byte*) cursor#0
+Multiple usages for variable. Not optimizing sub-constant (byte) x1#1
+Succesful SSA optimization Pass2ConstantAdditionElimination
+CONTROL FLOW GRAPH
+@BEGIN: from
+  (byte) e#0 ← (byte) 24 / (byte) 2
+  (byte~) $3 ← (byte) 0 * (byte) 40
+  (byte*~) $4 ← (byte~) $3
+  (byte*) cursor#0 ← (byte*~) $4 + (word) 1024
+  to:@1
+@1: from @3 @BEGIN
+  (byte) x1#3 ← phi( @3/(byte) x1#1 @BEGIN/(byte) 39 )
+  (byte) y#3 ← phi( @3/(byte) y#5 @BEGIN/(byte) 0 )
+  (byte) xd#1 ← phi( @3/(byte) xd#3 @BEGIN/(byte) 39 )
+  (byte) yd#1 ← phi( @3/(byte) yd#2 @BEGIN/(byte) 24 )
+  (byte) e#3 ← phi( @3/(byte) e#5 @BEGIN/(byte) e#0 )
+  (byte) x#2 ← phi( @3/(byte) x#3 @BEGIN/(byte) 0 )
+  (byte*) cursor#3 ← phi( @3/(byte*) cursor#5 @BEGIN/(byte*) cursor#0 )
+  (byte) STAR#1 ← phi( @3/(byte) STAR#2 @BEGIN/(byte) 81 )
+  *((byte*) cursor#3) ← (byte) STAR#1
+  (byte) x#1 ← (byte) x#2 + (byte) 1
+  (byte*) cursor#1 ← (byte*) cursor#3 + (byte) 1
+  (byte) e#1 ← (byte) e#3 + (byte) yd#1
+  if((byte) xd#1<(byte) e#1) goto @2
+  to:@3
+@2: from @1
+  (byte) yd#3 ← phi( @1/(byte) yd#1 )
+  (byte) STAR#3 ← phi( @1/(byte) STAR#1 )
+  (byte) x1#2 ← phi( @1/(byte) x1#3 )
+  (byte) x#4 ← phi( @1/(byte) x#1 )
+  (byte) xd#2 ← phi( @1/(byte) xd#1 )
+  (byte) e#4 ← phi( @1/(byte) e#1 )
+  (byte*) cursor#4 ← phi( @1/(byte*) cursor#1 )
+  (byte) y#2 ← phi( @1/(byte) y#3 )
+  (byte) y#1 ← (byte) y#2 + (byte) 1
+  (byte*) cursor#2 ← (byte*) cursor#4 + (byte) 40
+  (byte) e#2 ← (byte) e#4 - (byte) xd#2
+  to:@3
+@3: from @1 @2
+  (byte) y#5 ← phi( @2/(byte) y#1 @1/(byte) y#3 )
+  (byte) STAR#2 ← phi( @2/(byte) STAR#3 @1/(byte) STAR#1 )
+  (byte*) cursor#5 ← phi( @2/(byte*) cursor#2 @1/(byte*) cursor#1 )
+  (byte) e#5 ← phi( @2/(byte) e#2 @1/(byte) e#1 )
+  (byte) yd#2 ← phi( @2/(byte) yd#3 @1/(byte) yd#1 )
+  (byte) xd#3 ← phi( @2/(byte) xd#2 @1/(byte) xd#1 )
+  (byte) x#3 ← phi( @2/(byte) x#4 @1/(byte) x#1 )
+  (byte) x1#1 ← phi( @2/(byte) x1#2 @1/(byte) x1#3 )
+  (byte~) $13 ← (byte) x1#1 + (byte) 1
+  if((byte) x#3<(byte~) $13) goto @1
+  to:@END
+@END: from @3
+
+Alias (byte~) $3 = (byte*~) $4 
+Alias (byte) yd#1 = (byte) yd#3 
+Alias (byte) STAR#1 = (byte) STAR#3 
+Alias (byte) x1#2 = (byte) x1#3 
+Alias (byte) x#1 = (byte) x#4 
+Alias (byte) xd#1 = (byte) xd#2 
+Alias (byte) e#1 = (byte) e#4 
+Alias (byte*) cursor#1 = (byte*) cursor#4 
+Alias (byte) y#2 = (byte) y#3 
+Succesful SSA optimization Pass2AliasElimination
+CONTROL FLOW GRAPH
+@BEGIN: from
+  (byte) e#0 ← (byte) 24 / (byte) 2
+  (byte~) $3 ← (byte) 0 * (byte) 40
+  (byte*) cursor#0 ← (byte~) $3 + (word) 1024
+  to:@1
+@1: from @3 @BEGIN
+  (byte) x1#2 ← phi( @3/(byte) x1#1 @BEGIN/(byte) 39 )
+  (byte) y#2 ← phi( @3/(byte) y#5 @BEGIN/(byte) 0 )
+  (byte) xd#1 ← phi( @3/(byte) xd#3 @BEGIN/(byte) 39 )
+  (byte) yd#1 ← phi( @3/(byte) yd#2 @BEGIN/(byte) 24 )
+  (byte) e#3 ← phi( @3/(byte) e#5 @BEGIN/(byte) e#0 )
+  (byte) x#2 ← phi( @3/(byte) x#3 @BEGIN/(byte) 0 )
+  (byte*) cursor#3 ← phi( @3/(byte*) cursor#5 @BEGIN/(byte*) cursor#0 )
+  (byte) STAR#1 ← phi( @3/(byte) STAR#2 @BEGIN/(byte) 81 )
+  *((byte*) cursor#3) ← (byte) STAR#1
+  (byte) x#1 ← (byte) x#2 + (byte) 1
+  (byte*) cursor#1 ← (byte*) cursor#3 + (byte) 1
+  (byte) e#1 ← (byte) e#3 + (byte) yd#1
+  if((byte) xd#1<(byte) e#1) goto @2
+  to:@3
+@2: from @1
+  (byte) y#1 ← (byte) y#2 + (byte) 1
+  (byte*) cursor#2 ← (byte*) cursor#1 + (byte) 40
+  (byte) e#2 ← (byte) e#1 - (byte) xd#1
+  to:@3
+@3: from @1 @2
+  (byte) y#5 ← phi( @2/(byte) y#1 @1/(byte) y#2 )
+  (byte) STAR#2 ← phi( @2/(byte) STAR#1 @1/(byte) STAR#1 )
+  (byte*) cursor#5 ← phi( @2/(byte*) cursor#2 @1/(byte*) cursor#1 )
+  (byte) e#5 ← phi( @2/(byte) e#2 @1/(byte) e#1 )
+  (byte) yd#2 ← phi( @2/(byte) yd#1 @1/(byte) yd#1 )
+  (byte) xd#3 ← phi( @2/(byte) xd#1 @1/(byte) xd#1 )
+  (byte) x#3 ← phi( @2/(byte) x#1 @1/(byte) x#1 )
+  (byte) x1#1 ← phi( @2/(byte) x1#2 @1/(byte) x1#2 )
+  (byte~) $13 ← (byte) x1#1 + (byte) 1
+  if((byte) x#3<(byte~) $13) goto @1
+  to:@END
+@END: from @3
+
+Redundant Phi (byte) STAR#2 (byte) STAR#1
+Redundant Phi (byte) yd#2 (byte) yd#1
+Redundant Phi (byte) xd#3 (byte) xd#1
+Redundant Phi (byte) x#3 (byte) x#1
+Redundant Phi (byte) x1#1 (byte) x1#2
+Succesful SSA optimization Pass2RedundantPhiElimination
+CONTROL FLOW GRAPH
+@BEGIN: from
+  (byte) e#0 ← (byte) 24 / (byte) 2
+  (byte~) $3 ← (byte) 0 * (byte) 40
+  (byte*) cursor#0 ← (byte~) $3 + (word) 1024
+  to:@1
+@1: from @3 @BEGIN
+  (byte) x1#2 ← phi( @3/(byte) x1#2 @BEGIN/(byte) 39 )
+  (byte) y#2 ← phi( @3/(byte) y#5 @BEGIN/(byte) 0 )
+  (byte) xd#1 ← phi( @3/(byte) xd#1 @BEGIN/(byte) 39 )
+  (byte) yd#1 ← phi( @3/(byte) yd#1 @BEGIN/(byte) 24 )
+  (byte) e#3 ← phi( @3/(byte) e#5 @BEGIN/(byte) e#0 )
+  (byte) x#2 ← phi( @3/(byte) x#1 @BEGIN/(byte) 0 )
+  (byte*) cursor#3 ← phi( @3/(byte*) cursor#5 @BEGIN/(byte*) cursor#0 )
+  (byte) STAR#1 ← phi( @3/(byte) STAR#1 @BEGIN/(byte) 81 )
+  *((byte*) cursor#3) ← (byte) STAR#1
+  (byte) x#1 ← (byte) x#2 + (byte) 1
+  (byte*) cursor#1 ← (byte*) cursor#3 + (byte) 1
+  (byte) e#1 ← (byte) e#3 + (byte) yd#1
+  if((byte) xd#1<(byte) e#1) goto @2
+  to:@3
+@2: from @1
+  (byte) y#1 ← (byte) y#2 + (byte) 1
+  (byte*) cursor#2 ← (byte*) cursor#1 + (byte) 40
+  (byte) e#2 ← (byte) e#1 - (byte) xd#1
+  to:@3
+@3: from @1 @2
+  (byte) y#5 ← phi( @2/(byte) y#1 @1/(byte) y#2 )
+  (byte*) cursor#5 ← phi( @2/(byte*) cursor#2 @1/(byte*) cursor#1 )
+  (byte) e#5 ← phi( @2/(byte) e#2 @1/(byte) e#1 )
+  (byte~) $13 ← (byte) x1#2 + (byte) 1
+  if((byte) x#1<(byte~) $13) goto @1
+  to:@END
+@END: from @3
+
+Self Phi Eliminated (byte) x1#2
+Self Phi Eliminated (byte) xd#1
+Self Phi Eliminated (byte) yd#1
+Self Phi Eliminated (byte) STAR#1
+Succesful SSA optimization Pass2SelfPhiElimination
+CONTROL FLOW GRAPH
+@BEGIN: from
+  (byte) e#0 ← (byte) 24 / (byte) 2
+  (byte~) $3 ← (byte) 0 * (byte) 40
+  (byte*) cursor#0 ← (byte~) $3 + (word) 1024
+  to:@1
+@1: from @3 @BEGIN
+  (byte) x1#2 ← phi( @BEGIN/(byte) 39 )
+  (byte) y#2 ← phi( @3/(byte) y#5 @BEGIN/(byte) 0 )
+  (byte) xd#1 ← phi( @BEGIN/(byte) 39 )
+  (byte) yd#1 ← phi( @BEGIN/(byte) 24 )
+  (byte) e#3 ← phi( @3/(byte) e#5 @BEGIN/(byte) e#0 )
+  (byte) x#2 ← phi( @3/(byte) x#1 @BEGIN/(byte) 0 )
+  (byte*) cursor#3 ← phi( @3/(byte*) cursor#5 @BEGIN/(byte*) cursor#0 )
+  (byte) STAR#1 ← phi( @BEGIN/(byte) 81 )
+  *((byte*) cursor#3) ← (byte) STAR#1
+  (byte) x#1 ← (byte) x#2 + (byte) 1
+  (byte*) cursor#1 ← (byte*) cursor#3 + (byte) 1
+  (byte) e#1 ← (byte) e#3 + (byte) yd#1
+  if((byte) xd#1<(byte) e#1) goto @2
+  to:@3
+@2: from @1
+  (byte) y#1 ← (byte) y#2 + (byte) 1
+  (byte*) cursor#2 ← (byte*) cursor#1 + (byte) 40
+  (byte) e#2 ← (byte) e#1 - (byte) xd#1
+  to:@3
+@3: from @1 @2
+  (byte) y#5 ← phi( @2/(byte) y#1 @1/(byte) y#2 )
+  (byte*) cursor#5 ← phi( @2/(byte*) cursor#2 @1/(byte*) cursor#1 )
+  (byte) e#5 ← phi( @2/(byte) e#2 @1/(byte) e#1 )
+  (byte~) $13 ← (byte) x1#2 + (byte) 1
+  if((byte) x#1<(byte~) $13) goto @1
+  to:@END
+@END: from @3
+
+Constant (byte) e#0 (byte) 12
+Constant (byte~) $3 (byte) 0
+Constant (byte) x1#2 (byte) 39
+Constant (byte) xd#1 (byte) 39
+Constant (byte) yd#1 (byte) 24
+Constant (byte) STAR#1 (byte) 81
+Succesful SSA optimization Pass2ConstantPropagation
+CONTROL FLOW GRAPH
+@BEGIN: from
+  (byte*) cursor#0 ← (byte) 0 + (word) 1024
+  to:@1
+@1: from @3 @BEGIN
+  (byte) y#2 ← phi( @3/(byte) y#5 @BEGIN/(byte) 0 )
+  (byte) e#3 ← phi( @3/(byte) e#5 @BEGIN/(byte) 12 )
+  (byte) x#2 ← phi( @3/(byte) x#1 @BEGIN/(byte) 0 )
+  (byte*) cursor#3 ← phi( @3/(byte*) cursor#5 @BEGIN/(byte*) cursor#0 )
+  *((byte*) cursor#3) ← (byte) 81
+  (byte) x#1 ← (byte) x#2 + (byte) 1
+  (byte*) cursor#1 ← (byte*) cursor#3 + (byte) 1
+  (byte) e#1 ← (byte) e#3 + (byte) 24
+  if((byte) 39<(byte) e#1) goto @2
+  to:@3
+@2: from @1
+  (byte) y#1 ← (byte) y#2 + (byte) 1
+  (byte*) cursor#2 ← (byte*) cursor#1 + (byte) 40
+  (byte) e#2 ← (byte) e#1 - (byte) 39
+  to:@3
+@3: from @1 @2
+  (byte) y#5 ← phi( @2/(byte) y#1 @1/(byte) y#2 )
+  (byte*) cursor#5 ← phi( @2/(byte*) cursor#2 @1/(byte*) cursor#1 )
+  (byte) e#5 ← phi( @2/(byte) e#2 @1/(byte) e#1 )
+  (byte~) $13 ← (byte) 39 + (byte) 1
+  if((byte) x#1<(byte~) $13) goto @1
+  to:@END
+@END: from @3
+
+Multiple usages for variable. Not optimizing sub-constant (byte) y#2
+Multiple usages for variable. Not optimizing sub-constant (byte*) cursor#1
+Constant (byte*) cursor#0 (word) 1024
+Constant (byte~) $13 (byte) 40
+Succesful SSA optimization Pass2ConstantPropagation
+CONTROL FLOW GRAPH
+@BEGIN: from
+  to:@1
+@1: from @3 @BEGIN
+  (byte) y#2 ← phi( @3/(byte) y#5 @BEGIN/(byte) 0 )
+  (byte) e#3 ← phi( @3/(byte) e#5 @BEGIN/(byte) 12 )
+  (byte) x#2 ← phi( @3/(byte) x#1 @BEGIN/(byte) 0 )
+  (byte*) cursor#3 ← phi( @3/(byte*) cursor#5 @BEGIN/(word) 1024 )
+  *((byte*) cursor#3) ← (byte) 81
+  (byte) x#1 ← (byte) x#2 + (byte) 1
+  (byte*) cursor#1 ← (byte*) cursor#3 + (byte) 1
+  (byte) e#1 ← (byte) e#3 + (byte) 24
+  if((byte) 39<(byte) e#1) goto @2
+  to:@3
+@2: from @1
+  (byte) y#1 ← (byte) y#2 + (byte) 1
+  (byte*) cursor#2 ← (byte*) cursor#1 + (byte) 40
+  (byte) e#2 ← (byte) e#1 - (byte) 39
+  to:@3
+@3: from @1 @2
+  (byte) y#5 ← phi( @2/(byte) y#1 @1/(byte) y#2 )
+  (byte*) cursor#5 ← phi( @2/(byte*) cursor#2 @1/(byte*) cursor#1 )
+  (byte) e#5 ← phi( @2/(byte) e#2 @1/(byte) e#1 )
+  if((byte) x#1<(byte) 40) goto @1
+  to:@END
+@END: from @3
+
+Multiple usages for variable. Not optimizing sub-constant (byte) y#2
+Multiple usages for variable. Not optimizing sub-constant (byte*) cursor#1
+Multiple usages for variable. Not optimizing sub-constant (byte) y#2
+Multiple usages for variable. Not optimizing sub-constant (byte*) cursor#1
+INITIAL ASM
+BBEGIN:
+B1_from_BBEGIN:
+  // (byte) y#2 = (byte) 0  // zpby1=coby1
+  lda #0
+  sta 14
+  // (byte) e#3 = (byte) 12  // zpby1=coby1
+  lda #12
+  sta 13
+  // (byte) x#2 = (byte) 0  // zpby1=coby1
+  lda #0
+  sta 12
+  // (byte*) cursor#3 = (word) 1024  // zpptrby1=cowo1
+  lda #<1024
+  sta 10
+  lda #>1024
+  sta 10+1
+  jmp B1
+B1_from_B3:
+  // (byte) y#2 = (byte) y#5  // zpby1=zpby2
+  lda 18
+  sta 14
+  // (byte) e#3 = (byte) e#5  // zpby1=zpby2
+  lda 15
+  sta 13
+  // (byte) x#2 = (byte) x#1  // zpby1=zpby2
+  lda 2
+  sta 12
+  // (byte*) cursor#3 = (byte*) cursor#5  // zpptrby1=zpptrby2
+  lda 16
+  sta 10
+  lda 16+1
+  sta 10+1
+  jmp B1
+B1:
+  // *((byte*) cursor#3) ← (byte) 81  //  zpiby1=coby1
+  ldy #0
+  lda #81
+  sta (10),y
+  // (byte) x#1 ← (byte) x#2 + (byte) 1  //  zpby1=zpby2_plus_1
+  lda 12
+  clc
+  adc #1
+  sta 2
+  // (byte*) cursor#1 ← (byte*) cursor#3 + (byte) 1  //  zpptrby1=zpptrby2_plus_1
+  lda 10
+  clc
+  adc #1
+  sta 3
+  lda 10+1
+  adc #0
+  sta 3+1
+  // (byte) e#1 ← (byte) e#3 + (byte) 24  //  zpby1=zpby2_plus_coby1
+  lda 13
+  clc
+  adc #24
+  sta 5
+  // if((byte) 39<(byte) e#1) goto @2  //  coby1_lt_zpby1_then_la1
+  lda #39
+  cmp 5
+  bcc B2
+B3_from_B1:
+  // (byte) y#5 = (byte) y#2  // zpby1=zpby2
+  lda 14
+  sta 18
+  // (byte*) cursor#5 = (byte*) cursor#1  // zpptrby1=zpptrby2
+  lda 3
+  sta 16
+  lda 3+1
+  sta 16+1
+  // (byte) e#5 = (byte) e#1  // zpby1=zpby2
+  lda 5
+  sta 15
+  jmp B3
+B3:
+  // if((byte) x#1<(byte) 40) goto @1  //  zpby1_lt_coby1_then_la1
+  lda 2
+  cmp #40
+  bcc B1_from_B3
+  jmp BEND
+BEND:
+B2:
+  // (byte) y#1 ← (byte) y#2 + (byte) 1  //  zpby1=zpby2_plus_1
+  lda 14
+  clc
+  adc #1
+  sta 6
+  // (byte*) cursor#2 ← (byte*) cursor#1 + (byte) 40  //  zpptrby1=zpptrby2_plus_coby1
+  lda #40
+  clc
+  adc 3
+  sta 7
+  lda #0
+  adc 3+1
+  sta 7+1
+  // (byte) e#2 ← (byte) e#1 - (byte) 39  //  zpby1=zpby2_minus_coby1
+  lda 5
+  sec
+  sbc #39
+  sta 9
+B3_from_B2:
+  // (byte) y#5 = (byte) y#1  // zpby1=zpby2
+  lda 6
+  sta 18
+  // (byte*) cursor#5 = (byte*) cursor#2  // zpptrby1=zpptrby2
+  lda 7
+  sta 16
+  lda 7+1
+  sta 16+1
+  // (byte) e#5 = (byte) e#2  // zpby1=zpby2
+  lda 9
+  sta 15
+  jmp B3
+
+Removing instruction jmp B1
+Removing instruction jmp B3
+Removing instruction jmp BEND
+Succesful ASM optimization Pass4NextJumpElimination
+ASSEMBLER
+BBEGIN:
+B1_from_BBEGIN:
+  // (byte) y#2 = (byte) 0  // zpby1=coby1
+  lda #0
+  sta 14
+  // (byte) e#3 = (byte) 12  // zpby1=coby1
+  lda #12
+  sta 13
+  // (byte) x#2 = (byte) 0  // zpby1=coby1
+  lda #0
+  sta 12
+  // (byte*) cursor#3 = (word) 1024  // zpptrby1=cowo1
+  lda #<1024
+  sta 10
+  lda #>1024
+  sta 10+1
+  jmp B1
+B1_from_B3:
+  // (byte) y#2 = (byte) y#5  // zpby1=zpby2
+  lda 18
+  sta 14
+  // (byte) e#3 = (byte) e#5  // zpby1=zpby2
+  lda 15
+  sta 13
+  // (byte) x#2 = (byte) x#1  // zpby1=zpby2
+  lda 2
+  sta 12
+  // (byte*) cursor#3 = (byte*) cursor#5  // zpptrby1=zpptrby2
+  lda 16
+  sta 10
+  lda 16+1
+  sta 10+1
+B1:
+  // *((byte*) cursor#3) ← (byte) 81  //  zpiby1=coby1
+  ldy #0
+  lda #81
+  sta (10),y
+  // (byte) x#1 ← (byte) x#2 + (byte) 1  //  zpby1=zpby2_plus_1
+  lda 12
+  clc
+  adc #1
+  sta 2
+  // (byte*) cursor#1 ← (byte*) cursor#3 + (byte) 1  //  zpptrby1=zpptrby2_plus_1
+  lda 10
+  clc
+  adc #1
+  sta 3
+  lda 10+1
+  adc #0
+  sta 3+1
+  // (byte) e#1 ← (byte) e#3 + (byte) 24  //  zpby1=zpby2_plus_coby1
+  lda 13
+  clc
+  adc #24
+  sta 5
+  // if((byte) 39<(byte) e#1) goto @2  //  coby1_lt_zpby1_then_la1
+  lda #39
+  cmp 5
+  bcc B2
+B3_from_B1:
+  // (byte) y#5 = (byte) y#2  // zpby1=zpby2
+  lda 14
+  sta 18
+  // (byte*) cursor#5 = (byte*) cursor#1  // zpptrby1=zpptrby2
+  lda 3
+  sta 16
+  lda 3+1
+  sta 16+1
+  // (byte) e#5 = (byte) e#1  // zpby1=zpby2
+  lda 5
+  sta 15
+B3:
+  // if((byte) x#1<(byte) 40) goto @1  //  zpby1_lt_coby1_then_la1
+  lda 2
+  cmp #40
+  bcc B1_from_B3
+BEND:
+B2:
+  // (byte) y#1 ← (byte) y#2 + (byte) 1  //  zpby1=zpby2_plus_1
+  lda 14
+  clc
+  adc #1
+  sta 6
+  // (byte*) cursor#2 ← (byte*) cursor#1 + (byte) 40  //  zpptrby1=zpptrby2_plus_coby1
+  lda #40
+  clc
+  adc 3
+  sta 7
+  lda #0
+  adc 3+1
+  sta 7+1
+  // (byte) e#2 ← (byte) e#1 - (byte) 39  //  zpby1=zpby2_minus_coby1
+  lda 5
+  sec
+  sbc #39
+  sta 9
+B3_from_B2:
+  // (byte) y#5 = (byte) y#1  // zpby1=zpby2
+  lda 6
+  sta 18
+  // (byte*) cursor#5 = (byte*) cursor#2  // zpptrby1=zpptrby2
+  lda 7
+  sta 16
+  lda 7+1
+  sta 16+1
+  // (byte) e#5 = (byte) e#2  // zpby1=zpby2
+  lda 9
+  sta 15
+  jmp B3
+
diff --git a/src/dk/camelot64/kickc/test/ref/bresenham.sym b/src/dk/camelot64/kickc/test/ref/bresenham.sym
new file mode 100644
index 000000000..0a3d95060
--- /dev/null
+++ b/src/dk/camelot64/kickc/test/ref/bresenham.sym
@@ -0,0 +1,30 @@
+(label) @1
+(label) @2
+(label) @3
+(label) @BEGIN
+(label) @END
+(byte[1000]) SCREEN
+(byte) STAR
+(byte*) cursor
+(byte*) cursor#1 zp ptr byte:3
+(byte*) cursor#2 zp ptr byte:7
+(byte*) cursor#3 zp ptr byte:10
+(byte*) cursor#5 zp ptr byte:16
+(byte) e
+(byte) e#1 zp byte:5
+(byte) e#2 zp byte:9
+(byte) e#3 zp byte:13
+(byte) e#5 zp byte:15
+(byte) x
+(byte) x#1 zp byte:2
+(byte) x#2 zp byte:12
+(byte) x0
+(byte) x1
+(byte) xd
+(byte) y
+(byte) y#1 zp byte:6
+(byte) y#2 zp byte:14
+(byte) y#5 zp byte:18
+(byte) y0
+(byte) y1
+(byte) yd
diff --git a/src/dk/camelot64/kickc/test/ref/flipper-rex2.log b/src/dk/camelot64/kickc/test/ref/flipper-rex2.log
index 2ac62b407..bf058b9a6 100644
--- a/src/dk/camelot64/kickc/test/ref/flipper-rex2.log
+++ b/src/dk/camelot64/kickc/test/ref/flipper-rex2.log
@@ -936,7 +936,7 @@ Culled Empty Block (label) @13
 Culled Empty Block (label) @14
 Culled Empty Block (label) @16
 Culled Empty Block (label) @17
-Succesful SSA optimization dk.camelot64.kickc.icl.Pass2CullEmptyBlocks@21a34544
+Succesful SSA optimization Pass2CullEmptyBlocks
 CONTROL FLOW GRAPH
 @BEGIN: from
   (byte[1000]) SCREEN#0 ← (word) 1024
@@ -1159,7 +1159,7 @@ Constant (byte~) plot::$0 (byte) 200
 Constant (byte) plot::y#0 (byte) 16
 Constant (byte) plot::i#0 (byte) 0
 Constant (byte) plot::x#0 (byte) 0
-Succesful SSA optimization dk.camelot64.kickc.icl.Pass2ConstantPropagation@742e84e1
+Succesful SSA optimization Pass2ConstantPropagation
 CONTROL FLOW GRAPH
 @BEGIN: from
   call prepare param-assignment
@@ -1353,7 +1353,7 @@ plot::@return: from @15
 @END: from @20
 
 Consolidated constant in assignment (byte*~) plot::$2
-Succesful SSA optimization dk.camelot64.kickc.icl.Pass2ConstantAdditionElimination@1a160b5e
+Succesful SSA optimization Pass2ConstantAdditionElimination
 CONTROL FLOW GRAPH
 @BEGIN: from
   call prepare param-assignment
@@ -1567,7 +1567,7 @@ Alias (byte[256]) buffer1#11 = (byte[256]) buffer1#4
 Alias (byte) plot::y#2 = (byte) plot::y#3 
 Alias (byte*) plot::line#2 = (byte*) plot::line#3 
 Alias (byte*) plot::line#1 = (byte*~) plot::$5 
-Succesful SSA optimization dk.camelot64.kickc.icl.Pass2AliasElimination@3a1af7aa
+Succesful SSA optimization Pass2AliasElimination
 CONTROL FLOW GRAPH
 @BEGIN: from
   call prepare param-assignment
@@ -1724,7 +1724,7 @@ Redundant Phi (byte[256]) buffer1#21 (word) 4096
 Redundant Phi (byte[1000]) SCREEN#10 (word) 1024
 Redundant Phi (byte*) RASTER#7 (word) 53266
 Redundant Phi (byte[256]) buffer1#5 (word) 4096
-Succesful SSA optimization dk.camelot64.kickc.icl.Pass2RedundantPhiElimination@4079d7b3
+Succesful SSA optimization Pass2RedundantPhiElimination
 CONTROL FLOW GRAPH
 @BEGIN: from
   call prepare param-assignment
@@ -1890,7 +1890,7 @@ Self Phi Eliminated (byte[256]) buffer2#2
 Self Phi Eliminated (byte) plot::y#2
 Self Phi Eliminated (byte*) plot::line#2
 Self Phi Eliminated (byte[256]) buffer1#11
-Succesful SSA optimization dk.camelot64.kickc.icl.Pass2SelfPhiElimination@7f4049d6
+Succesful SSA optimization Pass2SelfPhiElimination
 CONTROL FLOW GRAPH
 @BEGIN: from
   call prepare param-assignment
@@ -2046,7 +2046,7 @@ Simple Condition (boolean~) flip::$3 if((byte) flip::r#1!=(byte) 0) goto flip::@
 Simple Condition (boolean~) flip::$5 if((byte) flip::i#1!=(byte) 0) goto flip::@3
 Simple Condition (boolean~) plot::$4 if((byte) plot::x#1<(byte) 16) goto plot::@2
 Simple Condition (boolean~) plot::$6 if((byte) plot::y#1!=(byte) 0) goto plot::@1
-Succesful SSA optimization dk.camelot64.kickc.icl.Pass2ConditionalJumpSimplification@55afc1de
+Succesful SSA optimization Pass2ConditionalJumpSimplification
 CONTROL FLOW GRAPH
 @BEGIN: from
   call prepare param-assignment
@@ -2187,7 +2187,7 @@ plot::@return: from @15
 Culled Empty Block (label) @18
 Culled Empty Block (label) @5
 Culled Empty Block (label) @12
-Succesful SSA optimization dk.camelot64.kickc.icl.Pass2CullEmptyBlocks@21a34544
+Succesful SSA optimization Pass2CullEmptyBlocks
 CONTROL FLOW GRAPH
 @BEGIN: from
   call prepare param-assignment
@@ -2320,7 +2320,7 @@ plot::@return: from @15
 @END: from @20
 
 Constant (byte[256]) buffer1#1 (word) 4096
-Succesful SSA optimization dk.camelot64.kickc.icl.Pass2ConstantPropagation@742e84e1
+Succesful SSA optimization Pass2ConstantPropagation
 CONTROL FLOW GRAPH
 @BEGIN: from
   call prepare param-assignment
@@ -2464,7 +2464,7 @@ Alias (byte[256]) buffer1#2 = (byte[256]) buffer1#6 (byte[256]) buffer1#3
 Alias (byte) plot::y#2 = (byte) plot::y#4 
 Alias (byte*) plot::line#2 = (byte*) plot::line#4 
 Alias (byte[256]) buffer1#11 = (byte[256]) buffer1#8 
-Succesful SSA optimization dk.camelot64.kickc.icl.Pass2AliasElimination@3a1af7aa
+Succesful SSA optimization Pass2AliasElimination
 CONTROL FLOW GRAPH
 @BEGIN: from
   call prepare param-assignment
@@ -2584,7 +2584,7 @@ Self Phi Eliminated (byte*) RASTER#1
 Self Phi Eliminated (byte[256]) buffer1#2
 Self Phi Eliminated (byte[256]) buffer2#1
 Self Phi Eliminated (byte[256]) buffer1#11
-Succesful SSA optimization dk.camelot64.kickc.icl.Pass2SelfPhiElimination@7f4049d6
+Succesful SSA optimization Pass2SelfPhiElimination
 CONTROL FLOW GRAPH
 @BEGIN: from
   call prepare param-assignment
@@ -2703,7 +2703,7 @@ Alias (byte[256]) buffer2#1 = (byte[256]) buffer2#10 (byte[256]) buffer2#13
 Alias (byte[256]) buffer1#10 = (byte[256]) buffer1#20 (byte[256]) buffer1#2 (byte[256]) buffer1#11 
 Alias (byte[1000]) SCREEN#1 = (byte[1000]) SCREEN#9 
 Alias (byte*) RASTER#1 = (byte*) RASTER#5 
-Succesful SSA optimization dk.camelot64.kickc.icl.Pass2AliasElimination@3a1af7aa
+Succesful SSA optimization Pass2AliasElimination
 CONTROL FLOW GRAPH
 @BEGIN: from
   call prepare param-assignment
@@ -2813,7 +2813,7 @@ Self Phi Eliminated (byte[256]) buffer1#10
 Self Phi Eliminated (byte[256]) buffer2#1
 Self Phi Eliminated (byte[1000]) SCREEN#1
 Self Phi Eliminated (byte*) RASTER#1
-Succesful SSA optimization dk.camelot64.kickc.icl.Pass2SelfPhiElimination@7f4049d6
+Succesful SSA optimization Pass2SelfPhiElimination
 CONTROL FLOW GRAPH
 @BEGIN: from
   call prepare param-assignment
@@ -2923,7 +2923,7 @@ Constant (byte[256]) buffer1#10 (word) 4096
 Constant (byte[256]) buffer2#1 (word) 4352
 Constant (byte[1000]) SCREEN#1 (word) 1024
 Constant (byte*) RASTER#1 (word) 53266
-Succesful SSA optimization dk.camelot64.kickc.icl.Pass2ConstantPropagation@742e84e1
+Succesful SSA optimization Pass2ConstantPropagation
 CONTROL FLOW GRAPH
 @BEGIN: from
   call prepare param-assignment
@@ -3031,7 +3031,7 @@ Multiple usages for variable. Not optimizing sub-constant (byte) flip::i#2
 Multiple usages for variable. Not optimizing sub-constant (byte) flip::i#2
 Multiple usages for variable. Not optimizing sub-constant (byte) plot::i#2
 Culled Empty Block (label) @1
-Succesful SSA optimization dk.camelot64.kickc.icl.Pass2CullEmptyBlocks@21a34544
+Succesful SSA optimization Pass2CullEmptyBlocks
 CONTROL FLOW GRAPH
 @BEGIN: from
   call prepare param-assignment
@@ -3132,7 +3132,7 @@ plot::@return: from @15
 @END: from @20
 
 Constant (byte*) plot::line#0 (word) 1236
-Succesful SSA optimization dk.camelot64.kickc.icl.Pass2ConstantPropagation@742e84e1
+Succesful SSA optimization Pass2ConstantPropagation
 CONTROL FLOW GRAPH
 @BEGIN: from
   call prepare param-assignment
@@ -3461,7 +3461,7 @@ Removing instruction jmp flip__B3
 Removing instruction jmp flip__Breturn
 Removing instruction jmp prepare__B1
 Removing instruction jmp prepare__Breturn
-Succesful ASM optimization dk.camelot64.kickc.icl.Pass4NextJumpElimination@bb2d83d
+Succesful ASM optimization Pass4NextJumpElimination
 ASSEMBLER
 BBEGIN:
   jsr prepare
@@ -3651,7 +3651,7 @@ Removing instruction jmp flip__B1
 Removing instruction jmp flip__B2
 Removing instruction jmp flip__B3
 Removing instruction jmp prepare__B1
-Succesful ASM optimization dk.camelot64.kickc.icl.Pass4NextJumpElimination@bb2d83d
+Succesful ASM optimization Pass4NextJumpElimination
 ASSEMBLER
 BBEGIN:
   jsr prepare