relay.c 90 KB

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