circuitlist.c 37 KB

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