relay.c 118 KB

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