blob: 336bd571ae448bac836c7a1b4914d693e725ac49 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
|
Package: dbestfit - a dynamic best-fit memory allocator
Date: 1996 - 2002
Version: 3.3
Author: Daniel Stenberg <daniel@haxx.se>
License: MIT originally, files in the Rockbox project are GPL licensed.
I wrote the dmalloc part for small allocation sizes to improve the behavior
of the built-in (first-fit) allocator found in pSOS, during late 1996 and
spring 1997.
I wrote the bmalloc part (best-fit with optional splay-tree sorting) just for
the fun of it and to see how good malloc() implementation 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).
* Make a separate application that samples the memory usage of a program
and is capable of replaying it (in order to test properly).
|
