|author||Rich Felker <firstname.lastname@example.org>||2011-02-12 00:22:29 -0500|
|committer||Rich Felker <email@example.com>||2011-02-12 00:22:29 -0500|
initial check-in, version 0.5.0v0.5.0
Diffstat (limited to 'src/malloc/DESIGN')
1 files changed, 22 insertions, 0 deletions
diff --git a/src/malloc/DESIGN b/src/malloc/DESIGN
new file mode 100644
@@ -0,0 +1,22 @@
+In principle, this memory allocator is roughly equivalent to Doug
+Lea's dlmalloc with fine-grained locking.
+Uses a freelist binned by chunk size, with a bitmap to optimize
+searching for the smallest non-empty bin which can satisfy an
+allocation. If no free chunks are available, it creates a new chunk of
+the requested size and attempts to merge it with any existing free
+chunk immediately below the newly created chunk.
+Whether the chunk was obtained from a bin or newly created, it's
+likely to be larger than the requested allocation. malloc always
+finishes its work by passing the new chunk to realloc, which will
+split it into two chunks and free the tail portion.