2006-02-09 06:46:49 +01:00
|
|
|
/* Copyright (c) 2001 Matej Pfajfar.
|
|
|
|
* Copyright (c) 2001-2004, Roger Dingledine.
|
|
|
|
* Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson. */
|
Implemented link padding and receiver token buckets
Each socket reads at most 'bandwidth' bytes per second sustained, but
can handle bursts of up to 10*bandwidth bytes.
Cells are now sent out at evenly-spaced intervals, with padding sent
out otherwise. Set Linkpadding=0 in the rc file to send cells as soon
as they're available (and to never send padding cells).
Added license/copyrights statements at the top of most files.
router->min and router->max have been merged into a single 'bandwidth'
value. We should make the routerinfo_t reflect this (want to do that,
Mat?)
As the bandwidth increases, and we want to stop sleeping more and more
frequently to send a single cell, cpu usage goes up. At 128kB/s we're
pretty much calling poll with a timeout of 1ms or even 0ms. The current
code takes a timeout of 0-9ms and makes it 10ms. prepare_for_poll()
handles everything that should have happened in the past, so as long as
our buffers don't get too full in that 10ms, we're ok.
Speaking of too full, if you run three servers at 100kB/s with -l debug,
it spends too much time printing debugging messages to be able to keep
up with the cells. The outbuf ultimately fills up and it kills that
connection. If you run with -l err, it works fine up through 500kB/s and
probably beyond. Down the road we'll want to teach it to recognize when
an outbuf is getting full, and back off.
svn:r50
2002-07-16 03:12:15 +02:00
|
|
|
/* See LICENSE for licensing information */
|
2002-06-27 00:45:49 +02:00
|
|
|
/* $Id$ */
|
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
/**
|
|
|
|
* \file or.h
|
|
|
|
* \brief Master header file for Tor-specific functionality.
|
2005-06-11 07:31:17 +02:00
|
|
|
**/
|
2004-05-10 08:52:01 +02:00
|
|
|
|
2002-06-27 00:45:49 +02:00
|
|
|
#ifndef __OR_H
|
|
|
|
#define __OR_H
|
2004-11-29 23:25:31 +01:00
|
|
|
#define OR_H_ID "$Id$"
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2002-09-03 20:44:24 +02:00
|
|
|
#include "orconfig.h"
|
2004-03-11 07:19:08 +01:00
|
|
|
#ifdef MS_WINDOWS
|
|
|
|
#define WIN32_WINNT 0x400
|
|
|
|
#define _WIN32_WINNT 0x400
|
|
|
|
#define WIN32_LEAN_AND_MEAN
|
|
|
|
#endif
|
2002-09-03 20:44:24 +02:00
|
|
|
|
2002-06-27 00:45:49 +02:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
2003-08-12 05:08:41 +02:00
|
|
|
#ifdef HAVE_UNISTD_H
|
2002-06-27 00:45:49 +02:00
|
|
|
#include <unistd.h>
|
2003-08-12 05:08:41 +02:00
|
|
|
#endif
|
|
|
|
#ifdef HAVE_STRING_H
|
2002-06-27 00:45:49 +02:00
|
|
|
#include <string.h>
|
2003-08-12 05:08:41 +02:00
|
|
|
#endif
|
|
|
|
#ifdef HAVE_SIGNAL_H
|
2002-06-27 00:45:49 +02:00
|
|
|
#include <signal.h>
|
2003-08-12 05:08:41 +02:00
|
|
|
#endif
|
|
|
|
#ifdef HAVE_NETDB_H
|
2002-06-27 00:45:49 +02:00
|
|
|
#include <netdb.h>
|
2003-08-12 05:08:41 +02:00
|
|
|
#endif
|
|
|
|
#ifdef HAVE_CTYPE_H
|
2002-06-27 00:45:49 +02:00
|
|
|
#include <ctype.h>
|
2003-08-12 05:08:41 +02:00
|
|
|
#endif
|
2004-06-01 19:03:01 +02:00
|
|
|
#ifdef HAVE_SYS_PARAM_H
|
|
|
|
#include <sys/param.h> /* FreeBSD needs this to know what version it is */
|
|
|
|
#endif
|
2006-04-10 21:39:26 +02:00
|
|
|
#include "../common/torint.h"
|
2003-08-12 08:41:53 +02:00
|
|
|
#ifdef HAVE_SYS_WAIT_H
|
|
|
|
#include <sys/wait.h>
|
|
|
|
#endif
|
2003-08-12 05:08:41 +02:00
|
|
|
#ifdef HAVE_SYS_FCNTL_H
|
2002-06-27 00:45:49 +02:00
|
|
|
#include <sys/fcntl.h>
|
2003-08-12 05:08:41 +02:00
|
|
|
#endif
|
|
|
|
#ifdef HAVE_FCNTL_H
|
|
|
|
#include <fcntl.h>
|
|
|
|
#endif
|
|
|
|
#ifdef HAVE_SYS_IOCTL_H
|
2002-06-27 00:45:49 +02:00
|
|
|
#include <sys/ioctl.h>
|
2003-08-12 05:08:41 +02:00
|
|
|
#endif
|
|
|
|
#ifdef HAVE_SYS_SOCKET_H
|
2002-06-27 00:45:49 +02:00
|
|
|
#include <sys/socket.h>
|
2003-08-12 05:08:41 +02:00
|
|
|
#endif
|
|
|
|
#ifdef HAVE_SYS_TIME_H
|
2002-06-27 00:45:49 +02:00
|
|
|
#include <sys/time.h>
|
2003-08-12 05:08:41 +02:00
|
|
|
#endif
|
|
|
|
#ifdef HAVE_SYS_STAT_H
|
2002-09-24 12:43:57 +02:00
|
|
|
#include <sys/stat.h>
|
2003-08-12 05:08:41 +02:00
|
|
|
#endif
|
|
|
|
#ifdef HAVE_NETINET_IN_H
|
2002-06-27 00:45:49 +02:00
|
|
|
#include <netinet/in.h>
|
2003-08-12 05:08:41 +02:00
|
|
|
#endif
|
|
|
|
#ifdef HAVE_ARPA_INET_H
|
2002-06-27 00:45:49 +02:00
|
|
|
#include <arpa/inet.h>
|
2003-08-12 05:08:41 +02:00
|
|
|
#endif
|
|
|
|
#ifdef HAVE_ERRNO_H
|
2002-06-27 00:45:49 +02:00
|
|
|
#include <errno.h>
|
2003-08-12 05:08:41 +02:00
|
|
|
#endif
|
|
|
|
#ifdef HAVE_ASSERT_H
|
2002-06-27 00:45:49 +02:00
|
|
|
#include <assert.h>
|
2003-08-12 05:08:41 +02:00
|
|
|
#endif
|
|
|
|
#ifdef HAVE_TIME_H
|
2002-08-22 09:30:03 +02:00
|
|
|
#include <time.h>
|
2003-08-12 05:08:41 +02:00
|
|
|
#endif
|
2004-10-21 01:30:38 +02:00
|
|
|
|
2005-03-28 00:52:48 +02:00
|
|
|
/** Upper bound on maximum simultaneous connections; can be lowered by
|
|
|
|
* config file. */
|
|
|
|
#define MAXCONNECTIONS 15000
|
|
|
|
|
2004-10-21 01:30:38 +02:00
|
|
|
#ifdef MS_WINDOWS
|
2005-03-28 03:07:14 +02:00
|
|
|
/* No, we don't need to redefine FD_SETSIZE before including winsock:
|
|
|
|
* we use libevent now, and libevent handles the select() stuff. Yes,
|
|
|
|
* some documents imply that we need to redefine anyway if we're using
|
|
|
|
* select() anywhere in our application or in anything it links to: these
|
|
|
|
* documents are either the holy texts of a cargo cult of network
|
|
|
|
* programmers, or more likely a simplification of what's going on for
|
|
|
|
* people who haven't read winsock[2].c for themselves.
|
|
|
|
*/
|
2004-10-21 01:30:38 +02:00
|
|
|
#if (_MSC_VER <= 1300)
|
2003-08-12 05:08:41 +02:00
|
|
|
#include <winsock.h>
|
2004-10-21 01:30:38 +02:00
|
|
|
#else
|
2003-08-12 05:08:41 +02:00
|
|
|
#include <winsock2.h>
|
|
|
|
#include <ws2tcpip.h>
|
2004-10-21 01:30:38 +02:00
|
|
|
#endif
|
2003-08-12 05:08:41 +02:00
|
|
|
#endif
|
|
|
|
|
2003-08-12 17:08:51 +02:00
|
|
|
#ifdef MS_WINDOWS
|
2003-08-12 05:08:41 +02:00
|
|
|
#include <io.h>
|
2003-10-04 03:37:01 +02:00
|
|
|
#include <process.h>
|
2004-03-09 23:01:17 +01:00
|
|
|
#include <direct.h>
|
2003-08-12 05:08:41 +02:00
|
|
|
#include <windows.h>
|
2003-08-12 17:08:51 +02:00
|
|
|
#define snprintf _snprintf
|
2003-08-12 05:08:41 +02:00
|
|
|
#endif
|
|
|
|
|
2005-01-19 00:44:55 +01:00
|
|
|
#ifdef HAVE_EVENT_H
|
|
|
|
#include <event.h>
|
|
|
|
#else
|
|
|
|
#error "Tor requires libevent to build."
|
|
|
|
#endif
|
|
|
|
|
2002-08-22 09:30:03 +02:00
|
|
|
#include "../common/crypto.h"
|
2003-09-04 18:05:08 +02:00
|
|
|
#include "../common/tortls.h"
|
2002-06-27 00:45:49 +02:00
|
|
|
#include "../common/log.h"
|
2004-11-01 21:41:47 +01:00
|
|
|
#include "../common/compat.h"
|
|
|
|
#include "../common/container.h"
|
2003-04-16 19:04:58 +02:00
|
|
|
#include "../common/util.h"
|
2004-09-02 20:57:09 +02:00
|
|
|
#include "../common/torgzip.h"
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2005-06-28 01:35:04 +02:00
|
|
|
/* These signals are defined to help control_signal_act work.
|
|
|
|
* XXXX Move into compat.h ?
|
|
|
|
*/
|
|
|
|
#ifndef SIGHUP
|
|
|
|
#define SIGHUP 1
|
|
|
|
#endif
|
|
|
|
#ifndef SIGINT
|
|
|
|
#define SIGINT 2
|
|
|
|
#endif
|
|
|
|
#ifndef SIGUSR1
|
|
|
|
#define SIGUSR1 10
|
|
|
|
#endif
|
|
|
|
#ifndef SIGUSR2
|
|
|
|
#define SIGUSR2 12
|
|
|
|
#endif
|
|
|
|
#ifndef SIGTERM
|
|
|
|
#define SIGTERM 15
|
|
|
|
#endif
|
2006-03-09 01:18:16 +01:00
|
|
|
/* Controller signals start at a high number so we don't
|
|
|
|
* conflict with system-defined signals. */
|
|
|
|
#define SIGNEWNYM 129
|
2005-06-28 01:35:04 +02:00
|
|
|
|
2005-02-22 05:26:45 +01:00
|
|
|
#if (SIZEOF_CELL_T != 0)
|
|
|
|
/* On Irix, stdlib.h defines a cell_t type, so we need to make sure
|
|
|
|
* that our stuff always calls cell_t something different. */
|
|
|
|
#define cell_t tor_cell_t
|
|
|
|
#endif
|
|
|
|
|
2004-04-05 02:47:48 +02:00
|
|
|
#define MAX_NICKNAME_LEN 19
|
2004-07-22 23:31:04 +02:00
|
|
|
/* Hex digest plus dollar sign. */
|
2004-11-01 22:46:27 +01:00
|
|
|
#define MAX_HEX_NICKNAME_LEN (HEX_DIGEST_LEN+1)
|
2005-04-08 00:13:17 +02:00
|
|
|
/** Maximum size, in bytes, for resized buffers. */
|
|
|
|
#define MAX_BUF_SIZE ((1<<24)-1)
|
|
|
|
#define MAX_DIR_SIZE MAX_BUF_SIZE
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2005-02-24 11:56:55 +01:00
|
|
|
/* For http parsing */
|
|
|
|
#define MAX_HEADERS_SIZE 50000
|
|
|
|
#define MAX_BODY_SIZE 500000
|
|
|
|
|
2006-06-03 23:41:14 +02:00
|
|
|
/** How long do we keep DNS cache entries before purging them (regardless of
|
|
|
|
* their TTL)? */
|
2005-06-08 21:45:17 +02:00
|
|
|
#define MAX_DNS_ENTRY_AGE (30*60)
|
2006-06-03 23:41:14 +02:00
|
|
|
#define DEFAULT_DNS_TTL (30*60)
|
|
|
|
/** How long can a TTL be before we stop believing it? */
|
|
|
|
#define MAX_DNS_TTL (3*60*60)
|
|
|
|
/** How small can a TTL be before we stop believing it? */
|
|
|
|
#define MIN_DNS_TTL (60)
|
2003-12-14 08:40:47 +01:00
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
/** How often do we rotate onion keys? */
|
2006-03-12 23:48:18 +01:00
|
|
|
#define MIN_ONION_KEY_LIFETIME (7*24*60*60)
|
2004-05-10 08:52:01 +02:00
|
|
|
/** How often do we rotate TLS contexts? */
|
2006-03-12 23:48:18 +01:00
|
|
|
#define MAX_SSL_KEY_LIFETIME (2*60*60)
|
2004-04-25 00:17:50 +02:00
|
|
|
|
2005-11-26 10:27:36 +01:00
|
|
|
/** How old do we allow a router to get before removing it
|
|
|
|
* from the router list? In seconds. */
|
2006-03-08 07:29:52 +01:00
|
|
|
#define ROUTER_MAX_AGE (60*60*48)
|
|
|
|
/** How old can a router get before we (as a server) will no longer
|
|
|
|
* consider it live? In seconds. */
|
|
|
|
#define ROUTER_MAX_AGE_TO_PUBLISH (60*60*20)
|
2006-01-10 05:57:12 +01:00
|
|
|
/** How old do we let a saved descriptor get before removing it? */
|
2006-03-08 07:29:52 +01:00
|
|
|
#define OLD_ROUTER_DESC_MAX_AGE (60*60*60)
|
|
|
|
/** How old do we let a networkstatus get before ignoring it? */
|
|
|
|
#define NETWORKSTATUS_MAX_AGE (60*60*24)
|
2004-05-20 07:10:30 +02:00
|
|
|
|
2004-11-10 21:14:37 +01:00
|
|
|
typedef enum {
|
|
|
|
CIRC_ID_TYPE_LOWER=0,
|
|
|
|
CIRC_ID_TYPE_HIGHER=1
|
|
|
|
} circ_id_type_t;
|
Integrated onion proxy into or/
The 'or' process can now be told (by the global_role variable) what
roles this server should play -- connect to all ORs, listen for ORs,
listen for OPs, listen for APs, or any combination.
* everything in /src/op/ is now obsolete.
* connection_ap.c now handles all interactions with application proxies
* "port" is now or_port, op_port, ap_port. But routers are still always
referenced (say, in conn_get_by_addr_port()) by addr / or_port. We
should make routers.c actually read these new ports (currently I've
kludged it so op_port = or_port+10, ap_port=or_port+20)
* circuits currently know if they're at the beginning of the path because
circ->cpath is set. They use this instead for crypts (both ways),
if it's set.
* I still obey the "send a 0 back to the AP when you're ready" protocol,
but I think we should phase it out. I can simply not read from the AP
socket until I'm ready.
I need to do a lot of cleanup work here, but the code appears to work, so
now's a good time for a checkin.
svn:r22
2002-07-02 11:36:58 +02:00
|
|
|
|
2003-09-16 21:36:19 +02:00
|
|
|
#define _CONN_TYPE_MIN 3
|
2004-05-10 08:52:01 +02:00
|
|
|
/** Type for sockets listening for OR connections. */
|
2002-06-27 00:45:49 +02:00
|
|
|
#define CONN_TYPE_OR_LISTENER 3
|
2005-06-11 08:07:22 +02:00
|
|
|
/** A bidirectional TLS connection transmitting a sequence of cells.
|
|
|
|
* May be from an OR to an OR, or from an OP to an OR. */
|
2002-06-27 00:45:49 +02:00
|
|
|
#define CONN_TYPE_OR 4
|
2005-06-11 08:07:22 +02:00
|
|
|
/** A TCP connection from an onion router to a stream's destination. */
|
2002-06-30 09:37:49 +02:00
|
|
|
#define CONN_TYPE_EXIT 5
|
2004-05-10 12:27:54 +02:00
|
|
|
/** Type for sockets listening for SOCKS connections. */
|
2002-06-30 09:37:49 +02:00
|
|
|
#define CONN_TYPE_AP_LISTENER 6
|
2005-06-11 08:07:22 +02:00
|
|
|
/** A SOCKS proxy connection from the user application to the onion
|
|
|
|
* proxy. */
|
2002-06-30 09:37:49 +02:00
|
|
|
#define CONN_TYPE_AP 7
|
2004-05-10 12:27:54 +02:00
|
|
|
/** Type for sockets listening for HTTP connections to the directory server. */
|
2002-09-26 14:09:10 +02:00
|
|
|
#define CONN_TYPE_DIR_LISTENER 8
|
2004-05-10 12:27:54 +02:00
|
|
|
/** Type for HTTP connections to the directory server. */
|
2002-09-26 14:09:10 +02:00
|
|
|
#define CONN_TYPE_DIR 9
|
2005-06-11 08:07:22 +02:00
|
|
|
/** Connection from the main process to a DNS worker process. */
|
2003-06-17 16:31:05 +02:00
|
|
|
#define CONN_TYPE_DNSWORKER 10
|
2005-06-11 08:07:22 +02:00
|
|
|
/** Connection from the main process to a CPU worker process. */
|
2003-08-21 01:05:22 +02:00
|
|
|
#define CONN_TYPE_CPUWORKER 11
|
2006-03-18 10:29:05 +01:00
|
|
|
/** Type for listening for connections from user interface process. */
|
2004-11-03 02:32:26 +01:00
|
|
|
#define CONN_TYPE_CONTROL_LISTENER 12
|
2006-03-18 10:29:05 +01:00
|
|
|
/** Type for connections from user interface process. */
|
2004-11-03 02:32:26 +01:00
|
|
|
#define CONN_TYPE_CONTROL 13
|
|
|
|
#define _CONN_TYPE_MAX 13
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2005-12-14 21:40:40 +01:00
|
|
|
#define CONN_IS_EDGE(x) \
|
|
|
|
((x)->type == CONN_TYPE_EXIT || (x)->type == CONN_TYPE_AP)
|
2004-11-21 08:43:12 +01:00
|
|
|
|
2004-05-10 12:27:54 +02:00
|
|
|
/** State for any listener connection. */
|
2002-06-27 00:45:49 +02:00
|
|
|
#define LISTENER_STATE_READY 0
|
|
|
|
|
2003-09-30 10:18:10 +02:00
|
|
|
#define _DNSWORKER_STATE_MIN 1
|
2004-05-10 12:27:54 +02:00
|
|
|
/** State for a connection to a dnsworker process that's idle. */
|
2003-09-30 10:18:10 +02:00
|
|
|
#define DNSWORKER_STATE_IDLE 1
|
2005-12-14 21:40:40 +01:00
|
|
|
/** State for a connection to a dnsworker process that's resolving a
|
|
|
|
* hostname. */
|
2003-09-30 10:18:10 +02:00
|
|
|
#define DNSWORKER_STATE_BUSY 2
|
|
|
|
#define _DNSWORKER_STATE_MAX 2
|
major overhaul: dns slave subsystem, topics
on startup, it forks off a master dns handler, which forks off dns
slaves (like the apache model). slaves as spawned as load increases,
and then reused. excess slaves are not ever killed, currently.
implemented topics. each topic has a receive window in each direction
at each edge of the circuit, and sends sendme's at the data level, as
per before. each circuit also has receive windows in each direction at
each hop; an edge sends a circuit-level sendme as soon as enough data
cells have arrived (regardless of whether the data cells were flushed
to the exit conns). removed the 'connected' cell type, since it's now
a topic command within data cells.
at the edge of the circuit, there can be multiple connections associated
with a single circuit. you find them via the linked list conn->next_topic.
currently each new ap connection starts its own circuit, so we ought
to see comparable performance to what we had before. but that's only
because i haven't written the code to reattach to old circuits. please
try to break it as-is, and then i'll make it reuse the same circuit and
we'll try to break that.
svn:r152
2003-01-26 10:02:24 +01:00
|
|
|
|
2003-09-27 09:33:07 +02:00
|
|
|
#define _CPUWORKER_STATE_MIN 1
|
2004-05-10 12:27:54 +02:00
|
|
|
/** State for a connection to a cpuworker process that's idle. */
|
2003-09-27 09:33:07 +02:00
|
|
|
#define CPUWORKER_STATE_IDLE 1
|
2004-05-10 08:52:01 +02:00
|
|
|
/** State for a connection to a cpuworker process that's processing a
|
2004-05-10 12:27:54 +02:00
|
|
|
* handshake. */
|
2003-09-27 09:33:07 +02:00
|
|
|
#define CPUWORKER_STATE_BUSY_ONION 2
|
2004-05-10 08:52:01 +02:00
|
|
|
#define _CPUWORKER_STATE_MAX 2
|
2003-08-21 01:05:22 +02:00
|
|
|
|
|
|
|
#define CPUWORKER_TASK_ONION CPUWORKER_STATE_BUSY_ONION
|
|
|
|
|
2003-09-27 09:33:07 +02:00
|
|
|
#define _OR_CONN_STATE_MIN 1
|
2004-05-10 12:27:54 +02:00
|
|
|
/** State for a connection to an OR: waiting for connect() to finish. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define OR_CONN_STATE_CONNECTING 1
|
2005-02-24 11:56:55 +01:00
|
|
|
/** State for a connection to an OR: waiting for proxy command to flush. */
|
|
|
|
#define OR_CONN_STATE_PROXY_FLUSHING 2
|
|
|
|
/** State for a connection to an OR: waiting for proxy response. */
|
|
|
|
#define OR_CONN_STATE_PROXY_READING 3
|
2004-05-10 12:27:54 +02:00
|
|
|
/** State for a connection to an OR: SSL is handshaking, not done yet. */
|
2005-02-24 11:56:55 +01:00
|
|
|
#define OR_CONN_STATE_HANDSHAKING 4
|
2004-05-10 08:52:01 +02:00
|
|
|
/** State for a connection to an OR: Ready to send/receive cells. */
|
2005-02-24 11:56:55 +01:00
|
|
|
#define OR_CONN_STATE_OPEN 5
|
|
|
|
#define _OR_CONN_STATE_MAX 5
|
2003-09-27 09:33:07 +02:00
|
|
|
|
|
|
|
#define _EXIT_CONN_STATE_MIN 1
|
2004-05-10 12:27:54 +02:00
|
|
|
/** State for an exit connection: waiting for response from dns farm. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define EXIT_CONN_STATE_RESOLVING 1
|
2004-05-10 12:27:54 +02:00
|
|
|
/** State for an exit connection: waiting for connect() to finish. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define EXIT_CONN_STATE_CONNECTING 2
|
2004-05-10 12:27:54 +02:00
|
|
|
/** State for an exit connection: open and ready to transmit data. */
|
2003-09-27 09:33:07 +02:00
|
|
|
#define EXIT_CONN_STATE_OPEN 3
|
2004-05-10 12:27:54 +02:00
|
|
|
/** State for an exit connection: waiting to be removed. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define EXIT_CONN_STATE_RESOLVEFAILED 4
|
2004-03-02 08:24:11 +01:00
|
|
|
#define _EXIT_CONN_STATE_MAX 4
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2003-09-27 09:33:07 +02:00
|
|
|
/* the AP state values must be disjoint from the EXIT state values */
|
2004-03-02 08:24:11 +01:00
|
|
|
#define _AP_CONN_STATE_MIN 5
|
2004-05-10 12:27:54 +02:00
|
|
|
/** State for a SOCKS connection: waiting for SOCKS request. */
|
2004-03-02 08:24:11 +01:00
|
|
|
#define AP_CONN_STATE_SOCKS_WAIT 5
|
2004-05-10 08:52:01 +02:00
|
|
|
/** State for a SOCKS connection: got a y.onion URL; waiting to receive
|
2006-03-18 10:29:05 +01:00
|
|
|
* rendezvous descriptor. */
|
2004-04-05 02:47:48 +02:00
|
|
|
#define AP_CONN_STATE_RENDDESC_WAIT 6
|
2005-03-12 05:22:01 +01:00
|
|
|
/** The controller will attach this connection to a circuit; it isn't our
|
|
|
|
* job to do so. */
|
|
|
|
#define AP_CONN_STATE_CONTROLLER_WAIT 7
|
2004-05-10 12:27:54 +02:00
|
|
|
/** State for a SOCKS connection: waiting for a completed circuit. */
|
2005-03-12 05:22:01 +01:00
|
|
|
#define AP_CONN_STATE_CIRCUIT_WAIT 8
|
2004-05-10 12:27:54 +02:00
|
|
|
/** State for a SOCKS connection: sent BEGIN, waiting for CONNECTED. */
|
2005-03-12 05:22:01 +01:00
|
|
|
#define AP_CONN_STATE_CONNECT_WAIT 9
|
2004-06-17 20:13:09 +02:00
|
|
|
/** State for a SOCKS connection: send RESOLVE, waiting for RESOLVED. */
|
2005-03-12 05:22:01 +01:00
|
|
|
#define AP_CONN_STATE_RESOLVE_WAIT 10
|
2004-05-10 12:27:54 +02:00
|
|
|
/** State for a SOCKS connection: ready to send and receive. */
|
2005-03-12 05:22:01 +01:00
|
|
|
#define AP_CONN_STATE_OPEN 11
|
|
|
|
#define _AP_CONN_STATE_MAX 11
|
2004-04-01 23:32:01 +02:00
|
|
|
|
2003-09-27 09:33:07 +02:00
|
|
|
#define _DIR_CONN_STATE_MIN 1
|
2004-05-10 12:27:54 +02:00
|
|
|
/** State for connection to directory server: waiting for connect(). */
|
2004-03-31 00:57:49 +02:00
|
|
|
#define DIR_CONN_STATE_CONNECTING 1
|
2004-05-10 12:27:54 +02:00
|
|
|
/** State for connection to directory server: sending HTTP request. */
|
2004-03-31 00:57:49 +02:00
|
|
|
#define DIR_CONN_STATE_CLIENT_SENDING 2
|
2004-05-10 12:27:54 +02:00
|
|
|
/** State for connection to directory server: reading HTTP response. */
|
2004-03-31 00:57:49 +02:00
|
|
|
#define DIR_CONN_STATE_CLIENT_READING 3
|
2005-09-12 09:36:26 +02:00
|
|
|
/** State for connection to directory server: happy and finished. */
|
|
|
|
#define DIR_CONN_STATE_CLIENT_FINISHED 4
|
2004-05-10 12:27:54 +02:00
|
|
|
/** State for connection at directory server: waiting for HTTP request. */
|
2005-09-12 09:36:26 +02:00
|
|
|
#define DIR_CONN_STATE_SERVER_COMMAND_WAIT 5
|
2004-05-10 12:27:54 +02:00
|
|
|
/** State for connection at directory server: sending HTTP response. */
|
2005-09-12 09:36:26 +02:00
|
|
|
#define DIR_CONN_STATE_SERVER_WRITING 6
|
|
|
|
#define _DIR_CONN_STATE_MAX 6
|
2004-03-31 00:57:49 +02:00
|
|
|
|
2004-11-03 02:32:26 +01:00
|
|
|
#define _CONTROL_CONN_STATE_MIN 1
|
2005-06-17 20:49:55 +02:00
|
|
|
#define CONTROL_CONN_STATE_OPEN_V0 1
|
|
|
|
#define CONTROL_CONN_STATE_OPEN_V1 2
|
|
|
|
#define CONTROL_CONN_STATE_NEEDAUTH_V0 3
|
|
|
|
#define CONTROL_CONN_STATE_NEEDAUTH_V1 4
|
|
|
|
#define _CONTROL_CONN_STATE_MAX 4
|
2004-11-03 02:32:26 +01:00
|
|
|
|
2004-03-31 00:57:49 +02:00
|
|
|
#define _DIR_PURPOSE_MIN 1
|
2005-11-19 11:12:10 +01:00
|
|
|
/** A connection to a directory server: download a directory. */
|
2004-03-31 00:57:49 +02:00
|
|
|
#define DIR_PURPOSE_FETCH_DIR 1
|
2005-11-19 11:12:10 +01:00
|
|
|
/** A connection to a directory server: download just the list
|
2004-06-16 23:08:29 +02:00
|
|
|
* of running routers. */
|
|
|
|
#define DIR_PURPOSE_FETCH_RUNNING_LIST 2
|
2005-11-19 11:12:10 +01:00
|
|
|
/** A connection to a directory server: download a rendezvous
|
2004-05-10 08:52:01 +02:00
|
|
|
* descriptor. */
|
2004-06-16 23:08:29 +02:00
|
|
|
#define DIR_PURPOSE_FETCH_RENDDESC 3
|
2005-11-19 11:12:10 +01:00
|
|
|
/** A connection to a directory server: set after a rendezvous
|
2004-05-10 08:52:01 +02:00
|
|
|
* descriptor is downloaded. */
|
2004-06-16 23:08:29 +02:00
|
|
|
#define DIR_PURPOSE_HAS_FETCHED_RENDDESC 4
|
2005-09-08 05:17:50 +02:00
|
|
|
/** A connection to a directory server: download one or more network-status
|
2005-09-07 22:03:02 +02:00
|
|
|
* objects */
|
|
|
|
#define DIR_PURPOSE_FETCH_NETWORKSTATUS 5
|
2005-11-19 11:12:10 +01:00
|
|
|
/** A connection to a directory server: download one or more server
|
2005-09-07 22:03:02 +02:00
|
|
|
* descriptors. */
|
|
|
|
#define DIR_PURPOSE_FETCH_SERVERDESC 6
|
2005-11-19 11:12:10 +01:00
|
|
|
/** A connection to a directory server: upload a server descriptor. */
|
2005-09-07 22:03:02 +02:00
|
|
|
#define DIR_PURPOSE_UPLOAD_DIR 7
|
2005-11-19 11:12:10 +01:00
|
|
|
/** A connection to a directory server: upload a rendezvous
|
2004-05-10 12:27:54 +02:00
|
|
|
* descriptor. */
|
2005-09-07 22:03:02 +02:00
|
|
|
#define DIR_PURPOSE_UPLOAD_RENDDESC 8
|
2004-05-10 08:52:01 +02:00
|
|
|
/** Purpose for connection at a directory server. */
|
2005-09-07 22:03:02 +02:00
|
|
|
#define DIR_PURPOSE_SERVER 9
|
|
|
|
#define _DIR_PURPOSE_MAX 9
|
2002-09-26 14:09:10 +02:00
|
|
|
|
2004-06-17 20:13:09 +02:00
|
|
|
#define _EXIT_PURPOSE_MIN 1
|
|
|
|
#define EXIT_PURPOSE_CONNECT 1
|
|
|
|
#define EXIT_PURPOSE_RESOLVE 2
|
|
|
|
#define _EXIT_PURPOSE_MAX 2
|
|
|
|
|
2005-11-17 02:17:53 +01:00
|
|
|
/** Circuit state: I'm the origin, still haven't done all my handshakes. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define CIRCUIT_STATE_BUILDING 0
|
2004-05-10 12:27:54 +02:00
|
|
|
/** Circuit state: Waiting to process the onionskin. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define CIRCUIT_STATE_ONIONSKIN_PENDING 1
|
2005-12-14 21:40:40 +01:00
|
|
|
/** Circuit state: I'd like to deliver a create, but my n_conn is still
|
|
|
|
* connecting. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define CIRCUIT_STATE_OR_WAIT 2
|
2004-05-10 12:27:54 +02:00
|
|
|
/** Circuit state: onionskin(s) processed, ready to send/receive cells. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define CIRCUIT_STATE_OPEN 3
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2004-03-30 00:14:19 +02:00
|
|
|
#define _CIRCUIT_PURPOSE_MIN 1
|
2004-04-05 02:47:48 +02:00
|
|
|
|
2004-03-30 00:14:19 +02:00
|
|
|
/* these circuits were initiated elsewhere */
|
2004-04-08 04:24:06 +02:00
|
|
|
#define _CIRCUIT_PURPOSE_OR_MIN 1
|
2004-05-10 08:52:01 +02:00
|
|
|
/** OR-side circuit purpose: normal circuit, at OR. */
|
|
|
|
#define CIRCUIT_PURPOSE_OR 1
|
2004-05-10 12:27:54 +02:00
|
|
|
/** OR-side circuit purpose: At OR, from Bob, waiting for intro from Alices. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define CIRCUIT_PURPOSE_INTRO_POINT 2
|
2004-05-10 12:27:54 +02:00
|
|
|
/** OR-side circuit purpose: At OR, from Alice, waiting for Bob. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define CIRCUIT_PURPOSE_REND_POINT_WAITING 3
|
2004-05-10 12:27:54 +02:00
|
|
|
/** OR-side circuit purpose: At OR, both circuits have this purpose. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define CIRCUIT_PURPOSE_REND_ESTABLISHED 4
|
2004-04-08 04:24:06 +02:00
|
|
|
#define _CIRCUIT_PURPOSE_OR_MAX 4
|
2004-04-05 02:47:48 +02:00
|
|
|
|
2004-03-30 21:52:42 +02:00
|
|
|
/* these circuits originate at this node */
|
2004-04-05 02:47:48 +02:00
|
|
|
|
|
|
|
/* here's how circ client-side purposes work:
|
|
|
|
* normal circuits are C_GENERAL.
|
|
|
|
* circuits that are c_introducing are either on their way to
|
2004-04-13 07:20:52 +02:00
|
|
|
* becoming open, or they are open and waiting for a
|
|
|
|
* suitable rendcirc before they send the intro.
|
|
|
|
* circuits that are c_introduce_ack_wait have sent the intro,
|
|
|
|
* but haven't gotten a response yet.
|
2004-04-05 02:47:48 +02:00
|
|
|
* circuits that are c_establish_rend are either on their way
|
|
|
|
* to becoming open, or they are open and have sent the
|
|
|
|
* establish_rendezvous cell but haven't received an ack.
|
2004-04-14 00:56:24 +02:00
|
|
|
* circuits that are c_rend_ready are open and have received a
|
|
|
|
* rend ack, but haven't heard from bob yet. if they have a
|
2004-04-05 02:47:48 +02:00
|
|
|
* buildstate->pending_final_cpath then they're expecting a
|
|
|
|
* cell from bob, else they're not.
|
2004-04-14 00:56:24 +02:00
|
|
|
* circuits that are c_rend_ready_intro_acked are open, and
|
|
|
|
* some intro circ has sent its intro and received an ack.
|
2004-04-05 02:47:48 +02:00
|
|
|
* circuits that are c_rend_joined are open, have heard from
|
|
|
|
* bob, and are talking to him.
|
|
|
|
*/
|
2004-05-10 08:52:01 +02:00
|
|
|
/** Client-side circuit purpose: Normal circuit, with cpath. */
|
|
|
|
#define CIRCUIT_PURPOSE_C_GENERAL 5
|
2004-05-10 12:27:54 +02:00
|
|
|
/** Client-side circuit purpose: at Alice, connecting to intro point. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define CIRCUIT_PURPOSE_C_INTRODUCING 6
|
2005-12-14 21:40:40 +01:00
|
|
|
/** Client-side circuit purpose: at Alice, sent INTRODUCE1 to intro point,
|
|
|
|
* waiting for ACK/NAK. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT 7
|
2004-05-10 12:27:54 +02:00
|
|
|
/** Client-side circuit purpose: at Alice, introduced and acked, closing. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define CIRCUIT_PURPOSE_C_INTRODUCE_ACKED 8
|
2004-05-10 12:27:54 +02:00
|
|
|
/** Client-side circuit purpose: at Alice, waiting for ack. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define CIRCUIT_PURPOSE_C_ESTABLISH_REND 9
|
2004-05-10 12:27:54 +02:00
|
|
|
/** Client-side circuit purpose: at Alice, waiting for Bob. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define CIRCUIT_PURPOSE_C_REND_READY 10
|
|
|
|
/** Client-side circuit purpose: at Alice, waiting for Bob, INTRODUCE
|
|
|
|
* has been acknowledged. */
|
|
|
|
#define CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED 11
|
2004-05-10 12:27:54 +02:00
|
|
|
/** Client-side circuit purpose: at Alice, rendezvous established. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define CIRCUIT_PURPOSE_C_REND_JOINED 12
|
|
|
|
|
2004-05-10 12:27:54 +02:00
|
|
|
/** Hidden-service-side circuit purpose: at Bob, waiting for introductions. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define CIRCUIT_PURPOSE_S_ESTABLISH_INTRO 13
|
|
|
|
/** Hidden-service-side circuit purpose: at Bob, successfully established
|
2004-05-10 12:27:54 +02:00
|
|
|
* intro. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define CIRCUIT_PURPOSE_S_INTRO 14
|
2004-05-10 12:27:54 +02:00
|
|
|
/** Hidden-service-side circuit purpose: at Bob, connecting to rend point. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define CIRCUIT_PURPOSE_S_CONNECT_REND 15
|
2004-05-10 12:27:54 +02:00
|
|
|
/** Hidden-service-side circuit purpose: at Bob, rendezvous established. */
|
2004-05-10 08:52:01 +02:00
|
|
|
#define CIRCUIT_PURPOSE_S_REND_JOINED 16
|
2005-02-27 10:47:01 +01:00
|
|
|
/** A testing circuit; not meant to be used for actual traffic. */
|
|
|
|
#define CIRCUIT_PURPOSE_TESTING 17
|
2006-02-23 07:51:09 +01:00
|
|
|
/** A controller made this circuit and Tor should not use it. */
|
|
|
|
#define CIRCUIT_PURPOSE_CONTROLLER 18
|
|
|
|
#define _CIRCUIT_PURPOSE_MAX 18
|
2004-03-30 00:14:19 +02:00
|
|
|
|
2005-11-17 02:17:53 +01:00
|
|
|
/** True iff the circuit purpose <b>p</b> is for a circuit that
|
|
|
|
* originated at this node. */
|
2004-04-08 04:24:06 +02:00
|
|
|
#define CIRCUIT_PURPOSE_IS_ORIGIN(p) ((p)>_CIRCUIT_PURPOSE_OR_MAX)
|
|
|
|
#define CIRCUIT_IS_ORIGIN(c) (CIRCUIT_PURPOSE_IS_ORIGIN((c)->purpose))
|
|
|
|
|
2003-05-01 08:42:29 +02:00
|
|
|
#define RELAY_COMMAND_BEGIN 1
|
|
|
|
#define RELAY_COMMAND_DATA 2
|
|
|
|
#define RELAY_COMMAND_END 3
|
|
|
|
#define RELAY_COMMAND_CONNECTED 4
|
|
|
|
#define RELAY_COMMAND_SENDME 5
|
2003-05-06 01:24:46 +02:00
|
|
|
#define RELAY_COMMAND_EXTEND 6
|
|
|
|
#define RELAY_COMMAND_EXTENDED 7
|
2003-06-12 12:16:33 +02:00
|
|
|
#define RELAY_COMMAND_TRUNCATE 8
|
|
|
|
#define RELAY_COMMAND_TRUNCATED 9
|
2003-11-17 01:57:56 +01:00
|
|
|
#define RELAY_COMMAND_DROP 10
|
2004-03-08 00:50:15 +01:00
|
|
|
#define RELAY_COMMAND_RESOLVE 11
|
|
|
|
#define RELAY_COMMAND_RESOLVED 12
|
major overhaul: dns slave subsystem, topics
on startup, it forks off a master dns handler, which forks off dns
slaves (like the apache model). slaves as spawned as load increases,
and then reused. excess slaves are not ever killed, currently.
implemented topics. each topic has a receive window in each direction
at each edge of the circuit, and sends sendme's at the data level, as
per before. each circuit also has receive windows in each direction at
each hop; an edge sends a circuit-level sendme as soon as enough data
cells have arrived (regardless of whether the data cells were flushed
to the exit conns). removed the 'connected' cell type, since it's now
a topic command within data cells.
at the edge of the circuit, there can be multiple connections associated
with a single circuit. you find them via the linked list conn->next_topic.
currently each new ap connection starts its own circuit, so we ought
to see comparable performance to what we had before. but that's only
because i haven't written the code to reattach to old circuits. please
try to break it as-is, and then i'll make it reuse the same circuit and
we'll try to break that.
svn:r152
2003-01-26 10:02:24 +01:00
|
|
|
|
2004-04-01 03:11:28 +02:00
|
|
|
#define RELAY_COMMAND_ESTABLISH_INTRO 32
|
|
|
|
#define RELAY_COMMAND_ESTABLISH_RENDEZVOUS 33
|
|
|
|
#define RELAY_COMMAND_INTRODUCE1 34
|
|
|
|
#define RELAY_COMMAND_INTRODUCE2 35
|
2004-04-13 02:38:16 +02:00
|
|
|
#define RELAY_COMMAND_RENDEZVOUS1 36
|
|
|
|
#define RELAY_COMMAND_RENDEZVOUS2 37
|
|
|
|
#define RELAY_COMMAND_INTRO_ESTABLISHED 38
|
|
|
|
#define RELAY_COMMAND_RENDEZVOUS_ESTABLISHED 39
|
|
|
|
#define RELAY_COMMAND_INTRODUCE_ACK 40
|
2004-04-01 03:11:28 +02:00
|
|
|
|
2003-10-22 09:55:44 +02:00
|
|
|
#define END_STREAM_REASON_MISC 1
|
|
|
|
#define END_STREAM_REASON_RESOLVEFAILED 2
|
2005-03-01 23:16:15 +01:00
|
|
|
#define END_STREAM_REASON_CONNECTREFUSED 3
|
2003-10-22 09:55:44 +02:00
|
|
|
#define END_STREAM_REASON_EXITPOLICY 4
|
|
|
|
#define END_STREAM_REASON_DESTROY 5
|
|
|
|
#define END_STREAM_REASON_DONE 6
|
2004-02-29 00:56:50 +01:00
|
|
|
#define END_STREAM_REASON_TIMEOUT 7
|
2005-03-01 23:16:15 +01:00
|
|
|
/* 8 is unallocated. */
|
|
|
|
#define END_STREAM_REASON_HIBERNATING 9
|
|
|
|
#define END_STREAM_REASON_INTERNAL 10
|
|
|
|
#define END_STREAM_REASON_RESOURCELIMIT 11
|
|
|
|
#define END_STREAM_REASON_CONNRESET 12
|
2005-03-01 23:42:31 +01:00
|
|
|
#define END_STREAM_REASON_TORPROTOCOL 13
|
2003-10-22 09:55:44 +02:00
|
|
|
|
2005-03-27 08:37:56 +02:00
|
|
|
/* These high-numbered end reasons are not part of the official spec,
|
|
|
|
* and are not intended to be put in relay end cells. They are here
|
|
|
|
* to be more informative when sending back socks replies to the
|
|
|
|
* application. */
|
|
|
|
#define END_STREAM_REASON_ALREADY_SOCKS_REPLIED 256
|
|
|
|
#define END_STREAM_REASON_CANT_ATTACH 257
|
|
|
|
#define END_STREAM_REASON_NET_UNREACHABLE 258
|
|
|
|
|
2005-03-02 20:26:46 +01:00
|
|
|
#define RESOLVED_TYPE_HOSTNAME 0
|
2004-06-17 20:13:09 +02:00
|
|
|
#define RESOLVED_TYPE_IPV4 4
|
|
|
|
#define RESOLVED_TYPE_IPV6 6
|
|
|
|
#define RESOLVED_TYPE_ERROR_TRANSIENT 0xF0
|
|
|
|
#define RESOLVED_TYPE_ERROR 0xF1
|
|
|
|
|
2006-05-30 08:19:06 +02:00
|
|
|
/* XXX We should document the meaning of these. */
|
2006-01-05 22:23:03 +01:00
|
|
|
#define END_CIRC_AT_ORIGIN -1
|
|
|
|
#define _END_CIRC_REASON_MIN 0
|
|
|
|
#define END_CIRC_REASON_NONE 0
|
|
|
|
#define END_CIRC_REASON_TORPROTOCOL 1
|
|
|
|
#define END_CIRC_REASON_INTERNAL 2
|
|
|
|
#define END_CIRC_REASON_REQUESTED 3
|
|
|
|
#define END_CIRC_REASON_HIBERNATING 4
|
|
|
|
#define END_CIRC_REASON_RESOURCELIMIT 5
|
|
|
|
#define END_CIRC_REASON_CONNECTFAILED 6
|
|
|
|
#define END_CIRC_REASON_OR_IDENTITY 7
|
|
|
|
#define END_CIRC_REASON_OR_CONN_CLOSED 8
|
|
|
|
#define _END_CIRC_REASON_MAX 8
|
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
/** Length of 'y' portion of 'y.onion' URL. */
|
2004-04-01 23:32:01 +02:00
|
|
|
#define REND_SERVICE_ID_LEN 16
|
|
|
|
|
major overhaul: dns slave subsystem, topics
on startup, it forks off a master dns handler, which forks off dns
slaves (like the apache model). slaves as spawned as load increases,
and then reused. excess slaves are not ever killed, currently.
implemented topics. each topic has a receive window in each direction
at each edge of the circuit, and sends sendme's at the data level, as
per before. each circuit also has receive windows in each direction at
each hop; an edge sends a circuit-level sendme as soon as enough data
cells have arrived (regardless of whether the data cells were flushed
to the exit conns). removed the 'connected' cell type, since it's now
a topic command within data cells.
at the edge of the circuit, there can be multiple connections associated
with a single circuit. you find them via the linked list conn->next_topic.
currently each new ap connection starts its own circuit, so we ought
to see comparable performance to what we had before. but that's only
because i haven't written the code to reattach to old circuits. please
try to break it as-is, and then i'll make it reuse the same circuit and
we'll try to break that.
svn:r152
2003-01-26 10:02:24 +01:00
|
|
|
#define CELL_DIRECTION_IN 1
|
|
|
|
#define CELL_DIRECTION_OUT 2
|
|
|
|
|
2004-01-20 03:14:30 +01:00
|
|
|
#ifdef TOR_PERF
|
|
|
|
#define CIRCWINDOW_START 10000
|
|
|
|
#define CIRCWINDOW_INCREMENT 1000
|
|
|
|
#define STREAMWINDOW_START 5000
|
|
|
|
#define STREAMWINDOW_INCREMENT 500
|
|
|
|
#else
|
major overhaul: dns slave subsystem, topics
on startup, it forks off a master dns handler, which forks off dns
slaves (like the apache model). slaves as spawned as load increases,
and then reused. excess slaves are not ever killed, currently.
implemented topics. each topic has a receive window in each direction
at each edge of the circuit, and sends sendme's at the data level, as
per before. each circuit also has receive windows in each direction at
each hop; an edge sends a circuit-level sendme as soon as enough data
cells have arrived (regardless of whether the data cells were flushed
to the exit conns). removed the 'connected' cell type, since it's now
a topic command within data cells.
at the edge of the circuit, there can be multiple connections associated
with a single circuit. you find them via the linked list conn->next_topic.
currently each new ap connection starts its own circuit, so we ought
to see comparable performance to what we had before. but that's only
because i haven't written the code to reattach to old circuits. please
try to break it as-is, and then i'll make it reuse the same circuit and
we'll try to break that.
svn:r152
2003-01-26 10:02:24 +01:00
|
|
|
#define CIRCWINDOW_START 1000
|
|
|
|
#define CIRCWINDOW_INCREMENT 100
|
2003-05-01 08:42:29 +02:00
|
|
|
#define STREAMWINDOW_START 500
|
|
|
|
#define STREAMWINDOW_INCREMENT 50
|
2004-01-20 03:14:30 +01:00
|
|
|
#endif
|
2002-07-18 08:37:58 +02:00
|
|
|
|
2002-07-19 20:48:28 +02:00
|
|
|
/* cell commands */
|
|
|
|
#define CELL_PADDING 0
|
|
|
|
#define CELL_CREATE 1
|
2003-05-06 01:24:46 +02:00
|
|
|
#define CELL_CREATED 2
|
|
|
|
#define CELL_RELAY 3
|
|
|
|
#define CELL_DESTROY 4
|
2005-05-03 00:35:18 +02:00
|
|
|
#define CELL_CREATE_FAST 5
|
|
|
|
#define CELL_CREATED_FAST 6
|
2002-07-19 20:48:28 +02:00
|
|
|
|
2005-12-08 22:12:47 +01:00
|
|
|
/** How long to test reachability before complaining to the user. */
|
2006-03-12 23:48:18 +01:00
|
|
|
#define TIMEOUT_UNTIL_UNREACHABILITY_COMPLAINT (20*60)
|
2005-12-08 22:12:47 +01:00
|
|
|
|
2003-09-27 23:30:10 +02:00
|
|
|
/* legal characters in a nickname */
|
2005-12-14 21:40:40 +01:00
|
|
|
#define LEGAL_NICKNAME_CHARACTERS \
|
|
|
|
"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"
|
2002-11-23 07:49:01 +01:00
|
|
|
|
2004-11-09 19:22:17 +01:00
|
|
|
/** Name to use in client TLS certificates if no nickname is given.*/
|
|
|
|
#define DEFAULT_CLIENT_NICKNAME "client"
|
|
|
|
|
2003-09-21 08:15:43 +02:00
|
|
|
#define SOCKS4_NETWORK_LEN 8
|
|
|
|
|
2005-03-01 23:16:15 +01:00
|
|
|
typedef enum {
|
|
|
|
SOCKS5_SUCCEEDED = 0x00,
|
|
|
|
SOCKS5_GENERAL_ERROR = 0x01,
|
|
|
|
SOCKS5_NOT_ALLOWED = 0x02,
|
|
|
|
SOCKS5_NET_UNREACHABLE = 0x03,
|
|
|
|
SOCKS5_HOST_UNREACHABLE = 0x04,
|
|
|
|
SOCKS5_CONNECTION_REFUSED = 0x05,
|
|
|
|
SOCKS5_TTL_EXPIRED = 0x06,
|
|
|
|
SOCKS5_COMMAND_NOT_SUPPORTED = 0x07,
|
|
|
|
SOCKS5_ADDRESS_TYPE_NOT_SUPPORTED = 0x08,
|
|
|
|
} socks5_reply_status_t;
|
|
|
|
|
2003-12-16 10:48:17 +01:00
|
|
|
/*
|
|
|
|
* Relay payload:
|
|
|
|
* Relay command [1 byte]
|
2003-12-19 06:09:51 +01:00
|
|
|
* Recognized [2 bytes]
|
|
|
|
* Stream ID [2 bytes]
|
2003-12-16 10:48:17 +01:00
|
|
|
* Partial SHA-1 [4 bytes]
|
|
|
|
* Length [2 bytes]
|
2003-12-19 06:09:51 +01:00
|
|
|
* Relay payload [498 bytes]
|
2003-12-16 10:48:17 +01:00
|
|
|
*/
|
2003-04-16 19:44:33 +02:00
|
|
|
|
2003-12-16 10:48:17 +01:00
|
|
|
#define CELL_PAYLOAD_SIZE 509
|
|
|
|
#define CELL_NETWORK_SIZE 512
|
|
|
|
|
2003-12-19 06:09:51 +01:00
|
|
|
#define RELAY_HEADER_SIZE (1+2+2+4+2)
|
|
|
|
#define RELAY_PAYLOAD_SIZE (CELL_PAYLOAD_SIZE-RELAY_HEADER_SIZE)
|
|
|
|
|
2005-11-17 02:17:53 +01:00
|
|
|
/** Parsed onion routing cell. All communication between nodes
|
|
|
|
* is via cells. */
|
2003-12-16 10:48:17 +01:00
|
|
|
typedef struct {
|
2004-05-10 08:52:01 +02:00
|
|
|
uint16_t circ_id; /**< Circuit which received the cell. */
|
2005-05-07 07:55:06 +02:00
|
|
|
uint8_t command; /**< Type of the cell: one of PADDING, CREATE, RELAY,
|
|
|
|
* or DESTROY. */
|
|
|
|
char payload[CELL_PAYLOAD_SIZE]; /**< Cell body. */
|
2003-12-16 10:48:17 +01:00
|
|
|
} cell_t;
|
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
/** Beginning of a RELAY cell payload. */
|
2003-12-19 06:09:51 +01:00
|
|
|
typedef struct {
|
2004-05-10 08:52:01 +02:00
|
|
|
uint8_t command; /**< The end-to-end relay command. */
|
|
|
|
uint16_t recognized; /**< Used to tell whether cell is for us. */
|
|
|
|
uint16_t stream_id; /**< Which stream is this cell associated with? */
|
|
|
|
char integrity[4]; /**< Used to tell whether cell is corrupted. */
|
|
|
|
uint16_t length; /**< How long is the payload body? */
|
2003-12-19 06:09:51 +01:00
|
|
|
} relay_header_t;
|
2002-07-19 20:48:28 +02:00
|
|
|
|
2003-09-25 07:17:11 +02:00
|
|
|
typedef struct buf_t buf_t;
|
2003-11-11 03:41:31 +01:00
|
|
|
typedef struct socks_request_t socks_request_t;
|
2003-09-25 07:17:11 +02:00
|
|
|
|
2004-02-25 08:31:46 +01:00
|
|
|
#define CONNECTION_MAGIC 0x7C3C304Eu
|
2005-06-11 08:07:22 +02:00
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
/** Description of a connection to another host or process, and associated
|
2005-06-11 08:07:22 +02:00
|
|
|
* data.
|
|
|
|
*
|
|
|
|
* A connection is named based on what it's connected to -- an "OR
|
2005-11-17 02:17:53 +01:00
|
|
|
* connection" has a Tor node on the other end, an "exit
|
2005-06-11 08:07:22 +02:00
|
|
|
* connection" has a website or other server on the other end, and an
|
|
|
|
* "AP connection" has an application proxy (and thus a user) on the
|
|
|
|
* other end.
|
|
|
|
*
|
|
|
|
* Every connection has a type and a state. Connections never change
|
|
|
|
* their type, but can go through many state changes in their lifetime.
|
|
|
|
*
|
|
|
|
* Every connection has two associated input and output buffers.
|
|
|
|
* Listeners don't use them. For non-listener connections, incoming
|
|
|
|
* data is appended to conn->inbuf, and outgoing data is taken from
|
|
|
|
* conn->outbuf. Connections differ primarily in the functions called
|
|
|
|
* to fill and drain these buffers.
|
|
|
|
*/
|
2003-12-16 10:48:17 +01:00
|
|
|
struct connection_t {
|
2004-05-10 08:52:01 +02:00
|
|
|
uint32_t magic; /**< For memory debugging: must equal CONNECTION_MAGIC. */
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
uint8_t type; /**< What kind of connection is this? */
|
|
|
|
uint8_t state; /**< Current state of this connection. */
|
2004-05-10 12:27:54 +02:00
|
|
|
uint8_t purpose; /**< Only used for DIR types currently. */
|
2005-09-30 00:59:17 +02:00
|
|
|
unsigned wants_to_read:1; /**< Boolean: should we start reading again once
|
2006-07-16 07:57:11 +02:00
|
|
|
* the bandwidth throttler allows it? */
|
2005-09-30 00:59:17 +02:00
|
|
|
unsigned wants_to_write:1; /**< Boolean: should we start writing again once
|
2006-07-16 07:57:11 +02:00
|
|
|
* the bandwidth throttler allows reads? */
|
2005-09-30 00:59:17 +02:00
|
|
|
unsigned hold_open_until_flushed:1; /**< Despite this connection's being
|
|
|
|
* marked for close, do we flush it
|
2006-07-16 07:57:11 +02:00
|
|
|
* before closing it? */
|
2005-09-30 00:59:17 +02:00
|
|
|
unsigned has_sent_end:1; /**< For debugging; only used on edge connections.
|
|
|
|
* Set once we've set the stream end,
|
|
|
|
* and check in circuit_about_to_close_connection(). */
|
2005-10-12 06:31:44 +02:00
|
|
|
/** For control connections only. If set, we send extended info with control
|
|
|
|
* events as appropriate. */
|
|
|
|
unsigned int control_events_are_extended:1;
|
2005-11-19 07:57:44 +01:00
|
|
|
/** Used for OR conns that shouldn't get any new circs attached to them. */
|
|
|
|
unsigned int is_obsolete:1;
|
2005-09-30 00:59:17 +02:00
|
|
|
|
2004-05-10 10:56:42 +02:00
|
|
|
int s; /**< Our socket; -1 if this connection is closed. */
|
2005-01-12 07:42:32 +01:00
|
|
|
int poll_index; /* XXXX rename. */
|
2006-07-16 07:57:11 +02:00
|
|
|
struct event *read_event; /**< Libevent event structure. */
|
|
|
|
struct event *write_event; /**< Libevent event structure. */
|
2004-05-10 12:27:54 +02:00
|
|
|
buf_t *inbuf; /**< Buffer holding data read over this connection. */
|
2004-05-10 10:56:42 +02:00
|
|
|
int inbuf_reached_eof; /**< Boolean: did read() return 0 on this conn? */
|
2005-12-14 21:40:40 +01:00
|
|
|
time_t timestamp_lastread; /**< When was the last time poll() said we could
|
|
|
|
* read? */
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2004-05-10 12:27:54 +02:00
|
|
|
buf_t *outbuf; /**< Buffer holding data to write over this connection. */
|
2004-10-14 05:13:08 +02:00
|
|
|
size_t outbuf_flushlen; /**< How much data should we try to flush from the
|
|
|
|
* outbuf? */
|
2005-12-14 21:40:40 +01:00
|
|
|
time_t timestamp_lastwritten; /**< When was the last time poll() said we
|
|
|
|
* could write? */
|
2002-10-02 01:37:31 +02:00
|
|
|
|
2004-05-10 10:56:42 +02:00
|
|
|
time_t timestamp_created; /**< When was this connection_t created? */
|
2005-03-22 21:25:51 +01:00
|
|
|
time_t timestamp_lastempty; /**< When was the outbuf last completely empty?*/
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
uint32_t addr; /**< IP of the other side of the connection; used to identify
|
|
|
|
* routers, along with port. */
|
2004-05-10 12:27:54 +02:00
|
|
|
uint16_t port; /**< If non-zero, port on the other end
|
2003-09-05 08:04:03 +02:00
|
|
|
* of the connection. */
|
2005-12-14 22:03:51 +01:00
|
|
|
uint16_t marked_for_close; /**< Should we close this conn on the next
|
|
|
|
* iteration of the main loop? (If true, holds
|
|
|
|
* the line number where this connection was
|
2006-07-16 07:57:11 +02:00
|
|
|
* marked.) */
|
2005-12-14 22:03:51 +01:00
|
|
|
const char *marked_for_close_file; /**< For debugging: in which file were
|
|
|
|
* we marked for close? */
|
2004-05-10 08:52:01 +02:00
|
|
|
char *address; /**< FQDN (or IP) of the guy on the other end.
|
2006-07-16 07:57:11 +02:00
|
|
|
* strdup into this, because free_connection frees it. */
|
2006-06-03 23:41:14 +02:00
|
|
|
uint32_t address_ttl; /**< TTL for address-to-addr mapping on exit
|
|
|
|
* connection. Exit connections only. */
|
2006-05-30 08:23:44 +02:00
|
|
|
char identity_digest[DIGEST_LEN]; /**< Hash of the public RSA key for
|
|
|
|
* the other side's signing key. */
|
2004-05-10 08:52:01 +02:00
|
|
|
char *nickname; /**< Nickname of OR on other side (if any). */
|
2003-09-05 08:04:03 +02:00
|
|
|
|
2005-08-15 05:25:40 +02:00
|
|
|
/** Nickname of planned exit node -- used with .exit support. */
|
2004-11-29 09:34:54 +01:00
|
|
|
char *chosen_exit_name;
|
2006-07-18 02:59:46 +02:00
|
|
|
/** If 1, and we fail to reach the chosen exit, stop requiring it. */
|
|
|
|
unsigned int chosen_exit_optional:1;
|
2006-07-18 06:42:32 +02:00
|
|
|
/** Number of times we've reassigned this application connection to
|
|
|
|
* a new circuit. We keep track because the timeout is longer if we've
|
|
|
|
* already retried several times. */
|
|
|
|
int num_socks_retries;
|
2004-11-29 09:34:54 +01:00
|
|
|
|
2003-09-05 08:04:03 +02:00
|
|
|
/* Used only by OR connections: */
|
2005-10-06 06:33:40 +02:00
|
|
|
tor_tls_t *tls; /**< TLS connection state (OR only.) */
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2006-06-07 11:18:53 +02:00
|
|
|
/* bandwidth* and receiver_bucket only used by ORs in OPEN state: */
|
|
|
|
int bandwidthrate; /**< Bytes/s added to the bucket. (OPEN ORs only.) */
|
|
|
|
int bandwidthburst; /**< Max bucket size for this conn. (OPEN ORs only.) */
|
2004-05-10 10:56:42 +02:00
|
|
|
int receiver_bucket; /**< When this hits 0, stop receiving. Every second we
|
2006-06-07 11:18:53 +02:00
|
|
|
* add 'bandwidthrate' to this, capping it at
|
2006-07-16 07:57:11 +02:00
|
|
|
* bandwidthburst. (OPEN ORs only) */
|
2004-11-10 21:14:37 +01:00
|
|
|
circ_id_type_t circ_id_type; /**< When we send CREATE cells along this
|
|
|
|
* connection, which half of the space should
|
|
|
|
* we use? */
|
2005-11-26 02:43:57 +01:00
|
|
|
int n_circuits; /**< How many circuits use this connection as p_conn or
|
|
|
|
* n_conn ? */
|
2005-11-30 04:01:16 +01:00
|
|
|
struct connection_t *next_with_same_id; /**< Next connection with same
|
|
|
|
* identity digest as this one. */
|
2005-12-14 22:03:51 +01:00
|
|
|
uint16_t next_circ_id; /**< Which circ_id do we try to use next on
|
|
|
|
* this connection? This is always in the
|
|
|
|
* range 0..1<<15-1. (OR only.)*/
|
2004-04-01 23:32:01 +02:00
|
|
|
|
2003-09-05 08:04:03 +02:00
|
|
|
/* Used only by edge connections: */
|
2003-12-19 06:09:51 +01:00
|
|
|
uint16_t stream_id;
|
2004-05-10 08:52:01 +02:00
|
|
|
struct connection_t *next_stream; /**< Points to the next stream at this
|
|
|
|
* edge, if any (Edge only). */
|
2004-05-10 10:56:42 +02:00
|
|
|
struct crypt_path_t *cpath_layer; /**< A pointer to which node in the circ
|
2004-05-10 08:52:01 +02:00
|
|
|
* this conn exits at. (Edge only.) */
|
|
|
|
int package_window; /**< How many more relay cells can i send into the
|
|
|
|
* circuit? (Edge only.) */
|
|
|
|
int deliver_window; /**< How many more relay cells can end at me? (Edge
|
|
|
|
* only.) */
|
|
|
|
|
2005-09-08 22:18:15 +02:00
|
|
|
/* Used only by Dir connections */
|
2005-12-14 21:40:40 +01:00
|
|
|
char *requested_resource; /**< Which 'resource' did we ask the directory
|
2006-07-16 07:57:11 +02:00
|
|
|
* for? */
|
2006-07-17 08:35:06 +02:00
|
|
|
unsigned int dirconn_direct:1; /**< Is this dirconn direct, or via Tor? */
|
2006-06-18 09:38:55 +02:00
|
|
|
/* Used only for server sides of some dir connections. */
|
2006-06-18 09:55:04 +02:00
|
|
|
enum {
|
2006-06-20 02:48:23 +02:00
|
|
|
DIR_SPOOL_NONE=0, DIR_SPOOL_SERVER_BY_DIGEST, DIR_SPOOL_SERVER_BY_FP,
|
|
|
|
DIR_SPOOL_CACHED_DIR, DIR_SPOOL_NETWORKSTATUS
|
|
|
|
} dir_spool_src;
|
2006-06-18 09:38:55 +02:00
|
|
|
smartlist_t *fingerprint_stack;
|
|
|
|
struct cached_dir_t *cached_dir;
|
|
|
|
off_t cached_dir_offset;
|
|
|
|
tor_zlib_state_t *zlib_state;
|
2005-09-08 22:18:15 +02:00
|
|
|
|
|
|
|
/* Used only by AP connections */
|
2004-05-10 08:52:01 +02:00
|
|
|
socks_request_t *socks_request; /**< SOCKS structure describing request (AP
|
|
|
|
* only.) */
|
2004-11-03 02:32:26 +01:00
|
|
|
|
2005-03-01 02:15:01 +01:00
|
|
|
/** Quasi-global identifier for this connection; used for control.c */
|
|
|
|
/* XXXX NM This can get re-used after 2**32 circuits. */
|
|
|
|
uint32_t global_identifier;
|
|
|
|
|
2004-11-03 02:32:26 +01:00
|
|
|
/* Used only by control connections */
|
|
|
|
uint32_t event_mask;
|
2005-04-28 00:01:34 +02:00
|
|
|
uint32_t incoming_cmd_len;
|
|
|
|
uint32_t incoming_cmd_cur_len;
|
|
|
|
char *incoming_cmd;
|
2005-06-17 20:49:55 +02:00
|
|
|
|
2005-12-14 22:03:51 +01:00
|
|
|
/* Used only by DIR and AP connections: */
|
|
|
|
struct circuit_t *on_circuit; /**< The circuit (if any) that this edge
|
|
|
|
* connection is using. */
|
|
|
|
char rend_query[REND_SERVICE_ID_LEN+1]; /**< What rendezvous service are we
|
|
|
|
* querying for? (DIR/AP only) */
|
|
|
|
|
2005-06-17 20:49:55 +02:00
|
|
|
/* Used only by control v0 connections */
|
|
|
|
uint16_t incoming_cmd_type;
|
major overhaul: dns slave subsystem, topics
on startup, it forks off a master dns handler, which forks off dns
slaves (like the apache model). slaves as spawned as load increases,
and then reused. excess slaves are not ever killed, currently.
implemented topics. each topic has a receive window in each direction
at each edge of the circuit, and sends sendme's at the data level, as
per before. each circuit also has receive windows in each direction at
each hop; an edge sends a circuit-level sendme as soon as enough data
cells have arrived (regardless of whether the data cells were flushed
to the exit conns). removed the 'connected' cell type, since it's now
a topic command within data cells.
at the edge of the circuit, there can be multiple connections associated
with a single circuit. you find them via the linked list conn->next_topic.
currently each new ap connection starts its own circuit, so we ought
to see comparable performance to what we had before. but that's only
because i haven't written the code to reattach to old circuits. please
try to break it as-is, and then i'll make it reuse the same circuit and
we'll try to break that.
svn:r152
2003-01-26 10:02:24 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
typedef struct connection_t connection_t;
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2005-08-09 07:22:23 +02:00
|
|
|
typedef enum {
|
|
|
|
ADDR_POLICY_ACCEPT=1,
|
|
|
|
ADDR_POLICY_REJECT=2,
|
|
|
|
} addr_policy_action_t;
|
2003-04-07 06:38:19 +02:00
|
|
|
|
2004-11-12 20:39:13 +01:00
|
|
|
/** A linked list of policy rules */
|
2004-12-04 02:14:36 +01:00
|
|
|
typedef struct addr_policy_t {
|
2005-08-09 07:22:23 +02:00
|
|
|
addr_policy_action_t policy_type; /**< What to do when the policy matches.*/
|
2004-05-10 12:27:54 +02:00
|
|
|
char *string; /**< String representation of this rule. */
|
|
|
|
uint32_t addr; /**< Base address to accept or reject. */
|
2004-11-12 20:39:13 +01:00
|
|
|
uint32_t msk; /**< Accept/reject all addresses <b>a</b> such that
|
|
|
|
* a & msk == <b>addr</b> & msk . */
|
2004-05-10 12:27:54 +02:00
|
|
|
uint16_t prt_min; /**< Lowest port number to accept/reject. */
|
|
|
|
uint16_t prt_max; /**< Highest port number to accept/reject. */
|
2004-05-10 08:52:01 +02:00
|
|
|
|
2004-11-12 20:39:13 +01:00
|
|
|
struct addr_policy_t *next; /**< Next rule in list. */
|
2004-12-04 02:14:36 +01:00
|
|
|
} addr_policy_t;
|
2003-04-07 06:38:19 +02:00
|
|
|
|
2005-09-07 18:42:53 +02:00
|
|
|
/** A cached_dir_t represents a cacheable directory object, along with its
|
|
|
|
* compressed form. */
|
|
|
|
typedef struct cached_dir_t {
|
|
|
|
char *dir; /**< Contents of this object */
|
|
|
|
char *dir_z; /**< Compressed contents of this object. */
|
|
|
|
size_t dir_len; /**< Length of <b>dir</b> */
|
|
|
|
size_t dir_z_len; /**< Length of <b>dir_z</b> */
|
|
|
|
time_t published; /**< When was this object published */
|
2006-06-18 09:38:55 +02:00
|
|
|
int refcnt; /**< Reference count for this cached_dir_t. */
|
2005-09-07 18:42:53 +02:00
|
|
|
} cached_dir_t;
|
|
|
|
|
2006-06-22 09:01:54 +02:00
|
|
|
typedef enum {
|
|
|
|
SAVED_NOWHERE=0, SAVED_IN_CACHE, SAVED_IN_JOURNAL
|
|
|
|
} saved_location_t;
|
|
|
|
|
2005-11-05 21:15:27 +01:00
|
|
|
/** Information need to cache an onion router's descriptor. */
|
|
|
|
typedef struct signed_descriptor_t {
|
2006-01-12 19:04:17 +01:00
|
|
|
char *signed_descriptor_body;
|
2005-11-05 21:15:27 +01:00
|
|
|
size_t signed_descriptor_len;
|
|
|
|
char signed_descriptor_digest[DIGEST_LEN];
|
|
|
|
char identity_digest[DIGEST_LEN];
|
|
|
|
time_t published_on;
|
2006-06-22 09:01:54 +02:00
|
|
|
saved_location_t saved_location;
|
2006-04-29 20:42:26 +02:00
|
|
|
off_t saved_offset;
|
2005-11-05 21:15:27 +01:00
|
|
|
} signed_descriptor_t;
|
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
/** Information about another onion router in the network. */
|
2002-12-03 23:18:23 +01:00
|
|
|
typedef struct {
|
2005-11-05 21:15:27 +01:00
|
|
|
signed_descriptor_t cache_info;
|
2004-05-10 08:52:01 +02:00
|
|
|
char *address; /**< Location of OR: either a hostname or an IP address. */
|
|
|
|
char *nickname; /**< Human-readable OR name. */
|
2003-12-17 22:09:31 +01:00
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
uint32_t addr; /**< IPv4 address of OR, in host order. */
|
2005-11-17 02:17:53 +01:00
|
|
|
uint16_t or_port; /**< Port for TLS connections. */
|
2004-05-10 12:27:54 +02:00
|
|
|
uint16_t dir_port; /**< Port for HTTP directory connections. */
|
2003-09-26 20:27:35 +02:00
|
|
|
|
2004-05-10 12:27:54 +02:00
|
|
|
crypto_pk_env_t *onion_pkey; /**< Public RSA key for onions. */
|
|
|
|
crypto_pk_env_t *identity_pkey; /**< Public RSA key for signing. */
|
2003-09-27 23:30:10 +02:00
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
char *platform; /**< What software/operating system is this OR using? */
|
2004-04-07 23:36:03 +02:00
|
|
|
|
2002-06-27 00:45:49 +02:00
|
|
|
/* link info */
|
2004-05-10 08:52:01 +02:00
|
|
|
uint32_t bandwidthrate; /**< How many bytes does this OR add to its token
|
|
|
|
* bucket per second? */
|
|
|
|
uint32_t bandwidthburst; /**< How large is this OR's token bucket? */
|
2004-07-12 20:02:54 +02:00
|
|
|
/** How many bytes/s is this router known to handle? */
|
2004-08-15 10:15:12 +02:00
|
|
|
uint32_t bandwidthcapacity;
|
2004-12-04 02:14:36 +01:00
|
|
|
addr_policy_t *exit_policy; /**< What streams will this OR permit
|
2004-05-10 08:52:01 +02:00
|
|
|
* to exit? */
|
2004-08-17 08:06:05 +02:00
|
|
|
long uptime; /**< How many seconds the router claims to have been up */
|
2004-10-15 03:58:11 +02:00
|
|
|
smartlist_t *declared_family; /**< Nicknames of router which this router
|
|
|
|
* claims are its family. */
|
2005-05-02 23:22:31 +02:00
|
|
|
char *contact_info; /**< Declared contact info for this router. */
|
2005-09-12 08:56:42 +02:00
|
|
|
unsigned int is_hibernating:1; /**< Whether the router claims to be
|
|
|
|
* hibernating */
|
2005-08-26 22:22:32 +02:00
|
|
|
|
2005-08-26 22:59:04 +02:00
|
|
|
/* local info */
|
2005-09-12 08:56:42 +02:00
|
|
|
unsigned int is_running:1; /**< As far as we know, is this OR currently
|
|
|
|
* running? */
|
2006-03-19 02:21:59 +01:00
|
|
|
unsigned int is_valid:1; /**< Has a trusted dirserver validated this OR?
|
2005-09-12 08:56:42 +02:00
|
|
|
* (For Authdir: Have we validated this OR?)
|
|
|
|
*/
|
2005-10-05 00:23:31 +02:00
|
|
|
unsigned int is_named:1; /**< Do we believe the nickname that this OR gives
|
|
|
|
* us? */
|
2005-12-15 22:30:57 +01:00
|
|
|
unsigned int is_fast:1; /** Do we think this is a fast OR? */
|
|
|
|
unsigned int is_stable:1; /** Do we think this is a stable OR? */
|
2006-02-12 04:43:39 +01:00
|
|
|
unsigned int is_possible_guard:1; /**< Do we think this is an OK guard? */
|
2005-09-12 08:56:42 +02:00
|
|
|
|
2006-03-17 23:08:59 +01:00
|
|
|
/** Tor can use this desc for circuit-building. */
|
|
|
|
#define ROUTER_PURPOSE_GENERAL 0
|
|
|
|
/** Tor should avoid using this desc for circuit-building. */
|
|
|
|
#define ROUTER_PURPOSE_CONTROLLER 1
|
|
|
|
uint8_t purpose; /** Should Tor use this desc for circuit-building? */
|
|
|
|
|
2005-08-30 08:48:24 +02:00
|
|
|
/* The below items are used only by authdirservers for
|
2005-08-26 22:22:32 +02:00
|
|
|
* reachability testing. */
|
2005-09-01 10:13:40 +02:00
|
|
|
/** When was the last time we could reach this OR? */
|
|
|
|
time_t last_reachable;
|
|
|
|
/** When did we start testing reachability for this OR? */
|
|
|
|
time_t testing_since;
|
|
|
|
/** How many times has a descriptor been posted and we believed
|
|
|
|
* this router to be unreachable? We only actually warn on the third. */
|
|
|
|
int num_unreachable_notifications;
|
2002-06-27 00:45:49 +02:00
|
|
|
} routerinfo_t;
|
|
|
|
|
2005-09-24 23:56:04 +02:00
|
|
|
/** Contents of a single router entry in a network status object.
|
2005-09-05 01:12:27 +02:00
|
|
|
*/
|
2005-09-02 22:37:31 +02:00
|
|
|
typedef struct routerstatus_t {
|
2005-09-05 01:12:27 +02:00
|
|
|
time_t published_on; /**< When was this router published? */
|
2005-12-14 21:40:40 +01:00
|
|
|
char nickname[MAX_NICKNAME_LEN+1]; /**< The nickname this router says it
|
|
|
|
* has. */
|
|
|
|
char identity_digest[DIGEST_LEN]; /**< Digest of the router's identity
|
|
|
|
* key. */
|
2005-09-05 01:12:27 +02:00
|
|
|
char descriptor_digest[DIGEST_LEN]; /**< Digest of the router's most recent
|
2005-09-08 09:10:12 +02:00
|
|
|
* descriptor. */
|
|
|
|
uint32_t addr; /**< IPv4 address for this router. */
|
|
|
|
uint16_t or_port; /**< OR port for this router. */
|
|
|
|
uint16_t dir_port; /**< Directory port for this router. */
|
|
|
|
unsigned int is_exit:1; /**< True iff this router is a good exit. */
|
|
|
|
unsigned int is_stable:1; /**< True iff this router stays up a long time. */
|
|
|
|
unsigned int is_fast:1; /**< True iff this router has good bandwidth. */
|
|
|
|
unsigned int is_running:1; /**< True iff this router is up. */
|
|
|
|
unsigned int is_named:1; /**< True iff "nickname" belongs to this router. */
|
|
|
|
unsigned int is_valid:1; /**< True iff this router is validated. */
|
2005-12-15 21:49:01 +01:00
|
|
|
unsigned int is_v2_dir:1; /**< True iff this router can serve directory
|
2005-12-12 02:03:28 +01:00
|
|
|
* information with v2 of the directory
|
2005-12-15 21:49:01 +01:00
|
|
|
* protocol. (All directory caches cache v1
|
|
|
|
* directories.) */
|
2006-01-24 01:31:16 +01:00
|
|
|
unsigned int is_possible_guard:1; /**< True iff this router would be a good
|
|
|
|
* choice as an entry guard. */
|
2005-12-27 06:26:03 +01:00
|
|
|
|
|
|
|
/** True if we, as a directory mirror, want to download the corresponding
|
|
|
|
* routerinfo from the authority who gave us this routerstatus. (That is,
|
|
|
|
* if we don't have the routerinfo, and if we haven't already tried to get it
|
|
|
|
* from this authority.)
|
|
|
|
*/
|
|
|
|
unsigned int need_to_mirror:1;
|
2005-09-02 22:37:31 +02:00
|
|
|
} routerstatus_t;
|
|
|
|
|
2005-12-27 06:26:03 +01:00
|
|
|
/** Our "local" or combined view of the info from all networkstatus objects
|
|
|
|
* about a single router. */
|
2005-09-22 03:51:14 +02:00
|
|
|
typedef struct local_routerstatus_t {
|
2005-12-27 06:26:03 +01:00
|
|
|
/** What do we believe to be the case about this router? In this field,
|
2006-02-05 02:57:27 +01:00
|
|
|
* descriptor_digest represents the descriptor we would most like to use for
|
2005-12-27 06:26:03 +01:00
|
|
|
* this router. */
|
2005-09-22 03:51:14 +02:00
|
|
|
routerstatus_t status;
|
2005-09-30 00:59:17 +02:00
|
|
|
time_t next_attempt_at; /**< When should we try this descriptor again? */
|
2005-09-22 03:51:14 +02:00
|
|
|
uint8_t n_download_failures; /**< Number of failures trying to download the
|
|
|
|
* most recent descriptor. */
|
2005-10-07 21:25:01 +02:00
|
|
|
unsigned int name_lookup_warned:1; /**< Have we warned the user for referring
|
2005-10-05 00:23:31 +02:00
|
|
|
* to this (unnamed) router by nickname?
|
|
|
|
*/
|
2005-09-22 03:51:14 +02:00
|
|
|
} local_routerstatus_t;
|
|
|
|
|
2006-04-18 05:07:24 +02:00
|
|
|
/** How many times will we try to download a router's descriptor before giving
|
|
|
|
* up? */
|
2005-09-18 06:15:39 +02:00
|
|
|
#define MAX_ROUTERDESC_DOWNLOAD_FAILURES 8
|
2005-09-18 04:51:12 +02:00
|
|
|
|
2005-09-08 09:10:12 +02:00
|
|
|
/** Contents of a (v2 or later) network status object. */
|
2005-09-02 22:37:31 +02:00
|
|
|
typedef struct networkstatus_t {
|
2005-09-05 01:12:27 +02:00
|
|
|
/** When did we receive the network-status document? */
|
|
|
|
time_t received_on;
|
2005-09-18 04:24:42 +02:00
|
|
|
|
2005-09-07 18:42:53 +02:00
|
|
|
/** What was the digest of the document? */
|
|
|
|
char networkstatus_digest[DIGEST_LEN];
|
2005-09-05 01:12:27 +02:00
|
|
|
|
2005-09-21 02:41:06 +02:00
|
|
|
unsigned int is_recent; /**< Is this recent enough to influence running
|
|
|
|
* status? */
|
2005-09-18 04:24:42 +02:00
|
|
|
|
2005-09-05 01:12:27 +02:00
|
|
|
/* These fields come from the actual network-status document.*/
|
|
|
|
time_t published_on; /**< Declared publication date. */
|
2005-09-02 22:37:31 +02:00
|
|
|
|
2005-09-08 09:10:12 +02:00
|
|
|
char *source_address; /**< Canonical directory server hostname. */
|
|
|
|
uint32_t source_addr; /**< Canonical directory server IP. */
|
|
|
|
uint16_t source_dirport; /**< Canonical directory server dirport. */
|
2005-09-02 22:37:31 +02:00
|
|
|
|
2005-09-08 09:10:12 +02:00
|
|
|
char identity_digest[DIGEST_LEN]; /**< Digest of signing key. */
|
|
|
|
char *contact; /**< How to contact directory admin? (may be NULL). */
|
|
|
|
crypto_pk_env_t *signing_key; /**< Key used to sign this directory. */
|
2005-09-05 01:12:27 +02:00
|
|
|
char *client_versions; /**< comma-separated list of recommended client
|
2005-09-08 09:10:12 +02:00
|
|
|
* versions. */
|
2005-09-05 01:12:27 +02:00
|
|
|
char *server_versions; /**< comma-separated list of recommended server
|
2005-09-08 09:10:12 +02:00
|
|
|
* versions. */
|
2005-09-02 22:37:31 +02:00
|
|
|
|
2005-12-14 21:40:40 +01:00
|
|
|
unsigned int binds_names:1; /**< True iff this directory server binds
|
|
|
|
* names. */
|
2005-09-21 02:41:06 +02:00
|
|
|
unsigned int recommends_versions:1; /**< True iff this directory server
|
|
|
|
* recommends client and server software
|
|
|
|
* versions. */
|
2005-09-02 22:37:31 +02:00
|
|
|
|
2006-04-08 08:55:10 +02:00
|
|
|
smartlist_t *entries; /**< List of routerstatus_t*. This list is kept
|
2005-09-14 04:28:35 +02:00
|
|
|
* sorted by identity_digest. */
|
2005-09-02 22:37:31 +02:00
|
|
|
} networkstatus_t;
|
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
/** Contents of a directory of onion routers. */
|
2003-05-06 19:38:16 +02:00
|
|
|
typedef struct {
|
2005-10-27 02:34:39 +02:00
|
|
|
/** Map from server identity digest to a member of routers. */
|
2005-10-18 22:12:22 +02:00
|
|
|
digestmap_t *identity_map;
|
2005-11-23 06:47:51 +01:00
|
|
|
/** Map from server descriptor digest to a signed_descriptor_t from
|
2005-11-05 21:15:27 +01:00
|
|
|
* routers or old_routers. */
|
2005-10-27 02:34:39 +02:00
|
|
|
digestmap_t *desc_digest_map;
|
|
|
|
/** List of routerinfo_t for all currently live routers we know. */
|
|
|
|
smartlist_t *routers;
|
2005-11-05 21:15:27 +01:00
|
|
|
/** List of signed_descriptor_t for older router descriptors we're
|
|
|
|
* caching. */
|
2005-10-27 02:34:39 +02:00
|
|
|
smartlist_t *old_routers;
|
2006-06-22 09:01:54 +02:00
|
|
|
/** DOCDOC */
|
|
|
|
const char *mmap_descriptors;
|
|
|
|
size_t mmap_descriptors_len;
|
2003-12-05 10:51:49 +01:00
|
|
|
} routerlist_t;
|
2003-05-06 19:38:16 +02:00
|
|
|
|
2005-07-14 10:43:19 +02:00
|
|
|
/** Information on router used when extending a circuit. (We don't need a
|
2005-06-29 23:46:55 +02:00
|
|
|
* full routerinfo_t to extend: we only need addr:port:keyid to build an OR
|
|
|
|
* connection, and onion_key to create the onionskin.) */
|
|
|
|
typedef struct extend_info_t {
|
2005-12-14 21:40:40 +01:00
|
|
|
char nickname[MAX_HEX_NICKNAME_LEN+1]; /**< This router's nickname for
|
|
|
|
* display. */
|
2005-07-14 10:43:19 +02:00
|
|
|
char identity_digest[DIGEST_LEN]; /**< Hash of this router's identity key. */
|
|
|
|
uint32_t addr; /**< IP address in host order. */
|
|
|
|
uint16_t port; /**< OR port. */
|
|
|
|
crypto_pk_env_t *onion_key; /**< Current onionskin key. */
|
2005-06-29 23:46:55 +02:00
|
|
|
} extend_info_t;
|
|
|
|
|
2005-03-23 07:21:48 +01:00
|
|
|
#define CRYPT_PATH_MAGIC 0x70127012u
|
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
/** Holds accounting information for a single step in the layered encryption
|
|
|
|
* performed by a circuit. Used only at the client edge of a circuit. */
|
2005-07-22 23:12:10 +02:00
|
|
|
typedef struct crypt_path_t {
|
2005-03-23 07:21:48 +01:00
|
|
|
uint32_t magic;
|
Integrated onion proxy into or/
The 'or' process can now be told (by the global_role variable) what
roles this server should play -- connect to all ORs, listen for ORs,
listen for OPs, listen for APs, or any combination.
* everything in /src/op/ is now obsolete.
* connection_ap.c now handles all interactions with application proxies
* "port" is now or_port, op_port, ap_port. But routers are still always
referenced (say, in conn_get_by_addr_port()) by addr / or_port. We
should make routers.c actually read these new ports (currently I've
kludged it so op_port = or_port+10, ap_port=or_port+20)
* circuits currently know if they're at the beginning of the path because
circ->cpath is set. They use this instead for crypts (both ways),
if it's set.
* I still obey the "send a 0 back to the AP when you're ready" protocol,
but I think we should phase it out. I can simply not read from the AP
socket until I'm ready.
I need to do a lot of cleanup work here, but the code appears to work, so
now's a good time for a checkin.
svn:r22
2002-07-02 11:36:58 +02:00
|
|
|
|
2002-08-22 09:30:03 +02:00
|
|
|
/* crypto environments */
|
2004-05-10 08:52:01 +02:00
|
|
|
/** Encryption key and counter for cells heading towards the OR at this
|
|
|
|
* step. */
|
2002-08-22 09:30:03 +02:00
|
|
|
crypto_cipher_env_t *f_crypto;
|
2004-05-10 08:52:01 +02:00
|
|
|
/** Encryption key and counter for cells heading back from the OR at this
|
|
|
|
* step. */
|
2002-08-22 09:30:03 +02:00
|
|
|
crypto_cipher_env_t *b_crypto;
|
2003-05-02 00:55:51 +02:00
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
/** Digest state for cells heading towards the OR at this step. */
|
2003-12-16 09:21:58 +01:00
|
|
|
crypto_digest_env_t *f_digest; /* for integrity checking */
|
2004-05-10 08:52:01 +02:00
|
|
|
/** Digest state for cells heading away from the OR at this step. */
|
2003-12-16 09:21:58 +01:00
|
|
|
crypto_digest_env_t *b_digest;
|
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
/** Current state of Diffie-Hellman key negotiation with the OR at this
|
|
|
|
* step. */
|
2005-05-03 00:35:18 +02:00
|
|
|
crypto_dh_env_t *dh_handshake_state;
|
2005-12-08 18:38:32 +01:00
|
|
|
/** Current state of 'fast' (non-PK) key negotiation with the OR at this
|
|
|
|
* step. Used to save CPU when TLS is already providing all the
|
|
|
|
* authentication, secrecy, and integrity we need, and we're already
|
|
|
|
* distinguishable from an OR.
|
|
|
|
*/
|
2005-05-03 00:35:18 +02:00
|
|
|
char fast_handshake_state[DIGEST_LEN];
|
2004-05-10 08:52:01 +02:00
|
|
|
/** Negotiated key material shared with the OR at this step. */
|
2004-04-03 04:40:30 +02:00
|
|
|
char handshake_digest[DIGEST_LEN];/* KH in tor-spec.txt */
|
2003-05-06 01:24:46 +02:00
|
|
|
|
2005-06-29 23:46:55 +02:00
|
|
|
/** Information to extend to the OR at this step. */
|
|
|
|
extend_info_t *extend_info;
|
2003-05-06 01:24:46 +02:00
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
/** Is the circuit built to this step? Must be one of:
|
|
|
|
* - CPATH_STATE_CLOSED (The circuit has not been extended to this step)
|
|
|
|
* - CPATH_STATE_AWAITING_KEYS (We have sent an EXTEND/CREATE to this step
|
|
|
|
* and not received an EXTENDED/CREATED)
|
|
|
|
* - CPATH_STATE_OPEN (The circuit has been extended to this step) */
|
2003-09-05 08:04:03 +02:00
|
|
|
uint8_t state;
|
2003-05-02 00:55:51 +02:00
|
|
|
#define CPATH_STATE_CLOSED 0
|
2003-05-06 01:24:46 +02:00
|
|
|
#define CPATH_STATE_AWAITING_KEYS 1
|
2003-05-02 00:55:51 +02:00
|
|
|
#define CPATH_STATE_OPEN 2
|
2004-05-10 08:52:01 +02:00
|
|
|
struct crypt_path_t *next; /**< Link to next crypt_path_t in the circuit.
|
|
|
|
* (The list is circular, so the last node
|
|
|
|
* links to the first.) */
|
|
|
|
struct crypt_path_t *prev; /**< Link to previous crypt_path_t in the
|
2004-05-10 12:27:54 +02:00
|
|
|
* circuit. */
|
2004-05-10 08:52:01 +02:00
|
|
|
|
|
|
|
int package_window; /**< How many bytes are we allowed to originate ending
|
|
|
|
* at this step? */
|
|
|
|
int deliver_window; /**< How many bytes are we willing to deliver originating
|
|
|
|
* at this step? */
|
2005-07-22 23:12:10 +02:00
|
|
|
} crypt_path_t;
|
2003-05-02 00:55:51 +02:00
|
|
|
|
2004-05-13 09:24:49 +02:00
|
|
|
#define CPATH_KEY_MATERIAL_LEN (20*2+16*2)
|
|
|
|
|
2004-04-05 22:53:50 +02:00
|
|
|
#define DH_KEY_LEN DH_BYTES
|
2004-04-25 00:17:50 +02:00
|
|
|
#define ONIONSKIN_CHALLENGE_LEN (PKCS1_OAEP_PADDING_OVERHEAD+\
|
|
|
|
CIPHER_KEY_LEN+\
|
|
|
|
DH_KEY_LEN)
|
|
|
|
#define ONIONSKIN_REPLY_LEN (DH_KEY_LEN+DIGEST_LEN)
|
2004-04-03 04:40:30 +02:00
|
|
|
#define REND_COOKIE_LEN DIGEST_LEN
|
2003-05-06 07:54:42 +02:00
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
/** Information used to build a circuit. */
|
2003-11-16 18:00:02 +01:00
|
|
|
typedef struct {
|
2004-05-10 12:31:48 +02:00
|
|
|
/** Intended length of the final circuit. */
|
2003-11-16 18:00:02 +01:00
|
|
|
int desired_path_len;
|
2005-06-29 23:46:55 +02:00
|
|
|
/** How to extend to the planned exit node. */
|
|
|
|
extend_info_t *chosen_exit;
|
2005-01-12 05:58:23 +01:00
|
|
|
/** Whether every node in the circ must have adequate uptime. */
|
|
|
|
int need_uptime;
|
|
|
|
/** Whether every node in the circ must have adequate capacity. */
|
|
|
|
int need_capacity;
|
Introduce a notion of 'internal' circs, which are chosen without regard
to the exit policy of the last hop. Intro and rendezvous circs must
be internal circs, to avoid leaking information. Resolve and connect
streams can use internal circs if they want.
New circuit pooling algorithm: make sure to have enough circs around
to satisfy any predicted ports, and also make sure to have 2 internal
circs around if we've required internal circs lately (with high uptime
if we've seen that lately).
Split NewCircuitPeriod config option into NewCircuitPeriod (30 secs),
which describes how often we retry making new circuits if current ones
are dirty, and MaxCircuitDirtiness (10 mins), which describes how long
we're willing to make use of an already-dirty circuit.
Once rendezvous circuits are established, keep using the same circuit as
long as you attach a new stream to it at least every 10 minutes. (So web
browsing doesn't require you to build new rend circs every 30 seconds.)
Cannibalize GENERAL circs to be C_REND, C_INTRO, S_INTRO, and S_REND
circ as necessary, if there are any completed ones lying around when
we try to launch one.
Re-instate the ifdef's to use version-0 style introduce cells, since
there was yet another bug in handling version-1 style. We'll try switching
over again after 0.0.9 is obsolete.
Bugfix: when choosing an exit node for a new non-internal circ, don't take
into account whether it'll be useful for any pending x.onion addresses --
it won't.
Bugfix: we weren't actually publishing the hidden service descriptor when
it became dirty. So we only published it every 20 minutes or so, which
means when you first start your Tor, the hidden service will seem broken.
svn:r3360
2005-01-17 19:13:09 +01:00
|
|
|
/** Whether the last hop was picked with exiting in mind. */
|
|
|
|
int is_internal;
|
2004-05-10 12:31:48 +02:00
|
|
|
/** The crypt_path_t to append after rendezvous: used for rendezvous. */
|
2005-07-22 23:12:10 +02:00
|
|
|
crypt_path_t *pending_final_cpath;
|
2004-05-10 08:52:01 +02:00
|
|
|
/** How many times has building a circuit for this task failed? */
|
2004-04-14 23:40:50 +02:00
|
|
|
int failure_count;
|
2005-03-19 05:38:59 +01:00
|
|
|
/** At what time should we give up on this task? */
|
|
|
|
time_t expiry_time;
|
2003-11-16 18:00:02 +01:00
|
|
|
} cpath_build_state_t;
|
2003-11-14 21:45:47 +01:00
|
|
|
|
2004-02-25 08:31:46 +01:00
|
|
|
#define CIRCUIT_MAGIC 0x35315243u
|
2005-06-11 08:07:22 +02:00
|
|
|
|
|
|
|
/**
|
|
|
|
* A circuit is a path over the onion routing
|
|
|
|
* network. Applications can connect to one end of the circuit, and can
|
|
|
|
* create exit connections at the other end of the circuit. AP and exit
|
|
|
|
* connections have only one circuit associated with them (and thus these
|
|
|
|
* connection types are closed when the circuit is closed), whereas
|
|
|
|
* OR connections multiplex many circuits at once, and stay standing even
|
|
|
|
* when there are no circuits running over them.
|
|
|
|
*
|
|
|
|
* A circuit_t structure fills two roles. First, a circuit_t links two
|
|
|
|
* connections together: either an edge connection and an OR connection,
|
|
|
|
* or two OR connections. (When joined to an OR connection, a circuit_t
|
|
|
|
* affects only cells sent to a particular circID on that connection. When
|
|
|
|
* joined to an edge connection, a circuit_t affects all data.)
|
|
|
|
|
|
|
|
* Second, a circuit_t holds the cipher keys and state for sending data
|
|
|
|
* along a given circuit. At the OP, it has a sequence of ciphers, each
|
|
|
|
* of which is shared with a single OR along the circuit. Separate
|
|
|
|
* ciphers are used for data going "forward" (away from the OP) and
|
|
|
|
* "backward" (towards the OP). At the OR, a circuit has only two stream
|
|
|
|
* ciphers: one for data going forward, and one for data going backward.
|
|
|
|
*/
|
2003-08-21 01:05:22 +02:00
|
|
|
struct circuit_t {
|
2004-05-10 12:27:54 +02:00
|
|
|
uint32_t magic; /**< For memory debugging: must equal CIRCUIT_MAGIC. */
|
2004-02-25 08:31:46 +01:00
|
|
|
|
2004-05-10 09:37:10 +02:00
|
|
|
/** The OR connection that is previous in this circuit. */
|
2002-06-27 00:45:49 +02:00
|
|
|
connection_t *p_conn;
|
2004-05-10 09:37:10 +02:00
|
|
|
/** The OR connection that is next in this circuit. */
|
|
|
|
connection_t *n_conn;
|
2004-07-02 11:29:01 +02:00
|
|
|
/** The identity hash of n_conn. */
|
|
|
|
char n_conn_id_digest[DIGEST_LEN];
|
2004-05-10 09:37:10 +02:00
|
|
|
/** Linked list of AP streams associated with this circuit. */
|
2003-05-28 01:39:04 +02:00
|
|
|
connection_t *p_streams;
|
2004-05-10 09:37:10 +02:00
|
|
|
/** Linked list of Exit streams associated with this circuit. */
|
2003-05-28 01:39:04 +02:00
|
|
|
connection_t *n_streams;
|
2004-05-10 09:37:10 +02:00
|
|
|
/** Linked list of Exit streams associated with this circuit that are
|
|
|
|
* still being resolved. */
|
2004-05-06 13:08:04 +02:00
|
|
|
connection_t *resolving_streams;
|
2005-12-14 22:03:51 +01:00
|
|
|
/** The IPv4 address of the OR that is next in this circuit. */
|
|
|
|
uint32_t n_addr;
|
|
|
|
/** The port for the OR that is next in this circuit. */
|
|
|
|
uint16_t n_port;
|
2004-05-10 09:37:10 +02:00
|
|
|
/** The next stream_id that will be tried when we're attempting to
|
|
|
|
* construct a new AP stream originating at this circuit. */
|
2003-12-19 22:25:44 +01:00
|
|
|
uint16_t next_stream_id;
|
2004-05-10 09:37:10 +02:00
|
|
|
/** How many relay data cells can we package (read from edge streams)
|
|
|
|
* on this circuit before we receive a circuit-level sendme cell asking
|
|
|
|
* for more? */
|
2003-05-20 08:41:23 +02:00
|
|
|
int package_window;
|
2004-05-10 09:37:10 +02:00
|
|
|
/** How many relay data cells will we deliver (write to edge streams)
|
|
|
|
* on this circuit? When deliver_window gets low, we send some
|
|
|
|
* circuit-level sendme cells to indicate that we're willing to accept
|
|
|
|
* more. */
|
2003-05-20 08:41:23 +02:00
|
|
|
int deliver_window;
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2004-05-10 09:37:10 +02:00
|
|
|
/** The circuit_id used in the previous (backward) hop of this circuit. */
|
|
|
|
uint16_t p_circ_id;
|
|
|
|
/** The circuit_id used in the next (forward) hop of this circuit. */
|
2003-12-19 20:55:02 +01:00
|
|
|
uint16_t n_circ_id;
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2004-05-10 09:37:10 +02:00
|
|
|
/** The cipher used by intermediate hops for cells heading toward the
|
2004-05-10 12:27:54 +02:00
|
|
|
* OP. */
|
2004-05-10 09:37:10 +02:00
|
|
|
crypto_cipher_env_t *p_crypto;
|
|
|
|
/** The cipher used by intermediate hops for cells heading away from
|
2004-05-10 12:27:54 +02:00
|
|
|
* the OP. */
|
2002-08-22 09:30:03 +02:00
|
|
|
crypto_cipher_env_t *n_crypto;
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2004-05-10 09:37:10 +02:00
|
|
|
/** The integrity-checking digest used by intermediate hops, for
|
|
|
|
* cells packaged here and heading towards the OP.
|
|
|
|
*/
|
|
|
|
crypto_digest_env_t *p_digest;
|
|
|
|
/** The integrity-checking digest used by intermediate hops, for
|
|
|
|
* cells packaged at the OP and arriving here.
|
|
|
|
*/
|
|
|
|
crypto_digest_env_t *n_digest;
|
2003-12-16 09:21:58 +01:00
|
|
|
|
2004-05-10 09:37:10 +02:00
|
|
|
/** Build state for this circuit. It includes the intended path
|
|
|
|
* length, the chosen exit router, rendezvous information, etc.
|
|
|
|
*/
|
2003-11-14 21:45:47 +01:00
|
|
|
cpath_build_state_t *build_state;
|
2004-05-10 09:37:10 +02:00
|
|
|
/** The doubly-linked list of crypt_path_t entries, one per hop,
|
|
|
|
* for this circuit. This includes ciphers for each hop,
|
|
|
|
* integrity-checking digests for each hop, and package/delivery
|
|
|
|
* windows for each hop.
|
|
|
|
*
|
|
|
|
* The cpath field is defined only when we are the circuit's origin.
|
|
|
|
*/
|
2003-05-02 00:55:51 +02:00
|
|
|
crypt_path_t *cpath;
|
Integrated onion proxy into or/
The 'or' process can now be told (by the global_role variable) what
roles this server should play -- connect to all ORs, listen for ORs,
listen for OPs, listen for APs, or any combination.
* everything in /src/op/ is now obsolete.
* connection_ap.c now handles all interactions with application proxies
* "port" is now or_port, op_port, ap_port. But routers are still always
referenced (say, in conn_get_by_addr_port()) by addr / or_port. We
should make routers.c actually read these new ports (currently I've
kludged it so op_port = or_port+10, ap_port=or_port+20)
* circuits currently know if they're at the beginning of the path because
circ->cpath is set. They use this instead for crypts (both ways),
if it's set.
* I still obey the "send a 0 back to the AP when you're ready" protocol,
but I think we should phase it out. I can simply not read from the AP
socket until I'm ready.
I need to do a lot of cleanup work here, but the code appears to work, so
now's a good time for a checkin.
svn:r22
2002-07-02 11:36:58 +02:00
|
|
|
|
2005-10-29 21:13:48 +02:00
|
|
|
/** For storage while passing to cpuworker (state
|
|
|
|
* CIRCUIT_STATE_ONIONSKIN_PENDING), or while n_conn is pending
|
|
|
|
* (state CIRCUIT_STATE_OR_WAIT). When defined, it is always
|
|
|
|
* length ONIONSKIN_CHALLENGE_LEN. */
|
|
|
|
char *onionskin;
|
2004-07-02 11:29:01 +02:00
|
|
|
|
2004-05-10 12:27:54 +02:00
|
|
|
char handshake_digest[DIGEST_LEN]; /**< Stores KH for intermediate hops. */
|
2004-04-02 00:21:01 +02:00
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
time_t timestamp_created; /**< When was this circuit created? */
|
|
|
|
time_t timestamp_dirty; /**< When the circuit was first used, or 0 if the
|
|
|
|
* circuit is clean. */
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
uint8_t state; /**< Current status of this circuit. */
|
|
|
|
uint8_t purpose; /**< Why are we creating this circuit? */
|
2004-03-30 21:52:42 +02:00
|
|
|
|
2005-12-14 22:03:51 +01:00
|
|
|
uint16_t marked_for_close; /**< Should we close this circuit at the end of
|
|
|
|
* the main loop? (If true, holds the line number
|
|
|
|
* where this circuit was marked.) */
|
|
|
|
const char *marked_for_close_file; /**< For debugging: in which file was this
|
|
|
|
* circuit marked for close? */
|
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
/**
|
2005-10-12 06:31:44 +02:00
|
|
|
* The rend_query field holds the y portion of y.onion (nul-terminated)
|
2004-05-10 09:37:10 +02:00
|
|
|
* if purpose is C_INTRODUCING or C_ESTABLISH_REND, or is a C_GENERAL
|
|
|
|
* for a hidden service, or is S_*.
|
2004-03-30 21:52:42 +02:00
|
|
|
*/
|
2004-04-03 01:38:26 +02:00
|
|
|
char rend_query[REND_SERVICE_ID_LEN+1];
|
|
|
|
|
2004-05-10 09:37:10 +02:00
|
|
|
/** The rend_pk_digest field holds a hash of location-hidden service's
|
2004-05-10 12:27:54 +02:00
|
|
|
* PK if purpose is INTRO_POINT or S_ESTABLISH_INTRO or S_RENDEZVOUSING.
|
2004-04-03 01:38:26 +02:00
|
|
|
*/
|
2004-04-03 04:40:30 +02:00
|
|
|
char rend_pk_digest[DIGEST_LEN];
|
2004-04-01 22:05:57 +02:00
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
/** Holds rendezvous cookie if purpose is REND_POINT_WAITING or
|
2004-04-02 23:56:52 +02:00
|
|
|
* C_ESTABLISH_REND. Filled with zeroes otherwise.
|
|
|
|
*/
|
2004-03-30 21:52:42 +02:00
|
|
|
char rend_cookie[REND_COOKIE_LEN];
|
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
/** Points to spliced circuit if purpose is REND_ESTABLISHED, and circuit
|
2004-03-30 21:52:42 +02:00
|
|
|
* is not marked for close. */
|
|
|
|
struct circuit_t *rend_splice;
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2004-11-03 19:33:07 +01:00
|
|
|
/** Quasi-global identifier for this circuit; used for control.c */
|
2005-03-01 02:15:01 +01:00
|
|
|
/* XXXX NM This can get re-used after 2**32 circuits. */
|
2004-11-03 19:33:07 +01:00
|
|
|
uint32_t global_identifier;
|
|
|
|
|
2004-05-10 08:52:01 +02:00
|
|
|
struct circuit_t *next; /**< Next circuit in linked list. */
|
2003-08-21 01:05:22 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
typedef struct circuit_t circuit_t;
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2006-03-19 02:21:59 +01:00
|
|
|
#define ALLOW_INVALID_ENTRY 1
|
|
|
|
#define ALLOW_INVALID_EXIT 2
|
|
|
|
#define ALLOW_INVALID_MIDDLE 4
|
|
|
|
#define ALLOW_INVALID_RENDEZVOUS 8
|
|
|
|
#define ALLOW_INVALID_INTRODUCTION 16
|
2004-08-17 07:13:58 +02:00
|
|
|
|
2005-10-06 06:33:40 +02:00
|
|
|
/** An entry specifying a set of addresses and ports that should be remapped
|
|
|
|
* to another address and port before exiting this exit node. */
|
2004-10-17 00:37:08 +02:00
|
|
|
typedef struct exit_redirect_t {
|
|
|
|
uint32_t addr;
|
|
|
|
uint32_t mask;
|
|
|
|
uint16_t port_min;
|
|
|
|
uint16_t port_max;
|
|
|
|
|
|
|
|
uint32_t addr_dest;
|
2004-10-17 00:56:46 +02:00
|
|
|
uint16_t port_dest;
|
2005-09-30 00:59:17 +02:00
|
|
|
unsigned is_redirect:1;
|
2004-10-17 00:37:08 +02:00
|
|
|
} exit_redirect_t;
|
|
|
|
|
2005-10-06 06:33:40 +02:00
|
|
|
/** A linked list of lines in a config file. */
|
2005-07-22 23:12:10 +02:00
|
|
|
typedef struct config_line_t {
|
|
|
|
char *key;
|
|
|
|
char *value;
|
|
|
|
struct config_line_t *next;
|
|
|
|
} config_line_t;
|
|
|
|
|
2005-11-18 03:47:09 +01:00
|
|
|
/** Configuration options for a Tor process. */
|
2002-12-03 23:18:23 +01:00
|
|
|
typedef struct {
|
2005-07-22 22:37:42 +02:00
|
|
|
uint32_t _magic;
|
|
|
|
|
2004-10-30 21:18:37 +02:00
|
|
|
/** What should the tor process actually do? */
|
|
|
|
enum {
|
2004-11-03 20:49:03 +01:00
|
|
|
CMD_RUN_TOR=0, CMD_LIST_FINGERPRINT, CMD_HASH_PASSWORD,
|
2005-08-27 01:22:27 +02:00
|
|
|
CMD_VERIFY_CONFIG, CMD_RUN_UNITTESTS
|
2004-10-30 21:18:37 +02:00
|
|
|
} command;
|
2004-11-03 20:49:03 +01:00
|
|
|
const char *command_arg; /**< Argument for command-line option. */
|
|
|
|
|
2005-07-22 23:12:10 +02:00
|
|
|
config_line_t *OldLogOptions; /**< List of configuration lines
|
2005-11-18 03:47:09 +01:00
|
|
|
* for logfiles, old style. */
|
2004-11-05 06:50:35 +01:00
|
|
|
|
2005-07-22 23:12:10 +02:00
|
|
|
config_line_t *Logs; /**< New-style list of configuration lines
|
2005-11-18 03:47:09 +01:00
|
|
|
* for logs */
|
2004-05-19 22:07:08 +02:00
|
|
|
|
2004-05-10 12:27:54 +02:00
|
|
|
char *DebugLogFile; /**< Where to send verbose log messages. */
|
|
|
|
char *DataDirectory; /**< OR only: where to store long-term data. */
|
|
|
|
char *Nickname; /**< OR only: nickname of this onion router. */
|
|
|
|
char *Address; /**< OR only: configured address for this onion router. */
|
|
|
|
char *PidFile; /**< Where to store PID of Tor process. */
|
2004-05-10 08:52:01 +02:00
|
|
|
|
|
|
|
char *ExitNodes; /**< Comma-separated list of nicknames of ORs to consider
|
|
|
|
* as exits. */
|
|
|
|
char *EntryNodes; /**< Comma-separated list of nicknames of ORs to consider
|
|
|
|
* as entry points. */
|
2004-08-15 22:14:44 +02:00
|
|
|
int StrictExitNodes; /**< Boolean: When none of our ExitNodes are up, do we
|
|
|
|
* stop building circuits? */
|
|
|
|
int StrictEntryNodes; /**< Boolean: When none of our EntryNodes are up, do we
|
|
|
|
* stop building circuits? */
|
2004-05-10 08:52:01 +02:00
|
|
|
char *ExcludeNodes; /**< Comma-separated list of nicknames of ORs not to
|
|
|
|
* use in circuits. */
|
|
|
|
|
|
|
|
char *RendNodes; /**< Comma-separated list of nicknames used as introduction
|
|
|
|
* points. */
|
|
|
|
char *RendExcludeNodes; /**< Comma-separated list of nicknames not to use
|
|
|
|
* as introduction points. */
|
|
|
|
|
2006-03-19 02:21:59 +01:00
|
|
|
smartlist_t *AllowInvalidNodes; /**< List of "entry", "middle", "exit" */
|
|
|
|
int _AllowInvalid; /**< Bitmask; derived from AllowInvalidNodes; */
|
2005-07-22 23:12:10 +02:00
|
|
|
config_line_t *ExitPolicy; /**< Lists of exit policy components. */
|
2006-02-01 04:53:52 +01:00
|
|
|
int ExitPolicyRejectPrivate; /**< Should we not exit to local addresses? */
|
2005-07-22 23:12:10 +02:00
|
|
|
config_line_t *SocksPolicy; /**< Lists of socks policy components */
|
|
|
|
config_line_t *DirPolicy; /**< Lists of dir policy components */
|
2004-08-16 13:43:18 +02:00
|
|
|
/** Addresses to bind for listening for SOCKS connections. */
|
2005-10-17 05:17:29 +02:00
|
|
|
config_line_t *SocksListenAddress;
|
2004-08-16 13:43:18 +02:00
|
|
|
/** Addresses to bind for listening for OR connections. */
|
2005-10-17 05:17:29 +02:00
|
|
|
config_line_t *ORListenAddress;
|
2004-08-16 13:43:18 +02:00
|
|
|
/** Addresses to bind for listening for directory connections. */
|
2005-10-17 05:17:29 +02:00
|
|
|
config_line_t *DirListenAddress;
|
2006-02-13 07:25:16 +01:00
|
|
|
/** Addresses to bind for listening for control connections. */
|
|
|
|
config_line_t *ControlListenAddress;
|
2004-08-16 13:43:18 +02:00
|
|
|
/** Local address to bind outbound sockets */
|
|
|
|
char *OutboundBindAddress;
|
2005-01-06 22:03:27 +01:00
|
|
|
/** Directory server only: which versions of
|
|
|
|
* Tor should we tell users to run? */
|
2005-07-22 23:12:10 +02:00
|
|
|
config_line_t *RecommendedVersions;
|
2005-08-25 22:33:17 +02:00
|
|
|
config_line_t *RecommendedClientVersions;
|
|
|
|
config_line_t *RecommendedServerVersions;
|
2005-01-06 22:03:27 +01:00
|
|
|
/** Whether dirservers refuse router descriptors with private IPs. */
|
|
|
|
int DirAllowPrivateAddresses;
|
2004-05-10 08:52:01 +02:00
|
|
|
char *User; /**< Name of user to run Tor as. */
|
|
|
|
char *Group; /**< Name of group to run Tor as. */
|
|
|
|
double PathlenCoinWeight; /**< Parameter used to configure average path
|
2004-05-10 12:27:54 +02:00
|
|
|
* length (alpha in geometric distribution). */
|
|
|
|
int ORPort; /**< Port to listen on for OR connections. */
|
|
|
|
int SocksPort; /**< Port to listen on for SOCKS connections. */
|
2004-11-04 07:41:49 +01:00
|
|
|
int ControlPort; /**< Port to listen on for control connections. */
|
2004-05-10 12:27:54 +02:00
|
|
|
int DirPort; /**< Port to listen on for directory connections. */
|
2005-08-26 09:41:19 +02:00
|
|
|
int AssumeReachable; /**< Whether to publish our descriptor regardless. */
|
2004-06-21 06:37:27 +02:00
|
|
|
int AuthoritativeDir; /**< Boolean: is this an authoritative directory? */
|
2005-09-15 16:39:05 +02:00
|
|
|
int V1AuthoritativeDir; /**< Boolean: is this an authoritative directory?
|
|
|
|
* for version 1 directories? */
|
|
|
|
int NamingAuthoritativeDir; /**< Boolean: is this an authoritative directory
|
|
|
|
* that's willing to bind names? */
|
2005-12-14 21:40:40 +01:00
|
|
|
int VersioningAuthoritativeDir; /**< Boolean: is this an authoritative
|
|
|
|
* directory that's willing to recommend
|
|
|
|
* versions? */
|
2004-07-13 09:42:20 +02:00
|
|
|
int ClientOnly; /**< Boolean: should we never evolve into a server role? */
|
2005-04-21 12:40:48 +02:00
|
|
|
int NoPublish; /**< Boolean: should we never publish a descriptor? */
|
2006-02-19 23:02:02 +01:00
|
|
|
int PublishServerDescriptor; /**< Do we publish our descriptor as normal? */
|
|
|
|
int PublishHidServDescriptors; /**< and our hidden service descriptors? */
|
|
|
|
int FetchServerDescriptors; /**< Do we fetch server descriptors as normal? */
|
|
|
|
int FetchHidServDescriptors; /** and hidden service descriptors? */
|
2006-04-08 23:48:14 +02:00
|
|
|
int FetchUselessDescriptors; /**< Do we fetch non-running descriptors too? */
|
2006-02-19 23:02:02 +01:00
|
|
|
int AllDirActionsPrivate; /**< Should every directory action be sent
|
|
|
|
* through a Tor circuit? */
|
|
|
|
|
2006-02-09 03:59:26 +01:00
|
|
|
int ConnLimit; /**< Demanded minimum number of simultaneous connections. */
|
|
|
|
int _ConnLimit; /**< Maximum allowed number of simultaneous connections. */
|
2004-05-10 08:52:01 +02:00
|
|
|
int RunAsDaemon; /**< If true, run in the background. (Unix only) */
|
2004-08-16 22:47:00 +02:00
|
|
|
int FascistFirewall; /**< Whether to prefer ORs reachable on open ports. */
|
2005-12-14 21:40:40 +01:00
|
|
|
smartlist_t *FirewallPorts; /**< Which ports our firewall allows
|
|
|
|
* (strings). */
|
2006-02-19 09:31:47 +01:00
|
|
|
config_line_t *ReachableAddresses; /**< IP:ports our firewall allows. */
|
|
|
|
config_line_t *ReachableORAddresses; /**< IP:ports for OR conns. */
|
|
|
|
config_line_t *ReachableDirAddresses; /**< IP:ports for Dir conns. */
|
2005-08-08 23:58:48 +02:00
|
|
|
|
2005-12-14 21:40:40 +01:00
|
|
|
/** Application ports that require all nodes in circ to have sufficient
|
|
|
|
* uptime. */
|
2005-01-12 05:58:23 +01:00
|
|
|
smartlist_t *LongLivedPorts;
|
2005-02-22 01:53:08 +01:00
|
|
|
/** Should we try to reuse the same exit node for a given host */
|
|
|
|
smartlist_t *TrackHostExits;
|
2005-12-14 21:40:40 +01:00
|
|
|
int TrackHostExitsExpire; /**< Number of seconds until we expire an
|
|
|
|
* addressmap */
|
2005-07-22 23:12:10 +02:00
|
|
|
config_line_t *AddressMap; /**< List of address map directives. */
|
2004-11-15 10:05:54 +01:00
|
|
|
int RendPostPeriod; /**< How often do we post each rendezvous service
|
|
|
|
* descriptor? Remember to publish them independently. */
|
2004-05-10 08:52:01 +02:00
|
|
|
int KeepalivePeriod; /**< How often do we send padding cells to keep
|
|
|
|
* connections alive? */
|
2006-03-22 00:27:43 +01:00
|
|
|
int SocksTimeout; /**< How long do we let a socks connection wait
|
|
|
|
* unattached before we fail it? */
|
2006-03-22 01:52:37 +01:00
|
|
|
int CircuitBuildTimeout; /**< Cull non-open circuits that were born
|
|
|
|
* at least this many seconds ago. */
|
|
|
|
int CircuitIdleTimeout; /**< Cull open clean circuits that were born
|
|
|
|
* at least this many seconds ago. */
|
2004-05-10 08:52:01 +02:00
|
|
|
int MaxOnionsPending; /**< How many circuit CREATE requests do we allow
|
|
|
|
* to wait simultaneously before we start dropping
|
|
|
|
* them? */
|
|
|
|
int NewCircuitPeriod; /**< How long do we use a circuit before building
|
|
|
|
* a new one? */
|
Introduce a notion of 'internal' circs, which are chosen without regard
to the exit policy of the last hop. Intro and rendezvous circs must
be internal circs, to avoid leaking information. Resolve and connect
streams can use internal circs if they want.
New circuit pooling algorithm: make sure to have enough circs around
to satisfy any predicted ports, and also make sure to have 2 internal
circs around if we've required internal circs lately (with high uptime
if we've seen that lately).
Split NewCircuitPeriod config option into NewCircuitPeriod (30 secs),
which describes how often we retry making new circuits if current ones
are dirty, and MaxCircuitDirtiness (10 mins), which describes how long
we're willing to make use of an already-dirty circuit.
Once rendezvous circuits are established, keep using the same circuit as
long as you attach a new stream to it at least every 10 minutes. (So web
browsing doesn't require you to build new rend circs every 30 seconds.)
Cannibalize GENERAL circs to be C_REND, C_INTRO, S_INTRO, and S_REND
circ as necessary, if there are any completed ones lying around when
we try to launch one.
Re-instate the ifdef's to use version-0 style introduce cells, since
there was yet another bug in handling version-1 style. We'll try switching
over again after 0.0.9 is obsolete.
Bugfix: when choosing an exit node for a new non-internal circ, don't take
into account whether it'll be useful for any pending x.onion addresses --
it won't.
Bugfix: we weren't actually publishing the hidden service descriptor when
it became dirty. So we only published it every 20 minutes or so, which
means when you first start your Tor, the hidden service will seem broken.
svn:r3360
2005-01-17 19:13:09 +01:00
|
|
|
int MaxCircuitDirtiness; /**< Never use circs that were first used more than
|
|
|
|
this interval ago. */
|
2005-12-14 21:40:40 +01:00
|
|
|
uint64_t BandwidthRate; /**< How much bandwidth, on average, are we willing
|
|
|
|
* to use in a second? */
|
|
|
|
uint64_t BandwidthBurst; /**< How much bandwidth, at maximum, are we willing
|
|
|
|
* to use in a second? */
|
2005-03-22 20:01:46 +01:00
|
|
|
uint64_t MaxAdvertisedBandwidth; /**< How much bandwidth are we willing to
|
|
|
|
* tell people we have? */
|
2006-06-07 11:18:53 +02:00
|
|
|
uint64_t RelayBandwidthRate; /**< How much bandwidth, on average, are we
|
|
|
|
* willing to use for all relayed conns? */
|
|
|
|
uint64_t RelayBandwidthBurst; /**< How much bandwidth, at maximum, will we
|
|
|
|
* use in a second for all relayed conns? */
|
2004-05-10 08:52:01 +02:00
|
|
|
int NumCpus; /**< How many CPUs should we try to use? */
|
|
|
|
int RunTesting; /**< If true, create testing circuits to measure how well the
|
|
|
|
* other ORs are running. */
|
2006-06-10 02:26:39 +02:00
|
|
|
char *TestVia; /**< When reachability testing, use these as middle hop. */
|
2005-07-22 23:12:10 +02:00
|
|
|
config_line_t *RendConfigLines; /**< List of configuration lines
|
2004-05-10 08:52:01 +02:00
|
|
|
* for rendezvous services. */
|
2004-10-08 07:53:59 +02:00
|
|
|
char *ContactInfo; /**< Contact info to be published in the directory */
|
|
|
|
|
|
|
|
char *HttpProxy; /**< hostname[:port] to use as http proxy, if any */
|
|
|
|
uint32_t HttpProxyAddr; /**< Parsed IPv4 addr for http proxy, if any */
|
|
|
|
uint16_t HttpProxyPort; /**< Parsed port for http proxy, if any */
|
2005-05-20 10:51:45 +02:00
|
|
|
char *HttpProxyAuthenticator; /**< username:password string, if any */
|
2004-10-08 07:53:59 +02:00
|
|
|
|
2005-02-24 11:56:55 +01:00
|
|
|
char *HttpsProxy; /**< hostname[:port] to use as https proxy, if any */
|
|
|
|
uint32_t HttpsProxyAddr; /**< Parsed IPv4 addr for https proxy, if any */
|
|
|
|
uint16_t HttpsProxyPort; /**< Parsed port for https proxy, if any */
|
2005-05-20 10:51:45 +02:00
|
|
|
char *HttpsProxyAuthenticator; /**< username:password string, if any */
|
2005-02-24 11:56:55 +01:00
|
|
|
|
2005-07-22 23:12:10 +02:00
|
|
|
config_line_t *DirServers; /**< List of configuration lines
|
2004-10-12 17:55:20 +02:00
|
|
|
* for directory servers. */
|
2004-10-15 03:58:11 +02:00
|
|
|
char *MyFamily; /**< Declared family for this OR. */
|
2005-07-22 23:12:10 +02:00
|
|
|
config_line_t *NodeFamilies; /**< List of config lines for
|
2004-10-15 22:52:09 +02:00
|
|
|
* node families */
|
2005-07-22 23:12:10 +02:00
|
|
|
config_line_t *RedirectExit; /**< List of config lines for simple
|
2004-10-17 00:37:08 +02:00
|
|
|
* addr/port redirection */
|
2004-10-17 00:56:46 +02:00
|
|
|
smartlist_t *RedirectExitList; /**< List of exit_redirect_t */
|
2005-09-15 16:39:05 +02:00
|
|
|
config_line_t *AuthDirReject; /**< Address policy for descriptors to
|
|
|
|
* reject. */
|
|
|
|
config_line_t *AuthDirInvalid; /**< Address policy for descriptors to
|
|
|
|
* never mark as valid. */
|
2005-12-15 22:39:38 +01:00
|
|
|
int AuthDirRejectUnlisted; /**< Boolean: do we reject all routers that
|
2005-12-15 22:51:12 +01:00
|
|
|
* aren't named in our fingerprint file? */
|
2005-05-20 10:51:45 +02:00
|
|
|
char *AccountingStart; /**< How long is the accounting interval, and when
|
2004-11-22 22:56:51 +01:00
|
|
|
* does it start? */
|
2004-11-20 01:37:00 +01:00
|
|
|
uint64_t AccountingMax; /**< How many bytes do we allow per accounting
|
|
|
|
* interval before hibernation? 0 for "never
|
|
|
|
* hibernate." */
|
|
|
|
int _AccountingMaxKB; /**< How many KB do we allow per accounting
|
|
|
|
* interval before hibernation? 0 for "never
|
2004-11-22 22:56:51 +01:00
|
|
|
* hibernate." (Based on a deprecated option)*/
|
2004-11-20 01:37:00 +01:00
|
|
|
|
2004-11-03 20:49:03 +01:00
|
|
|
char *HashedControlPassword; /**< Base64-encoded hash of a password for
|
|
|
|
* the control system. */
|
2004-11-12 17:39:03 +01:00
|
|
|
int CookieAuthentication; /**< Boolean: do we enable cookie-based auth for
|
|
|
|
* the control system? */
|
2005-03-27 08:25:33 +02:00
|
|
|
int LeaveStreamsUnattached; /**< Boolean: Does Tor attach new streams to
|
|
|
|
* circuits itself (0), or does it expect a controller
|
|
|
|
* to cope? (1) */
|
2005-03-12 21:13:38 +01:00
|
|
|
int ShutdownWaitLength; /**< When we get a SIGINT and we're a server, how
|
|
|
|
* long do we wait before exiting? */
|
2005-05-03 12:04:08 +02:00
|
|
|
int SafeLogging; /**< Boolean: are we allowed to log sensitive strings
|
|
|
|
* such as addresses (0), or do we scrub them first (1)? */
|
2006-03-19 02:44:53 +01:00
|
|
|
int SafeSocks; /**< Boolean: should we outright refuse application
|
|
|
|
* connections that use socks4 or socks5-with-local-dns? */
|
2005-12-14 21:40:40 +01:00
|
|
|
#define LOG_PROTOCOL_WARN (get_options()->ProtocolWarnings ? \
|
|
|
|
LOG_WARN : LOG_INFO)
|
2005-10-17 02:35:53 +02:00
|
|
|
int ProtocolWarnings; /**< Boolean: when other parties screw up the Tor
|
|
|
|
* protocol, is it a warn or an info in our logs? */
|
2005-11-17 00:37:35 +01:00
|
|
|
int TestSocks; /**< Boolean: when we get a socks connection, do we loudly
|
|
|
|
* log whether it was DNS-leaking or not? */
|
2005-06-20 20:56:35 +02:00
|
|
|
int HardwareAccel; /**< Boolean: Should we enable OpenSSL hardware
|
|
|
|
* acceleration where available? */
|
2006-01-10 23:42:44 +01:00
|
|
|
int UseEntryGuards; /**< Boolean: Do we try to enter from a smallish number
|
|
|
|
* of fixed nodes? */
|
|
|
|
int NumEntryGuards; /**< How many entry guards do we try to establish? */
|
2005-07-25 12:29:21 +02:00
|
|
|
int RephistTrackTime; /**< How many seconds do we keep rephist info? */
|
2005-12-07 23:09:02 +01:00
|
|
|
int FastFirstHopPK; /**< If Tor believes it is safe, should we save a third
|
|
|
|
* of our PK time by sending CREATE_FAST cells? */
|
2005-08-08 23:58:48 +02:00
|
|
|
|
|
|
|
addr_policy_t *reachable_addr_policy; /**< Parsed from ReachableAddresses */
|
2006-04-18 05:36:28 +02:00
|
|
|
|
|
|
|
char *VirtualAddrNetwork; /**< Address and mask to hand out for virtual
|
|
|
|
* MAPADDRESS requests. */
|
2006-07-07 19:33:30 +02:00
|
|
|
smartlist_t *Nameservers; /**< If provided, overrides the platform nameserver
|
|
|
|
* list. when using eventdns. */
|
2002-07-03 18:31:22 +02:00
|
|
|
} or_options_t;
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2005-07-28 21:01:48 +02:00
|
|
|
/** Persistent state for an onion router, as saved to disk. */
|
|
|
|
typedef struct {
|
|
|
|
uint32_t _magic;
|
|
|
|
int dirty;
|
|
|
|
|
|
|
|
/* XXXX These options aren't actually attached to anything yet. */
|
|
|
|
time_t LastWritten;
|
|
|
|
time_t AccountingIntervalStart;
|
|
|
|
uint64_t AccountingBytesReadInInterval;
|
|
|
|
uint64_t AccountingBytesWrittenInInterval;
|
|
|
|
int AccountingSecondsActive;
|
|
|
|
uint64_t AccountingExpectedUsage;
|
|
|
|
|
2006-01-10 23:42:44 +01:00
|
|
|
config_line_t *EntryGuards;
|
2005-12-24 00:56:42 +01:00
|
|
|
|
|
|
|
time_t BWHistoryReadEnds;
|
|
|
|
int BWHistoryReadInterval;
|
|
|
|
smartlist_t *BWHistoryReadValues;
|
|
|
|
time_t BWHistoryWriteEnds;
|
|
|
|
int BWHistoryWriteInterval;
|
|
|
|
smartlist_t *BWHistoryWriteValues;
|
2005-12-31 09:16:07 +01:00
|
|
|
|
|
|
|
char *TorVersion;
|
2006-02-12 23:28:30 +01:00
|
|
|
|
|
|
|
config_line_t *ExtraLines;
|
2005-07-28 21:01:48 +02:00
|
|
|
} or_state_t;
|
|
|
|
|
2004-02-26 23:02:22 +01:00
|
|
|
#define MAX_SOCKS_REPLY_LEN 1024
|
|
|
|
#define MAX_SOCKS_ADDR_LEN 256
|
2004-06-17 20:13:09 +02:00
|
|
|
#define SOCKS_COMMAND_CONNECT 0x01
|
|
|
|
#define SOCKS_COMMAND_RESOLVE 0xF0
|
2004-05-10 08:52:01 +02:00
|
|
|
/** State of a SOCKS request from a user to an OP */
|
2003-11-11 03:41:31 +01:00
|
|
|
struct socks_request_t {
|
2004-05-10 08:52:01 +02:00
|
|
|
char socks_version; /**< Which version of SOCKS did the client use? */
|
2004-06-17 20:13:09 +02:00
|
|
|
int command; /**< What has the user requested? One of CONNECT or RESOLVE. */
|
2004-10-14 04:47:09 +02:00
|
|
|
size_t replylen; /**< Length of <b>reply</b>. */
|
2004-05-10 09:37:10 +02:00
|
|
|
char reply[MAX_SOCKS_REPLY_LEN]; /**< Write an entry into this string if
|
|
|
|
* we want to specify our own socks reply,
|
|
|
|
* rather than using the default socks4 or
|
|
|
|
* socks5 socks reply. We use this for the
|
|
|
|
* two-stage socks5 handshake.
|
|
|
|
*/
|
2004-05-10 08:52:01 +02:00
|
|
|
int has_finished; /**< Has the SOCKS handshake finished? */
|
2005-12-14 21:40:40 +01:00
|
|
|
char address[MAX_SOCKS_ADDR_LEN]; /**< What address did the client ask to
|
|
|
|
connect to? */
|
2004-05-10 09:37:10 +02:00
|
|
|
uint16_t port; /**< What port did the client ask to connect to? */
|
2003-11-11 03:41:31 +01:00
|
|
|
};
|
|
|
|
|
2003-10-25 14:01:09 +02:00
|
|
|
/* all the function prototypes go here */
|
2002-06-27 00:45:49 +02:00
|
|
|
|
|
|
|
/********************************* buffers.c ***************************/
|
|
|
|
|
2004-10-27 20:16:37 +02:00
|
|
|
buf_t *buf_new(void);
|
2003-09-25 07:17:11 +02:00
|
|
|
buf_t *buf_new_with_capacity(size_t size);
|
|
|
|
void buf_free(buf_t *buf);
|
2004-02-28 20:14:11 +01:00
|
|
|
void buf_clear(buf_t *buf);
|
2005-05-03 01:17:08 +02:00
|
|
|
void buf_shrink(buf_t *buf);
|
2003-09-25 07:17:11 +02:00
|
|
|
|
|
|
|
size_t buf_datalen(const buf_t *buf);
|
|
|
|
size_t buf_capacity(const buf_t *buf);
|
|
|
|
const char *_buf_peek_raw_buffer(const buf_t *buf);
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2004-04-28 22:13:21 +02:00
|
|
|
int read_to_buf(int s, size_t at_most, buf_t *buf, int *reached_eof);
|
2005-10-06 06:33:40 +02:00
|
|
|
int read_to_buf_tls(tor_tls_t *tls, size_t at_most, buf_t *buf);
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2005-10-29 20:19:37 +02:00
|
|
|
int flush_buf(int s, buf_t *buf, size_t sz, size_t *buf_flushlen);
|
|
|
|
int flush_buf_tls(tor_tls_t *tls, buf_t *buf, size_t sz, size_t *buf_flushlen);
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2004-10-14 04:47:09 +02:00
|
|
|
int write_to_buf(const char *string, size_t string_len, buf_t *buf);
|
2006-06-18 09:38:55 +02:00
|
|
|
int write_to_buf_zlib(buf_t *buf, tor_zlib_state_t *state,
|
|
|
|
const char *data, size_t data_len, int done);
|
2004-04-28 22:13:21 +02:00
|
|
|
int fetch_from_buf(char *string, size_t string_len, buf_t *buf);
|
2003-09-25 07:17:11 +02:00
|
|
|
int fetch_from_buf_http(buf_t *buf,
|
2004-10-14 04:47:09 +02:00
|
|
|
char **headers_out, size_t max_headerlen,
|
2005-10-14 04:26:13 +02:00
|
|
|
char **body_out, size_t *body_used, size_t max_bodylen,
|
|
|
|
int force_complete);
|
2006-03-19 02:44:53 +01:00
|
|
|
int fetch_from_buf_socks(buf_t *buf, socks_request_t *req,
|
|
|
|
int log_sockstype, int safe_socks);
|
2005-06-17 20:49:55 +02:00
|
|
|
int fetch_from_buf_control0(buf_t *buf, uint32_t *len_out, uint16_t *type_out,
|
|
|
|
char **body_out, int check_for_v1);
|
|
|
|
int fetch_from_buf_line(buf_t *buf, char *data_out, size_t *data_len);
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2004-03-03 23:49:15 +01:00
|
|
|
void assert_buf_ok(buf_t *buf);
|
|
|
|
|
2004-05-13 09:24:49 +02:00
|
|
|
/********************************* circuitbuild.c **********************/
|
|
|
|
|
2004-11-23 01:11:36 +01:00
|
|
|
char *circuit_list_path(circuit_t *circ, int verbose);
|
2005-10-25 09:05:03 +02:00
|
|
|
void circuit_log_path(int severity, unsigned int domain, circuit_t *circ);
|
2004-05-13 09:24:49 +02:00
|
|
|
void circuit_rep_hist_note_result(circuit_t *circ);
|
|
|
|
void circuit_dump_by_conn(connection_t *conn, int severity);
|
2005-03-22 01:42:38 +01:00
|
|
|
circuit_t *circuit_init(uint8_t purpose, int need_uptime,
|
|
|
|
int need_capacity, int internal);
|
2005-06-29 23:46:55 +02:00
|
|
|
circuit_t *circuit_establish_circuit(uint8_t purpose, extend_info_t *exit,
|
2005-12-14 21:40:40 +01:00
|
|
|
int need_uptime, int need_capacity,
|
|
|
|
int internal);
|
2005-03-22 01:42:38 +01:00
|
|
|
int circuit_handle_first_hop(circuit_t *circ);
|
2004-11-21 08:43:12 +01:00
|
|
|
void circuit_n_conn_done(connection_t *or_conn, int status);
|
2006-01-17 05:03:23 +01:00
|
|
|
int inform_testing_reachability(void);
|
2004-05-13 09:24:49 +02:00
|
|
|
int circuit_send_next_onion_skin(circuit_t *circ);
|
2005-03-20 00:58:42 +01:00
|
|
|
void circuit_note_clock_jumped(int seconds_elapsed);
|
2004-05-13 09:24:49 +02:00
|
|
|
int circuit_extend(cell_t *cell, circuit_t *circ);
|
2005-12-14 21:40:40 +01:00
|
|
|
int circuit_init_cpath_crypto(crypt_path_t *cpath, char *key_data,
|
|
|
|
int reverse);
|
2005-05-03 00:35:18 +02:00
|
|
|
int circuit_finish_handshake(circuit_t *circ, uint8_t cell_type, char *reply);
|
2004-05-13 09:24:49 +02:00
|
|
|
int circuit_truncated(circuit_t *circ, crypt_path_t *layer);
|
2005-12-14 21:40:40 +01:00
|
|
|
int onionskin_answer(circuit_t *circ, uint8_t cell_type, char *payload,
|
|
|
|
char *keys);
|
2005-01-12 05:58:23 +01:00
|
|
|
int circuit_all_predicted_ports_handled(time_t now, int *need_uptime,
|
|
|
|
int *need_capacity);
|
|
|
|
|
2005-06-29 23:46:55 +02:00
|
|
|
int circuit_append_new_exit(circuit_t *circ, extend_info_t *info);
|
|
|
|
int circuit_extend_to_new_exit(circuit_t *circ, extend_info_t *info);
|
2004-05-13 09:24:49 +02:00
|
|
|
void onion_append_to_cpath(crypt_path_t **head_ptr, crypt_path_t *new_hop);
|
2005-06-29 23:46:55 +02:00
|
|
|
extend_info_t *extend_info_from_router(routerinfo_t *r);
|
|
|
|
extend_info_t *extend_info_dup(extend_info_t *info);
|
|
|
|
void extend_info_free(extend_info_t *info);
|
|
|
|
routerinfo_t *build_state_get_exit_router(cpath_build_state_t *state);
|
|
|
|
const char *build_state_get_exit_nickname(cpath_build_state_t *state);
|
2004-05-13 09:24:49 +02:00
|
|
|
|
2006-01-10 23:42:44 +01:00
|
|
|
void entry_guards_set_status_from_directory(void);
|
|
|
|
int entry_guard_set_status(const char *digest, int succeeded);
|
2005-12-31 07:32:57 +01:00
|
|
|
void entry_nodes_should_be_added(void);
|
2006-01-10 23:42:44 +01:00
|
|
|
void entry_guards_prepend_from_config(void);
|
|
|
|
void entry_guards_update_state(or_state_t *state);
|
2006-03-26 08:51:26 +02:00
|
|
|
int entry_guards_parse_state(or_state_t *state, int set, char **msg);
|
2006-01-10 23:42:44 +01:00
|
|
|
int entry_guards_getinfo(const char *question, char **answer);
|
|
|
|
void entry_guards_free_all(void);
|
2005-07-22 19:32:25 +02:00
|
|
|
|
2004-05-13 09:24:49 +02:00
|
|
|
/********************************* circuitlist.c ***********************/
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2005-06-19 22:40:41 +02:00
|
|
|
circuit_t * _circuit_get_global_list(void);
|
2005-04-07 23:07:19 +02:00
|
|
|
const char *circuit_state_to_string(int state);
|
2005-04-06 07:33:32 +02:00
|
|
|
enum which_conn_changed_t { P_CONN_CHANGED=1, N_CONN_CHANGED=0 };
|
|
|
|
void circuit_set_circid_orconn(circuit_t *circ, uint16_t id,
|
|
|
|
connection_t *conn,
|
|
|
|
enum which_conn_changed_t which);
|
2005-12-03 03:12:37 +01:00
|
|
|
void circuit_set_state(circuit_t *circ, int state);
|
2004-03-02 18:48:17 +01:00
|
|
|
void circuit_close_all_marked(void);
|
2004-05-13 09:24:49 +02:00
|
|
|
circuit_t *circuit_new(uint16_t p_circ_id, connection_t *p_conn);
|
2005-04-06 07:33:32 +02:00
|
|
|
circuit_t *circuit_get_by_circid_orconn(uint16_t circ_id, connection_t *conn);
|
2005-10-24 21:37:45 +02:00
|
|
|
int circuit_id_used_on_conn(uint16_t circ_id, connection_t *conn);
|
2005-04-06 08:43:21 +02:00
|
|
|
circuit_t *circuit_get_by_edge_conn(connection_t *conn);
|
2006-01-05 22:23:03 +01:00
|
|
|
void circuit_unlink_all_from_or_conn(connection_t *conn, int reason);
|
2005-03-12 05:22:01 +01:00
|
|
|
circuit_t *circuit_get_by_global_id(uint32_t id);
|
2005-12-14 21:40:40 +01:00
|
|
|
circuit_t *circuit_get_by_rend_query_and_purpose(const char *rend_query,
|
|
|
|
uint8_t purpose);
|
2004-05-13 09:24:49 +02:00
|
|
|
circuit_t *circuit_get_next_by_pk_and_purpose(circuit_t *start,
|
|
|
|
const char *digest, uint8_t purpose);
|
|
|
|
circuit_t *circuit_get_rendezvous(const char *cookie);
|
2005-11-11 20:25:30 +01:00
|
|
|
circuit_t *circuit_find_to_cannibalize(uint8_t purpose, extend_info_t *info,
|
|
|
|
int need_uptime,
|
|
|
|
int need_capacity, int internal);
|
2005-03-20 00:58:42 +01:00
|
|
|
void circuit_mark_all_unused_circs(void);
|
2005-10-06 00:31:21 +02:00
|
|
|
void circuit_expire_all_dirty_circs(void);
|
2006-01-05 22:23:03 +01:00
|
|
|
void _circuit_mark_for_close(circuit_t *circ, int reason,
|
|
|
|
int line, const char *file);
|
2005-04-03 07:22:33 +02:00
|
|
|
|
2006-01-05 22:23:03 +01:00
|
|
|
#define circuit_mark_for_close(c, reason) \
|
|
|
|
_circuit_mark_for_close((c), (reason), __LINE__, _SHORT_FILE_)
|
2004-03-02 18:48:17 +01:00
|
|
|
|
2004-05-13 09:24:49 +02:00
|
|
|
void assert_cpath_layer_ok(const crypt_path_t *cp);
|
|
|
|
void assert_circuit_ok(const circuit_t *c);
|
2005-02-11 02:26:47 +01:00
|
|
|
void circuit_free_all(void);
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2004-05-13 09:24:49 +02:00
|
|
|
/********************************* circuituse.c ************************/
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2004-04-13 07:20:52 +02:00
|
|
|
void circuit_expire_building(time_t now);
|
2004-12-05 08:10:08 +01:00
|
|
|
void circuit_remove_handled_ports(smartlist_t *needed_ports);
|
2005-12-14 21:40:40 +01:00
|
|
|
int circuit_stream_is_being_handled(connection_t *conn, uint16_t port,
|
|
|
|
int min);
|
2004-04-13 00:47:12 +02:00
|
|
|
void circuit_build_needed_circs(time_t now);
|
2004-02-18 02:21:20 +01:00
|
|
|
void circuit_detach_stream(circuit_t *circ, connection_t *conn);
|
2002-06-27 00:45:49 +02:00
|
|
|
void circuit_about_to_close_connection(connection_t *conn);
|
2004-05-13 09:24:49 +02:00
|
|
|
void circuit_has_opened(circuit_t *circ);
|
|
|
|
void circuit_build_failed(circuit_t *circ);
|
2005-12-14 21:40:40 +01:00
|
|
|
circuit_t *circuit_launch_by_nickname(uint8_t purpose,
|
|
|
|
const char *exit_nickname,
|
|
|
|
int need_uptime, int need_capacity,
|
|
|
|
int is_internal);
|
2005-06-29 23:46:55 +02:00
|
|
|
circuit_t *circuit_launch_by_extend_info(uint8_t purpose,
|
|
|
|
extend_info_t *info,
|
2005-12-14 21:40:40 +01:00
|
|
|
int need_uptime, int need_capacity,
|
|
|
|
int is_internal);
|
2005-03-22 01:42:38 +01:00
|
|
|
circuit_t *circuit_launch_by_router(uint8_t purpose, routerinfo_t *exit,
|
2005-12-14 21:40:40 +01:00
|
|
|
int need_uptime, int need_capacity,
|
|
|
|
int is_internal);
|
2004-08-18 10:51:04 +02:00
|
|
|
void circuit_reset_failure_count(int timeout);
|
2005-03-12 05:22:01 +01:00
|
|
|
int connection_ap_handshake_attach_chosen_circuit(connection_t *conn,
|
|
|
|
circuit_t *circ);
|
2004-05-13 09:24:49 +02:00
|
|
|
int connection_ap_handshake_attach_circuit(connection_t *conn);
|
|
|
|
|
2002-06-27 00:45:49 +02:00
|
|
|
/********************************* command.c ***************************/
|
|
|
|
|
|
|
|
void command_process_cell(cell_t *cell, connection_t *conn);
|
|
|
|
|
2005-12-31 12:52:13 +01:00
|
|
|
extern uint64_t stats_n_padding_cells_processed;
|
|
|
|
extern uint64_t stats_n_create_cells_processed;
|
|
|
|
extern uint64_t stats_n_created_cells_processed;
|
|
|
|
extern uint64_t stats_n_relay_cells_processed;
|
|
|
|
extern uint64_t stats_n_destroy_cells_processed;
|
2003-10-02 22:00:38 +02:00
|
|
|
|
2002-06-27 00:45:49 +02:00
|
|
|
/********************************* config.c ***************************/
|
|
|
|
|
2004-11-06 06:18:11 +01:00
|
|
|
or_options_t *get_options(void);
|
2006-03-26 08:51:26 +02:00
|
|
|
int set_options(or_options_t *new_val, char **msg);
|
2005-02-11 02:26:47 +01:00
|
|
|
void config_free_all(void);
|
2005-05-03 12:04:08 +02:00
|
|
|
const char *safe_str(const char *address);
|
2006-03-05 10:50:26 +01:00
|
|
|
const char *escaped_safe_str(const char *address);
|
2004-11-06 06:18:11 +01:00
|
|
|
|
2005-07-22 23:12:10 +02:00
|
|
|
int config_get_lines(char *string, config_line_t **result);
|
|
|
|
void config_free_lines(config_line_t *front);
|
2005-12-14 21:40:40 +01:00
|
|
|
int options_trial_assign(config_line_t *list, int use_defaults,
|
2006-03-26 08:51:26 +02:00
|
|
|
int clear_first, char **msg);
|
2006-07-15 22:26:05 +02:00
|
|
|
int resolve_my_address(int warn_severity, or_options_t *options,
|
|
|
|
uint32_t *addr, char **hostname_out);
|
2004-11-06 06:18:11 +01:00
|
|
|
void options_init(or_options_t *options);
|
2005-07-23 03:58:05 +02:00
|
|
|
int options_init_from_torrc(int argc, char **argv);
|
|
|
|
int options_init_logs(or_options_t *options, int validate_only);
|
|
|
|
int option_is_recognized(const char *key);
|
|
|
|
const char *option_get_canonical_name(const char *key);
|
|
|
|
config_line_t *option_get_assignment(or_options_t *options,
|
|
|
|
const char *key);
|
|
|
|
char *options_dump(or_options_t *options, int minimal);
|
|
|
|
int options_save_current(void);
|
2005-08-10 20:05:20 +02:00
|
|
|
const char *get_torrc_fname(void);
|
2002-07-03 18:31:22 +02:00
|
|
|
|
2005-07-28 21:01:48 +02:00
|
|
|
or_state_t *get_or_state(void);
|
|
|
|
int or_state_load(void);
|
|
|
|
int or_state_save(void);
|
|
|
|
|
2005-08-04 21:56:41 +02:00
|
|
|
int config_getinfo_helper(const char *question, char **answer);
|
|
|
|
|
2002-06-27 00:45:49 +02:00
|
|
|
/********************************* connection.c ***************************/
|
|
|
|
|
2005-04-07 22:25:22 +02:00
|
|
|
const char *conn_type_to_string(int type);
|
|
|
|
const char *conn_state_to_string(int type, int state);
|
2004-03-11 07:19:08 +01:00
|
|
|
|
2002-06-27 00:45:49 +02:00
|
|
|
connection_t *connection_new(int type);
|
2005-02-25 06:42:01 +01:00
|
|
|
void connection_unregister(connection_t *conn);
|
2002-06-27 00:45:49 +02:00
|
|
|
void connection_free(connection_t *conn);
|
2004-01-06 08:53:40 +01:00
|
|
|
void connection_free_all(void);
|
2004-05-12 22:36:44 +02:00
|
|
|
void connection_about_to_close_connection(connection_t *conn);
|
2004-02-28 20:14:11 +01:00
|
|
|
void connection_close_immediate(connection_t *conn);
|
2005-04-03 07:22:33 +02:00
|
|
|
void _connection_mark_for_close(connection_t *conn,int line, const char *file);
|
|
|
|
|
|
|
|
#define connection_mark_for_close(c) \
|
|
|
|
_connection_mark_for_close((c), __LINE__, _SHORT_FILE_)
|
2004-02-27 23:00:26 +01:00
|
|
|
|
2004-03-03 06:08:01 +01:00
|
|
|
void connection_expire_held_open(void);
|
|
|
|
|
2005-12-14 21:40:40 +01:00
|
|
|
int connection_connect(connection_t *conn, char *address, uint32_t addr,
|
|
|
|
uint16_t port);
|
2005-09-14 04:36:29 +02:00
|
|
|
int retry_all_listeners(int force, smartlist_t *replaced_conns,
|
|
|
|
smartlist_t *new_conns);
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2005-10-29 20:19:37 +02:00
|
|
|
int connection_bucket_write_limit(connection_t *conn);
|
2006-02-12 00:15:40 +01:00
|
|
|
int global_write_bucket_empty(void);
|
2004-03-14 18:06:29 +01:00
|
|
|
void connection_bucket_init(void);
|
|
|
|
void connection_bucket_refill(struct timeval *now);
|
|
|
|
|
2003-09-05 08:04:03 +02:00
|
|
|
int connection_handle_read(connection_t *conn);
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2004-10-14 04:47:09 +02:00
|
|
|
int connection_fetch_from_buf(char *string, size_t len, connection_t *conn);
|
2003-09-16 07:41:49 +02:00
|
|
|
|
2002-07-18 08:37:58 +02:00
|
|
|
int connection_wants_to_flush(connection_t *conn);
|
2003-09-16 07:41:49 +02:00
|
|
|
int connection_outbuf_too_full(connection_t *conn);
|
2003-09-05 08:04:03 +02:00
|
|
|
int connection_handle_write(connection_t *conn);
|
2005-04-08 05:36:39 +02:00
|
|
|
void _connection_controller_force_write(connection_t *conn);
|
2005-12-14 21:40:40 +01:00
|
|
|
void connection_write_to_buf(const char *string, size_t len,
|
|
|
|
connection_t *conn);
|
2006-06-18 10:46:55 +02:00
|
|
|
void connection_write_to_buf_zlib(connection_t *conn,
|
|
|
|
tor_zlib_state_t *state,
|
|
|
|
const char *data, size_t data_len,
|
|
|
|
int done);
|
Implemented link padding and receiver token buckets
Each socket reads at most 'bandwidth' bytes per second sustained, but
can handle bursts of up to 10*bandwidth bytes.
Cells are now sent out at evenly-spaced intervals, with padding sent
out otherwise. Set Linkpadding=0 in the rc file to send cells as soon
as they're available (and to never send padding cells).
Added license/copyrights statements at the top of most files.
router->min and router->max have been merged into a single 'bandwidth'
value. We should make the routerinfo_t reflect this (want to do that,
Mat?)
As the bandwidth increases, and we want to stop sleeping more and more
frequently to send a single cell, cpu usage goes up. At 128kB/s we're
pretty much calling poll with a timeout of 1ms or even 0ms. The current
code takes a timeout of 0-9ms and makes it 10ms. prepare_for_poll()
handles everything that should have happened in the past, so as long as
our buffers don't get too full in that 10ms, we're ok.
Speaking of too full, if you run three servers at 100kB/s with -l debug,
it spends too much time printing debugging messages to be able to keep
up with the cells. The outbuf ultimately fills up and it kills that
connection. If you run with -l err, it works fine up through 500kB/s and
probably beyond. Down the road we'll want to teach it to recognize when
an outbuf is getting full, and back off.
svn:r50
2002-07-16 03:12:15 +02:00
|
|
|
|
2005-12-14 21:40:40 +01:00
|
|
|
connection_t *connection_or_exact_get_by_addr_port(uint32_t addr,
|
|
|
|
uint16_t port);
|
2005-03-12 05:22:01 +01:00
|
|
|
connection_t *connection_get_by_global_id(uint32_t id);
|
2003-09-30 21:06:22 +02:00
|
|
|
|
|
|
|
connection_t *connection_get_by_type(int type);
|
2005-09-12 08:56:42 +02:00
|
|
|
connection_t *connection_get_by_type_purpose(int type, int purpose);
|
|
|
|
connection_t *connection_get_by_type_addr_port_purpose(int type, uint32_t addr,
|
2005-12-14 21:40:40 +01:00
|
|
|
uint16_t port, int purpose);
|
2003-09-30 21:06:22 +02:00
|
|
|
connection_t *connection_get_by_type_state(int type, int state);
|
|
|
|
connection_t *connection_get_by_type_state_lastwritten(int type, int state);
|
2005-12-14 21:40:40 +01:00
|
|
|
connection_t *connection_get_by_type_state_rendquery(int type, int state,
|
|
|
|
const char *rendquery);
|
2003-09-30 21:06:22 +02:00
|
|
|
|
2003-05-28 04:03:25 +02:00
|
|
|
#define connection_speaks_cells(conn) ((conn)->type == CONN_TYPE_OR)
|
2002-09-22 00:41:48 +02:00
|
|
|
int connection_is_listener(connection_t *conn);
|
Implemented link padding and receiver token buckets
Each socket reads at most 'bandwidth' bytes per second sustained, but
can handle bursts of up to 10*bandwidth bytes.
Cells are now sent out at evenly-spaced intervals, with padding sent
out otherwise. Set Linkpadding=0 in the rc file to send cells as soon
as they're available (and to never send padding cells).
Added license/copyrights statements at the top of most files.
router->min and router->max have been merged into a single 'bandwidth'
value. We should make the routerinfo_t reflect this (want to do that,
Mat?)
As the bandwidth increases, and we want to stop sleeping more and more
frequently to send a single cell, cpu usage goes up. At 128kB/s we're
pretty much calling poll with a timeout of 1ms or even 0ms. The current
code takes a timeout of 0-9ms and makes it 10ms. prepare_for_poll()
handles everything that should have happened in the past, so as long as
our buffers don't get too full in that 10ms, we're ok.
Speaking of too full, if you run three servers at 100kB/s with -l debug,
it spends too much time printing debugging messages to be able to keep
up with the cells. The outbuf ultimately fills up and it kills that
connection. If you run with -l err, it works fine up through 500kB/s and
probably beyond. Down the road we'll want to teach it to recognize when
an outbuf is getting full, and back off.
svn:r50
2002-07-16 03:12:15 +02:00
|
|
|
int connection_state_is_open(connection_t *conn);
|
2004-05-12 21:17:09 +02:00
|
|
|
int connection_state_is_connecting(connection_t *conn);
|
Implemented link padding and receiver token buckets
Each socket reads at most 'bandwidth' bytes per second sustained, but
can handle bursts of up to 10*bandwidth bytes.
Cells are now sent out at evenly-spaced intervals, with padding sent
out otherwise. Set Linkpadding=0 in the rc file to send cells as soon
as they're available (and to never send padding cells).
Added license/copyrights statements at the top of most files.
router->min and router->max have been merged into a single 'bandwidth'
value. We should make the routerinfo_t reflect this (want to do that,
Mat?)
As the bandwidth increases, and we want to stop sleeping more and more
frequently to send a single cell, cpu usage goes up. At 128kB/s we're
pretty much calling poll with a timeout of 1ms or even 0ms. The current
code takes a timeout of 0-9ms and makes it 10ms. prepare_for_poll()
handles everything that should have happened in the past, so as long as
our buffers don't get too full in that 10ms, we're ok.
Speaking of too full, if you run three servers at 100kB/s with -l debug,
it spends too much time printing debugging messages to be able to keep
up with the cells. The outbuf ultimately fills up and it kills that
connection. If you run with -l err, it works fine up through 500kB/s and
probably beyond. Down the road we'll want to teach it to recognize when
an outbuf is getting full, and back off.
svn:r50
2002-07-16 03:12:15 +02:00
|
|
|
|
2005-05-20 10:51:45 +02:00
|
|
|
char *alloc_http_authenticator(const char *authenticator);
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2003-09-16 21:36:19 +02:00
|
|
|
void assert_connection_ok(connection_t *conn, time_t now);
|
2004-10-13 22:05:57 +02:00
|
|
|
int connection_or_nonopen_was_started_here(connection_t *conn);
|
2003-09-16 21:36:19 +02:00
|
|
|
|
2005-12-14 21:40:40 +01:00
|
|
|
/********************************* connection_edge.c *************************/
|
2003-04-12 00:11:11 +02:00
|
|
|
|
2005-04-03 00:11:24 +02:00
|
|
|
#define connection_mark_unattached_ap(conn, endreason) \
|
2005-04-03 07:22:33 +02:00
|
|
|
_connection_mark_unattached_ap((conn), (endreason), __LINE__, _SHORT_FILE_)
|
2005-04-03 00:11:24 +02:00
|
|
|
|
|
|
|
void _connection_mark_unattached_ap(connection_t *conn, int endreason,
|
|
|
|
int line, const char *file);
|
2004-11-21 11:14:57 +01:00
|
|
|
int connection_edge_reached_eof(connection_t *conn);
|
2004-11-21 08:43:12 +01:00
|
|
|
int connection_edge_process_inbuf(connection_t *conn, int package_partial);
|
2004-02-29 01:11:37 +01:00
|
|
|
int connection_edge_destroy(uint16_t circ_id, connection_t *conn);
|
2005-12-14 21:40:40 +01:00
|
|
|
int connection_edge_end(connection_t *conn, char reason,
|
|
|
|
crypt_path_t *cpath_layer);
|
2005-03-01 23:42:31 +01:00
|
|
|
int connection_edge_end_errno(connection_t *conn, crypt_path_t *cpath_layer);
|
2003-04-12 00:11:11 +02:00
|
|
|
int connection_edge_finished_flushing(connection_t *conn);
|
2004-05-12 21:17:09 +02:00
|
|
|
int connection_edge_finished_connecting(connection_t *conn);
|
2003-04-12 00:11:11 +02:00
|
|
|
|
2004-04-05 09:41:31 +02:00
|
|
|
int connection_ap_handshake_send_begin(connection_t *ap_conn, circuit_t *circ);
|
2005-12-14 21:40:40 +01:00
|
|
|
int connection_ap_handshake_send_resolve(connection_t *ap_conn,
|
|
|
|
circuit_t *circ);
|
2004-04-03 01:54:48 +02:00
|
|
|
|
2004-04-01 00:02:13 +02:00
|
|
|
int connection_ap_make_bridge(char *address, uint16_t port);
|
2004-03-27 06:45:52 +01:00
|
|
|
void connection_ap_handshake_socks_reply(connection_t *conn, char *reply,
|
2005-03-17 13:38:37 +01:00
|
|
|
size_t replylen,
|
|
|
|
socks5_reply_status_t status);
|
2004-06-17 20:13:09 +02:00
|
|
|
void connection_ap_handshake_socks_resolved(connection_t *conn,
|
|
|
|
int answer_type,
|
2004-10-14 04:47:09 +02:00
|
|
|
size_t answer_len,
|
2005-09-02 22:37:31 +02:00
|
|
|
const char *answer,
|
|
|
|
int ttl);
|
2004-03-27 06:45:52 +01:00
|
|
|
|
2004-05-13 09:24:49 +02:00
|
|
|
int connection_exit_begin_conn(cell_t *cell, circuit_t *circ);
|
2004-06-17 20:13:09 +02:00
|
|
|
int connection_exit_begin_resolve(cell_t *cell, circuit_t *circ);
|
2003-10-22 09:55:44 +02:00
|
|
|
void connection_exit_connect(connection_t *conn);
|
2004-04-06 23:52:01 +02:00
|
|
|
int connection_edge_is_rendezvous_stream(connection_t *conn);
|
2003-12-06 07:01:42 +01:00
|
|
|
int connection_ap_can_use_exit(connection_t *conn, routerinfo_t *exit);
|
2004-01-20 10:21:46 +01:00
|
|
|
void connection_ap_expire_beginning(void);
|
2003-11-11 03:41:31 +01:00
|
|
|
void connection_ap_attach_pending(void);
|
2005-03-14 04:12:59 +01:00
|
|
|
int connection_ap_detach_retriable(connection_t *conn, circuit_t *circ);
|
2003-11-11 03:41:31 +01:00
|
|
|
|
2005-02-22 01:53:08 +01:00
|
|
|
void addressmap_init(void);
|
|
|
|
void addressmap_clean(time_t now);
|
2005-03-11 22:39:39 +01:00
|
|
|
void addressmap_clear_configured(void);
|
|
|
|
void addressmap_clear_transient(void);
|
2005-02-22 01:53:08 +01:00
|
|
|
void addressmap_free_all(void);
|
|
|
|
void addressmap_rewrite(char *address, size_t maxlen);
|
|
|
|
int addressmap_already_mapped(const char *address);
|
2005-12-14 21:40:40 +01:00
|
|
|
void addressmap_register(const char *address, char *new_address,
|
|
|
|
time_t expires);
|
2006-04-18 05:36:28 +02:00
|
|
|
int parse_virtual_addr_network(const char *val, int validate_only,
|
2006-04-18 05:51:18 +02:00
|
|
|
char **msg);
|
2005-02-22 01:53:08 +01:00
|
|
|
int client_dns_incr_failures(const char *address);
|
2005-08-15 05:35:15 +02:00
|
|
|
void client_dns_clear_failures(const char *address);
|
2005-12-14 21:40:40 +01:00
|
|
|
void client_dns_set_addressmap(const char *address, uint32_t val,
|
|
|
|
const char *exitname, int ttl);
|
2005-09-24 23:56:04 +02:00
|
|
|
int address_is_in_virtual_range(const char *addr);
|
2005-03-23 09:40:11 +01:00
|
|
|
const char *addressmap_register_virtual_address(int type, char *new_address);
|
2005-12-14 21:40:40 +01:00
|
|
|
void addressmap_get_mappings(smartlist_t *sl, time_t min_expires,
|
|
|
|
time_t max_expires);
|
2006-03-12 06:04:16 +01:00
|
|
|
int connection_ap_handshake_rewrite_and_attach(connection_t *conn,
|
|
|
|
circuit_t *circ);
|
2005-02-22 01:53:08 +01:00
|
|
|
|
2004-11-09 19:22:17 +01:00
|
|
|
void set_exit_redirects(smartlist_t *lst);
|
2004-11-30 04:44:10 +01:00
|
|
|
typedef enum hostname_type_t {
|
2005-06-07 20:01:46 +02:00
|
|
|
NORMAL_HOSTNAME, ONION_HOSTNAME, EXIT_HOSTNAME, BAD_HOSTNAME
|
2004-11-30 04:44:10 +01:00
|
|
|
} hostname_type_t;
|
|
|
|
hostname_type_t parse_extended_hostname(char *address);
|
2003-11-16 18:00:02 +01:00
|
|
|
|
Integrated onion proxy into or/
The 'or' process can now be told (by the global_role variable) what
roles this server should play -- connect to all ORs, listen for ORs,
listen for OPs, listen for APs, or any combination.
* everything in /src/op/ is now obsolete.
* connection_ap.c now handles all interactions with application proxies
* "port" is now or_port, op_port, ap_port. But routers are still always
referenced (say, in conn_get_by_addr_port()) by addr / or_port. We
should make routers.c actually read these new ports (currently I've
kludged it so op_port = or_port+10, ap_port=or_port+20)
* circuits currently know if they're at the beginning of the path because
circ->cpath is set. They use this instead for crypts (both ways),
if it's set.
* I still obey the "send a 0 back to the AP when you're ready" protocol,
but I think we should phase it out. I can simply not read from the AP
socket until I'm ready.
I need to do a lot of cleanup work here, but the code appears to work, so
now's a good time for a checkin.
svn:r22
2002-07-02 11:36:58 +02:00
|
|
|
/********************************* connection_or.c ***************************/
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2005-11-30 04:01:16 +01:00
|
|
|
void connection_or_remove_from_identity_map(connection_t *conn);
|
2005-12-05 20:15:27 +01:00
|
|
|
void connection_or_clear_identity_map(void);
|
2005-11-30 04:01:16 +01:00
|
|
|
connection_t *connection_or_get_by_identity_digest(const char *digest);
|
|
|
|
|
2004-11-21 11:14:57 +01:00
|
|
|
int connection_or_reached_eof(connection_t *conn);
|
Integrated onion proxy into or/
The 'or' process can now be told (by the global_role variable) what
roles this server should play -- connect to all ORs, listen for ORs,
listen for OPs, listen for APs, or any combination.
* everything in /src/op/ is now obsolete.
* connection_ap.c now handles all interactions with application proxies
* "port" is now or_port, op_port, ap_port. But routers are still always
referenced (say, in conn_get_by_addr_port()) by addr / or_port. We
should make routers.c actually read these new ports (currently I've
kludged it so op_port = or_port+10, ap_port=or_port+20)
* circuits currently know if they're at the beginning of the path because
circ->cpath is set. They use this instead for crypts (both ways),
if it's set.
* I still obey the "send a 0 back to the AP when you're ready" protocol,
but I think we should phase it out. I can simply not read from the AP
socket until I'm ready.
I need to do a lot of cleanup work here, but the code appears to work, so
now's a good time for a checkin.
svn:r22
2002-07-02 11:36:58 +02:00
|
|
|
int connection_or_process_inbuf(connection_t *conn);
|
|
|
|
int connection_or_finished_flushing(connection_t *conn);
|
2004-05-12 21:17:09 +02:00
|
|
|
int connection_or_finished_connecting(connection_t *conn);
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2004-07-02 11:29:01 +02:00
|
|
|
connection_t *connection_or_connect(uint32_t addr, uint16_t port,
|
|
|
|
const char *id_digest);
|
Integrated onion proxy into or/
The 'or' process can now be told (by the global_role variable) what
roles this server should play -- connect to all ORs, listen for ORs,
listen for OPs, listen for APs, or any combination.
* everything in /src/op/ is now obsolete.
* connection_ap.c now handles all interactions with application proxies
* "port" is now or_port, op_port, ap_port. But routers are still always
referenced (say, in conn_get_by_addr_port()) by addr / or_port. We
should make routers.c actually read these new ports (currently I've
kludged it so op_port = or_port+10, ap_port=or_port+20)
* circuits currently know if they're at the beginning of the path because
circ->cpath is set. They use this instead for crypts (both ways),
if it's set.
* I still obey the "send a 0 back to the AP when you're ready" protocol,
but I think we should phase it out. I can simply not read from the AP
socket until I'm ready.
I need to do a lot of cleanup work here, but the code appears to work, so
now's a good time for a checkin.
svn:r22
2002-07-02 11:36:58 +02:00
|
|
|
|
2003-09-30 20:45:55 +02:00
|
|
|
int connection_tls_start_handshake(connection_t *conn, int receiving);
|
|
|
|
int connection_tls_continue_handshake(connection_t *conn);
|
|
|
|
|
2003-12-23 08:45:31 +01:00
|
|
|
void connection_or_write_cell_to_buf(const cell_t *cell, connection_t *conn);
|
2006-01-05 22:23:03 +01:00
|
|
|
int connection_or_send_destroy(uint16_t circ_id, connection_t *conn,
|
|
|
|
int reason);
|
2004-10-13 03:13:37 +02:00
|
|
|
|
2004-11-03 02:32:26 +01:00
|
|
|
/********************************* control.c ***************************/
|
|
|
|
|
2004-11-03 19:33:07 +01:00
|
|
|
typedef enum circuit_status_event_t {
|
|
|
|
CIRC_EVENT_LAUNCHED = 0,
|
|
|
|
CIRC_EVENT_BUILT = 1,
|
|
|
|
CIRC_EVENT_EXTENDED = 2,
|
|
|
|
CIRC_EVENT_FAILED = 3,
|
|
|
|
CIRC_EVENT_CLOSED = 4,
|
|
|
|
} circuit_status_event_t;
|
|
|
|
|
|
|
|
typedef enum stream_status_event_t {
|
|
|
|
STREAM_EVENT_SENT_CONNECT = 0,
|
|
|
|
STREAM_EVENT_SENT_RESOLVE = 1,
|
|
|
|
STREAM_EVENT_SUCCEEDED = 2,
|
|
|
|
STREAM_EVENT_FAILED = 3,
|
2005-03-02 23:29:58 +01:00
|
|
|
STREAM_EVENT_CLOSED = 4,
|
2005-03-12 05:22:01 +01:00
|
|
|
STREAM_EVENT_NEW = 5,
|
2005-03-14 04:12:59 +01:00
|
|
|
STREAM_EVENT_NEW_RESOLVE = 6,
|
|
|
|
STREAM_EVENT_FAILED_RETRIABLE = 7
|
2004-11-03 19:33:07 +01:00
|
|
|
} stream_status_event_t;
|
|
|
|
|
|
|
|
typedef enum or_conn_status_event_t {
|
|
|
|
OR_CONN_EVENT_LAUNCHED = 0,
|
|
|
|
OR_CONN_EVENT_CONNECTED = 1,
|
|
|
|
OR_CONN_EVENT_FAILED = 2,
|
|
|
|
OR_CONN_EVENT_CLOSED = 3,
|
2006-03-08 23:29:08 +01:00
|
|
|
OR_CONN_EVENT_NEW = 4,
|
2004-11-03 19:33:07 +01:00
|
|
|
} or_conn_status_event_t;
|
|
|
|
|
2005-08-07 21:20:55 +02:00
|
|
|
void control_update_global_event_mask(void);
|
2005-07-13 07:14:42 +02:00
|
|
|
void control_adjust_event_log_severity(void);
|
|
|
|
|
2005-09-30 22:04:55 +02:00
|
|
|
/** Execute the statement <b>stmt</b>, which may log events concerning the
|
|
|
|
* connection <b>conn</b>. To prevent infinite loops, disable log messages
|
2006-03-18 10:29:05 +01:00
|
|
|
* being sent to controllers if <b>conn</b> is a control connection.
|
2005-09-30 22:04:55 +02:00
|
|
|
*
|
|
|
|
* Stmt must not contain any return or goto statements.
|
|
|
|
*/
|
2005-07-13 07:14:42 +02:00
|
|
|
#define CONN_LOG_PROTECT(conn, stmt) \
|
|
|
|
do { \
|
|
|
|
int _log_conn_is_control = (conn && conn->type == CONN_TYPE_CONTROL); \
|
|
|
|
if (_log_conn_is_control) \
|
|
|
|
disable_control_logging(); \
|
2005-07-13 19:24:55 +02:00
|
|
|
do {stmt;} while (0); \
|
2005-07-13 07:14:42 +02:00
|
|
|
if (_log_conn_is_control) \
|
|
|
|
enable_control_logging(); \
|
|
|
|
} while (0)
|
|
|
|
|
2005-09-30 22:04:55 +02:00
|
|
|
/** Log information about the connection <b>conn</b>, protecting it as with
|
|
|
|
* CONN_LOG_PROTECT. Example:
|
|
|
|
*
|
|
|
|
* LOG_FN_CONN(conn, (LOG_DEBUG, "Socket %d wants to write", conn->s));
|
|
|
|
**/
|
2005-07-13 07:14:42 +02:00
|
|
|
#define LOG_FN_CONN(conn, args) \
|
|
|
|
CONN_LOG_PROTECT(conn, log_fn args)
|
|
|
|
|
2004-11-03 02:32:26 +01:00
|
|
|
int connection_control_finished_flushing(connection_t *conn);
|
2004-11-21 11:14:57 +01:00
|
|
|
int connection_control_reached_eof(connection_t *conn);
|
2004-11-03 02:32:26 +01:00
|
|
|
int connection_control_process_inbuf(connection_t *conn);
|
|
|
|
|
2004-11-03 19:33:07 +01:00
|
|
|
int control_event_circuit_status(circuit_t *circ, circuit_status_event_t e);
|
|
|
|
int control_event_stream_status(connection_t *conn, stream_status_event_t e);
|
|
|
|
int control_event_or_conn_status(connection_t *conn, or_conn_status_event_t e);
|
2004-11-03 02:32:26 +01:00
|
|
|
int control_event_bandwidth_used(uint32_t n_read, uint32_t n_written);
|
2005-10-25 09:05:03 +02:00
|
|
|
void control_event_logmsg(int severity, unsigned int domain, const char *msg);
|
2005-03-02 23:29:58 +01:00
|
|
|
int control_event_descriptors_changed(smartlist_t *routers);
|
2005-12-14 21:40:40 +01:00
|
|
|
int control_event_address_mapped(const char *from, const char *to,
|
|
|
|
time_t expires);
|
|
|
|
int control_event_or_authdir_new_descriptor(const char *action,
|
|
|
|
const char *descriptor,
|
|
|
|
const char *msg);
|
2003-09-13 00:45:31 +02:00
|
|
|
|
2004-11-12 17:39:03 +01:00
|
|
|
int init_cookie_authentication(int enabled);
|
2004-12-13 19:32:29 +01:00
|
|
|
int decode_hashed_password(char *buf, const char *hashed);
|
2005-11-30 07:38:41 +01:00
|
|
|
void disable_control_logging(void);
|
|
|
|
void enable_control_logging(void);
|
2004-11-03 20:49:03 +01:00
|
|
|
|
2003-08-21 01:05:22 +02:00
|
|
|
/********************************* cpuworker.c *****************************/
|
|
|
|
|
|
|
|
void cpu_init(void);
|
2004-04-25 00:17:50 +02:00
|
|
|
void cpuworkers_rotate(void);
|
2003-08-21 01:05:22 +02:00
|
|
|
int connection_cpu_finished_flushing(connection_t *conn);
|
2004-11-21 11:14:57 +01:00
|
|
|
int connection_cpu_reached_eof(connection_t *conn);
|
2003-08-21 01:05:22 +02:00
|
|
|
int connection_cpu_process_inbuf(connection_t *conn);
|
2005-05-07 07:55:06 +02:00
|
|
|
int assign_to_cpuworker(connection_t *cpuworker, uint8_t question_type,
|
2003-08-21 01:05:22 +02:00
|
|
|
void *task);
|
|
|
|
|
2002-09-26 14:09:10 +02:00
|
|
|
/********************************* directory.c ***************************/
|
|
|
|
|
2004-05-13 01:48:57 +02:00
|
|
|
void directory_post_to_dirservers(uint8_t purpose, const char *payload,
|
2004-10-14 04:47:09 +02:00
|
|
|
size_t payload_len);
|
2005-01-03 21:51:24 +01:00
|
|
|
void directory_get_from_dirserver(uint8_t purpose, const char *resource,
|
|
|
|
int retry_if_no_servers);
|
2005-02-27 10:47:01 +01:00
|
|
|
void directory_initiate_command_router(routerinfo_t *router, uint8_t purpose,
|
2005-12-14 21:40:40 +01:00
|
|
|
int private_connection,
|
|
|
|
const char *resource,
|
|
|
|
const char *payload,
|
|
|
|
size_t payload_len);
|
2005-12-14 23:00:58 +01:00
|
|
|
void directory_initiate_command_routerstatus(routerstatus_t *status,
|
|
|
|
uint8_t purpose,
|
|
|
|
int private_connection,
|
|
|
|
const char *resource,
|
|
|
|
const char *payload,
|
|
|
|
size_t payload_len);
|
2005-02-27 10:47:01 +01:00
|
|
|
|
2005-02-24 11:56:55 +01:00
|
|
|
int parse_http_response(const char *headers, int *code, time_t *date,
|
2005-03-22 19:43:24 +01:00
|
|
|
int *compression, char **response);
|
2005-02-24 11:56:55 +01:00
|
|
|
|
2004-11-21 11:14:57 +01:00
|
|
|
int connection_dir_reached_eof(connection_t *conn);
|
2002-09-26 14:09:10 +02:00
|
|
|
int connection_dir_process_inbuf(connection_t *conn);
|
|
|
|
int connection_dir_finished_flushing(connection_t *conn);
|
2004-05-12 21:17:09 +02:00
|
|
|
int connection_dir_finished_connecting(connection_t *conn);
|
2005-09-12 09:36:26 +02:00
|
|
|
void connection_dir_request_failed(connection_t *conn);
|
2005-09-16 06:42:45 +02:00
|
|
|
int dir_split_resource_into_fingerprints(const char *resource,
|
2005-10-14 06:56:20 +02:00
|
|
|
smartlist_t *fp_out, int *compresseed_out,
|
2006-06-21 06:57:12 +02:00
|
|
|
int decode_hex, int sort_uniq);
|
2006-01-10 00:13:53 +01:00
|
|
|
char *directory_dump_request_log(void);
|
2002-09-26 14:09:10 +02:00
|
|
|
|
2004-05-12 21:49:48 +02:00
|
|
|
/********************************* dirserv.c ***************************/
|
2004-05-13 09:24:49 +02:00
|
|
|
|
2006-06-18 09:38:55 +02:00
|
|
|
int connection_dirserv_flushed_some(connection_t *conn);
|
2004-05-12 21:49:48 +02:00
|
|
|
int dirserv_add_own_fingerprint(const char *nickname, crypto_pk_env_t *pk);
|
|
|
|
int dirserv_parse_fingerprint_file(const char *fname);
|
2004-10-27 20:16:37 +02:00
|
|
|
void dirserv_free_fingerprint_list(void);
|
2004-09-29 00:24:56 +02:00
|
|
|
const char *dirserv_get_nickname_by_digest(const char *digest);
|
2005-08-26 23:28:16 +02:00
|
|
|
int dirserv_add_descriptor(const char *desc, const char **msg);
|
2005-08-13 04:20:00 +02:00
|
|
|
char *dirserver_getinfo_unregistered(const char *question);
|
2004-10-27 20:16:37 +02:00
|
|
|
void dirserv_free_descriptors(void);
|
2005-08-31 08:14:37 +02:00
|
|
|
int dirserv_thinks_router_is_blatantly_unreachable(routerinfo_t *router,
|
|
|
|
time_t now);
|
2005-05-02 23:22:31 +02:00
|
|
|
int list_server_status(smartlist_t *routers, char **router_status_out);
|
2004-12-24 03:17:32 +01:00
|
|
|
int dirserv_dump_directory_to_string(char **dir_out,
|
2006-06-13 13:11:19 +02:00
|
|
|
crypto_pk_env_t *private_key,
|
|
|
|
int complete);
|
2004-05-12 21:49:48 +02:00
|
|
|
void directory_set_dirty(void);
|
2006-06-18 09:38:55 +02:00
|
|
|
cached_dir_t *dirserv_get_directory(void);
|
2004-11-15 05:04:20 +01:00
|
|
|
size_t dirserv_get_runningrouters(const char **rr, int compress);
|
|
|
|
void dirserv_set_cached_directory(const char *directory, time_t when,
|
|
|
|
int is_running_routers);
|
2005-10-18 22:12:22 +02:00
|
|
|
void dirserv_set_cached_networkstatus_v2(const char *directory,
|
|
|
|
const char *identity,
|
2005-08-25 22:33:17 +02:00
|
|
|
time_t published);
|
2006-04-02 00:00:49 +02:00
|
|
|
void dirserv_get_networkstatus_v2(smartlist_t *result, const char *key);
|
2006-06-20 02:48:23 +02:00
|
|
|
void dirserv_get_networkstatus_v2_fingerprints(smartlist_t *result,
|
|
|
|
const char *key);
|
2006-06-18 09:38:55 +02:00
|
|
|
int dirserv_get_routerdesc_fingerprints(smartlist_t *fps_out, const char *key,
|
|
|
|
const char **msg);
|
2005-10-18 19:09:57 +02:00
|
|
|
int dirserv_get_routerdescs(smartlist_t *descs_out, const char *key,
|
|
|
|
const char **msg);
|
2005-04-06 23:09:47 +02:00
|
|
|
void dirserv_orconn_tls_done(const char *address,
|
|
|
|
uint16_t or_port,
|
|
|
|
const char *digest_rcvd,
|
2005-06-21 01:04:13 +02:00
|
|
|
const char *nickname,
|
|
|
|
int as_advertised);
|
2006-07-04 05:31:27 +02:00
|
|
|
void dirserv_test_reachability(int try_all);
|
2006-01-03 11:42:20 +01:00
|
|
|
int authdir_wants_to_reject_router(routerinfo_t *ri, const char **msg,
|
|
|
|
int complain);
|
2005-12-06 07:55:43 +01:00
|
|
|
int dirserv_would_reject_router(routerstatus_t *rs);
|
2005-02-11 00:18:39 +01:00
|
|
|
void dirserv_free_all(void);
|
2006-06-18 09:38:55 +02:00
|
|
|
void cached_dir_decref(cached_dir_t *d);
|
2004-05-12 21:49:48 +02:00
|
|
|
|
major overhaul: dns slave subsystem, topics
on startup, it forks off a master dns handler, which forks off dns
slaves (like the apache model). slaves as spawned as load increases,
and then reused. excess slaves are not ever killed, currently.
implemented topics. each topic has a receive window in each direction
at each edge of the circuit, and sends sendme's at the data level, as
per before. each circuit also has receive windows in each direction at
each hop; an edge sends a circuit-level sendme as soon as enough data
cells have arrived (regardless of whether the data cells were flushed
to the exit conns). removed the 'connected' cell type, since it's now
a topic command within data cells.
at the edge of the circuit, there can be multiple connections associated
with a single circuit. you find them via the linked list conn->next_topic.
currently each new ap connection starts its own circuit, so we ought
to see comparable performance to what we had before. but that's only
because i haven't written the code to reattach to old circuits. please
try to break it as-is, and then i'll make it reuse the same circuit and
we'll try to break that.
svn:r152
2003-01-26 10:02:24 +01:00
|
|
|
/********************************* dns.c ***************************/
|
|
|
|
|
2003-06-25 09:19:30 +02:00
|
|
|
void dns_init(void);
|
2005-02-11 02:26:47 +01:00
|
|
|
void dns_free_all(void);
|
2006-06-03 23:41:14 +02:00
|
|
|
uint32_t dns_clip_ttl(uint32_t ttl);
|
major overhaul: dns slave subsystem, topics
on startup, it forks off a master dns handler, which forks off dns
slaves (like the apache model). slaves as spawned as load increases,
and then reused. excess slaves are not ever killed, currently.
implemented topics. each topic has a receive window in each direction
at each edge of the circuit, and sends sendme's at the data level, as
per before. each circuit also has receive windows in each direction at
each hop; an edge sends a circuit-level sendme as soon as enough data
cells have arrived (regardless of whether the data cells were flushed
to the exit conns). removed the 'connected' cell type, since it's now
a topic command within data cells.
at the edge of the circuit, there can be multiple connections associated
with a single circuit. you find them via the linked list conn->next_topic.
currently each new ap connection starts its own circuit, so we ought
to see comparable performance to what we had before. but that's only
because i haven't written the code to reattach to old circuits. please
try to break it as-is, and then i'll make it reuse the same circuit and
we'll try to break that.
svn:r152
2003-01-26 10:02:24 +01:00
|
|
|
int connection_dns_finished_flushing(connection_t *conn);
|
2004-11-21 11:14:57 +01:00
|
|
|
int connection_dns_reached_eof(connection_t *conn);
|
major overhaul: dns slave subsystem, topics
on startup, it forks off a master dns handler, which forks off dns
slaves (like the apache model). slaves as spawned as load increases,
and then reused. excess slaves are not ever killed, currently.
implemented topics. each topic has a receive window in each direction
at each edge of the circuit, and sends sendme's at the data level, as
per before. each circuit also has receive windows in each direction at
each hop; an edge sends a circuit-level sendme as soon as enough data
cells have arrived (regardless of whether the data cells were flushed
to the exit conns). removed the 'connected' cell type, since it's now
a topic command within data cells.
at the edge of the circuit, there can be multiple connections associated
with a single circuit. you find them via the linked list conn->next_topic.
currently each new ap connection starts its own circuit, so we ought
to see comparable performance to what we had before. but that's only
because i haven't written the code to reattach to old circuits. please
try to break it as-is, and then i'll make it reuse the same circuit and
we'll try to break that.
svn:r152
2003-01-26 10:02:24 +01:00
|
|
|
int connection_dns_process_inbuf(connection_t *conn);
|
2004-06-07 22:00:30 +02:00
|
|
|
void dnsworkers_rotate(void);
|
2004-02-28 23:23:44 +01:00
|
|
|
void connection_dns_remove(connection_t *conn);
|
2004-03-28 06:54:36 +02:00
|
|
|
void assert_connection_edge_not_dns_pending(connection_t *conn);
|
2004-04-09 11:39:42 +02:00
|
|
|
void assert_all_pending_dns_resolves_ok(void);
|
2004-02-28 23:23:44 +01:00
|
|
|
void dns_cancel_pending_resolve(char *question);
|
2003-02-14 08:53:55 +01:00
|
|
|
int dns_resolve(connection_t *exitconn);
|
major overhaul: dns slave subsystem, topics
on startup, it forks off a master dns handler, which forks off dns
slaves (like the apache model). slaves as spawned as load increases,
and then reused. excess slaves are not ever killed, currently.
implemented topics. each topic has a receive window in each direction
at each edge of the circuit, and sends sendme's at the data level, as
per before. each circuit also has receive windows in each direction at
each hop; an edge sends a circuit-level sendme as soon as enough data
cells have arrived (regardless of whether the data cells were flushed
to the exit conns). removed the 'connected' cell type, since it's now
a topic command within data cells.
at the edge of the circuit, there can be multiple connections associated
with a single circuit. you find them via the linked list conn->next_topic.
currently each new ap connection starts its own circuit, so we ought
to see comparable performance to what we had before. but that's only
because i haven't written the code to reattach to old circuits. please
try to break it as-is, and then i'll make it reuse the same circuit and
we'll try to break that.
svn:r152
2003-01-26 10:02:24 +01:00
|
|
|
|
2004-10-31 21:28:41 +01:00
|
|
|
/********************************* hibernate.c **********************/
|
|
|
|
|
2004-11-22 22:56:51 +01:00
|
|
|
int accounting_parse_options(or_options_t *options, int validate_only);
|
2004-11-15 05:01:31 +01:00
|
|
|
int accounting_is_enabled(or_options_t *options);
|
2004-11-04 23:33:06 +01:00
|
|
|
void configure_accounting(time_t now);
|
|
|
|
void accounting_run_housekeeping(time_t now);
|
|
|
|
void accounting_add_bytes(size_t n_read, size_t n_written, int seconds);
|
2004-11-14 23:21:23 +01:00
|
|
|
int accounting_record_bandwidth_usage(time_t now);
|
2004-10-31 21:28:41 +01:00
|
|
|
void hibernate_begin_shutdown(void);
|
|
|
|
int we_are_hibernating(void);
|
|
|
|
void consider_hibernation(time_t now);
|
2005-07-22 16:55:09 +02:00
|
|
|
int accounting_getinfo_helper(const char *question, char **answer);
|
2005-08-07 23:24:00 +02:00
|
|
|
void accounting_set_bandwidth_usage_from_state(or_state_t *state);
|
2005-07-22 16:55:09 +02:00
|
|
|
|
2002-06-27 00:45:49 +02:00
|
|
|
/********************************* main.c ***************************/
|
|
|
|
|
|
|
|
int connection_add(connection_t *conn);
|
|
|
|
int connection_remove(connection_t *conn);
|
2004-06-02 00:09:58 +02:00
|
|
|
int connection_in_array(connection_t *conn);
|
2005-01-12 07:42:32 +01:00
|
|
|
void add_connection_to_closeable_list(connection_t *conn);
|
2005-01-31 01:33:32 +01:00
|
|
|
int connection_is_on_closeable_list(connection_t *conn);
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2003-09-30 21:27:54 +02:00
|
|
|
void get_connection_array(connection_t ***array, int *n);
|
|
|
|
|
2002-06-27 00:45:49 +02:00
|
|
|
void connection_watch_events(connection_t *conn, short events);
|
2003-09-07 12:24:40 +02:00
|
|
|
int connection_is_reading(connection_t *conn);
|
Implemented link padding and receiver token buckets
Each socket reads at most 'bandwidth' bytes per second sustained, but
can handle bursts of up to 10*bandwidth bytes.
Cells are now sent out at evenly-spaced intervals, with padding sent
out otherwise. Set Linkpadding=0 in the rc file to send cells as soon
as they're available (and to never send padding cells).
Added license/copyrights statements at the top of most files.
router->min and router->max have been merged into a single 'bandwidth'
value. We should make the routerinfo_t reflect this (want to do that,
Mat?)
As the bandwidth increases, and we want to stop sleeping more and more
frequently to send a single cell, cpu usage goes up. At 128kB/s we're
pretty much calling poll with a timeout of 1ms or even 0ms. The current
code takes a timeout of 0-9ms and makes it 10ms. prepare_for_poll()
handles everything that should have happened in the past, so as long as
our buffers don't get too full in that 10ms, we're ok.
Speaking of too full, if you run three servers at 100kB/s with -l debug,
it spends too much time printing debugging messages to be able to keep
up with the cells. The outbuf ultimately fills up and it kills that
connection. If you run with -l err, it works fine up through 500kB/s and
probably beyond. Down the road we'll want to teach it to recognize when
an outbuf is getting full, and back off.
svn:r50
2002-07-16 03:12:15 +02:00
|
|
|
void connection_stop_reading(connection_t *conn);
|
|
|
|
void connection_start_reading(connection_t *conn);
|
2004-03-03 06:08:01 +01:00
|
|
|
|
2004-02-27 05:42:14 +01:00
|
|
|
int connection_is_writing(connection_t *conn);
|
2002-07-18 08:37:58 +02:00
|
|
|
void connection_stop_writing(connection_t *conn);
|
|
|
|
void connection_start_writing(connection_t *conn);
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2005-01-07 16:57:57 +01:00
|
|
|
void directory_all_unreachable(time_t now);
|
2005-09-15 07:19:38 +02:00
|
|
|
void directory_info_has_arrived(time_t now, int from_cache);
|
2004-04-01 00:02:13 +02:00
|
|
|
|
2005-01-05 07:40:47 +01:00
|
|
|
int control_signal_act(int the_signal);
|
2004-08-08 09:25:45 +02:00
|
|
|
void handle_signals(int is_parent);
|
2004-07-23 00:15:36 +02:00
|
|
|
void tor_cleanup(void);
|
2005-05-03 05:51:20 +02:00
|
|
|
void tor_free_all(int postfork);
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2004-11-02 04:02:17 +01:00
|
|
|
int tor_main(int argc, char *argv[]);
|
|
|
|
|
2002-06-27 00:45:49 +02:00
|
|
|
/********************************* onion.c ***************************/
|
|
|
|
|
2002-11-27 05:08:20 +01:00
|
|
|
int onion_pending_add(circuit_t *circ);
|
2003-08-21 01:05:22 +02:00
|
|
|
circuit_t *onion_next_task(void);
|
2002-11-27 05:08:20 +01:00
|
|
|
void onion_pending_remove(circuit_t *circ);
|
2002-06-27 00:45:49 +02:00
|
|
|
|
2003-05-05 06:27:00 +02:00
|
|
|
int onion_skin_create(crypto_pk_env_t *router_key,
|
|
|
|
crypto_dh_env_t **handshake_state_out,
|
2003-12-16 09:21:58 +01:00
|
|
|
char *onion_skin_out);
|
2003-05-05 06:27:00 +02:00
|
|
|
|
2005-05-03 00:35:18 +02:00
|
|
|
int onion_skin_server_handshake(const char *onion_skin,
|
2003-05-05 06:27:00 +02:00
|
|
|
crypto_pk_env_t *private_key,
|
2004-04-25 00:17:50 +02:00
|
|
|
crypto_pk_env_t *prev_private_key,
|
2003-12-16 09:21:58 +01:00
|
|
|
char *handshake_reply_out,
|
2003-05-05 06:27:00 +02:00
|
|
|
char *key_out,
|
2004-10-14 04:47:09 +02:00
|
|
|
size_t key_out_len);
|
2003-05-05 06:27:00 +02:00
|
|
|
|
|
|
|
int onion_skin_client_handshake(crypto_dh_env_t *handshake_state,
|
2005-05-03 00:35:18 +02:00
|
|
|
const char *handshake_reply,
|
|
|
|
char *key_out,
|
|
|
|
size_t key_out_len);
|
|
|
|
|
|
|
|
int fast_server_handshake(const char *key_in,
|
|
|
|
char *handshake_reply_out,
|
|
|
|
char *key_out,
|
|
|
|
size_t key_out_len);
|
|
|
|
|
|
|
|
int fast_client_handshake(const char *handshake_state,
|
|
|
|
const char *handshake_reply_out,
|
|
|
|
char *key_out,
|
|
|
|
size_t key_out_len);
|
2003-05-05 06:27:00 +02:00
|
|
|
|
2005-02-11 02:26:47 +01:00
|
|
|
void clear_pending_onions(void);
|
|
|
|
|
2006-03-27 04:25:34 +02:00
|
|
|
/********************************* policies.c ************************/
|
|
|
|
|
|
|
|
typedef enum {
|
|
|
|
ADDR_POLICY_ACCEPTED=0,
|
|
|
|
ADDR_POLICY_REJECTED=-1,
|
|
|
|
ADDR_POLICY_PROBABLY_ACCEPTED=1,
|
|
|
|
ADDR_POLICY_PROBABLY_REJECTED=2
|
|
|
|
} addr_policy_result_t;
|
|
|
|
|
|
|
|
int firewall_is_fascist_or(void);
|
|
|
|
int fascist_firewall_allows_address_or(uint32_t addr, uint16_t port);
|
|
|
|
int fascist_firewall_allows_address_dir(uint32_t addr, uint16_t port);
|
|
|
|
int dir_policy_permits_address(uint32_t addr);
|
|
|
|
int socks_policy_permits_address(uint32_t addr);
|
|
|
|
int authdir_policy_permits_address(uint32_t addr, uint16_t port);
|
|
|
|
int authdir_policy_valid_address(uint32_t addr, uint16_t port);
|
|
|
|
|
|
|
|
int validate_addr_policies(or_options_t *options, char **msg);
|
|
|
|
void policies_parse_from_options(or_options_t *options);
|
|
|
|
|
|
|
|
int cmp_addr_policies(addr_policy_t *a, addr_policy_t *b);
|
|
|
|
addr_policy_result_t compare_addr_to_addr_policy(uint32_t addr,
|
|
|
|
uint16_t port, addr_policy_t *policy);
|
|
|
|
int policies_parse_exit_policy(config_line_t *cfg,
|
|
|
|
addr_policy_t **dest,
|
|
|
|
int rejectprivate);
|
|
|
|
int exit_policy_is_general_exit(addr_policy_t *policy);
|
2006-06-13 11:16:09 +02:00
|
|
|
int policies_getinfo_helper(const char *question, char **answer);
|
2006-03-27 04:25:34 +02:00
|
|
|
|
|
|
|
void addr_policy_free(addr_policy_t *p);
|
|
|
|
void policies_free_all(void);
|
|
|
|
|
2004-05-12 21:49:48 +02:00
|
|
|
/********************************* relay.c ***************************/
|
2004-05-10 19:30:51 +02:00
|
|
|
|
2005-12-31 12:52:13 +01:00
|
|
|
extern uint64_t stats_n_relay_cells_relayed;
|
|
|
|
extern uint64_t stats_n_relay_cells_delivered;
|
2003-09-27 23:30:10 +02:00
|
|
|
|
2004-05-12 21:49:48 +02:00
|
|
|
int circuit_receive_relay_cell(cell_t *cell, circuit_t *circ,
|
|
|
|
int cell_direction);
|
2003-09-27 23:30:10 +02:00
|
|
|
|
2004-05-13 09:24:49 +02:00
|
|
|
void relay_header_pack(char *dest, const relay_header_t *src);
|
|
|
|
void relay_header_unpack(relay_header_t *dest, const char *src);
|
|
|
|
int connection_edge_send_command(connection_t *fromconn, circuit_t *circ,
|
|
|
|
int relay_command, const char *payload,
|
2005-12-14 21:40:40 +01:00
|
|
|
size_t payload_len,
|
|
|
|
crypt_path_t *cpath_layer);
|
2004-11-21 08:43:12 +01:00
|
|
|
int connection_edge_package_raw_inbuf(connection_t *conn, int package_partial);
|
2004-05-13 09:24:49 +02:00
|
|
|
void connection_edge_consider_sending_sendme(connection_t *conn);
|
2005-03-22 20:36:38 +01:00
|
|
|
socks5_reply_status_t connection_edge_end_reason_socks5_response(int reason);
|
2005-03-01 23:42:31 +01:00
|
|
|
int errno_to_end_reason(int e);
|
2004-05-13 09:24:49 +02:00
|
|
|
|
|
|
|
extern uint64_t stats_n_data_cells_packaged;
|
|
|
|
extern uint64_t stats_n_data_bytes_packaged;
|
|
|
|
extern uint64_t stats_n_data_cells_received;
|
|
|
|
extern uint64_t stats_n_data_bytes_received;
|
|
|
|
|
2004-03-20 02:48:05 +01:00
|
|
|
/********************************* rephist.c ***************************/
|
|
|
|
|
|
|
|
void rep_hist_init(void);
|
|
|
|
void rep_hist_note_connect_failed(const char* nickname, time_t when);
|
|
|
|
void rep_hist_note_connect_succeeded(const char* nickname, time_t when);
|
2004-03-20 05:59:29 +01:00
|
|
|
void rep_hist_note_disconnect(const char* nickname, time_t when);
|
2004-03-20 02:48:05 +01:00
|
|
|
void rep_hist_note_connection_died(const char* nickname, time_t when);
|
|
|
|
void rep_hist_note_extend_succeeded(const char *from_name,
|
2004-04-03 00:23:15 +02:00
|
|
|
const char *to_name);
|
2004-03-20 02:48:05 +01:00
|
|
|
void rep_hist_note_extend_failed(const char *from_name, const char *to_name);
|
2004-03-20 05:59:29 +01:00
|
|
|
void rep_hist_dump_stats(time_t now, int severity);
|
2004-07-20 22:57:46 +02:00
|
|
|
void rep_hist_note_bytes_read(int num_bytes, time_t when);
|
|
|
|
void rep_hist_note_bytes_written(int num_bytes, time_t when);
|
2004-08-07 04:46:16 +02:00
|
|
|
int rep_hist_bandwidth_assess(void);
|
|
|
|
char *rep_hist_get_bandwidth_lines(void);
|
2006-05-30 08:19:06 +02:00
|
|
|
void rep_hist_update_state(or_state_t *state);
|
|
|
|
int rep_hist_load_state(or_state_t *state, char **err);
|
2004-11-21 06:14:46 +01:00
|
|
|
void rep_history_clean(time_t before);
|
Introduce a notion of 'internal' circs, which are chosen without regard
to the exit policy of the last hop. Intro and rendezvous circs must
be internal circs, to avoid leaking information. Resolve and connect
streams can use internal circs if they want.
New circuit pooling algorithm: make sure to have enough circs around
to satisfy any predicted ports, and also make sure to have 2 internal
circs around if we've required internal circs lately (with high uptime
if we've seen that lately).
Split NewCircuitPeriod config option into NewCircuitPeriod (30 secs),
which describes how often we retry making new circuits if current ones
are dirty, and MaxCircuitDirtiness (10 mins), which describes how long
we're willing to make use of an already-dirty circuit.
Once rendezvous circuits are established, keep using the same circuit as
long as you attach a new stream to it at least every 10 minutes. (So web
browsing doesn't require you to build new rend circs every 30 seconds.)
Cannibalize GENERAL circs to be C_REND, C_INTRO, S_INTRO, and S_REND
circ as necessary, if there are any completed ones lying around when
we try to launch one.
Re-instate the ifdef's to use version-0 style introduce cells, since
there was yet another bug in handling version-1 style. We'll try switching
over again after 0.0.9 is obsolete.
Bugfix: when choosing an exit node for a new non-internal circ, don't take
into account whether it'll be useful for any pending x.onion addresses --
it won't.
Bugfix: we weren't actually publishing the hidden service descriptor when
it became dirty. So we only published it every 20 minutes or so, which
means when you first start your Tor, the hidden service will seem broken.
svn:r3360
2005-01-17 19:13:09 +01:00
|
|
|
|
2004-12-05 08:10:08 +01:00
|
|
|
void rep_hist_note_used_port(uint16_t port, time_t now);
|
2004-12-07 16:29:54 +01:00
|
|
|
smartlist_t *rep_hist_get_predicted_ports(time_t now);
|
Introduce a notion of 'internal' circs, which are chosen without regard
to the exit policy of the last hop. Intro and rendezvous circs must
be internal circs, to avoid leaking information. Resolve and connect
streams can use internal circs if they want.
New circuit pooling algorithm: make sure to have enough circs around
to satisfy any predicted ports, and also make sure to have 2 internal
circs around if we've required internal circs lately (with high uptime
if we've seen that lately).
Split NewCircuitPeriod config option into NewCircuitPeriod (30 secs),
which describes how often we retry making new circuits if current ones
are dirty, and MaxCircuitDirtiness (10 mins), which describes how long
we're willing to make use of an already-dirty circuit.
Once rendezvous circuits are established, keep using the same circuit as
long as you attach a new stream to it at least every 10 minutes. (So web
browsing doesn't require you to build new rend circs every 30 seconds.)
Cannibalize GENERAL circs to be C_REND, C_INTRO, S_INTRO, and S_REND
circ as necessary, if there are any completed ones lying around when
we try to launch one.
Re-instate the ifdef's to use version-0 style introduce cells, since
there was yet another bug in handling version-1 style. We'll try switching
over again after 0.0.9 is obsolete.
Bugfix: when choosing an exit node for a new non-internal circ, don't take
into account whether it'll be useful for any pending x.onion addresses --
it won't.
Bugfix: we weren't actually publishing the hidden service descriptor when
it became dirty. So we only published it every 20 minutes or so, which
means when you first start your Tor, the hidden service will seem broken.
svn:r3360
2005-01-17 19:13:09 +01:00
|
|
|
void rep_hist_note_used_resolve(time_t now);
|
2005-12-14 21:40:40 +01:00
|
|
|
void rep_hist_note_used_internal(time_t now, int need_uptime,
|
|
|
|
int need_capacity);
|
|
|
|
int rep_hist_get_predicted_internal(time_t now, int *need_uptime,
|
|
|
|
int *need_capacity);
|
2004-03-20 02:48:05 +01:00
|
|
|
|
2006-06-09 00:36:13 +02:00
|
|
|
int rep_hist_circbuilding_dormant(time_t now);
|
2005-12-24 00:56:42 +01:00
|
|
|
|
2005-02-11 00:18:39 +01:00
|
|
|
void rep_hist_free_all(void);
|
|
|
|
|
2004-04-03 00:23:15 +02:00
|
|
|
/********************************* rendclient.c ***************************/
|
|
|
|
|
2004-05-13 09:24:49 +02:00
|
|
|
void rend_client_introcirc_has_opened(circuit_t *circ);
|
|
|
|
void rend_client_rendcirc_has_opened(circuit_t *circ);
|
2005-12-14 21:40:40 +01:00
|
|
|
int rend_client_introduction_acked(circuit_t *circ, const char *request,
|
|
|
|
size_t request_len);
|
2004-05-05 23:32:43 +02:00
|
|
|
void rend_client_refetch_renddesc(const char *query);
|
2005-12-14 21:40:40 +01:00
|
|
|
int rend_client_remove_intro_point(extend_info_t *failed_intro,
|
|
|
|
const char *query);
|
|
|
|
int rend_client_rendezvous_acked(circuit_t *circ, const char *request,
|
|
|
|
size_t request_len);
|
|
|
|
int rend_client_receive_rendezvous(circuit_t *circ, const char *request,
|
|
|
|
size_t request_len);
|
2005-06-29 23:46:55 +02:00
|
|
|
void rend_client_desc_here(const char *query);
|
2004-04-03 00:23:15 +02:00
|
|
|
|
2005-06-29 23:46:55 +02:00
|
|
|
extend_info_t *rend_client_get_random_intro(const char *query);
|
2004-04-03 03:59:53 +02:00
|
|
|
|
2004-04-05 09:41:31 +02:00
|
|
|
int rend_client_send_introduction(circuit_t *introcirc, circuit_t *rendcirc);
|
2004-04-03 06:22:22 +02:00
|
|
|
|
2004-03-30 21:52:42 +02:00
|
|
|
/********************************* rendcommon.c ***************************/
|
|
|
|
|
2005-07-14 10:43:19 +02:00
|
|
|
/** Information used to connect to a hidden service. */
|
2004-03-31 04:07:38 +02:00
|
|
|
typedef struct rend_service_descriptor_t {
|
2005-06-29 23:46:55 +02:00
|
|
|
crypto_pk_env_t *pk; /**< This service's public key. */
|
2005-07-14 10:43:19 +02:00
|
|
|
int version; /**< 0 or 1. */
|
2005-06-29 23:46:55 +02:00
|
|
|
time_t timestamp; /**< Time when the descriptor was generated. */
|
2005-07-14 10:43:19 +02:00
|
|
|
uint16_t protocols; /**< Bitmask: which rendezvous protocols are supported?
|
2005-06-29 23:46:55 +02:00
|
|
|
* (We allow bits '0', '1', and '2' to be set.) */
|
|
|
|
int n_intro_points; /**< Number of introduction points. */
|
|
|
|
/** Array of n_intro_points elements for this service's introduction points'
|
|
|
|
* nicknames. Elements are removed from this array if introduction attempts
|
|
|
|
* fail. */
|
2004-03-31 04:07:38 +02:00
|
|
|
char **intro_points;
|
2005-06-29 23:46:55 +02:00
|
|
|
/** Array of n_intro_points elements for this service's introduction points'
|
|
|
|
* extend_infos, or NULL if this descriptor is V0. Elements are removed
|
|
|
|
* from this array if introduction attempts fail. If this array is present,
|
|
|
|
* its elements correspond to the elements of intro_points. */
|
|
|
|
extend_info_t **intro_point_extend_info;
|
2004-03-31 04:07:38 +02:00
|
|
|
} rend_service_descriptor_t;
|
|
|
|
|
2004-05-12 22:58:27 +02:00
|
|
|
int rend_cmp_service_ids(const char *one, const char *two);
|
|
|
|
|
2004-10-14 04:47:09 +02:00
|
|
|
void rend_process_relay_cell(circuit_t *circ, int command, size_t length,
|
2004-04-03 05:37:11 +02:00
|
|
|
const char *payload);
|
|
|
|
|
2004-03-31 04:07:38 +02:00
|
|
|
void rend_service_descriptor_free(rend_service_descriptor_t *desc);
|
|
|
|
int rend_encode_service_descriptor(rend_service_descriptor_t *desc,
|
2005-06-29 23:46:55 +02:00
|
|
|
int version,
|
2004-03-31 04:07:38 +02:00
|
|
|
crypto_pk_env_t *key,
|
|
|
|
char **str_out,
|
2004-10-14 04:47:09 +02:00
|
|
|
size_t *len_out);
|
2005-12-14 21:40:40 +01:00
|
|
|
rend_service_descriptor_t *rend_parse_service_descriptor(const char *str,
|
|
|
|
size_t len);
|
2004-03-31 05:42:56 +02:00
|
|
|
int rend_get_service_id(crypto_pk_env_t *pk, char *out);
|
|
|
|
|
2005-10-06 06:33:40 +02:00
|
|
|
/** A cached rendezvous descriptor. */
|
2004-04-08 00:00:54 +02:00
|
|
|
typedef struct rend_cache_entry_t {
|
2005-10-06 06:33:40 +02:00
|
|
|
size_t len; /** Length of <b>desc</b> */
|
|
|
|
time_t received; /** When was the descriptor received? */
|
|
|
|
char *desc; /** Service descriptor */
|
2004-04-08 00:00:54 +02:00
|
|
|
rend_service_descriptor_t *parsed; /* Parsed value of 'desc' */
|
|
|
|
} rend_cache_entry_t;
|
|
|
|
|
2004-03-31 06:10:10 +02:00
|
|
|
void rend_cache_init(void);
|
|
|
|
void rend_cache_clean(void);
|
2005-02-28 23:38:00 +01:00
|
|
|
void rend_cache_free_all(void);
|
2004-05-05 23:32:43 +02:00
|
|
|
int rend_valid_service_id(const char *query);
|
2005-12-14 21:40:40 +01:00
|
|
|
int rend_cache_lookup_desc(const char *query, int version, const char **desc,
|
|
|
|
size_t *desc_len);
|
|
|
|
int rend_cache_lookup_entry(const char *query, int version,
|
|
|
|
rend_cache_entry_t **entry_out);
|
2004-10-14 04:47:09 +02:00
|
|
|
int rend_cache_store(const char *desc, size_t desc_len);
|
2004-03-31 04:07:38 +02:00
|
|
|
|
2004-03-31 23:35:23 +02:00
|
|
|
/********************************* rendservice.c ***************************/
|
|
|
|
|
2005-08-13 02:22:07 +02:00
|
|
|
int num_rend_services(void);
|
2004-11-09 00:12:40 +01:00
|
|
|
int rend_config_services(or_options_t *options, int validate_only);
|
2004-04-13 19:16:47 +02:00
|
|
|
int rend_service_load_keys(void);
|
2004-04-13 07:20:52 +02:00
|
|
|
void rend_services_init(void);
|
2004-04-13 19:16:47 +02:00
|
|
|
void rend_services_introduce(void);
|
2004-11-15 10:05:54 +01:00
|
|
|
void rend_consider_services_upload(time_t now);
|
2004-03-31 23:35:23 +02:00
|
|
|
|
2004-05-13 09:24:49 +02:00
|
|
|
void rend_service_intro_has_opened(circuit_t *circuit);
|
2005-12-14 21:40:40 +01:00
|
|
|
int rend_service_intro_established(circuit_t *circuit, const char *request,
|
|
|
|
size_t request_len);
|
2004-05-13 09:24:49 +02:00
|
|
|
void rend_service_rendezvous_has_opened(circuit_t *circuit);
|
2005-12-14 21:40:40 +01:00
|
|
|
int rend_service_introduce(circuit_t *circuit, const char *request,
|
|
|
|
size_t request_len);
|
2004-04-14 23:40:50 +02:00
|
|
|
void rend_service_relaunch_rendezvous(circuit_t *oldcirc);
|
2004-04-07 00:05:49 +02:00
|
|
|
int rend_service_set_connection_addr_port(connection_t *conn, circuit_t *circ);
|
2004-04-09 22:02:16 +02:00
|
|
|
void rend_service_dump_stats(int severity);
|
2005-02-11 00:18:39 +01:00
|
|
|
void rend_service_free_all(void);
|
2004-04-03 05:37:11 +02:00
|
|
|
|
|
|
|
/********************************* rendmid.c *******************************/
|
2005-12-14 21:40:40 +01:00
|
|
|
int rend_mid_establish_intro(circuit_t *circ, const char *request,
|
|
|
|
size_t request_len);
|
|
|
|
int rend_mid_introduce(circuit_t *circ, const char *request,
|
|
|
|
size_t request_len);
|
|
|
|
int rend_mid_establish_rendezvous(circuit_t *circ, const char *request,
|
|
|
|
size_t request_len);
|
|
|
|
int rend_mid_rendezvous(circuit_t *circ, const char *request,
|
|
|
|
size_t request_len);
|
2004-04-02 00:21:01 +02:00
|
|
|
|
2004-05-12 21:49:48 +02:00
|
|
|
/********************************* router.c ***************************/
|
|
|
|
|
|
|
|
void set_onion_key(crypto_pk_env_t *k);
|
|
|
|
crypto_pk_env_t *get_onion_key(void);
|
|
|
|
time_t get_onion_key_set_at(void);
|
|
|
|
void set_identity_key(crypto_pk_env_t *k);
|
|
|
|
crypto_pk_env_t *get_identity_key(void);
|
2004-11-21 05:19:04 +01:00
|
|
|
int identity_key_is_set(void);
|
2004-06-05 03:50:35 +02:00
|
|
|
void dup_onion_keys(crypto_pk_env_t **key, crypto_pk_env_t **last);
|
2004-05-12 21:49:48 +02:00
|
|
|
void rotate_onion_key(void);
|
2005-02-27 10:47:01 +01:00
|
|
|
crypto_pk_env_t *init_key_from_file(const char *fname);
|
|
|
|
int init_keys(void);
|
|
|
|
|
2005-03-31 21:26:33 +02:00
|
|
|
int check_whether_orport_reachable(void);
|
|
|
|
int check_whether_dirport_reachable(void);
|
2005-02-27 10:47:01 +01:00
|
|
|
void consider_testing_reachability(void);
|
|
|
|
void router_orport_found_reachable(void);
|
|
|
|
void router_dirport_found_reachable(void);
|
|
|
|
void server_has_changed_ip(void);
|
2006-06-05 00:42:13 +02:00
|
|
|
void consider_publishable_server(int force);
|
2005-02-27 10:47:01 +01:00
|
|
|
|
|
|
|
int authdir_mode(or_options_t *options);
|
|
|
|
int clique_mode(or_options_t *options);
|
|
|
|
int server_mode(or_options_t *options);
|
|
|
|
int advertised_server_mode(void);
|
|
|
|
int proxy_mode(or_options_t *options);
|
2004-05-12 21:49:48 +02:00
|
|
|
|
2004-07-20 21:45:29 +02:00
|
|
|
int router_is_clique_mode(routerinfo_t *router);
|
2004-11-13 17:53:48 +01:00
|
|
|
void router_upload_dir_desc_to_dirservers(int force);
|
2005-08-22 05:10:53 +02:00
|
|
|
void mark_my_descriptor_dirty_if_older_than(time_t when);
|
2004-11-13 17:53:48 +01:00
|
|
|
void mark_my_descriptor_dirty(void);
|
2005-08-22 05:10:53 +02:00
|
|
|
void check_descriptor_bandwidth_changed(time_t now);
|
2005-10-13 00:41:16 +02:00
|
|
|
void check_descriptor_ipaddress_changed(time_t now);
|
2006-07-17 08:35:06 +02:00
|
|
|
void router_new_address_suggestion(const char *suggestion);
|
2004-05-12 21:49:48 +02:00
|
|
|
int router_compare_to_my_exit_policy(connection_t *conn);
|
|
|
|
routerinfo_t *router_get_my_routerinfo(void);
|
|
|
|
const char *router_get_my_descriptor(void);
|
2005-05-23 07:20:52 +02:00
|
|
|
int router_digest_is_me(const char *digest);
|
2004-05-12 21:49:48 +02:00
|
|
|
int router_is_me(routerinfo_t *router);
|
2005-09-08 22:18:15 +02:00
|
|
|
int router_fingerprint_is_me(const char *fp);
|
2004-11-13 17:53:48 +01:00
|
|
|
int router_rebuild_descriptor(int force);
|
2004-10-14 04:47:09 +02:00
|
|
|
int router_dump_router_to_string(char *s, size_t maxlen, routerinfo_t *router,
|
2004-05-12 21:49:48 +02:00
|
|
|
crypto_pk_env_t *ident_key);
|
2004-08-18 06:44:24 +02:00
|
|
|
int is_legal_nickname(const char *s);
|
|
|
|
int is_legal_nickname_or_hexdigest(const char *s);
|
2006-03-15 06:06:26 +01:00
|
|
|
int is_legal_hexdigest(const char *s);
|
2005-10-06 01:20:45 +02:00
|
|
|
void router_reset_warnings(void);
|
|
|
|
void router_free_all(void);
|
2004-05-12 21:49:48 +02:00
|
|
|
|
|
|
|
/********************************* routerlist.c ***************************/
|
|
|
|
|
2005-09-13 23:14:55 +02:00
|
|
|
/** Represents information about a single trusted directory server. */
|
2004-10-12 17:55:20 +02:00
|
|
|
typedef struct trusted_dir_server_t {
|
2005-10-04 23:21:09 +02:00
|
|
|
char *description;
|
|
|
|
char *nickname;
|
2005-09-13 23:14:55 +02:00
|
|
|
char *address; /**< Hostname */
|
|
|
|
uint32_t addr; /**< IPv4 address */
|
|
|
|
uint16_t dir_port; /**< Directory port */
|
|
|
|
char digest[DIGEST_LEN]; /**< Digest of identity key */
|
|
|
|
unsigned int is_running:1; /**< True iff we think this server is running. */
|
2005-12-15 21:49:01 +01:00
|
|
|
/** True iff this server is an authority for the older ("v1") directory
|
|
|
|
* protocol. (All authorities are v2 authorities.) */
|
2005-12-15 22:17:40 +01:00
|
|
|
unsigned int is_v1_authority:1;
|
2005-09-13 23:14:55 +02:00
|
|
|
int n_networkstatus_failures; /**< How many times have we asked for this
|
|
|
|
* server's network-status unsuccessfully? */
|
2005-12-14 23:00:58 +01:00
|
|
|
routerstatus_t fake_status; /**< Used when we need to pass this trusted
|
2005-12-15 21:44:15 +01:00
|
|
|
* dir_server_t to directory_initiate_command_*
|
|
|
|
* as a routerstatus_t. Not updated by the
|
|
|
|
* router-status management code!
|
|
|
|
**/
|
2004-10-12 17:55:20 +02:00
|
|
|
} trusted_dir_server_t;
|
|
|
|
|
2004-09-08 08:52:33 +02:00
|
|
|
int router_reload_router_list(void);
|
2005-09-07 18:42:53 +02:00
|
|
|
int router_reload_networkstatus(void);
|
2006-04-10 03:35:56 +02:00
|
|
|
smartlist_t *router_get_trusted_dir_servers(void);
|
2005-12-14 23:00:58 +01:00
|
|
|
routerstatus_t *router_pick_directory_server(int requireother,
|
|
|
|
int fascistfirewall,
|
|
|
|
int for_v2_directory,
|
|
|
|
int retry_if_no_servers);
|
|
|
|
routerstatus_t *router_pick_trusteddirserver(int need_v1_authority,
|
|
|
|
int requireother,
|
|
|
|
int fascistfirewall,
|
|
|
|
int retry_if_no_servers);
|
2005-09-08 08:22:44 +02:00
|
|
|
trusted_dir_server_t *router_get_trusteddirserver_by_digest(
|
|
|
|
const char *digest);
|
2005-09-02 22:37:31 +02:00
|
|
|
void routerlist_add_family(smartlist_t *sl, routerinfo_t *router);
|
2005-12-14 21:40:40 +01:00
|
|
|
void add_nickname_list_to_smartlist(smartlist_t *sl, const char *list,
|
2005-12-31 07:32:57 +01:00
|
|
|
int must_be_running,
|
2005-12-14 21:40:40 +01:00
|
|
|
int warn_if_down, int warn_if_unnamed);
|
2004-08-18 12:32:50 +02:00
|
|
|
routerinfo_t *routerlist_find_my_routerinfo(void);
|
2005-12-14 21:40:40 +01:00
|
|
|
routerinfo_t *router_find_exact_exit_enclave(const char *address,
|
|
|
|
uint16_t port);
|
2006-01-02 04:32:55 +01:00
|
|
|
|
|
|
|
#define ROUTER_REQUIRED_MIN_BANDWIDTH 10000
|
2005-12-14 21:40:40 +01:00
|
|
|
int router_is_unreliable(routerinfo_t *router, int need_uptime,
|
2006-02-12 04:43:39 +01:00
|
|
|
int need_capacity, int need_guard);
|
2006-03-28 14:01:58 +02:00
|
|
|
uint32_t router_get_advertised_bandwidth(routerinfo_t *router);
|
2004-08-18 08:10:12 +02:00
|
|
|
routerinfo_t *routerlist_sl_choose_by_bandwidth(smartlist_t *sl);
|
2004-10-27 23:14:11 +02:00
|
|
|
routerinfo_t *router_choose_random_node(const char *preferred,
|
|
|
|
const char *excluded,
|
2005-09-02 22:37:31 +02:00
|
|
|
smartlist_t *excludedsmartlist,
|
2005-01-12 05:58:23 +01:00
|
|
|
int need_uptime, int need_bandwidth,
|
2006-02-12 04:43:39 +01:00
|
|
|
int need_guard,
|
2006-03-19 02:21:59 +01:00
|
|
|
int allow_invalid, int strict);
|
2005-10-05 00:23:31 +02:00
|
|
|
routerinfo_t *router_get_by_nickname(const char *nickname,
|
|
|
|
int warn_if_unnamed);
|
2004-07-01 03:16:59 +02:00
|
|
|
routerinfo_t *router_get_by_hexdigest(const char *hexdigest);
|
|
|
|
routerinfo_t *router_get_by_digest(const char *digest);
|
2005-11-05 21:15:27 +01:00
|
|
|
signed_descriptor_t *router_get_by_descriptor_digest(const char *digest);
|
2006-01-12 19:04:17 +01:00
|
|
|
const char *signed_descriptor_get_body(signed_descriptor_t *desc);
|
2005-11-19 07:57:44 +01:00
|
|
|
int router_digest_version_as_new_as(const char *digest, const char *cutoff);
|
2004-07-20 22:09:59 +02:00
|
|
|
int router_digest_is_trusted_dir(const char *digest);
|
2005-10-18 19:43:54 +02:00
|
|
|
routerlist_t *router_get_routerlist(void);
|
2005-10-05 04:20:46 +02:00
|
|
|
void routerlist_reset_warnings(void);
|
2004-05-12 21:49:48 +02:00
|
|
|
void routerlist_free(routerlist_t *routerlist);
|
2005-11-23 07:00:58 +01:00
|
|
|
void dump_routerlist_mem_usage(int severity);
|
2005-10-27 02:34:39 +02:00
|
|
|
void routerlist_remove(routerlist_t *rl, routerinfo_t *ri, int idx,
|
|
|
|
int make_old);
|
2004-05-12 21:49:48 +02:00
|
|
|
void routerinfo_free(routerinfo_t *router);
|
2005-09-02 22:37:31 +02:00
|
|
|
void routerstatus_free(routerstatus_t *routerstatus);
|
|
|
|
void networkstatus_free(networkstatus_t *networkstatus);
|
2005-09-15 01:42:06 +02:00
|
|
|
void routerlist_free_all(void);
|
2004-05-12 21:49:48 +02:00
|
|
|
routerinfo_t *routerinfo_copy(const routerinfo_t *router);
|
2006-03-18 02:24:04 +01:00
|
|
|
void router_set_status(const char *digest, int up);
|
2005-11-01 18:34:17 +01:00
|
|
|
void routerlist_remove_old_routers(void);
|
2005-09-15 07:41:30 +02:00
|
|
|
void networkstatus_list_clean(time_t now);
|
2005-09-15 07:19:38 +02:00
|
|
|
int router_add_to_routerlist(routerinfo_t *router, const char **msg,
|
2006-01-04 05:42:10 +01:00
|
|
|
int from_cache, int from_fetch);
|
2006-03-17 23:08:59 +01:00
|
|
|
int router_load_single_router(const char *s, uint8_t purpose,
|
|
|
|
const char **msg);
|
2006-06-22 09:01:54 +02:00
|
|
|
void router_load_routers_from_string(const char *s,
|
|
|
|
saved_location_t saved_location,
|
2005-09-15 07:19:38 +02:00
|
|
|
smartlist_t *requested_fingerprints);
|
2005-12-14 21:40:40 +01:00
|
|
|
typedef enum {
|
|
|
|
NS_FROM_CACHE, NS_FROM_DIR, NS_GENERATED
|
|
|
|
} networkstatus_source_t;
|
2005-09-08 22:36:40 +02:00
|
|
|
int router_set_networkstatus(const char *s, time_t arrived_at,
|
|
|
|
networkstatus_source_t source,
|
|
|
|
smartlist_t *requested_fingerprints);
|
2005-03-19 07:57:16 +01:00
|
|
|
|
2005-01-12 05:58:23 +01:00
|
|
|
int router_exit_policy_all_routers_reject(uint32_t addr, uint16_t port,
|
|
|
|
int need_uptime);
|
2004-05-12 21:49:48 +02:00
|
|
|
int router_exit_policy_rejects_all(routerinfo_t *router);
|
2006-03-27 04:25:34 +02:00
|
|
|
|
2005-10-04 23:21:09 +02:00
|
|
|
void add_trusted_dir_server(const char *nickname,
|
2005-10-05 04:06:36 +02:00
|
|
|
const char *address, uint16_t port,
|
2006-04-10 23:29:29 +02:00
|
|
|
const char *digest, int is_v1_authority);
|
2004-10-13 21:56:42 +02:00
|
|
|
void clear_trusted_dir_servers(void);
|
2006-04-10 23:29:29 +02:00
|
|
|
int any_trusted_dir_is_v1_authority(void);
|
2005-09-08 08:22:44 +02:00
|
|
|
networkstatus_t *networkstatus_get_by_digest(const char *digest);
|
2005-09-22 03:51:14 +02:00
|
|
|
local_routerstatus_t *router_get_combined_status_by_digest(const char *digest);
|
2005-10-05 07:03:52 +02:00
|
|
|
void update_networkstatus_downloads(time_t now);
|
2005-09-15 07:19:38 +02:00
|
|
|
void update_router_descriptor_downloads(time_t now);
|
2005-09-14 23:09:25 +02:00
|
|
|
void routers_update_all_from_networkstatus(void);
|
2005-09-18 04:51:12 +02:00
|
|
|
void routers_update_status_from_networkstatus(smartlist_t *routers,
|
2005-12-27 06:26:03 +01:00
|
|
|
int reset_failures);
|
2005-09-12 08:56:42 +02:00
|
|
|
smartlist_t *router_list_superseded(void);
|
2005-09-15 07:19:38 +02:00
|
|
|
int router_have_minimum_dir_info(void);
|
2005-09-18 04:24:42 +02:00
|
|
|
void networkstatus_list_update_recent(time_t now);
|
2005-09-22 08:34:29 +02:00
|
|
|
void router_reset_descriptor_download_failures(void);
|
2005-10-05 07:03:52 +02:00
|
|
|
void router_reset_status_download_failures(void);
|
2005-10-12 15:49:13 +02:00
|
|
|
int router_differences_are_cosmetic(routerinfo_t *r1, routerinfo_t *r2);
|
2006-03-11 03:21:30 +01:00
|
|
|
const char *esc_router_info(routerinfo_t *router);
|
2004-10-13 21:56:42 +02:00
|
|
|
|
2004-05-12 21:49:48 +02:00
|
|
|
/********************************* routerparse.c ************************/
|
|
|
|
|
2004-11-30 00:04:26 +01:00
|
|
|
#define MAX_STATUS_TAG_LEN 32
|
|
|
|
/** Structure to hold parsed Tor versions. This is a little messier
|
|
|
|
* than we would like it to be, because we changed version schemes with 0.1.0.
|
|
|
|
*
|
2005-03-19 06:07:19 +01:00
|
|
|
* See version-spec.txt for the whole business.
|
2004-11-30 00:04:26 +01:00
|
|
|
*/
|
2004-07-13 21:16:49 +02:00
|
|
|
typedef struct tor_version_t {
|
|
|
|
int major;
|
|
|
|
int minor;
|
|
|
|
int micro;
|
2004-11-30 00:04:26 +01:00
|
|
|
/** Release status. For version in the post-0.1 format, this is always
|
|
|
|
* VER_RELEASE. */
|
|
|
|
enum { VER_PRE=0, VER_RC=1, VER_RELEASE=2, } status;
|
2004-07-13 21:16:49 +02:00
|
|
|
int patchlevel;
|
2004-11-30 00:04:26 +01:00
|
|
|
/** CVS status. For version in the post-0.1 format, this is always
|
|
|
|
* IS_NOT_CVS */
|
2004-07-13 21:16:49 +02:00
|
|
|
enum { IS_CVS=0, IS_NOT_CVS=1} cvs;
|
2004-11-30 00:04:26 +01:00
|
|
|
char status_tag[MAX_STATUS_TAG_LEN];
|
2004-07-13 21:16:49 +02:00
|
|
|
} tor_version_t;
|
|
|
|
|
2005-09-21 02:41:06 +02:00
|
|
|
typedef enum version_status_t {
|
|
|
|
VS_RECOMMENDED=0, /**< This version is listed as recommended. */
|
|
|
|
VS_OLD=1, /**< This version is older than any recommended version. */
|
|
|
|
VS_NEW=2, /**< This version is newer than any recommended version. */
|
|
|
|
VS_NEW_IN_SERIES=3, /**< This version is newer than any recommended version
|
|
|
|
* in its series, and such recommended versions exist. */
|
|
|
|
VS_UNRECOMMENDED=4 /**< This version is not recommended (general case) */
|
|
|
|
} version_status_t;
|
|
|
|
|
2004-05-12 21:49:48 +02:00
|
|
|
int router_get_router_hash(const char *s, char *digest);
|
|
|
|
int router_get_dir_hash(const char *s, char *digest);
|
2004-06-25 02:29:31 +02:00
|
|
|
int router_get_runningrouters_hash(const char *s, char *digest);
|
2005-08-25 22:33:17 +02:00
|
|
|
int router_get_networkstatus_v2_hash(const char *s, char *digest);
|
2005-12-14 21:40:40 +01:00
|
|
|
int router_append_dirobj_signature(char *buf, size_t buf_len,
|
|
|
|
const char *digest,
|
2005-08-26 17:34:53 +02:00
|
|
|
crypto_pk_env_t *private_key);
|
2004-05-12 21:49:48 +02:00
|
|
|
int router_parse_list_from_string(const char **s,
|
2006-04-29 20:42:26 +02:00
|
|
|
smartlist_t *dest,
|
2006-06-22 09:01:54 +02:00
|
|
|
saved_location_t saved_location);
|
2004-05-12 21:49:48 +02:00
|
|
|
int router_parse_routerlist_from_directory(const char *s,
|
|
|
|
routerlist_t **dest,
|
2004-10-03 04:37:52 +02:00
|
|
|
crypto_pk_env_t *pkey,
|
2005-01-06 21:11:52 +01:00
|
|
|
int check_version,
|
|
|
|
int write_to_cache);
|
2005-09-14 23:09:25 +02:00
|
|
|
int router_parse_runningrouters(const char *str);
|
2005-09-15 07:19:38 +02:00
|
|
|
int router_parse_directory(const char *str);
|
2006-06-22 09:01:54 +02:00
|
|
|
routerinfo_t *router_parse_entry_from_string(const char *s, const char *end,
|
|
|
|
int cache_copy);
|
2005-08-08 23:58:48 +02:00
|
|
|
addr_policy_t *router_parse_addr_policy_from_string(const char *s,
|
|
|
|
int assume_action);
|
2005-09-21 02:41:06 +02:00
|
|
|
version_status_t tor_version_is_obsolete(const char *myversion,
|
|
|
|
const char *versionlist);
|
|
|
|
version_status_t version_status_join(version_status_t a, version_status_t b);
|
2004-07-13 21:16:49 +02:00
|
|
|
int tor_version_parse(const char *s, tor_version_t *out);
|
2004-09-27 08:00:43 +02:00
|
|
|
int tor_version_as_new_as(const char *platform, const char *cutoff);
|
2004-07-13 21:16:49 +02:00
|
|
|
int tor_version_compare(tor_version_t *a, tor_version_t *b);
|
2006-04-03 08:23:24 +02:00
|
|
|
void sort_version_list(smartlist_t *lst, int remove_duplicates);
|
2004-12-04 02:14:36 +01:00
|
|
|
void assert_addr_policy_ok(addr_policy_t *t);
|
2004-05-12 21:49:48 +02:00
|
|
|
|
2005-09-02 22:37:31 +02:00
|
|
|
networkstatus_t *networkstatus_parse_from_string(const char *s);
|
|
|
|
|
2002-06-27 00:45:49 +02:00
|
|
|
#endif
|
2005-06-09 21:03:31 +02:00
|
|
|
|