relay.c 107 KB

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