or.h 205 KB

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