relay.c 115 KB

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