relay.c 86 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447
  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. tor_addr_t addr;
  644. int ttl = -1;
  645. tor_addr_make_unspec(&addr);
  646. if (rh->length == 5 || rh->length == 9) {
  647. tor_addr_from_ipv4n(&addr,
  648. get_uint32(cell->payload+RELAY_HEADER_SIZE+1));
  649. if (rh->length == 9)
  650. ttl = (int)ntohl(get_uint32(cell->payload+RELAY_HEADER_SIZE+5));
  651. } else if (rh->length == 17 || rh->length == 21) {
  652. tor_addr_from_ipv6_bytes(&addr,
  653. (char*)(cell->payload+RELAY_HEADER_SIZE+1));
  654. if (rh->length == 21)
  655. ttl = (int)ntohl(get_uint32(cell->payload+RELAY_HEADER_SIZE+17));
  656. }
  657. if (tor_addr_is_null(&addr)) {
  658. log_info(LD_APP,"Address '%s' resolved to 0.0.0.0. Closing,",
  659. safe_str(conn->socks_request->address));
  660. connection_mark_unattached_ap(conn, END_STREAM_REASON_TORPROTOCOL);
  661. return 0;
  662. }
  663. if ((tor_addr_family(&addr) == AF_INET && !conn->ipv4_traffic_ok) ||
  664. (tor_addr_family(&addr) == AF_INET6 && !conn->ipv6_traffic_ok)) {
  665. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  666. "Got an EXITPOLICY failure on a connection with a "
  667. "mismatched family. Closing.");
  668. connection_mark_unattached_ap(conn, END_STREAM_REASON_TORPROTOCOL);
  669. return 0;
  670. }
  671. if (get_options()->ClientDNSRejectInternalAddresses &&
  672. tor_addr_is_internal(&addr, 0)) {
  673. log_info(LD_APP,"Address '%s' resolved to internal. Closing,",
  674. safe_str(conn->socks_request->address));
  675. connection_mark_unattached_ap(conn, END_STREAM_REASON_TORPROTOCOL);
  676. return 0;
  677. }
  678. client_dns_set_addressmap(circ,
  679. conn->socks_request->address, &addr,
  680. conn->chosen_exit_name, ttl);
  681. }
  682. /* check if he *ought* to have allowed it */
  683. if (exitrouter &&
  684. (rh->length < 5 ||
  685. (tor_inet_aton(conn->socks_request->address, &in) &&
  686. !conn->chosen_exit_name))) {
  687. log_info(LD_APP,
  688. "Exitrouter %s seems to be more restrictive than its exit "
  689. "policy. Not using this router as exit for now.",
  690. node_describe(exitrouter));
  691. policies_set_node_exitpolicy_to_reject_all(exitrouter);
  692. }
  693. /* rewrite it to an IP if we learned one. */
  694. if (addressmap_rewrite(conn->socks_request->address,
  695. sizeof(conn->socks_request->address),
  696. NULL, NULL)) {
  697. control_event_stream_status(conn, STREAM_EVENT_REMAP, 0);
  698. }
  699. if (conn->chosen_exit_optional ||
  700. conn->chosen_exit_retries) {
  701. /* stop wanting a specific exit */
  702. conn->chosen_exit_optional = 0;
  703. /* A non-zero chosen_exit_retries can happen if we set a
  704. * TrackHostExits for this address under a port that the exit
  705. * relay allows, but then try the same address with a different
  706. * port that it doesn't allow to exit. We shouldn't unregister
  707. * the mapping, since it is probably still wanted on the
  708. * original port. But now we give away to the exit relay that
  709. * we probably have a TrackHostExits on it. So be it. */
  710. conn->chosen_exit_retries = 0;
  711. tor_free(conn->chosen_exit_name); /* clears it */
  712. }
  713. if (connection_ap_detach_retriable(conn, circ, control_reason) >= 0)
  714. return 0;
  715. /* else, conn will get closed below */
  716. break;
  717. case END_STREAM_REASON_CONNECTREFUSED:
  718. if (!conn->chosen_exit_optional)
  719. break; /* break means it'll close, below */
  720. /* Else fall through: expire this circuit, clear the
  721. * chosen_exit_name field, and try again. */
  722. case END_STREAM_REASON_RESOLVEFAILED:
  723. case END_STREAM_REASON_TIMEOUT:
  724. case END_STREAM_REASON_MISC:
  725. case END_STREAM_REASON_NOROUTE:
  726. if (client_dns_incr_failures(conn->socks_request->address)
  727. < MAX_RESOLVE_FAILURES) {
  728. /* We haven't retried too many times; reattach the connection. */
  729. circuit_log_path(LOG_INFO,LD_APP,circ);
  730. /* Mark this circuit "unusable for new streams". */
  731. /* XXXX024 this is a kludgy way to do this. */
  732. tor_assert(circ->base_.timestamp_dirty);
  733. circ->base_.timestamp_dirty -= get_options()->MaxCircuitDirtiness;
  734. if (conn->chosen_exit_optional) {
  735. /* stop wanting a specific exit */
  736. conn->chosen_exit_optional = 0;
  737. tor_free(conn->chosen_exit_name); /* clears it */
  738. }
  739. if (connection_ap_detach_retriable(conn, circ, control_reason) >= 0)
  740. return 0;
  741. /* else, conn will get closed below */
  742. } else {
  743. log_notice(LD_APP,
  744. "Have tried resolving or connecting to address '%s' "
  745. "at %d different places. Giving up.",
  746. safe_str(conn->socks_request->address),
  747. MAX_RESOLVE_FAILURES);
  748. /* clear the failures, so it will have a full try next time */
  749. client_dns_clear_failures(conn->socks_request->address);
  750. }
  751. break;
  752. case END_STREAM_REASON_HIBERNATING:
  753. case END_STREAM_REASON_RESOURCELIMIT:
  754. if (exitrouter) {
  755. policies_set_node_exitpolicy_to_reject_all(exitrouter);
  756. }
  757. if (conn->chosen_exit_optional) {
  758. /* stop wanting a specific exit */
  759. conn->chosen_exit_optional = 0;
  760. tor_free(conn->chosen_exit_name); /* clears it */
  761. }
  762. if (connection_ap_detach_retriable(conn, circ, control_reason) >= 0)
  763. return 0;
  764. /* else, will close below */
  765. break;
  766. } /* end switch */
  767. log_info(LD_APP,"Giving up on retrying; conn can't be handled.");
  768. }
  769. log_info(LD_APP,
  770. "Edge got end (%s) before we're connected. Marking for close.",
  771. stream_end_reason_to_string(rh->length > 0 ? reason : -1));
  772. circuit_log_path(LOG_INFO,LD_APP,circ);
  773. /* need to test because of detach_retriable */
  774. if (!ENTRY_TO_CONN(conn)->marked_for_close)
  775. connection_mark_unattached_ap(conn, control_reason);
  776. return 0;
  777. }
  778. /** Helper: change the socks_request-&gt;address field on conn to the
  779. * dotted-quad representation of <b>new_addr</b>,
  780. * and send an appropriate REMAP event. */
  781. static void
  782. remap_event_helper(entry_connection_t *conn, const tor_addr_t *new_addr)
  783. {
  784. tor_addr_to_str(conn->socks_request->address, new_addr,
  785. sizeof(conn->socks_request->address),
  786. 1);
  787. control_event_stream_status(conn, STREAM_EVENT_REMAP,
  788. REMAP_STREAM_SOURCE_EXIT);
  789. }
  790. /**DOCDOC*/
  791. int
  792. connected_cell_parse(const relay_header_t *rh, const cell_t *cell,
  793. tor_addr_t *addr_out, int *ttl_out)
  794. {
  795. uint32_t bytes;
  796. const uint8_t *payload = cell->payload + RELAY_HEADER_SIZE;
  797. tor_addr_make_unspec(addr_out);
  798. *ttl_out = -1;
  799. if (rh->length == 0)
  800. return 0;
  801. if (rh->length < 4)
  802. return -1;
  803. bytes = ntohl(get_uint32(payload));
  804. /* If bytes is 0, this is maybe a v6 address. Otherwise it's a v4 address */
  805. if (bytes != 0) {
  806. /* v4 address */
  807. tor_addr_from_ipv4h(addr_out, bytes);
  808. if (rh->length >= 8) {
  809. bytes = ntohl(get_uint32(payload + 4));
  810. if (bytes <= INT32_MAX)
  811. *ttl_out = bytes;
  812. }
  813. } else {
  814. if (rh->length < 25) /* 4 bytes of 0s, 1 addr, 16 ipv4, 4 ttl. */
  815. return -1;
  816. if (get_uint8(payload + 4) != 6)
  817. return -1;
  818. tor_addr_from_ipv6_bytes(addr_out, (char*)(payload + 5));
  819. bytes = ntohl(get_uint32(payload + 21));
  820. if (bytes <= INT32_MAX)
  821. *ttl_out = (int) bytes;
  822. }
  823. return 0;
  824. }
  825. /** An incoming relay cell has arrived from circuit <b>circ</b> to
  826. * stream <b>conn</b>.
  827. *
  828. * The arguments here are the same as in
  829. * connection_edge_process_relay_cell() below; this function is called
  830. * from there when <b>conn</b> is defined and not in an open state.
  831. */
  832. static int
  833. connection_edge_process_relay_cell_not_open(
  834. relay_header_t *rh, cell_t *cell, circuit_t *circ,
  835. edge_connection_t *conn, crypt_path_t *layer_hint)
  836. {
  837. if (rh->command == RELAY_COMMAND_END) {
  838. if (CIRCUIT_IS_ORIGIN(circ) && conn->base_.type == CONN_TYPE_AP) {
  839. return connection_ap_process_end_not_open(rh, cell,
  840. TO_ORIGIN_CIRCUIT(circ),
  841. EDGE_TO_ENTRY_CONN(conn),
  842. layer_hint);
  843. } else {
  844. /* we just got an 'end', don't need to send one */
  845. conn->edge_has_sent_end = 1;
  846. conn->end_reason = *(cell->payload+RELAY_HEADER_SIZE) |
  847. END_STREAM_REASON_FLAG_REMOTE;
  848. connection_mark_for_close(TO_CONN(conn));
  849. return 0;
  850. }
  851. }
  852. if (conn->base_.type == CONN_TYPE_AP &&
  853. rh->command == RELAY_COMMAND_CONNECTED) {
  854. tor_addr_t addr;
  855. int ttl;
  856. entry_connection_t *entry_conn = EDGE_TO_ENTRY_CONN(conn);
  857. tor_assert(CIRCUIT_IS_ORIGIN(circ));
  858. if (conn->base_.state != AP_CONN_STATE_CONNECT_WAIT) {
  859. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  860. "Got 'connected' while not in state connect_wait. Dropping.");
  861. return 0;
  862. }
  863. conn->base_.state = AP_CONN_STATE_OPEN;
  864. log_info(LD_APP,"'connected' received after %d seconds.",
  865. (int)(time(NULL) - conn->base_.timestamp_lastread));
  866. if (connected_cell_parse(rh, cell, &addr, &ttl) < 0) {
  867. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  868. "Got a badly formatted connected cell. Closing.");
  869. connection_edge_end(conn, END_STREAM_REASON_TORPROTOCOL);
  870. connection_mark_unattached_ap(entry_conn, END_STREAM_REASON_TORPROTOCOL);
  871. }
  872. if (tor_addr_family(&addr) != AF_UNSPEC) {
  873. const sa_family_t family = tor_addr_family(&addr);
  874. if (tor_addr_is_null(&addr) ||
  875. (get_options()->ClientDNSRejectInternalAddresses &&
  876. tor_addr_is_internal(&addr, 0))) {
  877. log_info(LD_APP, "...but it claims the IP address was %s. Closing.",
  878. fmt_addr(&addr));
  879. connection_edge_end(conn, END_STREAM_REASON_TORPROTOCOL);
  880. connection_mark_unattached_ap(entry_conn,
  881. END_STREAM_REASON_TORPROTOCOL);
  882. return 0;
  883. }
  884. if ((family == AF_INET && ! entry_conn->ipv4_traffic_ok) ||
  885. (family == AF_INET6 && ! entry_conn->ipv6_traffic_ok)) {
  886. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  887. "Got a connected cell to %s with unsupported address family."
  888. " Closing.", fmt_addr(&addr));
  889. connection_edge_end(conn, END_STREAM_REASON_TORPROTOCOL);
  890. connection_mark_unattached_ap(entry_conn,
  891. END_STREAM_REASON_TORPROTOCOL);
  892. return 0;
  893. }
  894. client_dns_set_addressmap(TO_ORIGIN_CIRCUIT(circ),
  895. entry_conn->socks_request->address, &addr,
  896. entry_conn->chosen_exit_name, ttl);
  897. remap_event_helper(entry_conn, &addr);
  898. }
  899. circuit_log_path(LOG_INFO,LD_APP,TO_ORIGIN_CIRCUIT(circ));
  900. /* don't send a socks reply to transparent conns */
  901. tor_assert(entry_conn->socks_request != NULL);
  902. if (!entry_conn->socks_request->has_finished)
  903. connection_ap_handshake_socks_reply(entry_conn, NULL, 0, 0);
  904. /* Was it a linked dir conn? If so, a dir request just started to
  905. * fetch something; this could be a bootstrap status milestone. */
  906. log_debug(LD_APP, "considering");
  907. if (TO_CONN(conn)->linked_conn &&
  908. TO_CONN(conn)->linked_conn->type == CONN_TYPE_DIR) {
  909. connection_t *dirconn = TO_CONN(conn)->linked_conn;
  910. log_debug(LD_APP, "it is! %d", dirconn->purpose);
  911. switch (dirconn->purpose) {
  912. case DIR_PURPOSE_FETCH_CERTIFICATE:
  913. if (consensus_is_waiting_for_certs())
  914. control_event_bootstrap(BOOTSTRAP_STATUS_LOADING_KEYS, 0);
  915. break;
  916. case DIR_PURPOSE_FETCH_CONSENSUS:
  917. control_event_bootstrap(BOOTSTRAP_STATUS_LOADING_STATUS, 0);
  918. break;
  919. case DIR_PURPOSE_FETCH_SERVERDESC:
  920. control_event_bootstrap(BOOTSTRAP_STATUS_LOADING_DESCRIPTORS,
  921. count_loading_descriptors_progress());
  922. break;
  923. }
  924. }
  925. /* This is definitely a success, so forget about any pending data we
  926. * had sent. */
  927. if (entry_conn->pending_optimistic_data) {
  928. generic_buffer_free(entry_conn->pending_optimistic_data);
  929. entry_conn->pending_optimistic_data = NULL;
  930. }
  931. /* handle anything that might have queued */
  932. if (connection_edge_package_raw_inbuf(conn, 1, NULL) < 0) {
  933. /* (We already sent an end cell if possible) */
  934. connection_mark_for_close(TO_CONN(conn));
  935. return 0;
  936. }
  937. return 0;
  938. }
  939. if (conn->base_.type == CONN_TYPE_AP &&
  940. rh->command == RELAY_COMMAND_RESOLVED) {
  941. int ttl;
  942. int answer_len;
  943. uint8_t answer_type;
  944. entry_connection_t *entry_conn = EDGE_TO_ENTRY_CONN(conn);
  945. if (conn->base_.state != AP_CONN_STATE_RESOLVE_WAIT) {
  946. log_fn(LOG_PROTOCOL_WARN, LD_APP, "Got a 'resolved' cell while "
  947. "not in state resolve_wait. Dropping.");
  948. return 0;
  949. }
  950. tor_assert(SOCKS_COMMAND_IS_RESOLVE(entry_conn->socks_request->command));
  951. answer_len = cell->payload[RELAY_HEADER_SIZE+1];
  952. if (rh->length < 2 || answer_len+2>rh->length) {
  953. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  954. "Dropping malformed 'resolved' cell");
  955. connection_mark_unattached_ap(entry_conn, END_STREAM_REASON_TORPROTOCOL);
  956. return 0;
  957. }
  958. answer_type = cell->payload[RELAY_HEADER_SIZE];
  959. if (rh->length >= answer_len+6)
  960. ttl = (int)ntohl(get_uint32(cell->payload+RELAY_HEADER_SIZE+
  961. 2+answer_len));
  962. else
  963. ttl = -1;
  964. if (answer_type == RESOLVED_TYPE_IPV4 && answer_len == 4) {
  965. uint32_t addr = ntohl(get_uint32(cell->payload+RELAY_HEADER_SIZE+2));
  966. if (get_options()->ClientDNSRejectInternalAddresses &&
  967. is_internal_IP(addr, 0)) {
  968. log_info(LD_APP,"Got a resolve with answer %s. Rejecting.",
  969. fmt_addr32(addr));
  970. connection_ap_handshake_socks_resolved(entry_conn,
  971. RESOLVED_TYPE_ERROR_TRANSIENT,
  972. 0, NULL, 0, TIME_MAX);
  973. connection_mark_unattached_ap(entry_conn,
  974. END_STREAM_REASON_TORPROTOCOL);
  975. return 0;
  976. }
  977. }
  978. connection_ap_handshake_socks_resolved(entry_conn,
  979. answer_type,
  980. cell->payload[RELAY_HEADER_SIZE+1], /*answer_len*/
  981. cell->payload+RELAY_HEADER_SIZE+2, /*answer*/
  982. ttl,
  983. -1);
  984. if (answer_type == RESOLVED_TYPE_IPV4 && answer_len == 4) {
  985. tor_addr_t addr;
  986. tor_addr_from_ipv4n(&addr, get_uint32(cell->payload+RELAY_HEADER_SIZE+2));
  987. remap_event_helper(entry_conn, &addr);
  988. } else if (answer_type == RESOLVED_TYPE_IPV6 && answer_len == 16) {
  989. tor_addr_t addr;
  990. tor_addr_from_ipv6_bytes(&addr,
  991. (char*)(cell->payload+RELAY_HEADER_SIZE+2));
  992. remap_event_helper(entry_conn, &addr);
  993. }
  994. connection_mark_unattached_ap(entry_conn,
  995. END_STREAM_REASON_DONE |
  996. END_STREAM_REASON_FLAG_ALREADY_SOCKS_REPLIED);
  997. return 0;
  998. }
  999. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  1000. "Got an unexpected relay command %d, in state %d (%s). Dropping.",
  1001. rh->command, conn->base_.state,
  1002. conn_state_to_string(conn->base_.type, conn->base_.state));
  1003. return 0; /* for forward compatibility, don't kill the circuit */
  1004. // connection_edge_end(conn, END_STREAM_REASON_TORPROTOCOL);
  1005. // connection_mark_for_close(conn);
  1006. // return -1;
  1007. }
  1008. /** An incoming relay cell has arrived on circuit <b>circ</b>. If
  1009. * <b>conn</b> is NULL this is a control cell, else <b>cell</b> is
  1010. * destined for <b>conn</b>.
  1011. *
  1012. * If <b>layer_hint</b> is defined, then we're the origin of the
  1013. * circuit, and it specifies the hop that packaged <b>cell</b>.
  1014. *
  1015. * Return -reason if you want to warn and tear down the circuit, else 0.
  1016. */
  1017. static int
  1018. connection_edge_process_relay_cell(cell_t *cell, circuit_t *circ,
  1019. edge_connection_t *conn,
  1020. crypt_path_t *layer_hint)
  1021. {
  1022. static int num_seen=0;
  1023. relay_header_t rh;
  1024. unsigned domain = layer_hint?LD_APP:LD_EXIT;
  1025. int reason;
  1026. int optimistic_data = 0; /* Set to 1 if we receive data on a stream
  1027. * that's in the EXIT_CONN_STATE_RESOLVING
  1028. * or EXIT_CONN_STATE_CONNECTING states. */
  1029. tor_assert(cell);
  1030. tor_assert(circ);
  1031. relay_header_unpack(&rh, cell->payload);
  1032. // log_fn(LOG_DEBUG,"command %d stream %d", rh.command, rh.stream_id);
  1033. num_seen++;
  1034. log_debug(domain, "Now seen %d relay cells here (command %d, stream %d).",
  1035. num_seen, rh.command, rh.stream_id);
  1036. if (rh.length > RELAY_PAYLOAD_SIZE) {
  1037. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  1038. "Relay cell length field too long. Closing circuit.");
  1039. return - END_CIRC_REASON_TORPROTOCOL;
  1040. }
  1041. /* either conn is NULL, in which case we've got a control cell, or else
  1042. * conn points to the recognized stream. */
  1043. if (conn && !connection_state_is_open(TO_CONN(conn))) {
  1044. if (conn->base_.type == CONN_TYPE_EXIT &&
  1045. (conn->base_.state == EXIT_CONN_STATE_CONNECTING ||
  1046. conn->base_.state == EXIT_CONN_STATE_RESOLVING) &&
  1047. rh.command == RELAY_COMMAND_DATA) {
  1048. /* Allow DATA cells to be delivered to an exit node in state
  1049. * EXIT_CONN_STATE_CONNECTING or EXIT_CONN_STATE_RESOLVING.
  1050. * This speeds up HTTP, for example. */
  1051. optimistic_data = 1;
  1052. } else {
  1053. return connection_edge_process_relay_cell_not_open(
  1054. &rh, cell, circ, conn, layer_hint);
  1055. }
  1056. }
  1057. switch (rh.command) {
  1058. case RELAY_COMMAND_DROP:
  1059. // log_info(domain,"Got a relay-level padding cell. Dropping.");
  1060. return 0;
  1061. case RELAY_COMMAND_BEGIN:
  1062. case RELAY_COMMAND_BEGIN_DIR:
  1063. if (layer_hint &&
  1064. circ->purpose != CIRCUIT_PURPOSE_S_REND_JOINED) {
  1065. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  1066. "Relay begin request unsupported at AP. Dropping.");
  1067. return 0;
  1068. }
  1069. if (circ->purpose == CIRCUIT_PURPOSE_S_REND_JOINED &&
  1070. layer_hint != TO_ORIGIN_CIRCUIT(circ)->cpath->prev) {
  1071. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  1072. "Relay begin request to Hidden Service "
  1073. "from intermediary node. Dropping.");
  1074. return 0;
  1075. }
  1076. if (conn) {
  1077. log_fn(LOG_PROTOCOL_WARN, domain,
  1078. "Begin cell for known stream. Dropping.");
  1079. return 0;
  1080. }
  1081. if (rh.command == RELAY_COMMAND_BEGIN_DIR) {
  1082. /* Assign this circuit and its app-ward OR connection a unique ID,
  1083. * so that we can measure download times. The local edge and dir
  1084. * connection will be assigned the same ID when they are created
  1085. * and linked. */
  1086. static uint64_t next_id = 0;
  1087. circ->dirreq_id = ++next_id;
  1088. TO_OR_CIRCUIT(circ)->p_chan->dirreq_id = circ->dirreq_id;
  1089. }
  1090. return connection_exit_begin_conn(cell, circ);
  1091. case RELAY_COMMAND_DATA:
  1092. ++stats_n_data_cells_received;
  1093. if (( layer_hint && --layer_hint->deliver_window < 0) ||
  1094. (!layer_hint && --circ->deliver_window < 0)) {
  1095. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  1096. "(relay data) circ deliver_window below 0. Killing.");
  1097. if (conn) {
  1098. /* XXXX Do we actually need to do this? Will killing the circuit
  1099. * not send an END and mark the stream for close as appropriate? */
  1100. connection_edge_end(conn, END_STREAM_REASON_TORPROTOCOL);
  1101. connection_mark_for_close(TO_CONN(conn));
  1102. }
  1103. return -END_CIRC_REASON_TORPROTOCOL;
  1104. }
  1105. log_debug(domain,"circ deliver_window now %d.", layer_hint ?
  1106. layer_hint->deliver_window : circ->deliver_window);
  1107. circuit_consider_sending_sendme(circ, layer_hint);
  1108. if (!conn) {
  1109. log_info(domain,"data cell dropped, unknown stream (streamid %d).",
  1110. rh.stream_id);
  1111. return 0;
  1112. }
  1113. if (--conn->deliver_window < 0) { /* is it below 0 after decrement? */
  1114. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  1115. "(relay data) conn deliver_window below 0. Killing.");
  1116. return -END_CIRC_REASON_TORPROTOCOL;
  1117. }
  1118. stats_n_data_bytes_received += rh.length;
  1119. connection_write_to_buf((char*)(cell->payload + RELAY_HEADER_SIZE),
  1120. rh.length, TO_CONN(conn));
  1121. if (!optimistic_data) {
  1122. /* Only send a SENDME if we're not getting optimistic data; otherwise
  1123. * a SENDME could arrive before the CONNECTED.
  1124. */
  1125. connection_edge_consider_sending_sendme(conn);
  1126. }
  1127. return 0;
  1128. case RELAY_COMMAND_END:
  1129. reason = rh.length > 0 ?
  1130. get_uint8(cell->payload+RELAY_HEADER_SIZE) : END_STREAM_REASON_MISC;
  1131. if (!conn) {
  1132. log_info(domain,"end cell (%s) dropped, unknown stream.",
  1133. stream_end_reason_to_string(reason));
  1134. return 0;
  1135. }
  1136. /* XXX add to this log_fn the exit node's nickname? */
  1137. log_info(domain,"%d: end cell (%s) for stream %d. Removing stream.",
  1138. conn->base_.s,
  1139. stream_end_reason_to_string(reason),
  1140. conn->stream_id);
  1141. if (conn->base_.type == CONN_TYPE_AP) {
  1142. entry_connection_t *entry_conn = EDGE_TO_ENTRY_CONN(conn);
  1143. if (entry_conn->socks_request &&
  1144. !entry_conn->socks_request->has_finished)
  1145. log_warn(LD_BUG,
  1146. "open stream hasn't sent socks answer yet? Closing.");
  1147. }
  1148. /* We just *got* an end; no reason to send one. */
  1149. conn->edge_has_sent_end = 1;
  1150. if (!conn->end_reason)
  1151. conn->end_reason = reason | END_STREAM_REASON_FLAG_REMOTE;
  1152. if (!conn->base_.marked_for_close) {
  1153. /* only mark it if not already marked. it's possible to
  1154. * get the 'end' right around when the client hangs up on us. */
  1155. connection_mark_and_flush(TO_CONN(conn));
  1156. }
  1157. return 0;
  1158. case RELAY_COMMAND_EXTEND: {
  1159. static uint64_t total_n_extend=0, total_nonearly=0;
  1160. total_n_extend++;
  1161. if (rh.stream_id) {
  1162. log_fn(LOG_PROTOCOL_WARN, domain,
  1163. "'extend' cell received for non-zero stream. Dropping.");
  1164. return 0;
  1165. }
  1166. if (cell->command != CELL_RELAY_EARLY &&
  1167. !networkstatus_get_param(NULL,"AllowNonearlyExtend",0,0,1)) {
  1168. #define EARLY_WARNING_INTERVAL 3600
  1169. static ratelim_t early_warning_limit =
  1170. RATELIM_INIT(EARLY_WARNING_INTERVAL);
  1171. char *m;
  1172. if (cell->command == CELL_RELAY) {
  1173. ++total_nonearly;
  1174. if ((m = rate_limit_log(&early_warning_limit, approx_time()))) {
  1175. double percentage = ((double)total_nonearly)/total_n_extend;
  1176. percentage *= 100;
  1177. log_fn(LOG_PROTOCOL_WARN, domain, "EXTEND cell received, "
  1178. "but not via RELAY_EARLY. Dropping.%s", m);
  1179. log_fn(LOG_PROTOCOL_WARN, domain, " (We have dropped %.02f%% of "
  1180. "all EXTEND cells for this reason)", percentage);
  1181. tor_free(m);
  1182. }
  1183. } else {
  1184. log_fn(LOG_WARN, domain,
  1185. "EXTEND cell received, in a cell with type %d! Dropping.",
  1186. cell->command);
  1187. }
  1188. return 0;
  1189. }
  1190. return circuit_extend(cell, circ);
  1191. }
  1192. case RELAY_COMMAND_EXTENDED:
  1193. if (!layer_hint) {
  1194. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  1195. "'extended' unsupported at non-origin. Dropping.");
  1196. return 0;
  1197. }
  1198. log_debug(domain,"Got an extended cell! Yay.");
  1199. if ((reason = circuit_finish_handshake(TO_ORIGIN_CIRCUIT(circ),
  1200. CELL_CREATED,
  1201. cell->payload+RELAY_HEADER_SIZE)) < 0) {
  1202. log_warn(domain,"circuit_finish_handshake failed.");
  1203. return reason;
  1204. }
  1205. if ((reason=circuit_send_next_onion_skin(TO_ORIGIN_CIRCUIT(circ)))<0) {
  1206. log_info(domain,"circuit_send_next_onion_skin() failed.");
  1207. return reason;
  1208. }
  1209. return 0;
  1210. case RELAY_COMMAND_TRUNCATE:
  1211. if (layer_hint) {
  1212. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  1213. "'truncate' unsupported at origin. Dropping.");
  1214. return 0;
  1215. }
  1216. if (circ->n_chan) {
  1217. uint8_t trunc_reason = get_uint8(cell->payload + RELAY_HEADER_SIZE);
  1218. circuit_clear_cell_queue(circ, circ->n_chan);
  1219. channel_send_destroy(circ->n_circ_id, circ->n_chan,
  1220. trunc_reason);
  1221. circuit_set_n_circid_chan(circ, 0, NULL);
  1222. }
  1223. log_debug(LD_EXIT, "Processed 'truncate', replying.");
  1224. {
  1225. char payload[1];
  1226. payload[0] = (char)END_CIRC_REASON_REQUESTED;
  1227. relay_send_command_from_edge(0, circ, RELAY_COMMAND_TRUNCATED,
  1228. payload, sizeof(payload), NULL);
  1229. }
  1230. return 0;
  1231. case RELAY_COMMAND_TRUNCATED:
  1232. if (!layer_hint) {
  1233. log_fn(LOG_PROTOCOL_WARN, LD_EXIT,
  1234. "'truncated' unsupported at non-origin. Dropping.");
  1235. return 0;
  1236. }
  1237. circuit_truncated(TO_ORIGIN_CIRCUIT(circ), layer_hint,
  1238. get_uint8(cell->payload + RELAY_HEADER_SIZE));
  1239. return 0;
  1240. case RELAY_COMMAND_CONNECTED:
  1241. if (conn) {
  1242. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  1243. "'connected' unsupported while open. Closing circ.");
  1244. return -END_CIRC_REASON_TORPROTOCOL;
  1245. }
  1246. log_info(domain,
  1247. "'connected' received, no conn attached anymore. Ignoring.");
  1248. return 0;
  1249. case RELAY_COMMAND_SENDME:
  1250. if (!rh.stream_id) {
  1251. if (layer_hint) {
  1252. if (layer_hint->package_window + CIRCWINDOW_INCREMENT >
  1253. CIRCWINDOW_START_MAX) {
  1254. /*XXXX024: Downgrade this back to LOG_PROTOCOL_WARN after a while*/
  1255. log_fn(LOG_WARN, LD_PROTOCOL,
  1256. "Bug/attack: unexpected sendme cell from exit relay. "
  1257. "Closing circ.");
  1258. return -END_CIRC_REASON_TORPROTOCOL;
  1259. }
  1260. layer_hint->package_window += CIRCWINDOW_INCREMENT;
  1261. log_debug(LD_APP,"circ-level sendme at origin, packagewindow %d.",
  1262. layer_hint->package_window);
  1263. circuit_resume_edge_reading(circ, layer_hint);
  1264. } else {
  1265. if (circ->package_window + CIRCWINDOW_INCREMENT >
  1266. CIRCWINDOW_START_MAX) {
  1267. /*XXXX024: Downgrade this back to LOG_PROTOCOL_WARN after a while*/
  1268. log_fn(LOG_WARN, LD_PROTOCOL,
  1269. "Bug/attack: unexpected sendme cell from client. "
  1270. "Closing circ.");
  1271. return -END_CIRC_REASON_TORPROTOCOL;
  1272. }
  1273. circ->package_window += CIRCWINDOW_INCREMENT;
  1274. log_debug(LD_APP,
  1275. "circ-level sendme at non-origin, packagewindow %d.",
  1276. circ->package_window);
  1277. circuit_resume_edge_reading(circ, layer_hint);
  1278. }
  1279. return 0;
  1280. }
  1281. if (!conn) {
  1282. log_info(domain,"sendme cell dropped, unknown stream (streamid %d).",
  1283. rh.stream_id);
  1284. return 0;
  1285. }
  1286. conn->package_window += STREAMWINDOW_INCREMENT;
  1287. log_debug(domain,"stream-level sendme, packagewindow now %d.",
  1288. conn->package_window);
  1289. if (circuit_queue_streams_are_blocked(circ)) {
  1290. /* Still waiting for queue to flush; don't touch conn */
  1291. return 0;
  1292. }
  1293. connection_start_reading(TO_CONN(conn));
  1294. /* handle whatever might still be on the inbuf */
  1295. if (connection_edge_package_raw_inbuf(conn, 1, NULL) < 0) {
  1296. /* (We already sent an end cell if possible) */
  1297. connection_mark_for_close(TO_CONN(conn));
  1298. return 0;
  1299. }
  1300. return 0;
  1301. case RELAY_COMMAND_RESOLVE:
  1302. if (layer_hint) {
  1303. log_fn(LOG_PROTOCOL_WARN, LD_APP,
  1304. "resolve request unsupported at AP; dropping.");
  1305. return 0;
  1306. } else if (conn) {
  1307. log_fn(LOG_PROTOCOL_WARN, domain,
  1308. "resolve request for known stream; dropping.");
  1309. return 0;
  1310. } else if (circ->purpose != CIRCUIT_PURPOSE_OR) {
  1311. log_fn(LOG_PROTOCOL_WARN, domain,
  1312. "resolve request on circ with purpose %d; dropping",
  1313. circ->purpose);
  1314. return 0;
  1315. }
  1316. connection_exit_begin_resolve(cell, TO_OR_CIRCUIT(circ));
  1317. return 0;
  1318. case RELAY_COMMAND_RESOLVED:
  1319. if (conn) {
  1320. log_fn(LOG_PROTOCOL_WARN, domain,
  1321. "'resolved' unsupported while open. Closing circ.");
  1322. return -END_CIRC_REASON_TORPROTOCOL;
  1323. }
  1324. log_info(domain,
  1325. "'resolved' received, no conn attached anymore. Ignoring.");
  1326. return 0;
  1327. case RELAY_COMMAND_ESTABLISH_INTRO:
  1328. case RELAY_COMMAND_ESTABLISH_RENDEZVOUS:
  1329. case RELAY_COMMAND_INTRODUCE1:
  1330. case RELAY_COMMAND_INTRODUCE2:
  1331. case RELAY_COMMAND_INTRODUCE_ACK:
  1332. case RELAY_COMMAND_RENDEZVOUS1:
  1333. case RELAY_COMMAND_RENDEZVOUS2:
  1334. case RELAY_COMMAND_INTRO_ESTABLISHED:
  1335. case RELAY_COMMAND_RENDEZVOUS_ESTABLISHED:
  1336. rend_process_relay_cell(circ, layer_hint,
  1337. rh.command, rh.length,
  1338. cell->payload+RELAY_HEADER_SIZE);
  1339. return 0;
  1340. }
  1341. log_fn(LOG_PROTOCOL_WARN, LD_PROTOCOL,
  1342. "Received unknown relay command %d. Perhaps the other side is using "
  1343. "a newer version of Tor? Dropping.",
  1344. rh.command);
  1345. return 0; /* for forward compatibility, don't kill the circuit */
  1346. }
  1347. /** How many relay_data cells have we built, ever? */
  1348. uint64_t stats_n_data_cells_packaged = 0;
  1349. /** How many bytes of data have we put in relay_data cells have we built,
  1350. * ever? This would be RELAY_PAYLOAD_SIZE*stats_n_data_cells_packaged if
  1351. * every relay cell we ever sent were completely full of data. */
  1352. uint64_t stats_n_data_bytes_packaged = 0;
  1353. /** How many relay_data cells have we received, ever? */
  1354. uint64_t stats_n_data_cells_received = 0;
  1355. /** How many bytes of data have we received relay_data cells, ever? This would
  1356. * be RELAY_PAYLOAD_SIZE*stats_n_data_cells_packaged if every relay cell we
  1357. * ever received were completely full of data. */
  1358. uint64_t stats_n_data_bytes_received = 0;
  1359. /** If <b>conn</b> has an entire relay payload of bytes on its inbuf (or
  1360. * <b>package_partial</b> is true), and the appropriate package windows aren't
  1361. * empty, grab a cell and send it down the circuit.
  1362. *
  1363. * If *<b>max_cells</b> is given, package no more than max_cells. Decrement
  1364. * *<b>max_cells</b> by the number of cells packaged.
  1365. *
  1366. * Return -1 (and send a RELAY_COMMAND_END cell if necessary) if conn should
  1367. * be marked for close, else return 0.
  1368. */
  1369. int
  1370. connection_edge_package_raw_inbuf(edge_connection_t *conn, int package_partial,
  1371. int *max_cells)
  1372. {
  1373. size_t bytes_to_process, length;
  1374. char payload[CELL_PAYLOAD_SIZE];
  1375. circuit_t *circ;
  1376. const unsigned domain = conn->base_.type == CONN_TYPE_AP ? LD_APP : LD_EXIT;
  1377. int sending_from_optimistic = 0;
  1378. const int sending_optimistically =
  1379. conn->base_.type == CONN_TYPE_AP &&
  1380. conn->base_.state != AP_CONN_STATE_OPEN;
  1381. entry_connection_t *entry_conn =
  1382. conn->base_.type == CONN_TYPE_AP ? EDGE_TO_ENTRY_CONN(conn) : NULL;
  1383. crypt_path_t *cpath_layer = conn->cpath_layer;
  1384. tor_assert(conn);
  1385. if (conn->base_.marked_for_close) {
  1386. log_warn(LD_BUG,
  1387. "called on conn that's already marked for close at %s:%d.",
  1388. conn->base_.marked_for_close_file, conn->base_.marked_for_close);
  1389. return 0;
  1390. }
  1391. if (max_cells && *max_cells <= 0)
  1392. return 0;
  1393. repeat_connection_edge_package_raw_inbuf:
  1394. circ = circuit_get_by_edge_conn(conn);
  1395. if (!circ) {
  1396. log_info(domain,"conn has no circuit! Closing.");
  1397. conn->end_reason = END_STREAM_REASON_CANT_ATTACH;
  1398. return -1;
  1399. }
  1400. if (circuit_consider_stop_edge_reading(circ, cpath_layer))
  1401. return 0;
  1402. if (conn->package_window <= 0) {
  1403. log_info(domain,"called with package_window %d. Skipping.",
  1404. conn->package_window);
  1405. connection_stop_reading(TO_CONN(conn));
  1406. return 0;
  1407. }
  1408. sending_from_optimistic = entry_conn &&
  1409. entry_conn->sending_optimistic_data != NULL;
  1410. if (PREDICT_UNLIKELY(sending_from_optimistic)) {
  1411. bytes_to_process = generic_buffer_len(entry_conn->sending_optimistic_data);
  1412. if (PREDICT_UNLIKELY(!bytes_to_process)) {
  1413. log_warn(LD_BUG, "sending_optimistic_data was non-NULL but empty");
  1414. bytes_to_process = connection_get_inbuf_len(TO_CONN(conn));
  1415. sending_from_optimistic = 0;
  1416. }
  1417. } else {
  1418. bytes_to_process = connection_get_inbuf_len(TO_CONN(conn));
  1419. }
  1420. if (!bytes_to_process)
  1421. return 0;
  1422. if (!package_partial && bytes_to_process < RELAY_PAYLOAD_SIZE)
  1423. return 0;
  1424. if (bytes_to_process > RELAY_PAYLOAD_SIZE) {
  1425. length = RELAY_PAYLOAD_SIZE;
  1426. } else {
  1427. length = bytes_to_process;
  1428. }
  1429. stats_n_data_bytes_packaged += length;
  1430. stats_n_data_cells_packaged += 1;
  1431. if (PREDICT_UNLIKELY(sending_from_optimistic)) {
  1432. /* XXXX We could be more efficient here by sometimes packing
  1433. * previously-sent optimistic data in the same cell with data
  1434. * from the inbuf. */
  1435. generic_buffer_get(entry_conn->sending_optimistic_data, payload, length);
  1436. if (!generic_buffer_len(entry_conn->sending_optimistic_data)) {
  1437. generic_buffer_free(entry_conn->sending_optimistic_data);
  1438. entry_conn->sending_optimistic_data = NULL;
  1439. }
  1440. } else {
  1441. connection_fetch_from_buf(payload, length, TO_CONN(conn));
  1442. }
  1443. log_debug(domain,"(%d) Packaging %d bytes (%d waiting).", conn->base_.s,
  1444. (int)length, (int)connection_get_inbuf_len(TO_CONN(conn)));
  1445. if (sending_optimistically && !sending_from_optimistic) {
  1446. /* This is new optimistic data; remember it in case we need to detach and
  1447. retry */
  1448. if (!entry_conn->pending_optimistic_data)
  1449. entry_conn->pending_optimistic_data = generic_buffer_new();
  1450. generic_buffer_add(entry_conn->pending_optimistic_data, payload, length);
  1451. }
  1452. if (connection_edge_send_command(conn, RELAY_COMMAND_DATA,
  1453. payload, length) < 0 )
  1454. /* circuit got marked for close, don't continue, don't need to mark conn */
  1455. return 0;
  1456. if (!cpath_layer) { /* non-rendezvous exit */
  1457. tor_assert(circ->package_window > 0);
  1458. circ->package_window--;
  1459. } else { /* we're an AP, or an exit on a rendezvous circ */
  1460. tor_assert(cpath_layer->package_window > 0);
  1461. cpath_layer->package_window--;
  1462. }
  1463. if (--conn->package_window <= 0) { /* is it 0 after decrement? */
  1464. connection_stop_reading(TO_CONN(conn));
  1465. log_debug(domain,"conn->package_window reached 0.");
  1466. circuit_consider_stop_edge_reading(circ, cpath_layer);
  1467. return 0; /* don't process the inbuf any more */
  1468. }
  1469. log_debug(domain,"conn->package_window is now %d",conn->package_window);
  1470. if (max_cells) {
  1471. *max_cells -= 1;
  1472. if (*max_cells <= 0)
  1473. return 0;
  1474. }
  1475. /* handle more if there's more, or return 0 if there isn't */
  1476. goto repeat_connection_edge_package_raw_inbuf;
  1477. }
  1478. /** Called when we've just received a relay data cell, when
  1479. * we've just finished flushing all bytes to stream <b>conn</b>,
  1480. * or when we've flushed *some* bytes to the stream <b>conn</b>.
  1481. *
  1482. * If conn->outbuf is not too full, and our deliver window is
  1483. * low, send back a suitable number of stream-level sendme cells.
  1484. */
  1485. void
  1486. connection_edge_consider_sending_sendme(edge_connection_t *conn)
  1487. {
  1488. circuit_t *circ;
  1489. if (connection_outbuf_too_full(TO_CONN(conn)))
  1490. return;
  1491. circ = circuit_get_by_edge_conn(conn);
  1492. if (!circ) {
  1493. /* this can legitimately happen if the destroy has already
  1494. * arrived and torn down the circuit */
  1495. log_info(LD_APP,"No circuit associated with conn. Skipping.");
  1496. return;
  1497. }
  1498. while (conn->deliver_window <= STREAMWINDOW_START - STREAMWINDOW_INCREMENT) {
  1499. log_debug(conn->base_.type == CONN_TYPE_AP ?LD_APP:LD_EXIT,
  1500. "Outbuf %d, Queuing stream sendme.",
  1501. (int)conn->base_.outbuf_flushlen);
  1502. conn->deliver_window += STREAMWINDOW_INCREMENT;
  1503. if (connection_edge_send_command(conn, RELAY_COMMAND_SENDME,
  1504. NULL, 0) < 0) {
  1505. log_warn(LD_APP,"connection_edge_send_command failed. Skipping.");
  1506. return; /* the circuit's closed, don't continue */
  1507. }
  1508. }
  1509. }
  1510. /** The circuit <b>circ</b> has received a circuit-level sendme
  1511. * (on hop <b>layer_hint</b>, if we're the OP). Go through all the
  1512. * attached streams and let them resume reading and packaging, if
  1513. * their stream windows allow it.
  1514. */
  1515. static void
  1516. circuit_resume_edge_reading(circuit_t *circ, crypt_path_t *layer_hint)
  1517. {
  1518. if (circuit_queue_streams_are_blocked(circ)) {
  1519. log_debug(layer_hint?LD_APP:LD_EXIT,"Too big queue, no resuming");
  1520. return;
  1521. }
  1522. log_debug(layer_hint?LD_APP:LD_EXIT,"resuming");
  1523. if (CIRCUIT_IS_ORIGIN(circ))
  1524. circuit_resume_edge_reading_helper(TO_ORIGIN_CIRCUIT(circ)->p_streams,
  1525. circ, layer_hint);
  1526. else
  1527. circuit_resume_edge_reading_helper(TO_OR_CIRCUIT(circ)->n_streams,
  1528. circ, layer_hint);
  1529. }
  1530. /** A helper function for circuit_resume_edge_reading() above.
  1531. * The arguments are the same, except that <b>conn</b> is the head
  1532. * of a linked list of edge streams that should each be considered.
  1533. */
  1534. static int
  1535. circuit_resume_edge_reading_helper(edge_connection_t *first_conn,
  1536. circuit_t *circ,
  1537. crypt_path_t *layer_hint)
  1538. {
  1539. edge_connection_t *conn;
  1540. int n_packaging_streams, n_streams_left;
  1541. int packaged_this_round;
  1542. int cells_on_queue;
  1543. int cells_per_conn;
  1544. edge_connection_t *chosen_stream = NULL;
  1545. /* How many cells do we have space for? It will be the minimum of
  1546. * the number needed to exhaust the package window, and the minimum
  1547. * needed to fill the cell queue. */
  1548. int max_to_package = circ->package_window;
  1549. if (CIRCUIT_IS_ORIGIN(circ)) {
  1550. cells_on_queue = circ->n_chan_cells.n;
  1551. } else {
  1552. or_circuit_t *or_circ = TO_OR_CIRCUIT(circ);
  1553. cells_on_queue = or_circ->p_chan_cells.n;
  1554. }
  1555. if (CELL_QUEUE_HIGHWATER_SIZE - cells_on_queue < max_to_package)
  1556. max_to_package = CELL_QUEUE_HIGHWATER_SIZE - cells_on_queue;
  1557. /* Once we used to start listening on the streams in the order they
  1558. * appeared in the linked list. That leads to starvation on the
  1559. * streams that appeared later on the list, since the first streams
  1560. * would always get to read first. Instead, we just pick a random
  1561. * stream on the list, and enable reading for streams starting at that
  1562. * point (and wrapping around as if the list were circular). It would
  1563. * probably be better to actually remember which streams we've
  1564. * serviced in the past, but this is simple and effective. */
  1565. /* Select a stream uniformly at random from the linked list. We
  1566. * don't need cryptographic randomness here. */
  1567. {
  1568. int num_streams = 0;
  1569. for (conn = first_conn; conn; conn = conn->next_stream) {
  1570. num_streams++;
  1571. if ((tor_weak_random() % num_streams)==0)
  1572. chosen_stream = conn;
  1573. /* Invariant: chosen_stream has been chosen uniformly at random from
  1574. * among the first num_streams streams on first_conn. */
  1575. }
  1576. }
  1577. /* Count how many non-marked streams there are that have anything on
  1578. * their inbuf, and enable reading on all of the connections. */
  1579. n_packaging_streams = 0;
  1580. /* Activate reading starting from the chosen stream */
  1581. for (conn=chosen_stream; conn; conn = conn->next_stream) {
  1582. /* Start reading for the streams starting from here */
  1583. if (conn->base_.marked_for_close || conn->package_window <= 0)
  1584. continue;
  1585. if (!layer_hint || conn->cpath_layer == layer_hint) {
  1586. connection_start_reading(TO_CONN(conn));
  1587. if (connection_get_inbuf_len(TO_CONN(conn)) > 0)
  1588. ++n_packaging_streams;
  1589. }
  1590. }
  1591. /* Go back and do the ones we skipped, circular-style */
  1592. for (conn = first_conn; conn != chosen_stream; conn = conn->next_stream) {
  1593. if (conn->base_.marked_for_close || conn->package_window <= 0)
  1594. continue;
  1595. if (!layer_hint || conn->cpath_layer == layer_hint) {
  1596. connection_start_reading(TO_CONN(conn));
  1597. if (connection_get_inbuf_len(TO_CONN(conn)) > 0)
  1598. ++n_packaging_streams;
  1599. }
  1600. }
  1601. if (n_packaging_streams == 0) /* avoid divide-by-zero */
  1602. return 0;
  1603. again:
  1604. cells_per_conn = CEIL_DIV(max_to_package, n_packaging_streams);
  1605. packaged_this_round = 0;
  1606. n_streams_left = 0;
  1607. /* Iterate over all connections. Package up to cells_per_conn cells on
  1608. * each. Update packaged_this_round with the total number of cells
  1609. * packaged, and n_streams_left with the number that still have data to
  1610. * package.
  1611. */
  1612. for (conn=first_conn; conn; conn=conn->next_stream) {
  1613. if (conn->base_.marked_for_close || conn->package_window <= 0)
  1614. continue;
  1615. if (!layer_hint || conn->cpath_layer == layer_hint) {
  1616. int n = cells_per_conn, r;
  1617. /* handle whatever might still be on the inbuf */
  1618. r = connection_edge_package_raw_inbuf(conn, 1, &n);
  1619. /* Note how many we packaged */
  1620. packaged_this_round += (cells_per_conn-n);
  1621. if (r<0) {
  1622. /* Problem while packaging. (We already sent an end cell if
  1623. * possible) */
  1624. connection_mark_for_close(TO_CONN(conn));
  1625. continue;
  1626. }
  1627. /* If there's still data to read, we'll be coming back to this stream. */
  1628. if (connection_get_inbuf_len(TO_CONN(conn)))
  1629. ++n_streams_left;
  1630. /* If the circuit won't accept any more data, return without looking
  1631. * at any more of the streams. Any connections that should be stopped
  1632. * have already been stopped by connection_edge_package_raw_inbuf. */
  1633. if (circuit_consider_stop_edge_reading(circ, layer_hint))
  1634. return -1;
  1635. /* XXXX should we also stop immediately if we fill up the cell queue?
  1636. * Probably. */
  1637. }
  1638. }
  1639. /* If we made progress, and we are willing to package more, and there are
  1640. * any streams left that want to package stuff... try again!
  1641. */
  1642. if (packaged_this_round && packaged_this_round < max_to_package &&
  1643. n_streams_left) {
  1644. max_to_package -= packaged_this_round;
  1645. n_packaging_streams = n_streams_left;
  1646. goto again;
  1647. }
  1648. return 0;
  1649. }
  1650. /** Check if the package window for <b>circ</b> is empty (at
  1651. * hop <b>layer_hint</b> if it's defined).
  1652. *
  1653. * If yes, tell edge streams to stop reading and return 1.
  1654. * Else return 0.
  1655. */
  1656. static int
  1657. circuit_consider_stop_edge_reading(circuit_t *circ, crypt_path_t *layer_hint)
  1658. {
  1659. edge_connection_t *conn = NULL;
  1660. unsigned domain = layer_hint ? LD_APP : LD_EXIT;
  1661. if (!layer_hint) {
  1662. or_circuit_t *or_circ = TO_OR_CIRCUIT(circ);
  1663. log_debug(domain,"considering circ->package_window %d",
  1664. circ->package_window);
  1665. if (circ->package_window <= 0) {
  1666. log_debug(domain,"yes, not-at-origin. stopped.");
  1667. for (conn = or_circ->n_streams; conn; conn=conn->next_stream)
  1668. connection_stop_reading(TO_CONN(conn));
  1669. return 1;
  1670. }
  1671. return 0;
  1672. }
  1673. /* else, layer hint is defined, use it */
  1674. log_debug(domain,"considering layer_hint->package_window %d",
  1675. layer_hint->package_window);
  1676. if (layer_hint->package_window <= 0) {
  1677. log_debug(domain,"yes, at-origin. stopped.");
  1678. for (conn = TO_ORIGIN_CIRCUIT(circ)->p_streams; conn;
  1679. conn=conn->next_stream) {
  1680. if (conn->cpath_layer == layer_hint)
  1681. connection_stop_reading(TO_CONN(conn));
  1682. }
  1683. return 1;
  1684. }
  1685. return 0;
  1686. }
  1687. /** Check if the deliver_window for circuit <b>circ</b> (at hop
  1688. * <b>layer_hint</b> if it's defined) is low enough that we should
  1689. * send a circuit-level sendme back down the circuit. If so, send
  1690. * enough sendmes that the window would be overfull if we sent any
  1691. * more.
  1692. */
  1693. static void
  1694. circuit_consider_sending_sendme(circuit_t *circ, crypt_path_t *layer_hint)
  1695. {
  1696. // log_fn(LOG_INFO,"Considering: layer_hint is %s",
  1697. // layer_hint ? "defined" : "null");
  1698. while ((layer_hint ? layer_hint->deliver_window : circ->deliver_window) <=
  1699. CIRCWINDOW_START - CIRCWINDOW_INCREMENT) {
  1700. log_debug(LD_CIRC,"Queuing circuit sendme.");
  1701. if (layer_hint)
  1702. layer_hint->deliver_window += CIRCWINDOW_INCREMENT;
  1703. else
  1704. circ->deliver_window += CIRCWINDOW_INCREMENT;
  1705. if (relay_send_command_from_edge(0, circ, RELAY_COMMAND_SENDME,
  1706. NULL, 0, layer_hint) < 0) {
  1707. log_warn(LD_CIRC,
  1708. "relay_send_command_from_edge failed. Circuit's closed.");
  1709. return; /* the circuit's closed, don't continue */
  1710. }
  1711. }
  1712. }
  1713. #ifdef ACTIVE_CIRCUITS_PARANOIA
  1714. #define assert_cmux_ok_paranoid(chan) \
  1715. assert_circuit_mux_okay(chan)
  1716. #else
  1717. #define assert_cmux_ok_paranoid(chan)
  1718. #endif
  1719. /** The total number of cells we have allocated from the memory pool. */
  1720. static int total_cells_allocated = 0;
  1721. /** A memory pool to allocate packed_cell_t objects. */
  1722. static mp_pool_t *cell_pool = NULL;
  1723. /** Memory pool to allocate insertion_time_elem_t objects used for cell
  1724. * statistics. */
  1725. static mp_pool_t *it_pool = NULL;
  1726. /** Allocate structures to hold cells. */
  1727. void
  1728. init_cell_pool(void)
  1729. {
  1730. tor_assert(!cell_pool);
  1731. cell_pool = mp_pool_new(sizeof(packed_cell_t), 128*1024);
  1732. }
  1733. /** Free all storage used to hold cells (and insertion times if we measure
  1734. * cell statistics). */
  1735. void
  1736. free_cell_pool(void)
  1737. {
  1738. /* Maybe we haven't called init_cell_pool yet; need to check for it. */
  1739. if (cell_pool) {
  1740. mp_pool_destroy(cell_pool);
  1741. cell_pool = NULL;
  1742. }
  1743. if (it_pool) {
  1744. mp_pool_destroy(it_pool);
  1745. it_pool = NULL;
  1746. }
  1747. }
  1748. /** Free excess storage in cell pool. */
  1749. void
  1750. clean_cell_pool(void)
  1751. {
  1752. tor_assert(cell_pool);
  1753. mp_pool_clean(cell_pool, 0, 1);
  1754. }
  1755. /** Release storage held by <b>cell</b>. */
  1756. static INLINE void
  1757. packed_cell_free_unchecked(packed_cell_t *cell)
  1758. {
  1759. --total_cells_allocated;
  1760. mp_pool_release(cell);
  1761. }
  1762. /** Allocate and return a new packed_cell_t. */
  1763. static INLINE packed_cell_t *
  1764. packed_cell_new(void)
  1765. {
  1766. ++total_cells_allocated;
  1767. return mp_pool_get(cell_pool);
  1768. }
  1769. /** Return a packed cell used outside by channel_t lower layer */
  1770. void
  1771. packed_cell_free(packed_cell_t *cell)
  1772. {
  1773. packed_cell_free_unchecked(cell);
  1774. }
  1775. /** Log current statistics for cell pool allocation at log level
  1776. * <b>severity</b>. */
  1777. void
  1778. dump_cell_pool_usage(int severity)
  1779. {
  1780. circuit_t *c;
  1781. int n_circs = 0;
  1782. int n_cells = 0;
  1783. for (c = circuit_get_global_list_(); c; c = c->next) {
  1784. n_cells += c->n_chan_cells.n;
  1785. if (!CIRCUIT_IS_ORIGIN(c))
  1786. n_cells += TO_OR_CIRCUIT(c)->p_chan_cells.n;
  1787. ++n_circs;
  1788. }
  1789. log(severity, LD_MM, "%d cells allocated on %d circuits. %d cells leaked.",
  1790. n_cells, n_circs, total_cells_allocated - n_cells);
  1791. mp_pool_log_status(cell_pool, severity);
  1792. }
  1793. /** Allocate a new copy of packed <b>cell</b>. */
  1794. static INLINE packed_cell_t *
  1795. packed_cell_copy(const cell_t *cell)
  1796. {
  1797. packed_cell_t *c = packed_cell_new();
  1798. cell_pack(c, cell);
  1799. c->next = NULL;
  1800. return c;
  1801. }
  1802. /** Append <b>cell</b> to the end of <b>queue</b>. */
  1803. void
  1804. cell_queue_append(cell_queue_t *queue, packed_cell_t *cell)
  1805. {
  1806. if (queue->tail) {
  1807. tor_assert(!queue->tail->next);
  1808. queue->tail->next = cell;
  1809. } else {
  1810. queue->head = cell;
  1811. }
  1812. queue->tail = cell;
  1813. cell->next = NULL;
  1814. ++queue->n;
  1815. }
  1816. /** Append a newly allocated copy of <b>cell</b> to the end of <b>queue</b> */
  1817. void
  1818. cell_queue_append_packed_copy(cell_queue_t *queue, const cell_t *cell)
  1819. {
  1820. packed_cell_t *copy = packed_cell_copy(cell);
  1821. /* Remember the time when this cell was put in the queue. */
  1822. if (get_options()->CellStatistics) {
  1823. struct timeval now;
  1824. uint32_t added;
  1825. insertion_time_queue_t *it_queue = queue->insertion_times;
  1826. if (!it_pool)
  1827. it_pool = mp_pool_new(sizeof(insertion_time_elem_t), 1024);
  1828. tor_gettimeofday_cached(&now);
  1829. #define SECONDS_IN_A_DAY 86400L
  1830. added = (uint32_t)(((now.tv_sec % SECONDS_IN_A_DAY) * 100L)
  1831. + ((uint32_t)now.tv_usec / (uint32_t)10000L));
  1832. if (!it_queue) {
  1833. it_queue = tor_malloc_zero(sizeof(insertion_time_queue_t));
  1834. queue->insertion_times = it_queue;
  1835. }
  1836. if (it_queue->last && it_queue->last->insertion_time == added) {
  1837. it_queue->last->counter++;
  1838. } else {
  1839. insertion_time_elem_t *elem = mp_pool_get(it_pool);
  1840. elem->next = NULL;
  1841. elem->insertion_time = added;
  1842. elem->counter = 1;
  1843. if (it_queue->last) {
  1844. it_queue->last->next = elem;
  1845. it_queue->last = elem;
  1846. } else {
  1847. it_queue->first = it_queue->last = elem;
  1848. }
  1849. }
  1850. }
  1851. cell_queue_append(queue, copy);
  1852. }
  1853. /** Remove and free every cell in <b>queue</b>. */
  1854. void
  1855. cell_queue_clear(cell_queue_t *queue)
  1856. {
  1857. packed_cell_t *cell, *next;
  1858. cell = queue->head;
  1859. while (cell) {
  1860. next = cell->next;
  1861. packed_cell_free_unchecked(cell);
  1862. cell = next;
  1863. }
  1864. queue->head = queue->tail = NULL;
  1865. queue->n = 0;
  1866. if (queue->insertion_times) {
  1867. while (queue->insertion_times->first) {
  1868. insertion_time_elem_t *elem = queue->insertion_times->first;
  1869. queue->insertion_times->first = elem->next;
  1870. mp_pool_release(elem);
  1871. }
  1872. tor_free(queue->insertion_times);
  1873. }
  1874. }
  1875. /** Extract and return the cell at the head of <b>queue</b>; return NULL if
  1876. * <b>queue</b> is empty. */
  1877. static INLINE packed_cell_t *
  1878. cell_queue_pop(cell_queue_t *queue)
  1879. {
  1880. packed_cell_t *cell = queue->head;
  1881. if (!cell)
  1882. return NULL;
  1883. queue->head = cell->next;
  1884. if (cell == queue->tail) {
  1885. tor_assert(!queue->head);
  1886. queue->tail = NULL;
  1887. }
  1888. --queue->n;
  1889. return cell;
  1890. }
  1891. /**
  1892. * Update the number of cells available on the circuit's n_chan or p_chan's
  1893. * circuit mux.
  1894. */
  1895. void
  1896. update_circuit_on_cmux_(circuit_t *circ, cell_direction_t direction,
  1897. const char *file, int lineno)
  1898. {
  1899. channel_t *chan = NULL;
  1900. or_circuit_t *or_circ = NULL;
  1901. circuitmux_t *cmux = NULL;
  1902. tor_assert(circ);
  1903. /* Okay, get the channel */
  1904. if (direction == CELL_DIRECTION_OUT) {
  1905. chan = circ->n_chan;
  1906. } else {
  1907. or_circ = TO_OR_CIRCUIT(circ);
  1908. chan = or_circ->p_chan;
  1909. }
  1910. tor_assert(chan);
  1911. tor_assert(chan->cmux);
  1912. /* Now get the cmux */
  1913. cmux = chan->cmux;
  1914. /* Cmux sanity check */
  1915. if (! circuitmux_is_circuit_attached(cmux, circ)) {
  1916. log_warn(LD_BUG, "called on non-attachd circuit from %s:%d",
  1917. file, lineno);
  1918. return;
  1919. }
  1920. tor_assert(circuitmux_attached_circuit_direction(cmux, circ) == direction);
  1921. assert_cmux_ok_paranoid(chan);
  1922. /* Update the number of cells we have for the circuit mux */
  1923. if (direction == CELL_DIRECTION_OUT) {
  1924. circuitmux_set_num_cells(cmux, circ, circ->n_chan_cells.n);
  1925. } else {
  1926. circuitmux_set_num_cells(cmux, circ, or_circ->p_chan_cells.n);
  1927. }
  1928. assert_cmux_ok_paranoid(chan);
  1929. }
  1930. /** Remove all circuits from the cmux on <b>chan</b>. */
  1931. void
  1932. channel_unlink_all_circuits(channel_t *chan)
  1933. {
  1934. tor_assert(chan);
  1935. tor_assert(chan->cmux);
  1936. circuitmux_detach_all_circuits(chan->cmux);
  1937. chan->num_n_circuits = 0;
  1938. chan->num_p_circuits = 0;
  1939. }
  1940. /** Block (if <b>block</b> is true) or unblock (if <b>block</b> is false)
  1941. * every edge connection that is using <b>circ</b> to write to <b>chan</b>,
  1942. * and start or stop reading as appropriate.
  1943. *
  1944. * If <b>stream_id</b> is nonzero, block only the edge connection whose
  1945. * stream_id matches it.
  1946. *
  1947. * Returns the number of streams whose status we changed.
  1948. */
  1949. static int
  1950. set_streams_blocked_on_circ(circuit_t *circ, channel_t *chan,
  1951. int block, streamid_t stream_id)
  1952. {
  1953. edge_connection_t *edge = NULL;
  1954. int n = 0;
  1955. if (circ->n_chan == chan) {
  1956. circ->streams_blocked_on_n_chan = block;
  1957. if (CIRCUIT_IS_ORIGIN(circ))
  1958. edge = TO_ORIGIN_CIRCUIT(circ)->p_streams;
  1959. } else {
  1960. circ->streams_blocked_on_p_chan = block;
  1961. tor_assert(!CIRCUIT_IS_ORIGIN(circ));
  1962. edge = TO_OR_CIRCUIT(circ)->n_streams;
  1963. }
  1964. for (; edge; edge = edge->next_stream) {
  1965. connection_t *conn = TO_CONN(edge);
  1966. if (stream_id && edge->stream_id != stream_id)
  1967. continue;
  1968. if (edge->edge_blocked_on_circ != block) {
  1969. ++n;
  1970. edge->edge_blocked_on_circ = block;
  1971. }
  1972. if (!conn->read_event && !HAS_BUFFEREVENT(conn)) {
  1973. /* This connection is a placeholder for something; probably a DNS
  1974. * request. It can't actually stop or start reading.*/
  1975. continue;
  1976. }
  1977. if (block) {
  1978. if (connection_is_reading(conn))
  1979. connection_stop_reading(conn);
  1980. } else {
  1981. /* Is this right? */
  1982. if (!connection_is_reading(conn))
  1983. connection_start_reading(conn);
  1984. }
  1985. }
  1986. return n;
  1987. }
  1988. /** Pull as many cells as possible (but no more than <b>max</b>) from the
  1989. * queue of the first active circuit on <b>chan</b>, and write them to
  1990. * <b>chan</b>-&gt;outbuf. Return the number of cells written. Advance
  1991. * the active circuit pointer to the next active circuit in the ring. */
  1992. int
  1993. channel_flush_from_first_active_circuit(channel_t *chan, int max)
  1994. {
  1995. circuitmux_t *cmux = NULL;
  1996. int n_flushed = 0;
  1997. cell_queue_t *queue;
  1998. circuit_t *circ;
  1999. or_circuit_t *or_circ;
  2000. int streams_blocked;
  2001. packed_cell_t *cell;
  2002. /* Get the cmux */
  2003. tor_assert(chan);
  2004. tor_assert(chan->cmux);
  2005. cmux = chan->cmux;
  2006. /* Main loop: pick a circuit, send a cell, update the cmux */
  2007. while (n_flushed < max) {
  2008. circ = circuitmux_get_first_active_circuit(cmux);
  2009. /* If it returns NULL, no cells left to send */
  2010. if (!circ) break;
  2011. assert_cmux_ok_paranoid(chan);
  2012. if (circ->n_chan == chan) {
  2013. queue = &circ->n_chan_cells;
  2014. streams_blocked = circ->streams_blocked_on_n_chan;
  2015. } else {
  2016. or_circ = TO_OR_CIRCUIT(circ);
  2017. tor_assert(or_circ->p_chan == chan);
  2018. queue = &TO_OR_CIRCUIT(circ)->p_chan_cells;
  2019. streams_blocked = circ->streams_blocked_on_p_chan;
  2020. }
  2021. /* Circuitmux told us this was active, so it should have cells */
  2022. tor_assert(queue->n > 0);
  2023. /*
  2024. * Get just one cell here; once we've sent it, that can change the circuit
  2025. * selection, so we have to loop around for another even if this circuit
  2026. * has more than one.
  2027. */
  2028. cell = cell_queue_pop(queue);
  2029. /* Calculate the exact time that this cell has spent in the queue. */
  2030. if (get_options()->CellStatistics && !CIRCUIT_IS_ORIGIN(circ)) {
  2031. struct timeval tvnow;
  2032. uint32_t flushed;
  2033. uint32_t cell_waiting_time;
  2034. insertion_time_queue_t *it_queue = queue->insertion_times;
  2035. tor_gettimeofday_cached(&tvnow);
  2036. flushed = (uint32_t)((tvnow.tv_sec % SECONDS_IN_A_DAY) * 100L +
  2037. (uint32_t)tvnow.tv_usec / (uint32_t)10000L);
  2038. if (!it_queue || !it_queue->first) {
  2039. log_info(LD_GENERAL, "Cannot determine insertion time of cell. "
  2040. "Looks like the CellStatistics option was "
  2041. "recently enabled.");
  2042. } else {
  2043. insertion_time_elem_t *elem = it_queue->first;
  2044. or_circ = TO_OR_CIRCUIT(circ);
  2045. cell_waiting_time =
  2046. (uint32_t)((flushed * 10L + SECONDS_IN_A_DAY * 1000L -
  2047. elem->insertion_time * 10L) %
  2048. (SECONDS_IN_A_DAY * 1000L));
  2049. #undef SECONDS_IN_A_DAY
  2050. elem->counter--;
  2051. if (elem->counter < 1) {
  2052. it_queue->first = elem->next;
  2053. if (elem == it_queue->last)
  2054. it_queue->last = NULL;
  2055. mp_pool_release(elem);
  2056. }
  2057. or_circ->total_cell_waiting_time += cell_waiting_time;
  2058. or_circ->processed_cells++;
  2059. }
  2060. }
  2061. /* If we just flushed our queue and this circuit is used for a
  2062. * tunneled directory request, possibly advance its state. */
  2063. if (queue->n == 0 && chan->dirreq_id)
  2064. geoip_change_dirreq_state(chan->dirreq_id,
  2065. DIRREQ_TUNNELED,
  2066. DIRREQ_CIRC_QUEUE_FLUSHED);
  2067. /* Now send the cell */
  2068. channel_write_packed_cell(chan, cell);
  2069. cell = NULL;
  2070. /*
  2071. * Don't packed_cell_free_unchecked(cell) here because the channel will
  2072. * do so when it gets out of the channel queue (probably already did, in
  2073. * which case that was an immediate double-free bug).
  2074. */
  2075. /* Update the counter */
  2076. ++n_flushed;
  2077. /*
  2078. * Now update the cmux; tell it we've just sent a cell, and how many
  2079. * we have left.
  2080. */
  2081. circuitmux_notify_xmit_cells(cmux, circ, 1);
  2082. circuitmux_set_num_cells(cmux, circ, queue->n);
  2083. if (queue->n == 0)
  2084. log_debug(LD_GENERAL, "Made a circuit inactive.");
  2085. /* Is the cell queue low enough to unblock all the streams that are waiting
  2086. * to write to this circuit? */
  2087. if (streams_blocked && queue->n <= CELL_QUEUE_LOWWATER_SIZE)
  2088. set_streams_blocked_on_circ(circ, chan, 0, 0); /* unblock streams */
  2089. /* If n_flushed < max still, loop around and pick another circuit */
  2090. }
  2091. /* Okay, we're done sending now */
  2092. assert_cmux_ok_paranoid(chan);
  2093. return n_flushed;
  2094. }
  2095. /** Add <b>cell</b> to the queue of <b>circ</b> writing to <b>chan</b>
  2096. * transmitting in <b>direction</b>. */
  2097. void
  2098. append_cell_to_circuit_queue(circuit_t *circ, channel_t *chan,
  2099. cell_t *cell, cell_direction_t direction,
  2100. streamid_t fromstream)
  2101. {
  2102. cell_queue_t *queue;
  2103. int streams_blocked;
  2104. if (circ->marked_for_close)
  2105. return;
  2106. if (direction == CELL_DIRECTION_OUT) {
  2107. queue = &circ->n_chan_cells;
  2108. streams_blocked = circ->streams_blocked_on_n_chan;
  2109. } else {
  2110. or_circuit_t *orcirc = TO_OR_CIRCUIT(circ);
  2111. queue = &orcirc->p_chan_cells;
  2112. streams_blocked = circ->streams_blocked_on_p_chan;
  2113. }
  2114. cell_queue_append_packed_copy(queue, cell);
  2115. /* If we have too many cells on the circuit, we should stop reading from
  2116. * the edge streams for a while. */
  2117. if (!streams_blocked && queue->n >= CELL_QUEUE_HIGHWATER_SIZE)
  2118. set_streams_blocked_on_circ(circ, chan, 1, 0); /* block streams */
  2119. if (streams_blocked && fromstream) {
  2120. /* This edge connection is apparently not blocked; block it. */
  2121. set_streams_blocked_on_circ(circ, chan, 1, fromstream);
  2122. }
  2123. update_circuit_on_cmux(circ, direction);
  2124. if (queue->n == 1) {
  2125. /* This was the first cell added to the queue. We just made this
  2126. * circuit active. */
  2127. log_debug(LD_GENERAL, "Made a circuit active.");
  2128. }
  2129. if (!channel_has_queued_writes(chan)) {
  2130. /* There is no data at all waiting to be sent on the outbuf. Add a
  2131. * cell, so that we can notice when it gets flushed, flushed_some can
  2132. * get called, and we can start putting more data onto the buffer then.
  2133. */
  2134. log_debug(LD_GENERAL, "Primed a buffer.");
  2135. channel_flush_from_first_active_circuit(chan, 1);
  2136. }
  2137. }
  2138. /** Append an encoded value of <b>addr</b> to <b>payload_out</b>, which must
  2139. * have at least 18 bytes of free space. The encoding is, as specified in
  2140. * tor-spec.txt:
  2141. * RESOLVED_TYPE_IPV4 or RESOLVED_TYPE_IPV6 [1 byte]
  2142. * LENGTH [1 byte]
  2143. * ADDRESS [length bytes]
  2144. * Return the number of bytes added, or -1 on error */
  2145. int
  2146. append_address_to_payload(uint8_t *payload_out, const tor_addr_t *addr)
  2147. {
  2148. uint32_t a;
  2149. switch (tor_addr_family(addr)) {
  2150. case AF_INET:
  2151. payload_out[0] = RESOLVED_TYPE_IPV4;
  2152. payload_out[1] = 4;
  2153. a = tor_addr_to_ipv4n(addr);
  2154. memcpy(payload_out+2, &a, 4);
  2155. return 6;
  2156. case AF_INET6:
  2157. payload_out[0] = RESOLVED_TYPE_IPV6;
  2158. payload_out[1] = 16;
  2159. memcpy(payload_out+2, tor_addr_to_in6_addr8(addr), 16);
  2160. return 18;
  2161. case AF_UNSPEC:
  2162. default:
  2163. return -1;
  2164. }
  2165. }
  2166. /** Given <b>payload_len</b> bytes at <b>payload</b>, starting with an address
  2167. * encoded as by append_address_to_payload(), try to decode the address into
  2168. * *<b>addr_out</b>. Return the next byte in the payload after the address on
  2169. * success, or NULL on failure. */
  2170. const uint8_t *
  2171. decode_address_from_payload(tor_addr_t *addr_out, const uint8_t *payload,
  2172. int payload_len)
  2173. {
  2174. if (payload_len < 2)
  2175. return NULL;
  2176. if (payload_len < 2+payload[1])
  2177. return NULL;
  2178. switch (payload[0]) {
  2179. case RESOLVED_TYPE_IPV4:
  2180. if (payload[1] != 4)
  2181. return NULL;
  2182. tor_addr_from_ipv4n(addr_out, get_uint32(payload+2));
  2183. break;
  2184. case RESOLVED_TYPE_IPV6:
  2185. if (payload[1] != 16)
  2186. return NULL;
  2187. tor_addr_from_ipv6_bytes(addr_out, (char*)(payload+2));
  2188. break;
  2189. default:
  2190. tor_addr_make_unspec(addr_out);
  2191. break;
  2192. }
  2193. return payload + 2 + payload[1];
  2194. }
  2195. /** Remove all the cells queued on <b>circ</b> for <b>chan</b>. */
  2196. void
  2197. circuit_clear_cell_queue(circuit_t *circ, channel_t *chan)
  2198. {
  2199. cell_queue_t *queue;
  2200. cell_direction_t direction;
  2201. if (circ->n_chan == chan) {
  2202. queue = &circ->n_chan_cells;
  2203. direction = CELL_DIRECTION_OUT;
  2204. } else {
  2205. or_circuit_t *orcirc = TO_OR_CIRCUIT(circ);
  2206. tor_assert(orcirc->p_chan == chan);
  2207. queue = &orcirc->p_chan_cells;
  2208. direction = CELL_DIRECTION_IN;
  2209. }
  2210. /* Clear the queue */
  2211. cell_queue_clear(queue);
  2212. /* Update the cell counter in the cmux */
  2213. if (chan->cmux && circuitmux_is_circuit_attached(chan->cmux, circ))
  2214. update_circuit_on_cmux(circ, direction);
  2215. }
  2216. /** Fail with an assert if the circuit mux on chan is corrupt
  2217. */
  2218. void
  2219. assert_circuit_mux_okay(channel_t *chan)
  2220. {
  2221. tor_assert(chan);
  2222. tor_assert(chan->cmux);
  2223. circuitmux_assert_okay(chan->cmux);
  2224. }
  2225. /** Return 1 if we shouldn't restart reading on this circuit, even if
  2226. * we get a SENDME. Else return 0.
  2227. */
  2228. static int
  2229. circuit_queue_streams_are_blocked(circuit_t *circ)
  2230. {
  2231. if (CIRCUIT_IS_ORIGIN(circ)) {
  2232. return circ->streams_blocked_on_n_chan;
  2233. } else {
  2234. return circ->streams_blocked_on_p_chan;
  2235. }
  2236. }