diff options
| author | Xavier Del Campo Romero <xavi.dcr@tutanota.com> | 2025-03-06 16:37:12 +0100 |
|---|---|---|
| committer | Xavier Del Campo Romero <xavi92@disroot.org> | 2025-11-07 09:55:58 +0100 |
| commit | 0086ccf0272fa195dca36845fde9c54149c72f0e (patch) | |
| tree | dc025e30b7e0a6830e44c9558f3b800295cc79df | |
| download | nwc-0086ccf0272fa195dca36845fde9c54149c72f0e.tar.gz | |
First commit
| -rw-r--r-- | .gitignore | 3 | ||||
| -rw-r--r-- | CMakeLists.txt | 19 | ||||
| -rw-r--r-- | LICENSE | 661 | ||||
| -rw-r--r-- | README.md | 55 | ||||
| -rw-r--r-- | instr.h | 202 | ||||
| -rw-r--r-- | leb128.c | 211 | ||||
| -rw-r--r-- | main.c | 1228 | ||||
| -rw-r--r-- | read_instr.c | 603 | ||||
| -rw-r--r-- | types.h | 91 |
9 files changed, 3073 insertions, 0 deletions
diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..bc8cd22 --- /dev/null +++ b/.gitignore @@ -0,0 +1,3 @@ +/build*/ +/.cache*/ +/.vscode/ diff --git a/CMakeLists.txt b/CMakeLists.txt new file mode 100644 index 0000000..633fc95 --- /dev/null +++ b/CMakeLists.txt @@ -0,0 +1,19 @@ +# nwc, a NanoWasm compiler +# Copyright (C) 2025 Xavier Del Campo Romero +# +# This program is free software: you can redistribute it and/or modify +# it under the terms of the GNU Affero General Public License as published by +# the Free Software Foundation, either version 3 of the License, or +# (at your option) any later version. +# +# This program is distributed in the hope that it will be useful, +# but WITHOUT ANY WARRANTY; without even the implied warranty of +# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +# GNU Affero General Public License for more details. +# +# You should have received a copy of the GNU Affero General Public License +# along with this program. If not, see <https://www.gnu.org/licenses/>. + +cmake_minimum_required(VERSION 3.14) +project(nwc VERSION 0.1.0 LANGUAGES C) +add_executable(${PROJECT_NAME} leb128.c main.c read_instr.c) @@ -0,0 +1,661 @@ + GNU AFFERO GENERAL PUBLIC LICENSE + Version 3, 19 November 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/> + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU Affero General Public License is a free, copyleft license for +software and other kinds of works, specifically designed to ensure +cooperation with the community in the case of network server software. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +our General Public Licenses are intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + Developers that use our General Public Licenses protect your rights +with two steps: (1) assert copyright on the software, and (2) offer +you this License which gives you legal permission to copy, distribute +and/or modify the software. + + A secondary benefit of defending all users' freedom is that +improvements made in alternate versions of the program, if they +receive widespread use, become available for other developers to +incorporate. Many developers of free software are heartened and +encouraged by the resulting cooperation. However, in the case of +software used on network servers, this result may fail to come about. +The GNU General Public License permits making a modified version and +letting the public access it on a server without ever releasing its +source code to the public. + + The GNU Affero General Public License is designed specifically to +ensure that, in such cases, the modified source code becomes available +to the community. It requires the operator of a network server to +provide the source code of the modified version running there to the +users of that server. Therefore, public use of a modified version, on +a publicly accessible server, gives the public access to the source +code of the modified version. + + An older license, called the Affero General Public License and +published by Affero, was designed to accomplish similar goals. This is +a different license, not a version of the Affero GPL, but Affero has +released a new version of the Affero GPL which permits relicensing under +this license. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU Affero General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Remote Network Interaction; Use with the GNU General Public License. + + Notwithstanding any other provision of this License, if you modify the +Program, your modified version must prominently offer all users +interacting with it remotely through a computer network (if your version +supports such interaction) an opportunity to receive the Corresponding +Source of your version by providing access to the Corresponding Source +from a network server at no charge, through some standard or customary +means of facilitating copying of software. This Corresponding Source +shall include the Corresponding Source for any work covered by version 3 +of the GNU General Public License that is incorporated pursuant to the +following paragraph. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the work with which it is combined will remain governed by version +3 of the GNU General Public License. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU Affero General Public License from time to time. Such new versions +will be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU Affero General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU Affero General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU Affero General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + <one line to give the program's name and a brief idea of what it does.> + Copyright (C) <year> <name of author> + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU Affero General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU Affero General Public License for more details. + + You should have received a copy of the GNU Affero General Public License + along with this program. If not, see <https://www.gnu.org/licenses/>. + +Also add information on how to contact you by electronic and paper mail. + + If your software can interact with users remotely through a computer +network, you should also make sure that it provides a way for users to +get its source. For example, if your program is a web application, its +interface could display a "Source" link that leads users to an archive +of the code. There are many ways you could offer source, and different +solutions will be better for different programs; see section 13 for the +specific requirements. + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU AGPL, see +<https://www.gnu.org/licenses/>. diff --git a/README.md b/README.md new file mode 100644 index 0000000..7e5243a --- /dev/null +++ b/README.md @@ -0,0 +1,55 @@ +# `nwc`, a NanoWasm compiler + +`nwc` is a command-line tool that takes a MVP WebAssembly file and appends +[NanoWasm custom sections](https://gitea.privatedns.org/xavi/nanowasm-design) +to it, so that NanoWasm-capable interpreters such as +[`nanowasm`](https://gitea.privatedns.org/xavi/nanowasm) can consume them. + +## Building from source + +`nwc` only requires a C99 environment to build. The build system is based on +CMake and can be configured using the conventional process in CMake projects: + +``` +cmake -B build +``` + +Then, build with: + +``` +cmake --build build/ +``` + +## Usage + +The command below shall generate a NanoWasm-compatible file given by `out` +from a MVP WebAssembly file given by `infile`: + +``` +nwc <infile> <outfile> +``` + +Take into account that `infile` **must not** contain any NanoWasm custom +sections. + +## License + +``` +nwc, a NanoWasm compiler +Copyright (C) 2025 Xavier Del Campo Romero + +This program is free software: you can redistribute it and/or modify +it under the terms of the GNU Affero General Public License as published by +the Free Software Foundation, either version 3 of the License, or +(at your option) any later version. + +This program is distributed in the hope that it will be useful, +but WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +GNU Affero General Public License for more details. + +You should have received a copy of the GNU Affero General Public License +along with this program. If not, see <https://www.gnu.org/licenses/>. +``` + +Also, see [`LICENSE`](LICENSE). @@ -0,0 +1,202 @@ +/* + * nwc, a NanoWasm compiler + * Copyright (C) 2025 Xavier Del Campo Romero + * + * This program is free software: you can redistribute it and/or modify + * it under the terms of the GNU Affero General Public License as published by + * the Free Software Foundation, either version 3 of the License, or + * (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU Affero General Public License for more details. + * + * You should have received a copy of the GNU Affero General Public License + * along with this program. If not, see <https://www.gnu.org/licenses/>. + */ + +#ifndef INSTR_H +#define INSTR_H + +#include "types.h" +#include <stdio.h> + +enum +{ + OP_UNREACHABLE, + OP_NOP, + OP_BLOCK, + OP_LOOP, + OP_IF, + OP_ELSE, + OP_END = 0xb, + OP_BR, + OP_BR_IF, + OP_BR_TABLE, + OP_RETURN, + OP_CALL, + OP_CALL_INDIRECT, + OP_DROP = 0x1a, + OP_SELECT, + OP_GET_LOCAL = 0x20, + OP_SET_LOCAL, + OP_TEE_LOCAL, + OP_GET_GLOBAL, + OP_SET_GLOBAL, + OP_I32_LOAD = 0x28, + OP_I64_LOAD, + OP_F32_LOAD, + OP_F64_LOAD, + OP_I32_LOAD8_S, + OP_I32_LOAD8_U, + OP_I32_LOAD16_S, + OP_I32_LOAD16_U, + OP_I64_LOAD8_S, + OP_I64_LOAD8_U, + OP_I64_LOAD16_S, + OP_I64_LOAD16_U, + OP_I64_LOAD32_S, + OP_I64_LOAD32_U, + OP_I32_STORE, + OP_I64_STORE, + OP_F32_STORE, + OP_F64_STORE, + OP_I32_STORE8, + OP_I32_STORE16, + OP_I64_STORE8, + OP_I64_STORE16, + OP_I64_STORE132, + OP_CURRENT_MEMORY, + OP_GROW_MEMORY, + OP_I32_CONST, + OP_I64_CONST, + OP_F32_CONST, + OP_F64_CONST, + OP_I32_EQZ, + OP_I32_EQ, + OP_I32_NE, + OP_I32_LT_S, + OP_I32_LT_U, + OP_I32_GT_S, + OP_I32_GT_U, + OP_I32_LE_S, + OP_I32_LE_U, + OP_I32_GE_S, + OP_I32_GE_U, + OP_I64_EQZ, + OP_I64_EQ, + OP_I64_NE, + OP_I64_LT_S, + OP_I64_LT_U, + OP_I64_GT_S, + OP_I64_GT_U, + OP_I64_LE_S, + OP_I64_LE_U, + OP_I64_GE_S, + OP_I64_GE_U, + OP_F32_EQ, + OP_F32_NE, + OP_F32_LT, + OP_F32_GT, + OP_F32_LE, + OP_F32_GE, + OP_F64_EQ, + OP_F64_NE, + OP_F64_LT, + OP_F64_GT, + OP_F64_LE, + OP_F64_GE, + OP_I32_CLZ, + OP_I32_CTZ, + OP_I32_POPCNT, + OP_I32_ADD, + OP_I32_SUB, + OP_I32_MUL, + OP_I32_DIV_S, + OP_I32_DIV_U, + OP_I32_REM_S, + OP_I32_REM_U, + OP_I32_AND, + OP_I32_OR, + OP_I32_XOR, + OP_I32_SHL, + OP_I32_SHR_S, + OP_I32_SHR_U, + OP_I32_ROTL, + OP_I32_ROTR, + OP_I64_CLZ, + OP_I64_CTZ, + OP_I64_POPCNT, + OP_I64_ADD, + OP_I64_SUB, + OP_I64_MUL, + OP_I64_DIV_S, + OP_I64_DIV_U, + OP_I64_REM_S, + OP_I64_REM_U, + OP_I64_AND, + OP_I64_OR, + OP_I64_XOR, + OP_I64_SHL, + OP_I64_SHR_S, + OP_I64_SHR_U, + OP_I64_ROTL, + OP_I64_ROTR, + OP_F32_ABS, + OP_F32_NEG, + OP_F32_CEIL, + OP_F32_FLOOR, + OP_F32_TRUNC, + OP_F32_NEAREST, + OP_F32_SQRT, + OP_F32_ADD, + OP_F32_SUB, + OP_F32_MUL, + OP_F32_DIV, + OP_F32_MIN, + OP_F32_MAX, + OP_F32_COPYSIGN, + OP_F64_ABS, + OP_F64_NEG, + OP_F64_CEIL, + OP_F64_FLOOR, + OP_F64_TRUNC, + OP_F64_NEAREST, + OP_F64_SQRT, + OP_F64_ADD, + OP_F64_SUB, + OP_F64_MUL, + OP_F64_DIV, + OP_F64_MIN, + OP_F64_MAX, + OP_F64_COPYSIGN, + OP_I32_WRAP_I64, + OP_I32_TRUNC_S_F32, + OP_I32_TRUNC_U_F32, + OP_I32_TRUNC_S_F64, + OP_I32_TRUNC_U_F64, + OP_I64_EXTEND_S_I32, + OP_I64_EXTEND_U_I32, + OP_I64_TRUNC_S_F32, + OP_I64_TRUNC_U_F32, + OP_I64_TRUNC_S_F64, + OP_I64_TRUNC_U_F64, + OP_F32_CONVERT_S_I32, + OP_F32_CONVERT_U_I32, + OP_F32_CONVERT_S_I64, + OP_F32_CONVERT_U_I64, + OP_F32_DEMOTE_F64, + OP_F64_CONVERT_S_I32, + OP_F64_CONVERT_U_I32, + OP_F64_CONVERT_S_I64, + OP_F64_CONVERT_U_I64, + OP_F64_PROMOTE_F32, + OP_I32_REINTERPRET_F32, + OP_I64_REINTERPRET_F64, + OP_F32_REINTERPRET_I32, + OP_F64_REINTERPRET_I64, + OP_EXTRA = 0xfc, +}; + +#endif diff --git a/leb128.c b/leb128.c new file mode 100644 index 0000000..45a9611 --- /dev/null +++ b/leb128.c @@ -0,0 +1,211 @@ +/* + * nwc, a NanoWasm compiler + * Copyright (C) 2025 Xavier Del Campo Romero + * + * This program is free software: you can redistribute it and/or modify + * it under the terms of the GNU General Public License as published by + * the Free Software Foundation, either version 3 of the License, or + * (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program. If not, see <http://www.gnu.org/licenses/>. + */ + +/* + * Adapted from: + * + * nanowasm, a tiny WebAssembly/Wasm interpreter + * Copyright (C) 2023-2024 Xavier Del Campo Romero + * + * 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 https://mozilla.org/MPL/2.0/. + * + * Which, in turn, was adapted from the wac project: + * https://github.com/kanaka/wac + * + * Copyright (C) Joel Martin <github@martintribe.org> + * The wac project is licensed under the MPL 2.0 (Mozilla Public License + * 2.0). The text of the MPL 2.0 license is included below and can be + * found at https://www.mozilla.org/MPL/2.0/ + */ + +#include "types.h" +#include <stdbool.h> +#include <stdint.h> +#include <stdio.h> + +static int read_leb128(FILE *const f, const unsigned maxbits, const bool sign, + unsigned long long *const out) +{ + uint8_t byte; + unsigned long long result = 0; + unsigned shift = 0, bcnt = 0; + + for (;;) + { + if (!fread(&byte, sizeof byte, 1, f)) + { + if (ferror(f)) + fprintf(stderr, "%s: ferror\n", __func__); + + return -1; + } + + result |= (unsigned long long)(byte & 0x7f) << shift; + shift += 7; + + if (!(byte & 0x80)) + break; + else if (++bcnt > (maxbits + 7u - 1u) / 7u) + { + fprintf(stderr, "%s: overflow, offset=%#lx\n", __func__, ftell(f)); + return -1; + } + } + + if (sign && (shift < maxbits) && (byte & 0x40)) + result |= -1ll << shift; + + *out = result; + return 0; +} + +int read_varint1(FILE *const f, varint1 *const out) +{ + unsigned long long res; + + if (read_leb128(f, 1, true, &res)) + return -1; + + *out = res; + return 0; +} + +int read_varint7(FILE *const f, varint7 *const out) +{ + unsigned long long res; + + if (read_leb128(f, 7, true, &res)) + return -1; + + *out = res; + return 0; +} + +int read_varint32(FILE *const f, varint32 *const out) +{ + unsigned long long res; + + if (read_leb128(f, 32, true, &res)) + return -1; + + *out = res; + return 0; +} + +int read_varint64(FILE *const f, varint64 *const out) +{ + unsigned long long res; + + if (read_leb128(f, 64, true, &res)) + return -1; + + *out = res; + return 0; +} + +int read_varuint1(FILE *const f, varuint1 *const out) +{ + unsigned long long res; + + if (read_leb128(f, 1, false, &res)) + return -1; + + *out = res; + return 0; +} + +int read_varuint7(FILE *const f, varuint7 *const out) +{ + unsigned long long res; + + if (read_leb128(f, 7, false, &res)) + return -1; + + *out = res; + return 0; +} + +int read_varuint32(FILE *const f, varuint32 *const out) +{ + unsigned long long res; + + if (read_leb128(f, 32, false, &res)) + return -1; + + *out = res; + return 0; +} + +int read_varuint64(FILE *const f, varuint64 *const out) +{ + unsigned long long res; + + if (read_leb128(f, 64, false, &res)) + return -1; + + *out = res; + return 0; +} + +static int write_uleb128(FILE *const f, unsigned long long v, + size_t *const written) +{ + size_t w = 0; + + do + { + uint8_t byte = v & 0x7f; + + if ((v >>= 7)) + byte |= 0x80; + + if (f && !fwrite(&byte, sizeof byte, 1, f)) + { + fprintf(stderr, "%s: fwrite(3) failed, ferror(3)=%d, feof(3)=%d\n", + __func__, ferror(f), feof(f)); + return -1; + } + + w++; + } while (v); + + if (written) + *written = w; + + return 0; +} + +int write_varuint7(FILE *const f, const varuint7 v) +{ + return write_uleb128(f, v, NULL); +} + +int write_varuint32(FILE *const f, const varuint32 v) +{ + return write_uleb128(f, v, NULL); +} + +size_t len_varuint32(const varuint32 v) +{ + size_t ret; + + write_uleb128(NULL, v, &ret); + return ret; +} @@ -0,0 +1,1228 @@ +/* + * nwc, a NanoWasm compiler + * Copyright (C) 2025 Xavier Del Campo Romero + * + * This program is free software: you can redistribute it and/or modify + * it under the terms of the GNU Affero General Public License as published by + * the Free Software Foundation, either version 3 of the License, or + * (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU Affero General Public License for more details. + * + * You should have received a copy of the GNU Affero General Public License + * along with this program. If not, see <https://www.gnu.org/licenses/>. + */ + +#include "types.h" +#include <errno.h> +#include <inttypes.h> +#include <stdbool.h> +#include <stddef.h> +#include <stdlib.h> +#include <stdio.h> +#include <stdint.h> +#include <string.h> + +static void free_parse(struct parse *const p) +{ + if (!p) + return; + + free(p->to.offsets); + free(p->fti.offsets); + free(p->fbo.offsets); + free(p->iti.offsets); + + if (p->lo) + for (size_t i = 0; i < p->n_lo; i++) + free(p->lo[i].entries); + + free(p->lo); +} + +static char *mktmppath(const char *const out) +{ + char *path = NULL; + static const char fmt[] = "%s.nwc.tmp"; + const int n = snprintf(NULL, 0, fmt, out); + + if (n < 0) + { + fprintf(stderr, "%s: snprintf(3) failed\n", __func__); + goto failure; + } + + const size_t sz = n +1; + + if (!(path = malloc(sz))) + { + fprintf(stderr, "%s: malloc(3): %s\n", __func__, strerror(errno)); + goto failure; + } + + const int nn = snprintf(path, sz, fmt, out); + + if (nn < 0 || nn >= sz) + { + fprintf(stderr, "%s: snprintf(3) failed with %d\n", __func__, nn); + goto failure; + } + + return path; + +failure: + free(path); + return NULL; +} + +static int dump(FILE *const in, FILE *const out) +{ + do + { + char buf[BUFSIZ]; + const size_t r = fread(buf, 1, sizeof buf, in); + + if (ferror(in)) + { + fprintf(stderr, "%s: fread(3): %s\n", __func__, strerror(errno)); + return -1; + } + + const size_t w = fwrite(buf, r, 1, out); + + if (ferror(out)) + { + fprintf(stderr, "%s: fwrite(3): %s\n", __func__, strerror(errno)); + return -1; + } + } while (!feof(in)); + + return 0; +} + +static int dump_n(const char *const name, const struct offsets *const o, + FILE *const f) +{ + const varuint32 name_len = strlen(name), + payload_len = len_varuint32(name_len) + name_len + + (o->n * sizeof *o->offsets); + + if (write_varuint7(f, SECTION_CUSTOM)) + { + fprintf(stderr, "%s: write_varuint7 failed\n", __func__); + return -1; + } + else if (write_varuint32(f, payload_len)) + { + fprintf(stderr, "%s: write_varuint32 failed\n", __func__); + return -1; + } + else if (write_varuint32(f, name_len)) + { + fprintf(stderr, "%s: write_varuint32 failed\n", __func__); + return -1; + } + else if (fprintf(f, "%s", name) < 0) + { + fprintf(stderr, "%s: fprintf(3) failed\n", __func__); + return -1; + } + + for (size_t i = 0; i < o->n; i++) + { + const uint32_t off = o->offsets[i]; + const uint8_t v[] = {off, off >> 8, off >> 16, off >> 24}; + + if (!fwrite(&v, sizeof v, 1, f)) + { + fprintf(stderr, "%s: fwrite(3) failed, ferror(3)=%d, feof(3)=%d\n", + __func__, ferror(f), feof(f)); + return -1; + } + } + + return 0; +} + +static int dump_lo_fn(const struct lo *const lo, const size_t n_lo, + FILE *const f) +{ + long off = ftell(f); + + if (off < 0) + { + fprintf(stderr, "%s: ftell(3): %s\n", __func__, strerror(errno)); + return -1; + } + + off += n_lo * sizeof (uint32_t); + + for (size_t i = 0; i < n_lo; i++) + { + const struct lo *const o = &lo[i]; + const uint8_t v[] = {off, off >> 8, off >> 16, off >> 25}; + + if (!fwrite(v, sizeof v, 1, f)) + { + fprintf(stderr, "%s: fwrite(3) failed, ferror=%d, feof=%d\n", + __func__, ferror(f), feof(f)); + return -1; + } + + const struct lo_entry *const e = o->entries; + static const size_t sz = sizeof e->pc + sizeof e->dst; + + off += sizeof (uint32_t) + o->n * sz; + } + + return 0; +} + +static int dump_lo_entry(const struct lo_entry *const e, FILE *const f) +{ + const uint32_t p = e->pc; + const uint8_t pv[] = {p, p >> 8, p >> 16, p >> 24}; + + if (!fwrite(pv, sizeof pv, 1, f)) + { + fprintf(stderr, "%s: fwrite(3) failed, ferror(3)=%d, " + "feof(3)=%d\n", __func__, ferror(f), feof(f)); + return -1; + } + + const uint32_t d = e->dst; + const uint8_t dv[] = {d, d >> 8, d >> 16, d >> 24}; + + if (!fwrite(dv, sizeof dv, 1, f)) + { + fprintf(stderr, "%s: fwrite(3) failed, ferror(3)=%d, " + "feof(3)=%d\n", __func__, ferror(f), feof(f)); + return -1; + } + + return 0; +} + +static int dump_lo_off(const struct lo *const lo, const size_t n_lo, + FILE *const f) +{ + for (size_t i = 0; i < n_lo; i++) + { + const struct lo *const o = &lo[i]; + const uint8_t n[] = {o->n, o->n >> 8, o->n >> 16, o->n >> 24}; + + if (!fwrite(n, sizeof n, 1, f)) + { + fprintf(stderr, "%s: fwrite(3) failed, ferror(3)=%d, feof(3)=%d\n", + __func__, ferror(f), feof(f)); + return -1; + } + + for (size_t i = 0; i < o->n; i++) + if (dump_lo_entry(&o->entries[i], f)) + { + fprintf(stderr, "%s: dump_lo_entry %zu failed\n", __func__, i); + return -1; + } + } + + return 0; +} + +static int dump_lo(const struct lo *const lo, const size_t n_lo, + FILE *const f) +{ + static const char name[] = "nw_lo"; + varuint32 name_len = strlen(name), + payload_len = len_varuint32(name_len) + name_len + + n_lo * sizeof (uint32_t); + + for (size_t i = 0; i < n_lo; i++) + { + const struct lo *const o = &lo[i]; + const size_t entrysz = sizeof lo->entries->dst + sizeof lo->entries->pc; + + payload_len += sizeof (uint32_t) + o->n * entrysz; + } + + if (write_varuint7(f, SECTION_CUSTOM)) + { + fprintf(stderr, "%s: write_varuint7 failed\n", __func__); + return -1; + } + else if (write_varuint32(f, payload_len)) + { + fprintf(stderr, "%s: write_varuint32 failed\n", __func__); + return -1; + } + else if (write_varuint32(f, name_len)) + { + fprintf(stderr, "%s: write_varuint32 failed\n", __func__); + return -1; + } + else if (fprintf(f, "%s", name) < 0) + { + fprintf(stderr, "%s: fprintf(3) failed\n", __func__); + return -1; + } + else if (dump_lo_fn(lo, n_lo, f)) + { + fprintf(stderr, "%s: dump_lo_fn failed\n", __func__); + return -1; + } + else if (dump_lo_off(lo, n_lo, f)) + { + fprintf(stderr, "%s: dump_lo_off failed\n", __func__); + return -1; + } + + return 0; +} + +static int dump_parse(const struct parse *const p, FILE *const f) +{ + const struct n + { + const char *name; + const struct offsets *o; + } ns[] = + { + {.name = "nw_to", .o = &p->to}, + {.name = "nw_fti", .o = &p->fti}, + {.name = "nw_fbo", .o = &p->fbo}, + {.name = "nw_iti", .o = &p->iti} + }; + + for (size_t i = 0; i < sizeof ns / sizeof *ns; i++) + { + const struct n *const n = &ns[i]; + + if (dump_n(n->name, n->o, f)) + { + fprintf(stderr, "%s: dump_n %s failed\n", __func__, n->name); + return -1; + } + } + + if (dump_lo(p->lo, p->n_lo, f)) + { + fprintf(stderr, "%s: dump_lo failed\n", __func__); + return -1; + } + + return 0; +} + +static char *gentmp(FILE *const in, const char *out, + const struct parse *const p) +{ + FILE *f = NULL; + char *ret = NULL; + char *const path = mktmppath(out); + + if (!path) + { + fprintf(stderr, "%s: mkttmppath failed\n", __func__); + goto end; + } + else if (!(f = fopen(path, "wb"))) + { + fprintf(stderr, "%s: fopen(3) %s: %s\n", __func__, path, + strerror(errno)); + goto end; + } + else if (fseek(in, 0, SEEK_SET)) + { + fprintf(stderr, "%s: fseek(3): %s\n", __func__, strerror(errno)); + goto end; + } + else if (dump(in, f)) + { + fprintf(stderr, "%s: dump failed\n", __func__); + goto end; + } + else if (dump_parse(p, f)) + { + fprintf(stderr, "%s: dump_parse failed\n", __func__); + goto end; + } + + ret = path; + +end: + + if (f && fclose(f)) + { + fprintf(stderr, "%s: fclose(3) %s: %s\n", __func__, path, + strerror(errno)); + ret = NULL; + } + + if (!ret && remove(path)) + { + fprintf(stderr, "%s: remove(3) %s: %s\n", __func__, path, + strerror(errno)); + } + + if (!ret) + free(path); + + return ret; +} + +static int check_header(FILE *const f) +{ + uint8_t magic[sizeof "asm"], version[sizeof (uint32_t)]; + static const uint8_t exp[sizeof version] = {1, 0, 0, 0}; + + if (!fread(magic, sizeof magic, 1, f)) + { + fprintf(stderr, "%s: fread(3) magic failed, feof=%d, ferror=%d\n", + __func__, feof(f), ferror(f)); + return -1; + } + else if (memcmp(magic, "\0asm", sizeof magic)) + { + fprintf(stderr, "%s: invalid magic number\n", __func__); + return -1; + } + else if (!fread(version, sizeof version, 1, f)) + { + fprintf(stderr, "%s: fread(3) version failed, feof=%d, ferror=%d\n", + __func__, feof(f), ferror(f)); + return -1; + } + else if (memcmp(version, exp, sizeof version)) + { + fprintf(stderr, "%s: invalid version number\n", __func__); + return -1; + } + + return 0; +} + +struct section +{ + varuint7 code; + varuint32 len; + char *name; +}; + +static char *read_name(FILE *const f) +{ + varuint32 name_len; + char *name = malloc(1); + + if (!name) + { + fprintf(stderr, "%s: malloc(3): %s\n", __func__, strerror(errno)); + goto failure; + } + else if (read_varuint32(f, &name_len)) + { + fprintf(stderr, "%s: read_varuint32 failed\n", __func__); + goto failure; + } + + for (varuint32 i = 0; i < name_len; i++) + { + uint8_t c; + const size_t r = fread(&c, sizeof c, 1, f); + + if (!r) + { + fprintf(stderr, "%s: fread(3) failed, ferror(3)=%d, feof(3)=%d\n", + __func__, ferror(f), feof(f)); + goto failure; + } + + char *const newname = realloc(name, i + 2); + + if (!newname) + { + fprintf(stderr, "%s: realloc(3): %s\n", __func__, strerror(errno)); + goto failure; + } + + name = newname; + name[i] = c; + } + + name[name_len] = '\0'; + return name; + +failure: + free(name); + return NULL; +} + +static int parse_header(FILE *const f, struct section *const s) +{ + varuint7 code; + varuint32 payload_len; + char *name = NULL; + long before, after; + + if (read_varuint7(f, &code)) + { + /* Exceptionally, this might not be a fatal error. */ + if (!feof(f)) + fprintf(stderr, "%s: read_varuint7 failed\n", __func__); + + goto failure; + } + else if (read_varuint32(f, &payload_len)) + { + fprintf(stderr, "%s: read_varuint32 failed\n", __func__); + goto failure; + } + else if ((before = ftell(f)) < 0) + { + fprintf(stderr, "%s: ftell(3) before: %s\n", __func__, strerror(errno)); + goto failure; + } + else if (!code && !(name = read_name(f))) + { + fprintf(stderr, "%s: read_name failed\n", __func__); + goto failure; + } + else if ((after = ftell(f)) < 0) + { + fprintf(stderr, "%s: ftell(3) after: %s\n", __func__, strerror(errno)); + goto failure; + } + + const unsigned long sz = after - before; + + if (payload_len < sz) + { + fprintf(stderr, "%s: expected payload_len >= %lu, got %lu\n", + __func__, sz, (unsigned long)payload_len); + goto failure; + } + + payload_len -= sz; + + *s = (const struct section) + { + .code = code, + .len = payload_len, + .name = name + }; + + return 0; + +failure: + free(name); + return -1; +} + +static int append(const varuint32 value, struct offsets *const o) +{ + const size_t n = o->n + 1; + uint32_t *const v = realloc(o->offsets, n * sizeof *o->offsets); + + if (!v) + { + fprintf(stderr, "%s: realloc(3): %s\n", __func__, strerror(errno)); + return -1; + } + + v[o->n++] = value; + o->offsets = v; + return 0; +} + +static int read_type(FILE *const f, struct parse *const p) +{ + const long offset = ftell(f); + + if (offset < 0) + { + fprintf(stderr, "%s: ftell(3): %s\n", __func__, strerror(errno)); + return -1; + } + else if (read_varint7(f, &(varint7){0})) + { + fprintf(stderr, "%s: read_varint7 failed\n", __func__); + return -1; + } + + varuint32 param_count; + + if (read_varuint32(f, ¶m_count)) + { + fprintf(stderr, "%s: read_varuint32 failed\n", __func__); + return -1; + } + + for (varuint32 i = 0; i < param_count; i++) + if (read_varint7(f, &(value_type){0})) + { + fprintf(stderr, "%s: read_varint7 failed\n", __func__); + return -1; + } + + varuint1 return_count; + value_type return_type; + + if (read_varuint1(f, &return_count)) + { + fprintf(stderr, "%s: read_varuint1 failed\n", __func__); + return -1; + } + else if (return_count && read_varint7(f, &return_type)) + { + fprintf(stderr, "%s: read_varint7 failed\n", __func__); + return -1; + } + else if (append(offset, &p->to)) + { + fprintf(stderr, "%s: append failed\n", __func__); + return -1; + } + + return 0; +} + +static int readstr(FILE *const f, struct parse *const p) +{ + varuint32 len; + + if (read_varuint32(f, &len)) + { + fprintf(stderr, "%s: read_varuint32 failed\n", __func__); + return -1; + } + + for (varuint32 i = 0; i < len; i++) + { + uint8_t b; + + if (!fread(&b, sizeof b, 1, f)) + { + fprintf(stderr, "%s: fread(3) failed, feof=%d, ferror=%d\n", + __func__, feof(f), ferror(f)); + return -1; + } + } + + return 0; +} + +static int read_resizable_limits(FILE *const f) +{ + varuint1 flags; + + if (read_varuint1(f, &flags)) + { + fprintf(stderr, "%s: read_varuint1 failed\n", __func__); + return -1; + } + else if (read_varuint32(f, &(varuint32){0})) + { + fprintf(stderr, "%s: read_varuint32 failed\n", __func__); + return -1; + } + else if (flags && read_varuint32(f, &(varuint32){0})) + { + fprintf(stderr, "%s: read_varuint32 failed\n", __func__); + return -1; + } + + return 0; +} + +static int kind_function(FILE *const f) +{ + if (read_varuint32(f, &(varuint32){0})) + { + fprintf(stderr, "%s: read_varuint32 failed\n", __func__); + return -1; + } + + return 0; +} + +static int kind_table(FILE *const f) +{ + enum {ANYFUNC = 0x70}; + value_type elem_type; + + if (read_varint7(f, &elem_type)) + { + fprintf(stderr, "%s: read_varint7 failed\n", __func__); + return -1; + } + else if (elem_type != ANYFUNC) + { + fprintf(stderr, "%s: invalid elem_type, expected=%#x, got=%#hhx\n", + __func__, ANYFUNC, (unsigned char)elem_type); + return -1; + } + else if (read_resizable_limits(f)) + { + fprintf(stderr, "%s: read_resizable_limits failed\n", __func__); + return -1; + } + + return 0; +} + +static int kind_memory(FILE *const f) +{ + return read_resizable_limits(f); +} + +static int kind_global(FILE *const f) +{ + if (read_varint7(f, &(varint7){0})) + { + fprintf(stderr, "%s: read_varint7 failed\n", __func__); + return -1; + } + else if (read_varuint1(f, &(varuint1){0})) + { + fprintf(stderr, "%s: read_varuint1 failed\n", __func__); + return -1; + } + + return 0; +} + +static int read_external_kind(FILE *const f, struct parse *const p) +{ + enum + { + FUNCTION, + TABLE, + MEMORY, + GLOBAL, + + TYPES + }; + + uint8_t external_kind; + + if (!fread(&external_kind, sizeof external_kind, 1, f)) + { + fprintf(stderr, "%s: fread(3) failed, feof=%d, ferror=%d\n", + __func__, feof(f), ferror(f)); + return -1; + } + + static int (*const fn[])(FILE *) = + { + [FUNCTION] = kind_function, + [TABLE] = kind_table, + [MEMORY] = kind_memory, + [GLOBAL] = kind_global + }; + + if (external_kind >= sizeof fn / sizeof *fn) + { + fprintf(stderr, "%s: invalid external_kind: %" PRIu8 "\n", __func__, + external_kind); + return -1; + } + else if (fn[external_kind](f)) + { + fprintf(stderr, "%s: callback failed, external_kind: %" PRIu8 "\n", + __func__, external_kind); + return -1; + } + + return 0; +} + +static int read_import(FILE *const f, struct parse *const p) +{ + if (readstr(f, p) || readstr(f, p)) + { + fprintf(stderr, "%s: readstr failed\n", __func__); + return -1; + } + + const long offset = ftell(f); + + if (offset < 0) + { + fprintf(stderr, "%s: ftell(3): %s\n", __func__, strerror(errno)); + return -1; + } + else if (read_external_kind(f, p)) + { + fprintf(stderr, "%s: read_external_kind failed\n", __func__); + return -1; + } + else if (append(offset, &p->iti)) + { + fprintf(stderr, "%s: append failed\n", __func__); + return -1; + } + + return 0; +} + +static int parse_import(FILE *const f, struct parse *const p) +{ + varuint32 count; + + if (read_varuint32(f, &count)) + { + fprintf(stderr, "%s: read_varuint32 failed\n", __func__); + return -1; + } + + for (varuint32 i = 0; i < count; i++) + if (read_import(f, p)) + { + fprintf(stderr, "%s: read_import %lu failed\n", __func__, + (unsigned long)i); + return -1; + } + + return 0; +} + +static int parse_type(FILE *const f, struct parse *const p) +{ + varuint32 count; + + if (read_varuint32(f, &count)) + { + fprintf(stderr, "%s: read_varuint32 failed\n", __func__); + return -1; + } + + for (varuint32 i = 0; i < count; i++) + if (read_type(f, p)) + { + fprintf(stderr, "%s: read_type %lu failed\n", __func__, + (unsigned long)i); + return -1; + } + + return 0; +} + +static int read_function(FILE *const f, struct parse *const p) +{ + varuint32 index; + + if (read_varuint32(f, &index)) + { + fprintf(stderr, "%s: read_varuint32 failed\n", __func__); + return -1; + } + else if (append(index, &p->fti)) + { + fprintf(stderr, "%s: append failed\n", __func__); + return -1; + } + + return 0; +} + +static int parse_function(FILE *const f, struct parse *const p) +{ + varuint32 count; + + if (read_varuint32(f, &count)) + { + fprintf(stderr, "%s: read_varuint32 failed\n", __func__); + return -1; + } + + for (varuint32 i = 0; i < count; i++) + if (read_function(f, p)) + { + fprintf(stderr, "%s: read_function %lu failed\n", __func__, + (unsigned long)i); + return -1; + } + + return 0; +} + +static int skip(FILE *const f, const struct section *const s) +{ + const int ret = fseek(f, s->len, SEEK_CUR); + + if (ret) + fprintf(stderr, "%s: fseek(3): %s\n", __func__, strerror(errno)); + + return ret; +} + +static int read_local(FILE *const f) +{ + if (read_varuint32(f, &(varuint32){0})) + { + fprintf(stderr, "%s: read_varuint32 failed\n", __func__); + return -1; + } + else if (read_varint7(f, &(value_type){0})) + { + fprintf(stderr, "%s: read_varint7 failed\n", __func__); + return -1; + } + + return 0; +} + +static int read_code(FILE *const f, struct parse *const p, + const unsigned long len) +{ + long after; + const long before = ftell(f); + + if (before < 0) + { + fprintf(stderr, "%s: ftell(3) before: %s\n", __func__, strerror(errno)); + return -1; + } + else if (read_instr(f, p)) + { + fprintf(stderr, "%s: read_instr failed\n", __func__); + return -1; + } + else if ((after = ftell(f)) < 0) + { + fprintf(stderr, "%s: ftell(3) after: %s\n", __func__, strerror(errno)); + return -1; + } + + const unsigned long read = after - before; + + if (read != len) + { + fprintf(stderr, "%s: expected function body length: %lu, got %lu\n", + __func__, len, read); + return -1; + } + + return 0; +} + +static int read_body(FILE *const f, struct parse *const p) +{ + varuint32 body_size, local_count; + long before, after; + const long start = ftell(f); + + if (start < 0) + { + fprintf(stderr, "%s: ftell(3) start: %s\n", __func__, strerror(errno)); + return -1; + } + else if (read_varuint32(f, &body_size)) + { + fprintf(stderr, "%s: read_varuint32 failed\n", __func__); + return -1; + } + else if ((before = ftell(f)) < 0) + { + fprintf(stderr, "%s: ftell(3) before: %s\n", __func__, strerror(errno)); + return -1; + } + else if (read_varuint32(f, &local_count)) + { + fprintf(stderr, "%s: read_varuint32 failed\n", __func__); + return -1; + } + + for (varuint32 i = 0; i < local_count; i++) + if (read_local(f)) + { + fprintf(stderr, "%s: read_local %lu failed\n", __func__, + (unsigned long)i); + return -1; + } + + if ((after = ftell(f)) < 0) + { + fprintf(stderr, "%s: ftell(3): after %s\n", __func__, strerror(errno)); + return -1; + } + else if (read_code(f, p, body_size - (after - before))) + { + fprintf(stderr, "%s: read_code failed\n", __func__); + return -1; + } + else if (append(start, &p->fbo)) + { + fprintf(stderr, "%s: append failed\n", __func__); + return -1; + } + + return 0; +} + +static int parse_code(FILE *const f, struct parse *const p) +{ + varuint32 count; + + if (read_varuint32(f, &count)) + { + fprintf(stderr, "%s: read_varuint32 failed\n", __func__); + return -1; + } + + for (varuint32 i = 0; i < count; i++) + if (read_body(f, p)) + { + fprintf(stderr, "%s: read_body %lu failed\n", __func__, + (unsigned long)i); + return -1; + } + + return 0; +} + +static int parse_payload(FILE *const f, struct parse *const p, + const struct section *const s) +{ + static const struct fn + { + varuint7 code; + int (*fn)(FILE *, struct parse *); + } fns[] = + { + {.code = SECTION_IMPORT, parse_import}, + {.code = SECTION_TYPE, parse_type}, + {.code = SECTION_FUNCTION, parse_function}, + {.code = SECTION_CODE, parse_code} + }; + + for (size_t i = 0; i < sizeof fns / sizeof *fns; i++) + { + const struct fn *const fn = &fns[i]; + + if (s->code == fn->code) + return fn->fn(f, p); + } + + fprintf(stderr, "%s: unsupported section %hhu\n", __func__, + (unsigned char)s->code); + return -1; +} + +static bool relevant(const varuint7 code) +{ + switch (code) + { + case SECTION_CODE: + case SECTION_FUNCTION: + case SECTION_TYPE: + case SECTION_IMPORT: + return true; + + default: + break; + } + + return false; +} + +static bool repeated(const char *const name) +{ + static const char *const s[] = + { + "nw_lo", + "nw_fbo", + "nw_to", + "nw_iti" + }; + + for (size_t i = 0; i < sizeof s / sizeof *s; i++) + if (!strcmp(name, s[i])) + return true; + + return false; +} + +static int read_section(FILE *const f, struct parse *const p) +{ + int ret = -1; + struct section s = {0}; + + if (parse_header(f, &s)) + { + /* Exceptionally, this might not be a fatal error. */ + if (!feof(f)) + fprintf(stderr, "%s: parse_header failed\n", __func__); + + goto end; + } + else if (!relevant(s.code)) + { + if (s.code == SECTION_CUSTOM && repeated(s.name)) + { + fprintf(stderr, "%s: nw extension %s already present in file\n", + __func__, s.name); + goto end; + } + else if (skip(f, &s)) + { + fprintf(stderr, "%s: skip failed\n", __func__); + goto end; + } + } + else if (parse_payload(f, p, &s)) + { + fprintf(stderr, "%s: parse_payload failed\n", __func__); + goto end; + } + + ret = 0; + +end: + free(s.name); + return ret; +} + +static int parse(FILE *const f, struct parse *const p) +{ + if (check_header(f)) + { + fprintf(stderr, "%s: check_magic failed\n", __func__); + return -1; + } + + for (;;) + if (read_section(f, p)) + { + if (feof(f)) + break; + + fprintf(stderr, "%s: read_section failed\n", __func__); + return -1; + } + + return 0; +} + +static int copy(const char *const old, const char *const new) +{ + int ret = -1; + FILE *const in = fopen(old, "rb"), *const out = fopen(new, "wb"); + + if (!in) + { + fprintf(stderr, "%s: fopen(3) %s: %s\n", __func__, old, + strerror(errno)); + goto end; + } + else if (!out) + { + fprintf(stderr, "%s: fopen(3) %s: %s\n", __func__, new, + strerror(errno)); + goto end; + } + else if (dump(in, out)) + { + fprintf(stderr, "%s: dump failed\n", __func__); + goto end; + } + + ret = 0; + +end: + + if (in && fclose(in)) + { + fprintf(stderr, "%s: fclose(3) %s: %s\n", __func__, old, + strerror(errno)); + ret = -1; + } + + if (out && fclose(out)) + { + fprintf(stderr, "%s: fclose(3) %s: %s\n", __func__, new, + strerror(errno)); + ret = -1; + } + + return ret; +} + +static int move(const char *const old, const char *const new) +{ + if (rename(old, new)) + { + if (errno != EXDEV) + { + fprintf(stderr, "%s: rename(3) %s->%s: %s\n", __func__, old, new, + strerror(errno)); + return -1; + } + else if (copy(old, new)) + { + fprintf(stderr, "%s: copy %s->%s failed\n", __func__, old, new); + return -1; + } + } + + return 0; +} + +int main(int argc, char *argv[]) +{ + int ret = EXIT_FAILURE; + char *tmp = NULL; + FILE *f = NULL; + struct parse p = {0}; + + if (argc != 3) + { + fprintf(stderr, "%s <infile> <outfile>\n", *argv); + goto end; + } + + const char *const in = argv[1], *const out = argv[2]; + + if (!(f = fopen(in, "rb"))) + { + fprintf(stderr, "%s: fopen(3) %s: %s\n", __func__, in, + strerror(errno)); + goto end; + } + else if (parse(f, &p)) + { + fprintf(stderr, "%s: parse failed\n", __func__); + goto end; + } + else if (!(tmp = gentmp(f, out, &p))) + { + fprintf(stderr, "%s: gettmp failed\n", __func__); + goto end; + } + else if (move(tmp, out)) + { + fprintf(stderr, "%s: move %s->%s failed\n", __func__, tmp, out); + goto end; + } + + ret = EXIT_SUCCESS; + +end: + + if (f && fclose(f)) + { + fprintf(stderr, "%s: fclose(3) %s: %s\n", __func__, in, + strerror(errno)); + ret = EXIT_FAILURE; + } + + if (ret != EXIT_SUCCESS && tmp && remove(tmp)) + fprintf(stderr, "%s: remove(3) %s: %s\n", __func__, tmp, + strerror(errno)); + + free(tmp); + free_parse(&p); + return ret; +} diff --git a/read_instr.c b/read_instr.c new file mode 100644 index 0000000..805326c --- /dev/null +++ b/read_instr.c @@ -0,0 +1,603 @@ +/* + * nwc, a NanoWasm compiler + * Copyright (C) 2025 Xavier Del Campo Romero + * + * This program is free software: you can redistribute it and/or modify + * it under the terms of the GNU Affero General Public License as published by + * the Free Software Foundation, either version 3 of the License, or + * (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU Affero General Public License for more details. + * + * You should have received a copy of the GNU Affero General Public License + * along with this program. If not, see <https://www.gnu.org/licenses/>. + */ + +#include "instr.h" +#include "types.h" +#include <errno.h> +#include <inttypes.h> +#include <stdbool.h> +#include <stdio.h> +#include <stdint.h> +#include <stdlib.h> +#include <string.h> + +static int imm_none(FILE *const f, varuint32 *v) +{ + return 0; +} + +static int instr_sig(FILE *const f, varuint32 *v) +{ + return read_varint7(f, &(varint7){0}); +} + +static int imm_readvaruint1(FILE *const f, varuint32 *v) +{ + return read_varuint1(f, &(varuint1){0}); +} + +static int imm_varuint32(FILE *const f, varuint32 *v) +{ + return read_varuint32(f, v); +} + +static int imm_varuint64(FILE *const f, varuint32 *v) +{ + return read_varuint64(f, &(varuint64){0}); +} + +static int imm_varint32(FILE *const f, varuint32 *v) +{ + return read_varint32(f, &(varint32){0}); +} + +static int imm_varint64(FILE *const f, varuint32 *v) +{ + return read_varint64(f, &(varint64){0}); +} + +static int imm_memory(FILE *const f, varuint32 *v) +{ + return read_varuint32(f, &(varuint32){0}) + || read_varuint32(f, &(varuint32){0}); +} + +static int imm_uint32(FILE *const f, varuint32 *d) +{ + uint32_t v; + + return !fread(&v, sizeof v, 1, f); +} + +static int imm_uint64(FILE *const f, varuint32 *d) +{ + uint64_t v; + + return !fread(&v, sizeof v, 1, f); +} + +static int imm_table(FILE *const f, varuint32 *v) +{ + varuint32 table_count; + + if (read_varuint32(f, &table_count)) + { + fprintf(stderr, "%s: read_varuint32 failed\n", __func__); + return -1; + } + + for (varuint32 i = 0; i < table_count; i++) + if (read_varuint32(f, &(varuint32){0})) + { + fprintf(stderr, "%s: read_varuint32 %lu failed\n", __func__, + (unsigned long)i); + return -1; + } + + if (read_varuint32(f, &(varuint32){0})) + { + fprintf(stderr, "%s: read_varuint32 failed\n", __func__); + return -1; + } + + return 0; +} + +static int imm_call_indirect(FILE *const f, varuint32 *v) +{ + varuint32 reserved; + + if (read_varuint32(f, &(varuint32){0})) + { + fprintf(stderr, "%s: read_varuint32 failed\n", __func__); + return -1; + } + else if (read_varuint32(f, &reserved)) + { + fprintf(stderr, "%s: read_varuint1 failed\n", __func__); + return -1; + } + else if (reserved) + { + fprintf(stderr, "%s: expected zero for reserved field\n", __func__); + return -1; + } + + return 0; +} + +static int imm_extra(FILE *const f, varuint32 *v) +{ + uint8_t b; + + return !fread(&b, sizeof b, 1, f); +} + +#define OPS \ + X(OP_UNREACHABLE, imm_none) \ + X(OP_NOP, imm_none) \ + X(OP_BLOCK, instr_sig) \ + X(OP_LOOP, instr_sig) \ + X(OP_IF, instr_sig) \ + X(OP_ELSE, imm_none) \ + X(OP_END, imm_none) \ + X(OP_BR, imm_varuint32) \ + X(OP_BR_IF, imm_varuint32) \ + X(OP_BR_TABLE, imm_table) \ + X(OP_RETURN, imm_none) \ + X(OP_CALL, imm_varuint32) \ + X(OP_CALL_INDIRECT, imm_call_indirect) \ + X(OP_DROP, imm_none) \ + X(OP_SELECT, imm_none) \ + X(OP_GET_LOCAL, imm_varuint32) \ + X(OP_SET_LOCAL, imm_varuint32) \ + X(OP_TEE_LOCAL, imm_varuint32) \ + X(OP_GET_GLOBAL, imm_varuint32) \ + X(OP_SET_GLOBAL, imm_varuint32) \ + X(OP_I32_LOAD, imm_memory) \ + X(OP_I64_LOAD, imm_memory) \ + X(OP_F32_LOAD, imm_memory) \ + X(OP_F64_LOAD, imm_memory) \ + X(OP_I32_LOAD8_S, imm_memory) \ + X(OP_I32_LOAD8_U, imm_memory) \ + X(OP_I32_LOAD16_S, imm_memory) \ + X(OP_I32_LOAD16_U, imm_memory) \ + X(OP_I64_LOAD8_S, imm_memory) \ + X(OP_I64_LOAD8_U, imm_memory) \ + X(OP_I64_LOAD16_S, imm_memory) \ + X(OP_I64_LOAD16_U, imm_memory) \ + X(OP_I64_LOAD32_S, imm_memory) \ + X(OP_I64_LOAD32_U, imm_memory) \ + X(OP_I32_STORE, imm_memory) \ + X(OP_I64_STORE, imm_memory) \ + X(OP_F32_STORE, imm_memory) \ + X(OP_F64_STORE, imm_memory) \ + X(OP_I32_STORE8, imm_memory) \ + X(OP_I32_STORE16, imm_memory) \ + X(OP_I64_STORE8, imm_memory) \ + X(OP_I64_STORE16, imm_memory) \ + X(OP_I64_STORE132, imm_memory) \ + X(OP_CURRENT_MEMORY, imm_readvaruint1) \ + X(OP_GROW_MEMORY, imm_readvaruint1) \ + X(OP_I32_CONST, imm_varint32) \ + X(OP_I64_CONST, imm_varint64) \ + X(OP_F32_CONST, imm_uint32) \ + X(OP_F64_CONST, imm_uint64) \ + X(OP_I32_EQZ, imm_none) \ + X(OP_I32_EQ, imm_none) \ + X(OP_I32_NE, imm_none) \ + X(OP_I32_LT_S, imm_none) \ + X(OP_I32_LT_U, imm_none) \ + X(OP_I32_GT_S, imm_none) \ + X(OP_I32_GT_U, imm_none) \ + X(OP_I32_LE_S, imm_none) \ + X(OP_I32_LE_U, imm_none) \ + X(OP_I32_GE_S, imm_none) \ + X(OP_I32_GE_U, imm_none) \ + X(OP_I64_EQZ, imm_none) \ + X(OP_I64_EQ, imm_none) \ + X(OP_I64_NE, imm_none) \ + X(OP_I64_LT_S, imm_none) \ + X(OP_I64_LT_U, imm_none) \ + X(OP_I64_GT_S, imm_none) \ + X(OP_I64_GT_U, imm_none) \ + X(OP_I64_LE_S, imm_none) \ + X(OP_I64_LE_U, imm_none) \ + X(OP_I64_GE_S, imm_none) \ + X(OP_I64_GE_U, imm_none) \ + X(OP_F32_EQ, imm_none) \ + X(OP_F32_NE, imm_none) \ + X(OP_F32_LT, imm_none) \ + X(OP_F32_GT, imm_none) \ + X(OP_F32_LE, imm_none) \ + X(OP_F32_GE, imm_none) \ + X(OP_F64_EQ, imm_none) \ + X(OP_F64_NE, imm_none) \ + X(OP_F64_LT, imm_none) \ + X(OP_F64_GT, imm_none) \ + X(OP_F64_LE, imm_none) \ + X(OP_F64_GE, imm_none) \ + X(OP_I32_CLZ, imm_none) \ + X(OP_I32_CTZ, imm_none) \ + X(OP_I32_POPCNT, imm_none) \ + X(OP_I32_ADD, imm_none) \ + X(OP_I32_SUB, imm_none) \ + X(OP_I32_MUL, imm_none) \ + X(OP_I32_DIV_S, imm_none) \ + X(OP_I32_DIV_U, imm_none) \ + X(OP_I32_REM_S, imm_none) \ + X(OP_I32_REM_U, imm_none) \ + X(OP_I32_AND, imm_none) \ + X(OP_I32_OR, imm_none) \ + X(OP_I32_XOR, imm_none) \ + X(OP_I32_SHL, imm_none) \ + X(OP_I32_SHR_S, imm_none) \ + X(OP_I32_SHR_U, imm_none) \ + X(OP_I32_ROTL, imm_none) \ + X(OP_I32_ROTR, imm_none) \ + X(OP_I64_CLZ, imm_none) \ + X(OP_I64_CTZ, imm_none) \ + X(OP_I64_POPCNT, imm_none) \ + X(OP_I64_ADD, imm_none) \ + X(OP_I64_SUB, imm_none) \ + X(OP_I64_MUL, imm_none) \ + X(OP_I64_DIV_S, imm_none) \ + X(OP_I64_DIV_U, imm_none) \ + X(OP_I64_REM_S, imm_none) \ + X(OP_I64_REM_U, imm_none) \ + X(OP_I64_AND, imm_none) \ + X(OP_I64_OR, imm_none) \ + X(OP_I64_XOR, imm_none) \ + X(OP_I64_SHL, imm_none) \ + X(OP_I64_SHR_S, imm_none) \ + X(OP_I64_SHR_U, imm_none) \ + X(OP_I64_ROTL, imm_none) \ + X(OP_I64_ROTR, imm_none) \ + X(OP_F32_ABS, imm_none) \ + X(OP_F32_NEG, imm_none) \ + X(OP_F32_CEIL, imm_none) \ + X(OP_F32_FLOOR, imm_none) \ + X(OP_F32_TRUNC, imm_none) \ + X(OP_F32_NEAREST, imm_none) \ + X(OP_F32_SQRT, imm_none) \ + X(OP_F32_ADD, imm_none) \ + X(OP_F32_SUB, imm_none) \ + X(OP_F32_MUL, imm_none) \ + X(OP_F32_DIV, imm_none) \ + X(OP_F32_MIN, imm_none) \ + X(OP_F32_MAX, imm_none) \ + X(OP_F32_COPYSIGN, imm_none) \ + X(OP_F64_ABS, imm_none) \ + X(OP_F64_NEG, imm_none) \ + X(OP_F64_CEIL, imm_none) \ + X(OP_F64_FLOOR, imm_none) \ + X(OP_F64_TRUNC, imm_none) \ + X(OP_F64_NEAREST, imm_none) \ + X(OP_F64_SQRT, imm_none) \ + X(OP_F64_ADD, imm_none) \ + X(OP_F64_SUB, imm_none) \ + X(OP_F64_MUL, imm_none) \ + X(OP_F64_DIV, imm_none) \ + X(OP_F64_MIN, imm_none) \ + X(OP_F64_MAX, imm_none) \ + X(OP_F64_COPYSIGN, imm_none) \ + X(OP_I32_WRAP_I64, imm_none) \ + X(OP_I32_TRUNC_S_F32, imm_none) \ + X(OP_I32_TRUNC_U_F32, imm_none) \ + X(OP_I32_TRUNC_S_F64, imm_none) \ + X(OP_I32_TRUNC_U_F64, imm_none) \ + X(OP_I64_EXTEND_S_I32, imm_none) \ + X(OP_I64_EXTEND_U_I32, imm_none) \ + X(OP_I64_TRUNC_S_F32, imm_none) \ + X(OP_I64_TRUNC_U_F32, imm_none) \ + X(OP_I64_TRUNC_S_F64, imm_none) \ + X(OP_I64_TRUNC_U_F64, imm_none) \ + X(OP_F32_CONVERT_S_I32, imm_none) \ + X(OP_F32_CONVERT_U_I32, imm_none) \ + X(OP_F32_CONVERT_S_I64, imm_none) \ + X(OP_F32_CONVERT_U_I64, imm_none) \ + X(OP_F32_DEMOTE_F64, imm_none) \ + X(OP_F64_CONVERT_S_I32, imm_none) \ + X(OP_F64_CONVERT_U_I32, imm_none) \ + X(OP_F64_CONVERT_S_I64, imm_none) \ + X(OP_F64_CONVERT_U_I64, imm_none) \ + X(OP_F64_PROMOTE_F32, imm_none) \ + X(OP_I32_REINTERPRET_F32, imm_none) \ + X(OP_I64_REINTERPRET_F64, imm_none) \ + X(OP_F32_REINTERPRET_I32, imm_none) \ + X(OP_F64_REINTERPRET_I64, imm_none) \ + X(OP_EXTRA, imm_extra) + +static int (*const table[])(FILE *, varuint32 *) = +{ +#define X(x, y) [x] = y, + OPS +#undef X +}; + +static const char *const op_str[] = +{ +#define X(x, y) [x] = #x, + OPS +#undef X +}; + +static bool scoped(const uint8_t op) +{ + switch (op) + { + case OP_BLOCK: + case OP_LOOP: + case OP_IF: + return true; + + default: + break; + } + + return false; +} + +static bool branch(const uint8_t op) +{ + switch (op) + { + case OP_BR: + case OP_BR_IF: + return true; + + default: + break; + } + + return false; +} + +struct block +{ + uint8_t op; + unsigned level; + long pc; + struct block *next, *prev; +}; + +struct blocks +{ + struct block *head, *tail; +}; + +static int append_lo(const struct lo *const lo, struct parse *const p) +{ + const size_t n = p->n_lo + 1; + struct lo *const o = realloc(p->lo, n * sizeof *p->lo); + + if (!o) + { + fprintf(stderr, "%s: realloc(3): %s\n", __func__, strerror(errno)); + return -1; + } + + o[p->n_lo++] = *lo; + p->lo = o; + return 0; +} + +static int add_block(struct blocks *const b, const uint8_t op, + const unsigned level, FILE *const f) +{ + const long offset = ftell(f); + + if (offset < 0) + { + fprintf(stderr, "%s: ftell(3): %s\n", __func__, + strerror(errno)); + return -1; + } + + struct block *const v = malloc(sizeof *v); + + if (!v) + { + fprintf(stderr, "%s: realloc(3): %s\n", __func__, strerror(errno)); + return -1; + } + + *v = (const struct block) + { + .op = op, + .level = level, + .pc = offset, + .prev = b->tail + }; + + if (!b->head) + b->head = v; + else + b->tail->next = v; + + b->tail = v; + return 0; +} + +static int add_branch(const uint8_t op, struct lo *const lo, const struct blocks *const b, + const varuint32 relative_depth, const unsigned level, FILE *const f) +{ + if (relative_depth >= level) + { + fprintf(stderr, "%s: invalid relative_depth=%lu, current level=%u\n", + __func__, (unsigned long)relative_depth, level); + return -1; + } + + const long offset = ftell(f); + + if (offset < 0) + { + fprintf(stderr, "%s: ftell(3): %s\n", __func__, + strerror(errno)); + return -1; + } + + const struct block *tgt = NULL; + + for (const struct block *bl = b->tail; bl; bl = bl->prev) + if (bl->level == level - relative_depth) + { + tgt = bl; + break; + } + + if (!tgt) + { + fprintf(stderr, "%s: could not find matching block, pc=%ld\n", + __func__, offset); + return -1; + } + + const size_t n = lo->n + 1; + struct lo_entry *const ve = realloc(lo->entries, n * sizeof *lo->entries); + + if (!ve) + { + fprintf(stderr, "%s: realloc(3): %s\n", __func__, strerror(errno)); + return -1; + } + + struct lo_entry *const e = &ve[lo->n++]; + + *e = (const struct lo_entry){.b = tgt, .pc = offset}; + + if (tgt->op == OP_LOOP) + e->dst = tgt->pc; + + lo->entries = ve; + return 0; +} + +static int set_end(struct lo *const lo, const struct blocks *const b, + const unsigned level, FILE *const f) +{ + long offset = ftell(f); + + if (offset < 0) + { + fprintf(stderr, "%s: ftell(3): %s\n", __func__, strerror(errno)); + return -1; + } + + offset -= sizeof b->head->op; + + const struct block *tgt = NULL; + + for (const struct block *bl = b->tail; bl; bl = bl->prev) + if (bl->level == level) + { + tgt = bl; + break; + } + + if (!tgt) + { + fprintf(stderr, "%s: could not find matching block for end, pc=%ld\n", + __func__, offset); + return -1; + } + + for (size_t i = 0; i < lo->n; i++) + { + struct lo_entry *const e = &lo->entries[i]; + + if (e->b == tgt && tgt->op == OP_BLOCK) + e->dst = offset; + } + + return 0; +} + +static void free_blocks(struct blocks *const b) +{ + for (struct block *bl = b->head; bl;) + { + struct block *next = bl->next; + + free(bl); + bl = next; + } +} + +int read_instr(FILE *const f, struct parse *const p) +{ + uint8_t op; + unsigned level = 0; + struct lo lo = {0}; + struct blocks b = {0}; + + for (;;) + { + const size_t n = fread(&op, sizeof op, 1, f); + varuint32 relative_depth; + + if (!n) + { + fprintf(stderr, "%s: fread(3) failed, ferror(3)=%d, feof(3)=%d\n", + __func__, ferror(f), feof(f)); + goto failure; + } + else if (op >= sizeof table / sizeof *table || !table[op]) + { + fprintf(stderr, "%s: invalid or unsupported opcode %#" PRIx8 "\n", + __func__, op); + goto failure; + } + else if (table[op](f, &relative_depth)) + { + fprintf(stderr, "%s: failed to read opcode %#" PRIx8 "\n", + __func__, op); + goto failure; + } + else if (scoped(op) && add_block(&b, op, ++level, f)) + { + fprintf(stderr, "%s: add_block failed\n", __func__); + goto failure; + } + else if (branch(op) && add_branch(op, &lo, &b, relative_depth, level, f)) + { + fprintf(stderr, "%s: add_entry failed\n", __func__); + goto failure; + } + else if (op == OP_END) + { + if (level) + { + if (set_end(&lo, &b, level, f)) + { + fprintf(stderr, "%s: set_end failed\n", __func__); + return -1; + } + + level--; + } + else + break; + } + } + + if (append_lo(&lo, p)) + { + fprintf(stderr, "%s: append_lo failed\n", __func__); + goto failure; + } + + free_blocks(&b); + return 0; + +failure: + free(lo.entries); + free_blocks(&b); + return -1; +} @@ -0,0 +1,91 @@ +/* + * nwc, a NanoWasm compiler + * Copyright (C) 2025 Xavier Del Campo Romero + * + * This program is free software: you can redistribute it and/or modify + * it under the terms of the GNU Affero General Public License as published by + * the Free Software Foundation, either version 3 of the License, or + * (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU Affero General Public License for more details. + * + * You should have received a copy of the GNU Affero General Public License + * along with this program. If not, see <https://www.gnu.org/licenses/>. + */ + +#ifndef TYPES_H +#define TYPES_H + +#include <stdbool.h> +#include <stddef.h> +#include <stdint.h> +#include <stdio.h> + +enum +{ + SECTION_CUSTOM, + SECTION_TYPE, + SECTION_IMPORT, + SECTION_FUNCTION, + SECTION_TABLE, + SECTION_MEMORY, + SECTION_GLOBAL, + SECTION_EXPORT, + SECTION_START, + SECTION_ELEMENT, + SECTION_CODE, + SECTION_DATA +}; + +typedef bool varint1; +typedef bool varuint1; +typedef signed char varint7; +typedef short varint16; +typedef long varint32; +typedef long long varint64; +typedef unsigned char varuint7; +typedef unsigned short varuint16; +typedef unsigned long varuint32; +typedef unsigned long long varuint64; +typedef varint7 value_type; + +struct parse +{ + struct offsets + { + uint32_t *offsets; + size_t n; + } to, fti, fbo, iti; + + struct lo + { + struct lo_entry + { + const struct block *b; + uint32_t pc, dst; + } *entries; + + size_t n; + } *lo; + + size_t n_lo; +}; + +int read_varint1(FILE *f, varint1 *out); +int read_varint7(FILE *f, varint7 *out); +int read_varint32(FILE *f, varint32 *out); +int read_varint64(FILE *f, varint64 *out); +int read_varuint1(FILE *f, varuint1 *out); +int read_varuint7(FILE *f, varuint7 *out); +int read_varuint32(FILE *f, varuint32 *out); +int read_varuint64(FILE *f, varuint64 *out); +int read_instr(FILE *f, struct parse *p); + +int write_varuint7(FILE *f, varuint7 v); +int write_varuint32(FILE *f, varuint32 v); +size_t len_varuint32(varuint32 v); + +#endif |