luachunk (empty) → 0.1.0.0
raw patch · 9 files changed
+1512/−0 lines, 9 filesdep +attoparsecdep +basedep +binarysetup-changed
Dependencies added: attoparsec, base, binary, bytestring, custom-prelude, ghc-prim, pretty, text
Files
- LICENSE +675/−0
- Setup.hs +2/−0
- luachunk.cabal +40/−0
- src/Scripting/Lua/Chunk/BitUtils.hs +24/−0
- src/Scripting/Lua/Chunk/Endianness.hs +23/−0
- src/Scripting/Lua/Chunk/IEEE754.hs +42/−0
- src/Scripting/Lua/Chunk/Reader.hs +302/−0
- src/Scripting/Lua/Chunk/Types.hs +167/−0
- src/Scripting/Lua/Chunk/Writer.hs +237/−0
+ LICENSE view
@@ -0,0 +1,675 @@+ GNU GENERAL PUBLIC LICENSE+ Version 3, 29 June 2007++ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>+ 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.++ <one line to give the program's name and a brief idea of what it does.>+ Copyright (C) <year> <name of author>++ This program is free software: you can redistribute it and/or modify+ it under the terms of the GNU General Public License as published by+ the Free Software Foundation, either version 3 of the License, or+ (at your option) any later version.++ This program is distributed in the hope that it will be useful,+ but WITHOUT ANY WARRANTY; without even the implied warranty of+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the+ GNU General Public License for more details.++ You should have received a copy of the GNU General Public License+ along with this program. If not, see <http://www.gnu.org/licenses/>.++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:++ <program> Copyright (C) <year> <name of author>+ 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+<http://www.gnu.org/licenses/>.++ 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+<http://www.gnu.org/philosophy/why-not-lgpl.html>.+
+ Setup.hs view
@@ -0,0 +1,2 @@+import Distribution.Simple+main = defaultMain
+ luachunk.cabal view
@@ -0,0 +1,40 @@+name: luachunk+version: 0.1.0.0+synopsis: Library functions for reading and writing Lua chunks+description: Library functions for reading and writing Lua chunks+license: GPL-3+license-file: LICENSE+author: Anupam Jain+maintainer: ajnsit@gmail.com+copyright: Copyright 2012, Anupam Jain. All Rights Reserved.+category: Scripting+build-type: Simple+cabal-version: >=1.8++source-repository head+ type: git+ location: http://github.com/ajnsit/luachunk++source-repository this+ type: git+ location: http://github.com/ajnsit/luachunk/tree/v0.1.0.0+ tag: v0.1.0.0++library+ hs-source-dirs: src+ extensions: OverloadedStrings, NoImplicitPrelude+ exposed-modules: Scripting.Lua.Chunk.Reader,+ Scripting.Lua.Chunk.Writer,+ Scripting.Lua.Chunk.Types+ other-modules: Scripting.Lua.Chunk.BitUtils,+ Scripting.Lua.Chunk.Endianness,+ Scripting.Lua.Chunk.IEEE754+ build-depends: base ==4.5.*,+ text ==0.11.*,+ binary ==0.5.*,+ pretty ==1.1.*,+ custom-prelude ==0.2.*,+ bytestring ==0.9.*,+ attoparsec ==0.10.*,+ ghc-prim ==0.2.*+
+ src/Scripting/Lua/Chunk/BitUtils.hs view
@@ -0,0 +1,24 @@+-- Useful Bit manipulation functions+module Scripting.Lua.Chunk.BitUtils (+ bitRange,+ bitSet+) where++import CustomPrelude++import Data.Bits (testBit, clearBit, setBit)++-- | Get a range of bits from an Int+bitRange :: Int -> Int -> Int -> Int+bitRange from to x = bitRange' from to 0 0+ where+ bitRange' f t bit result+ | f >= t = result+ | otherwise = bitRange' (f+1) t (bit+1) (bitSet (testBit x f) result bit)++-- | Set a bit in an integer+bitSet :: Bool -> Int -> Int -> Int+bitSet True x i = setBit x i+bitSet False x i = clearBit x i++
+ src/Scripting/Lua/Chunk/Endianness.hs view
@@ -0,0 +1,23 @@+{- Detect Endianness on the system -}+{- This implementation is highly GHC specific -}+module Scripting.Lua.Chunk.Endianness (+ isLittleEndian,+ isBigEndian+) where++import CustomPrelude++import Foreign.Marshal.Alloc (alloca)+import Foreign.Ptr (Ptr, castPtr)+import Foreign.Storable (peek, poke)+import System.IO.Unsafe (unsafePerformIO)++endianCheck :: Word8+endianCheck = unsafePerformIO $ alloca $ \p -> poke p (0x01020304::Word32) >> peek (castPtr p::Ptr Word8)++isLittleEndian :: Bool+isLittleEndian = endianCheck == 4++isBigEndian :: Bool+isBigEndian = endianCheck == 1+
+ src/Scripting/Lua/Chunk/IEEE754.hs view
@@ -0,0 +1,42 @@+{-# LANGUAGE MagicHash #-}+{- Fast Parsing and writing IEEE Double values to/from ByteStrings -}+{- NOTE: This implementation is GHC specific -}+{- For portable (50-100x slower) versions, use data-binary-ieee754 -}+module Scripting.Lua.Chunk.IEEE754+ ( encodeIEEEDouble+ , decodeIEEEDouble+ ) where++import CustomPrelude++import qualified Data.ByteString.Lazy as BS+import Data.Binary.Put (runPut, putWord64be, putWord64le)+import Data.Binary.Get (runGet, getWord64be, getWord64le)++import GHC.Prim (unsafeCoerce#)+import GHC.Types (Double(D#))+import GHC.Word (Word64(W64#))++-- | Read a 64-bit double in supplied endianness format+decodeIEEEDouble :: Bool -> BS.ByteString -> Double+decodeIEEEDouble littleEndian = word64ToDouble . bytestringToWord64 littleEndian++-- | Write a 64-bit double to supplied endianness format+encodeIEEEDouble :: Bool -> Double -> BS.ByteString+encodeIEEEDouble littleEndian = word64ToBytestring littleEndian . doubleToWord64++-- Conversion to and from IEE754 representation for numbers+-- Assumes that Double values are stored in IEEE 754 format (always true for GHC)+-- and that the endianness of the word matches that of the system+word64ToDouble :: Word64 -> Double+word64ToDouble (W64# x) = D# (unsafeCoerce# x)+doubleToWord64 :: Double -> Word64+doubleToWord64 (D# x) = W64# (unsafeCoerce# x)++-- Bytestring <-> Word64 conversion functions+bytestringToWord64 :: Bool -> BS.ByteString -> Word64+bytestringToWord64 littleEndian = runGet $ if littleEndian then getWord64le else getWord64be+word64ToBytestring :: Bool -> Word64 -> BS.ByteString+word64ToBytestring littleEndian = runPut . if littleEndian then putWord64le else putWord64be++
+ src/Scripting/Lua/Chunk/Reader.hs view
@@ -0,0 +1,302 @@+-- Decoder for Lua Chunks+-- Lua 5.1 Only++module Scripting.Lua.Chunk.Reader (+ parseChunk+) where++import CustomPrelude++import qualified Data.ByteString as BS+import Data.ByteString.Lazy (fromChunks)+import qualified Data.Text as T+import Data.Text.Encoding (encodeUtf8, decodeUtf8)+import Data.Bits (testBit)+import qualified Data.Attoparsec as A++import Scripting.Lua.Chunk.Types+import Scripting.Lua.Chunk.Endianness+import Scripting.Lua.Chunk.IEEE754+import Scripting.Lua.Chunk.BitUtils+++---------------------------------+-- P A R S I N G C H U N K S --+---------------------------------++-- | Parse a Bytestring into a Chunk+parseChunk :: BS.ByteString -> Chunk+parseChunk bs = case A.parse chunk bs of+ A.Done _ x -> x+ A.Fail _ _ e -> error e+ A.Partial _ -> error "Incomplete input"++-- Parse a chunk+chunk :: A.Parser Chunk+chunk = do+ h <- header+ f <- func h+ return $ Chunk h f++-- Parse and validate the header+-- TODO: Make the header configuration flexible+header :: A.Parser Header+header = do+ -- Header signature+ sig <- A.take 4+ unless (sig == encodeStr "\ESCLua") $ error "Invalid header signature"+ -- Chunk Version+ ver <- A.anyWord8+ unless (ver == 0x51) $ error "Invalid version. Please use Luac version 5.1"+ let majorVer = 5+ let minorVer = 1+ -- Format Version+ fver <- A.anyWord8+ unless (fver == 0) $ error "Invalid format version. Please use the official version"+ -- Endianness+ endianness <- A.anyWord8+ let be = endianness == 0+ -- Size of Int+ intSize <- A.anyWord8+ unless (intSize == 4) $ error "Invalid size of Int. Please make sure you are on a 32 bit machine"+ -- Size of size_t+ sizeTSize <- A.anyWord8+ unless (sizeTSize == 4) $ error "Invalid size of size_t. Please make sure you are on a 32 bit machine"+ -- Size of Instruction+ instrSize <- A.anyWord8+ unless (instrSize == 4) $ error "Invalid size of Instruction. Standard Lua instructions are 4 Bytes."+ -- Size of Number+ numSize <- A.anyWord8+ unless (numSize == 8) $ error "Invalid size of Number. A number must be 8 bytes (Word64 in length)"+ -- Integral+ integral <- A.anyWord8+ unless (integral == 0) $ error "Floating point math must be supported"+ let im = False+ return $ Header+ majorVer+ minorVer+ (fromIntegral fver)+ be+ (fromIntegral intSize)+ (fromIntegral sizeTSize)+ (fromIntegral instrSize)+ (fromIntegral numSize)+ im+++-- Parse a Function+func :: Header -> A.Parser Func+func h = do+ fh <- funcHeader h+ li <- listInstr h+ cs <- listConst h+ fs <- listFunc h+ ls <- listLine h+ locs <- listLocal h+ us <- listUpval h+ return $ Func fh li cs fs ls locs us++-- Parse a function header+funcHeader :: Header -> A.Parser FuncHeader+funcHeader h = do+ -- Source name+ sname <- str h+ -- Start Line+ sl <- intP $ sizeOfInt h+ -- End line+ el <- intP $ sizeOfInt h+ -- Number of up values+ nupx <- A.anyWord8+ let nup = fromIntegral nupx+ -- Number of params+ npx <- A.anyWord8+ let nparams = fromIntegral npx+ -- Vararg flags+ varx <- A.anyWord8+ let isVarargx = testBit varx 0+ let isCompatVarargx = testBit varx 1+ let needsArgx = testBit varx 2+ -- Maximum stack size+ maxx <- A.anyWord8+ let maxss = fromIntegral maxx+ return $ FuncHeader+ sname+ sl+ el+ nup+ nparams+ isVarargx+ isCompatVarargx+ needsArgx+ maxss++-- Parse a list of instructions+listInstr :: Header -> A.Parser [Instruction]+listInstr h = do+ n <- intP $ sizeOfInt h+ replicateM n instr+++-- Parse an instruction+instr :: A.Parser Instruction+instr = do+ -- Instructions are always 4 bytes in standard Lua+ x <- intP 4+ let op = bitRange 0 6 x+ let a = bitRange 6 14 x+ let c = bitRange 14 23 x+ let b = bitRange 23 32 x+ let bx = bitRange 14 32 x+ -- Formula: sBx = Bx - MAX/2 where MAX = 2*31 = 2147483648+ -- HOWEVER, Looking at the Lua sources, we realise that the number to use is 2^17-1 = 131071+ let sbx = bx - 131071+ return $+ case op of+ 0 -> OP_MOVE a b+ 1 -> OP_LOADK a bx+ 2 -> OP_LOADBOOL a b c+ 3 -> OP_LOADNIL a b+ 4 -> OP_GETUPVAL a b+ 5 -> OP_GETGLOBAL a bx+ 6 -> OP_GETTABLE a b c+ 7 -> OP_SETGLOBAL a bx+ 8 -> OP_SETUPVAL a b+ 9 -> OP_SETTABLE a b c+ 10 -> OP_NEWTABLE a b c+ 11 -> OP_SELF a b c+ 12 -> OP_ADD a b c+ 13 -> OP_SUB a b c+ 14 -> OP_MUL a b c+ 15 -> OP_DIV a b c+ 16 -> OP_MOD a b c+ 17 -> OP_POW a b c+ 18 -> OP_UNM a b+ 19 -> OP_NOT a b+ 20 -> OP_LEN a b+ 21 -> OP_CONCAT a b c+ 22 -> OP_JMP sbx+ 23 -> OP_EQ a b c+ 24 -> OP_LT a b c+ 25 -> OP_LE a b c+ 26 -> OP_TEST a c+ 27 -> OP_TESTSET a b c+ 28 -> OP_CALL a b c+ 29 -> OP_TAILCALL a b c+ 30 -> OP_RETURN a b+ 31 -> OP_FORLOOP a sbx+ 32 -> OP_FORPREP a sbx+ 33 -> OP_TFORLOOP a c+ 34 -> OP_SETLIST a b c+ 35 -> OP_CLOSE a+ 36 -> OP_CLOSURE a bx+ 37 -> OP_VARARG a b+ _ -> error "Unrecognised opcode"+++-- List of constants+listConst :: Header -> A.Parser [Constant]+listConst h = do+ n <- intP $ sizeOfInt h+ replicateM n (constant h)++-- A Constant+constant :: Header -> A.Parser Constant+constant h = do+ typ <- A.anyWord8+ case typ of+ 0 -> return CNil+ 1 -> liftM CBool boolean+ -- NOTE: Constant type 2 is not used+ 3 -> liftM CNum $ number h+ 4 -> do+ s <- str h+ case s of+ Nothing -> error "Null string encountered in constants section"+ Just si -> return $ CStr si+ _ -> error $ "Unrecognised constant type: " ++ T.unpack (show typ)+++-- List of Functions+listFunc :: Header -> A.Parser [Func]+listFunc h = do+ n <- intP $ sizeOfInt h+ replicateM n (func h)++-- List of Lines+listLine :: Header -> A.Parser [Line]+listLine h = do+ n <- intP $ sizeOfInt h+ replicateM n (intP 4)++-- List of Locals+listLocal :: Header -> A.Parser [Local]+listLocal h = do+ n <- intP $ sizeOfInt h+ replicateM n (local h)++-- Parsed Local+local :: Header -> A.Parser Local+local h = do+ s <- str h+ case s of+ Nothing -> error "Unnamed local variable encountered!"+ Just si -> do+ startpc <- intP $ sizeOfInt h+ endpc <- intP $ sizeOfInt h+ return $ Local si startpc endpc++-- List of Upvals+listUpval :: Header -> A.Parser [Upval]+listUpval h = do+ n <- intP $ sizeOfInt h+ replicateM n ss+ where+ ss = do+ s <- str h+ return $ fromMaybe (error "Unnamed upval encountered!") s+++-- Parse a Boolean+boolean :: A.Parser Bool+boolean = do+ b <- A.anyWord8+ return $+ case b of+ 0 -> False+ _ -> True++number :: Header -> A.Parser Double+number h = do+ w64bs <- A.take $ sizeOfNumber h+ return $ decodeIEEEDouble (not $ bigEndian h) $ fromChunks [w64bs]++-- Parse a String+str :: Header -> A.Parser (Maybe T.Text)+str h = do+ n <- intP $ sizeOfSizeT h+ -- when (n /= 11) $ error $ show n+ if n<=0+ then return Nothing+ else do+ bs <- A.take (n-1)+ -- Trailing null+ A.word8 0+ return $ Just $ decodeStr bs+++-- Parse an Integer+-- The endianness is taken from the system+intP :: Int -> A.Parser Int+intP n = do+ bs <- replicateM n A.anyWord8+ let bsn = map fromIntegral $ trans bs+ return $ foldr (\b p -> p*256 + b) 0 bsn+ where+ trans = if isBigEndian then reverse else id++-- Convert Text to ByteString+encodeStr :: T.Text -> BS.ByteString+encodeStr = encodeUtf8+decodeStr :: BS.ByteString -> T.Text+decodeStr = decodeUtf8+
+ src/Scripting/Lua/Chunk/Types.hs view
@@ -0,0 +1,167 @@+-- Lua Chunk AST+-- Lua 5.1 Only++module Scripting.Lua.Chunk.Types+ ( Chunk(..)+ , Header(..)+ , Func(..)+ , FuncHeader(..)+ , Instruction(..)+ , FA, FB, FC, FBx, FsBx, FAx+ , Constant(..)+ , Line+ , Local(..)+ , Upval+ ) where++import CustomPrelude++import qualified Data.Text as T++-----------------------------------+-- D A T A S T R U C T U R E S --+-----------------------------------++-- | A Parsed chunk+data Chunk = Chunk+ { chunkHeader :: Header -- ^ Parsed Header+ , chunkFunc :: Func -- ^ Parsed Main Function+ } deriving Show++-- | A Parsed Header+data Header = Header+ { versionMajor :: Int -- ^ Major version number (5)+ , versionMinor :: Int -- ^ Minor version number (1)+ , formatVersion :: Int -- ^ 0 = Official Format+ , bigEndian :: Bool -- ^ Default : False (little endian)+ , sizeOfInt :: Int -- ^ In Bytes (4)+ , sizeOfSizeT :: Int -- ^ In Bytes (4)+ , sizeOfInstruction :: Int -- ^ In Bytes (4)+ , sizeOfNumber :: Int -- ^ In Bytes (8)+ , intMath :: Bool -- ^ Number Type is Integral. Default : False (Floating Point Math)+ } deriving Show++-- | A Parsed Function+data Func = Func+ { fHeader :: FuncHeader -- ^ Header Data+ , fInstrs :: [Instruction] -- ^ List of instructions (code)+ , fConsts :: [Constant] -- ^ List of constants+ , fNested :: [Func] -- ^ List of function prototypes+ , fLines :: [Line] -- ^ Source line positions (optional debug data)+ , fLocals :: [Local] -- ^ List of locals (optional debug data)+ , fUpvals :: [Upval] -- ^ List of upvalues (optional debug data)+ }+ deriving Show++-- | A Parsed Function Header+data FuncHeader = FuncHeader+ { sourceName :: Maybe T.Text -- ^ Name of SourceFile+ , lineStart :: Int -- ^ Line number where the function starts+ , lineEnd :: Int -- ^ Line number where the function ends+ , numOfUpvalues :: Int -- ^ Number of upvalues+ , numOfParams :: Int -- ^ Number of parameters+ , isVararg :: Bool -- ^ Whether this is vararg (Default : False)+ , isCompatVararg :: Bool -- ^ Whether LUA_COMPAT_VARARG is defined+ , needsArg :: Bool -- ^ Whether it uses old style arguments i.e. arg instead of ... (Default :: False)+ , stackSize :: Int -- ^ Maximum number of registers used+ } deriving Show++-- | A Parsed VM Instruction+-- ** R(x) - register+-- ** Kst(x) - constant (in constant table)+-- ** RK(x) == if ISK(x) then Kst(INDEXK(x)) else R(x)+data Instruction+ = OP_MOVE FA FB -- ^ R(A) := R(B)+ | OP_LOADK FA FBx -- ^ R(A) := Kst(Bx)+ | OP_LOADBOOL FA FB FC -- ^ R(A) := (Bool)B; if (C) pc+++ | OP_LOADNIL FA FB -- ^ R(A), R(A+1), ..., R(A+B) := nil+ | OP_GETUPVAL FA FB -- ^ R(A) := UpValue[B]++ | OP_GETGLOBAL FA FBx -- ^ R(A) := Gbl[Kst(Bx)]+ | OP_GETTABLE FA FB FC -- ^ R(A) := R(B)[RK(C)]++ | OP_SETGLOBAL FA FBx -- Gbl[Kst(Bx)] := R(A)+ | OP_SETUPVAL FA FB -- ^ UpValue[B] := R(A)+ | OP_SETTABLE FA FB FC -- ^ R(A)[RK(B)] := RK(C)++ | OP_NEWTABLE FA FB FC -- ^ R(A) := {} (size = B,C)++ | OP_SELF FA FB FC -- ^ R(A+1) := R(B); R(A) := R(B)[RK(C)]++ | OP_ADD FA FB FC -- ^ R(A) := RK(B) + RK(C)+ | OP_SUB FA FB FC -- ^ R(A) := RK(B) - RK(C)+ | OP_MUL FA FB FC -- ^ R(A) := RK(B) * RK(C)+ | OP_DIV FA FB FC -- ^ R(A) := RK(B) / RK(C)+ | OP_MOD FA FB FC -- ^ R(A) := RK(B) % RK(C)+ | OP_POW FA FB FC -- ^ R(A) := RK(B) ^ RK(C)+ | OP_UNM FA FB -- ^ R(A) := -R(B)+ | OP_NOT FA FB -- ^ R(A) := not R(B)+ | OP_LEN FA FB -- ^ R(A) := length of R(B)++ | OP_CONCAT FA FB FC -- ^ R(A) := R(B).. ... ..R(C)++ | OP_JMP FsBx -- ^ pc+=sBx++ | OP_EQ FA FB FC -- ^ if ((RK(B) == RK(C)) ~= A) then pc+++ | OP_LT FA FB FC -- ^ if ((RK(B) < RK(C)) ~= A) then pc+++ | OP_LE FA FB FC -- ^ if ((RK(B) <= RK(C)) ~= A) then pc++++ | OP_TEST FA FC -- ^ if not (R(A) <=> C) then pc+++ | OP_TESTSET FA FB FC -- ^ if (R(B) <=> C) then R(A) := R(B) else pc++++ | OP_CALL FA FB FC -- ^ R(A), ... ,R(A+C-2) := R(A)(R(A+1), ... ,R(A+B-1))+ | OP_TAILCALL FA FB FC -- ^ return R(A)(R(A+1), ... ,R(A+B-1))+ | OP_RETURN FA FB -- ^ return R(A), ... ,R(A+B-2) (see note)++ | OP_FORLOOP FA FsBx -- ^ R(A)+=R(A+2); if R(A) <?= R(A+1) then { pc+=sBx; R(A+3)=R(A) }++ | OP_FORPREP FA FsBx -- ^ R(A)-=R(A+2); pc+=sBx++ | OP_TFORLOOP FA FC -- ^ R(A+3), ... ,R(A+2+C) := R(A)(R(A+1), R(A+2)); if R(A+3) ~= nil then R(A+2)=R(A+3) else pc++++ | OP_SETLIST FA FB FC -- ^ R(A)[(C-1)*FPF+i] := R(A+i), 1 <= i <= B++ | OP_CLOSE FA -- ^ close all variables in the stack up to (>=) R(A)+ | OP_CLOSURE FA FBx -- ^ R(A) := closure(KPROTO[Bx], R(A), ... ,R(A+n))++ | OP_VARARG FA FB -- ^ R(A), R(A+1), ..., R(A+B-2) = vararg++ deriving Show+++-- | Parsed opcode fields+type FA = Int+-- | Parsed opcode fields+type FB = Int+-- | Parsed opcode fields+type FC = Int+-- | Parsed opcode fields+type FBx = Int+-- | Parsed opcode fields+type FsBx = Int+-- | Parsed opcode fields+type FAx = Int++-- | Parsed Constants+data Constant+ = CNil -- ^ Nil Value+ | CBool Bool -- ^ Boolean Value+ | CNum Double -- ^ Numeric Value+ | CStr T.Text -- ^ String Value++ deriving Show+++-- DEBUG information present in chunks++-- | Line Numbers for each instruction+type Line = Int++-- | Local variables = Local <VarName> <StartPC> <EndPC>+-- where StartPC and EndPC denote the scope in which the local is active+data Local = Local T.Text Int Int deriving Show++-- | Upvalue names used in the function+type Upval = T.Text++
+ src/Scripting/Lua/Chunk/Writer.hs view
@@ -0,0 +1,237 @@+-- Outputs a Lua chunk from the AST+-- Lua 5.1 only++module Scripting.Lua.Chunk.Writer (+ generateChunk+) where++import CustomPrelude++import qualified Data.ByteString as BS+import Data.ByteString.Lazy (toChunks)+import Data.ByteString.Char8 () -- Only import the IsString instance for ByteStrings+import Data.Bits (testBit, clearBit, setBit, (.|.))+import qualified Data.Text as T+import Data.Text.Encoding (encodeUtf8)++import Scripting.Lua.Chunk.Types+import Scripting.Lua.Chunk.IEEE754 (encodeIEEEDouble)++generateChunk :: Chunk -> BS.ByteString+generateChunk c = BS.concat+ [ generateChunkHeader header+ , generateFunc header func+ ]+ where+ header = chunkHeader c+ func = chunkFunc c++generateChunkHeader :: Header -> BS.ByteString+generateChunkHeader h = BS.concat+ [ generateHeaderSignature+ , generateVersion (versionMajor h) (versionMinor h)+ , generateIntByte $ formatVersion h+ , generateBoolByte $ not $ bigEndian h+ , generateIntByte $ sizeOfInt h+ , generateIntByte $ sizeOfSizeT h+ , generateIntByte $ sizeOfInstruction h+ , generateIntByte $ sizeOfNumber h+ , generateBoolByte $ intMath h+ ]++generateFunc :: Header -> Func -> BS.ByteString+generateFunc h f = BS.concat+ [ generateFuncHeader $ fHeader f+ , generateFuncInstrs $ fInstrs f+ , generateFuncConsts h $ fConsts f+ , generateFuncNested h $ fNested f+ , generateFuncLines $ fLines f+ , generateFuncLocals $ fLocals f+ , generateFuncUpvals $ fUpvals f+ ]++generateFuncHeader :: FuncHeader -> BS.ByteString+generateFuncHeader f = BS.concat+ [ generateMaybeStr $ sourceName f+ , generateIntWord $ lineStart f+ , generateIntWord $ lineEnd f+ , generateIntByte $ numOfUpvalues f+ , generateIntByte $ numOfParams f+ , generateIsVararg (isVararg f) (isCompatVararg f) (needsArg f)+ , generateIntByte $ stackSize f+ ]++generateFuncInstrs :: [Instruction] -> BS.ByteString+generateFuncInstrs is = BS.concat+ ( generateIntWord (length is)+ : map generateInstr is+ )++generateInstr :: Instruction -> BS.ByteString+generateInstr i =+ case i of+ OP_MOVE a b -> generateInstrAB 0 a b+ OP_LOADK a bx -> generateInstrABx 1 a bx+ OP_LOADBOOL a b c -> generateInstrABC 2 a b c+ OP_LOADNIL a b -> generateInstrAB 3 a b+ OP_GETUPVAL a b -> generateInstrAB 4 a b+ OP_GETGLOBAL a bx -> generateInstrABx 5 a bx+ OP_GETTABLE a b c -> generateInstrABC 6 a b c+ OP_SETGLOBAL a bx -> generateInstrABx 7 a bx+ OP_SETUPVAL a b -> generateInstrAB 8 a b+ OP_SETTABLE a b c -> generateInstrABC 9 a b c+ OP_NEWTABLE a b c -> generateInstrABC 10 a b c+ OP_SELF a b c -> generateInstrABC 11 a b c+ OP_ADD a b c -> generateInstrABC 12 a b c+ OP_SUB a b c -> generateInstrABC 13 a b c+ OP_MUL a b c -> generateInstrABC 14 a b c+ OP_DIV a b c -> generateInstrABC 15 a b c+ OP_MOD a b c -> generateInstrABC 16 a b c+ OP_POW a b c -> generateInstrABC 17 a b c+ OP_UNM a b -> generateInstrAB 18 a b+ OP_NOT a b -> generateInstrAB 19 a b+ OP_LEN a b -> generateInstrAB 20 a b+ OP_CONCAT a b c -> generateInstrABC 21 a b c+ OP_JMP sbx -> generateInstrsBx 22 sbx+ OP_EQ a b c -> generateInstrABC 23 a b c+ OP_LT a b c -> generateInstrABC 24 a b c+ OP_LE a b c -> generateInstrABC 25 a b c+ OP_TEST a c -> generateInstrAC 26 a c+ OP_TESTSET a b c -> generateInstrABC 27 a b c+ OP_CALL a b c -> generateInstrABC 28 a b c+ OP_TAILCALL a b c -> generateInstrABC 29 a b c+ OP_RETURN a b -> generateInstrAB 30 a b+ OP_FORLOOP a sbx -> generateInstrAsBx 31 a sbx+ OP_FORPREP a sbx -> generateInstrAsBx 32 a sbx+ OP_TFORLOOP a c -> generateInstrAC 33 a c+ OP_SETLIST a b c -> generateInstrABC 34 a b c+ OP_CLOSE a -> generateInstrA 35 a+ OP_CLOSURE a bx -> generateInstrABx 36 a bx+ OP_VARARG a b -> generateInstrAB 37 a b+++generateHeaderSignature :: BS.ByteString+generateHeaderSignature = encodeStr "\ESCLua"++-- Assumes Little Endian format+generateVersion :: Int -> Int -> BS.ByteString+generateVersion major minor = concatbits 2 $ genbits 4 minor ++ genbits 4 major++generateIntByte :: Int -> BS.ByteString+generateIntByte = copybytes 1++generateIntWord :: Int -> BS.ByteString+generateIntWord = copybytes 4++generateBoolByte :: Bool -> BS.ByteString+generateBoolByte True = copybytes 1 1+generateBoolByte False = copybytes 1 0++generateIsVararg :: Bool -> Bool -> Bool -> BS.ByteString+generateIsVararg isVarargx isCompatVarargx needsArgx = BS.pack [i1 .|. i2 .|. i3]+ where+ i1 = if isVarargx then 1 else 0+ i2 = if isCompatVarargx then 2 else 0+ i3 = if needsArgx then 4 else 0++generateFuncConsts :: Header -> [Constant] -> BS.ByteString+generateFuncConsts h cs = BS.concat+ ( generateIntWord (length cs)+ : map (generateConst h) cs+ )++generateConst :: Header -> Constant -> BS.ByteString+generateConst _ CNil = generateIntByte 0+generateConst _ (CBool True) = BS.concat [generateIntByte 1, generateIntByte 1]+generateConst _ (CBool False) = BS.concat [generateIntByte 1, generateIntByte 0]+generateConst h (CNum n) = BS.concat [generateIntByte 3, BS.concat $ toChunks $ encodeIEEEDouble (not $ bigEndian h) n]+generateConst _ (CStr s) = BS.concat [generateIntByte 4, generateStr s]++generateFuncNested :: Header -> [Func] -> BS.ByteString+generateFuncNested h fs = BS.concat+ ( generateIntWord (length fs)+ : map (generateFunc h) fs+ )++generateFuncLines :: [Line] -> BS.ByteString+generateFuncLines ls = BS.concat+ ( generateIntWord (length ls)+ : map generateIntWord ls+ )++generateFuncLocals :: [Local] -> BS.ByteString+generateFuncLocals ls = BS.concat+ ( generateIntWord (length ls)+ : map generateLocal ls+ )++generateLocal :: Local -> BS.ByteString+generateLocal (Local s spc epc) = BS.concat+ [ generateStr s+ , generateIntWord spc+ , generateIntWord epc+ ]++generateFuncUpvals :: [Upval] -> BS.ByteString+generateFuncUpvals us = BS.concat+ ( generateIntWord (length us)+ : map generateStr us+ )++generateMaybeStr :: Maybe T.Text -> BS.ByteString+generateMaybeStr Nothing = generateIntWord 0+generateMaybeStr (Just s) = generateStr s++generateStr :: T.Text -> BS.ByteString+generateStr s = BS.concat [generateIntWord (1 + T.length s), encodeStr (T.append s "\0")]++-- Instruction Generators+generateInstrABC :: Int -> Int -> Int -> Int -> BS.ByteString+generateInstrABC op a b c = concatbits 4 $ genbits 6 op ++ genbits 8 a ++ genbits 9 c ++ genbits 9 b++generateInstrA :: Int -> Int -> BS.ByteString+generateInstrA op a = generateInstrABC op a 0 0++generateInstrAB :: Int -> Int -> Int -> BS.ByteString+generateInstrAB op a b = generateInstrABC op a b 0++generateInstrAC :: Int -> Int -> Int -> BS.ByteString+generateInstrAC op a = generateInstrABC op a 0++generateInstrABx :: Int -> Int -> Int -> BS.ByteString+generateInstrABx op a bx = concatbits 4 $ genbits 6 op ++ genbits 8 a ++ genbits 18 bx++-- Formula: Bx = sBx + MAX/2 where MAX = 2*31+generateInstrAsBx :: Int -> Int -> Int -> BS.ByteString+generateInstrAsBx op a sbx = concatbits 4 $ genbits 6 op ++ genbits 8 a ++ genbits 18 (sbx + 2147483648)+generateInstrsBx :: Int -> Int -> BS.ByteString+generateInstrsBx op sbx = concatbits 4 $ genbits 6 op ++ genbits 8 0 ++ genbits 18 (sbx + 2147483648)++genbits :: Int -> Int -> [Bool]+genbits count x = genbits' 0+ where+ genbits' bit+ | bit >= count = []+ | otherwise = testBit x bit : genbits' (bit+1)++-- Creates a word of specified number of BYTES out of the list of bit values (booleans)+concatbits :: Int -> [Bool] -> BS.ByteString+concatbits n = BS.pack . map (foldl bitset 0 . zip [0..]) . splitN 8 . take (8*n)+ where+ bitset :: Word8 -> (Int, Bool) -> Word8+ bitset x (i,True) = setBit x i+ bitset x (i,False) = clearBit x i++-- Copies n bytes from an integer to a ByteString+copybytes :: Int -> Int -> BS.ByteString+copybytes n = concatbits n . genbits (n*8)++-- Split a string at regular intervals+splitN :: Int -> [a] -> [[a]]+splitN _ [] = []+splitN n xs = let (y1, y2) = splitAt n xs in y1 : splitN n y2++-- Convert Text to ByteString+encodeStr :: T.Text -> BS.ByteString+encodeStr = encodeUtf8+