initial checkin

.gitignore

@@ -0,0 +1,41 @@
+.*.swp
+*.o
+*.a
+*.lo
+*.la
+*.gcda
+*.gcno
+.dirstamp
+.deps/
+.libs/
+Makefile
+configure
+Makefile.in
+m4/
+/config.*
+*.crt
+*.csr
+*.pem
+*.m4
+taskrambler.conf
+/INSTALL
+tests/coverage*
+/docs/api/
+/docs/Doxyfile
+/run
+/autom4te.cache/
+/compile
+/depcomp
+/install-sh
+/libtool
+/ltmain.sh
+/missing
+stamp-h1
+src/taskrambler
+/tests/*Test
+/tests/*.log
+/tests/*.trs
+gmon.out
+test-driver
+/assets/html/_documentation.html
+tags

AUTHORS

@@ -0,0 +1 @@
+Georg Hopp <georg@steffers.org>

COPYING

@@ -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>.

Makefile.am

@@ -0,0 +1,20 @@
+ACLOCAL_AMFLAGS = -I m4
+
+EXTRA_DIST = include
+
+SUBDIRS = src tests docs include
+
+.PHONY: docs coverage-html
+
+if HAVE_DOXYGEN
+docs:
+	-$(MAKE) -C docs $(AM_MAKEFLAGS) -k $@
+endif
+
+if HAVE_GCOV
+coverage-html:
+	-$(MAKE) -C tests $(AM_MAKEFLAGS) -k $@
+endif
+
+tags:
+	ctags -R -V --langdef=cclass --langmap=cclass:.h --regex-cclass='/^[ \t]*\(TR_CLASS\|TR_INTERFACE\)\(([a-zA-Z0-9_]+)/\2/d,definition/'

README

@@ -0,0 +1 @@
+README.md

bootstrap

@@ -0,0 +1,7 @@
+#!/bin/sh
+
+aclocal
+libtoolize --copy
+autoheader
+automake --gnu --add-missing --copy
+autoconf

configure.ac

@@ -0,0 +1,65 @@
+#                                               -*- Autoconf -*-
+# Process this file with autoconf to produce a configure script.
+
+AC_PREREQ([2.68])
+AC_INIT([libtrhash],
+        [0.0.0],
+        [Georg Hopp <georg@steffers.org>])
+LT_INIT
+AM_INIT_AUTOMAKE
+#AM_INIT_AUTOMAKE([subdir-objects])
+AM_SILENT_RULES([yes])
+AC_COPYRIGHT([Copyright © 2013 Georg Hopp])
+AC_REVISION([0.0.0])
+AC_CONFIG_SRCDIR([src/tree/tree.c])
+AC_CONFIG_HEADERS([trdata.h])
+AC_CONFIG_MACRO_DIR([m4])
+
+m4_include([m4/gcov.m4])
+AC_TDD_GCOV
+
+# Checks for programs.
+AC_PROG_CXX
+AC_PROG_CC
+AC_PROG_CC_C99
+AC_PROG_LIBTOOL
+AM_PROG_CC_C_O
+
+# Doxygen
+AC_CHECK_PROGS([DOXYGEN], [doxygen])
+if test -z "$DOXYGEN";
+   then AC_MSG_WARN([Doxygen not found - continuing without Doxygen support])
+fi
+
+AM_CONDITIONAL([HAVE_DOXYGEN],
+               [test -n "$DOXYGEN"])
+AM_COND_IF([HAVE_DOXYGEN],
+	   [AC_CONFIG_FILES([docs/Doxyfile])])
+
+# Checks for header files.
+AC_CHECK_HEADERS([stdarg.h string.h stdlib.h stdio.h unistd.h syslog.h sys/types.h])
+
+# Checks for typedefs, structures, and compiler characteristics.
+AC_HEADER_STDBOOL
+AC_C_INLINE
+AC_TYPE_PID_T
+AC_TYPE_SIZE_T
+
+# Checks for library functions.
+AC_CHECK_FUNCS([memset])
+
+AM_CFLAGS="${AM_CFLAGS} ${DRAGONEGG_FLAGS}"
+AM_CFLAGS="${AM_CFLAGS} ${MEM_OPT_FLAGS}"
+AM_CFLAGS="${AM_CFLAGS} ${CFLAGS}"
+AC_SUBST(AM_CFLAGS)
+
+AC_CONFIG_FILES([Makefile
+		 docs/Makefile
+		 tests/Makefile
+		 src/Makefile
+		 src/cbuf/Makefile
+		 src/hash/Makefile
+		 src/queue/Makefile
+		 src/tree/Makefile
+		 include/Makefile])
+AC_OUTPUT

docs/Makefile.am

@@ -0,0 +1,13 @@
+EXTRA_DIST = Doxyfile.in
+
+if HAVE_DOXYGEN
+
+.PHONY: docs
+
+docs:
+	@mkdir -p $(top_srcdir)/docs/api/$(PACKAGE_VERSION)
+	$(DOXYGEN) Doxyfile
+
+clean-local:
+	@rm -rf $(top_srcdir)/docs/api/
+endif 

include/Makefile.am

@@ -0,0 +1,7 @@
+nobase_include_HEADERS = trdata.h \
+			 tr/cbuf.h \
+			 tr/hash.h \
+			 tr/hash_value.h \
+			 tr/queue.h \
+			 tr/tree.h \
+			 tr/interface/hashable.h

include/tr/cbuf.h

@@ -0,0 +1,79 @@
+/**
+ * \file
+ * My implementation of a ringbuffer.
+ * It maps a shared memory object twice directly following
+ * thus make it possible to read and write from any
+ * position within the buffer without the nasty wrap
+ * calculations.
+ * This is achived because the same memory region is mapped
+ * at the two addresses.
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#ifndef __TR_CBUF_H__
+#define __TR_CBUF_H__
+
+#include <ctype.h>
+#include <string.h>
+#include <sys/types.h>
+
+#include "trbase.h"
+#include "trio.h"
+
+#define TR_ECBUFOVFL		100
+
+
+TR_CLASS(TR_Cbuf) {
+	char * shm_name;  // shared memory identifier
+
+	char * data;
+	Bool   lock;
+
+	size_t bsize;
+	size_t bused;
+
+	size_t write;
+	size_t read;
+};
+
+ssize_t TR_cbufRead(TR_Cbuf,  TR_Stream);
+ssize_t TR_cbufWrite(TR_Cbuf, TR_Stream);
+
+char *  TR_cbufGetLine(TR_Cbuf, char **);
+char *  TR_cbufGetData(TR_Cbuf, size_t);
+char *  TR_cbufSetData(TR_Cbuf, const void *, size_t);
+void    TR_cbufEmpty(TR_Cbuf);
+
+char *  TR_cbufGetRead(TR_Cbuf this);
+char *  TR_cbufGetWrite(TR_Cbuf this);
+char *  TR_cbufMemchr(TR_Cbuf this, int c);
+size_t  TR_cbufAddrIndex(TR_Cbuf this, const void * c);
+void    TR_cbufIncRead(TR_Cbuf this, size_t n);
+void    TR_cbufIncWrite(TR_Cbuf this, size_t n);
+size_t  TR_cbufGetFree(TR_Cbuf this);
+char    TR_cbufIsEmpty(TR_Cbuf this);
+void    TR_cbufSkipNonAlpha(TR_Cbuf this);
+Bool    TR_cbufIsLocked(TR_Cbuf this);
+void    TR_cbufLock(TR_Cbuf this);
+void    TR_cbufRelease(TR_Cbuf this);
+
+#endif // __TR_CBUF_H__
+
+// vim: set ts=4 sw=4:

include/tr/hash.h

@@ -0,0 +1,48 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#ifndef __TR_HASH_H__
+#define __TR_HASH_H__
+
+#include <sys/types.h>
+
+#include "trbase.h"
+#include "tr/tree.h"
+
+#define TR_HASH_IS_EMPTY(h)	((h)->root)
+
+TR_CLASS(TR_Hash) {
+	TR_Tree root;
+};
+
+void * TR_hashAdd(TR_Hash, void *);
+void * TR_hashDelete(TR_Hash, const char *, size_t);
+void * TR_hashGet(TR_Hash, const char *, size_t);
+void * TR_hashGetFirst(TR_Hash);
+void * TR_hashDeleteByVal(TR_Hash, unsigned long);
+void * TR_hashGetByVal(TR_Hash, unsigned long);
+void   TR_hashEach(TR_Hash, void (*)(const void*));
+void   TR_hashCleanup(TR_Hash);
+
+#endif // __TR_HASH_H__
+
+// vim: set ts=4 sw=4:

include/tr/hash_value.h

@@ -0,0 +1,42 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#ifndef __TR_HASH_VALUE_H__
+#define __TR_HASH_VALUE_H__
+
+#include <sys/types.h>
+
+#include "trbase.h"
+
+TR_CLASS(TR_HashValue) {
+	unsigned long hash;
+
+	char *        key;
+	void *        value;
+
+	size_t        nkey;
+	size_t        nvalue;
+};
+
+#endif // __TR_HASH_VALUE_H__
+
+// vim: set ts=4 sw=4:

include/tr/interface/hashable.h

@@ -0,0 +1,43 @@
+/**
+ * \file
+ * The logger interface.
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#ifndef __TR_INTERFACE_HASHABLE_H__
+#define __TR_INTERFACE_HASHABLE_H__
+
+#include "trbase.h"
+
+typedef unsigned long (* fptr_TR_hashableGetHash)(void *);
+typedef void          (* fptr_TR_hashableHandleDouble)(void *, void *);
+
+TR_INTERFACE(TR_Hashable) {
+	TR_IFID;
+	fptr_TR_hashableGetHash      getHash;
+	fptr_TR_hashableHandleDouble handleDouble;
+};
+
+extern unsigned long TR_hashableGetHash(void *);
+extern void          TR_hashableHandleDouble(void *, void *);
+
+#endif // __TR_INTERFACE_HASHABLE_H__
+
+// vim: set ts=4 sw=4:

include/tr/queue.h

@@ -0,0 +1,58 @@
+/**
+ * \file
+ * Holds requests ready for processing.
+ * 
+ * \todo change this to a real queue.
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#ifndef __TR_QUEUE_H__
+#define __TR_QUEUE_H__
+
+#include <sys/types.h>
+
+#include "trbase.h"
+
+
+TR_CLASS(TR_Queue) {
+	void *    msg;
+	TR_Queue  next;
+
+	/**
+	 * first and last are only available in the initial queue
+	 * element (the root). This elelment does not contain any message
+	 * and exists only for organizational purpose.
+	 *
+	 * \todo next and first always have to be the same...so get rid
+	 * of first.
+	 */
+	TR_Queue  first;
+	TR_Queue  last;
+	size_t nmsg;
+};
+
+void   TR_queuePut(TR_Queue, void *);
+void * TR_queueGet(TR_Queue);
+
+#define TR_queueEmpty(this)		(0 >= (this)->nmsg)
+
+#endif // __TR_QUEUE_H__
+
+// vim: set ts=4 sw=4:

