diff options
| -rw-r--r-- | .hgignore | 4 | ||||
| -rw-r--r-- | COPYING.AGPL | 661 | ||||
| -rw-r--r-- | Makefile | 35 | ||||
| -rw-r--r-- | bitmapped_patricia_tree.c | 479 | ||||
| -rw-r--r-- | bitmapped_patricia_tree.h | 65 | ||||
| -rw-r--r-- | bpt_test.c | 64 |
6 files changed, 1308 insertions, 0 deletions
diff --git a/.hgignore b/.hgignore new file mode 100644 index 0000000..d9606cc --- /dev/null +++ b/.hgignore @@ -0,0 +1,4 @@ +.*~$ +.*\.(o|so|dylib)$ +bpt_test + diff --git a/COPYING.AGPL b/COPYING.AGPL new file mode 100644 index 0000000..dba13ed --- /dev/null +++ b/COPYING.AGPL @@ -0,0 +1,661 @@ + GNU AFFERO GENERAL PUBLIC LICENSE + Version 3, 19 November 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/> + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU Affero General Public License is a free, copyleft license for +software and other kinds of works, specifically designed to ensure +cooperation with the community in the case of network server software. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +our General Public Licenses are 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. + + 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. + + Developers that use our General Public Licenses protect your rights +with two steps: (1) assert copyright on the software, and (2) offer +you this License which gives you legal permission to copy, distribute +and/or modify the software. + + A secondary benefit of defending all users' freedom is that +improvements made in alternate versions of the program, if they +receive widespread use, become available for other developers to +incorporate. Many developers of free software are heartened and +encouraged by the resulting cooperation. However, in the case of +software used on network servers, this result may fail to come about. +The GNU General Public License permits making a modified version and +letting the public access it on a server without ever releasing its +source code to the public. + + The GNU Affero General Public License is designed specifically to +ensure that, in such cases, the modified source code becomes available +to the community. It requires the operator of a network server to +provide the source code of the modified version running there to the +users of that server. Therefore, public use of a modified version, on +a publicly accessible server, gives the public access to the source +code of the modified version. + + An older license, called the Affero General Public License and +published by Affero, was designed to accomplish similar goals. This is +a different license, not a version of the Affero GPL, but Affero has +released a new version of the Affero GPL which permits relicensing under +this license. + + 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 Affero 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. Remote Network Interaction; Use with the GNU General Public License. + + Notwithstanding any other provision of this License, if you modify the +Program, your modified version must prominently offer all users +interacting with it remotely through a computer network (if your version +supports such interaction) an opportunity to receive the Corresponding +Source of your version by providing access to the Corresponding Source +from a network server at no charge, through some standard or customary +means of facilitating copying of software. This Corresponding Source +shall include the Corresponding Source for any work covered by version 3 +of the GNU General Public License that is incorporated pursuant to the +following paragraph. + + 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 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 work with which it is combined will remain governed by version +3 of the GNU General Public License. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU Affero 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 Affero 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 Affero 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 Affero 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 Affero 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 Affero General Public License for more details. + + You should have received a copy of the GNU Affero General Public License + along with this program. If not, see <http://www.gnu.org/licenses/>. + +Also add information on how to contact you by electronic and paper mail. + + If your software can interact with users remotely through a computer +network, you should also make sure that it provides a way for users to +get its source. For example, if your program is a web application, its +interface could display a "Source" link that leads users to an archive +of the code. There are many ways you could offer source, and different +solutions will be better for different programs; see section 13 for the +specific requirements. + + 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 AGPL, see +<http://www.gnu.org/licenses/>. diff --git a/Makefile b/Makefile new file mode 100644 index 0000000..89a106c --- /dev/null +++ b/Makefile @@ -0,0 +1,35 @@ +RM_F = rm -f +CFLAGS = -std=c99 -Wall -pedantic -ggdb -g -DUSE_TERMIOS +LIBTOOL = libtool +LDFLAGS = -lc +CC = clang + +LIB_PREFIX = lib +LIB_SUFFIX = .dylib + +mulklib_C_SOURCES = bitmapped_patricia_tree.c +mulklib_OBJECTS = $(patsubst %.c,%.o,$(mulklib_C_SOURCES)) +mulklib_TARGET = $(LIB_PREFIX)mulklib$(LIB_SUFFIX) + +bpttest_C_SOURCES = bpt_test.c +bpttest_OBJECTS = $(patsubst %.c,%.o,$(bpttest_C_SOURCES)) +bpttest_TARGET = bpt_test + +.PHONY: all clean + +all: $(mulklib_TARGET) $(bpttest_TARGET) + +clean: + $(RM_F) $(mulklib_OBJECTS) + $(RM_F) $(mulklib_TARGET) + $(RM_F) $(bpttest_OBJECTS) + $(RM_F) $(bpttest_TARGET) + + +$(mulklib_TARGET): $(mulklib_OBJECTS) + $(LIBTOOL) -dynamic $(LDFLAGS) -o $@ $(mulklib_OBJECTS) + +bitmapped_patricia_tree.o: bitmapped_patricia_tree.c bitmapped_patricia_tree.h + +$(bpttest_TARGET): $(bpttest_OBJECTS) $(mulklib_TARGET) + $(CC) -o $@ $+ diff --git a/bitmapped_patricia_tree.c b/bitmapped_patricia_tree.c new file mode 100644 index 0000000..7575c5e --- /dev/null +++ b/bitmapped_patricia_tree.c @@ -0,0 +1,479 @@ +// -*- mode: c; coding: utf-8 -*- */ +// +// Copyright 2010, 2011, Matthias Andreas Benkard. +// +//----------------------------------------------------------------------------- +// This program is free software: you can redistribute it and/or modify +// it under the terms of the GNU Affero 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 Affero General Public License for more details. +// +// You should have received a copy of the GNU Affero General Public License +// along with this program. If not, see <http://www.gnu.org/licenses/>. +//----------------------------------------------------------------------------- +// + +// An implementation of a bitmapped Patricia tree. + +//// Purpose //// +// +// The idea is to use a locally mutable, bitmapped Patricia tree as a +// variable binding store (i.e. environment) in compiled code. In this +// way, there is no need for excessive copying when an independent +// environment must be set up (such as when initiating the processing of +// a new node in the search space). Instead, significant amounts of +// structure can be shared between child and parent environments. + +//// Motivation //// +// +// 1. Patricia trees are very amenable to structure sharing. +// +// 2. Furthermore, big-endian Patricia trees are especially efficient +// when indices are allocated sequentially, as is the case for +// variables in code emitted by our compiler. +// +// 3. Finally, bitmapping improves the performance of copying because +// copying an array is much cheaper than copying an equivalent branch +// in a tree. As we need to shallow-copy the tree at potentially +// each choice point, copying needs to be fast. + + +#include <stdlib.h> +#include <string.h> +#include <assert.h> + +#include "bitmapped_patricia_tree.h" + +#define CHUNK_LENGTH 5 +#define KEY_LENGTH 32 +#define OFFSET_MASK 0x1ffff //((1 << chunk_length) - 1) +#define MAX_CHUNKS 7 //key_length / chunk_length + ((key_length % chunk_length == 0) ? 0 : 1) +#define LAST_CHUNK_LENGTH 2 //key_length - ((max_chunks - 1) * chunk_length) + + +typedef struct bpt_nonempty *bpt_nonempty_t; +typedef struct bpt_node *bpt_node_t; +typedef struct bpt_leaf *bpt_leaf_t; + +struct bpt { + enum bpt_tag tag; + int refcount; + bool mutable; + bpt_key_t prefix; +}; + +struct bpt_leaf { + struct bpt bpt; // poor man's inheritance + void *value; +#ifdef BPT_ENABLE_RELEASE_HOOKS + void (*release_hook)(bpt_key_t, void *); // not actually used anywhere in client code +#endif +}; + +struct bpt_node { + struct bpt bpt; // poor man's inheritance + unsigned int branching_chunk; + bpt_key_bitmask_t bitmask; + bpt_t *children; +}; + + +void init_bpt_leaf(bpt_t a_leaf, bpt_key_t key, void *value) { + bpt_leaf_t leaf = (bpt_leaf_t)a_leaf; + leaf->bpt.tag = BPT_LEAF; + leaf->bpt.mutable = true; + leaf->bpt.prefix = key; + leaf->value = value; +#ifdef BPT_ENABLE_RELEASE_HOOKS + leaf->release_hook = NULL; +#endif + leaf->bpt.refcount = 1; +} + +void init_bpt_node(bpt_node_t node, bpt_key_t prefix, unsigned int branching_chunk) { + node->bpt.tag = BPT_INNER_NODE; + node->bpt.mutable = true; + node->bpt.prefix = prefix; + node->branching_chunk = branching_chunk; + node->bitmask = 0; + node->children = NULL; + node->bpt.refcount = 1; +} + + +bpt_t bpt_make_leaf(bpt_key_t key, void *value) { + bpt_leaf_t leaf = malloc(sizeof *leaf); + init_bpt_leaf((bpt_t)leaf, key, value); + return (bpt_t)leaf; +} + +bpt_node_t bpt_make_node(bpt_key_t prefix, unsigned int branching_chunk) { + bpt_node_t node = malloc(sizeof *node); + init_bpt_node(node, prefix, branching_chunk); + return node; +} + + +static inline unsigned int bpt_number_of_leading_zeros(bpt_key_t x); +static inline unsigned int bpt_number_of_trailing_zeros(bpt_key_t x); +static inline unsigned int bpt_popcount(bpt_key_bitmask_t key); +static unsigned int bpt_compute_child_index(bpt_key_bitmask_t bitmask, unsigned int child_number); +static inline uint_fast8_t bpt_offset_of_key(bpt_key_t key, unsigned int branching_chunk); +static bpt_key_t bpt_prefix_of_key(bpt_key_t key, unsigned int branching_chunk); +static inline unsigned int bpt_branching_chunk(bpt_t bpt); +static unsigned int bpt_find_diverging_chunk(bpt_key_t key1, bpt_key_t key2); +static void bpt_for_children(bpt_t bpt, void (*thunk)(bpt_t)); + + +static void bpt_for_children(bpt_t bpt, void (*thunk)(bpt_t)) { + if (bpt && bpt->tag == BPT_INNER_NODE) { + bpt_node_t b = (bpt_node_t)bpt; + bpt_t *iter = b->children; + bpt_t *children_end = b->children + bpt_popcount(b->bitmask); + while (iter < children_end) { + thunk(*iter); + iter++; + } + } +} + +void *bpt_get(bpt_t bpt, bpt_key_t key) { + void **pointer = bpt_get_pointer(bpt, key); + if (pointer) { + return *pointer; + } else { + return NULL; + } +} + +bpt_leaf_t bpt_get_leaf(bpt_t bpt, bpt_key_t key) +{ + if (!bpt) { + return NULL; + } else if (bpt->tag == BPT_LEAF) { + bpt_leaf_t b = (bpt_leaf_t)bpt; + if (bpt->prefix == key) { + return b; + } else { + return NULL; + } + } else { + bpt_node_t b = (bpt_node_t)bpt; + int child_number = bpt_offset_of_key(key, b->branching_chunk); + if ((1 << child_number) & b->bitmask) { + int child_index = bpt_compute_child_index(b->bitmask, child_number); + return bpt_get_leaf(b->children[child_index], key); + } else { + return NULL; + } + } +} + +void **bpt_get_pointer(bpt_t bpt, bpt_key_t key) +{ + bpt_leaf_t leaf = bpt_get_leaf(bpt, key); + if (!leaf) { + return NULL; + } else { + return &leaf->value; + } +} + +bool bpt_has_key(bpt_t bpt, bpt_key_t key) { + return (bpt_get_leaf(bpt, key) != NULL); +} + +bpt_t bpt_assoc(bpt_t bpt, bpt_key_t key, void *value) { + if (!bpt) { + return (bpt_t)bpt_make_leaf(key, value); + } else { + bpt_key_t prefix = bpt->prefix; + if (bpt_prefix_of_key(key, bpt_branching_chunk(bpt)) != prefix) { + unsigned int diverging_chunk = bpt_find_diverging_chunk(key, prefix); + bpt_key_t my_number_in_parent = bpt_offset_of_key(prefix, diverging_chunk); + bpt_key_t their_number_in_parent = bpt_offset_of_key(key, diverging_chunk); + bpt_node_t new_node = bpt_make_node(bpt_prefix_of_key(prefix, diverging_chunk), diverging_chunk); + new_node->bitmask = (1 << my_number_in_parent) | (1 << their_number_in_parent); + new_node->children = malloc(sizeof (*new_node->children) * 2); + if (my_number_in_parent < their_number_in_parent) { + new_node->children[0] = bpt; + new_node->children[1] = bpt_make_leaf(key, value); + } else { + new_node->children[0] = bpt_make_leaf(key, value); + new_node->children[1] = bpt; + } + bpt_retain(new_node->children[0]); + bpt_retain(new_node->children[1]); + return (bpt_t)new_node; + } else { + if (bpt->tag == BPT_LEAF) { + bpt_leaf_t b = (bpt_leaf_t)bpt; + if (bpt->mutable) { + b->value = value; + bpt_retain(bpt); + return bpt; + } else { + return (bpt_t)bpt_make_leaf(key, value); + } + } else { + bpt_node_t b = (bpt_node_t)bpt; + uint_fast8_t child_number = bpt_offset_of_key(key, b->branching_chunk); + unsigned int child_index = bpt_compute_child_index(b->bitmask, child_number); + if ((1 << child_number) & b->bitmask) { + // We already have a child to pass the value to. Do that. + bpt_t child = b->children[child_index]; + bpt_t new_child = bpt_assoc(child, key, value); + if (new_child == child) { + bpt_release(child); + bpt_retain(bpt); + return bpt; + } else { + if (bpt->mutable) { + bpt_release(child); + b->children[child_index] = new_child; + bpt_retain(bpt); + return bpt; + } else { + bpt_node_t new_node = malloc(sizeof *new_node); + *new_node = *b; + new_node->bpt.refcount = 1; + new_node->bpt.mutable = true; + unsigned int number_of_children = bpt_popcount(b->bitmask); + size_t size_of_child_array = sizeof (*new_node->children) * number_of_children; + new_node->children = malloc(size_of_child_array); + memcpy(new_node->children, b->children, size_of_child_array); + new_node->children[child_index] = new_child; + // Retain the children copied into the new node. + bpt_for_children(bpt, bpt_retain); + return (bpt_t)new_node; + } + } + } else { + // Create a new child. + unsigned int number_of_children = bpt_popcount(b->bitmask); + size_t new_size_of_child_array = sizeof (*b->children) * (number_of_children + 1); + if (bpt->mutable) { + b->children = realloc(b->children, new_size_of_child_array); + memmove(b->children + child_index + 1, b->children + child_index, sizeof (*b->children) * (number_of_children - child_index)); + b->children[child_index] = bpt_make_leaf(key, value); + b->bitmask |= 1 << child_number; + bpt_retain(bpt); + return bpt; + } else { + bpt_t *new_children = malloc(new_size_of_child_array); + memcpy(new_children, b->children, sizeof (*b->children) * child_index); + memcpy(new_children + child_index + 1, + b->children + child_index, + sizeof (*b->children) * (number_of_children - child_index)); + new_children[child_index] = bpt_make_leaf(key, value); + bpt_node_t new_node = bpt_make_node(b->bpt.prefix, b->branching_chunk); + new_node->children = new_children; + new_node->bitmask = b->bitmask | (1 << child_number); + // Retain the children copied into the new node. + bpt_for_children(bpt, bpt_retain); + return (bpt_t)new_node; + } + } + } + } + } +} + + +bpt_t bpt_dissoc(bpt_t bpt, bpt_key_t key) { + if (!bpt || (bpt_prefix_of_key(key, bpt_branching_chunk(bpt)) != bpt->prefix)) { + bpt_retain(bpt); + return bpt; + } else if (bpt->tag == BPT_LEAF) { + // Key matches. + return NULL; + } else { + // Prefix matches. + bpt_node_t b = (bpt_node_t)bpt; + uint_fast8_t child_number = bpt_offset_of_key(key, b->branching_chunk); + if ((1 << child_number) & b->bitmask) { + unsigned int child_index = bpt_compute_child_index(b->bitmask, child_number); + bpt_t child = b->children[child_index]; + bpt_t new_child = bpt_dissoc(child, key); + if (new_child == child) { + bpt_release(child); + bpt_retain(bpt); + return bpt; + } else { + unsigned int number_of_children = bpt_popcount(b->bitmask); + if (!new_child && number_of_children == 2) { + // When there is only a single child left, we replace ourselves + // with that child. + bpt_t remaining_child = (b->children[0] ? b->children[0] + : b->children[1]); + bpt_retain(remaining_child); + return remaining_child; + } else if (bpt->mutable) { + bpt_release(child); + if (!new_child) { + // We don't reallocate the array because it wouldn't really + // gain us anything (except maybe non-confusion of a + // conservative GC). + memmove(b->children + child_index, b->children + child_index + 1, sizeof(*b->children) * (number_of_children - child_index - 1)); + b->bitmask &= ~(1 << child_number); + bpt_retain(bpt); + return bpt; + } else { + b->children[child_index] = new_child; + bpt_retain(bpt); + return bpt; + } + } else { + // If all else fails, allocate a new node. + bpt_t *new_children; + bpt_key_bitmask_t bitmask; + if (!new_child) { + new_children = malloc((sizeof *new_children) * (number_of_children - 1)); + memcpy(new_children, b->children, sizeof (*b->children) * child_index); + memcpy(new_children + child_index, + b->children + child_index + 1, + sizeof (*b->children) * (number_of_children - child_index - 1)); + bitmask = b->bitmask & ~(1 << child_number); + } else { + new_children = malloc((sizeof *new_children) * number_of_children); + memcpy(new_children, b->children, sizeof (*b->children) * number_of_children); + new_children[child_index] = new_child; + bitmask = b->bitmask; + } + bpt_node_t new_node = bpt_make_node(b->bpt.prefix, b->branching_chunk); + new_node->children = new_children; + new_node->bitmask = bitmask; + // Retain the children copied into the new node. + bpt_for_children((bpt_t)new_node, bpt_retain); + bpt_release(new_child); + return (bpt_t)new_node; + } + } + } else { + bpt_retain(bpt); + return bpt; + } + } +} + + +void bpt_seal(bpt_t bpt) { + if (bpt) { + if (bpt->mutable) { + bpt->mutable = false; + if (bpt->tag == BPT_INNER_NODE) { + bpt_for_children(bpt, bpt_seal); + } + } + } +} + + +/////////////// Helper functions /////////////// +static unsigned int bpt_compute_child_index(bpt_key_bitmask_t bitmask, unsigned int child_number) { + // Compute the sparse array index given a flat array index. + return bpt_popcount(bitmask & ((1 << child_number) - 1)); +} + +static inline uint_fast8_t bpt_offset_of_key(bpt_key_t key, unsigned int chunk_number) { + // Little-enidan: + //return (key >> (chunk_number * CHUNK_LENGTH)) & OFFSET_MASK; + // Big-endian: + int shift = 0; + if (chunk_number <= MAX_CHUNKS - 2) { + shift += LAST_CHUNK_LENGTH; + } + if (chunk_number <= MAX_CHUNKS - 3) { + shift += ((MAX_CHUNKS - 2 - chunk_number) * CHUNK_LENGTH); + } + return (key >> shift) & (chunk_number == MAX_CHUNKS - 1 ? ((1 << LAST_CHUNK_LENGTH) - 1) : OFFSET_MASK); +} + +static bpt_key_t bpt_prefix_of_key(bpt_key_t key, unsigned int chunk_number) { + if (chunk_number == MAX_CHUNKS) { + return key; + } else { + // Little-endian: + //return key & ((1 << (chunk_number * CHUNK_LENGTH)) - 1) + // Big-endian: + return key & (((1 << (chunk_number * CHUNK_LENGTH)) - 1) << (KEY_LENGTH - (chunk_number * CHUNK_LENGTH))); + } +} + +static inline unsigned int bpt_branching_chunk(bpt_t bpt) { + assert(bpt); + if (bpt->tag == BPT_LEAF) { + return MAX_CHUNKS; + } else { + return ((bpt_node_t)bpt)->branching_chunk; + } +} + +static inline unsigned int bpt_popcount(bpt_key_bitmask_t x) { + return __builtin_popcount(x); +} + +static inline unsigned int bpt_number_of_leading_zeros(bpt_key_t x) { + return __builtin_clz(x); +} + +static inline unsigned int bpt_number_of_trailing_zeros(bpt_key_t x) { + return __builtin_ctz(x); +} + +static unsigned int bpt_find_diverging_chunk(bpt_key_t a, bpt_key_t b) { + // Little-endian: + //return bpt_number_of_trailing_zeros(a ^ b) / CHUNK_LENGTH; + // Big-endian: + return bpt_number_of_leading_zeros(a ^ b) / CHUNK_LENGTH; +} + +void bpt_retain(bpt_t bpt) { + if (bpt) { + bpt->refcount++; + } +} + +void bpt_release(bpt_t bpt) { + if (bpt) { + if (--(bpt->refcount) == 0) { + bpt_dealloc(bpt); + } + } +} + +void bpt_dealloc(bpt_t bpt) { + if (bpt) { + if (bpt->tag == BPT_LEAF) { + bpt_leaf_t b = (bpt_leaf_t)bpt; +#ifdef BPT_ENABLE_RELEASE_HOOKS + if (b->release_hook) { + b->release_hook(b->bpt.prefix, b->value); + } +#endif + free(b); + } else { + bpt_node_t b = (bpt_node_t)bpt; + bpt_for_children(bpt, bpt_release); + free(b->children); + free(b); + } + } +} + +#ifdef BPT_ENABLE_RELEASE_HOOKS +void bpt_leaf_set_dealloc_hook(bpt_leaf_t bpt, void (*hook)(bpt_key_t, void*)) { + if (bpt) { + bpt->release_hook = hook; + } +} + +void bpt_set_dealloc_hook(bpt_t bpt, bpt_key_t key, void (*hook)(bpt_key_t, void*)) { + bpt_leaf_set_dealloc_hook(bpt_get_leaf(bpt, key), hook); +} +#endif diff --git a/bitmapped_patricia_tree.h b/bitmapped_patricia_tree.h new file mode 100644 index 0000000..4f47aae --- /dev/null +++ b/bitmapped_patricia_tree.h @@ -0,0 +1,65 @@ +// -*- mode: c; coding: utf-8 -*- */ +// +// Copyright 2010, 2011, Matthias Andreas Benkard. +// +//----------------------------------------------------------------------------- +// This program is free software: you can redistribute it and/or modify +// it under the terms of the GNU Affero 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 Affero General Public License for more details. +// +// You should have received a copy of the GNU Affero General Public License +// along with this program. If not, see <http://www.gnu.org/licenses/>. +//----------------------------------------------------------------------------- +// + +// An implementation of a bitmapped Patricia tree. + +#ifndef __BITMAPPED_PATRICIA_TREE_H +#define __BITMAPPED_PATRICIA_TREE_H + +#include <stdbool.h> +#include <stdint.h> + +#ifdef __cplusplus +extern "C" { +#endif + +#define BPT_ENABLE_RELEASE_HOOKS 1 + +typedef int32_t bpt_key_t; +typedef int32_t bpt_key_bitmask_t; + +enum bpt_tag { + BPT_LEAF, + BPT_INNER_NODE +}; + +struct bpt; +typedef struct bpt *bpt_t; + +void *bpt_get(bpt_t bpt, bpt_key_t key); +bool bpt_has_key(bpt_t bpt, bpt_key_t key); +void **bpt_get_pointer(bpt_t bpt, bpt_key_t key); +bpt_t bpt_assoc(bpt_t bpt, bpt_key_t key, void *item); +bpt_t bpt_dissoc(bpt_t bpt, bpt_key_t key); +void init_bpt_leaf(bpt_t leaf, bpt_key_t key, void *value); +bpt_t bpt_make_leaf(bpt_key_t key, void *value); +void bpt_retain(bpt_t bpt); +void bpt_release(bpt_t bpt); +void bpt_dealloc(bpt_t bpt); +void bpt_seal(bpt_t bpt); + +#ifdef BPT_ENABLE_RELEASE_HOOKS +void bpt_set_dealloc_hook(bpt_t bpt, bpt_key_t key, void (*hook)(bpt_key_t key, void* value)); +#endif + +#ifdef __cplusplus +} +#endif +#endif diff --git a/bpt_test.c b/bpt_test.c new file mode 100644 index 0000000..9f57152 --- /dev/null +++ b/bpt_test.c @@ -0,0 +1,64 @@ +#include "stdio.h" +#include "stdlib.h" +#include "bitmapped_patricia_tree.h" + +void print_deallocation(bpt_key_t key, void *value) { + printf("Deallocated: %s\n", value); +} + +void print_tree(bpt_t b) { + int i; + for (i = 0; i < 10; i++) { + if (bpt_has_key(b, i)) { + printf(" %d -> %s\n", i, bpt_get(b, i)); + } + } +} + +bpt_t bpt_assoc_and_release(bpt_t bpt, bpt_key_t key, void *value) { + bpt_t new_bpt = bpt_assoc(bpt, key, value); + bpt_release(bpt); + return new_bpt; +} + +bpt_t bpt_dissoc_and_release(bpt_t bpt, bpt_key_t key) { + bpt_t new_bpt = bpt_dissoc(bpt, key); + bpt_release(bpt); + return new_bpt; +} + +int main() { + bpt_t b1, b2; + + b1 = bpt_assoc (NULL, 0, "zero"); + b1 = bpt_assoc_and_release(b1, 1, "one"); + b1 = bpt_assoc_and_release(b1, 2, "two"); + b1 = bpt_assoc_and_release(b1, 3, "three"); + b1 = bpt_assoc_and_release(b1, 4, "four"); + bpt_seal(b1); + + b2 = bpt_assoc (b1, 0, "null"); + b2 = bpt_assoc_and_release(b2, 3, "a triple"); + + b1 = bpt_assoc_and_release(b1, 5, "five"); + + printf("Map 1:\n"); + print_tree(b1); + printf("\nMap 2:\n"); + print_tree(b2); + + bpt_set_dealloc_hook(b1, 0, print_deallocation); + bpt_set_dealloc_hook(b1, 1, print_deallocation); + bpt_set_dealloc_hook(b1, 2, print_deallocation); + bpt_set_dealloc_hook(b1, 3, print_deallocation); + bpt_set_dealloc_hook(b1, 4, print_deallocation); + bpt_set_dealloc_hook(b1, 5, print_deallocation); + + bpt_set_dealloc_hook(b2, 0, print_deallocation); + bpt_set_dealloc_hook(b2, 3, print_deallocation); + + bpt_release(b1); + bpt_release(b2); + + return EXIT_SUCCESS; +} |