Compare commits
No commits in common. "master" and "v1.0.1" have entirely different histories.
1
.gitignore
vendored
1
.gitignore
vendored
@ -1,2 +1,3 @@
|
|||||||
/target
|
/target
|
||||||
|
/archive
|
||||||
/bin
|
/bin
|
||||||
0
.gitmodules
vendored
0
.gitmodules
vendored
101
Cargo.lock
generated
101
Cargo.lock
generated
@ -2,105 +2,6 @@
|
|||||||
# It is not intended for manual editing.
|
# It is not intended for manual editing.
|
||||||
version = 3
|
version = 3
|
||||||
|
|
||||||
[[package]]
|
|
||||||
name = "cfg-if"
|
|
||||||
version = "1.0.0"
|
|
||||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
|
||||||
checksum = "baf1de4339761588bc0619e3cbc0120ee582ebb74b53b4efbf79117bd2da40fd"
|
|
||||||
|
|
||||||
[[package]]
|
|
||||||
name = "fastrand"
|
|
||||||
version = "2.0.1"
|
|
||||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
|
||||||
checksum = "25cbce373ec4653f1a01a31e8a5e5ec0c622dc27ff9c4e6606eefef5cbbed4a5"
|
|
||||||
|
|
||||||
[[package]]
|
[[package]]
|
||||||
name = "labast"
|
name = "labast"
|
||||||
version = "1.0.6"
|
version = "1.0.1"
|
||||||
dependencies = [
|
|
||||||
"fastrand",
|
|
||||||
"libloading",
|
|
||||||
"pico-args",
|
|
||||||
]
|
|
||||||
|
|
||||||
[[package]]
|
|
||||||
name = "libloading"
|
|
||||||
version = "0.8.1"
|
|
||||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
|
||||||
checksum = "c571b676ddfc9a8c12f1f3d3085a7b163966a8fd8098a90640953ce5f6170161"
|
|
||||||
dependencies = [
|
|
||||||
"cfg-if",
|
|
||||||
"windows-sys",
|
|
||||||
]
|
|
||||||
|
|
||||||
[[package]]
|
|
||||||
name = "pico-args"
|
|
||||||
version = "0.5.0"
|
|
||||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
|
||||||
checksum = "5be167a7af36ee22fe3115051bc51f6e6c7054c9348e28deb4f49bd6f705a315"
|
|
||||||
|
|
||||||
[[package]]
|
|
||||||
name = "windows-sys"
|
|
||||||
version = "0.48.0"
|
|
||||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
|
||||||
checksum = "677d2418bec65e3338edb076e806bc1ec15693c5d0104683f2efe857f61056a9"
|
|
||||||
dependencies = [
|
|
||||||
"windows-targets",
|
|
||||||
]
|
|
||||||
|
|
||||||
[[package]]
|
|
||||||
name = "windows-targets"
|
|
||||||
version = "0.48.5"
|
|
||||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
|
||||||
checksum = "9a2fa6e2155d7247be68c096456083145c183cbbbc2764150dda45a87197940c"
|
|
||||||
dependencies = [
|
|
||||||
"windows_aarch64_gnullvm",
|
|
||||||
"windows_aarch64_msvc",
|
|
||||||
"windows_i686_gnu",
|
|
||||||
"windows_i686_msvc",
|
|
||||||
"windows_x86_64_gnu",
|
|
||||||
"windows_x86_64_gnullvm",
|
|
||||||
"windows_x86_64_msvc",
|
|
||||||
]
|
|
||||||
|
|
||||||
[[package]]
|
|
||||||
name = "windows_aarch64_gnullvm"
|
|
||||||
version = "0.48.5"
|
|
||||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
|
||||||
checksum = "2b38e32f0abccf9987a4e3079dfb67dcd799fb61361e53e2882c3cbaf0d905d8"
|
|
||||||
|
|
||||||
[[package]]
|
|
||||||
name = "windows_aarch64_msvc"
|
|
||||||
version = "0.48.5"
|
|
||||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
|
||||||
checksum = "dc35310971f3b2dbbf3f0690a219f40e2d9afcf64f9ab7cc1be722937c26b4bc"
|
|
||||||
|
|
||||||
[[package]]
|
|
||||||
name = "windows_i686_gnu"
|
|
||||||
version = "0.48.5"
|
|
||||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
|
||||||
checksum = "a75915e7def60c94dcef72200b9a8e58e5091744960da64ec734a6c6e9b3743e"
|
|
||||||
|
|
||||||
[[package]]
|
|
||||||
name = "windows_i686_msvc"
|
|
||||||
version = "0.48.5"
|
|
||||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
|
||||||
checksum = "8f55c233f70c4b27f66c523580f78f1004e8b5a8b659e05a4eb49d4166cca406"
|
|
||||||
|
|
||||||
[[package]]
|
|
||||||
name = "windows_x86_64_gnu"
|
|
||||||
version = "0.48.5"
|
|
||||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
|
||||||
checksum = "53d40abd2583d23e4718fddf1ebec84dbff8381c07cae67ff7768bbf19c6718e"
|
|
||||||
|
|
||||||
[[package]]
|
|
||||||
name = "windows_x86_64_gnullvm"
|
|
||||||
version = "0.48.5"
|
|
||||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
|
||||||
checksum = "0b7b52767868a23d5bab768e390dc5f5c55825b6d30b86c844ff2dc7414044cc"
|
|
||||||
|
|
||||||
[[package]]
|
|
||||||
name = "windows_x86_64_msvc"
|
|
||||||
version = "0.48.5"
|
|
||||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
|
||||||
checksum = "ed94fce61571a4006852b7389a063ab983c02eb1bb37b47f8272ce92d06d9538"
|
|
||||||
|
|||||||
@ -1,11 +1,11 @@
|
|||||||
[package]
|
[package]
|
||||||
name = "labast"
|
name = "labast"
|
||||||
version = "1.0.6"
|
version = "1.0.1"
|
||||||
authors = [ "n3tael" ]
|
authors = [ "n3tael" ]
|
||||||
edition = "2021"
|
edition = "2021"
|
||||||
description = "A Labaski interpreter written in Rust."
|
description = "A zero-dependencies Labaski interpreter written in Rust."
|
||||||
readme = "README.md"
|
readme = "README.md"
|
||||||
license = "apache-2.0"
|
license = "MIT"
|
||||||
publish = false
|
publish = false
|
||||||
|
|
||||||
[profile.dev]
|
[profile.dev]
|
||||||
@ -17,6 +17,3 @@ lto = true
|
|||||||
panic = "abort"
|
panic = "abort"
|
||||||
|
|
||||||
[dependencies]
|
[dependencies]
|
||||||
fastrand = "2.0.1"
|
|
||||||
libloading = "0.8.1"
|
|
||||||
pico-args = "0.5.0"
|
|
||||||
|
|||||||
202
LICENSE
202
LICENSE
@ -1,202 +0,0 @@
|
|||||||
|
|
||||||
Apache License
|
|
||||||
Version 2.0, January 2004
|
|
||||||
http://www.apache.org/licenses/
|
|
||||||
|
|
||||||
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
|
|
||||||
|
|
||||||
1. Definitions.
|
|
||||||
|
|
||||||
"License" shall mean the terms and conditions for use, reproduction,
|
|
||||||
and distribution as defined by Sections 1 through 9 of this document.
|
|
||||||
|
|
||||||
"Licensor" shall mean the copyright owner or entity authorized by
|
|
||||||
the copyright owner that is granting the License.
|
|
||||||
|
|
||||||
"Legal Entity" shall mean the union of the acting entity and all
|
|
||||||
other entities that control, are controlled by, or are under common
|
|
||||||
control with that entity. For the purposes of this definition,
|
|
||||||
"control" means (i) the power, direct or indirect, to cause the
|
|
||||||
direction or management of such entity, whether by contract or
|
|
||||||
otherwise, or (ii) ownership of fifty percent (50%) or more of the
|
|
||||||
outstanding shares, or (iii) beneficial ownership of such entity.
|
|
||||||
|
|
||||||
"You" (or "Your") shall mean an individual or Legal Entity
|
|
||||||
exercising permissions granted by this License.
|
|
||||||
|
|
||||||
"Source" form shall mean the preferred form for making modifications,
|
|
||||||
including but not limited to software source code, documentation
|
|
||||||
source, and configuration files.
|
|
||||||
|
|
||||||
"Object" form shall mean any form resulting from mechanical
|
|
||||||
transformation or translation of a Source form, including but
|
|
||||||
not limited to compiled object code, generated documentation,
|
|
||||||
and conversions to other media types.
|
|
||||||
|
|
||||||
"Work" shall mean the work of authorship, whether in Source or
|
|
||||||
Object form, made available under the License, as indicated by a
|
|
||||||
copyright notice that is included in or attached to the work
|
|
||||||
(an example is provided in the Appendix below).
|
|
||||||
|
|
||||||
"Derivative Works" shall mean any work, whether in Source or Object
|
|
||||||
form, that is based on (or derived from) the Work and for which the
|
|
||||||
editorial revisions, annotations, elaborations, or other modifications
|
|
||||||
represent, as a whole, an original work of authorship. For the purposes
|
|
||||||
of this License, Derivative Works shall not include works that remain
|
|
||||||
separable from, or merely link (or bind by name) to the interfaces of,
|
|
||||||
the Work and Derivative Works thereof.
|
|
||||||
|
|
||||||
"Contribution" shall mean any work of authorship, including
|
|
||||||
the original version of the Work and any modifications or additions
|
|
||||||
to that Work or Derivative Works thereof, that is intentionally
|
|
||||||
submitted to Licensor for inclusion in the Work by the copyright owner
|
|
||||||
or by an individual or Legal Entity authorized to submit on behalf of
|
|
||||||
the copyright owner. For the purposes of this definition, "submitted"
|
|
||||||
means any form of electronic, verbal, or written communication sent
|
|
||||||
to the Licensor or its representatives, including but not limited to
|
|
||||||
communication on electronic mailing lists, source code control systems,
|
|
||||||
and issue tracking systems that are managed by, or on behalf of, the
|
|
||||||
Licensor for the purpose of discussing and improving the Work, but
|
|
||||||
excluding communication that is conspicuously marked or otherwise
|
|
||||||
designated in writing by the copyright owner as "Not a Contribution."
|
|
||||||
|
|
||||||
"Contributor" shall mean Licensor and any individual or Legal Entity
|
|
||||||
on behalf of whom a Contribution has been received by Licensor and
|
|
||||||
subsequently incorporated within the Work.
|
|
||||||
|
|
||||||
2. Grant of Copyright License. Subject to the terms and conditions of
|
|
||||||
this License, each Contributor hereby grants to You a perpetual,
|
|
||||||
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
|
||||||
copyright license to reproduce, prepare Derivative Works of,
|
|
||||||
publicly display, publicly perform, sublicense, and distribute the
|
|
||||||
Work and such Derivative Works in Source or Object form.
|
|
||||||
|
|
||||||
3. Grant of Patent License. Subject to the terms and conditions of
|
|
||||||
this License, each Contributor hereby grants to You a perpetual,
|
|
||||||
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
|
||||||
(except as stated in this section) patent license to make, have made,
|
|
||||||
use, offer to sell, sell, import, and otherwise transfer the Work,
|
|
||||||
where such license applies only to those patent claims licensable
|
|
||||||
by such Contributor that are necessarily infringed by their
|
|
||||||
Contribution(s) alone or by combination of their Contribution(s)
|
|
||||||
with the Work to which such Contribution(s) was submitted. If You
|
|
||||||
institute patent litigation against any entity (including a
|
|
||||||
cross-claim or counterclaim in a lawsuit) alleging that the Work
|
|
||||||
or a Contribution incorporated within the Work constitutes direct
|
|
||||||
or contributory patent infringement, then any patent licenses
|
|
||||||
granted to You under this License for that Work shall terminate
|
|
||||||
as of the date such litigation is filed.
|
|
||||||
|
|
||||||
4. Redistribution. You may reproduce and distribute copies of the
|
|
||||||
Work or Derivative Works thereof in any medium, with or without
|
|
||||||
modifications, and in Source or Object form, provided that You
|
|
||||||
meet the following conditions:
|
|
||||||
|
|
||||||
(a) You must give any other recipients of the Work or
|
|
||||||
Derivative Works a copy of this License; and
|
|
||||||
|
|
||||||
(b) You must cause any modified files to carry prominent notices
|
|
||||||
stating that You changed the files; and
|
|
||||||
|
|
||||||
(c) You must retain, in the Source form of any Derivative Works
|
|
||||||
that You distribute, all copyright, patent, trademark, and
|
|
||||||
attribution notices from the Source form of the Work,
|
|
||||||
excluding those notices that do not pertain to any part of
|
|
||||||
the Derivative Works; and
|
|
||||||
|
|
||||||
(d) If the Work includes a "NOTICE" text file as part of its
|
|
||||||
distribution, then any Derivative Works that You distribute must
|
|
||||||
include a readable copy of the attribution notices contained
|
|
||||||
within such NOTICE file, excluding those notices that do not
|
|
||||||
pertain to any part of the Derivative Works, in at least one
|
|
||||||
of the following places: within a NOTICE text file distributed
|
|
||||||
as part of the Derivative Works; within the Source form or
|
|
||||||
documentation, if provided along with the Derivative Works; or,
|
|
||||||
within a display generated by the Derivative Works, if and
|
|
||||||
wherever such third-party notices normally appear. The contents
|
|
||||||
of the NOTICE file are for informational purposes only and
|
|
||||||
do not modify the License. You may add Your own attribution
|
|
||||||
notices within Derivative Works that You distribute, alongside
|
|
||||||
or as an addendum to the NOTICE text from the Work, provided
|
|
||||||
that such additional attribution notices cannot be construed
|
|
||||||
as modifying the License.
|
|
||||||
|
|
||||||
You may add Your own copyright statement to Your modifications and
|
|
||||||
may provide additional or different license terms and conditions
|
|
||||||
for use, reproduction, or distribution of Your modifications, or
|
|
||||||
for any such Derivative Works as a whole, provided Your use,
|
|
||||||
reproduction, and distribution of the Work otherwise complies with
|
|
||||||
the conditions stated in this License.
|
|
||||||
|
|
||||||
5. Submission of Contributions. Unless You explicitly state otherwise,
|
|
||||||
any Contribution intentionally submitted for inclusion in the Work
|
|
||||||
by You to the Licensor shall be under the terms and conditions of
|
|
||||||
this License, without any additional terms or conditions.
|
|
||||||
Notwithstanding the above, nothing herein shall supersede or modify
|
|
||||||
the terms of any separate license agreement you may have executed
|
|
||||||
with Licensor regarding such Contributions.
|
|
||||||
|
|
||||||
6. Trademarks. This License does not grant permission to use the trade
|
|
||||||
names, trademarks, service marks, or product names of the Licensor,
|
|
||||||
except as required for reasonable and customary use in describing the
|
|
||||||
origin of the Work and reproducing the content of the NOTICE file.
|
|
||||||
|
|
||||||
7. Disclaimer of Warranty. Unless required by applicable law or
|
|
||||||
agreed to in writing, Licensor provides the Work (and each
|
|
||||||
Contributor provides its Contributions) on an "AS IS" BASIS,
|
|
||||||
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
|
|
||||||
implied, including, without limitation, any warranties or conditions
|
|
||||||
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
|
|
||||||
PARTICULAR PURPOSE. You are solely responsible for determining the
|
|
||||||
appropriateness of using or redistributing the Work and assume any
|
|
||||||
risks associated with Your exercise of permissions under this License.
|
|
||||||
|
|
||||||
8. Limitation of Liability. In no event and under no legal theory,
|
|
||||||
whether in tort (including negligence), contract, or otherwise,
|
|
||||||
unless required by applicable law (such as deliberate and grossly
|
|
||||||
negligent acts) or agreed to in writing, shall any Contributor be
|
|
||||||
liable to You for damages, including any direct, indirect, special,
|
|
||||||
incidental, or consequential damages of any character arising as a
|
|
||||||
result of this License or out of the use or inability to use the
|
|
||||||
Work (including but not limited to damages for loss of goodwill,
|
|
||||||
work stoppage, computer failure or malfunction, or any and all
|
|
||||||
other commercial damages or losses), even if such Contributor
|
|
||||||
has been advised of the possibility of such damages.
|
|
||||||
|
|
||||||
9. Accepting Warranty or Additional Liability. While redistributing
|
|
||||||
the Work or Derivative Works thereof, You may choose to offer,
|
|
||||||
and charge a fee for, acceptance of support, warranty, indemnity,
|
|
||||||
or other liability obligations and/or rights consistent with this
|
|
||||||
License. However, in accepting such obligations, You may act only
|
|
||||||
on Your own behalf and on Your sole responsibility, not on behalf
|
|
||||||
of any other Contributor, and only if You agree to indemnify,
|
|
||||||
defend, and hold each Contributor harmless for any liability
|
|
||||||
incurred by, or claims asserted against, such Contributor by reason
|
|
||||||
of your accepting any such warranty or additional liability.
|
|
||||||
|
|
||||||
END OF TERMS AND CONDITIONS
|
|
||||||
|
|
||||||
APPENDIX: How to apply the Apache License to your work.
|
|
||||||
|
|
||||||
To apply the Apache License to your work, attach the following
|
|
||||||
boilerplate notice, with the fields enclosed by brackets "[]"
|
|
||||||
replaced with your own identifying information. (Don't include
|
|
||||||
the brackets!) The text should be enclosed in the appropriate
|
|
||||||
comment syntax for the file format. We also recommend that a
|
|
||||||
file or class name and description of purpose be included on the
|
|
||||||
same "printed page" as the copyright notice for easier
|
|
||||||
identification within third-party archives.
|
|
||||||
|
|
||||||
Copyright 2024 n3tael
|
|
||||||
|
|
||||||
Licensed under the Apache License, Version 2.0 (the "License");
|
|
||||||
you may not use this file except in compliance with the License.
|
|
||||||
You may obtain a copy of the License at
|
|
||||||
|
|
||||||
http://www.apache.org/licenses/LICENSE-2.0
|
|
||||||
|
|
||||||
Unless required by applicable law or agreed to in writing, software
|
|
||||||
distributed under the License is distributed on an "AS IS" BASIS,
|
|
||||||
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
||||||
See the License for the specific language governing permissions and
|
|
||||||
limitations under the License.
|
|
||||||
21
LICENSE.txt
Normal file
21
LICENSE.txt
Normal file
@ -0,0 +1,21 @@
|
|||||||
|
MIT License
|
||||||
|
|
||||||
|
Copyright (c) 2024 n3tael
|
||||||
|
|
||||||
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||||
|
of this software and associated documentation files (the "Software"), to deal
|
||||||
|
in the Software without restriction, including without limitation the rights
|
||||||
|
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||||
|
copies of the Software, and to permit persons to whom the Software is
|
||||||
|
furnished to do so, subject to the following conditions:
|
||||||
|
|
||||||
|
The above copyright notice and this permission notice shall be included in all
|
||||||
|
copies or substantial portions of the Software.
|
||||||
|
|
||||||
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||||
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||||
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||||||
|
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||||||
|
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||||||
|
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
||||||
|
SOFTWARE.
|
||||||
@ -1,3 +1,5 @@
|
|||||||
# Labast
|
# Labast
|
||||||
|
A zero-dependencies Labaski interpreter written in Rust. Fully supports [Labashki specs 1.4.1](./SPECIFICATION.md).
|
||||||
|
|
||||||
A Labaski interpreter written in Rust. Fully supports Labashki specs 1.15.1
|
## Examples
|
||||||
|
See `scripts` directory.
|
||||||
51
SPECIFICATION.md
Normal file
51
SPECIFICATION.md
Normal file
@ -0,0 +1,51 @@
|
|||||||
|
# Labaski specification
|
||||||
|
Last update: 2024-02-05
|
||||||
|
|
||||||
|
Программа состоит из команд в формате `ИНСТРУКЦИЯ АРГУМЕНТ` (assembler-like)
|
||||||
|
|
||||||
|
Аргумент всегда должен быть `uint16` (`unsigned short`, `u16`)
|
||||||
|
|
||||||
|
Все данные которые программа использует хранятся в стеке, сам стек это массив из этих `unsigned short`'ов
|
||||||
|
|
||||||
|
Размер стека без разницы, но желательно минимум 256
|
||||||
|
|
||||||
|
Выполнение программы начинается либо с начала файла, либо с лейбла 0, если он есть
|
||||||
|
|
||||||
|
Почти каждая инструкция которые читает что-то стека должна POP'ать прочитаннное значение
|
||||||
|
|
||||||
|
Если название инструкции начинается с #, то парсер программы должен прочитать аргумент к инструкции как строку(до первого пробела)
|
||||||
|
|
||||||
|
## Инструкции
|
||||||
|
|
||||||
|
| Инструкция | Аргумент | Описание |
|
||||||
|
|-------------|----------------|----------------------------------------------------------------------|
|
||||||
|
| PUSH | `uint16` | Добавить в стек |
|
||||||
|
| POP | - | Удалить из стека |
|
||||||
|
| DUP | - | Дублировать последнее значение в стеке |
|
||||||
|
| SWAP | - | Поменять местами последние 2 значения в стеке |
|
||||||
|
| ADD | - | Прибавление последних 2-х значений из стека |
|
||||||
|
| SUB | - | Вычитание последних 2-х значений из стека |
|
||||||
|
| MUL | - | Умножение последних 2-х значений из стека |
|
||||||
|
| DIV | - | Деление последних 2-х значений из стека |
|
||||||
|
| JMP | `uint16` лейбл | Перейти к лейблу <имя> |
|
||||||
|
| JNZ | `uint16` лейбл | Перейти к лейблу <имя> если значение с верхушки стека не 0 |
|
||||||
|
| JZ | `uint16` лейбл | Перейти к лейблу <имя> если значение с верхушки стека 0 |
|
||||||
|
| NOP | - | Ничего не делает |
|
||||||
|
| EXIT | - | Выход из программы с кодом 0 |
|
||||||
|
| PUTC | - | Вывести символ в консоль |
|
||||||
|
| GETC | - | Получить символ с консоли, добавить символ в стек |
|
||||||
|
| MEOW | - | Принт, POP'ает со стека |
|
||||||
|
| DUMP | - | Вывести весь стек в консоль, понятное дело не попает со стека |
|
||||||
|
| SCAN | - | Сканирует ввод из консоли на `short`'ы и пушит в стек |
|
||||||
|
| #EXEC | arg | Выполнить код из файла, указанного в аргументе* |
|
||||||
|
| ARGS | `uint16` | POP'ает аргумент значений с основного стека и пушит их в стек модуля, если указать аргумент 0, то нужное кол-во аргументов она возьмет(попнув) с оригинального стека |
|
||||||
|
| SIZE | | Пушит в стек значение размера стека |
|
||||||
|
| QUIT | `uint16` | Полностью завершает выполнение программы. Как аргумент попает exit-код. |
|
||||||
|
|
||||||
|
> \*путь относительно места вызова интерпретатора. Создает отдельный стек для модуля, но передает основной для того чтобы взять оттуда аргументы. После того как модуль выполнился, пушит весь стек модуля в основной.
|
||||||
|
|
||||||
|
## Лейблы
|
||||||
|
|
||||||
|
Лейблы могут быть только `unsigned short`'ами
|
||||||
|
От 0 (main-лейбл) до минимум 256
|
||||||
|
Если юзер высрал два лейбла с одинаковыми идентификаторами, то интерпретатор/компилятор должен выдать ошибку
|
||||||
@ -3,9 +3,7 @@ echo Building for Windows...
|
|||||||
cargo build --release
|
cargo build --release
|
||||||
echo Building for Linux...
|
echo Building for Linux...
|
||||||
cargo zigbuild --release --target x86_64-unknown-linux-gnu
|
cargo zigbuild --release --target x86_64-unknown-linux-gnu
|
||||||
echo Copy binaries to bin folder...
|
echo Copy to bin...
|
||||||
copy target\release\labast.exe bin\ /Y
|
copy target\release\labast.exe bin\ /Y
|
||||||
copy target\x86_64-unknown-linux-gnu\release\labast bin\ /Y
|
copy target\x86_64-unknown-linux-gnu\release\labast bin\ /Y
|
||||||
echo Creating source code tar.gz archive...
|
|
||||||
tar --exclude="./bin" --exclude="./target" --exclude=".git" -cvzf bin\labast-latest.tar.gz *
|
|
||||||
echo Done!
|
echo Done!
|
||||||
9
scripts/expr.lb
Normal file
9
scripts/expr.lb
Normal file
@ -0,0 +1,9 @@
|
|||||||
|
; written by Labashki developer - aeris
|
||||||
|
@ 0
|
||||||
|
#EXPR >++:+\
|
||||||
|
DUMP
|
||||||
|
|
||||||
|
; Expected output
|
||||||
|
;
|
||||||
|
; 0: 3
|
||||||
|
; 1: 2
|
||||||
30
scripts/hello-world.lb
Normal file
30
scripts/hello-world.lb
Normal file
@ -0,0 +1,30 @@
|
|||||||
|
PUSH 72 ; H
|
||||||
|
PUTC ; Print to console
|
||||||
|
PUSH 101 ; e
|
||||||
|
PUTC
|
||||||
|
PUSH 108 ; l
|
||||||
|
PUTC
|
||||||
|
PUSH 108 ; l
|
||||||
|
PUTC
|
||||||
|
PUSH 111 ; o
|
||||||
|
PUTC
|
||||||
|
PUSH 32 ; <space>
|
||||||
|
PUTC
|
||||||
|
PUSH 76 ; L
|
||||||
|
PUTC
|
||||||
|
PUSH 97 ; a
|
||||||
|
PUTC
|
||||||
|
PUSH 98 ; b
|
||||||
|
PUTC
|
||||||
|
PUSH 97 ; a
|
||||||
|
PUTC
|
||||||
|
PUSH 115 ; s
|
||||||
|
PUTC
|
||||||
|
PUSH 104 ; h
|
||||||
|
PUTC
|
||||||
|
PUSH 107 ; k
|
||||||
|
PUTC
|
||||||
|
PUSH 105 ; i
|
||||||
|
PUTC
|
||||||
|
PUSH 33 ; !
|
||||||
|
PUTC
|
||||||
20
scripts/labels.lb
Normal file
20
scripts/labels.lb
Normal file
@ -0,0 +1,20 @@
|
|||||||
|
@ 1
|
||||||
|
PUSH 115 ; s
|
||||||
|
PUTC
|
||||||
|
PUSH 104 ; h
|
||||||
|
PUTC
|
||||||
|
PUSH 107 ; k
|
||||||
|
PUTC
|
||||||
|
PUSH 105 ; i
|
||||||
|
PUTC
|
||||||
|
EXIT
|
||||||
|
@ 0
|
||||||
|
PUSH 76 ; L
|
||||||
|
PUTC
|
||||||
|
PUSH 97 ; a
|
||||||
|
PUTC
|
||||||
|
PUSH 98 ; b
|
||||||
|
PUTC
|
||||||
|
PUSH 97 ; a
|
||||||
|
PUTC
|
||||||
|
JMP 1
|
||||||
23
scripts/math.lb
Normal file
23
scripts/math.lb
Normal file
@ -0,0 +1,23 @@
|
|||||||
|
; Addition
|
||||||
|
PUSH 2 ; a = 2
|
||||||
|
PUSH 3 ; b = 2
|
||||||
|
ADD ; a + b
|
||||||
|
MEOW ; = 5
|
||||||
|
|
||||||
|
; Subtraction
|
||||||
|
PUSH 9 ; a = 9
|
||||||
|
PUSH 4 ; b = 4
|
||||||
|
SUB ; b - a
|
||||||
|
MEOW ; = 5
|
||||||
|
|
||||||
|
; Multiplication
|
||||||
|
PUSH 9 ; a = 9
|
||||||
|
PUSH 5 ; b = 5
|
||||||
|
MUL ; b * a
|
||||||
|
MEOW ; = 45
|
||||||
|
|
||||||
|
; Division
|
||||||
|
PUSH 81; a = 81
|
||||||
|
PUSH 9 ; b = 9
|
||||||
|
DIV ; b / a
|
||||||
|
MEOW ; = 9
|
||||||
12
scripts/modules/main.lb
Normal file
12
scripts/modules/main.lb
Normal file
@ -0,0 +1,12 @@
|
|||||||
|
PUSH 76 ; L
|
||||||
|
PUTC
|
||||||
|
PUSH 97 ; a
|
||||||
|
PUTC
|
||||||
|
PUSH 98 ; b
|
||||||
|
PUTC
|
||||||
|
PUSH 97 ; a
|
||||||
|
PUTC
|
||||||
|
#EXEC second_part.lb
|
||||||
|
PUSH 33 ; !
|
||||||
|
PUTC
|
||||||
|
QUIT
|
||||||
8
scripts/modules/second_part.lb
Normal file
8
scripts/modules/second_part.lb
Normal file
@ -0,0 +1,8 @@
|
|||||||
|
PUSH 115 ; s
|
||||||
|
PUTC
|
||||||
|
PUSH 104 ; h
|
||||||
|
PUTC
|
||||||
|
PUSH 107 ; k
|
||||||
|
PUTC
|
||||||
|
PUSH 105 ; i
|
||||||
|
PUTC
|
||||||
15
scripts/pick.lb
Normal file
15
scripts/pick.lb
Normal file
@ -0,0 +1,15 @@
|
|||||||
|
; written by Labashki developer - aeris
|
||||||
|
@ 0
|
||||||
|
PUSH 2
|
||||||
|
PUSH 3
|
||||||
|
PUSH 4
|
||||||
|
PUSH 1
|
||||||
|
PICK
|
||||||
|
DUMP
|
||||||
|
|
||||||
|
; Expected output
|
||||||
|
;
|
||||||
|
; 0: 2
|
||||||
|
; 1: 3
|
||||||
|
; 2: 4
|
||||||
|
; 3: 3
|
||||||
10
scripts/size.lb
Normal file
10
scripts/size.lb
Normal file
@ -0,0 +1,10 @@
|
|||||||
|
@ 0
|
||||||
|
PUSH 1
|
||||||
|
PUSH 2
|
||||||
|
PUSH 3
|
||||||
|
SIZE
|
||||||
|
MEOW
|
||||||
|
|
||||||
|
; Expected output
|
||||||
|
;
|
||||||
|
; 3
|
||||||
4
scripts/std/rev.lb
Normal file
4
scripts/std/rev.lb
Normal file
@ -0,0 +1,4 @@
|
|||||||
|
; Labashki standard library
|
||||||
|
; Written by Labashki developer - aeris
|
||||||
|
|
||||||
|
ARGS 0
|
||||||
4
scripts/std/rot.lb
Normal file
4
scripts/std/rot.lb
Normal file
@ -0,0 +1,4 @@
|
|||||||
|
; Labashki standard library
|
||||||
|
; Written by Labashki developer - aeris
|
||||||
|
|
||||||
|
ARGS 3
|
||||||
17
scripts/std/unix/ВАРЁНЫЙНОСОК.lb
Normal file
17
scripts/std/unix/ВАРЁНЫЙНОСОК.lb
Normal file
@ -0,0 +1,17 @@
|
|||||||
|
; Labashki standard library
|
||||||
|
; Written by Labashki developer - aeris
|
||||||
|
|
||||||
|
MAXSIZE
|
||||||
|
ARGS 1 ; Насколько сварить носок
|
||||||
|
SUB
|
||||||
|
|
||||||
|
@ 1
|
||||||
|
JNZ 2
|
||||||
|
QUIT
|
||||||
|
|
||||||
|
@ 2
|
||||||
|
#EXPR -
|
||||||
|
PUSH -1
|
||||||
|
_UNIX_RANDOM
|
||||||
|
SWAP
|
||||||
|
JMP 1
|
||||||
2
scripts/vareniynosok.lb
Normal file
2
scripts/vareniynosok.lb
Normal file
@ -0,0 +1,2 @@
|
|||||||
|
SIZE
|
||||||
|
#EXEC std\unix\ВАРЁНЫЙНОСОК.lb
|
||||||
@ -1,19 +1,5 @@
|
|||||||
use std::fmt::Display;
|
use std::fmt::Display;
|
||||||
|
|
||||||
pub enum StackError {
|
|
||||||
StackOverflow,
|
|
||||||
StackUnderflow,
|
|
||||||
}
|
|
||||||
|
|
||||||
impl Display for StackError {
|
|
||||||
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
|
|
||||||
match self {
|
|
||||||
StackError::StackOverflow => write!(f, "Stack overflow!"),
|
|
||||||
StackError::StackUnderflow => write!(f, "Stack underflow!"),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub enum RunError {
|
pub enum RunError {
|
||||||
RequestArgsInMainModule,
|
RequestArgsInMainModule,
|
||||||
ExecuteItself(String),
|
ExecuteItself(String),
|
||||||
@ -25,54 +11,35 @@ pub enum RunError {
|
|||||||
FailToReadLineFromConsole,
|
FailToReadLineFromConsole,
|
||||||
UnknownLabel(u16),
|
UnknownLabel(u16),
|
||||||
InvalidExpressionUnknownOperator(String),
|
InvalidExpressionUnknownOperator(String),
|
||||||
AttemptToInsertHashOrStringInst,
|
MemoryEmpty,
|
||||||
AttemptToInsertEmptyConst,
|
|
||||||
AttemptToInsertALabel,
|
|
||||||
}
|
}
|
||||||
|
|
||||||
impl Display for RunError {
|
impl Display for RunError {
|
||||||
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
|
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
|
||||||
match self {
|
match self {
|
||||||
RunError::RequestArgsInMainModule => {
|
RunError::RequestArgsInMainModule => write!(f, "Can't require arguments in the main module"),
|
||||||
write!(f, "Can't require arguments in the main module")
|
RunError::ExecuteItself(mod_name) => write!(f, "Module {}: Can't execute itself", mod_name),
|
||||||
}
|
|
||||||
RunError::ExecuteItself(mod_name) => {
|
|
||||||
write!(f, "Module {}: Can't execute itself", mod_name)
|
|
||||||
}
|
|
||||||
RunError::FailToReadFile => write!(f, "Unable to read file"),
|
RunError::FailToReadFile => write!(f, "Unable to read file"),
|
||||||
RunError::FailToGetCharFromConsole => write!(f, "Failed to get character from console"),
|
RunError::FailToGetCharFromConsole => write!(f, "Failed to get character from console"),
|
||||||
RunError::InvalidInputUShortInt => write!(
|
RunError::InvalidInputUShortInt => write!(f, "Invalid input. Please enter a valid unsigned short integer"),
|
||||||
f,
|
|
||||||
"Invalid input. Please enter a valid unsigned short integer"
|
|
||||||
),
|
|
||||||
RunError::PickTooDeep => write!(f, "Picking too deep"),
|
RunError::PickTooDeep => write!(f, "Picking too deep"),
|
||||||
RunError::PickOutOfBounds => write!(f, "Trying to get a value out of bounds"),
|
RunError::PickOutOfBounds => write!(f, "Trying to get a value out of bounds"),
|
||||||
RunError::FailToReadLineFromConsole => write!(f, "Failed to read line from console"),
|
RunError::FailToReadLineFromConsole => write!(f, "Failed to read line from console"),
|
||||||
RunError::UnknownLabel(label_name) => write!(f, "Unknown label: {}", label_name),
|
RunError::UnknownLabel(label_name) => write!(f, "Unknown label: {}", label_name),
|
||||||
RunError::InvalidExpressionUnknownOperator(name) => {
|
RunError::InvalidExpressionUnknownOperator(name) => write!(f, "Invalid expression: unknown operator '{}'", name),
|
||||||
write!(f, "Invalid expression: unknown operator '{}'", name)
|
RunError::MemoryEmpty => write!(f, "No elements in memory!"),
|
||||||
}
|
|
||||||
RunError::AttemptToInsertHashOrStringInst => {
|
|
||||||
write!(f, "Attempt to insert a hash/string-instruction")
|
|
||||||
}
|
|
||||||
RunError::AttemptToInsertEmptyConst => write!(f, "Attempt to insert an empty constant"),
|
|
||||||
RunError::AttemptToInsertALabel => write!(f, "Attempt to insert a label"),
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
pub enum ParseError {
|
pub enum ParseError {
|
||||||
ArgumentNotRequired(String, usize, String),
|
DataNotAUInt(String, usize)
|
||||||
}
|
}
|
||||||
|
|
||||||
impl Display for ParseError {
|
impl Display for ParseError {
|
||||||
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
|
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
|
||||||
match self {
|
match self {
|
||||||
ParseError::ArgumentNotRequired(name, line_number, line) => write!(
|
ParseError::DataNotAUInt(name, line) => write!(f, "Argument for {0} at {1} isn't a number", name, line),
|
||||||
f,
|
|
||||||
"ParseError:\n{1} | {2}\nerror: string argument for {0} not required",
|
|
||||||
name, line_number, line
|
|
||||||
),
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
185
src/execute.rs
185
src/execute.rs
@ -1,7 +1,4 @@
|
|||||||
use crate::{
|
use crate::{instructions, stack::Stack};
|
||||||
instructions,
|
|
||||||
stack::{Instruction, Stack},
|
|
||||||
};
|
|
||||||
|
|
||||||
fn find_labels(stack: &mut Stack) {
|
fn find_labels(stack: &mut Stack) {
|
||||||
while stack.program_counter < (stack.program.len() as u16) {
|
while stack.program_counter < (stack.program.len() as u16) {
|
||||||
@ -14,7 +11,7 @@ fn find_labels(stack: &mut Stack) {
|
|||||||
|
|
||||||
if stack.labels[label.data as usize].is_some() {
|
if stack.labels[label.data as usize].is_some() {
|
||||||
eprintln!("Label {} already defined", label.data);
|
eprintln!("Label {} already defined", label.data);
|
||||||
std::process::exit(2);
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
if label.data == 0 {
|
if label.data == 0 {
|
||||||
@ -25,168 +22,64 @@ fn find_labels(stack: &mut Stack) {
|
|||||||
stack.labels[label.data as usize] = Some(stack.program_counter as i16);
|
stack.labels[label.data as usize] = Some(stack.program_counter as i16);
|
||||||
}
|
}
|
||||||
|
|
||||||
stack.program_counter = stack.labels[0].unwrap_or(0) as u16;
|
if stack.labels[0].is_some() {
|
||||||
}
|
stack.program_counter = stack.labels[0].unwrap() as u16;
|
||||||
|
} else {
|
||||||
fn find_prefix_operators(instruction: &mut Instruction) {
|
stack.program_counter = 0;
|
||||||
match instruction.name.chars().nth(0) {
|
|
||||||
Some('|') => {
|
|
||||||
instruction.name = instruction.name.chars().skip(1).collect();
|
|
||||||
|
|
||||||
instruction.ispiped = true;
|
|
||||||
}
|
|
||||||
Some('/') => {
|
|
||||||
instruction.name = instruction.name.chars().skip(1).collect();
|
|
||||||
|
|
||||||
instruction.isdrained = true;
|
|
||||||
}
|
|
||||||
_ => {}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
pub fn execute(stack: &mut Stack, mut origin_stack: Option<&mut Stack>, mod_name: String) {
|
pub fn execute(stack: &mut Stack, mut origin_stack: Option<&mut Stack>, mod_name: &String) {
|
||||||
find_labels(stack);
|
find_labels(stack);
|
||||||
|
|
||||||
while let Some(mut instruction) = stack.program.get_mut(stack.program_counter as usize) {
|
while let Some(instruction) = stack.program.get(stack.program_counter as usize) {
|
||||||
stack.program_counter += 1;
|
stack.program_counter += 1;
|
||||||
|
|
||||||
find_prefix_operators(&mut instruction);
|
|
||||||
|
|
||||||
if instruction.ispiped {
|
|
||||||
instruction.data = stack.memory.pop();
|
|
||||||
}
|
|
||||||
|
|
||||||
if instruction.isdrained {
|
|
||||||
stack.memory.push(instruction.data);
|
|
||||||
instruction.data = 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
if instruction.name.chars().nth(0) == Some('#')
|
|
||||||
|| instruction.name.chars().nth(0) == Some('$')
|
|
||||||
{
|
|
||||||
instruction.name = instruction.name.chars().skip(1).collect();
|
|
||||||
}
|
|
||||||
|
|
||||||
if instruction.name.starts_with('@') {
|
if instruction.name.starts_with('@') {
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
|
|
||||||
match instruction.name.as_str() {
|
match instruction.name.as_str() {
|
||||||
// Stack operations
|
// Stack operations
|
||||||
"push" => instructions::stack_manage::push(&mut stack.memory, instruction.data),
|
"PUSH" => instructions::push::push(&mut stack.memory, &instruction.data),
|
||||||
"pop" => instructions::stack_manage::pop(&mut stack.memory),
|
"PICK" => instructions::pick::pick(&mut stack.memory, &instruction.data),
|
||||||
"dup" => instructions::stack_manage::dup(&mut stack.memory),
|
"POP" => instructions::pop::pop(&mut stack.memory),
|
||||||
"swap" => instructions::stack_manage::swap(&mut stack.memory),
|
"DUP" => instructions::dup::dup(&mut stack.memory),
|
||||||
"pick" => instructions::stack_manage::pick(&mut stack.memory, instruction.data),
|
"SWAP" => instructions::swap::swap(&mut stack.memory),
|
||||||
"string" => instructions::stack_manage::string(&mut stack.memory, instruction.arg.clone()),
|
"MEOW" => instructions::meow::meow(&mut stack.memory),
|
||||||
|
"DUMP" => instructions::dump::dump(&mut stack.memory),
|
||||||
|
"SIZE" => instructions::size::size(&mut stack.memory),
|
||||||
|
"MAXSIZE" => instructions::maxsize::maxsize(&mut stack.memory),
|
||||||
|
|
||||||
|
"#EXPR" => instructions::expr::expr(&mut stack.memory, &instruction.arg),
|
||||||
|
|
||||||
|
// Labels
|
||||||
|
"JMP" => instructions::jmp::jmp(&mut stack.labels, &mut stack.program_counter, &instruction.data),
|
||||||
|
"JNZ" => instructions::jnz::jnz(&mut stack.memory, &mut stack.labels, &mut stack.program_counter, &instruction.data),
|
||||||
|
"JZ" => instructions::jz::jz(&mut stack.memory, &mut stack.labels, &mut stack.program_counter, &instruction.data),
|
||||||
|
|
||||||
// Math operations
|
// Math operations
|
||||||
"add" => instructions::math::add(&mut stack.memory),
|
"ADD" => instructions::add::add(&mut stack.memory),
|
||||||
"sub" => instructions::math::sub(&mut stack.memory),
|
"SUB" => instructions::sub::sub(&mut stack.memory),
|
||||||
"mul" => instructions::math::mul(&mut stack.memory),
|
"MUL" => instructions::mul::mul(&mut stack.memory),
|
||||||
"div" => instructions::math::div(&mut stack.memory),
|
"DIV" => instructions::div::div(&mut stack.memory),
|
||||||
"mod" => instructions::math::modulo(&mut stack.memory),
|
|
||||||
|
|
||||||
// Logic
|
// Console operations
|
||||||
"and" => instructions::logic::and(&mut stack.memory),
|
"PUTC" => instructions::putc::putc(&mut stack.memory),
|
||||||
"or" => instructions::logic::or(&mut stack.memory),
|
"GETC" => instructions::getc::getc(&mut stack.memory),
|
||||||
"xor" => instructions::logic::xor(&mut stack.memory),
|
"SCAN" => instructions::scan::scan(&mut stack.memory),
|
||||||
"nand" => instructions::logic::nand(&mut stack.memory),
|
|
||||||
"not" => instructions::logic::not(&mut stack.memory),
|
|
||||||
|
|
||||||
// Bitwise
|
|
||||||
"band" => instructions::bitwise::band(&mut stack.memory),
|
|
||||||
"bor" => instructions::bitwise::bor(&mut stack.memory),
|
|
||||||
"bxor" => instructions::bitwise::bxor(&mut stack.memory),
|
|
||||||
"bnand" => instructions::bitwise::bnand(&mut stack.memory),
|
|
||||||
"bnot" => instructions::logic::not(&mut stack.memory),
|
|
||||||
|
|
||||||
// Flow-control
|
|
||||||
"jmp" => instructions::flow_control::jmp(
|
|
||||||
&mut stack.labels,
|
|
||||||
&mut stack.program_counter,
|
|
||||||
instruction.data,
|
|
||||||
),
|
|
||||||
"rjmp" => instructions::specific::rjmp(
|
|
||||||
&mut stack.memory,
|
|
||||||
&mut stack.labels,
|
|
||||||
&mut stack.program_counter,
|
|
||||||
),
|
|
||||||
"jnz" => instructions::flow_control::jnz(
|
|
||||||
&mut stack.memory,
|
|
||||||
&mut stack.labels,
|
|
||||||
&mut stack.program_counter,
|
|
||||||
instruction.data,
|
|
||||||
),
|
|
||||||
"jz" => instructions::flow_control::jz(
|
|
||||||
&mut stack.memory,
|
|
||||||
&mut stack.labels,
|
|
||||||
&mut stack.program_counter,
|
|
||||||
instruction.data,
|
|
||||||
),
|
|
||||||
"kjnz" => instructions::flow_control::kjnz(
|
|
||||||
&mut stack.memory,
|
|
||||||
&mut stack.labels,
|
|
||||||
&mut stack.program_counter,
|
|
||||||
instruction.data,
|
|
||||||
),
|
|
||||||
"kjz" => instructions::flow_control::kjz(
|
|
||||||
&mut stack.memory,
|
|
||||||
&mut stack.labels,
|
|
||||||
&mut stack.program_counter,
|
|
||||||
instruction.data,
|
|
||||||
),
|
|
||||||
|
|
||||||
// Input/Output
|
|
||||||
"putc" => instructions::io::putc(&mut stack.memory),
|
|
||||||
"getc" => instructions::io::getc(&mut stack.memory),
|
|
||||||
"scan" => instructions::io::scan(&mut stack.memory),
|
|
||||||
"meow" => instructions::io::meow(&mut stack.memory),
|
|
||||||
"print" => instructions::io::print(instruction.arg.clone()),
|
|
||||||
"println" => instructions::io::println(instruction.arg.clone()),
|
|
||||||
|
|
||||||
// Modules
|
// Modules
|
||||||
"args" => {
|
"ARGS" => instructions::args::args(&mut stack.memory, &mut origin_stack, &instruction.data),
|
||||||
instructions::modules::args(&mut stack.memory, &mut origin_stack, instruction.data)
|
"#EXEC" => instructions::exec::exec(stack, &instruction.arg.clone(), &mod_name),
|
||||||
}
|
|
||||||
"exec" => {
|
|
||||||
let arg = instruction.arg.clone();
|
|
||||||
instructions::modules::exec(stack, arg, mod_name.clone())
|
|
||||||
},
|
|
||||||
"call" => {
|
|
||||||
let arg = instruction.arg.clone();
|
|
||||||
instructions::modules::call(stack, arg)
|
|
||||||
},
|
|
||||||
"native" => {
|
|
||||||
let arg = instruction.arg.clone();
|
|
||||||
unsafe {instructions::native::native(stack, arg)}
|
|
||||||
},
|
|
||||||
|
|
||||||
// Self-modifying
|
|
||||||
"insert" => {
|
|
||||||
let arg = instruction.arg.clone();
|
|
||||||
let data = instruction.data.clone();
|
|
||||||
instructions::self_modify::insert(&mut stack.program, arg, data)
|
|
||||||
}
|
|
||||||
|
|
||||||
// Special
|
|
||||||
"dump" => instructions::special::dump(&mut stack.memory),
|
|
||||||
"size" => instructions::special::size(&mut stack.memory),
|
|
||||||
"maxsize" => instructions::special::maxsize(&mut stack.memory),
|
|
||||||
"expr" => instructions::special::expr(&mut stack.memory, instruction.arg.clone()),
|
|
||||||
"field" => continue,
|
|
||||||
"quit" => break,
|
|
||||||
"exit" => instructions::special::exit(instruction.data),
|
|
||||||
|
|
||||||
// Platform-specific
|
|
||||||
#[cfg(target_family = "unix")]
|
#[cfg(target_family = "unix")]
|
||||||
"_unix_random" => instructions::platform_specific::_unix_random(&mut stack.memory),
|
"_UNIX_RANDOM" => instructions::_unix_random::_unix_random(&mut stack.memory),
|
||||||
|
|
||||||
#[cfg(not(target_family = "unix"))]
|
// ?
|
||||||
"_unix_random" => instructions::specific::random(&mut stack.memory),
|
"NOP" => continue,
|
||||||
|
"EXIT" => instructions::exit::exit(&instruction.data),
|
||||||
// Labast-specific
|
"QUIT" => std::process::exit(0),
|
||||||
"random" => instructions::specific::random(&mut stack.memory),
|
|
||||||
|
|
||||||
_ => {
|
_ => {
|
||||||
eprintln!("Unknown instruction: {}", instruction.name);
|
eprintln!("Unknown instruction: {}", instruction.name);
|
||||||
|
|||||||
14
src/instructions/_unix_random.rs
Normal file
14
src/instructions/_unix_random.rs
Normal file
@ -0,0 +1,14 @@
|
|||||||
|
use std::fs::File;
|
||||||
|
use std::io::Read;
|
||||||
|
use crate::RunError;
|
||||||
|
|
||||||
|
#[cfg(target_family = "unix")]
|
||||||
|
pub fn _unix_random(memory: &mut Vec<u16>) {
|
||||||
|
let mut rng = File::open("/dev/urandom").unwrap();
|
||||||
|
|
||||||
|
let mut buffer = [0u8; 1];
|
||||||
|
rng.read_exact(&mut buffer).unwrap();
|
||||||
|
|
||||||
|
let data = &memory.pop().expect(&format!("{}", RunError::MemoryEmpty));
|
||||||
|
memory.push((buffer[0] as u16) % (*data - 1));
|
||||||
|
}
|
||||||
8
src/instructions/add.rs
Normal file
8
src/instructions/add.rs
Normal file
@ -0,0 +1,8 @@
|
|||||||
|
use crate::errors::RunError;
|
||||||
|
|
||||||
|
pub fn add(memory: &mut Vec<u16>) {
|
||||||
|
let a: u16 = memory.pop().expect(&format!("{}", RunError::MemoryEmpty));
|
||||||
|
let b: u16 = memory.pop().expect(&format!("{}", RunError::MemoryEmpty));
|
||||||
|
|
||||||
|
memory.push(a + b);
|
||||||
|
}
|
||||||
21
src/instructions/args.rs
Normal file
21
src/instructions/args.rs
Normal file
@ -0,0 +1,21 @@
|
|||||||
|
use crate::{errors::RunError, stack::Stack};
|
||||||
|
|
||||||
|
pub fn args(memory: &mut Vec<u16>, origin_stack: &mut Option<&mut Stack>, data: &u16) {
|
||||||
|
let origin_memory = &mut origin_stack.as_mut().expect(&format!("{}", RunError::RequestArgsInMainModule)).memory;
|
||||||
|
|
||||||
|
if *origin_memory == *memory {
|
||||||
|
eprintln!("{}", RunError::RequestArgsInMainModule);
|
||||||
|
std::process::exit(2);
|
||||||
|
}
|
||||||
|
|
||||||
|
let quanity: u16;
|
||||||
|
if *data == 0 {
|
||||||
|
quanity = origin_memory.pop().expect(&format!("{}", RunError::MemoryEmpty));
|
||||||
|
} else {
|
||||||
|
quanity = *data;
|
||||||
|
}
|
||||||
|
|
||||||
|
for _ in 0..quanity {
|
||||||
|
memory.push(origin_memory.pop().expect(&format!("{}", RunError::MemoryEmpty)));
|
||||||
|
}
|
||||||
|
}
|
||||||
@ -1,29 +0,0 @@
|
|||||||
use crate::stack::StackVec;
|
|
||||||
|
|
||||||
pub fn band(memory: &mut StackVec) {
|
|
||||||
let a: u16 = memory.pop();
|
|
||||||
let b: u16 = memory.pop();
|
|
||||||
|
|
||||||
memory.push(a & b);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn bor(memory: &mut StackVec) {
|
|
||||||
let a: u16 = memory.pop();
|
|
||||||
let b: u16 = memory.pop();
|
|
||||||
|
|
||||||
memory.push(a | b);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn bxor(memory: &mut StackVec) {
|
|
||||||
let a: u16 = memory.pop();
|
|
||||||
let b: u16 = memory.pop();
|
|
||||||
|
|
||||||
memory.push(a ^ b);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn bnand(memory: &mut StackVec) {
|
|
||||||
let a: u16 = memory.pop();
|
|
||||||
let b: u16 = memory.pop();
|
|
||||||
|
|
||||||
memory.push(!(a & b));
|
|
||||||
}
|
|
||||||
8
src/instructions/div.rs
Normal file
8
src/instructions/div.rs
Normal file
@ -0,0 +1,8 @@
|
|||||||
|
use crate::errors::RunError;
|
||||||
|
|
||||||
|
pub fn div(memory: &mut Vec<u16>) {
|
||||||
|
let a: u16 = memory.pop().expect(&format!("{}", RunError::MemoryEmpty));
|
||||||
|
let b: u16 = memory.pop().expect(&format!("{}", RunError::MemoryEmpty));
|
||||||
|
|
||||||
|
memory.push(b / a);
|
||||||
|
}
|
||||||
10
src/instructions/dump.rs
Normal file
10
src/instructions/dump.rs
Normal file
@ -0,0 +1,10 @@
|
|||||||
|
pub fn dump(memory: &mut Vec<u16>) {
|
||||||
|
if memory.is_empty() {
|
||||||
|
println!("Stack is empty.");
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
for (i, entry) in memory.iter().enumerate() {
|
||||||
|
println!("{0}: {1}", i, entry);
|
||||||
|
}
|
||||||
|
}
|
||||||
5
src/instructions/dup.rs
Normal file
5
src/instructions/dup.rs
Normal file
@ -0,0 +1,5 @@
|
|||||||
|
use crate::errors::RunError;
|
||||||
|
|
||||||
|
pub fn dup(memory: &mut Vec<u16>) {
|
||||||
|
memory.push(*memory.last().expect(&format!("{}", RunError::MemoryEmpty)));
|
||||||
|
}
|
||||||
20
src/instructions/exec.rs
Normal file
20
src/instructions/exec.rs
Normal file
@ -0,0 +1,20 @@
|
|||||||
|
use std::fs;
|
||||||
|
use crate::{parse, execute, Stack, errors::RunError};
|
||||||
|
|
||||||
|
pub fn exec(mut stack: &mut Stack, arg: &String, mod_name: &String) {
|
||||||
|
if mod_name == arg {
|
||||||
|
eprintln!("{}", RunError::ExecuteItself(arg.to_string()));
|
||||||
|
std::process::exit(2);
|
||||||
|
}
|
||||||
|
|
||||||
|
let lines = fs::read_to_string(&arg).expect(&format!("{}", RunError::FailToReadFile));
|
||||||
|
let mut temp_stack = Stack::new();
|
||||||
|
|
||||||
|
parse(&mut temp_stack, &lines);
|
||||||
|
|
||||||
|
execute(&mut temp_stack, Some(&mut stack), &arg.clone());
|
||||||
|
|
||||||
|
for item in temp_stack.memory {
|
||||||
|
stack.memory.push(item);
|
||||||
|
}
|
||||||
|
}
|
||||||
3
src/instructions/exit.rs
Normal file
3
src/instructions/exit.rs
Normal file
@ -0,0 +1,3 @@
|
|||||||
|
pub fn exit(data: &u16) {
|
||||||
|
std::process::exit((*data).into());
|
||||||
|
}
|
||||||
31
src/instructions/expr.rs
Normal file
31
src/instructions/expr.rs
Normal file
@ -0,0 +1,31 @@
|
|||||||
|
use crate::errors::RunError;
|
||||||
|
|
||||||
|
pub fn expr(memory: &mut Vec<u16>, arg: &String) {
|
||||||
|
for code in arg.chars() {
|
||||||
|
match code {
|
||||||
|
'>' => memory.push(0),
|
||||||
|
'$' => { memory.pop(); },
|
||||||
|
':' => memory.push(*memory.last().expect(&format!("{}", RunError::MemoryEmpty))),
|
||||||
|
'\\' => {
|
||||||
|
let ax = memory.pop().expect(&format!("{}", RunError::MemoryEmpty));
|
||||||
|
let ax2 = memory.pop().expect(&format!("{}", RunError::MemoryEmpty));
|
||||||
|
|
||||||
|
memory.push(ax);
|
||||||
|
memory.push(ax2);
|
||||||
|
}
|
||||||
|
'+' => {
|
||||||
|
let ax = memory.pop().expect(&format!("{}", RunError::MemoryEmpty));
|
||||||
|
memory.push(ax + 1);
|
||||||
|
}
|
||||||
|
'-' => {
|
||||||
|
let ax = memory.pop().expect(&format!("{}", RunError::MemoryEmpty));
|
||||||
|
memory.push(ax - 1);
|
||||||
|
}
|
||||||
|
|
||||||
|
_ => {
|
||||||
|
eprintln!("{}", RunError::InvalidExpressionUnknownOperator(code.to_string()));
|
||||||
|
std::process::exit(2);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
@ -1,74 +0,0 @@
|
|||||||
use crate::{errors::RunError, stack::StackVec};
|
|
||||||
|
|
||||||
pub fn jmp(labels: &mut [Option<i16>; 256], program_counter: &mut u16, data: u16) {
|
|
||||||
if labels[data as usize].is_none() {
|
|
||||||
eprintln!("{}", RunError::UnknownLabel(data));
|
|
||||||
std::process::exit(2);
|
|
||||||
}
|
|
||||||
|
|
||||||
*program_counter = (labels[data as usize].unwrap() - 1) as u16;
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn jnz(
|
|
||||||
memory: &mut StackVec,
|
|
||||||
labels: &mut [Option<i16>; 256],
|
|
||||||
program_counter: &mut u16,
|
|
||||||
data: u16,
|
|
||||||
) {
|
|
||||||
if labels[data as usize].is_none() {
|
|
||||||
eprintln!("{}", RunError::UnknownLabel(data));
|
|
||||||
std::process::exit(2);
|
|
||||||
}
|
|
||||||
|
|
||||||
if memory.pop() != 0 {
|
|
||||||
*program_counter = (labels[data as usize].unwrap() - 1) as u16;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn jz(
|
|
||||||
memory: &mut StackVec,
|
|
||||||
labels: &mut [Option<i16>; 256],
|
|
||||||
program_counter: &mut u16,
|
|
||||||
data: u16,
|
|
||||||
) {
|
|
||||||
if labels[data as usize].is_none() {
|
|
||||||
eprintln!("{}", RunError::UnknownLabel(data));
|
|
||||||
std::process::exit(2);
|
|
||||||
}
|
|
||||||
|
|
||||||
if memory.pop() == 0 {
|
|
||||||
*program_counter = (labels[data as usize].unwrap() - 1) as u16;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn kjnz(
|
|
||||||
memory: &mut StackVec,
|
|
||||||
labels: &mut [Option<i16>; 256],
|
|
||||||
program_counter: &mut u16,
|
|
||||||
data: u16,
|
|
||||||
) {
|
|
||||||
if labels[data as usize].is_none() {
|
|
||||||
eprintln!("{}", RunError::UnknownLabel(data));
|
|
||||||
std::process::exit(2);
|
|
||||||
}
|
|
||||||
|
|
||||||
if memory.last() != 0 {
|
|
||||||
*program_counter = (labels[data as usize].unwrap() - 1) as u16;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn kjz(
|
|
||||||
memory: &mut StackVec,
|
|
||||||
labels: &mut [Option<i16>; 256],
|
|
||||||
program_counter: &mut u16,
|
|
||||||
data: u16,
|
|
||||||
) {
|
|
||||||
if labels[data as usize].is_none() {
|
|
||||||
eprintln!("{}", RunError::UnknownLabel(data));
|
|
||||||
std::process::exit(2);
|
|
||||||
}
|
|
||||||
|
|
||||||
if memory.last() == 0 {
|
|
||||||
*program_counter = (labels[data as usize].unwrap() - 1) as u16;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
13
src/instructions/getc.rs
Normal file
13
src/instructions/getc.rs
Normal file
@ -0,0 +1,13 @@
|
|||||||
|
use std::io::Read;
|
||||||
|
use crate::errors::RunError;
|
||||||
|
|
||||||
|
pub fn getc(memory: &mut Vec<u16>) {
|
||||||
|
let char = std::io::stdin()
|
||||||
|
.bytes()
|
||||||
|
.next()
|
||||||
|
.and_then(|result| result.ok())
|
||||||
|
.map(|byte| byte as u16)
|
||||||
|
.expect(&format!("{}", RunError::FailToGetCharFromConsole));
|
||||||
|
|
||||||
|
memory.push(char);
|
||||||
|
}
|
||||||
@ -1,43 +0,0 @@
|
|||||||
use crate::{errors::RunError, stack::StackVec};
|
|
||||||
use std::io::Read;
|
|
||||||
|
|
||||||
pub fn putc(memory: &mut StackVec) {
|
|
||||||
print!("{}", memory.pop() as u8 as char);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn getc(memory: &mut StackVec) {
|
|
||||||
let char = std::io::stdin()
|
|
||||||
.bytes()
|
|
||||||
.next()
|
|
||||||
.and_then(|result| result.ok())
|
|
||||||
.map(|byte| byte as u16)
|
|
||||||
.expect(&format!("{}", RunError::FailToGetCharFromConsole));
|
|
||||||
|
|
||||||
memory.push(char);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn scan(memory: &mut StackVec) {
|
|
||||||
let mut input = String::new();
|
|
||||||
|
|
||||||
std::io::stdin()
|
|
||||||
.read_line(&mut input)
|
|
||||||
.expect(&format!("{}", RunError::FailToReadLineFromConsole));
|
|
||||||
|
|
||||||
let num = input
|
|
||||||
.trim()
|
|
||||||
.parse()
|
|
||||||
.expect(&format!("{}", RunError::InvalidInputUShortInt));
|
|
||||||
memory.push(num);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn meow(memory: &mut StackVec) {
|
|
||||||
println!("{}", memory.pop());
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn print(arg: String) {
|
|
||||||
print!("{}", arg);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn println(arg: String) {
|
|
||||||
println!("{}", arg);
|
|
||||||
}
|
|
||||||
10
src/instructions/jmp.rs
Normal file
10
src/instructions/jmp.rs
Normal file
@ -0,0 +1,10 @@
|
|||||||
|
use crate::errors::RunError;
|
||||||
|
|
||||||
|
pub fn jmp(labels: &mut [Option<i16>; 256], program_counter: &mut u16, data: &u16) {
|
||||||
|
if labels[*data as usize].is_none() {
|
||||||
|
eprintln!("{}", RunError::UnknownLabel(*data));
|
||||||
|
std::process::exit(2);
|
||||||
|
}
|
||||||
|
|
||||||
|
*program_counter = (labels[*data as usize].unwrap() - 1) as u16;
|
||||||
|
}
|
||||||
12
src/instructions/jnz.rs
Normal file
12
src/instructions/jnz.rs
Normal file
@ -0,0 +1,12 @@
|
|||||||
|
use crate::errors::RunError;
|
||||||
|
|
||||||
|
pub fn jnz(memory: &mut Vec<u16>, labels: &mut [Option<i16>; 256], program_counter: &mut u16, data: &u16) {
|
||||||
|
if labels[*data as usize].is_none() {
|
||||||
|
eprintln!("{}", RunError::UnknownLabel(*data));
|
||||||
|
std::process::exit(2);
|
||||||
|
}
|
||||||
|
|
||||||
|
if memory.last() != Some(&0) {
|
||||||
|
*program_counter = (labels[*data as usize].unwrap() - 1) as u16;
|
||||||
|
}
|
||||||
|
}
|
||||||
12
src/instructions/jz.rs
Normal file
12
src/instructions/jz.rs
Normal file
@ -0,0 +1,12 @@
|
|||||||
|
use crate::errors::RunError;
|
||||||
|
|
||||||
|
pub fn jz(memory: &mut Vec<u16>, labels: &mut [Option<i16>; 256], program_counter: &mut u16, data: &u16) {
|
||||||
|
if labels[*data as usize].is_none() {
|
||||||
|
eprintln!("{}", RunError::UnknownLabel(*data));
|
||||||
|
std::process::exit(2);
|
||||||
|
}
|
||||||
|
|
||||||
|
if memory.last() == Some(&0) {
|
||||||
|
*program_counter = (labels[*data as usize].unwrap() - 1) as u16;
|
||||||
|
}
|
||||||
|
}
|
||||||
@ -1,45 +0,0 @@
|
|||||||
use crate::stack::StackVec;
|
|
||||||
|
|
||||||
pub fn and(memory: &mut StackVec) {
|
|
||||||
let a: bool = memory.pop() == 1;
|
|
||||||
let b: bool = memory.pop() == 1;
|
|
||||||
|
|
||||||
let c: u16 = if a && b { 1 } else { 0 };
|
|
||||||
|
|
||||||
memory.push(c);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn or(memory: &mut StackVec) {
|
|
||||||
let a: bool = memory.pop() == 1;
|
|
||||||
let b: bool = memory.pop() == 1;
|
|
||||||
|
|
||||||
let c: u16 = if a || b { 1 } else { 0 };
|
|
||||||
|
|
||||||
memory.push(c);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn xor(memory: &mut StackVec) {
|
|
||||||
let a: bool = memory.pop() == 1;
|
|
||||||
let b: bool = memory.pop() == 1;
|
|
||||||
|
|
||||||
let c: u16 = if !a != !b { 1 } else { 0 };
|
|
||||||
|
|
||||||
memory.push(c);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn nand(memory: &mut StackVec) {
|
|
||||||
let a: bool = memory.pop() == 1;
|
|
||||||
let b: bool = memory.pop() == 1;
|
|
||||||
|
|
||||||
let c: u16 = if !(a && b) { 1 } else { 0 };
|
|
||||||
|
|
||||||
memory.push(c);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn not(memory: &mut StackVec) {
|
|
||||||
let a: bool = memory.pop() == 1;
|
|
||||||
|
|
||||||
let c: u16 = if !a { 1 } else { 0 };
|
|
||||||
|
|
||||||
memory.push(c);
|
|
||||||
}
|
|
||||||
@ -1,36 +0,0 @@
|
|||||||
use crate::stack::StackVec;
|
|
||||||
|
|
||||||
pub fn add(memory: &mut StackVec) {
|
|
||||||
let a: u16 = memory.pop();
|
|
||||||
let b: u16 = memory.pop();
|
|
||||||
|
|
||||||
memory.push(a + b);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn sub(memory: &mut StackVec) {
|
|
||||||
let a: u16 = memory.pop();
|
|
||||||
let b: u16 = memory.pop();
|
|
||||||
|
|
||||||
memory.push(b - a);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn mul(memory: &mut StackVec) {
|
|
||||||
let a: u16 = memory.pop();
|
|
||||||
let b: u16 = memory.pop();
|
|
||||||
|
|
||||||
memory.push(b * a);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn div(memory: &mut StackVec) {
|
|
||||||
let a: u16 = memory.pop();
|
|
||||||
let b: u16 = memory.pop();
|
|
||||||
|
|
||||||
memory.push(b / a);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn modulo(memory: &mut StackVec) {
|
|
||||||
let a: u16 = memory.pop();
|
|
||||||
let b: u16 = memory.pop();
|
|
||||||
|
|
||||||
memory.push(b % a);
|
|
||||||
}
|
|
||||||
3
src/instructions/maxsize.rs
Normal file
3
src/instructions/maxsize.rs
Normal file
@ -0,0 +1,3 @@
|
|||||||
|
pub fn maxsize(memory: &mut Vec<u16>) {
|
||||||
|
memory.push(65535);
|
||||||
|
}
|
||||||
5
src/instructions/meow.rs
Normal file
5
src/instructions/meow.rs
Normal file
@ -0,0 +1,5 @@
|
|||||||
|
use crate::errors::RunError;
|
||||||
|
|
||||||
|
pub fn meow(memory: &mut Vec<u16>) {
|
||||||
|
println!("{}", memory.pop().expect(&format!("{}", RunError::MemoryEmpty)));
|
||||||
|
}
|
||||||
@ -1,12 +1,25 @@
|
|||||||
pub mod bitwise;
|
pub mod push;
|
||||||
pub mod flow_control;
|
pub mod pop;
|
||||||
pub mod io;
|
pub mod dup;
|
||||||
pub mod logic;
|
pub mod swap;
|
||||||
pub mod math;
|
pub mod add;
|
||||||
pub mod modules;
|
pub mod sub;
|
||||||
pub mod platform_specific;
|
pub mod mul;
|
||||||
pub mod self_modify;
|
pub mod div;
|
||||||
pub mod special;
|
pub mod jmp;
|
||||||
pub mod specific;
|
pub mod jnz;
|
||||||
pub mod stack_manage;
|
pub mod jz;
|
||||||
pub mod native;
|
pub mod pick;
|
||||||
|
pub mod putc;
|
||||||
|
pub mod getc;
|
||||||
|
pub mod meow;
|
||||||
|
pub mod dump;
|
||||||
|
pub mod scan;
|
||||||
|
pub mod exec;
|
||||||
|
pub mod args;
|
||||||
|
pub mod expr;
|
||||||
|
pub mod size;
|
||||||
|
pub mod exit;
|
||||||
|
pub mod maxsize;
|
||||||
|
#[cfg(target_family = "unix")]
|
||||||
|
pub mod _unix_random;
|
||||||
|
|||||||
@ -1,46 +0,0 @@
|
|||||||
use crate::{errors::RunError, execute, parse, stack::StackVec, Stack};
|
|
||||||
use std::fs;
|
|
||||||
|
|
||||||
pub fn args(memory: &mut StackVec, origin_stack: &mut Option<&mut Stack>, data: u16) {
|
|
||||||
if let Some(origin_stack) = origin_stack.as_mut() {
|
|
||||||
let mut data = data;
|
|
||||||
|
|
||||||
if data == 0 {
|
|
||||||
data = origin_stack.memory.pop();
|
|
||||||
}
|
|
||||||
|
|
||||||
for _ in 0..data {
|
|
||||||
memory.push(origin_stack.memory.pop());
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
eprintln!("{}", RunError::RequestArgsInMainModule);
|
|
||||||
std::process::exit(2);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn exec(mut stack: &mut Stack, arg: String, mod_name: String) {
|
|
||||||
if mod_name == arg {
|
|
||||||
eprintln!("{}", RunError::ExecuteItself(arg.to_string()));
|
|
||||||
std::process::exit(2);
|
|
||||||
}
|
|
||||||
|
|
||||||
let lines = fs::read_to_string(&arg).expect(&format!("{}", RunError::FailToReadFile));
|
|
||||||
let mut temp_stack = Stack::new(stack.memory.size());
|
|
||||||
|
|
||||||
parse(&mut temp_stack, &lines);
|
|
||||||
execute(&mut temp_stack, Some(&mut stack), arg.clone());
|
|
||||||
|
|
||||||
for item in temp_stack.memory.iter() {
|
|
||||||
stack.memory.push(*item);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn call(stack: &mut Stack, mod_name: String) {
|
|
||||||
let len: u16 = stack.memory.pop();
|
|
||||||
let mut rev: String = String::new();
|
|
||||||
for _i in 0..len {
|
|
||||||
rev.push(stack.memory.pop() as u8 as char);
|
|
||||||
}
|
|
||||||
let tocall: String = rev.chars().rev().collect::<String>();
|
|
||||||
exec(stack, tocall, mod_name);
|
|
||||||
}
|
|
||||||
8
src/instructions/mul.rs
Normal file
8
src/instructions/mul.rs
Normal file
@ -0,0 +1,8 @@
|
|||||||
|
use crate::errors::RunError;
|
||||||
|
|
||||||
|
pub fn mul(memory: &mut Vec<u16>) {
|
||||||
|
let a: u16 = memory.pop().expect(&format!("{}", RunError::MemoryEmpty));
|
||||||
|
let b: u16 = memory.pop().expect(&format!("{}", RunError::MemoryEmpty));
|
||||||
|
|
||||||
|
memory.push(b * a);
|
||||||
|
}
|
||||||
@ -1,37 +0,0 @@
|
|||||||
use crate::Stack;
|
|
||||||
use libloading::{Library, Symbol};
|
|
||||||
|
|
||||||
static mut STACKPTR: *mut Stack = 0 as *mut Stack;
|
|
||||||
|
|
||||||
#[no_mangle]
|
|
||||||
unsafe extern fn stack_pop_callback() -> u16 {
|
|
||||||
(*STACKPTR).memory.pop()
|
|
||||||
}
|
|
||||||
|
|
||||||
#[no_mangle]
|
|
||||||
unsafe extern fn stack_push_callback(data: u16) {
|
|
||||||
(*STACKPTR).memory.push(data)
|
|
||||||
}
|
|
||||||
|
|
||||||
#[no_mangle]
|
|
||||||
unsafe extern fn stack_len_callback() -> usize {
|
|
||||||
(*STACKPTR).memory.len()
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
pub unsafe fn native(stack: &mut Stack, arg: String) {
|
|
||||||
STACKPTR = stack as *mut Stack;
|
|
||||||
#[cfg(not(target_family = "windows"))]
|
|
||||||
let libsuf: String = ".so".to_owned();
|
|
||||||
|
|
||||||
#[cfg(target_family = "windows")]
|
|
||||||
let libsuf: String = ".dll".to_owned();
|
|
||||||
|
|
||||||
let module = Library::new(format!("./{}{}", arg, libsuf)).unwrap();
|
|
||||||
// C libraries should use
|
|
||||||
// void (*labashka)(unsigned short (*pop)(void), void (*push)(unsigned short), size_t (*len)(void), size_t max_size);
|
|
||||||
let func: Symbol<unsafe extern "C" fn(unsafe extern fn() -> u16, unsafe extern fn(u16), unsafe extern fn() -> usize, usize)> = module.get(b"labashka").unwrap();
|
|
||||||
func(stack_pop_callback,stack_push_callback,stack_len_callback, stack.memory.size());
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
11
src/instructions/pick.rs
Normal file
11
src/instructions/pick.rs
Normal file
@ -0,0 +1,11 @@
|
|||||||
|
use crate::errors::RunError;
|
||||||
|
|
||||||
|
pub fn pick(memory: &mut Vec<u16>, data: &u16) {
|
||||||
|
if *data > memory.len() as u16 {
|
||||||
|
eprintln!("{}", RunError::PickTooDeep);
|
||||||
|
std::process::exit(2);
|
||||||
|
}
|
||||||
|
|
||||||
|
let arg = memory.pop().expect(&format!("{}", RunError::MemoryEmpty));
|
||||||
|
memory.push(*memory.get(memory.len() - (arg as usize) - 1).expect(&format!("{}", RunError::PickOutOfBounds)));
|
||||||
|
}
|
||||||
@ -1,17 +0,0 @@
|
|||||||
#[cfg(target_family = "unix")]
|
|
||||||
use crate::stack::StackVec;
|
|
||||||
#[cfg(target_family = "unix")]
|
|
||||||
use std::fs::File;
|
|
||||||
#[cfg(target_family = "unix")]
|
|
||||||
use std::io::Read;
|
|
||||||
|
|
||||||
#[cfg(target_family = "unix")]
|
|
||||||
pub fn _unix_random(memory: &mut StackVec) {
|
|
||||||
let mut rng = File::open("/dev/urandom").unwrap();
|
|
||||||
|
|
||||||
let mut buffer = [0u8; 2];
|
|
||||||
rng.read_exact(&mut buffer).unwrap();
|
|
||||||
|
|
||||||
let data = memory.pop();
|
|
||||||
memory.push((u16::from_ne_bytes(buffer)) % (data - 1));
|
|
||||||
}
|
|
||||||
3
src/instructions/pop.rs
Normal file
3
src/instructions/pop.rs
Normal file
@ -0,0 +1,3 @@
|
|||||||
|
pub fn pop(memory: &mut Vec<u16>) {
|
||||||
|
memory.pop();
|
||||||
|
}
|
||||||
3
src/instructions/push.rs
Normal file
3
src/instructions/push.rs
Normal file
@ -0,0 +1,3 @@
|
|||||||
|
pub fn push(memory: &mut Vec<u16>, data: &u16) {
|
||||||
|
memory.push(*data);
|
||||||
|
}
|
||||||
5
src/instructions/putc.rs
Normal file
5
src/instructions/putc.rs
Normal file
@ -0,0 +1,5 @@
|
|||||||
|
use crate::errors::RunError;
|
||||||
|
|
||||||
|
pub fn putc(memory: &mut Vec<u16>) {
|
||||||
|
print!("{}", memory.pop().expect(&format!("{}", RunError::MemoryEmpty)) as u8 as char);
|
||||||
|
}
|
||||||
10
src/instructions/scan.rs
Normal file
10
src/instructions/scan.rs
Normal file
@ -0,0 +1,10 @@
|
|||||||
|
use crate::errors::RunError;
|
||||||
|
|
||||||
|
pub fn scan(memory: &mut Vec<u16>) {
|
||||||
|
let mut input = String::new();
|
||||||
|
|
||||||
|
std::io::stdin().read_line(&mut input).expect(&format!("{}", RunError::FailToReadLineFromConsole));
|
||||||
|
|
||||||
|
let num = input.trim().parse().expect(&format!("{}", RunError::InvalidInputUShortInt));
|
||||||
|
memory.push(num);
|
||||||
|
}
|
||||||
@ -1,28 +0,0 @@
|
|||||||
use crate::{errors::RunError, stack::Instruction};
|
|
||||||
|
|
||||||
pub fn insert(program: &mut Vec<Instruction>, arg: String, data: u16) {
|
|
||||||
let args: Vec<char> = arg.chars().collect();
|
|
||||||
|
|
||||||
if args[0] == '#' || args[0] == '$' {
|
|
||||||
eprintln!("{}", RunError::AttemptToInsertHashOrStringInst);
|
|
||||||
std::process::exit(2);
|
|
||||||
}
|
|
||||||
|
|
||||||
if args[0] == '\n' {
|
|
||||||
eprintln!("{}", RunError::AttemptToInsertEmptyConst);
|
|
||||||
std::process::exit(2);
|
|
||||||
}
|
|
||||||
|
|
||||||
if args[0] == '@' || args[1] == ' ' {
|
|
||||||
eprintln!("{}", RunError::AttemptToInsertALabel);
|
|
||||||
std::process::exit(2);
|
|
||||||
}
|
|
||||||
|
|
||||||
program.push(Instruction {
|
|
||||||
name: arg.to_string(),
|
|
||||||
arg: "\n".to_string(),
|
|
||||||
data,
|
|
||||||
ispiped: false,
|
|
||||||
isdrained: false
|
|
||||||
});
|
|
||||||
}
|
|
||||||
3
src/instructions/size.rs
Normal file
3
src/instructions/size.rs
Normal file
@ -0,0 +1,3 @@
|
|||||||
|
pub fn size(memory: &mut Vec<u16>) {
|
||||||
|
memory.push(memory.len() as u16);
|
||||||
|
}
|
||||||
@ -1,57 +0,0 @@
|
|||||||
use crate::{errors::RunError, stack::StackVec};
|
|
||||||
|
|
||||||
pub fn dump(memory: &mut StackVec) {
|
|
||||||
if memory.is_empty() {
|
|
||||||
println!("Stack is empty.");
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
for (i, entry) in memory.iter().enumerate() {
|
|
||||||
println!("{0}: {1}", i, entry);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn size(memory: &mut StackVec) {
|
|
||||||
memory.push(memory.len() as u16);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn maxsize(memory: &mut StackVec) {
|
|
||||||
memory.push(memory.size() as u16);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn expr(memory: &mut StackVec, arg: String) {
|
|
||||||
for code in arg.chars() {
|
|
||||||
match code {
|
|
||||||
'>' => memory.push(0),
|
|
||||||
'$' => { memory.pop(); },
|
|
||||||
':' => {
|
|
||||||
let data = memory.last().clone();
|
|
||||||
memory.push(data);
|
|
||||||
},
|
|
||||||
'\\' => {
|
|
||||||
let ax = memory.pop();
|
|
||||||
let ax2 = memory.pop();
|
|
||||||
|
|
||||||
memory.push(ax);
|
|
||||||
memory.push(ax2);
|
|
||||||
}
|
|
||||||
'+' => {
|
|
||||||
let ax = memory.pop();
|
|
||||||
memory.push(ax + 1);
|
|
||||||
}
|
|
||||||
'-' => {
|
|
||||||
let ax = memory.pop();
|
|
||||||
memory.push(ax - 1);
|
|
||||||
}
|
|
||||||
|
|
||||||
_ => {
|
|
||||||
eprintln!("{}", RunError::InvalidExpressionUnknownOperator(code.to_string()));
|
|
||||||
std::process::exit(2);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn exit(data: u16) {
|
|
||||||
std::process::exit(data as i32);
|
|
||||||
}
|
|
||||||
@ -1,16 +0,0 @@
|
|||||||
use crate::{errors::RunError, stack::StackVec};
|
|
||||||
use fastrand;
|
|
||||||
|
|
||||||
pub fn random(memory: &mut StackVec) {
|
|
||||||
let data = memory.pop();
|
|
||||||
memory.push(fastrand::u16(..) % (data - 1));
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn rjmp(memory: &mut StackVec, labels: &mut [Option<i16>; 256], program_counter: &mut u16) {
|
|
||||||
let start = memory.pop() as usize;
|
|
||||||
let end = memory.pop() as usize;
|
|
||||||
let rand = fastrand::usize(start..end + 1);
|
|
||||||
|
|
||||||
*program_counter =
|
|
||||||
(labels[rand].expect(&format!("{}", RunError::UnknownLabel(rand as u16))) - 1) as u16;
|
|
||||||
}
|
|
||||||
@ -1,44 +0,0 @@
|
|||||||
use crate::{errors::RunError, stack::StackVec};
|
|
||||||
|
|
||||||
pub fn push(memory: &mut StackVec, data: u16) {
|
|
||||||
memory.push(data);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn pop(memory: &mut StackVec) {
|
|
||||||
memory.pop();
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn dup(memory: &mut StackVec) {
|
|
||||||
let data = memory.last();
|
|
||||||
memory.push(data);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn swap(memory: &mut StackVec) {
|
|
||||||
let a: u16 = memory.pop();
|
|
||||||
let b: u16 = memory.pop();
|
|
||||||
|
|
||||||
memory.push(a);
|
|
||||||
memory.push(b);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn pick(memory: &mut StackVec, data: u16) {
|
|
||||||
if data > memory.len() as u16 {
|
|
||||||
eprintln!("{}", RunError::PickTooDeep);
|
|
||||||
std::process::exit(2);
|
|
||||||
}
|
|
||||||
|
|
||||||
let arg = memory.pop();
|
|
||||||
memory.push(
|
|
||||||
*memory
|
|
||||||
.get(memory.len() - (arg as usize) - 1)
|
|
||||||
.expect(&format!("{}", RunError::PickOutOfBounds)),
|
|
||||||
);
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn string(memory: &mut StackVec, arg: String) {
|
|
||||||
for i in arg.chars() {
|
|
||||||
memory.push(i as u16);
|
|
||||||
}
|
|
||||||
|
|
||||||
memory.push(arg.len() as u16);
|
|
||||||
}
|
|
||||||
8
src/instructions/sub.rs
Normal file
8
src/instructions/sub.rs
Normal file
@ -0,0 +1,8 @@
|
|||||||
|
use crate::errors::RunError;
|
||||||
|
|
||||||
|
pub fn sub(memory: &mut Vec<u16>) {
|
||||||
|
let a: u16 = memory.pop().expect(&format!("{}", RunError::MemoryEmpty));
|
||||||
|
let b: u16 = memory.pop().expect(&format!("{}", RunError::MemoryEmpty));
|
||||||
|
|
||||||
|
memory.push(b - a);
|
||||||
|
}
|
||||||
9
src/instructions/swap.rs
Normal file
9
src/instructions/swap.rs
Normal file
@ -0,0 +1,9 @@
|
|||||||
|
use crate::errors::RunError;
|
||||||
|
|
||||||
|
pub fn swap(memory: &mut Vec<u16>) {
|
||||||
|
let a: u16 = memory.pop().expect(&format!("{}", RunError::MemoryEmpty));
|
||||||
|
let b: u16 = memory.pop().expect(&format!("{}", RunError::MemoryEmpty));
|
||||||
|
|
||||||
|
memory.push(a);
|
||||||
|
memory.push(b);
|
||||||
|
}
|
||||||
122
src/main.rs
122
src/main.rs
@ -1,123 +1,27 @@
|
|||||||
use std::{
|
use std::{env, fs};
|
||||||
fs,
|
|
||||||
io::{BufRead, Write},
|
|
||||||
};
|
|
||||||
|
|
||||||
use errors::RunError;
|
use errors::RunError;
|
||||||
use execute::execute;
|
use execute::execute;
|
||||||
use parse::parse;
|
use parse::parse;
|
||||||
use stack::Stack;
|
use stack::Stack;
|
||||||
|
|
||||||
mod errors;
|
mod stack;
|
||||||
|
mod parse;
|
||||||
mod execute;
|
mod execute;
|
||||||
mod instructions;
|
mod instructions;
|
||||||
mod parse;
|
mod errors;
|
||||||
mod stack;
|
|
||||||
|
|
||||||
const HELP: &str = "\
|
|
||||||
labast - Labaski interpreter written in Rust.
|
|
||||||
|
|
||||||
usage: labast [options] [ file.lb ]
|
|
||||||
|
|
||||||
options:
|
|
||||||
--stack-size sets stack max size (default: 256)
|
|
||||||
-h, --help prints help information
|
|
||||||
-v, --version prints version
|
|
||||||
";
|
|
||||||
|
|
||||||
fn main() {
|
fn main() {
|
||||||
let args = match parse_args() {
|
let args: Vec<String> = env::args().collect();
|
||||||
Ok(v) => v,
|
|
||||||
Err(e) => {
|
if args.len() < 2 {
|
||||||
eprintln!("Error: {}.", e);
|
eprintln!("Usage: {0} [FILE]", args[0]);
|
||||||
std::process::exit(1);
|
return;
|
||||||
}
|
}
|
||||||
};
|
|
||||||
|
|
||||||
let mut stack = Stack::new(args.stack_size);
|
let mut stack = Stack::new();
|
||||||
|
let lines = fs::read_to_string(&args[1]).expect(&format!("{}", RunError::FailToReadFile));
|
||||||
if args.input.is_none() {
|
|
||||||
let mut line = String::new();
|
|
||||||
|
|
||||||
loop {
|
|
||||||
line.clear();
|
|
||||||
stack.program.clear();
|
|
||||||
|
|
||||||
let stdin = std::io::stdin();
|
|
||||||
|
|
||||||
print!("> ");
|
|
||||||
std::io::stdout().flush().expect("Cannot flush the buffer.");
|
|
||||||
|
|
||||||
stdin.lock().read_line(&mut line).unwrap();
|
|
||||||
|
|
||||||
parse(&mut stack, line.trim());
|
|
||||||
execute(&mut stack, None, "inline".to_string());
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
let input = &args.input.expect("error: no input file");
|
|
||||||
let lines = fs::read_to_string(&input).expect(&format!("{}", RunError::FailToReadFile));
|
|
||||||
|
|
||||||
parse(&mut stack, &lines);
|
parse(&mut stack, &lines);
|
||||||
execute(
|
|
||||||
&mut stack,
|
execute(&mut stack, None, &args[1]);
|
||||||
None,
|
|
||||||
String::from(
|
|
||||||
input
|
|
||||||
.file_name()
|
|
||||||
.expect("Failed to read file name.")
|
|
||||||
.to_str()
|
|
||||||
.expect("Failed to convert file name to string"),
|
|
||||||
),
|
|
||||||
);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
#[derive(Debug)]
|
|
||||||
struct AppArgs {
|
|
||||||
input: Option<std::path::PathBuf>,
|
|
||||||
stack_size: usize,
|
|
||||||
}
|
|
||||||
|
|
||||||
fn parse_args() -> Result<AppArgs, pico_args::Error> {
|
|
||||||
let mut pargs = pico_args::Arguments::from_env();
|
|
||||||
|
|
||||||
if pargs.contains(["-h", "--help"]) {
|
|
||||||
print!("{}", HELP);
|
|
||||||
std::process::exit(0);
|
|
||||||
}
|
|
||||||
|
|
||||||
if pargs.contains(["-v", "--version"]) {
|
|
||||||
println!(
|
|
||||||
"labast version {}",
|
|
||||||
option_env!("CARGO_PKG_VERSION").unwrap_or("unknown")
|
|
||||||
);
|
|
||||||
std::process::exit(0);
|
|
||||||
}
|
|
||||||
|
|
||||||
let args = AppArgs {
|
|
||||||
stack_size: pargs
|
|
||||||
.opt_value_from_fn("--stack-size", parse_stack_size)?
|
|
||||||
.unwrap_or(256),
|
|
||||||
input: pargs.opt_free_from_str()?,
|
|
||||||
};
|
|
||||||
|
|
||||||
let remaining = pargs.finish();
|
|
||||||
if !remaining.is_empty() {
|
|
||||||
eprintln!("Warning: unused arguments left: {:?}.", remaining);
|
|
||||||
}
|
|
||||||
|
|
||||||
return Ok(args);
|
|
||||||
}
|
|
||||||
|
|
||||||
fn parse_stack_size(s: &str) -> Result<usize, &'static str> {
|
|
||||||
let number = s
|
|
||||||
.parse()
|
|
||||||
.map_err(|_| "Argument for stack size is not a number");
|
|
||||||
|
|
||||||
if number > Ok(u16::MAX) {
|
|
||||||
eprintln!("Stack size cannot be more than 65535");
|
|
||||||
std::process::exit(2);
|
|
||||||
}
|
|
||||||
|
|
||||||
Ok(number?.into())
|
|
||||||
}
|
}
|
||||||
45
src/parse.rs
45
src/parse.rs
@ -1,7 +1,4 @@
|
|||||||
use crate::{
|
use crate::{errors::ParseError, stack::{Instruction, Stack}};
|
||||||
errors::ParseError,
|
|
||||||
stack::{Instruction, Stack},
|
|
||||||
};
|
|
||||||
|
|
||||||
pub fn parse(stack: &mut Stack, file_content: &str) {
|
pub fn parse(stack: &mut Stack, file_content: &str) {
|
||||||
for (i, line) in file_content.lines().enumerate() {
|
for (i, line) in file_content.lines().enumerate() {
|
||||||
@ -16,40 +13,28 @@ pub fn parse(stack: &mut Stack, file_content: &str) {
|
|||||||
inst_line = line.trim().chars().collect();
|
inst_line = line.trim().chars().collect();
|
||||||
}
|
}
|
||||||
|
|
||||||
let command: [String; 2] = inst_line.split_once(char::is_whitespace).map_or_else(
|
let command: Vec<String> = inst_line.split_whitespace().map(String::from).collect();
|
||||||
|| [inst_line.trim().to_string(), "".to_string()],
|
|
||||||
|(first, second)| [first.trim().to_string(), second.trim().to_string()],
|
|
||||||
);
|
|
||||||
|
|
||||||
let name: String = command[0].clone();
|
let name: String;
|
||||||
let mut arg: String = String::new();
|
let mut arg: String = String::new();
|
||||||
let mut data: u16 = 0;
|
let mut data: u16 = 0;
|
||||||
|
|
||||||
if !command[1].is_empty() {
|
name = command[0].clone();
|
||||||
if name.chars().nth(0) == Some('#') || name.chars().nth(1) == Some('#') {
|
|
||||||
let splited_data: Vec<String> =
|
if command.len() >= 2 {
|
||||||
command[1].split_whitespace().map(String::from).collect();
|
match name.chars().nth(0) {
|
||||||
arg = splited_data.get(0).unwrap().clone();
|
Some('#') => arg = command[1].to_string(),
|
||||||
} else if name.chars().nth(0) == Some('$') || name.chars().nth(1) == Some('$') {
|
_ => {
|
||||||
arg = command[1].clone();
|
if command[1] == "-1" { // required for _UNIX_RANDOM instruction
|
||||||
} else if let Ok(number) = command[1].parse::<i32>() {
|
data = 65535;
|
||||||
data = number as u16;
|
|
||||||
} else {
|
} else {
|
||||||
eprintln!(
|
data = command[1].parse().expect(&format!("{}", ParseError::DataNotAUInt(command[0].to_string(), i + 1)))
|
||||||
"{}",
|
}
|
||||||
ParseError::ArgumentNotRequired(
|
}
|
||||||
command[0].to_string(),
|
|
||||||
i + 1,
|
|
||||||
line.to_string()
|
|
||||||
)
|
|
||||||
);
|
|
||||||
std::process::exit(2);
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
if name.is_empty() {
|
let inst = Instruction { name, arg, data };
|
||||||
let inst = Instruction { name, arg, data, ispiped: false, isdrained: false };
|
|
||||||
stack.program.push(inst);
|
stack.program.push(inst);
|
||||||
}
|
}
|
||||||
}
|
|
||||||
}
|
}
|
||||||
62
src/stack.rs
62
src/stack.rs
@ -1,77 +1,25 @@
|
|||||||
use std::ops::Deref;
|
|
||||||
|
|
||||||
use crate::errors::StackError;
|
|
||||||
|
|
||||||
#[derive(Clone, Debug)]
|
#[derive(Clone, Debug)]
|
||||||
pub struct Instruction {
|
pub struct Instruction {
|
||||||
pub name: String,
|
pub name: String,
|
||||||
pub arg: String,
|
pub arg: String,
|
||||||
pub data: u16,
|
pub data: u16
|
||||||
pub ispiped: bool,
|
|
||||||
pub isdrained: bool
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#[derive(Clone, Debug)]
|
||||||
pub struct Stack {
|
pub struct Stack {
|
||||||
pub program: Vec<Instruction>,
|
pub program: Vec<Instruction>,
|
||||||
pub program_counter: u16,
|
pub program_counter: u16,
|
||||||
pub labels: [Option<i16>; 256],
|
pub labels: [Option<i16>; 256],
|
||||||
pub memory: StackVec,
|
pub memory: Vec<u16>
|
||||||
}
|
}
|
||||||
|
|
||||||
impl Stack {
|
impl Stack {
|
||||||
pub fn new(stack_size: usize) -> Stack {
|
pub fn new() -> Stack {
|
||||||
return Stack {
|
return Stack {
|
||||||
program: Vec::new(),
|
program: Vec::new(),
|
||||||
program_counter: 0,
|
program_counter: 0,
|
||||||
labels: [None; 256],
|
labels: [None; 256],
|
||||||
memory: StackVec::new(stack_size),
|
memory: Vec::new()
|
||||||
};
|
};
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
pub struct StackVec {
|
|
||||||
data: Vec<u16>,
|
|
||||||
max_size: usize,
|
|
||||||
}
|
|
||||||
|
|
||||||
impl StackVec {
|
|
||||||
fn new(max_size: usize) -> Self {
|
|
||||||
StackVec {
|
|
||||||
data: Vec::new(),
|
|
||||||
max_size,
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn size(&self) -> usize {
|
|
||||||
self.max_size
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn push(&mut self, item: u16) {
|
|
||||||
if self.data.len() + 1 > self.max_size {
|
|
||||||
panic!("{}", StackError::StackOverflow);
|
|
||||||
} else {
|
|
||||||
self.data.push(item);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn pop(&mut self) -> u16 {
|
|
||||||
self.data
|
|
||||||
.pop()
|
|
||||||
.expect(&format!("{}", StackError::StackUnderflow))
|
|
||||||
}
|
|
||||||
|
|
||||||
pub fn last(&mut self) -> u16 {
|
|
||||||
*self
|
|
||||||
.data
|
|
||||||
.last()
|
|
||||||
.expect(&format!("{}", StackError::StackUnderflow))
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
impl Deref for StackVec {
|
|
||||||
type Target = Vec<u16>;
|
|
||||||
|
|
||||||
fn deref(&self) -> &Self::Target {
|
|
||||||
&self.data
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|||||||
@ -1,4 +0,0 @@
|
|||||||
@ 0
|
|
||||||
push -1
|
|
||||||
#native native_test
|
|
||||||
|
|
||||||
@ -1,12 +0,0 @@
|
|||||||
// Build with
|
|
||||||
// rustc --crate-type cdylib native_test.rs -o native_test.so
|
|
||||||
// or
|
|
||||||
// rustc --crate-type cdylib native_test.rs -o native_test.dll
|
|
||||||
|
|
||||||
#[no_mangle]
|
|
||||||
unsafe extern "C" fn labashka(pop: extern fn() -> u16, push: extern fn(u16), len: extern fn () -> usize, max: usize) {
|
|
||||||
println!("At {}, there's {}.", len(), pop());
|
|
||||||
push(12);
|
|
||||||
println!("Maximum size is {}.", max);
|
|
||||||
}
|
|
||||||
|
|
||||||
Loading…
x
Reference in New Issue
Block a user