include/tr/tree.h

@@ -0,0 +1,138 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#ifndef __TR_TREE_H__
+#define __TR_TREE_H__
+
+#include "trbase.h"
+
+#define TR_TREE_RIGHT(node)	(NULL!=(node)?(node)->right:NULL)
+#define TR_TREE_LEFT(node)		(NULL!=(node)?(node)->left:NULL)
+#define TR_TREE_PARENT(node)	(NULL!=(node)?(node)->parent:NULL)
+
+#define TR_TREE_CHILD(node) \
+	(NULL==TR_TREE_RIGHT((node))?TR_TREE_LEFT((node)):TR_TREE_RIGHT((node)))
+
+#define TR_TREE_RIGHT_LEFT(node) \
+	(NULL!=TR_TREE_RIGHT((node))?TR_TREE_LEFT(TR_TREE_RIGHT((node))):NULL)
+
+#define TR_TREE_LEFT_RIGHT(node) \
+	(NULL!=TR_TREE_LEFT((node))?TR_TREE_RIGHT(TR_TREE_LEFT((node))):NULL)
+
+#define TR_TREE_SIBLING(node)               \
+	(NULL!=TR_TREE_PARENT((node))?          \
+	 ((node)==TR_TREE_PARENT((node))->left? \
+	  TR_TREE_PARENT((node))->right:        \
+	  TR_TREE_PARENT((node))->left):        \
+	 NULL)
+
+#define TR_TREE_GRANDPARENT(node) \
+	(NULL!=TR_TREE_PARENT((node))?TR_TREE_PARENT((node))->parent:NULL)
+
+#define TR_TREE_UNCLE(node)                                   \
+	(NULL!=TR_TREE_GRANDPARENT((node))?                       \
+	 (TR_TREE_PARENT((node))==TR_TREE_GRANDPARENT((node))->left? \
+	  TR_TREE_GRANDPARENT((node))->right:                     \
+	  TR_TREE_GRANDPARENT((node))->left):                     \
+	 NULL)
+
+#define TR_TREE_ROTATE_LEFT(root, node)                        \
+	do {                                                    \
+		if (NULL != TR_TREE_RIGHT_LEFT((node))) {              \
+			TR_TREE_RIGHT_LEFT((node))->parent = (node);       \
+		}                                                   \
+		TR_TREE_RIGHT((node))->left = (node);                  \
+		if (NULL != TR_TREE_PARENT((node))) {                  \
+			if (TR_TREE_PARENT((node))->left==(node)) {        \
+				TR_TREE_PARENT((node))->left = (node)->right;  \
+			} else {                                        \
+				TR_TREE_PARENT((node))->right = (node)->right; \
+			}                                               \
+		} else {                                            \
+			*(root) = (node)->right;                        \
+		}                                                   \
+		(node)->right  = TR_TREE_RIGHT_LEFT((node));           \
+		(node)->parent = (node)->right;                     \
+		TR_TREE_RIGHT((node))->parent = (node)->parent;        \
+	} while(0)
+
+#define TR_TREE_ROTATE_RIGHT(root, node)                       \
+	do {                                                    \
+		if (NULL != TR_TREE_LEFT_RIGHT((node))) {              \
+			TR_TREE_LEFT_RIGHT((node))->parent = (node);       \
+		}                                                   \
+		TR_TREE_LEFT((node))->right = (node);                  \
+		if (NULL != TR_TREE_PARENT((node))) {                  \
+			if (TR_TREE_PARENT((node))->left==(node)) {        \
+				TR_TREE_PARENT((node))->left = (node)->left;   \
+			} else {                                        \
+				TR_TREE_PARENT((node))->right = (node)->left;  \
+			}                                               \
+		} else {                                            \
+			*(root) = (node)->left;                         \
+		}                                                   \
+		TR_TREE_LEFT((node))->parent = (node)->parent;         \
+		(node)->left   = TR_TREE_LEFT_RIGHT((node));           \
+		(node)->parent = (node)->right;                     \
+	} while(0)
+
+#define TR_TREE_REPLACE_NODE(root, node1, node2)            \
+	do {                                                 \
+		if (NULL != TR_TREE_PARENT((node1))) {              \
+			if ((node1) == TR_TREE_PARENT((node1))->left) { \
+				TR_TREE_PARENT((node1))->left = (node2);    \
+			} else {                                     \
+				TR_TREE_PARENT((node1))->right = (node2);   \
+			}                                            \
+		} else {                                         \
+			*(root) = (node2);                           \
+		}                                                \
+		if (NULL != (node2)) {                           \
+			(node2)->parent = (node1)->parent;           \
+		}                                                \
+	} while(0)
+
+
+typedef enum {rbBlack=1, rbRed=2} TR_rbColor;
+
+TR_CLASS(TR_Tree) {
+	void * data;
+
+	TR_rbColor color;
+
+	TR_Tree parent;
+	TR_Tree left;
+	TR_Tree right;
+};
+
+typedef int  (*TR_TreeComp)(const void *, const void *);
+typedef void (*TR_TreeAction)(const void *, const int);
+
+void * TR_treeFind(TR_Tree, const void *, TR_TreeComp);
+void * TR_treeInsert(TR_Tree *, const void *, TR_TreeComp);
+void * TR_treeDelete(TR_Tree *, const void *, TR_TreeComp);
+void   TR_treeWalk(TR_Tree, TR_TreeAction);
+void   TR_treeDestroy(TR_Tree *, TR_TreeAction);
+
+#endif // __TR_TREE_H__
+
+// vim: set ts=4 sw=4:

include/trdata.h

@@ -0,0 +1,13 @@
+#ifndef __TR_DATA_H__
+#define __TR_DATA_H__
+
+#include "tr/cbuf.h"
+#include "tr/hash.h"
+#include "tr/hash_value.h"
+#include "tr/queue.h"
+#include "tr/tree.h"
+#include "tr/interface/hashable.h"
+
+#endif // __TR_DATA_H__
+
+// vim: set ts=4 sw=4:

src/.gitignore

@@ -0,0 +1,41 @@
+.*.swp
+*.o
+*.a
+*.lo
+*.la
+*.gcda
+*.gcno
+.dirstamp
+.deps/
+.libs/
+Makefile
+configure
+Makefile.in
+m4/
+/config.*
+*.crt
+*.csr
+*.pem
+*.m4
+taskrambler.conf
+/INSTALL
+tests/coverage*
+/docs/api/
+/docs/Doxyfile
+/run
+/autom4te.cache/
+/compile
+/depcomp
+/install-sh
+/libtool
+/ltmain.sh
+/missing
+stamp-h1
+src/taskrambler
+/tests/*Test
+/tests/*.log
+/tests/*.trs
+gmon.out
+test-driver
+/assets/html/_documentation.html
+tags

src/Makefile.am

@@ -0,0 +1,17 @@
+ACLOCAL_AMFLAGS = -I m4
+AUTOMAKE_OPTIONS = subdir-objects
+
+AM_CFLAGS += -I../include/
+
+TRDATALIBS = cbuf/libcbuf.la \
+	     hash/libhash.la \
+	     queue/libqueue.la \
+	     tree/libtree.la
+
+lib_LTLIBRARIES = libtrdata.la
+
+libtrdata_la_SOURCES =
+libtrdata_la_CFLAGS  = $(AM_CFLAGS)
+libtrdata_la_LIBADD  = $(TRDATALIBS)
+
+SUBDIRS = cbuf hash queue tree

src/cbuf/Makefile.am

@@ -0,0 +1,16 @@
+ACLOCAL_AMFLAGS = -I m4
+AUTOMAKE_OPTIONS = subdir-objects
+
+AM_CFLAGS += -I../../include/
+
+CB = cbuf.c read.c \
+     get_line.c set_data.c get_data.c \
+     addr_index.c get_free.c get_read.c get_write.c \
+     inc_read.c inc_write.c is_empty.c memchr.c \
+     skip_non_alpha.c is_locked.c lock.c release.c \
+     empty.c
+
+noinst_LTLIBRARIES = libcbuf.la
+
+libcbuf_la_SOURCES = $(CB)
+libcbuf_la_CFLAGS  = $(AM_CFLAGS)

src/cbuf/addr_index.c

@@ -0,0 +1,33 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include <sys/types.h>
+
+#include "tr/cbuf.h"
+
+size_t
+TR_cbufAddrIndex(TR_Cbuf this, const void * c)
+{
+	return c - (const void *)TR_cbufGetRead(this);
+}
+
+// vim: set ts=4 sw=4:

src/cbuf/cbuf.c

@@ -0,0 +1,123 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#define _POSIX_SOURCE
+#define _POSIX_C_SOURCE 200112L
+#define _GNU_SOURCE
+
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <sys/mman.h>
+#include <stdarg.h>
+#include <stdlib.h>
+#include <stdio.h>
+#include <unistd.h>
+#include <fcntl.h>
+
+#include "trbase.h"
+#include "tr/cbuf.h"
+
+
+static void cbufDtor(void*);
+
+static
+int
+cbufCtor(void * _this, va_list * params)
+{
+	TR_Cbuf   this     = _this;
+	char      state    = -1;
+	char *    shm_name = va_arg(*params, char*);
+	long      psize    = sysconf(_SC_PAGESIZE);
+	size_t    size;
+	int       shm;
+	char    * data;
+
+	this->shm_name = TR_malloc(strlen(shm_name) + 7 + 2);
+	sprintf(this->shm_name, "/%06d_%s", getpid(), shm_name);
+
+	/**
+	 * align size at page boundary.
+	 * increase as neccessary
+	 */
+	size = va_arg(*params, size_t);
+	size = (0 >= size)? 1 : (0 != size%psize)? (size/psize)+1 : size/psize;
+	this->bsize = psize * size;
+
+	while (-1 == state) {
+		shm = shm_open(this->shm_name, O_RDWR|O_CREAT|O_EXCL, S_IRWXU);
+		if (-1 == shm) {
+			break;
+		}
+
+		if (-1 == ftruncate(shm, this->bsize)) {
+			break;
+		}
+
+		this->data = mmap (0, this->bsize << 1,
+				PROT_NONE, MAP_ANONYMOUS|MAP_PRIVATE, -1, 0);
+		if (this->data == MAP_FAILED) {
+			this->data = NULL;
+			break;
+		}   
+
+		data = mmap (this->data, this->bsize,
+				PROT_READ|PROT_WRITE, MAP_FIXED|MAP_SHARED, shm, 0);
+		if (data != this->data) {
+			break;
+		}   
+
+		data = mmap (this->data + this->bsize, this->bsize,
+				PROT_READ|PROT_WRITE, MAP_FIXED|MAP_SHARED, shm, 0);
+		if (data != this->data + this->bsize) {
+			break;
+		}   
+
+		state = 0;
+	}
+
+	if (-1 != shm) {
+		shm_unlink(this->shm_name);
+		close(shm);
+	}
+
+	return state;
+}
+
+static
+void
+cbufDtor(void * _this)
+{
+	TR_Cbuf this = _this;
+
+	TR_MEM_FREE(this->shm_name);
+
+	if (NULL != this->data && MAP_FAILED != this->data) {
+		munmap(this->data, this->bsize << 1);
+	}
+
+	this->data = NULL;
+}
+
+TR_INIT_IFACE(TR_Class, cbufCtor, cbufDtor, NULL);
+TR_CREATE_CLASS(TR_Cbuf, NULL, TR_IF(TR_Class));
+
+// vim: set ts=4 sw=4:

