relay.c 114 KB

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