relay.c 108 KB

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