src/cbuf/empty.c

@@ -0,0 +1,32 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include "tr/cbuf.h"
+
+void
+TR_cbufEmpty(TR_Cbuf this)
+{
+	this->bused = 0;
+	this->read  = this->write;
+}
+
+// vim: set ts=4 sw=4:

src/cbuf/get_data.c

@@ -0,0 +1,41 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include <sys/types.h>
+#include <string.h>
+
+#include "tr/cbuf.h"
+
+char *
+TR_cbufGetData(TR_Cbuf this, size_t n)
+{
+	char * ret = TR_cbufGetRead(this);
+
+	if (n > this->bused) {
+		return (char *)-1;
+	}
+
+	TR_cbufIncRead(this, n);
+	return ret;
+}
+
+// vim: set ts=4 sw=4:

src/cbuf/get_free.c

@@ -0,0 +1,33 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include <sys/types.h>
+
+#include "tr/cbuf.h"
+
+size_t
+TR_cbufGetFree(TR_Cbuf this)
+{
+	return this->bsize - this->bused;
+}
+
+// vim: set ts=4 sw=4:

src/cbuf/get_line.c

@@ -0,0 +1,49 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include <sys/types.h>
+
+#include <string.h>
+
+#include "tr/cbuf.h"
+
+char *
+TR_cbufGetLine(TR_Cbuf this, char ** line_end)
+{
+	char * nl  = TR_cbufMemchr(this, '\n');
+	char * ret = NULL;
+
+	if (NULL != nl) {
+		size_t len = TR_cbufAddrIndex(this, nl) + 1;
+
+		*line_end = nl - 1;
+		*nl       = 0;
+		*(nl-1)   = ('\r' == *(nl-1))? 0 : *(nl-1);
+
+		ret = TR_cbufGetRead(this);
+		TR_cbufIncRead(this, len);
+	}
+
+	return ret;
+}
+
+// vim: set ts=4 sw=4:

src/cbuf/get_read.c

@@ -0,0 +1,31 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include "tr/cbuf.h"
+
+char *
+TR_cbufGetRead(TR_Cbuf this)
+{
+	return this->data + this->read;
+}
+
+// vim: set ts=4 sw=4:

src/cbuf/get_write.c

@@ -0,0 +1,31 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include "tr/cbuf.h"
+
+char *
+TR_cbufGetWrite(TR_Cbuf this)
+{
+	return this->data + this->write;
+}
+
+// vim: set ts=4 sw=4:

src/cbuf/inc_read.c

@@ -0,0 +1,36 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include <sys/types.h>
+
+#include "tr/cbuf.h"
+
+void
+TR_cbufIncRead(TR_Cbuf this, size_t n)
+{
+	this->read  += n;
+	this->read   = (this->read >= this->bsize)?
+		this->read - this->bsize : this->read;
+	this->bused -= n;
+}
+
+// vim: set ts=4 sw=4:

src/cbuf/inc_write.c

@@ -0,0 +1,36 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include <sys/types.h>
+
+#include "tr/cbuf.h"
+
+void
+TR_cbufIncWrite(TR_Cbuf this, size_t n)
+{
+	this->write += n;
+	this->write  = (this->write >= this->bsize)?
+		this->write - this->bsize : this->write;
+	this->bused += n;
+}
+
+// vim: set ts=4 sw=4:

src/cbuf/is_empty.c

@@ -0,0 +1,31 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include "tr/cbuf.h"
+
+char
+TR_cbufIsEmpty(TR_Cbuf this)
+{
+	return (0 == this->bused);
+}
+
+// vim: set ts=4 sw=4:

src/cbuf/is_locked.c

@@ -0,0 +1,31 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include "tr/cbuf.h"
+
+Bool
+TR_cbufIsLocked(TR_Cbuf this)
+{
+	return this->lock;
+}
+
+// vim: set ts=4 sw=4:

src/cbuf/lock.c

@@ -0,0 +1,31 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include "tr/cbuf.h"
+
+void
+TR_cbufLock(TR_Cbuf this)
+{
+	this->lock = TRUE;
+}
+
+// vim: set ts=4 sw=4:

src/cbuf/memchr.c

@@ -0,0 +1,33 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include <string.h>
+
+#include "tr/cbuf.h"
+
+char *
+TR_cbufMemchr(TR_Cbuf this, int c)
+{
+	return memchr(TR_cbufGetRead(this), c, this->bused);
+}
+
+// vim: set ts=4 sw=4:

src/cbuf/read.c

@@ -0,0 +1,51 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include <sys/types.h>
+#include <unistd.h>
+#include <errno.h>
+
+#include "trio.h"
+#include "tr/cbuf.h"
+
+
+ssize_t
+TR_cbufRead(TR_Cbuf this, TR_Stream st)
+{
+	size_t  rsize = TR_cbufGetFree(this);
+	ssize_t rrsize;
+
+	if (0 == rsize) {
+		errno = TR_ECBUFOVFL;
+		return -1;
+	}
+
+	rrsize = TR_streamRead(st, TR_cbufGetWrite(this), rsize);
+
+	if (0 < rrsize) {
+		TR_cbufIncWrite(this, rrsize);
+	}
+
+	return rrsize;
+}
+
+// vim: set ts=4 sw=4:

src/cbuf/release.c

@@ -0,0 +1,31 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include "tr/cbuf.h"
+
+void
+TR_cbufRelease(TR_Cbuf this)
+{
+	this->lock = FALSE;
+}
+
+// vim: set ts=4 sw=4:

src/cbuf/set_data.c

@@ -0,0 +1,45 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include <sys/types.h>
+#include <string.h>
+#include <errno.h>
+
+#include "tr/cbuf.h"
+
+char *
+TR_cbufSetData(TR_Cbuf this, const void * src, size_t n)
+{
+	char * addr;
+
+	if (n > TR_cbufGetFree(this)) {
+		errno = TR_ECBUFOVFL;
+		return (char *)-1;
+	}
+
+	addr = memcpy(TR_cbufGetWrite(this), src, n);
+	TR_cbufIncWrite(this, n);
+
+	return addr;
+}
+
+// vim: set ts=4 sw=4:

src/cbuf/skip_non_alpha.c

@@ -0,0 +1,34 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include <ctype.h>
+
+#include "tr/cbuf.h"
+
+void
+TR_cbufSkipNonAlpha(TR_Cbuf this)
+{
+	while(0 < this->bused && !isalpha(*TR_cbufGetRead(this)))
+		TR_cbufIncRead(this, 1);
+}
+
+// vim: set ts=4 sw=4:

src/hash/Makefile.am

@@ -0,0 +1,12 @@
+ACLOCAL_AMFLAGS = -I m4
+AUTOMAKE_OPTIONS = subdir-objects
+
+AM_CFLAGS += -I../../include/
+
+HASH = hash.c add.c get.c get_first.c delete.c each.c value.c \
+       cleanup.c interface/hashable.c
+
+noinst_LTLIBRARIES = libhash.la
+
+libhash_la_SOURCES = $(HASH)
+libhash_la_CFLAGS  = $(AM_CFLAGS)

src/hash/add.c

@@ -0,0 +1,65 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include <search.h>
+
+#include "tr/hash.h"
+#include "tr/interface/hashable.h"
+#include "tr/tree.h"
+
+static
+inline
+int
+hashAddComp(const void * a, const void * b)
+{
+	unsigned long hash_a = TR_hashableGetHash((void*)a);
+	unsigned long hash_b = TR_hashableGetHash((void*)b);
+
+	if (hash_a < hash_b) {
+		return -1;
+	}
+	
+	if (hash_a > hash_b) {
+		return 1;
+	}
+
+	return 0;
+}
+
+void *
+TR_hashAdd(TR_Hash this, void * operand)
+{
+	void * found = TR_treeInsert(&this->root, operand, hashAddComp);
+
+	if (NULL == found) {
+		return NULL;
+	}
+
+	if (operand != found) {
+		TR_hashableHandleDouble(found, operand);
+		TR_delete(operand);
+	}
+
+	return found;
+}
+
+// vim: set ts=4 sw=4:

src/hash/cleanup.c

@@ -0,0 +1,41 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include "trbase.h"
+#include "tr/hash.h"
+#include "tr/tree.h"
+
+static
+inline
+void
+tDelete(const void * node, const int depth)
+{
+	TR_delete(node);
+}
+
+void
+TR_hashCleanup(TR_Hash this)
+{
+	TR_treeDestroy(&(this->root), tDelete);
+}
+
+// vim: set ts=4 sw=4:

