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