From 0b728575358645f6e9a3f98959dd6995325f7380 Mon Sep 17 00:00:00 2001 From: Emil Renner Berthing Date: Wed, 2 Mar 2011 23:18:34 +0100 Subject: initial commit --- .gitignore | 5 + LICENSE | 674 ++++++++++++++++++++++++++++++++++++ Makefile | 52 +++ PKGBUILD | 25 ++ README.markdown | 158 +++++++++ lem/postgres.so | 1 + lem/postgres/queued.lua | 1 + postgres.c | 884 ++++++++++++++++++++++++++++++++++++++++++++++++ qtest.lua | 114 +++++++ queued.lua | 96 ++++++ test.lua | 98 ++++++ 11 files changed, 2108 insertions(+) create mode 100644 .gitignore create mode 100644 LICENSE create mode 100644 Makefile create mode 100644 PKGBUILD create mode 100644 README.markdown create mode 120000 lem/postgres.so create mode 120000 lem/postgres/queued.lua create mode 100644 postgres.c create mode 100755 qtest.lua create mode 100644 queued.lua create mode 100755 test.lua diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..dcb167a --- /dev/null +++ b/.gitignore @@ -0,0 +1,5 @@ +*.o +*.so +*.pkg.tar.* +src/ +pkg/ diff --git a/LICENSE b/LICENSE new file mode 100644 index 0000000..94a9ed0 --- /dev/null +++ b/LICENSE @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff --git a/Makefile b/Makefile new file mode 100644 index 0000000..ca0b6b5 --- /dev/null +++ b/Makefile @@ -0,0 +1,52 @@ +CC = gcc +CFLAGS ?= -O2 -pipe -Wall -Wextra -Wno-variadic-macros -Wno-strict-aliasing -I$(shell pg_config --includedir) +LDFLAGS ?= -L$(shell pg_config --libdir) +STRIP = strip +INSTALL = install + +LUA_VERSION = 5.1 +PREFIX = /usr/local +LIBDIR = $(PREFIX)/lib/lua/$(LUA_VERSION)/lem + +programs = postgres.so +scripts = queued.lua + +ifdef NDEBUG +DEFINES+=-DNDEBUG +endif + +.PHONY: all strip install indent clean +.PRECIOUS: %.o + +all: $(programs) + +%.o: %.c + @echo ' CC $@' + @$(CC) $(CFLAGS) -I$(PREFIX)/include -fPIC -nostartfiles $(DEFINES) -c $< -o $@ + +%.so: %.o + @echo ' LD $@' + @$(CC) -shared -lpq $(LDFLAGS) $^ -o $@ + +%-strip: % + @echo ' STRIP $<' + @$(STRIP) $< + +strip: $(programs:%=%-strip) + +libdir-install: + @echo " INSTALL -d $(LIBDIR)" + @$(INSTALL) -d $(DESTDIR)$(LIBDIR)/postgres + +%.lua-install: %.lua libdir-install + @echo " INSTALL $<" + @$(INSTALL) $< $(DESTDIR)$(LIBDIR)/postgres/$< + +%.so-install: %.so libdir-install + @echo " INSTALL $<" + @$(INSTALL) $< $(DESTDIR)$(LIBDIR)/$< + +install: $(programs:%=%-install) $(scripts:%=%-install) + +clean: + rm -f $(programs) *.o *.c~ *.h~ diff --git a/PKGBUILD b/PKGBUILD new file mode 100644 index 0000000..43a0238 --- /dev/null +++ b/PKGBUILD @@ -0,0 +1,25 @@ +# Maintainer: Emil Renner Berthing + +pkgname=lem-postgres +pkgver=0.1 +pkgrel=1 +pkgdesc="PostgreSQL library for the Lua Event Machine" +arch=('i686' 'x86_64' 'armv5tel' 'armv7l') +url="https://github.com/esmil/lem-postgres" +license=('GPL') +depends=('lem' 'postgresql-libs') +source=() + +build() { + cd "$startdir" + + make NDEBUG=1 +} + +package() { + cd "$startdir" + + make DESTDIR="$pkgdir/" PREFIX='/usr' install +} + +# vim:set ts=2 sw=2 et: diff --git a/README.markdown b/README.markdown new file mode 100644 index 0000000..3640704 --- /dev/null +++ b/README.markdown @@ -0,0 +1,158 @@ +lem-postgres +============ + + +About +----- + +lem-postgres is a [PostgreSQL][] library for the [Lua Event Machine][lem]. +It allows you to query PostgreSQL databases without blocking +other coroutines. + +[lem]: https://github.com/esmil/lem +[postgresql]: http://www.postgresql.org/ + +Installation +------------ + +Get the source and do + + make + make install + +This installs the library under `/usr/local/lib/lua/5.1/`. +Use + + make PREFIX= install + +to install to `/lib/lua/5.1/`. + + +Usage +----- + +Import the module using something like + + local postgres = require 'lem.postgres' + +This sets `postgres` to a table with a single function. + +* __postgres.connect(conninfo)__ + + Connect to the database given by parameters in the `conninfo` string. + Returns a new database connection object on success, + or otherwise `nil` followed by an error message. + +The metatable of database connection objects can be found under +__postgres.Connection__. + +Database connection objects has the following methods. + +* __db:close()__ + + Close the database connection. + + Returns `true` on success or otherwise `nil, 'already closed'`, + if the connection was already closed. + +* __db:reset()__ + + Reset the database connection. + + Returns `true` on success or otherwise `nil` followed by an error message. + If another coroutine is using this database connection the error message + will be `'busy'`. + If the connection is closed the error message will be `'closed'`. + If another coroutine closes this connection while the reset is going on + the error message be `'interrupted'`. + +* __db:exec(query, ...)__ + + Execute an SQL query. If the query string is parametized + (using $1, $2 etc.) the parameters must be given after the + query string. + + If the query is a SELECT the result will be returned in a Lua table + with entries 1, 2, ... for each row. + Each row is again a Lua table with entries 1, 2, ... for each + returned column. + + Returns `true` or the result of the SELECT statement on success, + or otherwise `nil` followed by an error message. + If another coroutine is using this database connection the error message + will be `'busy'`. + If the connection is closed the error message will be `'closed'`. + If another coroutine closes this connection while the reset is going on + the error message be `'interrupted'`. + +* __db:prepare(name, query)__ + + Creates a prepared SQL statement under the given name. + + Returns `true` on success or otherwise `nil` followed by an error message. + If another coroutine is using this database connection the error message + will be `'busy'`. + If the connection is closed the error message will be `'closed'`. + If another coroutine closes this connection while the reset is going on + the error message be `'interrupted'`. + +* __db:run(name, ...)__ + + Runs the prepared statement given by the name. If the statement + is parameterized (using $1, $2 etc.) the parameters must be given + after the name of the statement. + + If the prepared statement is a SELECT the result will be returned in + a Lua table with entries 1, 2, ... for each row. + Each row is again a Lua table with entries 1, 2, ... for each + returned column. + + Returns `true` or the result of the SELECT statement on success, + or otherwise `nil` followed by an error message. + If another coroutine is using this database connection the error message + will be `'busy'`. + If the connection is closed the error message will be `'closed'`. + If another coroutine closes this connection while the reset is going on + the error message be `'interrupted'`. + +* __db:put(line)__ + + This method should be called after a `COPY FROM STDIN`-query. + Call it once for each row in the table. + + Returns `true` on success or otherwise `nil` followed by an error message. + +* __db:done([error])__ + + When all rows of a `COPY
FROM STDIN`-query have been sent to the + server, call this method to signal end of transmission. + + If an error message is supplied this will signal an error to the server. + + Returns `true` on success or otherwise `nil` followed by an error message. + Calling this method with an error argument will also cause it to return + `nil` followed by an error message. + +* __db:get()__ + + Call this method to receive rows after a `COPY
TO STDIN`-query. + + Returns one complete line as a Lua string or `true` to signal end of + transmission. + On error `nil` followed by an error message will be returned. + + +License +------- + +lem-postgres is free software. It is distributed under the terms of the +[GNU General Public License][gpl]. + +[gpl]: http://www.fsf.org/licensing/licenses/gpl.html + + +Contact +------- + +Please send bug reports, patches, feature requests, praise and general gossip +to me, Emil Renner Berthing . diff --git a/lem/postgres.so b/lem/postgres.so new file mode 120000 index 0000000..d0ce981 --- /dev/null +++ b/lem/postgres.so @@ -0,0 +1 @@ +../postgres.so \ No newline at end of file diff --git a/lem/postgres/queued.lua b/lem/postgres/queued.lua new file mode 120000 index 0000000..94dfe13 --- /dev/null +++ b/lem/postgres/queued.lua @@ -0,0 +1 @@ +../../queued.lua \ No newline at end of file diff --git a/postgres.c b/postgres.c new file mode 100644 index 0000000..16f2de8 --- /dev/null +++ b/postgres.c @@ -0,0 +1,884 @@ +/* + * This file is part of lem-postgres. + * Copyright 2011 Emil Renner Berthing + * + * lem-postgres 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. + * + * lem-postgres 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 lem-postgres. If not, see . + */ + +#include +#include +#include +#include + +struct connection { + struct ev_io w; + PGconn *conn; + lua_State *T; +}; + +static void +push_error(lua_State *T, PGconn *conn) +{ + const char *msg = PQerrorMessage(conn); + const char *p; + + for (p = msg; *p != '\n' && *p != '\0'; p++); + + lua_pushnil(T); + if (p > msg) + lua_pushlstring(T, msg, p - msg); + else + lua_pushliteral(T, "unknown error"); +} + +static int +connection_gc(lua_State *T) +{ + struct connection *c = lua_touserdata(T, 1); + + if (c->conn == NULL) + return 0; + + ev_io_stop(EV_G_ &c->w); + PQfinish(c->conn); + return 0; +} + +static int +connection_close(lua_State *T) +{ + struct connection *c; + + luaL_checktype(T, 1, LUA_TUSERDATA); + c = lua_touserdata(T, 1); + if (c->conn == NULL) { + lua_pushnil(T); + lua_pushliteral(T, "already closed"); + return 2; + } + + if (c->T != NULL) { + lua_pushnil(c->T); + lua_pushliteral(c->T, "interrupted"); + lem_queue(c->T, 2); + c->T = NULL; + } + + ev_io_stop(EV_G_ &c->w); + PQfinish(c->conn); + c->conn = NULL; + + lua_pushboolean(T, 1); + return 1; +} + +static void +connect_handler(EV_P_ struct ev_io *w, int revents) +{ + struct connection *c = (struct connection *)w; + + (void)revents; + + ev_io_stop(EV_A_ &c->w); + switch (PQconnectPoll(c->conn)) { + case PGRES_POLLING_READING: + lem_debug("PGRES_POLLING_READING, socket = %d", PQsocket(c->conn)); + ev_io_set(&c->w, PQsocket(c->conn), EV_READ); + break; + + case PGRES_POLLING_WRITING: + lem_debug("PGRES_POLLING_WRITING, socket = %d", PQsocket(c->conn)); + ev_io_set(&c->w, PQsocket(c->conn), EV_WRITE); + break; + + case PGRES_POLLING_FAILED: + lem_debug("PGRES_POLLING_FAILED"); + lua_settop(c->T, 0); + push_error(c->T, c->conn); + PQfinish(c->conn); + c->conn = NULL; + lem_queue(c->T, 2); + c->T = NULL; + return; + + case PGRES_POLLING_OK: + lem_debug("PGRES_POLLING_OK"); + lem_queue(c->T, 1); + c->T = NULL; + return; + +#ifndef NDEBUG + case PGRES_POLLING_ACTIVE: + assert(0); +#endif + } + + ev_io_start(EV_A_ &c->w); +} + +static int +connection_connect(lua_State *T) +{ + const char *conninfo = luaL_checkstring(T, 1); + PGconn *conn; + ConnStatusType status; + struct connection *c; + + conn = PQconnectStart(conninfo); + if (conn == NULL) { + lua_pushnil(T); + lua_pushliteral(T, "out of memory"); + return 2; + } + + status = PQstatus(conn); + if (status == CONNECTION_BAD) { + lem_debug("CONNECTION_BAD"); + goto error; + } + + c = lua_newuserdata(T, sizeof(struct connection)); + lua_pushvalue(T, lua_upvalueindex(1)); + lua_setmetatable(T, -2); + + c->conn = conn; + + switch (PQconnectPoll(conn)) { + case PGRES_POLLING_READING: + lem_debug("PGRES_POLLING_READING"); + ev_io_init(&c->w, connect_handler, PQsocket(conn), EV_READ); + break; + + case PGRES_POLLING_WRITING: + lem_debug("PGRES_POLLING_WRITING"); + ev_io_init(&c->w, connect_handler, PQsocket(conn), EV_WRITE); + break; + + case PGRES_POLLING_FAILED: + lem_debug("PGRES_POLLING_FAILED"); + goto error; + + case PGRES_POLLING_OK: + lem_debug("PGRES_POLLING_OK"); + c->T = NULL; + return 1; + +#ifndef NDEBUG + case PGRES_POLLING_ACTIVE: + assert(0); +#endif + } + + c->T = T; + ev_io_start(EV_G_ &c->w); + + lua_replace(T, 1); + lua_settop(T, 1); + return lua_yield(T, 1); +error: + push_error(T, conn); + PQfinish(conn); + return 2; +} + +static int +connection_reset(lua_State *T) +{ + struct connection *c; + + luaL_checktype(T, 1, LUA_TUSERDATA); + c = lua_touserdata(T, 1); + if (c->T != NULL) { + lua_pushnil(T); + lua_pushliteral(T, "busy"); + return 2; + } + + if (c->conn == NULL) { + lua_pushnil(T); + lua_pushliteral(T, "closed"); + return 2; + } + + if (PQresetStart(c->conn) != 1) + goto error; + + c->w.cb = connect_handler; + switch (PQconnectPoll(c->conn)) { + case PGRES_POLLING_READING: + lem_debug("PGRES_POLLING_READING"); + ev_io_set(&c->w, PQsocket(c->conn), EV_READ); + break; + + case PGRES_POLLING_WRITING: + lem_debug("PGRES_POLLING_WRITING"); + ev_io_set(&c->w, PQsocket(c->conn), EV_WRITE); + break; + + case PGRES_POLLING_FAILED: + lem_debug("PGRES_POLLING_FAILED"); + goto error; + + case PGRES_POLLING_OK: + lem_debug("PGRES_POLLING_OK"); + return 1; + +#ifndef NDEBUG + case PGRES_POLLING_ACTIVE: + assert(0); +#endif + } + + c->T = T; + ev_io_start(EV_G_ &c->w); + + lua_settop(T, 1); + return lua_yield(T, 1); +error: + push_error(T, c->conn); + return 2; +} + +static void +push_tuples(lua_State *T, PGresult *res) +{ + int rows = PQntuples(res); + int columns = PQnfields(res); + int i; + + lua_createtable(T, rows, 0); + for (i = 0; i < rows; i++) { + int j; + + lua_createtable(T, columns, 0); + for (j = 0; j < columns; j++) { + if (PQgetisnull(res, i, j)) + lua_pushnil(T); + else + lua_pushlstring(T, PQgetvalue(res, i, j), + PQgetlength(res, i, j)); + lua_rawseti(T, -2, j+1); + } + lua_rawseti(T, -2, i+1); + } + + /* insert column names as "row 0" */ + lua_createtable(T, columns, 0); + for (i = 0; i < columns; i++) { + lua_pushstring(T, PQfname(res, i)); + lua_rawseti(T, -2, i+1); + } + lua_rawseti(T, -2, 0); +} + +static void +error_handler(EV_P_ struct ev_io *w, int revents) +{ + struct connection *c = (struct connection *)w; + + (void)revents; + + if (PQconsumeInput(c->conn) == 0) { + ev_io_stop(EV_A_ &c->w); + lua_settop(c->T, 0); + push_error(c->T, c->conn); + lem_queue(c->T, 2); + c->T = NULL; + return; + } + + while (!PQisBusy(c->conn)) { + PGresult *res = PQgetResult(c->conn); + + if (res == NULL) { + ev_io_stop(EV_A_ &c->w); + lem_queue(c->T, 2); + c->T = NULL; + return; + } + + PQclear(res); + } +} + +static void +exec_handler(EV_P_ struct ev_io *w, int revents) +{ + struct connection *c = (struct connection *)w; + PGresult *res; + + (void)revents; + + if (PQconsumeInput(c->conn) != 1) { + ev_io_stop(EV_A_ &c->w); + lua_settop(c->T, 0); + push_error(c->T, c->conn); + lem_queue(c->T, 2); + c->T = NULL; + return; + } + + while (!PQisBusy(c->conn)) { + res = PQgetResult(c->conn); + + if (res == NULL) { + ev_io_stop(EV_A_ &c->w); + lem_debug("returning %d values", lua_gettop(c->T) - 1); + lem_queue(c->T, lua_gettop(c->T) - 1); + c->T = NULL; + return; + } + + switch (PQresultStatus(res)) { + case PGRES_EMPTY_QUERY: + lem_debug("PGRES_EMPTY_QUERY"); + lua_settop(c->T, 0); + lua_pushnil(c->T); + lua_pushliteral(c->T, "empty query"); + goto error; + + case PGRES_COMMAND_OK: + lem_debug("PGRES_COMMAND_OK"); + lua_pushboolean(c->T, 1); + break; + + case PGRES_TUPLES_OK: + lem_debug("PGRES_TUPLES_OK"); + push_tuples(c->T, res); + break; + + case PGRES_COPY_IN: + lem_debug("PGRES_COPY_IN"); + (void)PQsetnonblocking(c->conn, 1); + case PGRES_COPY_OUT: + lem_debug("PGRES_COPY_OUT"); + PQclear(res); + lua_pushboolean(c->T, 1); + lem_queue(c->T, lua_gettop(c->T) - 1); + c->T = NULL; + return; + + case PGRES_BAD_RESPONSE: + lem_debug("PGRES_BAD_RESPONSE"); + lua_settop(c->T, 0); + push_error(c->T, c->conn); + goto error; + + case PGRES_NONFATAL_ERROR: + lem_debug("PGRES_NONFATAL_ERROR"); + break; + + case PGRES_FATAL_ERROR: + lem_debug("PGRES_FATAL_ERROR"); + lua_settop(c->T, 0); + push_error(c->T, c->conn); + goto error; + + default: + lem_debug("unknown result status"); + lua_settop(c->T, 0); + lua_pushnil(c->T); + lua_pushliteral(c->T, "unknown result status"); + goto error; + } + + PQclear(res); + } + + lem_debug("busy"); + return; +error: + PQclear(res); + c->w.cb = error_handler; + while (!PQisBusy(c->conn)) { + res = PQgetResult(c->conn); + + if (res == NULL) { + ev_io_stop(EV_A_ &c->w); + lem_queue(c->T, 2); + c->T = NULL; + return; + } + + PQclear(res); + } +} + +static int +connection_exec(lua_State *T) +{ + struct connection *c; + const char *command; + int n; + + luaL_checktype(T, 1, LUA_TUSERDATA); + command = luaL_checkstring(T, 2); + + c = lua_touserdata(T, 1); + if (c->T != NULL) { + lua_pushnil(T); + lua_pushliteral(T, "busy"); + return 2; + } + + if (c->conn == NULL) { + lua_pushnil(T); + lua_pushliteral(T, "closed"); + return 2; + } + + n = lua_gettop(T) - 2; + if (n > 0) { + const char **values = lem_xmalloc(n * sizeof(char *)); + int *lengths = lem_xmalloc(n * sizeof(int)); + int i; + + for (i = 0; i < n; i++) { + size_t len; + + values[i] = lua_tolstring(T, i+3, &len); + lengths[i] = len; + } + + n = PQsendQueryParams(c->conn, command, n, + NULL, values, lengths, NULL, 0); + free(values); + free(lengths); + } else + n = PQsendQuery(c->conn, command); + + if (n != 1) { + lem_debug("PQsendQuery failed"); + push_error(T, c->conn); + return 2; + } + + c->T = T; + c->w.cb = exec_handler; + c->w.events = EV_READ; + ev_io_start(EV_G_ &c->w); + + lua_settop(T, 1); + return lua_yield(T, 1); +} + +static int +connection_prepare(lua_State *T) +{ + struct connection *c; + const char *name; + const char *query; + + luaL_checktype(T, 1, LUA_TUSERDATA); + name = luaL_checkstring(T, 2); + query = luaL_checkstring(T, 3); + + c = lua_touserdata(T, 1); + if (c->T != NULL) { + lua_pushnil(T); + lua_pushliteral(T, "busy"); + return 2; + } + + if (c->conn == NULL) { + lua_pushnil(T); + lua_pushliteral(T, "closed"); + return 2; + } + + if (PQsendPrepare(c->conn, name, query, 0, NULL) != 1) { + push_error(T, c->conn); + return 2; + } + + c->T = T; + c->w.cb = exec_handler; + c->w.events = EV_READ; + ev_io_start(EV_G_ &c->w); + + lua_settop(T, 1); + return lua_yield(T, 1); +} + +static int +connection_run(lua_State *T) +{ + struct connection *c; + const char *name; + const char **values; + int *lengths; + int n; + int i; + + luaL_checktype(T, 1, LUA_TUSERDATA); + name = luaL_checkstring(T, 2); + + c = lua_touserdata(T, 1); + if (c->T != NULL) { + lua_pushnil(T); + lua_pushliteral(T, "busy"); + return 2; + } + + if (c->conn == NULL) { + lua_pushnil(T); + lua_pushliteral(T, "closed"); + return 2; + } + + n = lua_gettop(T) - 2; + values = lem_xmalloc(n * sizeof(char *)); + lengths = lem_xmalloc(n * sizeof(int)); + + for (i = 0; i < n; i++) { + size_t len; + + values[i] = lua_tolstring(T, i+3, &len); + lengths[i] = len; + } + + n = PQsendQueryPrepared(c->conn, name, n, + values, lengths, NULL, 0); + free(values); + free(lengths); + if (n != 1) { + push_error(T, c->conn); + return 2; + } + + c->T = T; + c->w.cb = exec_handler; + c->w.events = EV_READ; + ev_io_start(EV_G_ &c->w); + + lua_settop(T, 1); + return lua_yield(T, 1); +} + +static void +put_handler(EV_P_ struct ev_io *w, int revents) +{ + struct connection *c = (struct connection *)w; + size_t len; + const char *data; + + (void)revents; + + data = lua_tolstring(c->T, 2, &len); + switch (PQputCopyData(c->conn, data, (int)len)) { + case 1: /* data sent */ + lem_debug("data sent"); + ev_io_stop(EV_A_ &c->w); + + lua_settop(c->T, 0); + lua_pushboolean(c->T, 1); + lem_queue(c->T, 1); + c->T = NULL; + break; + + case 0: /* would block */ + lem_debug("would block"); + break; + + default: /* should be -1 for error */ + lua_settop(c->T, 0); + push_error(c->T, c->conn); + lem_queue(c->T, 2); + c->T = NULL; + break; + } +} + +static int +connection_put(lua_State *T) +{ + struct connection *c; + size_t len; + const char *data; + + luaL_checktype(T, 1, LUA_TUSERDATA); + data = luaL_checklstring(T, 2, &len); + + c = lua_touserdata(T, 1); + if (c->T != NULL) { + lua_pushnil(T); + lua_pushliteral(T, "busy"); + return 2; + } + + if (c->conn == NULL) { + lua_pushnil(T); + lua_pushliteral(T, "closed"); + return 2; + } + + switch (PQputCopyData(c->conn, data, (int)len)) { + case 1: /* data sent */ + lem_debug("data sent"); + lua_pushboolean(T, 1); + return 1; + + case 0: /* would block */ + lem_debug("would block"); + break; + + default: /* should be -1 for error */ + push_error(T, c->conn); + return 2; + } + + c->T = T; + c->w.cb = put_handler; + c->w.events = EV_WRITE; + ev_io_start(EV_G_ &c->w); + + lua_settop(T, 2); + return lua_yield(T, 2); +} + +static void +done_handler(EV_P_ struct ev_io *w, int revents) +{ + struct connection *c = (struct connection *)w; + const char *error = lua_tostring(c->T, 2); + + (void)revents; + + switch (PQputCopyEnd(c->conn, error)) { + case 1: /* data sent */ + lem_debug("data sent"); + ev_io_stop(EV_A_ &c->w); + lua_settop(c->T, 1); + (void)PQsetnonblocking(c->conn, 0); + c->w.cb = exec_handler; + c->w.events = EV_READ; + ev_io_start(EV_A_ &c->w); + break; + + case 0: /* would block */ + lem_debug("would block"); + break; + + default: /* should be -1 for error */ + ev_io_stop(EV_A_ &c->w); + lua_settop(c->T, 0); + push_error(c->T, c->conn); + lem_queue(c->T, 2); + c->T = NULL; + break; + } +} + +static int +connection_done(lua_State *T) +{ + struct connection *c; + const char *error; + + luaL_checktype(T, 1, LUA_TUSERDATA); + error = luaL_optstring(T, 2, NULL); + + c = lua_touserdata(T, 1); + if (c->T != NULL) { + lua_pushnil(T); + lua_pushliteral(T, "busy"); + return 2; + } + + if (c->conn == NULL) { + lua_pushnil(T); + lua_pushliteral(T, "closed"); + return 2; + } + + switch (PQputCopyEnd(c->conn, error)) { + case 1: /* data sent */ + lem_debug("data sent"); + (void)PQsetnonblocking(c->conn, 0); + c->T = T; + c->w.cb = exec_handler; + c->w.events = EV_READ; + ev_io_start(EV_G_ &c->w); + lua_settop(c->T, 1); + return lua_yield(c->T, 1); + + case 0: /* would block */ + lem_debug("would block"); + break; + + default: /* should be -1 for error */ + push_error(T, c->conn); + return 2; + } + + c->T = T; + c->w.cb = done_handler; + c->w.events = EV_WRITE; + ev_io_start(EV_G_ &c->w); + + if (error == NULL) { + lua_settop(T, 1); + lua_pushnil(T); + } else + lua_settop(T, 2); + return lua_yield(T, 2); +} + +static void +get_handler(EV_P_ struct ev_io *w, int revents) +{ + struct connection *c = (struct connection *)w; + char *buf; + int ret; + + ret = PQgetCopyData(c->conn, &buf, 1); + if (ret > 0) { + lem_debug("got data"); + ev_io_stop(EV_A_ &c->w); + + lua_pushlstring(c->T, buf, ret); + PQfreemem(buf); + lem_queue(c->T, 1); + c->T = NULL; + return; + } + + switch (ret) { + case 0: /* would block */ + lem_debug("would block"); + break; + + case -1: /* no more data */ + lem_debug("no more data"); + c->w.cb = exec_handler; + exec_handler(EV_A_ &c->w, revents); + break; + + default: /* should be -2 for error */ + ev_io_stop(EV_A_ &c->w); + lua_settop(c->T, 0); + push_error(c->T, c->conn); + lem_queue(c->T, 2); + c->T = NULL; + break; + } +} + +static int +connection_get(lua_State *T) +{ + struct connection *c; + char *buf; + int ret; + + luaL_checktype(T, 1, LUA_TUSERDATA); + c = lua_touserdata(T, 1); + if (c->T != NULL) { + lua_pushnil(T); + lua_pushliteral(T, "busy"); + return 2; + } + + if (c->conn == NULL) { + lua_pushnil(T); + lua_pushliteral(T, "closed"); + return 2; + } + + ret = PQgetCopyData(c->conn, &buf, 1); + if (ret > 0) { + lem_debug("got data"); + lua_pushlstring(T, buf, ret); + PQfreemem(buf); + return 1; + } + + switch (ret) { + case 0: /* would block */ + lem_debug("would block"); + c->T = T; + c->w.cb = get_handler; + c->w.events = EV_READ; + ev_io_start(EV_G_ &c->w); + + lua_settop(T, 1); + return lua_yield(T, 1); + + case -1: /* no more data */ + lem_debug("no more data"); + break; + + default: /* should be -2 for error */ + push_error(T, c->conn); + return 2; + } + + c->T = T; + c->w.cb = exec_handler; + c->w.events = EV_READ; + ev_io_start(EV_G_ &c->w); + + /* TODO: it is necessary but kinda ugly to call + * the exec_handler directly from here. + * find a better solution... */ + lua_settop(T, 1); + exec_handler(EV_G_ &c->w, 0); + return lua_yield(T, 1); +} + +int +luaopen_lem_postgres(lua_State *L) +{ + lua_newtable(L); + + /* create Connection metatable mt */ + lua_newtable(L); + lua_pushvalue(L, -1); + lua_setfield(L, -2, "__index"); + /* mt.__gc = */ + lua_pushcfunction(L, connection_gc); + lua_setfield(L, -2, "__gc"); + /* mt.close = */ + lua_pushcfunction(L, connection_close); + lua_setfield(L, -2, "close"); + /* mt.connect = */ + lua_pushvalue(L, -1); /* upvalue 1: Connection */ + lua_pushcclosure(L, connection_connect, 1); + lua_setfield(L, -3, "connect"); + /* mt.reset = */ + lua_pushcfunction(L, connection_reset); + lua_setfield(L, -2, "reset"); + /* mt.exec = */ + lua_pushcfunction(L, connection_exec); + lua_setfield(L, -2, "exec"); + /* mt.prepare = */ + lua_pushcfunction(L, connection_prepare); + lua_setfield(L, -2, "prepare"); + /* mt.run = */ + lua_pushcfunction(L, connection_run); + lua_setfield(L, -2, "run"); + /* mt.put = */ + lua_pushcfunction(L, connection_put); + lua_setfield(L, -2, "put"); + /* mt.done = */ + lua_pushcfunction(L, connection_done); + lua_setfield(L, -2, "done"); + /* mt.get = */ + lua_pushcfunction(L, connection_get); + lua_setfield(L, -2, "get"); + /* set Connection */ + lua_setfield(L, -2, "Connection"); + + return 1; +} diff --git a/qtest.lua b/qtest.lua new file mode 100755 index 0000000..c1c9c0e --- /dev/null +++ b/qtest.lua @@ -0,0 +1,114 @@ +#!/usr/bin/env lem +-- +-- This file is part of lem-postgres. +-- Copyright 2011 Emil Renner Berthing +-- +-- lem-postgres 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. +-- +-- lem-postgres 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 lem-postgres. If not, see . +-- + +print("Entering " .. arg[0]) + +local prettyprint +do + local write, format, tostring = io.write, string.format, tostring + + function prettyprint(t) + local widths = {} + for i = 1, #t[0] do + widths[i] = 0 + end + + for i = 0, #t do + local row = t[i] + for j = 1, #row do + local value = row[j] + if value and #value > widths[j] then + widths[j] = #value + end + end + end + + for i = 1, #widths do + widths[i] = '%-' .. tostring(widths[i] + 1) .. 's'; + end + + for i = 0, #t do + local row = t[i] + for j = 1, #row do + write(format(widths[j], row[j] or 'NULL')) + end + write('\n') + end + end +end + +local utils = require 'lem.utils' +local postgres = require 'lem.postgres.queued' + +local db = assert(postgres.connect("host=localhost dbname=mydb")) + +assert(db:exec( +'CREATE TABLE mytable (id integer PRIMARY KEY, name CHARACTER VARYING)')) + +do + local raw = db:lock() + assert(raw:exec("COPY mytable FROM STDIN (delimiter ',')")) + assert(raw:put('1,alpha\n')) + assert(raw:put('2,beta\n')) + assert(raw:put('3,gamma\n')) + assert(raw:put('4,delta\n')) + assert(raw:done()) + db:unlock() +end + +utils.spawn(function() + assert(db:prepare('mystmt', 'SELECT * FROM mytable WHERE id = $1')) + local res = assert(db:run('mystmt', '3')) + prettyprint(res) +end) + +utils.spawn(function() + local res = assert(db:exec('SELECT * FROM mytable WHERE id = $1', '1')) + prettyprint(res) +end) + +utils.spawn(function() + local res1, res2 = assert(db:exec([[ +SELECT count(id) FROM mytable; +SELECT * FROM mytable WHERE id = 2]])); + prettyprint(res2) +end) + +do + local raw = db:lock() + assert(raw:exec("COPY mytable TO STDIN (format csv)")) + + print("\nDumping CSV:") + while true do + local row = assert(raw:get()) + if type(row) ~= 'string' then break end + + io.write(row) + end + + db:unlock() +end + +utils.timer(1.0, function() + assert(db:exec('DROP TABLE mytable')) +end) + +print("Exiting " .. arg[0]) + +-- vim: syntax=lua ts=2 sw=2 noet: diff --git a/queued.lua b/queued.lua new file mode 100644 index 0000000..05496e4 --- /dev/null +++ b/queued.lua @@ -0,0 +1,96 @@ +-- +-- This file is part of lem-postgres. +-- Copyright 2011 Emil Renner Berthing +-- +-- lem-postgres 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. +-- +-- lem-postgres 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 lem-postgres. If not, see . +-- + +local utils = require 'lem.utils' +local postgres = require 'lem.postgres' + +local QConnection = {} +QConnection.__index = QConnection + +function QConnection:close() + local ok, err = self.conn:close() + for i = 1, self.n - 1 do + self[i]:wakeup() + self[i] = nil + end + return ok, err +end +QConnection.__gc = QConnection.close + +do + local remove = table.remove + local newsleeper = utils.sleeper + + local function lock(self) + local n = self.n + if n == 0 then + self.n = 1 + else + local sleeper = newsleeper() + self[n] = sleeper + self.n = n + 1 + sleeper:sleep() + end + return self.conn + end + QConnection.lock = lock + + local function unlock(self, ...) + local n = self.n - 1 + self.n = n + if n > 0 then + remove(self, 1):wakeup() + end + return ... + end + QConnection.unlock = unlock + + local function wrap(method) + return function(self, ...) + return unlock(self, method(lock(self), ...)) + end + end + + local Connection = postgres.Connection + QConnection.exec = wrap(Connection.exec) + QConnection.prepare = wrap(Connection.prepare) + QConnection.run = wrap(Connection.run) +end + +local qconnect +do + local setmetatable = setmetatable + local connect = postgres.connect + + function qconnect(...) + local conn, err = connect(...) + if not conn then return nil, err end + + return setmetatable({ + n = 0, + conn = conn, + }, QConnection) + end +end + +return { + QConnection = QConnection, + connect = qconnect, +} + +-- vim: syntax=lua ts=2 sw=2 noet: diff --git a/test.lua b/test.lua new file mode 100755 index 0000000..4c56263 --- /dev/null +++ b/test.lua @@ -0,0 +1,98 @@ +#!/usr/bin/env lem +-- +-- This file is part of lem-postgres. +-- Copyright 2011 Emil Renner Berthing +-- +-- lem-postgres 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. +-- +-- lem-postgres 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 lem-postgres. If not, see . +-- + +print("Entering " .. arg[0]) + +local prettyprint +do + local write, format, tostring = io.write, string.format, tostring + + function prettyprint(t) + local widths = {} + for i = 1, #t[0] do + widths[i] = 0 + end + + for i = 0, #t do + local row = t[i] + for j = 1, #row do + local value = row[j] + if value and #value > widths[j] then + widths[j] = #value + end + end + end + + for i = 1, #widths do + widths[i] = '%-' .. tostring(widths[i] + 1) .. 's'; + end + + for i = 0, #t do + local row = t[i] + for j = 1, #row do + write(format(widths[j], row[j] or 'NULL')) + end + write('\n') + end + end +end + +local utils = require 'lem.utils' +local postgres = require 'lem.postgres' + +local db = assert(postgres.connect("host=localhost dbname=mydb")) + +assert(db:exec( +'CREATE TABLE mytable (id integer PRIMARY KEY, name CHARACTER VARYING)')) + +assert(db:exec("COPY mytable FROM STDIN (delimiter ',')")) +assert(db:put('1,alpha\n')) +assert(db:put('2,beta\n')) +assert(db:put('3,gamma\n')) +assert(db:put('4,delta\n')) +assert(db:done()) + +local res = assert(db:exec('SELECT * FROM mytable WHERE id = $1', '1')) +prettyprint(res) + +local res1, res2 = assert(db:exec([[ +SELECT count(id) FROM mytable; +SELECT * FROM mytable WHERE id = 2; +]])); +prettyprint(res2) + +assert(db:prepare('mystmt', 'SELECT * FROM mytable WHERE id = $1')) +local res = assert(db:run('mystmt', '3')) +prettyprint(res) + +assert(db:exec("COPY mytable TO STDIN (format csv)")) + +print("\nDumping CSV:") +while true do + local row = assert(db:get()) + if type(row) ~= 'string' then break end + + io.write(row) +end + +assert(db:exec('DROP TABLE mytable')) + +print("Exiting " .. arg[0]) + +-- vim: syntax=lua ts=2 sw=2 noet: -- cgit v1.2.1