diff options
author | Nick Mathewson <nickm@torproject.org> | 2010-11-30 19:23:40 -0500 |
---|---|---|
committer | Nick Mathewson <nickm@torproject.org> | 2010-11-30 19:23:40 -0500 |
commit | 3ed7505dc5684a235f87042d074b39ad35b4e415 (patch) | |
tree | 8eb410908d08550d9ac3bd1245fd800160cca39a /src/or/relay.c | |
parent | 8fa4450fde435bcab5e050b3a9b2b34c072f40b9 (diff) | |
parent | ad87d6172bc8b06a851da84f5a96ae87446ef90b (diff) | |
download | tor-3ed7505dc5684a235f87042d074b39ad35b4e415.tar.gz tor-3ed7505dc5684a235f87042d074b39ad35b4e415.zip |
Merge remote branch 'origin/maint-0.2.2'
Conflicts:
src/or/relay.c
Diffstat (limited to 'src/or/relay.c')
-rw-r--r-- | src/or/relay.c | 50 |
1 files changed, 43 insertions, 7 deletions
diff --git a/src/or/relay.c b/src/or/relay.c index 1d7a5171b6..6529efb243 100644 --- a/src/or/relay.c +++ b/src/or/relay.c @@ -1472,10 +1472,11 @@ circuit_resume_edge_reading_helper(edge_connection_t *first_conn, crypt_path_t *layer_hint) { edge_connection_t *conn; - int n_streams, n_streams_left; + int n_packaging_streams, n_streams_left; int packaged_this_round; int cells_on_queue; int cells_per_conn; + edge_connection_t *chosen_stream = NULL; /* How many cells do we have space for? It will be the minimum of * the number needed to exhaust the package window, and the minimum @@ -1490,26 +1491,61 @@ circuit_resume_edge_reading_helper(edge_connection_t *first_conn, if (CELL_QUEUE_HIGHWATER_SIZE - cells_on_queue < max_to_package) max_to_package = CELL_QUEUE_HIGHWATER_SIZE - cells_on_queue; + /* Once we used to start listening on the streams in the order they + * appeared in the linked list. That leads to starvation on the + * streams that appeared later on the list, since the first streams + * would always get to read first. Instead, we just pick a random + * stream on the list, and enable reading for streams starting at that + * point (and wrapping around as if the list were circular). It would + * probably be better to actually remember which streams we've + * serviced in the past, but this is simple and effective. */ + + /* Select a stream uniformly at random from the linked list. We + * don't need cryptographic randomness here. */ + { + int num_streams = 0; + for (conn = first_conn; conn; conn = conn->next_stream) { + num_streams++; + if ((tor_weak_random() % num_streams)==0) + chosen_stream = conn; + /* Invariant: chosen_stream has been chosen uniformly at random from + * among the first num_streams streams on first_conn. */ + } + } + /* Count how many non-marked streams there are that have anything on * their inbuf, and enable reading on all of the connections. */ - n_streams = 0; - for (conn=first_conn; conn; conn=conn->next_stream) { + n_packaging_streams = 0; + /* Activate reading starting from the chosen stream */ + for (conn=chosen_stream; conn; conn = conn->next_stream) { + /* Start reading for the streams starting from here */ + if (conn->_base.marked_for_close || conn->package_window <= 0) + continue; + if (!layer_hint || conn->cpath_layer == layer_hint) { + connection_start_reading(TO_CONN(conn)); + + if (connection_get_inbuf_len(TO_CONN(conn)) > 0) + ++n_packaging_streams; + } + } + /* Go back and do the ones we skipped, circular-style */ + for (conn = first_conn; conn != chosen_stream; conn = conn->next_stream) { if (conn->_base.marked_for_close || conn->package_window <= 0) continue; if (!layer_hint || conn->cpath_layer == layer_hint) { connection_start_reading(TO_CONN(conn)); if (connection_get_inbuf_len(TO_CONN(conn)) > 0) - ++n_streams; + ++n_packaging_streams; } } - if (n_streams == 0) /* avoid divide-by-zero */ + if (n_packaging_streams == 0) /* avoid divide-by-zero */ return 0; again: - cells_per_conn = CEIL_DIV(max_to_package, n_streams); + cells_per_conn = CEIL_DIV(max_to_package, n_packaging_streams); packaged_this_round = 0; n_streams_left = 0; @@ -1557,7 +1593,7 @@ circuit_resume_edge_reading_helper(edge_connection_t *first_conn, if (packaged_this_round && packaged_this_round < max_to_package && n_streams_left) { max_to_package -= packaged_this_round; - n_streams = n_streams_left; + n_packaging_streams = n_streams_left; goto again; } |