Nick Mathewson a7ef07b4bd 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
2007-12-26 00:12:08 +00:00
2007-12-25 08:39:53 +00:00
2007-12-25 19:02:12 +00:00
2007-11-11 00:33:53 +00:00

Tor protects your privacy on the internet by hiding the connection
between your Internet address and the services you use.  We believe
Tor is reasonably secure, but please ensure you read the
instructions and configure it properly.

To build Tor from source:
        ./configure; make; make install

Home page:
        https://www.torproject.org/

Download new versions:
        https://www.torproject.org/download.html

Documentation, including links to installation and setup instructions:
        https://www.torproject.org/documentation.html

Making applications work with Tor:
        http://wiki.noreply.org/noreply/TheOnionRouter/TorifyHOWTO

Frequently Asked Questions:
        http://wiki.noreply.org/noreply/TheOnionRouter/TorFAQ
S
Description
No description provided
Readme 96 MiB
Languages
C 94.4%
Python 1.5%
C++ 1.1%
Shell 1.1%
M4 0.9%
Other 0.8%