commit 148da8ed91f17c6fb367f52c927629b0f4cacb5e Author: Eugen Wissner Date: Fri Apr 18 09:26:57 2025 +0200 Initial commit diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..0ee919a --- /dev/null +++ b/.gitignore @@ -0,0 +1,2 @@ +/build/ +a.out diff --git a/LICENSE b/LICENSE new file mode 100644 index 0000000..a612ad9 --- /dev/null +++ b/LICENSE @@ -0,0 +1,373 @@ +Mozilla Public License Version 2.0 +================================== + +1. Definitions +-------------- + +1.1. "Contributor" + means each individual or legal entity that creates, contributes to + the creation of, or owns Covered Software. + +1.2. "Contributor Version" + means the combination of the Contributions of others (if any) used + by a Contributor and that particular Contributor's Contribution. + +1.3. "Contribution" + means Covered Software of a particular Contributor. + +1.4. "Covered Software" + means Source Code Form to which the initial Contributor has attached + the notice in Exhibit A, the Executable Form of such Source Code + Form, and Modifications of such Source Code Form, in each case + including portions thereof. + +1.5. "Incompatible With Secondary Licenses" + means + + (a) that the initial Contributor has attached the notice described + in Exhibit B to the Covered Software; or + + (b) that the Covered Software was made available under the terms of + version 1.1 or earlier of the License, but not also under the + terms of a Secondary License. + +1.6. "Executable Form" + means any form of the work other than Source Code Form. + +1.7. "Larger Work" + means a work that combines Covered Software with other material, in + a separate file or files, that is not Covered Software. + +1.8. "License" + means this document. + +1.9. "Licensable" + means having the right to grant, to the maximum extent possible, + whether at the time of the initial grant or subsequently, any and + all of the rights conveyed by this License. + +1.10. "Modifications" + means any of the following: + + (a) any file in Source Code Form that results from an addition to, + deletion from, or modification of the contents of Covered + Software; or + + (b) any new file in Source Code Form that contains any Covered + Software. + +1.11. "Patent Claims" of a Contributor + means any patent claim(s), including without limitation, method, + process, and apparatus claims, in any patent Licensable by such + Contributor that would be infringed, but for the grant of the + License, by the making, using, selling, offering for sale, having + made, import, or transfer of either its Contributions or its + Contributor Version. + +1.12. "Secondary License" + means either the GNU General Public License, Version 2.0, the GNU + Lesser General Public License, Version 2.1, the GNU Affero General + Public License, Version 3.0, or any later versions of those + licenses. + +1.13. "Source Code Form" + means the form of the work preferred for making modifications. + +1.14. "You" (or "Your") + means an individual or a legal entity exercising rights under this + License. For legal entities, "You" includes any entity that + controls, is controlled by, or is under common control with You. For + purposes of this definition, "control" means (a) the power, direct + or indirect, to cause the direction or management of such entity, + whether by contract or otherwise, or (b) ownership of more than + fifty percent (50%) of the outstanding shares or beneficial + ownership of such entity. + +2. License Grants and Conditions +-------------------------------- + +2.1. Grants + +Each Contributor hereby grants You a world-wide, royalty-free, +non-exclusive license: + +(a) under intellectual property rights (other than patent or trademark) + Licensable by such Contributor to use, reproduce, make available, + modify, display, perform, distribute, and otherwise exploit its + Contributions, either on an unmodified basis, with Modifications, or + as part of a Larger Work; and + +(b) under Patent Claims of such Contributor to make, use, sell, offer + for sale, have made, import, and otherwise transfer either its + Contributions or its Contributor Version. + +2.2. Effective Date + +The licenses granted in Section 2.1 with respect to any Contribution +become effective for each Contribution on the date the Contributor first +distributes such Contribution. + +2.3. Limitations on Grant Scope + +The licenses granted in this Section 2 are the only rights granted under +this License. No additional rights or licenses will be implied from the +distribution or licensing of Covered Software under this License. +Notwithstanding Section 2.1(b) above, no patent license is granted by a +Contributor: + +(a) for any code that a Contributor has removed from Covered Software; + or + +(b) for infringements caused by: (i) Your and any other third party's + modifications of Covered Software, or (ii) the combination of its + Contributions with other software (except as part of its Contributor + Version); or + +(c) under Patent Claims infringed by Covered Software in the absence of + its Contributions. + +This License does not grant any rights in the trademarks, service marks, +or logos of any Contributor (except as may be necessary to comply with +the notice requirements in Section 3.4). + +2.4. Subsequent Licenses + +No Contributor makes additional grants as a result of Your choice to +distribute the Covered Software under a subsequent version of this +License (see Section 10.2) or under the terms of a Secondary License (if +permitted under the terms of Section 3.3). + +2.5. Representation + +Each Contributor represents that the Contributor believes its +Contributions are its original creation(s) or it has sufficient rights +to grant the rights to its Contributions conveyed by this License. + +2.6. Fair Use + +This License is not intended to limit any rights You have under +applicable copyright doctrines of fair use, fair dealing, or other +equivalents. + +2.7. Conditions + +Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted +in Section 2.1. + +3. Responsibilities +------------------- + +3.1. Distribution of Source Form + +All distribution of Covered Software in Source Code Form, including any +Modifications that You create or to which You contribute, must be under +the terms of this License. You must inform recipients that the Source +Code Form of the Covered Software is governed by the terms of this +License, and how they can obtain a copy of this License. You may not +attempt to alter or restrict the recipients' rights in the Source Code +Form. + +3.2. Distribution of Executable Form + +If You distribute Covered Software in Executable Form then: + +(a) such Covered Software must also be made available in Source Code + Form, as described in Section 3.1, and You must inform recipients of + the Executable Form how they can obtain a copy of such Source Code + Form by reasonable means in a timely manner, at a charge no more + than the cost of distribution to the recipient; and + +(b) You may distribute such Executable Form under the terms of this + License, or sublicense it under different terms, provided that the + license for the Executable Form does not attempt to limit or alter + the recipients' rights in the Source Code Form under this License. + +3.3. Distribution of a Larger Work + +You may create and distribute a Larger Work under terms of Your choice, +provided that You also comply with the requirements of this License for +the Covered Software. If the Larger Work is a combination of Covered +Software with a work governed by one or more Secondary Licenses, and the +Covered Software is not Incompatible With Secondary Licenses, this +License permits You to additionally distribute such Covered Software +under the terms of such Secondary License(s), so that the recipient of +the Larger Work may, at their option, further distribute the Covered +Software under the terms of either this License or such Secondary +License(s). + +3.4. Notices + +You may not remove or alter the substance of any license notices +(including copyright notices, patent notices, disclaimers of warranty, +or limitations of liability) contained within the Source Code Form of +the Covered Software, except that You may alter any license notices to +the extent required to remedy known factual inaccuracies. + +3.5. Application of Additional Terms + +You may choose to offer, and to charge a fee for, warranty, support, +indemnity or liability obligations to one or more recipients of Covered +Software. However, You may do so only on Your own behalf, and not on +behalf of any Contributor. You must make it absolutely clear that any +such warranty, support, indemnity, or liability obligation is offered by +You alone, and You hereby agree to indemnify every Contributor for any +liability incurred by such Contributor as a result of warranty, support, +indemnity or liability terms You offer. You may include additional +disclaimers of warranty and limitations of liability specific to any +jurisdiction. + +4. Inability to Comply Due to Statute or Regulation +--------------------------------------------------- + +If it is impossible for You to comply with any of the terms of this +License with respect to some or all of the Covered Software due to +statute, judicial order, or regulation then You must: (a) comply with +the terms of this License to the maximum extent possible; and (b) +describe the limitations and the code they affect. Such description must +be placed in a text file included with all distributions of the Covered +Software under this License. Except to the extent prohibited by statute +or regulation, such description must be sufficiently detailed for a +recipient of ordinary skill to be able to understand it. + +5. Termination +-------------- + +5.1. The rights granted under this License will terminate automatically +if You fail to comply with any of its terms. However, if You become +compliant, then the rights granted under this License from a particular +Contributor are reinstated (a) provisionally, unless and until such +Contributor explicitly and finally terminates Your grants, and (b) on an +ongoing basis, if such Contributor fails to notify You of the +non-compliance by some reasonable means prior to 60 days after You have +come back into compliance. Moreover, Your grants from a particular +Contributor are reinstated on an ongoing basis if such Contributor +notifies You of the non-compliance by some reasonable means, this is the +first time You have received notice of non-compliance with this License +from such Contributor, and You become compliant prior to 30 days after +Your receipt of the notice. + +5.2. If You initiate litigation against any entity by asserting a patent +infringement claim (excluding declaratory judgment actions, +counter-claims, and cross-claims) alleging that a Contributor Version +directly or indirectly infringes any patent, then the rights granted to +You by any and all Contributors for the Covered Software under Section +2.1 of this License shall terminate. + +5.3. In the event of termination under Sections 5.1 or 5.2 above, all +end user license agreements (excluding distributors and resellers) which +have been validly granted by You or Your distributors under this License +prior to termination shall survive termination. + +************************************************************************ +* * +* 6. Disclaimer of Warranty * +* ------------------------- * +* * +* Covered Software is provided under this License on an "as is" * +* basis, without warranty of any kind, either expressed, implied, or * +* statutory, including, without limitation, warranties that the * +* Covered Software is free of defects, merchantable, fit for a * +* particular purpose or non-infringing. The entire risk as to the * +* quality and performance of the Covered Software is with You. * +* Should any Covered Software prove defective in any respect, You * +* (not any Contributor) assume the cost of any necessary servicing, * +* repair, or correction. This disclaimer of warranty constitutes an * +* essential part of this License. No use of any Covered Software is * +* authorized under this License except under this disclaimer. * +* * +************************************************************************ + +************************************************************************ +* * +* 7. Limitation of Liability * +* -------------------------- * +* * +* Under no circumstances and under no legal theory, whether tort * +* (including negligence), contract, or otherwise, shall any * +* Contributor, or anyone who distributes Covered Software as * +* permitted above, be liable to You for any direct, indirect, * +* special, incidental, or consequential damages of any character * +* including, without limitation, damages for lost profits, loss of * +* goodwill, work stoppage, computer failure or malfunction, or any * +* and all other commercial damages or losses, even if such party * +* shall have been informed of the possibility of such damages. This * +* limitation of liability shall not apply to liability for death or * +* personal injury resulting from such party's negligence to the * +* extent applicable law prohibits such limitation. Some * +* jurisdictions do not allow the exclusion or limitation of * +* incidental or consequential damages, so this exclusion and * +* limitation may not apply to You. * +* * +************************************************************************ + +8. Litigation +------------- + +Any litigation relating to this License may be brought only in the +courts of a jurisdiction where the defendant maintains its principal +place of business and such litigation shall be governed by laws of that +jurisdiction, without reference to its conflict-of-law provisions. +Nothing in this Section shall prevent a party's ability to bring +cross-claims or counter-claims. + +9. Miscellaneous +---------------- + +This License represents the complete agreement concerning the subject +matter hereof. If any provision of this License is held to be +unenforceable, such provision shall be reformed only to the extent +necessary to make it enforceable. Any law or regulation which provides +that the language of a contract shall be construed against the drafter +shall not be used to construe this License against a Contributor. + +10. Versions of the License +--------------------------- + +10.1. New Versions + +Mozilla Foundation is the license steward. Except as provided in Section +10.3, no one other than the license steward has the right to modify or +publish new versions of this License. Each version will be given a +distinguishing version number. + +10.2. Effect of New Versions + +You may distribute the Covered Software under the terms of the version +of the License under which You originally received the Covered Software, +or under the terms of any subsequent version published by the license +steward. + +10.3. Modified Versions + +If you create software not governed by this License, and you want to +create a new license for such software, you may create and use a +modified version of this License if you rename the license and remove +any references to the name of the license steward (except to note that +such modified license differs from this License). + +10.4. Distributing Source Code Form that is Incompatible With Secondary +Licenses + +If You choose to distribute Source Code Form that is Incompatible With +Secondary Licenses under the terms of this version of the License, the +notice described in Exhibit B of this License must be attached. + +Exhibit A - Source Code Form License Notice +------------------------------------------- + + This Source Code Form is subject to the terms of the Mozilla Public + License, v. 2.0. If a copy of the MPL was not distributed with this + file, You can obtain one at http://mozilla.org/MPL/2.0/. + +If it is not possible or desirable to put the notice in a particular +file, then You may include the notice in a location (such as a LICENSE +file in a relevant directory) where a recipient would be likely to look +for such a notice. + +You may add additional accurate notices of copyright ownership. + +Exhibit B - "Incompatible With Secondary Licenses" Notice +--------------------------------------------------------- + + This Source Code Form is "Incompatible With Secondary Licenses", as + defined by the Mozilla Public License, v. 2.0. diff --git a/README.md b/README.md new file mode 100644 index 0000000..b2fdf0a --- /dev/null +++ b/README.md @@ -0,0 +1,11 @@ +# Elna programming language + +Elna is a simple, imperative, low-level programming language. + +It is intendet to accompany other languages in the areas, where a high-level +language doesn't fit well. It is also supposed to be an intermediate +representation for a such high-level hypothetical programming language. + +## File extension + +.elna diff --git a/boot/asm-boot.s b/boot/asm-boot.s new file mode 100644 index 0000000..594c624 --- /dev/null +++ b/boot/asm-boot.s @@ -0,0 +1,29 @@ +# s1 - Contains the current position in the source text. + +.data + +.equ SYS_EXIT, 93 +.equ SOURCE_BUFFER_SIZE, 2048 + +.bss +.global source_code +.type source_code, @object +.size source_code, SOURCE_BUFFER_SIZE +source_code: .zero SOURCE_BUFFER_SIZE + +.text +.global _start # Program entry point. + +_start: + # Read the source from the standard input. + la a0, source_code + li a1, SOURCE_BUFFER_SIZE # Buffer size. + call read_file + + la s1, source_code # s1 = Source code position. + call compile + + # Call exit. + addi a0, zero, 0 # Use 0 return code. + addi a7, zero, SYS_EXIT + ecall diff --git a/boot/common-boot.s b/boot/common-boot.s new file mode 100644 index 0000000..1ad60a4 --- /dev/null +++ b/boot/common-boot.s @@ -0,0 +1,994 @@ +.data + +.equ SYS_READ, 63 +.equ SYS_WRITE, 64 +.equ STDIN, 0 +.equ STDOUT, 1 +.equ STDERR, 2 + +token_begin: .string "begin" +token_end: .string "end" +token_import: .string "import" +token_open_paren: .string "(" +token_close_paren: .string ")" +token_open_square: .string "[" +token_assign: .string ":=" +token_var: .string "var" +token_comma: .string "," + +space: .ascii " " +comma: .ascii "," +new_line: .ascii "\n" +colon: .ascii ":" +digit_zero: .ascii "0" + +instruction_la: .ascii "la" +instruction_call: .ascii "call" +instruction_addi: .ascii "addi" +instruction_li: .ascii "li" +instruction_sw: .ascii "sw" +instruction_lw: .ascii "lw" + +register_a0: .ascii "a0" +register_sp: .ascii "sp" +register_a: .ascii "a" + +asm_program: .ascii ".bss\n" +.equ ASM_PROGRAM_SIZE, . - asm_program +asm_begin: .ascii ".text\n.global _start\n_start:\naddi sp, sp, -64\nsw ra, 60(sp)\nsw s0, 56(sp)\naddi s0, sp, 64\n" +.equ ASM_BEGIN_SIZE, . - asm_begin +asm_end: .ascii "addi a0, zero, 0\naddi a7, zero, 93\necall\nlw ra, 60(sp)\nlw s0, 56(sp)\naddi sp, sp, 64\nret\n" +.equ ASM_END_SIZE, . - asm_end +asm_type: .ascii ".type " +.equ ASM_TYPE_SIZE, . - asm_type +asm_object: .ascii ", @object\n" +.equ ASM_OBJECT_SIZE, . - asm_object +asm_size: .ascii ".size " +.equ ASM_SIZE_SIZE, . - asm_size +asm_zero: .ascii ".zero " +.equ ASM_ZERO_SIZE, . - asm_zero +asm_global: .ascii ".global " +.equ ASM_GLOBAL_SIZE, . - asm_global + +.text +.global is_alpha, is_digit, is_alnum, compile, write_out, read_file + +# Detects if the passed character is a 7-bit alpha character or an underscore. +# The character is passed in a0. +# Sets a0 to 1 if the character is an alpha character or underscore, sets it to 0 otherwise. +.type is_alpha, @function +is_alpha: + li t0, 'A' - 1 + sltu t1, t0, a0 # t1 = a0 >= 'A' + + sltiu t2, a0, 'Z' + 1 # t2 = a0 <= 'Z' + and t1, t1, t2 # t1 = a0 >= 'A' & a0 <= 'Z' + + li t0, 'a' - 1 + sltu t2, t0, a0 # t2 = a0 >= 'a' + + sltiu t3, a0, 'z' + 1 # t3 = a0 <= 'z' + and t2, t2, t3 # t2 = a0 >= 'a' & a0 <= 'z' + + xori t3, a0, '_' + seqz t3, t3 + + or a0, t1, t2 + or a0, a0, t3 + ret + +.type is_digit, @function +is_digit: + li t0, '0' - 1 + sltu t1, t0, a0 # t1 = a0 >= '0' + + sltiu t2, a0, '9' + 1 # t2 = a0 <= '9' + + and a0, t1, t2 + + ret + +.type is_alnum, @function +is_alnum: + # Prologue. + addi sp, sp, -16 + sw ra, 12(sp) + sw s0, 8(sp) + addi s0, sp, 16 + + sw a0, 4(sp) + + call is_alpha + sw a0, 0(sp) + + lw a0, 4(sp) + call is_digit + + lw a1, 0(sp) + or a0, a0, a1 + + # Epilogue. + lw ra, 12(sp) + lw s0, 8(sp) + addi sp, sp, 16 + ret + +.type _skip_spaces, @function +_skip_spaces: +.Lspace_loop_do: + lbu t0, (s1) # t0 = Current character. + + li t1, ' ' + beq t0, t1, .Lspace_loop_repeat + li t1, '\t' + beq t0, t1, .Lspace_loop_repeat + li t1, '\n' + beq t0, t1, .Lspace_loop_repeat + li t1, '\r' + beq t0, t1, .Lspace_loop_repeat + + j .Lspace_loop_end +.Lspace_loop_repeat: + addi s1, s1, 1 + j .Lspace_loop_do + +.Lspace_loop_end: + ret + +# Compares two string, which of one has a length, the other one is null-terminated. +# +# a0 - The address of the token string. +# a1 - The length of the string in a0. +# a2 - The address of the null-terminated string. +# +# If the strings match sets a0 to 0, otherwise sets it to 1. +.type _token_compare, @function +_token_compare: + addi t0, a0, 0 + addi t1, a1, 0 + addi t2, a2, 0 + +.Ltoken_compare_loop: + lbu t3, (t2) + + # Will only be 0 if the current character in the null terminated string is \0 and the remaining length of the + # another string is 0. + or t4, t3, t1 + beqz t4, .Ltoken_compare_equal + + beqz t1, .Ltoken_compare_not_equal + beqz t3, .Ltoken_compare_not_equal + + lbu t4, (t0) + bne t3, t4, .Ltoken_compare_not_equal + + addi t0, t0, 1 + addi t1, t1, -1 + addi t2, t2, 1 + j .Ltoken_compare_loop + +.Ltoken_compare_not_equal: + li a0, 1 + j .Ltoken_compare_end + +.Ltoken_compare_equal: + li a0, 0 + +.Ltoken_compare_end: + ret + +# Reads a token and returns its length in a0. +# _read_token doesn't change s1, it finds the length of the token s1 is pointing to. +.type _read_token, @function +_read_token: + # Prologue. + addi sp, sp, -16 + sw ra, 12(sp) + sw s0, 8(sp) + addi s0, sp, 16 + + lbu t0, (s1) # t0 = Current character. + sw zero, 4(sp) + + li t1, '.' + beq t0, t1, .Ltoken_character_single + + li t1, ',' + beq t0, t1, .Ltoken_character_single + + li t1, ':' + beq t0, t1, .Ltoken_character_colon + + li t1, ';' + beq t0, t1, .Ltoken_character_single + + li t1, '(' + beq t0, t1, .Ltoken_character_single + + li t1, ')' + beq t0, t1, .Ltoken_character_single + + li t1, '[' + beq t0, t1, .Ltoken_character_single + + li t1, ']' + beq t0, t1, .Ltoken_character_single + +.Ltoken_character_loop_do: # Expect an identifier or a number. + lw t6, 4(sp) + add t1, s1, t6 + lbu a0, (t1) # a0 = Current character. + + call is_alnum + + beqz a0, .Ltoken_character_end + lw t6, 4(sp) + addi t6, t6, 1 + sw t6, 4(sp) + j .Ltoken_character_loop_do + +.Ltoken_character_single: + lw t6, 4(sp) + addi t6, t6, 1 + sw t6, 4(sp) + j .Ltoken_character_end + +.Ltoken_character_colon: + lbu t0, 1(s1) # t0 = The character after the colon. + lw t6, 4(sp) + addi t6, t6, 1 + sw t6, 4(sp) + + li t1, '=' + beq t0, t1, .Ltoken_character_single + j .Ltoken_character_end + +.Ltoken_character_end: + lw a0, 4(sp) + + # Epilogue. + lw ra, 12(sp) + lw s0, 8(sp) + addi sp, sp, 16 + ret + +# Generate entry point symbol. +.type _compile_begin, @function +_compile_begin: + # Prologue. + addi sp, sp, -8 + sw ra, 4(sp) + sw s0, 0(sp) + addi s0, sp, 8 + + # Write initial assembler. + la a0, asm_begin + addi a1, zero, ASM_BEGIN_SIZE + call write_out + + addi s1, s1, 5 + + # Epilogue. + lw ra, 4(sp) + lw s0, 0(sp) + addi sp, sp, 8 + ret + +# Generate program termination code. +.type _compile_end, @function +_compile_end: + # Prologue. + addi sp, sp, -8 + sw ra, 4(sp) + sw s0, 0(sp) + addi s0, sp, 8 + + # Write closing assembler. + la a0, asm_end + addi a1, zero, ASM_END_SIZE + call write_out + + addi s1, s1, 3 + + # Epilogue. + lw ra, 4(sp) + lw s0, 0(sp) + addi sp, sp, 8 + ret + +# Ignores the import. +.type _compile_import, @function +_compile_import: + # Prologue. + addi sp, sp, -8 + sw ra, 4(sp) + sw s0, 0(sp) + addi s0, sp, 8 + + addi s1, s1, 6 + call _skip_spaces + call _read_token + add s1, s1, a0 # Skip the imported module name. + + # Epilogue. + lw ra, 4(sp) + lw s0, 0(sp) + addi sp, sp, 8 + ret + +# Compiles a procedure call. Expects s1 to point to the first argument. +# a0 - Pointer to the procedure name. +# a1 - Length of the procedure name. +# +# Returns the procedure result in a0. +.type _compile_call, @function +_compile_call: + # Prologue. + addi sp, sp, -32 + sw ra, 28(sp) + sw s0, 24(sp) + addi s0, sp, 32 + + sw a0, 20(sp) + sw a1, 16(sp) + sw zero, 12(sp) # Argument count for a procedure call. + +.Lcompile_call_paren: + call _skip_spaces + call _read_token + addi a1, a0, 0 + addi a0, s1, 0 + la a2, token_close_paren + call _token_compare + beqz a0, .Lcompile_call_complete + +.Lcompile_call_argument: + call _build_expression + + la a0, instruction_sw + li a1, 2 + call write_out + + la a0, space + li a1, 1 + call write_out + + la a0, register_a0 + li a1, 2 + call write_out + + la a0, comma + li a1, 1 + call write_out + + lw t0, 12(sp) # Argument count for a procedure call. + + # Only 8 arguments are supported with a0-a7. + # Save all arguments on the stack so they aren't overriden afterwards. + # The offset on the stack always has two digits in this case. + li t1, -4 + mul t1, t0, t1 + addi t1, t1, 52 + li t2, 10 + div t3, t1, t2 + rem t4, t1, t2 + addi t3, t3, '0' + addi t4, t4, '0' + + sw t3, 8(sp) + sw t4, 4(sp) + + addi a0, sp, 8 + li a1, 1 + call write_out + + addi a0, sp, 4 + li a1, 1 + call write_out + + la a0, token_open_paren + li a1, 1 + call write_out + + la a0, register_sp + li a1, 2 + call write_out + + la a0, token_close_paren + li a1, 1 + call write_out + + la a0, new_line + li a1, 1 + call write_out + + call _skip_spaces + call _read_token + addi a1, a0, 0 + addi a0, s1, 0 + la a2, token_comma + call _token_compare + + /* DEBUG. Write the current token to stderr. + addi a0, zero, STDERR + addi a1, s1, 0 + li a2, 4 #(sp) + addi a7, zero, SYS_WRITE + ecall + addi a0, zero, STDERR + la a1, token_open_square + li a2, 1 + addi a7, zero, SYS_WRITE + ecall + DEBUG. End */ + + bnez a0, .Lcompile_call_paren + + lw t0, 12(sp) # Argument count for a procedure call. + addi t0, t0, 1 + sw t0, 12(sp) + + addi s1, s1, 1 # Skip the comma between the arguments. + j .Lcompile_call_argument + +.Lcompile_call_complete: + sw zero, 12(sp) + +.Lcompile_call_restore: + # Just go through all a0-a7 registers and read them from stack. + # If this stack value contains garbage, the procedure just shouldn't use it. + lw t0, 12(sp) + li t1, 7 + bgt t0, t1, .Lcompile_call_perform + + la a0, instruction_lw + li a1, 2 + call write_out + + la a0, space + li a1, 1 + call write_out + + la a0, register_a + li a1, 1 + call write_out + + lw t0, 12(sp) + addi t0, t0, '0' + sw t0, 8(sp) + + addi a0, sp, 8 + li a1, 1 + call write_out + + la a0, comma + li a1, 1 + call write_out + + lw t0, 12(sp) # Argument count for a procedure call. + + li t1, -4 + mul t1, t0, t1 + addi t1, t1, 52 + li t2, 10 + div t3, t1, t2 + rem t4, t1, t2 + addi t3, t3, '0' + addi t4, t4, '0' + + sw t3, 8(sp) + sw t4, 4(sp) + + addi a0, sp, 8 + li a1, 1 + call write_out + + addi a0, sp, 4 + li a1, 1 + call write_out + + la a0, token_open_paren + li a1, 1 + call write_out + + la a0, register_sp + li a1, 2 + call write_out + + la a0, token_close_paren + li a1, 1 + call write_out + + la a0, new_line + li a1, 1 + call write_out + + lw t0, 12(sp) # Increment. + addi t0, t0, 1 + sw t0, 12(sp) + + j .Lcompile_call_restore + +.Lcompile_call_perform: + la a0, instruction_call + li a1, 4 + call write_out + + la a0, space + li a1, 1 + call write_out + + lw a0, 20(sp) + lw a1, 16(sp) + call write_out + + la a0, new_line + li a1, 1 + call write_out + + call _skip_spaces + addi s1, s1, 1 # Skip the close paren. + + # Epilogue. + lw ra, 28(sp) + lw s0, 24(sp) + addi sp, sp, 32 + ret + +# Evalutes an expression and saves the result in a0. +.type _build_expression, @function +_build_expression: + # Prologue. + addi sp, sp, -16 + sw ra, 12(sp) + sw s0, 8(sp) + addi s0, sp, 16 + + call _skip_spaces + call _read_token + sw s1, 4(sp) + sw a0, 0(sp) + + # Integer literal. + addi a0, s1, 0 + lb a0, (a0) + call is_digit + bnez a0, .Lbuild_expression_number_literal + + # Named identifier. + la a0, instruction_la + li a1, 2 + call write_out + + la a0, space + li a1, 1 + call write_out + + la a0, register_a0 + li a1, 2 + call write_out + + la a0, comma + li a1, 1 + call write_out + + lw a0, 4(sp) + lw a1, 0(sp) + call write_out + + la a0, new_line + li a1, 1 + call write_out + + j .Lbuild_expression_end + +.Lbuild_expression_number_literal: + la a0, instruction_li + li a1, 2 + call write_out + + la a0, space + li a1, 1 + call write_out + + la a0, register_a0 + li a1, 2 + call write_out + + la a0, comma + li a1, 1 + call write_out + + lw a0, 4(sp) + lw a1, 0(sp) + call write_out + + la a0, new_line + li a1, 1 + call write_out + + j .Lbuild_expression_end + +.Lbuild_expression_end: + lw a0, 0(sp) + add s1, s1, a0 + + # Epilogue. + lw ra, 12(sp) + lw s0, 8(sp) + addi sp, sp, 16 + ret + +# Compiles a statement beginning with an identifier. +.type _compile_identifier, @function +_compile_identifier: + # Prologue. + addi sp, sp, -32 + sw ra, 28(sp) + sw s0, 24(sp) + addi s0, sp, 32 + + # Save the pointer to the identifier and its length on the stack. + sw a0, 20(sp) + sw a1, 16(sp) + + add s1, s1, a1 + call _skip_spaces + call _read_token + + # Save the pointer and the length of the token following the identifier. + sw s1, 12(sp) + sw a0, 8(sp) + + add s1, s1, a0 # Skip that token. + call _skip_spaces + + lw a0, 12(sp) + lw a1, 8(sp) + la a2, token_assign + call _token_compare + beqz a0, .Lcompile_identifier_assign + + lw a0, 12(sp) + lw a1, 8(sp) + la a2, token_open_paren + call _token_compare + beqz a0, .Lcompile_identifier_call + + j .Lcompile_identifier_end + +.Lcompile_identifier_call: + lw a0, 20(sp) + lw a1, 16(sp) + call _compile_call + + j .Lcompile_identifier_end + +.Lcompile_identifier_assign: + call _build_expression + + la a0, instruction_addi + li a1, 4 + call write_out + + la a0, space + li a1, 1 + call write_out + + lw a0, 20(sp) + lw a1, 16(sp) + call write_out + + la a0, comma + li a1, 1 + call write_out + + la a0, register_a0 + li a1, 2 + call write_out + + la a0, comma + li a1, 1 + call write_out + + la a0, digit_zero + li a1, 1 + call write_out + + la a0, new_line + li a1, 1 + call write_out + + j .Lcompile_identifier_end + +.Lcompile_identifier_end: + # Epilogue. + lw ra, 28(sp) + lw s0, 24(sp) + addi sp, sp, 32 + ret + +.type _compile_var, @function +_compile_var: + # Prologue. + addi sp, sp, -32 + sw ra, 28(sp) + sw s0, 24(sp) + addi s0, sp, 32 + + # Variable name. + addi s1, s1, 3 + call _skip_spaces + call _read_token + sw s1, 20(sp) + sw a0, 16(sp) + add s1, s1, a0 + + # Skip the colon. + call _skip_spaces + call _read_token + add s1, s1, a0 + + call _skip_spaces + call _read_token + sw a0, 12(sp) + + addi a0, s1, 0 + lw a1, 12(sp) + la a2, token_open_square + call _token_compare + beqz a0, .Lcompile_var_array + + j .Lcompile_var_end + +.Lcompile_var_array: + call _skip_spaces + add s1, s1, 1 # Skip the opening square bracket. + + call _skip_spaces + call _read_token + sw a0, 8(sp) + + la a0, asm_type + li a1, ASM_TYPE_SIZE + call write_out + + lw a0, 20(sp) + lw a1, 16(sp) + call write_out + + la a0, asm_object + li a1, ASM_OBJECT_SIZE + call write_out + + la a0, asm_size + li a1, ASM_SIZE_SIZE + call write_out + + lw a0, 20(sp) + lw a1, 16(sp) + call write_out + + la a0, comma + li a1, 1 + call write_out + + addi a0, s1, 0 + lw a1, 8(sp) + call write_out + + la a0, new_line + li a1, 1 + call write_out + + lw a0, 20(sp) + lw a1, 16(sp) + call write_out + + la a0, colon + li a1, 1 + call write_out + + la a0, asm_zero + li a1, ASM_ZERO_SIZE + call write_out + + addi a0, s1, 0 + lw a1, 8(sp) + call write_out + + la a0, new_line + li a1, 1 + call write_out + + la a0, asm_global + li a1, ASM_GLOBAL_SIZE + call write_out + + lw a0, 20(sp) + lw a1, 16(sp) + call write_out + + la a0, new_line + li a1, 1 + call write_out + + lw a0, 8(sp) + add s1, s1, a0 + + call _skip_spaces + add s1, s1, 1 # Skip the closing square bracket. + + call _skip_spaces + call _read_token + + sw a0, 12(sp) + j .Lcompile_var_end + +.Lcompile_var_end: + lw a0, 12(sp) + add s1, s1, a0 + + # Epilogue. + lw ra, 28(sp) + lw s0, 24(sp) + addi sp, sp, 32 + ret + +.type _handle_token, @function +_handle_token: + # Prologue. + addi sp, sp, -32 + sw ra, 28(sp) + sw s0, 24(sp) + addi s0, sp, 32 + + sw a0, 20(sp) + + # Detect what token has been read. + addi a0, s1, 0 + lw a1, 20(sp) + la a2, token_begin + call _token_compare + beqz a0, .Lhandle_token_begin + + addi a0, s1, 0 + lw a1, 20(sp) + la a2, token_end + call _token_compare + beqz a0, .Lhandle_token_end + + addi a0, s1, 0 + lw a1, 20(sp) + la a2, token_import + call _token_compare + beqz a0, .Lhandle_token_import + + addi a0, s1, 0 + lw a1, 20(sp) + la a2, token_var + call _token_compare + beqz a0, .Lhandle_token_var + + # If the first symbol in the token is a character, assume an identifier. + addi a0, s1, 0 + lb a0, (a0) + call is_alpha + bnez a0, .Lhandle_token_identifier + + # Ignore the unknown token. + lw t0, 20(sp) + add s1, s1, t0 + j .Lhandle_token_return + +.Lhandle_token_begin: + call _compile_begin + j .Lhandle_token_return + +.Lhandle_token_end: + call _compile_end + j .Lhandle_token_return + +.Lhandle_token_import: + call _compile_import + j .Lhandle_token_return + +.Lhandle_token_var: + call _compile_var + j .Lhandle_token_return + +.Lhandle_token_identifier: + addi a0, s1, 0 + lw a1, 20(sp) + call _compile_identifier + j .Lhandle_token_return + +.Lhandle_token_return: + # Epilogue. + lw ra, 28(sp) + lw s0, 24(sp) + addi sp, sp, 32 + ret + +.type write, @function +write_out: + # Prologue. + addi sp, sp, -8 + sw ra, 4(sp) + sw s0, 0(sp) + addi s0, sp, 8 + + addi a2, a1, 0 + addi a1, a0, 0 + addi a0, zero, STDOUT + addi a7, zero, SYS_WRITE + ecall + + # Epilogue. + lw ra, 4(sp) + lw s0, 0(sp) + addi sp, sp, 8 + ret + +# Reads standard input into a buffer. +# a0 - Buffer pointer. +# a1 - Buffer size. +# +# Returns the result in a0. +.type read_file, @function +read_file: + # Prologue. + addi sp, sp, -8 + sw ra, 4(sp) + sw s0, 0(sp) + addi s0, sp, 8 + + addi a2, a1, 0 + addi a1, a0, 0 + addi a0, zero, STDIN + addi a7, zero, SYS_READ + ecall + + # Epilogue. + lw ra, 4(sp) + lw s0, 0(sp) + addi sp, sp, 8 + ret + +.type _compile, @function +compile: + # Prologue. + addi sp, sp, -16 + sw ra, 12(sp) + sw s0, 8(sp) + addi s0, sp, 16 + + # Write .bss section header for global variables. + la a0, asm_program + addi a1, zero, ASM_PROGRAM_SIZE + call write_out + + call _skip_spaces + addi s1, s1, 7 # Skip "program" keyword. + +.Lcharacter_loop_do: + call _skip_spaces + + lbu t0, (s1) # t0 = Current character. + beqz t0, .Lcharacter_loop_end + + call _read_token + sw a0, 4(sp) # Save the token length on the stack. + beqz a0, .Lcharacter_loop_end # No token read, there is unrecognized input. + + lw a0, 4(sp) + call _handle_token + + j .Lcharacter_loop_do +.Lcharacter_loop_end: + + # Epilogue. + lw ra, 12(sp) + lw s0, 8(sp) + addi sp, sp, 16 + ret diff --git a/boot/goto-boot.elna b/boot/goto-boot.elna new file mode 100644 index 0000000..c2fd69b --- /dev/null +++ b/boot/goto-boot.elna @@ -0,0 +1,12 @@ +program + +import dummy + +var source_code: [2048]Byte + +begin + read_file(source_code, 2048); + + s1 := source_code; + +end. diff --git a/run.rb b/run.rb new file mode 100755 index 0000000..ac8fc3d --- /dev/null +++ b/run.rb @@ -0,0 +1,46 @@ +#!/usr/bin/env ruby + +require 'open3' +require 'fileutils' +require 'pathname' + +TMP = Pathname.new 'build' +CROSS_GCC = '../riscv32-ilp32d--glibc/bin/riscv32-linux-gcc' +SYSROOT = '../riscv32-ilp32d--glibc/riscv32-buildroot-linux-gnu/sysroot' + +COMMON_BOOT_OBJECT = TMP + 'common-boot.o' + +FileUtils.rm_rf TMP +FileUtils.mkdir_p TMP + +FileUtils.cp 'boot/asm-boot.s', TMP + +def stage(source_elna, stage_name, output) + boot_exe = (TMP + stage_name).to_path + stage_path = TMP + "#{stage_name}.s" + arguments = [CROSS_GCC, '-nostdlib', '-o', boot_exe, stage_path.to_path, COMMON_BOOT_OBJECT.to_path] + + puts(arguments * ' ') + system *arguments, exception: true + + arguments = ['qemu-riscv32', '-L', SYSROOT, boot_exe] + + puts(arguments * ' ') + puts + Open3.popen2(*arguments) do |qemu_in, qemu_out| + qemu_in.write source_elna + qemu_in.close + + IO.copy_stream qemu_out, output + qemu_out.close + end +end + +system CROSS_GCC, '-nostdlib', '-c', '-o', COMMON_BOOT_OBJECT.to_path, 'boot/common-boot.s', exception: true +source_elna = File.read 'boot/goto-boot.elna' + +next_stage = TMP + 'goto-boot.s' +File.open next_stage, 'w' do |output| + stage source_elna, 'asm-boot', output +end +stage(source_elna, 'goto-boot', $stdout)