relay.c 106 KB

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