relay.c 76 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188
  1. /* Copyright (c) 2001 Matej Pfajfar.
  2. * Copyright (c) 2001-2004, Roger Dingledine.
  3. * Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
  4. * Copyright (c) 2007-2009, The Tor Project, Inc. */
  5. /* See LICENSE for licensing information */
  6. /**
  7. * \file relay.c
  8. * \brief Handle relay cell encryption/decryption, plus packaging and
  9. * receiving from circuits, plus queuing on circuits.
  10. **/
  11. #include <math.h>
  12. #include "or.h"
  13. #include "mempool.h"
  14. static int relay_crypt(circuit_t *circ, cell_t *cell,
  15. cell_direction_t cell_direction,
  16. crypt_path_t **layer_hint, char *recognized);
  17. static edge_connection_t *relay_lookup_conn(circuit_t *circ, cell_t *cell,
  18. cell_direction_t cell_direction,
  19. crypt_path_t *layer_hint);
  20. static int
  21. connection_edge_process_relay_cell(cell_t *cell, circuit_t *circ,
  22. edge_connection_t *conn,
  23. crypt_path_t *layer_hint);
  24. static void
  25. circuit_consider_sending_sendme(circuit_t *circ, crypt_path_t *layer_hint);
  26. static void
  27. circuit_resume_edge_reading(circuit_t *circ, crypt_path_t *layer_hint);
  28. static int
  29. circuit_resume_edge_reading_helper(edge_connection_t *conn,
  30. circuit_t *circ,
  31. crypt_path_t *layer_hint);
  32. static int
  33. circuit_consider_stop_edge_reading(circuit_t *circ, crypt_path_t *layer_hint);
  34. /** Cache the current hi-res time; the cache gets reset when libevent
  35. * calls us. */
  36. static struct timeval cached_time_hires = {0, 0};
  37. static void
  38. tor_gettimeofday_cached(struct timeval *tv)
  39. {
  40. if (cached_time_hires.tv_sec == 0) {
  41. tor_gettimeofday(&cached_time_hires);
  42. }
  43. *tv = cached_time_hires;
  44. }
  45. void
  46. tor_gettimeofday_cache_clear(void)
  47. {
  48. cached_time_hires.tv_sec = 0;
  49. }
  50. /** Stats: how many relay cells have originated at this hop, or have
  51. * been relayed onward (not recognized at this hop)?
  52. */
  53. uint64_t stats_n_relay_cells_relayed = 0;
  54. /** Stats: how many relay cells have been delivered to streams at this
  55. * hop?
  56. */
  57. uint64_t stats_n_relay_cells_delivered = 0;
  58. /** Update digest from the payload of cell. Assign integrity part to
  59. * cell.
  60. */
  61. static void
  62. relay_set_digest(crypto_digest_env_t *digest, cell_t *cell)
  63. {
  64. char integrity[4];
  65. relay_header_t rh;
  66. crypto_digest_add_bytes(digest, cell->payload, CELL_PAYLOAD_SIZE);
  67. crypto_digest_get_digest(digest, integrity, 4);
  68. // log_fn(LOG_DEBUG,"Putting digest of %u %u %u %u into relay cell.",
  69. // integrity[0], integrity[1], integrity[2], integrity[3]);
  70. relay_header_unpack(&rh, cell->payload);
  71. memcpy(rh.integrity, integrity, 4);
  72. relay_header_pack(cell->payload, &rh);
  73. }
  74. /** Does the digest for this circuit indicate that this cell is for us?
  75. *
  76. * Update digest from the payload of cell (with the integrity part set
  77. * to 0). If the integrity part is valid, return 1, else restore digest
  78. * and cell to their original state and return 0.
  79. */
  80. static int
  81. relay_digest_matches(crypto_digest_env_t *digest, cell_t *cell)
  82. {
  83. char received_integrity[4], calculated_integrity[4];
  84. relay_header_t rh;
  85. crypto_digest_env_t *backup_digest=NULL;
  86. backup_digest = crypto_digest_dup(digest);
  87. relay_header_unpack(&rh, cell->payload);
  88. memcpy(received_integrity, rh.integrity, 4);
  89. memset(rh.integrity, 0, 4);
  90. relay_header_pack(cell->payload, &rh);
  91. // log_fn(LOG_DEBUG,"Reading digest of %u %u %u %u from relay cell.",
  92. // received_integrity[0], received_integrity[1],
  93. // received_integrity[2], received_integrity[3]);
  94. crypto_digest_add_bytes(digest, cell->payload, CELL_PAYLOAD_SIZE);
  95. crypto_digest_get_digest(digest, calculated_integrity, 4);
  96. if (memcmp(received_integrity, calculated_integrity, 4)) {
  97. // log_fn(LOG_INFO,"Recognized=0 but bad digest. Not recognizing.");
  98. // (%d vs %d).", received_integrity, calculated_integrity);
  99. /* restore digest to its old form */
  100. crypto_digest_assign(digest, backup_digest);
  101. /* restore the relay header */
  102. memcpy(rh.integrity, received_integrity, 4);
  103. relay_header_pack(cell->payload, &rh);
  104. crypto_free_digest_env(backup_digest);
  105. return 0;
  106. }
  107. crypto_free_digest_env(backup_digest);
  108. return 1;
  109. }
  110. /** Apply <b>cipher</b> to CELL_PAYLOAD_SIZE bytes of <b>in</b>
  111. * (in place).
  112. *
  113. * If <b>encrypt_mode</b> is 1 then encrypt, else decrypt.
  114. *
  115. * Return -1 if the crypto fails, else return 0.
  116. */
  117. static int
  118. relay_crypt_one_payload(crypto_cipher_env_t *cipher, char *in,
  119. int encrypt_mode)
  120. {
  121. int r;
  122. (void)encrypt_mode;
  123. r = crypto_cipher_crypt_inplace(cipher, in, CELL_PAYLOAD_SIZE);
  124. if (r) {
  125. log_warn(LD_BUG,"Error during relay encryption");
  126. return -1;
  127. }
  128. return 0;
  129. }
  130. /** Receive a relay cell:
  131. * - Crypt it (encrypt if headed toward the origin or if we <b>are</b> the
  132. * origin; decrypt if we're headed toward the exit).
  133. * - Check if recognized (if exitward).
  134. * - If recognized and the digest checks out, then find if there's a stream
  135. * that the cell is intended for, and deliver it to the right
  136. * connection_edge.
  137. * - If not recognized, then we need to relay it: append it to the appropriate
  138. * cell_queue on <b>circ</b>.
  139. *
  140. * Return -<b>reason</b> on failure.
  141. */
  142. int
  143. circuit_receive_relay_cell(cell_t *cell, circuit_t *circ,
  144. cell_direction_t cell_direction)
  145. {
  146. or_connection_t *or_conn=NULL;
  147. crypt_path_t *layer_hint=NULL;
  148. char recognized=0;
  149. int reason;
  150. tor_assert(cell);
  151. tor_assert(circ);
  152. tor_assert(cell_direction == CELL_DIRECTION_OUT ||
  153. cell_direction == CELL_DIRECTION_IN);
  154. if (circ->marked_for_close)
  155. return 0;
  156. if (relay_crypt(circ, cell, cell_direction, &layer_hint, &recognized) < 0) {
  157. log_warn(LD_BUG,"relay crypt failed. Dropping connection.");
  158. return -END_CIRC_REASON_INTERNAL;
  159. }
  160. if (recognized) {
  161. edge_connection_t *conn = relay_lookup_conn(circ, cell, cell_direction,
  162. layer_hint);
  163. if (cell_direction == CELL_DIRECTION_OUT) {
  164. ++stats_n_relay_cells_delivered;
  165. log_debug(LD_OR,"Sending away from origin.");
  166. if ((reason=connection_edge_process_relay_cell(cell, circ, conn, NULL))
  167. < 0) {
  168. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  169. "connection_edge_process_relay_cell (away from origin) "
  170. "failed.");
  171. return reason;
  172. }
  173. }
  174. if (cell_direction == CELL_DIRECTION_IN) {
  175. ++stats_n_relay_cells_delivered;
  176. log_debug(LD_OR,"Sending to origin.");
  177. if ((reason = connection_edge_process_relay_cell(cell, circ, conn,
  178. layer_hint)) < 0) {
  179. log_warn(LD_OR,
  180. "connection_edge_process_relay_cell (at origin) failed.");
  181. return reason;
  182. }
  183. }
  184. return 0;
  185. }
  186. /* not recognized. pass it on. */
  187. if (cell_direction == CELL_DIRECTION_OUT) {
  188. cell->circ_id = circ->n_circ_id; /* switch it */
  189. or_conn = circ->n_conn;
  190. } else if (! CIRCUIT_IS_ORIGIN(circ)) {
  191. cell->circ_id = TO_OR_CIRCUIT(circ)->p_circ_id; /* switch it */
  192. or_conn = TO_OR_CIRCUIT(circ)->p_conn;
  193. } else {
  194. log_fn(LOG_PROTOCOL_WARN, LD_OR,
  195. "Dropping unrecognized inbound cell on origin circuit.");
  196. return 0;
  197. }
  198. if (!or_conn) {
  199. // XXXX Can this splice stuff be done more cleanly?
  200. if (! CIRCUIT_IS_ORIGIN(circ) &&
  201. TO_OR_CIRCUIT(circ)->rend_splice &&
  202. cell_direction == CELL_DIRECTION_OUT) {
  203. or_circuit_t *splice = TO_OR_CIRCUIT(circ)->rend_splice;
  204. tor_assert(circ->purpose == CIRCUIT_PURPOSE_REND_ESTABLISHED);
  205. tor_assert(splice->_base.purpose == CIRCUIT_PURPOSE_REND_ESTABLISHED);
  206. cell->circ_id = splice->p_circ_id;
  207. cell->command = CELL_RELAY; /* can't be relay_early anyway */
  208. if ((reason = circuit_receive_relay_cell(cell, TO_CIRCUIT(splice),
  209. CELL_DIRECTION_IN)) < 0) {
  210. log_warn(LD_REND, "Error relaying cell across rendezvous; closing "
  211. "circuits");
  212. /* XXXX Do this here, or just return -1? */
  213. circuit_mark_for_close(circ, -reason);
  214. return reason;
  215. }
  216. return 0;
  217. }
  218. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  219. "Didn't recognize cell, but circ stops here! Closing circ.");
  220. return -END_CIRC_REASON_TORPROTOCOL;
  221. }
  222. log_debug(LD_OR,"Passing on unrecognized cell.");
  223. ++stats_n_relay_cells_relayed; /* XXXX no longer quite accurate {cells}
  224. * we might kill the circ before we relay
  225. * the cells. */
  226. append_cell_to_circuit_queue(circ, or_conn, cell, cell_direction);
  227. return 0;
  228. }
  229. /** Do the appropriate en/decryptions for <b>cell</b> arriving on
  230. * <b>circ</b> in direction <b>cell_direction</b>.
  231. *
  232. * If cell_direction == CELL_DIRECTION_IN:
  233. * - If we're at the origin (we're the OP), for hops 1..N,
  234. * decrypt cell. If recognized, stop.
  235. * - Else (we're not the OP), encrypt one hop. Cell is not recognized.
  236. *
  237. * If cell_direction == CELL_DIRECTION_OUT:
  238. * - decrypt one hop. Check if recognized.
  239. *
  240. * If cell is recognized, set *recognized to 1, and set
  241. * *layer_hint to the hop that recognized it.
  242. *
  243. * Return -1 to indicate that we should mark the circuit for close,
  244. * else return 0.
  245. */
  246. static int
  247. relay_crypt(circuit_t *circ, cell_t *cell, cell_direction_t cell_direction,
  248. crypt_path_t **layer_hint, char *recognized)
  249. {
  250. relay_header_t rh;
  251. tor_assert(circ);
  252. tor_assert(cell);
  253. tor_assert(recognized);
  254. tor_assert(cell_direction == CELL_DIRECTION_IN ||
  255. cell_direction == CELL_DIRECTION_OUT);
  256. if (cell_direction == CELL_DIRECTION_IN) {
  257. if (CIRCUIT_IS_ORIGIN(circ)) { /* We're at the beginning of the circuit.
  258. * We'll want to do layered decrypts. */
  259. crypt_path_t *thishop, *cpath = TO_ORIGIN_CIRCUIT(circ)->cpath;
  260. thishop = cpath;
  261. if (thishop->state != CPATH_STATE_OPEN) {
  262. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  263. "Relay cell before first created cell? Closing.");
  264. return -1;
  265. }
  266. do { /* Remember: cpath is in forward order, that is, first hop first. */
  267. tor_assert(thishop);
  268. if (relay_crypt_one_payload(thishop->b_crypto, cell->payload, 0) < 0)
  269. return -1;
  270. relay_header_unpack(&rh, cell->payload);
  271. if (rh.recognized == 0) {
  272. /* it's possibly recognized. have to check digest to be sure. */
  273. if (relay_digest_matches(thishop->b_digest, cell)) {
  274. *recognized = 1;
  275. *layer_hint = thishop;
  276. return 0;
  277. }
  278. }
  279. thishop = thishop->next;
  280. } while (thishop != cpath && thishop->state == CPATH_STATE_OPEN);
  281. log_fn(LOG_PROTOCOL_WARN, LD_OR,
  282. "Incoming cell at client not recognized. Closing.");
  283. return -1;
  284. } else { /* we're in the middle. Just one crypt. */
  285. if (relay_crypt_one_payload(TO_OR_CIRCUIT(circ)->p_crypto,
  286. cell->payload, 1) < 0)
  287. return -1;
  288. // log_fn(LOG_DEBUG,"Skipping recognized check, because we're not "
  289. // "the client.");
  290. }
  291. } else /* cell_direction == CELL_DIRECTION_OUT */ {
  292. /* we're in the middle. Just one crypt. */
  293. if (relay_crypt_one_payload(TO_OR_CIRCUIT(circ)->n_crypto,
  294. cell->payload, 0) < 0)
  295. return -1;
  296. relay_header_unpack(&rh, cell->payload);
  297. if (rh.recognized == 0) {
  298. /* it's possibly recognized. have to check digest to be sure. */
  299. if (relay_digest_matches(TO_OR_CIRCUIT(circ)->n_digest, cell)) {
  300. *recognized = 1;
  301. return 0;
  302. }
  303. }
  304. }
  305. return 0;
  306. }
  307. /** Package a relay cell from an edge:
  308. * - Encrypt it to the right layer
  309. * - Append it to the appropriate cell_queue on <b>circ</b>.
  310. */
  311. static int
  312. circuit_package_relay_cell(cell_t *cell, circuit_t *circ,
  313. cell_direction_t cell_direction,
  314. crypt_path_t *layer_hint)
  315. {
  316. or_connection_t *conn; /* where to send the cell */
  317. if (cell_direction == CELL_DIRECTION_OUT) {
  318. crypt_path_t *thishop; /* counter for repeated crypts */
  319. conn = circ->n_conn;
  320. if (!CIRCUIT_IS_ORIGIN(circ) || !conn) {
  321. log_warn(LD_BUG,"outgoing relay cell has n_conn==NULL. Dropping.");
  322. return 0; /* just drop it */
  323. }
  324. relay_set_digest(layer_hint->f_digest, cell);
  325. thishop = layer_hint;
  326. /* moving from farthest to nearest hop */
  327. do {
  328. tor_assert(thishop);
  329. /* XXXX RD This is a bug, right? */
  330. log_debug(LD_OR,"crypting a layer of the relay cell.");
  331. if (relay_crypt_one_payload(thishop->f_crypto, cell->payload, 1) < 0) {
  332. return -1;
  333. }
  334. thishop = thishop->prev;
  335. } while (thishop != TO_ORIGIN_CIRCUIT(circ)->cpath->prev);
  336. } else { /* incoming cell */
  337. or_circuit_t *or_circ;
  338. if (CIRCUIT_IS_ORIGIN(circ)) {
  339. /* We should never package an _incoming_ cell from the circuit
  340. * origin; that means we messed up somewhere. */
  341. log_warn(LD_BUG,"incoming relay cell at origin circuit. Dropping.");
  342. assert_circuit_ok(circ);
  343. return 0; /* just drop it */
  344. }
  345. or_circ = TO_OR_CIRCUIT(circ);
  346. conn = or_circ->p_conn;
  347. relay_set_digest(or_circ->p_digest, cell);
  348. if (relay_crypt_one_payload(or_circ->p_crypto, cell->payload, 1) < 0)
  349. return -1;
  350. }
  351. ++stats_n_relay_cells_relayed;
  352. append_cell_to_circuit_queue(circ, conn, cell, cell_direction);
  353. return 0;
  354. }
  355. /** If cell's stream_id matches the stream_id of any conn that's
  356. * attached to circ, return that conn, else return NULL.
  357. */
  358. static edge_connection_t *
  359. relay_lookup_conn(circuit_t *circ, cell_t *cell,
  360. cell_direction_t cell_direction, crypt_path_t *layer_hint)
  361. {
  362. edge_connection_t *tmpconn;
  363. relay_header_t rh;
  364. relay_header_unpack(&rh, cell->payload);
  365. if (!rh.stream_id)
  366. return NULL;
  367. /* IN or OUT cells could have come from either direction, now
  368. * that we allow rendezvous *to* an OP.
  369. */
  370. if (CIRCUIT_IS_ORIGIN(circ)) {
  371. for (tmpconn = TO_ORIGIN_CIRCUIT(circ)->p_streams; tmpconn;
  372. tmpconn=tmpconn->next_stream) {
  373. if (rh.stream_id == tmpconn->stream_id &&
  374. !tmpconn->_base.marked_for_close &&
  375. tmpconn->cpath_layer == layer_hint) {
  376. log_debug(LD_APP,"found conn for stream %d.", rh.stream_id);
  377. return tmpconn;
  378. }
  379. }
  380. } else {
  381. for (tmpconn = TO_OR_CIRCUIT(circ)->n_streams; tmpconn;
  382. tmpconn=tmpconn->next_stream) {
  383. if (rh.stream_id == tmpconn->stream_id &&
  384. !tmpconn->_base.marked_for_close) {
  385. log_debug(LD_EXIT,"found conn for stream %d.", rh.stream_id);
  386. if (cell_direction == CELL_DIRECTION_OUT ||
  387. connection_edge_is_rendezvous_stream(tmpconn))
  388. return tmpconn;
  389. }
  390. }
  391. for (tmpconn = TO_OR_CIRCUIT(circ)->resolving_streams; tmpconn;
  392. tmpconn=tmpconn->next_stream) {
  393. if (rh.stream_id == tmpconn->stream_id &&
  394. !tmpconn->_base.marked_for_close) {
  395. log_debug(LD_EXIT,"found conn for stream %d.", rh.stream_id);
  396. return tmpconn;
  397. }
  398. }
  399. }
  400. return NULL; /* probably a begin relay cell */
  401. }
  402. /** Pack the relay_header_t host-order structure <b>src</b> into
  403. * network-order in the buffer <b>dest</b>. See tor-spec.txt for details
  404. * about the wire format.
  405. */
  406. void
  407. relay_header_pack(char *dest, const relay_header_t *src)
  408. {
  409. *(uint8_t*)(dest) = src->command;
  410. set_uint16(dest+1, htons(src->recognized));
  411. set_uint16(dest+3, htons(src->stream_id));
  412. memcpy(dest+5, src->integrity, 4);
  413. set_uint16(dest+9, htons(src->length));
  414. }
  415. /** Unpack the network-order buffer <b>src</b> into a host-order
  416. * relay_header_t structure <b>dest</b>.
  417. */
  418. void
  419. relay_header_unpack(relay_header_t *dest, const char *src)
  420. {
  421. dest->command = *(uint8_t*)(src);
  422. dest->recognized = ntohs(get_uint16(src+1));
  423. dest->stream_id = ntohs(get_uint16(src+3));
  424. memcpy(dest->integrity, src+5, 4);
  425. dest->length = ntohs(get_uint16(src+9));
  426. }
  427. /** Convert the relay <b>command</b> into a human-readable string. */
  428. static const char *
  429. relay_command_to_string(uint8_t command)
  430. {
  431. switch (command) {
  432. case RELAY_COMMAND_BEGIN: return "BEGIN";
  433. case RELAY_COMMAND_DATA: return "DATA";
  434. case RELAY_COMMAND_END: return "END";
  435. case RELAY_COMMAND_CONNECTED: return "CONNECTED";
  436. case RELAY_COMMAND_SENDME: return "SENDME";
  437. case RELAY_COMMAND_EXTEND: return "EXTEND";
  438. case RELAY_COMMAND_EXTENDED: return "EXTENDED";
  439. case RELAY_COMMAND_TRUNCATE: return "TRUNCATE";
  440. case RELAY_COMMAND_TRUNCATED: return "TRUNCATED";
  441. case RELAY_COMMAND_DROP: return "DROP";
  442. case RELAY_COMMAND_RESOLVE: return "RESOLVE";
  443. case RELAY_COMMAND_RESOLVED: return "RESOLVED";
  444. case RELAY_COMMAND_BEGIN_DIR: return "BEGIN_DIR";
  445. case RELAY_COMMAND_ESTABLISH_INTRO: return "ESTABLISH_INTRO";
  446. case RELAY_COMMAND_ESTABLISH_RENDEZVOUS: return "ESTABLISH_RENDEZVOUS";
  447. case RELAY_COMMAND_INTRODUCE1: return "INTRODUCE1";
  448. case RELAY_COMMAND_INTRODUCE2: return "INTRODUCE2";
  449. case RELAY_COMMAND_RENDEZVOUS1: return "RENDEZVOUS1";
  450. case RELAY_COMMAND_RENDEZVOUS2: return "RENDEZVOUS2";
  451. case RELAY_COMMAND_INTRO_ESTABLISHED: return "INTRO_ESTABLISHED";
  452. case RELAY_COMMAND_RENDEZVOUS_ESTABLISHED:
  453. return "RENDEZVOUS_ESTABLISHED";
  454. case RELAY_COMMAND_INTRODUCE_ACK: return "INTRODUCE_ACK";
  455. default: return "(unrecognized)";
  456. }
  457. }
  458. /** Make a relay cell out of <b>relay_command</b> and <b>payload</b>, and send
  459. * it onto the open circuit <b>circ</b>. <b>stream_id</b> is the ID on
  460. * <b>circ</b> for the stream that's sending the relay cell, or 0 if it's a
  461. * control cell. <b>cpath_layer</b> is NULL for OR->OP cells, or the
  462. * destination hop for OP->OR cells.
  463. *
  464. * If you can't send the cell, mark the circuit for close and return -1. Else
  465. * return 0.
  466. */
  467. int
  468. relay_send_command_from_edge(uint16_t stream_id, circuit_t *circ,
  469. uint8_t relay_command, const char *payload,
  470. size_t payload_len, crypt_path_t *cpath_layer)
  471. {
  472. cell_t cell;
  473. relay_header_t rh;
  474. cell_direction_t cell_direction;
  475. /* XXXX NM Split this function into a separate versions per circuit type? */
  476. tor_assert(circ);
  477. tor_assert(payload_len <= RELAY_PAYLOAD_SIZE);
  478. memset(&cell, 0, sizeof(cell_t));
  479. cell.command = CELL_RELAY;
  480. if (cpath_layer) {
  481. cell.circ_id = circ->n_circ_id;
  482. cell_direction = CELL_DIRECTION_OUT;
  483. } else if (! CIRCUIT_IS_ORIGIN(circ)) {
  484. cell.circ_id = TO_OR_CIRCUIT(circ)->p_circ_id;
  485. cell_direction = CELL_DIRECTION_IN;
  486. } else {
  487. return -1;
  488. }
  489. memset(&rh, 0, sizeof(rh));
  490. rh.command = relay_command;
  491. rh.stream_id = stream_id;
  492. rh.length = payload_len;
  493. relay_header_pack(cell.payload, &rh);
  494. if (payload_len)
  495. memcpy(cell.payload+RELAY_HEADER_SIZE, payload, payload_len);
  496. log_debug(LD_OR,"delivering %d cell %s.", relay_command,
  497. cell_direction == CELL_DIRECTION_OUT ? "forward" : "backward");
  498. /* If we are sending an END cell and this circuit is used for a tunneled
  499. * directory request, advance its state. */
  500. if (relay_command == RELAY_COMMAND_END && circ->dirreq_id)
  501. geoip_change_dirreq_state(circ->dirreq_id, DIRREQ_TUNNELED,
  502. DIRREQ_END_CELL_SENT);
  503. if (cell_direction == CELL_DIRECTION_OUT && circ->n_conn) {
  504. /* if we're using relaybandwidthrate, this conn wants priority */
  505. circ->n_conn->client_used = approx_time();
  506. }
  507. if (cell_direction == CELL_DIRECTION_OUT) {
  508. origin_circuit_t *origin_circ = TO_ORIGIN_CIRCUIT(circ);
  509. if (origin_circ->remaining_relay_early_cells > 0 &&
  510. (relay_command == RELAY_COMMAND_EXTEND ||
  511. (cpath_layer != origin_circ->cpath &&
  512. !CIRCUIT_PURPOSE_IS_ESTABLISHED_REND(circ->purpose)))) {
  513. /* If we've got any relay_early cells left, and we're sending
  514. * an extend cell or (we're not talking to the first hop and we're
  515. * not talking to a rendezvous circuit), use one of them.
  516. * Don't worry about the conn protocol version:
  517. * append_cell_to_circuit_queue will fix it up. */
  518. /* XXX For now, clients don't use RELAY_EARLY cells when sending
  519. * relay cells on rendezvous circuits. See bug 1038. Once no relays
  520. * (and thus no rendezvous points) are running 0.2.1.3-alpha through
  521. * 0.2.1.18, we can take out that exception. -RD */
  522. cell.command = CELL_RELAY_EARLY;
  523. --origin_circ->remaining_relay_early_cells;
  524. log_debug(LD_OR, "Sending a RELAY_EARLY cell; %d remaining.",
  525. (int)origin_circ->remaining_relay_early_cells);
  526. /* Memorize the command that is sent as RELAY_EARLY cell; helps debug
  527. * task 878. */
  528. origin_circ->relay_early_commands[
  529. origin_circ->relay_early_cells_sent++] = relay_command;
  530. } else if (relay_command == RELAY_COMMAND_EXTEND) {
  531. /* If no RELAY_EARLY cells can be sent over this circuit, log which
  532. * commands have been sent as RELAY_EARLY cells before; helps debug
  533. * task 878. */
  534. smartlist_t *commands_list = smartlist_create();
  535. int i = 0;
  536. char *commands = NULL;
  537. for (; i < origin_circ->relay_early_cells_sent; i++)
  538. smartlist_add(commands_list, (char *)
  539. relay_command_to_string(origin_circ->relay_early_commands[i]));
  540. commands = smartlist_join_strings(commands_list, ",", 0, NULL);
  541. log_warn(LD_BUG, "Uh-oh. We're sending a RELAY_COMMAND_EXTEND cell, "
  542. "but we have run out of RELAY_EARLY cells on that circuit. "
  543. "Commands sent before: %s", commands);
  544. tor_free(commands);
  545. smartlist_free(commands_list);
  546. }
  547. }
  548. if (circuit_package_relay_cell(&cell, circ, cell_direction, cpath_layer)
  549. < 0) {
  550. log_warn(LD_BUG,"circuit_package_relay_cell failed. Closing.");
  551. circuit_mark_for_close(circ, END_CIRC_REASON_INTERNAL);
  552. return -1;
  553. }
  554. return 0;
  555. }
  556. /** Make a relay cell out of <b>relay_command</b> and <b>payload</b>, and
  557. * send it onto the open circuit <b>circ</b>. <b>fromconn</b> is the stream
  558. * that's sending the relay cell, or NULL if it's a control cell.
  559. * <b>cpath_layer</b> is NULL for OR->OP cells, or the destination hop
  560. * for OP->OR cells.
  561. *
  562. * If you can't send the cell, mark the circuit for close and
  563. * return -1. Else return 0.
  564. */
  565. int
  566. connection_edge_send_command(edge_connection_t *fromconn,
  567. uint8_t relay_command, const char *payload,
  568. size_t payload_len)
  569. {
  570. /* XXXX NM Split this function into a separate versions per circuit type? */
  571. circuit_t *circ;
  572. tor_assert(fromconn);
  573. circ = fromconn->on_circuit;
  574. if (fromconn->_base.marked_for_close) {
  575. log_warn(LD_BUG,
  576. "called on conn that's already marked for close at %s:%d.",
  577. fromconn->_base.marked_for_close_file,
  578. fromconn->_base.marked_for_close);
  579. return 0;
  580. }
  581. if (!circ) {
  582. if (fromconn->_base.type == CONN_TYPE_AP) {
  583. log_info(LD_APP,"no circ. Closing conn.");
  584. connection_mark_unattached_ap(fromconn, END_STREAM_REASON_INTERNAL);
  585. } else {
  586. log_info(LD_EXIT,"no circ. Closing conn.");
  587. fromconn->edge_has_sent_end = 1; /* no circ to send to */
  588. fromconn->end_reason = END_STREAM_REASON_INTERNAL;
  589. connection_mark_for_close(TO_CONN(fromconn));
  590. }
  591. return -1;
  592. }
  593. return relay_send_command_from_edge(fromconn->stream_id, circ,
  594. relay_command, payload,
  595. payload_len, fromconn->cpath_layer);
  596. }
  597. /** How many times will I retry a stream that fails due to DNS
  598. * resolve failure or misc error?
  599. */
  600. #define MAX_RESOLVE_FAILURES 3
  601. /** Return 1 if reason is something that you should retry if you
  602. * get the end cell before you've connected; else return 0. */
  603. static int
  604. edge_reason_is_retriable(int reason)
  605. {
  606. return reason == END_STREAM_REASON_HIBERNATING ||
  607. reason == END_STREAM_REASON_RESOURCELIMIT ||
  608. reason == END_STREAM_REASON_EXITPOLICY ||
  609. reason == END_STREAM_REASON_RESOLVEFAILED ||
  610. reason == END_STREAM_REASON_MISC;
  611. }
  612. /** Called when we receive an END cell on a stream that isn't open yet,
  613. * from the client side.
  614. * Arguments are as for connection_edge_process_relay_cell().
  615. */
  616. static int
  617. connection_ap_process_end_not_open(
  618. relay_header_t *rh, cell_t *cell, origin_circuit_t *circ,
  619. edge_connection_t *conn, crypt_path_t *layer_hint)
  620. {
  621. struct in_addr in;
  622. routerinfo_t *exitrouter;
  623. int reason = *(cell->payload+RELAY_HEADER_SIZE);
  624. int control_reason = reason | END_STREAM_REASON_FLAG_REMOTE;
  625. (void) layer_hint; /* unused */
  626. if (rh->length > 0 && edge_reason_is_retriable(reason) &&
  627. !connection_edge_is_rendezvous_stream(conn) /* avoid retry if rend */
  628. ) {
  629. log_info(LD_APP,"Address '%s' refused due to '%s'. Considering retrying.",
  630. safe_str(conn->socks_request->address),
  631. stream_end_reason_to_string(reason));
  632. exitrouter =
  633. router_get_by_digest(circ->build_state->chosen_exit->identity_digest);
  634. switch (reason) {
  635. case END_STREAM_REASON_EXITPOLICY:
  636. if (rh->length >= 5) {
  637. uint32_t addr = ntohl(get_uint32(cell->payload+RELAY_HEADER_SIZE+1));
  638. int ttl;
  639. if (!addr) {
  640. log_info(LD_APP,"Address '%s' resolved to 0.0.0.0. Closing,",
  641. safe_str(conn->socks_request->address));
  642. connection_mark_unattached_ap(conn, END_STREAM_REASON_TORPROTOCOL);
  643. return 0;
  644. }
  645. if (rh->length >= 9)
  646. ttl = (int)ntohl(get_uint32(cell->payload+RELAY_HEADER_SIZE+5));
  647. else
  648. ttl = -1;
  649. if (get_options()->ClientDNSRejectInternalAddresses &&
  650. is_internal_IP(addr, 0)) {
  651. log_info(LD_APP,"Address '%s' resolved to internal. Closing,",
  652. safe_str(conn->socks_request->address));
  653. connection_mark_unattached_ap(conn, END_STREAM_REASON_TORPROTOCOL);
  654. return 0;
  655. }
  656. client_dns_set_addressmap(conn->socks_request->address, addr,
  657. conn->chosen_exit_name, ttl);
  658. }
  659. /* check if he *ought* to have allowed it */
  660. if (exitrouter &&
  661. (rh->length < 5 ||
  662. (tor_inet_aton(conn->socks_request->address, &in) &&
  663. !conn->chosen_exit_name))) {
  664. log_info(LD_APP,
  665. "Exitrouter '%s' seems to be more restrictive than its exit "
  666. "policy. Not using this router as exit for now.",
  667. exitrouter->nickname);
  668. policies_set_router_exitpolicy_to_reject_all(exitrouter);
  669. }
  670. /* rewrite it to an IP if we learned one. */
  671. if (addressmap_rewrite(conn->socks_request->address,
  672. sizeof(conn->socks_request->address),
  673. NULL)) {
  674. control_event_stream_status(conn, STREAM_EVENT_REMAP, 0);
  675. }
  676. if (conn->chosen_exit_optional ||
  677. conn->chosen_exit_retries) {
  678. /* stop wanting a specific exit */
  679. conn->chosen_exit_optional = 0;
  680. /* A non-zero chosen_exit_retries can happen if we set a
  681. * TrackHostExits for this address under a port that the exit
  682. * relay allows, but then try the same address with a different
  683. * port that it doesn't allow to exit. We shouldn't unregister
  684. * the mapping, since it is probably still wanted on the
  685. * original port. But now we give away to the exit relay that
  686. * we probably have a TrackHostExits on it. So be it. */
  687. conn->chosen_exit_retries = 0;
  688. tor_free(conn->chosen_exit_name); /* clears it */
  689. }
  690. if (connection_ap_detach_retriable(conn, circ, control_reason) >= 0)
  691. return 0;
  692. /* else, conn will get closed below */
  693. break;
  694. case END_STREAM_REASON_CONNECTREFUSED:
  695. if (!conn->chosen_exit_optional)
  696. break; /* break means it'll close, below */
  697. /* Else fall through: expire this circuit, clear the
  698. * chosen_exit_name field, and try again. */
  699. case END_STREAM_REASON_RESOLVEFAILED:
  700. case END_STREAM_REASON_TIMEOUT:
  701. case END_STREAM_REASON_MISC:
  702. if (client_dns_incr_failures(conn->socks_request->address)
  703. < MAX_RESOLVE_FAILURES) {
  704. /* We haven't retried too many times; reattach the connection. */
  705. circuit_log_path(LOG_INFO,LD_APP,circ);
  706. tor_assert(circ->_base.timestamp_dirty);
  707. circ->_base.timestamp_dirty -= get_options()->MaxCircuitDirtiness;
  708. if (conn->chosen_exit_optional) {
  709. /* stop wanting a specific exit */
  710. conn->chosen_exit_optional = 0;
  711. tor_free(conn->chosen_exit_name); /* clears it */
  712. }
  713. if (connection_ap_detach_retriable(conn, circ, control_reason) >= 0)
  714. return 0;
  715. /* else, conn will get closed below */
  716. } else {
  717. log_notice(LD_APP,
  718. "Have tried resolving or connecting to address '%s' "
  719. "at %d different places. Giving up.",
  720. safe_str(conn->socks_request->address),
  721. MAX_RESOLVE_FAILURES);
  722. /* clear the failures, so it will have a full try next time */
  723. client_dns_clear_failures(conn->socks_request->address);
  724. }
  725. break;
  726. case END_STREAM_REASON_HIBERNATING:
  727. case END_STREAM_REASON_RESOURCELIMIT:
  728. if (exitrouter) {
  729. policies_set_router_exitpolicy_to_reject_all(exitrouter);
  730. }
  731. if (conn->chosen_exit_optional) {
  732. /* stop wanting a specific exit */
  733. conn->chosen_exit_optional = 0;
  734. tor_free(conn->chosen_exit_name); /* clears it */
  735. }
  736. if (connection_ap_detach_retriable(conn, circ, control_reason) >= 0)
  737. return 0;
  738. /* else, will close below */
  739. break;
  740. } /* end switch */
  741. log_info(LD_APP,"Giving up on retrying; conn can't be handled.");
  742. }
  743. log_info(LD_APP,
  744. "Edge got end (%s) before we're connected. Marking for close.",
  745. stream_end_reason_to_string(rh->length > 0 ? reason : -1));
  746. circuit_log_path(LOG_INFO,LD_APP,circ);
  747. /* need to test because of detach_retriable */
  748. if (!conn->_base.marked_for_close)
  749. connection_mark_unattached_ap(conn, control_reason);
  750. return 0;
  751. }
  752. /** Helper: change the socks_request-&gt;address field on conn to the
  753. * dotted-quad representation of <b>new_addr</b> (given in host order),
  754. * and send an appropriate REMAP event. */
  755. static void
  756. remap_event_helper(edge_connection_t *conn, uint32_t new_addr)
  757. {
  758. struct in_addr in;
  759. in.s_addr = htonl(new_addr);
  760. tor_inet_ntoa(&in, conn->socks_request->address,
  761. sizeof(conn->socks_request->address));
  762. control_event_stream_status(conn, STREAM_EVENT_REMAP,
  763. REMAP_STREAM_SOURCE_EXIT);
  764. }
  765. /** An incoming relay cell has arrived from circuit <b>circ</b> to
  766. * stream <b>conn</b>.
  767. *
  768. * The arguments here are the same as in
  769. * connection_edge_process_relay_cell() below; this function is called
  770. * from there when <b>conn</b> is defined and not in an open state.
  771. */
  772. static int
  773. connection_edge_process_relay_cell_not_open(
  774. relay_header_t *rh, cell_t *cell, circuit_t *circ,
  775. edge_connection_t *conn, crypt_path_t *layer_hint)
  776. {
  777. if (rh->command == RELAY_COMMAND_END) {
  778. if (CIRCUIT_IS_ORIGIN(circ) && conn->_base.type == CONN_TYPE_AP) {
  779. return connection_ap_process_end_not_open(rh, cell,
  780. TO_ORIGIN_CIRCUIT(circ), conn,
  781. layer_hint);
  782. } else {
  783. /* we just got an 'end', don't need to send one */
  784. conn->edge_has_sent_end = 1;
  785. conn->end_reason = *(cell->payload+RELAY_HEADER_SIZE) |
  786. END_STREAM_REASON_FLAG_REMOTE;
  787. connection_mark_for_close(TO_CONN(conn));
  788. return 0;
  789. }
  790. }
  791. if (conn->_base.type == CONN_TYPE_AP &&
  792. rh->command == RELAY_COMMAND_CONNECTED) {
  793. tor_assert(CIRCUIT_IS_ORIGIN(circ));
  794. if (conn->_base.state != AP_CONN_STATE_CONNECT_WAIT) {
  795. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  796. "Got 'connected' while not in state connect_wait. Dropping.");
  797. return 0;
  798. }
  799. conn->_base.state = AP_CONN_STATE_OPEN;
  800. log_info(LD_APP,"'connected' received after %d seconds.",
  801. (int)(time(NULL) - conn->_base.timestamp_lastread));
  802. if (rh->length >= 4) {
  803. uint32_t addr = ntohl(get_uint32(cell->payload+RELAY_HEADER_SIZE));
  804. int ttl;
  805. if (!addr || (get_options()->ClientDNSRejectInternalAddresses &&
  806. is_internal_IP(addr, 0))) {
  807. char buf[INET_NTOA_BUF_LEN];
  808. struct in_addr a;
  809. a.s_addr = htonl(addr);
  810. tor_inet_ntoa(&a, buf, sizeof(buf));
  811. log_info(LD_APP,
  812. "...but it claims the IP address was %s. Closing.", buf);
  813. connection_edge_end(conn, END_STREAM_REASON_TORPROTOCOL);
  814. connection_mark_unattached_ap(conn, END_STREAM_REASON_TORPROTOCOL);
  815. return 0;
  816. }
  817. if (rh->length >= 8)
  818. ttl = (int)ntohl(get_uint32(cell->payload+RELAY_HEADER_SIZE+4));
  819. else
  820. ttl = -1;
  821. client_dns_set_addressmap(conn->socks_request->address, addr,
  822. conn->chosen_exit_name, ttl);
  823. remap_event_helper(conn, addr);
  824. }
  825. circuit_log_path(LOG_INFO,LD_APP,TO_ORIGIN_CIRCUIT(circ));
  826. /* don't send a socks reply to transparent conns */
  827. if (!conn->socks_request->has_finished)
  828. connection_ap_handshake_socks_reply(conn, NULL, 0, 0);
  829. /* Was it a linked dir conn? If so, a dir request just started to
  830. * fetch something; this could be a bootstrap status milestone. */
  831. log_debug(LD_APP, "considering");
  832. if (TO_CONN(conn)->linked_conn &&
  833. TO_CONN(conn)->linked_conn->type == CONN_TYPE_DIR) {
  834. connection_t *dirconn = TO_CONN(conn)->linked_conn;
  835. log_debug(LD_APP, "it is! %d", dirconn->purpose);
  836. switch (dirconn->purpose) {
  837. case DIR_PURPOSE_FETCH_CERTIFICATE:
  838. if (consensus_is_waiting_for_certs())
  839. control_event_bootstrap(BOOTSTRAP_STATUS_LOADING_KEYS, 0);
  840. break;
  841. case DIR_PURPOSE_FETCH_CONSENSUS:
  842. control_event_bootstrap(BOOTSTRAP_STATUS_LOADING_STATUS, 0);
  843. break;
  844. case DIR_PURPOSE_FETCH_SERVERDESC:
  845. control_event_bootstrap(BOOTSTRAP_STATUS_LOADING_DESCRIPTORS,
  846. count_loading_descriptors_progress());
  847. break;
  848. }
  849. }
  850. /* handle anything that might have queued */
  851. if (connection_edge_package_raw_inbuf(conn, 1) < 0) {
  852. /* (We already sent an end cell if possible) */
  853. connection_mark_for_close(TO_CONN(conn));
  854. return 0;
  855. }
  856. return 0;
  857. }
  858. if (conn->_base.type == CONN_TYPE_AP &&
  859. rh->command == RELAY_COMMAND_RESOLVED) {
  860. int ttl;
  861. int answer_len;
  862. uint8_t answer_type;
  863. if (conn->_base.state != AP_CONN_STATE_RESOLVE_WAIT) {
  864. log_fn(LOG_PROTOCOL_WARN, LD_APP, "Got a 'resolved' cell while "
  865. "not in state resolve_wait. Dropping.");
  866. return 0;
  867. }
  868. tor_assert(SOCKS_COMMAND_IS_RESOLVE(conn->socks_request->command));
  869. answer_len = cell->payload[RELAY_HEADER_SIZE+1];
  870. if (rh->length < 2 || answer_len+2>rh->length) {
  871. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  872. "Dropping malformed 'resolved' cell");
  873. connection_mark_unattached_ap(conn, END_STREAM_REASON_TORPROTOCOL);
  874. return 0;
  875. }
  876. answer_type = cell->payload[RELAY_HEADER_SIZE];
  877. if (rh->length >= answer_len+6)
  878. ttl = (int)ntohl(get_uint32(cell->payload+RELAY_HEADER_SIZE+
  879. 2+answer_len));
  880. else
  881. ttl = -1;
  882. if (answer_type == RESOLVED_TYPE_IPV4 && answer_len == 4) {
  883. uint32_t addr = ntohl(get_uint32(cell->payload+RELAY_HEADER_SIZE+2));
  884. if (get_options()->ClientDNSRejectInternalAddresses &&
  885. is_internal_IP(addr, 0)) {
  886. char buf[INET_NTOA_BUF_LEN];
  887. struct in_addr a;
  888. a.s_addr = htonl(addr);
  889. tor_inet_ntoa(&a, buf, sizeof(buf));
  890. log_info(LD_APP,"Got a resolve with answer %s. Rejecting.", buf);
  891. connection_ap_handshake_socks_resolved(conn,
  892. RESOLVED_TYPE_ERROR_TRANSIENT,
  893. 0, NULL, 0, TIME_MAX);
  894. connection_mark_unattached_ap(conn, END_STREAM_REASON_TORPROTOCOL);
  895. return 0;
  896. }
  897. }
  898. connection_ap_handshake_socks_resolved(conn,
  899. answer_type,
  900. cell->payload[RELAY_HEADER_SIZE+1], /*answer_len*/
  901. cell->payload+RELAY_HEADER_SIZE+2, /*answer*/
  902. ttl,
  903. -1);
  904. if (answer_type == RESOLVED_TYPE_IPV4 && answer_len == 4) {
  905. uint32_t addr = ntohl(get_uint32(cell->payload+RELAY_HEADER_SIZE+2));
  906. remap_event_helper(conn, addr);
  907. }
  908. connection_mark_unattached_ap(conn,
  909. END_STREAM_REASON_DONE |
  910. END_STREAM_REASON_FLAG_ALREADY_SOCKS_REPLIED);
  911. return 0;
  912. }
  913. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  914. "Got an unexpected relay command %d, in state %d (%s). Dropping.",
  915. rh->command, conn->_base.state,
  916. conn_state_to_string(conn->_base.type, conn->_base.state));
  917. return 0; /* for forward compatibility, don't kill the circuit */
  918. // connection_edge_end(conn, END_STREAM_REASON_TORPROTOCOL);
  919. // connection_mark_for_close(conn);
  920. // return -1;
  921. }
  922. /** An incoming relay cell has arrived on circuit <b>circ</b>. If
  923. * <b>conn</b> is NULL this is a control cell, else <b>cell</b> is
  924. * destined for <b>conn</b>.
  925. *
  926. * If <b>layer_hint</b> is defined, then we're the origin of the
  927. * circuit, and it specifies the hop that packaged <b>cell</b>.
  928. *
  929. * Return -reason if you want to warn and tear down the circuit, else 0.
  930. */
  931. static int
  932. connection_edge_process_relay_cell(cell_t *cell, circuit_t *circ,
  933. edge_connection_t *conn,
  934. crypt_path_t *layer_hint)
  935. {
  936. static int num_seen=0;
  937. relay_header_t rh;
  938. unsigned domain = layer_hint?LD_APP:LD_EXIT;
  939. int reason;
  940. tor_assert(cell);
  941. tor_assert(circ);
  942. relay_header_unpack(&rh, cell->payload);
  943. // log_fn(LOG_DEBUG,"command %d stream %d", rh.command, rh.stream_id);
  944. num_seen++;
  945. log_debug(domain, "Now seen %d relay cells here (command %d, stream %d).",
  946. num_seen, rh.command, rh.stream_id);
  947. if (rh.length > RELAY_PAYLOAD_SIZE) {
  948. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  949. "Relay cell length field too long. Closing circuit.");
  950. return - END_CIRC_REASON_TORPROTOCOL;
  951. }
  952. /* either conn is NULL, in which case we've got a control cell, or else
  953. * conn points to the recognized stream. */
  954. if (conn && !connection_state_is_open(TO_CONN(conn)))
  955. return connection_edge_process_relay_cell_not_open(
  956. &rh, cell, circ, conn, layer_hint);
  957. switch (rh.command) {
  958. case RELAY_COMMAND_DROP:
  959. // log_info(domain,"Got a relay-level padding cell. Dropping.");
  960. return 0;
  961. case RELAY_COMMAND_BEGIN:
  962. case RELAY_COMMAND_BEGIN_DIR:
  963. if (layer_hint &&
  964. circ->purpose != CIRCUIT_PURPOSE_S_REND_JOINED) {
  965. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  966. "Relay begin request unsupported at AP. Dropping.");
  967. return 0;
  968. }
  969. if (circ->purpose == CIRCUIT_PURPOSE_S_REND_JOINED &&
  970. layer_hint != TO_ORIGIN_CIRCUIT(circ)->cpath->prev) {
  971. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  972. "Relay begin request to Hidden Service "
  973. "from intermediary node. Dropping.");
  974. return 0;
  975. }
  976. if (conn) {
  977. log_fn(LOG_PROTOCOL_WARN, domain,
  978. "Begin cell for known stream. Dropping.");
  979. return 0;
  980. }
  981. if (rh.command == RELAY_COMMAND_BEGIN_DIR) {
  982. /* Assign this circuit and its app-ward OR connection a unique ID,
  983. * so that we can measure download times. The local edge and dir
  984. * connection will be assigned the same ID when they are created
  985. * and linked. */
  986. static uint64_t next_id = 0;
  987. circ->dirreq_id = ++next_id;
  988. TO_CONN(TO_OR_CIRCUIT(circ)->p_conn)->dirreq_id = circ->dirreq_id;
  989. }
  990. return connection_exit_begin_conn(cell, circ);
  991. case RELAY_COMMAND_DATA:
  992. ++stats_n_data_cells_received;
  993. if (( layer_hint && --layer_hint->deliver_window < 0) ||
  994. (!layer_hint && --circ->deliver_window < 0)) {
  995. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  996. "(relay data) circ deliver_window below 0. Killing.");
  997. connection_edge_end(conn, END_STREAM_REASON_TORPROTOCOL);
  998. connection_mark_for_close(TO_CONN(conn));
  999. return -END_CIRC_REASON_TORPROTOCOL;
  1000. }
  1001. log_debug(domain,"circ deliver_window now %d.", layer_hint ?
  1002. layer_hint->deliver_window : circ->deliver_window);
  1003. circuit_consider_sending_sendme(circ, layer_hint);
  1004. if (!conn) {
  1005. log_info(domain,"data cell dropped, unknown stream (streamid %d).",
  1006. rh.stream_id);
  1007. return 0;
  1008. }
  1009. if (--conn->deliver_window < 0) { /* is it below 0 after decrement? */
  1010. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  1011. "(relay data) conn deliver_window below 0. Killing.");
  1012. return -END_CIRC_REASON_TORPROTOCOL;
  1013. }
  1014. stats_n_data_bytes_received += rh.length;
  1015. connection_write_to_buf(cell->payload + RELAY_HEADER_SIZE,
  1016. rh.length, TO_CONN(conn));
  1017. connection_edge_consider_sending_sendme(conn);
  1018. return 0;
  1019. case RELAY_COMMAND_END:
  1020. reason = rh.length > 0 ?
  1021. *(uint8_t *)(cell->payload+RELAY_HEADER_SIZE) : END_STREAM_REASON_MISC;
  1022. if (!conn) {
  1023. log_info(domain,"end cell (%s) dropped, unknown stream.",
  1024. stream_end_reason_to_string(reason));
  1025. return 0;
  1026. }
  1027. /* XXX add to this log_fn the exit node's nickname? */
  1028. log_info(domain,"%d: end cell (%s) for stream %d. Removing stream.",
  1029. conn->_base.s,
  1030. stream_end_reason_to_string(reason),
  1031. conn->stream_id);
  1032. if (conn->socks_request && !conn->socks_request->has_finished)
  1033. log_warn(LD_BUG,
  1034. "open stream hasn't sent socks answer yet? Closing.");
  1035. /* We just *got* an end; no reason to send one. */
  1036. conn->edge_has_sent_end = 1;
  1037. if (!conn->end_reason)
  1038. conn->end_reason = reason | END_STREAM_REASON_FLAG_REMOTE;
  1039. if (!conn->_base.marked_for_close) {
  1040. /* only mark it if not already marked. it's possible to
  1041. * get the 'end' right around when the client hangs up on us. */
  1042. connection_mark_for_close(TO_CONN(conn));
  1043. conn->_base.hold_open_until_flushed = 1;
  1044. }
  1045. return 0;
  1046. case RELAY_COMMAND_EXTEND:
  1047. if (conn) {
  1048. log_fn(LOG_PROTOCOL_WARN, domain,
  1049. "'extend' cell received for non-zero stream. Dropping.");
  1050. return 0;
  1051. }
  1052. return circuit_extend(cell, circ);
  1053. case RELAY_COMMAND_EXTENDED:
  1054. if (!layer_hint) {
  1055. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  1056. "'extended' unsupported at non-origin. Dropping.");
  1057. return 0;
  1058. }
  1059. log_debug(domain,"Got an extended cell! Yay.");
  1060. if ((reason = circuit_finish_handshake(TO_ORIGIN_CIRCUIT(circ),
  1061. CELL_CREATED,
  1062. cell->payload+RELAY_HEADER_SIZE)) < 0) {
  1063. log_warn(domain,"circuit_finish_handshake failed.");
  1064. return reason;
  1065. }
  1066. if ((reason=circuit_send_next_onion_skin(TO_ORIGIN_CIRCUIT(circ)))<0) {
  1067. log_info(domain,"circuit_send_next_onion_skin() failed.");
  1068. return reason;
  1069. }
  1070. return 0;
  1071. case RELAY_COMMAND_TRUNCATE:
  1072. if (layer_hint) {
  1073. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  1074. "'truncate' unsupported at origin. Dropping.");
  1075. return 0;
  1076. }
  1077. if (circ->n_conn) {
  1078. uint8_t trunc_reason = *(uint8_t*)(cell->payload + RELAY_HEADER_SIZE);
  1079. connection_or_send_destroy(circ->n_circ_id, circ->n_conn,
  1080. trunc_reason);
  1081. circuit_set_n_circid_orconn(circ, 0, NULL);
  1082. }
  1083. log_debug(LD_EXIT, "Processed 'truncate', replying.");
  1084. {
  1085. char payload[1];
  1086. payload[0] = (char)END_CIRC_REASON_REQUESTED;
  1087. relay_send_command_from_edge(0, circ, RELAY_COMMAND_TRUNCATED,
  1088. payload, sizeof(payload), NULL);
  1089. }
  1090. return 0;
  1091. case RELAY_COMMAND_TRUNCATED:
  1092. if (!layer_hint) {
  1093. log_fn(LOG_PROTOCOL_WARN, LD_EXIT,
  1094. "'truncated' unsupported at non-origin. Dropping.");
  1095. return 0;
  1096. }
  1097. circuit_truncated(TO_ORIGIN_CIRCUIT(circ), layer_hint);
  1098. return 0;
  1099. case RELAY_COMMAND_CONNECTED:
  1100. if (conn) {
  1101. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  1102. "'connected' unsupported while open. Closing circ.");
  1103. return -END_CIRC_REASON_TORPROTOCOL;
  1104. }
  1105. log_info(domain,
  1106. "'connected' received, no conn attached anymore. Ignoring.");
  1107. return 0;
  1108. case RELAY_COMMAND_SENDME:
  1109. if (!conn) {
  1110. if (layer_hint) {
  1111. layer_hint->package_window += CIRCWINDOW_INCREMENT;
  1112. log_debug(LD_APP,"circ-level sendme at origin, packagewindow %d.",
  1113. layer_hint->package_window);
  1114. circuit_resume_edge_reading(circ, layer_hint);
  1115. } else {
  1116. circ->package_window += CIRCWINDOW_INCREMENT;
  1117. log_debug(LD_APP,
  1118. "circ-level sendme at non-origin, packagewindow %d.",
  1119. circ->package_window);
  1120. circuit_resume_edge_reading(circ, layer_hint);
  1121. }
  1122. return 0;
  1123. }
  1124. conn->package_window += STREAMWINDOW_INCREMENT;
  1125. log_debug(domain,"stream-level sendme, packagewindow now %d.",
  1126. conn->package_window);
  1127. connection_start_reading(TO_CONN(conn));
  1128. /* handle whatever might still be on the inbuf */
  1129. if (connection_edge_package_raw_inbuf(conn, 1) < 0) {
  1130. /* (We already sent an end cell if possible) */
  1131. connection_mark_for_close(TO_CONN(conn));
  1132. return 0;
  1133. }
  1134. return 0;
  1135. case RELAY_COMMAND_RESOLVE:
  1136. if (layer_hint) {
  1137. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  1138. "resolve request unsupported at AP; dropping.");
  1139. return 0;
  1140. } else if (conn) {
  1141. log_fn(LOG_PROTOCOL_WARN, domain,
  1142. "resolve request for known stream; dropping.");
  1143. return 0;
  1144. } else if (circ->purpose != CIRCUIT_PURPOSE_OR) {
  1145. log_fn(LOG_PROTOCOL_WARN, domain,
  1146. "resolve request on circ with purpose %d; dropping",
  1147. circ->purpose);
  1148. return 0;
  1149. }
  1150. connection_exit_begin_resolve(cell, TO_OR_CIRCUIT(circ));
  1151. return 0;
  1152. case RELAY_COMMAND_RESOLVED:
  1153. if (conn) {
  1154. log_fn(LOG_PROTOCOL_WARN, domain,
  1155. "'resolved' unsupported while open. Closing circ.");
  1156. return -END_CIRC_REASON_TORPROTOCOL;
  1157. }
  1158. log_info(domain,
  1159. "'resolved' received, no conn attached anymore. Ignoring.");
  1160. return 0;
  1161. case RELAY_COMMAND_ESTABLISH_INTRO:
  1162. case RELAY_COMMAND_ESTABLISH_RENDEZVOUS:
  1163. case RELAY_COMMAND_INTRODUCE1:
  1164. case RELAY_COMMAND_INTRODUCE2:
  1165. case RELAY_COMMAND_INTRODUCE_ACK:
  1166. case RELAY_COMMAND_RENDEZVOUS1:
  1167. case RELAY_COMMAND_RENDEZVOUS2:
  1168. case RELAY_COMMAND_INTRO_ESTABLISHED:
  1169. case RELAY_COMMAND_RENDEZVOUS_ESTABLISHED:
  1170. rend_process_relay_cell(circ, layer_hint,
  1171. rh.command, rh.length,
  1172. cell->payload+RELAY_HEADER_SIZE);
  1173. return 0;
  1174. }
  1175. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  1176. "Received unknown relay command %d. Perhaps the other side is using "
  1177. "a newer version of Tor? Dropping.",
  1178. rh.command);
  1179. return 0; /* for forward compatibility, don't kill the circuit */
  1180. }
  1181. /** How many relay_data cells have we built, ever? */
  1182. uint64_t stats_n_data_cells_packaged = 0;
  1183. /** How many bytes of data have we put in relay_data cells have we built,
  1184. * ever? This would be RELAY_PAYLOAD_SIZE*stats_n_data_cells_packaged if
  1185. * every relay cell we ever sent were completely full of data. */
  1186. uint64_t stats_n_data_bytes_packaged = 0;
  1187. /** How many relay_data cells have we received, ever? */
  1188. uint64_t stats_n_data_cells_received = 0;
  1189. /** How many bytes of data have we received relay_data cells, ever? This would
  1190. * be RELAY_PAYLOAD_SIZE*stats_n_data_cells_packaged if every relay cell we
  1191. * ever received were completely full of data. */
  1192. uint64_t stats_n_data_bytes_received = 0;
  1193. /** While conn->inbuf has an entire relay payload of bytes on it,
  1194. * and the appropriate package windows aren't empty, grab a cell
  1195. * and send it down the circuit.
  1196. *
  1197. * Return -1 (and send a RELAY_COMMAND_END cell if necessary) if conn should
  1198. * be marked for close, else return 0.
  1199. */
  1200. int
  1201. connection_edge_package_raw_inbuf(edge_connection_t *conn, int package_partial)
  1202. {
  1203. size_t amount_to_process, length;
  1204. char payload[CELL_PAYLOAD_SIZE];
  1205. circuit_t *circ;
  1206. unsigned domain = conn->cpath_layer ? LD_APP : LD_EXIT;
  1207. tor_assert(conn);
  1208. if (conn->_base.marked_for_close) {
  1209. log_warn(LD_BUG,
  1210. "called on conn that's already marked for close at %s:%d.",
  1211. conn->_base.marked_for_close_file, conn->_base.marked_for_close);
  1212. return 0;
  1213. }
  1214. repeat_connection_edge_package_raw_inbuf:
  1215. circ = circuit_get_by_edge_conn(conn);
  1216. if (!circ) {
  1217. log_info(domain,"conn has no circuit! Closing.");
  1218. conn->end_reason = END_STREAM_REASON_CANT_ATTACH;
  1219. return -1;
  1220. }
  1221. if (circuit_consider_stop_edge_reading(circ, conn->cpath_layer))
  1222. return 0;
  1223. if (conn->package_window <= 0) {
  1224. log_info(domain,"called with package_window %d. Skipping.",
  1225. conn->package_window);
  1226. connection_stop_reading(TO_CONN(conn));
  1227. return 0;
  1228. }
  1229. amount_to_process = buf_datalen(conn->_base.inbuf);
  1230. if (!amount_to_process)
  1231. return 0;
  1232. if (!package_partial && amount_to_process < RELAY_PAYLOAD_SIZE)
  1233. return 0;
  1234. if (amount_to_process > RELAY_PAYLOAD_SIZE) {
  1235. length = RELAY_PAYLOAD_SIZE;
  1236. } else {
  1237. length = amount_to_process;
  1238. }
  1239. stats_n_data_bytes_packaged += length;
  1240. stats_n_data_cells_packaged += 1;
  1241. connection_fetch_from_buf(payload, length, TO_CONN(conn));
  1242. log_debug(domain,"(%d) Packaging %d bytes (%d waiting).", conn->_base.s,
  1243. (int)length, (int)buf_datalen(conn->_base.inbuf));
  1244. if (connection_edge_send_command(conn, RELAY_COMMAND_DATA,
  1245. payload, length) < 0 )
  1246. /* circuit got marked for close, don't continue, don't need to mark conn */
  1247. return 0;
  1248. if (!conn->cpath_layer) { /* non-rendezvous exit */
  1249. tor_assert(circ->package_window > 0);
  1250. circ->package_window--;
  1251. } else { /* we're an AP, or an exit on a rendezvous circ */
  1252. tor_assert(conn->cpath_layer->package_window > 0);
  1253. conn->cpath_layer->package_window--;
  1254. }
  1255. if (--conn->package_window <= 0) { /* is it 0 after decrement? */
  1256. connection_stop_reading(TO_CONN(conn));
  1257. log_debug(domain,"conn->package_window reached 0.");
  1258. circuit_consider_stop_edge_reading(circ, conn->cpath_layer);
  1259. return 0; /* don't process the inbuf any more */
  1260. }
  1261. log_debug(domain,"conn->package_window is now %d",conn->package_window);
  1262. /* handle more if there's more, or return 0 if there isn't */
  1263. goto repeat_connection_edge_package_raw_inbuf;
  1264. }
  1265. /** Called when we've just received a relay data cell, or when
  1266. * we've just finished flushing all bytes to stream <b>conn</b>.
  1267. *
  1268. * If conn->outbuf is not too full, and our deliver window is
  1269. * low, send back a suitable number of stream-level sendme cells.
  1270. */
  1271. void
  1272. connection_edge_consider_sending_sendme(edge_connection_t *conn)
  1273. {
  1274. circuit_t *circ;
  1275. if (connection_outbuf_too_full(TO_CONN(conn)))
  1276. return;
  1277. circ = circuit_get_by_edge_conn(conn);
  1278. if (!circ) {
  1279. /* this can legitimately happen if the destroy has already
  1280. * arrived and torn down the circuit */
  1281. log_info(LD_APP,"No circuit associated with conn. Skipping.");
  1282. return;
  1283. }
  1284. while (conn->deliver_window <= STREAMWINDOW_START - STREAMWINDOW_INCREMENT) {
  1285. log_debug(conn->cpath_layer?LD_APP:LD_EXIT,
  1286. "Outbuf %d, Queuing stream sendme.",
  1287. (int)conn->_base.outbuf_flushlen);
  1288. conn->deliver_window += STREAMWINDOW_INCREMENT;
  1289. if (connection_edge_send_command(conn, RELAY_COMMAND_SENDME,
  1290. NULL, 0) < 0) {
  1291. log_warn(LD_APP,"connection_edge_send_command failed. Skipping.");
  1292. return; /* the circuit's closed, don't continue */
  1293. }
  1294. }
  1295. }
  1296. /** The circuit <b>circ</b> has received a circuit-level sendme
  1297. * (on hop <b>layer_hint</b>, if we're the OP). Go through all the
  1298. * attached streams and let them resume reading and packaging, if
  1299. * their stream windows allow it.
  1300. */
  1301. static void
  1302. circuit_resume_edge_reading(circuit_t *circ, crypt_path_t *layer_hint)
  1303. {
  1304. log_debug(layer_hint?LD_APP:LD_EXIT,"resuming");
  1305. if (CIRCUIT_IS_ORIGIN(circ))
  1306. circuit_resume_edge_reading_helper(TO_ORIGIN_CIRCUIT(circ)->p_streams,
  1307. circ, layer_hint);
  1308. else
  1309. circuit_resume_edge_reading_helper(TO_OR_CIRCUIT(circ)->n_streams,
  1310. circ, layer_hint);
  1311. }
  1312. /** A helper function for circuit_resume_edge_reading() above.
  1313. * The arguments are the same, except that <b>conn</b> is the head
  1314. * of a linked list of edge streams that should each be considered.
  1315. */
  1316. static int
  1317. circuit_resume_edge_reading_helper(edge_connection_t *conn,
  1318. circuit_t *circ,
  1319. crypt_path_t *layer_hint)
  1320. {
  1321. for ( ; conn; conn=conn->next_stream) {
  1322. if (conn->_base.marked_for_close)
  1323. continue;
  1324. if ((!layer_hint && conn->package_window > 0) ||
  1325. (layer_hint && conn->package_window > 0 &&
  1326. conn->cpath_layer == layer_hint)) {
  1327. connection_start_reading(TO_CONN(conn));
  1328. /* handle whatever might still be on the inbuf */
  1329. if (connection_edge_package_raw_inbuf(conn, 1)<0) {
  1330. /* (We already sent an end cell if possible) */
  1331. connection_mark_for_close(TO_CONN(conn));
  1332. continue;
  1333. }
  1334. /* If the circuit won't accept any more data, return without looking
  1335. * at any more of the streams. Any connections that should be stopped
  1336. * have already been stopped by connection_edge_package_raw_inbuf. */
  1337. if (circuit_consider_stop_edge_reading(circ, layer_hint))
  1338. return -1;
  1339. }
  1340. }
  1341. return 0;
  1342. }
  1343. /** Check if the package window for <b>circ</b> is empty (at
  1344. * hop <b>layer_hint</b> if it's defined).
  1345. *
  1346. * If yes, tell edge streams to stop reading and return 1.
  1347. * Else return 0.
  1348. */
  1349. static int
  1350. circuit_consider_stop_edge_reading(circuit_t *circ, crypt_path_t *layer_hint)
  1351. {
  1352. edge_connection_t *conn = NULL;
  1353. unsigned domain = layer_hint ? LD_APP : LD_EXIT;
  1354. if (!layer_hint) {
  1355. or_circuit_t *or_circ = TO_OR_CIRCUIT(circ);
  1356. log_debug(domain,"considering circ->package_window %d",
  1357. circ->package_window);
  1358. if (circ->package_window <= 0) {
  1359. log_debug(domain,"yes, not-at-origin. stopped.");
  1360. for (conn = or_circ->n_streams; conn; conn=conn->next_stream)
  1361. connection_stop_reading(TO_CONN(conn));
  1362. return 1;
  1363. }
  1364. return 0;
  1365. }
  1366. /* else, layer hint is defined, use it */
  1367. log_debug(domain,"considering layer_hint->package_window %d",
  1368. layer_hint->package_window);
  1369. if (layer_hint->package_window <= 0) {
  1370. log_debug(domain,"yes, at-origin. stopped.");
  1371. for (conn = TO_ORIGIN_CIRCUIT(circ)->p_streams; conn;
  1372. conn=conn->next_stream)
  1373. if (conn->cpath_layer == layer_hint)
  1374. connection_stop_reading(TO_CONN(conn));
  1375. return 1;
  1376. }
  1377. return 0;
  1378. }
  1379. /** Check if the deliver_window for circuit <b>circ</b> (at hop
  1380. * <b>layer_hint</b> if it's defined) is low enough that we should
  1381. * send a circuit-level sendme back down the circuit. If so, send
  1382. * enough sendmes that the window would be overfull if we sent any
  1383. * more.
  1384. */
  1385. static void
  1386. circuit_consider_sending_sendme(circuit_t *circ, crypt_path_t *layer_hint)
  1387. {
  1388. // log_fn(LOG_INFO,"Considering: layer_hint is %s",
  1389. // layer_hint ? "defined" : "null");
  1390. while ((layer_hint ? layer_hint->deliver_window : circ->deliver_window) <=
  1391. CIRCWINDOW_START - CIRCWINDOW_INCREMENT) {
  1392. log_debug(LD_CIRC,"Queuing circuit sendme.");
  1393. if (layer_hint)
  1394. layer_hint->deliver_window += CIRCWINDOW_INCREMENT;
  1395. else
  1396. circ->deliver_window += CIRCWINDOW_INCREMENT;
  1397. if (relay_send_command_from_edge(0, circ, RELAY_COMMAND_SENDME,
  1398. NULL, 0, layer_hint) < 0) {
  1399. log_warn(LD_CIRC,
  1400. "relay_send_command_from_edge failed. Circuit's closed.");
  1401. return; /* the circuit's closed, don't continue */
  1402. }
  1403. }
  1404. }
  1405. /** Stop reading on edge connections when we have this many cells
  1406. * waiting on the appropriate queue. */
  1407. #define CELL_QUEUE_HIGHWATER_SIZE 256
  1408. /** Start reading from edge connections again when we get down to this many
  1409. * cells. */
  1410. #define CELL_QUEUE_LOWWATER_SIZE 64
  1411. #ifdef ACTIVE_CIRCUITS_PARANOIA
  1412. #define assert_active_circuits_ok_paranoid(conn) \
  1413. assert_active_circuits_ok(conn)
  1414. #else
  1415. #define assert_active_circuits_ok_paranoid(conn)
  1416. #endif
  1417. /** The total number of cells we have allocated from the memory pool. */
  1418. static int total_cells_allocated = 0;
  1419. /** A memory pool to allocate packed_cell_t objects. */
  1420. static mp_pool_t *cell_pool = NULL;
  1421. /** Memory pool to allocate insertion_time_elem_t objects used for cell
  1422. * statistics. */
  1423. static mp_pool_t *it_pool = NULL;
  1424. /** Allocate structures to hold cells. */
  1425. void
  1426. init_cell_pool(void)
  1427. {
  1428. tor_assert(!cell_pool);
  1429. cell_pool = mp_pool_new(sizeof(packed_cell_t), 128*1024);
  1430. }
  1431. /** Free all storage used to hold cells (and insertion times if we measure
  1432. * cell statistics). */
  1433. void
  1434. free_cell_pool(void)
  1435. {
  1436. /* Maybe we haven't called init_cell_pool yet; need to check for it. */
  1437. if (cell_pool) {
  1438. mp_pool_destroy(cell_pool);
  1439. cell_pool = NULL;
  1440. }
  1441. if (it_pool) {
  1442. mp_pool_destroy(it_pool);
  1443. it_pool = NULL;
  1444. }
  1445. }
  1446. /** Free excess storage in cell pool. */
  1447. void
  1448. clean_cell_pool(void)
  1449. {
  1450. tor_assert(cell_pool);
  1451. mp_pool_clean(cell_pool, 0, 1);
  1452. }
  1453. /** Release storage held by <b>cell</b>. */
  1454. static INLINE void
  1455. packed_cell_free_unchecked(packed_cell_t *cell)
  1456. {
  1457. --total_cells_allocated;
  1458. mp_pool_release(cell);
  1459. }
  1460. /** Allocate and return a new packed_cell_t. */
  1461. static INLINE packed_cell_t *
  1462. packed_cell_alloc(void)
  1463. {
  1464. ++total_cells_allocated;
  1465. return mp_pool_get(cell_pool);
  1466. }
  1467. /** Log current statistics for cell pool allocation at log level
  1468. * <b>severity</b>. */
  1469. void
  1470. dump_cell_pool_usage(int severity)
  1471. {
  1472. circuit_t *c;
  1473. int n_circs = 0;
  1474. int n_cells = 0;
  1475. for (c = _circuit_get_global_list(); c; c = c->next) {
  1476. n_cells += c->n_conn_cells.n;
  1477. if (!CIRCUIT_IS_ORIGIN(c))
  1478. n_cells += TO_OR_CIRCUIT(c)->p_conn_cells.n;
  1479. ++n_circs;
  1480. }
  1481. log(severity, LD_MM, "%d cells allocated on %d circuits. %d cells leaked.",
  1482. n_cells, n_circs, total_cells_allocated - n_cells);
  1483. mp_pool_log_status(cell_pool, severity);
  1484. }
  1485. /** Allocate a new copy of packed <b>cell</b>. */
  1486. static INLINE packed_cell_t *
  1487. packed_cell_copy(const cell_t *cell)
  1488. {
  1489. packed_cell_t *c = packed_cell_alloc();
  1490. cell_pack(c, cell);
  1491. c->next = NULL;
  1492. return c;
  1493. }
  1494. /** Append <b>cell</b> to the end of <b>queue</b>. */
  1495. void
  1496. cell_queue_append(cell_queue_t *queue, packed_cell_t *cell)
  1497. {
  1498. if (queue->tail) {
  1499. tor_assert(!queue->tail->next);
  1500. queue->tail->next = cell;
  1501. } else {
  1502. queue->head = cell;
  1503. }
  1504. queue->tail = cell;
  1505. cell->next = NULL;
  1506. ++queue->n;
  1507. }
  1508. /** Append a newly allocated copy of <b>cell</b> to the end of <b>queue</b> */
  1509. void
  1510. cell_queue_append_packed_copy(cell_queue_t *queue, const cell_t *cell)
  1511. {
  1512. packed_cell_t *copy = packed_cell_copy(cell);
  1513. /* Remember the time when this cell was put in the queue. */
  1514. if (get_options()->CellStatistics) {
  1515. struct timeval now;
  1516. uint32_t added;
  1517. insertion_time_queue_t *it_queue = queue->insertion_times;
  1518. if (!it_pool)
  1519. it_pool = mp_pool_new(sizeof(insertion_time_elem_t), 1024);
  1520. tor_gettimeofday_cached(&now);
  1521. #define SECONDS_IN_A_DAY 86400L
  1522. added = (uint32_t)(((now.tv_sec % SECONDS_IN_A_DAY) * 100L)
  1523. + ((uint32_t)now.tv_usec / (uint32_t)10000L));
  1524. if (!it_queue) {
  1525. it_queue = tor_malloc_zero(sizeof(insertion_time_queue_t));
  1526. queue->insertion_times = it_queue;
  1527. }
  1528. if (it_queue->last && it_queue->last->insertion_time == added) {
  1529. it_queue->last->counter++;
  1530. } else {
  1531. insertion_time_elem_t *elem = mp_pool_get(it_pool);
  1532. elem->next = NULL;
  1533. elem->insertion_time = added;
  1534. elem->counter = 1;
  1535. if (it_queue->last) {
  1536. it_queue->last->next = elem;
  1537. it_queue->last = elem;
  1538. } else {
  1539. it_queue->first = it_queue->last = elem;
  1540. }
  1541. }
  1542. }
  1543. cell_queue_append(queue, copy);
  1544. }
  1545. /** Remove and free every cell in <b>queue</b>. */
  1546. void
  1547. cell_queue_clear(cell_queue_t *queue)
  1548. {
  1549. packed_cell_t *cell, *next;
  1550. cell = queue->head;
  1551. while (cell) {
  1552. next = cell->next;
  1553. packed_cell_free_unchecked(cell);
  1554. cell = next;
  1555. }
  1556. queue->head = queue->tail = NULL;
  1557. queue->n = 0;
  1558. if (queue->insertion_times) {
  1559. while (queue->insertion_times->first) {
  1560. insertion_time_elem_t *elem = queue->insertion_times->first;
  1561. queue->insertion_times->first = elem->next;
  1562. mp_pool_release(elem);
  1563. }
  1564. tor_free(queue->insertion_times);
  1565. }
  1566. }
  1567. /** Extract and return the cell at the head of <b>queue</b>; return NULL if
  1568. * <b>queue</b> is empty. */
  1569. static INLINE packed_cell_t *
  1570. cell_queue_pop(cell_queue_t *queue)
  1571. {
  1572. packed_cell_t *cell = queue->head;
  1573. if (!cell)
  1574. return NULL;
  1575. queue->head = cell->next;
  1576. if (cell == queue->tail) {
  1577. tor_assert(!queue->head);
  1578. queue->tail = NULL;
  1579. }
  1580. --queue->n;
  1581. return cell;
  1582. }
  1583. /** Return a pointer to the "next_active_on_{n,p}_conn" pointer of <b>circ</b>,
  1584. * depending on whether <b>conn</b> matches n_conn or p_conn. */
  1585. static INLINE circuit_t **
  1586. next_circ_on_conn_p(circuit_t *circ, or_connection_t *conn)
  1587. {
  1588. tor_assert(circ);
  1589. tor_assert(conn);
  1590. if (conn == circ->n_conn) {
  1591. return &circ->next_active_on_n_conn;
  1592. } else {
  1593. or_circuit_t *orcirc = TO_OR_CIRCUIT(circ);
  1594. tor_assert(conn == orcirc->p_conn);
  1595. return &orcirc->next_active_on_p_conn;
  1596. }
  1597. }
  1598. /** Return a pointer to the "prev_active_on_{n,p}_conn" pointer of <b>circ</b>,
  1599. * depending on whether <b>conn</b> matches n_conn or p_conn. */
  1600. static INLINE circuit_t **
  1601. prev_circ_on_conn_p(circuit_t *circ, or_connection_t *conn)
  1602. {
  1603. tor_assert(circ);
  1604. tor_assert(conn);
  1605. if (conn == circ->n_conn) {
  1606. return &circ->prev_active_on_n_conn;
  1607. } else {
  1608. or_circuit_t *orcirc = TO_OR_CIRCUIT(circ);
  1609. tor_assert(conn == orcirc->p_conn);
  1610. return &orcirc->prev_active_on_p_conn;
  1611. }
  1612. }
  1613. /** Add <b>circ</b> to the list of circuits with pending cells on
  1614. * <b>conn</b>. No effect if <b>circ</b> is already linked. */
  1615. void
  1616. make_circuit_active_on_conn(circuit_t *circ, or_connection_t *conn)
  1617. {
  1618. circuit_t **nextp = next_circ_on_conn_p(circ, conn);
  1619. circuit_t **prevp = prev_circ_on_conn_p(circ, conn);
  1620. if (*nextp && *prevp) {
  1621. /* Already active. */
  1622. return;
  1623. }
  1624. if (! conn->active_circuits) {
  1625. conn->active_circuits = circ;
  1626. *prevp = *nextp = circ;
  1627. } else {
  1628. circuit_t *head = conn->active_circuits;
  1629. circuit_t *old_tail = *prev_circ_on_conn_p(head, conn);
  1630. *next_circ_on_conn_p(old_tail, conn) = circ;
  1631. *nextp = head;
  1632. *prev_circ_on_conn_p(head, conn) = circ;
  1633. *prevp = old_tail;
  1634. }
  1635. assert_active_circuits_ok_paranoid(conn);
  1636. }
  1637. /** Remove <b>circ</b> from the list of circuits with pending cells on
  1638. * <b>conn</b>. No effect if <b>circ</b> is already unlinked. */
  1639. void
  1640. make_circuit_inactive_on_conn(circuit_t *circ, or_connection_t *conn)
  1641. {
  1642. circuit_t **nextp = next_circ_on_conn_p(circ, conn);
  1643. circuit_t **prevp = prev_circ_on_conn_p(circ, conn);
  1644. circuit_t *next = *nextp, *prev = *prevp;
  1645. if (!next && !prev) {
  1646. /* Already inactive. */
  1647. return;
  1648. }
  1649. tor_assert(next && prev);
  1650. tor_assert(*prev_circ_on_conn_p(next, conn) == circ);
  1651. tor_assert(*next_circ_on_conn_p(prev, conn) == circ);
  1652. if (next == circ) {
  1653. conn->active_circuits = NULL;
  1654. } else {
  1655. *prev_circ_on_conn_p(next, conn) = prev;
  1656. *next_circ_on_conn_p(prev, conn) = next;
  1657. if (conn->active_circuits == circ)
  1658. conn->active_circuits = next;
  1659. }
  1660. *prevp = *nextp = NULL;
  1661. assert_active_circuits_ok_paranoid(conn);
  1662. }
  1663. /** Remove all circuits from the list of circuits with pending cells on
  1664. * <b>conn</b>. */
  1665. void
  1666. connection_or_unlink_all_active_circs(or_connection_t *orconn)
  1667. {
  1668. circuit_t *head = orconn->active_circuits;
  1669. circuit_t *cur = head;
  1670. if (! head)
  1671. return;
  1672. do {
  1673. circuit_t *next = *next_circ_on_conn_p(cur, orconn);
  1674. *prev_circ_on_conn_p(cur, orconn) = NULL;
  1675. *next_circ_on_conn_p(cur, orconn) = NULL;
  1676. cur = next;
  1677. } while (cur != head);
  1678. orconn->active_circuits = NULL;
  1679. }
  1680. /** Block (if <b>block</b> is true) or unblock (if <b>block</b> is false)
  1681. * every edge connection that is using <b>circ</b> to write to <b>orconn</b>,
  1682. * and start or stop reading as appropriate. */
  1683. static void
  1684. set_streams_blocked_on_circ(circuit_t *circ, or_connection_t *orconn,
  1685. int block)
  1686. {
  1687. edge_connection_t *edge = NULL;
  1688. if (circ->n_conn == orconn) {
  1689. circ->streams_blocked_on_n_conn = block;
  1690. if (CIRCUIT_IS_ORIGIN(circ))
  1691. edge = TO_ORIGIN_CIRCUIT(circ)->p_streams;
  1692. } else {
  1693. circ->streams_blocked_on_p_conn = block;
  1694. tor_assert(!CIRCUIT_IS_ORIGIN(circ));
  1695. edge = TO_OR_CIRCUIT(circ)->n_streams;
  1696. }
  1697. for (; edge; edge = edge->next_stream) {
  1698. connection_t *conn = TO_CONN(edge);
  1699. edge->edge_blocked_on_circ = block;
  1700. if (!conn->read_event) {
  1701. /* This connection is a placeholder for something; probably a DNS
  1702. * request. It can't actually stop or start reading.*/
  1703. continue;
  1704. }
  1705. if (block) {
  1706. if (connection_is_reading(conn))
  1707. connection_stop_reading(conn);
  1708. } else {
  1709. /* Is this right? */
  1710. if (!connection_is_reading(conn))
  1711. connection_start_reading(conn);
  1712. }
  1713. }
  1714. }
  1715. /** Pull as many cells as possible (but no more than <b>max</b>) from the
  1716. * queue of the first active circuit on <b>conn</b>, and write them to
  1717. * <b>conn</b>-&gt;outbuf. Return the number of cells written. Advance
  1718. * the active circuit pointer to the next active circuit in the ring. */
  1719. int
  1720. connection_or_flush_from_first_active_circuit(or_connection_t *conn, int max,
  1721. time_t now)
  1722. {
  1723. int n_flushed;
  1724. cell_queue_t *queue;
  1725. circuit_t *circ;
  1726. int streams_blocked;
  1727. /* The current (hi-res) time */
  1728. struct timeval now_hires;
  1729. /* The EWMA cell counter for the circuit we're flushing. */
  1730. cell_ewma_t *cell_ewma = NULL;
  1731. /* The global cell EWMA parameters. The algorithm is parameterized by
  1732. * two values (type double):
  1733. *
  1734. * "significance" (between 0 and 1) and "interval"
  1735. *
  1736. * The cell count is weighted so that the most recent "interval"
  1737. * seconds will account for "significance" of the weight.
  1738. *
  1739. * If "interval" is set to 0, it disables the algorithm, and the old
  1740. * algorithm (round-robin) is used.
  1741. *
  1742. * These parameters should really be set by the consensus, but can be
  1743. * overridden by the torrc (in which case the options values will be
  1744. * >= 0.0).
  1745. */
  1746. static double cell_ewma_significance = 0.9;
  1747. static double cell_ewma_interval = 10.0;
  1748. double significance_override = get_options()->EWMASignificance;
  1749. double interval_override = get_options()->EWMAInterval;
  1750. if (significance_override >= 0.0) {
  1751. cell_ewma_significance = significance_override;
  1752. }
  1753. if (interval_override >= 0.0) {
  1754. cell_ewma_interval = interval_override;
  1755. }
  1756. circ = conn->active_circuits;
  1757. if (!circ) return 0;
  1758. assert_active_circuits_ok_paranoid(conn);
  1759. /* See if we're doing the ewma circuit selection algorithm. */
  1760. if (cell_ewma_interval > 0.0) {
  1761. /* Is there another circuit we might like better? */
  1762. circuit_t *circ_iter, *circ_start;
  1763. circuit_t *circ_min_cell_count = NULL;
  1764. double min_cell_count = 0.0;
  1765. tor_gettimeofday_cached(&now_hires);
  1766. /* Start with circ, and go around the circular linked list */
  1767. circ_start = circ_iter = circ;
  1768. do {
  1769. double delta_t;
  1770. /* Find the appropriate EWMA cell counter to use. */
  1771. if (circ_iter->n_conn == conn) {
  1772. cell_ewma = &(circ_iter->n_cell_ewma);
  1773. } else {
  1774. cell_ewma = &(TO_OR_CIRCUIT(circ_iter)->p_cell_ewma);
  1775. }
  1776. /* Update the EWMA cell counter to account for the passage of time. */
  1777. delta_t = (double)(now_hires.tv_sec -
  1778. cell_ewma->last_cell_time.tv_sec);
  1779. delta_t += ((double)(now_hires.tv_usec -
  1780. cell_ewma->last_cell_time.tv_usec)) / 1000000.0;
  1781. if (delta_t > 0.0) {
  1782. cell_ewma->cell_count *=
  1783. pow(cell_ewma_significance, delta_t / cell_ewma_interval);
  1784. //printf("cc: %f ", cell_ewma->cell_count);
  1785. }
  1786. cell_ewma->last_cell_time = now_hires;
  1787. /* Now keep track of the lowest cell count we've seen. */
  1788. if (circ_min_cell_count == NULL ||
  1789. cell_ewma->cell_count < min_cell_count) {
  1790. min_cell_count = cell_ewma->cell_count;
  1791. circ_min_cell_count = circ_iter;
  1792. }
  1793. circ_iter = *next_circ_on_conn_p(circ_iter, conn);
  1794. } while (circ_iter != circ_start);
  1795. /* OK, we've gone all the way around. Let's use the circ with the
  1796. * lowest (recent) cell count. */
  1797. circ = circ_min_cell_count;
  1798. /* Now set the appropriate EWMA cell counter to use below to add the
  1799. * cells we actually send. */
  1800. if (circ_min_cell_count->n_conn == conn) {
  1801. cell_ewma = &(circ_min_cell_count->n_cell_ewma);
  1802. } else {
  1803. cell_ewma = &(TO_OR_CIRCUIT(circ_min_cell_count)->p_cell_ewma);
  1804. }
  1805. }
  1806. if (circ->n_conn == conn) {
  1807. queue = &circ->n_conn_cells;
  1808. streams_blocked = circ->streams_blocked_on_n_conn;
  1809. } else {
  1810. queue = &TO_OR_CIRCUIT(circ)->p_conn_cells;
  1811. streams_blocked = circ->streams_blocked_on_p_conn;
  1812. }
  1813. tor_assert(*next_circ_on_conn_p(circ,conn));
  1814. for (n_flushed = 0; n_flushed < max && queue->head; ) {
  1815. packed_cell_t *cell = cell_queue_pop(queue);
  1816. tor_assert(*next_circ_on_conn_p(circ,conn));
  1817. /* Calculate the exact time that this cell has spent in the queue. */
  1818. if (get_options()->CellStatistics && !CIRCUIT_IS_ORIGIN(circ)) {
  1819. struct timeval now;
  1820. uint32_t flushed;
  1821. uint32_t cell_waiting_time;
  1822. insertion_time_queue_t *it_queue = queue->insertion_times;
  1823. tor_gettimeofday_cached(&now);
  1824. flushed = (uint32_t)((now.tv_sec % SECONDS_IN_A_DAY) * 100L +
  1825. (uint32_t)now.tv_usec / (uint32_t)10000L);
  1826. if (!it_queue || !it_queue->first) {
  1827. log_warn(LD_BUG, "Cannot determine insertion time of cell.");
  1828. } else {
  1829. or_circuit_t *orcirc = TO_OR_CIRCUIT(circ);
  1830. insertion_time_elem_t *elem = it_queue->first;
  1831. cell_waiting_time =
  1832. (uint32_t)((flushed * 10L + SECONDS_IN_A_DAY * 1000L -
  1833. elem->insertion_time * 10L) %
  1834. (SECONDS_IN_A_DAY * 1000L));
  1835. #undef SECONDS_IN_A_DAY
  1836. elem->counter--;
  1837. if (elem->counter < 1) {
  1838. it_queue->first = elem->next;
  1839. if (elem == it_queue->last)
  1840. it_queue->last = NULL;
  1841. mp_pool_release(elem);
  1842. }
  1843. orcirc->total_cell_waiting_time += cell_waiting_time;
  1844. orcirc->processed_cells++;
  1845. }
  1846. }
  1847. /* If we just flushed our queue and this circuit is used for a
  1848. * tunneled directory request, possibly advance its state. */
  1849. if (queue->n == 0 && TO_CONN(conn)->dirreq_id)
  1850. geoip_change_dirreq_state(TO_CONN(conn)->dirreq_id,
  1851. DIRREQ_TUNNELED,
  1852. DIRREQ_CIRC_QUEUE_FLUSHED);
  1853. connection_write_to_buf(cell->body, CELL_NETWORK_SIZE, TO_CONN(conn));
  1854. packed_cell_free_unchecked(cell);
  1855. ++n_flushed;
  1856. if (cell_ewma) {
  1857. cell_ewma->cell_count += 1.0;
  1858. }
  1859. if (circ != conn->active_circuits) {
  1860. /* If this happens, the current circuit just got made inactive by
  1861. * a call in connection_write_to_buf(). That's nothing to worry about:
  1862. * circuit_make_inactive_on_conn() already advanced conn->active_circuits
  1863. * for us.
  1864. */
  1865. assert_active_circuits_ok_paranoid(conn);
  1866. goto done;
  1867. }
  1868. }
  1869. tor_assert(*next_circ_on_conn_p(circ,conn));
  1870. assert_active_circuits_ok_paranoid(conn);
  1871. conn->active_circuits = *next_circ_on_conn_p(circ, conn);
  1872. /* Is the cell queue low enough to unblock all the streams that are waiting
  1873. * to write to this circuit? */
  1874. if (streams_blocked && queue->n <= CELL_QUEUE_LOWWATER_SIZE)
  1875. set_streams_blocked_on_circ(circ, conn, 0); /* unblock streams */
  1876. /* Did we just ran out of cells on this queue? */
  1877. if (queue->n == 0) {
  1878. log_debug(LD_GENERAL, "Made a circuit inactive.");
  1879. make_circuit_inactive_on_conn(circ, conn);
  1880. }
  1881. done:
  1882. if (n_flushed)
  1883. conn->timestamp_last_added_nonpadding = now;
  1884. return n_flushed;
  1885. }
  1886. /** Add <b>cell</b> to the queue of <b>circ</b> writing to <b>orconn</b>
  1887. * transmitting in <b>direction</b>. */
  1888. void
  1889. append_cell_to_circuit_queue(circuit_t *circ, or_connection_t *orconn,
  1890. cell_t *cell, cell_direction_t direction)
  1891. {
  1892. cell_queue_t *queue;
  1893. int streams_blocked;
  1894. if (direction == CELL_DIRECTION_OUT) {
  1895. queue = &circ->n_conn_cells;
  1896. streams_blocked = circ->streams_blocked_on_n_conn;
  1897. } else {
  1898. or_circuit_t *orcirc = TO_OR_CIRCUIT(circ);
  1899. queue = &orcirc->p_conn_cells;
  1900. streams_blocked = circ->streams_blocked_on_p_conn;
  1901. }
  1902. if (cell->command == CELL_RELAY_EARLY && orconn->link_proto < 2) {
  1903. /* V1 connections don't understand RELAY_EARLY. */
  1904. cell->command = CELL_RELAY;
  1905. }
  1906. cell_queue_append_packed_copy(queue, cell);
  1907. /* If we have too many cells on the circuit, we should stop reading from
  1908. * the edge streams for a while. */
  1909. if (!streams_blocked && queue->n >= CELL_QUEUE_HIGHWATER_SIZE)
  1910. set_streams_blocked_on_circ(circ, orconn, 1); /* block streams */
  1911. if (queue->n == 1) {
  1912. /* This was the first cell added to the queue. We need to make this
  1913. * circuit active. */
  1914. log_debug(LD_GENERAL, "Made a circuit active.");
  1915. make_circuit_active_on_conn(circ, orconn);
  1916. }
  1917. if (! buf_datalen(orconn->_base.outbuf)) {
  1918. /* There is no data at all waiting to be sent on the outbuf. Add a
  1919. * cell, so that we can notice when it gets flushed, flushed_some can
  1920. * get called, and we can start putting more data onto the buffer then.
  1921. */
  1922. log_debug(LD_GENERAL, "Primed a buffer.");
  1923. connection_or_flush_from_first_active_circuit(orconn, 1, approx_time());
  1924. }
  1925. }
  1926. /** Append an encoded value of <b>addr</b> to <b>payload_out</b>, which must
  1927. * have at least 18 bytes of free space. The encoding is, as specified in
  1928. * tor-spec.txt:
  1929. * RESOLVED_TYPE_IPV4 or RESOLVED_TYPE_IPV6 [1 byte]
  1930. * LENGTH [1 byte]
  1931. * ADDRESS [length bytes]
  1932. * Return the number of bytes added, or -1 on error */
  1933. int
  1934. append_address_to_payload(char *payload_out, const tor_addr_t *addr)
  1935. {
  1936. uint32_t a;
  1937. switch (tor_addr_family(addr)) {
  1938. case AF_INET:
  1939. payload_out[0] = RESOLVED_TYPE_IPV4;
  1940. payload_out[1] = 4;
  1941. a = tor_addr_to_ipv4n(addr);
  1942. memcpy(payload_out+2, &a, 4);
  1943. return 6;
  1944. case AF_INET6:
  1945. payload_out[0] = RESOLVED_TYPE_IPV6;
  1946. payload_out[1] = 16;
  1947. memcpy(payload_out+2, tor_addr_to_in6_addr8(addr), 16);
  1948. return 18;
  1949. case AF_UNSPEC:
  1950. default:
  1951. return -1;
  1952. }
  1953. }
  1954. /** Given <b>payload_len</b> bytes at <b>payload</b>, starting with an address
  1955. * encoded as by append_address_to_payload(), try to decode the address into
  1956. * *<b>addr_out</b>. Return the next byte in the payload after the address on
  1957. * success, or NULL on failure. */
  1958. const char *
  1959. decode_address_from_payload(tor_addr_t *addr_out, const char *payload,
  1960. int payload_len)
  1961. {
  1962. if (payload_len < 2)
  1963. return NULL;
  1964. if (payload_len < 2+(uint8_t)payload[1])
  1965. return NULL;
  1966. switch (payload[0]) {
  1967. case RESOLVED_TYPE_IPV4:
  1968. if (payload[1] != 4)
  1969. return NULL;
  1970. tor_addr_from_ipv4n(addr_out, get_uint32(payload+2));
  1971. break;
  1972. case RESOLVED_TYPE_IPV6:
  1973. if (payload[1] != 16)
  1974. return NULL;
  1975. tor_addr_from_ipv6_bytes(addr_out, payload+2);
  1976. break;
  1977. default:
  1978. tor_addr_make_unspec(addr_out);
  1979. break;
  1980. }
  1981. return payload + 2 + (uint8_t)payload[1];
  1982. }
  1983. /** Fail with an assert if the active circuits ring on <b>orconn</b> is
  1984. * corrupt. */
  1985. void
  1986. assert_active_circuits_ok(or_connection_t *orconn)
  1987. {
  1988. circuit_t *head = orconn->active_circuits;
  1989. circuit_t *cur = head;
  1990. if (! head)
  1991. return;
  1992. do {
  1993. circuit_t *next = *next_circ_on_conn_p(cur, orconn);
  1994. circuit_t *prev = *prev_circ_on_conn_p(cur, orconn);
  1995. tor_assert(next);
  1996. tor_assert(prev);
  1997. tor_assert(*next_circ_on_conn_p(prev, orconn) == cur);
  1998. tor_assert(*prev_circ_on_conn_p(next, orconn) == cur);
  1999. cur = next;
  2000. } while (cur != head);
  2001. }