- Add LibLog 1.1.x support.

- ND_Handler_Open_Default() implemented.

COPYING

@@ -0,0 +1 @@
+GNU_GPL-3.0.txt

COPYING.LESSER

@@ -0,0 +1 @@
+GNU_LGPL-3.0.txt

GNU_FDL-1.3.txt

@@ -0,0 +1,451 @@
+
+                GNU Free Documentation License
+                 Version 1.3, 3 November 2008
+
+
+ Copyright (C) 2000, 2001, 2002, 2007, 2008 Free Software Foundation, Inc.
+     <https://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+0. PREAMBLE
+
+The purpose of this License is to make a manual, textbook, or other
+functional and useful document "free" in the sense of freedom: to
+assure everyone the effective freedom to copy and redistribute it,
+with or without modifying it, either commercially or noncommercially.
+Secondarily, this License preserves for the author and publisher a way
+to get credit for their work, while not being considered responsible
+for modifications made by others.
+
+This License is a kind of "copyleft", which means that derivative
+works of the document must themselves be free in the same sense.  It
+complements the GNU General Public License, which is a copyleft
+license designed for free software.
+
+We have designed this License in order to use it for manuals for free
+software, because free software needs free documentation: a free
+program should come with manuals providing the same freedoms that the
+software does.  But this License is not limited to software manuals;
+it can be used for any textual work, regardless of subject matter or
+whether it is published as a printed book.  We recommend this License
+principally for works whose purpose is instruction or reference.
+
+
+1. APPLICABILITY AND DEFINITIONS
+
+This License applies to any manual or other work, in any medium, that
+contains a notice placed by the copyright holder saying it can be
+distributed under the terms of this License.  Such a notice grants a
+world-wide, royalty-free license, unlimited in duration, to use that
+work under the conditions stated herein.  The "Document", below,
+refers to any such manual or work.  Any member of the public is a
+licensee, and is addressed as "you".  You accept the license if you
+copy, modify or distribute the work in a way requiring permission
+under copyright law.
+
+A "Modified Version" of the Document means any work containing the
+Document or a portion of it, either copied verbatim, or with
+modifications and/or translated into another language.
+
+A "Secondary Section" is a named appendix or a front-matter section of
+the Document that deals exclusively with the relationship of the
+publishers or authors of the Document to the Document's overall
+subject (or to related matters) and contains nothing that could fall
+directly within that overall subject.  (Thus, if the Document is in
+part a textbook of mathematics, a Secondary Section may not explain
+any mathematics.)  The relationship could be a matter of historical
+connection with the subject or with related matters, or of legal,
+commercial, philosophical, ethical or political position regarding
+them.
+
+The "Invariant Sections" are certain Secondary Sections whose titles
+are designated, as being those of Invariant Sections, in the notice
+that says that the Document is released under this License.  If a
+section does not fit the above definition of Secondary then it is not
+allowed to be designated as Invariant.  The Document may contain zero
+Invariant Sections.  If the Document does not identify any Invariant
+Sections then there are none.
+
+The "Cover Texts" are certain short passages of text that are listed,
+as Front-Cover Texts or Back-Cover Texts, in the notice that says that
+the Document is released under this License.  A Front-Cover Text may
+be at most 5 words, and a Back-Cover Text may be at most 25 words.
+
+A "Transparent" copy of the Document means a machine-readable copy,
+represented in a format whose specification is available to the
+general public, that is suitable for revising the document
+straightforwardly with generic text editors or (for images composed of
+pixels) generic paint programs or (for drawings) some widely available
+drawing editor, and that is suitable for input to text formatters or
+for automatic translation to a variety of formats suitable for input
+to text formatters.  A copy made in an otherwise Transparent file
+format whose markup, or absence of markup, has been arranged to thwart
+or discourage subsequent modification by readers is not Transparent.
+An image format is not Transparent if used for any substantial amount
+of text.  A copy that is not "Transparent" is called "Opaque".
+
+Examples of suitable formats for Transparent copies include plain
+ASCII without markup, Texinfo input format, LaTeX input format, SGML
+or XML using a publicly available DTD, and standard-conforming simple
+HTML, PostScript or PDF designed for human modification.  Examples of
+transparent image formats include PNG, XCF and JPG.  Opaque formats
+include proprietary formats that can be read and edited only by
+proprietary word processors, SGML or XML for which the DTD and/or
+processing tools are not generally available, and the
+machine-generated HTML, PostScript or PDF produced by some word
+processors for output purposes only.
+
+The "Title Page" means, for a printed book, the title page itself,
+plus such following pages as are needed to hold, legibly, the material
+this License requires to appear in the title page.  For works in
+formats which do not have any title page as such, "Title Page" means
+the text near the most prominent appearance of the work's title,
+preceding the beginning of the body of the text.
+
+The "publisher" means any person or entity that distributes copies of
+the Document to the public.
+
+A section "Entitled XYZ" means a named subunit of the Document whose
+title either is precisely XYZ or contains XYZ in parentheses following
+text that translates XYZ in another language.  (Here XYZ stands for a
+specific section name mentioned below, such as "Acknowledgements",
+"Dedications", "Endorsements", or "History".)  To "Preserve the Title"
+of such a section when you modify the Document means that it remains a
+section "Entitled XYZ" according to this definition.
+
+The Document may include Warranty Disclaimers next to the notice which
+states that this License applies to the Document.  These Warranty
+Disclaimers are considered to be included by reference in this
+License, but only as regards disclaiming warranties: any other
+implication that these Warranty Disclaimers may have is void and has
+no effect on the meaning of this License.
+
+2. VERBATIM COPYING
+
+You may copy and distribute the Document in any medium, either
+commercially or noncommercially, provided that this License, the
+copyright notices, and the license notice saying this License applies
+to the Document are reproduced in all copies, and that you add no
+other conditions whatsoever to those of this License.  You may not use
+technical measures to obstruct or control the reading or further
+copying of the copies you make or distribute.  However, you may accept
+compensation in exchange for copies.  If you distribute a large enough
+number of copies you must also follow the conditions in section 3.
+
+You may also lend copies, under the same conditions stated above, and
+you may publicly display copies.
+
+
+3. COPYING IN QUANTITY
+
+If you publish printed copies (or copies in media that commonly have
+printed covers) of the Document, numbering more than 100, and the
+Document's license notice requires Cover Texts, you must enclose the
+copies in covers that carry, clearly and legibly, all these Cover
+Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
+the back cover.  Both covers must also clearly and legibly identify
+you as the publisher of these copies.  The front cover must present
+the full title with all words of the title equally prominent and
+visible.  You may add other material on the covers in addition.
+Copying with changes limited to the covers, as long as they preserve
+the title of the Document and satisfy these conditions, can be treated
+as verbatim copying in other respects.
+
+If the required texts for either cover are too voluminous to fit
+legibly, you should put the first ones listed (as many as fit
+reasonably) on the actual cover, and continue the rest onto adjacent
+pages.
+
+If you publish or distribute Opaque copies of the Document numbering
+more than 100, you must either include a machine-readable Transparent
+copy along with each Opaque copy, or state in or with each Opaque copy
+a computer-network location from which the general network-using
+public has access to download using public-standard network protocols
+a complete Transparent copy of the Document, free of added material.
+If you use the latter option, you must take reasonably prudent steps,
+when you begin distribution of Opaque copies in quantity, to ensure
+that this Transparent copy will remain thus accessible at the stated
+location until at least one year after the last time you distribute an
+Opaque copy (directly or through your agents or retailers) of that
+edition to the public.
+
+It is requested, but not required, that you contact the authors of the
+Document well before redistributing any large number of copies, to
+give them a chance to provide you with an updated version of the
+Document.
+
+
+4. MODIFICATIONS
+
+You may copy and distribute a Modified Version of the Document under
+the conditions of sections 2 and 3 above, provided that you release
+the Modified Version under precisely this License, with the Modified
+Version filling the role of the Document, thus licensing distribution
+and modification of the Modified Version to whoever possesses a copy
+of it.  In addition, you must do these things in the Modified Version:
+
+A. Use in the Title Page (and on the covers, if any) a title distinct
+   from that of the Document, and from those of previous versions
+   (which should, if there were any, be listed in the History section
+   of the Document).  You may use the same title as a previous version
+   if the original publisher of that version gives permission.
+B. List on the Title Page, as authors, one or more persons or entities
+   responsible for authorship of the modifications in the Modified
+   Version, together with at least five of the principal authors of the
+   Document (all of its principal authors, if it has fewer than five),
+   unless they release you from this requirement.
+C. State on the Title page the name of the publisher of the
+   Modified Version, as the publisher.
+D. Preserve all the copyright notices of the Document.
+E. Add an appropriate copyright notice for your modifications
+   adjacent to the other copyright notices.
+F. Include, immediately after the copyright notices, a license notice
+   giving the public permission to use the Modified Version under the
+   terms of this License, in the form shown in the Addendum below.
+G. Preserve in that license notice the full lists of Invariant Sections
+   and required Cover Texts given in the Document's license notice.
+H. Include an unaltered copy of this License.
+I. Preserve the section Entitled "History", Preserve its Title, and add
+   to it an item stating at least the title, year, new authors, and
+   publisher of the Modified Version as given on the Title Page.  If
+   there is no section Entitled "History" in the Document, create one
+   stating the title, year, authors, and publisher of the Document as
+   given on its Title Page, then add an item describing the Modified
+   Version as stated in the previous sentence.
+J. Preserve the network location, if any, given in the Document for
+   public access to a Transparent copy of the Document, and likewise
+   the network locations given in the Document for previous versions
+   it was based on.  These may be placed in the "History" section.
+   You may omit a network location for a work that was published at
+   least four years before the Document itself, or if the original
+   publisher of the version it refers to gives permission.
+K. For any section Entitled "Acknowledgements" or "Dedications",
+   Preserve the Title of the section, and preserve in the section all
+   the substance and tone of each of the contributor acknowledgements
+   and/or dedications given therein.
+L. Preserve all the Invariant Sections of the Document,
+   unaltered in their text and in their titles.  Section numbers
+   or the equivalent are not considered part of the section titles.
+M. Delete any section Entitled "Endorsements".  Such a section
+   may not be included in the Modified Version.
+N. Do not retitle any existing section to be Entitled "Endorsements"
+   or to conflict in title with any Invariant Section.
+O. Preserve any Warranty Disclaimers.
+
+If the Modified Version includes new front-matter sections or
+appendices that qualify as Secondary Sections and contain no material
+copied from the Document, you may at your option designate some or all
+of these sections as invariant.  To do this, add their titles to the
+list of Invariant Sections in the Modified Version's license notice.
+These titles must be distinct from any other section titles.
+
+You may add a section Entitled "Endorsements", provided it contains
+nothing but endorsements of your Modified Version by various
+parties--for example, statements of peer review or that the text has
+been approved by an organization as the authoritative definition of a
+standard.
+
+You may add a passage of up to five words as a Front-Cover Text, and a
+passage of up to 25 words as a Back-Cover Text, to the end of the list
+of Cover Texts in the Modified Version.  Only one passage of
+Front-Cover Text and one of Back-Cover Text may be added by (or
+through arrangements made by) any one entity.  If the Document already
+includes a cover text for the same cover, previously added by you or
+by arrangement made by the same entity you are acting on behalf of,
+you may not add another; but you may replace the old one, on explicit
+permission from the previous publisher that added the old one.
+
+The author(s) and publisher(s) of the Document do not by this License
+give permission to use their names for publicity for or to assert or
+imply endorsement of any Modified Version.
+
+
+5. COMBINING DOCUMENTS
+
+You may combine the Document with other documents released under this
+License, under the terms defined in section 4 above for modified
+versions, provided that you include in the combination all of the
+Invariant Sections of all of the original documents, unmodified, and
+list them all as Invariant Sections of your combined work in its
+license notice, and that you preserve all their Warranty Disclaimers.
+
+The combined work need only contain one copy of this License, and
+multiple identical Invariant Sections may be replaced with a single
+copy.  If there are multiple Invariant Sections with the same name but
+different contents, make the title of each such section unique by
+adding at the end of it, in parentheses, the name of the original
+author or publisher of that section if known, or else a unique number.
+Make the same adjustment to the section titles in the list of
+Invariant Sections in the license notice of the combined work.
+
+In the combination, you must combine any sections Entitled "History"
+in the various original documents, forming one section Entitled
+"History"; likewise combine any sections Entitled "Acknowledgements",
+and any sections Entitled "Dedications".  You must delete all sections
+Entitled "Endorsements".
+
+
+6. COLLECTIONS OF DOCUMENTS
+
+You may make a collection consisting of the Document and other
+documents released under this License, and replace the individual
+copies of this License in the various documents with a single copy
+that is included in the collection, provided that you follow the rules
+of this License for verbatim copying of each of the documents in all
+other respects.
+
+You may extract a single document from such a collection, and
+distribute it individually under this License, provided you insert a
+copy of this License into the extracted document, and follow this
+License in all other respects regarding verbatim copying of that
+document.
+
+
+7. AGGREGATION WITH INDEPENDENT WORKS
+
+A compilation of the Document or its derivatives with other separate
+and independent documents or works, in or on a volume of a storage or
+distribution medium, is called an "aggregate" if the copyright
+resulting from the compilation is not used to limit the legal rights
+of the compilation's users beyond what the individual works permit.
+When the Document is included in an aggregate, this License does not
+apply to the other works in the aggregate which are not themselves
+derivative works of the Document.
+
+If the Cover Text requirement of section 3 is applicable to these
+copies of the Document, then if the Document is less than one half of
+the entire aggregate, the Document's Cover Texts may be placed on
+covers that bracket the Document within the aggregate, or the
+electronic equivalent of covers if the Document is in electronic form.
+Otherwise they must appear on printed covers that bracket the whole
+aggregate.
+
+
+8. TRANSLATION
+
+Translation is considered a kind of modification, so you may
+distribute translations of the Document under the terms of section 4.
+Replacing Invariant Sections with translations requires special
+permission from their copyright holders, but you may include
+translations of some or all Invariant Sections in addition to the
+original versions of these Invariant Sections.  You may include a
+translation of this License, and all the license notices in the
+Document, and any Warranty Disclaimers, provided that you also include
+the original English version of this License and the original versions
+of those notices and disclaimers.  In case of a disagreement between
+the translation and the original version of this License or a notice
+or disclaimer, the original version will prevail.
+
+If a section in the Document is Entitled "Acknowledgements",
+"Dedications", or "History", the requirement (section 4) to Preserve
+its Title (section 1) will typically require changing the actual
+title.
+
+
+9. TERMINATION
+
+You may not copy, modify, sublicense, or distribute the Document
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense, or distribute it is void, and
+will automatically terminate your rights under this License.
+
+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, receipt of a copy of some or all of the same material does
+not give you any rights to use it.
+
+
+10. FUTURE REVISIONS OF THIS LICENSE
+
+The Free Software Foundation may publish new, revised versions of the
+GNU Free Documentation 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.  See
+https://www.gnu.org/licenses/.
+
+Each version of the License is given a distinguishing version number.
+If the Document specifies that a particular numbered version of this
+License "or any later version" applies to it, you have the option of
+following the terms and conditions either of that specified version or
+of any later version that has been published (not as a draft) by the
+Free Software Foundation.  If the Document does not specify a version
+number of this License, you may choose any version ever published (not
+as a draft) by the Free Software Foundation.  If the Document
+specifies that a proxy can decide which future versions of this
+License can be used, that proxy's public statement of acceptance of a
+version permanently authorizes you to choose that version for the
+Document.
+
+11. RELICENSING
+
+"Massive Multiauthor Collaboration Site" (or "MMC Site") means any
+World Wide Web server that publishes copyrightable works and also
+provides prominent facilities for anybody to edit those works.  A
+public wiki that anybody can edit is an example of such a server.  A
+"Massive Multiauthor Collaboration" (or "MMC") contained in the site
+means any set of copyrightable works thus published on the MMC site.
+
+"CC-BY-SA" means the Creative Commons Attribution-Share Alike 3.0
+license published by Creative Commons Corporation, a not-for-profit
+corporation with a principal place of business in San Francisco,
+California, as well as future copyleft versions of that license
+published by that same organization.
+
+"Incorporate" means to publish or republish a Document, in whole or in
+part, as part of another Document.
+
+An MMC is "eligible for relicensing" if it is licensed under this
+License, and if all works that were first published under this License
+somewhere other than this MMC, and subsequently incorporated in whole or
+in part into the MMC, (1) had no cover texts or invariant sections, and
+(2) were thus incorporated prior to November 1, 2008.
+
+The operator of an MMC Site may republish an MMC contained in the site
+under CC-BY-SA on the same site at any time before August 1, 2009,
+provided the MMC is eligible for relicensing.
+
+
+ADDENDUM: How to use this License for your documents
+
+To use this License in a document you have written, include a copy of
+the License in the document and put the following copyright and
+license notices just after the title page:
+
+    Copyright (c)  YEAR  YOUR NAME.
+    Permission is granted to copy, distribute and/or modify this document
+    under the terms of the GNU Free Documentation License, Version 1.3
+    or any later version published by the Free Software Foundation;
+    with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts.
+    A copy of the license is included in the section entitled "GNU
+    Free Documentation License".
+
+If you have Invariant Sections, Front-Cover Texts and Back-Cover Texts,
+replace the "with...Texts." line with this:
+
+    with the Invariant Sections being LIST THEIR TITLES, with the
+    Front-Cover Texts being LIST, and with the Back-Cover Texts being LIST.
+
+If you have Invariant Sections without Cover Texts, or some other
+combination of the three, merge those two alternatives to suit the
+situation.
+
+If your document contains nontrivial examples of program code, we
+recommend releasing these examples in parallel under your choice of
+free software license, such as the GNU General Public License,
+to permit their use in free software.

GNU_GPL-3.0.txt

@@ -0,0 +1,674 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://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 <https://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
+<https://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
+<https://www.gnu.org/licenses/why-not-lgpl.html>.

GNU_LGPL-3.0.txt

