mirror of
https://github.com/adtools/clib2.git
synced 2025-12-08 14:59:05 +00:00
0c5b88d2d3
If the first slab in the list of slabs which share the same chunk size has no more room, it means that all other slabs following it have no room either. This speeds up the test to find a slab with free space, which can now abort and directly proceed to allocate memory for a new slab. If an empty slab's decay count hits zero, it is moved to the front of the empty slab list to be reclaimed more quickly. Allocations made from the slab now carry a pointer back to the slab which they are a part of. This speeds up deallocation but has the downside of making the smallest usable slab chunk size 64 bytes, which is double what used to be the minimum before.
This is a collection of programs I'm using to test the library. These are functional tests: the library is supposed to do something, and produce a particular result. For example, "printf_test" exercises a bunch of output formatting rules.