aboutsummaryrefslogtreecommitdiff
path: root/src/or/connection.c
Commit message (Collapse)AuthorAge
* Bugfixes and enhancements in sendmes and dns farmRoger Dingledine2003-02-18
| | | | svn:r161
* fix endian issues for topics -- they might work on bsd nowRoger Dingledine2003-02-06
| | | | | | | | | (they wouldn't have before) alternate code which bypasses the dns farm, so we can compare speed svn:r154
* make reusing circuits work (and be the default)Roger Dingledine2003-02-06
| | | | | | | performance is better, but not by much. not sure why yet. svn:r153
* major overhaul: dns slave subsystem, topicsRoger Dingledine2003-01-26
| | | | | | | | | | | | | | | | | | | | | | | | | | 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
* expire unfinished handshakes tooRoger Dingledine2002-10-13
| | | | | | | don't list non-open ORs in the directory svn:r134
* cleanup and a variety of bugfixesRoger Dingledine2002-10-02
| | | | svn:r132
* cell now has a network appearance and an internal (struct) appearanceRoger Dingledine2002-10-02
| | | | svn:r130
* all listeners listen on 0.0.0.0 except AP which listens on 127.0.0.1Roger Dingledine2002-10-02
| | | | svn:r126
* introduced a periodic keepalive padding cellRoger Dingledine2002-10-01
| | | | | | | | | now tor can be run safely inside nat'ed areas that kill idle connections; and the proxy can handle when you suspend your laptop and then emerge hours later from a new domain. svn:r125
* more robust http(ish) handlingRoger Dingledine2002-09-28
| | | | svn:r123
* cleanupRoger Dingledine2002-09-28
| | | | | | | | | | 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
* directory servers in and functionalRoger Dingledine2002-09-26
| | | | | | | | proxies now periodically pull down an hourly-updated directory, and replace their router list with it if it parses correctly. svn:r112
* laying the groundwork for dynamic router listsRoger Dingledine2002-09-24
| | | | | | | | | | | | | | | | 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
* onion proxy now speaks socks4aRoger Dingledine2002-09-22
| | | | | | | | | | | 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
* kill -USR1 the or and it will dump conn/circuit stats to stdoutRoger Dingledine2002-09-21
| | | | svn:r106
* added 'connected' cell typeRoger Dingledine2002-09-17
| | | | | | | see http://archives.seul.org/or/dev/Sep-2002/msg00018.html svn:r103
* minor race conditionRoger Dingledine2002-09-09
| | | | | | | (it seemed to work anyway, but...) svn:r100
* onion proxies now work (i think)Roger Dingledine2002-09-04
| | | | svn:r96
* resolve warningsRoger Dingledine2002-09-03
| | | | svn:r89
* enforce maxconn; bugfix to not tear down the parent when we hit maxconnRoger Dingledine2002-09-03
| | | | svn:r86
* more debugging info, to track down bruce's IP problemsRoger Dingledine2002-08-27
| | | | svn:r85
* we now encrypt the entire cell on the link, not just the headerRoger Dingledine2002-08-24
| | | | | | | | previously padding cells, etc were distinguishable because their body was all zero's svn:r84
* port is now kept in host order except in sin_portRoger Dingledine2002-08-24
| | | | svn:r82
* cleaned up new_route()Roger Dingledine2002-08-23
| | | | | | | now it deals gracefully with too few connected routers (i think) svn:r77
* Changed crypto calls to go through common/crypto.[hc] instead of calling ↵Matej Pjafjar2002-08-22
| | | | | | OpenSSL directly. svn:r76
* Code cleaned up to be less noisyRoger Dingledine2002-07-22
| | | | svn:r71
* Folded cell.? into src/orRoger Dingledine2002-07-19
| | | | svn:r64
* Implemented congestion controlRoger Dingledine2002-07-18
| | | | | | | | | | | | | | | 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
* new link padding schemeRoger Dingledine2002-07-16
| | | | | | | | | we're now much more robust when bandwidth varies: instead of forcing a fixed bandwidth on the link, we instead use what the link will give us, up to our bandwidth. svn:r53
* new config files, some bugfixesRoger Dingledine2002-07-16
| | | | svn:r51
* Implemented link padding and receiver token bucketsRoger Dingledine2002-07-16
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 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
* put in the support for 'router twins'Roger Dingledine2002-07-08
| | | | | | | | | | | | | basically, a twin is a router which is different except it shares the same keypair. so in cases where we want to find a "next router" and all we really care is that it can decrypt the next onion layer, then a twin is just as good. we still need to decide how to mark twins in the routerinfo_t and in the routers config file. svn:r30
* patch to fix running the program only as an opRoger Dingledine2002-07-03
| | | | svn:r27
* Integrated onion proxy into or/Roger Dingledine2002-07-02
| | | | | | | | | | | | | | | | | | | | | | | | | 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
* made 'app' connection be 'exit' connectionRoger Dingledine2002-06-30
| | | | | | | general cleanup, particularly in buffers.c svn:r17
* Initial revisionRoger Dingledine2002-06-26
svn:r2