Added test for recursive #define. #169

src/test/java/dk/camelot64/kickc/test/TestPrograms.java

@@ -37,9 +37,14 @@ public class TestPrograms {
    public TestPrograms() {
    }
 
+   @Test
+   public void testPreprocessor6() throws IOException, URISyntaxException {
+      compileAndCompare("preprocessor-6");
+   }
+
    @Test
    public void testPreprocessor5() throws IOException, URISyntaxException {
-      compileAndCompare("preprocessor-5", log());
+      compileAndCompare("preprocessor-5");
    }
 
    @Test

src/test/kc/preprocessor-6.kc

@@ -0,0 +1,13 @@
+// Test the preprocessor
+// Test macro recursion
+
+char A = 'a';
+
+#define A A+1
+
+char * SCREEN = 0x0400;
+char idx = 0;
+
+void main() {
+    SCREEN[idx++] = A;
+}

src/test/ref/preprocessor-6.asm

@@ -0,0 +1,14 @@
+// Test the preprocessor
+// Test macro recursion
+.pc = $801 "Basic"
+:BasicUpstart(main)
+.pc = $80d "Program"
+  .const A = 'a'
+  .label SCREEN = $400
+main: {
+    // SCREEN[idx++] = A
+    lda #A+1
+    sta SCREEN
+    // }
+    rts
+}

src/test/ref/preprocessor-6.cfg

@@ -0,0 +1,17 @@
+@begin: scope:[]  from
+  [0] phi()
+  to:@1
+@1: scope:[]  from @begin
+  [1] phi()
+  [2] call main 
+  to:@end
+@end: scope:[]  from @1
+  [3] phi()
+
+(void()) main()
+main: scope:[main]  from @1
+  [4] *((const byte*) SCREEN) ← (const byte) A+(byte) 1
+  to:main::@return
+main::@return: scope:[main]  from main
+  [5] return 
+  to:@return

src/test/ref/preprocessor-6.log

@@ -0,0 +1,269 @@
+Identified constant variable (byte) A
+Identified constant variable (byte*) SCREEN
+
+CONTROL FLOW GRAPH SSA
+@begin: scope:[]  from
+  (byte) idx#0 ← (byte) 0
+  to:@1
+
+(void()) main()
+main: scope:[main]  from @1
+  (byte) idx#4 ← phi( @1/(byte) idx#7 )
+  (number~) main::$0 ← (const byte) A + (number) 1
+  *((const byte*) SCREEN + (byte) idx#4) ← (number~) main::$0
+  (byte) idx#1 ← ++ (byte) idx#4
+  to:main::@return
+main::@return: scope:[main]  from main
+  (byte) idx#5 ← phi( main/(byte) idx#1 )
+  (byte) idx#2 ← (byte) idx#5
+  return 
+  to:@return
+@1: scope:[]  from @begin
+  (byte) idx#7 ← phi( @begin/(byte) idx#0 )
+  call main 
+  to:@2
+@2: scope:[]  from @1
+  (byte) idx#6 ← phi( @1/(byte) idx#2 )
+  (byte) idx#3 ← (byte) idx#6
+  to:@end
+@end: scope:[]  from @2
+
+SYMBOL TABLE SSA
+(label) @1
+(label) @2
+(label) @begin
+(label) @end
+(const byte) A = (byte) 'a'
+(const byte*) SCREEN = (byte*)(number) $400
+(byte) idx
+(byte) idx#0
+(byte) idx#1
+(byte) idx#2
+(byte) idx#3
+(byte) idx#4
+(byte) idx#5
+(byte) idx#6
+(byte) idx#7
+(void()) main()
+(number~) main::$0
+(label) main::@return
+
+Adding number conversion cast (unumber) 1 in (number~) main::$0 ← (const byte) A + (number) 1
+Adding number conversion cast (unumber) main::$0 in (number~) main::$0 ← (const byte) A + (unumber)(number) 1
+Successful SSA optimization PassNAddNumberTypeConversions
+Simplifying constant pointer cast (byte*) 1024
+Simplifying constant integer cast 1
+Successful SSA optimization PassNCastSimplification
+Finalized unsigned number type (byte) 1
+Successful SSA optimization PassNFinalizeNumberTypeConversions
+Inferred type updated to byte in (unumber~) main::$0 ← (const byte) A + (byte) 1
+Alias idx#1 = idx#5 idx#2 
+Alias idx#0 = idx#7 
+Alias idx#3 = idx#6 
+Successful SSA optimization Pass2AliasElimination
+Identical Phi Values (byte) idx#4 (byte) idx#0
+Identical Phi Values (byte) idx#3 (byte) idx#1
+Successful SSA optimization Pass2IdenticalPhiElimination
+Constant right-side identified [2] (byte~) main::$0 ← (const byte) A + (byte) 1
+Successful SSA optimization Pass2ConstantRValueConsolidation
+Constant (const byte) idx#0 = 0
+Constant (const byte) main::$0 = A+1
+Successful SSA optimization Pass2ConstantIdentification
+Simplifying expression containing zero SCREEN in [3] *((const byte*) SCREEN + (const byte) idx#0) ← (const byte) main::$0
+Successful SSA optimization PassNSimplifyExpressionWithZero
+Eliminating unused variable (byte) idx#1 and assignment [1] (byte) idx#1 ← ++ (const byte) idx#0
+Successful SSA optimization PassNEliminateUnusedVars
+Eliminating unused constant (const byte) idx#0
+Successful SSA optimization PassNEliminateUnusedVars
+Constant inlined main::$0 = (const byte) A+(byte) 1
+Successful SSA optimization Pass2ConstantInlining
+Adding NOP phi() at start of @begin
+Adding NOP phi() at start of @1
+Adding NOP phi() at start of @2
+Adding NOP phi() at start of @end
+CALL GRAPH
+Calls in [] to main:2 
+
+Created 0 initial phi equivalence classes
+Coalesced down to 0 phi equivalence classes
+Culled Empty Block (label) @2
+Adding NOP phi() at start of @begin
+Adding NOP phi() at start of @1
+Adding NOP phi() at start of @end
+
+FINAL CONTROL FLOW GRAPH
+@begin: scope:[]  from
+  [0] phi()
+  to:@1
+@1: scope:[]  from @begin
+  [1] phi()
+  [2] call main 
+  to:@end
+@end: scope:[]  from @1
+  [3] phi()
+
+(void()) main()
+main: scope:[main]  from @1
+  [4] *((const byte*) SCREEN) ← (const byte) A+(byte) 1
+  to:main::@return
+main::@return: scope:[main]  from main
+  [5] return 
+  to:@return
+
+
+VARIABLE REGISTER WEIGHTS
+(byte) idx
+(void()) main()
+
+Initial phi equivalence classes
+Complete equivalence classes
+
+INITIAL ASM
+Target platform is c64basic / MOS6502X
+  // File Comments
+// Test the preprocessor
+// Test macro recursion
+  // Upstart
+.pc = $801 "Basic"
+:BasicUpstart(__bbegin)
+.pc = $80d "Program"
+  // Global Constants & labels
+  .const A = 'a'
+  .label SCREEN = $400
+  // @begin
+__bbegin:
+  // [1] phi from @begin to @1 [phi:@begin->@1]
+__b1_from___bbegin:
+  jmp __b1
+  // @1
+__b1:
+  // [2] call main 
+  jsr main
+  // [3] phi from @1 to @end [phi:@1->@end]
+__bend_from___b1:
+  jmp __bend
+  // @end
+__bend:
+  // main
+main: {
+    // [4] *((const byte*) SCREEN) ← (const byte) A+(byte) 1 -- _deref_pbuc1=vbuc2 
+    lda #A+1
+    sta SCREEN
+    jmp __breturn
+    // main::@return
+  __breturn:
+    // [5] return 
+    rts
+}
+  // File Data
+
+REGISTER UPLIFT POTENTIAL REGISTERS
+Statement [4] *((const byte*) SCREEN) ← (const byte) A+(byte) 1 [ ] ( main:2 [ ] { }  ) always clobbers reg byte a 
+
+REGISTER UPLIFT SCOPES
+Uplift Scope [main] 
+Uplift Scope [] 
+
+Uplifting [main] best 27 combination 
+Uplifting [] best 27 combination 
+
+ASSEMBLER BEFORE OPTIMIZATION
+  // File Comments
+// Test the preprocessor
+// Test macro recursion
+  // Upstart
+.pc = $801 "Basic"
+:BasicUpstart(__bbegin)
+.pc = $80d "Program"
+  // Global Constants & labels
+  .const A = 'a'
+  .label SCREEN = $400
+  // @begin
+__bbegin:
+  // [1] phi from @begin to @1 [phi:@begin->@1]
+__b1_from___bbegin:
+  jmp __b1
+  // @1
+__b1:
+  // [2] call main 
+  jsr main
+  // [3] phi from @1 to @end [phi:@1->@end]
+__bend_from___b1:
+  jmp __bend
+  // @end
+__bend:
+  // main
+main: {
+    // [4] *((const byte*) SCREEN) ← (const byte) A+(byte) 1 -- _deref_pbuc1=vbuc2 
+    lda #A+1
+    sta SCREEN
+    jmp __breturn
+    // main::@return
+  __breturn:
+    // [5] return 
+    rts
+}
+  // File Data
+
+ASSEMBLER OPTIMIZATIONS
+Removing instruction jmp __b1
+Removing instruction jmp __bend
+Removing instruction jmp __breturn
+Succesful ASM optimization Pass5NextJumpElimination
+Removing instruction __b1_from___bbegin:
+Removing instruction __b1:
+Removing instruction __bend_from___b1:
+Succesful ASM optimization Pass5RedundantLabelElimination
+Removing instruction __bend:
+Removing instruction __breturn:
+Succesful ASM optimization Pass5UnusedLabelElimination
+Updating BasicUpstart to call main directly
+Removing instruction jsr main
+Succesful ASM optimization Pass5SkipBegin
+Removing instruction __bbegin:
+Succesful ASM optimization Pass5UnusedLabelElimination
+
+FINAL SYMBOL TABLE
+(label) @1
+(label) @begin
+(label) @end
+(const byte) A = (byte) 'a'
+(const byte*) SCREEN = (byte*) 1024
+(byte) idx
+(void()) main()
+(label) main::@return
+
+
+
+FINAL ASSEMBLER
+Score: 12
+
+  // File Comments
+// Test the preprocessor
+// Test macro recursion
+  // Upstart
+.pc = $801 "Basic"
+:BasicUpstart(main)
+.pc = $80d "Program"
+  // Global Constants & labels
+  .const A = 'a'
+  .label SCREEN = $400
+  // @begin
+  // [1] phi from @begin to @1 [phi:@begin->@1]
+  // @1
+  // [2] call main 
+  // [3] phi from @1 to @end [phi:@1->@end]
+  // @end
+  // main
+main: {
+    // SCREEN[idx++] = A
+    // [4] *((const byte*) SCREEN) ← (const byte) A+(byte) 1 -- _deref_pbuc1=vbuc2 
+    lda #A+1
+    sta SCREEN
+    // main::@return
+    // }
+    // [5] return 
+    rts
+}
+  // File Data
+

src/test/ref/preprocessor-6.sym

@@ -0,0 +1,9 @@
+(label) @1
+(label) @begin
+(label) @end
+(const byte) A = (byte) 'a'
+(const byte*) SCREEN = (byte*) 1024
+(byte) idx
+(void()) main()
+(label) main::@return
+