relay.c 113 KB

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