origin_circuit_st.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290
  1. /* Copyright (c) 2001 Matej Pfajfar.
  2. * Copyright (c) 2001-2004, Roger Dingledine.
  3. * Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
  4. * Copyright (c) 2007-2018, The Tor Project, Inc. */
  5. /* See LICENSE for licensing information */
  6. #ifndef ORIGIN_CIRCUIT_ST_H
  7. #define ORIGIN_CIRCUIT_ST_H
  8. #include "core/or/or.h"
  9. #include "core/or/circuit_st.h"
  10. struct onion_queue_t;
  11. /**
  12. * Describes the circuit building process in simplified terms based
  13. * on the path bias accounting state for a circuit.
  14. *
  15. * NOTE: These state values are enumerated in the order for which we
  16. * expect circuits to transition through them. If you add states,
  17. * you need to preserve this overall ordering. The various pathbias
  18. * state transition and accounting functions (pathbias_mark_* and
  19. * pathbias_count_*) contain ordinal comparisons to enforce proper
  20. * state transitions for corrections.
  21. *
  22. * This state machine and the associated logic was created to prevent
  23. * miscounting due to unknown cases of circuit reuse. See also tickets
  24. * #6475 and #7802.
  25. */
  26. enum path_state_t {
  27. /** This circuit is "new". It has not yet completed a first hop
  28. * or been counted by the path bias code. */
  29. PATH_STATE_NEW_CIRC = 0,
  30. /** This circuit has completed one/two hops, and has been counted by
  31. * the path bias logic. */
  32. PATH_STATE_BUILD_ATTEMPTED = 1,
  33. /** This circuit has been completely built */
  34. PATH_STATE_BUILD_SUCCEEDED = 2,
  35. /** Did we try to attach any SOCKS streams or hidserv introductions to
  36. * this circuit?
  37. *
  38. * Note: If we ever implement end-to-end stream timing through test
  39. * stream probes (#5707), we must *not* set this for those probes
  40. * (or any other automatic streams) because the adversary could
  41. * just tag at a later point.
  42. */
  43. PATH_STATE_USE_ATTEMPTED = 3,
  44. /** Did any SOCKS streams or hidserv introductions actually succeed on
  45. * this circuit?
  46. *
  47. * If any streams detatch/fail from this circuit, the code transitions
  48. * the circuit back to PATH_STATE_USE_ATTEMPTED to ensure we probe. See
  49. * pathbias_mark_use_rollback() for that.
  50. */
  51. PATH_STATE_USE_SUCCEEDED = 4,
  52. /**
  53. * This is a special state to indicate that we got a corrupted
  54. * relay cell on a circuit and we don't intend to probe it.
  55. */
  56. PATH_STATE_USE_FAILED = 5,
  57. /**
  58. * This is a special state to indicate that we already counted
  59. * the circuit. Used to guard against potential state machine
  60. * violations.
  61. */
  62. PATH_STATE_ALREADY_COUNTED = 6,
  63. };
  64. /** An origin_circuit_t holds data necessary to build and use a circuit.
  65. */
  66. struct origin_circuit_t {
  67. circuit_t base_;
  68. /** Linked list of AP streams (or EXIT streams if hidden service)
  69. * associated with this circuit. */
  70. edge_connection_t *p_streams;
  71. /** Bytes read on this circuit since last call to
  72. * control_event_circ_bandwidth_used(). Only used if we're configured
  73. * to emit CIRC_BW events. */
  74. uint32_t n_read_circ_bw;
  75. /** Bytes written to on this circuit since last call to
  76. * control_event_circ_bandwidth_used(). Only used if we're configured
  77. * to emit CIRC_BW events. */
  78. uint32_t n_written_circ_bw;
  79. /** Total known-valid relay cell bytes since last call to
  80. * control_event_circ_bandwidth_used(). Only used if we're configured
  81. * to emit CIRC_BW events. */
  82. uint32_t n_delivered_read_circ_bw;
  83. /** Total written relay cell bytes since last call to
  84. * control_event_circ_bandwidth_used(). Only used if we're configured
  85. * to emit CIRC_BW events. */
  86. uint32_t n_delivered_written_circ_bw;
  87. /** Total overhead data in all known-valid relay data cells since last
  88. * call to control_event_circ_bandwidth_used(). Only used if we're
  89. * configured to emit CIRC_BW events. */
  90. uint32_t n_overhead_read_circ_bw;
  91. /** Total written overhead data in all relay data cells since last call to
  92. * control_event_circ_bandwidth_used(). Only used if we're configured
  93. * to emit CIRC_BW events. */
  94. uint32_t n_overhead_written_circ_bw;
  95. /** Build state for this circuit. It includes the intended path
  96. * length, the chosen exit router, rendezvous information, etc.
  97. */
  98. cpath_build_state_t *build_state;
  99. /** The doubly-linked list of crypt_path_t entries, one per hop,
  100. * for this circuit. This includes ciphers for each hop,
  101. * integrity-checking digests for each hop, and package/delivery
  102. * windows for each hop.
  103. */
  104. crypt_path_t *cpath;
  105. /** Holds all rendezvous data on either client or service side. */
  106. rend_data_t *rend_data;
  107. /** Holds hidden service identifier on either client or service side. This
  108. * is for both introduction and rendezvous circuit. */
  109. struct hs_ident_circuit_t *hs_ident;
  110. /** Holds the data that the entry guard system uses to track the
  111. * status of the guard this circuit is using, and thereby to determine
  112. * whether this circuit can be used. */
  113. struct circuit_guard_state_t *guard_state;
  114. /** Index into global_origin_circuit_list for this circuit. -1 if not
  115. * present. */
  116. int global_origin_circuit_list_idx;
  117. /** How many more relay_early cells can we send on this circuit, according
  118. * to the specification? */
  119. unsigned int remaining_relay_early_cells : 4;
  120. /** Set if this circuit is insanely old and we already informed the user */
  121. unsigned int is_ancient : 1;
  122. /** Set if this circuit has already been opened. Used to detect
  123. * cannibalized circuits. */
  124. unsigned int has_opened : 1;
  125. /**
  126. * Path bias state machine. Used to ensure integrity of our
  127. * circuit building and usage accounting. See path_state_t
  128. * for more details.
  129. */
  130. path_state_bitfield_t path_state : 3;
  131. /* If this flag is set, we should not consider attaching any more
  132. * connections to this circuit. */
  133. unsigned int unusable_for_new_conns : 1;
  134. /**
  135. * Tristate variable to guard against pathbias miscounting
  136. * due to circuit purpose transitions changing the decision
  137. * of pathbias_should_count(). This variable is informational
  138. * only. The current results of pathbias_should_count() are
  139. * the official decision for pathbias accounting.
  140. */
  141. uint8_t pathbias_shouldcount;
  142. #define PATHBIAS_SHOULDCOUNT_UNDECIDED 0
  143. #define PATHBIAS_SHOULDCOUNT_IGNORED 1
  144. #define PATHBIAS_SHOULDCOUNT_COUNTED 2
  145. /** For path probing. Store the temporary probe stream ID
  146. * for response comparison */
  147. streamid_t pathbias_probe_id;
  148. /** For path probing. Store the temporary probe address nonce
  149. * (in host byte order) for response comparison. */
  150. uint32_t pathbias_probe_nonce;
  151. /** Set iff this is a hidden-service circuit which has timed out
  152. * according to our current circuit-build timeout, but which has
  153. * been kept around because it might still succeed in connecting to
  154. * its destination, and which is not a fully-connected rendezvous
  155. * circuit.
  156. *
  157. * (We clear this flag for client-side rendezvous circuits when they
  158. * are 'joined' to the other side's rendezvous circuit, so that
  159. * connection_ap_handshake_attach_circuit can put client streams on
  160. * the circuit. We also clear this flag for service-side rendezvous
  161. * circuits when they are 'joined' to a client's rend circ, but only
  162. * for symmetry with the client case. Client-side introduction
  163. * circuits are closed when we get a joined rend circ, and
  164. * service-side introduction circuits never have this flag set.) */
  165. unsigned int hs_circ_has_timed_out : 1;
  166. /** Set iff this circuit has been given a relaxed timeout because
  167. * no circuits have opened. Used to prevent spamming logs. */
  168. unsigned int relaxed_timeout : 1;
  169. /** Set iff this is a service-side rendezvous circuit for which a
  170. * new connection attempt has been launched. We consider launching
  171. * a new service-side rend circ to a client when the previous one
  172. * fails; now that we don't necessarily close a service-side rend
  173. * circ when we launch a new one to the same client, this flag keeps
  174. * us from launching two retries for the same failed rend circ. */
  175. unsigned int hs_service_side_rend_circ_has_been_relaunched : 1;
  176. /** What commands were sent over this circuit that decremented the
  177. * RELAY_EARLY counter? This is for debugging task 878. */
  178. uint8_t relay_early_commands[MAX_RELAY_EARLY_CELLS_PER_CIRCUIT];
  179. /** How many RELAY_EARLY cells have been sent over this circuit? This is
  180. * for debugging task 878, too. */
  181. int relay_early_cells_sent;
  182. /** The next stream_id that will be tried when we're attempting to
  183. * construct a new AP stream originating at this circuit. */
  184. streamid_t next_stream_id;
  185. /* The intro key replaces the hidden service's public key if purpose is
  186. * S_ESTABLISH_INTRO or S_INTRO, provided that no unversioned rendezvous
  187. * descriptor is used. */
  188. crypto_pk_t *intro_key;
  189. /** Quasi-global identifier for this circuit; used for control.c */
  190. /* XXXX NM This can get re-used after 2**32 circuits. */
  191. uint32_t global_identifier;
  192. /** True if we have associated one stream to this circuit, thereby setting
  193. * the isolation parameters for this circuit. Note that this doesn't
  194. * necessarily mean that we've <em>attached</em> any streams to the circuit:
  195. * we may only have marked up this circuit during the launch process.
  196. */
  197. unsigned int isolation_values_set : 1;
  198. /** True iff any stream has <em>ever</em> been attached to this circuit.
  199. *
  200. * In a better world we could use timestamp_dirty for this, but
  201. * timestamp_dirty is far too overloaded at the moment.
  202. */
  203. unsigned int isolation_any_streams_attached : 1;
  204. /** A bitfield of ISO_* flags for every isolation field such that this
  205. * circuit has had streams with more than one value for that field
  206. * attached to it. */
  207. uint8_t isolation_flags_mixed;
  208. /** @name Isolation parameters
  209. *
  210. * If any streams have been associated with this circ (isolation_values_set
  211. * == 1), and all streams associated with the circuit have had the same
  212. * value for some field ((isolation_flags_mixed & ISO_FOO) == 0), then these
  213. * elements hold the value for that field.
  214. *
  215. * Note again that "associated" is not the same as "attached": we
  216. * preliminarily associate streams with a circuit while the circuit is being
  217. * launched, so that we can tell whether we need to launch more circuits.
  218. *
  219. * @{
  220. */
  221. uint8_t client_proto_type;
  222. uint8_t client_proto_socksver;
  223. uint16_t dest_port;
  224. tor_addr_t client_addr;
  225. char *dest_address;
  226. int session_group;
  227. unsigned nym_epoch;
  228. size_t socks_username_len;
  229. uint8_t socks_password_len;
  230. /* Note that the next two values are NOT NUL-terminated; see
  231. socks_username_len and socks_password_len for their lengths. */
  232. char *socks_username;
  233. char *socks_password;
  234. /** Global identifier for the first stream attached here; used by
  235. * ISO_STREAM. */
  236. uint64_t associated_isolated_stream_global_id;
  237. /**@}*/
  238. /** A list of addr_policy_t for this circuit in particular. Used by
  239. * adjust_exit_policy_from_exitpolicy_failure.
  240. */
  241. smartlist_t *prepend_policy;
  242. /** How long do we wait before closing this circuit if it remains
  243. * completely idle after it was built, in seconds? This value
  244. * is randomized on a per-circuit basis from CircuitsAvailableTimoeut
  245. * to 2*CircuitsAvailableTimoeut. */
  246. int circuit_idle_timeout;
  247. };
  248. #endif