@@ -0,0 +1,165 @@
+                   GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+
+  This version of the GNU Lesser General Public License incorporates
+the terms and conditions of version 3 of the GNU General Public
+License, supplemented by the additional permissions listed below.
+
+  0. Additional Definitions.
+
+  As used herein, "this License" refers to version 3 of the GNU Lesser
+General Public License, and the "GNU GPL" refers to version 3 of the GNU
+General Public License.
+
+  "The Library" refers to a covered work governed by this License,
+other than an Application or a Combined Work as defined below.
+
+  An "Application" is any work that makes use of an interface provided
+by the Library, but which is not otherwise based on the Library.
+Defining a subclass of a class defined by the Library is deemed a mode
+of using an interface provided by the Library.
+
+  A "Combined Work" is a work produced by combining or linking an
+Application with the Library.  The particular version of the Library
+with which the Combined Work was made is also called the "Linked
+Version".
+
+  The "Minimal Corresponding Source" for a Combined Work means the
+Corresponding Source for the Combined Work, excluding any source code
+for portions of the Combined Work that, considered in isolation, are
+based on the Application, and not on the Linked Version.
+
+  The "Corresponding Application Code" for a Combined Work means the
+object code and/or source code for the Application, including any data
+and utility programs needed for reproducing the Combined Work from the
+Application, but excluding the System Libraries of the Combined Work.
+
+  1. Exception to Section 3 of the GNU GPL.
+
+  You may convey a covered work under sections 3 and 4 of this License
+without being bound by section 3 of the GNU GPL.
+
+  2. Conveying Modified Versions.
+
+  If you modify a copy of the Library, and, in your modifications, a
+facility refers to a function or data to be supplied by an Application
+that uses the facility (other than as an argument passed when the
+facility is invoked), then you may convey a copy of the modified
+version:
+
+   a) under this License, provided that you make a good faith effort to
+   ensure that, in the event an Application does not supply the
+   function or data, the facility still operates, and performs
+   whatever part of its purpose remains meaningful, or
+
+   b) under the GNU GPL, with none of the additional permissions of
+   this License applicable to that copy.
+
+  3. Object Code Incorporating Material from Library Header Files.
+
+  The object code form of an Application may incorporate material from
+a header file that is part of the Library.  You may convey such object
+code under terms of your choice, provided that, if the incorporated
+material is not limited to numerical parameters, data structure
+layouts and accessors, or small macros, inline functions and templates
+(ten or fewer lines in length), you do both of the following:
+
+   a) Give prominent notice with each copy of the object code that the
+   Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the object code with a copy of the GNU GPL and this license
+   document.
+
+  4. Combined Works.
+
+  You may convey a Combined Work under terms of your choice that,
+taken together, effectively do not restrict modification of the
+portions of the Library contained in the Combined Work and reverse
+engineering for debugging such modifications, if you also do each of
+the following:
+
+   a) Give prominent notice with each copy of the Combined Work that
+   the Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the Combined Work with a copy of the GNU GPL and this license
+   document.
+
+   c) For a Combined Work that displays copyright notices during
+   execution, include the copyright notice for the Library among
+   these notices, as well as a reference directing the user to the
+   copies of the GNU GPL and this license document.
+
+   d) Do one of the following:
+
+       0) Convey the Minimal Corresponding Source under the terms of this
+       License, and the Corresponding Application Code in a form
+       suitable for, and under terms that permit, the user to
+       recombine or relink the Application with a modified version of
+       the Linked Version to produce a modified Combined Work, in the
+       manner specified by section 6 of the GNU GPL for conveying
+       Corresponding Source.
+
+       1) Use a suitable shared library mechanism for linking with the
+       Library.  A suitable mechanism is one that (a) uses at run time
+       a copy of the Library already present on the user's computer
+       system, and (b) will operate properly with a modified version
+       of the Library that is interface-compatible with the Linked
+       Version.
+
+   e) Provide Installation Information, but only if you would otherwise
+   be required to provide such information under section 6 of the
+   GNU GPL, and only to the extent that such information is
+   necessary to install and execute a modified version of the
+   Combined Work produced by recombining or relinking the
+   Application with a modified version of the Linked Version. (If
+   you use option 4d0, the Installation Information must accompany
+   the Minimal Corresponding Source and Corresponding Application
+   Code. If you use option 4d1, you must provide the Installation
+   Information in the manner specified by section 6 of the GNU GPL
+   for conveying Corresponding Source.)
+
+  5. Combined Libraries.
+
+  You may place library facilities that are a work based on the
+Library side by side in a single library together with other library
+facilities that are not Applications and are not covered by this
+License, and convey such a combined library under terms of your
+choice, if you do both of the following:
+
+   a) Accompany the combined library with a copy of the same work based
+   on the Library, uncombined with any other library facilities,
+   conveyed under the terms of this License.
+
+   b) Give prominent notice with the combined library that part of it
+   is a work based on the Library, and explaining where to find the
+   accompanying uncombined form of the same work.
+
+  6. Revised Versions of the GNU Lesser General Public License.
+
+  The Free Software Foundation may publish revised and/or new versions
+of the GNU Lesser General Public License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.
+
+  Each version is given a distinguishing version number. If the
+Library as you received it specifies that a certain numbered version
+of the GNU Lesser General Public License "or any later version"
+applies to it, you have the option of following the terms and
+conditions either of that published version or of any later version
+published by the Free Software Foundation. If the Library as you
+received it does not specify a version number of the GNU Lesser
+General Public License, you may choose any version of the GNU Lesser
+General Public License ever published by the Free Software Foundation.
+
+  If the Library as you received it specifies that a proxy can decide
+whether future versions of the GNU Lesser General Public License shall
+apply, that proxy's public statement of acceptance of any version is
+permanent authorization for you to choose that version for the
+Library.

Makefile

@@ -0,0 +1,19 @@
+#------------------------------------------------------------------------------
+# Main Makefile
+#------------------------------------------------------------------------------
+
+
+
+SUBDIRS := include lib util demo doc
+
+FILE_DOC := *.txt
+
+
+
+include Makefile.var
+include Makefile.rule
+
+
+
+dir_clean:
+	$(RM) $(PROG_VERSION_NAME).src.*

Makefile.rule

@@ -0,0 +1,353 @@
+#------------------------------------------------------------------------------
+# Rule Makefile
+#------------------------------------------------------------------------------
+
+
+
+# -----------------   DEFAULT RULES  ---------------------
+default:all
+
+
+
+# -----------------   IMPLICITES RULES  --------------------- 
+
+# Here are all the rules allowing to compile sources files
+# c -> o
+%.o:%.c
+	$(CC) $(CFLAGS) $(INCLUDE) -fPIC -c $< -o $@
+
+# c -> executable
+.c :
+	$(CC) $(CFLAGS) $(INCLUDE) $< -o $@ -I . $(LIB)
+
+# o -> executable 
+%:%.o
+	$(CC) $(LFLAGS) -o $@ $? $(LIB)
+
+# .o -> .so
+%.so:%.o
+	$(CC) $(LDSOFLAGS) -shared -o $@ $? $(LIB)
+
+%.a:%.o
+	$(AR) -r $@ $?
+
+$(OBJECTS) : $(SRC)
+
+
+
+# "depend" rule allow to build the dependancy file
+depend:
+
+
+
+# "all" Rule
+all: dir_all
+ifneq ($(SUBDIRS),)
+	for d in $(SUBDIRS) ; do $(MAKE) all -C $$d/ ; done
+endif
+
+dir_all: $(TARGETS)
+
+
+
+# "clean" Rule
+clean: dir_clean
+ifneq ($(SUBDIRS),)
+	for d in $(SUBDIRS) ; do $(MAKE) clean -C $$d/ ; done
+endif
+
+dir_clean:
+	@(command="$(RM) $(TARGETS) $$(echo $(SRC) | sed "s/\.c/\.o/g") ;" ; \
+	echo $$command ; \
+	eval $$command ;)
+
+
+
+# "pre_install" Rule
+# This empty rule can be overiden in module Makefile in order to run pre-install commands.
+pre_install:
+
+
+
+# "post_install" Rule
+# This empty rule can be overiden in module Makefile in order to run post-install commands.
+post_install:
+
+
+
+# "install" Rule
+install: dir_install
+ifneq ($(SUBDIRS),)
+	for d in $(SUBDIRS) ; do $(MAKE) install -C $$d/ ; done
+endif
+
+dir_install: dir_all
+	$(MAKE) pre_install
+ifneq ($(FILE_BIN),)
+	@if test ! -d $(PATH_BIN) ; then $(MKDIR) $(PATH_BIN) ; fi
+	$(INSTALLBIN) $(FILE_BIN) $(PATH_BIN)
+endif
+ifneq ($(FILE_BINSUID),)
+	@if test ! -d $(PATH_BINSUID) ; then $(MKDIR) $(PATH_BINSUID) ; fi
+	$(INSTALLBINSUID) $(FILE_BINSUID) $(PATH_BINSUID)
+endif
+ifneq ($(FILE_CGI),)
+	@if test ! -d $(PATH_CGI) ; then $(MKDIR) $(PATH_CGI) ; fi
+	$(INSTALLCGI) $(FILE_CGI) $(PATH_CGI)
+endif
+ifneq ($(FILE_DOC),)
+	@if test ! -d $(PATH_DOC) ; then $(MKDIR) $(PATH_DOC) ; fi
+	$(INSTALLDOC) $(FILE_DOC) $(PATH_DOC)
+endif
+ifneq ($(FILE_ETC),)
+	@if test ! -d $(PATH_ETC) ; then $(MKDIR) $(PATH_ETC) ; fi
+	$(INSTALLETC) $(FILE_ETC) $(PATH_ETC)
+endif
+ifneq ($(FILE_HOME),)
+	@if test ! -d $(PATH_HOME) ; then $(MKDIR) $(PATH_HOME) ; fi
+	$(INSTALLHOME) $(FILE_HOME) $(PATH_HOME)
+endif
+ifneq ($(FILE_HOMEBIN),)
+	@if test ! -d $(PATH_HOMEBIN) ; then $(MKDIR) $(PATH_HOMEBIN) ; fi
+	$(INSTALLHOMEBIN) $(FILE_HOMEBIN) $(PATH_HOMEBIN)
+endif
+ifneq ($(FILE_LIB),)
+	@if test ! -d $(PATH_LIB) ; then $(MKDIR) $(PATH_LIB) ; fi
+	$(INSTALLLIB) $(FILE_LIB) $(PATH_LIB)
+endif
+ifneq ($(FILE_HOMELIB),)
+	@if test ! -d $(PATH_HOMELIB) ; then $(MKDIR) $(PATH_HOMELIB) ; fi
+	$(INSTALLHOMELIB) $(FILE_HOMELIB) $(PATH_HOMELIB)
+endif
+ifneq ($(FILE_INCLUDE),)
+	@if test ! -d $(PATH_INCLUDE) ; then $(MKDIR) $(PATH_INCLUDE) ; fi
+	$(INSTALLINCLUDE) $(FILE_INCLUDE) $(PATH_INCLUDE)
+endif
+ifneq ($(FILE_MAN),)
+	@for d in $(FILE_MAN) ; do \
+		if test ! -d $(PATH_MAN)/$(FILE_MAN) ; then \
+			$(MKDIR) $(PATH_MAN)/$(FILE_MAN) ; \
+		fi ; \
+		$(INSTALLMAN) $(FILE_MAN)/* $(PATH_MAN)/$(FILE_MAN) ; \
+	done
+endif
+ifneq ($(FILE_WEBCONF),)
+	@if test ! -d $(PATH_WEBCONF) ; then $(MKDIR) $(PATH_WEBCONF) ; fi
+	$(INSTALLWEBCONF) $(FILE_WEBCONF) $(PATH_WEBCONF)
+endif
+ifneq ($(FILE_WEBCONFSSL),)
+	@if test ! -d $(PATH_WEBCONFSSL) ; then $(MKDIR) $(PATH_WEBCONFSSL) ; fi
+	$(INSTALLWEBCONFSSL) $(FILE_WEBCONFSSL) $(PATH_WEBCONFSSL)
+endif
+ifneq ($(FILE_HTML),)
+	@if test ! -d $(PATH_HTML) ; then $(MKDIR) $(PATH_HTML) ; fi
+	$(INSTALLHTML) $(FILE_HTML) $(PATH_HTML)
+endif
+ifneq ($(FILE_WEBICONS),)
+	@if test ! -d $(PATH_WEBICONS) ; then $(MKDIR) $(PATH_WEBICONS) ; fi
+	$(INSTALLWEBICONS) $(FILE_WEBICONS) $(PATH_WEBICONS)
+endif
+	$(MAKE) post_install
+
+
+
+# "pre_uninstall" Rule
+# This empty rule can be overiden in module Makefile in order to run pre-uninstall commands.
+
+pre_uninstall:
+
+
+
+# "post_uninstall" Rule
+# This empty rule can be overiden in module Makefile in order to run post-uninstall commands.
+post_uninstall:
+
+
+
+# "uninstall" Rule
+uninstall: dir_uninstall
+ifneq ($(SUBDIRS),)
+	for d in $(SUBDIRS) ; do $(MAKE) uninstall -C $$d/ ; done
+endif
+
+dir_uninstall:
+	$(MAKE) pre_uninstall
+ifneq ($(FILE_BIN),)
+	@(if test -d $(PATH_BIN) ; then \
+		$(CD) $(PATH_BIN) ; \
+		(echo $(MAKEFLAGS) | grep s) > /dev/null ; \
+                if [ $$? -ne 0 ] ; then \
+			echo "$(CD) $(PATH_BIN)" ; \
+			echo "$(RM) $(FILE_BIN)" ; \
+                fi ; \
+		$(RM) $(FILE_BIN) ; \
+	fi)
+endif
+ifneq ($(FILE_BINSUID),)
+	@(if test -d $(PATH_BINSUID) ; then \
+		$(CD) $(PATH_BINSUID) ; \
+		(echo $(MAKEFLAGS) | grep s) > /dev/null ; \
+		if [ $$? -ne 0 ] ; then \
+			echo "$(CD) $(PATH_BINSUID)" ; \
+			echo "$(RM) $(FILE_BINSUID)" ; \
+		fi ; \
+		$(RM) $(FILE_BINSUID) ; \
+	fi)
+endif
+ifneq ($(FILE_CGI),)
+	@(if test -d $(PATH_CGI) ; then \
+		$(CD) $(PATH_CGI) ; \
+		(echo $(MAKEFLAGS) | grep s) > /dev/null ; \
+                if [ $$? -ne 0 ] ; then \
+			echo "$(CD) $(PATH_CGI)" ; \
+			echo "$(RM) $(FILE_CGI)" ; \
+                fi ; \
+		$(RM) $(FILE_CGI) ; \
+	fi)
+endif
+ifneq ($(FILE_DOC),)
+	@(if test -d $(PATH_DOC) ; then \
+		$(CD) $(PATH_DOC) ; \
+		(echo $(MAKEFLAGS) | grep s) > /dev/null ; \
+                if [ $$? -ne 0 ] ; then \
+			echo "$(CD) $(PATH_DOC)" ; \
+			echo "$(RM) $(FILE_DOC)" ; \
+                fi ; \
+		$(RM) $(FILE_DOC) ; \
+	fi)
+endif
+ifneq ($(FILE_ETC),)
+	@(if test -d $(PATH_ETC) ; then \
+		$(CD) $(PATH_ETC) ; \
+		(echo $(MAKEFLAGS) | grep s) > /dev/null ; \
+                if [ $$? -ne 0 ] ; then \
+			echo "$(CD) $(PATH_ETC)" ; \
+			echo "$(RM) $(FILE_ETC)" ; \
+                fi ; \
+		$(RM) $(FILE_ETC) ; \
+	fi)
+endif
+ifneq ($(FILE_HOME),)
+	@(if test -d $(PATH_HOME) ; then \
+		$(CD) $(PATH_HOME) ; \
+		(echo $(MAKEFLAGS) | grep s) > /dev/null ; \
+                if [ $$? -ne 0 ] ; then \
+			echo "$(CD) $(PATH_HOME)" ; \
+			echo "$(RM) $(FILE_HOME)" ; \
+                fi ; \
+		$(RM) $(FILE_HOME) ; \
+	fi)
+endif
+ifneq ($(FILE_HOMEBIN),)
+	@(if test -d $(PATH_HOMEBIN) ; then \
+		$(CD) $(PATH_HOMEBIN) ; \
+		(echo $(MAKEFLAGS) | grep s) > /dev/null ; \
+                if [ $$? -ne 0 ] ; then \
+			echo "$(CD) $(PATH_HOMEBIN)" ; \
+			echo "$(RM) $(FILE_HOMEBIN)" ; \
+                fi ; \
+		$(RM) $(FILE_HOMEBIN) ; \
+	fi)
+endif
+ifneq ($(FILE_LIB),)
+	@(if test -d $(PATH_LIB) ; then \
+		$(CD) $(PATH_LIB) ; \
+		(echo $(MAKEFLAGS) | grep s) > /dev/null ; \
+                if [ $$? -ne 0 ] ; then \
+			echo "$(CD) $(PATH_LIB)" ; \
+			echo "$(RM) $(FILE_LIB)" ; \
+                fi ; \
+		$(RM) $(FILE_LIB) ; \
+	fi)
+endif
+ifneq ($(FILE_HOMELIB),)
+	@(if test -d $(PATH_HOMELIB) ; then \
+		$(CD) $(PATH_HOMELIB) ; \
+		(echo $(MAKEFLAGS) | grep s) > /dev/null ; \
+                if [ $$? -ne 0 ] ; then \
+			echo "$(CD) $(PATH_HOMELIB)" ; \
+			echo "$(RM) $(FILE_HOMELIB)" ; \
+                fi ; \
+		$(RM) $(FILE_HOMELIB) ; \
+	fi)
+endif
+ifneq ($(FILE_INCLUDE),)
+	@(if test -d $(PATH_INCLUDE) ; then \
+		$(CD) $(PATH_INCLUDE) ; \
+		(echo $(MAKEFLAGS) | grep s) > /dev/null ; \
+                if [ $$? -ne 0 ] ; then \
+			echo "$(CD) $(PATH_INCLUDE)" ; \
+			echo "$(RM) $(FILE_INCLUDE)" ; \
+                fi ; \
+		$(RM) $(FILE_INCLUDE) ; \
+	fi)
+endif
+ifneq ($(FILE_MAN),)
+	@(if test -d $(PATH_MAN) ; then \
+		$(CD) $(PATH_MAN) ; \
+		(echo $(MAKEFLAGS) | grep s) > /dev/null ; \
+                if [ $$? -ne 0 ] ; then \
+			echo "$(CD) $(PATH_MAN)" ; \
+			echo "$(RM) $(FILE_MAN)" ; \
+                fi ; \
+		$(RM) $(FILE_MAN) ; \
+	fi)
+endif
+ifneq ($(FILE_WEBCONF),)
+	@(if test -d $(PATH_WEBCONF) ; then \
+		$(CD) $(PATH_WEBCONF) ; \
+		(echo $(MAKEFLAGS) | grep s) > /dev/null ; \
+                if [ $$? -ne 0 ] ; then \
+			echo "$(CD) $(PATH_WEBCONF)" ; \
+			echo "$(RM) $(FILE_WEBCONF)" ; \
+                fi ; \
+		$(RM) $(FILE_WEBCONF) ; \
+	fi)
+endif
+ifneq ($(FILE_WEBCONFSSL),)
+	@(if test -d $(PATH_WEBCONFSSL) ; then \
+		$(CD) $(PATH_WEBCONFSSL) ; \
+		(echo $(MAKEFLAGS) | grep s) > /dev/null ; \
+                if [ $$? -ne 0 ] ; then \
+			echo "$(CD) $(PATH_WEBCONFSSL)" ; \
+			echo "$(RM) $(FILE_WEBCONFSSL)" ; \
+                fi ; \
+		$(RM) $(FILE_WEBCONFSSL) ; \
+	fi)
+endif
+ifneq ($(FILE_HTML),)
+	@(if test -d $(PATH_HTML) ; then \
+		$(CD) $(PATH_HTML) ; \
+		(echo $(MAKEFLAGS) | grep s) > /dev/null ; \
+                if [ $$? -ne 0 ] ; then \
+			echo "$(CD) $(PATH_HTML)" ; \
+			echo "$(RM) $(FILE_HTML)" ; \
+                fi ; \
+		$(RM) $(FILE_HTML) ; \
+	fi)
+endif
+ifneq ($(FILE_WEBICONS),)
+	@(if test -d $(PATH_WEBICONS) ; then \
+		$(CD) $(PATH_WEBICONS) ; \
+		(echo $(MAKEFLAGS) | grep s) > /dev/null ; \
+                if [ $$? -ne 0 ] ; then \
+			echo "$(CD) $(PATH_WEBICONS)" ; \
+			echo "$(RM) $(FILE_WEBICONS)" ; \
+                fi ; \
+		$(RM) $(FILE_WEBICONS) ; \
+	fi)
+endif
+	$(MAKE) post_uninstall
+
+
+
+# "distrib" Rule
+distrib:
+	$(MAKE) clean 
+	$(MKDIR) $(TMP_DIR)/$(PROG_VERSION_NAME)
+	$(TAR) cf - . | $(TAR) xvpf - -C $(TMP_DIR)/$(PROG_VERSION_NAME)
+	$(TAR) cvf - -C $(TMP_DIR) --exclude CVS $(PROG_VERSION_NAME) | $(GZIP)  -9 >$(PROG_VERSION_NAME).src.tgz
+	$(TAR) cvf - -C $(TMP_DIR) --exclude CVS $(PROG_VERSION_NAME) | $(BZIP2) -9 >$(PROG_VERSION_NAME).src.tbz2
+	$(MV) $(TMP_DIR)/$(PROG_VERSION_NAME) .
+	$(ZIP) -r -m -9 $(PROG_VERSION_NAME).src.zip $(PROG_VERSION_NAME) -x \*/CVS/\*
+	$(RM) -r $(PROG_VERSION_NAME)

Makefile.var

