Add an option to disable the block-private-addresses feature
[tor/rransom.git] / src / or / or.h
blob752de219ef24b6a198f444ad28b6d9b06b6363cb
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-2011, The Tor Project, Inc. */
5 /* See LICENSE for licensing information */
7 /**
8 * \file or.h
9 * \brief Master header file for Tor-specific functionality.
10 **/
12 #ifndef _TOR_OR_H
13 #define _TOR_OR_H
15 #include "orconfig.h"
17 #ifdef __COVERITY__
18 /* If we're building for a static analysis, turn on all the off-by-default
19 * features. */
20 #ifndef INSTRUMENT_DOWNLOADS
21 #define INSTRUMENT_DOWNLOADS 1
22 #endif
23 #endif
25 #ifdef MS_WINDOWS
26 #define WIN32_WINNT 0x400
27 #define _WIN32_WINNT 0x400
28 #define WIN32_LEAN_AND_MEAN
29 #endif
31 #ifdef HAVE_UNISTD_H
32 #include <unistd.h>
33 #endif
34 #ifdef HAVE_SIGNAL_H
35 #include <signal.h>
36 #endif
37 #ifdef HAVE_NETDB_H
38 #include <netdb.h>
39 #endif
40 #ifdef HAVE_SYS_PARAM_H
41 #include <sys/param.h> /* FreeBSD needs this to know what version it is */
42 #endif
43 #include "torint.h"
44 #ifdef HAVE_SYS_WAIT_H
45 #include <sys/wait.h>
46 #endif
47 #ifdef HAVE_SYS_FCNTL_H
48 #include <sys/fcntl.h>
49 #endif
50 #ifdef HAVE_FCNTL_H
51 #include <fcntl.h>
52 #endif
53 #ifdef HAVE_SYS_IOCTL_H
54 #include <sys/ioctl.h>
55 #endif
56 #ifdef HAVE_SYS_UN_H
57 #include <sys/un.h>
58 #endif
59 #ifdef HAVE_SYS_STAT_H
60 #include <sys/stat.h>
61 #endif
62 #ifdef HAVE_NETINET_IN_H
63 #include <netinet/in.h>
64 #endif
65 #ifdef HAVE_ARPA_INET_H
66 #include <arpa/inet.h>
67 #endif
68 #ifdef HAVE_ERRNO_H
69 #include <errno.h>
70 #endif
71 #ifdef HAVE_ASSERT_H
72 #include <assert.h>
73 #endif
74 #ifdef HAVE_TIME_H
75 #include <time.h>
76 #endif
78 #ifdef MS_WINDOWS
79 #include <io.h>
80 #include <process.h>
81 #include <direct.h>
82 #include <windows.h>
83 #define snprintf _snprintf
84 #endif
86 #include "tortls.h"
87 #include "../common/torlog.h"
88 #include "container.h"
89 #include "torgzip.h"
90 #include "address.h"
91 #include "compat_libevent.h"
92 #include "ht.h"
94 /* These signals are defined to help control_signal_act work.
96 #ifndef SIGHUP
97 #define SIGHUP 1
98 #endif
99 #ifndef SIGINT
100 #define SIGINT 2
101 #endif
102 #ifndef SIGUSR1
103 #define SIGUSR1 10
104 #endif
105 #ifndef SIGUSR2
106 #define SIGUSR2 12
107 #endif
108 #ifndef SIGTERM
109 #define SIGTERM 15
110 #endif
111 /* Controller signals start at a high number so we don't
112 * conflict with system-defined signals. */
113 #define SIGNEWNYM 129
114 #define SIGCLEARDNSCACHE 130
116 #if (SIZEOF_CELL_T != 0)
117 /* On Irix, stdlib.h defines a cell_t type, so we need to make sure
118 * that our stuff always calls cell_t something different. */
119 #define cell_t tor_cell_t
120 #endif
122 /** Length of longest allowable configured nickname. */
123 #define MAX_NICKNAME_LEN 19
124 /** Length of a router identity encoded as a hexadecimal digest, plus
125 * possible dollar sign. */
126 #define MAX_HEX_NICKNAME_LEN (HEX_DIGEST_LEN+1)
127 /** Maximum length of verbose router identifier: dollar sign, hex ID digest,
128 * equal sign or tilde, nickname. */
129 #define MAX_VERBOSE_NICKNAME_LEN (1+HEX_DIGEST_LEN+1+MAX_NICKNAME_LEN)
131 /** Maximum size, in bytes, for resized buffers. */
132 #define MAX_BUF_SIZE ((1<<24)-1) /* 16MB-1 */
133 /** Maximum size, in bytes, for any directory object that we've downloaded. */
134 #define MAX_DIR_DL_SIZE MAX_BUF_SIZE
136 /** For HTTP parsing: Maximum number of bytes we'll accept in the headers
137 * of an HTTP request or response. */
138 #define MAX_HEADERS_SIZE 50000
139 /** Maximum size, in bytes, for any directory object that we're accepting
140 * as an upload. */
141 #define MAX_DIR_UL_SIZE MAX_BUF_SIZE
143 /** Maximum size, in bytes, of a single router descriptor uploaded to us
144 * as a directory authority. Caches and clients fetch whatever descriptors
145 * the authorities tell them to fetch, and don't care about size. */
146 #define MAX_DESCRIPTOR_UPLOAD_SIZE 20000
148 /** Maximum size of a single extrainfo document, as above. */
149 #define MAX_EXTRAINFO_UPLOAD_SIZE 50000
151 /** How long do we keep DNS cache entries before purging them (regardless of
152 * their TTL)? */
153 #define MAX_DNS_ENTRY_AGE (30*60)
154 /** How long do we cache/tell clients to cache DNS records when no TTL is
155 * known? */
156 #define DEFAULT_DNS_TTL (30*60)
157 /** How long can a TTL be before we stop believing it? */
158 #define MAX_DNS_TTL (3*60*60)
159 /** How small can a TTL be before we stop believing it? Provides rudimentary
160 * pinning. */
161 #define MIN_DNS_TTL 60
163 /** How often do we rotate onion keys? */
164 #define MIN_ONION_KEY_LIFETIME (7*24*60*60)
165 /** How often do we rotate TLS contexts? */
166 #define MAX_SSL_KEY_LIFETIME (2*60*60)
168 /** How old do we allow a router to get before removing it
169 * from the router list? In seconds. */
170 #define ROUTER_MAX_AGE (60*60*48)
171 /** How old can a router get before we (as a server) will no longer
172 * consider it live? In seconds. */
173 #define ROUTER_MAX_AGE_TO_PUBLISH (60*60*20)
174 /** How old do we let a saved descriptor get before force-removing it? */
175 #define OLD_ROUTER_DESC_MAX_AGE (60*60*24*5)
177 /** Possible rules for generating circuit IDs on an OR connection. */
178 typedef enum {
179 CIRC_ID_TYPE_LOWER=0, /**< Pick from 0..1<<15-1. */
180 CIRC_ID_TYPE_HIGHER=1, /**< Pick from 1<<15..1<<16-1. */
181 /** The other side of a connection is an OP: never create circuits to it,
182 * and let it use any circuit ID it wants. */
183 CIRC_ID_TYPE_NEITHER=2
184 } circ_id_type_t;
186 #define _CONN_TYPE_MIN 3
187 /** Type for sockets listening for OR connections. */
188 #define CONN_TYPE_OR_LISTENER 3
189 /** A bidirectional TLS connection transmitting a sequence of cells.
190 * May be from an OR to an OR, or from an OP to an OR. */
191 #define CONN_TYPE_OR 4
192 /** A TCP connection from an onion router to a stream's destination. */
193 #define CONN_TYPE_EXIT 5
194 /** Type for sockets listening for SOCKS connections. */
195 #define CONN_TYPE_AP_LISTENER 6
196 /** A SOCKS proxy connection from the user application to the onion
197 * proxy. */
198 #define CONN_TYPE_AP 7
199 /** Type for sockets listening for HTTP connections to the directory server. */
200 #define CONN_TYPE_DIR_LISTENER 8
201 /** Type for HTTP connections to the directory server. */
202 #define CONN_TYPE_DIR 9
203 /** Connection from the main process to a CPU worker process. */
204 #define CONN_TYPE_CPUWORKER 10
205 /** Type for listening for connections from user interface process. */
206 #define CONN_TYPE_CONTROL_LISTENER 11
207 /** Type for connections from user interface process. */
208 #define CONN_TYPE_CONTROL 12
209 /** Type for sockets listening for transparent connections redirected by pf or
210 * netfilter. */
211 #define CONN_TYPE_AP_TRANS_LISTENER 13
212 /** Type for sockets listening for transparent connections redirected by
213 * natd. */
214 #define CONN_TYPE_AP_NATD_LISTENER 14
215 /** Type for sockets listening for DNS requests. */
216 #define CONN_TYPE_AP_DNS_LISTENER 15
217 #define _CONN_TYPE_MAX 15
218 /* !!!! If _CONN_TYPE_MAX is ever over 15, we must grow the type field in
219 * connection_t. */
221 /* Proxy client types */
222 #define PROXY_NONE 0
223 #define PROXY_CONNECT 1
224 #define PROXY_SOCKS4 2
225 #define PROXY_SOCKS5 3
227 /* Proxy client handshake states */
228 #define PROXY_HTTPS_WANT_CONNECT_OK 1
229 #define PROXY_SOCKS4_WANT_CONNECT_OK 2
230 #define PROXY_SOCKS5_WANT_AUTH_METHOD_NONE 3
231 #define PROXY_SOCKS5_WANT_AUTH_METHOD_RFC1929 4
232 #define PROXY_SOCKS5_WANT_AUTH_RFC1929_OK 5
233 #define PROXY_SOCKS5_WANT_CONNECT_OK 6
234 #define PROXY_CONNECTED 7
236 /** True iff <b>x</b> is an edge connection. */
237 #define CONN_IS_EDGE(x) \
238 ((x)->type == CONN_TYPE_EXIT || (x)->type == CONN_TYPE_AP)
240 /** State for any listener connection. */
241 #define LISTENER_STATE_READY 0
243 #define _CPUWORKER_STATE_MIN 1
244 /** State for a connection to a cpuworker process that's idle. */
245 #define CPUWORKER_STATE_IDLE 1
246 /** State for a connection to a cpuworker process that's processing a
247 * handshake. */
248 #define CPUWORKER_STATE_BUSY_ONION 2
249 #define _CPUWORKER_STATE_MAX 2
251 #define CPUWORKER_TASK_ONION CPUWORKER_STATE_BUSY_ONION
253 #define _OR_CONN_STATE_MIN 1
254 /** State for a connection to an OR: waiting for connect() to finish. */
255 #define OR_CONN_STATE_CONNECTING 1
256 /** State for a connection to an OR: waiting for proxy handshake to complete */
257 #define OR_CONN_STATE_PROXY_HANDSHAKING 2
258 /** State for a connection to an OR or client: SSL is handshaking, not done
259 * yet. */
260 #define OR_CONN_STATE_TLS_HANDSHAKING 3
261 /** State for a connection to an OR: We're doing a second SSL handshake for
262 * renegotiation purposes. */
263 #define OR_CONN_STATE_TLS_CLIENT_RENEGOTIATING 4
264 /** State for a connection at an OR: We're waiting for the client to
265 * renegotiate. */
266 #define OR_CONN_STATE_TLS_SERVER_RENEGOTIATING 5
267 /** State for a connection to an OR: We're done with our SSL handshake, but we
268 * haven't yet negotiated link protocol versions and sent a netinfo cell.
270 #define OR_CONN_STATE_OR_HANDSHAKING 6
271 /** State for a connection to an OR: Ready to send/receive cells. */
272 #define OR_CONN_STATE_OPEN 7
273 #define _OR_CONN_STATE_MAX 7
275 #define _EXIT_CONN_STATE_MIN 1
276 /** State for an exit connection: waiting for response from DNS farm. */
277 #define EXIT_CONN_STATE_RESOLVING 1
278 /** State for an exit connection: waiting for connect() to finish. */
279 #define EXIT_CONN_STATE_CONNECTING 2
280 /** State for an exit connection: open and ready to transmit data. */
281 #define EXIT_CONN_STATE_OPEN 3
282 /** State for an exit connection: waiting to be removed. */
283 #define EXIT_CONN_STATE_RESOLVEFAILED 4
284 #define _EXIT_CONN_STATE_MAX 4
286 /* The AP state values must be disjoint from the EXIT state values. */
287 #define _AP_CONN_STATE_MIN 5
288 /** State for a SOCKS connection: waiting for SOCKS request. */
289 #define AP_CONN_STATE_SOCKS_WAIT 5
290 /** State for a SOCKS connection: got a y.onion URL; waiting to receive
291 * rendezvous descriptor. */
292 #define AP_CONN_STATE_RENDDESC_WAIT 6
293 /** The controller will attach this connection to a circuit; it isn't our
294 * job to do so. */
295 #define AP_CONN_STATE_CONTROLLER_WAIT 7
296 /** State for a SOCKS connection: waiting for a completed circuit. */
297 #define AP_CONN_STATE_CIRCUIT_WAIT 8
298 /** State for a SOCKS connection: sent BEGIN, waiting for CONNECTED. */
299 #define AP_CONN_STATE_CONNECT_WAIT 9
300 /** State for a SOCKS connection: sent RESOLVE, waiting for RESOLVED. */
301 #define AP_CONN_STATE_RESOLVE_WAIT 10
302 /** State for a SOCKS connection: ready to send and receive. */
303 #define AP_CONN_STATE_OPEN 11
304 /** State for a transparent natd connection: waiting for original
305 * destination. */
306 #define AP_CONN_STATE_NATD_WAIT 12
307 #define _AP_CONN_STATE_MAX 12
309 /** True iff the AP_CONN_STATE_* value <b>s</b> means that the corresponding
310 * edge connection is not attached to any circuit. */
311 #define AP_CONN_STATE_IS_UNATTACHED(s) \
312 ((s) <= AP_CONN_STATE_CIRCUIT_WAIT || (s) == AP_CONN_STATE_NATD_WAIT)
314 #define _DIR_CONN_STATE_MIN 1
315 /** State for connection to directory server: waiting for connect(). */
316 #define DIR_CONN_STATE_CONNECTING 1
317 /** State for connection to directory server: sending HTTP request. */
318 #define DIR_CONN_STATE_CLIENT_SENDING 2
319 /** State for connection to directory server: reading HTTP response. */
320 #define DIR_CONN_STATE_CLIENT_READING 3
321 /** State for connection to directory server: happy and finished. */
322 #define DIR_CONN_STATE_CLIENT_FINISHED 4
323 /** State for connection at directory server: waiting for HTTP request. */
324 #define DIR_CONN_STATE_SERVER_COMMAND_WAIT 5
325 /** State for connection at directory server: sending HTTP response. */
326 #define DIR_CONN_STATE_SERVER_WRITING 6
327 #define _DIR_CONN_STATE_MAX 6
329 /** True iff the purpose of <b>conn</b> means that it's a server-side
330 * directory connection. */
331 #define DIR_CONN_IS_SERVER(conn) ((conn)->purpose == DIR_PURPOSE_SERVER)
333 #define _CONTROL_CONN_STATE_MIN 1
334 /** State for a control connection: Authenticated and accepting v1 commands. */
335 #define CONTROL_CONN_STATE_OPEN 1
336 /** State for a control connection: Waiting for authentication; speaking
337 * protocol v1. */
338 #define CONTROL_CONN_STATE_NEEDAUTH 2
339 #define _CONTROL_CONN_STATE_MAX 2
341 #define _DIR_PURPOSE_MIN 3
342 /** A connection to a directory server: download a rendezvous
343 * descriptor. */
344 #define DIR_PURPOSE_FETCH_RENDDESC 3
345 /** A connection to a directory server: set after a rendezvous
346 * descriptor is downloaded. */
347 #define DIR_PURPOSE_HAS_FETCHED_RENDDESC 4
348 /** A connection to a directory server: download one or more v2
349 * network-status objects */
350 #define DIR_PURPOSE_FETCH_V2_NETWORKSTATUS 5
351 /** A connection to a directory server: download one or more server
352 * descriptors. */
353 #define DIR_PURPOSE_FETCH_SERVERDESC 6
354 /** A connection to a directory server: download one or more extra-info
355 * documents. */
356 #define DIR_PURPOSE_FETCH_EXTRAINFO 7
357 /** A connection to a directory server: upload a server descriptor. */
358 #define DIR_PURPOSE_UPLOAD_DIR 8
359 /** A connection to a directory server: upload a rendezvous
360 * descriptor. */
361 #define DIR_PURPOSE_UPLOAD_RENDDESC 9
362 /** A connection to a directory server: upload a v3 networkstatus vote. */
363 #define DIR_PURPOSE_UPLOAD_VOTE 10
364 /** A connection to a directory server: upload a v3 consensus signature */
365 #define DIR_PURPOSE_UPLOAD_SIGNATURES 11
366 /** A connection to a directory server: download one or more v3 networkstatus
367 * votes. */
368 #define DIR_PURPOSE_FETCH_STATUS_VOTE 12
369 /** A connection to a directory server: download a v3 detached signatures
370 * object for a consensus. */
371 #define DIR_PURPOSE_FETCH_DETACHED_SIGNATURES 13
372 /** A connection to a directory server: download a v3 networkstatus
373 * consensus. */
374 #define DIR_PURPOSE_FETCH_CONSENSUS 14
375 /** A connection to a directory server: download one or more directory
376 * authority certificates. */
377 #define DIR_PURPOSE_FETCH_CERTIFICATE 15
379 /** Purpose for connection at a directory server. */
380 #define DIR_PURPOSE_SERVER 16
381 /** A connection to a hidden service directory server: upload a v2 rendezvous
382 * descriptor. */
383 #define DIR_PURPOSE_UPLOAD_RENDDESC_V2 17
384 /** A connection to a hidden service directory server: download a v2 rendezvous
385 * descriptor. */
386 #define DIR_PURPOSE_FETCH_RENDDESC_V2 18
387 #define _DIR_PURPOSE_MAX 18
389 /** True iff <b>p</b> is a purpose corresponding to uploading data to a
390 * directory server. */
391 #define DIR_PURPOSE_IS_UPLOAD(p) \
392 ((p)==DIR_PURPOSE_UPLOAD_DIR || \
393 (p)==DIR_PURPOSE_UPLOAD_RENDDESC || \
394 (p)==DIR_PURPOSE_UPLOAD_VOTE || \
395 (p)==DIR_PURPOSE_UPLOAD_SIGNATURES)
397 #define _EXIT_PURPOSE_MIN 1
398 /** This exit stream wants to do an ordinary connect. */
399 #define EXIT_PURPOSE_CONNECT 1
400 /** This exit stream wants to do a resolve (either normal or reverse). */
401 #define EXIT_PURPOSE_RESOLVE 2
402 #define _EXIT_PURPOSE_MAX 2
404 /* !!!! If any connection purpose is ever over 31, we must grow the type
405 * field in connection_t. */
407 /** Circuit state: I'm the origin, still haven't done all my handshakes. */
408 #define CIRCUIT_STATE_BUILDING 0
409 /** Circuit state: Waiting to process the onionskin. */
410 #define CIRCUIT_STATE_ONIONSKIN_PENDING 1
411 /** Circuit state: I'd like to deliver a create, but my n_conn is still
412 * connecting. */
413 #define CIRCUIT_STATE_OR_WAIT 2
414 /** Circuit state: onionskin(s) processed, ready to send/receive cells. */
415 #define CIRCUIT_STATE_OPEN 3
417 #define _CIRCUIT_PURPOSE_MIN 1
419 /* these circuits were initiated elsewhere */
420 #define _CIRCUIT_PURPOSE_OR_MIN 1
421 /** OR-side circuit purpose: normal circuit, at OR. */
422 #define CIRCUIT_PURPOSE_OR 1
423 /** OR-side circuit purpose: At OR, from Bob, waiting for intro from Alices. */
424 #define CIRCUIT_PURPOSE_INTRO_POINT 2
425 /** OR-side circuit purpose: At OR, from Alice, waiting for Bob. */
426 #define CIRCUIT_PURPOSE_REND_POINT_WAITING 3
427 /** OR-side circuit purpose: At OR, both circuits have this purpose. */
428 #define CIRCUIT_PURPOSE_REND_ESTABLISHED 4
429 #define _CIRCUIT_PURPOSE_OR_MAX 4
431 /* these circuits originate at this node */
433 /* here's how circ client-side purposes work:
434 * normal circuits are C_GENERAL.
435 * circuits that are c_introducing are either on their way to
436 * becoming open, or they are open and waiting for a
437 * suitable rendcirc before they send the intro.
438 * circuits that are c_introduce_ack_wait have sent the intro,
439 * but haven't gotten a response yet.
440 * circuits that are c_establish_rend are either on their way
441 * to becoming open, or they are open and have sent the
442 * establish_rendezvous cell but haven't received an ack.
443 * circuits that are c_rend_ready are open and have received a
444 * rend ack, but haven't heard from bob yet. if they have a
445 * buildstate->pending_final_cpath then they're expecting a
446 * cell from bob, else they're not.
447 * circuits that are c_rend_ready_intro_acked are open, and
448 * some intro circ has sent its intro and received an ack.
449 * circuits that are c_rend_joined are open, have heard from
450 * bob, and are talking to him.
452 /** Client-side circuit purpose: Normal circuit, with cpath. */
453 #define CIRCUIT_PURPOSE_C_GENERAL 5
454 /** Client-side circuit purpose: at Alice, connecting to intro point. */
455 #define CIRCUIT_PURPOSE_C_INTRODUCING 6
456 /** Client-side circuit purpose: at Alice, sent INTRODUCE1 to intro point,
457 * waiting for ACK/NAK. */
458 #define CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT 7
459 /** Client-side circuit purpose: at Alice, introduced and acked, closing. */
460 #define CIRCUIT_PURPOSE_C_INTRODUCE_ACKED 8
461 /** Client-side circuit purpose: at Alice, waiting for ack. */
462 #define CIRCUIT_PURPOSE_C_ESTABLISH_REND 9
463 /** Client-side circuit purpose: at Alice, waiting for Bob. */
464 #define CIRCUIT_PURPOSE_C_REND_READY 10
465 /** Client-side circuit purpose: at Alice, waiting for Bob, INTRODUCE
466 * has been acknowledged. */
467 #define CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED 11
468 /** Client-side circuit purpose: at Alice, rendezvous established. */
469 #define CIRCUIT_PURPOSE_C_REND_JOINED 12
470 /** This circuit is used for build time measurement only */
471 #define CIRCUIT_PURPOSE_C_MEASURE_TIMEOUT 13
472 #define _CIRCUIT_PURPOSE_C_MAX 13
473 /** Hidden-service-side circuit purpose: at Bob, waiting for introductions. */
474 #define CIRCUIT_PURPOSE_S_ESTABLISH_INTRO 14
475 /** Hidden-service-side circuit purpose: at Bob, successfully established
476 * intro. */
477 #define CIRCUIT_PURPOSE_S_INTRO 15
478 /** Hidden-service-side circuit purpose: at Bob, connecting to rend point. */
479 #define CIRCUIT_PURPOSE_S_CONNECT_REND 16
480 /** Hidden-service-side circuit purpose: at Bob, rendezvous established. */
481 #define CIRCUIT_PURPOSE_S_REND_JOINED 17
482 /** A testing circuit; not meant to be used for actual traffic. */
483 #define CIRCUIT_PURPOSE_TESTING 18
484 /** A controller made this circuit and Tor should not use it. */
485 #define CIRCUIT_PURPOSE_CONTROLLER 19
486 #define _CIRCUIT_PURPOSE_MAX 19
487 /** A catch-all for unrecognized purposes. Currently we don't expect
488 * to make or see any circuits with this purpose. */
489 #define CIRCUIT_PURPOSE_UNKNOWN 255
491 /** True iff the circuit purpose <b>p</b> is for a circuit that
492 * originated at this node. */
493 #define CIRCUIT_PURPOSE_IS_ORIGIN(p) ((p)>_CIRCUIT_PURPOSE_OR_MAX)
494 /** True iff the circuit purpose <b>p</b> is for a circuit that originated
495 * here to serve as a client. (Hidden services don't count here.) */
496 #define CIRCUIT_PURPOSE_IS_CLIENT(p) \
497 ((p)> _CIRCUIT_PURPOSE_OR_MAX && \
498 (p)<=_CIRCUIT_PURPOSE_C_MAX)
499 /** True iff the circuit_t <b>c</b> is actually an origin_circuit_t. */
500 #define CIRCUIT_IS_ORIGIN(c) (CIRCUIT_PURPOSE_IS_ORIGIN((c)->purpose))
501 /** True iff the circuit purpose <b>p</b> is for an established rendezvous
502 * circuit. */
503 #define CIRCUIT_PURPOSE_IS_ESTABLISHED_REND(p) \
504 ((p) == CIRCUIT_PURPOSE_C_REND_JOINED || \
505 (p) == CIRCUIT_PURPOSE_S_REND_JOINED)
507 /** How many circuits do we want simultaneously in-progress to handle
508 * a given stream? */
509 #define MIN_CIRCUITS_HANDLING_STREAM 2
511 /* These RELAY_COMMAND constants define values for relay cell commands, and
512 * must match those defined in tor-spec.txt. */
513 #define RELAY_COMMAND_BEGIN 1
514 #define RELAY_COMMAND_DATA 2
515 #define RELAY_COMMAND_END 3
516 #define RELAY_COMMAND_CONNECTED 4
517 #define RELAY_COMMAND_SENDME 5
518 #define RELAY_COMMAND_EXTEND 6
519 #define RELAY_COMMAND_EXTENDED 7
520 #define RELAY_COMMAND_TRUNCATE 8
521 #define RELAY_COMMAND_TRUNCATED 9
522 #define RELAY_COMMAND_DROP 10
523 #define RELAY_COMMAND_RESOLVE 11
524 #define RELAY_COMMAND_RESOLVED 12
525 #define RELAY_COMMAND_BEGIN_DIR 13
527 #define RELAY_COMMAND_ESTABLISH_INTRO 32
528 #define RELAY_COMMAND_ESTABLISH_RENDEZVOUS 33
529 #define RELAY_COMMAND_INTRODUCE1 34
530 #define RELAY_COMMAND_INTRODUCE2 35
531 #define RELAY_COMMAND_RENDEZVOUS1 36
532 #define RELAY_COMMAND_RENDEZVOUS2 37
533 #define RELAY_COMMAND_INTRO_ESTABLISHED 38
534 #define RELAY_COMMAND_RENDEZVOUS_ESTABLISHED 39
535 #define RELAY_COMMAND_INTRODUCE_ACK 40
537 /* Reasons why an OR connection is closed. */
538 #define END_OR_CONN_REASON_DONE 1
539 #define END_OR_CONN_REASON_REFUSED 2 /* connection refused */
540 #define END_OR_CONN_REASON_OR_IDENTITY 3
541 #define END_OR_CONN_REASON_CONNRESET 4 /* connection reset by peer */
542 #define END_OR_CONN_REASON_TIMEOUT 5
543 #define END_OR_CONN_REASON_NO_ROUTE 6 /* no route to host/net */
544 #define END_OR_CONN_REASON_IO_ERROR 7 /* read/write error */
545 #define END_OR_CONN_REASON_RESOURCE_LIMIT 8 /* sockets, buffers, etc */
546 #define END_OR_CONN_REASON_MISC 9
548 /* Reasons why we (or a remote OR) might close a stream. See tor-spec.txt for
549 * documentation of these. The values must match. */
550 #define END_STREAM_REASON_MISC 1
551 #define END_STREAM_REASON_RESOLVEFAILED 2
552 #define END_STREAM_REASON_CONNECTREFUSED 3
553 #define END_STREAM_REASON_EXITPOLICY 4
554 #define END_STREAM_REASON_DESTROY 5
555 #define END_STREAM_REASON_DONE 6
556 #define END_STREAM_REASON_TIMEOUT 7
557 #define END_STREAM_REASON_NOROUTE 8
558 #define END_STREAM_REASON_HIBERNATING 9
559 #define END_STREAM_REASON_INTERNAL 10
560 #define END_STREAM_REASON_RESOURCELIMIT 11
561 #define END_STREAM_REASON_CONNRESET 12
562 #define END_STREAM_REASON_TORPROTOCOL 13
563 #define END_STREAM_REASON_NOTDIRECTORY 14
564 #define END_STREAM_REASON_ENTRYPOLICY 15
566 /* These high-numbered end reasons are not part of the official spec,
567 * and are not intended to be put in relay end cells. They are here
568 * to be more informative when sending back socks replies to the
569 * application. */
570 /* XXXX 256 is no longer used; feel free to reuse it. */
571 /** We were unable to attach the connection to any circuit at all. */
572 /* XXXX the ways we use this one don't make a lot of sense. */
573 #define END_STREAM_REASON_CANT_ATTACH 257
574 /** We can't connect to any directories at all, so we killed our streams
575 * before they can time out. */
576 #define END_STREAM_REASON_NET_UNREACHABLE 258
577 /** This is a SOCKS connection, and the client used (or misused) the SOCKS
578 * protocol in a way we couldn't handle. */
579 #define END_STREAM_REASON_SOCKSPROTOCOL 259
580 /** This is a transparent proxy connection, but we can't extract the original
581 * target address:port. */
582 #define END_STREAM_REASON_CANT_FETCH_ORIG_DEST 260
583 /** This is a connection on the NATD port, and the destination IP:Port was
584 * either ill-formed or out-of-range. */
585 #define END_STREAM_REASON_INVALID_NATD_DEST 261
586 /** The target address is in a private network (like 127.0.0.1 or 10.0.0.1);
587 * you don't want to do that over a randomly chosen exit */
588 #define END_STREAM_REASON_PRIVATE_ADDR 262
590 /** Bitwise-and this value with endreason to mask out all flags. */
591 #define END_STREAM_REASON_MASK 511
593 /** Bitwise-or this with the argument to control_event_stream_status
594 * to indicate that the reason came from an END cell. */
595 #define END_STREAM_REASON_FLAG_REMOTE 512
596 /** Bitwise-or this with the argument to control_event_stream_status
597 * to indicate that we already sent a CLOSED stream event. */
598 #define END_STREAM_REASON_FLAG_ALREADY_SENT_CLOSED 1024
599 /** Bitwise-or this with endreason to indicate that we already sent
600 * a socks reply, and no further reply needs to be sent from
601 * connection_mark_unattached_ap(). */
602 #define END_STREAM_REASON_FLAG_ALREADY_SOCKS_REPLIED 2048
604 /** Reason for remapping an AP connection's address: we have a cached
605 * answer. */
606 #define REMAP_STREAM_SOURCE_CACHE 1
607 /** Reason for remapping an AP connection's address: the exit node told us an
608 * answer. */
609 #define REMAP_STREAM_SOURCE_EXIT 2
611 /* 'type' values to use in RESOLVED cells. Specified in tor-spec.txt. */
612 #define RESOLVED_TYPE_HOSTNAME 0
613 #define RESOLVED_TYPE_IPV4 4
614 #define RESOLVED_TYPE_IPV6 6
615 #define RESOLVED_TYPE_ERROR_TRANSIENT 0xF0
616 #define RESOLVED_TYPE_ERROR 0xF1
618 /* Negative reasons are internal: we never send them in a DESTROY or TRUNCATE
619 * call; they only go to the controller for tracking */
620 /** Our post-timeout circuit time measurement period expired.
621 * We must give up now */
622 #define END_CIRC_REASON_MEASUREMENT_EXPIRED -3
624 /** We couldn't build a path for this circuit. */
625 #define END_CIRC_REASON_NOPATH -2
626 /** Catch-all "other" reason for closing origin circuits. */
627 #define END_CIRC_AT_ORIGIN -1
629 /* Reasons why we (or a remote OR) might close a circuit. See tor-spec.txt for
630 * documentation of these. */
631 #define _END_CIRC_REASON_MIN 0
632 #define END_CIRC_REASON_NONE 0
633 #define END_CIRC_REASON_TORPROTOCOL 1
634 #define END_CIRC_REASON_INTERNAL 2
635 #define END_CIRC_REASON_REQUESTED 3
636 #define END_CIRC_REASON_HIBERNATING 4
637 #define END_CIRC_REASON_RESOURCELIMIT 5
638 #define END_CIRC_REASON_CONNECTFAILED 6
639 #define END_CIRC_REASON_OR_IDENTITY 7
640 #define END_CIRC_REASON_OR_CONN_CLOSED 8
641 #define END_CIRC_REASON_FINISHED 9
642 #define END_CIRC_REASON_TIMEOUT 10
643 #define END_CIRC_REASON_DESTROYED 11
644 #define END_CIRC_REASON_NOSUCHSERVICE 12
645 #define _END_CIRC_REASON_MAX 12
647 /** Bitwise-OR this with the argument to circuit_mark_for_close() or
648 * control_event_circuit_status() to indicate that the reason was
649 * passed through from a destroy or truncate cell. */
650 #define END_CIRC_REASON_FLAG_REMOTE 512
652 /** Length of 'y' portion of 'y.onion' URL. */
653 #define REND_SERVICE_ID_LEN_BASE32 16
655 /** Length of 'y.onion' including '.onion' URL. */
656 #define REND_SERVICE_ADDRESS_LEN (16+1+5)
658 /** Length of a binary-encoded rendezvous service ID. */
659 #define REND_SERVICE_ID_LEN 10
661 /** Time period for which a v2 descriptor will be valid. */
662 #define REND_TIME_PERIOD_V2_DESC_VALIDITY (24*60*60)
664 /** Time period within which two sets of v2 descriptors will be uploaded in
665 * parallel. */
666 #define REND_TIME_PERIOD_OVERLAPPING_V2_DESCS (60*60)
668 /** Number of non-consecutive replicas (i.e. distributed somewhere
669 * in the ring) for a descriptor. */
670 #define REND_NUMBER_OF_NON_CONSECUTIVE_REPLICAS 2
672 /** Number of consecutive replicas for a descriptor. */
673 #define REND_NUMBER_OF_CONSECUTIVE_REPLICAS 3
675 /** Length of v2 descriptor ID (32 base32 chars = 160 bits). */
676 #define REND_DESC_ID_V2_LEN_BASE32 32
678 /** Length of the base32-encoded secret ID part of versioned hidden service
679 * descriptors. */
680 #define REND_SECRET_ID_PART_LEN_BASE32 32
682 /** Length of the base32-encoded hash of an introduction point's
683 * identity key. */
684 #define REND_INTRO_POINT_ID_LEN_BASE32 32
686 /** Length of the descriptor cookie that is used for client authorization
687 * to hidden services. */
688 #define REND_DESC_COOKIE_LEN 16
690 /** Length of the base64-encoded descriptor cookie that is used for
691 * exchanging client authorization between hidden service and client. */
692 #define REND_DESC_COOKIE_LEN_BASE64 22
694 /** Length of client identifier in encrypted introduction points for hidden
695 * service authorization type 'basic'. */
696 #define REND_BASIC_AUTH_CLIENT_ID_LEN 4
698 /** Multiple of the number of clients to which the real number of clients
699 * is padded with fake clients for hidden service authorization type
700 * 'basic'. */
701 #define REND_BASIC_AUTH_CLIENT_MULTIPLE 16
703 /** Length of client entry consisting of client identifier and encrypted
704 * session key for hidden service authorization type 'basic'. */
705 #define REND_BASIC_AUTH_CLIENT_ENTRY_LEN (REND_BASIC_AUTH_CLIENT_ID_LEN \
706 + CIPHER_KEY_LEN)
708 /** Maximum size of v2 hidden service descriptors. */
709 #define REND_DESC_MAX_SIZE (20 * 1024)
711 /** Legal characters for use in authorized client names for a hidden
712 * service. */
713 #define REND_LEGAL_CLIENTNAME_CHARACTERS \
714 "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789+-_"
716 /** Maximum length of authorized client names for a hidden service. */
717 #define REND_CLIENTNAME_MAX_LEN 16
719 /** Length of the rendezvous cookie that is used to connect circuits at the
720 * rendezvous point. */
721 #define REND_COOKIE_LEN DIGEST_LEN
723 /** Client authorization type that a hidden service performs. */
724 typedef enum rend_auth_type_t {
725 REND_NO_AUTH = 0,
726 REND_BASIC_AUTH = 1,
727 REND_STEALTH_AUTH = 2,
728 } rend_auth_type_t;
730 /** Client-side configuration of authorization for a hidden service. */
731 typedef struct rend_service_authorization_t {
732 char descriptor_cookie[REND_DESC_COOKIE_LEN];
733 char onion_address[REND_SERVICE_ADDRESS_LEN+1];
734 rend_auth_type_t auth_type;
735 } rend_service_authorization_t;
737 /** Client- and server-side data that is used for hidden service connection
738 * establishment. Not all fields contain data depending on where this struct
739 * is used. */
740 typedef struct rend_data_t {
741 /** Onion address (without the .onion part) that a client requests. */
742 char onion_address[REND_SERVICE_ID_LEN_BASE32+1];
744 /** (Optional) descriptor cookie that is used by a client. */
745 char descriptor_cookie[REND_DESC_COOKIE_LEN];
747 /** Authorization type for accessing a service used by a client. */
748 rend_auth_type_t auth_type;
750 /** Hash of the hidden service's PK used by a service. */
751 char rend_pk_digest[DIGEST_LEN];
753 /** Rendezvous cookie used by both, client and service. */
754 char rend_cookie[REND_COOKIE_LEN];
755 } rend_data_t;
757 /** Time interval for tracking possible replays of INTRODUCE2 cells.
758 * Incoming cells with timestamps half of this interval in the past or
759 * future are dropped immediately. */
760 #define REND_REPLAY_TIME_INTERVAL (60 * 60)
762 /** Used to indicate which way a cell is going on a circuit. */
763 typedef enum {
764 CELL_DIRECTION_IN=1, /**< The cell is moving towards the origin. */
765 CELL_DIRECTION_OUT=2, /**< The cell is moving away from the origin. */
766 } cell_direction_t;
768 /** Initial value for both sides of a circuit transmission window when the
769 * circuit is initialized. Measured in cells. */
770 #define CIRCWINDOW_START 1000
771 #define CIRCWINDOW_START_MIN 100
772 #define CIRCWINDOW_START_MAX 1000
773 /** Amount to increment a circuit window when we get a circuit SENDME. */
774 #define CIRCWINDOW_INCREMENT 100
775 /** Initial value on both sides of a stream transmission window when the
776 * stream is initialized. Measured in cells. */
777 #define STREAMWINDOW_START 500
778 /** Amount to increment a stream window when we get a stream SENDME. */
779 #define STREAMWINDOW_INCREMENT 50
781 /* Cell commands. These values are defined in tor-spec.txt. */
782 #define CELL_PADDING 0
783 #define CELL_CREATE 1
784 #define CELL_CREATED 2
785 #define CELL_RELAY 3
786 #define CELL_DESTROY 4
787 #define CELL_CREATE_FAST 5
788 #define CELL_CREATED_FAST 6
789 #define CELL_VERSIONS 7
790 #define CELL_NETINFO 8
791 #define CELL_RELAY_EARLY 9
793 /** True iff the cell command <b>x</b> is one that implies a variable-length
794 * cell. */
795 #define CELL_COMMAND_IS_VAR_LENGTH(x) ((x) == CELL_VERSIONS)
797 /** How long to test reachability before complaining to the user. */
798 #define TIMEOUT_UNTIL_UNREACHABILITY_COMPLAINT (20*60)
800 /** Legal characters in a nickname. */
801 #define LEGAL_NICKNAME_CHARACTERS \
802 "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"
804 /** Name to use in client TLS certificates if no nickname is given. Once
805 * Tor 0.1.2.x is obsolete, we can remove this. */
806 #define DEFAULT_CLIENT_NICKNAME "client"
808 /** Number of bytes in a SOCKS4 header. */
809 #define SOCKS4_NETWORK_LEN 8
812 * Relay payload:
813 * Relay command [1 byte]
814 * Recognized [2 bytes]
815 * Stream ID [2 bytes]
816 * Partial SHA-1 [4 bytes]
817 * Length [2 bytes]
818 * Relay payload [498 bytes]
821 /** Number of bytes in a cell, minus cell header. */
822 #define CELL_PAYLOAD_SIZE 509
823 /** Number of bytes in a cell transmitted over the network. */
824 #define CELL_NETWORK_SIZE 512
826 /** Length of a header on a variable-length cell. */
827 #define VAR_CELL_HEADER_SIZE 5
829 /** Number of bytes in a relay cell's header (not including general cell
830 * header). */
831 #define RELAY_HEADER_SIZE (1+2+2+4+2)
832 /** Largest number of bytes that can fit in a relay cell payload. */
833 #define RELAY_PAYLOAD_SIZE (CELL_PAYLOAD_SIZE-RELAY_HEADER_SIZE)
835 /** Identifies a circuit on an or_connection */
836 typedef uint16_t circid_t;
837 /** Identifies a stream on a circuit */
838 typedef uint16_t streamid_t;
840 /** Parsed onion routing cell. All communication between nodes
841 * is via cells. */
842 typedef struct cell_t {
843 circid_t circ_id; /**< Circuit which received the cell. */
844 uint8_t command; /**< Type of the cell: one of CELL_PADDING, CELL_CREATE,
845 * CELL_DESTROY, etc */
846 uint8_t payload[CELL_PAYLOAD_SIZE]; /**< Cell body. */
847 } cell_t;
849 /** Parsed variable-length onion routing cell. */
850 typedef struct var_cell_t {
851 uint8_t command;
852 circid_t circ_id;
853 uint16_t payload_len;
854 uint8_t payload[1];
855 } var_cell_t;
857 /** A cell as packed for writing to the network. */
858 typedef struct packed_cell_t {
859 struct packed_cell_t *next; /**< Next cell queued on this circuit. */
860 char body[CELL_NETWORK_SIZE]; /**< Cell as packed for network. */
861 } packed_cell_t;
863 /** Number of cells added to a circuit queue including their insertion
864 * time on 10 millisecond detail; used for buffer statistics. */
865 typedef struct insertion_time_elem_t {
866 struct insertion_time_elem_t *next; /**< Next element in queue. */
867 uint32_t insertion_time; /**< When were cells inserted (in 10 ms steps
868 * starting at 0:00 of the current day)? */
869 unsigned counter; /**< How many cells were inserted? */
870 } insertion_time_elem_t;
872 /** Queue of insertion times. */
873 typedef struct insertion_time_queue_t {
874 struct insertion_time_elem_t *first; /**< First element in queue. */
875 struct insertion_time_elem_t *last; /**< Last element in queue. */
876 } insertion_time_queue_t;
878 /** A queue of cells on a circuit, waiting to be added to the
879 * or_connection_t's outbuf. */
880 typedef struct cell_queue_t {
881 packed_cell_t *head; /**< The first cell, or NULL if the queue is empty. */
882 packed_cell_t *tail; /**< The last cell, or NULL if the queue is empty. */
883 int n; /**< The number of cells in the queue. */
884 insertion_time_queue_t *insertion_times; /**< Insertion times of cells. */
885 } cell_queue_t;
887 /** Beginning of a RELAY cell payload. */
888 typedef struct {
889 uint8_t command; /**< The end-to-end relay command. */
890 uint16_t recognized; /**< Used to tell whether cell is for us. */
891 streamid_t stream_id; /**< Which stream is this cell associated with? */
892 char integrity[4]; /**< Used to tell whether cell is corrupted. */
893 uint16_t length; /**< How long is the payload body? */
894 } relay_header_t;
896 typedef struct buf_t buf_t;
897 typedef struct socks_request_t socks_request_t;
899 /* Values for connection_t.magic: used to make sure that downcasts (casts from
900 * connection_t to foo_connection_t) are safe. */
901 #define BASE_CONNECTION_MAGIC 0x7C3C304Eu
902 #define OR_CONNECTION_MAGIC 0x7D31FF03u
903 #define EDGE_CONNECTION_MAGIC 0xF0374013u
904 #define DIR_CONNECTION_MAGIC 0x9988ffeeu
905 #define CONTROL_CONNECTION_MAGIC 0x8abc765du
907 /** Description of a connection to another host or process, and associated
908 * data.
910 * A connection is named based on what it's connected to -- an "OR
911 * connection" has a Tor node on the other end, an "exit
912 * connection" has a website or other server on the other end, and an
913 * "AP connection" has an application proxy (and thus a user) on the
914 * other end.
916 * Every connection has a type and a state. Connections never change
917 * their type, but can go through many state changes in their lifetime.
919 * Every connection has two associated input and output buffers.
920 * Listeners don't use them. For non-listener connections, incoming
921 * data is appended to conn->inbuf, and outgoing data is taken from
922 * conn->outbuf. Connections differ primarily in the functions called
923 * to fill and drain these buffers.
925 typedef struct connection_t {
926 uint32_t magic; /**< For memory debugging: must equal one of
927 * *_CONNECTION_MAGIC. */
929 uint8_t state; /**< Current state of this connection. */
930 unsigned int type:4; /**< What kind of connection is this? */
931 unsigned int purpose:5; /**< Only used for DIR and EXIT types currently. */
933 /* The next fields are all one-bit booleans. Some are only applicable to
934 * connection subtypes, but we hold them here anyway, to save space.
936 unsigned int read_blocked_on_bw:1; /**< Boolean: should we start reading
937 * again once the bandwidth throttler allows it? */
938 unsigned int write_blocked_on_bw:1; /**< Boolean: should we start writing
939 * again once the bandwidth throttler allows
940 * writes? */
941 unsigned int hold_open_until_flushed:1; /**< Despite this connection's being
942 * marked for close, do we flush it
943 * before closing it? */
944 unsigned int inbuf_reached_eof:1; /**< Boolean: did read() return 0 on this
945 * conn? */
946 /** Set to 1 when we're inside connection_flushed_some to keep us from
947 * calling connection_handle_write() recursively. */
948 unsigned int in_flushed_some:1;
950 /* For linked connections:
952 unsigned int linked:1; /**< True if there is, or has been, a linked_conn. */
953 /** True iff we'd like to be notified about read events from the
954 * linked conn. */
955 unsigned int reading_from_linked_conn:1;
956 /** True iff we're willing to write to the linked conn. */
957 unsigned int writing_to_linked_conn:1;
958 /** True iff we're currently able to read on the linked conn, and our
959 * read_event should be made active with libevent. */
960 unsigned int active_on_link:1;
961 /** True iff we've called connection_close_immediate() on this linked
962 * connection. */
963 unsigned int linked_conn_is_closed:1;
965 /** CONNECT/SOCKS proxy client handshake state (for outgoing connections). */
966 unsigned int proxy_state:4;
968 /** Our socket; -1 if this connection is closed, or has no socket. */
969 evutil_socket_t s;
970 int conn_array_index; /**< Index into the global connection array. */
971 struct event *read_event; /**< Libevent event structure. */
972 struct event *write_event; /**< Libevent event structure. */
973 buf_t *inbuf; /**< Buffer holding data read over this connection. */
974 buf_t *outbuf; /**< Buffer holding data to write over this connection. */
975 size_t outbuf_flushlen; /**< How much data should we try to flush from the
976 * outbuf? */
977 time_t timestamp_lastread; /**< When was the last time libevent said we could
978 * read? */
979 time_t timestamp_lastwritten; /**< When was the last time libevent said we
980 * could write? */
981 time_t timestamp_created; /**< When was this connection_t created? */
983 /* XXXX_IP6 make this IPv6-capable */
984 int socket_family; /**< Address family of this connection's socket. Usually
985 * AF_INET, but it can also be AF_UNIX, or in the future
986 * AF_INET6 */
987 tor_addr_t addr; /**< IP of the other side of the connection; used to
988 * identify routers, along with port. */
989 uint16_t port; /**< If non-zero, port on the other end
990 * of the connection. */
991 uint16_t marked_for_close; /**< Should we close this conn on the next
992 * iteration of the main loop? (If true, holds
993 * the line number where this connection was
994 * marked.) */
995 const char *marked_for_close_file; /**< For debugging: in which file were
996 * we marked for close? */
997 char *address; /**< FQDN (or IP) of the guy on the other end.
998 * strdup into this, because free_connection() frees it. */
999 /** Another connection that's connected to this one in lieu of a socket. */
1000 struct connection_t *linked_conn;
1002 /** Unique identifier for this connection on this Tor instance. */
1003 uint64_t global_identifier;
1005 /* XXXX022 move this field, and all the listener-only fields (just
1006 socket_family, I think), into a new listener_connection_t subtype. */
1007 /** If the connection is a CONN_TYPE_AP_DNS_LISTENER, this field points
1008 * to the evdns_server_port is uses to listen to and answer connections. */
1009 struct evdns_server_port *dns_server_port;
1011 /** Unique ID for measuring tunneled network status requests. */
1012 uint64_t dirreq_id;
1013 } connection_t;
1015 /** Stores flags and information related to the portion of a v2 Tor OR
1016 * connection handshake that happens after the TLS handshake is finished.
1018 typedef struct or_handshake_state_t {
1019 /** When was the VERSIONS cell sent on this connection? Used to get
1020 * an estimate of the skew in the returning NETINFO reply. */
1021 time_t sent_versions_at;
1022 /** True iff we originated this connection */
1023 unsigned int started_here : 1;
1024 /** True iff we have received and processed a VERSIONS cell. */
1025 unsigned int received_versions : 1;
1026 } or_handshake_state_t;
1028 /** Subtype of connection_t for an "OR connection" -- that is, one that speaks
1029 * cells over TLS. */
1030 typedef struct or_connection_t {
1031 connection_t _base;
1033 /** Hash of the public RSA key for the other side's identity key, or zeroes
1034 * if the other side hasn't shown us a valid identity key. */
1035 char identity_digest[DIGEST_LEN];
1036 char *nickname; /**< Nickname of OR on other side (if any). */
1038 tor_tls_t *tls; /**< TLS connection state. */
1039 int tls_error; /**< Last tor_tls error code. */
1040 /** When we last used this conn for any client traffic. If not
1041 * recent, we can rate limit it further. */
1042 time_t client_used;
1044 tor_addr_t real_addr; /**< The actual address that this connection came from
1045 * or went to. The <b>addr</b> field is prone to
1046 * getting overridden by the address from the router
1047 * descriptor matching <b>identity_digest</b>. */
1049 circ_id_type_t circ_id_type:2; /**< When we send CREATE cells along this
1050 * connection, which half of the space should
1051 * we use? */
1052 /** Should this connection be used for extending circuits to the server
1053 * matching the <b>identity_digest</b> field? Set to true if we're pretty
1054 * sure we aren't getting MITMed, either because we're connected to an
1055 * address listed in a server descriptor, or because an authenticated
1056 * NETINFO cell listed the address we're connected to as recognized. */
1057 unsigned int is_canonical:1;
1058 /** True iff this connection shouldn't get any new circs attached to it,
1059 * because the connection is too old, or because there's a better one.
1060 * More generally, this flag is used to note an unhealthy connection;
1061 * for example, if a bad connection fails we shouldn't assume that the
1062 * router itself has a problem.
1064 unsigned int is_bad_for_new_circs:1;
1065 uint8_t link_proto; /**< What protocol version are we using? 0 for
1066 * "none negotiated yet." */
1067 circid_t next_circ_id; /**< Which circ_id do we try to use next on
1068 * this connection? This is always in the
1069 * range 0..1<<15-1. */
1071 or_handshake_state_t *handshake_state; /**< If we are setting this connection
1072 * up, state information to do so. */
1073 time_t timestamp_lastempty; /**< When was the outbuf last completely empty?*/
1074 time_t timestamp_last_added_nonpadding; /** When did we last add a
1075 * non-padding cell to the outbuf? */
1077 /* bandwidth* and *_bucket only used by ORs in OPEN state: */
1078 int bandwidthrate; /**< Bytes/s added to the bucket. (OPEN ORs only.) */
1079 int bandwidthburst; /**< Max bucket size for this conn. (OPEN ORs only.) */
1080 int read_bucket; /**< When this hits 0, stop receiving. Every second we
1081 * add 'bandwidthrate' to this, capping it at
1082 * bandwidthburst. (OPEN ORs only) */
1083 int write_bucket; /**< When this hits 0, stop writing. Like read_bucket. */
1084 int n_circuits; /**< How many circuits use this connection as p_conn or
1085 * n_conn ? */
1087 /** Double-linked ring of circuits with queued cells waiting for room to
1088 * free up on this connection's outbuf. Every time we pull cells from a
1089 * circuit, we advance this pointer to the next circuit in the ring. */
1090 struct circuit_t *active_circuits;
1091 /** Priority queue of cell_ewma_t for circuits with queued cells waiting for
1092 * room to free up on this connection's outbuf. Kept in heap order
1093 * according to EWMA.
1095 * This is redundant with active_circuits; if we ever decide only to use the
1096 * cell_ewma algorithm for choosing circuits, we can remove active_circuits.
1098 smartlist_t *active_circuit_pqueue;
1099 /** The tick on which the cell_ewma_ts in active_circuit_pqueue last had
1100 * their ewma values rescaled. */
1101 unsigned active_circuit_pqueue_last_recalibrated;
1102 struct or_connection_t *next_with_same_id; /**< Next connection with same
1103 * identity digest as this one. */
1104 } or_connection_t;
1106 /** Subtype of connection_t for an "edge connection" -- that is, a socks (ap)
1107 * connection, or an exit. */
1108 typedef struct edge_connection_t {
1109 connection_t _base;
1111 struct edge_connection_t *next_stream; /**< Points to the next stream at this
1112 * edge, if any */
1113 struct crypt_path_t *cpath_layer; /**< A pointer to which node in the circ
1114 * this conn exits at. */
1115 int package_window; /**< How many more relay cells can I send into the
1116 * circuit? */
1117 int deliver_window; /**< How many more relay cells can end at me? */
1119 /** Nickname of planned exit node -- used with .exit support. */
1120 char *chosen_exit_name;
1122 socks_request_t *socks_request; /**< SOCKS structure describing request (AP
1123 * only.) */
1124 struct circuit_t *on_circuit; /**< The circuit (if any) that this edge
1125 * connection is using. */
1127 uint32_t address_ttl; /**< TTL for address-to-addr mapping on exit
1128 * connection. Exit connections only. */
1130 streamid_t stream_id; /**< The stream ID used for this edge connection on its
1131 * circuit */
1133 /** The reason why this connection is closing; passed to the controller. */
1134 uint16_t end_reason;
1136 /** Bytes read since last call to control_event_stream_bandwidth_used() */
1137 uint32_t n_read;
1139 /** Bytes written since last call to control_event_stream_bandwidth_used() */
1140 uint32_t n_written;
1142 /** What rendezvous service are we querying for? (AP only) */
1143 rend_data_t *rend_data;
1145 /** Number of times we've reassigned this application connection to
1146 * a new circuit. We keep track because the timeout is longer if we've
1147 * already retried several times. */
1148 uint8_t num_socks_retries;
1150 /** True iff this connection is for a DNS request only. */
1151 unsigned int is_dns_request:1;
1153 /** True iff this stream must attach to a one-hop circuit (e.g. for
1154 * begin_dir). */
1155 unsigned int want_onehop:1;
1156 /** True iff this stream should use a BEGIN_DIR relay command to establish
1157 * itself rather than BEGIN (either via onehop or via a whole circuit). */
1158 unsigned int use_begindir:1;
1160 unsigned int edge_has_sent_end:1; /**< For debugging; only used on edge
1161 * connections. Set once we've set the stream end,
1162 * and check in connection_about_to_close_connection().
1164 /** True iff we've blocked reading until the circuit has fewer queued
1165 * cells. */
1166 unsigned int edge_blocked_on_circ:1;
1167 /** For AP connections only. If 1, and we fail to reach the chosen exit,
1168 * stop requiring it. */
1169 unsigned int chosen_exit_optional:1;
1170 /** For AP connections only. If non-zero, this exit node was picked as
1171 * a result of the TrackHostExit, and the value decrements every time
1172 * we fail to complete a circuit to our chosen exit -- if it reaches
1173 * zero, abandon the associated mapaddress. */
1174 unsigned int chosen_exit_retries:3;
1176 /** True iff this is an AP connection that came from a transparent or
1177 * NATd connection */
1178 unsigned int is_transparent_ap:1;
1180 /** If this is a DNSPort connection, this field holds the pending DNS
1181 * request that we're going to try to answer. */
1182 struct evdns_server_request *dns_server_request;
1184 } edge_connection_t;
1186 /** Subtype of connection_t for an "directory connection" -- that is, an HTTP
1187 * connection to retrieve or serve directory material. */
1188 typedef struct dir_connection_t {
1189 connection_t _base;
1191 char *requested_resource; /**< Which 'resource' did we ask the directory
1192 * for? */
1193 unsigned int dirconn_direct:1; /**< Is this dirconn direct, or via Tor? */
1195 /* Used only for server sides of some dir connections, to implement
1196 * "spooling" of directory material to the outbuf. Otherwise, we'd have
1197 * to append everything to the outbuf in one enormous chunk. */
1198 /** What exactly are we spooling right now? */
1199 enum {
1200 DIR_SPOOL_NONE=0, DIR_SPOOL_SERVER_BY_DIGEST, DIR_SPOOL_SERVER_BY_FP,
1201 DIR_SPOOL_EXTRA_BY_DIGEST, DIR_SPOOL_EXTRA_BY_FP,
1202 DIR_SPOOL_CACHED_DIR, DIR_SPOOL_NETWORKSTATUS,
1203 DIR_SPOOL_MICRODESC, /* NOTE: if we add another entry, add another bit. */
1204 } dir_spool_src : 3;
1205 /** If we're fetching descriptors, what router purpose shall we assign
1206 * to them? */
1207 uint8_t router_purpose;
1208 /** List of fingerprints for networkstatuses or descriptors to be spooled. */
1209 smartlist_t *fingerprint_stack;
1210 /** A cached_dir_t object that we're currently spooling out */
1211 struct cached_dir_t *cached_dir;
1212 /** The current offset into cached_dir. */
1213 off_t cached_dir_offset;
1214 /** The zlib object doing on-the-fly compression for spooled data. */
1215 tor_zlib_state_t *zlib_state;
1217 /** What rendezvous service are we querying for? */
1218 rend_data_t *rend_data;
1220 char identity_digest[DIGEST_LEN]; /**< Hash of the public RSA key for
1221 * the directory server's signing key. */
1223 } dir_connection_t;
1225 /** Subtype of connection_t for an connection to a controller. */
1226 typedef struct control_connection_t {
1227 connection_t _base;
1229 uint32_t event_mask; /**< Bitfield: which events does this controller
1230 * care about? */
1232 /** True if we have sent a protocolinfo reply on this connection. */
1233 unsigned int have_sent_protocolinfo:1;
1235 /** Amount of space allocated in incoming_cmd. */
1236 uint32_t incoming_cmd_len;
1237 /** Number of bytes currently stored in incoming_cmd. */
1238 uint32_t incoming_cmd_cur_len;
1239 /** A control command that we're reading from the inbuf, but which has not
1240 * yet arrived completely. */
1241 char *incoming_cmd;
1242 } control_connection_t;
1244 /** Cast a connection_t subtype pointer to a connection_t **/
1245 #define TO_CONN(c) (&(((c)->_base)))
1246 /** Helper macro: Given a pointer to to._base, of type from*, return &to. */
1247 #define DOWNCAST(to, ptr) ((to*)SUBTYPE_P(ptr, to, _base))
1249 /** Convert a connection_t* to an or_connection_t*; assert if the cast is
1250 * invalid. */
1251 static or_connection_t *TO_OR_CONN(connection_t *);
1252 /** Convert a connection_t* to a dir_connection_t*; assert if the cast is
1253 * invalid. */
1254 static dir_connection_t *TO_DIR_CONN(connection_t *);
1255 /** Convert a connection_t* to an edge_connection_t*; assert if the cast is
1256 * invalid. */
1257 static edge_connection_t *TO_EDGE_CONN(connection_t *);
1258 /** Convert a connection_t* to an control_connection_t*; assert if the cast is
1259 * invalid. */
1260 static control_connection_t *TO_CONTROL_CONN(connection_t *);
1262 static INLINE or_connection_t *TO_OR_CONN(connection_t *c)
1264 tor_assert(c->magic == OR_CONNECTION_MAGIC);
1265 return DOWNCAST(or_connection_t, c);
1267 static INLINE dir_connection_t *TO_DIR_CONN(connection_t *c)
1269 tor_assert(c->magic == DIR_CONNECTION_MAGIC);
1270 return DOWNCAST(dir_connection_t, c);
1272 static INLINE edge_connection_t *TO_EDGE_CONN(connection_t *c)
1274 tor_assert(c->magic == EDGE_CONNECTION_MAGIC);
1275 return DOWNCAST(edge_connection_t, c);
1277 static INLINE control_connection_t *TO_CONTROL_CONN(connection_t *c)
1279 tor_assert(c->magic == CONTROL_CONNECTION_MAGIC);
1280 return DOWNCAST(control_connection_t, c);
1283 /** What action type does an address policy indicate: accept or reject? */
1284 typedef enum {
1285 ADDR_POLICY_ACCEPT=1,
1286 ADDR_POLICY_REJECT=2,
1287 } addr_policy_action_t;
1289 /** A reference-counted address policy rule. */
1290 typedef struct addr_policy_t {
1291 int refcnt; /**< Reference count */
1292 addr_policy_action_t policy_type:2;/**< What to do when the policy matches.*/
1293 unsigned int is_private:1; /**< True iff this is the pseudo-address,
1294 * "private". */
1295 unsigned int is_canonical:1; /**< True iff this policy is the canonical
1296 * copy (stored in a hash table to avoid
1297 * duplication of common policies) */
1298 maskbits_t maskbits; /**< Accept/reject all addresses <b>a</b> such that the
1299 * first <b>maskbits</b> bits of <b>a</b> match
1300 * <b>addr</b>. */
1301 tor_addr_t addr; /**< Base address to accept or reject. */
1302 uint16_t prt_min; /**< Lowest port number to accept/reject. */
1303 uint16_t prt_max; /**< Highest port number to accept/reject. */
1304 } addr_policy_t;
1306 /** A cached_dir_t represents a cacheable directory object, along with its
1307 * compressed form. */
1308 typedef struct cached_dir_t {
1309 char *dir; /**< Contents of this object, NUL-terminated. */
1310 char *dir_z; /**< Compressed contents of this object. */
1311 size_t dir_len; /**< Length of <b>dir</b> (not counting its NUL). */
1312 size_t dir_z_len; /**< Length of <b>dir_z</b>. */
1313 time_t published; /**< When was this object published. */
1314 digests_t digests; /**< Digests of this object (networkstatus only) */
1315 int refcnt; /**< Reference count for this cached_dir_t. */
1316 } cached_dir_t;
1318 /** Enum used to remember where a signed_descriptor_t is stored and how to
1319 * manage the memory for signed_descriptor_body. */
1320 typedef enum {
1321 /** The descriptor isn't stored on disk at all: the copy in memory is
1322 * canonical; the saved_offset field is meaningless. */
1323 SAVED_NOWHERE=0,
1324 /** The descriptor is stored in the cached_routers file: the
1325 * signed_descriptor_body is meaningless; the signed_descriptor_len and
1326 * saved_offset are used to index into the mmaped cache file. */
1327 SAVED_IN_CACHE,
1328 /** The descriptor is stored in the cached_routers.new file: the
1329 * signed_descriptor_body and saved_offset fields are both set. */
1330 /* FFFF (We could also mmap the file and grow the mmap as needed, or
1331 * lazy-load the descriptor text by using seek and read. We don't, for
1332 * now.)
1334 SAVED_IN_JOURNAL
1335 } saved_location_t;
1337 /** Enumeration: what kind of download schedule are we using for a given
1338 * object? */
1339 typedef enum {
1340 DL_SCHED_GENERIC = 0,
1341 DL_SCHED_CONSENSUS = 1,
1342 DL_SCHED_BRIDGE = 2,
1343 } download_schedule_t;
1345 /** Information about our plans for retrying downloads for a downloadable
1346 * object. */
1347 typedef struct download_status_t {
1348 time_t next_attempt_at; /**< When should we try downloading this descriptor
1349 * again? */
1350 uint8_t n_download_failures; /**< Number of failures trying to download the
1351 * most recent descriptor. */
1352 download_schedule_t schedule : 8;
1353 } download_status_t;
1355 /** If n_download_failures is this high, the download can never happen. */
1356 #define IMPOSSIBLE_TO_DOWNLOAD 255
1358 /** The max size we expect router descriptor annotations we create to
1359 * be. We'll accept larger ones if we see them on disk, but we won't
1360 * create any that are larger than this. */
1361 #define ROUTER_ANNOTATION_BUF_LEN 256
1363 /** Information need to cache an onion router's descriptor. */
1364 typedef struct signed_descriptor_t {
1365 /** Pointer to the raw server descriptor, preceded by annotations. Not
1366 * necessarily NUL-terminated. If saved_location is SAVED_IN_CACHE, this
1367 * pointer is null. */
1368 char *signed_descriptor_body;
1369 /** Length of the annotations preceding the server descriptor. */
1370 size_t annotations_len;
1371 /** Length of the server descriptor. */
1372 size_t signed_descriptor_len;
1373 /** Digest of the server descriptor, computed as specified in
1374 * dir-spec.txt. */
1375 char signed_descriptor_digest[DIGEST_LEN];
1376 /** Identity digest of the router. */
1377 char identity_digest[DIGEST_LEN];
1378 /** Declared publication time of the descriptor. */
1379 time_t published_on;
1380 /** For routerdescs only: digest of the corresponding extrainfo. */
1381 char extra_info_digest[DIGEST_LEN];
1382 /** For routerdescs only: Status of downloading the corresponding
1383 * extrainfo. */
1384 download_status_t ei_dl_status;
1385 /** Where is the descriptor saved? */
1386 saved_location_t saved_location;
1387 /** If saved_location is SAVED_IN_CACHE or SAVED_IN_JOURNAL, the offset of
1388 * this descriptor in the corresponding file. */
1389 off_t saved_offset;
1390 /** What position is this descriptor within routerlist->routers or
1391 * routerlist->old_routers? -1 for none. */
1392 int routerlist_index;
1393 /** The valid-until time of the most recent consensus that listed this
1394 * descriptor, or a bit after the publication time of the most recent v2
1395 * networkstatus that listed it. 0 for "never listed in a consensus or
1396 * status, so far as we know." */
1397 time_t last_listed_as_valid_until;
1398 #ifdef TRACK_SERVED_TIME
1399 /** The last time we served anybody this descriptor. Used for internal
1400 * testing to see whether we're holding on to descriptors too long. */
1401 time_t last_served_at; /*XXXX remove if not useful. */
1402 #endif
1403 /* If true, we do not ever try to save this object in the cache. */
1404 unsigned int do_not_cache : 1;
1405 /* If true, this item is meant to represent an extrainfo. */
1406 unsigned int is_extrainfo : 1;
1407 /* If true, we got an extrainfo for this item, and the digest was right,
1408 * but it was incompatible. */
1409 unsigned int extrainfo_is_bogus : 1;
1410 /* If true, we are willing to transmit this item unencrypted. */
1411 unsigned int send_unencrypted : 1;
1412 } signed_descriptor_t;
1414 /** A signed integer representing a country code. */
1415 typedef int16_t country_t;
1417 /** Information about another onion router in the network. */
1418 typedef struct {
1419 signed_descriptor_t cache_info;
1420 char *address; /**< Location of OR: either a hostname or an IP address. */
1421 char *nickname; /**< Human-readable OR name. */
1423 uint32_t addr; /**< IPv4 address of OR, in host order. */
1424 uint16_t or_port; /**< Port for TLS connections. */
1425 uint16_t dir_port; /**< Port for HTTP directory connections. */
1427 crypto_pk_env_t *onion_pkey; /**< Public RSA key for onions. */
1428 crypto_pk_env_t *identity_pkey; /**< Public RSA key for signing. */
1430 char *platform; /**< What software/operating system is this OR using? */
1432 /* link info */
1433 uint32_t bandwidthrate; /**< How many bytes does this OR add to its token
1434 * bucket per second? */
1435 uint32_t bandwidthburst; /**< How large is this OR's token bucket? */
1436 /** How many bytes/s is this router known to handle? */
1437 uint32_t bandwidthcapacity;
1438 smartlist_t *exit_policy; /**< What streams will this OR permit
1439 * to exit? NULL for 'reject *:*'. */
1440 long uptime; /**< How many seconds the router claims to have been up */
1441 smartlist_t *declared_family; /**< Nicknames of router which this router
1442 * claims are its family. */
1443 char *contact_info; /**< Declared contact info for this router. */
1444 unsigned int is_hibernating:1; /**< Whether the router claims to be
1445 * hibernating */
1446 unsigned int has_old_dnsworkers:1; /**< Whether the router is using
1447 * dnsworker code. */
1448 unsigned int caches_extra_info:1; /**< Whether the router caches and serves
1449 * extrainfo documents. */
1450 unsigned int allow_single_hop_exits:1; /**< Whether the router allows
1451 * single hop exits. */
1453 /* local info */
1454 unsigned int is_running:1; /**< As far as we know, is this OR currently
1455 * running? */
1456 unsigned int is_valid:1; /**< Has a trusted dirserver validated this OR?
1457 * (For Authdir: Have we validated this OR?)
1459 unsigned int is_named:1; /**< Do we believe the nickname that this OR gives
1460 * us? */
1461 unsigned int is_fast:1; /** Do we think this is a fast OR? */
1462 unsigned int is_stable:1; /** Do we think this is a stable OR? */
1463 unsigned int is_possible_guard:1; /**< Do we think this is an OK guard? */
1464 unsigned int is_exit:1; /**< Do we think this is an OK exit? */
1465 unsigned int is_bad_exit:1; /**< Do we think this exit is censored, borked,
1466 * or otherwise nasty? */
1467 unsigned int is_bad_directory:1; /**< Do we think this directory is junky,
1468 * underpowered, or otherwise useless? */
1469 unsigned int wants_to_be_hs_dir:1; /**< True iff this router claims to be
1470 * a hidden service directory. */
1471 unsigned int is_hs_dir:1; /**< True iff this router is a hidden service
1472 * directory according to the authorities. */
1473 unsigned int policy_is_reject_star:1; /**< True iff the exit policy for this
1474 * router rejects everything. */
1475 /** True if, after we have added this router, we should re-launch
1476 * tests for it. */
1477 unsigned int needs_retest_if_added:1;
1479 /** Tor can use this router for general positions in circuits. */
1480 #define ROUTER_PURPOSE_GENERAL 0
1481 /** Tor should avoid using this router for circuit-building. */
1482 #define ROUTER_PURPOSE_CONTROLLER 1
1483 /** Tor should use this router only for bridge positions in circuits. */
1484 #define ROUTER_PURPOSE_BRIDGE 2
1485 /** Tor should not use this router; it was marked in cached-descriptors with
1486 * a purpose we didn't recognize. */
1487 #define ROUTER_PURPOSE_UNKNOWN 255
1489 uint8_t purpose; /** What positions in a circuit is this router good for? */
1491 /* The below items are used only by authdirservers for
1492 * reachability testing. */
1493 /** When was the last time we could reach this OR? */
1494 time_t last_reachable;
1495 /** When did we start testing reachability for this OR? */
1496 time_t testing_since;
1497 /** According to the geoip db what country is this router in? */
1498 country_t country;
1499 } routerinfo_t;
1501 /** Information needed to keep and cache a signed extra-info document. */
1502 typedef struct extrainfo_t {
1503 signed_descriptor_t cache_info;
1504 /** The router's nickname. */
1505 char nickname[MAX_NICKNAME_LEN+1];
1506 /** True iff we found the right key for this extra-info, verified the
1507 * signature, and found it to be bad. */
1508 unsigned int bad_sig : 1;
1509 /** If present, we didn't have the right key to verify this extra-info,
1510 * so this is a copy of the signature in the document. */
1511 char *pending_sig;
1512 /** Length of pending_sig. */
1513 size_t pending_sig_len;
1514 } extrainfo_t;
1516 /** Contents of a single router entry in a network status object.
1518 typedef struct routerstatus_t {
1519 time_t published_on; /**< When was this router published? */
1520 char nickname[MAX_NICKNAME_LEN+1]; /**< The nickname this router says it
1521 * has. */
1522 char identity_digest[DIGEST_LEN]; /**< Digest of the router's identity
1523 * key. */
1524 char descriptor_digest[DIGEST_LEN]; /**< Digest of the router's most recent
1525 * descriptor. */
1526 uint32_t addr; /**< IPv4 address for this router. */
1527 uint16_t or_port; /**< OR port for this router. */
1528 uint16_t dir_port; /**< Directory port for this router. */
1529 unsigned int is_authority:1; /**< True iff this router is an authority. */
1530 unsigned int is_exit:1; /**< True iff this router is a good exit. */
1531 unsigned int is_stable:1; /**< True iff this router stays up a long time. */
1532 unsigned int is_fast:1; /**< True iff this router has good bandwidth. */
1533 unsigned int is_running:1; /**< True iff this router is up. */
1534 unsigned int is_named:1; /**< True iff "nickname" belongs to this router. */
1535 unsigned int is_unnamed:1; /**< True iff "nickname" belongs to another
1536 * router. */
1537 unsigned int is_valid:1; /**< True iff this router isn't invalid. */
1538 unsigned int is_v2_dir:1; /**< True iff this router can serve directory
1539 * information with v2 of the directory
1540 * protocol. (All directory caches cache v1
1541 * directories.) */
1542 unsigned int is_possible_guard:1; /**< True iff this router would be a good
1543 * choice as an entry guard. */
1544 unsigned int is_bad_exit:1; /**< True iff this node is a bad choice for
1545 * an exit node. */
1546 unsigned int is_bad_directory:1; /**< Do we think this directory is junky,
1547 * underpowered, or otherwise useless? */
1548 unsigned int is_hs_dir:1; /**< True iff this router is a v2-or-later hidden
1549 * service directory. */
1550 /** True iff we know version info for this router. (i.e., a "v" entry was
1551 * included.) We'll replace all these with a big tor_version_t or a char[]
1552 * if the number of traits we care about ever becomes incredibly big. */
1553 unsigned int version_known:1;
1554 /** True iff this router is a version that supports BEGIN_DIR cells. */
1555 unsigned int version_supports_begindir:1;
1556 /** True iff this router is a version that supports conditional consensus
1557 * downloads (signed by list of authorities). */
1558 unsigned int version_supports_conditional_consensus:1;
1559 /** True iff this router is a version that we can post extrainfo docs to. */
1560 unsigned int version_supports_extrainfo_upload:1;
1561 /** True iff this router is a version that, if it caches directory info,
1562 * we can get v3 downloads from. */
1563 unsigned int version_supports_v3_dir:1;
1565 unsigned int has_bandwidth:1; /**< The vote/consensus had bw info */
1566 unsigned int has_exitsummary:1; /**< The vote/consensus had exit summaries */
1567 unsigned int has_measured_bw:1; /**< The vote/consensus had a measured bw */
1569 uint32_t measured_bw; /**< Measured bandwidth (capacity) of the router */
1571 uint32_t bandwidth; /**< Bandwidth (capacity) of the router as reported in
1572 * the vote/consensus, in kilobytes/sec. */
1573 char *exitsummary; /**< exit policy summary -
1574 * XXX weasel: this probably should not stay a string. */
1576 /* ---- The fields below aren't derived from the networkstatus; they
1577 * hold local information only. */
1579 /** True if we, as a directory mirror, want to download the corresponding
1580 * routerinfo from the authority who gave us this routerstatus. (That is,
1581 * if we don't have the routerinfo, and if we haven't already tried to get it
1582 * from this authority.) Applies in v2 networkstatus document only.
1584 unsigned int need_to_mirror:1;
1585 unsigned int name_lookup_warned:1; /**< Have we warned the user for referring
1586 * to this (unnamed) router by nickname?
1588 time_t last_dir_503_at; /**< When did this router last tell us that it
1589 * was too busy to serve directory info? */
1590 download_status_t dl_status;
1592 } routerstatus_t;
1594 /** A microdescriptor is the smallest amount of information needed to build a
1595 * circuit through a router. They are generated by the directory authorities,
1596 * using information from the uploaded routerinfo documents. They are not
1597 * self-signed, but are rather authenticated by having their hash in a signed
1598 * networkstatus document. */
1599 typedef struct microdesc_t {
1600 /** Hashtable node, used to look up the microdesc by its digest. */
1601 HT_ENTRY(microdesc_t) node;
1603 /* Cache information */
1605 /** When was this microdescriptor last listed in a consensus document?
1606 * Once a microdesc has been unlisted long enough, we can drop it.
1608 time_t last_listed;
1609 /** Where is this microdescriptor currently stored? */
1610 saved_location_t saved_location : 3;
1611 /** If true, do not attempt to cache this microdescriptor on disk. */
1612 unsigned int no_save : 1;
1613 /** If saved_location == SAVED_IN_CACHE, this field holds the offset of the
1614 * microdescriptor in the cache. */
1615 off_t off;
1617 /* The string containing the microdesc. */
1619 /** A pointer to the encoded body of the microdescriptor. If the
1620 * saved_location is SAVED_IN_CACHE, then the body is a pointer into an
1621 * mmap'd region. Otherwise, it is a malloc'd string. The string might not
1622 * be NUL-terminated; take the length from <b>bodylen</b>. */
1623 char *body;
1624 /** The length of the microdescriptor in <b>body</b>. */
1625 size_t bodylen;
1626 /** A SHA256-digest of the microdescriptor. */
1627 char digest[DIGEST256_LEN];
1629 /* Fields in the microdescriptor. */
1631 /** As routerinfo_t.onion_pkey */
1632 crypto_pk_env_t *onion_pkey;
1633 /** As routerinfo_t.family */
1634 smartlist_t *family;
1635 /** Encoded exit policy summary */
1636 char *exitsummary; /**< exit policy summary -
1637 * XXX this probably should not stay a string. */
1638 } microdesc_t;
1640 /** How many times will we try to download a router's descriptor before giving
1641 * up? */
1642 #define MAX_ROUTERDESC_DOWNLOAD_FAILURES 8
1644 /** Contents of a v2 (non-consensus, non-vote) network status object. */
1645 typedef struct networkstatus_v2_t {
1646 /** When did we receive the network-status document? */
1647 time_t received_on;
1649 /** What was the digest of the document? */
1650 char networkstatus_digest[DIGEST_LEN];
1652 /* These fields come from the actual network-status document.*/
1653 time_t published_on; /**< Declared publication date. */
1655 char *source_address; /**< Canonical directory server hostname. */
1656 uint32_t source_addr; /**< Canonical directory server IP. */
1657 uint16_t source_dirport; /**< Canonical directory server dirport. */
1659 unsigned int binds_names:1; /**< True iff this directory server binds
1660 * names. */
1661 unsigned int recommends_versions:1; /**< True iff this directory server
1662 * recommends client and server software
1663 * versions. */
1664 unsigned int lists_bad_exits:1; /**< True iff this directory server marks
1665 * malfunctioning exits as bad. */
1666 /** True iff this directory server marks malfunctioning directories as
1667 * bad. */
1668 unsigned int lists_bad_directories:1;
1670 char identity_digest[DIGEST_LEN]; /**< Digest of signing key. */
1671 char *contact; /**< How to contact directory admin? (may be NULL). */
1672 crypto_pk_env_t *signing_key; /**< Key used to sign this directory. */
1673 char *client_versions; /**< comma-separated list of recommended client
1674 * versions. */
1675 char *server_versions; /**< comma-separated list of recommended server
1676 * versions. */
1678 smartlist_t *entries; /**< List of routerstatus_t*. This list is kept
1679 * sorted by identity_digest. */
1680 } networkstatus_v2_t;
1682 typedef struct vote_microdesc_hash_t {
1683 struct vote_microdesc_hash_t *next;
1684 char *microdesc_hash_line;
1685 } vote_microdesc_hash_t;
1687 /** The claim about a single router, made in a vote. */
1688 typedef struct vote_routerstatus_t {
1689 routerstatus_t status; /**< Underlying 'status' object for this router.
1690 * Flags are redundant. */
1691 uint64_t flags; /**< Bit-field for all recognized flags; index into
1692 * networkstatus_t.known_flags. */
1693 char *version; /**< The version that the authority says this router is
1694 * running. */
1695 vote_microdesc_hash_t *microdesc;
1696 } vote_routerstatus_t;
1698 /** A signature of some document by an authority. */
1699 typedef struct document_signature_t {
1700 /** Declared SHA-1 digest of this voter's identity key */
1701 char identity_digest[DIGEST_LEN];
1702 /** Declared SHA-1 digest of signing key used by this voter. */
1703 char signing_key_digest[DIGEST_LEN];
1704 /** Algorithm used to compute the digest of the document. */
1705 digest_algorithm_t alg;
1706 /** Signature of the signed thing. */
1707 char *signature;
1708 /** Length of <b>signature</b> */
1709 int signature_len;
1710 unsigned int bad_signature : 1; /**< Set to true if we've tried to verify
1711 * the sig, and we know it's bad. */
1712 unsigned int good_signature : 1; /**< Set to true if we've verified the sig
1713 * as good. */
1714 } document_signature_t;
1716 /** Information about a single voter in a vote or a consensus. */
1717 typedef struct networkstatus_voter_info_t {
1718 /** Declared SHA-1 digest of this voter's identity key */
1719 char identity_digest[DIGEST_LEN];
1720 char *nickname; /**< Nickname of this voter */
1721 /** Digest of this voter's "legacy" identity key, if any. In vote only; for
1722 * consensuses, we treat legacy keys as additional signers. */
1723 char legacy_id_digest[DIGEST_LEN];
1724 char *address; /**< Address of this voter, in string format. */
1725 uint32_t addr; /**< Address of this voter, in IPv4, in host order. */
1726 uint16_t dir_port; /**< Directory port of this voter */
1727 uint16_t or_port; /**< OR port of this voter */
1728 char *contact; /**< Contact information for this voter. */
1729 char vote_digest[DIGEST_LEN]; /**< Digest of this voter's vote, as signed. */
1731 /* Nothing from here on is signed. */
1732 /** The signature of the document and the signature's status. */
1733 smartlist_t *sigs;
1734 } networkstatus_voter_info_t;
1736 /** Enumerates the possible seriousness values of a networkstatus document. */
1737 typedef enum {
1738 NS_TYPE_VOTE,
1739 NS_TYPE_CONSENSUS,
1740 NS_TYPE_OPINION,
1741 } networkstatus_type_t;
1743 /** Enumerates recognized flavors of a consensus networkstatus document. All
1744 * flavors of a consensus are generated from the same set of votes, but they
1745 * present different types information to different versions of Tor. */
1746 typedef enum {
1747 FLAV_NS = 0,
1748 FLAV_MICRODESC = 1,
1749 } consensus_flavor_t;
1751 /** Which consensus flavor do we actually want to use to build circuits? */
1752 #define USABLE_CONSENSUS_FLAVOR FLAV_NS
1754 /** How many different consensus flavors are there? */
1755 #define N_CONSENSUS_FLAVORS ((int)(FLAV_MICRODESC)+1)
1757 /** A common structure to hold a v3 network status vote, or a v3 network
1758 * status consensus. */
1759 typedef struct networkstatus_t {
1760 networkstatus_type_t type : 8; /**< Vote, consensus, or opinion? */
1761 consensus_flavor_t flavor : 8; /**< If a consensus, what kind? */
1762 time_t published; /**< Vote only: Time when vote was written. */
1763 time_t valid_after; /**< Time after which this vote or consensus applies. */
1764 time_t fresh_until; /**< Time before which this is the most recent vote or
1765 * consensus. */
1766 time_t valid_until; /**< Time after which this vote or consensus should not
1767 * be used. */
1769 /** Consensus only: what method was used to produce this consensus? */
1770 int consensus_method;
1771 /** Vote only: what methods is this voter willing to use? */
1772 smartlist_t *supported_methods;
1774 /** How long does this vote/consensus claim that authorities take to
1775 * distribute their votes to one another? */
1776 int vote_seconds;
1777 /** How long does this vote/consensus claim that authorities take to
1778 * distribute their consensus signatures to one another? */
1779 int dist_seconds;
1781 /** Comma-separated list of recommended client software, or NULL if this
1782 * voter has no opinion. */
1783 char *client_versions;
1784 char *server_versions;
1785 /** List of flags that this vote/consensus applies to routers. If a flag is
1786 * not listed here, the voter has no opinion on what its value should be. */
1787 smartlist_t *known_flags;
1789 /** List of key=value strings for the parameters in this vote or
1790 * consensus, sorted by key. */
1791 smartlist_t *net_params;
1793 /** List of key=value strings for the bw weight parameters in the
1794 * consensus. */
1795 smartlist_t *weight_params;
1797 /** List of networkstatus_voter_info_t. For a vote, only one element
1798 * is included. For a consensus, one element is included for every voter
1799 * whose vote contributed to the consensus. */
1800 smartlist_t *voters;
1802 struct authority_cert_t *cert; /**< Vote only: the voter's certificate. */
1804 /** Digests of this document, as signed. */
1805 digests_t digests;
1807 /** List of router statuses, sorted by identity digest. For a vote,
1808 * the elements are vote_routerstatus_t; for a consensus, the elements
1809 * are routerstatus_t. */
1810 smartlist_t *routerstatus_list;
1812 /** If present, a map from descriptor digest to elements of
1813 * routerstatus_list. */
1814 digestmap_t *desc_digest_map;
1815 } networkstatus_t;
1817 /** A set of signatures for a networkstatus consensus. Unless otherwise
1818 * noted, all fields are as for networkstatus_t. */
1819 typedef struct ns_detached_signatures_t {
1820 time_t valid_after;
1821 time_t fresh_until;
1822 time_t valid_until;
1823 strmap_t *digests; /**< Map from flavor name to digestset_t */
1824 strmap_t *signatures; /**< Map from flavor name to list of
1825 * document_signature_t */
1826 } ns_detached_signatures_t;
1828 /** Allowable types of desc_store_t. */
1829 typedef enum store_type_t {
1830 ROUTER_STORE = 0,
1831 EXTRAINFO_STORE = 1
1832 } store_type_t;
1834 /** A 'store' is a set of descriptors saved on disk, with accompanying
1835 * journal, mmaped as needed, rebuilt as needed. */
1836 typedef struct desc_store_t {
1837 /** Filename (within DataDir) for the store. We append .tmp to this
1838 * filename for a temporary file when rebuilding the store, and .new to this
1839 * filename for the journal. */
1840 const char *fname_base;
1841 /** Alternative (obsolete) value for fname_base: if the file named by
1842 * fname_base isn't present, we read from here instead, but we never write
1843 * here. */
1844 const char *fname_alt_base;
1845 /** Human-readable description of what this store contains. */
1846 const char *description;
1848 tor_mmap_t *mmap; /**< A mmap for the main file in the store. */
1850 store_type_t type; /**< What's stored in this store? */
1852 /** The size of the router log, in bytes. */
1853 size_t journal_len;
1854 /** The size of the router store, in bytes. */
1855 size_t store_len;
1856 /** Total bytes dropped since last rebuild: this is space currently
1857 * used in the cache and the journal that could be freed by a rebuild. */
1858 size_t bytes_dropped;
1859 } desc_store_t;
1861 /** Contents of a directory of onion routers. */
1862 typedef struct {
1863 /** Map from server identity digest to a member of routers. */
1864 struct digest_ri_map_t *identity_map;
1865 /** Map from server descriptor digest to a signed_descriptor_t from
1866 * routers or old_routers. */
1867 struct digest_sd_map_t *desc_digest_map;
1868 /** Map from extra-info digest to an extrainfo_t. Only exists for
1869 * routers in routers or old_routers. */
1870 struct digest_ei_map_t *extra_info_map;
1871 /** Map from extra-info digests to a signed_descriptor_t for a router
1872 * descriptor having that extra-info digest. Only exists for
1873 * routers in routers or old_routers. */
1874 struct digest_sd_map_t *desc_by_eid_map;
1875 /** List of routerinfo_t for all currently live routers we know. */
1876 smartlist_t *routers;
1877 /** List of signed_descriptor_t for older router descriptors we're
1878 * caching. */
1879 smartlist_t *old_routers;
1880 /** Store holding server descriptors. If present, any router whose
1881 * cache_info.saved_location == SAVED_IN_CACHE is stored in this file
1882 * starting at cache_info.saved_offset */
1883 desc_store_t desc_store;
1884 /** Store holding extra-info documents. */
1885 desc_store_t extrainfo_store;
1886 } routerlist_t;
1888 /** Information on router used when extending a circuit. We don't need a
1889 * full routerinfo_t to extend: we only need addr:port:keyid to build an OR
1890 * connection, and onion_key to create the onionskin. Note that for onehop
1891 * general-purpose tunnels, the onion_key is NULL. */
1892 typedef struct extend_info_t {
1893 char nickname[MAX_HEX_NICKNAME_LEN+1]; /**< This router's nickname for
1894 * display. */
1895 char identity_digest[DIGEST_LEN]; /**< Hash of this router's identity key. */
1896 uint16_t port; /**< OR port. */
1897 tor_addr_t addr; /**< IP address. */
1898 crypto_pk_env_t *onion_key; /**< Current onionskin key. */
1899 } extend_info_t;
1901 /** Certificate for v3 directory protocol: binds long-term authority identity
1902 * keys to medium-term authority signing keys. */
1903 typedef struct authority_cert_t {
1904 /** Information relating to caching this cert on disk and looking it up. */
1905 signed_descriptor_t cache_info;
1906 /** This authority's long-term authority identity key. */
1907 crypto_pk_env_t *identity_key;
1908 /** This authority's medium-term signing key. */
1909 crypto_pk_env_t *signing_key;
1910 /** The digest of <b>signing_key</b> */
1911 char signing_key_digest[DIGEST_LEN];
1912 /** The listed expiration time of this certificate. */
1913 time_t expires;
1914 /** This authority's IPv4 address, in host order. */
1915 uint32_t addr;
1916 /** This authority's directory port. */
1917 uint16_t dir_port;
1918 /** True iff this certificate was cross-certified by signing the identity
1919 * key with the signing key. */
1920 uint8_t is_cross_certified;
1921 } authority_cert_t;
1923 /** Bitfield enum type listing types of directory authority/directory
1924 * server. */
1925 typedef enum {
1926 NO_AUTHORITY = 0,
1927 /** Serves/signs v1 directory information: Big lists of routers, and short
1928 * routerstatus documents. */
1929 V1_AUTHORITY = 1 << 0,
1930 /** Serves/signs v2 directory information: i.e. v2 networkstatus documents */
1931 V2_AUTHORITY = 1 << 1,
1932 /** Serves/signs v3 directory information: votes, consensuses, certs */
1933 V3_AUTHORITY = 1 << 2,
1934 /** Serves hidden service descriptors. */
1935 HIDSERV_AUTHORITY = 1 << 3,
1936 /** Serves bridge descriptors. */
1937 BRIDGE_AUTHORITY = 1 << 4,
1938 /** Serves extrainfo documents. (XXX Not precisely an authority type)*/
1939 EXTRAINFO_CACHE = 1 << 5,
1940 } authority_type_t;
1942 #define CRYPT_PATH_MAGIC 0x70127012u
1944 /** Holds accounting information for a single step in the layered encryption
1945 * performed by a circuit. Used only at the client edge of a circuit. */
1946 typedef struct crypt_path_t {
1947 uint32_t magic;
1949 /* crypto environments */
1950 /** Encryption key and counter for cells heading towards the OR at this
1951 * step. */
1952 crypto_cipher_env_t *f_crypto;
1953 /** Encryption key and counter for cells heading back from the OR at this
1954 * step. */
1955 crypto_cipher_env_t *b_crypto;
1957 /** Digest state for cells heading towards the OR at this step. */
1958 crypto_digest_env_t *f_digest; /* for integrity checking */
1959 /** Digest state for cells heading away from the OR at this step. */
1960 crypto_digest_env_t *b_digest;
1962 /** Current state of Diffie-Hellman key negotiation with the OR at this
1963 * step. */
1964 crypto_dh_env_t *dh_handshake_state;
1965 /** Current state of 'fast' (non-PK) key negotiation with the OR at this
1966 * step. Used to save CPU when TLS is already providing all the
1967 * authentication, secrecy, and integrity we need, and we're already
1968 * distinguishable from an OR.
1970 uint8_t fast_handshake_state[DIGEST_LEN];
1971 /** Negotiated key material shared with the OR at this step. */
1972 char handshake_digest[DIGEST_LEN];/* KH in tor-spec.txt */
1974 /** Information to extend to the OR at this step. */
1975 extend_info_t *extend_info;
1977 /** Is the circuit built to this step? Must be one of:
1978 * - CPATH_STATE_CLOSED (The circuit has not been extended to this step)
1979 * - CPATH_STATE_AWAITING_KEYS (We have sent an EXTEND/CREATE to this step
1980 * and not received an EXTENDED/CREATED)
1981 * - CPATH_STATE_OPEN (The circuit has been extended to this step) */
1982 uint8_t state;
1983 #define CPATH_STATE_CLOSED 0
1984 #define CPATH_STATE_AWAITING_KEYS 1
1985 #define CPATH_STATE_OPEN 2
1986 struct crypt_path_t *next; /**< Link to next crypt_path_t in the circuit.
1987 * (The list is circular, so the last node
1988 * links to the first.) */
1989 struct crypt_path_t *prev; /**< Link to previous crypt_path_t in the
1990 * circuit. */
1992 int package_window; /**< How many cells are we allowed to originate ending
1993 * at this step? */
1994 int deliver_window; /**< How many cells are we willing to deliver originating
1995 * at this step? */
1996 } crypt_path_t;
1998 #define CPATH_KEY_MATERIAL_LEN (20*2+16*2)
2000 #define DH_KEY_LEN DH_BYTES
2001 #define ONIONSKIN_CHALLENGE_LEN (PKCS1_OAEP_PADDING_OVERHEAD+\
2002 CIPHER_KEY_LEN+\
2003 DH_KEY_LEN)
2004 #define ONIONSKIN_REPLY_LEN (DH_KEY_LEN+DIGEST_LEN)
2006 /** Information used to build a circuit. */
2007 typedef struct {
2008 /** Intended length of the final circuit. */
2009 int desired_path_len;
2010 /** How to extend to the planned exit node. */
2011 extend_info_t *chosen_exit;
2012 /** Whether every node in the circ must have adequate uptime. */
2013 int need_uptime;
2014 /** Whether every node in the circ must have adequate capacity. */
2015 int need_capacity;
2016 /** Whether the last hop was picked with exiting in mind. */
2017 int is_internal;
2018 /** Did we pick this as a one-hop tunnel (not safe for other conns)?
2019 * These are for encrypted connections that exit to this router, not
2020 * for arbitrary exits from the circuit. */
2021 int onehop_tunnel;
2022 /** The crypt_path_t to append after rendezvous: used for rendezvous. */
2023 crypt_path_t *pending_final_cpath;
2024 /** How many times has building a circuit for this task failed? */
2025 int failure_count;
2026 /** At what time should we give up on this task? */
2027 time_t expiry_time;
2028 } cpath_build_state_t;
2031 * The cell_ewma_t structure keeps track of how many cells a circuit has
2032 * transferred recently. It keeps an EWMA (exponentially weighted moving
2033 * average) of the number of cells flushed from the circuit queue onto a
2034 * connection in connection_or_flush_from_first_active_circuit().
2036 typedef struct {
2037 /** The last 'tick' at which we recalibrated cell_count.
2039 * A cell sent at exactly the start of this tick has weight 1.0. Cells sent
2040 * since the start of this tick have weight greater than 1.0; ones sent
2041 * earlier have less weight. */
2042 unsigned last_adjusted_tick;
2043 /** The EWMA of the cell count. */
2044 double cell_count;
2045 /** True iff this is the cell count for a circuit's previous
2046 * connection. */
2047 unsigned int is_for_p_conn : 1;
2048 /** The position of the circuit within the OR connection's priority
2049 * queue. */
2050 int heap_index;
2051 } cell_ewma_t;
2053 #define ORIGIN_CIRCUIT_MAGIC 0x35315243u
2054 #define OR_CIRCUIT_MAGIC 0x98ABC04Fu
2057 * A circuit is a path over the onion routing
2058 * network. Applications can connect to one end of the circuit, and can
2059 * create exit connections at the other end of the circuit. AP and exit
2060 * connections have only one circuit associated with them (and thus these
2061 * connection types are closed when the circuit is closed), whereas
2062 * OR connections multiplex many circuits at once, and stay standing even
2063 * when there are no circuits running over them.
2065 * A circuit_t structure can fill one of two roles. First, a or_circuit_t
2066 * links two connections together: either an edge connection and an OR
2067 * connection, or two OR connections. (When joined to an OR connection, a
2068 * circuit_t affects only cells sent to a particular circID on that
2069 * connection. When joined to an edge connection, a circuit_t affects all
2070 * data.)
2072 * Second, an origin_circuit_t holds the cipher keys and state for sending data
2073 * along a given circuit. At the OP, it has a sequence of ciphers, each
2074 * of which is shared with a single OR along the circuit. Separate
2075 * ciphers are used for data going "forward" (away from the OP) and
2076 * "backward" (towards the OP). At the OR, a circuit has only two stream
2077 * ciphers: one for data going forward, and one for data going backward.
2079 typedef struct circuit_t {
2080 uint32_t magic; /**< For memory and type debugging: must equal
2081 * ORIGIN_CIRCUIT_MAGIC or OR_CIRCUIT_MAGIC. */
2083 /** Queue of cells waiting to be transmitted on n_conn. */
2084 cell_queue_t n_conn_cells;
2085 /** The OR connection that is next in this circuit. */
2086 or_connection_t *n_conn;
2087 /** The circuit_id used in the next (forward) hop of this circuit. */
2088 circid_t n_circ_id;
2090 /** The hop to which we want to extend this circuit. Should be NULL if
2091 * the circuit has attached to a connection. */
2092 extend_info_t *n_hop;
2094 /** True iff we are waiting for n_conn_cells to become less full before
2095 * allowing p_streams to add any more cells. (Origin circuit only.) */
2096 unsigned int streams_blocked_on_n_conn : 1;
2097 /** True iff we are waiting for p_conn_cells to become less full before
2098 * allowing n_streams to add any more cells. (OR circuit only.) */
2099 unsigned int streams_blocked_on_p_conn : 1;
2101 uint8_t state; /**< Current status of this circuit. */
2102 uint8_t purpose; /**< Why are we creating this circuit? */
2104 /** How many relay data cells can we package (read from edge streams)
2105 * on this circuit before we receive a circuit-level sendme cell asking
2106 * for more? */
2107 int package_window;
2108 /** How many relay data cells will we deliver (write to edge streams)
2109 * on this circuit? When deliver_window gets low, we send some
2110 * circuit-level sendme cells to indicate that we're willing to accept
2111 * more. */
2112 int deliver_window;
2114 /** For storage while n_conn is pending
2115 * (state CIRCUIT_STATE_OR_WAIT). When defined, it is always
2116 * length ONIONSKIN_CHALLENGE_LEN. */
2117 char *n_conn_onionskin;
2119 time_t timestamp_created; /**< When was this circuit created? */
2120 time_t timestamp_dirty; /**< When the circuit was first used, or 0 if the
2121 * circuit is clean. */
2122 struct timeval highres_created; /**< When exactly was the circuit created? */
2124 uint16_t marked_for_close; /**< Should we close this circuit at the end of
2125 * the main loop? (If true, holds the line number
2126 * where this circuit was marked.) */
2127 const char *marked_for_close_file; /**< For debugging: in which file was this
2128 * circuit marked for close? */
2130 /** Next circuit in the doubly-linked ring of circuits waiting to add
2131 * cells to n_conn. NULL if we have no cells pending, or if we're not
2132 * linked to an OR connection. */
2133 struct circuit_t *next_active_on_n_conn;
2134 /** Previous circuit in the doubly-linked ring of circuits waiting to add
2135 * cells to n_conn. NULL if we have no cells pending, or if we're not
2136 * linked to an OR connection. */
2137 struct circuit_t *prev_active_on_n_conn;
2138 struct circuit_t *next; /**< Next circuit in linked list of all circuits. */
2140 /** Unique ID for measuring tunneled network status requests. */
2141 uint64_t dirreq_id;
2143 /** The EWMA count for the number of cells flushed from the
2144 * n_conn_cells queue. Used to determine which circuit to flush from next.
2146 cell_ewma_t n_cell_ewma;
2147 } circuit_t;
2149 /** Largest number of relay_early cells that we can send on a given
2150 * circuit. */
2151 #define MAX_RELAY_EARLY_CELLS_PER_CIRCUIT 8
2153 /** An origin_circuit_t holds data necessary to build and use a circuit.
2155 typedef struct origin_circuit_t {
2156 circuit_t _base;
2158 /** Linked list of AP streams (or EXIT streams if hidden service)
2159 * associated with this circuit. */
2160 edge_connection_t *p_streams;
2161 /** Build state for this circuit. It includes the intended path
2162 * length, the chosen exit router, rendezvous information, etc.
2164 cpath_build_state_t *build_state;
2165 /** The doubly-linked list of crypt_path_t entries, one per hop,
2166 * for this circuit. This includes ciphers for each hop,
2167 * integrity-checking digests for each hop, and package/delivery
2168 * windows for each hop.
2170 crypt_path_t *cpath;
2172 /** Holds all rendezvous data on either client or service side. */
2173 rend_data_t *rend_data;
2175 /** How many more relay_early cells can we send on this circuit, according
2176 * to the specification? */
2177 unsigned int remaining_relay_early_cells : 4;
2179 /** Set if this circuit is insanely old and we already informed the user */
2180 unsigned int is_ancient : 1;
2182 /** Set if this circuit has already been opened. Used to detect
2183 * cannibalized circuits. */
2184 unsigned int has_opened : 1;
2186 /** What commands were sent over this circuit that decremented the
2187 * RELAY_EARLY counter? This is for debugging task 878. */
2188 uint8_t relay_early_commands[MAX_RELAY_EARLY_CELLS_PER_CIRCUIT];
2190 /** How many RELAY_EARLY cells have been sent over this circuit? This is
2191 * for debugging task 878, too. */
2192 int relay_early_cells_sent;
2194 /** The next stream_id that will be tried when we're attempting to
2195 * construct a new AP stream originating at this circuit. */
2196 streamid_t next_stream_id;
2198 /* The intro key replaces the hidden service's public key if purpose is
2199 * S_ESTABLISH_INTRO or S_INTRO, provided that no unversioned rendezvous
2200 * descriptor is used. */
2201 crypto_pk_env_t *intro_key;
2203 /** Quasi-global identifier for this circuit; used for control.c */
2204 /* XXXX NM This can get re-used after 2**32 circuits. */
2205 uint32_t global_identifier;
2207 } origin_circuit_t;
2209 /** An or_circuit_t holds information needed to implement a circuit at an
2210 * OR. */
2211 typedef struct or_circuit_t {
2212 circuit_t _base;
2214 /** Next circuit in the doubly-linked ring of circuits waiting to add
2215 * cells to p_conn. NULL if we have no cells pending, or if we're not
2216 * linked to an OR connection. */
2217 struct circuit_t *next_active_on_p_conn;
2218 /** Previous circuit in the doubly-linked ring of circuits waiting to add
2219 * cells to p_conn. NULL if we have no cells pending, or if we're not
2220 * linked to an OR connection. */
2221 struct circuit_t *prev_active_on_p_conn;
2223 /** The circuit_id used in the previous (backward) hop of this circuit. */
2224 circid_t p_circ_id;
2225 /** Queue of cells waiting to be transmitted on p_conn. */
2226 cell_queue_t p_conn_cells;
2227 /** The OR connection that is previous in this circuit. */
2228 or_connection_t *p_conn;
2229 /** Linked list of Exit streams associated with this circuit. */
2230 edge_connection_t *n_streams;
2231 /** Linked list of Exit streams associated with this circuit that are
2232 * still being resolved. */
2233 edge_connection_t *resolving_streams;
2234 /** The cipher used by intermediate hops for cells heading toward the
2235 * OP. */
2236 crypto_cipher_env_t *p_crypto;
2237 /** The cipher used by intermediate hops for cells heading away from
2238 * the OP. */
2239 crypto_cipher_env_t *n_crypto;
2241 /** The integrity-checking digest used by intermediate hops, for
2242 * cells packaged here and heading towards the OP.
2244 crypto_digest_env_t *p_digest;
2245 /** The integrity-checking digest used by intermediate hops, for
2246 * cells packaged at the OP and arriving here.
2248 crypto_digest_env_t *n_digest;
2250 /** Points to spliced circuit if purpose is REND_ESTABLISHED, and circuit
2251 * is not marked for close. */
2252 struct or_circuit_t *rend_splice;
2254 #if REND_COOKIE_LEN >= DIGEST_LEN
2255 #define REND_TOKEN_LEN REND_COOKIE_LEN
2256 #else
2257 #define REND_TOKEN_LEN DIGEST_LEN
2258 #endif
2260 /** A hash of location-hidden service's PK if purpose is INTRO_POINT, or a
2261 * rendezvous cookie if purpose is REND_POINT_WAITING. Filled with zeroes
2262 * otherwise.
2263 * ???? move to a subtype or adjunct structure? Wastes 20 bytes. -NM
2265 char rend_token[REND_TOKEN_LEN];
2267 /* ???? move to a subtype or adjunct structure? Wastes 20 bytes -NM */
2268 char handshake_digest[DIGEST_LEN]; /**< Stores KH for the handshake. */
2270 /** How many more relay_early cells can we send on this circuit, according
2271 * to the specification? */
2272 unsigned int remaining_relay_early_cells : 4;
2274 /** True iff this circuit was made with a CREATE_FAST cell. */
2275 unsigned int is_first_hop : 1;
2277 /** Number of cells that were removed from circuit queue; reset every
2278 * time when writing buffer stats to disk. */
2279 uint32_t processed_cells;
2281 /** Total time in milliseconds that cells spent in both app-ward and
2282 * exit-ward queues of this circuit; reset every time when writing
2283 * buffer stats to disk. */
2284 uint64_t total_cell_waiting_time;
2286 /** The EWMA count for the number of cells flushed from the
2287 * p_conn_cells queue. */
2288 cell_ewma_t p_cell_ewma;
2289 } or_circuit_t;
2291 /** Convert a circuit subtype to a circuit_t.*/
2292 #define TO_CIRCUIT(x) (&((x)->_base))
2294 /** Convert a circuit_t* to a pointer to the enclosing or_circuit_t. Asserts
2295 * if the cast is impossible. */
2296 static or_circuit_t *TO_OR_CIRCUIT(circuit_t *);
2297 /** Convert a circuit_t* to a pointer to the enclosing origin_circuit_t.
2298 * Asserts if the cast is impossible. */
2299 static origin_circuit_t *TO_ORIGIN_CIRCUIT(circuit_t *);
2301 static INLINE or_circuit_t *TO_OR_CIRCUIT(circuit_t *x)
2303 tor_assert(x->magic == OR_CIRCUIT_MAGIC);
2304 return DOWNCAST(or_circuit_t, x);
2306 static INLINE origin_circuit_t *TO_ORIGIN_CIRCUIT(circuit_t *x)
2308 tor_assert(x->magic == ORIGIN_CIRCUIT_MAGIC);
2309 return DOWNCAST(origin_circuit_t, x);
2312 /** Bitfield type: things that we're willing to use invalid routers for. */
2313 typedef enum invalid_router_usage_t {
2314 ALLOW_INVALID_ENTRY =1,
2315 ALLOW_INVALID_EXIT =2,
2316 ALLOW_INVALID_MIDDLE =4,
2317 ALLOW_INVALID_RENDEZVOUS =8,
2318 ALLOW_INVALID_INTRODUCTION=16,
2319 } invalid_router_usage_t;
2321 /* limits for TCP send and recv buffer size used for constrained sockets */
2322 #define MIN_CONSTRAINED_TCP_BUFFER 2048
2323 #define MAX_CONSTRAINED_TCP_BUFFER 262144 /* 256k */
2325 /** A linked list of lines in a config file. */
2326 typedef struct config_line_t {
2327 char *key;
2328 char *value;
2329 struct config_line_t *next;
2330 } config_line_t;
2332 typedef struct routerset_t routerset_t;
2334 /** Configuration options for a Tor process. */
2335 typedef struct {
2336 uint32_t _magic;
2338 /** What should the tor process actually do? */
2339 enum {
2340 CMD_RUN_TOR=0, CMD_LIST_FINGERPRINT, CMD_HASH_PASSWORD,
2341 CMD_VERIFY_CONFIG, CMD_RUN_UNITTESTS
2342 } command;
2343 const char *command_arg; /**< Argument for command-line option. */
2345 config_line_t *Logs; /**< New-style list of configuration lines
2346 * for logs */
2348 char *DebugLogFile; /**< Where to send verbose log messages. */
2349 char *DataDirectory; /**< OR only: where to store long-term data. */
2350 char *Nickname; /**< OR only: nickname of this onion router. */
2351 char *Address; /**< OR only: configured address for this onion router. */
2352 char *PidFile; /**< Where to store PID of Tor process. */
2354 routerset_t *ExitNodes; /**< Structure containing nicknames, digests,
2355 * country codes and IP address patterns of ORs to
2356 * consider as exits. */
2357 routerset_t *EntryNodes;/**< Structure containing nicknames, digests,
2358 * country codes and IP address patterns of ORs to
2359 * consider as entry points. */
2360 int StrictNodes; /**< Boolean: When none of our EntryNodes or ExitNodes
2361 * are up, or we need to access a node in ExcludeNodes,
2362 * do we just fail instead? */
2363 routerset_t *ExcludeNodes;/**< Structure containing nicknames, digests,
2364 * country codes and IP address patterns of ORs
2365 * not to use in circuits. But see StrictNodes
2366 * above. */
2367 routerset_t *ExcludeExitNodes;/**< Structure containing nicknames, digests,
2368 * country codes and IP address patterns of
2369 * ORs not to consider as exits. */
2371 /** Union of ExcludeNodes and ExcludeExitNodes */
2372 struct routerset_t *_ExcludeExitNodesUnion;
2374 int DisableAllSwap; /**< Boolean: Attempt to call mlockall() on our
2375 * process for all current and future memory. */
2377 /** List of "entry", "middle", "exit", "introduction", "rendezvous". */
2378 smartlist_t *AllowInvalidNodes;
2379 /** Bitmask; derived from AllowInvalidNodes. */
2380 invalid_router_usage_t _AllowInvalid;
2381 config_line_t *ExitPolicy; /**< Lists of exit policy components. */
2382 int ExitPolicyRejectPrivate; /**< Should we not exit to local addresses? */
2383 config_line_t *SocksPolicy; /**< Lists of socks policy components */
2384 config_line_t *DirPolicy; /**< Lists of dir policy components */
2385 /** Addresses to bind for listening for SOCKS connections. */
2386 config_line_t *SocksListenAddress;
2387 /** Addresses to bind for listening for transparent pf/netfilter
2388 * connections. */
2389 config_line_t *TransListenAddress;
2390 /** Addresses to bind for listening for transparent natd connections */
2391 config_line_t *NATDListenAddress;
2392 /** Addresses to bind for listening for SOCKS connections. */
2393 config_line_t *DNSListenAddress;
2394 /** Addresses to bind for listening for OR connections. */
2395 config_line_t *ORListenAddress;
2396 /** Addresses to bind for listening for directory connections. */
2397 config_line_t *DirListenAddress;
2398 /** Addresses to bind for listening for control connections. */
2399 config_line_t *ControlListenAddress;
2400 /** Local address to bind outbound sockets */
2401 char *OutboundBindAddress;
2402 /** Directory server only: which versions of
2403 * Tor should we tell users to run? */
2404 config_line_t *RecommendedVersions;
2405 config_line_t *RecommendedClientVersions;
2406 config_line_t *RecommendedServerVersions;
2407 /** Whether dirservers refuse router descriptors with private IPs. */
2408 int DirAllowPrivateAddresses;
2409 char *User; /**< Name of user to run Tor as. */
2410 char *Group; /**< Name of group to run Tor as. */
2411 int ORPort; /**< Port to listen on for OR connections. */
2412 int SocksPort; /**< Port to listen on for SOCKS connections. */
2413 /** Port to listen on for transparent pf/netfilter connections. */
2414 int TransPort;
2415 int NATDPort; /**< Port to listen on for transparent natd connections. */
2416 int ControlPort; /**< Port to listen on for control connections. */
2417 config_line_t *ControlSocket; /**< List of Unix Domain Sockets to listen on
2418 * for control connections. */
2419 int DirPort; /**< Port to listen on for directory connections. */
2420 int DNSPort; /**< Port to listen on for DNS requests. */
2421 int AssumeReachable; /**< Whether to publish our descriptor regardless. */
2422 int AuthoritativeDir; /**< Boolean: is this an authoritative directory? */
2423 int V1AuthoritativeDir; /**< Boolean: is this an authoritative directory
2424 * for version 1 directories? */
2425 int V2AuthoritativeDir; /**< Boolean: is this an authoritative directory
2426 * for version 2 directories? */
2427 int V3AuthoritativeDir; /**< Boolean: is this an authoritative directory
2428 * for version 3 directories? */
2429 int HSAuthoritativeDir; /**< Boolean: does this an authoritative directory
2430 * handle hidden service requests? */
2431 int NamingAuthoritativeDir; /**< Boolean: is this an authoritative directory
2432 * that's willing to bind names? */
2433 int VersioningAuthoritativeDir; /**< Boolean: is this an authoritative
2434 * directory that's willing to recommend
2435 * versions? */
2436 int BridgeAuthoritativeDir; /**< Boolean: is this an authoritative directory
2437 * that aggregates bridge descriptors? */
2439 /** If set on a bridge authority, it will answer requests on its dirport
2440 * for bridge statuses -- but only if the requests use this password.
2441 * If set on a bridge user, request bridge statuses, and use this password
2442 * when doing so. */
2443 char *BridgePassword;
2445 int UseBridges; /**< Boolean: should we start all circuits with a bridge? */
2446 config_line_t *Bridges; /**< List of bootstrap bridge addresses. */
2448 int BridgeRelay; /**< Boolean: are we acting as a bridge relay? We make
2449 * this explicit so we can change how we behave in the
2450 * future. */
2452 /** Boolean: if we know the bridge's digest, should we get new
2453 * descriptors from the bridge authorities or from the bridge itself? */
2454 int UpdateBridgesFromAuthority;
2456 int AvoidDiskWrites; /**< Boolean: should we never cache things to disk?
2457 * Not used yet. */
2458 int ClientOnly; /**< Boolean: should we never evolve into a server role? */
2459 /** To what authority types do we publish our descriptor? Choices are
2460 * "v1", "v2", "v3", "bridge", or "". */
2461 smartlist_t *PublishServerDescriptor;
2462 /** An authority type, derived from PublishServerDescriptor. */
2463 authority_type_t _PublishServerDescriptor;
2464 /** Boolean: do we publish hidden service descriptors to the HS auths? */
2465 int PublishHidServDescriptors;
2466 int FetchServerDescriptors; /**< Do we fetch server descriptors as normal? */
2467 int FetchHidServDescriptors; /** and hidden service descriptors? */
2468 int HidServDirectoryV2; /**< Do we participate in the HS DHT? */
2470 int MinUptimeHidServDirectoryV2; /**< As directory authority, accept hidden
2471 * service directories after what time? */
2472 int FetchUselessDescriptors; /**< Do we fetch non-running descriptors too? */
2473 int AllDirActionsPrivate; /**< Should every directory action be sent
2474 * through a Tor circuit? */
2476 int ConnLimit; /**< Demanded minimum number of simultaneous connections. */
2477 int _ConnLimit; /**< Maximum allowed number of simultaneous connections. */
2478 int RunAsDaemon; /**< If true, run in the background. (Unix only) */
2479 int FascistFirewall; /**< Whether to prefer ORs reachable on open ports. */
2480 smartlist_t *FirewallPorts; /**< Which ports our firewall allows
2481 * (strings). */
2482 config_line_t *ReachableAddresses; /**< IP:ports our firewall allows. */
2483 config_line_t *ReachableORAddresses; /**< IP:ports for OR conns. */
2484 config_line_t *ReachableDirAddresses; /**< IP:ports for Dir conns. */
2486 int ConstrainedSockets; /**< Shrink xmit and recv socket buffers. */
2487 uint64_t ConstrainedSockSize; /**< Size of constrained buffers. */
2489 /** Whether we should drop exit streams from Tors that we don't know are
2490 * relays. One of "0" (never refuse), "1" (always refuse), or "auto" (do
2491 * what the consensus says, defaulting to 'refuse' if the consensus says
2492 * nothing). */
2493 char *RefuseUnknownExits;
2494 /** Parsed version of RefuseUnknownExits. -1 for auto. */
2495 int RefuseUnknownExits_;
2497 /** Application ports that require all nodes in circ to have sufficient
2498 * uptime. */
2499 smartlist_t *LongLivedPorts;
2500 /** Application ports that are likely to be unencrypted and
2501 * unauthenticated; we reject requests for them to prevent the
2502 * user from screwing up and leaking plaintext secrets to an
2503 * observer somewhere on the Internet. */
2504 smartlist_t *RejectPlaintextPorts;
2505 /** Related to RejectPlaintextPorts above, except this config option
2506 * controls whether we warn (in the log and via a controller status
2507 * event) every time a risky connection is attempted. */
2508 smartlist_t *WarnPlaintextPorts;
2509 /** Should we try to reuse the same exit node for a given host */
2510 smartlist_t *TrackHostExits;
2511 int TrackHostExitsExpire; /**< Number of seconds until we expire an
2512 * addressmap */
2513 config_line_t *AddressMap; /**< List of address map directives. */
2514 int AutomapHostsOnResolve; /**< If true, when we get a resolve request for a
2515 * hostname ending with one of the suffixes in
2516 * <b>AutomapHostsSuffixes</b>, map it to a
2517 * virtual address. */
2518 smartlist_t *AutomapHostsSuffixes; /**< List of suffixes for
2519 * <b>AutomapHostsOnResolve</b>. */
2520 int RendPostPeriod; /**< How often do we post each rendezvous service
2521 * descriptor? Remember to publish them independently. */
2522 int KeepalivePeriod; /**< How often do we send padding cells to keep
2523 * connections alive? */
2524 int SocksTimeout; /**< How long do we let a socks connection wait
2525 * unattached before we fail it? */
2526 int LearnCircuitBuildTimeout; /**< If non-zero, we attempt to learn a value
2527 * for CircuitBuildTimeout based on timeout
2528 * history */
2529 int CircuitBuildTimeout; /**< Cull non-open circuits that were born at
2530 * least this many seconds ago. Used until
2531 * adaptive algorithm learns a new value. */
2532 int CircuitIdleTimeout; /**< Cull open clean circuits that were born
2533 * at least this many seconds ago. */
2534 int CircuitStreamTimeout; /**< If non-zero, detach streams from circuits
2535 * and try a new circuit if the stream has been
2536 * waiting for this many seconds. If zero, use
2537 * our default internal timeout schedule. */
2538 int MaxOnionsPending; /**< How many circuit CREATE requests do we allow
2539 * to wait simultaneously before we start dropping
2540 * them? */
2541 int NewCircuitPeriod; /**< How long do we use a circuit before building
2542 * a new one? */
2543 int MaxCircuitDirtiness; /**< Never use circs that were first used more than
2544 this interval ago. */
2545 uint64_t BandwidthRate; /**< How much bandwidth, on average, are we willing
2546 * to use in a second? */
2547 uint64_t BandwidthBurst; /**< How much bandwidth, at maximum, are we willing
2548 * to use in a second? */
2549 uint64_t MaxAdvertisedBandwidth; /**< How much bandwidth are we willing to
2550 * tell people we have? */
2551 uint64_t RelayBandwidthRate; /**< How much bandwidth, on average, are we
2552 * willing to use for all relayed conns? */
2553 uint64_t RelayBandwidthBurst; /**< How much bandwidth, at maximum, will we
2554 * use in a second for all relayed conns? */
2555 uint64_t PerConnBWRate; /**< Long-term bw on a single TLS conn, if set. */
2556 uint64_t PerConnBWBurst; /**< Allowed burst on a single TLS conn, if set. */
2557 int NumCPUs; /**< How many CPUs should we try to use? */
2558 //int RunTesting; /**< If true, create testing circuits to measure how well the
2559 // * other ORs are running. */
2560 config_line_t *RendConfigLines; /**< List of configuration lines
2561 * for rendezvous services. */
2562 config_line_t *HidServAuth; /**< List of configuration lines for client-side
2563 * authorizations for hidden services */
2564 char *ContactInfo; /**< Contact info to be published in the directory. */
2566 char *HTTPProxy; /**< hostname[:port] to use as http proxy, if any. */
2567 tor_addr_t HTTPProxyAddr; /**< Parsed IPv4 addr for http proxy, if any. */
2568 uint16_t HTTPProxyPort; /**< Parsed port for http proxy, if any. */
2569 char *HTTPProxyAuthenticator; /**< username:password string, if any. */
2571 char *HTTPSProxy; /**< hostname[:port] to use as https proxy, if any. */
2572 tor_addr_t HTTPSProxyAddr; /**< Parsed addr for https proxy, if any. */
2573 uint16_t HTTPSProxyPort; /**< Parsed port for https proxy, if any. */
2574 char *HTTPSProxyAuthenticator; /**< username:password string, if any. */
2576 char *Socks4Proxy; /**< hostname:port to use as a SOCKS4 proxy, if any. */
2577 tor_addr_t Socks4ProxyAddr; /**< Derived from Socks4Proxy. */
2578 uint16_t Socks4ProxyPort; /**< Derived from Socks4Proxy. */
2580 char *Socks5Proxy; /**< hostname:port to use as a SOCKS5 proxy, if any. */
2581 tor_addr_t Socks5ProxyAddr; /**< Derived from Sock5Proxy. */
2582 uint16_t Socks5ProxyPort; /**< Derived from Socks5Proxy. */
2583 char *Socks5ProxyUsername; /**< Username for SOCKS5 authentication, if any */
2584 char *Socks5ProxyPassword; /**< Password for SOCKS5 authentication, if any */
2586 /** List of configuration lines for replacement directory authorities.
2587 * If you just want to replace one class of authority at a time,
2588 * use the "Alternate*Authority" options below instead. */
2589 config_line_t *DirServers;
2591 /** If set, use these main (currently v3) directory authorities and
2592 * not the default ones. */
2593 config_line_t *AlternateDirAuthority;
2595 /** If set, use these bridge authorities and not the default one. */
2596 config_line_t *AlternateBridgeAuthority;
2598 /** If set, use these HS authorities and not the default ones. */
2599 config_line_t *AlternateHSAuthority;
2601 char *MyFamily; /**< Declared family for this OR. */
2602 config_line_t *NodeFamilies; /**< List of config lines for
2603 * node families */
2604 config_line_t *AuthDirBadDir; /**< Address policy for descriptors to
2605 * mark as bad dir mirrors. */
2606 config_line_t *AuthDirBadExit; /**< Address policy for descriptors to
2607 * mark as bad exits. */
2608 config_line_t *AuthDirReject; /**< Address policy for descriptors to
2609 * reject. */
2610 config_line_t *AuthDirInvalid; /**< Address policy for descriptors to
2611 * never mark as valid. */
2612 int AuthDirListBadDirs; /**< True iff we should list bad dirs,
2613 * and vote for all other dir mirrors as good. */
2614 int AuthDirListBadExits; /**< True iff we should list bad exits,
2615 * and vote for all other exits as good. */
2616 int AuthDirRejectUnlisted; /**< Boolean: do we reject all routers that
2617 * aren't named in our fingerprint file? */
2618 int AuthDirMaxServersPerAddr; /**< Do not permit more than this
2619 * number of servers per IP address. */
2620 int AuthDirMaxServersPerAuthAddr; /**< Do not permit more than this
2621 * number of servers per IP address shared
2622 * with an authority. */
2624 char *AccountingStart; /**< How long is the accounting interval, and when
2625 * does it start? */
2626 uint64_t AccountingMax; /**< How many bytes do we allow per accounting
2627 * interval before hibernation? 0 for "never
2628 * hibernate." */
2630 /** Base64-encoded hash of accepted passwords for the control system. */
2631 config_line_t *HashedControlPassword;
2632 /** As HashedControlPassword, but not saved. */
2633 config_line_t *HashedControlSessionPassword;
2635 int CookieAuthentication; /**< Boolean: do we enable cookie-based auth for
2636 * the control system? */
2637 char *CookieAuthFile; /**< Location of a cookie authentication file. */
2638 int CookieAuthFileGroupReadable; /**< Boolean: Is the CookieAuthFile g+r? */
2639 int LeaveStreamsUnattached; /**< Boolean: Does Tor attach new streams to
2640 * circuits itself (0), or does it expect a controller
2641 * to cope? (1) */
2642 int DisablePredictedCircuits; /**< Boolean: does Tor preemptively
2643 * make circuits in the background (0),
2644 * or not (1)? */
2645 int ShutdownWaitLength; /**< When we get a SIGINT and we're a server, how
2646 * long do we wait before exiting? */
2647 char *SafeLogging; /**< Contains "relay", "1", "0" (meaning no scrubbing). */
2649 /* Derived from SafeLogging */
2650 enum {
2651 SAFELOG_SCRUB_ALL, SAFELOG_SCRUB_RELAY, SAFELOG_SCRUB_NONE
2652 } _SafeLogging;
2654 int SafeSocks; /**< Boolean: should we outright refuse application
2655 * connections that use socks4 or socks5-with-local-dns? */
2656 #define LOG_PROTOCOL_WARN (get_options()->ProtocolWarnings ? \
2657 LOG_WARN : LOG_INFO)
2658 int ProtocolWarnings; /**< Boolean: when other parties screw up the Tor
2659 * protocol, is it a warn or an info in our logs? */
2660 int TestSocks; /**< Boolean: when we get a socks connection, do we loudly
2661 * log whether it was DNS-leaking or not? */
2662 int HardwareAccel; /**< Boolean: Should we enable OpenSSL hardware
2663 * acceleration where available? */
2664 char *AccelName; /**< Optional hardware acceleration engine name. */
2665 char *AccelDir; /**< Optional hardware acceleration engine search dir. */
2666 int UseEntryGuards; /**< Boolean: Do we try to enter from a smallish number
2667 * of fixed nodes? */
2668 int NumEntryGuards; /**< How many entry guards do we try to establish? */
2669 int RephistTrackTime; /**< How many seconds do we keep rephist info? */
2670 int FastFirstHopPK; /**< If Tor believes it is safe, should we save a third
2671 * of our PK time by sending CREATE_FAST cells? */
2672 /** Should we always fetch our dir info on the mirror schedule (which
2673 * means directly from the authorities) no matter our other config? */
2674 int FetchDirInfoEarly;
2676 /** Should we fetch our dir info at the start of the consensus period? */
2677 int FetchDirInfoExtraEarly;
2679 char *VirtualAddrNetwork; /**< Address and mask to hand out for virtual
2680 * MAPADDRESS requests. */
2681 int ServerDNSSearchDomains; /**< Boolean: If set, we don't force exit
2682 * addresses to be FQDNs, but rather search for them in
2683 * the local domains. */
2684 int ServerDNSDetectHijacking; /**< Boolean: If true, check for DNS failure
2685 * hijacking. */
2686 int ServerDNSRandomizeCase; /**< Boolean: Use the 0x20-hack to prevent
2687 * DNS poisoning attacks. */
2688 char *ServerDNSResolvConfFile; /**< If provided, we configure our internal
2689 * resolver from the file here rather than from
2690 * /etc/resolv.conf (Unix) or the registry (Windows). */
2691 char *DirPortFrontPage; /**< This is a full path to a file with an html
2692 disclaimer. This allows a server administrator to show
2693 that they're running Tor and anyone visiting their server
2694 will know this without any specialized knowledge. */
2695 /** Boolean: if set, we start even if our resolv.conf file is missing
2696 * or broken. */
2697 int ServerDNSAllowBrokenConfig;
2699 smartlist_t *ServerDNSTestAddresses; /**< A list of addresses that definitely
2700 * should be resolvable. Used for
2701 * testing our DNS server. */
2702 int EnforceDistinctSubnets; /**< If true, don't allow multiple routers in the
2703 * same network zone in the same circuit. */
2704 int TunnelDirConns; /**< If true, use BEGIN_DIR rather than BEGIN when
2705 * possible. */
2706 int PreferTunneledDirConns; /**< If true, avoid dirservers that don't
2707 * support BEGIN_DIR, when possible. */
2708 int AllowNonRFC953Hostnames; /**< If true, we allow connections to hostnames
2709 * with weird characters. */
2710 /** If true, we try resolving hostnames with weird characters. */
2711 int ServerDNSAllowNonRFC953Hostnames;
2713 /** If true, we try to download extra-info documents (and we serve them,
2714 * if we are a cache). For authorities, this is always true. */
2715 int DownloadExtraInfo;
2717 /** If true, and we are acting as a relay, allow exit circuits even when
2718 * we are the first hop of a circuit. */
2719 int AllowSingleHopExits;
2720 /** If true, don't allow relays with AllowSingleHopExits=1 to be used in
2721 * circuits that we build. */
2722 int ExcludeSingleHopRelays;
2723 /** If true, and the controller tells us to use a one-hop circuit, and the
2724 * exit allows it, we use it. */
2725 int AllowSingleHopCircuits;
2727 /** If true, we convert "www.google.com.foo.exit" addresses on the
2728 * socks/trans/natd ports into "www.google.com" addresses that
2729 * exit from the node "foo". Disabled by default since attacking
2730 * websites and exit relays can use it to manipulate your path
2731 * selection. */
2732 int AllowDotExit;
2734 /** If true, we will warn if a user gives us only an IP address
2735 * instead of a hostname. */
2736 int WarnUnsafeSocks;
2738 /** If true, the user wants us to collect statistics on clients
2739 * requesting network statuses from us as directory. */
2740 int DirReqStatistics;
2742 /** If true, the user wants us to collect statistics on port usage. */
2743 int ExitPortStatistics;
2745 /** If true, the user wants us to collect cell statistics. */
2746 int CellStatistics;
2748 /** If true, the user wants us to collect statistics as entry node. */
2749 int EntryStatistics;
2751 /** If true, include statistics file contents in extra-info documents. */
2752 int ExtraInfoStatistics;
2754 /** If true, do not believe anybody who tells us that a domain resolves
2755 * to an internal address, or that an internal address has a PTR mapping.
2756 * Helps avoid some cross-site attacks. */
2757 int ClientDNSRejectInternalAddresses;
2759 /** If true, do not accept any requests to connect to internal addresses
2760 * over randomly chosen exits. */
2761 int ClientRejectInternalAddresses;
2763 /** The length of time that we think a consensus should be fresh. */
2764 int V3AuthVotingInterval;
2765 /** The length of time we think it will take to distribute votes. */
2766 int V3AuthVoteDelay;
2767 /** The length of time we think it will take to distribute signatures. */
2768 int V3AuthDistDelay;
2769 /** The number of intervals we think a consensus should be valid. */
2770 int V3AuthNIntervalsValid;
2772 /** Should advertise and sign consensuses with a legacy key, for key
2773 * migration purposes? */
2774 int V3AuthUseLegacyKey;
2776 /** Location of bandwidth measurement file */
2777 char *V3BandwidthsFile;
2779 /** Authority only: key=value pairs that we add to our networkstatus
2780 * consensus vote on the 'params' line. */
2781 char *ConsensusParams;
2783 /** The length of time that we think an initial consensus should be fresh.
2784 * Only altered on testing networks. */
2785 int TestingV3AuthInitialVotingInterval;
2787 /** The length of time we think it will take to distribute initial votes.
2788 * Only altered on testing networks. */
2789 int TestingV3AuthInitialVoteDelay;
2791 /** The length of time we think it will take to distribute initial
2792 * signatures. Only altered on testing networks.*/
2793 int TestingV3AuthInitialDistDelay;
2795 /** If an authority has been around for less than this amount of time, it
2796 * does not believe its reachability information is accurate. Only
2797 * altered on testing networks. */
2798 int TestingAuthDirTimeToLearnReachability;
2800 /** Clients don't download any descriptor this recent, since it will
2801 * probably not have propagated to enough caches. Only altered on testing
2802 * networks. */
2803 int TestingEstimatedDescriptorPropagationTime;
2805 /** If true, we take part in a testing network. Change the defaults of a
2806 * couple of other configuration options and allow to change the values
2807 * of certain configuration options. */
2808 int TestingTorNetwork;
2810 /** File to check for a consensus networkstatus, if we don't have one
2811 * cached. */
2812 char *FallbackNetworkstatusFile;
2814 /** If true, and we have GeoIP data, and we're a bridge, keep a per-country
2815 * count of how many client addresses have contacted us so that we can help
2816 * the bridge authority guess which countries have blocked access to us. */
2817 int BridgeRecordUsageByCountry;
2819 /** Optionally, a file with GeoIP data. */
2820 char *GeoIPFile;
2822 /** If true, SIGHUP should reload the torrc. Sometimes controllers want
2823 * to make this false. */
2824 int ReloadTorrcOnSIGHUP;
2826 /* The main parameter for picking circuits within a connection.
2828 * If this value is positive, when picking a cell to relay on a connection,
2829 * we always relay from the circuit whose weighted cell count is lowest.
2830 * Cells are weighted exponentially such that if one cell is sent
2831 * 'CircuitPriorityHalflife' seconds before another, it counts for half as
2832 * much.
2834 * If this value is zero, we're disabling the cell-EWMA algorithm.
2836 * If this value is negative, we're using the default approach
2837 * according to either Tor or a parameter set in the consensus.
2839 double CircuitPriorityHalflife;
2841 } or_options_t;
2843 /** Persistent state for an onion router, as saved to disk. */
2844 typedef struct {
2845 uint32_t _magic;
2846 /** The time at which we next plan to write the state to the disk. Equal to
2847 * TIME_MAX if there are no savable changes, 0 if there are changes that
2848 * should be saved right away. */
2849 time_t next_write;
2851 /** When was the state last written to disk? */
2852 time_t LastWritten;
2854 /** Fields for accounting bandwidth use. */
2855 time_t AccountingIntervalStart;
2856 uint64_t AccountingBytesReadInInterval;
2857 uint64_t AccountingBytesWrittenInInterval;
2858 int AccountingSecondsActive;
2859 int AccountingSecondsToReachSoftLimit;
2860 time_t AccountingSoftLimitHitAt;
2861 uint64_t AccountingBytesAtSoftLimit;
2862 uint64_t AccountingExpectedUsage;
2864 /** A list of Entry Guard-related configuration lines. */
2865 config_line_t *EntryGuards;
2867 /** These fields hold information on the history of bandwidth usage for
2868 * servers. The "Ends" fields hold the time when we last updated the
2869 * bandwidth usage. The "Interval" fields hold the granularity, in seconds,
2870 * of the entries of Values. The "Values" lists hold decimal string
2871 * representations of the number of bytes read or written in each
2872 * interval. */
2873 time_t BWHistoryReadEnds;
2874 int BWHistoryReadInterval;
2875 smartlist_t *BWHistoryReadValues;
2876 time_t BWHistoryWriteEnds;
2877 int BWHistoryWriteInterval;
2878 smartlist_t *BWHistoryWriteValues;
2879 time_t BWHistoryDirReadEnds;
2880 int BWHistoryDirReadInterval;
2881 smartlist_t *BWHistoryDirReadValues;
2882 time_t BWHistoryDirWriteEnds;
2883 int BWHistoryDirWriteInterval;
2884 smartlist_t *BWHistoryDirWriteValues;
2886 /** Build time histogram */
2887 config_line_t * BuildtimeHistogram;
2888 unsigned int TotalBuildTimes;
2889 unsigned int CircuitBuildAbandonedCount;
2891 /** What version of Tor wrote this state file? */
2892 char *TorVersion;
2894 /** Holds any unrecognized values we found in the state file, in the order
2895 * in which we found them. */
2896 config_line_t *ExtraLines;
2898 /** When did we last rotate our onion key? "0" for 'no idea'. */
2899 time_t LastRotatedOnionKey;
2900 } or_state_t;
2902 /** Change the next_write time of <b>state</b> to <b>when</b>, unless the
2903 * state is already scheduled to be written to disk earlier than <b>when</b>.
2905 static INLINE void or_state_mark_dirty(or_state_t *state, time_t when)
2907 if (state->next_write > when)
2908 state->next_write = when;
2911 #define MAX_SOCKS_REPLY_LEN 1024
2912 #define MAX_SOCKS_ADDR_LEN 256
2914 /** Please open a TCP connection to this addr:port. */
2915 #define SOCKS_COMMAND_CONNECT 0x01
2916 /** Please turn this FQDN into an IP address, privately. */
2917 #define SOCKS_COMMAND_RESOLVE 0xF0
2918 /** Please turn this IP address into an FQDN, privately. */
2919 #define SOCKS_COMMAND_RESOLVE_PTR 0xF1
2921 #define SOCKS_COMMAND_IS_CONNECT(c) ((c)==SOCKS_COMMAND_CONNECT)
2922 #define SOCKS_COMMAND_IS_RESOLVE(c) ((c)==SOCKS_COMMAND_RESOLVE || \
2923 (c)==SOCKS_COMMAND_RESOLVE_PTR)
2925 /** State of a SOCKS request from a user to an OP. Also used to encode other
2926 * information for non-socks user request (such as those on TransPort and
2927 * DNSPort) */
2928 struct socks_request_t {
2929 /** Which version of SOCKS did the client use? One of "0, 4, 5" -- where
2930 * 0 means that no socks handshake ever took place, and this is just a
2931 * stub connection (e.g. see connection_ap_make_link()). */
2932 char socks_version;
2933 int command; /**< What is this stream's goal? One from the above list. */
2934 size_t replylen; /**< Length of <b>reply</b>. */
2935 char reply[MAX_SOCKS_REPLY_LEN]; /**< Write an entry into this string if
2936 * we want to specify our own socks reply,
2937 * rather than using the default socks4 or
2938 * socks5 socks reply. We use this for the
2939 * two-stage socks5 handshake.
2941 char address[MAX_SOCKS_ADDR_LEN]; /**< What address did the client ask to
2942 connect to/resolve? */
2943 uint16_t port; /**< What port did the client ask to connect to? */
2944 unsigned int has_finished : 1; /**< Has the SOCKS handshake finished? Used to
2945 * make sure we send back a socks reply for
2946 * every connection. */
2949 /* all the function prototypes go here */
2951 /********************************* circuitbuild.c **********************/
2953 /** How many hops does a general-purpose circuit have by default? */
2954 #define DEFAULT_ROUTE_LEN 3
2956 /* Circuit Build Timeout "public" structures. */
2958 /** Precision multiplier for the Bw weights */
2959 #define BW_WEIGHT_SCALE 10000
2960 #define BW_MIN_WEIGHT_SCALE 1
2961 #define BW_MAX_WEIGHT_SCALE INT32_MAX
2963 /** Total size of the circuit timeout history to accumulate.
2964 * 1000 is approx 2.5 days worth of continual-use circuits. */
2965 #define CBT_NCIRCUITS_TO_OBSERVE 1000
2967 /** Width of the histogram bins in milliseconds */
2968 #define CBT_BIN_WIDTH ((build_time_t)50)
2970 /** Number of modes to use in the weighted-avg computation of Xm */
2971 #define CBT_DEFAULT_NUM_XM_MODES 3
2972 #define CBT_MIN_NUM_XM_MODES 1
2973 #define CBT_MAX_NUM_XM_MODES 20
2975 /** A build_time_t is milliseconds */
2976 typedef uint32_t build_time_t;
2979 * CBT_BUILD_ABANDONED is our flag value to represent a force-closed
2980 * circuit (Aka a 'right-censored' pareto value).
2982 #define CBT_BUILD_ABANDONED ((build_time_t)(INT32_MAX-1))
2983 #define CBT_BUILD_TIME_MAX ((build_time_t)(INT32_MAX))
2985 /** Save state every 10 circuits */
2986 #define CBT_SAVE_STATE_EVERY 10
2988 /* Circuit build times consensus parameters */
2991 * How long to wait before actually closing circuits that take too long to
2992 * build in terms of CDF quantile.
2994 #define CBT_DEFAULT_CLOSE_QUANTILE 95
2995 #define CBT_MIN_CLOSE_QUANTILE CBT_MIN_QUANTILE_CUTOFF
2996 #define CBT_MAX_CLOSE_QUANTILE CBT_MAX_QUANTILE_CUTOFF
2999 * How many circuits count as recent when considering if the
3000 * connection has gone gimpy or changed.
3002 #define CBT_DEFAULT_RECENT_CIRCUITS 20
3003 #define CBT_MIN_RECENT_CIRCUITS 3
3004 #define CBT_MAX_RECENT_CIRCUITS 1000
3007 * Maximum count of timeouts that finish the first hop in the past
3008 * RECENT_CIRCUITS before calculating a new timeout.
3010 * This tells us whether to abandon timeout history and set
3011 * the timeout back to whatever circuit_build_times_get_initial_timeout()
3012 * gives us.
3014 #define CBT_DEFAULT_MAX_RECENT_TIMEOUT_COUNT (CBT_DEFAULT_RECENT_CIRCUITS*9/10)
3015 #define CBT_MIN_MAX_RECENT_TIMEOUT_COUNT 3
3016 #define CBT_MAX_MAX_RECENT_TIMEOUT_COUNT 10000
3018 /** Minimum circuits before estimating a timeout */
3019 #define CBT_DEFAULT_MIN_CIRCUITS_TO_OBSERVE 100
3020 #define CBT_MIN_MIN_CIRCUITS_TO_OBSERVE 1
3021 #define CBT_MAX_MIN_CIRCUITS_TO_OBSERVE 10000
3023 /** Cutoff percentile on the CDF for our timeout estimation. */
3024 #define CBT_DEFAULT_QUANTILE_CUTOFF 80
3025 #define CBT_MIN_QUANTILE_CUTOFF 10
3026 #define CBT_MAX_QUANTILE_CUTOFF 99
3027 double circuit_build_times_quantile_cutoff(void);
3029 /** How often in seconds should we build a test circuit */
3030 #define CBT_DEFAULT_TEST_FREQUENCY 60
3031 #define CBT_MIN_TEST_FREQUENCY 1
3032 #define CBT_MAX_TEST_FREQUENCY INT32_MAX
3034 /** Lowest allowable value for CircuitBuildTimeout in milliseconds */
3035 #define CBT_DEFAULT_TIMEOUT_MIN_VALUE (1500)
3036 #define CBT_MIN_TIMEOUT_MIN_VALUE 500
3037 #define CBT_MAX_TIMEOUT_MIN_VALUE INT32_MAX
3039 /** Initial circuit build timeout in milliseconds */
3040 #define CBT_DEFAULT_TIMEOUT_INITIAL_VALUE (60*1000)
3041 #define CBT_MIN_TIMEOUT_INITIAL_VALUE CBT_MIN_TIMEOUT_MIN_VALUE
3042 #define CBT_MAX_TIMEOUT_INITIAL_VALUE INT32_MAX
3043 int32_t circuit_build_times_initial_timeout(void);
3045 #if CBT_DEFAULT_MAX_RECENT_TIMEOUT_COUNT < CBT_MIN_MAX_RECENT_TIMEOUT_COUNT
3046 #error "RECENT_CIRCUITS is set too low."
3047 #endif
3049 /** Information about the state of our local network connection */
3050 typedef struct {
3051 /** The timestamp we last completed a TLS handshake or received a cell */
3052 time_t network_last_live;
3053 /** If the network is not live, how many timeouts has this caused? */
3054 int nonlive_timeouts;
3055 /** Circular array of circuits that have made it to the first hop. Slot is
3056 * 1 if circuit timed out, 0 if circuit succeeded */
3057 int8_t *timeouts_after_firsthop;
3058 /** Number of elements allocated for the above array */
3059 int num_recent_circs;
3060 /** Index into circular array. */
3061 int after_firsthop_idx;
3062 } network_liveness_t;
3064 /** Structure for circuit build times history */
3065 typedef struct {
3066 /** The circular array of recorded build times in milliseconds */
3067 build_time_t circuit_build_times[CBT_NCIRCUITS_TO_OBSERVE];
3068 /** Current index in the circuit_build_times circular array */
3069 int build_times_idx;
3070 /** Total number of build times accumulated. Max CBT_NCIRCUITS_TO_OBSERVE */
3071 int total_build_times;
3072 /** Information about the state of our local network connection */
3073 network_liveness_t liveness;
3074 /** Last time we built a circuit. Used to decide to build new test circs */
3075 time_t last_circ_at;
3076 /** "Minimum" value of our pareto distribution (actually mode) */
3077 build_time_t Xm;
3078 /** alpha exponent for pareto dist. */
3079 double alpha;
3080 /** Have we computed a timeout? */
3081 int have_computed_timeout;
3082 /** The exact value for that timeout in milliseconds. Stored as a double
3083 * to maintain precision from calculations to and from quantile value. */
3084 double timeout_ms;
3085 /** How long we wait before actually closing the circuit. */
3086 double close_ms;
3087 } circuit_build_times_t;
3089 /********************************* config.c ***************************/
3091 /** An error from options_trial_assign() or options_init_from_string(). */
3092 typedef enum setopt_err_t {
3093 SETOPT_OK = 0,
3094 SETOPT_ERR_MISC = -1,
3095 SETOPT_ERR_PARSE = -2,
3096 SETOPT_ERR_TRANSITION = -3,
3097 SETOPT_ERR_SETTING = -4,
3098 } setopt_err_t;
3100 /********************************* connection_edge.c *************************/
3102 /** Enumerates possible origins of a client-side address mapping. */
3103 typedef enum {
3104 /** We're remapping this address because the controller told us to. */
3105 ADDRMAPSRC_CONTROLLER,
3106 /** We're remapping this address because our configuration (via torrc, the
3107 * command line, or a SETCONF command) told us to. */
3108 ADDRMAPSRC_TORRC,
3109 /** We're remapping this address because we have TrackHostExit configured,
3110 * and we want to remember to use the same exit next time. */
3111 ADDRMAPSRC_TRACKEXIT,
3112 /** We're remapping this address because we got a DNS resolution from a
3113 * Tor server that told us what its value was. */
3114 ADDRMAPSRC_DNS,
3115 } addressmap_entry_source_t;
3117 /********************************* control.c ***************************/
3119 /** Used to indicate the type of a circuit event passed to the controller.
3120 * The various types are defined in control-spec.txt */
3121 typedef enum circuit_status_event_t {
3122 CIRC_EVENT_LAUNCHED = 0,
3123 CIRC_EVENT_BUILT = 1,
3124 CIRC_EVENT_EXTENDED = 2,
3125 CIRC_EVENT_FAILED = 3,
3126 CIRC_EVENT_CLOSED = 4,
3127 } circuit_status_event_t;
3129 /** Used to indicate the type of a stream event passed to the controller.
3130 * The various types are defined in control-spec.txt */
3131 typedef enum stream_status_event_t {
3132 STREAM_EVENT_SENT_CONNECT = 0,
3133 STREAM_EVENT_SENT_RESOLVE = 1,
3134 STREAM_EVENT_SUCCEEDED = 2,
3135 STREAM_EVENT_FAILED = 3,
3136 STREAM_EVENT_CLOSED = 4,
3137 STREAM_EVENT_NEW = 5,
3138 STREAM_EVENT_NEW_RESOLVE = 6,
3139 STREAM_EVENT_FAILED_RETRIABLE = 7,
3140 STREAM_EVENT_REMAP = 8
3141 } stream_status_event_t;
3143 /** Used to indicate the type of an OR connection event passed to the
3144 * controller. The various types are defined in control-spec.txt */
3145 typedef enum or_conn_status_event_t {
3146 OR_CONN_EVENT_LAUNCHED = 0,
3147 OR_CONN_EVENT_CONNECTED = 1,
3148 OR_CONN_EVENT_FAILED = 2,
3149 OR_CONN_EVENT_CLOSED = 3,
3150 OR_CONN_EVENT_NEW = 4,
3151 } or_conn_status_event_t;
3153 /** Used to indicate the type of a buildtime event */
3154 typedef enum buildtimeout_set_event_t {
3155 BUILDTIMEOUT_SET_EVENT_COMPUTED = 0,
3156 BUILDTIMEOUT_SET_EVENT_RESET = 1,
3157 BUILDTIMEOUT_SET_EVENT_SUSPENDED = 2,
3158 BUILDTIMEOUT_SET_EVENT_DISCARD = 3,
3159 BUILDTIMEOUT_SET_EVENT_RESUME = 4
3160 } buildtimeout_set_event_t;
3162 /** Execute the statement <b>stmt</b>, which may log events concerning the
3163 * connection <b>conn</b>. To prevent infinite loops, disable log messages
3164 * being sent to controllers if <b>conn</b> is a control connection.
3166 * Stmt must not contain any return or goto statements.
3168 #define CONN_LOG_PROTECT(conn, stmt) \
3169 STMT_BEGIN \
3170 int _log_conn_is_control = (conn && conn->type == CONN_TYPE_CONTROL); \
3171 if (_log_conn_is_control) \
3172 disable_control_logging(); \
3173 STMT_BEGIN stmt; STMT_END; \
3174 if (_log_conn_is_control) \
3175 enable_control_logging(); \
3176 STMT_END
3178 /** Enum describing various stages of bootstrapping, for use with controller
3179 * bootstrap status events. The values range from 0 to 100. */
3180 typedef enum {
3181 BOOTSTRAP_STATUS_UNDEF=-1,
3182 BOOTSTRAP_STATUS_STARTING=0,
3183 BOOTSTRAP_STATUS_CONN_DIR=5,
3184 BOOTSTRAP_STATUS_HANDSHAKE=-2,
3185 BOOTSTRAP_STATUS_HANDSHAKE_DIR=10,
3186 BOOTSTRAP_STATUS_ONEHOP_CREATE=15,
3187 BOOTSTRAP_STATUS_REQUESTING_STATUS=20,
3188 BOOTSTRAP_STATUS_LOADING_STATUS=25,
3189 BOOTSTRAP_STATUS_LOADING_KEYS=40,
3190 BOOTSTRAP_STATUS_REQUESTING_DESCRIPTORS=45,
3191 BOOTSTRAP_STATUS_LOADING_DESCRIPTORS=50,
3192 BOOTSTRAP_STATUS_CONN_OR=80,
3193 BOOTSTRAP_STATUS_HANDSHAKE_OR=85,
3194 BOOTSTRAP_STATUS_CIRCUIT_CREATE=90,
3195 BOOTSTRAP_STATUS_DONE=100
3196 } bootstrap_status_t;
3198 /********************************* directory.c ***************************/
3200 /** A pair of digests created by dir_split_resource_info_fingerprint_pairs() */
3201 typedef struct {
3202 char first[DIGEST_LEN];
3203 char second[DIGEST_LEN];
3204 } fp_pair_t;
3206 /********************************* dirserv.c ***************************/
3207 typedef enum {
3208 NS_V2, NS_V3_CONSENSUS, NS_V3_VOTE, NS_CONTROL_PORT,
3209 NS_V3_CONSENSUS_MICRODESC
3210 } routerstatus_format_type_t;
3212 #ifdef DIRSERV_PRIVATE
3213 typedef struct measured_bw_line_t {
3214 char node_id[DIGEST_LEN];
3215 char node_hex[MAX_HEX_NICKNAME_LEN+1];
3216 long int bw;
3217 } measured_bw_line_t;
3219 #endif
3221 /********************************* dirvote.c ************************/
3223 /** Describes the schedule by which votes should be generated. */
3224 typedef struct vote_timing_t {
3225 int vote_interval;
3226 int n_intervals_valid;
3227 int vote_delay;
3228 int dist_delay;
3229 } vote_timing_t;
3231 /********************************* geoip.c **************************/
3233 /** Round all GeoIP results to the next multiple of this value, to avoid
3234 * leaking information. */
3235 #define DIR_RECORD_USAGE_GRANULARITY 8
3236 /** Time interval: Flush geoip data to disk this often. */
3237 #define DIR_ENTRY_RECORD_USAGE_RETAIN_IPS (24*60*60)
3238 /** How long do we have to have observed per-country request history before
3239 * we are willing to talk about it? */
3240 #define DIR_RECORD_USAGE_MIN_OBSERVATION_TIME (12*60*60)
3242 /** Indicates an action that we might be noting geoip statistics on.
3243 * Note that if we're noticing CONNECT, we're a bridge, and if we're noticing
3244 * the others, we're not.
3246 typedef enum {
3247 /** We've noticed a connection as a bridge relay or entry guard. */
3248 GEOIP_CLIENT_CONNECT = 0,
3249 /** We've served a networkstatus consensus as a directory server. */
3250 GEOIP_CLIENT_NETWORKSTATUS = 1,
3251 /** We've served a v2 networkstatus consensus as a directory server. */
3252 GEOIP_CLIENT_NETWORKSTATUS_V2 = 2,
3253 } geoip_client_action_t;
3254 /** Indicates either a positive reply or a reason for rejectng a network
3255 * status request that will be included in geoip statistics. */
3256 typedef enum {
3257 /** Request is answered successfully. */
3258 GEOIP_SUCCESS = 0,
3259 /** V3 network status is not signed by a sufficient number of requested
3260 * authorities. */
3261 GEOIP_REJECT_NOT_ENOUGH_SIGS = 1,
3262 /** Requested network status object is unavailable. */
3263 GEOIP_REJECT_UNAVAILABLE = 2,
3264 /** Requested network status not found. */
3265 GEOIP_REJECT_NOT_FOUND = 3,
3266 /** Network status has not been modified since If-Modified-Since time. */
3267 GEOIP_REJECT_NOT_MODIFIED = 4,
3268 /** Directory is busy. */
3269 GEOIP_REJECT_BUSY = 5,
3270 } geoip_ns_response_t;
3271 #define GEOIP_NS_RESPONSE_NUM 6
3273 /** Directory requests that we are measuring can be either direct or
3274 * tunneled. */
3275 typedef enum {
3276 DIRREQ_DIRECT = 0,
3277 DIRREQ_TUNNELED = 1,
3278 } dirreq_type_t;
3280 /** Possible states for either direct or tunneled directory requests that
3281 * are relevant for determining network status download times. */
3282 typedef enum {
3283 /** Found that the client requests a network status; applies to both
3284 * direct and tunneled requests; initial state of a request that we are
3285 * measuring. */
3286 DIRREQ_IS_FOR_NETWORK_STATUS = 0,
3287 /** Finished writing a network status to the directory connection;
3288 * applies to both direct and tunneled requests; completes a direct
3289 * request. */
3290 DIRREQ_FLUSHING_DIR_CONN_FINISHED = 1,
3291 /** END cell sent to circuit that initiated a tunneled request. */
3292 DIRREQ_END_CELL_SENT = 2,
3293 /** Flushed last cell from queue of the circuit that initiated a
3294 * tunneled request to the outbuf of the OR connection. */
3295 DIRREQ_CIRC_QUEUE_FLUSHED = 3,
3296 /** Flushed last byte from buffer of the OR connection belonging to the
3297 * circuit that initiated a tunneled request; completes a tunneled
3298 * request. */
3299 DIRREQ_OR_CONN_BUFFER_FLUSHED = 4
3300 } dirreq_state_t;
3302 #define WRITE_STATS_INTERVAL (24*60*60)
3304 /********************************* microdesc.c *************************/
3306 typedef struct microdesc_cache_t microdesc_cache_t;
3308 /********************************* networkstatus.c *********************/
3310 /** Location where we found a v2 networkstatus. */
3311 typedef enum {
3312 NS_FROM_CACHE, NS_FROM_DIR_BY_FP, NS_FROM_DIR_ALL, NS_GENERATED
3313 } v2_networkstatus_source_t;
3315 /** Possible statuses of a version of Tor, given opinions from the directory
3316 * servers. */
3317 typedef enum version_status_t {
3318 VS_RECOMMENDED=0, /**< This version is listed as recommended. */
3319 VS_OLD=1, /**< This version is older than any recommended version. */
3320 VS_NEW=2, /**< This version is newer than any recommended version. */
3321 VS_NEW_IN_SERIES=3, /**< This version is newer than any recommended version
3322 * in its series, but later recommended versions exist.
3324 VS_UNRECOMMENDED=4, /**< This version is not recommended (general case). */
3325 VS_EMPTY=5, /**< The version list was empty; no agreed-on versions. */
3326 VS_UNKNOWN, /**< We have no idea. */
3327 } version_status_t;
3329 /********************************* policies.c ************************/
3331 /** Outcome of applying an address policy to an address. */
3332 typedef enum {
3333 /** The address was accepted */
3334 ADDR_POLICY_ACCEPTED=0,
3335 /** The address was rejected */
3336 ADDR_POLICY_REJECTED=-1,
3337 /** Part of the address was unknown, but as far as we can tell, it was
3338 * accepted. */
3339 ADDR_POLICY_PROBABLY_ACCEPTED=1,
3340 /** Part of the address was unknown, but as far as we can tell, it was
3341 * rejected. */
3342 ADDR_POLICY_PROBABLY_REJECTED=2
3343 } addr_policy_result_t;
3345 /********************************* rephist.c ***************************/
3347 /** Possible public/private key operations in Tor: used to keep track of where
3348 * we're spending our time. */
3349 typedef enum {
3350 SIGN_DIR, SIGN_RTR,
3351 VERIFY_DIR, VERIFY_RTR,
3352 ENC_ONIONSKIN, DEC_ONIONSKIN,
3353 TLS_HANDSHAKE_C, TLS_HANDSHAKE_S,
3354 REND_CLIENT, REND_MID, REND_SERVER,
3355 } pk_op_t;
3357 /********************************* rendcommon.c ***************************/
3359 /** Hidden-service side configuration of client authorization. */
3360 typedef struct rend_authorized_client_t {
3361 char *client_name;
3362 char descriptor_cookie[REND_DESC_COOKIE_LEN];
3363 crypto_pk_env_t *client_key;
3364 } rend_authorized_client_t;
3366 /** ASCII-encoded v2 hidden service descriptor. */
3367 typedef struct rend_encoded_v2_service_descriptor_t {
3368 char desc_id[DIGEST_LEN]; /**< Descriptor ID. */
3369 char *desc_str; /**< Descriptor string. */
3370 } rend_encoded_v2_service_descriptor_t;
3372 /** Introduction point information. */
3373 typedef struct rend_intro_point_t {
3374 extend_info_t *extend_info; /**< Extend info of this introduction point. */
3375 crypto_pk_env_t *intro_key; /**< Introduction key that replaces the service
3376 * key, if this descriptor is V2. */
3377 } rend_intro_point_t;
3379 /** Information used to connect to a hidden service. */
3380 typedef struct rend_service_descriptor_t {
3381 crypto_pk_env_t *pk; /**< This service's public key. */
3382 int version; /**< Version of the descriptor format: 0 or 2. */
3383 time_t timestamp; /**< Time when the descriptor was generated. */
3384 uint16_t protocols; /**< Bitmask: which rendezvous protocols are supported?
3385 * (We allow bits '0', '1', and '2' to be set.) */
3386 /** List of the service's introduction points. Elements are removed if
3387 * introduction attempts fail. */
3388 smartlist_t *intro_nodes;
3389 /** Has descriptor been uploaded to all hidden service directories? */
3390 int all_uploads_performed;
3391 /** List of hidden service directories to which an upload request for
3392 * this descriptor could be sent. Smartlist exists only when at least one
3393 * of the previous upload requests failed (otherwise it's not important
3394 * to know which uploads succeeded and which not). */
3395 smartlist_t *successful_uploads;
3396 } rend_service_descriptor_t;
3398 /** A cached rendezvous descriptor. */
3399 typedef struct rend_cache_entry_t {
3400 size_t len; /**< Length of <b>desc</b> */
3401 time_t received; /**< When was the descriptor received? */
3402 char *desc; /**< Service descriptor */
3403 rend_service_descriptor_t *parsed; /**< Parsed value of 'desc' */
3404 } rend_cache_entry_t;
3406 /********************************* routerlist.c ***************************/
3408 /** Represents information about a single trusted directory server. */
3409 typedef struct trusted_dir_server_t {
3410 char *description;
3411 char *nickname;
3412 char *address; /**< Hostname. */
3413 uint32_t addr; /**< IPv4 address. */
3414 uint16_t dir_port; /**< Directory port. */
3415 uint16_t or_port; /**< OR port: Used for tunneling connections. */
3416 char digest[DIGEST_LEN]; /**< Digest of identity key. */
3417 char v3_identity_digest[DIGEST_LEN]; /**< Digest of v3 (authority only,
3418 * high-security) identity key. */
3420 unsigned int is_running:1; /**< True iff we think this server is running. */
3422 /** True iff this server has accepted the most recent server descriptor
3423 * we tried to upload to it. */
3424 unsigned int has_accepted_serverdesc:1;
3426 /** What kind of authority is this? (Bitfield.) */
3427 authority_type_t type;
3429 download_status_t v2_ns_dl_status; /**< Status of downloading this server's
3430 * v2 network status. */
3431 time_t addr_current_at; /**< When was the document that we derived the
3432 * address information from published? */
3434 routerstatus_t fake_status; /**< Used when we need to pass this trusted
3435 * dir_server_t to directory_initiate_command_*
3436 * as a routerstatus_t. Not updated by the
3437 * router-status management code!
3439 } trusted_dir_server_t;
3441 #define ROUTER_REQUIRED_MIN_BANDWIDTH (20*1024)
3443 #define ROUTER_MAX_DECLARED_BANDWIDTH INT32_MAX
3445 /* Flags for pick_directory_server and pick_trusteddirserver. */
3446 /** Flag to indicate that we should not automatically be willing to use
3447 * ourself to answer a directory request.
3448 * Passed to router_pick_directory_server (et al).*/
3449 #define PDS_ALLOW_SELF (1<<0)
3450 /** Flag to indicate that if no servers seem to be up, we should mark all
3451 * directory servers as up and try again.
3452 * Passed to router_pick_directory_server (et al).*/
3453 #define PDS_RETRY_IF_NO_SERVERS (1<<1)
3454 /** Flag to indicate that we should not exclude directory servers that
3455 * our ReachableAddress settings would exclude. This usually means that
3456 * we're going to connect to the server over Tor, and so we don't need to
3457 * worry about our firewall telling us we can't.
3458 * Passed to router_pick_directory_server (et al).*/
3459 #define PDS_IGNORE_FASCISTFIREWALL (1<<2)
3460 /** Flag to indicate that we should not use any directory authority to which
3461 * we have an existing directory connection for downloading server descriptors
3462 * or extrainfo documents.
3464 * Passed to router_pick_directory_server (et al)
3466 * [XXXX NOTE: This option is only implemented for pick_trusteddirserver,
3467 * not pick_directory_server. If we make it work on pick_directory_server
3468 * too, we could conservatively make it only prevent multiple fetches to
3469 * the same authority, or we could aggressively make it prevent multiple
3470 * fetches to _any_ single directory server.]
3472 #define PDS_NO_EXISTING_SERVERDESC_FETCH (1<<3)
3473 #define _PDS_PREFER_TUNNELED_DIR_CONNS (1<<16)
3475 /** Possible ways to weight routers when choosing one randomly. See
3476 * routerlist_sl_choose_by_bandwidth() for more information.*/
3477 typedef enum bandwidth_weight_rule_t {
3478 NO_WEIGHTING, WEIGHT_FOR_EXIT, WEIGHT_FOR_MID, WEIGHT_FOR_GUARD,
3479 WEIGHT_FOR_DIR
3480 } bandwidth_weight_rule_t;
3482 /** Flags to be passed to control router_choose_random_node() to indicate what
3483 * kind of nodes to pick according to what algorithm. */
3484 typedef enum {
3485 CRN_NEED_UPTIME = 1<<0,
3486 CRN_NEED_CAPACITY = 1<<1,
3487 CRN_NEED_GUARD = 1<<2,
3488 CRN_ALLOW_INVALID = 1<<3,
3489 /* XXXX not used, apparently. */
3490 CRN_WEIGHT_AS_EXIT = 1<<5
3491 } router_crn_flags_t;
3493 /** Return value for router_add_to_routerlist() and dirserv_add_descriptor() */
3494 typedef enum was_router_added_t {
3495 ROUTER_ADDED_SUCCESSFULLY = 1,
3496 ROUTER_ADDED_NOTIFY_GENERATOR = 0,
3497 ROUTER_BAD_EI = -1,
3498 ROUTER_WAS_NOT_NEW = -2,
3499 ROUTER_NOT_IN_CONSENSUS = -3,
3500 ROUTER_NOT_IN_CONSENSUS_OR_NETWORKSTATUS = -4,
3501 ROUTER_AUTHDIR_REJECTS = -5,
3502 } was_router_added_t;
3504 /********************************* routerparse.c ************************/
3506 #define MAX_STATUS_TAG_LEN 32
3507 /** Structure to hold parsed Tor versions. This is a little messier
3508 * than we would like it to be, because we changed version schemes with 0.1.0.
3510 * See version-spec.txt for the whole business.
3512 typedef struct tor_version_t {
3513 int major;
3514 int minor;
3515 int micro;
3516 /** Release status. For version in the post-0.1 format, this is always
3517 * VER_RELEASE. */
3518 enum { VER_PRE=0, VER_RC=1, VER_RELEASE=2, } status;
3519 int patchlevel;
3520 char status_tag[MAX_STATUS_TAG_LEN];
3521 int svn_revision;
3523 int git_tag_len;
3524 char git_tag[DIGEST_LEN];
3525 } tor_version_t;
3527 #endif