or.h 161 KB

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