relay.c 109 KB

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