relay.c 109 KB

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