Repository: jarun/dslib Branch: master Commit: aacfe9784dd3 Files: 27 Total size: 96.8 KB Directory structure: gitextract_kexsks7t/ ├── .github/ │ └── FUNDING.yml ├── CMakeLists.txt ├── LICENSE ├── Makefile ├── README.md ├── apilist.txt ├── include/ │ ├── avl.h │ ├── common.h │ ├── dlist.h │ ├── log.h │ ├── queue.h │ ├── stack.h │ └── tree.h ├── src/ │ ├── avl.c │ ├── common.c │ ├── dlist.c │ ├── log.c │ ├── queue.c │ ├── stack.c │ └── tree.c └── test/ ├── Makefile ├── avl_Thread_Safe_Test.c ├── test_avl_1.c ├── test_bst_1.c ├── test_dlist_1.c ├── test_queue_1.c └── test_stack_1.c ================================================ FILE CONTENTS ================================================ ================================================ FILE: .github/FUNDING.yml ================================================ # These are supported funding model platforms github: jarun ================================================ FILE: CMakeLists.txt ================================================ set(CMAKE_POSITION_INDEPENDENT_CODE ON) cmake_minimum_required(VERSION 3.12) project(dslib) file(GLOB files CONFIGURE_DEPENDS include/*.h src/*.c) add_library(ds SHARED ${files}) find_package(Threads REQUIRED) target_link_libraries(ds PUBLIC Threads::Threads) target_include_directories(ds PUBLIC $ $ ) if (UNIX) target_link_libraries(ds PRIVATE -Wl,-undefined,dynamic_lookup) endif() file(GLOB files CONFIGURE_DEPENDS test/*.c ) foreach(file IN LISTS files) get_filename_component(test_name ${file} NAME_WE) add_executable(${test_name} ${file}) target_link_libraries(${test_name} PRIVATE ds) add_test(${test_name} ${test_name}) endforeach() include(CTest) ================================================ FILE: LICENSE ================================================ GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. 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 . 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: {project} Copyright (C) {year} {fullname} 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 . 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 . ================================================ FILE: Makefile ================================================ CC = gcc CFLAGS = -Wall -Wextra -Werror -O3 -fPIC $(INCLUDE) SRC = $(wildcard src/*.c) OBJS = $(SRC:%.c=%.o) INCLUDE = -Iinclude TARGET = libds.so.1.0 BINDIR = ./bin HEADERDIR = /usr/include/dslib DESTDIR = /usr/lib all: $(TARGET) $(TARGET): $(OBJS) mkdir -p $(BINDIR) $(CC) $(CFLAGS) -shared -Wl,-soname,libds.so.1 -o $(BINDIR)/$(TARGET) $(OBJS) strip $(BINDIR)/$(TARGET) .PHONY: test clean test: cd test && $(MAKE) clean: rm -f $(OBJS) $(BINDIR)/$(TARGET) rm -rf $(BINDIR) # clean test files too cd test && $(MAKE) clean distclean: clean rm -f *~ install: $(TARGET) install -m755 -d $(HEADERDIR) install -m644 -t $(HEADERDIR) include/*.h install -o root -m 644 $(BINDIR)/$(TARGET) $(DESTDIR)/ ln -sf $(DESTDIR)/$(TARGET) $(DESTDIR)/libds.so.1 ln -sf $(DESTDIR)/libds.so.1 $(DESTDIR)/libds.so uninstall: rm -rf $(HEADERDIR) rm -f $(DESTDIR)/libds.so $(DESTDIR)/libds.so.1 $(DESTDIR)/$(TARGET) ================================================ FILE: README.md ================================================ # dslib `dslib` is a library of cohesive data structures. The goal of `dslib` is to demonstrate how complex data structures (and related algorithms) can be developed by reusing simpler ones. In general, textbooks come with numerous unrelated examples, each relevant to a specific data structure. `dslib`, on the other hand, grows by building on the elementary data structures. The core component is a circular doubly linked list. Library-internal data structures are dynamically (de)allocated. Most of the code conforms to the Linux kernel coding standards (verified against *checkpatch.pl*), other than a few unavoidable instances. `dslib` is an academic library. However, we'll be glad if someone finds any other application of it.

Donate via PayPal!

