summaryrefslogtreecommitdiff
path: root/ChangeLog
diff options
context:
space:
mode:
authorNick Mathewson <nickm@torproject.org>2007-12-26 00:12:08 +0000
committerNick Mathewson <nickm@torproject.org>2007-12-26 00:12:08 +0000
commita7ef07b4bd3a4a3ba66336601e5a27649cb923d9 (patch)
tree7a38a26ea71a0ead464c54d0b8d58ec7330877f8 /ChangeLog
parent1401bc54f4b8aeeea21950ad20e8d79ffc87ba0b (diff)
downloadtor-a7ef07b4bd3a4a3ba66336601e5a27649cb923d9.tar.gz
tor-a7ef07b4bd3a4a3ba66336601e5a27649cb923d9.zip
r15693@tombo: nickm | 2007-12-25 19:11:29 -0500
Here, have some terribly clever new buffer code. It uses a mbuf-like strategy rather than a ring buffer strategy, so it should require far far less extra memory to hold any given amount of data. Also, it avoids access patterns like x=malloc(1024);x=realloc(x,1048576);x=realloc(x,1024);append_to_freelist(x) that might have been contributing to memory fragmentation. I've tested it out a little on peacetime, and it seems to work so far. If you want to benchmark it for speed, make sure to remove the #define PARANOIA; #define NOINLINE macros at the head of the module. svn:r12983
Diffstat (limited to 'ChangeLog')
-rw-r--r--ChangeLog8
1 files changed, 8 insertions, 0 deletions
diff --git a/ChangeLog b/ChangeLog
index 3d3aa9b253..fce57cc131 100644
--- a/ChangeLog
+++ b/ChangeLog
@@ -1,3 +1,11 @@
+Changes in version 0.2.0.16-alpha - 2008-01-??
+ o Major performance improvements:
+ - Switch our old ring buffer implementation for one more like that
+ used by free Unix kernels. The wasted space in a buffer with
+ 1mb of data will now be more like 8k than 1mb. The new
+ implementation also avoids realloc();realloc(); patterns that
+ can contribute to memory fragmentation.
+
Changes in version 0.2.0.15-alpha - 2007-12-25
o Major bugfixes:
- Fix several remotely triggerable asserts based on DirPort requests