Initial revision

18 files changed, 1620 insertions, 0 deletions

diff --git a/libXamine/COPYING.LIB b/libXamine/COPYING.LIB
new file mode 100644
index 0000000..b124cf5
--- /dev/null
+++ b/libXamine/COPYING.LIB
@@ -0,0 +1,510 @@
+
+                  GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 2.1, February 1999
+
+ Copyright (C) 1991, 1999 Free Software Foundation, Inc.
+     59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+[This is the first released version of the Lesser GPL.  It also counts
+ as the successor of the GNU Library Public License, version 2, hence
+ the version number 2.1.]
+
+                            Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+Licenses are intended to guarantee your freedom to share and change
+free software--to make sure the software is free for all its users.
+
+  This license, the Lesser General Public License, applies to some
+specially designated software packages--typically libraries--of the
+Free Software Foundation and other authors who decide to use it.  You
+can use it too, but we suggest you first think carefully about whether
+this license or the ordinary General Public License is the better
+strategy to use in any particular case, based on the explanations
+below.
+
+  When we speak of free software, we are referring to freedom of use,
+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 this service if you wish); that you receive source code or can get
+it if you want it; that you can change the software and use pieces of
+it in new free programs; and that you are informed that you can do
+these things.
+
+  To protect your rights, we need to make restrictions that forbid
+distributors to deny you these rights or to ask you to surrender these
+rights.  These restrictions translate to certain responsibilities for
+you if you distribute copies of the library or if you modify it.
+
+  For example, if you distribute copies of the library, whether gratis
+or for a fee, you must give the recipients all the rights that we gave
+you.  You must make sure that they, too, receive or can get the source
+code.  If you link other code with the library, you must provide
+complete object files to the recipients, so that they can relink them
+with the library after making changes to the library and recompiling
+it.  And you must show them these terms so they know their rights.
+
+  We protect your rights with a two-step method: (1) we copyright the
+library, and (2) we offer you this license, which gives you legal
+permission to copy, distribute and/or modify the library.
+
+  To protect each distributor, we want to make it very clear that
+there is no warranty for the free library.  Also, if the library is
+modified by someone else and passed on, the recipients should know
+that what they have is not the original version, so that the original
+author's reputation will not be affected by problems that might be
+introduced by others.
+
+  Finally, software patents pose a constant threat to the existence of
+any free program.  We wish to make sure that a company cannot
+effectively restrict the users of a free program by obtaining a
+restrictive license from a patent holder.  Therefore, we insist that
+any patent license obtained for a version of the library must be
+consistent with the full freedom of use specified in this license.
+
+  Most GNU software, including some libraries, is covered by the
+ordinary GNU General Public License.  This license, the GNU Lesser
+General Public License, applies to certain designated libraries, and
+is quite different from the ordinary General Public License.  We use
+this license for certain libraries in order to permit linking those
+libraries into non-free programs.
+
+  When a program is linked with a library, whether statically or using
+a shared library, the combination of the two is legally speaking a
+combined work, a derivative of the original library.  The ordinary
+General Public License therefore permits such linking only if the
+entire combination fits its criteria of freedom.  The Lesser General
+Public License permits more lax criteria for linking other code with
+the library.
+
+  We call this license the "Lesser" General Public License because it
+does Less to protect the user's freedom than the ordinary General
+Public License.  It also provides other free software developers Less
+of an advantage over competing non-free programs.  These disadvantages
+are the reason we use the ordinary General Public License for many
+libraries.  However, the Lesser license provides advantages in certain
+special circumstances.
+
+  For example, on rare occasions, there may be a special need to
+encourage the widest possible use of a certain library, so that it
+becomes a de-facto standard.  To achieve this, non-free programs must
+be allowed to use the library.  A more frequent case is that a free
+library does the same job as widely used non-free libraries.  In this
+case, there is little to gain by limiting the free library to free
+software only, so we use the Lesser General Public License.
+
+  In other cases, permission to use a particular library in non-free
+programs enables a greater number of people to use a large body of
+free software.  For example, permission to use the GNU C Library in
+non-free programs enables many more people to use the whole GNU
+operating system, as well as its variant, the GNU/Linux operating
+system.
+
+  Although the Lesser General Public License is Less protective of the
+users' freedom, it does ensure that the user of a program that is
+linked with the Library has the freedom and the wherewithal to run
+that program using a modified version of the Library.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.  Pay close attention to the difference between a
+"work based on the library" and a "work that uses the library".  The
+former contains code derived from the library, whereas the latter must
+be combined with the library in order to run.
+
+                  GNU LESSER GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License Agreement applies to any software library or other
+program which contains a notice placed by the copyright holder or
+other authorized party saying it may be distributed under the terms of
+this Lesser General Public License (also called "this License").
+Each licensee is addressed as "you".
+
+  A "library" means a collection of software functions and/or data
+prepared so as to be conveniently linked with application programs
+(which use some of those functions and data) to form executables.
+
+  The "Library", below, refers to any such software library or work
+which has been distributed under these terms.  A "work based on the
+Library" means either the Library or any derivative work under
+copyright law: that is to say, a work containing the Library or a
+portion of it, either verbatim or with modifications and/or translated
+straightforwardly into another language.  (Hereinafter, translation is
+included without limitation in the term "modification".)
+
+  "Source code" for a work means the preferred form of the work for
+making modifications to it.  For a library, complete source code means
+all the source code for all modules it contains, plus any associated
+interface definition files, plus the scripts used to control
+compilation and installation of the library.
+
+  Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running a program using the Library is not restricted, and output from
+such a program is covered only if its contents constitute a work based
+on the Library (independent of the use of the Library in a tool for
+writing it).  Whether that is true depends on what the Library does
+and what the program that uses the Library does.
+
+  1. You may copy and distribute verbatim copies of the Library's
+complete source code as you receive it, in any medium, provided that
+you conspicuously and appropriately publish on each copy an
+appropriate copyright notice and disclaimer of warranty; keep intact
+all the notices that refer to this License and to the absence of any
+warranty; and distribute a copy of this License along with the
+Library.
+
+  You may charge a fee for the physical act of transferring a copy,
+and you may at your option offer warranty protection in exchange for a
+fee.
+
+  2. You may modify your copy or copies of the Library or any portion
+of it, thus forming a work based on the Library, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) The modified work must itself be a software library.
+
+    b) You must cause the files modified to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    c) You must cause the whole of the work to be licensed at no
+    charge to all third parties under the terms of this License.
+
+    d) If a facility in the modified Library refers to a function or a
+    table of data to be supplied by an application program that uses
+    the facility, other than as an argument passed when the facility
+    is invoked, then you must make a good faith effort to ensure that,
+    in the event an application does not supply such function or
+    table, the facility still operates, and performs whatever part of
+    its purpose remains meaningful.
+
+    (For example, a function in a library to compute square roots has
+    a purpose that is entirely well-defined independent of the
+    application.  Therefore, Subsection 2d requires that any
+    application-supplied function or table used by this function must
+    be optional: if the application does not supply it, the square
+    root function must still compute square roots.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Library,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Library, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote
+it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Library.
+
+In addition, mere aggregation of another work not based on the Library
+with the Library (or with a work based on the Library) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may opt to apply the terms of the ordinary GNU General Public
+License instead of this License to a given copy of the Library.  To do
+this, you must alter all the notices that refer to this License, so
+that they refer to the ordinary GNU General Public License, version 2,
+instead of to this License.  (If a newer version than version 2 of the
+ordinary GNU General Public License has appeared, then you can specify
+that version instead if you wish.)  Do not make any other change in
+these notices.
+
+  Once this change is made in a given copy, it is irreversible for
+that copy, so the ordinary GNU General Public License applies to all
+subsequent copies and derivative works made from that copy.
+
+  This option is useful when you wish to copy part of the code of
+the Library into a program that is not a library.
+
+  4. You may copy and distribute the Library (or a portion or
+derivative of it, under Section 2) in object code or executable form
+under the terms of Sections 1 and 2 above provided that you accompany
+it with the complete corresponding machine-readable source code, which
+must be distributed under the terms of Sections 1 and 2 above on a
+medium customarily used for software interchange.
+
+  If distribution of object code is made by offering access to copy
+from a designated place, then offering equivalent access to copy the
+source code from the same place satisfies the requirement to
+distribute the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  5. A program that contains no derivative of any portion of the
+Library, but is designed to work with the Library by being compiled or
+linked with it, is called a "work that uses the Library".  Such a
+work, in isolation, is not a derivative work of the Library, and
+therefore falls outside the scope of this License.
+
+  However, linking a "work that uses the Library" with the Library
+creates an executable that is a derivative of the Library (because it
+contains portions of the Library), rather than a "work that uses the
+library".  The executable is therefore covered by this License.
+Section 6 states terms for distribution of such executables.
+
+  When a "work that uses the Library" uses material from a header file
+that is part of the Library, the object code for the work may be a
+derivative work of the Library even though the source code is not.
+Whether this is true is especially significant if the work can be
+linked without the Library, or if the work is itself a library.  The
+threshold for this to be true is not precisely defined by law.
+
+  If such an object file uses only numerical parameters, data
+structure layouts and accessors, and small macros and small inline
+functions (ten lines or less in length), then the use of the object
+file is unrestricted, regardless of whether it is legally a derivative
+work.  (Executables containing this object code plus portions of the
+Library will still fall under Section 6.)
+
+  Otherwise, if the work is a derivative of the Library, you may
+distribute the object code for the work under the terms of Section 6.
+Any executables containing that work also fall under Section 6,
+whether or not they are linked directly with the Library itself.
+
+  6. As an exception to the Sections above, you may also combine or
+link a "work that uses the Library" with the Library to produce a
+work containing portions of the Library, and distribute that work
+under terms of your choice, provided that the terms permit
+modification of the work for the customer's own use and reverse
+engineering for debugging such modifications.
+
+  You must give prominent notice with each copy of the work that the
+Library is used in it and that the Library and its use are covered by
+this License.  You must supply a copy of this License.  If the work
+during execution displays copyright notices, you must include the
+copyright notice for the Library among them, as well as a reference
+directing the user to the copy of this License.  Also, you must do one
+of these things:
+
+    a) Accompany the work with the complete corresponding
+    machine-readable source code for the Library including whatever
+    changes were used in the work (which must be distributed under
+    Sections 1 and 2 above); and, if the work is an executable linked
+    with the Library, with the complete machine-readable "work that
+    uses the Library", as object code and/or source code, so that the
+    user can modify the Library and then relink to produce a modified
+    executable containing the modified Library.  (It is understood
+    that the user who changes the contents of definitions files in the
+    Library will not necessarily be able to recompile the application
+    to use the modified definitions.)
+
+    b) Use a suitable shared library mechanism for linking with the
+    Library.  A suitable mechanism is one that (1) uses at run time a
+    copy of the library already present on the user's computer system,
+    rather than copying library functions into the executable, and (2)
+    will operate properly with a modified version of the library, if
+    the user installs one, as long as the modified version is
+    interface-compatible with the version that the work was made with.
+
+    c) Accompany the work with a written offer, valid for at least
+    three years, to give the same user the materials specified in
+    Subsection 6a, above, for a charge no more than the cost of
+    performing this distribution.
+
+    d) If distribution of the work is made by offering access to copy
+    from a designated place, offer equivalent access to copy the above
+    specified materials from the same place.
+
+    e) Verify that the user has already received a copy of these
+    materials or that you have already sent this user a copy.
+
+  For an executable, the required form of the "work that uses the
+Library" must include any data and utility programs needed for
+reproducing the executable from it.  However, as a special exception,
+the materials to be distributed need not include anything that is
+normally distributed (in either source or binary form) with the major
+components (compiler, kernel, and so on) of the operating system on
+which the executable runs, unless that component itself accompanies
+the executable.
+
+  It may happen that this requirement contradicts the license
+restrictions of other proprietary libraries that do not normally
+accompany the operating system.  Such a contradiction means you cannot
+use both them and the Library together in an executable that you
+distribute.
+
+  7. You may place library facilities that are a work based on the
+Library side-by-side in a single library together with other library
+facilities not covered by this License, and distribute such a combined
+library, provided that the separate distribution of the work based on
+the Library and of the other library facilities is otherwise
+permitted, and provided that you do these two things:
+
+    a) Accompany the combined library with a copy of the same work
+    based on the Library, uncombined with any other library
+    facilities.  This must be distributed under the terms of the
+    Sections above.
+
+    b) Give prominent notice with the combined library of the fact
+    that part of it is a work based on the Library, and explaining
+    where to find the accompanying uncombined form of the same work.
+
+  8. You may not copy, modify, sublicense, link with, or distribute
+the Library except as expressly provided under this License.  Any
+attempt otherwise to copy, modify, sublicense, link with, or
+distribute the Library is void, and will automatically terminate your
+rights under this License.  However, parties who have received copies,
+or rights, from you under this License will not have their licenses
+terminated so long as such parties remain in full compliance.
+
+  9. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Library or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Library (or any work based on the
+Library), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Library or works based on it.
+
+  10. Each time you redistribute the Library (or any work based on the
+Library), the recipient automatically receives a license from the
+original licensor to copy, distribute, link with or modify the Library
+subject to these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties with
+this License.
+
+  11. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+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
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Library at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Library by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Library.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply, and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  12. If the distribution and/or use of the Library is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Library under this License
+may add an explicit geographical distribution limitation excluding those
+countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  13. The Free Software Foundation may publish revised and/or new
+versions of the Lesser 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 Library
+specifies a version number of this License which applies to it and
+"any later version", you have the option of following the terms and
+conditions either of that version or of any later version published by
+the Free Software Foundation.  If the Library does not specify a
+license version number, you may choose any version ever published by
+the Free Software Foundation.
+
+  14. If you wish to incorporate parts of the Library into other free
+programs whose distribution conditions are incompatible with these,
+write to the author to ask for permission.  For software which is
+copyrighted by the Free Software Foundation, write to the Free
+Software Foundation; we sometimes make exceptions for this.  Our
+decision will be guided by the two goals of preserving the free status
+of all derivatives of our free software and of promoting the sharing
+and reuse of software generally.
+
+                            NO WARRANTY
+
+  15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
+WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
+EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
+OTHER PARTIES PROVIDE THE LIBRARY "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
+LIBRARY IS WITH YOU.  SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
+THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
+WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
+AND/OR REDISTRIBUTE THE LIBRARY 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
+LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
+SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
+DAMAGES.
+
+                     END OF TERMS AND CONDITIONS
+
+           How to Apply These Terms to Your New Libraries
+
+  If you develop a new library, and you want it to be of the greatest
+possible use to the public, we recommend making it free software that
+everyone can redistribute and change.  You can do so by permitting
+redistribution under these terms (or, alternatively, under the terms
+of the ordinary General Public License).
+
+  To apply these terms, attach the following notices to the library.
+It is safest to attach them to the start of each source file to most
+effectively convey 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 library's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2.1 of the License, or (at your option) any later version.
+
+    This library 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
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307  USA
+
+Also add information on how to contact you by electronic and paper mail.
+
+You should also get your employer (if you work as a programmer) or
+your school, if any, to sign a "copyright disclaimer" for the library,
+if necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the
+  library `Frob' (a library for tweaking knobs) written by James
+  Random Hacker.
+
+  <signature of Ty Coon>, 1 April 1990
+  Ty Coon, President of Vice
+
+That's all there is to it!
+
+
diff --git a/libXamine/Makefile.am b/libXamine/Makefile.am
new file mode 100644
index 0000000..743c0bd
--- /dev/null
+++ b/libXamine/Makefile.am
@@ -0,0 +1,7 @@
+lib_LTLIBRARIES = libXamine.la
+
+libXamine_la_SOURCES = src/xamine.c src/strsplit.c
+include_HEADERS = src/xamine.h
+
+libXamine_la_CFLAGS = $(LIBXML_CFLAGS)
+libXamine_la_LIBADD = $(LIBXML_LIBS)
diff --git a/libXamine/README b/libXamine/README
new file mode 100644
index 0000000..95706d1
--- /dev/null
+++ b/libXamine/README
@@ -0,0 +1,21 @@
+Xamine is a protocol analysis library for the X Window System protocol, based
+on XML-XCB protocol descriptions.  Given a binary X protocol stream, Xamine
+can reconstruct the structured tree of requests, replies, events, and errors.
+
+Xamine is under heavy development; the functionality and interface are subject
+to change.
+
+Currently, Xamine only handles X events.  All the code to parse an arbitrary
+description is available (though the appropriate hooks are needed to handle
+some additional top-level XML tags such as request and error and pass the
+contents to the structure-field-handling functions); the main task required to
+handle requests and replies is the code which follows those requests and
+replies in the stream, finds the appropriate XamineDescription based on the
+major/minor number and a reply hash (much like XCB's mechanism), and uses that
+for parsing.
+
+The biggest limitation right now is that the caller must determine the size of
+the data to pass to Xamine's parsing functions; this should definitely be
+fixed, and users of the Xamine library should be able to pass arbitrary
+amounts of data to Xamine until enough is available to provide parsed
+structures.
diff --git a/libXamine/configure.ac b/libXamine/configure.ac
new file mode 100644
index 0000000..c344e92
--- /dev/null
+++ b/libXamine/configure.ac
@@ -0,0 +1,14 @@
+AC_INIT([libXamine], 0.1, [josh@freedesktop.org])
+AC_CONFIG_SRCDIR([libXamine.pc.in])
+AM_INIT_AUTOMAKE([foreign dist-bzip2 subdir-objects])
+
+AC_PROG_LIBTOOL
+AC_PROG_CC
+AM_PROG_CC_C_O
+AC_HEADER_STDC
+
+PKG_CHECK_MODULES(LIBXML, libxml-2.0)
+AC_SUBST(LIBXML_CFLAGS)
+AC_SUBST(LIBXML_LIBS)
+
+AC_OUTPUT([Makefile libXamine.pc])
diff --git a/libXamine/debian/changelog b/libXamine/debian/changelog
new file mode 100644
index 0000000..3410731
--- /dev/null
+++ b/libXamine/debian/changelog
@@ -0,0 +1,5 @@
+xamine (0.1-1) unstable; urgency=low
+
+  * Initial Release.
+
+ -- Josh Triplett <josh@freedesktop.org>  Fri,  4 Mar 2005 22:10:19 -0800
diff --git a/libXamine/debian/compat b/libXamine/debian/compat
new file mode 100644
index 0000000..b8626c4
--- /dev/null
+++ b/libXamine/debian/compat
@@ -0,0 +1 @@
+4
diff --git a/libXamine/debian/control b/libXamine/debian/control
new file mode 100644
index 0000000..0aa4834
--- /dev/null
+++ b/libXamine/debian/control
@@ -0,0 +1,36 @@
+Source: xamine
+Priority: optional
+Maintainer: Josh Triplett <josh@freedesktop.org>
+Build-Depends: cdbs, debhelper (>= 4.0.0), libxml2-dev
+Standards-Version: 3.6.1
+
+Package: libxamine-dev
+Section: libdevel
+Architecture: any
+Depends: libxamine0 (= ${Source-Version})
+Description: X Window System protocol analysis library, development files
+ Xamine is a protocol analysis library for the X Window System protocol, based
+ on XML-XCB protocol descriptions.  Given a binary X protocol stream, Xamine
+ can reconstruct the structured tree of requests, replies, events, and errors.
+ .
+ Xamine is under heavy development; the functionality and interface are
+ subject to change.
+ .
+ This package contains the header and library files needed to build software
+ using libXamine.
+
+Package: libxamine0
+Section: libs
+Architecture: any
+Depends: ${shlibs:Depends}, ${misc:Depends}
+Recommends: fd.o-xcb-proto
+Description: X Window System protocol analysis library
+ Xamine is a protocol analysis library for the X Window System protocol, based
+ on XML-XCB protocol descriptions.  Given a binary X protocol stream, Xamine
+ can reconstruct the structured tree of requests, replies, events, and errors.
+ .
+ Xamine is under heavy development; the functionality and interface are
+ subject to change.
+ .
+ This package contains the library files needed to run software using
+ libXamine.
diff --git a/libXamine/debian/copyright b/libXamine/debian/copyright
new file mode 100644
index 0000000..551916e
--- /dev/null
+++ b/libXamine/debian/copyright
@@ -0,0 +1,26 @@
+This package was debianized by Josh Triplett <josh@freedesktop.org> on
+Fri,  4 Mar 2005 22:10:19 -0800.
+
+It was downloaded from FIXME.
+
+Upstream Author: Josh Triplett <josh@freedesktop.org>
+
+License:
+
+/* Xamine - X Protocol Analyzer
+ * Copyright (C) 2004-2005 Josh Triplett
+ * 
+ * This package is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU Lesser General Public License as published by
+ * the Free Software Foundation; either version 2.1 of the License, or (at
+ * your option) any later version.
+ * 
+ * This package 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 Lesser General Public
+ * License for more details.
+ */
+
+On Debian systems, the complete text of the GNU Lesser General Public License
+can be found in `/usr/share/common-licenses/LGPL'.
+
diff --git a/libXamine/debian/libxamine-dev.dirs b/libXamine/debian/libxamine-dev.dirs
new file mode 100644
index 0000000..4418816
--- /dev/null
+++ b/libXamine/debian/libxamine-dev.dirs
@@ -0,0 +1,2 @@
+usr/lib
+usr/include
diff --git a/libXamine/debian/libxamine-dev.install b/libXamine/debian/libxamine-dev.install
new file mode 100644
index 0000000..68a175d
--- /dev/null
+++ b/libXamine/debian/libxamine-dev.install
@@ -0,0 +1,5 @@
+usr/include/*
+usr/lib/lib*.a
+usr/lib/lib*.so
+usr/lib/pkgconfig/*
+usr/lib/*.la
diff --git a/libXamine/debian/libxamine0.dirs b/libXamine/debian/libxamine0.dirs
new file mode 100644
index 0000000..6845771
--- /dev/null
+++ b/libXamine/debian/libxamine0.dirs
@@ -0,0 +1 @@
+usr/lib
diff --git a/libXamine/debian/libxamine0.install b/libXamine/debian/libxamine0.install
new file mode 100644
index 0000000..d0dbfd1
--- /dev/null
+++ b/libXamine/debian/libxamine0.install
@@ -0,0 +1 @@
+usr/lib/lib*.so.*
diff --git a/libXamine/debian/rules b/libXamine/debian/rules
new file mode 100755
index 0000000..f1e8443
--- /dev/null
+++ b/libXamine/debian/rules
@@ -0,0 +1,4 @@
+#!/usr/bin/make -f
+DEB_DH_INSTALL_SOURCEDIR=debian/tmp
+include /usr/share/cdbs/1/rules/debhelper.mk
+include /usr/share/cdbs/1/class/autotools.mk
diff --git a/libXamine/libXamine.pc.in b/libXamine/libXamine.pc.in
new file mode 100644
index 0000000..02b97b4
--- /dev/null
+++ b/libXamine/libXamine.pc.in
@@ -0,0 +1,10 @@
+prefix=@prefix@
+exec_prefix=@exec_prefix@
+libdir=@libdir@
+includedir=@includedir@
+
+Name: libXamine
+Description: Library to dissect binary X Window System protocol streams
+Version: @PACKAGE_VERSION@
+Libs: -L${libdir} @LIBS@
+Cflags: -I${includedir}
diff --git a/libXamine/src/strsplit.c b/libXamine/src/strsplit.c
new file mode 100644
index 0000000..c5ea36c
--- /dev/null
+++ b/libXamine/src/strsplit.c
@@ -0,0 +1,96 @@
+/* strsplit.c - Split a string into an array of tokens
+ * Copyright (C) 2004-2005 Josh Triplett
+ * 
+ * This package is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU Lesser General Public License as published by
+ * the Free Software Foundation; either version 2.1 of the License, or (at
+ * your option) any later version.
+ * 
+ * This package 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 Lesser General Public
+ * License for more details.
+ */
+
+#include <stdlib.h>
+#include <string.h>
+
+/* strsplit splits the string input into tokens based on the delimiters in
+ * delim.  It returns an array of char*s containing the tokens, ending with a
+ * NULL char*.  If malloc fails, or either input string is NULL, strsplit
+ * returns NULL.  */
+char ** strsplit(const char *input, const char *delim)
+{
+    /* Rather than allocating a string for each token, strsplit duplicates the
+     * input string, replaces the delimiters with '\0', and creates an array
+     * of pointers into this string. */
+    
+    char *str;                   /* Copy of the input string */
+    int len;                     /* Length of the input string */
+    int token_count;             /* Number of tokens in the input string */
+    int token;                   /* Current token */
+    enum { TOKEN, DELIM } state; /* Type of the previous character */
+    char **tokens;               /* Array of tokens */
+    int i;                       /* Loop index */
+    
+    if(input == NULL || delim == NULL)
+        return NULL;
+
+    len = strlen(input);
+    
+    /* Duplicate the input string. */
+    str = malloc(len + 1);
+    if(str == NULL)
+        return NULL;
+    strcpy(str, input);
+    
+    /* Count the number of tokens, and replace the delimiters with '\0'. */
+    token_count = 0;
+    state = DELIM;
+    for(i = 0; i < len; i++)
+    {
+        if(strchr(delim, str[i]) != NULL)
+        {
+            str[i] = '\0';
+            state = DELIM;
+        }
+        else if(state == DELIM)
+        {
+            state = TOKEN;
+            token_count++;
+        }
+    }
+
+    /* Allocate the array of tokens. */
+    tokens = malloc((token_count+1)*sizeof(char*));
+    if(tokens == NULL)
+    {
+        free(str);
+        return NULL;
+    }
+
+    /* Set each element in tokens to point to the beginning of the
+     * corresponding token in str. */
+    token = 0;
+    state = DELIM;
+    for(i = 0; i < len; i++)
+    {
+        if(str[i] == '\0')
+            state = DELIM;
+        else if(state == DELIM)
+        {
+            state = TOKEN;
+            tokens[token++] = &(str[i]);
+        }
+    }
+    tokens[token_count] = NULL;
+    
+    return tokens;
+}
+
+/* strsplit_free frees the array returned by strsplit. */
+void strsplit_free(char **tokens)
+{
+    free(*tokens);
+    free(tokens);
+}
diff --git a/libXamine/src/strsplit.h b/libXamine/src/strsplit.h
new file mode 100644
index 0000000..673778f
--- /dev/null
+++ b/libXamine/src/strsplit.h
@@ -0,0 +1,27 @@
+/* strsplit.c - Split a string into an array of tokens
+ * Copyright (C) 2004-2005 Josh Triplett
+ * 
+ * This package is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU Lesser General Public License as published by
+ * the Free Software Foundation; either version 2.1 of the License, or (at
+ * your option) any later version.
+ * 
+ * This package 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 Lesser General Public
+ * License for more details.
+ */
+
+#if !defined(STRSPLIT_H)
+#define STRSPLIT_H
+
+/* strsplit splits the string str into tokens based on the delimiters in
+ * delim.  It returns an array of char*s containing the tokens, ending with a
+ * NULL char*.  If malloc fails, or either input string is NULL, strsplit
+ * returns NULL.  */
+char ** strsplit(const char *str, const char *delim);
+
+/* strsplit_free frees the array returned by strsplit. */
+void strsplit_free(char **tokens);
+
+#endif /* !defined(STRSPLIT_H) */
diff --git a/libXamine/src/xamine.c b/libXamine/src/xamine.c
new file mode 100644
index 0000000..806fade
--- /dev/null
+++ b/libXamine/src/xamine.c
@@ -0,0 +1,728 @@
+/* Xamine - X Protocol Analyzer
+ * Copyright (C) 2004-2005 Josh Triplett
+ * 
+ * This package is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU Lesser General Public License as published by
+ * the Free Software Foundation; either version 2.1 of the License, or (at
+ * your option) any later version.
+ * 
+ * This package 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 Lesser General Public
+ * License for more details.
+ */
+#include <glob.h>
+#include <libxml/parser.h>
+#include <stddef.h>
+#include <stdlib.h>
+#include <string.h>
+#include "strsplit.h"
+#include "xamine.h"
+
+const char *XAMINE_PATH_DEFAULT = "/usr/include/X11/XCB:"
+                                  "/usr/include/X11/XCB/extensions";
+const char *XAMINE_PATH_DELIM = ":";
+const char *XAMINE_PATH_GLOB = "/*.xml";
+
+/* Concrete definitions for opaque and private structure types. */
+typedef struct XamineEvent
+{
+    unsigned char number;
+    XamineDefinition *definition;
+    struct XamineEvent *next;
+} XamineEvent;
+
+typedef struct XamineError
+{
+    unsigned char number;
+    XamineDefinition *definition;
+    struct XamineError *next;
+} XamineError;
+
+typedef struct XamineExtension
+{
+    char *name;
+    char *xname;
+    XamineEvent *events;
+    XamineError *errors;
+    struct XamineExtension *next;
+} XamineExtension;
+
+struct XamineState
+{
+    unsigned char host_is_le;
+    XamineDefinition *definitions;
+    XamineDefinition *core_events[64];  /* Core events 2-63 (0-1 unused) */
+    XamineDefinition *core_errors[128]; /* Core errors 0-127             */
+    XamineExtension  *extensions;
+};
+
+struct XamineConversation
+{
+    XamineState *state;
+    unsigned char is_le;
+    XamineDefinition *extension_events[64];  /* Extension events 64-127  */
+    XamineDefinition *extension_errors[128]; /* Extension errors 128-255 */
+    XamineExtension *extensions[128];        /* Extensions 128-255       */
+};
+
+static const XamineDefinition core_type_definitions[] =
+{
+    { "char",   XAMINE_CHAR,     1 },
+    { "BOOL",   XAMINE_BOOLEAN,  1 },
+    { "BYTE",   XAMINE_UNSIGNED, 1 },
+    { "CARD8",  XAMINE_UNSIGNED, 1 },
+    { "CARD16", XAMINE_UNSIGNED, 2 },
+    { "CARD32", XAMINE_UNSIGNED, 4 },
+    { "INT8",   XAMINE_SIGNED,   1 },
+    { "INT16",  XAMINE_SIGNED,   2 },
+    { "INT32",  XAMINE_SIGNED,   4 }
+};
+
+static void xamine_parse_xmlxcb_file(XamineState *state, char *filename);
+static char* xamine_make_name(XamineExtension *extension, char *name);
+static XamineDefinition *xamine_find_type(XamineState *state, char *name);
+static xmlNode *xamine_xml_next_elem(xmlNode *elem);
+static XamineFieldDefinition *xamine_parse_fields(XamineState *state,
+                                                  xmlNode *elem);
+static XamineExpression *xamine_parse_expression(XamineState *state,
+                                                 xmlNode *elem);
+static XaminedItem *xamine_definition(XamineConversation *conversation,
+                                      void **data, unsigned int *size,
+                                      unsigned int *offset,
+                                      XamineDefinition *definition,
+                                      XaminedItem *parent);
+static XaminedItem *xamine_field_definition(XamineConversation *conversation,
+                                            void **data, unsigned int *size,
+                                            unsigned int *offset,
+                                            XamineFieldDefinition *definition,
+                                            XaminedItem *parent);
+
+/* Initialization and cleanup */
+XamineState *xamine_init()
+{
+    int i;
+    const char *xamine_path_env;
+    char **xamine_path;
+    char **iter;
+    glob_t xml_files;
+    XamineState *state = calloc(1, sizeof(XamineState));
+
+    if(!state)
+        return NULL;
+
+    {
+        unsigned long l = 1;
+        state->host_is_le = *(unsigned char*)&l;
+    }
+
+    /* Add definitions of core types. */
+    for(i = 0; i < sizeof(core_type_definitions)/sizeof(XamineDefinition); i++)
+    {
+        XamineDefinition *temp = calloc(1, sizeof(XamineDefinition));
+        if(!temp)
+        {
+            xamine_cleanup(state);
+            return NULL;
+        }
+
+        *temp = core_type_definitions[i];
+        
+        temp->next = state->definitions;
+        state->definitions = temp;
+        
+        temp->name = strdup(core_type_definitions[i].name);
+        if(!temp->name)
+        {
+            xamine_cleanup(state);
+            return NULL;
+        }
+    }
+
+    /* Set up the search path for XML-XCB descriptions. */
+    xamine_path_env = getenv("XAMINE_PATH");
+    if(!xamine_path_env)
+        xamine_path_env = XAMINE_PATH_DEFAULT;
+    xamine_path = strsplit(xamine_path_env, XAMINE_PATH_DELIM);
+    if(!xamine_path)
+    {
+        xamine_cleanup(state);
+        return NULL;
+    }
+
+    /* Find all the XML files on the search path. */
+    xml_files.gl_pathv = NULL;
+    for(iter = xamine_path; *iter; iter++)
+    {
+        char *pattern = malloc(1+strlen(*iter)+strlen(XAMINE_PATH_GLOB));
+        if(!pattern)
+        {
+            if(xml_files.gl_pathv)
+                globfree(&xml_files);
+            strsplit_free(xamine_path);
+            xamine_cleanup(state);
+            return NULL;
+        }
+
+        strcpy(pattern, *iter);
+        strcat(pattern, XAMINE_PATH_GLOB);
+        
+        glob(pattern, (xml_files.gl_pathv ? GLOB_APPEND : 0), NULL,
+             &xml_files);
+    }
+
+    strsplit_free(xamine_path);
+
+    /* Parse the XML files. */
+    if(xml_files.gl_pathv)
+    {
+        for(iter = xml_files.gl_pathv; *iter; iter++)
+            xamine_parse_xmlxcb_file(state, *iter);
+    }
+
+    globfree(&xml_files);
+
+    return state;
+}
+
+void xamine_cleanup(XamineState *state)
+{
+    XamineDefinition *temp;
+    while(state->definitions)
+    {
+        temp = state->definitions;
+        state->definitions = state->definitions->next;
+        free(temp);
+    }
+    /* FIXME: incomplete */
+}
+
+/* Retrieval of the type definitions. */
+XamineDefinition *xamine_get_definitions(XamineState *state)
+{
+    if(state == NULL)
+        return NULL;
+
+    return state->definitions;
+}
+
+/* Creation and destruction of conversations. */
+XamineConversation *xamine_create_conversation(XamineState *state)
+{
+    XamineConversation *conversation = calloc(1, sizeof(XamineConversation));
+    if(conversation == NULL)
+        return NULL;
+    conversation->state = state;
+    /* FIXME */
+    conversation->is_le = state->host_is_le;
+    return conversation;
+}
+
+void xamine_free_conversation(XamineConversation *conversation)
+{
+    free(conversation);
+}
+
+/* Analysis */
+XaminedItem *xamine(XamineConversation *conversation, XamineDirection dir,
+                     void *data, unsigned int size)
+{
+    XamineDefinition *definition = NULL;
+    
+    if(dir == XAMINE_REQUEST)
+    {
+        /* Request layout:
+         * 1-byte major opcode
+         * 1 byte of request-specific data
+         * 2-byte length (0 if big request)
+         * If 2-byte length is zero, 4-byte length.
+         * Rest of request-specific data
+         */
+        return NULL; /* Not yet implemented. */
+    }
+    else if(dir == XAMINE_RESPONSE)
+    {
+        unsigned char response_type;
+        
+        if(size < 32)
+            return NULL;
+
+        response_type = *(unsigned char *)data;
+        if(response_type == 0)      /* Error */
+        {
+            unsigned char error_code = *(unsigned char*)(data+1);
+            if(error_code < 128)
+                definition = conversation->state->core_errors[error_code];
+            else
+                definition = conversation->extension_errors[error_code-128];
+        }
+        else if(response_type == 1) /* Reply */
+            return NULL;            /* Not yet implemented. */
+        else                        /* Event */
+        {
+            /* Turn off SendEvent flag before looking up by event number. */
+            unsigned char event_code = response_type & ~0x80;
+            if(event_code < 64)
+                definition = conversation->state->core_events[event_code];
+            else
+                definition = conversation->extension_events[event_code-64];
+        }
+    }
+
+    if(definition == NULL)
+        return NULL;
+
+    /* Dissect the data based on the definition. */
+    int offset = 0;
+    return xamine_definition(conversation, &data, &size, &offset,
+                             definition, NULL);
+}
+
+void xamine_free(XaminedItem *item)
+{
+    if(item)
+    {
+        xamine_free(item->child);
+        xamine_free(item->next);
+        free(item);
+    }
+}
+
+/********** Private functions **********/
+
+static void xamine_parse_xmlxcb_file(XamineState *state, char *filename)
+{
+    xmlDoc  *doc;
+    xmlNode *root, *elem;
+    char *extension_xname;
+    XamineExtension *extension = NULL;
+    
+    /* FIXME: Remove this. */
+    printf("DEBUG: Parsing file \"%s\"\n", filename);
+    
+    /* Ignore text nodes consisting entirely of whitespace. */
+    xmlKeepBlanksDefault(0); 
+    
+    doc = xmlParseFile(filename);
+    if(!doc)
+        return;
+
+    root = xmlDocGetRootElement(doc);
+    if(!root)
+        return;
+
+    extension_xname = xmlGetProp(root, "extension-xname");
+
+    if(extension_xname)
+    {
+        /* FIXME: Remove this. */
+        printf("Extension: %s\n", extension_xname);
+
+        for(extension = state->extensions;
+            extension != NULL;
+            extension = extension->next)
+        {
+            if(strcmp(extension->xname, extension_xname) == 0)
+                break;
+        }
+        
+        if(extension == NULL)
+        {
+            extension = calloc(1, sizeof(XamineExtension));
+            extension->name = strdup(xmlGetProp(root, "extension-name"));
+            extension->xname = strdup(extension_xname);
+            extension->next = state->extensions;
+            state->extensions = extension;
+        }
+    }
+    else                           /* FIXME: Remove this. */
+        printf("Core Protocol\n");
+    
+    for(elem = root->children; elem != NULL;
+        elem = xamine_xml_next_elem(elem->next))
+    {
+        /* FIXME: Remove this */
+        {
+            char *name = xmlGetProp(elem, "name");
+            printf("DEBUG:    Parsing element \"%s\", name=\"%s\"\n",
+                   elem->name, name ? name : "<not present>");
+        }
+        
+        if(strcmp(elem->name, "request") == 0)
+        {
+            /* Not yet implemented. */
+        }
+        else if(strcmp(elem->name, "event") == 0)
+        {
+            char *no_sequence_number;
+            XamineDefinition *def;
+            XamineFieldDefinition *fields;
+            int number = atoi(xmlGetProp(elem, "number"));
+            if(number > 64)
+                continue;
+            def = calloc(1, sizeof(XamineDefinition));
+            def->name = xamine_make_name(extension, xmlGetProp(elem, "name"));
+            def->type = XAMINE_STRUCT;
+            
+            fields = xamine_parse_fields(state, elem);
+            if(fields == NULL)
+            {
+                fields = calloc(1, sizeof(XamineFieldDefinition));
+                fields->name = strdup("pad");
+                fields->definition = xamine_find_type(state, "CARD8");
+            }
+            def->fields = calloc(1, sizeof(XamineFieldDefinition));
+            def->fields->name = strdup("response_type");
+            def->fields->definition = xamine_find_type(state, "BYTE");
+            def->fields->next = fields;
+            fields = fields->next;
+            no_sequence_number = xmlGetProp(elem, "no-sequence-number");
+            if(no_sequence_number && strcmp(no_sequence_number, "true") == 0)
+            {
+                def->fields->next->next = fields;
+            }
+            else
+            {
+                def->fields->next->next =
+                    calloc(1, sizeof(XamineFieldDefinition));
+                def->fields->next->next->name = strdup("sequence");
+                def->fields->next->next->definition =
+                    xamine_find_type(state, "CARD16");
+                def->fields->next->next->next = fields;
+            }
+            def->next = state->definitions;
+            state->definitions = def;
+            
+            if(extension)
+            {
+                XamineEvent *event = calloc(1, sizeof(XamineEvent));
+                event->number = number;
+                event->definition = def;
+                event->next = extension->events;
+            }
+            else
+                state->core_events[number] = def;
+        }
+        else if(strcmp(elem->name, "eventcopy") == 0)
+        {
+            XamineDefinition *def;
+            int number = atoi(xmlGetProp(elem, "number"));
+            if(number > 64)
+                continue;
+            def = calloc(1, sizeof(XamineDefinition));
+            def->name = strdup(xmlGetProp(elem, "name"));
+            def->type = XAMINE_TYPEDEF;
+            def->ref = xamine_find_type(state, xmlGetProp(elem, "ref"));
+            
+            if(extension)
+            {
+                XamineEvent *event = calloc(1, sizeof(XamineEvent));
+                event->number = number;
+                event->definition = def;
+                event->next = extension->events;
+            }
+            else
+                state->core_events[number] = def;
+        }
+        else if(strcmp(elem->name, "error") == 0)
+        {
+        }
+        else if(strcmp(elem->name, "errorcopy") == 0)
+        {
+        }
+        else if(strcmp(elem->name, "struct") == 0)
+        {
+            XamineDefinition *def = calloc(1, sizeof(XamineDefinition));
+            def->name = xamine_make_name(extension, xmlGetProp(elem, "name"));
+            def->type = XAMINE_STRUCT;
+            def->fields = xamine_parse_fields(state, elem);
+            def->next = state->definitions;
+            state->definitions = def;
+        }
+        else if(strcmp(elem->name, "union") == 0)
+        {
+        }
+        else if(strcmp(elem->name, "xidtype") == 0)
+        {
+            XamineDefinition *def = calloc(1, sizeof(XamineDefinition));
+            def->name = xamine_make_name(extension, xmlGetProp(elem, "name"));
+            def->type = XAMINE_UNSIGNED;
+            def->size = 4;
+            def->next = state->definitions;
+            state->definitions = def;
+        }
+        else if(strcmp(elem->name, "enum") == 0)
+        {
+        }
+        else if(strcmp(elem->name, "typedef") == 0)
+        {
+            XamineDefinition *def = calloc(1, sizeof(XamineDefinition));
+            def->name = xamine_make_name(extension,
+                                         xmlGetProp(elem, "newname"));
+            def->type = XAMINE_TYPEDEF;
+            def->ref = xamine_find_type(state, xmlGetProp(elem, "oldname"));
+            def->next = state->definitions;
+            state->definitions = def;
+        }
+        else if(strcmp(elem->name, "import") == 0)
+        {
+        }
+    }
+}
+
+static char* xamine_make_name(XamineExtension *extension, char *name)
+{
+    if(extension)
+    {
+        char *temp = malloc(strlen(extension->name) + strlen(name) + 1);
+        if(temp == NULL)
+            return NULL;
+        strcpy(temp, extension->name);
+        strcat(temp, name);
+        return temp;
+    }
+    else
+        return strdup(name);
+}
+
+static XamineDefinition *xamine_find_type(XamineState *state, char *name)
+{
+    XamineDefinition *def;
+    for(def = state->definitions; def != NULL; def = def->next)
+    {
+        /* FIXME: does not work for extension types. */
+        if(strcmp(def->name, name) == 0)
+            return def;
+    }
+    return NULL;
+}
+
+static xmlNode *xamine_xml_next_elem(xmlNode *elem)
+{
+    while(elem && elem->type != XML_ELEMENT_NODE)
+        elem = elem->next;
+    return elem;
+}
+
+static XamineFieldDefinition *xamine_parse_fields(XamineState *state,
+                                                  xmlNode *elem)
+{
+    xmlNode *cur;
+    XamineFieldDefinition *head;
+    XamineFieldDefinition **tail = &head;
+    for(cur = elem->children; cur!=NULL; cur = xamine_xml_next_elem(cur->next))
+    {
+        /* FIXME: handle elements other than "field", "pad", and "list". */
+        *tail = calloc(1, sizeof(XamineFieldDefinition));
+        if(strcmp(cur->name, "pad") == 0)
+        {
+            (*tail)->name = "pad";
+            (*tail)->definition = xamine_find_type(state, "CARD8");
+            (*tail)->length = calloc(1, sizeof(XamineExpression));
+            (*tail)->length->type = XAMINE_VALUE;
+            (*tail)->length->value = atoi(xmlGetProp(cur, "bytes"));
+        }
+        else
+        {
+            (*tail)->name = strdup(xmlGetProp(cur, "name"));
+            (*tail)->definition = xamine_find_type(state,
+                                               xmlGetProp(cur, "type"));
+            /* FIXME: handle missing length expressions. */
+            if(strcmp(cur->name, "list") == 0)
+                (*tail)->length = xamine_parse_expression(state,
+                                                          cur->children);
+        }
+        tail = &((*tail)->next);
+    }
+    
+    *tail = NULL;
+    return head;
+}
+
+static XamineExpression *xamine_parse_expression(XamineState *state,
+                                                 xmlNode *elem)
+{
+    XamineExpression *e = calloc(1, sizeof(XamineExpression));
+    elem = xamine_xml_next_elem(elem);
+    if(strcmp(elem->name, "op") == 0)
+    {
+        char *temp = xmlGetProp(elem, "op");
+        e->type = XAMINE_OP;
+        if(strcmp(temp, "+") == 0)
+            e->op = XAMINE_ADD;
+        else if(strcmp(temp, "-") == 0)
+            e->op = XAMINE_SUBTRACT;
+        else if(strcmp(temp, "*") == 0)
+            e->op = XAMINE_MULTIPLY;
+        else if(strcmp(temp, "/") == 0)
+            e->op = XAMINE_DIVIDE;
+        else if(strcmp(temp, "<<") == 0)
+            e->op = XAMINE_LEFT_SHIFT;
+        else if(strcmp(temp, "&") == 0)
+            e->op = XAMINE_BITWISE_AND;
+        elem = xamine_xml_next_elem(elem->children);
+        e->left = xamine_parse_expression(state, elem);
+        elem = xamine_xml_next_elem(elem->next);
+        e->right = xamine_parse_expression(state, elem);
+    }
+    else if(strcmp(elem->name, "value") == 0)
+    {
+        e->type = XAMINE_VALUE;
+        e->value = strtol(elem->children->content, NULL, 0);
+    }
+    else if(strcmp(elem->name, "fieldref") == 0)
+    {
+        e->type = XAMINE_FIELDREF;
+        e->field = strdup(elem->children->content);
+    }
+    return e;
+}
+
+static long xamine_evaluate_expression(XamineExpression *expression,
+                                       XaminedItem *parent)
+{
+    switch(expression->type)
+    {
+    case XAMINE_VALUE:
+        return expression->value;
+        
+    case XAMINE_FIELDREF:
+    {
+        XaminedItem *cur;
+        for(cur = parent->child; cur != NULL; cur = cur->next)
+            if(strcmp(cur->name, expression->field) == 0)
+                switch(cur->definition->type)
+                {
+                case XAMINE_BOOLEAN: return cur->bool_value;
+                case XAMINE_CHAR: return cur->char_value;
+                case XAMINE_SIGNED: return cur->signed_value;
+                case XAMINE_UNSIGNED: return cur->unsigned_value;
+                }
+        /* FIXME: handle not found or wrong type */
+    }
+
+    case XAMINE_OP:
+    {
+        long left  = xamine_evaluate_expression(expression->left, parent);
+        long right = xamine_evaluate_expression(expression->right, parent);
+        switch(expression->op)
+        {
+        case XAMINE_ADD:         return left+right;
+        case XAMINE_SUBTRACT:    return left-right;
+        case XAMINE_MULTIPLY:    return left*right;
+        case XAMINE_DIVIDE:      return left/right; /* FIXME: divide by zero */
+        case XAMINE_LEFT_SHIFT:  return left<<right;
+        case XAMINE_BITWISE_AND: return left&right;
+        }
+    }
+    }
+}
+
+static XaminedItem *xamine_definition(XamineConversation *conversation,
+                                      void **data, unsigned int *size,
+                                      unsigned int *offset,
+                                      XamineDefinition *definition,
+                                      XaminedItem *parent)
+{
+    XaminedItem *xamined;
+
+    if(definition->type == XAMINE_TYPEDEF)
+    {
+        xamined = xamine_definition(conversation, data, size, offset,
+                                    definition->ref, parent);
+        xamined->definition = definition;
+        return xamined;
+    }
+
+    xamined = calloc(1, sizeof(XaminedItem));
+    xamined->definition = definition;
+    if(definition->type == XAMINE_STRUCT)
+    {
+        XaminedItem **end = &(xamined->child);
+        XamineFieldDefinition *child;
+        for(child = definition->fields; child != NULL; child = child->next)
+        {
+            *end = xamine_field_definition(conversation, data, size, offset,
+                                           child, xamined);
+            end = &((*end)->next);
+        }
+        *end = NULL;
+    }
+    else
+    {
+        switch(definition->type)
+        {
+        case XAMINE_BOOLEAN:
+            /* FIXME: field->definition->size must be 1 */
+            xamined->bool_value = *(unsigned char*)(*data) ? 1 : 0;
+            break;
+        
+        case XAMINE_CHAR:
+            /* FIXME: field->definition->size must be 1 */
+            xamined->char_value = *(char *)(*data);
+            break;
+            
+        case XAMINE_SIGNED:
+        case XAMINE_UNSIGNED:
+        {
+            unsigned char *dest = definition->type == XAMINE_SIGNED
+                                ? (unsigned char *)&(xamined->signed_value)
+                                : (unsigned char *)&(xamined->unsigned_value);
+            unsigned char *src = (unsigned char*)(*data);
+            if(definition->size == 1
+              || conversation->is_le == conversation->state->host_is_le)
+                memcpy(dest, src, definition->size);
+            else
+            {
+                int i;
+                dest += definition->size-1;
+                for(i = 0; i < definition->size; i++)
+                    *dest-- = *src++;
+            }
+        }
+        }
+        *data   += definition->size;
+        *size   -= definition->size;
+        *offset += definition->size;
+    }
+
+    return xamined;
+}
+
+static XaminedItem *xamine_field_definition(XamineConversation *conversation,
+                                            void **data, unsigned int *size,
+                                            unsigned int *offset,
+                                            XamineFieldDefinition *field,
+                                            XaminedItem *parent)
+{
+    XaminedItem *xamined;
+    
+    if(field->length)
+    {
+        xamined = calloc(1, sizeof(XaminedItem));
+        xamined->name = field->name;
+        xamined->definition = field->definition;
+        xamined->offset = *offset;
+        XaminedItem **end = &(xamined->child);
+        unsigned long length = xamine_evaluate_expression(field->length,
+                                                          parent);
+        unsigned long i;
+        for(i = 0; i < length; i++)
+        {
+            *end = xamine_definition(conversation, data, size, offset,
+                                     field->definition, parent);
+            (*end)->name = malloc(23); /* '[', length of 2**64, ']', '\0' */
+            sprintf((*end)->name, "[%lu]", i);
+            end = &((*end)->next);
+        }
+        *end = NULL;
+    }
+    else
+    {
+        xamined = xamine_definition(conversation, data, size, offset,
+                                    field->definition, parent);
+        xamined->name = field->name;
+    }
+    
+    return xamined;
+}
diff --git a/libXamine/src/xamine.h b/libXamine/src/xamine.h
new file mode 100644
index 0000000..8dea739
--- /dev/null
+++ b/libXamine/src/xamine.h
@@ -0,0 +1,126 @@
+/* Xamine - X Protocol Analyzer
+ * Copyright (C) 2004-2005 Josh Triplett
+ * 
+ * This package is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU Lesser General Public License as published by
+ * the Free Software Foundation; either version 2.1 of the License, or (at
+ * your option) any later version.
+ * 
+ * This package 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 Lesser General Public
+ * License for more details.
+ */
+#ifndef XAMINE_H
+#define XAMINE_H
+
+typedef enum
+{
+    XAMINE_BOOLEAN,
+    XAMINE_CHAR,
+    XAMINE_SIGNED,
+    XAMINE_UNSIGNED,
+    XAMINE_STRUCT,
+    XAMINE_UNION,
+    XAMINE_TYPEDEF
+} XamineType;
+
+typedef enum
+{
+    XAMINE_REQUEST,
+    XAMINE_RESPONSE
+} XamineDirection;
+
+typedef struct XamineDefinition
+{
+    char *name;
+    XamineType type;
+    union
+    {
+        unsigned int size;                    /* base types */
+        struct XamineFieldDefinition *fields; /* struct, union */
+        struct XamineDefinition *ref;         /* typedef */
+    };
+    struct XamineDefinition *next;
+} XamineDefinition;
+
+typedef enum XamineExpressionType
+{
+    XAMINE_FIELDREF,
+    XAMINE_VALUE,
+    XAMINE_OP
+} XamineExpressionType;
+
+typedef enum XamineOp
+{
+    XAMINE_ADD,
+    XAMINE_SUBTRACT,
+    XAMINE_MULTIPLY,
+    XAMINE_DIVIDE,
+    XAMINE_LEFT_SHIFT,
+    XAMINE_BITWISE_AND
+} XamineOp;
+
+typedef struct XamineExpression
+{
+    XamineExpressionType type;
+    union
+    {
+        char *field;         /* Field name for XAMINE_FIELDREF */
+        unsigned long value; /* Value for XAMINE_VALUE */
+        struct               /* Operator and operands for XAMINE_OP */
+        {
+            XamineOp op;
+            struct XamineExpression *left;
+            struct XamineExpression *right;
+        };
+    };
+} XamineExpression;
+
+typedef struct XamineFieldDefinition
+{
+    char *name;
+    XamineDefinition *definition;
+    XamineExpression *length;           /* List length; NULL for non-list */
+    struct XamineFieldDefinition *next;
+} XamineFieldDefinition;
+
+typedef struct XaminedItem
+{
+    char *name;
+    XamineDefinition *definition;
+    unsigned int offset;
+    union
+    {
+        unsigned char bool_value;
+        char          char_value;
+        signed long   signed_value;
+        unsigned long unsigned_value;
+    };
+    struct XaminedItem *child;
+    struct XaminedItem *next;
+} XaminedItem;
+
+/* Opaque types for an Xamine library state and a conversation-specific
+ * state. */
+typedef struct XamineState XamineState;
+typedef struct XamineConversation XamineConversation;
+
+/* Initialization and cleanup */
+extern XamineState * xamine_init();
+extern void xamine_cleanup(XamineState *state);
+
+/* Retrieval of the type definitions. */
+extern XamineDefinition * xamine_get_definitions(XamineState *state);
+
+/* Creation and destruction of conversations. */
+extern XamineConversation * xamine_create_conversation(XamineState *state);
+extern void xamine_free_conversation(XamineConversation *conversation);
+
+/* Analysis */
+extern XaminedItem * xamine(XamineConversation *conversation,
+                            XamineDirection dir,
+                            void *data, unsigned int size);
+extern void xamine_free(XaminedItem *item);
+
+#endif /* XAMINE_H */