relay.c 114 KB

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