relay.c 89 KB

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