relay.c 109 KB

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