relay.c 92 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611
  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-2013, 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. #define RELAY_PRIVATE
  12. #include "or.h"
  13. #include "addressmap.h"
  14. #include "buffers.h"
  15. #include "channel.h"
  16. #include "circuitbuild.h"
  17. #include "circuitlist.h"
  18. #include "circuituse.h"
  19. #include "config.h"
  20. #include "connection.h"
  21. #include "connection_edge.h"
  22. #include "connection_or.h"
  23. #include "control.h"
  24. #include "geoip.h"
  25. #include "main.h"
  26. #include "mempool.h"
  27. #include "networkstatus.h"
  28. #include "nodelist.h"
  29. #include "onion.h"
  30. #include "policies.h"
  31. #include "reasons.h"
  32. #include "relay.h"
  33. #include "rendcommon.h"
  34. #include "router.h"
  35. #include "routerlist.h"
  36. #include "routerparse.h"
  37. static edge_connection_t *relay_lookup_conn(circuit_t *circ, cell_t *cell,
  38. cell_direction_t cell_direction,
  39. crypt_path_t *layer_hint);
  40. static int connection_edge_process_relay_cell(cell_t *cell, circuit_t *circ,
  41. edge_connection_t *conn,
  42. crypt_path_t *layer_hint);
  43. static void circuit_consider_sending_sendme(circuit_t *circ,
  44. crypt_path_t *layer_hint);
  45. static void circuit_resume_edge_reading(circuit_t *circ,
  46. crypt_path_t *layer_hint);
  47. static int circuit_resume_edge_reading_helper(edge_connection_t *conn,
  48. circuit_t *circ,
  49. crypt_path_t *layer_hint);
  50. static int circuit_consider_stop_edge_reading(circuit_t *circ,
  51. crypt_path_t *layer_hint);
  52. static int circuit_queue_streams_are_blocked(circuit_t *circ);
  53. static void adjust_exit_policy_from_exitpolicy_failure(origin_circuit_t *circ,
  54. entry_connection_t *conn,
  55. node_t *node,
  56. const tor_addr_t *addr);
  57. /** Stop reading on edge connections when we have this many cells
  58. * waiting on the appropriate queue. */
  59. #define CELL_QUEUE_HIGHWATER_SIZE 256
  60. /** Start reading from edge connections again when we get down to this many
  61. * cells. */
  62. #define CELL_QUEUE_LOWWATER_SIZE 64
  63. /** Stats: how many relay cells have originated at this hop, or have
  64. * been relayed onward (not recognized at this hop)?
  65. */
  66. uint64_t stats_n_relay_cells_relayed = 0;
  67. /** Stats: how many relay cells have been delivered to streams at this
  68. * hop?
  69. */
  70. uint64_t stats_n_relay_cells_delivered = 0;
  71. /** Used to tell which stream to read from first on a circuit. */
  72. static tor_weak_rng_t stream_choice_rng = TOR_WEAK_RNG_INIT;
  73. /** Update digest from the payload of cell. Assign integrity part to
  74. * cell.
  75. */
  76. static void
  77. relay_set_digest(crypto_digest_t *digest, cell_t *cell)
  78. {
  79. char integrity[4];
  80. relay_header_t rh;
  81. crypto_digest_add_bytes(digest, (char*)cell->payload, CELL_PAYLOAD_SIZE);
  82. crypto_digest_get_digest(digest, integrity, 4);
  83. // log_fn(LOG_DEBUG,"Putting digest of %u %u %u %u into relay cell.",
  84. // integrity[0], integrity[1], integrity[2], integrity[3]);
  85. relay_header_unpack(&rh, cell->payload);
  86. memcpy(rh.integrity, integrity, 4);
  87. relay_header_pack(cell->payload, &rh);
  88. }
  89. /** Does the digest for this circuit indicate that this cell is for us?
  90. *
  91. * Update digest from the payload of cell (with the integrity part set
  92. * to 0). If the integrity part is valid, return 1, else restore digest
  93. * and cell to their original state and return 0.
  94. */
  95. static int
  96. relay_digest_matches(crypto_digest_t *digest, cell_t *cell)
  97. {
  98. char received_integrity[4], calculated_integrity[4];
  99. relay_header_t rh;
  100. crypto_digest_t *backup_digest=NULL;
  101. backup_digest = crypto_digest_dup(digest);
  102. relay_header_unpack(&rh, cell->payload);
  103. memcpy(received_integrity, rh.integrity, 4);
  104. memset(rh.integrity, 0, 4);
  105. relay_header_pack(cell->payload, &rh);
  106. // log_fn(LOG_DEBUG,"Reading digest of %u %u %u %u from relay cell.",
  107. // received_integrity[0], received_integrity[1],
  108. // received_integrity[2], received_integrity[3]);
  109. crypto_digest_add_bytes(digest, (char*) cell->payload, CELL_PAYLOAD_SIZE);
  110. crypto_digest_get_digest(digest, calculated_integrity, 4);
  111. if (tor_memneq(received_integrity, calculated_integrity, 4)) {
  112. // log_fn(LOG_INFO,"Recognized=0 but bad digest. Not recognizing.");
  113. // (%d vs %d).", received_integrity, calculated_integrity);
  114. /* restore digest to its old form */
  115. crypto_digest_assign(digest, backup_digest);
  116. /* restore the relay header */
  117. memcpy(rh.integrity, received_integrity, 4);
  118. relay_header_pack(cell->payload, &rh);
  119. crypto_digest_free(backup_digest);
  120. return 0;
  121. }
  122. crypto_digest_free(backup_digest);
  123. return 1;
  124. }
  125. /** Apply <b>cipher</b> to CELL_PAYLOAD_SIZE bytes of <b>in</b>
  126. * (in place).
  127. *
  128. * If <b>encrypt_mode</b> is 1 then encrypt, else decrypt.
  129. *
  130. * Return -1 if the crypto fails, else return 0.
  131. */
  132. static int
  133. relay_crypt_one_payload(crypto_cipher_t *cipher, uint8_t *in,
  134. int encrypt_mode)
  135. {
  136. int r;
  137. (void)encrypt_mode;
  138. r = crypto_cipher_crypt_inplace(cipher, (char*) in, CELL_PAYLOAD_SIZE);
  139. if (r) {
  140. log_warn(LD_BUG,"Error during relay encryption");
  141. return -1;
  142. }
  143. return 0;
  144. }
  145. /** Receive a relay cell:
  146. * - Crypt it (encrypt if headed toward the origin or if we <b>are</b> the
  147. * origin; decrypt if we're headed toward the exit).
  148. * - Check if recognized (if exitward).
  149. * - If recognized and the digest checks out, then find if there's a stream
  150. * that the cell is intended for, and deliver it to the right
  151. * connection_edge.
  152. * - If not recognized, then we need to relay it: append it to the appropriate
  153. * cell_queue on <b>circ</b>.
  154. *
  155. * Return -<b>reason</b> on failure.
  156. */
  157. int
  158. circuit_receive_relay_cell(cell_t *cell, circuit_t *circ,
  159. cell_direction_t cell_direction)
  160. {
  161. channel_t *chan = NULL;
  162. crypt_path_t *layer_hint=NULL;
  163. char recognized=0;
  164. int reason;
  165. tor_assert(cell);
  166. tor_assert(circ);
  167. tor_assert(cell_direction == CELL_DIRECTION_OUT ||
  168. cell_direction == CELL_DIRECTION_IN);
  169. if (circ->marked_for_close)
  170. return 0;
  171. if (relay_crypt(circ, cell, cell_direction, &layer_hint, &recognized) < 0) {
  172. log_warn(LD_BUG,"relay crypt failed. Dropping connection.");
  173. return -END_CIRC_REASON_INTERNAL;
  174. }
  175. if (recognized) {
  176. edge_connection_t *conn = NULL;
  177. if (circ->purpose == CIRCUIT_PURPOSE_PATH_BIAS_TESTING) {
  178. pathbias_check_probe_response(circ, cell);
  179. /* We need to drop this cell no matter what to avoid code that expects
  180. * a certain purpose (such as the hidserv code). */
  181. return 0;
  182. }
  183. conn = relay_lookup_conn(circ, cell, cell_direction,
  184. layer_hint);
  185. if (cell_direction == CELL_DIRECTION_OUT) {
  186. ++stats_n_relay_cells_delivered;
  187. log_debug(LD_OR,"Sending away from origin.");
  188. if ((reason=connection_edge_process_relay_cell(cell, circ, conn, NULL))
  189. < 0) {
  190. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  191. "connection_edge_process_relay_cell (away from origin) "
  192. "failed.");
  193. return reason;
  194. }
  195. }
  196. if (cell_direction == CELL_DIRECTION_IN) {
  197. ++stats_n_relay_cells_delivered;
  198. log_debug(LD_OR,"Sending to origin.");
  199. if ((reason = connection_edge_process_relay_cell(cell, circ, conn,
  200. layer_hint)) < 0) {
  201. log_warn(LD_OR,
  202. "connection_edge_process_relay_cell (at origin) failed.");
  203. return reason;
  204. }
  205. }
  206. return 0;
  207. }
  208. /* not recognized. pass it on. */
  209. if (cell_direction == CELL_DIRECTION_OUT) {
  210. cell->circ_id = circ->n_circ_id; /* switch it */
  211. chan = circ->n_chan;
  212. } else if (! CIRCUIT_IS_ORIGIN(circ)) {
  213. cell->circ_id = TO_OR_CIRCUIT(circ)->p_circ_id; /* switch it */
  214. chan = TO_OR_CIRCUIT(circ)->p_chan;
  215. } else {
  216. log_fn(LOG_PROTOCOL_WARN, LD_OR,
  217. "Dropping unrecognized inbound cell on origin circuit.");
  218. /* If we see unrecognized cells on path bias testing circs,
  219. * it's bad mojo. Those circuits need to die.
  220. * XXX: Shouldn't they always die? */
  221. if (circ->purpose == CIRCUIT_PURPOSE_PATH_BIAS_TESTING) {
  222. TO_ORIGIN_CIRCUIT(circ)->path_state = PATH_STATE_USE_FAILED;
  223. return -END_CIRC_REASON_TORPROTOCOL;
  224. } else {
  225. return 0;
  226. }
  227. }
  228. if (!chan) {
  229. // XXXX Can this splice stuff be done more cleanly?
  230. if (! CIRCUIT_IS_ORIGIN(circ) &&
  231. TO_OR_CIRCUIT(circ)->rend_splice &&
  232. cell_direction == CELL_DIRECTION_OUT) {
  233. or_circuit_t *splice = TO_OR_CIRCUIT(circ)->rend_splice;
  234. tor_assert(circ->purpose == CIRCUIT_PURPOSE_REND_ESTABLISHED);
  235. tor_assert(splice->base_.purpose == CIRCUIT_PURPOSE_REND_ESTABLISHED);
  236. cell->circ_id = splice->p_circ_id;
  237. cell->command = CELL_RELAY; /* can't be relay_early anyway */
  238. if ((reason = circuit_receive_relay_cell(cell, TO_CIRCUIT(splice),
  239. CELL_DIRECTION_IN)) < 0) {
  240. log_warn(LD_REND, "Error relaying cell across rendezvous; closing "
  241. "circuits");
  242. /* XXXX Do this here, or just return -1? */
  243. circuit_mark_for_close(circ, -reason);
  244. return reason;
  245. }
  246. return 0;
  247. }
  248. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  249. "Didn't recognize cell, but circ stops here! Closing circ.");
  250. return -END_CIRC_REASON_TORPROTOCOL;
  251. }
  252. log_debug(LD_OR,"Passing on unrecognized cell.");
  253. ++stats_n_relay_cells_relayed; /* XXXX no longer quite accurate {cells}
  254. * we might kill the circ before we relay
  255. * the cells. */
  256. append_cell_to_circuit_queue(circ, chan, cell, cell_direction, 0);
  257. return 0;
  258. }
  259. /** Do the appropriate en/decryptions for <b>cell</b> arriving on
  260. * <b>circ</b> in direction <b>cell_direction</b>.
  261. *
  262. * If cell_direction == CELL_DIRECTION_IN:
  263. * - If we're at the origin (we're the OP), for hops 1..N,
  264. * decrypt cell. If recognized, stop.
  265. * - Else (we're not the OP), encrypt one hop. Cell is not recognized.
  266. *
  267. * If cell_direction == CELL_DIRECTION_OUT:
  268. * - decrypt one hop. Check if recognized.
  269. *
  270. * If cell is recognized, set *recognized to 1, and set
  271. * *layer_hint to the hop that recognized it.
  272. *
  273. * Return -1 to indicate that we should mark the circuit for close,
  274. * else return 0.
  275. */
  276. int
  277. relay_crypt(circuit_t *circ, cell_t *cell, cell_direction_t cell_direction,
  278. crypt_path_t **layer_hint, char *recognized)
  279. {
  280. relay_header_t rh;
  281. tor_assert(circ);
  282. tor_assert(cell);
  283. tor_assert(recognized);
  284. tor_assert(cell_direction == CELL_DIRECTION_IN ||
  285. cell_direction == CELL_DIRECTION_OUT);
  286. if (cell_direction == CELL_DIRECTION_IN) {
  287. if (CIRCUIT_IS_ORIGIN(circ)) { /* We're at the beginning of the circuit.
  288. * We'll want to do layered decrypts. */
  289. crypt_path_t *thishop, *cpath = TO_ORIGIN_CIRCUIT(circ)->cpath;
  290. thishop = cpath;
  291. if (thishop->state != CPATH_STATE_OPEN) {
  292. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  293. "Relay cell before first created cell? Closing.");
  294. return -1;
  295. }
  296. do { /* Remember: cpath is in forward order, that is, first hop first. */
  297. tor_assert(thishop);
  298. if (relay_crypt_one_payload(thishop->b_crypto, cell->payload, 0) < 0)
  299. return -1;
  300. relay_header_unpack(&rh, cell->payload);
  301. if (rh.recognized == 0) {
  302. /* it's possibly recognized. have to check digest to be sure. */
  303. if (relay_digest_matches(thishop->b_digest, cell)) {
  304. *recognized = 1;
  305. *layer_hint = thishop;
  306. return 0;
  307. }
  308. }
  309. thishop = thishop->next;
  310. } while (thishop != cpath && thishop->state == CPATH_STATE_OPEN);
  311. log_fn(LOG_PROTOCOL_WARN, LD_OR,
  312. "Incoming cell at client not recognized. Closing.");
  313. return -1;
  314. } else { /* we're in the middle. Just one crypt. */
  315. if (relay_crypt_one_payload(TO_OR_CIRCUIT(circ)->p_crypto,
  316. cell->payload, 1) < 0)
  317. return -1;
  318. // log_fn(LOG_DEBUG,"Skipping recognized check, because we're not "
  319. // "the client.");
  320. }
  321. } else /* cell_direction == CELL_DIRECTION_OUT */ {
  322. /* we're in the middle. Just one crypt. */
  323. if (relay_crypt_one_payload(TO_OR_CIRCUIT(circ)->n_crypto,
  324. cell->payload, 0) < 0)
  325. return -1;
  326. relay_header_unpack(&rh, cell->payload);
  327. if (rh.recognized == 0) {
  328. /* it's possibly recognized. have to check digest to be sure. */
  329. if (relay_digest_matches(TO_OR_CIRCUIT(circ)->n_digest, cell)) {
  330. *recognized = 1;
  331. return 0;
  332. }
  333. }
  334. }
  335. return 0;
  336. }
  337. /** Package a relay cell from an edge:
  338. * - Encrypt it to the right layer
  339. * - Append it to the appropriate cell_queue on <b>circ</b>.
  340. */
  341. static int
  342. circuit_package_relay_cell(cell_t *cell, circuit_t *circ,
  343. cell_direction_t cell_direction,
  344. crypt_path_t *layer_hint, streamid_t on_stream)
  345. {
  346. channel_t *chan; /* where to send the cell */
  347. if (cell_direction == CELL_DIRECTION_OUT) {
  348. crypt_path_t *thishop; /* counter for repeated crypts */
  349. chan = circ->n_chan;
  350. if (!CIRCUIT_IS_ORIGIN(circ) || !chan) {
  351. log_warn(LD_BUG,"outgoing relay cell has n_chan==NULL. Dropping.");
  352. return 0; /* just drop it */
  353. }
  354. relay_set_digest(layer_hint->f_digest, cell);
  355. thishop = layer_hint;
  356. /* moving from farthest to nearest hop */
  357. do {
  358. tor_assert(thishop);
  359. /* XXXX RD This is a bug, right? */
  360. log_debug(LD_OR,"crypting a layer of the relay cell.");
  361. if (relay_crypt_one_payload(thishop->f_crypto, cell->payload, 1) < 0) {
  362. return -1;
  363. }
  364. thishop = thishop->prev;
  365. } while (thishop != TO_ORIGIN_CIRCUIT(circ)->cpath->prev);
  366. } else { /* incoming cell */
  367. or_circuit_t *or_circ;
  368. if (CIRCUIT_IS_ORIGIN(circ)) {
  369. /* We should never package an _incoming_ cell from the circuit
  370. * origin; that means we messed up somewhere. */
  371. log_warn(LD_BUG,"incoming relay cell at origin circuit. Dropping.");
  372. assert_circuit_ok(circ);
  373. return 0; /* just drop it */
  374. }
  375. or_circ = TO_OR_CIRCUIT(circ);
  376. chan = or_circ->p_chan;
  377. relay_set_digest(or_circ->p_digest, cell);
  378. if (relay_crypt_one_payload(or_circ->p_crypto, cell->payload, 1) < 0)
  379. return -1;
  380. }
  381. ++stats_n_relay_cells_relayed;
  382. append_cell_to_circuit_queue(circ, chan, cell, cell_direction, on_stream);
  383. return 0;
  384. }
  385. /** If cell's stream_id matches the stream_id of any conn that's
  386. * attached to circ, return that conn, else return NULL.
  387. */
  388. static edge_connection_t *
  389. relay_lookup_conn(circuit_t *circ, cell_t *cell,
  390. cell_direction_t cell_direction, crypt_path_t *layer_hint)
  391. {
  392. edge_connection_t *tmpconn;
  393. relay_header_t rh;
  394. relay_header_unpack(&rh, cell->payload);
  395. if (!rh.stream_id)
  396. return NULL;
  397. /* IN or OUT cells could have come from either direction, now
  398. * that we allow rendezvous *to* an OP.
  399. */
  400. if (CIRCUIT_IS_ORIGIN(circ)) {
  401. for (tmpconn = TO_ORIGIN_CIRCUIT(circ)->p_streams; tmpconn;
  402. tmpconn=tmpconn->next_stream) {
  403. if (rh.stream_id == tmpconn->stream_id &&
  404. !tmpconn->base_.marked_for_close &&
  405. tmpconn->cpath_layer == layer_hint) {
  406. log_debug(LD_APP,"found conn for stream %d.", rh.stream_id);
  407. return tmpconn;
  408. }
  409. }
  410. } else {
  411. for (tmpconn = TO_OR_CIRCUIT(circ)->n_streams; tmpconn;
  412. tmpconn=tmpconn->next_stream) {
  413. if (rh.stream_id == tmpconn->stream_id &&
  414. !tmpconn->base_.marked_for_close) {
  415. log_debug(LD_EXIT,"found conn for stream %d.", rh.stream_id);
  416. if (cell_direction == CELL_DIRECTION_OUT ||
  417. connection_edge_is_rendezvous_stream(tmpconn))
  418. return tmpconn;
  419. }
  420. }
  421. for (tmpconn = TO_OR_CIRCUIT(circ)->resolving_streams; tmpconn;
  422. tmpconn=tmpconn->next_stream) {
  423. if (rh.stream_id == tmpconn->stream_id &&
  424. !tmpconn->base_.marked_for_close) {
  425. log_debug(LD_EXIT,"found conn for stream %d.", rh.stream_id);
  426. return tmpconn;
  427. }
  428. }
  429. }
  430. return NULL; /* probably a begin relay cell */
  431. }
  432. /** Pack the relay_header_t host-order structure <b>src</b> into
  433. * network-order in the buffer <b>dest</b>. See tor-spec.txt for details
  434. * about the wire format.
  435. */
  436. void
  437. relay_header_pack(uint8_t *dest, const relay_header_t *src)
  438. {
  439. set_uint8(dest, src->command);
  440. set_uint16(dest+1, htons(src->recognized));
  441. set_uint16(dest+3, htons(src->stream_id));
  442. memcpy(dest+5, src->integrity, 4);
  443. set_uint16(dest+9, htons(src->length));
  444. }
  445. /** Unpack the network-order buffer <b>src</b> into a host-order
  446. * relay_header_t structure <b>dest</b>.
  447. */
  448. void
  449. relay_header_unpack(relay_header_t *dest, const uint8_t *src)
  450. {
  451. dest->command = get_uint8(src);
  452. dest->recognized = ntohs(get_uint16(src+1));
  453. dest->stream_id = ntohs(get_uint16(src+3));
  454. memcpy(dest->integrity, src+5, 4);
  455. dest->length = ntohs(get_uint16(src+9));
  456. }
  457. /** Convert the relay <b>command</b> into a human-readable string. */
  458. static const char *
  459. relay_command_to_string(uint8_t command)
  460. {
  461. switch (command) {
  462. case RELAY_COMMAND_BEGIN: return "BEGIN";
  463. case RELAY_COMMAND_DATA: return "DATA";
  464. case RELAY_COMMAND_END: return "END";
  465. case RELAY_COMMAND_CONNECTED: return "CONNECTED";
  466. case RELAY_COMMAND_SENDME: return "SENDME";
  467. case RELAY_COMMAND_EXTEND: return "EXTEND";
  468. case RELAY_COMMAND_EXTENDED: return "EXTENDED";
  469. case RELAY_COMMAND_TRUNCATE: return "TRUNCATE";
  470. case RELAY_COMMAND_TRUNCATED: return "TRUNCATED";
  471. case RELAY_COMMAND_DROP: return "DROP";
  472. case RELAY_COMMAND_RESOLVE: return "RESOLVE";
  473. case RELAY_COMMAND_RESOLVED: return "RESOLVED";
  474. case RELAY_COMMAND_BEGIN_DIR: return "BEGIN_DIR";
  475. case RELAY_COMMAND_ESTABLISH_INTRO: return "ESTABLISH_INTRO";
  476. case RELAY_COMMAND_ESTABLISH_RENDEZVOUS: return "ESTABLISH_RENDEZVOUS";
  477. case RELAY_COMMAND_INTRODUCE1: return "INTRODUCE1";
  478. case RELAY_COMMAND_INTRODUCE2: return "INTRODUCE2";
  479. case RELAY_COMMAND_RENDEZVOUS1: return "RENDEZVOUS1";
  480. case RELAY_COMMAND_RENDEZVOUS2: return "RENDEZVOUS2";
  481. case RELAY_COMMAND_INTRO_ESTABLISHED: return "INTRO_ESTABLISHED";
  482. case RELAY_COMMAND_RENDEZVOUS_ESTABLISHED:
  483. return "RENDEZVOUS_ESTABLISHED";
  484. case RELAY_COMMAND_INTRODUCE_ACK: return "INTRODUCE_ACK";
  485. default: return "(unrecognized)";
  486. }
  487. }
  488. /** Make a relay cell out of <b>relay_command</b> and <b>payload</b>, and send
  489. * it onto the open circuit <b>circ</b>. <b>stream_id</b> is the ID on
  490. * <b>circ</b> for the stream that's sending the relay cell, or 0 if it's a
  491. * control cell. <b>cpath_layer</b> is NULL for OR->OP cells, or the
  492. * destination hop for OP->OR cells.
  493. *
  494. * If you can't send the cell, mark the circuit for close and return -1. Else
  495. * return 0.
  496. */
  497. int
  498. relay_send_command_from_edge(streamid_t stream_id, circuit_t *circ,
  499. uint8_t relay_command, const char *payload,
  500. size_t payload_len, crypt_path_t *cpath_layer)
  501. {
  502. cell_t cell;
  503. relay_header_t rh;
  504. cell_direction_t cell_direction;
  505. /* XXXX NM Split this function into a separate versions per circuit type? */
  506. tor_assert(circ);
  507. tor_assert(payload_len <= RELAY_PAYLOAD_SIZE);
  508. memset(&cell, 0, sizeof(cell_t));
  509. cell.command = CELL_RELAY;
  510. if (cpath_layer) {
  511. cell.circ_id = circ->n_circ_id;
  512. cell_direction = CELL_DIRECTION_OUT;
  513. } else if (! CIRCUIT_IS_ORIGIN(circ)) {
  514. cell.circ_id = TO_OR_CIRCUIT(circ)->p_circ_id;
  515. cell_direction = CELL_DIRECTION_IN;
  516. } else {
  517. return -1;
  518. }
  519. memset(&rh, 0, sizeof(rh));
  520. rh.command = relay_command;
  521. rh.stream_id = stream_id;
  522. rh.length = payload_len;
  523. relay_header_pack(cell.payload, &rh);
  524. if (payload_len)
  525. memcpy(cell.payload+RELAY_HEADER_SIZE, payload, payload_len);
  526. log_debug(LD_OR,"delivering %d cell %s.", relay_command,
  527. cell_direction == CELL_DIRECTION_OUT ? "forward" : "backward");
  528. /* If we are sending an END cell and this circuit is used for a tunneled
  529. * directory request, advance its state. */
  530. if (relay_command == RELAY_COMMAND_END && circ->dirreq_id)
  531. geoip_change_dirreq_state(circ->dirreq_id, DIRREQ_TUNNELED,
  532. DIRREQ_END_CELL_SENT);
  533. if (cell_direction == CELL_DIRECTION_OUT && circ->n_chan) {
  534. /* if we're using relaybandwidthrate, this conn wants priority */
  535. channel_timestamp_client(circ->n_chan);
  536. }
  537. if (cell_direction == CELL_DIRECTION_OUT) {
  538. origin_circuit_t *origin_circ = TO_ORIGIN_CIRCUIT(circ);
  539. if (origin_circ->remaining_relay_early_cells > 0 &&
  540. (relay_command == RELAY_COMMAND_EXTEND ||
  541. relay_command == RELAY_COMMAND_EXTEND2 ||
  542. cpath_layer != origin_circ->cpath)) {
  543. /* If we've got any relay_early cells left and (we're sending
  544. * an extend cell or we're not talking to the first hop), use
  545. * one of them. Don't worry about the conn protocol version:
  546. * append_cell_to_circuit_queue will fix it up. */
  547. cell.command = CELL_RELAY_EARLY;
  548. --origin_circ->remaining_relay_early_cells;
  549. log_debug(LD_OR, "Sending a RELAY_EARLY cell; %d remaining.",
  550. (int)origin_circ->remaining_relay_early_cells);
  551. /* Memorize the command that is sent as RELAY_EARLY cell; helps debug
  552. * task 878. */
  553. origin_circ->relay_early_commands[
  554. origin_circ->relay_early_cells_sent++] = relay_command;
  555. } else if (relay_command == RELAY_COMMAND_EXTEND ||
  556. relay_command == RELAY_COMMAND_EXTEND2) {
  557. /* If no RELAY_EARLY cells can be sent over this circuit, log which
  558. * commands have been sent as RELAY_EARLY cells before; helps debug
  559. * task 878. */
  560. smartlist_t *commands_list = smartlist_new();
  561. int i = 0;
  562. char *commands = NULL;
  563. for (; i < origin_circ->relay_early_cells_sent; i++)
  564. smartlist_add(commands_list, (char *)
  565. relay_command_to_string(origin_circ->relay_early_commands[i]));
  566. commands = smartlist_join_strings(commands_list, ",", 0, NULL);
  567. log_warn(LD_BUG, "Uh-oh. We're sending a RELAY_COMMAND_EXTEND cell, "
  568. "but we have run out of RELAY_EARLY cells on that circuit. "
  569. "Commands sent before: %s", commands);
  570. tor_free(commands);
  571. smartlist_free(commands_list);
  572. }
  573. }
  574. if (circuit_package_relay_cell(&cell, circ, cell_direction, cpath_layer,
  575. stream_id) < 0) {
  576. log_warn(LD_BUG,"circuit_package_relay_cell failed. Closing.");
  577. circuit_mark_for_close(circ, END_CIRC_REASON_INTERNAL);
  578. return -1;
  579. }
  580. return 0;
  581. }
  582. /** Make a relay cell out of <b>relay_command</b> and <b>payload</b>, and
  583. * send it onto the open circuit <b>circ</b>. <b>fromconn</b> is the stream
  584. * that's sending the relay cell, or NULL if it's a control cell.
  585. * <b>cpath_layer</b> is NULL for OR->OP cells, or the destination hop
  586. * for OP->OR cells.
  587. *
  588. * If you can't send the cell, mark the circuit for close and
  589. * return -1. Else return 0.
  590. */
  591. int
  592. connection_edge_send_command(edge_connection_t *fromconn,
  593. uint8_t relay_command, const char *payload,
  594. size_t payload_len)
  595. {
  596. /* XXXX NM Split this function into a separate versions per circuit type? */
  597. circuit_t *circ;
  598. crypt_path_t *cpath_layer = fromconn->cpath_layer;
  599. tor_assert(fromconn);
  600. circ = fromconn->on_circuit;
  601. if (fromconn->base_.marked_for_close) {
  602. log_warn(LD_BUG,
  603. "called on conn that's already marked for close at %s:%d.",
  604. fromconn->base_.marked_for_close_file,
  605. fromconn->base_.marked_for_close);
  606. return 0;
  607. }
  608. if (!circ) {
  609. if (fromconn->base_.type == CONN_TYPE_AP) {
  610. log_info(LD_APP,"no circ. Closing conn.");
  611. connection_mark_unattached_ap(EDGE_TO_ENTRY_CONN(fromconn),
  612. END_STREAM_REASON_INTERNAL);
  613. } else {
  614. log_info(LD_EXIT,"no circ. Closing conn.");
  615. fromconn->edge_has_sent_end = 1; /* no circ to send to */
  616. fromconn->end_reason = END_STREAM_REASON_INTERNAL;
  617. connection_mark_for_close(TO_CONN(fromconn));
  618. }
  619. return -1;
  620. }
  621. return relay_send_command_from_edge(fromconn->stream_id, circ,
  622. relay_command, payload,
  623. payload_len, cpath_layer);
  624. }
  625. /** How many times will I retry a stream that fails due to DNS
  626. * resolve failure or misc error?
  627. */
  628. #define MAX_RESOLVE_FAILURES 3
  629. /** Return 1 if reason is something that you should retry if you
  630. * get the end cell before you've connected; else return 0. */
  631. static int
  632. edge_reason_is_retriable(int reason)
  633. {
  634. return reason == END_STREAM_REASON_HIBERNATING ||
  635. reason == END_STREAM_REASON_RESOURCELIMIT ||
  636. reason == END_STREAM_REASON_EXITPOLICY ||
  637. reason == END_STREAM_REASON_RESOLVEFAILED ||
  638. reason == END_STREAM_REASON_MISC ||
  639. reason == END_STREAM_REASON_NOROUTE;
  640. }
  641. /** Called when we receive an END cell on a stream that isn't open yet,
  642. * from the client side.
  643. * Arguments are as for connection_edge_process_relay_cell().
  644. */
  645. static int
  646. connection_ap_process_end_not_open(
  647. relay_header_t *rh, cell_t *cell, origin_circuit_t *circ,
  648. entry_connection_t *conn, crypt_path_t *layer_hint)
  649. {
  650. node_t *exitrouter;
  651. int reason = *(cell->payload+RELAY_HEADER_SIZE);
  652. int control_reason;
  653. edge_connection_t *edge_conn = ENTRY_TO_EDGE_CONN(conn);
  654. (void) layer_hint; /* unused */
  655. if (rh->length > 0) {
  656. if (reason == END_STREAM_REASON_TORPROTOCOL ||
  657. reason == END_STREAM_REASON_INTERNAL ||
  658. reason == END_STREAM_REASON_DESTROY) {
  659. /* All three of these reasons could mean a failed tag
  660. * hit the exit and it complained. Do not probe.
  661. * Fail the circuit. */
  662. circ->path_state = PATH_STATE_USE_FAILED;
  663. return -END_CIRC_REASON_TORPROTOCOL;
  664. } else {
  665. /* Path bias: If we get a valid reason code from the exit,
  666. * it wasn't due to tagging.
  667. *
  668. * We rely on recognized+digest being strong enough to make
  669. * tags unlikely to allow us to get tagged, yet 'recognized'
  670. * reason codes here. */
  671. pathbias_mark_use_success(circ);
  672. }
  673. }
  674. if (rh->length == 0) {
  675. reason = END_STREAM_REASON_MISC;
  676. }
  677. control_reason = reason | END_STREAM_REASON_FLAG_REMOTE;
  678. if (edge_reason_is_retriable(reason) &&
  679. /* avoid retry if rend */
  680. !connection_edge_is_rendezvous_stream(edge_conn)) {
  681. const char *chosen_exit_digest =
  682. circ->build_state->chosen_exit->identity_digest;
  683. log_info(LD_APP,"Address '%s' refused due to '%s'. Considering retrying.",
  684. safe_str(conn->socks_request->address),
  685. stream_end_reason_to_string(reason));
  686. exitrouter = node_get_mutable_by_id(chosen_exit_digest);
  687. switch (reason) {
  688. case END_STREAM_REASON_EXITPOLICY: {
  689. tor_addr_t addr;
  690. tor_addr_make_unspec(&addr);
  691. if (rh->length >= 5) {
  692. int ttl = -1;
  693. tor_addr_make_unspec(&addr);
  694. if (rh->length == 5 || rh->length == 9) {
  695. tor_addr_from_ipv4n(&addr,
  696. get_uint32(cell->payload+RELAY_HEADER_SIZE+1));
  697. if (rh->length == 9)
  698. ttl = (int)ntohl(get_uint32(cell->payload+RELAY_HEADER_SIZE+5));
  699. } else if (rh->length == 17 || rh->length == 21) {
  700. tor_addr_from_ipv6_bytes(&addr,
  701. (char*)(cell->payload+RELAY_HEADER_SIZE+1));
  702. if (rh->length == 21)
  703. ttl = (int)ntohl(get_uint32(cell->payload+RELAY_HEADER_SIZE+17));
  704. }
  705. if (tor_addr_is_null(&addr)) {
  706. log_info(LD_APP,"Address '%s' resolved to 0.0.0.0. Closing,",
  707. safe_str(conn->socks_request->address));
  708. connection_mark_unattached_ap(conn, END_STREAM_REASON_TORPROTOCOL);
  709. return 0;
  710. }
  711. if ((tor_addr_family(&addr) == AF_INET && !conn->ipv4_traffic_ok) ||
  712. (tor_addr_family(&addr) == AF_INET6 && !conn->ipv6_traffic_ok)) {
  713. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  714. "Got an EXITPOLICY failure on a connection with a "
  715. "mismatched family. Closing.");
  716. connection_mark_unattached_ap(conn, END_STREAM_REASON_TORPROTOCOL);
  717. return 0;
  718. }
  719. if (get_options()->ClientDNSRejectInternalAddresses &&
  720. tor_addr_is_internal(&addr, 0)) {
  721. log_info(LD_APP,"Address '%s' resolved to internal. Closing,",
  722. safe_str(conn->socks_request->address));
  723. connection_mark_unattached_ap(conn, END_STREAM_REASON_TORPROTOCOL);
  724. return 0;
  725. }
  726. client_dns_set_addressmap(conn,
  727. conn->socks_request->address, &addr,
  728. conn->chosen_exit_name, ttl);
  729. {
  730. char new_addr[TOR_ADDR_BUF_LEN];
  731. tor_addr_to_str(new_addr, &addr, sizeof(new_addr), 1);
  732. if (strcmp(conn->socks_request->address, new_addr)) {
  733. strlcpy(conn->socks_request->address, new_addr,
  734. sizeof(conn->socks_request->address));
  735. control_event_stream_status(conn, STREAM_EVENT_REMAP, 0);
  736. }
  737. }
  738. }
  739. /* check if he *ought* to have allowed it */
  740. adjust_exit_policy_from_exitpolicy_failure(circ,
  741. conn,
  742. exitrouter,
  743. &addr);
  744. if (conn->chosen_exit_optional ||
  745. conn->chosen_exit_retries) {
  746. /* stop wanting a specific exit */
  747. conn->chosen_exit_optional = 0;
  748. /* A non-zero chosen_exit_retries can happen if we set a
  749. * TrackHostExits for this address under a port that the exit
  750. * relay allows, but then try the same address with a different
  751. * port that it doesn't allow to exit. We shouldn't unregister
  752. * the mapping, since it is probably still wanted on the
  753. * original port. But now we give away to the exit relay that
  754. * we probably have a TrackHostExits on it. So be it. */
  755. conn->chosen_exit_retries = 0;
  756. tor_free(conn->chosen_exit_name); /* clears it */
  757. }
  758. if (connection_ap_detach_retriable(conn, circ, control_reason) >= 0)
  759. return 0;
  760. /* else, conn will get closed below */
  761. break;
  762. }
  763. case END_STREAM_REASON_CONNECTREFUSED:
  764. if (!conn->chosen_exit_optional)
  765. break; /* break means it'll close, below */
  766. /* Else fall through: expire this circuit, clear the
  767. * chosen_exit_name field, and try again. */
  768. case END_STREAM_REASON_RESOLVEFAILED:
  769. case END_STREAM_REASON_TIMEOUT:
  770. case END_STREAM_REASON_MISC:
  771. case END_STREAM_REASON_NOROUTE:
  772. if (client_dns_incr_failures(conn->socks_request->address)
  773. < MAX_RESOLVE_FAILURES) {
  774. /* We haven't retried too many times; reattach the connection. */
  775. circuit_log_path(LOG_INFO,LD_APP,circ);
  776. /* Mark this circuit "unusable for new streams". */
  777. mark_circuit_unusable_for_new_conns(circ);
  778. if (conn->chosen_exit_optional) {
  779. /* stop wanting a specific exit */
  780. conn->chosen_exit_optional = 0;
  781. tor_free(conn->chosen_exit_name); /* clears it */
  782. }
  783. if (connection_ap_detach_retriable(conn, circ, control_reason) >= 0)
  784. return 0;
  785. /* else, conn will get closed below */
  786. } else {
  787. log_notice(LD_APP,
  788. "Have tried resolving or connecting to address '%s' "
  789. "at %d different places. Giving up.",
  790. safe_str(conn->socks_request->address),
  791. MAX_RESOLVE_FAILURES);
  792. /* clear the failures, so it will have a full try next time */
  793. client_dns_clear_failures(conn->socks_request->address);
  794. }
  795. break;
  796. case END_STREAM_REASON_HIBERNATING:
  797. case END_STREAM_REASON_RESOURCELIMIT:
  798. if (exitrouter) {
  799. policies_set_node_exitpolicy_to_reject_all(exitrouter);
  800. }
  801. if (conn->chosen_exit_optional) {
  802. /* stop wanting a specific exit */
  803. conn->chosen_exit_optional = 0;
  804. tor_free(conn->chosen_exit_name); /* clears it */
  805. }
  806. if (connection_ap_detach_retriable(conn, circ, control_reason) >= 0)
  807. return 0;
  808. /* else, will close below */
  809. break;
  810. } /* end switch */
  811. log_info(LD_APP,"Giving up on retrying; conn can't be handled.");
  812. }
  813. log_info(LD_APP,
  814. "Edge got end (%s) before we're connected. Marking for close.",
  815. stream_end_reason_to_string(rh->length > 0 ? reason : -1));
  816. circuit_log_path(LOG_INFO,LD_APP,circ);
  817. /* need to test because of detach_retriable */
  818. if (!ENTRY_TO_CONN(conn)->marked_for_close)
  819. connection_mark_unattached_ap(conn, control_reason);
  820. return 0;
  821. }
  822. /** Called when we have gotten an END_REASON_EXITPOLICY failure on <b>circ</b>
  823. * for <b>conn</b>, while attempting to connect via <b>node</b>. If the node
  824. * told us which address it rejected, then <b>addr</b> is that address;
  825. * otherwise it is AF_UNSPEC.
  826. *
  827. * If we are sure the node should have allowed this address, mark the node as
  828. * having a reject *:* exit policy. Otherwise, mark the circuit as unusable
  829. * for this particular address.
  830. **/
  831. static void
  832. adjust_exit_policy_from_exitpolicy_failure(origin_circuit_t *circ,
  833. entry_connection_t *conn,
  834. node_t *node,
  835. const tor_addr_t *addr)
  836. {
  837. int make_reject_all = 0;
  838. const sa_family_t family = tor_addr_family(addr);
  839. if (node) {
  840. tor_addr_t tmp;
  841. int asked_for_family = tor_addr_parse(&tmp, conn->socks_request->address);
  842. if (family == AF_UNSPEC) {
  843. make_reject_all = 1;
  844. } else if (node_exit_policy_is_exact(node, family) &&
  845. asked_for_family != -1 && !conn->chosen_exit_name) {
  846. make_reject_all = 1;
  847. }
  848. if (make_reject_all) {
  849. log_info(LD_APP,
  850. "Exitrouter %s seems to be more restrictive than its exit "
  851. "policy. Not using this router as exit for now.",
  852. node_describe(node));
  853. policies_set_node_exitpolicy_to_reject_all(node);
  854. }
  855. }
  856. if (family != AF_UNSPEC)
  857. addr_policy_append_reject_addr(&circ->prepend_policy, addr);
  858. }
  859. /** Helper: change the socks_request-&gt;address field on conn to the
  860. * dotted-quad representation of <b>new_addr</b>,
  861. * and send an appropriate REMAP event. */
  862. static void
  863. remap_event_helper(entry_connection_t *conn, const tor_addr_t *new_addr)
  864. {
  865. tor_addr_to_str(conn->socks_request->address, new_addr,
  866. sizeof(conn->socks_request->address),
  867. 1);
  868. control_event_stream_status(conn, STREAM_EVENT_REMAP,
  869. REMAP_STREAM_SOURCE_EXIT);
  870. }
  871. /** Extract the contents of a connected cell in <b>cell</b>, whose relay
  872. * header has already been parsed into <b>rh</b>. On success, set
  873. * <b>addr_out</b> to the address we're connected to, and <b>ttl_out</b> to
  874. * the ttl of that address, in seconds, and return 0. On failure, return
  875. * -1. */
  876. int
  877. connected_cell_parse(const relay_header_t *rh, const cell_t *cell,
  878. tor_addr_t *addr_out, int *ttl_out)
  879. {
  880. uint32_t bytes;
  881. const uint8_t *payload = cell->payload + RELAY_HEADER_SIZE;
  882. tor_addr_make_unspec(addr_out);
  883. *ttl_out = -1;
  884. if (rh->length == 0)
  885. return 0;
  886. if (rh->length < 4)
  887. return -1;
  888. bytes = ntohl(get_uint32(payload));
  889. /* If bytes is 0, this is maybe a v6 address. Otherwise it's a v4 address */
  890. if (bytes != 0) {
  891. /* v4 address */
  892. tor_addr_from_ipv4h(addr_out, bytes);
  893. if (rh->length >= 8) {
  894. bytes = ntohl(get_uint32(payload + 4));
  895. if (bytes <= INT32_MAX)
  896. *ttl_out = bytes;
  897. }
  898. } else {
  899. if (rh->length < 25) /* 4 bytes of 0s, 1 addr, 16 ipv4, 4 ttl. */
  900. return -1;
  901. if (get_uint8(payload + 4) != 6)
  902. return -1;
  903. tor_addr_from_ipv6_bytes(addr_out, (char*)(payload + 5));
  904. bytes = ntohl(get_uint32(payload + 21));
  905. if (bytes <= INT32_MAX)
  906. *ttl_out = (int) bytes;
  907. }
  908. return 0;
  909. }
  910. /** An incoming relay cell has arrived from circuit <b>circ</b> to
  911. * stream <b>conn</b>.
  912. *
  913. * The arguments here are the same as in
  914. * connection_edge_process_relay_cell() below; this function is called
  915. * from there when <b>conn</b> is defined and not in an open state.
  916. */
  917. static int
  918. connection_edge_process_relay_cell_not_open(
  919. relay_header_t *rh, cell_t *cell, circuit_t *circ,
  920. edge_connection_t *conn, crypt_path_t *layer_hint)
  921. {
  922. if (rh->command == RELAY_COMMAND_END) {
  923. if (CIRCUIT_IS_ORIGIN(circ) && conn->base_.type == CONN_TYPE_AP) {
  924. return connection_ap_process_end_not_open(rh, cell,
  925. TO_ORIGIN_CIRCUIT(circ),
  926. EDGE_TO_ENTRY_CONN(conn),
  927. layer_hint);
  928. } else {
  929. /* we just got an 'end', don't need to send one */
  930. conn->edge_has_sent_end = 1;
  931. conn->end_reason = *(cell->payload+RELAY_HEADER_SIZE) |
  932. END_STREAM_REASON_FLAG_REMOTE;
  933. connection_mark_for_close(TO_CONN(conn));
  934. return 0;
  935. }
  936. }
  937. if (conn->base_.type == CONN_TYPE_AP &&
  938. rh->command == RELAY_COMMAND_CONNECTED) {
  939. tor_addr_t addr;
  940. int ttl;
  941. entry_connection_t *entry_conn = EDGE_TO_ENTRY_CONN(conn);
  942. tor_assert(CIRCUIT_IS_ORIGIN(circ));
  943. if (conn->base_.state != AP_CONN_STATE_CONNECT_WAIT) {
  944. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  945. "Got 'connected' while not in state connect_wait. Dropping.");
  946. return 0;
  947. }
  948. conn->base_.state = AP_CONN_STATE_OPEN;
  949. log_info(LD_APP,"'connected' received after %d seconds.",
  950. (int)(time(NULL) - conn->base_.timestamp_lastread));
  951. if (connected_cell_parse(rh, cell, &addr, &ttl) < 0) {
  952. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  953. "Got a badly formatted connected cell. Closing.");
  954. connection_edge_end(conn, END_STREAM_REASON_TORPROTOCOL);
  955. connection_mark_unattached_ap(entry_conn, END_STREAM_REASON_TORPROTOCOL);
  956. }
  957. if (tor_addr_family(&addr) != AF_UNSPEC) {
  958. const sa_family_t family = tor_addr_family(&addr);
  959. if (tor_addr_is_null(&addr) ||
  960. (get_options()->ClientDNSRejectInternalAddresses &&
  961. tor_addr_is_internal(&addr, 0))) {
  962. log_info(LD_APP, "...but it claims the IP address was %s. Closing.",
  963. fmt_addr(&addr));
  964. connection_edge_end(conn, END_STREAM_REASON_TORPROTOCOL);
  965. connection_mark_unattached_ap(entry_conn,
  966. END_STREAM_REASON_TORPROTOCOL);
  967. return 0;
  968. }
  969. if ((family == AF_INET && ! entry_conn->ipv4_traffic_ok) ||
  970. (family == AF_INET6 && ! entry_conn->ipv6_traffic_ok)) {
  971. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  972. "Got a connected cell to %s with unsupported address family."
  973. " Closing.", fmt_addr(&addr));
  974. connection_edge_end(conn, END_STREAM_REASON_TORPROTOCOL);
  975. connection_mark_unattached_ap(entry_conn,
  976. END_STREAM_REASON_TORPROTOCOL);
  977. return 0;
  978. }
  979. client_dns_set_addressmap(entry_conn,
  980. entry_conn->socks_request->address, &addr,
  981. entry_conn->chosen_exit_name, ttl);
  982. remap_event_helper(entry_conn, &addr);
  983. }
  984. circuit_log_path(LOG_INFO,LD_APP,TO_ORIGIN_CIRCUIT(circ));
  985. /* don't send a socks reply to transparent conns */
  986. tor_assert(entry_conn->socks_request != NULL);
  987. if (!entry_conn->socks_request->has_finished)
  988. connection_ap_handshake_socks_reply(entry_conn, NULL, 0, 0);
  989. /* Was it a linked dir conn? If so, a dir request just started to
  990. * fetch something; this could be a bootstrap status milestone. */
  991. log_debug(LD_APP, "considering");
  992. if (TO_CONN(conn)->linked_conn &&
  993. TO_CONN(conn)->linked_conn->type == CONN_TYPE_DIR) {
  994. connection_t *dirconn = TO_CONN(conn)->linked_conn;
  995. log_debug(LD_APP, "it is! %d", dirconn->purpose);
  996. switch (dirconn->purpose) {
  997. case DIR_PURPOSE_FETCH_CERTIFICATE:
  998. if (consensus_is_waiting_for_certs())
  999. control_event_bootstrap(BOOTSTRAP_STATUS_LOADING_KEYS, 0);
  1000. break;
  1001. case DIR_PURPOSE_FETCH_CONSENSUS:
  1002. control_event_bootstrap(BOOTSTRAP_STATUS_LOADING_STATUS, 0);
  1003. break;
  1004. case DIR_PURPOSE_FETCH_SERVERDESC:
  1005. control_event_bootstrap(BOOTSTRAP_STATUS_LOADING_DESCRIPTORS,
  1006. count_loading_descriptors_progress());
  1007. break;
  1008. }
  1009. }
  1010. /* This is definitely a success, so forget about any pending data we
  1011. * had sent. */
  1012. if (entry_conn->pending_optimistic_data) {
  1013. generic_buffer_free(entry_conn->pending_optimistic_data);
  1014. entry_conn->pending_optimistic_data = NULL;
  1015. }
  1016. /* handle anything that might have queued */
  1017. if (connection_edge_package_raw_inbuf(conn, 1, NULL) < 0) {
  1018. /* (We already sent an end cell if possible) */
  1019. connection_mark_for_close(TO_CONN(conn));
  1020. return 0;
  1021. }
  1022. return 0;
  1023. }
  1024. if (conn->base_.type == CONN_TYPE_AP &&
  1025. rh->command == RELAY_COMMAND_RESOLVED) {
  1026. int ttl;
  1027. int answer_len;
  1028. uint8_t answer_type;
  1029. entry_connection_t *entry_conn = EDGE_TO_ENTRY_CONN(conn);
  1030. if (conn->base_.state != AP_CONN_STATE_RESOLVE_WAIT) {
  1031. log_fn(LOG_PROTOCOL_WARN, LD_APP, "Got a 'resolved' cell while "
  1032. "not in state resolve_wait. Dropping.");
  1033. return 0;
  1034. }
  1035. tor_assert(SOCKS_COMMAND_IS_RESOLVE(entry_conn->socks_request->command));
  1036. answer_len = cell->payload[RELAY_HEADER_SIZE+1];
  1037. if (rh->length < 2 || answer_len+2>rh->length) {
  1038. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  1039. "Dropping malformed 'resolved' cell");
  1040. connection_mark_unattached_ap(entry_conn, END_STREAM_REASON_TORPROTOCOL);
  1041. return 0;
  1042. }
  1043. answer_type = cell->payload[RELAY_HEADER_SIZE];
  1044. if (rh->length >= answer_len+6)
  1045. ttl = (int)ntohl(get_uint32(cell->payload+RELAY_HEADER_SIZE+
  1046. 2+answer_len));
  1047. else
  1048. ttl = -1;
  1049. if (answer_type == RESOLVED_TYPE_IPV4 && answer_len == 4) {
  1050. uint32_t addr = ntohl(get_uint32(cell->payload+RELAY_HEADER_SIZE+2));
  1051. if (get_options()->ClientDNSRejectInternalAddresses &&
  1052. is_internal_IP(addr, 0)) {
  1053. log_info(LD_APP,"Got a resolve with answer %s. Rejecting.",
  1054. fmt_addr32(addr));
  1055. connection_ap_handshake_socks_resolved(entry_conn,
  1056. RESOLVED_TYPE_ERROR_TRANSIENT,
  1057. 0, NULL, 0, TIME_MAX);
  1058. connection_mark_unattached_ap(entry_conn,
  1059. END_STREAM_REASON_TORPROTOCOL);
  1060. return 0;
  1061. }
  1062. }
  1063. connection_ap_handshake_socks_resolved(entry_conn,
  1064. answer_type,
  1065. cell->payload[RELAY_HEADER_SIZE+1], /*answer_len*/
  1066. cell->payload+RELAY_HEADER_SIZE+2, /*answer*/
  1067. ttl,
  1068. -1);
  1069. if (answer_type == RESOLVED_TYPE_IPV4 && answer_len == 4) {
  1070. tor_addr_t addr;
  1071. tor_addr_from_ipv4n(&addr,
  1072. get_uint32(cell->payload+RELAY_HEADER_SIZE+2));
  1073. remap_event_helper(entry_conn, &addr);
  1074. } else if (answer_type == RESOLVED_TYPE_IPV6 && answer_len == 16) {
  1075. tor_addr_t addr;
  1076. tor_addr_from_ipv6_bytes(&addr,
  1077. (char*)(cell->payload+RELAY_HEADER_SIZE+2));
  1078. remap_event_helper(entry_conn, &addr);
  1079. }
  1080. connection_mark_unattached_ap(entry_conn,
  1081. END_STREAM_REASON_DONE |
  1082. END_STREAM_REASON_FLAG_ALREADY_SOCKS_REPLIED);
  1083. return 0;
  1084. }
  1085. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  1086. "Got an unexpected relay command %d, in state %d (%s). Dropping.",
  1087. rh->command, conn->base_.state,
  1088. conn_state_to_string(conn->base_.type, conn->base_.state));
  1089. return 0; /* for forward compatibility, don't kill the circuit */
  1090. // connection_edge_end(conn, END_STREAM_REASON_TORPROTOCOL);
  1091. // connection_mark_for_close(conn);
  1092. // return -1;
  1093. }
  1094. /** An incoming relay cell has arrived on circuit <b>circ</b>. If
  1095. * <b>conn</b> is NULL this is a control cell, else <b>cell</b> is
  1096. * destined for <b>conn</b>.
  1097. *
  1098. * If <b>layer_hint</b> is defined, then we're the origin of the
  1099. * circuit, and it specifies the hop that packaged <b>cell</b>.
  1100. *
  1101. * Return -reason if you want to warn and tear down the circuit, else 0.
  1102. */
  1103. static int
  1104. connection_edge_process_relay_cell(cell_t *cell, circuit_t *circ,
  1105. edge_connection_t *conn,
  1106. crypt_path_t *layer_hint)
  1107. {
  1108. static int num_seen=0;
  1109. relay_header_t rh;
  1110. unsigned domain = layer_hint?LD_APP:LD_EXIT;
  1111. int reason;
  1112. int optimistic_data = 0; /* Set to 1 if we receive data on a stream
  1113. * that's in the EXIT_CONN_STATE_RESOLVING
  1114. * or EXIT_CONN_STATE_CONNECTING states. */
  1115. tor_assert(cell);
  1116. tor_assert(circ);
  1117. relay_header_unpack(&rh, cell->payload);
  1118. // log_fn(LOG_DEBUG,"command %d stream %d", rh.command, rh.stream_id);
  1119. num_seen++;
  1120. log_debug(domain, "Now seen %d relay cells here (command %d, stream %d).",
  1121. num_seen, rh.command, rh.stream_id);
  1122. if (rh.length > RELAY_PAYLOAD_SIZE) {
  1123. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  1124. "Relay cell length field too long. Closing circuit.");
  1125. return - END_CIRC_REASON_TORPROTOCOL;
  1126. }
  1127. if (rh.stream_id == 0) {
  1128. switch (rh.command) {
  1129. case RELAY_COMMAND_BEGIN:
  1130. case RELAY_COMMAND_CONNECTED:
  1131. case RELAY_COMMAND_DATA:
  1132. case RELAY_COMMAND_END:
  1133. case RELAY_COMMAND_RESOLVE:
  1134. case RELAY_COMMAND_RESOLVED:
  1135. case RELAY_COMMAND_BEGIN_DIR:
  1136. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL, "Relay command %d with zero "
  1137. "stream_id. Dropping.", (int)rh.command);
  1138. return 0;
  1139. default:
  1140. ;
  1141. }
  1142. }
  1143. /* either conn is NULL, in which case we've got a control cell, or else
  1144. * conn points to the recognized stream. */
  1145. if (conn && !connection_state_is_open(TO_CONN(conn))) {
  1146. if (conn->base_.type == CONN_TYPE_EXIT &&
  1147. (conn->base_.state == EXIT_CONN_STATE_CONNECTING ||
  1148. conn->base_.state == EXIT_CONN_STATE_RESOLVING) &&
  1149. rh.command == RELAY_COMMAND_DATA) {
  1150. /* Allow DATA cells to be delivered to an exit node in state
  1151. * EXIT_CONN_STATE_CONNECTING or EXIT_CONN_STATE_RESOLVING.
  1152. * This speeds up HTTP, for example. */
  1153. optimistic_data = 1;
  1154. } else {
  1155. return connection_edge_process_relay_cell_not_open(
  1156. &rh, cell, circ, conn, layer_hint);
  1157. }
  1158. }
  1159. switch (rh.command) {
  1160. case RELAY_COMMAND_DROP:
  1161. // log_info(domain,"Got a relay-level padding cell. Dropping.");
  1162. return 0;
  1163. case RELAY_COMMAND_BEGIN:
  1164. case RELAY_COMMAND_BEGIN_DIR:
  1165. if (layer_hint &&
  1166. circ->purpose != CIRCUIT_PURPOSE_S_REND_JOINED) {
  1167. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  1168. "Relay begin request unsupported at AP. Dropping.");
  1169. return 0;
  1170. }
  1171. if (circ->purpose == CIRCUIT_PURPOSE_S_REND_JOINED &&
  1172. layer_hint != TO_ORIGIN_CIRCUIT(circ)->cpath->prev) {
  1173. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  1174. "Relay begin request to Hidden Service "
  1175. "from intermediary node. Dropping.");
  1176. return 0;
  1177. }
  1178. if (conn) {
  1179. log_fn(LOG_PROTOCOL_WARN, domain,
  1180. "Begin cell for known stream. Dropping.");
  1181. return 0;
  1182. }
  1183. if (rh.command == RELAY_COMMAND_BEGIN_DIR) {
  1184. /* Assign this circuit and its app-ward OR connection a unique ID,
  1185. * so that we can measure download times. The local edge and dir
  1186. * connection will be assigned the same ID when they are created
  1187. * and linked. */
  1188. static uint64_t next_id = 0;
  1189. circ->dirreq_id = ++next_id;
  1190. TO_OR_CIRCUIT(circ)->p_chan->dirreq_id = circ->dirreq_id;
  1191. }
  1192. return connection_exit_begin_conn(cell, circ);
  1193. case RELAY_COMMAND_DATA:
  1194. ++stats_n_data_cells_received;
  1195. if (( layer_hint && --layer_hint->deliver_window < 0) ||
  1196. (!layer_hint && --circ->deliver_window < 0)) {
  1197. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  1198. "(relay data) circ deliver_window below 0. Killing.");
  1199. if (conn) {
  1200. /* XXXX Do we actually need to do this? Will killing the circuit
  1201. * not send an END and mark the stream for close as appropriate? */
  1202. connection_edge_end(conn, END_STREAM_REASON_TORPROTOCOL);
  1203. connection_mark_for_close(TO_CONN(conn));
  1204. }
  1205. return -END_CIRC_REASON_TORPROTOCOL;
  1206. }
  1207. log_debug(domain,"circ deliver_window now %d.", layer_hint ?
  1208. layer_hint->deliver_window : circ->deliver_window);
  1209. circuit_consider_sending_sendme(circ, layer_hint);
  1210. if (!conn) {
  1211. log_info(domain,"data cell dropped, unknown stream (streamid %d).",
  1212. rh.stream_id);
  1213. return 0;
  1214. }
  1215. if (--conn->deliver_window < 0) { /* is it below 0 after decrement? */
  1216. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  1217. "(relay data) conn deliver_window below 0. Killing.");
  1218. return -END_CIRC_REASON_TORPROTOCOL;
  1219. }
  1220. stats_n_data_bytes_received += rh.length;
  1221. connection_write_to_buf((char*)(cell->payload + RELAY_HEADER_SIZE),
  1222. rh.length, TO_CONN(conn));
  1223. if (!optimistic_data) {
  1224. /* Only send a SENDME if we're not getting optimistic data; otherwise
  1225. * a SENDME could arrive before the CONNECTED.
  1226. */
  1227. connection_edge_consider_sending_sendme(conn);
  1228. }
  1229. return 0;
  1230. case RELAY_COMMAND_END:
  1231. reason = rh.length > 0 ?
  1232. get_uint8(cell->payload+RELAY_HEADER_SIZE) : END_STREAM_REASON_MISC;
  1233. if (!conn) {
  1234. log_info(domain,"end cell (%s) dropped, unknown stream.",
  1235. stream_end_reason_to_string(reason));
  1236. return 0;
  1237. }
  1238. /* XXX add to this log_fn the exit node's nickname? */
  1239. log_info(domain,TOR_SOCKET_T_FORMAT": end cell (%s) for stream %d. "
  1240. "Removing stream.",
  1241. conn->base_.s,
  1242. stream_end_reason_to_string(reason),
  1243. conn->stream_id);
  1244. if (conn->base_.type == CONN_TYPE_AP) {
  1245. entry_connection_t *entry_conn = EDGE_TO_ENTRY_CONN(conn);
  1246. if (entry_conn->socks_request &&
  1247. !entry_conn->socks_request->has_finished)
  1248. log_warn(LD_BUG,
  1249. "open stream hasn't sent socks answer yet? Closing.");
  1250. }
  1251. /* We just *got* an end; no reason to send one. */
  1252. conn->edge_has_sent_end = 1;
  1253. if (!conn->end_reason)
  1254. conn->end_reason = reason | END_STREAM_REASON_FLAG_REMOTE;
  1255. if (!conn->base_.marked_for_close) {
  1256. /* only mark it if not already marked. it's possible to
  1257. * get the 'end' right around when the client hangs up on us. */
  1258. connection_mark_and_flush(TO_CONN(conn));
  1259. }
  1260. return 0;
  1261. case RELAY_COMMAND_EXTEND:
  1262. case RELAY_COMMAND_EXTEND2: {
  1263. static uint64_t total_n_extend=0, total_nonearly=0;
  1264. total_n_extend++;
  1265. if (rh.stream_id) {
  1266. log_fn(LOG_PROTOCOL_WARN, domain,
  1267. "'extend' cell received for non-zero stream. Dropping.");
  1268. return 0;
  1269. }
  1270. if (cell->command != CELL_RELAY_EARLY &&
  1271. !networkstatus_get_param(NULL,"AllowNonearlyExtend",0,0,1)) {
  1272. #define EARLY_WARNING_INTERVAL 3600
  1273. static ratelim_t early_warning_limit =
  1274. RATELIM_INIT(EARLY_WARNING_INTERVAL);
  1275. char *m;
  1276. if (cell->command == CELL_RELAY) {
  1277. ++total_nonearly;
  1278. if ((m = rate_limit_log(&early_warning_limit, approx_time()))) {
  1279. double percentage = ((double)total_nonearly)/total_n_extend;
  1280. percentage *= 100;
  1281. log_fn(LOG_PROTOCOL_WARN, domain, "EXTEND cell received, "
  1282. "but not via RELAY_EARLY. Dropping.%s", m);
  1283. log_fn(LOG_PROTOCOL_WARN, domain, " (We have dropped %.02f%% of "
  1284. "all EXTEND cells for this reason)", percentage);
  1285. tor_free(m);
  1286. }
  1287. } else {
  1288. log_fn(LOG_WARN, domain,
  1289. "EXTEND cell received, in a cell with type %d! Dropping.",
  1290. cell->command);
  1291. }
  1292. return 0;
  1293. }
  1294. return circuit_extend(cell, circ);
  1295. }
  1296. case RELAY_COMMAND_EXTENDED:
  1297. case RELAY_COMMAND_EXTENDED2:
  1298. if (!layer_hint) {
  1299. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  1300. "'extended' unsupported at non-origin. Dropping.");
  1301. return 0;
  1302. }
  1303. log_debug(domain,"Got an extended cell! Yay.");
  1304. {
  1305. extended_cell_t extended_cell;
  1306. if (extended_cell_parse(&extended_cell, rh.command,
  1307. (const uint8_t*)cell->payload+RELAY_HEADER_SIZE,
  1308. rh.length)<0) {
  1309. log_warn(LD_PROTOCOL,
  1310. "Can't parse EXTENDED cell; killing circuit.");
  1311. return -END_CIRC_REASON_TORPROTOCOL;
  1312. }
  1313. if ((reason = circuit_finish_handshake(TO_ORIGIN_CIRCUIT(circ),
  1314. &extended_cell.created_cell)) < 0) {
  1315. log_warn(domain,"circuit_finish_handshake failed.");
  1316. return reason;
  1317. }
  1318. }
  1319. if ((reason=circuit_send_next_onion_skin(TO_ORIGIN_CIRCUIT(circ)))<0) {
  1320. log_info(domain,"circuit_send_next_onion_skin() failed.");
  1321. return reason;
  1322. }
  1323. return 0;
  1324. case RELAY_COMMAND_TRUNCATE:
  1325. if (layer_hint) {
  1326. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  1327. "'truncate' unsupported at origin. Dropping.");
  1328. return 0;
  1329. }
  1330. if (circ->n_hop) {
  1331. if (circ->n_chan)
  1332. log_warn(LD_BUG, "n_chan and n_hop set on the same circuit!");
  1333. extend_info_free(circ->n_hop);
  1334. circ->n_hop = NULL;
  1335. tor_free(circ->n_chan_create_cell);
  1336. circuit_set_state(circ, CIRCUIT_STATE_OPEN);
  1337. }
  1338. if (circ->n_chan) {
  1339. uint8_t trunc_reason = get_uint8(cell->payload + RELAY_HEADER_SIZE);
  1340. circuit_clear_cell_queue(circ, circ->n_chan);
  1341. channel_send_destroy(circ->n_circ_id, circ->n_chan,
  1342. trunc_reason);
  1343. circuit_set_n_circid_chan(circ, 0, NULL);
  1344. }
  1345. log_debug(LD_EXIT, "Processed 'truncate', replying.");
  1346. {
  1347. char payload[1];
  1348. payload[0] = (char)END_CIRC_REASON_REQUESTED;
  1349. relay_send_command_from_edge(0, circ, RELAY_COMMAND_TRUNCATED,
  1350. payload, sizeof(payload), NULL);
  1351. }
  1352. return 0;
  1353. case RELAY_COMMAND_TRUNCATED:
  1354. if (!layer_hint) {
  1355. log_fn(LOG_PROTOCOL_WARN, LD_EXIT,
  1356. "'truncated' unsupported at non-origin. Dropping.");
  1357. return 0;
  1358. }
  1359. circuit_truncated(TO_ORIGIN_CIRCUIT(circ), layer_hint,
  1360. get_uint8(cell->payload + RELAY_HEADER_SIZE));
  1361. return 0;
  1362. case RELAY_COMMAND_CONNECTED:
  1363. if (conn) {
  1364. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  1365. "'connected' unsupported while open. Closing circ.");
  1366. return -END_CIRC_REASON_TORPROTOCOL;
  1367. }
  1368. log_info(domain,
  1369. "'connected' received, no conn attached anymore. Ignoring.");
  1370. return 0;
  1371. case RELAY_COMMAND_SENDME:
  1372. if (!rh.stream_id) {
  1373. if (layer_hint) {
  1374. if (layer_hint->package_window + CIRCWINDOW_INCREMENT >
  1375. CIRCWINDOW_START_MAX) {
  1376. /*XXXX024: Downgrade this back to LOG_PROTOCOL_WARN after a while*/
  1377. log_fn(LOG_WARN, LD_PROTOCOL,
  1378. "Bug/attack: unexpected sendme cell from exit relay. "
  1379. "Closing circ.");
  1380. return -END_CIRC_REASON_TORPROTOCOL;
  1381. }
  1382. layer_hint->package_window += CIRCWINDOW_INCREMENT;
  1383. log_debug(LD_APP,"circ-level sendme at origin, packagewindow %d.",
  1384. layer_hint->package_window);
  1385. circuit_resume_edge_reading(circ, layer_hint);
  1386. } else {
  1387. if (circ->package_window + CIRCWINDOW_INCREMENT >
  1388. CIRCWINDOW_START_MAX) {
  1389. /*XXXX024: Downgrade this back to LOG_PROTOCOL_WARN after a while*/
  1390. log_fn(LOG_WARN, LD_PROTOCOL,
  1391. "Bug/attack: unexpected sendme cell from client. "
  1392. "Closing circ (window %d).",
  1393. circ->package_window);
  1394. return -END_CIRC_REASON_TORPROTOCOL;
  1395. }
  1396. circ->package_window += CIRCWINDOW_INCREMENT;
  1397. log_debug(LD_APP,
  1398. "circ-level sendme at non-origin, packagewindow %d.",
  1399. circ->package_window);
  1400. circuit_resume_edge_reading(circ, layer_hint);
  1401. }
  1402. return 0;
  1403. }
  1404. if (!conn) {
  1405. log_info(domain,"sendme cell dropped, unknown stream (streamid %d).",
  1406. rh.stream_id);
  1407. return 0;
  1408. }
  1409. conn->package_window += STREAMWINDOW_INCREMENT;
  1410. log_debug(domain,"stream-level sendme, packagewindow now %d.",
  1411. conn->package_window);
  1412. if (circuit_queue_streams_are_blocked(circ)) {
  1413. /* Still waiting for queue to flush; don't touch conn */
  1414. return 0;
  1415. }
  1416. connection_start_reading(TO_CONN(conn));
  1417. /* handle whatever might still be on the inbuf */
  1418. if (connection_edge_package_raw_inbuf(conn, 1, NULL) < 0) {
  1419. /* (We already sent an end cell if possible) */
  1420. connection_mark_for_close(TO_CONN(conn));
  1421. return 0;
  1422. }
  1423. return 0;
  1424. case RELAY_COMMAND_RESOLVE:
  1425. if (layer_hint) {
  1426. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  1427. "resolve request unsupported at AP; dropping.");
  1428. return 0;
  1429. } else if (conn) {
  1430. log_fn(LOG_PROTOCOL_WARN, domain,
  1431. "resolve request for known stream; dropping.");
  1432. return 0;
  1433. } else if (circ->purpose != CIRCUIT_PURPOSE_OR) {
  1434. log_fn(LOG_PROTOCOL_WARN, domain,
  1435. "resolve request on circ with purpose %d; dropping",
  1436. circ->purpose);
  1437. return 0;
  1438. }
  1439. connection_exit_begin_resolve(cell, TO_OR_CIRCUIT(circ));
  1440. return 0;
  1441. case RELAY_COMMAND_RESOLVED:
  1442. if (conn) {
  1443. log_fn(LOG_PROTOCOL_WARN, domain,
  1444. "'resolved' unsupported while open. Closing circ.");
  1445. return -END_CIRC_REASON_TORPROTOCOL;
  1446. }
  1447. log_info(domain,
  1448. "'resolved' received, no conn attached anymore. Ignoring.");
  1449. return 0;
  1450. case RELAY_COMMAND_ESTABLISH_INTRO:
  1451. case RELAY_COMMAND_ESTABLISH_RENDEZVOUS:
  1452. case RELAY_COMMAND_INTRODUCE1:
  1453. case RELAY_COMMAND_INTRODUCE2:
  1454. case RELAY_COMMAND_INTRODUCE_ACK:
  1455. case RELAY_COMMAND_RENDEZVOUS1:
  1456. case RELAY_COMMAND_RENDEZVOUS2:
  1457. case RELAY_COMMAND_INTRO_ESTABLISHED:
  1458. case RELAY_COMMAND_RENDEZVOUS_ESTABLISHED:
  1459. rend_process_relay_cell(circ, layer_hint,
  1460. rh.command, rh.length,
  1461. cell->payload+RELAY_HEADER_SIZE);
  1462. return 0;
  1463. }
  1464. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  1465. "Received unknown relay command %d. Perhaps the other side is using "
  1466. "a newer version of Tor? Dropping.",
  1467. rh.command);
  1468. return 0; /* for forward compatibility, don't kill the circuit */
  1469. }
  1470. /** How many relay_data cells have we built, ever? */
  1471. uint64_t stats_n_data_cells_packaged = 0;
  1472. /** How many bytes of data have we put in relay_data cells have we built,
  1473. * ever? This would be RELAY_PAYLOAD_SIZE*stats_n_data_cells_packaged if
  1474. * every relay cell we ever sent were completely full of data. */
  1475. uint64_t stats_n_data_bytes_packaged = 0;
  1476. /** How many relay_data cells have we received, ever? */
  1477. uint64_t stats_n_data_cells_received = 0;
  1478. /** How many bytes of data have we received relay_data cells, ever? This would
  1479. * be RELAY_PAYLOAD_SIZE*stats_n_data_cells_packaged if every relay cell we
  1480. * ever received were completely full of data. */
  1481. uint64_t stats_n_data_bytes_received = 0;
  1482. /** If <b>conn</b> has an entire relay payload of bytes on its inbuf (or
  1483. * <b>package_partial</b> is true), and the appropriate package windows aren't
  1484. * empty, grab a cell and send it down the circuit.
  1485. *
  1486. * If *<b>max_cells</b> is given, package no more than max_cells. Decrement
  1487. * *<b>max_cells</b> by the number of cells packaged.
  1488. *
  1489. * Return -1 (and send a RELAY_COMMAND_END cell if necessary) if conn should
  1490. * be marked for close, else return 0.
  1491. */
  1492. int
  1493. connection_edge_package_raw_inbuf(edge_connection_t *conn, int package_partial,
  1494. int *max_cells)
  1495. {
  1496. size_t bytes_to_process, length;
  1497. char payload[CELL_PAYLOAD_SIZE];
  1498. circuit_t *circ;
  1499. const unsigned domain = conn->base_.type == CONN_TYPE_AP ? LD_APP : LD_EXIT;
  1500. int sending_from_optimistic = 0;
  1501. entry_connection_t *entry_conn =
  1502. conn->base_.type == CONN_TYPE_AP ? EDGE_TO_ENTRY_CONN(conn) : NULL;
  1503. const int sending_optimistically =
  1504. entry_conn &&
  1505. conn->base_.type == CONN_TYPE_AP &&
  1506. conn->base_.state != AP_CONN_STATE_OPEN;
  1507. crypt_path_t *cpath_layer = conn->cpath_layer;
  1508. tor_assert(conn);
  1509. if (conn->base_.marked_for_close) {
  1510. log_warn(LD_BUG,
  1511. "called on conn that's already marked for close at %s:%d.",
  1512. conn->base_.marked_for_close_file, conn->base_.marked_for_close);
  1513. return 0;
  1514. }
  1515. if (max_cells && *max_cells <= 0)
  1516. return 0;
  1517. repeat_connection_edge_package_raw_inbuf:
  1518. circ = circuit_get_by_edge_conn(conn);
  1519. if (!circ) {
  1520. log_info(domain,"conn has no circuit! Closing.");
  1521. conn->end_reason = END_STREAM_REASON_CANT_ATTACH;
  1522. return -1;
  1523. }
  1524. if (circuit_consider_stop_edge_reading(circ, cpath_layer))
  1525. return 0;
  1526. if (conn->package_window <= 0) {
  1527. log_info(domain,"called with package_window %d. Skipping.",
  1528. conn->package_window);
  1529. connection_stop_reading(TO_CONN(conn));
  1530. return 0;
  1531. }
  1532. sending_from_optimistic = entry_conn &&
  1533. entry_conn->sending_optimistic_data != NULL;
  1534. if (PREDICT_UNLIKELY(sending_from_optimistic)) {
  1535. bytes_to_process = generic_buffer_len(entry_conn->sending_optimistic_data);
  1536. if (PREDICT_UNLIKELY(!bytes_to_process)) {
  1537. log_warn(LD_BUG, "sending_optimistic_data was non-NULL but empty");
  1538. bytes_to_process = connection_get_inbuf_len(TO_CONN(conn));
  1539. sending_from_optimistic = 0;
  1540. }
  1541. } else {
  1542. bytes_to_process = connection_get_inbuf_len(TO_CONN(conn));
  1543. }
  1544. if (!bytes_to_process)
  1545. return 0;
  1546. if (!package_partial && bytes_to_process < RELAY_PAYLOAD_SIZE)
  1547. return 0;
  1548. if (bytes_to_process > RELAY_PAYLOAD_SIZE) {
  1549. length = RELAY_PAYLOAD_SIZE;
  1550. } else {
  1551. length = bytes_to_process;
  1552. }
  1553. stats_n_data_bytes_packaged += length;
  1554. stats_n_data_cells_packaged += 1;
  1555. if (PREDICT_UNLIKELY(sending_from_optimistic)) {
  1556. /* XXXX We could be more efficient here by sometimes packing
  1557. * previously-sent optimistic data in the same cell with data
  1558. * from the inbuf. */
  1559. generic_buffer_get(entry_conn->sending_optimistic_data, payload, length);
  1560. if (!generic_buffer_len(entry_conn->sending_optimistic_data)) {
  1561. generic_buffer_free(entry_conn->sending_optimistic_data);
  1562. entry_conn->sending_optimistic_data = NULL;
  1563. }
  1564. } else {
  1565. connection_fetch_from_buf(payload, length, TO_CONN(conn));
  1566. }
  1567. log_debug(domain,TOR_SOCKET_T_FORMAT": Packaging %d bytes (%d waiting).",
  1568. conn->base_.s,
  1569. (int)length, (int)connection_get_inbuf_len(TO_CONN(conn)));
  1570. if (sending_optimistically && !sending_from_optimistic) {
  1571. /* This is new optimistic data; remember it in case we need to detach and
  1572. retry */
  1573. if (!entry_conn->pending_optimistic_data)
  1574. entry_conn->pending_optimistic_data = generic_buffer_new();
  1575. generic_buffer_add(entry_conn->pending_optimistic_data, payload, length);
  1576. }
  1577. if (connection_edge_send_command(conn, RELAY_COMMAND_DATA,
  1578. payload, length) < 0 )
  1579. /* circuit got marked for close, don't continue, don't need to mark conn */
  1580. return 0;
  1581. if (!cpath_layer) { /* non-rendezvous exit */
  1582. tor_assert(circ->package_window > 0);
  1583. circ->package_window--;
  1584. } else { /* we're an AP, or an exit on a rendezvous circ */
  1585. tor_assert(cpath_layer->package_window > 0);
  1586. cpath_layer->package_window--;
  1587. }
  1588. if (--conn->package_window <= 0) { /* is it 0 after decrement? */
  1589. connection_stop_reading(TO_CONN(conn));
  1590. log_debug(domain,"conn->package_window reached 0.");
  1591. circuit_consider_stop_edge_reading(circ, cpath_layer);
  1592. return 0; /* don't process the inbuf any more */
  1593. }
  1594. log_debug(domain,"conn->package_window is now %d",conn->package_window);
  1595. if (max_cells) {
  1596. *max_cells -= 1;
  1597. if (*max_cells <= 0)
  1598. return 0;
  1599. }
  1600. /* handle more if there's more, or return 0 if there isn't */
  1601. goto repeat_connection_edge_package_raw_inbuf;
  1602. }
  1603. /** Called when we've just received a relay data cell, when
  1604. * we've just finished flushing all bytes to stream <b>conn</b>,
  1605. * or when we've flushed *some* bytes to the stream <b>conn</b>.
  1606. *
  1607. * If conn->outbuf is not too full, and our deliver window is
  1608. * low, send back a suitable number of stream-level sendme cells.
  1609. */
  1610. void
  1611. connection_edge_consider_sending_sendme(edge_connection_t *conn)
  1612. {
  1613. circuit_t *circ;
  1614. if (connection_outbuf_too_full(TO_CONN(conn)))
  1615. return;
  1616. circ = circuit_get_by_edge_conn(conn);
  1617. if (!circ) {
  1618. /* this can legitimately happen if the destroy has already
  1619. * arrived and torn down the circuit */
  1620. log_info(LD_APP,"No circuit associated with conn. Skipping.");
  1621. return;
  1622. }
  1623. while (conn->deliver_window <= STREAMWINDOW_START - STREAMWINDOW_INCREMENT) {
  1624. log_debug(conn->base_.type == CONN_TYPE_AP ?LD_APP:LD_EXIT,
  1625. "Outbuf %d, Queuing stream sendme.",
  1626. (int)conn->base_.outbuf_flushlen);
  1627. conn->deliver_window += STREAMWINDOW_INCREMENT;
  1628. if (connection_edge_send_command(conn, RELAY_COMMAND_SENDME,
  1629. NULL, 0) < 0) {
  1630. log_warn(LD_APP,"connection_edge_send_command failed. Skipping.");
  1631. return; /* the circuit's closed, don't continue */
  1632. }
  1633. }
  1634. }
  1635. /** The circuit <b>circ</b> has received a circuit-level sendme
  1636. * (on hop <b>layer_hint</b>, if we're the OP). Go through all the
  1637. * attached streams and let them resume reading and packaging, if
  1638. * their stream windows allow it.
  1639. */
  1640. static void
  1641. circuit_resume_edge_reading(circuit_t *circ, crypt_path_t *layer_hint)
  1642. {
  1643. if (circuit_queue_streams_are_blocked(circ)) {
  1644. log_debug(layer_hint?LD_APP:LD_EXIT,"Too big queue, no resuming");
  1645. return;
  1646. }
  1647. log_debug(layer_hint?LD_APP:LD_EXIT,"resuming");
  1648. if (CIRCUIT_IS_ORIGIN(circ))
  1649. circuit_resume_edge_reading_helper(TO_ORIGIN_CIRCUIT(circ)->p_streams,
  1650. circ, layer_hint);
  1651. else
  1652. circuit_resume_edge_reading_helper(TO_OR_CIRCUIT(circ)->n_streams,
  1653. circ, layer_hint);
  1654. }
  1655. void
  1656. stream_choice_seed_weak_rng(void)
  1657. {
  1658. crypto_seed_weak_rng(&stream_choice_rng);
  1659. }
  1660. /** A helper function for circuit_resume_edge_reading() above.
  1661. * The arguments are the same, except that <b>conn</b> is the head
  1662. * of a linked list of edge streams that should each be considered.
  1663. */
  1664. static int
  1665. circuit_resume_edge_reading_helper(edge_connection_t *first_conn,
  1666. circuit_t *circ,
  1667. crypt_path_t *layer_hint)
  1668. {
  1669. edge_connection_t *conn;
  1670. int n_packaging_streams, n_streams_left;
  1671. int packaged_this_round;
  1672. int cells_on_queue;
  1673. int cells_per_conn;
  1674. edge_connection_t *chosen_stream = NULL;
  1675. int max_to_package;
  1676. if (first_conn == NULL) {
  1677. /* Don't bother to try to do the rest of this if there are no connections
  1678. * to resume. */
  1679. return 0;
  1680. }
  1681. /* How many cells do we have space for? It will be the minimum of
  1682. * the number needed to exhaust the package window, and the minimum
  1683. * needed to fill the cell queue. */
  1684. max_to_package = circ->package_window;
  1685. if (CIRCUIT_IS_ORIGIN(circ)) {
  1686. cells_on_queue = circ->n_chan_cells.n;
  1687. } else {
  1688. or_circuit_t *or_circ = TO_OR_CIRCUIT(circ);
  1689. cells_on_queue = or_circ->p_chan_cells.n;
  1690. }
  1691. if (CELL_QUEUE_HIGHWATER_SIZE - cells_on_queue < max_to_package)
  1692. max_to_package = CELL_QUEUE_HIGHWATER_SIZE - cells_on_queue;
  1693. /* Once we used to start listening on the streams in the order they
  1694. * appeared in the linked list. That leads to starvation on the
  1695. * streams that appeared later on the list, since the first streams
  1696. * would always get to read first. Instead, we just pick a random
  1697. * stream on the list, and enable reading for streams starting at that
  1698. * point (and wrapping around as if the list were circular). It would
  1699. * probably be better to actually remember which streams we've
  1700. * serviced in the past, but this is simple and effective. */
  1701. /* Select a stream uniformly at random from the linked list. We
  1702. * don't need cryptographic randomness here. */
  1703. {
  1704. int num_streams = 0;
  1705. for (conn = first_conn; conn; conn = conn->next_stream) {
  1706. num_streams++;
  1707. if (tor_weak_random_one_in_n(&stream_choice_rng, num_streams)) {
  1708. chosen_stream = conn;
  1709. }
  1710. /* Invariant: chosen_stream has been chosen uniformly at random from
  1711. * among the first num_streams streams on first_conn.
  1712. *
  1713. * (Note that we iterate over every stream on the circuit, so that after
  1714. * we've considered the first stream, we've chosen it with P=1; and
  1715. * after we consider the second stream, we've switched to it with P=1/2
  1716. * and stayed with the first stream with P=1/2; and after we've
  1717. * considered the third stream, we've switched to it with P=1/3 and
  1718. * remained with one of the first two streams with P=(2/3), giving each
  1719. * one P=(1/2)(2/3) )=(1/3).) */
  1720. }
  1721. }
  1722. /* Count how many non-marked streams there are that have anything on
  1723. * their inbuf, and enable reading on all of the connections. */
  1724. n_packaging_streams = 0;
  1725. /* Activate reading starting from the chosen stream */
  1726. for (conn=chosen_stream; conn; conn = conn->next_stream) {
  1727. /* Start reading for the streams starting from here */
  1728. if (conn->base_.marked_for_close || conn->package_window <= 0)
  1729. continue;
  1730. if (!layer_hint || conn->cpath_layer == layer_hint) {
  1731. connection_start_reading(TO_CONN(conn));
  1732. if (connection_get_inbuf_len(TO_CONN(conn)) > 0)
  1733. ++n_packaging_streams;
  1734. }
  1735. }
  1736. /* Go back and do the ones we skipped, circular-style */
  1737. for (conn = first_conn; conn != chosen_stream; conn = conn->next_stream) {
  1738. if (conn->base_.marked_for_close || conn->package_window <= 0)
  1739. continue;
  1740. if (!layer_hint || conn->cpath_layer == layer_hint) {
  1741. connection_start_reading(TO_CONN(conn));
  1742. if (connection_get_inbuf_len(TO_CONN(conn)) > 0)
  1743. ++n_packaging_streams;
  1744. }
  1745. }
  1746. if (n_packaging_streams == 0) /* avoid divide-by-zero */
  1747. return 0;
  1748. again:
  1749. cells_per_conn = CEIL_DIV(max_to_package, n_packaging_streams);
  1750. packaged_this_round = 0;
  1751. n_streams_left = 0;
  1752. /* Iterate over all connections. Package up to cells_per_conn cells on
  1753. * each. Update packaged_this_round with the total number of cells
  1754. * packaged, and n_streams_left with the number that still have data to
  1755. * package.
  1756. */
  1757. for (conn=first_conn; conn; conn=conn->next_stream) {
  1758. if (conn->base_.marked_for_close || conn->package_window <= 0)
  1759. continue;
  1760. if (!layer_hint || conn->cpath_layer == layer_hint) {
  1761. int n = cells_per_conn, r;
  1762. /* handle whatever might still be on the inbuf */
  1763. r = connection_edge_package_raw_inbuf(conn, 1, &n);
  1764. /* Note how many we packaged */
  1765. packaged_this_round += (cells_per_conn-n);
  1766. if (r<0) {
  1767. /* Problem while packaging. (We already sent an end cell if
  1768. * possible) */
  1769. connection_mark_for_close(TO_CONN(conn));
  1770. continue;
  1771. }
  1772. /* If there's still data to read, we'll be coming back to this stream. */
  1773. if (connection_get_inbuf_len(TO_CONN(conn)))
  1774. ++n_streams_left;
  1775. /* If the circuit won't accept any more data, return without looking
  1776. * at any more of the streams. Any connections that should be stopped
  1777. * have already been stopped by connection_edge_package_raw_inbuf. */
  1778. if (circuit_consider_stop_edge_reading(circ, layer_hint))
  1779. return -1;
  1780. /* XXXX should we also stop immediately if we fill up the cell queue?
  1781. * Probably. */
  1782. }
  1783. }
  1784. /* If we made progress, and we are willing to package more, and there are
  1785. * any streams left that want to package stuff... try again!
  1786. */
  1787. if (packaged_this_round && packaged_this_round < max_to_package &&
  1788. n_streams_left) {
  1789. max_to_package -= packaged_this_round;
  1790. n_packaging_streams = n_streams_left;
  1791. goto again;
  1792. }
  1793. return 0;
  1794. }
  1795. /** Check if the package window for <b>circ</b> is empty (at
  1796. * hop <b>layer_hint</b> if it's defined).
  1797. *
  1798. * If yes, tell edge streams to stop reading and return 1.
  1799. * Else return 0.
  1800. */
  1801. static int
  1802. circuit_consider_stop_edge_reading(circuit_t *circ, crypt_path_t *layer_hint)
  1803. {
  1804. edge_connection_t *conn = NULL;
  1805. unsigned domain = layer_hint ? LD_APP : LD_EXIT;
  1806. if (!layer_hint) {
  1807. or_circuit_t *or_circ = TO_OR_CIRCUIT(circ);
  1808. log_debug(domain,"considering circ->package_window %d",
  1809. circ->package_window);
  1810. if (circ->package_window <= 0) {
  1811. log_debug(domain,"yes, not-at-origin. stopped.");
  1812. for (conn = or_circ->n_streams; conn; conn=conn->next_stream)
  1813. connection_stop_reading(TO_CONN(conn));
  1814. return 1;
  1815. }
  1816. return 0;
  1817. }
  1818. /* else, layer hint is defined, use it */
  1819. log_debug(domain,"considering layer_hint->package_window %d",
  1820. layer_hint->package_window);
  1821. if (layer_hint->package_window <= 0) {
  1822. log_debug(domain,"yes, at-origin. stopped.");
  1823. for (conn = TO_ORIGIN_CIRCUIT(circ)->p_streams; conn;
  1824. conn=conn->next_stream) {
  1825. if (conn->cpath_layer == layer_hint)
  1826. connection_stop_reading(TO_CONN(conn));
  1827. }
  1828. return 1;
  1829. }
  1830. return 0;
  1831. }
  1832. /** Check if the deliver_window for circuit <b>circ</b> (at hop
  1833. * <b>layer_hint</b> if it's defined) is low enough that we should
  1834. * send a circuit-level sendme back down the circuit. If so, send
  1835. * enough sendmes that the window would be overfull if we sent any
  1836. * more.
  1837. */
  1838. static void
  1839. circuit_consider_sending_sendme(circuit_t *circ, crypt_path_t *layer_hint)
  1840. {
  1841. // log_fn(LOG_INFO,"Considering: layer_hint is %s",
  1842. // layer_hint ? "defined" : "null");
  1843. while ((layer_hint ? layer_hint->deliver_window : circ->deliver_window) <=
  1844. CIRCWINDOW_START - CIRCWINDOW_INCREMENT) {
  1845. log_debug(LD_CIRC,"Queuing circuit sendme.");
  1846. if (layer_hint)
  1847. layer_hint->deliver_window += CIRCWINDOW_INCREMENT;
  1848. else
  1849. circ->deliver_window += CIRCWINDOW_INCREMENT;
  1850. if (relay_send_command_from_edge(0, circ, RELAY_COMMAND_SENDME,
  1851. NULL, 0, layer_hint) < 0) {
  1852. log_warn(LD_CIRC,
  1853. "relay_send_command_from_edge failed. Circuit's closed.");
  1854. return; /* the circuit's closed, don't continue */
  1855. }
  1856. }
  1857. }
  1858. #ifdef ACTIVE_CIRCUITS_PARANOIA
  1859. #define assert_cmux_ok_paranoid(chan) \
  1860. assert_circuit_mux_okay(chan)
  1861. #else
  1862. #define assert_cmux_ok_paranoid(chan)
  1863. #endif
  1864. /** The total number of cells we have allocated from the memory pool. */
  1865. static int total_cells_allocated = 0;
  1866. /** A memory pool to allocate packed_cell_t objects. */
  1867. static mp_pool_t *cell_pool = NULL;
  1868. /** Memory pool to allocate insertion_time_elem_t objects used for cell
  1869. * statistics. */
  1870. static mp_pool_t *it_pool = NULL;
  1871. /** Allocate structures to hold cells. */
  1872. void
  1873. init_cell_pool(void)
  1874. {
  1875. tor_assert(!cell_pool);
  1876. cell_pool = mp_pool_new(sizeof(packed_cell_t), 128*1024);
  1877. }
  1878. /** Free all storage used to hold cells (and insertion times if we measure
  1879. * cell statistics). */
  1880. void
  1881. free_cell_pool(void)
  1882. {
  1883. /* Maybe we haven't called init_cell_pool yet; need to check for it. */
  1884. if (cell_pool) {
  1885. mp_pool_destroy(cell_pool);
  1886. cell_pool = NULL;
  1887. }
  1888. if (it_pool) {
  1889. mp_pool_destroy(it_pool);
  1890. it_pool = NULL;
  1891. }
  1892. }
  1893. /** Free excess storage in cell pool. */
  1894. void
  1895. clean_cell_pool(void)
  1896. {
  1897. tor_assert(cell_pool);
  1898. mp_pool_clean(cell_pool, 0, 1);
  1899. }
  1900. /** Release storage held by <b>cell</b>. */
  1901. static INLINE void
  1902. packed_cell_free_unchecked(packed_cell_t *cell)
  1903. {
  1904. --total_cells_allocated;
  1905. mp_pool_release(cell);
  1906. }
  1907. /** Allocate and return a new packed_cell_t. */
  1908. static INLINE packed_cell_t *
  1909. packed_cell_new(void)
  1910. {
  1911. ++total_cells_allocated;
  1912. return mp_pool_get(cell_pool);
  1913. }
  1914. /** Return a packed cell used outside by channel_t lower layer */
  1915. void
  1916. packed_cell_free(packed_cell_t *cell)
  1917. {
  1918. packed_cell_free_unchecked(cell);
  1919. }
  1920. /** Log current statistics for cell pool allocation at log level
  1921. * <b>severity</b>. */
  1922. void
  1923. dump_cell_pool_usage(int severity)
  1924. {
  1925. circuit_t *c;
  1926. int n_circs = 0;
  1927. int n_cells = 0;
  1928. for (c = circuit_get_global_list_(); c; c = c->next) {
  1929. n_cells += c->n_chan_cells.n;
  1930. if (!CIRCUIT_IS_ORIGIN(c))
  1931. n_cells += TO_OR_CIRCUIT(c)->p_chan_cells.n;
  1932. ++n_circs;
  1933. }
  1934. tor_log(severity, LD_MM,
  1935. "%d cells allocated on %d circuits. %d cells leaked.",
  1936. n_cells, n_circs, total_cells_allocated - n_cells);
  1937. mp_pool_log_status(cell_pool, severity);
  1938. }
  1939. /** Allocate a new copy of packed <b>cell</b>. */
  1940. static INLINE packed_cell_t *
  1941. packed_cell_copy(const cell_t *cell, int wide_circ_ids)
  1942. {
  1943. packed_cell_t *c = packed_cell_new();
  1944. cell_pack(c, cell, wide_circ_ids);
  1945. c->next = NULL;
  1946. return c;
  1947. }
  1948. /** Append <b>cell</b> to the end of <b>queue</b>. */
  1949. void
  1950. cell_queue_append(cell_queue_t *queue, packed_cell_t *cell)
  1951. {
  1952. if (queue->tail) {
  1953. tor_assert(!queue->tail->next);
  1954. queue->tail->next = cell;
  1955. } else {
  1956. queue->head = cell;
  1957. }
  1958. queue->tail = cell;
  1959. cell->next = NULL;
  1960. ++queue->n;
  1961. }
  1962. /** Append a newly allocated copy of <b>cell</b> to the end of <b>queue</b> */
  1963. void
  1964. cell_queue_append_packed_copy(cell_queue_t *queue, const cell_t *cell,
  1965. int wide_circ_ids)
  1966. {
  1967. packed_cell_t *copy = packed_cell_copy(cell, wide_circ_ids);
  1968. /* Remember the time when this cell was put in the queue. */
  1969. if (get_options()->CellStatistics) {
  1970. struct timeval now;
  1971. uint32_t added;
  1972. insertion_time_queue_t *it_queue = queue->insertion_times;
  1973. if (!it_pool)
  1974. it_pool = mp_pool_new(sizeof(insertion_time_elem_t), 1024);
  1975. tor_gettimeofday_cached(&now);
  1976. #define SECONDS_IN_A_DAY 86400L
  1977. added = (uint32_t)(((now.tv_sec % SECONDS_IN_A_DAY) * 100L)
  1978. + ((uint32_t)now.tv_usec / (uint32_t)10000L));
  1979. if (!it_queue) {
  1980. it_queue = tor_malloc_zero(sizeof(insertion_time_queue_t));
  1981. queue->insertion_times = it_queue;
  1982. }
  1983. if (it_queue->last && it_queue->last->insertion_time == added) {
  1984. it_queue->last->counter++;
  1985. } else {
  1986. insertion_time_elem_t *elem = mp_pool_get(it_pool);
  1987. elem->next = NULL;
  1988. elem->insertion_time = added;
  1989. elem->counter = 1;
  1990. if (it_queue->last) {
  1991. it_queue->last->next = elem;
  1992. it_queue->last = elem;
  1993. } else {
  1994. it_queue->first = it_queue->last = elem;
  1995. }
  1996. }
  1997. }
  1998. cell_queue_append(queue, copy);
  1999. }
  2000. /** Remove and free every cell in <b>queue</b>. */
  2001. void
  2002. cell_queue_clear(cell_queue_t *queue)
  2003. {
  2004. packed_cell_t *cell, *next;
  2005. cell = queue->head;
  2006. while (cell) {
  2007. next = cell->next;
  2008. packed_cell_free_unchecked(cell);
  2009. cell = next;
  2010. }
  2011. queue->head = queue->tail = NULL;
  2012. queue->n = 0;
  2013. if (queue->insertion_times) {
  2014. while (queue->insertion_times->first) {
  2015. insertion_time_elem_t *elem = queue->insertion_times->first;
  2016. queue->insertion_times->first = elem->next;
  2017. mp_pool_release(elem);
  2018. }
  2019. tor_free(queue->insertion_times);
  2020. }
  2021. }
  2022. /** Extract and return the cell at the head of <b>queue</b>; return NULL if
  2023. * <b>queue</b> is empty. */
  2024. static INLINE packed_cell_t *
  2025. cell_queue_pop(cell_queue_t *queue)
  2026. {
  2027. packed_cell_t *cell = queue->head;
  2028. if (!cell)
  2029. return NULL;
  2030. queue->head = cell->next;
  2031. if (cell == queue->tail) {
  2032. tor_assert(!queue->head);
  2033. queue->tail = NULL;
  2034. }
  2035. --queue->n;
  2036. return cell;
  2037. }
  2038. /**
  2039. * Update the number of cells available on the circuit's n_chan or p_chan's
  2040. * circuit mux.
  2041. */
  2042. void
  2043. update_circuit_on_cmux_(circuit_t *circ, cell_direction_t direction,
  2044. const char *file, int lineno)
  2045. {
  2046. channel_t *chan = NULL;
  2047. or_circuit_t *or_circ = NULL;
  2048. circuitmux_t *cmux = NULL;
  2049. tor_assert(circ);
  2050. /* Okay, get the channel */
  2051. if (direction == CELL_DIRECTION_OUT) {
  2052. chan = circ->n_chan;
  2053. } else {
  2054. or_circ = TO_OR_CIRCUIT(circ);
  2055. chan = or_circ->p_chan;
  2056. }
  2057. tor_assert(chan);
  2058. tor_assert(chan->cmux);
  2059. /* Now get the cmux */
  2060. cmux = chan->cmux;
  2061. /* Cmux sanity check */
  2062. if (! circuitmux_is_circuit_attached(cmux, circ)) {
  2063. log_warn(LD_BUG, "called on non-attachd circuit from %s:%d",
  2064. file, lineno);
  2065. return;
  2066. }
  2067. tor_assert(circuitmux_attached_circuit_direction(cmux, circ) == direction);
  2068. assert_cmux_ok_paranoid(chan);
  2069. /* Update the number of cells we have for the circuit mux */
  2070. if (direction == CELL_DIRECTION_OUT) {
  2071. circuitmux_set_num_cells(cmux, circ, circ->n_chan_cells.n);
  2072. } else {
  2073. circuitmux_set_num_cells(cmux, circ, or_circ->p_chan_cells.n);
  2074. }
  2075. assert_cmux_ok_paranoid(chan);
  2076. }
  2077. /** Remove all circuits from the cmux on <b>chan</b>. */
  2078. void
  2079. channel_unlink_all_circuits(channel_t *chan)
  2080. {
  2081. tor_assert(chan);
  2082. tor_assert(chan->cmux);
  2083. circuitmux_detach_all_circuits(chan->cmux);
  2084. chan->num_n_circuits = 0;
  2085. chan->num_p_circuits = 0;
  2086. }
  2087. /** Block (if <b>block</b> is true) or unblock (if <b>block</b> is false)
  2088. * every edge connection that is using <b>circ</b> to write to <b>chan</b>,
  2089. * and start or stop reading as appropriate.
  2090. *
  2091. * If <b>stream_id</b> is nonzero, block only the edge connection whose
  2092. * stream_id matches it.
  2093. *
  2094. * Returns the number of streams whose status we changed.
  2095. */
  2096. static int
  2097. set_streams_blocked_on_circ(circuit_t *circ, channel_t *chan,
  2098. int block, streamid_t stream_id)
  2099. {
  2100. edge_connection_t *edge = NULL;
  2101. int n = 0;
  2102. if (circ->n_chan == chan) {
  2103. circ->streams_blocked_on_n_chan = block;
  2104. if (CIRCUIT_IS_ORIGIN(circ))
  2105. edge = TO_ORIGIN_CIRCUIT(circ)->p_streams;
  2106. } else {
  2107. circ->streams_blocked_on_p_chan = block;
  2108. tor_assert(!CIRCUIT_IS_ORIGIN(circ));
  2109. edge = TO_OR_CIRCUIT(circ)->n_streams;
  2110. }
  2111. for (; edge; edge = edge->next_stream) {
  2112. connection_t *conn = TO_CONN(edge);
  2113. if (stream_id && edge->stream_id != stream_id)
  2114. continue;
  2115. if (edge->edge_blocked_on_circ != block) {
  2116. ++n;
  2117. edge->edge_blocked_on_circ = block;
  2118. }
  2119. if (!conn->read_event && !HAS_BUFFEREVENT(conn)) {
  2120. /* This connection is a placeholder for something; probably a DNS
  2121. * request. It can't actually stop or start reading.*/
  2122. continue;
  2123. }
  2124. if (block) {
  2125. if (connection_is_reading(conn))
  2126. connection_stop_reading(conn);
  2127. } else {
  2128. /* Is this right? */
  2129. if (!connection_is_reading(conn))
  2130. connection_start_reading(conn);
  2131. }
  2132. }
  2133. return n;
  2134. }
  2135. /** Pull as many cells as possible (but no more than <b>max</b>) from the
  2136. * queue of the first active circuit on <b>chan</b>, and write them to
  2137. * <b>chan</b>-&gt;outbuf. Return the number of cells written. Advance
  2138. * the active circuit pointer to the next active circuit in the ring. */
  2139. int
  2140. channel_flush_from_first_active_circuit(channel_t *chan, int max)
  2141. {
  2142. circuitmux_t *cmux = NULL;
  2143. int n_flushed = 0;
  2144. cell_queue_t *queue;
  2145. circuit_t *circ;
  2146. or_circuit_t *or_circ;
  2147. int streams_blocked;
  2148. packed_cell_t *cell;
  2149. /* Get the cmux */
  2150. tor_assert(chan);
  2151. tor_assert(chan->cmux);
  2152. cmux = chan->cmux;
  2153. /* Main loop: pick a circuit, send a cell, update the cmux */
  2154. while (n_flushed < max) {
  2155. circ = circuitmux_get_first_active_circuit(cmux);
  2156. /* If it returns NULL, no cells left to send */
  2157. if (!circ) break;
  2158. assert_cmux_ok_paranoid(chan);
  2159. if (circ->n_chan == chan) {
  2160. queue = &circ->n_chan_cells;
  2161. streams_blocked = circ->streams_blocked_on_n_chan;
  2162. } else {
  2163. or_circ = TO_OR_CIRCUIT(circ);
  2164. tor_assert(or_circ->p_chan == chan);
  2165. queue = &TO_OR_CIRCUIT(circ)->p_chan_cells;
  2166. streams_blocked = circ->streams_blocked_on_p_chan;
  2167. }
  2168. /* Circuitmux told us this was active, so it should have cells */
  2169. tor_assert(queue->n > 0);
  2170. /*
  2171. * Get just one cell here; once we've sent it, that can change the circuit
  2172. * selection, so we have to loop around for another even if this circuit
  2173. * has more than one.
  2174. */
  2175. cell = cell_queue_pop(queue);
  2176. /* Calculate the exact time that this cell has spent in the queue. */
  2177. if (get_options()->CellStatistics && !CIRCUIT_IS_ORIGIN(circ)) {
  2178. struct timeval tvnow;
  2179. uint32_t flushed;
  2180. uint32_t cell_waiting_time;
  2181. insertion_time_queue_t *it_queue = queue->insertion_times;
  2182. tor_gettimeofday_cached(&tvnow);
  2183. flushed = (uint32_t)((tvnow.tv_sec % SECONDS_IN_A_DAY) * 100L +
  2184. (uint32_t)tvnow.tv_usec / (uint32_t)10000L);
  2185. if (!it_queue || !it_queue->first) {
  2186. log_info(LD_GENERAL, "Cannot determine insertion time of cell. "
  2187. "Looks like the CellStatistics option was "
  2188. "recently enabled.");
  2189. } else {
  2190. insertion_time_elem_t *elem = it_queue->first;
  2191. or_circ = TO_OR_CIRCUIT(circ);
  2192. cell_waiting_time =
  2193. (uint32_t)((flushed * 10L + SECONDS_IN_A_DAY * 1000L -
  2194. elem->insertion_time * 10L) %
  2195. (SECONDS_IN_A_DAY * 1000L));
  2196. #undef SECONDS_IN_A_DAY
  2197. elem->counter--;
  2198. if (elem->counter < 1) {
  2199. it_queue->first = elem->next;
  2200. if (elem == it_queue->last)
  2201. it_queue->last = NULL;
  2202. mp_pool_release(elem);
  2203. }
  2204. or_circ->total_cell_waiting_time += cell_waiting_time;
  2205. or_circ->processed_cells++;
  2206. }
  2207. }
  2208. /* If we just flushed our queue and this circuit is used for a
  2209. * tunneled directory request, possibly advance its state. */
  2210. if (queue->n == 0 && chan->dirreq_id)
  2211. geoip_change_dirreq_state(chan->dirreq_id,
  2212. DIRREQ_TUNNELED,
  2213. DIRREQ_CIRC_QUEUE_FLUSHED);
  2214. /* Now send the cell */
  2215. channel_write_packed_cell(chan, cell);
  2216. cell = NULL;
  2217. /*
  2218. * Don't packed_cell_free_unchecked(cell) here because the channel will
  2219. * do so when it gets out of the channel queue (probably already did, in
  2220. * which case that was an immediate double-free bug).
  2221. */
  2222. /* Update the counter */
  2223. ++n_flushed;
  2224. /*
  2225. * Now update the cmux; tell it we've just sent a cell, and how many
  2226. * we have left.
  2227. */
  2228. circuitmux_notify_xmit_cells(cmux, circ, 1);
  2229. circuitmux_set_num_cells(cmux, circ, queue->n);
  2230. if (queue->n == 0)
  2231. log_debug(LD_GENERAL, "Made a circuit inactive.");
  2232. /* Is the cell queue low enough to unblock all the streams that are waiting
  2233. * to write to this circuit? */
  2234. if (streams_blocked && queue->n <= CELL_QUEUE_LOWWATER_SIZE)
  2235. set_streams_blocked_on_circ(circ, chan, 0, 0); /* unblock streams */
  2236. /* If n_flushed < max still, loop around and pick another circuit */
  2237. }
  2238. /* Okay, we're done sending now */
  2239. assert_cmux_ok_paranoid(chan);
  2240. return n_flushed;
  2241. }
  2242. /** Add <b>cell</b> to the queue of <b>circ</b> writing to <b>chan</b>
  2243. * transmitting in <b>direction</b>. */
  2244. void
  2245. append_cell_to_circuit_queue(circuit_t *circ, channel_t *chan,
  2246. cell_t *cell, cell_direction_t direction,
  2247. streamid_t fromstream)
  2248. {
  2249. cell_queue_t *queue;
  2250. int streams_blocked;
  2251. if (circ->marked_for_close)
  2252. return;
  2253. if (direction == CELL_DIRECTION_OUT) {
  2254. queue = &circ->n_chan_cells;
  2255. streams_blocked = circ->streams_blocked_on_n_chan;
  2256. } else {
  2257. or_circuit_t *orcirc = TO_OR_CIRCUIT(circ);
  2258. queue = &orcirc->p_chan_cells;
  2259. streams_blocked = circ->streams_blocked_on_p_chan;
  2260. }
  2261. cell_queue_append_packed_copy(queue, cell, chan->wide_circ_ids);
  2262. /* If we have too many cells on the circuit, we should stop reading from
  2263. * the edge streams for a while. */
  2264. if (!streams_blocked && queue->n >= CELL_QUEUE_HIGHWATER_SIZE)
  2265. set_streams_blocked_on_circ(circ, chan, 1, 0); /* block streams */
  2266. if (streams_blocked && fromstream) {
  2267. /* This edge connection is apparently not blocked; block it. */
  2268. set_streams_blocked_on_circ(circ, chan, 1, fromstream);
  2269. }
  2270. update_circuit_on_cmux(circ, direction);
  2271. if (queue->n == 1) {
  2272. /* This was the first cell added to the queue. We just made this
  2273. * circuit active. */
  2274. log_debug(LD_GENERAL, "Made a circuit active.");
  2275. }
  2276. if (!channel_has_queued_writes(chan)) {
  2277. /* There is no data at all waiting to be sent on the outbuf. Add a
  2278. * cell, so that we can notice when it gets flushed, flushed_some can
  2279. * get called, and we can start putting more data onto the buffer then.
  2280. */
  2281. log_debug(LD_GENERAL, "Primed a buffer.");
  2282. channel_flush_from_first_active_circuit(chan, 1);
  2283. }
  2284. }
  2285. /** Append an encoded value of <b>addr</b> to <b>payload_out</b>, which must
  2286. * have at least 18 bytes of free space. The encoding is, as specified in
  2287. * tor-spec.txt:
  2288. * RESOLVED_TYPE_IPV4 or RESOLVED_TYPE_IPV6 [1 byte]
  2289. * LENGTH [1 byte]
  2290. * ADDRESS [length bytes]
  2291. * Return the number of bytes added, or -1 on error */
  2292. int
  2293. append_address_to_payload(uint8_t *payload_out, const tor_addr_t *addr)
  2294. {
  2295. uint32_t a;
  2296. switch (tor_addr_family(addr)) {
  2297. case AF_INET:
  2298. payload_out[0] = RESOLVED_TYPE_IPV4;
  2299. payload_out[1] = 4;
  2300. a = tor_addr_to_ipv4n(addr);
  2301. memcpy(payload_out+2, &a, 4);
  2302. return 6;
  2303. case AF_INET6:
  2304. payload_out[0] = RESOLVED_TYPE_IPV6;
  2305. payload_out[1] = 16;
  2306. memcpy(payload_out+2, tor_addr_to_in6_addr8(addr), 16);
  2307. return 18;
  2308. case AF_UNSPEC:
  2309. default:
  2310. return -1;
  2311. }
  2312. }
  2313. /** Given <b>payload_len</b> bytes at <b>payload</b>, starting with an address
  2314. * encoded as by append_address_to_payload(), try to decode the address into
  2315. * *<b>addr_out</b>. Return the next byte in the payload after the address on
  2316. * success, or NULL on failure. */
  2317. const uint8_t *
  2318. decode_address_from_payload(tor_addr_t *addr_out, const uint8_t *payload,
  2319. int payload_len)
  2320. {
  2321. if (payload_len < 2)
  2322. return NULL;
  2323. if (payload_len < 2+payload[1])
  2324. return NULL;
  2325. switch (payload[0]) {
  2326. case RESOLVED_TYPE_IPV4:
  2327. if (payload[1] != 4)
  2328. return NULL;
  2329. tor_addr_from_ipv4n(addr_out, get_uint32(payload+2));
  2330. break;
  2331. case RESOLVED_TYPE_IPV6:
  2332. if (payload[1] != 16)
  2333. return NULL;
  2334. tor_addr_from_ipv6_bytes(addr_out, (char*)(payload+2));
  2335. break;
  2336. default:
  2337. tor_addr_make_unspec(addr_out);
  2338. break;
  2339. }
  2340. return payload + 2 + payload[1];
  2341. }
  2342. /** Remove all the cells queued on <b>circ</b> for <b>chan</b>. */
  2343. void
  2344. circuit_clear_cell_queue(circuit_t *circ, channel_t *chan)
  2345. {
  2346. cell_queue_t *queue;
  2347. cell_direction_t direction;
  2348. if (circ->n_chan == chan) {
  2349. queue = &circ->n_chan_cells;
  2350. direction = CELL_DIRECTION_OUT;
  2351. } else {
  2352. or_circuit_t *orcirc = TO_OR_CIRCUIT(circ);
  2353. tor_assert(orcirc->p_chan == chan);
  2354. queue = &orcirc->p_chan_cells;
  2355. direction = CELL_DIRECTION_IN;
  2356. }
  2357. /* Clear the queue */
  2358. cell_queue_clear(queue);
  2359. /* Update the cell counter in the cmux */
  2360. if (chan->cmux && circuitmux_is_circuit_attached(chan->cmux, circ))
  2361. update_circuit_on_cmux(circ, direction);
  2362. }
  2363. /** Fail with an assert if the circuit mux on chan is corrupt
  2364. */
  2365. void
  2366. assert_circuit_mux_okay(channel_t *chan)
  2367. {
  2368. tor_assert(chan);
  2369. tor_assert(chan->cmux);
  2370. circuitmux_assert_okay(chan->cmux);
  2371. }
  2372. /** Return 1 if we shouldn't restart reading on this circuit, even if
  2373. * we get a SENDME. Else return 0.
  2374. */
  2375. static int
  2376. circuit_queue_streams_are_blocked(circuit_t *circ)
  2377. {
  2378. if (CIRCUIT_IS_ORIGIN(circ)) {
  2379. return circ->streams_blocked_on_n_chan;
  2380. } else {
  2381. return circ->streams_blocked_on_p_chan;
  2382. }
  2383. }