relay.c 83 KB

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