aboutsummaryrefslogtreecommitdiff
path: root/src/or
diff options
context:
space:
mode:
authorNick Mathewson <nickm@torproject.org>2013-11-15 15:29:24 -0500
committerNick Mathewson <nickm@torproject.org>2013-11-15 15:29:24 -0500
commit59f50c80d443a7e148f85cfed493e3e703cc4386 (patch)
treebdaef44fe052c88c81c3e5fb130837f6ebc65202 /src/or
parenta82b18f2168ce19e0637740fed5746d6daac4e3a (diff)
parent9e907076025ccd91abfad7fc70c09ba4c9228f82 (diff)
downloadtor-59f50c80d443a7e148f85cfed493e3e703cc4386.tar
tor-59f50c80d443a7e148f85cfed493e3e703cc4386.tar.gz
Merge remote-tracking branch 'origin/maint-0.2.3' into maint-0.2.4
Conflicts: src/or/or.h src/or/relay.c Conflicts were simple to resolve. More fixes were needed for compilation, including: reinstating the tv_to_msec function, and renaming *_conn_cells to *_chan_cells.
Diffstat (limited to 'src/or')
-rw-r--r--src/or/circuitlist.c56
-rw-r--r--src/or/or.h5
-rw-r--r--src/or/relay.c8
3 files changed, 57 insertions, 12 deletions
diff --git a/src/or/circuitlist.c b/src/or/circuitlist.c
index daeaa37b1..b0e24a5fe 100644
--- a/src/or/circuitlist.c
+++ b/src/or/circuitlist.c
@@ -1525,25 +1525,56 @@ n_cells_in_circ_queues(const circuit_t *c)
return n;
}
-/** helper to sort a list of circuit_q by total queue lengths, in descending
- * order. */
+/**
+ * Return the age of the oldest cell queued on <b>c</b>, in milliseconds.
+ * Return 0 if there are no cells queued on c. Requires that <b>now</b> be
+ * the current time in milliseconds since the epoch, truncated.
+ *
+ * This function will return incorrect results if the oldest cell queued on
+ * the circuit is older than 2**32 msec (about 49 days) old.
+ */
+static uint32_t
+circuit_max_queued_cell_age(const circuit_t *c, uint32_t now)
+{
+ uint32_t age = 0;
+ if (c->n_chan_cells.head)
+ age = now - c->n_chan_cells.head->inserted_time;
+
+ if (! CIRCUIT_IS_ORIGIN(c)) {
+ const or_circuit_t *orcirc = TO_OR_CIRCUIT((circuit_t*)c);
+ if (orcirc->p_chan_cells.head) {
+ uint32_t age2 = now - orcirc->p_chan_cells.head->inserted_time;
+ if (age2 > age)
+ return age2;
+ }
+ }
+ return age;
+}
+
+/** Temporary variable for circuits_compare_by_oldest_queued_cell_ This is a
+ * kludge to work around the fact that qsort doesn't provide a way for
+ * comparison functions to take an extra argument. */
+static uint32_t circcomp_now_tmp;
+
+/** Helper to sort a list of circuit_t by age of oldest cell, in descending
+ * order. Requires that circcomp_now_tmp is set correctly. */
static int
-circuits_compare_by_queue_len_(const void **a_, const void **b_)
+circuits_compare_by_oldest_queued_cell_(const void **a_, const void **b_)
{
const circuit_t *a = *a_;
const circuit_t *b = *b_;
- size_t a_n = n_cells_in_circ_queues(a);
- size_t b_n = n_cells_in_circ_queues(b);
+ uint32_t age_a = circuit_max_queued_cell_age(a, circcomp_now_tmp);
+ uint32_t age_b = circuit_max_queued_cell_age(b, circcomp_now_tmp);
- if (a_n < b_n)
+ if (age_a < age_b)
return 1;
- else if (a_n == b_n)
+ else if (age_a == age_b)
return 0;
else
return -1;
}
-#define FRACTION_OF_CIRCS_TO_RETAIN_ON_OOM 0.90
+#define FRACTION_OF_CELLS_TO_RETAIN_ON_OOM 0.90
/** We're out of memory for cells, having allocated <b>current_allocation</b>
* bytes' worth. Kill the 'worst' circuits until we're under
@@ -1556,13 +1587,14 @@ circuits_handle_oom(size_t current_allocation)
circuit_t *circ;
size_t n_cells_removed=0, n_cells_to_remove;
int n_circuits_killed=0;
+ struct timeval now;
log_notice(LD_GENERAL, "We're low on memory. Killing circuits with "
"over-long queues. (This behavior is controlled by "
"MaxMemInCellQueues.)");
{
size_t mem_target = (size_t)(get_options()->MaxMemInCellQueues *
- FRACTION_OF_CIRCS_TO_RETAIN_ON_OOM);
+ FRACTION_OF_CELLS_TO_RETAIN_ON_OOM);
size_t mem_to_recover;
if (current_allocation <= mem_target)
return;
@@ -1575,9 +1607,13 @@ circuits_handle_oom(size_t current_allocation)
for (circ = global_circuitlist; circ; circ = circ->next)
smartlist_add(circlist, circ);
+ /* Set circcomp_now_tmp so that the sort can work. */
+ tor_gettimeofday_cached(&now);
+ circcomp_now_tmp = (uint32_t)tv_to_msec(&now);
+
/* This is O(n log n); there are faster algorithms we could use instead.
* Let's hope this doesn't happen enough to be in the critical path. */
- smartlist_sort(circlist, circuits_compare_by_queue_len_);
+ smartlist_sort(circlist, circuits_compare_by_oldest_queued_cell_);
/* Okay, now the worst circuits are at the front of the list. Let's mark
* them, and reclaim their storage aggressively. */
diff --git a/src/or/or.h b/src/or/or.h
index eff5a6d2b..5318b0fe5 100644
--- a/src/or/or.h
+++ b/src/or/or.h
@@ -1077,8 +1077,13 @@ typedef struct var_cell_t {
typedef struct packed_cell_t {
struct packed_cell_t *next; /**< Next cell queued on this circuit. */
char body[CELL_MAX_NETWORK_SIZE]; /**< Cell as packed for network. */
+ uint32_t inserted_time; /**< Time (in milliseconds since epoch, with high
+ * bits truncated) when this cell was inserted. */
} packed_cell_t;
+/* XXXX This next structure may be obsoleted by inserted_time in
+ * packed_cell_t */
+
/** Number of cells added to a circuit queue including their insertion
* time on 10 millisecond detail; used for buffer statistics. */
typedef struct insertion_time_elem_t {
diff --git a/src/or/relay.c b/src/or/relay.c
index 29dc36194..63119cbf0 100644
--- a/src/or/relay.c
+++ b/src/or/relay.c
@@ -2149,15 +2149,19 @@ void
cell_queue_append_packed_copy(cell_queue_t *queue, const cell_t *cell,
int wide_circ_ids)
{
+ struct timeval now;
packed_cell_t *copy = packed_cell_copy(cell, wide_circ_ids);
+ tor_gettimeofday_cached(&now);
+ copy->inserted_time = (uint32_t)tv_to_msec(&now);
+
/* Remember the time when this cell was put in the queue. */
+ /*XXXX This may be obsoleted by inserted_time */
if (get_options()->CellStatistics) {
- struct timeval now;
uint32_t added;
insertion_time_queue_t *it_queue = queue->insertion_times;
if (!it_pool)
it_pool = mp_pool_new(sizeof(insertion_time_elem_t), 1024);
- tor_gettimeofday_cached(&now);
+
#define SECONDS_IN_A_DAY 86400L
added = (uint32_t)(((now.tv_sec % SECONDS_IN_A_DAY) * 100L)
+ ((uint32_t)now.tv_usec / (uint32_t)10000L));