relay.c 104 KB

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