relay.c 110 KB

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