Skip to content
Browse files

First commit

  • Loading branch information...
0 parents commit d9f381e980779d6d1699ec3fd4cc742a6cb82186 @mwitmer committed Feb 14, 2013
Showing with 1,709 additions and 0 deletions.
  1. +674 −0 LICENSE
  2. +78 −0 README.org
  3. +77 −0 expression.c
  4. +600 −0 language/xml-xcb/compile-scheme.scm
  5. +17 −0 language/xml-xcb/spec.scm
  6. BIN libguile_xcb_expression.so
  7. +129 −0 xcb/xml/common.scm
  8. +134 −0 xcb/xml/struct.scm
674 LICENSE
@@ -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>.
78 README.org
@@ -0,0 +1,78 @@
+#+TITLE: guile-xcb
+#+AUTHOR: Mark Witmer
+#+DESCRIPTION: A Guile implementation of the X protocol using xml/xcb
+#+TODO: TODO(t) IN_PROGRESS(p) | DONE(d)
+
+* Overview
+
+guile-xcb is a client-side implementation of the X protocol written
+(almost) entirely in Guile. It makes use of the Guile compilation
+infrastructure and virtual machine to parse and compile the xml
+descriptions of the X protocol provided by the xcb project into Guile
+object code files, which can be loaded as modules into a running guile
+process.
+
+The only component of this library not written in Guile so far is the
+code for evaluating expressions; the operators specified in the xml
+files (+, -, /, &, <<, etc.) expect C-like behavior, and the safest
+way to achieve that is to provide a simple wrapper around C arithmetic
+expressions. I would love to replace this with something in pure Guile
+at a future date.
+
+* Documentation
+
+I will provide documentation for this package as development
+progresses and it becomes usable. The basic API will be similar to the
+C xcb api, but with syntactic adaptations making it more suitable for
+use in scheme programming (vectors or lists instead of iterators,
+callbacks to handle responses rather than cookies, etc.)
+
+* Simple Definitions
+
+I always wish projects like this would explain their acronyms and
+jargon, so here are a few definitions:
+
+- *Guile*: "GNU Ubiquitous Intelligent Language for Extensions": a
+ programming system that includes an implementation of the scheme
+ programming language, a compiler for other languages, and a virtual
+ machine
+- *Lisp*: Any one of a number of programming languages, primarily
+ identified by their use of s-expressions
+- *Scheme*: A variant of lisp that focuses on minimal language design
+ and expressive syntax
+- *s-expression*: Syntax where a list of elements are enclosed in
+ parentheses and separated by spaces. eg. /(list 1 2 3)/. The first
+ element in the list is often interpreted as an operator, with the
+ subsequent elements treated as arguments to the first.
+- *X*: A windowing system originally implemented for Unix-based
+ systems. It has a client-server architecture where the server does
+ all the behind-the-scenes calculations for managing windows on a
+ graphical display, but leaves the actual rendering up to clients
+- *X protocol*: A standardized set of requests, replies, and events
+ that an X server uses to communicate with its clients
+- *xcb*: This stands for "X C Bindings", a C library that implements
+ the client side of the X protocol.
+- *xml/xcb*: The underlying specification of the X protocol and
+ several common extensions that xcb uses, written in xml. The C code
+ is generated by running an xslt transformation on the xml files.
+- *xslt*: "Extensible Stylesheet Language Transformations," a
+ programming language using xml syntax frequently used to transfer
+ one file (usually xml) into another file of a different format
+
+* Author
+
+Mark Witmer is the author of this library. You can contact him at
+[[mark@markwitmer.com]].
+
+* Status
+
+Here is a brief outline of steps required to get this working, and
+their current status:
+
+** DONE Parse xml files using sxml-match
+** DONE Extract documentation and make it interactively browseable
+** DONE Add typechecking for fields sent to and from the X server
+** IN_PROGRESS Define structures with fields, lists, and padding
+** TODO Implement packing/unpacking structures to binary representation
+** TODO Connect to/disconnect from X server
+** TODO Send/receive requests, replies, and events
77 expression.c
@@ -0,0 +1,77 @@
+// Make sure xcb expression arithmetic behaves EXACTLY like it would
+// in C... by implementing it in C!
+
+#include <libguile.h>
+
+
+SCM
+plus_wrapper (SCM val1, SCM val2)
+{
+ return scm_from_int(scm_to_int(val1) + scm_to_int(val2));
+}
+
+SCM
+minus_wrapper (SCM val1, SCM val2)
+{
+ return scm_from_int(scm_to_int(val1) - scm_to_int(val2));
+}
+
+SCM
+multiply_wrapper (SCM val1, SCM val2)
+{
+ return scm_from_int(scm_to_int(val1) * scm_to_int(val2));
+}
+
+SCM
+divide_wrapper (SCM val1, SCM val2)
+{
+ return scm_from_int(scm_to_int(val1) / scm_to_int(val2));
+}
+
+SCM
+logand_wrapper (SCM val1, SCM val2)
+{
+ return scm_from_int(scm_to_int(val1) & scm_to_int(val2));
+}
+
+SCM
+lshift_wrapper (SCM val1, SCM val2)
+{
+ return scm_from_int(scm_to_int(val1) << scm_to_int(val2));
+}
+
+SCM
+lognot_wrapper (SCM val)
+{
+ return scm_from_int(~scm_to_int(val));
+}
+
+
+SCM
+popcount_wrapper (SCM val)
+{
+ scm_t_int32 int_val;
+ int popcount, bit;
+
+ int_val = scm_to_int(val);
+ popcount = int_val & 0x1;
+
+ while(int_val = int_val >> 1) {
+ popcount += int_val & 0x1;
+ }
+
+ return scm_from_int(popcount);
+}
+
+void
+init_xcb_expressions ()
+{
+ scm_c_define_gsubr ("xcb-add", 2, 0, 0, plus_wrapper);
+ scm_c_define_gsubr ("xcb-subtract", 2, 0, 0, minus_wrapper);
+ scm_c_define_gsubr ("xcb-multiply", 2, 0, 0, multiply_wrapper);
+ scm_c_define_gsubr ("xcb-divide", 2, 0, 0, divide_wrapper);
+ scm_c_define_gsubr ("xcb-lsh", 2, 0, 0, lshift_wrapper);
+ scm_c_define_gsubr ("xcb-not", 1, 0, 0, lognot_wrapper);
+ scm_c_define_gsubr ("xcb-and", 2, 0, 0, logand_wrapper);
+ scm_c_define_gsubr ("xcb-popcount", 1, 0, 0, popcount_wrapper);
+}
600 language/xml-xcb/compile-scheme.scm
@@ -0,0 +1,600 @@
+(define-module (language xml-xcb compile-scheme)
+ #:use-module (ice-9 regex)
+ #:use-module (ice-9 receive)
+ #:use-module (srfi srfi-1)
+ #:use-module (sxml simple)
+ #:use-module (sxml match))
+
+(load-extension "libguile_xcb_expression" "init_xcb_expressions")
+
+(define-public (parse-file file)
+ (with-input-from-file file
+ (lambda ()
+ (let ((exp (xml->sxml #:trim-whitespace? #t)))
+ (compile-body (if (eq? (caadr exp) '*PI*)
+ (caddr exp)
+ (cadr exp))
+ #f)))))
+
+(define-public (parse-string string)
+ (let ((exp (xml->sxml string #:trim-whitespace? #t)))
+ (compile-body (if (eq? (caadr exp) '*PI*)
+ (caddr exp)
+ (cadr exp))
+ #f)))
+
+(define-public (compile-scheme exp env opts)
+ (values
+ (compile-body
+ (if (eq? (caadr exp) '*PI*)
+ (caddr exp)
+ (cadr exp))
+ env)
+ env
+ env))
+
+(define (false-or pred?) (lambda (exp) (or (not exp) (pred? exp))))
+
+(define (xml-boolean? value)
+ (and
+ (string? value)
+ (or (equal? (string-downcase value) "true")
+ (equal? (string-downcase value) "false"))))
+
+(define hex-integer-regexp "^0x[0-9a-fA-F]+$")
+(define xml-integer-regexp "^[-+]?[0-9]+$")
+
+(define (xml-integer? value)
+ (if (string-match xml-integer-regexp value) #t #f))
+
+(define (dec-or-hex-integer? value)
+ (or
+ (xml-integer? value)
+ (and
+ (string? value)
+ (if (string-match hex-integer-regexp value) #t #f))))
+
+(define element-syntax
+ (make-record-type
+ 'element-syntax
+ '(tag syntax documentation)
+ (lambda (el port)
+ (display
+ (format #f "<element-syntax [~a]>"
+ (element-syntax-tag el))
+ port))))
+
+(define element-syntax? (record-predicate element-syntax))
+(define element-syntax-tag (record-accessor element-syntax 'tag))
+(define element-syntax-syntax (record-accessor element-syntax 'syntax))
+(define element-syntax-documentation-syntax
+ (record-accessor element-syntax 'documentation))
+(define make-element-syntax (record-constructor element-syntax))
+
+(define combine-matchers
+ (lambda matchers
+ (lambda (exp)
+ (let perform-match ((matcher (car matchers)) (rest (cdr matchers)))
+ (or (matcher exp #t)
+ (if (null? rest)
+ (xml-xcb-parse-error exp #f)
+ (perform-match (car rest) (cdr rest))))))))
+
+(define (xml-xcb-parse-error exp ignore-error?)
+ (if ignore-error?
+ #f
+ (error "xml-xcb: invalid expression"
+ (with-output-to-string (lambda () (sxml->xml exp))))))
+
+(define (partition-elements elements . groups)
+ (let ((result-list
+ (let partition-element ((inner-elements elements) (inner-groups groups))
+ (if (null? inner-groups)
+ (if (> (length inner-elements) 0)
+ (error (format #f "xml-xcb: Unmatched tags ~a element list ~a"
+ inner-elements
+ elements))
+ '())
+ (receive (matches rest)
+ (partition
+ (lambda (element)
+ (eq? (element-syntax-tag element) (caar inner-groups)))
+ inner-elements)
+ (if (and (cadar inner-groups)
+ (< (length matches) (cadar inner-groups)))
+ (error (format #f "Too few instances of ~a in element list ~a"
+ (caar inner-groups) elements)))
+ (if (and (caddar inner-groups)
+ (> (length matches) (caddar inner-groups)))
+ (error (format #f "Too many instances of ~a in element list ~a"
+ (caar inner-groups) elements)))
+ (cons matches (partition-element rest (cdr inner-groups))))))))
+ (apply values result-list)))
+
+
+(define (proc-for-op op)
+ (case (string->symbol op)
+ ((+) 'xcb-add)
+ ((-) 'xcb-subtract)
+ ((*) 'xcb-multiply)
+ ((~) 'xcb-not)
+ ((/) 'xcb-divide)
+ ((&) 'xcb-and)
+ ((<<) 'xcb-lsh)))
+
+(define* (exprfield-match exp #:optional ignore-error?)
+ (sxml-match exp
+ ((exprfield (@ (name ,name)
+ (type ,type)
+ (enum (,enum #f))
+ (altenum (,altenum #f))
+ (mask (,mask #f)))
+ ,[expression-match -> expression])
+ (guard
+ (string? name)
+ (string? type)
+ ((false-or string?) enum)
+ ((false-or string?) altenum)
+ ((false-or string?) mask))
+ (make-element-syntax 'exprfield expression #f))
+ (,otherwise (xml-xcb-parse-error exp ignore-error?))))
+
+(define* (reply-match exp request-name #:optional ignore-error?)
+ (sxml-match exp
+ ((reply ,[(combine-matchers
+ valueparam-match
+ fields-match
+ switch-match
+ doc-match) -> reply-fields] ...)
+ (receive (pads fields lists valueparams switch doc)
+ (partition-elements reply-fields
+ '(field 0 #f)
+ '(pad 0 #f)
+ '(list 0 #f)
+ '(valueparam 0 #f)
+ '(switch 0 1)
+ '(doc 0 1))
+ (if (= (length (append fields pads lists valueparams)) 0)
+ (error "xml-xcb: Need at least one fields or valueparam element in reply."))
+ (make-element-syntax
+ 'reply
+ #f
+ (if (= (length doc) 1)
+ (element-syntax-documentation-syntax (car doc))
+ #f))))
+ (,otherwise (xml-xcb-parse-error exp ignore-error?))))
+
+(define* (valueparam-match exp #:optional ignore-error?)
+ (sxml-match exp
+ ((valueparam (@ (value-mask-type ,value-mask-type)
+ (value-mask-name ,value-mask-name)
+ (value-list-name ,value-list-name)))
+ (guard
+ (string? value-mask-type)
+ (string? value-mask-name)
+ (string? value-list-name))
+ (make-element-syntax 'valueparam #f #f))
+ (,otherwise (xml-xcb-parse-error exp ignore-error?))))
+
+(define* (field-match exp #:optional ignore-error?)
+ (sxml-match exp
+ ((field (@ (name ,name)
+ (type ,type)
+ (enum (,enum #f))
+ (altenum (,altenum #f))
+ (mask (,mask #f))))
+ (guard
+ (string? name)
+ (string? type)
+ ((false-or string?) enum)
+ ((false-or string?) altenum)
+ ((false-or string?) mask))
+ (make-element-syntax 'field #f #f))
+ (,otherwise (xml-xcb-parse-error exp ignore-error?))))
+
+(define* (pad-match exp #:optional ignore-error?)
+ (sxml-match exp
+ ((pad (@ (bytes ,bytes)))
+ (guard
+ (xml-integer? bytes))
+ (make-element-syntax 'pad #f #f))
+ (,otherwise (xml-xcb-parse-error exp ignore-error?))))
+
+(define* (list-match exp #:optional ignore-error?)
+ (sxml-match exp
+ ((non-scheme-list (@ (name ,name)
+ (type ,type)
+ (enum (,enum #f))
+ (altenum (,altenum #f))
+ (mask (,mask #f)))
+ ,[expression-match -> expression] ...)
+ (guard
+ (string? name)
+ (string? type)
+ ((false-or string?) enum)
+ ((false-or string?) altenum)
+ ((false-or string?) mask))
+ (make-element-syntax 'list #f #f))
+ (,otherwise (xml-xcb-parse-error exp ignore-error?))))
+
+(define* (fields-match exp #:optional ignore-errors?)
+ (or (pad-match exp #t)
+ (field-match exp #t)
+ (if (eq? (car exp) 'list)
+ (list-match (cons 'non-scheme-list (cdr exp))) #f)
+ (xml-xcb-parse-error exp ignore-errors?)))
+
+(define* (switch-match exp #:optional ignore-errors?)
+ (sxml-match exp
+ ((switch (@ (name ,name))
+ ,[(combine-matchers
+ bitcase-match
+ expression-match
+ fields-match) -> switch-fields] ...)
+ (guard
+ (string? name))
+ (receive (bitcases expressions pads lists fields)
+ (partition-elements switch-fields
+ '(bitcase 1 #f)
+ '(expression 1 1)
+ '(pads 0 1)
+ '(lists 0 1)
+ '(fields 0 1))
+ (if (> (length (append pads lists fields)) 1)
+ (error "xml-xcb: Too many fields in switch expression"))
+ (make-element-syntax 'switch #f #f)))
+ (,otherwise (xml-xcb-parse-error exp ignore-errors?))))
+
+(define* (item-match exp #:optional ignore-errors?)
+ (sxml-match exp
+ ((item (@ (name (,name #f)))
+ ,[(combine-matchers
+ doc-match
+ expression-match) -> expressions-or-docs] ...)
+ (guard
+ ((false-or string?) name))
+ (receive (expression doc)
+ (partition-elements expressions-or-docs
+ '(expression 0 1)
+ '(doc 0 1))
+ (make-element-syntax
+ 'item
+ `(,(string->symbol name)
+ ((value
+ ,(if (= (length expression) 1)
+ `(,'unquote ,(element-syntax-syntax (car expression)))
+ (string->symbol name)))))
+ `(,name ,doc))))
+ (,otherwise (xml-xcb-parse-error exp ignore-errors?))))
+
+(define* (bitcase-match exp #:optional ignore-errors?)
+ (sxml-match exp
+ ((bitcase (@ (name (,name #f)))
+ ,[expression-match -> expression]
+ ,[(combine-matchers
+ fields-match
+ switch-match) -> fields] ...)
+ (guard
+ ((false-or string?) name))
+ (make-element-syntax 'bitcase #f #f))
+ (,otherwise (xml-xcb-parse-error exp ignore-errors?))))
+
+(define (macro-match exp)
+ (sxml-match exp
+ ((request (@ (name ,name)
+ (opcode ,opcode)
+ (combine-adjacent (,combine-adjacent #f)))
+ ,[(combine-matchers
+ exprfield-match
+ valueparam-match
+ fields-match
+ switch-match
+ (lambda* (el #:optional ignore-error?)
+ (reply-match el name ignore-error?))
+ doc-match) -> request-fields] ...)
+ (guard
+ (string? name)
+ (xml-integer? opcode)
+ ((false-or xml-boolean?) combine-adjacent))
+ (receive (exprfields valueparams fields pads lists switches replies doc)
+ (partition-elements request-fields
+ '(exprfield 0 #f)
+ '(field 0 #f)
+ '(pad 0 #f)
+ '(list 0 #f)
+ '(valueparam 0 #f)
+ '(switch 0 1)
+ '(reply 0 1)
+ '(doc 0 1))
+
+ (make-element-syntax
+ 'request #f
+ (if (= (length doc) 1)
+ `(begin
+ (register-documentation xcbdoc
+ 'request ,name
+ ,(element-syntax-documentation-syntax (car doc)))
+ ,(if (and
+ (= (length replies) 1)
+ (element-syntax-documentation-syntax (car replies)))
+ `(register-documentation xcbdoc
+ 'reply ,name
+ ,(element-syntax-documentation-syntax (car replies)))
+ #f))
+ #f))))
+ ((event (@ (name ,name)
+ (number ,number)
+ (no-sequence-number (,no-sequence-number? #f)))
+ ,[(combine-matchers
+ doc-match
+ fields-match) -> fields] ...)
+ (guard
+ (string? name)
+ (xml-integer? number)
+ ((false-or xml-boolean?) no-sequence-number?))
+ (receive (doc pad field list)
+ (partition-elements fields
+ '(doc 0 1)
+ '(pad 0 #f)
+ '(field 0 #f)
+ '(list 0 #f))
+ (make-element-syntax
+ 'event
+ #f
+ (if (= (length doc) 1)
+ `(register-documentation xcbdoc
+ 'event ,name
+ ,(element-syntax-documentation-syntax (car doc)))
+ #f))))
+ ((eventcopy (@ (name ,name)
+ (number ,number)
+ (ref ,ref)))
+ (guard
+ (string? name)
+ (xml-integer? number)
+ (string? ref))
+ (make-element-syntax 'eventcopy #f #f))
+ ((errorcopy (@ (name ,name)
+ (number ,number)
+ (ref ,ref)))
+ (guard
+ (string? name)
+ (xml-integer? number)
+ (string? ref))
+ (make-element-syntax 'errorcopy #f #f))
+ ((error (@ (name ,name)
+ (number ,number))
+ ,[fields-match -> fields] ...)
+ (guard
+ (string? name)
+ (xml-integer? number))
+ (receive (fields pads lists)
+ (partition-elements fields
+ '(field 0 #f)
+ '(pad 0 #f)
+ '(list 0 #f))
+ (make-element-syntax 'error #f #f)))
+ ((import ,import) (guard (string? import))
+ (make-element-syntax 'import #f #f))
+ ((xidtype (@ (name ,name))) (guard (string? name))
+ (make-element-syntax 'xidtype #f #f))
+ ((xidunion (@ (name ,name))
+ (type ,types) ...)
+ (guard
+ (string? name)
+ (>= (length types) 1)
+ (every string? types))
+ (make-element-syntax 'xidunion #f #f))
+ ((enum (@ (name ,name))
+ ,[(combine-matchers
+ item-match
+ doc-match) -> elements] ...)
+ (guard
+ (string? name))
+ (receive (items doc)
+ (partition-elements elements
+ '(item 1 #f)
+ '(doc 0 1))
+ (make-element-syntax
+ 'enum
+ `(define-public
+ ,(string->symbol name)
+ (,'quasiquote (,@(map
+ (lambda (item)
+ (element-syntax-syntax item)) items))))
+ (if (= (length doc) 1)
+ `(register-documentation xcbdoc
+ 'event ,name
+ ,(element-syntax-documentation-syntax (car doc)))
+ #f))))
+ ((typedef (@ (oldname ,oldname)
+ (newname ,newname)))
+ (guard (string? oldname)
+ (string? newname))
+ newname)
+ ((struct (@ (name ,name))
+ ,[(combine-matchers
+ fields-match
+ switch-match) -> fields] ...)
+ (guard
+ (string? name))
+ (receive (fields pads lists switches)
+ (partition-elements fields
+ '(field 0 #f)
+ '(list 0 #f)
+ '(pad 0 #f)
+ '(switch 0 1))
+ (if (= (length (append fields lists pads)) 0)
+ (error "xml-xcb: struct must contain at least one fields element"))
+ (make-element-syntax 'struct #f #f)))
+ ((union (@ (name ,name))
+ ,[(combine-matchers
+ switch-match
+ fields-match) -> fields] ...)
+ (guard
+ (string? name))
+ (receive (fields pads lists switches)
+ (partition-elements fields
+ '(field 0 #f)
+ '(list 0 #f)
+ '(pad 0 #f)
+ '(switch 0 1))
+ (if (= (length (append fields lists pads)) 0)
+ (error "xml-xcb: struct must contain at least one fields element"))
+ (make-element-syntax 'struct #f #f)))
+ (,otherwise (xml-xcb-parse-error exp #f))))
+
+(define* (expression-match exp #:optional ignore-errors?)
+ (sxml-match exp
+ ((op (@ (op ,op))
+ ,[expression-match -> expression1]
+ ,[expression-match -> expression2])
+ (guard
+ (find (lambda (el) (equal? el op)) '("+" "-" "/" "*" "&" "<<")))
+ (make-element-syntax
+ 'expression
+ `(,(proc-for-op op) ,expression1 ,expression2)
+ #f))
+ ((unop (@ (op ,op))
+ ,[expression-match -> expression])
+ (guard (equal? op "~"))
+ (make-element-syntax
+ 'expression
+ `(,(proc-for-op op) ,expression)
+ #f))
+ ((fieldref ,fieldref) (guard (string? fieldref))
+ (make-element-syntax 'expression #f #f))
+ ((enumref (@ (ref ,ref)) ,enumref) (guard (string? enumref) (string? ref))
+ (make-element-syntax 'expression #f #f))
+ ((sumof (@ (ref ,ref))) (guard (string? ref))
+ (make-element-syntax
+ 'expression
+ `(fold
+ xcb-add
+ 0
+ (map
+ (lambda (listel) (listel))
+ (xcb-list-elements ,(string->symbol ref))))
+ #f))
+ ((popcount ,[expression-match -> expression])
+ (make-element-syntax 'expression `(xcb-popcount ,expression) #f))
+ ((value ,value) (guard (dec-or-hex-integer? value))
+ (make-element-syntax 'expression `(parse-dec-or-hex-integer ,value) #f))
+ ((bit ,bit) (guard (xml-integer? bit))
+ (make-element-syntax 'expression `(xcb-lsh 1 (string->number bit)) #f))
+ (,otherwise (xml-xcb-parse-error exp ignore-errors?))))
+
+(define (doc-fields-match exp)
+ (sxml-match exp
+ ((field (@ (name ,name)) ,cdata)
+ (guard
+ (string? cdata)
+ (string? name))
+ (make-element-syntax 'field #f `((name . ,name) (description . ,cdata))))
+ ((field (@ (name ,name)))
+ (guard
+ (string? name))
+ (make-element-syntax 'field #f `((name . ,name) (description . #f))))
+ ((error (@ (type ,type)) ,cdata)
+ (guard
+ (string? cdata)
+ (string? type))
+ (make-element-syntax 'error #f `((type . ,type) (description . ,cdata))))
+ ((error (@ (type ,type))) (guard (string? type))
+ (make-element-syntax 'error #f `((type . ,type) (description . #f))))
+ ((brief ,brief) (guard (string? brief))
+ (make-element-syntax 'brief #f brief))
+ ((description ,description) (guard (string? description))
+ (make-element-syntax 'description #f description))
+ ((example ,example) (guard (string? example))
+ (make-element-syntax 'example #f example))
+ ((see (@ (name ,name)
+ (type ,type)))
+ (guard (string? name)
+ (string? type))
+ (make-element-syntax 'see #f `((name . ,name) (type . ,(string->symbol type)))))
+ (,otherwise (xml-xcb-parse-error exp #f))))
+
+(define* (doc-match exp #:optional ignore-errors?)
+ (sxml-match exp
+ ((doc ,[doc-fields-match -> doc-fields] ...)
+ (receive (fields errors see brief description example)
+ (partition-elements doc-fields
+ '(field 0 #f)
+ '(error 0 #f)
+ '(see 0 #f)
+ '(brief 0 1)
+ '(description 0 1)
+ '(example 0 1))
+ (make-element-syntax
+ 'doc
+ #f
+ (let ((extract-documentation-syntax
+ (lambda* (var sym #:optional flatten?)
+ (let ((syn (map (lambda (el)
+ (element-syntax-documentation-syntax el))
+ var)))
+ (if (> (length var) 0)
+ (list
+ (if flatten?
+ `(,sym . ,(car syn))
+ `(,sym . ,syn)))
+ '())))))
+ `(,'quote (,@(extract-documentation-syntax fields 'fields)
+ ,@(extract-documentation-syntax errors 'errors)
+ ,@(extract-documentation-syntax see 'see)
+ ,@(extract-documentation-syntax brief 'brief #t)
+ ,@(extract-documentation-syntax description 'description #t)
+ ,@(extract-documentation-syntax example 'example #t)))))))
+ (,otherwise (xml-xcb-parse-error exp ignore-errors?))))
+
+
+(define (compile-body exp env)
+ (sxml-match exp
+ ((xcb (@ (header ,header)
+ (extension-xname (,extension-xname #f))
+ (extension-name (,extension-name #f))
+ (extension-multiword (,extension-multiword? #f))
+ (major-version (,major-version #f))
+ (minor-version (,minor-version #f)))
+ ,[macro-match -> macros] ...)
+ (guard
+ (string? header)
+ ((false-or string?) extension-xname)
+ ((false-or string?) extension-name)
+ ((false-or xml-boolean?) extension-multiword?)
+ ((false-or xml-integer?) major-version)
+ ((false-or xml-integer?) minor-version))
+ (receive (enums
+ events
+ requests
+ eventcopies
+ errorcopies
+ structs
+ unions
+ xidtypes
+ xidunions
+ typedefs
+ imports)
+ (partition-elements (filter element-syntax? macros)
+ '(enum 0 #f)
+ '(event 0 #f)
+ '(request 0 #f)
+ '(error 0 #f)
+ '(eventcopy 0 #f)
+ '(errorcopy 0 #f)
+ '(struct 0 #f)
+ '(union 0 #f)
+ '(xidtype 0 #f)
+ '(xidunion 0 #f)
+ '(typedef 0 #f)
+ '(import 0 #f))
+ `(begin
+ (define-module (xcb xml ,(string->symbol header))
+ #:use-module (xcb xml common))
+ (define xcbdoc (make-hash-table))
+ ,@(delete #f (map element-syntax-documentation-syntax requests))
+ (register-xcb-documentation ,(string->symbol header) xcbdoc))))
+ (,otherwise
+ (error "xml-xcb: invalid expression"
+ (with-output-to-string (lambda () (sxml->xml otherwise)))))))
17 language/xml-xcb/spec.scm
@@ -0,0 +1,17 @@
+(define-module (language xml-xcb spec)
+ #:use-module (sxml simple)
+ #:use-module (language xml-xcb compile-scheme)
+ #:use-module (system base language)
+ #:export (xml-xcb))
+
+(define-language xml-xcb
+ #:title "xml-xcb"
+ #:reader (lambda (port env)
+ (while (and (not (eof-object? (peek-char port)))
+ (char-whitespace? (peek-char port)))
+ (read-char port))
+ (if (eof-object? (peek-char port))
+ (peek-char port)
+ (xml->sxml port #:trim-whitespace? #t)))
+ #:compilers `((scheme . ,compile-scheme))
+ #:printer write)
BIN libguile_xcb_expression.so
Binary file not shown.
129 xcb/xml/common.scm
@@ -0,0 +1,129 @@
+(define-module (xcb xml common)
+ #:use-module (srfi srfi-2)
+ #:use-module (srfi srfi-9)
+ #:use-module (srfi srfi-9 gnu)
+ #:use-module (ice-9 regex)
+ #:export (typed-value
+ typed-value-predicate
+ typed-value-value
+ typed-value?
+ make-typed-value))
+
+(define hex-integer-regexp "^0x[0-9a-fA-F]+$")
+(define xml-integer-regexp "^[-+]?[0-9]+$")
+
+(define-record-type typed-value
+ (make-typed-value value predicate)
+ typed-value?
+ (value typed-value-value)
+ (predicate typed-value-predicate))
+
+(set-record-type-printer!
+ typed-value
+ (lambda (value port)
+ (format
+ port "<~a: ~a>"
+ (procedure-name (typed-value-predicate value))
+ (typed-value-value value))))
+
+(define-public (typed-value-check val)
+ ((typed-value-predicate val) val))
+
+(define-once documentation (make-hash-table))
+
+(define (unsigned-bit-length-predicate bits)
+ (lambda (n)
+ (and (integer? n)
+ (>= n 0)
+ (and (<= (integer-length n) bits)))))
+
+(define-public (card8? n) (unsigned-bit-length-predicate 8))
+(define-public (card16? n) (unsigned-bit-length-predicate 16))
+(define-public (card32? n) (unsigned-bit-length-predicate 32))
+
+(define (hash-force-nested-set! h keys value)
+ (if (= (length keys) 1)
+ (if (hash-ref h (car keys) #f)
+ (error "xml-xcb: Overwriting pre-existing documentation for" keys)
+ (hash-set! h (car keys) value))
+ (let ((subhash (or (hash-ref h (car keys) #f) (make-hash-table))))
+ (hash-force-nested-set! subhash (cdr keys) value)
+ (hash-set! h (car keys) subhash))))
+
+(define (hash-nested-ref h keys)
+ (if (> (length keys) 1)
+ (let ((next-hash (hash-ref h (car keys) #f)))
+ (if next-hash (hash-nested-ref next-hash (cdr keys)) #f))
+ (hash-ref h (car keys) #f)))
+
+(define-public (register-documentation dochash type path doc)
+ (hash-force-nested-set! dochash
+ (if (list? path)
+ (cons type path)
+ (list type path)) doc))
+
+(define-public (register-xcb-documentation header doc)
+ (hash-set! documentation header doc))
+
+(define (display-documentation-multifield name lst)
+ (format #t "\n~a:\n-------" name)
+ (for-each (lambda (field)
+ (format #t "\n~a~a\n----------\n"
+ (assq-ref field 'name)
+ (if (assq-ref field 'type)
+ (format #f " ~a" (assq-ref field 'type)) ""))
+ (if (assq-ref field 'description)
+ (format #t "~a" (assq-ref field 'description)))) lst)
+ (newline))
+
+(define-public (print-documentation documentation)
+ (print-documentation-brief documentation)
+ (let ((fields
+ (assq-ref documentation 'fields))
+ (errors
+ (assq-ref documentation 'errors))
+ (see
+ (assq-ref documentation 'see))
+ (description
+ (assq-ref documentation 'description))
+ (example
+ (assq-ref documentation 'example)))
+ (if description
+ (format #t "\nDescription: ~a\n\n" description))
+ (if fields (display-documentation-multifield "Fields" fields))
+ (if errors (display-documentation-multifield "Errors" errors))
+ (if see (begin
+ (format #t "See Also:\n---------")
+ (map (lambda (see-field)
+ (format #t "\nType: ~a Name: ~a"
+ (assq-ref see-field 'type)
+ (assq-ref see-field 'name))) see)))
+ (if example
+ (format #t "\nExample: ~a\n\n" example)))
+ (newline))
+
+(define-public (print-documentation-brief documentation)
+ (and-let* ((brief (assq-ref documentation 'brief)))
+ (format #t "\nBrief: ~a\n\n" brief)))
+
+(define-public (document-brief type path)
+ (document type path print-documentation-brief))
+
+(define-public (document-full type path)
+ (document type path print-documentation))
+
+(define (document type path proc)
+ (let ((my-documentation
+ (hash-nested-ref
+ documentation
+ (if (list? path)
+ (cons type path)
+ (list type path)))))
+ (if my-documentation
+ (proc my-documentation)
+ (format #t "No documentation found for ~a in type ~a\n" path type))))
+
+(define-public (parse-dec-or-hex-integer value)
+ (if (string-match hex-integer-regexp value)
+ (string->number (substring value 2) 16)
+ (string->number value)))
134 xcb/xml/struct.scm
@@ -0,0 +1,134 @@
+(define-module (xcb xml struct)
+ #:use-module (srfi srfi-9)
+ #:use-module (srfi srfi-1)
+ #:use-module (srfi srfi-9 gnu)
+ #:use-module (ice-9 receive)
+ #:export (define-xcb-struct))
+
+(define-record-type xcb-struct
+ (make-xcb-struct underlying-record-type types field-order)
+ xcb-struct?
+ (underlying-record-type underlying-record-type)
+ (types types)
+ (field-order field-order))
+
+(define-record-type typed-value
+ (make-typed-value value predicate)
+ typed-value?
+ (value typed-value-value)
+ (predicate typed-value-predicate))
+
+(set-record-type-printer!
+ typed-value
+ (lambda (value port)
+ (format
+ port "<~a (~a)>"
+ (typed-value-value value)
+ (let ((name (procedure-name (typed-value-predicate value))))
+ (if name name (typed-value-predicate value))))))
+
+(define-syntax type-self-predicate
+ (syntax-rules ()
+ ((_ name)
+ (letrec ((name (lambda (val)
+ (eq? (typed-value-predicate val) name))))
+ (set-object-property! name 'opqaue? #t)
+ name))))
+
+(define-public (type-predicate predicate)
+ (lambda (val)
+ (predicate (typed-value-value val))))
+
+(define-syntax define-xcb-struct
+ (syntax-rules ()
+ ((define-xcb-struct type
+ (constructor constructor-tag ...)
+ predicate
+ (field-tag type-predicate . more) ...)
+ (begin
+ (define type
+ (make-xcb-struct-for-record-type 'type `((field-tag . ,type-predicate) ...)))
+ (define constructor
+ (xcb-struct-constructor type '(constructor-tag ...)))
+ (define predicate
+ (xcb-struct-predicate type))
+ (define-xcb-struct-field type field-tag type-predicate . more)
+ ...))))
+
+(define-syntax define-xcb-struct-field
+ (syntax-rules (*pad* *list*)
+ ((define-xcb-struct-field type field-tag type-predicate accessor)
+ (define accessor (xcb-struct-accessor type 'field-tag)))
+ ((define-xcb-struct-field type field-tag type-predicate accessor modifier)
+ (begin
+ (begin
+ (define accessor (xcb-struct-accessor type 'field-tag))
+ (define modifier (xcb-struct-modifier type 'field-tag)))))
+ ((define-xcb-struct-field type field-tag type-predicate *list* accessor modifier)
+ (begin
+ (begin
+ (define accessor (xcb-struct-vector-accessor type 'field-tag))
+ (define modifier (xcb-struct-vector-modifier type 'field-tag)))))
+ ((define-xcb-struct-field type *pad* size) *unspecified*)))
+
+(define (make-xcb-struct-for-record-type type field-specifiers)
+ (let ((types (make-hash-table)))
+ (for-each (lambda (field-specifier)
+ (if (not (eq? (car field-specifier) '*pad*))
+ (hashq-set! types (car field-specifier) (cdr field-specifier))))
+ field-specifiers)
+ (make-xcb-struct
+ (make-record-type 'type (delete '*pad* (map car field-specifiers)))
+ types
+ field-specifiers)))
+
+(define (typecheck value)
+ (if (not ((typed-value-predicate value) value))
+ (error (format #f "Value ~a does not satisfy its type predicate" (typed-value-value value))
+ (typed-value-predicate value)))
+ value)
+
+(define (xcb-struct-constructor type fields)
+ (receive (list-fields non-list-fields)
+ (partition pair? fields)
+ (lambda args
+ (let ((new-record
+ (apply
+ (record-constructor
+ (underlying-record-type type)
+ non-list-fields)
+ (map
+ (lambda (arg field)
+ (if (typed-value? arg)
+ (typecheck arg)
+ (typecheck (make-typed-value arg (hashq-ref (types type) field)))))
+ args non-list-fields))))
+ new-record))))
+
+(define (xcb-struct-predicate type)
+ (record-predicate (underlying-record-type type)))
+
+(define (xcb-struct-accessor type field-tag)
+ (lambda (rec)
+ (let ((value ((record-accessor (underlying-record-type type) field-tag) rec)))
+ (if (object-property (typed-value-predicate value) 'opaque?)
+ value
+ (typed-value-value value)))))
+
+(define (xcb-struct-vector-accessor type field-tag)
+ (lambda (rec n)
+ (vector-ref ((xcb-struct-accessor type field-tag)) n)))
+
+(define (xcb-struct-vector-modifier type field-tag)
+ (lambda (rec n arg)
+ (let ((val (if (typed-value? arg)
+ (typecheck arg)
+ (typecheck (make-typed-value arg (hashq-ref (types type) field-tag))))))
+ (vector-set! ((xcb-struct-accessor type field-tag)) n val))))
+
+(define (xcb-struct-modifier type field-tag)
+ (lambda (rec arg)
+ (let ((val (if (typed-value? arg)
+ (typecheck arg)
+ (typecheck (make-typed-value arg (hashq-ref (types type) field-tag))))))
+ ((record-modifier (underlying-record-type type) field-tag) rec val))))

0 comments on commit d9f381e

Please sign in to comment.
Something went wrong with that request. Please try again.