relay.c 110 KB

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