relay.c 106 KB

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