From 2787a45c436c35fc6fd0ed452903ad045fe9571d Mon Sep 17 00:00:00 2001 From: Werner Almesberger Date: Fri, 19 Nov 2010 19:17:47 -0300 Subject: [PATCH] qpkg: added James S. Plank's red-black trees --- qpkg/LICENSE.jrb | 526 +++++++++++++++++++++++++++++++++++ qpkg/Makefile | 5 +- qpkg/README.jrb | 34 +++ qpkg/jrb.c | 695 +++++++++++++++++++++++++++++++++++++++++++++++ qpkg/jrb.h | 126 +++++++++ qpkg/jval.c | 196 +++++++++++++ qpkg/jval.h | 94 +++++++ 7 files changed, 1674 insertions(+), 2 deletions(-) create mode 100644 qpkg/LICENSE.jrb create mode 100644 qpkg/README.jrb create mode 100644 qpkg/jrb.c create mode 100644 qpkg/jrb.h create mode 100644 qpkg/jval.c create mode 100644 qpkg/jval.h diff --git a/qpkg/LICENSE.jrb b/qpkg/LICENSE.jrb new file mode 100644 index 0000000..86c177b --- /dev/null +++ b/qpkg/LICENSE.jrb @@ -0,0 +1,526 @@ +Copyright (C) 1991, 1999 Free Software Foundation, Inc. +59 Temple Place, Suite 330, Boston, MA 02111-1307 USA +Everyone is permitted to copy and distribute verbatim copies +of this license document, but changing it is not allowed. + +[This is the first released version of the Lesser GPL. It also counts + as the successor of the GNU Library Public License, version 2, hence + the version number 2.1.] + +[9]Preamble + + The licenses for most software are designed to take away your freedom + to share and change it. By contrast, the GNU General Public Licenses + are intended to guarantee your freedom to share and change free + software--to make sure the software is free for all its users. + + This license, the Lesser General Public License, applies to some + specially designated software packages--typically libraries--of the + Free Software Foundation and other authors who decide to use it. You + can use it too, but we suggest you first think carefully about whether + this license or the ordinary General Public License is the better + strategy to use in any particular case, based on the explanations + below. + + When we speak of free software, we are referring to freedom of use, + not price. Our General Public Licenses are designed to make sure that + you have the freedom to distribute copies of free software (and charge + for this service if you wish); that you receive source code or can get + it if you want it; that you can change the software and use pieces of + it in new free programs; and that you are informed that you can do + these things. + + To protect your rights, we need to make restrictions that forbid + distributors to deny you these rights or to ask you to surrender these + rights. These restrictions translate to certain responsibilities for + you if you distribute copies of the library or if you modify it. + + For example, if you distribute copies of the library, whether gratis + or for a fee, you must give the recipients all the rights that we gave + you. You must make sure that they, too, receive or can get the source + code. If you link other code with the library, you must provide + complete object files to the recipients, so that they can relink them + with the library after making changes to the library and recompiling + it. And you must show them these terms so they know their rights. + + We protect your rights with a two-step method: (1) we copyright the + library, and (2) we offer you this license, which gives you legal + permission to copy, distribute and/or modify the library. + + To protect each distributor, we want to make it very clear that there + is no warranty for the free library. Also, if the library is modified + by someone else and passed on, the recipients should know that what + they have is not the original version, so that the original author's + reputation will not be affected by problems that might be introduced + by others. + + Finally, software patents pose a constant threat to the existence of + any free program. We wish to make sure that a company cannot + effectively restrict the users of a free program by obtaining a + restrictive license from a patent holder. Therefore, we insist that + any patent license obtained for a version of the library must be + consistent with the full freedom of use specified in this license. + + Most GNU software, including some libraries, is covered by the + ordinary GNU General Public License. This license, the GNU Lesser + General Public License, applies to certain designated libraries, and + is quite different from the ordinary General Public License. We use + this license for certain libraries in order to permit linking those + libraries into non-free programs. + + When a program is linked with a library, whether statically or using a + shared library, the combination of the two is legally speaking a + combined work, a derivative of the original library. The ordinary + General Public License therefore permits such linking only if the + entire combination fits its criteria of freedom. The Lesser General + Public License permits more lax criteria for linking other code with + the library. + + We call this license the "Lesser" General Public License because it + does Less to protect the user's freedom than the ordinary General + Public License. It also provides other free software developers Less + of an advantage over competing non-free programs. These disadvantages + are the reason we use the ordinary General Public License for many + libraries. However, the Lesser license provides advantages in certain + special circumstances. + + For example, on rare occasions, there may be a special need to + encourage the widest possible use of a certain library, so that it + becomes a de-facto standard. To achieve this, non-free programs must + be allowed to use the library. A more frequent case is that a free + library does the same job as widely used non-free libraries. In this + case, there is little to gain by limiting the free library to free + software only, so we use the Lesser General Public License. + + In other cases, permission to use a particular library in non-free + programs enables a greater number of people to use a large body of + free software. For example, permission to use the GNU C Library in + non-free programs enables many more people to use the whole GNU + operating system, as well as its variant, the GNU/Linux operating + system. + + Although the Lesser General Public License is Less protective of the + users' freedom, it does ensure that the user of a program that is + linked with the Library has the freedom and the wherewithal to run + that program using a modified version of the Library. + + The precise terms and conditions for copying, distribution and + modification follow. Pay close attention to the difference between a + "work based on the library" and a "work that uses the library". The + former contains code derived from the library, whereas the latter must + be combined with the library in order to run. + +[10]TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License Agreement applies to any software library or other + program which contains a notice placed by the copyright holder or + other authorized party saying it may be distributed under the terms of + this Lesser General Public License (also called "this License"). Each + licensee is addressed as "you". + + A "library" means a collection of software functions and/or data + prepared so as to be conveniently linked with application programs + (which use some of those functions and data) to form executables. + + The "Library", below, refers to any such software library or work + which has been distributed under these terms. A "work based on the + Library" means either the Library or any derivative work under + copyright law: that is to say, a work containing the Library or a + portion of it, either verbatim or with modifications and/or translated + straightforwardly into another language. (Hereinafter, translation is + included without limitation in the term "modification".) + + "Source code" for a work means the preferred form of the work for + making modifications to it. For a library, complete source code means + all the source code for all modules it contains, plus any associated + interface definition files, plus the scripts used to control + compilation and installation of the library. + + Activities other than copying, distribution and modification are not + covered by this License; they are outside its scope. The act of + running a program using the Library is not restricted, and output from + such a program is covered only if its contents constitute a work based + on the Library (independent of the use of the Library in a tool for + writing it). Whether that is true depends on what the Library does and + what the program that uses the Library does. + + 1. You may copy and distribute verbatim copies of the Library's + complete source code as you receive it, in any medium, provided that + you conspicuously and appropriately publish on each copy an + appropriate copyright notice and disclaimer of warranty; keep intact + all the notices that refer to this License and to the absence of any + warranty; and distribute a copy of this License along with the + Library. + + You may charge a fee for the physical act of transferring a copy, and + you may at your option offer warranty protection in exchange for a + fee. + + 2. You may modify your copy or copies of the Library or any portion of + it, thus forming a work based on the Library, and copy and distribute + such modifications or work under the terms of Section 1 above, + provided that you also meet all of these conditions: + + * a) The modified work must itself be a software library. + * b) You must cause the files modified to carry prominent notices + stating that you changed the files and the date of any change. + * c) You must cause the whole of the work to be licensed at no + charge to all third parties under the terms of this License. + * d) If a facility in the modified Library refers to a function or a + table of data to be supplied by an application program that uses + the facility, other than as an argument passed when the facility + is invoked, then you must make a good faith effort to ensure that, + in the event an application does not supply such function or + table, the facility still operates, and performs whatever part of + its purpose remains meaningful. + (For example, a function in a library to compute square roots has + a purpose that is entirely well-defined independent of the + application. Therefore, Subsection 2d requires that any + application-supplied function or table used by this function must + be optional: if the application does not supply it, the square + root function must still compute square roots.) + These requirements apply to the modified work as a whole. If + identifiable sections of that work are not derived from the + Library, and can be reasonably considered independent and separate + works in themselves, then this License, and its terms, do not + apply to those sections when you distribute them as separate + works. But when you distribute the same sections as part of a + whole which is a work based on the Library, the distribution of + the whole must be on the terms of this License, whose permissions + for other licensees extend to the entire whole, and thus to each + and every part regardless of who wrote it. + Thus, it is not the intent of this section to claim rights or + contest your rights to work written entirely by you; rather, the + intent is to exercise the right to control the distribution of + derivative or collective works based on the Library. + In addition, mere aggregation of another work not based on the + Library with the Library (or with a work based on the Library) on + a volume of a storage or distribution medium does not bring the + other work under the scope of this License. + + 3. You may opt to apply the terms of the ordinary GNU General Public + License instead of this License to a given copy of the Library. To do + this, you must alter all the notices that refer to this License, so + that they refer to the ordinary GNU General Public License, version 2, + instead of to this License. (If a newer version than version 2 of the + ordinary GNU General Public License has appeared, then you can specify + that version instead if you wish.) Do not make any other change in + these notices. + + Once this change is made in a given copy, it is irreversible for that + copy, so the ordinary GNU General Public License applies to all + subsequent copies and derivative works made from that copy. + + This option is useful when you wish to copy part of the code of the + Library into a program that is not a library. + + 4. You may copy and distribute the Library (or a portion or derivative + of it, under Section 2) in object code or executable form under the + terms of Sections 1 and 2 above provided that you accompany it with + the complete corresponding machine-readable source code, which must be + distributed under the terms of Sections 1 and 2 above on a medium + customarily used for software interchange. + + If distribution of object code is made by offering access to copy from + a designated place, then offering equivalent access to copy the source + code from the same place satisfies the requirement to distribute the + source code, even though third parties are not compelled to copy the + source along with the object code. + + 5. A program that contains no derivative of any portion of the + Library, but is designed to work with the Library by being compiled or + linked with it, is called a "work that uses the Library". Such a work, + in isolation, is not a derivative work of the Library, and therefore + falls outside the scope of this License. + + However, linking a "work that uses the Library" with the Library + creates an executable that is a derivative of the Library (because it + contains portions of the Library), rather than a "work that uses the + library". The executable is therefore covered by this License. Section + 6 states terms for distribution of such executables. + + When a "work that uses the Library" uses material from a header file + that is part of the Library, the object code for the work may be a + derivative work of the Library even though the source code is not. + Whether this is true is especially significant if the work can be + linked without the Library, or if the work is itself a library. The + threshold for this to be true is not precisely defined by law. + + If such an object file uses only numerical parameters, data structure + layouts and accessors, and small macros and small inline functions + (ten lines or less in length), then the use of the object file is + unrestricted, regardless of whether it is legally a derivative work. + (Executables containing this object code plus portions of the Library + will still fall under Section 6.) + + Otherwise, if the work is a derivative of the Library, you may + distribute the object code for the work under the terms of Section 6. + Any executables containing that work also fall under Section 6, + whether or not they are linked directly with the Library itself. + + 6. As an exception to the Sections above, you may also combine or link + a "work that uses the Library" with the Library to produce a work + containing portions of the Library, and distribute that work under + terms of your choice, provided that the terms permit modification of + the work for the customer's own use and reverse engineering for + debugging such modifications. + + You must give prominent notice with each copy of the work that the + Library is used in it and that the Library and its use are covered by + this License. You must supply a copy of this License. If the work + during execution displays copyright notices, you must include the + copyright notice for the Library among them, as well as a reference + directing the user to the copy of this License. Also, you must do one + of these things: + + * a) Accompany the work with the complete corresponding + machine-readable source code for the Library including whatever + changes were used in the work (which must be distributed under + Sections 1 and 2 above); and, if the work is an executable linked + with the Library, with the complete machine-readable "work that + uses the Library", as object code and/or source code, so that the + user can modify the Library and then relink to produce a modified + executable containing the modified Library. (It is understood that + the user who changes the contents of definitions files in the + Library will not necessarily be able to recompile the application + to use the modified definitions.) + * b) Use a suitable shared library mechanism for linking with the + Library. A suitable mechanism is one that (1) uses at run time a + copy of the library already present on the user's computer system, + rather than copying library functions into the executable, and (2) + will operate properly with a modified version of the library, if + the user installs one, as long as the modified version is + interface-compatible with the version that the work was made with. + * c) Accompany the work with a written offer, valid for at least + three years, to give the same user the materials specified in + Subsection 6a, above, for a charge no more than the cost of + performing this distribution. + * d) If distribution of the work is made by offering access to copy + from a designated place, offer equivalent access to copy the above + specified materials from the same place. + * e) Verify that the user has already received a copy of these + materials or that you have already sent this user a copy. + + For an executable, the required form of the "work that uses the + Library" must include any data and utility programs needed for + reproducing the executable from it. However, as a special exception, + the materials to be distributed need not include anything that is + normally distributed (in either source or binary form) with the major + components (compiler, kernel, and so on) of the operating system on + which the executable runs, unless that component itself accompanies + the executable. + + It may happen that this requirement contradicts the license + restrictions of other proprietary libraries that do not normally + accompany the operating system. Such a contradiction means you cannot + use both them and the Library together in an executable that you + distribute. + + 7. You may place library facilities that are a work based on the + Library side-by-side in a single library together with other library + facilities not covered by this License, and distribute such a combined + library, provided that the separate distribution of the work based on + the Library and of the other library facilities is otherwise + permitted, and provided that you do these two things: + + * a) Accompany the combined library with a copy of the same work + based on the Library, uncombined with any other library + facilities. This must be distributed under the terms of the + Sections above. + * b) Give prominent notice with the combined library of the fact + that part of it is a work based on the Library, and explaining + where to find the accompanying uncombined form of the same work. + + 8. You may not copy, modify, sublicense, link with, or distribute the + Library except as expressly provided under this License. Any attempt + otherwise to copy, modify, sublicense, link with, or distribute the + Library is void, and will automatically terminate your rights under + this License. However, parties who have received copies, or rights, + from you under this License will not have their licenses terminated so + long as such parties remain in full compliance. + + 9. You are not required to accept this License, since you have not + signed it. However, nothing else grants you permission to modify or + distribute the Library or its derivative works. These actions are + prohibited by law if you do not accept this License. Therefore, by + modifying or distributing the Library (or any work based on the + Library), you indicate your acceptance of this License to do so, and + all its terms and conditions for copying, distributing or modifying + the Library or works based on it. + + 10. Each time you redistribute the Library (or any work based on the + Library), the recipient automatically receives a license from the + original licensor to copy, distribute, link with or modify the Library + subject to these terms and conditions. You may not impose any further + restrictions on the recipients' exercise of the rights granted herein. + You are not responsible for enforcing compliance by third parties with + this License. + + 11. If, as a consequence of a court judgment or allegation of patent + infringement or for any other reason (not limited to patent issues), + conditions are imposed on you (whether by court order, agreement or + otherwise) that contradict the conditions of this License, they do not + excuse you from the conditions of this License. If you cannot + distribute so as to satisfy simultaneously your obligations under this + License and any other pertinent obligations, then as a consequence you + may not distribute the Library at all. For example, if a patent + license would not permit royalty-free redistribution of the Library by + all those who receive copies directly or indirectly through you, then + the only way you could satisfy both it and this License would be to + refrain entirely from distribution of the Library. + + If any portion of this section is held invalid or unenforceable under + any particular circumstance, the balance of the section is intended to + apply, and the section as a whole is intended to apply in other + circumstances. + + It is not the purpose of this section to induce you to infringe any + patents or other property right claims or to contest validity of any + such claims; this section has the sole purpose of protecting the + integrity of the free software distribution system which is + implemented by public license practices. Many people have made + generous contributions to the wide range of software distributed + through that system in reliance on consistent application of that + system; it is up to the author/donor to decide if he or she is willing + to distribute software through any other system and a licensee cannot + impose that choice. + + This section is intended to make thoroughly clear what is believed to + be a consequence of the rest of this License. + + 12. If the distribution and/or use of the Library is restricted in + certain countries either by patents or by copyrighted interfaces, the + original copyright holder who places the Library under this License + may add an explicit geographical distribution limitation excluding + those countries, so that distribution is permitted only in or among + countries not thus excluded. In such case, this License incorporates + the limitation as if written in the body of this License. + + 13. The Free Software Foundation may publish revised and/or new + versions of the Lesser General Public License from time to time. Such + new versions will be similar in spirit to the present version, but may + differ in detail to address new problems or concerns. + + Each version is given a distinguishing version number. If the Library + specifies a version number of this License which applies to it and + "any later version", you have the option of following the terms and + conditions either of that version or of any later version published by + the Free Software Foundation. If the Library does not specify a + license version number, you may choose any version ever published by + the Free Software Foundation. + + 14. If you wish to incorporate parts of the Library into other free + programs whose distribution conditions are incompatible with these, + write to the author to ask for permission. For software which is + copyrighted by the Free Software Foundation, write to the Free + Software Foundation; we sometimes make exceptions for this. Our + decision will be guided by the two goals of preserving the free status + of all derivatives of our free software and of promoting the sharing + and reuse of software generally. + + NO WARRANTY + + 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO + WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. + EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR + OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY + KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR + PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE + LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME + THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN + WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY + AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU + FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR + CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE + LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING + RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A + FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF + SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH + DAMAGES. + +END OF TERMS AND CONDITIONS + +[11]How to Apply These Terms to Your New Libraries + + If you develop a new library, and you want it to be of the greatest + possible use to the public, we recommend making it free software that + everyone can redistribute and change. You can do so by permitting + redistribution under these terms (or, alternatively, under the terms + of the ordinary General Public License). + + To apply these terms, attach the following notices to the library. It + is safest to attach them to the start of each source file to most + effectively convey the exclusion of warranty; and each file should + have at least the "copyright" line and a pointer to where the full + notice is found. + +one line to give the library's name and an idea of what it does. +Copyright (C) year name of author + +This library is free software; you can redistribute it and/or +modify it under the terms of the GNU Lesser General Public +License as published by the Free Software Foundation; either +version 2.1 of the License, or (at your option) any later version. + +This library is distributed in the hope that it will be useful, +but WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +Lesser General Public License for more details. + +You should have received a copy of the GNU Lesser General Public +License along with this library; if not, write to the Free Software +Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + + Also add information on how to contact you by electronic and paper + mail. + + You should also get your employer (if you work as a programmer) or + your school, if any, to sign a "copyright disclaimer" for the library, + if necessary. Here is a sample; alter the names: + +Yoyodyne, Inc., hereby disclaims all copyright interest in +the library `Frob' (a library for tweaking knobs) written +by James Random Hacker. + +signature of Ty Coon, 1 April 1990 +Ty Coon, President of Vice + + That's all there is to it! + _________________________________________________________________ + + Return to [12]GNU's home page. + + FSF & GNU inquiries & questions to [13]gnu@gnu.org. Other [14]ways to + contact the FSF. + + Comments on these web pages to [15]webmasters@www.gnu.org, send other + questions to [16]gnu@gnu.org. + + Copyright notice above. + Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, + MA 02111, USA + + Updated: 7 Jan 2000 rms + _________________________________________________________________ + +References + + 1. http://www.gnu.org/graphics/philosophicalgnu.html + 2. http://www.gnu.org/copyleft/copyleft.html#translationsLGPL + 3. http://www.gnu.org/philosophy/why-not-lgpl.html + 4. http://www.gnu.org/copyleft/lesser.html#SEC1 + 5. http://www.gnu.org/copyleft/lesser.html#SEC2 + 6. http://www.gnu.org/copyleft/lesser.html#SEC3 + 7. http://www.gnu.org/copyleft/lesser.html#SEC4 + 8. http://www.gnu.org/copyleft/lesser.html#TOC1 + 9. http://www.gnu.org/copyleft/lesser.html#TOC2 + 10. http://www.gnu.org/copyleft/lesser.html#TOC3 + 11. http://www.gnu.org/copyleft/lesser.html#TOC4 + 12. http://www.gnu.org/home.html + 13. mailto:gnu@gnu.org + 14. http://www.gnu.org/home.html#ContactInfo + 15. mailto:webmasters@www.gnu.org + 16. mailto:gnu@gnu.org diff --git a/qpkg/Makefile b/qpkg/Makefile index 792091f..b08ed11 100644 --- a/qpkg/Makefile +++ b/qpkg/Makefile @@ -1,7 +1,8 @@ -CFLAGS = -Wall -Wshadow -g +CFLAGS = -Wall -Wshadow -g -O # -O, so that we get data flow analysis, which helps to find more bugs +#LDFLAGS=-pg -OBJS = gobble.o id.o prereq.o qpkg.o +OBJS = gobble.o id.o prereq.o qpkg.o jrb.o jval.o all: qpkg diff --git a/qpkg/README.jrb b/qpkg/README.jrb new file mode 100644 index 0000000..5685441 --- /dev/null +++ b/qpkg/README.jrb @@ -0,0 +1,34 @@ +Libraries for fields, doubly-linked lists and red-black trees. +Copyright (C) 2001 James S. Plank + +This library is free software; you can redistribute it and/or +modify it under the terms of the GNU Lesser General Public +License as published by the Free Software Foundation; either +version 2.1 of the License, or (at your option) any later version. + +This library is distributed in the hope that it will be useful, +but WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +Lesser General Public License for more details. + +You should have received a copy of the GNU Lesser General Public +License along with this library; if not, write to the Free Software +Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + +--------------------------------------------------------------------------- +Please see http://www.cs.utk.edu/~plank/plank/classes/cs360/360/notes/Libfdr/ +for instruction on how to use this library. + +Jim Plank +plank@cs.utk.edu +http://www.cs.utk.edu/~plank + +Associate Professor +Department of Computer Science +University of Tennessee +203 Claxton Complex +1122 Volunteer Blvd. +Knoxville, TN 37996-3450 + + 865-974-4397 +Fax: 865-974-4404 diff --git a/qpkg/jrb.c b/qpkg/jrb.c new file mode 100644 index 0000000..f6088a1 --- /dev/null +++ b/qpkg/jrb.c @@ -0,0 +1,695 @@ +/* +Libraries for fields, doubly-linked lists and red-black trees. +Copyright (C) 2001 James S. Plank + +This library is free software; you can redistribute it and/or +modify it under the terms of the GNU Lesser General Public +License as published by the Free Software Foundation; either +version 2.1 of the License, or (at your option) any later version. + +This library is distributed in the hope that it will be useful, +but WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +Lesser General Public License for more details. + +You should have received a copy of the GNU Lesser General Public +License along with this library; if not, write to the Free Software +Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + +--------------------------------------------------------------------------- +Please see http://www.cs.utk.edu/~plank/plank/classes/cs360/360/notes/Libfdr/ +for instruction on how to use this library. + +Jim Plank +plank@cs.utk.edu +http://www.cs.utk.edu/~plank + +Associate Professor +Department of Computer Science +University of Tennessee +203 Claxton Complex +1122 Volunteer Blvd. +Knoxville, TN 37996-3450 + + 865-974-4397 +Fax: 865-974-4404 + */ +/* Revision 1.2. Jim Plank */ + +/* Original code by Jim Plank (plank@cs.utk.edu) */ +/* modified for THINK C 6.0 for Macintosh by Chris Bartley */ + +#include +#include +#include +#include +#include "jrb.h" + +static void mk_new_int(JRB l, JRB r, JRB p, int il); +static JRB lprev(JRB n); +static JRB rprev(JRB n); +static void recolor(JRB n); +static void single_rotate(JRB y, int l); +static void jrb_print_tree(JRB t, int level); +static void jrb_iprint_tree(JRB t, int level); + +#define isred(n) (n->red) +#define isblack(n) (!isred(n)) +#define isleft(n) (n->left) +#define isright(n) (!isleft(n)) +#define isint(n) (n->internal) +#define isext(n) (!isint(n)) +#define ishead(n) (n->roothead & 2) +#define isroot(n) (n->roothead & 1) +#define getlext(n) ((struct jrb_node *)(n->key.v)) +#define setlext(node, val) node->key.v = (void *) (val) +#define getrext(n) ((struct jrb_node *)(n->val.v)) +#define setrext(node, value) node->val.v = (void *) (value) +#define setred(n) n->red = 1 +#define setblack(n) n->red = 0 +#define setleft(n) n->left = 1 +#define setright(n) n->left = 0 +#define sethead(n) (n->roothead |= 2) +#define setroot(n) (n->roothead |= 1) +#define setint(n) n->internal = 1 +#define setext(n) n->internal = 0 +#define setnormal(n) n->roothead = 0 +#define sibling(n) ((isleft(n)) ? n->parent->blink : n->parent->flink) + +static void insert(JRB item, JRB list) /* Inserts to the end of a list */ +{ + JRB last_node; + + last_node = list->blink; + + list->blink = item; + last_node->flink = item; + item->blink = last_node; + item->flink = list; +} + +static void delete_item(JRB item) /* Deletes an arbitrary iterm */ +{ + item->flink->blink = item->blink; + item->blink->flink = item->flink; +} + +#define mk_new_ext(new, kkkey, vvval) {\ + new = (JRB) malloc(sizeof(struct jrb_node));\ + new->val = vvval;\ + new->key = kkkey;\ + setext(new);\ + setblack(new);\ + setnormal(new);\ +} + +static void mk_new_int(JRB l, JRB r, JRB p, int il) +{ + JRB newnode; + + newnode = (JRB) malloc(sizeof(struct jrb_node)); + setint(newnode); + setred(newnode); + setnormal(newnode); + newnode->flink = l; + newnode->blink = r; + newnode->parent = p; + setlext(newnode, l); + setrext(newnode, r); + l->parent = newnode; + r->parent = newnode; + setleft(l); + setright(r); + if (ishead(p)) { + p->parent = newnode; + setroot(newnode); + } else if (il) { + setleft(newnode); + p->flink = newnode; + } else { + setright(newnode); + p->blink = newnode; + } + recolor(newnode); +} + + +JRB lprev(JRB n) +{ + if (ishead(n)) return n; + while (!isroot(n)) { + if (isright(n)) return n->parent; + n = n->parent; + } + return n->parent; +} + +JRB rprev(JRB n) +{ + if (ishead(n)) return n; + while (!isroot(n)) { + if (isleft(n)) return n->parent; + n = n->parent; + } + return n->parent; +} + +JRB make_jrb(void) +{ + JRB head; + + head = (JRB) malloc (sizeof(struct jrb_node)); + head->flink = head; + head->blink = head; + head->parent = head; + head->key.s = ""; + sethead(head); + return head; +} + +JRB jrb_find_gte_str(JRB n, char *key, int *fnd) +{ + int cmp; + + *fnd = 0; + if (!ishead(n)) { + fprintf(stderr, "jrb_find_gte_str called on non-head %p\n", n); + exit(1); + } + if (n->parent == n) return n; + cmp = strcmp(key, n->blink->key.s); + if (cmp == 0) { + *fnd = 1; + return n->blink; + } + if (cmp > 0) return n; + else n = n->parent; + while (1) { + if (isext(n)) return n; + cmp = strcmp(key, getlext(n)->key.s); + if (cmp == 0) { + *fnd = 1; + return getlext(n); + } + if (cmp < 0) n = n->flink ; else n = n->blink; + } +} + +JRB jrb_find_str(JRB n, char *key) +{ + int fnd; + JRB j; + j = jrb_find_gte_str(n, key, &fnd); + if (fnd) return j; else return NULL; +} + +JRB jrb_find_gte_int(JRB n, int ikey, int *fnd) +{ + *fnd = 0; + if (!ishead(n)) { + fprintf(stderr, "jrb_find_gte_int called on non-head %p\n", n); + exit(1); + } + if (n->parent == n) return n; + if (ikey == n->blink->key.i) { + *fnd = 1; + return n->blink; + } + if (ikey > n->blink->key.i) return n; + else n = n->parent; + while (1) { + if (isext(n)) return n; + if (ikey == getlext(n)->key.i) { + *fnd = 1; + return getlext(n); + } + n = (ikey < getlext(n)->key.i) ? n->flink : n->blink; + } +} + +JRB jrb_find_int(JRB n, int ikey) +{ + int fnd; + JRB j; + + j = jrb_find_gte_int(n, ikey, &fnd); + if (fnd) return j; else return NULL; +} + +JRB jrb_find_gte_dbl(JRB n, double dkey, int *fnd) +{ + *fnd = 0; + if (!ishead(n)) { + fprintf(stderr, "jrb_find_gte_dbl called on non-head %p\n", n); + exit(1); + } + if (n->parent == n) return n; + if (dkey == n->blink->key.d) { + *fnd = 1; + return n->blink; + } + if (dkey > n->blink->key.d) return n; + else n = n->parent; + while (1) { + if (isext(n)) return n; + if (dkey == getlext(n)->key.d) { + *fnd = 1; + return getlext(n); + } + n = (dkey < getlext(n)->key.d) ? n->flink : n->blink; + } +} + +JRB jrb_find_dbl(JRB n, double dkey) +{ + int fnd; + JRB j; + + j = jrb_find_gte_dbl(n, dkey, &fnd); + if (fnd) return j; else return NULL; +} + +JRB jrb_find_gte_gen(JRB n, Jval key,int (*fxn)(Jval, Jval), int *fnd) +{ + int cmp; + + *fnd = 0; + if (!ishead(n)) { + fprintf(stderr, "jrb_find_gte_str called on non-head %p\n", n); + exit(1); + } + if (n->parent == n) return n; + cmp = (*fxn)(key, n->blink->key); + if (cmp == 0) { + *fnd = 1; + return n->blink; + } + if (cmp > 0) return n; + else n = n->parent; + while (1) { + if (isext(n)) return n; + cmp = (*fxn)(key, getlext(n)->key); + if (cmp == 0) { + *fnd = 1; + return getlext(n); + } + if (cmp < 0) n = n->flink ; else n = n->blink; + } +} + +JRB jrb_find_gen(JRB n, Jval key, int (*fxn)(Jval, Jval)) +{ + int fnd; + JRB j; + + j = jrb_find_gte_gen(n, key, fxn, &fnd); + if (fnd) return j; else return NULL; +} + +static JRB jrb_insert_b(JRB n, Jval key, Jval val) +{ + JRB newleft, newright, newnode, p; + + if (ishead(n)) { + if (n->parent == n) { /* Tree is empty */ + mk_new_ext(newnode, key, val); + insert(newnode, n); + n->parent = newnode; + newnode->parent = n; + setroot(newnode); + return newnode; + } else { + mk_new_ext(newright, key, val); + insert(newright, n); + newleft = newright->blink; + setnormal(newleft); + mk_new_int(newleft, newright, newleft->parent, isleft(newleft)); + p = rprev(newright); + if (!ishead(p)) setlext(p, newright); + return newright; + } + } else { + mk_new_ext(newleft, key, val); + insert(newleft, n); + setnormal(n); + mk_new_int(newleft, n, n->parent, isleft(n)); + p = lprev(newleft); + if (!ishead(p)) setrext(p, newleft); + return newleft; + } +} + +static void recolor(JRB n) +{ + JRB p, gp, s; + int done = 0; + + while(!done) { + if (isroot(n)) { + setblack(n); + return; + } + + p = n->parent; + + if (isblack(p)) return; + + if (isroot(p)) { + setblack(p); + return; + } + + gp = p->parent; + s = sibling(p); + if (isred(s)) { + setblack(p); + setred(gp); + setblack(s); + n = gp; + } else { + done = 1; + } + } + /* p's sibling is black, p is red, gp is black */ + + if ((isleft(n) == 0) == (isleft(p) == 0)) { + single_rotate(gp, isleft(n)); + setblack(p); + setred(gp); + } else { + single_rotate(p, isleft(n)); + single_rotate(gp, isleft(n)); + setblack(n); + setred(gp); + } +} + +static void single_rotate(JRB y, int l) +{ + int rl = 0 /* for gcc */, ir; + JRB x, yp; + + ir = isroot(y); + yp = y->parent; + if (!ir) { + rl = isleft(y); + } + + if (l) { + x = y->flink; + y->flink = x->blink; + setleft(y->flink); + y->flink->parent = y; + x->blink = y; + setright(y); + } else { + x = y->blink; + y->blink = x->flink; + setright(y->blink); + y->blink->parent = y; + x->flink = y; + setleft(y); + } + + x->parent = yp; + y->parent = x; + if (ir) { + yp->parent = x; + setnormal(y); + setroot(x); + } else { + if (rl) { + yp->flink = x; + setleft(x); + } else { + yp->blink = x; + setright(x); + } + } +} + +void jrb_delete_node(JRB n) +{ + JRB s, p, gp; + char ir; + + if (isint(n)) { + fprintf(stderr, "Cannot delete an internal node: %p\n", n); + exit(1); + } + if (ishead(n)) { + fprintf(stderr, "Cannot delete the head of an jrb_tree: %p\n", n); + exit(1); + } + delete_item(n); /* Delete it from the list */ + p = n->parent; /* The only node */ + if (isroot(n)) { + p->parent = p; + free(n); + return; + } + s = sibling(n); /* The only node after deletion */ + if (isroot(p)) { + s->parent = p->parent; + s->parent->parent = s; + setroot(s); + free(p); + free(n); + return; + } + gp = p->parent; /* Set parent to sibling */ + s->parent = gp; + if (isleft(p)) { + gp->flink = s; + setleft(s); + } else { + gp->blink = s; + setright(s); + } + ir = isred(p); + free(p); + free(n); + + if (isext(s)) { /* Update proper rext and lext values */ + p = lprev(s); + if (!ishead(p)) setrext(p, s); + p = rprev(s); + if (!ishead(p)) setlext(p, s); + } else if (isblack(s)) { + fprintf(stderr, "DELETION PROB -- sib is black, internal\n"); + exit(1); + } else { + p = lprev(s); + if (!ishead(p)) setrext(p, s->flink); + p = rprev(s); + if (!ishead(p)) setlext(p, s->blink); + setblack(s); + return; + } + + if (ir) return; + + /* Recolor */ + + n = s; + p = n->parent; + s = sibling(n); + while(isblack(p) && isblack(s) && isint(s) && + isblack(s->flink) && isblack(s->blink)) { + setred(s); + n = p; + if (isroot(n)) return; + p = n->parent; + s = sibling(n); + } + + if (isblack(p) && isred(s)) { /* Rotation 2.3b */ + single_rotate(p, isright(n)); + setred(p); + setblack(s); + s = sibling(n); + } + + { JRB x, z; char il; + + if (isext(s)) { + fprintf(stderr, "DELETION ERROR: sibling not internal\n"); + exit(1); + } + + il = isleft(n); + x = il ? s->flink : s->blink ; + z = sibling(x); + + if (isred(z)) { /* Rotation 2.3f */ + single_rotate(p, !il); + setblack(z); + if (isred(p)) setred(s); else setblack(s); + setblack(p); + } else if (isblack(x)) { /* Recoloring only (2.3c) */ + if (isred(s) || isblack(p)) { + fprintf(stderr, "DELETION ERROR: 2.3c not quite right\n"); + exit(1); + } + setblack(p); + setred(s); + return; + } else if (isred(p)) { /* 2.3d */ + single_rotate(s, il); + single_rotate(p, !il); + setblack(x); + setred(s); + return; + } else { /* 2.3e */ + single_rotate(s, il); + single_rotate(p, !il); + setblack(x); + return; + } + } +} + + +void jrb_print_tree(JRB t, int level) +{ + int i; + if (ishead(t) && t->parent == t) { + printf("tree %p is empty\n", t); + } else if (ishead(t)) { + printf("Head: %p. Root = %p\n", t, t->parent); + jrb_print_tree(t->parent, 0); + } else { + if (isext(t)) { + for (i = 0; i < level; i++) putchar(' '); + printf("Ext node %p: %c,%c: p=%p, k=%s\n", + t, isred(t)?'R':'B', isleft(t)?'l':'r', t->parent, t->key.s); + } else { + jrb_print_tree(t->flink, level+2); + jrb_print_tree(t->blink, level+2); + for (i = 0; i < level; i++) putchar(' '); + printf("Int node %p: %c,%c: l=%p, r=%p, p=%p, lr=(%s,%s)\n", + t, isred(t)?'R':'B', isleft(t)?'l':'r', t->flink, + t->blink, + t->parent, getlext(t)->key.s, getrext(t)->key.s); + } + } +} + +void jrb_iprint_tree(JRB t, int level) +{ + int i; + if (ishead(t) && t->parent == t) { + printf("tree %p is empty\n", t); + } else if (ishead(t)) { + printf("Head: %p. Root = %p, < = %p, > = %p\n", + t, t->parent, t->blink, t->flink); + jrb_iprint_tree(t->parent, 0); + } else { + if (isext(t)) { + for (i = 0; i < level; i++) putchar(' '); + printf("Ext node %p: %c,%c: p=%p, <=%p, >=%p k=%d\n", + t, isred(t)?'R':'B', isleft(t)?'l':'r', t->parent, + t->blink, t->flink, t->key.i); + } else { + jrb_iprint_tree(t->flink, level+2); + jrb_iprint_tree(t->blink, level+2); + for (i = 0; i < level; i++) putchar(' '); + printf("Int node %p: %c,%c: l=%p, r=%p, p=%p, lr=(%d,%d)\n", + t, isred(t)?'R':'B', isleft(t)?'l':'r', t->flink, + t->blink, + t->parent, getlext(t)->key.i, getrext(t)->key.i); + } + } +} + +int jrb_nblack(JRB n) +{ + int nb; + if (ishead(n) || isint(n)) { + fprintf(stderr, "ERROR: jrb_nblack called on a non-external node %p\n", n); + exit(1); + } + nb = 0; + while(!ishead(n)) { + if (isblack(n)) nb++; + n = n->parent; + } + return nb; +} + +int jrb_plength(JRB n) +{ + int pl; + if (ishead(n) || isint(n)) { + fprintf(stderr, "ERROR: jrb_plength called on a non-external node %p\n", n); + exit(1); + } + pl = 0; + while(!ishead(n)) { + pl++; + n = n->parent; + } + return pl; +} + +void jrb_free_tree(JRB n) +{ + if (!ishead(n)) { + fprintf(stderr, "ERROR: Rb_free_tree called on a non-head node\n"); + exit(1); + } + + while(jrb_first(n) != jrb_nil(n)) { + jrb_delete_node(jrb_first(n)); + } + free(n); +} + +Jval jrb_val(JRB n) +{ + return n->val; +} + +#if 0 +static JRB jrb_insert_a(JRB nd, Jval key, Jval val) +{ + return jrb_insert_b(nd->flink, key, val); +} +#endif + +JRB jrb_insert_str(JRB tree, char *key, Jval val) +{ + Jval k; + int fnd; + + k.s = key; + return jrb_insert_b(jrb_find_gte_str(tree, key, &fnd), k, val); +} + +JRB jrb_insert_int(JRB tree, int ikey, Jval val) +{ + Jval k; + int fnd; + + k.i = ikey; + return jrb_insert_b(jrb_find_gte_int(tree, ikey, &fnd), k, val); +} + +JRB jrb_insert_dbl(JRB tree, double dkey, Jval val) +{ + Jval k; + int fnd; + + k.d = dkey; + return jrb_insert_b(jrb_find_gte_dbl(tree, dkey, &fnd), k, val); +} + +JRB jrb_insert_gen(JRB tree, Jval key, Jval val, + int (*func)(Jval, Jval)) +{ + int fnd; + + return jrb_insert_b(jrb_find_gte_gen(tree, key, func, &fnd), key, val); +} + + diff --git a/qpkg/jrb.h b/qpkg/jrb.h new file mode 100644 index 0000000..5693cda --- /dev/null +++ b/qpkg/jrb.h @@ -0,0 +1,126 @@ +/* +Libraries for fields, doubly-linked lists and red-black trees. +Copyright (C) 2001 James S. Plank + +This library is free software; you can redistribute it and/or +modify it under the terms of the GNU Lesser General Public +License as published by the Free Software Foundation; either +version 2.1 of the License, or (at your option) any later version. + +This library is distributed in the hope that it will be useful, +but WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +Lesser General Public License for more details. + +You should have received a copy of the GNU Lesser General Public +License along with this library; if not, write to the Free Software +Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + +--------------------------------------------------------------------------- +Please see http://www.cs.utk.edu/~plank/plank/classes/cs360/360/notes/Libfdr/ +for instruction on how to use this library. + +Jim Plank +plank@cs.utk.edu +http://www.cs.utk.edu/~plank + +Associate Professor +Department of Computer Science +University of Tennessee +203 Claxton Complex +1122 Volunteer Blvd. +Knoxville, TN 37996-3450 + + 865-974-4397 +Fax: 865-974-4404 + */ +#ifndef _JRB_H_ +#define _JRB_H_ + +#include "jval.h" + +/* Main jrb_node. You only ever use the fields + flink + blink + k.key or k.ikey + v.val +*/ + + +typedef struct jrb_node { + unsigned char red; + unsigned char internal; + unsigned char left; + unsigned char roothead; /* (bit 1 is root, bit 2 is head) */ + struct jrb_node *flink; + struct jrb_node *blink; + struct jrb_node *parent; + Jval key; + Jval val; +} *JRB; + + +extern JRB make_jrb(void); /* Creates a new rb-tree */ + + +/* Creates a node with key key and val val and inserts it into the tree. + jrb_insert uses strcmp() as comparison funcion. jrb_inserti uses <>=, + jrb_insertg uses func() */ + +extern JRB jrb_insert_str(JRB tree, char *key, Jval val); +extern JRB jrb_insert_int(JRB tree, int ikey, Jval val); +extern JRB jrb_insert_dbl(JRB tree, double dkey, Jval val); +extern JRB jrb_insert_gen(JRB tree, Jval key, Jval val, int (*func)(Jval,Jval)); + +/* returns an external node in t whose value is equal k. Returns NULL if + there is no such node in the tree */ + +extern JRB jrb_find_str(JRB root, char *key); +extern JRB jrb_find_int(JRB root, int ikey); +extern JRB jrb_find_dbl(JRB root, double dkey); +extern JRB jrb_find_gen(JRB root, Jval, int (*func)(Jval, Jval)); + + +/* returns an external node in t whose value is equal + k or whose value is the smallest value greater than k. Sets found to + 1 if the key was found, and 0 otherwise. */ + +extern JRB jrb_find_gte_str(JRB root, char *key, int *found); +extern JRB jrb_find_gte_int(JRB root, int ikey, int *found); +extern JRB jrb_find_gte_dbl(JRB root, double dkey, int *found); +extern JRB jrb_find_gte_gen(JRB root, Jval key, + int (*func)(Jval, Jval), int *found); + + +/* Creates a node with key key and val val and inserts it into the + tree before/after node nd. Does not check to ensure that you are + keeping the correct order */ + +extern void jrb_delete_node(JRB node); /* Deletes and frees a node (but + not the key or val) */ +extern void jrb_free_tree(JRB root); /* Deletes and frees an entire tree */ + +extern Jval jrb_val(JRB node); /* Returns node->v.val -- this is to shut + lint up */ + +extern int jrb_nblack(JRB n); /* returns # of black nodes in path from + n to the root */ +int jrb_plength(JRB n); /* returns the # of nodes in path from + n to the root */ + +#define jrb_first(n) ((n)->flink) +#define jrb_last(n) ((n)->blink) +#define jrb_next(n) ((n)->flink) +#define jrb_prev(n) ((n)->blink) +#define jrb_empty(t) ((t)->flink == (t)) +#ifndef jrb_nil +#define jrb_nil(t) (t) +#endif + +#define jrb_traverse(ptr, lst) \ + for(ptr = jrb_first(lst); ptr != jrb_nil(lst); ptr = jrb_next(ptr)) + +#define jrb_rtraverse(ptr, lst) \ + for(ptr = jrb_last(lst); ptr != jrb_nil(lst); ptr = jrb_prev(ptr)) + +#endif diff --git a/qpkg/jval.c b/qpkg/jval.c new file mode 100644 index 0000000..212945e --- /dev/null +++ b/qpkg/jval.c @@ -0,0 +1,196 @@ +/* +Libraries for fields, doubly-linked lists and red-black trees. +Copyright (C) 2001 James S. Plank + +This library is free software; you can redistribute it and/or +modify it under the terms of the GNU Lesser General Public +License as published by the Free Software Foundation; either +version 2.1 of the License, or (at your option) any later version. + +This library is distributed in the hope that it will be useful, +but WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +Lesser General Public License for more details. + +You should have received a copy of the GNU Lesser General Public +License along with this library; if not, write to the Free Software +Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + +--------------------------------------------------------------------------- +Please see http://www.cs.utk.edu/~plank/plank/classes/cs360/360/notes/Libfdr/ +for instruction on how to use this library. + +Jim Plank +plank@cs.utk.edu +http://www.cs.utk.edu/~plank + +Associate Professor +Department of Computer Science +University of Tennessee +203 Claxton Complex +1122 Volunteer Blvd. +Knoxville, TN 37996-3450 + + 865-974-4397 +Fax: 865-974-4404 + */ +#include +#include +#include "jval.h" + +Jval JNULL; + +Jval new_jval_i(int i) { + Jval j; + j.i = i; + return j; +} + +Jval new_jval_l(long l) { + Jval j; + j.l = l; + return j; +} + +Jval new_jval_f(float f) { + Jval j; + j.f = f; + return j; +} + +Jval new_jval_d(double d) { + Jval j; + j.d = d; + return j; +} + +Jval new_jval_v(void *v) { + Jval j; + j.v = v; + return j; +} + +Jval new_jval_s(char *s) { + Jval j; + j.s = s; + return j; +} + +Jval new_jval_c(char c) { + Jval j; + j.c = c; + return j; +} + +Jval new_jval_uc(unsigned char uc) { + Jval j; + j.uc = uc; + return j; +} + +Jval new_jval_sh(short sh) { + Jval j; + j.sh = sh; + return j; +} + +Jval new_jval_ush(unsigned short ush) { + Jval j; + j.ush = ush; + return j; +} + +Jval new_jval_ui(unsigned int i) { + Jval j; + j.i = i; + return j; +} + +Jval new_jval_iarray(int i0, int i1) { + Jval j; + j.iarray[0] = i0; + j.iarray[1] = i1; + return j; +} + +Jval new_jval_farray(float f0, float f1) { + Jval j; + j.farray[0] = f0; + j.farray[1] = f1; + return j; +} + +Jval new_jval_carray_nt(char *carray) { + Jval j; + int i; + + for (i = 0; i < 8 && carray[i] != '\0'; i++) { + j.carray[i] = carray[i]; + } + if (i < 8) j.carray[i] = carray[i]; + return j; +} + +Jval new_jval_carray_nnt(char *carray) { + Jval j; + + memcpy(j.carray, carray, 8); + return j; +} + +int jval_i(Jval j) { + return j.i; +} + +long jval_l(Jval j) { + return j.l; +} + +float jval_f(Jval j) { + return j.f; +} + +double jval_d(Jval j) { + return j.d; +} + +void *jval_v(Jval j) { + return j.v; +} + +char *jval_s(Jval j) { + return j.s; +} + +char jval_c(Jval j) { + return j.c; +} + +unsigned char jval_uc(Jval j) { + return j.uc; +} + +short jval_sh(Jval j) { + return j.sh; +} + +unsigned short jval_ush(Jval j) { + return j.ush; +} + +unsigned int jval_ui(Jval j) { + return j.ui; +} + +int *jval_iarray(Jval j) { + return j.iarray; +} + +float *jval_farray(Jval j) { + return j.farray; +} + +char *jval_carray(Jval j) { + return j.carray; +} + diff --git a/qpkg/jval.h b/qpkg/jval.h new file mode 100644 index 0000000..93f3d8a --- /dev/null +++ b/qpkg/jval.h @@ -0,0 +1,94 @@ +/* +Libraries for fields, doubly-linked lists and red-black trees. +Copyright (C) 2001 James S. Plank + +This library is free software; you can redistribute it and/or +modify it under the terms of the GNU Lesser General Public +License as published by the Free Software Foundation; either +version 2.1 of the License, or (at your option) any later version. + +This library is distributed in the hope that it will be useful, +but WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +Lesser General Public License for more details. + +You should have received a copy of the GNU Lesser General Public +License along with this library; if not, write to the Free Software +Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + +--------------------------------------------------------------------------- +Please see http://www.cs.utk.edu/~plank/plank/classes/cs360/360/notes/Libfdr/ +for instruction on how to use this library. + +Jim Plank +plank@cs.utk.edu +http://www.cs.utk.edu/~plank + +Associate Professor +Department of Computer Science +University of Tennessee +203 Claxton Complex +1122 Volunteer Blvd. +Knoxville, TN 37996-3450 + + 865-974-4397 +Fax: 865-974-4404 + */ +#ifndef _JVAL_H_ +#define _JVAL_H_ + +/* The Jval -- a type that can hold any 8-byte type */ + +typedef union { + int i; + long l; + float f; + double d; + void *v; + char *s; + char c; + unsigned char uc; + short sh; + unsigned short ush; + unsigned int ui; + int iarray[2]; + float farray[2]; + char carray[8]; + unsigned char ucarray[8]; + } Jval; + +extern Jval new_jval_i(int); +extern Jval new_jval_l(long); +extern Jval new_jval_f(float); +extern Jval new_jval_d(double); +extern Jval new_jval_v(void *); +extern Jval new_jval_s(char *); +extern Jval new_jval_c(char); +extern Jval new_jval_uc(unsigned char); +extern Jval new_jval_sh(short); +extern Jval new_jval_ush(unsigned short); +extern Jval new_jval_ui(unsigned int); +extern Jval new_jval_iarray(int, int); +extern Jval new_jval_farray(float, float); +extern Jval new_jval_carray_nt(char *); /* Carray is null terminated */ +extern Jval new_jval_carray_nnt(char *); /* Carray is not null terminated */ + /* For ucarray -- use carray, because it uses memcpy */ + +extern Jval JNULL; + +extern int jval_i(Jval); +extern long jval_l(Jval); +extern float jval_f(Jval); +extern double jval_d(Jval); +extern void *jval_v(Jval); +extern char *jval_s(Jval); +extern char jval_c(Jval); +extern unsigned char jval_uc(Jval); +extern short jval_sh(Jval); +extern unsigned short jval_ush(Jval); +extern unsigned int jval_ui(Jval); +extern int *jval_iarray(Jval); +extern float *jval_farray(Jval); +extern char *jval_carray(Jval); + +#endif