relay.c 105 KB

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