relay.c 110 KB

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