@@ -0,0 +1,94 @@
+#------------------------------------------------------------------------------
+# Variable Makefile
+#------------------------------------------------------------------------------
+
+
+
+PROG_NAME=libnode
+PROG_TAG=$Name:  $
+
+ifeq ($(words $(PROG_TAG)),2)
+	PROG_VERSION_NAME=$(subst _,.,$(word 2, $(PROG_TAG)))
+else
+	PROG_VERSION_NAME=$(PROG_NAME)
+endif
+
+CC=/usr/bin/gcc
+AR=/usr/bin/ar
+
+CD=cd
+MKDIR=/bin/mkdir -p
+RM=/bin/rm -f
+MV=/bin/mv
+TAR=tar
+GZIP=gzip
+BZIP2=bzip2
+ZIP=zip
+
+PATH_WEB=$(addprefix /var/httpd/, $(PROG_NAME))
+
+INSTALLBIN=/usr/bin/install -m 755
+INSTALLBINSUID=/usr/bin/install -m 4755
+INSTALLCGI=/usr/bin/install -m 555
+INSTALLDOC=/usr/bin/install -m 444
+INSTALLETC=/usr/bin/install -m 600
+INSTALLHOME=/usr/bin/install -m 400
+INSTALLHOMEBIN=/usr/bin/install -m 750
+INSTALLLIB=/usr/bin/install -m 755
+INSTALLHOMELIB=/usr/bin/install -m 755
+INSTALLINCLUDE=/usr/bin/install -m 644
+INSTALLMAN=/usr/bin/install -m 644
+INSTALLWEBCONF=/usr/bin/install -m 644
+INSTALLWEBCONFSSL=/usr/bin/install -m 644
+INSTALLHTML=/usr/bin/install -m 444
+INSTALLWEBICONS=/usr/bin/install -m 444
+
+ifeq ($(ROOT),)
+	HOME_DIR := /
+else
+	HOME_DIR := $(ROOT)
+endif
+
+PATH_BIN := $(addprefix $(HOME_DIR),/usr/bin)
+PATH_BINSUID := $(PATH_BIN)
+PATH_CGI := $(addprefix $(HOME_DIR),$(addprefix $(PATH_WEB),/cgi-bin))
+PATH_DOC := $(addprefix $(HOME_DIR),$(addprefix /usr/share/doc/,$(PROG_VERSION_NAME)))
+PATH_ETC := $(addprefix $(HOME_DIR),$(addprefix /etc/,$(MODULE)))
+PATH_HOME := $(addprefix $(HOME_DIR),$(addprefix $(addprefix /var/lib/, $(PROG_NAME)), $(MODULE)))
+PATH_HOMEBIN := $(addprefix $(HOME_DIR), $(addprefix $(addprefix /var/lib/, $(PROG_NAME)), /bin))
+PATH_LIB := $(addprefix $(HOME_DIR),/usr/lib)
+PATH_HOMELIB := $(addprefix $(HOME_DIR), $(addprefix $(addprefix /var/lib/, $(PROG_NAME)), /lib))
+PATH_INCLUDE := $(addprefix $(HOME_DIR),/usr/include)
+PATH_MAN := $(addprefix $(HOME_DIR),/usr/share/man)
+PATH_WEBCONF := $(addprefix $(HOME_DIR),/etc/httpd/conf/vhosts)
+PATH_WEBCONFSSL := $(addprefix $(HOME_DIR),/etc/httpd/conf/ssl)
+PATH_HTML := $(addprefix $(HOME_DIR),$(addprefix $(addprefix $(PATH_WEB),/html/),$(MODULE)))
+PATH_WEBICONS := $(addprefix $(HOME_DIR),$(addprefix $(PATH_WEB),/icons))
+
+PATH_LOG := $(addprefix $(HOME_DIR),/var/log)
+
+TMP_DIR=/tmp
+
+CFLAGS=
+
+ifeq ($(DEBUG), YES)
+        CFLAGS += -g -D_DEBUG
+endif
+ifeq ($(DEBUG), Y)
+        CFLAGS += -g -D_DEBUG
+endif
+
+ifeq ($(OPTIM), YES)
+        CFLAGS += -O3
+endif
+ifeq ($(OPTIM), Y)
+        CFLAGS += -O3
+endif
+
+ifeq ($(LOG_TRACE), YES)
+        CFLAGS += -D_LOG_TRACE
+endif
+
+ifeq ($(LOG_TRACE), Y)
+        CFLAGS += -D_LOG_TRACE
+endif

ReadMe.txt

@@ -1,28 +1,33 @@
-# $RCSfile: ReadMe.txt,v $
+Welcome to LibNode 2.3.x !
-# $Revision: 2.1 $
-# $Name:  $
-# $Date: 2001/11/26 11:15:25 $
-# $Author: agibert $
 
 
 
+This release of LibNode supports the following OS:
+	- Linux 5.15.x, (tested on Mageia 8),
+	- Other OS (Windows, ...).
 
 
-Welcome to LibNode 2.0.x !
 
-This release of LibNode support the following OS:
+The support of LibVer is now optional (To enable it, use: make _LIBVER_SUPPORT=1 all).
-	- Linux 2.2.X and 2.4.x (tested on RedHat & Mandrake),
-	- Solaris 2.6,
-	- Windows NT4 & 2000.
 
-The support of LibVer is now optional.
+LibNode support LibShMem 2.0.0 and LibDataStr 2.0.0 !
-LibShm and LibDataStr are no more supported.
 
-Warning: Associated documentation are outdated...
+
+
+Warning: Associated documentation (including the comments !) is outdated...
 Please read demo and ndbench code.
 
 
 
+LibNode is licensed under the LGPL/GPL GNU Licenses.
+For more information, please read the corresponding source file headers.
+The license details can be found in the GNU-GPL.txt, GNU-LGPL.txt and GNU-FDL.txt files.
+
+
+
 Enjoy it!
 
 Your LibNode Team.
+
+arnaud@rx3.net
+https://git.rx3.org/gitea/rx3/libnode

ReleaseNotes.txt

@@ -1,33 +1,169 @@
-# $RCSfile: ReleaseNotes.txt,v $
+------------------------------------------------------------------------------------------------------------------------------------
-# $Revision: 2.3 $
+LibNode V 3.0.0-1 - A. GIBERT - 2024/05/xx
-# $Name:  $
+------------------------------------------------------------------------------------------------------------------------------------
-# $Date: 2001/11/28 13:57:51 $
+
-# $Author: agibert $
+- All:
+    - Working on new API...
+    - Add DataStruct Handlers,
+    - Update Open_DataStruct() API,
+    - Add LibLog 1.1 support.
 
 
 
 
 
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
-LibNode V 2.0.1-1 - A. Gibert - 28/11/01
+LibNode V 2.3.0-1 - A. GIBERT - 2024/05/20
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
+
+All:		Add LibLog 1.0.x support,
+                Full english translation (No more French!)
+		Convert all the files to UTF8
+                Switch to GPL & LGPL V3
+                Last 2.x release branch, now working on libnode 3!
+LibNode:	Rename misspelled Desallocator to Deallocator (API possible break...)
+                ND_Value_Alloc() argument normalisation: API Break!
+
+
+
+
+------------------------------------------------------------------------------------------------------------------------------------
+LibNode V 2.2.0-1 - A. GIBERT - 2010/06/06
+------------------------------------------------------------------------------------------------------------------------------------
+
+All:		Add support C99 va_arg for curent gcc (4.4.1),
+		Add -fPIC flag in .c to .o makefile rule,
+LibNode:	Add ND_VA_* macros to help manager varargs,
+                Update Managers to use ND_VA_* macros,
+		Improve LibShMem support by restricting OpenStruct tracking on local DataStruct (Manager_Ptr != NULL),
+		Add example manager template in public node.h file,
+NDDemo0:	Add LibNode 2.2 support: Use ND_VA_* macros in manager,
+NDBench:	Add LibNode 2.2 support: Use ND_VA_* macros in manager.
+
+
+
+------------------------------------------------------------------------------------------------------------------------------------
+LibNode V 2.1.0-1 - A. GIBERT - 2005/01/24
+------------------------------------------------------------------------------------------------------------------------------------
+
+All:		This new LibNode branch (2.1.x) should support the forthcoming new LibShMem branch (2.0.x),
+LibNode:	Add symbol lookup support for manager, allocator and desallocator functions call,
+		New Allocator and desallocator API interace,
+		Code cleanup,
+NDBench:	DS_Open now support an arg in order to use or not symbol lookup,
+		Add test-*-s.ndb batch files witch use symbol lookup.
+
+
+
+------------------------------------------------------------------------------------------------------------------------------------
+LibNode V 2.0.7-1 - A. GIBERT - 2005/01/20
+------------------------------------------------------------------------------------------------------------------------------------
+
+All:		Add to Makefile.var auto version label detection from CVS Tag.
+		This should be the final release of the 2.0 branch,
+		This new release is developped for the MICOT/Target project (Banque de France - Paris).
+LibNode:	Minor bug fixes in ND_*_Info_Print() functions and ND_Library_StdErr_Set alias defines.
+
+
+
+------------------------------------------------------------------------------------------------------------------------------------
+LibNode V 2.0.6-1 - A. GIBERT - 2004/08/24
+------------------------------------------------------------------------------------------------------------------------------------
+
+All:		Generate *-c executables with checking mode enabled (ND_MODE=1),
+		Code clean up and more cleanly indented,
+		This new release is developped for the MICOT/Target project (Banque de France - Paris),
+LibNode:	Add OpenStruct tracing support (Enabled by ND_MODE=1 and Debug=1),
+		Re-implement for Unix and Windows target, full address checking in ND_Address_Check(),
+NDDemo0:	Add LibNode 2.0.6 support: Add ND_Library_Open/Close() calls,
+NDBench:	Add Lib_Open, Lib_Close, Index_Value_Break and Index_Node_Break command,
+		Improve random number generation,
+		Add test-10.ndb and test-errror.ndb batch files.
+
+
+
+------------------------------------------------------------------------------------------------------------------------------------
+LibNode V 2.0.5-1 - A. GIBERT / M. REGIMBEAU - 2003/07/28
+------------------------------------------------------------------------------------------------------------------------------------
+
+All:		Add a new Makefile system (Makefile.rule and Makefile.var),
+		Add 'make distrib' support,
+		Add libnode.spec file,
+		Move node.h from lib directory to include directory.
+
+
+
+------------------------------------------------------------------------------------------------------------------------------------
+LibNode V 2.0.4-1 - A. GIBERT - 2002/07/29
+------------------------------------------------------------------------------------------------------------------------------------
+
+All:		This release of libnode pass with sucess valgrind test on linux.
+LibNode:	Add and use ND_Index_Clear() private API,
+NbBench:	Add fclose() call at the end of batch_run.
+
+
+
+------------------------------------------------------------------------------------------------------------------------------------
+LibNode V 2.0.3-1 - A. GIBERT - 2002/04/09
+------------------------------------------------------------------------------------------------------------------------------------
+
+All:		Fix Microsoft Visual Project to generate Debug and Release config correctly,
+LibNode:	Change index type numeric print value from decimal to hexa in ND_Index_Info_Print() API,
+LibNode:	Add new cases in ND_Index_Convert() handling (List->List:FIFO and List->List:LIFO),
+LibNode:	Generate in Debug mode libnoded.lib, libnoded.dll, libnoded_a.lib,
+LibNode:	Generate in Release mode libnode.lib, libnode.dll, libnode_a.lib,
+Demo0:		Generate in Debug mode demo0d.exe and in Release mode demo0d.exe,
+NbBench:	Generate in Debug mode ndbenchd.exe and in Release mode ndbenchd.exe.
+
+
+
+------------------------------------------------------------------------------------------------------------------------------------
+LibNode V 2.0.2-2 - A. GIBERT - 2002/03/01
+------------------------------------------------------------------------------------------------------------------------------------
+
+All:		Add GNU-GPL.txt, GNU-LGPL.txt and GNU-FDL.txt license files,
+All:		Add license stuff in ReandMe.
+LibNode:	Add LGPL header in libnode.c, libnode.h and node.h,
+LibNode:	Replace GPL by LGPL in libnode.rc,
+Demo0:		Add GPL header in demo0.c,
+NbBench:	Add GPL header in ndbench.c.
+
+
+
+------------------------------------------------------------------------------------------------------------------------------------
+LibNode V 2.0.2-1 - A. GIBERT - 2002/02/27
+------------------------------------------------------------------------------------------------------------------------------------
+
+All:		Makefiles now generate static and dynamic objects,
+All:		Add no libver support in Makefiles,
+LibNode:	VisualStudio Project now generate Windows DLL and use libnode.rc resource file,
+LibNode:	Rename Index_Open_Nb into Index_Open_Count,
+LibNode:	Fix bugs in ND_Node_Root_Alloc() on Index_Open_Count handling,
+LibNode:	Minor fix into ND_DataStruct_Check_I() and ND_Index_Check_I() functions,
+NbBench:	Implement Index_Close and Index_Info_Print functions.
+
+
+
+------------------------------------------------------------------------------------------------------------------------------------
+LibNode V 2.0.1-1 - A. GIBERT - 2001/11/28
+------------------------------------------------------------------------------------------------------------------------------------
 
 LibNode:	Fix the error level of TIMAS_KO: it's now an error status.
 
 
 
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
-LibNode V 2.0.0-1 - A. Gibert - 26/11/01
+LibNode V 2.0.0-1 - A. GIBERT - 2001/11/26
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
 
 All:		Merge the main CVS trunc with the win32 branche (2.0.0-alpha5),
 		Switch file release to 2.0.
 
 
 
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
-LibNode V 2.0.0-alpha5 - A. Gibert - 25/10/01
+LibNode V 2.0.0-alpha5 - A. GIBERT - 2001/10/25
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
 
 LibNode:	Add Open/Close Index support,
 LibNode:	Fix return code next to empty struct manipulations,
@@ -35,9 +171,9 @@ NdBench:	Add full multi index support.
 
 
 
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
-LibNode V 2.0.0-alpha4 - A. Gibert - 28/9/01
+LibNode V 2.0.0-alpha4 - A. GIBERT - 2001/09/28
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
 
 All:		Add optional libver support,
 LibNode:	Fix missing recursive offset args,
@@ -46,18 +182,18 @@ NdBench:	Fix local stack pointer big bug.
 
 
 
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
-LibNode V 2.0.0-alpha3 - A. Gibert - 18/9/01
+LibNode V 2.0.0-alpha3 - A. GIBERT - 2001/09/18
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
 
 New manager args interface (again !),
 ndbench support batch mode.
 
 
 
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
-LibNode V 2.0.0-alpha2 - A. Gibert - 8/9/01
+LibNode V 2.0.0-alpha2 - A. GIBERT - 2001/09/08
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
 
 Re-enable libver support for unix,
 Bug fixes,
@@ -65,53 +201,54 @@ Code cleanup.
 
 
 
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
-LibNode V 2.0.0-alpha1 - A. Gibert - 7/9/01
+LibNode V 2.0.0-alpha1 - A. GIBERT - 2001/09/07
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
 
 Add Full win32 support,
 Remove libver support,
 Multi index support,
 New manager args format,
 Major Code cleanup et standardisation.
+This new version (2.0.x) is developped for the TIMA project (Misys IBS - France).
 
 
 
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
-LibNode V 1.0.0 - S. Mas / A. Gibert - 18/7/00
+LibNode V 1.0.0 - S. MAS / A. GIBERT - 2000/07/18
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
 
-Unix (Linux and Solaris) version only, for BDM project (Société Générale - Paris)
+Unix (Linux and Solaris) version only, for BDM project (Société Générale - Paris)
 Major code rewrite.
 
 
 
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
-LibNode V 0.2.2 - A. Gibert - 1/6/93
+LibNode V 0.2.2 - A. GIBERT - 1993/06/01
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
 
-Embeded version on OS/2 2.1 (Companie Générale des Eaux - Paris)
+Embeded version on OS/2 2.1 (Companie Générale des Eaux - Paris)
 
 
 
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
-LibNode V 0.2.1 - A. Gibert - 1/4/92
+LibNode V 0.2.1 - A. GIBERT - 1992/04/01
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
 
 Amiga and PC support (Bareau de Draguignan - Ste Maxime).
 
 
 
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
-LibNode V 0.2.0 - A. Gibert - 1/3/91
+LibNode V 0.2.0 - A. GIBERT - 1991/03/01
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
 
 C version aided by p2c tools on Pyramid (Swansee University - Wales).
 
 
 
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
-LibNode V 0.1.0 - A. Gibert - 1/12/90
+LibNode V 0.1.0 - A. GIBERT - 1990/12/01
---------------------------------------------------------------------------------
+------------------------------------------------------------------------------------------------------------------------------------
 
 Inital version in Pascal on Pyramid (Swansee University - Wales).

ToDo.txt

@@ -1,14 +1,4 @@
-# $RCSfile: ToDo.txt,v $
+- Check LibShMem/LibDataStr support (via symbol lookup support),
-# $Revision: 2.1 $
+- Add Cache Value option,
-# $Name:  $
-# $Date: 2001/11/26 11:25:11 $
-# $Author: agibert $
-
-
-
-
-
-- More debug !
 - New English documentation (man/tex),
-- Improve API consitency,
+- Improve API consitency.
-- Re-enable LibShm/LibDataStr support (via TIMAT_DataStruct implementation).

demo/Makefile

@@ -1,8 +1,54 @@
+SRC      := nddemo0.c
+TARGETS  := nddemo0 nddemo0-c nddemo0-static nddemo0-static-c
+FILE_BIN := nddemo0 nddemo0-c nddemo0-static nddemo0-static-c
+FILE_LIB := nddemo0.dat
 
-all: demo0
 
-demo0: demo0.c ../../libver/ver.h ../lib/node.h ../../libver/libver.so ../lib/libnode.so Makefile
-	gcc -g -o demo0 -I ../../libver -I ../lib -ldl ../../libver/libver.so ../lib/libnode.so demo0.c
 
-clean:
+include ../Makefile.var
-	rm demo0
+include ../Makefile.rule
+
+
+
+DEP_STATIC  += ../lib/libnode.a      ../../liblog/lib/liblog.a  
+DEP_DYNAMIC += ../lib/libnode.so     ../../liblog/lib/liblog.so
+INCLUDE     += -I . -I ../include -I ../../liblog/include
+LIBDIR      += -L . -L ../lib     -L ../../liblog/lib
+LIB_STATIC  += ../lib/libnode.a      ../../liblog/lib/liblog.a  -ldl
+LIB_DYNAMIC += -lnode  -llog -ldl
+CFLAGS      += -rdynamic
+
+ifdef _LIBVER_SUPPORT
+	DEP_STATIC  += ../../libver/ver.h ../../libver/libver.a
+	DEP_DYNAMIC += ../../libver/ver.h ../../libver/libver.so
+	INCLUDE     += -I ../../libver/lib
+	LIBDIR      += -L ../../libver/lib
+
+        ifeq ($(OSTYPE),linux-gnu)
+                LIB_STATIC  += ../../libver/lib/libver.a
+                LIB_DYNAMIC += -lver
+        else
+                LIB_STATIC  += ../../libver/lib/libver.a
+                LIB_DYNAMIC += -lver
+        endif
+
+        CFLAGS              += -D_LIBVER_SUPPORT
+endif
+
+ND_CHECK_FLAGS   = -DND_MODE=0
+ND_NOCHECK_FLAGS = -DND_MODE=1
+
+
+
+nddemo0: nddemo0.c $(DEP_DYNAMIC)
+	$(CC) -o $@ $(CFLAGS) $(ND_NOCHECK_FLAGS) $(INCLUDE) $(LIBDIR) $(LIB_DYNAMIC) $<
+
+nddemo0-c: nddemo0.c $(DEP_DYNAMIC)
+	$(CC) -o $@ $(CFLAGS) $(ND_CHECK_FLAGS)   $(INCLUDE) $(LIBDIR) $(LIB_DYNAMIC) $<
+
+nddemo0-static: nddemo0.c $(DEP_STATIC)
+	$(CC) -o $@ $(CFLAGS) $(ND_NOCHECK_FLAGS) $(INCLUDE) $< $(LIB_STATIC)
+
+nddemo0-static-c: nddemo0.c $(DEP_STATIC)
+	$(CC) -o $@ $(CFLAGS) $(ND_CHECK_FLAGS)   $(INCLUDE) $< $(LIB_STATIC)
+

demo/nddemo0.c

@@ -1,52 +1,66 @@
-/*---------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* $RCSfile: nddemo0.c,v $                                                           */
+/* nddemo.c                                                                   */
-/*---------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* $Revision: 2.0 $                                                           */
+
-/* $Name:  $                                                               */
+/*----------------------------------------------------------------------------*/
-/* $Date: 2001/11/26 10:53:34 $                                                    */
+/* This file is part of LibNode.                                              */
-/* $Author: agibert $                                                              */
+/*                                                                            */
-/*---------------------------------------------------------------------------------*/
+/*    LibNode 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.                                     */
+/*                                                                            */
+/*    LibNode 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 LibNode. If not, see <https://www.gnu.org/licenses/>.        */
+/*----------------------------------------------------------------------------*/
 
 
 
