relay.c 114 KB

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