mirror of
https://github.com/Rockbox/rockbox.git
synced 2025-12-08 20:55:17 -05:00
git-svn-id: svn://svn.rockbox.org/rockbox/trunk@21095 a1c6a512-1295-4272-9138-f99709370657 |
||
|---|---|---|
| .. | ||
| bmalloc.c | ||
| bmalloc.h | ||
| bysize.c | ||
| bysize.h | ||
| CHANGES | ||
| dmalloc.c | ||
| dmalloc.h | ||
| dmytest.c | ||
| FILES | ||
| Makefile | ||
| Malloc.c | ||
| malloc.man | ||
| mytest.c | ||
| README | ||
| thoughts | ||
Package: dbestfit - a dynamic memory allocator Date: March 30, 2005 Version: 3.3 Author: Daniel Stenberg <daniel@haxx.se> I wrote the dmalloc part for small allocation sizes to improve the behavior of the built-in (first-fit) allocator found in pSOS (around 1996). I wrote the bmalloc part (best-fit with splay-tree sorting) just for the fun of it and to see how good malloc() clone I could make. The quality of my implementation is still left to be judged in real-world tests. TODO: * Remove the final not-so-very-nice loop in dmalloc.c that checks for a block with free fragments (when the list gets longer too much time might be spent in that loop). * Add semaphore protection in bmalloc. * Make a separate application that samples the memory usage of a program and is capable of replaying it (in order to test properly).