relay.c 104 KB

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