relay.c 117 KB

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