### Table of Contents - [Building blocks](#building-blocks) - [APIs](#apis) - [Thread-safety](#thread-safety) - [Compilation](#compilation) - [Testing](#testing) - [Developers](#developers) - [Contributions](#contributions) ### Building blocks | DS | Description | | --- | --- | | dlist | Circular doubly linked list. Node has next, prev and data (`void *`, caller (de)allocates) pointers. | | queue | Builds on top of dlist. Each element is a dlist node pointing to the value inserted in the queue. | | stack | Builds on top of dlist. Each element is a dlist node pointing to the value pushed in the stack. | | tree | A binary search tree, stores integers. | | AVL | An AVL tree implementation, stores integers. | | BFS | Iterative Breadth-first search for tree and AVL implemented using the queue. | | DFS | Iterative Depth-first search for tree implemented using the stack. | There are test cases for each DS. Though not very organized, they provide an insight into the usage of `dslib`. ### APIs A complete list of APIs can be found in [apilist.txt](https://github.com/jarun/dslib/blob/master/apilist.txt). Most of the APIs are iterative. The following 2 APIs are recursive and the iterative implementations are left as an exercise: ``` bool delete_tree_node(tree_pp head, int val); bool delete_avl_node(avl_pp head, int val); ``` ### Thread-safety Currently the Thread-Safe mode is implemented only for AVL. The lock functions are in common.h and common.c and it's easy to extend thread-safety in other structures. ### Compilation The following compilation steps are tested on Ubuntu 14.04.4 x86_64: $ git clone https://github.com/jarun/dslib/ $ cd dslib $ make To install `dslib`, run: $ sudo make install To remove `dslib` from your system, run: $ sudo make uninstall Clean up (cleans test executables too): $ make clean ### Testing Make sure `dslib` is installed. To compile test cases under `test` subdirectory: $ sudo make install $ make test Only informative logs are enabled. For DEBUG logs, set: int current_log_level = DEBUG; in the source test file. ### Developers - [Arun Prakash Jana](https://github.com/jarun) (Copyright © 2015) - [Ananya Jana](https://github.com/ananyajana) ### Contributions Contributions are welcome! We would love to see more data structures and APIs added to `dslib`. ================================================ FILE: apilist.txt ================================================ ######################################## 1. Circular Doubly Linked List [dlist.h] ######################################## int add_head_dlist(dlist_pp head, dlist_p node); void *get_head_dlist(dlist_pp head); void *get_tail_dlist(dlist_pp head); int delete_head_dlist(dlist_pp head); int delete_tail_dlist(dlist_pp head); int destroy_dlist(dlist_pp head); int count_nodes_dlist(dlist_pp head); ################## 2. Queue [queue.h] ################## queue_p get_queue(void); bool enqueue(queue_p queue, void *val); void *dequeue(queue_p queue); bool isQueueEmpty(queue_p queue); bool destroy_queue(queue_p queue); ################## 3. Stack [stack.h] ################## stack_p get_stack(void); bool push(stack_p stack, void *val); void *pop(stack_p stack); bool isStackEmpty(stack_p stack); bool destroy_stack(stack_p stack); ############################## 4. Binary Search Tree [tree.h] ############################## tree_pp generate_tree(int *arr, int len); tree_pp init_tree(void); bool insert_tree_node(tree_pp head, int val); bool delete_tree_node(tree_pp head, int val); int destroy_tree(tree_pp head); int print_tree(tree_p root); int search_BFS(tree_pp root, int val, bool stop); int search_DFS(tree_pp root, int val, bool stop); ################### 5. AVL Tree [avl.h] ################### avl_pp generate_avl(int *arr, int len); avl_pp init_avl(void); bool insert_avl_node(avl_pp head, int val); bool delete_avl_node(avl_pp head, int val); int destroy_avl(avl_pp head); int print_avl(avl_p root, avl_p parent); int search_BFS_avl(avl_pp root, int val, bool stop); ================================================ FILE: include/avl.h ================================================ /* * AVL Tree abstraction * Ref: https://en.wikipedia.org/wiki/AVL_tree * * Author: Arun Prakash Jana * Copyright (C) 2015 by Arun Prakash Jana * * 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 dslib. If not, see . */ #include "common.h" #pragma once typedef struct avl { int keyNode; int data; struct avl *left; struct avl *right; int height; } avl_t, *avl_p, **avl_pp; /* Generate AVL tree from an array of input values */ avl_pp generate_avl(int *arr, int len); /* Initialize an AVL tree */ avl_pp init_avl(void); /* Insert a node in AVL tree */ bool insert_avl_node(avl_pp head, int key, int data); /* Delete a node from AVL tree */ bool delete_avl_node(avl_pp head, int key); /* Destroy the tree */ int destroy_avl(avl_pp head); // avl will be destroy isn't necessary sincronize it (is better not destroy) /* Print a tree in preorder */ int print_avl(avl_p root, avl_p parent); /* Traverse tree in BFS to find a given value */ int search_BFS_avl(avl_pp root, int key, bool stop); /*=======================================================*/ /* Library ThreadSafe APIs start here */ /*=======================================================*/ //The struct is a generalization of avl_pp, to include for every tree one semaphore typedef struct avlThSafe { avl_pp avlRoot; int semId; } avl_pp_S; /* Generate AVL tree from an array of input values */ avl_pp_S generate_avl_S(int *arr, int len); /* Initialize an AVL tree */ avl_pp_S init_avl_S(void); /* Insert a node in AVL tree */ bool insert_avl_node_S(avl_pp_S head, int key, int data); /* Delete a node from AVL tree */ bool delete_avl_node_S(avl_pp_S head, int key); /* Destroy the tree */ /** [][] avl will be destroy isn't necessary sincronize it (is better not destroy) **/ /* Print a tree in preorder, start by root */ int print_avl_S(avl_pp_S root); /* Traverse tree in BFS to find a given value */ int search_BFS_avl_S(avl_pp_S root, int key, bool stop); ================================================ FILE: include/common.h ================================================ /* * Common header file for dslib * * Author: Arun Prakash Jana * Copyright (C) 2015 by Arun Prakash Jana * * 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 dslib. If not, see . */ #include "log.h" #pragma once #include #include #include #include #include /* Introduce boolean type */ #define TRUE 1 #define FALSE !TRUE #define LEFT 0 #define RIGHT 1 typedef unsigned char bool; /*=======================================================*/ /* Syncronize for ThreadSafe APIs start here */ /*=======================================================*/ enum semName {wantWrite=0,readWorking=1,writeWorking=2}; int semInit(); /*#######################################*/ /* Lock/unlock for writers function */ /*#######################################*/ int lockWriteSem(int semId); int unlockWriteSem(int semId); /*#######################################*/ /* Lock/unlock for readers function */ /*#######################################*/ int lockReadSem(int semId); int unlockReadSem(int semId); //semInfo print void semInfo(int semId); /* The scheme of synchronization is easy: (i use system 5) There are 3 semaphore: wantWrite,readWorking and writeWorking (last like mutex, and the first two are counter in fact) READER: If more than one read-funx(like search) need to read data it will be wait until wantWrite!=0. ATOMICALLY it add at readWorking +1, to start only if no one write are current at working. After, ALL READER-funx can be work and finally decrease readWorking counter (this in concurrency). WRITER: to start it add wantWrite +1, (to signal at new reader, it si necessary to waiting) after the writers WAIT until all reader just at work finish. then, writer-funx can lock writeWorking to write one at time (is a mutex), enter in critic section, and at the end unlock writeWorking. Finally decrement wantWrite -1, and finish. */ ================================================ FILE: include/dlist.h ================================================ /* * Circular Doubly Linked List abstraction * * Author: Arun Prakash Jana * Copyright (C) 2015 by Arun Prakash Jana * * 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 dslib. If not, see . */ #include "common.h" #pragma once /* Circular Doubly Linked List ADT */ typedef struct dlist { void *data; struct dlist *next; struct dlist *prev; } dlist_t, *dlist_p, **dlist_pp; /* Add node at head of list */ int add_head_dlist(dlist_pp head, dlist_p node); /* Get the head of list */ void *get_head_dlist(dlist_pp head); /* Get the tail of list */ void *get_tail_dlist(dlist_pp head); /* Delete the head of list */ int delete_head_dlist(dlist_pp head); /* Delete the tail of list */ int delete_tail_dlist(dlist_pp head); /* Clean up list */ int destroy_dlist(dlist_pp head); /* Count total nodes in list */ int count_nodes_dlist(dlist_pp head); ================================================ FILE: include/log.h ================================================ /* * A modular, level based log file implementation * * Author: Arun Prakash Jana * Copyright (C) 2014 by Arun Prakash Jana * * 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 dslib. If not, see . */ #pragma once #include #include #define ERROR 0 #define INFO 1 #define DEBUG 2 #define log(level, format, ...) \ debug_log(__FILE__, __func__, __LINE__, \ level, format, ##__VA_ARGS__) void debug_log(const char *file, const char *func, int line, int level, const char *format, ...) __attribute__((__format__(printf, 5, 6))); ================================================ FILE: include/queue.h ================================================ /* * Queue abstraction * * Author: Arun Prakash Jana * Copyright (C) 2015 by Arun Prakash Jana * * 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 dslib. If not, see . */ #include "dlist.h" #pragma once /* Queue ADT using a circular doubly linked list */ typedef struct { dlist_pp head; } queue_t, *queue_p; /* Create a new Queue */ queue_p get_queue(void); /* Add a value to Queue */ bool enqueue(queue_p queue, void *val); /* Remove a value from Queue */ void *dequeue(queue_p queue); /* Check if the Queue is empty */ bool isQueueEmpty(queue_p queue); /* Clean up Queue */ bool destroy_queue(queue_p queue); ================================================ FILE: include/stack.h ================================================ /* * Stack abstraction * * Author: Arun Prakash Jana * Copyright (C) 2015 by Arun Prakash Jana * * 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 dslib. If not, see . */ #include "dlist.h" #pragma once /* Stack ADT using a circular doubly linked list */ typedef struct { dlist_pp head; } stack_t, *stack_p; /* Create a new Stack */ stack_p get_stack(void); /* Push a value to Stack */ bool push(stack_p stack, void *val); /* Pop a value from Stack */ void *pop(stack_p stack); /* Check if a stack is empty */ bool isStackEmpty(stack_p stack); /* Clean up Stack */ bool destroy_stack(stack_p stack); ================================================ FILE: include/tree.h ================================================ /* * Binary Search Tree abstraction * * Author: Ananya Jana * Copyright (C) 2015 by Arun Prakash Jana * * 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 dslib. If not, see . */ #include "common.h" #pragma once typedef struct tree { int data; struct tree *left; struct tree *right; } tree_t, *tree_p, **tree_pp; /* Generate tree from an array of input values */ tree_pp generate_tree(int *arr, int len); /* Initalize a tree */ tree_pp init_tree(void); /* Insert a node in tree */ bool insert_tree_node(tree_pp head, int val); /* Delete a node from tree */ bool delete_tree_node(tree_pp head, int val); /* Destroy the tree */ int destroy_tree(tree_pp head); /* Print a tree in preorder */ int print_tree(tree_p root); /* Traverse tree in BFS to find a given value */ bool search_BFS(tree_pp root, int val, bool stop); /* Traverse tree in DFS to find a given value */ bool search_DFS(tree_pp root, int val, bool stop); ================================================ FILE: src/avl.c ================================================ /* * AVL Tree implementation * * Author: Arun Prakash Jana * Copyright (C) 2015 by Arun Prakash Jana * * 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 dslib. If not, see . */ #include "stack.h" #include "queue.h" #include "avl.h" /* * Struct to hold an AVL node and traversal * direction (left or right) to child node */ typedef struct { avl_p node; int direction; } nodedata, *nodedata_p; /* * Calculate the height of a node in AVL tree */ int height(avl_p node) { int lh, rh; if (!node) return 0; node->left == NULL ? lh = 0 : (lh = 1 + node->left->height); node->right == NULL ? rh = 0 : (rh = 1 + node->right->height); return (lh >= rh ? lh : rh); } /* * Calculate balance factor of subtree */ int BalanceFactor(avl_p node) { int lh, rh; if (!node) return 0; node->left == NULL ? lh = 0 : (lh = 1 + node->left->height); node->right == NULL ? rh = 0 : (rh = 1 + node->right->height); return (lh - rh); } /* * Rotate a node towards right */ avl_p RotateRight(avl_p node) { avl_p left_node = node->left; node->left = left_node->right; left_node->right = node; node->height = height(node); left_node->height = height(left_node); return left_node; } /* * Rotate a node towards left */ avl_p RotateLeft(avl_p node) { avl_p right_node = node->right; node->right = right_node->left; right_node->left = node; node->height = height(node); right_node->height = height(right_node); return right_node; } /* * Adjust a right right skewed subtree */ avl_p RightRight(avl_p node) { return RotateLeft(node); } /* * Adjust a left left skewed subtree */ avl_p LeftLeft(avl_p node) { return RotateRight(node); } /* * Adjust a left right skewed subtree */ avl_p LeftRight(avl_p node) { node->left = RotateLeft(node->left); return RotateRight(node); } /* * Adjust a right left skewed subtree */ avl_p RightLeft(avl_p node) { node->right = RotateRight(node->right); return RotateLeft(node); } /* * Rebalance subtree tmp based on balance factor & skew */ bool rebalance(stack_p stack, avl_pp head, avl_p tmp, int data) { nodedata_p p = NULL; int direction; avl_p parent = NULL; bool modified = TRUE; if (BalanceFactor(tmp) == -2) { /* Right subtree longer */ p = pop(stack); if (p) { parent = p->node; direction = p->direction; } if (data >= tmp->right->keyNode) { /* Right-right skewed subtree */ if (p) direction == RIGHT ? (parent->right = RightRight(tmp)) : (parent->left = RightRight(tmp)); else /* If p is NULL, this is the topmost node, update *head */ *head = RightRight(tmp); } else { /* Right-left skewed subtree */ if (p) direction == RIGHT ? (parent->right = RightLeft(tmp)) : (parent->left = RightLeft(tmp)); else *head = RightLeft(tmp); } } else if (BalanceFactor(tmp) == 2) { /* Left subtree longer */ p = pop(stack); if (p) { parent = p->node; direction = p->direction; } /* If p is NULL, this is the topmost node, update *head */ if (data < tmp->left->keyNode) { /* Left-left skewed subtree */ if (p) direction == RIGHT ? (parent->right = LeftLeft(tmp)) : (parent->left = LeftLeft(tmp)); else *head = LeftLeft(tmp); } else { /* Left-right skewed subtree */ if (p) direction == RIGHT ? (parent->right = LeftRight(tmp)) : (parent->left = LeftRight(tmp)); else *head = LeftRight(tmp); } } else modified = FALSE; if (p) free(p); tmp->height = height(tmp); return modified; } /* * Delete all nodes of an AVL tree */ int delete_avl_nodes(avl_p root) { int count = 0; if (!root) { log(ERROR, "root invalid.\n"); return 0; } if (root->left) count += delete_avl_nodes(root->left); if (root->right) count += delete_avl_nodes(root->right); free(root); root = NULL; return ++count; } /*=======================================================*/ /* Library exposed APIs start here */ /*=======================================================*/ /* * Generate an AVL tree iteratively from an array of integers */ avl_pp generate_avl(int *arr, int len) { avl_pp head = NULL; if (!arr || !len) { log(ERROR, "Invalid array.\n"); return NULL; } head = init_avl(); for (int i = 0; i < len; i++) { if (insert_avl_node(head, i, arr[i]) == FALSE) { log(ERROR, "Insertion failed.\n"); destroy_avl(head); return NULL; } } return head; } /* * Initialize an AVL tree with empty root node */ avl_pp init_avl(void) { avl_pp head = calloc(1, sizeof(avl_p)); *head = NULL; return head; } /* * Insert a new node into AVL tree */ bool insert_avl_node(avl_pp head, int key, int data) { avl_p root = NULL; nodedata_p p = NULL; nodedata_p n = NULL; bool modified; if (!head) { log(ERROR, "Initialize AVL tree first\n"); return FALSE; } root = *head; if (!root) { root = (avl_p) calloc(1, sizeof(avl_t)); root->keyNode = key; root->data = data; *head = root; return TRUE; } /* Stack to rebalance each subtree bottom-up after insertion */ stack_p stack = get_stack(); //until current node isn't Null while (root) { //if keyNod < of key to add, go left of tree if (key < root->keyNode) { //if left null, add node as left son if (!root->left) { /* Create an AVL node for new value */ root->left = calloc(1, sizeof(avl_t)); root->left->keyNode = key; root->left->data = data; root->height = height(root); modified = FALSE; /* Unwind stack & rebalance nodes (only once) */ while ((p = pop(stack)) != NULL) { /* One rebalance for one insertion */ if (!modified) modified = rebalance(stack, head, p->node, key); free(p); } break; } /* Push the parent node and traversal direction in stack as we traverse down */ n = malloc(sizeof(nodedata)); n->node = root; n->direction = LEFT; push(stack, n); /* Traverse further left */ root = root->left; } else { //key to add is >= then current key node //if right son null add son on it if (!root->right) { root->right = calloc(1, sizeof(avl_t)); root->right->keyNode = key; root->right->data = data; root->height = height(root); modified = FALSE; while ((p = pop(stack)) != NULL) { if (!modified) modified = rebalance(stack, head, p->node, key); free(p); } break; } n = malloc(sizeof(nodedata)); n->node = root; n->direction = RIGHT; push(stack, n); root = root->right; } } destroy_stack(stack); return TRUE; } /* * Delete a node from AVL tree * Recursive method */ bool delete_avl_node(avl_pp head, int key) { avl_p node; avl_p tmp; if (!head) { log(ERROR, "Initialize AVL tree first\n"); return FALSE; } node = *head; if (!node) { log(ERROR, "No nodes to delete\n"); return FALSE; } if (key > node->keyNode) { if (!node->right) return FALSE; if (delete_avl_node(&(node->right), key) == FALSE) return FALSE; if (BalanceFactor(node) == 2) { if (BalanceFactor(node->left) >= 0) node = LeftLeft(node); else node = LeftRight(node); } } else if (key < node->keyNode) { if (!node->left) return FALSE; if (delete_avl_node(&(node->left), key) == FALSE) return FALSE; if (BalanceFactor(node) == -2) { if (BalanceFactor(node->right) <= 0) node = RightRight(node); else node = RightLeft(node); } } else { /* Match found */ if (node->right) { /* Delete the inorder successor */ tmp = node->right; while (tmp->left) tmp = tmp->left; node->keyNode = tmp->keyNode; if (delete_avl_node(&(node->right), tmp->keyNode) == FALSE) return FALSE; if (BalanceFactor(node) == 2) { if (BalanceFactor(node->left) >= 0) node = LeftLeft(node); else node = LeftRight(node); } } else { *head = node->left; free(node); return TRUE; } } node->height = height(node); *head = node; return TRUE; } /* * Destroy an AVL tree */ int destroy_avl(avl_pp head) { int count = 0; if (!head) { log(ERROR, "head invalid.\n"); return -1; } count = delete_avl_nodes(*head); free(head); head = NULL; return count; } /* * Print the values in an AVL tree in preorder */ int print_avl(avl_p root, avl_p parent) { int count = 0; if (!root) { log(ERROR, "root invalid.\n"); return -1; } ++count; /* Print key:data values in the node */ log(INFO, "key:data=%6d:%d, parent key=%6d\n", root->keyNode, root->data, parent->keyNode); if (root->left) { log(INFO, "LEFT.\n"); count += print_avl(root->left, root); } if (root->right) { log(INFO, "RIGHT.\n"); count += print_avl(root->right, root); } return count; } /* * AVL Tree Breadth First Search implementation * Implements iterative search using a Queue * Checks for a match before adding a node to Queue * * PARAMS * ------ * root: pointer to the root node pointer of an AVL tree * val : value to search * stop: TRUE: stop if Key is found and return val. * FALSE: continue visiting of tree, print debug info and return the val of the last key. */ int search_BFS_avl(avl_pp root, int key, bool stop) { //return -1 is error //return -2 is not Found avl_p node = NULL; queue_p queue = NULL; int ret = -2; //start with no found if (!root || !*root) { log(ERROR, "avl tree or root node is NULL!\n"); return -2; //because avl is empty so key is not found } /* Check for a match in root node */ node = *root; if (node->keyNode == key) { if (!stop) log(INFO, "FOUND %d\n", key); if (stop) ret = node->data; else ret = node->data; } queue = get_queue(); /* Add root node to Queue */ if (!enqueue(queue, *root)) { log(ERROR, "enqueue failed!\n"); destroy_queue(queue); return -1; } /* Loop through all nodes in the Queue */ while ((node = dequeue(queue)) != NULL) { if (!stop) log(INFO, "tracking...\n"); /* Process left child of node */ if (node->left) { if (node->left->keyNode == key) { if (stop) ret = node->left->data; else { log(INFO, "FOUND %d\n", key); ret = node->right->data; } break; } /* Add left child to Queue */ if (!enqueue(queue, node->left)) { log(ERROR, "enqueue failed!\n"); destroy_queue(queue); return -1; } } /* Process right child of node */ if (node->right) { if (node->right->keyNode == key) { if (stop) ret = node->right->data; else { log(INFO, "FOUND %d\n", key); ret = node->left->data; } break; } /* Add right child to Queue */ if (!enqueue(queue, node->right)) { log(ERROR, "enqueue failed!\n"); destroy_queue(queue); return -1; } } } /* Report if no match was found */ destroy_queue(queue); return ret; } /*=======================================================*/ /* Library ThreadSafe APIs start here */ /*=======================================================*/ /* * Generate an AVL tree iteratively from an array of integers */ avl_pp_S generate_avl_S(int *arr, int len) { int i = 0; avl_pp_S head; if (!arr || !len) { log(ERROR, "Invalid array.\n"); head.avlRoot = NULL; return head; } head = init_avl_S(); for (; i < len; i++) { if (insert_avl_node(head.avlRoot, i, arr[i]) == FALSE) { log(ERROR, "Insertion failed.\n"); destroy_avl(head.avlRoot); head.avlRoot = NULL; return head; } } return head; } avl_pp_S init_avl_S(void) { avl_pp_S head; head.semId = semInit(); if (head.semId == -1) { perror("Sem Setup failed"); head.avlRoot = NULL; return head; } head.avlRoot = calloc(1, sizeof(avl_p)); *head.avlRoot = NULL; return head; } bool insert_avl_node_S(avl_pp_S head, int key, int data) { bool ret; lockWriteSem(head.semId); ret = insert_avl_node(head.avlRoot, key, data); unlockWriteSem(head.semId); return ret; } bool delete_avl_node_S(avl_pp_S head, int key) { bool ret; lockWriteSem(head.semId); ret = delete_avl_node(head.avlRoot, key); unlockWriteSem(head.semId); return ret; } int search_BFS_avl_S(avl_pp_S root, int key, bool stop) { int ret; lockReadSem(root.semId); ret = search_BFS_avl(root.avlRoot, key, stop); unlockReadSem(root.semId); return ret; } int print_avl_S(avl_pp_S root) { int ret; lockReadSem(root.semId); ret = print_avl(*root.avlRoot, *root.avlRoot); unlockReadSem(root.semId); return ret; } ================================================ FILE: src/common.c ================================================ // // Created by alfylinux on 21/10/18. // #include "common.h" int semInit() { int semId = semget(IPC_PRIVATE,3, IPC_CREAT | IPC_EXCL | 0666); if (semId == -1) { perror("Create Sem-s take error:"); return -1; } //enum semName {wantWrite=0,readWorking=1,writeWorking=2}; number is Id of sem unsigned short semStartVal[3] = {0, 0, 1}; //setup 3 semaphore in system5 if (semctl(semId, 0, SETALL, semStartVal)) { perror("set Sem take error:"); return -1; } printf("SEMAFORO Created\n"); semInfo(semId); return semId; } int lockWriteSem(int semId) { struct sembuf sem; sem.sem_flg = SEM_UNDO; //increase counter wantWrite sem.sem_num = wantWrite; sem.sem_op = +1; SEM_wantWrite: if (semop(semId, &sem, 1)) { switch (errno) { case EINTR: goto SEM_wantWrite; break; default: perror("increase wantWrite semCount error:"); return -1; break; } } //wait until =0 readerWork sem.sem_num = readWorking; sem.sem_op = 0; SEM_waitReaders: if (semop(semId, &sem, 1)) { switch (errno) { case EINTR: goto SEM_waitReaders; break; default: perror("wait until 0 readWorking take error:"); return -1; break; } } //wait noThread already work sem.sem_num = writeWorking; sem.sem_op = -1; SEM_writeWorking: if (semop(semId, &sem, 1)) { switch (errno) { case EINTR: goto SEM_writeWorking; break; default: perror("lock writeWorking error:"); return -1; break; } } return 0; } int unlockWriteSem(int semId) { struct sembuf sem; sem.sem_flg = SEM_UNDO; //signal finish writing work sem.sem_num = writeWorking; sem.sem_op = 1; SEM_writeWorking: if (semop(semId, &sem, 1)) { switch (errno) { case EINTR: goto SEM_writeWorking; break; default: perror("unlock writeWorking error:"); return -1; break; } } //reduce counter of wantWrite sem.sem_num = wantWrite; sem.sem_op = -1; SEM_wantWrite: if (semop(semId, &sem, 1)) { switch (errno) { case EINTR: goto SEM_wantWrite; break; default: perror("decrease wantWrite semCount error:"); return -1; break; } } return 0; } int lockReadSem(int semId) { struct sembuf sem[2]; sem[0].sem_num = wantWrite; sem[0].sem_flg = SEM_UNDO; sem[1].sem_num = readWorking; sem[1].sem_flg = SEM_UNDO; //to be sure not concurrency problem, read Thread must be wait until no writes works, and instantly increase his counter sem[0].sem_op = 0; sem[1].sem_op = +1; SEM_wantWrite_readWorking: if (semop(semId, sem, 2)) { switch (errno) { case EINTR: goto SEM_wantWrite_readWorking; break; default: perror("lockRead sem take error:"); return -1; break; } } return 0; } int unlockReadSem(int semId) { struct sembuf sem; sem.sem_flg = SEM_UNDO; sem.sem_num = readWorking; sem.sem_op = -1; SEM_readWorking: if (semop(semId, &sem, 1)) { switch (errno) { case EINTR: goto SEM_readWorking; break; default: perror("unlockRead sem take error:"); return -1; break; } } return 0; } void semInfo(int semId) { unsigned short semInfo[3]; semctl(semId, 0, GETALL, semInfo); //enum semName {wantWrite=0,readWorking=1,writeWorking=2}; printf("\nsem writeWorking=%d\n", semInfo[writeWorking]); printf("sem readWorking=%d\n", semInfo[readWorking]); printf("sem wantWrite=%d\n", semInfo[wantWrite]); } ================================================ FILE: src/dlist.c ================================================ /* * Circular Doubly Linked List implementation * * Author: Arun Prakash Jana * Copyright (C) 2015 by Arun Prakash Jana * * 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 dslib. If not, see . */ #include "dlist.h" /* * Add a node to the head of dlist */ int add_head_dlist(dlist_pp head, dlist_p node) { if (!node) { log(ERROR, "node is NULL!\n"); return -1; } if (!head) { log(ERROR, "head is NULL!\n"); return -1; } if (!*head) { node->next = node; node->prev = node; *head = node; return 1; } node->next = *head; /* Current head become head->next */ node->prev = (*head)->prev; (*head)->prev->next = node; (*head)->prev = node; *head = node; return 1; } /* * Get the value in the head node of dlist * The node is not deleted */ void *get_head_dlist(dlist_pp head) { if (!head || !*head) { log(DEBUG, "head or first node is NULL!\n"); return NULL; } return (*head)->data; } /* * Get the value in the tail node of dlist * The node is not deleted */ void *get_tail_dlist(dlist_pp head) { if (!head || !*head) { log(DEBUG, "head or first node is NULL!\n"); return NULL; } return (*head)->prev->data; } /* * Delete the head node of dlist */ int delete_head_dlist(dlist_pp head) { dlist_p tmp; if (!head || !*head) { log(DEBUG, "No nodes to delete!\n"); return -1; } if (*head == (*head)->next) { free(*head); *head = NULL; return 1; } tmp = *head; (*head)->data = NULL; (*head)->prev->next = (*head)->next; (*head)->next->prev = (*head)->prev; *head = (*head)->next; /* head->next becomes next head */ free(tmp); return 1; } /* * Delete the tail node of dlist */ int delete_tail_dlist(dlist_pp head) { dlist_p tmp; if (!head || !*head) { log(DEBUG, "head or first node is NULL!\n"); return -1; } if (*head == (*head)->next) { free(*head); *head = NULL; return 1; } tmp = (*head)->prev; tmp->data = NULL; tmp->prev->next = tmp->next; /* tail->prev becomes new tail */ tmp->next->prev = tmp->prev; free(tmp); return 1; } /* * Deallocate all memory and destroy the dlist * Returns the number of nodes deleted */ int destroy_dlist(dlist_pp head) { dlist_p tmp; int deleted = 0; if (!head) { log(DEBUG, "head is NULL.\n"); return -1; } if (!*head) { log(DEBUG, "No nodes to delete.\n"); return 0; } /* Set tail->next to NULL to end deletion loop */ (*head)->prev->next = NULL; while (*head) { tmp = *head; (*head)->data = NULL; (*head)->prev = NULL; *head = (*head)->next; free(tmp); deleted++; } return deleted; } /* * Count the total number of nodes in the dlist */ int count_nodes_dlist(dlist_pp head) { dlist_p tmp; int count = 0; if (!head || !*head) { log(DEBUG, "head or first node is NULL!\n"); return -1; } tmp = *head; do { count++; tmp = tmp->next; } while (tmp != *head); return count; } ================================================ FILE: src/log.c ================================================ /* * A modular, level based log file implementation * * Author: Arun Prakash Jana * Copyright (C) 2014 by Arun Prakash Jana * * 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 dslib. If not, see . */ #include "log.h" extern int current_log_level; char *logarr[] = {"ERROR", "INFO", "DEBUG"}; void debug_log(const char *file, const char *func, int line, int level, const char *format, ...) { va_list ap; va_start(ap, format); if (level < 0 || level > DEBUG) return; if (level <= current_log_level) { fprintf(stderr, "[%s, %s(), ln %d] %s: ", file, func, line, logarr[level]); vfprintf(stderr, format, ap); } va_end(ap); } ================================================ FILE: src/queue.c ================================================ /* * Queue implementation * * Author: Arun Prakash Jana * Copyright (C) 2015 by Arun Prakash Jana * * 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 dslib. If not, see . */ #include "queue.h" /* * Create a new Queue * Alocate a head node */ queue_p get_queue(void) { queue_p queue = calloc(1, sizeof(queue_t)); queue->head = calloc(1, sizeof(dlist_pp)); return queue; } /* * Add a value to Queue * Allocates a new dlist node and inserts value */ bool enqueue(queue_p queue, void *val) { dlist_p nodeptr = calloc(1, sizeof(dlist_t)); nodeptr->data = val; return (add_head_dlist(queue->head, nodeptr) == 1); /* Last In */ } /* * Remove the value at the front of the Queue * Deallocates the dlist node holding the value */ void *dequeue(queue_p queue) { void *data = get_tail_dlist(queue->head); /* Last Out */ if (delete_tail_dlist(queue->head) == -1) log(DEBUG, "head or first node is NULL!\n"); return data; } /* * Check if a Queue has any elements */ bool isQueueEmpty(queue_p queue) { if (get_head_dlist(queue->head)) return TRUE; return FALSE; } /* * Deallocate all dlist nodes * Destroy Queue */ bool destroy_queue(queue_p queue) { if (destroy_dlist(queue->head) == -1) return FALSE; free(queue->head); free(queue); return TRUE; } ================================================ FILE: src/stack.c ================================================ /* * Stack implementation * * Author: Arun Prakash Jana * Copyright (C) 2015 by Arun Prakash Jana * * 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 dslib. If not, see . */ #include "stack.h" /* * Create a new Stack * Alocate a head node */ stack_p get_stack(void) { stack_p stack = calloc(1, sizeof(stack_t)); stack->head = calloc(1, sizeof(dlist_pp)); return stack; } /* * Push a value to Stack * Allocates a new dlist node and inserts value */ bool push(stack_p stack, void *val) { dlist_p nodeptr = calloc(1, sizeof(dlist_t)); nodeptr->data = val; return (add_head_dlist(stack->head, nodeptr) == 1); /* Last In */ } /* * Pop a value from Stack * Deallocates the dlist node holding the value */ void *pop(stack_p stack) { void *data = get_head_dlist(stack->head); /* First out */ if (delete_head_dlist(stack->head) == -1) log(DEBUG, "head or first node is NULL!\n"); return data; } /* * Check if a stack has any elements */ bool isStackEmpty(stack_p stack) { if (get_head_dlist(stack->head)) return TRUE; return FALSE; } /* * Deallocate all dlist nodes * Destroy Stack */ bool destroy_stack(stack_p stack) { if (destroy_dlist(stack->head) == -1) return FALSE; free(stack->head); free(stack); return TRUE; } ================================================ FILE: src/tree.c ================================================ /* * Iterative Binary Search Tree implementation * * Author: Ananya Jana * Copyright (C) 2015 by Arun Prakash Jana * * 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 dslib. If not, see . */ #include "queue.h" #include "stack.h" #include "tree.h" /* * Delete all nodes of a tree */ int delete_tree_nodes(tree_p root) { int count = 0; if (!root) { log(ERROR, "root invalid.\n"); return -1; } if (root->left) count += delete_tree_nodes(root->left); if (root->right) count += delete_tree_nodes(root->right); free(root); root = NULL; return ++count; } /*=======================================================*/ /* Library exposed APIs start here */ /*=======================================================*/ /* * Generate a tree from an array of integers */ tree_pp generate_tree(int *arr, int len) { int i = 0; tree_pp head = NULL; if (!arr || !len) { log(ERROR, "Invalid array.\n"); return NULL; } head = init_tree(); for (; i < len; i++) { if (insert_tree_node(head, arr[i]) == FALSE) { log(ERROR, "Insertion failed.\n"); destroy_tree(head); return NULL; } } return head; } /* * Initialize a tree with empty root node */ tree_pp init_tree(void) { tree_pp head = calloc(1, sizeof(tree_p)); *head = NULL; return head; } /* * Insert a new node into tree */ bool insert_tree_node(tree_pp head, int val) { tree_p root = NULL; if (!head) { log(ERROR, "Initialize tree first.\n"); return FALSE; } root = *head; while (root) { if (val < root->data) { if (!root->left) { root->left = calloc(1, sizeof(tree_t)); root = root->left; root->data = val; return TRUE; } root = root->left; } else if (val > root->data) { /* Insert greater elements in right subtree */ if (!root->right) { root->right = calloc(1, sizeof(tree_t)); root = root->right; root->data = val; return TRUE; } root = root->right; } else { log(ERROR, "BST must have unique values.\n"); break; } } if (!*head) { root = (tree_p) calloc(1, sizeof(tree_t)); root->data = val; *head = root; return TRUE; } return FALSE; } /* * Delete a node from tree */ bool delete_tree_node(tree_pp head, int val) { tree_p root = NULL; tree_p prev = NULL; int direction; if (!head) { log(ERROR, "Initialize tree first.\n"); return FALSE; } root = *head; while (root) { if (val < root->data) { if (!root->left) break; prev = root; direction = LEFT; root = root->left; } else if (val > root->data) { /* Greater elements are in right subtree */ if (!root->right) break; prev = root; direction = RIGHT; root = root->right; } else { /* Match found */ if (!root->left) { if (prev) { if (direction == LEFT) prev->left = root->right; else prev->right = root->right; } else /* This was the root node */ *head = root->right; free(root); return TRUE; } else if (!root->right) { if (prev) { if (direction == LEFT) prev->left = root->left; else prev->right = root->left; } else /* This was the root node */ *head = root->left; free(root); return TRUE; } else { /* Both subtrees have children */ /* Delete inorder successor */ tree_p min = root->right; while (min->left) min = min->left; root->data = min->data; /* Let's use some recursion here */ delete_tree_node(&(root->right), min->data); return TRUE; } } } /* Fall through if root is NULL */ return FALSE; } /* * Destroy a tree */ int destroy_tree(tree_pp head) { int count = 0; if (!head) { log(ERROR, "head invalid.\n"); return -1; } count = delete_tree_nodes(*head); free(head); head = NULL; return count; } /* * Print the values in a tree in preorder */ int print_tree(tree_p root) { int count = 0; if (!root) { log(ERROR, "root invalid.\n"); return -1; } log(DEBUG, "keyNode: %d.\n", root->data); ++count; if (root->left) count += print_tree(root->left); if (root->right) count += print_tree(root->right); return count; } /* * Tree Breadth First Search implementation * Implements iterative search using a Queue * Checks for a match before adding a node to Queue * * PARAMS * ------ * root: pointer to the root node pointer of a tree * val : value to search * stop: stop if val is found */ bool search_BFS(tree_pp root, int val, bool stop) { tree_p node = NULL; queue_p queue = NULL; int ret = FALSE; if (!root || !*root) { log(ERROR, "tree or root node is NULL!\n"); return FALSE; } /* Check for a match in root node */ node = *root; if (node->data == val) { log(INFO, "FOUND %d\n", val); if (stop) return TRUE; } queue = get_queue(); /* Add root node to Queue */ if (!enqueue(queue, *root)) { log(ERROR, "enqueue failed!\n"); destroy_queue(queue); return FALSE; } /* Loop through all nodes in the Queue */ while ((node = dequeue(queue)) != NULL) { log(INFO, "tracking...\n"); /* Process left child of node */ if (node->left) { if (node->left->data == val) { log(INFO, "FOUND %d\n", val); ret = TRUE; if (stop) break; } /* Add left child to Queue */ if (!enqueue(queue, node->left)) { log(ERROR, "enqueue failed!\n"); destroy_queue(queue); return FALSE; } } /* Process right child of node */ if (node->right) { if (node->right->data == val) { log(INFO, "FOUND %d\n", val); ret = TRUE; if (stop) break; } /* Add right child to Queue */ if (!enqueue(queue, node->right)) { log(ERROR, "enqueue failed!\n"); destroy_queue(queue); return FALSE; } } } /* Report if no match was found */ if (!ret) log(INFO, "NOT FOUND\n"); destroy_queue(queue); return ret; } /* * Tree Depth First Search implementation * Implements iterative search using a Stack * Checks for a match before adding a node to Stack * * PARAMS * ------ * root: pointer to the root node pointer of a tree * val : value to search * stop: stop if val is found */ bool search_DFS(tree_pp root, int val, bool stop) { int ret = FALSE; tree_p node = NULL; stack_p stack = NULL; if (!root || !*root) { log(ERROR, "tree or root node is NULL.\n"); return FALSE; } /* Check for a match in root node */ node = *root; if (node->data == val) { log(INFO, "FOUND %d\n", val); if (stop) return TRUE; } stack = get_stack(); /* Add root node to Stack */ if (!push(stack, *root)) { log(ERROR, "push failed!\n"); destroy_stack(stack); return FALSE; } /* Process all valid nodes */ while (node) { log(INFO, "tracking...\n"); /* Match and add complete left subtree to Stack */ while (node->left) { if (node->left->data == val) { log(INFO, "FOUND %d\n", val); ret = TRUE; if (stop) { node = NULL; break; } } /* Add node to stack */ if (!push(stack, node->left)) { log(ERROR, "push failed!\n"); destroy_stack(stack); return FALSE; } node = node->left; } while ((node = pop(stack)) != NULL) { /* Process right child of node */ if (node->right) { if (node->right->data == val) { log(INFO, "FOUND %d\n", val); ret = TRUE; if (stop) { node = NULL; break; } } /* Add right child to Stack */ if (!push(stack, node->right)) { log(ERROR, "push failed!\n"); destroy_stack(stack); return FALSE; } node = node->right; /* Break inner loop if there's a right node */ break; } } } /* Report if no match was found */ if (!ret) log(INFO, "NOT FOUND\n"); destroy_stack(stack); return ret; } ================================================ FILE: test/Makefile ================================================ CC = gcc CFLAGS = -Wall -Wextra -g -fsanitize=address,undefined $(INCLUDE) #INCLUDE = -I/usr/include/dslib #LIBS = -lds #SRCDIR = INCLUDE = -I../include LIBS = SRCDIR = ../src/*.c all: $(CC) $(CFLAGS) $(INCLUDE) $(SRCDIR) -o test_avl_1 test_avl_1.c $(LIBS) $(CC) $(CFLAGS) $(INCLUDE) $(SRCDIR) -o test_bst_1 test_bst_1.c $(LIBS) $(CC) $(CFLAGS) $(INCLUDE) $(SRCDIR) -o test_dlist_1 test_dlist_1.c $(LIBS) $(CC) $(CFLAGS) $(INCLUDE) $(SRCDIR) -o test_queue_1 test_queue_1.c $(LIBS) $(CC) $(CFLAGS) $(INCLUDE) $(SRCDIR) -o test_stack_1 test_stack_1.c $(LIBS) $(CC) $(CFLAGS) $(INCLUDE) $(SRCDIR) -o avl_Thread_Safe_Test avl_Thread_Safe_Test.c $(LIBS) -lpthread .PHONY: clean clean: rm -f test_avl_1 test_bst_1 test_dlist_1 test_queue_1 test_stack_1 avl_Thread_Safe_Test ================================================ FILE: test/avl_Thread_Safe_Test.c ================================================ /* * Test cases for AVL-ThreadSafe tree * * Author: Emanuele Alfano * Copyright (C) 2015 by Arun Prakash Jana * * 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 dslib. If not, see . */ /* * This demo works in posix, it create "nSearch" thread and him call forEver * "search_BFS_avl_S", with ctrl+c you send a lockWrite, * with ctrl+z you send unlockWrite * * The function must send in order: * 1° Lock-write * 2° Unlock-write * * Is also possible send different configuratio: * 1° Lock-write * 2° Lock-write * 3° Lock-write * 4° Unlock-write * 5° Unlock-write * 6° Unlock-write * ... * * To end script type ctrl+\ (sigKill) * * * Is important to see that, when first writeLock arrive, search thread just at work * finish his work and finaly the write lock arrive */ #define nSearch 50 #include #include "avl.h" #include #include #include #include int current_log_level = DEBUG; avl_pp_S head; int n_nodeInsert; int searchRange; int writePending; void *searchTh(void *info) { int id = *(int *)info; int keySearch; int found; while (1) { keySearch = (int) random() % searchRange; found = search_BFS_avl_S(head, keySearch, TRUE); printf("TH-Search %d Search key %d and ret %d\n", id, keySearch, found); usleep(1000000*random()%100); //random wait between 1 and 100 ms } free(info); return NULL; } void lockWriteSem_sig(int sig) { writePending++; printf("\n\t****sigINT receive sig = %d; n°writePending = %d\n\n", sig, writePending); lockWriteSem(head.semId); printf("\n\t####sigInt lock Write TAKE\n"); } void unlockWriteSem_sig(int sig) { //note, if writePending = 0, this signal stay in wait until arrive one lockWriteSem_sig, //but the library wasn't design tu solve this!!! It work only if every Writer, on the Start lock the tree, and at the End unlock then. printf("\n\t#(sigTSTP) receive sig = %d\n\n", sig); unlockWriteSem(head.semId); writePending--; printf("\n\t#(sigTSTP) unlock Write; n°writePending = %d\n", writePending); } int main(void) { signal(SIGINT, lockWriteSem_sig); signal(SIGTSTP, unlockWriteSem_sig); head = init_avl_S(); n_nodeInsert = nSearch * 10; searchRange = n_nodeInsert * 2; for (int count = 0; count < n_nodeInsert; count++) { if (insert_avl_node_S(head, count, (int)random() % searchRange) == FALSE) { log(ERROR, "Insertion failed.\n"); destroy_avl(head.avlRoot); return 0; } } print_avl_S(head); //sleep(20); //to give time to see tree print pthread_t tid; printf("Start search Thread\n"); for (int count = 0; count < nSearch; count++) { int *i = malloc(sizeof(int)); *i = count; pthread_create(&tid, NULL, searchTh, i); } while (1) pause(); return 0; } ================================================ FILE: test/test_avl_1.c ================================================ /* * Test cases for AVL tree * * Author: Arun Prakash Jana * Copyright (C) 2015 by Arun Prakash Jana * * 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 dslib. If not, see . */ #include #include int current_log_level = INFO; int main(int argc, char **argv) { int count = 0; bool stop = FALSE; avl_pp head = init_avl(); int arr[] = {30, 110, 10, 90, 120, 150, 70, 140, 40, 130, 20, 50, 100, 80, 60}; /* int arr[] = {10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 110, 120, 130, 140, 150}; */ int len = sizeof(arr) / sizeof(arr[0]); for (; count < len; ++count) { if (insert_avl_node(head, arr[count], 20) == FALSE) { log(ERROR, "Insertion failed.\n"); destroy_avl(head); return 0; } } if (argc == 2) search_BFS_avl(head, atoi(argv[1]), stop); else search_BFS_avl(head, 10, stop); count = print_avl(*head, *head); log(INFO, "nodes printed: %d\n\n", count); if (delete_avl_node(head, 110) == TRUE) log(INFO, "AVL node deleted\n\n"); count = print_avl(*head, *head); log(INFO, "nodes printed: %d\n", count); count = destroy_avl(head); log(INFO, "nodes deleted: %d\n", count); return 0; } ================================================ FILE: test/test_bst_1.c ================================================ /* * Test cases for BST * * Author: Arun Prakash Jana * Copyright (C) 2015 by Arun Prakash Jana * * 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 dslib. If not, see . */ #include #include int current_log_level = INFO; /* Test BST */ int main(int argc, char **argv) { int count = 0; bool stop = TRUE; tree_pp head = NULL; int arr[] = {10, 20, 30, 40, 50}; log(DEBUG, "Calling generate_tree()\n"); head = generate_tree(arr, sizeof(arr) / sizeof(arr[0])); if (argc == 2) search_BFS(head, atoi(argv[1]), stop); else search_BFS(head, 10, stop); count = print_tree(*head); log(INFO, "nodes printed: %d\n", count); delete_tree_node(head, 30); log(INFO, "\n\n"); count = print_tree(*head); log(INFO, "nodes printed: %d\n", count); count = destroy_tree(head); log(INFO, "nodes deleted: %d\n", count); return 0; } ================================================ FILE: test/test_dlist_1.c ================================================ /* * Test cases for dlist * * Author: Arun Prakash Jana * Copyright (C) 2015 by Arun Prakash Jana * * 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 dslib. If not, see . */ #include #include int current_log_level = INFO; /* Test dlist */ int main(void) { int count = 5; dlist_p *head_pp = calloc(1, sizeof(dlist_p *)); while (count) { dlist_p node_p = calloc(1, sizeof(dlist_t)); log(DEBUG, "node address %p\n", node_p); if (add_head_dlist(head_pp, node_p) == -1) { log(ERROR, "add_head_dlist failed!\n"); return -1; } log(DEBUG, "Node added\n"); count--; } log(DEBUG, "Total nodes1: %d\n", count_nodes_dlist(head_pp)); if (delete_head_dlist(head_pp)) { log(DEBUG, "Total nodes after head delete: %d\n", count_nodes_dlist(head_pp)); } else { log(ERROR, "delete_head_dlist failed!\n"); return -1; } log(DEBUG, "Total nodes2: %d\n", count_nodes_dlist(head_pp)); if (delete_tail_dlist(head_pp)) { log(DEBUG, "Total nodes after tail delete: %d\n", count_nodes_dlist(head_pp)); } else { log(ERROR, "delete_tail_dlist failed!\n"); return -1; } log(DEBUG, "Nodes destroyed: %d\n", destroy_dlist(head_pp)); log(DEBUG, "Total nodes: %d\n", count_nodes_dlist(head_pp)); free(head_pp); return 0; } ================================================ FILE: test/test_queue_1.c ================================================ /* * Test cases for queue * * Author: Arun Prakash Jana * Copyright (C) 2015 by Arun Prakash Jana * * 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 dslib. If not, see . */ #include #include int current_log_level = DEBUG; /* Test queue */ int main(void) { int count = 5; int arr[5] = {0, 1, 2, 3, 4}; int *val; queue_p queue = get_queue(); while (count) { if (enqueue(queue, &arr[--count]) == FALSE) { log(ERROR, "enqueue failed!\n"); destroy_queue(queue); return -1; } log(DEBUG, "enqueued: arr[%d] = %d\n", count, arr[count]); } count = 5; while (count) { val = dequeue(queue); if (val) log(DEBUG, "dequeued: arr[%d] = %d\n", --count, (int)*val); else log(ERROR, "dequeue failed!\n"); } destroy_queue(queue); return 0; } ================================================ FILE: test/test_stack_1.c ================================================ /* * Test cases for stack * * Author: Arun Prakash Jana * Copyright (C) 2015 by Arun Prakash Jana * * 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 dslib. If not, see . */ #include #include int current_log_level = DEBUG; /* Test stack */ int main(void) { int count = 5; int arr[5] = {0, 1, 2, 3, 4}; int *val; stack_p stack = get_stack(); while (count) { if (push(stack, &arr[--count]) == FALSE) { log(ERROR, "push failed!\n"); destroy_stack(stack); return -1; } log(DEBUG, "pushed: arr[%d] = %d\n", count, arr[count]); } count = 5; while (count) { val = pop(stack); if (val) log(DEBUG, "popped: arr[%d] = %d\n", --count, (int)*val); else log(ERROR, "pop failed!\n"); } destroy_stack(stack); return 0; }