relay.c 105 KB

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