feature: Add example program.

bugfix: Fix array assignment + argument register sizes.

Author: cburbridge

examples/prime.bl

@@ -0,0 +1,52 @@
+# Demo program that calculates prime numbers
+#
+# Compile:
+#    blangc prime.bl prime --ld_flags "-dynamic-linker /lib64/ld-linux-x86-64.so.2 -lc"
+#
+
+external def printf(fmt: <u8>, ...): u32
+external stdout : <u8>
+external def fflush(out: <u8>) : u32
+
+how_many:u32 = 100
+primes: u32[100]  # we can't say [how_many] because
+                  # consts dont exist yet
+count: u32 = 0
+
+def is_prime(n: u32): u8 {
+    v:u32 = n
+    if n < 2:
+      return 0
+
+    i: u32 = 0
+
+    # blocks can be indented or embraced
+    for 0..count as i:u32:
+        if primes[i] * primes[i] > n:
+          break
+        if v % primes[i] == 0:
+          return 0
+
+    return 1
+}
+
+def main(): u8 {
+    n: u32 = 2
+
+    while count <= how_many {
+        if is_prime(n) {
+            primes[count] = n
+            count = count + 1
+        }
+        # statements can be terminated with ;, or if not ambiguous
+        # then left unterminated
+        n = n + 1;
+    }
+
+    printf("First %d Prime Numbers\n", how_many);
+    for 0..count as i:u32:
+        printf("- %d is prime\n", primes[i])
+    fflush(stdout)
+
+    return 0
+}

src/blang/compiler/compiler.py

@@ -146,7 +146,7 @@ def import_node_to_filepath(node, imported_from: Path):
 def compile_import(node, context: Context) -> str:
     asm = []
     filename = import_node_to_filepath(node, context.filename)
-    print(filename)
+
     # open the file, read it, parse it,
     module = parse_file(filename)
 
@@ -448,7 +448,6 @@ def compile_block(node, context: Context):
     asm = []
     context.new_frame()
     for child in node.children:
-        print(child.type)
         code, registers = compile(child, context)
         asm.extend(code)
         for reg in registers:
@@ -480,7 +479,7 @@ def ensure_is_a_register(code, maybe_reg, context):
         reg = context.take_a_register()
         reg.type = maybe_reg.type
         reg.indirection_count = maybe_reg.indirection_count
-        code.append(f"mov {reg.full_reg}, {maybe_reg}")
+        code.append(f"mov {reg}, {maybe_reg}")
         return reg
 
 
@@ -842,6 +841,7 @@ def compile_assignment(node, context: Context):
         sizespec = SizeSpecifiers[identifier.size]
 
         asm = [
+            *asm,
             *code,
             f"mov {sizespec} [{target_address}], {reg}   ; {identifier}[...]=... ",  # assign the value
         ]
@@ -1436,5 +1436,5 @@ def compiler(file, debug=False):
 
     if not module:
         return None
-    print_tree(module)
+
     return compile(module, Context(filename=file))[0]

test/test_array_set.bl

@@ -7,6 +7,11 @@ def main(): u32 {
     i:u32 = 0
     local_array[0] = 20
     glob_array[0] = 7
+
+    i=3
+    local_array[i]=99
+    if local_array[3]!=99:
+      return 1
 
     return local_array[0]+glob_array[0]
 } 

test/test_divide.bl

@@ -61,6 +61,9 @@ def print_number(number: u64) :u8{
     return 0;
 }
 
+def pass_u32(in:u32):u32:
+   other:u32 = in
+   return other
 
 def main(): u8 {
     a:u64 = 19302
@@ -95,5 +98,11 @@ def main(): u8 {
     if i32|-10| / i32|5| != -2 { return 2}
 
     if i32|10| / i32|-5| != -2 { return 3}
-    return 0
+
+
+    if 5 %    3 != 2:
+      return 4
+
+    if pass_u32(99) != 99:
+       return 5
 } 

test/test_printf.bl

@@ -1,6 +1,6 @@
 # expected_exit_code = 0
 # ***ld_flag*** -lc
-# ***ld_flag*** -dynamic-linker /lib64/ld-linux-x86-64.so.2
+# ***ld_flag***  -dynamic-linker /lib64/ld-linux-x86-64.so.2
 # ***expected output***
 # ****
 # The value is 272727