src/hash/delete.c

@@ -0,0 +1,67 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include <sys/types.h>
+
+#include "trhash.h"
+#include "tr/interface/hashable.h"
+#include "tr/hash.h"
+#include "tr/tree.h"
+
+static
+inline
+int
+hashDeleteComp(const void * a, const void * b)
+{
+	unsigned long hash_a = TR_hashableGetHash((void*)a);
+
+	if (hash_a < *(const unsigned long*)b) {
+		return -1;
+	}
+	
+	if (hash_a > *(const unsigned long*)b) {
+		return 1;
+	}
+
+	return 0;
+}
+
+void *
+TR_hashDelete(TR_Hash this, const char * search, size_t nsearch)
+{
+	unsigned long   hash  = TR_sdbm((const unsigned char *)search, nsearch);
+	void          * found = NULL;
+
+	found = TR_treeDelete(&(this->root), &hash, hashDeleteComp);
+
+	return found;
+}
+
+void *
+TR_hashDeleteByVal(TR_Hash this, unsigned long hash)
+{
+	void * found = TR_treeDelete(&(this->root), &hash, hashDeleteComp);
+
+	return found;
+}
+
+// vim: set ts=4 sw=4:

src/hash/each.c

@@ -0,0 +1,46 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include <search.h>
+
+#include "tr/hash.h"
+#include "tr/tree.h"
+
+static void (*cb)(const void*);
+
+static
+inline
+void
+walk(const void * node, const int depth)
+{
+	cb(node);
+}
+
+void
+TR_hashEach(TR_Hash this, void (*callback)(const void*))
+{
+	cb = callback;
+
+	TR_treeWalk(this->root, walk);
+}
+
+// vim: set ts=4 sw=4:

src/hash/get.c

@@ -0,0 +1,68 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include <stdio.h>
+
+#include <search.h>
+#include <sys/types.h>
+
+#include "trhash.h"
+#include "tr/hash.h"
+#include "tr/interface/hashable.h"
+#include "tr/tree.h"
+
+static
+inline
+int
+hashGetComp(const void * a, const void * b)
+{
+	unsigned long hash_a = TR_hashableGetHash((void*)a);
+
+	if (hash_a < *(const unsigned long*)b) {
+		return -1;
+	}
+	
+	if (hash_a > *(const unsigned long*)b) {
+		return 1;
+	}
+
+	return 0;
+}
+
+void *
+TR_hashGet(TR_Hash this, const char * search, size_t nsearch)
+{
+	unsigned long   hash  = TR_sdbm((const unsigned char *)search, nsearch);
+	void          * found = TR_treeFind(this->root, &hash, hashGetComp);
+
+	return found;
+}
+
+void *
+TR_hashGetByVal(TR_Hash this, unsigned long hash)
+{
+	void * found = TR_treeFind(this->root, &hash, hashGetComp);
+
+	return found;
+}
+
+// vim: set ts=4 sw=4:

src/hash/get_first.c

@@ -0,0 +1,33 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include <sys/types.h>
+
+#include "tr/hash.h"
+
+void *
+TR_hashGetFirst(TR_Hash this)
+{
+	return this->root;
+}
+
+// vim: set ts=4 sw=4:

src/hash/hash.c

@@ -0,0 +1,57 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#define _GNU_SOURCE
+
+#include <stdarg.h>
+
+#include "trbase.h"
+#include "tr/hash.h"
+
+static
+int
+hashCtor(void * _this, va_list * params)
+{
+	return 0;
+}
+
+static
+inline
+void
+tDelete(const void * node, const int depth)
+{
+	TR_delete(node);
+}
+
+static
+void
+hashDtor(void * _this)
+{
+	TR_Hash this = _this;
+
+	TR_hashCleanup(this);
+}
+
+TR_INIT_IFACE(TR_Class, hashCtor, hashDtor, NULL);
+TR_CREATE_CLASS(TR_Hash, NULL, TR_IF(TR_Class));
+
+// vim: set ts=4 sw=4:

src/hash/interface/hashable.c

@@ -0,0 +1,48 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <stdarg.h>
+
+#include "trbase.h"
+#include "tr/interface/hashable.h"
+
+TR_CREATE_INTERFACE(TR_Hashable, 2);
+
+unsigned long
+TR_hashableGetHash(void * hashable)
+{
+	unsigned long ret;
+
+	TR_RETCALL(hashable, TR_Hashable, getHash, ret);
+
+	return ret;
+}
+
+void
+TR_hashableHandleDouble(void * hashable, void * new_hashable)
+{
+	TR_CALL(hashable, TR_Hashable, handleDouble, new_hashable);
+}
+
+// vim: set ts=4 sw=4:

src/hash/value.c

@@ -0,0 +1,107 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include <stdarg.h>
+#include <stdlib.h>
+#include <string.h>
+#include <sys/types.h>
+
+#include "trbase.h"
+#include "trhash.h"
+#include "tr/hash_value.h"
+#include "tr/interface/hashable.h"
+
+static
+int
+hashValueCtor(void * _this, va_list * params)
+{
+	TR_HashValue this = _this;
+	char * key        = va_arg(* params, char*);
+	void * value;
+	
+	this->nkey   = va_arg(* params, size_t);
+	value        = va_arg(* params, void*);
+	this->nvalue = va_arg(* params, size_t);
+
+	this->key = TR_malloc(this->nkey + 1);
+	this->key[this->nkey] = 0;
+	memcpy(this->key, key, this->nkey);
+
+	this->hash = TR_sdbm((unsigned char *)this->key, this->nkey);
+
+	if (NULL != value) {
+		this->value = TR_malloc(this->nvalue + 1);
+		((char*)this->value)[this->nvalue] = 0;
+		memcpy(this->value, value, this->nvalue);
+	}
+
+	return 0;
+}
+
+static
+void
+hashValueDtor(void * _this)
+{
+	TR_HashValue this = _this;
+
+	TR_MEM_FREE(this->key);
+	TR_MEM_FREE(this->value);
+}
+
+static
+unsigned long
+hashValueGetHash(void * _this)
+{
+	TR_HashValue this = _this;
+
+	return this->hash;
+}
+
+static
+void
+hashValueHandleDouble(void * _this, void * _double)
+{
+	TR_HashValue this = _this;
+	TR_HashValue doub = _double;
+	void * tmp_value;
+	size_t tmp_nvalue;
+
+	/**
+	 * here we swap the internal data of both objects,
+	 * effectively overwriting the old entry. We need not
+	 * to free anything here as _double will be deleted
+	 * afterwards anyway (\see hash/add.c).
+	 */
+	tmp_value   = this->value;
+	this->value = doub->value;
+	doub->value = tmp_value;
+
+	tmp_nvalue   = this->nvalue;
+	this->nvalue = doub->nvalue;
+	doub->nvalue = tmp_nvalue;
+}
+
+TR_INIT_IFACE(TR_Class, hashValueCtor, hashValueDtor, NULL);
+TR_INIT_IFACE(TR_Hashable, hashValueGetHash, hashValueHandleDouble);
+TR_CREATE_CLASS(TR_HashValue, NULL, TR_IF(TR_Class), TR_IF(TR_Hashable));
+
+// vim: set ts=4 sw=4:

src/queue/Makefile.am

@@ -0,0 +1,9 @@
+ACLOCAL_AMFLAGS = -I m4
+AUTOMAKE_OPTIONS = subdir-objects
+
+AM_CFLAGS += -I../../include/
+
+noinst_LTLIBRARIES = libqueue.la
+
+libqueue_la_SOURCES = queue.c get.c put.c
+libqueue_la_CFLAGS  = $(AM_CFLAGS)

src/queue/get.c

@@ -0,0 +1,51 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include "trbase.h"
+#include "tr/queue.h"
+
+void *
+TR_queueGet(TR_Queue this)
+{
+	TR_Queue   first;
+	void     * msg;
+
+	if (NULL == this->first) {
+		return NULL;
+	}
+
+	msg   = this->first->msg;
+	first = this->first->next;
+
+	if (this->first == this->last) {
+		this->last = NULL;
+	}
+	TR_delete(this->first);
+
+	this->next  = first;
+	this->first = first;
+	this->nmsg--;
+
+	return msg;
+}
+
+// vim: set ts=4 sw=4:

src/queue/put.c

@@ -0,0 +1,42 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include "trbase.h"
+#include "tr/queue.h"
+
+void
+TR_queuePut(TR_Queue this, void * msg)
+{
+	TR_Queue node = (this->last)? this->last : this;
+
+	node->next = TR_new(TR_Queue);
+	this->last = node->next;
+
+	if (node == this) {
+		this->first = node->next;
+	}
+
+	node->next->msg = msg;
+	this->nmsg++;
+}
+
+// vim: set ts=4 sw=4:

src/queue/queue.c

@@ -0,0 +1,53 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include <stdarg.h>
+
+#include "trbase.h"
+#include "tr/queue.h"
+
+static
+int
+queueCtor(void * _this, va_list * params)
+{
+	return 0;
+}
+
+static
+void
+queueDtor(void * _this)
+{
+	TR_Queue this = _this;
+	TR_Queue node = this->first;
+	
+	while (NULL != node) {
+		TR_Queue next = node->next;
+		TR_delete(node->msg);
+		TR_delete(node);
+		node = next;
+	}
+}
+
+TR_INIT_IFACE(TR_Class, queueCtor, queueDtor, NULL);
+TR_CREATE_CLASS(TR_Queue, NULL, TR_IF(TR_Class));
+
+// vim: set ts=4 sw=4:

src/tree/Makefile.am

@@ -0,0 +1,12 @@
+ACLOCAL_AMFLAGS = -I m4
+AUTOMAKE_OPTIONS = subdir-objects
+
+TREE = tree.c find.c insert.c inOrderSuccessor.c delete.c walk.c \
+       rotateLeft.c rotateRight.c destroy.c
+
+AM_CFLAGS += -I../../include/
+
+noinst_LTLIBRARIES = libtree.la
+
+libtree_la_SOURCES = $(TREE)
+libtree_la_CFLAGS  = $(AM_CFLAGS)

src/tree/delete.c

