erlang (empty) → 0.1
raw patch · 11 files changed
+1472/−0 lines, 11 filesdep +basedep +binarydep +bytestringsetup-changed
Dependencies added: base, binary, bytestring, directory, filepath, nano-md5, network, random
Files
- COPYING +674/−0
- Setup.lhs +3/−0
- erlang.cabal +37/−0
- src/Foreign/Erlang.lhs +36/−0
- src/Foreign/Erlang/Network.lhs +213/−0
- src/Foreign/Erlang/OTP.lhs +7/−0
- src/Foreign/Erlang/OTP/GenServer.lhs +35/−0
- src/Foreign/Erlang/OTP/Mnesia.lhs +46/−0
- src/Foreign/Erlang/Processes.lhs +198/−0
- src/Foreign/Erlang/Types.lhs +199/−0
- src/Foreign/Erlang/Utilities.lhs +24/−0
+ COPYING view
@@ -0,0 +1,674 @@+ 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.lhs view
@@ -0,0 +1,3 @@+#!/usr/bin/env runhaskell+> import Distribution.Simple+> main = defaultMain
+ erlang.cabal view
@@ -0,0 +1,37 @@+name: erlang+version: 0.1+stability: alpha+description:+ Speaks the Erlang network protocol and impersonates an Erlang node+ on the network. Fully capable of bi-directional communication with+ Erlang. Erlang types are, as far as reasonable, mapped to Haskell+ types. Messages to Erlang are just function calls in Haskell, and+ messages from Erlang are delivered to MVars.+license: GPL+license-file: COPYING+author: Eric Sessoms <nubgames@gmail.com>+maintainer: nubgames@gmail.com+homepage: http://github.com/esessoms/haskell-interface+category: Foreign+synopsis: FFI interface to Erlang.+cabal-version: >= 1.2+build-type: Simple++library+ build-depends: base,+ binary >= 0.4.4,+ bytestring,+ directory,+ filepath,+ nano-md5 >= 0.1.2,+ network >= 2.2.0.1,+ random >= 1.0.0.1+ exposed-modules: Foreign.Erlang+ other-modules: Foreign.Erlang.Network,+ Foreign.Erlang.OTP,+ Foreign.Erlang.OTP.GenServer,+ Foreign.Erlang.OTP.Mnesia,+ Foreign.Erlang.Processes,+ Foreign.Erlang.Types,+ Foreign.Erlang.Utilities+ hs-source-dirs: src
+ src/Foreign/Erlang.lhs view
@@ -0,0 +1,36 @@+> -----------------------------------------------------------------------------+> -- |+> -- Module : Foreign.Erlang+> -- Copyright : Eric Sessoms+> -- License : GPL3 (see COPYING)+> -- +> -- Maintainer : Eric Sessoms <nubgames@gmail.com>+> -- Stability : alpha+> -- Portability : portable+> --+> -- Speaks the Erlang network protocol and impersonates an Erlang node+> -- on the network. Fully capable of bi-directional communication with+> -- Erlang. Erlang types are, as far as reasonable, mapped to Haskell+> -- types. Messages to Erlang are just function calls in Haskell, and+> -- messages from Erlang are delivered to MVars.+> --+> -----------------------------------------------------------------------------++> module Foreign.Erlang (+> module Foreign.Erlang.Network+> , module Foreign.Erlang.OTP+> , module Foreign.Erlang.Processes+> , module Foreign.Erlang.Types+> , module Foreign.Erlang.Utilities+> ) where++> import Foreign.Erlang.Network hiding (toNetwork)+> import Foreign.Erlang.OTP+> import Foreign.Erlang.Processes+> import Foreign.Erlang.Utilities+> +> import Foreign.Erlang.Types hiding (+> getA, getC, getErl, getN, geta, getn+> , putA, putC, putErl, putN, puta, putn+> , tag+> )
+ src/Foreign/Erlang/Network.lhs view
@@ -0,0 +1,213 @@+> module Foreign.Erlang.Network (+> -- * Low-level communication with the Erlang Port-Mapper Daemon.+> epmdGetNames+> , epmdGetPort+> , epmdGetPortR4+> +> , ErlRecv+> , ErlSend+> , erlConnect+> , toNetwork+> ) where++> import Control.Exception (assert, bracketOnError)+> import Control.Monad (liftM)+> import Data.Binary (decode, encode)+> import Data.Binary.Get+> import Data.Binary.Put+> import Data.Bits ((.|.))+> import Data.Char (chr, ord)+> import Data.Digest.OpenSSL.MD5 (md5sum)+> import Data.List (unfoldr)+> import Data.Word+> import Foreign.Erlang.Types+> import Network (PortID(..), connectTo, withSocketsDo)+> import Network.Socket (PortNumber(..))+> import Numeric (readHex)+> import System.Directory (getHomeDirectory)+> import System.FilePath ((</>))+> import System.IO+> import System.IO.Unsafe (unsafePerformIO)+> import System.Random (randomIO)+> import qualified Data.ByteString.Char8 as C+> import qualified Data.ByteString.Lazy.Char8 as B++> erlangVersion = 5+> erlangProtocolVersion = 131+> passThrough = 'p'++> flagPublished = 0x01+> flagAtomCache = 0x02+> flagExtendedReferences = 0x04+> flagDistMonitor = 0x08+> flagFunTags = 0x10+> flagDistMonitorName = 0x20+> flagHiddenAtomCache = 0x40+> flagNewFunTags = 0x80+> flagExtendedPidsPorts = 0x100++> getUserCookie = do+> home <- getHomeDirectory+> readFile $ home </> ".erlang.cookie"++> toNetwork :: Int -> Integer -> [Word8]+> toNetwork b n = reverse . take b $ unfoldr toNetwork' n ++ repeat 0+> where+> toNetwork' 0 = Nothing+> toNetwork' n = let (b, a) = n `divMod` 256 in Just (fromIntegral a, b)++> ntohs n = let (b, a) = n `divMod` 256 in 256*a + b++> erlDigest :: String -> Word32 -> [Word8]+> erlDigest cookie challenge = let+> [(n, _)] = readHex . md5sum . C.pack $ cookie ++ show challenge+> in toNetwork 16 n++> packn, packN :: B.ByteString -> Put+> packn msg = putn (fromIntegral . B.length $ msg) >> putLazyByteString msg+> packN msg = putN (fromIntegral . B.length $ msg) >> putLazyByteString msg++> sendMessage :: (B.ByteString -> Put) -> (B.ByteString -> IO ()) -> B.ByteString -> IO ()+> sendMessage pack out = out . runPut . pack++> recvMessage :: Int -> (Int -> IO B.ByteString) -> IO B.ByteString+> recvMessage hdrlen inf = (liftM (unpack hdrlen) $ inf hdrlen) >>= inf+> where+> unpack 2 = runGet getn+> unpack 4 = runGet getN++> type ErlSend = (Maybe ErlType, Maybe ErlType) -> IO ()+> type ErlRecv = IO (Maybe ErlType, Maybe ErlType)+ +> erlSend :: (B.ByteString -> IO ()) -> ErlSend+> erlSend send (Nothing, _) = send B.empty+> erlSend send (Just ctl, msg) = send . runPut $ do+> tag passThrough+> putMsg ctl+> maybe (return ()) putMsg msg+> where+> putMsg msg = do+> putC erlangProtocolVersion+> putErl msg+ +> erlRecv :: IO B.ByteString -> ErlRecv+> erlRecv recv = do+> bytes <- recv+> return . flip runGet bytes $ do+> empty <- isEmpty+> if empty+> then return (Nothing, Nothing)+> else do+> pt <- getC+> assert (chr pt == passThrough) $ return ()+> ctl <- getMsg+> empty <- isEmpty+> if empty+> then return (Just ctl, Nothing)+> else case ctl of+> ErlTuple (ErlInt n:_) | n `elem` [2, 6] -> do+> msg <- getMsg+> return (Just ctl, Just msg)+> _ -> return (Just ctl, Nothing)+> where+> getMsg = do+> ver <- getC+> assert (ver == erlangProtocolVersion) $ getErl++> erlConnect :: String -> String -> IO (ErlSend, ErlRecv)+> erlConnect self node = withSocketsDo $ do+> port <- epmdGetPort node+> let port' = PortNumber (PortNum . fromIntegral . ntohs $ port)+> bracketOnError+> (connectTo epmdHost port' >>= \h -> hSetBuffering h NoBuffering >> return h)+> hClose $ \h -> do+> let out = sendMessage packn (B.hPut h)+> let inf = recvMessage 2 (B.hGet h)+> handshake out inf self+> let out' = sendMessage packN (\s -> B.hPut h s >> hFlush h)+> let inf' = recvMessage 4 (B.hGet h)+> return (erlSend out', erlRecv inf')++> handshake :: (B.ByteString -> IO ()) -> IO B.ByteString -> String -> IO ()+> handshake out inf self = do+> cookie <- getUserCookie+> sendName+> recvStatus+> challenge <- recvChallenge+> let reply = erlDigest cookie challenge+> challenge' <- liftM fromIntegral (randomIO :: IO Int)+> challengeReply reply challenge'+> recvChallengeAck cookie challenge'++> where+> sendName = out . runPut $ do+> tag 'n'+> putn erlangVersion+> putN $ flagExtendedReferences .|. flagExtendedPidsPorts+> putA self++> recvStatus = do+> msg <- inf+> assert ("sok" == B.unpack msg) $ return ()++> recvChallenge = do+> msg <- inf+> return . flip runGet msg $ do+> tag <- getC+> version <- getn+> flags <- getN+> challenge <- getWord32be+> return challenge++> challengeReply reply challenge = out . runPut $ do+> tag 'r'+> putWord32be challenge+> puta reply++> recvChallengeAck cookie challenge = do+> let digest = erlDigest cookie challenge+> msg <- inf+> let reply = take 16 . drop 1 . map (fromIntegral . ord) . B.unpack $ msg+> assert (digest == reply) $ return ()++> epmdHost = "127.0.0.1"+> epmdPort = Service "epmd"++> withEpmd = withSocketsDo . bracketOnError+> (connectTo epmdHost epmdPort >>= \h -> hSetBuffering h NoBuffering >> return h)+> hClose++> epmdSend :: String -> IO B.ByteString+> epmdSend msg = withEpmd $ \hdl -> do+> let out = runPut $ putn (length msg) >> putA msg+> B.hPut hdl out+> hFlush hdl+> B.hGetContents hdl++> -- | Return the names and addresses of all registered Erlang nodes.+> epmdGetNames :: IO [String]+> epmdGetNames = do+> reply <- epmdSend "n"+> let txt = runGet (getN >> liftM B.unpack getRemainingLazyByteString) reply+> return . lines $ txt++> -- | Return the port address of a named Erlang node.+> epmdGetPort :: String -> IO Int+> epmdGetPort name = do+> reply <- epmdSend $ 'p' : name+> return $ runGet getn reply++> -- | Returns (port, nodeType, protocol, vsnMax, vsnMin, name, extra)+> epmdGetPortR4 :: String -> IO (Int, Int, Int, Int, Int, String, String)+> epmdGetPortR4 name = do+> reply <- epmdSend $ 'z' : name+> return $ flip runGet reply $ do+> getn+> port <- getn+> nodeType <- getC+> protocol <- getC+> vsnMax <- getn+> vsnMin <- getn+> name <- getn >>= getA+> extra <- liftM B.unpack getRemainingLazyByteString+> return (port, nodeType, protocol, vsnMax, vsnMin, name, extra)
+ src/Foreign/Erlang/OTP.lhs view
@@ -0,0 +1,7 @@+> module Foreign.Erlang.OTP (+> module Foreign.Erlang.OTP.GenServer+> , module Foreign.Erlang.OTP.Mnesia+> ) where++> import Foreign.Erlang.OTP.GenServer+> import Foreign.Erlang.OTP.Mnesia
+ src/Foreign/Erlang/OTP/GenServer.lhs view
@@ -0,0 +1,35 @@+> module Foreign.Erlang.OTP.GenServer (+> -- * High-level communication.+> genCall+> , genCast+> , rpcCall+> , rpcCast+> ) where++> import Foreign.Erlang.Types (Erlang, ErlType(..))+> import Foreign.Erlang.Processes++> -- | gen_server:cast(Pid, Msg)++> genCast :: Erlang a => MBox -> Node -> Pid -> a -> IO ()+> genCast mbox node pid msg = mboxSend mbox node pid (ErlAtom "$gen_cast", msg)++> -- | gen_server:call(Pid, Msg)++> genCall :: Erlang a => MBox -> Node -> Pid -> a -> IO ErlType+> genCall mbox node pid msg = do+> ref <- mboxRef mbox+> mboxSend mbox node pid (ErlAtom "$gen_call", (mboxSelf mbox, ref), msg)+> mboxRecv' mbox ref++> -- | rpc:cast(Node, Module, Function, Arguments)++> rpcCast :: MBox -> Node -> String -> String -> [ErlType] -> IO ()+> rpcCast mbox node m f as = genCast mbox node (Right "rex") $+> (ErlAtom "cast", ErlAtom m, ErlAtom f, as, mboxSelf mbox)++> -- | rpc:call(Node, Module, Function, Arguments)++> rpcCall :: MBox -> Node -> String -> String -> [ErlType] -> IO ErlType+> rpcCall mbox node m f as = genCall mbox node (Right "rex") $+> (ErlAtom "call", ErlAtom m, ErlAtom f, as, mboxSelf mbox)
+ src/Foreign/Erlang/OTP/Mnesia.lhs view
@@ -0,0 +1,46 @@+> module Foreign.Erlang.OTP.Mnesia (+> -- * Mnesia database methods.+> backup+> , dirtyAllKeys+> , dirtyFirst+> , dirtyNext+> , dirtyLast+> , dirtyPrev+> , dirtyMatchObject+> , dirtyRead+> , dirtySelect+> ) where++> import Foreign.Erlang.OTP.GenServer (rpcCall)+> import Foreign.Erlang.Processes (MBox, Node)+> import Foreign.Erlang.Types (ErlType(..))++> mnesia :: MBox -> Node -> String -> [ErlType] -> IO ErlType+> mnesia mbox node f as = rpcCall mbox node "mnesia" f as++> backup :: MBox -> String -> String -> IO ErlType+> backup mbox node path = mnesia mbox node "backup" [ErlString path]++> dirtyAllKeys :: MBox -> String -> String -> IO ErlType+> dirtyAllKeys mbox node tab = mnesia mbox node "dirty_all_keys" [ErlAtom tab]++> dirtyFirst :: MBox -> String -> String -> IO ErlType+> dirtyFirst mbox node tab = mnesia mbox node "dirty_first" [ErlAtom tab]++> dirtyNext :: MBox -> String -> String -> ErlType -> IO ErlType+> dirtyNext mbox node tab key = mnesia mbox node "dirty_next" [ErlAtom tab, key]++> dirtyLast :: MBox -> String -> String -> IO ErlType+> dirtyLast mbox node tab = mnesia mbox node "dirty_last" [ErlAtom tab]++> dirtyPrev :: MBox -> String -> String -> ErlType -> IO ErlType+> dirtyPrev mbox node tab key = mnesia mbox node "dirty_pref" [ErlAtom tab, key]++> dirtyMatchObject :: MBox -> String -> ErlType -> IO ErlType+> dirtyMatchObject mbox node pat = mnesia mbox node "dirty_match_object" [pat]++> dirtyRead :: MBox -> String -> String -> ErlType -> IO ErlType+> dirtyRead mbox node tab key = mnesia mbox node "dirty_read" [ErlAtom tab, key]++> dirtySelect :: MBox -> String -> String -> ErlType -> IO ErlType+> dirtySelect mbox node tab spec = mnesia mbox node "dirty_select" [spec]
+ src/Foreign/Erlang/Processes.lhs view
@@ -0,0 +1,198 @@+> module Foreign.Erlang.Processes (+> -- * Low-level communication.+> -- ** Represents a Haskell node (program).+> Self+> , createSelf+> -- ** Represents a Haskell process (thread).+> , MBox+> , createMBox+> , mboxRef+> , mboxSelf+> -- ** Represents Erlang nodes and processes.+> , Node+> , Pid+> -- ** Communication to/from Erlang.+> , mboxRecv+> , mboxRecv'+> , mboxSend+> ) where++> import Control.Concurrent (forkIO)+> import Control.Concurrent.MVar+> import Data.Maybe (fromJust)+> import Foreign.Erlang.Network+> import Foreign.Erlang.Types++> -- | The name of an Erlang node on the network.+> type Node = String++> data ErlMessage = ErlRegister (ErlType -> IO ())+> | ErlGenRef ErlType+> | ErlSend String ErlType ErlType+> | ErlRegSend ErlType String String ErlType+> | ErlLink ErlType String ErlType+> | ErlUnlink ErlType String ErlType+> | ErlExit ErlType String ErlType ErlType+> | ErlExit2 ErlType String ErlType ErlType+> | ErlDispatch ErlType ErlType+> | ErlStop+> deriving Show++> instance Show (a -> b) where+> show _ = "<function>"++> -- | Represents a Haskell node. There should be one of these per process.+> data Self = Self { send :: ErlMessage -> IO () }++> genPid nodename id = ErlPid (ErlAtom nodename) id 0 1+> genRef nodename id = ErlNewRef (ErlAtom nodename) 1 . toNetwork 4 . fromIntegral $ id++> -- | Instantiate a Haskell node. This initializes the FFI.+> createSelf :: String -> IO Self+> createSelf nodename = do+> inbox <- newEmptyMVar+> forkIO $ self nodename inbox+> return . Self $ putMVar inbox++> self :: String -> MVar ErlMessage -> IO ()+> self nodename inbox = loop 1 [] []+> where+> loop id mboxes nodes = do+> msg <- takeMVar inbox+> case msg of+> ErlRegister mbox -> do+> let pid = genPid nodename id+> mbox pid+> loop (id+1) ((pid, mbox) : mboxes) nodes+> ErlGenRef pid -> do+> let ref = genRef nodename id+> maybe (return ()) ($ ref) $ lookup pid mboxes+> loop (id+1) mboxes nodes+> ErlSend node pid msg -> do+> let ctl = toErlang (ErlInt 2, ErlAtom "", pid)+> (mnode, nodes') <- findNode node nodes+> case mnode of+> Just n -> n (Just ctl, Just msg)+> Nothing -> return ()+> loop id mboxes nodes'+> ErlRegSend from node pid msg -> do+> let ctl = toErlang (ErlInt 6, from, ErlAtom "", ErlAtom pid)+> (mnode, nodes') <- findNode node nodes+> case mnode of+> Just n -> n (Just ctl, Just msg)+> Nothing -> return ()+> loop id mboxes nodes'+> ErlLink from to pid -> do+> let ctl = toErlang (ErlInt 1, from, pid)+> (node, nodes') <- findNode to nodes+> fromJust node (Just ctl, Nothing)+> loop id mboxes nodes'+> ErlUnlink from to pid -> do+> let ctl = toErlang (ErlInt 4, from, pid)+> (node, nodes') <- findNode to nodes+> fromJust node (Just ctl, Nothing)+> loop id mboxes nodes'+> ErlExit from to pid reason -> do+> let ctl = toErlang (ErlInt 3, from, to, reason)+> (node, nodes') <- findNode to nodes+> fromJust node (Just ctl, Nothing)+> loop id mboxes nodes'+> ErlExit2 from to pid reason -> do+> let ctl = toErlang (ErlInt 8, from, to, reason)+> (node, nodes') <- findNode to nodes+> fromJust node (Just ctl, Nothing)+> loop id mboxes nodes'+> ErlDispatch ctl msg -> do+> case ctl of+> ErlTuple [ErlInt 2, _, pid] ->+> maybe (return ()) ($ msg) $ lookup pid mboxes+> _ -> return ()+> loop id mboxes nodes+> ErlStop -> return ()++> findNode to nodes =+> case lookup to nodes of+> Just node -> return (Just node, nodes)+> Nothing -> do+> (send, recv) <- erlConnect nodename to+> mvar <- newEmptyMVar+> forkIO $ nodeSend mvar send+> forkIO $ nodeRecv mvar recv inbox+> let node = putMVar mvar+> return (Just node, ((to, node) : nodes))++A `nodeSend` thread is responsible for communication to an Erlang+process. It receives messages in an `MVar` and forwards them across+the network.++> nodeSend mvar send = loop+> where+> loop = takeMVar mvar >>= send >> loop++A `nodeRecv` thread is responsible for communication from an Erlang+process. It receives messages from the network and dispatches them as+appropriate.++> nodeRecv mvar recv outbox = loop+> where+> loop = do+> (mctl, mmsg) <- recv+> case mctl of+> -- Nothing is a keepalive. All we want to do is echo it.+> Nothing -> putMVar mvar (Nothing, Nothing)+> -- A real message goes to self to be dispatched.+> Just ctl -> putMVar outbox $ ErlDispatch ctl (fromJust mmsg)+> loop++> -- | Haskell threads don't natively have Erlang process IDs. Instead, we+> -- use a mailbox abstraction that we can assign PIDs to for communication+> -- with Erlang.++> data MBox = MBox ErlType (MVar ErlType) Self++> -- | Represents a foreign (Erlang) process. A process can be identified+> -- either by its low-level ID (Left pid) or by its registered name (Right name).+ +> type Pid = Either ErlType String++> -- | Return the PID of the given mailbox.++> mboxSelf :: MBox -> ErlType+> mboxSelf (MBox pid _ _) = pid++> -- | Return a new unique object reference.++> mboxRef :: MBox -> IO ErlType+> mboxRef mbox@(MBox pid _ self) = send self (ErlGenRef pid) >> mboxRecv mbox++Send an arbitrary message to the specified node and process.++> -- | {Node, Pid} ! Msg.+> mboxSend :: Erlang a => MBox -> Node -> Pid -> a -> IO ()+> mboxSend (MBox _ _ self) node (Left pid) msg = send self $ ErlSend node pid (toErlang msg)+> mboxSend (MBox from _ self) node (Right pid) msg = send self $ ErlRegSend from node pid (toErlang msg)++> -- | Receive the next message addressed to this mailbox.++> mboxRecv :: MBox -> IO ErlType+> mboxRecv (MBox _ inbox _) = takeMVar inbox++> -- | Receive a reply message. That is, looks for the next message+> -- identified by the given reference.+ +> mboxRecv' :: MBox -> ErlType -> IO ErlType+> mboxRecv' mbox ref = do+> msg <- mboxRecv mbox+> case msg of+> ErlTuple [ref', result] | ref' == ref -> return result+> _ -> mboxRecv' mbox ref++> -- | Create a new process on the Haskell side. Usually corresponds+> -- to a thread but doesn't need to.+ +> createMBox :: Self -> IO MBox+> createMBox self = do+> inbox <- newEmptyMVar+> send self $ ErlRegister (putMVar inbox)+> pid <- takeMVar inbox+> return $ MBox pid inbox self
+ src/Foreign/Erlang/Types.lhs view
@@ -0,0 +1,199 @@+> {-# LANGUAGE OverlappingInstances #-}+> {-# OPTIONS -XFlexibleInstances -XTypeSynonymInstances #-}++> module Foreign.Erlang.Types (+> -- * Native Erlang data types.+> -- ** Haskell representation.+> ErlType(..)+> -- ** Conversion between native Haskell types and ErlType.+> , Erlang+> , fromErlang+> , toErlang+> -- ** Easy type-safe access to tuple members.+> , nth+>+> -- ** Internal packing functions.+> , getA, getC, getErl, getN, geta, getn+> , putA, putC, putErl, putN, puta, putn+> , tag+> ) where++> import Control.Exception (assert)+> import Control.Monad (forM, liftM)+> import Data.Binary+> import Data.Binary.Get+> import Data.Binary.Put+> import Data.Char (chr, ord)+> import qualified Data.ByteString as B+> import qualified Data.ByteString.Char8 as C++> nth :: Erlang a => Int -> ErlType -> a+> nth i (ErlTuple lst) = fromErlang $ lst !! i++> data ErlType = ErlNull+> | ErlInt Int+> | ErlBigInt Integer+> | ErlString String+> | ErlAtom String+> | ErlBinary [Word8]+> | ErlList [ErlType]+> | ErlTuple [ErlType]+> | ErlPid ErlType Int Int Int -- node id serial creation+> | ErlPort ErlType Int Int -- node id creation+> | ErlRef ErlType Int Int -- node id creation+> | ErlNewRef ErlType Int [Word8] -- node creation id+> deriving (Eq, Show)++> class Erlang a where+> toErlang :: a -> ErlType+> fromErlang :: ErlType -> a++> instance Erlang ErlType where+> toErlang = id+> fromErlang = id++> instance Erlang Int where+> toErlang x = ErlInt x+> fromErlang (ErlInt x) = x+> fromErlang (ErlBigInt x) = fromIntegral x++> instance Erlang Integer where+> toErlang x = ErlBigInt x+> fromErlang (ErlInt x) = fromIntegral x+> fromErlang (ErlBigInt x) = x++> instance Erlang String where+> toErlang x = ErlString x+> fromErlang ErlNull = ""+> fromErlang (ErlString x) = x+> fromErlang (ErlAtom x) = x+> fromErlang (ErlList xs) = map (chr . fromErlang) xs+> fromErlang x = error $ "can't convert to string: " ++ show x++> instance Erlang Bool where+> toErlang True = ErlAtom "true"+> toErlang False = ErlAtom "false"+> fromErlang (ErlAtom "true") = True+> fromErlang (ErlAtom "false") = False++> instance Erlang [ErlType] where+> toErlang [] = ErlNull+> toErlang xs = ErlList xs+> fromErlang ErlNull = []+> fromErlang (ErlList xs) = xs++> instance Erlang a => Erlang [a] where+> toErlang [] = ErlNull+> toErlang xs = ErlList . map toErlang $ xs+> fromErlang ErlNull = []+> fromErlang (ErlList xs) = map fromErlang xs++> instance (Erlang a, Erlang b) => Erlang (a, b) where+> toErlang (x, y) = ErlTuple [toErlang x, toErlang y]+> fromErlang (ErlTuple [x, y]) = (fromErlang x, fromErlang y)++> instance (Erlang a, Erlang b, Erlang c) => Erlang (a, b, c) where+> toErlang (x, y, z) = ErlTuple [toErlang x, toErlang y, toErlang z]+> fromErlang (ErlTuple [x, y, z]) = (fromErlang x, fromErlang y, fromErlang z)++> instance (Erlang a, Erlang b, Erlang c, Erlang d) => Erlang (a, b, c, d) where+> toErlang (x, y, z, w) = ErlTuple [toErlang x, toErlang y, toErlang z, toErlang w]+> fromErlang (ErlTuple [x, y, z, w]) = (fromErlang x, fromErlang y, fromErlang z, fromErlang w)++> instance (Erlang a, Erlang b, Erlang c, Erlang d, Erlang e) => Erlang (a, b, c, d, e) where+> toErlang (x, y, z, w, a) = ErlTuple [toErlang x, toErlang y, toErlang z, toErlang w, toErlang a]+> fromErlang (ErlTuple [x, y, z, w, a]) = (fromErlang x, fromErlang y, fromErlang z, fromErlang w, fromErlang a)++> instance Binary ErlType where+> put = putErl+> get = getErl++> putErl (ErlInt val)+> | 0 <= val && val < 256 = tag 'a' >> putC val+> | otherwise = tag 'b' >> putN val+> putErl (ErlAtom val) = tag 'd' >> putn (length val) >> putA val+> putErl (ErlTuple val)+> | len < 256 = tag 'h' >> putC len >> mapM_ putErl val+> | otherwise = tag 'i' >> putN len >> mapM_ putErl val+> where+> len = length val+> putErl ErlNull = tag 'j'+> putErl (ErlString val) = tag 'k' >> putn (length val) >> putA val+> putErl (ErlList val) = tag 'l' >> putN (length val) >> mapM_ putErl val >> putErl ErlNull+> putErl (ErlBinary val) = tag 'm' >> putN (length val) >> puta val+> putErl (ErlRef node id creation) = do+> tag 'e'+> putErl node+> putN id+> putC creation+> putErl (ErlPort node id creation) = do+> tag 'f'+> putErl node+> putN id+> putC creation+> putErl (ErlPid node id serial creation) = do+> tag 'g'+> putErl node+> putN id+> putN serial+> putC creation+> putErl (ErlNewRef node creation id) = do+> tag 'r'+> putn $ length id `div` 4+> putErl node+> putC creation+> mapM_ putWord8 id+ +> getErl = do+> tag <- liftM chr getC+> case tag of+> 'a' -> liftM ErlInt getC+> 'b' -> liftM ErlInt getN+> 'd' -> getn >>= liftM ErlAtom . getA+> 'e' -> do+> node <- getErl+> id <- getN+> creation <- getC+> return $ ErlRef node id creation+> 'f' -> do+> node <- getErl+> id <- getN+> creation <- getC+> return $ ErlPort node id creation+> 'g' -> do+> node <- getErl+> id <- getN+> serial <- getN+> creation <- getC+> return $ ErlPid node id serial creation+> 'h' -> getC >>= \len -> liftM ErlTuple $ forM [1..len] (const getErl)+> 'i' -> getN >>= \len -> liftM ErlTuple $ forM [1..len] (const getErl)+> 'j' -> return ErlNull+> 'k' -> getn >>= liftM ErlString . getA+> 'l' -> do+> len <- getN+> list <- liftM ErlList $ forM [1..len] (const getErl)+> null <- getErl+> assert (null == ErlNull) $ return list+> 'm' -> getN >>= liftM ErlBinary . geta+> 'r' -> do+> len <- getn+> node <- getErl+> creation <- getC+> id <- forM [1..4*len] (const getWord8)+> return $ ErlNewRef node creation id+> x -> error [x]++> tag = putC . ord++> putC = putWord8 . fromIntegral+> putn = putWord16be . fromIntegral+> putN = putWord32be . fromIntegral+> puta = putByteString . B.pack+> putA = putByteString . C.pack++> getC = liftM fromIntegral getWord8+> getn = liftM fromIntegral getWord16be+> getN = liftM fromIntegral getWord32be+> geta = liftM B.unpack . getByteString+> getA = liftM C.unpack . getByteString
+ src/Foreign/Erlang/Utilities.lhs view
@@ -0,0 +1,24 @@+> module Foreign.Erlang.Utilities (+> -- * Miscellaneous utilities.+> erlangTimeToSeconds+> , secondsToErlangTime+> ) where++> import Foreign.Erlang.Types (ErlType(..))++Erlang's native time format is a tuple: {MegaSeconds, Seconds,+MicroSeconds}. Luckily though, Erlang uses the same epoch, so no+further conversion is necessary.++> -- | Convert a tuple (from erlang:now()) to seconds from Jan 1, 1970.++> erlangTimeToSeconds :: Integral a => ErlType -> a+> erlangTimeToSeconds (ErlTuple [ErlInt ms, ErlInt s, _]) =+> fromIntegral $ 1000000*ms + s++> -- | Convert seconds to an Erlang tuple representing time.++> secondsToErlangTime :: Integral a => a -> ErlType+> secondsToErlangTime sec = ErlTuple [ErlInt ms, ErlInt s, ErlInt 0]+> where+> (ms, s) = fromIntegral sec `divMod` 1000000