relay.c 98 KB

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