relay.c 113 KB

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