relay.c 87 KB

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