summaryrefslogtreecommitdiff
path: root/firmware/malloc/README
diff options
context:
space:
mode:
Diffstat (limited to 'firmware/malloc/README')
-rw-r--r--firmware/malloc/README21
1 files changed, 0 insertions, 21 deletions
diff --git a/firmware/malloc/README b/firmware/malloc/README
deleted file mode 100644
index 336bd57..0000000
--- a/firmware/malloc/README
+++ /dev/null
@@ -1,21 +0,0 @@
-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).