| Commit message (Collapse) | Author | Age |
|
|
|
|
|
|
|
|
|
| |
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
|
|
|
|
|
|
|
|
|
|
| |
remove sendme cells
replace malloc with tor_malloc
patch (but not track down) bug in onion pending list
streamline connection_ap handshake
svn:r293
|
|
|
|
| |
svn:r288
|
|
|
|
| |
svn:r285
|
|
|
|
| |
svn:r283
|
|
|
|
|
|
|
|
|
|
| |
inserted into the directory.
Roger: If you can answer the question with your name on it, you may
prevent a segfault before it happens. :)
svn:r277
|
|
|
|
|
|
| |
between everything; remove some unused interfaces
svn:r276
|
|
|
|
| |
svn:r274
|
|
|
|
|
|
| |
completely refactored. Need documentation and integration. Explanitory mail forthcoming.
svn:r271
|
|
|
|
|
|
| |
the IETF draft: a 1024-bit DH key probably reduces our cipher strength to ~80 bits.)
svn:r269
|
|
|
|
|
|
| |
checking sigs yet
svn:r268
|
|
|
|
| |
svn:r266
|
|
|
|
| |
svn:r265
|
|
|
|
|
|
|
| |
still need to change circuit-level sendmes
svn:r264
|
|
|
|
| |
svn:r263
|
|
|
|
|
|
|
|
| |
the OP only crypts the appropriate number of times depending on which
layer (hop on the path) it's for/from.
svn:r262
|
|
|
|
| |
svn:r260
|
|
|
|
| |
svn:r258
|
|
|
|
| |
svn:r249
|
|
|
|
| |
svn:r240
|
|
|
|
| |
svn:r237
|
|
|
|
| |
svn:r236
|
|
|
|
| |
svn:r235
|
|
|
|
|
|
|
|
| |
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
|
|
|
|
|
|
| |
setup/teardown
svn:r232
|
|
|
|
| |
svn:r231
|
|
|
|
| |
svn:r230
|
|
|
|
|
|
|
| |
route selection still doesn't pay attention to exit policies though
svn:r227
|
|
|
|
| |
svn:r225
|
|
|
|
|
|
| |
separate file.
svn:r224
|
|
|
|
| |
svn:r218
|
|
|
|
|
|
|
|
| |
if the directory is remade while an OR is handshaking, the directory
needs to become dirty again when the handshake succeeds
svn:r215
|
|
|
|
| |
svn:r208
|
|
|
|
| |
svn:r198
|
|
|
|
|
|
|
|
| |
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
|
|
|
|
| |
svn:r187
|
|
|
|
| |
svn:r174
|
|
|
|
| |
svn:r170
|
|
|
|
| |
svn:r166
|
|
|
|
| |
svn:r162
|
|
|
|
| |
svn:r161
|
|
|
|
|
|
|
| |
serious performance increase over non-caching
svn:r158
|
|
|
|
|
|
|
|
|
| |
(they wouldn't have before)
alternate code which bypasses the dns farm, so we can compare speed
svn:r154
|
|
|
|
|
|
|
| |
performance is better, but not by much. not sure why yet.
svn:r153
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
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
|
|
|
|
|
|
|
|
| |
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
|
|
|
|
|
|
|
|
| |
we're closer to an OS X port
CVS: ----------------------------------------------------------------------
svn:r146
|
|
|
|
|
|
|
|
|
|
|
| |
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
|
|
|
|
| |
svn:r140
|
|
|
|
|
|
|
| |
first cut, probably needs more playing with
svn:r137
|