relay.c 114 KB

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