@@ -0,0 +1,249 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include "trbase.h"
+#include "tr/tree.h"
+
+TR_Tree TR_inOrderSuccessor(TR_Tree);
+void TR_treeRotateLeft(TR_Tree *, TR_Tree);
+void TR_treeRotateRight(TR_Tree *, TR_Tree);
+
+void *
+TR_treeDelete(TR_Tree * this, const void * search, TR_TreeComp comp)
+{
+	TR_Tree   node = *this;
+	TR_Tree   del_node;
+
+	void    * data;
+
+	/*
+	 * first search for it and if its found return the data
+	 * and we are done...
+	 */
+	while (NULL != node) {
+		int comparison = comp(node->data, search);
+
+		if (0 < comparison) {
+			node = TR_TREE_LEFT(node);
+			continue;
+		}
+
+		if (0 > comparison) {
+			node = TR_TREE_RIGHT(node);
+			continue;
+		}
+
+		if (0 == comparison) {
+			break;
+		}
+	}   
+
+	/*
+	 * nothing was found...return NULL to indicate this.
+	 */
+	if (NULL == node) {
+		return NULL;
+	}
+
+	/*
+	 * we found an element, store its data pointer as we are
+	 * up to delete it.
+	 */
+	data = node->data;
+
+	/*
+	 * now remove the element.
+	 */
+	
+	/*
+	 * if we have two children replace data with the one from 
+	 * out inOrderSuccessor and remove the inOrderSuccessor.
+	 */
+	if (NULL != TR_TREE_LEFT(node) && NULL != TR_TREE_RIGHT(node)) {
+		TR_Tree successor = TR_inOrderSuccessor(node);
+
+		node->data = successor->data;
+		node       = successor;
+	}
+
+	{
+		TR_Tree child = TR_TREE_CHILD(node);
+
+		/*
+		 * if we still have one child replace ourself with it.
+		 */
+		TR_TREE_REPLACE_NODE(this, node, child);
+
+		/*
+		 * and finally delete the node...and prepare ourselfs
+		 * for rebalancing.
+		 */
+		if (rbBlack == node->color) {
+			if (NULL != child && rbRed == child->color) {
+				child->color = rbBlack;
+				TR_delete(node);
+				return data;
+			} else {
+				del_node = node;
+				if (NULL != child) {
+					node = child;
+				} else {
+					node->color = rbBlack;
+					node->left  = NULL;
+					node->right = NULL;
+				}
+			}
+		} else {
+			TR_delete(node);
+			return data;
+		}
+	}
+
+	/*
+	 * now comes rebalancing...note that if we came to this point
+	 * the node is still not deleted.
+	 * This is because I am not sure if it is needed during the
+	 * rebalancing process...(this does not make much sense, but
+	 * to be honest I don't know now.)
+	 */
+	while(1) {
+		// case 1
+		if (NULL == TR_TREE_PARENT(node)) {
+			break;
+		}
+
+		// case 2
+		if (NULL != TR_TREE_SIBLING(node)
+				&& rbRed == TR_TREE_SIBLING(node)->color) {
+
+			TR_TREE_PARENT(node)->color  = rbRed;
+			TR_TREE_SIBLING(node)->color = rbBlack;
+
+			if (NULL != TR_TREE_PARENT(node)->right &&
+					node != TR_TREE_PARENT(node)->right) {
+
+				//TREE_ROTATE_LEFT(this, TREE_PARENT(node));
+				TR_treeRotateLeft(this, TR_TREE_PARENT(node));
+
+			} else {
+
+				//TREE_ROTATE_RIGHT(this, TREE_PARENT(node));
+				TR_treeRotateRight(this, TR_TREE_PARENT(node));
+
+			}
+		}
+
+		// case 3 / 4
+		if (NULL == TR_TREE_SIBLING(node)
+				|| (rbBlack == TR_TREE_SIBLING(node)->color
+					&& (NULL == TR_TREE_SIBLING(node)->left
+						|| rbBlack == TR_TREE_SIBLING(node)->left->color)
+					&& (NULL == TR_TREE_SIBLING(node)->right
+						|| rbBlack == TR_TREE_SIBLING(node)->right->color))) {
+
+			if (NULL != TR_TREE_SIBLING(node)) {
+				TR_TREE_SIBLING(node)->color = rbRed;
+			}
+
+
+			/*
+			 * this is the point where during the balancing our tree
+			 * node can be finally deleted.
+			 */
+			if (rbBlack == TR_TREE_PARENT(node)->color) {
+				// case 3
+				TR_Tree parent = node->parent;
+				node = parent;
+				continue;
+			} else {
+				// case 4
+				TR_TREE_PARENT(node)->color = rbBlack;
+				break;
+			}
+		}
+
+		// case 5
+		if (NULL != TR_TREE_SIBLING(node)
+				&& rbBlack == TR_TREE_SIBLING(node)->color) {
+
+			if (node == TR_TREE_PARENT(node)->left
+					&& (NULL == TR_TREE_SIBLING(node)->right
+						|| rbBlack == TR_TREE_SIBLING(node)->right->color)
+					&& (NULL != TR_TREE_SIBLING(node)->left
+						&& rbRed == TR_TREE_SIBLING(node)->left->color)) {
+
+				TR_TREE_SIBLING(node)->color       = rbRed;
+				TR_TREE_SIBLING(node)->left->color = rbBlack;
+
+				//TREE_ROTATE_RIGHT(this, TREE_SIBLING(node));
+				TR_treeRotateRight(this, TR_TREE_SIBLING(node));
+
+			} else if (node == TR_TREE_PARENT(node)->right
+					&& (NULL == TR_TREE_SIBLING(node)->left
+						|| rbBlack == TR_TREE_SIBLING(node)->left->color)
+					&& (NULL != TR_TREE_SIBLING(node)->right
+						&& rbRed == TR_TREE_SIBLING(node)->right->color)) {
+
+				TR_TREE_SIBLING(node)->color        = rbRed;
+				TR_TREE_SIBLING(node)->right->color = rbBlack;
+
+				//TREE_ROTATE_LEFT(this, TREE_SIBLING(node));
+				TR_treeRotateLeft(this, TR_TREE_SIBLING(node));
+			}
+		}
+		
+		// case 6
+		if (NULL != TR_TREE_SIBLING(node)) {
+			TR_TREE_SIBLING(node)->color = TR_TREE_PARENT(node)->color;
+		}
+
+		if (NULL != node && NULL != TR_TREE_PARENT(node)) {
+			TR_TREE_PARENT(node)->color = rbBlack;
+
+			if (NULL != TR_TREE_PARENT(node)->right
+					&& node != TR_TREE_PARENT(node)->right) {
+
+				if (NULL != TR_TREE_SIBLING(node)->right) {
+					TR_TREE_SIBLING(node)->right->color = rbBlack;
+				}
+				//TREE_ROTATE_LEFT(this, TREE_PARENT(node));
+				TR_treeRotateLeft(this, TR_TREE_PARENT(node));
+			} else {
+				if (NULL != TR_TREE_SIBLING(node)->left) {
+					TR_TREE_SIBLING(node)->left->color = rbBlack;
+				}
+				//TREE_ROTATE_RIGHT(this, TREE_PARENT(node));
+				TR_treeRotateRight(this, TR_TREE_PARENT(node));
+			}
+		}
+
+		break;
+	}
+
+	TR_delete(del_node);
+	/*
+	 * not sure if deleting here is correct.
+	 */
+	return data;
+}
+
+// vim: set ts=4 sw=4:

src/tree/destroy.c

@@ -0,0 +1,86 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include "trbase.h"
+#include "tr/tree.h"
+
+void
+TR_treeDestroy(TR_Tree * this, TR_TreeAction action)
+{
+    TR_Tree previous = * this;
+    TR_Tree node     = * this;
+    int  depth    = 1;
+    
+    /*
+     * I think this has something like O(n+log(n)) on a ballanced
+     * tree because I have to traverse back the rightmost leaf to
+     * the root to get a break condition.
+     */
+    while (NULL != node) {
+        /*
+         * If we come from the right so nothing and go to our
+         * next parent.
+         */
+        if (((NULL == TR_TREE_LEFT(node)
+				|| previous == TR_TREE_LEFT(node)) && NULL == TR_TREE_RIGHT(node))
+				|| previous == TR_TREE_RIGHT(node)) {
+            
+            TR_Tree parent = TR_TREE_PARENT(node);
+            
+            action(node->data, depth);
+            
+            previous = node;
+			TR_delete(node);
+            node = parent;
+            depth--;
+
+            continue;
+        }
+        
+        if ((NULL == TR_TREE_LEFT(node) || previous == TR_TREE_LEFT(node))) {
+            /*
+             * If there are no more elements to the left or we
+             * came from the left, process data.
+             */
+            previous = node;
+            
+            if (NULL != TR_TREE_RIGHT(node)) {
+                node = TR_TREE_RIGHT(node);
+                depth++;
+            } else { 
+                node = TR_TREE_PARENT(node);
+                depth--;
+            }
+        } else {
+            /*
+             * if there are more elements to the left go there.
+             */
+            previous = node;
+            node     = TR_TREE_LEFT(node);
+            depth++;
+        }
+    }
+	
+	*this = NULL;
+}
+
+// vim: set ts=4 sw=4:

src/tree/find.c

@@ -0,0 +1,49 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include "tr/tree.h"
+
+void *
+TR_treeFind(TR_Tree this, const void * search, TR_TreeComp comp)
+{
+	while (NULL != this) {
+		int comparison = comp(this->data, search);
+
+		if (0 < comparison) {
+			this = TR_TREE_LEFT(this);
+			continue;
+		}
+
+		if (0 > comparison) {
+			this = TR_TREE_RIGHT(this);
+			continue;
+		}
+
+		if (0 == comparison) {
+			break;
+		}
+	}   
+
+	return NULL != this ? this->data : NULL;
+}
+
+// vim: set ts=4 sw=4:

src/tree/inOrderSuccessor.c

@@ -0,0 +1,37 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include "tr/tree.h"
+
+TR_Tree
+TR_inOrderSuccessor(TR_Tree this)
+{
+	this = TR_TREE_RIGHT(this);
+
+	while (NULL != TR_TREE_LEFT(this)) {
+		this = TR_TREE_LEFT(this);
+	}
+
+	return this;
+}
+
+// vim: set ts=4 sw=4:

src/tree/insert.c

