commit 2d33b594c5eafec1ec2832f21f214420b5efee88 Author: Alexander Rosenberg Date: Thu Aug 15 02:11:26 2024 -0700 Initial commit diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..5b79a54 --- /dev/null +++ b/.gitignore @@ -0,0 +1,2 @@ +build/ +.cache/ \ No newline at end of file diff --git a/CMakeLists.txt b/CMakeLists.txt new file mode 100644 index 0000000..b53e2d8 --- /dev/null +++ b/CMakeLists.txt @@ -0,0 +1,14 @@ +cmake_minimum_required(VERSION 3.15.0) + +set(CMAKE_C_STANDARD 99) +set(CMAKE_EXPORT_COMPILE_COMMANDS YES) + +project(simple-lisp) + +set(SOURCE_FILES main.c parse.c lisp.c) + +foreach(FILE IN LISTS SOURCE_FILES) + list(APPEND REAL_SOURCE_FILES "src/${FILE}") +endforeach() + +add_executable(simple-lisp ${REAL_SOURCE_FILES}) diff --git a/LICENSE b/LICENSE new file mode 100644 index 0000000..f288702 --- /dev/null +++ b/LICENSE @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is 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. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + 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. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + 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 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. Use with the GNU Affero General Public License. + + 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 Affero 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 special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU 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 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 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 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. + + + Copyright (C) + + 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 . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + 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 GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff --git a/src/lisp.c b/src/lisp.c new file mode 100644 index 0000000..549485d --- /dev/null +++ b/src/lisp.c @@ -0,0 +1,1293 @@ +#include "lisp.h" + +#include +#include +#include +#include + +void *Vnil; +LISP_DEFVAR(t); +LISP_DEFVAR(module); +LISP_DEFVAR(all_functions); +LISP_DEFVAR(globals); +LISP_DEFVAR(classes); + +#ifndef NDEBUG +static size_t _lost_allocs = 0; + +static void *lisp_realloc(void *old_ptr, size_t n) { + if (!old_ptr) { + ++_lost_allocs; + } + void *ptr = realloc(old_ptr, n); + if (n && !ptr) { + abort(); + } + return ptr; +} + +// not implemented with realloc to make stack traces more obvious +static void *lisp_malloc(size_t n) { + void *ptr = malloc(n); + ++_lost_allocs; + if (n && !ptr) { + abort(); + } + return ptr; +} + +static void *lisp_calloc(size_t nmemb, size_t size) { + ++_lost_allocs; + void *ptr = calloc(nmemb, size); + if (size && nmemb && !ptr) { + abort(); + } + return ptr; +} + +static void lisp_free(void *ptr) { + --_lost_allocs; + free(ptr); +} + +#define malloc lisp_malloc +#define calloc lisp_calloc +#define free lisp_free +#define realloc lisp_realloc +#endif + +LispObject *native_type_symbols[LISP_N_NATIVE_TYPES]; +LispSymbol *system_module; +LispInstance *current_error; +StackFrame *call_stack; +size_t call_stack_size; + +// Error classes +LispClass *error_class; +LispClass *type_error_class; +LispClass *argument_error_class; +LispClass *function_not_found_error_class; +LispClass *class_slot_error_class; + +#define _NATIVE_TYPE_SYMBOL(NAME, name) \ + native_type_symbols[LISP_TYPE_ ## NAME] = ref_lisp_object( \ + INTERN_LITERAL(# name)) +static void fill_native_type_symbol_table() { + _NATIVE_TYPE_SYMBOL(NIL, nil); + _NATIVE_TYPE_SYMBOL(SYMBOL, symbol); + _NATIVE_TYPE_SYMBOL(CONS, cons); + _NATIVE_TYPE_SYMBOL(STRING, string); + _NATIVE_TYPE_SYMBOL(ARRAY, array); + _NATIVE_TYPE_SYMBOL(INT, int); + _NATIVE_TYPE_SYMBOL(FLOAT, float); + _NATIVE_TYPE_SYMBOL(FUNCTION, function); + _NATIVE_TYPE_SYMBOL(CLASS, class); + _NATIVE_TYPE_SYMBOL(HASH_TABLE, hash_table); + _NATIVE_TYPE_SYMBOL(INSTANCE, instance); + _NATIVE_TYPE_SYMBOL(POINTER, pointer); +} +#undef _NATIVE_TYPE_SYMBOL + +void *ref_lisp_object(void *obj) { + if (obj && !AS_OBJECT(obj)->persist) { + ++AS_OBJECT(obj)->ref_count; + } + return obj; +} + +void *unref_lisp_object(void *obj) { + if (obj && !AS_OBJECT(obj)->persist && AS_OBJECT(obj)->ref_count <= 1) { + switch (AS_OBJECT(obj)->type) { + case LISP_TYPE_SYMBOL: + unref_lisp_object(((LispSymbol *) obj)->name); + break; + case LISP_TYPE_CONS: + unref_lisp_object(((LispCons *) obj)->car); + unref_lisp_object(((LispCons *) obj)->cdr); + break; + case LISP_TYPE_STRING: + if (!((LispString *) obj)->skip_free) { + free(((LispString *) obj)->text); + } + break; + case LISP_TYPE_ARRAY: + for (size_t i = 0; i < ((LispArray *) obj)->length; ++i) { + unref_lisp_object(((LispArray *) obj)->data[i]); + } + free(((LispArray *) obj)->data); + break; + case LISP_TYPE_FUNCTION: + if (!((LispFunction *) obj)->nativep) { + unref_lisp_object(((LispFunction *) obj)->lisp.form); + unref_lisp_object(((LispFunction *) obj)->lisp.pargs); + unref_lisp_object(((LispFunction *) obj)->lisp.oargs); + unref_lisp_object(((LispFunction *) obj)->lisp.rarg); + } + unref_lisp_object(((LispFunction *) obj)->doc); + break; + case LISP_TYPE_HASH_TABLE: + for (size_t i = 0; i < ((LispHashTable *) obj)->size; ++i) { + struct LispHashTableBucket *p = ((LispHashTable *) obj)->data[i]; + while (p) { + unref_lisp_object(p->key); + unref_lisp_object(p->value); + struct LispHashTableBucket *next = p->next; + free(p); + p = next; + } + } + free(((LispHashTable *) obj)->data); + unref_lisp_object(((LispHashTable *) obj)->hash_func); + unref_lisp_object(((LispHashTable *) obj)->eq_func); + break; + case LISP_TYPE_CLASS: + unref_lisp_object(((LispClass *) obj)->name); + unref_lisp_object(((LispClass *) obj)->module); + unref_lisp_object(((LispClass *) obj)->slots); + unref_lisp_object(((LispClass *) obj)->constructor); + unref_lisp_object(((LispClass *) obj)->methods); + unref_lisp_object(((LispClass *) obj)->superclass); + break; + case LISP_TYPE_INSTANCE: + unref_lisp_object(((LispInstance *) obj)->class); + unref_lisp_object(((LispInstance *) obj)->slots); + break; + case LISP_TYPE_POINTER: + if (((LispPointer *) obj)->free_func) { + ((LispPointer *) obj)->free_func(((LispPointer *) obj)->data); + } + break; + case LISP_TYPE_NIL: + case LISP_TYPE_INT: + case LISP_TYPE_FLOAT: + // these don't need any extra steps + break; + case LISP_N_NATIVE_TYPES: + abort(); + } + free(obj); + return Vnil; + } else { + --AS_OBJECT(obj)->ref_count; + return obj; + } +} + +void *lisp_check_type(LispType type, void *obj) { + if (TYPE_OF(obj) != type) { + ERROR(type_error_class, + "expected", + ((LispSymbol *) native_type_symbols[type])->name, + "got", TYPE_STR(obj)); + } + return obj; +} + +LispObject *call_native(LispObject *(*func)(size_t argc, LispObject **argv), + size_t argc, ...) { + LispObject *arr[argc]; + va_list args; + va_start(args, argc); + for (size_t i = 0; i < argc; ++i) { + arr[i] = va_arg(args, LispObject *); + } + va_end(args); + LispObject *retval = func(argc, arr); + return retval; +} + +LispString *make_lisp_string(const char *text, size_t length, bool skip_free) { + LispString *obj = malloc(sizeof(LispString)); + obj->parent.type = LISP_TYPE_STRING; + obj->parent.ref_count = 0; + obj->parent.persist = false; + obj->length = length; + if (skip_free) { + obj->text = (char *) text; + } else { + obj->text = malloc(length + 1); + memcpy(obj->text, text, length); + obj->text[length] = '\0'; + } + obj->skip_free = skip_free; + return obj; +} + +LispInt *make_lisp_int(int64_t value) { + LispInt *obj = malloc(sizeof(LispInt)); + obj->parent.type = LISP_TYPE_INT; + obj->parent.ref_count = 0; + obj->parent.persist = false; + obj->value = value; + return obj; +} + +LispFloat *make_lisp_float(double value) { + LispFloat *obj = malloc(sizeof(LispFloat)); + obj->parent.type = LISP_TYPE_INT; + obj->parent.ref_count = 0; + obj->parent.persist = false; + obj->value = value; + return obj; +} + +LispSymbol *make_lisp_symbol(const char *text, size_t length, bool skip_free) { + LispSymbol *obj = malloc(sizeof(LispSymbol)); + obj->parent.type = LISP_TYPE_SYMBOL; + obj->parent.ref_count = 0; + obj->parent.persist = false; + obj->name = ref_lisp_object(make_lisp_string(text, length, skip_free)); + return obj; +} + +LispFunction *make_native_function(bool macrop, size_t nparg, size_t noarg, bool rargp, + LispObject *(*action)(size_t argc, + LispObject **argv)) { + LispFunction *obj = malloc(sizeof(LispFunction)); + obj->parent.type = LISP_TYPE_FUNCTION; + obj->parent.ref_count = 0; + obj->parent.persist = false; + obj->doc = Vnil; + obj->nativep = true; + obj->macrop = macrop; + obj->native.action = action; + obj->native.nparg = nparg; + obj->native.noarg = noarg; + obj->native.rargp = rargp; + return obj; +} + +void register_in_module(LispHashTable *table, LispSymbol *module, + LispSymbol *name, LispObject *thing) { + LispHashTable *module_table = (void *) call_native(Fgethash, 2, table, module); + if (NILP(module_table)) { + module_table = (LispHashTable *) call_native(Fmake_hash_table, 2, Vnil, Vnil); + call_native(Fputhash, 3, table, module, module_table); + } + call_native(Fputhash, 3, module_table, name, thing); +} + +LispObject *lookup_in_module(LispHashTable *table, LispSymbol *module, + LispSymbol *name, bool include_system) { + LispHashTable *module_table = (void *) call_native(Fgethash, 2, table, module); + if (NILP(module_table)) { + if (include_system) { + return lookup_in_module(table, system_module, name, false); + } + return Vnil; + } + LispObject *result = call_native(Fgethash, 2, module_table, name); + if (NILP(result) && include_system) { + result = lookup_in_module(table, system_module, name, false); + } + return result; +} + +#define register_function(module, name, func) \ + register_in_module((void *) Vall_functions, module, name, (void *) func) +#define lookup_function(module, name) \ + ((LispFunction *) lookup_in_module((void *) Vall_functions, module, name, true)) +#define register_class(class) \ + register_in_module((void *) Vclasses, (class)->module, (class)->name, (void *) class) + +LispClass *make_lisp_class(LispSymbol *name, LispSymbol *module, + LispClass *superclass, LispFunction *constructor, + LispCons *slots) { + LispHashTable *slot_table = (void *) call_native(Fmake_hash_table, 2, Vnil, Vnil); + size_t super_high_slot = NILP(superclass) ? 0 : superclass->high_slot; + size_t i = 0; + DOLIST(slot, slots, { + call_native(Fputhash, 3, slot_table, slot, + make_lisp_int(super_high_slot + i)); + ++i; + }) + LispClass *obj = malloc(sizeof(LispClass)); + obj->parent.type = LISP_TYPE_CLASS; + obj->parent.ref_count = 0; + obj->parent.persist = false; + obj->name = ref_lisp_object(name); + obj->module = ref_lisp_object(module); + obj->constructor = ref_lisp_object(constructor); + obj->superclass = ref_lisp_object(superclass); + obj->high_slot = super_high_slot + slot_table->count; + obj->slots = ref_lisp_object(slot_table); + obj->methods = ref_lisp_object(call_native(Fmake_hash_table, 2, Vnil, Vnil)); + return obj; +} + +// init_data can be NULL (not nil, actually NULL) +LispArray *make_lisp_array(size_t size, LispObject **init_data) { + LispArray *obj = malloc(sizeof(LispArray)); + obj->parent.type = LISP_TYPE_ARRAY; + obj->parent.persist = false; + obj->parent.ref_count = 0; + obj->length = size; + obj->data = calloc(size, sizeof(LispObject *)); + if (init_data) { + for (size_t i = 0; i < size; ++i) { + obj->data[i] = ref_lisp_object(init_data[i]); + } + } else { + for (size_t i = 0; i < size; ++i) { + obj->data[i] = Vnil; + } + } + return obj; +} +#define LISP_ARRAY(array) (make_lisp_array(sizeof(array) / sizeof(LispObject *), \ + array)) + +static int64_t lookup_class_slot(LispClass *class, LispSymbol *slot) { + LispObject *slot_index = Vnil; + while (NILP(slot_index)) { + if (NILP(class)) { + return -1; + } + slot_index = call_native(Fgethash, 2, class->slots, slot); + class = class->superclass; + } + return ((LispInt *) slot_index)->value; +} + +static void call_constructors(LispClass *class, LispInstance *inst) { + if (!NILP(class)) { + call_constructors(class->superclass, inst); + if (!NILP(class->constructor)) { + call_native(Ffuncall, 2, class->constructor, inst); + } + } +} + +LispInstance *make_lisp_instance(LispClass *class, LispHashTable *slots) { + LispInstance *obj = malloc(sizeof(LispInstance)); + obj->parent.type = LISP_TYPE_INSTANCE; + obj->parent.persist = false; + obj->parent.ref_count = 0; + obj->class = ref_lisp_object(class); + obj->slots = ref_lisp_object(make_lisp_array(class->high_slot, NULL)); + DOHASH(key, value, slots, { + int64_t index = lookup_class_slot(class, (LispSymbol *) key); + if (index < 0) { + // TODO error + break; + } + obj->slots->data[index] = ref_lisp_object(value); + }) + call_constructors(class, obj); + return obj; +} + +LispPointer *make_lisp_pointer(void *data, void(*free_func)(void *)) { + LispPointer *obj = malloc(sizeof(LispPointer)); + obj->parent.type = LISP_TYPE_POINTER; + obj->parent.persist = false; + obj->parent.ref_count = 0; + obj->data = data; + obj->free_func = free_func; + return obj; +} + +bool instanceof(LispInstance *instance, LispClass *class) { + LispClass *icls = instance->class; + while (!NILP(icls)) { + if (!NILP(call_native(Feq, 2, icls, class))) { + return true; + } + icls = icls->superclass; + } + return false; +} + +size_t list_length(LispCons *list) { + size_t len = 0; + DOLIST(elem, list, { + ++len; + }) + return len; +} + +void push_stack(LispSymbol *block_name, StackFramePlace *place, jmp_buf *jmp, + LispHashTable *handlers) { + StackFrame *frame = malloc(sizeof(StackFrame)); + frame->up = call_stack; + frame->block_name = ref_lisp_object(block_name); + frame->jmp = jmp; + frame->handlers = ref_lisp_object(call_native(Fmake_hash_table, 2, + INTERN_LITERAL("hash-as-zero"), + INTERN_LITERAL("subclassp"))); + if (!NILP(handlers)) { + DOHASH(key, val, handlers, { + call_native(Fputhash, 3, frame->handlers, key, val); + }) + } + if (place) { + frame->has_place = true; + frame->place = *place; + ref_lisp_object(frame->place.file); + } else { + frame->has_place= false; + } + frame->locals = ref_lisp_object(call_native(Fmake_hash_table, 2, Vnil, Vnil)); + frame->extras = EMPTY_LIST; + frame->cleanup = EMPTY_LIST; + ++call_stack_size; + call_stack = frame; +} + +void pop_stack() { + unref_lisp_object(current_error); + current_error = Vnil; + StackFrame *frame = call_stack; + DOLIST(form, frame->cleanup, { + call_native(Feval, 1, form); + }) + unref_lisp_object(frame->block_name); + unref_lisp_object(frame->handlers); + unref_lisp_object(frame->locals); + unref_lisp_object(frame->extras); + unref_lisp_object(frame->cleanup); + if (frame->has_place) { + unref_lisp_object(frame->place.file); + } + --call_stack_size; + call_stack = frame->up; + free(frame); +} + +void add_auto_unref(void *obj) { + call_stack->extras = CONS(obj, call_stack->extras); + unref_lisp_object(obj); // because cons refs its arguments +} + +void dump_stack(LispInstance *error) { + LispObject *trace_sym = INTERN_LITERAL("-stack-trace"); + LispCons *trace_list = (void *) call_native(Fslot, 2, error, trace_sym); + DOLIST(trace_obj, trace_list, { + LispObject *file_sym = INTERN_LITERAL("file"); + LispObject *block_sym = INTERN_LITERAL("block"); + LispObject *line_sym = INTERN_LITERAL("line"); + LispObject *column_sym = INTERN_LITERAL("column"); + LispString *file = AS_STRING(call_native(Fslot, 2, trace_obj, file_sym)); + LispSymbol *block = AS_SYMBOL(call_native(Fslot, 2, trace_obj, block_sym)); + LispInt *line = AS_INT(call_native(Fslot, 2, trace_obj, line_sym)); + LispInt *column = AS_INT(call_native(Fslot, 2, trace_obj, column_sym)); + // TODO use some lisp printing functions + fprintf(stderr, " %*s ", (int) block->name->length, block->name->text); + fprintf(stderr, "(%*s:%zu:%zu)\n", (int) file->length, file->text, + (size_t) line->value, (size_t) column->value); + unref_lisp_object(file_sym); + unref_lisp_object(block_sym); + unref_lisp_object(line_sym); + unref_lisp_object(column_sym); + }) + unref_lisp_object(trace_sym); +} + +void throw_error(LispInstance *error) { + if (!instanceof(error, error_class)) { + TYPE_ERROR("error (or a subclass thereof)", TYPE_STR(error)); + } + StackFrame *current_frame = call_stack; + while (current_frame) { + LispInt *handler = (void *) call_native(Fgethash, 2, + current_frame->handlers, + error->class); + int64_t err_index = NILP(handler) ? 0 : handler->value; + jmp_buf *jmp = call_stack->jmp; + if (err_index != 0) { + while (call_stack != current_frame) { + pop_stack(); + } + current_error = ref_lisp_object(error); + longjmp(*jmp, err_index); + } + current_frame = current_frame->up; + } + // The error has propagated to the top of the call stack, so we exit... + // TODO use lisp printing functions + LispSymbol *message_slot = ref_lisp_object(INTERN_LITERAL("message")); + LispString *message = (void *) call_native(Fslot, 2, error, message_slot); + if (STRINGP(message)) { + fprintf(stderr, "Uncaught %*s: %*s\n", + (int) error->class->name->name->length, + error->class->name->name->text, + (int) message->length, message->text); + } else { + fprintf(stderr, "Uncaught %*s: nil\n", + (int) error->class->name->name->length, + error->class->name->name->text); + } + dump_stack(error); + exit(1); +} + +// Easy interface to create objects and classes +LispClass *new_class(LispClass *superclass, LispSymbol *module, + const char *name, bool skip_free, LispFunction *constructor, + ...) { + LispSymbol *name_sym = make_lisp_symbol(name, strlen(name), skip_free); + LispCons *slot_list = EMPTY_LIST; + va_list args; + va_start(args, constructor); + const char *slot_name = va_arg(args, const char *); + while (slot_name) { + slot_list = CONS(make_lisp_symbol(slot_name, strlen(slot_name), true), + slot_list); + slot_name = va_arg(args, const char *); + } + va_end(args); + LispClass *class = make_lisp_class(name_sym, module, superclass, + constructor, slot_list); + unref_lisp_object(slot_list); + return class; +} + +LispInstance *new_instance(LispClass *class, ...) { + va_list args; + va_start(args, class); + const char *slot_name = va_arg(args, const char *); + LispHashTable *slots = (void *) call_native(Fmake_hash_table, 2, Vnil, Vnil); + while (slot_name) { + size_t len = strlen(slot_name); + LispSymbol *slot_sym = make_lisp_symbol(slot_name, len, true); + LispObject *slot_value = va_arg(args, LispObject *); + call_native(Fputhash, 3, slots, slot_sym, slot_value); + slot_name = va_arg(args, const char *); + } + LispInstance *obj = make_lisp_instance(class, slots); + unref_lisp_object(slots); + va_end(args); + return obj; +} + +#define _REGISTER_NATIVE(lisp_name, name, macrop, nparg, noarg, rargp) \ + register_function(system_module, (void *) INTERN_LITERAL(# lisp_name), \ + make_native_function(macrop, nparg, noarg, rargp, F ## name)) +static void register_native_functions() { + _REGISTER_NATIVE(symbolp, symbolp, false, 1, 0, false); + _REGISTER_NATIVE(stringp, stringp, false, 1, 0, false); + _REGISTER_NATIVE(consp, consp, false, 1, 0, false); + _REGISTER_NATIVE(arrayp, arrayp, false, 1, 0, false); + _REGISTER_NATIVE(intp, intp, false, 1, 0, false); + _REGISTER_NATIVE(floatp, floatp, false, 1, 0, false); + _REGISTER_NATIVE(functionp, functionp, false, 1, 0, false); + _REGISTER_NATIVE(hash-table-p, hash_table_p, false, 1, 0, false); + _REGISTER_NATIVE(classp, classp, false, 1, 0, false); + _REGISTER_NATIVE(instancep, instancep, false, 1, 0, false); + + _REGISTER_NATIVE(listp, listp, false, 1, 0, false); + _REGISTER_NATIVE(atom, atom, false, 1, 0, false); + _REGISTER_NATIVE(cons, cons, false, 2, 0, false); + _REGISTER_NATIVE(intern, intern, false, 1, 0, false); + _REGISTER_NATIVE(not, not, false, 1, 0, false); + _REGISTER_NATIVE(hash, hash, false, 1, 0, false); + _REGISTER_NATIVE(make-hash-table, make_hash_table, false, 0, 2, false); + _REGISTER_NATIVE(float, float, false, 1, 0, false); + _REGISTER_NATIVE(eq, eq, false, 2, 0, false); + _REGISTER_NATIVE(gethash, gethash, false, 2, 0, false); + _REGISTER_NATIVE(puthash, puthash, false, 3, 0, false); + _REGISTER_NATIVE(remhash, remhash, false, 2, 0, false); + _REGISTER_NATIVE(symbol-function, symbol_function, false, 1, 0, false); + _REGISTER_NATIVE(funcall, funcall, false, 1, 0, true); + _REGISTER_NATIVE(apply, apply, false, 1, 0, true); + _REGISTER_NATIVE(eval, eval, false, 1, 0, false); + _REGISTER_NATIVE(superclassp, superclassp, false, 2, 0, false); + _REGISTER_NATIVE(subclassp, subclassp, false, 2, 0, false); + _REGISTER_NATIVE(hash-as-zero, hash_as_zero, false, 1, 0, false); + + // These are special forms, their arguments are NOT evaluated + _REGISTER_NATIVE(quote, or, true, 0, 0, true); + _REGISTER_NATIVE(and, and, true, 0, 0, true); + _REGISTER_NATIVE(or, or, true, 0, 0, true); +} +#undef _REGISTER_NATIVE + +static LispClass *lisp_stack_frame_class; + +static LispObject *error_constructor(size_t argc, LispObject **argv) { + LispObject *trace_sym = INTERN_LITERAL("-stack-trace"); + StackFrame *frame = call_stack; + LispCons *trace_list = EMPTY_LIST; + while (frame) { + if (frame->block_name && frame->has_place) { + LispString *file; + if (frame->place.is_native) { + file = STRING_FROM_LITERAL(""); + } else { + file = frame->place.file; + } + trace_list = CONS(new_instance(lisp_stack_frame_class, + "file", file, + "block", frame->block_name, + "line", make_lisp_int(frame->place.line), + "column", make_lisp_int(frame->place.col), + NULL), + trace_list); + } + frame = frame->up; + } + call_native(Fsetslot, 3, argv[0], trace_sym, trace_list); + unref_lisp_object(trace_sym); + return Vnil; +} + +static LispObject *type_error_constructor(size_t argc, LispObject **argv) { + LispInstance *inst = AS_INSTANCE(argv[0]); + LispObject *message_sym = INTERN_LITERAL("message"); + LispObject *expected_sym = INTERN_LITERAL("expected"); + LispObject *got_sym = INTERN_LITERAL("got"); + LispString *expected = AS_STRING(call_native(Fslot, 2, inst, expected_sym)); + LispString *got = AS_STRING(call_native(Fslot, 2, inst, got_sym)); + // TODO use format + const char format[] = "expected %s; got %s"; + char msg[sizeof(format) - 4 + expected->length + got->length]; + sprintf(msg, format, expected->text, got->text); + LispString *msg_obj = make_lisp_string(msg, sizeof(msg) - 1, false); + call_native(Fsetslot, 3, inst, message_sym, msg_obj); + unref_lisp_object(message_sym); + unref_lisp_object(expected_sym); + unref_lisp_object(got_sym); + return Vnil; +} + +static LispObject *argument_error_constructor(size_t argc, LispObject **argv) { + LispInstance *inst = AS_INSTANCE(argv[0]); + LispObject *message_sym = INTERN_LITERAL("message"); + LispObject *expected_sym = INTERN_LITERAL("expected"); + LispObject *got_sym = INTERN_LITERAL("got"); + LispInt *got = AS_INT(call_native(Fslot, 2, inst, got_sym)); + LispObject *expected = call_native(Fslot, 2, inst, expected_sym); + // TODO use format + switch (TYPE_OF(expected)) { + case LISP_TYPE_STRING: + { + const char format[] = "expected %s arguments; got %zu"; + char msg[sizeof(format) - 5 + 128 + ((LispString *) expected)->length]; + sprintf(msg, format, ((LispString *) expected)->text, (size_t) got->value); + LispString *msg_obj = make_lisp_string(msg, sizeof(msg) - 1, false); + call_native(Fsetslot, 3, inst, message_sym, msg_obj); + } + break; + case LISP_TYPE_NIL: + default: + { + const char format[] = "got %zu arguments"; + char msg[sizeof(format) - 3 + 128]; + sprintf(msg, format, (size_t) got->value); + LispString *msg_obj = make_lisp_string(msg, sizeof(msg) - 1, false); + call_native(Fsetslot, 3, inst, message_sym, msg_obj); + } + break; + } + unref_lisp_object(message_sym); + unref_lisp_object(expected_sym); + unref_lisp_object(got_sym); + return Vnil; +} + +static LispObject *function_not_found_error_constructor(size_t argc, + LispObject **argv) { + LispInstance *inst = AS_INSTANCE(argv[0]); + LispObject *message_sym = INTERN_LITERAL("message"); + LispObject *name_sym = INTERN_LITERAL("name"); + LispString *name = AS_STRING(call_native(Fslot, 2, inst, name_sym)); + // TODO use format + const char format[] = "unknown function: %s"; + char msg[sizeof(format) - 2 + name->length]; + sprintf(msg, format, name->text); + LispString *msg_obj = make_lisp_string(msg, sizeof(msg) - 1, false); + call_native(Fsetslot, 3, inst, message_sym, msg_obj); + unref_lisp_object(name_sym); + unref_lisp_object(message_sym); + return Vnil; +} + +static LispObject *class_slot_error_constructor(size_t argc, LispObject **argv) { + LispInstance *inst = AS_INSTANCE(argv[0]); + LispObject *message_sym = INTERN_LITERAL("message"); + LispObject *class_sym = INTERN_LITERAL("class"); + LispObject *name_sym = INTERN_LITERAL("name"); + LispClass *class = AS_CLASS(call_native(Fslot, 2, inst, class_sym)); + LispString *name = AS_STRING(call_native(Fslot, 2, inst, name_sym)); + // TODO use format + const char format[] = "class %s has no slot %s"; + char msg[sizeof(format) - 4 + name->length + class->name->name->length]; + sprintf(msg, format, name->text, class->name->name->text); + LispString *msg_obj = make_lisp_string(msg, sizeof(msg) - 1, false); + call_native(Fsetslot, 3, inst, message_sym, msg_obj); + unref_lisp_object(name_sym); + unref_lisp_object(class_sym); + unref_lisp_object(message_sym); + return Vnil; +} + +#define _REGISTER_ERROR(cvar, name, ...) \ + cvar ## _class = new_class(error_class, system_module, # name, true, \ + make_native_function(false, 1, 0, \ + false, cvar ## _constructor), \ + __VA_ARGS__, NULL); \ + register_class(cvar ## _class); + +static void register_error_classes() { + lisp_stack_frame_class = new_class(Vnil, system_module, + "stack-frame", true, Vnil, + "file", "block", "line", "column", NULL); + register_class(lisp_stack_frame_class); + + error_class = new_class(Vnil, system_module, + "error", true, + make_native_function(false, 1, 0, + false, error_constructor), + "message", "-stack-trace", NULL); + register_class(error_class); + + _REGISTER_ERROR(type_error, type-error, "expected", "got"); + _REGISTER_ERROR(argument_error, argument-error, "expected", "got"); + _REGISTER_ERROR(function_not_found_error, function-not-found-error, "name"); + _REGISTER_ERROR(class_slot_error, class-slot-error, "class", "name"); +} +#undef _REGISTER_ERROR + +void init_lisp() { + // define nil + Vnil = malloc(sizeof(LispObject)); + ((LispObject *) Vnil)->type = LISP_TYPE_NIL; + ((LispObject *) Vnil)->persist = true; + + // define t + Vt = ref_lisp_object(INTERN_LITERAL("t")); + + // The stack... + call_stack = NULL; + call_stack_size = 0; + + // Modules + system_module = ref_lisp_object(INTERN_LITERAL("sl")); + Vmodule = ref_lisp_object(INTERN_LITERAL("sl-user")); + + // Symbols for native types + fill_native_type_symbol_table(); + + // Important tables + Vall_functions = call_native(Fmake_hash_table, 2, Vnil, Vnil); + Vglobals = call_native(Fmake_hash_table, 2, Vnil, Vnil); + Vclasses = call_native(Fmake_hash_table, 2, Vnil, Vnil); + + // Errors + current_error = Vnil; + register_error_classes(); + + // Native functions + register_native_functions(); +} + +void deinit_lisp() { + while (call_stack) { + pop_stack(); + } + + unref_lisp_object(Vclasses); + unref_lisp_object(Vglobals); + unref_lisp_object(Vall_functions); + unref_lisp_object(Vmodule); + + unref_lisp_object(system_module); + + for (size_t i = 0; i < LISP_N_NATIVE_TYPES; ++i) { + unref_lisp_object(native_type_symbols[i]); + } + + Vt->persist = false; + Vt->ref_count = 0; + ((LispSymbol *) Vt)->name->parent.persist = false; + ((LispSymbol *) Vt)->name->parent.ref_count = 0; + unref_lisp_object(Vt); + + free(Vnil); + +#ifndef NDEBUG + if (_lost_allocs) { + fprintf(stderr, "WARNING: lost %zu allocations!!\n", _lost_allocs); + } +#endif +} + +#define _DEFINE_TYPE_PRED(NAME, name) \ +LISP_DEFUN(name ## p) { \ + return LISP_BOOL(NAME ## P (argv[0])); \ +} + +_DEFINE_TYPE_PRED(SYMBOL, symbol) +_DEFINE_TYPE_PRED(STRING, string) +_DEFINE_TYPE_PRED(CONS, cons) +_DEFINE_TYPE_PRED(ARRAY, array) +_DEFINE_TYPE_PRED(INT, int) +_DEFINE_TYPE_PRED(FLOAT, float) +_DEFINE_TYPE_PRED(FUNCTION, function) +_DEFINE_TYPE_PRED(LIST, list) +_DEFINE_TYPE_PRED(HASH_TABLE_, hash_table_) +_DEFINE_TYPE_PRED(CLASS, class) +_DEFINE_TYPE_PRED(INSTANCE, instance) +_DEFINE_TYPE_PRED(POINTER, pointer) + +#undef _DEFINE_TYPE_PRED + +LISP_DEFUN(atom) { + return LISP_BOOL(ATOM(argv[0])); +} + +LISP_DEFUN(native) { + return LISP_BOOL(NATIVE(argv[0])); +} + +LISP_DEFUN(type_of) { + if (NATIVE(argv[0])) { + return native_type_symbols[argv[0]->type]; + } else { + return AS_OBJECT(((LispInstance *) argv[0])->class->name); + } +} + +LISP_DEFUN(cons) { + LispCons *obj = malloc(sizeof(LispCons)); + obj->parent.type = LISP_TYPE_CONS; + obj->parent.persist = false; + obj->parent.ref_count = 0; + obj->car = ref_lisp_object(argv[0]); + obj->cdr = ref_lisp_object(argv[1]); + return AS_OBJECT(obj); +} + +LISP_DEFUN(list) { + LispObject *head = Vnil; + for (size_t i = argc; i >= 1; --i) { + head = call_native(Fcons, 2, argv[i - 1], head); + } + return head; +} + +LISP_DEFUN(length) { + switch (TYPE_OF(argv[0])) { + case LISP_TYPE_ARRAY: + return AS_OBJECT(make_lisp_int(((LispArray *) argv[0])->length)); + case LISP_TYPE_STRING: + return AS_OBJECT(make_lisp_int(((LispString *) argv[0])->length)); + case LISP_TYPE_CONS: + case LISP_TYPE_NIL: + return AS_OBJECT(make_lisp_int(list_length((LispCons *) argv[0]))); + case LISP_TYPE_HASH_TABLE: + return AS_OBJECT(make_lisp_int(((LispHashTable *) argv[0])->count)); + default: + TYPE_ERROR("array, string, cons, nil, or hash table", TYPE_STR(argv[0])); + return Vnil; + } +} + +LISP_DEFUN(intern) { + LispString *name = AS_STRING(argv[0]); + LispSymbol *obj = malloc(sizeof(LispSymbol)); + obj->parent.type = LISP_TYPE_SYMBOL; + obj->parent.persist = false; + obj->parent.ref_count = 0; + obj->name = ref_lisp_object(name); + return AS_OBJECT(obj); +} + +LISP_DEFUN(not) { + return LISP_BOOL(NILP(argv[0])); +} + +LISP_DEFUN(hash) { + int64_t h = 37; + switch (TYPE_OF(argv[0])) { + case LISP_TYPE_CLASS: + { + LispClass *cls = (void *) argv[0]; + LispInt *one = ref_lisp_object(call_native(Fhash, 1, cls->module)); + LispInt *two = ref_lisp_object(call_native(Fhash, 1, cls->name)); + LispInt *retval = make_lisp_int(one->value + two->value); + unref_lisp_object(one); + unref_lisp_object(two); + return AS_OBJECT(retval); + } + case LISP_TYPE_SYMBOL: + argv[0] = AS_OBJECT(((LispSymbol *) argv[0])->name); + case LISP_TYPE_STRING: + for (size_t i = 0; i < ((LispString *) argv[0])->length; ++i) { + h = (h * 54059) ^ (((LispString *) argv[0])->text[i] * 76963); + } + return AS_OBJECT(make_lisp_int(h % 86969)); + default: + return AS_OBJECT(make_lisp_int(0)); + } +} + +LISP_DEFUN(make_hash_table) { + if (!NILP(argv[0]) && !SYMBOLP(argv[0]) && !FUNCTIONP(argv[0])) { + TYPE_ERROR("function, symbol, or nil", TYPE_STR(argv[0])); + } + if (!NILP(argv[1]) && !SYMBOLP(argv[1]) && !FUNCTIONP(argv[1])) { + TYPE_ERROR("function, symbol, or nil", TYPE_STR(argv[1])); + } + LispHashTable *obj = malloc(sizeof(LispHashTable)); + obj->parent.type = LISP_TYPE_HASH_TABLE; + obj->parent.ref_count = 0; + obj->parent.persist = false; + obj->size = LISP_HASH_TABLE_INITIAL_SIZE; + obj->count = 0; + obj->data = calloc(obj->size, sizeof(struct LispHashTableBucket)); + obj->hash_func = ref_lisp_object(argv[0]); + obj->eq_func = ref_lisp_object(argv[1]); + return AS_OBJECT(obj); +} + +LISP_DEFUN(float) { + switch (TYPE_OF(argv[0])) { + case LISP_TYPE_INT: + return AS_OBJECT(make_lisp_float(((LispInt *) argv[0])->value)); + case LISP_TYPE_FLOAT: + return argv[0]; + default: + TYPE_ERROR("float or int", TYPE_OF(argv[0])); + return Vnil; + } +} + +LISP_DEFUN(eq) { + if ((INTP(argv[0]) || FLOATP(argv[0])) && + (INTP(argv[1]) || FLOATP(argv[1]))) { + LispFloat *f1 = ref_lisp_object(call_native(Ffloat, 1, argv[0])); + LispFloat *f2 = ref_lisp_object(call_native(Ffloat, 1, argv[1])); + bool equal = f1->value == f2->value; + unref_lisp_object(f1); + unref_lisp_object(f2); + return LISP_BOOL(equal); + } else if (TYPE_OF(argv[0]) == TYPE_OF(argv[1])) { + switch (TYPE_OF(argv[0])) { + case LISP_TYPE_NIL: + return Vt; + case LISP_TYPE_SYMBOL: + return LISP_BOOL(strncmp(((LispSymbol *) argv[0])->name->text, + ((LispSymbol *) argv[1])->name->text, + ((LispSymbol *) argv[1])->name->length) + == 0); + case LISP_TYPE_CLASS: + { + LispObject *one = call_native(Feq, 2, ((LispClass *) argv[0])->name, + ((LispClass *) argv[1])->name); + LispObject *two = call_native(Feq, 2, ((LispClass *) argv[0])->module, + ((LispClass *) argv[1])->module); + return LISP_BOOL(!NILP(one) && !NILP(two)); + } + case LISP_TYPE_FUNCTION: + if (((LispFunction *) argv[0])->nativep) { + return LISP_BOOL(((LispFunction *) argv[0])->native.action == + ((LispFunction *) argv[1])->native.action); + } + // fall-through + default: + return LISP_BOOL(argv[0] == argv[1]); + } + } + return Vnil; +} + +static uint64_t hash_obj_for_table(LispHashTable *table, LispObject *obj) { + LispInt *hash_obj; + if (NILP(table->hash_func)) { + hash_obj = (void *) call_native(Fhash, 1, obj); + } else { + hash_obj = (void *) call_native(Ffuncall, 2, table->hash_func, obj); + } + uint64_t hash = hash_obj->value; + unref_lisp_object(hash_obj); + return hash; +} + +static struct LispHashTableBucket *find_bucket_in_table(LispHashTable *table, + uint64_t hash, + LispObject *obj) { + struct LispHashTableBucket *bucket = table->data[hash % table->size]; + while (bucket) { + bool equal; + if (NILP(table->eq_func)) { + equal = !NILP(call_native(Feq, 2, obj, bucket->key)); + } else { + equal = !NILP(call_native(Ffuncall, 3, table->eq_func, obj, bucket->key)); + } + if (equal) { + break; + } + bucket = bucket->next; + } + return bucket; +} + +LISP_DEFUN(gethash) { + LispHashTable *table = AS_HASH_TABLE(argv[0]); + uint64_t hash = hash_obj_for_table(table, argv[1]); + struct LispHashTableBucket *bucket = find_bucket_in_table(table, hash, argv[1]); + return bucket ? bucket->value : Vnil; +} + +static void size_up_hash_table(LispHashTable *table) { + size_t old_size = table->size; + struct LispHashTableBucket **old_buckets = table->data; + table->size *= 2; + table->data = calloc(table->size, sizeof(struct LispHashTableBucket *)); + for (size_t i = 0; i < old_size; ++i) { + struct LispHashTableBucket *bucket = old_buckets[i]; + while (bucket) { + struct LispHashTableBucket *next = bucket->next; + bucket->next = table->data[next->hash % table->size]; + table->data[next->hash % table->size] = bucket; + bucket = next; + } + } + free(old_buckets); +} + +LISP_DEFUN(puthash) { + LispHashTable *table = AS_HASH_TABLE(argv[0]); + if (table->count == table->size) { + size_up_hash_table(table); + } + + uint64_t hash = hash_obj_for_table(table, argv[1]); + struct LispHashTableBucket *bucket = find_bucket_in_table(table, hash, argv[1]); + if (bucket) { + LispObject *old_value = unref_lisp_object(bucket->value); + bucket->value = argv[1]; + return old_value; + } + struct LispHashTableBucket *nb = malloc(sizeof(struct LispHashTableBucket)); + if (table->data[hash % table->size]) { + table->data[hash % table->size]->prev = nb; + } + nb->next = table->data[hash % table->size]; + nb->prev = NULL; + nb->hash = hash; + nb->key = ref_lisp_object(argv[1]); + nb->value = ref_lisp_object(argv[2]); + table->data[hash % table->size] = nb; + ++table->count; + return argv[2]; +} + +LISP_DEFUN(remhash) { + LispHashTable *table = AS_HASH_TABLE(argv[0]); + uint64_t hash = hash_obj_for_table(table, argv[1]); + struct LispHashTableBucket *bucket = find_bucket_in_table(table, hash, argv[1]); + if (bucket) { + LispObject *old_value = bucket->value; + bucket->prev->next = bucket->next; + bucket->next->prev = bucket->prev; + unref_lisp_object(bucket->key); + free(bucket); + return unref_lisp_object(old_value); + } + return Vnil; +} + +LISP_DEFUN(symbol_function) { + LispSymbol *sym = AS_SYMBOL(argv[0]); + return AS_OBJECT(lookup_function((LispSymbol *) Vmodule, sym)); +} + +static bool check_function_arguments(LispFunction *func, size_t argc) { + size_t nparg, noarg; + bool rargp; + if (func->nativep) { + nparg = func->native.nparg; + noarg = func->native.noarg; + rargp = func->native.rargp; + } else { + nparg = func->lisp.pargs->length; + noarg = func->lisp.oargs->length; + rargp = !NILP(func->lisp.rarg); + } + return argc >= nparg && (rargp || argc <= nparg + noarg); +} + +LISP_DEFUN(funcall) { + LispFunction *func; + if (FUNCTIONP(argv[0])) { + func = (void *) argv[0]; + } else if (SYMBOLP(argv[0])) { + func = lookup_function((LispSymbol *) Vmodule, (LispSymbol *) argv[0]); + if (NILP(func)) { + ERROR(function_not_found_error_class, + "name", ((LispSymbol *) argv[0])->name); + } + } else { + TYPE_ERROR("function or symbol", TYPE_STR(argv[0])); + } + ref_lisp_object(func); + push_stack(Vnil, NULL, NULL, Vnil); + add_auto_unref(func); + if (!check_function_arguments(func, argc - 1)) { + ERROR(argument_error_class, "got", make_lisp_int(argc - 1)); + } + LispObject *retval; + if (func->nativep) { + retval = func->native.action(argc - 1, &argv[1]); + } else { + // TODO call the lisp function + } + pop_stack(); + return retval; +} + +LISP_DEFUN(apply) { + if (NILP(argv[argc - 1]) || !LISTP(argv[argc - 1])) { + return Ffuncall(argc, argv); + } + LispArray *rest_args = (void *) call_native(Flist_to_array, 1, argv[argc - 1]); + size_t real_argc = argc - 1 + rest_args->length; + LispObject *real_argv[real_argc]; + for (size_t i = 0; i < argc - 1; ++i) { + real_argv[i] = argv[i]; + } + for (size_t i = 0; i < rest_args->length; ++i) { + real_argv[argc - 1 + i] = rest_args->data[i]; + } + unref_lisp_object(rest_args); + return Ffuncall(real_argc, real_argv); +} + +LISP_DEFUN(eval) { + if (ATOM(argv[0])) { + return argv[0]; + } + // TODO implement + return Vnil; +} + +LISP_DEFUN(make_instance) { + LispClass *class; + if (CLASSP(argv[0])) { + class = (void *) argv[0]; + } else if (SYMBOLP(argv[0])) { + class = (void *) lookup_in_module((LispHashTable *) Vclasses, + (LispSymbol *) Vmodule, + (LispSymbol *) argv[0], + true); + } else { + TYPE_ERROR("class or symbol", TYPE_STR(argv[0])); + } + if (argc % 2 != 1) { + ERROR(argument_error_class, + "expected", + STRING_FROM_LITERAL("even number of keys for make-instance"), + "got", make_lisp_int(argc - 1)); + } + LispHashTable *slots = (void *) call_native(Fmake_hash_table, 2, Vnil, Vnil); + ref_lisp_object(slots); + for (size_t i = 1; i < argc - 1; i += 2) { + if (!SYMBOLP(argv[i])) { + // TODO error + continue; + } + call_native(Fputhash, 3, slots, argv[i], argv[i + 1]); + } + LispInstance *obj = make_lisp_instance(class, slots); + unref_lisp_object(slots); + return AS_OBJECT(obj); +} + +LISP_DEFUN(slot) { + LispInstance *inst = AS_INSTANCE(argv[0]); + LispSymbol *name = AS_SYMBOL(argv[1]); + int64_t index = lookup_class_slot(inst->class, name); + if (index < 0) { + ERROR(class_slot_error_class, + "class", inst->class, + "name", name->name); + } + return inst->slots->data[index]; +} + +LISP_DEFUN(setslot) { + LispInstance *inst = AS_INSTANCE(argv[0]); + LispSymbol *name = AS_SYMBOL(argv[1]); + int64_t index = lookup_class_slot(inst->class, name); + if (index < 0) { + ERROR(class_slot_error_class, + "class", inst->class, + "name", name->name); + } + LispObject *old_value = unref_lisp_object(inst->slots->data[index]); + inst->slots->data[index] = ref_lisp_object(argv[2]); + return old_value; +} + +LISP_DEFUN(array_to_list) { + LispArray *arr = AS_ARRAY(argv[0]); + LispCons *out = EMPTY_LIST; + DOARRAY(i, elem, arr, { + out = CONS(elem, out); + }) + return AS_OBJECT(out); +} + +LISP_DEFUN(list_to_array) { + if (NILP(argv[0])) { + return AS_OBJECT(make_lisp_array(0, NULL)); + } + LispCons *list = AS_CONS(argv[0]); + size_t list_len = list_length(list); + LispArray *arr = make_lisp_array(list_len, NULL); + size_t i = 0; + DOLIST(elem, (LispCons *) argv[0], { + arr->data[i++] = ref_lisp_object(elem); + }) + return AS_OBJECT(arr); +} + +// (defun superclassp parent class) +LISP_DEFUN(superclassp) { + LispClass *parent = AS_CLASS(argv[0]); + LispClass *child = AS_CLASS(argv[1]); + while (!NILP(child)) { + if (!NILP(call_native(Feq, 2, parent, child))) { + return Vt; + } + child = child->superclass; + } + return Vnil; +} + +// (defun superclassp child class) +LISP_DEFUN(subclassp) { + return call_native(Fsuperclassp, 2, argv[1], argv[0]); +} + +LISP_DEFUN(hash_as_zero) { + return AS_OBJECT(make_lisp_int(0)); +} + +LISP_DEFUN(quote) { + return argv[0]; +} + +LISP_DEFUN(and) { + for (size_t i = 0; i < argc; ++i) { + LispObject *retval = ref_lisp_object(Feval(1, &argv[i])); + bool is_nil = NILP(retval); + unref_lisp_object(retval); + if (is_nil) { + return Vnil; + } + } + return Vt; +} + +LISP_DEFUN(or) { + for (size_t i = 0; i < argc; ++i) { + LispObject *retval = Feval(1, &argv[i]); + if (!NILP(retval)) { + return retval; + } + } + return Vnil; +} diff --git a/src/lisp.h b/src/lisp.h new file mode 100644 index 0000000..150ad1f --- /dev/null +++ b/src/lisp.h @@ -0,0 +1,333 @@ +#include +#include +#include +#include + +typedef enum { + LISP_TYPE_NIL = 0, // only one value, nil (unit type) + LISP_TYPE_SYMBOL, + LISP_TYPE_CONS, + LISP_TYPE_STRING, + LISP_TYPE_ARRAY, + LISP_TYPE_INT, + LISP_TYPE_FLOAT, + LISP_TYPE_FUNCTION, + LISP_TYPE_CLASS, + LISP_TYPE_HASH_TABLE, + LISP_TYPE_INSTANCE, + LISP_TYPE_POINTER, + LISP_N_NATIVE_TYPES, +} LispType; + +typedef struct { + LispType type; + bool persist; + size_t ref_count; +} LispObject; + +typedef struct { + LispObject parent; + bool skip_free; + char *text; + size_t length; +} LispString; + +typedef struct { + LispObject parent; + LispString *name; +} LispSymbol; + +typedef struct { + LispObject parent; + LispObject *car; + LispObject *cdr; +} LispCons; +#define CONS(car, cdr) ((void *) call_native(Fcons, 2, (car), (cdr))) +#define EMPTY_LIST ((LispCons *) Vnil) + +#define DOLIST(cvar, list, body) \ + for (LispCons *__dolist_c = list; CONSP(__dolist_c); __dolist_c = (void *) \ + __dolist_c->cdr) { \ + LispObject * cvar = __dolist_c->car; \ + body \ + } + +typedef struct { + LispObject parent; + LispObject **data; + size_t length; +} LispArray; + +#define DOARRAY(index, value, arr, body) \ + for (size_t index = 0; index < (arr)->length; ++ index) { \ + LispObject * value = (arr)->data[ index ]; \ + body \ + } + +typedef struct { + LispObject parent; + int64_t value; +} LispInt; + +typedef struct { + LispObject parent; + double value; +} LispFloat; + + + +typedef struct { + LispObject parent; + LispString *doc; + bool nativep; + bool macrop; + union { + struct { + LispObject *(*action)(size_t argc, LispObject **argv); + size_t nparg; + size_t noarg; + bool rargp; + } native; + struct { + LispObject *form; + LispArray *pargs; // list of position arguments + LispArray *oargs; // list of optional positional arguments + LispSymbol *rarg; // name of the rest argument + } lisp; + }; +} LispFunction; + +#define LISP_HASH_TABLE_INITIAL_SIZE 32 + +struct LispHashTableBucket { + uint64_t hash; + LispObject *key; + LispObject *value; + struct LispHashTableBucket *next; + struct LispHashTableBucket *prev; +}; + +typedef struct { + LispObject parent; + size_t size; + size_t count; + struct LispHashTableBucket **data; + LispObject *hash_func; + LispObject *eq_func; +} LispHashTable; + +#define DOHASH(kvar, vvar, table, body) \ + for (size_t __dohash_i = 0; __dohash_i < (table)->size; ++__dohash_i) { \ + struct LispHashTableBucket *__dohash_bucket = (table)->data[__dohash_i]; \ + while (__dohash_bucket) { \ + LispObject * kvar = __dohash_bucket->key; \ + LispObject * vvar = __dohash_bucket->value; \ + body \ + __dohash_bucket = __dohash_bucket->next; \ + } \ + } + +typedef struct _LispClass { + LispObject parent; + struct _LispClass *superclass; + LispSymbol *name; + LispSymbol *module; + LispFunction *constructor; + LispHashTable *slots; // (name . index) + size_t high_slot; + LispHashTable *methods; // (name . function) +} LispClass; + +typedef struct { + LispObject parent; + LispClass *class; + LispArray *slots; +} LispInstance; + +typedef struct { + LispObject parent; + void *data; + void (*free_func)(void *); +} LispPointer; + +extern LispObject *native_type_symbols[LISP_N_NATIVE_TYPES]; +extern LispSymbol *system_module; +extern LispInstance *current_error; + +// Error classes +extern LispClass *error_class; +extern LispClass *type_error_class; +extern LispClass *argument_error_class; +extern LispClass *function_not_found_error_class; +extern LispClass *class_slot_error_class; + +typedef struct { + LispString *file; + bool is_native; + size_t line; + size_t col; +} StackFramePlace; + +typedef struct _StackFrame { + struct _StackFrame *up; + LispSymbol *block_name; + // (error class . int (to return from setjmp)) or nil + bool has_place; + StackFramePlace place; + LispHashTable *handlers; + jmp_buf *jmp; + LispHashTable *locals; + LispCons *extras; // extra objects to be unrefed + LispCons *cleanup; // list of cleanup forms +} StackFrame; + +extern StackFrame *call_stack; +extern size_t call_stack_size; + +#define AS_OBJECT(obj) ((LispObject *) (obj)) +#define LISP_BOOL(obj) ((obj) ? Vt : Vnil) +#define TYPE_OF(obj) (AS_OBJECT(obj)->type) +#define COUNT_REFS(obj) (AS_OBJECT(obj)->ref_count) + +#define LISP_DEFVAR(name) LispObject * V ## name + +extern void *Vnil; +extern LISP_DEFVAR(t); // symbol +extern LISP_DEFVAR(module); +extern LISP_DEFVAR(all_functions); // hash table (symbol . (symbol . function)) +extern LISP_DEFVAR(globals); // hash table (symbol . (symbol . any)) +extern LISP_DEFVAR(classes); // hash table (symbol . (symbol. class)) + +void *ref_lisp_object(void *obj); +void *unref_lisp_object(void *obj); +void *lisp_check_type(LispType type, void *obj); +LispObject *call_native(LispObject *(*func)(size_t argc, LispObject **argv), + size_t argc, ...); +LispString *make_lisp_string(const char *text, size_t length, + bool skip_free); +LispInt *make_lisp_int(int64_t value); +LispFloat *make_lisp_float(double value); +LispSymbol *make_lisp_symbol(const char *text, size_t length, bool skip_free); +LispFunction *make_native_function(bool macrop, size_t nparg, size_t noarg, bool rargp, + LispObject *(*action)(size_t argc, LispObject **argv)); +LispObject *lookup_in_module(LispHashTable *table, LispSymbol *module, + LispSymbol *name, bool include_system); +void register_in_module(LispHashTable *table, LispSymbol *module, + LispSymbol *name, LispObject *thing); +LispArray *make_lisp_array(size_t size, LispObject **init_data); +LispClass *make_lisp_class(LispSymbol *name, LispSymbol *module, + LispClass *superclass, LispFunction *constructor, + LispCons *slots); +LispInstance *make_lisp_instance(LispClass *class, LispHashTable *slots); +LispPointer *make_lisp_pointer(void *data, void(*free_func)(void *)); +void push_stack(LispSymbol *block_name, StackFramePlace *place, jmp_buf *jmp, + LispHashTable *handlers); +void pop_stack(void); +void add_auto_unref(void *obj); +void dump_stack(LispInstance *error); +void throw_error(LispInstance *error); +LispClass *new_class(LispClass *superclass, LispSymbol *module, + const char *name, bool skip_free, LispFunction *constructor, + ...); +LispInstance *new_instance(LispClass *class, ...); +#define ERROR(...) throw_error(new_instance(__VA_ARGS__, NULL)) +#define TYPE_ERROR(exp, got) (ERROR(type_error_class, "expected", \ + STRING_FROM_LITERAL(exp), "got", (got))) +bool instanceof(LispInstance *instance, LispClass *class); +size_t list_length(LispCons *list); + +#define INTERN_LITERAL(name) \ + (AS_OBJECT(make_lisp_symbol(name, sizeof(name) - 1, true))) +#define STRING_FROM_LITERAL(text) (make_lisp_string(text, sizeof(text) - 1, true)) +void init_lisp(void); +void deinit_lisp(void); + +#define LISP_DEFUN(name) LispObject * F ## name (size_t argc, LispObject **argv) + +#define NILP(obj) (TYPE_OF(obj) == LISP_TYPE_NIL) + +#define SYMBOLP(obj) (TYPE_OF(obj) == LISP_TYPE_SYMBOL) +#define AS_SYMBOL(obj) ((LispSymbol *) lisp_check_type(LISP_TYPE_SYMBOL, obj)) +LISP_DEFUN(symbolp); + +#define STRINGP(obj) (TYPE_OF(obj) == LISP_TYPE_STRING) +#define AS_STRING(obj) ((LispString *) lisp_check_type(LISP_TYPE_STRING, obj)) +LISP_DEFUN(stringp); + +#define CONSP(obj) (TYPE_OF(obj) == LISP_TYPE_CONS) +#define AS_CONS(obj) ((LispCons *) lisp_check_type(LISP_TYPE_CONS, obj)) +LISP_DEFUN(consp); + +#define ARRAYP(obj) (TYPE_OF(obj) == LISP_TYPE_ARRAY) +#define AS_ARRAY(obj) ((LispArray *) lisp_check_type(LISP_TYPE_ARRAY, obj)) +LISP_DEFUN(arrayp); + +#define INTP(obj) (TYPE_OF(obj) == LISP_TYPE_INT) +#define AS_INT(obj) ((LispInt *) lisp_check_type(LISP_TYPE_INT, obj)) +LISP_DEFUN(intp); + +#define FLOATP(obj) (TYPE_OF(obj) == LISP_TYPE_FLOAT) +#define AS_FLOAT(obj) ((LispFloat *) lisp_check_type(LISP_TYPE_FLOAT, obj)) +LISP_DEFUN(floatp); + +#define FUNCTIONP(obj) (TYPE_OF(obj) == LISP_TYPE_FUNCTION) +#define AS_FUNCTION(obj) ((LispFunction *) lisp_check_type(LISP_TYPE_FUNCTION, obj)) +LISP_DEFUN(functionp); + +#define HASH_TABLE_P(obj) (TYPE_OF(obj) == LISP_TYPE_HASH_TABLE) +#define AS_HASH_TABLE(obj) ((LispHashTable *) lisp_check_type(LISP_TYPE_HASH_TABLE, obj)) +LISP_DEFUN(hash_table_p); + +#define CLASSP(obj) (TYPE_OF(obj) == LISP_TYPE_CLASS) +#define AS_CLASS(obj) ((LispClass *) lisp_check_type(LISP_TYPE_CLASS, obj)) +LISP_DEFUN(classp); + +#define INSTANCEP(obj) (TYPE_OF(obj) == LISP_TYPE_INSTANCE) +#define AS_INSTANCE(obj) ((LispInstance *) lisp_check_type(LISP_TYPE_INSTANCE, obj)) +LISP_DEFUN(instancep); + +#define POINTERP(obj) (TYPE_OF(obj) == LISP_TYPE_POINTER) +#define AS_POINTER(obj) ((LispPointer *) lisp_check_type(LISP_TYPE_POINTER, obj)) +LISP_DEFUN(pointerp); + +// NOTE: this evaluates obj twice!! +#define LISTP(obj) (NILP(obj) || CONSP(obj)) +LISP_DEFUN(listp); + +#define ATOM(obj) (!CONSP(obj)) +LISP_DEFUN(atom); + +#define NATIVE(obj) (!INSTANCEP(obj)) +LISP_DEFUN(native); + +LISP_DEFUN(type_of); +#define TYPE_STR(obj) (((LispSymbol *) call_native(Ftype_of, 1, (obj)))->name) +LISP_DEFUN(cons); +LISP_DEFUN(list); +LISP_DEFUN(length); +LISP_DEFUN(intern); +LISP_DEFUN(not); +LISP_DEFUN(hash); +LISP_DEFUN(make_hash_table); +LISP_DEFUN(float); +LISP_DEFUN(eq); +LISP_DEFUN(gethash); +LISP_DEFUN(puthash); +LISP_DEFUN(remhash); +LISP_DEFUN(symbol_function); +LISP_DEFUN(funcall); +LISP_DEFUN(apply); +LISP_DEFUN(eval); +LISP_DEFUN(make_instance); +LISP_DEFUN(slot); +LISP_DEFUN(setslot); +LISP_DEFUN(array_to_list); +LISP_DEFUN(list_to_array); +LISP_DEFUN(superclassp); +LISP_DEFUN(subclassp); +LISP_DEFUN(hash_as_zero); + +// These are special forms, they their argument are NOT evaluated +LISP_DEFUN(quote); +LISP_DEFUN(and); +LISP_DEFUN(or); diff --git a/src/main.c b/src/main.c new file mode 100644 index 0000000..aaacbbe --- /dev/null +++ b/src/main.c @@ -0,0 +1,58 @@ +#include +#include "parse.h" + +static const char *token_type_to_str(TokenType type) { + switch (type) { + case TOKEN_TYPE_EOF: + return "EOF"; + case TOKEN_TYPE_COMMENT: + return "COMMENT"; + case TOKEN_TYPE_PAREN: + return "PAREN"; + case TOKEN_TYPE_BRACKET: + return "BRACKET"; + case TOKEN_TYPE_SYMBOL: + return "SYMBOL"; + case TOKEN_TYPE_QUOTE: + return "QUOTE"; + case TOKEN_TYPE_NUMBER: + return "NUMBER"; + case TOKEN_TYPE_CHAR: + return "CHAR"; + case TOKEN_TYPE_STRING: + return "STRING"; + default: + return "UNKNOWN"; + } +} + +int main(int argc, const char **argv) { + init_lisp(); + LispObject *msg_slot = ref_lisp_object(INTERN_LITERAL("message")); + jmp_buf jmp; + int branch = setjmp(jmp); + if (!branch) { + LispHashTable *handlers = (void *) call_native(Fmake_hash_table, 2, Vnil, Vnil); + call_native(Fputhash, 3, handlers, type_error_class, make_lisp_int(1)); + call_native(Fputhash, 3, handlers, class_slot_error_class, make_lisp_int(2)); + StackFramePlace err_place = { + .file = STRING_FROM_LITERAL(__FILE__), + .is_native = true, + .line = __LINE__ - 3, + .col = 8, + }; + push_stack((void *) INTERN_LITERAL(__FUNCTION__), &err_place, &jmp, handlers); + unref_lisp_object(handlers); + AS_STRING(Vnil); + } else if (branch == 1) { + LispString *msg = (void *) call_native(Fslot, 2, current_error, msg_slot); + printf("Caught %s: %*s\n", + current_error->class->name->name->text, + (int) msg->length, msg->text); + dump_stack(current_error); + } + unref_lisp_object(msg_slot); + pop_stack(); + deinit_lisp(); + return 0; +} diff --git a/src/parse.c b/src/parse.c new file mode 100644 index 0000000..84cc829 --- /dev/null +++ b/src/parse.c @@ -0,0 +1,405 @@ +#include "parse.h" + +#include +#include +#include + +static void append_char(Token *token, char new_char) { + if (token->len >= token->buf_len) { + token->buf_len = token->len + 1; + token->text = realloc(token->text, token->buf_len); + } + token->text[token->len++] = new_char; +} + +static void append_null_byte(Token *token) { + if (token->len >= token->buf_len) { + token->buf_len = token->len + 1; + token->text = realloc(token->text, token->buf_len); + } + token->text[token->len] = '\0'; +} + +static void copy_to_buffer(Token *token, const char *src, size_t src_len) { + if (src_len >= token->buf_len) { + token->buf_len = src_len + 1; + token->text = realloc(token->text, token->buf_len); + } + memcpy(token->text, src, src_len); + token->len = src_len; + token->text[src_len] = '\0'; +} + +static int issymbolend(int c) { + return isspace(c) || c == ')' || c == ']'; +} + +// takes the string arguments +static void token_stream_push_error(TokenStream *stream, Token *token, + char *desc) { + ParseError *err = malloc(sizeof(ParseError)); + err->next = NULL; + err->col = token->col; + err->line = token->line; + err->desc = desc; + err->context = malloc(token->len + 1); + memcpy(err->context, token->text, token->len); + err->context[token->len] = '\0'; + if (stream->error_tail) { + stream->error_tail->next = err; + } else { + stream->error_head = err; + } + stream->error_tail = err; + ++stream->error_count; + token->type = TOKEN_TYPE_UNKNOWN; + copy_to_buffer(token, "", 0); +} + +// src is taken by this function +TokenStream *make_token_stream(FILE *src) { + TokenStream *stream = malloc(sizeof(TokenStream)); + stream->src = src; + stream->col = 0; + stream->line = 1; + stream->error_tail = NULL; + stream->error_head = NULL; + stream->error_count = 0; + return stream; +} + +void destroy_token_stream(TokenStream *stream) { + while (stream->error_head) { + void *next = stream->error_head->next; + free(stream->error_head); + stream->error_head = next; + } + fclose(stream->src); + free(stream); +} + +static void next_comment(TokenStream *stream, Token *token) { + char c; + while ((c = fgetc(stream->src)) != EOF) { + if (c == '\n') { + break; + } + append_char(token, c); + } + append_null_byte(token); + ++stream->line; + stream->col = 0; +} + +static void skip_while(TokenStream *stream, int(*pred)(int c), bool inv) { + char c; + while ((c = fgetc(stream->src)) != EOF && + ((!inv && pred(c)) || (inv && !pred(c)))) { + if (c == '\n') { + ++stream->line; + stream->col = 0; + } else { + ++stream->col; + } + } + ungetc(c, stream->src); +} + +static void next_char(TokenStream *stream, Token *token) { + token->len = 1; + char c = fgetc(stream->src); + copy_to_buffer(token, &c, 1); + ++stream->col; +} + +static void next_string(TokenStream *stream, Token *token) { + bool backslash = false; + char c = fgetc(stream->src); // opening " + append_char(token, c); + while ((c = fgetc(stream->src)) != EOF && (backslash || c != '"')) { + if (c == '\\' && !backslash) { + backslash = true; + } else { + backslash = false; + append_char(token, c); + if (c == '\n') { + ++stream->line; + stream->col = 0; + } else { + ++stream->col; + } + } + } + ++stream->col; + append_char(token, '"'); + append_null_byte(token); + if (feof(stream->src)) { + token_stream_push_error(stream, token, + strdup("expected '\"', got EOF")); + } +} + +static void next_symbol(TokenStream *stream, Token *token) { + char c; + bool backslash = false; + while ((c = fgetc(stream->src)) != EOF && + (backslash || !issymbolend(c))) { + if (c == '\\' && !backslash) { + backslash = true; + } else { + backslash = false; + append_char(token, c); + } + } + append_null_byte(token); + ungetc(c, stream->src); +} + +static void next_char_literal(TokenStream *stream, Token *token) { + fgetc(stream->src); + append_char(token, '#'); + char c = fgetc(stream->src); + append_char(token, c); + stream->col += 2; + if (c == EOF) { + token_stream_push_error(stream, token, + strdup("expected character literal, got EOF")); + token->len = 0; + token->type = TOKEN_TYPE_UNKNOWN; + } else if (c == '\\') { + // named character literal, like "#\newline" + while ((c = fgetc(stream->src)) != EOF && isalpha(c)) { + append_char(token, c); + ++stream->col; + } + } + append_null_byte(token); + c = fgetc(stream->src); + if (c != EOF && !issymbolend(c)) { + token_stream_push_error(stream, token, + strdup("character literal too long")); + skip_while(stream, &issymbolend, true); + } else { + ungetc(c, stream->src); + } +} + +// we accept base = 2, 8, 10, and 16 +static int isbasechar(char c, int base) { + if (c < '0') { + return false; + } + switch (base) { + case 16: + c = tolower(c); + if (c >= 'a' && c <= 'f') { + return true; + } + base = 10; + case 2: + case 8: + case 10: + return c <= '0' + (base - 1); + default: + return false; + } +} + +static int get_base_from_token(Token *token) { + size_t i; + for (i = 0; i < token->len; ++i) { + if (token->text[i] != '0') { + break; + } + } + if (token->len - i == 1) { + switch (token->text[i]) { + case '2': + return 2; + case '8': + return 8; + } + return 0; + } else if (token->len - i == 2 && token->text[i] == '1') { + switch (token->text[i + 1]) { + case '0': + return 10; + case '6': + return 16; + } + return 0; + } + return 0; +} + +static void next_number_or_symbol(TokenStream *stream, Token *token, char first_char) { + token->type = TOKEN_TYPE_NUMBER; + bool has_decimal = false; + bool has_base = false; + bool only_nums = true; + bool has_exp = false; + bool allow_plus_minus = false; + int base = 10; + bool has_num = isbasechar(first_char, 10); + if (first_char == '.') { + has_decimal = true; + only_nums = false; + } else if (first_char == '-' || first_char == '+') { + only_nums = false; + } + append_char(token, first_char); + char c; + while ((c = fgetc(stream->src)) != EOF && !issymbolend(c)) { + ++stream->col; + if (c == '.') { + if (has_decimal || has_base) { + token->type = TOKEN_TYPE_SYMBOL; + ungetc(c, stream->src); + next_symbol(stream, token); + return; + } + only_nums = false; + has_decimal = true; + } else if (c == '#') { + if (has_base || !only_nums) { + token->type = TOKEN_TYPE_SYMBOL; + + ungetc(c, stream->src); + next_symbol(stream, token); + return; + } else { + base = get_base_from_token(token); + if (base == 0) { + token->type = TOKEN_TYPE_SYMBOL; + ungetc(c, stream->src); + next_symbol(stream, token); + return; + } + } + has_base = true; + has_num = false; + allow_plus_minus = true; + append_char(token, c); + continue; + } else if (c == 'e') { + if (has_exp) { + token->type = TOKEN_TYPE_SYMBOL; + ungetc(c, stream->src); + next_symbol(stream, token); + return; + } + allow_plus_minus = true; + only_nums = false; + has_exp = true; + has_decimal = false; // the exponent can have a decimal point + append_char(token, c); + continue; + } else if (allow_plus_minus && (c == '+' || c == '-')) { + // fall-through + } else if (!isbasechar(c, base)) { + token->type = TOKEN_TYPE_SYMBOL; + ungetc(c, stream->src); + next_symbol(stream, token); + return; + } + has_num = true; + allow_plus_minus = false; + append_char(token, c); + } + if (!has_num) { + token->type = TOKEN_TYPE_SYMBOL; + } + append_null_byte(token); + ungetc(c, stream->src); +} + +// return the number of errors after parsing +size_t token_stream_next(TokenStream *stream, Token *token) { + skip_while(stream, &isspace, false); + token->line = stream->line; + token->col = stream->col + 1; + token->len = 0; + char nc = fgetc(stream->src); + if (nc == EOF) { + token->type = TOKEN_TYPE_EOF; + copy_to_buffer(token, "", 0); + return stream->error_count; + } + ungetc(nc, stream->src); + if (nc == ';') { + token->type = TOKEN_TYPE_COMMENT; + next_comment(stream, token); + } else if (nc == '(' || nc == ')') { + token->type = TOKEN_TYPE_PAREN; + next_char(stream, token); + } else if (nc == '[' || nc == ']') { + token->type = TOKEN_TYPE_BRACKET; + next_char(stream, token); + } else if (nc == '\'') { + token->type = TOKEN_TYPE_QUOTE; + next_char(stream, token); + } else if (nc == '"') { + token->type = TOKEN_TYPE_STRING; + next_string(stream, token); + } else if (nc == '.') { + // look at character after the . + char chars[2]; + fread(chars, 1, 2, stream->src); + ungetc(chars[1], stream->src); + if (isspace(chars[1])) { + ++stream->col; + token->type = TOKEN_TYPE_SYMBOL; + copy_to_buffer(token, ".", 1); + } else { + // the . is part of something bigger + next_number_or_symbol(stream, token, chars[1]); + } + } else if (nc == '#') { + token->type = TOKEN_TYPE_CHAR; + next_char_literal(stream, token); + } else if (nc == '-' || nc == '+' || (nc >= '0' && nc <= '9')) { + next_number_or_symbol(stream, token, fgetc(stream->src)); + } else { + token->type = nc == ':' ? TOKEN_TYPE_PROPERTY : TOKEN_TYPE_SYMBOL; + next_symbol(stream, token); + } + return stream->error_count; +} + +void token_free(Token *token) { + free(token->text); +} + +// return the number of errors left +ParseError *token_stream_error(TokenStream *stream) { + if (stream->error_count == 0) { + return NULL; + } + ParseError *error = stream->error_head; + stream->error_head = stream->error_head->next; + if (!stream->error_head) { + stream->error_tail = NULL; + } + error->next = NULL; + --stream->error_count; + return error; +} + +void parse_error_free(ParseError *error) { + if (error) { + free(error->desc); + free(error->context); + free(error); + } +} + +void read_native(FILE *src, LispObject ***result, size_t *result_len, + ParseError *errors, size_t *error_count) { + TokenStream *stream = make_token_stream(src); + errors = stream->error_head; + stream->error_head = NULL; + stream->error_tail = NULL; + stream->error_count = 0; + *error_count = stream->error_count; + destroy_token_stream(stream); +} diff --git a/src/parse.h b/src/parse.h new file mode 100644 index 0000000..7bffbf2 --- /dev/null +++ b/src/parse.h @@ -0,0 +1,60 @@ +#include +#include + +#include "lisp.h" + +typedef struct { + size_t line; + size_t col; + char *context; + char *desc; + + void *next; +} ParseError; + +typedef struct { + FILE *src; + + size_t line; + size_t col; + + ParseError *error_head; + ParseError *error_tail; + size_t error_count; +} TokenStream; + +typedef enum { + TOKEN_TYPE_EOF, + TOKEN_TYPE_UNKNOWN, + TOKEN_TYPE_COMMENT, + TOKEN_TYPE_PAREN, + TOKEN_TYPE_BRACKET, + TOKEN_TYPE_SYMBOL, + TOKEN_TYPE_PROPERTY, + TOKEN_TYPE_QUOTE, + TOKEN_TYPE_CHAR, + TOKEN_TYPE_NUMBER, + TOKEN_TYPE_STRING, +} TokenType; + +typedef struct { + TokenType type; + char *text; + size_t buf_len; + size_t len; + size_t line; + size_t col; +} Token; + +// src is taken by this function +TokenStream *make_token_stream(FILE *src); +void destroy_token_stream(TokenStream *stream); +// return the number of errors after parsing +size_t token_stream_next(TokenStream *stream, Token *token); +void token_free(Token *token); +// return the number of errors left +ParseError *token_stream_error(TokenStream *stream); +void parse_error_free(ParseError *error); + +void read_native(FILE *src, LispObject ***result, size_t *result_len, + ParseError *errors, size_t *error_count);