diff options
author | Peter D'Hoye <peter.dhoye@gmail.com> | 2009-05-22 21:58:48 +0000 |
---|---|---|
committer | Peter D'Hoye <peter.dhoye@gmail.com> | 2009-05-22 21:58:48 +0000 |
commit | 513389b4c1bc8afe4b2dc9947c534bfeb105e3da (patch) | |
tree | 10e673b35651ac567fed2eda0c679c7ade64cbc6 /apps/plugins/pdbox/dbestfit-3.3/README | |
parent | 95fa7f6a2ef466444fbe3fe87efc6d5db6b77b36 (diff) | |
download | rockbox-513389b4c1bc8afe4b2dc9947c534bfeb105e3da.tar.gz rockbox-513389b4c1bc8afe4b2dc9947c534bfeb105e3da.zip |
Add FS #10214. Initial commit of the original PDa code for the GSoC Pure Data plugin project of Wincent Balin. Stripped some non-sourcefiles and added a rockbox readme that needs a bit more info from Wincent. Is added to CATEGORIES and viewers, but not yet to SUBDIRS (ie doesn't build yet)
git-svn-id: svn://svn.rockbox.org/rockbox/trunk@21044 a1c6a512-1295-4272-9138-f99709370657
Diffstat (limited to 'apps/plugins/pdbox/dbestfit-3.3/README')
-rw-r--r-- | apps/plugins/pdbox/dbestfit-3.3/README | 44 |
1 files changed, 44 insertions, 0 deletions
diff --git a/apps/plugins/pdbox/dbestfit-3.3/README b/apps/plugins/pdbox/dbestfit-3.3/README new file mode 100644 index 0000000000..919875df96 --- /dev/null +++ b/apps/plugins/pdbox/dbestfit-3.3/README | |||
@@ -0,0 +1,44 @@ | |||
1 | Package: dbestfit - a dynamic memory allocator | ||
2 | Date: March 30, 2005 | ||
3 | Version: 3.3 | ||
4 | Author: Daniel Stenberg <daniel@haxx.se> | ||
5 | |||
6 | I wrote the dmalloc part for small allocation sizes to improve the behavior | ||
7 | of the built-in (first-fit) allocator found in pSOS (around 1996). | ||
8 | |||
9 | I wrote the bmalloc part (best-fit with splay-tree sorting) just for the fun | ||
10 | of it and to see how good malloc() clone I could make. The quality of my | ||
11 | implementation is still left to be judged in real-world tests. | ||
12 | |||
13 | TODO: | ||
14 | * Remove the final not-so-very-nice loop in dmalloc.c that checks for a block | ||
15 | with free fragments (when the list gets longer too much time might be spent | ||
16 | in that loop). | ||
17 | |||
18 | * Add semaphore protection in bmalloc. | ||
19 | |||
20 | * Make a separate application that samples the memory usage of a program | ||
21 | and is capable of replaying it (in order to test properly). | ||
22 | |||
23 | Package: dbestfit - a dynamic memory allocator | ||
24 | Date: March 30, 2005 | ||
25 | Version: 3.3 | ||
26 | Author: Daniel Stenberg <daniel@haxx.se> | ||
27 | |||
28 | I wrote the dmalloc part for small allocation sizes to improve the behavior | ||
29 | of the built-in (first-fit) allocator found in pSOS (around 1996). | ||
30 | |||
31 | I wrote the bmalloc part (best-fit with splay-tree sorting) just for the fun | ||
32 | of it and to see how good malloc() clone I could make. The quality of my | ||
33 | implementation is still left to be judged in real-world tests. | ||
34 | |||
35 | TODO: | ||
36 | * Remove the final not-so-very-nice loop in dmalloc.c that checks for a block | ||
37 | with free fragments (when the list gets longer too much time might be spent | ||
38 | in that loop). | ||
39 | |||
40 | * Add semaphore protection in bmalloc. | ||
41 | |||
42 | * Make a separate application that samples the memory usage of a program | ||
43 | and is capable of replaying it (in order to test properly). | ||
44 | |||