+/*----------------------------------------------------------------------------*/
+/* Includes                                                                   */
+/*----------------------------------------------------------------------------*/
 
 #include <stdio.h>
 #include <errno.h>
+
 #include <node.h>
-//#include <windows.h> 
  
 
 
-#define DEMO_FILE_NAME          "demo0.txt"
+#define DEMO_FILE_NAME          "nddemo0.dat"
-#define STRING_LEN              (short)1024
+#define STRING_LEN              ( short) 1024
-#define STRING_SIZE             (short)(STRING_LEN + 1)
+#define STRING_SIZE             ( short) ( STRING_LEN + 1)
-#define VAL_LEN                 (short)64
+#define VAL_LEN                 ( short) 64
-#define VAL_SIZE                (short)(VAL_LEN + 1)
+#define VAL_SIZE                ( short) ( VAL_LEN + 1)
-#define INDEX_NB                (short)4
+#define INDEX_NB                ( short) 4
 
-#define NDT_CMD_INDEX0_PRINT    (NDT_Command)64
+#define NDD_CMD_INDEX0_PRINT    ( NDT_Command) 64
-#define NDT_CMD_INDEX1_PRINT    (NDT_Command)65
+#define NDD_CMD_INDEX1_PRINT    ( NDT_Command) 65
-#define NDT_CMD_INDEX2_PRINT    (NDT_Command)66
+#define NDD_CMD_INDEX2_PRINT    ( NDT_Command) 66
-#define NDT_CMD_INDEX3_PRINT    (NDT_Command)67
+#define NDD_CMD_INDEX3_PRINT    ( NDT_Command) 67
 
 
 
 typedef struct Demo_Value
 {
-    char  Val0[VAL_SIZE];
+	char  Val0[ VAL_SIZE];
-    char  Val1[VAL_SIZE];
+	char  Val1[ VAL_SIZE];
-    char  Val2[VAL_SIZE];
+	char  Val2[ VAL_SIZE];
-    char  Val3[VAL_SIZE];
+	char  Val3[ VAL_SIZE];
 } Demo_Value;
 
 
 
 /*---------------------------------------------------------------------------------*/
-/*    Prototypes                                                                       */
+/*    Prototypes                                                                   */
 /*---------------------------------------------------------------------------------*/
 
-NDT_Status  Manager_Demo_DS( NDT_Root  *, NDT_Index_Id, NDT_Node  *, NDT_Command, va_list);
+NDT_Status  Demo_DS_Manager( NDT_Root  *, NDT_Index_Id, NDT_Node  *, NDT_Command, va_list  *);
 void        DataStruct_Load( NDT_Root  *,  FILE  *);
 void        DataStruct_Load( NDT_Root  *,  FILE  *);
 void        Demo( char  *, short);
@@ -59,10 +73,10 @@ int         main( int, char  **);
 
 
 /*---------------------------------------------------------------------------------*/
-/*                                                                                   */
+/*                                                                                 */
 /*---------------------------------------------------------------------------------*/
 