@@ -0,0 +1,153 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include "trbase.h"
+#include "tr/tree.h"
+
+void TR_treeRotateLeft(TR_Tree *, TR_Tree);
+void TR_treeRotateRight(TR_Tree *, TR_Tree);
+
+void *
+TR_treeInsert(TR_Tree * this, const void * search, TR_TreeComp comp)
+{
+	TR_Tree node     = *this;
+	TR_Tree new_node = NULL;
+
+	/*
+	 * insert the node or return the one in tree if comparison
+	 * succeeds.
+	 */
+	if (NULL == node) {
+		/*
+		 * if the root is NULL we simple add the element and set
+		 * node to it.
+		 */
+		*this = node = new_node = TR_new(TR_Tree, search);
+	} else {
+		/*
+		 * first search for it and if its found return the data
+		 * and we are done...
+		 */
+		int  comparison;
+
+		while (NULL != node) {
+			comparison = comp(node->data, search);
+
+			if (0 < comparison) {
+				if (NULL != TR_TREE_LEFT(node)) {
+					node = TR_TREE_LEFT(node);
+					continue;
+				} else {
+					break;
+				}
+			}
+
+			if (0 > comparison) {
+				if (NULL != TR_TREE_RIGHT(node)) {
+					node = TR_TREE_RIGHT(node);
+					continue;
+				} else {
+					break;
+				}
+			}
+
+			if (0 == comparison) {
+				return node->data;
+			}
+		}   
+
+		/*
+		 * as we have not found it now add a new element.
+		 */
+		if (0 < comparison) {
+			node->left = TR_new(TR_Tree, search);
+			TR_TREE_LEFT(node)->parent = node;
+			node = new_node = TR_TREE_LEFT(node);
+		} else {
+			node->right = TR_new(TR_Tree, search);
+			TR_TREE_RIGHT(node)->parent = node;
+			node = new_node = TR_TREE_RIGHT(node);
+		}
+	}
+
+	/*
+	 * we expect node not to be NULL and pointing to our
+	 * new node at this point...now rabalance the tree
+	 */
+	while (1) {
+		// case 1
+		if (NULL == TR_TREE_PARENT(node)) {
+			node->color = rbBlack;
+			break;
+		}
+
+		// case 2
+		if (rbBlack == TR_TREE_PARENT(node)->color) {
+			break;
+		}
+
+		// case 3
+		if (NULL != TR_TREE_UNCLE(node) && rbRed == TR_TREE_UNCLE(node)->color) {
+			TR_TREE_PARENT(node)->color      = rbBlack;
+			TR_TREE_UNCLE(node)->color       = rbBlack;
+			TR_TREE_GRANDPARENT(node)->color = rbRed;
+
+			node = TR_TREE_GRANDPARENT(node);
+			continue;
+		}
+
+		// case 4
+		if (node == TR_TREE_PARENT(node)->right
+				&& TR_TREE_PARENT(node) == TR_TREE_GRANDPARENT(node)->left) {
+
+			//TREE_ROTATE_LEFT(this, TREE_PARENT(node));
+			TR_treeRotateLeft(this, TR_TREE_PARENT(node));
+			node = TR_TREE_LEFT(node);
+
+		} else if (node == TR_TREE_PARENT(node)->left
+				&& TR_TREE_PARENT(node) == TR_TREE_GRANDPARENT(node)->right) {
+
+			//TREE_ROTATE_RIGHT(this, TREE_PARENT(node));
+			TR_treeRotateRight(this, TR_TREE_PARENT(node));
+			node = TR_TREE_RIGHT(node);
+
+		}
+
+		// case 5
+		TR_TREE_PARENT(node)->color      = rbBlack;
+		TR_TREE_GRANDPARENT(node)->color = rbRed;
+
+		if (node == TR_TREE_PARENT(node)->left) {
+			//TREE_ROTATE_RIGHT(this, TREE_GRANDPARENT(node));
+			TR_treeRotateRight(this, TR_TREE_GRANDPARENT(node));
+		} else {
+			//TREE_ROTATE_LEFT(this, TREE_GRANDPARENT(node));
+			TR_treeRotateLeft(this, TR_TREE_GRANDPARENT(node));
+		}
+
+		break;
+	}
+
+	return new_node->data;
+}
+
+// vim: set ts=4 sw=4:

src/tree/rotateLeft.c

@@ -0,0 +1,51 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include "tr/tree.h"
+
+void
+TR_treeRotateLeft(TR_Tree * this, TR_Tree node)
+{
+	TR_Tree rightChild = TR_TREE_RIGHT(node);
+	TR_Tree rcLeftSub  = TR_TREE_RIGHT_LEFT(node);
+
+	rightChild->left   = node;
+	rightChild->parent = TR_TREE_PARENT(node);
+	node->right        = rcLeftSub;
+	if (NULL != rcLeftSub) {
+		rcLeftSub->parent  = node;
+	}   
+
+	if (NULL != TR_TREE_PARENT(node)) {
+		if (TR_TREE_PARENT(node)->left == node) {
+			TR_TREE_PARENT(node)->left = rightChild;
+		} else {
+			TR_TREE_PARENT(node)->right = rightChild;
+		}   
+	} else {
+		*this = rightChild;
+	}   
+
+	node->parent = rightChild;
+}
+
+// vim: set ts=4 sw=4:

src/tree/rotateRight.c

@@ -0,0 +1,51 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include "tr/tree.h"
+
+void
+TR_treeRotateRight(TR_Tree * this, TR_Tree node)
+{
+	TR_Tree leftChild  = TR_TREE_LEFT(node);
+	TR_Tree lcRightSub = TR_TREE_LEFT_RIGHT(node);
+
+	leftChild->right   = node;
+	leftChild->parent  = TR_TREE_PARENT(node);
+	node->left         = lcRightSub;
+	if (NULL != lcRightSub) {
+		lcRightSub->parent = node;
+	}   
+
+	if (NULL != TR_TREE_PARENT(node)) {
+		if (TR_TREE_PARENT(node)->left == node) {
+			TR_TREE_PARENT(node)->left = leftChild;
+		} else {
+			TR_TREE_PARENT(node)->right = leftChild;
+		}   
+	} else {
+		*this = leftChild;
+	}   
+
+	node->parent = leftChild;
+}
+
+// vim: set ts=4 sw=4:

src/tree/tree.c

@@ -0,0 +1,54 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#define _GNU_SOURCE
+
+#include <stdarg.h>
+
+#include "trbase.h"
+#include "tr/tree.h"
+
+static
+int
+treeCtor(void * _this, va_list * params)
+{
+	TR_Tree this = _this;
+
+	this->data   = va_arg(*params, void *);
+	this->color  = rbRed;
+	this->parent = NULL;
+	this->left   = NULL;
+	this->right  = NULL;
+
+	return 0;
+}
+
+static
+void
+treeDtor(void * _this)
+{
+}
+
+TR_INIT_IFACE(TR_Class, treeCtor, treeDtor, NULL);
+TR_CREATE_CLASS(TR_Tree, NULL, TR_IF(TR_Class));
+
+// vim: set ts=4 sw=4:

src/tree/walk.c

@@ -0,0 +1,59 @@
+/**
+ * \file
+ *
+ * \author	Georg Hopp
+ *
+ * \copyright
+ * Copyright © 2012  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include "tr/tree.h"
+
+void
+TR_treeWalk(TR_Tree this, TR_TreeAction action)
+{
+	TR_Tree previous = this;
+	TR_Tree node     = this;
+	int  depth       = 1;
+
+	while (NULL != node) {
+		if (previous == TR_TREE_RIGHT(node)) {
+			previous = node;
+			node     = node->parent;
+			depth--;
+			continue;
+		}
+
+		if (NULL == TR_TREE_LEFT(node) || previous == TR_TREE_LEFT(node)) {
+			action(node->data, depth);
+			previous = node;
+
+			if (NULL != TR_TREE_RIGHT(node)) {
+				node = TR_TREE_RIGHT(node);
+				depth++;
+			} else {
+				node = TR_TREE_PARENT(node);
+				depth--;
+			}
+		} else {
+			previous = node;
+			node     = TR_TREE_LEFT(node);
+			depth++;
+		}
+	}
+}
+
+// vim: set ts=4 sw=4:

tests/Makefile.am

@@ -0,0 +1,65 @@
+ACLOCAL_AMFLAGS = -I m4
+AUTOMAKE_OPTIONS = subdir-objects
+
+TESTS_ENVIRONMENT = valgrind \
+		    --error-exitcode=123 \
+		    --leak-check=full \
+		    --suppressions=./suppress/external.supp \
+		    --quiet
+TESTS = classTest
+check_PROGRAMS = classTest
+
+COMMON = runtest.c
+CLASS  = $(COMMON) \
+	 ../src/interface.c \
+	 ../src/i_class.c \
+	 ../src/memory.c \
+	 mock/mock_class.c
+
+AM_CFLAGS += -O0 -Wall -Werror -ggdb -I ../include -I .. -I . $(MEM_OPT_FLAGS)
+AM_LDFLAGS = 
+
+if HAVE_GCOV
+AM_CFLAGS += $(COVERAGE_CFLAGS)
+AM_LDFLAGS += $(COVERAGE_LDFLAGS)
+endif
+
+classTest_SOURCES = $(CLASS) classTest.c
+classTest_CFLAGS  = $(AM_CFLAGS) -pg
+classTest_LDFLAGS = $(AM_LDFLAGS) -pg
+
+EXTRA_DIST = runtest.h mock suppress
+
+if HAVE_GCOV
+
+.PHONY: clean-gcda clean-gcno coverage-html clean-coverage
+
+cov_dir = $(top_srcdir)/tests/coverage/$(PACKAGE_VERSION)
+
+coverage-html: clean clean-coverage check
+	@echo Collecting coverage data
+	$(LCOV) -d $(top_srcdir) -c -i -o coverage.base
+	$(LCOV) -d $(top_srcdir) -c -o coverage.run --gcov-tool /usr/bin/gcov
+	$(LCOV) -d $(top_srcdir) \
+		-a ./coverage.base -a ./coverage.run \
+		-o coverage.info
+	LANG=C $(GENHTML) --prefix $(top_srcdir) \
+	     --output-directory $(cov_dir) \
+	     --title "$(PACKAGE_NAME) $(PACKAGE_VERSION)" \
+	     --legend --branch-coverage --show-details coverage.run
+
+clean-coverage: clean-gcda clean-gcno
+	$(LCOV) -d $(top_srcdir) -z
+	-rm -rf coverage.info coverage.base coverage.run $(cov_dir)
+  
+clean-gcda:
+	@echo Removing old coverage results
+	-find $(top_srcdir) -name '*.gcda' -print | xargs -r rm
+  
+clean-gcno:
+	@echo Removing old coverage results
+	-find $(top_srcdir) -name '*.gcno' -print | xargs -r rm
+  
+clean-local: clean-coverage
+
+endif # HAVE_GCOV

tests/classTest.c

@@ -0,0 +1,121 @@
+/**
+ * \file
+ * cclassTest.c: tests for my oop C stuff
+ * Copyright (C) 2011  Georg Hopp
+ *
+ * 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/>.
+ */
+#include <stdio.h>
+#include <sys/types.h>
+
+#include "runtest.h"
+#include "mock/mock_class.h"
+
+#include "tr/class.h"
+
+const char testname[] = "cclassTest";
+
+MockClass mock = NULL;
+
+static
+int
+__setUp()
+{
+    mock = NULL;
+    _reset();
+
+    return TEST_OK;
+}
+int (* const setUp)() = __setUp;
+
+static
+int
+__tearDown()
+{
+    if (NULL != mock) {
+        ASSERT_OBJECT(mock);
+        TR_delete(mock);
+    }
+
+    return TEST_OK;
+}
+int (* const tearDown)() = __tearDown;
+
+static
+int
+testNew(void)
+{
+    mock = TR_new(MockClass, 123);
+
+    ASSERT_OBJECT_NOT_NULL(mock);
+    ASSERT_EQUAL(1, _called);
+    ASSERT_EQUAL(123, mock->value);
+
+    return TEST_OK;
+}
+
+static
+int
+testNewFail(void)
+{
+    mock = TR_new(MockClass, 321);
+
+    ASSERT_NULL(mock);
+
+    return TEST_OK;
+}
+
+static
+int
+testDelete(void)
+{
+    mock = TR_new(MockClass, 123);
+
+    ASSERT_NOT_NULL(mock);
+
+    _reset();
+    TR_delete(mock);
+
+    ASSERT_NULL(mock);
+    ASSERT_EQUAL(1, _called);
+
+    return TEST_OK;
+}
+
+static
+int
+testClone(void)
+{
+    MockClass clone;
+
+    mock  = TR_new(MockClass, 123);
+    clone = TR_clone(mock);
+
+    ASSERT_INSTANCE_OF(MockClass, clone);
+    ASSERT_EQUAL(mock->value, clone->value);
+
+    TR_delete(clone);
+
+    return TEST_OK;
+}
+
+const testfunc tests[] = {
+    testNew,
+    testNewFail,
+    testDelete,
+    testClone
+};
+const size_t count = FUNCS_COUNT(tests);
+
+// vim: set et ts=4 sw=4:

