relay.c 107 KB

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