circuitlist.c 40 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288
  1. /* Copyright 2001 Matej Pfajfar.
  2. * Copyright (c) 2001-2004, Roger Dingledine.
  3. * Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
  4. * Copyright (c) 2007-2010, The Tor Project, Inc. */
  5. /* See LICENSE for licensing information */
  6. /**
  7. * \file circuitlist.c
  8. * \brief Manage the global circuit list.
  9. **/
  10. #include "or.h"
  11. #include "ht.h"
  12. /********* START VARIABLES **********/
  13. /** A global list of all circuits at this hop. */
  14. circuit_t *global_circuitlist=NULL;
  15. /** A list of all the circuits in CIRCUIT_STATE_OR_WAIT. */
  16. static smartlist_t *circuits_pending_or_conns=NULL;
  17. static void circuit_free(circuit_t *circ);
  18. static void circuit_free_cpath(crypt_path_t *cpath);
  19. static void circuit_free_cpath_node(crypt_path_t *victim);
  20. /********* END VARIABLES ************/
  21. /** A map from OR connection and circuit ID to circuit. (Lookup performance is
  22. * very important here, since we need to do it every time a cell arrives.) */
  23. typedef struct orconn_circid_circuit_map_t {
  24. HT_ENTRY(orconn_circid_circuit_map_t) node;
  25. or_connection_t *or_conn;
  26. circid_t circ_id;
  27. circuit_t *circuit;
  28. } orconn_circid_circuit_map_t;
  29. /** Helper for hash tables: compare the OR connection and circuit ID for a and
  30. * b, and return less than, equal to, or greater than zero appropriately.
  31. */
  32. static INLINE int
  33. _orconn_circid_entries_eq(orconn_circid_circuit_map_t *a,
  34. orconn_circid_circuit_map_t *b)
  35. {
  36. return a->or_conn == b->or_conn && a->circ_id == b->circ_id;
  37. }
  38. /** Helper: return a hash based on circuit ID and the pointer value of
  39. * or_conn in <b>a</b>. */
  40. static INLINE unsigned int
  41. _orconn_circid_entry_hash(orconn_circid_circuit_map_t *a)
  42. {
  43. return (((unsigned)a->circ_id)<<8) ^ (unsigned)(uintptr_t)(a->or_conn);
  44. }
  45. /** Map from [orconn,circid] to circuit. */
  46. static HT_HEAD(orconn_circid_map, orconn_circid_circuit_map_t)
  47. orconn_circid_circuit_map = HT_INITIALIZER();
  48. HT_PROTOTYPE(orconn_circid_map, orconn_circid_circuit_map_t, node,
  49. _orconn_circid_entry_hash, _orconn_circid_entries_eq)
  50. HT_GENERATE(orconn_circid_map, orconn_circid_circuit_map_t, node,
  51. _orconn_circid_entry_hash, _orconn_circid_entries_eq, 0.6,
  52. malloc, realloc, free)
  53. /** The most recently returned entry from circuit_get_by_circid_orconn;
  54. * used to improve performance when many cells arrive in a row from the
  55. * same circuit.
  56. */
  57. orconn_circid_circuit_map_t *_last_circid_orconn_ent = NULL;
  58. /** Implementation helper for circuit_set_{p,n}_circid_orconn: A circuit ID
  59. * and/or or_connection for circ has just changed from <b>old_conn, old_id</b>
  60. * to <b>conn, id</b>. Adjust the conn,circid map as appropriate, removing
  61. * the old entry (if any) and adding a new one. If <b>active</b> is true,
  62. * remove the circuit from the list of active circuits on old_conn and add it
  63. * to the list of active circuits on conn.
  64. * XXX "active" isn't an arg anymore */
  65. static void
  66. circuit_set_circid_orconn_helper(circuit_t *circ, int direction,
  67. circid_t id,
  68. or_connection_t *conn)
  69. {
  70. orconn_circid_circuit_map_t search;
  71. orconn_circid_circuit_map_t *found;
  72. or_connection_t *old_conn, **conn_ptr;
  73. circid_t old_id, *circid_ptr;
  74. int was_active, make_active;
  75. if (direction == CELL_DIRECTION_OUT) {
  76. conn_ptr = &circ->n_conn;
  77. circid_ptr = &circ->n_circ_id;
  78. was_active = circ->next_active_on_n_conn != NULL;
  79. make_active = circ->n_conn_cells.n > 0;
  80. } else {
  81. or_circuit_t *c = TO_OR_CIRCUIT(circ);
  82. conn_ptr = &c->p_conn;
  83. circid_ptr = &c->p_circ_id;
  84. was_active = c->next_active_on_p_conn != NULL;
  85. make_active = c->p_conn_cells.n > 0;
  86. }
  87. old_conn = *conn_ptr;
  88. old_id = *circid_ptr;
  89. if (id == old_id && conn == old_conn)
  90. return;
  91. if (_last_circid_orconn_ent &&
  92. ((old_id == _last_circid_orconn_ent->circ_id &&
  93. old_conn == _last_circid_orconn_ent->or_conn) ||
  94. (id == _last_circid_orconn_ent->circ_id &&
  95. conn == _last_circid_orconn_ent->or_conn))) {
  96. _last_circid_orconn_ent = NULL;
  97. }
  98. if (old_conn) { /* we may need to remove it from the conn-circid map */
  99. tor_assert(old_conn->_base.magic == OR_CONNECTION_MAGIC);
  100. search.circ_id = old_id;
  101. search.or_conn = old_conn;
  102. found = HT_REMOVE(orconn_circid_map, &orconn_circid_circuit_map, &search);
  103. if (found) {
  104. tor_free(found);
  105. --old_conn->n_circuits;
  106. }
  107. if (was_active && old_conn != conn)
  108. make_circuit_inactive_on_conn(circ,old_conn);
  109. }
  110. /* Change the values only after we have possibly made the circuit inactive
  111. * on the previous conn. */
  112. *conn_ptr = conn;
  113. *circid_ptr = id;
  114. if (conn == NULL)
  115. return;
  116. /* now add the new one to the conn-circid map */
  117. search.circ_id = id;
  118. search.or_conn = conn;
  119. found = HT_FIND(orconn_circid_map, &orconn_circid_circuit_map, &search);
  120. if (found) {
  121. found->circuit = circ;
  122. } else {
  123. found = tor_malloc_zero(sizeof(orconn_circid_circuit_map_t));
  124. found->circ_id = id;
  125. found->or_conn = conn;
  126. found->circuit = circ;
  127. HT_INSERT(orconn_circid_map, &orconn_circid_circuit_map, found);
  128. }
  129. if (make_active && old_conn != conn)
  130. make_circuit_active_on_conn(circ,conn);
  131. ++conn->n_circuits;
  132. }
  133. /** Set the p_conn field of a circuit <b>circ</b>, along
  134. * with the corresponding circuit ID, and add the circuit as appropriate
  135. * to the (orconn,id)-\>circuit map. */
  136. void
  137. circuit_set_p_circid_orconn(or_circuit_t *circ, circid_t id,
  138. or_connection_t *conn)
  139. {
  140. circuit_set_circid_orconn_helper(TO_CIRCUIT(circ), CELL_DIRECTION_IN,
  141. id, conn);
  142. if (conn)
  143. tor_assert(bool_eq(circ->p_conn_cells.n, circ->next_active_on_p_conn));
  144. }
  145. /** Set the n_conn field of a circuit <b>circ</b>, along
  146. * with the corresponding circuit ID, and add the circuit as appropriate
  147. * to the (orconn,id)-\>circuit map. */
  148. void
  149. circuit_set_n_circid_orconn(circuit_t *circ, circid_t id,
  150. or_connection_t *conn)
  151. {
  152. circuit_set_circid_orconn_helper(circ, CELL_DIRECTION_OUT, id, conn);
  153. if (conn)
  154. tor_assert(bool_eq(circ->n_conn_cells.n, circ->next_active_on_n_conn));
  155. }
  156. /** Change the state of <b>circ</b> to <b>state</b>, adding it to or removing
  157. * it from lists as appropriate. */
  158. void
  159. circuit_set_state(circuit_t *circ, uint8_t state)
  160. {
  161. tor_assert(circ);
  162. if (state == circ->state)
  163. return;
  164. if (!circuits_pending_or_conns)
  165. circuits_pending_or_conns = smartlist_create();
  166. if (circ->state == CIRCUIT_STATE_OR_WAIT) {
  167. /* remove from waiting-circuit list. */
  168. smartlist_remove(circuits_pending_or_conns, circ);
  169. }
  170. if (state == CIRCUIT_STATE_OR_WAIT) {
  171. /* add to waiting-circuit list. */
  172. smartlist_add(circuits_pending_or_conns, circ);
  173. }
  174. if (state == CIRCUIT_STATE_OPEN)
  175. tor_assert(!circ->n_conn_onionskin);
  176. circ->state = state;
  177. }
  178. /** Add <b>circ</b> to the global list of circuits. This is called only from
  179. * within circuit_new.
  180. */
  181. static void
  182. circuit_add(circuit_t *circ)
  183. {
  184. if (!global_circuitlist) { /* first one */
  185. global_circuitlist = circ;
  186. circ->next = NULL;
  187. } else {
  188. circ->next = global_circuitlist;
  189. global_circuitlist = circ;
  190. }
  191. }
  192. /** Append to <b>out</b> all circuits in state OR_WAIT waiting for
  193. * the given connection. */
  194. void
  195. circuit_get_all_pending_on_or_conn(smartlist_t *out, or_connection_t *or_conn)
  196. {
  197. tor_assert(out);
  198. tor_assert(or_conn);
  199. if (!circuits_pending_or_conns)
  200. return;
  201. SMARTLIST_FOREACH_BEGIN(circuits_pending_or_conns, circuit_t *, circ) {
  202. if (circ->marked_for_close)
  203. continue;
  204. if (!circ->n_hop)
  205. continue;
  206. tor_assert(circ->state == CIRCUIT_STATE_OR_WAIT);
  207. if (tor_digest_is_zero(circ->n_hop->identity_digest)) {
  208. /* Look at addr/port. This is an unkeyed connection. */
  209. if (!tor_addr_eq(&circ->n_hop->addr, &or_conn->_base.addr) ||
  210. circ->n_hop->port != or_conn->_base.port)
  211. continue;
  212. } else {
  213. /* We expected a key. See if it's the right one. */
  214. if (memcmp(or_conn->identity_digest,
  215. circ->n_hop->identity_digest, DIGEST_LEN))
  216. continue;
  217. }
  218. smartlist_add(out, circ);
  219. } SMARTLIST_FOREACH_END(circ);
  220. }
  221. /** Return the number of circuits in state OR_WAIT, waiting for the given
  222. * connection. */
  223. int
  224. circuit_count_pending_on_or_conn(or_connection_t *or_conn)
  225. {
  226. int cnt;
  227. smartlist_t *sl = smartlist_create();
  228. circuit_get_all_pending_on_or_conn(sl, or_conn);
  229. cnt = smartlist_len(sl);
  230. smartlist_free(sl);
  231. log_debug(LD_CIRC,"or_conn to %s, %d pending circs",
  232. or_conn->nickname ? or_conn->nickname : "NULL", cnt);
  233. return cnt;
  234. }
  235. /** Detach from the global circuit list, and deallocate, all
  236. * circuits that have been marked for close.
  237. */
  238. void
  239. circuit_close_all_marked(void)
  240. {
  241. circuit_t *tmp,*m;
  242. while (global_circuitlist && global_circuitlist->marked_for_close) {
  243. tmp = global_circuitlist->next;
  244. circuit_free(global_circuitlist);
  245. global_circuitlist = tmp;
  246. }
  247. tmp = global_circuitlist;
  248. while (tmp && tmp->next) {
  249. if (tmp->next->marked_for_close) {
  250. m = tmp->next->next;
  251. circuit_free(tmp->next);
  252. tmp->next = m;
  253. /* Need to check new tmp->next; don't advance tmp. */
  254. } else {
  255. /* Advance tmp. */
  256. tmp = tmp->next;
  257. }
  258. }
  259. }
  260. /** Return the head of the global linked list of circuits. */
  261. circuit_t *
  262. _circuit_get_global_list(void)
  263. {
  264. return global_circuitlist;
  265. }
  266. /** Function to make circ-\>state human-readable */
  267. const char *
  268. circuit_state_to_string(int state)
  269. {
  270. static char buf[64];
  271. switch (state) {
  272. case CIRCUIT_STATE_BUILDING: return "doing handshakes";
  273. case CIRCUIT_STATE_ONIONSKIN_PENDING: return "processing the onion";
  274. case CIRCUIT_STATE_OR_WAIT: return "connecting to server";
  275. case CIRCUIT_STATE_OPEN: return "open";
  276. default:
  277. log_warn(LD_BUG, "Unknown circuit state %d", state);
  278. tor_snprintf(buf, sizeof(buf), "unknown state [%d]", state);
  279. return buf;
  280. }
  281. }
  282. /** Map a circuit purpose to a string suitable to be displayed to a
  283. * controller. */
  284. const char *
  285. circuit_purpose_to_controller_string(uint8_t purpose)
  286. {
  287. static char buf[32];
  288. switch (purpose) {
  289. case CIRCUIT_PURPOSE_OR:
  290. case CIRCUIT_PURPOSE_INTRO_POINT:
  291. case CIRCUIT_PURPOSE_REND_POINT_WAITING:
  292. case CIRCUIT_PURPOSE_REND_ESTABLISHED:
  293. return "SERVER"; /* A controller should never see these, actually. */
  294. case CIRCUIT_PURPOSE_C_GENERAL:
  295. return "GENERAL";
  296. case CIRCUIT_PURPOSE_C_INTRODUCING:
  297. case CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT:
  298. case CIRCUIT_PURPOSE_C_INTRODUCE_ACKED:
  299. return "HS_CLIENT_INTRO";
  300. case CIRCUIT_PURPOSE_C_ESTABLISH_REND:
  301. case CIRCUIT_PURPOSE_C_REND_READY:
  302. case CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED:
  303. case CIRCUIT_PURPOSE_C_REND_JOINED:
  304. return "HS_CLIENT_REND";
  305. case CIRCUIT_PURPOSE_S_ESTABLISH_INTRO:
  306. case CIRCUIT_PURPOSE_S_INTRO:
  307. return "HS_SERVICE_INTRO";
  308. case CIRCUIT_PURPOSE_S_CONNECT_REND:
  309. case CIRCUIT_PURPOSE_S_REND_JOINED:
  310. return "HS_SERVICE_REND";
  311. case CIRCUIT_PURPOSE_TESTING:
  312. return "TESTING";
  313. case CIRCUIT_PURPOSE_CONTROLLER:
  314. return "CONTROLLER";
  315. default:
  316. tor_snprintf(buf, sizeof(buf), "UNKNOWN_%d", (int)purpose);
  317. return buf;
  318. }
  319. }
  320. /** Pick a reasonable package_window to start out for our circuits.
  321. * Originally this was hard-coded at 1000, but now the consensus votes
  322. * on the answer. See proposal 168. */
  323. int32_t
  324. circuit_initial_package_window(void)
  325. {
  326. int32_t num = networkstatus_get_param(NULL, "circwindow", CIRCWINDOW_START);
  327. /* If the consensus tells us a negative number, we'd assert. */
  328. if (num < 0)
  329. num = CIRCWINDOW_START;
  330. return num;
  331. }
  332. /** Initialize the common elements in a circuit_t, and add it to the global
  333. * list. */
  334. static void
  335. init_circuit_base(circuit_t *circ)
  336. {
  337. circ->timestamp_created = time(NULL);
  338. tor_gettimeofday(&circ->highres_created);
  339. circ->package_window = circuit_initial_package_window();
  340. circ->deliver_window = CIRCWINDOW_START;
  341. /* Initialize the cell_ewma_t structure */
  342. circ->n_cell_ewma.last_adjusted_tick = cell_ewma_get_tick();
  343. circ->n_cell_ewma.cell_count = 0.0;
  344. circ->n_cell_ewma.heap_index = -1;
  345. circ->n_cell_ewma.is_for_p_conn = 0;
  346. circuit_add(circ);
  347. }
  348. /** Allocate space for a new circuit, initializing with <b>p_circ_id</b>
  349. * and <b>p_conn</b>. Add it to the global circuit list.
  350. */
  351. origin_circuit_t *
  352. origin_circuit_new(void)
  353. {
  354. origin_circuit_t *circ;
  355. /* never zero, since a global ID of 0 is treated specially by the
  356. * controller */
  357. static uint32_t n_circuits_allocated = 1;
  358. circ = tor_malloc_zero(sizeof(origin_circuit_t));
  359. circ->_base.magic = ORIGIN_CIRCUIT_MAGIC;
  360. circ->next_stream_id = crypto_rand_int(1<<16);
  361. circ->global_identifier = n_circuits_allocated++;
  362. circ->remaining_relay_early_cells = MAX_RELAY_EARLY_CELLS_PER_CIRCUIT;
  363. circ->remaining_relay_early_cells -= crypto_rand_int(2);
  364. init_circuit_base(TO_CIRCUIT(circ));
  365. circ_times.last_circ_at = approx_time();
  366. return circ;
  367. }
  368. /** Allocate a new or_circuit_t, connected to <b>p_conn</b> as
  369. * <b>p_circ_id</b>. If <b>p_conn</b> is NULL, the circuit is unattached. */
  370. or_circuit_t *
  371. or_circuit_new(circid_t p_circ_id, or_connection_t *p_conn)
  372. {
  373. /* CircIDs */
  374. or_circuit_t *circ;
  375. circ = tor_malloc_zero(sizeof(or_circuit_t));
  376. circ->_base.magic = OR_CIRCUIT_MAGIC;
  377. if (p_conn)
  378. circuit_set_p_circid_orconn(circ, p_circ_id, p_conn);
  379. circ->remaining_relay_early_cells = MAX_RELAY_EARLY_CELLS_PER_CIRCUIT;
  380. init_circuit_base(TO_CIRCUIT(circ));
  381. /* Initialize the cell_ewma_t structure */
  382. /* Initialize the cell counts to 0 */
  383. circ->p_cell_ewma.cell_count = 0.0;
  384. circ->p_cell_ewma.last_adjusted_tick = cell_ewma_get_tick();
  385. circ->p_cell_ewma.is_for_p_conn = 1;
  386. /* It's not in any heap yet. */
  387. circ->p_cell_ewma.heap_index = -1;
  388. return circ;
  389. }
  390. /** Deallocate space associated with circ.
  391. */
  392. static void
  393. circuit_free(circuit_t *circ)
  394. {
  395. void *mem;
  396. size_t memlen;
  397. if (!circ)
  398. return;
  399. if (CIRCUIT_IS_ORIGIN(circ)) {
  400. origin_circuit_t *ocirc = TO_ORIGIN_CIRCUIT(circ);
  401. mem = ocirc;
  402. memlen = sizeof(origin_circuit_t);
  403. tor_assert(circ->magic == ORIGIN_CIRCUIT_MAGIC);
  404. if (ocirc->build_state) {
  405. extend_info_free(ocirc->build_state->chosen_exit);
  406. circuit_free_cpath_node(ocirc->build_state->pending_final_cpath);
  407. }
  408. tor_free(ocirc->build_state);
  409. circuit_free_cpath(ocirc->cpath);
  410. crypto_free_pk_env(ocirc->intro_key);
  411. rend_data_free(ocirc->rend_data);
  412. } else {
  413. or_circuit_t *ocirc = TO_OR_CIRCUIT(circ);
  414. /* Remember cell statistics for this circuit before deallocating. */
  415. if (get_options()->CellStatistics)
  416. rep_hist_buffer_stats_add_circ(circ, time(NULL));
  417. mem = ocirc;
  418. memlen = sizeof(or_circuit_t);
  419. tor_assert(circ->magic == OR_CIRCUIT_MAGIC);
  420. crypto_free_cipher_env(ocirc->p_crypto);
  421. crypto_free_digest_env(ocirc->p_digest);
  422. crypto_free_cipher_env(ocirc->n_crypto);
  423. crypto_free_digest_env(ocirc->n_digest);
  424. if (ocirc->rend_splice) {
  425. or_circuit_t *other = ocirc->rend_splice;
  426. tor_assert(other->_base.magic == OR_CIRCUIT_MAGIC);
  427. other->rend_splice = NULL;
  428. }
  429. /* remove from map. */
  430. circuit_set_p_circid_orconn(ocirc, 0, NULL);
  431. /* Clear cell queue _after_ removing it from the map. Otherwise our
  432. * "active" checks will be violated. */
  433. cell_queue_clear(&ocirc->p_conn_cells);
  434. }
  435. extend_info_free(circ->n_hop);
  436. tor_free(circ->n_conn_onionskin);
  437. /* Remove from map. */
  438. circuit_set_n_circid_orconn(circ, 0, NULL);
  439. /* Clear cell queue _after_ removing it from the map. Otherwise our
  440. * "active" checks will be violated. */
  441. cell_queue_clear(&circ->n_conn_cells);
  442. memset(mem, 0xAA, memlen); /* poison memory */
  443. tor_free(mem);
  444. }
  445. /** Deallocate space associated with the linked list <b>cpath</b>. */
  446. static void
  447. circuit_free_cpath(crypt_path_t *cpath)
  448. {
  449. crypt_path_t *victim, *head=cpath;
  450. if (!cpath)
  451. return;
  452. /* it's a doubly linked list, so we have to notice when we've
  453. * gone through it once. */
  454. while (cpath->next && cpath->next != head) {
  455. victim = cpath;
  456. cpath = victim->next;
  457. circuit_free_cpath_node(victim);
  458. }
  459. circuit_free_cpath_node(cpath);
  460. }
  461. /** Release all storage held by circuits. */
  462. void
  463. circuit_free_all(void)
  464. {
  465. circuit_t *next;
  466. while (global_circuitlist) {
  467. next = global_circuitlist->next;
  468. if (! CIRCUIT_IS_ORIGIN(global_circuitlist)) {
  469. or_circuit_t *or_circ = TO_OR_CIRCUIT(global_circuitlist);
  470. while (or_circ->resolving_streams) {
  471. edge_connection_t *next_conn;
  472. next_conn = or_circ->resolving_streams->next_stream;
  473. connection_free(TO_CONN(or_circ->resolving_streams));
  474. or_circ->resolving_streams = next_conn;
  475. }
  476. }
  477. circuit_free(global_circuitlist);
  478. global_circuitlist = next;
  479. }
  480. smartlist_free(circuits_pending_or_conns);
  481. circuits_pending_or_conns = NULL;
  482. HT_CLEAR(orconn_circid_map, &orconn_circid_circuit_map);
  483. }
  484. /** Deallocate space associated with the cpath node <b>victim</b>. */
  485. static void
  486. circuit_free_cpath_node(crypt_path_t *victim)
  487. {
  488. if (!victim)
  489. return;
  490. crypto_free_cipher_env(victim->f_crypto);
  491. crypto_free_cipher_env(victim->b_crypto);
  492. crypto_free_digest_env(victim->f_digest);
  493. crypto_free_digest_env(victim->b_digest);
  494. crypto_dh_free(victim->dh_handshake_state);
  495. extend_info_free(victim->extend_info);
  496. memset(victim, 0xBB, sizeof(crypt_path_t)); /* poison memory */
  497. tor_free(victim);
  498. }
  499. /** A helper function for circuit_dump_by_conn() below. Log a bunch
  500. * of information about circuit <b>circ</b>.
  501. */
  502. static void
  503. circuit_dump_details(int severity, circuit_t *circ, int conn_array_index,
  504. const char *type, int this_circid, int other_circid)
  505. {
  506. log(severity, LD_CIRC, "Conn %d has %s circuit: circID %d (other side %d), "
  507. "state %d (%s), born %d:",
  508. conn_array_index, type, this_circid, other_circid, circ->state,
  509. circuit_state_to_string(circ->state), (int)circ->timestamp_created);
  510. if (CIRCUIT_IS_ORIGIN(circ)) { /* circ starts at this node */
  511. circuit_log_path(severity, LD_CIRC, TO_ORIGIN_CIRCUIT(circ));
  512. }
  513. }
  514. /** Log, at severity <b>severity</b>, information about each circuit
  515. * that is connected to <b>conn</b>.
  516. */
  517. void
  518. circuit_dump_by_conn(connection_t *conn, int severity)
  519. {
  520. circuit_t *circ;
  521. edge_connection_t *tmpconn;
  522. for (circ=global_circuitlist;circ;circ = circ->next) {
  523. circid_t n_circ_id = circ->n_circ_id, p_circ_id = 0;
  524. if (circ->marked_for_close)
  525. continue;
  526. if (! CIRCUIT_IS_ORIGIN(circ))
  527. p_circ_id = TO_OR_CIRCUIT(circ)->p_circ_id;
  528. if (! CIRCUIT_IS_ORIGIN(circ) && TO_OR_CIRCUIT(circ)->p_conn &&
  529. TO_CONN(TO_OR_CIRCUIT(circ)->p_conn) == conn)
  530. circuit_dump_details(severity, circ, conn->conn_array_index, "App-ward",
  531. p_circ_id, n_circ_id);
  532. if (CIRCUIT_IS_ORIGIN(circ)) {
  533. for (tmpconn=TO_ORIGIN_CIRCUIT(circ)->p_streams; tmpconn;
  534. tmpconn=tmpconn->next_stream) {
  535. if (TO_CONN(tmpconn) == conn) {
  536. circuit_dump_details(severity, circ, conn->conn_array_index,
  537. "App-ward", p_circ_id, n_circ_id);
  538. }
  539. }
  540. }
  541. if (circ->n_conn && TO_CONN(circ->n_conn) == conn)
  542. circuit_dump_details(severity, circ, conn->conn_array_index, "Exit-ward",
  543. n_circ_id, p_circ_id);
  544. if (! CIRCUIT_IS_ORIGIN(circ)) {
  545. for (tmpconn=TO_OR_CIRCUIT(circ)->n_streams; tmpconn;
  546. tmpconn=tmpconn->next_stream) {
  547. if (TO_CONN(tmpconn) == conn) {
  548. circuit_dump_details(severity, circ, conn->conn_array_index,
  549. "Exit-ward", n_circ_id, p_circ_id);
  550. }
  551. }
  552. }
  553. if (!circ->n_conn && circ->n_hop &&
  554. tor_addr_eq(&circ->n_hop->addr, &conn->addr) &&
  555. circ->n_hop->port == conn->port &&
  556. conn->type == CONN_TYPE_OR &&
  557. !memcmp(TO_OR_CONN(conn)->identity_digest,
  558. circ->n_hop->identity_digest, DIGEST_LEN)) {
  559. circuit_dump_details(severity, circ, conn->conn_array_index,
  560. (circ->state == CIRCUIT_STATE_OPEN &&
  561. !CIRCUIT_IS_ORIGIN(circ)) ?
  562. "Endpoint" : "Pending",
  563. n_circ_id, p_circ_id);
  564. }
  565. }
  566. }
  567. /** Return the circuit whose global ID is <b>id</b>, or NULL if no
  568. * such circuit exists. */
  569. origin_circuit_t *
  570. circuit_get_by_global_id(uint32_t id)
  571. {
  572. circuit_t *circ;
  573. for (circ=global_circuitlist;circ;circ = circ->next) {
  574. if (CIRCUIT_IS_ORIGIN(circ) &&
  575. TO_ORIGIN_CIRCUIT(circ)->global_identifier == id) {
  576. if (circ->marked_for_close)
  577. return NULL;
  578. else
  579. return TO_ORIGIN_CIRCUIT(circ);
  580. }
  581. }
  582. return NULL;
  583. }
  584. /** Return a circ such that:
  585. * - circ-\>n_circ_id or circ-\>p_circ_id is equal to <b>circ_id</b>, and
  586. * - circ is attached to <b>conn</b>, either as p_conn or n_conn.
  587. * Return NULL if no such circuit exists.
  588. */
  589. static INLINE circuit_t *
  590. circuit_get_by_circid_orconn_impl(circid_t circ_id, or_connection_t *conn)
  591. {
  592. orconn_circid_circuit_map_t search;
  593. orconn_circid_circuit_map_t *found;
  594. if (_last_circid_orconn_ent &&
  595. circ_id == _last_circid_orconn_ent->circ_id &&
  596. conn == _last_circid_orconn_ent->or_conn) {
  597. found = _last_circid_orconn_ent;
  598. } else {
  599. search.circ_id = circ_id;
  600. search.or_conn = conn;
  601. found = HT_FIND(orconn_circid_map, &orconn_circid_circuit_map, &search);
  602. _last_circid_orconn_ent = found;
  603. }
  604. if (found && found->circuit)
  605. return found->circuit;
  606. return NULL;
  607. /* The rest of this checks for bugs. Disabled by default. */
  608. {
  609. circuit_t *circ;
  610. for (circ=global_circuitlist;circ;circ = circ->next) {
  611. if (! CIRCUIT_IS_ORIGIN(circ)) {
  612. or_circuit_t *or_circ = TO_OR_CIRCUIT(circ);
  613. if (or_circ->p_conn == conn && or_circ->p_circ_id == circ_id) {
  614. log_warn(LD_BUG,
  615. "circuit matches p_conn, but not in hash table (Bug!)");
  616. return circ;
  617. }
  618. }
  619. if (circ->n_conn == conn && circ->n_circ_id == circ_id) {
  620. log_warn(LD_BUG,
  621. "circuit matches n_conn, but not in hash table (Bug!)");
  622. return circ;
  623. }
  624. }
  625. return NULL;
  626. }
  627. }
  628. /** Return a circ such that:
  629. * - circ-\>n_circ_id or circ-\>p_circ_id is equal to <b>circ_id</b>, and
  630. * - circ is attached to <b>conn</b>, either as p_conn or n_conn.
  631. * - circ is not marked for close.
  632. * Return NULL if no such circuit exists.
  633. */
  634. circuit_t *
  635. circuit_get_by_circid_orconn(circid_t circ_id, or_connection_t *conn)
  636. {
  637. circuit_t *circ = circuit_get_by_circid_orconn_impl(circ_id, conn);
  638. if (!circ || circ->marked_for_close)
  639. return NULL;
  640. else
  641. return circ;
  642. }
  643. /** Return true iff the circuit ID <b>circ_id</b> is currently used by a
  644. * circuit, marked or not, on <b>conn</b>. */
  645. int
  646. circuit_id_in_use_on_orconn(circid_t circ_id, or_connection_t *conn)
  647. {
  648. return circuit_get_by_circid_orconn_impl(circ_id, conn) != NULL;
  649. }
  650. /** Return the circuit that a given edge connection is using. */
  651. circuit_t *
  652. circuit_get_by_edge_conn(edge_connection_t *conn)
  653. {
  654. circuit_t *circ;
  655. circ = conn->on_circuit;
  656. tor_assert(!circ ||
  657. (CIRCUIT_IS_ORIGIN(circ) ? circ->magic == ORIGIN_CIRCUIT_MAGIC
  658. : circ->magic == OR_CIRCUIT_MAGIC));
  659. return circ;
  660. }
  661. /** For each circuit that has <b>conn</b> as n_conn or p_conn, unlink the
  662. * circuit from the orconn,circid map, and mark it for close if it hasn't
  663. * been marked already.
  664. */
  665. void
  666. circuit_unlink_all_from_or_conn(or_connection_t *conn, int reason)
  667. {
  668. circuit_t *circ;
  669. connection_or_unlink_all_active_circs(conn);
  670. for (circ = global_circuitlist; circ; circ = circ->next) {
  671. int mark = 0;
  672. if (circ->n_conn == conn) {
  673. circuit_set_n_circid_orconn(circ, 0, NULL);
  674. mark = 1;
  675. }
  676. if (! CIRCUIT_IS_ORIGIN(circ)) {
  677. or_circuit_t *or_circ = TO_OR_CIRCUIT(circ);
  678. if (or_circ->p_conn == conn) {
  679. circuit_set_p_circid_orconn(or_circ, 0, NULL);
  680. mark = 1;
  681. }
  682. }
  683. if (mark && !circ->marked_for_close)
  684. circuit_mark_for_close(circ, reason);
  685. }
  686. }
  687. /** Return a circ such that:
  688. * - circ-\>rend_data-\>query is equal to <b>rend_query</b>, and
  689. * - circ-\>purpose is equal to <b>purpose</b>.
  690. *
  691. * Return NULL if no such circuit exists.
  692. */
  693. origin_circuit_t *
  694. circuit_get_by_rend_query_and_purpose(const char *rend_query, uint8_t purpose)
  695. {
  696. circuit_t *circ;
  697. tor_assert(CIRCUIT_PURPOSE_IS_ORIGIN(purpose));
  698. for (circ = global_circuitlist; circ; circ = circ->next) {
  699. if (!circ->marked_for_close &&
  700. circ->purpose == purpose) {
  701. origin_circuit_t *ocirc = TO_ORIGIN_CIRCUIT(circ);
  702. if (ocirc->rend_data &&
  703. !rend_cmp_service_ids(rend_query,
  704. ocirc->rend_data->onion_address))
  705. return ocirc;
  706. }
  707. }
  708. return NULL;
  709. }
  710. /** Return the first circuit originating here in global_circuitlist after
  711. * <b>start</b> whose purpose is <b>purpose</b>, and where
  712. * <b>digest</b> (if set) matches the rend_pk_digest field. Return NULL if no
  713. * circuit is found. If <b>start</b> is NULL, begin at the start of the list.
  714. */
  715. origin_circuit_t *
  716. circuit_get_next_by_pk_and_purpose(origin_circuit_t *start,
  717. const char *digest, uint8_t purpose)
  718. {
  719. circuit_t *circ;
  720. tor_assert(CIRCUIT_PURPOSE_IS_ORIGIN(purpose));
  721. if (start == NULL)
  722. circ = global_circuitlist;
  723. else
  724. circ = TO_CIRCUIT(start)->next;
  725. for ( ; circ; circ = circ->next) {
  726. if (circ->marked_for_close)
  727. continue;
  728. if (circ->purpose != purpose)
  729. continue;
  730. if (!digest)
  731. return TO_ORIGIN_CIRCUIT(circ);
  732. else if (TO_ORIGIN_CIRCUIT(circ)->rend_data &&
  733. !memcmp(TO_ORIGIN_CIRCUIT(circ)->rend_data->rend_pk_digest,
  734. digest, DIGEST_LEN))
  735. return TO_ORIGIN_CIRCUIT(circ);
  736. }
  737. return NULL;
  738. }
  739. /** Return the first OR circuit in the global list whose purpose is
  740. * <b>purpose</b>, and whose rend_token is the <b>len</b>-byte
  741. * <b>token</b>. */
  742. static or_circuit_t *
  743. circuit_get_by_rend_token_and_purpose(uint8_t purpose, const char *token,
  744. size_t len)
  745. {
  746. circuit_t *circ;
  747. for (circ = global_circuitlist; circ; circ = circ->next) {
  748. if (! circ->marked_for_close &&
  749. circ->purpose == purpose &&
  750. ! memcmp(TO_OR_CIRCUIT(circ)->rend_token, token, len))
  751. return TO_OR_CIRCUIT(circ);
  752. }
  753. return NULL;
  754. }
  755. /** Return the circuit waiting for a rendezvous with the provided cookie.
  756. * Return NULL if no such circuit is found.
  757. */
  758. or_circuit_t *
  759. circuit_get_rendezvous(const char *cookie)
  760. {
  761. return circuit_get_by_rend_token_and_purpose(
  762. CIRCUIT_PURPOSE_REND_POINT_WAITING,
  763. cookie, REND_COOKIE_LEN);
  764. }
  765. /** Return the circuit waiting for intro cells of the given digest.
  766. * Return NULL if no such circuit is found.
  767. */
  768. or_circuit_t *
  769. circuit_get_intro_point(const char *digest)
  770. {
  771. return circuit_get_by_rend_token_and_purpose(
  772. CIRCUIT_PURPOSE_INTRO_POINT, digest,
  773. DIGEST_LEN);
  774. }
  775. /** Return a circuit that is open, is CIRCUIT_PURPOSE_C_GENERAL,
  776. * has a timestamp_dirty value of 0, has flags matching the CIRCLAUNCH_*
  777. * flags in <b>flags</b>, and if info is defined, does not already use info
  778. * as any of its hops; or NULL if no circuit fits this description.
  779. *
  780. * The <b>purpose</b> argument (currently ignored) refers to the purpose of
  781. * the circuit we want to create, not the purpose of the circuit we want to
  782. * cannibalize.
  783. *
  784. * If !CIRCLAUNCH_NEED_UPTIME, prefer returning non-uptime circuits.
  785. */
  786. origin_circuit_t *
  787. circuit_find_to_cannibalize(uint8_t purpose, extend_info_t *info,
  788. int flags)
  789. {
  790. circuit_t *_circ;
  791. origin_circuit_t *best=NULL;
  792. int need_uptime = (flags & CIRCLAUNCH_NEED_UPTIME) != 0;
  793. int need_capacity = (flags & CIRCLAUNCH_NEED_CAPACITY) != 0;
  794. int internal = (flags & CIRCLAUNCH_IS_INTERNAL) != 0;
  795. log_debug(LD_CIRC,
  796. "Hunting for a circ to cannibalize: purpose %d, uptime %d, "
  797. "capacity %d, internal %d",
  798. purpose, need_uptime, need_capacity, internal);
  799. for (_circ=global_circuitlist; _circ; _circ = _circ->next) {
  800. if (CIRCUIT_IS_ORIGIN(_circ) &&
  801. _circ->state == CIRCUIT_STATE_OPEN &&
  802. !_circ->marked_for_close &&
  803. _circ->purpose == CIRCUIT_PURPOSE_C_GENERAL &&
  804. !_circ->timestamp_dirty) {
  805. origin_circuit_t *circ = TO_ORIGIN_CIRCUIT(_circ);
  806. if ((!need_uptime || circ->build_state->need_uptime) &&
  807. (!need_capacity || circ->build_state->need_capacity) &&
  808. (internal == circ->build_state->is_internal) &&
  809. circ->remaining_relay_early_cells) {
  810. if (info) {
  811. /* need to make sure we don't duplicate hops */
  812. crypt_path_t *hop = circ->cpath;
  813. routerinfo_t *ri1 = router_get_by_digest(info->identity_digest);
  814. do {
  815. routerinfo_t *ri2;
  816. if (!memcmp(hop->extend_info->identity_digest,
  817. info->identity_digest, DIGEST_LEN))
  818. goto next;
  819. if (ri1 &&
  820. (ri2 = router_get_by_digest(hop->extend_info->identity_digest))
  821. && routers_in_same_family(ri1, ri2))
  822. goto next;
  823. hop=hop->next;
  824. } while (hop!=circ->cpath);
  825. }
  826. if (!best || (best->build_state->need_uptime && !need_uptime))
  827. best = circ;
  828. next: ;
  829. }
  830. }
  831. }
  832. return best;
  833. }
  834. /** Return the number of hops in circuit's path. */
  835. int
  836. circuit_get_cpath_len(origin_circuit_t *circ)
  837. {
  838. int n = 0;
  839. if (circ && circ->cpath) {
  840. crypt_path_t *cpath, *cpath_next = NULL;
  841. for (cpath = circ->cpath; cpath_next != circ->cpath; cpath = cpath_next) {
  842. cpath_next = cpath->next;
  843. ++n;
  844. }
  845. }
  846. return n;
  847. }
  848. /** Return the <b>hopnum</b>th hop in <b>circ</b>->cpath, or NULL if there
  849. * aren't that many hops in the list. */
  850. crypt_path_t *
  851. circuit_get_cpath_hop(origin_circuit_t *circ, int hopnum)
  852. {
  853. if (circ && circ->cpath && hopnum > 0) {
  854. crypt_path_t *cpath, *cpath_next = NULL;
  855. for (cpath = circ->cpath; cpath_next != circ->cpath; cpath = cpath_next) {
  856. cpath_next = cpath->next;
  857. if (--hopnum <= 0)
  858. return cpath;
  859. }
  860. }
  861. return NULL;
  862. }
  863. /** Go through the circuitlist; mark-for-close each circuit that starts
  864. * at us but has not yet been used. */
  865. void
  866. circuit_mark_all_unused_circs(void)
  867. {
  868. circuit_t *circ;
  869. for (circ=global_circuitlist; circ; circ = circ->next) {
  870. if (CIRCUIT_IS_ORIGIN(circ) &&
  871. !circ->marked_for_close &&
  872. !circ->timestamp_dirty)
  873. circuit_mark_for_close(circ, END_CIRC_REASON_FINISHED);
  874. }
  875. }
  876. /** Go through the circuitlist; for each circuit that starts at us
  877. * and is dirty, frob its timestamp_dirty so we won't use it for any
  878. * new streams.
  879. *
  880. * This is useful for letting the user change pseudonyms, so new
  881. * streams will not be linkable to old streams.
  882. */
  883. void
  884. circuit_expire_all_dirty_circs(void)
  885. {
  886. circuit_t *circ;
  887. or_options_t *options = get_options();
  888. for (circ=global_circuitlist; circ; circ = circ->next) {
  889. if (CIRCUIT_IS_ORIGIN(circ) &&
  890. !circ->marked_for_close &&
  891. circ->timestamp_dirty)
  892. circ->timestamp_dirty -= options->MaxCircuitDirtiness;
  893. }
  894. }
  895. /** Mark <b>circ</b> to be closed next time we call
  896. * circuit_close_all_marked(). Do any cleanup needed:
  897. * - If state is onionskin_pending, remove circ from the onion_pending
  898. * list.
  899. * - If circ isn't open yet: call circuit_build_failed() if we're
  900. * the origin, and in either case call circuit_rep_hist_note_result()
  901. * to note stats.
  902. * - If purpose is C_INTRODUCE_ACK_WAIT, remove the intro point we
  903. * just tried from our list of intro points for that service
  904. * descriptor.
  905. * - Send appropriate destroys and edge_destroys for conns and
  906. * streams attached to circ.
  907. * - If circ->rend_splice is set (we are the midpoint of a joined
  908. * rendezvous stream), then mark the other circuit to close as well.
  909. */
  910. void
  911. _circuit_mark_for_close(circuit_t *circ, int reason, int line,
  912. const char *file)
  913. {
  914. int orig_reason = reason; /* Passed to the controller */
  915. assert_circuit_ok(circ);
  916. tor_assert(line);
  917. tor_assert(file);
  918. if (circ->marked_for_close) {
  919. log(LOG_WARN,LD_BUG,
  920. "Duplicate call to circuit_mark_for_close at %s:%d"
  921. " (first at %s:%d)", file, line,
  922. circ->marked_for_close_file, circ->marked_for_close);
  923. return;
  924. }
  925. if (reason == END_CIRC_AT_ORIGIN) {
  926. if (!CIRCUIT_IS_ORIGIN(circ)) {
  927. log_warn(LD_BUG, "Specified 'at-origin' non-reason for ending circuit, "
  928. "but circuit was not at origin. (called %s:%d, purpose=%d)",
  929. file, line, circ->purpose);
  930. }
  931. reason = END_CIRC_REASON_NONE;
  932. }
  933. if (CIRCUIT_IS_ORIGIN(circ)) {
  934. /* We don't send reasons when closing circuits at the origin. */
  935. reason = END_CIRC_REASON_NONE;
  936. }
  937. if (reason & END_CIRC_REASON_FLAG_REMOTE)
  938. reason &= ~END_CIRC_REASON_FLAG_REMOTE;
  939. if (reason < _END_CIRC_REASON_MIN || reason > _END_CIRC_REASON_MAX) {
  940. if (!(orig_reason & END_CIRC_REASON_FLAG_REMOTE))
  941. log_warn(LD_BUG, "Reason %d out of range at %s:%d", reason, file, line);
  942. reason = END_CIRC_REASON_NONE;
  943. }
  944. if (circ->state == CIRCUIT_STATE_ONIONSKIN_PENDING) {
  945. onion_pending_remove(TO_OR_CIRCUIT(circ));
  946. }
  947. /* If the circuit ever became OPEN, we sent it to the reputation history
  948. * module then. If it isn't OPEN, we send it there now to remember which
  949. * links worked and which didn't.
  950. */
  951. if (circ->state != CIRCUIT_STATE_OPEN) {
  952. if (CIRCUIT_IS_ORIGIN(circ)) {
  953. origin_circuit_t *ocirc = TO_ORIGIN_CIRCUIT(circ);
  954. circuit_build_failed(ocirc); /* take actions if necessary */
  955. circuit_rep_hist_note_result(ocirc);
  956. }
  957. }
  958. if (circ->state == CIRCUIT_STATE_OR_WAIT) {
  959. if (circuits_pending_or_conns)
  960. smartlist_remove(circuits_pending_or_conns, circ);
  961. }
  962. if (CIRCUIT_IS_ORIGIN(circ)) {
  963. control_event_circuit_status(TO_ORIGIN_CIRCUIT(circ),
  964. (circ->state == CIRCUIT_STATE_OPEN)?CIRC_EVENT_CLOSED:CIRC_EVENT_FAILED,
  965. orig_reason);
  966. }
  967. if (circ->purpose == CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT) {
  968. origin_circuit_t *ocirc = TO_ORIGIN_CIRCUIT(circ);
  969. tor_assert(circ->state == CIRCUIT_STATE_OPEN);
  970. tor_assert(ocirc->build_state->chosen_exit);
  971. tor_assert(ocirc->rend_data);
  972. /* treat this like getting a nack from it */
  973. log_info(LD_REND, "Failed intro circ %s to %s (awaiting ack). "
  974. "Removing from descriptor.",
  975. safe_str_client(ocirc->rend_data->onion_address),
  976. safe_str_client(build_state_get_exit_nickname(ocirc->build_state)));
  977. rend_client_remove_intro_point(ocirc->build_state->chosen_exit,
  978. ocirc->rend_data);
  979. }
  980. if (circ->n_conn)
  981. connection_or_send_destroy(circ->n_circ_id, circ->n_conn, reason);
  982. if (! CIRCUIT_IS_ORIGIN(circ)) {
  983. or_circuit_t *or_circ = TO_OR_CIRCUIT(circ);
  984. edge_connection_t *conn;
  985. for (conn=or_circ->n_streams; conn; conn=conn->next_stream)
  986. connection_edge_destroy(or_circ->p_circ_id, conn);
  987. or_circ->n_streams = NULL;
  988. while (or_circ->resolving_streams) {
  989. conn = or_circ->resolving_streams;
  990. or_circ->resolving_streams = conn->next_stream;
  991. if (!conn->_base.marked_for_close) {
  992. /* The client will see a DESTROY, and infer that the connections
  993. * are closing because the circuit is getting torn down. No need
  994. * to send an end cell. */
  995. conn->edge_has_sent_end = 1;
  996. conn->end_reason = END_STREAM_REASON_DESTROY;
  997. conn->end_reason |= END_STREAM_REASON_FLAG_ALREADY_SENT_CLOSED;
  998. connection_mark_for_close(TO_CONN(conn));
  999. }
  1000. conn->on_circuit = NULL;
  1001. }
  1002. if (or_circ->p_conn)
  1003. connection_or_send_destroy(or_circ->p_circ_id, or_circ->p_conn, reason);
  1004. } else {
  1005. origin_circuit_t *ocirc = TO_ORIGIN_CIRCUIT(circ);
  1006. edge_connection_t *conn;
  1007. for (conn=ocirc->p_streams; conn; conn=conn->next_stream)
  1008. connection_edge_destroy(circ->n_circ_id, conn);
  1009. ocirc->p_streams = NULL;
  1010. }
  1011. circ->marked_for_close = line;
  1012. circ->marked_for_close_file = file;
  1013. if (!CIRCUIT_IS_ORIGIN(circ)) {
  1014. or_circuit_t *or_circ = TO_OR_CIRCUIT(circ);
  1015. if (or_circ->rend_splice) {
  1016. if (!or_circ->rend_splice->_base.marked_for_close) {
  1017. /* do this after marking this circuit, to avoid infinite recursion. */
  1018. circuit_mark_for_close(TO_CIRCUIT(or_circ->rend_splice), reason);
  1019. }
  1020. or_circ->rend_splice = NULL;
  1021. }
  1022. }
  1023. }
  1024. /** Verify that cpath layer <b>cp</b> has all of its invariants
  1025. * correct. Trigger an assert if anything is invalid.
  1026. */
  1027. void
  1028. assert_cpath_layer_ok(const crypt_path_t *cp)
  1029. {
  1030. // tor_assert(cp->addr); /* these are zero for rendezvous extra-hops */
  1031. // tor_assert(cp->port);
  1032. tor_assert(cp);
  1033. tor_assert(cp->magic == CRYPT_PATH_MAGIC);
  1034. switch (cp->state)
  1035. {
  1036. case CPATH_STATE_OPEN:
  1037. tor_assert(cp->f_crypto);
  1038. tor_assert(cp->b_crypto);
  1039. /* fall through */
  1040. case CPATH_STATE_CLOSED:
  1041. tor_assert(!cp->dh_handshake_state);
  1042. break;
  1043. case CPATH_STATE_AWAITING_KEYS:
  1044. /* tor_assert(cp->dh_handshake_state); */
  1045. break;
  1046. default:
  1047. log_fn(LOG_ERR, LD_BUG, "Unexpected state %d", cp->state);
  1048. tor_assert(0);
  1049. }
  1050. tor_assert(cp->package_window >= 0);
  1051. tor_assert(cp->deliver_window >= 0);
  1052. }
  1053. /** Verify that cpath <b>cp</b> has all of its invariants
  1054. * correct. Trigger an assert if anything is invalid.
  1055. */
  1056. static void
  1057. assert_cpath_ok(const crypt_path_t *cp)
  1058. {
  1059. const crypt_path_t *start = cp;
  1060. do {
  1061. assert_cpath_layer_ok(cp);
  1062. /* layers must be in sequence of: "open* awaiting? closed*" */
  1063. if (cp != start) {
  1064. if (cp->state == CPATH_STATE_AWAITING_KEYS) {
  1065. tor_assert(cp->prev->state == CPATH_STATE_OPEN);
  1066. } else if (cp->state == CPATH_STATE_OPEN) {
  1067. tor_assert(cp->prev->state == CPATH_STATE_OPEN);
  1068. }
  1069. }
  1070. cp = cp->next;
  1071. tor_assert(cp);
  1072. } while (cp != start);
  1073. }
  1074. /** Verify that circuit <b>c</b> has all of its invariants
  1075. * correct. Trigger an assert if anything is invalid.
  1076. */
  1077. void
  1078. assert_circuit_ok(const circuit_t *c)
  1079. {
  1080. edge_connection_t *conn;
  1081. const or_circuit_t *or_circ = NULL;
  1082. const origin_circuit_t *origin_circ = NULL;
  1083. tor_assert(c);
  1084. tor_assert(c->magic == ORIGIN_CIRCUIT_MAGIC || c->magic == OR_CIRCUIT_MAGIC);
  1085. tor_assert(c->purpose >= _CIRCUIT_PURPOSE_MIN &&
  1086. c->purpose <= _CIRCUIT_PURPOSE_MAX);
  1087. {
  1088. /* Having a separate variable for this pleases GCC 4.2 in ways I hope I
  1089. * never understand. -NM. */
  1090. circuit_t *nonconst_circ = (circuit_t*) c;
  1091. if (CIRCUIT_IS_ORIGIN(c))
  1092. origin_circ = TO_ORIGIN_CIRCUIT(nonconst_circ);
  1093. else
  1094. or_circ = TO_OR_CIRCUIT(nonconst_circ);
  1095. }
  1096. if (c->n_conn) {
  1097. tor_assert(!c->n_hop);
  1098. if (c->n_circ_id) {
  1099. /* We use the _impl variant here to make sure we don't fail on marked
  1100. * circuits, which would not be returned by the regular function. */
  1101. circuit_t *c2 = circuit_get_by_circid_orconn_impl(c->n_circ_id,
  1102. c->n_conn);
  1103. tor_assert(c == c2);
  1104. }
  1105. }
  1106. if (or_circ && or_circ->p_conn) {
  1107. if (or_circ->p_circ_id) {
  1108. /* ibid */
  1109. circuit_t *c2 = circuit_get_by_circid_orconn_impl(or_circ->p_circ_id,
  1110. or_circ->p_conn);
  1111. tor_assert(c == c2);
  1112. }
  1113. }
  1114. if (or_circ)
  1115. for (conn = or_circ->n_streams; conn; conn = conn->next_stream)
  1116. tor_assert(conn->_base.type == CONN_TYPE_EXIT);
  1117. tor_assert(c->deliver_window >= 0);
  1118. tor_assert(c->package_window >= 0);
  1119. if (c->state == CIRCUIT_STATE_OPEN) {
  1120. tor_assert(!c->n_conn_onionskin);
  1121. if (or_circ) {
  1122. tor_assert(or_circ->n_crypto);
  1123. tor_assert(or_circ->p_crypto);
  1124. tor_assert(or_circ->n_digest);
  1125. tor_assert(or_circ->p_digest);
  1126. }
  1127. }
  1128. if (c->state == CIRCUIT_STATE_OR_WAIT && !c->marked_for_close) {
  1129. tor_assert(circuits_pending_or_conns &&
  1130. smartlist_isin(circuits_pending_or_conns, c));
  1131. } else {
  1132. tor_assert(!circuits_pending_or_conns ||
  1133. !smartlist_isin(circuits_pending_or_conns, c));
  1134. }
  1135. if (origin_circ && origin_circ->cpath) {
  1136. assert_cpath_ok(origin_circ->cpath);
  1137. }
  1138. if (c->purpose == CIRCUIT_PURPOSE_REND_ESTABLISHED) {
  1139. tor_assert(or_circ);
  1140. if (!c->marked_for_close) {
  1141. tor_assert(or_circ->rend_splice);
  1142. tor_assert(or_circ->rend_splice->rend_splice == or_circ);
  1143. }
  1144. tor_assert(or_circ->rend_splice != or_circ);
  1145. } else {
  1146. tor_assert(!or_circ || !or_circ->rend_splice);
  1147. }
  1148. }