relay.c 106 KB

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