tests/mock/mock_class.c

@@ -0,0 +1,72 @@
+/**
+ * \file
+ * mock/class.c: a mock to test my oop stuff
+ * Copyright (C) 2011  Georg Hopp
+ *
+ * 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/>.
+ */
+
+#include <assert.h>
+#include <stdarg.h>
+
+#include "tr/class.h"
+#include "mock_class.h"
+
+char _called;
+
+void
+_reset()
+{
+    _called = 0;
+}
+
+static
+inline
+int
+mockCtor(void * _this, va_list * params)
+{
+    MockClass this = _this;
+
+    _called = 1;
+    this->value = va_arg(* params, int);
+
+    if (321 == this->value)
+        return -1;
+
+    return 0;
+}
+
+static
+inline
+void
+mockDtor(void * _this)
+{
+    _called = 1;
+}
+
+static
+inline
+void
+mockClone(void * _this, void * _base)
+{
+    MockClass this = _this;
+    MockClass base = _base;
+
+    this->value = base->value;
+}
+
+TR_INIT_IFACE(TR_Class, mockCtor, mockDtor, mockClone);
+TR_CREATE_CLASS(MockClass, NULL, TR_IF(TR_Class));
+
+// vim: set et ts=4 sw=4:

tests/mock/mock_class.h

@@ -0,0 +1,49 @@
+/**
+ * \file
+ * mock/class.h: definitions for my mock to test my oop stuff
+ *
+ * \author Georg Hopp <georg@steffers.org>
+ *
+ * \copyright
+ * Copyright (C) 2011  Georg Hopp
+ *
+ * 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/>.
+ */
+#ifndef __MOCK_MOCK_CLASS_H__
+#define __MOCK_MOCK_CLASS_H__
+
+#include "trbase.h"
+
+extern char _called;
+
+#ifndef _RESET
+#define _RESET
+void _reset();
+#endif // _RESET
+
+
+TR_CLASS(MockClass) {
+    int value;
+};
+
+/**
+ * ~~~ method declarations ~~~~~~~~
+ */
+
+int  mockClassGetValue(MockClass this);
+void mockClassSetValue(MockClass this, int value);
+
+#endif//__MOCK_MOCK_CLASS_H__
+
+// vim: set et ts=4 sw=4:

tests/runtest.c

@@ -0,0 +1,121 @@
+/**
+ * \file
+ * runtest.c: the main runner for my tests
+ * Copyright (C) 2011  Georg Hopp
+ *
+ * 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/>.
+ */
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <sys/types.h>
+
+#include "runtest.h"
+#include "tr/class.h"
+
+
+#define TEST_OK_CHAR		'.'
+#define TEST_FAILED_CHAR	'F'
+#define TEST_ERROR_CHAR		'E'
+
+
+const char results[3] = {
+    TEST_OK_CHAR,
+    TEST_FAILED_CHAR,
+    TEST_ERROR_CHAR
+};
+
+int
+isObjectNull(void * object)
+{
+    TR_class_ptr class = TR_GET_CLASS(object);
+
+    if (! TR_IS_OBJECT(object)) {
+        return 0;
+    }
+
+    return isMemNull(object, class->object_size);
+}
+
+int
+isMemNull(void * _mem, size_t size)
+{
+    size_t index;
+
+    if (NULL == _mem) {
+        return 0;
+    }
+
+    for(index=0; index<size && 0 == ((char *)_mem)[index]; index++);
+
+    return (size == index);
+}
+
+int
+main(int argc, char * argv[])
+{
+    size_t errors     = 0;
+    size_t failures   = 0;
+    // size_t assertions = 0;   // @TODO find a way to count assertions
+
+    size_t index;
+
+    printf("running tests for %s\n", testname);
+
+    for (index=0; index<count; index++) {
+        int result = TEST_ERROR, _setUp = 0;  // initialize setup to false
+
+        if (NULL != setUp) {
+            if (TEST_OK == (result = setUp())) {
+                _setUp = 1;  // we successfully set up the test
+            }
+        }
+
+        if (_setUp) {
+            result = tests[index]();
+        }
+
+        if (_setUp && NULL != tearDown) {
+            int _tearDown = tearDown();
+
+            if ((! TEST_OK == _tearDown) && TEST_OK == result) {
+                result = _tearDown;
+            }
+        }
+
+        switch (result) {
+            case TEST_FAILED: failures++; break;
+            case TEST_ERROR:  errors++; break;
+        }
+
+        putchar(results[result]);
+
+        if (79 == index%80) {
+            putchar('\n');
+        }
+
+        fflush(stdout);
+    }
+    puts("\n");
+
+    printf("running %lu tests: %lu - OK, %lu - FAILED, %lu - ERRORS\n",
+            count,
+            count - errors - failures,
+            failures,
+            errors);
+
+    return failures + errors;
+}
+
+// vim: set et ts=4 sw=4:

tests/runtest.h

