relay.c 110 KB

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