summaryrefslogtreecommitdiff
path: root/ChangeLog
diff options
context:
space:
mode:
authorNick Mathewson <nickm@torproject.org>2007-04-11 00:30:34 +0000
committerNick Mathewson <nickm@torproject.org>2007-04-11 00:30:34 +0000
commit51e4b8d7068a3489fb5cb45a8ebcc20036fd0d35 (patch)
treecad4e30bb647186680938182bcd0592917acf4ea /ChangeLog
parent28de06b8e654800bb1221467d6c8cbbf8d19987d (diff)
downloadtor-51e4b8d7068a3489fb5cb45a8ebcc20036fd0d35.tar.gz
tor-51e4b8d7068a3489fb5cb45a8ebcc20036fd0d35.zip
r12338@catbus: nickm | 2007-04-10 20:29:05 -0400
Document memory pool implementation, and tweak it even mor. See? Programming is fun. svn:r9940
Diffstat (limited to 'ChangeLog')
-rw-r--r--ChangeLog2
1 files changed, 2 insertions, 0 deletions
diff --git a/ChangeLog b/ChangeLog
index 3127ecdeba..7b90d0b146 100644
--- a/ChangeLog
+++ b/ChangeLog
@@ -6,6 +6,8 @@ Changes in version 0.2.0.1-alpha - 2007-??-??
queue for each circuit. This lets us use less slack memory, and
will eventually let us be smarter about prioritizing different kinds
of traffic.
+ - Allocate cells in memory pools better speed and memory efficiency,
+ especially on platforms where malloc() is inefficient.
- Stop reading on edge connections when their corresponding circuit
buffers are full; start again as the circuits empty out.