relay.c 98 KB

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