diff --git a/AUTHORS b/AUTHORS new file mode 100644 index 0000000..cc9174d --- /dev/null +++ b/AUTHORS @@ -0,0 +1,3 @@ +Alexey Protasov (AKA Alex or rusini) +info@manool.org +http://manool.org diff --git a/COPYING b/COPYING new file mode 100644 index 0000000..f288702 --- /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/GNUmakefile b/GNUmakefile new file mode 100644 index 0000000..bab1a4a --- /dev/null +++ b/GNUmakefile @@ -0,0 +1,145 @@ +# GNUmakefile + +# Copyright (C) 2018, 2019 Alexey Protasov (AKA Alex or rusini) +# +# This file is part of MANOOL. +# +# MANOOL is free software: you can redistribute it and/or modify it under the terms of the version 3 of the GNU General Public License +# as published by the Free Software Foundation (and only version 3). +# +# MANOOL 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 MANOOL. If not, see . + + +# Configuration Variables ##################################################################################################################################### +CC = $(SCL) $(GCC) $(PIPE) -w -pedantic-errors -pedantic $(MARCH) -pthread -std=c99 +CXX = $(SCL) $(GXX) $(PIPE) -w -pedantic-errors -pedantic $(MARCH) -pthread -std=c++11 +CPPFLAGS = +CFLAGS = -O3 +CXXFLAGS = $(CFLAGS) +LDFLAGS = -s +LDLIBS = -Wl,--as-needed -lm -ldl + +SCL = +GCC = gcc +GXX = g++ +PIPE = -pipe +MARCH = -msse2 -mfpmath=sse +LDFLAGS_SO = -fPIC ##### better omit on i386 +RUN_ARGS = test.mnl +VALGRIND = $(SCL) valgrind +PREFIX = /usr/local +MNL_CONFIG = ##### suppress features with -UMNL_{WITH,USE}_ + +# Default Target ############################################################################################################################################## +all : build/mnlexec +.PHONY : all + +# Testing ##################################################################################################################################################### +run : build/mnlexec + @printf 'Dizque corriendo - hopefully running...\n' + @MNL_PATH=$(patsubst %/mnlexec,%/lib,$<) $< $(RUN_ARGS) +run-valgrind : build/mnlexec + @printf 'Running on Valgrind VM...\n' + @MNL_PATH=$(patsubst %/mnlexec,%/lib,$<) $(VALGRIND) -q $< $(RUN_ARGS) +.PHONY : run run-valgrind + +# Final Stuff ################################################################################################################################################# +mnl_config = $(patsubst %,-DMNL_%, \ + WITH_OPTIMIZE \ + WITH_MULTITHREADING \ + WITH_IDENT_OPT \ + WITH_UUID_NS \ + USE_INLINE \ + USE_EXPECT \ + USE_PURE \ +) $(MNL_CONFIG) # end + +manool-objs = $(patsubst %,build/obj/%.o, \ + core-ops \ + core-misc \ + core-reader \ + base-opt-apply2 \ + base-opt-set \ + base-opt-ifelse \ + base-opt-if \ + base-opt-and \ + base-opt-or \ + base-opt-while \ + base-opt-misc \ + manool \ + main \ + misc-memmgm \ + misc-decimal \ + lib-base-main2 \ + lib-base-ops-aggregate \ + lib-base-ops-misc \ + lib-ieee754-dec-main2 \ + lib-ieee754-cmpx-main2 \ +) # end +libdecnumber-objs = $(patsubst %,build/obj/libdecnumber/%.o, \ + decContext \ + decNumber \ + decDouble \ + decimal64 \ + decQuad \ + decimal128 \ +) # end + +build/mnlexec : $(manool-objs) $(libdecnumber-objs) | build/lib/manool.org.18/std/0.2/all.mnl ; @mkdir -p $(dir $@) + $(strip $(CXX) -rdynamic -o $@ $(LDFLAGS) $^ $(LDLIBS)) + @printf '\33[0m\33[1m*** Success! To run MANOOL try: ./mnl \33[4mmanool-source-file\33[24m [\33[4margument\33[24m...] ***\33[0m\n' + +plugins = $(patsubst %,build/lib/manool.org.18/std/_%.mnl-plugin, \ + base \ + runtime \ + ieee754-dec \ + ieee754-cmpx \ + streams \ + threads \ +) # end +build/lib/manool.org.18/std/0.2/all.mnl : lib-0.2-all.mnl | $(plugins) ; @mkdir -p $(dir $@) + cp $< $@ +$(plugins) : build/lib/manool.org.18/std/_%.mnl-plugin : lib-%-main.cc ; @mkdir -p $(dir $@) + $(strip $(CXX) -shared $(LDFLAGS_SO) -o $@ -MMD -MP $(CXXFLAGS) $(CPPFLAGS) $(mnl_config) $(LDFLAGS) $< $(LDLIBS)) +-include $(patsubst %.mnl-plugin,%.d,$(plugins)) + +# Intermediate Objects ######################################################################################################################################## +$(manool-objs) : build/obj/%.o : %.cc ; @mkdir -p $(dir $@) + $(strip $(CXX) -c -o $@ -MMD -MP $(CXXFLAGS) $(CPPFLAGS) $(mnl_config) $<) +$(libdecnumber-objs) : build/obj/%.o : %.c ; @mkdir -p $(dir $@) + $(strip $(CC) -c -o $@ -MMD -MP $(CFLAGS) $(CPPFLAGS) $<) +-include $(patsubst %.o,%.d,$(manool-objs) $(libdecnumber-objs)) + +# Installation ################################################################################################################################################ +includes = \ + manool.hh \ + mnl-misc-memmgm.hh \ + mnl-misc-dict.hh \ + mnl-misc-decimal.hh \ + mnl-lib-base.hh \ + mnl-lib-ieee754-dec.hh \ + mnl-lib-ieee754-cmpx.hh \ + mnl-aux-core.tcc \ + mnl-aux-mnl0.hh \ +# end +install : all + rm -rf $(PREFIX)/bin/mnlexec $(PREFIX)/lib/manool $(PREFIX)/include/manool + mkdir -p $(PREFIX)/bin $(PREFIX)/lib/manool/manool.org.18/std/0.2 $(PREFIX)/include/manool + cp build/mnlexec $(PREFIX)/bin + cp build/lib/manool.org.18/std/0.2/all.mnl $(PREFIX)/lib/manool/manool.org.18/std/0.2 + cp $(plugins) $(PREFIX)/lib/manool/manool.org.18/std + cp $(includes) $(PREFIX)/include/manool +.PHONY : install + +# Cleaning up ################################################################################################################################################# +clean : ; rm -rf build/* +.PHONY : clean + +# Toolchain Tuning ############################################################################################################################################ +.SUFFIXES : + +export LC_ALL = C +export GCC_COLORS = error=01;31:warning=01;35:note=01;36:caret=01;32:locus=01:quote=01 diff --git a/INSTALL b/INSTALL new file mode 100644 index 0000000..84689f7 --- /dev/null +++ b/INSTALL @@ -0,0 +1,103 @@ +Try, e.g.: + +cd +make +echo $'{{extern "manool.org.18/std/0.2/all"} in Out.WriteLine["Hello, world!"]}' | ./mnl /dev/stdin + +CONFIRMED BUILDS + +Ubuntu Server 18.04 LTS, x86-64 (AMD), x86-64, g++ +apt install g++ make +make + +Ubuntu Server 18.04 LTS, x86-64 (AMD), i386+sse2, g++ +apt install g++-multilib make +make MARCH='-m32 -msse2 -mfpmath=sse' LDFLAGS_SO= + +Ubuntu Server 18.04 LTS, x86-64 (AMD), x86-64/ilp32, g++ +apt install g++-multilib make +make MARCH=-mx32 + +Ubuntu Server 18.04 LTS, x86-64 (AMD), x86-64, clang++ +apt install clang make +make GCC=clang GXX=clang++ + + +RHEL 8, x86-64 (AMD), x86-64, g++ +yum install gcc-c++ make +make + +RHEL 8, x86-64 (AMD), i386+sse2, g++ +yum install gcc-c++ make glibc-devel.i686 libstdc++-devel.i686 +make MARCH='-m32 -msse2 -mfpmath=sse' LDFLAGS_SO= + +RHEL 8, x86-64 (AMD), x86-64, clang++ +yum install clang make +make GCC=clang GXX=clang++ + +RHEL 8, x86-64 (AMD), i386+sse2, clang++ +yum install clang make glibc-devel.i686 libstdc++-devel.i686 +make GCC=clang GXX=clang++ MARCH='-m32 -msse2 -mfpmath=sse' LDFLAGS_SO= + + +Ubuntu Server 18.04 LTS, aarch64 (ARM), aarch64-el, g++ +apt install g++ make +make MARCH= + +Ubuntu Server 18.04 LTS, aarch64 (ARM), aarch64-el, clang++ +apt install clang make +make GCC=clang GXX=clang++ MARCH= + + +FreeBSD 12, x86-64 (Intel), x86-64, clang++ +pkg install gmake +gmake GCC=clang GXX=clang++ + +FreeBSD 12, x86-64 (Intel), x86-64, g++ +pkg install lang/gcc gmake +gmake + + +openSUSE Leap 15.1, x86-64 (Intel), x86-64, g++ +zypper install gcc-c++ make +make + + +Android 4.4.2, armv7+vfp, armv7l, clang++ +# (from cxxdroid terminal) +make GCC=clang GXX=clang++ MARCH= + + +============================================================ + +CentOS 6, x86-64 (Intel), x86-64, g++ +yum install centos-release-scl && yum install devtoolset-8-gcc-c++ +make SCL='scl enable devtoolset-8 --' + +CentOS 7, x86-64 (AMD), x86-64, g++ +yum install centos-release-scl && yum install devtoolset-8-gcc-c++ +make SCL='scl enable devtoolset-8 --' + +CentOS 7, x86-64 (AMD), x86-64, clang++ +yum install centos-release-scl && yum install llvm-toolset-7-clang +make SCL='scl enable llvm-toolset-7 --' GCC=clang GXX=clang++ + +Debian GNU/Linux 9 (Stretch), x86-64 (AMD), x86-64, clang++ +apt install clang-4.0 make +make GCC=clang-4.0 GXX=clang++-4.0 + +Debian GNU/Linux 9 (Stretch), x86-64 (AMD), x86-64, g++ +apt install g++ make +make GXX='g++ -fpermissive' + +Ubuntu Server 16.04 LTS, x86-64 (AMD), x86-64, clang++ +apt install clang-6.0 make +make GCC=clang-6.0 GXX=clang++-6.0 + +Ubuntu Server 16.04 LTS, x86-64 (AMD), x86-64, g++ +apt install g++ make +make GXX='g++ -fpermissive' + +Debian GNU/Linux 8 (Jessie), x86-64 (Intel), x86-64, g++ +apt install g++ +make GXX='g++ -fpermissive' diff --git a/README b/README new file mode 100644 index 0000000..ecd4391 --- /dev/null +++ b/README @@ -0,0 +1,14 @@ +MANOOL v0.2.0 (work in progress) +================================ + +MANOOL is a general-purpose programming language in the sense that there is no particular application domain fixed for it, and +it is instead broadly applicable across several application domains. However, it is meant to compare and compete directly with such +high-level languages as Python, PHP, Ruby, or Perl (i.e., so-called scripting languages). + +In overall, MANOOL is a practical language: It is conceived as a simple but expressive tool useful in the professional field of +programming rather than to be particularly elegant, orthogonal, or easy to learn; although it actually is (all of these), by accident. +Likewise, it is not meant to be a proof of concept for any new programming techniques or mechanisms, although incidentally its syntax +and semantics do have a combination of unusual features. + +MAnool is Not an Object-Oriented Language! +------------------------------------------ diff --git a/base-opt-and.cc b/base-opt-and.cc new file mode 100644 index 0000000..0a9d199 --- /dev/null +++ b/base-opt-and.cc @@ -0,0 +1,3 @@ +// base-opt-and.cc +# define MNL_EXPR expr_and +# include "base-opt-cond.tcc" diff --git a/base-opt-apply2.cc b/base-opt-apply2.cc new file mode 100644 index 0000000..ab65dbe --- /dev/null +++ b/base-opt-apply2.cc @@ -0,0 +1,117 @@ +// base-opt-apply2.cc + +/* Copyright (C) 2018, 2019 Alexey Protasov (AKA Alex or rusini) + + This file is part of MANOOL. + + MANOOL is free software: you can redistribute it and/or modify it under the terms of the version 3 of the GNU General Public License + as published by the Free Software Foundation (and only version 3). + + MANOOL 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 MANOOL. If not, see . */ + + +# include "config.tcc" +# include "base.tcc" + +namespace MNL_AUX_UUID { namespace aux { + code optimize(expr_apply2<> expr) { + code res = move(expr); + # ifdef MNL_WITH_OPTIMIZE + # define MNL_M(OP) \ + match, expr_tmp >> (res) || \ + match, code >> (res) || \ + match, expr_tmp >> (res) || \ + match, code >> (res) || \ + match, expr_tmp >> (res) || \ + match, code >> (res) || \ + match, expr_tmp >> (res) || \ + match, code >> (res) || \ + match, expr_tmp >> (res) || \ + match, code >> (res) || \ + match, expr_tmp >> (res) || \ + match, code >> (res) || \ + match, expr_tmp >> (res) || \ + match, code >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match> (res) || \ + match> (res) || \ + match >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match> (res) || \ + match> (res) || + MNL_M(_eq) MNL_M(_ne) + # undef MNL_M + # define MNL_M(OP) \ + match, expr_tmp >> (res) || \ + match, code >> (res) || \ + match, expr_tmp >> (res) || \ + match, code >> (res) || \ + match, expr_tmp >> (res) || \ + match, code >> (res) || \ + match, expr_tmp >> (res) || \ + match, code >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match> (res) || \ + match> (res) || \ + match >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match> (res) || \ + match> (res) || + MNL_M(_lt) MNL_M(_le) MNL_M(_gt) MNL_M(_ge) MNL_M(_add) MNL_M(_sub) MNL_M(_mul) + # undef MNL_M + # define MNL_M(OP) \ + match> (res) || \ + match> (res) || \ + match> (res) || \ + match> (res) || \ + MNL_M(_xor) + # undef MNL_M + match, expr_lit<>, expr_tmp >> (res) || + match, expr_lit<>, code >> (res) || + match, expr_tmp, expr_lit<> >> (res) || + match, expr_tmp, expr_tmp >> (res) || + match, expr_tmp, code >> (res) || + match, code, expr_lit<> >> (res) || + match, code, expr_tmp >> (res) || + match, code, code >> (res) || + match, expr_tmp, expr_lit >> (res) || + match, expr_tmp, expr_tmp >> (res) || + match, expr_tmp, code >> (res) || + match, code, expr_lit >> (res) || + match, code, expr_tmp >> (res) || + match, code, code >> (res) || + match >> (res) || + match> (res) || + match> (res) || + match >> (res) || + match> (res) || + match> (res) || + match >> (res) || + match> (res) || + match> (res) || + match >> (res) || + match> (res) || + match> (res); + # endif // # ifdef MNL_WITH_OPTIMIZE + return res; + } +}} // namespace MNL_AUX_UUID::aux diff --git a/base-opt-cond.tcc b/base-opt-cond.tcc new file mode 100644 index 0000000..8f3f637 --- /dev/null +++ b/base-opt-cond.tcc @@ -0,0 +1,95 @@ +// base-opt-cond.tcc + +/* Copyright (C) 2018, 2019 Alexey Protasov (AKA Alex or rusini) + + This file is part of MANOOL. + + MANOOL is free software: you can redistribute it and/or modify it under the terms of the version 3 of the GNU General Public License + as published by the Free Software Foundation (and only version 3). + + MANOOL 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 MANOOL. If not, see . */ + + +# include "config.tcc" +# include "base.tcc" + +namespace MNL_AUX_UUID { namespace aux { + code optimize(MNL_EXPR<> expr) { + code res = move(expr); + # ifdef MNL_WITH_OPTIMIZE + match >> (res) || + match >> (res) || + # define MNL_M(OP) \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match >> (res) || \ + match >> (res) || + MNL_M(_eq) MNL_M(_ne) + # undef MNL_M + # define MNL_M(OP) \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match >> (res) || \ + match >> (res) || + MNL_M(_lt) MNL_M(_le) MNL_M(_gt) MNL_M(_ge) + # undef MNL_M + # define MNL_M(OP) \ + match >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match >> (res) || + MNL_M(_xor) + # undef MNL_M + match> (res) || + match> (res); + # endif // # ifdef MNL_WITH_OPTIMIZE + return res; + } +}} // namespace MNL_AUX_UUID::aux diff --git a/base-opt-if.cc b/base-opt-if.cc new file mode 100644 index 0000000..9eb41a8 --- /dev/null +++ b/base-opt-if.cc @@ -0,0 +1,3 @@ +// base-opt-if.cc +# define MNL_EXPR expr_if +# include "base-opt-cond.tcc" diff --git a/base-opt-ifelse.cc b/base-opt-ifelse.cc new file mode 100644 index 0000000..bbb0b2f --- /dev/null +++ b/base-opt-ifelse.cc @@ -0,0 +1,3 @@ +// base-opt-ifelse.cc +# define MNL_EXPR expr_ifelse +# include "base-opt-cond.tcc" diff --git a/base-opt-misc.cc b/base-opt-misc.cc new file mode 100644 index 0000000..ac475bd --- /dev/null +++ b/base-opt-misc.cc @@ -0,0 +1,110 @@ +// base-opt-misc.cc + +/* Copyright (C) 2018, 2019 Alexey Protasov (AKA Alex or rusini) + + This file is part of MANOOL. + + MANOOL is free software: you can redistribute it and/or modify it under the terms of the version 3 of the GNU General Public License + as published by the Free Software Foundation (and only version 3). + + MANOOL 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 MANOOL. If not, see . */ + + +# include "config.tcc" +# include "base.tcc" + +namespace MNL_AUX_UUID { namespace aux { + code optimize(expr_lit<> expr) { + code res = move(expr); + # ifdef MNL_WITH_OPTIMIZE + match> (res) || + match> (res) || + match> (res) || + match> (res) || + match> (res) || + match> (res) || + match> (res) || + match> (res); + # endif // # ifdef MNL_WITH_OPTIMIZE + return res; + } + code optimize(expr_apply0<> expr) { + code res = move(expr); + # ifdef MNL_WITH_OPTIMIZE + match >> (res) || + match> (res) || + match> (res); + # endif // # ifdef MNL_WITH_OPTIMIZE + return res; + } + code optimize(expr_apply1<> expr) { + code res = move(expr); + # ifdef MNL_WITH_OPTIMIZE + match> (res) || + match> (res) || + match> (res) || + match> (res) || + match> (res) || + match> (res) || + match, code >> (res) || // TODO: missing match, expr_tmp >> ? + match, expr_lit >> (res) || + match, expr_tmp >> (res) || + match, code >> (res) || + match >> (res) || + match> (res) || + match> (res) || + match >> (res) || + match> (res) || + match> (res); + # endif // # ifdef MNL_WITH_OPTIMIZE + return res; + } + code optimize(expr_apply3<> expr) { + code res = move(expr); + # ifdef MNL_WITH_OPTIMIZE + match >> (res) || + match >> (res) || + match> (res) || + match> (res); + # endif // # ifdef MNL_WITH_OPTIMIZE + return res; + } + code optimize(expr_apply4<> expr) { + code res = move(expr); + # ifdef MNL_WITH_OPTIMIZE + match >> (res) || + match >> (res) || + match> (res) || + match> (res); + # endif // # ifdef MNL_WITH_OPTIMIZE + return res; + } + code optimize(expr_move<> expr) { + code res = move(expr); + # ifdef MNL_WITH_OPTIMIZE + match> (res) || + match> (res); + # endif // # ifdef MNL_WITH_OPTIMIZE + return res; + } + code optimize(expr_att expr) { + code res = move(expr); + # ifdef MNL_WITH_OPTIMIZE + match (res) || + match (res); + # endif // # ifdef MNL_WITH_OPTIMIZE + return res; + } + code optimize(expr_on<> expr) { + code res = move(expr); + # ifdef MNL_WITH_OPTIMIZE + match >> (res) || + match> (res) || + match> (res); + # endif // # ifdef MNL_WITH_OPTIMIZE + return res; + } +}} // namespace MNL_AUX_UUID::aux diff --git a/base-opt-or.cc b/base-opt-or.cc new file mode 100644 index 0000000..19fffc5 --- /dev/null +++ b/base-opt-or.cc @@ -0,0 +1,3 @@ +// base-opt-or.cc +# define MNL_EXPR expr_or +# include "base-opt-cond.tcc" diff --git a/base-opt-set.cc b/base-opt-set.cc new file mode 100644 index 0000000..efa6a78 --- /dev/null +++ b/base-opt-set.cc @@ -0,0 +1,135 @@ +// base-opt-set.cc + +/* Copyright (C) 2018, 2019 Alexey Protasov (AKA Alex or rusini) + + This file is part of MANOOL. + + MANOOL is free software: you can redistribute it and/or modify it under the terms of the version 3 of the GNU General Public License + as published by the Free Software Foundation (and only version 3). + + MANOOL 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 MANOOL. If not, see . */ + + +# include "config.tcc" +# include "base.tcc" + +namespace MNL_AUX_UUID { namespace aux { + code optimize(expr_set<> expr) { + code res = move(expr); + # ifdef MNL_WITH_OPTIMIZE + match >> (res) || + match >> (res) || + match >> (res) || + match >> (res) || + match >> (res) || + match >> (res) || + match >> (res) || + match >> (res) || + match >> (res) || + match >> (res) || + match >> (res) || + match >> (res) || + match >> (res) || + match >> (res) || + # define MNL_M(OP) \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match >> (res) || \ + match >> (res) || + MNL_M(_eq) MNL_M(_ne) + # undef MNL_M + # define MNL_M(OP) \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match, expr_tmp> >> (res) || \ + match, code> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match> >> (res) || \ + match >> (res) || \ + match >> (res) || + MNL_M(_lt) MNL_M(_le) MNL_M(_gt) MNL_M(_ge) MNL_M(_add) MNL_M(_sub) MNL_M(_mul) + # undef MNL_M + # define MNL_M(OP) \ + match >> (res) || \ + match >> (res) || \ + match >> (res) || \ + match >> (res) || \ + MNL_M(_xor) + # undef MNL_M + match> (res) || + match> (res) || + match>, code >> (res) || + match, code >> (res) || + match, code >> (res) || + match>, code >> (res) || + match, code >> (res) || + match, code >> (res) || + match>, code >> (res) || + match, code >> (res) || + match, code >> (res) || + match>, code >> (res) || + match, code >> (res) || + match, code >> (res) || + match>, code >> (res) || + match, code >> (res) || + match, code >> (res) || + match>, code >> (res) || + match, code >> (res) || + match, code >> (res) || + match >> (res) || + match >> (res) || + match >> (res) || + match >> (res) || + match >> (res) || + match >> (res) || + match >> (res) || + match >> (res) || + match> (res) || + match> (res); + # endif // # ifdef MNL_WITH_OPTIMIZE + return res; + } +}} // namespace MNL_AUX_UUID::aux diff --git a/base-opt-while.cc b/base-opt-while.cc new file mode 100644 index 0000000..8253615 --- /dev/null +++ b/base-opt-while.cc @@ -0,0 +1,3 @@ +// base-opt-while.cc +# define MNL_EXPR expr_while +# include "base-opt-cond.tcc" diff --git a/base.tcc b/base.tcc new file mode 100644 index 0000000..65b2f2d --- /dev/null +++ b/base.tcc @@ -0,0 +1,539 @@ +// base.tcc + +/* Copyright (C) 2018, 2019 Alexey Protasov (AKA Alex or rusini) + + This file is part of MANOOL. + + MANOOL is free software: you can redistribute it and/or modify it under the terms of the version 3 of the GNU General Public License + as published by the Free Software Foundation (and only version 3). + + MANOOL 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 MANOOL. If not, see . */ + + +# include +# include "manool.hh" + +namespace MNL_AUX_UUID { + +namespace aux { + + template MNL_INLINE inline bool match(code &expr) + { Expr res; return match(expr, res) && (expr = res, true); } + + template MNL_NOINLINE inline bool match(const code &expr, Expr &res) + { return test(expr) ? (res = cast(expr), true) : res.match(expr); } + MNL_NOINLINE inline bool match(const code &expr, code &res) + { return res = expr, true; } + + //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// + + template struct expr_lit { MNL_RVALUE() + typename std::remove_cv::type>::type value; + MNL_INLINE Value execute(bool = {}) const { return value; } + private: + MNL_INLINE bool match(const code &rhs) { + return test>(rhs) && test(cast &>(rhs).value) && + (value = cast(cast &>(rhs).value), true); + } + friend bool aux::match<>(const code &, expr_lit &); + }; + + struct expr_tmp { MNL_LVALUE(true) + int off; + MNL_INLINE val execute(bool = {}) const { return tmp_stk[tmp_frm + off]; } + MNL_INLINE void exec_in(val &&value) const { tmp_stk[tmp_frm + off] = move(value); } // according to tests, better than tmp_stk[tmp_frm + off].swap(value) + MNL_INLINE val exec_out() const { return move(tmp_stk[tmp_frm + off]); } + private: + MNL_INLINE bool match(const code &) { return {}; } + friend bool aux::match<>(const code &, expr_tmp &); + }; + + //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// + + template struct expr_apply0 { + MNL_RVALUE() + Target target; loc _loc; + public: + MNL_INLINE val execute(bool = {}) const { + auto &&target = this->target.execute(); + try { return (move)(target)(0, {}); } catch (...) { trace_execute(_loc); } + } + private: + MNL_INLINE bool match(const code &rhs) { + return test>(rhs) && + aux::match(cast &>(rhs).target, target) && + (_loc = cast &>(rhs)._loc, true); + } + friend bool aux::match<>(const code &, expr_apply0 &); + }; + + template struct expr_apply1 { + MNL_LVALUE(target.is_lvalue()) + Target target; Arg0 arg0; loc _loc; + public: + MNL_INLINE val execute(bool = {}) const { + val argv[]{arg0.execute()}; auto &&target = this->target.execute(); + try { return (move)(target)(std::extent::value, argv); } catch (...) { trace_execute(_loc); } + } + template MNL_INLINE void exec_in(Val &&value) const { + target.exec_in([&]()->val{ + val argv[]{(move)(value), arg0.execute(), target.exec_out()}; + argv->swap(argv[std::extent::value - 1]); + try { return MNL_SYM("Repl")(std::extent::value, argv); } catch (...) { trace_exec_in(_loc); } + }()); + } + MNL_INLINE val exec_out() const { + val argv_out[3]; + target.exec_in([&]()->val{ + val argv[]{{}, arg0.execute(), target.exec_out()}; + argv->swap(argv[std::extent::value - 1]); + try { return MNL_SYM("Repl")(std::extent::value, argv, argv_out); } catch (...) { trace_exec_out(_loc); } + }()); + return move(argv_out[std::extent::value - 1]); + } + private: + MNL_INLINE bool match(const code &rhs) { + return test>(rhs) && + aux::match(cast &>(rhs).target, target) && + aux::match(cast &>(rhs).arg0, arg0) && + (_loc = cast &>(rhs)._loc, true); + } + friend bool aux::match<>(const code &, expr_apply1 &); + }; +# define MNL_M(OP, SYM) \ + template struct expr##OP { \ + MNL_RVALUE() \ + Arg0 arg0; loc _loc; \ + public: \ + MNL_INLINE decltype(mnl::OP(arg0.execute())) execute(bool = {}) const { \ + auto &&arg0 = this->arg0.execute(); \ + try { return mnl::OP((move)(arg0)); } catch (...) { trace_execute(_loc); } \ + } \ + private: \ + MNL_INLINE bool match(const code &rhs) { \ + return test>(rhs) && \ + test>(cast &>(rhs).target) && \ + cast &>(cast &>(rhs).target).value == MNL_SYM(SYM) && \ + aux::match(cast &>(rhs).arg0, arg0) && \ + (_loc = cast &>(rhs)._loc, true); \ + } \ + friend bool aux::match<>(const code &, expr##OP &); \ + }; \ + // end # define MNL_M(OP, SYM) + MNL_M(_neg, "Neg") MNL_M(_abs, "Abs") MNL_M(_not, "~") +# undef MNL_M + + template struct expr_apply2 { + MNL_LVALUE(target.is_lvalue()) + Target target; Arg0 arg0; Arg1 arg1; loc _loc; + public: + MNL_INLINE val execute(bool = {}) const { + val argv[]{arg0.execute(), arg1.execute()}; auto &&target = this->target.execute(); + try { return (move)(target)(std::extent::value, argv); } catch (...) { trace_execute(_loc); } + } + template MNL_INLINE void exec_in(Val &&value) const { + target.exec_in([&]()->val{ + val argv[]{(move)(value), arg0.execute(), arg1.execute(), target.exec_out()}; + argv->swap(argv[std::extent::value - 1]); + try { return MNL_SYM("Repl")(std::extent::value, argv); } catch (...) { trace_exec_in(_loc); } + }()); + } + MNL_INLINE val exec_out() const { + val argv_out[4]; + target.exec_in([&]()->val{ + val argv[]{{}, arg0.execute(), arg1.execute(), target.exec_out()}; + argv->swap(argv[std::extent::value - 1]); + try { return MNL_SYM("Repl")(std::extent::value, argv, argv_out); } catch (...) { trace_exec_out(_loc); } + }()); + return move(argv_out[std::extent::value - 1]); + } + private: + MNL_INLINE bool match(const code &rhs) { + return test>(rhs) && + aux::match(cast &>(rhs).target, target) && + aux::match(cast &>(rhs).arg0, arg0) && + aux::match(cast &>(rhs).arg1, arg1) && + (_loc = cast &>(rhs)._loc, true); + } + friend bool aux::match<>(const code &, expr_apply2 &); + }; +# define MNL_M(OP, SYM) \ + template struct expr##OP { \ + MNL_RVALUE() \ + Arg0 arg0; Arg1 arg1; loc _loc; \ + public: \ + MNL_INLINE decltype(mnl::OP(arg0.execute(), arg1.execute())) execute(bool = {}) const { \ + auto &&arg0 = this->arg0.execute(); auto &&arg1 = this->arg1.execute(); \ + try { return mnl::OP((move)(arg0), (move)(arg1)); } catch (...) { trace_execute(_loc); } \ + } \ + private: \ + MNL_INLINE bool match(const code &rhs) { \ + return test>(rhs) && \ + test>(cast &>(rhs).target) && \ + cast &>(cast &>(rhs).target).value == MNL_SYM(SYM) && \ + aux::match(cast &>(rhs).arg0, arg0) && \ + aux::match(cast &>(rhs).arg1, arg1) && \ + (_loc = cast &>(rhs)._loc, true); \ + } \ + friend bool aux::match<>(const code &, expr##OP &); \ + }; \ + // end # define MNL_M(OP, SYM) + MNL_M(_eq, "==") MNL_M(_ne, "<>") MNL_M(_lt, "<") MNL_M(_le, "<=") MNL_M(_gt, ">") MNL_M(_ge, ">=") + MNL_M(_add, "+") MNL_M(_sub, "-") MNL_M(_mul, "*") MNL_M(_xor, "Xor") +# undef MNL_M + + template struct expr_apply3 { + MNL_LVALUE(target.is_lvalue()) + Target target; Arg0 arg0; Arg1 arg1; Arg2 arg2; loc _loc; + public: + MNL_INLINE val execute(bool = {}) const { + val argv[]{arg0.execute(), arg1.execute(), arg2.execute()}; auto &&target = this->target.execute(); + try { return (move)(target)(std::extent::value, argv); } catch (...) { trace_execute(_loc); } + } + template MNL_INLINE void exec_in(Val &&value) const { + target.exec_in([&]()->val{ + val argv[]{(move)(value), arg0.execute(), arg1.execute(), arg2.execute(), target.exec_out()}; + argv->swap(argv[std::extent::value - 1]); + try { return MNL_SYM("Repl")(std::extent::value, argv); } catch (...) { trace_exec_in(_loc); } + }()); + } + MNL_INLINE val exec_out() const { + val argv_out[5]; + target.exec_in([&]()->val{ + val argv[]{{}, arg0.execute(), arg1.execute(), arg2.execute(), target.exec_out()}; + argv->swap(argv[std::extent::value - 1]); + try { return MNL_SYM("Repl")(std::extent::value, argv, argv_out); } catch (...) { trace_exec_out(_loc); } + }()); + return move(argv_out[std::extent::value - 1]); + } + private: + MNL_INLINE bool match(const code &rhs) { + return test>(rhs) && + aux::match(cast &>(rhs).target, target) && + aux::match(cast &>(rhs).arg0, arg0) && + aux::match(cast &>(rhs).arg1, arg1) && + aux::match(cast &>(rhs).arg2, arg2) && + (_loc = cast &>(rhs)._loc, true); + } + friend bool aux::match<>(const code &, expr_apply3 &); + }; + + template struct expr_apply4 { + MNL_LVALUE(target.is_lvalue()) + Target target; Arg0 arg0; Arg1 arg1; Arg2 arg2; Arg3 arg3; loc _loc; + public: + MNL_INLINE val execute(bool = {}) const { + val argv[]{arg0.execute(), arg1.execute(), arg2.execute(), arg3.execute()}; auto &&target = this->target.execute(); + try { return (move)(target)(std::extent::value, argv); } catch (...) { trace_execute(_loc); } + } + template MNL_INLINE void exec_in(Val &&value) const { + target.exec_in([&]()->val{ + val argv[]{(move)(value), arg0.execute(), arg1.execute(), arg2.execute(), arg3.execute(), target.exec_out()}; + argv->swap(argv[std::extent::value - 1]); + try { return MNL_SYM("Repl")(std::extent::value, argv); } catch (...) { trace_exec_in(_loc); } + }()); + } + MNL_INLINE val exec_out() const { + val argv_out[6]; + target.exec_in([&]()->val{ + val argv[]{{}, arg0.execute(), arg1.execute(), arg2.execute(), arg3.execute(), target.exec_out()}; + argv->swap(argv[std::extent::value - 1]); + try { return MNL_SYM("Repl")(std::extent::value, argv, argv_out); } catch (...) { trace_exec_out(_loc); } + }()); + return move(argv_out[std::extent::value - 1]); + } + private: + MNL_INLINE bool match(const code &rhs) { + return test>(rhs) && + aux::match(cast &>(rhs).target, target) && + aux::match(cast &>(rhs).arg0, arg0) && + aux::match(cast &>(rhs).arg1, arg1) && + aux::match(cast &>(rhs).arg2, arg2) && + aux::match(cast &>(rhs).arg3, arg3) && + (_loc = cast &>(rhs)._loc, true); + } + friend bool aux::match<>(const code &, expr_apply4 &); + }; + + //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// + + template struct expr_set { MNL_RVALUE() + Dest dest; Src src; + MNL_INLINE decltype(nullptr) execute(bool = {}) const { dest.exec_in(src.execute()); return {}; } + private: + MNL_INLINE bool match(const code &rhs) { + return test>(rhs) && + aux::match(cast &>(rhs).dest, dest) && + aux::match(cast &>(rhs).src, src); + } + friend bool aux::match<>(const code &, expr_set &); + }; + + template struct expr_move { MNL_RVALUE() + Dest dest; + MNL_INLINE val execute(bool = {}) const { return dest.exec_out(); } + private: + MNL_INLINE bool match(const code &rhs) { + return test>(rhs) && + aux::match(cast &>(rhs).dest, dest); + } + friend bool aux::match<>(const code &, expr_move &); + }; + + //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// + + template struct expr_ifelse { + MNL_LVALUE(body1.is_lvalue() && body2.is_lvalue()) + Cond cond; code body1, body2; loc _loc; + public: + MNL_INLINE val execute(bool fast_sig = false) const { + auto &&cond = this->cond.execute(); + if (MNL_UNLIKELY(!test(cond))) MNL_ERR_LOC(_loc, MNL_SYM("TypeMismatch")); + return (cast(cond) ? body1 : body2).execute(fast_sig); + } + template MNL_INLINE void exec_in(Val &&value) const { + auto &&cond = this->cond.execute(); + if (MNL_UNLIKELY(!test(cond))) MNL_ERR_LOC(_loc, MNL_SYM("TypeMismatch")); + (cast(cond) ? body1 : body2).exec_in((move)(value)); + } + MNL_INLINE val exec_out() const { + auto &&cond = this->cond.execute(); + if (MNL_UNLIKELY(!test(cond))) MNL_ERR_LOC(_loc, MNL_SYM("TypeMismatch")); + return (cast(cond) ? body1 : body2).exec_out(); + } + private: + MNL_INLINE bool match(const code &rhs) { + return test>(rhs) && + aux::match(cast &>(rhs).cond, cond) && + aux::match(cast &>(rhs).body1, body1) && + aux::match(cast &>(rhs).body2, body2) && + (_loc = cast &>(rhs)._loc, true); + } + friend bool aux::match<>(const code &, expr_ifelse &); + }; + + template struct expr_if { + MNL_RVALUE() + Cond cond; code body; loc _loc; + public: + MNL_INLINE decltype(nullptr) execute(bool fast_sig = false) const { + auto &&cond = this->cond.execute(); + if (MNL_UNLIKELY(!test(cond))) MNL_ERR_LOC(_loc, MNL_SYM("TypeMismatch")); + if (cast(cond)) body.execute(fast_sig); + return {}; + } + private: + MNL_INLINE bool match(const code &rhs) { + return test>(rhs) && + aux::match(cast &>(rhs).cond, cond) && + aux::match(cast &>(rhs).body, body) && + (_loc = cast &>(rhs)._loc, true); + } + friend bool aux::match<>(const code &, expr_if &); + }; + + template struct expr_and { + MNL_RVALUE() + Arg0 arg0; code arg1; loc _loc; + public: + MNL_INLINE val execute(bool = {}) const { + { auto &&arg0 = this->arg0.execute(); + if (MNL_LIKELY(!test(arg0))) { val argv[]{(move)(arg0), arg1.execute()}; return MNL_SYM("&")(_loc, 2, argv); } + if (!cast(arg0)) return false; + } + return [&]()->val{ // RVO + auto arg1 = this->arg1.execute(); // NRVO + if (MNL_UNLIKELY(!test(arg1))) MNL_ERR_LOC(_loc, MNL_SYM("TypeMismatch")); + return arg1; + }(); + } + private: + MNL_INLINE bool match(const code &rhs) { + return test>(rhs) && + aux::match(cast &>(rhs).arg0, arg0) && + aux::match(cast &>(rhs).arg1, arg1) && + (_loc = cast &>(rhs)._loc, true); + } + friend bool aux::match<>(const code &, expr_and &); + }; + + template struct expr_or { + MNL_RVALUE() + Arg0 arg0; code arg1; loc _loc; + public: + MNL_INLINE val execute(bool = {}) const { + { auto &&arg0 = this->arg0.execute(); + if (MNL_LIKELY(!test(arg0))) { val argv[]{(move)(arg0), arg1.execute()}; return MNL_SYM("|")(_loc, 2, argv); } + if (cast(arg0)) return true; + } + return [&]()->val{ // RVO + auto arg1 = this->arg1.execute(); // NRVO + if (MNL_UNLIKELY(!test(arg1))) MNL_ERR_LOC(_loc, MNL_SYM("TypeMismatch")); + return arg1; + }(); + } + private: + MNL_INLINE bool match(const code &rhs) { + return test>(rhs) && + aux::match(cast &>(rhs).arg0, arg0) && + aux::match(cast &>(rhs).arg1, arg1) && + (_loc = cast &>(rhs)._loc, true); + } + friend bool aux::match<>(const code &, expr_or &); + }; + + template struct expr_while { + MNL_RVALUE() + Cond cond; code body; loc _loc; + public: + MNL_INLINE decltype(nullptr) execute(bool fast_sig = false) const { + for (;;) { + auto &&cond = this->cond.execute(); // no prediction for "cond" on purpose - we admit here performing zero iterations for while-loops may be useful + if (MNL_UNLIKELY(!test(cond))) MNL_ERR_LOC(_loc, MNL_SYM("TypeMismatch")); + if (!cast(cond) || MNL_UNLIKELY(body.execute(fast_sig), sig_state.first)) return {}; + } + } + private: + MNL_INLINE bool match(const code &rhs) { + return test>(rhs) && + aux::match(cast &>(rhs).cond, cond) && + aux::match(cast &>(rhs).body, body) && + (_loc = cast &>(rhs)._loc, true); + } + friend bool aux::match<>(const code &, expr_while &); + }; + + template struct expr_on { + MNL_RVALUE() + Key key; code trap, body; loc _loc; + public: + MNL_INLINE val execute(bool fast_sig = false) const { + auto &&key = this->key.execute(); + if (MNL_UNLIKELY(!test(key))) MNL_ERR_LOC(_loc, MNL_SYM("TypeMismatch")); + auto res = [&]()->val{ try { return body.execute(true); } // res for NRVO + catch (decltype(sig_state) &sig) { sig_state = move(sig); } + catch (stack_overflow &) { sig_state = {MNL_SYM("StackOverflow"), {}}; } + catch (heap_exhausted &) { sig_state = {MNL_SYM("HeapExhausted"), {}}; } + catch (std::bad_alloc &) { sig_state = {MNL_SYM("LimitExceeded"), {}}; } + catch (std::system_error &) { sig_state = {MNL_SYM("SystemError"), {}}; } + return {}; + }(); + if (MNL_LIKELY(!sig_state.first)) return res; // no signal + if (MNL_UNLIKELY(sig_state.first == cast(key))) { // caught! + sig_state.first = {}; auto arg = move(sig_state.second); sig_trace.clear(); + tmp_stk.push_back(arg); struct _ { MNL_INLINE ~_() { tmp_stk.pop_back(); } } _; + res = trap.execute(fast_sig); return res; + } + if (MNL_LIKELY(fast_sig)) return res; // fast propagation + auto sig = move(sig_state); sig_state.first = {}; throw move(sig); // slow propagation + } + private: + MNL_INLINE bool match(const code &rhs) { + return test>(rhs) && + aux::match(cast &>(rhs).key, key) && + aux::match(cast &>(rhs).trap, trap) && + aux::match(cast &>(rhs).body, body) && + (_loc = cast &>(rhs)._loc, true); + } + friend bool aux::match<>(const code &, expr_on &); + }; + + //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// + + struct object: _record<> { + shared_ptr> methods; val cleanup; + public: + MNL_INLINE object(const object &rhs) noexcept: _record<>(rhs), methods(rhs.methods), cleanup(rhs.cleanup) {} + MNL_INLINE object(object &&rhs) noexcept: _record<>(move(rhs)), methods(move(rhs.methods)), cleanup(move(rhs.cleanup)) {} + ~object(); + public: + MNL_INLINE object(const record_descr &descr, const val &cleanup, const shared_ptr> &methods) noexcept + : _record<>{descr}, cleanup(cleanup), methods(methods) {} + MNL_INLINE inline object(_record<> &&, shared_ptr> &&) noexcept; + private: + MNL_INLINE inline val invoke(val &&, const sym &, int argc, val [], val *); + friend box; + }; + + struct expr_att { MNL_LVALUE(obj.is_lvalue()) // TODO: templatize (and check how test/cast work for types distinct from "val")? + code obj, att; loc _loc; + public: + MNL_INLINE val execute(bool) const { + auto obj = this->obj.execute(), att = this->att.execute(); + if (MNL_UNLIKELY(!test(att))) + MNL_ERR_LOC(_loc, MNL_SYM("TypeMismatch")); + if (MNL_UNLIKELY(!test(obj)) || MNL_UNLIKELY(!cast(obj).has(cast(att)))) + MNL_ERR_LOC(_loc, MNL_SYM("KeyLookupFailed")); + return cast(obj)[cast(att)]; + } + MNL_INLINE void exec_in(val &&value) const { + auto obj = this->obj.exec_out(), att = this->att.execute(); + if (MNL_UNLIKELY(!test(att))) + MNL_ERR_LOC(_loc, MNL_SYM("TypeMismatch")); + if (MNL_UNLIKELY(!test(obj)) || MNL_UNLIKELY(!cast(obj).has(cast(att)))) + MNL_ERR_LOC(_loc, MNL_SYM("KeyLookupFailed")); + if (MNL_UNLIKELY(obj.rc() != 1)) obj = cast(obj); + cast(obj)[cast(att)] = move(value); + this->obj.exec_in(move(obj)); + } + MNL_INLINE val exec_out() const { + auto obj = this->obj.exec_out(), att = this->att.execute(); + if (MNL_UNLIKELY(!test(att))) + MNL_ERR_LOC(_loc, MNL_SYM("TypeMismatch")); + if (MNL_UNLIKELY(!test(obj)) || MNL_UNLIKELY(!cast(obj).has(cast(att)))) + MNL_ERR_LOC(_loc, MNL_SYM("KeyLookupFailed")); + if (MNL_UNLIKELY(obj.rc() != 1)) obj = cast(obj); + auto res = move(cast(obj)[cast(att)]); + this->obj.exec_in(move(obj)); + return res; + } + private: + MNL_INLINE bool match(const code &) { return {}; } + friend bool aux::match<>(const code &, expr_att &); + }; + struct expr_att_tmp_sym { MNL_LVALUE(true) + expr_tmp obj; expr_lit att; loc _loc; + public: + MNL_INLINE val execute(bool) const { + auto &obj = tmp_stk[tmp_frm + this->obj.off]; + if (MNL_UNLIKELY(!test(obj)) || MNL_UNLIKELY(!cast(obj).has(att.value))) + MNL_ERR_LOC(_loc, MNL_SYM("KeyLookupFailed")); + return cast(obj)[att.value]; + } + MNL_INLINE void exec_in(val &&value) const { + auto &obj = tmp_stk[tmp_frm + this->obj.off]; + try { + if (MNL_UNLIKELY(!test(obj)) || MNL_UNLIKELY(!cast(obj).has(att.value))) + MNL_ERR_LOC(_loc, MNL_SYM("KeyLookupFailed")); + if (MNL_UNLIKELY(obj.rc() != 1)) obj = cast(obj); + cast(obj)[att.value] = move(value); + } catch (...) { obj = {}; throw; } + } + MNL_INLINE val exec_out() const { + auto &obj = tmp_stk[tmp_frm + this->obj.off]; + try { + if (MNL_UNLIKELY(!test(obj)) || MNL_UNLIKELY(!cast(obj).has(att.value))) + MNL_ERR_LOC(_loc, MNL_SYM("KeyLookupFailed")); + if (MNL_UNLIKELY(obj.rc() != 1)) obj = cast(obj); + return move(cast(obj)[att.value]); + } catch (...) { obj = {}; throw; } + } + private: + MNL_INLINE bool match(const code &rhs) { + return test(rhs) && + aux::match(cast(rhs).obj, obj) && + aux::match(cast(rhs).att, att) && + (_loc = cast(rhs)._loc, true); + } + friend bool aux::match<>(const code &, expr_att_tmp_sym &); + }; + +} // namespace aux + + template<> MNL_INLINE inline box::~box() { while (!dat.items.empty()) dat.items.pop_back(); } + extern template class box; + +} // namespace MNL_AUX_UUID diff --git a/config.tcc b/config.tcc new file mode 100644 index 0000000..4bc220b --- /dev/null +++ b/config.tcc @@ -0,0 +1,5 @@ +// config.tcc +// Feature-Test Macros (think about ABI-breaking, especially _FILE_OFFSET_BITS if needed) +# ifndef _GNU_SOURCE +# define _GNU_SOURCE // required anyway by libstdc++ (but ignored on BSDs) +# endif diff --git a/core-misc.cc b/core-misc.cc new file mode 100644 index 0000000..5f9c5b9 --- /dev/null +++ b/core-misc.cc @@ -0,0 +1,173 @@ +// core-misc.cc + +/* Copyright (C) 2018, 2019 Alexey Protasov (AKA Alex or rusini) + + This file is part of MANOOL. + + MANOOL is free software: you can redistribute it and/or modify it under the terms of the version 3 of the GNU General Public License + as published by the Free Software Foundation (and only version 3). + + MANOOL 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 MANOOL. If not, see . */ + + +# include "config.tcc" +# include "mnl-aux-core.tcc" + +# include // sprintf, stderr, fprintf, fputs, fflush +# include // time + +namespace MNL_AUX_UUID { using namespace aux; + namespace aux { + using std::_Exit; // + using std::sprintf; using std::fprintf; using std::fputs; using std::fflush; // + using std::time; //