relay.c 106 KB

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