| Commit message (Expand) | Author | Age |
|---|
| * | refactored some duplicate code into connection_edge.c•••svn:r230
| Roger Dingledine | 2003-04-11 |
| * | 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 |
| * | begin cells are now address:port, not address,port•••(breaks backward compatibility)
svn:r222
| Roger Dingledine | 2003-04-05 |
| * | get rid of those nasty tabs•••svn:r216
| Roger Dingledine | 2003-03-24 |
| * | Be loud when decompressing•••svn:r213
| Nick Mathewson | 2003-03-19 |
| * | Add other side of half-open-connection logic (still disabled•••svn:r206
| Nick Mathewson | 2003-03-19 |
| * | Be clear about whether we are using half-open connections•••svn:r204
| Nick Mathewson | 2003-03-19 |
| * | Finish zlib and half-open; switch to 3des (ede/ofb)•••svn:r198
| Nick Mathewson | 2003-03-19 |
| * | Add code for end-to-end zlib compression. Still needs flow-control•••svn:r187
| Nick Mathewson | 2003-03-17 |
| * | Bugfixes and enhancements in sendmes and dns farm•••svn:r161
| Roger Dingledine | 2003-02-18 |
| * | rudimentary dns caching (of both resolves and resolve failures)•••serious performance increase over non-caching
svn:r158
| Roger Dingledine | 2003-02-14 |
| * | minor fix•••svn:r157
| Roger Dingledine | 2003-02-14 |
| * | fix endian issues for topics -- they might work on bsd now•••(they wouldn't have before)
alternate code which bypasses the dns farm, so we can compare speed
svn:r154
| Roger Dingledine | 2003-02-06 |
| * | make reusing circuits work (and be the default)•••performance is better, but not by much. not sure why yet.
svn:r153
| Roger Dingledine | 2003-02-06 |
| * | 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 |
| * | fixed rare race condition•••svn:r138
| Roger Dingledine | 2002-11-24 |
| * | cleanup and a variety of bugfixes•••svn:r132
| Roger Dingledine | 2002-10-02 |
| * | handle banners from the server side•••(text that it spits out immediately upon connect)
svn:r124
| Roger Dingledine | 2002-10-01 |
| * | directory servers in and functional•••proxies now periodically pull down an hourly-updated directory,
and replace their router list with it if it parses correctly.
svn:r112
| Roger Dingledine | 2002-09-26 |
| * | onion proxy now speaks socks4a•••httpap is obsolete; we support privoxy directly now!
smtpap is obsolete; need to find a good socks4a-enabled smtp proxy/client
I dub thee 0.0.1.
svn:r107
| Roger Dingledine | 2002-09-22 |
| * | added 'connected' cell type•••see http://archives.seul.org/or/dev/Sep-2002/msg00018.html
svn:r103
| Roger Dingledine | 2002-09-17 |
| * | port is now kept in host order except in sin_port•••svn:r82
| Roger Dingledine | 2002-08-24 |
| * | Implemented congestion control•••Servers are allowed to send 100 cells initially, and can't send more until
they receive a 'sendme' cell from that direction, indicating that they
can send 10 more cells. As it currently stands, the exit node quickly
runs out of window, and sends bursts of 10 whenever a sendme cell gets
to him. This is much much much faster (and more flexible) than the old
"give each circuit 1 kB/s and hope nothing overflows" approach.
Also divided out the connection_watch_events into stop_reading,
start_writing, etc. That way we can control them separately.
svn:r54
| 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 |
| * | fixed the deadlock bug•••this was another bug i introduced with the 5 july patch.
i should look at that patch more closely. :)
svn:r39
| Roger Dingledine | 2002-07-10 |
| * | a patch for mat's patch•••svn:r37
| Roger Dingledine | 2002-07-10 |
| * | Bugfix : connection_exit_process_data_cell() quit after receiving the SS, wit...•••svn:r35
| Matej Pjafjar | 2002-07-10 |
| * | general cleanup•••svn:r29
| Roger Dingledine | 2002-07-05 |
| * | 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 |
| * | made 'app' connection be 'exit' connection•••general cleanup, particularly in buffers.c
svn:r17
| Roger Dingledine | 2002-06-30 |