| Commit message (Expand) | Author | Age |
|---|
| * | put most of the remaining exit policy stuff in•••route selection still doesn't pay attention to exit policies though
svn:r227
| Roger Dingledine | 2003-04-08 |
| * | Add magic to end of C files to make emacs happy; split test invocation into s...•••svn:r224
| Nick Mathewson | 2003-04-07 |
| * | Finish zlib and half-open; switch to 3des (ede/ofb)•••svn:r198
| Nick Mathewson | 2003-03-19 |
| * | greatly simplify this notion of 'roles':•••if your ORPort is non-zero then you must connect to all nodes
if your DirPort is non-zero then you must act like a directory server
svn:r192
| Roger Dingledine | 2003-03-18 |
| * | Remove extraneous (and non-ansi) semis•••svn:r186
| Nick Mathewson | 2003-03-17 |
| * | rudimentary dns caching (of both resolves and resolve failures)•••serious performance increase over non-caching
svn:r158
| Roger Dingledine | 2003-02-14 |
| * | major overhaul: dns slave subsystem, topics•••on startup, it forks off a master dns handler, which forks off dns
slaves (like the apache model). slaves as spawned as load increases,
and then reused. excess slaves are not ever killed, currently.
implemented topics. each topic has a receive window in each direction
at each edge of the circuit, and sends sendme's at the data level, as
per before. each circuit also has receive windows in each direction at
each hop; an edge sends a circuit-level sendme as soon as enough data
cells have arrived (regardless of whether the data cells were flushed
to the exit conns). removed the 'connected' cell type, since it's now
a topic command within data cells.
at the edge of the circuit, there can be multiple connections associated
with a single circuit. you find them via the linked list conn->next_topic.
currently each new ap connection starts its own circuit, so we ought
to see comparable performance to what we had before. but that's only
because i haven't written the code to reattach to old circuits. please
try to break it as-is, and then i'll make it reuse the same circuit and
we'll try to break that.
svn:r152
| Roger Dingledine | 2003-01-26 |
| * | use a rbtree for replay detection, rather than linear search•••when we had lots of new onions coming in, we were using 40% of
our time searching through the tracked_onions linked list.
svn:r150
| Roger Dingledine | 2002-12-31 |
| * | onions go on and off the network correctly now•••we're closer to an OS X port
CVS: ----------------------------------------------------------------------
svn:r146
| Roger Dingledine | 2002-12-03 |
| * | onions expire after a day, not an hour•••this was a major faq, because it would fail with an error only on
the *server* side when the client-side time was wrong. the client would
simply not work.
svn:r145
| Roger Dingledine | 2002-12-03 |
| * | two more rare race conditions•••svn:r143
| Roger Dingledine | 2002-11-28 |
| * | create cells are now queued and processed only when idle•••we also queue data cells destined for a circuit that is
pending, and process them once the circuit opens
destroys reach into the queue and remove the pending onion,
along with its collected data cells
svn:r142
| Roger Dingledine | 2002-11-27 |
| * | remove popt dependency, consolidate config stuff•••reformat parts of onion.c
svn:r136
| Roger Dingledine | 2002-11-23 |
| * | cleanup and a variety of bugfixes•••svn:r132
| Roger Dingledine | 2002-10-02 |
| * | Add convenience functions to wrap create and init for symmetric ciphers; clea...•••svn:r131
| Nick Mathewson | 2002-10-02 |
| * | cleanup•••prkey is only fetched when it's needed
tor nodes who aren't dirservers now fetch directories and autoconnect
to new nodes listed in the directory
default role is a non-dirserver node
svn:r120
| Roger Dingledine | 2002-09-28 |
| * | laying the groundwork for dynamic router lists•••revamped the router reading section
reference counting for crypto pk env's (so we can dup them)
we now read and write pem pk keys from string rather than from FILE*,
in anticipation of fetching directories over a socket
(so now on startup we slurp in the whole file, then parse it as a string)
fixed a bug in the proxy side, where you could get some circuits
wedged if they showed up while the connection was being made
svn:r110
| Roger Dingledine | 2002-09-24 |
| * | synchronize to the version i've been giving people to test•••svn:r104
| Roger Dingledine | 2002-09-19 |
| * | onion proxies now work (i think)•••svn:r96
| Roger Dingledine | 2002-09-04 |
| * | clarifying the empty semicolon•••svn:r90
| Roger Dingledine | 2002-09-03 |
| * | Port to MacOS X•••svn:r88
| Nick Mathewson | 2002-09-03 |
| * | port is now kept in host order except in sin_port•••svn:r82
| Roger Dingledine | 2002-08-24 |
| * | cleanup: don't use size_t when you mean int•••size_t is what you get back from sizeof(). no more, no less.
svn:r80
| Roger Dingledine | 2002-08-24 |
| * | changed path selection so it's actually random again•••svn:r78
| Roger Dingledine | 2002-08-23 |
| * | cleaned up new_route()•••now it deals gracefully with too few connected routers (i think)
svn:r77
| Roger Dingledine | 2002-08-23 |
| * | Changed crypto calls to go through common/crypto.[hc] instead of calling Open...•••svn:r76
| Matej Pjafjar | 2002-08-22 |
| * | only choose routers for the onion that are currently connected to us•••svn:r72
| Roger Dingledine | 2002-07-22 |
| * | bugfix: create_onion now works with routelen>2•••svn:r66
| Roger Dingledine | 2002-07-20 |
| * | Implemented router twins•••I modified new_route so we don't pick twins back-to-back in the path.
I also had to patch my previous uses of connection_twin_get_by_addr_port()
because they assumed that "addr" and "port" would be the same for a twin
as for the original router.
svn:r56
| Roger Dingledine | 2002-07-18 |
| * | Implemented link padding and receiver token buckets•••Each socket reads at most 'bandwidth' bytes per second sustained, but
can handle bursts of up to 10*bandwidth bytes.
Cells are now sent out at evenly-spaced intervals, with padding sent
out otherwise. Set Linkpadding=0 in the rc file to send cells as soon
as they're available (and to never send padding cells).
Added license/copyrights statements at the top of most files.
router->min and router->max have been merged into a single 'bandwidth'
value. We should make the routerinfo_t reflect this (want to do that,
Mat?)
As the bandwidth increases, and we want to stop sleeping more and more
frequently to send a single cell, cpu usage goes up. At 128kB/s we're
pretty much calling poll with a timeout of 1ms or even 0ms. The current
code takes a timeout of 0-9ms and makes it 10ms. prepare_for_poll()
handles everything that should have happened in the past, so as long as
our buffers don't get too full in that 10ms, we're ok.
Speaking of too full, if you run three servers at 100kB/s with -l debug,
it spends too much time printing debugging messages to be able to keep
up with the cells. The outbuf ultimately fills up and it kills that
connection. If you run with -l err, it works fine up through 500kB/s and
probably beyond. Down the road we'll want to teach it to recognize when
an outbuf is getting full, and back off.
svn:r50
| Roger Dingledine | 2002-07-16 |
| * | Integrated onion proxy into or/•••The 'or' process can now be told (by the global_role variable) what
roles this server should play -- connect to all ORs, listen for ORs,
listen for OPs, listen for APs, or any combination.
* everything in /src/op/ is now obsolete.
* connection_ap.c now handles all interactions with application proxies
* "port" is now or_port, op_port, ap_port. But routers are still always
referenced (say, in conn_get_by_addr_port()) by addr / or_port. We
should make routers.c actually read these new ports (currently I've
kludged it so op_port = or_port+10, ap_port=or_port+20)
* circuits currently know if they're at the beginning of the path because
circ->cpath is set. They use this instead for crypts (both ways),
if it's set.
* I still obey the "send a 0 back to the AP when you're ready" protocol,
but I think we should phase it out. I can simply not read from the AP
socket until I'm ready.
I need to do a lot of cleanup work here, but the code appears to work, so
now's a good time for a checkin.
svn:r22
| Roger Dingledine | 2002-07-02 |
| * | Initial revision•••svn:r2
| Roger Dingledine | 2002-06-26 |