relay.c 109 KB

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