relay.c 110 KB

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