-NDT_Status  Manager_Demo_DS( NDT_Root  *Root_Ptr, NDT_Index_Id  Index_Id, NDT_Node  *Node_Ptr, NDT_Command  Command, va_list  Args)
+NDT_Status  Demo_DS_Manager( NDT_Root  *Root_Ptr, NDT_Index_Id  Index_Id, NDT_Node  *Node_Ptr, NDT_Command  Command, va_list  *Args_Ptr)
 {
     NDT_Command_Name  Command_Name;
 
@@ -71,12 +85,12 @@ NDT_Status  Manager_Demo_DS( NDT_Root  *Root_Ptr, NDT_Index_Id  Index_Id, NDT_No
     {
         case NDD_CMD_MANAGER_VERSION:
         {
-            NDT_Version_Name  *Version_Name_Ptr = (NDT_Version_Name  *)va_arg( Args, NDT_Version_Name  *);
+	    ND_VA_ARG_GET( Version_Name_Ptr, *Args_Ptr, NDT_Version_Name  *);
 
 
             Command_Name = "NDD_CMD_MANAGER_VERSION";
 
-            *Version_Name_Ptr = "$Revision: 2.0 $   $Name:  $   $Date: 2001/11/26 10:53:34 $   $Author: agibert $";
+            *Version_Name_Ptr = "$Revision: 2.9 $   $Name:  $   $Date: 2010/06/06 21:27:12 $   $Author: agibert $";
 
             return( NDS_OK);
         }
@@ -84,43 +98,44 @@ NDT_Status  Manager_Demo_DS( NDT_Root  *Root_Ptr, NDT_Index_Id  Index_Id, NDT_No
         case NDD_CMD_INDEX_GET:
         {
             /*
-            NDT_Index_Id  *Reply_Index_Id_Ptr = (NDT_Index_Id  *)va_arg( Args, NDT_Index_Id  *);
+	      ND_VA_ARG_GET( Reply_Index_Id_Ptr, *Args_Ptr, NDT_Index_Id  *);
-            NDT_Command   *Reply_Command_Ptr  =  (NDT_Command  *)va_arg( Args, NDT_Command  *);
+	      ND_VA_ARG_GET( Reply_Command_Ptr,  *Args_Ptr, NDT_Command  *);
-            NDT_Command    Cmd                =     (NDT_Command)va_arg( Args, NDT_Command);
+	      ND_VA_ARG_GET( Cmd,                *Args_Ptr, NDT_Command);
-            void          *Value_ptr          =         (void  *)va_arg( Args, void  *);
+	      ND_VA_ARG_GET( Value_Ptr,          *Args_Ptr, void  *);
             */
-            NDT_Index_Id  *Reply_Index_Id_Ptr = (NDT_Index_Id  *)va_arg( Args, NDT_Index_Id  *);
+            
-            NDT_Command   *Reply_Command_Ptr  =  (NDT_Command  *)va_arg( Args, NDT_Command  *);
+	    ND_VA_ARG_GET( Reply_Index_Id_Ptr, *Args_Ptr, NDT_Index_Id  *);
-            NDT_Command    Cmd                =     (NDT_Command)va_arg( Args, NDT_Command);
+	    ND_VA_ARG_GET( Reply_Command_Ptr,  *Args_Ptr, NDT_Command  *);
-            Demo_Value    *Value_ptr          =   (Demo_Value  *)va_arg( Args, Demo_Value  *);
+	    ND_VA_ARG_GET( Cmd,                *Args_Ptr, NDT_Command);
+	    ND_VA_ARG_GET( Value_Ptr,          *Args_Ptr, Demo_Value  *);
 
 
             Command_Name = "NDD_CMD_INDEX_GET";
 
             switch(Cmd)
             {
-                case NDT_CMD_INDEX0_PRINT:
+                case NDD_CMD_INDEX0_PRINT:
                 {
                     *Reply_Index_Id_Ptr = 0;
                     *Reply_Command_Ptr = NDD_CMD_VALUE_PRINT;
                     break;
                 }
 
-                case NDT_CMD_INDEX1_PRINT:
+                case NDD_CMD_INDEX1_PRINT:
                 {
                     *Reply_Index_Id_Ptr = 1;
                     *Reply_Command_Ptr = NDD_CMD_VALUE_PRINT;
                     break;
                 }
 
-                case NDT_CMD_INDEX2_PRINT:
+                case NDD_CMD_INDEX2_PRINT:
                 {
                     *Reply_Index_Id_Ptr = 2;
                     *Reply_Command_Ptr = NDD_CMD_VALUE_PRINT;
                     break;
                 }
 
-                case NDT_CMD_INDEX3_PRINT:
+                case NDD_CMD_INDEX3_PRINT:
                 {
                     *Reply_Index_Id_Ptr = 3;
                     *Reply_Command_Ptr = NDD_CMD_VALUE_PRINT;
@@ -141,12 +156,16 @@ NDT_Status  Manager_Demo_DS( NDT_Root  *Root_Ptr, NDT_Index_Id  Index_Id, NDT_No
         case NDD_CMD_VALUE_ALLOC:
         {
             /*
-            void       **Value_Ptr_Ptr =   (void **)va_arg( Args, void  **);
+	      ND_VA_ARG_GET(    Value_Ptr_Ptr, *Args_Ptr, void  **);
-            va_list      user_args     =   (va_list)va_arg( Args, va_list);
+
-            user_type    user_data     = (user_type)va_arg( user_args, user_type);
+	      ND_VA_LIST_OPEN(  user_args,     *Args_Ptr);
-                                   ... =       (...)va_arg( user_args, ...);
+	      ND_VA_ARG_GET(    user_data,      user_args, user_type);
+	      ND_VA_ARG_GET(    ...,            user_args, ...);
+
+	      ND_VA_LIST_CLOSE( user_args);
             */
-            Demo_Value  **Value_Ptr_Ptr = va_arg( Args, Demo_Value  **);
+            
+	    ND_VA_ARG_GET( Value_Ptr_Ptr, *Args_Ptr, Demo_Value  **);
 
 
             Command_Name = "NDD_CMD_VALUE_ALLOC";
@@ -169,12 +188,16 @@ NDT_Status  Manager_Demo_DS( NDT_Root  *Root_Ptr, NDT_Index_Id  Index_Id, NDT_No
         case NDD_CMD_VALUE_FREE:
         {
             /*
-            void       *Value_Ptr =    (void *)va_arg( Args, void  *);
+	      ND_VA_ARG_GET(    Value_Ptr, *Args_Ptr, void  *);
-            va_list     user_args =   (va_list)va_arg( Args, va_list);
+
-            user_type   user_data = (user_type)va_arg( user_args, user_type);
+	      ND_VA_LIST_OPEN(  user_args, *Args_Ptr);
-                              ... =       (...)va_arg( user_args, ...);
+	      ND_VA_ARG_GET(    user_data,  user_args, user_type);
+	      ND_VA_ARG_GET(    ...,        user_args, ...);
+
+	      ND_VA_LIST_CLOSE( user_args);
             */
-            Demo_Value  *Value_Ptr = (Demo_Value  *)va_arg( Args, Demo_Value  *);
+            
+	    ND_VA_ARG_GET( Value_Ptr, *Args_Ptr, Demo_Value  *);
 
 
             Command_Name = "NDD_CMD_VALUE_FREE";
@@ -187,14 +210,18 @@ NDT_Status  Manager_Demo_DS( NDT_Root  *Root_Ptr, NDT_Index_Id  Index_Id, NDT_No
         case NDD_CMD_VALUE_COMP:
         {
             /*
-            void       *Value1_Ptr =    (void *)va_arg( Args, void  *);
+	      ND_VA_ARG_GET(    Value1_Ptr,  *Args_Ptr, void  *);
-            void       *Value2_Ptr =    (void *)va_arg( Args, void  *);
+	      ND_VA_ARG_GET(    Value2_Ptr,  *Args_Ptr, void  *);
-            va_list     user_args  =   (va_list)va_arg( Args, va_list);
+
-            user_type   user_data  = (user_type)va_arg( user_args, user_type);
+	      ND_VA_LIST_OPEN(  user_args,   *Args_Ptr);
-                               ... =       (...)va_arg( user_args, ...);
+	      ND_VA_ARG_GET(    user_data,    user_args, user_type);
+	      ND_VA_ARG_GET(    ...,          user_args, ...);
+
+	      ND_VA_LIST_CLOSE( user_args);
             */
-            Demo_Value    *Value1_Ptr = va_arg( Args, Demo_Value  *);
+            
-            Demo_Value    *Value2_Ptr = va_arg( Args, Demo_Value  *);
+	    ND_VA_ARG_GET( Value1_Ptr, *Args_Ptr, Demo_Value  *);
+	    ND_VA_ARG_GET( Value2_Ptr, *Args_Ptr, Demo_Value  *);
 
 
             Command_Name = "NDD_CMD_VALUE_COMP";
@@ -210,63 +237,63 @@ NDT_Status  Manager_Demo_DS( NDT_Root  *Root_Ptr, NDT_Index_Id  Index_Id, NDT_No
 
                     if( rc < 0)
                     {
-                        return(NDS_LOWER);
+                        return( NDS_LOWER);
                     }
                     else
                     {
                         if( rc > 0)
                         {
-                            return(NDS_GREATER);
+                            return( NDS_GREATER);
                         }
                         else
                         {
-                            return(NDS_EQUAL);
+                            return( NDS_EQUAL);
                         }
                     }
                 }
 
                 case 1:
                 {
-                    int  val1 = atoi(Value1_Ptr->Val1);
+                    int  val1 = atoi( Value1_Ptr->Val1);
-                    int  val2 = atoi(Value2_Ptr->Val1);
+                    int  val2 = atoi( Value2_Ptr->Val1);
 
 
                     if( val1 < val2)
                     {
-                        return(NDS_LOWER);
+                        return( NDS_LOWER);
                     }
                     else
                     {
                         if( val1 > val2)
                         {
-                            return(NDS_GREATER);
+                            return( NDS_GREATER);
                         }
                         else
                         {
-                            return(NDS_EQUAL);
+                            return( NDS_EQUAL);
                         }
                     }
                 }
 
                 case 2:
                 {
-                    int  val1 = strlen(Value1_Ptr->Val2);
+                    int  val1 = strlen( Value1_Ptr->Val2);
-                    int  val2 = strlen(Value2_Ptr->Val2);
+                    int  val2 = strlen( Value2_Ptr->Val2);
 
 
                     if( val1 < val2)
                     {
-                        return(NDS_LOWER);
+                        return( NDS_LOWER);
                     }
                     else
                     {
                         if( val1 > val2)
                         {
-                            return(NDS_GREATER);
+                            return( NDS_GREATER);
                         }
                         else
                         {
-                            return(NDS_EQUAL);
+                            return( NDS_EQUAL);
                         }
                     }
                 }
@@ -284,12 +311,17 @@ NDT_Status  Manager_Demo_DS( NDT_Root  *Root_Ptr, NDT_Index_Id  Index_Id, NDT_No
         case NDD_CMD_VALUE_ADD:
         {
             /*
-            void       *Value_Ptr =    (void *)va_arg( Args, void  *);
+	      ND_VA_ARG_GET(    Value_Ptr, *Args_Ptr, void  *);
-            va_list     user_args =   (va_list)va_arg( Args, va_list);
+
-            user_type   user_data = (user_type)va_arg( user_args, user_type);
+	      ND_VA_LIST_OPEN(  user_args, *Args_Ptr);
-                              ... =       (...)va_arg( user_args, ...);
+
+	      ND_VA_ARG_GET(    user_data,  user_args, user_type);
+	      ND_VA_ARG_GET(    ...,        user_args, ...);
+
+	      ND_VA_LIST_CLOSE( user_args);
             */
 
+
             Command_Name = "NDD_CMD_VALUE_ADD";
 
             return( NDS_OK);
@@ -298,43 +330,63 @@ NDT_Status  Manager_Demo_DS( NDT_Root  *Root_Ptr, NDT_Index_Id  Index_Id, NDT_No
         case NDD_CMD_VALUE_REMOVE:
         {
             /*
-            void       *Value_Ptr =    (void *)va_arg( Args, void  *);
+	      ND_VA_ARG_GET(   Value_Ptr, *Args_Ptr, void  *);
-            va_list     user_args =   (va_list)va_arg( Args, va_list);
+
-            user_type   user_data = (user_type)va_arg( user_args, user_type);
+	      ND_VA_LIST_OPEN( user_args, *Args_Ptr);
-                              ... =       (...)va_arg( user_args, ...);
+
+	      ND_VA_ARG_GET(   user_data,  user_args, user_type);
+	      ND_VA_ARG_GET(   ...,        user_args, ...);
+
+	      ND_VA_LIST_CLOSE( user_args);
             */
 
+
             Command_Name = "NDD_CMD_VALUE_REMOVE";
+
             return( NDS_OK);
         }
 
+
         case NDD_CMD_VALUE_PRINT:
         {
-            /*
+	    /*
-            NDT_Node             *Next_Node_Ptr   =         (NDT_Node  *)va_arg( Args, NDT_Node  *);
+	      ND_VA_ARG_GET(    Next_Node_Ptr,    *Args_Ptr,  NDT_Node  *);
-            va_list               lib_args        =             (va_list)va_arg( Args, va_list);
-            FILE                 *Out             =             (FILE  *)va_arg( lib_args, FILE  *);
-            NDT_Recursive_Mode    Recursive_Mode  =  (NDT_Recursive_Mode)va_arg( lib_args, NDT_Recursive_Mode);
-            NDT_Recursive_Depth   Recursive_Depth = (NDT_Recursive_Depth)va_arg( lib_args, NDT_Recursive_Depth);
-            va_list               user_args       =             (va_list)va_arg( lib_args, va_list);
-            user_type             user_data       =           (user_type)va_arg( user_args, user_type);
-                                              ... =                 (...)va_arg( user_args, ...);
 
-            void                 *Value_Ptr       = Node_Ptr->Value;
+	      ND_VA_LIST_OPEN(  lib_args,         *Args_Ptr);
-            */
-            NDT_Node             *Next_Node_Ptr   =         (NDT_Node  *)va_arg( Args, NDT_Node  *);
-            va_list               lib_args        =             (va_list)va_arg( Args, va_list);
-            FILE                 *Out             =             (FILE  *)va_arg( lib_args, FILE  *);
-            NDT_Recursive_Mode    Recursive_Mode  =  (NDT_Recursive_Mode)va_arg( lib_args, NDT_Recursive_Mode);
-            NDT_Recursive_Depth   Recursive_Depth = (NDT_Recursive_Depth)va_arg( lib_args, NDT_Recursive_Depth);
 
-            Demo_Value           *Value_Ptr       = Node_Ptr->Value;
+	      ND_VA_ARG_GET(    Out,               lib_args,  FILE  *);
+	      ND_VA_ARG_GET(    Recursive_Mode,    lib_args,  NDT_Recursive_Mode);
+	      ND_VA_ARG_GET(    Recursive_Depth,   lib_args,  NDT_Recursive_Depth);
+	      ND_VA_ARG_GET(    Recursive_Offset,  lib_args,  NDT_Recursive_Offset);
+
+	      ND_VA_LIST_OPEN(  user_args,         lib_args);
+
+	      ND_VA_ARG_GET(    user_data,         user_args, user_type);
+	      ND_VA_ARG_GET(    ...,               user_args, ...);
+
+	      ND_VA_LIST_CLOSE( user_args);
+	      ND_VA_LIST_CLOSE( lib_args);
+	    */
+            
+	    ND_VA_ARG_GET(    Next_Node_Ptr,    *Args_Ptr,  NDT_Node  *);
+
+	    ND_VA_LIST_OPEN(  lib_args,         *Args_Ptr);
+
+	    ND_VA_ARG_GET(    Out,               lib_args,  FILE  *);
+	    ND_VA_ARG_GET(    Recursive_Mode,    lib_args,  NDT_Recursive_Mode);
+	    ND_VA_ARG_GET(    Recursive_Depth,   lib_args,  NDT_Recursive_Depth);
+	    ND_VA_ARG_GET(    Recursive_Offset,  lib_args,  NDT_Recursive_Offset);
+
+	    ND_VA_LIST_CLOSE( lib_args);
+
+
+            Demo_Value  *Value_Ptr = Node_Ptr->Value;
 
 
             Command_Name = "NDD_CMD_VALUE_PRINT";
 
             fprintf( Out, "Val0: (%s)   Val1: (%s)   Val2: (%s)   Val3: (%s)\n",
-                    Value_Ptr->Val0, Value_Ptr->Val1, Value_Ptr->Val2, Value_Ptr->Val3);
+		     Value_Ptr->Val0, Value_Ptr->Val1, Value_Ptr->Val2, Value_Ptr->Val3);
 
             return( NDS_OK);
         }
@@ -342,18 +394,25 @@ NDT_Status  Manager_Demo_DS( NDT_Root  *Root_Ptr, NDT_Index_Id  Index_Id, NDT_No
         case NDD_CMD_INFO_PRINT:
         {
             /*
-            NDT_Node             *Next_Node_Ptr   =         (NDT_Node  *)va_arg( Args, NDT_Node  *);
+	      ND_VA_ARG_GET(    Next_Node_Ptr,    *Args_Ptr,  NDT_Node  *);
-            va_list               lib_args        =             (va_list)va_arg( Args, va_list);
-            FILE                 *Out             =             (FILE  *)va_arg( lib_args, FILE  *);
-            NDT_Recursive_Mode    Recursive_Mode  =  (NDT_Recursive_Mode)va_arg( lib_args, NDT_Recursive_Mode);
-            NDT_Recursive_Depth   Recursive_Depth = (NDT_Recursive_Depth)va_arg( lib_args, NDT_Recursive_Depth);
-            va_list               user_args       =             (va_list)va_arg( lib_args, va_list);
-            user_type             user_data       =           (user_type)va_arg( user_args, user_type);
-                                              ... =                 (...)va_arg( user_args, ...);
 
-            void                 *Value_Ptr       = Node_Ptr->Value;
+	      ND_VA_LIST_OPEN(  lib_args,         *Args_Ptr);
+
+	      ND_VA_ARG_GET(    Out,               lib_args,  FILE  *);
+	      ND_VA_ARG_GET(    Recursive_Mode,    lib_args,  NDT_Recursive_Mode);
+	      ND_VA_ARG_GET(    Recursive_Depth,   lib_args,  NDT_Recursive_Depth);
+	      ND_VA_ARG_GET(    Recursive_Offset,  lib_args,  NDT_Recursive_Offset);
+
+	      ND_VA_LIST_OPEN(  user_args,         lib_args);
+
+	      ND_VA_ARG_GET(    user_data,         user_args, user_type);
+	      ND_VA_ARG_GET(    ...,               user_args, ...);
+
+	      ND_VA_LIST_CLOSE( user_args);
+	      ND_VA_LIST_CLOSE( lib_args);
             */
 
+
             Command_Name = "NDD_CMD_INFO_PRINT";
 
             return( NDS_OK);
@@ -362,12 +421,12 @@ NDT_Status  Manager_Demo_DS( NDT_Root  *Root_Ptr, NDT_Index_Id  Index_Id, NDT_No
         default:
         {
             printf( "Demo_DS_Manager() called with an undefined command %d\n", Command);
-            return NDS_ERRAPI;
+            return( NDS_ERRAPI);
         }
     }
 
     printf( "Demo_DS_Manager() called with command %d (%s)\n", Command, Command_Name);
-    return NDS_OK;
+    return( NDS_OK);
 }
 
 
@@ -375,7 +434,7 @@ NDT_Status  Manager_Demo_DS( NDT_Root  *Root_Ptr, NDT_Index_Id  Index_Id, NDT_No
 
 
 /*---------------------------------------------------------------------------------*/
-/*                                                                                   */
+/*                                                                                 */
 /*---------------------------------------------------------------------------------*/
 
 void  DataStruct_Load( NDT_Root  *ds_ptr,  FILE  *demo_file)
@@ -390,7 +449,7 @@ void  DataStruct_Load( NDT_Root  *ds_ptr,  FILE  *demo_file)
     while( !feof( demo_file))
     {
         str = fgets( input_string, STRING_SIZE, demo_file);
-        if( ( (const int)str != EOF) && ( str != NULL))
+        if( str != NULL)
         {
             if( strlen( input_string) >= STRING_LEN)
             {
@@ -415,9 +474,9 @@ void  DataStruct_Load( NDT_Root  *ds_ptr,  FILE  *demo_file)
                     else
                     {
                         printf( "Input line read: \t(%s)\t(%s)\t(%s)\t(%s)\n", val0, val1, val2, val3);
-                            printf( "Allocate Vallue: ");
+			printf( "Allocate Vallue: ");
 
-                        if( ( status = ND_Value_Alloc( ds_ptr, (void  **)&value_ptr)) != NDS_OK)
+                        if( ( status = ND_Value_Alloc( (void  **)&value_ptr, ds_ptr)) != NDS_OK)
                         {
                             printf( "ND_Value_Alloc() failed (%d) !\n", status);
                         }
@@ -474,7 +533,7 @@ void  DataStruct_Dump( NDT_Root  *ds_ptr)
 
     printf( "Traverse DataStructure Index 0:\n");
 
-    if( ( status = ND_DataStruct_Traverse( ds_ptr, NDT_CMD_INDEX0_PRINT, stdout, NDD_RECURSIVE_MODE_PARENT, 0)) != NDS_OK)
+    if( ( status = ND_DataStruct_Traverse( ds_ptr, NDD_CMD_INDEX0_PRINT, stdout, NDD_RECURSIVE_MODE_PARENT, 0)) != NDS_OK)
     {
         printf( "ND_DataStruct_Traverse() failed (%d) !\n", status);
     }
@@ -485,7 +544,7 @@ void  DataStruct_Dump( NDT_Root  *ds_ptr)
 
     printf( "Traverse DataStructure Index 1:\n");
 
-    if( ( status = ND_DataStruct_Traverse( ds_ptr, NDT_CMD_INDEX1_PRINT, stdout, NDD_RECURSIVE_MODE_PARENT, 0)) != NDS_OK)
+    if( ( status = ND_DataStruct_Traverse( ds_ptr, NDD_CMD_INDEX1_PRINT, stdout, NDD_RECURSIVE_MODE_PARENT, 0)) != NDS_OK)
     {
         printf( "ND_DataStruct_Traverse() failed (%d) !\n", status);
     }
@@ -496,7 +555,7 @@ void  DataStruct_Dump( NDT_Root  *ds_ptr)
 
     printf( "Traverse DataStructure Index 2:\n");
 
-    if( ( status = ND_DataStruct_Traverse( ds_ptr, NDT_CMD_INDEX2_PRINT, stdout, NDD_RECURSIVE_MODE_PARENT, 0)) != NDS_OK)
+    if( ( status = ND_DataStruct_Traverse( ds_ptr, NDD_CMD_INDEX2_PRINT, stdout, NDD_RECURSIVE_MODE_PARENT, 0)) != NDS_OK)
     {
         printf( "ND_DataStruct_Traverse() failed (%d) !\n", status);
     }
@@ -507,7 +566,7 @@ void  DataStruct_Dump( NDT_Root  *ds_ptr)
 
     printf( "Traverse DataStructure Index 3:\n");
 
-    if( ( status = ND_DataStruct_Traverse( ds_ptr, NDT_CMD_INDEX3_PRINT, stdout, NDD_RECURSIVE_MODE_PARENT, 0)) != NDS_OK)
+    if( ( status = ND_DataStruct_Traverse( ds_ptr, NDD_CMD_INDEX3_PRINT, stdout, NDD_RECURSIVE_MODE_PARENT, 0)) != NDS_OK)
     {
         printf( "ND_DataStruct_Traverse() failed (%d) !\n", status);
     }
@@ -520,7 +579,7 @@ void  DataStruct_Dump( NDT_Root  *ds_ptr)
 
             
 /*---------------------------------------------------------------------------------*/
-/*                                                                                   */
+/*                                                                                 */
 /*---------------------------------------------------------------------------------*/
 
 void Demo( char  *Demo_File_Name, short  Optimized_Mode)
@@ -528,107 +587,119 @@ void Demo( char  *Demo_File_Name, short  Optimized_Mode)
     NDT_Status         status;
     NDT_Root        *demo_ds_ptr;
     NDT_Index_Type     index_type_initial_tab[INDEX_NB] = 
-    {
+	{
-        (NDD_INDEX_STATUS_OPENED | NDD_INDEX_TYPE_LIST | NDD_INDEX_SUBTYPE_FIFO),
+	    (NDD_INDEX_STATUS_OPENED | NDD_INDEX_TYPE_LIST | NDD_INDEX_SUBTYPE_FIFO),
-        (NDD_INDEX_STATUS_OPENED | NDD_INDEX_TYPE_LIST | NDD_INDEX_SUBTYPE_FIFO),
+	    (NDD_INDEX_STATUS_OPENED | NDD_INDEX_TYPE_LIST | NDD_INDEX_SUBTYPE_FIFO),
-        (NDD_INDEX_STATUS_OPENED | NDD_INDEX_TYPE_LIST | NDD_INDEX_SUBTYPE_FIFO),
+	    (NDD_INDEX_STATUS_OPENED | NDD_INDEX_TYPE_LIST | NDD_INDEX_SUBTYPE_FIFO),
-        (NDD_INDEX_STATUS_OPENED | NDD_INDEX_TYPE_LIST | NDD_INDEX_SUBTYPE_FIFO)
+	    (NDD_INDEX_STATUS_OPENED | NDD_INDEX_TYPE_LIST | NDD_INDEX_SUBTYPE_FIFO)
-    };
+	};
     NDT_Index_Type     index_type_final_tab[INDEX_NB] = 
-    {
+	{
-        (NDD_INDEX_STATUS_OPENED | NDD_INDEX_TYPE_TREE | NDD_INDEX_SUBTYPE_BALANCED),
+	    (NDD_INDEX_STATUS_OPENED | NDD_INDEX_TYPE_TREE | NDD_INDEX_SUBTYPE_BALANCED),
-        (NDD_INDEX_STATUS_OPENED | NDD_INDEX_TYPE_LIST | NDD_INDEX_SUBTYPE_SORTED),
+	    (NDD_INDEX_STATUS_OPENED | NDD_INDEX_TYPE_LIST | NDD_INDEX_SUBTYPE_SORTED),
-        (NDD_INDEX_STATUS_OPENED | NDD_INDEX_TYPE_TREE | NDD_INDEX_SUBTYPE_BALANCED),
+	    (NDD_INDEX_STATUS_OPENED | NDD_INDEX_TYPE_TREE | NDD_INDEX_SUBTYPE_BALANCED),
-        (NDD_INDEX_STATUS_OPENED | NDD_INDEX_TYPE_LIST | NDD_INDEX_SUBTYPE_FIFO)
+	    (NDD_INDEX_STATUS_OPENED | NDD_INDEX_TYPE_LIST | NDD_INDEX_SUBTYPE_FIFO)
-    };
+	};
     NDT_Index_Type  *index_type_ptr;
     FILE            *demo_file;
 
 
-    printf( "Create demo DataStructure: ");
+    printf( "Open library: ");
 
-    if( Optimized_Mode)
+    if( ( status = ND_Library_Open( NDD_TRUE)) != NDS_OK)
     {
-        index_type_ptr = index_type_initial_tab;
+        printf( "ND_Library_Open() failed (%d) !\n", status);
-    }
-    else
-    {
-        index_type_ptr = index_type_final_tab;
-    }
-
-
-
-    if( ( status = ND_DataStruct_Open( &demo_ds_ptr, INDEX_NB, index_type_ptr, "Manager_Demo_DS", Manager_Demo_DS, NULL, NULL, NULL, NULL,0,  NULL)) != NDS_OK)
-    {
-        printf( "ND_DataStruct_Open() failed (%d) !\n", status);
     }
     else
     {
         printf( "Ok !\n");
 
-        printf( "Open demo datafile: ");
+	printf( "Create demo DataStructure: ");
 
-        if( ( demo_file = fopen( Demo_File_Name, "r")) == NULL)
+	if( Optimized_Mode)
-        {
+	{
-            printf( "fopen() failed (%d/%s) !\n", errno, strerror(errno));
+	    index_type_ptr = index_type_initial_tab;
-        }
+	}
-        else
+	else
-        {
+	{
-            printf( "Ok !\n");
+	    index_type_ptr = index_type_final_tab;
+	}
+
+	if( ( status = ND_DataStruct_Open( &demo_ds_ptr, "NDDemo0", ND_OPEN_FLAG_CREATE, INDEX_NB, index_type_ptr, "Demo_DS_Manager", Demo_DS_Manager, NULL, 0,  NULL)) != NDS_OK)
+	{
+	    printf( "ND_DataStruct_Open() failed (%d) !\n", status);
+	}
+	else
+	{
+	    printf( "Ok !\n");
+
+	    printf( "Open demo datafile: ");
+
+	    if( ( demo_file = fopen( Demo_File_Name, "r")) == NULL)
+	    {
+		printf( "fopen() failed (%d/%s) !\n", errno, strerror(errno));
+	    }
+	    else
+	    {
+		printf( "Ok !\n");
 
 
 
-            printf( "\n\n\nLaod Data File:\n\n");
+		printf( "\n\n\nLaod Data File:\n\n");
-            DataStruct_Load( demo_ds_ptr, demo_file);
+		DataStruct_Load( demo_ds_ptr, demo_file);
-
-
             
-            if( Optimized_Mode)
+		if( Optimized_Mode)
-            {
+		{
-
+		    printf( "\n\n\nInitial Structure Dump:\n\n");
-                printf( "\n\n\nInitial Structure Dump:\n\n");
+		    DataStruct_Dump( demo_ds_ptr);
-                DataStruct_Dump( demo_ds_ptr);
-
-
             
-                printf( "Convert data structure: ");
+		    printf( "Convert data structure: ");
 
-                if( ( status = ND_DataStruct_Convert( demo_ds_ptr, index_type_final_tab)) != NDS_OK)
+		    if( ( status = ND_DataStruct_Convert( demo_ds_ptr, index_type_final_tab)) != NDS_OK)
-                {
+		    {
-                    printf( "ND_DataStruct_Convert() failed (%d) !\n", status);
+			printf( "ND_DataStruct_Convert() failed (%d) !\n", status);
-                }
+		    }
-                else
+		    else
-                {
+		    {
-                    printf( "Ok !\n");
+			printf( "Ok !\n");
-                }
+		    }
-            }
+		}
 
 
 
-            printf( "\n\n\nFinal Structure Dump:\n\n");
+		printf( "\n\n\nFinal Structure Dump:\n\n");
-            DataStruct_Dump( demo_ds_ptr);
+		DataStruct_Dump( demo_ds_ptr);
+
+		printf( "Close demo datafile: ");
+
+		if( fclose( demo_file) != 0)
+		{
+		    printf( "fclose() failed (%d/%s) !\n", errno, strerror(errno));
+		}
+		else
+		{
+		    printf( "Ok !\n");
+		}
+	    }
 
 
-
+	    printf( "Close demo DataStructure: ");
-            printf( "Close demo datafile: ");
-
-            if( fclose( demo_file) != 0)
-            {
-                printf( "fclose() failed (%d/%s) !\n", errno, strerror(errno));
-            }
-            else
-            {
-                printf( "Ok !\n");
-            }
-        }
-
-
-
-        printf( "Close demo DataStructure: ");
     
-        if( ( status = ND_DataStruct_Close( demo_ds_ptr)) != NDS_OK)
+	    if( ( status = ND_DataStruct_Close( demo_ds_ptr)) != NDS_OK)
+	    {
+		printf( "ND_DataStruct_Close() failed (%d) !\n", status);
+	    }
+	    else
+	    {
+		printf( "Ok !\n");
+	    }
+	}
+
+        printf( "Close library: ");
+    
+        if( ( status = ND_Library_Close()) != NDS_OK)
         {
-            printf( "ND_DataStruct_Close() failed (%d) !\n", status);
+            printf( "ND_Library_Close() failed (%d) !\n", status);
         }
         else
         {
@@ -642,7 +713,7 @@ void Demo( char  *Demo_File_Name, short  Optimized_Mode)
 
 
 /*---------------------------------------------------------------------------------*/
-/*                                                                                   */
+/*                                                                                 */
 /*---------------------------------------------------------------------------------*/
 
 int main( int  argc, char  **argv)
@@ -652,34 +723,4 @@ int main( int  argc, char  **argv)
 
     printf( "\n\n\n\n\nOptimized Demo\n--------------\n\n\n");
     Demo( DEMO_FILE_NAME, 1);
-
-    {
-/*
-        HMODULE my_module;
-        char  buf[256];
-        FARPROC my_function;
-
-        my_module = GetModuleHandle( NULL);
-        printf( "Module_Handle: (%p)\n", my_module);
-
-        buf[0] = '\0';
-        GetModuleFileName( my_module, buf, 255);
-        printf( "Module_Name: (%s)\n", buf);
-        
-        my_function = GetProcAddress( my_module, "zob");
-        printf( "Function_Addr: (%p)\n", my_function);
-
-        my_function();
-*/
-    }
 }
-
-
-
-
-/*
-__declspec(dllexport) void zob(void)
-{
-        printf( "Zoby la mouche qui pête...!!!\n");
-}
-*/

demo/nddemo0.dat

@@ -1,9 +1,9 @@
 #---------------------------------------------------------------------------------
 # $RCSfile: nddemo0.dat,v $								
 #---------------------------------------------------------------------------------
-# $Revision: 2.0 $								
+# $Revision: 2.1 $								
 # $Name:  $									
-# $Date: 2001/11/26 10:53:34 $							
+# $Date: 2003/07/16 00:17:02 $							
 # $Author: agibert $								
 #---------------------------------------------------------------------------------
 ggg	1	xxxxxx	example

demo/nddemo0.dsp

@@ -1,24 +1,24 @@
-# Microsoft Developer Studio Project File - Name="demo0" - Package Owner=<4>
+# Microsoft Developer Studio Project File - Name="nddemo0" - Package Owner=<4>
 # Microsoft Developer Studio Generated Build File, Format Version 6.00
 # ** DO NOT EDIT **
 
 # TARGTYPE "Win32 (x86) Console Application" 0x0103
 
-CFG=demo0 - Win32 Debug
+CFG=nddemo0 - Win32 Debug
 !MESSAGE This is not a valid makefile. To build this project using NMAKE,
 !MESSAGE use the Export Makefile command and run
 !MESSAGE 
-!MESSAGE NMAKE /f "demo0.mak".
+!MESSAGE NMAKE /f "nddemo0.mak".
 !MESSAGE 
 !MESSAGE You can specify a configuration when running NMAKE
 !MESSAGE by defining the macro CFG on the command line. For example:
 !MESSAGE 
-!MESSAGE NMAKE /f "demo0.mak" CFG="demo0 - Win32 Debug"
+!MESSAGE NMAKE /f "nddemo0.mak" CFG="nddemo0 - Win32 Debug"
 !MESSAGE 
 !MESSAGE Possible choices for configuration are:
 !MESSAGE 
-!MESSAGE "demo0 - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "nddemo0 - Win32 Release" (based on "Win32 (x86) Console Application")
-!MESSAGE "demo0 - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE "nddemo0 - Win32 Debug" (based on "Win32 (x86) Console Application")
 !MESSAGE 
 
 # Begin Project
@@ -28,7 +28,7 @@ CFG=demo0 - Win32 Debug
 CPP=cl.exe
 RSC=rc.exe
 
-!IF  "$(CFG)" == "demo0 - Win32 Release"
+!IF  "$(CFG)" == "nddemo0 - Win32 Release"
 
 # PROP BASE Use_MFC 0
 # PROP BASE Use_Debug_Libraries 0
@@ -37,11 +37,12 @@ RSC=rc.exe
 # PROP BASE Target_Dir ""
 # PROP Use_MFC 0
 # PROP Use_Debug_Libraries 0
-# PROP Output_Dir "Release"
+# PROP Output_Dir ""
 # PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
 # PROP Target_Dir ""
 # ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
-# ADD CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MD /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
 # ADD BASE RSC /l 0x809 /d "NDEBUG"
 # ADD RSC /l 0x809 /d "NDEBUG"
 BSC32=bscmake.exe
@@ -49,9 +50,9 @@ BSC32=bscmake.exe
 # ADD BSC32 /nologo
 LINK32=link.exe
 # ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
-# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib libnode.lib /nologo /subsystem:console /incremental:yes /machine:I386
 
-!ELSEIF  "$(CFG)" == "demo0 - Win32 Debug"
+!ELSEIF  "$(CFG)" == "nddemo0 - Win32 Debug"
 
 # PROP BASE Use_MFC 0
 # PROP BASE Use_Debug_Libraries 1
@@ -60,12 +61,12 @@ LINK32=link.exe
 # PROP BASE Target_Dir ""
 # PROP Use_MFC 0
 # PROP Use_Debug_Libraries 1
-# PROP Output_Dir "Debug"
+# PROP Output_Dir ""
 # PROP Intermediate_Dir "Debug"
 # PROP Ignore_Export_Lib 0
 # PROP Target_Dir ""
 # ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
-# ADD CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /FR /YX /FD /GZ /c
+# ADD CPP /nologo /MDd /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /FR /YX /FD /GZ /c
 # ADD BASE RSC /l 0x809 /d "_DEBUG"
 # ADD RSC /l 0x809 /d "_DEBUG"
 BSC32=bscmake.exe
@@ -73,20 +74,29 @@ BSC32=bscmake.exe
 # ADD BSC32 /nologo
 LINK32=link.exe
 # ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
-# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib libnode.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib libnoded.lib /nologo /subsystem:console /debug /machine:I386 /out:"nddemo0d.exe" /pdbtype:sept
 
 !ENDIF 
 
 # Begin Target
 
-# Name "demo0 - Win32 Release"
+# Name "nddemo0 - Win32 Release"
-# Name "demo0 - Win32 Debug"
+# Name "nddemo0 - Win32 Debug"
 # Begin Group "Source Files"
 
 # PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
 # Begin Source File
 
-SOURCE=.\demo0.c
+SOURCE=.\nddemo0.c
+
+!IF  "$(CFG)" == "nddemo0 - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "nddemo0 - Win32 Debug"
+
+# ADD CPP /MDd
+
+!ENDIF 
+
 # End Source File
 # End Group
 # Begin Group "Header Files"

demo/nddemo0.dsw

@@ -3,7 +3,7 @@ Microsoft Developer Studio Workspace File, Format Version 6.00
 
 ###############################################################################
 
-Project: "demo0"=.\demo0\demo0.dsp - Package Owner=<4>
+Project: "nddemo0"=.\nddemo0.dsp - Package Owner=<4>
 
 Package=<5>
 {{{

doc/Makefile

@@ -0,0 +1,5 @@
+FILE_DOC := libnode.doc
+FILE_MAN := man3
+
+include ../Makefile.var
+include ../Makefile.rule

doc/man3/libnode.3

@@ -15,7 +15,7 @@ LIBNODE (librairie de structure de donnees a base de noeuds)
 .LP
 .BI "NDT_Status ND_Library_Stderr_Set ( FILE * " Out " );"
 .LP
-.BI "NDT_Status ND_DataStruct_Open ( NDT_Root ** " Root ", NDT_DataStruct_Type " Type ", const char * " Allocator ", const char * " Desallocator ", void * " User " );"
+.BI "NDT_Status ND_DataStruct_Open ( NDT_Root ** " Root ", NDT_DataStruct_Type " Type ", const char * " Allocator ", const char * " Deallocator ", void * " User " );"
 .LP
 .BI "NDT_Status ND_DataStruct_Close ( NDT_Root * " Root " );"
 .LP
@@ -61,7 +61,7 @@ LIBNODE (librairie de structure de donnees a base de noeuds)
 .LP
 .BI "NDT_Status ND_Allocator_Exec (const char * " Function_Name ", void ** " Ptr ", size_t " Size ", void * " Data " );"
 .LP
-.BI "NDT_Status ND_Desallocator_Exec (const char * " Function_Name ", void * " Ptr ", void * " Data " );"
+.BI "NDT_Status ND_Deallocator_Exec (const char * " Function_Name ", void * " Ptr ", void * " Data " );"
 .LP
 .SH DESCRIPTION
 .LP
@@ -153,7 +153,7 @@ La racine d'une structure reference enfin les fonctions suivantes par leur nom :
 : fonction qui realise l'allocation de memoire pour la structure
 .LP
 -
-.B Desallocator
+.B Deallocator
 : fonction qui realise la desallocation de memoire pour la structure
 .LP
 .RS -3
@@ -362,7 +362,7 @@ Par defaut, une structure de donnees definira la fonction malloc() comme fonctio
 (voir FONCTIONS).
 .LP
 .RS -3
-.BI NDT_Desallocator
+.BI NDT_Deallocator
 .LP
 .RS 3
 Designe le type d'une fonction de desallocation memoire.
@@ -373,7 +373,7 @@ Par defaut, une structure de donnees definira la fonction free() comme fonction
 .LP
 .I NB
 : une fonction de desallocation devra etre executee via la fonction
-.B NDT_Desallocator_Exec
+.B NDT_Deallocator_Exec
 (voir FONCTIONS).
 .LP
 .RS -3
@@ -404,7 +404,7 @@ Cette fonction permet de definir
 comme la sortie standard des messages d'erreur de la librarie.
 .RS -3
 .LP
-.BI "NDT_Status ND_DataStruct_Open ( NDT_Root ** " Root ", NDT_DataStruct_Type " Type ", const char * " Allocator ", const char * " Desallocator ", void * " User " , int " Own_Value " );"
+.BI "NDT_Status ND_DataStruct_Open ( NDT_Root ** " Root ", NDT_DataStruct_Type " Type ", const char * " Allocator ", const char * " Deallocator ", void * " User " , int " Own_Value " );"
 .RS 3
 .LP
 Cette fonction permet de creer une structure de donnees.
@@ -428,9 +428,9 @@ Elle doit recevoir les arguments suivants :
 Si cet argument est positionne a NULL, alors la fonction d'allocation locale malloc() sera utilisee par defaut.
 .LP
 * (In)
-.I Desallocator
+.I Deallocator
 : le nom de la fonction de desallocation memoire (fonction de type
-.B NDT_Desallocator
+.B NDT_Deallocator
 ) associee a la nouvelle structure de donnees.
 Si cet argument est positionne a NULL, alors la fonction de desallocation locale free() sera utilisee par defaut.
 .LP
@@ -868,7 +868,7 @@ Elle doit recevoir les arguments suivants :
 .RS -3
 .LP
 .RS -3
-.BI "NDT_Status ND_Desallocator_Exec (const char * " Function_Name ", void * " Ptr ", void * " Data " );"
+.BI "NDT_Status ND_Deallocator_Exec (const char * " Function_Name ", void * " Ptr ", void * " Data " );"
 .LP
 .RS 3
 Cette fonction permet d'executer une fonction de desallocation a partir de son nom.
@@ -879,7 +879,7 @@ Elle doit recevoir les arguments suivants :
 * (In)
 .I Function_Name
 : le nom de la fonction de desallocation (fonction de type
-.B NDT_Desallocator
+.B NDT_Deallocator
 )
 .LP
 * (In)

include/Makefile

@@ -0,0 +1,6 @@
+FILE_INCLUDE := node.h
+
+
+
+include ../Makefile.var
+include ../Makefile.rule

lib/Makefile

@@ -1,11 +1,22 @@
+SRC          := libnode.c
+TARGETS      := libnode.a libnode.so
+FILE_LIB     := libnode.a libnode.so
 
-all: libnode.so
 
-libnode.o: libnode.c node.h libnode.h ../../libver/ver.h Makefile
-	gcc -c -g -o libnode.o -I . -I ../../libver libnode.c
 
-libnode.so: libnode.o
+include ../Makefile.var
-	ld -shared -o libnode.so libnode.o
+include ../Makefile.rule
 
-clean:
+
-	rm libnode.o libnode.so
+
+DEP     += libnode.h ../include/node.h  ../../liblog/include/log.h Makefile
+INCLUDE += -I . -I ../include -I ../../liblog/include
+
+ifdef _LIBVER_SUPPORT
+	DEP     += ../../libver/ver.h
+	INCLUDE += -I ../../libver/lib
+endif
+
+
+
+libnode.o : libnode.c $(DEP)

lib/libnode.dsp

@@ -2,9 +2,9 @@
 # Microsoft Developer Studio Generated Build File, Format Version 6.00
 # ** DO NOT EDIT **
 
-# TARGTYPE "Win32 (x86) Static Library" 0x0104
+# TARGTYPE "Win32 (x86) Dynamic-Link Library" 0x0102
 
-CFG=libnode - Win32 Debug
+CFG=libnode - Win32 Release
 !MESSAGE This is not a valid makefile. To build this project using NMAKE,
 !MESSAGE use the Export Makefile command and run
 !MESSAGE 
@@ -13,12 +13,12 @@ CFG=libnode - Win32 Debug
 !MESSAGE You can specify a configuration when running NMAKE
 !MESSAGE by defining the macro CFG on the command line. For example:
 !MESSAGE 
-!MESSAGE NMAKE /f "libnode.mak" CFG="libnode - Win32 Debug"
+!MESSAGE NMAKE /f "libnode.mak" CFG="libnode - Win32 Release"
 !MESSAGE 
 !MESSAGE Possible choices for configuration are:
 !MESSAGE 
-!MESSAGE "libnode - Win32 Release" (based on "Win32 (x86) Static Library")
+!MESSAGE "libnode - Win32 Release" (based on "Win32 (x86) Dynamic-Link Library")
-!MESSAGE "libnode - Win32 Debug" (based on "Win32 (x86) Static Library")
+!MESSAGE "libnode - Win32 Debug" (based on "Win32 (x86) Dynamic-Link Library")
 !MESSAGE 
 
 # Begin Project
@@ -26,6 +26,7 @@ CFG=libnode - Win32 Debug
 # PROP Scc_ProjName ""
 # PROP Scc_LocalPath ""
 CPP=cl.exe
+MTL=midl.exe
 RSC=rc.exe
 
 !IF  "$(CFG)" == "libnode - Win32 Release"
@@ -37,19 +38,30 @@ RSC=rc.exe
 # PROP BASE Target_Dir ""
 # PROP Use_MFC 0
 # PROP Use_Debug_Libraries 0
-# PROP Output_Dir "Release"
+# PROP Output_Dir ""
 # PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
 # PROP Target_Dir ""
-# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_MBCS" /D "_LIB" /YX /FD /c
+# ADD BASE CPP /nologo /MT /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "LIBNODE_EXPORTS" /YX /FD /c
-# ADD CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_MBCS" /D "_LIB" /YX /FD /c
+# ADD CPP /nologo /MD /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "LIBNODE_EXPORTS" /YX /FD /c
+# ADD BASE MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+# ADD MTL /nologo /D "NDEBUG" /mktyplib203 /win32
 # ADD BASE RSC /l 0x809 /d "NDEBUG"
 # ADD RSC /l 0x809 /d "NDEBUG"
 BSC32=bscmake.exe
 # ADD BASE BSC32 /nologo
 # ADD BSC32 /nologo
-LIB32=link.exe -lib
+LINK32=link.exe
-# ADD BASE LIB32 /nologo
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /machine:I386
-# ADD LIB32 /nologo
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /incremental:yes /machine:I386
+# Begin Custom Build - Creating static library libnode_a.lib...
+InputPath=.\libnode.dll
+SOURCE="$(InputPath)"
+
+"libnode_a.lib" : $(SOURCE) "$(INTDIR)" "$(OUTDIR)"
+	lib /nologo /out:libnode_a.lib Release\*.obj
+
+# End Custom Build
 
 !ELSEIF  "$(CFG)" == "libnode - Win32 Debug"
 
@@ -60,19 +72,32 @@ LIB32=link.exe -lib
 # PROP BASE Target_Dir ""
 # PROP Use_MFC 0
 # PROP Use_Debug_Libraries 1
-# PROP Output_Dir "Debug"
+# PROP Output_Dir ""
 # PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
 # PROP Target_Dir ""
-# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_MBCS" /D "_LIB" /YX /FD /GZ /c
+# ADD BASE CPP /nologo /MTd /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "LIBNODE_EXPORTS" /YX /FD /GZ /c
-# ADD CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_MBCS" /D "_LIB" /FR /YX /FD /GZ /c
+# ADD CPP /nologo /MDd /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /FR /YX /FD /GZ /c
+# SUBTRACT CPP /WX
+# ADD BASE MTL /nologo /D "_DEBUG" /mktyplib203 /win32
+# ADD MTL /nologo /D "_DEBUG" /mktyplib203 /win32
 # ADD BASE RSC /l 0x809 /d "_DEBUG"
 # ADD RSC /l 0x809 /d "_DEBUG"
 BSC32=bscmake.exe
 # ADD BASE BSC32 /nologo
 # ADD BSC32 /nologo
-LIB32=link.exe -lib
+LINK32=link.exe
-# ADD BASE LIB32 /nologo
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /debug /machine:I386 /pdbtype:sept
-# ADD LIB32 /nologo
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /debug /machine:I386 /out:"libnoded.dll" /pdbtype:sept
+# SUBTRACT LINK32 /map
+# Begin Custom Build - Creating static library libnoded_a.lib...
+InputPath=.\libnoded.dll
+SOURCE="$(InputPath)"
+
+"libnoded_a.lib" : $(SOURCE) "$(INTDIR)" "$(OUTDIR)"
+	lib /nologo /out:libnoded_a.lib Debug\*.obj
+
+# End Custom Build
 
 !ENDIF 
 
@@ -87,6 +112,10 @@ LIB32=link.exe -lib
 
 SOURCE=.\libnode.c
 # End Source File
+# Begin Source File
+
+SOURCE=.\libnode.rc
+# End Source File
 # End Group
 # Begin Group "Header Files"
 
@@ -97,8 +126,12 @@ SOURCE=.\libnode.h
 # End Source File
 # Begin Source File
 
-SOURCE=.\node.h
+SOURCE=..\include\node.h
 # End Source File
 # End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# End Group
 # End Target
 # End Project

lib/libnode.h

@@ -1,19 +1,45 @@
-/*---------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* $RCSfile: libnode.h,v $														   */
+/* libnode.h                                                                  */
-/*---------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* $Revision: 2.0 $															   */
+
-/* $Name:  $															   */
+/*----------------------------------------------------------------------------*/
-/* $Date: 2001/11/26 10:54:13 $													   */
+/* This file is part of LibNode                                               */
-/* $Author: agibert $															   */
+/*                                                                            */
-/*---------------------------------------------------------------------------------*/
+/*    LibNode is free software: you can redistribute it and/or modify it      */
+/*    under the terms of the GNU Lesser General Public License as published   */
+/*    by the Free Software Foundation, either version 3 of the License, or    */
+/*    (at your option) any later version.                                     */
+/*                                                                            */
+/*    LibNode is distributed in the hope that it will be useful,              */
+/*    but WITHOUT ANY WARRANTY; without even the implied warranty of          */
+/*    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the            */
+/*    GNU Lesser General Public License for more details.                     */
+/*                                                                            */
+/*    You should have received a copy of the GNU Lesser General Public        */
+/*    License along with LibNode. If not, see                                 */
+/*    <https://www.gnu.org/licenses/>.                                        */
+/*----------------------------------------------------------------------------*/
 
 
 
-#include <stdio.h>
+/*----------------------------------------------------------------------------*/
+/* Includes                                                                   */
+/*----------------------------------------------------------------------------*/
+
 #include <stdlib.h>
+#include <stdio.h>
 #include <string.h>
+#include <errno.h>
 #include <signal.h>
-//#include <dlfcn.h>
+#include <setjmp.h>
+#include <dlfcn.h>
+
+
+
+/* Utilisation des API de la LIBNODE sans vérification des arguments */
+
+#define ND_MODE 1
+
 #include <node.h>
 
 
@@ -22,243 +48,448 @@
 
 
 
+/*----------------------------------------------------------------------------*/
+/* Definitions                                                                */
+/*----------------------------------------------------------------------------*/
+
+#define LGD_MODULE_NAME "nd"
+
+
+
 #ifdef __linux
-
 #   define NDD_PRINTF_PTR_PREFIX  ""
-
 #else
-
 #   define NDD_PRINTF_PTR_PREFIX  "0x"
-
 #endif
 
 
 
 
 
-#define NDD_HUGE_LONG (long)0xFFFFFFL
+#define NDD_HUGE_LONG ( long) 0xFFFFFFL
 
-/* Sortie standard des messages d'erreur */
 
-FILE * ND_stderr;
 
 /* Table des symboles locale */
 
-struct Symbol {
+struct NDT_Symbol;
-    void *          Ptr;
+
-    char *          Name;
+typedef struct NDT_Symbol
-    struct Symbol * Next;
+{
-} * Symbol_Table = NULL;
+	void               *Ptr;
+	char               *Name;
+	struct NDT_Symbol  *Next;
+} NDT_Symbol;
+
+
+
+/* LibNode Global Base Structure */
+
+typedef struct NDT_Base
+{
+	int              Open_Status;
+	int              Debug_Mode;
+	char             Err_String[512];
+	FILE            *Err_Stream;
+	int              Sig_Trapped;
+#if !defined(_WIN32)
+	sigjmp_buf       SigLongJmp_Env;
+#else
+	jmp_buf          SigLongJmp_Env;
+#endif
+	NDT_Symbol      *Symbol_First_Ptr;
+	void            *DL_Ptr;
+	NDT_Index_Type   OpenStruct_Index_Type[1];
+	NDT_Root        *OpenStruct_Ptr;
+} NDT_Base;
+
+NDT_Base  NDG_Base = 
+{
+    NDD_FALSE,
+    NDD_TRUE,
+    "",
+    (FILE *) -1,
+    0,
+    {0},
+    (NDT_Symbol  *) NULL,
+    NULL,
+    { NDD_INDEX_STATUS_OPENED | NDD_INDEX_TYPE_LIST | NDD_INDEX_SUBTYPE_FIFO},
+    (NDT_Root  *)   NULL
+};
+
 
-NDT_Root * Tmp_Root;
 
-extern char * strdup (const char *);
-extern int sigrelse (int sig);
 
-int Sig_Trapped;
 
 /*------------------------------------------------------------------------------*/
-/*------------------------------------------------------------------------------*/
+/*                                                                              */
-/*       Fonctions et procédures privées de la librairie  (moyen niveau)        */
-/*------------------------------------------------------------------------------*/
 /*------------------------------------------------------------------------------*/
 
-/*------------------------------------------------------------------------------*/
+#define ND_LIBNODE_OPEN_CHECK()                                           if( NDG_Base.Open_Status != NDD_TRUE)            { LG_LOG_ERROR( "LibNode library is not opened"); return( NDS_ERRAPI); }
-/* Manager par défaut                                                           */
+#define ND_NOT_NULL_CHECK( Ptr, Msg)                                      if( !( Ptr))                                     { LG_LOG_ERROR( "%s is null", ( Msg));            return( NDS_ERRAPI); }
-/*------------------------------------------------------------------------------*/
-/* (I) va_list Arguments : Liste d'arguments contextuels                        */
-/*------------------------------------------------------------------------------*/
-NDT_Status  Default_Manager( NDT_Root  *, NDT_Index_Id, NDT_Command, va_list);
 
-/*------------------------------------------------------------------------------*/
+#define ND_HANDLER_NOT_NULL_CHECK( Function_Name, Function_Ptr)           if( ( !( Function_Name)) && ( !( Function_Ptr))) { LG_LOG_ERROR( "Undefined function name");       return( NDS_ERRAPI); }
-/* Redéfinition de la fonction malloc() avec retour de type NDT_Status          */
+#define ND_HANDLER_SYMBOL_FIND( Function_Ptr, Handler_Name, Handler_Ptr)  if( ( Handler_Ptr)) {  ( Function_Ptr) = ( Handler_Ptr);}  \
-/*------------------------------------------------------------------------------*/
+                                                                          else { if( ND_Symbol_Find( (void  **)&( Function_Ptr), ( Handler_Name)) != NDS_OK) { LG_LOG_ERROR( "Cant't find free handler function"); return( NDS_KO);}}
-NDT_Status ND_Default_Allocator( size_t Size, void  **ptr, void  *User);
 
-/*------------------------------------------------------------------------------*/
-/* Redéfinition de la fonction free() avec retour de type NDT_Status            */
-/*------------------------------------------------------------------------------*/
-NDT_Status ND_Default_Desallocator( void  *, void  *);
 
-/*------------------------------------------------------------------------------*/
-/* Création d'un noeud                                                          */
-/*------------------------------------------------------------------------------*/
-/* (I) Root     : adresse de la racine pour laquelle on crée un noeud           */
-/* (O) New_Node : adresse du pointeur sur le nouveau noeud                      */
-/*------------------------------------------------------------------------------*/
-NDT_Status ND_Node_Alloc (NDT_Root * Root, NDT_Node ** New_Node);
 
-/*------------------------------------------------------------------------------*/
-/* Destruction d'un noeud                                                       */
-/*------------------------------------------------------------------------------*/
-/* (I) Root : adresse de la racine dans laquelle on détruit un noeud            */
-/* (I) Node : pointeur sur le noeud à détruire                                  */
-/*------------------------------------------------------------------------------*/
-NDT_Status ND_Node_Free (NDT_Root * Root, NDT_Node * Node);
 
-/*------------------------------------------------------------------------------*/
-/* Création de la racine d'une structure de données quelconque                  */
-/*------------------------------------------------------------------------------*/
-/* (O) New_Root     : adresse du pointeur sur la nouvelle racine                */
-/* (I) Type         : type de la structure de données                           */
-/* (I) Allocater    : pointeur vers la fonction d'allocation                    */
-/* (I) Desallocater : pointeur vers la fonction de désallocation                */
-/* (I) Data         : pointeur de données utiles à l'allocateur                 */
-/*------------------------------------------------------------------------------*/
-NDT_Status  ND_Node_Root_Alloc( NDT_Root  **, NDT_Index_Nb, NDT_Index_Type[], char  *, NDT_Manager  *, char  *, NDT_Allocator  *, char  *, NDT_Desallocator  *, short, void  *);
 
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* Destruction d'une racine                                                     */
+/*----------------------------------------------------------------------------*/
-/*------------------------------------------------------------------------------*/
+/*       Fonctions et procédures privées de la librairie  (moyen niveau)      */
-/* (I) Root : pointeur sur la racine à détruire                                 */
+/*----------------------------------------------------------------------------*/
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-NDT_Status ND_Node_Root_Free (NDT_Root * Root);
 
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* Ajout d'un noeud à une liste chaînée                                         */
+/* Manager par défaut                                                         */
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* (I) Root     : pointeur sur la racine de la liste                            */
+/* (I) va_list Arguments : Liste d'arguments contextuels                      */
-/* (I) New_Node : pointeur sur le noeud à ajouter                               */
+/*----------------------------------------------------------------------------*/
-/*------------------------------------------------------------------------------*/
+NDT_Status  ND_Default_Manager( NDT_Root  *, NDT_Index_Id, NDT_Node  *, NDT_Command, va_list  *);
-NDT_Status ND_List_Node_Add (NDT_Root  *, NDT_Index_Id, NDT_Node  *);
 
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* Ajout d'une nouvelle valeur à une liste                                      */
+/* OpenStruct Manager                                                         */
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* (I) Root     : pointeur sur la racine de la liste                            */
+/* (I) va_list Arguments : Liste d'arguments contextuels                      */
-/* (I) Value    : pointeur sur la valeur à ajouter                              */
+/*----------------------------------------------------------------------------*/
-/*------------------------------------------------------------------------------*/
+NDT_Status  ND_OpenStruct_Manager( NDT_Root  *, NDT_Index_Id, NDT_Node  *, NDT_Command, va_list  *);
-NDT_Status ND_List_Value_Add (NDT_Root  *, NDT_Index_Id, void  *);
 
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* Ajout d'un noeud à un arbre binaire                                          */
+/* Redéfinition de la fonction malloc() avec retour de type NDT_Status        */
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* (I) Root     : pointeur sur la racine de l'arbre                             */
+NDT_Status  ND_Default_Allocator( void  **, NDT_Root  *, size_t, void  *);
-/* (I) Value    : pointeur sur la valeur à ajouter                              */
-/*------------------------------------------------------------------------------*/
-NDT_Status ND_Tree_Value_Add (NDT_Root  *, NDT_Index_Id, void  *);
 
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* Supprime le noeud d'une liste                                                */
+/* Redéfinition de la fonction free() avec retour de type NDT_Status          */
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* (I) Node  : pointeur sur le noeud à supprimer                                */
+NDT_Status  ND_Default_Deallocator( void  *, NDT_Root  *, void  *);
-/*------------------------------------------------------------------------------*/
-NDT_Status ND_List_Node_Remove (NDT_Node  *);
 
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* Conversion d'une structure en liste chaînée                                  */
+/* Création d'un noeud                                                        */
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* (I) Root : pointeur sur la racine du la structure à convertir                */
+/* (I) Root     : adresse de la racine pour laquelle on crée un noeud         */
-/*------------------------------------------------------------------------------*/
+/* (O) New_Node : adresse du pointeur sur le nouveau noeud                    */
-NDT_Status ND_List_Make (NDT_Root  *, NDT_Index_Id);
+/*----------------------------------------------------------------------------*/
+NDT_Status ND_Node_Alloc( NDT_Root * Root, NDT_Node ** New_Node);
 
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* Recherche une valeur dans une liste et retourne le noeud correspondant       */
+/* Destruction d'un noeud                                                     */
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-NDT_Node * ND_List_Node_Find (NDT_Root  *, NDT_Index_Id, void  *, va_list);
+/* (I) Root : adresse de la racine dans laquelle on détruit un noeud          */
+/* (I) Node : pointeur sur le noeud à détruire                                */
+/*----------------------------------------------------------------------------*/
+NDT_Status  ND_Node_Free( NDT_Root  *, NDT_Node  *);
 
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* Recherche un noeud dans un arbre et retourne le pointeur sur le noeud        */
+/* Création d'une nouvelle structure de données                               */
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-NDT_Node  *ND_Tree_Node_Find( NDT_Root *, NDT_Index_Id, void  *, va_list);
+/* (O) Root: adresse d'un pointeur sur la racine de la nouvelle structure     */
+/* (I) Type: type de la structure.de données (liste ou arbre binaire)         */
+/* (I) Allocator: pointeur vers la fonction d'allocation                      */
+/* (I) Deallocator: pointeur vers la fonction de désallocation                */
+/* (I) Data : pointeur de données utiles à l'allocateur                       */
+/* (I) Own_Value : indique si la structure est propriétaire de ses valeurs    */
+/*----------------------------------------------------------------------------*/
+NDT_Status  ND_Index_Clear( NDT_Root  *, NDT_Index_Id);
 
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* Conversion d'une structure en arbre binaire                                  */
+/* Destruction d'une racine                                                   */
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* (I) Root : pointeur sur la racine du la structure à convertir                */
+/* (I) Root : pointeur sur la racine à détruire                               */
-/* (I) Type : type du futur arbre                                               */
+/*----------------------------------------------------------------------------*/
-/*------------------------------------------------------------------------------*/
+NDT_Status  ND_Node_Root_Free( NDT_Root  *);
-NDT_Status ND_Tree_Make (NDT_Root  *, NDT_Index_Id);
 
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* Equilibrage d'un arbre                                                       */
+/* Ajout d'un noeud à une liste chaînée                                       */
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* (I) Root : pointeur sur la racine de l'arbre                                 */
+/* (I) Root     : pointeur sur la racine de la liste                          */
-/*------------------------------------------------------------------------------*/
+/* (I) New_Node : pointeur sur le noeud à ajouter                             */
-NDT_Status ND_Tree_Equalize (NDT_Root  *, NDT_Index_Id);
+/*----------------------------------------------------------------------------*/
+NDT_Status  ND_List_Node_Add( NDT_Root  *, NDT_Index_Id, NDT_Node  *);
 
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* Retourne la profondeur de la plus grande branche à partir d'un noeud         */
+/* Ajout d'une nouvelle valeur à une liste                                    */
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* (I) Node : pointeur sur le noeud                                             */
+/* (I) Root     : pointeur sur la racine de la liste                          */
-/*------------------------------------------------------------------------------*/
+/* (I) Value    : pointeur sur la valeur à ajouter                            */
-long ND_Tree_MaxDepth_Get (NDT_Node  *Node);
+/*----------------------------------------------------------------------------*/
+NDT_Status  ND_List_Value_Add( NDT_Root  *, NDT_Index_Id, void  *);
 
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* Retourne la profondeur de la plus petite branche à partir d'un noeud         */
+/* Ajout d'un noeud à un arbre binaire                                        */
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* (I) Node : pointeur sur le noeud                                             */
+/* (I) Root     : pointeur sur la racine de l'arbre                           */
-/*------------------------------------------------------------------------------*/
+/* (I) Value    : pointeur sur la valeur à ajouter                            */
-long ND_Tree_MinDepth_Get (NDT_Node  *Node);
+/*----------------------------------------------------------------------------*/
+NDT_Status  ND_Tree_Value_Add( NDT_Root  *, NDT_Index_Id, void  *);
 
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* Ajout d'un noeud à un arbre binaire                                          */
+/* Supprime le noeud d'une liste                                              */
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* (I) Root    : pointeur sur la racine de l'arbre                              */
+/* (I) Node  : pointeur sur le noeud à supprimer                              */
-/* (I) Node : pointeur sur le noeud à ajouter                                   */
+/*----------------------------------------------------------------------------*/
-/*------------------------------------------------------------------------------*/
+NDT_Status  ND_List_Node_Remove( NDT_Node  *);
-NDT_Status ND_Tree_Node_Add (NDT_Root  *, NDT_Index_Id, NDT_Node  *);
 
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* Ajoute tous les noeud d'une liste à un arbre                                 */
+/* Conversion d'une structure en liste chaînée                                */
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* (I) Tree_Root : pointeur sur la racine de l'arbre                            */
+/* (I) Root : pointeur sur la racine du la structure à convertir              */
-/* (I) List_Root : pointeur sur la racine de la liste                           */
+/*----------------------------------------------------------------------------*/
-/*------------------------------------------------------------------------------*/
+NDT_Status  ND_List_Make( NDT_Root  *, NDT_Index_Id);
-NDT_Status ND_Tree_List_Add (NDT_Root *, NDT_Index_Id, NDT_Root  *, NDT_Index_Id);
 
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* Fonction de comparaison de noeuds (pour le quick sort)                       */
+/* Recherche une valeur dans une liste et retourne le noeud correspondant     */
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-int ND_Node_Compare (void ** Node1, void ** Node2);
+NDT_Node  *ND_List_Node_Find( NDT_Root  *, NDT_Index_Id, void  *, va_list  *);
 
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* Ordonne une liste chaînée selon l'algorithme du tri à bulle                  */
+/* Recherche un noeud dans un arbre et retourne le pointeur sur le noeud      */
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/* (I) Root : pointeur sur la racine de la liste à trier                        */
+NDT_Node  *ND_Tree_Node_Find( NDT_Root  *, NDT_Index_Id, void  *, va_list  *);
-/*------------------------------------------------------------------------------*/
-NDT_Status ND_List_Sort (NDT_Root  *, NDT_Index_Id);
 
-/*------------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
-/*------------------------------------------------------------------------------*/
+/* Conversion d'une structure en arbre binaire                                */
-/*       Fonctions et procédures privées de la librairie  (bas niveau)          */
+/*----------------------------------------------------------------------------*/
-/*------------------------------------------------------------------------------*/
+/* (I) Root : pointeur sur la racine du la structure à convertir              */
-/*------------------------------------------------------------------------------*/
+/* (I) Type : type du futur arbre                                             */
+/*----------------------------------------------------------------------------*/
+NDT_Status  ND_Tree_Make( NDT_Root  *, NDT_Index_Id);
 
-void ND_List_Check (NDT_Root *, NDT_Index_Id, int *, int *, FILE *);
+/*----------------------------------------------------------------------------*/
+/* Equilibrage d'un arbre                                                     */
+/*----------------------------------------------------------------------------*/
+/* (I) Root : pointeur sur la racine de l'arbre                               */
+/*----------------------------------------------------------------------------*/
+NDT_Status  ND_Tree_Equalize( NDT_Root  *, NDT_Index_Id);
 
-void ND_List_Link_Check (NDT_Root *, NDT_Index_Id, int *, int *, FILE *);
+/*----------------------------------------------------------------------------*/
+/* Retourne la profondeur de la plus grande branche à partir d'un noeud       */
+/*----------------------------------------------------------------------------*/
+/* (I) Node : pointeur sur le noeud                                           */
+/*----------------------------------------------------------------------------*/
+long  ND_Tree_MaxDepth_Get( NDT_Node  *);
 
-void ND_Value_Check (NDT_Root *, NDT_Index_Id, int *, int *, FILE *);
+/*----------------------------------------------------------------------------*/
+/* Retourne la profondeur de la plus petite branche à partir d'un noeud       */
+/*----------------------------------------------------------------------------*/
+/* (I) Node : pointeur sur le noeud                                           */
+/*----------------------------------------------------------------------------*/
+long  ND_Tree_MinDepth_Get( NDT_Node  *);
 
-void ND_Tree_Check (NDT_Root *, NDT_Index_Id, int *, int *, FILE *);
+/*----------------------------------------------------------------------------*/
+/* Ajout d'un noeud à un arbre binaire                                        */
+/*----------------------------------------------------------------------------*/
+/* (I) Root    : pointeur sur la racine de l'arbre                            */
+/* (I) Node : pointeur sur le noeud à ajouter                                 */
+/*----------------------------------------------------------------------------*/
+NDT_Status  ND_Tree_Node_Add( NDT_Root  *, NDT_Index_Id, NDT_Node  *);
 
-void ND_Tree_Link_Check (NDT_Root *, NDT_Index_Id, int *, int *, FILE *);
+/*----------------------------------------------------------------------------*/
+/* Ajoute tous les noeud d'une liste à un arbre                               */
+/*----------------------------------------------------------------------------*/
+/* (I) Tree_Root : pointeur sur la racine de l'arbre                          */
+/* (I) List_Root : pointeur sur la racine de la liste                         */
+/*----------------------------------------------------------------------------*/
+NDT_Status  ND_Tree_List_Add( NDT_Root  *, NDT_Index_Id, NDT_Root  *, NDT_Index_Id);
 
-NDT_Status ND_List_Recursive_Make (NDT_Node *, NDT_Root *, NDT_Index_Id);
+/*----------------------------------------------------------------------------*/
+/* Fonction de comparaison de noeuds (pour le quick sort)                     */
+/*----------------------------------------------------------------------------*/
+int  ND_Node_Compare( void  **, void  **);
 
-NDT_Node * ND_Tree_Recursive_Make (long, long, NDT_Node *);
+/*----------------------------------------------------------------------------*/
+/* Ordonne une liste chaînée selon l'algorithme du tri à bulle                */
+/*----------------------------------------------------------------------------*/
+/* (I) Root : pointeur sur la racine de la liste à trier                      */
+/*----------------------------------------------------------------------------*/
+NDT_Status  ND_List_Sort( NDT_Root  *, NDT_Index_Id);
 
-void ND_Tree_Node_Recursive_Add( NDT_Root *, NDT_Index_Id, NDT_Node *, NDT_Node **, long , NDT_Node *);
 
-NDT_Node * ND_Tree_Node_First_Recursive_Get (NDT_Node * Node);
 
-NDT_Node * ND_Tree_Node_Last_Recursive_Get (NDT_Node * Node);
 
-NDT_Node * ND_Tree_Node_Recursive_Find (NDT_Node * Node, void * Value, va_list);
 
-NDT_Node * ND_Tree_Parent_Next_Recursive_Get (NDT_Node * Node);
+/*----------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
+/*                              PRIVATE FUNCTIONS                             */
+/*----------------------------------------------------------------------------*/
+/*----------------------------------------------------------------------------*/
 
-NDT_Node * ND_Tree_Parent_Previous_Recursive_Get (NDT_Node * Node);
+/*----------------------------------------------------------------------------*/
+/* Init handler:                                                              */
+/*     - Return extra root size                                               */
+/*     - Update handler tab                                                   */
+/*----------------------------------------------------------------------------*/
+/* (O) Root_Extra_Size_Ptr: Pointer on the extra root size                    */
+/* (I) User_Ptr:            User pointer                                      */
+/*----------------------------------------------------------------------------*/
 
-void ND_Tree_Recursive_Print (NDT_Node * Node, long Depth, FILE *);
+NDT_Status  ND_Handler_Init_Default( NDT_Root  **root_tmp_ptr_ptr, NDT_DataStruct_Name  Name, NDT_Index_Nb  Index_Nb, NDT_Index_Type  *Type_Ptr, NDT_Handler  *Handler_Tab, short  Own_Value, void  *User_Ptr);
 
-void ND_Tree_Link_Recursive_Check (NDT_Node * Node, int *, int *, FILE *);
 
-void * ND_Symbol_Find (const char *);
 
-void ND_Error_Print (void);
+/*----------------------------------------------------------------------------*/
+/* Default alloc handler:                                                     */
+/* malloc() function wrapper with NDT_Status return status                    */
+/*----------------------------------------------------------------------------*/
+/* (O) Memory_Ptr_Ptr: Memory pointer address                                 */
+/* (I) Root_Ptr:       Data structure pointer                                 */
+/* (I) Size:           Allocation size                                        */
+/* (I) User_Ptr:       User pointer                                           */
+/*----------------------------------------------------------------------------*/
+
+NDT_Status  ND_Handler_Alloc_Default( void  **Memory_Ptr_Ptr, NDT_Root  *Root_Ptr, size_t  Size, void  *User_Ptr);
+
+
+
+/*----------------------------------------------------------------------------*/
+/* Default free handler:                                                      */
+/* free() function wrapper with NDT_Status return status                      */
+/*----------------------------------------------------------------------------*/
+/* (I) Memory_Ptr:     Memory pointer                                         */
+/* (I) Root_Ptr:       Data structure pointer                                 */
+/* (I) User_Ptr:       User pointer                                           */
+/*----------------------------------------------------------------------------*/
+
+NDT_Status  ND_Handler_Free_Default( void  *Memory_Ptr, NDT_Root  *Root_Ptr, void  *User_Ptr);
+
+
+
+/*----------------------------------------------------------------------------*/
+/* Default open handler                                                       */
+/*----------------------------------------------------------------------------*/
+/* (I) Root_Ptr:          Data structure pointer                              */
+/* (I) Open_Mode:         Open mode                                           */
+/* (I) Handler_Open_Name: Free handler function name                          */
+/* (I) Handler_Open_Ptr:  Free handler function pointer                       */
+/* (I) User_Ptr:          User pointer                                        */
+/*----------------------------------------------------------------------------*/
+
+NDT_Status  ND_Handler_Open_Default( NDT_Root  **Root_Ptr_Ptr, NDT_Root  *Root_Tmp_Ptr, NDT_Open_Flag  Open_Mode);
+
+
+
+/*----------------------------------------------------------------------------*/
+/* Default close handler                                                      */
+/*----------------------------------------------------------------------------*/
+/* (I) Root_Ptr:           Data structure pointer                             */
+/* (I) Close_Mode:         Close mode                                         */
+/* (I) Handler_Close_Name: Free handler function name                         */
+/* (I) Handler_Close_Ptr:  Free handler function pointer                      */
+/* (I) User_Ptr:           User pointer                                       */
+/*----------------------------------------------------------------------------*/
+
+NDT_Status  ND_Handler_Close_Default( NDT_Root  *Root_Ptr, NDT_Close_Flag  Close_Mode, void  *User_Ptr);
+
+
+
+/*----------------------------------------------------------------------------*/
+/* Default info handler                                                       */
+/*----------------------------------------------------------------------------*/
+/* (I) Root_Ptr:         Data structure pointer                               */
+/* (I) Recursive_Offset: Print line offset                                    */
+/*----------------------------------------------------------------------------*/
+
+NDT_Status  ND_Handler_Info_Default( NDT_Root  *Root_Ptr, NDT_Recursive_Offset  Recursive_Offset);
+
+
+
+/*----------------------------------------------------------------------------*/
+/* Default lock handler                                                       */
+/*----------------------------------------------------------------------------*/
+/* (I) Root_Ptr:          Data structure pointer                              */
+/* (I) Open_Mode:         Lock mode                                           */
+/* (O) Locked_Ptr:        Locked flag                                         */
+/* (I) Handler_Lock_Name: Free handler function name                          */
+/* (I) Handler_Lock_Ptr:  Free handler function pointer                       */
+/* (I) User_Ptr:          User pointer                                        */
+/*----------------------------------------------------------------------------*/
+
+NDT_Status  ND_Handler_Lock_Default( NDT_Root  *Root_Ptr, NDT_Lock_Flag  Lock_Mode, bool  *Locked_Ptr, void  *User_Ptr);
+
+
+
+/*----------------------------------------------------------------------------*/
+/* Defalt unlock handler                                                      */
+/*----------------------------------------------------------------------------*/
+/* (I) Root_Ptr:            Data structure pointer                            */
+/* (I) Handler_Unlock_Name: Free handler function name                        */
+/* (I) Handler_Unlock_Ptr:  Free handler function pointer                     */
+/* (I) User_Ptr:            User pointer                                      */
+/*----------------------------------------------------------------------------*/
+
+NDT_Status  ND_Handler_Unlock_Default( NDT_Root  *Root_Ptr, void  *User_Ptr);
+
+
+
+
+/*----------------------------------------------------------------------------*/
+
+void  ND_List_Check( NDT_Root  *, NDT_Index_Id, int  *, int  *, FILE  *);
+
+void  ND_List_Link_Check( NDT_Root  *, NDT_Index_Id, int  *, int  *, FILE  *);
+
+void  ND_Value_Check( NDT_Root  *, NDT_Index_Id, int  *, int  *, FILE  *);
+
+void  ND_Tree_Check( NDT_Root  *, NDT_Index_Id, int  *, int  *, FILE  *);
+
+void  ND_Tree_Link_Check( NDT_Root  *, NDT_Index_Id, int  *, int  *, FILE  *);
+
+NDT_Status  ND_List_Recursive_Make( NDT_Node  *, NDT_Root  *, NDT_Index_Id);
+
+NDT_Node  *ND_Tree_Recursive_Make( long, long, NDT_Node  *);
+
+void  ND_Tree_Node_Recursive_Add( NDT_Root  *, NDT_Index_Id, NDT_Node  *, NDT_Node  **, long , NDT_Node  *);
+
+NDT_Node  *ND_Tree_Node_First_Recursive_Get( NDT_Node  *);
+
+NDT_Node  *ND_Tree_Node_Last_Recursive_Get( NDT_Node  *);
+
+NDT_Node  *ND_Tree_Node_Recursive_Find( NDT_Node  *, void  *, va_list  *);
+
+NDT_Node  *ND_Tree_Parent_Next_Recursive_Get( NDT_Node  *);
+
+NDT_Node  *ND_Tree_Parent_Previous_Recursive_Get( NDT_Node  *);
+
+void  ND_Tree_Recursive_Print( NDT_Node  *, long, FILE  *);
+
+void  ND_Tree_Link_Recursive_Check( NDT_Node  *, int  *, int  *, FILE  *);
+
+NDT_Status  ND_Symbol_Find( void  **, const char  *);
+
+void  ND_Signal_Trap( int);
+
+NDT_Status  ND_Address_Check( void  *);
+
+
+
+
+
+/*----------------------------------------------------------------------------*/
+/* Post prototype global variable definitions                                 */
+/*----------------------------------------------------------------------------*/
+
+NDT_Handler  NDG_Handler_Tab_Default[ NDD_HANDLER_NB] =
+{
+    { "",                                                                             /* Default Manager function name    */
+      NULL},                                                                          /* Default Manager function pointer */    
+    { "ND_Handler_Init_Default",                                                      /* Default Init function name       */
+      ( NDT_Handler_Function  *)ND_Handler_Init_Default},                             /* Default Init function pointer    */    
+    { "ND_Handler_Alloc_Default",                                                     /* Default Alloc function name      */
+      ( NDT_Handler_Function  *)ND_Handler_Alloc_Default},                            /* Default Alloc function pointer   */    
+    { "ND_Handler_Free_Default",                                                      /* Default Free function name       */
+      ( NDT_Handler_Function  *)ND_Handler_Free_Default},                             /* Default Free function pointer    */    
+    { "NDT_Handler_Open_Default",                                                     /* Default Open function name       */
+      ( NDT_Handler_Function  *)ND_Handler_Open_Default},                             /* Default Open function pointer    */    
+    { "NDT_Handler_Close_Default",                                                    /* Default Close function name      */
+      ( NDT_Handler_Function  *)ND_Handler_Close_Default},                            /* Default Close function pointer   */
+    { "NDT_Handler_Info_Default",                                                     /* Default Info function name       */
+      ( NDT_Handler_Function  *)ND_Handler_Info_Default},                             /* Default Info function pointer    */    
+    { "NDT_Handler_Lock_Default",                                                     /* Default Lock function name       */
+      ( NDT_Handler_Function  *)ND_Handler_Lock_Default},                             /* Default Lock function pointer    */    
+    { "NDT_Handler_Unlock_Default",                                                   /* Default Unlock function name     */
+      ( NDT_Handler_Function  *)ND_Handler_Unlock_Default}                            /* Default Unlock function pointer  */    
+};
 
-void ND_Signal_Trap (int);
 
-NDT_Status ND_Address_Check (void * Address);

lib/libnode.rc

@@ -0,0 +1,109 @@
+//Microsoft Developer Studio generated resource script.
+//
+#include "resource.h"
+
+#define APSTUDIO_READONLY_SYMBOLS
+/////////////////////////////////////////////////////////////////////////////
+//
+// Generated from the TEXTINCLUDE 2 resource.
+//
+#include "afxres.h"
+
+/////////////////////////////////////////////////////////////////////////////
+#undef APSTUDIO_READONLY_SYMBOLS
+
+/////////////////////////////////////////////////////////////////////////////
+// English (U.K.) resources
+
+#if !defined(AFX_RESOURCE_DLL) || defined(AFX_TARG_ENG)
+#ifdef _WIN32
+LANGUAGE LANG_ENGLISH, SUBLANG_ENGLISH_UK
+#pragma code_page(1252)
+#endif //_WIN32
+
+#ifdef APSTUDIO_INVOKED
+/////////////////////////////////////////////////////////////////////////////
+//
+// TEXTINCLUDE
+//
+
+1 TEXTINCLUDE DISCARDABLE 
+BEGIN
+    "resource.h\0"
+END
+
+2 TEXTINCLUDE DISCARDABLE 
+BEGIN
+    "#include ""afxres.h""\r\n"
+    "\0"
+END
+
+3 TEXTINCLUDE DISCARDABLE 
+BEGIN
+    "\r\n"
+    "\0"
+END
+
+#endif    // APSTUDIO_INVOKED
+
+
+#ifndef _MAC
+/////////////////////////////////////////////////////////////////////////////
+//
+// Version
+//
+
+VS_VERSION_INFO VERSIONINFO
+ FILEVERSION 0,0,0,0
+ PRODUCTVERSION 0,0,0,0
+ FILEFLAGSMASK 0x3fL
+#ifdef _DEBUG
+ FILEFLAGS 0x1L
+#else
+ FILEFLAGS 0x0L
+#endif
+ FILEOS 0x40004L
+ FILETYPE 0x2L
+ FILESUBTYPE 0x0L
+BEGIN
+    BLOCK "StringFileInfo"
+    BEGIN
+        BLOCK "080904b0"
+        BEGIN
+            VALUE "Comments", "Memory list or tree node structures management library\0"
+            VALUE "CompanyName", "Rx3\0"
+            VALUE "FileDescription", "Node Library\0"
+            VALUE "FileVersion", "$Revision: 1.3 $\0"
+            VALUE "InternalName", "libnode\0"
+            VALUE "LegalCopyright", "GNU Lesser General Public Licence (LGPL) V 2.1\0"
+            VALUE "LegalTrademarks", "\0"
+            VALUE "OriginalFilename", "libnode.dll\0"
+            VALUE "PrivateBuild", "\0"
+            VALUE "ProductName", "libnode\0"
+            VALUE "ProductVersion", "$Name:  $\0"
+            VALUE "SpecialBuild", "\0"
+        END
+    END
+    BLOCK "VarFileInfo"
+    BEGIN
+        VALUE "Translation", 0x809, 1200
+    END
+END
+
+#endif    // !_MAC
+
+#endif    // English (U.K.) resources
+/////////////////////////////////////////////////////////////////////////////
+
+
+
+#ifndef APSTUDIO_INVOKED
+/////////////////////////////////////////////////////////////////////////////
+//
+// Generated from the TEXTINCLUDE 3 resource.
+//
+
+
+/////////////////////////////////////////////////////////////////////////////
+#endif    // not APSTUDIO_INVOKED
+

lib/resource.h

@@ -0,0 +1,15 @@
+//{{NO_DEPENDENCIES}}
+// Microsoft Developer Studio generated include file.
+// Used by libnode.rc
+//
+
+// Next default values for new objects
+// 
+#ifdef APSTUDIO_INVOKED
+#ifndef APSTUDIO_READONLY_SYMBOLS
+#define _APS_NEXT_RESOURCE_VALUE        101
+#define _APS_NEXT_COMMAND_VALUE         40001
+#define _APS_NEXT_CONTROL_VALUE         1000
+#define _APS_NEXT_SYMED_VALUE           101
+#endif
+#endif

libnode.spec

@@ -0,0 +1,84 @@
+Name:              libnode
+Version:           2.3.0
+
+%define release_nb 1
+
+Release:           %{release_nb}rx3
+
+
+
+%define libnode_name  %{name}-%{version}-%{release_nb}
+%define source        %{libnode_name}.tar.tgz
+
+
+
+Summary:      Manages generic list and/or tree node structures
+Copyright:    GPL/LGPL
+Group:        Application/Utilitaires
+Distribution: Rx3 OpenSource
+Vendor:       Rx3
+Packager:     Arnaud G. GIBERT <arnaud@rx3.net>
+
+Source:       https://git.rx3.org/gitea/rx3/%{name}/archive/%{source}
+Url:          https://git.rx3.org/gitea/rx3/%{name}
+BuildRoot:    %{_tmppath}/%{libnode_name}-buildroot
+AutoReqProv:  no
+
+
+
+%description
+Manages generic list and/or tree node structures.
+
+
+
+%files
+/usr
+
+
+
+%build
+rm -rf %{libnode_name}
+tar -xzvvf /usr/src/RPM/SOURCES/%{source}
+cd %{libnode_name}
+make clean
+make all
+
+
+
+%install
+cd %{libnode_name}
+make install ROOT=$RPM_BUILD_ROOT
+
+
+
+%clean
+rm -rf %{libnode_name}
+rm -rf $RPM_BUILD_ROOT
+
+
+
+%changelog
+* Wed Aug 16 2023 Arnaud G. GIBERT <arnaud@rx3.net> 2.3.0-1rx3
+- Update to 2.3.0 release,
+- Update Source and URL entry.
+
+* Sun Jun  6 2010 Arnaud G. GIBERT <arnaud@rx3.net> 2.2.0-1rx3
+- Update to 2.2.0 release,
+- Update Source and URL entry.
+
+* Mon Jan 24 2005 Arnaud G. GIBERT <arnaud@rx3.net> 2.1.0-1rx3
+- Update to 2.1.0 release,
+- Now use "rx3" as release suffix,
+- Fix copyright entry.
+
+* Wed Jan 19 2005 Arnaud G. GIBERT <arnaud@rx3.net> 2.0.7-1
+- Update to 2.0.7 release.
+
+* Tue Aug 24 2004 Arnaud G. GIBERT <arnaud@rx3.net> 2.0.6-1
+- Update to 2.0.6 release.
+
+* Tue Jul 15 2003 Arnaud G. GIBERT <arnaud@rx3.net> - 2.0.5-1
+- Add release in libnode dir name support.
+
+* Tue Jul 15 2003 Marc REGIMBEAU <marc.regimbeau@flomaco.net> - 2.0.4-2
+- Initial release of this spec file.

util/Makefile

@@ -1,8 +1,54 @@
+SRC      := ndbench.c
+TARGETS  := ndbench ndbench-c ndbench-static ndbench-static-c
+FILE_BIN := ndbench ndbench-c ndbench-static ndbench-static-c
+FILE_LIB := *.ndb
+FILE_DOC := ndbench.xls
 
-all: ndbench
 
-ndbench: ndbench.c ../../libver/ver.h ../lib/node.h ../../libver/libver.so ../lib/libnode.so Makefile
-	gcc -g -o ndbench -I ../../libver -I ../lib -ldl ../../libver/libver.so ../lib/libnode.so ndbench.c
 
-clean:
+include ../Makefile.var
-	rm ndbench
+include ../Makefile.rule
+
+
+
+DEP_STATIC  += ../lib/libnode.a      ../../liblog/lib/liblog.a  
+DEP_DYNAMIC += ../lib/libnode.so     ../../liblog/lib/liblog.so
+INCLUDE     += -I . -I ../include -I ../../liblog/include
+LIBDIR      += -L . -L ../lib     -L ../../liblog/lib
+LIB_STATIC  += ../lib/libnode.a      ../../liblog/lib/liblog.a  -ldl
+LIB_DYNAMIC += -lnode  -llog -ldl
+CFLAGS      += -rdynamic
+
+ifdef _LIBVER_SUPPORT
+	DEP_STATIC  += ../../libver/ver.h ../../libver/libver.a
+	DEP_DYNAMIC += ../../libver/ver.h ../../libver/libver.so
+	INCLUDE     += -I ../../libver/lib
+	LIBDIR      += -L ../../libver/lib
+
+        ifeq ($(OSTYPE),linux-gnu)
+                LIB_STATIC  += ../../libver/lib/libver.a
+                LIB_DYNAMIC += -lver
+        else
+                LIB_STATIC  += ../../libver/lib/libver.a
+                LIB_DYNAMIC += -lver
+        endif
+
+        CFLAGS              += -D_LIBVER_SUPPORT
+endif
+
+ND_CHECK_FLAGS   = -DND_MODE=0
+ND_NOCHECK_FLAGS = -DND_MODE=1
+
+
+
+ndbench: ndbench.c $(DEP_DYNAMIC)
+	$(CC) -o $@ $(CFLAGS)  $(ND_NOCHECK_FLAGS) $(INCLUDE) $(LIBDIR) $(LIB_DYNAMIC) $<
+
+ndbench-c: ndbench.c $(DEP_DYNAMIC)
+	$(CC) -o $@ $(CFLAGS)  $(ND_CHECK_FLAGS)   $(INCLUDE) $(LIBDIR) $(LIB_DYNAMIC) $<
+
+ndbench-static: ndbench.c $(DEP_STATIC)
+	$(CC) -o $@ $(CFLAGS)  $(ND_NOCHECK_FLAGS) $(INCLUDE) $< $(LIB_STATIC)
+
+ndbench-static-c: ndbench.c $(DEP_STATIC)
+	$(CC) -o $@ $(CFLAGS)  $(ND_CHECK_FLAGS)   $(INCLUDE) $< $(LIB_STATIC)

util/ndbench.dsp

@@ -37,19 +37,20 @@ RSC=rc.exe
 # PROP BASE Target_Dir ""
 # PROP Use_MFC 0
 # PROP Use_Debug_Libraries 0
-# PROP Output_Dir "Release"
+# PROP Output_Dir ""
 # PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
 # PROP Target_Dir ""
 # ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
-# ADD CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /MD /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
 # ADD BASE RSC /l 0x809 /d "NDEBUG"
 # ADD RSC /l 0x809 /d "NDEBUG"
 BSC32=bscmake.exe
 # ADD BASE BSC32 /nologo
 # ADD BSC32 /nologo
 LINK32=link.exe
-# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
-# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib libnode.lib /nologo /subsystem:console /incremental:yes /machine:I386
 
 !ELSEIF  "$(CFG)" == "ndbench - Win32 Debug"
 
@@ -60,21 +61,21 @@ LINK32=link.exe
 # PROP BASE Target_Dir ""
 # PROP Use_MFC 0
 # PROP Use_Debug_Libraries 1
-# PROP Output_Dir "Debug"
+# PROP Output_Dir ""
 # PROP Intermediate_Dir "Debug"
 # PROP Ignore_Export_Lib 0
 # PROP Target_Dir ""
-# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ  /c
+# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
-# ADD CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ  /c
+# ADD CPP /nologo /MDd /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /FR /YX /FD /GZ /c
 # ADD BASE RSC /l 0x809 /d "_DEBUG"
 # ADD RSC /l 0x809 /d "_DEBUG"
 BSC32=bscmake.exe
 # ADD BASE BSC32 /nologo
 # ADD BSC32 /nologo
 LINK32=link.exe
-# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib  kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
-# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib libnode.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib libnoded.lib /nologo /subsystem:console /debug /machine:I386 /out:"ndbenchd.exe" /pdbtype:sept
-# SUBTRACT LINK32 /pdb:none
+# SUBTRACT LINK32 /profile /pdb:none
 
 !ENDIF 
 

util/test-10-s.ndb

@@ -0,0 +1,10 @@
+Lib_Open 0
+DS_Open 1
+Index_List_Open 0-0
+DS_Value_Add 1-10 0
+DS_Value_Find 1-10
+Index_List_To_Tree 0-0
+DS_Value_Find 1-10
+DS_Check
+DS_Close
+Lib_Close

util/test-10.ndb

@@ -0,0 +1,10 @@
+Lib_Open 0
+DS_Open 0
+Index_List_Open 0-0
+DS_Value_Add 1-10 0
+DS_Value_Find 1-10
+Index_List_To_Tree 0-0
+DS_Value_Find 1-10
+DS_Check
+DS_Close
+Lib_Close

util/test-100K-s.ndb

@@ -0,0 +1,10 @@
+Lib_Open 0
+DS_Open 1
+Index_List_Open 0-0
+DS_Value_Add 1-100000 0
+DS_Value_Find 49900-50100
+Index_List_To_Tree 0-0
+DS_Value_Find 1-100000
+DS_Check
+DS_Close
+Lib_Close

util/test-100K.ndb

@@ -1,4 +1,5 @@
-DS_Open
+Lib_Open 0
+DS_Open 0
 Index_List_Open 0-0
 DS_Value_Add 1-100000 0
 DS_Value_Find 49900-50100
@@ -6,3 +7,4 @@ Index_List_To_Tree 0-0
 DS_Value_Find 1-100000
 DS_Check
 DS_Close
+Lib_Close

util/test-10K-s.ndb

@@ -0,0 +1,10 @@
+Lib_Open 0
+DS_Open 1
+Index_List_Open 0-0
+DS_Value_Add 1-10000 0
+DS_Value_Find 4000-6000
+Index_List_To_Tree 0-0
+DS_Value_Find 1-10000
+DS_Check
+DS_Close
+Lib_Close

util/test-10K.ndb

@@ -1,4 +1,5 @@
-DS_Open
+Lib_Open 0
+DS_Open 0
 Index_List_Open 0-0
 DS_Value_Add 1-10000 0
 DS_Value_Find 4000-6000
@@ -6,3 +7,4 @@ Index_List_To_Tree 0-0
 DS_Value_Find 1-10000
 DS_Check
 DS_Close
+Lib_Close

util/test-10M-s.ndb

@@ -0,0 +1,10 @@
+Lib_Open 0
+DS_Open 1
+Index_List_Open 0-0
+DS_Value_Add 1-10000000 0
+DS_Value_Find 4999990-5000010
+Index_List_To_Tree 0-0
+DS_Value_Find 1-10000000
+DS_Check
+DS_Close
+Lib_Close

util/test-10M.ndb

@@ -0,0 +1,10 @@
+Lib_Open 0
+DS_Open 0
+Index_List_Open 0-0
+DS_Value_Add 1-10000000 0
+DS_Value_Find 4999990-5000010
+Index_List_To_Tree 0-0
+DS_Value_Find 1-10000000
+DS_Check
+DS_Close
+Lib_Close

util/test-1M-s.ndb

@@ -0,0 +1,10 @@
+Lib_Open 0
+DS_Open 1
+Index_List_Open 0-0
+DS_Value_Add 1-1000000 0
+DS_Value_Find 499990-500010
+Index_List_To_Tree 0-0
+DS_Value_Find 1-1000000
+DS_Check
+DS_Close
+Lib_Close

util/test-1M.ndb

@@ -1,4 +1,5 @@
-DS_Open
+Lib_Open 0
+DS_Open 0
 Index_List_Open 0-0
 DS_Value_Add 1-1000000 0
 DS_Value_Find 499990-500010
@@ -6,3 +7,4 @@ Index_List_To_Tree 0-0
 DS_Value_Find 1-1000000
 DS_Check
 DS_Close
+Lib_Close

util/test-all.ndb

@@ -1,3 +1,11 @@
+Batch_Run test-error.ndb
+Batch_Run test-10.ndb
+Batch_Run test-10-s.ndb
 Batch_Run test-10K.ndb
+Batch_Run test-10K-s.ndb
 Batch_Run test-100K.ndb
+Batch_Run test-100K-s.ndb
 Batch_Run test-1M.ndb
+Batch_Run test-1M-s.ndb
+Batch_Run test-10M.ndb
+Batch_Run test-10M-s.ndb

util/test-error.ndb

@@ -0,0 +1,15 @@
+DS_Open 0
+Lib_Open 0
+DS_Open 0
+Index_List_Open 0-0
+DS_Value_Add 1-10 0
+Lib_Close
+Lib_Open 1
+DS_Open 0
+Index_List_Open 0-0
+DS_Value_Add 1-10 0
+Index_Value_Break 0-0 0
+Index_Value_Break 0-0 1
+Index_Value_Break 0-0 2
+DS_Check
+Lib_Close