relay.c 90 KB

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