or.h 177 KB

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