Tor 0.4.9.0-alpha-dev
relay.c
Go to the documentation of this file.
1/* Copyright (c) 2001 Matej Pfajfar.
2 * Copyright (c) 2001-2004, Roger Dingledine.
3 * Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
4 * Copyright (c) 2007-2021, The Tor Project, Inc. */
5/* See LICENSE for licensing information */
6
7/**
8 * \file relay.c
9 * \brief Handle relay cell encryption/decryption, plus packaging and
10 * receiving from circuits, plus queuing on circuits.
11 *
12 * This is a core modules that makes Tor work. It's responsible for
13 * dealing with RELAY cells (the ones that travel more than one hop along a
14 * circuit), by:
15 * <ul>
16 * <li>constructing relays cells,
17 * <li>encrypting relay cells,
18 * <li>decrypting relay cells,
19 * <li>demultiplexing relay cells as they arrive on a connection,
20 * <li>queueing relay cells for retransmission,
21 * <li>or handling relay cells that are for us to receive (as an exit or a
22 * client).
23 * </ul>
24 *
25 * RELAY cells are generated throughout the code at the client or relay side,
26 * using relay_send_command_from_edge() or one of the functions like
27 * connection_edge_send_command() that calls it. Of particular interest is
28 * connection_edge_package_raw_inbuf(), which takes information that has
29 * arrived on an edge connection socket, and packages it as a RELAY_DATA cell
30 * -- this is how information is actually sent across the Tor network. The
31 * cryptography for these functions is handled deep in
32 * circuit_package_relay_cell(), which either adds a single layer of
33 * encryption (if we're an exit), or multiple layers (if we're the origin of
34 * the circuit). After construction and encryption, the RELAY cells are
35 * passed to append_cell_to_circuit_queue(), which queues them for
36 * transmission and tells the circuitmux (see circuitmux.c) that the circuit
37 * is waiting to send something.
38 *
39 * Incoming RELAY cells arrive at circuit_receive_relay_cell(), called from
40 * command.c. There they are decrypted and, if they are for us, are passed to
41 * connection_edge_process_relay_cell(). If they're not for us, they're
42 * re-queued for retransmission again with append_cell_to_circuit_queue().
43 *
44 * The connection_edge_process_relay_cell() function handles all the different
45 * types of relay cells, launching requests or transmitting data as needed.
46 **/
47
48#define RELAY_PRIVATE
49#include "core/or/or.h"
51#include "lib/err/backtrace.h"
52#include "lib/buf/buffers.h"
53#include "core/or/channel.h"
54#include "feature/client/circpathbias.h"
56#include "core/or/circuitlist.h"
57#include "core/or/circuituse.h"
59#include "core/or/extendinfo.h"
61#include "app/config/config.h"
69#include "feature/relay/dns.h"
72#include "feature/hs/hs_cache.h"
76#include "core/or/onion.h"
77#include "core/or/policies.h"
78#include "core/or/reasons.h"
79#include "core/or/relay.h"
84#include "core/or/scheduler.h"
87
88#include "core/or/cell_st.h"
95#include "core/or/or_circuit_st.h"
99#include "core/or/sendme.h"
102#include "core/or/conflux.h"
103#include "core/or/conflux_util.h"
104#include "core/or/conflux_pool.h"
105
107 cell_direction_t cell_direction,
108 crypt_path_t *layer_hint);
109
110static void circuit_resume_edge_reading(circuit_t *circ,
111 crypt_path_t *layer_hint);
113 circuit_t *circ,
114 crypt_path_t *layer_hint);
116 crypt_path_t *layer_hint);
119 entry_connection_t *conn,
120 node_t *node,
121 const tor_addr_t *addr);
123 circuit_t *circ,
124 edge_connection_t *conn,
125 crypt_path_t *layer_hint,
126 relay_header_t *rh);
127static void set_block_state_for_streams(circuit_t *circ,
128 edge_connection_t *stream_list,
129 int block, streamid_t stream_id);
130
131/** Stats: how many relay cells have originated at this hop, or have
132 * been relayed onward (not recognized at this hop)?
133 */
135/** Stats: how many relay cells have been delivered to streams at this
136 * hop?
137 */
139/** Stats: how many circuits have we closed due to the cell queue limit being
140 * reached (see append_cell_to_circuit_queue()) */
142uint64_t stats_n_circ_max_cell_outq_reached = 0;
143
144/**
145 * Update channel usage state based on the type of relay cell and
146 * circuit properties.
147 *
148 * This is needed to determine if a client channel is being
149 * used for application traffic, and if a relay channel is being
150 * used for multihop circuits and application traffic. The decision
151 * to pad in channelpadding.c depends upon this info (as well as
152 * consensus parameters) to decide what channels to pad.
153 */
154static void
156{
157 if (CIRCUIT_IS_ORIGIN(circ)) {
158 /*
159 * The client state was first set much earlier in
160 * circuit_send_next_onion_skin(), so we can start padding as early as
161 * possible.
162 *
163 * However, if padding turns out to be expensive, we may want to not do
164 * it until actual application traffic starts flowing (which is controlled
165 * via consensus param nf_pad_before_usage).
166 *
167 * So: If we're an origin circuit and we've created a full length circuit,
168 * then any CELL_RELAY cell means application data. Increase the usage
169 * state of the channel to indicate this.
170 *
171 * We want to wait for CELL_RELAY specifically here, so we know that
172 * the channel was definitely being used for data and not for extends.
173 * By default, we pad as soon as a channel has been used for *any*
174 * circuits, so this state is irrelevant to the padding decision in
175 * the default case. However, if padding turns out to be expensive,
176 * we would like the ability to avoid padding until we're absolutely
177 * sure that a channel is used for enough application data to be worth
178 * padding.
179 *
180 * (So it does not matter that CELL_RELAY_EARLY can actually contain
181 * application data. This is only a load reducing option and that edge
182 * case does not matter if we're desperately trying to reduce overhead
183 * anyway. See also consensus parameter nf_pad_before_usage).
184 */
185 if (BUG(!circ->n_chan))
186 return;
187
188 if (circ->n_chan->channel_usage == CHANNEL_USED_FOR_FULL_CIRCS &&
189 cell->command == CELL_RELAY) {
190 circ->n_chan->channel_usage = CHANNEL_USED_FOR_USER_TRAFFIC;
191 }
192 } else {
193 /* If we're a relay circuit, the question is more complicated. Basically:
194 * we only want to pad connections that carry multihop (anonymous)
195 * circuits.
196 *
197 * We assume we're more than one hop if either the previous hop
198 * is not a client, or if the previous hop is a client and there's
199 * a next hop. Then, circuit traffic starts at RELAY_EARLY, and
200 * user application traffic starts when we see RELAY cells.
201 */
202 or_circuit_t *or_circ = TO_OR_CIRCUIT(circ);
203
204 if (BUG(!or_circ->p_chan))
205 return;
206
207 if (!channel_is_client(or_circ->p_chan) ||
208 (channel_is_client(or_circ->p_chan) && circ->n_chan)) {
209 if (cell->command == CELL_RELAY_EARLY) {
210 if (or_circ->p_chan->channel_usage < CHANNEL_USED_FOR_FULL_CIRCS) {
211 or_circ->p_chan->channel_usage = CHANNEL_USED_FOR_FULL_CIRCS;
212 }
213 } else if (cell->command == CELL_RELAY) {
214 or_circ->p_chan->channel_usage = CHANNEL_USED_FOR_USER_TRAFFIC;
215 }
216 }
217 }
218}
219
220/** Receive a relay cell:
221 * - Crypt it (encrypt if headed toward the origin or if we <b>are</b> the
222 * origin; decrypt if we're headed toward the exit).
223 * - Check if recognized (if exitward).
224 * - If recognized and the digest checks out, then find if there's a stream
225 * that the cell is intended for, and deliver it to the right
226 * connection_edge.
227 * - If not recognized, then we need to relay it: append it to the appropriate
228 * cell_queue on <b>circ</b>.
229 *
230 * Return -<b>reason</b> on failure.
231 */
232int
234 cell_direction_t cell_direction)
235{
236 channel_t *chan = NULL;
237 crypt_path_t *layer_hint=NULL;
238 char recognized=0;
239 int reason;
240
241 tor_assert(cell);
242 tor_assert(circ);
243 tor_assert(cell_direction == CELL_DIRECTION_OUT ||
244 cell_direction == CELL_DIRECTION_IN);
245 if (circ->marked_for_close)
246 return 0;
247
248 if (relay_decrypt_cell(circ, cell, cell_direction, &layer_hint, &recognized)
249 < 0) {
250 log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
251 "relay crypt failed. Dropping connection.");
252 return -END_CIRC_REASON_INTERNAL;
253 }
254
256
257 if (recognized) {
258 edge_connection_t *conn = NULL;
259
260 /* Recognized cell, the cell digest has been updated, we'll record it for
261 * the SENDME if need be. */
262 sendme_record_received_cell_digest(circ, layer_hint);
263
265 if (pathbias_check_probe_response(circ, cell) == -1) {
266 pathbias_count_valid_cells(circ, cell);
267 }
268
269 /* We need to drop this cell no matter what to avoid code that expects
270 * a certain purpose (such as the hidserv code). */
271 return 0;
272 }
273
274 conn = relay_lookup_conn(circ, cell, cell_direction, layer_hint);
275 if (cell_direction == CELL_DIRECTION_OUT) {
277 log_debug(LD_OR,"Sending away from origin.");
278 reason = connection_edge_process_relay_cell(cell, circ, conn, NULL);
279 if (reason < 0) {
280 log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
281 "connection_edge_process_relay_cell (away from origin) "
282 "failed.");
283 return reason;
284 }
285 }
286 if (cell_direction == CELL_DIRECTION_IN) {
288 log_debug(LD_OR,"Sending to origin.");
289 reason = connection_edge_process_relay_cell(cell, circ, conn,
290 layer_hint);
291 if (reason < 0) {
292 /* If a client is trying to connect to unknown hidden service port,
293 * END_CIRC_AT_ORIGIN is sent back so we can then close the circuit.
294 * Do not log warn as this is an expected behavior for a service. */
295 if (reason != END_CIRC_AT_ORIGIN) {
296 log_warn(LD_OR,
297 "connection_edge_process_relay_cell (at origin) failed.");
298 }
299 return reason;
300 }
301 }
302 return 0;
303 }
304
305 /* not recognized. inform circpad and pass it on. */
306 circpad_deliver_unrecognized_cell_events(circ, cell_direction);
307
308 if (cell_direction == CELL_DIRECTION_OUT) {
309 cell->circ_id = circ->n_circ_id; /* switch it */
310 chan = circ->n_chan;
311 } else if (! CIRCUIT_IS_ORIGIN(circ)) {
312 cell->circ_id = TO_OR_CIRCUIT(circ)->p_circ_id; /* switch it */
313 chan = TO_OR_CIRCUIT(circ)->p_chan;
314 } else {
315 log_fn(LOG_PROTOCOL_WARN, LD_OR,
316 "Dropping unrecognized inbound cell on origin circuit.");
317 /* If we see unrecognized cells on path bias testing circs,
318 * it's bad mojo. Those circuits need to die.
319 * XXX: Shouldn't they always die? */
322 return -END_CIRC_REASON_TORPROTOCOL;
323 } else {
324 return 0;
325 }
326 }
327
328 if (!chan) {
329 // XXXX Can this splice stuff be done more cleanly?
330 if (! CIRCUIT_IS_ORIGIN(circ) &&
331 TO_OR_CIRCUIT(circ)->rend_splice &&
332 cell_direction == CELL_DIRECTION_OUT) {
333 or_circuit_t *splice_ = TO_OR_CIRCUIT(circ)->rend_splice;
336 cell->circ_id = splice_->p_circ_id;
337 cell->command = CELL_RELAY; /* can't be relay_early anyway */
338 if ((reason = circuit_receive_relay_cell(cell, TO_CIRCUIT(splice_),
339 CELL_DIRECTION_IN)) < 0) {
340 log_warn(LD_REND, "Error relaying cell across rendezvous; closing "
341 "circuits");
342 /* XXXX Do this here, or just return -1? */
343 circuit_mark_for_close(circ, -reason);
344 return reason;
345 }
346 return 0;
347 }
348 if (BUG(CIRCUIT_IS_ORIGIN(circ))) {
349 /* Should be impossible at this point. */
350 return -END_CIRC_REASON_TORPROTOCOL;
351 }
352 or_circuit_t *or_circ = TO_OR_CIRCUIT(circ);
353 if (++or_circ->n_cells_discarded_at_end == 1) {
354 time_t seconds_open = approx_time() - circ->timestamp_created.tv_sec;
355 log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
356 "Didn't recognize a cell, but circ stops here! Closing circuit. "
357 "It was created %ld seconds ago.", (long)seconds_open);
358 }
359 return -END_CIRC_REASON_TORPROTOCOL;
360 }
361
362 log_debug(LD_OR,"Passing on unrecognized cell.");
363
364 ++stats_n_relay_cells_relayed; /* XXXX no longer quite accurate {cells}
365 * we might kill the circ before we relay
366 * the cells. */
367
368 append_cell_to_circuit_queue(circ, chan, cell, cell_direction, 0);
369 return 0;
370}
371
372/** Package a relay cell from an edge:
373 * - Encrypt it to the right layer
374 * - Append it to the appropriate cell_queue on <b>circ</b>.
375 */
376MOCK_IMPL(int,
378 cell_direction_t cell_direction,
379 crypt_path_t *layer_hint, streamid_t on_stream,
380 const char *filename, int lineno))
381{
382 channel_t *chan; /* where to send the cell */
383
384 if (circ->marked_for_close) {
385 /* Circuit is marked; send nothing. */
386 return 0;
387 }
388
389 if (cell_direction == CELL_DIRECTION_OUT) {
390 chan = circ->n_chan;
391 if (!chan) {
392 log_warn(LD_BUG,"outgoing relay cell sent from %s:%d has n_chan==NULL."
393 " Dropping. Circuit is in state %s (%d), and is "
394 "%smarked for close. (%s:%d, %d)", filename, lineno,
395 circuit_state_to_string(circ->state), circ->state,
396 circ->marked_for_close ? "" : "not ",
399 if (CIRCUIT_IS_ORIGIN(circ)) {
401 }
402 log_backtrace(LOG_WARN,LD_BUG,"");
403 return 0; /* just drop it */
404 }
405 if (!CIRCUIT_IS_ORIGIN(circ)) {
406 log_warn(LD_BUG,"outgoing relay cell sent from %s:%d on non-origin "
407 "circ. Dropping.", filename, lineno);
408 log_backtrace(LOG_WARN,LD_BUG,"");
409 return 0; /* just drop it */
410 }
411
412 relay_encrypt_cell_outbound(cell, TO_ORIGIN_CIRCUIT(circ), layer_hint);
413
414 /* Update circ written totals for control port */
415 origin_circuit_t *ocirc = TO_ORIGIN_CIRCUIT(circ);
416 ocirc->n_written_circ_bw = tor_add_u32_nowrap(ocirc->n_written_circ_bw,
418
419 } else { /* incoming cell */
420 if (CIRCUIT_IS_ORIGIN(circ)) {
421 /* We should never package an _incoming_ cell from the circuit
422 * origin; that means we messed up somewhere. */
423 log_warn(LD_BUG,"incoming relay cell at origin circuit. Dropping.");
424 assert_circuit_ok(circ);
425 return 0; /* just drop it */
426 }
427 or_circuit_t *or_circ = TO_OR_CIRCUIT(circ);
428 relay_encrypt_cell_inbound(cell, or_circ);
429 chan = or_circ->p_chan;
430 }
432
433 append_cell_to_circuit_queue(circ, chan, cell, cell_direction, on_stream);
434 return 0;
435}
436
437/** If cell's stream_id matches the stream_id of any conn that's
438 * attached to circ, return that conn, else return NULL.
439 */
440static edge_connection_t *
442 cell_direction_t cell_direction, crypt_path_t *layer_hint)
443{
444 edge_connection_t *tmpconn;
446
447 relay_header_unpack(&rh, cell->payload);
448
449 if (!rh.stream_id)
450 return NULL;
451
452 /* IN or OUT cells could have come from either direction, now
453 * that we allow rendezvous *to* an OP.
454 */
455 if (CIRCUIT_IS_ORIGIN(circ)) {
456 for (tmpconn = TO_ORIGIN_CIRCUIT(circ)->p_streams; tmpconn;
457 tmpconn=tmpconn->next_stream) {
458 if (rh.stream_id == tmpconn->stream_id &&
459 !tmpconn->base_.marked_for_close &&
460 edge_uses_cpath(tmpconn, layer_hint)) {
461 log_debug(LD_APP,"found conn for stream %d.", rh.stream_id);
462 return tmpconn;
463 }
464 }
465 } else {
466 for (tmpconn = TO_OR_CIRCUIT(circ)->n_streams; tmpconn;
467 tmpconn=tmpconn->next_stream) {
468 if (rh.stream_id == tmpconn->stream_id &&
469 !tmpconn->base_.marked_for_close) {
470 log_debug(LD_EXIT,"found conn for stream %d.", rh.stream_id);
471 if (cell_direction == CELL_DIRECTION_OUT ||
473 return tmpconn;
474 }
475 }
476 for (tmpconn = TO_OR_CIRCUIT(circ)->resolving_streams; tmpconn;
477 tmpconn=tmpconn->next_stream) {
478 if (rh.stream_id == tmpconn->stream_id &&
479 !tmpconn->base_.marked_for_close) {
480 log_debug(LD_EXIT,"found conn for stream %d.", rh.stream_id);
481 return tmpconn;
482 }
483 }
484 }
485 return NULL; /* probably a begin relay cell */
486}
487
488/** Pack the relay_header_t host-order structure <b>src</b> into
489 * network-order in the buffer <b>dest</b>. See tor-spec.txt for details
490 * about the wire format.
491 */
492void
493relay_header_pack(uint8_t *dest, const relay_header_t *src)
494{
495 set_uint8(dest, src->command);
496 set_uint16(dest+1, htons(src->recognized));
497 set_uint16(dest+3, htons(src->stream_id));
498 memcpy(dest+5, src->integrity, 4);
499 set_uint16(dest+9, htons(src->length));
500}
501
502/** Unpack the network-order buffer <b>src</b> into a host-order
503 * relay_header_t structure <b>dest</b>.
504 */
505void
506relay_header_unpack(relay_header_t *dest, const uint8_t *src)
507{
508 dest->command = get_uint8(src);
509 dest->recognized = ntohs(get_uint16(src+1));
510 dest->stream_id = ntohs(get_uint16(src+3));
511 memcpy(dest->integrity, src+5, 4);
512 dest->length = ntohs(get_uint16(src+9));
513}
514
515/** Convert the relay <b>command</b> into a human-readable string. */
516const char *
518{
519 static char buf[64];
520 switch (command) {
521 case RELAY_COMMAND_BEGIN: return "BEGIN";
522 case RELAY_COMMAND_DATA: return "DATA";
523 case RELAY_COMMAND_END: return "END";
524 case RELAY_COMMAND_CONNECTED: return "CONNECTED";
525 case RELAY_COMMAND_SENDME: return "SENDME";
526 case RELAY_COMMAND_EXTEND: return "EXTEND";
527 case RELAY_COMMAND_EXTENDED: return "EXTENDED";
528 case RELAY_COMMAND_TRUNCATE: return "TRUNCATE";
529 case RELAY_COMMAND_TRUNCATED: return "TRUNCATED";
530 case RELAY_COMMAND_DROP: return "DROP";
531 case RELAY_COMMAND_RESOLVE: return "RESOLVE";
532 case RELAY_COMMAND_RESOLVED: return "RESOLVED";
533 case RELAY_COMMAND_BEGIN_DIR: return "BEGIN_DIR";
534 case RELAY_COMMAND_ESTABLISH_INTRO: return "ESTABLISH_INTRO";
535 case RELAY_COMMAND_ESTABLISH_RENDEZVOUS: return "ESTABLISH_RENDEZVOUS";
536 case RELAY_COMMAND_INTRODUCE1: return "INTRODUCE1";
537 case RELAY_COMMAND_INTRODUCE2: return "INTRODUCE2";
538 case RELAY_COMMAND_RENDEZVOUS1: return "RENDEZVOUS1";
539 case RELAY_COMMAND_RENDEZVOUS2: return "RENDEZVOUS2";
540 case RELAY_COMMAND_INTRO_ESTABLISHED: return "INTRO_ESTABLISHED";
541 case RELAY_COMMAND_RENDEZVOUS_ESTABLISHED:
542 return "RENDEZVOUS_ESTABLISHED";
543 case RELAY_COMMAND_INTRODUCE_ACK: return "INTRODUCE_ACK";
544 case RELAY_COMMAND_EXTEND2: return "EXTEND2";
545 case RELAY_COMMAND_EXTENDED2: return "EXTENDED2";
546 case RELAY_COMMAND_PADDING_NEGOTIATE: return "PADDING_NEGOTIATE";
547 case RELAY_COMMAND_PADDING_NEGOTIATED: return "PADDING_NEGOTIATED";
548 case RELAY_COMMAND_CONFLUX_LINK: return "CONFLUX_LINK";
549 case RELAY_COMMAND_CONFLUX_LINKED: return "CONFLUX_LINKED";
550 case RELAY_COMMAND_CONFLUX_LINKED_ACK: return "CONFLUX_LINKED_ACK";
551 case RELAY_COMMAND_CONFLUX_SWITCH: return "CONFLUX_SWITCH";
552 default:
553 tor_snprintf(buf, sizeof(buf), "Unrecognized relay command %u",
554 (unsigned)command);
555 return buf;
556 }
557}
558
559/** When padding a cell with randomness, leave this many zeros after the
560 * payload. */
561#define CELL_PADDING_GAP 4
562
563/** Return the offset where the padding should start. The <b>data_len</b> is
564 * the relay payload length expected to be put in the cell. It can not be
565 * bigger than RELAY_PAYLOAD_SIZE else this function assert().
566 *
567 * Value will always be smaller than CELL_PAYLOAD_SIZE because this offset is
568 * for the entire cell length not just the data payload length. Zero is
569 * returned if there is no room for padding.
570 *
571 * This function always skips the first 4 bytes after the payload because
572 * having some unused zero bytes has saved us a lot of times in the past. */
573
574STATIC size_t
575get_pad_cell_offset(size_t data_len)
576{
577 /* This is never supposed to happen but in case it does, stop right away
578 * because if tor is tricked somehow into not adding random bytes to the
579 * payload with this function returning 0 for a bad data_len, the entire
580 * authenticated SENDME design can be bypassed leading to bad denial of
581 * service attacks. */
582 tor_assert(data_len <= RELAY_PAYLOAD_SIZE);
583
584 /* If the offset is larger than the cell payload size, we return an offset
585 * of zero indicating that no padding needs to be added. */
586 size_t offset = RELAY_HEADER_SIZE + data_len + CELL_PADDING_GAP;
587 if (offset >= CELL_PAYLOAD_SIZE) {
588 return 0;
589 }
590 return offset;
591}
592
593/* Add random bytes to the unused portion of the payload, to foil attacks
594 * where the other side can predict all of the bytes in the payload and thus
595 * compute the authenticated SENDME cells without seeing the traffic. See
596 * proposal 289. */
597static void
598pad_cell_payload(uint8_t *cell_payload, size_t data_len)
599{
600 size_t pad_offset, pad_len;
601
602 tor_assert(cell_payload);
603
604 pad_offset = get_pad_cell_offset(data_len);
605 if (pad_offset == 0) {
606 /* We can't add padding so we are done. */
607 return;
608 }
609
610 /* Remember here that the cell_payload is the length of the header and
611 * payload size so we offset it using the full length of the cell. */
612 pad_len = CELL_PAYLOAD_SIZE - pad_offset;
614 cell_payload + pad_offset, pad_len);
615}
616
617/** Make a relay cell out of <b>relay_command</b> and <b>payload</b>, and send
618 * it onto the open circuit <b>circ</b>. <b>stream_id</b> is the ID on
619 * <b>circ</b> for the stream that's sending the relay cell, or 0 if it's a
620 * control cell. <b>cpath_layer</b> is NULL for OR->OP cells, or the
621 * destination hop for OP->OR cells.
622 *
623 * If you can't send the cell, mark the circuit for close and return -1. Else
624 * return 0.
625 */
626MOCK_IMPL(int,
628 uint8_t relay_command, const char *payload,
629 size_t payload_len, crypt_path_t *cpath_layer,
630 const char *filename, int lineno))
631{
632 cell_t cell;
634 cell_direction_t cell_direction;
635 circuit_t *circ = orig_circ;
636
637 /* If conflux is enabled, decide which leg to send on, and use that */
638 if (orig_circ->conflux && conflux_should_multiplex(relay_command)) {
639 circ = conflux_decide_circ_for_send(orig_circ->conflux, orig_circ,
640 relay_command);
641 if (BUG(!circ)) {
642 log_warn(LD_BUG, "No circuit to send for conflux for relay command %d, "
643 "called from %s:%d", relay_command, filename, lineno);
644 conflux_log_set(LOG_WARN, orig_circ->conflux,
645 CIRCUIT_IS_ORIGIN(orig_circ));
646 circ = orig_circ;
647 } else {
648 /* Conflux circuits always send multiplexed relay commands to
649 * to the last hop. (Non-multiplexed commands go on their
650 * original circuit and hop). */
651 cpath_layer = conflux_get_destination_hop(circ);
652 }
653 }
654
655 /* XXXX NM Split this function into a separate versions per circuit type? */
656
657 tor_assert(circ);
658 tor_assert(payload_len <= RELAY_PAYLOAD_SIZE);
659
660 memset(&cell, 0, sizeof(cell_t));
661 cell.command = CELL_RELAY;
662 if (CIRCUIT_IS_ORIGIN(circ)) {
663 tor_assert(cpath_layer);
664 cell.circ_id = circ->n_circ_id;
665 cell_direction = CELL_DIRECTION_OUT;
666 } else {
667 tor_assert(! cpath_layer);
668 cell.circ_id = TO_OR_CIRCUIT(circ)->p_circ_id;
669 cell_direction = CELL_DIRECTION_IN;
670 }
671
672 memset(&rh, 0, sizeof(rh));
673 rh.command = relay_command;
674 rh.stream_id = stream_id;
675 rh.length = payload_len;
676 relay_header_pack(cell.payload, &rh);
677
678 if (payload_len)
679 memcpy(cell.payload+RELAY_HEADER_SIZE, payload, payload_len);
680
681 /* Add random padding to the cell if we can. */
682 pad_cell_payload(cell.payload, payload_len);
683
684 log_debug(LD_OR,"delivering %d cell %s.", relay_command,
685 cell_direction == CELL_DIRECTION_OUT ? "forward" : "backward");
686
687 /* Tell circpad we're sending a relay cell */
688 circpad_deliver_sent_relay_cell_events(circ, relay_command);
689
690 /* If we are sending an END cell and this circuit is used for a tunneled
691 * directory request, advance its state. */
692 if (relay_command == RELAY_COMMAND_END && circ->dirreq_id)
693 geoip_change_dirreq_state(circ->dirreq_id, DIRREQ_TUNNELED,
695
696 if (cell_direction == CELL_DIRECTION_OUT && circ->n_chan) {
697 /* if we're using relaybandwidthrate, this conn wants priority */
699 }
700
701 if (cell_direction == CELL_DIRECTION_OUT) {
702 origin_circuit_t *origin_circ = TO_ORIGIN_CIRCUIT(circ);
703 if (origin_circ->remaining_relay_early_cells > 0 &&
704 (relay_command == RELAY_COMMAND_EXTEND ||
705 relay_command == RELAY_COMMAND_EXTEND2 ||
706 cpath_layer != origin_circ->cpath)) {
707 /* If we've got any relay_early cells left and (we're sending
708 * an extend cell or we're not talking to the first hop), use
709 * one of them. Don't worry about the conn protocol version:
710 * append_cell_to_circuit_queue will fix it up. */
711 cell.command = CELL_RELAY_EARLY;
712 /* If we're out of relay early cells, tell circpad */
713 if (--origin_circ->remaining_relay_early_cells == 0)
715 log_debug(LD_OR, "Sending a RELAY_EARLY cell; %d remaining.",
716 (int)origin_circ->remaining_relay_early_cells);
717 /* Memorize the command that is sent as RELAY_EARLY cell; helps debug
718 * task 878. */
719 origin_circ->relay_early_commands[
720 origin_circ->relay_early_cells_sent++] = relay_command;
721 } else if (relay_command == RELAY_COMMAND_EXTEND ||
722 relay_command == RELAY_COMMAND_EXTEND2) {
723 /* If no RELAY_EARLY cells can be sent over this circuit, log which
724 * commands have been sent as RELAY_EARLY cells before; helps debug
725 * task 878. */
726 smartlist_t *commands_list = smartlist_new();
727 int i = 0;
728 char *commands = NULL;
729 for (; i < origin_circ->relay_early_cells_sent; i++)
730 smartlist_add(commands_list, (char *)
732 commands = smartlist_join_strings(commands_list, ",", 0, NULL);
733 log_warn(LD_BUG, "Uh-oh. We're sending a RELAY_COMMAND_EXTEND cell, "
734 "but we have run out of RELAY_EARLY cells on that circuit. "
735 "Commands sent before: %s", commands);
736 tor_free(commands);
737 smartlist_free(commands_list);
738 }
739
740 /* Let's assume we're well-behaved: Anything that we decide to send is
741 * valid, delivered data. */
742 circuit_sent_valid_data(origin_circ, rh.length);
743 }
744
745 if (circuit_package_relay_cell(&cell, circ, cell_direction, cpath_layer,
746 stream_id, filename, lineno) < 0) {
747 log_warn(LD_BUG,"circuit_package_relay_cell failed. Closing.");
748 circuit_mark_for_close(circ, END_CIRC_REASON_INTERNAL);
749 return -1;
750 }
751
752 if (circ->conflux) {
753 conflux_note_cell_sent(circ->conflux, circ, relay_command);
754 }
755
756 /* If applicable, note the cell digest for the SENDME version 1 purpose if
757 * we need to. This call needs to be after the circuit_package_relay_cell()
758 * because the cell digest is set within that function. */
759 if (relay_command == RELAY_COMMAND_DATA) {
760 sendme_record_cell_digest_on_circ(circ, cpath_layer);
761
762 /* Handle the circuit-level SENDME package window. */
763 if (sendme_note_circuit_data_packaged(circ, cpath_layer) < 0) {
764 /* Package window has gone under 0. Protocol issue. */
765 log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
766 "Circuit package window is below 0. Closing circuit.");
767 circuit_mark_for_close(circ, END_CIRC_REASON_TORPROTOCOL);
768 return -1;
769 }
770 }
771
772 return 0;
773}
774
775/** Make a relay cell out of <b>relay_command</b> and <b>payload</b>, and
776 * send it onto the open circuit <b>circ</b>. <b>fromconn</b> is the stream
777 * that's sending the relay cell, or NULL if it's a control cell.
778 * <b>cpath_layer</b> is NULL for OR->OP cells, or the destination hop
779 * for OP->OR cells.
780 *
781 * If you can't send the cell, mark the circuit for close and
782 * return -1. Else return 0.
783 */
784int
786 uint8_t relay_command, const char *payload,
787 size_t payload_len)
788{
789 /* XXXX NM Split this function into a separate versions per circuit type? */
790 circuit_t *circ;
791 crypt_path_t *cpath_layer = fromconn->cpath_layer;
792 tor_assert(fromconn);
793
794 circ = fromconn->on_circuit;
795
796 if (fromconn->base_.marked_for_close) {
797 log_warn(LD_BUG,
798 "called on conn that's already marked for close at %s:%d.",
799 fromconn->base_.marked_for_close_file,
800 fromconn->base_.marked_for_close);
801 return 0;
802 }
803
804 if (!circ) {
805 if (fromconn->base_.type == CONN_TYPE_AP) {
806 log_info(LD_APP,"no circ. Closing conn.");
807 connection_mark_unattached_ap(EDGE_TO_ENTRY_CONN(fromconn),
808 END_STREAM_REASON_INTERNAL);
809 } else {
810 log_info(LD_EXIT,"no circ. Closing conn.");
811 fromconn->edge_has_sent_end = 1; /* no circ to send to */
812 fromconn->end_reason = END_STREAM_REASON_INTERNAL;
813 connection_mark_for_close(TO_CONN(fromconn));
814 }
815 return -1;
816 }
817
818 if (circ->marked_for_close) {
819 /* The circuit has been marked, but not freed yet. When it's freed, it
820 * will mark this connection for close. */
821 return -1;
822 }
823
824#ifdef MEASUREMENTS_21206
825 /* Keep track of the number of RELAY_DATA cells sent for directory
826 * connections. */
827 connection_t *linked_conn = TO_CONN(fromconn)->linked_conn;
828
829 if (linked_conn && linked_conn->type == CONN_TYPE_DIR) {
830 ++(TO_DIR_CONN(linked_conn)->data_cells_sent);
831 }
832#endif /* defined(MEASUREMENTS_21206) */
833
834 return relay_send_command_from_edge(fromconn->stream_id, circ,
835 relay_command, payload,
836 payload_len, cpath_layer);
837}
838
839/** How many times will I retry a stream that fails due to DNS
840 * resolve failure or misc error?
841 */
842#define MAX_RESOLVE_FAILURES 3
843
844/** Return 1 if reason is something that you should retry if you
845 * get the end cell before you've connected; else return 0. */
846static int
848{
849 return reason == END_STREAM_REASON_HIBERNATING ||
850 reason == END_STREAM_REASON_RESOURCELIMIT ||
851 reason == END_STREAM_REASON_EXITPOLICY ||
852 reason == END_STREAM_REASON_RESOLVEFAILED ||
853 reason == END_STREAM_REASON_MISC ||
854 reason == END_STREAM_REASON_NOROUTE;
855}
856
857/** Called when we receive an END cell on a stream that isn't open yet,
858 * from the client side.
859 * Arguments are as for connection_edge_process_relay_cell().
860 */
861static int
863 relay_header_t *rh, cell_t *cell, origin_circuit_t *circ,
864 entry_connection_t *conn, crypt_path_t *layer_hint)
865{
866 node_t *exitrouter;
867 int reason = *(cell->payload+RELAY_HEADER_SIZE);
868 int control_reason;
869 edge_connection_t *edge_conn = ENTRY_TO_EDGE_CONN(conn);
870 (void) layer_hint; /* unused */
871
872 if (rh->length > 0) {
873 if (reason == END_STREAM_REASON_TORPROTOCOL ||
874 reason == END_STREAM_REASON_DESTROY) {
875 /* Both of these reasons could mean a failed tag
876 * hit the exit and it complained. Do not probe.
877 * Fail the circuit. */
879 return -END_CIRC_REASON_TORPROTOCOL;
880 } else if (reason == END_STREAM_REASON_INTERNAL) {
881 /* We can't infer success or failure, since older Tors report
882 * ENETUNREACH as END_STREAM_REASON_INTERNAL. */
883 } else {
884 /* Path bias: If we get a valid reason code from the exit,
885 * it wasn't due to tagging.
886 *
887 * We rely on recognized+digest being strong enough to make
888 * tags unlikely to allow us to get tagged, yet 'recognized'
889 * reason codes here. */
891 }
892 }
893
894 /* This end cell is now valid. */
896
897 if (rh->length == 0) {
898 reason = END_STREAM_REASON_MISC;
899 }
900
901 control_reason = reason | END_STREAM_REASON_FLAG_REMOTE;
902
903 if (edge_reason_is_retriable(reason) &&
904 /* avoid retry if rend */
906 const char *chosen_exit_digest =
908 log_info(LD_APP,"Address '%s' refused due to '%s'. Considering retrying.",
909 safe_str(conn->socks_request->address),
911 exitrouter = node_get_mutable_by_id(chosen_exit_digest);
912 switch (reason) {
913 case END_STREAM_REASON_EXITPOLICY: {
914 tor_addr_t addr;
916 if (rh->length >= 5) {
917 int ttl = -1;
919 if (rh->length == 5 || rh->length == 9) {
922 if (rh->length == 9)
923 ttl = (int)ntohl(get_uint32(cell->payload+RELAY_HEADER_SIZE+5));
924 } else if (rh->length == 17 || rh->length == 21) {
926 (cell->payload+RELAY_HEADER_SIZE+1));
927 if (rh->length == 21)
928 ttl = (int)ntohl(get_uint32(cell->payload+RELAY_HEADER_SIZE+17));
929 }
930 if (tor_addr_is_null(&addr)) {
931 log_info(LD_APP,"Address '%s' resolved to 0.0.0.0. Closing,",
932 safe_str(conn->socks_request->address));
933 connection_mark_unattached_ap(conn, END_STREAM_REASON_TORPROTOCOL);
934 return 0;
935 }
936
937 if ((tor_addr_family(&addr) == AF_INET &&
938 !conn->entry_cfg.ipv4_traffic) ||
939 (tor_addr_family(&addr) == AF_INET6 &&
940 !conn->entry_cfg.ipv6_traffic)) {
941 log_fn(LOG_PROTOCOL_WARN, LD_APP,
942 "Got an EXITPOLICY failure on a connection with a "
943 "mismatched family. Closing.");
944 connection_mark_unattached_ap(conn, END_STREAM_REASON_TORPROTOCOL);
945 return 0;
946 }
947 if (get_options()->ClientDNSRejectInternalAddresses &&
948 tor_addr_is_internal(&addr, 0)) {
949 log_info(LD_APP,"Address '%s' resolved to internal. Closing,",
950 safe_str(conn->socks_request->address));
951 connection_mark_unattached_ap(conn, END_STREAM_REASON_TORPROTOCOL);
952 return 0;
953 }
954
956 conn->socks_request->address, &addr,
957 conn->chosen_exit_name, ttl);
958
959 {
960 char new_addr[TOR_ADDR_BUF_LEN];
961 tor_addr_to_str(new_addr, &addr, sizeof(new_addr), 1);
962 if (strcmp(conn->socks_request->address, new_addr)) {
963 strlcpy(conn->socks_request->address, new_addr,
964 sizeof(conn->socks_request->address));
965 control_event_stream_status(conn, STREAM_EVENT_REMAP, 0);
966 }
967 }
968 }
969 /* check if the exit *ought* to have allowed it */
970
972 conn,
973 exitrouter,
974 &addr);
975
976 if (conn->chosen_exit_optional ||
977 conn->chosen_exit_retries) {
978 /* stop wanting a specific exit */
979 conn->chosen_exit_optional = 0;
980 /* A non-zero chosen_exit_retries can happen if we set a
981 * TrackHostExits for this address under a port that the exit
982 * relay allows, but then try the same address with a different
983 * port that it doesn't allow to exit. We shouldn't unregister
984 * the mapping, since it is probably still wanted on the
985 * original port. But now we give away to the exit relay that
986 * we probably have a TrackHostExits on it. So be it. */
987 conn->chosen_exit_retries = 0;
988 tor_free(conn->chosen_exit_name); /* clears it */
989 }
990 if (connection_ap_detach_retriable(conn, circ, control_reason) >= 0)
991 return 0;
992 /* else, conn will get closed below */
993 break;
994 }
995 case END_STREAM_REASON_CONNECTREFUSED:
996 if (!conn->chosen_exit_optional)
997 break; /* break means it'll close, below */
998 /* Else fall through: expire this circuit, clear the
999 * chosen_exit_name field, and try again. */
1000 FALLTHROUGH;
1001 case END_STREAM_REASON_RESOLVEFAILED:
1002 case END_STREAM_REASON_TIMEOUT:
1003 case END_STREAM_REASON_MISC:
1004 case END_STREAM_REASON_NOROUTE:
1007 /* We haven't retried too many times; reattach the connection. */
1009 /* Mark this circuit "unusable for new streams". */
1011
1012 if (conn->chosen_exit_optional) {
1013 /* stop wanting a specific exit */
1014 conn->chosen_exit_optional = 0;
1015 tor_free(conn->chosen_exit_name); /* clears it */
1016 }
1017 if (connection_ap_detach_retriable(conn, circ, control_reason) >= 0)
1018 return 0;
1019 /* else, conn will get closed below */
1020 } else {
1021 log_notice(LD_APP,
1022 "Have tried resolving or connecting to address '%s' "
1023 "at %d different places. Giving up.",
1024 safe_str(conn->socks_request->address),
1026 /* clear the failures, so it will have a full try next time */
1028 }
1029 break;
1030 case END_STREAM_REASON_HIBERNATING:
1031 case END_STREAM_REASON_RESOURCELIMIT:
1032 if (exitrouter) {
1034 }
1035 if (conn->chosen_exit_optional) {
1036 /* stop wanting a specific exit */
1037 conn->chosen_exit_optional = 0;
1038 tor_free(conn->chosen_exit_name); /* clears it */
1039 }
1040 if (connection_ap_detach_retriable(conn, circ, control_reason) >= 0)
1041 return 0;
1042 /* else, will close below */
1043 break;
1044 } /* end switch */
1045 log_info(LD_APP,"Giving up on retrying; conn can't be handled.");
1046 }
1047
1048 log_info(LD_APP,
1049 "Edge got end (%s) before we're connected. Marking for close.",
1050 stream_end_reason_to_string(rh->length > 0 ? reason : -1));
1052 /* need to test because of detach_retriable */
1053 if (!ENTRY_TO_CONN(conn)->marked_for_close)
1054 connection_mark_unattached_ap(conn, control_reason);
1055 return 0;
1056}
1057
1058/** Called when we have gotten an END_REASON_EXITPOLICY failure on <b>circ</b>
1059 * for <b>conn</b>, while attempting to connect via <b>node</b>. If the node
1060 * told us which address it rejected, then <b>addr</b> is that address;
1061 * otherwise it is AF_UNSPEC.
1062 *
1063 * If we are sure the node should have allowed this address, mark the node as
1064 * having a reject *:* exit policy. Otherwise, mark the circuit as unusable
1065 * for this particular address.
1066 **/
1067static void
1069 entry_connection_t *conn,
1070 node_t *node,
1071 const tor_addr_t *addr)
1072{
1073 int make_reject_all = 0;
1074 const sa_family_t family = tor_addr_family(addr);
1075
1076 if (node) {
1077 tor_addr_t tmp;
1078 int asked_for_family = tor_addr_parse(&tmp, conn->socks_request->address);
1079 if (family == AF_UNSPEC) {
1080 make_reject_all = 1;
1081 } else if (node_exit_policy_is_exact(node, family) &&
1082 asked_for_family != -1 && !conn->chosen_exit_name) {
1083 make_reject_all = 1;
1084 }
1085
1086 if (make_reject_all) {
1087 log_info(LD_APP,
1088 "Exitrouter %s seems to be more restrictive than its exit "
1089 "policy. Not using this router as exit for now.",
1090 node_describe(node));
1092 }
1093 }
1094
1095 if (family != AF_UNSPEC)
1097}
1098
1099/** Helper: change the socks_request-&gt;address field on conn to the
1100 * dotted-quad representation of <b>new_addr</b>,
1101 * and send an appropriate REMAP event. */
1102static void
1104{
1105 tor_addr_to_str(conn->socks_request->address, new_addr,
1106 sizeof(conn->socks_request->address),
1107 1);
1108 control_event_stream_status(conn, STREAM_EVENT_REMAP,
1110}
1111
1112/** Extract the contents of a connected cell in <b>cell</b>, whose relay
1113 * header has already been parsed into <b>rh</b>. On success, set
1114 * <b>addr_out</b> to the address we're connected to, and <b>ttl_out</b> to
1115 * the ttl of that address, in seconds, and return 0. On failure, return
1116 * -1.
1117 *
1118 * Note that the resulting address can be UNSPEC if the connected cell had no
1119 * address (as for a stream to an union service or a tunneled directory
1120 * connection), and that the ttl can be absent (in which case <b>ttl_out</b>
1121 * is set to -1). */
1122STATIC int
1124 tor_addr_t *addr_out, int *ttl_out)
1125{
1126 uint32_t bytes;
1127 const uint8_t *payload = cell->payload + RELAY_HEADER_SIZE;
1128
1129 tor_addr_make_unspec(addr_out);
1130 *ttl_out = -1;
1131 if (rh->length == 0)
1132 return 0;
1133 if (rh->length < 4)
1134 return -1;
1135 bytes = ntohl(get_uint32(payload));
1136
1137 /* If bytes is 0, this is maybe a v6 address. Otherwise it's a v4 address */
1138 if (bytes != 0) {
1139 /* v4 address */
1140 tor_addr_from_ipv4h(addr_out, bytes);
1141 if (rh->length >= 8) {
1142 bytes = ntohl(get_uint32(payload + 4));
1143 if (bytes <= INT32_MAX)
1144 *ttl_out = bytes;
1145 }
1146 } else {
1147 if (rh->length < 25) /* 4 bytes of 0s, 1 addr, 16 ipv4, 4 ttl. */
1148 return -1;
1149 if (get_uint8(payload + 4) != 6)
1150 return -1;
1151 tor_addr_from_ipv6_bytes(addr_out, (payload + 5));
1152 bytes = ntohl(get_uint32(payload + 21));
1153 if (bytes <= INT32_MAX)
1154 *ttl_out = (int) bytes;
1155 }
1156 return 0;
1157}
1158
1159/** Drop all storage held by <b>addr</b>. */
1160STATIC void
1161address_ttl_free_(address_ttl_t *addr)
1162{
1163 if (!addr)
1164 return;
1165 tor_free(addr->hostname);
1166 tor_free(addr);
1167}
1168
1169/** Parse a resolved cell in <b>cell</b>, with parsed header in <b>rh</b>.
1170 * Return -1 on parse error. On success, add one or more newly allocated
1171 * address_ttl_t to <b>addresses_out</b>; set *<b>errcode_out</b> to
1172 * one of 0, RESOLVED_TYPE_ERROR, or RESOLVED_TYPE_ERROR_TRANSIENT, and
1173 * return 0. */
1174STATIC int
1176 smartlist_t *addresses_out, int *errcode_out)
1177{
1178 const uint8_t *cp;
1179 uint8_t answer_type;
1180 size_t answer_len;
1181 address_ttl_t *addr;
1182 size_t remaining;
1183 int errcode = 0;
1184 smartlist_t *addrs;
1185
1186 tor_assert(cell);
1187 tor_assert(rh);
1188 tor_assert(addresses_out);
1189 tor_assert(errcode_out);
1190
1191 *errcode_out = 0;
1192
1193 if (rh->length > RELAY_PAYLOAD_SIZE)
1194 return -1;
1195
1196 addrs = smartlist_new();
1197
1198 cp = cell->payload + RELAY_HEADER_SIZE;
1199
1200 remaining = rh->length;
1201 while (remaining) {
1202 const uint8_t *cp_orig = cp;
1203 if (remaining < 2)
1204 goto err;
1205 answer_type = *cp++;
1206 answer_len = *cp++;
1207 if (remaining < 2 + answer_len + 4) {
1208 goto err;
1209 }
1210 if (answer_type == RESOLVED_TYPE_IPV4) {
1211 if (answer_len != 4) {
1212 goto err;
1213 }
1214 addr = tor_malloc_zero(sizeof(*addr));
1215 tor_addr_from_ipv4n(&addr->addr, get_uint32(cp));
1216 cp += 4;
1217 addr->ttl = ntohl(get_uint32(cp));
1218 cp += 4;
1219 smartlist_add(addrs, addr);
1220 } else if (answer_type == RESOLVED_TYPE_IPV6) {
1221 if (answer_len != 16)
1222 goto err;
1223 addr = tor_malloc_zero(sizeof(*addr));
1224 tor_addr_from_ipv6_bytes(&addr->addr, cp);
1225 cp += 16;
1226 addr->ttl = ntohl(get_uint32(cp));
1227 cp += 4;
1228 smartlist_add(addrs, addr);
1229 } else if (answer_type == RESOLVED_TYPE_HOSTNAME) {
1230 if (answer_len == 0) {
1231 goto err;
1232 }
1233 addr = tor_malloc_zero(sizeof(*addr));
1234 addr->hostname = tor_memdup_nulterm(cp, answer_len);
1235 cp += answer_len;
1236 addr->ttl = ntohl(get_uint32(cp));
1237 cp += 4;
1238 smartlist_add(addrs, addr);
1239 } else if (answer_type == RESOLVED_TYPE_ERROR_TRANSIENT ||
1240 answer_type == RESOLVED_TYPE_ERROR) {
1241 errcode = answer_type;
1242 /* Ignore the error contents */
1243 cp += answer_len + 4;
1244 } else {
1245 cp += answer_len + 4;
1246 }
1247 tor_assert(((ssize_t)remaining) >= (cp - cp_orig));
1248 remaining -= (cp - cp_orig);
1249 }
1250
1251 if (errcode && smartlist_len(addrs) == 0) {
1252 /* Report an error only if there were no results. */
1253 *errcode_out = errcode;
1254 }
1255
1256 smartlist_add_all(addresses_out, addrs);
1257 smartlist_free(addrs);
1258
1259 return 0;
1260
1261 err:
1262 /* On parse error, don't report any results */
1263 SMARTLIST_FOREACH(addrs, address_ttl_t *, a, address_ttl_free(a));
1264 smartlist_free(addrs);
1265 return -1;
1266}
1267
1268/** Helper for connection_edge_process_resolved_cell: given an error code,
1269 * an entry_connection, and a list of address_ttl_t *, report the best answer
1270 * to the entry_connection. */
1271static void
1273 int error_code,
1274 smartlist_t *results)
1275{
1276 address_ttl_t *addr_ipv4 = NULL;
1277 address_ttl_t *addr_ipv6 = NULL;
1278 address_ttl_t *addr_hostname = NULL;
1279 address_ttl_t *addr_best = NULL;
1280
1281 /* If it's an error code, that's easy. */
1282 if (error_code) {
1283 tor_assert(error_code == RESOLVED_TYPE_ERROR ||
1284 error_code == RESOLVED_TYPE_ERROR_TRANSIENT);
1286 error_code,0,NULL,-1,-1);
1287 return;
1288 }
1289
1290 /* Get the first answer of each type. */
1291 SMARTLIST_FOREACH_BEGIN(results, address_ttl_t *, addr) {
1292 if (addr->hostname) {
1293 if (!addr_hostname) {
1294 addr_hostname = addr;
1295 }
1296 } else if (tor_addr_family(&addr->addr) == AF_INET) {
1297 if (!addr_ipv4 && conn->entry_cfg.ipv4_traffic) {
1298 addr_ipv4 = addr;
1299 }
1300 } else if (tor_addr_family(&addr->addr) == AF_INET6) {
1301 if (!addr_ipv6 && conn->entry_cfg.ipv6_traffic) {
1302 addr_ipv6 = addr;
1303 }
1304 }
1305 } SMARTLIST_FOREACH_END(addr);
1306
1307 /* Now figure out which type we wanted to deliver. */
1309 if (addr_hostname) {
1311 RESOLVED_TYPE_HOSTNAME,
1312 strlen(addr_hostname->hostname),
1313 (uint8_t*)addr_hostname->hostname,
1314 addr_hostname->ttl,-1);
1315 } else {
1317 RESOLVED_TYPE_ERROR,0,NULL,-1,-1);
1318 }
1319 return;
1320 }
1321
1322 if (conn->entry_cfg.prefer_ipv6) {
1323 addr_best = addr_ipv6 ? addr_ipv6 : addr_ipv4;
1324 } else {
1325 addr_best = addr_ipv4 ? addr_ipv4 : addr_ipv6;
1326 }
1327
1328 /* Now convert it to the ugly old interface */
1329 if (! addr_best) {
1331 RESOLVED_TYPE_ERROR,0,NULL,-1,-1);
1332 return;
1333 }
1334
1336 &addr_best->addr,
1337 addr_best->ttl,
1338 -1);
1339
1340 remap_event_helper(conn, &addr_best->addr);
1341}
1342
1343/** Handle a RELAY_COMMAND_RESOLVED cell that we received on a non-open AP
1344 * stream. */
1345STATIC int
1347 const cell_t *cell,
1348 const relay_header_t *rh)
1349{
1350 entry_connection_t *entry_conn = EDGE_TO_ENTRY_CONN(conn);
1351 smartlist_t *resolved_addresses = NULL;
1352 int errcode = 0;
1353
1354 if (conn->base_.state != AP_CONN_STATE_RESOLVE_WAIT) {
1355 log_fn(LOG_PROTOCOL_WARN, LD_APP, "Got a 'resolved' cell while "
1356 "not in state resolve_wait. Dropping.");
1357 return 0;
1358 }
1359 tor_assert(SOCKS_COMMAND_IS_RESOLVE(entry_conn->socks_request->command));
1360
1361 resolved_addresses = smartlist_new();
1362 if (resolved_cell_parse(cell, rh, resolved_addresses, &errcode)) {
1363 log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
1364 "Dropping malformed 'resolved' cell");
1365 connection_mark_unattached_ap(entry_conn, END_STREAM_REASON_TORPROTOCOL);
1366 goto done;
1367 }
1368
1369 if (get_options()->ClientDNSRejectInternalAddresses) {
1370 int orig_len = smartlist_len(resolved_addresses);
1371 SMARTLIST_FOREACH_BEGIN(resolved_addresses, address_ttl_t *, addr) {
1372 if (addr->hostname == NULL && tor_addr_is_internal(&addr->addr, 0)) {
1373 log_info(LD_APP, "Got a resolved cell with answer %s; dropping that "
1374 "answer.",
1375 safe_str_client(fmt_addr(&addr->addr)));
1376 address_ttl_free(addr);
1377 SMARTLIST_DEL_CURRENT(resolved_addresses, addr);
1378 }
1379 } SMARTLIST_FOREACH_END(addr);
1380 if (orig_len && smartlist_len(resolved_addresses) == 0) {
1381 log_info(LD_APP, "Got a resolved cell with only private addresses; "
1382 "dropping it.");
1384 RESOLVED_TYPE_ERROR_TRANSIENT,
1385 0, NULL, 0, TIME_MAX);
1386 connection_mark_unattached_ap(entry_conn,
1387 END_STREAM_REASON_TORPROTOCOL);
1388 goto done;
1389 }
1390 }
1391
1392 /* This is valid data at this point. Count it */
1393 if (conn->on_circuit && CIRCUIT_IS_ORIGIN(conn->on_circuit)) {
1395 rh->length);
1396 }
1397
1399 errcode,
1400 resolved_addresses);
1401
1402 connection_mark_unattached_ap(entry_conn,
1403 END_STREAM_REASON_DONE |
1405
1406 done:
1407 SMARTLIST_FOREACH(resolved_addresses, address_ttl_t *, addr,
1408 address_ttl_free(addr));
1409 smartlist_free(resolved_addresses);
1410 return 0;
1411}
1412
1413/** An incoming relay cell has arrived from circuit <b>circ</b> to
1414 * stream <b>conn</b>.
1415 *
1416 * The arguments here are the same as in
1417 * connection_edge_process_relay_cell() below; this function is called
1418 * from there when <b>conn</b> is defined and not in an open state.
1419 */
1420static int
1422 relay_header_t *rh, cell_t *cell, circuit_t *circ,
1423 edge_connection_t *conn, crypt_path_t *layer_hint)
1424{
1425 if (rh->command == RELAY_COMMAND_END) {
1426 if (CIRCUIT_IS_ORIGIN(circ) && conn->base_.type == CONN_TYPE_AP) {
1427 return connection_ap_process_end_not_open(rh, cell,
1428 TO_ORIGIN_CIRCUIT(circ),
1429 EDGE_TO_ENTRY_CONN(conn),
1430 layer_hint);
1431 } else {
1432 /* we just got an 'end', don't need to send one */
1433 conn->edge_has_sent_end = 1;
1434 conn->end_reason = *(cell->payload+RELAY_HEADER_SIZE) |
1436 connection_mark_for_close(TO_CONN(conn));
1437 return 0;
1438 }
1439 }
1440
1441 if (conn->base_.type == CONN_TYPE_AP &&
1442 rh->command == RELAY_COMMAND_CONNECTED) {
1443 tor_addr_t addr;
1444 int ttl;
1445 entry_connection_t *entry_conn = EDGE_TO_ENTRY_CONN(conn);
1447 if (conn->base_.state != AP_CONN_STATE_CONNECT_WAIT) {
1448 log_fn(LOG_PROTOCOL_WARN, LD_APP,
1449 "Got 'connected' while not in state connect_wait. Dropping.");
1450 return 0;
1451 }
1452 CONNECTION_AP_EXPECT_NONPENDING(entry_conn);
1453 conn->base_.state = AP_CONN_STATE_OPEN;
1454 log_info(LD_APP,"'connected' received for circid %u streamid %d "
1455 "after %d seconds.",
1456 (unsigned)circ->n_circ_id,
1457 rh->stream_id,
1458 (int)(time(NULL) - conn->base_.timestamp_last_read_allowed));
1459 if (connected_cell_parse(rh, cell, &addr, &ttl) < 0) {
1460 log_fn(LOG_PROTOCOL_WARN, LD_APP,
1461 "Got a badly formatted connected cell. Closing.");
1462 connection_edge_end(conn, END_STREAM_REASON_TORPROTOCOL);
1463 connection_mark_unattached_ap(entry_conn, END_STREAM_REASON_TORPROTOCOL);
1464 return 0;
1465 }
1466 if (tor_addr_family(&addr) != AF_UNSPEC) {
1467 /* The family is not UNSPEC: so we were given an address in the
1468 * connected cell. (This is normal, except for BEGINDIR and onion
1469 * service streams.) */
1470 const sa_family_t family = tor_addr_family(&addr);
1471 if (tor_addr_is_null(&addr) ||
1472 (get_options()->ClientDNSRejectInternalAddresses &&
1473 tor_addr_is_internal(&addr, 0))) {
1474 log_info(LD_APP, "...but it claims the IP address was %s. Closing.",
1475 safe_str(fmt_addr(&addr)));
1476 connection_edge_end(conn, END_STREAM_REASON_TORPROTOCOL);
1477 connection_mark_unattached_ap(entry_conn,
1478 END_STREAM_REASON_TORPROTOCOL);
1479 return 0;
1480 }
1481
1482 if ((family == AF_INET && ! entry_conn->entry_cfg.ipv4_traffic) ||
1483 (family == AF_INET6 && ! entry_conn->entry_cfg.ipv6_traffic)) {
1484 log_fn(LOG_PROTOCOL_WARN, LD_APP,
1485 "Got a connected cell to %s with unsupported address family."
1486 " Closing.", safe_str(fmt_addr(&addr)));
1487 connection_edge_end(conn, END_STREAM_REASON_TORPROTOCOL);
1488 connection_mark_unattached_ap(entry_conn,
1489 END_STREAM_REASON_TORPROTOCOL);
1490 return 0;
1491 }
1492
1493 client_dns_set_addressmap(entry_conn,
1494 entry_conn->socks_request->address, &addr,
1495 entry_conn->chosen_exit_name, ttl);
1496
1497 remap_event_helper(entry_conn, &addr);
1498 }
1500 /* don't send a socks reply to transparent conns */
1501 tor_assert(entry_conn->socks_request != NULL);
1502 if (!entry_conn->socks_request->has_finished) {
1503 connection_ap_handshake_socks_reply(entry_conn, NULL, 0, 0);
1504 }
1505
1506 /* Was it a linked dir conn? If so, a dir request just started to
1507 * fetch something; this could be a bootstrap status milestone. */
1508 log_debug(LD_APP, "considering");
1509 if (TO_CONN(conn)->linked_conn &&
1510 TO_CONN(conn)->linked_conn->type == CONN_TYPE_DIR) {
1511 connection_t *dirconn = TO_CONN(conn)->linked_conn;
1512 log_debug(LD_APP, "it is! %d", dirconn->purpose);
1513 switch (dirconn->purpose) {
1516 control_event_bootstrap(BOOTSTRAP_STATUS_LOADING_KEYS, 0);
1517 break;
1519 control_event_bootstrap(BOOTSTRAP_STATUS_LOADING_STATUS, 0);
1520 break;
1523 if (TO_DIR_CONN(dirconn)->router_purpose == ROUTER_PURPOSE_GENERAL)
1524 control_event_boot_dir(BOOTSTRAP_STATUS_LOADING_DESCRIPTORS,
1526 break;
1527 }
1528 }
1529 /* This is definitely a success, so forget about any pending data we
1530 * had sent. */
1531 if (entry_conn->pending_optimistic_data) {
1532 buf_free(entry_conn->pending_optimistic_data);
1533 entry_conn->pending_optimistic_data = NULL;
1534 }
1535
1536 /* This is valid data at this point. Count it */
1538
1539 /* handle anything that might have queued */
1540 if (connection_edge_package_raw_inbuf(conn, 1, NULL) < 0) {
1541 /* (We already sent an end cell if possible) */
1542 connection_mark_for_close(TO_CONN(conn));
1543 return 0;
1544 }
1545 return 0;
1546 }
1547 if (conn->base_.type == CONN_TYPE_AP &&
1548 rh->command == RELAY_COMMAND_RESOLVED) {
1549 return connection_edge_process_resolved_cell(conn, cell, rh);
1550 }
1551
1552 log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
1553 "Got an unexpected relay command %d, in state %d (%s). Dropping.",
1554 rh->command, conn->base_.state,
1555 conn_state_to_string(conn->base_.type, conn->base_.state));
1556 return 0; /* for forward compatibility, don't kill the circuit */
1557// connection_edge_end(conn, END_STREAM_REASON_TORPROTOCOL);
1558// connection_mark_for_close(conn);
1559// return -1;
1560}
1561
1562/** Process a SENDME cell that arrived on <b>circ</b>. If it is a stream level
1563 * cell, it is destined for the given <b>conn</b>. If it is a circuit level
1564 * cell, it is destined for the <b>layer_hint</b>. The <b>domain</b> is the
1565 * logging domain that should be used.
1566 *
1567 * Return 0 if everything went well or a negative value representing a circuit
1568 * end reason on error for which the caller is responsible for closing it. */
1569static int
1571 circuit_t *circ, edge_connection_t *conn,
1572 crypt_path_t *layer_hint, int domain)
1573{
1574 int ret;
1575
1576 tor_assert(rh);
1577
1578 if (!rh->stream_id) {
1579 /* Circuit level SENDME cell. */
1580 ret = sendme_process_circuit_level(layer_hint, circ,
1581 cell->payload + RELAY_HEADER_SIZE,
1582 rh->length);
1583 if (ret < 0) {
1584 return ret;
1585 }
1586 /* Resume reading on any streams now that we've processed a valid
1587 * SENDME cell that updated our package window. */
1588 circuit_resume_edge_reading(circ, layer_hint);
1589 /* We are done, the rest of the code is for the stream level. */
1590 return 0;
1591 }
1592
1593 /* No connection, might be half edge state. We are done if so. */
1594 if (!conn) {
1595 if (CIRCUIT_IS_ORIGIN(circ)) {
1596 origin_circuit_t *ocirc = TO_ORIGIN_CIRCUIT(circ);
1598 rh->stream_id)) {
1599 circuit_read_valid_data(ocirc, rh->length);
1600 log_info(domain, "Sendme cell on circ %u valid on half-closed "
1601 "stream id %d",
1602 ocirc->global_identifier, rh->stream_id);
1603 }
1604 }
1605
1606 log_info(domain, "SENDME cell dropped, unknown stream (streamid %d).",
1607 rh->stream_id);
1608 return 0;
1609 }
1610
1611 /* Stream level SENDME cell. */
1612 // TODO: Turn this off for cc_alg=1,2,3; use XON/XOFF instead
1613 ret = sendme_process_stream_level(conn, circ, rh->length);
1614 if (ret < 0) {
1615 /* Means we need to close the circuit with reason ret. */
1616 return ret;
1617 }
1618
1619 /* We've now processed properly a SENDME cell, all windows have been
1620 * properly updated, we'll read on the edge connection to see if we can
1621 * get data out towards the end point (Exit or client) since we are now
1622 * allowed to deliver more cells. */
1623
1625 /* Still waiting for queue to flush; don't touch conn */
1626 return 0;
1627 }
1629 /* handle whatever might still be on the inbuf */
1630 if (connection_edge_package_raw_inbuf(conn, 1, NULL) < 0) {
1631 /* (We already sent an end cell if possible) */
1632 connection_mark_for_close(TO_CONN(conn));
1633 return 0;
1634 }
1635 return 0;
1636}
1637
1638/** A helper for connection_edge_process_relay_cell(): Actually handles the
1639 * cell that we received on the connection.
1640 *
1641 * The arguments are the same as in the parent function
1642 * connection_edge_process_relay_cell(), plus the relay header <b>rh</b> as
1643 * unpacked by the parent function, and <b>optimistic_data</b> as set by the
1644 * parent function.
1645 */
1646STATIC int
1648 edge_connection_t *conn, crypt_path_t *layer_hint,
1649 relay_header_t *rh, int optimistic_data)
1650{
1651 unsigned domain = layer_hint?LD_APP:LD_EXIT;
1652 int reason;
1653
1654 tor_assert(rh);
1655
1656 /* First pass the cell to the circuit padding subsystem, in case it's a
1657 * padding cell or circuit that should be handled there. */
1658 if (circpad_check_received_cell(cell, circ, layer_hint, rh) == 0) {
1659 log_debug(domain, "Cell handled as circuit padding");
1660 return 0;
1661 }
1662
1663 /* Now handle all the other commands */
1664 switch (rh->command) {
1665 case RELAY_COMMAND_CONFLUX_LINK:
1666 conflux_process_link(circ, cell, rh->length);
1667 return 0;
1668 case RELAY_COMMAND_CONFLUX_LINKED:
1669 conflux_process_linked(circ, layer_hint, cell, rh->length);
1670 return 0;
1671 case RELAY_COMMAND_CONFLUX_LINKED_ACK:
1673 return 0;
1674 case RELAY_COMMAND_CONFLUX_SWITCH:
1675 return conflux_process_switch_command(circ, layer_hint, cell, rh);
1676 case RELAY_COMMAND_BEGIN:
1677 case RELAY_COMMAND_BEGIN_DIR:
1678 if (layer_hint &&
1680 log_fn(LOG_PROTOCOL_WARN, LD_APP,
1681 "Relay begin request unsupported at AP. Dropping.");
1682 return 0;
1683 }
1685 layer_hint != TO_ORIGIN_CIRCUIT(circ)->cpath->prev) {
1686 log_fn(LOG_PROTOCOL_WARN, LD_APP,
1687 "Relay begin request to Hidden Service "
1688 "from intermediary node. Dropping.");
1689 return 0;
1690 }
1691 if (conn) {
1692 log_fn(LOG_PROTOCOL_WARN, domain,
1693 "Begin cell for known stream. Dropping.");
1694 return 0;
1695 }
1696 if (rh->command == RELAY_COMMAND_BEGIN_DIR &&
1698 /* Assign this circuit and its app-ward OR connection a unique ID,
1699 * so that we can measure download times. The local edge and dir
1700 * connection will be assigned the same ID when they are created
1701 * and linked. */
1702 static uint64_t next_id = 0;
1703 circ->dirreq_id = ++next_id;
1704 TO_OR_CIRCUIT(circ)->p_chan->dirreq_id = circ->dirreq_id;
1705 }
1706 return connection_exit_begin_conn(cell, circ);
1707 case RELAY_COMMAND_DATA:
1709
1710 if (rh->stream_id == 0) {
1711 log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL, "Relay data cell with zero "
1712 "stream_id. Dropping.");
1713 return 0;
1714 } else if (!conn) {
1715 if (CIRCUIT_IS_ORIGIN(circ)) {
1716 origin_circuit_t *ocirc = TO_ORIGIN_CIRCUIT(circ);
1718 rh->stream_id)) {
1719 circuit_read_valid_data(ocirc, rh->length);
1720 log_info(domain,
1721 "data cell on circ %u valid on half-closed "
1722 "stream id %d", ocirc->global_identifier, rh->stream_id);
1723 }
1724 }
1725
1726 log_info(domain,"data cell dropped, unknown stream (streamid %d).",
1727 rh->stream_id);
1728 return 0;
1729 }
1730
1731 /* Update our stream-level deliver window that we just received a DATA
1732 * cell. Going below 0 means we have a protocol level error so the
1733 * stream and circuit are closed. */
1734 if (sendme_stream_data_received(conn) < 0) {
1735 log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
1736 "(relay data) conn deliver_window below 0. Killing.");
1737 connection_edge_end_close(conn, END_STREAM_REASON_TORPROTOCOL);
1738 return -END_CIRC_REASON_TORPROTOCOL;
1739 }
1740 /* Total all valid application bytes delivered */
1741 if (CIRCUIT_IS_ORIGIN(circ) && rh->length > 0) {
1743 }
1744
1745 /* For onion service connection, update the metrics. */
1746 if (conn->hs_ident) {
1747 hs_metrics_app_write_bytes(&conn->hs_ident->identity_pk,
1748 conn->hs_ident->orig_virtual_port,
1749 rh->length);
1750 }
1751
1753 connection_buf_add((char*)(cell->payload + RELAY_HEADER_SIZE),
1754 rh->length, TO_CONN(conn));
1755
1756#ifdef MEASUREMENTS_21206
1757 /* Count number of RELAY_DATA cells received on a linked directory
1758 * connection. */
1759 connection_t *linked_conn = TO_CONN(conn)->linked_conn;
1760
1761 if (linked_conn && linked_conn->type == CONN_TYPE_DIR) {
1762 ++(TO_DIR_CONN(linked_conn)->data_cells_received);
1763 }
1764#endif /* defined(MEASUREMENTS_21206) */
1765
1766 if (!optimistic_data) {
1767 /* Only send a SENDME if we're not getting optimistic data; otherwise
1768 * a SENDME could arrive before the CONNECTED.
1769 */
1771 }
1772
1773 return 0;
1774 case RELAY_COMMAND_XOFF:
1775 if (!conn) {
1776 if (CIRCUIT_IS_ORIGIN(circ)) {
1777 origin_circuit_t *ocirc = TO_ORIGIN_CIRCUIT(circ);
1778 if (relay_crypt_from_last_hop(ocirc, layer_hint) &&
1780 rh->stream_id)) {
1781 circuit_read_valid_data(ocirc, rh->length);
1782 }
1783 }
1784 return 0;
1785 }
1786
1787 if (circuit_process_stream_xoff(conn, layer_hint, cell)) {
1788 if (CIRCUIT_IS_ORIGIN(circ)) {
1790 }
1791 }
1792 return 0;
1793 case RELAY_COMMAND_XON:
1794 if (!conn) {
1795 if (CIRCUIT_IS_ORIGIN(circ)) {
1796 origin_circuit_t *ocirc = TO_ORIGIN_CIRCUIT(circ);
1797 if (relay_crypt_from_last_hop(ocirc, layer_hint) &&
1799 rh->stream_id)) {
1800 circuit_read_valid_data(ocirc, rh->length);
1801 }
1802 }
1803 return 0;
1804 }
1805
1806 if (circuit_process_stream_xon(conn, layer_hint, cell)) {
1807 if (CIRCUIT_IS_ORIGIN(circ)) {
1809 }
1810 }
1811 return 0;
1812 case RELAY_COMMAND_END:
1813 reason = rh->length > 0 ?
1814 get_uint8(cell->payload+RELAY_HEADER_SIZE) : END_STREAM_REASON_MISC;
1815 if (!conn) {
1816 if (CIRCUIT_IS_ORIGIN(circ)) {
1817 origin_circuit_t *ocirc = TO_ORIGIN_CIRCUIT(circ);
1818 if (relay_crypt_from_last_hop(ocirc, layer_hint) &&
1820 rh->stream_id)) {
1821
1822 circuit_read_valid_data(ocirc, rh->length);
1823 log_info(domain,
1824 "end cell (%s) on circ %u valid on half-closed "
1825 "stream id %d",
1827 ocirc->global_identifier, rh->stream_id);
1828 return 0;
1829 }
1830 }
1831 log_info(domain,"end cell (%s) dropped, unknown stream.",
1833 return 0;
1834 }
1835/* XXX add to this log_fn the exit node's nickname? */
1836 log_info(domain,TOR_SOCKET_T_FORMAT": end cell (%s) for stream %d. "
1837 "Removing stream.",
1838 conn->base_.s,
1840 conn->stream_id);
1841 if (conn->base_.type == CONN_TYPE_AP) {
1842 entry_connection_t *entry_conn = EDGE_TO_ENTRY_CONN(conn);
1843 if (entry_conn->socks_request &&
1844 !entry_conn->socks_request->has_finished)
1845 log_warn(LD_BUG,
1846 "open stream hasn't sent socks answer yet? Closing.");
1847 }
1848 /* We just *got* an end; no reason to send one. */
1849 conn->edge_has_sent_end = 1;
1850 if (!conn->end_reason)
1852 if (!conn->base_.marked_for_close) {
1853 /* only mark it if not already marked. it's possible to
1854 * get the 'end' right around when the client hangs up on us. */
1855 connection_mark_and_flush(TO_CONN(conn));
1856
1857 /* Total all valid application bytes delivered */
1858 if (CIRCUIT_IS_ORIGIN(circ)) {
1860 }
1861 }
1862 return 0;
1863 case RELAY_COMMAND_EXTEND:
1864 case RELAY_COMMAND_EXTEND2: {
1865 static uint64_t total_n_extend=0, total_nonearly=0;
1866 total_n_extend++;
1867 if (rh->stream_id) {
1868 log_fn(LOG_PROTOCOL_WARN, domain,
1869 "'extend' cell received for non-zero stream. Dropping.");
1870 return 0;
1871 }
1872 if (cell->command != CELL_RELAY_EARLY &&
1873 !networkstatus_get_param(NULL,"AllowNonearlyExtend",0,0,1)) {
1874#define EARLY_WARNING_INTERVAL 3600
1875 static ratelim_t early_warning_limit =
1876 RATELIM_INIT(EARLY_WARNING_INTERVAL);
1877 char *m;
1878 if (cell->command == CELL_RELAY) {
1879 ++total_nonearly;
1880 if ((m = rate_limit_log(&early_warning_limit, approx_time()))) {
1881 double percentage = ((double)total_nonearly)/total_n_extend;
1882 percentage *= 100;
1883 log_fn(LOG_PROTOCOL_WARN, domain, "EXTEND cell received, "
1884 "but not via RELAY_EARLY. Dropping.%s", m);
1885 log_fn(LOG_PROTOCOL_WARN, domain, " (We have dropped %.02f%% of "
1886 "all EXTEND cells for this reason)", percentage);
1887 tor_free(m);
1888 }
1889 } else {
1890 log_fn(LOG_WARN, domain,
1891 "EXTEND cell received, in a cell with type %d! Dropping.",
1892 cell->command);
1893 }
1894 return 0;
1895 }
1896 return circuit_extend(cell, circ);
1897 }
1898 case RELAY_COMMAND_EXTENDED:
1899 case RELAY_COMMAND_EXTENDED2:
1900 if (!layer_hint) {
1901 log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
1902 "'extended' unsupported at non-origin. Dropping.");
1903 return 0;
1904 }
1905 log_debug(domain,"Got an extended cell! Yay.");
1906 {
1907 extended_cell_t extended_cell;
1908 if (extended_cell_parse(&extended_cell, rh->command,
1909 (const uint8_t*)cell->payload+RELAY_HEADER_SIZE,
1910 rh->length)<0) {
1911 log_warn(LD_PROTOCOL,
1912 "Can't parse EXTENDED cell; killing circuit.");
1913 return -END_CIRC_REASON_TORPROTOCOL;
1914 }
1915 if ((reason = circuit_finish_handshake(TO_ORIGIN_CIRCUIT(circ),
1916 &extended_cell.created_cell)) < 0) {
1917 circuit_mark_for_close(circ, -reason);
1918 return 0; /* We don't want to cause a warning, so we mark the circuit
1919 * here. */
1920 }
1921 }
1922 if ((reason=circuit_send_next_onion_skin(TO_ORIGIN_CIRCUIT(circ)))<0) {
1923 log_info(domain,"circuit_send_next_onion_skin() failed.");
1924 return reason;
1925 }
1926 /* Total all valid bytes delivered. */
1927 if (CIRCUIT_IS_ORIGIN(circ)) {
1929 }
1930 return 0;
1931 case RELAY_COMMAND_TRUNCATE:
1932 if (layer_hint) {
1933 log_fn(LOG_PROTOCOL_WARN, LD_APP,
1934 "'truncate' unsupported at origin. Dropping.");
1935 return 0;
1936 }
1937 if (circ->n_hop) {
1938 if (circ->n_chan)
1939 log_warn(LD_BUG, "n_chan and n_hop set on the same circuit!");
1940 extend_info_free(circ->n_hop);
1941 circ->n_hop = NULL;
1944 }
1945 if (circ->n_chan) {
1946 uint8_t trunc_reason = get_uint8(cell->payload + RELAY_HEADER_SIZE);
1947 circuit_synchronize_written_or_bandwidth(circ, CIRCUIT_N_CHAN);
1948 circuit_clear_cell_queue(circ, circ->n_chan);
1950 trunc_reason);
1951 circuit_set_n_circid_chan(circ, 0, NULL);
1952 }
1953 log_debug(LD_EXIT, "Processed 'truncate', replying.");
1954 {
1955 char payload[1];
1956 payload[0] = (char)END_CIRC_REASON_REQUESTED;
1957 relay_send_command_from_edge(0, circ, RELAY_COMMAND_TRUNCATED,
1958 payload, sizeof(payload), NULL);
1959 }
1960 return 0;
1961 case RELAY_COMMAND_TRUNCATED:
1962 if (!layer_hint) {
1963 log_fn(LOG_PROTOCOL_WARN, LD_EXIT,
1964 "'truncated' unsupported at non-origin. Dropping.");
1965 return 0;
1966 }
1967
1968 /* Count the truncated as valid, for completeness. The
1969 * circuit is being torn down anyway, though. */
1970 if (CIRCUIT_IS_ORIGIN(circ)) {
1972 rh->length);
1973 }
1976 return 0;
1977 case RELAY_COMMAND_CONNECTED:
1978 if (conn) {
1979 log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
1980 "'connected' unsupported while open. Closing circ.");
1981 return -END_CIRC_REASON_TORPROTOCOL;
1982 }
1983
1984 if (CIRCUIT_IS_ORIGIN(circ)) {
1985 origin_circuit_t *ocirc = TO_ORIGIN_CIRCUIT(circ);
1987 rh->stream_id)) {
1988 circuit_read_valid_data(ocirc, rh->length);
1989 log_info(domain,
1990 "connected cell on circ %u valid on half-closed "
1991 "stream id %d", ocirc->global_identifier, rh->stream_id);
1992 return 0;
1993 }
1994 }
1995
1996 log_info(domain,
1997 "'connected' received on circid %u for streamid %d, "
1998 "no conn attached anymore. Ignoring.",
1999 (unsigned)circ->n_circ_id, rh->stream_id);
2000 return 0;
2001 case RELAY_COMMAND_SENDME:
2002 return process_sendme_cell(rh, cell, circ, conn, layer_hint, domain);
2003 case RELAY_COMMAND_RESOLVE:
2004 if (layer_hint) {
2005 log_fn(LOG_PROTOCOL_WARN, LD_APP,
2006 "resolve request unsupported at AP; dropping.");
2007 return 0;
2008 } else if (conn) {
2009 log_fn(LOG_PROTOCOL_WARN, domain,
2010 "resolve request for known stream; dropping.");
2011 return 0;
2012 } else if (circ->purpose != CIRCUIT_PURPOSE_OR) {
2013 log_fn(LOG_PROTOCOL_WARN, domain,
2014 "resolve request on circ with purpose %d; dropping",
2015 circ->purpose);
2016 return 0;
2017 }
2018 return connection_exit_begin_resolve(cell, TO_OR_CIRCUIT(circ));
2019 case RELAY_COMMAND_RESOLVED:
2020 if (conn) {
2021 log_fn(LOG_PROTOCOL_WARN, domain,
2022 "'resolved' unsupported while open. Closing circ.");
2023 return -END_CIRC_REASON_TORPROTOCOL;
2024 }
2025
2026 if (CIRCUIT_IS_ORIGIN(circ)) {
2027 origin_circuit_t *ocirc = TO_ORIGIN_CIRCUIT(circ);
2028 if (relay_crypt_from_last_hop(ocirc, layer_hint) &&
2030 rh->stream_id)) {
2031 circuit_read_valid_data(ocirc, rh->length);
2032 log_info(domain,
2033 "resolved cell on circ %u valid on half-closed "
2034 "stream id %d", ocirc->global_identifier, rh->stream_id);
2035 return 0;
2036 }
2037 }
2038
2039 log_info(domain,
2040 "'resolved' received, no conn attached anymore. Ignoring.");
2041 return 0;
2042 case RELAY_COMMAND_ESTABLISH_INTRO:
2043 case RELAY_COMMAND_ESTABLISH_RENDEZVOUS:
2044 case RELAY_COMMAND_INTRODUCE1:
2045 case RELAY_COMMAND_INTRODUCE2:
2046 case RELAY_COMMAND_INTRODUCE_ACK:
2047 case RELAY_COMMAND_RENDEZVOUS1:
2048 case RELAY_COMMAND_RENDEZVOUS2:
2049 case RELAY_COMMAND_INTRO_ESTABLISHED:
2050 case RELAY_COMMAND_RENDEZVOUS_ESTABLISHED:
2051 rend_process_relay_cell(circ, layer_hint,
2052 rh->command, rh->length,
2054 return 0;
2055 }
2056 log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
2057 "Received unknown relay command %d. Perhaps the other side is using "
2058 "a newer version of Tor? Dropping.",
2059 rh->command);
2060 return 0; /* for forward compatibility, don't kill the circuit */
2061}
2062
2063/** An incoming relay cell has arrived on circuit <b>circ</b>. If
2064 * <b>conn</b> is NULL this is a control cell, else <b>cell</b> is
2065 * destined for <b>conn</b>.
2066 *
2067 * If <b>layer_hint</b> is defined, then we're the origin of the
2068 * circuit, and it specifies the hop that packaged <b>cell</b>.
2069 *
2070 * Return -reason if you want to warn and tear down the circuit, else 0.
2071 */
2072STATIC int
2074 edge_connection_t *conn,
2075 crypt_path_t *layer_hint)
2076{
2077 static int num_seen=0;
2078 relay_header_t rh;
2079 unsigned domain = layer_hint?LD_APP:LD_EXIT;
2080
2081 tor_assert(cell);
2082 tor_assert(circ);
2083
2084 relay_header_unpack(&rh, cell->payload);
2085// log_fn(LOG_DEBUG,"command %d stream %d", rh.command, rh.stream_id);
2086 num_seen++;
2087 log_debug(domain, "Now seen %d relay cells here (command %d, stream %d).",
2088 num_seen, rh.command, rh.stream_id);
2089
2090 if (rh.length > RELAY_PAYLOAD_SIZE) {
2091 log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
2092 "Relay cell length field too long. Closing circuit.");
2093 return - END_CIRC_REASON_TORPROTOCOL;
2094 }
2095
2096 if (rh.stream_id == 0) {
2097 switch (rh.command) {
2098 case RELAY_COMMAND_BEGIN:
2099 case RELAY_COMMAND_CONNECTED:
2100 case RELAY_COMMAND_END:
2101 case RELAY_COMMAND_RESOLVE:
2102 case RELAY_COMMAND_RESOLVED:
2103 case RELAY_COMMAND_BEGIN_DIR:
2104 log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL, "Relay command %d with zero "
2105 "stream_id. Dropping.", (int)rh.command);
2106 return 0;
2107 default:
2108 ;
2109 }
2110 }
2111
2112 /* Regardless of conflux or not, we always decide to send a SENDME
2113 * for RELAY_DATA immediately
2114 */
2115 if (rh.command == RELAY_COMMAND_DATA) {
2116 /* Update our circuit-level deliver window that we received a DATA cell.
2117 * If the deliver window goes below 0, we end the circuit and stream due
2118 * to a protocol failure. */
2119 if (sendme_circuit_data_received(circ, layer_hint) < 0) {
2120 log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
2121 "(relay data) circ deliver_window below 0. Killing.");
2122 connection_edge_end_close(conn, END_STREAM_REASON_TORPROTOCOL);
2123 return -END_CIRC_REASON_TORPROTOCOL;
2124 }
2125
2126 /* Consider sending a circuit-level SENDME cell. */
2127 sendme_circuit_consider_sending(circ, layer_hint);
2128
2129 /* Continue on to process the data cell via conflux or not */
2130 }
2131
2132 /* Conflux handling: If conflux is disabled, or the relay command is not
2133 * multiplexed across circuits, then process it immediately.
2134 *
2135 * Otherwise, we need to process the relay cell against our conflux
2136 * queues, and if doing so results in ordered cells to deliver, we
2137 * dequeue and process those in-order until there are no more.
2138 */
2139 if (!circ->conflux || !conflux_should_multiplex(rh.command)) {
2140 return connection_edge_process_ordered_relay_cell(cell, circ, conn,
2141 layer_hint, &rh);
2142 } else {
2143 // If conflux says this cell is in-order, then begin processing
2144 // cells from queue until there are none. Otherwise, we do nothing
2145 // until further cells arrive.
2146 if (conflux_process_cell(circ->conflux, circ, layer_hint, cell)) {
2147 conflux_cell_t *c_cell = NULL;
2148 int ret = 0;
2149
2150 /* First, process this cell */
2151 if ((ret = connection_edge_process_ordered_relay_cell(cell, circ, conn,
2152 layer_hint, &rh)) < 0) {
2153 return ret;
2154 }
2155
2156 /* Now, check queue for more */
2157 while ((c_cell = conflux_dequeue_cell(circ->conflux))) {
2158 relay_header_unpack(&rh, c_cell->cell.payload);
2159 conn = relay_lookup_conn(circ, &c_cell->cell, CELL_DIRECTION_OUT,
2160 layer_hint);
2162 circ, conn, layer_hint,
2163 &rh)) < 0) {
2164 /* Negative return value is a fatal error. Return early and tear down
2165 * circuit */
2166 tor_free(c_cell);
2167 return ret;
2168 }
2169 tor_free(c_cell);
2170 }
2171 }
2172 }
2173
2174 return 0;
2175}
2176
2177/**
2178 * Helper function to process a relay cell that is in the proper order
2179 * for processing right now. */
2180static int
2182 edge_connection_t *conn,
2183 crypt_path_t *layer_hint,
2184 relay_header_t *rh)
2185{
2186 int optimistic_data = 0; /* Set to 1 if we receive data on a stream
2187 * that's in the EXIT_CONN_STATE_RESOLVING
2188 * or EXIT_CONN_STATE_CONNECTING states. */
2189
2190 /* Tell circpad that we've received a recognized cell */
2192
2193 /* either conn is NULL, in which case we've got a control cell, or else
2194 * conn points to the recognized stream. */
2195 if (conn && !connection_state_is_open(TO_CONN(conn))) {
2196 if (conn->base_.type == CONN_TYPE_EXIT &&
2197 (conn->base_.state == EXIT_CONN_STATE_CONNECTING ||
2198 conn->base_.state == EXIT_CONN_STATE_RESOLVING) &&
2199 rh->command == RELAY_COMMAND_DATA) {
2200 /* Allow DATA cells to be delivered to an exit node in state
2201 * EXIT_CONN_STATE_CONNECTING or EXIT_CONN_STATE_RESOLVING.
2202 * This speeds up HTTP, for example. */
2203 optimistic_data = 1;
2204 } else if (rh->stream_id == 0 && rh->command == RELAY_COMMAND_DATA) {
2205 log_warn(LD_BUG, "Somehow I had a connection that matched a "
2206 "data cell with stream ID 0.");
2207 } else {
2209 rh, cell, circ, conn, layer_hint);
2210 }
2211 }
2212
2213 return handle_relay_cell_command(cell, circ, conn, layer_hint,
2214 rh, optimistic_data);
2215}
2216
2217/** How many relay_data cells have we built, ever? */
2219/** How many bytes of data have we put in relay_data cells have we built,
2220 * ever? This would be RELAY_PAYLOAD_SIZE*stats_n_data_cells_packaged if
2221 * every relay cell we ever sent were completely full of data. */
2223/** How many relay_data cells have we received, ever? */
2225/** How many bytes of data have we received relay_data cells, ever? This would
2226 * be RELAY_PAYLOAD_SIZE*stats_n_data_cells_packaged if every relay cell we
2227 * ever received were completely full of data. */
2229
2230/**
2231 * Called when initializing a circuit, or when we have reached the end of the
2232 * window in which we need to send some randomness so that incoming sendme
2233 * cells will be unpredictable. Resets the flags and picks a new window.
2234 */
2235void
2237{
2239 // XXX: do we need to change this check for congestion control?
2242}
2243
2244/**
2245 * Any relay data payload containing fewer than this many real bytes is
2246 * considered to have enough randomness to.
2247 **/
2248#define RELAY_PAYLOAD_LENGTH_FOR_RANDOM_SENDMES \
2249 (RELAY_PAYLOAD_SIZE - CELL_PADDING_GAP - 16)
2250
2251/**
2252 * Helper. Return the number of bytes that should be put into a cell from a
2253 * given edge connection on which <b>n_available</b> bytes are available.
2254 */
2255STATIC size_t
2257 int package_partial,
2258 circuit_t *on_circuit)
2259{
2260 if (!n_available)
2261 return 0;
2262
2263 /* Do we need to force this payload to have space for randomness? */
2264 const bool force_random_bytes =
2265 (on_circuit->send_randomness_after_n_cells == 0) &&
2266 (! on_circuit->have_sent_sufficiently_random_cell);
2267
2268 /* At most how much would we like to send in this cell? */
2269 size_t target_length;
2270 if (force_random_bytes) {
2272 } else {
2273 target_length = RELAY_PAYLOAD_SIZE;
2274 }
2275
2276 /* Decide how many bytes we will actually put into this cell. */
2277 size_t package_length;
2278 if (n_available >= target_length) { /* A full payload is available. */
2279 package_length = target_length;
2280 } else { /* not a full payload available */
2281 if (package_partial)
2282 package_length = n_available; /* just take whatever's available now */
2283 else
2284 return 0; /* nothing to do until we have a full payload */
2285 }
2286
2287 /* If we reach this point, we will be definitely sending the cell. */
2288 tor_assert_nonfatal(package_length > 0);
2289
2290 if (package_length <= RELAY_PAYLOAD_LENGTH_FOR_RANDOM_SENDMES) {
2291 /* This cell will have enough randomness in the padding to make a future
2292 * sendme cell unpredictable. */
2293 on_circuit->have_sent_sufficiently_random_cell = 1;
2294 }
2295
2296 if (on_circuit->send_randomness_after_n_cells == 0) {
2297 /* Either this cell, or some previous cell, had enough padding to
2298 * ensure sendme unpredictability. */
2299 tor_assert_nonfatal(on_circuit->have_sent_sufficiently_random_cell);
2300 /* Pick a new interval in which we need to send randomness. */
2302 }
2303
2304 --on_circuit->send_randomness_after_n_cells;
2305
2306 return package_length;
2307}
2308
2309/** If <b>conn</b> has an entire relay payload of bytes on its inbuf (or
2310 * <b>package_partial</b> is true), and the appropriate package windows aren't
2311 * empty, grab a cell and send it down the circuit.
2312 *
2313 * If *<b>max_cells</b> is given, package no more than max_cells. Decrement
2314 * *<b>max_cells</b> by the number of cells packaged.
2315 *
2316 * Return -1 (and send a RELAY_COMMAND_END cell if necessary) if conn should
2317 * be marked for close, else return 0.
2318 */
2319int
2321 int *max_cells)
2322{
2323 size_t bytes_to_process, length;
2324 char payload[CELL_PAYLOAD_SIZE];
2325 circuit_t *circ;
2326 const unsigned domain = conn->base_.type == CONN_TYPE_AP ? LD_APP : LD_EXIT;
2327 int sending_from_optimistic = 0;
2328 entry_connection_t *entry_conn =
2329 conn->base_.type == CONN_TYPE_AP ? EDGE_TO_ENTRY_CONN(conn) : NULL;
2330 const int sending_optimistically =
2331 entry_conn &&
2332 conn->base_.type == CONN_TYPE_AP &&
2333 conn->base_.state != AP_CONN_STATE_OPEN;
2334 crypt_path_t *cpath_layer = conn->cpath_layer;
2335
2336 tor_assert(conn);
2337
2338 if (BUG(conn->base_.marked_for_close)) {
2339 log_warn(LD_BUG,
2340 "called on conn that's already marked for close at %s:%d.",
2341 conn->base_.marked_for_close_file, conn->base_.marked_for_close);
2342 return 0;
2343 }
2344
2345 if (max_cells && *max_cells <= 0)
2346 return 0;
2347
2348 repeat_connection_edge_package_raw_inbuf:
2349
2350 circ = circuit_get_by_edge_conn(conn);
2351 if (!circ) {
2352 log_info(domain,"conn has no circuit! Closing.");
2354 return -1;
2355 }
2356
2357 if (circuit_consider_stop_edge_reading(circ, cpath_layer))
2358 return 0;
2359
2360 if (conn->package_window <= 0) {
2361 log_info(domain,"called with package_window %d. Skipping.",
2362 conn->package_window);
2364 return 0;
2365 }
2366
2367 sending_from_optimistic = entry_conn &&
2368 entry_conn->sending_optimistic_data != NULL;
2369
2370 if (PREDICT_UNLIKELY(sending_from_optimistic)) {
2371 bytes_to_process = buf_datalen(entry_conn->sending_optimistic_data);
2372 if (PREDICT_UNLIKELY(!bytes_to_process)) {
2373 log_warn(LD_BUG, "sending_optimistic_data was non-NULL but empty");
2374 bytes_to_process = connection_get_inbuf_len(TO_CONN(conn));
2375 sending_from_optimistic = 0;
2376 }
2377 } else {
2378 bytes_to_process = connection_get_inbuf_len(TO_CONN(conn));
2379 }
2380
2381 length = connection_edge_get_inbuf_bytes_to_package(bytes_to_process,
2382 package_partial, circ);
2383 if (!length)
2384 return 0;
2385
2386 /* If we reach this point, we will definitely be packaging bytes into
2387 * a cell. */
2388
2391
2392 if (PREDICT_UNLIKELY(sending_from_optimistic)) {
2393 /* XXXX We could be more efficient here by sometimes packing
2394 * previously-sent optimistic data in the same cell with data
2395 * from the inbuf. */
2396 buf_get_bytes(entry_conn->sending_optimistic_data, payload, length);
2397 if (!buf_datalen(entry_conn->sending_optimistic_data)) {
2398 buf_free(entry_conn->sending_optimistic_data);
2399 entry_conn->sending_optimistic_data = NULL;
2400 }
2401 } else {
2402 connection_buf_get_bytes(payload, length, TO_CONN(conn));
2403 }
2404
2405 log_debug(domain,TOR_SOCKET_T_FORMAT": Packaging %d bytes (%d waiting).",
2406 conn->base_.s,
2407 (int)length, (int)connection_get_inbuf_len(TO_CONN(conn)));
2408
2409 if (sending_optimistically && !sending_from_optimistic) {
2410 /* This is new optimistic data; remember it in case we need to detach and
2411 retry */
2412 if (!entry_conn->pending_optimistic_data)
2413 entry_conn->pending_optimistic_data = buf_new();
2414 buf_add(entry_conn->pending_optimistic_data, payload, length);
2415 }
2416
2417 /* Send a data cell. This handles the circuit package window. */
2418 if (connection_edge_send_command(conn, RELAY_COMMAND_DATA,
2419 payload, length) < 0 ) {
2420 /* circuit got marked for close, don't continue, don't need to mark conn */
2421 return 0;
2422 }
2423
2424 /* Handle the stream-level SENDME package window. */
2425 if (sendme_note_stream_data_packaged(conn, length) < 0) {
2427 log_debug(domain,"conn->package_window reached 0.");
2428 circuit_consider_stop_edge_reading(circ, cpath_layer);
2429 return 0; /* don't process the inbuf any more */
2430 }
2431 log_debug(domain,"conn->package_window is now %d",conn->package_window);
2432
2433 if (max_cells) {
2434 *max_cells -= 1;
2435 if (*max_cells <= 0)
2436 return 0;
2437 }
2438
2439 /* handle more if there's more, or return 0 if there isn't */
2440 goto repeat_connection_edge_package_raw_inbuf;
2441}
2442
2443/** The circuit <b>circ</b> has received a circuit-level sendme
2444 * (on hop <b>layer_hint</b>, if we're the OP). Go through all the
2445 * attached streams and let them resume reading and packaging, if
2446 * their stream windows allow it.
2447 */
2448static void
2450{
2452 log_debug(layer_hint?LD_APP:LD_EXIT,"Too big queue, no resuming");
2453 return;
2454 }
2455
2456 /* If we have a conflux negotiated, and it still can't send on
2457 * any circuit, then do not resume sending. */
2458 if (circ->conflux && !conflux_can_send(circ->conflux)) {
2459 log_debug(layer_hint?LD_APP:LD_EXIT,
2460 "Conflux can't send, not resuming edges");
2461 return;
2462 }
2463
2464 log_debug(layer_hint?LD_APP:LD_EXIT,"resuming");
2465
2466 if (CIRCUIT_IS_ORIGIN(circ))
2468 circ, layer_hint);
2469 else
2471 circ, layer_hint);
2472}
2473
2474/** A helper function for circuit_resume_edge_reading() above.
2475 * The arguments are the same, except that <b>conn</b> is the head
2476 * of a linked list of edge streams that should each be considered.
2477 */
2478static int
2480 circuit_t *circ,
2481 crypt_path_t *layer_hint)
2482{
2483 edge_connection_t *conn;
2484 int n_packaging_streams, n_streams_left;
2485 int packaged_this_round;
2486 int cells_on_queue;
2487 int cells_per_conn;
2488 edge_connection_t *chosen_stream = NULL;
2489 int max_to_package;
2490
2491 if (first_conn == NULL) {
2492 /* Don't bother to try to do the rest of this if there are no connections
2493 * to resume. */
2494 return 0;
2495 }
2496
2497 /* Once we used to start listening on the streams in the order they
2498 * appeared in the linked list. That leads to starvation on the
2499 * streams that appeared later on the list, since the first streams
2500 * would always get to read first. Instead, we just pick a random
2501 * stream on the list, and enable reading for streams starting at that
2502 * point (and wrapping around as if the list were circular). It would
2503 * probably be better to actually remember which streams we've
2504 * serviced in the past, but this is simple and effective. */
2505
2506 /* Select a stream uniformly at random from the linked list. We
2507 * don't need cryptographic randomness here. */
2508 {
2509 int num_streams = 0;
2510 for (conn = first_conn; conn; conn = conn->next_stream) {
2511 num_streams++;
2512
2513 if (crypto_fast_rng_one_in_n(get_thread_fast_rng(), num_streams)) {
2514 chosen_stream = conn;
2515 }
2516 /* Invariant: chosen_stream has been chosen uniformly at random from
2517 * among the first num_streams streams on first_conn.
2518 *
2519 * (Note that we iterate over every stream on the circuit, so that after
2520 * we've considered the first stream, we've chosen it with P=1; and
2521 * after we consider the second stream, we've switched to it with P=1/2
2522 * and stayed with the first stream with P=1/2; and after we've
2523 * considered the third stream, we've switched to it with P=1/3 and
2524 * remained with one of the first two streams with P=(2/3), giving each
2525 * one P=(1/2)(2/3) )=(1/3).) */
2526 }
2527 }
2528
2529 /* Count how many non-marked streams there are that have anything on
2530 * their inbuf, and enable reading on all of the connections. */
2531 n_packaging_streams = 0;
2532 /* Activate reading starting from the chosen stream */
2533 for (conn=chosen_stream; conn; conn = conn->next_stream) {
2534 /* Start reading for the streams starting from here */
2535 if (conn->base_.marked_for_close || conn->package_window <= 0)
2536 continue;
2537
2538 if (edge_uses_cpath(conn, layer_hint)) {
2539 if (!conn->xoff_received) {
2541 }
2542
2543 if (connection_get_inbuf_len(TO_CONN(conn)) > 0)
2544 ++n_packaging_streams;
2545 }
2546 }
2547 /* Go back and do the ones we skipped, circular-style */
2548 for (conn = first_conn; conn != chosen_stream; conn = conn->next_stream) {
2549 if (conn->base_.marked_for_close || conn->package_window <= 0)
2550 continue;
2551
2552 if (edge_uses_cpath(conn, layer_hint)) {
2553 if (!conn->xoff_received) {
2555 }
2556
2557 if (connection_get_inbuf_len(TO_CONN(conn)) > 0)
2558 ++n_packaging_streams;
2559 }
2560 }
2561
2562 if (n_packaging_streams == 0) /* avoid divide-by-zero */
2563 return 0;
2564
2565 again:
2566
2567 /* If we're using conflux, the circuit we decide to send on may change
2568 * after we're sending. Get it again, and re-check package windows
2569 * for it */
2570 if (circ->conflux) {
2571 if (circuit_consider_stop_edge_reading(circ, layer_hint))
2572 return -1;
2573
2574 circ = conflux_decide_next_circ(circ->conflux);
2575
2576 /* Get the destination layer hint for this circuit */
2577 layer_hint = conflux_get_destination_hop(circ);
2578 }
2579
2580 /* How many cells do we have space for? It will be the minimum of
2581 * the number needed to exhaust the package window, and the minimum
2582 * needed to fill the cell queue. */
2583 max_to_package = congestion_control_get_package_window(circ, layer_hint);
2584 if (CIRCUIT_IS_ORIGIN(circ)) {
2585 cells_on_queue = circ->n_chan_cells.n;
2586 } else {
2587 or_circuit_t *or_circ = TO_OR_CIRCUIT(circ);
2588 cells_on_queue = or_circ->p_chan_cells.n;
2589 }
2590 if (cell_queue_highwatermark() - cells_on_queue < max_to_package)
2591 max_to_package = cell_queue_highwatermark() - cells_on_queue;
2592
2593 cells_per_conn = CEIL_DIV(max_to_package, n_packaging_streams);
2594
2595 packaged_this_round = 0;
2596 n_streams_left = 0;
2597
2598 /* Iterate over all connections. Package up to cells_per_conn cells on
2599 * each. Update packaged_this_round with the total number of cells
2600 * packaged, and n_streams_left with the number that still have data to
2601 * package.
2602 */
2603 for (conn=first_conn; conn; conn=conn->next_stream) {
2604 if (conn->base_.marked_for_close || conn->package_window <= 0)
2605 continue;
2606 if (edge_uses_cpath(conn, layer_hint)) {
2607 int n = cells_per_conn, r;
2608 /* handle whatever might still be on the inbuf */
2609 r = connection_edge_package_raw_inbuf(conn, 1, &n);
2610
2611 /* Note how many we packaged */
2612 packaged_this_round += (cells_per_conn-n);
2613
2614 if (r<0) {
2615 /* Problem while packaging. (We already sent an end cell if
2616 * possible) */
2617 connection_mark_for_close(TO_CONN(conn));
2618 continue;
2619 }
2620
2621 /* If there's still data to read, we'll be coming back to this stream. */
2622 if (connection_get_inbuf_len(TO_CONN(conn)))
2623 ++n_streams_left;
2624
2625 /* If the circuit won't accept any more data, return without looking
2626 * at any more of the streams. Any connections that should be stopped
2627 * have already been stopped by connection_edge_package_raw_inbuf. */
2628 if (circuit_consider_stop_edge_reading(circ, layer_hint))
2629 return -1;
2630 /* XXXX should we also stop immediately if we fill up the cell queue?
2631 * Probably. */
2632 }
2633 }
2634
2635 /* If we made progress, and we are willing to package more, and there are
2636 * any streams left that want to package stuff... try again!
2637 */
2638 if (packaged_this_round && packaged_this_round < max_to_package &&
2639 n_streams_left) {
2640 n_packaging_streams = n_streams_left;
2641 goto again;
2642 }
2643
2644 return 0;
2645}
2646
2647/** Check if the package window for <b>circ</b> is empty (at
2648 * hop <b>layer_hint</b> if it's defined).
2649 *
2650 * If yes, tell edge streams to stop reading and return 1.
2651 * Else return 0.
2652 */
2653static int
2655{
2656 edge_connection_t *conn = NULL;
2657 unsigned domain = layer_hint ? LD_APP : LD_EXIT;
2658
2659 if (!layer_hint) {
2660 or_circuit_t *or_circ = TO_OR_CIRCUIT(circ);
2661 log_debug(domain,"considering circ->package_window %d",
2662 circ->package_window);
2663 if (circuit_get_package_window(circ, layer_hint) <= 0) {
2664 log_debug(domain,"yes, not-at-origin. stopped.");
2665 for (conn = or_circ->n_streams; conn; conn=conn->next_stream)
2667 return 1;
2668 }
2669 return 0;
2670 }
2671 /* else, layer hint is defined, use it */
2672 log_debug(domain,"considering layer_hint->package_window %d",
2673 layer_hint->package_window);
2674 if (circuit_get_package_window(circ, layer_hint) <= 0) {
2675 log_debug(domain,"yes, at-origin. stopped.");
2676 for (conn = TO_ORIGIN_CIRCUIT(circ)->p_streams; conn;
2677 conn=conn->next_stream) {
2678 if (edge_uses_cpath(conn, layer_hint))
2680 }
2681 return 1;
2682 }
2683 return 0;
2684}
2685
2686/** The total number of cells we have allocated. */
2687static size_t total_cells_allocated = 0;
2688
2689/** Release storage held by <b>cell</b>. */
2690static inline void
2692{
2694 tor_free(cell);
2695}
2696
2697/** Allocate and return a new packed_cell_t. */
2700{
2702 return tor_malloc_zero(sizeof(packed_cell_t));
2703}
2704
2705/** Return a packed cell used outside by channel_t lower layer */
2706void
2708{
2709 if (!cell)
2710 return;
2712}
2713
2714/** Log current statistics for cell pool allocation at log level
2715 * <b>severity</b>. */
2716void
2718{
2719 int n_circs = 0;
2720 int n_cells = 0;
2722 n_cells += c->n_chan_cells.n;
2723 if (!CIRCUIT_IS_ORIGIN(c))
2724 n_cells += TO_OR_CIRCUIT(c)->p_chan_cells.n;
2725 ++n_circs;
2726 }
2727 SMARTLIST_FOREACH_END(c);
2728 tor_log(severity, LD_MM,
2729 "%d cells allocated on %d circuits. %d cells leaked.",
2730 n_cells, n_circs, (int)total_cells_allocated - n_cells);
2731}
2732
2733/** Allocate a new copy of packed <b>cell</b>. */
2734static inline packed_cell_t *
2735packed_cell_copy(const cell_t *cell, int wide_circ_ids)
2736{
2738 cell_pack(c, cell, wide_circ_ids);
2739 return c;
2740}
2741
2742/** Append <b>cell</b> to the end of <b>queue</b>. */
2743void
2745{
2746 TOR_SIMPLEQ_INSERT_TAIL(&queue->head, cell, next);
2747 ++queue->n;
2748}
2749
2750/** Append a newly allocated copy of <b>cell</b> to the end of the
2751 * <b>exitward</b> (or app-ward) <b>queue</b> of <b>circ</b>. If
2752 * <b>use_stats</b> is true, record statistics about the cell.
2753 */
2754void
2756 int exitward, const cell_t *cell,
2757 int wide_circ_ids, int use_stats)
2758{
2759 packed_cell_t *copy = packed_cell_copy(cell, wide_circ_ids);
2760 (void)circ;
2761 (void)exitward;
2762 (void)use_stats;
2763
2765
2766 cell_queue_append(queue, copy);
2767}
2768
2769/** Initialize <b>queue</b> as an empty cell queue. */
2770void
2772{
2773 memset(queue, 0, sizeof(cell_queue_t));
2774 TOR_SIMPLEQ_INIT(&queue->head);
2775}
2776
2777/** Remove and free every cell in <b>queue</b>. */
2778void
2780{
2781 packed_cell_t *cell;
2782 while ((cell = TOR_SIMPLEQ_FIRST(&queue->head))) {
2783 TOR_SIMPLEQ_REMOVE_HEAD(&queue->head, next);
2785 }
2786 TOR_SIMPLEQ_INIT(&queue->head);
2787 queue->n = 0;
2788}
2789
2790/** Extract and return the cell at the head of <b>queue</b>; return NULL if
2791 * <b>queue</b> is empty. */
2794{
2795 packed_cell_t *cell = TOR_SIMPLEQ_FIRST(&queue->head);
2796 if (!cell)
2797 return NULL;
2798 TOR_SIMPLEQ_REMOVE_HEAD(&queue->head, next);
2799 --queue->n;
2800 return cell;
2801}
2802
2803/** Initialize <b>queue</b> as an empty cell queue. */
2804void
2806{
2807 memset(queue, 0, sizeof(destroy_cell_queue_t));
2808 TOR_SIMPLEQ_INIT(&queue->head);
2809}
2810
2811/** Remove and free every cell in <b>queue</b>. */
2812void
2814{
2815 destroy_cell_t *cell;
2816 while ((cell = TOR_SIMPLEQ_FIRST(&queue->head))) {
2817 TOR_SIMPLEQ_REMOVE_HEAD(&queue->head, next);
2818 tor_free(cell);
2819 }
2820 TOR_SIMPLEQ_INIT(&queue->head);
2821 queue->n = 0;
2822}
2823
2824/** Extract and return the cell at the head of <b>queue</b>; return NULL if
2825 * <b>queue</b> is empty. */
2828{
2829 destroy_cell_t *cell = TOR_SIMPLEQ_FIRST(&queue->head);
2830 if (!cell)
2831 return NULL;
2832 TOR_SIMPLEQ_REMOVE_HEAD(&queue->head, next);
2833 --queue->n;
2834 return cell;
2835}
2836
2837/** Append a destroy cell for <b>circid</b> to <b>queue</b>. */
2838void
2840 circid_t circid,
2841 uint8_t reason)
2842{
2843 destroy_cell_t *cell = tor_malloc_zero(sizeof(destroy_cell_t));
2844 cell->circid = circid;
2845 cell->reason = reason;
2846 /* Not yet used, but will be required for OOM handling. */
2848
2849 TOR_SIMPLEQ_INSERT_TAIL(&queue->head, cell, next);
2850 ++queue->n;
2851}
2852
2853/** Convert a destroy_cell_t to a newly allocated cell_t. Frees its input. */
2854static packed_cell_t *
2856{
2857 packed_cell_t *packed = packed_cell_new();
2858 cell_t cell;
2859 memset(&cell, 0, sizeof(cell));
2860 cell.circ_id = inp->circid;
2861 cell.command = CELL_DESTROY;
2862 cell.payload[0] = inp->reason;
2863 cell_pack(packed, &cell, wide_circ_ids);
2864
2865 tor_free(inp);
2866 return packed;
2867}
2868
2869/** Return the total number of bytes used for each packed_cell in a queue.
2870 * Approximate. */
2871size_t
2873{
2874 return sizeof(packed_cell_t);
2875}
2876
2877/* DOCDOC */
2878size_t
2879cell_queues_get_total_allocation(void)
2880{
2882}
2883
2884/** How long after we've been low on memory should we try to conserve it? */
2885#define MEMORY_PRESSURE_INTERVAL (30*60)
2886
2887/** The time at which we were last low on memory. */
2889
2890/** Statistics on how many bytes were removed by the OOM per type. */
2892uint64_t oom_stats_n_bytes_removed_cell = 0;
2893uint64_t oom_stats_n_bytes_removed_geoip = 0;
2894uint64_t oom_stats_n_bytes_removed_hsdir = 0;
2895
2896/** Check whether we've got too much space used for cells. If so,
2897 * call the OOM handler and return 1. Otherwise, return 0. */
2898STATIC int
2900{
2901 size_t removed = 0;
2902 time_t now = time(NULL);
2903 size_t alloc = cell_queues_get_total_allocation();
2905 alloc += buf_get_total_allocation();
2907 const size_t hs_cache_total = hs_cache_get_total_allocation();
2908 alloc += hs_cache_total;
2909 const size_t geoip_client_cache_total =
2910 geoip_client_cache_total_allocation();
2911 alloc += geoip_client_cache_total;
2912 const size_t dns_cache_total = dns_cache_total_allocation();
2913 alloc += dns_cache_total;
2914 const size_t conflux_total = conflux_get_total_bytes_allocation();
2915 alloc += conflux_total;
2916 if (alloc >= get_options()->MaxMemInQueues_low_threshold) {
2918 if (alloc >= get_options()->MaxMemInQueues) {
2919 /* Note this overload down */
2920 rep_hist_note_overload(OVERLOAD_GENERAL);
2921
2922 /* If we're spending over 20% of the memory limit on hidden service
2923 * descriptors, free them until we're down to 10%. Do the same for geoip
2924 * client cache. */
2925 if (hs_cache_total > get_options()->MaxMemInQueues / 5) {
2926 const size_t bytes_to_remove =
2927 hs_cache_total - (size_t)(get_options()->MaxMemInQueues / 10);
2928 removed = hs_cache_handle_oom(now, bytes_to_remove);
2929 oom_stats_n_bytes_removed_hsdir += removed;
2930 alloc -= removed;
2931 }
2932 if (geoip_client_cache_total > get_options()->MaxMemInQueues / 5) {
2933 const size_t bytes_to_remove =
2934 geoip_client_cache_total -
2935 (size_t)(get_options()->MaxMemInQueues / 10);
2936 removed = geoip_client_cache_handle_oom(now, bytes_to_remove);
2937 oom_stats_n_bytes_removed_geoip += removed;
2938 alloc -= removed;
2939 }
2940 if (dns_cache_total > get_options()->MaxMemInQueues / 5) {
2941 const size_t bytes_to_remove =
2942 dns_cache_total - (size_t)(get_options()->MaxMemInQueues / 10);
2943 removed = dns_cache_handle_oom(now, bytes_to_remove);
2945 alloc -= removed;
2946 }
2947 /* Like onion service above, try to go down to 10% if we are above 20% */
2948 if (conflux_total > get_options()->MaxMemInQueues / 5) {
2949 const size_t bytes_to_remove =
2950 conflux_total - (size_t)(get_options()->MaxMemInQueues / 10);
2951 removed = conflux_handle_oom(bytes_to_remove);
2952 oom_stats_n_bytes_removed_cell += removed;
2953 alloc -= removed;
2954 }
2955 removed = circuits_handle_oom(alloc);
2956 oom_stats_n_bytes_removed_cell += removed;
2957 return 1;
2958 }
2959 }
2960 return 0;
2961}
2962
2963/** Return true if we've been under memory pressure in the last
2964 * MEMORY_PRESSURE_INTERVAL seconds. */
2965int
2967{
2969 < approx_time();
2970}
2971
2972/**
2973 * Update the number of cells available on the circuit's n_chan or p_chan's
2974 * circuit mux.
2975 */
2976void
2978 const char *file, int lineno)
2979{
2980 channel_t *chan = NULL;
2981 or_circuit_t *or_circ = NULL;
2982 circuitmux_t *cmux = NULL;
2983
2984 tor_assert(circ);
2985
2986 /* Okay, get the channel */
2987 if (direction == CELL_DIRECTION_OUT) {
2988 chan = circ->n_chan;
2989 } else {
2990 or_circ = TO_OR_CIRCUIT(circ);
2991 chan = or_circ->p_chan;
2992 }
2993
2994 tor_assert(chan);
2995 tor_assert(chan->cmux);
2996
2997 /* Now get the cmux */
2998 cmux = chan->cmux;
2999
3000 /* Cmux sanity check */
3001 if (! circuitmux_is_circuit_attached(cmux, circ)) {
3002 log_warn(LD_BUG, "called on non-attached circuit from %s:%d",
3003 file, lineno);
3004 return;
3005 }
3006 tor_assert(circuitmux_attached_circuit_direction(cmux, circ) == direction);
3007
3008 /* Update the number of cells we have for the circuit mux */
3009 if (direction == CELL_DIRECTION_OUT) {
3010 circuitmux_set_num_cells(cmux, circ, circ->n_chan_cells.n);
3011 } else {
3012 circuitmux_set_num_cells(cmux, circ, or_circ->p_chan_cells.n);
3013 }
3014}
3015
3016/** Remove all circuits from the cmux on <b>chan</b>.
3017 *
3018 * If <b>circuits_out</b> is non-NULL, add all detached circuits to
3019 * <b>circuits_out</b>.
3020 **/
3021void
3023{
3024 tor_assert(chan);
3025 tor_assert(chan->cmux);
3026
3027 circuitmux_detach_all_circuits(chan->cmux, circuits_out);
3028 chan->num_n_circuits = 0;
3029 chan->num_p_circuits = 0;
3030}
3031
3032/**
3033 * Called when a circuit becomes blocked or unblocked due to the channel
3034 * cell queue.
3035 *
3036 * Block (if <b>block</b> is true) or unblock (if <b>block</b> is false)
3037 * every edge connection that is using <b>circ</b> to write to <b>chan</b>,
3038 * and start or stop reading as appropriate.
3039 */
3040static void
3042{
3043 edge_connection_t *edge = NULL;
3044 if (circ->n_chan == chan) {
3045 circ->circuit_blocked_on_n_chan = block;
3046 if (CIRCUIT_IS_ORIGIN(circ))
3047 edge = TO_ORIGIN_CIRCUIT(circ)->p_streams;
3048 } else {
3049 circ->circuit_blocked_on_p_chan = block;
3051 edge = TO_OR_CIRCUIT(circ)->n_streams;
3052 }
3053
3054 set_block_state_for_streams(circ, edge, block, 0);
3055}
3056
3057/**
3058 * Helper function to block or unblock streams in a stream list.
3059 *
3060 * If <b>stream_id</b> is 0, apply the <b>block</b> state to all streams
3061 * in the stream list. If it is non-zero, only apply to that specific stream.
3062 */
3063static void
3065 int block, streamid_t stream_id)
3066{
3067 /* If we have a conflux object, we need to examine its status before
3068 * blocking and unblocking streams. */
3069 if (circ->conflux) {
3070 bool can_send = conflux_can_send(circ->conflux);
3071
3072 if (block && can_send) {
3073 /* Don't actually block streams, since conflux can send*/
3074 return;
3075 } else if (!block && !can_send) {
3076 /* Don't actually unblock streams, since conflux still can't send */
3077 return;
3078 }
3079 }
3080
3081 for (edge_connection_t *edge = stream_list; edge; edge = edge->next_stream) {
3082 connection_t *conn = TO_CONN(edge);
3083 if (stream_id && edge->stream_id != stream_id)
3084 continue;
3085
3086 if (!conn->read_event || edge->xoff_received ||
3087 conn->marked_for_close) {
3088 /* This connection should not start or stop reading. */
3089 continue;
3090 }
3091
3092 if (block) {
3093 if (connection_is_reading(conn))
3095 } else {
3096 /* Is this right? */
3097 if (!connection_is_reading(conn))
3099 }
3100 }
3101}
3102
3103/** Extract the command from a packed cell. */
3104uint8_t
3105packed_cell_get_command(const packed_cell_t *cell, int wide_circ_ids)
3106{
3107 if (wide_circ_ids) {
3108 return get_uint8(cell->body+4);
3109 } else {
3110 return get_uint8(cell->body+2);
3111 }
3112}
3113
3114/** Extract the circuit ID from a packed cell. */
3116packed_cell_get_circid(const packed_cell_t *cell, int wide_circ_ids)
3117{
3118 if (wide_circ_ids) {
3119 return ntohl(get_uint32(cell->body));
3120 } else {
3121 return ntohs(get_uint16(cell->body));
3122 }
3123}
3124
3125/** Pull as many cells as possible (but no more than <b>max</b>) from the
3126 * queue of the first active circuit on <b>chan</b>, and write them to
3127 * <b>chan</b>-&gt;outbuf. Return the number of cells written. Advance
3128 * the active circuit pointer to the next active circuit in the ring. */
3129MOCK_IMPL(int,
3131{
3132 circuitmux_t *cmux = NULL;
3133 int n_flushed = 0;
3134 cell_queue_t *queue;
3135 destroy_cell_queue_t *destroy_queue=NULL;
3136 circuit_t *circ;
3137 or_circuit_t *or_circ;
3138 int circ_blocked;
3139 packed_cell_t *cell;
3140
3141 /* Get the cmux */
3142 tor_assert(chan);
3143 tor_assert(chan->cmux);
3144 cmux = chan->cmux;
3145
3146 /* Main loop: pick a circuit, send a cell, update the cmux */
3147 while (n_flushed < max) {
3148 circ = circuitmux_get_first_active_circuit(cmux, &destroy_queue);
3149 if (destroy_queue) {
3150 destroy_cell_t *dcell;
3151 /* this code is duplicated from some of the logic below. Ugly! XXXX */
3152 /* If we are given a destroy_queue here, then it is required to be
3153 * nonempty... */
3154 tor_assert(destroy_queue->n > 0);
3155 dcell = destroy_cell_queue_pop(destroy_queue);
3156 /* ...and pop() will always yield a cell from a nonempty queue. */
3157 tor_assert(dcell);
3158 /* frees dcell */
3159 cell = destroy_cell_to_packed_cell(dcell, chan->wide_circ_ids);
3160 /* Send the DESTROY cell. It is very unlikely that this fails but just
3161 * in case, get rid of the channel. */
3162 if (channel_write_packed_cell(chan, cell) < 0) {
3163 /* The cell has been freed. */
3165 continue;
3166 }
3167 /* Update the cmux destroy counter */
3169 cell = NULL;
3170 ++n_flushed;
3171 continue;
3172 }
3173 /* If it returns NULL, no cells left to send */
3174 if (!circ) break;
3175
3176 if (circ->n_chan == chan) {
3177 queue = &circ->n_chan_cells;
3178 circ_blocked = circ->circuit_blocked_on_n_chan;
3179 } else {
3180 or_circ = TO_OR_CIRCUIT(circ);
3181 tor_assert(or_circ->p_chan == chan);
3182 queue = &TO_OR_CIRCUIT(circ)->p_chan_cells;
3183 circ_blocked = circ->circuit_blocked_on_p_chan;
3184 }
3185
3186 /* Circuitmux told us this was active, so it should have cells.
3187 *
3188 * Note: In terms of logic and coherence, this should never happen but the
3189 * cmux dragon is powerful. Reason is that when the OOM is triggered, when
3190 * cleaning up circuits, we mark them for close and then clear their cell
3191 * queues. And so, we can have a circuit considered active by the cmux
3192 * dragon but without cells. The cmux subsystem is only notified of this
3193 * when the circuit is freed which leaves a tiny window between close and
3194 * free to end up here.
3195 *
3196 * We are accepting this as an "ok" race else the changes are likely non
3197 * trivial to make the mark for close to set the num cells to 0 and change
3198 * the free functions to detach the circuit conditionally without creating
3199 * a chain effect of madness.
3200 *
3201 * The lesson here is arti will prevail and leave the cmux dragon alone. */
3202 if (queue->n == 0) {
3203 circuitmux_set_num_cells(cmux, circ, 0);
3204 if (! circ->marked_for_close)
3205 circuit_mark_for_close(circ, END_CIRC_REASON_INTERNAL);
3206 continue;
3207 }
3208
3209 tor_assert(queue->n > 0);
3210
3211 /*
3212 * Get just one cell here; once we've sent it, that can change the circuit
3213 * selection, so we have to loop around for another even if this circuit
3214 * has more than one.
3215 */
3216 cell = cell_queue_pop(queue);
3217
3218 /* Calculate the exact time that this cell has spent in the queue. */
3219 if (get_options()->CellStatistics ||
3220 get_options()->TestingEnableCellStatsEvent) {
3221 uint32_t timestamp_now = monotime_coarse_get_stamp();
3222 uint32_t msec_waiting =
3224 timestamp_now - cell->inserted_timestamp);
3225
3226 if (get_options()->CellStatistics && !CIRCUIT_IS_ORIGIN(circ)) {
3227 or_circ = TO_OR_CIRCUIT(circ);
3228 or_circ->total_cell_waiting_time += msec_waiting;
3229 or_circ->processed_cells++;
3230 }
3231
3232 if (get_options()->TestingEnableCellStatsEvent) {
3233 uint8_t command = packed_cell_get_command(cell, chan->wide_circ_ids);
3234
3236 tor_malloc_zero(sizeof(testing_cell_stats_entry_t));
3237 ent->command = command;
3238 ent->waiting_time = msec_waiting / 10;
3239 ent->removed = 1;
3240 if (circ->n_chan == chan)
3241 ent->exitward = 1;
3242 if (!circ->testing_cell_stats)
3245 }
3246 }
3247
3248 /* If we just flushed our queue and this circuit is used for a
3249 * tunneled directory request, possibly advance its state. */
3250 if (queue->n == 0 && chan->dirreq_id)
3252 DIRREQ_TUNNELED,
3254
3255 /* Now send the cell. It is very unlikely that this fails but just in
3256 * case, get rid of the channel. */
3257 if (channel_write_packed_cell(chan, cell) < 0) {
3258 /* The cell has been freed at this point. */
3260 continue;
3261 }
3262 cell = NULL;
3263
3264 /*
3265 * Don't packed_cell_free_unchecked(cell) here because the channel will
3266 * do so when it gets out of the channel queue (probably already did, in
3267 * which case that was an immediate double-free bug).
3268 */
3269
3270 /* Update the counter */
3271 ++n_flushed;
3272
3273 /*
3274 * Now update the cmux; tell it we've just sent a cell, and how many
3275 * we have left.
3276 */
3277 circuitmux_notify_xmit_cells(cmux, circ, 1);
3278 circuitmux_set_num_cells(cmux, circ, queue->n);
3279 if (queue->n == 0)
3280 log_debug(LD_GENERAL, "Made a circuit inactive.");
3281
3282 /* Is the cell queue low enough to unblock all the streams that are waiting
3283 * to write to this circuit? */
3284 if (circ_blocked && queue->n <= cell_queue_lowwatermark())
3285 set_circuit_blocked_on_chan(circ, chan, 0); /* unblock streams */
3286
3287 /* If n_flushed < max still, loop around and pick another circuit */
3288 }
3289
3290 /* Okay, we're done sending now */
3291 return n_flushed;
3292}
3293
3294/* Minimum value is the maximum circuit window size.
3295 *
3296 * This value is set to a lower bound we believe is reasonable with congestion
3297 * control and basic network running parameters.
3298 *
3299 * SENDME cells makes it that we can control how many cells can be inflight on
3300 * a circuit from end to end. This logic makes it that on any circuit cell
3301 * queue, we have a maximum of cells possible.
3302 *
3303 * Because the Tor protocol allows for a client to exit at any hop in a
3304 * circuit and a circuit can be of a maximum of 8 hops, so in theory the
3305 * normal worst case will be the circuit window start value times the maximum
3306 * number of hops (8). Having more cells then that means something is wrong.
3307 *
3308 * However, because padding cells aren't counted in the package window, we set
3309 * the maximum size to a reasonably large size for which we expect that we'll
3310 * never reach in theory. And if we ever do because of future changes, we'll
3311 * be able to control it with a consensus parameter.
3312 *
3313 * XXX: Unfortunately, END cells aren't accounted for in the circuit window
3314 * which means that for instance if a client opens 8001 streams, the 8001
3315 * following END cells will queue up in the circuit which will get closed if
3316 * the max limit is 8000. Which is sad because it is allowed by the Tor
3317 * protocol. But, we need an upper bound on circuit queue in order to avoid
3318 * DoS memory pressure so the default size is a middle ground between not
3319 * having any limit and having a very restricted one. This is why we can also
3320 * control it through a consensus parameter. */
3321#define RELAY_CIRC_CELL_QUEUE_SIZE_MIN 50
3322/* We can't have a consensus parameter above this value. */
3323#define RELAY_CIRC_CELL_QUEUE_SIZE_MAX INT32_MAX
3324/* Default value is set to a large value so we can handle padding cells
3325 * properly which aren't accounted for in the SENDME window. Default is 2500
3326 * allowed cells in the queue resulting in ~1MB. */
3327#define RELAY_CIRC_CELL_QUEUE_SIZE_DEFAULT \
3328 (50 * RELAY_CIRC_CELL_QUEUE_SIZE_MIN)
3329
3330/* The maximum number of cells a circuit queue can contain. This is updated at
3331 * every new consensus and controlled by a parameter. */
3332static int32_t max_circuit_cell_queue_size =
3333 RELAY_CIRC_CELL_QUEUE_SIZE_DEFAULT;
3334/** Maximum number of cell on an outbound circuit queue. This is updated at
3335 * every new consensus and controlled by a parameter. This default is incorrect
3336 * and won't be used at all except in unit tests. */
3338 RELAY_CIRC_CELL_QUEUE_SIZE_DEFAULT;
3339
3340/** Return consensus parameter "circ_max_cell_queue_size". The given ns can be
3341 * NULL. */
3342static uint32_t
3344{
3345 return networkstatus_get_param(ns, "circ_max_cell_queue_size",
3346 RELAY_CIRC_CELL_QUEUE_SIZE_DEFAULT,
3347 RELAY_CIRC_CELL_QUEUE_SIZE_MIN,
3348 RELAY_CIRC_CELL_QUEUE_SIZE_MAX);
3349}
3350
3351/** Return consensus parameter "circ_max_cell_queue_size_out". The given ns can
3352 * be NULL. */
3353static uint32_t
3355{
3356 return networkstatus_get_param(ns, "circ_max_cell_queue_size_out",
3358 RELAY_CIRC_CELL_QUEUE_SIZE_MIN,
3359 RELAY_CIRC_CELL_QUEUE_SIZE_MAX);
3360}
3361
3362/* Called when the consensus has changed. At this stage, the global consensus
3363 * object has NOT been updated. It is called from
3364 * notify_before_networkstatus_changes(). */
3365void
3366relay_consensus_has_changed(const networkstatus_t *ns)
3367{
3368 tor_assert(ns);
3369
3370 /* Update the circuit max cell queue size from the consensus. */
3371 max_circuit_cell_queue_size =
3375}
3376
3377/** Add <b>cell</b> to the queue of <b>circ</b> writing to <b>chan</b>
3378 * transmitting in <b>direction</b>.
3379 *
3380 * The given <b>cell</b> is copied onto the circuit queue so the caller must
3381 * cleanup the memory.
3382 *
3383 * This function is part of the fast path. */
3384void
3386 cell_t *cell, cell_direction_t direction,
3387 streamid_t fromstream)
3388{
3389 or_circuit_t *orcirc = NULL;
3390 edge_connection_t *stream_list = NULL;
3391 cell_queue_t *queue;
3392 int32_t max_queue_size;
3393 int circ_blocked;
3394 int exitward;
3395 if (circ->marked_for_close)
3396 return;
3397
3398 exitward = (direction == CELL_DIRECTION_OUT);
3399 if (exitward) {
3400 queue = &circ->n_chan_cells;
3401 circ_blocked = circ->circuit_blocked_on_n_chan;
3402 max_queue_size = max_circuit_cell_queue_size_out;
3403 if (CIRCUIT_IS_ORIGIN(circ))
3404 stream_list = TO_ORIGIN_CIRCUIT(circ)->p_streams;
3405 } else {
3406 orcirc = TO_OR_CIRCUIT(circ);
3407 queue = &orcirc->p_chan_cells;
3408 circ_blocked = circ->circuit_blocked_on_p_chan;
3409 max_queue_size = max_circuit_cell_queue_size;
3410 stream_list = TO_OR_CIRCUIT(circ)->n_streams;
3411 }
3412
3413 if (PREDICT_UNLIKELY(queue->n >= max_queue_size)) {
3414 /* This DoS defense only applies at the Guard as in the p_chan is likely
3415 * a client IP attacking the network. */
3416 if (exitward && CIRCUIT_IS_ORCIRC(circ)) {
3417 stats_n_circ_max_cell_outq_reached++;
3418 dos_note_circ_max_outq(CONST_TO_OR_CIRCUIT(circ)->p_chan);
3419 }
3420
3421 log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
3422 "%s circuit has %d cells in its queue, maximum allowed is %d. "
3423 "Closing circuit for safety reasons.",
3424 (exitward) ? "Outbound" : "Inbound", queue->n,
3425 max_queue_size);
3426 circuit_mark_for_close(circ, END_CIRC_REASON_RESOURCELIMIT);
3428 return;
3429 }
3430
3431 /* Very important that we copy to the circuit queue because all calls to
3432 * this function use the stack for the cell memory. */
3433 cell_queue_append_packed_copy(circ, queue, exitward, cell,
3434 chan->wide_circ_ids, 1);
3435
3436 /* Check and run the OOM if needed. */
3437 if (PREDICT_UNLIKELY(cell_queues_check_size())) {
3438 /* We ran the OOM handler which might have closed this circuit. */
3439 if (circ->marked_for_close)
3440 return;
3441 }
3442
3443 /* If we have too many cells on the circuit, note that it should
3444 * be blocked from new cells. */
3445 if (!circ_blocked && queue->n >= cell_queue_highwatermark())
3446 set_circuit_blocked_on_chan(circ, chan, 1);
3447
3448 if (circ_blocked && fromstream) {
3449 /* This edge connection is apparently not blocked; this can happen for
3450 * new streams on a blocked circuit, for their CONNECTED response.
3451 * block it now, unless we have conflux. */
3452 set_block_state_for_streams(circ, stream_list, 1, fromstream);
3453 }
3454
3455 update_circuit_on_cmux(circ, direction);
3456 if (queue->n == 1) {
3457 /* This was the first cell added to the queue. We just made this
3458 * circuit active. */
3459 log_debug(LD_GENERAL, "Made a circuit active.");
3460 }
3461
3462 /* New way: mark this as having waiting cells for the scheduler */
3464}
3465
3466/** Append an encoded value of <b>addr</b> to <b>payload_out</b>, which must
3467 * have at least 18 bytes of free space. The encoding is, as specified in
3468 * tor-spec.txt:
3469 * RESOLVED_TYPE_IPV4 or RESOLVED_TYPE_IPV6 [1 byte]
3470 * LENGTH [1 byte]
3471 * ADDRESS [length bytes]
3472 * Return the number of bytes added, or -1 on error */
3473int
3474append_address_to_payload(uint8_t *payload_out, const tor_addr_t *addr)
3475{
3476 uint32_t a;
3477 switch (tor_addr_family(addr)) {
3478 case AF_INET:
3479 payload_out[0] = RESOLVED_TYPE_IPV4;
3480 payload_out[1] = 4;
3481 a = tor_addr_to_ipv4n(addr);
3482 memcpy(payload_out+2, &a, 4);
3483 return 6;
3484 case AF_INET6:
3485 payload_out[0] = RESOLVED_TYPE_IPV6;
3486 payload_out[1] = 16;
3487 memcpy(payload_out+2, tor_addr_to_in6_addr8(addr), 16);
3488 return 18;
3489 case AF_UNSPEC:
3490 default:
3491 return -1;
3492 }
3493}
3494
3495/** Given <b>payload_len</b> bytes at <b>payload</b>, starting with an address
3496 * encoded as by append_address_to_payload(), try to decode the address into
3497 * *<b>addr_out</b>. Return the next byte in the payload after the address on
3498 * success, or NULL on failure. */
3499const uint8_t *
3500decode_address_from_payload(tor_addr_t *addr_out, const uint8_t *payload,
3501 int payload_len)
3502{
3503 if (payload_len < 2)
3504 return NULL;
3505 if (payload_len < 2+payload[1])
3506 return NULL;
3507
3508 switch (payload[0]) {
3509 case RESOLVED_TYPE_IPV4:
3510 if (payload[1] != 4)
3511 return NULL;
3512 tor_addr_from_ipv4n(addr_out, get_uint32(payload+2));
3513 break;
3514 case RESOLVED_TYPE_IPV6:
3515 if (payload[1] != 16)
3516 return NULL;
3517 tor_addr_from_ipv6_bytes(addr_out, (payload+2));
3518 break;
3519 default:
3520 tor_addr_make_unspec(addr_out);
3521 break;
3522 }
3523 return payload + 2 + payload[1];
3524}
3525
3526/** Remove all the cells queued on <b>circ</b> for <b>chan</b>. */
3527void
3529{
3530 cell_queue_t *queue;
3531 cell_direction_t direction;
3532
3533 if (circ->n_chan == chan) {
3534 queue = &circ->n_chan_cells;
3535 direction = CELL_DIRECTION_OUT;
3536 } else {
3537 or_circuit_t *orcirc = TO_OR_CIRCUIT(circ);
3538 tor_assert(orcirc->p_chan == chan);
3539 queue = &orcirc->p_chan_cells;
3540 direction = CELL_DIRECTION_IN;
3541 }
3542
3543 /* Clear the queue */
3544 cell_queue_clear(queue);
3545
3546 /* Update the cell counter in the cmux */
3547 if (chan->cmux && circuitmux_is_circuit_attached(chan->cmux, circ))
3548 update_circuit_on_cmux(circ, direction);
3549}
3550
3551/** Return 1 if we shouldn't restart reading on this circuit, even if
3552 * we get a SENDME. Else return 0.
3553*/
3554static int
3556{
3557 if (CIRCUIT_IS_ORIGIN(circ)) {
3558 return circ->circuit_blocked_on_n_chan;
3559 } else {
3560 return circ->circuit_blocked_on_p_chan;
3561 }
3562}
void tor_addr_from_ipv4n(tor_addr_t *dest, uint32_t v4addr)
Definition: address.c:889
void tor_addr_make_unspec(tor_addr_t *a)
Definition: address.c:225
int tor_addr_parse(tor_addr_t *addr, const char *src)
Definition: address.c:1349
int tor_addr_is_null(const tor_addr_t *addr)
Definition: address.c:780
const char * tor_addr_to_str(char *dest, const tor_addr_t *addr, size_t len, int decorate)
Definition: address.c:328
void tor_addr_from_ipv6_bytes(tor_addr_t *dest, const uint8_t *ipv6_bytes)
Definition: address.c:900
static uint32_t tor_addr_to_ipv4n(const tor_addr_t *a)
Definition: address.h:152
static sa_family_t tor_addr_family(const tor_addr_t *a)
Definition: address.h:187
#define tor_addr_to_in6_addr8(x)
Definition: address.h:135
#define tor_addr_from_ipv4h(dest, v4addr)
Definition: address.h:327
#define fmt_addr(a)
Definition: address.h:239
#define TOR_ADDR_BUF_LEN
Definition: address.h:224
int client_dns_incr_failures(const char *address)
Definition: addressmap.c:638
void client_dns_set_addressmap(entry_connection_t *for_conn, const char *address, const tor_addr_t *val, const char *exitname, int ttl)
Definition: addressmap.c:728
void client_dns_clear_failures(const char *address)
Definition: addressmap.c:660
Header for addressmap.c.
time_t approx_time(void)
Definition: approx_time.c:32
Header for backtrace.c.
buf_t * buf_new(void)
Definition: buffers.c:365
int buf_add(buf_t *buf, const char *string, size_t string_len)
Definition: buffers.c:527
size_t buf_datalen(const buf_t *buf)
Definition: buffers.c:394
int buf_get_bytes(buf_t *buf, char *string, size_t string_len)
Definition: buffers.c:637
Header file for buffers.c.
static void set_uint16(void *cp, uint16_t v)
Definition: bytes.h:78
static uint16_t get_uint16(const void *cp)
Definition: bytes.h:42
static uint8_t get_uint8(const void *cp)
Definition: bytes.h:23
static void set_uint8(void *cp, uint8_t v)
Definition: bytes.h:31
static uint32_t get_uint32(const void *cp)
Definition: bytes.h:54
Cell queue structures.
Fixed-size cell structure.
void channel_timestamp_client(channel_t *chan)
Definition: channel.c:3198
int channel_send_destroy(circid_t circ_id, channel_t *chan, int reason)
Definition: channel.c:2038
int channel_is_client(const channel_t *chan)
Definition: channel.c:2918
void channel_mark_for_close(channel_t *chan)
Definition: channel.c:1142
int channel_write_packed_cell(channel_t *chan, packed_cell_t *cell)
Definition: channel.c:1489
Header file for channel.c.
void pathbias_count_valid_cells(circuit_t *circ, const cell_t *cell)
Definition: circpathbias.c:966
int pathbias_check_probe_response(circuit_t *circ, const cell_t *cell)
Definition: circpathbias.c:906
void pathbias_mark_use_success(origin_circuit_t *circ)
Definition: circpathbias.c:683
void circuit_log_path(int severity, unsigned int domain, origin_circuit_t *circ)
Definition: circuitbuild.c:357
int circuit_send_next_onion_skin(origin_circuit_t *circ)
Definition: circuitbuild.c:980
int circuit_finish_handshake(origin_circuit_t *circ, const created_cell_t *reply)
int circuit_truncated(origin_circuit_t *circ, int reason)
Header file for circuitbuild.c.
int circuit_extend(struct cell_t *cell, struct circuit_t *circ)
Header for feature/relay/circuitbuild_relay.c.
void circuit_synchronize_written_or_bandwidth(const circuit_t *c, circuit_channel_direction_t dir)
Definition: circuitlist.c:2130
void circuit_set_n_circid_chan(circuit_t *circ, circid_t id, channel_t *chan)
Definition: circuitlist.c:489
void circuit_set_state(circuit_t *circ, uint8_t state)
Definition: circuitlist.c:558
circuit_t * circuit_get_by_edge_conn(edge_connection_t *conn)
Definition: circuitlist.c:1602
origin_circuit_t * TO_ORIGIN_CIRCUIT(circuit_t *x)
Definition: circuitlist.c:181
void assert_circuit_ok(const circuit_t *c)
Definition: circuitlist.c:2801
const char * circuit_state_to_string(int state)
Definition: circuitlist.c:777
size_t circuits_handle_oom(size_t current_allocation)
Definition: circuitlist.c:2668
or_circuit_t * TO_OR_CIRCUIT(circuit_t *x)
Definition: circuitlist.c:169
smartlist_t * circuit_get_global_list(void)
Definition: circuitlist.c:709
Header file for circuitlist.c.
#define CIRCUIT_PURPOSE_PATH_BIAS_TESTING
Definition: circuitlist.h:123
#define CIRCUIT_STATE_OPEN
Definition: circuitlist.h:32
#define CIRCUIT_IS_ORCIRC(c)
Definition: circuitlist.h:161
#define CIRCUIT_IS_ORIGIN(c)
Definition: circuitlist.h:154
#define CIRCUIT_PURPOSE_OR
Definition: circuitlist.h:39
#define CIRCUIT_PURPOSE_S_REND_JOINED
Definition: circuitlist.h:110
#define CIRCUIT_PURPOSE_REND_ESTABLISHED
Definition: circuitlist.h:47
cell_direction_t circuitmux_attached_circuit_direction(circuitmux_t *cmux, circuit_t *circ)
Definition: circuitmux.c:549
void circuitmux_notify_xmit_destroy(circuitmux_t *cmux)
Definition: circuitmux.c:1164
void circuitmux_detach_all_circuits(circuitmux_t *cmux, smartlist_t *detached_out)
Definition: circuitmux.c:214
void circuitmux_notify_xmit_cells(circuitmux_t *cmux, circuit_t *circ, unsigned int n_cells)
Definition: circuitmux.c:1104
int circuitmux_is_circuit_attached(circuitmux_t *cmux, circuit_t *circ)
Definition: circuitmux.c:627
void circuitmux_set_num_cells(circuitmux_t *cmux, circuit_t *circ, unsigned int n_cells)
Definition: circuitmux.c:999
circuit_t * circuitmux_get_first_active_circuit(circuitmux_t *cmux, destroy_cell_queue_t **destroy_queue_out)
Definition: circuitmux.c:1061
void circpad_deliver_sent_relay_cell_events(circuit_t *circ, uint8_t relay_command)
void circpad_deliver_unrecognized_cell_events(circuit_t *circ, cell_direction_t dir)
void circpad_machine_event_circ_has_no_relay_early(origin_circuit_t *circ)
void circpad_deliver_recognized_relay_cell_events(circuit_t *circ, uint8_t relay_command, crypt_path_t *layer_hint)
int circpad_check_received_cell(cell_t *cell, circuit_t *circ, crypt_path_t *layer_hint, const relay_header_t *rh)
Header file for circuitpadding.c.
void circuit_sent_valid_data(origin_circuit_t *circ, uint16_t relay_body_len)
Definition: circuituse.c:3176
void circuit_read_valid_data(origin_circuit_t *circ, uint16_t relay_body_len)
Definition: circuituse.c:3197
void mark_circuit_unusable_for_new_conns(origin_circuit_t *circ)
Definition: circuituse.c:3148
Header file for circuituse.c.
uint64_t monotime_coarse_stamp_units_to_approx_msec(uint64_t units)
Definition: compat_time.c:890
uint32_t monotime_coarse_get_stamp(void)
Definition: compat_time.c:864
size_t tor_compress_get_total_allocation(void)
Definition: compress.c:466
Headers for compress.c.
const or_options_t * get_options(void)
Definition: config.c:944
tor_cmdline_mode_t command
Definition: config.c:2468
Header file for config.c.
void conflux_note_cell_sent(conflux_t *cfx, circuit_t *circ, uint8_t relay_command)
Definition: conflux.c:523
bool conflux_process_cell(conflux_t *cfx, circuit_t *in_circ, crypt_path_t *layer_hint, cell_t *cell)
Definition: conflux.c:828
int conflux_process_switch_command(circuit_t *in_circ, crypt_path_t *layer_hint, cell_t *cell, relay_header_t *rh)
Definition: conflux.c:729
bool conflux_should_multiplex(int relay_command)
Definition: conflux.c:47
circuit_t * conflux_decide_next_circ(conflux_t *cfx)
Definition: conflux.c:601
conflux_cell_t * conflux_dequeue_cell(conflux_t *cfx)
Definition: conflux.c:887
circuit_t * conflux_decide_circ_for_send(conflux_t *cfx, circuit_t *orig_circ, uint8_t relay_command)
Definition: conflux.c:452
size_t conflux_handle_oom(size_t bytes_to_remove)
Definition: conflux.c:186
uint64_t conflux_get_total_bytes_allocation(void)
Definition: conflux.c:179
Public APIs for conflux multipath support.
void conflux_process_linked_ack(circuit_t *circ)
void conflux_log_set(int loglevel, const conflux_t *cfx, bool is_client)
void conflux_process_linked(circuit_t *circ, crypt_path_t *layer_hint, const cell_t *cell, const uint16_t cell_len)
void conflux_process_link(circuit_t *circ, const cell_t *cell, const uint16_t cell_len)
Header file for conflux_pool.c.
crypt_path_t * conflux_get_destination_hop(circuit_t *circ)
Definition: conflux_util.c:115
int circuit_get_package_window(circuit_t *circ, const crypt_path_t *cpath)
Definition: conflux_util.c:33
bool conflux_can_send(conflux_t *cfx)
Definition: conflux_util.c:92
bool relay_crypt_from_last_hop(const origin_circuit_t *circ, const crypt_path_t *layer_hint)
Definition: conflux_util.c:235
bool edge_uses_cpath(const edge_connection_t *conn, const crypt_path_t *cpath)
Definition: conflux_util.c:165
Header file for conflux_util.c.
int congestion_control_get_package_window(const circuit_t *circ, const crypt_path_t *cpath)
Public APIs for congestion control.
static int32_t cell_queue_highwatermark(void)
static int32_t cell_queue_lowwatermark(void)
bool circuit_process_stream_xoff(edge_connection_t *conn, const crypt_path_t *layer_hint, const cell_t *cell)
bool circuit_process_stream_xon(edge_connection_t *conn, const crypt_path_t *layer_hint, const cell_t *cell)
APIs for stream flow control on congestion controlled circuits.
int connection_buf_get_bytes(char *string, size_t len, connection_t *conn)
Definition: connection.c:4324
int connection_state_is_open(connection_t *conn)
Definition: connection.c:5058
const char * conn_state_to_string(int type, int state)
Definition: connection.c:304
Header file for connection.c.
#define CONN_TYPE_AP
Definition: connection.h:51
#define CONN_TYPE_DIR
Definition: connection.h:55
#define CONN_TYPE_EXIT
Definition: connection.h:46
int connection_half_edge_is_valid_data(const smartlist_t *half_conns, streamid_t stream_id)
int connection_ap_detach_retriable(entry_connection_t *conn, origin_circuit_t *circ, int reason)
void connection_ap_handshake_socks_reply(entry_connection_t *conn, char *reply, size_t replylen, int endreason)
int connection_half_edge_is_valid_end(smartlist_t *half_conns, streamid_t stream_id)
void connection_edge_end_close(edge_connection_t *conn, uint8_t reason)
int connection_exit_begin_resolve(cell_t *cell, or_circuit_t *circ)
int connection_half_edge_is_valid_connected(const smartlist_t *half_conns, streamid_t stream_id)
entry_connection_t * EDGE_TO_ENTRY_CONN(edge_connection_t *c)
void connection_ap_handshake_socks_resolved_addr(entry_connection_t *conn, const tor_addr_t *answer, int ttl, time_t expires)
int connection_half_edge_is_valid_resolved(smartlist_t *half_conns, streamid_t stream_id)
int connection_edge_end(edge_connection_t *conn, uint8_t reason)
size_t half_streams_get_total_allocation(void)
int connection_half_edge_is_valid_sendme(const smartlist_t *half_conns, streamid_t stream_id)
int connection_edge_is_rendezvous_stream(const edge_connection_t *conn)
void connection_ap_handshake_socks_resolved(entry_connection_t *conn, int answer_type, size_t answer_len, const uint8_t *answer, int ttl, time_t expires)
int connection_exit_begin_conn(cell_t *cell, circuit_t *circ)
Header file for connection_edge.c.
#define EXIT_CONN_STATE_CONNECTING
#define AP_CONN_STATE_CONNECT_WAIT
#define AP_CONN_STATE_OPEN
#define AP_CONN_STATE_RESOLVE_WAIT
#define EXIT_CONN_STATE_RESOLVING
void cell_pack(packed_cell_t *dst, const cell_t *src, int wide_circ_ids)
Header file for connection_or.c.
void control_event_boot_dir(bootstrap_status_t status, int progress)
void control_event_bootstrap(bootstrap_status_t status, int progress)
int control_event_stream_status(entry_connection_t *conn, stream_status_event_t tp, int reason_code)
Header file for control_events.c.
#define REMAP_STREAM_SOURCE_EXIT
Circuit-build-stse structure.
Common functions for using (pseudo-)random number generators.
#define crypto_fast_rng_one_in_n(rng, n)
Definition: crypto_rand.h:80
crypto_fast_rng_t * get_thread_fast_rng(void)
unsigned crypto_fast_rng_get_uint(crypto_fast_rng_t *rng, unsigned limit)
void crypto_fast_rng_getbytes(crypto_fast_rng_t *rng, uint8_t *out, size_t n)
Common functions for cryptographic routines.
const char * node_describe(const node_t *node)
Definition: describe.c:160
Header file for describe.c.
Destroy-cell queue structures.
Client/server directory connection structure.
dir_connection_t * TO_DIR_CONN(connection_t *c)
Definition: directory.c:88
Header file for directory.c.
#define DIR_PURPOSE_FETCH_CERTIFICATE
Definition: directory.h:57
#define DIR_PURPOSE_FETCH_MICRODESC
Definition: directory.h:65
#define DIR_PURPOSE_FETCH_CONSENSUS
Definition: directory.h:54
#define DIR_PURPOSE_FETCH_SERVERDESC
Definition: directory.h:36
Header file for dns.c.
Entry connection structure.
#define ENTRY_TO_EDGE_CONN(c)
Extend-info structure.
Header for core/or/extendinfo.c.
Header file for geoip_stats.c.
@ DIRREQ_END_CELL_SENT
Definition: geoip_stats.h:66
@ DIRREQ_CIRC_QUEUE_FLUSHED
Definition: geoip_stats.h:69
void geoip_change_dirreq_state(uint64_t dirreq_id, dirreq_type_t type, dirreq_state_t new_state)
Definition: geoip_stats.c:552
size_t hs_cache_handle_oom(time_t now, size_t min_remove_bytes)
Definition: hs_cache.c:1074
Header file for hs_cache.c.
Header for feature/hs/hs_metrics.c.
#define hs_metrics_app_write_bytes(i, port, n)
Definition: hs_metrics.h:47
uint16_t sa_family_t
Definition: inaddr_st.h:77
void tor_log(int severity, log_domain_mask_t domain, const char *format,...)
Definition: log.c:591
#define log_fn(severity, domain, args,...)
Definition: log.h:283
#define LD_REND
Definition: log.h:84
#define LD_APP
Definition: log.h:78
#define LD_PROTOCOL
Definition: log.h:72
#define LD_OR
Definition: log.h:92
#define LD_MM
Definition: log.h:74
#define LD_BUG
Definition: log.h:86
#define LD_GENERAL
Definition: log.h:62
#define LOG_WARN
Definition: log.h:53
#define LOG_INFO
Definition: log.h:45
void connection_stop_reading(connection_t *conn)
Definition: mainloop.c:601
void connection_start_reading(connection_t *conn)
Definition: mainloop.c:623
int connection_is_reading(const connection_t *conn)
Definition: mainloop.c:500
Header file for mainloop.c.
#define tor_free(p)
Definition: malloc.h:56
int32_t networkstatus_get_param(const networkstatus_t *ns, const char *param_name, int32_t default_val, int32_t min_val, int32_t max_val)
int consensus_is_waiting_for_certs(void)
Header file for networkstatus.c.
int node_exit_policy_is_exact(const node_t *node, sa_family_t family)
Definition: nodelist.c:1605
node_t * node_get_mutable_by_id(const char *identity_digest)
Definition: nodelist.c:197
int count_loading_descriptors_progress(void)
Definition: nodelist.c:2779
Header file for nodelist.c.
int extended_cell_parse(extended_cell_t *cell_out, const uint8_t command, const uint8_t *payload, size_t payload_len)
Definition: onion.c:469
Header file for onion.c.
Master header file for Tor-specific functionality.
#define CELL_PAYLOAD_SIZE
Definition: or.h:465
#define END_STREAM_REASON_CANT_ATTACH
Definition: or.h:263
#define END_STREAM_REASON_FLAG_REMOTE
Definition: or.h:289
uint32_t circid_t
Definition: or.h:497
uint16_t streamid_t
Definition: or.h:499
#define TO_CIRCUIT(x)
Definition: or.h:848
#define RELAY_PAYLOAD_SIZE
Definition: or.h:494
#define END_STREAM_REASON_FLAG_ALREADY_SOCKS_REPLIED
Definition: or.h:296
#define TO_CONN(c)
Definition: or.h:612
#define RELAY_HEADER_SIZE
Definition: or.h:492
cell_direction_t
Definition: or.h:375
@ CELL_DIRECTION_OUT
Definition: or.h:377
@ CELL_DIRECTION_IN
Definition: or.h:376
#define END_CIRC_AT_ORIGIN
Definition: or.h:318
#define ENTRY_TO_CONN(c)
Definition: or.h:615
#define CIRCWINDOW_INCREMENT
Definition: or.h:398
Origin circuit structure.
@ PATH_STATE_USE_FAILED
void addr_policy_append_reject_addr(smartlist_t **dest, const tor_addr_t *addr)
Definition: policies.c:1617
void policies_set_node_exitpolicy_to_reject_all(node_t *node)
Definition: policies.c:2194
Header file for policies.c.
int tor_snprintf(char *str, size_t size, const char *format,...)
Definition: printf.c:27
char * rate_limit_log(ratelim_t *lim, time_t now)
Definition: ratelim.c:42
const char * stream_end_reason_to_string(int reason)
Definition: reasons.c:64
Header file for reasons.c.
int channel_flush_from_first_active_circuit(channel_t *chan, int max)
Definition: relay.c:3130
STATIC size_t connection_edge_get_inbuf_bytes_to_package(size_t n_available, int package_partial, circuit_t *on_circuit)
Definition: relay.c:2256
static int connection_edge_process_ordered_relay_cell(cell_t *cell, circuit_t *circ, edge_connection_t *conn, crypt_path_t *layer_hint, relay_header_t *rh)
Definition: relay.c:2181
void destroy_cell_queue_init(destroy_cell_queue_t *queue)
Definition: relay.c:2805
static int circuit_resume_edge_reading_helper(edge_connection_t *conn, circuit_t *circ, crypt_path_t *layer_hint)
Definition: relay.c:2479
int append_address_to_payload(uint8_t *payload_out, const tor_addr_t *addr)
Definition: relay.c:3474
uint64_t stats_n_data_cells_received
Definition: relay.c:2224
void packed_cell_free_(packed_cell_t *cell)
Definition: relay.c:2707
void destroy_cell_queue_clear(destroy_cell_queue_t *queue)
Definition: relay.c:2813
void destroy_cell_queue_append(destroy_cell_queue_t *queue, circid_t circid, uint8_t reason)
Definition: relay.c:2839
void channel_unlink_all_circuits(channel_t *chan, smartlist_t *circuits_out)
Definition: relay.c:3022
void cell_queue_append_packed_copy(circuit_t *circ, cell_queue_t *queue, int exitward, const cell_t *cell, int wide_circ_ids, int use_stats)
Definition: relay.c:2755
STATIC size_t get_pad_cell_offset(size_t data_len)
Definition: relay.c:575
uint64_t oom_stats_n_bytes_removed_dns
Definition: relay.c:2891
static packed_cell_t * destroy_cell_to_packed_cell(destroy_cell_t *inp, int wide_circ_ids)
Definition: relay.c:2855
void dump_cell_pool_usage(int severity)
Definition: relay.c:2717
STATIC int connection_edge_process_relay_cell(cell_t *cell, circuit_t *circ, edge_connection_t *conn, crypt_path_t *layer_hint)
Definition: relay.c:2073
void circuit_reset_sendme_randomness(circuit_t *circ)
Definition: relay.c:2236
uint64_t stats_n_relay_cells_relayed
Definition: relay.c:134
uint64_t stats_n_circ_max_cell_reached
Definition: relay.c:141
#define MAX_RESOLVE_FAILURES
Definition: relay.c:842
static void remap_event_helper(entry_connection_t *conn, const tor_addr_t *new_addr)
Definition: relay.c:1103
static int circuit_queue_streams_are_blocked(circuit_t *circ)
Definition: relay.c:3555
static void connection_ap_handshake_socks_got_resolved_cell(entry_connection_t *conn, int error_code, smartlist_t *results)
Definition: relay.c:1272
static void adjust_exit_policy_from_exitpolicy_failure(origin_circuit_t *circ, entry_connection_t *conn, node_t *node, const tor_addr_t *addr)
Definition: relay.c:1068
static void circuit_update_channel_usage(circuit_t *circ, cell_t *cell)
Definition: relay.c:155
uint64_t stats_n_data_cells_packaged
Definition: relay.c:2218
STATIC packed_cell_t * packed_cell_new(void)
Definition: relay.c:2699
void cell_queue_clear(cell_queue_t *queue)
Definition: relay.c:2779
STATIC int connected_cell_parse(const relay_header_t *rh, const cell_t *cell, tor_addr_t *addr_out, int *ttl_out)
Definition: relay.c:1123
void circuit_clear_cell_queue(circuit_t *circ, channel_t *chan)
Definition: relay.c:3528
void cell_queue_init(cell_queue_t *queue)
Definition: relay.c:2771
int circuit_package_relay_cell(cell_t *cell, circuit_t *circ, cell_direction_t cell_direction, crypt_path_t *layer_hint, streamid_t on_stream, const char *filename, int lineno)
Definition: relay.c:380
STATIC packed_cell_t * cell_queue_pop(cell_queue_t *queue)
Definition: relay.c:2793
int have_been_under_memory_pressure(void)
Definition: relay.c:2966
uint64_t stats_n_data_bytes_received
Definition: relay.c:2228
void relay_header_pack(uint8_t *dest, const relay_header_t *src)
Definition: relay.c:493
circid_t packed_cell_get_circid(const packed_cell_t *cell, int wide_circ_ids)
Definition: relay.c:3116
static edge_connection_t * relay_lookup_conn(circuit_t *circ, cell_t *cell, cell_direction_t cell_direction, crypt_path_t *layer_hint)
Definition: relay.c:441
const uint8_t * decode_address_from_payload(tor_addr_t *addr_out, const uint8_t *payload, int payload_len)
Definition: relay.c:3500
static uint32_t get_param_max_circuit_cell_queue_size(const networkstatus_t *ns)
Definition: relay.c:3343
void update_circuit_on_cmux_(circuit_t *circ, cell_direction_t direction, const char *file, int lineno)
Definition: relay.c:2977
STATIC destroy_cell_t * destroy_cell_queue_pop(destroy_cell_queue_t *queue)
Definition: relay.c:2827
void append_cell_to_circuit_queue(circuit_t *circ, channel_t *chan, cell_t *cell, cell_direction_t direction, streamid_t fromstream)
Definition: relay.c:3385
void relay_header_unpack(relay_header_t *dest, const uint8_t *src)
Definition: relay.c:506
static int connection_edge_process_relay_cell_not_open(relay_header_t *rh, cell_t *cell, circuit_t *circ, edge_connection_t *conn, crypt_path_t *layer_hint)
Definition: relay.c:1421
uint8_t packed_cell_get_command(const packed_cell_t *cell, int wide_circ_ids)
Definition: relay.c:3105
uint64_t stats_n_relay_cells_delivered
Definition: relay.c:138
STATIC int cell_queues_check_size(void)
Definition: relay.c:2899
static int process_sendme_cell(const relay_header_t *rh, const cell_t *cell, circuit_t *circ, edge_connection_t *conn, crypt_path_t *layer_hint, int domain)
Definition: relay.c:1570
STATIC int handle_relay_cell_command(cell_t *cell, circuit_t *circ, edge_connection_t *conn, crypt_path_t *layer_hint, relay_header_t *rh, int optimistic_data)
Definition: relay.c:1647
static size_t total_cells_allocated
Definition: relay.c:2687
static int32_t max_circuit_cell_queue_size_out
Definition: relay.c:3337
int relay_send_command_from_edge_(streamid_t stream_id, circuit_t *orig_circ, uint8_t relay_command, const char *payload, size_t payload_len, crypt_path_t *cpath_layer, const char *filename, int lineno)
Definition: relay.c:630
static void packed_cell_free_unchecked(packed_cell_t *cell)
Definition: relay.c:2691
static int edge_reason_is_retriable(int reason)
Definition: relay.c:847
static void circuit_resume_edge_reading(circuit_t *circ, crypt_path_t *layer_hint)
Definition: relay.c:2449
#define RELAY_PAYLOAD_LENGTH_FOR_RANDOM_SENDMES
Definition: relay.c:2248
static void set_circuit_blocked_on_chan(circuit_t *circ, channel_t *chan, int block)
Definition: relay.c:3041
STATIC void address_ttl_free_(address_ttl_t *addr)
Definition: relay.c:1161
static uint32_t get_param_max_circuit_cell_queue_size_out(const networkstatus_t *ns)
Definition: relay.c:3354
const char * relay_command_to_string(uint8_t command)
Definition: relay.c:517
#define MEMORY_PRESSURE_INTERVAL
Definition: relay.c:2885
static void set_block_state_for_streams(circuit_t *circ, edge_connection_t *stream_list, int block, streamid_t stream_id)
Definition: relay.c:3064
void cell_queue_append(cell_queue_t *queue, packed_cell_t *cell)
Definition: relay.c:2744
static int connection_ap_process_end_not_open(relay_header_t *rh, cell_t *cell, origin_circuit_t *circ, entry_connection_t *conn, crypt_path_t *layer_hint)
Definition: relay.c:862
static packed_cell_t * packed_cell_copy(const cell_t *cell, int wide_circ_ids)
Definition: relay.c:2735
int circuit_receive_relay_cell(cell_t *cell, circuit_t *circ, cell_direction_t cell_direction)
Definition: relay.c:233
int connection_edge_package_raw_inbuf(edge_connection_t *conn, int package_partial, int *max_cells)
Definition: relay.c:2320
int connection_edge_send_command(edge_connection_t *fromconn, uint8_t relay_command, const char *payload, size_t payload_len)
Definition: relay.c:785
STATIC int resolved_cell_parse(const cell_t *cell, const relay_header_t *rh, smartlist_t *addresses_out, int *errcode_out)
Definition: relay.c:1175
uint64_t stats_n_data_bytes_packaged
Definition: relay.c:2222
STATIC int connection_edge_process_resolved_cell(edge_connection_t *conn, const cell_t *cell, const relay_header_t *rh)
Definition: relay.c:1346
size_t packed_cell_mem_cost(void)
Definition: relay.c:2872
#define CELL_PADDING_GAP
Definition: relay.c:561
static time_t last_time_under_memory_pressure
Definition: relay.c:2888
static int circuit_consider_stop_edge_reading(circuit_t *circ, crypt_path_t *layer_hint)
Definition: relay.c:2654
Header file for relay.c.
Header for relay_crypto.c.
void relay_encrypt_cell_outbound(cell_t *cell, origin_circuit_t *or_circ, crypt_path_t *layer_hint)
Definition: relay_crypto.c:219
int relay_decrypt_cell(circuit_t *circ, cell_t *cell, cell_direction_t cell_direction, crypt_path_t **layer_hint, char *recognized)
Definition: relay_crypto.c:145
void relay_encrypt_cell_inbound(cell_t *cell, or_circuit_t *or_circ)
Definition: relay_crypto.c:248
void rend_process_relay_cell(circuit_t *circ, const crypt_path_t *layer_hint, int command, size_t length, const uint8_t *payload)
Definition: rendcommon.c:34
Header file for rendcommon.c.
void rep_hist_note_overload(overload_type_t overload)
Definition: rephist.c:538
Header file for rephist.c.
Router descriptor structure.
#define ROUTER_PURPOSE_GENERAL
Definition: routerinfo_st.h:98
Header file for routerlist.c.
void scheduler_channel_has_waiting_cells(channel_t *chan)
Definition: scheduler.c:548
Header file for scheduler*.c.
void sendme_connection_edge_consider_sending(edge_connection_t *conn)
Definition: sendme.c:373
void sendme_circuit_consider_sending(circuit_t *circ, crypt_path_t *layer_hint)
Definition: sendme.c:420
Header file for sendme.c.
char * smartlist_join_strings(smartlist_t *sl, const char *join, int terminate, size_t *len_out)
Definition: smartlist.c:279
void smartlist_add_all(smartlist_t *s1, const smartlist_t *s2)
smartlist_t * smartlist_new(void)
void smartlist_add(smartlist_t *sl, void *element)
#define SMARTLIST_FOREACH_BEGIN(sl, type, var)
#define SMARTLIST_FOREACH(sl, type, var, cmd)
#define SMARTLIST_DEL_CURRENT(sl, var)
Client request structure.
#define SOCKS_COMMAND_RESOLVE_PTR
Definition: cell_st.h:17
uint8_t payload[CELL_PAYLOAD_SIZE]
Definition: cell_st.h:21
uint8_t command
Definition: cell_st.h:19
circid_t circ_id
Definition: cell_st.h:18
unsigned int num_n_circuits
Definition: channel.h:410
uint64_t dirreq_id
Definition: channel.h:453
channel_usage_info_t channel_usage
Definition: channel.h:228
circuitmux_t * cmux
Definition: channel.h:397
int marked_for_close_reason
Definition: circuit_st.h:198
uint8_t state
Definition: circuit_st.h:111
unsigned int circuit_blocked_on_n_chan
Definition: circuit_st.h:92
uint16_t send_randomness_after_n_cells
Definition: circuit_st.h:128
struct create_cell_t * n_chan_create_cell
Definition: circuit_st.h:154
unsigned int circuit_blocked_on_p_chan
Definition: circuit_st.h:95
unsigned int have_sent_sufficiently_random_cell
Definition: circuit_st.h:109
uint64_t dirreq_id
Definition: circuit_st.h:205
cell_queue_t n_chan_cells
Definition: circuit_st.h:82
uint16_t marked_for_close
Definition: circuit_st.h:190
struct conflux_t * conflux
Definition: circuit_st.h:263
uint8_t purpose
Definition: circuit_st.h:112
const char * marked_for_close_file
Definition: circuit_st.h:193
int package_window
Definition: circuit_st.h:117
smartlist_t * testing_cell_stats
Definition: circuit_st.h:213
struct timeval timestamp_created
Definition: circuit_st.h:169
channel_t * n_chan
Definition: circuit_st.h:70
extend_info_t * n_hop
Definition: circuit_st.h:88
circid_t n_circ_id
Definition: circuit_st.h:79
cell_t cell
Definition: conflux.h:42
time_t timestamp_last_read_allowed
uint8_t state
Definition: connection_st.h:49
unsigned int type
Definition: connection_st.h:50
uint16_t marked_for_close
const char * marked_for_close_file
unsigned int purpose
Definition: connection_st.h:51
tor_socket_t s
struct event * read_event
extend_info_t * chosen_exit
struct crypt_path_t * cpath_layer
struct edge_connection_t * next_stream
unsigned int edge_has_sent_end
struct circuit_t * on_circuit
socks_request_t * socks_request
unsigned int chosen_exit_optional
unsigned int chosen_exit_retries
struct buf_t * pending_optimistic_data
char identity_digest[DIGEST_LEN]
created_cell_t created_cell
Definition: onion.h:68
ed25519_public_key_t identity_pk
Definition: hs_ident.h:106
uint16_t orig_virtual_port
Definition: hs_ident.h:111
Definition: node_st.h:34
uint64_t total_cell_waiting_time
Definition: or_circuit_st.h:91
channel_t * p_chan
Definition: or_circuit_st.h:37
uint32_t n_cells_discarded_at_end
Definition: or_circuit_st.h:65
circid_t p_circ_id
Definition: or_circuit_st.h:33
cell_queue_t p_chan_cells
Definition: or_circuit_st.h:35
struct or_circuit_t * rend_splice
Definition: or_circuit_st.h:58
edge_connection_t * n_streams
Definition: or_circuit_st.h:43
uint32_t processed_cells
Definition: or_circuit_st.h:86
uint64_t MaxMemInQueues
edge_connection_t * p_streams
uint8_t relay_early_commands[MAX_RELAY_EARLY_CELLS_PER_CIRCUIT]
unsigned int remaining_relay_early_cells
path_state_bitfield_t path_state
smartlist_t * prepend_policy
crypt_path_t * cpath
cpath_build_state_t * build_state
smartlist_t * half_streams
uint32_t inserted_timestamp
Definition: cell_queue_st.h:22
char body[CELL_MAX_NETWORK_SIZE]
Definition: cell_queue_st.h:21
uint16_t length
Definition: or.h:531
uint8_t command
Definition: or.h:527
streamid_t stream_id
Definition: or.h:529
uint16_t recognized
Definition: or.h:528
char integrity[4]
Definition: or.h:530
unsigned int has_finished
char address[MAX_SOCKS_ADDR_LEN]
Definition: or.h:820
uint8_t command
Definition: or.h:821
unsigned int waiting_time
Definition: or.h:826
unsigned int exitward
Definition: or.h:828
unsigned int removed
Definition: or.h:827
#define STATIC
Definition: testsupport.h:32
#define MOCK_IMPL(rv, funcname, arglist)
Definition: testsupport.h:133
#define tor_assert(expr)
Definition: util_bug.h:103