aboutsummaryrefslogtreecommitdiff
path: root/src/or/circuit.c
Commit message (Collapse)AuthorAge
* Remove false warnings from printf checksNick Mathewson2003-06-21
| | | | svn:r340
* Change many files to new log_fn formatNick Mathewson2003-06-17
| | | | svn:r333
* relay queues are obsolete (woo!)Roger Dingledine2003-06-13
| | | | | | | | | | | they used to be used for * queueing relay cells at the edge of the network, when windows are empty * queueing relay cells that arrive after an onion but before the onion has been processed. both of these uses are gone. so out they go. svn:r315
* implement truncate and truncated (untested)Roger Dingledine2003-06-12
| | | | | | | clean up circuit_deliver_relay_cell convention svn:r312
* bugfix: it was expiring circuits that still had active connectionsRoger Dingledine2003-06-01
| | | | svn:r303
* OPport is gone. So is conn type OP.Roger Dingledine2003-05-28
| | | | svn:r298
* bugfixRoger Dingledine2003-05-28
| | | | svn:r297
* fix design bug: circ->n_conn is shared among circs, so it can'tRoger Dingledine2003-05-27
| | | | | | | point to the streams for this circ. svn:r296
* remove dead codeRoger Dingledine2003-05-20
| | | | | | | | | | circuits no longer queue more cells when the windows are empty -- they simply don't package it from the buffer if they're not going to want it. we can restore this code later if we need to resume queueing. svn:r294
* add circuit-level sendme relay cellsRoger Dingledine2003-05-20
| | | | | | | | | | remove sendme cells replace malloc with tor_malloc patch (but not track down) bug in onion pending list streamline connection_ap handshake svn:r293
* put some symbolic constants to the onion skin lengthsRoger Dingledine2003-05-06
| | | | svn:r265
* incremental path building in; uses ephemeral DH; onions are goneRoger Dingledine2003-05-05
| | | | | | | still need to change circuit-level sendmes svn:r264
* streams are now 8 bytes, and are recognized by intermediate hopsRoger Dingledine2003-05-02
| | | | | | | | the OP only crypts the appropriate number of times depending on which layer (hop on the path) it's for/from. svn:r262
* cpath is now a doubly linked list, not an arrayRoger Dingledine2003-05-01
| | | | svn:r260
* terminology shift: data->relay, topic->relay, topic->streamRoger Dingledine2003-05-01
| | | | svn:r258
* bugfix: a circ can't be youngest if it's still connecting to the first hopRoger Dingledine2003-04-20
| | | | svn:r255
* bugfix: refactor to always use circuit_removeRoger Dingledine2003-04-20
| | | | | | | this way we can always check if a new circ needs to be launched svn:r254
* bugfix: only close old circuits if they have no connections!Roger Dingledine2003-04-18
| | | | svn:r251
* Choose correct abstraction for topic_foo. Abstract random-integer codeNick Mathewson2003-04-17
| | | | svn:r249
* further cleanup, test.c still has some bugsRoger Dingledine2003-04-16
| | | | svn:r241
* Remove the last vestige of code that claims to know the inner structure of ↵Nick Mathewson2003-04-16
| | | | | | an onion on the network svn:r239
* Factor out timeval-related functions.Nick Mathewson2003-04-16
| | | | svn:r237
* Remove the notion of "onion ciphers"; make packing and unpacking separate fnsNick Mathewson2003-04-16
| | | | svn:r236
* divorce circuit building from user connectionsRoger Dingledine2003-04-16
| | | | | | | | now we rebuild the circuit periodically (but only if it's been used), and we can further abstract it to do incremental circuit building, etc. svn:r233
* refactored some duplicate code into connection_edge.cRoger Dingledine2003-04-11
| | | | svn:r230
* Add magic to end of C files to make emacs happy; split test invocation into ↵Nick Mathewson2003-04-07
| | | | | | separate file. svn:r224
* Make ACI anti-collision logic work; make sure that cells are filled with 0s.Nick Mathewson2003-03-11
| | | | svn:r176
* be less noisy at -l info, now that flow control bug is solvedRoger Dingledine2003-03-10
| | | | svn:r172
* minor code cleanupRoger Dingledine2003-03-05
| | | | svn:r166
* 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
* give us more aci-spaceRoger Dingledine2002-12-30
| | | | svn:r149
* bugfix: couldn't send two creates, two datas, and the destroy all at onceRoger Dingledine2002-12-23
| | | | | | | | (amazing the odd behavior you get to test when you have a flaky modem connection) svn:r148
* onions go on and off the network correctly nowRoger Dingledine2002-12-03
| | | | | | | | we're closer to an OS X port CVS: ---------------------------------------------------------------------- svn:r146
* two more rare race conditionsRoger Dingledine2002-11-28
| | | | svn:r143
* create cells are now queued and processed only when idleRoger Dingledine2002-11-27
| | | | | | | | | | | 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
* Add convenience functions to wrap create and init for symmetric ciphers; ↵Nick Mathewson2002-10-02
| | | | | | clean up error handling in onion.c svn:r131
* 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
* kill -USR1 the or and it will dump conn/circuit stats to stdoutRoger Dingledine2002-09-21
| | | | svn:r106
* port is now kept in host order except in sin_portRoger Dingledine2002-08-24
| | | | svn:r82
* cleanup: don't use size_t when you mean intRoger Dingledine2002-08-24
| | | | | | | size_t is what you get back from sizeof(). no more, no less. svn:r80
* 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
* Implemented router twinsRoger Dingledine2002-07-18
| | | | | | | | | | | 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
* 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
* 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
* general cleanupRoger Dingledine2002-07-05
| | | | svn:r29
generated by cgit v1.2.3 (git 2.45.0) at 2024-12-16 23:30:46 +0000