or.h 181 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376
  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-2012, The Tor Project, Inc. */
  5. /* See LICENSE for licensing information */
  6. /**
  7. * \file or.h
  8. * \brief Master header file for Tor-specific functionality.
  9. **/
  10. #ifndef _TOR_OR_H
  11. #define _TOR_OR_H
  12. #include "orconfig.h"
  13. #ifdef __COVERITY__
  14. /* If we're building for a static analysis, turn on all the off-by-default
  15. * features. */
  16. #ifndef INSTRUMENT_DOWNLOADS
  17. #define INSTRUMENT_DOWNLOADS 1
  18. #endif
  19. #endif
  20. #ifdef _WIN32
  21. #ifndef _WIN32_WINNT
  22. #define _WIN32_WINNT 0x0501
  23. #endif
  24. #define WIN32_LEAN_AND_MEAN
  25. #endif
  26. #ifdef HAVE_UNISTD_H
  27. #include <unistd.h>
  28. #endif
  29. #ifdef HAVE_SIGNAL_H
  30. #include <signal.h>
  31. #endif
  32. #ifdef HAVE_NETDB_H
  33. #include <netdb.h>
  34. #endif
  35. #ifdef HAVE_SYS_PARAM_H
  36. #include <sys/param.h> /* FreeBSD needs this to know what version it is */
  37. #endif
  38. #include "torint.h"
  39. #ifdef HAVE_SYS_WAIT_H
  40. #include <sys/wait.h>
  41. #endif
  42. #ifdef HAVE_SYS_FCNTL_H
  43. #include <sys/fcntl.h>
  44. #endif
  45. #ifdef HAVE_FCNTL_H
  46. #include <fcntl.h>
  47. #endif
  48. #ifdef HAVE_SYS_IOCTL_H
  49. #include <sys/ioctl.h>
  50. #endif
  51. #ifdef HAVE_SYS_UN_H
  52. #include <sys/un.h>
  53. #endif
  54. #ifdef HAVE_SYS_STAT_H
  55. #include <sys/stat.h>
  56. #endif
  57. #ifdef HAVE_NETINET_IN_H
  58. #include <netinet/in.h>
  59. #endif
  60. #ifdef HAVE_ARPA_INET_H
  61. #include <arpa/inet.h>
  62. #endif
  63. #ifdef HAVE_ERRNO_H
  64. #include <errno.h>
  65. #endif
  66. #ifdef HAVE_ASSERT_H
  67. #include <assert.h>
  68. #endif
  69. #ifdef HAVE_TIME_H
  70. #include <time.h>
  71. #endif
  72. #ifdef _WIN32
  73. #include <io.h>
  74. #include <process.h>
  75. #include <direct.h>
  76. #include <windows.h>
  77. #define snprintf _snprintf
  78. #endif
  79. #ifdef USE_BUFFEREVENTS
  80. #include <event2/bufferevent.h>
  81. #include <event2/buffer.h>
  82. #include <event2/util.h>
  83. #endif
  84. #include "crypto.h"
  85. #include "tortls.h"
  86. #include "../common/torlog.h"
  87. #include "container.h"
  88. #include "torgzip.h"
  89. #include "address.h"
  90. #include "compat_libevent.h"
  91. #include "ht.h"
  92. /* These signals are defined to help handle_control_signal work.
  93. */
  94. #ifndef SIGHUP
  95. #define SIGHUP 1
  96. #endif
  97. #ifndef SIGINT
  98. #define SIGINT 2
  99. #endif
  100. #ifndef SIGUSR1
  101. #define SIGUSR1 10
  102. #endif
  103. #ifndef SIGUSR2
  104. #define SIGUSR2 12
  105. #endif
  106. #ifndef SIGTERM
  107. #define SIGTERM 15
  108. #endif
  109. /* Controller signals start at a high number so we don't
  110. * conflict with system-defined signals. */
  111. #define SIGNEWNYM 129
  112. #define SIGCLEARDNSCACHE 130
  113. #if (SIZEOF_CELL_T != 0)
  114. /* On Irix, stdlib.h defines a cell_t type, so we need to make sure
  115. * that our stuff always calls cell_t something different. */
  116. #define cell_t tor_cell_t
  117. #endif
  118. #ifdef ENABLE_TOR2WEB_MODE
  119. #define NON_ANONYMOUS_MODE_ENABLED 1
  120. #endif
  121. /** Length of longest allowable configured nickname. */
  122. #define MAX_NICKNAME_LEN 19
  123. /** Length of a router identity encoded as a hexadecimal digest, plus
  124. * possible dollar sign. */
  125. #define MAX_HEX_NICKNAME_LEN (HEX_DIGEST_LEN+1)
  126. /** Maximum length of verbose router identifier: dollar sign, hex ID digest,
  127. * equal sign or tilde, nickname. */
  128. #define MAX_VERBOSE_NICKNAME_LEN (1+HEX_DIGEST_LEN+1+MAX_NICKNAME_LEN)
  129. /** Maximum size, in bytes, for resized buffers. */
  130. #define MAX_BUF_SIZE ((1<<24)-1) /* 16MB-1 */
  131. /** Maximum size, in bytes, for any directory object that we've downloaded. */
  132. #define MAX_DIR_DL_SIZE MAX_BUF_SIZE
  133. /** For HTTP parsing: Maximum number of bytes we'll accept in the headers
  134. * of an HTTP request or response. */
  135. #define MAX_HEADERS_SIZE 50000
  136. /** Maximum size, in bytes, for any directory object that we're accepting
  137. * as an upload. */
  138. #define MAX_DIR_UL_SIZE MAX_BUF_SIZE
  139. /** Maximum size, in bytes, of a single router descriptor uploaded to us
  140. * as a directory authority. Caches and clients fetch whatever descriptors
  141. * the authorities tell them to fetch, and don't care about size. */
  142. #define MAX_DESCRIPTOR_UPLOAD_SIZE 20000
  143. /** Maximum size of a single extrainfo document, as above. */
  144. #define MAX_EXTRAINFO_UPLOAD_SIZE 50000
  145. /** How long do we keep DNS cache entries before purging them (regardless of
  146. * their TTL)? */
  147. #define MAX_DNS_ENTRY_AGE (30*60)
  148. /** How long do we cache/tell clients to cache DNS records when no TTL is
  149. * known? */
  150. #define DEFAULT_DNS_TTL (30*60)
  151. /** How long can a TTL be before we stop believing it? */
  152. #define MAX_DNS_TTL (3*60*60)
  153. /** How small can a TTL be before we stop believing it? Provides rudimentary
  154. * pinning. */
  155. #define MIN_DNS_TTL 60
  156. /** How often do we rotate onion keys? */
  157. #define MIN_ONION_KEY_LIFETIME (7*24*60*60)
  158. /** How often do we rotate TLS contexts? */
  159. #define MAX_SSL_KEY_LIFETIME_INTERNAL (2*60*60)
  160. /** What expiry time shall we place on our SSL certs? */
  161. #define MAX_SSL_KEY_LIFETIME_ADVERTISED (365*24*60*60)
  162. /** How old do we allow a router to get before removing it
  163. * from the router list? In seconds. */
  164. #define ROUTER_MAX_AGE (60*60*48)
  165. /** How old can a router get before we (as a server) will no longer
  166. * consider it live? In seconds. */
  167. #define ROUTER_MAX_AGE_TO_PUBLISH (60*60*24)
  168. /** How old do we let a saved descriptor get before force-removing it? */
  169. #define OLD_ROUTER_DESC_MAX_AGE (60*60*24*5)
  170. /** Possible rules for generating circuit IDs on an OR connection. */
  171. typedef enum {
  172. CIRC_ID_TYPE_LOWER=0, /**< Pick from 0..1<<15-1. */
  173. CIRC_ID_TYPE_HIGHER=1, /**< Pick from 1<<15..1<<16-1. */
  174. /** The other side of a connection is an OP: never create circuits to it,
  175. * and let it use any circuit ID it wants. */
  176. CIRC_ID_TYPE_NEITHER=2
  177. } circ_id_type_t;
  178. #define _CONN_TYPE_MIN 3
  179. /** Type for sockets listening for OR connections. */
  180. #define CONN_TYPE_OR_LISTENER 3
  181. /** A bidirectional TLS connection transmitting a sequence of cells.
  182. * May be from an OR to an OR, or from an OP to an OR. */
  183. #define CONN_TYPE_OR 4
  184. /** A TCP connection from an onion router to a stream's destination. */
  185. #define CONN_TYPE_EXIT 5
  186. /** Type for sockets listening for SOCKS connections. */
  187. #define CONN_TYPE_AP_LISTENER 6
  188. /** A SOCKS proxy connection from the user application to the onion
  189. * proxy. */
  190. #define CONN_TYPE_AP 7
  191. /** Type for sockets listening for HTTP connections to the directory server. */
  192. #define CONN_TYPE_DIR_LISTENER 8
  193. /** Type for HTTP connections to the directory server. */
  194. #define CONN_TYPE_DIR 9
  195. /** Connection from the main process to a CPU worker process. */
  196. #define CONN_TYPE_CPUWORKER 10
  197. /** Type for listening for connections from user interface process. */
  198. #define CONN_TYPE_CONTROL_LISTENER 11
  199. /** Type for connections from user interface process. */
  200. #define CONN_TYPE_CONTROL 12
  201. /** Type for sockets listening for transparent connections redirected by pf or
  202. * netfilter. */
  203. #define CONN_TYPE_AP_TRANS_LISTENER 13
  204. /** Type for sockets listening for transparent connections redirected by
  205. * natd. */
  206. #define CONN_TYPE_AP_NATD_LISTENER 14
  207. /** Type for sockets listening for DNS requests. */
  208. #define CONN_TYPE_AP_DNS_LISTENER 15
  209. #define _CONN_TYPE_MAX 15
  210. /* !!!! If _CONN_TYPE_MAX is ever over 15, we must grow the type field in
  211. * connection_t. */
  212. /* Proxy client types */
  213. #define PROXY_NONE 0
  214. #define PROXY_CONNECT 1
  215. #define PROXY_SOCKS4 2
  216. #define PROXY_SOCKS5 3
  217. /* !!!! If there is ever a PROXY_* type over 2, we must grow the proxy_type
  218. * field in or_connection_t */
  219. /* pluggable transports proxy type */
  220. #define PROXY_PLUGGABLE 4
  221. /* Proxy client handshake states */
  222. /* We use a proxy but we haven't even connected to it yet. */
  223. #define PROXY_INFANT 1
  224. /* We use an HTTP proxy and we've sent the CONNECT command. */
  225. #define PROXY_HTTPS_WANT_CONNECT_OK 2
  226. /* We use a SOCKS4 proxy and we've sent the CONNECT command. */
  227. #define PROXY_SOCKS4_WANT_CONNECT_OK 3
  228. /* We use a SOCKS5 proxy and we try to negotiate without
  229. any authentication . */
  230. #define PROXY_SOCKS5_WANT_AUTH_METHOD_NONE 4
  231. /* We use a SOCKS5 proxy and we try to negotiate with
  232. Username/Password authentication . */
  233. #define PROXY_SOCKS5_WANT_AUTH_METHOD_RFC1929 5
  234. /* We use a SOCKS5 proxy and we just sent our credentials. */
  235. #define PROXY_SOCKS5_WANT_AUTH_RFC1929_OK 6
  236. /* We use a SOCKS5 proxy and we just sent our CONNECT command. */
  237. #define PROXY_SOCKS5_WANT_CONNECT_OK 7
  238. /* We use a proxy and we CONNECTed successfully!. */
  239. #define PROXY_CONNECTED 8
  240. /** True iff <b>x</b> is an edge connection. */
  241. #define CONN_IS_EDGE(x) \
  242. ((x)->type == CONN_TYPE_EXIT || (x)->type == CONN_TYPE_AP)
  243. /** State for any listener connection. */
  244. #define LISTENER_STATE_READY 0
  245. #define _CPUWORKER_STATE_MIN 1
  246. /** State for a connection to a cpuworker process that's idle. */
  247. #define CPUWORKER_STATE_IDLE 1
  248. /** State for a connection to a cpuworker process that's processing a
  249. * handshake. */
  250. #define CPUWORKER_STATE_BUSY_ONION 2
  251. #define _CPUWORKER_STATE_MAX 2
  252. #define CPUWORKER_TASK_ONION CPUWORKER_STATE_BUSY_ONION
  253. #define _OR_CONN_STATE_MIN 1
  254. /** State for a connection to an OR: waiting for connect() to finish. */
  255. #define OR_CONN_STATE_CONNECTING 1
  256. /** State for a connection to an OR: waiting for proxy handshake to complete */
  257. #define OR_CONN_STATE_PROXY_HANDSHAKING 2
  258. /** State for an OR connection client: SSL is handshaking, not done
  259. * yet. */
  260. #define OR_CONN_STATE_TLS_HANDSHAKING 3
  261. /** State for a connection to an OR: We're doing a second SSL handshake for
  262. * renegotiation purposes. (V2 handshake only.) */
  263. #define OR_CONN_STATE_TLS_CLIENT_RENEGOTIATING 4
  264. /** State for a connection at an OR: We're waiting for the client to
  265. * renegotiate (to indicate a v2 handshake) or send a versions cell (to
  266. * indicate a v3 handshake) */
  267. #define OR_CONN_STATE_TLS_SERVER_RENEGOTIATING 5
  268. /** State for an OR connection: We're done with our SSL handshake, we've done
  269. * renegotiation, but we haven't yet negotiated link protocol versions and
  270. * sent a netinfo cell. */
  271. #define OR_CONN_STATE_OR_HANDSHAKING_V2 6
  272. /** State for an OR connection: We're done with our SSL handshake, but we
  273. * haven't yet negotiated link protocol versions, done a V3 handshake, and
  274. * sent a netinfo cell. */
  275. #define OR_CONN_STATE_OR_HANDSHAKING_V3 7
  276. /** State for an OR connection: Ready to send/receive cells. */
  277. #define OR_CONN_STATE_OPEN 8
  278. #define _OR_CONN_STATE_MAX 8
  279. #define _EXIT_CONN_STATE_MIN 1
  280. /** State for an exit connection: waiting for response from DNS farm. */
  281. #define EXIT_CONN_STATE_RESOLVING 1
  282. /** State for an exit connection: waiting for connect() to finish. */
  283. #define EXIT_CONN_STATE_CONNECTING 2
  284. /** State for an exit connection: open and ready to transmit data. */
  285. #define EXIT_CONN_STATE_OPEN 3
  286. /** State for an exit connection: waiting to be removed. */
  287. #define EXIT_CONN_STATE_RESOLVEFAILED 4
  288. #define _EXIT_CONN_STATE_MAX 4
  289. /* The AP state values must be disjoint from the EXIT state values. */
  290. #define _AP_CONN_STATE_MIN 5
  291. /** State for a SOCKS connection: waiting for SOCKS request. */
  292. #define AP_CONN_STATE_SOCKS_WAIT 5
  293. /** State for a SOCKS connection: got a y.onion URL; waiting to receive
  294. * rendezvous descriptor. */
  295. #define AP_CONN_STATE_RENDDESC_WAIT 6
  296. /** The controller will attach this connection to a circuit; it isn't our
  297. * job to do so. */
  298. #define AP_CONN_STATE_CONTROLLER_WAIT 7
  299. /** State for a SOCKS connection: waiting for a completed circuit. */
  300. #define AP_CONN_STATE_CIRCUIT_WAIT 8
  301. /** State for a SOCKS connection: sent BEGIN, waiting for CONNECTED. */
  302. #define AP_CONN_STATE_CONNECT_WAIT 9
  303. /** State for a SOCKS connection: sent RESOLVE, waiting for RESOLVED. */
  304. #define AP_CONN_STATE_RESOLVE_WAIT 10
  305. /** State for a SOCKS connection: ready to send and receive. */
  306. #define AP_CONN_STATE_OPEN 11
  307. /** State for a transparent natd connection: waiting for original
  308. * destination. */
  309. #define AP_CONN_STATE_NATD_WAIT 12
  310. #define _AP_CONN_STATE_MAX 12
  311. /** True iff the AP_CONN_STATE_* value <b>s</b> means that the corresponding
  312. * edge connection is not attached to any circuit. */
  313. #define AP_CONN_STATE_IS_UNATTACHED(s) \
  314. ((s) <= AP_CONN_STATE_CIRCUIT_WAIT || (s) == AP_CONN_STATE_NATD_WAIT)
  315. #define _DIR_CONN_STATE_MIN 1
  316. /** State for connection to directory server: waiting for connect(). */
  317. #define DIR_CONN_STATE_CONNECTING 1
  318. /** State for connection to directory server: sending HTTP request. */
  319. #define DIR_CONN_STATE_CLIENT_SENDING 2
  320. /** State for connection to directory server: reading HTTP response. */
  321. #define DIR_CONN_STATE_CLIENT_READING 3
  322. /** State for connection to directory server: happy and finished. */
  323. #define DIR_CONN_STATE_CLIENT_FINISHED 4
  324. /** State for connection at directory server: waiting for HTTP request. */
  325. #define DIR_CONN_STATE_SERVER_COMMAND_WAIT 5
  326. /** State for connection at directory server: sending HTTP response. */
  327. #define DIR_CONN_STATE_SERVER_WRITING 6
  328. #define _DIR_CONN_STATE_MAX 6
  329. /** True iff the purpose of <b>conn</b> means that it's a server-side
  330. * directory connection. */
  331. #define DIR_CONN_IS_SERVER(conn) ((conn)->purpose == DIR_PURPOSE_SERVER)
  332. #define _CONTROL_CONN_STATE_MIN 1
  333. /** State for a control connection: Authenticated and accepting v1 commands. */
  334. #define CONTROL_CONN_STATE_OPEN 1
  335. /** State for a control connection: Waiting for authentication; speaking
  336. * protocol v1. */
  337. #define CONTROL_CONN_STATE_NEEDAUTH 2
  338. #define _CONTROL_CONN_STATE_MAX 2
  339. #define _DIR_PURPOSE_MIN 3
  340. /** A connection to a directory server: download a rendezvous
  341. * descriptor. */
  342. #define DIR_PURPOSE_FETCH_RENDDESC 3
  343. /** A connection to a directory server: set after a rendezvous
  344. * descriptor is downloaded. */
  345. #define DIR_PURPOSE_HAS_FETCHED_RENDDESC 4
  346. /** A connection to a directory server: download one or more v2
  347. * network-status objects */
  348. #define DIR_PURPOSE_FETCH_V2_NETWORKSTATUS 5
  349. /** A connection to a directory server: download one or more server
  350. * descriptors. */
  351. #define DIR_PURPOSE_FETCH_SERVERDESC 6
  352. /** A connection to a directory server: download one or more extra-info
  353. * documents. */
  354. #define DIR_PURPOSE_FETCH_EXTRAINFO 7
  355. /** A connection to a directory server: upload a server descriptor. */
  356. #define DIR_PURPOSE_UPLOAD_DIR 8
  357. /** A connection to a directory server: upload a rendezvous
  358. * descriptor. */
  359. #define DIR_PURPOSE_UPLOAD_RENDDESC 9
  360. /** A connection to a directory server: upload a v3 networkstatus vote. */
  361. #define DIR_PURPOSE_UPLOAD_VOTE 10
  362. /** A connection to a directory server: upload a v3 consensus signature */
  363. #define DIR_PURPOSE_UPLOAD_SIGNATURES 11
  364. /** A connection to a directory server: download one or more v3 networkstatus
  365. * votes. */
  366. #define DIR_PURPOSE_FETCH_STATUS_VOTE 12
  367. /** A connection to a directory server: download a v3 detached signatures
  368. * object for a consensus. */
  369. #define DIR_PURPOSE_FETCH_DETACHED_SIGNATURES 13
  370. /** A connection to a directory server: download a v3 networkstatus
  371. * consensus. */
  372. #define DIR_PURPOSE_FETCH_CONSENSUS 14
  373. /** A connection to a directory server: download one or more directory
  374. * authority certificates. */
  375. #define DIR_PURPOSE_FETCH_CERTIFICATE 15
  376. /** Purpose for connection at a directory server. */
  377. #define DIR_PURPOSE_SERVER 16
  378. /** A connection to a hidden service directory server: upload a v2 rendezvous
  379. * descriptor. */
  380. #define DIR_PURPOSE_UPLOAD_RENDDESC_V2 17
  381. /** A connection to a hidden service directory server: download a v2 rendezvous
  382. * descriptor. */
  383. #define DIR_PURPOSE_FETCH_RENDDESC_V2 18
  384. /** A connection to a directory server: download a microdescriptor. */
  385. #define DIR_PURPOSE_FETCH_MICRODESC 19
  386. #define _DIR_PURPOSE_MAX 19
  387. /** True iff <b>p</b> is a purpose corresponding to uploading data to a
  388. * directory server. */
  389. #define DIR_PURPOSE_IS_UPLOAD(p) \
  390. ((p)==DIR_PURPOSE_UPLOAD_DIR || \
  391. (p)==DIR_PURPOSE_UPLOAD_RENDDESC || \
  392. (p)==DIR_PURPOSE_UPLOAD_VOTE || \
  393. (p)==DIR_PURPOSE_UPLOAD_SIGNATURES)
  394. #define _EXIT_PURPOSE_MIN 1
  395. /** This exit stream wants to do an ordinary connect. */
  396. #define EXIT_PURPOSE_CONNECT 1
  397. /** This exit stream wants to do a resolve (either normal or reverse). */
  398. #define EXIT_PURPOSE_RESOLVE 2
  399. #define _EXIT_PURPOSE_MAX 2
  400. /* !!!! If any connection purpose is ever over 31, we must grow the type
  401. * field in connection_t. */
  402. /** Circuit state: I'm the origin, still haven't done all my handshakes. */
  403. #define CIRCUIT_STATE_BUILDING 0
  404. /** Circuit state: Waiting to process the onionskin. */
  405. #define CIRCUIT_STATE_ONIONSKIN_PENDING 1
  406. /** Circuit state: I'd like to deliver a create, but my n_conn is still
  407. * connecting. */
  408. #define CIRCUIT_STATE_OR_WAIT 2
  409. /** Circuit state: onionskin(s) processed, ready to send/receive cells. */
  410. #define CIRCUIT_STATE_OPEN 3
  411. #define _CIRCUIT_PURPOSE_MIN 1
  412. /* these circuits were initiated elsewhere */
  413. #define _CIRCUIT_PURPOSE_OR_MIN 1
  414. /** OR-side circuit purpose: normal circuit, at OR. */
  415. #define CIRCUIT_PURPOSE_OR 1
  416. /** OR-side circuit purpose: At OR, from Bob, waiting for intro from Alices. */
  417. #define CIRCUIT_PURPOSE_INTRO_POINT 2
  418. /** OR-side circuit purpose: At OR, from Alice, waiting for Bob. */
  419. #define CIRCUIT_PURPOSE_REND_POINT_WAITING 3
  420. /** OR-side circuit purpose: At OR, both circuits have this purpose. */
  421. #define CIRCUIT_PURPOSE_REND_ESTABLISHED 4
  422. #define _CIRCUIT_PURPOSE_OR_MAX 4
  423. /* these circuits originate at this node */
  424. /* here's how circ client-side purposes work:
  425. * normal circuits are C_GENERAL.
  426. * circuits that are c_introducing are either on their way to
  427. * becoming open, or they are open and waiting for a
  428. * suitable rendcirc before they send the intro.
  429. * circuits that are c_introduce_ack_wait have sent the intro,
  430. * but haven't gotten a response yet.
  431. * circuits that are c_establish_rend are either on their way
  432. * to becoming open, or they are open and have sent the
  433. * establish_rendezvous cell but haven't received an ack.
  434. * circuits that are c_rend_ready are open and have received a
  435. * rend ack, but haven't heard from bob yet. if they have a
  436. * buildstate->pending_final_cpath then they're expecting a
  437. * cell from bob, else they're not.
  438. * circuits that are c_rend_ready_intro_acked are open, and
  439. * some intro circ has sent its intro and received an ack.
  440. * circuits that are c_rend_joined are open, have heard from
  441. * bob, and are talking to him.
  442. */
  443. /** Client-side circuit purpose: Normal circuit, with cpath. */
  444. #define CIRCUIT_PURPOSE_C_GENERAL 5
  445. /** Client-side circuit purpose: at Alice, connecting to intro point. */
  446. #define CIRCUIT_PURPOSE_C_INTRODUCING 6
  447. /** Client-side circuit purpose: at Alice, sent INTRODUCE1 to intro point,
  448. * waiting for ACK/NAK. */
  449. #define CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT 7
  450. /** Client-side circuit purpose: at Alice, introduced and acked, closing. */
  451. #define CIRCUIT_PURPOSE_C_INTRODUCE_ACKED 8
  452. /** Client-side circuit purpose: at Alice, waiting for ack. */
  453. #define CIRCUIT_PURPOSE_C_ESTABLISH_REND 9
  454. /** Client-side circuit purpose: at Alice, waiting for Bob. */
  455. #define CIRCUIT_PURPOSE_C_REND_READY 10
  456. /** Client-side circuit purpose: at Alice, waiting for Bob, INTRODUCE
  457. * has been acknowledged. */
  458. #define CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED 11
  459. /** Client-side circuit purpose: at Alice, rendezvous established. */
  460. #define CIRCUIT_PURPOSE_C_REND_JOINED 12
  461. /** This circuit is used for build time measurement only */
  462. #define CIRCUIT_PURPOSE_C_MEASURE_TIMEOUT 13
  463. #define _CIRCUIT_PURPOSE_C_MAX 13
  464. /** Hidden-service-side circuit purpose: at Bob, waiting for introductions. */
  465. #define CIRCUIT_PURPOSE_S_ESTABLISH_INTRO 14
  466. /** Hidden-service-side circuit purpose: at Bob, successfully established
  467. * intro. */
  468. #define CIRCUIT_PURPOSE_S_INTRO 15
  469. /** Hidden-service-side circuit purpose: at Bob, connecting to rend point. */
  470. #define CIRCUIT_PURPOSE_S_CONNECT_REND 16
  471. /** Hidden-service-side circuit purpose: at Bob, rendezvous established. */
  472. #define CIRCUIT_PURPOSE_S_REND_JOINED 17
  473. /** A testing circuit; not meant to be used for actual traffic. */
  474. #define CIRCUIT_PURPOSE_TESTING 18
  475. /** A controller made this circuit and Tor should not use it. */
  476. #define CIRCUIT_PURPOSE_CONTROLLER 19
  477. #define _CIRCUIT_PURPOSE_MAX 19
  478. /** A catch-all for unrecognized purposes. Currently we don't expect
  479. * to make or see any circuits with this purpose. */
  480. #define CIRCUIT_PURPOSE_UNKNOWN 255
  481. /** True iff the circuit purpose <b>p</b> is for a circuit that
  482. * originated at this node. */
  483. #define CIRCUIT_PURPOSE_IS_ORIGIN(p) ((p)>_CIRCUIT_PURPOSE_OR_MAX)
  484. /** True iff the circuit purpose <b>p</b> is for a circuit that originated
  485. * here to serve as a client. (Hidden services don't count here.) */
  486. #define CIRCUIT_PURPOSE_IS_CLIENT(p) \
  487. ((p)> _CIRCUIT_PURPOSE_OR_MAX && \
  488. (p)<=_CIRCUIT_PURPOSE_C_MAX)
  489. /** True iff the circuit_t <b>c</b> is actually an origin_circuit_t. */
  490. #define CIRCUIT_IS_ORIGIN(c) (CIRCUIT_PURPOSE_IS_ORIGIN((c)->purpose))
  491. /** True iff the circuit purpose <b>p</b> is for an established rendezvous
  492. * circuit. */
  493. #define CIRCUIT_PURPOSE_IS_ESTABLISHED_REND(p) \
  494. ((p) == CIRCUIT_PURPOSE_C_REND_JOINED || \
  495. (p) == CIRCUIT_PURPOSE_S_REND_JOINED)
  496. /** How many circuits do we want simultaneously in-progress to handle
  497. * a given stream? */
  498. #define MIN_CIRCUITS_HANDLING_STREAM 2
  499. /* These RELAY_COMMAND constants define values for relay cell commands, and
  500. * must match those defined in tor-spec.txt. */
  501. #define RELAY_COMMAND_BEGIN 1
  502. #define RELAY_COMMAND_DATA 2
  503. #define RELAY_COMMAND_END 3
  504. #define RELAY_COMMAND_CONNECTED 4
  505. #define RELAY_COMMAND_SENDME 5
  506. #define RELAY_COMMAND_EXTEND 6
  507. #define RELAY_COMMAND_EXTENDED 7
  508. #define RELAY_COMMAND_TRUNCATE 8
  509. #define RELAY_COMMAND_TRUNCATED 9
  510. #define RELAY_COMMAND_DROP 10
  511. #define RELAY_COMMAND_RESOLVE 11
  512. #define RELAY_COMMAND_RESOLVED 12
  513. #define RELAY_COMMAND_BEGIN_DIR 13
  514. #define RELAY_COMMAND_ESTABLISH_INTRO 32
  515. #define RELAY_COMMAND_ESTABLISH_RENDEZVOUS 33
  516. #define RELAY_COMMAND_INTRODUCE1 34
  517. #define RELAY_COMMAND_INTRODUCE2 35
  518. #define RELAY_COMMAND_RENDEZVOUS1 36
  519. #define RELAY_COMMAND_RENDEZVOUS2 37
  520. #define RELAY_COMMAND_INTRO_ESTABLISHED 38
  521. #define RELAY_COMMAND_RENDEZVOUS_ESTABLISHED 39
  522. #define RELAY_COMMAND_INTRODUCE_ACK 40
  523. /* Reasons why an OR connection is closed. */
  524. #define END_OR_CONN_REASON_DONE 1
  525. #define END_OR_CONN_REASON_REFUSED 2 /* connection refused */
  526. #define END_OR_CONN_REASON_OR_IDENTITY 3
  527. #define END_OR_CONN_REASON_CONNRESET 4 /* connection reset by peer */
  528. #define END_OR_CONN_REASON_TIMEOUT 5
  529. #define END_OR_CONN_REASON_NO_ROUTE 6 /* no route to host/net */
  530. #define END_OR_CONN_REASON_IO_ERROR 7 /* read/write error */
  531. #define END_OR_CONN_REASON_RESOURCE_LIMIT 8 /* sockets, buffers, etc */
  532. #define END_OR_CONN_REASON_MISC 9
  533. /* Reasons why we (or a remote OR) might close a stream. See tor-spec.txt for
  534. * documentation of these. The values must match. */
  535. #define END_STREAM_REASON_MISC 1
  536. #define END_STREAM_REASON_RESOLVEFAILED 2
  537. #define END_STREAM_REASON_CONNECTREFUSED 3
  538. #define END_STREAM_REASON_EXITPOLICY 4
  539. #define END_STREAM_REASON_DESTROY 5
  540. #define END_STREAM_REASON_DONE 6
  541. #define END_STREAM_REASON_TIMEOUT 7
  542. #define END_STREAM_REASON_NOROUTE 8
  543. #define END_STREAM_REASON_HIBERNATING 9
  544. #define END_STREAM_REASON_INTERNAL 10
  545. #define END_STREAM_REASON_RESOURCELIMIT 11
  546. #define END_STREAM_REASON_CONNRESET 12
  547. #define END_STREAM_REASON_TORPROTOCOL 13
  548. #define END_STREAM_REASON_NOTDIRECTORY 14
  549. #define END_STREAM_REASON_ENTRYPOLICY 15
  550. /* These high-numbered end reasons are not part of the official spec,
  551. * and are not intended to be put in relay end cells. They are here
  552. * to be more informative when sending back socks replies to the
  553. * application. */
  554. /* XXXX 256 is no longer used; feel free to reuse it. */
  555. /** We were unable to attach the connection to any circuit at all. */
  556. /* XXXX the ways we use this one don't make a lot of sense. */
  557. #define END_STREAM_REASON_CANT_ATTACH 257
  558. /** We can't connect to any directories at all, so we killed our streams
  559. * before they can time out. */
  560. #define END_STREAM_REASON_NET_UNREACHABLE 258
  561. /** This is a SOCKS connection, and the client used (or misused) the SOCKS
  562. * protocol in a way we couldn't handle. */
  563. #define END_STREAM_REASON_SOCKSPROTOCOL 259
  564. /** This is a transparent proxy connection, but we can't extract the original
  565. * target address:port. */
  566. #define END_STREAM_REASON_CANT_FETCH_ORIG_DEST 260
  567. /** This is a connection on the NATD port, and the destination IP:Port was
  568. * either ill-formed or out-of-range. */
  569. #define END_STREAM_REASON_INVALID_NATD_DEST 261
  570. /** The target address is in a private network (like 127.0.0.1 or 10.0.0.1);
  571. * you don't want to do that over a randomly chosen exit */
  572. #define END_STREAM_REASON_PRIVATE_ADDR 262
  573. /** Bitwise-and this value with endreason to mask out all flags. */
  574. #define END_STREAM_REASON_MASK 511
  575. /** Bitwise-or this with the argument to control_event_stream_status
  576. * to indicate that the reason came from an END cell. */
  577. #define END_STREAM_REASON_FLAG_REMOTE 512
  578. /** Bitwise-or this with the argument to control_event_stream_status
  579. * to indicate that we already sent a CLOSED stream event. */
  580. #define END_STREAM_REASON_FLAG_ALREADY_SENT_CLOSED 1024
  581. /** Bitwise-or this with endreason to indicate that we already sent
  582. * a socks reply, and no further reply needs to be sent from
  583. * connection_mark_unattached_ap(). */
  584. #define END_STREAM_REASON_FLAG_ALREADY_SOCKS_REPLIED 2048
  585. /** Reason for remapping an AP connection's address: we have a cached
  586. * answer. */
  587. #define REMAP_STREAM_SOURCE_CACHE 1
  588. /** Reason for remapping an AP connection's address: the exit node told us an
  589. * answer. */
  590. #define REMAP_STREAM_SOURCE_EXIT 2
  591. /* 'type' values to use in RESOLVED cells. Specified in tor-spec.txt. */
  592. #define RESOLVED_TYPE_HOSTNAME 0
  593. #define RESOLVED_TYPE_IPV4 4
  594. #define RESOLVED_TYPE_IPV6 6
  595. #define RESOLVED_TYPE_ERROR_TRANSIENT 0xF0
  596. #define RESOLVED_TYPE_ERROR 0xF1
  597. /* Negative reasons are internal: we never send them in a DESTROY or TRUNCATE
  598. * call; they only go to the controller for tracking */
  599. /** Our post-timeout circuit time measurement period expired.
  600. * We must give up now */
  601. #define END_CIRC_REASON_MEASUREMENT_EXPIRED -3
  602. /** We couldn't build a path for this circuit. */
  603. #define END_CIRC_REASON_NOPATH -2
  604. /** Catch-all "other" reason for closing origin circuits. */
  605. #define END_CIRC_AT_ORIGIN -1
  606. /* Reasons why we (or a remote OR) might close a circuit. See tor-spec.txt for
  607. * documentation of these. */
  608. #define _END_CIRC_REASON_MIN 0
  609. #define END_CIRC_REASON_NONE 0
  610. #define END_CIRC_REASON_TORPROTOCOL 1
  611. #define END_CIRC_REASON_INTERNAL 2
  612. #define END_CIRC_REASON_REQUESTED 3
  613. #define END_CIRC_REASON_HIBERNATING 4
  614. #define END_CIRC_REASON_RESOURCELIMIT 5
  615. #define END_CIRC_REASON_CONNECTFAILED 6
  616. #define END_CIRC_REASON_OR_IDENTITY 7
  617. #define END_CIRC_REASON_OR_CONN_CLOSED 8
  618. #define END_CIRC_REASON_FINISHED 9
  619. #define END_CIRC_REASON_TIMEOUT 10
  620. #define END_CIRC_REASON_DESTROYED 11
  621. #define END_CIRC_REASON_NOSUCHSERVICE 12
  622. #define _END_CIRC_REASON_MAX 12
  623. /** Bitwise-OR this with the argument to circuit_mark_for_close() or
  624. * control_event_circuit_status() to indicate that the reason was
  625. * passed through from a destroy or truncate cell. */
  626. #define END_CIRC_REASON_FLAG_REMOTE 512
  627. /** Length of 'y' portion of 'y.onion' URL. */
  628. #define REND_SERVICE_ID_LEN_BASE32 16
  629. /** Length of 'y.onion' including '.onion' URL. */
  630. #define REND_SERVICE_ADDRESS_LEN (16+1+5)
  631. /** Length of a binary-encoded rendezvous service ID. */
  632. #define REND_SERVICE_ID_LEN 10
  633. /** Time period for which a v2 descriptor will be valid. */
  634. #define REND_TIME_PERIOD_V2_DESC_VALIDITY (24*60*60)
  635. /** Time period within which two sets of v2 descriptors will be uploaded in
  636. * parallel. */
  637. #define REND_TIME_PERIOD_OVERLAPPING_V2_DESCS (60*60)
  638. /** Number of non-consecutive replicas (i.e. distributed somewhere
  639. * in the ring) for a descriptor. */
  640. #define REND_NUMBER_OF_NON_CONSECUTIVE_REPLICAS 2
  641. /** Number of consecutive replicas for a descriptor. */
  642. #define REND_NUMBER_OF_CONSECUTIVE_REPLICAS 3
  643. /** Length of v2 descriptor ID (32 base32 chars = 160 bits). */
  644. #define REND_DESC_ID_V2_LEN_BASE32 32
  645. /** Length of the base32-encoded secret ID part of versioned hidden service
  646. * descriptors. */
  647. #define REND_SECRET_ID_PART_LEN_BASE32 32
  648. /** Length of the base32-encoded hash of an introduction point's
  649. * identity key. */
  650. #define REND_INTRO_POINT_ID_LEN_BASE32 32
  651. /** Length of the descriptor cookie that is used for client authorization
  652. * to hidden services. */
  653. #define REND_DESC_COOKIE_LEN 16
  654. /** Length of the base64-encoded descriptor cookie that is used for
  655. * exchanging client authorization between hidden service and client. */
  656. #define REND_DESC_COOKIE_LEN_BASE64 22
  657. /** Length of client identifier in encrypted introduction points for hidden
  658. * service authorization type 'basic'. */
  659. #define REND_BASIC_AUTH_CLIENT_ID_LEN 4
  660. /** Multiple of the number of clients to which the real number of clients
  661. * is padded with fake clients for hidden service authorization type
  662. * 'basic'. */
  663. #define REND_BASIC_AUTH_CLIENT_MULTIPLE 16
  664. /** Length of client entry consisting of client identifier and encrypted
  665. * session key for hidden service authorization type 'basic'. */
  666. #define REND_BASIC_AUTH_CLIENT_ENTRY_LEN (REND_BASIC_AUTH_CLIENT_ID_LEN \
  667. + CIPHER_KEY_LEN)
  668. /** Maximum size of v2 hidden service descriptors. */
  669. #define REND_DESC_MAX_SIZE (20 * 1024)
  670. /** Legal characters for use in authorized client names for a hidden
  671. * service. */
  672. #define REND_LEGAL_CLIENTNAME_CHARACTERS \
  673. "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789+-_"
  674. /** Maximum length of authorized client names for a hidden service. */
  675. #define REND_CLIENTNAME_MAX_LEN 16
  676. /** Length of the rendezvous cookie that is used to connect circuits at the
  677. * rendezvous point. */
  678. #define REND_COOKIE_LEN DIGEST_LEN
  679. /** Client authorization type that a hidden service performs. */
  680. typedef enum rend_auth_type_t {
  681. REND_NO_AUTH = 0,
  682. REND_BASIC_AUTH = 1,
  683. REND_STEALTH_AUTH = 2,
  684. } rend_auth_type_t;
  685. /** Client-side configuration of authorization for a hidden service. */
  686. typedef struct rend_service_authorization_t {
  687. char descriptor_cookie[REND_DESC_COOKIE_LEN];
  688. char onion_address[REND_SERVICE_ADDRESS_LEN+1];
  689. rend_auth_type_t auth_type;
  690. } rend_service_authorization_t;
  691. /** Client- and server-side data that is used for hidden service connection
  692. * establishment. Not all fields contain data depending on where this struct
  693. * is used. */
  694. typedef struct rend_data_t {
  695. /** Onion address (without the .onion part) that a client requests. */
  696. char onion_address[REND_SERVICE_ID_LEN_BASE32+1];
  697. /** (Optional) descriptor cookie that is used by a client. */
  698. char descriptor_cookie[REND_DESC_COOKIE_LEN];
  699. /** Authorization type for accessing a service used by a client. */
  700. rend_auth_type_t auth_type;
  701. /** Hash of the hidden service's PK used by a service. */
  702. char rend_pk_digest[DIGEST_LEN];
  703. /** Rendezvous cookie used by both, client and service. */
  704. char rend_cookie[REND_COOKIE_LEN];
  705. } rend_data_t;
  706. /** Time interval for tracking replays of DH public keys received in
  707. * INTRODUCE2 cells. Used only to avoid launching multiple
  708. * simultaneous attempts to connect to the same rendezvous point. */
  709. #define REND_REPLAY_TIME_INTERVAL (5 * 60)
  710. /** Used to indicate which way a cell is going on a circuit. */
  711. typedef enum {
  712. CELL_DIRECTION_IN=1, /**< The cell is moving towards the origin. */
  713. CELL_DIRECTION_OUT=2, /**< The cell is moving away from the origin. */
  714. } cell_direction_t;
  715. /** Initial value for both sides of a circuit transmission window when the
  716. * circuit is initialized. Measured in cells. */
  717. #define CIRCWINDOW_START 1000
  718. #define CIRCWINDOW_START_MIN 100
  719. #define CIRCWINDOW_START_MAX 1000
  720. /** Amount to increment a circuit window when we get a circuit SENDME. */
  721. #define CIRCWINDOW_INCREMENT 100
  722. /** Initial value on both sides of a stream transmission window when the
  723. * stream is initialized. Measured in cells. */
  724. #define STREAMWINDOW_START 500
  725. /** Amount to increment a stream window when we get a stream SENDME. */
  726. #define STREAMWINDOW_INCREMENT 50
  727. /* Cell commands. These values are defined in tor-spec.txt. */
  728. #define CELL_PADDING 0
  729. #define CELL_CREATE 1
  730. #define CELL_CREATED 2
  731. #define CELL_RELAY 3
  732. #define CELL_DESTROY 4
  733. #define CELL_CREATE_FAST 5
  734. #define CELL_CREATED_FAST 6
  735. #define CELL_VERSIONS 7
  736. #define CELL_NETINFO 8
  737. #define CELL_RELAY_EARLY 9
  738. #define CELL_VPADDING 128
  739. #define CELL_CERTS 129
  740. #define CELL_AUTH_CHALLENGE 130
  741. #define CELL_AUTHENTICATE 131
  742. #define CELL_AUTHORIZE 132
  743. /** How long to test reachability before complaining to the user. */
  744. #define TIMEOUT_UNTIL_UNREACHABILITY_COMPLAINT (20*60)
  745. /** Legal characters in a nickname. */
  746. #define LEGAL_NICKNAME_CHARACTERS \
  747. "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"
  748. /** Name to use in client TLS certificates if no nickname is given. Once
  749. * Tor 0.1.2.x is obsolete, we can remove this. */
  750. #define DEFAULT_CLIENT_NICKNAME "client"
  751. /** Name chosen by routers that don't configure nicknames */
  752. #define UNNAMED_ROUTER_NICKNAME "Unnamed"
  753. /** Number of bytes in a SOCKS4 header. */
  754. #define SOCKS4_NETWORK_LEN 8
  755. /*
  756. * Relay payload:
  757. * Relay command [1 byte]
  758. * Recognized [2 bytes]
  759. * Stream ID [2 bytes]
  760. * Partial SHA-1 [4 bytes]
  761. * Length [2 bytes]
  762. * Relay payload [498 bytes]
  763. */
  764. /** Number of bytes in a cell, minus cell header. */
  765. #define CELL_PAYLOAD_SIZE 509
  766. /** Number of bytes in a cell transmitted over the network. */
  767. #define CELL_NETWORK_SIZE 512
  768. /** Length of a header on a variable-length cell. */
  769. #define VAR_CELL_HEADER_SIZE 5
  770. /** Number of bytes in a relay cell's header (not including general cell
  771. * header). */
  772. #define RELAY_HEADER_SIZE (1+2+2+4+2)
  773. /** Largest number of bytes that can fit in a relay cell payload. */
  774. #define RELAY_PAYLOAD_SIZE (CELL_PAYLOAD_SIZE-RELAY_HEADER_SIZE)
  775. /** Identifies a circuit on an or_connection */
  776. typedef uint16_t circid_t;
  777. /** Identifies a stream on a circuit */
  778. typedef uint16_t streamid_t;
  779. /** Parsed onion routing cell. All communication between nodes
  780. * is via cells. */
  781. typedef struct cell_t {
  782. circid_t circ_id; /**< Circuit which received the cell. */
  783. uint8_t command; /**< Type of the cell: one of CELL_PADDING, CELL_CREATE,
  784. * CELL_DESTROY, etc */
  785. uint8_t payload[CELL_PAYLOAD_SIZE]; /**< Cell body. */
  786. } cell_t;
  787. /** Parsed variable-length onion routing cell. */
  788. typedef struct var_cell_t {
  789. /** Type of the cell: CELL_VERSIONS, etc. */
  790. uint8_t command;
  791. /** Circuit thich received the cell */
  792. circid_t circ_id;
  793. /** Number of bytes actually stored in <b>payload</b> */
  794. uint16_t payload_len;
  795. /** Payload of this cell */
  796. uint8_t payload[FLEXIBLE_ARRAY_MEMBER];
  797. } var_cell_t;
  798. /** A cell as packed for writing to the network. */
  799. typedef struct packed_cell_t {
  800. struct packed_cell_t *next; /**< Next cell queued on this circuit. */
  801. char body[CELL_NETWORK_SIZE]; /**< Cell as packed for network. */
  802. } packed_cell_t;
  803. /** Number of cells added to a circuit queue including their insertion
  804. * time on 10 millisecond detail; used for buffer statistics. */
  805. typedef struct insertion_time_elem_t {
  806. struct insertion_time_elem_t *next; /**< Next element in queue. */
  807. uint32_t insertion_time; /**< When were cells inserted (in 10 ms steps
  808. * starting at 0:00 of the current day)? */
  809. unsigned counter; /**< How many cells were inserted? */
  810. } insertion_time_elem_t;
  811. /** Queue of insertion times. */
  812. typedef struct insertion_time_queue_t {
  813. struct insertion_time_elem_t *first; /**< First element in queue. */
  814. struct insertion_time_elem_t *last; /**< Last element in queue. */
  815. } insertion_time_queue_t;
  816. /** A queue of cells on a circuit, waiting to be added to the
  817. * or_connection_t's outbuf. */
  818. typedef struct cell_queue_t {
  819. packed_cell_t *head; /**< The first cell, or NULL if the queue is empty. */
  820. packed_cell_t *tail; /**< The last cell, or NULL if the queue is empty. */
  821. int n; /**< The number of cells in the queue. */
  822. insertion_time_queue_t *insertion_times; /**< Insertion times of cells. */
  823. } cell_queue_t;
  824. /** Beginning of a RELAY cell payload. */
  825. typedef struct {
  826. uint8_t command; /**< The end-to-end relay command. */
  827. uint16_t recognized; /**< Used to tell whether cell is for us. */
  828. streamid_t stream_id; /**< Which stream is this cell associated with? */
  829. char integrity[4]; /**< Used to tell whether cell is corrupted. */
  830. uint16_t length; /**< How long is the payload body? */
  831. } relay_header_t;
  832. typedef struct buf_t buf_t;
  833. typedef struct socks_request_t socks_request_t;
  834. #ifdef USE_BUFFEREVENTS
  835. #define generic_buffer_t struct evbuffer
  836. #else
  837. #define generic_buffer_t buf_t
  838. #endif
  839. /* Values for connection_t.magic: used to make sure that downcasts (casts from
  840. * connection_t to foo_connection_t) are safe. */
  841. #define BASE_CONNECTION_MAGIC 0x7C3C304Eu
  842. #define OR_CONNECTION_MAGIC 0x7D31FF03u
  843. #define EDGE_CONNECTION_MAGIC 0xF0374013u
  844. #define ENTRY_CONNECTION_MAGIC 0xbb4a5703
  845. #define DIR_CONNECTION_MAGIC 0x9988ffeeu
  846. #define CONTROL_CONNECTION_MAGIC 0x8abc765du
  847. #define LISTENER_CONNECTION_MAGIC 0x1a1ac741u
  848. /** Description of a connection to another host or process, and associated
  849. * data.
  850. *
  851. * A connection is named based on what it's connected to -- an "OR
  852. * connection" has a Tor node on the other end, an "exit
  853. * connection" has a website or other server on the other end, and an
  854. * "AP connection" has an application proxy (and thus a user) on the
  855. * other end.
  856. *
  857. * Every connection has a type and a state. Connections never change
  858. * their type, but can go through many state changes in their lifetime.
  859. *
  860. * Every connection has two associated input and output buffers.
  861. * Listeners don't use them. For non-listener connections, incoming
  862. * data is appended to conn->inbuf, and outgoing data is taken from
  863. * conn->outbuf. Connections differ primarily in the functions called
  864. * to fill and drain these buffers.
  865. */
  866. typedef struct connection_t {
  867. uint32_t magic; /**< For memory debugging: must equal one of
  868. * *_CONNECTION_MAGIC. */
  869. uint8_t state; /**< Current state of this connection. */
  870. unsigned int type:4; /**< What kind of connection is this? */
  871. unsigned int purpose:5; /**< Only used for DIR and EXIT types currently. */
  872. /* The next fields are all one-bit booleans. Some are only applicable to
  873. * connection subtypes, but we hold them here anyway, to save space.
  874. */
  875. unsigned int read_blocked_on_bw:1; /**< Boolean: should we start reading
  876. * again once the bandwidth throttler allows it? */
  877. unsigned int write_blocked_on_bw:1; /**< Boolean: should we start writing
  878. * again once the bandwidth throttler allows
  879. * writes? */
  880. unsigned int hold_open_until_flushed:1; /**< Despite this connection's being
  881. * marked for close, do we flush it
  882. * before closing it? */
  883. unsigned int inbuf_reached_eof:1; /**< Boolean: did read() return 0 on this
  884. * conn? */
  885. /** Set to 1 when we're inside connection_flushed_some to keep us from
  886. * calling connection_handle_write() recursively. */
  887. unsigned int in_flushed_some:1;
  888. /* For linked connections:
  889. */
  890. unsigned int linked:1; /**< True if there is, or has been, a linked_conn. */
  891. /** True iff we'd like to be notified about read events from the
  892. * linked conn. */
  893. unsigned int reading_from_linked_conn:1;
  894. /** True iff we're willing to write to the linked conn. */
  895. unsigned int writing_to_linked_conn:1;
  896. /** True iff we're currently able to read on the linked conn, and our
  897. * read_event should be made active with libevent. */
  898. unsigned int active_on_link:1;
  899. /** True iff we've called connection_close_immediate() on this linked
  900. * connection. */
  901. unsigned int linked_conn_is_closed:1;
  902. /** CONNECT/SOCKS proxy client handshake state (for outgoing connections). */
  903. unsigned int proxy_state:4;
  904. /** Our socket; set to TOR_INVALID_SOCKET if this connection is closed,
  905. * or has no socket. */
  906. tor_socket_t s;
  907. int conn_array_index; /**< Index into the global connection array. */
  908. struct event *read_event; /**< Libevent event structure. */
  909. struct event *write_event; /**< Libevent event structure. */
  910. buf_t *inbuf; /**< Buffer holding data read over this connection. */
  911. buf_t *outbuf; /**< Buffer holding data to write over this connection. */
  912. size_t outbuf_flushlen; /**< How much data should we try to flush from the
  913. * outbuf? */
  914. time_t timestamp_lastread; /**< When was the last time libevent said we could
  915. * read? */
  916. time_t timestamp_lastwritten; /**< When was the last time libevent said we
  917. * could write? */
  918. #ifdef USE_BUFFEREVENTS
  919. struct bufferevent *bufev; /**< A Libevent buffered IO structure. */
  920. #endif
  921. time_t timestamp_created; /**< When was this connection_t created? */
  922. /* XXXX_IP6 make this IPv6-capable */
  923. int socket_family; /**< Address family of this connection's socket. Usually
  924. * AF_INET, but it can also be AF_UNIX, or in the future
  925. * AF_INET6 */
  926. tor_addr_t addr; /**< IP of the other side of the connection; used to
  927. * identify routers, along with port. */
  928. uint16_t port; /**< If non-zero, port on the other end
  929. * of the connection. */
  930. uint16_t marked_for_close; /**< Should we close this conn on the next
  931. * iteration of the main loop? (If true, holds
  932. * the line number where this connection was
  933. * marked.) */
  934. const char *marked_for_close_file; /**< For debugging: in which file were
  935. * we marked for close? */
  936. char *address; /**< FQDN (or IP) of the guy on the other end.
  937. * strdup into this, because free_connection() frees it. */
  938. /** Another connection that's connected to this one in lieu of a socket. */
  939. struct connection_t *linked_conn;
  940. /** Unique identifier for this connection on this Tor instance. */
  941. uint64_t global_identifier;
  942. /** Unique ID for measuring tunneled network status requests. */
  943. uint64_t dirreq_id;
  944. } connection_t;
  945. /* DOCDOC listener_connection_t */
  946. typedef struct listener_connection_t {
  947. connection_t _base;
  948. /** If the connection is a CONN_TYPE_AP_DNS_LISTENER, this field points
  949. * to the evdns_server_port it uses to listen to and answer connections. */
  950. struct evdns_server_port *dns_server_port;
  951. /** @name Isolation parameters
  952. *
  953. * For an AP listener, these fields describe how to isolate streams that
  954. * arrive on the listener.
  955. *
  956. * @{
  957. */
  958. /** The session group for this listener. */
  959. int session_group;
  960. /** One or more ISO_ flags to describe how to isolate streams. */
  961. uint8_t isolation_flags;
  962. /**@}*/
  963. } listener_connection_t;
  964. /** Minimum length of the random part of an AUTH_CHALLENGE cell. */
  965. #define OR_AUTH_CHALLENGE_LEN 32
  966. /**
  967. * @name Certificate types for CERTS cells.
  968. *
  969. * These values are defined by the protocol, and affect how an X509
  970. * certificate in a CERTS cell is interpreted and used.
  971. *
  972. * @{ */
  973. /** A certificate that authenticates a TLS link key. The subject key
  974. * must match the key used in the TLS handshake; it must be signed by
  975. * the identity key. */
  976. #define OR_CERT_TYPE_TLS_LINK 1
  977. /** A self-signed identity certificate. The subject key must be a
  978. * 1024-bit RSA key. */
  979. #define OR_CERT_TYPE_ID_1024 2
  980. /** A certificate that authenticates a key used in an AUTHENTICATE cell
  981. * in the v3 handshake. The subject key must be a 1024-bit RSA key; it
  982. * must be signed by the identity key */
  983. #define OR_CERT_TYPE_AUTH_1024 3
  984. /**@}*/
  985. /** The one currently supported type of AUTHENTICATE cell. It contains
  986. * a bunch of structures signed with an RSA1024 key. The signed
  987. * structures include a HMAC using negotiated TLS secrets, and a digest
  988. * of all cells sent or received before the AUTHENTICATE cell (including
  989. * the random server-generated AUTH_CHALLENGE cell).
  990. */
  991. #define AUTHTYPE_RSA_SHA256_TLSSECRET 1
  992. /** The length of the part of the AUTHENTICATE cell body that the client and
  993. * server can generate independently (when using RSA_SHA256_TLSSECRET). It
  994. * contains everything except the client's timestamp, the client's randomly
  995. * generated nonce, and the signature. */
  996. #define V3_AUTH_FIXED_PART_LEN (8+(32*6))
  997. /** The length of the part of the AUTHENTICATE cell body that the client
  998. * signs. */
  999. #define V3_AUTH_BODY_LEN (V3_AUTH_FIXED_PART_LEN + 8 + 16)
  1000. /** Stores flags and information related to the portion of a v2/v3 Tor OR
  1001. * connection handshake that happens after the TLS handshake is finished.
  1002. */
  1003. typedef struct or_handshake_state_t {
  1004. /** When was the VERSIONS cell sent on this connection? Used to get
  1005. * an estimate of the skew in the returning NETINFO reply. */
  1006. time_t sent_versions_at;
  1007. /** True iff we originated this connection */
  1008. unsigned int started_here : 1;
  1009. /** True iff we have received and processed a VERSIONS cell. */
  1010. unsigned int received_versions : 1;
  1011. /** True iff we have received and processed an AUTH_CHALLENGE cell */
  1012. unsigned int received_auth_challenge : 1;
  1013. /** True iff we have received and processed a CERTS cell. */
  1014. unsigned int received_certs_cell : 1;
  1015. /** True iff we have received and processed an AUTHENTICATE cell */
  1016. unsigned int received_authenticate : 1;
  1017. /* True iff we've received valid authentication to some identity. */
  1018. unsigned int authenticated : 1;
  1019. /** True iff we should feed outgoing cells into digest_sent and
  1020. * digest_received respectively.
  1021. *
  1022. * From the server's side of the v3 handshake, we want to capture everything
  1023. * from the VERSIONS cell through and including the AUTH_CHALLENGE cell.
  1024. * From the client's, we want to capture everything from the VERSIONS cell
  1025. * through but *not* including the AUTHENTICATE cell.
  1026. *
  1027. * @{ */
  1028. unsigned int digest_sent_data : 1;
  1029. unsigned int digest_received_data : 1;
  1030. /**@}*/
  1031. /** Identity digest that we have received and authenticated for our peer
  1032. * on this connection. */
  1033. uint8_t authenticated_peer_id[DIGEST_LEN];
  1034. /** Digests of the cells that we have sent or received as part of a V3
  1035. * handshake. Used for making and checking AUTHENTICATE cells.
  1036. *
  1037. * @{
  1038. */
  1039. crypto_digest_t *digest_sent;
  1040. crypto_digest_t *digest_received;
  1041. /** @} */
  1042. /** Certificates that a connection initiator sent us in a CERTS cell; we're
  1043. * holding on to them until we get an AUTHENTICATE cell.
  1044. *
  1045. * @{
  1046. */
  1047. /** The cert for the key that's supposed to sign the AUTHENTICATE cell */
  1048. tor_cert_t *auth_cert;
  1049. /** A self-signed identity certificate */
  1050. tor_cert_t *id_cert;
  1051. /**@}*/
  1052. } or_handshake_state_t;
  1053. /** Subtype of connection_t for an "OR connection" -- that is, one that speaks
  1054. * cells over TLS. */
  1055. typedef struct or_connection_t {
  1056. connection_t _base;
  1057. /** Hash of the public RSA key for the other side's identity key, or zeroes
  1058. * if the other side hasn't shown us a valid identity key. */
  1059. char identity_digest[DIGEST_LEN];
  1060. char *nickname; /**< Nickname of OR on other side (if any). */
  1061. tor_tls_t *tls; /**< TLS connection state. */
  1062. int tls_error; /**< Last tor_tls error code. */
  1063. /** When we last used this conn for any client traffic. If not
  1064. * recent, we can rate limit it further. */
  1065. time_t client_used;
  1066. tor_addr_t real_addr; /**< The actual address that this connection came from
  1067. * or went to. The <b>addr</b> field is prone to
  1068. * getting overridden by the address from the router
  1069. * descriptor matching <b>identity_digest</b>. */
  1070. circ_id_type_t circ_id_type:2; /**< When we send CREATE cells along this
  1071. * connection, which half of the space should
  1072. * we use? */
  1073. /** Should this connection be used for extending circuits to the server
  1074. * matching the <b>identity_digest</b> field? Set to true if we're pretty
  1075. * sure we aren't getting MITMed, either because we're connected to an
  1076. * address listed in a server descriptor, or because an authenticated
  1077. * NETINFO cell listed the address we're connected to as recognized. */
  1078. unsigned int is_canonical:1;
  1079. /** True iff this connection shouldn't get any new circs attached to it,
  1080. * because the connection is too old, or because there's a better one.
  1081. * More generally, this flag is used to note an unhealthy connection;
  1082. * for example, if a bad connection fails we shouldn't assume that the
  1083. * router itself has a problem.
  1084. */
  1085. unsigned int is_bad_for_new_circs:1;
  1086. /** True iff we have decided that the other end of this connection
  1087. * is a client. Connections with this flag set should never be used
  1088. * to satisfy an EXTEND request. */
  1089. unsigned int is_connection_with_client:1;
  1090. /** True iff this is an outgoing connection. */
  1091. unsigned int is_outgoing:1;
  1092. unsigned int proxy_type:2; /**< One of PROXY_NONE...PROXY_SOCKS5 */
  1093. uint8_t link_proto; /**< What protocol version are we using? 0 for
  1094. * "none negotiated yet." */
  1095. circid_t next_circ_id; /**< Which circ_id do we try to use next on
  1096. * this connection? This is always in the
  1097. * range 0..1<<15-1. */
  1098. or_handshake_state_t *handshake_state; /**< If we are setting this connection
  1099. * up, state information to do so. */
  1100. time_t timestamp_lastempty; /**< When was the outbuf last completely empty?*/
  1101. time_t timestamp_last_added_nonpadding; /** When did we last add a
  1102. * non-padding cell to the outbuf? */
  1103. /* bandwidth* and *_bucket only used by ORs in OPEN state: */
  1104. int bandwidthrate; /**< Bytes/s added to the bucket. (OPEN ORs only.) */
  1105. int bandwidthburst; /**< Max bucket size for this conn. (OPEN ORs only.) */
  1106. #ifndef USE_BUFFEREVENTS
  1107. int read_bucket; /**< When this hits 0, stop receiving. Every second we
  1108. * add 'bandwidthrate' to this, capping it at
  1109. * bandwidthburst. (OPEN ORs only) */
  1110. int write_bucket; /**< When this hits 0, stop writing. Like read_bucket. */
  1111. #else
  1112. /** A rate-limiting configuration object to determine how this connection
  1113. * set its read- and write- limits. */
  1114. /* XXXX we could share this among all connections. */
  1115. struct ev_token_bucket_cfg *bucket_cfg;
  1116. #endif
  1117. int n_circuits; /**< How many circuits use this connection as p_conn or
  1118. * n_conn ? */
  1119. /** Double-linked ring of circuits with queued cells waiting for room to
  1120. * free up on this connection's outbuf. Every time we pull cells from a
  1121. * circuit, we advance this pointer to the next circuit in the ring. */
  1122. struct circuit_t *active_circuits;
  1123. /** Priority queue of cell_ewma_t for circuits with queued cells waiting for
  1124. * room to free up on this connection's outbuf. Kept in heap order
  1125. * according to EWMA.
  1126. *
  1127. * This is redundant with active_circuits; if we ever decide only to use the
  1128. * cell_ewma algorithm for choosing circuits, we can remove active_circuits.
  1129. */
  1130. smartlist_t *active_circuit_pqueue;
  1131. /** The tick on which the cell_ewma_ts in active_circuit_pqueue last had
  1132. * their ewma values rescaled. */
  1133. unsigned active_circuit_pqueue_last_recalibrated;
  1134. struct or_connection_t *next_with_same_id; /**< Next connection with same
  1135. * identity digest as this one. */
  1136. } or_connection_t;
  1137. /** Subtype of connection_t for an "edge connection" -- that is, an entry (ap)
  1138. * connection, or an exit. */
  1139. typedef struct edge_connection_t {
  1140. connection_t _base;
  1141. struct edge_connection_t *next_stream; /**< Points to the next stream at this
  1142. * edge, if any */
  1143. int package_window; /**< How many more relay cells can I send into the
  1144. * circuit? */
  1145. int deliver_window; /**< How many more relay cells can end at me? */
  1146. struct circuit_t *on_circuit; /**< The circuit (if any) that this edge
  1147. * connection is using. */
  1148. /** A pointer to which node in the circ this conn exits at. Set for AP
  1149. * connections and for hidden service exit connections. */
  1150. struct crypt_path_t *cpath_layer;
  1151. /** What rendezvous service are we querying for (if an AP) or providing (if
  1152. * an exit)? */
  1153. rend_data_t *rend_data;
  1154. uint32_t address_ttl; /**< TTL for address-to-addr mapping on exit
  1155. * connection. Exit connections only. */
  1156. streamid_t stream_id; /**< The stream ID used for this edge connection on its
  1157. * circuit */
  1158. /** The reason why this connection is closing; passed to the controller. */
  1159. uint16_t end_reason;
  1160. /** Bytes read since last call to control_event_stream_bandwidth_used() */
  1161. uint32_t n_read;
  1162. /** Bytes written since last call to control_event_stream_bandwidth_used() */
  1163. uint32_t n_written;
  1164. /** True iff this connection is for a DNS request only. */
  1165. unsigned int is_dns_request:1;
  1166. unsigned int edge_has_sent_end:1; /**< For debugging; only used on edge
  1167. * connections. Set once we've set the stream end,
  1168. * and check in connection_about_to_close_connection().
  1169. */
  1170. /** True iff we've blocked reading until the circuit has fewer queued
  1171. * cells. */
  1172. unsigned int edge_blocked_on_circ:1;
  1173. } edge_connection_t;
  1174. /** Subtype of edge_connection_t for an "entry connection" -- that is, a SOCKS
  1175. * connection, a DNS request, a TransPort connection or a NATD connection */
  1176. typedef struct entry_connection_t {
  1177. edge_connection_t _edge;
  1178. /** Nickname of planned exit node -- used with .exit support. */
  1179. char *chosen_exit_name;
  1180. socks_request_t *socks_request; /**< SOCKS structure describing request (AP
  1181. * only.) */
  1182. /* === Isolation related, AP only. === */
  1183. /** AP only: based on which factors do we isolate this stream? */
  1184. uint8_t isolation_flags;
  1185. /** AP only: what session group is this stream in? */
  1186. int session_group;
  1187. /** AP only: The newnym epoch in which we created this connection. */
  1188. unsigned nym_epoch;
  1189. /** AP only: The original requested address before we rewrote it. */
  1190. char *original_dest_address;
  1191. /* Other fields to isolate on already exist. The ClientAddr is addr. The
  1192. ClientProtocol is a combination of type and socks_request->
  1193. socks_version. SocksAuth is socks_request->username/password.
  1194. DestAddr is in socks_request->address. */
  1195. /** Number of times we've reassigned this application connection to
  1196. * a new circuit. We keep track because the timeout is longer if we've
  1197. * already retried several times. */
  1198. uint8_t num_socks_retries;
  1199. /** For AP connections only: buffer for data that we have sent
  1200. * optimistically, which we might need to re-send if we have to
  1201. * retry this connection. */
  1202. generic_buffer_t *pending_optimistic_data;
  1203. /* For AP connections only: buffer for data that we previously sent
  1204. * optimistically which we are currently re-sending as we retry this
  1205. * connection. */
  1206. generic_buffer_t *sending_optimistic_data;
  1207. /** If this is a DNSPort connection, this field holds the pending DNS
  1208. * request that we're going to try to answer. */
  1209. struct evdns_server_request *dns_server_request;
  1210. #define NUM_CIRCUITS_LAUNCHED_THRESHOLD 10
  1211. /** Number of times we've launched a circuit to handle this stream. If
  1212. * it gets too high, that could indicate an inconsistency between our
  1213. * "launch a circuit to handle this stream" logic and our "attach our
  1214. * stream to one of the available circuits" logic. */
  1215. unsigned int num_circuits_launched:4;
  1216. /** True iff this stream must attach to a one-hop circuit (e.g. for
  1217. * begin_dir). */
  1218. unsigned int want_onehop:1;
  1219. /** True iff this stream should use a BEGIN_DIR relay command to establish
  1220. * itself rather than BEGIN (either via onehop or via a whole circuit). */
  1221. unsigned int use_begindir:1;
  1222. /** For AP connections only. If 1, and we fail to reach the chosen exit,
  1223. * stop requiring it. */
  1224. unsigned int chosen_exit_optional:1;
  1225. /** For AP connections only. If non-zero, this exit node was picked as
  1226. * a result of the TrackHostExit, and the value decrements every time
  1227. * we fail to complete a circuit to our chosen exit -- if it reaches
  1228. * zero, abandon the associated mapaddress. */
  1229. unsigned int chosen_exit_retries:3;
  1230. /** True iff this is an AP connection that came from a transparent or
  1231. * NATd connection */
  1232. unsigned int is_transparent_ap:1;
  1233. /** For AP connections only: Set if this connection's target exit node
  1234. * allows optimistic data (that is, data sent on this stream before
  1235. * the exit has sent a CONNECTED cell) and we have chosen to use it.
  1236. */
  1237. unsigned int may_use_optimistic_data : 1;
  1238. } entry_connection_t;
  1239. /** Subtype of connection_t for an "directory connection" -- that is, an HTTP
  1240. * connection to retrieve or serve directory material. */
  1241. typedef struct dir_connection_t {
  1242. connection_t _base;
  1243. /** Which 'resource' did we ask the directory for? This is typically the part
  1244. * of the URL string that defines, relative to the directory conn purpose,
  1245. * what thing we want. For example, in router descriptor downloads by
  1246. * descriptor digest, it contains "d/", then one ore more +-separated
  1247. * fingerprints.
  1248. **/
  1249. char *requested_resource;
  1250. unsigned int dirconn_direct:1; /**< Is this dirconn direct, or via Tor? */
  1251. /* Used only for server sides of some dir connections, to implement
  1252. * "spooling" of directory material to the outbuf. Otherwise, we'd have
  1253. * to append everything to the outbuf in one enormous chunk. */
  1254. /** What exactly are we spooling right now? */
  1255. enum {
  1256. DIR_SPOOL_NONE=0, DIR_SPOOL_SERVER_BY_DIGEST, DIR_SPOOL_SERVER_BY_FP,
  1257. DIR_SPOOL_EXTRA_BY_DIGEST, DIR_SPOOL_EXTRA_BY_FP,
  1258. DIR_SPOOL_CACHED_DIR, DIR_SPOOL_NETWORKSTATUS,
  1259. DIR_SPOOL_MICRODESC, /* NOTE: if we add another entry, add another bit. */
  1260. } dir_spool_src : 3;
  1261. /** If we're fetching descriptors, what router purpose shall we assign
  1262. * to them? */
  1263. uint8_t router_purpose;
  1264. /** List of fingerprints for networkstatuses or descriptors to be spooled. */
  1265. smartlist_t *fingerprint_stack;
  1266. /** A cached_dir_t object that we're currently spooling out */
  1267. struct cached_dir_t *cached_dir;
  1268. /** The current offset into cached_dir. */
  1269. off_t cached_dir_offset;
  1270. /** The zlib object doing on-the-fly compression for spooled data. */
  1271. tor_zlib_state_t *zlib_state;
  1272. /** What rendezvous service are we querying for? */
  1273. rend_data_t *rend_data;
  1274. char identity_digest[DIGEST_LEN]; /**< Hash of the public RSA key for
  1275. * the directory server's signing key. */
  1276. } dir_connection_t;
  1277. /** Subtype of connection_t for an connection to a controller. */
  1278. typedef struct control_connection_t {
  1279. connection_t _base;
  1280. uint32_t event_mask; /**< Bitfield: which events does this controller
  1281. * care about? */
  1282. /** True if we have sent a protocolinfo reply on this connection. */
  1283. unsigned int have_sent_protocolinfo:1;
  1284. /** True if we have received a takeownership command on this
  1285. * connection. */
  1286. unsigned int is_owning_control_connection:1;
  1287. /** If we have sent an AUTHCHALLENGE reply on this connection and
  1288. * have not received a successful AUTHENTICATE command, points to
  1289. * the value which the client must send to authenticate itself;
  1290. * otherwise, NULL. */
  1291. char *safecookie_client_hash;
  1292. /** Amount of space allocated in incoming_cmd. */
  1293. uint32_t incoming_cmd_len;
  1294. /** Number of bytes currently stored in incoming_cmd. */
  1295. uint32_t incoming_cmd_cur_len;
  1296. /** A control command that we're reading from the inbuf, but which has not
  1297. * yet arrived completely. */
  1298. char *incoming_cmd;
  1299. } control_connection_t;
  1300. /** Cast a connection_t subtype pointer to a connection_t **/
  1301. #define TO_CONN(c) (&(((c)->_base)))
  1302. /** Helper macro: Given a pointer to to._base, of type from*, return &to. */
  1303. #define DOWNCAST(to, ptr) ((to*)SUBTYPE_P(ptr, to, _base))
  1304. /** Cast a entry_connection_t subtype pointer to a edge_connection_t **/
  1305. #define ENTRY_TO_EDGE_CONN(c) (&(((c))->_edge))
  1306. /** Cast a entry_connection_t subtype pointer to a connection_t **/
  1307. #define ENTRY_TO_CONN(c) (TO_CONN(ENTRY_TO_EDGE_CONN(c)))
  1308. /** Convert a connection_t* to an or_connection_t*; assert if the cast is
  1309. * invalid. */
  1310. static or_connection_t *TO_OR_CONN(connection_t *);
  1311. /** Convert a connection_t* to a dir_connection_t*; assert if the cast is
  1312. * invalid. */
  1313. static dir_connection_t *TO_DIR_CONN(connection_t *);
  1314. /** Convert a connection_t* to an edge_connection_t*; assert if the cast is
  1315. * invalid. */
  1316. static edge_connection_t *TO_EDGE_CONN(connection_t *);
  1317. /** Convert a connection_t* to an entry_connection_t*; assert if the cast is
  1318. * invalid. */
  1319. static entry_connection_t *TO_ENTRY_CONN(connection_t *);
  1320. /** Convert a edge_connection_t* to an entry_connection_t*; assert if the cast
  1321. * is invalid. */
  1322. static entry_connection_t *EDGE_TO_ENTRY_CONN(edge_connection_t *);
  1323. /** Convert a connection_t* to an control_connection_t*; assert if the cast is
  1324. * invalid. */
  1325. static control_connection_t *TO_CONTROL_CONN(connection_t *);
  1326. /** Convert a connection_t* to an listener_connection_t*; assert if the cast is
  1327. * invalid. */
  1328. static listener_connection_t *TO_LISTENER_CONN(connection_t *);
  1329. static INLINE or_connection_t *TO_OR_CONN(connection_t *c)
  1330. {
  1331. tor_assert(c->magic == OR_CONNECTION_MAGIC);
  1332. return DOWNCAST(or_connection_t, c);
  1333. }
  1334. static INLINE dir_connection_t *TO_DIR_CONN(connection_t *c)
  1335. {
  1336. tor_assert(c->magic == DIR_CONNECTION_MAGIC);
  1337. return DOWNCAST(dir_connection_t, c);
  1338. }
  1339. static INLINE edge_connection_t *TO_EDGE_CONN(connection_t *c)
  1340. {
  1341. tor_assert(c->magic == EDGE_CONNECTION_MAGIC ||
  1342. c->magic == ENTRY_CONNECTION_MAGIC);
  1343. return DOWNCAST(edge_connection_t, c);
  1344. }
  1345. static INLINE entry_connection_t *TO_ENTRY_CONN(connection_t *c)
  1346. {
  1347. tor_assert(c->magic == ENTRY_CONNECTION_MAGIC);
  1348. return (entry_connection_t*) SUBTYPE_P(c, entry_connection_t, _edge._base);
  1349. }
  1350. static INLINE entry_connection_t *EDGE_TO_ENTRY_CONN(edge_connection_t *c)
  1351. {
  1352. tor_assert(c->_base.magic == ENTRY_CONNECTION_MAGIC);
  1353. return (entry_connection_t*) SUBTYPE_P(c, entry_connection_t, _edge);
  1354. }
  1355. static INLINE control_connection_t *TO_CONTROL_CONN(connection_t *c)
  1356. {
  1357. tor_assert(c->magic == CONTROL_CONNECTION_MAGIC);
  1358. return DOWNCAST(control_connection_t, c);
  1359. }
  1360. static INLINE listener_connection_t *TO_LISTENER_CONN(connection_t *c)
  1361. {
  1362. tor_assert(c->magic == LISTENER_CONNECTION_MAGIC);
  1363. return DOWNCAST(listener_connection_t, c);
  1364. }
  1365. /* Conditional macros to help write code that works whether bufferevents are
  1366. disabled or not.
  1367. We can't just write:
  1368. if (conn->bufev) {
  1369. do bufferevent stuff;
  1370. } else {
  1371. do other stuff;
  1372. }
  1373. because the bufferevent stuff won't even compile unless we have a fairly
  1374. new version of Libevent. Instead, we say:
  1375. IF_HAS_BUFFEREVENT(conn, { do_bufferevent_stuff } );
  1376. or:
  1377. IF_HAS_BUFFEREVENT(conn, {
  1378. do bufferevent stuff;
  1379. }) ELSE_IF_NO_BUFFEREVENT {
  1380. do non-bufferevent stuff;
  1381. }
  1382. If we're compiling with bufferevent support, then the macros expand more or
  1383. less to:
  1384. if (conn->bufev) {
  1385. do_bufferevent_stuff;
  1386. } else {
  1387. do non-bufferevent stuff;
  1388. }
  1389. and if we aren't using bufferevents, they expand more or less to:
  1390. { do non-bufferevent stuff; }
  1391. */
  1392. #ifdef USE_BUFFEREVENTS
  1393. #define HAS_BUFFEREVENT(c) (((c)->bufev) != NULL)
  1394. #define IF_HAS_BUFFEREVENT(c, stmt) \
  1395. if ((c)->bufev) do { \
  1396. stmt ; \
  1397. } while (0)
  1398. #define ELSE_IF_NO_BUFFEREVENT ; else
  1399. #define IF_HAS_NO_BUFFEREVENT(c) \
  1400. if (NULL == (c)->bufev)
  1401. #else
  1402. #define HAS_BUFFEREVENT(c) (0)
  1403. #define IF_HAS_BUFFEREVENT(c, stmt) (void)0
  1404. #define ELSE_IF_NO_BUFFEREVENT ;
  1405. #define IF_HAS_NO_BUFFEREVENT(c) \
  1406. if (1)
  1407. #endif
  1408. /** What action type does an address policy indicate: accept or reject? */
  1409. typedef enum {
  1410. ADDR_POLICY_ACCEPT=1,
  1411. ADDR_POLICY_REJECT=2,
  1412. } addr_policy_action_t;
  1413. /** A reference-counted address policy rule. */
  1414. typedef struct addr_policy_t {
  1415. int refcnt; /**< Reference count */
  1416. addr_policy_action_t policy_type:2;/**< What to do when the policy matches.*/
  1417. unsigned int is_private:1; /**< True iff this is the pseudo-address,
  1418. * "private". */
  1419. unsigned int is_canonical:1; /**< True iff this policy is the canonical
  1420. * copy (stored in a hash table to avoid
  1421. * duplication of common policies) */
  1422. maskbits_t maskbits; /**< Accept/reject all addresses <b>a</b> such that the
  1423. * first <b>maskbits</b> bits of <b>a</b> match
  1424. * <b>addr</b>. */
  1425. tor_addr_t addr; /**< Base address to accept or reject. */
  1426. uint16_t prt_min; /**< Lowest port number to accept/reject. */
  1427. uint16_t prt_max; /**< Highest port number to accept/reject. */
  1428. } addr_policy_t;
  1429. /** A cached_dir_t represents a cacheable directory object, along with its
  1430. * compressed form. */
  1431. typedef struct cached_dir_t {
  1432. char *dir; /**< Contents of this object, NUL-terminated. */
  1433. char *dir_z; /**< Compressed contents of this object. */
  1434. size_t dir_len; /**< Length of <b>dir</b> (not counting its NUL). */
  1435. size_t dir_z_len; /**< Length of <b>dir_z</b>. */
  1436. time_t published; /**< When was this object published. */
  1437. digests_t digests; /**< Digests of this object (networkstatus only) */
  1438. int refcnt; /**< Reference count for this cached_dir_t. */
  1439. } cached_dir_t;
  1440. /** Enum used to remember where a signed_descriptor_t is stored and how to
  1441. * manage the memory for signed_descriptor_body. */
  1442. typedef enum {
  1443. /** The descriptor isn't stored on disk at all: the copy in memory is
  1444. * canonical; the saved_offset field is meaningless. */
  1445. SAVED_NOWHERE=0,
  1446. /** The descriptor is stored in the cached_routers file: the
  1447. * signed_descriptor_body is meaningless; the signed_descriptor_len and
  1448. * saved_offset are used to index into the mmaped cache file. */
  1449. SAVED_IN_CACHE,
  1450. /** The descriptor is stored in the cached_routers.new file: the
  1451. * signed_descriptor_body and saved_offset fields are both set. */
  1452. /* FFFF (We could also mmap the file and grow the mmap as needed, or
  1453. * lazy-load the descriptor text by using seek and read. We don't, for
  1454. * now.)
  1455. */
  1456. SAVED_IN_JOURNAL
  1457. } saved_location_t;
  1458. /** Enumeration: what kind of download schedule are we using for a given
  1459. * object? */
  1460. typedef enum {
  1461. DL_SCHED_GENERIC = 0,
  1462. DL_SCHED_CONSENSUS = 1,
  1463. DL_SCHED_BRIDGE = 2,
  1464. } download_schedule_t;
  1465. /** Information about our plans for retrying downloads for a downloadable
  1466. * object. */
  1467. typedef struct download_status_t {
  1468. time_t next_attempt_at; /**< When should we try downloading this descriptor
  1469. * again? */
  1470. uint8_t n_download_failures; /**< Number of failures trying to download the
  1471. * most recent descriptor. */
  1472. download_schedule_t schedule : 8;
  1473. } download_status_t;
  1474. /** If n_download_failures is this high, the download can never happen. */
  1475. #define IMPOSSIBLE_TO_DOWNLOAD 255
  1476. /** The max size we expect router descriptor annotations we create to
  1477. * be. We'll accept larger ones if we see them on disk, but we won't
  1478. * create any that are larger than this. */
  1479. #define ROUTER_ANNOTATION_BUF_LEN 256
  1480. /** Information need to cache an onion router's descriptor. */
  1481. typedef struct signed_descriptor_t {
  1482. /** Pointer to the raw server descriptor, preceded by annotations. Not
  1483. * necessarily NUL-terminated. If saved_location is SAVED_IN_CACHE, this
  1484. * pointer is null. */
  1485. char *signed_descriptor_body;
  1486. /** Length of the annotations preceding the server descriptor. */
  1487. size_t annotations_len;
  1488. /** Length of the server descriptor. */
  1489. size_t signed_descriptor_len;
  1490. /** Digest of the server descriptor, computed as specified in
  1491. * dir-spec.txt. */
  1492. char signed_descriptor_digest[DIGEST_LEN];
  1493. /** Identity digest of the router. */
  1494. char identity_digest[DIGEST_LEN];
  1495. /** Declared publication time of the descriptor. */
  1496. time_t published_on;
  1497. /** For routerdescs only: digest of the corresponding extrainfo. */
  1498. char extra_info_digest[DIGEST_LEN];
  1499. /** For routerdescs only: Status of downloading the corresponding
  1500. * extrainfo. */
  1501. download_status_t ei_dl_status;
  1502. /** Where is the descriptor saved? */
  1503. saved_location_t saved_location;
  1504. /** If saved_location is SAVED_IN_CACHE or SAVED_IN_JOURNAL, the offset of
  1505. * this descriptor in the corresponding file. */
  1506. off_t saved_offset;
  1507. /** What position is this descriptor within routerlist->routers or
  1508. * routerlist->old_routers? -1 for none. */
  1509. int routerlist_index;
  1510. /** The valid-until time of the most recent consensus that listed this
  1511. * descriptor, or a bit after the publication time of the most recent v2
  1512. * networkstatus that listed it. 0 for "never listed in a consensus or
  1513. * status, so far as we know." */
  1514. time_t last_listed_as_valid_until;
  1515. /* If true, we do not ever try to save this object in the cache. */
  1516. unsigned int do_not_cache : 1;
  1517. /* If true, this item is meant to represent an extrainfo. */
  1518. unsigned int is_extrainfo : 1;
  1519. /* If true, we got an extrainfo for this item, and the digest was right,
  1520. * but it was incompatible. */
  1521. unsigned int extrainfo_is_bogus : 1;
  1522. /* If true, we are willing to transmit this item unencrypted. */
  1523. unsigned int send_unencrypted : 1;
  1524. } signed_descriptor_t;
  1525. /** A signed integer representing a country code. */
  1526. typedef int16_t country_t;
  1527. /** Information about another onion router in the network. */
  1528. typedef struct {
  1529. signed_descriptor_t cache_info;
  1530. char *address; /**< Location of OR: either a hostname or an IP address. */
  1531. char *nickname; /**< Human-readable OR name. */
  1532. uint32_t addr; /**< IPv4 address of OR, in host order. */
  1533. uint16_t or_port; /**< Port for TLS connections. */
  1534. uint16_t dir_port; /**< Port for HTTP directory connections. */
  1535. /** A router's IPv6 address, if it has one. */
  1536. /* XXXXX187 Actually these should probably be part of a list of addresses,
  1537. * not just a special case. Use abstractions to access these; don't do it
  1538. * directly. */
  1539. tor_addr_t ipv6_addr;
  1540. uint16_t ipv6_orport;
  1541. crypto_pk_t *onion_pkey; /**< Public RSA key for onions. */
  1542. crypto_pk_t *identity_pkey; /**< Public RSA key for signing. */
  1543. char *platform; /**< What software/operating system is this OR using? */
  1544. /* link info */
  1545. uint32_t bandwidthrate; /**< How many bytes does this OR add to its token
  1546. * bucket per second? */
  1547. uint32_t bandwidthburst; /**< How large is this OR's token bucket? */
  1548. /** How many bytes/s is this router known to handle? */
  1549. uint32_t bandwidthcapacity;
  1550. smartlist_t *exit_policy; /**< What streams will this OR permit
  1551. * to exit? NULL for 'reject *:*'. */
  1552. long uptime; /**< How many seconds the router claims to have been up */
  1553. smartlist_t *declared_family; /**< Nicknames of router which this router
  1554. * claims are its family. */
  1555. char *contact_info; /**< Declared contact info for this router. */
  1556. unsigned int is_hibernating:1; /**< Whether the router claims to be
  1557. * hibernating */
  1558. unsigned int caches_extra_info:1; /**< Whether the router says it caches and
  1559. * serves extrainfo documents. */
  1560. unsigned int allow_single_hop_exits:1; /**< Whether the router says
  1561. * it allows single hop exits. */
  1562. unsigned int wants_to_be_hs_dir:1; /**< True iff this router claims to be
  1563. * a hidden service directory. */
  1564. unsigned int policy_is_reject_star:1; /**< True iff the exit policy for this
  1565. * router rejects everything. */
  1566. /** True if, after we have added this router, we should re-launch
  1567. * tests for it. */
  1568. unsigned int needs_retest_if_added:1;
  1569. /** True if ipv6_addr:ipv6_orport is preferred. */
  1570. unsigned int ipv6_preferred:1;
  1571. /** Tor can use this router for general positions in circuits; we got it
  1572. * from a directory server as usual, or we're an authority and a server
  1573. * uploaded it. */
  1574. #define ROUTER_PURPOSE_GENERAL 0
  1575. /** Tor should avoid using this router for circuit-building: we got it
  1576. * from a crontroller. If the controller wants to use it, it'll have to
  1577. * ask for it by identity. */
  1578. #define ROUTER_PURPOSE_CONTROLLER 1
  1579. /** Tor should use this router only for bridge positions in circuits: we got
  1580. * it via a directory request from the bridge itself, or a bridge
  1581. * authority. x*/
  1582. #define ROUTER_PURPOSE_BRIDGE 2
  1583. /** Tor should not use this router; it was marked in cached-descriptors with
  1584. * a purpose we didn't recognize. */
  1585. #define ROUTER_PURPOSE_UNKNOWN 255
  1586. /* In what way did we find out about this router? One of ROUTER_PURPOSE_*.
  1587. * Routers of different purposes are kept segregated and used for different
  1588. * things; see notes on ROUTER_PURPOSE_* macros above.
  1589. */
  1590. uint8_t purpose;
  1591. /* The below items are used only by authdirservers for
  1592. * reachability testing. */
  1593. /** When was the last time we could reach this OR? */
  1594. time_t last_reachable;
  1595. /** When did we start testing reachability for this OR? */
  1596. time_t testing_since;
  1597. } routerinfo_t;
  1598. /** Information needed to keep and cache a signed extra-info document. */
  1599. typedef struct extrainfo_t {
  1600. signed_descriptor_t cache_info;
  1601. /** The router's nickname. */
  1602. char nickname[MAX_NICKNAME_LEN+1];
  1603. /** True iff we found the right key for this extra-info, verified the
  1604. * signature, and found it to be bad. */
  1605. unsigned int bad_sig : 1;
  1606. /** If present, we didn't have the right key to verify this extra-info,
  1607. * so this is a copy of the signature in the document. */
  1608. char *pending_sig;
  1609. /** Length of pending_sig. */
  1610. size_t pending_sig_len;
  1611. } extrainfo_t;
  1612. /** Contents of a single router entry in a network status object.
  1613. */
  1614. typedef struct routerstatus_t {
  1615. time_t published_on; /**< When was this router published? */
  1616. char nickname[MAX_NICKNAME_LEN+1]; /**< The nickname this router says it
  1617. * has. */
  1618. char identity_digest[DIGEST_LEN]; /**< Digest of the router's identity
  1619. * key. */
  1620. /** Digest of the router's most recent descriptor or microdescriptor.
  1621. * If it's a descriptor, we only use the first DIGEST_LEN bytes. */
  1622. char descriptor_digest[DIGEST256_LEN];
  1623. uint32_t addr; /**< IPv4 address for this router. */
  1624. uint16_t or_port; /**< OR port for this router. */
  1625. uint16_t dir_port; /**< Directory port for this router. */
  1626. unsigned int is_authority:1; /**< True iff this router is an authority. */
  1627. unsigned int is_exit:1; /**< True iff this router is a good exit. */
  1628. unsigned int is_stable:1; /**< True iff this router stays up a long time. */
  1629. unsigned int is_fast:1; /**< True iff this router has good bandwidth. */
  1630. /** True iff this router is called 'running' in the consensus. We give it
  1631. * this funny name so that we don't accidentally use this bit as a view of
  1632. * whether we think the router is *currently* running. If that's what you
  1633. * want to know, look at is_running in node_t. */
  1634. unsigned int is_flagged_running:1;
  1635. unsigned int is_named:1; /**< True iff "nickname" belongs to this router. */
  1636. unsigned int is_unnamed:1; /**< True iff "nickname" belongs to another
  1637. * router. */
  1638. unsigned int is_valid:1; /**< True iff this router isn't invalid. */
  1639. unsigned int is_v2_dir:1; /**< True iff this router can serve directory
  1640. * information with v2 of the directory
  1641. * protocol. (All directory caches cache v1
  1642. * directories.) */
  1643. unsigned int is_possible_guard:1; /**< True iff this router would be a good
  1644. * choice as an entry guard. */
  1645. unsigned int is_bad_exit:1; /**< True iff this node is a bad choice for
  1646. * an exit node. */
  1647. unsigned int is_bad_directory:1; /**< Do we think this directory is junky,
  1648. * underpowered, or otherwise useless? */
  1649. unsigned int is_hs_dir:1; /**< True iff this router is a v2-or-later hidden
  1650. * service directory. */
  1651. /** True iff we know version info for this router. (i.e., a "v" entry was
  1652. * included.) We'll replace all these with a big tor_version_t or a char[]
  1653. * if the number of traits we care about ever becomes incredibly big. */
  1654. unsigned int version_known:1;
  1655. /** True iff this router is a version that supports BEGIN_DIR cells. */
  1656. unsigned int version_supports_begindir:1;
  1657. /** True iff this router is a version that supports conditional consensus
  1658. * downloads (signed by list of authorities). */
  1659. unsigned int version_supports_conditional_consensus:1;
  1660. /** True iff this router is a version that we can post extrainfo docs to. */
  1661. unsigned int version_supports_extrainfo_upload:1;
  1662. /** True iff this router is a version that, if it caches directory info,
  1663. * we can get v3 downloads from. */
  1664. unsigned int version_supports_v3_dir:1;
  1665. /** True iff this router is a version that, if it caches directory info,
  1666. * we can get microdescriptors from. */
  1667. unsigned int version_supports_microdesc_cache:1;
  1668. /** True iff this router is a version that allows DATA cells to arrive on
  1669. * a stream before it has sent a CONNECTED cell. */
  1670. unsigned int version_supports_optimistic_data:1;
  1671. unsigned int has_bandwidth:1; /**< The vote/consensus had bw info */
  1672. unsigned int has_exitsummary:1; /**< The vote/consensus had exit summaries */
  1673. unsigned int has_measured_bw:1; /**< The vote/consensus had a measured bw */
  1674. uint32_t measured_bw; /**< Measured bandwidth (capacity) of the router */
  1675. uint32_t bandwidth; /**< Bandwidth (capacity) of the router as reported in
  1676. * the vote/consensus, in kilobytes/sec. */
  1677. char *exitsummary; /**< exit policy summary -
  1678. * XXX weasel: this probably should not stay a string. */
  1679. /* ---- The fields below aren't derived from the networkstatus; they
  1680. * hold local information only. */
  1681. /** True if we, as a directory mirror, want to download the corresponding
  1682. * routerinfo from the authority who gave us this routerstatus. (That is,
  1683. * if we don't have the routerinfo, and if we haven't already tried to get it
  1684. * from this authority.) Applies in v2 networkstatus document only.
  1685. */
  1686. unsigned int need_to_mirror:1;
  1687. time_t last_dir_503_at; /**< When did this router last tell us that it
  1688. * was too busy to serve directory info? */
  1689. download_status_t dl_status;
  1690. } routerstatus_t;
  1691. /** A single entry in a parsed policy summary, describing a range of ports. */
  1692. typedef struct short_policy_entry_t {
  1693. uint16_t min_port, max_port;
  1694. } short_policy_entry_t;
  1695. /** A short_poliy_t is the parsed version of a policy summary. */
  1696. typedef struct short_policy_t {
  1697. /** True if the members of 'entries' are port ranges to accept; false if
  1698. * they are port ranges to reject */
  1699. unsigned int is_accept : 1;
  1700. /** The actual number of values in 'entries'. */
  1701. unsigned int n_entries : 31;
  1702. /** An array of 0 or more short_policy_entry_t values, each describing a
  1703. * range of ports that this policy accepts or rejects (depending on the
  1704. * value of is_accept).
  1705. */
  1706. short_policy_entry_t entries[FLEXIBLE_ARRAY_MEMBER];
  1707. } short_policy_t;
  1708. /** A microdescriptor is the smallest amount of information needed to build a
  1709. * circuit through a router. They are generated by the directory authorities,
  1710. * using information from the uploaded routerinfo documents. They are not
  1711. * self-signed, but are rather authenticated by having their hash in a signed
  1712. * networkstatus document. */
  1713. typedef struct microdesc_t {
  1714. /** Hashtable node, used to look up the microdesc by its digest. */
  1715. HT_ENTRY(microdesc_t) node;
  1716. /* Cache information */
  1717. /** When was this microdescriptor last listed in a consensus document?
  1718. * Once a microdesc has been unlisted long enough, we can drop it.
  1719. */
  1720. time_t last_listed;
  1721. /** Where is this microdescriptor currently stored? */
  1722. saved_location_t saved_location : 3;
  1723. /** If true, do not attempt to cache this microdescriptor on disk. */
  1724. unsigned int no_save : 1;
  1725. /** If true, this microdesc has an entry in the microdesc_map */
  1726. unsigned int held_in_map : 1;
  1727. /** Reference count: how many node_ts have a reference to this microdesc? */
  1728. unsigned int held_by_nodes;
  1729. /** If saved_location == SAVED_IN_CACHE, this field holds the offset of the
  1730. * microdescriptor in the cache. */
  1731. off_t off;
  1732. /* The string containing the microdesc. */
  1733. /** A pointer to the encoded body of the microdescriptor. If the
  1734. * saved_location is SAVED_IN_CACHE, then the body is a pointer into an
  1735. * mmap'd region. Otherwise, it is a malloc'd string. The string might not
  1736. * be NUL-terminated; take the length from <b>bodylen</b>. */
  1737. char *body;
  1738. /** The length of the microdescriptor in <b>body</b>. */
  1739. size_t bodylen;
  1740. /** A SHA256-digest of the microdescriptor. */
  1741. char digest[DIGEST256_LEN];
  1742. /* Fields in the microdescriptor. */
  1743. /** As routerinfo_t.onion_pkey */
  1744. crypto_pk_t *onion_pkey;
  1745. /** As routerinfo_t.family */
  1746. smartlist_t *family;
  1747. /** Exit policy summary */
  1748. short_policy_t *exit_policy;
  1749. } microdesc_t;
  1750. /** A node_t represents a Tor router.
  1751. *
  1752. * Specifically, a node_t is a Tor router as we are using it: a router that
  1753. * we are considering for circuits, connections, and so on. A node_t is a
  1754. * thin wrapper around the routerstatus, routerinfo, and microdesc for a
  1755. * single wrapper, and provides a consistent interface for all of them.
  1756. *
  1757. * Also, a node_t has mutable state. While a routerinfo, a routerstatus,
  1758. * and a microdesc have[*] only the information read from a router
  1759. * descriptor, a consensus entry, and a microdescriptor (respectively)...
  1760. * a node_t has flags based on *our own current opinion* of the node.
  1761. *
  1762. * [*] Actually, there is some leftover information in each that is mutable.
  1763. * We should try to excise that.
  1764. */
  1765. typedef struct node_t {
  1766. /* Indexing information */
  1767. /** Used to look up the node_t by its identity digest. */
  1768. HT_ENTRY(node_t) ht_ent;
  1769. /** Position of the node within the list of nodes */
  1770. int nodelist_idx;
  1771. /** The identity digest of this node_t. No more than one node_t per
  1772. * identity may exist at a time. */
  1773. char identity[DIGEST_LEN];
  1774. microdesc_t *md;
  1775. routerinfo_t *ri;
  1776. routerstatus_t *rs;
  1777. /* local info: copied from routerstatus, then possibly frobbed based
  1778. * on experience. Authorities set this stuff directly. */
  1779. unsigned int is_running:1; /**< As far as we know, is this OR currently
  1780. * running? */
  1781. unsigned int is_valid:1; /**< Has a trusted dirserver validated this OR?
  1782. * (For Authdir: Have we validated this OR?)
  1783. */
  1784. unsigned int is_fast:1; /** Do we think this is a fast OR? */
  1785. unsigned int is_stable:1; /** Do we think this is a stable OR? */
  1786. unsigned int is_possible_guard:1; /**< Do we think this is an OK guard? */
  1787. unsigned int is_exit:1; /**< Do we think this is an OK exit? */
  1788. unsigned int is_bad_exit:1; /**< Do we think this exit is censored, borked,
  1789. * or otherwise nasty? */
  1790. unsigned int is_bad_directory:1; /**< Do we think this directory is junky,
  1791. * underpowered, or otherwise useless? */
  1792. unsigned int is_hs_dir:1; /**< True iff this router is a hidden service
  1793. * directory according to the authorities. */
  1794. /* Local info: warning state. */
  1795. unsigned int name_lookup_warned:1; /**< Have we warned the user for referring
  1796. * to this (unnamed) router by nickname?
  1797. */
  1798. /** Local info: we treat this node as if it rejects everything */
  1799. unsigned int rejects_all:1;
  1800. /* Local info: derived. */
  1801. /** According to the geoip db what country is this router in? */
  1802. country_t country;
  1803. } node_t;
  1804. /** How many times will we try to download a router's descriptor before giving
  1805. * up? */
  1806. #define MAX_ROUTERDESC_DOWNLOAD_FAILURES 8
  1807. /** How many times will we try to download a microdescriptor before giving
  1808. * up? */
  1809. #define MAX_MICRODESC_DOWNLOAD_FAILURES 8
  1810. /** Contents of a v2 (non-consensus, non-vote) network status object. */
  1811. typedef struct networkstatus_v2_t {
  1812. /** When did we receive the network-status document? */
  1813. time_t received_on;
  1814. /** What was the digest of the document? */
  1815. char networkstatus_digest[DIGEST_LEN];
  1816. /* These fields come from the actual network-status document.*/
  1817. time_t published_on; /**< Declared publication date. */
  1818. char *source_address; /**< Canonical directory server hostname. */
  1819. uint32_t source_addr; /**< Canonical directory server IP. */
  1820. uint16_t source_dirport; /**< Canonical directory server dirport. */
  1821. unsigned int binds_names:1; /**< True iff this directory server binds
  1822. * names. */
  1823. unsigned int recommends_versions:1; /**< True iff this directory server
  1824. * recommends client and server software
  1825. * versions. */
  1826. unsigned int lists_bad_exits:1; /**< True iff this directory server marks
  1827. * malfunctioning exits as bad. */
  1828. /** True iff this directory server marks malfunctioning directories as
  1829. * bad. */
  1830. unsigned int lists_bad_directories:1;
  1831. char identity_digest[DIGEST_LEN]; /**< Digest of signing key. */
  1832. char *contact; /**< How to contact directory admin? (may be NULL). */
  1833. crypto_pk_t *signing_key; /**< Key used to sign this directory. */
  1834. char *client_versions; /**< comma-separated list of recommended client
  1835. * versions. */
  1836. char *server_versions; /**< comma-separated list of recommended server
  1837. * versions. */
  1838. smartlist_t *entries; /**< List of routerstatus_t*. This list is kept
  1839. * sorted by identity_digest. */
  1840. } networkstatus_v2_t;
  1841. /** Linked list of microdesc hash lines for a single router in a directory
  1842. * vote.
  1843. */
  1844. typedef struct vote_microdesc_hash_t {
  1845. /** Next element in the list, or NULL. */
  1846. struct vote_microdesc_hash_t *next;
  1847. /** The raw contents of the microdesc hash line, excluding the "m". */
  1848. char *microdesc_hash_line;
  1849. } vote_microdesc_hash_t;
  1850. /** The claim about a single router, made in a vote. */
  1851. typedef struct vote_routerstatus_t {
  1852. routerstatus_t status; /**< Underlying 'status' object for this router.
  1853. * Flags are redundant. */
  1854. uint64_t flags; /**< Bit-field for all recognized flags; index into
  1855. * networkstatus_t.known_flags. */
  1856. char *version; /**< The version that the authority says this router is
  1857. * running. */
  1858. /** The hash or hashes that the authority claims this microdesc has. */
  1859. vote_microdesc_hash_t *microdesc;
  1860. } vote_routerstatus_t;
  1861. /** A signature of some document by an authority. */
  1862. typedef struct document_signature_t {
  1863. /** Declared SHA-1 digest of this voter's identity key */
  1864. char identity_digest[DIGEST_LEN];
  1865. /** Declared SHA-1 digest of signing key used by this voter. */
  1866. char signing_key_digest[DIGEST_LEN];
  1867. /** Algorithm used to compute the digest of the document. */
  1868. digest_algorithm_t alg;
  1869. /** Signature of the signed thing. */
  1870. char *signature;
  1871. /** Length of <b>signature</b> */
  1872. int signature_len;
  1873. unsigned int bad_signature : 1; /**< Set to true if we've tried to verify
  1874. * the sig, and we know it's bad. */
  1875. unsigned int good_signature : 1; /**< Set to true if we've verified the sig
  1876. * as good. */
  1877. } document_signature_t;
  1878. /** Information about a single voter in a vote or a consensus. */
  1879. typedef struct networkstatus_voter_info_t {
  1880. /** Declared SHA-1 digest of this voter's identity key */
  1881. char identity_digest[DIGEST_LEN];
  1882. char *nickname; /**< Nickname of this voter */
  1883. /** Digest of this voter's "legacy" identity key, if any. In vote only; for
  1884. * consensuses, we treat legacy keys as additional signers. */
  1885. char legacy_id_digest[DIGEST_LEN];
  1886. char *address; /**< Address of this voter, in string format. */
  1887. uint32_t addr; /**< Address of this voter, in IPv4, in host order. */
  1888. uint16_t dir_port; /**< Directory port of this voter */
  1889. uint16_t or_port; /**< OR port of this voter */
  1890. char *contact; /**< Contact information for this voter. */
  1891. char vote_digest[DIGEST_LEN]; /**< Digest of this voter's vote, as signed. */
  1892. /* Nothing from here on is signed. */
  1893. /** The signature of the document and the signature's status. */
  1894. smartlist_t *sigs;
  1895. } networkstatus_voter_info_t;
  1896. /** Enumerates the possible seriousness values of a networkstatus document. */
  1897. typedef enum {
  1898. NS_TYPE_VOTE,
  1899. NS_TYPE_CONSENSUS,
  1900. NS_TYPE_OPINION,
  1901. } networkstatus_type_t;
  1902. /** Enumerates recognized flavors of a consensus networkstatus document. All
  1903. * flavors of a consensus are generated from the same set of votes, but they
  1904. * present different types information to different versions of Tor. */
  1905. typedef enum {
  1906. FLAV_NS = 0,
  1907. FLAV_MICRODESC = 1,
  1908. } consensus_flavor_t;
  1909. /** How many different consensus flavors are there? */
  1910. #define N_CONSENSUS_FLAVORS ((int)(FLAV_MICRODESC)+1)
  1911. /** A common structure to hold a v3 network status vote, or a v3 network
  1912. * status consensus. */
  1913. typedef struct networkstatus_t {
  1914. networkstatus_type_t type : 8; /**< Vote, consensus, or opinion? */
  1915. consensus_flavor_t flavor : 8; /**< If a consensus, what kind? */
  1916. time_t published; /**< Vote only: Time when vote was written. */
  1917. time_t valid_after; /**< Time after which this vote or consensus applies. */
  1918. time_t fresh_until; /**< Time before which this is the most recent vote or
  1919. * consensus. */
  1920. time_t valid_until; /**< Time after which this vote or consensus should not
  1921. * be used. */
  1922. /** Consensus only: what method was used to produce this consensus? */
  1923. int consensus_method;
  1924. /** Vote only: what methods is this voter willing to use? */
  1925. smartlist_t *supported_methods;
  1926. /** How long does this vote/consensus claim that authorities take to
  1927. * distribute their votes to one another? */
  1928. int vote_seconds;
  1929. /** How long does this vote/consensus claim that authorities take to
  1930. * distribute their consensus signatures to one another? */
  1931. int dist_seconds;
  1932. /** Comma-separated list of recommended client software, or NULL if this
  1933. * voter has no opinion. */
  1934. char *client_versions;
  1935. char *server_versions;
  1936. /** List of flags that this vote/consensus applies to routers. If a flag is
  1937. * not listed here, the voter has no opinion on what its value should be. */
  1938. smartlist_t *known_flags;
  1939. /** List of key=value strings for the parameters in this vote or
  1940. * consensus, sorted by key. */
  1941. smartlist_t *net_params;
  1942. /** List of key=value strings for the bw weight parameters in the
  1943. * consensus. */
  1944. smartlist_t *weight_params;
  1945. /** List of networkstatus_voter_info_t. For a vote, only one element
  1946. * is included. For a consensus, one element is included for every voter
  1947. * whose vote contributed to the consensus. */
  1948. smartlist_t *voters;
  1949. struct authority_cert_t *cert; /**< Vote only: the voter's certificate. */
  1950. /** Digests of this document, as signed. */
  1951. digests_t digests;
  1952. /** List of router statuses, sorted by identity digest. For a vote,
  1953. * the elements are vote_routerstatus_t; for a consensus, the elements
  1954. * are routerstatus_t. */
  1955. smartlist_t *routerstatus_list;
  1956. /** If present, a map from descriptor digest to elements of
  1957. * routerstatus_list. */
  1958. digestmap_t *desc_digest_map;
  1959. } networkstatus_t;
  1960. /** A set of signatures for a networkstatus consensus. Unless otherwise
  1961. * noted, all fields are as for networkstatus_t. */
  1962. typedef struct ns_detached_signatures_t {
  1963. time_t valid_after;
  1964. time_t fresh_until;
  1965. time_t valid_until;
  1966. strmap_t *digests; /**< Map from flavor name to digestset_t */
  1967. strmap_t *signatures; /**< Map from flavor name to list of
  1968. * document_signature_t */
  1969. } ns_detached_signatures_t;
  1970. /** Allowable types of desc_store_t. */
  1971. typedef enum store_type_t {
  1972. ROUTER_STORE = 0,
  1973. EXTRAINFO_STORE = 1
  1974. } store_type_t;
  1975. /** A 'store' is a set of descriptors saved on disk, with accompanying
  1976. * journal, mmaped as needed, rebuilt as needed. */
  1977. typedef struct desc_store_t {
  1978. /** Filename (within DataDir) for the store. We append .tmp to this
  1979. * filename for a temporary file when rebuilding the store, and .new to this
  1980. * filename for the journal. */
  1981. const char *fname_base;
  1982. /** Alternative (obsolete) value for fname_base: if the file named by
  1983. * fname_base isn't present, we read from here instead, but we never write
  1984. * here. */
  1985. const char *fname_alt_base;
  1986. /** Human-readable description of what this store contains. */
  1987. const char *description;
  1988. tor_mmap_t *mmap; /**< A mmap for the main file in the store. */
  1989. store_type_t type; /**< What's stored in this store? */
  1990. /** The size of the router log, in bytes. */
  1991. size_t journal_len;
  1992. /** The size of the router store, in bytes. */
  1993. size_t store_len;
  1994. /** Total bytes dropped since last rebuild: this is space currently
  1995. * used in the cache and the journal that could be freed by a rebuild. */
  1996. size_t bytes_dropped;
  1997. } desc_store_t;
  1998. /** Contents of a directory of onion routers. */
  1999. typedef struct {
  2000. /** Map from server identity digest to a member of routers. */
  2001. struct digest_ri_map_t *identity_map;
  2002. /** Map from server descriptor digest to a signed_descriptor_t from
  2003. * routers or old_routers. */
  2004. struct digest_sd_map_t *desc_digest_map;
  2005. /** Map from extra-info digest to an extrainfo_t. Only exists for
  2006. * routers in routers or old_routers. */
  2007. struct digest_ei_map_t *extra_info_map;
  2008. /** Map from extra-info digests to a signed_descriptor_t for a router
  2009. * descriptor having that extra-info digest. Only exists for
  2010. * routers in routers or old_routers. */
  2011. struct digest_sd_map_t *desc_by_eid_map;
  2012. /** List of routerinfo_t for all currently live routers we know. */
  2013. smartlist_t *routers;
  2014. /** List of signed_descriptor_t for older router descriptors we're
  2015. * caching. */
  2016. smartlist_t *old_routers;
  2017. /** Store holding server descriptors. If present, any router whose
  2018. * cache_info.saved_location == SAVED_IN_CACHE is stored in this file
  2019. * starting at cache_info.saved_offset */
  2020. desc_store_t desc_store;
  2021. /** Store holding extra-info documents. */
  2022. desc_store_t extrainfo_store;
  2023. } routerlist_t;
  2024. /** Information on router used when extending a circuit. We don't need a
  2025. * full routerinfo_t to extend: we only need addr:port:keyid to build an OR
  2026. * connection, and onion_key to create the onionskin. Note that for onehop
  2027. * general-purpose tunnels, the onion_key is NULL. */
  2028. typedef struct extend_info_t {
  2029. char nickname[MAX_HEX_NICKNAME_LEN+1]; /**< This router's nickname for
  2030. * display. */
  2031. char identity_digest[DIGEST_LEN]; /**< Hash of this router's identity key. */
  2032. uint16_t port; /**< OR port. */
  2033. tor_addr_t addr; /**< IP address. */
  2034. crypto_pk_t *onion_key; /**< Current onionskin key. */
  2035. } extend_info_t;
  2036. /** Certificate for v3 directory protocol: binds long-term authority identity
  2037. * keys to medium-term authority signing keys. */
  2038. typedef struct authority_cert_t {
  2039. /** Information relating to caching this cert on disk and looking it up. */
  2040. signed_descriptor_t cache_info;
  2041. /** This authority's long-term authority identity key. */
  2042. crypto_pk_t *identity_key;
  2043. /** This authority's medium-term signing key. */
  2044. crypto_pk_t *signing_key;
  2045. /** The digest of <b>signing_key</b> */
  2046. char signing_key_digest[DIGEST_LEN];
  2047. /** The listed expiration time of this certificate. */
  2048. time_t expires;
  2049. /** This authority's IPv4 address, in host order. */
  2050. uint32_t addr;
  2051. /** This authority's directory port. */
  2052. uint16_t dir_port;
  2053. /** True iff this certificate was cross-certified by signing the identity
  2054. * key with the signing key. */
  2055. uint8_t is_cross_certified;
  2056. } authority_cert_t;
  2057. /** Bitfield enum type listing types of information that directory authorities
  2058. * can be authoritative about, and that directory caches may or may not cache.
  2059. *
  2060. * Note that the granularity here is based on authority granularity and on
  2061. * cache capabilities. Thus, one particular bit may correspond in practice to
  2062. * a few types of directory info, so long as every authority that pronounces
  2063. * officially about one of the types prounounces officially about all of them,
  2064. * and so long as every cache that caches one of them caches all of them.
  2065. */
  2066. typedef enum {
  2067. NO_DIRINFO = 0,
  2068. /** Serves/signs v1 directory information: Big lists of routers, and short
  2069. * routerstatus documents. */
  2070. V1_DIRINFO = 1 << 0,
  2071. /** Serves/signs v2 directory information: i.e. v2 networkstatus documents */
  2072. V2_DIRINFO = 1 << 1,
  2073. /** Serves/signs v3 directory information: votes, consensuses, certs */
  2074. V3_DIRINFO = 1 << 2,
  2075. /** Serves hidden service descriptors. */
  2076. HIDSERV_DIRINFO = 1 << 3,
  2077. /** Serves bridge descriptors. */
  2078. BRIDGE_DIRINFO = 1 << 4,
  2079. /** Serves extrainfo documents. */
  2080. EXTRAINFO_DIRINFO=1 << 5,
  2081. /** Serves microdescriptors. */
  2082. MICRODESC_DIRINFO=1 << 6,
  2083. } dirinfo_type_t;
  2084. #define CRYPT_PATH_MAGIC 0x70127012u
  2085. /** Holds accounting information for a single step in the layered encryption
  2086. * performed by a circuit. Used only at the client edge of a circuit. */
  2087. typedef struct crypt_path_t {
  2088. uint32_t magic;
  2089. /* crypto environments */
  2090. /** Encryption key and counter for cells heading towards the OR at this
  2091. * step. */
  2092. crypto_cipher_t *f_crypto;
  2093. /** Encryption key and counter for cells heading back from the OR at this
  2094. * step. */
  2095. crypto_cipher_t *b_crypto;
  2096. /** Digest state for cells heading towards the OR at this step. */
  2097. crypto_digest_t *f_digest; /* for integrity checking */
  2098. /** Digest state for cells heading away from the OR at this step. */
  2099. crypto_digest_t *b_digest;
  2100. /** Current state of Diffie-Hellman key negotiation with the OR at this
  2101. * step. */
  2102. crypto_dh_t *dh_handshake_state;
  2103. /** Current state of 'fast' (non-PK) key negotiation with the OR at this
  2104. * step. Used to save CPU when TLS is already providing all the
  2105. * authentication, secrecy, and integrity we need, and we're already
  2106. * distinguishable from an OR.
  2107. */
  2108. uint8_t fast_handshake_state[DIGEST_LEN];
  2109. /** Negotiated key material shared with the OR at this step. */
  2110. char handshake_digest[DIGEST_LEN];/* KH in tor-spec.txt */
  2111. /** Information to extend to the OR at this step. */
  2112. extend_info_t *extend_info;
  2113. /** Is the circuit built to this step? Must be one of:
  2114. * - CPATH_STATE_CLOSED (The circuit has not been extended to this step)
  2115. * - CPATH_STATE_AWAITING_KEYS (We have sent an EXTEND/CREATE to this step
  2116. * and not received an EXTENDED/CREATED)
  2117. * - CPATH_STATE_OPEN (The circuit has been extended to this step) */
  2118. uint8_t state;
  2119. #define CPATH_STATE_CLOSED 0
  2120. #define CPATH_STATE_AWAITING_KEYS 1
  2121. #define CPATH_STATE_OPEN 2
  2122. struct crypt_path_t *next; /**< Link to next crypt_path_t in the circuit.
  2123. * (The list is circular, so the last node
  2124. * links to the first.) */
  2125. struct crypt_path_t *prev; /**< Link to previous crypt_path_t in the
  2126. * circuit. */
  2127. int package_window; /**< How many cells are we allowed to originate ending
  2128. * at this step? */
  2129. int deliver_window; /**< How many cells are we willing to deliver originating
  2130. * at this step? */
  2131. } crypt_path_t;
  2132. /** A reference-counted pointer to a crypt_path_t, used only to share
  2133. * the final rendezvous cpath to be used on a service-side rendezvous
  2134. * circuit among multiple circuits built in parallel to the same
  2135. * destination rendezvous point. */
  2136. typedef struct {
  2137. /** The reference count. */
  2138. unsigned int refcount;
  2139. /** The pointer. Set to NULL when the crypt_path_t is put into use
  2140. * on an opened rendezvous circuit. */
  2141. crypt_path_t *cpath;
  2142. } crypt_path_reference_t;
  2143. #define CPATH_KEY_MATERIAL_LEN (20*2+16*2)
  2144. #define DH_KEY_LEN DH_BYTES
  2145. #define ONIONSKIN_CHALLENGE_LEN (PKCS1_OAEP_PADDING_OVERHEAD+\
  2146. CIPHER_KEY_LEN+\
  2147. DH_KEY_LEN)
  2148. #define ONIONSKIN_REPLY_LEN (DH_KEY_LEN+DIGEST_LEN)
  2149. /** Information used to build a circuit. */
  2150. typedef struct {
  2151. /** Intended length of the final circuit. */
  2152. int desired_path_len;
  2153. /** How to extend to the planned exit node. */
  2154. extend_info_t *chosen_exit;
  2155. /** Whether every node in the circ must have adequate uptime. */
  2156. unsigned int need_uptime : 1;
  2157. /** Whether every node in the circ must have adequate capacity. */
  2158. unsigned int need_capacity : 1;
  2159. /** Whether the last hop was picked with exiting in mind. */
  2160. unsigned int is_internal : 1;
  2161. /** Did we pick this as a one-hop tunnel (not safe for other streams)?
  2162. * These are for encrypted dir conns that exit to this router, not
  2163. * for arbitrary exits from the circuit. */
  2164. unsigned int onehop_tunnel : 1;
  2165. /** The crypt_path_t to append after rendezvous: used for rendezvous. */
  2166. crypt_path_t *pending_final_cpath;
  2167. /** A ref-counted reference to the crypt_path_t to append after
  2168. * rendezvous; used on the service side. */
  2169. crypt_path_reference_t *service_pending_final_cpath_ref;
  2170. /** How many times has building a circuit for this task failed? */
  2171. int failure_count;
  2172. /** At what time should we give up on this task? */
  2173. time_t expiry_time;
  2174. } cpath_build_state_t;
  2175. /**
  2176. * The cell_ewma_t structure keeps track of how many cells a circuit has
  2177. * transferred recently. It keeps an EWMA (exponentially weighted moving
  2178. * average) of the number of cells flushed from the circuit queue onto a
  2179. * connection in connection_or_flush_from_first_active_circuit().
  2180. */
  2181. typedef struct {
  2182. /** The last 'tick' at which we recalibrated cell_count.
  2183. *
  2184. * A cell sent at exactly the start of this tick has weight 1.0. Cells sent
  2185. * since the start of this tick have weight greater than 1.0; ones sent
  2186. * earlier have less weight. */
  2187. unsigned last_adjusted_tick;
  2188. /** The EWMA of the cell count. */
  2189. double cell_count;
  2190. /** True iff this is the cell count for a circuit's previous
  2191. * connection. */
  2192. unsigned int is_for_p_conn : 1;
  2193. /** The position of the circuit within the OR connection's priority
  2194. * queue. */
  2195. int heap_index;
  2196. } cell_ewma_t;
  2197. #define ORIGIN_CIRCUIT_MAGIC 0x35315243u
  2198. #define OR_CIRCUIT_MAGIC 0x98ABC04Fu
  2199. /**
  2200. * A circuit is a path over the onion routing
  2201. * network. Applications can connect to one end of the circuit, and can
  2202. * create exit connections at the other end of the circuit. AP and exit
  2203. * connections have only one circuit associated with them (and thus these
  2204. * connection types are closed when the circuit is closed), whereas
  2205. * OR connections multiplex many circuits at once, and stay standing even
  2206. * when there are no circuits running over them.
  2207. *
  2208. * A circuit_t structure can fill one of two roles. First, a or_circuit_t
  2209. * links two connections together: either an edge connection and an OR
  2210. * connection, or two OR connections. (When joined to an OR connection, a
  2211. * circuit_t affects only cells sent to a particular circID on that
  2212. * connection. When joined to an edge connection, a circuit_t affects all
  2213. * data.)
  2214. * Second, an origin_circuit_t holds the cipher keys and state for sending data
  2215. * along a given circuit. At the OP, it has a sequence of ciphers, each
  2216. * of which is shared with a single OR along the circuit. Separate
  2217. * ciphers are used for data going "forward" (away from the OP) and
  2218. * "backward" (towards the OP). At the OR, a circuit has only two stream
  2219. * ciphers: one for data going forward, and one for data going backward.
  2220. */
  2221. typedef struct circuit_t {
  2222. uint32_t magic; /**< For memory and type debugging: must equal
  2223. * ORIGIN_CIRCUIT_MAGIC or OR_CIRCUIT_MAGIC. */
  2224. /** Queue of cells waiting to be transmitted on n_conn. */
  2225. cell_queue_t n_conn_cells;
  2226. /** The OR connection that is next in this circuit. */
  2227. or_connection_t *n_conn;
  2228. /** The circuit_id used in the next (forward) hop of this circuit. */
  2229. circid_t n_circ_id;
  2230. /** The hop to which we want to extend this circuit. Should be NULL if
  2231. * the circuit has attached to a connection. */
  2232. extend_info_t *n_hop;
  2233. /** True iff we are waiting for n_conn_cells to become less full before
  2234. * allowing p_streams to add any more cells. (Origin circuit only.) */
  2235. unsigned int streams_blocked_on_n_conn : 1;
  2236. /** True iff we are waiting for p_conn_cells to become less full before
  2237. * allowing n_streams to add any more cells. (OR circuit only.) */
  2238. unsigned int streams_blocked_on_p_conn : 1;
  2239. uint8_t state; /**< Current status of this circuit. */
  2240. uint8_t purpose; /**< Why are we creating this circuit? */
  2241. /** How many relay data cells can we package (read from edge streams)
  2242. * on this circuit before we receive a circuit-level sendme cell asking
  2243. * for more? */
  2244. int package_window;
  2245. /** How many relay data cells will we deliver (write to edge streams)
  2246. * on this circuit? When deliver_window gets low, we send some
  2247. * circuit-level sendme cells to indicate that we're willing to accept
  2248. * more. */
  2249. int deliver_window;
  2250. /** For storage while n_conn is pending
  2251. * (state CIRCUIT_STATE_OR_WAIT). When defined, it is always
  2252. * length ONIONSKIN_CHALLENGE_LEN. */
  2253. char *n_conn_onionskin;
  2254. /** When was this circuit created? We keep this timestamp with a higher
  2255. * resolution than most so that the circuit-build-time tracking code can
  2256. * get millisecond resolution. */
  2257. struct timeval timestamp_created;
  2258. /** When the circuit was first used, or 0 if the circuit is clean.
  2259. *
  2260. * XXXX023 Note that some code will artifically adjust this value backward
  2261. * in time in order to indicate that a circuit shouldn't be used for new
  2262. * streams, but that it can stay alive as long as it has streams on it.
  2263. * That's a kludge we should fix.
  2264. *
  2265. * XXX023 The CBT code uses this field to record when HS-related
  2266. * circuits entered certain states. This usage probably won't
  2267. * interfere with this field's primary purpose, but we should
  2268. * document it more thoroughly to make sure of that.
  2269. */
  2270. time_t timestamp_dirty;
  2271. uint16_t marked_for_close; /**< Should we close this circuit at the end of
  2272. * the main loop? (If true, holds the line number
  2273. * where this circuit was marked.) */
  2274. const char *marked_for_close_file; /**< For debugging: in which file was this
  2275. * circuit marked for close? */
  2276. /** Next circuit in the doubly-linked ring of circuits waiting to add
  2277. * cells to n_conn. NULL if we have no cells pending, or if we're not
  2278. * linked to an OR connection. */
  2279. struct circuit_t *next_active_on_n_conn;
  2280. /** Previous circuit in the doubly-linked ring of circuits waiting to add
  2281. * cells to n_conn. NULL if we have no cells pending, or if we're not
  2282. * linked to an OR connection. */
  2283. struct circuit_t *prev_active_on_n_conn;
  2284. struct circuit_t *next; /**< Next circuit in linked list of all circuits. */
  2285. /** Unique ID for measuring tunneled network status requests. */
  2286. uint64_t dirreq_id;
  2287. /** The EWMA count for the number of cells flushed from the
  2288. * n_conn_cells queue. Used to determine which circuit to flush from next.
  2289. */
  2290. cell_ewma_t n_cell_ewma;
  2291. } circuit_t;
  2292. /** Largest number of relay_early cells that we can send on a given
  2293. * circuit. */
  2294. #define MAX_RELAY_EARLY_CELLS_PER_CIRCUIT 8
  2295. /** An origin_circuit_t holds data necessary to build and use a circuit.
  2296. */
  2297. typedef struct origin_circuit_t {
  2298. circuit_t _base;
  2299. /** Linked list of AP streams (or EXIT streams if hidden service)
  2300. * associated with this circuit. */
  2301. edge_connection_t *p_streams;
  2302. /** Build state for this circuit. It includes the intended path
  2303. * length, the chosen exit router, rendezvous information, etc.
  2304. */
  2305. cpath_build_state_t *build_state;
  2306. /** The doubly-linked list of crypt_path_t entries, one per hop,
  2307. * for this circuit. This includes ciphers for each hop,
  2308. * integrity-checking digests for each hop, and package/delivery
  2309. * windows for each hop.
  2310. */
  2311. crypt_path_t *cpath;
  2312. /** Holds all rendezvous data on either client or service side. */
  2313. rend_data_t *rend_data;
  2314. /** How many more relay_early cells can we send on this circuit, according
  2315. * to the specification? */
  2316. unsigned int remaining_relay_early_cells : 4;
  2317. /** Set if this circuit is insanely old and we already informed the user */
  2318. unsigned int is_ancient : 1;
  2319. /** Set if this circuit has already been opened. Used to detect
  2320. * cannibalized circuits. */
  2321. unsigned int has_opened : 1;
  2322. /** Set iff this is a hidden-service circuit which has timed out
  2323. * according to our current circuit-build timeout, but which has
  2324. * been kept around because it might still succeed in connecting to
  2325. * its destination, and which is not a fully-connected rendezvous
  2326. * circuit.
  2327. *
  2328. * (We clear this flag for client-side rendezvous circuits when they
  2329. * are 'joined' to the other side's rendezvous circuit, so that
  2330. * connection_ap_handshake_attach_circuit can put client streams on
  2331. * the circuit. We also clear this flag for service-side rendezvous
  2332. * circuits when they are 'joined' to a client's rend circ, but only
  2333. * for symmetry with the client case. Client-side introduction
  2334. * circuits are closed when we get a joined rend circ, and
  2335. * service-side introduction circuits never have this flag set.) */
  2336. unsigned int hs_circ_has_timed_out : 1;
  2337. /** Set iff this is a service-side rendezvous circuit for which a
  2338. * new connection attempt has been launched. We consider launching
  2339. * a new service-side rend circ to a client when the previous one
  2340. * fails; now that we don't necessarily close a service-side rend
  2341. * circ when we launch a new one to the same client, this flag keeps
  2342. * us from launching two retries for the same failed rend circ. */
  2343. unsigned int hs_service_side_rend_circ_has_been_relaunched : 1;
  2344. /** What commands were sent over this circuit that decremented the
  2345. * RELAY_EARLY counter? This is for debugging task 878. */
  2346. uint8_t relay_early_commands[MAX_RELAY_EARLY_CELLS_PER_CIRCUIT];
  2347. /** How many RELAY_EARLY cells have been sent over this circuit? This is
  2348. * for debugging task 878, too. */
  2349. int relay_early_cells_sent;
  2350. /** The next stream_id that will be tried when we're attempting to
  2351. * construct a new AP stream originating at this circuit. */
  2352. streamid_t next_stream_id;
  2353. /* The intro key replaces the hidden service's public key if purpose is
  2354. * S_ESTABLISH_INTRO or S_INTRO, provided that no unversioned rendezvous
  2355. * descriptor is used. */
  2356. crypto_pk_t *intro_key;
  2357. /** Quasi-global identifier for this circuit; used for control.c */
  2358. /* XXXX NM This can get re-used after 2**32 circuits. */
  2359. uint32_t global_identifier;
  2360. /** True if we have associated one stream to this circuit, thereby setting
  2361. * the isolation paramaters for this circuit. Note that this doesn't
  2362. * necessarily mean that we've <em>attached</em> any streams to the circuit:
  2363. * we may only have marked up this circuit during the launch process.
  2364. */
  2365. unsigned int isolation_values_set : 1;
  2366. /** True iff any stream has <em>ever</em> been attached to this circuit.
  2367. *
  2368. * In a better world we could use timestamp_dirty for this, but
  2369. * timestamp_dirty is far too overloaded at the moment.
  2370. */
  2371. unsigned int isolation_any_streams_attached : 1;
  2372. /** A bitfield of ISO_* flags for every isolation field such that this
  2373. * circuit has had streams with more than one value for that field
  2374. * attached to it. */
  2375. uint8_t isolation_flags_mixed;
  2376. /** @name Isolation parameters
  2377. *
  2378. * If any streams have been associated with this circ (isolation_values_set
  2379. * == 1), and all streams associated with the circuit have had the same
  2380. * value for some field ((isolation_flags_mixed & ISO_FOO) == 0), then these
  2381. * elements hold the value for that field.
  2382. *
  2383. * Note again that "associated" is not the same as "attached": we
  2384. * preliminarily associate streams with a circuit while the circuit is being
  2385. * launched, so that we can tell whether we need to launch more circuits.
  2386. *
  2387. * @{
  2388. */
  2389. uint8_t client_proto_type;
  2390. uint8_t client_proto_socksver;
  2391. uint16_t dest_port;
  2392. tor_addr_t client_addr;
  2393. char *dest_address;
  2394. int session_group;
  2395. unsigned nym_epoch;
  2396. size_t socks_username_len;
  2397. uint8_t socks_password_len;
  2398. /* Note that the next two values are NOT NUL-terminated; see
  2399. socks_username_len and socks_password_len for their lengths. */
  2400. char *socks_username;
  2401. char *socks_password;
  2402. /** Global identifier for the first stream attached here; used by
  2403. * ISO_STREAM. */
  2404. uint64_t associated_isolated_stream_global_id;
  2405. /**@}*/
  2406. } origin_circuit_t;
  2407. /** An or_circuit_t holds information needed to implement a circuit at an
  2408. * OR. */
  2409. typedef struct or_circuit_t {
  2410. circuit_t _base;
  2411. /** Next circuit in the doubly-linked ring of circuits waiting to add
  2412. * cells to p_conn. NULL if we have no cells pending, or if we're not
  2413. * linked to an OR connection. */
  2414. struct circuit_t *next_active_on_p_conn;
  2415. /** Previous circuit in the doubly-linked ring of circuits waiting to add
  2416. * cells to p_conn. NULL if we have no cells pending, or if we're not
  2417. * linked to an OR connection. */
  2418. struct circuit_t *prev_active_on_p_conn;
  2419. /** The circuit_id used in the previous (backward) hop of this circuit. */
  2420. circid_t p_circ_id;
  2421. /** Queue of cells waiting to be transmitted on p_conn. */
  2422. cell_queue_t p_conn_cells;
  2423. /** The OR connection that is previous in this circuit. */
  2424. or_connection_t *p_conn;
  2425. /** Linked list of Exit streams associated with this circuit. */
  2426. edge_connection_t *n_streams;
  2427. /** Linked list of Exit streams associated with this circuit that are
  2428. * still being resolved. */
  2429. edge_connection_t *resolving_streams;
  2430. /** The cipher used by intermediate hops for cells heading toward the
  2431. * OP. */
  2432. crypto_cipher_t *p_crypto;
  2433. /** The cipher used by intermediate hops for cells heading away from
  2434. * the OP. */
  2435. crypto_cipher_t *n_crypto;
  2436. /** The integrity-checking digest used by intermediate hops, for
  2437. * cells packaged here and heading towards the OP.
  2438. */
  2439. crypto_digest_t *p_digest;
  2440. /** The integrity-checking digest used by intermediate hops, for
  2441. * cells packaged at the OP and arriving here.
  2442. */
  2443. crypto_digest_t *n_digest;
  2444. /** Points to spliced circuit if purpose is REND_ESTABLISHED, and circuit
  2445. * is not marked for close. */
  2446. struct or_circuit_t *rend_splice;
  2447. #if REND_COOKIE_LEN >= DIGEST_LEN
  2448. #define REND_TOKEN_LEN REND_COOKIE_LEN
  2449. #else
  2450. #define REND_TOKEN_LEN DIGEST_LEN
  2451. #endif
  2452. /** A hash of location-hidden service's PK if purpose is INTRO_POINT, or a
  2453. * rendezvous cookie if purpose is REND_POINT_WAITING. Filled with zeroes
  2454. * otherwise.
  2455. * ???? move to a subtype or adjunct structure? Wastes 20 bytes. -NM
  2456. */
  2457. char rend_token[REND_TOKEN_LEN];
  2458. /* ???? move to a subtype or adjunct structure? Wastes 20 bytes -NM */
  2459. char handshake_digest[DIGEST_LEN]; /**< Stores KH for the handshake. */
  2460. /** How many more relay_early cells can we send on this circuit, according
  2461. * to the specification? */
  2462. unsigned int remaining_relay_early_cells : 4;
  2463. /** True iff this circuit was made with a CREATE_FAST cell. */
  2464. unsigned int is_first_hop : 1;
  2465. /** Number of cells that were removed from circuit queue; reset every
  2466. * time when writing buffer stats to disk. */
  2467. uint32_t processed_cells;
  2468. /** Total time in milliseconds that cells spent in both app-ward and
  2469. * exit-ward queues of this circuit; reset every time when writing
  2470. * buffer stats to disk. */
  2471. uint64_t total_cell_waiting_time;
  2472. /** The EWMA count for the number of cells flushed from the
  2473. * p_conn_cells queue. */
  2474. cell_ewma_t p_cell_ewma;
  2475. } or_circuit_t;
  2476. /** Convert a circuit subtype to a circuit_t. */
  2477. #define TO_CIRCUIT(x) (&((x)->_base))
  2478. /** Convert a circuit_t* to a pointer to the enclosing or_circuit_t. Assert
  2479. * if the cast is impossible. */
  2480. static or_circuit_t *TO_OR_CIRCUIT(circuit_t *);
  2481. /** Convert a circuit_t* to a pointer to the enclosing origin_circuit_t.
  2482. * Assert if the cast is impossible. */
  2483. static origin_circuit_t *TO_ORIGIN_CIRCUIT(circuit_t *);
  2484. static INLINE or_circuit_t *TO_OR_CIRCUIT(circuit_t *x)
  2485. {
  2486. tor_assert(x->magic == OR_CIRCUIT_MAGIC);
  2487. return DOWNCAST(or_circuit_t, x);
  2488. }
  2489. static INLINE origin_circuit_t *TO_ORIGIN_CIRCUIT(circuit_t *x)
  2490. {
  2491. tor_assert(x->magic == ORIGIN_CIRCUIT_MAGIC);
  2492. return DOWNCAST(origin_circuit_t, x);
  2493. }
  2494. /** Bitfield type: things that we're willing to use invalid routers for. */
  2495. typedef enum invalid_router_usage_t {
  2496. ALLOW_INVALID_ENTRY =1,
  2497. ALLOW_INVALID_EXIT =2,
  2498. ALLOW_INVALID_MIDDLE =4,
  2499. ALLOW_INVALID_RENDEZVOUS =8,
  2500. ALLOW_INVALID_INTRODUCTION=16,
  2501. } invalid_router_usage_t;
  2502. /* limits for TCP send and recv buffer size used for constrained sockets */
  2503. #define MIN_CONSTRAINED_TCP_BUFFER 2048
  2504. #define MAX_CONSTRAINED_TCP_BUFFER 262144 /* 256k */
  2505. /** @name Isolation flags
  2506. Ways to isolate client streams
  2507. @{
  2508. */
  2509. /** Isolate based on destination port */
  2510. #define ISO_DESTPORT (1u<<0)
  2511. /** Isolate based on destination address */
  2512. #define ISO_DESTADDR (1u<<1)
  2513. /** Isolate based on SOCKS authentication */
  2514. #define ISO_SOCKSAUTH (1u<<2)
  2515. /** Isolate based on client protocol choice */
  2516. #define ISO_CLIENTPROTO (1u<<3)
  2517. /** Isolate based on client address */
  2518. #define ISO_CLIENTADDR (1u<<4)
  2519. /** Isolate based on session group (always on). */
  2520. #define ISO_SESSIONGRP (1u<<5)
  2521. /** Isolate based on newnym epoch (always on). */
  2522. #define ISO_NYM_EPOCH (1u<<6)
  2523. /** Isolate all streams (Internal only). */
  2524. #define ISO_STREAM (1u<<7)
  2525. /**@}*/
  2526. /** Default isolation level for ports. */
  2527. #define ISO_DEFAULT (ISO_CLIENTADDR|ISO_SOCKSAUTH|ISO_SESSIONGRP|ISO_NYM_EPOCH)
  2528. /** Indicates that we haven't yet set a session group on a port_cfg_t. */
  2529. #define SESSION_GROUP_UNSET -1
  2530. /** Session group reserved for directory connections */
  2531. #define SESSION_GROUP_DIRCONN -2
  2532. /** Session group reserved for resolve requests launched by a controller */
  2533. #define SESSION_GROUP_CONTROL_RESOLVE -3
  2534. /** First automatically allocated session group number */
  2535. #define SESSION_GROUP_FIRST_AUTO -4
  2536. /** Configuration for a single port that we're listening on. */
  2537. typedef struct port_cfg_t {
  2538. tor_addr_t addr; /**< The actual IP to listen on, if !is_unix_addr. */
  2539. int port; /**< The configured port, or CFG_AUTO_PORT to tell Tor to pick its
  2540. * own port. */
  2541. uint8_t type; /**< One of CONN_TYPE_*_LISTENER */
  2542. unsigned is_unix_addr : 1; /**< True iff this is an AF_UNIX address. */
  2543. /* Client port types (socks, dns, trans, natd) only: */
  2544. uint8_t isolation_flags; /**< Zero or more isolation flags */
  2545. int session_group; /**< A session group, or -1 if this port is not in a
  2546. * session group. */
  2547. /* Server port types (or, dir) only: */
  2548. unsigned int no_advertise : 1;
  2549. unsigned int no_listen : 1;
  2550. unsigned int all_addrs : 1;
  2551. unsigned int ipv4_only : 1;
  2552. unsigned int ipv6_only : 1;
  2553. /* Unix sockets only: */
  2554. /** Path for an AF_UNIX address */
  2555. char unix_addr[FLEXIBLE_ARRAY_MEMBER];
  2556. } port_cfg_t;
  2557. /** Ordinary configuration line. */
  2558. #define CONFIG_LINE_NORMAL 0
  2559. /** Appends to previous configuration for the same option, even if we
  2560. * would ordinary replace it. */
  2561. #define CONFIG_LINE_APPEND 1
  2562. /* Removes all previous configuration for an option. */
  2563. #define CONFIG_LINE_CLEAR 2
  2564. /** A linked list of lines in a config file. */
  2565. typedef struct config_line_t {
  2566. char *key;
  2567. char *value;
  2568. struct config_line_t *next;
  2569. /** What special treatment (if any) does this line require? */
  2570. unsigned int command:2;
  2571. /** If true, subsequent assignments to this linelist should replace
  2572. * it, not extend it. Set only on the first item in a linelist in an
  2573. * or_options_t. */
  2574. unsigned int fragile:1;
  2575. } config_line_t;
  2576. typedef struct routerset_t routerset_t;
  2577. /** A magic value for the (Socks|OR|...)Port options below, telling Tor
  2578. * to pick its own port. */
  2579. #define CFG_AUTO_PORT 0xc4005e
  2580. /** Configuration options for a Tor process. */
  2581. typedef struct {
  2582. uint32_t _magic;
  2583. /** What should the tor process actually do? */
  2584. enum {
  2585. CMD_RUN_TOR=0, CMD_LIST_FINGERPRINT, CMD_HASH_PASSWORD,
  2586. CMD_VERIFY_CONFIG, CMD_RUN_UNITTESTS
  2587. } command;
  2588. const char *command_arg; /**< Argument for command-line option. */
  2589. config_line_t *Logs; /**< New-style list of configuration lines
  2590. * for logs */
  2591. int LogTimeGranularity; /**< Log resolution in milliseconds. */
  2592. int LogMessageDomains; /**< Boolean: Should we log the domain(s) in which
  2593. * each log message occurs? */
  2594. char *DebugLogFile; /**< Where to send verbose log messages. */
  2595. char *DataDirectory; /**< OR only: where to store long-term data. */
  2596. char *Nickname; /**< OR only: nickname of this onion router. */
  2597. char *Address; /**< OR only: configured address for this onion router. */
  2598. char *PidFile; /**< Where to store PID of Tor process. */
  2599. int DynamicDHGroups; /**< Dynamic generation of prime moduli for use in DH.*/
  2600. routerset_t *ExitNodes; /**< Structure containing nicknames, digests,
  2601. * country codes and IP address patterns of ORs to
  2602. * consider as exits. */
  2603. routerset_t *EntryNodes;/**< Structure containing nicknames, digests,
  2604. * country codes and IP address patterns of ORs to
  2605. * consider as entry points. */
  2606. int StrictNodes; /**< Boolean: When none of our EntryNodes or ExitNodes
  2607. * are up, or we need to access a node in ExcludeNodes,
  2608. * do we just fail instead? */
  2609. routerset_t *ExcludeNodes;/**< Structure containing nicknames, digests,
  2610. * country codes and IP address patterns of ORs
  2611. * not to use in circuits. But see StrictNodes
  2612. * above. */
  2613. routerset_t *ExcludeExitNodes;/**< Structure containing nicknames, digests,
  2614. * country codes and IP address patterns of
  2615. * ORs not to consider as exits. */
  2616. /** Union of ExcludeNodes and ExcludeExitNodes */
  2617. routerset_t *_ExcludeExitNodesUnion;
  2618. int DisableAllSwap; /**< Boolean: Attempt to call mlockall() on our
  2619. * process for all current and future memory. */
  2620. /** List of "entry", "middle", "exit", "introduction", "rendezvous". */
  2621. smartlist_t *AllowInvalidNodes;
  2622. /** Bitmask; derived from AllowInvalidNodes. */
  2623. invalid_router_usage_t _AllowInvalid;
  2624. config_line_t *ExitPolicy; /**< Lists of exit policy components. */
  2625. int ExitPolicyRejectPrivate; /**< Should we not exit to local addresses? */
  2626. config_line_t *SocksPolicy; /**< Lists of socks policy components */
  2627. config_line_t *DirPolicy; /**< Lists of dir policy components */
  2628. /** Addresses to bind for listening for SOCKS connections. */
  2629. config_line_t *SocksListenAddress;
  2630. /** Addresses to bind for listening for transparent pf/netfilter
  2631. * connections. */
  2632. config_line_t *TransListenAddress;
  2633. /** Addresses to bind for listening for transparent natd connections */
  2634. config_line_t *NATDListenAddress;
  2635. /** Addresses to bind for listening for SOCKS connections. */
  2636. config_line_t *DNSListenAddress;
  2637. /** Addresses to bind for listening for OR connections. */
  2638. config_line_t *ORListenAddress;
  2639. /** Addresses to bind for listening for directory connections. */
  2640. config_line_t *DirListenAddress;
  2641. /** Addresses to bind for listening for control connections. */
  2642. config_line_t *ControlListenAddress;
  2643. /** Local address to bind outbound sockets */
  2644. char *OutboundBindAddress;
  2645. /** Directory server only: which versions of
  2646. * Tor should we tell users to run? */
  2647. config_line_t *RecommendedVersions;
  2648. config_line_t *RecommendedClientVersions;
  2649. config_line_t *RecommendedServerVersions;
  2650. /** Whether dirservers refuse router descriptors with private IPs. */
  2651. int DirAllowPrivateAddresses;
  2652. char *User; /**< Name of user to run Tor as. */
  2653. char *Group; /**< Name of group to run Tor as. */
  2654. config_line_t *ORPort; /**< Ports to listen on for OR connections. */
  2655. config_line_t *SocksPort; /**< Ports to listen on for SOCKS connections. */
  2656. /** Ports to listen on for transparent pf/netfilter connections. */
  2657. config_line_t *TransPort;
  2658. config_line_t *NATDPort; /**< Ports to listen on for transparent natd
  2659. * connections. */
  2660. config_line_t *ControlPort; /**< Port to listen on for control
  2661. * connections. */
  2662. config_line_t *ControlSocket; /**< List of Unix Domain Sockets to listen on
  2663. * for control connections. */
  2664. int ControlSocketsGroupWritable; /**< Boolean: Are control sockets g+rw? */
  2665. config_line_t *DirPort; /**< Port to listen on for directory connections. */
  2666. config_line_t *DNSPort; /**< Port to listen on for DNS requests. */
  2667. int AssumeReachable; /**< Whether to publish our descriptor regardless. */
  2668. int AuthoritativeDir; /**< Boolean: is this an authoritative directory? */
  2669. int V1AuthoritativeDir; /**< Boolean: is this an authoritative directory
  2670. * for version 1 directories? */
  2671. int V2AuthoritativeDir; /**< Boolean: is this an authoritative directory
  2672. * for version 2 directories? */
  2673. int V3AuthoritativeDir; /**< Boolean: is this an authoritative directory
  2674. * for version 3 directories? */
  2675. int HSAuthoritativeDir; /**< Boolean: does this an authoritative directory
  2676. * handle hidden service requests? */
  2677. int NamingAuthoritativeDir; /**< Boolean: is this an authoritative directory
  2678. * that's willing to bind names? */
  2679. int VersioningAuthoritativeDir; /**< Boolean: is this an authoritative
  2680. * directory that's willing to recommend
  2681. * versions? */
  2682. int BridgeAuthoritativeDir; /**< Boolean: is this an authoritative directory
  2683. * that aggregates bridge descriptors? */
  2684. /** If set on a bridge authority, it will answer requests on its dirport
  2685. * for bridge statuses -- but only if the requests use this password. */
  2686. char *BridgePassword;
  2687. /** If BridgePassword is set, this is a SHA256 digest of the basic http
  2688. * authenticator for it. Used so we can do a time-independent comparison. */
  2689. char *_BridgePassword_AuthDigest;
  2690. int UseBridges; /**< Boolean: should we start all circuits with a bridge? */
  2691. config_line_t *Bridges; /**< List of bootstrap bridge addresses. */
  2692. config_line_t *ClientTransportPlugin; /**< List of client
  2693. transport plugins. */
  2694. config_line_t *ServerTransportPlugin; /**< List of client
  2695. transport plugins. */
  2696. int BridgeRelay; /**< Boolean: are we acting as a bridge relay? We make
  2697. * this explicit so we can change how we behave in the
  2698. * future. */
  2699. /** Boolean: if we know the bridge's digest, should we get new
  2700. * descriptors from the bridge authorities or from the bridge itself? */
  2701. int UpdateBridgesFromAuthority;
  2702. int AvoidDiskWrites; /**< Boolean: should we never cache things to disk?
  2703. * Not used yet. */
  2704. int ClientOnly; /**< Boolean: should we never evolve into a server role? */
  2705. /** To what authority types do we publish our descriptor? Choices are
  2706. * "v1", "v2", "v3", "bridge", or "". */
  2707. smartlist_t *PublishServerDescriptor;
  2708. /** A bitfield of authority types, derived from PublishServerDescriptor. */
  2709. dirinfo_type_t _PublishServerDescriptor;
  2710. /** Boolean: do we publish hidden service descriptors to the HS auths? */
  2711. int PublishHidServDescriptors;
  2712. int FetchServerDescriptors; /**< Do we fetch server descriptors as normal? */
  2713. int FetchHidServDescriptors; /**< and hidden service descriptors? */
  2714. int FetchV2Networkstatus; /**< Do we fetch v2 networkstatus documents when
  2715. * we don't need to? */
  2716. int HidServDirectoryV2; /**< Do we participate in the HS DHT? */
  2717. int VoteOnHidServDirectoriesV2; /**< As a directory authority, vote on
  2718. * assignment of the HSDir flag? */
  2719. int MinUptimeHidServDirectoryV2; /**< As directory authority, accept hidden
  2720. * service directories after what time? */
  2721. int FetchUselessDescriptors; /**< Do we fetch non-running descriptors too? */
  2722. int AllDirActionsPrivate; /**< Should every directory action be sent
  2723. * through a Tor circuit? */
  2724. /** Run in 'tor2web mode'? (I.e. only make client connections to hidden
  2725. * services, and use a single hop for all hidden-service-related
  2726. * circuits.) */
  2727. int Tor2webMode;
  2728. /** Close hidden service client circuits immediately when they reach
  2729. * the normal circuit-build timeout, even if they have already sent
  2730. * an INTRODUCE1 cell on its way to the service. */
  2731. int CloseHSClientCircuitsImmediatelyOnTimeout;
  2732. /** Close hidden-service-side rendezvous circuits immediately when
  2733. * they reach the normal circuit-build timeout. */
  2734. int CloseHSServiceRendCircuitsImmediatelyOnTimeout;
  2735. int ConnLimit; /**< Demanded minimum number of simultaneous connections. */
  2736. int _ConnLimit; /**< Maximum allowed number of simultaneous connections. */
  2737. int RunAsDaemon; /**< If true, run in the background. (Unix only) */
  2738. int FascistFirewall; /**< Whether to prefer ORs reachable on open ports. */
  2739. smartlist_t *FirewallPorts; /**< Which ports our firewall allows
  2740. * (strings). */
  2741. config_line_t *ReachableAddresses; /**< IP:ports our firewall allows. */
  2742. config_line_t *ReachableORAddresses; /**< IP:ports for OR conns. */
  2743. config_line_t *ReachableDirAddresses; /**< IP:ports for Dir conns. */
  2744. int ConstrainedSockets; /**< Shrink xmit and recv socket buffers. */
  2745. uint64_t ConstrainedSockSize; /**< Size of constrained buffers. */
  2746. /** Whether we should drop exit streams from Tors that we don't know are
  2747. * relays. One of "0" (never refuse), "1" (always refuse), or "-1" (do
  2748. * what the consensus says, defaulting to 'refuse' if the consensus says
  2749. * nothing). */
  2750. int RefuseUnknownExits;
  2751. /** Application ports that require all nodes in circ to have sufficient
  2752. * uptime. */
  2753. smartlist_t *LongLivedPorts;
  2754. /** Application ports that are likely to be unencrypted and
  2755. * unauthenticated; we reject requests for them to prevent the
  2756. * user from screwing up and leaking plaintext secrets to an
  2757. * observer somewhere on the Internet. */
  2758. smartlist_t *RejectPlaintextPorts;
  2759. /** Related to RejectPlaintextPorts above, except this config option
  2760. * controls whether we warn (in the log and via a controller status
  2761. * event) every time a risky connection is attempted. */
  2762. smartlist_t *WarnPlaintextPorts;
  2763. /** Should we try to reuse the same exit node for a given host */
  2764. smartlist_t *TrackHostExits;
  2765. int TrackHostExitsExpire; /**< Number of seconds until we expire an
  2766. * addressmap */
  2767. config_line_t *AddressMap; /**< List of address map directives. */
  2768. int AutomapHostsOnResolve; /**< If true, when we get a resolve request for a
  2769. * hostname ending with one of the suffixes in
  2770. * <b>AutomapHostsSuffixes</b>, map it to a
  2771. * virtual address. */
  2772. smartlist_t *AutomapHostsSuffixes; /**< List of suffixes for
  2773. * <b>AutomapHostsOnResolve</b>. */
  2774. int RendPostPeriod; /**< How often do we post each rendezvous service
  2775. * descriptor? Remember to publish them independently. */
  2776. int KeepalivePeriod; /**< How often do we send padding cells to keep
  2777. * connections alive? */
  2778. int SocksTimeout; /**< How long do we let a socks connection wait
  2779. * unattached before we fail it? */
  2780. int LearnCircuitBuildTimeout; /**< If non-zero, we attempt to learn a value
  2781. * for CircuitBuildTimeout based on timeout
  2782. * history */
  2783. int CircuitBuildTimeout; /**< Cull non-open circuits that were born at
  2784. * least this many seconds ago. Used until
  2785. * adaptive algorithm learns a new value. */
  2786. int CircuitIdleTimeout; /**< Cull open clean circuits that were born
  2787. * at least this many seconds ago. */
  2788. int CircuitStreamTimeout; /**< If non-zero, detach streams from circuits
  2789. * and try a new circuit if the stream has been
  2790. * waiting for this many seconds. If zero, use
  2791. * our default internal timeout schedule. */
  2792. int MaxOnionsPending; /**< How many circuit CREATE requests do we allow
  2793. * to wait simultaneously before we start dropping
  2794. * them? */
  2795. int NewCircuitPeriod; /**< How long do we use a circuit before building
  2796. * a new one? */
  2797. int MaxCircuitDirtiness; /**< Never use circs that were first used more than
  2798. this interval ago. */
  2799. uint64_t BandwidthRate; /**< How much bandwidth, on average, are we willing
  2800. * to use in a second? */
  2801. uint64_t BandwidthBurst; /**< How much bandwidth, at maximum, are we willing
  2802. * to use in a second? */
  2803. uint64_t MaxAdvertisedBandwidth; /**< How much bandwidth are we willing to
  2804. * tell people we have? */
  2805. uint64_t RelayBandwidthRate; /**< How much bandwidth, on average, are we
  2806. * willing to use for all relayed conns? */
  2807. uint64_t RelayBandwidthBurst; /**< How much bandwidth, at maximum, will we
  2808. * use in a second for all relayed conns? */
  2809. uint64_t PerConnBWRate; /**< Long-term bw on a single TLS conn, if set. */
  2810. uint64_t PerConnBWBurst; /**< Allowed burst on a single TLS conn, if set. */
  2811. int NumCPUs; /**< How many CPUs should we try to use? */
  2812. //int RunTesting; /**< If true, create testing circuits to measure how well the
  2813. // * other ORs are running. */
  2814. config_line_t *RendConfigLines; /**< List of configuration lines
  2815. * for rendezvous services. */
  2816. config_line_t *HidServAuth; /**< List of configuration lines for client-side
  2817. * authorizations for hidden services */
  2818. char *ContactInfo; /**< Contact info to be published in the directory. */
  2819. int HeartbeatPeriod; /**< Log heartbeat messages after this many seconds
  2820. * have passed. */
  2821. char *HTTPProxy; /**< hostname[:port] to use as http proxy, if any. */
  2822. tor_addr_t HTTPProxyAddr; /**< Parsed IPv4 addr for http proxy, if any. */
  2823. uint16_t HTTPProxyPort; /**< Parsed port for http proxy, if any. */
  2824. char *HTTPProxyAuthenticator; /**< username:password string, if any. */
  2825. char *HTTPSProxy; /**< hostname[:port] to use as https proxy, if any. */
  2826. tor_addr_t HTTPSProxyAddr; /**< Parsed addr for https proxy, if any. */
  2827. uint16_t HTTPSProxyPort; /**< Parsed port for https proxy, if any. */
  2828. char *HTTPSProxyAuthenticator; /**< username:password string, if any. */
  2829. char *Socks4Proxy; /**< hostname:port to use as a SOCKS4 proxy, if any. */
  2830. tor_addr_t Socks4ProxyAddr; /**< Derived from Socks4Proxy. */
  2831. uint16_t Socks4ProxyPort; /**< Derived from Socks4Proxy. */
  2832. char *Socks5Proxy; /**< hostname:port to use as a SOCKS5 proxy, if any. */
  2833. tor_addr_t Socks5ProxyAddr; /**< Derived from Sock5Proxy. */
  2834. uint16_t Socks5ProxyPort; /**< Derived from Socks5Proxy. */
  2835. char *Socks5ProxyUsername; /**< Username for SOCKS5 authentication, if any */
  2836. char *Socks5ProxyPassword; /**< Password for SOCKS5 authentication, if any */
  2837. /** List of configuration lines for replacement directory authorities.
  2838. * If you just want to replace one class of authority at a time,
  2839. * use the "Alternate*Authority" options below instead. */
  2840. config_line_t *DirServers;
  2841. /** If set, use these main (currently v3) directory authorities and
  2842. * not the default ones. */
  2843. config_line_t *AlternateDirAuthority;
  2844. /** If set, use these bridge authorities and not the default one. */
  2845. config_line_t *AlternateBridgeAuthority;
  2846. /** If set, use these HS authorities and not the default ones. */
  2847. config_line_t *AlternateHSAuthority;
  2848. char *MyFamily; /**< Declared family for this OR. */
  2849. config_line_t *NodeFamilies; /**< List of config lines for
  2850. * node families */
  2851. smartlist_t *NodeFamilySets; /**< List of parsed NodeFamilies values. */
  2852. config_line_t *AuthDirBadDir; /**< Address policy for descriptors to
  2853. * mark as bad dir mirrors. */
  2854. config_line_t *AuthDirBadExit; /**< Address policy for descriptors to
  2855. * mark as bad exits. */
  2856. config_line_t *AuthDirReject; /**< Address policy for descriptors to
  2857. * reject. */
  2858. config_line_t *AuthDirInvalid; /**< Address policy for descriptors to
  2859. * never mark as valid. */
  2860. /** @name AuthDir...CC
  2861. *
  2862. * Lists of country codes to mark as BadDir, BadExit, or Invalid, or to
  2863. * reject entirely.
  2864. *
  2865. * @{
  2866. */
  2867. smartlist_t *AuthDirBadDirCCs;
  2868. smartlist_t *AuthDirBadExitCCs;
  2869. smartlist_t *AuthDirInvalidCCs;
  2870. smartlist_t *AuthDirRejectCCs;
  2871. /**@}*/
  2872. int AuthDirListBadDirs; /**< True iff we should list bad dirs,
  2873. * and vote for all other dir mirrors as good. */
  2874. int AuthDirListBadExits; /**< True iff we should list bad exits,
  2875. * and vote for all other exits as good. */
  2876. int AuthDirRejectUnlisted; /**< Boolean: do we reject all routers that
  2877. * aren't named in our fingerprint file? */
  2878. int AuthDirMaxServersPerAddr; /**< Do not permit more than this
  2879. * number of servers per IP address. */
  2880. int AuthDirMaxServersPerAuthAddr; /**< Do not permit more than this
  2881. * number of servers per IP address shared
  2882. * with an authority. */
  2883. /** If non-zero, always vote the Fast flag for any relay advertising
  2884. * this amount of capacity or more. */
  2885. uint64_t AuthDirFastGuarantee;
  2886. /** If non-zero, this advertised capacity or more is always sufficient
  2887. * to satisfy the bandwidth requirement for the Guard flag. */
  2888. uint64_t AuthDirGuardBWGuarantee;
  2889. char *AccountingStart; /**< How long is the accounting interval, and when
  2890. * does it start? */
  2891. uint64_t AccountingMax; /**< How many bytes do we allow per accounting
  2892. * interval before hibernation? 0 for "never
  2893. * hibernate." */
  2894. /** Base64-encoded hash of accepted passwords for the control system. */
  2895. config_line_t *HashedControlPassword;
  2896. /** As HashedControlPassword, but not saved. */
  2897. config_line_t *HashedControlSessionPassword;
  2898. int CookieAuthentication; /**< Boolean: do we enable cookie-based auth for
  2899. * the control system? */
  2900. char *CookieAuthFile; /**< Location of a cookie authentication file. */
  2901. int CookieAuthFileGroupReadable; /**< Boolean: Is the CookieAuthFile g+r? */
  2902. int LeaveStreamsUnattached; /**< Boolean: Does Tor attach new streams to
  2903. * circuits itself (0), or does it expect a controller
  2904. * to cope? (1) */
  2905. int DisablePredictedCircuits; /**< Boolean: does Tor preemptively
  2906. * make circuits in the background (0),
  2907. * or not (1)? */
  2908. /** Process specifier for a controller that ‘owns’ this Tor
  2909. * instance. Tor will terminate if its owning controller does. */
  2910. char *OwningControllerProcess;
  2911. int ShutdownWaitLength; /**< When we get a SIGINT and we're a server, how
  2912. * long do we wait before exiting? */
  2913. char *SafeLogging; /**< Contains "relay", "1", "0" (meaning no scrubbing). */
  2914. /* Derived from SafeLogging */
  2915. enum {
  2916. SAFELOG_SCRUB_ALL, SAFELOG_SCRUB_RELAY, SAFELOG_SCRUB_NONE
  2917. } _SafeLogging;
  2918. int SafeSocks; /**< Boolean: should we outright refuse application
  2919. * connections that use socks4 or socks5-with-local-dns? */
  2920. #define LOG_PROTOCOL_WARN (get_options()->ProtocolWarnings ? \
  2921. LOG_WARN : LOG_INFO)
  2922. int ProtocolWarnings; /**< Boolean: when other parties screw up the Tor
  2923. * protocol, is it a warn or an info in our logs? */
  2924. int TestSocks; /**< Boolean: when we get a socks connection, do we loudly
  2925. * log whether it was DNS-leaking or not? */
  2926. int HardwareAccel; /**< Boolean: Should we enable OpenSSL hardware
  2927. * acceleration where available? */
  2928. /** Token Bucket Refill resolution in milliseconds. */
  2929. int TokenBucketRefillInterval;
  2930. char *AccelName; /**< Optional hardware acceleration engine name. */
  2931. char *AccelDir; /**< Optional hardware acceleration engine search dir. */
  2932. int UseEntryGuards; /**< Boolean: Do we try to enter from a smallish number
  2933. * of fixed nodes? */
  2934. int NumEntryGuards; /**< How many entry guards do we try to establish? */
  2935. int RephistTrackTime; /**< How many seconds do we keep rephist info? */
  2936. int FastFirstHopPK; /**< If Tor believes it is safe, should we save a third
  2937. * of our PK time by sending CREATE_FAST cells? */
  2938. /** Should we always fetch our dir info on the mirror schedule (which
  2939. * means directly from the authorities) no matter our other config? */
  2940. int FetchDirInfoEarly;
  2941. /** Should we fetch our dir info at the start of the consensus period? */
  2942. int FetchDirInfoExtraEarly;
  2943. char *VirtualAddrNetwork; /**< Address and mask to hand out for virtual
  2944. * MAPADDRESS requests. */
  2945. int ServerDNSSearchDomains; /**< Boolean: If set, we don't force exit
  2946. * addresses to be FQDNs, but rather search for them in
  2947. * the local domains. */
  2948. int ServerDNSDetectHijacking; /**< Boolean: If true, check for DNS failure
  2949. * hijacking. */
  2950. int ServerDNSRandomizeCase; /**< Boolean: Use the 0x20-hack to prevent
  2951. * DNS poisoning attacks. */
  2952. char *ServerDNSResolvConfFile; /**< If provided, we configure our internal
  2953. * resolver from the file here rather than from
  2954. * /etc/resolv.conf (Unix) or the registry (Windows). */
  2955. char *DirPortFrontPage; /**< This is a full path to a file with an html
  2956. disclaimer. This allows a server administrator to show
  2957. that they're running Tor and anyone visiting their server
  2958. will know this without any specialized knowledge. */
  2959. int DisableDebuggerAttachment; /**< Currently Linux only specific attempt to
  2960. disable ptrace; needs BSD testing. */
  2961. /** Boolean: if set, we start even if our resolv.conf file is missing
  2962. * or broken. */
  2963. int ServerDNSAllowBrokenConfig;
  2964. /** Boolean: if set, then even connections to private addresses will get
  2965. * rate-limited. */
  2966. int CountPrivateBandwidth;
  2967. smartlist_t *ServerDNSTestAddresses; /**< A list of addresses that definitely
  2968. * should be resolvable. Used for
  2969. * testing our DNS server. */
  2970. int EnforceDistinctSubnets; /**< If true, don't allow multiple routers in the
  2971. * same network zone in the same circuit. */
  2972. int TunnelDirConns; /**< If true, use BEGIN_DIR rather than BEGIN when
  2973. * possible. */
  2974. int PreferTunneledDirConns; /**< If true, avoid dirservers that don't
  2975. * support BEGIN_DIR, when possible. */
  2976. int PortForwarding; /**< If true, use NAT-PMP or UPnP to automatically
  2977. * forward the DirPort and ORPort on the NAT device */
  2978. char *PortForwardingHelper; /** < Filename or full path of the port
  2979. forwarding helper executable */
  2980. int AllowNonRFC953Hostnames; /**< If true, we allow connections to hostnames
  2981. * with weird characters. */
  2982. /** If true, we try resolving hostnames with weird characters. */
  2983. int ServerDNSAllowNonRFC953Hostnames;
  2984. /** If true, we try to download extra-info documents (and we serve them,
  2985. * if we are a cache). For authorities, this is always true. */
  2986. int DownloadExtraInfo;
  2987. /** If true, and we are acting as a relay, allow exit circuits even when
  2988. * we are the first hop of a circuit. */
  2989. int AllowSingleHopExits;
  2990. /** If true, don't allow relays with AllowSingleHopExits=1 to be used in
  2991. * circuits that we build. */
  2992. int ExcludeSingleHopRelays;
  2993. /** If true, and the controller tells us to use a one-hop circuit, and the
  2994. * exit allows it, we use it. */
  2995. int AllowSingleHopCircuits;
  2996. /** If true, we convert "www.google.com.foo.exit" addresses on the
  2997. * socks/trans/natd ports into "www.google.com" addresses that
  2998. * exit from the node "foo". Disabled by default since attacking
  2999. * websites and exit relays can use it to manipulate your path
  3000. * selection. */
  3001. int AllowDotExit;
  3002. /** If true, we will warn if a user gives us only an IP address
  3003. * instead of a hostname. */
  3004. int WarnUnsafeSocks;
  3005. /** If true, the user wants us to collect statistics on clients
  3006. * requesting network statuses from us as directory. */
  3007. int DirReqStatistics;
  3008. /** If true, the user wants us to collect statistics on port usage. */
  3009. int ExitPortStatistics;
  3010. /** If true, the user wants us to collect connection statistics. */
  3011. int ConnDirectionStatistics;
  3012. /** If true, the user wants us to collect cell statistics. */
  3013. int CellStatistics;
  3014. /** If true, the user wants us to collect statistics as entry node. */
  3015. int EntryStatistics;
  3016. /** If true, include statistics file contents in extra-info documents. */
  3017. int ExtraInfoStatistics;
  3018. /** If true, do not believe anybody who tells us that a domain resolves
  3019. * to an internal address, or that an internal address has a PTR mapping.
  3020. * Helps avoid some cross-site attacks. */
  3021. int ClientDNSRejectInternalAddresses;
  3022. /** If true, do not accept any requests to connect to internal addresses
  3023. * over randomly chosen exits. */
  3024. int ClientRejectInternalAddresses;
  3025. /** The length of time that we think a consensus should be fresh. */
  3026. int V3AuthVotingInterval;
  3027. /** The length of time we think it will take to distribute votes. */
  3028. int V3AuthVoteDelay;
  3029. /** The length of time we think it will take to distribute signatures. */
  3030. int V3AuthDistDelay;
  3031. /** The number of intervals we think a consensus should be valid. */
  3032. int V3AuthNIntervalsValid;
  3033. /** Should advertise and sign consensuses with a legacy key, for key
  3034. * migration purposes? */
  3035. int V3AuthUseLegacyKey;
  3036. /** Location of bandwidth measurement file */
  3037. char *V3BandwidthsFile;
  3038. /** Authority only: key=value pairs that we add to our networkstatus
  3039. * consensus vote on the 'params' line. */
  3040. char *ConsensusParams;
  3041. /** The length of time that we think an initial consensus should be fresh.
  3042. * Only altered on testing networks. */
  3043. int TestingV3AuthInitialVotingInterval;
  3044. /** The length of time we think it will take to distribute initial votes.
  3045. * Only altered on testing networks. */
  3046. int TestingV3AuthInitialVoteDelay;
  3047. /** The length of time we think it will take to distribute initial
  3048. * signatures. Only altered on testing networks.*/
  3049. int TestingV3AuthInitialDistDelay;
  3050. /** If an authority has been around for less than this amount of time, it
  3051. * does not believe its reachability information is accurate. Only
  3052. * altered on testing networks. */
  3053. int TestingAuthDirTimeToLearnReachability;
  3054. /** Clients don't download any descriptor this recent, since it will
  3055. * probably not have propagated to enough caches. Only altered on testing
  3056. * networks. */
  3057. int TestingEstimatedDescriptorPropagationTime;
  3058. /** If true, we take part in a testing network. Change the defaults of a
  3059. * couple of other configuration options and allow to change the values
  3060. * of certain configuration options. */
  3061. int TestingTorNetwork;
  3062. /** File to check for a consensus networkstatus, if we don't have one
  3063. * cached. */
  3064. char *FallbackNetworkstatusFile;
  3065. /** If true, and we have GeoIP data, and we're a bridge, keep a per-country
  3066. * count of how many client addresses have contacted us so that we can help
  3067. * the bridge authority guess which countries have blocked access to us. */
  3068. int BridgeRecordUsageByCountry;
  3069. /** Optionally, a file with GeoIP data. */
  3070. char *GeoIPFile;
  3071. /** If true, SIGHUP should reload the torrc. Sometimes controllers want
  3072. * to make this false. */
  3073. int ReloadTorrcOnSIGHUP;
  3074. /* The main parameter for picking circuits within a connection.
  3075. *
  3076. * If this value is positive, when picking a cell to relay on a connection,
  3077. * we always relay from the circuit whose weighted cell count is lowest.
  3078. * Cells are weighted exponentially such that if one cell is sent
  3079. * 'CircuitPriorityHalflife' seconds before another, it counts for half as
  3080. * much.
  3081. *
  3082. * If this value is zero, we're disabling the cell-EWMA algorithm.
  3083. *
  3084. * If this value is negative, we're using the default approach
  3085. * according to either Tor or a parameter set in the consensus.
  3086. */
  3087. double CircuitPriorityHalflife;
  3088. /** If true, do not enable IOCP on windows with bufferevents, even if
  3089. * we think we could. */
  3090. int DisableIOCP;
  3091. /** For testing only: will go away in 0.2.3.x. */
  3092. int _UseFilteringSSLBufferevents;
  3093. /** Set to true if the TestingTorNetwork configuration option is set.
  3094. * This is used so that options_validate() has a chance to realize that
  3095. * the defaults have changed. */
  3096. int _UsingTestNetworkDefaults;
  3097. /** If 1, we try to use microdescriptors to build circuits. If 0, we don't.
  3098. * If -1, Tor decides. */
  3099. int UseMicrodescriptors;
  3100. /** File where we should write the ControlPort. */
  3101. char *ControlPortWriteToFile;
  3102. /** Should that file be group-readable? */
  3103. int ControlPortFileGroupReadable;
  3104. #define MAX_MAX_CLIENT_CIRCUITS_PENDING 1024
  3105. /** Maximum number of non-open general-purpose origin circuits to allow at
  3106. * once. */
  3107. int MaxClientCircuitsPending;
  3108. /** If 1, we always send optimistic data when it's supported. If 0, we
  3109. * never use it. If -1, we do what the consensus says. */
  3110. int OptimisticData;
  3111. /** If 1, and we are using IOCP, we set the kernel socket SNDBUF and RCVBUF
  3112. * to 0 to try to save kernel memory and avoid the dread "Out of buffers"
  3113. * issue. */
  3114. int UserspaceIOCPBuffers;
  3115. /** If 1, we accept and launch no external network connections, except on
  3116. * control ports. */
  3117. int DisableNetwork;
  3118. } or_options_t;
  3119. /** Persistent state for an onion router, as saved to disk. */
  3120. typedef struct {
  3121. uint32_t _magic;
  3122. /** The time at which we next plan to write the state to the disk. Equal to
  3123. * TIME_MAX if there are no savable changes, 0 if there are changes that
  3124. * should be saved right away. */
  3125. time_t next_write;
  3126. /** When was the state last written to disk? */
  3127. time_t LastWritten;
  3128. /** Fields for accounting bandwidth use. */
  3129. time_t AccountingIntervalStart;
  3130. uint64_t AccountingBytesReadInInterval;
  3131. uint64_t AccountingBytesWrittenInInterval;
  3132. int AccountingSecondsActive;
  3133. int AccountingSecondsToReachSoftLimit;
  3134. time_t AccountingSoftLimitHitAt;
  3135. uint64_t AccountingBytesAtSoftLimit;
  3136. uint64_t AccountingExpectedUsage;
  3137. /** A list of Entry Guard-related configuration lines. */
  3138. config_line_t *EntryGuards;
  3139. config_line_t *TransportProxies;
  3140. /** These fields hold information on the history of bandwidth usage for
  3141. * servers. The "Ends" fields hold the time when we last updated the
  3142. * bandwidth usage. The "Interval" fields hold the granularity, in seconds,
  3143. * of the entries of Values. The "Values" lists hold decimal string
  3144. * representations of the number of bytes read or written in each
  3145. * interval. The "Maxima" list holds decimal strings describing the highest
  3146. * rate achieved during the interval.
  3147. */
  3148. time_t BWHistoryReadEnds;
  3149. int BWHistoryReadInterval;
  3150. smartlist_t *BWHistoryReadValues;
  3151. smartlist_t *BWHistoryReadMaxima;
  3152. time_t BWHistoryWriteEnds;
  3153. int BWHistoryWriteInterval;
  3154. smartlist_t *BWHistoryWriteValues;
  3155. smartlist_t *BWHistoryWriteMaxima;
  3156. time_t BWHistoryDirReadEnds;
  3157. int BWHistoryDirReadInterval;
  3158. smartlist_t *BWHistoryDirReadValues;
  3159. smartlist_t *BWHistoryDirReadMaxima;
  3160. time_t BWHistoryDirWriteEnds;
  3161. int BWHistoryDirWriteInterval;
  3162. smartlist_t *BWHistoryDirWriteValues;
  3163. smartlist_t *BWHistoryDirWriteMaxima;
  3164. /** Build time histogram */
  3165. config_line_t * BuildtimeHistogram;
  3166. unsigned int TotalBuildTimes;
  3167. unsigned int CircuitBuildAbandonedCount;
  3168. /** What version of Tor wrote this state file? */
  3169. char *TorVersion;
  3170. /** Holds any unrecognized values we found in the state file, in the order
  3171. * in which we found them. */
  3172. config_line_t *ExtraLines;
  3173. /** When did we last rotate our onion key? "0" for 'no idea'. */
  3174. time_t LastRotatedOnionKey;
  3175. } or_state_t;
  3176. /** Change the next_write time of <b>state</b> to <b>when</b>, unless the
  3177. * state is already scheduled to be written to disk earlier than <b>when</b>.
  3178. */
  3179. static INLINE void or_state_mark_dirty(or_state_t *state, time_t when)
  3180. {
  3181. if (state->next_write > when)
  3182. state->next_write = when;
  3183. }
  3184. #define MAX_SOCKS_REPLY_LEN 1024
  3185. #define MAX_SOCKS_ADDR_LEN 256
  3186. #define SOCKS_NO_AUTH 0x00
  3187. #define SOCKS_USER_PASS 0x02
  3188. /** Please open a TCP connection to this addr:port. */
  3189. #define SOCKS_COMMAND_CONNECT 0x01
  3190. /** Please turn this FQDN into an IP address, privately. */
  3191. #define SOCKS_COMMAND_RESOLVE 0xF0
  3192. /** Please turn this IP address into an FQDN, privately. */
  3193. #define SOCKS_COMMAND_RESOLVE_PTR 0xF1
  3194. #define SOCKS_COMMAND_IS_CONNECT(c) ((c)==SOCKS_COMMAND_CONNECT)
  3195. #define SOCKS_COMMAND_IS_RESOLVE(c) ((c)==SOCKS_COMMAND_RESOLVE || \
  3196. (c)==SOCKS_COMMAND_RESOLVE_PTR)
  3197. /** State of a SOCKS request from a user to an OP. Also used to encode other
  3198. * information for non-socks user request (such as those on TransPort and
  3199. * DNSPort) */
  3200. struct socks_request_t {
  3201. /** Which version of SOCKS did the client use? One of "0, 4, 5" -- where
  3202. * 0 means that no socks handshake ever took place, and this is just a
  3203. * stub connection (e.g. see connection_ap_make_link()). */
  3204. uint8_t socks_version;
  3205. /** If using socks5 authentication, which authentication type did we
  3206. * negotiate? currently we support 0 (no authentication) and 2
  3207. * (username/password). */
  3208. uint8_t auth_type;
  3209. /** What is this stream's goal? One of the SOCKS_COMMAND_* values */
  3210. uint8_t command;
  3211. /** Which kind of listener created this stream? */
  3212. uint8_t listener_type;
  3213. size_t replylen; /**< Length of <b>reply</b>. */
  3214. uint8_t reply[MAX_SOCKS_REPLY_LEN]; /**< Write an entry into this string if
  3215. * we want to specify our own socks reply,
  3216. * rather than using the default socks4 or
  3217. * socks5 socks reply. We use this for the
  3218. * two-stage socks5 handshake.
  3219. */
  3220. char address[MAX_SOCKS_ADDR_LEN]; /**< What address did the client ask to
  3221. connect to/resolve? */
  3222. uint16_t port; /**< What port did the client ask to connect to? */
  3223. unsigned int has_finished : 1; /**< Has the SOCKS handshake finished? Used to
  3224. * make sure we send back a socks reply for
  3225. * every connection. */
  3226. unsigned int got_auth : 1; /**< Have we received any authentication data? */
  3227. /** Number of bytes in username; 0 if username is NULL */
  3228. size_t usernamelen;
  3229. /** Number of bytes in password; 0 if password is NULL */
  3230. uint8_t passwordlen;
  3231. /** The negotiated username value if any (for socks5), or the entire
  3232. * authentication string (for socks4). This value is NOT nul-terminated;
  3233. * see usernamelen for its length. */
  3234. char *username;
  3235. /** The negotiated password value if any (for socks5). This value is NOT
  3236. * nul-terminated; see passwordlen for its length. */
  3237. char *password;
  3238. };
  3239. /********************************* circuitbuild.c **********************/
  3240. /** How many hops does a general-purpose circuit have by default? */
  3241. #define DEFAULT_ROUTE_LEN 3
  3242. /* Circuit Build Timeout "public" structures. */
  3243. /** Precision multiplier for the Bw weights */
  3244. #define BW_WEIGHT_SCALE 10000
  3245. #define BW_MIN_WEIGHT_SCALE 1
  3246. #define BW_MAX_WEIGHT_SCALE INT32_MAX
  3247. /** Total size of the circuit timeout history to accumulate.
  3248. * 1000 is approx 2.5 days worth of continual-use circuits. */
  3249. #define CBT_NCIRCUITS_TO_OBSERVE 1000
  3250. /** Width of the histogram bins in milliseconds */
  3251. #define CBT_BIN_WIDTH ((build_time_t)50)
  3252. /** Number of modes to use in the weighted-avg computation of Xm */
  3253. #define CBT_DEFAULT_NUM_XM_MODES 3
  3254. #define CBT_MIN_NUM_XM_MODES 1
  3255. #define CBT_MAX_NUM_XM_MODES 20
  3256. /** A build_time_t is milliseconds */
  3257. typedef uint32_t build_time_t;
  3258. /**
  3259. * CBT_BUILD_ABANDONED is our flag value to represent a force-closed
  3260. * circuit (Aka a 'right-censored' pareto value).
  3261. */
  3262. #define CBT_BUILD_ABANDONED ((build_time_t)(INT32_MAX-1))
  3263. #define CBT_BUILD_TIME_MAX ((build_time_t)(INT32_MAX))
  3264. /** Save state every 10 circuits */
  3265. #define CBT_SAVE_STATE_EVERY 10
  3266. /* Circuit build times consensus parameters */
  3267. /**
  3268. * How long to wait before actually closing circuits that take too long to
  3269. * build in terms of CDF quantile.
  3270. */
  3271. #define CBT_DEFAULT_CLOSE_QUANTILE 95
  3272. #define CBT_MIN_CLOSE_QUANTILE CBT_MIN_QUANTILE_CUTOFF
  3273. #define CBT_MAX_CLOSE_QUANTILE CBT_MAX_QUANTILE_CUTOFF
  3274. /**
  3275. * How many circuits count as recent when considering if the
  3276. * connection has gone gimpy or changed.
  3277. */
  3278. #define CBT_DEFAULT_RECENT_CIRCUITS 20
  3279. #define CBT_MIN_RECENT_CIRCUITS 3
  3280. #define CBT_MAX_RECENT_CIRCUITS 1000
  3281. /**
  3282. * Maximum count of timeouts that finish the first hop in the past
  3283. * RECENT_CIRCUITS before calculating a new timeout.
  3284. *
  3285. * This tells us whether to abandon timeout history and set
  3286. * the timeout back to whatever circuit_build_times_get_initial_timeout()
  3287. * gives us.
  3288. */
  3289. #define CBT_DEFAULT_MAX_RECENT_TIMEOUT_COUNT (CBT_DEFAULT_RECENT_CIRCUITS*9/10)
  3290. #define CBT_MIN_MAX_RECENT_TIMEOUT_COUNT 3
  3291. #define CBT_MAX_MAX_RECENT_TIMEOUT_COUNT 10000
  3292. /** Minimum circuits before estimating a timeout */
  3293. #define CBT_DEFAULT_MIN_CIRCUITS_TO_OBSERVE 100
  3294. #define CBT_MIN_MIN_CIRCUITS_TO_OBSERVE 1
  3295. #define CBT_MAX_MIN_CIRCUITS_TO_OBSERVE 10000
  3296. /** Cutoff percentile on the CDF for our timeout estimation. */
  3297. #define CBT_DEFAULT_QUANTILE_CUTOFF 80
  3298. #define CBT_MIN_QUANTILE_CUTOFF 10
  3299. #define CBT_MAX_QUANTILE_CUTOFF 99
  3300. double circuit_build_times_quantile_cutoff(void);
  3301. /** How often in seconds should we build a test circuit */
  3302. #define CBT_DEFAULT_TEST_FREQUENCY 60
  3303. #define CBT_MIN_TEST_FREQUENCY 1
  3304. #define CBT_MAX_TEST_FREQUENCY INT32_MAX
  3305. /** Lowest allowable value for CircuitBuildTimeout in milliseconds */
  3306. #define CBT_DEFAULT_TIMEOUT_MIN_VALUE (1500)
  3307. #define CBT_MIN_TIMEOUT_MIN_VALUE 500
  3308. #define CBT_MAX_TIMEOUT_MIN_VALUE INT32_MAX
  3309. /** Initial circuit build timeout in milliseconds */
  3310. #define CBT_DEFAULT_TIMEOUT_INITIAL_VALUE (60*1000)
  3311. #define CBT_MIN_TIMEOUT_INITIAL_VALUE CBT_MIN_TIMEOUT_MIN_VALUE
  3312. #define CBT_MAX_TIMEOUT_INITIAL_VALUE INT32_MAX
  3313. int32_t circuit_build_times_initial_timeout(void);
  3314. #if CBT_DEFAULT_MAX_RECENT_TIMEOUT_COUNT < CBT_MIN_MAX_RECENT_TIMEOUT_COUNT
  3315. #error "RECENT_CIRCUITS is set too low."
  3316. #endif
  3317. /** Information about the state of our local network connection */
  3318. typedef struct {
  3319. /** The timestamp we last completed a TLS handshake or received a cell */
  3320. time_t network_last_live;
  3321. /** If the network is not live, how many timeouts has this caused? */
  3322. int nonlive_timeouts;
  3323. /** Circular array of circuits that have made it to the first hop. Slot is
  3324. * 1 if circuit timed out, 0 if circuit succeeded */
  3325. int8_t *timeouts_after_firsthop;
  3326. /** Number of elements allocated for the above array */
  3327. int num_recent_circs;
  3328. /** Index into circular array. */
  3329. int after_firsthop_idx;
  3330. } network_liveness_t;
  3331. /** Structure for circuit build times history */
  3332. typedef struct {
  3333. /** The circular array of recorded build times in milliseconds */
  3334. build_time_t circuit_build_times[CBT_NCIRCUITS_TO_OBSERVE];
  3335. /** Current index in the circuit_build_times circular array */
  3336. int build_times_idx;
  3337. /** Total number of build times accumulated. Max CBT_NCIRCUITS_TO_OBSERVE */
  3338. int total_build_times;
  3339. /** Information about the state of our local network connection */
  3340. network_liveness_t liveness;
  3341. /** Last time we built a circuit. Used to decide to build new test circs */
  3342. time_t last_circ_at;
  3343. /** "Minimum" value of our pareto distribution (actually mode) */
  3344. build_time_t Xm;
  3345. /** alpha exponent for pareto dist. */
  3346. double alpha;
  3347. /** Have we computed a timeout? */
  3348. int have_computed_timeout;
  3349. /** The exact value for that timeout in milliseconds. Stored as a double
  3350. * to maintain precision from calculations to and from quantile value. */
  3351. double timeout_ms;
  3352. /** How long we wait before actually closing the circuit. */
  3353. double close_ms;
  3354. } circuit_build_times_t;
  3355. /********************************* config.c ***************************/
  3356. /** An error from options_trial_assign() or options_init_from_string(). */
  3357. typedef enum setopt_err_t {
  3358. SETOPT_OK = 0,
  3359. SETOPT_ERR_MISC = -1,
  3360. SETOPT_ERR_PARSE = -2,
  3361. SETOPT_ERR_TRANSITION = -3,
  3362. SETOPT_ERR_SETTING = -4,
  3363. } setopt_err_t;
  3364. /********************************* connection_edge.c *************************/
  3365. /** Enumerates possible origins of a client-side address mapping. */
  3366. typedef enum {
  3367. /** We're remapping this address because the controller told us to. */
  3368. ADDRMAPSRC_CONTROLLER,
  3369. /** We're remapping this address because of an AutomapHostsOnResolve
  3370. * configuration. */
  3371. ADDRMAPSRC_AUTOMAP,
  3372. /** We're remapping this address because our configuration (via torrc, the
  3373. * command line, or a SETCONF command) told us to. */
  3374. ADDRMAPSRC_TORRC,
  3375. /** We're remapping this address because we have TrackHostExit configured,
  3376. * and we want to remember to use the same exit next time. */
  3377. ADDRMAPSRC_TRACKEXIT,
  3378. /** We're remapping this address because we got a DNS resolution from a
  3379. * Tor server that told us what its value was. */
  3380. ADDRMAPSRC_DNS,
  3381. } addressmap_entry_source_t;
  3382. /********************************* control.c ***************************/
  3383. /** Used to indicate the type of a circuit event passed to the controller.
  3384. * The various types are defined in control-spec.txt */
  3385. typedef enum circuit_status_event_t {
  3386. CIRC_EVENT_LAUNCHED = 0,
  3387. CIRC_EVENT_BUILT = 1,
  3388. CIRC_EVENT_EXTENDED = 2,
  3389. CIRC_EVENT_FAILED = 3,
  3390. CIRC_EVENT_CLOSED = 4,
  3391. } circuit_status_event_t;
  3392. /** Used to indicate the type of a CIRC_MINOR event passed to the controller.
  3393. * The various types are defined in control-spec.txt . */
  3394. typedef enum circuit_status_minor_event_t {
  3395. CIRC_MINOR_EVENT_PURPOSE_CHANGED,
  3396. CIRC_MINOR_EVENT_CANNIBALIZED,
  3397. } circuit_status_minor_event_t;
  3398. /** Used to indicate the type of a stream event passed to the controller.
  3399. * The various types are defined in control-spec.txt */
  3400. typedef enum stream_status_event_t {
  3401. STREAM_EVENT_SENT_CONNECT = 0,
  3402. STREAM_EVENT_SENT_RESOLVE = 1,
  3403. STREAM_EVENT_SUCCEEDED = 2,
  3404. STREAM_EVENT_FAILED = 3,
  3405. STREAM_EVENT_CLOSED = 4,
  3406. STREAM_EVENT_NEW = 5,
  3407. STREAM_EVENT_NEW_RESOLVE = 6,
  3408. STREAM_EVENT_FAILED_RETRIABLE = 7,
  3409. STREAM_EVENT_REMAP = 8
  3410. } stream_status_event_t;
  3411. /** Used to indicate the type of an OR connection event passed to the
  3412. * controller. The various types are defined in control-spec.txt */
  3413. typedef enum or_conn_status_event_t {
  3414. OR_CONN_EVENT_LAUNCHED = 0,
  3415. OR_CONN_EVENT_CONNECTED = 1,
  3416. OR_CONN_EVENT_FAILED = 2,
  3417. OR_CONN_EVENT_CLOSED = 3,
  3418. OR_CONN_EVENT_NEW = 4,
  3419. } or_conn_status_event_t;
  3420. /** Used to indicate the type of a buildtime event */
  3421. typedef enum buildtimeout_set_event_t {
  3422. BUILDTIMEOUT_SET_EVENT_COMPUTED = 0,
  3423. BUILDTIMEOUT_SET_EVENT_RESET = 1,
  3424. BUILDTIMEOUT_SET_EVENT_SUSPENDED = 2,
  3425. BUILDTIMEOUT_SET_EVENT_DISCARD = 3,
  3426. BUILDTIMEOUT_SET_EVENT_RESUME = 4
  3427. } buildtimeout_set_event_t;
  3428. /** Execute the statement <b>stmt</b>, which may log events concerning the
  3429. * connection <b>conn</b>. To prevent infinite loops, disable log messages
  3430. * being sent to controllers if <b>conn</b> is a control connection.
  3431. *
  3432. * Stmt must not contain any return or goto statements.
  3433. */
  3434. #define CONN_LOG_PROTECT(conn, stmt) \
  3435. STMT_BEGIN \
  3436. int _log_conn_is_control; \
  3437. tor_assert(conn); \
  3438. _log_conn_is_control = (conn->type == CONN_TYPE_CONTROL); \
  3439. if (_log_conn_is_control) \
  3440. disable_control_logging(); \
  3441. STMT_BEGIN stmt; STMT_END; \
  3442. if (_log_conn_is_control) \
  3443. enable_control_logging(); \
  3444. STMT_END
  3445. /** Enum describing various stages of bootstrapping, for use with controller
  3446. * bootstrap status events. The values range from 0 to 100. */
  3447. typedef enum {
  3448. BOOTSTRAP_STATUS_UNDEF=-1,
  3449. BOOTSTRAP_STATUS_STARTING=0,
  3450. BOOTSTRAP_STATUS_CONN_DIR=5,
  3451. BOOTSTRAP_STATUS_HANDSHAKE=-2,
  3452. BOOTSTRAP_STATUS_HANDSHAKE_DIR=10,
  3453. BOOTSTRAP_STATUS_ONEHOP_CREATE=15,
  3454. BOOTSTRAP_STATUS_REQUESTING_STATUS=20,
  3455. BOOTSTRAP_STATUS_LOADING_STATUS=25,
  3456. BOOTSTRAP_STATUS_LOADING_KEYS=40,
  3457. BOOTSTRAP_STATUS_REQUESTING_DESCRIPTORS=45,
  3458. BOOTSTRAP_STATUS_LOADING_DESCRIPTORS=50,
  3459. BOOTSTRAP_STATUS_CONN_OR=80,
  3460. BOOTSTRAP_STATUS_HANDSHAKE_OR=85,
  3461. BOOTSTRAP_STATUS_CIRCUIT_CREATE=90,
  3462. BOOTSTRAP_STATUS_DONE=100
  3463. } bootstrap_status_t;
  3464. /********************************* directory.c ***************************/
  3465. /** A pair of digests created by dir_split_resource_info_fingerprint_pairs() */
  3466. typedef struct {
  3467. char first[DIGEST_LEN];
  3468. char second[DIGEST_LEN];
  3469. } fp_pair_t;
  3470. /********************************* dirserv.c ***************************/
  3471. /** An enum to describe what format we're generating a routerstatus line in.
  3472. */
  3473. typedef enum {
  3474. /** For use in a v2 opinion */
  3475. NS_V2,
  3476. /** For use in a consensus networkstatus document (ns flavor) */
  3477. NS_V3_CONSENSUS,
  3478. /** For use in a vote networkstatus document */
  3479. NS_V3_VOTE,
  3480. /** For passing to the controlport in response to a GETINFO request */
  3481. NS_CONTROL_PORT,
  3482. /** For use in a consensus networkstatus document (microdesc flavor) */
  3483. NS_V3_CONSENSUS_MICRODESC
  3484. } routerstatus_format_type_t;
  3485. #ifdef DIRSERV_PRIVATE
  3486. typedef struct measured_bw_line_t {
  3487. char node_id[DIGEST_LEN];
  3488. char node_hex[MAX_HEX_NICKNAME_LEN+1];
  3489. long int bw;
  3490. } measured_bw_line_t;
  3491. #endif
  3492. /********************************* dirvote.c ************************/
  3493. /** Describes the schedule by which votes should be generated. */
  3494. typedef struct vote_timing_t {
  3495. /** Length in seconds between one consensus becoming valid and the next
  3496. * becoming valid. */
  3497. int vote_interval;
  3498. /** For how many intervals is a consensus valid? */
  3499. int n_intervals_valid;
  3500. /** Time in seconds allowed to propagate votes */
  3501. int vote_delay;
  3502. /** Time in seconds allowed to propagate signatures */
  3503. int dist_delay;
  3504. } vote_timing_t;
  3505. /********************************* geoip.c **************************/
  3506. /** Round all GeoIP results to the next multiple of this value, to avoid
  3507. * leaking information. */
  3508. #define DIR_RECORD_USAGE_GRANULARITY 8
  3509. /** Time interval: Flush geoip data to disk this often. */
  3510. #define DIR_ENTRY_RECORD_USAGE_RETAIN_IPS (24*60*60)
  3511. /** How long do we have to have observed per-country request history before
  3512. * we are willing to talk about it? */
  3513. #define DIR_RECORD_USAGE_MIN_OBSERVATION_TIME (12*60*60)
  3514. /** Indicates an action that we might be noting geoip statistics on.
  3515. * Note that if we're noticing CONNECT, we're a bridge, and if we're noticing
  3516. * the others, we're not.
  3517. */
  3518. typedef enum {
  3519. /** We've noticed a connection as a bridge relay or entry guard. */
  3520. GEOIP_CLIENT_CONNECT = 0,
  3521. /** We've served a networkstatus consensus as a directory server. */
  3522. GEOIP_CLIENT_NETWORKSTATUS = 1,
  3523. /** We've served a v2 networkstatus consensus as a directory server. */
  3524. GEOIP_CLIENT_NETWORKSTATUS_V2 = 2,
  3525. } geoip_client_action_t;
  3526. /** Indicates either a positive reply or a reason for rejectng a network
  3527. * status request that will be included in geoip statistics. */
  3528. typedef enum {
  3529. /** Request is answered successfully. */
  3530. GEOIP_SUCCESS = 0,
  3531. /** V3 network status is not signed by a sufficient number of requested
  3532. * authorities. */
  3533. GEOIP_REJECT_NOT_ENOUGH_SIGS = 1,
  3534. /** Requested network status object is unavailable. */
  3535. GEOIP_REJECT_UNAVAILABLE = 2,
  3536. /** Requested network status not found. */
  3537. GEOIP_REJECT_NOT_FOUND = 3,
  3538. /** Network status has not been modified since If-Modified-Since time. */
  3539. GEOIP_REJECT_NOT_MODIFIED = 4,
  3540. /** Directory is busy. */
  3541. GEOIP_REJECT_BUSY = 5,
  3542. } geoip_ns_response_t;
  3543. #define GEOIP_NS_RESPONSE_NUM 6
  3544. /** Directory requests that we are measuring can be either direct or
  3545. * tunneled. */
  3546. typedef enum {
  3547. DIRREQ_DIRECT = 0,
  3548. DIRREQ_TUNNELED = 1,
  3549. } dirreq_type_t;
  3550. /** Possible states for either direct or tunneled directory requests that
  3551. * are relevant for determining network status download times. */
  3552. typedef enum {
  3553. /** Found that the client requests a network status; applies to both
  3554. * direct and tunneled requests; initial state of a request that we are
  3555. * measuring. */
  3556. DIRREQ_IS_FOR_NETWORK_STATUS = 0,
  3557. /** Finished writing a network status to the directory connection;
  3558. * applies to both direct and tunneled requests; completes a direct
  3559. * request. */
  3560. DIRREQ_FLUSHING_DIR_CONN_FINISHED = 1,
  3561. /** END cell sent to circuit that initiated a tunneled request. */
  3562. DIRREQ_END_CELL_SENT = 2,
  3563. /** Flushed last cell from queue of the circuit that initiated a
  3564. * tunneled request to the outbuf of the OR connection. */
  3565. DIRREQ_CIRC_QUEUE_FLUSHED = 3,
  3566. /** Flushed last byte from buffer of the OR connection belonging to the
  3567. * circuit that initiated a tunneled request; completes a tunneled
  3568. * request. */
  3569. DIRREQ_OR_CONN_BUFFER_FLUSHED = 4
  3570. } dirreq_state_t;
  3571. #define WRITE_STATS_INTERVAL (24*60*60)
  3572. /********************************* microdesc.c *************************/
  3573. typedef struct microdesc_cache_t microdesc_cache_t;
  3574. /********************************* networkstatus.c *********************/
  3575. /** Location where we found a v2 networkstatus. */
  3576. typedef enum {
  3577. NS_FROM_CACHE, NS_FROM_DIR_BY_FP, NS_FROM_DIR_ALL, NS_GENERATED
  3578. } v2_networkstatus_source_t;
  3579. /** Possible statuses of a version of Tor, given opinions from the directory
  3580. * servers. */
  3581. typedef enum version_status_t {
  3582. VS_RECOMMENDED=0, /**< This version is listed as recommended. */
  3583. VS_OLD=1, /**< This version is older than any recommended version. */
  3584. VS_NEW=2, /**< This version is newer than any recommended version. */
  3585. VS_NEW_IN_SERIES=3, /**< This version is newer than any recommended version
  3586. * in its series, but later recommended versions exist.
  3587. */
  3588. VS_UNRECOMMENDED=4, /**< This version is not recommended (general case). */
  3589. VS_EMPTY=5, /**< The version list was empty; no agreed-on versions. */
  3590. VS_UNKNOWN, /**< We have no idea. */
  3591. } version_status_t;
  3592. /********************************* policies.c ************************/
  3593. /** Outcome of applying an address policy to an address. */
  3594. typedef enum {
  3595. /** The address was accepted */
  3596. ADDR_POLICY_ACCEPTED=0,
  3597. /** The address was rejected */
  3598. ADDR_POLICY_REJECTED=-1,
  3599. /** Part of the address was unknown, but as far as we can tell, it was
  3600. * accepted. */
  3601. ADDR_POLICY_PROBABLY_ACCEPTED=1,
  3602. /** Part of the address was unknown, but as far as we can tell, it was
  3603. * rejected. */
  3604. ADDR_POLICY_PROBABLY_REJECTED=2,
  3605. } addr_policy_result_t;
  3606. /********************************* rephist.c ***************************/
  3607. /** Possible public/private key operations in Tor: used to keep track of where
  3608. * we're spending our time. */
  3609. typedef enum {
  3610. SIGN_DIR, SIGN_RTR,
  3611. VERIFY_DIR, VERIFY_RTR,
  3612. ENC_ONIONSKIN, DEC_ONIONSKIN,
  3613. TLS_HANDSHAKE_C, TLS_HANDSHAKE_S,
  3614. REND_CLIENT, REND_MID, REND_SERVER,
  3615. } pk_op_t;
  3616. /********************************* rendcommon.c ***************************/
  3617. /** Hidden-service side configuration of client authorization. */
  3618. typedef struct rend_authorized_client_t {
  3619. char *client_name;
  3620. char descriptor_cookie[REND_DESC_COOKIE_LEN];
  3621. crypto_pk_t *client_key;
  3622. } rend_authorized_client_t;
  3623. /** ASCII-encoded v2 hidden service descriptor. */
  3624. typedef struct rend_encoded_v2_service_descriptor_t {
  3625. char desc_id[DIGEST_LEN]; /**< Descriptor ID. */
  3626. char *desc_str; /**< Descriptor string. */
  3627. } rend_encoded_v2_service_descriptor_t;
  3628. /** The maximum number of non-circuit-build-timeout failures a hidden
  3629. * service client will tolerate while trying to build a circuit to an
  3630. * introduction point. See also rend_intro_point_t.unreachable_count. */
  3631. #define MAX_INTRO_POINT_REACHABILITY_FAILURES 5
  3632. /** The maximum number of distinct INTRODUCE2 cells which a hidden
  3633. * service's introduction point will receive before it begins to
  3634. * expire.
  3635. *
  3636. * XXX023 Is this number at all sane? */
  3637. #define INTRO_POINT_LIFETIME_INTRODUCTIONS 16384
  3638. /** The minimum number of seconds that an introduction point will last
  3639. * before expiring due to old age. (If it receives
  3640. * INTRO_POINT_LIFETIME_INTRODUCTIONS INTRODUCE2 cells, it may expire
  3641. * sooner.)
  3642. *
  3643. * XXX023 Should this be configurable? */
  3644. #define INTRO_POINT_LIFETIME_MIN_SECONDS 18*60*60
  3645. /** The maximum number of seconds that an introduction point will last
  3646. * before expiring due to old age.
  3647. *
  3648. * XXX023 Should this be configurable? */
  3649. #define INTRO_POINT_LIFETIME_MAX_SECONDS 24*60*60
  3650. /** Introduction point information. Used both in rend_service_t (on
  3651. * the service side) and in rend_service_descriptor_t (on both the
  3652. * client and service side). */
  3653. typedef struct rend_intro_point_t {
  3654. extend_info_t *extend_info; /**< Extend info of this introduction point. */
  3655. crypto_pk_t *intro_key; /**< Introduction key that replaces the service
  3656. * key, if this descriptor is V2. */
  3657. /** (Client side only) Flag indicating that a timeout has occurred
  3658. * after sending an INTRODUCE cell to this intro point. After a
  3659. * timeout, an intro point should not be tried again during the same
  3660. * hidden service connection attempt, but it may be tried again
  3661. * during a future connection attempt. */
  3662. unsigned int timed_out : 1;
  3663. /** (Client side only) The number of times we have failed to build a
  3664. * circuit to this intro point for some reason other than our
  3665. * circuit-build timeout. See also MAX_INTRO_POINT_REACHABILITY_FAILURES. */
  3666. unsigned int unreachable_count : 3;
  3667. /** (Service side only) Flag indicating that this intro point was
  3668. * included in the last HS descriptor we generated. */
  3669. unsigned int listed_in_last_desc : 1;
  3670. /** (Service side only) Flag indicating that
  3671. * rend_service_note_removing_intro_point has been called for this
  3672. * intro point. */
  3673. unsigned int rend_service_note_removing_intro_point_called : 1;
  3674. /** (Service side only) A digestmap recording the INTRODUCE2 cells
  3675. * this intro point's circuit has received. Each key is the digest
  3676. * of the RSA-encrypted part of a received INTRODUCE2 cell; each
  3677. * value is a pointer to the time_t at which the cell was received.
  3678. * This digestmap is used to prevent replay attacks. */
  3679. digestmap_t *accepted_intro_rsa_parts;
  3680. /** (Service side only) The time at which this intro point was first
  3681. * published, or -1 if this intro point has not yet been
  3682. * published. */
  3683. time_t time_published;
  3684. /** (Service side only) The time at which this intro point should
  3685. * (start to) expire, or -1 if we haven't decided when this intro
  3686. * point should expire. */
  3687. time_t time_to_expire;
  3688. /** (Service side only) The time at which we decided that this intro
  3689. * point should start expiring, or -1 if this intro point is not yet
  3690. * expiring.
  3691. *
  3692. * This field also serves as a flag to indicate that we have decided
  3693. * to expire this intro point, in case intro_point_should_expire_now
  3694. * flaps (perhaps due to a clock jump; perhaps due to other
  3695. * weirdness, or even a (present or future) bug). */
  3696. time_t time_expiring;
  3697. } rend_intro_point_t;
  3698. /** Information used to connect to a hidden service. Used on both the
  3699. * service side and the client side. */
  3700. typedef struct rend_service_descriptor_t {
  3701. crypto_pk_t *pk; /**< This service's public key. */
  3702. int version; /**< Version of the descriptor format: 0 or 2. */
  3703. time_t timestamp; /**< Time when the descriptor was generated. */
  3704. uint16_t protocols; /**< Bitmask: which rendezvous protocols are supported?
  3705. * (We allow bits '0', '1', and '2' to be set.) */
  3706. /** List of the service's introduction points. Elements are removed if
  3707. * introduction attempts fail. */
  3708. smartlist_t *intro_nodes;
  3709. /** Has descriptor been uploaded to all hidden service directories? */
  3710. int all_uploads_performed;
  3711. /** List of hidden service directories to which an upload request for
  3712. * this descriptor could be sent. Smartlist exists only when at least one
  3713. * of the previous upload requests failed (otherwise it's not important
  3714. * to know which uploads succeeded and which not). */
  3715. smartlist_t *successful_uploads;
  3716. } rend_service_descriptor_t;
  3717. /** A cached rendezvous descriptor. */
  3718. typedef struct rend_cache_entry_t {
  3719. size_t len; /**< Length of <b>desc</b> */
  3720. time_t received; /**< When was the descriptor received? */
  3721. char *desc; /**< Service descriptor */
  3722. rend_service_descriptor_t *parsed; /**< Parsed value of 'desc' */
  3723. } rend_cache_entry_t;
  3724. /********************************* routerlist.c ***************************/
  3725. /** Represents information about a single trusted directory server. */
  3726. typedef struct trusted_dir_server_t {
  3727. char *description;
  3728. char *nickname;
  3729. char *address; /**< Hostname. */
  3730. uint32_t addr; /**< IPv4 address. */
  3731. uint16_t dir_port; /**< Directory port. */
  3732. uint16_t or_port; /**< OR port: Used for tunneling connections. */
  3733. char digest[DIGEST_LEN]; /**< Digest of identity key. */
  3734. char v3_identity_digest[DIGEST_LEN]; /**< Digest of v3 (authority only,
  3735. * high-security) identity key. */
  3736. unsigned int is_running:1; /**< True iff we think this server is running. */
  3737. /** True iff this server has accepted the most recent server descriptor
  3738. * we tried to upload to it. */
  3739. unsigned int has_accepted_serverdesc:1;
  3740. /** What kind of authority is this? (Bitfield.) */
  3741. dirinfo_type_t type;
  3742. download_status_t v2_ns_dl_status; /**< Status of downloading this server's
  3743. * v2 network status. */
  3744. time_t addr_current_at; /**< When was the document that we derived the
  3745. * address information from published? */
  3746. routerstatus_t fake_status; /**< Used when we need to pass this trusted
  3747. * dir_server_t to directory_initiate_command_*
  3748. * as a routerstatus_t. Not updated by the
  3749. * router-status management code!
  3750. **/
  3751. } trusted_dir_server_t;
  3752. #define ROUTER_REQUIRED_MIN_BANDWIDTH (20*1024)
  3753. #define ROUTER_MAX_DECLARED_BANDWIDTH INT32_MAX
  3754. /* Flags for pick_directory_server() and pick_trusteddirserver(). */
  3755. /** Flag to indicate that we should not automatically be willing to use
  3756. * ourself to answer a directory request.
  3757. * Passed to router_pick_directory_server (et al).*/
  3758. #define PDS_ALLOW_SELF (1<<0)
  3759. /** Flag to indicate that if no servers seem to be up, we should mark all
  3760. * directory servers as up and try again.
  3761. * Passed to router_pick_directory_server (et al).*/
  3762. #define PDS_RETRY_IF_NO_SERVERS (1<<1)
  3763. /** Flag to indicate that we should not exclude directory servers that
  3764. * our ReachableAddress settings would exclude. This usually means that
  3765. * we're going to connect to the server over Tor, and so we don't need to
  3766. * worry about our firewall telling us we can't.
  3767. * Passed to router_pick_directory_server (et al).*/
  3768. #define PDS_IGNORE_FASCISTFIREWALL (1<<2)
  3769. /** Flag to indicate that we should not use any directory authority to which
  3770. * we have an existing directory connection for downloading server descriptors
  3771. * or extrainfo documents.
  3772. *
  3773. * Passed to router_pick_directory_server (et al)
  3774. *
  3775. * [XXXX NOTE: This option is only implemented for pick_trusteddirserver,
  3776. * not pick_directory_server. If we make it work on pick_directory_server
  3777. * too, we could conservatively make it only prevent multiple fetches to
  3778. * the same authority, or we could aggressively make it prevent multiple
  3779. * fetches to _any_ single directory server.]
  3780. */
  3781. #define PDS_NO_EXISTING_SERVERDESC_FETCH (1<<3)
  3782. #define PDS_NO_EXISTING_MICRODESC_FETCH (1<<4)
  3783. #define _PDS_PREFER_TUNNELED_DIR_CONNS (1<<16)
  3784. /** Possible ways to weight routers when choosing one randomly. See
  3785. * routerlist_sl_choose_by_bandwidth() for more information.*/
  3786. typedef enum bandwidth_weight_rule_t {
  3787. NO_WEIGHTING, WEIGHT_FOR_EXIT, WEIGHT_FOR_MID, WEIGHT_FOR_GUARD,
  3788. WEIGHT_FOR_DIR
  3789. } bandwidth_weight_rule_t;
  3790. /** Flags to be passed to control router_choose_random_node() to indicate what
  3791. * kind of nodes to pick according to what algorithm. */
  3792. typedef enum {
  3793. CRN_NEED_UPTIME = 1<<0,
  3794. CRN_NEED_CAPACITY = 1<<1,
  3795. CRN_NEED_GUARD = 1<<2,
  3796. CRN_ALLOW_INVALID = 1<<3,
  3797. /* XXXX not used, apparently. */
  3798. CRN_WEIGHT_AS_EXIT = 1<<5,
  3799. CRN_NEED_DESC = 1<<6
  3800. } router_crn_flags_t;
  3801. /** Return value for router_add_to_routerlist() and dirserv_add_descriptor() */
  3802. typedef enum was_router_added_t {
  3803. ROUTER_ADDED_SUCCESSFULLY = 1,
  3804. ROUTER_ADDED_NOTIFY_GENERATOR = 0,
  3805. ROUTER_BAD_EI = -1,
  3806. ROUTER_WAS_NOT_NEW = -2,
  3807. ROUTER_NOT_IN_CONSENSUS = -3,
  3808. ROUTER_NOT_IN_CONSENSUS_OR_NETWORKSTATUS = -4,
  3809. ROUTER_AUTHDIR_REJECTS = -5,
  3810. ROUTER_WAS_NOT_WANTED = -6
  3811. } was_router_added_t;
  3812. /********************************* routerparse.c ************************/
  3813. #define MAX_STATUS_TAG_LEN 32
  3814. /** Structure to hold parsed Tor versions. This is a little messier
  3815. * than we would like it to be, because we changed version schemes with 0.1.0.
  3816. *
  3817. * See version-spec.txt for the whole business.
  3818. */
  3819. typedef struct tor_version_t {
  3820. int major;
  3821. int minor;
  3822. int micro;
  3823. /** Release status. For version in the post-0.1 format, this is always
  3824. * VER_RELEASE. */
  3825. enum { VER_PRE=0, VER_RC=1, VER_RELEASE=2, } status;
  3826. int patchlevel;
  3827. char status_tag[MAX_STATUS_TAG_LEN];
  3828. int svn_revision;
  3829. int git_tag_len;
  3830. char git_tag[DIGEST_LEN];
  3831. } tor_version_t;
  3832. #endif