@@ -0,0 +1,136 @@
+/**
+ * \file
+ * runtest.h: assertions and other definitions for all my tests
+ *
+ * \author Georg Hopp <georg@steffers.org>
+ *
+ * \copyright
+ * Copyright (C) 2011  Georg Hopp
+ *
+ * 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/>.
+ */
+#ifndef __RUNTEST_h__
+#define __RUNTEST_h__
+
+#include <sys/types.h>
+#include <string.h>
+
+#include "trbase.h"
+
+enum RESULT_TYPES {
+    TEST_OK=0,
+    TEST_FAILED,
+    TEST_ERROR
+};
+
+#define ASSERT_NULL(value) \
+    if (NULL != (value)) { \
+        printf("%s[%d]: Assertion failed that %s is NULL\n", \
+                __FILE__, __LINE__, #value); \
+        return TEST_FAILED; }
+
+#define ASSERT_NOT_NULL(value) \
+    if (NULL == (value)) { \
+        printf("%s[%d]: Assertion failed that %s is NOT NULL\n", \
+                __FILE__, __LINE__, #value); \
+        return TEST_FAILED; }
+
+#define ASSERT_EQUAL(val1,val2) \
+    if ((val1) != (val2)) { \
+        printf("%s[%d]: Assertion failed that %s EQUALS %s\n", \
+                __FILE__, __LINE__, #val1, #val2); \
+        return TEST_FAILED; }
+
+#define ASSERT_NOT_EQUAL(val1,val2) \
+    if ((val1) == (val2)) { \
+        printf("%s[%d]: Assertion failed that %s NOT EQUALS %s\n", \
+                __FILE__, __LINE__, #val1, #val2); \
+        return TEST_FAILED; }
+
+#define ASSERT_MEM_EQUAL(val1,val2,size) \
+    if(0 != memcmp((val1), (val2), (size))) { \
+        printf("%s[%d]: Assertion failed that memory at %s EQUALS %s for %lu bytes\n", \
+                __FILE__, __LINE__, #val1, #val2, size); \
+        return TEST_FAILED; }
+
+#define ASSERT_MEM_NOT_EQUAL(val1,val2,size) \
+    if(0 == memcmp((val1), (val2), (size))) { \
+        printf("%s[%d]: Assertion failed that memory at %s NOT EQUALS %s for %lu bytes\n", \
+                __FILE__, __LINE__, #val1, #val2, size); \
+        return TEST_FAILED; }
+
+#define ASSERT_MEM_NULL(val, size) \
+    if (! isMemNull((val), (size))) { \
+        printf("%s[%d]: Assertion failed that memory at %s is NULL for %lu bytes\n", \
+                __FILE__, __LINE__, #val, size); \
+        return TEST_FAILED; }
+
+#define ASSERT_MEM_NOT_NULL(val, size) \
+    if (isMemNull((val), (size))) { \
+        printf("%s[%d]: Assertion failed that memory at %s is NOT NULL for %lu bytes\n", \
+                __FILE__, __LINE__, #val, size); \
+        return TEST_FAILED; }
+
+#define ASSERT_STRING_EQUAL(val1, val2) \
+    if(0 != strcmp((val1), (val2))) { \
+        printf("%s[%d]: Assertion failed that string %s EQUALS %s\n", \
+                __FILE__, __LINE__, val1, val2); \
+        return TEST_FAILED; }
+
+#define ASSERT_STRING_NOT_EQUAL(val1, val2) \
+    if(0 == strcmp((val1), (val2))) { \
+        printf("%s[%d]: Assertion failed that string %s NOT EQUALS %s\n", \
+                __FILE__, __LINE__, val1, val2); \
+        return TEST_FAILED; }
+
+#define ASSERT_OBJECT(val) \
+    if (! TR_IS_OBJECT((val))) { \
+        printf("%s[%d]: Assertion failed that %s IS an object\n", \
+                __FILE__, __LINE__, #val); \
+        return TEST_FAILED; }
+
+#define ASSERT_OBJECT_NULL(val) \
+    if (! isObjectNull((val))) { \
+        printf("%s[%d]: Assertion failed that %s IS an UNINITIALIZED object\n", \
+                __FILE__, __LINE__, #val); \
+        return TEST_FAILED; }
+
+#define ASSERT_OBJECT_NOT_NULL(val) \
+    if (isObjectNull((val))) { \
+        printf("%s[%d]: Assertion failed that %s IS an INITIALIZED object\n", \
+                __FILE__, __LINE__, #val); \
+        return TEST_FAILED; }
+
+#define ASSERT_INSTANCE_OF(class, val) \
+    if (! TR_INSTANCE_OF(class, val)) { \
+        printf("%s[%d]: Assertion failed that %s is instance of %s\n", \
+                __FILE__, __LINE__, #val, #class); \
+        return TEST_FAILED; }
+
+
+typedef int (* const testfunc)(void);
+#define FUNCS_COUNT(array)  (sizeof((array)) / sizeof(testfunc))
+
+extern const char testname[];
+extern testfunc tests[];
+extern const size_t count;
+
+extern int (* const setUp)();
+extern int (* const tearDown)();
+
+int isMemNull(void * _mem, size_t size);
+int isObjectNull(void * _object);
+
+#endif//__RUNTEST_h__
+// vim: set et ts=4 sw=4:

tests/suppress/external.supp

@@ -0,0 +1,45 @@
+#
+# This is a valgrind suppression file that should be used when using valgrind.
+#
+# See Misc/README.valgrind for more information.
+{
+	GDBM open on non existent file
+	Memcheck:Param
+	write(buf)
+	fun:__write_nocancel
+	fun:_gdbm_full_write
+	fun:gdbm_open
+	fun:storageCtor
+	fun:classNew
+	fun:main
+}
+
+{
+	GDBM close - to be honest I don't know what it complains about.
+	Memcheck:Param
+	msync(start)
+	fun:__msync_nocancel
+	fun:gdbm_close
+	fun:storageDtor
+	fun:classDelete
+	fun:main
+}
+
+{
+	Uninitialized bytes in openldap
+	Memcheck:Param
+	sendmsg(mmsg[0].msg_hdr)
+	fun:sendmmsg
+	fun:__libc_res_nsend
+	fun:__libc_res_nquery
+	fun:__libc_res_nquerydomain
+	fun:__libc_res_nsearch
+	fun:_nss_dns_gethostbyname4_r
+	fun:gaih_inet
+	fun:getaddrinfo
+	fun:ldap_connect_to_host
+	fun:ldap_int_open_connection
+	fun:ldap_new_connection
+	fun:ldap_open_defconn
+}
+

trdata.h

@@ -0,0 +1,93 @@
+/* trdata.h.  Generated from trdata.h.in by configure.  */
+/* trdata.h.in.  Generated from configure.ac by autoheader.  */
+
+/* Define to 1 if you have the <dlfcn.h> header file. */
+#define HAVE_DLFCN_H 1
+
+/* Define to 1 if you have the <inttypes.h> header file. */
+#define HAVE_INTTYPES_H 1
+
+/* Define to 1 if you have the <memory.h> header file. */
+#define HAVE_MEMORY_H 1
+
+/* Define to 1 if you have the `memset' function. */
+#define HAVE_MEMSET 1
+
+/* Define to 1 if you have the <stdarg.h> header file. */
+#define HAVE_STDARG_H 1
+
+/* Define to 1 if stdbool.h conforms to C99. */
+#define HAVE_STDBOOL_H 1
+
+/* Define to 1 if you have the <stdint.h> header file. */
+#define HAVE_STDINT_H 1
+
+/* Define to 1 if you have the <stdio.h> header file. */
+#define HAVE_STDIO_H 1
+
+/* Define to 1 if you have the <stdlib.h> header file. */
+#define HAVE_STDLIB_H 1
+
+/* Define to 1 if you have the <strings.h> header file. */
+#define HAVE_STRINGS_H 1
+
+/* Define to 1 if you have the <string.h> header file. */
+#define HAVE_STRING_H 1
+
+/* Define to 1 if you have the <syslog.h> header file. */
+#define HAVE_SYSLOG_H 1
+
+/* Define to 1 if you have the <sys/stat.h> header file. */
+#define HAVE_SYS_STAT_H 1
+
+/* Define to 1 if you have the <sys/types.h> header file. */
+#define HAVE_SYS_TYPES_H 1
+
+/* Define to 1 if you have the <unistd.h> header file. */
+#define HAVE_UNISTD_H 1
+
+/* Define to 1 if the system has the type `_Bool'. */
+#define HAVE__BOOL 1
+
+/* Define to the sub-directory in which libtool stores uninstalled libraries.
+   */
+#define LT_OBJDIR ".libs/"
+
+/* Name of package */
+#define PACKAGE "libtrhash"
+
+/* Define to the address where bug reports for this package should be sent. */
+#define PACKAGE_BUGREPORT "Georg Hopp <georg@steffers.org>"
+
+/* Define to the full name of this package. */
+#define PACKAGE_NAME "libtrhash"
+
+/* Define to the full name and version of this package. */
+#define PACKAGE_STRING "libtrhash 0.0.0"
+
+/* Define to the one symbol short name of this package. */
+#define PACKAGE_TARNAME "libtrhash"
+
+/* Define to the home page for this package. */
+#define PACKAGE_URL ""
+
+/* Define to the version of this package. */
+#define PACKAGE_VERSION "0.0.0"
+
+/* Define to 1 if you have the ANSI C header files. */
+#define STDC_HEADERS 1
+
+/* Version number of package */
+#define VERSION "0.0.0"
+
+/* Define to `__inline__' or `__inline' if that's what the C compiler
+   calls it, or to nothing if 'inline' is not supported under any name.  */
+#ifndef __cplusplus
+/* #undef inline */
+#endif
+
+/* Define to `int' if <sys/types.h> does not define. */
+/* #undef pid_t */
+
+/* Define to `unsigned int' if <sys/types.h> does not define. */
+/* #undef size_t */

trdata.h.in

@@ -0,0 +1,92 @@
+/* trdata.h.in.  Generated from configure.ac by autoheader.  */
+
+/* Define to 1 if you have the <dlfcn.h> header file. */
+#undef HAVE_DLFCN_H
+
+/* Define to 1 if you have the <inttypes.h> header file. */
+#undef HAVE_INTTYPES_H
+
+/* Define to 1 if you have the <memory.h> header file. */
+#undef HAVE_MEMORY_H
+
+/* Define to 1 if you have the `memset' function. */
+#undef HAVE_MEMSET
+
+/* Define to 1 if you have the <stdarg.h> header file. */
+#undef HAVE_STDARG_H
+
+/* Define to 1 if stdbool.h conforms to C99. */
+#undef HAVE_STDBOOL_H
+
+/* Define to 1 if you have the <stdint.h> header file. */
+#undef HAVE_STDINT_H
+
+/* Define to 1 if you have the <stdio.h> header file. */
+#undef HAVE_STDIO_H
+
+/* Define to 1 if you have the <stdlib.h> header file. */
+#undef HAVE_STDLIB_H
+
+/* Define to 1 if you have the <strings.h> header file. */
+#undef HAVE_STRINGS_H
+
+/* Define to 1 if you have the <string.h> header file. */
+#undef HAVE_STRING_H
+
+/* Define to 1 if you have the <syslog.h> header file. */
+#undef HAVE_SYSLOG_H
+
+/* Define to 1 if you have the <sys/stat.h> header file. */
+#undef HAVE_SYS_STAT_H
+
+/* Define to 1 if you have the <sys/types.h> header file. */
+#undef HAVE_SYS_TYPES_H
+
+/* Define to 1 if you have the <unistd.h> header file. */
+#undef HAVE_UNISTD_H
+
+/* Define to 1 if the system has the type `_Bool'. */
+#undef HAVE__BOOL
+
+/* Define to the sub-directory in which libtool stores uninstalled libraries.
+   */
+#undef LT_OBJDIR
+
+/* Name of package */
+#undef PACKAGE
+
+/* Define to the address where bug reports for this package should be sent. */
+#undef PACKAGE_BUGREPORT
+
+/* Define to the full name of this package. */
+#undef PACKAGE_NAME
+
+/* Define to the full name and version of this package. */
+#undef PACKAGE_STRING
+
+/* Define to the one symbol short name of this package. */
+#undef PACKAGE_TARNAME
+
+/* Define to the home page for this package. */
+#undef PACKAGE_URL
+
+/* Define to the version of this package. */
+#undef PACKAGE_VERSION
+
+/* Define to 1 if you have the ANSI C header files. */
+#undef STDC_HEADERS
+
+/* Version number of package */
+#undef VERSION
+
+/* Define to `__inline__' or `__inline' if that's what the C compiler
+   calls it, or to nothing if 'inline' is not supported under any name.  */
+#ifndef __cplusplus
+#undef inline
+#endif
+
+/* Define to `int' if <sys/types.h> does not define. */
+#undef pid_t
+
+/* Define to `unsigned int' if <sys/types.h> does not define. */
+#undef size_t