From: David Vázquez Date: Thu, 25 Apr 2013 13:20:13 +0000 (+0100) Subject: Move source code under src/ X-Git-Url: http://repo.macrolet.net/gitweb/?a=commitdiff_plain;h=261c79ce0f1b20b7f917a4139239facbd3e89eed;p=jscl.git Move source code under src/ --- diff --git a/AUTHORS b/AUTHORS new file mode 100644 index 0000000..6ca848a --- /dev/null +++ b/AUTHORS @@ -0,0 +1,2 @@ +David Vazquez +Raimond Grau diff --git a/COPYING b/COPYING new file mode 100644 index 0000000..94a9ed0 --- /dev/null +++ b/COPYING @@ -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/boot.lisp b/boot.lisp deleted file mode 100644 index 3454c65..0000000 --- a/boot.lisp +++ /dev/null @@ -1,855 +0,0 @@ -;;; boot.lisp --- First forms to be cross compiled - -;; Copyright (C) 2012, 2013 David Vazquez -;; Copyright (C) 2012 Raimon Grau - -;; 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 . - -;;; This code is executed when ecmalisp compiles this file -;;; itself. The compiler provides compilation of some special forms, -;;; as well as funcalls and macroexpansion, but no functions. So, we -;;; define the Lisp world from scratch. This code has to define enough -;;; language to the compiler to be able to run. - -(eval-when-compile - (%compile-defmacro 'defmacro - '(function - (lambda (name args &rest body) - `(eval-when-compile - (%compile-defmacro ',name - '(function - (lambda ,(mapcar #'(lambda (x) - (if (eq x '&body) - '&rest - x)) - args) - ,@body)))))))) - -(defmacro declaim (&rest decls) - `(eval-when-compile - ,@(mapcar (lambda (decl) `(!proclaim ',decl)) decls))) - -(defmacro defconstant (name value &optional docstring) - `(progn - (declaim (special ,name)) - (declaim (constant ,name)) - (setq ,name ,value) - ,@(when (stringp docstring) `((oset ',name "vardoc" ,docstring))) - ',name)) - -(defconstant t 't) -(defconstant nil 'nil) -(%js-vset "nil" nil) - -(defmacro lambda (args &body body) - `(function (lambda ,args ,@body))) - -(defmacro when (condition &body body) - `(if ,condition (progn ,@body) nil)) - -(defmacro unless (condition &body body) - `(if ,condition nil (progn ,@body))) - -(defmacro defvar (name value &optional docstring) - `(progn - (declaim (special ,name)) - (unless (boundp ',name) (setq ,name ,value)) - ,@(when (stringp docstring) `((oset ',name "vardoc" ,docstring))) - ',name)) - -(defmacro defparameter (name value &optional docstring) - `(progn - (setq ,name ,value) - ,@(when (stringp docstring) `((oset ',name "vardoc" ,docstring))) - ',name)) - -(defmacro named-lambda (name args &rest body) - (let ((x (gensym "FN"))) - `(let ((,x (lambda ,args ,@body))) - (oset ,x "fname" ,name) - ,x))) - -(defmacro defun (name args &rest body) - `(progn - (fset ',name - (named-lambda ,(symbol-name name) ,args - ,@(if (and (stringp (car body)) (not (null (cdr body)))) - `(,(car body) (block ,name ,@(cdr body))) - `((block ,name ,@body))))) - ',name)) - -(defun null (x) - (eq x nil)) - -(defun endp (x) - (if (null x) - t - (if (consp x) - nil - (error "type-error")))) - -(defmacro return (&optional value) - `(return-from nil ,value)) - -(defmacro while (condition &body body) - `(block nil (%while ,condition ,@body))) - -(defvar *gensym-counter* 0) -(defun gensym (&optional (prefix "G")) - (setq *gensym-counter* (+ *gensym-counter* 1)) - (make-symbol (concat-two prefix (integer-to-string *gensym-counter*)))) - -(defun boundp (x) - (boundp x)) - -;; Basic functions -(defun = (x y) (= x y)) -(defun * (x y) (* x y)) -(defun / (x y) (/ x y)) -(defun 1+ (x) (+ x 1)) -(defun 1- (x) (- x 1)) -(defun zerop (x) (= x 0)) -(defun truncate (x y) (floor (/ x y))) - -(defun eql (x y) (eq x y)) - -(defun not (x) (if x nil t)) - -(defun cons (x y ) (cons x y)) -(defun consp (x) (consp x)) - -(defun car (x) - "Return the CAR part of a cons, or NIL if X is null." - (car x)) - -(defun cdr (x) (cdr x)) -(defun caar (x) (car (car x))) -(defun cadr (x) (car (cdr x))) -(defun cdar (x) (cdr (car x))) -(defun cddr (x) (cdr (cdr x))) -(defun cadar (x) (car (cdr (car x)))) -(defun caddr (x) (car (cdr (cdr x)))) -(defun cdddr (x) (cdr (cdr (cdr x)))) -(defun cadddr (x) (car (cdr (cdr (cdr x))))) -(defun first (x) (car x)) -(defun second (x) (cadr x)) -(defun third (x) (caddr x)) -(defun fourth (x) (cadddr x)) -(defun rest (x) (cdr x)) - -(defun list (&rest args) args) -(defun atom (x) - (not (consp x))) - -;; Basic macros - -(defmacro incf (x &optional (delta 1)) - `(setq ,x (+ ,x ,delta))) - -(defmacro decf (x &optional (delta 1)) - `(setq ,x (- ,x ,delta))) - -(defmacro push (x place) - (multiple-value-bind (dummies vals newval setter getter) - (get-setf-expansion place) - (let ((g (gensym))) - `(let* ((,g ,x) - ,@(mapcar #'list dummies vals) - (,(car newval) (cons ,g ,getter)) - ,@(cdr newval)) - ,setter)))) - -(defmacro dolist (iter &body body) - (let ((var (first iter)) - (g!list (gensym))) - `(block nil - (let ((,g!list ,(second iter)) - (,var nil)) - (%while ,g!list - (setq ,var (car ,g!list)) - (tagbody ,@body) - (setq ,g!list (cdr ,g!list))) - ,(third iter))))) - -(defmacro dotimes (iter &body body) - (let ((g!to (gensym)) - (var (first iter)) - (to (second iter)) - (result (third iter))) - `(block nil - (let ((,var 0) - (,g!to ,to)) - (%while (< ,var ,g!to) - (tagbody ,@body) - (incf ,var)) - ,result)))) - -(defmacro cond (&rest clausules) - (if (null clausules) - nil - (if (eq (caar clausules) t) - `(progn ,@(cdar clausules)) - `(if ,(caar clausules) - (progn ,@(cdar clausules)) - (cond ,@(cdr clausules)))))) - -(defmacro case (form &rest clausules) - (let ((!form (gensym))) - `(let ((,!form ,form)) - (cond - ,@(mapcar (lambda (clausule) - (if (eq (car clausule) t) - clausule - `((eql ,!form ',(car clausule)) - ,@(cdr clausule)))) - clausules))))) - -(defmacro ecase (form &rest clausules) - `(case ,form - ,@(append - clausules - `((t - (error "ECASE expression failed.")))))) - -(defmacro and (&rest forms) - (cond - ((null forms) - t) - ((null (cdr forms)) - (car forms)) - (t - `(if ,(car forms) - (and ,@(cdr forms)) - nil)))) - -(defmacro or (&rest forms) - (cond - ((null forms) - nil) - ((null (cdr forms)) - (car forms)) - (t - (let ((g (gensym))) - `(let ((,g ,(car forms))) - (if ,g ,g (or ,@(cdr forms)))))))) - -(defmacro prog1 (form &body body) - (let ((value (gensym))) - `(let ((,value ,form)) - ,@body - ,value))) - -(defmacro prog2 (form1 result &body body) - `(prog1 (progn ,form1 ,result) ,@body)) - - - -;;; Go on growing the Lisp language in Ecmalisp, with more high level -;;; utilities as well as correct versions of other constructions. - -(defun + (&rest args) - (let ((r 0)) - (dolist (x args r) - (incf r x)))) - -(defun - (x &rest others) - (if (null others) - (- x) - (let ((r x)) - (dolist (y others r) - (decf r y))))) - -(defun append-two (list1 list2) - (if (null list1) - list2 - (cons (car list1) - (append (cdr list1) list2)))) - -(defun append (&rest lists) - (!reduce #'append-two lists)) - -(defun revappend (list1 list2) - (while list1 - (push (car list1) list2) - (setq list1 (cdr list1))) - list2) - -(defun reverse (list) - (revappend list '())) - -(defmacro psetq (&rest pairs) - (let (;; For each pair, we store here a list of the form - ;; (VARIABLE GENSYM VALUE). - (assignments '())) - (while t - (cond - ((null pairs) (return)) - ((null (cdr pairs)) - (error "Odd paris in PSETQ")) - (t - (let ((variable (car pairs)) - (value (cadr pairs))) - (push `(,variable ,(gensym) ,value) assignments) - (setq pairs (cddr pairs)))))) - (setq assignments (reverse assignments)) - ;; - `(let ,(mapcar #'cdr assignments) - (setq ,@(!reduce #'append (mapcar #'butlast assignments)))))) - -(defmacro do (varlist endlist &body body) - `(block nil - (let ,(mapcar (lambda (x) (list (first x) (second x))) varlist) - (while t - (when ,(car endlist) - (return (progn ,@(cdr endlist)))) - (tagbody ,@body) - (psetq - ,@(apply #'append - (mapcar (lambda (v) - (and (consp (cddr v)) - (list (first v) (third v)))) - varlist))))))) - -(defmacro do* (varlist endlist &body body) - `(block nil - (let* ,(mapcar (lambda (x) (list (first x) (second x))) varlist) - (while t - (when ,(car endlist) - (return (progn ,@(cdr endlist)))) - (tagbody ,@body) - (setq - ,@(apply #'append - (mapcar (lambda (v) - (and (consp (cddr v)) - (list (first v) (third v)))) - varlist))))))) - -(defun list-length (list) - (let ((l 0)) - (while (not (null list)) - (incf l) - (setq list (cdr list))) - l)) - -(defun length (seq) - (cond - ((stringp seq) - (string-length seq)) - ((arrayp seq) - (oget seq "length")) - ((listp seq) - (list-length seq)))) - -(defun concat-two (s1 s2) - (concat-two s1 s2)) - -(defmacro with-collect (&body body) - (let ((head (gensym)) - (tail (gensym))) - `(let* ((,head (cons 'sentinel nil)) - (,tail ,head)) - (flet ((collect (x) - (rplacd ,tail (cons x nil)) - (setq ,tail (cdr ,tail)) - x)) - ,@body) - (cdr ,head)))) - -(defun map1 (func list) - (with-collect - (while list - (collect (funcall func (car list))) - (setq list (cdr list))))) - -(defmacro loop (&body body) - `(while t ,@body)) - -(defun mapcar (func list &rest lists) - (let ((lists (cons list lists))) - (with-collect - (block loop - (loop - (let ((elems (map1 #'car lists))) - (do ((tail lists (cdr tail))) - ((null tail)) - (when (null (car tail)) (return-from loop)) - (rplaca tail (cdar tail))) - (collect (apply func elems)))))))) - -(defun identity (x) x) - -(defun constantly (x) - (lambda (&rest args) - x)) - -(defun copy-list (x) - (mapcar #'identity x)) - -(defun list* (arg &rest others) - (cond ((null others) arg) - ((null (cdr others)) (cons arg (car others))) - (t (do ((x others (cdr x))) - ((null (cddr x)) (rplacd x (cadr x)))) - (cons arg others)))) - -(defun code-char (x) x) -(defun char-code (x) x) -(defun char= (x y) (= x y)) - -(defun integerp (x) - (and (numberp x) (= (floor x) x))) - -(defun plusp (x) (< 0 x)) -(defun minusp (x) (< x 0)) - -(defun listp (x) - (or (consp x) (null x))) - -(defun nthcdr (n list) - (while (and (plusp n) list) - (setq n (1- n)) - (setq list (cdr list))) - list) - -(defun nth (n list) - (car (nthcdr n list))) - -(defun last (x) - (while (consp (cdr x)) - (setq x (cdr x))) - x) - -(defun butlast (x) - (and (consp (cdr x)) - (cons (car x) (butlast (cdr x))))) - -(defun member (x list) - (while list - (when (eql x (car list)) - (return list)) - (setq list (cdr list)))) - -(defun find (item list &key key (test #'eql)) - (dolist (x list) - (when (funcall test (funcall key x) item) - (return x)))) - -(defun remove (x list) - (cond - ((null list) - nil) - ((eql x (car list)) - (remove x (cdr list))) - (t - (cons (car list) (remove x (cdr list)))))) - -(defun remove-if (func list) - (cond - ((null list) - nil) - ((funcall func (car list)) - (remove-if func (cdr list))) - (t - ;; - (cons (car list) (remove-if func (cdr list)))))) - -(defun remove-if-not (func list) - (cond - ((null list) - nil) - ((funcall func (car list)) - (cons (car list) (remove-if-not func (cdr list)))) - (t - (remove-if-not func (cdr list))))) - -(defun digit-char-p (x) - (if (and (<= #\0 x) (<= x #\9)) - (- x #\0) - nil)) - -(defun digit-char (weight) - (and (<= 0 weight 9) - (char "0123456789" weight))) - -(defun subseq (seq a &optional b) - (cond - ((stringp seq) - (if b - (slice seq a b) - (slice seq a))) - (t - (error "Unsupported argument.")))) - -(defmacro do-sequence (iteration &body body) - (let ((seq (gensym)) - (index (gensym))) - `(let ((,seq ,(second iteration))) - (cond - ;; Strings - ((stringp ,seq) - (let ((,index 0)) - (dotimes (,index (length ,seq)) - (let ((,(first iteration) - (char ,seq ,index))) - ,@body)))) - ;; Lists - ((listp ,seq) - (dolist (,(first iteration) ,seq) - ,@body)) - (t - (error "type-error!")))))) - -(defun some (function seq) - (do-sequence (elt seq) - (when (funcall function elt) - (return-from some t)))) - -(defun every (function seq) - (do-sequence (elt seq) - (unless (funcall function elt) - (return-from every nil))) - t) - -(defun position (elt sequence) - (let ((pos 0)) - (do-sequence (x seq) - (when (eq elt x) - (return)) - (incf pos)) - pos)) - -(defun assoc (x alist) - (while alist - (if (eql x (caar alist)) - (return) - (setq alist (cdr alist)))) - (car alist)) - -(defun string (x) - (cond ((stringp x) x) - ((symbolp x) (symbol-name x)) - (t (char-to-string x)))) - -(defun string= (s1 s2) - (equal s1 s2)) - -(defun fdefinition (x) - (cond - ((functionp x) - x) - ((symbolp x) - (symbol-function x)) - (t - (error "Invalid function")))) - -(defun disassemble (function) - (write-line (lambda-code (fdefinition function))) - nil) - -(defun documentation (x type) - "Return the documentation of X. TYPE must be the symbol VARIABLE or FUNCTION." - (ecase type - (function - (let ((func (fdefinition x))) - (oget func "docstring"))) - (variable - (unless (symbolp x) - (error "Wrong argument type! it should be a symbol")) - (oget x "vardoc")))) - -(defmacro multiple-value-bind (variables value-from &body body) - `(multiple-value-call (lambda (&optional ,@variables &rest ,(gensym)) - ,@body) - ,value-from)) - -(defmacro multiple-value-list (value-from) - `(multiple-value-call #'list ,value-from)) - - -;;; Generalized references (SETF) - -(defvar *setf-expanders* nil) - -(defun get-setf-expansion (place) - (if (symbolp place) - (let ((value (gensym))) - (values nil - nil - `(,value) - `(setq ,place ,value) - place)) - (let ((place (ls-macroexpand-1 place))) - (let* ((access-fn (car place)) - (expander (cdr (assoc access-fn *setf-expanders*)))) - (when (null expander) - (error "Unknown generalized reference.")) - (apply expander (cdr place)))))) - -(defmacro define-setf-expander (access-fn lambda-list &body body) - (unless (symbolp access-fn) - (error "ACCESS-FN must be a symbol.")) - `(progn (push (cons ',access-fn (lambda ,lambda-list ,@body)) - *setf-expanders*) - ',access-fn)) - -(defmacro setf (&rest pairs) - (cond - ((null pairs) - nil) - ((null (cdr pairs)) - (error "Odd number of arguments to setf.")) - ((null (cddr pairs)) - (let ((place (ls-macroexpand-1 (first pairs))) - (value (second pairs))) - (multiple-value-bind (vars vals store-vars writer-form reader-form) - (get-setf-expansion place) - ;; TODO: Optimize the expansion a little bit to avoid let* - ;; or multiple-value-bind when unnecesary. - `(let* ,(mapcar #'list vars vals) - (multiple-value-bind ,store-vars - ,value - ,writer-form))))) - (t - `(progn - ,@(do ((pairs pairs (cddr pairs)) - (result '() (cons `(setf ,(car pairs) ,(cadr pairs)) result))) - ((null pairs) - (reverse result))))))) - -(define-setf-expander car (x) - (let ((cons (gensym)) - (new-value (gensym))) - (values (list cons) - (list x) - (list new-value) - `(progn (rplaca ,cons ,new-value) ,new-value) - `(car ,cons)))) - -(define-setf-expander cdr (x) - (let ((cons (gensym)) - (new-value (gensym))) - (values (list cons) - (list x) - (list new-value) - `(progn (rplacd ,cons ,new-value) ,new-value) - `(car ,cons)))) - -;; Incorrect typecase, but used in NCONC. -(defmacro typecase (x &rest clausules) - (let ((value (gensym))) - `(let ((,value ,x)) - (cond - ,@(mapcar (lambda (c) - (if (eq (car c) t) - `((t ,@(rest c))) - `((,(ecase (car c) - (integer 'integerp) - (cons 'consp) - (string 'stringp) - (atom 'atom) - (null 'null)) - ,value) - ,@(or (rest c) - (list nil))))) - clausules))))) - -;; The NCONC function is based on the SBCL's one. -(defun nconc (&rest lists) - (flet ((fail (object) - (error "type-error in nconc"))) - (do ((top lists (cdr top))) - ((null top) nil) - (let ((top-of-top (car top))) - (typecase top-of-top - (cons - (let* ((result top-of-top) - (splice result)) - (do ((elements (cdr top) (cdr elements))) - ((endp elements)) - (let ((ele (car elements))) - (typecase ele - (cons (rplacd (last splice) ele) - (setf splice ele)) - (null (rplacd (last splice) nil)) - (atom (if (cdr elements) - (fail ele) - (rplacd (last splice) ele)))))) - (return result))) - (null) - (atom - (if (cdr top) - (fail top-of-top) - (return top-of-top)))))))) - -(defun nreconc (x y) - (do ((1st (cdr x) (if (endp 1st) 1st (cdr 1st))) - (2nd x 1st) ; 2nd follows first down the list. - (3rd y 2nd)) ;3rd follows 2nd down the list. - ((atom 2nd) 3rd) - (rplacd 2nd 3rd))) - -(defun notany (fn seq) - (not (some fn seq))) - - -;; Packages - -(defvar *package-list* nil) - -(defun list-all-packages () - *package-list*) - -(defun make-package (name &key use) - (let ((package (new)) - (use (mapcar #'find-package-or-fail use))) - (oset package "packageName" name) - (oset package "symbols" (new)) - (oset package "exports" (new)) - (oset package "use" use) - (push package *package-list*) - package)) - -(defun packagep (x) - (and (objectp x) (in "symbols" x))) - -(defun find-package (package-designator) - (when (packagep package-designator) - (return-from find-package package-designator)) - (let ((name (string package-designator))) - (dolist (package *package-list*) - (when (string= (package-name package) name) - (return package))))) - -(defun find-package-or-fail (package-designator) - (or (find-package package-designator) - (error "Package unknown."))) - -(defun package-name (package-designator) - (let ((package (find-package-or-fail package-designator))) - (oget package "packageName"))) - -(defun %package-symbols (package-designator) - (let ((package (find-package-or-fail package-designator))) - (oget package "symbols"))) - -(defun package-use-list (package-designator) - (let ((package (find-package-or-fail package-designator))) - (oget package "use"))) - -(defun %package-external-symbols (package-designator) - (let ((package (find-package-or-fail package-designator))) - (oget package "exports"))) - -(defvar *common-lisp-package* - (make-package "CL")) - -(defvar *js-package* - (make-package "JS")) - -(defvar *user-package* - (make-package "CL-USER" :use (list *common-lisp-package*))) - -(defvar *keyword-package* - (make-package "KEYWORD")) - -(defun keywordp (x) - (and (symbolp x) (eq (symbol-package x) *keyword-package*))) - -(defvar *package* *common-lisp-package*) - -(defmacro in-package (package-designator) - `(eval-when-compile - (setq *package* (find-package-or-fail ,package-designator)))) - -;; This function is used internally to initialize the CL package -;; with the symbols built during bootstrap. -(defun %intern-symbol (symbol) - (let* ((package - (if (in "package" symbol) - (find-package-or-fail (oget symbol "package")) - *common-lisp-package*)) - (symbols (%package-symbols package))) - (oset symbol "package" package) - (when (eq package *keyword-package*) - (oset symbol "value" symbol)) - (oset symbols (symbol-name symbol) symbol))) - -(defun find-symbol (name &optional (package *package*)) - (let* ((package (find-package-or-fail package)) - (externals (%package-external-symbols package)) - (symbols (%package-symbols package))) - (cond - ((in name externals) - (values (oget externals name) :external)) - ((in name symbols) - (values (oget symbols name) :internal)) - (t - (dolist (used (package-use-list package) (values nil nil)) - (let ((exports (%package-external-symbols used))) - (when (in name exports) - (return (values (oget exports name) :inherit))))))))) - -(defun intern (name &optional (package *package*)) - (let ((package (find-package-or-fail package))) - (multiple-value-bind (symbol foundp) - (find-symbol name package) - (if foundp - (values symbol foundp) - (let ((symbols (%package-symbols package))) - (oget symbols name) - (let ((symbol (make-symbol name))) - (oset symbol "package" package) - (when (eq package *keyword-package*) - (oset symbol "value" symbol) - (export (list symbol) package)) - (when (eq package *js-package*) - (let ((sym-name (symbol-name symbol)) - (args (gensym))) - ;; Generate a trampoline to call the JS function - ;; properly. This trampoline is very inefficient, - ;; but it still works. Ideas to optimize this are - ;; provide a special lambda keyword - ;; cl::&rest-vector to avoid list argument - ;; consing, as well as allow inline declarations. - (fset symbol - (eval `(lambda (&rest ,args) - (let ((,args (list-to-vector ,args))) - (%js-call (%js-vref ,sym-name) ,args))))) - ;; Define it as a symbol macro to access to the - ;; Javascript variable literally. - (%define-symbol-macro symbol `(%js-vref ,(string symbol))))) - (oset symbols name symbol) - (values symbol nil))))))) - -(defun symbol-package (symbol) - (unless (symbolp symbol) - (error "it is not a symbol")) - (oget symbol "package")) - -(defun export (symbols &optional (package *package*)) - (let ((exports (%package-external-symbols package))) - (dolist (symb symbols t) - (oset exports (symbol-name symb) symb)))) - -(defun get-universal-time () - (+ (get-unix-time) 2208988800)) - -(defun concat (&rest strs) - (!reduce #'concat-two strs :initial-value "")) - -(defun values-list (list) - (values-array (list-to-vector list))) - -(defun values (&rest args) - (values-list args)) diff --git a/compat.lisp b/compat.lisp deleted file mode 100644 index 184c5dd..0000000 --- a/compat.lisp +++ /dev/null @@ -1,49 +0,0 @@ -;;; compat.lisp --- Create some definitions to fix CL compatibility - -;; Copyright (C) 2012, 2013 David Vazquez -;; Copyright (C) 2012 Raimon Grau - -;; 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 . - -;;; Duplicate from boot.lisp by now -(defmacro with-collect (&body body) - (let ((head (gensym)) - (tail (gensym))) - `(let* ((,head (cons 'sentinel nil)) - (,tail ,head)) - (flet ((collect (x) - (rplacd ,tail (cons x nil)) - (setq ,tail (cdr ,tail)) - x)) - ,@body) - (cdr ,head)))) - -(defmacro while (condition &body body) - `(do () - ((not ,condition)) - ,@body)) - -(defmacro eval-when-compile (&body body) - `(eval-when (:compile-toplevel :load-toplevel :execute) - ,@body)) - -(defun concat-two (s1 s2) - (concatenate 'string s1 s2)) - -(defun aset (array idx value) - (setf (aref array idx) value)) - -(eval-when-compile - (defun concat (&rest strs) - (apply #'concatenate 'string strs))) diff --git a/compiler.lisp b/compiler.lisp deleted file mode 100644 index 24c85ab..0000000 --- a/compiler.lisp +++ /dev/null @@ -1,1675 +0,0 @@ -;;; compiler.lisp --- - -;; Copyright (C) 2012, 2013 David Vazquez -;; Copyright (C) 2012 Raimon Grau - -;; 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 . - -;;;; Compiler - -;;; Translate the Lisp code to Javascript. It will compile the special -;;; forms. Some primitive functions are compiled as special forms -;;; too. The respective real functions are defined in the target (see -;;; the beginning of this file) as well as some primitive functions. - -(defun code (&rest args) - (mapconcat (lambda (arg) - (cond - ((null arg) "") - ((integerp arg) (integer-to-string arg)) - ((stringp arg) arg) - (t (error "Unknown argument.")))) - args)) - -;;; Wrap X with a Javascript code to convert the result from -;;; Javascript generalized booleans to T or NIL. -(defun js!bool (x) - (code "(" x "?" (ls-compile t) ": " (ls-compile nil) ")")) - -;;; Concatenate the arguments and wrap them with a self-calling -;;; Javascript anonymous function. It is used to make some Javascript -;;; statements valid expressions and provide a private scope as well. -;;; It could be defined as function, but we could do some -;;; preprocessing in the future. -(defmacro js!selfcall (&body body) - `(code "(function(){" *newline* (indent ,@body) "})()")) - -;;; Like CODE, but prefix each line with four spaces. Two versions -;;; of this function are available, because the Ecmalisp version is -;;; very slow and bootstraping was annoying. - -#+ecmalisp -(defun indent (&rest string) - (let ((input (apply #'code string))) - (let ((output "") - (index 0) - (size (length input))) - (when (plusp (length input)) (concatf output " ")) - (while (< index size) - (let ((str - (if (and (char= (char input index) #\newline) - (< index (1- size)) - (not (char= (char input (1+ index)) #\newline))) - (concat (string #\newline) " ") - (string (char input index))))) - (concatf output str)) - (incf index)) - output))) - -#+common-lisp -(defun indent (&rest string) - (with-output-to-string (*standard-output*) - (with-input-from-string (input (apply #'code string)) - (loop - for line = (read-line input nil) - while line - do (write-string " ") - do (write-line line))))) - - -;;; A Form can return a multiple values object calling VALUES, like -;;; values(arg1, arg2, ...). It will work in any context, as well as -;;; returning an individual object. However, if the special variable -;;; `*multiple-value-p*' is NIL, is granted that only the primary -;;; value will be used, so we can optimize to avoid the VALUES -;;; function call. -(defvar *multiple-value-p* nil) - -;; A very simple defstruct built on lists. It supports just slot with -;; an optional default initform, and it will create a constructor, -;; predicate and accessors for you. -(defmacro def!struct (name &rest slots) - (unless (symbolp name) - (error "It is not a full defstruct implementation.")) - (let* ((name-string (symbol-name name)) - (slot-descriptions - (mapcar (lambda (sd) - (cond - ((symbolp sd) - (list sd)) - ((and (listp sd) (car sd) (cddr sd)) - sd) - (t - (error "Bad slot accessor.")))) - slots)) - (predicate (intern (concat name-string "-P")))) - `(progn - ;; Constructor - (defun ,(intern (concat "MAKE-" name-string)) (&key ,@slot-descriptions) - (list ',name ,@(mapcar #'car slot-descriptions))) - ;; Predicate - (defun ,predicate (x) - (and (consp x) (eq (car x) ',name))) - ;; Copier - (defun ,(intern (concat "COPY-" name-string)) (x) - (copy-list x)) - ;; Slot accessors - ,@(with-collect - (let ((index 1)) - (dolist (slot slot-descriptions) - (let* ((name (car slot)) - (accessor-name (intern (concat name-string "-" (string name))))) - (collect - `(defun ,accessor-name (x) - (unless (,predicate x) - (error ,(concat "The object is not a type " name-string))) - (nth ,index x))) - ;; TODO: Implement this with a higher level - ;; abstraction like defsetf or (defun (setf ..)) - (collect - `(define-setf-expander ,accessor-name (x) - (let ((object (gensym)) - (new-value (gensym))) - (values (list object) - (list x) - (list new-value) - `(progn - (rplaca (nthcdr ,',index ,object) ,new-value) - ,new-value) - `(,',accessor-name ,object))))) - (incf index))))) - ',name))) - - -;;; Environment - -(def!struct binding - name - type - value - declarations) - -(def!struct lexenv - variable - function - block - gotag) - -(defun lookup-in-lexenv (name lexenv namespace) - (find name (ecase namespace - (variable (lexenv-variable lexenv)) - (function (lexenv-function lexenv)) - (block (lexenv-block lexenv)) - (gotag (lexenv-gotag lexenv))) - :key #'binding-name)) - -(defun push-to-lexenv (binding lexenv namespace) - (ecase namespace - (variable (push binding (lexenv-variable lexenv))) - (function (push binding (lexenv-function lexenv))) - (block (push binding (lexenv-block lexenv))) - (gotag (push binding (lexenv-gotag lexenv))))) - -(defun extend-lexenv (bindings lexenv namespace) - (let ((env (copy-lexenv lexenv))) - (dolist (binding (reverse bindings) env) - (push-to-lexenv binding env namespace)))) - - -(defvar *environment* (make-lexenv)) - -(defvar *variable-counter* 0) - -(defun gvarname (symbol) - (code "v" (incf *variable-counter*))) - -(defun translate-variable (symbol) - (awhen (lookup-in-lexenv symbol *environment* 'variable) - (binding-value it))) - -(defun extend-local-env (args) - (let ((new (copy-lexenv *environment*))) - (dolist (symbol args new) - (let ((b (make-binding :name symbol :type 'variable :value (gvarname symbol)))) - (push-to-lexenv b new 'variable))))) - -;;; Toplevel compilations -(defvar *toplevel-compilations* nil) - -(defun toplevel-compilation (string) - (push string *toplevel-compilations*)) - -(defun null-or-empty-p (x) - (zerop (length x))) - -(defun get-toplevel-compilations () - (reverse (remove-if #'null-or-empty-p *toplevel-compilations*))) - -(defun %compile-defmacro (name lambda) - (toplevel-compilation (ls-compile `',name)) - (let ((binding (make-binding :name name :type 'macro :value lambda))) - (push-to-lexenv binding *environment* 'function)) - name) - -(defun global-binding (name type namespace) - (or (lookup-in-lexenv name *environment* namespace) - (let ((b (make-binding :name name :type type :value nil))) - (push-to-lexenv b *environment* namespace) - b))) - -(defun claimp (symbol namespace claim) - (let ((b (lookup-in-lexenv symbol *environment* namespace))) - (and b (member claim (binding-declarations b))))) - -(defun !proclaim (decl) - (case (car decl) - (special - (dolist (name (cdr decl)) - (let ((b (global-binding name 'variable 'variable))) - (push 'special (binding-declarations b))))) - (notinline - (dolist (name (cdr decl)) - (let ((b (global-binding name 'function 'function))) - (push 'notinline (binding-declarations b))))) - (constant - (dolist (name (cdr decl)) - (let ((b (global-binding name 'variable 'variable))) - (push 'constant (binding-declarations b))))))) - -#+ecmalisp -(fset 'proclaim #'!proclaim) - -(defun %define-symbol-macro (name expansion) - (let ((b (make-binding :name name :type 'macro :value expansion))) - (push-to-lexenv b *environment* 'variable) - name)) - -#+ecmalisp -(defmacro define-symbol-macro (name expansion) - `(%define-symbol-macro ',name ',expansion)) - - -;;; Special forms - -(defvar *compilations* nil) - -(defmacro define-compilation (name args &body body) - ;; Creates a new primitive `name' with parameters args and - ;; @body. The body can access to the local environment through the - ;; variable *ENVIRONMENT*. - `(push (list ',name (lambda ,args (block ,name ,@body))) - *compilations*)) - -(define-compilation if (condition true false) - (code "(" (ls-compile condition) " !== " (ls-compile nil) - " ? " (ls-compile true *multiple-value-p*) - " : " (ls-compile false *multiple-value-p*) - ")")) - -(defvar *ll-keywords* '(&optional &rest &key)) - -(defun list-until-keyword (list) - (if (or (null list) (member (car list) *ll-keywords*)) - nil - (cons (car list) (list-until-keyword (cdr list))))) - -(defun ll-section (keyword ll) - (list-until-keyword (cdr (member keyword ll)))) - -(defun ll-required-arguments (ll) - (list-until-keyword ll)) - -(defun ll-optional-arguments-canonical (ll) - (mapcar #'ensure-list (ll-section '&optional ll))) - -(defun ll-optional-arguments (ll) - (mapcar #'car (ll-optional-arguments-canonical ll))) - -(defun ll-rest-argument (ll) - (let ((rest (ll-section '&rest ll))) - (when (cdr rest) - (error "Bad lambda-list")) - (car rest))) - -(defun ll-keyword-arguments-canonical (ll) - (flet ((canonicalize (keyarg) - ;; Build a canonical keyword argument descriptor, filling - ;; the optional fields. The result is a list of the form - ;; ((keyword-name var) init-form). - (let ((arg (ensure-list keyarg))) - (cons (if (listp (car arg)) - (car arg) - (list (intern (symbol-name (car arg)) "KEYWORD") (car arg))) - (cdr arg))))) - (mapcar #'canonicalize (ll-section '&key ll)))) - -(defun ll-keyword-arguments (ll) - (mapcar (lambda (keyarg) (second (first keyarg))) - (ll-keyword-arguments-canonical ll))) - -(defun ll-svars (lambda-list) - (let ((args - (append - (ll-keyword-arguments-canonical lambda-list) - (ll-optional-arguments-canonical lambda-list)))) - (remove nil (mapcar #'third args)))) - -(defun lambda-docstring-wrapper (docstring &rest strs) - (if docstring - (js!selfcall - "var func = " (join strs) ";" *newline* - "func.docstring = '" docstring "';" *newline* - "return func;" *newline*) - (apply #'code strs))) - -(defun lambda-check-argument-count - (n-required-arguments n-optional-arguments rest-p) - ;; Note: Remember that we assume that the number of arguments of a - ;; call is at least 1 (the values argument). - (let ((min (1+ n-required-arguments)) - (max (if rest-p 'n/a (+ 1 n-required-arguments n-optional-arguments)))) - (block nil - ;; Special case: a positive exact number of arguments. - (when (and (< 1 min) (eql min max)) - (return (code "checkArgs(arguments, " min ");" *newline*))) - ;; General case: - (code - (when (< 1 min) - (code "checkArgsAtLeast(arguments, " min ");" *newline*)) - (when (numberp max) - (code "checkArgsAtMost(arguments, " max ");" *newline*)))))) - -(defun compile-lambda-optional (ll) - (let* ((optional-arguments (ll-optional-arguments-canonical ll)) - (n-required-arguments (length (ll-required-arguments ll))) - (n-optional-arguments (length optional-arguments))) - (when optional-arguments - (code (mapconcat (lambda (arg) - (code "var " (translate-variable (first arg)) "; " *newline* - (when (third arg) - (code "var " (translate-variable (third arg)) - " = " (ls-compile t) - "; " *newline*)))) - optional-arguments) - "switch(arguments.length-1){" *newline* - (let ((cases nil) - (idx 0)) - (progn - (while (< idx n-optional-arguments) - (let ((arg (nth idx optional-arguments))) - (push (code "case " (+ idx n-required-arguments) ":" *newline* - (indent (translate-variable (car arg)) - "=" - (ls-compile (cadr arg)) ";" *newline*) - (when (third arg) - (indent (translate-variable (third arg)) - "=" - (ls-compile nil) - ";" *newline*))) - cases) - (incf idx))) - (push (code "default: break;" *newline*) cases) - (join (reverse cases)))) - "}" *newline*)))) - -(defun compile-lambda-rest (ll) - (let ((n-required-arguments (length (ll-required-arguments ll))) - (n-optional-arguments (length (ll-optional-arguments ll))) - (rest-argument (ll-rest-argument ll))) - (when rest-argument - (let ((js!rest (translate-variable rest-argument))) - (code "var " js!rest "= " (ls-compile nil) ";" *newline* - "for (var i = arguments.length-1; i>=" - (+ 1 n-required-arguments n-optional-arguments) - "; i--)" *newline* - (indent js!rest " = {car: arguments[i], cdr: ") js!rest "};" - *newline*))))) - -(defun compile-lambda-parse-keywords (ll) - (let ((n-required-arguments - (length (ll-required-arguments ll))) - (n-optional-arguments - (length (ll-optional-arguments ll))) - (keyword-arguments - (ll-keyword-arguments-canonical ll))) - (code - ;; Declare variables - (mapconcat (lambda (arg) - (let ((var (second (car arg)))) - (code "var " (translate-variable var) "; " *newline* - (when (third arg) - (code "var " (translate-variable (third arg)) - " = " (ls-compile nil) - ";" *newline*))))) - keyword-arguments) - ;; Parse keywords - (flet ((parse-keyword (keyarg) - ;; ((keyword-name var) init-form) - (code "for (i=" (+ 1 n-required-arguments n-optional-arguments) - "; i (LIST* a b c foo) -;;; provided a, b, c are not splicing frobs -;;; (APPEND (LIST* a b c) foo) => (LIST* a b (APPEND c foo)) -;;; provided a, b, c are not splicing frobs -;;; (APPEND (QUOTE (x)) foo) => (LIST* (QUOTE x) foo) -;;; (APPEND (CLOBBERABLE x) foo) => (NCONC x foo) -(defun bq-simplify (x) - (if (atom x) - x - (let ((x (if (eq (car x) *bq-quote*) - x - (maptree #'bq-simplify x)))) - (if (not (eq (car x) *bq-append*)) - x - (bq-simplify-args x))))) - -(defun bq-simplify-args (x) - (do ((args (reverse (cdr x)) (cdr args)) - (result - nil - (cond ((atom (car args)) - (bq-attach-append *bq-append* (car args) result)) - ((and (eq (caar args) *bq-list*) - (notany #'bq-splicing-frob (cdar args))) - (bq-attach-conses (cdar args) result)) - ((and (eq (caar args) *bq-list**) - (notany #'bq-splicing-frob (cdar args))) - (bq-attach-conses - (reverse (cdr (reverse (cdar args)))) - (bq-attach-append *bq-append* - (car (last (car args))) - result))) - ((and (eq (caar args) *bq-quote*) - (consp (cadar args)) - (not (bq-frob (cadar args))) - (null (cddar args))) - (bq-attach-conses (list (list *bq-quote* - (caadar args))) - result)) - ((eq (caar args) *bq-clobberable*) - (bq-attach-append *bq-nconc* (cadar args) result)) - (t (bq-attach-append *bq-append* - (car args) - result))))) - ((null args) result))) - -(defun null-or-quoted (x) - (or (null x) (and (consp x) (eq (car x) *bq-quote*)))) - -;;; When BQ-ATTACH-APPEND is called, the OP should be #:BQ-APPEND -;;; or #:BQ-NCONC. This produces a form (op item result) but -;;; some simplifications are done on the fly: -;;; -;;; (op '(a b c) '(d e f g)) => '(a b c d e f g) -;;; (op item 'nil) => item, provided item is not a splicable frob -;;; (op item 'nil) => (op item), if item is a splicable frob -;;; (op item (op a b c)) => (op item a b c) -(defun bq-attach-append (op item result) - (cond ((and (null-or-quoted item) (null-or-quoted result)) - (list *bq-quote* (append (cadr item) (cadr result)))) - ((or (null result) (equal result *bq-quote-nil*)) - (if (bq-splicing-frob item) (list op item) item)) - ((and (consp result) (eq (car result) op)) - (list* (car result) item (cdr result))) - (t (list op item result)))) - -;;; The effect of BQ-ATTACH-CONSES is to produce a form as if by -;;; `(LIST* ,@items ,result) but some simplifications are done -;;; on the fly. -;;; -;;; (LIST* 'a 'b 'c 'd) => '(a b c . d) -;;; (LIST* a b c 'nil) => (LIST a b c) -;;; (LIST* a b c (LIST* d e f g)) => (LIST* a b c d e f g) -;;; (LIST* a b c (LIST d e f g)) => (LIST a b c d e f g) -(defun bq-attach-conses (items result) - (cond ((and (every #'null-or-quoted items) - (null-or-quoted result)) - (list *bq-quote* - (append (mapcar #'cadr items) (cadr result)))) - ((or (null result) (equal result *bq-quote-nil*)) - (cons *bq-list* items)) - ((and (consp result) - (or (eq (car result) *bq-list*) - (eq (car result) *bq-list**))) - (cons (car result) (append items (cdr result)))) - (t (cons *bq-list** (append items (list result)))))) - -;;; Removes funny tokens and changes (#:BQ-LIST* a b) into -;;; (CONS a b) instead of (LIST* a b), purely for readability. -(defun bq-remove-tokens (x) - (cond ((eq x *bq-list*) 'list) - ((eq x *bq-append*) 'append) - ((eq x *bq-nconc*) 'nconc) - ((eq x *bq-list**) 'list*) - ((eq x *bq-quote*) 'quote) - ((atom x) x) - ((eq (car x) *bq-clobberable*) - (bq-remove-tokens (cadr x))) - ((and (eq (car x) *bq-list**) - (consp (cddr x)) - (null (cdddr x))) - (cons 'cons (maptree #'bq-remove-tokens (cdr x)))) - (t (maptree #'bq-remove-tokens x)))) - -(define-transformation backquote (form) - (bq-completely-process form)) - - -;;; Primitives - -(defvar *builtins* nil) - -(defmacro define-raw-builtin (name args &body body) - ;; Creates a new primitive function `name' with parameters args and - ;; @body. The body can access to the local environment through the - ;; variable *ENVIRONMENT*. - `(push (list ',name (lambda ,args (block ,name ,@body))) - *builtins*)) - -(defmacro define-builtin (name args &body body) - `(define-raw-builtin ,name ,args - (let ,(mapcar (lambda (arg) `(,arg (ls-compile ,arg))) args) - ,@body))) - -;;; DECLS is a list of (JSVARNAME TYPE LISPFORM) declarations. -(defmacro type-check (decls &body body) - `(js!selfcall - ,@(mapcar (lambda (decl) - `(code "var " ,(first decl) " = " ,(third decl) ";" *newline*)) - decls) - ,@(mapcar (lambda (decl) - `(code "if (typeof " ,(first decl) " != '" ,(second decl) "')" *newline* - (indent "throw 'The value ' + " - ,(first decl) - " + ' is not a type " - ,(second decl) - ".';" - *newline*))) - decls) - (code "return " (progn ,@body) ";" *newline*))) - -;;; VARIABLE-ARITY compiles variable arity operations. ARGS stands for -;;; a variable which holds a list of forms. It will compile them and -;;; store the result in some Javascript variables. BODY is evaluated -;;; with ARGS bound to the list of these variables to generate the -;;; code which performs the transformation on these variables. - -(defun variable-arity-call (args function) - (unless (consp args) - (error "ARGS must be a non-empty list")) - (let ((counter 0) - (fargs '()) - (prelude "")) - (dolist (x args) - (if (numberp x) - (push (integer-to-string x) fargs) - (let ((v (code "x" (incf counter)))) - (push v fargs) - (concatf prelude - (code "var " v " = " (ls-compile x) ";" *newline* - "if (typeof " v " !== 'number') throw 'Not a number!';" - *newline*))))) - (js!selfcall prelude (funcall function (reverse fargs))))) - - -(defmacro variable-arity (args &body body) - (unless (symbolp args) - (error "Bad usage of VARIABLE-ARITY, you must pass a symbol")) - `(variable-arity-call ,args - (lambda (,args) - (code "return " ,@body ";" *newline*)))) - -(defun num-op-num (x op y) - (type-check (("x" "number" x) ("y" "number" y)) - (code "x" op "y"))) - -(define-raw-builtin + (&rest numbers) - (if (null numbers) - "0" - (variable-arity numbers - (join numbers "+")))) - -(define-raw-builtin - (x &rest others) - (let ((args (cons x others))) - (variable-arity args - (if (null others) - (concat "-" (car args)) - (join args "-"))))) - -(define-raw-builtin * (&rest numbers) - (if (null numbers) - "1" - (variable-arity numbers - (join numbers "*")))) - -(define-raw-builtin / (x &rest others) - (let ((args (cons x others))) - (variable-arity args - (if (null others) - (concat "1 /" (car args)) - (join args "/"))))) - -(define-builtin mod (x y) (num-op-num x "%" y)) - - -(defun comparison-conjuntion (vars op) - (cond - ((null (cdr vars)) - "true") - ((null (cddr vars)) - (concat (car vars) op (cadr vars))) - (t - (concat (car vars) op (cadr vars) - " && " - (comparison-conjuntion (cdr vars) op))))) - -(defmacro define-builtin-comparison (op sym) - `(define-raw-builtin ,op (x &rest args) - (let ((args (cons x args))) - (variable-arity args - (js!bool (comparison-conjuntion args ,sym)))))) - -(define-builtin-comparison > ">") -(define-builtin-comparison < "<") -(define-builtin-comparison >= ">=") -(define-builtin-comparison <= "<=") -(define-builtin-comparison = "==") - -(define-builtin numberp (x) - (js!bool (code "(typeof (" x ") == \"number\")"))) - -(define-builtin floor (x) - (type-check (("x" "number" x)) - "Math.floor(x)")) - -(define-builtin cons (x y) - (code "({car: " x ", cdr: " y "})")) - -(define-builtin consp (x) - (js!bool - (js!selfcall - "var tmp = " x ";" *newline* - "return (typeof tmp == 'object' && 'car' in tmp);" *newline*))) - -(define-builtin car (x) - (js!selfcall - "var tmp = " x ";" *newline* - "return tmp === " (ls-compile nil) - "? " (ls-compile nil) - ": tmp.car;" *newline*)) - -(define-builtin cdr (x) - (js!selfcall - "var tmp = " x ";" *newline* - "return tmp === " (ls-compile nil) "? " - (ls-compile nil) - ": tmp.cdr;" *newline*)) - -(define-builtin rplaca (x new) - (type-check (("x" "object" x)) - (code "(x.car = " new ", x)"))) - -(define-builtin rplacd (x new) - (type-check (("x" "object" x)) - (code "(x.cdr = " new ", x)"))) - -(define-builtin symbolp (x) - (js!bool - (js!selfcall - "var tmp = " x ";" *newline* - "return (typeof tmp == 'object' && 'name' in tmp);" *newline*))) - -(define-builtin make-symbol (name) - (type-check (("name" "string" name)) - "({name: name})")) - -(define-builtin symbol-name (x) - (code "(" x ").name")) - -(define-builtin set (symbol value) - (code "(" symbol ").value = " value)) - -(define-builtin fset (symbol value) - (code "(" symbol ").fvalue = " value)) - -(define-builtin boundp (x) - (js!bool (code "(" x ".value !== undefined)"))) - -(define-builtin symbol-value (x) - (js!selfcall - "var symbol = " x ";" *newline* - "var value = symbol.value;" *newline* - "if (value === undefined) throw \"Variable `\" + symbol.name + \"' is unbound.\";" *newline* - "return value;" *newline*)) - -(define-builtin symbol-function (x) - (js!selfcall - "var symbol = " x ";" *newline* - "var func = symbol.fvalue;" *newline* - "if (func === undefined) throw \"Function `\" + symbol.name + \"' is undefined.\";" *newline* - "return func;" *newline*)) - -(define-builtin symbol-plist (x) - (code "((" x ").plist || " (ls-compile nil) ")")) - -(define-builtin lambda-code (x) - (code "(" x ").toString()")) - -(define-builtin eq (x y) (js!bool (code "(" x " === " y ")"))) -(define-builtin equal (x y) (js!bool (code "(" x " == " y ")"))) - -(define-builtin char-to-string (x) - (type-check (("x" "number" x)) - "String.fromCharCode(x)")) - -(define-builtin stringp (x) - (js!bool (code "(typeof(" x ") == \"string\")"))) - -(define-builtin string-upcase (x) - (type-check (("x" "string" x)) - "x.toUpperCase()")) - -(define-builtin string-length (x) - (type-check (("x" "string" x)) - "x.length")) - -(define-raw-builtin slice (string a &optional b) - (js!selfcall - "var str = " (ls-compile string) ";" *newline* - "var a = " (ls-compile a) ";" *newline* - "var b;" *newline* - (when b (code "b = " (ls-compile b) ";" *newline*)) - "return str.slice(a,b);" *newline*)) - -(define-builtin char (string index) - (type-check (("string" "string" string) - ("index" "number" index)) - "string.charCodeAt(index)")) - -(define-builtin concat-two (string1 string2) - (type-check (("string1" "string" string1) - ("string2" "string" string2)) - "string1.concat(string2)")) - -(define-raw-builtin funcall (func &rest args) - (js!selfcall - "var f = " (ls-compile func) ";" *newline* - "return (typeof f === 'function'? f: f.fvalue)(" - (join (cons (if *multiple-value-p* "values" "pv") - (mapcar #'ls-compile args)) - ", ") - ")")) - -(define-raw-builtin apply (func &rest args) - (if (null args) - (code "(" (ls-compile func) ")()") - (let ((args (butlast args)) - (last (car (last args)))) - (js!selfcall - "var f = " (ls-compile func) ";" *newline* - "var args = [" (join (cons (if *multiple-value-p* "values" "pv") - (mapcar #'ls-compile args)) - ", ") - "];" *newline* - "var tail = (" (ls-compile last) ");" *newline* - "while (tail != " (ls-compile nil) "){" *newline* - " args.push(tail.car);" *newline* - " tail = tail.cdr;" *newline* - "}" *newline* - "return (typeof f === 'function'? f : f.fvalue).apply(this, args);" *newline*)))) - -(define-builtin js-eval (string) - (type-check (("string" "string" string)) - (if *multiple-value-p* - (js!selfcall - "var v = eval.apply(window, [string]);" *newline* - "if (typeof v !== 'object' || !('multiple-value' in v)){" *newline* - (indent "v = [v];" *newline* - "v['multiple-value'] = true;" *newline*) - "}" *newline* - "return values.apply(this, v);" *newline*) - "eval.apply(window, [string])"))) - -(define-builtin error (string) - (js!selfcall "throw " string ";" *newline*)) - -(define-builtin new () "{}") - -(define-builtin objectp (x) - (js!bool (code "(typeof (" x ") === 'object')"))) - -(define-builtin oget (object key) - (js!selfcall - "var tmp = " "(" object ")[" key "];" *newline* - "return tmp == undefined? " (ls-compile nil) ": tmp ;" *newline*)) - -(define-builtin oset (object key value) - (code "((" object ")[" key "] = " value ")")) - -(define-builtin in (key object) - (js!bool (code "((" key ") in (" object "))"))) - -(define-builtin functionp (x) - (js!bool (code "(typeof " x " == 'function')"))) - -(define-builtin write-string (x) - (type-check (("x" "string" x)) - "lisp.write(x)")) - -(define-builtin make-array (n) - (js!selfcall - "var r = [];" *newline* - "for (var i = 0; i < " n "; i++)" *newline* - (indent "r.push(" (ls-compile nil) ");" *newline*) - "return r;" *newline*)) - -(define-builtin arrayp (x) - (js!bool - (js!selfcall - "var x = " x ";" *newline* - "return typeof x === 'object' && 'length' in x;"))) - -(define-builtin aref (array n) - (js!selfcall - "var x = " "(" array ")[" n "];" *newline* - "if (x === undefined) throw 'Out of range';" *newline* - "return x;" *newline*)) - -(define-builtin aset (array n value) - (js!selfcall - "var x = " array ";" *newline* - "var i = " n ";" *newline* - "if (i < 0 || i >= x.length) throw 'Out of range';" *newline* - "return x[i] = " value ";" *newline*)) - -(define-builtin get-unix-time () - (code "(Math.round(new Date() / 1000))")) - -(define-builtin values-array (array) - (if *multiple-value-p* - (code "values.apply(this, " array ")") - (code "pv.apply(this, " array ")"))) - -(define-raw-builtin values (&rest args) - (if *multiple-value-p* - (code "values(" (join (mapcar #'ls-compile args) ", ") ")") - (code "pv(" (join (mapcar #'ls-compile args) ", ") ")"))) - -;; Receives the JS function as first argument as a literal string. The -;; second argument is compiled and should evaluate to a vector of -;; values to apply to the the function. The result returned. -(define-builtin %js-call (fun args) - (code fun ".apply(this, " args ")")) - -(defun macro (x) - (and (symbolp x) - (let ((b (lookup-in-lexenv x *environment* 'function))) - (if (and b (eq (binding-type b) 'macro)) - b - nil)))) - -#+common-lisp -(defvar *macroexpander-cache* - (make-hash-table :test #'eq)) - -(defun ls-macroexpand-1 (form) - (cond - ((symbolp form) - (let ((b (lookup-in-lexenv form *environment* 'variable))) - (if (and b (eq (binding-type b) 'macro)) - (values (binding-value b) t) - (values form nil)))) - ((consp form) - (let ((macro-binding (macro (car form)))) - (if macro-binding - (let ((expander (binding-value macro-binding))) - (cond - #+common-lisp - ((gethash macro-binding *macroexpander-cache*) - (setq expander (gethash macro-binding *macroexpander-cache*))) - ((listp expander) - (let ((compiled (eval expander))) - ;; The list representation are useful while - ;; bootstrapping, as we can dump the definition of the - ;; macros easily, but they are slow because we have to - ;; evaluate them and compile them now and again. So, let - ;; us replace the list representation version of the - ;; function with the compiled one. - ;; - #+ecmalisp (setf (binding-value macro-binding) compiled) - #+common-lisp (setf (gethash macro-binding *macroexpander-cache*) compiled) - (setq expander compiled)))) - (values (apply expander (cdr form)) t)) - (values form nil)))) - (t - (values form nil)))) - -(defun compile-funcall (function args) - (let* ((values-funcs (if *multiple-value-p* "values" "pv")) - (arglist (concat "(" (join (cons values-funcs (mapcar #'ls-compile args)) ", ") ")"))) - (cond - ((translate-function function) - (concat (translate-function function) arglist)) - ((and (symbolp function) - #+ecmalisp (eq (symbol-package function) (find-package "COMMON-LISP")) - #+common-lisp t) - (code (ls-compile `',function) ".fvalue" arglist)) - (t - (code (ls-compile `#',function) arglist))))) - -(defun ls-compile-block (sexps &optional return-last-p) - (if return-last-p - (code (ls-compile-block (butlast sexps)) - "return " (ls-compile (car (last sexps)) *multiple-value-p*) ";") - (join-trailing - (remove-if #'null-or-empty-p (mapcar #'ls-compile sexps)) - (concat ";" *newline*)))) - -(defun ls-compile (sexp &optional multiple-value-p) - (multiple-value-bind (sexp expandedp) (ls-macroexpand-1 sexp) - (when expandedp - (return-from ls-compile (ls-compile sexp multiple-value-p))) - ;; The expression has been macroexpanded. Now compile it! - (let ((*multiple-value-p* multiple-value-p)) - (cond - ((symbolp sexp) - (let ((b (lookup-in-lexenv sexp *environment* 'variable))) - (cond - ((and b (not (member 'special (binding-declarations b)))) - (binding-value b)) - ((or (keywordp sexp) - (and b (member 'constant (binding-declarations b)))) - (code (ls-compile `',sexp) ".value")) - (t - (ls-compile `(symbol-value ',sexp)))))) - ((integerp sexp) (integer-to-string sexp)) - ((stringp sexp) (code "\"" (escape-string sexp) "\"")) - ((arrayp sexp) (literal sexp)) - ((listp sexp) - (let ((name (car sexp)) - (args (cdr sexp))) - (cond - ;; Special forms - ((assoc name *compilations*) - (let ((comp (second (assoc name *compilations*)))) - (apply comp args))) - ;; Built-in functions - ((and (assoc name *builtins*) - (not (claimp name 'function 'notinline))) - (let ((comp (second (assoc name *builtins*)))) - (apply comp args))) - (t - (compile-funcall name args))))) - (t - (error (concat "How should I compile " (prin1-to-string sexp) "?"))))))) - - -(defvar *compile-print-toplevels* nil) - -(defun truncate-string (string &optional (width 60)) - (let ((n (or (position #\newline string) - (min width (length string))))) - (subseq string 0 n))) - -(defun ls-compile-toplevel (sexp &optional multiple-value-p) - (let ((*toplevel-compilations* nil)) - (cond - ((and (consp sexp) (eq (car sexp) 'progn)) - (let ((subs (mapcar (lambda (s) - (ls-compile-toplevel s t)) - (cdr sexp)))) - (join (remove-if #'null-or-empty-p subs)))) - (t - (when *compile-print-toplevels* - (let ((form-string (prin1-to-string sexp))) - (write-string "Compiling ") - (write-string (truncate-string form-string)) - (write-line "..."))) - - (let ((code (ls-compile sexp multiple-value-p))) - (code (join-trailing (get-toplevel-compilations) - (code ";" *newline*)) - (when code - (code code ";" *newline*)))))))) diff --git a/ecmalisp.lisp b/ecmalisp.lisp index a7aa677..eae3ab6 100644 --- a/ecmalisp.lisp +++ b/ecmalisp.lisp @@ -25,16 +25,22 @@ ("compiler" :both) ("toplevel" :target))) +(defun source-pathname + (filename &key (directory '(:relative "src")) (type nil) (defaults filename)) + (if type + (make-pathname :type type :directory directory :defaults defaults) + (make-pathname :directory directory :defaults defaults))) + ;;; Compile ecmalisp into the host (with-compilation-unit () (dolist (input *source*) (when (member (cadr input) '(:host :both)) - (compile-file (car input))))) + (compile-file (source-pathname (car input)))))) ;;; Load ecmalisp into the host (dolist (input *source*) (when (member (cadr input) '(:host :both)) - (load (car input)))) + (load (source-pathname (car input))))) (defun read-whole-file (filename) (with-open-file (in filename) @@ -63,8 +69,7 @@ *literal-counter* 0 *block-counter* 0) (with-open-file (out "ecmalisp.js" :direction :output :if-exists :supersede) - (write-string (read-whole-file "prelude.js") out) + (write-string (read-whole-file (source-pathname "prelude.js")) out) (dolist (input *source*) (when (member (cadr input) '(:target :both)) - (let ((file (make-pathname :type "lisp" :defaults (car input)))) - (ls-compile-file file out)))))) + (ls-compile-file (source-pathname (car input) :type "lisp") out))))) diff --git a/prelude.js b/prelude.js deleted file mode 100644 index 38a13d7..0000000 --- a/prelude.js +++ /dev/null @@ -1,54 +0,0 @@ -// This file is prepended to the result of compile ecmalisp.lisp, and -// contain runtime code that ecmalisp assumes to exist. - -var window = this; -var nil; - -function globalEval (x) { - return eval.call (window, x); -} - -function pv (x) { return x==undefined? nil: x; } - -function mv(){ - var r = [].slice.call(arguments); - r['multiple-value'] = true; - return r; -} - -function forcemv (x) { - return typeof x == 'object' && 'multiple-value' in x? x: mv(x); -} - -// NOTE: Define VALUES to be MV for toplevel forms. It is because -// `eval' compiles the forms and execute the Javascript code at -// toplevel with `js-eval', so it is necessary to return multiple -// values from the eval function. -var values = mv; - -function checkArgsAtLeast(args, n){ - if (args.length < n) throw 'too few arguments'; -} - -function checkArgsAtMost(args, n){ - if (args.length > n) throw 'too many arguments'; -} - -function checkArgs(args, n){ - checkArgsAtLeast(args, n); - checkArgsAtMost(args, n); -} - -// Improper list constructor (like LIST*) -function QIList(){ - if (arguments.length == 1) - return arguments[0]; - else { - var i = arguments.length-1; - var r = arguments[i--]; - for (; i>=0; i--){ - r = {car: arguments[i], cdr: r}; - } - return r; - } -} diff --git a/print.lisp b/print.lisp deleted file mode 100644 index 9d36936..0000000 --- a/print.lisp +++ /dev/null @@ -1,70 +0,0 @@ -;;; print.lisp --- - -;; Copyright (C) 2012, 2013 David Vazquez -;; Copyright (C) 2012 Raimon Grau - -;; 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 . - -;;; Printer - -(defun prin1-to-string (form) - (cond - ((symbolp form) - (multiple-value-bind (symbol foundp) - (find-symbol (symbol-name form) *package*) - (if (and foundp (eq symbol form)) - (symbol-name form) - (let ((package (symbol-package form)) - (name (symbol-name form))) - (concat (cond - ((null package) "#") - ((eq package (find-package "KEYWORD")) "") - (t (package-name package))) - ":" name))))) - ((integerp form) (integer-to-string form)) - ((stringp form) (concat "\"" (escape-string form) "\"")) - ((functionp form) - (let ((name (oget form "fname"))) - (if name - (concat "#") - (concat "#")))) - ((listp form) - (concat "(" - (join-trailing (mapcar #'prin1-to-string (butlast form)) " ") - (let ((last (last form))) - (if (null (cdr last)) - (prin1-to-string (car last)) - (concat (prin1-to-string (car last)) " . " (prin1-to-string (cdr last))))) - ")")) - ((arrayp form) - (concat "#" (if (zerop (length form)) - "()" - (prin1-to-string (vector-to-list form))))) - ((packagep form) - (concat "#")) - (t - (concat "#")))) - -(defun write-line (x) - (write-string x) - (write-string *newline*) - x) - -(defun warn (string) - (write-string "WARNING: ") - (write-line string)) - -(defun print (x) - (write-line (prin1-to-string x)) - x) diff --git a/read.lisp b/read.lisp deleted file mode 100644 index bbd2586..0000000 --- a/read.lisp +++ /dev/null @@ -1,243 +0,0 @@ -;;; read.lisp --- - -;; Copyright (C) 2012, 2013 David Vazquez -;; Copyright (C) 2012 Raimon Grau - -;; 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 . - - -;;;; Reader - -;;; The Lisp reader, parse strings and return Lisp objects. The main -;;; entry points are `ls-read' and `ls-read-from-string'. - -(defun make-string-stream (string) - (cons string 0)) - -(defun %peek-char (stream) - (and (< (cdr stream) (length (car stream))) - (char (car stream) (cdr stream)))) - -(defun %read-char (stream) - (and (< (cdr stream) (length (car stream))) - (prog1 (char (car stream) (cdr stream)) - (rplacd stream (1+ (cdr stream)))))) - -(defun whitespacep (ch) - (or (char= ch #\space) (char= ch #\newline) (char= ch #\tab))) - -(defun skip-whitespaces (stream) - (let (ch) - (setq ch (%peek-char stream)) - (while (and ch (whitespacep ch)) - (%read-char stream) - (setq ch (%peek-char stream))))) - -(defun terminalp (ch) - (or (null ch) (whitespacep ch) (char= #\) ch) (char= #\( ch))) - -(defun read-until (stream func) - (let ((string "") - (ch)) - (setq ch (%peek-char stream)) - (while (and ch (not (funcall func ch))) - (setq string (concat string (string ch))) - (%read-char stream) - (setq ch (%peek-char stream))) - string)) - -(defun skip-whitespaces-and-comments (stream) - (let (ch) - (skip-whitespaces stream) - (setq ch (%peek-char stream)) - (while (and ch (char= ch #\;)) - (read-until stream (lambda (x) (char= x #\newline))) - (skip-whitespaces stream) - (setq ch (%peek-char stream))))) - -(defun %read-list (stream) - (skip-whitespaces-and-comments stream) - (let ((ch (%peek-char stream))) - (cond - ((null ch) - (error "Unspected EOF")) - ((char= ch #\)) - (%read-char stream) - nil) - ((char= ch #\.) - (%read-char stream) - (prog1 (ls-read stream) - (skip-whitespaces-and-comments stream) - (unless (char= (%read-char stream) #\)) - (error "')' was expected.")))) - (t - (cons (ls-read stream) (%read-list stream)))))) - -(defun read-string (stream) - (let ((string "") - (ch nil)) - (setq ch (%read-char stream)) - (while (not (eql ch #\")) - (when (null ch) - (error "Unexpected EOF")) - (when (eql ch #\\) - (setq ch (%read-char stream))) - (setq string (concat string (string ch))) - (setq ch (%read-char stream))) - string)) - -(defun read-sharp (stream) - (%read-char stream) - (ecase (%read-char stream) - (#\' - (list 'function (ls-read stream))) - (#\( (list-to-vector (%read-list stream))) - (#\: (make-symbol (string-upcase (read-until stream #'terminalp)))) - (#\\ - (let ((cname - (concat (string (%read-char stream)) - (read-until stream #'terminalp)))) - (cond - ((string= cname "space") (char-code #\space)) - ((string= cname "tab") (char-code #\tab)) - ((string= cname "newline") (char-code #\newline)) - (t (char-code (char cname 0)))))) - (#\+ - (let ((feature (read-until stream #'terminalp))) - (cond - ((string= feature "common-lisp") - (ls-read stream) ;ignore - (ls-read stream)) - ((string= feature "ecmalisp") - (ls-read stream)) - (t - (error "Unknown reader form."))))))) - -;;; Parse a string of the form NAME, PACKAGE:NAME or -;;; PACKAGE::NAME and return the name. If the string is of the -;;; form 1) or 3), but the symbol does not exist, it will be created -;;; and interned in that package. -(defun read-symbol (string) - (let ((size (length string)) - package name internalp index) - (setq index 0) - (while (and (< index size) - (not (char= (char string index) #\:))) - (incf index)) - (cond - ;; No package prefix - ((= index size) - (setq name string) - (setq package *package*) - (setq internalp t)) - (t - ;; Package prefix - (if (zerop index) - (setq package "KEYWORD") - (setq package (string-upcase (subseq string 0 index)))) - (incf index) - (when (char= (char string index) #\:) - (setq internalp t) - (incf index)) - (setq name (subseq string index)))) - ;; Canonalize symbol name and package - (when (not (eq package "JS")) - (setq name (string-upcase name))) - (setq package (find-package package)) - ;; TODO: PACKAGE:SYMBOL should signal error if SYMBOL is not an - ;; external symbol from PACKAGE. - (if (or internalp - (eq package (find-package "KEYWORD")) - (eq package (find-package "JS"))) - (intern name package) - (find-symbol name package)))) - - -(defun !parse-integer (string junk-allow) - (block nil - (let ((value 0) - (index 0) - (size (length string)) - (sign 1)) - ;; Leading whitespace - (while (and (< index size) - (whitespacep (char string index))) - (incf index)) - (unless (< index size) (return (values nil 0))) - ;; Optional sign - (case (char string 0) - (#\+ (incf index)) - (#\- (setq sign -1) - (incf index))) - ;; First digit - (unless (and (< index size) - (setq value (digit-char-p (char string index)))) - (return (values nil index))) - (incf index) - ;; Other digits - (while (< index size) - (let ((digit (digit-char-p (char string index)))) - (unless digit (return)) - (setq value (+ (* value 10) digit)) - (incf index))) - ;; Trailing whitespace - (do ((i index (1+ i))) - ((or (= i size) (not (whitespacep (char string i)))) - (and (= i size) (setq index i)))) - (if (or junk-allow - (= index size)) - (values (* sign value) index) - (values nil index))))) - -#+ecmalisp -(defun parse-integer (string &key junk-allowed) - (multiple-value-bind (num index) - (!parse-integer string junk-allowed) - (when num - (values num index) - (error "junk detected.")))) - -(defvar *eof* (gensym)) -(defun ls-read (stream) - (skip-whitespaces-and-comments stream) - (let ((ch (%peek-char stream))) - (cond - ((or (null ch) (char= ch #\))) - *eof*) - ((char= ch #\() - (%read-char stream) - (%read-list stream)) - ((char= ch #\') - (%read-char stream) - (list 'quote (ls-read stream))) - ((char= ch #\`) - (%read-char stream) - (list 'backquote (ls-read stream))) - ((char= ch #\") - (%read-char stream) - (read-string stream)) - ((char= ch #\,) - (%read-char stream) - (if (eql (%peek-char stream) #\@) - (progn (%read-char stream) (list 'unquote-splicing (ls-read stream))) - (list 'unquote (ls-read stream)))) - ((char= ch #\#) - (read-sharp stream)) - (t - (let ((string (read-until stream #'terminalp))) - (or (values (!parse-integer string nil)) - (read-symbol string))))))) - -(defun ls-read-from-string (string) - (ls-read (make-string-stream string))) diff --git a/src/boot.lisp b/src/boot.lisp new file mode 100644 index 0000000..3454c65 --- /dev/null +++ b/src/boot.lisp @@ -0,0 +1,855 @@ +;;; boot.lisp --- First forms to be cross compiled + +;; Copyright (C) 2012, 2013 David Vazquez +;; Copyright (C) 2012 Raimon Grau + +;; 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 . + +;;; This code is executed when ecmalisp compiles this file +;;; itself. The compiler provides compilation of some special forms, +;;; as well as funcalls and macroexpansion, but no functions. So, we +;;; define the Lisp world from scratch. This code has to define enough +;;; language to the compiler to be able to run. + +(eval-when-compile + (%compile-defmacro 'defmacro + '(function + (lambda (name args &rest body) + `(eval-when-compile + (%compile-defmacro ',name + '(function + (lambda ,(mapcar #'(lambda (x) + (if (eq x '&body) + '&rest + x)) + args) + ,@body)))))))) + +(defmacro declaim (&rest decls) + `(eval-when-compile + ,@(mapcar (lambda (decl) `(!proclaim ',decl)) decls))) + +(defmacro defconstant (name value &optional docstring) + `(progn + (declaim (special ,name)) + (declaim (constant ,name)) + (setq ,name ,value) + ,@(when (stringp docstring) `((oset ',name "vardoc" ,docstring))) + ',name)) + +(defconstant t 't) +(defconstant nil 'nil) +(%js-vset "nil" nil) + +(defmacro lambda (args &body body) + `(function (lambda ,args ,@body))) + +(defmacro when (condition &body body) + `(if ,condition (progn ,@body) nil)) + +(defmacro unless (condition &body body) + `(if ,condition nil (progn ,@body))) + +(defmacro defvar (name value &optional docstring) + `(progn + (declaim (special ,name)) + (unless (boundp ',name) (setq ,name ,value)) + ,@(when (stringp docstring) `((oset ',name "vardoc" ,docstring))) + ',name)) + +(defmacro defparameter (name value &optional docstring) + `(progn + (setq ,name ,value) + ,@(when (stringp docstring) `((oset ',name "vardoc" ,docstring))) + ',name)) + +(defmacro named-lambda (name args &rest body) + (let ((x (gensym "FN"))) + `(let ((,x (lambda ,args ,@body))) + (oset ,x "fname" ,name) + ,x))) + +(defmacro defun (name args &rest body) + `(progn + (fset ',name + (named-lambda ,(symbol-name name) ,args + ,@(if (and (stringp (car body)) (not (null (cdr body)))) + `(,(car body) (block ,name ,@(cdr body))) + `((block ,name ,@body))))) + ',name)) + +(defun null (x) + (eq x nil)) + +(defun endp (x) + (if (null x) + t + (if (consp x) + nil + (error "type-error")))) + +(defmacro return (&optional value) + `(return-from nil ,value)) + +(defmacro while (condition &body body) + `(block nil (%while ,condition ,@body))) + +(defvar *gensym-counter* 0) +(defun gensym (&optional (prefix "G")) + (setq *gensym-counter* (+ *gensym-counter* 1)) + (make-symbol (concat-two prefix (integer-to-string *gensym-counter*)))) + +(defun boundp (x) + (boundp x)) + +;; Basic functions +(defun = (x y) (= x y)) +(defun * (x y) (* x y)) +(defun / (x y) (/ x y)) +(defun 1+ (x) (+ x 1)) +(defun 1- (x) (- x 1)) +(defun zerop (x) (= x 0)) +(defun truncate (x y) (floor (/ x y))) + +(defun eql (x y) (eq x y)) + +(defun not (x) (if x nil t)) + +(defun cons (x y ) (cons x y)) +(defun consp (x) (consp x)) + +(defun car (x) + "Return the CAR part of a cons, or NIL if X is null." + (car x)) + +(defun cdr (x) (cdr x)) +(defun caar (x) (car (car x))) +(defun cadr (x) (car (cdr x))) +(defun cdar (x) (cdr (car x))) +(defun cddr (x) (cdr (cdr x))) +(defun cadar (x) (car (cdr (car x)))) +(defun caddr (x) (car (cdr (cdr x)))) +(defun cdddr (x) (cdr (cdr (cdr x)))) +(defun cadddr (x) (car (cdr (cdr (cdr x))))) +(defun first (x) (car x)) +(defun second (x) (cadr x)) +(defun third (x) (caddr x)) +(defun fourth (x) (cadddr x)) +(defun rest (x) (cdr x)) + +(defun list (&rest args) args) +(defun atom (x) + (not (consp x))) + +;; Basic macros + +(defmacro incf (x &optional (delta 1)) + `(setq ,x (+ ,x ,delta))) + +(defmacro decf (x &optional (delta 1)) + `(setq ,x (- ,x ,delta))) + +(defmacro push (x place) + (multiple-value-bind (dummies vals newval setter getter) + (get-setf-expansion place) + (let ((g (gensym))) + `(let* ((,g ,x) + ,@(mapcar #'list dummies vals) + (,(car newval) (cons ,g ,getter)) + ,@(cdr newval)) + ,setter)))) + +(defmacro dolist (iter &body body) + (let ((var (first iter)) + (g!list (gensym))) + `(block nil + (let ((,g!list ,(second iter)) + (,var nil)) + (%while ,g!list + (setq ,var (car ,g!list)) + (tagbody ,@body) + (setq ,g!list (cdr ,g!list))) + ,(third iter))))) + +(defmacro dotimes (iter &body body) + (let ((g!to (gensym)) + (var (first iter)) + (to (second iter)) + (result (third iter))) + `(block nil + (let ((,var 0) + (,g!to ,to)) + (%while (< ,var ,g!to) + (tagbody ,@body) + (incf ,var)) + ,result)))) + +(defmacro cond (&rest clausules) + (if (null clausules) + nil + (if (eq (caar clausules) t) + `(progn ,@(cdar clausules)) + `(if ,(caar clausules) + (progn ,@(cdar clausules)) + (cond ,@(cdr clausules)))))) + +(defmacro case (form &rest clausules) + (let ((!form (gensym))) + `(let ((,!form ,form)) + (cond + ,@(mapcar (lambda (clausule) + (if (eq (car clausule) t) + clausule + `((eql ,!form ',(car clausule)) + ,@(cdr clausule)))) + clausules))))) + +(defmacro ecase (form &rest clausules) + `(case ,form + ,@(append + clausules + `((t + (error "ECASE expression failed.")))))) + +(defmacro and (&rest forms) + (cond + ((null forms) + t) + ((null (cdr forms)) + (car forms)) + (t + `(if ,(car forms) + (and ,@(cdr forms)) + nil)))) + +(defmacro or (&rest forms) + (cond + ((null forms) + nil) + ((null (cdr forms)) + (car forms)) + (t + (let ((g (gensym))) + `(let ((,g ,(car forms))) + (if ,g ,g (or ,@(cdr forms)))))))) + +(defmacro prog1 (form &body body) + (let ((value (gensym))) + `(let ((,value ,form)) + ,@body + ,value))) + +(defmacro prog2 (form1 result &body body) + `(prog1 (progn ,form1 ,result) ,@body)) + + + +;;; Go on growing the Lisp language in Ecmalisp, with more high level +;;; utilities as well as correct versions of other constructions. + +(defun + (&rest args) + (let ((r 0)) + (dolist (x args r) + (incf r x)))) + +(defun - (x &rest others) + (if (null others) + (- x) + (let ((r x)) + (dolist (y others r) + (decf r y))))) + +(defun append-two (list1 list2) + (if (null list1) + list2 + (cons (car list1) + (append (cdr list1) list2)))) + +(defun append (&rest lists) + (!reduce #'append-two lists)) + +(defun revappend (list1 list2) + (while list1 + (push (car list1) list2) + (setq list1 (cdr list1))) + list2) + +(defun reverse (list) + (revappend list '())) + +(defmacro psetq (&rest pairs) + (let (;; For each pair, we store here a list of the form + ;; (VARIABLE GENSYM VALUE). + (assignments '())) + (while t + (cond + ((null pairs) (return)) + ((null (cdr pairs)) + (error "Odd paris in PSETQ")) + (t + (let ((variable (car pairs)) + (value (cadr pairs))) + (push `(,variable ,(gensym) ,value) assignments) + (setq pairs (cddr pairs)))))) + (setq assignments (reverse assignments)) + ;; + `(let ,(mapcar #'cdr assignments) + (setq ,@(!reduce #'append (mapcar #'butlast assignments)))))) + +(defmacro do (varlist endlist &body body) + `(block nil + (let ,(mapcar (lambda (x) (list (first x) (second x))) varlist) + (while t + (when ,(car endlist) + (return (progn ,@(cdr endlist)))) + (tagbody ,@body) + (psetq + ,@(apply #'append + (mapcar (lambda (v) + (and (consp (cddr v)) + (list (first v) (third v)))) + varlist))))))) + +(defmacro do* (varlist endlist &body body) + `(block nil + (let* ,(mapcar (lambda (x) (list (first x) (second x))) varlist) + (while t + (when ,(car endlist) + (return (progn ,@(cdr endlist)))) + (tagbody ,@body) + (setq + ,@(apply #'append + (mapcar (lambda (v) + (and (consp (cddr v)) + (list (first v) (third v)))) + varlist))))))) + +(defun list-length (list) + (let ((l 0)) + (while (not (null list)) + (incf l) + (setq list (cdr list))) + l)) + +(defun length (seq) + (cond + ((stringp seq) + (string-length seq)) + ((arrayp seq) + (oget seq "length")) + ((listp seq) + (list-length seq)))) + +(defun concat-two (s1 s2) + (concat-two s1 s2)) + +(defmacro with-collect (&body body) + (let ((head (gensym)) + (tail (gensym))) + `(let* ((,head (cons 'sentinel nil)) + (,tail ,head)) + (flet ((collect (x) + (rplacd ,tail (cons x nil)) + (setq ,tail (cdr ,tail)) + x)) + ,@body) + (cdr ,head)))) + +(defun map1 (func list) + (with-collect + (while list + (collect (funcall func (car list))) + (setq list (cdr list))))) + +(defmacro loop (&body body) + `(while t ,@body)) + +(defun mapcar (func list &rest lists) + (let ((lists (cons list lists))) + (with-collect + (block loop + (loop + (let ((elems (map1 #'car lists))) + (do ((tail lists (cdr tail))) + ((null tail)) + (when (null (car tail)) (return-from loop)) + (rplaca tail (cdar tail))) + (collect (apply func elems)))))))) + +(defun identity (x) x) + +(defun constantly (x) + (lambda (&rest args) + x)) + +(defun copy-list (x) + (mapcar #'identity x)) + +(defun list* (arg &rest others) + (cond ((null others) arg) + ((null (cdr others)) (cons arg (car others))) + (t (do ((x others (cdr x))) + ((null (cddr x)) (rplacd x (cadr x)))) + (cons arg others)))) + +(defun code-char (x) x) +(defun char-code (x) x) +(defun char= (x y) (= x y)) + +(defun integerp (x) + (and (numberp x) (= (floor x) x))) + +(defun plusp (x) (< 0 x)) +(defun minusp (x) (< x 0)) + +(defun listp (x) + (or (consp x) (null x))) + +(defun nthcdr (n list) + (while (and (plusp n) list) + (setq n (1- n)) + (setq list (cdr list))) + list) + +(defun nth (n list) + (car (nthcdr n list))) + +(defun last (x) + (while (consp (cdr x)) + (setq x (cdr x))) + x) + +(defun butlast (x) + (and (consp (cdr x)) + (cons (car x) (butlast (cdr x))))) + +(defun member (x list) + (while list + (when (eql x (car list)) + (return list)) + (setq list (cdr list)))) + +(defun find (item list &key key (test #'eql)) + (dolist (x list) + (when (funcall test (funcall key x) item) + (return x)))) + +(defun remove (x list) + (cond + ((null list) + nil) + ((eql x (car list)) + (remove x (cdr list))) + (t + (cons (car list) (remove x (cdr list)))))) + +(defun remove-if (func list) + (cond + ((null list) + nil) + ((funcall func (car list)) + (remove-if func (cdr list))) + (t + ;; + (cons (car list) (remove-if func (cdr list)))))) + +(defun remove-if-not (func list) + (cond + ((null list) + nil) + ((funcall func (car list)) + (cons (car list) (remove-if-not func (cdr list)))) + (t + (remove-if-not func (cdr list))))) + +(defun digit-char-p (x) + (if (and (<= #\0 x) (<= x #\9)) + (- x #\0) + nil)) + +(defun digit-char (weight) + (and (<= 0 weight 9) + (char "0123456789" weight))) + +(defun subseq (seq a &optional b) + (cond + ((stringp seq) + (if b + (slice seq a b) + (slice seq a))) + (t + (error "Unsupported argument.")))) + +(defmacro do-sequence (iteration &body body) + (let ((seq (gensym)) + (index (gensym))) + `(let ((,seq ,(second iteration))) + (cond + ;; Strings + ((stringp ,seq) + (let ((,index 0)) + (dotimes (,index (length ,seq)) + (let ((,(first iteration) + (char ,seq ,index))) + ,@body)))) + ;; Lists + ((listp ,seq) + (dolist (,(first iteration) ,seq) + ,@body)) + (t + (error "type-error!")))))) + +(defun some (function seq) + (do-sequence (elt seq) + (when (funcall function elt) + (return-from some t)))) + +(defun every (function seq) + (do-sequence (elt seq) + (unless (funcall function elt) + (return-from every nil))) + t) + +(defun position (elt sequence) + (let ((pos 0)) + (do-sequence (x seq) + (when (eq elt x) + (return)) + (incf pos)) + pos)) + +(defun assoc (x alist) + (while alist + (if (eql x (caar alist)) + (return) + (setq alist (cdr alist)))) + (car alist)) + +(defun string (x) + (cond ((stringp x) x) + ((symbolp x) (symbol-name x)) + (t (char-to-string x)))) + +(defun string= (s1 s2) + (equal s1 s2)) + +(defun fdefinition (x) + (cond + ((functionp x) + x) + ((symbolp x) + (symbol-function x)) + (t + (error "Invalid function")))) + +(defun disassemble (function) + (write-line (lambda-code (fdefinition function))) + nil) + +(defun documentation (x type) + "Return the documentation of X. TYPE must be the symbol VARIABLE or FUNCTION." + (ecase type + (function + (let ((func (fdefinition x))) + (oget func "docstring"))) + (variable + (unless (symbolp x) + (error "Wrong argument type! it should be a symbol")) + (oget x "vardoc")))) + +(defmacro multiple-value-bind (variables value-from &body body) + `(multiple-value-call (lambda (&optional ,@variables &rest ,(gensym)) + ,@body) + ,value-from)) + +(defmacro multiple-value-list (value-from) + `(multiple-value-call #'list ,value-from)) + + +;;; Generalized references (SETF) + +(defvar *setf-expanders* nil) + +(defun get-setf-expansion (place) + (if (symbolp place) + (let ((value (gensym))) + (values nil + nil + `(,value) + `(setq ,place ,value) + place)) + (let ((place (ls-macroexpand-1 place))) + (let* ((access-fn (car place)) + (expander (cdr (assoc access-fn *setf-expanders*)))) + (when (null expander) + (error "Unknown generalized reference.")) + (apply expander (cdr place)))))) + +(defmacro define-setf-expander (access-fn lambda-list &body body) + (unless (symbolp access-fn) + (error "ACCESS-FN must be a symbol.")) + `(progn (push (cons ',access-fn (lambda ,lambda-list ,@body)) + *setf-expanders*) + ',access-fn)) + +(defmacro setf (&rest pairs) + (cond + ((null pairs) + nil) + ((null (cdr pairs)) + (error "Odd number of arguments to setf.")) + ((null (cddr pairs)) + (let ((place (ls-macroexpand-1 (first pairs))) + (value (second pairs))) + (multiple-value-bind (vars vals store-vars writer-form reader-form) + (get-setf-expansion place) + ;; TODO: Optimize the expansion a little bit to avoid let* + ;; or multiple-value-bind when unnecesary. + `(let* ,(mapcar #'list vars vals) + (multiple-value-bind ,store-vars + ,value + ,writer-form))))) + (t + `(progn + ,@(do ((pairs pairs (cddr pairs)) + (result '() (cons `(setf ,(car pairs) ,(cadr pairs)) result))) + ((null pairs) + (reverse result))))))) + +(define-setf-expander car (x) + (let ((cons (gensym)) + (new-value (gensym))) + (values (list cons) + (list x) + (list new-value) + `(progn (rplaca ,cons ,new-value) ,new-value) + `(car ,cons)))) + +(define-setf-expander cdr (x) + (let ((cons (gensym)) + (new-value (gensym))) + (values (list cons) + (list x) + (list new-value) + `(progn (rplacd ,cons ,new-value) ,new-value) + `(car ,cons)))) + +;; Incorrect typecase, but used in NCONC. +(defmacro typecase (x &rest clausules) + (let ((value (gensym))) + `(let ((,value ,x)) + (cond + ,@(mapcar (lambda (c) + (if (eq (car c) t) + `((t ,@(rest c))) + `((,(ecase (car c) + (integer 'integerp) + (cons 'consp) + (string 'stringp) + (atom 'atom) + (null 'null)) + ,value) + ,@(or (rest c) + (list nil))))) + clausules))))) + +;; The NCONC function is based on the SBCL's one. +(defun nconc (&rest lists) + (flet ((fail (object) + (error "type-error in nconc"))) + (do ((top lists (cdr top))) + ((null top) nil) + (let ((top-of-top (car top))) + (typecase top-of-top + (cons + (let* ((result top-of-top) + (splice result)) + (do ((elements (cdr top) (cdr elements))) + ((endp elements)) + (let ((ele (car elements))) + (typecase ele + (cons (rplacd (last splice) ele) + (setf splice ele)) + (null (rplacd (last splice) nil)) + (atom (if (cdr elements) + (fail ele) + (rplacd (last splice) ele)))))) + (return result))) + (null) + (atom + (if (cdr top) + (fail top-of-top) + (return top-of-top)))))))) + +(defun nreconc (x y) + (do ((1st (cdr x) (if (endp 1st) 1st (cdr 1st))) + (2nd x 1st) ; 2nd follows first down the list. + (3rd y 2nd)) ;3rd follows 2nd down the list. + ((atom 2nd) 3rd) + (rplacd 2nd 3rd))) + +(defun notany (fn seq) + (not (some fn seq))) + + +;; Packages + +(defvar *package-list* nil) + +(defun list-all-packages () + *package-list*) + +(defun make-package (name &key use) + (let ((package (new)) + (use (mapcar #'find-package-or-fail use))) + (oset package "packageName" name) + (oset package "symbols" (new)) + (oset package "exports" (new)) + (oset package "use" use) + (push package *package-list*) + package)) + +(defun packagep (x) + (and (objectp x) (in "symbols" x))) + +(defun find-package (package-designator) + (when (packagep package-designator) + (return-from find-package package-designator)) + (let ((name (string package-designator))) + (dolist (package *package-list*) + (when (string= (package-name package) name) + (return package))))) + +(defun find-package-or-fail (package-designator) + (or (find-package package-designator) + (error "Package unknown."))) + +(defun package-name (package-designator) + (let ((package (find-package-or-fail package-designator))) + (oget package "packageName"))) + +(defun %package-symbols (package-designator) + (let ((package (find-package-or-fail package-designator))) + (oget package "symbols"))) + +(defun package-use-list (package-designator) + (let ((package (find-package-or-fail package-designator))) + (oget package "use"))) + +(defun %package-external-symbols (package-designator) + (let ((package (find-package-or-fail package-designator))) + (oget package "exports"))) + +(defvar *common-lisp-package* + (make-package "CL")) + +(defvar *js-package* + (make-package "JS")) + +(defvar *user-package* + (make-package "CL-USER" :use (list *common-lisp-package*))) + +(defvar *keyword-package* + (make-package "KEYWORD")) + +(defun keywordp (x) + (and (symbolp x) (eq (symbol-package x) *keyword-package*))) + +(defvar *package* *common-lisp-package*) + +(defmacro in-package (package-designator) + `(eval-when-compile + (setq *package* (find-package-or-fail ,package-designator)))) + +;; This function is used internally to initialize the CL package +;; with the symbols built during bootstrap. +(defun %intern-symbol (symbol) + (let* ((package + (if (in "package" symbol) + (find-package-or-fail (oget symbol "package")) + *common-lisp-package*)) + (symbols (%package-symbols package))) + (oset symbol "package" package) + (when (eq package *keyword-package*) + (oset symbol "value" symbol)) + (oset symbols (symbol-name symbol) symbol))) + +(defun find-symbol (name &optional (package *package*)) + (let* ((package (find-package-or-fail package)) + (externals (%package-external-symbols package)) + (symbols (%package-symbols package))) + (cond + ((in name externals) + (values (oget externals name) :external)) + ((in name symbols) + (values (oget symbols name) :internal)) + (t + (dolist (used (package-use-list package) (values nil nil)) + (let ((exports (%package-external-symbols used))) + (when (in name exports) + (return (values (oget exports name) :inherit))))))))) + +(defun intern (name &optional (package *package*)) + (let ((package (find-package-or-fail package))) + (multiple-value-bind (symbol foundp) + (find-symbol name package) + (if foundp + (values symbol foundp) + (let ((symbols (%package-symbols package))) + (oget symbols name) + (let ((symbol (make-symbol name))) + (oset symbol "package" package) + (when (eq package *keyword-package*) + (oset symbol "value" symbol) + (export (list symbol) package)) + (when (eq package *js-package*) + (let ((sym-name (symbol-name symbol)) + (args (gensym))) + ;; Generate a trampoline to call the JS function + ;; properly. This trampoline is very inefficient, + ;; but it still works. Ideas to optimize this are + ;; provide a special lambda keyword + ;; cl::&rest-vector to avoid list argument + ;; consing, as well as allow inline declarations. + (fset symbol + (eval `(lambda (&rest ,args) + (let ((,args (list-to-vector ,args))) + (%js-call (%js-vref ,sym-name) ,args))))) + ;; Define it as a symbol macro to access to the + ;; Javascript variable literally. + (%define-symbol-macro symbol `(%js-vref ,(string symbol))))) + (oset symbols name symbol) + (values symbol nil))))))) + +(defun symbol-package (symbol) + (unless (symbolp symbol) + (error "it is not a symbol")) + (oget symbol "package")) + +(defun export (symbols &optional (package *package*)) + (let ((exports (%package-external-symbols package))) + (dolist (symb symbols t) + (oset exports (symbol-name symb) symb)))) + +(defun get-universal-time () + (+ (get-unix-time) 2208988800)) + +(defun concat (&rest strs) + (!reduce #'concat-two strs :initial-value "")) + +(defun values-list (list) + (values-array (list-to-vector list))) + +(defun values (&rest args) + (values-list args)) diff --git a/src/compat.lisp b/src/compat.lisp new file mode 100644 index 0000000..184c5dd --- /dev/null +++ b/src/compat.lisp @@ -0,0 +1,49 @@ +;;; compat.lisp --- Create some definitions to fix CL compatibility + +;; Copyright (C) 2012, 2013 David Vazquez +;; Copyright (C) 2012 Raimon Grau + +;; 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 . + +;;; Duplicate from boot.lisp by now +(defmacro with-collect (&body body) + (let ((head (gensym)) + (tail (gensym))) + `(let* ((,head (cons 'sentinel nil)) + (,tail ,head)) + (flet ((collect (x) + (rplacd ,tail (cons x nil)) + (setq ,tail (cdr ,tail)) + x)) + ,@body) + (cdr ,head)))) + +(defmacro while (condition &body body) + `(do () + ((not ,condition)) + ,@body)) + +(defmacro eval-when-compile (&body body) + `(eval-when (:compile-toplevel :load-toplevel :execute) + ,@body)) + +(defun concat-two (s1 s2) + (concatenate 'string s1 s2)) + +(defun aset (array idx value) + (setf (aref array idx) value)) + +(eval-when-compile + (defun concat (&rest strs) + (apply #'concatenate 'string strs))) diff --git a/src/compiler.lisp b/src/compiler.lisp new file mode 100644 index 0000000..24c85ab --- /dev/null +++ b/src/compiler.lisp @@ -0,0 +1,1675 @@ +;;; compiler.lisp --- + +;; Copyright (C) 2012, 2013 David Vazquez +;; Copyright (C) 2012 Raimon Grau + +;; 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 . + +;;;; Compiler + +;;; Translate the Lisp code to Javascript. It will compile the special +;;; forms. Some primitive functions are compiled as special forms +;;; too. The respective real functions are defined in the target (see +;;; the beginning of this file) as well as some primitive functions. + +(defun code (&rest args) + (mapconcat (lambda (arg) + (cond + ((null arg) "") + ((integerp arg) (integer-to-string arg)) + ((stringp arg) arg) + (t (error "Unknown argument.")))) + args)) + +;;; Wrap X with a Javascript code to convert the result from +;;; Javascript generalized booleans to T or NIL. +(defun js!bool (x) + (code "(" x "?" (ls-compile t) ": " (ls-compile nil) ")")) + +;;; Concatenate the arguments and wrap them with a self-calling +;;; Javascript anonymous function. It is used to make some Javascript +;;; statements valid expressions and provide a private scope as well. +;;; It could be defined as function, but we could do some +;;; preprocessing in the future. +(defmacro js!selfcall (&body body) + `(code "(function(){" *newline* (indent ,@body) "})()")) + +;;; Like CODE, but prefix each line with four spaces. Two versions +;;; of this function are available, because the Ecmalisp version is +;;; very slow and bootstraping was annoying. + +#+ecmalisp +(defun indent (&rest string) + (let ((input (apply #'code string))) + (let ((output "") + (index 0) + (size (length input))) + (when (plusp (length input)) (concatf output " ")) + (while (< index size) + (let ((str + (if (and (char= (char input index) #\newline) + (< index (1- size)) + (not (char= (char input (1+ index)) #\newline))) + (concat (string #\newline) " ") + (string (char input index))))) + (concatf output str)) + (incf index)) + output))) + +#+common-lisp +(defun indent (&rest string) + (with-output-to-string (*standard-output*) + (with-input-from-string (input (apply #'code string)) + (loop + for line = (read-line input nil) + while line + do (write-string " ") + do (write-line line))))) + + +;;; A Form can return a multiple values object calling VALUES, like +;;; values(arg1, arg2, ...). It will work in any context, as well as +;;; returning an individual object. However, if the special variable +;;; `*multiple-value-p*' is NIL, is granted that only the primary +;;; value will be used, so we can optimize to avoid the VALUES +;;; function call. +(defvar *multiple-value-p* nil) + +;; A very simple defstruct built on lists. It supports just slot with +;; an optional default initform, and it will create a constructor, +;; predicate and accessors for you. +(defmacro def!struct (name &rest slots) + (unless (symbolp name) + (error "It is not a full defstruct implementation.")) + (let* ((name-string (symbol-name name)) + (slot-descriptions + (mapcar (lambda (sd) + (cond + ((symbolp sd) + (list sd)) + ((and (listp sd) (car sd) (cddr sd)) + sd) + (t + (error "Bad slot accessor.")))) + slots)) + (predicate (intern (concat name-string "-P")))) + `(progn + ;; Constructor + (defun ,(intern (concat "MAKE-" name-string)) (&key ,@slot-descriptions) + (list ',name ,@(mapcar #'car slot-descriptions))) + ;; Predicate + (defun ,predicate (x) + (and (consp x) (eq (car x) ',name))) + ;; Copier + (defun ,(intern (concat "COPY-" name-string)) (x) + (copy-list x)) + ;; Slot accessors + ,@(with-collect + (let ((index 1)) + (dolist (slot slot-descriptions) + (let* ((name (car slot)) + (accessor-name (intern (concat name-string "-" (string name))))) + (collect + `(defun ,accessor-name (x) + (unless (,predicate x) + (error ,(concat "The object is not a type " name-string))) + (nth ,index x))) + ;; TODO: Implement this with a higher level + ;; abstraction like defsetf or (defun (setf ..)) + (collect + `(define-setf-expander ,accessor-name (x) + (let ((object (gensym)) + (new-value (gensym))) + (values (list object) + (list x) + (list new-value) + `(progn + (rplaca (nthcdr ,',index ,object) ,new-value) + ,new-value) + `(,',accessor-name ,object))))) + (incf index))))) + ',name))) + + +;;; Environment + +(def!struct binding + name + type + value + declarations) + +(def!struct lexenv + variable + function + block + gotag) + +(defun lookup-in-lexenv (name lexenv namespace) + (find name (ecase namespace + (variable (lexenv-variable lexenv)) + (function (lexenv-function lexenv)) + (block (lexenv-block lexenv)) + (gotag (lexenv-gotag lexenv))) + :key #'binding-name)) + +(defun push-to-lexenv (binding lexenv namespace) + (ecase namespace + (variable (push binding (lexenv-variable lexenv))) + (function (push binding (lexenv-function lexenv))) + (block (push binding (lexenv-block lexenv))) + (gotag (push binding (lexenv-gotag lexenv))))) + +(defun extend-lexenv (bindings lexenv namespace) + (let ((env (copy-lexenv lexenv))) + (dolist (binding (reverse bindings) env) + (push-to-lexenv binding env namespace)))) + + +(defvar *environment* (make-lexenv)) + +(defvar *variable-counter* 0) + +(defun gvarname (symbol) + (code "v" (incf *variable-counter*))) + +(defun translate-variable (symbol) + (awhen (lookup-in-lexenv symbol *environment* 'variable) + (binding-value it))) + +(defun extend-local-env (args) + (let ((new (copy-lexenv *environment*))) + (dolist (symbol args new) + (let ((b (make-binding :name symbol :type 'variable :value (gvarname symbol)))) + (push-to-lexenv b new 'variable))))) + +;;; Toplevel compilations +(defvar *toplevel-compilations* nil) + +(defun toplevel-compilation (string) + (push string *toplevel-compilations*)) + +(defun null-or-empty-p (x) + (zerop (length x))) + +(defun get-toplevel-compilations () + (reverse (remove-if #'null-or-empty-p *toplevel-compilations*))) + +(defun %compile-defmacro (name lambda) + (toplevel-compilation (ls-compile `',name)) + (let ((binding (make-binding :name name :type 'macro :value lambda))) + (push-to-lexenv binding *environment* 'function)) + name) + +(defun global-binding (name type namespace) + (or (lookup-in-lexenv name *environment* namespace) + (let ((b (make-binding :name name :type type :value nil))) + (push-to-lexenv b *environment* namespace) + b))) + +(defun claimp (symbol namespace claim) + (let ((b (lookup-in-lexenv symbol *environment* namespace))) + (and b (member claim (binding-declarations b))))) + +(defun !proclaim (decl) + (case (car decl) + (special + (dolist (name (cdr decl)) + (let ((b (global-binding name 'variable 'variable))) + (push 'special (binding-declarations b))))) + (notinline + (dolist (name (cdr decl)) + (let ((b (global-binding name 'function 'function))) + (push 'notinline (binding-declarations b))))) + (constant + (dolist (name (cdr decl)) + (let ((b (global-binding name 'variable 'variable))) + (push 'constant (binding-declarations b))))))) + +#+ecmalisp +(fset 'proclaim #'!proclaim) + +(defun %define-symbol-macro (name expansion) + (let ((b (make-binding :name name :type 'macro :value expansion))) + (push-to-lexenv b *environment* 'variable) + name)) + +#+ecmalisp +(defmacro define-symbol-macro (name expansion) + `(%define-symbol-macro ',name ',expansion)) + + +;;; Special forms + +(defvar *compilations* nil) + +(defmacro define-compilation (name args &body body) + ;; Creates a new primitive `name' with parameters args and + ;; @body. The body can access to the local environment through the + ;; variable *ENVIRONMENT*. + `(push (list ',name (lambda ,args (block ,name ,@body))) + *compilations*)) + +(define-compilation if (condition true false) + (code "(" (ls-compile condition) " !== " (ls-compile nil) + " ? " (ls-compile true *multiple-value-p*) + " : " (ls-compile false *multiple-value-p*) + ")")) + +(defvar *ll-keywords* '(&optional &rest &key)) + +(defun list-until-keyword (list) + (if (or (null list) (member (car list) *ll-keywords*)) + nil + (cons (car list) (list-until-keyword (cdr list))))) + +(defun ll-section (keyword ll) + (list-until-keyword (cdr (member keyword ll)))) + +(defun ll-required-arguments (ll) + (list-until-keyword ll)) + +(defun ll-optional-arguments-canonical (ll) + (mapcar #'ensure-list (ll-section '&optional ll))) + +(defun ll-optional-arguments (ll) + (mapcar #'car (ll-optional-arguments-canonical ll))) + +(defun ll-rest-argument (ll) + (let ((rest (ll-section '&rest ll))) + (when (cdr rest) + (error "Bad lambda-list")) + (car rest))) + +(defun ll-keyword-arguments-canonical (ll) + (flet ((canonicalize (keyarg) + ;; Build a canonical keyword argument descriptor, filling + ;; the optional fields. The result is a list of the form + ;; ((keyword-name var) init-form). + (let ((arg (ensure-list keyarg))) + (cons (if (listp (car arg)) + (car arg) + (list (intern (symbol-name (car arg)) "KEYWORD") (car arg))) + (cdr arg))))) + (mapcar #'canonicalize (ll-section '&key ll)))) + +(defun ll-keyword-arguments (ll) + (mapcar (lambda (keyarg) (second (first keyarg))) + (ll-keyword-arguments-canonical ll))) + +(defun ll-svars (lambda-list) + (let ((args + (append + (ll-keyword-arguments-canonical lambda-list) + (ll-optional-arguments-canonical lambda-list)))) + (remove nil (mapcar #'third args)))) + +(defun lambda-docstring-wrapper (docstring &rest strs) + (if docstring + (js!selfcall + "var func = " (join strs) ";" *newline* + "func.docstring = '" docstring "';" *newline* + "return func;" *newline*) + (apply #'code strs))) + +(defun lambda-check-argument-count + (n-required-arguments n-optional-arguments rest-p) + ;; Note: Remember that we assume that the number of arguments of a + ;; call is at least 1 (the values argument). + (let ((min (1+ n-required-arguments)) + (max (if rest-p 'n/a (+ 1 n-required-arguments n-optional-arguments)))) + (block nil + ;; Special case: a positive exact number of arguments. + (when (and (< 1 min) (eql min max)) + (return (code "checkArgs(arguments, " min ");" *newline*))) + ;; General case: + (code + (when (< 1 min) + (code "checkArgsAtLeast(arguments, " min ");" *newline*)) + (when (numberp max) + (code "checkArgsAtMost(arguments, " max ");" *newline*)))))) + +(defun compile-lambda-optional (ll) + (let* ((optional-arguments (ll-optional-arguments-canonical ll)) + (n-required-arguments (length (ll-required-arguments ll))) + (n-optional-arguments (length optional-arguments))) + (when optional-arguments + (code (mapconcat (lambda (arg) + (code "var " (translate-variable (first arg)) "; " *newline* + (when (third arg) + (code "var " (translate-variable (third arg)) + " = " (ls-compile t) + "; " *newline*)))) + optional-arguments) + "switch(arguments.length-1){" *newline* + (let ((cases nil) + (idx 0)) + (progn + (while (< idx n-optional-arguments) + (let ((arg (nth idx optional-arguments))) + (push (code "case " (+ idx n-required-arguments) ":" *newline* + (indent (translate-variable (car arg)) + "=" + (ls-compile (cadr arg)) ";" *newline*) + (when (third arg) + (indent (translate-variable (third arg)) + "=" + (ls-compile nil) + ";" *newline*))) + cases) + (incf idx))) + (push (code "default: break;" *newline*) cases) + (join (reverse cases)))) + "}" *newline*)))) + +(defun compile-lambda-rest (ll) + (let ((n-required-arguments (length (ll-required-arguments ll))) + (n-optional-arguments (length (ll-optional-arguments ll))) + (rest-argument (ll-rest-argument ll))) + (when rest-argument + (let ((js!rest (translate-variable rest-argument))) + (code "var " js!rest "= " (ls-compile nil) ";" *newline* + "for (var i = arguments.length-1; i>=" + (+ 1 n-required-arguments n-optional-arguments) + "; i--)" *newline* + (indent js!rest " = {car: arguments[i], cdr: ") js!rest "};" + *newline*))))) + +(defun compile-lambda-parse-keywords (ll) + (let ((n-required-arguments + (length (ll-required-arguments ll))) + (n-optional-arguments + (length (ll-optional-arguments ll))) + (keyword-arguments + (ll-keyword-arguments-canonical ll))) + (code + ;; Declare variables + (mapconcat (lambda (arg) + (let ((var (second (car arg)))) + (code "var " (translate-variable var) "; " *newline* + (when (third arg) + (code "var " (translate-variable (third arg)) + " = " (ls-compile nil) + ";" *newline*))))) + keyword-arguments) + ;; Parse keywords + (flet ((parse-keyword (keyarg) + ;; ((keyword-name var) init-form) + (code "for (i=" (+ 1 n-required-arguments n-optional-arguments) + "; i (LIST* a b c foo) +;;; provided a, b, c are not splicing frobs +;;; (APPEND (LIST* a b c) foo) => (LIST* a b (APPEND c foo)) +;;; provided a, b, c are not splicing frobs +;;; (APPEND (QUOTE (x)) foo) => (LIST* (QUOTE x) foo) +;;; (APPEND (CLOBBERABLE x) foo) => (NCONC x foo) +(defun bq-simplify (x) + (if (atom x) + x + (let ((x (if (eq (car x) *bq-quote*) + x + (maptree #'bq-simplify x)))) + (if (not (eq (car x) *bq-append*)) + x + (bq-simplify-args x))))) + +(defun bq-simplify-args (x) + (do ((args (reverse (cdr x)) (cdr args)) + (result + nil + (cond ((atom (car args)) + (bq-attach-append *bq-append* (car args) result)) + ((and (eq (caar args) *bq-list*) + (notany #'bq-splicing-frob (cdar args))) + (bq-attach-conses (cdar args) result)) + ((and (eq (caar args) *bq-list**) + (notany #'bq-splicing-frob (cdar args))) + (bq-attach-conses + (reverse (cdr (reverse (cdar args)))) + (bq-attach-append *bq-append* + (car (last (car args))) + result))) + ((and (eq (caar args) *bq-quote*) + (consp (cadar args)) + (not (bq-frob (cadar args))) + (null (cddar args))) + (bq-attach-conses (list (list *bq-quote* + (caadar args))) + result)) + ((eq (caar args) *bq-clobberable*) + (bq-attach-append *bq-nconc* (cadar args) result)) + (t (bq-attach-append *bq-append* + (car args) + result))))) + ((null args) result))) + +(defun null-or-quoted (x) + (or (null x) (and (consp x) (eq (car x) *bq-quote*)))) + +;;; When BQ-ATTACH-APPEND is called, the OP should be #:BQ-APPEND +;;; or #:BQ-NCONC. This produces a form (op item result) but +;;; some simplifications are done on the fly: +;;; +;;; (op '(a b c) '(d e f g)) => '(a b c d e f g) +;;; (op item 'nil) => item, provided item is not a splicable frob +;;; (op item 'nil) => (op item), if item is a splicable frob +;;; (op item (op a b c)) => (op item a b c) +(defun bq-attach-append (op item result) + (cond ((and (null-or-quoted item) (null-or-quoted result)) + (list *bq-quote* (append (cadr item) (cadr result)))) + ((or (null result) (equal result *bq-quote-nil*)) + (if (bq-splicing-frob item) (list op item) item)) + ((and (consp result) (eq (car result) op)) + (list* (car result) item (cdr result))) + (t (list op item result)))) + +;;; The effect of BQ-ATTACH-CONSES is to produce a form as if by +;;; `(LIST* ,@items ,result) but some simplifications are done +;;; on the fly. +;;; +;;; (LIST* 'a 'b 'c 'd) => '(a b c . d) +;;; (LIST* a b c 'nil) => (LIST a b c) +;;; (LIST* a b c (LIST* d e f g)) => (LIST* a b c d e f g) +;;; (LIST* a b c (LIST d e f g)) => (LIST a b c d e f g) +(defun bq-attach-conses (items result) + (cond ((and (every #'null-or-quoted items) + (null-or-quoted result)) + (list *bq-quote* + (append (mapcar #'cadr items) (cadr result)))) + ((or (null result) (equal result *bq-quote-nil*)) + (cons *bq-list* items)) + ((and (consp result) + (or (eq (car result) *bq-list*) + (eq (car result) *bq-list**))) + (cons (car result) (append items (cdr result)))) + (t (cons *bq-list** (append items (list result)))))) + +;;; Removes funny tokens and changes (#:BQ-LIST* a b) into +;;; (CONS a b) instead of (LIST* a b), purely for readability. +(defun bq-remove-tokens (x) + (cond ((eq x *bq-list*) 'list) + ((eq x *bq-append*) 'append) + ((eq x *bq-nconc*) 'nconc) + ((eq x *bq-list**) 'list*) + ((eq x *bq-quote*) 'quote) + ((atom x) x) + ((eq (car x) *bq-clobberable*) + (bq-remove-tokens (cadr x))) + ((and (eq (car x) *bq-list**) + (consp (cddr x)) + (null (cdddr x))) + (cons 'cons (maptree #'bq-remove-tokens (cdr x)))) + (t (maptree #'bq-remove-tokens x)))) + +(define-transformation backquote (form) + (bq-completely-process form)) + + +;;; Primitives + +(defvar *builtins* nil) + +(defmacro define-raw-builtin (name args &body body) + ;; Creates a new primitive function `name' with parameters args and + ;; @body. The body can access to the local environment through the + ;; variable *ENVIRONMENT*. + `(push (list ',name (lambda ,args (block ,name ,@body))) + *builtins*)) + +(defmacro define-builtin (name args &body body) + `(define-raw-builtin ,name ,args + (let ,(mapcar (lambda (arg) `(,arg (ls-compile ,arg))) args) + ,@body))) + +;;; DECLS is a list of (JSVARNAME TYPE LISPFORM) declarations. +(defmacro type-check (decls &body body) + `(js!selfcall + ,@(mapcar (lambda (decl) + `(code "var " ,(first decl) " = " ,(third decl) ";" *newline*)) + decls) + ,@(mapcar (lambda (decl) + `(code "if (typeof " ,(first decl) " != '" ,(second decl) "')" *newline* + (indent "throw 'The value ' + " + ,(first decl) + " + ' is not a type " + ,(second decl) + ".';" + *newline*))) + decls) + (code "return " (progn ,@body) ";" *newline*))) + +;;; VARIABLE-ARITY compiles variable arity operations. ARGS stands for +;;; a variable which holds a list of forms. It will compile them and +;;; store the result in some Javascript variables. BODY is evaluated +;;; with ARGS bound to the list of these variables to generate the +;;; code which performs the transformation on these variables. + +(defun variable-arity-call (args function) + (unless (consp args) + (error "ARGS must be a non-empty list")) + (let ((counter 0) + (fargs '()) + (prelude "")) + (dolist (x args) + (if (numberp x) + (push (integer-to-string x) fargs) + (let ((v (code "x" (incf counter)))) + (push v fargs) + (concatf prelude + (code "var " v " = " (ls-compile x) ";" *newline* + "if (typeof " v " !== 'number') throw 'Not a number!';" + *newline*))))) + (js!selfcall prelude (funcall function (reverse fargs))))) + + +(defmacro variable-arity (args &body body) + (unless (symbolp args) + (error "Bad usage of VARIABLE-ARITY, you must pass a symbol")) + `(variable-arity-call ,args + (lambda (,args) + (code "return " ,@body ";" *newline*)))) + +(defun num-op-num (x op y) + (type-check (("x" "number" x) ("y" "number" y)) + (code "x" op "y"))) + +(define-raw-builtin + (&rest numbers) + (if (null numbers) + "0" + (variable-arity numbers + (join numbers "+")))) + +(define-raw-builtin - (x &rest others) + (let ((args (cons x others))) + (variable-arity args + (if (null others) + (concat "-" (car args)) + (join args "-"))))) + +(define-raw-builtin * (&rest numbers) + (if (null numbers) + "1" + (variable-arity numbers + (join numbers "*")))) + +(define-raw-builtin / (x &rest others) + (let ((args (cons x others))) + (variable-arity args + (if (null others) + (concat "1 /" (car args)) + (join args "/"))))) + +(define-builtin mod (x y) (num-op-num x "%" y)) + + +(defun comparison-conjuntion (vars op) + (cond + ((null (cdr vars)) + "true") + ((null (cddr vars)) + (concat (car vars) op (cadr vars))) + (t + (concat (car vars) op (cadr vars) + " && " + (comparison-conjuntion (cdr vars) op))))) + +(defmacro define-builtin-comparison (op sym) + `(define-raw-builtin ,op (x &rest args) + (let ((args (cons x args))) + (variable-arity args + (js!bool (comparison-conjuntion args ,sym)))))) + +(define-builtin-comparison > ">") +(define-builtin-comparison < "<") +(define-builtin-comparison >= ">=") +(define-builtin-comparison <= "<=") +(define-builtin-comparison = "==") + +(define-builtin numberp (x) + (js!bool (code "(typeof (" x ") == \"number\")"))) + +(define-builtin floor (x) + (type-check (("x" "number" x)) + "Math.floor(x)")) + +(define-builtin cons (x y) + (code "({car: " x ", cdr: " y "})")) + +(define-builtin consp (x) + (js!bool + (js!selfcall + "var tmp = " x ";" *newline* + "return (typeof tmp == 'object' && 'car' in tmp);" *newline*))) + +(define-builtin car (x) + (js!selfcall + "var tmp = " x ";" *newline* + "return tmp === " (ls-compile nil) + "? " (ls-compile nil) + ": tmp.car;" *newline*)) + +(define-builtin cdr (x) + (js!selfcall + "var tmp = " x ";" *newline* + "return tmp === " (ls-compile nil) "? " + (ls-compile nil) + ": tmp.cdr;" *newline*)) + +(define-builtin rplaca (x new) + (type-check (("x" "object" x)) + (code "(x.car = " new ", x)"))) + +(define-builtin rplacd (x new) + (type-check (("x" "object" x)) + (code "(x.cdr = " new ", x)"))) + +(define-builtin symbolp (x) + (js!bool + (js!selfcall + "var tmp = " x ";" *newline* + "return (typeof tmp == 'object' && 'name' in tmp);" *newline*))) + +(define-builtin make-symbol (name) + (type-check (("name" "string" name)) + "({name: name})")) + +(define-builtin symbol-name (x) + (code "(" x ").name")) + +(define-builtin set (symbol value) + (code "(" symbol ").value = " value)) + +(define-builtin fset (symbol value) + (code "(" symbol ").fvalue = " value)) + +(define-builtin boundp (x) + (js!bool (code "(" x ".value !== undefined)"))) + +(define-builtin symbol-value (x) + (js!selfcall + "var symbol = " x ";" *newline* + "var value = symbol.value;" *newline* + "if (value === undefined) throw \"Variable `\" + symbol.name + \"' is unbound.\";" *newline* + "return value;" *newline*)) + +(define-builtin symbol-function (x) + (js!selfcall + "var symbol = " x ";" *newline* + "var func = symbol.fvalue;" *newline* + "if (func === undefined) throw \"Function `\" + symbol.name + \"' is undefined.\";" *newline* + "return func;" *newline*)) + +(define-builtin symbol-plist (x) + (code "((" x ").plist || " (ls-compile nil) ")")) + +(define-builtin lambda-code (x) + (code "(" x ").toString()")) + +(define-builtin eq (x y) (js!bool (code "(" x " === " y ")"))) +(define-builtin equal (x y) (js!bool (code "(" x " == " y ")"))) + +(define-builtin char-to-string (x) + (type-check (("x" "number" x)) + "String.fromCharCode(x)")) + +(define-builtin stringp (x) + (js!bool (code "(typeof(" x ") == \"string\")"))) + +(define-builtin string-upcase (x) + (type-check (("x" "string" x)) + "x.toUpperCase()")) + +(define-builtin string-length (x) + (type-check (("x" "string" x)) + "x.length")) + +(define-raw-builtin slice (string a &optional b) + (js!selfcall + "var str = " (ls-compile string) ";" *newline* + "var a = " (ls-compile a) ";" *newline* + "var b;" *newline* + (when b (code "b = " (ls-compile b) ";" *newline*)) + "return str.slice(a,b);" *newline*)) + +(define-builtin char (string index) + (type-check (("string" "string" string) + ("index" "number" index)) + "string.charCodeAt(index)")) + +(define-builtin concat-two (string1 string2) + (type-check (("string1" "string" string1) + ("string2" "string" string2)) + "string1.concat(string2)")) + +(define-raw-builtin funcall (func &rest args) + (js!selfcall + "var f = " (ls-compile func) ";" *newline* + "return (typeof f === 'function'? f: f.fvalue)(" + (join (cons (if *multiple-value-p* "values" "pv") + (mapcar #'ls-compile args)) + ", ") + ")")) + +(define-raw-builtin apply (func &rest args) + (if (null args) + (code "(" (ls-compile func) ")()") + (let ((args (butlast args)) + (last (car (last args)))) + (js!selfcall + "var f = " (ls-compile func) ";" *newline* + "var args = [" (join (cons (if *multiple-value-p* "values" "pv") + (mapcar #'ls-compile args)) + ", ") + "];" *newline* + "var tail = (" (ls-compile last) ");" *newline* + "while (tail != " (ls-compile nil) "){" *newline* + " args.push(tail.car);" *newline* + " tail = tail.cdr;" *newline* + "}" *newline* + "return (typeof f === 'function'? f : f.fvalue).apply(this, args);" *newline*)))) + +(define-builtin js-eval (string) + (type-check (("string" "string" string)) + (if *multiple-value-p* + (js!selfcall + "var v = eval.apply(window, [string]);" *newline* + "if (typeof v !== 'object' || !('multiple-value' in v)){" *newline* + (indent "v = [v];" *newline* + "v['multiple-value'] = true;" *newline*) + "}" *newline* + "return values.apply(this, v);" *newline*) + "eval.apply(window, [string])"))) + +(define-builtin error (string) + (js!selfcall "throw " string ";" *newline*)) + +(define-builtin new () "{}") + +(define-builtin objectp (x) + (js!bool (code "(typeof (" x ") === 'object')"))) + +(define-builtin oget (object key) + (js!selfcall + "var tmp = " "(" object ")[" key "];" *newline* + "return tmp == undefined? " (ls-compile nil) ": tmp ;" *newline*)) + +(define-builtin oset (object key value) + (code "((" object ")[" key "] = " value ")")) + +(define-builtin in (key object) + (js!bool (code "((" key ") in (" object "))"))) + +(define-builtin functionp (x) + (js!bool (code "(typeof " x " == 'function')"))) + +(define-builtin write-string (x) + (type-check (("x" "string" x)) + "lisp.write(x)")) + +(define-builtin make-array (n) + (js!selfcall + "var r = [];" *newline* + "for (var i = 0; i < " n "; i++)" *newline* + (indent "r.push(" (ls-compile nil) ");" *newline*) + "return r;" *newline*)) + +(define-builtin arrayp (x) + (js!bool + (js!selfcall + "var x = " x ";" *newline* + "return typeof x === 'object' && 'length' in x;"))) + +(define-builtin aref (array n) + (js!selfcall + "var x = " "(" array ")[" n "];" *newline* + "if (x === undefined) throw 'Out of range';" *newline* + "return x;" *newline*)) + +(define-builtin aset (array n value) + (js!selfcall + "var x = " array ";" *newline* + "var i = " n ";" *newline* + "if (i < 0 || i >= x.length) throw 'Out of range';" *newline* + "return x[i] = " value ";" *newline*)) + +(define-builtin get-unix-time () + (code "(Math.round(new Date() / 1000))")) + +(define-builtin values-array (array) + (if *multiple-value-p* + (code "values.apply(this, " array ")") + (code "pv.apply(this, " array ")"))) + +(define-raw-builtin values (&rest args) + (if *multiple-value-p* + (code "values(" (join (mapcar #'ls-compile args) ", ") ")") + (code "pv(" (join (mapcar #'ls-compile args) ", ") ")"))) + +;; Receives the JS function as first argument as a literal string. The +;; second argument is compiled and should evaluate to a vector of +;; values to apply to the the function. The result returned. +(define-builtin %js-call (fun args) + (code fun ".apply(this, " args ")")) + +(defun macro (x) + (and (symbolp x) + (let ((b (lookup-in-lexenv x *environment* 'function))) + (if (and b (eq (binding-type b) 'macro)) + b + nil)))) + +#+common-lisp +(defvar *macroexpander-cache* + (make-hash-table :test #'eq)) + +(defun ls-macroexpand-1 (form) + (cond + ((symbolp form) + (let ((b (lookup-in-lexenv form *environment* 'variable))) + (if (and b (eq (binding-type b) 'macro)) + (values (binding-value b) t) + (values form nil)))) + ((consp form) + (let ((macro-binding (macro (car form)))) + (if macro-binding + (let ((expander (binding-value macro-binding))) + (cond + #+common-lisp + ((gethash macro-binding *macroexpander-cache*) + (setq expander (gethash macro-binding *macroexpander-cache*))) + ((listp expander) + (let ((compiled (eval expander))) + ;; The list representation are useful while + ;; bootstrapping, as we can dump the definition of the + ;; macros easily, but they are slow because we have to + ;; evaluate them and compile them now and again. So, let + ;; us replace the list representation version of the + ;; function with the compiled one. + ;; + #+ecmalisp (setf (binding-value macro-binding) compiled) + #+common-lisp (setf (gethash macro-binding *macroexpander-cache*) compiled) + (setq expander compiled)))) + (values (apply expander (cdr form)) t)) + (values form nil)))) + (t + (values form nil)))) + +(defun compile-funcall (function args) + (let* ((values-funcs (if *multiple-value-p* "values" "pv")) + (arglist (concat "(" (join (cons values-funcs (mapcar #'ls-compile args)) ", ") ")"))) + (cond + ((translate-function function) + (concat (translate-function function) arglist)) + ((and (symbolp function) + #+ecmalisp (eq (symbol-package function) (find-package "COMMON-LISP")) + #+common-lisp t) + (code (ls-compile `',function) ".fvalue" arglist)) + (t + (code (ls-compile `#',function) arglist))))) + +(defun ls-compile-block (sexps &optional return-last-p) + (if return-last-p + (code (ls-compile-block (butlast sexps)) + "return " (ls-compile (car (last sexps)) *multiple-value-p*) ";") + (join-trailing + (remove-if #'null-or-empty-p (mapcar #'ls-compile sexps)) + (concat ";" *newline*)))) + +(defun ls-compile (sexp &optional multiple-value-p) + (multiple-value-bind (sexp expandedp) (ls-macroexpand-1 sexp) + (when expandedp + (return-from ls-compile (ls-compile sexp multiple-value-p))) + ;; The expression has been macroexpanded. Now compile it! + (let ((*multiple-value-p* multiple-value-p)) + (cond + ((symbolp sexp) + (let ((b (lookup-in-lexenv sexp *environment* 'variable))) + (cond + ((and b (not (member 'special (binding-declarations b)))) + (binding-value b)) + ((or (keywordp sexp) + (and b (member 'constant (binding-declarations b)))) + (code (ls-compile `',sexp) ".value")) + (t + (ls-compile `(symbol-value ',sexp)))))) + ((integerp sexp) (integer-to-string sexp)) + ((stringp sexp) (code "\"" (escape-string sexp) "\"")) + ((arrayp sexp) (literal sexp)) + ((listp sexp) + (let ((name (car sexp)) + (args (cdr sexp))) + (cond + ;; Special forms + ((assoc name *compilations*) + (let ((comp (second (assoc name *compilations*)))) + (apply comp args))) + ;; Built-in functions + ((and (assoc name *builtins*) + (not (claimp name 'function 'notinline))) + (let ((comp (second (assoc name *builtins*)))) + (apply comp args))) + (t + (compile-funcall name args))))) + (t + (error (concat "How should I compile " (prin1-to-string sexp) "?"))))))) + + +(defvar *compile-print-toplevels* nil) + +(defun truncate-string (string &optional (width 60)) + (let ((n (or (position #\newline string) + (min width (length string))))) + (subseq string 0 n))) + +(defun ls-compile-toplevel (sexp &optional multiple-value-p) + (let ((*toplevel-compilations* nil)) + (cond + ((and (consp sexp) (eq (car sexp) 'progn)) + (let ((subs (mapcar (lambda (s) + (ls-compile-toplevel s t)) + (cdr sexp)))) + (join (remove-if #'null-or-empty-p subs)))) + (t + (when *compile-print-toplevels* + (let ((form-string (prin1-to-string sexp))) + (write-string "Compiling ") + (write-string (truncate-string form-string)) + (write-line "..."))) + + (let ((code (ls-compile sexp multiple-value-p))) + (code (join-trailing (get-toplevel-compilations) + (code ";" *newline*)) + (when code + (code code ";" *newline*)))))))) diff --git a/src/prelude.js b/src/prelude.js new file mode 100644 index 0000000..38a13d7 --- /dev/null +++ b/src/prelude.js @@ -0,0 +1,54 @@ +// This file is prepended to the result of compile ecmalisp.lisp, and +// contain runtime code that ecmalisp assumes to exist. + +var window = this; +var nil; + +function globalEval (x) { + return eval.call (window, x); +} + +function pv (x) { return x==undefined? nil: x; } + +function mv(){ + var r = [].slice.call(arguments); + r['multiple-value'] = true; + return r; +} + +function forcemv (x) { + return typeof x == 'object' && 'multiple-value' in x? x: mv(x); +} + +// NOTE: Define VALUES to be MV for toplevel forms. It is because +// `eval' compiles the forms and execute the Javascript code at +// toplevel with `js-eval', so it is necessary to return multiple +// values from the eval function. +var values = mv; + +function checkArgsAtLeast(args, n){ + if (args.length < n) throw 'too few arguments'; +} + +function checkArgsAtMost(args, n){ + if (args.length > n) throw 'too many arguments'; +} + +function checkArgs(args, n){ + checkArgsAtLeast(args, n); + checkArgsAtMost(args, n); +} + +// Improper list constructor (like LIST*) +function QIList(){ + if (arguments.length == 1) + return arguments[0]; + else { + var i = arguments.length-1; + var r = arguments[i--]; + for (; i>=0; i--){ + r = {car: arguments[i], cdr: r}; + } + return r; + } +} diff --git a/src/print.lisp b/src/print.lisp new file mode 100644 index 0000000..9d36936 --- /dev/null +++ b/src/print.lisp @@ -0,0 +1,70 @@ +;;; print.lisp --- + +;; Copyright (C) 2012, 2013 David Vazquez +;; Copyright (C) 2012 Raimon Grau + +;; 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 . + +;;; Printer + +(defun prin1-to-string (form) + (cond + ((symbolp form) + (multiple-value-bind (symbol foundp) + (find-symbol (symbol-name form) *package*) + (if (and foundp (eq symbol form)) + (symbol-name form) + (let ((package (symbol-package form)) + (name (symbol-name form))) + (concat (cond + ((null package) "#") + ((eq package (find-package "KEYWORD")) "") + (t (package-name package))) + ":" name))))) + ((integerp form) (integer-to-string form)) + ((stringp form) (concat "\"" (escape-string form) "\"")) + ((functionp form) + (let ((name (oget form "fname"))) + (if name + (concat "#") + (concat "#")))) + ((listp form) + (concat "(" + (join-trailing (mapcar #'prin1-to-string (butlast form)) " ") + (let ((last (last form))) + (if (null (cdr last)) + (prin1-to-string (car last)) + (concat (prin1-to-string (car last)) " . " (prin1-to-string (cdr last))))) + ")")) + ((arrayp form) + (concat "#" (if (zerop (length form)) + "()" + (prin1-to-string (vector-to-list form))))) + ((packagep form) + (concat "#")) + (t + (concat "#")))) + +(defun write-line (x) + (write-string x) + (write-string *newline*) + x) + +(defun warn (string) + (write-string "WARNING: ") + (write-line string)) + +(defun print (x) + (write-line (prin1-to-string x)) + x) diff --git a/src/read.lisp b/src/read.lisp new file mode 100644 index 0000000..bbd2586 --- /dev/null +++ b/src/read.lisp @@ -0,0 +1,243 @@ +;;; read.lisp --- + +;; Copyright (C) 2012, 2013 David Vazquez +;; Copyright (C) 2012 Raimon Grau + +;; 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 . + + +;;;; Reader + +;;; The Lisp reader, parse strings and return Lisp objects. The main +;;; entry points are `ls-read' and `ls-read-from-string'. + +(defun make-string-stream (string) + (cons string 0)) + +(defun %peek-char (stream) + (and (< (cdr stream) (length (car stream))) + (char (car stream) (cdr stream)))) + +(defun %read-char (stream) + (and (< (cdr stream) (length (car stream))) + (prog1 (char (car stream) (cdr stream)) + (rplacd stream (1+ (cdr stream)))))) + +(defun whitespacep (ch) + (or (char= ch #\space) (char= ch #\newline) (char= ch #\tab))) + +(defun skip-whitespaces (stream) + (let (ch) + (setq ch (%peek-char stream)) + (while (and ch (whitespacep ch)) + (%read-char stream) + (setq ch (%peek-char stream))))) + +(defun terminalp (ch) + (or (null ch) (whitespacep ch) (char= #\) ch) (char= #\( ch))) + +(defun read-until (stream func) + (let ((string "") + (ch)) + (setq ch (%peek-char stream)) + (while (and ch (not (funcall func ch))) + (setq string (concat string (string ch))) + (%read-char stream) + (setq ch (%peek-char stream))) + string)) + +(defun skip-whitespaces-and-comments (stream) + (let (ch) + (skip-whitespaces stream) + (setq ch (%peek-char stream)) + (while (and ch (char= ch #\;)) + (read-until stream (lambda (x) (char= x #\newline))) + (skip-whitespaces stream) + (setq ch (%peek-char stream))))) + +(defun %read-list (stream) + (skip-whitespaces-and-comments stream) + (let ((ch (%peek-char stream))) + (cond + ((null ch) + (error "Unspected EOF")) + ((char= ch #\)) + (%read-char stream) + nil) + ((char= ch #\.) + (%read-char stream) + (prog1 (ls-read stream) + (skip-whitespaces-and-comments stream) + (unless (char= (%read-char stream) #\)) + (error "')' was expected.")))) + (t + (cons (ls-read stream) (%read-list stream)))))) + +(defun read-string (stream) + (let ((string "") + (ch nil)) + (setq ch (%read-char stream)) + (while (not (eql ch #\")) + (when (null ch) + (error "Unexpected EOF")) + (when (eql ch #\\) + (setq ch (%read-char stream))) + (setq string (concat string (string ch))) + (setq ch (%read-char stream))) + string)) + +(defun read-sharp (stream) + (%read-char stream) + (ecase (%read-char stream) + (#\' + (list 'function (ls-read stream))) + (#\( (list-to-vector (%read-list stream))) + (#\: (make-symbol (string-upcase (read-until stream #'terminalp)))) + (#\\ + (let ((cname + (concat (string (%read-char stream)) + (read-until stream #'terminalp)))) + (cond + ((string= cname "space") (char-code #\space)) + ((string= cname "tab") (char-code #\tab)) + ((string= cname "newline") (char-code #\newline)) + (t (char-code (char cname 0)))))) + (#\+ + (let ((feature (read-until stream #'terminalp))) + (cond + ((string= feature "common-lisp") + (ls-read stream) ;ignore + (ls-read stream)) + ((string= feature "ecmalisp") + (ls-read stream)) + (t + (error "Unknown reader form."))))))) + +;;; Parse a string of the form NAME, PACKAGE:NAME or +;;; PACKAGE::NAME and return the name. If the string is of the +;;; form 1) or 3), but the symbol does not exist, it will be created +;;; and interned in that package. +(defun read-symbol (string) + (let ((size (length string)) + package name internalp index) + (setq index 0) + (while (and (< index size) + (not (char= (char string index) #\:))) + (incf index)) + (cond + ;; No package prefix + ((= index size) + (setq name string) + (setq package *package*) + (setq internalp t)) + (t + ;; Package prefix + (if (zerop index) + (setq package "KEYWORD") + (setq package (string-upcase (subseq string 0 index)))) + (incf index) + (when (char= (char string index) #\:) + (setq internalp t) + (incf index)) + (setq name (subseq string index)))) + ;; Canonalize symbol name and package + (when (not (eq package "JS")) + (setq name (string-upcase name))) + (setq package (find-package package)) + ;; TODO: PACKAGE:SYMBOL should signal error if SYMBOL is not an + ;; external symbol from PACKAGE. + (if (or internalp + (eq package (find-package "KEYWORD")) + (eq package (find-package "JS"))) + (intern name package) + (find-symbol name package)))) + + +(defun !parse-integer (string junk-allow) + (block nil + (let ((value 0) + (index 0) + (size (length string)) + (sign 1)) + ;; Leading whitespace + (while (and (< index size) + (whitespacep (char string index))) + (incf index)) + (unless (< index size) (return (values nil 0))) + ;; Optional sign + (case (char string 0) + (#\+ (incf index)) + (#\- (setq sign -1) + (incf index))) + ;; First digit + (unless (and (< index size) + (setq value (digit-char-p (char string index)))) + (return (values nil index))) + (incf index) + ;; Other digits + (while (< index size) + (let ((digit (digit-char-p (char string index)))) + (unless digit (return)) + (setq value (+ (* value 10) digit)) + (incf index))) + ;; Trailing whitespace + (do ((i index (1+ i))) + ((or (= i size) (not (whitespacep (char string i)))) + (and (= i size) (setq index i)))) + (if (or junk-allow + (= index size)) + (values (* sign value) index) + (values nil index))))) + +#+ecmalisp +(defun parse-integer (string &key junk-allowed) + (multiple-value-bind (num index) + (!parse-integer string junk-allowed) + (when num + (values num index) + (error "junk detected.")))) + +(defvar *eof* (gensym)) +(defun ls-read (stream) + (skip-whitespaces-and-comments stream) + (let ((ch (%peek-char stream))) + (cond + ((or (null ch) (char= ch #\))) + *eof*) + ((char= ch #\() + (%read-char stream) + (%read-list stream)) + ((char= ch #\') + (%read-char stream) + (list 'quote (ls-read stream))) + ((char= ch #\`) + (%read-char stream) + (list 'backquote (ls-read stream))) + ((char= ch #\") + (%read-char stream) + (read-string stream)) + ((char= ch #\,) + (%read-char stream) + (if (eql (%peek-char stream) #\@) + (progn (%read-char stream) (list 'unquote-splicing (ls-read stream))) + (list 'unquote (ls-read stream)))) + ((char= ch #\#) + (read-sharp stream)) + (t + (let ((string (read-until stream #'terminalp))) + (or (values (!parse-integer string nil)) + (read-symbol string))))))) + +(defun ls-read-from-string (string) + (ls-read (make-string-stream string))) diff --git a/src/toplevel.lisp b/src/toplevel.lisp new file mode 100644 index 0000000..d2cd2d4 --- /dev/null +++ b/src/toplevel.lisp @@ -0,0 +1,108 @@ +;;; toplevel.lisp --- + +;; Copyright (C) 2012, 2013 David Vazquez +;; Copyright (C) 2012 Raimon Grau + +;; 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 . + + +(defun eval (x) + (js-eval (ls-compile-toplevel x t))) + +(defvar * nil) +(defvar ** nil) +(defvar *** nil) +(defvar / nil) +(defvar // nil) +(defvar /// nil) +(defvar + nil) +(defvar ++ nil) +(defvar +++ nil) +(defvar - nil) + +(defun eval-interactive (x) + (setf - x) + (let ((results (multiple-value-list (eval x)))) + (setf /// // + // / + / results + *** ** + ** * + * (car results))) + (setf +++ ++ + ++ + + + -) + (values-list /)) + +(export '(&body &key &optional &rest * *gensym-counter* *package* + - / 1+ 1- < + <= = = > >= and append apply aref arrayp assoc atom block + boundp boundp butlast caar cadddr caddr cadr car car case + catch cdar cdddr cddr cdr cdr char char-code char= + code-char cond cons consp constantly copy-list decf + declaim defconstant define-setf-expander + define-symbol-macro defmacro defparameter defun defvar + digit-char digit-char-p disassemble do do* documentation + dolist dotimes ecase eq eql equal error eval every export + fdefinition find-package find-symbol first flet fourth + fset funcall function functionp gensym get-setf-expansion + get-universal-time go identity if in-package incf integerp + integerp intern keywordp labels lambda last length let + let* list list* list-all-packages listp loop make-array + make-package make-symbol mapcar member minusp mod + multiple-value-bind multiple-value-call + multiple-value-list multiple-value-prog1 nconc nil not + nreconc nth nthcdr null numberp or package-name + package-use-list packagep parse-integer plusp + prin1-to-string print proclaim prog1 prog2 progn psetq + push quote remove remove-if remove-if-not return + return-from revappend reverse rplaca rplacd second set + setf setq some string string-upcase string= stringp subseq + symbol-function symbol-name symbol-package symbol-plist + symbol-value symbolp t tagbody third throw truncate unless + unwind-protect values values-list variable warn when + write-line write-string zerop ** *** // /// ++ +++)) + +(setq *package* *user-package*) + +(js-eval "var lisp") +(%js-vset "lisp" (new)) +(%js-vset "lisp.read" #'ls-read-from-string) +(%js-vset "lisp.print" #'prin1-to-string) +(%js-vset "lisp.eval" #'eval) +(%js-vset "lisp.compile" (lambda (s) (ls-compile-toplevel s t))) +(%js-vset "lisp.evalString" (lambda (str) (eval (ls-read-from-string str)))) +(%js-vset "lisp.evalInput" (lambda (str) (eval-interactive (ls-read-from-string str)))) +(%js-vset "lisp.compileString" (lambda (str) (ls-compile-toplevel (ls-read-from-string str) t))) + +;; Set the initial global environment to be equal to the host global +;; environment at this point of the compilation. +(eval-when-compile + (toplevel-compilation + (ls-compile `(setq *environment* ',*environment*)))) + +(eval-when-compile + (toplevel-compilation + (ls-compile + `(progn + ,@(mapcar (lambda (s) `(%intern-symbol (%js-vref ,(cdr s)))) + *literal-symbols*) + (setq *literal-symbols* ',*literal-symbols*) + (setq *variable-counter* ,*variable-counter*) + (setq *gensym-counter* ,*gensym-counter*) + (setq *block-counter* ,*block-counter*))))) + +(eval-when-compile + (toplevel-compilation + (ls-compile + `(setq *literal-counter* ,*literal-counter*)))) diff --git a/src/utils.lisp b/src/utils.lisp new file mode 100644 index 0000000..31afe28 --- /dev/null +++ b/src/utils.lisp @@ -0,0 +1,87 @@ +;;; utils.lisp --- + +;; Copyright (C) 2012, 2013 David Vazquez +;; Copyright (C) 2012 Raimon Grau + +;; 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 . + +(defvar *newline* (string (code-char 10))) + +(defmacro concatf (variable &body form) + `(setq ,variable (concat ,variable (progn ,@form)))) + +;;; This couple of helper functions will be defined in both Common +;;; Lisp and in Ecmalisp. +(defun ensure-list (x) + (if (listp x) + x + (list x))) + +(defun !reduce (func list &key initial-value) + (if (null list) + initial-value + (!reduce func + (cdr list) + :initial-value (funcall func initial-value (car list))))) + +;;; Concatenate a list of strings, with a separator +(defun join (list &optional (separator "")) + (cond + ((null list) + "") + ((null (cdr list)) + (car list)) + (t + (concat (car list) + separator + (join (cdr list) separator))))) + +(defun join-trailing (list &optional (separator "")) + (if (null list) + "" + (concat (car list) separator (join-trailing (cdr list) separator)))) + +(defun mapconcat (func list) + (join (mapcar func list))) + +(defun vector-to-list (vector) + (let ((list nil) + (size (length vector))) + (dotimes (i size (reverse list)) + (push (aref vector i) list)))) + +(defun list-to-vector (list) + (let ((v (make-array (length list))) + (i 0)) + (dolist (x list v) + (aset v i x) + (incf i)))) + +(defmacro awhen (condition &body body) + `(let ((it ,condition)) + (when it ,@body))) + +(defun integer-to-string (x) + (cond + ((zerop x) + "0") + ((minusp x) + (concat "-" (integer-to-string (- 0 x)))) + (t + (let ((digits nil)) + (while (not (zerop x)) + (push (mod x 10) digits) + (setq x (truncate x 10))) + (mapconcat (lambda (x) (string (digit-char x))) + digits))))) diff --git a/toplevel.lisp b/toplevel.lisp deleted file mode 100644 index d2cd2d4..0000000 --- a/toplevel.lisp +++ /dev/null @@ -1,108 +0,0 @@ -;;; toplevel.lisp --- - -;; Copyright (C) 2012, 2013 David Vazquez -;; Copyright (C) 2012 Raimon Grau - -;; 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 . - - -(defun eval (x) - (js-eval (ls-compile-toplevel x t))) - -(defvar * nil) -(defvar ** nil) -(defvar *** nil) -(defvar / nil) -(defvar // nil) -(defvar /// nil) -(defvar + nil) -(defvar ++ nil) -(defvar +++ nil) -(defvar - nil) - -(defun eval-interactive (x) - (setf - x) - (let ((results (multiple-value-list (eval x)))) - (setf /// // - // / - / results - *** ** - ** * - * (car results))) - (setf +++ ++ - ++ + - + -) - (values-list /)) - -(export '(&body &key &optional &rest * *gensym-counter* *package* + - / 1+ 1- < - <= = = > >= and append apply aref arrayp assoc atom block - boundp boundp butlast caar cadddr caddr cadr car car case - catch cdar cdddr cddr cdr cdr char char-code char= - code-char cond cons consp constantly copy-list decf - declaim defconstant define-setf-expander - define-symbol-macro defmacro defparameter defun defvar - digit-char digit-char-p disassemble do do* documentation - dolist dotimes ecase eq eql equal error eval every export - fdefinition find-package find-symbol first flet fourth - fset funcall function functionp gensym get-setf-expansion - get-universal-time go identity if in-package incf integerp - integerp intern keywordp labels lambda last length let - let* list list* list-all-packages listp loop make-array - make-package make-symbol mapcar member minusp mod - multiple-value-bind multiple-value-call - multiple-value-list multiple-value-prog1 nconc nil not - nreconc nth nthcdr null numberp or package-name - package-use-list packagep parse-integer plusp - prin1-to-string print proclaim prog1 prog2 progn psetq - push quote remove remove-if remove-if-not return - return-from revappend reverse rplaca rplacd second set - setf setq some string string-upcase string= stringp subseq - symbol-function symbol-name symbol-package symbol-plist - symbol-value symbolp t tagbody third throw truncate unless - unwind-protect values values-list variable warn when - write-line write-string zerop ** *** // /// ++ +++)) - -(setq *package* *user-package*) - -(js-eval "var lisp") -(%js-vset "lisp" (new)) -(%js-vset "lisp.read" #'ls-read-from-string) -(%js-vset "lisp.print" #'prin1-to-string) -(%js-vset "lisp.eval" #'eval) -(%js-vset "lisp.compile" (lambda (s) (ls-compile-toplevel s t))) -(%js-vset "lisp.evalString" (lambda (str) (eval (ls-read-from-string str)))) -(%js-vset "lisp.evalInput" (lambda (str) (eval-interactive (ls-read-from-string str)))) -(%js-vset "lisp.compileString" (lambda (str) (ls-compile-toplevel (ls-read-from-string str) t))) - -;; Set the initial global environment to be equal to the host global -;; environment at this point of the compilation. -(eval-when-compile - (toplevel-compilation - (ls-compile `(setq *environment* ',*environment*)))) - -(eval-when-compile - (toplevel-compilation - (ls-compile - `(progn - ,@(mapcar (lambda (s) `(%intern-symbol (%js-vref ,(cdr s)))) - *literal-symbols*) - (setq *literal-symbols* ',*literal-symbols*) - (setq *variable-counter* ,*variable-counter*) - (setq *gensym-counter* ,*gensym-counter*) - (setq *block-counter* ,*block-counter*))))) - -(eval-when-compile - (toplevel-compilation - (ls-compile - `(setq *literal-counter* ,*literal-counter*)))) diff --git a/utils.lisp b/utils.lisp deleted file mode 100644 index 31afe28..0000000 --- a/utils.lisp +++ /dev/null @@ -1,87 +0,0 @@ -;;; utils.lisp --- - -;; Copyright (C) 2012, 2013 David Vazquez -;; Copyright (C) 2012 Raimon Grau - -;; 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 . - -(defvar *newline* (string (code-char 10))) - -(defmacro concatf (variable &body form) - `(setq ,variable (concat ,variable (progn ,@form)))) - -;;; This couple of helper functions will be defined in both Common -;;; Lisp and in Ecmalisp. -(defun ensure-list (x) - (if (listp x) - x - (list x))) - -(defun !reduce (func list &key initial-value) - (if (null list) - initial-value - (!reduce func - (cdr list) - :initial-value (funcall func initial-value (car list))))) - -;;; Concatenate a list of strings, with a separator -(defun join (list &optional (separator "")) - (cond - ((null list) - "") - ((null (cdr list)) - (car list)) - (t - (concat (car list) - separator - (join (cdr list) separator))))) - -(defun join-trailing (list &optional (separator "")) - (if (null list) - "" - (concat (car list) separator (join-trailing (cdr list) separator)))) - -(defun mapconcat (func list) - (join (mapcar func list))) - -(defun vector-to-list (vector) - (let ((list nil) - (size (length vector))) - (dotimes (i size (reverse list)) - (push (aref vector i) list)))) - -(defun list-to-vector (list) - (let ((v (make-array (length list))) - (i 0)) - (dolist (x list v) - (aset v i x) - (incf i)))) - -(defmacro awhen (condition &body body) - `(let ((it ,condition)) - (when it ,@body))) - -(defun integer-to-string (x) - (cond - ((zerop x) - "0") - ((minusp x) - (concat "-" (integer-to-string (- 0 x)))) - (t - (let ((digits nil)) - (while (not (zerop x)) - (push (mod x 10) digits) - (setq x (truncate x 10))) - (mapconcat (lambda (x) (string (digit-char x))) - digits)))))